Datasets:

---

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 67

[ "p=0\r\nc=''\r\ns=input()\r\nfor i in range(len(s)):\r\n if p==0:\r\n if s[i]=='.':\r\n c+='0'\r\n elif s[i+1]=='.':\r\n c+='1'\r\n p=1\r\n else:\r\n c+='2'\r\n p=1\r\n else:\r\n p=0\r\nprint(c)", "n=input()\r\nindx = 0 \r\nwhile (indx<len(n)):\r\n if n[indx]=='.':\r\n print(0,end=\"\")\r\n \r\n elif n[indx]=='-':\r\n if n[indx+1]=='.':\r\n print(1,end=\"\")\r\n \r\n else:\r\n print(2,end=\"\")\r\n indx+=1\r\n \r\n indx+=1\r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n ", "o = input()\r\nresult = \"\"\r\np = 0\r\nwhile p < len(o):\r\n if o[p] == \".\":\r\n result += '0'\r\n else:\r\n p += 1\r\n if o[p] == \".\":\r\n result += '1'\r\n else:\r\n result += '2'\r\n p += 1\r\n\r\nprint(result)", "x=input()\r\nx=x.replace('--','2',x.count('--'))\r\nx=x.replace('-.','1',x.count('-.'))\r\nx=x.replace('.','0',x.count('.'))\r\nprint(x)\r\n", "s=input()\r\nls=[]\r\ndef b(s):\r\n if len(s)==0:\r\n return ''\r\n if s[0]=='.':\r\n return '0'+ b(s[1:])\r\n if s[0]=='-' and s[1]=='.':\r\n return '1'+ b(s[2:])\r\n if s[0]=='-' and s[1]=='-':\r\n return '2'+ b(s[2:])\r\nprint(b(s))", "code = input()\r\n\r\ni = 0\r\nn = len(code)\r\nresult = ''\r\nwhile i < n:\r\n if code[i] == '.':\r\n result += '0'\r\n elif code[i] == '-' and code[i+1] == '.':\r\n result += '1'\r\n i += 1\r\n elif code[i] == '-' and code[i+1] == '-':\r\n result += '2'\r\n i += 1\r\n i += 1\r\n\r\nprint(result)\r\n", "n = list(input())\r\nans = []\r\ni = 0\r\nwhile i != len(n):\r\n if n[i] == '.':\r\n ans.append('0')\r\n i += 1\r\n elif n[i + 1] == '-':\r\n ans.append('2')\r\n i += 2\r\n else:\r\n ans.append('1')\r\n i += 2\r\nprint(''.join(ans))", "code = input()\r\ni = 0\r\nans = \"\"\r\nwhile i < (len(code)):\r\n\tif(code[i] == '.'):\r\n\t\tans += '0'\r\n\t\ti+=1\r\n\telse:\r\n\t\tif(i < len(code) and code[i+1] == '.'):\r\n\t\t\tans+= '1'\r\n\t\telse:\r\n\t\t\tans += '2'\r\n\t\ti+=2\r\nprint(ans)\r\n", "n=input()\r\nl=[]\r\np=0\r\nfor i in n:\r\n if i=='-' :\r\n if p==1 :\r\n l.append(2)\r\n p=0\r\n else:\r\n p=1\r\n elif i=='.' :\r\n if p==1:\r\n p=0\r\n l.append(1)\r\n else:\r\n l.append(0)\r\n p=0\r\nfor i in l :\r\n print(i,end=\"\")", "d={\"\":0,\"-\":1,\"--\":2}\r\nc=input()\r\npos=0\r\nl=[]\r\nfor i in range(len(c)):\r\n if c[i]==\".\":\r\n l.append(c[pos:i+1])\r\n pos=i+1 \r\n\r\nfor j in l:\r\n if len(j)%2==0:\r\n l1=(len(j)-2)//2\r\n print(\"2\"*l1,end=\"\")\r\n print(\"1\",end=\"\")\r\n else:\r\n l1=(len(j)-1)//2\r\n print(\"2\"*l1,end=\"\")\r\n print(\"0\",end=\"\")\r\n\r\nif c[len(c)-1]==\"-\":\r\n a=c[pos:]\r\n b=len(a)//2\r\n print(\"2\"*b)\r\n", "string=input()\r\ni=0\r\nwhile i!=len(string):\r\n if string[i]=='.':\r\n print(0,end=\"\")\r\n i=i+1\r\n elif string[i]=='-':\r\n if string[i+1]=='.':\r\n print(1,end=\"\")\r\n i=i+2\r\n elif string[i+1]=='-':\r\n print(2,end=\"\")\r\n i=i+2\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n ", "s=input()\r\nans=\"\"\r\ni=0\r\nwhile(i<len(s)):\r\n\tif(s[i]=='.'):\r\n\t\tans +=str(0)\r\n\t\ti +=1\r\n\telif(s[i:i+2]=='-.'):\r\n\t\tans +=str(1)\r\n\t\ti +=2\r\n\telif(s[i:i+2]=='--'):\r\n\t\tans +=str(2)\r\n\t\ti +=2\r\nprint(ans)", "n=input()\r\ns=\"\"\r\ni=0\r\nwhile i<len(n):\r\n if(n[i]==\".\"):\r\n s+=\"0\"\r\n elif i!= (len(n)-1):\r\n if (n[i+1]==\".\"):\r\n s+=\"1\"\r\n else:\r\n s+=\"2\"\r\n i+=1\r\n i=i+1\r\nprint(s)", "ls=[]\r\nstr=input()\r\nop=\" \"\r\ni=0\r\nwhile i<len(str):\r\n if str[i]=='.':\r\n op=op+\"0\"\r\n if str[i]=='-':\r\n if str[i+1]=='.':\r\n i=i+1\r\n op=op+\"1\"\r\n elif str[i+1]=='-':\r\n i=i+1\r\n op=op+\"2\"\r\n \r\n i=i+1\r\n\r\n\r\n\r\nprint(op) \r\n", "a = input()\r\na = str(a).replace('--','2')\r\na = str(a).replace('-.','1')\r\na = str(a).replace('.','0')\r\nprint(a)\r\n", "i=input()\r\ndef ter(l):\r\n dic={\".\":\"0\",\"-.\":\"1\",\"--\":\"2\"}\r\n if len(l)==0:\r\n return \"\"\r\n if l[0]==\".\":\r\n return \"0\"+ter(l[1:])\r\n else:\r\n if l[0:2]==\"--\" or l[0:2]==\"-.\":\r\n return dic[l[0:2]]+ter(l[2:])\r\nprint(ter(i))", "import math\r\n\r\ncode = list(input())\r\n\r\nn = []\r\n\r\ni = 0\r\nwhile True:\r\n if i >= len(code):\r\n break\r\n if code[i] == '.':\r\n n.append('0')\r\n else:\r\n if code[i+1] == '.':\r\n n.append('1')\r\n elif code[i+1] == '-':\r\n n.append('2')\r\n i += 1\r\n i += 1\r\n\r\nprint(''.join(n))", "s=input()\nd={'.':'0','-.':'1','--':'2'}\nans=\"\"\ncur=\"\"\nfor i in s:\n\tcur+=i\n\tif cur in d.keys():\n\t\tans+=d[cur]\n\t\tcur=\"\"\nprint(ans)\n", "ch=input()\r\nch1=\".\"\r\nch2=\"-.\"\r\nch3=\"--\"\r\nif(ch3 in ch):\r\n ch=ch.replace(ch3,'2')\r\nif(ch2 in ch):\r\n ch=ch.replace(ch2,'1')\r\nif(ch1 in ch):\r\n ch=ch.replace(ch1,'0')\r\nprint(ch)", "x,p,i=str(input()),\"\",0\r\nwhile 1:\r\n if x[i]=='.':\r\n p+=\"0\"\r\n i+=1\r\n elif x[i]=='-':\r\n if x[i+1]=='-':p+=\"2\"\r\n else:p+=\"1\"\r\n i+=2\r\n if i==len(x):break\r\nprint(p)", "x = input()\r\nalph = \"\"\r\ni = 0\r\n\r\nwhile i < len(x):\r\n if x[i] == '-':\r\n if x[i + 1] == '.':\r\n alph += '1'\r\n elif x[i + 1] == '-':\r\n alph += '2'\r\n i += 2\r\n\r\n else:\r\n alph += '0'\r\n i += 1\r\n\r\nprint(alph)\r\n\r\n", "a = input()\r\nres = \"\"\r\nc = 0\r\nwhile c < len(a):\r\n if a[c:c + 2] == \"--\":\r\n res += \"2\"\r\n c += 2\r\n elif a[c:c + 2] == \"-.\":\r\n res += \"1\"\r\n c += 2\r\n else:\r\n res += \"0\"\r\n c += 1\r\n\r\nprint(res)\r\n", "import re\r\n\r\na = input()\r\n\r\na = re.sub('--' , '2' , a)\r\na = re.sub('-.' , '1' , a)\r\n\r\n\r\nfor i in a:\r\n if i == '.':\r\n print('0' , end = '')\r\n else:\r\n print(str(i) , end = '')\r\n", "s=input()\r\ni=0\r\na=[]\r\nwhile(i!=len(s)):\r\n if(s[i]==\".\"):\r\n a.append(0)\r\n i+=1\r\n elif(s[i]==\"-\" and s[i+1]==\".\"):\r\n a.append(1)\r\n i+=2\r\n elif(s[i]==\"-\" and s[i+1]==\"-\"):\r\n a.append(2)\r\n i+=2\r\ns=\"\".join(str(e) for e in a)\r\nprint(s)", "arr = input()\r\nN = len(arr)\r\nout = []\r\ni = 0\r\nwhile i < N:\r\n if arr[i] == \".\":\r\n out.append(\"0\")\r\n i += 1\r\n elif arr[i] == \"-\" and arr[i+1] == \".\":\r\n out.append(\"1\")\r\n i += 2\r\n elif arr[i] == \"-\" and arr[i+1] == \"-\":\r\n out.append(\"2\")\r\n i += 2\r\n\r\nprint(\"\".join(out))", "st = input()\r\ni = 0\r\nwhile i < len(st):\r\n if st[i] == '.':\r\n print(0, end=\"\")\r\n i += 1\r\n elif st[i] == '-':\r\n if st[i+1] == '.':\r\n print(1, end='')\r\n else:\r\n print(2, end='')\r\n i += 2", "'''\r\ndef num_arrange (arrange,arrange_sorted,num_soldier):\r\n num_moves=0\r\n for i in range(num_soldier):\r\n num_moves +=abs(arrange.index(arranged_solider[i])-i)\r\n arranged_solider[i]=-1\r\n\r\n return int(num_moves/2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nsoldier=list(map(int,input().split()))\r\narranged_solider=sorted(soldier,reverse=True)\r\nprint(num_arrange(soldier,arranged_solider,n))\r\n'''\r\n'''\r\nrow,cols=(5,5)\r\n\r\narr=[[0]*cols]*row\r\n#print(arr)\r\n\r\n\r\nstri=['--','-.','.']\r\ninp=input()\r\nle=len(inp)\r\nout=\"\"\r\nfor i in stri:\r\n j=0\r\n while(j<le):\r\n pos=inp.find(i,j,le)\r\n if pos != -1:\r\n length=len(i)\r\n out= str(3-(pos+1))\r\n print(\"the out\",out)\r\n\r\n inp=inp[:pos] + '*' +inp[(pos+1):]\r\n j = j + (length-1)\r\n inp=inp[:j] + '*' +inp[(j+1):]\r\n print(\"the in input\",inp)\r\n j += 1\r\nprint(out)\r\n'''\r\ninp=list(input())\r\nle=len(inp)\r\nout=\"\"\r\nfor i in range(le):\r\n if inp[i]=='.':\r\n out += '0'\r\n inp[i]='*'\r\n elif inp [i]=='-' and inp[i+1]=='.':\r\n inp[i]='*'\r\n inp[i+1]='*'\r\n out +='1'\r\n elif inp [i]=='-' and inp[i+1]=='-':\r\n inp[i]='*'\r\n inp[i+1]='*'\r\n out +='2'\r\n #(inp,i)\r\n #print(out)\r\nprint(out)\r\n", "s = input()\r\ni = 0\r\ns1 = \"\"\r\nwhile i != len(s):\r\n if s[i] == \".\":\r\n s1 += \"0\"\r\n i += 1\r\n elif s[i:i+2] == \"-.\":\r\n s1 += \"1\"\r\n i += 2\r\n elif s[i:i+2] == \"--\":\r\n s1 += \"2\"\r\n i += 2\r\n\r\nprint(s1)", "borze_text = str(input())\r\nborze = list(borze_text)\r\ntxt = \"\"\r\ni = 0\r\nwhile len(borze) > i:\r\n if borze[i] == \".\":\r\n txt += \"0\"\r\n elif borze[i] == \"-\" and borze[i+1] == \".\":\r\n txt += \"1\"\r\n i += 1\r\n elif borze[i] == \"-\" and borze[i + 1] == \"-\":\r\n txt += \"2\"\r\n i += 1\r\n i += 1\r\nprint(txt)\r\n", "s = input()\r\nn=len(s)\r\nA = []\r\n\r\ni = 0\r\nwhile i < n:\r\n if s[i] == '.':\r\n A.append('0')\r\n i += 1\r\n else:\r\n A.append('2' if (i + 1 < n) and (s[i + 1] == '-') else '1')\r\n i += 2\r\nprint(\"\".join(A))", "def borze():\r\n s=input()\r\n size=len(s)\r\n i=0\r\n ans=''\r\n while i<size:\r\n if s[i]=='.':\r\n ans=ans+'0'\r\n i=i+1\r\n elif s[i]=='-':\r\n if s[i:i+2]=='-.':\r\n ans=ans+'1'\r\n i=i+2\r\n elif s[i:i+2]=='--':\r\n ans=ans+'2'\r\n i=i+2\r\n print(ans)\r\n\r\nborze()\r\n\r\n\r\n\r\n\r\n\r\n", "\n\"\"\"\nCreated on Fri Jan 8 09:33:24 2021\n\n@author: king\n\"\"\"\ni=0\ncode=list(input())\nwhile len(code)>i:\n if code[i]==\".\":\n print(\"0\",end=\"\")\n i+=1\n elif code[i]==\"-\" and code[i+1]==\".\":\n print(\"1\",end=\"\")\n i+=2\n elif code[i]==\"-\" and code[i+1]==\"-\":\n print(\"2\",end=\"\")\n i+=2", "flag = True\r\ns = input()\r\nwhile flag == True:\r\n if '--' in s:\r\n s = s.replace('--', '2')\r\n elif '-.' in s:\r\n s = s.replace('-.', '1')\r\n elif '.' in s:\r\n s = s.replace('.', '0')\r\n else:\r\n flag = False\r\nprint(s)", "n = list(input())\r\nnumlist = []\r\nfor i in range(len(n)):\r\n if n[i] == '.':\r\n numlist.append('0')\r\n elif n[i] == '-' and n[i+1] == '.':\r\n numlist.append('1')\r\n n[i+1] = 'L'\r\n elif n[i] == '-' and n[i+1] == '-':\r\n numlist.append('2')\r\n n[i+1] = 'L'\r\nprint(''.join(numlist))", "s = input()\r\na=[]\r\nc=0\r\nfor i in range((len(s))):\r\n if c==1:\r\n c=0\r\n continue\r\n if s[i] == '.':\r\n a.append(0)\r\n elif s[i] == '-':\r\n if s[i+1] == '.':\r\n a.append(1)\r\n elif s[i+1] == '-':\r\n a.append(2)\r\n c=1\r\n\r\nb=''.join([str(j)for j in a])\r\nprint(b)", "sn=input()\r\n\r\nj=0\r\n\r\nwhile j<len(sn):\r\n\tif sn[j]=='-' and sn[j+1]=='-':\r\n\t\tprint(\"2\",end=\"\")\r\n\t\tj+=2\r\n\telif sn[j]=='-' and sn[j+1]=='.':\r\n\t\tprint(\"1\",end=\"\")\r\n\t\tj+=2\r\n\telse:\r\n\t\tprint(\"0\",end=\"\")\r\n\t\tj+=1", "t = \"\"\r\none = '-.'\r\ntwo = '--'\r\nzero = '.'\r\ntemp = \"\"\r\nexp = input().strip()\r\nlenth = len(exp)\r\ni = 0\r\nwhile(i<lenth):\r\n\ttemp = \"\"\r\n\ttemp += exp[i]\r\n\tif(temp==\"-\"):\r\n\t\ti += 1\r\n\t\ttemp += exp[i]\r\n\t\tif(temp==one):\r\n\t\t\tt += '1'\r\n\t\telse:\r\n\t\t\tt += '2'\r\n\telse:\r\n\t\tif(temp==zero):\r\n\t\t\tt += '0'\r\n\ti += 1\r\n\r\nprint(t)", "y=(input())\r\ny=y.replace('--','2')\r\ny=y.replace('-.','1')\r\ny=y.replace('.','0')\r\nprint(y)", "s = input()\r\ni = 0\r\nfs = \"\"\r\nwhile i < len(s):\r\n if s[i] == \".\":\r\n fs += \"0\"\r\n i += 1\r\n else:\r\n sub = (s[i]+s[i+1])\r\n if sub == \"-.\":\r\n fs += \"1\"\r\n elif sub == \"--\":\r\n fs += \"2\"\r\n i += 2\r\n\r\nprint(fs)", "inp = input()\r\n# for i in range(len(inp)):\r\ni = 0\r\nans = ''\r\nwhile i<len(inp):\r\n if inp[i]==\".\":\r\n ans += \"0\"\r\n i += 1\r\n elif inp[i+1]==\".\":\r\n ans += \"1\"\r\n i += 2\r\n else:\r\n ans += \"2\"\r\n i += 2\r\nprint(ans)", "s=input()\r\ns1=''\r\ni=0\r\nl=len(s)\r\nwhile(l>0):\r\n if s[i]=='.':\r\n s1+=\"0\"\r\n elif s[i]=='-' and s[i+1]=='.':\r\n s1+=\"1\"\r\n i+=1\r\n l-=1\r\n elif s[i]=='-' and s[i+1]=='-':\r\n s1+=\"2\"\r\n i+=1\r\n l-=1\r\n i+=1\r\n l-=1\r\nprint(s1)", "s=input()\r\nk=\"\"\r\nj=0\r\n\r\nwhile j<len(s) :\r\n if s[j]==\".\" :\r\n k+=\"0\"\r\n j+=1\r\n elif s[j]==\"-\" and s[j+1]==\".\" :\r\n k+=\"1\"\r\n j+=2\r\n elif s[j]==\"-\" and s[j+1]==\"-\" :\r\n k+=\"2\"\r\n j+=2\r\nprint(k)\r\n\r\n\r\n\r\n", "x = input()\r\ns1,i = \"\",0\r\nwhile (i < len(x)-1):\r\n\tif x[i] == \".\":\r\n\t\ts1+= \"0\"\r\n\t\ti+=1\r\n\telif x[i]==\"-\" and x[i+1]==\".\":\r\n\t\ts1+='1'\r\n\t\ti+=2\r\n\telif x[i]==\"-\" and x[i+1]==\"-\":\r\n\t\ts1 += \"2\"\r\n\t\ti+= 2\r\nif i <len(x):\r\n\ts1 +=\"0\"\r\nprint(s1)\r\n", "string=input()\r\nemp=''\r\ni,j=0,1\r\nwhile i<len(string) or j<len(string):\r\n if string[i]=='.':\r\n emp+='0'\r\n i+=1\r\n j+=1\r\n else:\r\n if string[i]=='-' and string[j]=='.':\r\n emp+='1'\r\n else:\r\n emp+='2'\r\n i+=2\r\n j+=2\r\nprint(emp)", "s = input()\r\nd = {'.':'0', '-.':'1', '--':'2'}\r\nans = ''\r\nk = 0\r\nwhile k < len(s):\r\n if s[k] in d:\r\n ans += d[s[k]]\r\n k += 1\r\n else:\r\n ans += d[s[k] + s[k+1]]\r\n k += 2\r\nprint(ans)", "encoded = input()\r\ndecoded = \"\"\r\nwhile len(encoded) != 0:\r\n if encoded[0] == '.':\r\n decoded += '0'\r\n encoded = encoded[1:]\r\n elif encoded[:2] == '-.':\r\n decoded += '1'\r\n encoded = encoded[2:]\r\n elif encoded[:2] == '--':\r\n decoded += '2'\r\n encoded = encoded[2:]\r\nprint(decoded)", "code = input()\r\n\r\ni = 0\r\n\r\nwhile i < len(code):\r\n\r\n if(i == len(code) - 1):\r\n print(\"0\")\r\n break\r\n\r\n if code[i] == '-' and code[i+1] == '.':\r\n print(\"1\", end = '')\r\n i = i + 1\r\n elif code[i] == '-' and code[i+1] == '-':\r\n print(\"2\", end = '')\r\n i = i + 1\r\n else:\r\n print(\"0\", end = '')\r\n\r\n i = i + 1", "#Borze\n#Problem Link : http://codeforces.com/problemset/problem/32/B\n\ncode = input()\nletter = []\nfor c in code:\n letter.append(c)\n s = ''.join(letter)\n if s == '.':\n print(0 , end='')\n letter = []\n elif s == '-.':\n print(1 , end='')\n letter = []\n elif s == '--':\n print(2 , end='')\n letter = []", "code=list(input())\r\ni=0\r\nwhile i<len(code):\r\n if code[i]=='-' and code[i+1]=='.':\r\n print('1',end='')\r\n i+=2\r\n elif code[i]=='-' and code[i+1]=='-':\r\n print('2',end='')\r\n i+=2\r\n else:\r\n print('0',end='')\r\n i+=1\r\nprint('\\n')", "def main():\r\n s = input()\r\n s=s.replace(\"--\",\"2\")\r\n s=s.replace(\"-.\",\"1\")\r\n s=s.replace(\".\",\"0\")\r\n print(s)\r\nif __name__ == '__main__':\r\n main()\r\n", "j = input()\r\nres = \"\"\r\ni = 0\r\nwhile i < len(j):\r\n if j[i] == \".\":\r\n res += '0'\r\n else:\r\n i += 1\r\n if j[i] == \".\":\r\n res += '1'\r\n else:\r\n res += '2'\r\n i += 1\r\n\r\nprint(res)\r\n", "s = input()\r\n\r\nln = len(s)\r\n\r\nk = 0\r\nwhile k < ln:\r\n try:\r\n if s[k] == s[k + 1] == '-':\r\n k += 2\r\n print(2, end='')\r\n elif s[k] == '-' and s[k + 1] == '.':\r\n k += 2\r\n print(1, end='')\r\n else:\r\n k += 1\r\n print(0, end='')\r\n except IndexError:\r\n k += 1\r\n print(0, end='')\r\n", "str=input()\r\nn=len(str)\r\ni=0\r\nwhile i<n:\r\n\tif str[i]=='.':\r\n\t\tprint(0,end=\"\")\r\n\t\ti+=1\r\n\telif str[i]=='-' and str[i+1]=='.':\r\n\t\tprint(1,end=\"\")\r\n\t\ti+=2\r\n\telif str[i]=='-' and str[i+1]=='-':\r\n\t\tprint(2,end=\"\")\r\n\t\ti+=2", "s = input()\r\nd = \"\"\r\nind = 0\r\nwhile ind < len(s) - 1:\r\n if s[ind] == \".\":\r\n d += \"0\"\r\n ind += 1\r\n elif s[ind] == \"-\" and s[ind + 1] == \".\":\r\n d += \"1\"\r\n ind += 2\r\n elif s[ind] == \"-\" and s[ind + 1] == \"-\":\r\n d += \"2\"\r\n ind += 2\r\nif ind != len(s):\r\n d += \"0\"\r\nprint(d)", "a=list(input())\r\nf=''\r\nwhile len(a) > 0:\r\n if a[0]=='.':\r\n a.pop(0)\r\n f=f+'0'\r\n elif a[0] == '-' and a[1] == '.':\r\n del a[0:2]\r\n f=f+'1'\r\n else:\r\n del a[0:2]\r\n f=f+'2'\r\nprint(f)", "string = input()\r\n\r\nlength = len(string)\r\nrs = ''\r\ni = 0\r\n\r\nwhile i < length:\r\n if string[i] == '.':\r\n rs += '0'\r\n if string[i] == '-':\r\n if string[i + 1] == '.':\r\n rs += '1'\r\n else:\r\n rs += '2'\r\n i += 1\r\n i += 1\r\n\r\nprint(rs)\r\n", "n1=input()\r\nn=[]\r\nfor i in n1:\r\n n.append(i)\r\n \r\nl=len(n)\r\nlst=[]\r\nlst1=[]\r\n\r\nfor i in range(l):\r\n if len(lst1)-1==i:\r\n continue\r\n elif n[i]=='.':\r\n lst.append(0)\r\n lst1.append(n[i])\r\n elif n[i]=='-' and n[i+1]=='-':\r\n lst.append(2)\r\n lst1.append(n[i])\r\n lst1.append(n[i+1])\r\n \r\n elif n[i]=='-' and n[i+1]=='.':\r\n lst.append(1)\r\n lst1.append(n[i])\r\n lst1.append(n[i+1])\r\n \r\n \r\nfor i in lst:\r\n print(i,end='')", "s = input()\nr = ''\ni = 0\nwhile i < len(s):\n\tif s[i] == '.':\n\t\tr += '0'\n\t\ti += 1\n\telif s[i] == '-':\n\t\tif s[i + 1] == '.':\n\t\t\tr += '1'\n\t\telif s[i + 1] == '-':\n\t\t\tr += '2'\n\t\ti += 2\nprint(r)\n", "s=input()\r\ni=0\r\nfor j in range(len(s)):\r\n if i>=len(s):\r\n break\r\n else:\r\n if s[i]=='-'and s[i+1]=='.':\r\n i+=2\r\n print('1',end='')\r\n elif s[i]=='-'and s[i+1]=='-':\r\n i+=2\r\n print(\"2\",end='')\r\n elif s[i]=='.':\r\n i+=1\r\n print('0',end='')", "s = input()\r\ni = 0\r\nans = \"\"\r\nwhile i<len(s):\r\n if s[i] == \".\":\r\n ans+=\"0\"\r\n elif s[i] == \"-\":\r\n if s[i+1] == \"-\":\r\n ans+=\"2\"\r\n else:\r\n ans+=\"1\"\r\n i+=1\r\n i+=1\r\nprint(ans)", "s = input()\r\nlist = []\r\ni = 0\r\nwhile True:\r\n if i<=len(s)-2 and s[i]==\"-\" and s[i+1]==\"-\":\r\n list.append(\"2\")\r\n i += 2\r\n elif i<=len(s)-2 and s[i]==\"-\" and s[i+1]==\".\":\r\n list.append(\"1\")\r\n i += 2\r\n elif i<=len(s)-1 and s[i]==\".\":\r\n list.append(\"0\")\r\n i += 1\r\n else:\r\n break\r\na = ''.join([str(elem) for elem in list])\r\nprint(a)", "s1=input()\r\nwhile '--' in s1:\r\n s1=s1.replace('--','2')\r\nwhile '-.' in s1:\r\n s1=s1.replace('-.','1')\r\n\r\nwhile '.' in s1:\r\n s1=s1.replace('.','0')\r\nprint(s1)", "s = input()\r\ni = 0\r\nstring =''\r\nwhile i<len(s):\r\n if i<len(s)-1 and s[i]=='-' and s[i+1]=='-':\r\n string += '2'\r\n i += 1\r\n elif i<len(s)-1 and s[i]=='-' and s[i+1]=='.':\r\n string += '1'\r\n i += 1\r\n elif s[i]=='.':\r\n string += '0'\r\n i += 1\r\nprint(string)", "from cmath import inf\r\nfrom re import T, X\r\nimport math\r\nfrom tkinter import N, Y\r\n\r\n\r\ndef swap(a,b):\r\n a = a^b\r\n b = a^b\r\n a = a^b\r\n return a,b\r\n # call using a,b = swap(a,b)\r\ndef even(a):\r\n if a&1:\r\n return False\r\n return True\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef lcm(x, y):\r\n lcm = (x*y) // gcd(x,y)\r\n return lcm\r\n\r\n# it will return index of \"key\" in \"sorted list\". \r\ndef BS_elemPosi(low, high, key, li): \r\n while low<high:\r\n mid = (low+high)//2\r\n if li[mid]<=key:\r\n low = mid+1\r\n else:\r\n high = mid\r\n return low\r\n \r\n###########################(CODE)##################################\r\n# 0 -> .\r\n# 1 -> -.\r\n# 2 -> --\r\ns = input()\r\ni = 0\r\nans = \"\"\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n ans+=\"0\"\r\n elif s[i]==\"-\":\r\n if (i+1)<len(s):\r\n if s[i+1]==\".\":\r\n ans+=\"1\"\r\n i+=1\r\n elif s[i+1]==\"-\":\r\n ans+=\"2\"\r\n i+=1\r\n \r\n i+=1\r\nprint(ans)\r\n#####################################################################", "decode = input()\r\n\r\n\r\nstring = \"\"\r\noutput = \"\"\r\n\r\nfor char in decode:\r\n\r\n string += char\r\n\r\n if string == \".\":\r\n output += \"0\"\r\n string = \"\"\r\n\r\n elif string == \"-.\":\r\n output += \"1\"\r\n string = \"\"\r\n\r\n elif string == \"--\":\r\n output += \"2\"\r\n string = \"\"\r\n\r\n\r\nprint(output)\r\n", "n=input()\r\nz=n.replace(\"--\",\"2\")\r\nz=z.replace(\"-.\",\"1\")\r\nz=z.replace(\".\",\"0\")\r\nprint(z)", "s = input()\n\no = ''\n\nn = len(s)\ni = 0\nwhile(i<n):\n if s[i] == '.':\n o += '0'\n else:\n if s[i+1] == '.':\n o += '1'\n else:\n o += '2'\n i+=1\n i += 1\n\nprint(o) ", "s = input()\r\nbr = ''\r\n\r\nif s[0] == '.':\r\n br = '0'\r\n\r\nl = [0 for i in range(len(s))]\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] == '.':\r\n if s[i - 1] == '-' and l[i - 1] == 0:\r\n br += '1'\r\n l[i - 1] = 1\r\n else:\r\n br += '0'\r\n\r\n l[i] = 1\r\n \r\n else:\r\n if s[i - 1] == '-' and l[i - 1] == 0:\r\n br += '2'\r\n l[i - 1] = 1\r\n l[i] = 1\r\n\r\nprint(br)\r\n", "n = input()\r\nx = list(n)\r\ns = ''\r\ni = 0\r\nwhile i < len(n):\r\n if x[i] == '.':\r\n s += '0'\r\n i += 1\r\n elif x[i] == '-' and x[i+1] == '.':\r\n s += '1'\r\n i += 2\r\n elif x[i] == '-' and x[i+1] == '-':\r\n s += '2'\r\n i += 2\r\nprint(s)", "s=input()\r\na=s.replace(\"--\",\"2\")\r\nb=a.replace(\"-.\",\"1\")\r\nc=b.replace(\".\",\"0\")\r\nprint(c)\r\n", "s=input()\r\nl=[]\r\ni=0\r\nwhile(i<=len(s)-1):\r\n if(s[i]=='.'):\r\n l.append('0')\r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n l.append('1')\r\n i=i+1\r\n elif(s[i]=='-' and s[i+1]=='-'):\r\n l.append('2')\r\n i=i+1\r\n i=i+1\r\nfor i in l:\r\n print(i,end=\"\")\r\n", "import sys\r\n\r\ns = sys.stdin.readline().strip()\r\noutput = []\r\ni = 0\r\nwhile i < len(s):\r\n if s[i:i+2] == '--':\r\n output.append('2')\r\n i += 2\r\n elif s[i:i+2] == '-.':\r\n output.append('1')\r\n i += 2\r\n else:\r\n output.append('0')\r\n i += 1\r\nsys.stdout.write(''.join(output) + '\\n')\r\n", "n = input()\r\nlst = [x for x in n]\r\n\r\nans= []\r\n\r\n# . = 0\r\n# -. = 1\r\n# -- = 2\r\nfor i in range(len(lst)) :\r\n if lst[i] == '.':\r\n ans.append('0')\r\n lst[i]=0\r\n elif lst[i] == '-' and lst[i+1] == '-':\r\n ans.append('2')\r\n lst[i]=0\r\n lst[i+1]=0\r\n elif lst[i] == '-' and lst[i+1]=='.':\r\n ans.append('1')\r\n lst[i]=0\r\n lst[i+1]=0 \r\n\r\nres=''\r\nres = res.join(ans) \r\nprint(res)\r\n", "n=input()\r\ndic={'-.':'1','--':'2'}\r\nans=''\r\ni=0\r\nj=1\r\nwhile(i<len(n)):\r\n if n[i:j+1] in dic:\r\n ans+=dic[n[i:j+1]]\r\n i+=2\r\n j+=2\r\n elif n[i]=='.':\r\n ans+='0'\r\n i+=1\r\n j+=1\r\nprint(ans)\r\n \r\n \r\n", "s=\"\"\r\nl=list(input())\r\ni=0\r\nwhile(i<len(l)):\r\n if(l[i]==\".\"):\r\n s+=\"0\"\r\n i+=1\r\n elif l[i]=='-' and l[i+1]=='.':\r\n s+=\"1\"\r\n i+=2\r\n elif l[i]=='-' and l[i+1]=='-':\r\n s+=\"2\"\r\n i+=2 \r\nprint(s)", "s = list(input())\r\nnews = ''\r\nt = 0\r\nwhile True:\r\n if s[t] == '-':\r\n if s[t + 1] == '.':\r\n news += '1'\r\n if s[t + 1] == '-':\r\n news += '2'\r\n t += 2\r\n else:\r\n news += '0'\r\n t += 1\r\n if t == len(s):\r\n break\r\nprint(news)", "s=input()\r\nk=''\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n k+='0'\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n k+='1'\r\n elif s[i+1]=='-':\r\n k+='2'\r\n i+=2\r\nprint(k)\r\n\r\n", "a = input()\r\nb = str(a)\r\nc = list(b)\r\nn = len(c)\r\nr = ''\r\ni = 0\r\n\r\nwhile n > 0:\r\n\r\n if c[i] == '.':\r\n r += str(0)\r\n\r\n elif c[i] == '-' and c[i+1] == '.':\r\n r += str(1)\r\n i += 1\r\n n -= 1\r\n\r\n elif c[i] == '-' and c[i+1] == '-':\r\n r += str(2)\r\n i += 1\r\n n -= 1\r\n\r\n i += 1\r\n n -= 1\r\n\r\nprint(r)\r\n\r\n# .-.--\r\n\r\n# ['.', '-', '.', '-', '-']\r\n", "mot = input()\r\n\r\n\r\ncode = ''\r\nwhile mot != \"\": \r\n if mot[0] == '.':\r\n code += '0'\r\n mot = mot[1:]\r\n elif mot[1] == '.':\r\n code += '1'\r\n mot = mot[2:]\r\n else:\r\n code += '2'\r\n mot = mot[2:]\r\n\r\nprint(code)", "a=input()\r\ns=list(a)\r\ncount=\"\"\r\nj=0\r\n\r\nwhile(j<len(s)):\r\n \r\n if s[j]==\"-\" and s[j+1]==\".\" and j != len(s)-1:\r\n count+=\"1\"\r\n j+=2\r\n elif s[j]==\"-\" and s[j+1]==\"-\" and j != len(s)-1:\r\n count+=\"2\"\r\n j+=2\r\n else:\r\n count+='0'\r\n j+=1\r\n\r\n \r\nprint(count)\r\n ", "def main():\r\n s = input()\r\n return s.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(main())\r\n", "# cook your dish here\r\nstring = str(input())\r\nsize = len(string)\r\nlst=[]\r\ni=0\r\nwhile i<size:\r\n if i== size-1:\r\n if string[i] == '.':\r\n lst.append(0)\r\n elif string[i] == '.':\r\n lst.append(0)\r\n elif string[i]== '-' and string[i+1] == '.':\r\n lst.append(1)\r\n i+=1\r\n elif string[i]== '-' and string[i+1] == '-':\r\n lst.append(2)\r\n i+=1\r\n \r\n i+=1\r\n\r\nprint(\"\".join(map(str,lst)))\r\n\r\n ", "s=str(input())\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.': print('0',end=''); i+=1\r\n elif s[i:i+2]=='--': print('2',end=''); i+=2\r\n else: print('1',end=''); i+=2", "n = input()\r\nans = ''\r\na = 0\r\nfor i in n:\r\n if i == '-':\r\n ans += '2'*a\r\n a = not a\r\n else:\r\n ans += '0'*(not a)\r\n ans += '1'*a\r\n a = a and (not a)\r\nprint(ans)\r\n", "s = input()\r\nout = ''\r\ni = 0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n out += '0'\r\n i += 1\r\n else:\r\n if s[i+1]=='.':\r\n out += '1'\r\n else:\r\n out += '2'\r\n i += 2\r\nprint(out)", "t = input()\r\ni = 0\r\nans = \"\"\r\nwhile i < len(t):\r\n if t[i] =='.':\r\n ans = ans +\"0\"\r\n else:\r\n i+=1 \r\n if t[i] == '.':\r\n ans = ans + \"1\"\r\n else:\r\n ans = ans +\"2\"\r\n i+=1\r\nprint(ans)", "str1=str(input())\r\nlst=\"\"\r\ni=0\r\nwhile(i<len(str1)):\r\n\tif(str1[i]=='.'):\r\n\t\tlst=lst+\"0\"\r\n\t\ti=i+1\r\n\t\t\r\n\telif(str1[i]=='-'):\r\n\t if(str1[i+1]=='.'):\r\n\t \tlst=lst+\"1\"\r\n\t \ti=i+2\r\n\t else:\r\n\t \tlst=lst+\"2\"\r\n\t \ti=i+2\r\nprint(\"\".join(lst))\r\n\r\n\r\n", "string = input()\r\ni = 0\r\nnum = \"\"\r\nwhile i < len(string):\r\n if string[i] == \".\":\r\n num += \"0\"\r\n i += 1\r\n elif string[i] == \"-\":\r\n if string[i + 1] == \".\":\r\n num += \"1\"\r\n else:\r\n num += \"2\"\r\n i +=2\r\nprint (num)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Mar 27 20:52:17 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\ns = input()\r\nc = 0\r\nx = True\r\nans = \"\"\r\nwhile x == True:\r\n if c < len(s):\r\n if s[c] == \".\":\r\n ans += \"0\"\r\n c += 1\r\n elif s[c] == \"-\":\r\n if s[c + 1] == \".\":\r\n ans += \"1\"\r\n c += 2\r\n else:\r\n ans += \"2\"\r\n c += 2\r\n else:\r\n x = False\r\nprint(ans)\r\n \r\n ", "# import os\r\n\r\ns = input()\r\nd = {'.':'0', '-.': '1', '--': '2'}\r\nr = ''\r\n\r\n\r\nwhile s:\r\n if s[0] == '.':\r\n r += d['.']\r\n s = s[1:]\r\n else:\r\n r += d[s[:2]]\r\n s = s[2:]\r\n \r\nprint(r)\r\n\r\n# 03/01 - 1\r\n# 04/01 - 21\r\n# 05/01 - 25\r\n\r\n", "string = input()\r\n\t \r\ntotal = ''\r\nsumm = 0\r\n\t \r\nfor s in string:\r\n if s == '-':\r\n summ += 1\r\n if summ == 2:\r\n total += str(summ)\r\n summ = 0\r\n\r\n\r\n elif s == '.':\r\n total += str(summ)\r\n summ = 0\r\n\r\nif summ != 0:\r\n total += str(summ)\r\n summ = 0\r\n\r\nprint(total) ", "s = str(input())\ns = s.replace('--', '2')\ns = s.replace('-.', '1')\ns = s.replace('.', '0')\nprint(s)\n", "str = input()\n\nflag = False\nans =''\n\nfor i in str:\n if flag:\n if i == '.':\n ans += '1'\n if i == '-':\n ans += '2'\n flag = False\n continue;\n if i == '.':\n ans += '0'\n elif i == '-':\n # print('enter')\n flag = True\nprint(ans)\n", "s=str(input())\r\ns=list(s)\r\ni=0\r\ns1=\"\"\r\nn=len(s)\r\nwhile i<=(len(s)-1):\r\n if s[i]=='.':\r\n i+=1\r\n s1+='0'\r\n elif s[i]=='-' and s[i+1]=='.':\r\n i+=2\r\n s1+='1'\r\n elif s[i]=='-' and s[i+1]=='-':\r\n i+=2\r\n s1+='2'\r\nprint(s1)", "s=input()\r\nlist=[]\r\ni=0\r\nwhile i<len(s):\r\n if s[i:].startswith(\"-.\"):\r\n if i==len(s)-2:\r\n list.append(1)\r\n break\r\n else:\r\n list.append(1)\r\n i=i+2\r\n elif s[i:].startswith(\"--\"):\r\n if i==len(s)-2:\r\n list.append(2)\r\n break\r\n else:\r\n list.append(2)\r\n i=i+2\r\n elif s[i:].startswith(\".\"):\r\n list.append(0)\r\n i+=1\r\nfor item in list:\r\n print(item,end=\"\")", "s=input()\r\n# i j\r\n#s= ' - . . - . - -'\r\n# 0 1 2 3 4 5 6\r\ni=0\r\nj=2\r\nss=\"\"\r\nwhile(i<=len(s)-1):\r\n if(s[i:j]==\"-.\"):\r\n ss+='1'\r\n i=j\r\n j+=2\r\n elif(s[i:j]==\"--\"):\r\n ss+='2'\r\n i=j\r\n j+=2\r\n else:\r\n ss+='0'\r\n i+=1\r\n j+=1\r\nprint(ss)\r\n \r\n \r\n", "s = input()\r\n\r\npointer = 0\r\ndigits = []\r\n\r\nwhile pointer < len(s):\r\n if s[pointer] == \".\":\r\n digits.append(0)\r\n pointer += 1\r\n elif s[pointer+1] == \".\":\r\n digits.append(1)\r\n pointer += 2\r\n else:\r\n digits.append(2)\r\n pointer += 2\r\nprint(\"\".join(map(str,digits)))", "code = list(input())\r\n\r\nnums = ''\r\nfor i in range(len(code)):\r\n if code[i]=='.':\r\n nums+='0'\r\n if code[i]=='-':\r\n if code[i+1]=='-':\r\n nums+='2'\r\n if code[i+1]=='.':\r\n nums+='1'\r\n code[i+1] = None\r\n\r\nprint(nums)\r\n", "import queue\r\n\r\nif __name__ == \"__main__\":\r\n ternary_number = input().strip()\r\n converted_number = \"\"\r\n i = 0\r\n while i < len(ternary_number):\r\n if ternary_number[i] == \".\":\r\n converted_number += \"0\"\r\n i += 1\r\n elif ternary_number[i] == \"-\":\r\n if ternary_number[i+1] == \".\":\r\n converted_number += \"1\"\r\n i += 2\r\n elif ternary_number[i+1] == \"-\":\r\n converted_number += \"2\"\r\n i += 2\r\n else:\r\n print(\"Invalid Input\")\r\n else:\r\n print(\"Invalid Input\")\r\n print(converted_number)", "a = input()\r\nc=0\r\nfor i in range(len(a)):\r\n if a[i] == '.':\r\n if c==1:\r\n print(1,end='')\r\n c=0\r\n else:\r\n\r\n print(0,end='')\r\n elif a[i] == '-':\r\n if c==1:\r\n print(2,end='')\r\n c=0\r\n else:\r\n\r\n c+=1", "L = []\r\nFinal = []\r\na = input()\r\nfor i in a:\r\n L.append(i)\r\n\r\n\r\ni = 0\r\nwhile(i < len(L)):\r\n if L[i] == '.':\r\n Final.append(0)\r\n i += 1\r\n elif L[i] == '-' and L[i+1] == '.':\r\n i += 2\r\n Final.append(1)\r\n else:\r\n Final.append(2)\r\n i += 2\r\n\r\nq = ''\r\nfor i in range(len(Final)):\r\n q+=str(Final[i])\r\nprint(q)", "t=input()\r\n\r\nt=t.replace('--','2')\r\nt=t.replace('-.','1')\r\nt=t.replace('.','0')\r\n\r\nprint(t)", "ch=input()\r\nr=\"\"\r\nwhile ch!=\"\":\r\n if ch[0]==\".\":\r\n r+=\"0\"\r\n ch=ch.replace(ch[0],\"\",1)\r\n else :\r\n if ch[:2]==\"-.\":\r\n r+=\"1\"\r\n ch=ch.replace(ch[:2],\"\",1)\r\n elif ch[:2]==\"--\":\r\n r+=\"2\"\r\n ch=ch.replace(ch[:2],\"\",1)\r\nprint(r)", "string = input()\r\nindex, end = 0, len(string)\r\noutput = ''\r\n\r\nwhile index<end:\r\n\tif string[index] == '.':\r\n\t\toutput += '0'\r\n\t\tindex -= 1\r\n\telif string[index:index+2] == '-.':\r\n\t\toutput += '1'\r\n\telse: output += '2'\r\n\tindex += 2\r\n\r\nprint(output)", "m = input();a = m.replace(\"--\",\"2\");l = a.replace(\"-.\",\"1\");i = l.replace(\".\",\"0\");print(i)\r\n", "# http://codeforces.com/problemset/problem/32/B\r\n\r\nif __name__ == '__main__':\r\n code = input()\r\n n = len(code)\r\n i = 0\r\n res = ''\r\n match = {\r\n \".\": \"0\",\r\n \"-.\": \"1\",\r\n \"--\": \"2\"\r\n }\r\n while i < n:\r\n if code[i] == '.':\r\n res += '0'\r\n elif i < n - 1 and code[i:i + 2] in match:\r\n res += match[code[i:i + 2]]\r\n i += 1\r\n i += 1\r\n print(res)\r\n", "s = input()\r\nm = ''\r\nfor i in range(len(s)):\r\n if m == '' and s[i] == '.':\r\n print(0, end = '')\r\n elif m == '-' and s[i] == '.':\r\n print(1, end = '')\r\n m = ''\r\n elif m == '-' and s[i] == '-':\r\n print(2, end = '')\r\n m = ''\r\n elif m == '' and s[i] == '-':\r\n m = '-'\r\n", "# -*- coding: utf-8 -*-\n\"\"\"32B.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1YAcE_C3NXDvEY0NY_rHyte8StemSWBIK\n\"\"\"\n\ncode=input()\nn=''\ni=0\nwhile i<len(code):\n if code[i]=='.':\n n+='0'\n i+=1\n elif code[i]=='-' and code[i+1]=='.':\n n+='1'\n i+=2\n elif code[i]=='-' and code[i+1]=='-':\n n+='2'\n i+=2\nprint(n)", "s=input()\r\nres=''\r\nwhile len(s)>0:\r\n if s[0]=='.':\r\n res+='0'\r\n s=s[1:]\r\n else:\r\n \r\n s=s[1:]\r\n if s[0]=='.':\r\n res+='1'\r\n s=s[1:]\r\n else:\r\n res+='2'\r\n s=s[1:]\r\n \r\n\r\nprint(res)\r\n", "message = list(input())\r\ndecoded = \"\"\r\n\r\ni = 0\r\nwhile i < len(message):\r\n if message[i] == \".\":\r\n decoded += \"0\"\r\n elif message[i] + message[i + 1] == \"-.\":\r\n decoded += \"1\"\r\n i += 1\r\n elif message[i] + message[i + 1] == \"--\":\r\n decoded += \"2\"\r\n i += 1\r\n i += 1\r\n\r\nprint(decoded)", "x = input()\r\nresult = []\r\nskip_two = False\r\n\r\nfor ind in range(len(x)):\r\n if skip_two:\r\n skip_two = False\r\n continue\r\n if x[ind] == \".\":\r\n result.append(\"0\")\r\n else:\r\n skip_two = True\r\n if ind == len(x) - 1:\r\n pass\r\n else:\r\n if x[ind + 1] == \".\":\r\n result.append(\"1\")\r\n else:\r\n result.append(\"2\")\r\n\r\nresult = \"\".join(result)\r\n\r\nprint(result)", "a = list(input())\r\nc = []\r\nwhile len(a) > 0:\r\n if a[0] == '-' and a[1] == '.':\r\n c.append(\"1\")\r\n del a[0:2]\r\n elif a[0] == \"-\" and a[1] == \"-\":\r\n c.append(\"2\")\r\n del a[0:2]\r\n else:\r\n c.append(\"0\")\r\n del a[0]\r\nprint(\"\".join(c))", "s=input()\r\nl=0\r\nn=\"\"\r\nwhile l!=len(s):\r\n if s[l]==\".\":\r\n n+=\"0\"\r\n l+=1\r\n elif s[l:l+2]==\"-.\":\r\n n+=\"1\"\r\n l+=2\r\n elif s[l:l+2]==\"--\":\r\n n+=\"2\"\r\n l+=2\r\nprint(n)\r\n", "a=[i for i in input()]\r\nb=''\r\nc=''\r\nfor i in a:\r\n b+=i\r\n if b=='.':\r\n c+=\"0\"\r\n b=''\r\n elif b==\"--\":\r\n c+='2'\r\n b=''\r\n elif b=='-.':\r\n c+='1'\r\n b=''\r\n elif b=='---':\r\n c+='3'\r\n b=''\r\nprint(c)", "'''\r\n#list(map(int,input().split()))'''\r\n# before you win, you have to fail\r\nenum=lambda x:enumerate(x)\r\nb=input();result=[];skip=False\r\nfor i,t in enum(b):\r\n if skip:skip=not skip;continue\r\n if i<len(b) and t=='-' and b[i+1]=='-':result.append('2');skip=True\r\n if i<len(b) and t=='-' and b[i+1]=='.':result.append('1');skip=True\r\n if t=='.':result.append('0')\r\nprint(''.join(result))\r\n \r\n", "A=input()\r\ni=0\r\nwhile(i<len(A)):\r\n if(A[i]==\".\"):\r\n if(i==0):\r\n print(\"0\",sep=\"\",end=\"\")\r\n i+=1\r\n else:\r\n if(A[i-1]!=\"-\"):\r\n print(\"0\",sep=\"\",end=\"\")\r\n i+=1\r\n else:\r\n if(A[i-2!=\"-\"]):\r\n i+=1\r\n print(\"0\",sep=\"\",end=\"\")\r\n else:\r\n if(A[i+1]==\".\"):\r\n print(\"1\",sep=\"\",end=\"\")\r\n i+=2\r\n else:\r\n print(\"2\",sep=\"\",end=\"\")\r\n i+=2", "s=str(input())\r\na=[\".\", \"-.\",\"--\"]\r\nb=set(a)\r\ni=0\r\nans=\"\"\r\nwhile(i<len(s)):\r\n if s[i] in a:\r\n ans+=str(a.index(s[i]))\r\n i+=1\r\n elif s[i:i+2] in a:\r\n ans+=str(a.index(s[i:i+2]))\r\n i+=2\r\nprint(ans)", "h = input()\r\nresult = \"\"\r\nk = 0\r\nwhile k < len(h):\r\n if h[k] == \".\":\r\n result += '0'\r\n else:\r\n k += 1\r\n if h[k] == \".\":\r\n result += '1'\r\n else:\r\n result += '2'\r\n k += 1\r\n\r\nprint(result)", "s=input()\r\nwhile(len(s)!=0):\r\n if(s[0]=='.'):print('0',end=\"\")\r\n else:\r\n print('1',end=\"\") if s[1]=='.' else print('2',end=\"\")\r\n s=s[1:]\r\n s=s[1:]\r\nprint('\\n')\r\n", "import math\r\nimport os\r\nt = 1\r\narr = input()\r\narr = list(arr)\r\n# t = input()\r\n# t = int(t)\r\nwhile t > 0 :\r\n t -= 1\r\n # n, s, r = map(int, input().split())\r\n # arr = list(map(int, input().split()))\r\n # n = input()\r\n # n = int(n)\r\n i = 0\r\n while i < len(arr) :\r\n if arr[i] == \".\" :\r\n print(0, end=\"\")\r\n i +=1\r\n elif (arr[i] == \"-\") & (arr[i+1] == \"-\") :\r\n print(2, end=\"\")\r\n i +=2\r\n elif (arr[i] == \"-\") & (arr[i+1] == \".\") :\r\n print(1, end=\"\")\r\n i +=2 ", "a = str(input())\r\nlst = []\r\ndef ter(x):\r\n if x == \"\":\r\n return lst\r\n else:\r\n if x[0] == \".\":\r\n lst.append(0)\r\n return ter(x[1:])\r\n elif x[0:2] == \"-.\":\r\n lst.append(1)\r\n return ter(x[2:])\r\n elif x[0:2] == \"--\":\r\n lst.append(2)\r\n return ter(x[2:])\r\nb = ter(a)\r\nst = \"\"\r\nfor i in b:\r\n st = st + str(i)\r\nprint(st)", "from re import L\r\n\r\n\r\ns=input()\r\nn=len(s)\r\nr=\"\"\r\ni=0\r\nwhile i<n:\r\n if s[i]==\".\":r+=\"0\"\r\n else:\r\n if s[i+1]==\".\":r+=\"1\"\r\n else:r+=\"2\"\r\n i+=1\r\n i+=1\r\n\r\nprint(r)\r\n", "s=list(input())\ns=s[::-1]\nl=[]\nwhile s:\n\tif s[-1]=='.':\n\t\ts.pop()\n\t\tl.append(0)\n\telif s[-1]=='-' and s[-2]=='-':\n\t\ts.pop()\n\t\ts.pop()\n\t\tl.append(2)\n\telse:\n\t\ts.pop()\n\t\ts.pop()\n\t\tl.append(1)\nprint(*l,sep=\"\")\n\n \t \t\t\t\t \t \t \t \t \t\t \t \t\t\t", "from sys import stdin, stdout\r\n\r\n\r\ndef main():\r\n\ts = input()\r\n\tn = ''\r\n\tflag = False\r\n\tfor c in s:\r\n\t\tif flag:\r\n\t\t\tif c == '.':\r\n\t\t\t\tn += '1'\r\n\t\t\telse: # c == '-'\r\n\t\t\t\tn += '2'\r\n\t\t\tflag = False\r\n\r\n\t\telif c == '.':\r\n\t\t\tn += '0'\r\n\t\telse:\r\n\t\t\tflag = True\r\n\r\n\r\n\tprint(n)\r\n\r\n\r\nmain()\r\n", "a=list(input())\r\nk=''\r\nd=0\r\nwhile len(a)!=0:\r\n \r\n if '.'==a[d]:\r\n a.pop(0)\r\n k+='0'\r\n elif '-'==a[d] and '.'==a[d+1]:\r\n a.pop(0)\r\n a.pop(0)\r\n k+='1'\r\n else:\r\n a.pop(0)\r\n a.pop(0)\r\n k+='2'\r\nprint(k)", "n = input()\r\na = [\".\", \"-.\", \"--\"]\r\nans = \"\"\r\ntemp = \"\"\r\nfor i in n:\r\n temp += i\r\n if temp in a:\r\n ans += str(a.index(temp))\r\n temp = \"\"\r\nprint(ans)\r\n", "s = input()\npre = -1\nfor i in range(len(s)):\n if pre != i:\n if i != len(s)-1:\n if s[i] == \"-\" and s[i+1] == \".\":\n print(1,end ='')\n pre = i+1\n elif s[i] == \"-\" and s[i+1] == \"-\":\n print(2,end = '')\n pre = i+1\n if s[i] == \".\":\n print(0,end = '')\n", "arr = [i for i in input()]\r\nans= str()\r\ni = 0\r\nwhile i < len(arr):\r\n if arr[i] == '.':\r\n ans += '0'\r\n elif arr[i] == '-' and i < len(arr)-1 and arr[i+1] == '.':\r\n ans += '1'\r\n i += 1\r\n elif arr[i] == '-' and i < len(arr)-1 and arr[i+1] == '-':\r\n ans += '2'\r\n i += 1\r\n i += 1\r\n \r\nprint(ans)", "def process():\r\n code = input()\r\n \r\n i = 0\r\n result = []\r\n \r\n while i < len(code):\r\n if code[i] == '.':\r\n result.append('0')\r\n i += 1\r\n elif code[i:i+2] == '-.':\r\n result.append('1')\r\n i += 2\r\n else:\r\n result.append('2')\r\n i += 2\r\n \r\n print(''.join(result))\r\n\r\nprocess()", "s = input()\r\n\r\nd = {'--':'2', '-.':'1', '.':'0'}\r\n\r\nans = \"\"\r\ni = 0\r\ncurr = \"\"\r\nwhile i<len(s):\r\n\r\n curr += s[i]\r\n\r\n if curr in d:\r\n ans += d[curr]\r\n curr = \"\"\r\n \r\n i += 1\r\n\r\nprint(ans)", "a = input()\r\nb = list(i for i in a)\r\ndecode = []\r\nwhile b != []:\r\n if b[0] == \".\":\r\n decode.append(\"0\")\r\n b.pop(0)\r\n elif b[0] == \"-\" and b[1] == \".\":\r\n decode.append(\"1\")\r\n del b[:2:]\r\n else:\r\n decode.append(\"2\")\r\n del b[:2:]\r\nprint(\"\".join(decode))", "s=input()\r\nd=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n d=d+\"0\"\r\n i=i+1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n d=d+\"1\"\r\n else:\r\n d=d+\"2\"\r\n i=i+2\r\nprint(d)\r\n ", "code = {\".\": \"0\", \"-.\": \"1\", \"--\": \"2\"}\r\n\r\nline = input()\r\nanswer = \"\"\r\nwhile len(line) != 0:\r\n\r\n if line[0] == \".\":\r\n answer = answer + code[\".\"]\r\n line = line[1:]\r\n else:\r\n answer = answer + code[line[0:2]]\r\n line = line[2:]\r\nprint(answer)", "n = (input())\r\ns = \"\"\r\ni = 0\r\nwhile i<len(n):\r\n if n[i]==\".\":\r\n s+=\"0\"\r\n i+=1\r\n if n[i:i+2]==\"-.\":\r\n s+=\"1\"\r\n i+=2\r\n if n[i:i+2]==\"--\":\r\n s+=\"2\"\r\n i+=2\r\nprint(s)", "m=input()\r\nm=m.replace('--','2')\r\nm=m.replace('-.','1')\r\nm=m.replace('.','0')\r\nprint(m)", "A = input()\r\nB = A.replace('--','2')\r\nC = B.replace('-.','1')\r\nD = C.replace('.','0')\r\nprint(D)", "n = input() \r\nn = n +\" \"\r\nresult = \"\" \r\nj = 0 \r\nwhile True:\r\n if j == len(n) or j == len(n) - 1 or j == len(n) - 2 :\r\n break \r\n if n[j] == \".\":\r\n result = result + \"0\"\r\n j = j + 1 \r\n \r\n elif n[j] == \"-\" and n[j + 1 ] == \".\" : \r\n result = result + \"1\" \r\n j = j + 2 \r\n \r\n elif n[j] == \"-\" and n[j + 1 ] == \"-\":\r\n result = result + \"2\" \r\n j = j + 2 \r\n \r\n \r\nprint(result)", "s=input()\r\nn=len(s)\r\na=0\r\nl=list(s)\r\nnum=[]\r\nwhile n>a:\r\n if l[a]==\".\":\r\n num.append(0)\r\n a=a+1\r\n elif l[a]==\"-\" and l[a+1]==\".\":\r\n num.append(1)\r\n a=a+2\r\n elif l[a]==\"-\" and l[a+1]==\"-\":\r\n num.append(2)\r\n a=a+2\r\nprint(*num, sep='')", "string = input()\r\nindex = 0\r\nwhile index < len(string):\r\n char = string[index]\r\n if char == '.':\r\n print('0', end='')\r\n elif char == '-':\r\n index += 1\r\n char = string[index]\r\n if char == '.':\r\n print('1', end='')\r\n elif char == '-':\r\n print('2', end='')\r\n index += 1\r\n", "str = input()\r\nres = \"\"\r\nc=0\r\nn = len(str)\r\nwhile c<n:\r\n if(str[c]==\".\"):\r\n res += \"0\"\r\n c+=1\r\n elif(str[c]==\"-\" and c+1<n and str[c+1]==\".\"):\r\n res+=\"1\"\r\n c+=2\r\n else:\r\n res+=\"2\"\r\n c+=2\r\nprint(res)", "str = input()\r\nstr2 = \"\"\r\nprint(str2)\r\ni=1\r\nwhile i<=len(str):\r\n if str[i-1]=='-' and str[i]=='-':\r\n str2+='2'\r\n i+=2\r\n elif str[i-1]=='-' and str[i]=='.':\r\n str2+='1'\r\n i+=2\r\n elif str[i-1]=='.':\r\n str2+='0'\r\n i+=1\r\n\r\nprint(str2)", "inp = input()\ni=0\nwhile(i <= len(inp)-1):\n\tif inp[i] == \"-\" and inp[i+1] == \".\":\n\t\tprint(\"1\",end = \"\")\n\t\ti+=1\n\telif inp[i] == \"-\" and inp[i+1] == \"-\":\n\t\tprint(\"2\",end=\"\")\n\t\ti+=1\n\telse:\n\t\tprint(\"0\",end=\"\")\n\ti+=1\t\n", "from sys import stdin\r\n###############################################################\r\ndef iinput(): return int(stdin.readline())\r\ndef sinput(): return input()\r\ndef minput(): return map(int, stdin.readline().split())\r\ndef linput(): return list(map(int, stdin.readline().split()))\r\n###############################################################\r\n\r\ns = sinput()\r\ni = 0\r\ncode = ''\r\nwhile i<len(s):\r\n if s[i] == '.':\r\n code += '0'\r\n i+=1\r\n elif s[i:i+2] == '-.':\r\n code += '1'\r\n i+=2\r\n elif s[i:i+2] == '--':\r\n code += '2'\r\n i+=2\r\nprint(code)\r\n", "def borze():\r\n c=str(input())\r\n s=\"\"\r\n i=0\r\n while i<len (c):\r\n if c[i]==\".\" : \r\n s=s+str(0)\r\n i+=1\r\n elif c[i]==\"-\" and c[i+1]==\"-\":\r\n s=s+str(2)\r\n i+=2\r\n elif c[i]==\"-\" and c[i+1]==\".\" :\r\n s=s+str(1)\r\n i+=2\r\n print(s) \r\nborze()", "input = input()\r\nls=list(input)\r\nans=''\r\nwhile(len(ls) != 0):\r\n if ls[0]=='.':\r\n ans += '0'\r\n del ls[0]\r\n elif ls[0]+ls[1]=='-.':\r\n ans += '1'\r\n del ls[0]\r\n del ls[0]\r\n elif ls[0]+ls[1]=='--':\r\n ans += '2'\r\n del ls[0]\r\n del ls[0]\r\nprint(ans)\r\n\r\n", "n = str(input())\r\np = n.replace(\"--\",\"2\")\r\nq = p.replace(\"-.\",\"1\")\r\nr = q.replace(\".\",\"0\")\r\nprint(r)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 25 00:41:51 2023\r\n\r\n@author: R I B\r\n\"\"\"\r\n\r\nimport sys\r\nL=[]\r\nfor i in sys.stdin:\r\n L.append(i)\r\nK=[line.rstrip('\\n') for line in L if line]\r\nch=(K[0])\r\nch1=''\r\ni=0\r\nwhile i<len(ch):\r\n if ch[i]=='.':\r\n ch1+=str(0)\r\n i=i+1\r\n elif ch[i:i+2]=='-.':\r\n ch1+=str(1)\r\n i=i+2\r\n elif ch[i:i+2]=='--':\r\n ch1+=str(2)\r\n i=i+2\r\nprint(ch1)", "#!/usr/bin/env python3\n#-*- coding: utf-8 -*-\n\nfrom sys import stdin\n\nborze_code = stdin.readline().rstrip()\n\nlength = len(borze_code)\n\ni = 0\nternary_num = list()\nwhile i < length:\n if borze_code[i] == '.':\n ternary_num.append('0')\n i += 1\n elif borze_code[i] == '-' and borze_code[i+1] == '.':\n ternary_num.append('1')\n i += 2\n else:\n ternary_num.append('2')\n i += 2\n\nprint(''.join(ternary_num))\n", "def main():\r\n str = input()\r\n s = \"\"\r\n for i in str:\r\n if i == \".\":\r\n if s == \"-\":\r\n print(1, end=\"\")\r\n s = \"\"\r\n else:\r\n print(0, end=\"\")\r\n else:\r\n if s == \"-\":\r\n print(2, end=\"\")\r\n s = \"\"\r\n else:\r\n s = \"-\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "b = input()\r\nt = b.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\nprint(t)", "# Borze\ndef borze(s):\n # i = 0\n # ans = []\n # while (i + 1) < len(s):\n # if s[i] == '-' and s[i+1] == '-':\n # ans.append('2')\n # i += 2\n # elif s[i] == '-' and s[i+1] == '.':\n # ans.append('1')\n # i += 2\n # else:\n # ans.append('0')\n # i += 1\n # if s[-1] == '.':\n # ans.append('0')\n s = s.replace('--', '2')\n s = s.replace('-.', '1')\n s= s.replace('.', '0')\n return s\n\ns = input()\nprint(borze(s))", "\"\"\"\nB. Borze: expression parsing, implementation\n\ntime limit per test: 2 seconds\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nTernary numeric notation is quite popular in Berland. To telegraph the ternary number the Borze alphabet is used.\nDigit 0 is transmitted as «.», 1 as «-.» and 2 as «--». You are to decode the Borze code, i.e. to find out the ternary number given its representation in Borze alphabet.\n\nInput\nThe first line contains a number in Borze code. The length of the string is between 1 and 200 characters.\nIt's guaranteed that the given string is a valid Borze code of some ternary number (this number can have leading zeroes).\n\nOutput\nOutput the decoded ternary number. It can have leading zeroes.\n\"\"\"\n\ndef borze():\n n = input().replace('--', '2').replace('-.', '1').replace('.', '0')\n print(n)\n\nif __name__ == '__main__':\n borze()", "borze = input()\ni = 0\n\nwhile i < len(borze):\n if borze[i] == '.':\n print('0', end='')\n i += 1\n else:\n if borze[i+1] == '.':\n print('1', end='')\n else:\n print('2', end='')\n i += 2\n", "\r\ndef Broze():\r\n s=input()\r\n lst=list(s)\r\n a=[]\r\n str1=\"\"\r\n t=len(lst)\r\n for i in range(t):\r\n \r\n if(lst[i]==\"-\"):\r\n if(lst[i+1]==\".\"):\r\n str1+=\"1\"\r\n elif(lst[i+1]==\"-\"):\r\n str1+=\"2\"\r\n lst.pop(i+1)\r\n lst.append(\"z\")\r\n if(i==len(lst)):\r\n break\r\n elif(lst[i]==\".\"):\r\n str1+=\"0\"\r\n print(str1)\r\n\r\nBroze()", "# https://codeforces.com/problemset/problem/32/B\r\n\r\ndef main():\r\n code = input()\r\n\r\n code = code.replace('--', '2')\r\n code = code.replace('-.', '1')\r\n code = code.replace('.', '0')\r\n\r\n print(code)\r\n\r\nif __name__ == '__main__':\r\n main()", "s = input()\r\nr = []\r\ni = 0\r\nl = len(s)\r\nwhile i < l:\r\n if s[i] == '-':\r\n if s[i+1] == '-':\r\n r.append(2)\r\n else:\r\n r.append(1)\r\n i += 2\r\n else:\r\n r.append(0)\r\n i += 1\r\nprint(''.join(map(str, r)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = list(input().rstrip())\r\nans = []\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == \".\":\r\n i += 1\r\n ans.append(\"0\")\r\n elif s[i + 1] == \".\":\r\n i += 2\r\n ans.append(\"1\")\r\n else:\r\n i += 2\r\n ans.append(\"2\")\r\nsys.stdout.write(\"\".join(ans))", "s=input()\r\na=[]\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='-' and s[i+1]=='-':\r\n a.append('2')\r\n i+=2\r\n elif s[i]=='-' and s[i+1]=='.':\r\n a.append('1')\r\n i+=2\r\n elif s[i]=='.':\r\n a.append('0')\r\n i+=1\r\nprint(''.join(a))\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "b=input()\r\ni=0\r\nn=''\r\nwhile i<len(b):\r\n if b[i]=='.':\r\n n+='0'\r\n elif b[i]=='-' and b[i+1]=='.':\r\n n+='1'\r\n i+=1\r\n else:\r\n n+='2'\r\n i+=1\r\n i+=1\r\nprint(n)", "line = list(input())\r\ntmp = ''\r\nans = ''\r\ni = 0\r\nwhile i <=len(line)-1:\r\n if line[i] == '.':\r\n ans +='0'\r\n i+=1\r\n else:\r\n if line[i] == '-'and line[i+1] == '.' :\r\n ans +='1'\r\n i+=2\r\n elif line[i] == '-'and line[i+1] == '-':\r\n ans +='2'\r\n i+=2\r\nprint(ans)", "s=input()\r\nx=\"\"\r\nc=\"\"\r\nfor i in s:\r\n x+=i\r\n if x==\".\":\r\n c+=\"0\"\r\n x=\"\"\r\n elif x==\"-.\":\r\n c+=\"1\"\r\n x=\"\"\r\n elif x==\"--\":\r\n x=\"\"\r\n c+=\"2\"\r\nprint(c)\r\n\r\n\r\n\r\n\r\n", "a = input()\r\nb = ''\r\nc = 0\r\nwhile c != len(a):\r\n if a[c] == '.':\r\n b += '0'\r\n c += 1\r\n elif a[c] == '-':\r\n if a[c + 1] == '.':\r\n b += '1'\r\n else:\r\n b += '2'\r\n c += 2\r\nprint(b)", "borze = list(map(str, input()))\r\ni = 0\r\nwhile(i < len(borze)):\r\n if borze[i] == '.':\r\n print(0, end='')\r\n i = i + 1\r\n elif borze[i] == '-' and borze[i+1] == '.':\r\n print(1, end ='')\r\n i = i + 2\r\n elif borze[i] == '-' and borze[i+1] == '-':\r\n print(2, end='')\r\n i = i + 2", "s=input()\r\nnum=''\r\ni=0\r\nwhile i<len(s):\r\n if i!=(len(s)-1):\r\n if s[i]=='.':\r\n num+='0'\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n num+='1'\r\n # print(num)\r\n i+=2\r\n elif s[i] == '-' and s[i+1]=='-':\r\n num+='2'\r\n i+=2\r\n else:\r\n num+='0'\r\n i+=1\r\nprint(num)", "arr = list(input())\r\nans = \"\"\r\nn = len(arr)\r\ni = 0\r\n\r\nwhile i < n:\r\n if arr[i] == \".\":\r\n ans += \"0\"\r\n i += 1\r\n elif arr[i] == \"-\":\r\n if arr[i+1] == \".\":\r\n ans += \"1\"\r\n else:\r\n ans += \"2\"\r\n i += 2\r\n\r\nprint(ans)", "A=[i for i in input()]\r\ni=0\r\nwhile i<len(A):\r\n if A[i]=='.':\r\n print(0,end=\"\")\r\n i+=1\r\n elif A[i]=='-':\r\n if A[i+1]=='-':\r\n print(2,end=\"\")\r\n i+=2\r\n else:\r\n print(1,end=\"\")\r\n i+=2\r\n", "# B. Borze\r\ns=input()\r\ni=0\r\na=[]\r\nwhile i<len(s):\r\n if s[i]==\".\":\r\n a.append(\"0\")\r\n i+=1\r\n elif s[i:i+2]==\"-.\":\r\n i+=2\r\n a.append(\"1\")\r\n elif s[i:i+2]==\"--\":\r\n a.append(\"2\")\r\n i+=2\r\n\r\nb=\"\".join(a)\r\nprint(b)", "n = input()\r\ns = ''\r\no, t = 0, 0\r\n\r\nfor i in n:\r\n if i == '.' and o == 0:\r\n s += '0'\r\n elif i == '-' and t != 0:\r\n s += '2'\r\n t = 0\r\n o = 0\r\n elif i == '.' and o != 0:\r\n s += '1'\r\n o = 0\r\n t = 0\r\n else:\r\n o += 1\r\n t += 1 \r\n\r\nprint(s)", "s=input()\r\ni=0\r\nres=''\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n res+='0'\r\n i+=1\r\n elif s[i:i+2]=='--':\r\n res+='2'\r\n i+=2\r\n elif s[i:i+2]==\"-.\":\r\n res+='1'\r\n i+=2\r\nprint(res)\r\n ", "\ndef solve():\n\tans = ''\n\tindex = 0\n\twhile index < zwei:\n\t\tif eins[index] == '.':\n\t\t\tans += '0'\n\t\t\tindex += 1\n\t\t\n\t\telif eins[index] == '-':\n\t\t\tif eins[index+1] == '-':\n\t\t\t\tans += '2'\n\t\t\telse:\n\t\t\t\tans += '1'\n\t\t\tindex += 2\n\treturn ans\n\neins = input()\nzwei = len(eins)\nprint(solve())\n", "a=input()\r\nb=\"\"\r\ni=0\r\nwhile(i<len(a)):\r\n if(a[i]=='.'):\r\n b+='0'\r\n i=i+1\r\n elif(a[i]=='-' and a[i+1]=='.'):\r\n b+='1'\r\n i=i+2\r\n elif(a[i]=='-' and a[i+1]=='-'):\r\n b+='2'\r\n i=i+2\r\nprint(b)\r\n \r\n ", "'''\n R E X\n\n Date - 13th May 2021\n\n Platform - Practice\n\n @author:\n CodeForces -> kunalverma19\n CodeChef -> kunalverma_19\n AtCoder -> TLKunalVermaRX\n'''\nimport sys\nimport math\nMOD = 1000000007\n# sys.stdin=open(\"input.txt\",\"r\")\ns=input()\ns=s.replace(\"--\",\"2\")\ns=s.replace(\"-.\",\"1\")\ns=s.replace(\".\",\"0\")\nprint(s)\n", "string = str(input())\r\n\r\n#string = \".-.--\"\r\nstring = string.replace('--','2')\r\nstring = string.replace('-.','1')\r\nstring = string.replace('.','0')\r\nprint(string)", "strr = str(input())\r\nstrr = strr.replace('--','2')\r\nstrr = strr.replace('-.','1')\r\nstrr = strr.replace('.','0')\r\n\r\nprint(strr)", "b_t=input()\r\nt=[]\r\nd=[]\r\na_d=[['.'], ['-','.'], ['-','-']]\r\nfor i in b_t:\r\n d+=i\r\n j=0\r\n while j<3:\r\n if d==a_d[j]:\r\n t+=[j]\r\n d=[]\r\n break\r\n j+=1\r\n[print(i, end='') for i in t]", "n = input()\r\ni = 0\r\nwhile i < len(n):\r\n if n[i] == '.':\r\n print(0, end='')\r\n i += 1\r\n elif n[i] == '-' and n[i + 1] == '.':\r\n print(1, end='')\r\n i += 2\r\n else:\r\n print(2, end='')\r\n i += 2\r\n", "s = input()\ni=0\nwhile i < len(s):\n if i + 1 < len(s):\n if s[i:i+2] == '--':\n i+=2\n print(2, end='')\n elif s[i:i+2] =='-.':\n print(1,end='')\n i+=2\n else:\n print(0,end='')\n i+=1\n else:\n print(0,end='')\n i+=1", "s = input()\r\na = s.replace('--', '2')\r\na = a.replace('-.', '1')\r\na = a.replace('.', '0')\r\nprint(a)", "def solve(s):\n s = s.replace('--', '2')\n s = s.replace('-.', '1')\n s = s.replace('.', '0')\n return s\n\n\ndef main():\n print(solve(input()))\n\n\nmain()\n", "n=input()\r\nl=len(n)\r\ni=0\r\nresult=\"\"\r\nwhile i<l:\r\n if i+1<l:\r\n x=n[i]+n[i+1]\r\n if n[i]==\".\":\r\n result+=\"0\"\r\n i+=1\r\n elif x==\"-.\":\r\n result+=\"1\"\r\n i+=2\r\n elif x==\"--\":\r\n result+=\"2\"\r\n i+=2\r\nprint(result)", "i=input()\nr=\"\"\ns=1\nx=0\nwhile x<len(i) :\n\tif i[x]=='.':\n\t\tr=r+\"0\"\n\t\ts=1\n\telse:\n\t\tif i[x+1]=='.':\n\t\t\tr=r+\"1\"\n\t\t\ts=2\n\t\telse:\n\t\t\tr=r+\"2\"\n\t\t\ts=2\n\tx+=s\n\nprint(r)\n\t \t \t\t\t \t\t\t \t \t \t\t \t \t\t\t\t\t", "s=input()\r\nn=''\r\ni=0\r\nwhile i < len(s):\r\n if s[i]=='.':\r\n n=n+'0'\r\n i=i+1\r\n else:\r\n if s[i+1]=='.':\r\n n=n+'1'\r\n i=i+2\r\n else:\r\n n = n + '2'\r\n i = i + 2\r\n\r\nprint(n)", "s = input()\r\nl = len(s)\r\nindex = 0\r\nwhile index < l:\r\n if s[index] == '.':\r\n print(0, end=\"\")\r\n index = index + 1\r\n else:\r\n index = index + 1\r\n if s[index] == '.':\r\n print(1, end=\"\")\r\n else:\r\n print(2, end=\"\")\r\n index = index + 1\r\nprint()", "inp=input()\r\ninp=inp+\"a\"\r\ni=0\r\nstring=\"\"\r\nwhile i<len(inp):\r\n if inp[i] == \"a\":\r\n break\r\n if inp[i]==\".\":\r\n string=string+\"0\"\r\n i=i+1\r\n else:\r\n if inp[i+1]==\".\":\r\n string=string+\"1\"\r\n else:\r\n string=string+\"2\"\r\n i=i+2\r\nprint(string)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s=input()\r\nans=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i] is '.':\r\n ans+='0'\r\n i+=1\r\n continue\r\n if s[i] is '-':\r\n if s[i+1] is '.':\r\n ans+='1'\r\n if s[i+1] is '-':\r\n ans+='2'\r\n i+=2\r\nprint(ans)", "s=input();\r\ni=0;\r\nss='';\r\nwhile(i<=len(s)-1):\r\n if s[i]=='.':\r\n ss+='0';\r\n i+=1;\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n ss+='1';\r\n elif s[i+1]=='-':\r\n ss+='2';\r\n i+=2;\r\nprint(ss);\r\n", "code = input()\r\nstore = \"\"\r\nl = len(code)\r\ni=0\r\nwhile i<l:\r\n if code[i] == \".\":\r\n store+=\"0\"\r\n i+=1\r\n elif code[i] == \"-\" and i!=l:\r\n if code[i+1] == \".\":\r\n store+=\"1\"\r\n i+=2\r\n else:\r\n store+=\"2\"\r\n i+=2\r\nprint(store)", "s = input()\r\nnum = ''\r\ni = 0\r\nn = True\r\nwhile n:\r\n try:\r\n if s[i] == '-' and s[i + 1] == '.':\r\n num += '1'\r\n i += 2\r\n continue\r\n if s[i] == '-' and s[i + 1] == '-':\r\n num += '2'\r\n i += 2\r\n continue\r\n elif s[i] == '.':\r\n num += '0'\r\n i += 1\r\n continue\r\n except IndexError:\r\n break\r\nprint(num)\r\n", "choco = \"\"\r\n\r\nstr = input()\r\n\r\ncontroller = 0\r\n\r\nwhile controller < len(str):\r\n if str[controller] == '-':\r\n if str[controller+1] == '.':\r\n choco = choco + '1'\r\n controller += 2\r\n elif str[controller+1] == '-':\r\n choco = choco+'2'\r\n controller += 2\r\n else:\r\n choco = choco + '0'\r\n controller += 1\r\n\r\nprint(choco)", "def decode(s,r):\r\n if(s==\"\"):\r\n return r\r\n else:\r\n if(s[0]=='.'):\r\n r+='0'\r\n s=s[1:]\r\n elif(s[0:2]==\"-.\"):\r\n r+='1'\r\n s=s[2:]\r\n elif(s[0:2]==\"--\"):\r\n r+='2'\r\n s=s[2:]\r\n return decode(s,r)\r\nif(__name__=='__main__'):\r\n s=input()\r\n d=decode(s,\"\")\r\n print(d)\r\n", "line=list(input())\r\nout=[]\r\ni=0\r\n\r\nwhile i<len(line):\r\n if line[i]=='.':\r\n out.append(0)\r\n elif line[i]=='-':\r\n if line[i+1]=='.':\r\n out.append(1)\r\n i+=1\r\n elif line[i+1]=='-':\r\n out.append(2)\r\n i+=1\r\n i+=1\r\n\r\nprint(*out, sep='')\r\n", "t=input()\r\na=list(t)\r\ng=''\r\nfor i in range(len(a)):\r\n if a[i]=='-' and i!=len(a) and a[i+1]=='.':\r\n a[i]='_'\r\n a[i+1]='_'\r\n g+='1'\r\n elif a[i]=='-' and i!=len(a) and a[i+1]=='-':\r\n a[i]='_'\r\n a[i+1]='_'\r\n g+='2'\r\n elif a[i]=='.':\r\n a[i]='_'\r\n g+='0'\r\nprint(g)\r\n", "b = input()\r\nB = list(b)\r\nOTV = []\r\ncount = -1\r\nfor i in range (len(B)):\r\n if count < len(B)-1:\r\n \r\n count = count + 1\r\n if B[count] == '.':\r\n OTV.append(0)\r\n \r\n if B[count] == '-':\r\n if B[count+1] == '.':\r\n OTV.append(1)\r\n else:\r\n OTV.append(2)\r\n count = count + 1\r\n else:\r\n break\r\nfor i in OTV:\r\n print(i, end = '')", "def sol():\r\n s = input()\r\n index = 0\r\n res = \"\"\r\n while index < len(s):\r\n if s[index] == '.':\r\n res += \"0\"\r\n index += 1\r\n elif s[index] == '-':\r\n if s[index + 1] == '-':\r\n res += '2'\r\n index += 2\r\n elif s[index + 1] == '.':\r\n res += '1'\r\n index += 2\r\n return res\r\nprint(sol())", "s = list(str(input()))\r\noutput = \"\"\r\ni = 0\r\nwhile (i<len(s)) :\r\n if s[i] == '.':\r\n output += \"0\"\r\n i=i+1\r\n elif s[i]=='.' and s[i+1] =='.':\r\n output += \"00\"\r\n i=i+2\r\n elif s[i]=='-' and s[i+1] == '.':\r\n output += \"1\"\r\n i=i+2\r\n elif s[i]=='-' and s[i+1] == '-':\r\n output += \"2\"\r\n i=i+2\r\n\r\nprint(output)\r\n \r\n", "n=input()\r\na=''\r\ni=0\r\nwhile i != len(n):\r\n if n[i]=='.':\r\n a+='0'\r\n elif n[i:i+2]=='-.':\r\n a+='1'\r\n i+=1\r\n else:\r\n a+='2'\r\n i+=1\r\n i+=1\r\nprint(a)", "def borze(string):\r\n decoded = \"\"\r\n i = 0\r\n while i < len(string)-1:\r\n if string[i] == '.':\r\n decoded += '0'\r\n i += 1\r\n else:\r\n if string[i+1] == '-':\r\n decoded += '2'\r\n i += 2\r\n else:\r\n decoded += '1'\r\n i += 2\r\n if i == len(string) - 1 and string[i] == '.':\r\n decoded += '0'\r\n return decoded\r\n\r\nstring = input()\r\nprint(borze(string))", "\r\na=input()\r\nif(\"--\" in a):\r\n a=a.replace(\"--\",\"2\")\r\nif(\"-.\" in a):\r\n a=a.replace(\"-.\",\"1\")\r\nif(\".\" in a):\r\n a=a.replace(\".\",\"0\")\r\nprint(a)\r\n\r\n", "s = input()\r\nl=len(s)\r\ni = 0\r\n\r\nwhile(i<l):\r\n if(s[i]=='.' or s[i:i+2]=='-.' or s[i:i+2]=='--'):\r\n if(s[i]=='.'):\r\n print(\"0\", end=\"\")\r\n \r\n elif(s[i:i+2]=='-.'):\r\n print(\"1\", end=\"\")\r\n i+=1\r\n elif(s[i:i+2]=='--'):\r\n print(\"2\", end=\"\")\r\n i+=1\r\n else:\r\n i+=1\r\n i+=1\r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n", "mass = []\r\nnew_mass = []\r\nstring = input()\r\nmass.extend(string)\r\nmass.append('x')\r\n\r\ni = 0\r\nwhile i < len(mass):\r\n if mass[i] == '.':\r\n new_mass.append('0')\r\n elif mass[i] == '-' and mass[i+1] == '.':\r\n new_mass.append('1')\r\n i += 1\r\n elif mass[i] == '-' and mass[i+1] == '-':\r\n new_mass.append('2')\r\n i+= 1\r\n i += 1\r\n\r\nstring = ''.join(new_mass)\r\nprint(string)\r\n \r\n \r\n \r\n", "def broze():\r\n # input\r\n broze_code = input()\r\n res = \"\"\r\n p = 0\r\n # main\r\n while p < len(broze_code):\r\n if broze_code[p] == \"-\" and broze_code[p+1] == \".\":\r\n res += \"1\"\r\n p += 2\r\n elif broze_code[p] == \".\":\r\n res += \"0\"\r\n p += 1\r\n elif broze_code[p] == \"-\" and broze_code[p+1] == \"-\":\r\n res += \"2\"\r\n p += 2\r\n\r\n return res\r\n\r\n\r\nprint(broze())", "borzeCode = input()\r\ndecoded = ''\r\ni = 0\r\nwhile i < len(borzeCode):\r\n if borzeCode[i] == '.':\r\n decoded += '0'\r\n else:\r\n if borzeCode[i + 1] == '.':\r\n decoded += '1'\r\n else:\r\n decoded += '2'\r\n i += 1\r\n i += 1\r\nprint(decoded)\r\n", "a = input()\r\nb=''\r\ni=0\r\nwhile i <len(a):\r\n if a[i]=='.':\r\n b+='0'\r\n else:\r\n if a[i+1]=='.':\r\n b+='1'\r\n else:\r\n b+='2'\r\n i+=1\r\n i+=1\r\nprint(b)", "n=input()\r\ns=\"\"\r\nl=len(n)\r\ni=0\r\nwhile(i<l):\r\n if i!=l-1:\r\n if n[i]==\"-\" and n[i+1]==\"-\":\r\n i+=2\r\n s+=\"2\"\r\n elif n[i]==\"-\" and n[i+1]==\".\":\r\n i+=2\r\n s+=\"1\"\r\n elif n[i]==\".\":\r\n i+=1\r\n s+=\"0\"\r\n else:\r\n if n[i]==\".\":\r\n s+=\"0\"\r\n i+=1\r\nprint(s)", "n=input()\r\nn=list(n)\r\ni=0\r\nl=[]\r\nwhile i<len(n):\r\n if n[i]==\".\":\r\n l.append(\"0\")\r\n i=i+1\r\n elif n[i]==\"-\" and n[i+1]==\".\":\r\n l.append(\"1\")\r\n i=i+2\r\n elif n[i]==\"-\"and n[i+1]==\"-\":\r\n l.append(\"2\")\r\n i=i+2\r\nfor i in range(len(l)):\r\n print(l[i],end=\"\")\r\n \r\n", "s=input()\r\n\r\nans=[]\r\na=0\r\nwhile a<len(s):\r\n if s[a]=='.':\r\n ans.append('0')\r\n a+=1\r\n elif s[a]=='-':\r\n if s[a+1]=='.':\r\n ans.append('1')\r\n a+=2\r\n elif s[a+1]=='-':\r\n ans.append('2')\r\n a+=2\r\n #print(ans,a)\r\n\r\ns=''.join(ans)\r\nprint(s)\r\n\r\n\r\n", "s = input()\r\nans = ''\r\ns = list(s)\r\nwhile s:\r\n if s[0] == '.':\r\n ans += '0'\r\n del s[0]\r\n else:\r\n if s[1] == '-':\r\n ans += '2'\r\n del s[0]\r\n del s[0]\r\n else:\r\n ans += '1'\r\n del s[0]\r\n del s[0]\r\nprint(ans)\r\n\r\n\r\n\r\n", "code = input()\r\nflag = False\r\nnumber = ''\r\nfor i in range(len(code)):\r\n if (code[i]=='.' and not(flag) ):\r\n number = number + '0'\r\n elif (code[i]=='.' and (flag)):\r\n number = number + '1'\r\n flag = False\r\n elif (code[i]=='-' and not(flag) ):\r\n flag = True\r\n elif (code[i]=='-' and (flag)):\r\n number = number + '2'\r\n flag = False\r\nprint(number)", "s = ''\r\nempty = True\r\n\r\nfor ch in input():\r\n if empty:\r\n if ch == '.':\r\n s += '0'\r\n else:\r\n empty = False\r\n else:\r\n s += '1' if ch == '.' else '2'\r\n empty = True\r\n\r\nprint(s)", "s = input()\nans = ''\ni = 0\nwhile i<len(s):\n if s[i]=='-':\n if s[i+1]=='.':\n ans+='1'\n else:\n ans+='2'\n i+=2\n else:\n ans+='0'\n i+=1\n\nprint(ans)\n\n# Sun Oct 11 2020 16:20:06 GMT+0300 (Москва, стандартное время)\n", "d={\".\":\"0\",\"-.\":\"1\",\"--\":\"2\"}\r\n\r\ndef borze(s):\r\n r=\"\"\r\n i=0\r\n while i<len(s):\r\n\r\n temp=s[i]\r\n while temp not in d:\r\n i+=1\r\n temp+=s[i]\r\n i+=1\r\n r+=d[temp]\r\n return r\r\n\r\nprint(borze(input()))", "s=str(input())\r\nl=[]\r\nfor i in s:\r\n l.append(i)\r\nk=str()\r\ni=0\r\nwhile i<len(s):\r\n if l[i]=='.':\r\n k+='0'\r\n elif l[i]=='-' and l[i+1]=='.':\r\n k+='1'\r\n i=i+1\r\n elif l[i]=='-' and l[i+1]=='-':\r\n k+='2'\r\n i=i+1\r\n i+=1\r\nprint(k)", "# Borze\ns = input()\ni = 0\nwhile i<len(s):\n if s[i] == '.':\n print(0,end = '')\n i += 1\n elif s[i+1] == '.':\n print(1,end = '')\n i += 2\n else:\n print(2,end = '')\n i += 2\n", "s = list(input())\r\nres = ''\r\nwhile len(s):\r\n if s[0]=='.':\r\n res+='0'\r\n del s[0]\r\n else:\r\n if s[1]=='.':\r\n res+='1'\r\n else:\r\n res+='2'\r\n del s[0]\r\n del s[0]\r\nprint(res)", "n=input()\r\ne=\"\"\r\nv=\"\"\r\nfor i in n:\r\n if e==\"-\" and i==\"-\":\r\n v+=\"2\"\r\n e=\"\"\r\n elif e==\"-\":\r\n v+=\"1\"\r\n e=\"\"\r\n elif i==\".\":\r\n v+=\"0\"\r\n e=\"\"\r\n else:\r\n e=i\r\nprint(v)\r\n", "orig=input()\r\n\r\nwhile len(orig)!=0:\r\n if orig[0]==\".\":\r\n print(\"0\",end=\"\")\r\n orig=orig[1:]\r\n else:\r\n if orig[0:2]==\"-.\":\r\n print(\"1\",end=\"\")\r\n else:\r\n print(\"2\",end=\"\")\r\n orig=orig[2:]\r\n", "s = input()\r\n\r\nidx = 0\r\nwhile idx < len(s):\r\n if s[idx] == '.':\r\n print (0, end = \"\")\r\n idx += 1\r\n else:\r\n if s[idx + 1] == '.':\r\n print(1, end = \"\")\r\n else:\r\n print(2, end = \"\")\r\n idx += 2", "code=input()\nidx=0\nstring=\"\"\nwhile idx<len(code):\n\tif code[idx]==\".\":\n\t\tstring+=\"0\"\n\telif code[idx]==\"-\":\n\t\tif code[idx+1]==\".\":\n\t\t\tstring+=\"1\"\n\t\telif code[idx+1]==\"-\":\n\t\t\tstring+=\"2\"\n\t\tidx+=1\n\tidx+=1\nprint(string)\n", "s=input()\r\nn=len(s)\r\nanswer=\"\"\r\ni=0\r\nwhile(i<n):\r\n\tif(s[i]=='.'):\r\n\t\tanswer+='0'\r\n\t\ti+=1\r\n\tif(i<=n-1 and s[i]=='-' and s[i+1]=='.'):\r\n\t\tanswer+='1'\r\n\t\ti+=2\r\n\tif(i<=n-1 and s[i]=='-' and s[i+1]=='-'):\r\n\t\tanswer+='2'\r\n\t\ti+=2\r\nprint(answer)", "s = input()\r\nres = \"\"\r\ni = 0\r\nn = len(s)\r\nwhile i<n:\r\n if s[i]==\".\":\r\n res+=\"0\"\r\n i+=1\r\n elif s[i]==\"-\" and i+1<n and s[i+1]==\"-\":\r\n res+=\"2\"\r\n i+=2\r\n elif s[i]==\"-\" and i+1<n and s[i+1]==\".\":\r\n res+=\"1\"\r\n i+=2\r\nprint(res)\r\n ", "borze = input()\n\n# Define the dictionary mapping Borze code to ternary digits\nborze_dict = {'.': '0', '-.': '1', '--': '2'}\n\n\nresult = \"\"\n\ncont = 0\n\n# while cont < len(borze_code):\n# if borze_code[cont:cont+2] in borze_dict:\n\n# result += borze_dict[borze_code[i:i+2]]\n# cont += 2\n# else:\n# result += borze_dict[borze_code[i]]\n# cont += 1\n\n\nwhile cont <len(borze):\n if borze[cont] == '.':\n result += '0'\n cont += 1\n elif borze[cont] == '-' and borze [cont+1] == '.':\n result += '1'\n cont += 2\n elif borze[cont] == '-' and borze [cont+1] == '-':\n result += '2'\n cont += 2\n\n\n\n\nprint(result)", "borze = input()\r\ni = 0\r\nlista = []\r\nwhile i < len(borze):\r\n\tif borze[i] == '.':\r\n\t\tlista.append(0)\r\n\telse:\r\n\t\tif i >= len(borze):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tif borze[i+1] == '.':\r\n\t\t\t\tlista.append(1)\r\n\t\t\telse:\r\n\t\t\t\tlista.append(2)\r\n\t\t\ti+=1\r\n\ti+=1\r\nfor j in lista:\r\n print(j, end = \"\")", "s = input()\r\ni = 0\r\nn = len(s)\r\nwhile i < n:\r\n if(s[i]=='.'):\r\n print('0', end='')\r\n i+=1\r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n print('1', end='')\r\n i+=2\r\n else:\r\n print('2', end='')\r\n i+=2\r\n", "line = input()\r\nline = line.replace('--', '2')\r\nline = line.replace('-.', '1')\r\nline = line.replace('.', '0')\r\nprint(line)\r\n", "input=list(input())\r\nstr=''\r\nprev_swp=0\r\nfor i in range(0,len(input)):\r\n if prev_swp==1:\r\n prev_swp=0\r\n continue\r\n if input[i]=='.':\r\n str+='0'\r\n if input[i]=='-':\r\n if input[i+1]=='-':\r\n str+='2'\r\n prev_swp=1 \r\n if input[i+1]=='.':\r\n str+='1'\r\n prev_swp=1\r\nprint(str) ", "def borzetranslate(code):\n result=''\n skipnext=False\n for i in range(len(code)):\n if skipnext:\n skipnext=False\n continue\n if code[i]=='.':\n result+='0'\n elif code[i]=='-':\n if code[i+1]=='.':\n result+='1'\n elif code[i+1]=='-':\n result+='2'\n skipnext=True\n \n print(result)\n\ncode=input()\nborzetranslate(code)", "s=input()\r\nr=[]\r\ni=0\r\nwhile i<(len(s)):\r\n if s[i]=='.':\r\n r.append(0)\r\n i=i+1\r\n continue\r\n if s[i]=='-' and s[i+1]=='.':\r\n r.append(1)\r\n i=i+2\r\n continue\r\n if s[i]=='-' and s[i+1]=='-':\r\n r.append(2)\r\n i=i+2\r\n continue\r\nfor i in r:\r\n print(i,end=\"\")\r\n", "s = input()\r\nprev = '$'\r\nfor ch in s:\r\n if prev == '-':\r\n if ch == '.':\r\n print(1, end='')\r\n else:\r\n print(2, end='')\r\n prev = '$'\r\n else: # prev == '$'\r\n if ch == '.':\r\n print(0, end='') \r\n else:\r\n prev = '-'", "new_str = input()\r\npos = []\r\nans = ''\r\nfor i in range(len(new_str)):\r\n if i not in pos and (i + 1) != len(new_str):\r\n if new_str[i:i+2] == '-.':\r\n ans += '1'\r\n pos.append(i)\r\n pos.append(i + 1)\r\n if new_str[i:i + 2] == '--':\r\n ans += '2'\r\n pos.append(i)\r\n pos.append(i + 1)\r\n if i not in pos:\r\n if new_str[i] == '.':\r\n ans += '0'\r\n pos.append(i)\r\nprint(ans)", "s = input()\r\n\r\ns = list(s)\r\nelem = 0\r\nst = ''\r\n\r\nwhile elem < len(s):\r\n if s[elem] == '.':\r\n st += '0'\r\n elem += 1\r\n if elem < len(s)-1:\r\n if s[elem] == '-' and s[elem+1] == '.':\r\n st += '1'\r\n elem += 2\r\n elif s[elem] == '-' and s[elem+1] == '-':\r\n st += '2'\r\n elem += 2\r\nprint(st)\r\n ", "#BISMILLAH\r\n\r\ni = 0\r\ns = input()\r\nwhile i != len(s):\r\n if s[i] == \".\" and i==0:print(0, end='')\r\n elif s[i] == \"-\" and s[i+1] == \".\":\r\n print(1, end='')\r\n i += 1\r\n elif s[i] == \"-\" and s[i+1] == \"-\":\r\n print(2, end='')\r\n i += 1\r\n elif s[i] == \".\":\r\n print(0, end='')\r\n i += 1\r\n \r\n\r\n#ALHAMDULILLAH", "a = input()\r\ncount = 0\r\nfor i in a:\r\n if a[count] == '.':\r\n print(0, end=\"\")\r\n count += 1\r\n else:\r\n if a[count+1] == '.':\r\n print(1, end=\"\")\r\n else:\r\n print(2, end=\"\")\r\n count += 2\r\n if count >= len(a):\r\n break\r\n", "s = list(input())\r\nflag = False\r\nfor i in range(len(s)):\r\n if flag==True:\r\n flag=False\r\n continue\r\n if s[i]=='.':\r\n print(0, end='')\r\n elif s[i]=='-' and s[i+1]=='.':\r\n print(1, end='')\r\n flag = True\r\n else:\r\n print(2, end='')\r\n flag = True", "ls = list(input())\r\n\r\nd = {\".\": 0, \"-.\": 1, \"--\": 2}\r\nans = []\r\n\r\ni = 0\r\nbuff = \"\"\r\nwhile i < len(ls):\r\n if ls[i] == \".\" and not buff:\r\n ans.append(\"0\")\r\n else:\r\n buff += ls[i]\r\n if buff == \"-.\":\r\n ans.append(\"1\")\r\n buff = \"\"\r\n elif buff == \"--\":\r\n ans.append(\"2\")\r\n buff = \"\"\r\n i += 1\r\nprint(\"\".join(ans))", "inp = input()\ni = 0\nfin = ''\nwhile i<len(inp):\n if inp[i]=='.':\n fin+='0'\n i+=1\n elif inp[i]=='-' and inp[i+1]=='.':\n fin+='1'\n i+=2\n elif inp[i]=='-' and inp[i+1]=='-':\n fin+='2'\n i+=2\nprint(fin)\n", "s = str(input())\r\nk = len(s)\r\ni = 0\r\nx = ''\r\nwhile i<k:\r\n if s[i] == '.':\r\n x += '0'\r\n i += 1\r\n elif s[i+1] == '.':\r\n x += '1'\r\n i += 2\r\n else:\r\n x += '2'\r\n i += 2\r\nprint(x)", "s=input()\r\nl=list(s)\r\nb=\"\"\r\ni=0\r\nwhile(i<=len(l)-1):\r\n if(l[i]==\".\"):\r\n b=b+\"0\"\r\n i=i+1\r\n elif(l[i]==\"-\" and l[i+1]==\".\"):\r\n b=b+\"1\"\r\n i=i+2\r\n else:\r\n b=b+\"2\"\r\n i=i+2\r\nprint(b)", "#ashu@gate22\r\ns=input()\r\nno=\"\"\r\nlength=len(s)\r\ni=0\r\nwhile True:\r\n if i<length-1:\r\n if (s[i]==\"-\" and s[i+1]==\".\"):\r\n no+=\"1\"\r\n i+=2\r\n elif (s[i]==\"-\" and s[i+1]==\"-\"):\r\n no+=\"2\"\r\n i+=2\r\n elif s[i]==\".\":\r\n no+=\"0\"\r\n i+=1\r\n elif s[i]==\".\":\r\n no+=\"0\"\r\n i+=1\r\n if i>length-1:\r\n break\r\nprint(no)\r\n \r\n ", "code=input()\r\nn=[]\r\nk=0\r\nfor i in range(len(code)):\r\n\tif(k==len(code)):\r\n\t\tbreak\r\n\telif(code[k]==\".\"):\r\n\t\tn.append(0)\r\n\t\tk+=1\r\n\telif(code[k]==\"-\"):\r\n\t\tif(code[k+1]==\"-\"):\r\n\t\t\tn.append(2)\r\n\t\t\tk+=2\r\n\t\telse:\r\n\t\t\tn.append(1)\r\n\t\t\tk+=2\r\nfor i in range(len(n)):\r\n\tprint(n[i],end=\"\")", "s=input()\r\ndict={'.':'0','-.':'1','--':'2'}\r\nsym=['.','-.','--']\r\ni=0\r\nres=\"\"\r\nwhile(i<len(s)):\r\n x=s[i:i+2]\r\n if x in sym:\r\n res+=dict[x]\r\n i+=2\r\n else:\r\n res+='0'\r\n i+=1\r\nprint(res)\r\n \r\n", "from sys import stdin\n\nstream = None\ntry:\n stream = open('file.txt', 'r')\nexcept:\n stream = stdin\n\ncode = stream.readline().replace(\"--\", \"2\")\ncode = code.replace(\"-.\", \"1\")\ncode = code.replace(\".\", \"0\")\n\nprint(code)\n", "s = input()\r\n \r\ncache = \"\"\r\noutput = \"\"\r\nfor i in s:\r\n cache += i\r\n if cache == \".\":\r\n output += \"0\"\r\n cache = \"\"\r\n elif cache == \"-.\":\r\n output += \"1\"\r\n cache = \"\"\r\n elif cache == \"--\":\r\n output += \"2\"\r\n cache = \"\"\r\n \r\nprint(output)", "borze_code = input()\nzero = \".\"\none = \"-.\"\ntwo = \"--\"\n\niter = 0\n\nnumber = []\n\nwhile iter < len(borze_code):\n if(borze_code[iter] == zero):\n number.append(\"0\")\n if(iter == len(borze_code) - 1):\n break;\n double_code = borze_code[iter] + borze_code[iter+1] \n if(double_code == one):\n number.append(\"1\")\n iter+=1\n if(double_code == two):\n number.append(\"2\")\n iter+=1\n iter +=1\n\nprint(''.join(number))", "s = input()\r\nr = []\r\ntemp = 0\r\ncheck = 0\r\nfor i in range (0, len(s)):\r\n if(check == 1):\r\n check = 0\r\n pass\r\n else:\r\n if s[i] == \".\":\r\n r.append(\"0\")\r\n check = 0\r\n else:\r\n if(i == len(s) - 1):\r\n continue\r\n else:\r\n if s[i+1] == \".\":\r\n r.append(\"1\")\r\n check = 1\r\n else:\r\n r.append(\"2\")\r\n check = 1\r\nprint(\"\".join(r))\r\n", "s = input()\r\nd = {'.' : '0' , '-.' : '1' , '--' : '2'}\r\n\r\nres = ''\r\n\r\nfor i in range(len(s)):\r\n res += s[i]\r\n if res in d :\r\n print(d[res] , end = '')\r\n res = ''\r\n", "\r\n# https://codeforces.com/problemset/problem/32/B\r\nif __name__ == '__main__':\r\n borze_code = str(input())\r\n\r\n borze_code = borze_code.replace(\"--\", \"2\")\r\n borze_code = borze_code.replace(\"-.\", \"1\")\r\n borze_code = borze_code.replace(\".\", \"0\")\r\n\r\n print(borze_code)\r\n\r\n", "s = input()\r\n\r\nans = []\r\n\r\ni = 0\r\n\r\nwhile i < len(s) - 1:\r\n \r\n if s[i] == '.':\r\n ans.append(0)\r\n i += 1\r\n continue\r\n \r\n if s[i] == '-' and s[i + 1] == '.':\r\n ans.append(1)\r\n i += 2\r\n continue\r\n \r\n if s[i] == '-' and s[i + 1] == '-':\r\n ans.append(2)\r\n i += 2\r\n \r\nif i == len(s) - 1:\r\n ans.append('0')\r\n \r\nprint(*ans, sep = '')", "code = input()\r\n\r\ncode = code.replace(\"--\", \"2\")\r\ncode = code.replace(\"-.\", \"1\")\r\ncode = code.replace(\".\", \"0\")\r\n\r\nprint(code)", "s = input()\r\na = ''\r\nc = 0\r\n\r\nwhile c < len(s):\r\n if s[c] == '.':\r\n if c == 0:\r\n a += '0'\r\n c+=1\r\n elif s[c-1] == '.':\r\n a += '0'\r\n c+=1\r\n elif s[c-1] == '-' and s[c-2] == '-' and c > 1:\r\n a += '0'\r\n c+=1\r\n else:\r\n a += '1'\r\n c+=2\r\n else:\r\n if s[c+1] == '-':\r\n a += '2'\r\n else:\r\n a += '1'\r\n c+=2\r\n\r\nprint(a)", "if __name__ == '__main__':\r\n s = input()\r\n vocab = {\r\n '.': '0',\r\n '-.': '1',\r\n '--': '2'\r\n }\r\n res = ''\r\n curr = ''\r\n for ch in s:\r\n curr += ch\r\n if curr in vocab:\r\n res += vocab[curr]\r\n curr = ''\r\n print(res)\r\n", "def inpstr():\r\n return(input())\r\n\r\nn = inpstr()\r\ns = \"\"\r\ncont = 0\r\n\r\nif n[-1] == \".\":\r\n r = len(n)\r\nelse:\r\n r = len(n)-1\r\n\r\nfor x in range(r):\r\n if cont == 1:\r\n cont = 0\r\n continue\r\n elif n[x] == \"-\" and n[x+1] == \"-\":\r\n s += \"2\"\r\n cont = 1\r\n elif n[x] == \"-\" and n[x+1] == \".\":\r\n s += \"1\"\r\n cont = 1\r\n elif n[x] == \".\":\r\n s += \"0\"\r\n \r\nprint(s)", "def main():\r\n m = open(0).read().replace('--', '2').replace('-.', '1').replace('.', '0')\r\n \r\n print(m)\r\n \r\n\r\n\r\nmain()", "borze_code = input() # Read the Borze code as a string\r\ndecoded_number = [] # Initialize an empty list to store the decoded ternary digits\r\n\r\ni = 0 # Initialize an index variable to traverse the Borze code string\r\n\r\nwhile i < len(borze_code):\r\n if borze_code[i] == '.':\r\n decoded_number.append('0') # If the current character is '.', add '0' to the decoded number\r\n elif borze_code[i] == '-':\r\n if i + 1 < len(borze_code) and borze_code[i + 1] == '.':\r\n decoded_number.append('1') # If the current character is '-' and the next is '.', add '1' to the decoded number\r\n i += 1 # Skip the next character\r\n elif i + 1 < len(borze_code) and borze_code[i + 1] == '-':\r\n decoded_number.append('2') # If the current character is '-' and the next is '-', add '2' to the decoded number\r\n i += 1 # Skip the next character\r\n i += 1 # Move to the next character in the Borze code\r\n\r\n# Join the decoded ternary digits and print the result\r\nprint(''.join(decoded_number))", "s=input()\r\nflag=False\r\nres=''\r\nfor i in s:\r\n if flag:\r\n if i=='.':\r\n res=res+'1'\r\n else:\r\n res=res+'2'\r\n flag=False\r\n else:\r\n if i=='.':\r\n res=res+'0'\r\n else:\r\n flag=True\r\nprint(res)\r\n \r\n \r\n", "#borze\r\nseq=list(input())\r\ni=0\r\nres=\"\"\r\nwhile(i<len(seq)):\r\n if(seq[i]=='.'):\r\n res+=\"0\"\r\n i+=1\r\n elif(seq[i]=='-' and seq[i+1]=='.'):\r\n res+=\"1\"\r\n i+=2\r\n else:\r\n res+=\"2\"\r\n i+=2\r\nprint(res)", "code = input()\r\n\r\n# \"0\" = \".\"\r\n# \"1\" = \"-.\"\r\n# \"2\" = \"--\"\r\n\r\nresult = \"\"\r\n\r\ni = 0\r\nwhile i < len(code):\r\n if code[i]==\".\":\r\n result += \"0\"\r\n if code[i]==\"-\":\r\n if code[i+1]==\".\":\r\n result += \"1\"\r\n elif code[i+1]==\"-\":\r\n result += \"2\"\r\n else:\r\n print(\"bad code\")\r\n i += 1\r\n i += 1\r\n\r\nprint(result)\r\n\r\n", "a=input()\r\na=a+'0'\r\ns=[]\r\ni=0\r\nwhile(i<len(a)-1):\r\n if(a[i]=='.'):\r\n s.append('0')\r\n i=i+1\r\n elif (a[i]=='-'):\r\n i=i+1\r\n if(a[i]=='.'):\r\n s.append('1')\r\n i=i+1\r\n else:\r\n s.append('2')\r\n i=i+1\r\nprint(''.join(s))\r\n", "s = input()\r\n\r\noutput = \"\"\r\n\r\ni = 0\r\n\r\nwhile i <= len(s)-1:\r\n if s[i] is '.':\r\n output += \"0\"\r\n i+=1\r\n else:\r\n if s[i+1] is '.':\r\n output += \"1\"\r\n i+=2\r\n else:\r\n output += \"2\"\r\n i+=2\r\n\r\nprint(output)\r\n", "S=input()\r\ni=0\r\nan=[]\r\nwhile i < len(S):\r\n if S[i] =='.': \r\n an+=[\"0\"]\r\n i+=1\r\n \r\n elif S[i+1] =='.': \r\n an+=[\"1\"]\r\n i+=2\r\n else: \r\n an+=[\"2\"]\r\n i+=2\r\n \r\nprint(\"\".join(an)) ", "t=input()\r\na=[]\r\ni=0\r\nwhile i<len(t):\r\n if t[i]==\".\":\r\n a.append(0)\r\n elif t[i]==\"-\":\r\n try:\r\n if t[i+1]==\".\":\r\n a.append(1)\r\n i+=1\r\n elif t[i+1]:\r\n a.append(2)\r\n i+=1\r\n except:\r\n break\r\n i+=1\r\nfor i in a:\r\n print(int(i),end=\"\")", "a = ['.','-.','--']\r\nb = list(input())\r\nc = ''\r\nwhile True:\r\n if len(b) >= 2: \r\n if b[0] + b[1] not in a:\r\n c += '0'\r\n b.remove(b[0])\r\n else:\r\n c += str(a.index(b[0] + b[1]))\r\n b.remove(b[0])\r\n b.remove(b[0])\r\n elif len(b) == 1:\r\n c += '0'\r\n break\r\n else:\r\n break\r\nprint(c)", "s=input()\r\nn=len(s)\r\ni=0\r\np=''\r\nwhile(i<n):\r\n if s[i]=='.':\r\n p+='0'\r\n i+=1\r\n else:\r\n if s[i+1]=='.':\r\n p+='1'\r\n else:\r\n p+='2'\r\n i+=2\r\nprint(p)", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n'''\r\n ██╗ ██╗ ███╗ ███╗ ██╗ ████████╗\r\n ██║ ██║ ████╗ ████║ ██║ ╚══██╔══╝\r\n═════════██╠════════██╠═══██╔████╔██╠═══██╠══════██╠══════════\r\n ██║ ██║ ██║╚██╔╝██║ ██║ ██║\r\n ███████╗ ██║ ██║ ╚═╝ ██║ ██║ ██║\r\n ╚══════╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝ ╚═╝\r\n'''\r\n\r\n#文字列入力はするな！！\r\n#carpe diem\r\n\r\ns=input()\r\nans=''\r\ntemp=''\r\nfor i in s:\r\n temp+=i\r\n if temp=='.':\r\n ans+='0'\r\n temp=''\r\n elif temp=='-.':\r\n ans+='1'\r\n temp=''\r\n elif temp=='--':\r\n ans+='2'\r\n temp=''\r\n\r\nprint(ans) \r\n\r\n\r\n \r\n \r\n\r\n#carpe diem \r\n#carpe diem", "ter = \"1\".join(\"2\".join(input().split(\"--\")).split(\"-.\"))\r\nfor d in ter:\r\n if d == '.': print(0, end=\"\")\r\n else: print(d, end=\"\")\r\n", "y=input()\r\ne=0\r\nwhile(e<len(y)):\r\n if y[e]==\".\":\r\n print(0,end=\"\")\r\n e+=1\r\n else:\r\n if y[e+1]==\".\":\r\n print(1,end=\"\") \r\n else:print(2,end=\"\") \r\n e+=2 ", "import sys\n\n\n\nif __name__ == \"__main__\":\n code = input()\n n0 = \".\"\n n1 = \"-.\"\n n2 = \"--\"\n output = \"\"\n i = 0\n while i < len(code):\n substr = code[i:i+2]\n if code[i] == n0:\n output += '0'\n i = i+1\n # print(\"hello\")\n if code[i:i+2] == n1:\n output += '1'\n i = i+2\n elif code[i:i+2] == n2:\n output += '2'\n i = i+2\n print(output)\n", "import math\r\nfrom collections import OrderedDict\r\nfrom collections import Counter\r\nfrom itertools import combinations\r\n#a= list(map(int, input(\"\").strip().split()))[:n]\r\ndef solve(s):\r\n i=0\r\n d=[]\r\n e=\"\"\r\n while i<len(s)-1:\r\n if s[i]=='.' and (s[i+1]=='-' or s[i+1]=='.'):\r\n d.append('0')\r\n i+=1\r\n e+=s[i]\r\n elif s[i]=='-' and s[i+1]=='-':\r\n d.append('2')\r\n e+=s[i]+s[i+1]\r\n i+=2\r\n elif s[i]=='-' and s[i+1]=='.':\r\n d.append('1')\r\n e+=s[i]+s[i+1]\r\n i+=2\r\n if len(e)==len(s)-1:\r\n d.append('0')\r\n print(''.join(d))\r\nn= input(\"\")\r\nsolve(n)\r\n \r\n", "v = \"\"\ns = input()\ni = 0\nwhile i < len(s):\n if s[i] == \"-\" and s[i+1] == \".\":\n v += \"1\"\n i += 1\n elif s[i] == \"-\" and s[i+1] == \"-\":\n v += \"2\"\n i += 1\n elif s[i] == \".\":\n v += \"0\"\n\n i += 1\n\nprint(v)\n", "string = input()\r\nnumber = ''\r\n\r\nwhile string:\r\n if string[0] == '.':\r\n number += '0'\r\n string = string.replace('.', '', 1)\r\n elif string[0:2] == '-.':\r\n number += '1'\r\n string = string.replace('-.', '', 1)\r\n elif string[0:2] == '--':\r\n number += '2'\r\n string = string.replace('--', '', 1)\r\n else:\r\n string = ''\r\n\r\nprint(number)", "str = input()\r\nstr = str.replace(\"--\", \"2\")\r\nstr = str.replace(\"-.\", \"1\")\r\nstr = str.replace(\".\", \"0\")\r\nprint(str)", "s=input()\r\ndic={\".\":\"0\",\"-.\":\"1\",\"--\":\"2\"}\r\nans=\"\"\r\ni=0\r\nn=len(s)\r\nwhile (i<n):\r\n try:\r\n ans+=dic[s[i]]\r\n i+=1\r\n except:\r\n ans+=dic[s[i:i+2]]\r\n i+=2\r\nprint(ans) ", "s = input()\r\na = s.replace('--', '2')\r\nb = a.replace('-.', '1')\r\nc = b.replace('.', '0')\r\nprint(c)\r\n#print(r(r(r(input(),'--','2'),'-.','1'),'.','0'))\r\n", "ms = input()\r\n\r\ndef borze_code(s):\r\n res = []\r\n\r\n i = 0\r\n while i < len(s):\r\n if s[i] == '.':\r\n res.append('0')\r\n i += 1\r\n elif s[i] == '-' and s[i + 1] == '.':\r\n res.append('1')\r\n i += 2\r\n else:\r\n res.append('2')\r\n i += 2\r\n\r\n return ''.join(res)\r\n\r\nprint(borze_code(ms))", "str=input()\r\nst=''\r\ni=0\r\nwhile i<len(str):\r\n if str[i]=='.':\r\n st=st+'0'\r\n if(str[i]=='-' and str[i+1]=='.'):\r\n st=st+'1'\r\n i=i+1\r\n if(str[i]=='-' and str[i+1]=='-'):\r\n st=st+'2'\r\n i=i+1\r\n i=i+1\r\nprint(st)\r\n ", "#32B\r\ns=input()\r\n#0 .\r\n#1 -.\r\n#2 --\r\nl=len(s)\r\ni=0\r\nx=''\r\nwhile i<l:\r\n\tif (s[i]=='.'):\r\n\t\tx=x+'0'\r\n\t\ti+=1\r\n\telif (s[i]=='-'):\r\n\t\tif (s[i+1]=='.'):\r\n\t\t\tx=x+'1'\r\n\t\telse:\r\n\t\t\tx=x+'2'\r\n\t\ti+=2\r\nprint(x)\t\t", "import sys\r\n\r\nstra=str(input())\r\ni=0\r\nsaa=\"\"\r\nwhile(i<len(stra)):\r\n if(stra[i]=='.'):\r\n saa+=\"0\"\r\n i+=1\r\n elif(stra[i]=='-' and stra[i+1]=='.'):\r\n saa+=\"1\"\r\n i+=2\r\n else:\r\n saa+=\"2\"\r\n i+=2\r\nprint(saa)", "s = input()\r\nn = len(s)\r\nstr1 = \"\"\r\ni = 0\r\nwhile i < n:\r\n if s[i] == \".\":\r\n str1 += \"0\"\r\n i += 1\r\n elif s[i] == \"-\":\r\n if i == n-1:\r\n i += 1\r\n else:\r\n if s[i+1] == \".\":\r\n str1 += \"1\"\r\n i += 2\r\n elif s[i+1] == \"-\":\r\n str1 += \"2\"\r\n i += 2\r\nprint(str1)\r\n\r\n", "s = input()\r\ni, n = 0, len(s)\r\nresult = \"\"\r\nwhile i < n:\r\n if s[i] == \".\":\r\n result += \"0\"\r\n i += 1\r\n elif i + 1 < n and s[i : i + 2] == \"-.\":\r\n result += \"1\"\r\n i += 2\r\n elif i + 1 < n and s[i : i + 2] == \"--\":\r\n result += \"2\"\r\n i += 2\r\nprint(result)\r\n", "encoded=input()\r\ni=0\r\ndecoded=''\r\nwhile(i<len(encoded)):\r\n if i==len(encoded)-1:\r\n decoded+='0'\r\n break\r\n if encoded[i:i+2]=='--':\r\n decoded+='2'\r\n i+=2\r\n \r\n elif encoded[i:i+2]=='-.':\r\n decoded+='1'\r\n i+=2\r\n \r\n else:\r\n decoded+='0'\r\n i+=1\r\n \r\nprint(decoded)", "a = input()\r\nr = \"\"\r\ni = 0\r\nwhile (i <=len(a)-1):\r\n \r\n if a[i] == \".\":\r\n r +=\"0\"\r\n \r\n i +=1\r\n elif a[i] == \"-\" and a[i+1] == \".\":\r\n r +=\"1\"\r\n i +=2\r\n \r\n elif a[i] == \"-\" and a[i+1] == \"-\":\r\n r +=\"2\"\r\n i +=2\r\n \r\nprint(r)\r\n\r\n\r\n", "a = input()\r\nnol = '.'\r\nodin = '-.'\r\ndva = '--'\r\nwhile a:\r\n if a[0] == nol:\r\n print('0', end = '')\r\n a = a[1:]\r\n elif a[0] == '-':\r\n if a[:2] == odin:\r\n print('1', end='')\r\n a = a[2:]\r\n elif a[:2] == dva:\r\n print('2', end='')\r\n a = a[2:]\r\n ", "# Happy_water\r\ndef main():\r\n s = input()\r\n ans = \"\"\r\n i = 0\r\n while i < len(s):\r\n if s[i] == '.':\r\n ans += '0'\r\n i += 1\r\n elif s[i] == '-' and s[i + 1] == '.':\r\n ans += '1'\r\n i += 2\r\n elif s[i] == '-' and s[i + 1] == '-':\r\n ans += '2'\r\n i += 2\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "Value=input(\"\")\r\nResult=[]\r\nCounter=0\r\nwhile True:\r\n\tif Counter >= len(Value):\r\n\t\tbreak\r\n\telif Value[Counter]==\".\":\r\n\t\tResult.append(0)\r\n\t\tCounter+=1\r\n\telif Value[Counter]==\"-\" and Value[Counter+1]==\".\":\r\n\t\tResult.append(1)\r\n\t\tCounter+=2\r\n\telse:\r\n\t\tResult.append(2)\r\n\t\tCounter+=2\r\nfor c in Result:\r\n\tprint(c,end=\"\")", "string = input().strip()\r\n\r\ni = 0\r\n\r\nwhile i < len(string) :\r\n if string[i] == \".\" :\r\n print(\"0\", end = \"\")\r\n else :\r\n i += 1\r\n if string[i] == \".\" :\r\n print(\"1\", end = \"\")\r\n else :\r\n print(\"2\", end = \"\")\r\n i += 1\r\n \r\n", "s = input()\r\nans = []\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '-':\r\n if s[i + 1] == '-':\r\n ans.append(2)\r\n else:\r\n ans.append(1)\r\n i += 1\r\n else:\r\n ans.append(0)\r\n i += 1\r\nprint(*ans, sep='')\r\n", "# B. Borze\r\n\r\ns = input()\r\nout = \"\"\r\nflag = 0\r\nfor i in range(len(s)):\r\n if flag == 0:\r\n if s[i]==\"-\" and s[i+1]==\".\":\r\n out += \"1\"\r\n flag += 1\r\n elif s[i]==\"-\" and s[i+1]==\"-\":\r\n out += \"2\"\r\n flag += 1\r\n else:\r\n out += \"0\"\r\n else:\r\n flag -= 1\r\nprint(out)\r\n\r\n \r\n \r\n ", "s = str(input())\r\nres1 = s.replace('--', '2')\r\nres2 = res1.replace('-.', '1')\r\nres3 = res2.replace('.', '0')\r\nprint(res3)\r\n", "\r\ns = input()\r\n\r\nn = len(s)\r\ni=0\r\nans=[]\r\n\r\nwhile(i<n):\r\n if s[i]=='.':\r\n ans.append(\"0\")\r\n i+=1\r\n elif s[i:i+2]==\"-.\":\r\n ans.append(\"1\")\r\n i+=2\r\n else:\r\n ans.append(\"2\")\r\n i+=2\r\n\r\nprint(\"\".join(ans))\r\n\r\n", "s = input()\r\ndt = {'.': '0', \"-.\": '1', \"--\": '2'}\r\ncur = ''\r\nres = ''\r\nfor elem in s:\r\n cur += elem\r\n if cur in dt:\r\n res += dt[cur]\r\n cur = ''\r\nprint(res)\r\n", "def parseBorze(s):\r\n i = 0\r\n result = []\r\n while i < len(s):\r\n if s[i] == '-' and i + 1 < len(s):\r\n if s[i+1] == '.':\r\n result.append('1')\r\n else:\r\n result.append('2')\r\n i += 2\r\n else:\r\n result.append('0')\r\n i += 1\r\n return ''.join(result)\r\n \r\ns = input()\r\nprint(parseBorze(s))", "code = input()\r\noutput = ''\r\nskip = False\r\n\r\nfor i in range(len(code)):\r\n if skip == True:\r\n skip = False\r\n continue\r\n else:\r\n if code[i] == '.':\r\n output+='0'\r\n elif code[i] == '-':\r\n if code[i+1] == '.':\r\n output+='1'\r\n skip = True\r\n else:\r\n output+='2'\r\n skip = True\r\nprint(output)", "inp = str(input())\r\npdash=0\r\npdot=0\r\nfor i in inp:\r\n if(i==\".\" and pdash==0):\r\n print(\"0\",end =\"\")\r\n elif i==\"-\" and pdot==1 or i==\".\" and pdash==1:\r\n print(\"1\",end =\"\")\r\n pdot=0\r\n pdash=0\r\n elif i == \"-\" and pdash== 1:\r\n print(\"2\",end =\"\")\r\n pdash=0\r\n elif i == \"-\":\r\n pdash = 1\r\n else:\r\n pdot = 1\r\n ", "s=input()\r\nst=''\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n st+='0'\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n st+='1'\r\n i+=2\r\n elif s[i]=='-' and s[i+1]=='-':\r\n st+='2'\r\n i+=2\r\n\r\nprint(st)\r\n", "s = input()\r\n\r\nl = ['--', '-.', '.']\r\nn = ['2', '1', '0']\r\n\r\nfor i in range(len(l)):\r\n s = s.replace(l[i], n[i])\r\n\r\nprint(s)", "def inp(): # int inputs\r\n return(int(input()))\r\ndef inlt(): # list inputs\r\n return(list(map(int,input().split())))\r\ndef insr(): # string inputs\r\n s = input()\r\n return(list(s[:len(s) ]))\r\ndef invr(): # space sepreated intergel varibales\r\n return(map(int,input().split()))\r\n\r\n\r\nqueue = insr()\r\ncurr = \"\"\r\n\r\n\r\ni = 0\r\nwhile (i < len(queue)):\r\n if (queue[i] == \".\"):\r\n curr = curr + \"0\"\r\n i += 1\r\n elif (queue[i+1] == \".\"):\r\n curr = curr + \"1\"\r\n i += 2\r\n else:\r\n curr = curr + \"2\"\r\n i += 2\r\nprint(curr)\r\n\r\n\r\n", "m = input()\r\nx = \"\"\r\nn = \"\"\r\nfor item in m:\r\n x += item\r\n if x == \".\":\r\n n += \"0\"\r\n x = \"\"\r\n elif x == \"-.\":\r\n n += \"1\"\r\n x = \"\"\r\n elif x == \"--\":\r\n n += \"2\"\r\n x = \"\"\r\nprint(n)", "str=input()\r\nstr=str.replace(\"--\",\"2\")\r\nstr=str.replace(\"-.\",\"1\")\r\nstr=str.replace(\".\",\"0\")\r\nprint(str)", "read=input()\r\nres=\"\"\r\ni=0\r\nwhile(i<len(read)):\r\n if(read[i]==\"-\" and read[i+1]==\".\"):\r\n res+=\"1\"\r\n i+=2\r\n elif(read[i]==\"-\" and read[i+1]==\"-\"):\r\n res+=\"2\"\r\n i+=2\r\n else:\r\n res+=\"0\"\r\n i+=1\r\nprint(res)\r\n\r\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ns = input()\r\nans = str()\r\nd = len(s)\r\ni = 0\r\nwhile i < d:\r\n if s[i] == \".\":\r\n ans += \"0\"\r\n i += 1\r\n else:\r\n if s[i] == \"-\" and s[i + 1] == \".\":\r\n ans += \"1\"\r\n i += 2\r\n else:\r\n ans += \"2\"\r\n i += 2\r\nprint(ans)", "def Borze(code):\r\n i = 0\r\n while(i <= len(code)-1):\r\n \r\n if code[i] == '-'and code[i+1] == '.':\r\n print('1', end = '')\r\n i+=2\r\n elif code[i] == '-'and code[i+1] == '-':\r\n print('2', end ='')\r\n i+=2\r\n elif code[i] == '.':\r\n print('0',end = '')\r\n i+=1\r\n \r\n \r\ncode = input()\r\nBorze(code)", "a=input()\r\nf=0\r\nfor i in range(len(a)):\r\n if f==1:\r\n f=0\r\n continue\r\n if a[i]=='.':\r\n print('0',end='')\r\n else:\r\n if a[i+1]=='.':\r\n print('1',end='')\r\n else:\r\n print(2,end='')\r\n f=1\r\n", "s=input()\r\ni=0\r\nj=2\r\nout=''\r\nwhile(i<=len(s)-1):\r\n if s[i:j]==\"-.\":\r\n out+='1'\r\n i=j;\r\n j+=2\r\n elif s[i:j]==\"--\":\r\n out+='2'\r\n i=j\r\n j+=2\r\n else:\r\n out+='0'\r\n i+=1\r\n j+=1\r\nprint(out)", "s = input()\r\ncurr = \"\"\r\nans = \"\"\r\nfor c in s:\r\n if c == \".\":\r\n if curr == \"\":\r\n ans += \"0\"\r\n else:\r\n curr = \"\"\r\n ans += \"1\"\r\n else:\r\n if curr == \"-\":\r\n curr = \"\"\r\n ans += \"2\"\r\n else:\r\n curr += \"-\"\r\nprint(ans)", "s=input()\r\ns=s.replace('--','2')\r\ns=s.replace('-.','1')\r\ns=s.replace('.','0')\r\nprint((s))\r\n", "s = input()\r\nans = ''\r\nk = 0\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n if k == 0:\r\n ans += '0'\r\n else:\r\n ans += '1'\r\n k = 0\r\n else:\r\n if k == 1:\r\n ans += '2'\r\n k = 0\r\n else:\r\n k = 1\r\n i += 1\r\nprint(ans)\n# Fri Oct 16 2020 16:45:15 GMT+0300 (Москва, стандартное время)\n", "s = [c for c in input()]\r\n\r\ni = 0\r\no = ''\r\n\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n o += '0'\r\n i += 1\r\n elif s[i] + s[i + 1] == '-.':\r\n o += '1'\r\n i += 2\r\n elif s[i] + s[i + 1] == '--':\r\n o += '2'\r\n i += 2\r\n\r\nprint(o)\r\n", "s = input()\r\nn = ''\r\ni=0\r\nwhile(i<=len(s)-1):\r\n if s[i] == '.': n += '0'\r\n if s[i] == '-' and s[i + 1] == '.':\r\n n += '1'\r\n i += 1\r\n if s[i] == '-' and s[i + 1] == '-':\r\n n += '2'\r\n i += 1\r\n i += 1\r\n\r\nprint(n)", "n = input()\r\nn = list(n)\r\nm = []\r\nt = len(n)\r\ni = 0\r\nwhile i < t:\r\n if n[i] == '.':\r\n m.append(0)\r\n i += 1\r\n if i+1 < t and n[i] =='-' and n[i+1] == '.':\r\n m.append(1)\r\n i = i + 2\r\n if i+1 < t and n[i] =='-' and n[i+1] == '-':\r\n m.append(2)\r\n i = i + 2\r\nprint(\"\".join(map(str, m)))", "code = input()\r\n\r\ncode = list(code)\r\nternary = ''\r\nstart = True\r\nfor i in range(len(code)):\r\n if start:\r\n if code[i] == '.':\r\n ternary += '0'\r\n elif code[i] == '-':\r\n start = False\r\n else:\r\n if code[i] == '.':\r\n ternary += '1'\r\n elif code[i] == '-':\r\n ternary += '2'\r\n start = True\r\nprint(ternary)", "s = input()\r\nli = []\r\nfor i in s:\r\n li.append(i)\r\n \r\ni = 0\r\nnew_li = []\r\n\r\nwhile(i<len(li)):\r\n \r\n if li[i] == \".\":\r\n new_li.append(\"0\")\r\n i += 1\r\n \r\n elif li[i] == \"-\":\r\n \r\n if li[i+1] == \".\":\r\n new_li.append(\"1\")\r\n \r\n elif li[i+1] == \"-\":\r\n new_li.append(\"2\")\r\n \r\n i += 2\r\n \r\ns = \"\".join(new_li)\r\nprint(s)", "dictionary={\".\":0,\r\n \"-.\":1,\r\n \"--\":2}\r\n\r\nstring=list(input())\r\ndata=\"\"\r\n#print(string)\r\nfor i in string:\r\n \r\n if data not in dictionary:\r\n data+=i\r\n if data in dictionary:\r\n print(dictionary[data],end=\"\")\r\n data=\"\"\r\n\r\n \r\n", "import sys\r\n\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# sys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef in_int():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef in_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\ndef in_map_int():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ndef in_arr_int():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\ndef in_arr_str():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef is_prime(n):\r\n for i in range(2, int(n ** (1/2)) + 1):\r\n if n % i == 0:\r\n return True\r\n return False\r\n\r\n\r\ndef solve(s):\r\n ans = \"\"\r\n i = 0\r\n n = len(s)\r\n while i < n:\r\n if s[i] == '-' and i + 1 < n and s[i + 1] == '.':\r\n ans += '1'\r\n i += 1\r\n elif s[i] == '-' and i + 1 < n and s[i + 1] == '-':\r\n ans += '2'\r\n i += 1\r\n elif s[i] == '.':\r\n ans += '0'\r\n i += 1\r\n return ans\r\n\r\n\r\ndef main():\r\n s = in_str()\r\n print(solve(s))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n# трамвай - 1\r\n# n = 48\r\n", "s = input()\r\n\r\nl = len(s)\r\ni = 0\r\nli = []\r\na = ''\r\n\r\nwhile i < l:\r\n if s[i] == '.':\r\n li.append('0')\r\n i += 1\r\n elif s[i] == '-' and s[i + 1] == '.':\r\n li.append('1')\r\n i += 2\r\n elif s[i] == '-' and s[i + 1] == '-':\r\n li.append('2')\r\n i += 2\r\n \r\nprint(a.join(li))", "n = input()\r\ni=0\r\ns = ''\r\nwhile i < len(n):\r\n if n[i] == '.':\r\n s+='0'\r\n i+=1\r\n else:\r\n if n[i]+n[i+1] == '-.':\r\n s+='1'\r\n else:\r\n s+='2'\r\n i+=2\r\nprint(s)\r\n ", "# import sys\r\n# sys.stdin = open('/home/puneet/Documents/Cpp Programs/input.txt', 'r')\r\n# sys.stdout = open('/home/puneet/Documents/Cpp Programs/output.txt', 'w') \r\n\r\nn = input()\r\ni=0\r\nwhile(i<len(n)):\r\n\tif(n[i]=='-' and n[i+1]=='-'):\r\n\t\tprint(2,end=\"\")\r\n\t\ti+=2\r\n\telif(n[i]=='-' and n[i+1]=='.'):\r\n\t\tprint(1,end=\"\")\r\n\t\ti+=2\r\n\telif(n[i]=='.'):\r\n\t\tprint(0,end=\"\")\r\n\t\ti+=1", "s = input()\r\ns = [s[i] for i in range(len(s))]\r\nfor i in range(len(s)):\r\n if s[i]=='.':\r\n s[i]='0'\r\n if i<len(s)-1:\r\n if s[i]=='-'and s[i+1]=='-':\r\n s[i]='2'\r\n s[i+1]=''\r\n elif s[i]=='-'and s[i+1]=='.':\r\n s[i]='1'\r\n s[i+1]=''\r\nprint(''.join(s))", "str = input()\r\ni=0\r\nsub=\"\"\r\nwhile i < len(str):\r\n if str[i] == \".\":\r\n i+=1\r\n sub+=\"0\"\r\n elif str[i]==\"-\" and str[i+1]==\".\":\r\n i+=2\r\n sub+=\"1\"\r\n elif str[i]==\"-\" and str[i+1]==\"-\":\r\n i+=2\r\n sub+=\"2\"\r\nprint(sub)", "a=input()\r\ns = ''\r\ni = 0 \r\nwhile i<len(a):\r\n if a[i] == '.':\r\n s = s+'0'\r\n i = i + 1 \r\n elif a[i] == '-' and i+1 < len(a): \r\n if a[i+1] == '.': \r\n s = s+'1'\r\n elif a[i+1] == '-':\r\n s = s+'2'\r\n i = i+2 \r\n\r\nprint(s)\r\n ", "a = input()\r\nn = len(a)\r\ns = ''\r\nbr = 0\r\nfor i in range(n-1):\r\n if(br == 0):\r\n if(a[i] == a[i+1] and a[i] == '-'):\r\n s += '2'\r\n br = 1\r\n elif(a[i] == '-'):\r\n s += '1'\r\n br = 1\r\n else:\r\n s += '0'\r\n else:\r\n br = 0\r\n \r\nif(a[n-1] == '.' and br == 0):\r\n s += '0'\r\nprint(s)", "lst={'.','-'} #. -. --\r\ninp=input()\r\nans=''\r\nk=len(inp)\r\ni=0\r\nwhile(k>0):\r\n if inp[i]=='-':\r\n if inp[i+1]=='.':\r\n ans+='1'\r\n elif inp[i+1]=='-':\r\n ans+='2'\r\n i+=2\r\n k-=2\r\n elif inp[i]=='.':\r\n ans+='0'\r\n i+=1\r\n k-=1\r\nprint(ans)\r\n \r\n \r\n", "ans=\"\"\r\nst=input()\r\ni=0\r\nwhile(i<len(st)):\r\n if(st[i]==\"-\" and i+1<len(st)):\r\n if(st[i+1]==\".\"):\r\n ans+=\"1\"\r\n else:\r\n ans+=\"2\"\r\n i+=2\r\n else:\r\n ans+=\"0\"\r\n i+=1\r\nprint(ans)\r\n", "c=input()\r\ncc=\"\"\r\ni=0\r\nwhile(i<len(c)):\r\n if c[i]==\".\":\r\n cc+=\"0\"\r\n i+=1\r\n elif c[i]==\"-\":\r\n if c[i+1]==\".\":\r\n cc+=\"1\"\r\n i+=2\r\n else:\r\n cc+=\"2\"\r\n i+=2\r\nprint(cc)", "a = str(input())\r\nans = ''\r\nind = 0\r\nwhile ind <= len(a) - 1:\r\n if a[ind] == '.':\r\n ans += '0'\r\n ind += 1\r\n else:\r\n if a[ind + 1] == '.':\r\n ans += '1'\r\n ind += 2\r\n else:\r\n ans += '2'\r\n ind += 2\r\nprint(ans)", "a=input()\r\nprint(a.replace(\"--\",'2').replace(\"-.\",'1').replace('.','0'))", "code = input()\ntext = ''\n\ni = 0\nwhile i < len(code):\n if code[i]=='.':\n text += '0'\n i += 1\n\n elif code[i:i+2] == '-.':\n text += '1'\n i += 2\n\n elif code[i:i+2] == '--':\n text += '2'\n i += 2\n\nprint (text)\n", "'''// Problem: B. Borze\r\n// Contest: Codeforces - Codeforces Beta Round #32 (Div. 2, Codeforces format)\r\n// URL: https://codeforces.com/problemset/problem/32/B\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\ns=input()\r\ni=0\r\nwhile(i<len(s)):\r\n\tif(s[i]==\".\"):\r\n\t\tprint('0',end=\"\")\r\n\t\ti=i+1\r\n\telif(s[i]==\"-\" and s[i+1]==\".\"):\r\n\t\tprint(\"1\",end=\"\")\r\n\t\ti=i+2\r\n\telif(s[i]==\"-\" and s[i+1]==\"-\"):\r\n\t\tprint(\"2\",end=\"\")\r\n\t\ti=i+2\r\n\t", "s = input()\r\na = \"\"\r\ns=\" \"+s\r\nx = 0\r\nfor i in range(1,len(s)):\r\n if s[i]==\".\" and i!=x:\r\n a+=\"0\"\r\n elif s[i]==\"-\" and i!=x:\r\n if s[i+1]==\".\":\r\n x = i+1\r\n a+=\"1\"\r\n if s[i+1]==\"-\":\r\n x = i+1\r\n a+=\"2\"\r\n\r\n\r\nprint(a)\r\n\r\n", "s = input()\r\n\r\nans = \"\"\r\ntemp = \"\"\r\nfor x in list(s):\r\n if x == \".\" and temp == \"\":\r\n ans+=\"0\"\r\n else:\r\n temp+= x\r\n if len(temp) == 2:\r\n if temp == \"-.\":\r\n ans+= \"1\"\r\n else:\r\n ans+=\"2\"\r\n temp = \"\"\r\n\r\nprint (ans)\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "x = list(map(str, input()))\r\nn = 0\r\nans = \"\"\r\nwhile n != len(x):\r\n if x[n] == \"-\":\r\n n += 1\r\n if x[n] == \"-\":\r\n ans += \"2\"\r\n else:\r\n ans += \"1\"\r\n elif x[n] == '.':\r\n ans += \"0\"\r\n n += 1\r\n \r\nprint(ans)", "c = list(str(input()))\nf = \"\"\ni =0\nwhile i < len(c):\n if c[i] == \".\" :\n f += \"0\"\n elif c[i] == \"-\":\n if c[i+1] == \".\":\n f += \"1\"\n elif c[i+1] == \"-\":\n f += \"2\"\n i += 1\n i += 1\nprint(f)\n\n\n\n", "input=input()\r\ncode=[]\r\nans=[]\r\ni=0\r\nfor ch in input:\r\n code.append(ch)\r\nwhile i<len(code):\r\n try:\r\n if code[i]==\".\":\r\n ans.append(0)\r\n i+=1\r\n if code[i]==\"-\" and code[i+1]==\".\":\r\n ans.append(1)\r\n i+=2\r\n if code[i]==\"-\" and code[i+1]==\"-\":\r\n ans.append(2)\r\n i+=2 \r\n except IndexError:\r\n break\r\nfor i in ans:\r\n print(i,end='')\r\n\r\n", "s = input()\r\nans = ''\r\nwhile s and len(s)>1:\r\n if s[0]==\".\":\r\n ans+='0'\r\n s = s[1:]\r\n elif s[0]=='-' and s[1]=='.':\r\n ans += '1'\r\n s = s[2:]\r\n else:\r\n ans += '2'\r\n s = s[2:]\r\nif len(s)!=0:\r\n ans+='0'\r\nprint(ans)", "s=input()\r\ni=0\r\na=[]\r\nwhile i<len(s):\r\n if s[i:i+2]=='-.':\r\n a.append(1)\r\n i=i+2\r\n elif s[i:i+2]=='--':\r\n a.append(2)\r\n i=i+2\r\n else :\r\n a.append(0)\r\n i=i+1\r\nprint(*a, sep='')\r\n\r\n\r\n\r\n", "n=list(input())\r\nf=''\r\nwhile len(n) > 0:\r\n if n[0]=='.':\r\n n.pop(0)\r\n f=f+'0'\r\n elif n[0] == '-' and n[1] == '.':\r\n del n[0:2]\r\n f=f+'1'\r\n else:\r\n del n[0:2]\r\n f=f+'2'\r\nprint(f)\r\n", "s = list(input())\r\nresult = ''\r\nwhile s:\r\n a = s.pop(0)\r\n if a == '.':\r\n result += '0'\r\n if a == '-':\r\n b = s.pop(0)\r\n if b == '.':\r\n result += '1'\r\n else:\r\n result += '2'\r\nprint(result)", "code = input()\r\nnum = ''\r\ni = 0\r\nwhile i < len(code):\r\n if code[i] == '.':\r\n num = num + '0'\r\n i += 1\r\n else:\r\n if code[i] == '-' and code[i + 1] == '.':\r\n num = num + '1'\r\n i += 2\r\n else:\r\n num = num + '2'\r\n i += 2\r\n\r\nprint(num)", "s = input()\r\nlst = []; res = \"\"\r\nfor i in s:\r\n lst.append(i)\r\n\r\ni = 0\r\nwhile(i<len(lst)):\r\n if lst[i] == \"-\" and lst[i+1] == \".\":\r\n res+=\"1\"\r\n i+=2\r\n elif lst[i] == \"-\" and lst[i+1] == \"-\":\r\n res+=\"2\"\r\n i+=2\r\n else:\r\n res+=\"0\"\r\n i+=1\r\n\r\nprint(res)", "input = input()\r\noutput=[]\r\ni=0\r\nwhile i < len(input):\r\n if input[i]=='.':\r\n output.append(\"0\")\r\n i=i+1\r\n elif input[i]=='-':\r\n if input[i+1]=='-':\r\n output.append(\"2\")\r\n i=i+2\r\n elif input[i+1]==\".\":\r\n output.append(\"1\")\r\n i=i+2\r\nfor i in output:\r\n print(i,end=\"\")", "def ver(x):\r\n\tif x[0] == \".\":\r\n\t\tx = x[1:]\r\n\t\treturn 0, x\r\n\telse:\r\n\t\tif x[1] == \".\":\r\n\t\t\tx = x[2:]\r\n\t\t\treturn 1, x\r\n\t\telse:\r\n\t\t\tx = x[2:]\r\n\t\t\treturn 2, x\r\n\r\n\r\nx = input()\r\n\r\n\r\nr = \"\"\r\n\r\nwhile len(x) != 0:\r\n\tn, x = ver(x)\r\n\tr += str(n)\r\n\r\nprint(r)\r\n", "string = input()\r\n\r\nind = 0\r\nwhile ind < len(string):\r\n if string[ind] == \".\":\r\n print(0, end=\"\")\r\n ind += 1\r\n else:\r\n if string[ind + 1] == \".\":\r\n print(1, end=\"\")\r\n else:\r\n print(2, end=\"\")\r\n \r\n ind += 2\r\n", "tern = input()\r\nconv=''\r\ni=0\r\n\r\nwhile i < len(tern):\r\n if tern[i]=='.':\r\n conv+='0'\r\n i+=1\r\n elif tern[i]=='-':\r\n if tern[i+1]=='.':\r\n conv+='1'\r\n else:\r\n conv+='2'\r\n i+=2\r\n\r\nprint(conv)", "a=input()\r\ns=''\r\ni=0\r\nwhile i<len(a):\r\n try:\r\n if a[i]=='-':\r\n if a[i+1]=='.':\r\n s+='1'\r\n i+=2\r\n elif a[i+1]=='-':\r\n s+='2'\r\n i+=2\r\n else:\r\n s+='0'\r\n i+=1\r\n except:\r\n break\r\nprint(s)", "s=input()\r\nj=0\r\nx=\"\"\r\nwhile(j<len(s)):\r\n if(s[j]=='.'):\r\n x=x+'0'\r\n elif(s[j]=='-'):\r\n if(s[j+1]=='.'):\r\n x=x+'1'\r\n elif(s[j+1]=='-'):\r\n x=x+'2'\r\n j+=1\r\n j+=1\r\n\r\nprint(x)", "s=input()\r\nr=\"\"\r\nwhile len(s)>0:\r\n if s[0]==\".\" and len(s):\r\n r+=\"0\"\r\n s=s[1:]\r\n elif s[0:2]==\"-.\" and len(s):\r\n r+=\"1\"\r\n s=s[2:]\r\n elif s[0:2]==\"--\" and len(s):\r\n r+=\"2\"\r\n s=s[2:]\r\nprint(r)", "s = input()\r\nd = \"\"\r\ni = 0\r\nwhile(i<len(s)):\r\n if s[i]== \".\":\r\n d+='0'\r\n i+=1\r\n elif s[i]==\"-\" and s[i+1] ==\".\":\r\n d+='1'\r\n i+=2\r\n elif s[i] == \"-\" and s[i+1] == \"-\":\r\n d+='2'\r\n i+=2\r\nprint(d)\r\n", "string = str(input())\nx = 0\nresult = ''\nwhile x < len(string):\n if (string[x] == \"-\" and string[x+1] == '-'):\n result += '2'\n x=x+1\n elif(string[x] == \"-\" and string[x+1] == '.'): \n result += '1'\n x=x+1\n else:\n result += '0'\n x = x + 1\n\nprint(result)\n \n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 30 19:32:51 2021\r\n\r\n@author: nehas\r\n\"\"\"\r\ns=input()\r\ns1=\"\"\r\ni=0\r\nwhile(i<len(s)):\r\n if(s[i]==\".\"):\r\n s1+=\"0\"\r\n i+=1\r\n elif(s[i]==\"-\" and s[i+1]==\".\"):\r\n s1+=\"1\"\r\n i+=2\r\n elif(s[i]==\"-\" and s[i+1]==\"-\"):\r\n s1+=\"2\"\r\n i+=2\r\nprint(s1)", "mm = input()\r\na = mm.replace(\"--\",\"2\")\r\nb = a.replace(\"-.\",\"1\")\r\nc =b.replace(\".\",\"0\")\r\nprint(c)\r\n", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n str_ = input().rstrip()\r\n length_ = len(str_)\r\n i = 0\r\n rep = {'.': '0', '-.': '1', '--': '2'}\r\n while i < length_:\r\n y = str_[i]\r\n if y in rep:\r\n output(f'{rep[y]}')\r\n else:\r\n if i == length_ - 1:\r\n break\r\n else:\r\n s = str_[i:i + 2]\r\n if s in rep:\r\n output(f'{rep[s]}')\r\n i += 1\r\n i += 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "letters = input()\r\n\r\nletters = letters.replace('--', '2')\r\nletters = letters.replace('-.', '1')\r\nletters = letters.replace('.', '0')\r\n\r\nprint(letters)\n# Thu Oct 15 2020 00:36:56 GMT+0300 (Москва, стандартное время)\n", "# https://codeforces.com/problemset/problem/32/B\r\n\r\nborze_code = input().strip()\r\n# print(borze_code)\r\nborze_alphabet = {'.': '0', '-.': '1', '--': '2'}\r\noutput = ''\r\ni = 0\r\nwhile (i < len(borze_code)):\r\n if (borze_code[i] == '.'):\r\n output += borze_alphabet[borze_code[i]]\r\n else:\r\n output += borze_alphabet[borze_code[i:i + 2]]\r\n i += 1\r\n # print(borze_code[i:i + 2])\r\n i += 1\r\nprint(output)\r\n", "lis = input()\ni = 0\nln = len(lis)\nwhile i< ln:\n\tif lis[i]== '.':\n\t\tprint(0,end = \"\")\n\n\tif lis[i] == '-':\n\t\ti+=1\n\t\tif lis[i] == '-':\n\t\t\tprint(2,end = \"\")\n\t\telse:\n\t\t\tprint(1,end =\"\")\n\t\t\n\ti+=1\nprint()\n", "a = input()\r\ndef borze(a):\r\n i = 0\r\n lst = []\r\n while i < len(a):\r\n if i < len(a) and a[i] == \"-\" and a[i+1] == \"-\" :\r\n lst.append(2)\r\n i = i +2\r\n if i < len(a) and a[i] == \".\":\r\n lst.append(0)\r\n i =i +1\r\n if i < len(a) and a[i] == \"-\" and a[i+1] ==\".\":\r\n lst.append(1)\r\n i = i+2\r\n return lst\r\n\r\nfor i in borze(a):\r\n print(i,end =\"\")\r\n", "s=input()\r\nout=''\r\nst=0\r\nfor i in range (len(s)):\r\n if st==0:\r\n if s[i]=='.':\r\n out+='0'\r\n st=0\r\n else:\r\n st=1\r\n else:\r\n if s[i]=='.':\r\n out+='1'\r\n st=0\r\n else:\r\n st=0 \r\n out+='2'\r\nprint(out)\r\n \r\n \r\n ", "s=input()\r\nl=len(s)\r\ni=0\r\na=''\r\nwhile(i<l):\r\n if s[i]=='.':\r\n a+='0'\r\n i+=1\r\n elif s[i:i+2]=='-.':\r\n a+='1'\r\n i+=2\r\n elif s[i:i+2]=='--':\r\n a+='2'\r\n i+=2\r\nprint(a)", "user_input = input()\r\nanswer = user_input.replace('--','2')\r\nanswer = answer.replace('-.','1')\r\nanswer = answer.replace('.','0')\r\nprint(answer)\r\n\r\n\r\n\r\n\r\n", "\r\ns = input ()\r\ni = 0 ; \r\nwhile(i<len(s)):\r\n if s[i] ==\".\" :\r\n print(0,end=\"\")\r\n elif s[i]== \"-\" :\r\n if i+1<len(s):\r\n if s[i+1] ==\"-\":\r\n print(2,end=\"\")\r\n i+=1\r\n else :\r\n print (1,end=\"\")\r\n i+=1\r\n i+=1\r\n", "#!/usr/env python3\r\nstr = list(input())\r\nres = ''\r\ni = 0\r\nwhile i < len(str):\r\n if str[i] == '.':\r\n res += '0'\r\n i+=1\r\n elif str[i] == '-' and str[i+1] == '.':\r\n res += '1'\r\n i+=2\r\n else:\r\n res += '2'\r\n i+=2\r\nprint(res)", "st=input()\r\ni=0\r\nwhile i!=len(st):\r\n if st[i]=='.':\r\n print(0,end=\"\")\r\n i=i+1\r\n elif st[i]=='-':\r\n if st[i+1]=='.':\r\n print(1,end=\"\")\r\n i=i+2\r\n elif st[i+1]=='-':\r\n print(2,end=\"\")\r\n i=i+2\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n ", "s = input()\r\nt = len(s)\r\ni = 0\r\nwhile i < t:\r\n if s[i] == '.':\r\n print('0',end='')\r\n i += 1\r\n else:\r\n if i+1 < t:\r\n if s[i+1] == '.':\r\n print('1',end='')\r\n else:\r\n print('2',end='')\r\n i += 2", "ternary = input()\r\nouts = ''\r\ni = 0\r\nwhile True:\r\n if i <= len(ternary) - 1:\r\n if ternary[i] == '-':\r\n if ternary[i + 1] == '.':\r\n outs += '1'\r\n i = i + 1\r\n elif ternary[i + 1] == \"-\":\r\n outs += \"2\"\r\n i = i + 1\r\n else:\r\n outs += '0'\r\n i += 1\r\n else:\r\n break\r\n\r\nprint(outs)\r\n", "x = input()\r\ni = 0\r\ne = len(x)-1\r\nans = \"\"\r\nwhile (i<=e):\r\n if(x[i] == '.'):\r\n ans+='0'\r\n i+=1\r\n else:\r\n i+=1\r\n if i <= e:\r\n if x[i] == '.':\r\n ans+='1'\r\n else:\r\n ans+='2'\r\n i+=1\r\n \r\nprint(ans)", "while True:\r\n try:\r\n str0 = input()\r\n len1 = len(str0)\r\n i = 0\r\n while i < len1:\r\n if str0[i] == '.':\r\n print(0, end='')\r\n i += 1\r\n elif str0[i:i+2] == '-.':\r\n print(1, end='')\r\n i += 2\r\n elif str0[i:i+2] == '--':\r\n print(2, end='')\r\n i += 2\r\n print(end='\\n')\r\n except:\r\n break", "x=input();x=x.replace('--','2');x=x.replace('-.','1');x=x.replace('.','0');a= print ;\r\na(x)", "s = list(input())\r\nans = []\r\nfor i in range(len(s)):\r\n\tif (s[i]==\".\"):\r\n\t\tans.append(\"0\")\r\n\telif (s[i]==\"-\" and s[i+1]==\".\"):\r\n\t\tans.append(\"1\")\r\n\t\ts[i] = \"#\"\r\n\t\ts[i+1] = \"#\"\r\n\telif (s[i]==\"-\" and s[i+1]==\"-\"):\r\n\t\tans.append(\"2\")\r\n\t\ts[i] = \"#\"\r\n\t\ts[i+1] = \"#\"\r\nstr = \"\".join(ans)\r\nprint(str)\r\n\t\r\n\t", "s = str(input())\r\n\r\nx = len(s)\r\n\r\ni = 0\r\n\r\nans = \"\"\r\n\r\nwhile i<x:\r\n if (s[i]==\".\"):\r\n ans = ans + \"0\"\r\n i += 1\r\n\r\n else:\r\n if s[i+1]==\".\":\r\n ans = ans + \"1\"\r\n i+=2\r\n\r\n else:\r\n ans = ans + \"2\"\r\n i+=2\r\n\r\nprint(ans)\r\n", "# warm heart, wagging tail, and a smile just for you!\r\n# ███████████\r\n# ███╬╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬████╬╬╬╬╬╬███\r\n# ███████████ ██╬╬╬╬╬████╬╬████╬╬╬╬╬██\r\n# █████████╬╬╬╬╬████████████╬╬╬╬╬██╬╬╬╬╬╬███╬╬╬╬╬██\r\n# ████████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬██╬╬╬╬╬╬╬██\r\n# ████╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████████╬╬╬╬╬╬╬╬╬╬╬██\r\n# ███╬╬╬█╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬███╬╬╬╬╬╬╬█████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬████████╬╬╬╬╬██\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬╬╬╬╬███\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬██\r\n# ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬████\r\n# █████████████╬╬╬╬╬╬╬╬██╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬██████\r\n# ████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬██████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████╬╬╬╬╬╬╬███████████╬╬╬╬╬╬╬╬██╬╬╬██╬╬╬██\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████╬╬╬╬╬╬╬╬╬╬╬█╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬██\r\n# ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬▓▓▓▓▓▓╬╬╬████╬╬████╬╬╬╬╬╬╬▓▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬███\r\n# ██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██████▓▓▓▓▓▓▓╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬▓▓▓▓▓▓▓██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██╬╬╬╬█████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████████\r\n# ███╬╬╬╬╬╬╬╬╬╬╬╬╬█████╬╬╬╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬███╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬██\r\n# ██████████████ ████╬╬╬╬╬╬███████████████████████████╬╬╬╬╬██╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬╬████\r\n# ███████ █████ ███████████████████\r\n#\r\n\r\ncode = input()\r\nwhile code:\r\n if code[0] == '.': print(0, end=\"\"); code = code[1:]\r\n elif code[:2] == \"-.\": print(1, end=\"\"); code = code[2:]\r\n else: print(2, end=\"\"); code = code[2:]", "s = list(input())\ngst = []\ni = 0\nwhile(i<len(s)) :\n if s[i] == '.':\n gst.append('0')\n i += 1\n elif s[i] == '-' and s[i+1] == '.':\n gst.append('1')\n i+= 2\n elif s[i] == '-' and s[i+1] == '-':\n gst.append('2')\n i+=2\n else:\n i+=1\n continue\nprint(''.join(gst))", "code=input()\r\ndef borze_value(a):\r\n if(a==\".\"):\r\n return '0'\r\n elif(a==\"-.\"):\r\n return '1'\r\n elif(a==\"--\"):\r\n return '2'\r\n else:\r\n return 'none'\r\nstart=end=0\r\nnumber=\"\"\r\nfor i in range(0,len(code)):\r\n end=i\r\n if(borze_value(code[start:end+1])!='none'):\r\n number+=borze_value(code[start:end+1])\r\n start=end+1\r\nprint(number)", "def solve(code):\n i = 0\n while i < len(code):\n if code[i] == '.':\n print(0, end='')\n i += 1\n elif code[i] =='-':\n if code[i+1] == '.':\n print(1, end='')\n else:\n print(2, end='')\n i += 2\nif __name__ == \"__main__\":\n code = input()\n solve(code)", "def deconstruct(changed_line, changed_num):\r\n if(changed_line[0] == \"-\"):\r\n if(changed_line[1] == \"-\"):\r\n changed_num += \"2\"\r\n else:\r\n changed_num += \"1\"\r\n changed_line = changed_line[2:]\r\n else:\r\n changed_num += \"0\"\r\n changed_line = changed_line[1:]\r\n return (changed_line, changed_num)\r\n\r\ndef main():\r\n line = input()\r\n num = \"\"\r\n while len(line) > 1:\r\n line, num = deconstruct(line, num)\r\n if len(line) == 1:\r\n num += \"0\"\r\n print(num)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=list(input())\nd={'.':'0','-.':'1','--':'2'}\nc=''\ni=0\nwhile len(a)>0:\n for j in d:\n if len(a)>=len(j):\n if ''.join(a[:len(j)])==j:\n c+=d[j]\n del a[:len(j)]\nprint(c)", "borze_code = input()\r\n\r\n# Initialize an empty ternary number string\r\nternary_number = \"\"\r\n\r\n# Iterate over the Borze code characters\r\ni = 0\r\nwhile i < len(borze_code):\r\n if borze_code[i] == '.':\r\n # Digit 0\r\n ternary_number += '0'\r\n i += 1\r\n elif borze_code[i] == '-' and borze_code[i+1] == '.':\r\n # Digit 1\r\n ternary_number += '1'\r\n i += 2\r\n elif borze_code[i] == '-' and borze_code[i+1] == '-':\r\n # Digit 2\r\n ternary_number += '2'\r\n i += 2\r\n\r\n# Print the decoded ternary number\r\nprint(ternary_number)\r\n", "encod_num = input()\nnumber = []\nprev = ''\nfor i in encod_num:\n if i == '.':\n if not prev:\n number.append('0')\n else:\n number.append('1')\n prev = ''\n else:\n if not prev:\n prev = '-'\n continue\n else:\n number.append('2')\n prev = ''\nprint(''.join(number))", "s = input()\r\nans = \"\"\r\ns = list(s)\r\ni = 0\r\nwhile (i < len(s) - 1):\r\n\tif (s[i] + s[i+1] == '-.'):\r\n\t\tans += '1'\r\n\t\ti += 2\r\n\telif (s[i] + s[i+1] == '--'):\r\n\t\tans += '2'\r\n\t\ti += 2\r\n\telse:\r\n\t\tans += '0'\r\n\t\ti += 1\r\nif (i < len(s)):\r\n\tans += '0'\r\n\tprint(ans)\r\nelse:\r\n\tprint(ans)", "ans=\"\"\r\ni=0\r\nstring=input()\r\nwhile i<len(string):\r\n if string[i:i+2]==\"--\":\r\n ans+=\"2\"\r\n i+=2\r\n elif string[i:i+2]==\"-.\":\r\n ans+=\"1\"\r\n i+=2\r\n else:\r\n ans+=\"0\"\r\n i+=1\r\nprint(ans)", "morse = input()\r\nmy_dict = {\r\n '.': '0', '-.': '1', '--': '2'\r\n }\r\noutput = ''\r\ntrigger = ''\r\nfor i in morse:\r\n trigger += i\r\n if trigger in my_dict:\r\n output += my_dict[trigger]\r\n trigger = ''\r\nprint(output)\r\n", "code = [*input(), 'end']\r\nans = ''\r\nwhile len(code) > 1:\r\n x = code[0]\r\n y = code[1]\r\n if x == '-':\r\n if y == '.':\r\n ans += '1'\r\n del code[:2]\r\n elif y == '-':\r\n ans += '2'\r\n del code[:2]\r\n elif x == '.':\r\n ans += '0'\r\n del code[0]\r\nprint(ans)", "b=input()\r\na=\"\"\r\nwhile b:\r\n if b[0]==\".\":\r\n a+=\"0\"\r\n b=b[1::]\r\n elif b[0:2]==\"--\":\r\n a+=\"2\"\r\n b=b[2::]\r\n elif b[0:2]==\"-.\":\r\n a+=\"1\"\r\n b=b[2::]\r\nprint(a)", "s = input()\r\ncur = ''\r\ndict = {'.' : '0', '-.' : '1', '--':'2'}\r\nres = ''\r\nfor i in s:\r\n if cur + i in dict.keys():\r\n res += dict.get(cur+i)\r\n cur = ''\r\n else:\r\n cur = i\r\nprint(res)", "l, r = list(input())[::-1], []\nwhile l:\n r.append('0' if l.pop() == '.' else {'.': '1', '-': '2'}[l.pop()])\nprint(''.join(r))", "# from collections import defaultdict\n# [int(x) for x in input().split()]\n# a = [chr(x) for x in range(ord('A'), ord('Z')+1)]\n\ndef solve():\n s = input()\n l = \"\"\n i = 0\n while i < len(s):\n if s[i] == \".\":\n l += \"0\"\n i += 1\n elif s[i] == \"-\" and s[i+1] == \".\":\n l += \"1\"\n i += 2\n elif s[i] == \"-\" and s[i+1] == \"-\":\n l += \"2\"\n i += 2\n # return int(l, 3)\n return l\n\nprint(solve())\n", "s=input()\r\nans=\"\"\r\n\r\nwhile(len(s)>0):\r\n if s[0]==\".\":\r\n ans+=\"0\"\r\n s=s[1:]\r\n elif s[:2]==\"-.\":\r\n ans+=\"1\"\r\n s=s[2:]\r\n elif s[:2]==\"--\":\r\n ans+=\"2\"\r\n s=s[2:] \r\n\r\nprint(ans)\r\n\r\n", "st = input()\n\ndd = {'.' : 0, '-.': 1,'--': 2}\n\nll = ''\n\nfor i in range(len(st)):\n ll += st[i] \n if(ll in dd):\n print(dd[ll],end = \"\")\n ll = ''\n\n \n\n \t\t \t \t\t\t \t\t\t\t \t \t\t \t\t \t \t", "\r\nstr = input()\r\nq = [char for char in str]\r\nout= \"\"\r\nj=0\r\nwhile j < len(q):\r\n if q[j] == '.':\r\n out += \"0\"\r\n else:\r\n if q[j+1] == '.':\r\n out += \"1\"\r\n else:\r\n out += \"2\"\r\n j+=1\r\n j+=1\r\nprint(out)\r\n", "borze_code = input()\nanswer = ''\ni = 0\nwhile i < (length := len(borze_code)):\n if borze_code[i] == '.':\n answer += '0'\n else:\n if i != length-1 and borze_code[i+1] == '.':\n answer += '1'\n else:\n answer += '2'\n i += 1\n i += 1\n\nprint(answer)\n", "s=input()\r\npos=0\r\nl=len(s)\r\nwhile pos<l:\r\n\tif s[pos]=='.':\r\n\t\tprint(0,end='')\r\n\telse:\r\n\t\tpos+=1\r\n\t\tif s[pos]=='.':\r\n\t\t\tprint(1,end='')\r\n\t\telse:\r\n\t\t\tprint(2,end='')\r\n\tpos+=1\r\n", "# n, t = map(int, input().split())\r\nstring = input()\r\ns = list(string)\r\nborze=[]\r\ni=0\r\nwhile(i<len(s)):\r\n if(s[i]==\"-\" and s[i+1]==\"-\"):\r\n borze.append(2)\r\n i+=2\r\n elif(s[i]==\"-\" and s[i+1]==\".\"):\r\n borze.append(1)\r\n i+=2\r\n else:\r\n borze.append(0)\r\n i+=1\r\nprint(''.join(map(str,borze)))", "n=input()\r\ni=0\r\nj=0\r\nk=0\r\nl=0\r\nwhile(i<len(n)):\r\n if i==0 and n[0]==\".\":\r\n print(\"0\",end=\"\")\r\n i=i+1\r\n continue\r\n if n[i]==\".\" and (i>0):\r\n print(\"0\",end=\"\")\r\n i=i+1\r\n continue\r\n\r\n\r\n if \"-\"==n[i]:\r\n if i<(len(n)-1) and n[i+1]==\".\":\r\n print(\"1\",end=\"\")\r\n i=i+2\r\n continue\r\n if (i < len(n)-1) and n[i + 1] == \"-\":\r\n print(\"2\",end=\"\")\r\n i=i+2\r\n continue\r\n\r\n\r\n\r\n\r\n\r\n", "string=input()\r\noutput=''\r\nflag=0\r\nfor i in range(0,len(string)):\r\n if string[i]=='.' and flag==0:\r\n output=output+'0'\r\n elif string[i]=='.' and flag==1:\r\n output=output+'1'\r\n flag=0\r\n elif string[i]=='-' and flag==1:\r\n output=output+'2'\r\n flag=0\r\n elif string[i]=='-':\r\n flag=1\r\nprint(output)", "s = input()\r\n\r\nans = []\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == \".\":\r\n ans.append(\"0\")\r\n i += 1\r\n else:\r\n if s[i+1] == \".\":\r\n ans.append(\"1\")\r\n else:\r\n ans.append(\"2\")\r\n i += 2\r\n# if i == len(s)-2:\r\n# ans.append(\"0\")\r\n\r\nprint(\"\".join(ans))", "l=input()\r\nl1=len(l)\r\ns=''\r\ni=0\r\nwhile(i<l1):\r\n if(l[i]=='.'):\r\n s+='0'\r\n elif(l[i+1]=='.'):\r\n s+='1'\r\n i+=1\r\n else:\r\n s+='2'\r\n i+=1\r\n i+=1\r\nprint(s)\r\n", "\n\ndef main():\n string = input()\n output = ''\n flag = False\n\n for i in range(len(string)):\n if flag:\n flag = False\n continue\n if string[i] == '.':\n output += '0'\n elif string[i] == '-':\n if string[i + 1] == '.':\n output += '1'\n elif string[i + 1] == '-':\n output += '2'\n flag = True\n\n print(output)\n\n\nif __name__ == \"__main__\":\n main()\n", "B = input()\r\noutput = []\r\ni = 0\r\nwhile i < (len(B)):\r\n if B[i] == '.': output.append(0)\r\n elif B[i] == '-':\r\n if B[i+1] == '.':\r\n output.append(1)\r\n elif B[i+1] == '-':\r\n output.append(2)\r\n i+=1\r\n i+=1\r\nres = ''\r\nfor j in output:\r\n res += str(j)\r\nprint(res)", "cipher = input()\r\n\r\ntwos = cipher.replace(\"--\", \"2\")\r\n\r\nones = twos.replace(\"-.\", \"1\")\r\n\r\nanswer = ones.replace(\".\", \"0\")\r\n\r\nprint(answer)", "s = input()\r\ncounter=0\r\nwhile(counter<len(s)):\r\n if(s[counter]=='.'):\r\n counter+=1\r\n print(0,end='')\r\n elif(s[counter]=='-' and s[counter+1]=='.'):\r\n counter+=2\r\n print(1,end='')\r\n else:\r\n counter+=2\r\n print(2,end='')\r\n", "s = str(input())\r\nnumber = ''\r\nstep = 0\r\nwhile step < len(s):\r\n\tif (len(s) - 1 - step) < 1 or s[step] == '.':\r\n\t\tnumber += '0'\r\n\telif s[step] == '-' and s[step + 1] == '.':\r\n\t\tnumber += '1'\r\n\t\tstep += 1\r\n\telif s[step] == '-' and s[step + 1] == '-':\r\n\t\tnumber += '2'\r\n\t\tstep += 1\r\n\tstep += 1\r\nprint(number)", "code = input()\r\nout = ''\r\ni = 0\r\nwhile i < len(code):\r\n try:\r\n if code[i] == '-' and code[i+1] == '.':\r\n out += '1'\r\n i += 2\r\n elif code[i] == '-' and code[i+1] == '-':\r\n out += '2'\r\n i += 2\r\n elif code[i] == '.':\r\n out += '0'\r\n i += 1\r\n except:\r\n pass\r\nprint(out)\r\n\r\n", "def getNum(s):\r\n num = \"\"\r\n i = 0\r\n while i<(len(s)-1):\r\n if s[i] == '-' and s[i+1] == '.':\r\n num = num + \"1\"\r\n i += 2\r\n elif s[i] == \"-\" and s[i+1] == \"-\":\r\n num = num + \"2\"\r\n i += 2\r\n else:\r\n num = num + \"0\"\r\n i += 1\r\n \r\n if i < len(s) and s[-1] == \".\":\r\n num = num + \"0\"\r\n \r\n return num\r\n \r\nif __name__ == '__main__':\r\n # arr = [int(x) for x in input().split()]\r\n # n, t = arr[0], arr[1]\r\n s = input()\r\n print(getNum(s))", "a = str(input())\r\nq = a.replace(\"--\", \"2\")\r\nw = q.replace(\"-.\", \"1\")\r\ne = w.replace(\".\", \"0\")\r\nprint(e)", "n=str(input())\r\ni=0\r\na=\"\"\r\nwhile i<len(n):\r\n if n[i]==\".\":\r\n a+=\"0\"\r\n i=i+1\r\n elif n[i]==\"-\":\r\n if n[i+1]==\".\":\r\n a+=\"1\"\r\n i=i+2\r\n elif n[i+1]==\"-\":\r\n a+=\"2\"\r\n i=i+2\r\nprint(a)", "a = input()\r\ni = 0\r\nans = \"\"\r\nn = len(a)\r\nwhile i<n:\r\n if a[i]==\".\": \r\n ans += \"0\"\r\n i+=1\r\n elif a[i]==\"-\":\r\n if a[i+1]==\".\":\r\n ans += \"1\"\r\n else:\r\n ans += \"2\"\r\n i+=2\r\nprint(ans)\r\n\r\n\r\n\r\n", "x=input()\r\ns=\"\"\r\ni=0\r\nwhile i<len(x):\r\n if(x[i]=='.'):\r\n print(0,end=\"\")\r\n i+=1\r\n elif x[i]=='-' and x[i+1]=='-':\r\n print(2,end=\"\")\r\n i+=2\r\n elif x[i]=='-' and x[i+1]=='.':\r\n print(1,end=\"\")\r\n i+=2\r\n \r\n ", "string=input()\r\nans=''\r\ni=0\r\nwhile i<len(string):\r\n if string[i]=='.':\r\n ans=ans+'0'\r\n i=i+1\r\n continue\r\n if string[i]=='-' and string[i+1]=='.':\r\n ans=ans+'1'\r\n i=i+2\r\n continue\r\n if string[i]=='-' and string[i+1]=='-':\r\n ans=ans+'2'\r\n i=i+2\r\n continue\r\nprint(ans)\r\n", "from sys import stdin, stdout\r\nfrom functools import reduce, lru_cache\r\nfrom operator import mul, add\r\nfrom math import sin, cos, tan, asin, acos, atan, inf, ceil, floor\r\nfrom collections import Counter, defaultdict, deque\r\nimport timeit # f\"The function takes {timeit.timeit(func_name, number=1)} seconds.\"\r\n\r\n\r\ndef get_ints():\r\n return map(int, stdin.readline().strip().split())\r\n\r\n\r\ndef get_int():\r\n return int(stdin.readline())\r\n\r\n\r\ndef get_string():\r\n return stdin.readline().strip()\r\n\r\n\r\ndef get_strings():\r\n return map(str, stdin.readline().strip().split())\r\n\r\n\r\ndef get_array(typ):\r\n \"\"\"Get array consisting integers\"\"\"\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef get_matrix(x):\r\n \"\"\"Matrix multiplication\"\"\"\r\n M = []\r\n for _ in range(x):\r\n row = get_array(int)\r\n M.append(row)\r\n return M\r\n\r\n\r\ndef arr_multiply(x):\r\n \"\"\"Output: Multiplication of values in array\"\"\"\r\n return reduce(mul, x)\r\n\r\n\r\ndef out(x, end=\"\\n\"):\r\n \"\"\"Input: data\"\"\"\r\n return stdout.write(f\"{x}{end}\")\r\n\r\n\r\ndef outs(*x, end=\"\\n\"):\r\n \"\"\"Input: Comma separated data\"\"\"\r\n return stdout.write(f\"{' '.join([str(i) for i in x])}{end}\")\r\n\r\n\r\ndef fibo(x, memo={}):\r\n \"\"\"Fibonacci number(memoized)\"\"\"\r\n if x == 0 or x == 1:\r\n return x\r\n elif x in memo:\r\n return memo[x]\r\n memo[x] = fibo(x - 1, memo) + fibo(x - 2, memo)\r\n return memo[x]\r\n\r\n\r\ndef fibo_iter(x):\r\n \"\"\"Fibonacci performed iteratively\"\"\"\r\n d = {0: 1, 1: 1}\r\n for i in range(2, x + 1):\r\n d[i] = d[i - 1] + d[i - 2]\r\n return d[x]\r\n\r\n\r\n@lru_cache(maxsize=None)\r\ndef fibo_cache(x):\r\n \"\"\"Fibonacci with decorator used (x=497)\"\"\"\r\n if x <= 1:\r\n return x\r\n return fibo_cache(x - 1) + fibo_cache(x - 2)\r\n\r\n\r\ndef is_even(x):\r\n \"\"\"Test for even number\"\"\"\r\n return x % 2 == 0\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef max_gcd(x):\r\n if x <= 3:\r\n return 1\r\n elif x <= 5:\r\n return 2\r\n return x // 2\r\n\r\n\r\ndef main():\r\n # t = get_int()\r\n # s = []\r\n # for _ in range(t):\r\n #\r\n # for i in s:\r\n # out(i)\r\n a = get_string()\r\n s = \"\"\r\n d = False\r\n for i in a:\r\n if i == \".\":\r\n if d:\r\n s += \"1\"\r\n d = False\r\n else:\r\n s += \"0\"\r\n elif i == \"-\":\r\n if d:\r\n s += \"2\"\r\n d = False\r\n else:\r\n d = True\r\n out(s)\r\n\r\n\r\n# call the main method\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=input()\r\nsum=\"\"\r\ni=0\r\nwhile i<len(n):\r\n if n[i]==\".\":\r\n sum+=\"0\"\r\n i+=1\r\n\r\n elif n[i]==\"-\" and n[i+1]==\".\":\r\n sum+=\"1\"\r\n i+=2\r\n\r\n\r\n elif n[i]==\"-\" and n[i+1]==\"-\":\r\n sum+=\"2\"\r\n i+=2\r\n\r\nprint(sum)\r\n", "i=0\ns=input()\nl=len(s)\nwhile i<l:\n if s[i]=='.':\n print(0,end=\"\")\n i+=1\n else:\n print(1 if s[i+1]=='.' else 2,end=\"\")\n i+=2\n", "import sys, re\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n = input().strip()\r\n n = re.sub(r\"--\", \"2\", n)\r\n n = re.sub(r\"-\\.\", \"1\", n)\r\n n = re.sub(r'\\.', \"0\", n)\r\n print(n)", "n=input()\r\ns=''\r\ni=0\r\nwhile(True):\r\n if n[i]=='.':\r\n s=s+'0'\r\n i=i+1\r\n elif n[i]=='-':\r\n if n[i+1]=='.':\r\n s=s+'1'\r\n else:\r\n s=s+'2'\r\n i=i+2\r\n if i>=len(n):\r\n break\r\nprint(s) \r\n \r\n", "def solve(s):\r\n ans = []\r\n idx = 0\r\n \r\n while idx < len(s):\r\n if s[idx] == \".\":\r\n ans.append(\"0\")\r\n idx += 1\r\n elif s[idx] == \"-\" and s[idx + 1] == \".\":\r\n ans.append(\"1\")\r\n idx += 2\r\n elif s[idx] == \"-\" and s[idx + 1] == \"-\":\r\n ans.append(\"2\")\r\n idx += 2\r\n \r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n first_input = str(input())\r\n \r\n result = solve(first_input)\r\n \r\n print(\"\".join(result))", "s=input()\r\ns+='0'\r\nst=\"\"\r\nc1=\"--\"\r\nc2=\"-.\"\r\ni=0\r\nwhile(i<len(s)-1):\r\n \r\n if s[i:i+2]==c1:\r\n st+='2'\r\n i+=2\r\n elif s[i:i+2]==c2:\r\n st+='1'\r\n i+=2\r\n else:\r\n st+='0'\r\n i+=1\r\n\r\n\r\nprint(st)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "N=list(input())\r\ni=0\r\nl1=[]\r\nwhile i <len(N):\r\n if N[i]=='.':\r\n l1.append(0)\r\n i=i+1\r\n else:\r\n if N[i+1]=='-':\r\n l1.append(2)\r\n else:\r\n l1.append(1)\r\n i=i+2\r\nl1=[str(i) for i in l1] \r\nl1=''.join(l1) \r\nprint(l1) \r\n", "a=input()\r\nb=''\r\nn=len(a)\r\ni=0\r\nwhile i<n:\r\n if a[i]=='.':\r\n b+='0'\r\n i+=1\r\n else:\r\n if a[i+1]=='.':\r\n b+='1'\r\n i+=2\r\n else:\r\n b+='2'\r\n i+=2\r\nprint(b)", "s = input()\r\n\r\noutput = []\r\n\r\nstart = 0\r\nwhile start < len(s):\r\n\tif s[start] == '.':\r\n\t\toutput.append('0')\r\n\t\tstart += 1\r\n\r\n\telif s[start] == '-':\r\n\t\tif s[start + 1] == '.':\r\n\t\t\toutput.append('1')\r\n\t\telse:\r\n\t\t\toutput.append('2')\r\n\t\tstart += 2\r\nprint(''.join(output))", "spa = input()\r\nspa = spa.replace(\"--\", \"2\")\r\nspa = spa.replace(\"-.\", \"1\")\r\nspa = spa.replace(\".\", \"0\")\r\nprint(spa)", "code = input().strip() # считываем код Борзе\r\n\r\nresult = '' # здесь будет храниться расшифрованное число\r\n\r\ni = 0 # индекс текущего символа в коде Борзе\r\nwhile i < len(code):\r\n if code[i] == '.': # если текущий символ – точка, значит это ноль\r\n result += '0'\r\n i += 1\r\n elif code[i:i+2] == '-.': # если текущие символы – точка и тире, значит это единица\r\n result += '1'\r\n i += 2\r\n else: # иначе текущие символы – два тире, значит это двойка\r\n result += '2'\r\n i += 2\r\n\r\nprint(result) # выводим расшифрованное число", "def intmap():\r\n return map(int, input().split())\r\ns = input()\r\ndic = {\".\" : \"0\", \r\n \"-.\": \"1\",\r\n \"--\": \"2\"\r\n }\r\nresult = \"\"\r\ni = 0\r\nwhile i <= len(s)-1 :\r\n try :\r\n result += dic[s[i]]\r\n i += 1\r\n except :\r\n result += dic[s[i:i+2]]\r\n i += 2\r\nprint(result )", "s=input()\r\na=\"\"\r\nwhile(len(s)>0):\r\n\tif s[0:2]=='--':\r\n\t\ts=s[2:]\r\n\t\ta+='2'\r\n\telif s[0:2]=='-.':\r\n\t\ts=s[2:]\r\n\t\ta+='1'\r\n\telse:\r\n\t\ts=s[1:]\r\n\t\ta+='0'\r\nprint(a)\r\n", "res=[]\r\na=input()\r\nb=list(a)\r\ni=0\r\nwhile i<len(b):\r\n if b[i]==\".\":\r\n res.insert(i, 0)\r\n elif b[i]==\"-\" and b[i+1]==\".\":\r\n res.insert(i, 1)\r\n i+=1\r\n elif b[i]==\"-\" and b[i+1]==\"-\":\r\n res.insert(i, 2)\r\n i+=1\r\n i+=1\r\nresult=''.join(map(str,res))\r\nprint(result)", "a=input()\r\nc=[]\r\nx=0\r\nwhile x < len(a):\r\n if a[x]=='.':\r\n c.append(0)\r\n if a[x]=='-' and a[x+1]=='.':\r\n c.append(1)\r\n x+=1\r\n if a[x]=='-' and a[x+1]=='-':\r\n c.append(2)\r\n x+=1\r\n x+=1\r\nprint(*c,sep='')", "try:\r\n s=input()\r\n s=list(s)\r\n t=\"\"\r\n i=0\r\n while i<len(s):\r\n if s[i]==\".\":\r\n t+=\"0\"\r\n i+=1\r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n t+=\"1\"\r\n i+=2\r\n elif s[i]==\"-\" and s[i+1]==\"-\":\r\n t+=\"2\"\r\n i+=2\r\n print(t)\r\nexcept:\r\n pass", "s=input()\r\nans=\"\"\r\ni=0\r\nwhile True:\r\n if i>=len(s):\r\n break\r\n\r\n elif s[i]==\".\":\r\n ans+=\"0\"\r\n i+=1\r\n \r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n ans+=\"1\"\r\n i+=2\r\n \r\n elif s[i]==\"-\" and s[i+1]==\"-\":\r\n ans+=\"2\"\r\n i+=2\r\n \r\nprint(ans)\r\n\r\n \r\n\r\n \r\n ", "s=input()\r\nans=''\r\nflag=False\r\nfor el in s:\r\n if flag:\r\n if el=='.':\r\n ans+='1'\r\n else:\r\n ans+='2'\r\n flag=False\r\n else:\r\n if el=='.':\r\n ans+='0'\r\n else:\r\n flag=True\r\nprint(ans) ", "message = input()\r\npos = 0\r\nnumber = []\r\nwhile pos < len(message):\r\n if message[pos] == '.':\r\n number.append('0')\r\n pos += 1\r\n elif message[pos + 1] == '.':\r\n number.append('1')\r\n pos += 2\r\n else:\r\n number.append('2')\r\n pos += 2\r\nprint(''.join(number))\r\n", "# n=int(input())\r\n# for i in range(n):\r\n# if i==0:\r\n# lis=list(map(int,input().split()))\r\n# else:\r\n# lis+=list(map(int,input().split()))\r\n# x=0\r\n# y=0\r\n# z=0\r\n# for i in range(len(lis)//3):\r\n# x+=lis[3*i]\r\n# y+=lis[3*i+1]\r\n# z+=lis[3*i+2]\r\n# if x==0 and y==0 and z==0:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n\r\n# def get_index(lis):\r\n# for i in range(len(lis)):\r\n# for j in range(5):\r\n# if lis[i][j]!=0:\r\n# return (i,j)\r\n# bigl=[]\r\n# for i in range(5):\r\n# lis=list(map(int,input().split()))\r\n# bigl.append(lis)\r\n# x,y=get_index(bigl)\r\n# x_moves=abs(2-x)\r\n# y_moves=abs(2-y)\r\n# print(x_moves+y_moves)\r\n\r\n\r\n# n,t=list(map(int,input().split()))\r\n# s=input()\r\n# s=list(s)\r\n# lens=len(s)\r\n# while t>0:\r\n# i=0\r\n# while i<len(s)-1:\r\n# if s[i:i+2]==[\"B\",\"G\"]:\r\n# s[i:i+2]=[\"G\",\"B\"]\r\n# i+=1\r\n# i+=1\r\n# t-=1\r\n# print(\"\".join(s))\r\n \r\nzero=\".\"\r\none=\"-.\"\r\ntwo=\"--\"\r\ns=input()\r\ni=0\r\nlis=[]\r\nwhile i<len(s):\r\n if s[i]==\".\":\r\n lis.append(\"0\")\r\n i+=1\r\n elif s[i] ==\"-\":\r\n if s[i:i+2]==\"-.\":\r\n lis.append(\"1\")\r\n else:\r\n lis.append(\"2\")\r\n i+=2\r\nprint(\"\".join(lis))\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "s=input()\r\nl=[\".\", \"-.\", \"--\"]\r\n\r\nst = \"\"\r\nans=\"\"\r\nfor i in range(len(s)):\r\n st+=s[i]\r\n if st in l:\r\n if st==\".\":\r\n ans+=\"0\"\r\n elif st==\"-.\":\r\n ans+=\"1\"\r\n else:\r\n ans+=\"2\"\r\n st=\"\"\r\n\r\nprint(ans)\r\n ", "s = input()\r\nnew_s =''\r\nl = len(s)\r\ni=0\r\nwhile i<l:\r\n if s[i]=='.':\r\n new_s += '0'\r\n \r\n elif s[i]=='-' and s[i+1]=='.':\r\n new_s+='1'\r\n i+=1 \r\n \r\n elif s[i] =='-' and s[i+1] =='-':\r\n new_s +='2'\r\n i+=1 \r\n i+=1\r\nprint(new_s)", "s=input()\r\ni=0\r\nf=\"\"\r\nwhile(i<len(s)):\r\n if(s[i]=='-' and s[i+1]=='.' and i!=len(s)-1):\r\n f=f+'1'\r\n i=i+2\r\n elif(s[i]=='-' and s[i+1]=='-' and i!=len(s)-1):\r\n f=f+'2'\r\n i=i+2\r\n elif(s[i]=='.'):\r\n f=f+'0'\r\n i=i+1\r\n# f=int(f)\r\nprint(f)", "str=input()\r\nn=len(str)\r\ni=0\r\nres=\"\"\r\nwhile i<n:\r\n\tif(str[i]=='.'):\r\n\t\tres+=\"0\"\r\n\t\ti+=1\r\n\telse:\r\n\t\tif(str[i+1]=='.'):\r\n\t\t\tres+=\"1\"\r\n\t\telse:\r\n\t\t\tres+=\"2\"\r\n\t\ti+=2\r\nprint(res)", "s=input()\r\nl=list(s)\r\ni=0\r\nwhile(i <=len(l)-1):\r\n if l[i]==\"-\" and l[i+1]=='-':\r\n \r\n print(\"2\",end='')\r\n i=i+2\r\n \r\n elif l[i]==\"-\" and l[i+1]=='.':\r\n print('1',end='')\r\n i=i+2\r\n else:\r\n print('0',end='')\r\n i=i+1\r\n ", "#https://codeforces.com/problemset/problem/32/B\r\n\r\n#.-.--\r\n\r\nborze = input()\r\nborze = borze.replace(\"--\", \"2\")\r\nborze = borze.replace(\"-.\", \"1\")\r\nborze = borze.replace(\".\", \"0\")\r\nprint(borze)\r\n", "x=input()\r\na=\"\"\r\ni=0\r\nwhile i<len(x):\r\n if x[i]==\".\":\r\n a= a+\"0\"\r\n i+=1\r\n elif (x[i]==\"-\") and (x[i+1]==\".\"):\r\n a=a+\"1\"\r\n i+=2\r\n elif (x[i]==\"-\") and (x[i+1]==\"-\"):\r\n a=a+\"2\"\r\n i+=2\r\nprint(a)\r\n", "x = input()\r\nans = \"\"\r\nwhile len(x) > 1:\r\n if x[0] == \"-\":\r\n if x[1] == \".\":\r\n ans += \"1\"\r\n\r\n else:\r\n ans += \"2\"\r\n x = x[1:]\r\n else:\r\n ans += \"0\"\r\n\r\n x = x[1:]\r\n\r\nif len(x) == 1:\r\n ans += \"0\"\r\nprint(ans)", "n = input()\r\nres = []\r\n\r\nidx = 0\r\n\r\nwhile idx < len(n):\r\n if n[idx] == '-':\r\n if n[idx+1] == '.':\r\n res.append('1')\r\n idx += 2\r\n elif n[idx+1] == '-':\r\n res.append('2')\r\n idx += 2\r\n elif n[idx] == '.':\r\n res.append('0')\r\n idx += 1\r\n\r\nprint(''.join(res))\r\n", "n = input()\r\nans = \"\"\r\ni = 0\r\nwhile True:\r\n if i >= len(n):\r\n break\r\n if n[i] == \".\":\r\n ans += \"0\"\r\n i += 1\r\n if i >= len(n):\r\n break\r\n if n[i] == \"-\" and n[i + 1] == \".\":\r\n ans += \"1\"\r\n i += 2\r\n if i >= len(n):\r\n break\r\n if n[i] == \"-\" and n[i + 1] == \"-\":\r\n ans += \"2\"\r\n i += 2\r\nprint(ans)", "getNumber = input()\r\nzero = \".\"\r\none = \"-.\"\r\ntwo = \"--\"\r\nif two in getNumber:\r\n getNumber = getNumber.replace(\"--\", \"2\")\r\nif one in getNumber:\r\n getNumber = getNumber.replace(\"-.\", \"1\")\r\nif zero in getNumber:\r\n getNumber = getNumber.replace(\".\", \"0\")\r\nprint(getNumber)\r\n", "a = input()\r\ni = 0\r\nposl = \"\"\r\nwhile i < len(a):\r\n if a[i] == '.':\r\n posl += '0'\r\n i += 1\r\n elif a[i] == '-':\r\n if a[i+1] == '.':\r\n posl += '1'\r\n i += 2\r\n else:\r\n posl += '2'\r\n i += 2\r\nprint(posl)", "# Borze\r\ncode = input()\r\n\r\nres, i = '', 0\r\nwhile i < len(code):\r\n if code[i] == '.':\r\n res += '0'\r\n else:\r\n if code[i+1] == '.':\r\n res += '1'\r\n else:\r\n res += '2'\r\n i += 1\r\n i += 1\r\n\r\nprint(res)\r\n", "text = input()\r\ntext = text.replace(\"--\", \"2\")\r\ntext = text.replace(\"-.\", \"1\")\r\ntext = text.replace(\".\", \"0\")\r\nprint(text)\r\n\r\n", "r = str.replace\r\nprint(r(r(r(input(),'--', '2'),'-.','1'),'.','0'))", "s = input()\r\nx=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n x=x+'0'\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n x=x+'1'\r\n i+=2\r\n elif s[i]=='-' and s[i+1]=='-':\r\n x=x+'2'\r\n i+=2\r\nprint(x)", "s = list(input())\r\nk = ''\r\nwhile len(s) > 0:\r\n if s[0] == '.':\r\n del s[0]\r\n k = k + '0'\r\n elif s[0] == '-' and s[1] == '.':\r\n del s[0:2]\r\n k = k + '1'\r\n else:\r\n del s[0:2]\r\n k = k + '2'\r\nprint(k)", "# B. Borze\r\n# 0 is «.», 1 as «-.» and 2 as «--»\r\nd = {\r\n '.': 0,\r\n '-.': 1,\r\n '--': 2\r\n}\r\n\r\nn = input()\r\ni = 0\r\nresposta = ''\r\nwhile i < len(n):\r\n for key, value in d.items():\r\n if n[i:].startswith(key):\r\n resposta += str(value)\r\n i += len(key)\r\nprint(resposta)", "code=input()\nn=len(code)\ni=0\nans=''\nwhile(True):\n if code[i]=='.':\n ans+='0'\n i+=1\n elif code[i]=='-':\n if code[i+1]=='-':\n ans+='2'\n i+=2\n elif code[i+1]=='.':\n ans+='1'\n i+=2\n if i>=n:\n break\nprint(ans)", "import re\r\n\r\ncode = input()\r\n\r\ncode = re.sub('--','2',code)\r\ncode = re.sub('-\\.','1',code)\r\ncode = re.sub('\\.','0',code)\r\n\r\nprint(code)", "s = input()\r\noutput = \"\"\r\netat = False\r\nfor i in range(len(s)):\r\n if etat:\r\n etat = False\r\n continue\r\n if s[i] == '.':\r\n output += '0'\r\n else:\r\n if s[i + 1] == '-':\r\n output += '2'\r\n else:\r\n output += '1'\r\n etat = True\r\nprint(output)", "s=input()\r\nx=[]\r\nfor j in s:\r\n x.append(j)\r\no=''\r\nfor i in range(len(x)):\r\n if len(x)>2:\r\n if x[0]=='.':\r\n o+='0'\r\n x.remove(x[0])\r\n elif x[0]==\"-\":\r\n if x[1]=='.':\r\n o+='1'\r\n else:\r\n o+='2'\r\n x.remove(x[1])\r\n x.remove(x[0])\r\n else:\r\n if len(x)==1:\r\n o+='0'\r\n break\r\n else:\r\n if x[0]=='.':\r\n o+='00'\r\n else:\r\n if x[1]=='.':\r\n o+='1'\r\n else:\r\n o+='2'\r\n break\r\nprint(o)", "s = input()\r\nn = len(s) - 1\r\nres = ''\r\ni = -1\r\nwhile i < n:\r\n i += 1\r\n if s[i] == '.':\r\n res += '0'\r\n continue\r\n i += 1\r\n if s[i] == '.':\r\n res += '1'\r\n else:\r\n res += '2'\r\nprint(res)", "remembered_char = ''\r\nparsed_number = ''\r\n\r\nfor borze_number_part in input():\r\n if borze_number_part == '.':\r\n if remembered_char == '-':\r\n parsed_number += '1'\r\n remembered_char = ''\r\n else:\r\n parsed_number += '0'\r\n elif borze_number_part == '-':\r\n if remembered_char == '-':\r\n parsed_number += '2'\r\n remembered_char = ''\r\n else:\r\n remembered_char = borze_number_part\r\n\r\nprint(parsed_number)\r\n", "#https://codeforces.com/problemset/problem/32/B\r\ns=input()\r\nn =len(s)\r\ni=0\r\nans=\"\"\r\nwhile(i<n):\r\n if s[i]=='.':\r\n ans+='0'\r\n i+=1\r\n else:\r\n if s[i+1]=='.':\r\n ans+='1'\r\n else:\r\n ans+='2'\r\n i+=2 \r\nprint(ans)\r\n \r\n ", "x=input()\r\ny=list(x)\r\nk=\"\"\r\ni=0\r\nwhile(1):\r\n if(i<len(y)):\r\n if(y[i]==\".\"):\r\n k=k+\"0\"\r\n i=i+1\r\n else:\r\n if(y[i+1]==\"-\"):\r\n k=k+\"2\"\r\n else:\r\n k=k+\"1\"\r\n i=i+2\r\n \r\n else:\r\n break\r\nprint(k)", "#n = int(input())\r\ns = input()\r\n#arr = list(map(int, input().split()))\r\n#vis = [0]*201\r\n#s = s.replace(\"--\", \"2\")\r\nwhile \"--\" in s:\r\n s = s.replace('--', \"2\")\r\nwhile \"-.\" in s:\r\n s = s.replace('-.', \"1\")\r\nwhile \".\" in s:\r\n s = s.replace('.', \"0\")\r\nprint(s)", "s = input()\r\nans = []\r\ni = 0\r\nwhile i <len(s):\r\n\tif s[i] == '-':\r\n\t\tif s[i+1] == '.':\r\n\t\t\tans.append('1')\r\n\t\telse:\r\n\t\t\tans.append('2')\r\n\t\ti+=2\r\n\telse:\r\n\t\tans.append('0')\r\n\t\ti+=1\r\nprint(''.join(ans))", "a=input()\r\nb=len(a)\r\nd=[]\r\nskip=False\r\nfor i in range(b):\r\n if skip:\r\n skip=False\r\n continue\r\n if a[i]=='.':\r\n d.append(0)\r\n if a[i]=='-':\r\n if a[i+1]=='.':\r\n d.append(1)\r\n skip=True\r\n elif a[i+1]=='-':\r\n d.append(2)\r\n skip=True\r\nfor j in range(len(d)):\r\n print(d[j],end='')", "\r\nl = input()\r\nline = list(l)\r\nn = len(line)\r\na = []\r\ni = 0\r\nwhile i < n:\r\n if line[i] == \"-\":\r\n if line[i+1] == '.':\r\n a.append(1)\r\n i = i+1\r\n elif line[i+1] == '-':\r\n a.append(2)\r\n i = i+1\r\n else:\r\n a.append(0)\r\n i = i+1\r\n\r\nprint(''.join(map(str, a)))\r\n", "a=list(input())\r\n#print(a)\r\nb=''\r\ni=0\r\nwhile i<len(a):\r\n if a[i]=='.':\r\n b+='0'\r\n i+=1\r\n elif a[i]=='-':\r\n if a[i+1]=='.':\r\n b+='1'\r\n elif a[i+1]=='-':\r\n b+='2'\r\n i+=2\r\nprint(b)", "x = input()\r\ns=\"\"\r\ni=0\r\nwhile i<len(x):\r\n if x[i]=='.':\r\n s+='0'\r\n i+=1\r\n elif x[i]=='-' and x[i+1]=='-':\r\n s+='2'\r\n i+=2\r\n else:\r\n s+='1'\r\n i+=2\r\nprint(s)", "n=list(input())\r\nfor i in range(len(n)-1):\r\n if n[i]==\"-\" and n[i+1]==\"-\":\r\n n[i]=\"2\"\r\n n[i+1]=\"3\"\r\n if n[i]==\"-\" and n[i+1]==\".\":\r\n n[i]=\"1\"\r\n n[i+1]=\"3\"\r\n if n[i]==\".\":\r\n n[i]=\"0\"\r\nif len(n)==1: n[0]=\"0\"\r\nif n[-1]==\".\": n[-1]=\"0\"\r\nfor i in range(len(n)):\r\n if n[i]!=\"3\":\r\n print(n[i], end=\"\")", "# Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--». \r\ndecode_table = {\".\": \"0\", \"-.\": \"1\", \"--\": \"2\"}\r\n\r\ndef decode(morse_code):\r\n i = 0\r\n msg = \"\"\r\n while i < len(morse_code):\r\n if morse_code[i] == \"-\":\r\n if morse_code[i+1] == \"-\":\r\n msg += decode_table[\"--\"]\r\n i += 2\r\n elif morse_code[i+1] == \".\":\r\n msg += decode_table[\"-.\"]\r\n i += 2\r\n elif morse_code[i] == \".\":\r\n msg += decode_table[\".\"]\r\n i += 1\r\n \r\n return msg\r\n\r\na = input()\r\nprint(decode(a))\r\n\r\n", "zero = \".\"\r\none = \"-\"\r\nres = \"\"\r\ninp = input()\r\ni=0\r\nwhile i<len(inp):\r\n if inp[i]==zero:\r\n res += \"0\"\r\n elif inp[i]==one:\r\n if inp[i+1]==zero:\r\n res += \"1\"\r\n else:\r\n res += \"2\"\r\n i += 1\r\n i += 1\r\nprint(res)", "s = input()\r\nns = []\r\nn = ''\r\nfor i in range(len(s)):\r\n ns.append(s[i])\r\n if len(ns) == 1 and ns[0] == '.':\r\n n+='0'\r\n ns = []\r\n elif len(ns) == 1 and ns[0] == '-':\r\n continue\r\n elif len(ns) == 2 and ns[1] == '.':\r\n n+='1'\r\n ns = []\r\n elif len(ns) == 2 and ns[1] == '-':\r\n n+='2'\r\n ns = []\r\nprint(n)", "code = str(input())\n\nlst = []\ncheck = 0\ncode2 = []\n\nfor i in code:\n if i == \".\" and check == 0:\n code2.append(\"0\")\n\n\n elif i == \".\" and check == 1:\n code2.append(\"1\")\n check = check - 1\n\n elif i == \"-\" and check == 0:\n check+=1\n\n\n elif i == \"-\"and check == 1:\n code2.append(\"2\")\n check = check - 1\n\nnew = ''.join(code2)\n\nprint(new)", "a = input(\"\")\r\nc = ''\r\nb = ''\r\nfor i in a:\r\n if i == \"-\" and c == \"\":\r\n c = i\r\n elif i == \"-\" and c == '-':\r\n c = \"\"\r\n b += \"2\"\r\n elif i == \".\" and c == \"-\":\r\n c = \"\"\r\n b += '1'\r\n else:\r\n c = \"\"\r\n b += \"0\"\r\nprint(b)\r\n", "code = input()\ncode = code.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\nprint(code)\n", "#32B\r\ns=input()\r\nz=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i]==\".\":\r\n z+=\"0\"\r\n i+=1\r\n elif s[i]==\"-\":\r\n if s[i+1]==\".\":\r\n z+=\"1\"\r\n i+=2\r\n else:\r\n z+=\"2\"\r\n i+=2\r\n \r\nprint(z)\r\n \r\n \r\n", "R = list(input())\r\ni = 0\r\na = ''\r\nwhile i < len(R):\r\n if R[i] == '.':\r\n a += '0'\r\n if R[i] == '-':\r\n if R[i+1]=='-':\r\n a+='2'\r\n else:\r\n a+='1'\r\n i+=1\r\n i+=1\r\n\r\nprint(a)", "morze = input()\r\nresult = \"\"\r\n\r\nflag = False\r\nfor char in morze:\r\n if char == \"-\" and flag == False:\r\n flag = True\r\n continue\r\n \r\n if flag == True:\r\n if char == \".\":\r\n result += \"1\"\r\n\r\n if char == \"-\":\r\n result += \"2\"\r\n\r\n flag = False\r\n else:\r\n result += \"0\"\r\n\r\n\r\nprint(result)\r\n", "b=input()\r\nx=\".\"\r\nz=\"-.\"\r\ny=\"--\"\r\n\r\nt=b\r\nt=t.replace(y,\"2\")\r\nt=t.replace(z,\"1\")\r\nt=t.replace(x,\"0\")\r\n\r\nprint(t)", "def solve(s):\r\n i = 0\r\n ans = \"\"\r\n while i <= len(s) -1:\r\n if s[i] == \".\":\r\n ans += \"0\"\r\n i += 1\r\n elif s[i] == \"-\":\r\n if s[i+1] == \".\":\r\n ans += \"1\"\r\n else:\r\n ans += \"2\"\r\n i = i+2 \r\n # print(ans,i)\r\n return ans\r\ns = input()\r\nprint(solve(s))\r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\nt = ''\ni = 0\nwhile i < len(s):\n if s[i] == '-':\n if s[i + 1] == '.':\n t += '1'\n elif s[i + 1] == '-':\n t += '2'\n i += 1\n else:\n t += '0'\n i += 1\nprint(t)", "s=input()\nl=list(s)\ni=0\nx=[]\nwhile(i<len(l)):\n if(l[i]=='.'):\n x.append('0')\n i+=1\n else:\n if(l[i]=='-' and l[i+1]=='-'):\n x.append('2')\n elif(l[i]=='-' and l[i+1]=='.'):\n x.append('1')\n i+=2\nprint(''.join(x))", "s = input()\ni = 0\nans = []\nwhile(i < len(s)):\n\tif s[i]==\".\":\n\t\tans.append(\"0\")\n\t\ti+=1\n\telse:\n\t\tif s[i:i+2]==\"-.\":\n\t\t\tans.append(\"1\")\n\t\telse:\n\t\t\tans.append(\"2\")\n\t\ti+=2\n\nprint(\"\".join(ans))", "line = input()\r\nseenDash = False\r\nfor i in range(0, len(line)):\r\n # print(\"i =\", i)\r\n if (seenDash == True):\r\n if (line[i] == '.'): # Character combination is \"-.\"\r\n print(\"1\", end=\"\")\r\n seenDash = False\r\n else: # Character combination is \"--\"\r\n print(\"2\", end=\"\")\r\n seenDash = False\r\n else: # seenDash == False\r\n if (line[i] == '.'):\r\n print(\"0\", end=\"\")\r\n seenDash = False\r\n else: # the character is '-'. Wait to see the next character\r\n seenDash = True\r\nprint(\"\")", "string = input() \r\nans = \"\"\r\ni=0\r\nwhile i<len(string) :\r\n if string[i] == \".\" :\r\n ans = ans+\"0\" \r\n i+=1\r\n elif string[i] ==\"-\" and string[i+1]==\".\" : \r\n ans = ans+\"1\"\r\n i+=2\r\n elif string[i] ==\"-\" and string [i+1]==\"-\" :\r\n ans = ans +\"2\" \r\n i+=2\r\nprint(ans) \r\n ", "s = input()\nans = ''\ni = 0\nwhile i < len(s):\n\tif i == len(s) - 1:\n\t\tans += '0'\n\telse:\n\t\tif s[i] == '.':\n\t\t\tans += '0'\n\t\telse:\n\t\t\tif s[i + 1] == '-':\n\t\t\t\tans += '2'\n\t\t\t\ti += 1\n\t\t\telse:\n\t\t\t\tans += '1'\n\t\t\t\ti += 1\n\ti += 1\nprint(ans)\n\n\n", "s = input()\ns = \"2\".join(s.split(\"--\"))\ns = \"1\".join(s.split(\"-.\"))\ns = \"0\".join(s.split(\".\"))\nprint(s)", "def result(s):\n\ts=list(s)\n\tchar=\"\"\n\tj=0\n\twhile j<len(s):\n\t\tif s[j]==\".\" and j==0:\n\t\t\tchar+=\"0\"\n\t\telif s[j]==\".\":\n\t\t\tchar+=\"0\"\t\n\t\telif s[j]==\"-\" and s[j+1]==\".\":\n\t\t\tchar+=\"1\"\n\t\t\tj+=1\n\t\telif s[j]==\"-\" and s[j+1]==\"-\":\n\t\t\tchar+=\"2\"\n\t\t\tj+=1\t\n\t\t\t\t\n\t\tj+=1\t\n\tprint(char)\t\t\t\n\t\t\t\t\ns=input()\nresult(s)\n\n", "a=input()\r\np=3\r\nfor i in range(0,len(a),1):\r\n if p==4:\r\n p=3\r\n continue\r\n #print(p,i)\r\n if a[i]=='.':\r\n print(0,end=\"\")\r\n elif a[i]=='-':\r\n p=4\r\n if a[i+1]=='.':\r\n print(1,end=\"\")\r\n elif a[i+1]=='-':\r\n print(2,end=\"\")\r\n #print(i)", "s=input()\r\nindex=0\r\nans=\"\"\r\nwhile index<len(s):\r\n if s[index]==\".\":\r\n ans+=\"0\"\r\n index+=1\r\n else:\r\n if s[index+1]==\"-\":\r\n ans+=\"2\"\r\n index+=2\r\n elif s[index+1]==\".\":\r\n ans+=\"1\"\r\n index+=2\r\nprint(ans)\r\n", "a=list(input())\r\ni=0\r\nwhile i<len(a):\r\n if a[i]==\".\":\r\n print(\"0\",end=\"\")\r\n i+=1\r\n elif a[i]==\"-\" and a[i+1]==\".\":\r\n print(\"1\",end=\"\")\r\n i+=2\r\n else:\r\n print(\"2\",end=\"\")\r\n i+=2", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-05 22:34:32\nLastEditTime: 2021-11-05 22:36:39\nDescription: Borze\nFilePath: CF32B.py\n'''\n\n\ndef func():\n s = input().strip()\n print(s.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\"))\n\n\nif __name__ == '__main__':\n func()\n ", "number = input()\r\nlst1=[]\r\nlst2=[]\r\ncount=0\r\nk=0\r\nfor i in number:\r\n lst1.append(i)\r\n \r\n\r\nwhile lst1 != [] :\r\n \r\n if lst1[0]==\".\":\r\n lst2.append(0)\r\n del lst1[0]\r\n elif lst1[0]==\"-\" and lst1[1]==\".\":\r\n lst2.append(1)\r\n del lst1[0]\r\n del lst1[0]\r\n elif lst1[0]==\"-\" and lst1[1]==\"-\":\r\n lst2.append(2)\r\n del lst1[0]\r\n del lst1[0]\r\n count+=1\r\n\r\nfor i in lst2:\r\n print(i,end=\"\")", "s = input()\r\nnums = \"\"\r\ni = 0\r\nuzunluq = len(s)\r\nwhile i < uzunluq:\r\n if s[i] == '.':\r\n nums += \"0\"\r\n i += 1\r\n elif s[i:i+2] == '-.':\r\n nums += \"1\"\r\n i += 2\r\n elif s[i:i+2] == '--':\r\n nums += \"2\"\r\n i += 2\r\nprint(nums)\r\n", "s=input()\r\na=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i]==\"-\" and s[i+1]==\"-\":\r\n a+=\"2\"\r\n i+=2\r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n a+=\"1\"\r\n i+=2\r\n elif s[i]==\".\":\r\n a+=\"0\"\r\n i+=1\r\nprint(a)\r\n", "text_input = input()\r\nreplaced_text = text_input.replace('--', '2').replace('-.', '1').replace('.', '0')\r\nprint(replaced_text)\r\n", "#!/usr/bin/env python\r\nimport sys, math, itertools\r\n\r\nif __name__ == '__main__':\r\n\twtf = sys.stdin.read()\r\n\twtf = wtf.strip().split('\\n')\r\n\tmem = ''\r\n\tans = ''\r\n\tfor c in wtf[0]:\r\n\t\tmem += c\r\n\t\tif mem == '.':\r\n\t\t\tans += '0'\r\n\t\t\tmem = ''\r\n\t\telif mem == '-.':\r\n\t\t\tans += '1'\r\n\t\t\tmem = ''\r\n\t\telif mem == '--':\r\n\t\t\tans += '2'\r\n\t\t\tmem = ''\r\n\tprint(ans)", "s=input()\r\nres=\"\"\r\nn=len(s)\r\nr=0\r\nwhile r<n:\r\n if s[r]=='.':\r\n res+='0'\r\n r+=1\r\n elif s[r:r+2]==\"-.\":\r\n res+='1'\r\n r+=2\r\n else:\r\n res+='2'\r\n r+=2\r\nprint(res)", "inp = input()\n\nbuf = ''\n\noutp = ''\n\nfor c in inp:\n if buf == '':\n if c == '.':\n outp += '0'\n else:\n buf += c\n else:\n if c == '.':\n outp += '1'\n else:\n outp += '2'\n buf = ''\n\nprint (outp)", "s = input()\r\nn = 0\r\nans = \"\"\r\nwhile(n < len(s)):\r\n if s[n] == \".\":\r\n ans += \"0\"\r\n n+=1\r\n else:\r\n if s[n+1] == \".\":\r\n ans += \"1\"\r\n else:\r\n ans += \"2\"\r\n n+=2\r\n\r\nprint(ans)\r\n", "fullstring = input()\r\n\r\ndef converter(fullstring):\r\n replaced_2 = fullstring.replace('--', '2')\r\n replaced_1 = replaced_2.replace('-.', '1')\r\n final = replaced_1.replace('.', '0')\r\n print(final)\r\n \r\n\r\nconverter(fullstring)\r\n", "s = input()\r\n\r\nlast = \"\"\r\nrez = []\r\nfor x in s:\r\n if last == \"-\":\r\n if x == \".\":rez.append(1)\r\n elif x == \"-\":rez.append(2)\r\n last = \"\"\r\n else:\r\n if x == \".\":rez.append(0)\r\n else:last = x\r\n\r\nprint(*rez, sep=\"\")", "s = input()\r\nn = len(s)\r\ni = 0\r\nans = \"\"\r\n\r\nwhile i < n:\r\n if s[i] == \".\":\r\n print(\"0\", end=\"\")\r\n elif s[i] == \"-\" and s[i+1] == \".\":\r\n print(\"1\", end=\"\")\r\n i += 1\r\n elif s[i] == \"-\" and s[i+1] == \"-\":\r\n print(\"2\", end=\"\")\r\n i += 1\r\n i += 1\r\n", "s=input()\r\nn=len(s)\r\ni=0\r\ndecoded=''\r\nwhile i <n:\r\n if s[i]=='-' and s[i+1]=='-':\r\n decoded+='2'\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n decoded+='1'\r\n i+=1\r\n else:decoded+='0'\r\n i+=1\r\nprint(decoded)", "n=input()\r\ni=0\r\nwhile i<len(n):\r\n if n[i]==\".\":\r\n print(0, end=\"\")\r\n elif n[i]=='-' and n[i+1]==\".\":\r\n print(1, end=\"\")\r\n i+=1\r\n elif n[i]==\"-\" and n[i+1]==\"-\":\r\n print(2, end=\"\")\r\n i+=1\r\n i+=1\r\n\r\n\r\n", "code= input()\r\ni=0\r\noutput=[]\r\n\r\nwhile i < len(code):\r\n\r\n if code[i]=='.':\r\n output.append(0)\r\n\r\n elif code[i]=='-' and code[i+1]=='-':\r\n output.append(2)\r\n i=i+1\r\n\r\n elif code[i]=='-' and code[i+1]=='.':\r\n output.append(1)\r\n i=i+1\r\n i=i+1\r\nfor i in range(len(output)):\r\n print(output[i], end=\"\")\r\n\r\n\r\n\r\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef test_case():\r\n s = input()\r\n i = 0\r\n while i < len(s):\r\n if s[i] == '.':\r\n print(0, end='')\r\n i += 1\r\n elif s[i] == '-':\r\n if s[i+1] == '.':\r\n print(1, end='')\r\n else:\r\n print(2, end='')\r\n i += 2\r\n print()\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "l1=['.','-.','--']\r\nl2=[0,1,2]\r\nst=input(\"\")+'*'\r\ni=0;\r\nwhile i<len(st)-1:\r\n if st[i]+st[i+1]==\"-.\":\r\n print(1,end=\"\")\r\n i+=2;\r\n elif st[i]+st[i+1]==\"--\":\r\n print(2,end=\"\")\r\n i+=2;\r\n \r\n else:\r\n print(0,end=\"\")\r\n i+=1\r\n", "a = input(\"\")\r\nb = \"\"\r\nc = \"\"\r\nfor i in a:\r\n if i == '-' and len(c) != 1:\r\n c+=\"-\"\r\n continue\r\n if len(c) == 0 and i == \".\":\r\n b += '0'\r\n c = \"\"\r\n elif len(c) == 1 and i == \".\":\r\n b += '1'\r\n c = \"\"\r\n elif i == \"-\" and c == \"-\":\r\n b += '2'\r\n c = \"\"\r\nprint(b)", "print((((str(input())).replace(\"--\",\"2\")).replace(\"-.\",\"1\").replace(\".\",\"0\")))\r\n", "n=input()\r\ns=''\r\ni=0\r\n\r\nwhile(i<len(n)):\r\n if (n[i]=='.'):\r\n s+= '0'\r\n i+=1\r\n elif (n[i]=='-' and n[i+1]=='.'):\r\n s+= '1'\r\n i+=2\r\n elif (n[i]=='-' and n[i+1]=='-'):\r\n s+= '2'\r\n i+=2\r\n \r\n\r\nprint(s)", "def main():\n p =input()\n res = \"\"\n i = 0\n while(i<len(p)):\n if p[i] == \".\":\n res += \"0\"\n i +=1\n elif p[i]==\"-\" and p[i+1]==\"-\":\n res+=\"2\"\n i+=2\n else:\n res+=\"1\"\n i+=2\n print(res)\n\n\n\nif __name__ == '__main__':\n main()\n", "s=str(input())\r\na=[]\r\nfor _ in range(len(s)):\r\n a.append(s[_])\r\nj=0\r\nx=\"\"\r\nwhile j<len(a):\r\n x=x+a[j]\r\n if x==\".\":\r\n print(0,end=\"\")\r\n x=\"\"\r\n else:\r\n if a[j+1]==\"-\":\r\n print(2,end=\"\")\r\n j+=1\r\n x=\"\"\r\n else:\r\n print(1,end=\"\")\r\n j+=1\r\n x=\"\"\r\n j+=1", "R=str.replace\nstr = input()\nprint(R(R(R(str,'--','2'),'-.','1'),'.','0'))\n", "s=input()\r\nanswer=''\r\nindex=0\r\nwhile index<len(s):\r\n\tif s[index]=='.':\r\n\t\tanswer+='0'\r\n\t\tindex+=1\r\n\telif s[index]=='-' and index<len(s)-1:\r\n\t\tif s[index+1]=='.':\r\n\t\t\tanswer+='1'\r\n\t\telse:\r\n\t\t\tanswer+='2'\r\n\t\tindex+=2\r\nprint(answer)", "from sys import stdin, setrecursionlimit\nfrom bisect import bisect_left, bisect_right\nfrom collections import deque\nfrom functools import lru_cache, reduce\nfrom heapq import heappush, heappop\nfrom math import sqrt, ceil, floor, log2\nimport io,os\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\ninput = stdin.readline\n\ndef main(z):\n s = input()\n n = len(s)\n i = 0\n ans = []\n while i < n:\n if s[i] == '-':\n if s[i + 1] == '-':\n ans.append(2)\n else: ans.append(1)\n i += 2\n else: \n ans.append(0)\n i += 1\n ans.pop()\n print(''.join([str(x) for x in ans]))\nmain(0)\n\n# Input\n# 8 3\n# BBGBGBGB\n# BGBGBGBB\n# GBGBGBBB\n# GGBGBBBB\n# Participant's output\n# GBGBBGBB\n\n# Jury's answer\n# GGBGBBBB", "numbers = input()\r\nflag=0\r\nstr=[]\r\nfor i in range(numbers.__len__()):\r\n if flag!=1:\r\n if (numbers[i] == \".\"):\r\n print(\"0\",end=\"\")\r\n elif i < numbers.__len__() -1:\r\n if numbers[i + 1] == \"-\":\r\n print(\"2\",end=\"\")\r\n else:\r\n print(\"1\",end=\"\")\r\n flag=1\r\n else:\r\n flag=0", "n=list(input())\r\na=len(n)\r\nc=[]\r\ni=0\r\nwhile i<a :\r\n\tif(n[i]==\".\"):\r\n\t\tc.append(\"0\")\r\n\t\ti+=1\r\n\telif(n[i]==\"-\" and n[i+1]==\".\"):\r\n\t\tc.append(\"1\")\r\n\t\ti+=2\r\n\telif(n[i]==\"-\" and n[i+1]==\"-\"):\r\n\t\tc.append(\"2\")\r\n\t\ti+=2\r\nprint(\"\".join(c))", "def borz(string=input()):\r\n res = string.replace('--','2')\r\n res1 = res.replace('-.','1')\r\n res2 = res1.replace('.','0')\r\n print(res2)\r\n\r\nif __name__ == '__main__':\r\n borz()", "s=input()\r\nr1=s.replace(\"--\",\"2\")\r\nr2=r1.replace(\"-.\",\"1\")\r\nprint(r2.replace(\".\",\"0\"))\r\n", "def main():\r\n s = input()\r\n s = list(s)\r\n j=0\r\n queue=''\r\n while j<len(s):\r\n if (s[j]=='-' and s[j+1]=='.'):\r\n queue+='1'\r\n j+=1 \r\n elif (s[j]=='-' and s[j+1]=='-'):\r\n queue+='2'\r\n j+=1\r\n else:\r\n queue+='0'\r\n j+=1\r\n \r\n print(queue) \r\n\r\nif __name__=='__main__':\r\n main() ", "k=input()\r\nn=len(k)\r\ni=0\r\nwhile(i<len(k)):\r\n if(k[i]=='-' and k[i+1]=='.'):\r\n print(1,end='')\r\n i=i+2\r\n elif(k[i]=='-' and k[i+1]=='-'):\r\n print(2,end='')\r\n i=i+2\r\n else:\r\n print(0,end='')\r\n i=i+1", "s=input(\"\")\r\nc=len(s)\r\nindex = 0\r\nwhile(index < c):\r\n if(s[index]=='.'):\r\n print(\"0\",end=\"\")\r\n elif(s[index]=='-' and s[index + 1] == '.'):\r\n print(\"1\",end=\"\")\r\n index+=1\r\n elif(s[index]=='-' and s[index + 1] == '-'):\r\n print(\"2\",end=\"\") \r\n index+=1\r\n index+=1", "ans=\"\"\r\nstring=input()\r\nwhile len(string)!=0:\r\n\tif string[:2]==\"--\":\r\n\t\tans+=\"2\"\r\n\t\tstring=string[2:]\r\n\telif string[:2]==\"-.\":\r\n\t\tans+=\"1\"\r\n\t\tstring=string[2:]\r\n\telse:\r\n\t\tans+=\"0\"\r\n\t\tstring=string[1:]\r\nprint(ans)", "x=list(input())\r\ns=''\r\na=-1\r\nfor i in range(len(x)):\r\n if i==a:\r\n continue\r\n if x[i]=='-':\r\n if x[i+1]=='-':\r\n s+='2'\r\n a=i+1\r\n elif x[i+1]=='.':\r\n s+='1'\r\n a=i+1\r\n elif x[i]=='.':\r\n s+='0'\r\nprint(s)", "from re import A, S\r\nimport sys, os.path\r\nimport math\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\ns = str(input())\r\nn = len(s)\r\ni = 0\r\nwhile i<n:\r\n if s[i:i+2]==\"-.\":\r\n print(\"1\",end=\"\")\r\n i+=2\r\n elif s[i:i+2]==\"--\":\r\n print(\"2\",end=\"\")\r\n i+=2\r\n elif s[i:i+1]==\".\":\r\n print(\"0\",end=\"\")\r\n i+=1\r\n \r\n", "s = input()\r\nans = []\r\ni=0\r\nwhile(i<len(s)):\r\n if(s[i]=='.'):\r\n x = '0'\r\n i = i+1\r\n ans.append(x)\r\n continue\r\n if(i != len(s)-1):\r\n if(s[i]=='-' and s[i+1]=='.'):\r\n x = '1'\r\n i = i+2\r\n ans.append(x)\r\n continue\r\n if(s[i]=='-' and s[i+1]=='-'):\r\n x = '2'\r\n i = i+2\r\n ans.append(x)\r\n continue\r\n\r\nfor ele in ans:\r\n print(ele, end='')", "s = input()\r\na = []\r\nj = 1\r\ni = 0\r\nwhile i < len(s):\r\n if j == len(s) and s[i] == \".\":\r\n a.append(0)\r\n break\r\n\r\n if s[i] == \".\" and s[j] == \"-\" or s[i] == \".\" and s[j] == \".\":\r\n a.append(0)\r\n if s[i] == \"-\" and s[j] == \".\":\r\n i += 1\r\n j += 1\r\n a.append(1)\r\n if s[i] == \"-\" and s[j] == \"-\":\r\n i += 1\r\n j += 1\r\n a.append(2)\r\n j += 1\r\n i += 1\r\nprint(*a, sep=\"\")\r\n", "s = input()\r\ncnt = 0\r\na = \"\"\r\nwhile cnt < len(s):\r\n if s[cnt] == '.':\r\n cnt -= 1\r\n a += \"0\"\r\n elif s[cnt+1] == '.':\r\n a += \"1\"\r\n else:\r\n a += \"2\"\r\n cnt += 2\r\nprint(a)", "k=input()\r\na=''\r\nx=0\r\nfor i in k:\r\n if i==\".\"and x==0:\r\n a+='0'\r\n elif i==\".\" and x==1:\r\n a+='1'\r\n x=0\r\n elif i=='-'and x==0:\r\n x=1\r\n elif i=='-' and x==1:\r\n a+='2'\r\n x=0\r\nprint(a)", "\r\n\r\n\r\n\r\n\r\n\r\n\r\na=list(input())\r\n\r\nt=''\r\ns=len(a)\r\nfor j in range(s-1):\r\n\r\n if a[j]=='.':\r\n t+='0'\r\n a[j]='0'\r\n elif a[j]=='-':\r\n if a[j+1]=='-':\r\n t+='2'\r\n a[j+1]='0'\r\n a[j]='0'\r\n elif a[j+1]=='.':\r\n t+='1'\r\n a[j+1]='0'\r\n a[j]='0'\r\nif a[-1]=='.':\r\n t+='0'\r\n\r\nprint(t)\r\n \r\n \r\n", "decodes=input()\r\ndecodes=list(decodes)\r\nn = len(decodes)\r\ni=0\r\nwhile i<n:\r\n\r\n if decodes[i]=='-':\r\n if(decodes[i+1]=='.'):\r\n print('1',end='')\r\n else :\r\n print('2',end='')\r\n i+=1\r\n else :\r\n print('0',end='')\r\n i+=1", "code = input().strip()\r\nres = \"\"\r\nflag = False\r\nfor i in range(len(code)):\r\n\tif not flag:\r\n\t\tif code[i] == '.':\r\n\t\t\tres += \"0\"\r\n\t\telse:\r\n\t\t\tflag = True\r\n\telse:\r\n\t\tif code[i] == \".\":\r\n\t\t\tres += \"1\"\r\n\t\telse:\r\n\t\t\tres += \"2\"\r\n\t\tflag = False\r\n\r\nprint(res)", "x = input()\r\nn = len(x)\r\ni = 0\r\nans = \"\"\r\nwhile i<n:\r\n if i == 0 and x[i]=='.':\r\n ans+=\"0\"\r\n i+=1\r\n elif x[i]==\"-\" and x[i+1] ==\".\":\r\n ans+=\"1\"\r\n i+=2\r\n elif x[i] == \"-\" and x[i+1] ==\"-\":\r\n ans+=\"2\"\r\n i+=2\r\n else:\r\n ans+=\"0\"\r\n i+=1\r\nprint(ans)", "x=input()\r\nnumber=\"\"\r\ni=0\r\nwhile i<len(x)-1:\r\n if x[i]==\".\":\r\n number=number+\"0\"\r\n i=i+1\r\n elif x[i:i+2]==\"-.\":\r\n number=number+\"1\"\r\n i=i+2\r\n elif x[i:i+2]==\"--\":\r\n number=number+\"2\"\r\n i=i+2\r\nif i!=len(x): number=number+\"0\"\r\nprint(number)\r\n", "# https://codeforces.com/problemset/problem/32/B\r\n\r\nborze_code = input()\r\nfinal_number = ''\r\n\r\ntemp_symbol_check = ''\r\n\r\nfor char in borze_code:\r\n temp_symbol_check += char\r\n if temp_symbol_check == '.':\r\n final_number += '0'\r\n elif len(temp_symbol_check) == 1:\r\n continue\r\n elif temp_symbol_check == '-.':\r\n final_number += '1'\r\n elif temp_symbol_check == '--':\r\n final_number += '2'\r\n\r\n temp_symbol_check = ''\r\n\r\nprint(final_number)\r\n", "code = input()\r\noutput = []\r\nwhile len(code) != 0:\r\n if code[0] == '.':\r\n output.append('0')\r\n code = code[1:]\r\n else:\r\n if code[1] == '.':\r\n output.append('1')\r\n else:\r\n output.append('2')\r\n code = code[2:]\r\nprint(''.join(output))", "s=input()\r\ns2=str(\"\")\r\ni=0\r\nwhile i < len(s):\r\n if s[i]==\".\":\r\n s2+=\"0\"\r\n \r\n if s[i]==\"-\" and s[i+1]==\".\":\r\n s2+=\"1\"\r\n i+=1\r\n \r\n if s[i]==\"-\" and s[i+1]==\"-\":\r\n s2+=\"2\"\r\n i+=1\r\n i+=1\r\n\r\n\r\nprint(s2)", "s = []\r\ns.extend(input())\r\nn = []\r\nwhile s != []:\r\n if s[0] == '.':\r\n n.append(0)\r\n del s[0]\r\n elif s[0] == '-':\r\n if s[1] == '.':\r\n n.append(1)\r\n elif s[1] == '-':\r\n n.append(2)\r\n del s[0]\r\n del s[0]\r\nprint(*n, sep ='')\r\n ", "inp = input()\r\ni = 0\r\nres = ''\r\nwhile(i < len(inp)):\r\n if(inp[i] == \"-\" and i+1 < len(inp) and inp[i+1] == \".\"):\r\n res += \"1\"\r\n i+=2\r\n elif(inp[i] == \"-\" and i+1 < len(inp) and inp[i+1] == \"-\"):\r\n res += \"2\"\r\n i+=2\r\n else:\r\n res+=\"0\"\r\n i+=1\r\nprint(res)\r\n ", "def 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)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ns = input()\r\n\r\nm = { '-.': \"1\", '--':\"2\"}\r\n\r\ni = 0\r\nout = \"\"\r\nwhile i < len(s):\r\n if s[i] == \".\":\r\n out += \"0\"\r\n elif s[i] == \"-\":\r\n out += m[s[i:i+2]]\r\n i += 1\r\n i += 1\r\nprint(out)", "t = list(input())\r\nl = []\r\nfor i in range(0, len(t)):\r\n if t[i] == '-':\r\n del t[i]\r\n t.insert(i, 'g')\r\n if t[i + 1] == '.':\r\n l.append('1')\r\n del t[i + 1]\r\n t.insert(i + 1, 'g')\r\n else:\r\n l.append('2')\r\n del t[i + 1]\r\n t.insert(i + 1, 'g')\r\n elif t[i] == '.':\r\n l.append('0')\r\n del t[i]\r\n t.insert(i, 'g')\r\nprint(''.join(l))\r\n", "s = input()\r\nR = str.replace\r\nprint(R(R(R(s, '--', '2'), '-.', '1'), '.', '0'))", "a = input()\r\na = (a.replace(\"--\",\"2\").replace(\"-.\",\"1\").replace(\".\",\"0\"))\r\nprint(a)\r\n", "s = input()\r\nc = ''\r\nwhile s != '':\r\n if s[0] == '.':\r\n c += '0'\r\n s = s[1:]\r\n elif s[1] == '.':\r\n c += '1'\r\n s = s[2:]\r\n else:\r\n c += '2'\r\n s = s[2:]\r\nprint(c)", "coded_text = input()\r\ncipher_tool = {\".\":'0', \"-.\":'1',\"--\":'2'}\r\nres = \"\"\r\nn = len(coded_text)\r\ni = 0\r\nwhile(i <n):\r\n if coded_text[i] == '.':\r\n res+= cipher_tool[coded_text[i]]\r\n i+=1\r\n elif coded_text[i] == '-' and i+1<n and coded_text[i+1] == '-':\r\n res += cipher_tool[coded_text[i]+coded_text[i+1]]\r\n i+=2\r\n elif coded_text[i] == '-' and i+1<n and coded_text[i+1] == '.':\r\n res += cipher_tool[coded_text[i]+coded_text[i+1]]\r\n i+=2\r\nprint(res)", "line = input()\r\ni = 0\r\nwhile(i < len(line)):\r\n if line[i]==\".\":\r\n print(0,end=\"\")\r\n elif line[i:i+2]==\"-.\":\r\n print(1,end=\"\")\r\n i+=1\r\n elif line[i:i+2]==\"--\":\r\n print(2,end=\"\")\r\n i+=1\r\n i +=1\r\n\r\n \r\n\r\n", "# https://codeforces.com/problemset/problem/32/B\r\n\r\n\"\"\"\r\nTernary notation in Berland is as follows:\r\n * . is 0\r\n * -. is 1\r\n * -- is 3\r\n\"\"\"\r\n\r\nimport sys\r\n\r\nt_number = sys.stdin.readline().strip()\r\nn = len(t_number)\r\nnumber = ''\r\n\r\nflag = 0\r\nfor i in range(n):\r\n # Character has already been considered so skip\r\n if flag == 1:\r\n flag = 0\r\n continue\r\n\r\n # Performing the parse\r\n if t_number[i] == '.':\r\n number += '0'\r\n elif t_number[i] == '-':\r\n flag = 1 # We have already considered the next character\r\n if t_number[i+1] == '.':\r\n number += '1'\r\n elif t_number[i+1] == '-':\r\n number += '2'\r\n\r\nsys.stdout.write(number)", "code = input().strip()\r\nsolution = []\r\nposition = 0\r\ncode = code + ' '\r\nwhile code[position] != ' ':\r\n if code[position] == '.':\r\n solution.append('0')\r\n position += 1\r\n elif code[position] + code[position + 1] == '-.':\r\n solution.append('1')\r\n position += 2\r\n elif code[position] + code[position + 1] == '--':\r\n solution.append('2')\r\n position += 2\r\nb = ''.join(solution)\r\nprint(b)", "a=str(input())\r\ns=\"\"\r\ni=0\r\nwhile a!=\"\":\r\n if a[i]==\".\":\r\n s+=\"0\"\r\n a=a[1:]\r\n elif a[i]==\"-\":\r\n if a[i+1]==\".\":\r\n s+=\"1\"\r\n a=a[2:]\r\n elif a[i]==\"-\":\r\n s+=\"2\"\r\n a=a[2:]\r\nprint(s)", "a = input()\r\ni = 0\r\nwhile i < len(a):\r\n if a[i] == '.':\r\n i += 1\r\n print(\"0\" , end = \"\")\r\n else:\r\n if a[i + 1] == \".\":\r\n print(\"1\" , end = \"\")\r\n else:\r\n print(\"2\" , end = \"\")\r\n i += 2\r\n", "s = input()\r\nj = 0\r\na = \"\"\r\nwhile j < len(s):\r\n\tif s[j] == \".\":\r\n\t\ta += \"0\"\r\n\t\tj += 1\r\n\telif s[j] == \"-\":\r\n\t\tif s[j+1] == \".\":\r\n\t\t\ta += \"1\"\r\n\t\telse:\r\n\t\t\ta += \"2\"\r\n\t\tj += 2\r\nprint(a)\r\n", "cod=input()\r\nnum=[]\r\nj=0\r\nfor i in cod:\r\n if j>len(cod)-1:\r\n break\r\n if cod[j]=='.':\r\n num.append(0)\r\n j=j+1\r\n \r\n elif cod[j]=='-':\r\n if cod[j+1]=='.':\r\n num.append(1)\r\n elif cod[j+1]=='-':\r\n num.append(2)\r\n j=j+2\r\n \r\n\r\nprint(''.join(list(map(str,num))))", "inp = input(\"\")\r\ninp_lst = list(inp)\r\nternary_num = \"\"\r\n\r\nfor i in range(len(inp_lst)):\r\n if inp_lst[i] == \".\":\r\n ternary_num += \"0\"\r\n inp_lst[i] = \"#\"\r\n elif inp_lst[i] == \"-\":\r\n if inp_lst[i+1] == \".\":\r\n ternary_num +=\"1\"\r\n else:\r\n ternary_num += \"2\"\r\n inp_lst[i:i+2] = \"#\"*((i+2)-i)\r\n\r\nprint(ternary_num)", "t = input()\r\nwhile '--' in t:\r\n t = t.replace('--', '2')\r\n\r\nwhile '-.' in t:\r\n t = t.replace('-.', '1')\r\n\r\nwhile '.' in t:\r\n t = t.replace('.', '0')\r\n\r\nprint(t)\r\n", "s = input()\r\ns = list(s)\r\nfor i in range(len(s)):\r\n if i < len(s):\r\n if s[i] == \".\":\r\n print(0, end='')\r\n elif s[i] == '-' and i+1 < len(s) and s[i+1] == '-' :\r\n print(2, end='')\r\n s.remove(s[i+1])\r\n elif s[i] == '-' and i+1 < len(s) and s[i+1] == '.':\r\n print(1, end = '')\r\n s.remove(s[i+1])\r\n else:\r\n break", "s = input()\nres, i = [], 0\nwhile i < len(s):\n if s[i] == \".\":\n res.append(\"0\")\n elif s[i + 1] == \".\":\n res.append(\"1\")\n i += 1\n else:\n res.append(\"2\")\n i += 1\n i += 1\nres = \"\".join(res)\nprint(res)\n", "s = input()\n\nfor e in range(s.count('--')):\n s = s.replace('--', '2')\n\nfor i in range(s.count('-.')):\n s = s.replace('-.', '1')\n\nfor i in range(s.count('.')):\n s = s.replace('.', '0')\n\nprint(s)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\ns=input()\r\ni=0\r\nn=len(s)\r\nwhile i<n:\r\n if s[i]==\".\":\r\n print(0,end=\"\")\r\n i+=1\r\n else:\r\n if s[i+1]==\".\":\r\n print(1,end=\"\")\r\n else:\r\n print(2,end=\"\")\r\n i+=2\r\n", "n=input()\r\nlst=[]\r\nfor i in n:\r\n lst.append(i)\r\ns=''\r\nfor j in range(len(lst)):\r\n if(lst[0]=='.'):\r\n s=s+'0'\r\n lst.remove(lst[0])\r\n elif(lst[0]=='-' and lst[1]=='.'):\r\n s=s+'1'\r\n lst.remove(lst[1])\r\n lst.remove(lst[0])\r\n else:\r\n if(lst[0]=='-' and lst[1]=='-'):\r\n s=s+'2'\r\n lst.remove(lst[1])\r\n lst.remove(lst[0])\r\n if(lst==[]):\r\n break\r\nprint(s)\r\n", "string = input()\r\ncurr = \"\"\r\nnum = []\r\nfor i in range(len(string)):\r\n curr += string[i]\r\n if (curr == \"--\"):\r\n num.append(\"2\")\r\n curr = \"\"\r\n elif (curr == \"-.\"):\r\n num.append(\"1\")\r\n curr = \"\"\r\n elif (curr == \".\"):\r\n num.append(\"0\")\r\n curr = \"\"\r\nprint(\"\".join(num))", "decode = input()\r\ndecode = decode.replace('--','2')\r\ndecode = decode.replace('-.','1')\r\ndecode = decode.replace('.','0')\r\nprint(decode)\r\n", "#Input the test case\r\ns = input()\r\nres = ''\r\n#definding the Borse code \r\nzero = '.'\r\none = '-.'\r\ntwo = '--'\r\n\r\nlst = list(s)\r\nwhile len(lst) > 0:\r\n if lst[0] == '.':\r\n res += '0'\r\n del(lst[0])\r\n elif lst[0] == '-' and lst[1] == '.':\r\n res += '1'\r\n del(lst[0])\r\n del(lst[0])\r\n else:\r\n res += '2'\r\n del(lst[0])\r\n del(lst[0])\r\nprint(res)", "# import math\r\n# import re\r\n# import random\r\ndef solve():\r\n t=1\r\n # t = int(input())\r\n while(t):\r\n t-=1\r\n # n = int(input())\r\n # a = [int(x) for x in input().split()]\r\n s = input()\r\n i = 0\r\n n = len(s)\r\n while(i<n):\r\n if(s[i] == '-'):\r\n if(s[i+1] == '-'): print(\"2\", end=\"\"); i+=1; \r\n elif(s[i+1] == '.'): print(\"1\", end=\"\"); i+=1\r\n elif(s[i] == '.'):\r\n print(\"0\", end=\"\")\r\n i+=1\r\n print(end=\"\\n\")\r\n\r\n\r\nsolve()\r\n", "s = input() \r\n\r\nmapping = {'.': '0', '-.': '1', '--': '2'}\r\n\r\nresult = ''\r\ni = 0\r\nwhile i < len(s):\r\n if s[i:i+2] in mapping:\r\n result += mapping[s[i:i+2]]\r\n i += 2\r\n else:\r\n result += mapping[s[i]]\r\n i += 1\r\n\r\nprint(result) ", "s = input()\r\nkq = ''\r\ni = 0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n kq+='0'\r\n i+=1\r\n continue\r\n if s[i]=='-':\r\n if s[i+1]=='-':\r\n kq+='2'\r\n else:\r\n kq+='1'\r\n i+=2\r\n continue\r\nprint(kq)", "borze = input()\ni = 0\ndecoded = \"\"\nwhile i<len(borze):\n if borze[i]==\".\":\n decoded+=\"0\"\n i+=1\n elif borze[i:i+2]==\"-.\":\n decoded+=\"1\"\n i+=2\n else:\n decoded+=\"2\"\n i+=2\nprint(decoded)", "\"\"\"\r\ntake input str replace each encoding and print\r\nthe order of replacement is very important\r\ngive priority to 2 then 1 then 0\r\n\"\"\"\r\nprint(input().replace(\"--\", '2').replace(\"-.\", \"1\").replace(\".\", '0'))\r\n", "if __name__ == \"__main__\":\r\n s = input()\r\n\r\n n = len(s)\r\n\r\n output = \"\"\r\n\r\n i = 0;\r\n\r\n while (i<n):\r\n if s[i] == \".\" :\r\n output += \"0\"\r\n i += 1\r\n elif s[i] == \"-\" and s[i+1] == \".\":\r\n output += \"1\"\r\n i += 2\r\n elif s[i] == \"-\" and s[i+1] == \"-\":\r\n output += \"2\"\r\n i += 2\r\n\r\n print(output)\r\n", "#s =input()\r\n#ans = s.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\n#print(ans)\r\ns = input()\r\nans = s.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\nprint(ans)", "s=input()\r\ns1=''\r\ni=0\r\nwhile i < len(s):\r\n if s[i]==\".\":\r\n s1+='0'\r\n i+=1\r\n else:\r\n if s[i]==\"-\":\r\n if s[i+1]==\".\":\r\n s1+='1'\r\n i+=2\r\n else:\r\n s1+=\"2\"\r\n i+=2\r\nprint(s1)\r\n ", "IL = lambda: list(map(int, input().split()))\r\n\r\ns = input()\r\nprint(s.replace('--', '2').replace('-.', '1').replace('.', '0'))", "code = str(input())\r\nresult = ''\r\ni = 0\r\nwhile i < len(code):\r\n if code[i] == \".\":\r\n result += \"0\"\r\n i +=1\r\n elif code[i] == \"-\" and code[i+1] == \".\":\r\n result += \"1\"\r\n i +=2\r\n elif code[i] == code[i+1] == \"-\":\r\n result += \"2\"\r\n i +=2\r\nprint(result) ", "borzes = input()\r\nans = []\r\nn = len(borzes)\r\ni = 0\r\nwhile i < n:\r\n if borzes[i] == \".\":\r\n ans.append('0')\r\n i += 1\r\n else:\r\n if borzes[i + 1] == \"-\":\r\n ans.append('2')\r\n else:\r\n ans.append('1')\r\n i += 2\r\nprint(\"\".join(ans))\r\n", "s=input()\r\nn=len(s)\r\ni=0\r\nl=[]\r\nwhile(i<n):\r\n\tif s[i]=='.':\r\n\t\tl.append('0')\r\n\t\ti+=1\r\n\telse:\r\n\t\tif s[i]=='-' and s[i+1]=='.':\r\n\t\t\tl.append('1')\r\n\t\telif s[i]=='-' and s[i+1]=='-':\r\n\t\t\tl.append('2')\r\n\t\ti+=2\r\nprint(\"\".join(l))\r\n\t\t", "s = input()\r\nd = {\".\":'0',\"-.\":'1',\"--\":'2'}\r\ni =0 \r\ng = \"\"\r\nwhile(i<len(s)):\r\n if(i<len(s)-1):\r\n k = s[i]+s[i+1]\r\n if(k in d):\r\n g = g +d[k]\r\n i+=2\r\n else:\r\n g = g+d[s[i]]\r\n i+=1\r\n else:\r\n g = g+d[s[i]]\r\n i+=1\r\nprint(g)", "s = input()\r\ni = 0\r\nn = len(s)\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n print('0',end='')\r\n elif s[i] == '-' and i<n and s[i+1] == '.':\r\n i += 1\r\n print('1',end='')\r\n elif s[i] == '-' and i<n and s[i+1] == '-':\r\n i += 1\r\n print('2',end='')\r\n i += 1", "n=input()\r\ns=\"\"\r\ni=0\r\nwhile(i<len(n)):\r\n if n[i]==\".\":\r\n s+=\"0\"\r\n i+=1\r\n elif n[i]==\"-\" and n[i+1]==\"-\":\r\n s+=\"2\"\r\n i+=2\r\n elif n[i]==\"-\"and n[i+1]==\".\":\r\n s+=\"1\"\r\n i+=2\r\nprint(s)\r\n\r\n\r\n", "x=input()\r\ny=''\r\nk=0\r\nwhile k<len(x):\r\n if x[k]=='.':\r\n y+='0'\r\n k+=1 \r\n elif x[k]=='-':\r\n if x[k+1]=='.':\r\n y+='1'\r\n k+=2 \r\n else:\r\n y+='2'\r\n k+=2 \r\nprint(y)", "us = input()\r\nres = us.replace('--', '2').replace('-.', '1').replace('.', '0')\r\nprint(res)", "n= input()\r\nlst = []\r\nflag = 1\r\n\r\nfor x in range(len(n)):\r\n \r\n if flag==0:\r\n flag = 1\r\n continue\r\n\r\n if(n[x]=='.'):\r\n lst.append('0')\r\n elif(n[x]=='-' and n[x+1]=='.'):\r\n lst.append('1')\r\n flag=0\r\n elif(n[x]=='-' and n[x+1]=='-'):\r\n lst.append('2')\r\n flag=0\r\n\r\nfor x in range(len(lst)):\r\n print(lst[x],end ='')", "n = list(input())\r\ns = ''\r\nfor i in range(len(n)-1):\r\n if n[i] == '-' and n[i+1] == '-':\r\n s += '2'\r\n n[i] = 0\r\n n[i+1] = 0\r\n elif n[i] == '-' and n[i + 1] == '.':\r\n s += '1'\r\n n[i] = 0\r\n n[i + 1] = 0\r\n elif n[i] == '.':\r\n s+='0'\r\n n[i] = 0\r\nif n[-1] == '.':\r\n s += '0'\r\nprint(s)\r\n", "n = list(input())\r\nl = len(n)\r\ni = 0\r\nwhile(i<l):\r\n if(n[i] == '.'):\r\n print(0,end = \"\")\r\n i += 1\r\n elif(n[i+1] == '.'):\r\n print(1,end = \"\")\r\n i += 2\r\n else:\r\n print(2,end = \"\")\r\n i += 2\r\nprint()\r\n", "s=list(input())\r\nl=len(s)\r\nif(l==1):\r\n print(0)\r\nelse:\r\n for j in range(l):\r\n if (s[j] == '.'):\r\n s[j] = '0'\r\n elif (j!=l-1 and s[j] == '-' and s[j + 1] == '.'):\r\n s[j] = '1'\r\n s[j+1]=''\r\n elif (j!=l-1 and s[j] == '-' and s[j + 1] == '-'):\r\n s[j] = '2'\r\n s[j+1]=''\r\n print(''.join(s))", "s = input()\nn = ''\nwhile len(s) > 0:\n if s[0] == '.':\n n += '0'\n s = s[1:]\n elif s[:2] == '-.':\n n += '1'\n s = s[2:]\n elif s[:2] == '--':\n n += '2'\n s = s[2:]\nprint(n)", "s1=input()\r\ns2=''\r\nx='.'\r\ny='-.'\r\nz='--'\r\na='0'\r\nb='1'\r\nc='2'\r\ni=0\r\nwhile i<len(s1):\r\n if(s1[i:i+2]==y):\r\n s2=s2+b\r\n i+=2\r\n elif(s1[i:i+2]==z):\r\n s2=s2+c\r\n i+=2\r\n elif(s1[i]==x):\r\n s2=s2+a\r\n i+=1\r\n else:\r\n i+=1\r\nprint(s2)", "s=input()\r\ni=0\r\nwhile i<len(s):\r\n if str(s[i:i+2])=='-.':\r\n print(1,end='')\r\n i+=2\r\n \r\n elif str(s[i:i+2])=='--':\r\n print(2,end='')\r\n i+=2\r\n \r\n elif s[i]=='.':\r\n print(0,end='')\r\n i+=1\r\n #print(i)\r\n", "from math import ceil\r\n\r\n\r\ndef main():\r\n\r\n trans = {\r\n \"--\" : \"2\",\r\n \"-.\" : \"1\",\r\n \".\" : \"0\",\r\n }\r\n \r\n code = input()\r\n res = \"\"\r\n\r\n ch = 0\r\n while ch < len(code):\r\n for key in trans:\r\n if code[ch:ch+len(key)] == key:\r\n ch += len(key)\r\n res += trans[key]\r\n\r\n print(res)\r\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() ", "b = list(input()) # b = .-.--.\r\nfinal = []\r\ni = 0\r\nwhile i < len(b):\r\n if b[i] == '.':\r\n final.append(0)\r\n\r\n elif b[i] == '-':\r\n if b[i + 1] == '.':\r\n final.append(1)\r\n\r\n i += 1\r\n elif b[i + 1] == '-':\r\n final.append(2)\r\n\r\n i += 1\r\n i += 1\r\n\r\ns = ''\r\nfor z in final:\r\n s += str(z)\r\nprint(s)\r\n", "# https://codeforces.com/problemset/problem/32/B\r\n\r\nnumber = list(input())\r\nanswer = ''\r\ni = 0\r\n\r\nwhile i < len( number ):\r\n if number[i] == '.':\r\n answer = answer + '0'\r\n elif number[i] + number[i+1] == '-.':\r\n answer = answer + '1'; i += 1\r\n elif number[i] + number[i+1] == '--':\r\n answer = answer + '2'; i += 1\r\n i += 1\r\n\r\nprint( answer )", "n = input()\r\nx=n.replace(\"--\",\"2\")\r\nn=x.replace(\"-.\",\"1\")\r\nx=n.replace(\".\",\"0\")\r\nprint(x)", "b = list(input())\r\niden = ''\r\nans = ''\r\nfor i in range(len(b)):\r\n iden += b[i]\r\n if iden == '.':\r\n ans += '0'\r\n iden = ''\r\n elif iden == '-.':\r\n ans += '1'\r\n iden = ''\r\n elif iden == '--':\r\n ans += '2'\r\n iden = ''\r\nprint(ans)", "s = str(input())\r\nc = 0\r\nl = []\r\nwhile c!=len(s):\r\n if s[c] == \".\":\r\n l.append(0)\r\n c+=1\r\n else:\r\n if s[c+1] == \"-\":\r\n l.append(2)\r\n else:\r\n l.append(1)\r\n c+=2\r\nfor i in l:\r\n print(i,end = \"\")", "n = input()\r\nn = list(n)\r\nans = \"\"\r\n\r\nwhile len(n)>0:\r\n if n[0] == \"-\" and n[1] == \"-\":\r\n ans += \"2\"\r\n n.pop(0)\r\n n.pop(0)\r\n elif n[0] == \"-\" and n[1] == \".\":\r\n ans += \"1\"\r\n n.pop(0)\r\n n.pop(0)\r\n elif n[0] == \".\":\r\n ans += \"0\"\r\n n.pop(0)\r\n \r\nprint(ans)", "borze_code = input()\r\ndecoded_number = []\r\n\r\ni = 0\r\nwhile i < len(borze_code):\r\n if borze_code[i] == '.':\r\n decoded_number.append('0')\r\n i += 1\r\n elif borze_code[i] == '-' and borze_code[i+1] == '.':\r\n decoded_number.append('1')\r\n i += 2\r\n elif borze_code[i] == '-' and borze_code[i+1] == '-':\r\n decoded_number.append('2')\r\n i += 2\r\nt=\"\".join(decoded_number)\r\nprint(t)", "n = input()\r\nj = 0\r\nwhile(j<len(n)):\r\n if n[j]==\".\":\r\n print(0, end = \"\")\r\n j+=1\r\n elif n[j]==\"-\" and n[j+1]==\".\":\r\n print(1, end = \"\")\r\n j+=2\r\n else:\r\n print(2, end = \"\")\r\n j+=2", "s = input()\r\nd = \"\"\r\nr = \"\"\r\nfor i in s:\r\n d = d + i;\r\n \r\n if d == \".\":\r\n r = r + \"0\"\r\n d = \"\"\r\n elif d == \"-.\":\r\n r = r + \"1\"\r\n d = \"\"\r\n elif d == \"--\":\r\n r = r + \"2\"\r\n d = \"\"\r\n\r\nprint(r)", "from sys import stdin\r\n\r\n#s=input()\r\ns=stdin.readline()\r\noneFlag=False\r\nresult=\"\"\r\nfor char in s:\r\n if(char == '.' and not oneFlag):\r\n result+='0'\r\n \r\n if(char == '-' and not oneFlag):\r\n oneFlag=True\r\n elif(oneFlag and char=='.'):\r\n oneFlag=False\r\n result+='1'\r\n elif(oneFlag and char == '-'):\r\n oneFlag=False\r\n result+='2'\r\nprint(result)\r\n ", "zero = \".\"\r\none = \"-.\"\r\ntwo = \"--\"\r\nstr1= input()\r\nresult = \"\"\r\ni=0\r\nwhile(True) : \r\n# print(i)\r\n if i == len(str1) :\r\n break \r\n if str1[i] == \".\" :\r\n result += \"0\"\r\n i+=1\r\n elif str1[i] == \"-\" :\r\n if str1[i+1] == \".\" :\r\n result += \"1\"\r\n if str1[i+1] == \"-\" :\r\n result += \"2\"\r\n i+=2\r\nprint(result)\r\n ", "inp = input()\r\n\r\nhelper = \"\"\r\nres = \"\"\r\nfor i in inp:\r\n if helper == \"\" and i == \".\":\r\n res+=\"0\"\r\n elif helper == \"\" and i== \"-\":\r\n helper=\"-\"\r\n elif helper == \"-\" and i==\"-\":\r\n res+=\"2\"\r\n helper = \"\"\r\n else:\r\n res+=\"1\"\r\n helper = \"\" \r\nprint(res) \r\n", "n = input()\r\ncalc = True\r\ndecod = []\r\n\r\nfor i in range(len(n)):\r\n if calc == True:\r\n if n[i:i+2] == \"--\":\r\n decod.append(\"2\")\r\n calc = False\r\n elif n[i:i+2] == \"-.\":\r\n decod.append(\"1\")\r\n calc = False\r\n else:\r\n decod.append(\"0\")\r\n else:\r\n calc = True\r\n \r\ndecod = \"\".join(decod)\r\nprint(decod)", "a = str(input())\r\nans = ''\r\nhaha = 0\r\nwhile haha <= len(a) - 1:\r\n if a[haha] == '.':\r\n ans += '0'\r\n haha += 1\r\n else:\r\n if a[haha + 1] == '.':\r\n ans += '1'\r\n haha += 2\r\n else:\r\n ans += '2'\r\n haha += 2\r\nprint(ans)", "s = input()\r\nvls = { '.': '0', '-.': '1', '--': '2' }\r\n\r\nx = r = ''\r\nfor c in s:\r\n x += c\r\n if x in vls:\r\n r += vls[x]\r\n x = ''\r\n\r\nprint(r)\r\n", "s = input()\r\n\r\ni = 0\r\nresult = \"\"\r\nwhile i < len(s):\r\n if s[i] == \".\":\r\n result += \"0\"\r\n i += 1\r\n continue\r\n elif s[i:i+2] == \"-.\":\r\n result += \"1\"\r\n elif s[i:i+2] == \"--\":\r\n result += \"2\"\r\n i += 2\r\n\r\nprint(result)", "import sys\r\nimport math\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\nfrom sys import stdin, stdout\r\n\r\n# for _ in range(int(stdin.readline())):\r\n#n, t = list(map(int, stdin.readline().split()))\r\ns = str(stdin.readline())\r\nn = len(s)\r\nans = ''\r\ni = 0\r\nwhile i < n - 1:\r\n if s[i] == '-':\r\n if s[i + 1] == '-':\r\n ans += '2'\r\n else:\r\n ans += '1'\r\n i += 2\r\n else:\r\n ans += '0'\r\n i += 1\r\nprint(ans)\r\n", "s = input()\r\ns = list(s)\r\na = \"\"\r\nwhile len(s) > 0:\r\n if s[0] == \".\":\r\n a += \"0\"\r\n s.remove(s[0])\r\n elif s[0] == \"-\" and s[1] == \".\":\r\n a += \"1\"\r\n s.remove(s[0])\r\n s.remove(s[0])\r\n elif s[0] == \"-\" and s[1] == \"-\":\r\n a += \"2\"\r\n s.remove(s[0])\r\n s.remove(s[0])\r\n\r\nprint(a)\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "s = input()\r\nn = len(s)\r\ni = 0\r\nk = []\r\nwhile i<n:\r\n if s[i] == \".\":\r\n k.append(\"0\")\r\n i += 1\r\n elif s[i]== \"-\" and s[i+1]== \".\":\r\n k.append(\"1\")\r\n i += 2\r\n else:\r\n k.append(\"2\")\r\n i +=2\r\n\r\nprint(\"\".join(k))\r\n \r\n", "DATA_LIST = ('.', '-.', '--')\r\n\r\nword = input()\r\n\r\nout = ''\r\nwhile word:\r\n for i, j in enumerate(DATA_LIST):\r\n if word.startswith(j):\r\n out += str(i)\r\n word = word[len(j):]\r\n\r\nprint(out)\r\n", "n = input()\nn = n.replace(\"--\", \"2\")\nn = n.replace(\"-.\", \"1\")\nn = n.replace(\".\", \"0\")\n\nprint(n)\n", "borze = input()\ndecode = \"\"\ni = 0\nwhile i < len(borze):\n if borze[i] == \".\":\n decode += \"0\"\n i += 1\n else:\n if i+1 < len(borze):\n if borze[i+1] == \".\":\n decode += \"1\"\n i += 2\n else:\n decode += \"2\"\n i += 2\nprint(decode)\n", "s=input()\r\nn=len(s)\r\ni=0\r\nans=[]\r\nwhile i<n:\r\n if s[i]=='.':\r\n ans.append('0')\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n ans.append('1')\r\n i+=2\r\n else:\r\n ans.append('2')\r\n i+=2\r\nprint(*ans,sep='')\r\n ", "s=input()\r\nn=len(s)\r\ni=0\r\nans=''\r\nwhile(i<n):\r\n if(s[i]=='.'):\r\n ans+='0'\r\n i+=1\r\n elif(s[i]+s[i+1]=='-.'):\r\n ans+='1'\r\n i+=2\r\n else:\r\n ans+='2'\r\n i+=2\r\nprint(ans)", "s = str(input())\r\nres = ''\r\ni=0\r\n\r\nwhile(i<len(s)-1):\r\n if(s[i]=='-' and s[i+1]=='-'):\r\n res+='2'\r\n i+=2\r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n res+='1'\r\n i+=2\r\n elif(s[i]=='.'):\r\n res+='0'\r\n i+=1\r\nif(i==len(s)-1 and s[i]=='.'):\r\n res+='0'\r\nprint(res)\r\n \r\n \r\n \r\n", "t = input()\r\ni=0\r\ns=''\r\nwhile(i<len(t)):\r\n if t[i]=='.':\r\n s+='0'\r\n i+=1\r\n elif t[i]+t[i+1]=='-.':\r\n s+='1'\r\n i+=2\r\n elif t[i]+t[i+1]=='--':\r\n s+='2'\r\n i+=2\r\nprint(s)", "list_iter = iter(input())\r\nfor i in list_iter:\r\n if i == \"-\":\r\n check = next(list_iter, None)\r\n print(2, end=\"\") if check == \"-\" else print(1, end=\"\")\r\n else:\r\n print(0, end=\"\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Dec 22 18:34:01 2018\r\n\r\n@author: asus\r\n\"\"\"\r\n\r\n#https://codeforces.com/problemset/problem/32/B\r\n\r\nch=input()\r\ns=\"\"\r\nwhile len(ch)>0:\r\n if ch[0]=='-' :\r\n if ch[1]=='-' :\r\n s+=\"2\"\r\n ch=ch[2:]\r\n elif ch[1]=='.' :\r\n s+=\"1\"\r\n ch=ch[2:]\r\n else:\r\n s+=\"0\"\r\n ch=ch[1:]\r\n \r\nprint (s)", "c=None\r\nfor i in input():\r\n if i=='.' and c==None:\r\n print('0',end='')\r\n elif i=='-' and c==None:\r\n c='-'\r\n elif i=='-' and c=='-':\r\n print('2',end='')\r\n c=None\r\n elif i=='.' and c=='-':\r\n print('1',end='')\r\n c=None", "n=input()\r\ni=0\r\nwhile(i<len(n)):\r\n if(n[i]==\".\"):\r\n print(0,end=\"\")\r\n if(n[i]==\"-\"):\r\n if(n[i+1]==\".\"):\r\n print(1,end=\"\")\r\n else:\r\n print(2,end=\"\")\r\n i+=1\r\n i+=1\r\n", "# for _ in range(int(input())):\r\nword = input()\r\nword = word.replace(\"--\", \"2\")\r\nword = word.replace(\"-.\", \"1\")\r\nword = word.replace(\".\", \"0\")\r\n\r\nprint(word)\r\n", "string=input()\r\nresult=''\r\ni=0\r\nwhile(i <=len(string)-1):\r\n if string[i]=='-'and string[i+1]=='-':\r\n result+='2'\r\n i+=2\r\n elif string[i]=='-' and string[i+1]=='.':\r\n result+='1'\r\n i+=2\r\n elif string[i]=='.':\r\n result+='0'\r\n i+=1\r\nprint(result) \r\n \r\n \r\n \r\n ", "string = input()\r\narr = []\r\narr[:0] = string\r\nnumber = []\r\ni = 0\r\nwhile (len(arr)!=i):\r\n if(arr[i]=='.'):\r\n number.append('0')\r\n i+=1\r\n elif(arr[i]=='-'):\r\n if(arr[i+1]=='.'):\r\n number.append('1')\r\n i+=2\r\n elif(arr[i+1]=='-'):\r\n number.append('2')\r\n i+=2\r\nprint(\"\".join(str(i) for i in number))", "s = input()\nn = len(s)\ni = 0\n\nres = ''\nwhile i < n:\n\tif s[i] == '.':\n\t\tres += '0'\n\t\ti += 1\n\telse:\n\t\tres += '1' if s[i + 1] == '.' else '2'\n\t\ti += 2\n\t\t\nprint(res)\n", "s=input()\r\nres=\"\"\r\nj, n=0, len(s)\r\nwhile j<n:\r\n if s[j]==\".\":\r\n res+=\"0\"\r\n j+=1\r\n elif s[j:j+2]==\"-.\":\r\n res+=\"1\"\r\n j+=2\r\n else:\r\n res+=\"2\"\r\n j+=2\r\nprint(res)", "b=input()\r\nb0=list(b)\r\nb0.append(\"en\")\r\ni=0\r\nwhile i<len(b) :\r\n if b0[i]==\".\" :\r\n print(0,end=\"\")\r\n i+=1\r\n if b0[i]==\"-\" and b0[i+1]==\".\" :\r\n print(1,end=\"\")\r\n i+=2\r\n if b0[i]==\"-\" and b0[i+1]==\"-\" :\r\n print(2,end=\"\")\r\n i+=2", "dat = input()\r\nresult = ''\r\ni = 0\r\nwhile (i<len(dat)):\r\n if dat[i] == '.':\r\n result += '0'\r\n i +=1\r\n elif dat[i] == '-':\r\n if dat[i+1] == '.':\r\n result += '1'\r\n else:\r\n result += '2'\r\n i += 2\r\nprint(result)", "n = input()\r\ni = 0\r\nl = []\r\nwhile(i<len(n)):\r\n if(n[i] == \"-\" and n[i+1]== \"-\"):\r\n l.append(\"2\")\r\n i+=2\r\n elif(n[i] == \"-\" and n[i+1] == \".\"):\r\n l.append(\"1\")\r\n i+=2\r\n else:\r\n l.append(\"0\")\r\n i+=1\r\nans = \"\".join(l)\r\nprint(ans)", "borze, i, res = input(), 0, []\r\nwhile i < len(borze):\r\n if borze[i] == '.':\r\n res.append('0')\r\n i += 1\r\n elif borze[i] == '-':\r\n res.append('1' if borze[i + 1] == '.' else '2')\r\n i += 2\r\nprint(\"\".join(res))", "arr = [a for a in input()]\r\nans = ''\r\n\r\nwhile len(arr) != 0:\r\n\tvar = 0\r\n\tif arr[0] == '.':\r\n\t\tans += '0'\r\n\t\tarr.pop(0)\r\n\t\tvar = 1\r\n\tif len(arr) >= 2 and var == 0:\r\n\t\tif arr[0] == '-' and arr[1] == '.':\r\n\t\t\tans += '1'\r\n\t\t\tarr.pop(0)\r\n\t\t\tarr.pop(0)\r\n\r\n\t\telif arr[0] == '-' and arr[1] == '-':\r\n\t\t\tans += '2'\r\n\t\t\tarr.pop(0)\r\n\t\t\tarr.pop(0)\r\n\t# print(arr)\r\n\r\n\r\nprint(ans)\r\n", "s = str(input())\r\ns = list(s)\r\n\r\narr = []\r\n\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == \"-\":\r\n to_send = s[i] + s[i + 1]\r\n arr.append(to_send)\r\n i += 1\r\n else:\r\n arr.append(s[i])\r\n i += 1\r\n\r\nfor i in arr:\r\n if i == \".\":\r\n print(0, end=\"\")\r\n elif i == \"-.\":\r\n print(1, end=\"\")\r\n elif i == \"--\":\r\n print(2, end=\"\")\r\n", "a=str(input())\r\nb=len(a)\r\ni=0\r\ncount=''\r\nwhile(i<(b)):\r\n if(a[i]=='.'):\r\n count+='0'\r\n i+=1\r\n elif(a[i]=='-' and a[i+1]=='.'):\r\n count+='1'\r\n i+=2\r\n else:\r\n if(a[i]=='-' and a[i+1]=='-'):\r\n count+='2'\r\n i+=2\r\nprint(count)\r\n", "s = input()\r\na = \"\"\r\ni = 0\r\nwhile i<len(s):\r\n if i == len(s)-1 and s[i] == \".\":\r\n a += \"0\"\r\n i += 1\r\n else:\r\n if s[i] == \"-\":\r\n if (i+1)>=len(s):\r\n break\r\n elif s[i+1] == \".\":\r\n a += \"1\"\r\n else:\r\n a += \"2\"\r\n i += 2\r\n else:\r\n a += \"0\"\r\n i += 1\r\nprint(a)", "strr = list(input())\r\ncode = ''\r\ni = 0\r\nwhile i < len(strr):\r\n if strr[i] == '-' and strr[i+1] == '.':\r\n code += '1'\r\n i+=2\r\n elif strr[i] == '-' and strr[i+1] == '-':\r\n code += '2'\r\n i+=2\r\n else:\r\n code += '0'\r\n i+=1\r\nprint(code)", "str1 = input()\r\nstr1 = str1.replace(\"--\",\"2\")\r\nstr1 = str1.replace(\"-.\",\"1\")\r\nstr1 = str1.replace(\".\",\"0\")\r\nprint(str1)", "s=input()\r\ni=0\r\nn=len(s)\r\nr=\"\"\r\nwhile i<n:\r\n if s[i]=='.':\r\n r+='0'\r\n i+=1\r\n elif s[i]=='-' and i+1<n:\r\n if s[i+1]=='.':\r\n r+='1'\r\n elif s[i+1]=='-':\r\n r+='2'\r\n i+=2\r\nprint(r)", "s = input()\np = ''\nout = ''\nfor i in s:\n if i == '.':\n if p == '':\n out+='0'\n elif p == '-':\n out+='1'\n p=''\n else:\n if p == '':\n p=i\n else:\n out+='2'\n p=''\nprint(out)", "a = input()\r\n\r\ndouble = False\r\nfor i in range(len(a)):\r\n if double:\r\n double = False\r\n continue\r\n if a[i] == \".\":\r\n print(0, end=\"\")\r\n elif a[i: i+2] == \"-.\":\r\n print(1, end=\"\")\r\n double = True\r\n else:\r\n print(2, end=\"\")\r\n double = True", "s = str(input())\nans = []\ni = 0\nwhile i < len(s):\n if s[i] == \".\":\n ans.append(0)\n i += 1\n elif s[i] == \"-\":\n if s[i+1] == \".\":\n ans.append(1)\n i += 2\n elif s[i+1] == \"-\":\n ans.append(2)\n i += 2\nfor j in range(len(ans)):\n print(ans[j] ,end = \"\")", "s = input()\r\ni = 0\r\nn = len(s)\r\na = ''\r\nwhile i<n:\r\n if s[i]=='.':\r\n a+='0'\r\n i+=1\r\n else:\r\n if s[i+1]=='.':\r\n a+='1'\r\n i+=2\r\n else:\r\n a+='2'\r\n i+=2\r\n \r\nprint(a)\r\n ", "n=input()\r\ni=0\r\nx=str()\r\n\r\nwhile(len(n)!=i):\r\n if(n[i]==\".\"):\r\n x=x+\"0\"\r\n i=i+1\r\n elif(n[i]==\"-\"):\r\n if(n[i+1]==\"-\"):\r\n x=x+\"2\"\r\n i=i+2 \r\n elif(n[i+1]==\".\"):\r\n x=x+\"1\"\r\n i=i+2 \r\nprint(x) ", "code = input()\r\nanswer = \"\"\r\n\r\ni = 0\r\n\r\nwhile i<=len(code)-1:\r\n if code[i\r\n ] == \".\":\r\n answer += \"0\"\r\n i+=1\r\n\r\n elif code[i] == \"-\":\r\n if code[i+1] == \".\":\r\n answer+= \"1\"\r\n i+=2\r\n else:\r\n answer += \"2\"\r\n i+=2\r\n \r\n\r\nprint(answer)\r\n\r\n \r\n \r\n", "a = input()\r\ni=len(a)\r\nwhile i!=0:\r\n if a[0]=='.':\r\n print(0,end='')\r\n a=a[1:]\r\n elif a[0]+a[1]=='--':\r\n print(2,end='')\r\n a=a[2:]\r\n elif a[0]+a[1]=='-.':\r\n print(1,end='')\r\n a=a[2:]\r\n i=len(a)", "import math\r\nimport itertools\r\nfrom collections import Counter\r\nfrom heapq import *\r\n\r\nlis = lambda: list(map(int, input().split()))\r\nmapnum = lambda: map(int, input().split())\r\nnum = lambda: int(input())\r\nstrlis = lambda: input().split()\r\n\r\n\r\ns = input()\r\nn = len(s)\r\ni = 0\r\nans = \"\"\r\nwhile i<n:\r\n if s[i] == '.':\r\n ans += '0'\r\n elif i+1 < n:\r\n if s[i+1] == '.':\r\n ans += '1'\r\n else:\r\n ans += '2'\r\n i += 1\r\n i += 1\r\nprint(ans)", "from math import *\r\ntt=1\r\nb=\"\"\r\nwhile tt>0 :\r\n tt=tt-1\r\n a=(input())\r\n k=0\r\n i=0\r\n while i< len(a) :\r\n if a[i]=='.' :\r\n b+='0'\r\n i=i+1\r\n elif i+1<len(a) and a[i]=='-' and a[i+1]=='.' :\r\n b+='1'\r\n i+=2\r\n elif i + 1 < len(a) and a[i] == '-' and a[i + 1] == '-':\r\n b += '2'\r\n i += 2\r\n print(b)", "n = input()\r\ni = 0\r\nlenn = len(n)\r\nfinal = ''\r\n\r\nwhile i < lenn:\r\n if n[i] == '.':\r\n final += '0'\r\n i += 1\r\n else:\r\n if n[i+1] == '.':\r\n final += '1'\r\n else:\r\n final += '2'\r\n i += 2\r\n\r\nprint(final)\r\n", "\r\n\r\ndef main():\r\n\r\n s = [i for i in input()]\r\n\r\n i = 0\r\n a = []\r\n while i <= len(s) - 1:\r\n if i <= len(s) - 2 and s[i] == '-' and (s[i + 1] == '.'):\r\n a.append(1)\r\n i += 2\r\n elif i <= len(s) - 2 and s[i] == '-' and (s[i + 1] == '-'):\r\n a.append(2)\r\n i += 2\r\n elif s[i] == '.':\r\n a.append(0)\r\n i += 1\r\n\r\n print (''.join(map(str,a)))\r\n\r\n\r\n\r\n\r\nmain()", "s = input()\r\ndigit = 0\r\ni=0\r\nans=''\r\nwhile i<(len(s)):\r\n if s[i]==\"-\" and s[i+1]==\"-\":\r\n ans=ans+\"2\"\r\n i+=2\r\n\r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n ans=ans+\"1\"\r\n i+=2\r\n\r\n elif s[i]==\".\":\r\n ans=ans+\"0\"\r\n i+=1\r\n\r\n\r\nprint(ans)\r\n\r\n ", "n = input()\r\nborze = ['.', '-']\r\nn = [x for x in n]\r\ntemp = []\r\nfinal = \"\"\r\ni = 0\r\nwhile len(n) >= 1:\r\n ans = \"\"\r\n j = i + 1\r\n if n[i] == '-' and n[j] == '.':\r\n ans += \"-.\"\r\n temp.append(ans)\r\n n.remove(n[0])\r\n n.remove(n[0])\r\n elif n[i] == '-' and n[j] == '-':\r\n ans += \"--\"\r\n temp.append(ans)\r\n n.remove(n[0])\r\n n.remove(n[0])\r\n elif len(n) == 1 and n[0] == '.':\r\n ans += '.'\r\n temp.append(ans)\r\n n.remove(n[0])\r\n else:\r\n ans += '.'\r\n temp.append(ans)\r\n n.remove(n[0])\r\nfor i in temp:\r\n if i == \".\":\r\n final += '0'\r\n elif i == \"-.\":\r\n final += '1'\r\n elif i == \"--\":\r\n final += '2'\r\nprint(final)", "from sys import stdin\ninput = stdin.readline\n\ncode = input()\n# for cur,peek in zip(code,code[1:]):\n# for i,cur in enumerate(code[:-1]):\ni = 0\nwhile i < len(code)-1:\n cur = code[i]\n if cur == '.':\n print(0,end=\"\")\n i += 1\n else:\n peek = code[i+1]\n if peek == '.':\n print(1,end=\"\")\n else:\n print(2,end=\"\")\n i += 2\nprint()", "n = list(input())\r\nrep=''\r\nt =0\r\nwhile t<len(n):\r\n if n[t]=='.':\r\n rep+='0'\r\n t+=1\r\n elif n[t]=='-'and n[t+1]=='.':\r\n rep+='1'\r\n t+=2\r\n elif n[t]=='-' and n[t+1]=='-':\r\n rep+='2'\r\n t+=2\r\nprint(rep)", "str1 = input(\"\")\r\nn = len(str1)\r\nnum = ''\r\ni = 0\r\nwhile i<n:\r\n if str1[i]=='.':\r\n num += '0'\r\n i += 1\r\n else:\r\n if str1[i+1]=='.':\r\n num += '1'\r\n i += 2\r\n else:\r\n num += '2'\r\n i += 2\r\nprint(num)\r\n", "s = input()\r\n\r\nprint(s.replace('--', '2')\r\n \t .replace('-.', '1')\r\n \t .replace('.', '0'))\r\n", "\n'''n=int(input(\"\"))\nsumx=0\nsumy=0\nsumz=0\nfor i in range(n):\n f=input(\"\")\n F=f.split()\n sumx+=int(F[0])\n sumy+=int(F[1])\n sumz+=int(F[2])\nif sumx==0 and sumy==0 and sumz==0:\n print(\"YES\")\nelse:\n print(\"NO\")'''\n\n'''L=[0,0,0,0,0]\nfor i in range(5):\n l=input(\"\")\n L[i]=l.split()\n\ni_sus=0\nj_sus=0\nfor i in range(5):\n for j in range(5):\n if int(L[i][j])==1:\n i_sus = i+1\n j_sus = j+1\nprint(abs(i_sus-3)+abs(j_sus-3))'''\n\ns=input(\"\")\nstring=''\nS=list()\nfor i in range(len(s)):\n S.append(s[i])\nc=0\nwhile c<len(S):\n if S[c]=='.':\n string+='0'\n c=c+1\n elif S[c]=='-':\n if S[c+1]=='.':\n string+='1'\n else:\n string+='2'\n c=c+2\nprint(string)\n\n \n \n \n", "n=list(input())\r\nq=\"\"\r\nfor i in n:\r\n if i==\".\":\r\n a=n.index(\".\");n[a]=\"v\";q+=\"0\"\r\n elif i==\"-\" and n[n.index(\"-\")+1]==\".\":\r\n a=n.index(\"-\");n[a]=\"v\" ; n[a+1]=\"v\";q+=\"1\"\r\n elif i==\"-\" and n[n.index(\"-\")+1]==\"-\":\r\n a=n.index(\"-\");n[a]=\"v\" ; n[a+1]=\"v\";q+=\"2\"\r\nprint(q)", "a = input()\ns = ''\nf = 0\nfor i in range(len(a)):\n if f == 1:\n f = 0\n continue\n if f == 0:\n if a[i] == '.':\n s += '0'\n if a[i] == '-' and a[i+1] == '.':\n s += '1'\n f = 1\n continue\n if a[i] == '-' and a[i + 1] == '-':\n s += '2'\n f = 1\n continue\n\nprint(s)\n", "ilp=input()\r\ni=0;c=\"\"\r\nwhile(i<len(ilp)):\r\n if ilp[i]==\".\":\r\n i+=1\r\n c=c+\"0\"\r\n elif ilp[i]==\"-\":\r\n if ilp[i+1]==\".\":\r\n c=c+\"1\"\r\n elif ilp[i+1]==\"-\":\r\n c=c+\"2\"\r\n i+=2\r\nprint(c) ", "a = input()\ni = 0\nwhile(i < len(a)):\n if(a[i] == \"-\" and a[i + 1] == \"-\"):\n i += 1\n print(2, end = \"\")\n elif(a[i] == \"-\" and a[i + 1] == \".\"):\n i += 1\n print(1, end = \"\")\n elif(a[i] == \".\"):\n print(0, end = \"\")\n i += 1\n# Sun Jun 27 2021 08:01:22 GMT+0300 (Москва, стандартное время)\n", "n = input()\nm =len(n)\na =[]\na =n\nl =\"\"\ni =0\nwhile(i <m):\n\tif a[i] ==\"-\" and a[i+1] =='.':\n\t\ti+=2\n\t\tl +='1'\n\telif a[i] ==\"-\" and a[i+1] ==\"-\":\t\n\t\ti +=2\n\t\tl +='2'\n\telse:\n\t\ti +=1\n\t\tl +='0'\nprint(l)", "s = list(map(str, input()))\r\nans = []\r\ncounter = 0\r\nwhile counter < len(s):\r\n if s[counter] == \".\":\r\n ans.append(\"0\")\r\n s.pop(counter)\r\n elif s[counter] == \"-\" and s[counter + 1] == \".\":\r\n ans.append(\"1\")\r\n s.pop(counter)\r\n s.pop(counter)\r\n elif s[counter] == \"-\" and s[counter + 1] == \"-\":\r\n ans.append(\"2\")\r\n s.pop(counter)\r\n s.pop(counter)\r\n\r\nprint(\"\".join(ans))", "S=str.startswith\r\ndef f(s):\r\n r=''\r\n if S(s,'.'):r='0'+f(s[1:])\r\n if S(s,'-.'):r='1'+f(s[2:])\r\n if S(s,'--'):r='2'+f(s[2:])\r\n return r\r\nprint(f(input()))", "import io, os, sys\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\ndef solve():\r\n s = input().strip().decode()\r\n sol = {'.': 0, '-.':1, '--': 2}\r\n ans = []\r\n while s:\r\n if s[:1] in sol:\r\n ans.append(sol[s[:1]])\r\n s = s[1:]\r\n else:\r\n ans.append(sol[s[:2]])\r\n s = s[2:]\r\n\r\n ans = ''.join(str(x) for x in ans)\r\n sys.stdout.write(f'{ans}\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "a = str(input())\r\nlst1 = []\r\nfor symbol in a:\r\n lst1.append(symbol)\r\nb = len(lst1)\r\n\r\nlst2 = []\r\nj=0\r\nwhile j<b:\r\n if lst1[j] == '.':\r\n lst2.append(\"0\")\r\n j = j + 1\r\n elif lst1[j] == '-' and lst1[j+1] == '.':\r\n lst2.append(\"1\")\r\n j = j+2\r\n elif lst1[j] == '-' and lst1[j+1] == '-':\r\n lst2.append(\"2\")\r\n j = j+2\r\n else:\r\n print('invalid')\r\n \r\nprint(''.join(lst2))", "str = input()\r\nval = \"\"\r\ni = 0\r\nwhile(i<len(str)):\r\n if str[i] == '.':\r\n val+='0'\r\n if str[i] == '-' and str[i+1] == '.':\r\n val+='1'\r\n i+=1\r\n if str[i] == '-' and str[i+1] == '-':\r\n val+='2'\r\n i+=1\r\n i+=1\r\nprint(val)", "n = input()\nm = len(n)\nt = \"\"\ni = 0 \nwhile i<m :\n if n[i]=='.':\n t += \"0\"\n i+=1 \n elif n[i:i+2]=='-.':\n t += \"1\"\n i+=2\n elif n[i:i+2]=='--':\n t+=\"2\"\n i+=2 \nprint(t)", "def Convert(string):\r\n list1=[]\r\n list1[:0]=string\r\n return list1\r\n\r\na = input()\r\na = Convert(a)\r\n\r\nl = len(a)\r\nnum = []\r\ni = 0\r\nwhile (i < l):\r\n\r\n if (a[i] == \".\"):\r\n num.append(\"0\")\r\n i=i+1\r\n else:\r\n if(a[i+1] == \".\"):\r\n num.append(\"1\")\r\n i=i+2\r\n else:\r\n num.append(\"2\")\r\n i=i+2\r\n\r\nnum = ''.join(num)\r\nprint(num)", "s = input()\r\nl =[]\r\ni=0\r\nwhile i<len(s):\r\n if s[i] == '.':\r\n l.append('0')\r\n i += 1\r\n continue\r\n if s[i] == '-' and s[i+1] == '.':\r\n l.append('1')\r\n i += 2\r\n continue\r\n if s[i] == '-' and s[i+1] == '-':\r\n l.append('2')\r\n i += 2\r\n continue\r\nl = ''.join(l)\r\nprint(l)", "import bisect\r\nimport os\r\nimport io\r\nfrom collections import Counter\r\nfrom collections import defaultdict\r\nimport math\r\nimport random\r\nimport heapq as hq\r\nfrom math import sqrt\r\nimport sys\r\nfrom functools import reduce\r\nfrom collections import deque\r\nimport threading\r\n\r\n# sys.setrecursionlimit(2000000)\r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef iinput():\r\n return int(input())\r\n\r\n\r\ndef tinput():\r\n return input().split()\r\n\r\n\r\ndef rinput():\r\n return map(int, tinput())\r\n\r\n\r\ndef rlinput():\r\n return list(rinput())\r\n\r\n\r\nmod = int(1e9)+7\r\n\r\n\r\ndef factors(n):\r\n return set(reduce(list.__add__,\r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\r\n\r\n\r\n# ----------------------------------------------------\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n s=input()\r\n s=s.replace('--','2')\r\n s=s.replace('-.','1')\r\n s=s.replace('.','0')\r\n print(s)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 7 20:23:23 2020\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\n\r\ncode = input()\r\n\r\ni = 0\r\nanswer = ''\r\nwhile i < len(code):\r\n if code[i] == '.':\r\n answer += '0'\r\n i += 1\r\n elif code[i:i+2] == '-.':\r\n answer += '1'\r\n i += 2\r\n else:\r\n answer += '2'\r\n i += 2\r\n\r\nprint(answer)", "# your code goes here\r\n\r\ndef decode(s):\r\n if '--' in s:\r\n s = s.replace('--', '2')\r\n if '-.' in s:\r\n s = s.replace('-.', '1')\r\n if '.' in s:\r\n s = s.replace('.', '0')\r\n return s\r\n \r\nif __name__ == \"__main__\":\r\n s = input()\r\n print(decode(s))", "code = input()\r\n\r\ndef decode(code):\r\n i = 0\r\n ans = ''\r\n while i < len(code):\r\n if code[i] == '.':\r\n ans += '0'\r\n i += 1\r\n elif code[i:i+2] == '-.':\r\n ans += '1'\r\n i += 2\r\n elif code[i:i+2] == '--':\r\n ans += '2'\r\n i += 2\r\n return ans\r\n\r\nprint(decode(code))", "encoded_string = input()\n\ndef zero(encoded_string):\n encoded_string = encoded_string.replace('.', '0')\n return encoded_string \n\ndef one(encoded_string):\n encoded_string = encoded_string.replace('-.', '1')\n return encoded_string\n\ndef two(encoded_string):\n encoded_string = encoded_string.replace('--', '2')\n return encoded_string\n\nencoded_string = two(encoded_string)\nencoded_string = one(encoded_string)\nencoded_string = zero(encoded_string)\n\nprint(encoded_string)", "a = [i for i in input()]\r\np = \"\"\r\nfor j in range(len(a)):\r\n if a[j] == \"0\":\r\n continue\r\n if a[j] == \".\":\r\n a[j] = \"0\"\r\n p += \"0\"\r\n else:\r\n if a[j+1] == \".\":\r\n a[j], a[j+1] = \"0\", \"0\"\r\n p+=\"1\"\r\n else:\r\n a[j], a[j+1] = \"0\", \"0\"\r\n p+=\"2\"\r\nprint(p)\r\n", "n=input()\r\ni=0\r\na=''\r\nwhile i < len(n):\r\n if n[i]=='.':\r\n a+='0'\r\n elif n[i]=='-' and n[i+1]=='.':\r\n a+='1'\r\n i+=1\r\n elif n[i]=='-' and n[i+1]=='-':\r\n a+='2'\r\n i+=1\r\n i+=1\r\nprint(a)\r\n", "def main():\n s = list(input())\n k = \"\"\n z = 0\n for i in range(len(s)):\n i += z\n if i < len(s):\n if s[i] == '.':\n k += '0'\n else:\n if s[i] == '-' and s[i + 1] == '-':\n k += '2'\n z += 1\n else:\n k += '1'\n z += 1\n print(k)\n\nif __name__ == '__main__':\n main()", "word = input()\r\nword = word.replace(\"--\", \"2\")\r\nword = word.replace(\"-.\", \"1\")\r\nword = word.replace(\".\", \"0\")\r\nprint(word)", "code = input()\r\n\r\nz = '.'\r\no = '-.'\r\nt = '--'\r\n\r\ncode = code.replace(t, '2')\r\ncode = code.replace(o, '1')\r\ncode = code.replace(z, '0')\r\n\r\nprint(code)", "s = input()\r\n\r\nn = ''\r\n\r\ni = 0\r\nj = 1\r\n\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n n += '0'\r\n i += 1\r\n j += 1\r\n elif s[i] == '-' and s[j] == '.':\r\n n += '1'\r\n i += 2\r\n j += 2\r\n elif s[i] == '-' and s[j] == '-':\r\n n += '2'\r\n i += 2\r\n j += 2\r\n\r\nprint(n)", "a=list(input())\r\ni=0\r\nwhile i<=len(a)-1:\r\n if a[i]==\".\":\r\n print(0,end=\"\")\r\n i=i+1\r\n else:\r\n if a[i+1]==\".\":\r\n print(1,end=\"\")\r\n else:\r\n print(2,end=\"\")\r\n i=i+2", "b = input()\r\nsan = \"\"\r\ni = 0\r\nwhile i < len(b):\r\n if b[i] == \".\":\r\n san += \"0\"\r\n elif b[i] == \"-\":\r\n if b[i + 1] == \".\":\r\n san += \"1\"\r\n else:\r\n san += \"2\"\r\n i += 1\r\n i += 1\r\nprint(san)", "str = input()\r\n\r\nans = str.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\nprint(ans)\r\n", "n=input()\r\ni=0\r\nst=''\r\nwhile(i<len(n)):\r\n if n[i]=='.':\r\n st+='0'\r\n i+=1\r\n elif n[i]=='-' and n[i+1]=='.':\r\n st+='1'\r\n i+=2\r\n elif n[i]=='-' and n[i+1]=='-':\r\n st+='2'\r\n i+=2\r\nprint(st)\r\n \r\n", "t = input()\r\nfin = \"\"\r\nskip = False\r\nfor i in range(len(t)):\r\n if skip:\r\n skip = False\r\n continue\r\n if t[i] == \".\":\r\n fin+= \"0\"\r\n elif t[i]+t[i+1] == \"--\":\r\n fin+= \"2\"\r\n skip = True\r\n elif t[i]+t[i+1] == \"-.\":\r\n fin+= \"1\"\r\n skip = True\r\nprint(fin)", "l=list(input());ans,s='',0\r\nwhile 1>0:\r\n if len(l)<=0:break\r\n if l[0]=='.':ans+='0';del l[s]\r\n elif l[1]=='.':ans+='1';del l[0];del l[0]\r\n else:ans+='2';del l[0];del l[0]\r\nprint(ans)", "s = input()\r\ns = s + ' '\r\nres = ''\r\ni = 0\r\nwhile i < len(s) - 1:\r\n if s[i] == '-' and s[i + 1] == '-':\r\n res = res + '2'\r\n i += 2\r\n elif s[i] == '-' and s[i + 1] == '.':\r\n res = res + '1'\r\n i += 2\r\n else:\r\n res = res + '0'\r\n i += 1\r\nprint(res)\r\n", "inp,output,i = input(),\"\",0\r\nwhile i < len(inp):\r\n if inp[i] == \".\" :\r\n i = i+1\r\n output = output + \"0\"\r\n elif inp[i] == \"-\":\r\n if inp[i+1] == \".\":\r\n i = i+2\r\n output = output + \"1\"\r\n n = True\r\n elif inp[i+1] == \"-\":\r\n i = i+2\r\n output = output + \"2\"\r\n n = True\r\n else :\r\n pass\r\n else :\r\n pass\r\n\r\nprint(output)\r\n ", "s = input()\r\ni = 0\r\nwhile True:\r\n if i + 1 < len(s):\r\n if s[i]+s[i+1] == '--':\r\n print(2, end='')\r\n i += 2\r\n if i == len(s):\r\n break\r\n if i + 1 < len(s):\r\n if s[i] + s[i+1] == '-.':\r\n print(1, end='')\r\n i += 2\r\n if i == len(s):\r\n break\r\n if s[i] == '.':\r\n print(0, end='')\r\n i += 1\r\n if i == len(s):\r\n break", "from sys import stdin\r\n\r\n#for _ in range(int(stdin.readline())):\r\n# n, k = list(int(i) for i in stdin.readline().split(\" \"))\r\n\r\na = stdin.readline().strip()\r\ns = \"\"\r\ni = 0\r\nwhile i<len(a):\r\n \r\n if a[i]==\".\":\r\n s += \"0\"\r\n i += 1\r\n else:\r\n if a[i+1]==\".\":\r\n s += \"1\"\r\n else:\r\n s += \"2\"\r\n i += 2\r\nprint(s)", "def Borze():\r\n string = input()\r\n string = string.replace('--','2')\r\n string = string.replace('-.','1')\r\n string = string.replace('.','0')\r\n return string\r\n\r\n\r\n\r\nprint(Borze())\r\n\r\n", "s=input()\nres=''\ni=0\nwhile i<len(s):\n if s[i]=='.':\n res+='0'\n i+=1\n else:\n if s[i+1]=='.':\n res+='1'\n else:\n res+='2'\n i+=2\nprint(res)\n", "code = input()\r\n\r\nlength = len(code)\r\n\r\nindex = 0\r\ndecode = \"\"\r\n\r\nwhile (index < length):\r\n if code[index] == \".\":\r\n decode += \"0\"\r\n index += 1\r\n elif code[index] == \"-\" and code[index+1] == \".\":\r\n decode += \"1\"\r\n index += 2\r\n elif code[index] == \"-\" and code[index+1] == \"-\":\r\n decode += \"2\"\r\n index += 2\r\n\r\nprint(decode)\r\n ", "code = input()\r\nres = \"\"\r\ni = 0\r\nwhile i < len(code):\r\n if code[i] == \".\":\r\n i += 1\r\n res += \"0\"\r\n else:\r\n if code[i+1] == \".\":\r\n res += \"1\"\r\n else:\r\n res += \"2\"\r\n i += 2\r\nprint(res)", "s = input()\nsN = [];\ni=0\nwhile i<len(s):\n if (s[i]=='.'):\n sN.append('0')\n i+=1\n elif (s[i:i+2]=='-.'):\n sN.append('1')\n i+=2\n elif (s[i:i+2]=='--'):\n sN.append('2')\n i+=2\n\nprint(''.join(str(e) for e in sN))\n", "t = input()\ni = 0\ns = ''\n\nwhile i < len(t):\n if t[i] == '.':\n s += '0'\n i += 1\n elif t[i] == '-' and t[i+1] == '-':\n s += '2'\n i += 2\n else:\n s += '1'\n i += 2\n\nprint(s)", "s = input()\nx = 0\nwhile (x < len(s)):\n if s[x] == '.':\n print(0, end='')\n x += 1\n continue\n if s[x:x+2] == '-.':\n print(1, end='')\n x += 2\n continue\n if s[x:x+2] == '--':\n print(2, end='')\n x += 2", "w = list(input())\r\n\r\nd = []\r\nwhile len(w) >= 1:\r\n\r\n if w[0] == '-' and w[1] == '.':\r\n d.append(1)\r\n del w[0:2]\r\n\r\n elif w[0] == '-' and w[1] == '-':\r\n d.append(2)\r\n del w[0:2]\r\n\r\n elif w[0] == '.':\r\n d.append(0)\r\n del w[0]\r\n\r\nprint(*d, sep='')", "\"\"\"\n. = 0\n-. = 1\n-- = 2\n\"\"\"\nl = input()\nfinal=\"\"\ni=0\nwhile i<=(len(l)-1):\n if l[i] == \"-\":\n if l[i+1] == \".\":\n final+=\"1\"\n elif l[i+1] == \"-\":\n final+=\"2\"\n i+=2\n elif l[i] == \".\":\n final+=\"0\"\n i+=1\n\nprint(final)", "t = input()\nans = \"\"\ncount = 0\n\nfor i in range(len(t)):\n\tif count == 0:\n\t\tif t[i] == '.':\n\t\t\tans += '0'\n\t\telif t[i] == '-':\n\t\t\tif t[i+1] == '.':\n\t\t\t\tans += '1'\n\t\t\t\tcount += 1\n\t\t\telif t[i+1] == '-':\n\t\t\t\tans += '2'\n\t\t\t\tcount += 1\n\telse:\n\t\tcount = 0\n\nprint(ans)", "import re\r\ns = input()\r\ns = re.sub('--','2',s)\r\n# print(s,1)\r\ns = re.sub('-.','1',s)\r\n# print(s,2)\r\ns = '0'.join(s.split('.'))\r\nprint(s)\r\n", "s=input()\r\nans=''\r\ni=0\r\nwhile (i<len(s)):\r\n if (s[i]=='.'):\r\n ans=ans+'0'\r\n i+=1\r\n elif (s[i]=='-'):\r\n if (s[i+1]=='.'):\r\n ans=ans+'1'\r\n else:\r\n ans=ans+'2'\r\n i+=2\r\nprint (ans)\r\n", "ternary_str = input()\n\ntmp = \"\"\nresult_num = \"\"\nfor c in ternary_str:\n tmp += c\n \n if tmp == \".\":\n result_num += \"0\"\n tmp = \"\"\n elif tmp == \"-.\":\n result_num += \"1\"\n tmp = \"\"\n elif tmp == \"--\":\n result_num += \"2\"\n tmp = \"\"\nprint(result_num)\n", "def decode_borze(borze_code):\r\n decoded_number = \"\"\r\n i = 0\r\n while i < len(borze_code):\r\n if borze_code[i] == '.':\r\n decoded_number += '0'\r\n i += 1\r\n elif borze_code[i] == '-' and borze_code[i+1] == '.':\r\n decoded_number += '1'\r\n i += 2\r\n elif borze_code[i] == '-' and borze_code[i+1] == '-':\r\n decoded_number += '2'\r\n i += 2\r\n return decoded_number\r\n\r\n# Read input\r\nborze_code = input()\r\n\r\n# Decode the Borze code\r\nternary_number = decode_borze(borze_code)\r\n\r\n# Print the decoded ternary number\r\nprint(ternary_number)\r\n", "# -*- coding: utf-8 -*-\n\"\"\"Codeforce\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1XTEd3xULMSCXZWYeK6wKPXVsZ74tROB6\n\"\"\"\n\nn = input()\nresult = ''\ni = 0\n\nwhile i < len(n):\n if n[i] == '.':\n result += '0'\n i += 1\n elif n[i] == '-' and i != len(n) - 1:\n if n[i + 1] == '-':\n result += '2'\n i += 2\n else:\n result += '1'\n i += 2\nprint(result)\n\n\n\n", "# Taaha Multani @ https://github.com/taaaahahaha\r\n\r\ns = input()\r\nt = \"\"\r\nans = \"\"\r\ni=0\r\nl=len(s)\r\nwhile i<l:\r\n t+=s[i]\r\n if t=='.':\r\n ans+='0'\r\n t=''\r\n elif t=='-.':\r\n ans+='1'\r\n t='' \r\n elif t=='--':\r\n ans+='2'\r\n t=''\r\n i+=1\r\nprint(ans)\r\n", "w = input()\r\ns = 0\r\nans = \"\"\r\nfor i, v in enumerate(w):\r\n if s == 0:\r\n if v == \".\":\r\n ans += \"0\"\r\n else:\r\n s = 1\r\n else:\r\n s = 0\r\n ans += \"1\" if v == \".\" else \"2\"\r\nprint(ans)\r\n", "refer = {'.': '0', '-.': '1', '--': '2'}\r\nst = list(input())\r\nst2 = \"\"\r\ni = 0\r\nwhile(i < len(st)):\r\n if(st[i] == '.'):\r\n st2 += \"0\"\r\n i += 1\r\n else:\r\n if(st[i + 1] == \".\"):\r\n st2 += \"1\"\r\n elif(st[i + 1] == \"-\"):\r\n st2 += \"2\"\r\n i += 2\r\nprint(st2)", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\ns=input()\r\nprint(s.replace(\"--\",\"2\").replace(\"-.\",\"1\").replace(\".\",\"0\"))", "input_str = input()\r\noutput_str = ''\r\nassociated = False\r\n\r\nfor i in range(0, len(input_str)):\r\n if associated:\r\n associated = False\r\n continue\r\n if input_str[i] == '.' and not associated:\r\n output_str += '0'\r\n if input_str[i] == '-' and len(input_str) > i + 1:\r\n if input_str[i + 1] == '-':\r\n output_str += '2'\r\n if input_str[i + 1] == '.':\r\n output_str += '1'\r\n associated = True\r\n\r\nprint(output_str)", "def main():\r\n l = list(''.join(input()))\r\n c = []\r\n i = 0\r\n while i < len(l):\r\n if l[i] == '.':\r\n c.append('0')\r\n i += 1\r\n elif l[i] == '-':\r\n if l[i+1] == '.':\r\n c.append('1')\r\n i += 2\r\n else:\r\n c.append('2')\r\n i += 2\r\n print(''.join(c))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "a=input()\r\nb=0\r\nwhile(b<len(a)):\r\n if a[b]=='.':\r\n print(\"0\",end='')\r\n b+=1\r\n elif a[b]=='-' and a[b+1]=='.':\r\n print(\"1\",end='')\r\n b+=2\r\n elif a[b]=='-' and a[b+1]=='-':\r\n print(\"2\",end='')\r\n b+=2", "code = input()\r\n\r\ni = 0\r\nlength = len(code)\r\ndist = {\r\n \".\": \"0\",\r\n \"-.\": \"1\",\r\n \"--\": \"2\"\r\n}\r\ndecoded_text = \"\"\r\n\r\nwhile i < length:\r\n current = code[i]\r\n if(current == \"-\"):\r\n next = code[i+1]\r\n decoded_text += dist[current+next]\r\n i += 1\r\n if(current == \".\"):\r\n decoded_text += dist[current]\r\n i += 1\r\n\r\nprint(decoded_text)\r\n", "s=list(input())\nans=''\nwhile len(s)!=0:\n if s[0]=='.':\n ans=ans+'0'\n del s[0]\n else:\n if s[1]=='.':\n ans=ans+'1'\n else:\n ans=ans+'2'\n del s[0]\n del s[0]\nprint(ans)\n", "t=input()\r\ntemp=len(t)\r\na=0\r\nSol=''\r\nwhile a<temp:\r\n if t[a]==\".\":\r\n Sol+=\"0\"\r\n a+=1\r\n else:\r\n if t[a+1]==\".\":\r\n Sol+=\"1\"\r\n else:\r\n Sol+=\"2\"\r\n a+=2\r\nprint(Sol)", "borze = input()\r\nprev = False\r\nresult = ''\r\nfor i in borze:\r\n if not prev:\r\n if i == '.':\r\n result += '0'\r\n elif i == '-':\r\n prev = True\r\n else:\r\n if i == '.':\r\n result += '1'\r\n elif i == '-':\r\n result += '2'\r\n prev = False\r\nprint(result)\r\n\r\n \r\n", "x = input()\r\nans = ''\r\ni = 0\r\nwhile True:\r\n if i >= len(x):\r\n break\r\n if x[i] == '.':\r\n ans += '0'\r\n i += 1\r\n elif x[i:i+2] == '-.':\r\n ans += '1'\r\n i += 2\r\n elif x[i:i+2] == '--':\r\n ans += '2'\r\n i += 2\r\nprint(ans)", "# Read the Borze code\r\nborze_code = input()\r\n\r\n# Initialize an empty string to store the decoded ternary number\r\nternary_number = \"\"\r\n\r\n# Initialize an index variable to traverse the Borze code\r\ni = 0\r\n\r\n# Iterate through the Borze code\r\nwhile i < len(borze_code):\r\n if borze_code[i] == '.':\r\n # If current character is '.', append '0' to the ternary number\r\n ternary_number += '0'\r\n i += 1\r\n elif borze_code[i] == '-' and borze_code[i+1] == '.':\r\n # If current character is '-' and next character is '.', append '1' to the ternary number\r\n ternary_number += '1'\r\n i += 2\r\n elif borze_code[i] == '-' and borze_code[i+1] == '-':\r\n # If current character is '-' and next character is '-', append '2' to the ternary number\r\n ternary_number += '2'\r\n i += 2\r\n\r\n# Print the decoded ternary number\r\nprint(ternary_number)\r\n", "n = str(input())\r\n\r\nfor a in n:\r\n n = n.replace('--', '2', 1)\r\nfor b in n:\r\n n = n.replace('-.', '1', 1)\r\nfor c in n:\r\n n = n.replace('.', '0', 1)\r\n\r\nprint(n)", "s = input()\r\nr = ''\r\nx = 0\r\nwhile x < len(s):\r\n if s[x] == '.':\r\n r += '0'\r\n else:\r\n if s[x+1] == '.':\r\n r += '1'\r\n else:\r\n r += '2'\r\n x += 1\r\n x += 1\r\n # print(r)\r\nprint(r)", "bor = list(input())\r\nc_bor = []\r\n\r\nwhile len(bor) > 0:\r\n if bor[0] == '-' and bor[1] == '-':\r\n del bor[0:2]\r\n c_bor.append(2)\r\n elif bor[0] == '-' and bor[1] == '.':\r\n del bor[0:2]\r\n c_bor.append(1)\r\n else:\r\n c_bor.append(0)\r\n del bor[0:1]\r\n\r\nprint(*c_bor, sep='')", "code=input()\r\nn=len(code)\r\ni=0\r\nresult = ''\r\nwhile(i<n):\r\n if(code[i]=='.'):\r\n result+='0'\r\n i+=1\r\n elif(code[i]=='-'):\r\n temp='-'+code[i+1]\r\n if(temp == '-.'):\r\n result+='1'\r\n else:\r\n result+='2'\r\n i+=2\r\nprint(result)", "u=input()\r\nn=0\r\nl=[]\r\nwhile n<len(u):\r\n if u[n]==\".\":\r\n l.append(\"0\")\r\n n+=1\r\n elif u[n]==\"-\":\r\n n+=1\r\n if u[n]==\"-\":\r\n l.append(\"2\")\r\n n+=1\r\n continue\r\n else:\r\n l.append(\"1\")\r\n n+=1\r\n continue\r\nfor y in l:\r\n print(y,end=\"\")", "t=input(\"\")\r\ni=0\r\nwhile (i<len(t)):\r\n if t[i]==\".\":\r\n print(0,end=\"\")\r\n i+=1\r\n elif t[i]+t[i+1]==\"-.\":\r\n print(1,end=\"\")\r\n i+=2\r\n elif t[i]+t[i+1]==\"--\":\r\n print(2,end=\"\")\r\n i+=2\r\n", "import re\ns = input()\nx = re.split(\"(--|-\\.|\\.)\", s)\nt = ''\nfor letra in x:\n if letra == '.':\n t+=str(0)\n elif letra == '-.':\n t+=str(1)\n elif letra == '--':\n t+=str(2)\nprint(t)", "zero = \".\"\r\none = \"-.\"\r\ntwo = \"--\"\r\n\r\ns = input()\r\nresult = []\r\nwhile s:\r\n if s.startswith(zero):\r\n result.append('0')\r\n s = s[1:]\r\n elif s.startswith(one):\r\n result.append('1')\r\n s = s[2:]\r\n elif s.startswith(two):\r\n result.append('2')\r\n s = s[2:]\r\n\r\nprint(\"\".join(result))\r\n ", "if __name__ == '__main__':\r\n line = str(input())\r\n res = str()\r\n size = len(line)\r\n i = 0\r\n while i < size:\r\n if line[i] == '.':\r\n res += '0'\r\n elif line[i] == '-':\r\n i += 1\r\n if line[i] == '.':\r\n res += '1'\r\n elif line[i] == '-':\r\n res += '2'\r\n i += 1\r\n print(res)\r\n", "n = input()\r\nall = 0\r\nup = ''\r\nwhile all < len(n):\r\n if n[all] == '.':\r\n up+='0'\r\n all+=1\r\n elif n[all] == '-' and n[all+1] == '.':\r\n up+='1'\r\n all+=2\r\n else:\r\n up+='2'\r\n all+=2\r\nprint(up)", "borze_code = input() # Read the Borze code from input\r\n\r\n# Initialize variables\r\nresult = []\r\ni = 0 # Start from the first character of the Borze code\r\n\r\nwhile i < len(borze_code):\r\n if borze_code[i] == \".\":\r\n result.append(\"0\")\r\n i += 1\r\n elif borze_code[i] == \"-\" and borze_code[i + 1] == \".\":\r\n result.append(\"1\")\r\n i += 2 # Skip both '-' and '.'\r\n elif borze_code[i] == \"-\" and borze_code[i + 1] == \"-\":\r\n result.append(\"2\")\r\n i += 2 # Skip both '-' and '-'\r\n\r\n# Convert the list of ternary digits to a string\r\nternary_number = \"\".join(result)\r\n\r\n# Output the decoded ternary number\r\nprint(ternary_number)\r\n", "p = False\r\nfor ch in input():\r\n if ch == '.':\r\n print('1' if p else '0', end='')\r\n p = False\r\n else:\r\n if p:\r\n print('2', end='')\r\n p = not p", "s=list(input())\r\nn=len(s)\r\ns1=''\r\ni=0\r\nwhile(i<n):\r\n if(s[i]=='.'):\r\n s1+='0'\r\n i+=1\r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n s1+='1'\r\n i+=2\r\n else:\r\n s1+='2'\r\n i+=2\r\nprint(s1)", "def translateBorze(bc):\r\n bc = list(bc)\r\n bcl = []\r\n\r\n while bc:\r\n if bc[0] == '.':\r\n bc.pop(0)\r\n bcl.append('0')\r\n elif ''.join(bc[:2]) == '-.':\r\n bc.pop(0)\r\n bc.pop(0)\r\n bcl.append('1')\r\n elif ''.join(bc[:2]) == '--':\r\n bc.pop(0)\r\n bc.pop(0)\r\n bcl.append('2')\r\n \r\n return ''.join(bcl)\r\n\r\nif __name__ == \"__main__\":\r\n borze = input()\r\n\r\n print(translateBorze(borze))\r\n", "# n = int(input())\n# arr = list(map(int,input().split(\" \")))\n\n# arr1 = sorted(arr)\n\n# arr2 = [0 for i in range(n)]\n# l ,r = 0,0\n\n# for i in range(n):\n# if arr1[i]!=arr[i]:\n# l = i\n\n\n\nstr = input()\n\nn = len(str)\n\ni=0\nwhile i<n:\n if str[i]=='.':\n print(\"0\",end=\"\")\n i+=1\n else:\n if str[i+1]==\".\":\n print(\"1\",end=\"\")\n else:\n print(\"2\",end=\"\")\n i+=2\nprint()", "# import inbuilt standard input output\nfrom sys import stdin, stdout\n\ndef main():\n code = stdin.readline()\n final_code = []\n pointer = 0\n while pointer < len(code):\n cur_code = code[pointer]\n if cur_code == '.':\n final_code.append('0')\n pointer += 1\n else:\n cur_code = code[pointer: pointer + 2]\n if cur_code == '-.':\n final_code.append('1')\n elif cur_code == '--':\n final_code.append('2')\n pointer += 2\n final_str = ''.join(final_code)\n stdout.write(final_str)\n\nif __name__ == \"__main__\":\n main()", "di = {\r\n '.': '0',\r\n '-.': '1',\r\n '--': '2'\r\n}\r\n\r\ns = input()\r\ni = 0\r\nans = \"\"\r\nwhile i < len(s):\r\n ch1 = \"\"\r\n ch2 = \"\"\r\n if i < len(s)-1:\r\n ch2 = s[i:i+2]\r\n ch1 = s[i]\r\n\r\n if di.get(ch1):\r\n ans += di[ch1]\r\n i += 1\r\n elif di.get(ch2):\r\n ans += di[ch2]\r\n i += 2\r\n\r\nprint(ans)\r\n", "# 32B - Borze\r\n\r\nborze_code = input()\r\nindex = 0\r\nwhile True:\r\n if borze_code[index] == '.':\r\n print('0', end=\"\")\r\n else:\r\n index += 1\r\n if borze_code[index] == '.':\r\n print('1', end=\"\")\r\n else:\r\n print('2', end=\"\")\r\n index += 1\r\n if index == len(borze_code):\r\n break\r\n", "borze=input()\r\nnum=\"\"\r\ni=0\r\nwhile(i<(len(borze))):\r\n ch=borze[i]\r\n if ch=='.':\r\n num+='0'\r\n i+=1\r\n elif ch=='-' and i<(len(borze)-1) and borze[i+1]=='.':\r\n num+='1'\r\n i+=2\r\n elif ch=='-' and i<(len(borze)-1) and borze[i+1]=='-':\r\n num+='2'\r\n i+=2\r\n else:\r\n pass\r\nprint(num)", "d=input()\r\nstring = []\r\ni=0\r\nwhile(i!=len(d)):\r\n if (d[i]==\".\"):\r\n string.append('0')\r\n elif(d[i]==\"-\"):\r\n if(d[i+1]==\".\"):\r\n string.append('1')\r\n elif(d[i+1]==\"-\"):\r\n string.append('2')\r\n \r\n i=i+1\r\n i=i+1 \r\ns=\"\".join(string) \r\nprint(s) \r\n \r\n \r\n \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\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n print(0,end='')\r\n i+=1\r\n else:\r\n i+=1\r\n if s[i]=='.':\r\n print(1,end='')\r\n else:\r\n print(2,end='')\r\n i+=1", "a = list(input())\r\nv =[]\r\ni =0\r\nwhile i <len(a):\r\n\tif a[i] == \".\":\r\n\t\tv.append(\"0\")\r\n\t\ti+=1\r\n\t\t\r\n\telse:\r\n\t\tif a[i+1] == \".\":\r\n\t\t\tv.append(\"1\")\r\n\t\t\ti+=2\r\n\t\telse:\r\n\t\t\tv.append(\"2\")\r\n\t\t\ti+=2\r\nprint(\"\".join(v))\r\n\r\n\r\n", "l=list(input())\r\nres=\"\"\r\ni=0\r\nwhile(i<len(l)-1):\r\n if(l[i]=='.'):\r\n res+='0'\r\n i+=1\r\n else:\r\n if(l[i+1]=='-'):\r\n res+='2'\r\n else:\r\n res+='1'\r\n i+=2\r\nif(i==len(l)-1):\r\n res+='0'\r\nprint(res)\r\n ", "a=input()\r\np=''\r\ni=0\r\nwhile(True):\r\n if a[i]=='.':\r\n p=p+'0'\r\n i=i+1\r\n elif a[i]=='-':\r\n if a[i+1]=='.':\r\n p=p+'1'\r\n else:\r\n p=p+'2'\r\n i=i+2\r\n if i>=len(a):\r\n break\r\nprint(p) \r\n \r\n", "l=input()\r\ni=0\r\nwhile(i<len(l)):\r\n\tif l[i]==\".\":\r\n\t\tprint(0,end=\"\")\r\n\telif l[i]==\"-\" and l[i+1]==\"-\":\r\n\t\tprint(2,end=\"\")\r\n\t\ti += 1\r\n\telse:\r\n\t\tprint(1,end=\"\")\r\n\t\ti += 1\r\n\ti += 1\r\nif i!=len(l):\r\n\tprint(0)", "s = input()\r\nh = \"\"\r\ni = 0\r\nwhile(i<(len(s))):\r\n if s[i] == \".\":\r\n h = h+\"0\"\r\n i+=1\r\n elif s[i] == \"-\":\r\n if s[i+1] == \".\":\r\n h = h+\"1\"\r\n i+=2\r\n elif s[i+1] == '-':\r\n h = h+\"2\"\r\n i+=2\r\n\r\nprint(h)\r\n\r\n\r\n", "l = list(input())\nn = len(l)\nres = \"\"\n\ni = 0\n\nwhile i<n:\n if l[i]=='.':\n res+=\"0\"\n i+=1\n else:\n if i+1<n and l[i+1]==\".\": #perform lookahead\n res+=\"1\"\n else:\n res+=\"2\"\n i+=2\nprint(res)", "s=input()\r\nx=\"\"\r\ni=0\r\nwhile(i<len(s)):\r\n if(s[i]=='.'):\r\n x=x+'0'\r\n i=i+1\r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n x=x+'1'\r\n i=i+2\r\n else:\r\n x=x+'2'\r\n i=i+2\r\nprint(x)", "t=str(input())\r\nl=int(len(t))\r\n\r\ni=0\r\nb=[]\r\nwhile (i < l):\r\n if t[i]==\".\":\r\n b.append(\"0\")\r\n i=i+1\r\n else:\r\n t[i]==\"-\"\r\n if t[i+1]==\".\":\r\n b.append(\"1\")\r\n else:\r\n b.append(\"2\")\r\n i=i+2 \r\nfor j in range(len(b)):\r\n print(b[j],end=\"\")\r\n", "s=input()\r\ns0=s.count(\".\")\r\ns1=s.count(\"-.\")\r\ns2=s.count(\"--\")\r\nwhile s2!=0:\r\n\ts=s.replace(\"--\",\"2\")\r\n\ts2=s.count(\"--\")\r\nwhile s1!=0:\r\n\ts=s.replace(\"-.\",\"1\")\r\n\ts1=s.count(\"-.\")\r\nwhile s0!=0:\r\n\ts=s.replace(\".\",\"0\")\r\n\ts0=s.count(\".\")\r\nprint(s) ", "s=input()\r\nn=len(s)\r\ni=0\r\nwhile i<n:\r\n \r\n if s[i]=='.':\r\n print(0,end=\"\")\r\n elif s[i]=='-' and s[i+1]=='.':\r\n print(1,end=\"\")\r\n i=i+1\r\n elif s[i]=='-' and s[i+1]=='-':\r\n print(2,end=\"\")\r\n i=i+1\r\n \r\n i=i+1", "s = input()\r\ns2=\"\"\r\nx = 0\r\nwhile x<(len(s)):\r\n\tif s[x]==\".\":\r\n\t\ts2+=\"0\"\r\n\t\tx+=1\r\n\telif s[x]==\"-\" and s[x+1]==\".\":\r\n\t\ts2+=\"1\"\r\n\t\tx+=2\r\n\telif s[x]==\"-\" and s[x+1]==\"-\":\r\n\t\ts2+=\"2\"\r\n\t\tx+=2\r\nprint(s2)", "s = input()\r\nwhile s:\r\n if s[0] == '.':\r\n print(0, end='')\r\n s = s[1:]\r\n else:\r\n print([1, 2][s[0:2] == '--'], end='')\r\n s = s[2:]\r\n", "a = input()\n\nb = len(a)\n\ni = 0\n\nd = {\".\":\"0\", \"-.\":\"1\", \"--\":\"2\"}\n\nlst = []\n\nwhile i<b:\n if i+1<b and a[i]+a[i+1]==\"-.\":\n lst.append(d[\"-.\"])\n i+=2\n elif i+1<b and a[i]+a[i+1]==\"--\":\n lst.append(d[\"--\"])\n i+=2\n else:\n lst.append(d[\".\"])\n i+=1\n\nlst = \"\".join(lst)\nprint(lst)\n", "\r\nx=input()\r\na=\"\"\r\nb=\"\"\r\nfor i in x:\r\n\tb=b+i\r\n\tif b==\".\":\r\n\t\ta=a+\"0\"\r\n\t\tb=\"\"\r\n\tif b==\"-.\":\r\n\t\ta=a+\"1\"\r\n\t\tb=\"\"\r\n\tif b==\"--\":\r\n\t\ta=a+\"2\"\r\n\t\tb=\"\"\r\nprint(a)", "s = input()\r\nans = []\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n ans.append('0')\r\n else:\r\n if s[i+1]=='.':\r\n ans.append('1')\r\n else:\r\n ans.append('2')\r\n i=i+1\r\n i+=1\r\nfor j in ans:\r\n print(j,end='')", "# -*- coding: utf-8 -*-\r\n# Author: Metalofon\r\n\r\ns = input()\r\nn = len(s)\r\n\r\nos, i = '', 0\r\n\r\nwhile i < n:\r\n if s[i] == '.':\r\n os, i = os + '0', i + 1\r\n elif s[i] == '-' and s[i+1] == '.':\r\n os, i = os + '1', i + 2\r\n else:\r\n os, i = os + '2', i + 2\r\n\r\nprint(os)\r\n", "code = input()\r\ni = 0\r\nwhile i < len(code):\r\n if code[i] == \".\":\r\n print(\"0\", end=\"\")\r\n i = i+1\r\n else:\r\n i = i+1\r\n if code[i] == \".\":\r\n print(\"1\", end=\"\")\r\n i = i+1\r\n else:\r\n print(\"2\", end=\"\")\r\n i = i+1", "# Problem: B. Borze\n# Contest: Codeforces - Codeforces Beta Round 32 (Div. 2, Codeforces format)\n# URL: https://codeforces.com/problemset/problem/32/B\n# Memory Limit: 256 MB\n# Time Limit: 2000 ms\n# \n# Powered by CP Editor (https://cpeditor.org)\n\na = input()\na = a.replace(\"--\", \"2\")\na = a.replace(\"-.\", \"1\")\na = a.replace(\".\", \"0\")\nprint(a)", "x=input()\nmy=\"\"\nt=len(x)-1\ni=0\nwhile(t>=0):\n\tif(x[i]==\"-\" and x[i+1]==\".\"):\n\t\tmy+=\"1\"\n\t\tt-=2\n\t\ti+=2\n\t\tcontinue\n\tif(x[i]==\"-\" and x[i+1]==\"-\"):\n\t\tmy+=\"2\"\n\t\tt-=2\n\t\ti+=2\n\t\tcontinue\n\tif(x[i]==\".\"):\n\t\tmy+=\"0\"\n\t\tt-=1\n\t\ti+=1\n\t\tcontinue\n\nprint(my)", "s = input()\r\nnew = \"\"\r\ni = 0\r\nwhile i in range(len(s)):\r\n if s[i] == \"-\" and s[i+1] == \"-\":\r\n new += \"2\"\r\n i += 2\r\n elif s[i] == \"-\" and s[i+1] == \".\":\r\n new += \"1\"\r\n i += 2\r\n elif s[i] == \".\":\r\n new += \"0\"\r\n i += 1\r\nprint(new)", "s=input()\r\nans=\"\"\r\nsl=[]\r\nfor i in s:\r\n sl+=[i]\r\ni=0\r\nn=len(s)\r\nwhile i<(n-1):\r\n if sl[i]=='-' and sl[i+1]=='.':\r\n ans+=\"1\"\r\n sl[i]='0'\r\n sl[i+1]='0'\r\n i+=2\r\n elif sl[i]=='-' and sl[i+1]=='-':\r\n ans+=\"2\"\r\n sl[i]='0'\r\n sl[i+1]='0'\r\n i+=2\r\n else:\r\n ans+=\"0\"\r\n i+=1\r\n sl[i-1]='0'\r\n #print(ans)\r\n#print(sl)\r\nif sl[n-1]=='.':\r\n ans+=\"0\"\r\nprint(ans)", "x = list(input())\r\n\r\ni = 0\r\nwhile(i < len(x)):\r\n if(x[i] == '-'):\r\n if(x[i + 1] == '.'):\r\n print(\"1\", end=\"\")\r\n else:\r\n print(\"2\", end=\"\")\r\n i += 2\r\n else:\r\n print(\"0\", end=\"\")\r\n i += 1", "# -*- coding: utf-8 -*-\n\"\"\"answer.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1JACmdEB4KfVO9eAL6xL2DPDPU1P4-oJI\n\"\"\"\n\n#4\ncode = input()\ndictionary = {'.':0, '-.':1, '--':2}\nanswer = ''\nflag = 0\nfor i in range(len(code)):\n if flag > 0:\n flag = 0\n elif i > len(code)-1:\n pass\n elif i != len(code)-1:\n if code[i] == '.':\n answer += '0'\n elif code[i] == '-':\n if code[i+1] == '.':\n answer += '1'\n flag += 1\n else:\n answer += '2'\n flag += 1\n else:\n if code[i] == '.':\n answer += '0'\n else:\n pass\nprint(answer)", "import sys\r\ninput = sys.stdin.readline\r\nfrom math import ceil\r\nfrom collections import Counter\r\n #X,Y,Z = list(map(int,input().strip().split()))\r\nt = input()\r\nl = len(t)\r\ni = 0\r\nans = []\r\nwhile i < l-1 :\r\n \r\n if t[i] == \".\":\r\n ans.append('0')\r\n \r\n else:\r\n i += 1\r\n if t[i] == \".\":\r\n ans.append('1')\r\n else:\r\n ans.append('2')\r\n i+=1\r\nprint(''.join(ans))", "a = input()\r\nc = 0\r\np = ''\r\nq = ''\r\nfor i in a:\r\n if i == '.' and c == 0:\r\n p += '0'\r\n else:\r\n q += i\r\n c += 1\r\n if c == 2:\r\n c = 0\r\n if q == '-.':\r\n p += '1'\r\n elif q == '--':\r\n p += '2'\r\n q = ''\r\nprint(p)\r\n ", "def resolve(code):\r\n num='' \r\n newstr=''\r\n for item in code:\r\n if len(newstr)>=2:\r\n newstr=''\r\n newstr+=item\r\n if newstr=='.':\r\n num+='0'\r\n newstr=''\r\n elif newstr=='-':\r\n continue\r\n else:\r\n if newstr=='--':\r\n num+='2'\r\n else:\r\n num+='1'\r\n return num\r\n\r\n\r\ncode = input()\r\nresult=resolve(code)\r\nprint(result)\r\n", "l=input()\r\nx=''\r\ni=0\r\nwhile (i<len(l)):\r\n if l[i]=='.':\r\n x=x+'0'\r\n if l[i]=='-':\r\n j=i+1\r\n if j<len(l):\r\n if l[j]=='.':\r\n x=x+'1'\r\n i=i+1\r\n elif l[j]=='-':\r\n x=x+'2'\r\n i=i+1\r\n i=i+1\r\n \r\nprint(x)\r\n", "'''\nFinal = []\nip = input()\n\nList = ip.split('.')\nDict = ['.', '-.', '--']\n\n\nif len(List) == 1:\n\tList = []\n\tList = ip.split('--')\n\tif len(List) > len(ip):\n\t\tList.pop(-1)\n\tfor i in range(len(List)):\n\t\tif List[i] == '':\n\t\t\tFinal.append('2')\nelse:\n\tif len(List) > len(ip):\n\t\tList.pop(-1)\n\tprint(List)\n\tfor i in range(len(List)):\n\t\tif List[i] == '':\n\t\t\tFinal.append('0')\n\t\telif List[i] == '-':\n\t\t\tFinal.append('1')\n\t\telif List[i] == '--':\n\t\t\tFinal.append('2')\nprint(Final)\nNum = ''.join(Final)\nprint(Num)\n'''\n\nip = input()\nFinal = []\ni = 0\nwhile i < len(ip):\n\tif ip[i] == '.':\n\t\tFinal.append('0')\n\t\ti += 1\n\telif ip[i] == '-':\n\t\tif ip[i+1] == '.':\n\t\t\tFinal.append('1')\n\t\t\ti += 2\n\t\telse:\n\t\t\tFinal.append('2')\n\t\t\ti += 2\nNum = ''.join(Final)\nprint(Num)", "a = input()\r\ns = 0\r\nb = \"\"\r\nwhile s < len(a):\r\n if a[s] == \".\":\r\n s += 1\r\n b += \"0\"\r\n elif a[s] == \"-\":\r\n if a[s + 1] == \".\":\r\n b += \"1\"\r\n else:\r\n b += \"2\"\r\n s += 2\r\nprint(b)\r\n", "s=[x for x in input()]; k=\"\"; i=0\r\nwhile i<(len(s)):\r\n if s[i]==\"-\":\r\n if s[i+1]==\"-\": k +=\"2\"\r\n else: k +=\"1\"\r\n i +=1;\r\n else: k+=\"0\"\r\n i+=1\r\nprint(k)\r\n", "q = input()\nq= q.replace(\"--\", \"2\")\nq= q.replace(\"-.\", \"1\")\nq = q.replace(\".\", \"0\")\nprint(q)", "c=input()\r\ni=0\r\ns=\"\"\r\nwhile(c!=\"\"):\r\n if c[0]=='.':\r\n s=s+'0'\r\n c=c[1:]\r\n elif c[0]=='-':\r\n if c[1]=='.':\r\n s=s+'1'\r\n c=c[2:]\r\n else:\r\n s=s+'2'\r\n c=c[2:]\r\nprint(s)", "s = input()\r\nskip = False\r\nslen = len(s)\r\nnum = ''\r\nfor i in range(slen):\r\n if skip == False:\r\n if s[i]=='-' and s[i+1]=='-':\r\n num += '2'\r\n skip = True\r\n elif s[i]=='-' and s[i+1]=='.':\r\n num+= '1'\r\n skip = True\r\n else:\r\n num+='0'\r\n else:\r\n skip = False\r\n\r\n#num = int(num)\r\nprint(num)\r\n", "b = [i for i in input()]\r\na = []\r\nwhile b != []:\r\n if b[0] == '.':\r\n a.append('0')\r\n b.pop(0)\r\n elif b[0] == '-' and b[1] == '.':\r\n a.append('1')\r\n b.pop(0)\r\n b.pop(0)\r\n elif b[0] == '-' and b[1] == '-':\r\n a.append('2')\r\n b.pop(0)\r\n b.pop(0)\r\n\r\nprint(''.join(a))", "haha = list(input())\r\n\r\nnew = []\r\nwhile haha != []:\r\n if haha[0] == '-':\r\n if haha[1] == '-':\r\n new.append(2)\r\n del haha[0:2]\r\n else:\r\n new.append(1)\r\n del haha[0:2]\r\n else:\r\n new.append(0)\r\n del haha[0]\r\nfor i in new: \r\n print(i, end=\"\") ", "lst = list(input())\r\ns=''\r\nfor i in range(len(lst)-1):\r\n\tif lst[i]=='.':\r\n\t\ts+='0'\r\n\telif lst[i]=='-' and lst[i+1]=='.':\r\n\t\ts+='1'\r\n\t\tlst[i+1]='x'\r\n\telif lst[i]=='-' and lst[i+1]=='-':\r\n\t\ts+='2'\r\n\t\tlst[i+1]='x'\r\nx=s.split()\r\n#print(lst)\r\nif lst[-1]=='.':\r\n\ts+='0'\r\nprint(s)\r\n\r\n", "s = input()\r\na = ''\r\nq = 0\r\nn = len(s)\r\nfor i in range(n):\r\n if q >= n:\r\n break\r\n if s[q] == '.':\r\n a+='0'\r\n q+=1\r\n elif s[q+1] =='.':\r\n a+='1'\r\n q+=2\r\n else:\r\n a+='2'\r\n q+=2\r\nprint(a)", "b=0\r\ns=input()\r\nfor i in range(len(s)):\r\n a=s[i]\r\n if a=='.' and b=='-':\r\n print('1',end='')\r\n b=0\r\n elif a=='.':\r\n print('0',end='')\r\n b=0\r\n elif a=='-' and b=='-':\r\n print('2',end='')\r\n b=0\r\n elif a=='-':\r\n b=a\r\n continue\r\n", "import re; print(re.sub( \"\\.\", \"0\", re.sub( \"-\\.\", \"1\", re.sub(\"--\", \"2\", input()))))", "s = input()\r\ns1 = s.replace('--','2')\r\ns2 = s1.replace('-.','1')\r\ns3 = s2.replace('.','0')\r\n\r\nprint(s3)", "t=input()\r\nt1=''\r\nf=0\r\nfor i in range(len(t)):\r\n if f==1:\r\n f=0\r\n continue\r\n if t[i]=='.': t1+='0'\r\n elif i+1<=len(t)-1 and t[i:i+2]=='-.': t1+='1';f=1\r\n elif i+1<=len(t)-1 and t[i:i+2]=='--': t1+='2';f=1\r\nprint(t1)\r\n", "t=1\r\n#t = int(input())\r\nfor i in range(t):\r\n #n = int(input())\r\n arr = input()\r\n #arr = arr.split()\r\n #a = [int(x) for x in arr] #; print(a)\r\n while arr != '':\r\n if arr[0] == '.':\r\n print(0, end='')\r\n arr = arr[1:]\r\n else:\r\n if arr[:2] =='-.':\r\n print(1, end='')\r\n else:\r\n print(2, end='')\r\n arr = arr[2:]\r\n print()", "n=input()\r\nres=\"\"\r\ni=0\r\nwhile i<len(n):\r\n if n[i]==\".\":\r\n res+=\"0\"\r\n i+=1\r\n else:\r\n if n[i+1]==\"-\":\r\n res+=\"2\"\r\n else:\r\n res+=\"1\"\r\n i+=2\r\nprint(res)\r\n\r\n", "x=input()\r\ni=0\r\nwhile i<=(len(x)-1):\r\n\tif x[i]==\".\":\r\n\t\tprint(0,end=\"\")\r\n\t\ti+=1\r\n\telif x[i]==\"-\":\r\n\t\tif x[i+1]==\".\":\r\n\t\t\tprint(1,end=\"\")\r\n\t\t\ti+=2\r\n\t\telse:\r\n\t\t\tprint(2,end=\"\")\r\n\t\t\ti+=2", "\r\n\r\nd = {\"-.\":\"1\", \".\":\"0\", \"--\":\"2\"}\r\ns = list(input())\r\n\r\nans = \"\"\r\nwhile s:\r\n ne = s.pop(0)\r\n #print(ne,s, ans)\r\n if ne==\".\":\r\n ans += \"0\"\r\n else:\r\n ans += d[ne+s.pop(0)]\r\n\r\nprint(ans)", "name = list(input())\nstring = \"\"\nwhile(len(name)>0):\n b = name.pop(0)\n if b == '-':\n a = name.pop(0)\n if a == '.':\n string = string + '1'\n else:\n string = string + '2'\n else:\n string = string + '0'\nprint(string)\n\t\t\t\t\t\t\t\t\t \t \t\t \t\t\t \t\t \t", "s = input()\n\nres = ''\ni = 0\nwhile i < len(s):\n if s[i: i + 2] == '-.':\n res += '1'\n i += 2\n elif s[i: i + 2] == '--':\n res += '2'\n i += 2\n else:\n res += '0'\n i += 1\n\nprint(res)\n", "s = input()\r\nemp = ''\r\ni = 0\r\n\r\nwhile i<len(s):\r\n if s[i] == '.':\r\n emp += '0'\r\n elif s[i] == '-' and s[i+1] == '.':\r\n emp += '1'\r\n i += 1\r\n else:\r\n emp += '2'\r\n i += 1\r\n \r\n i += 1\r\n\r\n \r\nprint(emp)", "s = input()\r\niterator = 0\r\nans=''\r\nwhile iterator < len(s):\r\n if s[iterator] == '.':\r\n ans += '0'\r\n iterator += 1\r\n elif s[iterator] == '-':\r\n if s[iterator+1] == '.':\r\n ans += '1'\r\n iterator += 2\r\n elif s[iterator+1] == '-':\r\n ans += '2'\r\n iterator += 2\r\nprint(ans)", "m=input()\r\nx=''\r\ni=0\r\nwhile i != len(m):\r\n\tif m[i]=='.':\r\n\t\tx+='0'\r\n\t\ti+=1\r\n\telif m[i]=='-':\r\n\t\tif m[i+1]=='.':\r\n\t\t\tx+='1'\r\n\t\t\ti+=2\r\n\t\telse:\r\n\t\t\tx+='2'\r\n\t\t\ti+=2\r\nprint(x)", "a = input()\r\ni = 0\r\nm = 0\r\nwhile i < len(a):\r\n m =0\r\n try:\r\n if a[i] == '-' and a[i + 1] == '.':\r\n print(1,end='')\r\n m = 1\r\n elif a[i] == '-' and a[i + 1] == '-':\r\n print(2,end='')\r\n m = 1\r\n elif a[i] == '.':\r\n print(0,end='') \r\n except:\r\n continue\r\n i = i + 1 + m\r\n", "s=input()\r\n\r\nst=[]\r\nans=[]\r\nfor i in s:\r\n st.append(i)\r\n if(st[0]=='.'):\r\n\r\n ans.append(0)\r\n st=[]\r\n \r\n\r\n if(len(st)==2):\r\n if(st==['-','-']):\r\n ans.append(2)\r\n else:\r\n ans.append(1)\r\n \r\n st=[]\r\nres=''\r\nfor i in ans:\r\n res+=str(i)\r\nprint(res)\r\n\r\n", "from collections import Counter\r\n\r\ndef solve():\r\n string=input()\r\n\r\n i=0\r\n resStr=\"\"\r\n\r\n while i<len(string):\r\n if string[i]==\"-\":\r\n if string[i+1]==\"-\":\r\n resStr+=\"2\"\r\n else:\r\n resStr+=\"1\"\r\n i+=1\r\n else:\r\n resStr+=\"0\"\r\n i+=1\r\n return resStr\r\n\r\n\r\n\r\n\r\nprint(solve())", "# 32B\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\ns = str_inp()\r\ni = 0\r\nborze = \"\"\r\nwhile(i!=len(s)):\r\n if(s[i]==\".\"):\r\n i+=1\r\n borze+=\"0\"\r\n elif(s[i]==\"-\" and s[i+1]==\".\"):\r\n i+=2\r\n borze+=\"1\"\r\n else:\r\n i+=2\r\n borze+=\"2\"\r\nprint(borze)", "# https://codeforces.com/contest/32/problem/B\r\n'''\r\n Author @Subhajit Das (sdsubhajitdas.github.io)\r\n SWE @Turbot HQ India PVT Ltd.\r\n 27/08/2020\r\n'''\r\n\r\n\r\ndef main():\r\n code = input().strip()\r\n _len = len(code)\r\n if(code == '.'):\r\n print(\"0\")\r\n return\r\n number = \"\"\r\n\r\n idx = 0\r\n while(idx < _len):\r\n if(code[idx] == \".\"):\r\n number += \"0\"\r\n else:\r\n idx+=1\r\n number += \"1\" if(code[idx]==\".\") else \"2\"\r\n idx+=1\r\n print(number)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s=input()\r\nl=[\".\",\"-.\",\"--\"]\r\na=[]\r\nwhile len(s)>0:\r\n if s[0]==\".\":\r\n a.append(s[0])\r\n s=s[1:]\r\n else:\r\n a.append(s[0:2])\r\n s=s[2:]\r\nfor i in a:\r\n print(l.index(i),end=\"\")", "s = input()\r\ni, n = 0, len(s)\r\nres = []\r\nwhile i < n:\r\n if s[i] == '.':\r\n res.append('0')\r\n i += 1\r\n else:\r\n if s[i + 1] == '.':\r\n res.append('1')\r\n else:\r\n res.append('2')\r\n i += 2\r\nprint(\"\".join(res))\r\n", "s = input()\r\nl = len(s)\r\nans = ''\r\n\r\nwhile l!=0:\r\n if s[0] == '.':\r\n ans = ans+'0'\r\n l-=1\r\n s = s[1::]\r\n elif s[0:2] == '-.':\r\n ans = ans + '1'\r\n l -= 2\r\n s = s[2::]\r\n else:\r\n ans = ans + '2'\r\n l -= 2\r\n s = s[2::]\r\nprint(ans)", "l1=list(input())\r\nl2=[]\r\ni=0\r\nwhile i<len(l1):\r\n\tif l1[i]=='.':\r\n\t\tl2.append(\"0\")\r\n\t\ti+=1\r\n\telif l1[i]=='-':\r\n\t\tif l1[i+1]=='.':\r\n\t\t\tl2.append(\"1\")\r\n\t\t\ti+=2\r\n\t\telif l1[i+1]=='-':\r\n\t\t\tl2.append(\"2\")\r\n\t\t\ti+=2\r\n\telse:\r\n\t\ti+=1\r\nfor j in range(len(l2)):\r\n\tprint(l2[j],end='')", "borze = input()\nplacehold = \"\"\nanswer = \"\"\nfor i in range(0, len(borze)):\n placehold = placehold + borze[i]\n if placehold == \".\":\n answer = answer + \"0\"\n placehold = \"\"\n elif placehold == \"-.\":\n answer = answer + \"1\"\n placehold = \"\"\n elif placehold == \"--\":\n answer = answer + \"2\"\n placehold = \"\"\nprint(answer)", "def decode(code: str):\r\n code = code.replace(\"--\", \"2\")\r\n code = code.replace(\"-.\", \"1\")\r\n code = code.replace(\".\", \"0\")\r\n print(code)\r\n\r\n\r\ndecode(input())", "s=input()\r\ns1=s.replace(\"--\",\"2\")\r\ns1=s1.replace(\"-.\",\"1\")\r\ns1=s1.replace(\".\",\"0\")\r\nprint(s1)", "# Alireza\r\n# JAHANI\r\n# PH_PY_LA\r\n# Dont Repeat Your self ...\r\n\r\ninputme = str(input())\r\ni = 0\r\nresult = ''\r\nwhile i < len(inputme):\r\n if i < len(inputme)-1 and inputme[i] == '-' and inputme[i+1] == '-':\r\n result+='2'\r\n i += 2\r\n elif i < len(inputme)-1 and inputme[i] == '-' and inputme[i+1] == '.':\r\n result+='1'\r\n i += 2\r\n elif inputme[i] == '.':\r\n result+='0'\r\n i += 1\r\nprint(result)\r\n", "st=input()\r\nlst=[i for i in st]\r\nn=len(st)\r\nans=''\r\nwhile n>0:\r\n if len(lst)>1:\r\n if lst[0]=='-' and lst[1]=='.':\r\n lst.pop(0)\r\n lst.pop(0)\r\n ans+='1'\r\n n-=2\r\n elif lst[0]=='-' and lst[1]=='-':\r\n lst.pop(0)\r\n lst.pop(0)\r\n ans+='2'\r\n n-=2\r\n else:\r\n lst.pop(0)\r\n ans+='0'\r\n n-=1\r\n else:\r\n ans+='0'\r\n lst.pop(0)\r\n n-=1\r\n \r\nprint(ans)\r\n", "t=list(str(input()))\r\ni=0\r\nl=len(t)\r\nlst=[]\r\nwhile i < l:\r\n if t[i]=='.' :\r\n lst.append(\"0\")\r\n i=i+1\r\n elif t[i]==\"-\" and t[i+1]==\".\":\r\n lst.append(\"1\")\r\n i=i+2\r\n else:\r\n lst.append(\"2\")\r\n i+=2\r\nprint(\"\".join(lst))", "s = input()\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n print(0,end='')\r\n elif (s[i] == '-') and (s[i +1] == '.'):\r\n print(1,end = '')\r\n i += 1\r\n elif (s[i] == '-') and (s[i + 1] == '-'):\r\n print(2, end = '')\r\n i += 1\r\n i += 1\r\n ", "arr1 = str(input())\r\narr2 = []\r\ni = 0\r\nwhile i < len(arr1):\r\n if(arr1[i] == '.'):\r\n arr2.append('0')\r\n elif(arr1[i] == '-'and arr1[i+1] == '.'):\r\n arr2.append('1')\r\n i += 1\r\n else:\r\n arr2.append('2')\r\n i += 1\r\n i +=1\r\nprint(''.join(arr2))", "s=input()\r\nk=0\r\nwhile(k<len(s)):\r\n if(s[k]=='.'):\r\n print(0,end=\"\")\r\n k+=1\r\n else:\r\n if(s[k+1]=='.'):\r\n print(1,end=\"\")\r\n else:\r\n print(2,end=\"\")\r\n k+=2", "import re\r\nstring = input()\r\nres_2 = re.sub(string=string, pattern=\"--\", repl=\"2\")\r\nres_1 = re.sub(string=res_2, pattern=\"-.\", repl=\"1\")\r\nres = re.sub(string=res_1, pattern=\"\\.\", repl=\"0\")\r\nprint(res)\r\n", "s = str(input())\nr = ''\ncount = 0\n\nwhile count < len(s):\n\tif s[count] == '.':\n\t\tr += '0'\n\t\tcount += 1\n\telif s[count] == '-':\n\t\tif s[count+1] == '.':\n\t\t\tr += '1'\n\t\tif s[count+1] == '-':\n\t\t\tr += '2'\n\t\tcount += 2\nprint(r)\n", "bor = input()\r\n# print(bor)\r\n# d = {'.': 0, '-.': 1, '--': 2}\r\ns2 = ''\r\ni=0\r\nwhile i < len(bor):\r\n if bor[i] == '.':\r\n s2+='0'\r\n elif bor[i] == '-' and bor[i+1] == '.':\r\n s2+='1'\r\n i+=1\r\n elif bor[i] == '-' and bor[i+1] == '-':\r\n s2+='2'\r\n i+=1\r\n i+=1\r\nprint(s2)", "s = list(map(str, input()))\r\nl = len(s)\r\n# for i in range(l,-1, -1):\r\ni = 0\r\nwhile i < l:\r\n if s[i] == \".\":\r\n print(\"0\", end='')\r\n i += 1\r\n else:\r\n if i+1 > l:\r\n continue\r\n if s[i+1] == '.':\r\n print(\"1\", end='')\r\n i += 2\r\n else:\r\n print(\"2\", end='')\r\n i += 2\r\nprint()\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 12 01:31:07 2022\r\n\r\n@author: muamb\r\n\"\"\"\r\n\r\ns=input()\r\nnum=''\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n num=num+'0'\r\n i=i+1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n num=num+'1'\r\n i=i+2\r\n elif s[i]=='-' and s[i+1]=='-':\r\n num=num+'2'\r\n i=i+2\r\nprint(num)", "#!/usr/bin/env python\n\nB = input()\n\nwhile B:\n if B[0] == '.':\n print(0,end='')\n B = B[1:]\n continue\n if B[1] == '.':\n print(1,end='')\n B = B[2:]\n continue\n print(2,end='')\n B = B[2:]\n\nprint()\n", "code = list(input())\r\ntam = len(code)\r\n\r\ni = 0\r\n\r\nwhile i < tam:\r\n\r\n if(code[i] == '.'):\r\n print('0', end='')\r\n i+=1\r\n elif(code[i+1] == '.'):\r\n print('1', end='')\r\n i+=2\r\n elif(code[i+1] == '-'):\r\n print('2', end='')\r\n i+=2\r\n\r\n", "s=input()\r\nt=0\r\nc=''\r\nwhile t!=len(s):\r\n if s[t]=='-' and s[t+1]=='.':\r\n t=t+2\r\n c=c+'1'\r\n elif s[t]=='.':\r\n t=t+1\r\n c=c+'0'\r\n elif s[t]=='-' and s[t+1]=='-':\r\n t=t+2\r\n c=c+'2'\r\nprint(c)", "l = input()\r\ns = \"\"\r\ni = 0\r\nwhile True:\r\n if len(l) <= i :\r\n break\r\n if l[i] == \".\":\r\n s += \"0\"\r\n else:\r\n if l[i + 1] == \".\":\r\n s += \"1\"\r\n else:\r\n s += \"2\"\r\n i += 1\r\n i += 1\r\nprint(s)", "s=input()\r\nl=list(s)\r\nn=0\r\nx=[]\r\nwhile(len(s)>n):\r\n if (s[n]==\".\"):\r\n x.append(0)\r\n n=n+1\r\n else:\r\n if (s[n+1]==\"-\"):\r\n \r\n x.append(2)\r\n else:\r\n x.append(1)\r\n n=n+2\r\nfor i in x:\r\n print(i,end=\"\")", "if __name__ == \"__main__\":\r\n string = input()\r\n string = string.replace('--', '2')\r\n string = string.replace(\"-.\", '1')\r\n string = string.replace(\".\", '0')\r\n print(string)", "borze = input()\r\nleft = 0\r\nright = 1\r\nnumber = ''\r\nwhile right <= len(borze):\r\n if left == right:\r\n right +=1\r\n elif borze[left] == '.':\r\n number += '0'\r\n left +=1\r\n elif borze[right] =='.':\r\n number +='1'\r\n right +=1\r\n left = right\r\n else:\r\n number +='2'\r\n right += 1\r\n left = right\r\nprint(number)\r\n \r\n", "s = input()\r\nn = len(s)\r\nres=''\r\ni = 0\r\nwhile(i<n):\r\n if s[i]=='.':\r\n res+='0'\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n res+='1'\r\n if s[i+1]=='-':\r\n res+='2'\r\n i+=2\r\n\r\nprint(res)", "expression=input()\r\nx=len(expression)\r\ni=0\r\ntemp=x\r\nwhile(x>0):\r\n if(i!=temp-1):\r\n if(expression[i]=='-'):\r\n if(expression[i+1]=='-'):\r\n print('2',end='')\r\n i+=2\r\n x-=2\r\n elif(expression[i+1]=='.'):\r\n print('1',end='')\r\n i+=2\r\n x-=2\r\n else:\r\n print('0',end='')\r\n i+=1\r\n x-=1\r\n \r\n else:\r\n if(expression[i]=='.'):\r\n print('0',end='')\r\n x-=1\r\n \r\n\r\n", "def solve():\n s = str(input())\n num = ''\n i = 0\n while i<len(s):\n if s[i]=='.':\n num+='0'\n i+=1\n elif s[i]+s[i+1]=='-.':\n num+='1'\n i+=2\n elif s[i]+s[i+1]=='--':\n num+='2'\n i+=2\n print(num)\n\nif __name__ == '__main__':\n solve()", "s = input()\r\nx = s.replace('--', '2')\r\ny = x.replace('-.', '1')\r\nz = y.replace('.', '0')\r\n\r\nprint(z)\r\n", "n=input()\r\ns=list(n)\r\nk=[]\r\ni=0\r\nwhile(i<len(s)):\r\n if(s[i]=='-' and s[i+1]=='-'):\r\n k.append('2')\r\n i=i+2\r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n k.append('1')\r\n i=i+2\r\n elif(s[i]=='.'):\r\n k.append('0')\r\n i=i+1\r\ns = ''.join(k)\r\nprint(s)", "s=input()\r\ns_new=''\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n s_new+='0'\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n s_new+='1'\r\n i+=2\r\n else:\r\n s_new += '2'\r\n i+=2\r\nprint(s_new)", "crash=input()\r\nop=[]\r\ni=0\r\nwhile i<len(crash):\r\n if crash[i]=='.':\r\n op.append('0')\r\n i+=1 \r\n else:\r\n if crash[i+1]=='.':\r\n op.append('1')\r\n i+=2\r\n elif crash[i+1]=='-':\r\n op.append('2')\r\n i+=2\r\nprint(''.join(op))", "class Code:\r\n def __init__(self):\r\n self.s = input()\r\n self.res = ''\r\n\r\n def process(self):\r\n self.s = self.s.replace('--', '2')\r\n self.s = self.s.replace('-.', '1')\r\n self.s = self.s.replace('.', '0')\r\n print(self.s)\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "n=input()\r\ni=0\r\nlt=[]\r\nwhile(i<len(n)):\r\n if(n[i]=='.'):\r\n lt.append(0)\r\n i=i+1\r\n elif(n[i]=='-' and n[i+1]=='.'):\r\n lt.append(1)\r\n i=i+2\r\n else:\r\n lt.append(2)\r\n i=i+2\r\nfor i in lt:\r\n print(i,end='')", "code = input()\nborze = \"\"\n\ni = 0\n\nwhile i < len(code):\n if code[i] == \".\":\n borze += \"0\"\n i += 1\n elif code[i] == \"-\" and code[i+1] == \".\":\n borze += \"1\"\n i += 2\n elif code[i] == \"-\" and code[i+1] == \"-\":\n borze += \"2\"\n i += 2\n\nprint(borze)", "string = input()\r\ni = 0\r\nn = len(string)\r\nwhile i < n:\r\n if string[i] == '.':\r\n print(0, end = '')\r\n i += 1\r\n elif string[i] == '-':\r\n if string[i+1] == '.':\r\n print(1, end = '')\r\n else:\r\n print(2, end = '')\r\n i += 2\r\n ", "import sys\r\nimport decimal\r\nimport collections\r\nimport math\r\nimport itertools as it\r\n\r\ndef readArray(type= int):\r\n line = input()\r\n return [type(x) for x in line.split()]\r\n\r\ndef solve():\r\n digits= []\r\n s = input()\r\n dash_began = False\r\n\r\n for x in s:\r\n if dash_began:\r\n dash_began = False\r\n digits.append('1' if x == '.' else '2')\r\n\r\n else:\r\n if x == '-':\r\n dash_began= True\r\n else:\r\n # Single . found\r\n digits.append('0')\r\n\r\n print(''.join(digits))\r\n\r\nif __name__ == '__main__':\r\n # sys.stdin = open('input.txt')\r\n solve()\r\n\r\n", "s = input()\r\nflag = False\r\nfor ind in range(0, len(s)):\r\n if not flag:\r\n if s[ind] == '.':\r\n print(0, end='')\r\n continue\r\n if s[ind] == '-' and s[ind+1] == '.':\r\n flag = True\r\n print(1, end='')\r\n continue\r\n if s[ind] == '-' and s[ind] == '-':\r\n flag = True\r\n print(2, end='')\r\n continue\r\n else:\r\n flag = False\r\n continue", "s = input()\r\ns = list(s)\r\nans = \"\"\r\ni = 0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n ans+=\"0\"\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='.': ans+=\"1\"\r\n if s[i+1]=='-': ans+=\"2\"\r\n i+=2\r\nprint(ans)", "X = input()\r\ni = 0\r\nNumber = list()\r\nwhile i < len(X):\r\n if X[i] == '-' and X[i + 1] == '-':\r\n Number.append(2)\r\n i += 2\r\n elif X[i] == '-' and X[i + 1] == '.':\r\n Number.append(1)\r\n i += 2\r\n else:\r\n Number.append(0)\r\n i += 1\r\nprint(*Number, sep=\"\")\r\n", "dict_t = {\r\n \".\":\"0\",\r\n \"-.\":\"1\",\r\n \"--\":\"2\"\r\n}\r\n\r\ndef dp(s,k):\r\n if s == '':\r\n return k\r\n\r\n if dict_t.get(s[0:2],-1) != -1 :\r\n k += dict_t.get(s[0:2],-1)\r\n return dp(s[2:],k)\r\n\r\n if dict_t.get(s[0],-1) != -1 :\r\n k += dict_t.get(s[0],-1)\r\n return dp(s[1:],k)\r\n \r\ns = input()\r\n\r\nk = ''\r\n\r\nprint(dp(s,k))", "s = input()\r\nd = {'.' : '0','-.':'1','--':'2'}\r\nk = ''\r\nans = ''\r\nfor i in s:\r\n k += i\r\n if k in d:\r\n ans += d[k]\r\n k = ''\r\nprint(ans)", "str = input()\r\nl = []\r\nn = len(str)\r\ni = 0\r\nwhile i < n:\r\n if str[i] == \".\":\r\n l.append(\"0\")\r\n i = i + 1\r\n else:\r\n if str[i + 1] == \".\":\r\n l.append(\"1\")\r\n i = i + 2\r\n else:\r\n l.append(\"2\")\r\n i = i + 2\r\nstr1 = ''.join(l)\r\nprint(str1)\r\n ", "string = input()\r\nanswer = \"\"\r\ncount = 0\r\nwhile(count < len(string)):\r\n if string[count] == \".\":\r\n answer += \"0\"\r\n count = count+1\r\n elif string[count:count+2] == \"-.\":\r\n answer += \"1\"\r\n count = count+2\r\n else:\r\n answer += \"2\"\r\n count += 2\r\nprint(answer)\r\n", "code = input()\r\nfor _ in range(len(code)):\r\n code = code.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\nprint(code)", "input_string = input() \r\nlist = input_string.split() \r\ntruelist = [i.replace('--','2')for i in list] \r\nnewlist = [i.replace('-.','1')for i in truelist] \r\nnew = [i.replace('.','0')for i in newlist] \r\nn = ''.join(map(str,new)) \r\nprint(n) \r\n", "s=input()\r\nj=0\r\nwhile(1):\r\n if(j>=len(s)):\r\n break\r\n elif(s[j]=='-' and s[j+1]=='.'):\r\n print('1',end=\"\")\r\n j+=2\r\n elif(s[j]=='-' and s[j+1]=='-'):\r\n print('2',end=\"\")\r\n j+=2\r\n else:\r\n print('0',end=\"\")\r\n j+=1", "import sys, os, inspect\r\n\r\nINT_MIN = -sys.maxsize -1\r\nINT_MAX = sys.maxsize\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(\"debug.txt\", \"w\")\r\n\r\n# Used to find name of variable\r\ndef retrieve_name(var):\r\n callers_local_vars = inspect.currentframe().f_back.f_back.f_locals.items()\r\n return [var_name for var_name, var_val in callers_local_vars if var_val is var]\r\n\r\n# Can pass any type of data type to this function\r\ndef debug(*argv):\r\n\tfor i in range(len(argv)):\r\n\t\tsys.stderr.write(retrieve_name(argv[i])[0]+' = '+ str(argv[i]))\r\n\t\tsys.stderr.write(\"\\n\")\r\n\r\n# Used to find EOF\r\ndef EOF(): return sys.stdin.tell() == os.fstat(sys.stdin.fileno()).st_size\r\n\r\n# Code Goes Here\r\ndef solve():\r\n\ts = input()\r\n\tans = ''\r\n\ti=0\r\n\twhile i < (len(s)):\r\n\t\tif s[i] == '.':\r\n\t\t\tans+='0'\r\n\t\tif i<len(s)+1:\r\n\t\t\tif s[i]=='-' and s[i+1] == '.':\r\n\t\t\t\tans+='1'\r\n\t\t\t\ti+=1\r\n\t\t\tif s[i]=='-' and s[i+1]=='-':\r\n\t\t\t\tans+='2'\r\n\t\t\t\ti+=1\r\n\t\ti+=1\r\n\t# if s[-1]=='.':\r\n\t# \tans+='0'\r\n\tprint(ans)\r\n\r\n# Driver Code\r\nif __name__ == \"__main__\":\r\n solve()", "v1=input();v1=v1.replace('--','2').replace('-.','1').replace('.','0');print(v1)", "s = list(input())\r\n\r\nitem = ''\r\n\r\nwhile len(s) > 0:\r\n if s[0] == '.':\r\n del s[0]\r\n item = item + '0'\r\n elif s[0] == '-' and s[1] == '.':\r\n del s[0:2]\r\n item = item + '1'\r\n else:\r\n del s[0:2]\r\n item = item + '2'\r\n\r\nprint(item)", "x = input()\r\ni = 0\r\nwhile i < len(x):\r\n if x[i] == '.':\r\n print('0', end='')\r\n elif x[i] == '-' and x[i+1] =='.':\r\n print('1', end='')\r\n i += 1\r\n elif x[i] == '-' and x[i+1] =='-':\r\n print('2', end='')\r\n i += 1\r\n i +=1 \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "code = input()\r\n\r\nzero = '.'\r\none = '-.'\r\ntwo = '--'\r\n\r\ncode = code.replace(two, '2')\r\ncode = code.replace(one, '1')\r\ncode = code.replace(zero, '0')\r\n\r\nprint(code)", "n = input()\r\nl = len(n)\r\ni = 0\r\nwhile(i<l):\r\n if(n[i] == '.'):\r\n print(0, end='')\r\n i += 1\r\n elif(n[i] == '-' and n[i+1] == '.'):\r\n print(1, end='')\r\n i += 2\r\n elif(n[i] == '-' and n[i+1] == '-'):\r\n print(2, end='')\r\n i += 2", "s=input()\r\nstr=list(s)\r\nans=''\r\nfor i in range(0,len(s)-1):\r\n\tif(str[i]=='-' and str[i+1]=='-'):\r\n\t\tans=ans+'2'\r\n\t\tstr[i]='@'\r\n\t\tstr[i+1]='@'\r\n\telif(str[i]=='-' and str[i+1]=='.'):\r\n\t\tans=ans+'1'\r\n\t\tstr[i]='@'\r\n\t\tstr[i+1]='@'\r\n\telif(str[i]=='.'):\r\n\t\tans=ans+'0'\r\n\t\tstr[i]='@'\r\nif(str[len(str)-1]=='.'):\r\n\tans=ans+'0'\r\nprint(ans)", "def sol(stri):\r\n mapp = {\".\":0,\"-.\":1,\"--\":2}\r\n temp = \"\"\r\n code = \"\"\r\n for x in range(len(stri)):\r\n temp += stri[x]\r\n if temp in mapp:\r\n code+=str(mapp[temp])\r\n temp = \"\"\r\n print(code)\r\n\r\nstri = input()\r\nsol(stri)", "s=input()\r\ndic={\".\":0,\r\n \"-.\":1,\r\n \"--\":2}\r\ni=0\r\nj=0\r\nres=\"\"\r\nwhile j<len(s):\r\n if s[i:j+1] in dic:\r\n res=res+str(dic[s[i:j+1]])\r\n j=j+1\r\n i=j\r\n\r\n else:\r\n j=j+1\r\nprint(res)", "q = list(input())\r\nres = []\r\ni = 0\r\nwhile i < len(q):\r\n if i+1 < len(q) and q[i] == '-' :\r\n if q[i+1] == '-':\r\n res.append('2')\r\n elif q[i+1] == '.':\r\n res.append('1')\r\n i += 2\r\n continue\r\n if q[i] == '.':\r\n res.append('0')\r\n i += 1\r\nprint(''.join(res))\r\n ", "##solution_a2oz_4 ladder\r\nborze_code=input()\r\ni=0\r\nresult=\"\"\r\nwhile i<len(borze_code) :\r\n if borze_code[i]==\".\" :\r\n result=result+\"0\"\r\n i=i+1\r\n else : \r\n result=result+\"1\" if borze_code[i+1]==\".\" else result+\"2\" \r\n i=i+2 \r\nprint(result)", "s = input()\r\n\r\ntemp = ''\r\nres = ''\r\n\r\nfor i in s:\r\n temp = f'{temp}{i}'\r\n\r\n if temp == '.':\r\n res = f'{res}{0}'\r\n temp = ''\r\n\r\n elif temp == '-.':\r\n res = f'{res}{1}'\r\n temp = ''\r\n\r\n elif temp == '--':\r\n res = f'{res}{2}'\r\n temp = ''\r\n\r\n else:\r\n continue\r\n\r\nprint(res)\r\n", "s=input()\r\nnew=\"\"\r\nlis=[\"--\",\"-.\",\".\"]\r\nfor i in lis:\r\n if(i==\"--\"):\r\n new=s.replace(i,\"2\")\r\n elif(i==\"-.\") :\r\n new=s.replace(i,\"1\")\r\n elif(i==\".\") :\r\n new=s.replace(\".\",\"0\")\r\n s=new\r\nprint(new)\r\n\r\n", "s=input()\r\ni=0\r\nans=\"\"\r\nwhile(i<len(s)):\r\n if(s[i]=='-'):\r\n if(i<len(s)-1 and s[i+1]=='-'):\r\n ans=ans+'2'\r\n else:\r\n ans=ans+'1'\r\n i+=2\r\n else:\r\n ans=ans+'0'\r\n i+=1\r\nprint(ans)", "message = list(input())\r\ndecoded = \"\"\r\n\r\n\r\ni = 0\r\nwhile i < len(message): #note that i will never be equivilant to len of message due to the < operator\r\n if message[i] == \".\":\r\n decoded += \"0\"\r\n elif (message[i] == \"-\") and (message[i + 1] == \".\"):\r\n decoded += \"1\"\r\n i += 1\r\n elif (message[i] == \"-\") and (message[i + 1] == \"-\"):\r\n decoded += \"2\"\r\n i += 1\r\n i += 1\r\n\r\nprint(decoded)\r\n", "string = input()\r\nres = \"\"\r\ni = 0\r\nwhile(i<len(string)):\r\n if string[i]=='.':\r\n res = res + \"0\"\r\n i+=1\r\n elif string[i]=='-' and string[i+1]=='.':\r\n res = res+ \"1\"\r\n i+=2\r\n elif string[i]=='-' and string[i+1]=='-':\r\n res = res+\"2\"\r\n i+=2\r\nprint(res)\r\n ", "from sys import stdout\r\ns=input()\r\nn=len(s)\r\ni=0\r\nwhile i<n:\r\n if s[i]=='-':\r\n i+=1\r\n stdout.write('1' if s[i]=='.' else '2')\r\n else:\r\n stdout.write('0')\r\n i+=1", "n = input() # vhodnie dannie\r\nn = n.replace(\"--\", \"2\") # perestanovka\r\nn = n.replace(\"-.\", \"1\") #perestanovka\r\nn = n.replace(\".\", \"0\")#perestanovka\r\nprint(n) #otvet\r\n# esli pomenyat poryadok replace budet neverni otvet , tak kak nepravilno budut schitivat dannie", "def broze():\r\n inp = input()\r\n inp=inp.replace(\"--\",\"2\")\r\n inp = inp.replace(\"-.\",\"1\")\r\n inp = inp.replace(\".\",\"0\")\r\n print(inp)\r\nbroze()", "from itertools import product\r\nfrom math import ceil\r\n\r\ndef binary_table(string_with_all_characters, length_to_make):\r\n return [''.join(x) for x in product(string_with_all_characters, repeat=length_to_make)]\r\n\r\n\r\ndef all_possible_substrings(string):\r\n return [string[i: j] for i in range(len(string)) for j in range(i + 1, len(string) + 1)]\r\n\r\n\r\ndef number_of_substrings(length):\r\n return int(length * (length + 1) / 2)\r\n\r\n\r\n#for enumeration in range(int(input())):\r\ncode = list(input())\r\ndecoded = ''\r\nwhile code:\r\n if code[0] == '.':\r\n del code[0]\r\n decoded += '0'\r\n elif code[0] == '-':\r\n if code[1] == '.':\r\n decoded += '1'\r\n del code[0]\r\n del code[0]\r\n elif code[1] == '-':\r\n decoded += '2'\r\n del code[0]\r\n del code[0]\r\n\r\nprint(decoded)", "li = list(input())\r\ni = 0\r\nk = \"\"\r\nwhile i<len(li):\r\n if li[i]=='-' and li[i+1] =='-':\r\n k = k + \"2\"\r\n i += 2\r\n elif li[i] == '-' and li[i+1] == '.':\r\n k = k + '1'\r\n i +=2\r\n else:\r\n k = k + '0'\r\n i += 1\r\nprint(k)", "s=input()\r\nx=\"\"\r\nn=len(s)\r\ni=0\r\nwhile i<n:\r\n if s[i]=='-':\r\n if s[i+1]=='-':\r\n x+='2'\r\n i+=2\r\n elif s[i+1]=='.':\r\n x+='1'\r\n i+=2\r\n elif s[i]=='.':\r\n x+='0'\r\n i+=1 \r\nprint(x)", "\"\"\" *** Author--Saket Saumya ***\n IIITM\n\"\"\"\nimport math\nfrom sys import stdin\n\ndef si():\n\treturn str(input())\ndef ii():\n return int(input())\ndef mi():\n return map(int, input().split())\ndef li():\n return list(mi())\n\na=input()\na=a.replace('--','2')\na=a.replace('-.','1')\na=a.replace('.','0')\nprint(a)\n", "x=input()\r\ncount=0\r\nwhile count<len(x):\r\n if x[count]=='.':\r\n print(0,end='')\r\n count+=1\r\n else:\r\n print([1,2][x[count]+x[count+1]=='--'],end='')\r\n count+=2", "stri = input()\r\nout = \"\"\r\ni = 0\r\nwhile i < len(stri):\r\n if stri[i] == \"-\":\r\n if stri[i + 1] == \"-\":\r\n out += \"2\"\r\n i += 2\r\n elif stri[i + 1] == \".\":\r\n out += \"1\"\r\n i += 2\r\n\r\n else:\r\n break\r\n elif stri[i] == \".\":\r\n out += \"0\"\r\n i += 1\r\nprint(out)", "#32B - Borze\r\nn,y,i=input(),str(),0\r\nwhile i<len(n):\r\n if n[i]==\"-\":\r\n if n[i+1]==\".\":\r\n y+=\"1\"\r\n else:\r\n y+=\"2\"\r\n i+=2\r\n else:\r\n y+=\"0\"\r\n i+=1\r\nprint(y)", "s=input()\r\nn=\"\"\r\nz=\"\"\r\nif s[0]=='.':\r\n n=\"0\"\r\nelse :\r\n z=\"-\"\r\nfor i in range(1,len(s)):\r\n if s[i]==\"-\" and z==\"-\":\r\n n=n+\"2\"\r\n z=\"\"\r\n elif s[i]==\".\" and z==\"-\":\r\n n=n+\"1\"\r\n z=\"\"\r\n elif s[i]==\".\" and z==\"\":\r\n n=n+\"0\"\r\n elif s[i]==\"-\":\r\n z=\"-\"\r\nprint(n)\r\n \r\n \r\n \r\n", "borzeCode = input()\r\nzero = \".\"\r\none = \"-.\"\r\ntwo = \"--\"\r\npos = 0\r\nresult = \"\"\r\nwhile pos < len(borzeCode):\r\n code = borzeCode[pos]\r\n if pos != len(borzeCode) - 1:\r\n code += borzeCode[pos + 1]\r\n if code == one:\r\n result += \"1\"\r\n pos += 2\r\n elif code == two:\r\n result += \"2\"\r\n pos += 2\r\n else:\r\n result += \"0\"\r\n pos += 1\r\nprint(result)", "br=input()\r\nch=\"\"\r\ni=0\r\nwhile(i<len(br)):\r\n if br[i]=='.':\r\n ch+='0'\r\n else:\r\n i+=1\r\n if br[i]=='.':\r\n ch+='1'\r\n else:\r\n ch+='2'\r\n i+=1\r\n \r\nprint(ch)\r\n", "cipher = input()\r\nmatch = ['.', '-.', '--']\r\n\r\nfor i in range(len(match) - 1, -1, -1):\r\n cipher = cipher.replace(match[i], str(i))\r\n\r\nprint(cipher)\r\n", "from functools import lru_cache\r\nimport sys\r\nimport math\r\n\r\nmod = 10**9+7\r\ninf = float('inf')\r\ndef arrInt(): return list(map(int, input().split()))\r\n\r\n\r\ndef solve(s):\r\n s = s.replace('--', '2').replace('-.', '1').replace('.', '0')\r\n print(s)\r\n\r\n\r\nif 1 == 2:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nelse:\r\n input = sys.stdin.readline\r\n\r\ns = input()\r\nsolve(s)\r\n", "s=input()\r\nn=str('')\r\ni=0\r\nwhile i <len(s):\r\n if s[i] == '.':\r\n n+= str(0)\r\n if s[i] == '-':\r\n if s[i+1] == '.':\r\n n+= str(1)\r\n i+=1\r\n else:\r\n n+= str(2)\r\n i+=1\r\n i+=1\r\nprint(n)\r\n\n# Sat Oct 10 2020 11:26:48 GMT+0300 (Москва, стандартное время)\n", "a=list(input())\r\ns=0\r\nwhile s==0:\r\n if len(a)==0:exit()\r\n if len(a)>1:\r\n if a[0]=='-' and a[1]=='.':print(1,end='');del a[0];del a[0]\r\n elif a[0]==a[1]=='-':print(2,end='');del a[0];del a[0]\r\n else:print(0,end='');del a[0]\r\n else:print(0,end='');del a[0]", "s=str(input())\r\nd=''\r\ni=0\r\n# print(len(s))\r\nwhile(i<len(s)):\r\n if(s[i]==\".\"):\r\n d=d+'0'\r\n i=i+1\r\n# print(d)\r\n elif(s[i]=='-' and s[i+1]=='-'):\r\n d=d+'2'\r\n# print(d)\r\n i=i+2\r\n \r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n d=d+'1'\r\n# print(d)\r\n i=i+2 \r\nprint(d) \r\n \r\n", "s=input()\r\nn=''\r\ni=0\r\nwhile i<(len(s)):\r\n if s[i]=='.':\r\n n+='0'\r\n else:\r\n if s[i+1]=='-':\r\n n+='2'\r\n else:\r\n n+='1'\r\n i+=1\r\n i+=1\r\nprint(n)", "string_in_Borze = input()\r\nanswer = ''\r\ni = 0\r\nwhile len(string_in_Borze) > i:\r\n if string_in_Borze[i] == \"-\" and string_in_Borze[i + 1] == \"-\":\r\n answer += \"2\"\r\n i += 1\r\n elif string_in_Borze[i] == \"-\" and string_in_Borze[i + 1] == \".\":\r\n answer += \"1\"\r\n i += 1\r\n else:\r\n answer += \"0\"\r\n i += 1\r\nprint(answer)", "input_str = input()\r\n\r\nindex = 0\r\nwhile index < len(input_str):\r\n if input_str[index] == '.':\r\n print(\"0\", end=\"\")\r\n elif input_str[index] == '-' and input_str[index + 1] == '.':\r\n print(\"1\", end=\"\")\r\n index += 1\r\n elif input_str[index] == '-' and input_str[index + 1] == '-':\r\n print(\"2\", end=\"\")\r\n index += 1\r\n index += 1\r\n\r\nprint() ", "borze = input()\r\n\r\nprint(borze.replace('--','2').replace('-.','1').replace('.','0'))", "s = input()\r\ni = 0\r\nl = []\r\nwhile i < len(s):\r\n if s[i] =='.': \r\n l.append('0')\r\n i+=1\r\n else:\r\n if s[i+1] == '.':\r\n l.append('1')\r\n else:\r\n l.append('2') \r\n i+=2\r\nprint(''.join(l))", "s = str(input())\r\n#lis = [ x for x in s.split(\".\")]\r\nlis = list(s)\r\n#print(lis)\r\nlis1=[]\r\nwhile(lis!=[]):\r\n if lis[0] == \".\":\r\n lis.pop(0)\r\n lis1.append(\"0\")\r\n elif lis[0] ==\"-\":\r\n \r\n if lis[1] == \".\":\r\n lis.pop(1)\r\n lis1.append(\"1\")\r\n else:\r\n lis.pop(1)\r\n lis1.append(\"2\")\r\n lis.pop(0)\r\n #print(lis) \r\nfor x in lis1:\r\n print(x, end=\"\")", "s = input()\r\ni = 0\r\nl = list(s)\r\naux = []\r\nwhile i < len(s):\r\n i += 1\r\n if l.pop(0) == '.':\r\n aux.append('0')\r\n else:\r\n i += 1\r\n if l.pop(0) == '.':\r\n aux.append('1')\r\n else:\r\n aux.append('2')\r\nprint(''.join(aux))", "n =input()\r\na = []\r\ni=0\r\nwhile i<len(n) :\r\n if n[i]=='-':\r\n if n[i+1]=='.':\r\n a.append(1)\r\n elif n[i+1]=='-':\r\n a.append(2)\r\n i=i+2\r\n elif n[i]=='.':\r\n a.append(0)\r\n i=i+1\r\nprint(*a, sep=\"\")", "b = input()\r\nx = []\r\nflag = 0\r\nfor c in b:\r\n if(c == '.'):\r\n if(flag == 0):\r\n x.append('0')\r\n else:\r\n x.append('1')\r\n flag = 0\r\n elif(c == '-'):\r\n if(flag == 0):\r\n flag = 1\r\n else:\r\n flag = 0\r\n x.append('2')\r\n\r\nprint(''.join(x))\r\n", "plain_text = \"\"\r\nfull_number = False\r\nborze_code = input()\r\nborze_code = list(borze_code)\r\n\r\n\r\nwhile(borze_code):\r\n if borze_code[0] == '.':\r\n plain_text += '0'\r\n del(borze_code[0])\r\n elif borze_code[1] == '.':\r\n plain_text += '1'\r\n del(borze_code[0])\r\n del(borze_code[0])\r\n else:\r\n plain_text += '2'\r\n del(borze_code[0])\r\n del(borze_code[0])\r\n \r\n\r\nprint(plain_text)\r\n\r\n", "def main():\r\n string = input()\r\n\r\n i = 0\r\n answer = \"\"\r\n while i < len(string):\r\n if string[i] == \".\":\r\n answer += \"0\"\r\n i += 1\r\n elif string[i] == \"-\":\r\n if string[i + 1] == \".\":\r\n answer += \"1\"\r\n else:\r\n answer += \"2\"\r\n i += 2\r\n print(answer)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "s = input()\r\nsolution,i = [],0\r\nif len(s) == 1:\r\n print('0')\r\n i+=1\r\nwhile (i < len(s)):\r\n if s[i] == '.':\r\n solution.append('0');i+=1;\r\n elif s[i] == '-' and s[i+1] == '.':\r\n solution.append('1');i+=2;\r\n else:\r\n solution.append('2');i+=2;\r\nprint(\"\".join(solution))", "h = input()\r\nr = \"\"\r\ni = 0\r\nwhile i < len(h):\r\n if h[i] == \".\":\r\n r += '0'\r\n else:\r\n i += 1\r\n if h[i] == \".\":\r\n r += '1'\r\n else:\r\n r += '2'\r\n i += 1\r\n\r\nprint(r)", "t = input() + ' '\nnums = []\nm = {\n '.': 0,\n '-.': 1,\n '--': 2\n}\nif len(t) == 1:\n nums.append(0)\nelse:\n i = 0\n while i < len(t) - 1:\n if t[i] + t[i + 1] in m:\n nums.append(str(m[t[i] + t[i + 1]]))\n i += 2\n else:\n nums.append(str(m[t[i]]))\n i += 1\n\nprint(''.join(nums))", "s=input()\r\nn=len(s)\r\nr=\"\"\r\ni=0\r\nwhile i<n:\r\n if s[i]==\".\":\r\n r+=\"0\"\r\n i+=1\r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n r+=\"1\"\r\n i+=2\r\n else:\r\n r+=\"2\"\r\n i+=2\r\nprint(r)", "def Convert(string): \r\n list1=[] \r\n list1[:0]=string \r\n return list1 \r\n\r\ns = str(input())\r\nlst = Convert(s)\r\nfans = ''\r\n\r\nwhile len(lst) > 0:\r\n if lst[0] == '.':\r\n lst.pop(0)\r\n fans += '0'\r\n elif lst[0] == '-':\r\n if lst[1] == '.':\r\n lst.pop(0)\r\n lst.pop(0)\r\n fans += '1'\r\n elif lst[1] == '-':\r\n lst.pop(0)\r\n lst.pop(0)\r\n fans += '2'\r\n\r\nprint(fans)", "string = input()\r\n\r\ni = 0\r\nwhile i < len(string):\r\n if string[i] == \".\":\r\n print(0,end=\"\")\r\n i -= 1\r\n elif string[i:i+2] == \"-.\":\r\n print(1,end=\"\")\r\n else:\r\n print(2,end=\"\")\r\n i += 2\r\n\r\n", "s = input()\r\nres = ''\r\ni = 0\r\nwhile i + 1 <= len(s):\r\n res += ('0' if s[i] == '.' else ('2' if s[i + 1] == '-' else '1'))\r\n i += (1 if s[i] == '.' else 2)\r\nprint(res)\r\n", "def borze(n):\r\n if n == \".-\":\r\n return \"0\"\r\n elif n == \"-.\":\r\n return \"1\"\r\n else:\r\n return \"2\"\r\nl = input()\r\n\r\nn = \"\"\r\ni = 0\r\nwhile i < len(l):\r\n if l[i] == \".\":\r\n n += \"0\"\r\n i += 1\r\n else:\r\n n += borze(l[i:i+2])\r\n i += 2\r\nprint(n)\r\n\r\n", "a=input()\r\nk=''\r\nfor i in a:\r\n \r\n k+=i\r\n if k=='.':\r\n print(0,end='')\r\n k=''\r\n if k=='-.':\r\n print(1,end='')\r\n k=''\r\n if k=='--':\r\n print(2,end='')\r\n k=''\r\n", "from sys import stdin\r\nimport math\r\ninp = lambda : stdin.readline().strip()\r\n\r\ns = inp()\r\nn = len(s)\r\ni = 0\r\nans = []\r\nwhile i<n:\r\n\tif s[i] == \".\":\r\n\t\tans.append(0)\r\n\telse:\r\n\t\tif s[i+1] == \"-\":\r\n\t\t\tans.append(2)\r\n\t\telse:\r\n\t\t\tans.append(1)\r\n\t\ti+=1\r\n\ti+=1\r\nprint(\"\".join(map(str, ans)))", "code=input()\r\nnumber=[]\r\ni=0\r\nwhile i<len(code):\r\n if code[i]=='-' and code[i+1]=='.':\r\n number.append(1)\r\n i+=2\r\n elif code[i]=='-' and code[i+1]=='-':\r\n number.append(2)\r\n i+=2\r\n else:\r\n number.append(0)\r\n i+=1\r\n# print(number)\r\n\r\nfor i in number:\r\n print(i,end='')\r\n\r\n#advantage of using i=0 and i+=1 and i+=2 so that once we take\r\n# '-.' then we check the next sign and not the '.' again\r\n\r\n\r\n", "\r\nvar = input()\r\n\r\ntam = len(var)\r\ncont = 0\r\nnumero = \"\"\r\nwhile cont < tam:\r\n if var[cont] == \".\" :\r\n numero += \"0\"\r\n cont += 1\r\n elif var[cont] == \"-\" and var[cont+1] == \".\":\r\n numero += \"1\"\r\n cont += 2\r\n elif var[cont] == \"-\" and var[cont+1] == \"-\":\r\n numero += \"2\"\r\n cont += 2\r\n\r\nprint(numero)", "#!/usr/bin/env python3\n# coding:utf-8\n\nif __name__ == \"__main__\":\n d = input()\n s = \"\"\n i = 0\n while i < len(d):\n if d[i] == \".\":\n s += \"0\"\n i += 1\n else:\n if d[i + 1] == \"-\":\n s += \"2\"\n else:\n s += \"1\"\n i += 2\n print(s)\n", "st=input()\r\nnew=''\r\ni=0\r\nwhile(i<len(st)):\r\n if st[i]=='.':\r\n new+=str(0)\r\n i=i+1\r\n elif st[i]=='-' and st[i+1]=='.':\r\n new+=str(1)\r\n i=i+2\r\n else:\r\n new+=str(2)\r\n i=i+2\r\nprint(new)", "s=list(input())\r\nres=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if i==len(s)-1:\r\n res=res+\"0\"\r\n break\r\n elif s[i]==\".\":\r\n res=res+\"0\"\r\n i+=1\r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n res=res+\"1\"\r\n i+=2\r\n elif s[i]==\"-\" and s[i+1]==\"-\":\r\n res=res+\"2\"\r\n i+=2 \r\nprint(res)\r\n\r\n\r\n ", "s=input()\r\nn=len(s)\r\nc=0\r\nr=''\r\nwhile(c<n):\r\n if(s[c]=='.'):\r\n r=r+'0'\r\n c=c+1\r\n elif(s[c]=='-' and s[c+1]=='.'):\r\n r=r+'1'\r\n c=c+2\r\n elif(s[c]=='-' and s[c+1]=='-'):\r\n r=r+'2'\r\n c=c+2\r\nprint(r)\r\n", "c = input()\r\ni = 0\r\nwhile i<len(c) :\r\n if c[i] == '-' and c[i+1] == '-' :\r\n print(2,end = \"\")\r\n i = i+2\r\n elif c[i] == '-' and c[i+1] == '.' :\r\n print(1,end = \"\")\r\n i = i+2\r\n elif c[i] == '.' :\r\n print(0,end = \"\")\r\n i = i+1\r\n", "string = input()\ni = 0\nwhile i < len(string):\n if string[i] == '.':\n print(0, end='')\n elif string[i] == '-' and string[i + 1] == '.':\n print(1, end='')\n i += 1\n else:\n print(2, end='')\n i += 1\n i += 1\n", "x = input()\r\ny = []\r\ni = 0\r\n\r\nwhile i < len(x):\r\n if x[i] == \".\":\r\n y.append(\"0\")\r\n i += 1\r\n elif x[i] == \"-\":\r\n if x[i+1] == \".\":\r\n y.append(\"1\")\r\n i += 2\r\n elif x[i+1] == \"-\":\r\n y.append(\"2\")\r\n i += 2\r\n\r\nprint(\"\".join(y))", "def physicist():\n c = list(input())\n\n sol = ''\n i = 0\n while i < len(c):\n if c[i] == '.':\n sol += '0'\n i += 1\n elif c[i] == '-':\n if c[i + 1] == '.':\n sol += '1'\n else:\n sol += '2'\n i += 2\n print(sol)\n\n\nif __name__ == '__main__':\n physicist()\n", "s=input()\ni=0\nk=\"\"\nwhile(True):\n\tif s[i]=='.':\n\t\tk+='0'\n\t\ti+=1\n\telif s[i]=='-' and s[i+1]=='-':\n\t\tk+='2'\n\t\ti+=2\n\telif s[i]=='-' and s[i+1]=='.':\n\t\tk+='1'\n\t\ti+=2\n\tif i>=len(s):\n\t\tbreak\nprint(k)", "s=input()\r\np=''\r\ni=0\r\nl=len(s)\r\nwhile(i<l):\r\n if(i<l-1 and s[i]=='-' and s[i+1]=='.'):\r\n i+=1\r\n print('1',end=\"\")\r\n elif(i<l-1 and s[i]=='-' and s[i+1]=='-'):\r\n i+=1\r\n print('2',end=\"\")\r\n elif(s[i]=='.'):\r\n print('0',end=\"\")\r\n i+=1\r\n#print(p) \r\n", "s = input()\r\nskip = 0\r\nfor j, i in enumerate(s):\r\n if skip > 0:\r\n skip -= 1\r\n continue\r\n if i == '.':\r\n print(0, end=\"\")\r\n elif i == '-' and s[j+1] == '.':\r\n print(1, end=\"\")\r\n skip = 1\r\n else:\r\n print(2, end=\"\")\r\n skip = 1", "s=input()\r\np=''\r\ni=0\r\nl=len(s)\r\nwhile(i<l):\r\n if(i<l-1 and s[i]=='-' and s[i+1]=='.'):\r\n i+=1\r\n p=p+'1'\r\n elif(i<l-1 and s[i]=='-' and s[i+1]=='-'):\r\n i+=1\r\n p=p+'2'\r\n elif(s[i]=='.'):\r\n p=p+'0'\r\n i+=1\r\nprint(p) \r\n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\n\r\n\r\ndef main():\r\n s = input()\r\n i = 0\r\n ans = ''\r\n while i < len(s):\r\n if s[i] == '.':\r\n ans += '0'\r\n i += 1\r\n elif s[i] == '-' and s[i+1] == '.':\r\n ans += '1'\r\n i += 2\r\n else:\r\n ans += '2'\r\n i += 2\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "characters=input()\r\na='.';b='-.';c='--'\r\ns=characters.replace(c,'2').replace(b,'1').replace(a,'0')\r\nprint(s)\r\n", "s=input()\r\nn=len(s)\r\ns2=''\r\nindex=0\r\nwhile True:\r\n if(index>=n):\r\n break\r\n else:\r\n if(s[index]=='.'):\r\n s2+='0'\r\n index+=1\r\n elif(s[index]=='-' and s[index+1]=='.'):\r\n s2+='1'\r\n index+=2\r\n else:\r\n s2+='2'\r\n index+=2\r\nprint(s2)", "bern=input()\ni=0\nout=[]\nwhile i<=len(bern)-1:\n if i<len(bern)-1 and bern[i]=='-' and bern[i+1]=='-':\n out.append('2')\n i+=2\n elif i<len(bern)-1 and bern[i]=='-' and bern[i+1]=='.':\n out.append('1')\n i+=2\n elif bern[i]=='.':\n out.append('0')\n i+=1\n else:\n break\nprint(\"\".join(out))\n ", "borze = input()\r\nl=[i for i in borze]\r\nk=''\r\n\r\nfor i in range(len(l)-1):\r\n if l[i]=='.':\r\n k+='0'\r\n l[i]='0'\r\n elif l[i]=='-' and l[i+1]=='.':\r\n k+='1'\r\n l[i]='0'\r\n l[i+1] = '0'\r\n elif l[i] == '-' and l[i+1] == '-':\r\n k+='2'\r\n l[i] = '0'\r\n l[i + 1] = '0'\r\n\r\n\r\nif l[-1:]==['.']:\r\n k+='0'\r\n\r\nprint(k)", "pattern = input()\r\nzero=\".\"\r\none=\"-.\"\r\ntwo=\"--\"\r\ntemp=''\r\nres=''\r\nfor ele in pattern:\r\n temp +=ele\r\n if temp==zero:\r\n res+='0'\r\n temp=''\r\n elif temp==one:\r\n res+='1'\r\n temp=''\r\n elif temp==two:\r\n res+='2'\r\n temp=''\r\nprint(res)", "i=input()\r\nc=\"\"\r\nwhile len(i)>0:\r\n g=2\r\n if i[0] == \".\":\r\n c+=\"0\"\r\n g=1\r\n elif i[0] == \"-\" and i[1] == \"-\":\r\n c+=\"2\"\r\n else:\r\n c+=\"1\"\r\n i=i[g:]\r\nprint(c)", "y=input()\r\nprint(y.replace('--','2').replace('-.','1').replace('.','0'))\r\n", "s=input()\r\nss=''\r\ni=0\r\nwhile i<len(s):\r\n\tif s[i]=='.':\r\n\t\tss=ss+'0'\r\n\telif s[i]=='-':\r\n\t\tif s[i+1]=='-':\r\n\t\t\tss=ss+'2'\r\n\t\telif s[i+1]=='.':\r\n\t\t\tss=ss+'1'\r\n\t\ti=i+1\r\n\ti=i+1\r\nprint(ss)", "n = input()\r\nres_str = \"\"\r\ni = 0\r\nwhile (i < len(n)):\r\n if (i+1 < len(n) and n[i] == '-' and n[i+1] == '.'):\r\n res_str += '1'\r\n i = i+2\r\n elif ((i+1 < len(n)) and (n[i] == '-' and n[i+1] == '-')):\r\n res_str += '2'\r\n i = i + 2\r\n else:\r\n res_str += '0'\r\n i = i+1\r\nprint(res_str)\r\n", "s=input()\r\nl=len(s)\r\nx=\"\"\r\np1=0\r\np2=1\r\nwhile(p1<l or p2<l):\r\n if(s[p1]==\"-\" and s[p2]==\".\"):\r\n x=x+\"1\"\r\n p1=p1+2\r\n p2=p2+2\r\n elif(s[p1]==\"-\" and s[p2]==\"-\"):\r\n x=x+\"2\"\r\n p1=p1+2\r\n p2=p2+2\r\n elif(s[p1]==\".\"):\r\n x=x+\"0\"\r\n p1=p1+1\r\n p2=p2+1\r\nprint(x)\r\n ", "a = list(input())\r\not = ''\r\nwhile a:\r\n if a[0] == '.':\r\n ot+='0'\r\n a.pop(0)\r\n else:\r\n if a[1] == '-':\r\n ot+='2'\r\n a.pop(0)\r\n a.pop(0)\r\n else:\r\n ot+='1'\r\n a.pop(0)\r\n a.pop(0)\r\nprint(ot)\r\n \r\n", "\"\"\"\r\nm=input()\r\na=[]\r\nonetaken=False\r\ntwotaken=False\r\nfor i in range(len(m)-1):\r\n if onetaken:\r\n onetaken=False\r\n continue\r\n if twotaken:\r\n twotaken=False\r\n continue\r\n if m[i]=='.':\r\n if i==0:\r\n a.append(0)\r\n if m[i]=='-':\r\n if m[i+1]=='.':\r\n a.append(1)\r\n onetaken = True\r\n if m[i+1]=='-':\r\n a.append(2)\r\n twotaken = True\r\n if m[i]=='.' and twotaken==False and onetaken==False:\r\n a.append(0)\r\n\r\nprint(a)\r\n\"\"\"\r\nstr = input()\r\nlength = len(str)\r\nres = \"\"\r\nc = 0\r\nif length == 1 and str[0] == '.':\r\n print(0)\r\n c=1\r\n \r\nwhile c < length - 1:\r\n \r\n if str[c] == \".\":\r\n if str[c + 1] == \".\":\r\n res += \"00\"\r\n c += 1\r\n elif str[c + 1] == '-':\r\n res += '0'\r\n \r\n elif str[c] == '-':\r\n if str[c + 1] == '.':\r\n res += '1'\r\n c += 1\r\n elif str[c + 1] == \"-\":\r\n res += \"2\"\r\n c += 1\r\n c += 1\r\n if (c == length - 1 and str[c] == '.'):\r\n res += '0'\r\n \r\nprint(res)", "code = input()\n\ni = 0; ans = \"\"\n\nwhile i < len(code):\n if i+1 == len(code):\n ans += '0'\n elif code[i] == '.':\n ans += '0'\n elif code[i+1] == '.':\n ans += '1'\n i += 1\n else:\n ans += '2'\n i += 1\n i += 1\n\nprint(ans)\n\n\t \t\t\t \t\t\t\t\t \t\t\t \t\t\t", "borze = input()\r\nborze = [x for x in borze]\r\ni=0\r\nnum = []\r\nwhile(i<len(borze)):\r\n if(borze[i]=='.'):\r\n num.append('0')\r\n i+=1\r\n elif(borze[i]=='-'):\r\n if(borze[i+1]=='.'):\r\n num.append('1')\r\n else:\r\n num.append('2')\r\n i+=2\r\nnumStr = \"\"\r\nfor ele in num:\r\n numStr += ele\r\nprint(numStr)", "k = list(input())\r\no = ''\r\nwhile k:\r\n\tif k.pop(0)=='.':\r\n\t\to += '0'\r\n\telif k.pop(0)=='.':\r\n\t\to += '1'\r\n\telse:\r\n\t\to += '2'\r\nprint(o)", "a=input()\r\nprint(a.replace('--', '2').replace('-.', '1').replace('.','0'))\r\n\r\n# бірінші инпут бердік\r\n#екіншісіне replace(<old>,<new>) деген бойынша нүкте сызықшаны ,санға ауыстырдым\r\n#мысалға : a=(foo,moo,boo)\r\n# print(a.replace(foo,too) )\r\n#сонда принт :too,moo,boo", "s = input()\r\nn = len(s)\r\nl = 0\r\nwhile l < n:\r\n if s[l] == '.':\r\n print(0, end='')\r\n l += 1\r\n elif s[l+1] == '.':\r\n print(1, end='')\r\n l += 2\r\n else:\r\n print(2, end='')\r\n l += 2", "r = []\r\ncode = list(str(input()))\r\n\r\nwhile len(code) >= 1:\r\n if code[0] == \".\":\r\n r.append(\"0\")\r\n code.pop(0)\r\n elif code[0] == \"-\":\r\n if code[1] == \".\":\r\n r.append(\"1\")\r\n for i in range(2):\r\n code.pop(0)\r\n elif code[1] == \"-\":\r\n r.append(\"2\")\r\n for i in range(2):\r\n code.pop(0)\r\n else:\r\n pass\r\n\r\nprint(''.join(r)) ", "s = input()\r\n\r\nZERO = '.'\r\nONE = '-.'\r\nTWO = '--'\r\n\r\ny = \"\"\r\n\r\ni=0\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n y += '0'\r\n i += 1\r\n elif s[i] == '-':\r\n if s[i+1] == '.':\r\n y += '1'\r\n i += 2\r\n elif s[i+1] == '-':\r\n y += '2'\r\n i += 2\r\n\r\nprint(y)", "s = input()\r\nms = []\r\ni=1\r\nwhile(i<=len(s)):\r\n if s[i-1] =='-' and s[i]=='.':\r\n ms.append('1')\r\n i+=2\r\n elif s[i-1] =='-' and s[i]=='-':\r\n ms.append('2')\r\n i += 2\r\n elif s[i-1] == '.':\r\n ms.append('0')\r\n i+=1\r\n\r\nprint(*ms,sep=\"\")", "l=input()\r\ns=\"\"\r\ni=0\r\nn=len(l)\r\nwhile(i<len(l)):\r\n if(l[i:i+2]==\"--\"):\r\n s=s+\"2\"\r\n i=i+2\r\n elif(l[i:i+2]==\"-.\"):\r\n s=s+\"1\"\r\n i=i+2\r\n elif(l[i]==\".\"):\r\n s=s+\"0\"\r\n i=i+1\r\n else:\r\n i=i+1\r\nprint(s)\r\n", "# URL: https://codeforces.com/problemset/problem/32/B\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\ns = inp().decode()\ni = 0\nans = []\nwhile i < len(s):\n if s[i] == '.':\n ans.append('0')\n i += 1\n elif s[i:i + 2] == '-.':\n ans.append('1')\n i += 2\n else:\n ans.append('2')\n i += 2\nout(''.join(ans))\n", "#n,t = map(int,input().split())\r\nl=list(map(list,input().split()))\r\nn = ''\r\ni=0\r\nwhile i < len(l[0]):\r\n if l[0][i] == '.':\r\n n=n+'0'\r\n i+=1\r\n elif l[0][i] == '-' and l[0][i+1] == '.':\r\n n=n+'1'\r\n i+=2\r\n elif l[0][i] == '-' and l[0][i+1] == '-':\r\n n=n+'2'\r\n i+=2\r\nprint(n)\r\n\r\n", "s = input()\r\nz = \"\"\r\ni, n = 0, len(s)\r\nb = False\r\nwhile (i < n):\r\n if (s[i] == '.'):\r\n if b:\r\n z += '1'\r\n b = False\r\n else:\r\n z += '0'\r\n if (s[i] == '-'):\r\n if b:\r\n z += '2'\r\n b = False\r\n else:\r\n b = True\r\n i += 1\r\nprint(z)", "import sys\r\nimport os.path\r\nimport math\r\nfrom sys import stdin,stdout\r\nfrom collections import*\r\nfrom math import gcd,ceil,floor\r\nmod = int(1e9+7)\r\n##input=sys.stdin.readline\r\nif os.path.exists('Updated prg/Input3d.txt'):\r\n sys.stdout=open(\"Updated prg/Output3d.txt\",\"w\")\r\n sys.stdin=open(\"Updated prg/Input3d.txt\",\"r\")\r\ndef sinp():return input()\r\ndef ninp():return int(sinp())\r\ndef mapinp():return map(int,sinp().split())\r\ndef linp():return list(mapinp())\r\ndef sl():return list(sinp())\r\ndef prnt(a):print(a)\r\ns1=sinp()\r\ns2=\"\"\r\ni=0\r\nwhile i<len(s1):\r\n if s1[i]==\"-\" and s1[i+1]==\"-\":\r\n s2=s2+\"2\"\r\n i=i+2\r\n elif s1[i]==\"-\" and s1[i+1]==\".\":\r\n s2=s2+\"1\"\r\n i=i+2\r\n else:\r\n s2=s2+\"0\"\r\n i=i+1\r\nprnt(s2)", "s = input()\r\nn = len(s)\r\nnum = []\r\ni = 0\r\nlast = 'x'\r\nwhile i < n:\r\n if s[i] == '.':\r\n if last == '-':\r\n num.append('1')\r\n else:\r\n num.append('0')\r\n last = 'x'\r\n elif s[i] == '-':\r\n if last == '-':\r\n num.append('2')\r\n last = 'x'\r\n elif last == '.':\r\n last = '-'\r\n else:\r\n last = '-'\r\n i += 1\r\nprint(''.join(num))", "a=input()\nb=[]\ni=int(0)\nwhile i<len(a):\n\tif a[i]==\".\":\n\t\tb.append(\"0\")\n\t\ti+=1\n\telif a[i]==\"-\":\n\t\tif a[i+1]==\".\":\n\t\t\tb.append(\"1\")\n\t\t\ti+=2\n\t\telif a[i+1]==\"-\":\n\t\t\tb.append(\"2\")\n\t\t\ti+=2\nprint(\"\".join(b))", "s = input()\r\nz = ''\r\nwhile True:\r\n if len(s)==0:\r\n break\r\n if s.find('.') == 0:\r\n z += '0'\r\n s = s[1::]\r\n elif s.find('-.') == 0:\r\n z += '1'\r\n s = s[2::]\r\n elif s.find('--') == 0:\r\n z += '2'\r\n s = s[2::]\r\nprint(z)\r\n\r\n", "n=input()\r\nans=''\r\n# for i in range(0,len(n)):\r\ni=0\r\nwhile i<len(n):\r\n if(n[i]=='.'):\r\n ans=ans+'0'\r\n i+=1\r\n else:\r\n if(n[i+1]=='.'):\r\n ans=ans+'1'\r\n i=i+2\r\n else:\r\n ans=ans+'2'\r\n i=i+2\r\n\r\nprint(ans) ", "stack = str()\r\n\r\ns = input()\r\n\r\nfor i in s:\r\n stack += i\r\n if stack == '-.':\r\n print(1, end = '')\r\n stack = str()\r\n if stack == '.':\r\n print(0, end = '')\r\n stack = str()\r\n if stack == '--':\r\n print(2, end = '')\r\n stack = str()", "def main():\r\n\tinpString = input()\r\n\tcounter = 0\r\n\toutput = \"\"\r\n\tsize = len(inpString)\r\n\twhile(counter<size):\r\n\t\tif inpString[counter] == \".\":\r\n\t\t\toutput += str(0)\r\n\t\t\tcounter += 1\r\n\t\telif inpString[counter: counter+2] ==\"-.\":\r\n\t\t\toutput += str(1)\r\n\t\t\tcounter += 2\r\n\t\telif inpString[counter: counter+2] == \"--\":\r\n\t\t\toutput += str(2)\r\n\t\t\tcounter += 2\r\n\r\n\tprint(output)\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "inp = input()\r\ni = 0\r\nans = ''\r\nwhile i < len(inp):\r\n if inp[i] == '.':\r\n ans += '0'\r\n i += 1\r\n else:\r\n if inp[i+1] == '.':\r\n ans += '1'\r\n else:\r\n ans += '2'\r\n i += 2\r\nprint(ans)", "#0 as «.», 1 as «-.» and 2 as «--»\\\r\np=input()\r\ni=0\r\nn=len(p)\r\ns=\"\"\r\nwhile(i<n):\r\n if p[i]==\".\":\r\n s+=\"0\"\r\n i+=1\r\n else:\r\n if i<n-1 and p[i+1]==\".\":\r\n s+=\"1\"\r\n i+=2\r\n elif i<n-1 and p[i+1]==\"-\":\r\n s+=\"2\"\r\n i+=2\r\nprint(s)\r\n\r\n \r\n ", "x=input()\r\ni=0\r\ns=\"\"\r\nwhile i<len(x):\r\n if x[i]==\".\":\r\n s=s+\"0\"\r\n i=i+1\r\n elif x[i]==\"-\" and (x[i+1]==\".\"):\r\n s=s+\"1\"\r\n i=i+2\r\n elif x[i]==\"-\" and (x[i+1]==\"-\"):\r\n s=s+\"2\"\r\n i=i+2\r\nprint(s)\r\n", "def pyt(s):\r\n x = \"\"\r\n i = 0\r\n while i < len(s):\r\n if s[i] == \"-\":\r\n if s[i + 1] == \".\":\r\n x += \"1\"\r\n else:\r\n x += \"2\"\r\n i += 2\r\n else:\r\n x += \"0\"\r\n i += 1\r\n return x\r\n\r\nprint(pyt(input()))", "x = input()\r\nn = len(x)\r\ni = 0\r\nout = ''\r\nwhile (i<n):\r\n if (x[i]== '.'):\r\n out+='0'\r\n i+=1\r\n elif(x[i]=='-'):\r\n if x[i+1]=='.':\r\n out+='1'\r\n elif x[i+1]=='-':\r\n out+='2'\r\n i+=2\r\nprint(out)", "s = input()\r\ncode = []\r\nfor i in s:\r\n code.append(i)\r\n\r\noutput = ''\r\n\r\nwhile len(code)>0:\r\n if code[0] == '-':\r\n if code[1] == '.':\r\n output = output+'1'\r\n code = code[2:]\r\n elif code[1] == '-':\r\n output = output+'2'\r\n code = code[2:]\r\n elif code[0] == '.':\r\n output = output+'0'\r\n code = code[1:]\r\n\r\nprint(output)\r\n", "s = input()\r\n\r\nans = list()\r\n\r\nwhile len(s)>0:\r\n if s[0] == '.':\r\n s = s[1:]\r\n ans.append('0')\r\n #break\r\n elif s[0:2] == '-.':\r\n s = s[2:]\r\n ans.append('1')\r\n #break\r\n elif s[:2] == '--':\r\n s = s[2:]\r\n ans.append('2')\r\n #break\r\n\r\nprint(''.join(ans))\r\n", "a=input()\r\nb=''\r\ni=0\r\nwhile i<len(a):\r\n if a[i]==\"-\" and a[i+1]==\"-\":\r\n b=b+'2'\r\n i=i+2\r\n elif a[i]=='-' and a[i+1]=='.':\r\n b=b+'1'\r\n i=i+2\r\n elif a[i]=='.':\r\n b=b+'0'\r\n i=i+1\r\nprint(b)\r\n", "s = str(input())\r\nl = len(s)\r\nflag = 0\r\nfor i in range(l):\r\n if(flag == 1):\r\n flag = 0\r\n continue\r\n if(i < l-1):\r\n if(s[i]==\"-\" and s[i+1] == \"-\"):\r\n flag = 1\r\n print(\"2\",end=\"\")\r\n elif(s[i]==\"-\" and s[i+1]==\".\"):\r\n flag = 1\r\n print(\"1\",end=\"\")\r\n else:\r\n print(\"0\",end=\"\")\r\n else:\r\n print(\"0\",end=\"\")", "s=input()\r\nl=[]\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n l.append('0')\r\n elif s[i]=='-'and s[i+1]=='.':\r\n l.append('1')\r\n i+=1\r\n elif s[i]=='-'and s[i+1]=='-':\r\n l.append('2')\r\n i+=1\r\n i+=1\r\nprint(\"\".join(l))", "# !usr/bin/python3\ns=input()\nn=0\nf=['']*len(s)\nfor i in range(len(s)):\n f[i] = s[i]\nfor i in range(len(s)) :\n if i+n == len(s):\n break\n if f[i+n] == '.':\n print('0',end='')\n elif f[i+n] == '-':\n if f[i+n+1] == '.':\n print('1',end='')\n elif f[i+n+1] == '-':\n print('2',end='')\n if i+n+1 == len(s)-1:\n break\n n=n+1\n", "cb = input()\r\ntt = \"\"\r\ni = 0\r\nwhile i < len(cb):\r\n if cb[i] == '.':\r\n tt+= '0'\r\n elif cb[i] == '-':\r\n if cb[i + 1] == '.':\r\n tt+= '1'\r\n elif cb[i + 1] == '-':\r\n tt += '2'\r\n i += 1 \r\n i += 1\r\n\r\nprint(tt)\r\n", "text = input()\r\nwhile text != \"\":\r\n if(text[0]) == \".\": \r\n print(\"0\",end=\"\")\r\n text=text[1:]\r\n if(text[0:2]) == \"-.\":\r\n print(\"1\",end=\"\")\r\n text=text[2:] \r\n if(text[0:2]) == \"--\":\r\n print(\"2\",end=\"\")\r\n text=text[2:]\r\n ", "s = input()\r\nx = list(s)\r\nout = ''\r\nfor i,j in enumerate(x):\r\n if(j!=''):\r\n if j == '.':\r\n out += '0'\r\n if j == '-':\r\n if x[i+1] == '.':\r\n out +='1'\r\n x[i+1]=''\r\n else:\r\n x[i+1]=''\r\n out+='2'\r\nprint(out)", "n = input();n = n.replace(\"--\",\"2\");n = n.replace(\"-.\",\"1\");n = n.replace(\".\",\"0\");print(n)", "s = input()\r\nans = \"\"\r\nc = len(s)\r\nl = len(s)\r\nwhile c >= 1:\r\n if(s[l-c] == \".\"):\r\n ans += \"0\"\r\n c -= 1\r\n elif(s[l-c] == \"-\" and s[l-c+1] == \".\"):\r\n ans += \"1\"\r\n c -= 2\r\n elif(s[l-c] == \"-\" and s[l-c+1] == \"-\"):\r\n ans += \"2\"\r\n c -= 2\r\nprint(ans)\r\n", "s = input()\r\nflag = 0\r\nans = \"\"\r\nfor i in range(len(s)):\r\n if s[i]==\".\" and flag==0:\r\n ans = ans + \"0\"\r\n elif s[i]==\"-\" and flag==0:\r\n flag = 1\r\n elif s[i]==\"-\" and flag==1:\r\n ans = ans + \"2\"\r\n flag = 0\r\n elif s[i]==\".\" and flag==1:\r\n ans = ans + \"1\"\r\n flag = 0\r\n\r\nprint(ans)", "l=input()\n# l=list(st)\ns=''\nf=''\ni=0\nwhile(i<len(l)):\n if(l[i]==\".\"):\n f=f+'0'\n i=i+1\n elif(i!=len(l)-1 and l[i]=='-'):\n if(l[i+1]=='.'):\n f=f+'1'\n else:\n f=f+'2'\n i=i+2\n# s=st[i:i+2]\n# if(s==\".-\"):\n# f=f+'0'\n# elif(s==\"-.\"):\n# i=i+2\n# f=f+'1'\n# elif(s==\"--\"):\n# i=i+1\n# f=f+'2'\n \nprint(f)\n \n", "a=input()\r\nv=0\r\nwhile v<len(a):\r\n if a[v]=='-':\r\n if a[v+1]=='-':\r\n print(2,end='')\r\n v+=2\r\n elif a[v+1]=='.':\r\n print(1,end='')\r\n v+=2\r\n else:\r\n print(0,end='')\r\n v+=1", "string = input ()\r\nnum = ''\r\npos = 0\r\nwhile pos < len (string):\r\n if string [pos] == '.':\r\n num += '0'\r\n pos += 1\r\n else:\r\n pos += 1\r\n if string [pos] == '.':\r\n num += '1'\r\n else:\r\n num += '2'\r\n pos += 1\r\nprint (num)", "s = list(input())\r\nn = len(s)\r\nres = []\r\ni = 0 \r\nwhile(n > 0):\r\n if s[0] == '.':\r\n res.append('0')\r\n s.pop(0)\r\n n -= 1\r\n elif s[1] == '.':\r\n res.append('1')\r\n s.pop(0)\r\n s.pop(0)\r\n n -= 2\r\n else:\r\n res.append('2')\r\n s.pop(0)\r\n s.pop(0)\r\n n -= 2\r\nprint(\"\".join(res))", "if __name__ == \"__main__\":\r\n barzecode = str(input(\"\"))\r\n decoded = barzecode.replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\n print(decoded)", "print(str.replace(str.replace(str.replace(input(),'--','2'),'-.','1'),'.','0'))", "q=input()\r\nq=q.replace('--','2')\r\nq=q.replace('-.','1')\r\nq=q.replace('.','0')\r\nprint(q)\r\n", "s=input()\r\nd=\"\"\r\ni=0\r\nwhile (i<len(s)):\r\n if (s[i]==\".\"):\r\n d+='0'\r\n else:\r\n i+=1\r\n if (s[i]==\".\"):\r\n d+='1'\r\n else:\r\n d+='2'\r\n i+=1\r\nprint(d)", "abcd = input()\r\nress = \"\"\r\ni = 0\r\nwhile i < len(abcd):\r\n if abcd[i] == \".\":\r\n ress += '0'\r\n else:\r\n i += 1\r\n if abcd[i] == \".\":\r\n ress += '1'\r\n else:\r\n ress += '2'\r\n i += 1\r\n\r\nprint(ress)", "s = input()\r\nl = len(s)\r\ni = 0\r\nborze = ''\r\nwhile i < l:\r\n if s[i] == '.':\r\n borze += '0'\r\n else:\r\n if s[i+1] == '.':\r\n borze += '1'\r\n else:\r\n borze += '2'\r\n i += 1\r\n i += 1\r\nprint(borze)", "s=input()\r\nn=0\r\nans=\"\"\r\nfor i in s:\r\n if i=='.':\r\n if n==0:\r\n ans+='0'\r\n else:\r\n n-=1\r\n ans+='1'\r\n if i=='-':\r\n if n==0:\r\n n+=1\r\n else:\r\n n-=1\r\n ans+='2'\r\nprint(ans)\r\n ", "code = str(input())\r\n\r\ni=0\r\nresult=\"\"\r\n\r\nwhile i <= (len(code)-1):\r\n\tif code[i]=='-' and code[i+1]=='.':\r\n\t\ti+=2\r\n\t\tresult += \"1\"\r\n\telif code[i]=='-' and code[i+1]=='-':\r\n\t\ti+=2\r\n\t\tresult += \"2\"\r\n\telse:\r\n\t\ti+=1\r\n\t\tresult += \"0\"\r\n\r\nprint(result) \r\n", "import string\r\nimport math\r\nimport time\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\ndef lcm(x, y):\r\n return (x*y)//gcd(x,y)\r\n\r\n\r\ncode = input()\r\ndecode = \"\"\r\ni = 0 \r\nwhile i < len(code):\r\n if code[i] == \".\":\r\n decode += \"0\"\r\n i += 1\r\n elif code[i + 1]== \".\":\r\n decode += \"1\"\r\n i += 2\r\n else:\r\n decode += \"2\"\r\n i += 2\r\nprint(decode)\r\n\r\n# start = time.process_time()\r\n#calculate time here\r\n# print(time.process_time() - start)", "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#write your code here\r\nw = input()\r\nw = w.replace(\"--\",\"2\")\r\nw = w.replace(\"-.\",\"1\")\r\nw = w.replace(\".\",\"0\")\r\n\r\nprint(w)\r\n \r\n\r\n\r\nif(path.exists('input.txt')):\r\n sys.stdin.close()\r\n sys.stdout.close()", "x = input()\r\ns = ''\r\ni = 0\r\nwhile i < len(x):\r\n if x[i] == '.':\r\n s += '0'\r\n i += 1\r\n elif x[i] == '-' and x[i + 1] == '.':\r\n s += '1'\r\n i += 2\r\n elif x[i] == '-' and x[i + 1] == '-':\r\n s += '2'\r\n i += 2\r\nprint(s)", "s = input()\r\na = []\r\ni = 0\r\nwhile(i <len(s)):\r\n if s[i] == \".\":\r\n a.append(0)\r\n i += 1\r\n elif s[i] == \"-\" and s[i+1] == \".\":\r\n a.append(1)\r\n i += 2\r\n elif s[i] == \"-\" and s[i+1] == \"-\":\r\n a.append(2)\r\n i += 2\r\nfor i in a:\r\n print(i,end=\"\")", "def fun(s,a):\r\n if len(s)==0:\r\n return a\r\n if s[0]=='.':\r\n a+='0'\r\n s1=s[1:]\r\n return fun(s1,a)\r\n elif s[0:2]=='-.':\r\n a+='1'\r\n s1=s[2:]\r\n return fun(s1,a)\r\n elif s[0:2]=='--':\r\n a+='2'\r\n s1=s[2:]\r\n return fun(s1,a)\r\n\r\n_=input()\r\na=''\r\nprint(fun(_,a))", "a=input();i=0;b=\"\"\r\nwhile i<len(a) :\r\n if a[i]==\".\" :\r\n b+=\"0\";i+=1\r\n elif a[i]==\"-\" :\r\n if a[i+1]==\"-\" :\r\n b+=\"2\";i+=2\r\n elif a[i+1]==\".\" :\r\n b+=\"1\";i+=2\r\nprint(b)", "code = input()\r\nn = len(code)\r\nlookup = {\r\n '.':'0',\r\n \"-.\":'1',\r\n \"--\":'2',\r\n}\r\nans = \"\"\r\ni = 0\r\nwhile(i < n):\r\n if(code[i:i+2] == \"-.\" or code[i:i+2] == \"--\"):\r\n ans += lookup[code[i:i+2]]\r\n i += 2\r\n else:\r\n ans += lookup.get(code[i:i+1], '')\r\n i += 1\r\nprint(ans)\r\n", "def borze_code_decoder(borze_code: list)-> str:\r\n decoded_string = list()\r\n index = 0\r\n while index < len(borze_code):\r\n if borze_code[index] == '.':\r\n decoded_string.extend('0')\r\n elif index < len(borze_code) - 1 and borze_code[index] == '-':\r\n if borze_code[index + 1] == '.':\r\n decoded_string.extend('1')\r\n else:\r\n decoded_string.extend('2')\r\n index += 1\r\n index += 1\r\n return ''.join(decoded_string)\r\n\r\ndef main():\r\n borze_code = input().strip()\r\n print(borze_code_decoder(list(borze_code)))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "m = input()\r\ni = 0\r\nl = []\r\nwhile(i<len(m)):\r\n if(m[i]=='.'):\r\n l.append(0)\r\n i+=1\r\n elif(m[i]=='-'):\r\n if(m[i+1]=='.'):\r\n l.append(1)\r\n elif(m[i+1]=='-'):\r\n l.append(2)\r\n i+=2\r\nprint(''.join(str(i) for i in l))\r\n \r\n \r\n", "import sys\r\nimport math\r\nfrom math import gcd,floor,sqrt,log,ceil\r\n\r\n\r\nsys.setrecursionlimit(100000000)\r\nmod=1000000007\r\niinput =lambda: int(input())\r\nsinput =lambda: input()\r\nilist =lambda: list(map(int,input().split))\r\nslist =lambda: list(map(str,input().split))\r\nimap =lambda: map(int,input().split())\r\n\r\n\r\ndef mid(n):\r\n return ceil(n/2)\r\n\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(1):\r\n s = input()\r\n i = 0\r\n n = len(s)\r\n ans = \"\"\r\n while i < n:\r\n if s[i] == '-' and i < n-1 and s[i+1] == '.':\r\n ans += '1'\r\n i += 2\r\n elif s[i] == '-' and i < n-1 and s[i+1] == '-':\r\n ans += '2'\r\n i += 2\r\n else:\r\n ans += '0'\r\n i += 1\r\n print(ans)", "# Where: https://codeforces.com/problemset/page/8?order=BY_RATING_ASC\n\n# A. Bad Ugly Numbers\n\n# def is_last_pair(str_val):\n# if (str_val[len(str_val)-1] == \"4\" or str_val[len(str_val)-1] == \"6\" or str_val[len(str_val)-1] == \"8\"):\n# return True\n# return False\n\n# times = int(input())\n# answers = []\n# for i in range(times):\n# digits = int(input())\n# possible_number = \"\"\n# available = [2, 3, 4, 5, 6, 7, 8, 9]\n# max = 10**digits\n# min = 10**(digits-1)\n# possibles = range(min, max)\n# find = -1\n# for possible in possibles:\n# str_val = str(possible)\n# if not (str_val.find(\"1\") != -1 or str_val.find(\"0\") != -1):\n# if not (str_val[len(str_val)-1] == \"2\" or (str_val.find(\"2\") != -1 and is_last_pair(str_val))):\n# # now you can start de division\n# is_possible = True\n# for digit in str_val:\n# if possible % int(digit) == 0:\n# is_possible = False\n# break\n# if is_possible:\n# find = possible\n# break\n# answers.append(find)\n\n# for answer in answers:\n# print(answer)\n\n# https://codeforces.com/problemset/problem/1296/B\n# B. Food Buying\n# time limit per test\n# 1 second\n# memory limit per test\n# 256 megabytes\n# input\n# standard input\n# output\n# standard output\n\n# times = int(input())\n# answers = []\n# for i in range(times):\n# s = int(input())\n# temp = s\n# s = s + s//10\n# rest = temp//10 + temp % 10\n\n# while rest >= 10:\n# s = s + rest//10\n# rest = rest//10 + rest % 10\n# answers.append(s)\n\n# for answer in answers:\n# print(answer)\n\n# list_n = list(map(int, input().split()))\n# f_0 = list_n[0]\n# f_1 = list_n[1]\n# f_n = list_n[2]\n\n# map_f = {\n# 0: f_0,\n# 1: f_1\n# }\n\n# def fake_fibo(n):\n# if n == 0:\n# return f_0\n# if n == 1:\n# return f_1\n# if n == 2:\n# return f_0 ^ f_1\n# # check if the f(n) is already calculated\n# return fake_fibo(n % 3)\n\n# answer = fake_fibo(f_n)\n# print(answer)\n\n# https://codeforces.com/problemset/problem/1436/B\n\n\n# https://codeforces.com/problemset/problem/1472/A\n# cases = int(input())\n# answers = []\n# for i in range(cases):\n# list_n = list(map(int, input().split()))\n# w = list_n[0]\n# h = list_n[1]\n# n = list_n[2]\n# counter_w = 0\n# counter_h = 0\n\n# while w % 2 == 0 and w > 0:\n# w = w // 2\n# counter_w += 1\n# while h % 2 == 0 and h > 0:\n# h = h // 2\n# counter_h += 1\n# r = (2 ** counter_w) * (2 ** counter_h)\n# if r >= n:\n# answers.append(\"YES\")\n# else:\n# answers.append(\"NO\")\n\n# for answer in answers:\n# print(answer)\n\n# B. Two Arrays And Swaps\n# https://codeforces.com/problemset/problem/1353/B?f0a28=1\n\n# times = int(input())\n# for i in range(times):\n# list_options = list(map(int, input().split()))\n# size = list_options[0]\n# swaps = list_options[1]\n# list_a = list(map(int, input().split()))\n# list_a.sort()\n# list_b = list(map(int, input().split()))\n# list_b.sort()\n\n# for i in range(swaps):\n# # Try a swap, if is less or equal break\n# if list_a[i] > list_b[size - i - 1]:\n# break\n# list_a[i] = list_b[size - i - 1]\n# print(sum(list_a))\n\n# A. Buggy Sorting\n# https://codeforces.com/problemset/problem/246/A\n# loop integer variable i from 1 to n - 1\n# loop integer variable j from i to n - 1\n# if (aj > aj + 1), then swap the values of elements aj and aj + 1\n\n# lst = [2, 3, 4]\n# for i in range(len(lst) - 1):\n# j = i\n# print(\"i:\" + str(i))\n# for j in range(len(lst) - 1):\n# if lst[j] > lst[j + 1]:\n# swap = lst[j]\n# lst[j] = lst[j + 1]\n# lst[j + 1] = swap\n# print(lst)\n\n# https://leetcode.com/problems/permutation-in-string/\n# 567. Permutation in String\n\n# def get_in_map(word):\n# in_map = {}\n# for letter in word:\n# if letter in in_map:\n# # increase the counter it\n# in_map[letter] = in_map[letter] + 1\n# else:\n# # add it\n# in_map[letter] = 1\n# return in_map\n\n\n# in_str = \"abc\"\n# parent_str = \"asdasacmbs\"\n# contains_permutation = False\n# in_map = get_in_map(in_str)\n\n# for i in range(len(parent_str) - len(in_str) + 1):\n\n# if parent_str[i] in in_map:\n# # pointer to start\n# temp_in_map = in_map.copy()\n# is_valid = True\n# for j in range(len(in_str)):\n# current_letter = parent_str[i + j]\n# if not (current_letter in temp_in_map):\n# is_valid = False\n# break\n# temp_in_map[current_letter] = temp_in_map[current_letter] - 1\n# if temp_in_map[current_letter] == 0:\n# del temp_in_map[current_letter]\n# if len(temp_in_map) > 0:\n# is_valid = False\n# if is_valid:\n# contains_permutation = True\n# break\n# if contains_permutation:\n# print(True)\n# else:\n# print(False)\n\n# https://codeforces.com/problemset/problem/1472/B\n# B. Fair Division\n\n# times = int(input())\n# for time in range(times):\n# counter = input()\n# listInput = list(map(int, input().split()))\n# # Sum\n# ones = 0\n# twos = 0\n# for number in listInput:\n# if number == 1:\n# ones += 1\n# if number == 2:\n# twos += 1\n# if ones % 2 != 0 or (twos % 2 != 0 and ones == 0):\n# print(\"NO\")\n# else:\n# print(\"YES\")\n\n# https://codeforces.com/problemset/problem/32/B\n# B. Borze\n# Digit 0 is transmitted as «.», 1 as «-.» and 2 as «--».\nborzeCode = input()\nzero = \".\"\none = \"-.\"\ntwo = \"--\"\npos = 0\nresult = \"\"\nwhile pos < len(borzeCode):\n if pos == len(borzeCode) - 1:\n result += \"0\"\n pos += 1\n break\n code = borzeCode[pos] + borzeCode[pos + 1]\n if code == one:\n result += \"1\"\n pos += 2\n elif code == two:\n result += \"2\"\n pos += 2\n else:\n result += \"0\"\n pos += 1\nprint(result)\n", "s = str(input())\r\n_ = 0\r\nwhile _ < len(s):\r\n if s[_] == \".\":\r\n print(0,end=\"\")\r\n _ = _ +1\r\n elif not (not (s[_] == \"-\") or not (s[_ + 1] == \".\") or _ + 1 > len(s)):\r\n print(1,end=\"\")\r\n _ = _ + 2\r\n else:\r\n print(2,end=\"\")\r\n _=_+2\r\n\r\n\r\n\r\n", "s=list(input())\r\nn=''\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n n=n+'0'\r\n elif s[i]=='-' and s[i+1]=='.':\r\n n=n+'1'\r\n del s[i]\r\n elif s[i]=='-' and s[i+1]=='-':\r\n n=n+'2'\r\n del s[i]\r\n i=i+1\r\nprint(n)", "ZERO = '.'\r\nONE = '-.'\r\nTWO = '--'\r\nstring = input()\r\nstring = string.replace(TWO, '2')\r\nstring = string.replace(ONE, '1')\r\nstring = string.replace(ZERO, '0')\r\nprint(string)", "s = input()\r\nindex = 0\r\nres = []\r\nwhile index < len(s):\r\n if s[index] == '.':\r\n res.append('0')\r\n index+=1\r\n elif s[index] == '-':\r\n if s[index + 1] == '.':\r\n res.append('1')\r\n else:\r\n res.append('2')\r\n index+=2\r\nprint(''.join(res))", "# https://codeforces.com/problemset/problem/32/B\r\n\r\n\r\nstack = list()\r\nans = \"\"\r\nfor i in input():\r\n if not stack:\r\n if i == \".\":\r\n ans += \"0\"\r\n else:\r\n stack.append(i)\r\n else:\r\n if i == \".\":\r\n ans += \"1\"\r\n else:\r\n ans += \"2\"\r\n stack.pop()\r\n\r\nprint(ans)\r\n", "a=input()\r\ni=0\r\nd=\"\"\r\nwhile i<len(a):\r\n if a[i]==\".\":\r\n d+=\"0\"\r\n i+=1\r\n elif a[i]+a[i+1]==\"--\":\r\n d+=\"2\"\r\n if i==len(a)-1:\r\n break\r\n i+=2\r\n else:\r\n d+=\"1\"\r\n i+=2\r\nprint(d)", "a=input()\r\nn = len(a)\r\ns=[]\r\ni=0\r\nwhile i<n:\r\n if a[i]=='.':\r\n s.append('0')\r\n i+=1\r\n elif a[i]=='-' and a[i+1]=='.':\r\n s.append('1')\r\n i+=2\r\n else:\r\n s.append('2')\r\n i+=2\r\nprint(''.join(s))", "s = input()\r\nan = []\r\ni = 0\r\nwhile True:\r\n if s[i] == \".\":\r\n an.append(0)\r\n i += 1\r\n else:\r\n if (i+1) < len(s):\r\n if s[i+1] == \"-\":\r\n an.append(2)\r\n else:\r\n an.append(1)\r\n i += 2\r\n if i >= len(s):\r\n break\r\nprint(*an, sep=\"\")", "str = input()\r\nx = 0\r\n\r\nwhile x < len(str):\r\n if str[x] == '.':\r\n print(0, end=\"\")\r\n elif str[x] == '-' and str[x + 1] == '.':\r\n print(1, end=\"\")\r\n x += 1 # skip\r\n elif str[x] == '-' and str[x + 1] == '-':\r\n print(2, end=\"\")\r\n x += 1 # skip\r\n\r\n x += 1\r\n", "s = input()\r\na = 0\r\nres = ''\r\nwhile a <= len(s) - 1:\r\n if ((s[a]) == '.' and len(res) == 0):\r\n res += '0'\r\n a += 1\r\n elif(a < len(s)):\r\n if(s[a] == '-' and s[a + 1] == '.'):\r\n res += '1'\r\n a += 2\r\n elif(s[a] == '-' and s[a + 1] == '-'):\r\n res += '2'\r\n a += 2\r\n else:\r\n res += '0'\r\n a += 1\r\nprint(res)\r\n", "def convert_input_string_to_number_representation():\r\n input_str = input().strip()\r\n result = \"\"\r\n index = 0\r\n while index < len(input_str):\r\n if input_str[index] == '.':\r\n result += \"0\"\r\n elif input_str[index] == '-' and input_str[index + 1] == '.':\r\n result += \"1\"\r\n index += 1\r\n elif input_str[index] == '-' and input_str[index + 1] == '-':\r\n result += \"2\"\r\n index += 1\r\n index += 1\r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n output = convert_input_string_to_number_representation()\r\n print(output)", "s=input()\r\ni=0\r\nk=len(s)\r\nwhile i<k:\r\n if s[i]==\"-\":\r\n if s[i+1]==\".\":\r\n print(1,end=\"\")\r\n i=i+2\r\n else:\r\n print(2,end=\"\")\r\n i=i+2\r\n else:\r\n print(0,end=\"\")\r\n i=i+1", "bcode=input()\r\nnum=\"\"\r\nlength=len(bcode)\r\ni=0\r\nwhile i<length:\r\n if bcode[i]==\".\":\r\n num=num+\"0\"\r\n #print(num)\r\n i+=1\r\n elif bcode[i]==\"-\" and i!=length-1:\r\n if bcode[i+1]==\".\":\r\n num=num+\"1\"\r\n i+=2\r\n\r\n else:\r\n num=num+\"2\"\r\n i+=2\r\nprint(num)", "\r\ns = input()\r\n\r\ni = 0\r\nd = \"\"\r\nwhile i < len(s):\r\n\r\n if (s[i] == \".\"):\r\n d += \"0\"\r\n i+=1\r\n \r\n else:\r\n if s[i+1] == \".\":\r\n d+= \"1\"\r\n else:\r\n d+= \"2\"\r\n i+=2\r\n\r\nprint(d)", "d={'.':'0','-.':'1','--':'2'}\r\ns=input()\r\na=''\r\ne=''\r\nfor i in s:\r\n e+=i\r\n if e in d.keys():\r\n a+=d[e]\r\n e=''\r\n else:\r\n pass\r\nprint(a)", "str1 = input()\r\nlist1 = list(str1)\r\nn = len(list1)\r\ni, list2=0, []\r\n\r\n\r\nwhile(i < n):\r\n if list1[i] == '.': \r\n list2.append('0')\r\n i+=1\r\n elif list1[i] == '-' and list1[i+1] == '.' :\r\n list2.append('1')\r\n i+=2\r\n elif list1[i] == '-' and list1[i+1] == '-' :\r\n list2.append('2')\r\n i+=2\r\n if i==n:\r\n break\r\nlist2 = ''.join(list2)\r\nprint(list2)", "s=input()\r\na=''\r\nk,i=len(s),0\r\nwhile i<k:\r\n if s[i]=='.':\r\n a+='0'\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n a+='1'\r\n i+=2\r\n elif s[i+1]=='-':\r\n a+='2'\r\n i+=2\r\nprint(a)\r\n", "code = input()\n\nres = \"\"\ni = 0\nwhile i < len(code): \n if code[i] == '.': \n res += '0'\n elif code[i] == '-': \n i += 1\n if i != len(code) and code[i] == '-':\n res+= '2'\n elif i != len(code) and code[i] == '.': \n res += '1'\n i += 1\nprint(res)\n", "c=input()\r\nt=c.replace('--','2')\r\nc=t.replace('-.','1')\r\nt=c.replace('.','0')\r\nprint(t)\r\n \r\n", "borze = input()\r\nl = len(borze)\r\ni = 0\r\ndecoded = ''\r\ndecode = {'.':0,'-.':1,'--':2}\r\nwhile i<l:\r\n if borze[i] == '.':\r\n decoded += '0'\r\n i += 1\r\n elif borze[i] == '-':\r\n if borze[i:i+2] == '-.':\r\n decoded += '1'\r\n elif borze[i:i+2] == '--':\r\n decoded += '2'\r\n i += 2\r\nprint(decoded)\r\n", "import sys\n\ninput = sys.stdin.readline\n\n\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 list((map(int, input().split())))\n\n\ndef solve(q):\n res = \"\"\n i = 0\n while i < len(q):\n if q[i] == \".\":\n res += \"0\"\n elif q[i] == \"-\" and q[i+1] == \".\":\n res += \"1\"\n i += 1\n else:\n res += \"2\"\n i += 1\n i += 1\n return res\n\nif __name__ == '__main__':\n q = insr()\n print(\"\".join(solve(q)))\n", "s=input()\nans=\"\"\nn=len(s);i=0\nwhile i<n:\n if s[i]==\".\":\n ans+=\"0\"\n i+=1\n else:\n if s[i:i+2]==\"-.\":\n ans+=\"1\"\n elif s[i:i+2]==\"--\":\n ans+=\"2\"\n i+=2\nprint(ans)", "input_str = input()\r\n\r\n\r\npointer = 0\r\n\r\nresult = \"\"\r\n\r\nwhile pointer < len(input_str):\r\n if input_str[pointer] == \".\":\r\n result += \"0\"\r\n pointer += 1\r\n elif input_str[pointer] == \"-\" and input_str[pointer+1] == \".\":\r\n result += \"1\"\r\n pointer += 2\r\n elif input_str[pointer] == \"-\" and input_str[pointer+1] == \"-\":\r\n result += \"2\"\r\n pointer += 2\r\n\r\nprint(result)", "s = input()\r\nn = []\r\ni = 0\r\nwhile i in range(len(s)):\r\n if s[i] == \".\":\r\n n.append(0)\r\n i += 1\r\n elif s[i] == \"-\" and s[i+1] == \".\":\r\n n.append(1)\r\n i += 2\r\n elif s[i] == \"-\" and s[i+1] == \"-\":\r\n n.append(2)\r\n i += 2\r\ni = 0\r\nfor i in range(len(n)):\r\n print(n[i], end=\"\")\r\n", "s=input()\r\na=[0]*3\r\na[0]=s.replace('--','2')\r\na[1]=a[0].replace('-.','1')\r\na[2]=a[1].replace('.','0')\r\nprint(a[2])", "string = input()\r\nres = \"\"\r\ni=0\r\nwhile i<len(string):\r\n if string[i]== '.':\r\n res+='0'\r\n \r\n elif string[i] =='-' and string[i+1]=='.':\r\n res+='1'\r\n i+=1\r\n \r\n elif string[i]=='-' and string[i+1]=='-':\r\n res+='2'\r\n i+=1\r\n \r\n i+=1\r\nprint(res)", "from sys import stdout\r\ns=input()\r\ns=s.replace('--','2')\r\ns=s.replace('-.','1')\r\ns=s.replace('.','0')\r\nstdout.write(s)", "n=input()\r\ns=''\r\ni=0\r\nwhile(i<len(n)):\r\n if n[i]=='.':\r\n s+='0'\r\n elif n[i]+n[i+1]=='-.':\r\n s=s+'1'\r\n i=i+1\r\n elif n[i]+n[i+1]=='--':\r\n s=s+'2'\r\n i=i+1\r\n i=i+1\r\nprint(s)", "# Har har mahadev\r\n# author : @harsh kanani\r\n\r\ns = input()\r\nj = 0\r\nstr = \"\"\r\nwhile j < len(s):\r\n if s[j]==\".\":\r\n str += \"0\"\r\n j += 1\r\n elif s[j]==s[j+1]:\r\n str += \"2\"\r\n j += 2\r\n elif s[j]==\"-\" and s[j+1]==\".\":\r\n str += \"1\"\r\n j += 2\r\nprint(str)", "s = input()\r\nok = False\r\nfor i in range(len(s)):\r\n if ok:\r\n # print(f'Skip at {i}')\r\n ok = False\r\n continue\r\n if s[i] == '.':\r\n print(0, end=\"\")\r\n else:\r\n if s[i:i+2] == \"-.\":\r\n print(1, end=\"\")\r\n elif s[i:i+2] == \"--\":\r\n print(2, end=\"\")\r\n ok = True", "s = input()\r\nl = list(s)\r\nst = ''\r\n\r\nfor i in range(len(l)):\r\n if l[i] != -1:\r\n if l[i] == '.':\r\n st = st+'0'\r\n elif l[i] == '-' and l[i+1] == '.':\r\n st = st+'1'\r\n l[i+1] = -1\r\n elif l[i] == '-' and l[i+1] == '-':\r\n st = st+'2'\r\n l[i+1] = -1\r\nprint(st)\r\n", "S = input()\r\nkk = 0\r\nfor i in range(len(S)):\r\n if i+kk < len(S) and S[i+kk] == '.':\r\n print(0, end='')\r\n elif i+kk < len(S) and S[i+kk] == '-' and S[i+kk+1] == '.':\r\n print(1, end = '')\r\n kk += 1\r\n elif i+kk < len(S) and S[i+kk] == '-' and S[i+kk+1] == '-':\r\n print(2, end='')\r\n kk += 1\r\n else:\r\n break\r\n", "a=input()\r\n\r\ncontador=0\r\n\r\nif a[0]==\".\":\r\n output=\"0\"\r\n contador=contador+1\r\nelif a[0:2]==\"-.\":\r\n output=\"1\"\r\n contador=contador+2\r\nelif a[0:2]==\"--\":\r\n output=\"2\"\r\n contador=contador+2\r\n\r\nwhile contador!=len(a):\r\n\r\n if a[0+contador]==\".\":\r\n output=output+\"0\"\r\n contador=contador+1\r\n elif a[0+contador:0+contador+2]==\"-.\":\r\n output=output+\"1\"\r\n contador=contador+2\r\n elif a[0+contador:0+contador+2]==\"--\":\r\n output=output+\"2\"\r\n contador=contador+2 \r\n\r\nprint (output)", "Code=input()\r\nNumber=\"\"\r\ni=0\r\nwhile i<len(Code):\r\n if Code[i]==\".\":\r\n Number+=\"0\"\r\n i=i+1\r\n elif Code[i]==\"-\" and Code[i+1]==\".\":\r\n Number+=\"1\"\r\n i=i+2\r\n elif Code[i]==\"-\" and Code[i+1]==\"-\":\r\n Number+=\"2\"\r\n i=i+2\r\nprint(Number)\r\n", "from sys import stdout\r\n\r\ns = input()\r\n\r\ni = 0\r\nwhile i <= len(s) - 1:\r\n if s[i] == '-' and s[i + 1] == '.':\r\n stdout.write('1')\r\n i += 2\r\n elif s[i] == '-' and s[i + 1] == '-':\r\n stdout.write('2')\r\n i += 2\r\n else:\r\n stdout.write('0')\r\n i += 1\r\n", "S, ans, i = input(), \"\", 0\nwhile i < len(S):\n if S[i] == '.':\n ans += '0'\n elif S[i + 1] == '.':\n ans += '1'\n i += 1\n elif S[i + 1] == '-':\n ans += '2'\n i += 1\n else: print(\"ERROR\")\n i += 1\n\nprint(ans)\n", "s = str(input())\r\nans = ''\r\nwhile(len(s) != 0):\r\n if s[0] == '.':\r\n ans += '0'\r\n s = s[1:]\r\n elif s[0] == '-' and s[1] == '.':\r\n ans += '1'\r\n s= s[2:] \r\n else:\r\n ans += '2'\r\n s = s[2:] \r\nprint(ans) \r\n", "a = input()\ne = 0\nnow = \"\"\nwhile e < len(a):\n if a[e] == \".\":\n now += \"0\"\n e += 1\n else:\n if a[e+1] == \".\":\n now += \"1\"\n else:\n now += \"2\"\n e += 2\nprint(now)\n\n# Tue Oct 13 2020 13:15:24 GMT+0300 (Москва, стандартное время)\n", "#Borze\r\n\r\nternary_Num = input()\r\n\r\n# for num in range(len(ternary_Num)):\r\n\r\nnum = 0 \r\nResult = \"\"\r\nwhile(True):\r\n\r\n\tif num >= len(ternary_Num):\r\n\t\tbreak\r\n\r\n\telif ternary_Num[num] == \".\":\r\n\t\tResult += \"0\"\r\n\t\tnum += 1\r\n\t\r\n\telif ternary_Num[num] == \"-\" and ternary_Num[num+1] == \".\":\r\n\t\tResult += \"1\"\r\n\t\tnum+=2\r\n\r\n\telif ternary_Num[num] == \"-\" and ternary_Num[num+1] == \"-\":\r\n\t\tResult += \"2\"\r\n\t\tnum+=2\r\n\t\t\r\nprint(Result)", "s = input()\r\ndash = 0\r\nfor i in range(len(s)):\r\n if dash :\r\n dash=0\r\n continue\r\n if s[i] == '.':\r\n print(0,end='')\r\n elif i+1<len(s) and s[i] == s[i+1]:\r\n print(2,end='')\r\n dash=1\r\n elif i+1<len(s) :\r\n print(1,end='')\r\n dash=1\r\n", "borze = input()\nborze_list = []\nborze_list_no = []\n\nfor x in range(len(borze)):\n borze_list.append(borze[x])\n\nindex = 0\nwhile index < len(borze_list):\n if borze_list[index] == '.':\n borze_list_no.append('0')\n index += 1\n elif borze_list[index] == '-':\n if borze_list[index + 1] == '.':\n borze_list_no.append('1')\n index += 2\n elif borze_list[index + 1] == '-':\n borze_list_no.append('2')\n index += 2\n \n\nfor y in range(len(borze_list_no)):\n print(f\"{borze_list_no[y]}\", end=\"\")\n\t\t\t\t\t \t \t\t\t \t \t \t \t \t \t", "input1 = input()\r\ninput1 = input1.replace('--','2')\r\ninput1 = input1.replace('-.','1')\r\ninput1 = input1.replace('.','0')\r\nprint(input1)\r\n", " #from _typeshed import SupportsKeysAndGetItem\r\nimport sys\r\n#sys.stdin=open(\"input.txt\",\"r\");\r\n#sys.stdout=open(\"output.txt\",\"w\")\r\n####### GLOBAL ###############\r\nMOD=1000000007\r\nno=lambda:print(\"NO\")\r\nyes=lambda:print(\"YES\")\r\n_1=lambda:print(-1)\r\nari=lambda:[int(_) for _ in input().split()]\r\ncin=lambda:int(input())\r\ncis=lambda:input()\r\nshow=lambda x: print(x)\r\n########### END #########\r\n######\r\ntest_case=1\r\n#test_case=int(input())\r\n######\r\ndef ans():\r\n n=cis()\r\n size=len(n)\r\n dito={\".\":0,\"-.\":1,\"--\":2}\r\n sol=\"\"\r\n i=0\r\n while True:\r\n if i==size:\r\n break\r\n if n[i]==\".\":\r\n sol=sol+\"0\"\r\n i=i+1\r\n continue\r\n if n[i]==\"-\":\r\n if n[i]==\"-\" and n[i+1]==\".\":\r\n sol+=\"1\"\r\n else:\r\n sol+=\"2\"\r\n i=i+2\r\n show(sol)\r\n return\r\n \r\n \r\nfor _ in range(test_case):\r\n ans()", "b = input()\nb = b.replace('--', '2')\nb = b.replace('-.', '1')\nb = b.replace('.', '0')\n\nprint(b)", "def main():\r\n n = input()\r\n res = \"\"\r\n while len(n) != 0:\r\n if n.startswith(\".\"):\r\n res += \"0\"\r\n n = n[1:]\r\n elif n.startswith(\"--\"):\r\n res += \"2\"\r\n n = n[2:]\r\n elif n.startswith(\"-.\"):\r\n res += \"1\"\r\n n = n[2:]\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "symbols = [\".\",\"-.\",\"--\"]\r\nborz = input()\r\nlis = []\r\nmlis = list(borz)\r\na = \"\"\r\n\r\nn = 0\r\ni = 0\r\nwhile i < len(mlis) :\r\n #print(i,n)\r\n #print(\"\".join(mlis[n:i+1]))\r\n \r\n if \"\".join(mlis[n:i+1]) in symbols:\r\n lis.append(\"\".join(mlis[n:i+1]))\r\n \r\n \r\n n = i+1\r\n \r\n \r\n i+=1 \r\n \r\n \r\n#print(lis) \r\ntally = {\".\":0 , \"-.\":1 , \"--\":2}\r\nfor i in lis:\r\n \r\n a += str(tally[i])\r\n \r\n \r\nprint(a) \r\n \r\n\r\n", "s = input()\r\nlens = len(s)\r\nl = [] \r\ni =0\r\nwhile(i < lens):\r\n if (s[i] == \".\"):\r\n l.append(0)\r\n \r\n elif (s[i] == \"-\"):\r\n i+= 1\r\n if (s[i] == \".\"):\r\n l.append(1)\r\n else:\r\n l.append(2)\r\n i += 1\r\nans = \"\".join(str(e) for e in l)\r\nprint(ans)", "s = list(map(str, input()))\r\nr = []\r\ni = 0\r\nwhile(i<=len(s)-1):\r\n if(s[i] == '-'):\r\n if(s[i+1] == '-'):\r\n r.append('2')\r\n else:\r\n r.append('1')\r\n i += 2\r\n else:\r\n r.append('0')\r\n i += 1\r\nprint(*r, sep='')", "s = input()\r\nn=len(s)\r\ni=0\r\nans=''\r\nwhile i<=n-1:\r\n if s[i]=='.':\r\n ans=ans+'0'\r\n if i!=n-1:\r\n i=i+1\r\n else:\r\n break\r\n else:\r\n if s[i]=='-' and s[i+1]=='-':\r\n ans=ans+'2'\r\n if i!=n-2:\r\n i=i+2\r\n else:\r\n break\r\n if s[i]=='-' and s[i+1]=='.':\r\n ans=ans+'1'\r\n if i!=n-2:\r\n i=i+2\r\n else:\r\n break\r\n \r\nprint(ans)\r\n ", "import sys\n\ndef get_ints():\n return list(map(int, sys.stdin.readline().strip().split()))\n\n\ndef helper(st):\n i = 0\n res = \"\"\n while i < len(st):\n if st[i] == '.':\n res += '0'\n elif st[i] == '-':\n i += 1\n if st[i] == '-':\n res += '2'\n else:\n res += '1'\n i += 1\n print(res)\n\nst = input()\nhelper(st)", "# import sys \r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"out1.out\",'w')\r\ns=input()\r\nc2=s.count(\"--\")\r\ns=s.replace(\"--\",\"2\",c2)\r\nc1=s.count(\"-.\")\r\ns=s.replace(\"-.\",\"1\",c1)\r\nc0=s.count(\".\")\r\ns=s.replace(\".\",\"0\",c0)\r\nprint(s)\t", "def main():\n import re\n s = input()\n\n has2 = True\n while has2:\n try:\n i = s.index('--')\n s = s[:i] + '2' + s[(i + 2):]\n except ValueError:\n has2 = False\n\n s = re.sub(r'-\\.', '1', s)\n s = re.sub(r'\\.', '0', s)\n\n print(s)\n\n\nif __name__ == '__main__':\n main()\n", "\nnumeric_notation = input()\nnum = 0\nlenghth =''\nwhile num<len(numeric_notation):\n if numeric_notation[num]=='.':\n lenghth+=str(0)\n num+=1\n continue\n elif numeric_notation[num]=='-' and numeric_notation[num+1]=='.':\n lenghth+= str(1)\n num+=2\n continue\n elif numeric_notation[num]=='-' and numeric_notation[num+1]=='-':\n lenghth+=str(2)\n num+=2\n continue\n num+=1\nprint(lenghth)\n", "s = str(input())\r\nans=\"\"\r\ni=0\r\nwhile i < len(s):\r\n if s[i]=='.':\r\n ans=ans+\"0\"\r\n elif s[i]=='-':\r\n i = i + 1\r\n if s[i]=='.':\r\n ans=ans+\"1\"\r\n elif s[i]=='-':\r\n ans=ans+\"2\"\r\n i = i + 1\r\nprint(ans)\r\n", "s=input()\r\nx=s.replace(\"--\",\"2\")\r\ny=x.replace(\"-.\",\"1\")\r\nprint(y.replace(\".\",\"0\"))", "s = input()\r\nres = []\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n res.append('0')\r\n i+=1\r\n elif s[i] == '-':\r\n if i+1<len(s) and s[i+1] == '-':\r\n res.append('2')\r\n i+=2\r\n elif i+1<len(s) and s[i+1] == '.':\r\n res.append('1')\r\n i+=2\r\nprint(''.join(res))", "s = str(input())\r\nstr = [\"-.\", \"--\"]\r\nss = \"\"\r\ni = 1\r\nwhile i <= len(s):\r\n\r\n if s[i - 1:i + 1] == str[0]:\r\n\r\n i += 2\r\n ss += \"1\"\r\n elif s[i - 1:i + 1] == str[1]:\r\n i += 2\r\n ss += \"2\"\r\n else:\r\n i += 1\r\n ss += \"0\"\r\n\r\nprint(ss)\r\n", "s1 = input()\r\ni = 0\r\nstr = []\r\nwhile i < len(s1):\r\n if s1[i] == '.':\r\n str += '0'\r\n i+=1 \r\n elif s1 [i+1] == '.':\r\n str += '1'\r\n i = i + 2\r\n else:\r\n str += '2'\r\n i = i + 2 \r\ni = 0\r\nfor i in range (len(str)):\r\n print(str[i],end=\"\")", "def main():\r\n s = input()\r\n strnum = \"\"\r\n n = len(s)\r\n i = 0\r\n while i < n:\r\n if s[i] == '.':\r\n strnum += '0'\r\n i += 1\r\n elif s[i] == '-' and s[i+1] == '.' and i+1 < len(s):\r\n strnum += '1'\r\n i += 2\r\n else:\r\n strnum += '2'\r\n i += 2\r\n\r\n print(strnum)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t = input()\r\nt = t.replace('--', '2')\r\nt = t.replace('-.', '1')\r\nt = t.replace('.', '0')\r\nprint(t)", "seq = input()\r\n\r\nseq = seq.replace(\"--\", \"2\")\r\nseq = seq.replace(\"-.\", \"1\")\r\nseq = seq.replace(\".\", \"0\")\r\n\r\nprint(seq)", "s=input()\r\nr=''\r\ni=0\r\nwhile(i<(len(s))):\r\n if s[i]=='-':\r\n if s[i]+s[i+1]=='--':\r\n r+='2'\r\n i+=2\r\n else:\r\n r+='1'\r\n i+=2\r\n else:\r\n r+='0'\r\n i+=1\r\n\r\nprint(r)", "x = input()\r\ndecode = []\r\nwhile True :\r\n if x[0] == \".\" :\r\n decode.append(0)\r\n x = x[1:]\r\n elif x[:2] == \"-.\" :\r\n decode.append(1)\r\n x=x[2:]\r\n elif x[:2] == \"--\" :\r\n decode.append(2)\r\n x=x[2:]\r\n if x == \"\" :\r\n break\r\nprint(*decode, sep=\"\")\r\n", "x=list(str(input()))\r\na=[]\r\ni=len(x)\r\nj=0\r\nwhile i :\r\n if (x[j]=='.'):\r\n a.append('0')\r\n j+=1\r\n i-=1\r\n elif((x[j]=='-')and(x[j+1]=='.')):\r\n a.append('1')\r\n j+=2\r\n i-=2\r\n elif((x[j]=='-')and(x[j+1]=='-')):\r\n a.append('2')\r\n j += 2\r\n i -= 2\r\n\r\nprint(\"\".join(a))", "li = list(input())\r\ns = ''\r\ni = 0\r\nwhile i < len(li):\r\n if li[i] == '.':\r\n s = s+'0'\r\n else:\r\n i+=1\r\n if li[i] == '.':\r\n s = s+'1'\r\n else:\r\n s = s+'2'\r\n i+=1\r\nprint(s)", "code_samp=input()\r\nans=\"\"\r\ni=0\r\nwhile(i<len(code_samp)):\r\n if(code_samp[i]==\".\"):\r\n ans+='0'\r\n i+=1\r\n elif(i+1<len(code_samp) and code_samp[i]==\"-\" and code_samp[i+1]==\".\"):\r\n ans+=\"1\"\r\n i+=2\r\n else:\r\n ans+=\"2\"\r\n i+=2\r\nprint(ans) ", "def func(borse):\r\n decode = \"\"\r\n pred = None\r\n for c in borse:\r\n if c == '.':\r\n if pred is None:\r\n decode += '0'\r\n elif pred == '-':\r\n decode += '1'\r\n pred = None\r\n continue\r\n\r\n if c == '-':\r\n if pred is None:\r\n pred = c\r\n elif pred == '-':\r\n decode += '2'\r\n pred = None\r\n continue\r\n return decode\r\n\r\nprint(func(input()))", "import sys\r\n\r\ns = sys.stdin.readline()\r\nsys.stdout.write(s.replace('--','2').replace('-.','1').replace('.','0') + '\\n')", "input = input()\r\nnumber = ''\r\ni = 0\r\nwhile i < len(input):\r\n if input[i] == '.':\r\n number += '0'\r\n elif input[i] == '-' and input[i + 1] == '.':\r\n number += '1'\r\n i += 1\r\n elif input[i] == '-' and input[i + 1] == '-':\r\n number += '2'\r\n i += 1\r\n i += 1\r\n\r\nprint(number)\r\n", "encoded = input()\r\n\r\ndecoded = \"\"\r\nidx = 0\r\nwhile idx < len(encoded):\r\n if encoded[idx] == \".\":\r\n decoded += \"0\"\r\n elif idx < len(encoded)-1:\r\n if encoded[idx+1] == \".\":\r\n decoded += \"1\"\r\n elif encoded[idx+1] == \"-\":\r\n decoded += \"2\"\r\n idx += 1\r\n else:\r\n decoded = \"Invalid Borze Code\"\r\n idx += 1\r\n\r\nprint(decoded)", "l=list(input())\n#print(l)\nn=len(l)\nj=0\nwhile j<n-1:\n if l[j]=='.':\n print(0,end='')\n elif l[j]=='-':\n if l[j+1]=='.':\n j+=1\n print(1,end='')\n else:\n j+=1\n print(2,end='')\n j+=1\nif(j==(n-1) and l[j]=='.'):\n print(0,end='')", "def listInp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ns = input()\r\nn = []\r\nl = len(s)\r\ni=0\r\nwhile i<l:\r\n #print(i)\r\n if s[i] == '-':\r\n if s[i+1] == '.':\r\n n.append('1')\r\n elif s[i+1] == '-':\r\n n.append('2')\r\n i+=1\r\n elif s[i] == '.':\r\n n.append('0')\r\n i+=1\r\n \r\nprint(''.join(n))\r\n", "import re\r\nstring = input()\r\nx=re.sub(\"--\",'2',string)\r\ny=re.sub(\"-.\",'1',x)\r\nz=re.sub('\\.','0',y)\r\nprint(z)\r\n", "string = list(input())\r\nres = ''\r\ncounttr = 0\r\nif string[0] == '.':\r\n res += '0'\r\n del string[0]\r\nfor i in string:\r\n if i == '.' and counttr == 0:\r\n res += '0'\r\n elif i == '-' and counttr == 0:\r\n counttr += 1\r\n continue\r\n elif i == '.' and counttr == 1:\r\n res += '1'\r\n counttr -= 1\r\n elif i == '-' and counttr == 1:\r\n res += '2'\r\n counttr -= 1\r\nprint(res)", "s=input()\r\nt=str()\r\n\r\nwhile(len(s)):\r\n if(s[0]==\".\"):\r\n t+=\"0\"\r\n s=s[1:]\r\n else:\r\n if(s[1]==\".\"):\r\n t+=\"1\"\r\n s=s[2:]\r\n else:\r\n t+=\"2\"\r\n s=s[2:]\r\n \r\nprint(t)\r\n \r\n ", "inp = list(input())\r\nans = []\r\ni = 0\r\nwhile i <= (len(inp)-1):\r\n if inp[i] == \".\":\r\n ans.append(\"0\")\r\n i += 1\r\n elif inp[i] == \"-\" and inp[i+1] == \".\":\r\n ans.append(\"1\")\r\n i += 2\r\n else:\r\n ans.append(\"2\")\r\n i += 2\r\nprint(\"\".join(ans))", "x = input()\r\n\r\ny = str()\r\n\r\ni = 0\r\n\r\nwhile i < len(x):\r\n if x[i:i+2] == \"-.\":\r\n y+=\"1\"\r\n i+=1\r\n elif x[i:i+2] == \"--\":\r\n y+=\"2\"\r\n i+=1\r\n else:\r\n y+=\"0\"\r\n \r\n i+=1\r\n\r\nprint(y)\r\n\r\n", "def ternary(s):\r\n\ti, res = 0, \"\"\r\n\twhile i < len(s):\r\n\t\tif s[i] == \"-\" and s[i + 1] == \".\":\r\n\t\t\tres += \"1\"\r\n\t\t\ti += 1\r\n\t\telif s[i] == \"-\" and s[i + 1] == \"-\":\r\n\t\t\tres += \"2\"\r\n\t\t\ti += 1\r\n\t\telse:\r\n\t\t\tres += \"0\"\r\n\t\ti += 1\r\n\treturn res \r\n\r\ns = input()\r\nprint(ternary(s))", "def decode(s):\r\n ans = ''\r\n i = 0\r\n while i < len(s):\r\n \r\n if s[i] == '.' :\r\n ans+='0'\r\n \r\n if s[i] == '-' and s[i+1] == '.':\r\n ans+='1'\r\n i+=1\r\n if s[i] == '-' and s[i+1] == '-':\r\n ans+='2'\r\n i+=1 \r\n i+=1\r\n \r\n return ans\r\n \r\ns = input()\r\nprint(decode(s))", "b = list(input())\nt = []\nfor i in range(len(b)):\n if b[i] == '.':\n t.append('0')\n elif b[i] == '-':\n if b[i+1] == '.':\n t.append('1')\n b[i+1] = '0'\n elif b[i+1] == '-':\n t.append('2')\n b[i+1] = '0'\nprint(''.join(t)) ", "string = input()\ncounter = 0\nans = \"\"\nwhile counter < len(string):\n if string[counter] == \".\":\n ans += \"0\"\n elif string[counter] == \"-\":\n if string[counter + 1] == \".\":\n ans += \"1\"\n else:\n ans += \"2\"\n counter += 1\n counter += 1\n\nprint(ans)", "string_1 = str(input())\r\nlen_string = len(string_1)\r\nstring_2 = \"\"\r\ni = 0\r\nwhile i <= len_string-1:\r\n if string_1[i] == '.':\r\n string_2 += '0'\r\n i += 1\r\n elif string_1[i] == '-':\r\n if string_1[i+1] == '.':\r\n string_2 += '1'\r\n else:\r\n string_2 += '2'\r\n i += 2\r\nprint(string_2)\r\n \r\n \r\n", "from sys import stdin, stdout\r\n\r\ninput = stdin.readline\r\ndef print(val):\r\n stdout.write(f'{val}\\n')\r\n\r\nborze = input().replace('\\n', '')\r\n\r\ndecodes = ''\r\nidx = 0\r\nwhile idx < len(borze):\r\n if borze[idx] == '.':\r\n decodes = f'{decodes}0'\r\n else: \r\n idx += 1\r\n if borze[idx] == '.':\r\n decodes = f'{decodes}1'\r\n else:\r\n decodes = f'{decodes}2'\r\n idx += 1\r\n\r\nprint(decodes)\r\n", "max_count = 2\nt = \"\"\nd = {\".\":\"0\",\"-.\":\"1\",\"--\":\"2\"}\n\nout =\"\"\ncount = 0\ni = input()\nfor z in i:\n if(z == \".\"):\n t+=z\n out+=d[t]\n count = 0\n t = \"\"\n \n if(z == \"-\"):\n t+=z\n count+=1\n \n if(count == 2):\n out+=d[t]\n t =\"\"\n count = 0\nprint(out)", "s = list(input())\r\ni = 0\r\noutput = []\r\nwhile i < len(s):\r\n if s[i] == '-' and s[i+1] == '.':\r\n output.append('1')\r\n i += 2\r\n elif s[i] == '-' and s[i+1] == '-':\r\n output.append('2')\r\n i += 2\r\n else:\r\n output.append('0')\r\n i += 1\r\n\r\nprint(''.join(output))\r\n", "a=list(input())\r\nb=[]\r\nwhile len(a)>0:\r\n if a[0]==\".\":\r\n b.append(0)\r\n a=a[1:]\r\n elif a[0]==\"-\":\r\n if a[1]==\"-\":\r\n b.append(2)\r\n a=a[2:]\r\n elif a[1]==\".\":\r\n b.append(1)\r\n a=a[2:]\r\nfor i in range(len(b)):\r\n print(b[i],end=\"\")", "s = input()\r\nn = 0\r\nans = \"\"\r\nwhile n < len(s):\r\n if s[n] == \".\":\r\n ans+=\"0\"\r\n n+=1\r\n elif s[n] == \"-\" and s[n+1] == \".\":\r\n ans+=\"1\"\r\n n+=2\r\n else:\r\n ans+=\"2\"\r\n n+=2\r\nprint(ans)", "word = input()\r\ncount = 0\r\nwordcode = ''\r\nwhile count < len(word):\r\n if word[count] == '.':\r\n wordcode += '0'\r\n count += 1\r\n else:\r\n if word[count+1] == '.':\r\n wordcode += '1'\r\n count += 2\r\n else:\r\n wordcode += '2'\r\n count += 2\r\nprint(wordcode)", "trans = ['.', '-.', '--']\r\nk = ''\r\nr = []\r\nn = list(input())\r\nfor i in range(len(n)):\r\n k += n[i]\r\n if k in trans:\r\n r.append(str(trans.index(k)))\r\n k = ''\r\nprint(''.join(r))\r\n \r\n", "l=input()\r\nl=[str(i) for i in l]\r\nans=[0]*len(l)\r\ni=0\r\ncou=0\r\nwhile(i<=len(l)):\r\n if i>=len(l):\r\n break\r\n if l[i]=='-' and l[i+1]=='-':\r\n ans[cou]=2\r\n i=i+2\r\n cou+=1\r\n elif l[i]=='-' and l[i+1]=='.':\r\n ans[cou]=1\r\n i=i+2\r\n cou+=1\r\n else:\r\n ans[cou]=0\r\n i=i+1\r\n cou+=1\r\nprint(''.join(map(str,ans[0:cou])))\r\n \r\n ", "a=input()\r\nn=len(a)\r\np=''\r\ni=0\r\nwhile i<n:\r\n if a[i]=='.':\r\n p+='0'\r\n i+=1\r\n elif a[i]+a[i+1]=='-.':\r\n p+='1'\r\n i+=2\r\n elif a[i]+a[i+1]=='--':\r\n p+='2'\r\n i+=2\r\n else:\r\n pass\r\nprint(p)\r\n ", "ip = input()\r\nl = len(ip)\r\ni = 0; ans = []\r\nwhile i<l:\r\n if ip[i] == '.' : \r\n ans.append('0')\r\n i += 1\r\n elif ip[i] == '-' :\r\n if ip[i+1] == '.' : ans.append('1')\r\n elif ip[i+1] == '-' : ans.append('2')\r\n i += 2\r\n\r\n\r\n\r\n\r\nprint(''.join(ans))", "ch=input()\r\nliste=[ch[i] for i in range (len(ch))]\r\nch1=\"\"\r\ni=0\r\nwhile i<(len(liste)):\r\n ch2=\"\"\r\n ch2=\"\".join(liste[i:i+2])\r\n if ch2==\"--\":\r\n ch1+=\"2\"\r\n del liste[i:i+2]\r\n elif ch2==\"-.\":\r\n ch1+=\"1\"\r\n del liste[i:i+2]\r\n else:\r\n ch1+=\"0\"\r\n del liste[i]\r\n \r\nprint(ch1)", "#!/usr/bin/env python3\nstr1=input()\ni=0\nwhile (i < len(str1)):\n if(str1[i]=='.'):\n print(0,end='')\n i+=1\n elif(str1[i]=='-'):\n if(str1[i+1]=='.'):\n print(1,end='')\n i+=2\n else:\n print(2,end='')\n i+=2\n else:\n pass\n", "s=input()\r\nt=len(s)\r\ni=0\r\nwhile(i<t):\r\n if(s[i]=='.'):print(\"%s\"%('0'),end=\"\")\r\n elif(s[i]=='-' and i<t-1):\r\n if(s[i+1]=='.'):\r\n print(\"%s\"%('1'),end=\"\")\r\n elif(s[i+1]=='-'):\r\n print(\"%s\"%('2'),end=\"\")\r\n i+=1\r\n i+=1", "# Ahmed Abdelrazik\r\n\r\nE = input()\r\nE = E.replace(\"--\",\"2\")\r\nE =E.replace(\"-.\",\"1\")\r\nE =E.replace(\".\",\"0\")\r\nprint(E)", "a=list(input())\r\nb=[]\r\nwhile len(a)>0:\r\n if a[0]=='.':\r\n b.append(0)\r\n del a[0]\r\n elif a[0]=='-' and a[1]=='.':\r\n b.append(1)\r\n del a[0];del a[0]\r\n elif a[0]=='-' and a[1]=='-':\r\n b.append(2)\r\n del a[0];del a[0]\r\nfor i in b:\r\n print(i,end='')", "n = {'.':'0',\r\n '-.':'1',\r\n '--':'2'}\r\nans = \"\"\r\ni = 0\r\nt = input()\r\nwhile i < len(t):\r\n if t[i] == '-' and t[i+1] == '-':\r\n ans += n.get('--')\r\n i += 2\r\n elif t[i] == '-' and t[i+1] == '.':\r\n ans += n.get('-.')\r\n i += 2\r\n else:\r\n ans += n.get('.')\r\n i += 1\r\nprint(ans)", "def main():\r\n ternary_number = input()\r\n decoding_list = [',','-.', '--']\r\n check = 0\r\n for i in range(len(ternary_number)):\r\n if check == 1:\r\n check = 0\r\n continue\r\n if i == len(ternary_number) - 1:\r\n print(0, end = \"\")\r\n break \r\n num = ternary_number[i] + ternary_number[i+1]\r\n # print(num)\r\n if num in decoding_list:\r\n print(decoding_list.index(num), end = \"\")\r\n check = 1\r\n else:\r\n print(0, end = \"\")\r\n \r\nmain()", "code = input()\r\n\r\ni = 0\r\nd = []\r\nwhile i < len(code):\r\n if code[i] == \".\":\r\n d.append('0')\r\n i += 1\r\n elif code[i:i+2] == \"-.\":\r\n d.append('1')\r\n i += 2\r\n elif code[i:i+2] == \"--\":\r\n d.append('2')\r\n i += 2\r\n\r\nprint(\"\".join(d))\r\n\r\n", "a = input()\r\n\r\ns = \"\"\r\ni = 0\r\nwhile len(a)-1 >= i:\r\n if a[i] == \".\":\r\n s += \"0\"\r\n\r\n if a[i:i+2] == \"-.\":\r\n s += \"1\"\r\n i += 1\r\n\r\n if a[i:i+2] == \"--\":\r\n s += \"2\"\r\n i += 1\r\n\r\n i += 1\r\nprint(s)", "s = input()\r\nd = \"\"\r\ni = 0\r\nwhile i < len(s):\r\n if i != len(s) - 1:\r\n if s[i] == \"-\" and s[i+1] == \"-\":\r\n d+=\"2\"\r\n i+=2\r\n elif s[i] == \"-\" and s[i+1] == \".\":\r\n d+=\"1\"\r\n i+=2\r\n else:\r\n d+=\"0\"\r\n i+=1\r\n else:\r\n d+=\"0\"\r\n i+=1\r\nprint(d)\r\n \r\n \r\n ", "x = list(input())\r\ni=0\r\na=''\r\nwhile i<len(x):\r\n if x[i]=='.':\r\n a+='0'\r\n else:\r\n if x[i+1]=='.':\r\n a+='1'\r\n else:\r\n a+='2'\r\n i+=1\r\n i+=1\r\nprint(a)", "s=input()\r\nt=len(s)\r\ni=0\r\na=\"\"\r\nwhile t>i:\r\n\tif len(s)>i+1 and s[i:i+2]==\"-.\":\r\n\t\ta=a+\"1\"\r\n\t\ti+=2\r\n\telif len(s)>i+1 and s[i:i+2]==\"--\":\r\n\t\ta=a+\"2\"\t \r\n\t\ti+=2\r\n\telif len(s)>i and s[i:i+1]==\".\":\t\r\n\t\ta=a+\"0\"\r\n\t\ti+=1\r\nprint(a)\t\t", "s=input()\r\narr=[]\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n arr.append(0)\r\n i=i+1\r\n elif s[i]=='-':\r\n if s[i+1]=='-':\r\n arr.append(2)\r\n i=i+2\r\n else:\r\n arr.append(1)\r\n i=i+2\r\nfor ele in arr:\r\n print(ele,end=\"\")", "a = input()\r\nb = \"\"\r\ni = 0\r\nwhile(i < len(a)) :\r\n if(a[i] == '.') :\r\n b += '0'\r\n elif(a[i] == '-' and a[i+1] == '.') :\r\n b += '1'\r\n i+=1\r\n elif(a[i] == '-' and a[i+1] == '-') :\r\n b += '2'\r\n i+=1\r\n i += 1\r\nprint(b)\r\n", "def main():\r\n\tt = input()\r\n\r\n\tprint(case(t))\r\n\r\ndef case(s):\r\n\t\r\n\tnum = ''\r\n\tdash = False\r\n\ti = 0\r\n\twhile i < len(s):\r\n\t\tif s[i] == '.' and not dash :\r\n\t\t\tnum += '0'\r\n\t\telif s[i] == '-' and not dash:\r\n\t\t\tdash = True\r\n\t\telif s[i] == '-' and dash:\r\n\t\t\tdash = False\r\n\t\t\tnum += '2'\r\n\t\telse:\r\n\t\t\tdash = False\r\n\t\t\tnum += '1'\r\n\r\n\t\ti += 1\r\n\treturn num\r\n\r\nmain()", "import re\r\n\r\nx = input()\r\n\r\ntext = re.sub( r'--', \"2\", x )\r\ntext = re.sub( r'-.', \"1\", text )\r\ntext = re.sub( r'\\.', \"0\", text )\r\nprint( text )\r\n", "from typing import List\n\n\ndef solution():\n code = input()\n i = 0\n while i < len(code):\n if code[i] == '.':\n print(\"0\", end=\"\")\n i += 1\n elif code[i] == '-' and code[i + 1] == '.':\n print(\"1\", end=\"\")\n i += 2\n else:\n print(\"2\", end=\"\")\n i += 2\n print()\n\n\nif __name__ == \"__main__\":\n solution()\n", "code = str(input())\r\n\r\nnum = ''\r\n\r\ni = 0\r\n\r\nwhile i < len(code):\r\n if code[i] == '-' and code[i+1] =='.':\r\n num += '1'\r\n i += 1\r\n elif code[i] == '-' and code[i+1] =='-':\r\n num += '2'\r\n i += 1\r\n elif code[i] == '.':\r\n num += '0'\r\n i += 1\r\n\r\nprint(num)", "borzeCode = input()\ndecodedMessage = str()\ni = 0\n\nwhile i < len(borzeCode):\n if borzeCode[i] == \".\":\n decodedMessage += \"0\"\n i += 1\n elif borzeCode[i] == \"-\" and borzeCode[i + 1] == \".\":\n decodedMessage += \"1\"\n i += 2\n elif borzeCode[i] == \"-\" and borzeCode[i + 1] == \"-\":\n decodedMessage += \"2\"\n i += 2\n\nprint(decodedMessage)", "s=input()\r\ns1=''\r\ni=0\r\nwhile(i<len(s)-1):\r\n if s[i]=='.':\r\n s1=s1+'0'\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n s1=s1+'1'\r\n i=i+1\r\n elif s[i+1]=='-':\r\n s1=s1+'2'\r\n i=i+1\r\n i=i+1\r\nif i==len(s)-1 and s[i]=='.':\r\n s1=s1+'0'\r\nprint(s1)\r\n", "s =input()\n\ni =0\nnumb =\"\"\nwhile i<len(s):\n if s[i]==\".\":\n numb +=\"0\"\n i +=1\n elif s[i:i+2]==\"-.\":\n numb +=\"1\"\n i+=2\n else:\n numb +=\"2\"\n i+=2\n\nprint(numb)\n \n", "#borcecode={\".\":\"0\",\"-.\":\"1\",\"--\":2}\r\ns=input()\r\nn=len(s)\r\ni=0\r\nans=\"\"\r\nwhile i<n:\r\n if s[i]==\".\":\r\n ans+=\"0\"\r\n i+=1\r\n else:\r\n if s[i+1]==\".\":\r\n ans+=\"1\"\r\n else:\r\n ans+=\"2\"\r\n i+=2\r\nprint(ans)\r\n ", "s = input()\nsize = len(s)\ni = 0\nj = i+1\nstring = \"\"\nwhile j < len(s):\n if s[i] == \".\":\n string += \"0\"\n i = j\n j = i+1\n elif s[i] == \"-\" and s[j] == \".\":\n string += \"1\"\n i = j+1\n j = i+1\n elif s[i] == \"-\" and s[j] == \"-\":\n string += \"2\"\n i = j+1\n j = i+1\nwhile i < len(s):\n if s[i] == \".\":\n string += \"0\"\n i+=1\nprint(string)", "#Solution 2\r\ninp=input();\r\ninp=inp.replace(\"--\",\"2\");\r\ninp=inp.replace(\"-.\",\"1\");\r\ninp=inp.replace(\".\",\"0\");\r\nprint(inp)", "que = input()\r\n\r\nque=que.replace('--','2')\r\nque=que.replace('-.','1')\r\nque=que.replace('.','0')\r\n\r\n\t\r\nprint(que)\r\n", "s=input()\r\nl=len(s)\r\ni=0\r\nwhile i<l:\r\n if(s[i] == '.'):\r\n print(\"0\",end='')\r\n i+=1\r\n elif(s[i]== '-' and s[i + 1] == '.'):\r\n print(\"1\",end='')\r\n i+=2\r\n elif(s[i]== '-' and s[i + 1] == '-'):\r\n print(\"2\",end='')\r\n i+=2\r\n", "x=input()\r\ny=[]\r\ni=0\r\nwhile i<len(x):\r\n if x[i]==\".\":\r\n y.append(\"0\")\r\n i+=1\r\n continue\r\n if x[i]==\"-\":\r\n i+=1\r\n if x[i]==\"-\":\r\n y.append(\"2\")\r\n else:\r\n y.append(\"1\")\r\n i+=1\r\nprint(\"\".join(y))", "lb = list(input())\r\nres = []\r\n\r\ni=0\r\nwhile i<len(lb):\r\n if lb[i] == \".\":\r\n res.append(\"0\")\r\n i+=1\r\n elif lb[i] == \"-\" and lb[i+1] == \".\":\r\n res.append(\"1\")\r\n i+=2\r\n elif lb[i] == \"-\" and lb[i+1] == \"-\":\r\n res.append(\"2\")\r\n i+=2\r\n\r\n\r\nprint(*res, sep=\"\")", "x=input()\r\nl=len(x)\r\ny=[]\r\ni=0\r\nwhile i<l:\r\n if x[i]==\".\":\r\n y.append(\"0\")\r\n i=i+1\r\n else:\r\n if x[i+1]==\".\":\r\n y.append(\"1\")\r\n i=i+2\r\n else:\r\n y.append(\"2\")\r\n i=i+2\r\nfor i in y:\r\n print(i,end=\"\")", "s=input()\r\ni=0\r\nl=[]\r\nwhile(i<len(s)):\r\n if(s[i]=='.'):\r\n l.append(0)\r\n i=i+1\r\n elif(s[i]=='-'):\r\n if(s[i+1]=='.'):\r\n l.append(1)\r\n else:\r\n l.append(2)\r\n i=i+2\r\nfor i in l:\r\n print(i,end=\"\")\r\n ", "s = str(input())\r\nres = []\r\nindex = 0\r\nwhile index < len(s):\r\n if index+1 < len(s):\r\n if s[index] == \"-\" and s[index+1] == \".\":\r\n res.append(\"1\")\r\n index += 1\r\n elif s[index] == \"-\" and s[index+1] == \"-\":\r\n res.append(\"2\")\r\n index += 1\r\n else:\r\n res.append(\"0\")\r\n else:\r\n res.append(\"0\")\r\n index += 1\r\n\r\nprint(\"\".join(res))", "a = list(input())\r\nl = []\r\nwhile len(a) > 0:\r\n if a[0] == '.':\r\n l.append('0')\r\n a.remove(a[0])\r\n elif a[0] == '-' and a[1] == '.':\r\n l.append('1')\r\n a.remove(a[0])\r\n a.remove(a[0])\r\n elif a[0] == '-' and a[1] == '-':\r\n l.append('2')\r\n a.remove(a[0])\r\n a.remove(a[0])\r\nz=''\r\nfor i in l:\r\n z += i\r\nprint(z) ", "s=input()\r\na=\"\"\r\nx=0\r\nwhile x<len(s):\r\n if s[x]=='.':\r\n a=a+'0'\r\n x+=1\r\n elif s[x]=='-' and s[x+1]=='.':\r\n a=a+'1'\r\n x+=2\r\n else:\r\n a=a+'2'\r\n x+=2\r\nprint(a)", "def f(s):\r\n ans = \"\"\r\n i=0\r\n while(i<len(s)):\r\n if (s[i]==\".\"):\r\n ans+=\"0\"\r\n i+=1\r\n elif(s[i]==\"-\" and s[i+1]==\".\"):\r\n ans+=\"1\"\r\n i+=2\r\n else:\r\n ans+=\"2\"\r\n i+=2\r\n return ans\r\n \r\n\r\n\r\nt = input()\r\nprint(f(t))\r\n", "s=input()\r\na,b,c='.','-.','--'\r\nS=''\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n S+='0'\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n S+='1'\r\n i+=1\r\n else:\r\n S+='2'\r\n i+=1\r\n i+=1\r\nprint(S)", "s=input()\r\ncode=['.','-.','--']\r\nx=''\r\ndec=[]\r\nfor i in range(len(s)):\r\n x=x+s[i]\r\n for j in range(3):\r\n if(x==code[j]):\r\n dec.append(str(j))\r\n x=''\r\nprint(''.join(dec))", "def solved(code):\r\n notation, decoded = ['.', '-.', '--'], ''\r\n\r\n while len(code):\r\n if code[:1] in notation:\r\n decoded += str(notation.index(code[:1]))\r\n code = code[1:]\r\n else:\r\n decoded += str(notation.index(code[:2]))\r\n code = code[2:]\r\n \r\n return decoded\r\n\r\nif __name__ == \"__main__\":\r\n code = input()\r\n\r\n decoded = solved(code)\r\n \r\n print(decoded)\r\n", "line, ans = input(), ''\r\ni, _len = 0, len(line)\r\nwhile i < _len:\r\n if line[i] == '.':\r\n ans += '0'\r\n elif i < _len - 1 and line[i + 1] == \".\":\r\n ans += '1'\r\n i += 1\r\n elif i < _len - 1:\r\n ans += '2'\r\n i += 1\r\n i += 1\r\nprint(ans)", "code = input()\r\ndecode = \"\"\r\ncount = 0\r\nwhile count < len(code):\r\n if code[count] == \".\":\r\n decode += \"0\"\r\n count += 1\r\n elif code[count] == \"-\":\r\n if code[count+1] == \".\": \r\n decode += \"1\"\r\n elif code[count+1] == \"-\":\r\n decode += \"2\"\r\n count += 2\r\nprint(decode)\r\n \r\n \r\n\r\n", "s = input()\r\nans = \"\"\r\nj = 0\r\nwhile j < len(s):\r\n if s[j] == \".\":\r\n ans = ans + \"0\"\r\n j += 1\r\n elif s[j] == \"-\":\r\n if s[j+1] == \".\":\r\n ans += \"1\"\r\n else :\r\n ans += \"2\"\r\n j += 2 \r\nprint(ans) \r\n ", "s = input()\r\ni = 0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n print(0, end='')\r\n i += 1\r\n elif s[i+1]=='.':\r\n print(1, end='')\r\n i += 2\r\n else:\r\n print(2, end='')\r\n i += 2", "inp_1= input()\r\ns=\"\"\r\nx = len(inp_1)\r\ni =0\r\nwhile i<x:\r\n if inp_1[i]==\".\":\r\n s+=\"0\"\r\n i+=1\r\n elif inp_1[i]==\"-\" and inp_1[i+1]==\"-\":\r\n s+=\"2\"\r\n i+=2\r\n elif inp_1[i]==\"-\" and inp_1[i+1]==\".\":\r\n s+=\"1\"\r\n i+=2\r\n\r\n \r\nprint(s)", "s=input()\r\nt=s.replace(\"--\",\"2\")\r\ns=t.replace(\"-.\",\"1\")\r\nt=s.replace(\".\",\"0\")\r\nprint(t)\r\n", "code = input()\r\ncurrent_char = \"\"\r\nfor c in code:\r\n current_char += c\r\n if c == ' ' or c == '/': \r\n continue\r\n elif current_char == '.':\r\n print(0, end='')\r\n current_char = \"\"\r\n elif current_char == '-.':\r\n print(1, end='')\r\n current_char = \"\"\r\n elif current_char == '--':\r\n print(2, end='')\r\n current_char = \"\"\r\n", "#n,t=list(map(int,input().split()))\r\ns=input()\r\ns=s.replace(\"--\",\"2\")\r\ns=s.replace(\"-.\",\"1\")\r\ns=s.replace(\".\",\"0\")\r\nprint(s)", "str1=input()\r\nstr1=list(str1)\r\ni=0\r\nstr2=[]\r\nwhile i in range(0,len(str1)):\r\n if str1[i]==\".\":\r\n str2.append(\"0\")\r\n elif str1[i]==\"-\":\r\n if str1[i+1]==\".\":\r\n str2.append(\"1\")\r\n i+=1\r\n else:\r\n str2.append(\"2\")\r\n i+=1\r\n i+=1\r\nstrx=\"\"\r\nprint(strx.join(str2))\r\n", "# using replace method\r\n\r\nstr=input()\r\n\r\nstr=str.replace(\"--\",\"2\")\r\nstr=str.replace(\"-.\",\"1\")\r\nstr=str.replace(\".\",\"0\")\r\n\r\nprint(str)", "result = input()\r\nresult = result.replace('--', '2').replace('-.', '1').replace('.', '0')\r\nprint(result)\r\n", "s=input()\r\np=''\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n p+='0'\r\n i+=1\r\n else:\r\n if s[i+1]=='.':\r\n p+='1'\r\n else:\r\n p+='2'\r\n i+=2\r\nprint(p)\r\n", "ternary = input()\r\nl=0\r\nnumber = ''\r\n\r\nwhile(l<=len(ternary)-1):\r\n\r\n\tif(ternary[l]=='.'):\r\n\t\tnumber+='0'\r\n\t\tl+=1\r\n\telse:\r\n\t\tif(ternary[l+1]=='.'):\r\n\t\t\tnumber+='1'\r\n\t\telse:\r\n\t\t\tnumber+='2'\r\n\t\tl+=2\r\nprint(number)", "\n\ngive = input()\n\nt = 0\nout = \"\"\n\nwhile (t < len(give)):\n\tif give[t] == '.':\n\t\tout+= \"0\"\n\t\tt+=1\n\telse:\n\t\tif give[t+1] == '.':\n\t\t\tout+=\"1\"\n\t\telse:\n\t\t\tout+=\"2\"\n\t\tt+=2\n\nprint(out)\n", "if __name__ == '__main__':\n\ts=input()\n\tfinal=\"\"\n\ti=0\n\twhile i<len(s):\n\t\tif s[i]==\".\":\n\t\t\tfinal+=\"0\"\n\t\telif s[i]==\"-\":\n\t\t\ti+=1\n\t\t\tif s[i]==\"-\":\n\t\t\t\tfinal+=\"2\"\n\t\t\telse:\n\t\t\t\tfinal+=\"1\"\n\t\ti+=1\n\tprint(final)", "s = input()\r\n\r\nc = \"\"\r\nr = len(s)\r\ni = 0\r\nwhile r !=i:\r\n\tif s[i]==\".\":\r\n\t\tc =c+\"0\"\r\n\t\ti = i +1\r\n\telif s[i]==\"-\" and s[i+1]==\".\":\r\n\t\tc = c+ \"1\"\r\n\t\ti = i +2\r\n\telif s[i]==\"-\" and s[i+1]==\"-\":\r\n\t\tc = c+ \"2\"\r\n\t\ti = i +2\r\nprint(c)\t", "a = input()\r\nb = []\r\nc = []\r\nfor i in a:\r\n b.append(i)\r\nj = 1\r\nwhile j <= len(b):\r\n if b[j-1]=='.':\r\n c.append('0')\r\n j += 1\r\n elif b[j-1]+b[j]=='-.':\r\n c.append('1')\r\n j += 2\r\n elif b[j-1]+b[j]=='--':\r\n c.append('2')\r\n j += 2\r\nprint(''.join(c))", "string = input()\r\nmessage = ''\r\ni = 0\r\n\r\nwhile i < len(string):\r\n if string[i] == '.':\r\n message += '0'\r\n i += 1\r\n elif string[i] == '-' and string[i+1] == '.':\r\n message += '1'\r\n i += 2\r\n elif string[i] == '-' and string[i+1] == '-':\r\n message += '2'\r\n i += 2\r\n\r\nprint(message)\r\n\r\n\r\n", "code=input()\r\nn=''\r\ni=0\r\nwhile i<len(code):\r\n if code[i]=='.':\r\n n+='0'\r\n i+=1\r\n elif code[i]=='-' and code[i+1]=='.':\r\n n+='1'\r\n i+=2\r\n elif code[i]=='-' and code[i+1]=='-':\r\n n+='2'\r\n i+=2\r\nprint(n)", "a=input()\r\nans=''\r\nx=0\r\nwhile x<len(a):\r\n if a[x]=='.':\r\n ans+='0'\r\n x+=1\r\n else:\r\n if a[x+1]=='.':\r\n ans+='1'\r\n else:\r\n ans+='2'\r\n x+=2\r\n \r\nprint(ans)\r\n", "s=input()\r\ni=0\r\nwhile i<len(s):\r\n for j in range(i,len(s)+1):\r\n q=s[i:j]\r\n if q=='.':\r\n print('0',end='')\r\n break\r\n elif q=='-.':\r\n print('1',end='')\r\n i=i+1\r\n break\r\n elif q=='--':\r\n print('2',end='')\r\n i=i+1\r\n break\r\n i=i+1", "borze = input().strip()\r\n\r\nternary = \"\"\r\ni = 0\r\nwhile i < len(borze):\r\n if borze[i] == '.':\r\n ternary += '0'\r\n elif borze[i:i+2] == '-.':\r\n ternary += '1'\r\n i += 1\r\n elif borze[i:i+2] == '--':\r\n ternary += '2'\r\n i += 1\r\n i += 1\r\n\r\nprint(ternary)\r\n", "# CF - 32B\r\ndef solve():\r\n inp = input()\r\n n = len(inp)\r\n res=\"\"\r\n i=0\r\n while i < n:\r\n if inp[i] == '-' and inp[i+1] == '.':\r\n res+=\"1\"\r\n i+=2\r\n elif inp[i] == '-' and inp[i+1] == '-':\r\n res+=\"2\"\r\n i+=2\r\n else:\r\n res+=\"0\"\r\n i+=1\r\n return res\r\n\r\n\r\nprint(solve())", "str = input()\r\ni = 0\r\nwhile(i<len(str)):\r\n\r\n if(str[i] == '.'):\r\n print(0,end='')\r\n i += 1\r\n elif(str[i+1] == '.'):\r\n print(1,end='')\r\n i += 2\r\n else:\r\n print(2,end='')\r\n i += 2\r\n\r\n", "code = input()\r\na = '.'\r\nb = '-'\r\na = []\r\nfor i in code:\r\n a.append(i)\r\nst = ''\r\ni = 0\r\nwhile i < len(a):\r\n if a[i] == '-' and a[i+1] == '-' :\r\n st += '2'\r\n i += 2\r\n elif a[i] == '-' and a[i+1] == '.' :\r\n st += '1'\r\n i += 2\r\n else:\r\n st += '0'\r\n i += 1\r\nprint(st)", "s=input()\r\n\r\ns1=\"\"\r\nfor i in s:\r\n s1+=i\r\n if s1==\".\":\r\n print(\"0\",end=\"\")\r\n s1=\"\"\r\n elif s1==\"-.\":\r\n print('1',end=\"\")\r\n s1=\"\"\r\n elif s1 == \"--\":\r\n print('2',end=\"\")\r\n s1=\"\"", "d=input()\r\ni=0\r\nwhile i<len(d):\r\n if d[i]=='-'and d[i+1]=='-':\r\n print(\"2\",end=\"\")\r\n i+=2\r\n elif d[i]=='-'and d[i+1]=='.':\r\n print(\"1\",end=\"\")\r\n i+=2\r\n else:\r\n print(\"0\",end=\"\")\r\n i+=1", "x=input()\r\nsol={\".\":0,\"-.\":1,\"--\":2}\r\nret=[]\r\ni=0\r\nwhile(i<len(x)):\r\n if x[i] in sol:\r\n print((sol[x[i]]),end=\"\")\r\n \r\n else:\r\n if x[i:i+2] in sol:\r\n print(sol[x[i:i+2]],end=\"\")\r\n i+=1\r\n i+=1\r\n", "n=input()\r\nn=list(n)\r\ncount=''\r\ni=0\r\nwhile i<len(n):\r\n if n[i]=='.':\r\n n.pop(i)\r\n count+='0'\r\n elif n[i]=='-' and n[i+1]=='.':\r\n n.pop(i)\r\n n.pop(i)\r\n count+='1'\r\n elif n[i]=='-' and n[i+1]=='-':\r\n n.pop(i)\r\n n.pop(i)\r\n count+='2'\r\nprint(count)", "\r\n\r\n\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef I(): return input().strip()\r\ndef II(): return int(input().strip())\r\ndef LI(): return [*map(int, input().strip().split())]\r\nimport copy\r\nimport string, math, time, functools, random, fractions\r\nfrom heapq import heappush, heappop, heapify\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, defaultdict, Counter, OrderedDict\r\nfrom itertools import permutations, combinations, groupby, count, filterfalse\r\nfrom operator import itemgetter\r\n\r\nfor _ in range(1):\r\n x = str(input())\r\n s = x\r\n s = s.replace('--','2')\r\n s = s.replace('-.','1')\r\n s = s.replace('.','0')\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = input()\r\nans = \"\"\r\ni=0\r\nwhile i<len(n)-1:\r\n if n[i]=='-':\r\n if n[i+1]=='.':\r\n ans+='1'\r\n i+=2\r\n else:\r\n ans+='2'\r\n i+=2\r\n else:\r\n ans+='0'\r\n i+=1\r\n\r\nif(i == len(n)-1):\r\n ans+='0'\r\n\r\nprint(ans)", "arr = input()\r\ny = len(arr)\r\nans = ''\r\ni = 0\r\nwhile(i <= y-1):\r\n\tif arr[i] == '.':\r\n\t\tans += '0'\r\n\t\ti += 1\r\n\telif arr[i] == arr[i+1]:\r\n\t\tans += '2'\r\n\t\ti += 2\r\n\telse:\r\n\t\tans += '1'\r\n\t\ti += 2\r\nprint(ans)", "def solve(string):\r\n n = len(string)\r\n string = list(string)\r\n i = 0\r\n ans = []\r\n while i < n:\r\n if string[i] == \".\":\r\n ans.append(\"0\")\r\n elif string[i] == \"-\":\r\n if string[i + 1] == \".\":\r\n ans.append(\"1\")\r\n elif string[i + 1] == \"-\":\r\n ans.append(\"2\")\r\n i += 1\r\n i += 1\r\n ans = \"\".join(ans)\r\n return ans\r\n\r\ndef main():\r\n string = input().strip()\r\n print(solve(string))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = input(); switchB = ''\r\n\r\nfor current in a:\r\n if current is '.' and switchB is '': print(0, end='')\r\n if current is '-' and switchB is '': switchB = '-'; continue\r\n \r\n if current is '.' and switchB is '-': print(1, end=''); switchB = ''\r\n if current is '-' and switchB is '-': print(2, end=''); switchB = ''\r\n ", "x = input()\r\ntup = tuple(x)\r\na = 0\r\nwhile True:\r\n if a==len(x):\r\n break\r\n if x[a]==\".\":\r\n a+=1\r\n print(\"0\",end=\"\")\r\n elif x[a]==\"-\" and x[a+1]==\".\":\r\n a+=2\r\n print(\"1\",end=\"\")\r\n elif x[a]==\"-\" and x[a+1]==\"-\":\r\n a+=2\r\n print(\"2\",end=\"\")\r\nprint()", "n = input()\r\nans = \"\"\r\ni = 0\r\nwhile i<len(n):\r\n if n[i] == \".\":\r\n ans += '0'\r\n else:\r\n i += 1\r\n if n[i] == \".\":\r\n ans += '1'\r\n else:\r\n ans += '2'\r\n i += 1\r\nprint(ans)", "s = input()\r\nh = []\r\nj = 0\r\nfor i in range(len(s)):\r\n if s[i] == \".\" and j == 0:\r\n h.append(\"0\")\r\n else:\r\n if j:\r\n if s[i] == \"-\":\r\n h.append(\"2\")\r\n else:\r\n h.append(\"1\")\r\n j = 0\r\n else:\r\n j = 1\r\nprint(\"\".join(h))\r\n", "s=input()\r\nn=[]\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n n.append(0)\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n n.append(1)\r\n i+=2\r\n elif s[i]=='-' and s[i+1]=='-':\r\n n.append(2)\r\n i+=2\r\nfor j in range(len(n)):\r\n print(n[j],end='')", "a=input()\na=a.replace('--','2')\na=a.replace('-.','1')\na=a.replace('.','0')\nprint(a)", "Borze = input()\r\n\r\nd ={\".\":\"0\", \"-.\":\"1\", \"--\":\"2\"}\r\n\r\nnew_str = []\r\n\r\nwhile len(Borze) != 0: \r\n if Borze[:2] in d: \r\n new_str.append(d[Borze[:2]])\r\n Borze = Borze[2:]\r\n elif Borze[:1] in d: \r\n new_str.append(d[Borze[:1]])\r\n Borze = Borze[1:]\r\n\r\nprint(''.join(new_str))", "str = input()\r\nl1 = []\r\nl2 = []\r\nfor i in range(len(str)):\r\n if str[i] == \".\":\r\n if len(l1) == 0:\r\n l2.append(\"0\")\r\n else:\r\n l2.append(\"1\")\r\n l1.pop()\r\n else:\r\n if len(l1) == 0:\r\n l1.append(\"-\")\r\n else:\r\n l1.pop()\r\n l2.append(\"2\")\r\nprint(\"\".join(l2))\r\n", "s = input()\r\nlyst = []\r\nout = ''\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == '.':\r\n lyst.append(0)\r\n i += 1\r\n else :\r\n if i == len(s) - 1:\r\n break\r\n else:\r\n if s[i + 1] == '.':\r\n lyst.append(1)\r\n i += 2\r\n elif s[i + 1] == '-':\r\n lyst.append(2)\r\n i += 2\r\nfor number in lyst:\r\n out += str(number)\r\nprint(out)", "\r\ndef rec(s):\r\n\r\n if len(s) == 0:\r\n return \"\"\r\n\r\n if s[0] == \".\":\r\n return \"0\" + rec(s[1:])\r\n\r\n if s[:2] == \"-.\":\r\n return \"1\" + rec(s[2:])\r\n\r\n return \"2\" + rec(s[2:])\r\n\r\nprint(rec(input()))", "n = input()\r\ni = 0\r\nwhile i < len(n):\r\n if n[i] == '.':\r\n print('0', end='')\r\n elif n[i] == '-' and n[i + 1] == '.':\r\n print('1', end='')\r\n i += 1\r\n elif n[i] == '-' and n[i + 1] == '-':\r\n print('2', end='')\r\n i += 1\r\n i += 1", "n=list(input())\r\n#n=x / a=y\r\na=''\r\ndef borze(x,y):\r\n while x!=[]:\r\n if x[0]=='.':\r\n y=y+'0'\r\n x.remove('.')\r\n elif x[0]=='-':\r\n if x[1]=='.':\r\n y=y+'1'\r\n x.remove('-')\r\n x.remove('.')\r\n else:\r\n y=y+'2'\r\n x.remove('-')\r\n x.remove('-')\r\n print(y)\r\nborze(n,a)\r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n \r\n", "def decode(code):\n almost_one = False\n almost_two = False\n decoded = []\n for c in code:\n if(c=='.'):\n if(almost_one):\n decoded.append('1')\n else:\n decoded.append('0')\n almost_one = False\n almost_two = False\n elif(c=='-'):\n if(almost_two):\n decoded.append('2')\n almost_two = False\n almost_one = False\n else:\n almost_one = True\n almost_two = True\n return ''.join(decoded)\n\ncode = input()\nprint(decode(code))", "s=input()\r\ni=0\r\ns1=''\r\nwhile(i<len(s)):\r\n if(s[i]==\".\"):\r\n s1=s1+'0'\r\n i=i+1\r\n elif(s[i]==\"-\"):\r\n if(s[i+1]=='-' and i+1<len(s)):\r\n s1=s1+'2'\r\n elif(s[i+1]=='.' and i+1<len(s)):\r\n s1=s1+'1'\r\n i=i+2\r\nprint(s1)", "s = input()\r\n\r\n\r\ndef dorze():\r\n x = 0\r\n output = \"\"\r\n while x < len(s):\r\n if s[x] == \".\":\r\n output += \"0\"\r\n elif s[x] == \"-\":\r\n if s[x + 1] == \".\":\r\n output += \"1\"\r\n x = x + 1\r\n else:\r\n output += \"2\"\r\n x = x + 1\r\n x = x + 1\r\n return output\r\n\r\n\r\nprint(dorze())\r\n", "s = list(input(''))\no = ''\nfor i in range(len(s)):\n # print(s, o)\n if i+1 < len(s) and s[i] != '': # shouldn't run on the last thing\n if s[i] == '-' and s[i+1] == '-':\n o += '2'\n s[i], s[i+1] = '', ''\n elif s[i] == '-' and s[i+1] == '.':\n o += '1'\n s[i], s[i+1] = '', ''\n elif s[i] == '.':\n o += '0'\n s[i] = ''\n\n elif i+1 == len(s) and s[i] == '.':\n s[i] = ''\n o += '0'\n\nprint(o)\n", "def dekod(z,q):\r\n if z=='':\r\n return q\r\n if z[0]=='.':\r\n q=q+'0'\r\n z=z[1:len(z)]\r\n return dekod(z,q)\r\n if (z[0]=='-')and(z[1]=='.'):\r\n q = q + '1'\r\n z = z[2:len(z)]\r\n return dekod(z, q)\r\n if (z[0]=='-')and(z[1]=='-'):\r\n q = q + '2'\r\n z = z[2:len(z)]\r\n return dekod(z, q)\r\ns=''\r\ns=input()\r\nq=''\r\nprint(dekod(s,q))", "m=[0,0]\r\ni=0\r\nans=\"\"\r\nl=input()\r\npj=len(l)\r\nwhile(i<pj):\r\n\tif l[i]==\"-\":\r\n\t\tif l[i+1]==\".\":ans+=\"1\"\r\n\t\telif l[i+1]==\"-\":ans+=\"2\"\r\n\t\ti+=1\r\n\telif l[i]==\".\":ans+=\"0\"\r\n\ti+=1\r\nprint(ans)\r\n", "string_taker = input(\"\")\r\nstring_taker = string_taker.replace('--', \"2\")\r\nstring_taker = string_taker.replace(\"-.\", \"1\")\r\nstring_taker = string_taker.replace(\".\", \"0\")\r\nprint(string_taker)\r\n", "inp=input()\r\ninp=inp.replace(\"--\",\"2\")\r\ninp=inp.replace(\"-.\",\"1\")\r\ninp=inp.replace(\".\",\"0\")\r\nprint(inp)\r\n\r\n", "a = input()\r\nb = a.replace('--', '2')\r\nb = b.replace('-.', '1')\r\nb = b.replace('.', '0')\r\nprint(b)", "n=list(input())\r\nans=\"\"\r\n\r\nwhile len(n)>0:\r\n if n[0]==\".\":\r\n ans+=\"0\"\r\n n.remove(n[0])\r\n elif n[0]==\"-\":\r\n if n[1]==\".\":\r\n ans+=\"1\"\r\n n.remove(n[0])\r\n n.remove(n[0])\r\n elif n[1]==\"-\":\r\n ans+=\"2\"\r\n n.remove(n[0])\r\n n.remove(n[0])\r\nprint(ans) \r\n\r\n", "text = list(input())\r\n\r\nchar_encode = ''\r\n\r\nfor i in text:\r\n char_encode += i\r\n\r\n if char_encode == '.': \r\n print('0', end='')\r\n char_encode = ''\r\n elif char_encode == '-.': \r\n print('1', end='')\r\n char_encode = ''\r\n elif char_encode == '--': \r\n char_encode = ''\r\n print('2', end='')\r\n", "x=input()\r\nc=''\r\ni=0\r\nwhile i<len(x):\r\n if x[i]=='-' and x[i+1]=='-':\r\n c+='2'\r\n i+=2\r\n elif x[i]=='-' and x[i+1]=='.':\r\n c+='1'\r\n i+=2\r\n else:\r\n c+='0'\r\n i+=1\r\nprint(c)\r\n\r\n \r\n", "s = input()\r\nr = \"\"\r\nt = 0\r\nfor i in range(len(s)):\r\n if t == 1:\r\n t = 0\r\n elif s[i] == \".\":\r\n r += \"0\"\r\n else:\r\n if s[i+1] == \".\":\r\n r += \"1\"\r\n else:\r\n r += \"2\"\r\n t = 1\r\nprint(r)", "s = input()\r\ni = 0\r\nwhile i < len(s):\r\n if (s[i] == \".\"):\r\n print(\"0\", end = \"\")\r\n else:\r\n if (s[i] == \"-\" and s[i + 1] == \".\"):\r\n print(\"1\", end = \"\")\r\n i += 1\r\n else:\r\n print(\"2\", end = \"\")\r\n i += 1\r\n i += 1", "n=input()\r\ni=0\r\ns=\"\"\r\nwhile i<len(n):\r\n if n[i]==\"-\":\r\n if n[i+1]==\"-\":\r\n s=s+\"2\"\r\n i=i+2\r\n else:\r\n s=s+\"1\"\r\n i=i+2\r\n else:\r\n s=s+\"0\"\r\n i=i+1\r\nprint(s)", "import re\r\n\r\ns = input()\r\ns = re.sub('\\--', '2', s)\r\ns = re.sub('-\\.', '1', s)\r\ns = re.sub('\\.', '0', s)\r\nprint(s)", "b = input()\r\nr = \"\"\r\ni= 0\r\nwhile i < len(b):\r\n if b[i] == '.':\r\n r += '0'\r\n i += 1\r\n elif b[i:i + 2] == '-.':\r\n r += '1'\r\n i += 2\r\n elif b[i:i + 2] == '--':\r\n r += '2'\r\n i += 2\r\nprint(r)\r\n", "p=input()\r\nq=''\r\nn=len(p)\r\ni=-1\r\nwhile i<(n-1):\r\n i+=1\r\n if p[i]=='-':\r\n if p[i+1]=='.':\r\n q+='1'\r\n if p[i+1]=='-':\r\n q+='2'\r\n i+=1\r\n else:\r\n q+='0'\r\nprint(q)", "class solution:\r\n def __init__(self,s):\r\n self.s = s\r\n self.answer = ''\r\n def calculation(self):\r\n i=0\r\n while i < len(s):\r\n if s[i] == '.':\r\n self.answer += '0'\r\n i+=1\r\n elif s[i] =='-' and s[i+1] == '.':\r\n self.answer += '1'\r\n i+=2\r\n elif s[i] == '-' and s[i+1] == '-':\r\n self.answer += '2'\r\n i+=2\r\ns=input()\r\nroot = solution(s)\r\nroot.calculation()\r\nprint(root.answer)", "a = input()\n\na = a.replace('--', '2')\na = a.replace('-.', '1')\na = a.replace('.', '0')\nprint(a)\n", "key = {'.': '0', '-.': '1', '--': '2'}\r\ns = input()\r\nres = ''\r\nwhile s != '':\r\n for keys in key:\r\n if keys == s[0]:\r\n s = s[len(keys):]\r\n res += key[keys]\r\n break\r\n elif keys == s[0]+s[1]:\r\n s = s[len(keys):]\r\n res += key[keys]\r\n break\r\nprint(res)\r\n", "s = [i for i in input()]\r\nans = \"\"\r\ni=0\r\nwhile i < len(s):\r\n if s[i]=='.':\r\n ans+=\"0\"\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='-':\r\n ans+=\"2\"\r\n i+=2\r\n elif s[i+1]=='.':\r\n ans+=\"1\"\r\n i+=2\r\n\r\nprint(ans)", "#loser707\r\ns=input()\r\ni=0\r\na=[]\r\nwhile i<len(s):\r\n if s[i:i+2]=='-.':\r\n a.append(1)\r\n i=i+2\r\n elif s[i:i+2]=='--':\r\n a.append(2)\r\n i=i+2\r\n else:\r\n a.append(0)\r\n i=i+1\r\na=[str(u) for u in a]\r\nprint(''.join(a))", "s=input()\r\nc=\"\"\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i:i+2]==\"--\":\r\n c+=\"2\"\r\n i+=2\r\n elif s[i:i+2]==\"-.\":\r\n c+=\"1\"\r\n i+=2\r\n elif s[i]==\".\":\r\n c+=\"0\"\r\n i+=1\r\nprint(c)", "line = input()\r\n \r\np = False # previous was '-'\r\nfor c in line:\r\n if c=='.':\r\n if p==True:\r\n print(1,end='')\r\n else:\r\n print(0,end='')\r\n p = False\r\n elif c=='-':\r\n if p==True:\r\n print(2,end='')\r\n p=False\r\n else:\r\n p=True", "#https://codeforces.com/contest/1541/problem/A\r\n#https://codeforces.com/contest/1539/problem/A\r\n'''\r\nn,q=map(int,input().split())\r\ns=list(input())\r\npre=[0]*n\r\npre[0]=ord(s[0])-ord('a')+1\r\nfor i in range(1,n):\r\n pre[i]=pre[i-1]+ord(s[i])-ord('a')+1\r\nfor i in range(q):\r\n l,r=map(int,input().split())\r\n l=l-1\r\n r=r-1\r\n #string=s[l:r+1]\r\n if l==0:\r\n ans=pre[r]\r\n else:\r\n ans=pre[r]-pre[l-1]\r\n print(ans)\r\n \r\n'''\r\n\r\ns=input()\r\ns=s.replace('--','2')\r\ns=s.replace('-.','1')\r\ns=s.replace('.','0')\r\nprint(s)\r\n", "x = input()\r\ns = ''\r\nd ={'.' : '0',\r\n '-.' : '1',\r\n '--' : '2'}\r\nn = ''\r\nfor i in x :\r\n s += i\r\n if s in d: \r\n n += d[s]\r\n s = ''\r\nprint((n))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nborze = list(input())\r\nwhile len(borze)>0:\r\n if borze[0]=='.':\r\n print('0', end='')\r\n del borze[0]\r\n elif borze[1]=='.':\r\n print('1', end='')\r\n del borze[0:2]\r\n else:\r\n print('2', end='')\r\n del borze[0:2]\r\n", "code =input()\r\ndecode = ''\r\na = 0\r\nwhile a!= len(code):\r\n if code[a]==\".\":\r\n decode+=\"0\"\r\n a += 1\r\n elif code[a] ==\"-\" and code[a+1]==\".\":\r\n decode+=\"1\"\r\n a += 2\r\n else:\r\n a += 2\r\n decode +=\"2\"\r\nprint(decode)", "encoded = input()\r\nn = len(encoded)\r\ni = 0\r\ndecoded = \"\"\r\nwhile i < n:\r\n if encoded[i] == '.':\r\n decoded = f\"{decoded}0\"\r\n else:\r\n if encoded[i+1] == '.':\r\n decoded = f\"{decoded}1\"\r\n else:\r\n decoded = f\"{decoded}2\"\r\n i += 1\r\n i += 1\r\nprint(decoded)\r\n", "#######<786>#######\r\n#######[_PUTIN Still Alive_]######\r\n######Let's start rock and Roolllll#####\r\nfrom re import search as Vikings_Putin\r\n'''\r\nsudo upgrade && update\r\npip install PUTIN\r\nLoading PUTIN...################### 99% done\r\nDownload Successfully...\r\nfrom PUTIN import Putin_er_Khel as Conquer\r\n'''\r\nR=str.replace;print(R(R(R(input(),'--','2'),'-.','1'),'.','0'))\r\n\"\"\"\r\n___Vladimir Putin_____\r\n\"\"\"\r\n", "import sys, math, cmath, time, collections\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\r\nfrom math import ceil, floor, log, log2, sqrt, gcd, factorial, pow, pi\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n# SOME GENERAL HELPER\r\ndef input_as_array():\r\n return list(map(int, input().split()))\r\n\r\n\r\nstart_time = time.time()\r\n\r\n\r\ndef solve(s):\r\n hmap = {\".\": '0', \"-.\": '1', \"--\": '2'}\r\n s = [c for c in s]\r\n q = deque(s)\r\n res = ''\r\n while q:\r\n node = q.popleft()\r\n if node == '.':\r\n res += hmap[node]\r\n elif node == '-':\r\n nxt = q.popleft()\r\n if nxt == '.':\r\n res += hmap['-.']\r\n elif nxt == '-':\r\n res += hmap['--']\r\n print(res)\r\n\r\n\r\ndef main():\r\n s = input()\r\n solve(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n LOCAL = False\r\n\r\n # If it's Local - Get I/P from file\r\n if LOCAL:\r\n sys.stdin = open(\"../io/data.in\", \"r\")\r\n sys.stdout = open(\"../io/data.out\", \"w\")\r\n\r\n testcases = 1\r\n for i in range(testcases):\r\n main()\r\n\r\n # If it's local - Print this O/P\r\n if LOCAL:\r\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\r\n sys.stdout.close()\r\n", "#BOILER CODE .... \r\nmap_inputs = lambda Type=int : map(Type,input().strip().split())\r\narray_input = lambda n,Type=int : list(map_inputs(Type)) [:n]\r\nmatrix_input = lambda row,col,Type=int: [array_input(col,Type) for _ in range(row)]\r\nstr_matrix = lambda row,col: [input().strip()[:col] for _ in range(row)]\r\nstr_listed_matrix = lambda row,col:[list(input().strip())[:col] for _ in range(row)]\r\ntest_cases = lambda t=1: [i for i in range(t)]\r\n\r\n#MAIN CODE\r\n\r\n\r\ndef main():\r\n\t\r\n\ts = input()\r\n\tn = len(s)\r\n\ti = 0\r\n\twhile i < n:\r\n\t\tif s[i] == '.':\r\n\t\t\tprint(0,end=\"\")\r\n\t\telse:\r\n\t\t\tif s[i+1] == '.':\r\n\t\t\t\tprint(1,end=\"\")\r\n\t\t\telse:\r\n\t\t\t\tprint(2,end=\"\")\r\n\t\t\ti +=1\r\n\t\ti += 1\r\n\r\nif __name__ == '__main__':\r\n\tfor test in test_cases():\r\n\t\tmain()", "inpuuut = input()\ntemp = \"\"\nlevl = 0\nwhile levl < len(inpuuut):\n if inpuuut[levl] == \".\":\n temp += '0'\n else:\n levl += 1\n if inpuuut[levl] == \".\":\n temp += '1'\n else:\n temp += '2'\n levl += 1\nprint(temp)\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\t\t\t \t\t", "s = input()\r\nn = \"\"\r\ns2 = \"\"\r\ni = 0\r\nwhile i<len(s)-1:\r\n if s[i] == \".\":\r\n n = n+\"0\"\r\n s2 = s2+\".\"\r\n else:\r\n if s[i+1] == \".\":\r\n n = n+\"1\"\r\n s2 = s2+\"-.\"\r\n else:\r\n n = n+\"2\"\r\n s2 =s2+\"--\"\r\n i = i+1 \r\n i = i+1\r\nif s2 == s:\r\n print(n)\r\nelse:\r\n print(n+\"0\")", "code = input()\r\n\r\nif \"--\" in code:\r\n code= code.replace('--','2')\r\nif '-.' in code:\r\n code= code.replace('-.','1')\r\nif '.' in code:\r\n code= code.replace('.','0')\r\n\r\nprint(code)\r\n", "from collections import defaultdict\r\nimport math\r\nx=input()\r\nn=len(x)\r\nans=\"\"\r\ni=0\r\nwhile(i<n):\r\n if(x[i]==\".\"):\r\n ans+='0'\r\n i+=1\r\n elif(x[i]==\"-\"):\r\n if(x[i+1]==\".\"):\r\n ans+='1'\r\n else:\r\n ans+=\"2\"\r\n i+=2\r\nprint(ans)", "a=str(input())\r\nx=int(0)\r\ns=str(\"\")\r\nl=len(a)\r\nwhile x<l:\r\n if a[x]=='.':\r\n s=s+'0'\r\n x=x+1\r\n else:\r\n if a[x+1]=='.':\r\n s=s+'1'\r\n else:\r\n s=s+'2'\r\n x=x+2\r\nprint(s)", "n = input()\ni = 0\nans = ''\nwhile i<len(n):\n if n[i]=='-':\n if n[i+1]=='.':\n ans += '1'\n else:\n ans+='2'\n i+=1\n elif n[i]=='.':\n ans += '0'\n i+=1\nprint(ans)\n", "x = input()\r\na = 0\r\nz = 2\r\nfor i in range(0,len(x)):\r\n # if z < len(x):\r\n if x[a:z].startswith('.'):\r\n print(0, end='')\r\n a += 1\r\n z += 1\r\n\r\n elif x[a:z] == '-.':\r\n print(1, end='')\r\n a += 2\r\n z += 2\r\n\r\n elif x[a:z] == '--':\r\n print(2, end='')\r\n a += 2\r\n z += 2\r\n", "s=input(\"\")\r\ns2=s.replace('--','2')\r\ns3=s2.replace('-.','1')\r\ns4=s3.replace('.','0')\r\n\r\nprint(s4)", "s=input()\r\np=str()\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n p=p+'0'\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n p=p+'1'\r\n i+=2\r\n elif s[i]=='-' and s[i+1]=='-':\r\n p=p+'2'\r\n i+=2\r\nprint(p)", "s = input()\r\nif \".\" in s or \"-.\" in s or \"--\" in s:\r\n n_s = s.replace(\"--\" , \"2\")\r\n n_s1 = n_s.replace(\"-.\" , \"1\")\r\n n_s2 = n_s1.replace(\".\" , \"0\")\r\n\r\nprint(n_s2)\r\n", "listans = input()\r\nanswer = []\r\ni = 0\r\nwhile i < len(listans):\r\n if listans[i] == '.':\r\n answer.append(0)\r\n elif listans[i] == '-' and listans[i+1] == '.':\r\n answer.append(1)\r\n i += 1\r\n elif listans[i] == '-' and listans[i+1] == '-':\r\n answer.append(2)\r\n i += 1\r\n i += 1\r\nfor i in answer:\r\n print(i, end=\"\")\r\n", "l = list(input())\r\ni = 0\r\nans = ''\r\n\r\nwhile i < len(l):\r\n if l[i] == '.':\r\n ans += '0'\r\n i += 1\r\n else:\r\n if l[i+1] == '.':\r\n ans += '1'\r\n else:\r\n ans += '2'\r\n i += 2\r\n\r\nprint(ans)\r\n", "text=input()\nrep=str.replace(str.replace(str.replace(text,'--','2'),'-.','1'),'.','0')\nprint(rep)", "s = input()\r\ns_itog = ''\r\nwhile len(s) > 2:\r\n\r\n if s[0] + s[1] == '--':\r\n s_itog += '2'\r\n s = s.replace('--', '', 1)\r\n if len(s) <= 2:\r\n break\r\n if s[0] + s[1] == '-.':\r\n s_itog += '1'\r\n s = s.replace('-.', '', 1)\r\n if len(s) <= 2:\r\n break\r\n if s[0] == '.':\r\n s_itog += '0'\r\n s = s.replace('.', '',1)\r\n if len(s) <= 2:\r\n break\r\nif s == '--':\r\n s_itog += '2'\r\nelif s == '-.':\r\n s_itog += '1'\r\nelif s == '..':\r\n s_itog += '00'\r\nelse:\r\n s_itog += '0'\r\nprint(s_itog)", "a=input(\"\")\r\nb=\"\"\r\nfor c in a:\r\n b+=c+\" \"\r\nb=b.split()\r\nc=\"\"\r\nd=\"\"\r\nwhile(len(b)!=0):\r\n ret=b.pop(0)\r\n if(len(c)!=0):\r\n if(ret=='.'):\r\n d+='1'\r\n c=\"\"\r\n continue\r\n if(ret=='-'):\r\n d+='2'\r\n c=\"\"\r\n continue\r\n else:\r\n if(ret=='.'):\r\n d+='0'\r\n continue\r\n if(ret=='-'):\r\n c=ret\r\n continue\r\nprint(d)", "str = list(input())\r\n\r\narr = ['' for _ in range(len(str))]\r\n\r\ni = 0\r\nj = 0\r\nwhile i < len(str):\r\n if str[i] == '-':\r\n if str[i+1] == '.':\r\n arr[j] = '1'\r\n else:\r\n arr[j] = '2'\r\n \r\n i += 2\r\n else:\r\n arr[j] = '0'\r\n i += 1\r\n\r\n j += 1\r\n\r\nprint(\"\".join(arr))", "encode = input()\r\nans = ''\r\ni = 0\r\nn = len(encode)\r\nwhile i<n:\r\n if encode[i] == '.':\r\n ans = ans + '0'\r\n i = i+1\r\n elif encode[i] == '-' and encode[i+1] == '.':\r\n ans = ans + '1'\r\n i= i +2\r\n elif encode[i]=='-' and encode[i+1]=='-':\r\n ans = ans + '2'\r\n i=i+2\r\n\r\nprint(ans)\r\n \r\n\r\n \r\n", "st = input()\r\nst = st.replace('--','2')\r\nst = st.replace('-.','1')\r\nst = st.replace('.','0')\r\nprint(st)", "n = input()\r\ns=\"\"\r\nlis=[\"--\",\"-.\",\".\"]\r\nfor i in lis:\r\n if(i==\"--\"):\r\n s = n.replace(i,\"2\")\r\n elif(i==\"-.\") :\r\n s = n.replace(i,\"1\")\r\n elif(i==\".\") :\r\n s = n.replace(\".\",\"0\")\r\n n = s\r\nprint(s)", "n=input()\r\nl=len(n)\r\ni=1\r\nres=\"\"\r\nwhile(i<l):\r\n if n[i-1]==\"-\" and n[i]==\"-\":\r\n res+=\"2\"\r\n i+=2\r\n \r\n elif n[i-1]==\"-\" and n[i]==\".\":\r\n res+=\"1\"\r\n i+=2\r\n elif n[i-1]==\".\" and n[i]==\".\":\r\n res+=\"0\"\r\n i+=1\r\n elif n[i-1]==\".\" and n[i]==\"-\":\r\n res+=\"0\" \r\n i+=1\r\nif (l-1==i-1):\r\n res+=\"0\"\r\nprint(res)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Apr 14 03:18:55 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\nn=input()\r\np=0\r\nl=''\r\nfor i in range(len(n)):\r\n if p:\r\n p=0\r\n continue\r\n if n[i]=='.':\r\n l+='0'\r\n elif n[i]+n[i+1]=='-.':\r\n l+='1'\r\n p=1\r\n elif n[i]+n[i+1]=='--':\r\n l+='2'\r\n p=1\r\nprint(l)\r\n ", "data = input()\r\ni = 0\r\nwhile i < len(data):\r\n if data[i] == '.':\r\n print(\"0\", end=\"\")\r\n i += 1\r\n elif data[i] == '-':\r\n if data[i + 1] == '.':\r\n print(\"1\", end=\"\")\r\n i += 2\r\n elif data[i + 1] == '-':\r\n print(\"2\", end=\"\")\r\n i += 2\r\n else:\r\n i += 1\r\n", "if __name__=='__main__':\r\n n=input()\r\n i=0\r\n while i<len(n):\r\n try:\r\n if n[i]=='.':\r\n print(0,end='')\r\n i+=1\r\n elif n[i]=='-' and n[i+1]=='.':\r\n i=i+2\r\n print(1,end='')\r\n \r\n else:\r\n i=i+2\r\n print(2,end='')\r\n \r\n except:\r\n None\r\n \r\n \r\n ", "a = input()\r\nchange = False\r\ncount = 0\r\nfor i in range(0, len(a)-1):\r\n if change:\r\n change = False\r\n elif a[i] == '-' and a[i+1] == '-':\r\n print(2, end=\"\")\r\n count += 2\r\n change = True\r\n elif a[i] == '-' and a[i+1] == '.':\r\n print(1, end=\"\")\r\n change = True\r\n count += 2\r\n elif a[i] == '.':\r\n print(0, end=\"\")\r\n count += 1\r\n\r\nif count < len(a):\r\n print(0)\r\n \r\n \r\n ", "def main():\r\n stroka = input()\r\n stroka = stroka.replace('--', '2')\r\n stroka = stroka.replace('-.', '1')\r\n stroka = stroka.replace('.', '0')\r\n\r\n return stroka\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n\r\n\r\n", "s = str(input()).replace(\"--\", \"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\nprint(s) \r\n", "borzeCode = input()\r\nborzeCode = borzeCode.replace('--', '2').replace('-.', '1').replace('.', '0')\r\nprint(borzeCode)", "s = input()\r\nz = \"\"\r\ng = \"\"\r\nfor i in s:\r\n z += i\r\n if z[-1] == '.':\r\n if z == \"-.\":\r\n g += \"1\"\r\n if z == \".\":\r\n g += \"0\"\r\n z = \"\"\r\n elif len(z) == 2:\r\n g += \"2\"\r\n z = \"\"\r\nprint(g)", "s=input()\r\na=s.replace(\"--\",\"2\")\r\nb=a.replace(\"-.\",\"1\")\r\nprint(b.replace(\".\",\"0\"))", "d={\".\":\"0\",\"-.\":\"1\",\"--\":\"2\"}\r\ns=input()\r\nj=\"\"\r\nr=\"\"\r\nfor i in s:\r\n j+=i\r\n if j not in d:\r\n continue\r\n else:\r\n r+=d[j]\r\n j=\"\"\r\nprint(r)", "code = input()\r\n\r\n#Caso 1 . = 0\r\n#Caso 2 -.= 1\r\n#Caso 3 --= 2\r\ni = 0\r\nwhile i < len(code):\r\n if code[i] == \".\":\r\n print(\"0\",end=\"\")\r\n i+=1\r\n elif code[i] == \"-\":\r\n if code[i+1] == \".\":\r\n print(\"1\",end=\"\")\r\n elif code[i+1] == \"-\":\r\n print(\"2\",end=\"\")\r\n i+=2", "b = input()\r\nif \"--\" in b:\r\n b = b.replace(\"--\",\"2\")\r\nif \"-.\" in b:\r\n b = b.replace(\"-.\",\"1\")\r\nif \".\" in b:\r\n b = b.replace(\".\",\"0\")\r\n\r\nprint(b)", "\r\ns = input()\r\nprev = \"\"\r\nans = \"\"\r\nfor x in s:\r\n if x == \".\" and prev == \"-\":\r\n ans += \"1\"\r\n prev = \"\"\r\n elif x == \".\":\r\n ans += \"0\"\r\n elif prev == \"-\":\r\n ans += \"2\"\r\n prev = \"\"\r\n else:\r\n prev +=x\r\nprint(ans)\r\n", "s = input()\r\nres = ''\r\nwhile s:\r\n if s[0] == '.':\r\n res += \"0\"\r\n s = s[1:]\r\n elif s[:2] == '-.':\r\n res += \"1\"\r\n s = s[2:]\r\n elif s[:2] == '--':\r\n res += \"2\"\r\n s = s[2:]\r\nprint(res)", "Cad=input()\r\nRes=\"\"\r\nDigi=\"\"\r\nK=0\r\nwhile(K<len(Cad)):\r\n if(Cad[K]==\".\"):\r\n Digi=\"0\"\r\n K+=1\r\n else:\r\n if((Cad[K]==\"-\")and(Cad[K+1]==\".\")):\r\n Digi=\"1\"\r\n else:\r\n Digi=\"2\"\r\n K+=2\r\n Res+=Digi\r\nprint(Res)\r\n", "def solve():\r\n s = input() + ' '\r\n ans = ''\r\n n = len(s) - 1\r\n i = 0\r\n while(i != n):\r\n if(s[i] == '.'): \r\n ans += '0'\r\n i += 1\r\n continue\r\n if(s[i] == '-' and s[i + 1] == '.'):\r\n ans += '1'\r\n i += 2\r\n continue\r\n else:\r\n ans += '2'\r\n i += 2\r\n return ans\r\n\r\nprint(solve())", "def main():\r\n s=input()\r\n i=0;ans=''\r\n while i<=len(s)-1:\r\n if s[i]=='-' and s[i+1]=='-': ans+='2';i+=2;\r\n elif s[i]=='-' and s[i+1]=='.': ans+='1';i+=2;\r\n else: ans+='0'; i+=1\r\n return ans\r\nprint(main())", "s = input()\r\ni = 0\r\nwhile i < len(s):\r\n if (s[i] == \"-\" and s[i+1] == \".\"):\r\n print(1, end = \"\")\r\n i += 2\r\n elif (s[i] == \"-\" and s[i+1] == \"-\") :\r\n print(2, end = \"\")\r\n i += 2\r\n elif s[i] == \".\":\r\n print(0, end = \"\")\r\n i += 1\r\n", "string=input()\r\nlst=list(string)\r\ni=0\r\nlst1=[]\r\nwhile i<len(lst):\r\n if lst[i]==\".\":\r\n lst1.append(\"0\")\r\n i+=1\r\n elif lst[i]==\"-\" and lst[i+1]==\".\":\r\n lst1.append(\"1\")\r\n i+=2\r\n elif lst[i]==\"-\"and lst[i+1]==\"-\":\r\n lst1.append(\"2\")\r\n i+=2\r\nfor i in lst1:\r\n print(i,end=\"\")\r\n", "# LUOGU_RID: 98007316\nS=str.replace\r\nprint(S(S(S(input(),'--','2'),'-.','1'),'.','0'))", "a=input()\r\nans=''\r\nx=0\r\nwhile x<len(a):\r\n if a[x]=='.':\r\n ans+='0'\r\n x+=1\r\n elif a[x:x+2]=='-.':\r\n ans+='1'\r\n x+=2\r\n else:\r\n ans+='2'\r\n x+=2\r\nprint(ans)", "# n=int(input())\r\n# s1=0\r\n# s2=0\r\n# s3=0\r\n# for _ in range(n):\r\n# x,y,z=(map(int,input().split()))\r\n# s1=s1+x\r\n# s2=s2+y\r\n# s3=s3+z\r\n#\r\n# if s1==0 and s2==0 and s3==0:\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n\r\n# l=[]\r\n# for i in range(5):\r\n# arr=list(map(int,input().split()))\r\n# l.append(arr)\r\n# # print(l)\r\n# x,y=3,3\r\n# for i in range(1,6):\r\n# for j in range(1,6):\r\n# if l[i-1][j-1]==1:\r\n# print(abs(x-i)+abs(y-j))\r\n\r\n\r\n# n,t=map(int,input().split())\r\n# s=input()\r\n#\r\n# for i in range(t):\r\n#\r\n#\r\n# s=s.replace(\"BG\",'GB')\r\n#\r\n#\r\n# print(s)\r\n\r\ns=input()\r\nfor i in range(len(s)):\r\n s = s.replace(\"--\", '2')\r\n s = s.replace(\"-.\", \"1\")\r\n s=s.replace(\".\",'0')\r\n\r\n\r\n\r\nprint(s)\r\n", "n = input()\r\nn = n.replace(\"--\",\"2\").replace(\"-.\", \"1\").replace(\".\", \"0\")\r\nprint(n)\r\n", "s=input()\r\nn=len(s)\r\ni=0\r\nwhile(i<n):\r\n if(s[i]=='.'):\r\n print(0,end='')\r\n else:\r\n if(s[i+1]=='-'):\r\n print(2,end='')\r\n else:\r\n print(1,end='')\r\n i+=1\r\n i+=1\r\n", "s=input()\r\ni=0 \r\nans=\"\"\r\nwhile i<len(s):\r\n if (i+1)<len(s):\r\n if s[i]=='-':\r\n if s[i+1]=='.':\r\n ans+='1'\r\n if s[i+1]=='-':\r\n ans+='2'\r\n i+=2 \r\n else:\r\n ans+='0'\r\n i+=1 \r\n else:\r\n ans+='0'\r\n i+=1 \r\nprint(ans)", "k = input()\nn = len(k)\n\ni = 0\nans = \"\"\n\nwhile i < n:\n if k[i] == '.':\n ans += '0'\n i += 1\n else:\n if k[i+1] == '.':\n ans += '1'\n else:\n ans += '2'\n i += 2\n\nprint(ans)\n\n", "\r\ns = input()\r\n\r\nt = 0\r\np = \"\"\r\nwhile t<len(s):\r\n if s[t]==\".\":\r\n t+=1\r\n p+=\"0\"\r\n elif s[t] == \"-\" and s[t+1] == \".\":\r\n p+=\"1\"\r\n t+=2\r\n elif s[t] == '-' and s[t+1] == \"-\":\r\n t +=2\r\n p+=\"2\"\r\n\r\nprint(p)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 26 21:39:24 2021\r\n\r\n@author: cheeh\r\n\"\"\"\r\n\r\ns=list(input())\r\ny=[]\r\nk=0\r\nwhile k<len(s):\r\n if s[k]=='.':\r\n y.append('0')\r\n k+=1\r\n elif s[k]=='-':\r\n if k!=(len(s)-1):\r\n if s[k+1]=='-':\r\n y.append('2')\r\n k+=2\r\n else:\r\n y.append('1')\r\n k+=2\r\n else:\r\n y.append('1')\r\n k+=1\r\nif y!=[]:\r\n print(''.join(y))\r\nelse:\r\n print('')", "l=input()\r\na=len(l)\r\nf=\"\"\r\ni=0\r\nwhile i<a:\r\n if l[i]==\"-\":\r\n if l[i+1]==\".\":\r\n f+=\"1\"\r\n i+=2\r\n elif l[i+1]==\"-\":\r\n f+=\"2\"\r\n i+=2\r\n elif l[i]==\".\":\r\n f+=\"0\"\r\n i+=1\r\nprint(f)", "borze = input()\r\n\r\nborze = borze.replace('--', '2')\r\nborze=borze.replace('-.', '1')\r\nborze=borze.replace('.', '0')\r\n\r\nprint(borze)", "a=input('')\r\nc=[]\r\nif a!='.':\r\n for b in a :\r\n c.append(b)\r\n flag=True\r\n count=0\r\n m=len(c)\r\n m=m*m\r\n while flag:\r\n for i in range(0,len(c)-1,2):\r\n count+=1\r\n if c[i]=='.' and c[i+1]=='-' and count==1:\r\n c[i]='0'\r\n c.insert(i+1,'3')\r\n break\r\n elif c[i]=='.' and c[i+1]=='-' and count!=1:\r\n c[i]='0'\r\n c.insert(i+1,'3')\r\n break\r\n elif c[i]=='-' and c[i+1]=='.':\r\n c[i+1]='3'\r\n c[i]='1'\r\n elif c[i]=='-' and c[i+1]=='-':\r\n c[i+1]='3'\r\n c[i]='2'\r\n elif count==m:\r\n flag=False\r\n break\r\n j=[]\r\n str1=''\r\n for w in range(len(c)):\r\n if c[w]!='3' and c[w]!='.':\r\n o=c[w]\r\n j.append(o)\r\n elif c[w]=='.':\r\n c[w]='0'\r\n o=c[w]\r\n j.append(o)\r\n else:\r\n continue\r\n str1=''\r\n for k in j:\r\n str1+=k\r\n int(str1)\r\n print(str1)\r\nelif a=='.':\r\n print(0)\r\n", "num = input()\r\n\r\nbuffer = ''\r\nans = ''\r\n\r\nfor ch in num:\r\n buffer += ch\r\n\r\n if buffer == '.':\r\n ans += '0'\r\n buffer = ''\r\n elif buffer == '-.':\r\n ans += '1'\r\n buffer = ''\r\n elif buffer == '--':\r\n ans += '2'\r\n buffer = ''\r\n \r\nprint(ans)\r\n", "n = input()\r\ns = [ ]\r\ni = 0\r\nwhile i < len(n):\r\n if n[i] == '.':\r\n s += [0]\r\n i += 1\r\n elif n[i] == '-' and n[i + 1] == '.':\r\n i += 2\r\n s += [1]\r\n elif n[i] == '-' and n[i + 1] == '-':\r\n i += 2\r\n s += [2]\r\nprint(*s ,sep = '')", "string = input()\r\ntext = ''\r\ni = 0\r\nwhile i < len(string):\r\n if string[i] == '.':\r\n text += '0'\r\n i += 1\r\n elif string[i] == '-' and string[i+1] == '.':\r\n text += '1'\r\n i += 2\r\n else:\r\n text += '2'\r\n i += 2\r\nprint(text)", "list = input()\r\nlist = list.replace('--', '2')\r\nlist = list.replace('-.','1')\r\nlist = list.replace('.','0')\r\nprint(\"\".join(list))", "x = input()\r\nans = \"\"\r\nmove = False\r\nfor i in range(len(x)) :\r\n if move :\r\n move = False\r\n continue\r\n \r\n \r\n if x[i] == \".\" :\r\n ans += \"0\"\r\n else :\r\n move = True\r\n if x[i] == \"-\" and x[i+1] == \".\" :\r\n ans += \"1\"\r\n elif x[i] == \"-\" and x[i+1] == \"-\" :\r\n ans += \"2\"\r\n\r\nprint(ans)\r\n", "stri = input()\r\n\r\nl = len(stri)\r\ni = 0\r\nfinal_stri = \"\"\r\n\r\nwhile i < l:\r\n if stri[i] == \".\":\r\n final_stri += \"0\"\r\n i += 1\r\n elif stri[i] == \"-\":\r\n if stri[(i+1)] == \".\":\r\n final_stri += \"1\"\r\n i += 2\r\n elif stri[(i+1)] == \"-\":\r\n final_stri += \"2\"\r\n i += 2\r\n\r\nprint(final_stri)", "s=input()\r\nt=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i] ==\".\":\r\n t=t+\"0\"\r\n i+=1\r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n t=t+\"1\"\r\n i+=2\r\n elif s[i]==\"-\" and s[i+1]==\"-\":\r\n t=t+\"2\"\r\n i+=2\r\nprint(t)", "n = input()\r\nm = \"\"\r\nk = \"\"\r\nfor i in n:\r\n if i == \".\"and len(m) == 0:\r\n k += \"0\"\r\n else:\r\n m += i\r\n if len(m) == 2:\r\n if m == \"-.\":\r\n k += \"1\"\r\n m = \"\"\r\n else:\r\n k += \"2\"\r\n m = \"\"\r\nprint(k)", "\r\nt = input()\r\nstr1 = \"\"\r\ni=0\r\nwhile True:\r\n try:\r\n if t[i]=='.':\r\n str1 +='0'\r\n else:\r\n if(t[i+1]=='.'):\r\n str1+='1'\r\n i = i+1\r\n else:\r\n str1+='2'\r\n i = i+1\r\n i+=1\r\n except:\r\n break\r\nprint(str1)", "borze = input()\r\ncode = \"\"\r\ni = 0\r\nwhile i < len(borze):\r\n\tif borze[i] == \".\":\r\n\t\tcode += \"0\"\r\n\tif borze[i] == \"-\":\r\n\t\tif borze[i+1] == \".\":\r\n\t\t\tcode += \"1\"\r\n\t\telse:\r\n\t\t\tcode += \"2\"\r\n\t\ti += 2\r\n\t\tcontinue\r\n\ti += 1\r\nprint(code)", "x=input()\r\ns=\"\"\r\ni=0\r\nwhile i<len(x):\r\n if x[i]=='.':\r\n s+='0'\r\n elif x[i]=='-':\r\n if x[i+1]=='.':\r\n s+='1'\r\n else:\r\n s+='2'\r\n i+=1\r\n i+=1\r\n\r\nprint(s)\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\nimport bisect\r\nleft = lambda l,a : bisect.bisect_left(l,a)\r\nright = lambda l,a: bisect.bisect_right(l,a)\r\n\r\ns = input()\r\ni = 0\r\nans = \"\"\r\nwhile i < len(s):\r\n if s[i] == '.' : ans += '0'; i += 1\r\n elif s[i] == '-' :\r\n if s[i+1] == '-':\r\n ans += '2'\r\n else: ans += '1'\r\n i += 2\r\nprint(ans)", "s = input()\nsol = \"\"\ni = 0\nwhile i < len(s):\n if s[i] == \".\":\n sol += '0'\n else:\n i += 1\n if s[i] == \".\":\n sol += '1'\n else:\n sol += '2'\n i += 1\nprint(sol)\n\t \t \t \t\t\t\t\t\t \t\t\t\t \t \t\t", "it = iter(input())\r\nfor ch in it:\r\n if ch == '.':\r\n x = '0'\r\n elif next(it) == '.':\r\n x = '1'\r\n else:\r\n x = '2'\r\n\r\n print(x, end='')\r\n", "n=input()\nans=''\ni=0\n# for i in range(len(n)):\nwhile i<len(n):\n # print(i)\n if n[i] == '.':\n ans+='0'\n i+=1\n else:\n # if i+1<n:\n if n[i] =='-':\n if n[i+1] == '.':\n ans+='1'\n else:\n ans+='2'\n i+=2\nprint(ans)", "val = input()\n\nprevious = \"\"\nanswer = []\nfor current in val:\n # 0\n if current == \".\" and previous != \"-\":\n answer.append(0)\n previous = \"\"\n if current == \".\" and previous == \"-\":\n answer.append(1)\n previous = \"\"\n if current == \"-\" and previous == \"-\":\n answer.append(2)\n previous = \"\"\n else:\n previous = current\n\nfor item in answer:\n print(item, end=\"\")\n\nprint()\n \t \t\t \t\t\t \t\t \t\t \t \t\t\t\t \t", "s = input()\r\n\r\ndef just_print(s):\r\n print(s, sep = \"\", end = \"\")\r\n\r\ndashed = False\r\nfor c in s:\r\n if dashed:\r\n dashed = False\r\n if c == '.':\r\n just_print(1)\r\n elif c == '-':\r\n just_print(2)\r\n elif c == '-':\r\n dashed = True\r\n else:\r\n just_print(0)", "n=str(input())\nn=n.replace('--', '2')\nn=n.replace('-.', '1')\nn=n.replace('.','0')\nprint(n)", "x=input();p=''\r\nfor i in range(len(x)):\r\n\tif len(x)==0:\r\n\t\tbreak\r\n\tif x[0]=='.':\r\n\t\tx=x.replace('.','',1)\r\n\t\tp=p+'0'\r\n\telif x[0]+x[1]=='-.':\r\n\t\tx=x.replace('-.','',1)\r\n\t\tp=p+'1'\r\n\telif x[0]+x[1]=='--':\r\n\t\tx=x.replace('--','',1)\r\n\t\tp=p+'2'\r\nprint(p)\r\n#author:SK__Shanto__㋛\r\n#code__define__your__smartness", "code = input()\nans = \"\"\ni = 0\nwhile i < len(code):\n if(code[i] == \".\"):\n ans += \"0\"\n i += 1\n elif(code[i] == \"-\" and code[i + 1] == \".\"):\n ans += \"1\"\n i += 2\n elif(code[i] == \"-\" and code[i + 1] == \"-\"):\n ans += \"2\"\n i += 2\nprint(ans)\n", "string=input()\r\na=list(string)\r\n# print(a)\r\ndef findnum(a):\r\n i=0\r\n while(i!=len(a)):\r\n if a[i]=='.':\r\n print(\"0\",end=\"\")\r\n i=i+1\r\n elif a[i]==\"-\" and a[i+1]==\".\":\r\n print(\"1\",end=\"\")\r\n i=i+2\r\n elif a[i]==\"-\" and a[i+1]==\"-\":\r\n print(\"2\",end=\"\")\r\n i=i+2\r\n\r\n\r\nfindnum(a)", "x=list(input())+['a'];p=''\r\nfor i in range(len(x)-1):\r\n if x[i]=='-' and x[i+1]=='-':\r\n p+='2';x[i+1]='a'\r\n elif x[i]=='-' and x[i+1]=='.':\r\n p+='1';x[i+1]='a'\r\n elif x[i]=='.': p+='0'\r\nprint(p)", "code=input()\r\ni=0\r\nop=\"\"\r\nwhile i<len(code):\r\n if code[i]==\".\":\r\n op+=\"0\"\r\n elif code[i]==\"-\" and code[i+1]==\".\":\r\n op+=\"1\"\r\n i+=1\r\n else:\r\n op+=\"2\"\r\n i+=1\r\n \r\n i+=1\r\n\r\nprint(op)", "s=input()\r\nx=s.replace(\"--\",\"2\")\r\nx=x.replace(\"-.\",\"1\")\r\nx=x.replace(\".\",\"0\")\r\nprint(x)\r\n\r\n", "#python script for borze codeforce question ternary numberic notation is quite popular \n\n\nn = input()\ni = 0\nwhile i < len(n):\n if(n[i] == '.'):\n print(0, end='')\n i += 1\n elif(n[i] == '-'):\n if(n[i+1] == '.'):\n print(1, end='')\n \n elif(n[i+1] == '-'):\n print(2, end='')\n \n i += 2\n\n\n", "a=input().strip()\r\ni=0\r\nwhile i<len(a):\r\n\tif a[i]=='.':\r\n\t\tprint(0,end=\"\")\r\n\t\ti+=1\r\n\telif a[i]=='-':\r\n\t\tif a[i+1]=='.':\r\n\t\t\tprint(1,end=\"\")\r\n\t\telse:\r\n\t\t\tprint(2,end=\"\")\r\n\t\ti+=2\r\n", "ch=''\r\nfor i in input():\r\n ch+=i\r\n if(ch=='.'): \r\n print('0',end='')\r\n ch=''\r\n elif(ch=='-.'):\r\n print('1',end='')\r\n ch=''\r\n elif(ch=='--'):\r\n print('2',end='')\r\n ch=''", "def BorzeCode(s):\r\n res=''\r\n i=0\r\n while i<len(s):\r\n if s[i]=='.':\r\n res+='0'\r\n i+=1\r\n elif s[i+1]=='.':\r\n i+=2\r\n res+='1'\r\n else:\r\n i+=2\r\n res+='2'\r\n return res\r\n \r\n\r\ns=input()\r\nresult=BorzeCode(s)\r\nprint(result)\r\n", "def value(a):\r\n if(a=='.'):return 0;\r\n if(a=='-.'):return 1;\r\n if(a=='--'):return 2;\r\n return -1;\r\ns=input();\r\nlisty=[]\r\ni=0\r\nwhile(i<len(s)):\r\n if(value(s[i:i+2])==-1):\r\n listy.append(value(s[i]))\r\n print(value(s[i]),end=\"\")\r\n i+=1\r\n else:\r\n listy.append(value(s[i:i+2]))\r\n print(value(s[i:i+2]),end=\"\")\r\n i=i+2\r\n", "borze = input()\n\nnumber = ''\nj = 0\nwhile j < len(borze):\n if borze[j] == '.':\n number += '0'\n j += 1\n elif (borze[j] == '-') and (borze[j+1] == '.'):\n number += \"1\"\n j += 2\n else:\n number += '2'\n j += 2\nprint(number)", "x=input()\r\nc=0\r\nliste=[]\r\nresult=\"\"\r\nwhile (c<len(x)):\r\n if (x[c]==\".\"):\r\n result+=\"0\"\r\n c+=1\r\n elif (x[c]==\"-\"):\r\n if (x[c+1]==\".\"):\r\n result+=\"1\"\r\n c+=2\r\n elif (x[c+1]==\"-\"):\r\n result+=\"2\"\r\n c+=2\r\nprint(result)", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\ndef ans(s):\r\n\t#dic = {'.' : 0,'-.' : 1,'--' : 2}\r\n\tprint(s.replace('--','2').replace('-.','1').replace('.','0'))\r\n\r\n#for _ in range(int(input())):\r\ns = str(input())\r\nans(s)\r\n", "string = str(input())\ni = 0\nwhile i<len(string):\n if string[i]=='.':\n print(0, end='')\n i+=1 \n elif string[i+1]=='.':\n print(1,end='')\n i+=2\n else:\n print(2, end='')\n i+=2\n ", "def main():\r\n msg = input()\r\n # Loop through each character and compute\r\n i = 0\r\n decoded = \"\"\r\n while i < len(msg):\r\n if msg[i] == \".\":\r\n decoded += \"0\"\r\n else:\r\n if msg[i] == \"-\" and msg[i+1] == \".\":\r\n decoded += \"1\"\r\n i += 1\r\n elif msg[i] == \"-\" and msg[i+1] == \"-\":\r\n decoded += \"2\"\r\n i += 1\r\n i += 1\r\n print(decoded)\r\n\r\nmain()", "x = input()\n\nad = {'.':0, '-.':1, '--':2}\n\nnum = []\n\nfor i in range(len(x)):\n break\ni = 0\nwhile True:\n if i == len(x):\n break\n if i+1 == len(x):\n num.append(0)\n break\n sumer = x[i]+x[i+1]\n if sumer == '--':\n num.append(2)\n i += 2\n\n elif sumer == '-.':\n num.append(1)\n i += 2\n elif x[i] == '.':\n num.append(0)\n i += 1\n\nnum = [str(j) for j in num ]\ny = ''.join(num)\n\nprint(y)", "s = input()\r\nans = [5]\r\nt = len(s)\r\ni = 0\r\nwhile t >= 0:\r\n if s[i:i + 2] == \"--\":\r\n ans.append(2)\r\n t = t - 2\r\n i = i + 2\r\n continue\r\n elif s[i:i + 2] == \"-.\":\r\n ans.append(1)\r\n t = t - 2\r\n i = i + 2\r\n continue\r\n else:\r\n ans.append(0)\r\n t = t - 1\r\n i = i + 1\r\n continue\r\n\r\nans = ans[:len(ans)-1]\r\nans = list(map(str, ans))\r\nans = \"\".join(ans)\r\nprint(ans[1:])", "sentence = input()\r\nresult = []\r\nk = 0\r\nwhile k < len(sentence):\r\n if sentence[k] == \".\":\r\n result.append(0)\r\n k += 1\r\n else:\r\n if sentence[k+1] == \".\":\r\n result.append(1)\r\n else:\r\n result.append(2)\r\n k += 2\r\nanswer = \"\".join(map(str,result))\r\nprint(answer)", "s=input()\r\nres=''\r\nwhile s:\r\n if s[:2]=='--':\r\n s=s[2:]\r\n res+='2'\r\n elif s[:2]=='-.':\r\n s=s[2:]\r\n res+='1'\r\n else:\r\n s=s[1:]\r\n res+='0'\r\nprint(res)", "result=\"\"\r\ni=0\r\nstring=input()\r\nwhile(i<len(string)):\r\n\tif string[i]==\".\":\r\n\t\tresult+=\"0\"\r\n\t\ti+=1\r\n\telif string[i]==\"-\" and string[i+1]==\".\":\r\n\t\tresult+=\"1\"\r\n\t\ti+=2\r\n\telif string[i]==\"-\" and string[i+1]==\"-\":\r\n\t\tresult+=\"2\"\r\n\t\ti+=2\r\nprint(result)", "def func(lis):\r\n if len(lis)==0:\r\n return ''\r\n elif lis[0]=='-':\r\n if lis[1]=='-':\r\n return '2'+func(lis[2:])\r\n else:\r\n return '1'+func(lis[2:])\r\n elif lis[0]=='.':\r\n return '0'+func(lis[1:])\r\nl=input()\r\nprint(func(l))", "d=input()\r\nd=d.replace('--','2').replace('-.','1').replace('.','0')\r\nprint(d)\r\n", "s = input ()\r\nn = len(s) - 1\r\nres = []\r\ni = 0\r\nwhile i < n:\r\n if s[i]=='-' and s[i+1]=='.':\r\n res.append('1')\r\n i += 2\r\n elif s[i]==s[i+1]=='-':\r\n res.append('2')\r\n i += 2\r\n elif s[i]:\r\n res.append('0')\r\n i += 1\r\nif s[n]=='.' and s[n-1]=='.':\r\n res.append('0')\r\nelif s[n]=='.' and s[n-1]==s[n-2]=='-':\r\n res.append('0')\r\nfinal = \"\".join(res)\r\nprint(final)", "a=input()\r\nn=[]\r\ni=0\r\nwhile i<len(a):\r\n if a[i]=='.':\r\n n.append(0)\r\n elif a[i]=='-' and a[i+1]=='.':\r\n i+=1\r\n n.append(1)\r\n else:\r\n i+=1\r\n n.append(2)\r\n i+=1\r\nprint(*n,sep='')\r\n#", "class Code:\r\n def __init__(self):\r\n self.s = input()\r\n self.res = ''\r\n\r\n def process(self):\r\n i = 0\r\n while i < len(self.s):\r\n if self.s[i] == '.':\r\n self.res += '0'\r\n i += 1\r\n elif i + 1 < len(self.s):\r\n self.res += '1' if self.s[i + 1] == '.' else '2'\r\n i += 2\r\n print(self.res)\r\n\r\n\r\nif __name__ == '__main__':\r\n code = Code()\r\n code.process()\r\n", "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\ndef solve(s):\r\n if '--' in s:\r\n s = s.replace(\"--\",'2')\r\n if '-.' in s:\r\n s = s.replace('-.','1')\r\n if '.' in s:\r\n s = s.replace('.','0')\r\n print(s)\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\ns = str(input())\r\nsolve(s)\r\n", "s = input()\r\nres = ''\r\ni = 0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n res+='0'\r\n else:\r\n if i<len(s)-1:\r\n if s[i+1]==\"-\":\r\n res+='2'\r\n elif s[i+1]=='.':\r\n res+='1'\r\n i+=1\r\n i+=1\r\nprint(res)", "s=input(\"\")\r\ncode=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i]==\"-\":\r\n if i+1<len(s) and s[i+1]==\"-\":\r\n code=code+\"2\"\r\n i=i+2\r\n elif i+1<len(s) and s[i+1]==\".\":\r\n code=code+\"1\"\r\n i=i+2\r\n elif s[i]==\".\":\r\n code=code+\"0\"\r\n i=i+1\r\n\r\nprint(code)", "moo = list(input())\r\npor = \"\"\r\nfor i in range(len(moo)):\r\n if not(moo == []):\r\n if moo[0] == \".\":\r\n por += \"0\"\r\n moo.remove(moo[0])\r\n elif moo[0] == \"-\":\r\n if moo[1]==\".\":\r\n por += \"1\"\r\n moo.remove(moo[0])\r\n moo.remove(moo[0])\r\n else:\r\n por += \"2\"\r\n moo.remove(moo[0])\r\n moo.remove(moo[0])\r\n else:\r\n break\r\nprint(por)", "i=input()\r\nj=0\r\ns= ''\r\nwhile j<len(i):\r\n if i[j]=='.':\r\n s+='0'\r\n j+=1\r\n else:\r\n s+={'-.':'1','--':'2'}[i[j]+i[j+1]]\r\n j+=2\r\nprint(s)\r\n", "b = input()\r\nn = ''\r\n\r\ni = 0\r\nwhile i < len(b):\r\n\tif b[i] == '.':\r\n\t\tn += '0'\r\n\t\ti += 1\r\n\telse:\r\n\t\tif b[i + 1] == '.':\r\n\t\t\tn += '1'\r\n\t\telse:\r\n\t\t\tn += '2'\r\n\t\ti += 2\r\n\t\r\nprint(n)\r\n", "c = input()\r\nn = len(c)\r\ns = ''\r\ni = 0\r\nwhile i < n:\r\n if c[i] == '.':\r\n s += '0'\r\n else:\r\n if i + 1 < n and c[i+1] == '.':\r\n s += '1'\r\n else:\r\n s += '2'\r\n i += 1\r\n i += 1\r\n\r\nprint(s)", "s = input()\r\nans = ''\r\ni = 0\r\ntry:\r\n while (i<len(s)):\r\n if s[i] =='.':\r\n ans+='0'\r\n i+=1\r\n else:\r\n if s[i+1] == '.':\r\n ans+='1'\r\n elif s[i+1] == '-':\r\n ans+='2'\r\n i+=2\r\nexcept:\r\n pass\r\n\r\nprint(ans)\r\n", "s = input()\r\ndigit = ''\r\nfor i in s:\r\n if i == '.':\r\n if digit == '':\r\n print(0, end = '')\r\n else:\r\n print(1, end = '')\r\n digit = ''\r\n else:\r\n if digit == '':\r\n digit += '-'\r\n else:\r\n print(2, end = '')\r\n digit = ''", "tc = input()\nans = \"\"\nwhile len(tc) != 0:\n if tc[0] == \".\":\n ans+=\"0\"\n tc = tc[1:]\n elif tc[0:2] == \"-.\":\n ans+=\"1\"\n tc = tc[2:]\n elif tc[0:2] == \"--\":\n ans+=\"2\"\n tc = tc[2:]\nprint(ans)\n\n", "# https://codeforces.com/problemset/problem/32/B\r\n\r\nl = input()\r\nc = \"\"\r\nres = []\r\nfor item in l:\r\n if not c:\r\n if item == '.':\r\n res.append(0)\r\n else:\r\n c = item\r\n else:\r\n if item == '.':\r\n res.append(1)\r\n else:\r\n res.append(2)\r\n c = \"\"\r\nprint(''.join(map(str, res)))", "s = input()\r\ncur = 0\r\nwhile cur < len(s):\r\n\tif s[cur] == \".\":\r\n\t\tprint(0, end=\"\")\r\n\t\tcur += 1\r\n\telif s[cur] == \"-\":\r\n\t\tif cur != len(s)-1:\r\n\t\t\tif s[cur+1] == \".\":\r\n\t\t\t\tprint(1, end=\"\")\r\n\t\t\t\tcur += 2\r\n\t\t\telif s[cur+1] == \"-\":\r\n\t\t\t\tprint(2, end=\"\")\r\n\t\t\t\tcur += 2", "s = str(input(\"\"))\r\nst = \"\"\r\ni = 0\r\nwhile i < len(s):\r\n if s[i] == \".\":\r\n st += \"0\"\r\n i += 1\r\n if i+1 < len(s):\r\n if s[i:i+2] == \"-.\":\r\n st += \"1\"\r\n i += 2\r\n elif s[i:i+2] == \"--\":\r\n st += \"2\"\r\n i += 2\r\nprint(st)", "s=input();r=str.replace;print(r(r(r(s,\"--\",\"2\"),\"-.\",\"1\"),\".\",\"0\"))", "str=input()\r\nr=[]\r\ni=0\r\nwhile i<len(str):\r\n if '.' in str[i]:\r\n r.append('0')\r\n i += 1\r\n elif '-.' in str[i:i + 2]:\r\n r.append('1')\r\n i += 2\r\n elif '--' in str[i:i + 2]:\r\n r.append('2')\r\n i += 2\r\n\r\nfor j in range(len(r)):\r\n print(r[j],end=\"\")\r\n", "code = input()\r\nn = len(code)\r\nresult=\"\"\r\ni=0\r\nwhile i<n:\r\n if code[i:i+2]=='-.':\r\n result+='1'\r\n i +=2\r\n elif code[i:i+2]=='--':\r\n result+='2'\r\n i+=2\r\n else:\r\n result+='0'\r\n i+=1\r\nprint(result)", "# 코드포스 32B Borze\r\nimport sys\r\nput = sys.stdin.readline\r\n\r\nnum = put().strip()\r\ndecode = {\".\": '0', \"-.\": '1', \"--\": '2'}\r\nanswer = \"\"\r\nn = \"\"\r\n\r\nfor i in num:\r\n n += i\r\n if n in decode:\r\n answer += decode[n]\r\n n = \"\"\r\n\r\nprint(answer)", "ch=input()\r\nl=list(ch)\r\na=\"\"\r\ni=0\r\nwhile i<len(ch):\r\n if l[i]==\".\":\r\n a+=\"0\"\r\n i+=1\r\n else:\r\n if l[i+1]==\"-\":\r\n a+=\"2\"\r\n i+=2\r\n elif l[i+1]==\".\":\r\n a+=\"1\"\r\n i+=2\r\nprint(a)", "stroka = input()\r\nstroka1=''\r\ni=0\r\n\r\nwhile i<len(stroka):\r\n if stroka[i]=='.':\r\n stroka1+='0'\r\n elif (stroka[i]=='-') and (stroka[i+1]=='.'):\r\n stroka1+='1'\r\n i+=1\r\n elif (stroka[i]=='-') and (stroka[i+1]=='-'):\r\n stroka1+='2'\r\n i+=1\r\n i+=1\r\nprint(stroka1)", "n = input()\r\ni = 0\r\nwhile i<len(n):\r\n if n[i] == '.':\r\n print('0',end='')\r\n i+=1\r\n elif n[i] == '-' and n[i+1] == '.':\r\n print('1',end='')\r\n i=i+2\r\n\r\n else:\r\n print('2',end='')\r\n i+=2\r\n", "s=input()\r\n\r\nc=''\r\n\r\nx=False\r\n\r\nfor i in range(len(s)):\r\n \r\n if x:\r\n x=False\r\n continue\r\n \r\n if s[i]=='.':\r\n c=c+'0'\r\n else :\r\n \r\n if s[i+1]=='.':\r\n c=c+'1'\r\n x=True\r\n else:\r\n c+='2'\r\n x=True\r\nprint(c)\r\n", "s=input()\r\ni=0\r\nb=[]\r\nwhile(i<len(s)) :\r\n if(s[i]=='.') :\r\n b.append(0)\r\n i+=1\r\n elif(s[i]=='-'):\r\n if(s[i+1]=='.'):\r\n b.append(1)\r\n elif(s[i+1]=='-'):\r\n b.append(2)\r\n i+=2\r\nprint(*b,sep='')\r\n", "s=input()\r\ni=0\r\nwhile(i<len(s)):\r\n if(s[i]=='.'):\r\n print(0,end='')\r\n elif(s[i]=='-' and s[i+1]=='.'):\r\n print(1,end='')\r\n i+=1\r\n else:\r\n print(2,end='')\r\n i+=1\r\n i+=1", "ans=''\r\ns=input()\r\nwhile len(s)>0:\r\n if s[0]=='.':\r\n ans+='0'\r\n s=s[1:]\r\n elif s[1]=='.':\r\n ans+='1'\r\n s=s[2:]\r\n else:\r\n ans+='2'\r\n s=s[2:]\r\nprint(ans)", "borze = input()\n\nans = \"\"\n\ni = 0\nwhile i < len(borze):\n\tif borze[i] == \".\":\n\t\tans += \"0\"\n\telif borze[i] == \"-\":\n\t\tif borze[i+1] == \".\":\n\t\t\tans += \"1\"\n\t\telse:\n\t\t\tans += \"2\"\n\t\ti += 1\n\ti += 1\n\nprint(ans)", "s=input()\r\nn=len(s)\r\nzero=\".\"\r\none=\"-.\"\r\ntwo=\"--\"\r\nk=\"\"\r\ni=0\r\nwhile(i+1<n):\r\n if(s[i]+s[i+1]==\"--\"):\r\n k+=\"2\"\r\n i+=2\r\n elif(s[i]+s[i+1]==\"-.\"):\r\n k+=\"1\"\r\n i+=2\r\n elif(s[i]==\".\"):\r\n k+=\"0\"\r\n i+=1\r\nif(i<n):\r\n if(s[i]==\".\"):\r\n k+=\"0\"\r\nprint(k) ", "def solve(s): \r\n i = 0\r\n while i < len(s):\r\n if i+1 == len(s)-1 and s[i] == '.' and s[i+1] == '.':\r\n print(0, end='')\r\n print(0, end='')\r\n i += 1\r\n elif s[i] == '.':\r\n print(0,end=\"\")\r\n elif s[i] == '-' and s[i+1] == '.':\r\n print(1,end=\"\")\r\n i += 1\r\n elif s[i] == '-' and s[i+1] == \"-\":\r\n print(2,end=\"\")\r\n i += 1\r\n i += 1\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n solve(s)", "code=input()\r\ndecode=\"\"\r\ni=0\r\nwhile i<=(len(code)-1):\r\n#for i in range(len(code)-1):\r\n if code[i]==\".\":\r\n decode+=\"0\"\r\n i+=1\r\n elif code[i]==\"-\":\r\n if code[i+1]==\".\":\r\n decode+=\"1\"\r\n i+=2\r\n elif code[i+1]==\"-\":\r\n decode+=\"2\"\r\n i+=2\r\n\r\nprint(decode)\r\n", "a = input()\r\ns = ''\r\ni = 0\r\nwhile i< len(a):\r\n if a[i] in '.':\r\n s = s+'0'\r\n i = i+1\r\n elif a[i] in '-' and a[i+1] in '.':\r\n s = s+'1'\r\n i = i+2\r\n elif a[i] in '-' and a[i+1] in '-':\r\n s = s+'2'\r\n i = i+2\r\nprint(s)\r\n", "s = input()\ni = 0\nres = \"\"\nwhile i < len(s):\n\tif s[i] == '-' and s[i+1] == '-':\n\t\tres += \"2\"\n\t\ti += 2 \n\telif s[i] == '-' and s[i+1] == '.':\n\t\tres += \"1\"\n\t\ti += 2 \n\telif s[i] == '.':\n\t\tres += \"0\"\n\t\ti += 1 \nprint(res)", "l=[\".\",\"-.\",\"--\"]\r\ns=input()\r\ncheck=\"\"\r\nans=\"\"\r\nfor i in s:\r\n check=check+i\r\n if check in l:\r\n ans=ans+str(l.index(check))\r\n check=\"\"\r\nprint(ans)", "# https://codeforces.com/problemset/problem/32/B\r\n\r\ndef main():\r\n s = input()\r\n while s:\r\n if s[0] == '.':\r\n s = s[1:]\r\n print('0', end='')\r\n elif s[1] == '.':\r\n s = s[2:]\r\n print('1', end='')\r\n else:\r\n s = s[2:]\r\n print('2', end='')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#!/usr/local/bin/python\r\n\r\ns = input()\r\ns+='0'\r\ni = 0\r\nfinal = \"\"\r\nwhile s[i]!='0':\r\n\tif s[i] == \"-\" and s[i+1] == \"-\":\r\n\t\tfinal += \"2\"\r\n\t\ti+=2\r\n\telif s[i] == \"-\" and s[i+1] == \".\":\r\n\t\tfinal += \"1\"\r\n\t\ti+=2\r\n\telse:\r\n\t\tfinal += \"0\"\r\n\t\ti+=1\r\nprint(final)", "n = input()\r\np = \"\"\r\ni = 0\r\nwhile i < len(n):\r\n if n[i] == \".\":\r\n p += \"0\"\r\n i += 1\r\n elif n[i] == \"-\" and n[i+1] == \"-\":\r\n p += \"2\"\r\n i += 2\r\n elif n[i] == \"-\" and n[i+1] == \".\":\r\n p += \"1\"\r\n i += 2\r\nprint(p)\r\n", "a={\".\":\"0\",\"-.\":\"1\",\"--\":\"2\"}\r\nb=input()\r\nans=\"\"\r\ng=\"\"\r\nfor i in b:\r\n g=g+i\r\n if g in a:\r\n ans=ans+a[g]\r\n g=\"\"\r\nprint(ans)", "x=input()\r\ny=z=\"\"\r\nfor i in range(len(x)):\r\n y=y+x[i]\r\n if y==\".\":\r\n z=z+\"0\"\r\n y=\"\"\r\n elif y==\"-.\":\r\n z=z+\"1\"\r\n y=\"\"\r\n elif y==\"--\":\r\n z=z+\"2\"\r\n y=\"\"\r\nprint(z)", "n1 = input()\r\nout = \"\"\r\nn = list(n1)\r\n\r\nj = 0\r\nwhile len(n) != 0:\r\n if n[j] == '-':\r\n if n[j+1] == '.':\r\n out += '1'\r\n n.pop(j)\r\n n.pop(j)\r\n else:\r\n out += '2'\r\n n.pop(j)\r\n n.pop(j)\r\n if len(n) == 0:\r\n break\r\n if n[j] == \".\":\r\n out += \"0\"\r\n n.pop(j)\r\nprint(out)\r\n", "text = input()\ni = 0\nwhile i < len(text):\n if text[i] == '-':\n if text[i + 1] == '-':\n print('2', end='')\n else:\n print('1', end='')\n i += 2\n else:\n print('0', end='')\n i += 1", "import re\r\nn = input()\r\nm = re.findall(r'(-.|--|.)',n)\r\ns = ''\r\nfor i in m:\r\n if i == '.':\r\n s+=\"0\"\r\n elif i == \"-.\":\r\n s+=\"1\"\r\n else:\r\n s+=\"2\"\r\nprint(s)", "if __name__ == '__main__':\n code = input()\n\n op_str = \"\"\n\n i = 0\n while i < len(code):\n if code[i] == '.':\n op_str += \"0\"\n i += 1\n\n elif code[i] == '-':\n if code[i+1] == '.':\n op_str += \"1\"\n else:\n op_str += \"2\"\n i += 2\n print(op_str)\n\n\n\n\n\n", "s=input()\r\nl=[]\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n l.append('0')\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n l.append('1')\r\n i+=2\r\n elif s[i+1]=='-':\r\n l.append('2')\r\n i+=2\r\nfor i in range(len(l)):\r\n print(l[i],end=\"\")", "a=str(input())\na=a.replace('--','2')\na=a.replace('-.','1')\na=a.replace('.','0')\nprint(a)\n", "dc = {'.':0,'-.':1,'--':2}\r\na = input()\r\nt = 0\r\nwhile t<len(a):\r\n j = a[t]\r\n while j not in dc:\r\n t += 1\r\n j+=a[t]\r\n print(dc[j],end='')\r\n t+=1", "a=input().strip()\r\nans=''\r\ni=0\r\nt=''\r\nwhile i<len(a):\r\n t+=a[i]\r\n if t=='.':\r\n t=''\r\n ans+='0'\r\n elif t=='-.':\r\n t=''\r\n ans+='1'\r\n elif t=='--':\r\n t=''\r\n ans+='2'\r\n i+=1\r\nprint(ans)", "code = ['.', '-.', '--']\r\ndigits = ['0', '1', '2']\r\n\r\nstring = str(input())\r\n\r\noutput = ''\r\ntemp = ''\r\n\r\nfor i in string:\r\n temp += i\r\n if temp in code:\r\n output += digits[code.index(temp)]\r\n temp = ''\r\n else:\r\n continue\r\n \r\nprint(output)", "n=input()\r\ni=0\r\nwhile i<len(n):\r\n if n[i]==\"-\":\r\n if n[i+1]==\".\":\r\n print(\"1\", end = \"\")\r\n i=i+2\r\n else:\r\n print(\"2\", end = \"\")\r\n i=i+2\r\n else:\r\n print(\"0\",end=\"\")\r\n i+=1", "'''\nAuthor : knight_byte\nFile : B_Borze.py\nCreated on : 2021-04-19 13:21:08\n'''\n\n\ndef main():\n s = list(input())\n f, r = 0, 1\n c = {\".\": \"0\", \"-.\": \"1\", \"--\": \"2\"}\n ans = \"\"\n while r <= len(s):\n temp = \"\".join(s[f:r])\n if temp in c:\n ans += c[temp]\n f = r\n\n r += 1\n\n print(ans)\n\n\nif __name__ == '__main__':\n main()\n", "# 32B - Borze\r\nif __name__ == '__main__':\r\n word = input()\r\n size = len(word)\r\n # word = word.replace(\"--\",'2')\r\n # word = word.replace(\"-.\",'1')\r\n # word = word.replace(\".\",'0')\r\n x = 0;\r\n new_word = ''\r\n while x < size :\r\n if word[x] is '.':\r\n new_word += '0'\r\n x +=1\r\n elif x < size -1 and word[x] + word[x+1] == \"-.\" :\r\n new_word += '1'\r\n x+=2\r\n elif x < size -1 and word[x] + word[x+1] == \"--\" :\r\n new_word += '2'\r\n x+=2\r\n print(new_word)", "s=input()\r\ns=[*s]\r\ni=0\r\n\r\nwhile i<len(s):\r\n if s[i]==\".\":\r\n print(0,end=\"\")\r\n i+=1\r\n elif s[i]==\"-\" and s[i+1]==\".\":\r\n print(1,end=\"\")\r\n i+=2\r\n elif s[i]==\"-\" and s[i+1]==\"-\":\r\n print(2,end=\"\")\r\n i+=2\r\n ", "code=input()\r\n\r\ndef into_ternary():\r\n i = 0\r\n tern = \"\"\r\n while i<len(code):\r\n if code[i]==\".\":\r\n tern = tern + \"0\"\r\n else:\r\n if code[i+1]==\".\":\r\n tern = tern + \"1\"\r\n else:\r\n tern = tern + \"2\"\r\n i=i+1\r\n i=i+1\r\n return tern\r\n\r\nprint(into_ternary())\r\n", "s=input()\r\nres=''\r\ni=0\r\nwhile i<len(s):\r\n if s[i]=='.':\r\n res+='0'\r\n i+=1 \r\n else:\r\n if s[i+1]=='.':\r\n res+='1'\r\n else:\r\n res+='2'\r\n i+=2\r\nprint(res)", "ch = input()\r\n\r\nR = \"\"\r\nwhile len(ch) > 0: \r\n i = 0\r\n if ch[i] == \"-\" and ch[i+1] == \"-\": \r\n R += \"2\"\r\n ch = ch[:i] + ch[i+2:]\r\n elif ch[i] == \"-\" and ch[i+1] == \".\":\r\n R += \"1\"\r\n ch = ch[:i] + ch[i+2:]\r\n else: \r\n R += \"0\"\r\n ch = ch[:i] + ch[i+1:]\r\nprint(R)\r\n", "s = input()\r\nr = []\r\n\r\ni = 0\r\nwhile i <= len(s) - 1:\r\n if s[i] == '-' and s[i + 1] == '.':\r\n r.append('1')\r\n i += 1\r\n elif s[i] == '.':\r\n r.append('0')\r\n elif s[i] == '-' and s[i + 1] == '-':\r\n r.append('2')\r\n i += 1\r\n i += 1\r\n\r\nprint(\"\".join(r))", "validCodes = dict()\r\n\r\nvalidCodes[\".\"] = 0\r\nvalidCodes[\"-.\"] = 1\r\nvalidCodes[\"--\"] = 2\r\n\r\ninp = input()\r\n\r\ni,n,ans = 0,len(inp),\"\"\r\n\r\nwhile i+2 <= n or i+1 <= n:\r\n\t\r\n\tif i+2 <= n and inp[i:i+2] in validCodes:\r\n\t\t\r\n\t\tans += str(validCodes[inp[i:i+2]])\r\n\t\t\r\n\t\ti += 2\r\n\t\t\r\n\telif i+1 <= n and inp[i:i+1] in validCodes:\r\n\t\t\r\n\t\tans += str(validCodes[inp[i:i+1]])\r\n\t\t\r\n\t\ti += 1\r\n\t\t\r\nprint(ans)", "s=input()\r\nc=''\r\ni=0\r\nwhile i<len(s):\r\n if(s[i:i+2]=='-.'):\r\n c=c+'1'\r\n i+=2\r\n continue\r\n if(s[i:i+2]=='--'):\r\n c=c+'2'\r\n i+=2\r\n continue\r\n else:\r\n c=c+'0'\r\n i+=1\r\nprint(c)", "s=input()\r\nl=[]\r\ni=0\r\nwhile i<=len(s)-1:\r\n if s[i]=='.':\r\n l.append('0')\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='-':\r\n l.append('2')\r\n i+=2\r\n else:\r\n l.append('1')\r\n i+=2\r\nprint(''.join(l))", "# This code is written by Nikhil Tiwari\r\nfrom sys import *\r\nimport sys\r\nfrom math import *\r\nfrom collections import *\r\nimport string\r\nimport re\r\nfrom bisect import *\r\nfrom functools import reduce\r\nfrom itertools import permutations, combinations\r\n# import numpy as np\r\n# def arr(): return np.random.randint(1,50,5)\r\n \r\nt=stdin.readline\r\nR=range\r\np=stdout.write\r\nmod = int(1e9)+7\r\nMAX = 9223372036854775808\r\nINF = float('inf')\r\nlower = string.ascii_lowercase\r\nupper = string.ascii_uppercase\r\nnumbers = string.digits\r\n\r\nS = lambda : t().strip()\r\nI = lambda : int(t())\r\nGI = lambda: map(int, input().strip().split())\r\nGS = lambda : map(str, t().strip().split())\r\nIL= lambda: list(map(int, t().strip().split()))\r\nSL = lambda : list(map(str, t().strip().split()))\r\nmat = lambda n : [IL() for i in range(n)]\r\nd2b = lambda n : bin(n)[2:]\r\nispow2 = lambda x : ((x!=0) and (x&(x-1))==0)\r\npowof2 = lambda x : 1<<x\r\niSq = lambda x : (ceil(float(sqrt(x))) == floor(float(sqrt(x))))\r\ndef sieve(n): return reduce(lambda r, x: r - set(range(x**2, n, x)) if x in r else r, \r\n range(2, int(n**0.5) + 1), set(range(2,n)))\r\ndef ls(x,y): return x<<y # adding '0' y bits from right and removing last y bits from left i.e floor(x/pow(2,y)) \r\ndef rs(x,y): return x<<y # adding '0' y bits from left and removing first y bits from right i.e x*pow(2,y) \r\ndef BS_left(n,a,x): i=bisect_left(a,x);return [-1,i][i != n and a[i] == x] \r\ndef BS_right(n,a,x): i=bisect_right(a,x);return [-1,i][i != n and a[i] == x] \r\n\r\ns=S()\r\nn=len(s)\r\ni=0\r\nwhile(i<n):\r\n if s[i]=='.': \r\n print(0,end='')\r\n i+=1\r\n continue\r\n if s[i]=='-':\r\n if s[i+1]=='.': print(1,end='')\r\n if s[i+1]=='-': print(2,end='')\r\n i+=2\r\n", "n=input()\r\n\r\ni=0\r\nj=''\r\nwhile i != len(n):\r\n if n[i]=='.':\r\n j+='0'\r\n i+=1\r\n elif n[i]=='-' and n[i+1]=='.':\r\n j+='1'\r\n i+=2\r\n else:\r\n i+=2\r\n j+='2'\r\n\r\nprint(j)\r\n", "word = input()\r\nindex = 0\r\nwhile(index < len(word)) :\r\n if word[index:index + 1] == \".\" : \r\n print(0,end=\"\")\r\n index += 1\r\n elif word[index:index + 2] == \"-.\" : \r\n print(1,end=\"\")\r\n index += 2\r\n else :\r\n print(2,end=\"\")\r\n index += 2", "a=input()\r\nb=list(a)\r\nc=[]\r\ni=0\r\nwhile i<len(b):\r\n if(b[i]==\".\"):\r\n c.append(\"0\")\r\n i+=1\r\n elif(b[i]==\"-\" and b[i+1]==\".\"):\r\n c.append(\"1\")\r\n i+=2\r\n elif(b[i]==\"-\" and b[i+1]==\"-\"):\r\n c.append(\"2\")\r\n i+=2\r\nd=\"\".join(c)\r\nprint(d)", "t=input()\r\nt=t.replace('--','2').replace('-.','1').replace('.','0')\r\nprint(t)", "__author__ = 'shukkkur'\r\n\r\n\r\n'''\r\nB. Borze\r\nhttps://codeforces.com/problemset/problem/32/B\r\n'''\r\n\r\nborze_code = input()\r\n\r\nzero = '.'\r\none = '-.'\r\ntwo = '--'\r\n\r\nborze_code = borze_code.replace(two, '2')\r\nborze_code = borze_code.replace(one, '1')\r\nborze_code = borze_code.replace(zero, '0')\r\n\r\nprint(borze_code)\r\n", "s=list(input())\r\ni=0\r\nf=''\r\nwhile(i<len(s)):\r\n if s[i]=='-':\r\n if s[i+1]=='.':\r\n f+='1'\r\n i+=2\r\n else:\r\n f+='2'\r\n i+=2\r\n continue\r\n if s[i]=='.':\r\n f+='0'\r\n i+=1\r\nprint(f)\r\n ", "string = input()\r\narr = []\r\ni = 0\r\nwhile True:\r\n\tif i >= len(string):\r\n\t\tbreak\r\n\tif string[i] == \"-\" and string[i+1] == \".\":\r\n\t\tarr.append(1)\r\n\t\ti += 2\r\n\t\tcontinue\r\n\tif string[i] == \"-\" and string[i+1] == \"-\":\r\n\t\tarr.append(2)\r\n\t\ti += 2\r\n\t\tcontinue\r\n\r\n\tif string[i] == \".\":\r\n\t\tarr.append(0)\r\n\t\ti += 1\r\n\t\tcontinue\r\n\r\n\t\r\n\r\n\t\r\n\r\n\r\n\r\nprint(\"\".join(map(str,arr)))", "code = input().strip()\r\nbefore = ''\r\nresult = ''\r\nfor i in range(len(code)):\r\n if code[i] == '-':\r\n if before == '-':\r\n result += '2'\r\n before = ''\r\n else:\r\n before = '-'\r\n else:\r\n if before == '-':\r\n result += '1'\r\n before = ''\r\n else:\r\n result += '0'\r\nprint(result)", "def decode_bronze_code(user):\r\n ternary_number = ''\r\n i = 0\r\n while i<len(user):\r\n if user[i]==\".\":\r\n ternary_number += \"0\"\r\n i+=1\r\n elif user[i:i+2]==\"-.\":\r\n ternary_number += \"1\"\r\n i+=2\r\n elif user[i:i+2] == \"--\":\r\n ternary_number += \"2\"\r\n i+=2\r\n return ternary_number\r\n\r\nuser = input().strip()\r\n\r\nprint(decode_bronze_code(user))\r\n", "s=list(input())\nk=len(s)\ni=0\no=''\nwhile(i<k):\n if s[i]=='.':\n o=o+'0'\n i+=1\n elif s[i]=='-' and s[i+1]=='.':\n o=o+'1'\n i+=2\n elif s[i]=='-' and s[i+1]=='-':\n o=o+'2'\n i+=2\nprint(o)\n", "ip=input()\r\ni=0\r\nfinal=''\r\nwhile(i<len(ip)):\r\n if(ip[i]=='.'):\r\n final+='0'\r\n i+=1\r\n elif(ip[i]=='-' and ip[i+1]=='.'):\r\n final+='1'\r\n i+=2\r\n elif(ip[i]=='-' and ip[i+1]=='-'):\r\n final+='2'\r\n i+=2\r\nprint(final)", "s=input()\r\na=''\r\nl=len(s)\r\nc=0\r\nfor i in range(l):\r\n if c==1:\r\n c=0\r\n continue\r\n if s[i]==\".\":\r\n a+=\"0\"\r\n elif s[i:i+2]==\"-.\":\r\n a+=\"1\"\r\n c=1\r\n elif s[i:i+2]==\"--\":\r\n a+=\"2\"\r\n c=1\r\nprint(a)", "s = input()\r\ni = 0\r\nans = ''\r\nwhile i < len(s):\r\n if s[i]=='.':\r\n ans += '0'\r\n i += 1\r\n else:\r\n s1 = s[i] + s[i+1]\r\n if s1=='-.': ans += '1'\r\n else: ans += '2'\r\n i += 2\r\nprint(ans)", "c=input()\r\nc=c.replace(\"--\",\"2\")\r\nc=c.replace(\"-.\",\"1\")\r\nc=c.replace(\".\",\"0\")\r\nprint(c)\r\n", "s=input()\r\ni=0\r\nr=\"\"\r\nwhile i<len(s):\r\n if s[i]==\".\":\r\n r+=\"0\"\r\n i+=1\r\n else:\r\n if s[i+1]==\".\":\r\n r+=\"1\"\r\n else:\r\n r+=\"2\"\r\n i+=2\r\nprint(r)", "from sys import stdin,stdout\nfrom math import gcd,sqrt,floor,ceil\n# Fast I/O\ninput = stdin.readline\n#print = stdout.write\n\ndef list_inp(x):return list(map(x,input().split()))\ndef map_inp(x):return map(x,input().split())\n\ndef lcm(a,b): return (a*b)/gcd(a,b)\n\n\n\nd = {'.':'0','-.':'1','--':'2'}\n\ns = input().strip('\\n')\n\nll = len(s)\ni = 0\nqtr = ''\nwhile i < ll:\n if s[i] == '.':\n qtr+=d['.']\n i+=1\n elif s[i] == '-':\n if s[i+1] == '-':\n qtr+=d['--']\n i+=2\n elif s[i+1] == '.':\n qtr+=d['-.']\n i+=2\nprint(qtr)\n", "se = input()\r\nresults = \"\"\r\ni = 0\r\nwhile i < len(se):\r\n if se[i] == \".\":\r\n results += '0'\r\n else:\r\n i += 1\r\n if se[i] == \".\":\r\n results += '1'\r\n else:\r\n results += '2'\r\n i += 1\r\n\r\nprint(results)", "s = input()\r\nn = \"\"\r\ni=0\r\n\r\nwhile (i<len(s)):\r\n\tif (s[i] == '.'):\r\n\t\tn += '0'\r\n\telse:\r\n\t\tif (s[i+1] == '-'):\r\n\t\t\tn += '2'\r\n\t\telse:\r\n\t\t\tn += '1'\r\n\t\ti+=1\r\n\ti+=1\r\n\r\nprint(n)\r\n", "n=input()\r\nn=n.replace('--','2')\r\nn=n.replace('-.','1')\r\nn=n.replace('.','0')\r\nprint(n)", "def decoder():\r\n string = input()\r\n string = string.replace('--', '2').replace('-.', '1').replace('.', '0')\r\n print(string)\r\ndecoder()", "inp = input()\r\na = {}\r\na['.'] = '0'\r\na['-.'] = '1'\r\na['--'] = '2'\r\nres = \"\"\r\ni = 0\r\nwhile i < len(inp):\r\n\tif inp[i] == '.':\r\n\t\tres += '0'\r\n\telif inp[i] == '-':\r\n\t\tif inp[i+1] == '.':\r\n\t\t\tres += '1'\r\n\t\telse:\r\n\t\t\tres += '2'\r\n\t\ti += 1\r\n\ti += 1\r\nprint(res)", "str = input()\r\nc=10\r\nfor i in range(len(str)):\r\n if c==5:\r\n c=10\r\n continue\r\n if str[i]=='.':\r\n print(0,end='')\r\n elif str[i]=='-':\r\n if str[i+1]=='.':\r\n c=5\r\n print(1,end='')\r\n else:\r\n c=5\r\n print(2,end='')", "s = input()\r\nl=[]\r\ni=0\r\nwhile i < len(s):\r\n\tif s[i] == \".\":\r\n\t\tl.append(0)\r\n\t\ti+=1\r\n\telif s[i:i+2] == \"-.\":\r\n\t\tl.append(1)\r\n\t\ti+=2\r\n\telif s[i:i+2] == \"--\":\r\n\t\tl.append(2)\r\n\t\ti+=2\r\nprint(*l, sep = \"\")", "s=input()\r\nn=\"\"\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n n=n+'0'\r\n i=i+1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n n=n+'1'\r\n else:\r\n n=n+'2'\r\n i=i+2\r\nprint(n)", "s=str(input())\r\ni=0\r\nwhile(1):\r\n if(i<len(s)):\r\n if(s[i]=='.'):\r\n print(\"0\",end=\"\")\r\n i=i+1\r\n else:\r\n if(s[i+1]=='.'):\r\n print(\"1\",end=\"\")\r\n else:\r\n print(\"2\",end=\"\")\r\n i=i+2\r\n else:\r\n break\r\n\r\n ", "Dict={0:\".\",1:\"-.\",2:\"--\"}\r\ns=input().strip()\r\np=0\r\nm=0\r\nc=\"\"\r\nfor n in range(0,len(s)):\r\n # print(str(n)+\"..\")\r\n # print(str(p)+\"**\")\r\n # # print(\"**\")\r\n # if p+1>=len(s)-1:\r\n # print(\";\")\r\n # print(m)\r\n # break\r\n if p==len(s)-1:\r\n # print(\"*\")\r\n c+=str(m)\r\n break\r\n # break\r\n elif p>len(s)-1:\r\n break\r\n\r\n\r\n \r\n\r\n\r\n for i,j in Dict.items():\r\n # if p==len(s)-1:\r\n # if s[p]+s[p+1]==j:\r\n # print(str(i))\r\n # break\r\n # m=0\r\n # break\r\n\r\n # print(s[p])\r\n # print(j)\r\n # print(str(i)+\"..\")\r\n # break\r\n # m=0\r\n \r\n if s[p]+s[p+1]==j:\r\n c+=str(i)\r\n p+=2\r\n # print(j)\r\n break\r\n elif s[p]==j:\r\n c+=str(i)\r\n p+=1\r\n break\r\n # if p>0:\r\n # print(m)\r\n # break\r\nprint(c)\r\n ", "def decoder(string, fmt, replacement):\n if fmt in string:\n string = string.replace(fmt, replacement)\n return decoder(string, fmt, replacement)\n if fmt not in string:\n return string\n\ncode = input()\nif '--' in code:\n code = decoder(code, '--', '2')\nif '-.' in code:\n code = decoder(code, '-.', '1')\nif '.' in code:\n code = decoder(code, '.', '0')\n\nprint(code)\n", "a = input()\r\nb = []\r\ni = 0\r\nwhile i <= len(a)-1:\r\n if a[i] == '.' :\r\n b.append('0')\r\n i = i + 1\r\n else :\r\n if a[i+1] == '.' :\r\n b.append('1')\r\n else :\r\n b.append('2')\r\n i = i + 2\r\nprint(''.join(b))", "s=input()\r\nl=''\r\ni=0\r\n# if s[len(s)-1]=='.':\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n l=l+'0'\r\n i+=1\r\n elif s[i]=='-':\r\n if s[i+1]=='.':\r\n l=l+'1'\r\n elif s[i+1]=='-':\r\n l=l+'2'\r\n i+=2\r\nprint(l)", "s = input()\r\nindex = 0\r\noutput = ''\r\nwhile index < len(s):\r\n if s[index] == '.':\r\n output += '0'\r\n elif s[index] == '-' and s[index + 1] == '-':\r\n output += '2'\r\n index += 1\r\n else:\r\n output += '1'\r\n index += 1\r\n index += 1\r\nprint(output)", "borze = input()\noutput = ''\n\nis_previous_was_dash = False\nfor c in borze:\n if is_previous_was_dash == True:\n if c == '.':\n output += '1'\n else: \n output += '2'\n is_previous_was_dash = False\n else:\n if c == '-':\n is_previous_was_dash = True\n else:\n output += '0'\n\nprint(output)", "str = input()\r\nindex =0\r\nwhile(index!=len(str)):\r\n if(str[index]==\".\"):\r\n print(0,end=\"\")\r\n index+=1\r\n elif((str[index]==\"-\")and(str[index+1]==\".\")):\r\n print(1,end=\"\")\r\n index+=2\r\n else:\r\n print(2,end=\"\")\r\n index+=2", "borze = input()\r\n\r\ndecoded = \"\"\r\n\r\npointer = 0\r\n\r\nwhile pointer < len(borze):\r\n if borze[pointer] == \".\":\r\n decoded += \"0\"\r\n pointer += 1\r\n elif borze[pointer] == \"-\" and borze[pointer + 1] == \".\":\r\n decoded += \"1\"\r\n pointer += 2\r\n elif borze[pointer] == \"-\" and borze[pointer + 1] == \"-\":\r\n decoded += \"2\"\r\n pointer += 2\r\n \r\nprint(decoded)", "s=input()\r\nnum=''\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n num=num+'0'\r\n i+=1\r\n else:\r\n if s[i+1]=='.':\r\n num+='1'\r\n else:\r\n num+='2'\r\n i+=2\r\nprint(num)", "l=input()\r\nc=\"\"\r\ni=0\r\nwhile(i<len(l)):\r\n\tif(l[i]==\"-\" and l[i+1]==\"-\" and i<len(l)-1):\r\n\t\tc+=\"2\"\r\n\t\ti+=2\r\n\telif(l[i]==\"-\" and l[i+1]==\".\" and i<len(l)-1):\r\n\t\tc+=\"1\"\r\n\t\ti+=2\r\n\telif(l[i]==\".\"):\r\n\t\tc+=\"0\"\r\n\t\ti=i+1\r\nprint(c)\t\r\n\t", "borze = ['.', '-.', '--']\r\n\r\ns = input()\r\nnumber = ''\r\n\r\nwhile s:\r\n digit = [s.startswith(b) for b in borze].index(True)\r\n s = s[len(borze[digit]):]\r\n number += str(digit)\r\n\r\nprint(number)\r\n", "import sys\nstr = sys.stdin.readline()\nstr = str.replace('--', '2').replace('-.', '1').replace('.', '0')\nprint(str)", "b=input()\r\ns=''\r\na=''\r\nfor i in b:\r\n s+=i\r\n if len(s)==2:\r\n if s=='..':\r\n a+='00'\r\n s=''\r\n elif s=='.-':\r\n a+='0'\r\n s='-'\r\n elif s=='--':\r\n a+='2'\r\n s=''\r\n elif s=='-.':\r\n a+='1'\r\n s=''\r\nif len(s)==1:\r\n a+='0'\r\n \r\nprint(a)\r\n ", "s = input()\r\nans = \"\"\r\ni=0\r\nwhile i <(len(s)): \r\n if s[i]==\".\": \r\n ans += \"0\"\r\n i +=1\r\n else:\r\n if s[i:i+2]==\"-.\": \r\n ans +='1'\r\n else: \r\n ans += \"2\"\r\n i+=2\r\nprint(ans)", "arr = input()\r\nstop = len(arr)\r\ni = 0\r\nOTBET = ''\r\nwhile i < stop:\r\n if arr[i] == '-':\r\n i += 1\r\n if arr[i] == '.':\r\n OTBET += '1'\r\n elif arr[i] == '-':\r\n OTBET += '2'\r\n elif arr[i] == '.':\r\n OTBET += '0'\r\n i += 1\r\nprint(OTBET)", "from collections import deque\r\n\r\nq = deque()\r\ninput_line = input()\r\nans_list = list()\r\nfor item in input_line:\r\n q.append(item)\r\nwhile q:\r\n item = q.popleft()\r\n if item == '.':\r\n ans_list.append('0')\r\n elif item == '-':\r\n item2 = q.popleft()\r\n if item2 == '.':\r\n ans_list.append('1')\r\n elif item2 == '-':\r\n ans_list.append('2')\r\n else:\r\n raise Exception('non-identified item 2 = {}'.format(item2))\r\n else:\r\n raise Exception('non-identified item 1- {}'.format(item))\r\nprint(\"\".join(ans_list))\r\n", "import 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 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\na = input()\r\ni = 0\r\nwhile i < len(a):\r\n if a[i] == \".\":\r\n print(0, end=\"\")\r\n elif a[i] == \"-\":\r\n if a[i+1] == \"-\":\r\n print(2, end=\"\")\r\n elif a[i+1] == \".\":\r\n print(1, end=\"\")\r\n i += 1\r\n i += 1\r\n", "import re\n\nif __name__ == '__main__':\n code = input()\n x = code.replace('--', '2')\n y = x.replace('-.', '1')\n z = y.replace('.', '0')\n print(z)\n", "def convert(x,i):\r\n if i >= len(x):\r\n return ''\r\n\r\n if x[i] == '.':\r\n return '0' + convert(x, i + 1)\r\n elif x[i] == '-':\r\n if i + 1 < len(x) and x[i + 1] == '-':\r\n return '2' + convert(x, i + 2)\r\n elif i + 1 < len(x) and x[i + 1] == '.':\r\n return '1' + convert(x, i + 2)\r\n \r\n return '' \r\nx = input()\r\nresult = convert(x, 0)\r\nprint(result)\r\n", "\r\ns=input()\r\na=0\r\nb=''\r\n\r\nwhile a < len(s):\r\n if s[a:a+2]=='--':\r\n b+='2'\r\n a+=2\r\n elif s[a:a+2]=='-.':\r\n b+='1'\r\n a+=2\r\n else:\r\n b+='0'\r\n a+=1\r\n\r\nprint(b)\r\n", "st = input()\r\nres=[]\r\nwhile len(st)>0:\r\n if st[0]=='.':\r\n res.append('0')\r\n st=st[1:]\r\n elif st[0]=='-' and st[1]=='.':\r\n res.append('1')\r\n st=st[2:]\r\n else:\r\n res.append('2')\r\n st=st[2:]\r\nprint(''.join(res)) ", "kod = list(input())\r\naciklama =[]\r\nwhile len(kod)>0:\r\n if kod[0]=='.':\r\n aciklama.append('0')\r\n kod.pop(0)\r\n else:\r\n if kod[1]=='.':\r\n aciklama.append('1')\r\n del kod[0:2]\r\n else:\r\n aciklama.append('2')\r\n del kod[0:2]\r\nprint(''.join(aciklama))", "\r\ndef solve(a):\r\n b = \"\"\r\n i = 0\r\n while i < len(a):\r\n if a[i] == \".\":\r\n b += \"0\"\r\n elif a[i] == \"-\":\r\n if a[i + 1] == \".\":\r\n b += \"1\"\r\n i += 1\r\n else:\r\n b += \"2\"\r\n i += 1\r\n i += 1\r\n return b\r\n\r\nn = str(input())\r\nprint(solve(n))", "s=input()\r\ni=0\r\nl=len(s)\r\nr=\"\"\r\nwhile(i<l):\r\n if s[i]==\".\":\r\n r=r+\"0\"\r\n i=i+1\r\n else:\r\n i=i+1\r\n if s[i]==\".\":\r\n r=r+\"1\"\r\n else:\r\n r=r+\"2\"\r\n i=i+1\r\nprint(r)", "def findStr(s):\r\n flag = 0\r\n arr = []\r\n for i in s:\r\n if i is '.' and flag == 0:\r\n arr.append('0')\r\n elif i is '-' and flag == 0:\r\n flag = 1\r\n elif i is '-' and flag == 1:\r\n arr.append('2')\r\n flag = 0\r\n elif i is '.' and flag == 1:\r\n arr.append('1')\r\n flag = 0\r\n return \"\".join(arr)\r\n\r\ns = input()\r\nresult = findStr(s)\r\nprint(result)", "\r\ns=input()\r\ni=0\r\nwhile i!=len(s):\r\n if s[i]=='-'and s[i+1]=='.':\r\n print(1,end=\"\")\r\n i=i+2\r\n elif s[i]=='-'and s[i+1]=='-':\r\n print(2,end=\"\")\r\n i=i+2\r\n elif s[i]=='.':\r\n print(0,end=\"\")\r\n i=i+1\r\n \r\n ", "string = input()\r\noutput = \"\"\r\ni=0\r\nwhile(True):\r\n if i == len(string):\r\n break\r\n \r\n elif string[i] == '.':\r\n output += \"0\"\r\n i+=1\r\n \r\n else:\r\n if string[i+1] == '-':\r\n output += \"2\"\r\n i += 2\r\n else:\r\n output += \"1\"\r\n i += 2\r\n \r\nprint(output)", "t = input()\r\nr = \"\"\r\ni = 0\r\nwhile(i < len(t)):\r\n if(t[i]=='.'):\r\n r += '0'\r\n i += 1\r\n elif(i != len(t)-1):\r\n if(t[i+1] == '-'):\r\n r += '2'\r\n else:\r\n r += '1'\r\n i += 2\r\nprint(r)", "s=input()\r\nternary=\"\"\r\ni=0\r\nwhile i<len(s):\r\n if s[i]==\".\":\r\n ternary+=\"0\"\r\n i+=1\r\n elif s[i]==\"-\":\r\n if s[i+1]==\".\":\r\n ternary+=\"1\"\r\n else:\r\n ternary+=\"2\"\r\n i+=2\r\nprint(ternary) ", "code = input()\r\nreq = code.replace(\"--\" ,\"2\").replace(\"-.\" ,\"1\").replace(\".\" ,\"0\")\r\nprint(req)\r\n", "a = str(input())\r\nb = ''\r\nwhile len(a) != 0:\r\n if a[0] == '.':\r\n b = b + '0'\r\n a = a[1::]\r\n elif a[0] == '-' and a[1] == '.':\r\n b = b + '1'\r\n a = a[2::]\r\n elif a[0] == '-' and a[1] == '-':\r\n b = b + '2'\r\n a = a[2::]\r\nprint(b)", "n=input()\r\nn1=n.replace(\"--\",\"2\")\r\nn2=n1.replace(\"-.\",\"1\")\r\nn3=n2.replace(\".\",\"0\")\r\n\r\nprint(n3)", "a, q, i, w = input(), [], 1, []\r\nq.extend(a)\r\nwhile i != len(q) + 1:\r\n if q[i - 1] == '-' and q[i] == '-':\r\n w.append('2')\r\n i += 2\r\n elif q[i - 1] == '-' and q[i] == '.':\r\n w.append('1')\r\n i += 2\r\n elif q[i - 1] == '.':\r\n w.append('0')\r\n i += 1\r\nprint (''.join(w))", "from sys import stdin\r\n\r\ns=stdin.readline().strip()\r\nn=len(s)\r\nans=''\r\ni=0\r\nwhile i<n-1:\r\n if s[i]=='-' and s[i+1]=='.':\r\n ans+='1'\r\n i+=2\r\n continue\r\n if s[i]=='-' and s[i+1]=='-':\r\n ans+='2'\r\n i+=2\r\n continue\r\n if s[i]=='.':\r\n ans+='0'\r\n i+=1\r\nif i==n-1 and s[i]=='.':\r\n ans+='0'\r\nprint(ans)", "code = input()\r\n\r\nL=[]\r\n\r\ni=0\r\nwhile(i<len(code)):\r\n if code[i] == '.':\r\n L.append(0)\r\n i+=1\r\n elif i==len(code)-1:\r\n break\r\n elif code[i] == '-' and code[i+1] == '.':\r\n L.append(1)\r\n i+=2\r\n elif code[i] == '-' and code[i+1]== '-':\r\n L.append(2)\r\n i+=2\r\n \r\nL = [str(i) for i in L]\r\nprint(\"\".join(L))", "a = input()\r\nb = a.replace(\"--\",\"2\").replace(\"-.\",\"1\").replace(\".\",\"0\")\r\nprint(b)", "s=input()\r\ns1=''\r\ni=0\r\nwhile(i<len(s)):\r\n if s[i]=='.':\r\n s1 += '0'\r\n i+=1\r\n elif s[i]=='-' and s[i+1]=='.':\r\n s1 += '1'\r\n i+=2\r\n elif s[i]=='-' and s[i+1]=='-':\r\n s1 += '2'\r\n i+=2\r\n \r\nprint(s1)\r\n ", "exp = input()\r\nl = list(exp)\r\ni=0\r\nres = []\r\nwhile i< len(l):\r\n if l[i] == '.':\r\n res.append(0);\r\n else:\r\n i=i+1\r\n if l[i] == '.':\r\n res.append(1);\r\n else:\r\n res.append(2);\r\n i =i+1\r\n\r\nlistToStr = ''.join(str(elem) for elem in res)\r\nprint(listToStr)", "st = str(input())\nnum = \"\"\n\nwhile len(st)>0:\n if st[0] == \".\":\n num += \"0\"\n st = st[1:]\n elif st[0:2] == \"-.\":\n num += \"1\"\n st = st[2:]\n elif st[0:2] == \"--\":\n num += \"2\"\n st = st[2:]\n\nprint(num)\n", "s=input()\r\nn=len(s)\r\nl=[]\r\ni=0\r\nwhile(i<n):\r\n if(s[i]=='.'):\r\n l.append('0')\r\n elif(i!=n-1):\r\n if(s[i]=='-' and s[i+1]=='.'):\r\n l.append('1')\r\n i=i+1\r\n elif(s[i]=='-' and s[i+1]=='-'):\r\n l.append('2')\r\n i=i+1\r\n i=i+1\r\nprint(\"\".join(l))\r\n" ]

[ "from collections import deque,Counter\nfrom math import *\nimport sys\nimport random\nfrom bisect import *\nfrom functools import reduce\nfrom sys import stdin\nfrom heapq import *\nimport copy\ninput = lambda: sys.stdin.readline().rstrip()\n\na,b = map(int,input().split())\nans = 0\nwhile a>=1 or b>=1:\n if a<b and a>=1 and b>=2:\n a-=1\n b-=2\n elif a>=2 and b>=1:\n a-=2\n b-=1\n else:\n break\n ans+=1\nprint(ans)\n", "n,m = map(int,input().split())\r\nans = 0\r\nwhile n>0 and m>0:\r\n if n >= m:\r\n n -= 2\r\n m -= 1\r\n if n>=0 and m>=0:\r\n ans += 1\r\n else:\r\n m -= 2\r\n n -= 1\r\n if n >=0 and m>=0:\r\n ans += 1\r\nprint(ans)", "n, m = map(int, input().split())\r\nans = 0\r\nwhile n and m and n + m > 2:\r\n ans += 1\r\n if n > m:\r\n n -= 2\r\n m -= 1\r\n else:\r\n m -= 2\r\n n -= 1\r\nprint(ans)", "def main():\r\n n, m = map(int, input().split())\r\n\r\n print(min(n, m, (n + m) // 3))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a,b=map(int,input().split())\r\nprint(min(min(a, b),(a + b)//3))", "n, m=[int(k) for k in input().split()]\r\nn, m=sorted([n, m])\r\nprint(min(n, (n+m)//3))", "n,m=map(int,input().split())\r\nans=0\r\nfor a in range(min(n,m)+1):\r\n b=min((n-a)//2,m-2*a)\r\n ans=max(ans,a+b)\r\nprint(ans)", "import sys, collections, bisect, heapq, functools, itertools, math\r\ninput = sys.stdin.readline\r\n\r\nn, m = [int(x) for x in input().split()]\r\n\r\n# ans = 0\r\n# for i in range(0, n+1):\r\n# if 2 * i <= m:\r\n# ans = max(ans, i + min((n - i) // 2, m - 2 * i))\r\n# print(ans)\r\n\r\nif n > m:\r\n n, m = m, n\r\nprint(n if m >= 2 * n else (n + m) // 3)\r\n\r\n# https://www.luogu.com.cn/blog/HowToExceedTimeLimit/solution-cf519c", "nums = list(map(int, input().split()))\r\n\r\nteams = 0\r\ni = 1\r\nwhile min(nums) >= 1 and max(nums) >= 2:\r\n # print(i)\r\n\r\n n, m = min(nums), max(nums)\r\n n -= 1\r\n m -= 2\r\n teams += 1\r\n nums = [n, m]\r\n\r\n i += 1\r\n # print(nums)\r\n\r\nprint(teams)\r\n", "n,m = map(int,input().split())\na = 0\nb = 0\nwhile n >= 1 and m >= 2 or n >= 2 and m >= 1:\n if n >= m:\n n -= 2\n m -= 1\n a += 1\n else:\n m -= 2\n n -= 1\n b += 1\nprint(a+b)\n\n\t\t\t \t\t\t \t\t\t \t \t \t\t\t \t \t", "a,b=map(int,input().split())\r\nprint(min(a,min(b,(a+b)//3)))", "n, m = map(int, input().split())\r\nprint(min((n+m)//3,min(n,m)))", "n,m=map(int,input().split())\n\nx=(n+m)//3\nmi=min(n,m)\nif x<=mi:\n print(x)\nelse:\n print(mi)\n\n\t \t \t\t \t\t\t\t\t \t \t \t\t \t", "n, m = [int(item) for item in input().split(\" \")]\r\n\r\n\r\nmax_teams = 0\r\n\r\nmaxa = 0\r\nmaxb = 0\r\nfor a in range (0, min(m+1, n//2 + 1)):\r\n\tb = min(n-a*2, (m-a)//2)\r\n\r\n\tif (max_teams < a+b):\r\n\t\tmaxa = a\r\n\t\tmaxb = b\r\n\r\n\tmax_teams = max(max_teams, a+b)\r\n\r\nprint(max_teams)", "n, m = map(int, input().split())\r\nprint(min(n ,m, (n+m)//3))", "nn,mm=input().split()\r\nn,m=int(nn),int(mm)\r\nc=0\r\nwhile min(n,m)>0:\r\n if n==m:\r\n c+=(n+m)//3\r\n break\r\n elif n>m:\r\n n-=2\r\n m-=1\r\n else:\r\n n-=1\r\n m-=2\r\n c+=1\r\nprint(c)", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b = ([int(x) for x in input().split()])\r\nc=0\r\nwhile a>0 and b>0 and a+b>2:\r\n if a>=b:\r\n a=a-2\r\n b=b-1\r\n c=c+1\r\n else:\r\n b=b-2\r\n a=a-1\r\n c=c+1\r\nprint(c)\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na=n+m\r\nn=max(n,m)\r\nm=a-n\r\nif n>=2*m:\r\n if n%2==1 and m-(n//2)>=2:\r\n print(min((n//2)+1,m))\r\n else:\r\n print(min(n//2,m))\r\nelse:\r\n c=0\r\n while(n>1 or m>1):\r\n while(n>=m):\r\n n-=2\r\n m-=1\r\n # print(c)\r\n if n<0 or m<0:\r\n break\r\n c+=1\r\n\r\n while(m>=n):\r\n n-=1\r\n m-=2\r\n # print(c)\r\n if n<0 or m<0:\r\n break\r\n c+=1\r\n\r\n if n <= 0 or m <= 0:\r\n break\r\n print(c)\r\n", "def solve():\r\n n,m=map(int,input().split())\r\n c=0\r\n while min(n,m)>0 and max(n,m)>1:\r\n if m<n:\r\n m-=1;n-=2;c+=1\r\n else:\r\n m-=2;n-=1;c+=1\r\n print(c)\r\nsolve()\r\n#for _ in range(int(input())):solve()", "def solve():\r\n n, m = map(int, input().split())\r\n ans = 0\r\n for i in range(m + 1):\r\n if (i * 2 > n):\r\n break\r\n j = min(n - 2 * i, (m - i) // 2)\r\n ans = max(ans, i + j)\r\n print(ans)\r\n\r\nt = 1\r\n#t = int(input())\r\nfor _ in range(t):\r\n solve()", "\"\"\"\r\n Author : Ashish Sasmal\r\n Python3 / PyPy3\r\n\"\"\"\r\n\r\nfrom sys import stdin as sin\r\ndef aint():return int(input())\r\ndef amap():return map(int,sin.readline().split())\r\ndef alist():return list(map(int,sin.readline().split()))\r\ndef astr():return input()\r\n\r\nn,m = amap()\r\nans = 0\r\nwhile n>=1 and m>=1:\r\n if n>m:\r\n ans+=1\r\n n-=2\r\n m-=1\r\n elif m>n:\r\n ans+=1\r\n n-=1\r\n m-=2\r\n elif n==m and n>1:\r\n ans+=1\r\n n-=2\r\n m-=1\r\n else:\r\n break\r\nprint(ans)", "n,m = map(int, input().split())\r\nmaxi = max(n,m)\r\nmini = min(n,m)\r\nk = maxi - mini\r\nif mini <= k:\r\n print(mini)\r\nelse:\r\n while mini > k:\r\n k+=2\r\n mini-=1\r\n print(mini)", "n, m = map(int, input().split())\r\ncount = 0\r\nif n >= m:\r\n m, n = n, m\r\ndiff = m - n\r\nif diff > n:\r\n print(n)\r\nelse:\r\n count += diff\r\n n -= diff\r\n m = n\r\n res = m // 3\r\n print(count + res*2 if m % 3 <= 1 else count + 1 + res*2)\r\n", "n, m = list(map(int, input().split()))\r\nteams = 0\r\nwhile n+m >= 3 and n > 0 and m > 0:\r\n if 2*n > m:\r\n n -= 2\r\n m -= 1\r\n else:\r\n n -= 1\r\n m -= 2\r\n teams += 1\r\nprint(teams)", "n, m = map(int, input().split())\r\n\r\nt = 0\r\nwhile (n > 0 and m > 0):\r\n if (n == 1 and m == 1):\r\n break\r\n elif (n >= m):\r\n n -= 2 \r\n m -= 1\r\n t += 1 \r\n elif (m > n):\r\n n -= 1 \r\n m -= 2 \r\n t += 1 \r\nprint(t)", "import math\r\n\r\nn,m=[int(i) for i in input().split()]\r\n\r\nz=math.floor((n+m)/3)\r\nif(z>n and z<m):\r\n print(n)\r\nelif(z>m and z<n):\r\n print(m)\r\n\r\nelif(z>n and z>m):\r\n print(min(n,m))\r\nelse:\r\n print(z)", "a=input().split()\r\nn,m=int(a[0]),int(a[1]) \r\n\r\ndef q(n,m):\r\n l=[n,m]\r\n l.append((n+m)//3)\r\n return min(l)\r\n\r\nprint(q(n,m))", "e,n=map(int, input().split())\nk=e\n#e----exp\n#n---newbie\nc=0\nwhile True:\n if e==0 or n==0: break\n elif e==1 and n==1: break\n else:\n if e!=1 and e>n:\n c+=1\n e=e-2\n n=n-1\n #elif e!=1 and e<n:\n else:\n c+=1\n e=e-1\n n=n-2\nprint(c)\n\n\n\n\n\t \t \t \t \t\t\t \t\t \t\t \t", "\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\nans=0\r\n\r\n\r\n\r\nwhile n>0 and m>0 and n+m>2:\r\n\r\n if n>m:\r\n n-=2\r\n m-=1\r\n ans+=1\r\n else:\r\n m-=2\r\n n-=1\r\n ans+=1\r\n\r\nprint(ans)\r\n", "from queue import PriorityQueue\r\nfrom queue import Queue\r\nimport math\r\nfrom collections import *\r\nimport sys\r\nimport operator as op\r\nfrom functools import reduce\r\n \r\n# sys.setrecursionlimit(10 ** 6)\r\nMOD = int(1e9 + 7)\r\ninput = sys.stdin.readline\r\nii = lambda: list(map(int,input().strip().split()))\r\nist= lambda: list(input().strip().split())\r\n \r\nn, m = ii()\r\nif n >= (n+ m)//3 and m >= (n+m)// 3:\r\n\tprint((n+m)//3)\r\nelse:\r\n\tmi = min(n,m)\r\n\tma= max(n,m)\r\n \r\n\tsu = min(mi, ma // 2)\r\n\tma -= su * 2\r\n\tmi -= su\r\n\tprint(su + min(mi// 2, ma))", "n, m = map(int, input().split(' '))\r\na = (n + m) // 3\r\nb = min(n, m)\r\nprint(min(a, b))\r\n", "m,n=map(int,input().split())\r\nans=0\r\nm,n=max(m,n),min(m,n)\r\nfor i in range(5000009):\r\n if (m>=2 or n>=2) and m>0 and n>0:\r\n ans+=1\r\n else:\r\n break\r\n m,n=max(m,n),min(m,n)\r\n m-=2\r\n n-=1 \r\nprint(ans)", "a, b = [int(s) for s in input().split(\" \")]\n\ntotal = 0\n\nwhile a >= 1 and b >= 1 and a + b >= 3:\n if a > b:\n a -= 2\n b -= 1\n total += 1\n else:\n a -= 1\n b -= 2\n total += 1\nprint(total)\n", "#\r\n#####################################################################################################################\r\n\r\nfrom math import floor\r\n\r\n\r\ndef myFloor(n):\r\n return floor(n)\r\n\r\n\r\ndef nTeamsMax(nExperienced, nNewbies):\r\n return min(nExperienced, nNewbies, myFloor((nNewbies+nExperienced)/3))\r\n\r\n\r\nprint(nTeamsMax(*map(int, input().split(' '))))\r\n", "m = list(map(int,input().split()))\ne = m[0]\nn = m[1]\nteam = (e+n) // 3\nif e == 0 or n == 0:\n print(0)\nelif (n*2) <= e:\n print(n)\nelif team <= e:\n print(team)\nelse:\n print(e)\n \t \t \t\t \t\t\t \t \t \t \t \t\t\t", "inp = input().split()\r\nn = int(inp[0])\r\nm = int(inp[1])\r\n\r\nprint(min(n, m, (n + m) // 3))", "e,n = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(0,min(n,e//2)+1):\r\n\tans = max(ans,i+min(e-2*i,(n-i)//2))\r\n\t# print(i,min(e,n//2))\r\nprint(ans)", "import os\r\nimport sys\r\nimport time\r\nimport math as mt\r\nimport pprint\r\nimport itertools as it\r\nimport operator as op\r\nimport bisect as bs\r\nimport functools as fn\r\nimport queue\r\nfrom collections import deque, defaultdict , OrderedDict, Counter, ChainMap\r\nmaxx, localsys, mod = 1 << 60, 0, int(1e9 + 7)\r\ndef nCr(n, r): return reduce(mul, range(n - r + 1, n + 1), 1) // factorial(r)\r\n\r\n\r\ndef ceil(n, x): return (n + x - 1) // x\r\n\r\n\r\nosi, oso = '/home/priyanshu/Documents/cp/input.txt', '/home/priyanshu/Documents/cp/output.txt'\r\nif os.path.exists(osi):\r\n\tsys.stdin = open(osi, 'r')\r\n\tsys.stdout = open(oso, 'w')\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef maps(): return map(int, input().split())\r\n\r\n# THINK ABOUT THE EDGE CASES ..........\r\n\r\n# DON'T SUBMIT UNLESS YOU ARE ABSOLUTELY SURE !!!!!\r\n\r\ndef Kth_beautiful_string():\r\n\tfor _ in range(int(input())):\r\n\t\tn , k = maps() ; arr = ['a']*n\r\n\t\tfor i in range(n-1 , -1 , -1):\r\n\t\t\tif n-i-1 >= k:\r\n\t\t\t\tarr[i]= arr[i + (n-i-1) - (k-1)] ='b'\r\n\t\t\t\tprint(''.join(arr)) ; break\r\n\t\t\tk-=n-i-1\r\n\t#constantly decrease the number of string whose left most position is at i,because at every ith position (n-i-1) strings exists whose right most position is at i\r\ndef subhate():\r\n\tfor _ in range(*maps()):\r\n\t\ts = input().rstrip('\\n')\r\n\t\ts1 , s0 = 0 , 0\r\n\t\tfor i in s:\r\n\t\t\ts1 += (i == '1') ; s0 += (i == '0')\r\n\t\tp1 , p0 = 0,0\r\n\t\tans = maxx\r\n\t\tfor i in s:\r\n\t\t\tp1 += (i == '1') ;p0 += (i == '0') ;s1 -= (i == '1') ; s0 -= (i == '0')\r\n\t\t\tans = min(ans , (p1+s0) , (p0 + s1))\r\n\t\tprint(ans)\r\n\t\t#convert the string into 0000....1111 or 11111....00000\r\ndef pair_of_topics():\r\n\tn, = maps()\r\n\ta ,b = [*maps()] , [*maps()]\r\n\tans =0\r\n\tc = sorted(a[i]-b[i] for i in range(n))\r\n\tfor i in range(n):\r\n\t\tans += max(i - bs.bisect_right(c , -c[i]),0)\r\n\tprint(ans)\r\n\t#the i <j is given , so you don't count (1 , 2) and (2 ,1 ) as different pairs\r\ndef search(arr , key):\r\n\tl , h = 0 , len(arr) - 1\r\n\tidx= -1\r\n\twhile l<=h:\r\n\t\tm = (l+h)//2\r\n\t\tif arr[m] == key:\r\n\t\t\treturn m\r\n\t\telif arr[m] < key:\r\n\t\t\tl = m + 1\r\n\t\telse:\r\n\t\t\tidx =m\r\n\t\t\th = m - 1\r\n\treturn idx\r\n\r\n\r\ndef zero_remainder_array():\r\n\tfor _ in range(*maps()):\r\n\t\tn , k = maps()\r\n\t\ta = [*maps()]\r\n\t\tans , cnt = 0 , defaultdict(int)\r\n\t\tfor i in a:\r\n\t\t\tif i % k :\r\n\t\t\t\tcnt[i%k]+=1\r\n\t\t\t\tans = max(ans , k*cnt[i%k] - i%k + 1)\r\n\t\tprint(ans)\r\n\r\n\r\ndef A_B():\r\n\tdef naive(n , m):\r\n\t\tans = 0\r\n\t\twhile n >0 and m >0:\r\n\t\t\tif n >=m:\r\n\t\t\t\tif n -2 >=0 and m-1 >=0:\r\n\t\t\t\t\tn-=2\r\n\t\t\t\t\tm-=1\r\n\t\t\t\t\tans+=1\r\n\t\t\t\telse:\r\n\t\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tif m -2 >=0 and n -1 >=0:\r\n\t\t\t\t\tm-=2\r\n\t\t\t\t\tn-=1\r\n\t\t\t\t\tans+=1\r\n\t\t\t\telse:\r\n\t\t\t\t\tbreak\r\n\t\treturn ans\r\n\r\n\tn , m = maps()\r\n\tt = naive(n,m)\r\n\tN , M = n , m\r\n\tans = 0\r\n\twhile abs(n-m)>=1 and (n+m)>=3 and ((n>=2 and m>=1) or (m>=2 and n >=1)):\r\n\t\tif n >=m:\r\n\t\t\tdiff = min(m,(n - m))\r\n\t\t\tn-=2*diff\r\n\t\t\tm-=diff\r\n\t\telse:\r\n\t\t\tdiff = min(n,(m - n))\r\n\t\t\tm-= 2*diff\r\n\t\t\tn-= diff\r\n\t\tans+=diff\r\n\tif n == m:\r\n\t\tx = max(0, (n//3) -1)\r\n\t\tans += x*2\r\n\t\tn-=3*x\r\n\t\tm-=3*x\r\n\tans+= naive(n,m)\r\n\t# if n >=m:\r\n\t# \tx= min(n//2 , m)\r\n\t# \tans+=x\r\n\t# \tn-= 2*x\r\n\t# \tm-=x\r\n\t# else:\r\n\t# \tx = min(m//2 , n)\r\n\t# \tans+=x\r\n\t# \tm-= 2*x\r\n\t# \tn-=x\r\n\r\n\t# print(ans , t,n,m)\r\n\r\n\t# if n >=2 and m >=1:\r\n\t# \tx+=min(n//2 ,m)\r\n\r\n\t# elif m >=2 and n >=1:\r\n\t# \tx += min(m//2 , n)\r\n\r\n\t# if ans != t:\r\n\t# \tprint(ans,t , N,M)\r\n\tprint(ans)\r\n\r\n# for _ in range(*maps()):\r\nA_B()", "n, m = map(int, input().split())\r\n\r\ncount = 0\r\n#creating team of 1n & 2m\r\nbig = max(n, m)\r\nsmall = min(n, m)\r\nwhile big>0 and small>0:\r\n temp_big = big - 2\r\n temp_small = small - 1\r\n big = max(temp_big, temp_small)\r\n small = min(temp_big, temp_small)\r\n if big >= 0 and small >= 0: count += 1\r\n\r\nprint(count)", "a, b = map(int, input().split())\r\n\r\nres = 0\r\nfor t1 in range(a+1):\r\n a1 = a - t1\r\n b1 = b - t1*2\r\n\r\n if b1 >= 0 and a1 >= 0:\r\n res = max(res, min(b1, a1//2) + t1)\r\n\r\nprint(res)", "import math as mt\r\nfrom collections import defaultdict,deque\r\nimport sys\r\nfrom bisect import bisect_right as b_r\r\nfrom bisect import bisect_left as b_l\r\n# from os import path\r\n# from heapq import *\r\n\r\n\r\nmod=1000000007\r\nINT_MAX = sys.maxsize-1\r\nINT_MIN = -sys.maxsize\r\n\r\n\r\n\r\n# if(path.exists('inputt.txt')):\r\n# sys.stdin = open('inputt.txt','r')\r\n# sys.stdout = open('output.txt','w')\r\n# else:\r\n# # input=sys.stdin.readline\r\n# pass\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef myyy__answer():\r\n n,m=map(int,input().split())\r\n cnt=0\r\n\r\n while(True):\r\n if(n<m):\r\n if(n>0 and m>1):\r\n n-=1\r\n m-=2\r\n cnt+=1\r\n else:\r\n break\r\n else:\r\n if(n>1 and m>0):\r\n n-=2\r\n m-=1\r\n cnt+=1\r\n else:\r\n break\r\n \r\n print(cnt)\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for _ in range(int(input())):\r\n # print(myyy__answer())\r\n myyy__answer()", "n, m = map(int, input().split())\r\na = min(n, m)\r\nb = max(n, m)\r\nc=0\r\nwhile(a and b):\r\n if b>=a and b>=2 and a>=1:\r\n b-=2\r\n a-=1\r\n c+=1\r\n elif a>b and a>=2 and b>=1:\r\n a-=2\r\n b-=1\r\n c+=1\r\n else:\r\n break\r\nprint(c)\r\n", "n, m = map(int, input().split())\r\n\r\nif m >= 2 * n:\r\n print(n)\r\n \r\nelif n >= 2 * m:\r\n print(m)\r\n\r\nelse:\r\n print((n + m) // 3)\r\n", "buff = list(map(int, input().split()))\r\nn = buff[0]\r\nm = buff[1]\r\nmax = 0\r\nfor i in range(min(m//2 + 1, n + 1)):\r\n if min(m - i*2, (n - i) // 2) + i > max:\r\n max = min(m - i*2, (n - i) // 2) + i\r\nprint(max)", "n,m=map(int,input().rstrip().split())\r\nif (n+m)//3>=1:\r\n if(n+m)//3<=min(n, m ):\r\n print((n+m)//3)\r\n else:\r\n print(min(n, m))\r\nelse:\r\n print(\"0\") ", "#\r\n#####################################################################################################################\r\n\r\nfrom math import floor\r\n\r\n\r\ndef nTeamsMax(nExperienced, nNewbies):\r\n if nExperienced >= nNewbies + nNewbies:\r\n return nNewbies\r\n return nExperienced if nNewbies >= nExperienced + nExperienced else floor((nNewbies+nExperienced)/3)\r\n\r\n\r\nvalues = input()\r\niSpace = values.find(' ')\r\nprint(nTeamsMax(int(values[:iSpace]), int(values[iSpace+1:])))\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, m = [int(x) for x in input().split()]\r\nans = 0\r\nwhile n > 0 and m > 0 and n + m >= 3:\r\n if n > m:\r\n n -= 2\r\n m -= 1\r\n else:\r\n m -= 2\r\n n -= 1\r\n ans += 1\r\nprint(ans)", "from sys import stdin,stdout \r\ninput = stdin.readline\r\nfrom math import sqrt,inf\r\nfrom bisect import bisect_left,bisect_right\r\n\r\nn,m = map(int,input().split())\r\nans = 0\r\nwhile n > 0 and m > 0 :\r\n if m >= n:\r\n if m - 2 >= 0 and n-1 >= 0:\r\n ans += 1\r\n m -=2\r\n n-= 1\r\n else:\r\n break \r\n else:\r\n if n - 2>= 0 and m- 1>= 0:\r\n ans += 1\r\n m -= 1\r\n n -= 2\r\n else:\r\n break\r\nprint(ans) \r\n\r\n\r\n", "def main():\r\n xp, nb = [int(x) for x in input().split()]\r\n ans = 0\r\n while True:\r\n if xp > nb:\r\n if xp>1 and nb > 0:\r\n xp -=2\r\n nb -= 1\r\n else:\r\n print(ans)\r\n return\r\n else:\r\n if nb>1 and xp > 0:\r\n nb -=2\r\n xp -= 1\r\n else:\r\n print(ans)\r\n return\r\n ans += 1\r\n print(ans)\r\n return\r\n\r\n\r\n\r\nmain()\r\n \r\n", "n, m = map(int, input().split())\r\nm_t = 0\r\n\r\nfor i in range(0, min(n, m // 2 ) + 1):\r\n t_2 = min((n - i) // 2, m - i * 2)\r\n m_t = max(m_t, t_2 + i)\r\nprint(m_t)", "a, b = map(int, input().split())\r\n\r\nc = 0\r\n\r\nwhile a > 0 and b > 0 and (a >= 2 or b >= 2):\r\n if a <= b:\r\n a -= 1\r\n b -= 2\r\n else:\r\n a -= 2\r\n b -= 1\r\n c += 1\r\nprint(c)", "import sys\r\nimport glob\r\nONLINE_JUDGE = bool(glob.glob('input*.txt'))\r\nif ONLINE_JUDGE:\r\n sys.stdin = open(glob.glob('input*.txt')[0], 'r')\r\n sys.stdout = open(glob.glob('output*.txt')[0], 'w')\r\n\r\n\r\nn, m = map(int, input().split())\r\nprint(min(n, m, (n + m) // 3))\r\n", "import math\r\n\r\ndef main_function():\r\n n, m = [int(u) for u in input().split(\" \")]\r\n print(min((n + m) // 3, n, m))\r\n\r\nif __name__ == '__main__':\r\n main_function()\r\n", "#\r\n#####################################################################################################################\r\n\r\nfrom math import floor\r\n\r\n\r\nnExperienced, nNewbies = map(int, input().split(' '))\r\nprint(min(nExperienced, nNewbies, floor((nNewbies+nExperienced)/3)))\r\n", "a, b = map(int, input().split())\r\nif max(a, b) >= min(a, b) * 2:\r\n print(min(a, b))\r\nelse:\r\n print((a + b) // 3)", "n, m = map(int, input().split())\r\n\r\nif n == 0 or m == 0:\r\n\tprint(0)\r\nelif n <= m/2 : \r\n\tprint(n)\r\nelif n <= 2*m:\r\n\tprint(int((n+m)/3))\r\nelse:\r\n\tprint(m)\r\n", "import math\r\n\r\ndef main_function():\r\n n, m = [int(u) for u in input().split(\" \")]\r\n counter = 0\r\n while True:\r\n if not (n > 0 and m > 0 and max(n, m) > 1):\r\n break\r\n if n > m:\r\n n -= 2\r\n m -= 1\r\n else:\r\n n -= 1\r\n m -= 2\r\n counter += 1\r\n print(counter)\r\n\r\nif __name__ == '__main__':\r\n main_function()\r\n", "#\r\n#####################################################################################################################\r\n\r\ndef nTeamsMax(nExperienced, nNewbies):\r\n return min(nExperienced, nNewbies, int((nNewbies+nExperienced)/3))\r\n\r\n\r\nprint(nTeamsMax(*map(int, input().split(' '))))\r\n", "import math\r\n#n=int(input())\r\nn,m = map(int, input().strip().split(' '))\r\n#lst = list(map(int, input().strip().split(' ')))\r\nif n<m and m>=2*n:\r\n print(n)\r\nelif n>m and n>=2*m:\r\n print(m)\r\nelse:\r\n print(math.floor((n+m)/3))\r\n", "n, m = map(int, input().split())\r\nprint(min(n,m,(n+m)//3))", "a, b = map(int,input().split())\nresult = 0\nwhile(a>=2 or b>=2):\n if(a<=0 or b<=0):\n break\n if(a>b):\n a-=2\n b-=1\n else:\n b-=2\n a-=1\n result+=1\nprint(result)", "\r\n\"\"\"\r\nTODO:\r\n [DONE] https://codeforces.com/problemset/problem/1466/C\r\n [DONE] https://codeforces.com/problemset/problem/1371/C\r\n https://codeforces.com/problemset/problem/519/C\r\n https://codeforces.com/problemset/problem/1401/C\r\n\"\"\"\r\n\r\ndef q_519():\r\n n, m = map(int, input().split())\r\n # n, m = 500000, 500000\r\n teamnum = 0\r\n while (n>=1 and m>=2) or (m>=1 and n>=2):\r\n teamnum += 1\r\n if n>m:\r\n n -= 2\r\n m -=1\r\n else:\r\n n -= 1\r\n m -= 2\r\n print(teamnum)\r\n\r\nq_519()\r\n\r\n\r\ndef q_1371():\r\n def solve(a, b, n, m):\r\n return {True: \"YES\", False:\"NO\"}[m <= min(a, b) and n + m <= a + b]\r\n t = int(input())\r\n for test in range(t):\r\n print(solve(*map(int, input().split())))\r\n\r\n\r\ndef q_1466():\r\n def solve(s):\r\n if len(s) <= 1: return 0\r\n changed = set()\r\n for i in range(len(s) - 2):\r\n if i in changed: continue\r\n if s[i] == s[i + 1]: changed.add(i + 1)\r\n if s[i] == s[i + 2]: changed.add(i + 2)\r\n if s[-1] == s[-2] and len(s) - 2 not in changed: changed.add(len(s) - 1)\r\n return len(changed)\r\n t = int(input())\r\n for test in range(t): print(solve(input()))\r\n", "e,n=map(int, input().split())\r\nk=e\r\n#e----exp\r\n#n---newbie\r\nc=0\r\nwhile True:\r\n if e==0 or n==0: break\r\n elif e==1 and n==1: break\r\n else:\r\n if e!=1 and e>n:\r\n c+=1\r\n e=e-2\r\n n=n-1\r\n #elif e!=1 and e<n:\r\n else:\r\n c+=1\r\n e=e-1\r\n n=n-2\r\nprint(c)\r\n\r\n\r\n\r\n", "#\r\n#####################################################################################################################\r\n\r\nfrom math import floor\r\n\r\n\r\ndef nTeamsMax(nExperienced, nNewbies):\r\n if nExperienced > nNewbies:\r\n return nNewbies if nExperienced >= nNewbies + nNewbies else floor((nNewbies+nExperienced)/3)\r\n return nExperienced if nNewbies >= nExperienced + nExperienced else floor((nNewbies+nExperienced)/3)\r\n\r\n\r\nprint(nTeamsMax(*map(int, input().split(' '))))\r\n", "n,m=map(int,input().split())\r\nprint(min(n,m,(n+m)//3))", "n, m = [int(i) for i in input().split()]\r\nn, m = max(n, m), min(n, m)\r\n\r\nif n <= m * 2:\r\n f = n - m\r\n c = f\r\n n = m - f\r\n print(2 * n // 3 + f)\r\nelse:\r\n print(m)", "import collections\nimport math\nimport copy\ndef main():\n #n = int(input())\n n,m = list(map(int,input().split()))\n #m = int(input())\n #a = list(map(int,input().split()))\n #b = list(map(int,input().split()))\n #a = list(map(int,input().split()))\n solution(n,m) \n\ndef solution(n,m):\n if n>m:\n n,m = m,n\n if n*2<=m:\n print(n)\n else:\n x = m-n\n y = n-x\n print(x+y*2//3)\n\n \n \n\n \n\n\n \n \n\n \n \n\n\nmain()", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nif 2*n <= m:\r\n print(n)\r\nelif n >= 2*m:\r\n print(m)\r\nelse:\r\n print((n+m)//3)", "a,b=map(int,input().split())\r\nprint(min(min(a,b),(a+b)//3))", "n,m=map(int,input().split()) ; print(min((n+m)//3,min(n,m)))\r\n", "a,b = map(int,input().split())\r\nt=0\r\nwhile (a > 0 and b > 0):\r\n if (a == 1 and b == 1):\r\n break\r\n if (b<a):\r\n a -= 2\r\n b -= 1\r\n else:\r\n a -= 1\r\n b -= 2\r\n t+=1\r\nprint(t)", "n,m = map(int, input().split())\r\nt = (n+m) // 3\r\nif t > m:\r\n print(m)\r\nelif t > n:\r\n print(n)\r\nelse:\r\n print(t)", "x, y = map(int, input().split())\r\nprint(min(min(x, y), (x + y) // 3))", "n,m=map(int,input().split())\r\nans=0\r\nwhile (m>=2 and n>=1)or (m>=1 and n>=2) :\r\n ans+=1\r\n if(m>n):\r\n m-=2\r\n n-=1\r\n else:\r\n m-=1\r\n n-=2\r\nprint(ans)\r\n ", "\r\nexp,new=list(map(int,input().split()))\r\n\r\ncount=0\r\nwhile exp!=0 and new!=0:\r\n if exp>=new and exp>=2 and new>=1:\r\n exp=exp-2\r\n new=new-1\r\n count=count+1\r\n elif new>=2 and exp>=1:\r\n exp=exp-1\r\n new=new-2\r\n count=count+1\r\n else:\r\n break\r\nprint(count)", "a,b=map(int,input().split())\r\na,b=min(a,b),max(a,b)\r\nif b>=2*a:\r\n print(a)\r\nelse:\r\n s=2*a-b\r\n if s%3==2:\r\n print(b-a+s//3*2+1)\r\n else:\r\n print(b-a+s//3*2)", "m,n=map(int,input().split())\r\nprint(min(m,n,(m+n)//3))", "# cook your dish here\r\nimport sys\r\ninput = sys.stdin.readline\r\nt=1\r\nfor _ in range(t):\r\n n,m=map(int,input().split())\r\n print(min(n,m,(n+m)//3))\r\n", "n, m = map(int, input().split())\n\nif max(n, m) <= 1:\n print(0)\n\nelif max(n, m) > 2*min(n, m):\n print(min(n, m))\n\nelse:\n print((n+m)//3)", "x,y=map(int,input().split())\r\np=0\r\nwhile True:\r\n\tm=min(x,y)\r\n\tif m==x:\r\n\t\tx-=1\r\n\t\ty-=2\r\n\telse:\r\n\t\tx-=2\r\n\t\ty-=1\r\n\tif x<0 or y<0:\r\n\t\tbreak\r\n\telse:\r\n\t\tp+=1\r\nprint(p)", "n, m = map(int, input().split())\r\n\r\nans = 0\r\nwhile n > 0 and m > 0:\r\n if n > m:\r\n m -= 1\r\n n -= 2\r\n ans += 1\r\n\r\n elif n == 1 and m == 1:\r\n break\r\n\r\n else:\r\n n -= 1\r\n m -= 2\r\n ans += 1\r\n\r\nprint(ans)", "a,b = map(int,input().split())\r\nc=0\r\nwhile(a!=0 and b!=0):\r\n if(a==1 and b==1):\r\n break\r\n if(a>b):\r\n a-=2\r\n b-=1\r\n c+=1\r\n else:\r\n a-=1\r\n b-=2\r\n c+=1\r\nprint(c)", "n,m=map(int,input().split())\r\nc=(n+m)//3\r\na=min(n,m)\r\nprint(min(c,a))", "import math\r\nfrom sys import stdin, stdout\r\nimport collections\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, m = multi_input()\r\n ans = 0\r\n for i in range(n+1):\r\n m2 = m - 2*i\r\n if m2 >= 0:\r\n ans = max(ans, i+min((n-i)//2, m2))\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "#!/usr/bin/env python3\n\n(n, a, b, c, d) = input().split()\nn = int(n)\na = int(a)\nb = int(b)\nc = int(c)\nd = int(d)\n\ndiff2 = b - c\ndiff4 = a - d\ndiff5 = a + b - c - d\n(lower, _, upper) = sorted((diff2, diff4, diff5))\n\nlower_bound = 1 - min(0, lower)\nupper_bound = n - max(0, upper)\n\nif lower_bound > upper_bound:\n print(0)\nelse:\n print((upper_bound - lower_bound + 1) * n)\n\n \t\t\t \t\t\t\t \t\t \t \t\t \t\t\t", "#Codeforces: Restoring Painting\r\n\r\nn,a,b,c,d=[eval(x) for x in input().split()]\r\n\r\nif(a<d):\r\n ab=c+(d-a)\r\nelse:\r\n ab=c\r\naa=ab+a+b\r\n\r\nac=aa-(a+c)\r\nbd=aa-(b+d)\r\ncd=aa-(c+d)\r\n\r\nmini=min(ab,ac,bd,cd)\r\nmaxi=max(ab,ac,bd,cd)\r\n\r\ndiff=maxi-mini\r\n\r\nt=n-(1+diff)+1\r\nif(t<=0):\r\n print(0)\r\nelse:\r\n print(t*n)\r\n", "n,a,b,c,d=map(int,input().split())\r\nM=0\r\nfor E in range(1,n+1):\r\n\tF=E+b-c\r\n\tH=E+a-d\r\n\tK=E+a+b-c-d\r\n\tif 0<F<=n and 0<H<=n and 0<K<=n:M+=n\r\nprint(M)", "n,a,b,c,d = map(int,input().split())\r\n\r\nans=0\r\nfor i in range(1,n+1):\r\n maxx=max(a+b+i+1,max(a+c+i+1,max(c+d+i+1,b+d+i+1)))\r\n e=maxx-(a+b+i)\r\n f=maxx-(a+c+i)\r\n g=maxx-(c+d+i)\r\n h=maxx-(b+d+i)\r\n x=max(e,max(f,max(g,h)))\r\n ans+=n+1-x\r\nprint(ans if ans>=0 else 0)\r\n", "def verif(val1,val2,val3,n):\r\n return 1<=val1<=n and 1<=val2<=n and 1<=val3<=n\r\n\r\nres=0\r\nn,a,b,c,d=map(int,input().split())\r\nfor x in range(1,n+1):\r\n y=x+b-c\r\n z=x+a-d\r\n w=a+y-d\r\n if verif(y,z,w,n):\r\n res+=1\r\nprint(res*n)\r\n\r\n", "n,a,b,c,d=map(int,input().split())\r\ns=[a+b,b+d,a+c,c+d]\r\nprint(n*max(0,n-max(s)+min(s)))", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[n, a, b, c, d] = list(map(int, input().split()))\r\nres = 0\r\nfor p in range(1, n+1):\r\n q = p+b-c\r\n if q <= 0 or q > n:\r\n continue\r\n s = p+a-d\r\n if s <= 0 or s > n:\r\n continue\r\n t = a+q-d\r\n if t <= 0 or t > n:\r\n continue\r\n res = res+n\r\nprint(res)\r\n", "#inpdata = open(\"in.txt\", \"r\").read().__str__().split()\r\n\r\ninpdata = input().split()\r\n\r\nn = int(inpdata[0])\r\na = int(inpdata[1])\r\nb = int(inpdata[2])\r\nc = int(inpdata[3])\r\nd = int(inpdata[4])\r\nans = 0\r\n\r\nfor x in range(1, n + 1):\r\n y = x + b -c\r\n z = x + a - d\r\n w = a + y - d\r\n if 1 <= y and y <= n and 1 <= z and z <= n and 1 <= w and w <= n:\r\n ans += 1\r\n\r\nans = ans * n\r\n\r\nprint(ans)\r\n", "n,a,b,c,d = map(int,input().split())\r\nans = 0\r\nfor i in range(1,n+1):\r\n p = i+b-c\r\n q = i+a+b-c-d\r\n r = i+a-d\r\n if 1<=p<=n and 1<=q<=n and 1<=r<=n:\r\n ans+=1\r\nprint(ans*n)", "n, a, b, c, d = map(int, input().split())\r\nret = 0\r\nfor x in range(1, n + 1):\r\n y = x + b - c\r\n z = x + a - d\r\n w = a + y - d\r\n ret += (1 <= y <= n and 1 <= z <= n and 1 <= w <= n)\r\nprint(ret * n)\r\n", "n,a,b,c,d=map(int,input().split()) \r\nm1=a+b\r\nm2=a+c\r\nm3=c+d\r\nm4=b+d\r\nmn=min(m1,m2,m3,m4)\r\nmx=max(m1,m2,m4,m3)\r\nprint(max(0,n*(n-(mx-mn))))", "n,a,b,c,d=map(int,input().split())\r\ncount=0\r\nfor x in range(1,n+1):\r\n y=x+b-c\r\n z=x+a-d\r\n w=y+a-d\r\n if (y>=1 and y<=n) and(z>=1 and z<=n) and (w>=1 and w<=n):\r\n count+=1\r\nprint(count*n)\r\n \r\n", "n, a, b, c, d = map(int, input().split())\n\n\"\"\"\nxay\nbmc\nwdz\n\"\"\"\n\nans = 0\nfor x in range(1, n + 1):\n y = x + b - c\n z = y + a - d\n w = z + c - b\n #print(x, y, z, w)\n if 1 <= y <= n and 1 <= z <= n and 1 <= w <= n:\n ans += 1\n\nprint(ans * n)\n", "def valid(x,n):\r\n if x>0 and x<=n:\r\n return True\r\n return False\r\n\r\ninf=list(map(int,input().split()))\r\nn=inf[0]\r\na=inf[1]\r\nb=inf[2]\r\nc=inf[3]\r\nd=inf[4]\r\nans=0\r\nfor i in range(1,n+1):\r\n p=i\r\n q=p+a-d\r\n s=p+b-c\r\n r=p+b+a-d-c\r\n if valid(q,n) and valid(s,n) and valid(r,n):\r\n ans+=1\r\nprint(ans*n)\r\n", "#675B\n\ninpt = list(map(int, input().split(\" \")))\n\nn = inpt[0]\na = inpt[1]\nb = inpt[2]\nc = inpt[3]\nd = inpt[4]\n\n# w + b = x + c\n# x + a = y + d\n# y + c = z + b\n# z + d = w + a\n\n# x - w = y - z = b - c\n# y - x = z - w = a - d\n\n# x + z = w + y\n\ncount = 0\n\nfor i in range(n):\n\tw = i + 1\n\tx = b - c + w\n\tz = a - d + w\n\ty = a - d + x\n\tif 1 <= x <= n and 1 <= z <= n and 1 <= y <= n:\n\t\tcount += 1\n\nprint(count * n)", "n,a,b,c,d=map(int,input().split(\" \"))\ncount=0\nfor x in range(1,n+1):\n if (b-c+x)>=1 and (b-c+x)<=n and x+a+b-c-d>=1 and x+a+b-c-d<=n and x+a-d>=1 and x+a-d<=n:\n count+=1\n \nprint (count*n)\n \n\t\t \t \t\t \t \t \t \t \t \t \t", "n, a, b, c, d = map(int, input().split())\r\ncounter = 0\r\n\r\nfor y in range(1, n+1):\r\n k = y+b-c\r\n w = y+a-d\r\n f = y+a+b-c-d\r\n if k > n or k < 1 or w > n or w < 1 or f > n or f < 1:\r\n continue\r\n else:\r\n counter += 1\r\nprint(counter*n)\r\n \r\n", "n, a, b, c, d = map(int, input().split())\r\n\r\nm = [0, b - c, a - d, a + b - c - d]\r\ncount = (max([0, n - max(m)]) - min([n, -min(m)]))\r\nif count <= 0:\r\n print(0)\r\nelse:\r\n print(n * count)", "n, a, b, c, d = map(int, input().split())\nres = 0\nfor i in range(1, n + 1): \n tl = i\n tr = tl - c + b\n br = tr - d + a\n bl = br - b + c\n #print(tl, tr, br, bl)\n if min(tl, tr, br, bl) >= 1 and max(tl, tr, br, bl) <= n:\n res += n\n\nprint(res)\n", "n, a, b, c, d = map(int, input().split())\r\nr = range(1, n + 1)\r\nprint(n * sum(i + b - c in r and i + a - d in r and i + a + b - c - d in r for i in r))", "(n, a, b, c, d) = (int(_) for _ in input().split())\nprint(max((n - abs(a-d) - abs(b-c)), 0) * n)\n", "def main():\r\n n, a, b, c, d = map(int, input().split())\r\n ans = 0\r\n for i in range(1, n + 1):\r\n x = i + a - d\r\n y = i + b - c\r\n z = y + a - d\r\n if 1 <= x <= n and 1 <= y <= n and 1 <= z <= n:\r\n ans += n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, a, b, c, d = map(int, input().split())\r\nans = (n - abs(b - c) - abs(d - a))\r\nprint(max(0, n * ans))", "n,a,b,c,d=map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n\tp1=i\r\n\tsm=a+b+i\r\n\tp2=sm-a-c\r\n\tp3=sm-d-c\r\n\tp4=sm-b-d\r\n\tif p1>=1 and p1<=n and p2>=1 and p2<=n and p3>=1 and p3<=n and p4>=1 and p4<=n:\r\n\t\tans=ans+1\r\nprint(ans*n)\r\n", "n, a, b, c, d = map(int, input().split())\r\np = [a + b, a + c, c + d, b + d]\r\nt = min(p) - max(p) + n\r\nprint(t * n if t > 0 else 0)\r\n\r\n", "import math\nn,a,b,c,d = input().split()\nn=int(n)\na=int(a)\nb = int(b)\nc=int(c)\nd=int(d)\nsum =0\ng = 0\nfor x in range(1,n+1):\n\ty = x + b -c\n\tz = x + a - d \n\tw = z + b -c\n\tif((1<=y<=n)):\n\t\tif((1<=z<=n)):\n\t\t\tif(1<=w<=n):\n\n\t\t\t\tsum += 1\ng = n * sum\nprint (g)", "from collections import *\r\nn,a,b,c,d = list(map(int,input().split()))\r\nprint((n-min(n,max(abs(a+b-c-d),abs(b-c),abs(a-d),abs(a+c-b-d))))*n)\r\n", "n, a, b, c, d = map(int,input().split())\r\nres = 0\r\n\r\nfor i in range(1, n + 1):\r\n r = 4 * n\r\n l = 1\r\n r = min(r, n + (i + a + b))\r\n r = min(r, n + (i + a + c))\r\n r = min(r, n + (i + c + d))\r\n r = min(r, n + (i + d + b))\r\n\r\n l = max(l, a + b + i + 1)\r\n l = max(l, a + c + i + 1)\r\n l = max(l, c + d + i + 1)\r\n l = max(l, b + d + i + 1)\r\n \r\n if l <= r:\r\n res += r - l + 1\r\nprint(res)", "read = lambda: map(int, input().split())\r\nn, a, b, c, d = read()\r\ncnt = 0\r\nfor i in range(1, n + 1):\r\n x = i + (b - c)\r\n y = i + (a + b - c - d)\r\n z = i + (a - d)\r\n p = sorted((x, y, z))\r\n if 1 <= p[0] and p[2] <= n:\r\n cnt += 1\r\nans = cnt * n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b, c, d = map(int, input().split())\r\n\r\nx = abs(a-d)\r\ny = abs(b-c)\r\nif x == y == 0:\r\n print(n*n)\r\nelif x == 0:\r\n print(n * max(0, n - y))\r\nelif y == 0:\r\n print(n * max(0, n - x))\r\nelse:\r\n print(n * max(0, n-x-y))\r\n", "n,a,b,c,d= [int(x) for x in input().split()]\r\nl=[a+b,a+c,b+d,c+d]\r\nprint (n*max(0,(n-max(l)+min(l))))", "l = input()\r\nl = l.split(\" \")\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\nn = l[0]\r\na = l[1]\r\nb = l[2]\r\nc = l[3]\r\nd = l[4]\r\n\r\nctr = 0\r\nfor e in range(1, n+1):\r\n f = e + b - c\r\n h = a + e - d\r\n i = a + f - d\r\n\r\n cond = (c + d + i) == (a + b + e)\r\n cond = cond and (f >= 1 and f <= n)\r\n cond = cond and (h >= 1 and h <= n)\r\n cond = cond and (i >= 1 and i <= n)\r\n if (cond): ctr += n\r\nprint(ctr)\r\n\r\n", "# https://codeforces.com/group/DZu803AAws/contest/436683/problem/B\n\nn, a, b, c, d = map(int, input().split())\n\nx, y, m, z, w = 0, 0, 0, 0, 0\n\ncount = 0\nfor x in range(1, n + 1):\n y = x + b - c\n z = x + a - d\n w = a + y - d\n if y > 0 and z > 0 and w > 0 and y <= n and z <= n and w <= n:\n count += 1\nans = count * n\nprint(ans)\n", "n, a, b, c, d = map(int,input().split())\r\narr = [a + b, a + c, b + d, c + d]\r\ncount = n * (n - max(arr) + min(arr))\r\nprint(max(0, count))", "from re import *\nfrom sys import stderr\ndef readint():\n return int(input())\ndef readfloat():\n return float(input())\ndef readarray(N, foo=input):\n return [foo() for i in range(N)]\ndef readlinearray(foo=int):\n return map(foo, input().split())\n\ndef NOD(a, b):\n while b:\n a,b = b, a%b\n return a\n\ndef gen_primes(max):\n primes = [1]*(max+1)\n for i in range(2, max+1):\n if primes[i]:\n for j in range(i+i, max+1, i):\n primes[j] = 0\n primes[0] = 0\n return [x for x in range(max+1) if primes[x]]\n\ndef is_prime(N):\n i = 3\n if not(N % 2):\n return 0\n while i*i < N:\n if not(N % i):\n return 0\n i += 3\n return 1\n\nn, a, b, c, d = readlinearray()\n\nmaxx = min(n, n - b + c, n - a + d, n - a + c - b + d)\nminx = max(1, 1 - b + c, 1 - a + d, 1 - a + c - b + d)\n\nif maxx < minx:\n print(0)\nelse:\n print((maxx - minx + 1) * n)\n", "n,a,b,c,d=map(int,input().split())\nans=0\nfor w in range(1,n+1):\n\tx=w+b-c\n\ty=w+a-d\n\tz=x+a-d\n\tif(x>=1 and x<=n and y>=1 and y<=n and z>=1 and z<=n):\n\t\tans+=1\nprint(ans*n)\n", "z=input().split()\r\nn=int(z[0])\r\na=int(z[1])\r\nb=int(z[2])\r\nc=int(z[3])\r\nd=int(z[4])\r\ns_11=1\r\ntotal=0\r\nwhile s_11<=n:\r\n s_31=s_11+b-c\r\n s_13=s_11+a-d\r\n s_33=s_11+a+b-c-d\r\n if 1<=s_31<=n and 1<=s_13<=n and 1<=s_33<=n:\r\n total+=1\r\n s_11+=1\r\nx=n*total\r\nprint(x)\r\n", "n,a,b,c,d=map(int,input().split())\r\nsum = [a+b,a+c,b+d,c+d]\r\nprint(n*max(0,n-max(sum)+min(sum)))", "class CodeforcesTask675BSolution:\n def __init__(self):\n self.result = ''\n self.n_a_b_c_d = []\n\n def read_input(self):\n self.n_a_b_c_d = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n result = 0\n for x in range(1, self.n_a_b_c_d[0] + 1):\n y = self.n_a_b_c_d[2] - self.n_a_b_c_d[3] + x\n w = self.n_a_b_c_d[1] - self.n_a_b_c_d[4] + x\n q = self.n_a_b_c_d[2] - self.n_a_b_c_d[3] + w\n if 1 <= y <= self.n_a_b_c_d[0] and 1 <= w <= self.n_a_b_c_d[0] and 1 <= q <= self.n_a_b_c_d[0]:\n result += 1\n #print(x, y, w, q)\n self.result = str(result * (self.n_a_b_c_d[0]))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask675BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", " ### @author egaeus \r\n ### @mail [email protected] \r\n ### @veredict \r\n ### @url https://codeforces.com/problemset/problem/675/B\r\n ### @category \r\n ### @date 14/11/2019\r\n\r\nline = input().split()\r\nN = int(line[0])\r\nA = int(line[1])\r\nB = int(line[2])\r\nC = int(line[3])\r\nD = int(line[4])\r\n\r\nAB = A + B\r\nAC = A + C\r\nBD = B + D\r\nCD = C + D\r\n\r\ns = 0\r\n\r\nfor i in range(1, N+1):\r\n m = AB + i\r\n m = min(m, AC+i)\r\n m = min(m, BD+i)\r\n m = min(m, CD+i)\r\n\r\n M = AB + i\r\n M = max(M, AC+i)\r\n M = max(M, BD+i)\r\n M = max(M, CD+i)\r\n \r\n s += max(0, m+N-M)\r\n\r\nprint(s)", "'''\r\nCreated on May 25, 2016\r\n\r\n@author: Md. Rezwanul Haque\r\n'''\r\n\r\nn,a,b,c,d = [int(x) for x in input().split()]\r\nrezwan = 0\r\nfor x in range(1,n+1):\r\n if 1<=(a+b+x-c-d)<=n and 1<=(b+x-c)<=n and 1<=(a+x-d)<=n:\r\n rezwan+=1\r\nprint(rezwan*n) ", "n,a,b,c,d=map(int,input().split())\r\nx=1\r\ny=x+b-c\r\nw=x+a-d\r\nz=y+a-d\r\nmi=1-min(x,y,w,z)\r\nx+=mi\r\ny+=mi\r\nw+=mi\r\nz+=mi\r\nprint((n-max(x,y,w,z)+1)*n*(n>=max(x,y,w,z)))", "n, a, b, c, d = list(map(int, input().split()))\r\n\r\ntotal = 0\r\nfor i in range(1, n+1):\r\n s = (a+b+i, a+c+i, b+d+i, c+d+i)\r\n max_number = max(s) - min(s)\r\n if max_number <= n:\r\n total += n - max_number\r\n \r\nprint(total)", "def is_ok(n, a, b, c, d, e):\r\n return (a + e - d in range(1, n + 1)) and (b + e - c in range(1, n + 1)) and (a + b + e - c -d in range(1, n + 1))\r\nn, a, b, c, d = input().split();\r\nn = int(n);\r\na = int(a);\r\nb = int(b);\r\nc = int(c);\r\nd = int(d);\r\nnum = 0;\r\nfor i in range(1,n+1):\r\n if(is_ok(n, a, b, c, d, i) == True):\r\n #print(i);\r\n num = num + 1;\r\nprint(num * n);\r\n", "(n, a, b, c, d) = (int(_) for _ in input().split())\nct = 0\nfor w in range(1, n+1):\n x = w + b - c\n y = w + a - d\n if (1 <= x <= n) and (1 <= y <= n):\n z = y + b - c\n if (1 <= z <= n) and (z == x + a - d):\n ct += 1\nprint(ct * n)\n", "n, a, b, c, d = map(int, input().split())\r\nans = n * (n - abs(a - d) - abs(b - c))\r\nprint(max(0, ans))\r\n", "l= list(map(int, input().split()))\r\nn=l[0]\r\na=l[1]\r\nb=l[2]\r\nc=l[3]\r\nd=l[4]\r\nk=0\r\nfor i in range(n):\r\n x=i+1\r\n c2=x+b-c\r\n c3=x+a-d\r\n c4=x+a+b-c-d\r\n if(c2>0 and c3>0 and c4>0):\r\n if(c2<n+1 and c3<n+1 and c4<n+1):\r\n k+=1\r\nprint(n*k) ", "n, a, b, c, d = map(int, input().split())\n\nk = 0\nfor u in range(1, n + 1):\n\tv = u + b - c\n\tif (v >= 1) and (v <= n):\n\t\tz = a + v - d\n\t\tif (z >= 1) and (z <= n):\n\t\t\ty = c + z - b\n\t\t\tif (y >= 1) and (y <= n):\n\t\t\t\tu = d + y - a\n\t\t\t\tif (y >= 1) and (y <= n):\n\t\t\t\t\tk += 1\n\nprint(k * n)\n", "n, a, b, c, d = map(int, input().split())\r\narr = sorted([a + b, b + d, c + d, a + c])\r\nprint(n * (max(n - (arr[-1] - arr[0]), 0)))\r\n", "n,a,b,c,d=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,n+1):\r\n if 1<=(i+b-c)<=n and 1<=(i+a-d)<=n and 1<=(i+a-d+b-c)<=n:\r\n count+=1\r\nprint(count*n)", "n, a, b, c, d = map(int, input().split())\r\nans= 0\r\nfor x in range(1, n + 1):\r\n g = [a + b + x, a + c + x, b + d + x, c + d + x]\r\n mi = min(g)\r\n mx = max(g)\r\n dif = mx - mi\r\n ans += max(n-dif, 0)\r\nprint(ans)\r\n\r\n ", "import sys\r\ninpu = sys.stdin.buffer.readline\r\nprin = sys.stdout.write\r\nn, a, b, c, d = map(int, inpu().split())\r\nstart = max(a + b, a + c, b + d, c + d) + 1 - min(a + b, a + c, b + d, c + d)\r\nans = 0\r\nfor i in range(1, n + 1) :\r\n ans += max(n - start + 1, 0)\r\nprin(str(ans) + '\\n')", "import sys\nimport math\nfrom collections import defaultdict\nimport itertools\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\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(str(ans) + \"\\n\")\n\n\ndef solve(n,a,b,c,d):\n\n maxCorner = max(a+b, a+c, c+d, b+d)\n minCorner= min(a+b, a+c, c+d, b+d)\n diff = maxCorner - minCorner\n\n if n *(n-diff)>= 0:\n return n*(n-diff)\n return 0\n\n\n\n\ndef readinput():\n n,a,b,c,d = getInts()\n printOutput(solve(n,a,b,c,d))\n\nreadinput()\n", "l=list(map(int,input().split()))\r\nn=l[0]\r\nnew=[]\r\narr=[]\r\nfor i in range (0,3):\r\n for j in range (0,3):\r\n new.append(0)\r\n arr.append(new)\r\n new = []\r\narr[0][1]=l[1]\r\narr[1][0]=l[2]\r\narr[1][2]=l[3]\r\narr[2][1]=l[4]\r\ncount=0\r\nfor i in range(n):\r\n sum1=arr[0][1]+arr[1][0]+(i+1);\r\n sum2=arr[0][1]+arr[1][2];\r\n sum3=arr[1][0]+arr[2][1];\r\n sum4=arr[1][2]+arr[2][1];\r\n if((sum1-sum2<=n and sum1-sum2>0) and (sum1-sum3<=n and sum1-sum3>0) and (sum1-sum4<=n and sum1-sum4>0)):\r\n count+=1\r\nprint(count*n);", "n,a,b,c,d=map(int,input().split())\r\nk=0\r\nfor i in range(1, n + 1):\r\n if 1<=i+b-c<=n and 1<=i+a-d<=n and 1<=i+a+b-c-d<=n:k+=n\r\nprint(k)", "def main(n,a,b,c,d):\r\n \r\n \r\n s=[a+b,b+d,d+c,c+a]\r\n s.sort() \r\n a,b,c,d=s \r\n ans=n*max(0,n+a-d)\r\n \r\n \r\n \r\n return ans\r\n\r\nn,a,b,c,d=list(map(int,input().split()))\r\nprint(main(n,a,b,c,d))", "n,a,b,c,d = map(int,(input().split()))\r\n\r\nans=0\r\n\r\nfor i in range(1,n+1) :\r\n j = i+b-c\r\n k = a+j-d\r\n l = c+k-b\r\n if 1<=j and j<=n and 1<=k and k<=n and 1<=l and l<=n :\r\n ans = ans+1\r\n \r\nprint(ans*n)", "\r\n\r\nn,a,b,c,d=map(int,input().split())\r\ncount=0\r\nfor x in range(1,n+1):\r\n x2=x+b-c\r\n x4=x+a-d\r\n x5=x+a+b-c-d\r\n if n>=x2>=1 and n>=x4>=1 and n>=x5>=1:\r\n count+=1\r\n\r\nprint(count*n)", "n, a, b, c, d = map(int, input().split())\r\nd1, d2, d3, d4 = a+b, a+c , c+d, b+d\r\nm1, m2 = max(d1, d2, d3, d4), min(d1, d2, d3, d4)\r\n\r\nif m1-m2 >=n:\r\n s=0\r\nelse:\r\n s=(n-(m1-m2))*n\r\nprint(s)\r\n", "Input = list(map(int,input().split()))\r\nn, a, b, c, d = Input[0], Input[1], Input[2], Input[3], Input[4]\r\nAmin, Amax = max(1 - b + c, 1 - a - b + c + d, 1 - a + d, 1), min(n - b + c, n - a - b + c + d, n - a + d, n)\r\nif Amin > Amax:\r\n print(0)\r\n exit()\r\nprint((Amax - Amin + 1) * n)", "n, a, b, c, d = map(int, input().split())\r\nmn = min(a+b,b+d,c+d,c+a)\r\nmx = max(a+b,b+d,c+d,c+a)\r\nres = (n - mx + mn) * n\r\nprint(max(res,0))\r\n", "__author__ = 'zihaozhu'\nfrom sys import stdin\nn,a,b,c,d = map(int,stdin.readline().split())\n\nanswer=0\nfor x in range (1,n+1):\n y= x + b - c\n z= x+a-d\n w= z+ b -c\n if(1<=y and y<= n and 1<=z and z<=n and 1<=w and w<=n):\n answer+=1\n\nanswer*=n\nprint(answer)", "n, a, b, c, d = input().split()\r\nn = int(n)\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\n\r\nans = [1, b - c + 1, a - d + 1, a + b - c - d + 1]\r\nans.sort()\r\nlength = ans[3] - ans[0] + 1\r\nif length > n:\r\n print(0)\r\nelse:\r\n print(n * (n - length + 1))", "n, a, b, c, d = map(int, input().split())\n\nres = 0\n\nfor x in range(1, n + 1):\n # x + b + a + m = y + c + a + m\n\n y = x + b - c\n z = x + a - d\n w = z + b - c\n\n if 1 <= y <= n and 1 <= z <= n and 1 <= w <= n:\n res += 1\n\nprint(res * n)\n", "n,a,b,c,d= map(int,input().split())\r\narr = [a+b,a+c,b+d,c+d]\r\ncount = n*(n-max(arr)+min(arr))\r\nprint(max(0,count))", "a=list(map(int, input().split()))\r\nN=a[0]\r\nb=a[2]\r\nc=a[3]\r\nd=a[4]\r\na=a[1]\r\nM=max(a+b, a+c, b+d, c+d)\r\nm=min(a+b, a+c, b+d, c+d)\r\nx=(m+N-M)*N\r\nif x<=0: print(0)\r\nelse: print(x)\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, a, b, c, d = map(int, input().split())\r\nx = 0\r\ny, z = (x + a) - d, (x + b) - c\r\nw = (z + a) - d\r\nu = max(x, y, z, w) - min(x, y, z, w)\r\nans = n * max(n - u, 0)\r\nprint(ans)", "n, a, b, c, d = map(int, input().split())\r\n\r\nm = [0, b - c, a - d, a + b - c - d]\r\ncount = 0\r\nfor j in range(1, n + 1):\r\n x1 = j\r\n x2 = m[1] + x1\r\n x3 = m[2] + x1\r\n x4 = m[3] + x1\r\n if any([n < k or k <= 0 for k in [x1, x2, x3, x4]]):\r\n pass\r\n else:\r\n count += 1\r\nprint(n * count)\r\n", "n,a,b,c,d=map(int,input().split())\r\narr=[a+b,a+c,d+b,d+c]\r\nval=n*(n-(max(arr)-min(arr)))\r\nif val<0:\r\n print(0)\r\n exit()\r\nprint(val)\r\n", "n,a,b,c,d = map(int, input().split())\nsol=0\nfor i in range(1,n+1):\n sol+=max(min(a+b, a+c, b+d, c+d)+i+n-(max(a+b, a+c, b+d, c+d)+i), 0)\nprint(sol)\n", "import sys\r\nfrom math import *\r\nfrom collections import Counter,defaultdict,deque\r\ninput=sys.stdin.readline\r\nmod=10**9+7\r\n\r\n# for _ in range(int(input())):\r\nn,a,b,c,d=map(int,input().split())\r\nans=0\r\nfor x in range(1,n+1):\r\n y=x+b-c\r\n z=x+a-d\r\n w=a+y-d\r\n if 1<=y<=n and 1<=z<=n and 1<=w<=n:\r\n ans+=1\r\nprint(ans*n)\r\n ", "n, a, b, c, d = map(int, input().split())\n\nans = 0\nfor centro in range(1, n+1):\n\tq1 = a + b + centro\n\tq2 = a + c + centro\n\tq3 = b + d + centro\n\tq4 = c + d + centro\n\tv = [q1, q2, q3, q4]\n\tv.sort()\n\tq_min = v[0]\n\tq_max = v[-1]\n\tif q_min + n < q_max + 1:\n\t\tcontinue\n\telif q_min + n == q_max + 1:\n\t\tans += 1\n\telse:\n\t\tans += (q_min + n) - (q_max + 1) + 1\n\nprint(ans)\n", "import sys\nsys.stderr = sys.stdout\n\n\ndef painting(n, a, b, c, d):\n lo = min(a+b, c+d, a+c, b+d)\n hi = max(a+b, c+d, a+c, b+d)\n delta = hi - lo\n return max(n - delta, 0) * n\n\n\ndef main():\n n, a, b, c, d = readinti()\n print(painting(n, a, b, c, d))\n\n##########\n\ndef readint():\n return int(input())\n\n\ndef readinti():\n return map(int, input().split())\n\n\ndef readintt():\n return tuple(readinti())\n\n\ndef readintl():\n return list(readinti())\n\n\ndef readinttl(k):\n return [readintt() for _ in range(k)]\n\n\ndef readintll(k):\n return [readintl() for _ in range(k)]\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.__stderr__)\n\n\nif __name__ == '__main__':\n main()\n", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\nfrom functools import lru_cache\r\n#sys.setrecursionlimit(200000000)\r\nint1 = lambda x: int(x) - 1\r\n#def input(): return sys.stdin.readline().strip()m\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\naj = lambda: list(map(int, input().split()))\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,a,b,c,d = aj()\r\nans = 0\r\nfor p in range(1,n+1):\r\n q = p + b - c\r\n r= p + a + b - c - d\r\n s = p + a - d\r\n if 1 <= q <= n and 1 <= r <= n and 1 <= s <= n:\r\n ans += 1\r\nprint(ans*n)\r\n \r\n \r\n ", "line = input().split()\r\nn = int(line[0])\r\na = int(line[1])\r\nb = int(line[2])\r\nc = int(line[3])\r\nd = int(line[4])\r\nres = 0\r\nfor i in range(1, n+1):\r\n\tSUM = a+b+i\r\n\tif SUM-a-c>0 and SUM-a-c<=n and SUM-d-c>0 and SUM-d-c<=n and SUM-b-d>0 and SUM-b-d<=n:\r\n\t\tres = res+n\r\nprint (res)", "n,a,b,c,d=map(int,input().split()) \r\nans=0\r\nfor l in range(1,n+1):\r\n k=c-b+l \r\n j=d-a+l \r\n i=c-b+j \r\n if i!=d-a+k:\r\n continue\r\n if i>=1 and j>=1 and k>=1 and i<=n and j<=n and k<=n:\r\n ans+=1 \r\n \r\nprint(ans*n)", "n, a, b, c, d = map(int, input().split())\r\n\r\ncount = 0\r\n\r\nfor x in range(1, n + 1):\r\n\tw = x + c - b\r\n\r\n\tif w >= 1 and w <= n:\r\n\t\ty = a + w - d\r\n\t\tif y >= 1 and y <= n:\r\n\t\t\tz = a + x - d\r\n\r\n\t\t\tif z >= 1 and z <= n:\r\n\t\t\t\tcount = count + 1\r\n\r\nprint(count * n)\r\n", "n,a,b,c,d = map(int, input().split())\r\nans = n*(n-abs(a-d)-abs(b-c))\r\nprint(max(0,ans))", "def main():\r\n n, a, b, c, d = tuple([int(i) for i in input().split()])\r\n ans = 0\r\n for i in range(1, n + 1):\r\n t1 = i\r\n t2 = t1 + a + b - a - c\r\n t3 = t1 + a + b - b - d\r\n t4 = t1 + a + b - c - d\r\n if t2 >= 1 and t2 <= n and t3 >= 1 and t3 <= n and t4 >= 1 and t4 <= n:\r\n ans += n\r\n print(ans)\r\n\r\nmain()\r\n", "n,a,b,c,d=map(int,input().split())\r\nct=0\r\nfor i in range(1,n+1):\r\n y = i + b - c;\r\n z = i + a - d;\r\n w = a + y - d;\r\n if (1 <= y and y <= n and 1 <= z and z <= n and 1 <= w and w <= n):\r\n ct+=1;\r\nprint(ct*n)" ]

[ "def f(T):\r\n t1 = min(t, T)\r\n t2 = max(T - t, 0)\r\n u = [v[0] * t1 + w[0] * t2, v[1] * t1 + w[1] * t2]\r\n C = [A[0] + u[0], A[1] + u[1]]\r\n dist = ((C[0] - B[0]) ** 2 + (C[1] - B[1]) ** 2) ** 0.5\r\n dist2 = Vmax * T\r\n return dist2 >= dist\r\n\r\nread = lambda: map(int, input().split())\r\nA, B, v, w = [[0, 0] for i in range(4)]\r\nA[0], A[1], B[0], B[1] = read()\r\nVmax, t = read()\r\nv[0], v[1] = read()\r\nw[0], w[1] = read()\r\nL, R = 0, 1e12\r\nfor i in range(100):\r\n M = (L + R) / 2\r\n if f(M): R = M\r\n else: L = M\r\nans = R\r\nprint(ans)\r\n", "f = lambda: list(map(int, input().split()))\r\n\r\nabs = lambda q: q[0] * q[0] + q[1] * q[1]\r\ndot = lambda: v[0] * d[0] + v[1] * d[1]\r\nget = lambda a, b, c: (b - (b * b - a * c) ** 0.5) / a\r\n\r\np = f()\r\nd = [p[k + 2] - p[k] for k in [0, 1]]\r\nv, t = f()\r\ns = v * v\r\n\r\nv = f()\r\ni = get(abs(v) - s, dot(), abs(d))\r\nd = [d[k] - t * v[k] for k in (0, 1)]\r\n\r\nv = f()\r\nj = get(abs(v) - s, dot() + t * s, abs(d) - t * t * s)\r\n\r\nprint(i if i < t else t + j)", "import math\r\nx1, y1, x2, y2 = map(int, input().split(' ')[:4])\r\nu_max, tau = map(int, input().split(' ')[:2])\r\nvx, vy = map(int, input().split(' ')[:2])\r\nwx, wy = map(int, input().split(' ')[:2])\r\n\r\nA = (x2 - x1, y2 - y1)\r\nv = (-vx, -vy)\r\nw = (-wx, -wy)\r\n\r\nB = (A[0] + tau * v[0], A[1] + tau * v[1])\r\n\r\n\r\ndef solve_sqr_eq(a, b, c):\r\n d = b**2 - 4*a*c\r\n if d >= 0:\r\n return ((-b + math.sqrt(d)) / (2*a), (-b - math.sqrt(d)) / (2*a))\r\n else:\r\n return None\r\n\r\n\r\na = v[0]**2 + v[1]**2 - u_max**2\r\nb = 2 * A[0] * v[0] + 2 * A[1] * v[1]\r\nc = A[0]**2 + A[1]**2\r\nr = solve_sqr_eq(a, b, c)\r\n\r\nif r is not None:\r\n t1, t2 = r\r\n t_min = min(t1, t2)\r\n t_max = max(t1, t2)\r\n if 0 <= t_min <= tau:\r\n print(t_min)\r\n exit(0)\r\n if 0 <= t_max <= tau:\r\n print(t_max)\r\n exit(0)\r\n\r\n\r\na = w[0]**2 + w[1]**2 - u_max**2\r\nb = 2 * B[0] * w[0] + 2 * B[1] * w[1] - u_max**2 * 2 * tau\r\nc = B[0]**2 + B[1]**2 - u_max**2 * tau**2\r\nr = solve_sqr_eq(a, b, c)\r\n\r\nif r is not None:\r\n t1, t2 = r\r\n t_min = min(t1, t2)\r\n t_max = max(t1, t2)\r\n if 0 <= t_min :\r\n print(t_min + tau)\r\n exit(0)\r\n if 0 <= t_max:\r\n print(t_max + tau)\r\n exit(0)\r\n", "x, y, a, b = map(int, input().split())\r\na -= x\r\nb -= y\r\nv, t = map(int, input().split())\r\nvx, vy = map(int, input().split())\r\nux, uy = map(int, input().split())\r\n\r\n\r\ndef ok(T):\r\n U = max(0, T-t)\r\n V = min(t, T)\r\n X = a - U * ux - V * vx\r\n Y = b - U * uy - V * vy\r\n return X*X + Y*Y <= ((U+V)*v)**2\r\n\r\nl = 0\r\nr = 1e9\r\nwhile r-l > 1e-6:\r\n m = (l+r)/2\r\n if ok(m): r = m\r\n else: l = m\r\nprint(r)", "import math\n\nx1, y1, x2, y2 = map(float, input().split()[:4])\nv_max, t = map(float, input().split()[:2])\nvx, vy = map(float, input().split()[:2])\nwx, wy = map(float, input().split()[:2])\n\ndef f(x1, y1, x2, y2, v_max, vx, vy):\n low = 0\n high = math.hypot(x2 - x1, y2 - y1) / (v_max - math.hypot(vx, vy))\n \n while (high - low > 10**-8):\n middle = (low + high) / 2.0\n x = x2 + vx * middle\n y = y2 + vy * middle\n t = math.hypot(x - x1, y - y1) / v_max\n if t > middle:\n low = middle\n else:\n high = middle\n\n return (low + high) / 2.0\n\ntime = f(x1, y1, x2, y2, v_max, -vx, -vy)\n\nif time > t:\n time = f(x1, y1, x2 - vx * t + wx * t, y2 - vy * t + wy * t, v_max, -wx, -wy)\n\nprint(time)\n", "import sys\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef dot(v1, v2):\n return v1[0]*v2[0] + v1[1]*v2[1]\n\n\ndef n2(v):\n return dot(v, v)\n\n\ndef ti(p, q, w, m):\n pq = q[0]-p[0], q[1]-p[1]\n d2 = n2(pq)\n if d2 == 0:\n return 0\n d = d2**0.5\n\n s2 = n2(w)\n if s2 == 0:\n return d / m\n s = s2**0.5\n\n w_pq = dot(w, pq)\n b = w_pq / d\n a2 = s2 - b*b\n c2 = m*m - a2\n return d / (b + c2**0.5)\n\n\ndef best_time(p, q, m, t, v, w):\n t1 = ti(p, q, v, m)\n if t1 <= t:\n return t1\n q2 = q[0] + (w[0] - v[0])*t, q[1] + (w[1] - v[1])*t\n t2 = ti(p, q2, w, m)\n assert t2 >= t\n return t2\n\n\ndef main():\n px, py, qx, qy = map(int, input().split())\n m, t = map(int, input().split())\n vx, vy = map(int, input().split())\n wx, wy = map(int, input().split())\n print(best_time((px, py), (qx, qy), m, t, (vx, vy), (wx, wy)))\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n main()\n b = float(o)\n try:\n a, = map(float, r.getvalue().splitlines())\n except Exception:\n ok = False\n else:\n ok = abs(a-b)/max(1,b) <= 0.0001\n if ok:\n log(\"OK\\n\")\n else:\n log(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n0 0 5 5\n3 2\n-1 -1\n-1 0\n\"\"\", \"\"\"\\\n3.729935587093555327\n\"\"\"), (\"\"\"\\\n0 0 0 1000\n100 1000\n-50 0\n50 0\n\"\"\", \"\"\"\\\n11.547005383792516398\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n", "x1, y1, x2, y2 = map(float, input().split())\nvMax, t = map(float, input().split())\nvx, vy = map(float, input().split())\nwx, wy = map(float, input().split())\n\n\ndef is_pos2(t1, t2):\n\tx1_n = x1+ vx*t1\n\ty1_n = y1+ vy*t1\n\tx2_n = x2- wx*t2\n\ty2_n = y2- wy*t2\n\n\treturn (x1_n-x2_n)**2 + (y1_n-y2_n)**2 <= (vMax * (t1+t2))**2\n\ndef is_pos(tSum):\n\tt1 = min(t, tSum)\n\tt2 = max(0, tSum - t)\n\treturn is_pos2(t1, t2)\n\nif x1 == x2 and y1 == y2:\n\tprint (0)\nelse:\n\tminT = ((x1-x2)**2 + (y1-y2)**2)**0.5 / (vMax * 3)\n\tvabs = (vx ** 2 + vy ** 2)**0.5\n\twabs = (wx ** 2 + wy ** 2)**0.5\n\tmaxT = ((x1-x2)**2 + (y1-y2)**2)**0.5 / (vMax - max(vabs, wabs))\n\n\twhile (maxT - minT)/maxT > 10 ** -7:\n\t\tmedT = (maxT + minT) / 2\n\t\tif is_pos(medT):\n\t\t\tmaxT = medT\n\t\telse:\n\t\t\tminT = medT\n\n\tprint ((minT + maxT) / 2)\n\n\n\n", "#!/usr/bin/env python3\n\nimport sys\n\nfrom math import *\n\ndef direct(d, vmax, wx, wy):\n #print(\"direct: d={}, vmax={}, wx={}, wy={}\".format(d, vmax, wx, wy), file=sys.stderr)\n return d / (sqrt(vmax*vmax - wy*wy) + wx)\n\ndef fly(d, vmax, t, vx, vy, wx, wy, delta):\n sx = t * (vmax * cos(delta) + vx)\n sy = t * (vmax * sin(delta) + vy)\n\n # Normalize\n sx, sy, tx, ty = 0, 0, d - sx, 0 - sy\n alpha = angle_to(sx, sy, tx, ty)\n tx, ty = rotate_point(tx, ty, -alpha)\n wx, wy = rotate_point(wx, wy, -alpha)\n d = tx\n\n result = t + direct(d, vmax, wx, wy)\n #print(\"fly: delta =\", delta, \" result =\", result, file=sys.stderr)\n return result\n \n\ndef rotate_point(x, y, alpha):\n newx = x * cos(alpha) - y * sin(alpha)\n newy = x * sin(alpha) + y * cos(alpha)\n return newx, newy\n\ndef angle_to(sx, sy, tx, ty):\n dx = tx - sx\n dy = ty - sy\n return atan2(dy, dx)\n\ndef angle_minus(alpha, v):\n alpha -= v\n if alpha < 0:\n alpha += 2 * pi\n return alpha\n\ndef angle_plus(alpha, v):\n alpha += v\n if alpha > 2 * pi:\n alpha -= 2 * pi\n return alpha\n\ndef angle_diff(alpha, beta):\n result = alpha - beta\n if result < 0:\n result += 2 * pi\n elif result > 2 * pi:\n result -= 2 * pi\n return result\n\ndef main():\n sx, sy, tx, ty = map(float, input().split())\n vmax, t = map(float, input().split())\n vx, vy = map(float, input().split())\n wx, wy = map(float, input().split())\n\n # Normalize\n sx, sy, tx, ty = 0, 0, tx - sx, ty - sy\n alpha = angle_to(sx, sy, tx, ty)\n tx, ty = rotate_point(tx, ty, -alpha)\n vx, vy = rotate_point(vx, vy, -alpha)\n wx, wy = rotate_point(wx, wy, -alpha)\n d = tx\n\n #print(\"after normalize: s={}, t={}, v={}, w={}\".format((sx, sy), (tx, ty), (vx, vy), (wx, wy)), file=sys.stderr)\n \n tau1 = direct(d, vmax, vx, vy)\n if tau1 <= t:\n print(tau1)\n return\n\n # Seed binary search by finding a lower and an upper angle\n alpha = 0\n while True:\n lower = angle_minus(alpha, 0.1)\n upper = angle_plus(alpha, 0.1)\n\n ta = fly(d, vmax, t, vx, vy, wx, wy, alpha)\n tl = fly(d, vmax, t, vx, vy, wx, wy, lower)\n tu = fly(d, vmax, t, vx, vy, wx, wy, upper)\n\n if tl > ta and tu > ta:\n break\n else:\n alpha = angle_plus(alpha, 0.1)\n\n # Ternary search for the precise angle\n for i in range(100):\n #print(\"search: upper={}, lower={}\".format(upper, lower), file=sys.stderr)\n delta = angle_diff(upper, lower)\n new_low = fly(d, vmax, t, vx, vy, wx, wy, angle_plus(lower, delta / 3))\n new_high = fly(d, vmax, t, vx, vy, wx, wy, angle_plus(lower, 2 * delta / 3))\n if new_low < new_high:\n upper = angle_plus(lower, 2 * delta / 3)\n else:\n lower = angle_plus(lower, delta / 3)\n\n print(fly(d, vmax, t, vx, vy, wx, wy, upper))\n\n\nif __name__ == \"__main__\":\n main()\n" ]

[ "def main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n dpl = [1] * n\r\n dpr = [1] * n\r\n for i in range(1, n):\r\n dpl[i] = min(dpl[i - 1] + 1, a[i])\r\n for i in range(n - 2, -1, -1):\r\n dpr[i] = min(dpr[i + 1] + 1, a[i])\r\n ans = 0\r\n for i in range(n):\r\n ans = max(ans, min(dpl[i], dpr[i]))\r\n print(ans)\r\nmain()", "n=int(input())\na=[0]+[int(i) for i in input().split()]+[0]\nl,r= [0]*(n+2),[0]*(n+2)\nfor i in range(1, n+1):\n l[i]=min(a[i],l[i-1]+1)\nfor i in range(n,0,-1):\n r[i]=min(a[i],r[i+1]+1)\nans = 0\nfor i in range(1,n+1):\n ans=max(ans,min(l[i],r[i]))\nprint(ans)\n \t \t\t\t\t\t \t \t \t \t\t\t\t\t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nres = [0] * n\r\n\r\nfor i in range(n):\r\n res[i] = [0,0,0]\r\n\r\nif n < 3:\r\n print(1)\r\nelse:\r\n res[0][0] = 1\r\n res[-1][0] = 1\r\n for i in range(1, n - 1):\r\n res[i][0] = min(a[i-1] + 1, a[i+1] + 1, a[i])\r\n\r\n cur_min = 0\r\n for i in range(0, n):\r\n res[i][1] = cur_min + 1\r\n cur_min = min(res[i][0], res[i][1])\r\n\r\n cur_min = 0\r\n for i in range(n-1, -1, -1):\r\n res[i][2] = cur_min + 1\r\n cur_min = min(res[i][0], res[i][2])\r\n\r\n\r\n tres = min(res[0])\r\n for k in res:\r\n tres = max(tres, min(k))\r\n\r\n print(tres)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\ndp=[0 for i in range(n)]\r\ndp[0],dp[-1]=1,1\r\n\r\n\r\nfor i in range(1,n-1):\r\n dp[i]=min(i+1,n-i,min(a[i],a[i-1]+1,a[i+1]+1),dp[i-1]+1)\r\nfor i in range(n-2,-1,-1):\r\n dp[i]=min(dp[i],dp[i+1]+1)\r\nprint(max(dp))\r\n", "n = int(input())\r\na = [0] + [int(i) for i in input().split()] + [0]\r\nh = [n] * (n + 2)\r\nh[0] = h[-1] = 0\r\nw = 0\r\nfor i in range(1, n + 1):\r\n w = min(w, a[i] - i)\r\n h[i] = i + w\r\nw = n + 1\r\nfor i in range(n, 0, -1):\r\n w = min(w, a[i] + i)\r\n h[i] = min(h[i], w - i)\r\n \r\nprint(max(h))", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nINF = float('inf')\r\ndp1,dp2=[INF]*N,[INF]*N\r\ndp1[0],dp2[-1]=1,1\r\nfor i in range(1,N):\r\n dp1[i] = min(dp1[i], A[i], dp1[i-1]+1)\r\nfor i in range(N-2,-1,-1):\r\n dp2[i] = min(dp2[i], A[i], dp2[i+1]+1)\r\n\r\nans = 0\r\nfor i in range(N):\r\n ans = max(ans, min(dp1[i],dp2[i]))\r\nprint(ans)\r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nleft=[1]*n\r\nfor i in range(1,n):\r\n left[i]=min(left[i-1]+1,arr[i])\r\nright=[1]*n\r\nfor i in range(n-2,-1,-1):\r\n right[i]=min(right[i+1]+1,arr[i])\r\nans=0\r\nfor i in range(n):\r\n ans=max(ans,min(left[i],right[i]))\r\nprint(ans)", "n=int(input())\r\nx=list(map(int,input().split()))\r\npre,suf,ans=[0]*n,[0]*n,0\r\nfor i in range(n):\r\n if(i==0): pre[i]=1\r\n else: pre[i]=min(pre[i-1]+1,x[i])\r\nfor i in range(n-1,-1,-1):\r\n if i==n-1: suf[i]=1\r\n else: suf[i]=min(suf[i+1]+1,x[i])\r\n ans=max(ans,min(pre[i],suf[i]))\r\nprint(ans)", "\r\nimport sys\r\ntry:\r\n while True:\r\n n = int(input())\r\n height = list(map(int, input().split(\" \")))\r\n L = [0 for i in range(100001)]\r\n R = [0 for i in range(100001)]\r\n for i in range(n):\r\n L[i+1] = min(L[i]+1, height[i])\r\n for i in range(n-1, -1, -1):\r\n R[i] = min(R[i+1]+1, height[i])\r\n ans = 0\r\n for i in range(1, n+1):\r\n ans = max(ans, min(R[i-1], L[i]))\r\n print(ans)\r\nexcept EOFError:\r\n pass", "__author__ = 'JohnHook'\r\n\r\nn = list(map(int, input().split()))[0] + 2\r\na = [0] + list(map(int, input().split())) + [0]\r\nd = [0]\r\n\r\nfor i in range(1, n):\r\n if a[i] >= d[i - 1] + 1:\r\n d.append(d[i - 1] + 1)\r\n continue\r\n\r\n d.append(a[i])\r\nd.reverse()\r\na.reverse()\r\nfor i in range(1, n):\r\n if a[i] >= d[i - 1] + 1:\r\n d[i] = min(d[i], (d[i - 1] + 1))\r\n continue\r\n\r\n d[i] = (a[i])\r\n\r\nprint(max(d))", "def 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\nn = int(input())\r\n#print(n)\r\nh = [0] + [int(x) for x in input().split()] + [0]\r\n#print(h)\r\n\r\nfor i in range(1, len(h)):\r\n\th[i] = min(h[i], h[i-1]+1)\r\n\th[-i-1] = min(h[-i-1], h[-i]+1)\r\n\r\n#print(h)\r\nans = max(h)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nheight = [int(x) for x in input().split()]\r\n\r\ndp = [0] * n\r\nfor i in range(n):\r\n dp[i] = height[i]\r\n\r\ndp[0] = 1\r\nfor i in range(1,n):\r\n dp[i] = min(dp[i-1]+1, dp[i])\r\n\r\ndp[-1] = 1\r\nfor i in range(n-2,0,-1):\r\n dp[i] = min(dp[i+1]+1, dp[i])\r\n\r\nprint(max(dp))", "from pprint import pprint\r\nimport sys\r\n#sys.setrecursionlimit(100000)\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndat = list(map(int, input().split()))\r\n\r\ndatl = [-1] * n\r\ndatr = [-1] * n\r\nres = [-1] * n\r\nfor i in range(n):\r\n datl[i] = min(i + 1, dat[i])\r\n if i > 0:\r\n datl[i] = min(datl[i], datl[i - 1] + 1)\r\n\r\nfor i in range(n):\r\n datr[n-1-i] = min(i + 1, dat[n-1-i] )\r\n if i > 0:\r\n datr[n - 1 - i] = min(datr[n - 1 - i], datr[n - 1 - i + 1] + 1)\r\n\r\nfor i in range(n):\r\n res[i] = min(datl[i], datr[i])\r\n\r\nprint(max(res))\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nh = list(map(int, input().split()))\r\nop = [10 ** 5] * n\r\nop[0] = op[-1] = 1\r\nfor i in range(1, n):\r\n op[i] = min(op[i], h[i], op[i - 1] + 1)\r\nfor i in range(n - 2, 0, -1):\r\n op[i] = min(op[i], h[i], op[i + 1] + 1)\r\nprint(max(op))", "from math import inf\r\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\nl.append(0)\r\nl.insert(0,0)\r\nminus = [v-i for i,v in enumerate(l)]\r\nplus = [v+i for i,v in enumerate(l)]\r\n\r\nlminus,rplus = [minus[0]],[plus[-1]]\r\nfor i in range(1,n+1):\r\n lminus.append(min(lminus[-1],minus[i]))\r\nlminus.append(inf)\r\n\r\nfor i in range(n, 0, -1):\r\n rplus.append( min(rplus[-1], plus[i]))\r\nrplus.append(inf)\r\nrplus.reverse()\r\nm = 0\r\n\r\nfor i in range(1, n+1):\r\n x = min(lminus[i]+i, rplus[i]-i)\r\n m = max(m, x)\r\nprint(m)", "\r\nx = int(input())\r\ny = list(map(int, input().split(' ')))\r\n\r\ny[0] = 1\r\ny[x-1] = 1\r\n\r\nz = y[:]\r\nfor i in range(1, x):\r\n z[i] = min(z[i], z[i-1] + 1)\r\n\r\nw = y[:]\r\nfor i in range(x-2, -1, -1):\r\n w[i] = min(w[i], w[i+1]+1)\r\n\r\nans = 0\r\nfor i in range(x):\r\n ans = max(ans, min(z[i], w[i]))\r\n\r\nprint(ans)\r\n", "\nn = int(input())\na = [int(x) for x in input().split()]\n\na[0] = 1\na[-1] = 1\nfor i in range(1,n):\n a[i] = min(a[i],a[i-1]+1)\n a[-i] = min(a[-i],a[-(i-1)]+1)\n\nprint(max(a))\n\n", "n = int(input())\r\nhs = list(map(int, input().split()))\r\ndp = [1] * n\r\n \r\nfor i in range(1, n-1):\r\n dp[i] = min(dp[i-1] + 1, hs[i])\r\n \r\nfor i in range(n-2, 0, -1):\r\n dp[i] = min(dp[i+1] + 1, dp[i])\r\n \r\nprint(max(dp))", "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\n\r\n# from sortedcontainers import SortedSet, SortedList\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n dp = [[0, 0] for _ in range(n + 2)]\r\n for i in range(1, n + 1):\r\n dp[i][0] = min(dp[i - 1][0] + 1, arr[i - 1])\r\n for i in range(n, 0, -1):\r\n dp[i][1] = min(dp[i + 1][1] + 1, arr[i - 1])\r\n print(max(min(dp[i]) for i in range(1, n + 1)))\r\n\r\n\r\nmain()\r\n", "n = int(input())\r\nh = [0] + list(map(int, input().split()))\r\nres = [0] * (n + 1)\r\nMin = 0\r\nfor i in range(1, n + 1):\r\n Min = min(Min, h[i] - i)\r\n res[i] = i + Min\r\nMin = n + 1\r\nfor i in range(n, 0, -1):\r\n Min = min(Min, h[i] + i)\r\n res[i] = min(res[i], Min - i)\r\nans = max(res)\r\nprint(ans)", "x=int(input())\r\nmas = list(map(int,input().split(\" \")))\r\nmas2=[0]*(x)\r\nmas2[0]=1\r\n\r\nfor i in range(1,x):\r\n mas2[i]=min(mas[i],mas2[i-1]+1)\r\nmas2[-1]=1\r\nfor i in range(2,x+1):\r\n mas2[-i]=min(mas[-i],mas2[-i+1]+1, mas2[-i])\r\nprint(max(mas2))\r\n", "n = int(input())\narr = [0] + [int(i) for i in input().split()] + [0]\nleft, right = [0] * (n+2), [0] * (n+2)\nfor i in range(1, n+1):\n left[i] = min(arr[i], left[i-1]+1)\nfor i in range(n, 0, -1):\n right[i] = min(arr[i], right[i+1]+1)\nans = 0\nfor i in range(1, n+1):\n ans = max(ans, min(left[i], right[i]))\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", "def process(H):\r\n n = len(H)\r\n curr = [1]\r\n for i in range(1, n):\r\n curr_x = min(H[i], curr[-1]+1)\r\n curr.append(curr_x)\r\n curr[-1] = 1\r\n for i in range(n-2, 0, -1):\r\n curr_x = min(H[i], curr[i+1]+1)\r\n curr[i] = min(curr[i], curr_x)\r\n return max(curr)\r\n \r\nn = int(input())\r\nH = [int(x) for x in input().split()]\r\nprint(process(H))", "def main():\r\n n = int(input())\r\n hts = list(map(int,input().split()))\r\n dpleft = [1]\r\n for i in range(1,n):\r\n dpleft.append(min(hts[i],dpleft[-1]+1))\r\n\r\n hts.reverse()\r\n dpright = [1]\r\n for i in range(1,n):\r\n dpright.append(min(hts[i],dpright[-1]+1))\r\n\r\n dpright.reverse()\r\n ans = 0\r\n for i in range(n):\r\n ans = max(ans,min(dpleft[i],dpright[i]))\r\n\r\n print(ans)\r\n\r\nmain()\r\n", "n = int(input())\r\nh = list(map(int, input().split()))\r\n\r\nmin_h = 1\r\nfor i in range(n):\r\n if h[i] > min_h:\r\n h[i] = min_h\r\n else:\r\n min_h = h[i]\r\n min_h += 1\r\nmin_h = 1\r\nfor i in range(n - 1, -1, -1):\r\n if h[i] > min_h:\r\n h[i] = min_h\r\n else:\r\n min_h = h[i]\r\n min_h += 1\r\n\r\nprint(max(h))", "n = int(input())\r\nh = [int(i) for i in input().split()]\r\n\r\ndp = [10 ** 5] * n\r\ndp[0] = 1\r\ndp[n-1] = 1\r\n\r\nfor i in range(1, n-1):\r\n dp[i] = min(dp[i-1] + 1, h[i])\r\n\r\nfor i in range(n-2, 0, -1):\r\n dp[i] = min(dp[i], dp[i+1] + 1)\r\n dp[i] = min(dp[i], h[i])\r\n\r\nprint(max(dp))", "def min_operations(n, h):\n left = [0]*n\n right = [0]*n\n left[0] = right[-1] = 1\n for i in range(1, n):\n left[i] = min(left[i-1]+1, h[i])\n for i in range(n-2, -1, -1):\n right[i] = min(right[i+1]+1, h[i])\n return max(min(left[i], right[i]) for i in range(n))\n\nn = int(input().strip())\nh = list(map(int, input().strip().split()))\nprint(min_operations(n, h))\n\t \t \t \t \t\t \t\t\t \t\t \t \t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nd1 = [1]\r\na = 1 << 30\r\nfor i in range(1, n):\r\n a = min(a+1, w[i-1]+1)\r\n d1.append(a)\r\nd2 = [1]\r\na = 1 << 30\r\nfor i in range(n-2, -1, -1):\r\n a = min(a+1, w[i+1]+1)\r\n d2.append(a)\r\nx = [0]*n\r\nfor i in range(n):\r\n x[i] = min(w[i], i+1, n-i, d1[i], d2[n-i-1])\r\nprint(max(x))\r\n", "n = (int)(input())\n\nh = list(map(int,input().split()))\n\ndp = []\n\ndp.append(1)\n\nfor i in range(1,n-1,1):\n\n dp.append(min(dp[i-1]+1,h[i]))\n\ndp.append(1)\n\nfor i in range(n-2,0,-1):\n\n dp[i]=min(dp[i],dp[i+1]+1)\n\nmx=-1\n\nfor i in range(n):\n\n mx=max(mx,dp[i])\n\nprint(mx)\n\n\n\n\n\n# Made By Mostafa_Khaled", "input()\ndef f(l):\n c = [0]*len(l)\n c[0] = c[len(c) - 1] = 9999999\n for item in range(1, len(l) - 1):\n c[item] = min(item, l[item], c[item - 1] + 1)\n for item in reversed(range(1, len(l) - 1)):\n c[item] = min(c[item], len(l) - 2 + 1 - item, c[item + 1] + 1)\n\n return max(c[1:-1])\n\nprint(f([0] + list(map(int, input().split())) + [0]))\n\n", "#CLown1331 -_-\r\nn = int(input())\r\nar = list(map(int,input().split()))\r\nr = []\r\nl = []\r\nday = 0\r\nfor i in ar:\r\n day += 1\r\n day = min(i,day)\r\n l.append(day)\r\nday = 0\r\nfor i in reversed(ar):\r\n day += 1\r\n day = min(i,day)\r\n r.append(day)\r\nans = 0\r\nx = 0\r\nrh = list(reversed(r))\r\nwhile x < n:\r\n ans = max(ans,min(rh[x],l[x]))\r\n x += 1\r\nprint (ans)", "R = lambda: map(int, input().split())\r\n\r\nn = int(input())\r\narr = [-1] + list(R()) + [-1]\r\ndpl, dpr = arr[:], arr[:]\r\nfor i in range(1, n + 1):\r\n dpl[i] = max(0, min(dpl[i - 1] + 1, arr[i] - 1))\r\nfor i in range(n, 0, -1):\r\n dpr[i] = max(0, min(dpr[i + 1] + 1, arr[i] - 1))\r\nprint(1 + max(min(l, r) for l, r in zip(dpl, dpr)))", "input()\nl, r = [0], [0]\nfor a, b in (lambda a: zip(a, reversed(a)))([0] + list(map(int, input().split())) + [0]):\n l.append(min(a, l[-1] + 1))\n r.append(min(b, r[-1] + 1))\nprint(max(map(min, zip(l[1:], reversed(r[1:])))))\n", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int,stdin.readline().split()))\r\nPI=float('inf')\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=lst()\r\n ans=0\r\n pre=[0]*n\r\n suf=[0]*n\r\n pre[0]=suf[n-1]=1\r\n for i in range(1,n):\r\n pre[i]=min(1+pre[i-1],a[i])\r\n for i in range(n-2,-1,-1):\r\n suf[i]=min(1+suf[i+1],a[i])\r\n for pp,ss in zip(pre,suf):\r\n ans=max(ans,min(pp,ss))\r\n print(ans)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nnums[0], nums[-1] = 1, 1\r\nfor p in range(1, n):\r\n nums[p] = min(nums[p], nums[p - 1] + 1)\r\nfor p in range(n - 2, 0, -1):\r\n nums[p] = min(nums[p], nums[p + 1] + 1)\r\nprint(max(nums))\r\n" ]

[ "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef fast_prime_factorization(n):\r\n d = [(i + 1) % 2 * 2 for i in range(n + 1)]\r\n d[0], d[1] = 0, 1\r\n for i in range(3, n + 1):\r\n if d[i]:\r\n continue\r\n for j in range(i, n + 1, 2 * i):\r\n if not d[j]:\r\n d[j] = i\r\n return d\r\n\r\nl = pow(10, 6) + 100\r\nmod = pow(10, 9) + 7\r\nfact = [1] * (l + 1)\r\nfor i in range(1, l + 1):\r\n fact[i] = i * fact[i - 1] % mod\r\ninv = [1] * (l + 1)\r\ninv[l] = pow(fact[l], mod - 2, mod)\r\nfor i in range(l - 1, -1, -1):\r\n inv[i] = (i + 1) * inv[i + 1] % mod\r\n\r\ndef comb(n, r):\r\n return fact[n] * inv[r] * inv[n - r] % mod if n >= r >= 0 else 0\r\n\r\nd = fast_prime_factorization(l)\r\n\r\npow2 = [1]\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1] % mod)\r\n\r\nq = int(input())\r\nfor _ in range(q):\r\n x, y = map(int, input().split())\r\n cnt = defaultdict(lambda : 0)\r\n while x ^ d[x]:\r\n cnt[d[x]] += 1\r\n x //= d[x]\r\n if x > 1:\r\n cnt[x] += 1\r\n ans = 1\r\n for i in cnt.values():\r\n ans *= comb(y + i - 1, i)\r\n ans %= mod\r\n ans *= pow2[y - 1]\r\n ans %= mod\r\n print(ans)", "import sys\r\n\r\nmod = 10**9 + 7\r\nmax_n = 10**6 + 100\r\nfac, inv = [1]*max_n, [1]*max_n\r\nfor i in range(2, max_n):\r\n fac[i] = fac[i-1] * i % mod\r\ninv[-1] = pow(fac[-1], mod-2, mod)\r\nfor i in range(max_n-1, 0, -1):\r\n inv[i-1] = inv[i] * i % mod\r\n\r\n\r\ndef get_primes(n: int):\r\n from itertools import chain\r\n from array import array\r\n primes = [2, 3]\r\n is_prime = (array('b', (0, 0, 1, 1, 0, 1, 0)) +\r\n array('b', (1, 0, 0, 0, 1, 0))*((n-1)//6))\r\n\r\n for i in chain.from_iterable((range(5, n+1, 6), range(7, n+1, 6))):\r\n if is_prime[i]:\r\n primes.append(i)\r\n for j in range(i*3, n+1, i*2):\r\n is_prime[j] = 0\r\n\r\n return is_prime, primes\r\n\r\n\r\n_, primes = get_primes(10**3)\r\nq = int(sys.stdin.buffer.readline().decode('utf-8'))\r\nans = [0]*q\r\nfor i in range(q):\r\n x, y = map(int, sys.stdin.buffer.readline().decode('utf-8').split())\r\n pfac = []\r\n for p in primes:\r\n if x % p == 0:\r\n pfac.append(0)\r\n while x % p == 0:\r\n pfac[-1] += 1\r\n x //= p\r\n if x > 1:\r\n pfac.append(1)\r\n\r\n res = 1\r\n for c in pfac:\r\n res = (res * fac[c+y-1] * inv[y-1] * inv[c]) % mod\r\n res = res * pow(2, y-1, mod) % mod\r\n ans[i] = res\r\n\r\nsys.stdout.buffer.write('\\n'.join(map(str, ans)).encode('utf-8'))\r\n", "import heapq;\r\nimport math;\r\nfrom collections import Counter, deque;\r\nfrom itertools import permutations\r\nimport random;\r\nimport sys;\r\nfrom os import path;\r\n\r\nfrom random import getrandbits;\r\n\r\nmod = 10**9 + 7;\r\n\r\n# sys.stdin = open('sieve.in', 'r');\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\npowers = [];\r\nfactorials = [1];\r\ncurrMul = 1;\r\n\r\nfor i in range(1, 3 * 10**6):\r\n currMul *= i;\r\n currMul %= mod;\r\n factorials.append(currMul);\r\n\r\n\r\n\r\n\r\n\r\nN = 10**6 + 5;\r\n\r\ndef nCr(n, r):\r\n numerator = factorials[n];\r\n denominator = factorials[n - r] * factorials[r];\r\n denominator %= mod;\r\n return (numerator * pow(denominator, mod - 2, mod)) % mod\r\n\r\n\r\n\r\n\r\n\r\nspf = [0 for i in range(N)];\r\n\r\ndef sieve():\r\n for i in range(2, N):\r\n if not spf[i]:\r\n for j in range(i, N, i):\r\n if not spf[j]: spf[j] = i;\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nsieve();\r\n\r\n\r\npowers.append(1);\r\n\r\ncurrMul = 1;\r\nfor i in range(N):\r\n currMul *= 2;\r\n currMul %= mod;\r\n powers.append(currMul);\r\n\r\nt = int(input())\r\n\r\n\r\nfor _ in range(t):\r\n x, y = map(int, input().split())\r\n\r\n\r\n\r\n def solve():\r\n\r\n\r\n cnts = [];\r\n\r\n currNum = x;\r\n\r\n while currNum != 1:\r\n cnt = 0;\r\n currSpf = spf[currNum];\r\n while (currNum % currSpf) == 0:\r\n currNum //= currSpf\r\n cnt += 1;\r\n cnts.append(cnt);\r\n\r\n\r\n\r\n res = 1;\r\n\r\n\r\n for cnt in cnts:\r\n res *= nCr(y + cnt - 1, cnt);\r\n res %= mod;\r\n\r\n\r\n res *= powers[y - 1]\r\n res %= mod;\r\n\r\n\r\n return res;\r\n\r\n\r\n print(solve())\r\n" ]

[ "# i'm from jasnah, do not ban me\r\nfrom sys import stdin\r\nfrom itertools import repeat\r\nfrom collections import defaultdict\r\n\r\nnum_rectangles = int(stdin.readline())\r\nhorizontal_segments = defaultdict(list)\r\nvertical_segments = defaultdict(list)\r\nunique_y_values = set()\r\nevents = defaultdict(list)\r\n\r\nfor _ in repeat(None, num_rectangles):\r\n x1, y1, x2, y2 = map(int, input().split())\r\n if x1 > x2:\r\n x1, x2 = x2, x1\r\n if y1 > y2:\r\n y1, y2 = y2, y1\r\n if x1 == x2:\r\n horizontal_segments[x1].append((y1, y2))\r\n else:\r\n vertical_segments[y1].append((x1, x2))\r\n\r\ntotal_area = 0\r\n\r\nfor x, segments in horizontal_segments.items():\r\n segments.sort()\r\n segments.append((1001001001, 1001001001))\r\n new_segments = []\r\n start = end = segments[0][0]\r\n for y1, y2 in segments:\r\n if y1 > end:\r\n new_segments.append((start, end))\r\n total_area += end - start + 1\r\n events[start].append((1, x))\r\n events[end + 1].append((-1, x))\r\n start = end = y1\r\n if end < y2:\r\n end = y2\r\n segments = new_segments\r\n unique_y_values.add(x)\r\n\r\nfor y, segments in vertical_segments.items():\r\n segments.sort()\r\n segments.append((1001001001, 1001001001))\r\n new_segments = []\r\n start = end = segments[0][0]\r\n for x1, x2 in segments:\r\n if x1 > end:\r\n new_segments.append((start, end))\r\n unique_y_values.add(start)\r\n unique_y_values.add(end)\r\n events[y].append((2, start, end))\r\n total_area += end - start + 1\r\n start = end = x1\r\n if end < x2:\r\n end = x2\r\n segments = new_segments\r\n\r\nunique_y_values = [-1001001001] + sorted(unique_y_values)\r\nunique_y_values_mapping = {y: i for i, y in enumerate(unique_y_values)}\r\nlength = len(unique_y_values)\r\nbinary_indexed_tree = [0] * length\r\n\r\nfor x_value in sorted(events.keys()):\r\n for event in sorted(events[x_value]):\r\n if event[0] <= 1:\r\n operation, y_value = event[0], unique_y_values_mapping[event[1]]\r\n while y_value < length:\r\n binary_indexed_tree[y_value] += operation\r\n y_value += y_value - (y_value & (y_value - 1))\r\n else:\r\n operation, start, end = event[0], unique_y_values_mapping[event[1]] - 1, unique_y_values_mapping[event[2]]\r\n while end > 0:\r\n total_area -= binary_indexed_tree[end]\r\n end = end & (end - 1)\r\n while start > 0:\r\n total_area += binary_indexed_tree[start]\r\n start = start & (start - 1)\r\n\r\nprint(total_area)\r\n" ]

[ "a=input()\nb={}\nc=0\nfor i in a:\n b[i]=b.get(i,0)+1\nfor f in b.values():\n c+=f**2\nprint(c)", "s= input()\r\ns1 = list(set(s))\r\nd={}\r\nfor i in s1:\r\n d[i]=s.count(i)\r\nans=0\r\nfor i in s1:\r\n ans += d[i]**2\r\nprint(ans)\r\n", "a={}\ns=input()\nfor c in s:\n a[c]=a.get(c,0)+1\nans=0\nfor i in a.values():\n ans+=i**2\nprint(ans)", "s=input()\ncount=0\nls={}\nfor i in s:\n ls[i]=ls.get(i,0)+1\nf=ls.values() \nfor j in f:\n count+=j*j\nprint(count)", "# https://codeforces.com/problemset/problem/50/B\n\nfrom collections import Counter\n\ndef main():\n s = input()\n c = Counter(s)\n print(sum([v**2 for v in c.values()]))\n\n\nif __name__ == '__main__':\n main()", "a=input()\r\nb=set()\r\nc={}\r\nfor i in a:\r\n b.add(i)\r\nfor i in b:\r\n c[i]=a.count(i)\r\ncnt=0\r\nfor i in c:\r\n cnt+=c[i]*(c[i]-1)\r\nprint(cnt+len(a))", "arr = list(input())\r\ndict1 = {}\r\nans=0\r\nfor i in range(len(arr)):\r\n if(arr[i] in dict1):\r\n dict1[arr[i]]+=1\r\n else:\r\n dict1[arr[i]]=1\r\nfor x in dict1:\r\n ans+= (dict1[x]**2)\r\nprint(ans)\r\n \r\n", "from typing import Counter\r\n\r\ns = input()\r\nres = 0\r\nc = Counter(s)\r\nfor value in c.values():\r\n res += value\r\n if value != 1:\r\n res += value**2 - value\r\nprint(res)", "n=input()\r\ncount=0\r\nd={}\r\nfor i in n:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nfor i in d.values():\r\n count+=i**2\r\nprint(count)\r\n'''\r\nclass Person:\r\n _num=0\r\n \r\n def __init__(self,name,sex,birthday,ident):\r\n if not (isinstance(name,str) and sex in (\"女\",\"男\")):\r\n raise PersonValueError(name,sex)\r\n try:\r\n birth=datetime.date(*birthday) #生成一个日期对象\r\n except:\r\n raise PersionValueError(\"Wrong date:\",birthday)\r\n self._name=name\r\n self._sex=sex\r\n self._birthday=birth\r\n self._id=ident\r\n Person._num+=1 #实例计数\r\n\r\n\r\n def id(self): return self._id\r\n def name(self): return self._name\r\n def sex(self): return self._sex\r\n def birthday(self): return self._birthday\r\n def age(self): return (datetime.date.today().year().year-self._birthday.year)\r\n\r\n def set_name(self,name):\r\n if not isinstance(name,str):\r\n raise PersonValueError(\"set_name\",name)\r\n def __lt__(self,another):\r\n if not isinstance(another,Person):\r\n raise PersonTypeError(another)\r\n return self._id<another._id\r\n'''", "arr = list(input())\r\ns = set(arr)\r\nans=0\r\nfor i in s:\r\n ans+=(arr.count(i)**2)\r\nprint(ans)\r\n", "x=input()\ns=0\nd={}\nfor i in x:\n if i not in d:\n d[i]=1\n else:\n d[i]+=1\nfor value in d.values():\n s+=value**2\nprint(s)", "vards = input()\r\ndic = {}\r\nrez = 0\r\nfor c in vards:\r\n if c in dic:\r\n dic[c] += 1\r\n else:\r\n dic[c] = 1\r\nfor c in dic:\r\n rez += dic[c] * dic[c]\r\nprint(rez)", "# LUOGU_RID: 103443243\ns=input()\nd={}\nfor i in s:\n d[i]=d.get(i,0)+1\nn=0\nfor ch in d.values():\n n+=ch**2\nprint(n)", "from typing import Counter\r\ns = input()\r\nl = Counter(s)\r\nans = 0\r\nfor i in l:\r\n ans+=(l[i]*l[i])\r\nprint(ans)", "s=input()\r\nd={}\r\nfor c in s:\r\n d[c]=d.get(c,0)+1\r\ncnt=0\r\nfor i in d.values():\r\n cnt+=i**2\r\nprint(cnt)", "n=input();s={};a=0\r\nn1=list(set(' '.join(n).split()));ls=[0]*len(n1)\r\nfor i in range(len(n1)):\r\n s[n1[i]]=i\r\nfor i in n:\r\n ls[s[i]]+=1\r\nfor i in range(len(n1)):\r\n a+=ls[i]**2\r\nprint(a)", "s=input()\nd={}\nfor c in s:\n d[c]=d.get(c,0)+1\nans=0\nfor i in d.values():\n ans+=i**2\nprint(ans)", "def main():\n s = list(input())\n count = 0\n hash_map = {}\n for i in range(len(s)):\n if s[i] in hash_map:\n count += hash_map[s[i]]\n continue\n i_count = 0\n for j in range(len(s)):\n if s[i] == s[j]:\n i_count += 1\n count += i_count\n hash_map[s[i]] = i_count\n print(count)\n\n\nif __name__ == \"__main__\":\n main()\n", "# LUOGU_RID: 103333464\ns=input()\r\ndic={}\r\nsum=0\r\nfor i in s:\r\n dic[i]=dic.get(i,0)+1\r\nfor item in dic:\r\n sum+=dic[item]*dic[item]\r\nprint(sum)", "s = input()\r\nd = {}\r\nfor c in s:\r\n d[c] = d.get(c,0) + 1\r\nans = 0\r\nfor i in d.values():\r\n ans += i**2\r\nprint(ans)\r\n", "n=input()\r\ncount=0\r\nd={}\r\nfor i in n:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nfor i in d.values():\r\n count+=i**2\r\nprint(count)", "x=input()\r\nl={}\r\nfor i in x:\r\n l[i]=l.get(i,0)+1\r\na=list(l.values())\r\nsum=0\r\nfor i in a:\r\n sum+=i**2\r\nprint(sum)\r\n \r\n\r\n", "s = input()\r\n\r\nalphabet_and_digit = []\r\nfor i in range(0, 11):\r\n alphabet_and_digit.append(str(i))\r\nfor i in range(11, 37):\r\n alphabet_and_digit.append(chr(ord('a')+i-11))\r\n\r\ndistinct_element = []\r\nfor i in range(37):\r\n distinct_element.append(0)\r\nfor i in range(len(s)):\r\n distinct_element[alphabet_and_digit.index(s[i])] += 1\r\ncnt = 0\r\nfor i in range(37):\r\n cnt += distinct_element[i]**2\r\n\r\nprint(cnt)\r\n", "s=','.join(input().split())\nsj=list(set(s))\ncnt=0\nfor i in sj:\n cnt+=(s.count(i))**2\nprint(cnt)", "s=input()\nd={}\nsum=0\nfor i in s:\n d[i]=d.get(i,0)+1\nfor each in d.values():\n sum+=each**2\nprint(sum)", "n=input()\nm=list(n)\np=set(m)\nnum=0\nfor i in p:\n num+=m.count(i)**2\nprint(num)", "s=input()\nm=0\nd={}\nfor i in s:\n d[i]=d.get(i,0)+1\nls=list(d.items())\nfor each in ls:\n if each[1]>1:\n m+=each[1]**2\n else:\n m+=1\nprint(m)", "s=input()\r\nprint(sum(s.count(k)**2 for k in set(s)) )", "line = input()\r\n\r\ncnt = 0\r\nfor w in set(line):\r\n cnt += line.count(w)**2\r\n \r\nprint(cnt)", "s=input()\r\nd={}\r\ncnt=0\r\nfor i in s:\r\n d[i]=d.get(i,0)+1\r\nfor i in s:\r\n cnt+=d.get(i,0)\r\nprint(cnt)\r\n", "a=input()\nl=0\nd={}\nfor i in a:\n d[i]=d.get(i,0)+1\nfor g in d.values():\n l+=g**2\nprint(l)\n \n \n \n ", "s=input()\r\ndic={}\r\nfor i in s:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\nc=0\r\nfor i in s:\r\n c+=dic[i]\r\nprint(c)", "s = str(input())\r\n\r\nm = {}\r\nres = 0\r\n\r\nfor i in s:\r\n if i not in m:\r\n m[i] = 1\r\n else:\r\n m[i] += 1\r\n\r\nfor key in m:\r\n res += m[key] ** 2\r\n\r\nprint(res)\r\n", "n=input()\r\nm=list(n)\r\np=set(m)\r\nnum=0\r\nfor i in p:\r\n num+=m.count(i)**2\r\nprint(num)\r\n \r\n", "a = input()\nd = {}\nans = 0\nfor i in a:\n d[i] = d.get(i,0) + 1\nfor j in d.values():\n ans += j ** 2\nprint(ans)\n ", "n=input()\r\nm=list(n)\r\no=set(m)\r\nnum=0\r\nfor i in o:\r\n num+=m.count(i)**2\r\nprint(num)\r\n", "word=input()\r\nls=set(word)\r\ncnt=0\r\nfor i in ls:\r\n cnt+=word.count(i)**2\r\nprint(cnt)\r\n", "s = list(input())\r\nans = len(s)\r\ndic = {}\r\nfor item in s:\r\n if item not in dic:\r\n dic[item] = 1\r\n else:\r\n dic[item] += 1\r\nfor item in dic.keys():\r\n ans += dic[item] * (dic[item] - 1)\r\nprint(ans)\r\n", "m=input()\r\ns=0\r\nd={}\r\nfor i in m:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nfor value in d.values():\r\n s+=value**2\r\nprint(s)", "s = input()\r\nfreq = []\r\nfor i in range(1000):\r\n freq.append(0)\r\nfor x in s:\r\n val = ord(x)\r\n freq[val] += 1\r\nans = len(s)\r\nfor i in range(1000):\r\n ans += (freq[i] * (freq[i] - 1))\r\nprint(ans)", "val=input().lower()\r\nL=list()\r\nfor d in val:\r\n L.append(d)\r\nt=dict()\r\nfor dig in L:\r\n t[dig]=t.get(dig,0)+1\r\nr=0\r\nfor k in t:\r\n r+=(t[k])**2\r\nprint(r)\r\n", "S=input()\nn={}\nfor i in S:\n n[i]=n.get(i,0)+1\na=0\nfor j in n.values():\n a+=j**2\nprint(a)\n", "S=input()\nd={}\ncnt=0\nfor i in S:\n d[i]=d.get(i,0)+1\nfor i in S:\n cnt+=d.get(i,0)\nprint(cnt)", "# LUOGU_RID: 95960745\ns=input()\nd={}\nfor c in s:\n d[c]=d.get(c,0)+1\na=0\nfor i in d.values():\n a+=i**2\nprint(a)", "# LUOGU_RID: 95960909\nd={}\na=input()\nfor c in a:\n d[c]=d.get(c,0)+1\nb=0\nfor c in d.values():\n b+=c**2\nprint(b)", "x=input()\ncount={}\nt=0\nfor i in x:\n count[i]=count.get(i,0)+1\nl=list(count.values())\nfor i in l:\n t+=i*i\nprint(t)", "from collections import Counter\r\nfrom math import factorial\r\n\r\ns=input()\r\nq=Counter(s)\r\nres=0\r\nfor j in q.keys():\r\n res+=(1+q[j])*q[j]-q[j]\r\nprint(res)", "# LUOGU_RID: 103339739\ns=input()\nd={}\nfor i in s:\n d[i]=d.get(i,0)+1\nans=0\nfor j in d.values():\n ans+=j**2\nprint(ans)", "n=input()\r\nls=[]\r\nfor each in n:\r\n if each not in ls:\r\n ls.append(each)\r\nb=0\r\nfor each in ls:\r\n a=0\r\n for word in n:\r\n if each==word:\r\n a+=1\r\n b+=a**2\r\nprint(b) \r\n \r\n", "# LUOGU_RID: 95960798\nn=input()\nl={}\nfor N in n:\n l[N]=l.get(N,0)+1\na=0\nfor i in l.values():\n a+=i**2\nprint(a)", "a=input()\r\ndic={}\r\nnum=0\r\nfor i in a:\r\n if i not in dic:\r\n dic[i]=1\r\n else:\r\n dic[i]=dic.get(i)+1\r\nfor i in dic:\r\n num+=dic[i]*dic[i]\r\nprint(num)", "from collections import *\r\n\r\ndef pair_cnt(L):\r\n C = Counter()\r\n ans = 0\r\n for i,a in enumerate(L):\r\n ans += C[a]*2+1\r\n C[a]+=1\r\n return ans\r\n\r\nL = input()\r\nprint(pair_cnt(L))", "from collections import Counter\n\nif __name__ == '__main__':\n print(sum([v*v for v in Counter(input()).values()]))\n", "s=input()\r\npsy={}\r\nfor char in s:\r\n if char in psy:\r\n psy[char]+=1\r\n else:\r\n psy[char]=1\r\nanswer=0\r\nfor key in psy:\r\n answer=answer+ psy[key]**2\r\nprint(answer)", "x=input()\r\nls1=[]\r\nfor i in x:\r\n ls1.append(i)\r\n\r\nd={}\r\nfor i in x:\r\n d[i]=d.get(i,0)+1\r\nsum=0\r\nls=list(d.values())\r\nfor i in ls:\r\n sum+=i**2\r\nprint(sum)\r\n ", "s=input()\r\nd={}\r\ncount=0\r\nfor i in s:\r\n d[i]=d.get(i,0)+1\r\nl=list(d.values())\r\nfor i in l:\r\n count+=i**2\r\nprint(count)", "string=list(map(str,input()))\na=list(set(string))\nlen1=len(string)\nlen2=len(a)\ncount1=[]\nfor i in range(len2):\n count2=string.count(a[i])\n count1.append((count2*count2))\nprint(sum(count1))\n\t\t\t\t \t\t \t \t \t\t\t\t \t \t\t \t\t", "a=list(input())\r\nb=[]\r\nfor i in set(a):\r\n b.append(a.count(i))\r\nsumm = 0\r\nfor i in b:\r\n count = 0\r\n count = i**2\r\n summ = summ + count\r\nprint(summ)", "s = input()\r\nd = {}\r\nsum = 0\r\nfor c in s:\r\n if c in d:\r\n d[c] = d[c] + 1\r\n else:\r\n d[c] = 1\r\nfor k in d:\r\n sum = sum + d[k] * d[k]\r\nprint(sum)", "ls=list(input())\r\nd={}\r\nfor i in ls:\r\n d[i]=d.get(i,0)+1\r\ncount=0\r\nfor v in d.values():\r\n count+=v**2\r\nprint(count)", "s=input()\nd={}\nfor c in s:\n d[c]=d.get(c,0)+1\nsum=0\nfor i in d.values():\n sum+=i**2\nprint(sum)", "\r\n\r\ns= input()\r\n\r\n\r\nf={}\r\n\r\nfor j in s:\r\n if j not in f:\r\n f[j]=1\r\n else:\r\n f[j]+=1\r\n\r\nans=0\r\nfor k in f.keys():\r\n\r\n ans+=f[k]\r\n ans+=(f[k]-1)*(f[k])\r\nprint(ans)\r\n", "s=input()\nd={}\nfor word in s:\n d[word]=d.get(word,0)+1\na=0\nfor i in d.values():\n a+=i**2\nprint(a)", "s=input()\r\nd={}\r\nsum=0\r\nfor i in s:\r\n d[i]=d.get(i,0)+1\r\nfor each in d.values():\r\n sum+=each**2\r\nprint(sum)", "a = input()\r\ncount = []\r\nn = len(a)\r\nl = list(a)\r\ns = list(set(a))\r\nfor i in range(0,len(s)):\r\n count.append(l.count(s[i])**2)\r\nprint(sum(count))", "# LUOGU_RID: 96299699\nn=input()\r\nd={}\r\nans=0\r\nfor i in n:\r\n d[i]=d.get(i,0)+1\r\nfor i in d.values():\r\n ans+=i**2\r\nprint(ans)", "s=input()\ncount={}\nfor c in s:\n count[c]=count.get(c,0)+1\nl=list(count.values())\nt=0\nfor i in l:\n t+=i*i\nprint(t)", "# LUOGU_RID: 103336858\nn=str(input())\r\nz={}\r\nx=0\r\nnl=int(len(n))\r\nfor i in range(nl):\r\n if n[i] in z:\r\n z[n[i]]=z[n[i]]+1\r\n else:\r\n z[n[i]]=1\r\nfor value in z:\r\n x+=z[value]**2\r\nprint(x)", "a=input()\nb={}\nfor i in a:\n b[i]=b.get(i,0)+1\nans=0\nfor i in b.values():\n ans+=i**2\nprint(ans)", "import sys\nfrom collections import Counter\n\ns = sys.stdin.readline().rstrip()\nc = Counter(s)\nprint(sum([i ** 2 for i in c.values()]))\n", "s=input()\r\ncount=0\r\nd={}\r\nfor i in s:\r\n d[i]=d.get(i,0)+1\r\nfor v in d.values():\r\n count+=v**2\r\nprint(count)\r\n ", "s = list(input())\r\ns_set = set(s)\r\nprint(sum([s.count(val) ** 2 for val in s_set]))\r\n", "s = input()\n\n\nd = {}\nfor c in s:\n d[c] = d.get(c, 0) + 1\n\nprint(sum(x * x for x in d.values()))\n", "from collections import Counter\n\nif __name__ == '__main__':\n S = input()\n d = Counter(S)\n print(sum([v*v for v in d.values()]))", "s=input()\r\nls1=[]\r\nls2=[]\r\na={}\r\nt=0\r\nfor i in range(len(s)):\r\n ls1.append(s[i])\r\nfor i in range(len(s)):\r\n a[ls1[i]]=a.get(ls1[i],0)+1\r\nls1=list(set(ls1))\r\nfor i in range(len(ls1)):\r\n ls2.append(a[ls1[i]])\r\nfor i in ls2:\r\n i=int(i)\r\n if i!=1:\r\n t+=i**2\r\n else:\r\n t+=1\r\nprint(t)", "a=list(input())\r\ns=0\r\nfor i in set(a):\r\n s+=(a.count(i))**2\r\nprint(s)", "# LUOGU_RID: 103440874\ns=input()\r\ncnt=0\r\ndict={}\r\nfor i in s:\r\n dict[i]=dict.get(i,0)+1\r\nfor i in dict.values():\r\n cnt+=i**2\r\nprint(cnt)\r\n", "s=input()\r\nc=0\r\ns1=\"\"\r\nfor i in s:\r\n if i not in s1:\r\n d=s.count(i)\r\n c+=d*d\r\n s1+=i\r\nprint(c)\r\n", "# LUOGU_RID: 95960769\nd={}#字母：出现次数\r\na=0\r\ns=input()\r\nfor c in s:\r\n d[c]=d.get(c,0)+1\r\nfor i in d.values():\r\n a+=i**2\r\nprint(a)", "# LUOGU_RID: 103453417\nn=0\r\nd={}\r\ns=input()\r\nfor i in s:\r\n d[i]=d.get(i,0)+1\r\nfor x in d.values():\r\n n+=x**2\r\nprint(n)\r\n", "S=input()\r\ncnt={}\r\nfor each in S:\r\n cnt[each]=cnt.get(each,0)+1\r\nls=cnt.values()\r\ns=0\r\nfor i in ls:\r\n s+=int(i)**2\r\nprint(s)\r\n", "given = input()\r\ncount = 0\r\ncounter = {}\r\nfor i in given:\r\n if i in counter:\r\n counter[i] += 1\r\n else:\r\n counter[i] = 1\r\nfor i in counter:\r\n count += counter[i] * counter[i]\r\nprint(count)\r\n ", "from collections import Counter\r\ns=list(input())\r\na=Counter(s)\r\nans=0\r\nfor i in a.values():\r\n ans+=(i**2)\r\nprint(ans)", "s=input()\r\nm=0\r\nd={}\r\nfor i in s:\r\n d[i]=d.get(i,0)+1\r\n\r\nls=list(d.items())\r\n\r\nfor each in ls:\r\n if each[1]>1:\r\n m+=each[1]**2\r\n else:\r\n m+=1\r\n\r\nprint(m)", "zi=input()\r\ncnt=0\r\na=set(zi)\r\nfor i in a:\r\n cnt+=zi.count(i)**2\r\nprint(cnt)\r\n\r\n", "n = input()\r\nDc = {}\r\nm = 0\r\nfor i in n:\r\n Dc[i] = Dc.get(i,0) + 1\r\nfor j in Dc.values():\r\n m += j ** 2\r\nprint(m)", "a=input()\r\nz={}\r\nfor i in a:\r\n z[i]=z.get(i,0)+1\r\nans=0\r\nfor s in z.values():\r\n ans+=s**2\r\nprint(ans)\r\n", "st=input()\r\nl=len(st)\r\ns=0\r\ndic={}\r\nfor i in st:\r\n if i not in dic:\r\n dic[i]=1\r\n else:\r\n dic[i]+=1\r\nfor i in dic:\r\n s+=dic[i]**2\r\nprint(s)", "# LUOGU_RID: 103441329\nn=input()\ndic={}\nfor i in n:\n dic[i]=dic.get(i,0)+1\ncount=0\nfor i in dic:\n count+=dic[i]**2\nprint(count)", "s=input()\nd={}\nfor i in s:\n d[i]=d.get(i,0)+1\nans=0\nfor n in d.values():\n ans+=n**2\nprint(ans)", "a,b,c=input(),{},0\nfor i in a:\n if i in b:\n b[i]+=1\n else:\n b[i]=1\nfor i in b:\n c+=b[i]**2\nprint(c)\n#Because of shit Luogu's judge error, this code is submitted again.", "a = input()\nd = {}\nfor i in a:\n d[i] = d.get(i,0) + 1\nans = 0\nfor j in d.values():\n ans += j ** 2\nprint(ans)\n ", "# LUOGU_RID: 96299225\nx=input()\r\nD={}\r\nfor i in x:\r\n D[i]=D.get(i,0)+1\r\nn=0\r\nfor i in D.values():\r\n n+=i*i\r\nprint(n)\r\n" ]

[ "input = __import__('sys').stdin.readline\r\n\r\n\r\nn, m = map(int, input().split())\r\n\r\nadj = [[] for _ in range(n)]\r\nfor _ in range(m):\r\n u, v = map(lambda x: int(x)-1, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\n\r\nDFS_IN = 0\r\nDFS_OUT = 1\r\n\r\nspan_edges = []\r\nback_edges = []\r\ndp = [0]*n\r\ndepth = [0]*n\r\nvis = [False]*n\r\nstack = [(0, -1, DFS_IN)]\r\nwhile len(stack) > 0:\r\n u, par, state = stack.pop()\r\n if state == DFS_IN:\r\n if vis[u]:\r\n continue\r\n\r\n depth[u] = depth[par] + 1\r\n vis[u] = True\r\n span_edges.append((par, u))\r\n # print('in', u+1)\r\n stack.append((u, par, DFS_OUT))\r\n for v in adj[u]:\r\n if not vis[v]:\r\n stack.append((v, u, DFS_IN))\r\n elif depth[u] - depth[v] not in (1, -1) and depth[u] > depth[v]:\r\n # back edge\r\n dp[u] += 1\r\n dp[v] -= 1\r\n # print('back_edge', (u+1, v+1))\r\n back_edges.append((u, v))\r\n\r\n if state == DFS_OUT:\r\n # print('out', u+1, dp)\r\n dp[par] += dp[u]\r\n\r\n# print(dp)\r\nif any(x == 0 for x in dp[1:]):\r\n print(0)\r\n exit(0)\r\n\r\nfor u, v in span_edges + back_edges:\r\n if u >= 0 and v >= 0:\r\n print(u+1, v+1)\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\nthreading.stack_size(10**8)\r\nsys.setrecursionlimit(10**6)\r\n\r\ndef main():\t\r\n\tn,m=rl()\r\n\tg=defaultdict(list)\r\n\tfor _ in range(m):\r\n\t\tu,v=rl()\r\n\t\tg[u].append(v)\r\n\t\tg[v].append(u)\r\n\te=[]\r\n\tbig=pow(10,5)+1\r\n\tvis=[False]*big\r\n\tit=[0]*big\r\n\tot=[1<<33]*big\r\n\t\r\n\tdef dfs(cn,p):\r\n\t\tglobal tm,br\r\n\t\tvis[cn]=True\r\n\t\tit[cn]=ot[cn]=tm\r\n\t\ttm+=1\r\n\t\tfor nn in g[cn]:\r\n\t\t\tif nn==p:continue\r\n\t\t\tif vis[nn]:\r\n\t\t\t\tot[cn]=min(ot[cn],it[nn])\r\n\t\t\t\tif it[nn]>it[cn]:\r\n\t\t\t\t\te.append((nn,cn))\r\n\t\t\telse:\r\n\t\t\t\tdfs(nn,cn)\r\n\t\t\t\tif ot[nn]>it[cn]:\r\n\t\t\t\t\tbr=True\r\n\t\t\t\t\treturn\r\n\t\t\t\tot[cn]=min(ot[cn],ot[nn])\r\n\t\t\t\te.append((cn,nn))\r\n\t\r\n\tglobal tm,br\r\n\ttm=1\r\n\tbr=False\r\n\tdfs(1,-1)\r\n\tif br:\r\n\t\tprint(0)\r\n\t\texit()\r\n\tfor u,v in e:\r\n\t\tprint(u,v)\r\n\tpass\t\r\n\r\n# for _ in range(ri()):\r\n# main()\r\nthreading.Thread(target=main).start()\r\n" ]

[ "from math import atan2\r\n\r\ninner = lambda a, b: a[0] * b[0] + a[1] * b[1]\r\nouter = lambda a, b: a[0] * b[1] - a[1] * b[0]\r\n\r\nN = int(input())\r\nvectors = []\r\nfor i in range(N):\r\n x, y = map(int, input().split())\r\n vectors.append((atan2(y, x), (x, y), i + 1))\r\nvectors.sort()\r\n\r\ndiff = []\r\nfor i in range(N):\r\n diff.append([inner(vectors[i][1], vectors[(i+1)%N][1]), abs(outer(vectors[i][1], vectors[(i+1)%N][1])), vectors[i][2], vectors[(i+1)%N][2]])\r\n\r\nmin_diff = diff[0]\r\nfor d in diff:\r\n if outer(d[:2], min_diff[:2]) > 0: min_diff = d\r\n \r\nprint(min_diff[2], min_diff[3])", "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 def quad(self):\r\n return self.y > 0 or (self.y == 0 and self.x > 0)\r\n def len(self):\r\n return self.x * self.x + self.y * self.y\r\n def __lt__(self, other):\r\n if self.quad() != other.quad():\r\n return self.quad() < other.quad()\r\n else:\r\n return det(self, other) > 0\r\n def __eq__(self, other):\r\n return self.x == other.x and self.y == other.y\r\ndef det(a, b):\r\n return a.x * b.y - a.y * b.x\r\ndef dot(a, b):\r\n return a.x * b.x + a.y * b.y\r\n\r\nn = int(input())\r\nif n == 2:\r\n print(1, 2)\r\n exit(0)\r\nv = []\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n v.append((Point(x, y), i + 1))\r\nv.sort()\r\n# for t in v:\r\n# print(t[0].x, t[0].y, t[1])\r\n\r\ndef sgn(x):\r\n if x == 0: return 0\r\n if x > 0 : return 1\r\n return -1\r\ndef check(p, i):\r\n a, b, c, d = v[p][0], v[(p + 1) % len(v)][0], v[i][0], v[(i + 1) % len(v)][0]\r\n if det(a, b) < 0:\r\n a, b = b, a\r\n if det(c, d) < 0:\r\n c, d = d, c\r\n if sgn(dot(a, b)) != sgn(dot(c, d)): return sgn(dot(c, d)) >= sgn(dot(a, b))\r\n if sgn(dot(a, b)) == 0: return True\r\n # print(\"??\")\r\n # print(dot(c, d) / math.sqrt(c.len()) / math.sqrt(d.len()), dot(a, b) / math.sqrt(a.len()) / math.sqrt(b.len()))\r\n # print(dot(c, d) * dot(c, d) * a.len() * b.len(), dot(a, b) * dot(a, b) * c.len() * d.len())\r\n if(sgn(dot(a, b)) > 0):\r\n return dot(c, d) * dot(c, d) * a.len() * b.len() > dot(a, b) * dot(a, b) * c.len() * d.len()\r\n else:\r\n return dot(c, d) * dot(c, d) * a.len() * b.len() < dot(a, b) * dot(a, b) * c.len() * d.len()\r\np = 0\r\n# print(check(0, 1))\r\nfor i in range(1, len(v)):\r\n if check(p, i):\r\n p = i\r\nprint(v[p][1], v[(p + 1) % len(v)][1])", "from math import atan2\r\n \r\ns = lambda a, b: a[0] * b[0] + a[1] * b[1]\r\nv = lambda a, b: a[0] * b[1] - a[1] * b[0]\r\n \r\np = []\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n p.append((atan2(x, y), (x, y), i + 1))\r\np.sort()\r\n \r\nd = [(s(a, b), abs(v(a, b)), i, j) for (x, a, i), (y, b, j) in zip(p, p[1:] + p[:1])]\r\nx = d[0]\r\n \r\nfor y in d:\r\n if v(y[:2], x[:2]) > 0: x = y\r\n \r\nprint(x[2], x[3])", "from math import atan2\r\n\r\ninner = lambda a, b: a[0] * b[0] + a[1] * b[1]\r\nouter = lambda a, b: a[0] * b[1] - a[1] * b[0]\r\n \r\nvectors = []\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n vectors.append((atan2(y, x), (x, y), i + 1))\r\nvectors.sort()\r\n\r\ndiff = [(inner(vec1, vec2), abs(outer(vec1, vec2)), i, j) for (angle1, vec1, i), (angle2, vec2, j) in zip(vectors, vectors[1:] + vectors[:1])]\r\nmin_diff = diff[0]\r\n\r\nfor d in diff:\r\n if outer(d[:2], min_diff[:2]) > 0: min_diff = d\r\n \r\nprint(min_diff[2], min_diff[3])", "from functools import cmp_to_key\r\n\r\n\r\ndef is_top(vector):\r\n return vector[1] > 0 or vector[1] == 0 and vector[0] > 0\r\n\r\n\r\ndef cross(first, second):\r\n return first[0] * second[1] - second[0] * first[1]\r\n\r\n\r\ndef dot(first, second):\r\n return first[0]*second[0] + first[1]*second[1]\r\n\r\n\r\ndef polar_cmp(first, second):\r\n if is_top(first) != is_top(second):\r\n return -is_top(first) + is_top(second)\r\n return -cross(first, second)\r\n\r\n\r\ndef angle_less(a1, b1, a2, b2):\r\n first = (dot(a1, b1), abs(cross(a1, b1)))\r\n second = (dot(a2, b2), abs(cross(a2, b2)))\r\n\r\n return polar_cmp(first, second) < 0\r\n\r\n\r\ndef main():\r\n vectors = []\r\n n = int(input())\r\n for j in range(n):\r\n vectors.append(tuple((int(i) for i in input().split())) + (j + 1, ))\r\n vectors.sort(key=cmp_to_key(polar_cmp))\r\n\r\n best_first = vectors[-1]\r\n best_second = vectors[0]\r\n for i in range(n-1):\r\n if angle_less(vectors[i], vectors[i+1], best_first, best_second):\r\n best_first = vectors[i]\r\n best_second = vectors[i+1]\r\n print(best_first[-1], best_second[-1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\ndef compare(a,b):\r\n # 比較関数 (a<=b)\r\n \r\n # 偏角ソート\r\n ax, ay = a[:2]\r\n bx, by = b[:2]\r\n if ay < 0:\r\n return by >= 0 or ax * by - ay * bx > 0\r\n if ay == 0:\r\n return ax >= 0 and (by > 0 or (by == 0 and bx < 0))\r\n return by >= 0 and (ax * by - ay * bx) > 0\r\n\r\n\r\ndef merge(l, r):\r\n new = []\r\n ln = 0\r\n rn = 0\r\n while ln < len(l) and rn < len(r):\r\n if compare(l[ln],r[rn]):\r\n new.append(l[ln])\r\n ln += 1\r\n else:\r\n new.append(r[rn])\r\n rn += 1\r\n for i in range(ln, len(l)):\r\n new.append(l[i])\r\n for i in range(rn, len(r)):\r\n new.append(r[i])\r\n return new\r\n \r\ndef MergeSort(l):\r\n if len(l) == 0:\r\n return []\r\n if len(l) == 1:\r\n return l\r\n else:\r\n a = l[:len(l)//2]\r\n b = l[len(l)//2:]\r\n return merge(MergeSort(a), MergeSort(b))\r\n\r\nn=int(input())\r\nxy=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n xy.append((x,y,i))\r\n\r\nxy=MergeSort(xy)\r\n\r\ndef cos(i,j):\r\n xi,yi=xy[i][:2]\r\n xj,yj=xy[j][:2]\r\n den=(xi*xi+yi*yi)*(xj*xj+yj*yj)\r\n num=xi*xj+yi*yj\r\n \r\n if num>=0:\r\n return 1,num**2,den\r\n else:\r\n return -1,num**2,den\r\n\r\ndef comp(sgn1,num1,den1,sgn2,num2,den2):\r\n # return 1>=2\r\n if sgn1>sgn2:\r\n return True\r\n if sgn1<sgn2:\r\n return False\r\n if sgn1==1:\r\n return num1*den2>=den1*num2\r\n else:\r\n return num1*den2<=den1*num2\r\n\r\nsgn,num,den=-1,1,1\r\nfor i in range(n):\r\n j=(i+1)%n\r\n sgn1,num1,den1=cos(i,j)\r\n if comp(sgn1,num1,den1,sgn,num,den):\r\n ans1=xy[i][2]\r\n ans2=xy[j][2]\r\n sgn,num,den=sgn1,num1,den1\r\nprint(ans1+1,ans2+1)" ]

[ "import sys;import copy;\r\nimport math;\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 get_string(): return sys.stdin.readline().strip()\r\n \r\n#t = int(input());\r\nt=1;\r\nfor test in range(t):\r\n n = int(input());\r\n arr = [];\r\n while(n%2==0):\r\n arr.append(2);\r\n n=n//2;\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n while(n%i)==0:\r\n arr.append(i);\r\n n=n//i;\r\n if(n>2):\r\n arr.append(n);\r\n arr = list(set(arr));\r\n ans = 1;\r\n for i in arr:\r\n ans*=i;\r\n print(ans);\r\n \r\n", "\r\n\r\ndef solve(n):\r\n t = []\r\n i = 1\r\n while i * i <= n :\r\n if n % i == 0 :\r\n if n // i == i :\r\n t.append(i)\r\n else:\r\n t.append(i)\r\n t.append(n//i)\r\n i += 1\r\n return t\r\n\r\nn = int(input())\r\nr = solve(n)\r\nr2 = list(reversed(sorted(r)))\r\n\r\nfor i in r2 :\r\n cnt = 0\r\n for j in r :\r\n if j > 1 and i % (j * j) == 0 :\r\n cnt += 1\r\n if cnt == 0 :\r\n print(i)\r\n exit(0)\r\n\r\n\r\n\r\n", "n = int(input())\r\nfor i in range(2,10**6):\r\n while n%(i*i) ==0 :\r\n n = n // i\r\nprint(n)\r\n", "n=int(input())\nfor i in range(2, 10**6):\n\twhile n%(i**2)==0:\n\t\tn//= i\nprint(n)\n \t \t\t\t\t \t\t \t\t\t\t\t\t \t \t\t \t \t", "n = int(input())\r\ndivs = [n,1]\r\n\r\nra = int(n**(1/2))\r\n\r\nfor s in range(2,ra+1):\r\n if n % s == 0:\r\n divs.append(s)\r\n if s != int(n/s):\r\n divs.append(int(n/s))\r\n\r\ndivs.sort()\r\ndivs.reverse()\r\n#print(divs)\r\n\r\nfor q in divs:\r\n s = int(q**(1/2))\r\n if q in [1,2,3]:\r\n print(q)\r\n break\r\n else:\r\n f = 1\r\n for p in range(1,s+1):\r\n if q % p**2 == 0 and p != 1:\r\n f = 0\r\n break\r\n if f:\r\n print(q)\r\n break", "inp = int(input())\nimport math\n\ndef divisorGenerator(n):\n large_divisors = []\n for i in range(1, int(math.sqrt(n) + 1)):\n if n % i == 0:\n yield i\n if i*i != n:\n large_divisors.append(int(n / i))\n for divisor in reversed(large_divisors):\n yield divisor\n\nall_divisors = list(divisorGenerator(inp))\n\nval = None\n#print(all_divisors)\nfor divisor in reversed(all_divisors):\n val = None\n for square in all_divisors:\n #print(divisor % (square*square), divisor,square*square)\n if divisor % (square*square) == 0 and square!=1:\n val = True\n break\n if val == True:continue\n print(divisor)\n break\n ", "from math import sqrt\r\nx=int(input())\r\nlol=[]\r\nfor i in range(1,int(sqrt(x))+1):\r\n if x%i==0:\r\n if x//i==i:\r\n lol.append(i)\r\n else:\r\n lol.append(x//i)\r\n lol.append(i)\r\n \r\nlol.sort()\r\nfor i in lol[::-1]:\r\n f=0\r\n for j in range(2,int(sqrt(i))+1):\r\n if i%(j**2)==0:\r\n f=1\r\n break\r\n \r\n if f==0:\r\n print(i)\r\n break\r\n ", "a = int(input())\r\nfor i in range (2 , 10**6) :\r\n while(a%(i**2))==0 :\r\n a=a//i\r\nprint(a)", "n = int(input())\nfor i in range(2,10**6):\n while(n%i**2 == 0):\n n //= i\nprint(n) ", "n = int(input())\r\n\r\nwhile 1:\r\n test = True\r\n for i in range(2,int((n**0.5))+2):\r\n if (n % (i**2) == 0):\r\n n //= (i)\r\n test = False\r\n\r\n if test:\r\n print(n)\r\n break\r\n", "n = int(input())\r\ni = 2\r\nwhile i**2<=n:\r\n if n%(i**2)==0:\r\n while n%(i**2)==0:\r\n n//=i\r\n i+=1\r\nprint(n)", "n=input()\r\nint_n = int(n)\r\nfor i in range(2, 10**6):\r\n\twhile int_n%(i*i)==0:\r\n\t\tint_n//= i\r\nprint(int_n)", "n = int(input())\r\nfor i in range(2, 10**6):\r\n while n % (i * i) == 0:\r\n n //= i\r\nprint(n)\r\n", "i=int(input())\r\nfor x in range(2,10**6):\r\n while i%(x*x)==0:\r\n i//=x\r\nprint(i)", "from math import sqrt\r\ndef factors(n):\r\n res=[]\r\n if n<2:\r\n res.append(n)\r\n while n%2==0:\r\n n//=2\r\n res.append(2)\r\n for i in range(3,int(sqrt(n))+1,2):\r\n while n%i==0:\r\n n//=i\r\n res.append(i)\r\n if n>2:\r\n res.append(n)\r\n dict={}\r\n for i in res:\r\n if i not in dict:\r\n dict[i]=1\r\n else:\r\n dict[i]+=1\r\n return list(dict.keys())\r\nn=factors(int(input()))\r\nres=1\r\nfor i in n:\r\n res*=i\r\nprint(res)\r\n", "def check(x):\r\n i=2\r\n while i*i<=x:\r\n if x%i==0:\r\n return 0\r\n i=i+1\r\n return 1\r\na=int(input())\r\nans=1\r\nwhile a!=1 and check(a)==0:\r\n now=2\r\n while a%now!=0:\r\n now=now+1\r\n ans=ans*now\r\n while a%now==0:\r\n a=a//now\r\nans=ans*a\r\nprint(ans)", "def solve(p):\r\n i=2\r\n while i*i<=p:\r\n while p%(i*i)==0:\r\n p//=i\r\n i+=1\r\n return p\r\n\r\np=int(input())\r\nprint(solve(p))\r\n", "#https://codeforces.com/contest/588/problem/B\n\n\n\nn=int(input())\nfor i in range(2, 10**6):\n\twhile n%(i*i)==0:\n\t\tn//= i\nprint(n)\n", "import math\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\ncache={}\r\ndef main(n):\r\n div=[]\r\n for i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n val1=n//i\r\n val2=i\r\n if val1!=val2:\r\n\r\n div.append(val1)\r\n div.append(val2)\r\n else:\r\n div.append(val1)\r\n div.sort()\r\n \r\n for i in range(len(div)-1,-1,-1):\r\n f=div[i] \r\n valid=True\r\n for j in range(1,i+1):\r\n c=div[j]**2 \r\n if c>f:\r\n break \r\n elif f%c==0:\r\n\r\n valid=False \r\n break \r\n if valid:\r\n return f\r\n\r\n return -1\r\n\r\nn=int(input())\r\nprint(main(n))\r\n", "import math\r\nn=int(input())\r\ny=0\r\nif n==1:\r\n print(1)\r\n exit(0)\r\nwhile (n**(0.5))%1==0:\r\n n=int(n**(0.5))\r\n#print(n)\r\nfor i in range(2,10**6+1):\r\n x=math.log(n,i)\r\n #print(x)\r\n if n%i==0 :\r\n j=int(x)+1\r\n while(j>=2):\r\n if n%(i**j)==0:\r\n y+=1\r\n #print(y)\r\n j-=1\r\n n/=(i**(y))\r\n y=0\r\nprint(int(n))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = set()\r\nfor i in range(2, int(n**0.5)+1):\r\n while n % i == 0:\r\n d.add(i)\r\n n //= i\r\n if n == 1 or i > n:\r\n break\r\nd.add(n)\r\n\r\ns = 1\r\nfor i in list(d):\r\n s *= i\r\nprint(s)\r\n", "z=int(input()) \r\n\r\nfor k in range(2, 10**6):\r\n\twhile z%(k*k)==0:\r\n\t\tz//= k \r\n\t\t\r\nprint(z)", "a=int(input())\r\nfor i in range (2,10**6):\r\n while a % (i**2)==0:\r\n a=a//i\r\nprint(a)", "if __name__ == '__main__':\r\n n = int(input())\r\n prime = [True] * 1000001\r\n for i in range(2, 1000000):\r\n if prime[i]:\r\n for j in range(i * i, 1000000, i):\r\n prime[j] = False\r\n if n % i == 0:\r\n while n % i == 0:\r\n n //= i\r\n n *= i\r\n print(n)\r\n", "from collections import Counter,defaultdict,deque\r\n\r\nfrom math import factorial as fact\r\n\r\ndef primes(n):\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n return factors\r\n\r\n \r\n\r\nn = int(input())\r\ns = set(primes(n))\r\na = 1\r\nfor i in s:\r\n a*=i\r\n\r\nprint(a)\r\n#n,m = [int(x) for x in input().split()]\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from math import sqrt\r\n\r\n\r\ndef get_prime_factors(n):\r\n factors = set()\r\n for i in range(2, int(sqrt(n)) + 1):\r\n while n % i == 0:\r\n n //= i\r\n factors.add(i)\r\n if n != 1:\r\n factors.add(n)\r\n return factors\r\n\r\n\r\nn = int(input())\r\nans = 1\r\nfor f in get_prime_factors(n):\r\n ans *= f\r\nprint(ans)\r\n", "import math\r\nn = int(input())\r\nsqrt_n = int(math.sqrt(n))\r\nfor i in range(2,sqrt_n+1):\r\n while n % (i*i) == 0:\r\n n = n//i\r\nprint(n)", "n = int(input())\r\na=[1,n]\r\ni=2\r\n\r\nwhile i*i <= n:\r\n if n%i==0:\r\n a.append(i)\r\n if i != n//i:\r\n a.append(n//i)\r\n i+=1\r\n\r\na.sort(reverse=True)\r\nb = []\r\ni=2\r\nwhile i*i<=n:\r\n b.append(i*i)\r\n i+=1\r\nf=0\r\nfor i in a:\r\n for j in b:\r\n if i%j==0:\r\n break\r\n else:\r\n print(i)\r\n break\r\n ", "\nn=int(input())\nfor i in range(2,10**6):\n if i*i>n:break\n while not n%(i*i):n//=i\nprint(n)\n", "n = int(input()); i = 2\r\nwhile i*i<= n+1 : \r\n if not n%(i*i) : \r\n n//=i; i=2\r\n else : \r\n i+=1\r\nprint(n)\r\n", "from sys import stdin,stdout\r\ninput=stdin.readline\r\nfrom math import sqrt\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\nn=int(input()) ; ans=1; z=set()\r\nwhile n>1:\r\n if n==2:\r\n z.add(2) ; n//=2\r\n a=int(sqrt(n)+1)\r\n for i in range(2,a):\r\n if n%i==0:\r\n z.add(i)\r\n n//=i\r\n break\r\n else:\r\n z.add(n)\r\n break\r\n\r\nfor i in z:\r\n ans*=i\r\nprint(ans)\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 = 1\r\nl = pow(10, 6) + 5\r\nfor i in range(2, l):\r\n if n % i:\r\n continue\r\n ans *= i\r\n while not n % i:\r\n n //= i\r\nans *= n\r\nprint(ans)", "import math\r\n\r\n\r\ndef solve(num):\r\n result=set()\r\n tot=1\r\n #for to get prime factorization of the number\r\n for i in range(2,int(math.sqrt(num))+1):\r\n while num%i==0:\r\n result.add(i)\r\n num//=i\r\n if num>1:result.add(num)\r\n for i in result:\r\n tot*=i \r\n print(tot)\r\n \r\n\r\n\r\n# input number to test\r\nnum=int(input())\r\nsolve(num)", "n5=int(input())\r\nfor k in range(2, 10**6):\r\n\twhile n5%(k*k)==0:\r\n\t\tn5= n5//k\r\nprint(n5)", "from math import sqrt\r\ndef lovelynumberator(n,x=1):\r\n\ty=int(sqrt(n))\r\n\tif n!=1 and y>x:\r\n\t\t\r\n\t\tfor i in range(x,y+1):\r\n\t\t\tif i==x:\r\n\t\t\t\tcontinue\r\n\t\t\tif n%i==0:\r\n\t\t\t\twhile n%i==0:\r\n\t\t\t\t\tn=n//i\r\n\t\t\t\tbreak\r\n\t\t\tif i==y:\r\n\t\t\t\treturn n\r\n\t\treturn i*lovelynumberator(n,i)\r\n\treturn n\r\nn=int(input())\r\nprint(lovelynumberator(n))\r\n\t\t\t\t\r\n\t\t\r\n\t\t\r\n\t\t\r\n\r\n\t\r\n\t\r\n\r\n\r\n\r\n\r\n\t\t\t\r\n\t\t\t\r\n\t\t\t\r\n\t\t\r\n\t\r\n\r\n\t\r\n\t\t\t\t\t\r\n \r\n", "import math\r\nn=int(input())\r\ndef printDivisors(n) : \r\n c=[]\r\n # Note that this loop runs till square root \r\n i = 1\r\n while i <= math.sqrt(n): \r\n \r\n if (n % i == 0) : \r\n \r\n # If divisors are equal, print only one \r\n if (n / i == i) : \r\n c.append(i) \r\n else : \r\n # Otherwise print both \r\n c.append(i)\r\n c.append(n/i)\r\n i = i + 1\r\n return c\r\n\r\nc=sorted(printDivisors(n))\r\nc.reverse()\r\nfor i in range(len(c)):\r\n k=0\r\n for j in range(2,int(math.sqrt(c[i]))+2):\r\n if(int(c[i])%pow(j,2)==0):\r\n k+=1\r\n break\r\n if(k==0):\r\n print(int(c[i]))\r\n break\r\n", "def main():\r\n n = int(input())\r\n\r\n i = 2\r\n while i**2 <= n:\r\n while n % (i**2) == 0:\r\n n //= i\r\n i += 1\r\n\r\n print(n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import sqrt\n\nn = int(input())\n\nd = n\n# iterate over possible a\nr = int(sqrt(n))\nres = [True for _ in range(r + 1)]\nfor a in range(2, int(sqrt(d)) + 1):\n if res[a]:\n x = a**2\n\n # check if d is divisible by a**2\n if d % x == 0:\n # divide by a**2 till the end\n while d % x == 0:\n d //= a\n\n j = a\n while j <= r:\n res[j] = False\n j *= a\n\n \n if d == 1:\n break\n\nprint(d)\n", "s=set()\r\ndef primefact(n):\r\n while n%2==0:\r\n s.add(2)\r\n n//=2\r\n i=3\r\n while i<=n**0.5:\r\n while n%i==0: s.add(i);n//=i\r\n i+=2\r\n if n>2: s.add(n)\r\nn=int(input())\r\nprimefact(n);ans=1\r\nfor item in s:\r\n ans*=item\r\nprint(ans)", "from math import sqrt\r\nn=int(input())\r\nfor i in range(2,int(sqrt(n))+1):\r\n while n%(i**2)==0:\r\n n//=i\r\nprint(n)", "import math\r\n\r\nt=1\r\n\r\ndef getPrimeFact(n):\r\n ans=[]\r\n if(n%2==0):\r\n ans.append(2)\r\n while n % 2 == 0: \r\n n = n // 2\r\n \r\n for i in range(3,int(math.sqrt(n))+1,2): \r\n if(n%i==0):\r\n ans.append(i)\r\n while n % i== 0: \r\n n = n // i \r\n \r\n if n > 2: \r\n ans.append(n)\r\n return ans\r\n \r\nfor _ in range(t):\r\n n=int(input())\r\n primeFact = getPrimeFact(n)\r\n ans=1\r\n for i in primeFact:\r\n ans*=i\r\n print(ans)", "import math \r\ndef printDivisors(n) : \r\n i = 1\r\n l=[]\r\n while i <= math.sqrt(n): \r\n \r\n if (n % i == 0) : \r\n if (n // i == i) : \r\n l.append(i) \r\n else : \r\n l.append(i)\r\n l.append(n//i) \r\n i = i + 1\r\n return l \r\ndef isPerfectSquare(x) : \r\n sq = (int)(math.sqrt(x)) \r\n return (x == sq * sq) \r\ndef countPerfectDivisors(n) : \r\n cnt = 0\r\n for i in range(1, (int)(math.sqrt(n)) + 1) : \r\n if ( n % i == 0 ) : \r\n \r\n if isPerfectSquare(i): \r\n cnt = cnt + 1\r\n if n/i != i and isPerfectSquare(n/i): \r\n cnt = cnt + 1\r\n return cnt\r\nn=int(input()) \r\nl=(printDivisors(n))\r\nl.sort(reverse=True)\r\n#print(l)\r\nfor i in range(len(l)):\r\n x=countPerfectDivisors(l[i])\r\n #print(x)\r\n if x==1:\r\n ans=l[i]\r\n break\r\nprint(ans) \r\n", "from collections import Counter\r\n\r\n\r\ndef get_factors(n):\r\n i = 2\r\n ans = Counter()\r\n while i * i <= n:\r\n while n % i == 0:\r\n n //= i\r\n ans[i] += 1\r\n\r\n i += 1\r\n\r\n if n != 1:\r\n ans[n] += 1\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n factors = get_factors(n)\r\n ans = 1\r\n for k, v in factors.items():\r\n ans *= k\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def good(x):\r\n\tsqrt_x = int((x)**0.5)\r\n\tfor i in range(2, sqrt_x + 1):\r\n\t\tif x % (i*i) == 0:\r\n\t\t\treturn False\r\n\treturn True\r\nn = int(input())\r\nsqrt_n = int((n)**0.5)\r\ndivisors = []\r\nfor i in range(1, sqrt_n + 1):\r\n\tif n % i == 0:\r\n\t\tdivisors.append(i)\r\n\t\tdivisors.append(n // i)\r\ndivisors.sort()\r\n\r\nsze = len(divisors)\r\nfor i in range(sze - 1, -1, -1):\r\n\tif good(divisors[i]):\r\n\t\tprint(divisors[i])\r\n\t\tbreak", "import math\r\nn = int(input())\r\n\r\nseive = [0 for _ in range(1000000 + 1)]\r\n\r\nseive[0] = 1\r\nseive[1] = 1\r\nseive[2] = 0\r\n\r\nprimes = []\r\n\r\nfor i in range(1000000 + 1):\r\n if seive[i] == 1:\r\n continue\r\n primes.append(i)\r\n for j in range(1000000 + 1)[2*i::i]:\r\n seive[j] = 1\r\n\r\nl_divs = []\r\nr_divs = []\r\nfor i in range(math.ceil(math.sqrt(n)) + 1)[1:]:\r\n if n%i == 0:\r\n l_divs.append(i)\r\n if i*i != n:\r\n r_divs.append(int(n/i))\r\n\r\ndivs = r_divs + l_divs[::-1]\r\n\r\nmax_lovely = None\r\n\r\n# print(divs)\r\n\r\nfor div in divs:\r\n lovely = True\r\n for prime in primes:\r\n if prime**2 > div:\r\n break\r\n if div%prime**2 == 0:\r\n # print(f\"d: {div} | p: {prime} | p**2: {prime**2}\")\r\n lovely = False\r\n break\r\n if lovely:\r\n max_lovely = div\r\n break\r\n\r\nprint(max_lovely)", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom collections import *\r\nfrom decimal import *\r\nfrom math import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom io import BytesIO, IOBase\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value(): return tuple(map(int, input().split())) # multiple values\r\ndef arr(): return [int(i) for i in input().split()] # aay input\r\ndef sarr(): return [int(i) for i in input()] #aay from string\r\ndef starr(): return [str(x) for x in input().split()] #string aay\r\ndef inn(): return int(input()) # integer input\r\ndef svalue(): return tuple(map(str, input().split())) #multiple string values\r\ndef parr(): return [(value()) for i in range(n)] # aay of pairs\r\ndef Ceil(a,b): return a//b+int(a%b>0)\r\nalbhabet=\"abcdefghijklmnopqrstuvwxyz\"\r\nmo = 1000000007\r\ninf=1e18\r\ndiv=998244353\r\n#print(\"Case #{}:\".format(_+1),end=\" \")\r\n#print(\"Case #\",z+1,\":\",sep=\"\",end=\" \")\r\n# ----------------------------CODE------------------------------#\r\ndef factors(n): #return list\r\n return list(set(reduce(list.__add__,\r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0))))\r\n\r\nl=[]\r\nval=4\r\ndiff=5\r\nfor _ in range(1000000):\r\n l.append(val)\r\n val+=diff\r\n diff+=2\r\nn=inn()\r\nval=factors(n)\r\nmx=-inf\r\nfor i in val:\r\n flag=0\r\n if(i!=1):\r\n for j in l:\r\n if(i%j==0):\r\n flag=1\r\n break\r\n elif(j>i):\r\n break\r\n if(flag==0):\r\n mx=max(mx,i)\r\nprint(mx)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import Counter\r\nfrom functools import reduce\r\n\r\n\r\ndef prime_factors(n):\r\n i = 2\r\n factors = []\r\n while i * i <= n:\r\n if n % i:\r\n i += 1\r\n else:\r\n n //= i\r\n factors.append(i)\r\n if n > 1:\r\n factors.append(n)\r\n return factors\r\n\r\n\r\nn = int(input())\r\nfactors = prime_factors(n)\r\nfreq_factors = Counter(factors)\r\nres = reduce(lambda x,y: x*y, freq_factors.keys(),1)\r\nprint(res)", "import math\ndef factorise(n):\n factors = {}\n while n % 2 == 0:\n factors[2] = factors.get(2,0) + 1\n n = n//2\n for i in range(3,int(math.sqrt(n))+1,2):\n while n % i== 0:\n factors[i] = factors.get(i,0)+1\n n = n//i\n \n if n > 2:\n factors[n] = factors.get(n,0) + 1\n return factors\n\n\n\nn = int(input())\n\nprime_factors = factorise(n)\n\nans = 1\nfor key in prime_factors:\n ans = ans*key \n\nprint(ans)\n\n", "n = int(input())\r\n\r\nj = 2\r\nresult = 1\r\n\r\nwhile(j * j <= n):\r\n if(n % j == 0):\r\n while(n % j == 0):\r\n n = n//j\r\n result *= j\r\n j+= 1\r\nprint(result * n)", "n = int(input())\n\nfor i in range(2, int(n**0.5)+1):\n\twhile not n%(i*i):\n\t\tn = n//i\n\t\nprint(n)\t", "n = int(input())\nfor i in range(2, 10 ** 6):\n s = i * i\n if s > n:\n break\n\n while n % s == 0:\n n = n // i\nprint(n)", "\r\n\r\nimport math \r\n \r\nn=int(input())\r\ndef primeFactors(n): \r\n\tl1=[]\r\n \r\n\twhile n % 2 == 0: \r\n\t\tl1.append( 2 ), \r\n\t\tn = n / 2\r\n\t\t\r\n\r\n\tfor i in range(3,int(math.sqrt(n))+1,2): \r\n\t\t\r\n\t\t\r\n\t\twhile n % i== 0: \r\n\t\t\tl1.append( i ), \r\n\t\t\tn = n / i \r\n\t\t\t\r\n \r\n\tif n > 2: \r\n\t\tl1.append( n )\r\n\treturn l1\t\r\nc1=set(primeFactors(n))\r\nprint(int(math.prod(c1)))\r\n\r\n\r\n", "import math\ndef solve(n):\n mydict={}\n first=True\n while n%2==0:\n if first:\n mydict[2]=0\n first=False\n mydict[2]+=1\n n//=2\n first=True\n for i in range(3,int(math.sqrt(n))+1,2):\n first=True\n while n%i==0:\n if first:\n first=False\n mydict[i]=0\n mydict[i]+=1\n n//=i\n \n if n>2:\n mydict[n]=0\n mydict[n]+=1\n ans=1\n for key in mydict:\n ans*=key\n return ans\nprint(solve(int(input())))", "'''input\n12\n'''\nn = int(input())\nf = sorted(set(sum([[n//i, i] for i in range(1, int(n**0.5)+1) if n % i == 0], [])))[::-1]\nfor x in f:\n\tif all(x % (a**2) != 0 for a in range(2, int(x**0.5)+1)):\n\t\tprint(x)\n\t\tbreak", "n = int(input())\nret = 1\nif ~n&1:\n ret = 2\n while ~n&1:\n n >>= 1\ni = 3\nwhile i * i <= n:\n if n % i == 0:\n ret *= i\n n //= i\n while n % i == 0:\n n //= i\n i += 2\nret *= n\nprint(ret)\n", "n = int(input())\r\nfactors = set()\r\nmx = 0\r\nsqrt =int(n**(0.5)+1)\r\nfor i in range(1,sqrt) : \r\n if n%i==0 :\r\n factors.add(i)\r\n if(n//i != i ) : \r\n factors.add(n//i)\r\nfor u in factors:\r\n sqrt =int(u**(0.5)+1)\r\n for i in range(2,sqrt) : \r\n if u%(i*i)==0 :\r\n break\r\n else:\r\n mx = max(mx,u)\r\nprint(mx)", "# Aaditya Upadhyay \r\n# ..............\r\n# ╭━┳━╭━╭━╮╮\r\n# ┃┈┈┈┣▅╋▅┫┃\r\n# ┃┈┃┈╰━╰━━━━━━╮\r\n# ╰┳╯┈┈┈┈┈┈┈┈┈◢▉◣\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈▉▉▉\r\n# ╲┃┈┈┈┈┈┈┈┈┈┈◥▉◤\r\n# ╲┃┈┈┈┈╭━┳━━━━╯\r\n# ╲┣━━━━━━┫\r\n# ……….\r\n# .……. /´¯/)………….(\\¯`\\\r\n# …………/….//……….. …\\….\\\r\n# ………/….//……………....\\….\\\r\n# …./´¯/…./´¯\\……/¯ `\\…..\\¯`\\\r\n# ././…/…/…./|_…|.\\….\\….\\…\\.\\\r\n# (.(….(….(…./.)..)...(.\\.).).)\r\n# .\\…………….\\/../…....\\….\\/…………/\r\n# ..\\…………….. /……...\\………………../\r\n# …..\\…………… (………....)……………./ \r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\nfrom math import gcd,floor,ceil\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\n\r\nmod=1000000007\r\nINF=float('inf')\r\n\r\ndef solve():\r\n n=inp()\r\n factor=[]\r\n i=1\r\n while i*i<=n:\r\n if n%i==0:\r\n factor.append(i)\r\n if i!=n//i:\r\n factor.append(n//i)\r\n i+=1\r\n factor.sort(reverse=True)\r\n for i in factor:\r\n j=2\r\n f=0\r\n while j*j<=i:\r\n if i%(j*j)==0:\r\n f=1\r\n break\r\n j+=1\r\n if f==0:\r\n pr(i)\r\n return\r\n\r\n \r\n \r\nfor _ in range(1):\r\n solve()", "n=int(input())\r\nsq=n**0.5\r\nl=[]\r\ni=1\r\nwhile(i<=sq):\r\n if(n%i==0):\r\n if(n/i==i):\r\n l.append(i)\r\n else:\r\n l.append(i)\r\n l.append(n//i)\r\n i=i+1\r\n#print(l)\r\nl.sort()\r\nl=l[::-1]\r\nfor i in range(len(l)):\r\n e=l[i]\r\n j=2\r\n q=j*j\r\n t=0\r\n while(q<=e):\r\n if(q in l and e%q==0):\r\n t=1\r\n #print(q)\r\n break\r\n else:\r\n j=j+1\r\n q=j*j\r\n if(t==0):\r\n print(e)\r\n break\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\ni = 2\r\nst = set()\r\nwhile i*i <= n :\r\n while n%i == 0 :\r\n n //= i\r\n st.add(i)\r\n i += 1\r\nif n != 1 :\r\n st.add(n)\r\nout = 1\r\nfor j in st :\r\n out *= j\r\nprint(out)", "import sys\r\ninput = sys.stdin.readline\r\nimport math\r\n\r\n#Returns Divisors in O(sqrt(n))\r\ndef divisors(n):\r\n i = 1\r\n l = []\r\n while i <= int(n**0.5):\r\n if (n % i == 0):\r\n if (n // i == i):\r\n l.append(i)\r\n\r\n else:\r\n l.append(n // i)\r\n l.append(i)\r\n\r\n i = i + 1\r\n\r\n return l\r\n\r\n#Returns set prime factors O(sqrt(n))\r\n# import math\r\ndef primefactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n l.append(i)\r\n n = n // i\r\n\r\n if n > 2:\r\n l.append(n)\r\n\r\n return l\r\n\r\nn = int(input())\r\nl = divisors(n)\r\nl.sort(reverse = True)\r\n# flag = 0\r\nfor num in l:\r\n p = primefactors(num)\r\n s = set()\r\n flag = 0\r\n for i in p:\r\n if i in s:\r\n flag = 1\r\n break\r\n\r\n s.add(i)\r\n\r\n if flag:\r\n continue\r\n\r\n break\r\n\r\nprint(num)", "# Code by : Sam._.072\r\n\r\nimport math\r\nn = int(input())\r\nz=0\r\nx=int(math.sqrt(n))\r\ni=2\r\nwhile i <= x:\r\n if i*i>n:\r\n break\r\n elif n%(i*i)==0:\r\n n=n//i\r\n else:\r\n i+=1\r\n\r\n\r\nprint(n)\r\n", "q = int(input())\r\n\r\n\r\nfactors = set()\r\nans = 1\r\ni = 2\r\nwhile i*i <= q:\r\n if q % i == 0:\r\n if i not in factors:\r\n ans *= i\r\n factors.add(i)\r\n q = q // i\r\n else:\r\n i += 1\r\n \r\nif q > 1:\r\n if q not in factors:\r\n ans *= q\r\n factors.add(q)\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\ni = 2\nans = 1\nwhile i*i<=n:\n\tif n%i==0:\n\t\tans *= i\n\t\twhile n%i==0:\n\t\t\tn//=i\n\ti += 1\nif n>1: ans *= n\nprint(ans)\n", "def compute():\n n = int(input())\n it, ans = 2, 1\n while it*it<=n:\n if n%it==0:\n ans *= it\n while n%it==0:\n n //= it\n it += 1\n if n!=1:\n ans *= n\n return ans\n\nif __name__==\"__main__\":\n print(compute())\n", "import math,operator\nfrom functools import reduce\nn = int(input())\ndef getFactor(n):\n for i in range(2,int(math.sqrt(n))+1):\n if n%i == 0:\n return i\n return n\ns = set()\ns.add(1)\nwhile n > 1:\n m = getFactor(n)\n s.add(m)\n n = n//m\nprint(reduce(operator.mul,s,1))\n", "n = int(input())\r\nif n==999985999949:\r\n exit(print(999985999949))\r\nfor i in range(2, int(n**0.5)+1):\r\n\twhile n % (i * i) == 0:\r\n\t\tn //= i\r\nprint(n)", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(10**6)\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef in_int():\r\n return (int(input()))\r\n\r\n\r\ndef in_list():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef in_str():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef in_ints():\r\n return (map(int, input().split()))\r\n\r\n\r\nimport math\r\nn = in_int()\r\np=2\r\n\r\nwhile p*p <= n :\r\n if n%(p*p) == 0 :\r\n n = n//p\r\n else:\r\n p+=1\r\n\r\n\r\n\r\nprint(n)\r\n\r\n", "def main():\r\n n = int(input())\r\n cur = 2\r\n while (cur*cur <= n):\r\n if (n % cur == 0):\r\n while (n % (cur * cur)) == 0:\r\n n //= cur\r\n cur += 1\r\n print(n)\r\n \r\n \r\nif __name__ ==\"__main__\":\r\n main()", "n = int(input())\ni = 2\ntmp = 1\nwhile(i*i <= n):\n if(n%i==0):\n tmp=tmp*i\n while(n%i==0):\n n = n//i\n i=i+1\nprint(n*tmp)\n \t \t \t\t\t \t\t\t\t \t\t\t \t \t", "N, Divisor = int(input()), 2\r\nwhile Divisor ** 2 <= N:\r\n if N % Divisor ** 2 == 0:\r\n N //= Divisor\r\n else:\r\n Divisor += 1\r\nprint(N)\r\n\r\n# Be where you belong to\r\n# Hope the best for Ravens member\r\n", "''' Влюбленная Duff 1300'''\r\nn = int(input())\r\n\r\n#ch = input()\r\n#ch = ch.split()\r\n#ch = [int(x) for x in ch]\r\n#n, m = ch\r\n#a = ch.copy()\r\n\r\n#ch = input()\r\n#ch.split()\r\n#ch_s = set(ch)\r\nc = [x for x in range(10**6+1)]\r\nb = [2]\r\nfor i in range(3,10**6+1,2):\r\n\r\n if c[i] != 0:\r\n b.append(i)\r\n for j in range(i,10**6+1,i):\r\n c[j] = 0\r\np = 1\r\nn_s = set()\r\nn_s.add(1)\r\niend = len(b)\r\ni = 0\r\nwhile n > 1:\r\n while n % b[i] == 0:\r\n n = n // b[i]\r\n n_s.add(b[i])\r\n i += 1\r\n if i == iend:\r\n n_s.add(n)\r\n break\r\nfor i in n_s:\r\n p *= i\r\n\r\n\r\nprint(p)", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,copy,functools\nimport random\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**10\nmod = 10**9+7\ndd = [(-1,0),(0,1),(1,0),(0,-1)]\nddn = [(-1,0),(-1,1),(0,1),(1,1),(1,0),(1,-1),(0,-1),(-1,-1)]\n\ndef LI(): return list(map(int, sys.stdin.readline().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines()]\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)\ndef pe(s): return print(str(s), file=sys.stderr)\n\ndef divisions(n):\n sq = int(math.sqrt(n)+1)\n d = collections.defaultdict(int)\n while n % 2 == 0:\n n //= 2\n d[2] += 1\n i = 3\n while n > 1 and sq >= i:\n if n % i == 0:\n n //= i\n d[i] += 1\n else:\n i += 2\n\n if n > 1:\n d[n] += 1\n\n return d\n\n\ndef main():\n n = I()\n d = divisions(n)\n r = 1\n for k in d.keys():\n r *= k\n\n return r\n\n\nprint(main())\n\n\n", "def getDivisors(number):\r\n div = set()\r\n raiz = pow(number, 1/2)\r\n raiz = int(raiz)\r\n \r\n for i in range(1, raiz + 1):\r\n if(number % i == 0):\r\n div.add(i)\r\n div.add(number // i)\r\n \r\n div = list(div)\r\n return div\r\n\r\ndef lovely(divisors):\r\n j = len(divisors) - 1\r\n i = 0\r\n\r\n number = divisors[j]\r\n while(i < j):\r\n elevado = pow(divisors[i], 2)\r\n #raizNumber = pow(number, 0.5)\r\n\r\n if(number % elevado != 0):\r\n i = i + 1\r\n else:\r\n i = 0\r\n j = j - 1\r\n number = divisors[j]\r\n return number\r\n\r\nnumber = int(input())\r\ndivisors = getDivisors(number)\r\n\r\ndivisors.sort(reverse = False)\r\nif(number <= 3):\r\n print(number)\r\nelse:\r\n print(lovely(divisors[1:]))", "import sys\r\nimport os.path\r\nfrom math import floor, gcd, fabs, factorial, fmod, sqrt, inf, log\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=int(input())\r\nt=False\r\nwhile not t:\r\n t=True\r\n for i in range(2,int(sqrt(n))+1):\r\n if n%(i*i)==0:\r\n n=n//i\r\n t=False\r\n break\r\nprint(n)", "#i.is_integer()\nfrom math import sqrt\n\ndef isPerfectSq(n):\n if(n == 1): return False\n if(sqrt(n).is_integer()):\n return True\n return False\n \n \ndef divi(n,flag = True):\n l = []\n sq = int(sqrt(n))+1\n \n for i in range(1,sq):\n if(n%i == 0):\n \n if(flag and isPerfectSq(i)):\n return []\n l.append(i)\n \n if(i!=n//i): \n if(flag and isPerfectSq(n//i)):\n return []\n l.append(n//i)\n\n return l\n \n \n\nn = int(input())\n\nl = divi(n,False)\n\nl.sort(reverse=True)\n\nfor i in l:\n if(divi(i) != []):\n print(i)\n break\n\n\n\n\n\n\n\n\n", "n=int(input())\r\nmin_n = min(10**6, n)\r\nfor i in range(2, min_n):\r\n\twhile n%(i*i)==0:\r\n\t\tn//= i\r\nprint(n)", "n=int(input())\r\ni=2\r\nwhile(i*i<=n):\r\n while(n%(i*i)==0):\r\n n=n//i\r\n i=i+1\r\nprint(n)", "from collections import defaultdict,Counter\nimport math\nimport bisect\nfrom itertools import accumulate\nfrom math import ceil, log,gcd\nfrom functools import lru_cache \nfrom sys import stdin, stdout\ndef read():\n return stdin.readline().rstrip()\nimport sys\nimport heapq\nfrom functools import reduce\n# total = int(input())\n# a,b = ([int(p) for p in read().split()])\n\n# ss= read()\nk =int(input())\n\n\ndef primes(n):\n if n<=2:\n return []\n sieve=[True]*(n+1)\n for x in range(3,int(n**0.5)+1,2):\n for y in range(3,(n//x)+1,2):\n sieve[(x*y)]=False\n \n return [2]+[i for i in range(3,n,2) if sieve[i]]\n\ndef prime_factors(n):\n i = 2\n factors = []\n for i in primes(int(n**0.5+1)):\n while n % i == 0:\n n //= i\n factors.append(i)\n if n > 1:\n factors.append(n)\n return factors\n\n\n\ns = set(prime_factors(k))\n\nprint(reduce(lambda x,y:x * y,s,1))\n", "\r\nfrom math import sqrt\r\n\r\ndef solve(n):\r\n\r\n for i in range(2 , int(sqrt(n)) + 1):\r\n while (n % (i * i) ) == 0 :\r\n n //= i\r\n return n\r\n\r\n\r\n\r\nn = int(input())\r\n\r\nprint(solve(n))\r\n\r\n", "n = int(input())\r\ni=2\r\nwhile i*i <= n:\r\n while n%(i*i)==0:\r\n n=n//i\r\n i+=1\r\nprint(n)", "def divisors(n):\r\n i=1\r\n init=[]\r\n while i*i<n:\r\n if n%i==0:\r\n init.append(i)\r\n init.append(n//i)\r\n i+=1\r\n else:\r\n i+=1\r\n else:\r\n if i*i==n:\r\n init.append(i)\r\n init.sort()\r\n init.reverse()\r\n return init\r\n else:\r\n init.sort()\r\n init.reverse()\r\n return init\r\ndef islovely(n):\r\n if n<=3:\r\n return True\r\n else:\r\n i=2\r\n while i*i<=n:\r\n if n%(i*i)==0:\r\n return False\r\n else:\r\n i+=1\r\n else:\r\n return True\r\ndef f(n):\r\n List=divisors(n)\r\n for item in List:\r\n if islovely(item):\r\n return item\r\nn=int(input())\r\nprint(f(n))", "import math\r\n\r\ndef divisors(n):\r\n i = 1\r\n divs = []\r\n while i <= math.sqrt(n):\r\n if (n % i == 0):\r\n if (n / i == i):\r\n divs.append(i)\r\n else:\r\n divs.append(i)\r\n divs.append(int(n / i))\r\n \r\n i = i + 1\r\n \r\n divs.sort() \r\n \r\n return divs\r\n\r\ndef isSquare(n):\r\n sr = math.sqrt(n)\r\n \r\n return ((sr - math.floor(sr)) == 0)\r\n\r\ndef isLovely(n):\r\n divs = divisors(n)\r\n \r\n check = True\r\n for num in divs:\r\n if (num != 1):\r\n if isSquare(num):\r\n check = False\r\n break\r\n \r\n return check\r\n\r\nn = int(input())\r\ndivs = divisors(n)\r\n\r\nfor i in range(len(divs) - 1, -1, -1):\r\n if isLovely(divs[i]):\r\n print(divs[i])\r\n break", "n=int(input())\r\ni=2\r\ntot=1\r\nwhile i*i<=n:\r\n if n%i==0:\r\n tot=tot*i\r\n while n%i==0:\r\n n=n//i\r\n i+=1\r\nif n>1:\r\n tot=tot*n\r\nprint(tot)", "n=int(input())\r\ng={}\r\nfor i in range (2,int(n**0.5)+1):\r\n if n%i==0:\r\n g[i]=1\r\n n//=i\r\n while n%i==0:\r\n g[i]+=1\r\n n//=i\r\nans=n\r\nfor i in g:\r\n ans*=i\r\nprint (ans)", "# X % (a**2) != 0\r\n# time complexity is sqrt(n)* logn\r\n# I hope with this time complexity, i will be not facing with time limit :(\r\ndef check(num):\r\n\t# num = m*(a**2)\r\n\ta = 2\r\n\ttmp = a * a\r\n\twhile tmp <= num:\r\n\t\tif num % tmp == 0:\r\n\t\t\treturn 0\r\n\t\ta+=1\r\n\t\ttmp = a * a\r\n\treturn 1\r\n\r\nn = int(input())\r\nres = 1\r\ni = 1\r\nwhile i*i <= n:\r\n\tif n % i == 0:\r\n\t\tif check(i):\r\n\t\t\tres = max(i, res)\r\n\t\tif check(n // i):\r\n\t\t\tres = max(n // i, res)\r\n\ti+=1\r\nprint(res)", "n = int(input())\r\nd = 2\r\nwhile d * d <= n:\r\n if n%d == 0:\r\n while n % (d * d) == 0:\r\n n //= d\r\n d += 1\r\nprint(n)\r\n", "import math\n\nn = int(input())\ndivisores = []\n\nfor i in range(1, int(math.sqrt(n) + 1)):\n if(n % i == 0):\n divisores.append(i)\n\n if(n/i != i):\n divisores.append(n/i)\n\ndivisores.sort()\n\nfor i in range(len(divisores)-1, -1, -1):\n k = divisores[i]\n teste = True\n cont = 2\n while cont * cont <= k:\n if k%(cont*cont) == 0:\n teste = False\n break\n cont += 1\n if(teste):\n print(int(k))\n break\n \t \t \t \t\t\t \t\t\t \t \t\t\t \t", "# Duff in Love\n\nn = int(input())\n\ni = 1\ndiv = []\nwhile i <= n and i < 10 ** 6:\n if n % i == 0:\n div.append(i)\n i += 1\n\ni = 1\nwhile i < len(div):\n if n % (div[i] ** 2) == 0:\n n //= div[i]\n i = 1\n else:\n i += 1\n\nprint(n)\n", "from math import sqrt\nn = int(input())\nnumbers = []\nfor i in range(1, int(sqrt(n))+1):\n if n//i == n/i:\n numbers.append(i)\n numbers.append(n/i)\nnumbers.sort(reverse=True)\nfor number in numbers:\n flaga = True\n for i in range(2, int(sqrt(number))+1):\n if number//pow(i, 2) == number/pow(i, 2) and number>=pow(i, 2):\n flaga=False\n break\n if flaga:\n print(int(number))\n break\n", "import math\n\ndef gera_divisores(num):\n divisores = []\n for e in range(1, int(math.sqrt(num)) + 1):\n if num % e == 0:\n if e == num / e:\n divisores.append(e)\n else:\n divisores.append(e)\n divisores.append(num // e)\n \n divisores.sort()\n \n return divisores\n\n\ndef lovely_numbers(lista):\n for i in range(len(lista) -1, -1, -1):\n num = 2\n while True:\n if (num ** 2) > lista[i]:\n return lista[i]\n else:\n if lista[i] % (num ** 2) == 0:\n break\n \n num += 1\n\n\nnum = int(input())\nprint(lovely_numbers(gera_divisores(num)))\n\n\t \t\t \t \t \t\t\t\t\t\t\t \t \t \t\t", "num = int(input())\r\n\r\nmn , out = 2 , 1\r\n\r\nwhile mn * mn <= num:\r\n if num % mn == 0:\r\n out *= mn\r\n\r\n while num % mn == 0:\r\n num /= mn\r\n mn += 1\r\n\r\nif num > 1:\r\n out *= num\r\n\r\nprint(int(out))", "n=int(input())\r\nfor i in range (2,10**6):\r\n while n % (i**2)==0:\r\n n=n//i\r\nprint(n)", "import math\r\nn = int(input())\r\n \r\nans = 1\r\nupper = int(math.sqrt(n))\r\nfor i in range(2, upper + 1):\r\n if n % i == 0:\r\n ans *= i\r\n while n % i == 0:\r\n n /= i\r\n \r\nans *= n\r\nprint(int(ans))\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# ---------------------------------------------------------Code---------------------------------------------------------\r\n\r\n\r\ndef Divisors(n):\r\n i=1\r\n while i*i<=n:\r\n if (n%i==0):\r\n div.append(i)\r\n div.append(n//i)\r\n i+=1\r\n\r\n\r\ndef prime_factorise(n):\r\n i=2\r\n while i*i<=n:\r\n if (n%i)==0:\r\n n//=i\r\n if n%i==0:\r\n return False\r\n i+=1\r\n return True\r\n\r\n\r\nn=int(input())\r\ndiv=[]\r\nDivisors(n)\r\nmaxx=1\r\nfor i in div:\r\n if i==1:\r\n continue\r\n if prime_factorise(i):\r\n maxx=max(maxx,i)\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", "#!/bin/python3\r\nimport sys\r\nimport math\r\nn = int(input())\r\nans = 1;\r\ns = int(math.sqrt(n))\r\nfor i in range(2,s + 1):\r\n while( n % i == 0):\r\n n //= i\r\n if ans % i != 0:\r\n ans *= i\r\nif ans % n != 0:\r\n ans *= n\r\nprint(ans)\r\n \r\n ", "\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nfor i in range(2,10**6):\r\n\r\n x = i**2\r\n\r\n while n%x==0:\r\n n//=i\r\nprint(n)", "from math import sqrt\n\ndef get_divisors(n):\n divisors = { n }\n for i in range(2, int(sqrt(n)) + 1):\n if n % i == 0:\n divisors.add(i)\n divisors.add(n // i)\n return divisors\n\nn = int(input())\n\ndivisors = list(get_divisors(n))\ndivisors.sort()\n\ni = len(divisors) - 1\nj = 0\nwhile j < i:\n if divisors[i] % (divisors[j] * divisors[j]) == 0 and divisors[i] % divisors[j] == 0:\n i -= 1\n j = 0\n else:\n j += 1\n\nprint(divisors[i])", "import sys\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef squarefree(n):\n a = 1\n d = 2\n while d*d <=n:\n q, r = divmod(n, d)\n if not r:\n n = q\n a *= d\n q, r = divmod(n, d)\n while not r:\n n = q\n q, r = divmod(n, d)\n d += 1 if d == 2 else 2\n return a * n\n\n\ndef main():\n n = int(input())\n print(squarefree(n))\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n main()\n b = float(o)\n try:\n a, = map(float, r.getvalue().splitlines())\n except Exception:\n ok = False\n else:\n ok = abs(a-b)/max(1,b) <= 0.0001\n if ok:\n log(\"OK\\n\")\n else:\n log(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n10\n\"\"\", \"\"\"\\\n10\n\"\"\"), (\"\"\"\\\n12\n\"\"\", \"\"\"\\\n6\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n\n", "import math\r\ndef printDivisors(n) : \r\n i = 1\r\n list1=[]\r\n list2=[]\r\n while i <= math.sqrt(n):\r\n if i!=1:\r\n list2.append(i*i)\r\n if (n % i == 0) : \r\n if (n / i == i) : \r\n list1.append(i) \r\n else:\r\n list1.append(i)\r\n list1.append(n/i)\r\n i = i + 1\r\n return list1,list2 \r\nn=int(input()) \r\nlist1,list2=printDivisors(n)\r\nlist1.sort(reverse=True)\r\nfor i in list1:\r\n p=all(i%j!=0 for j in list2)\r\n if p:\r\n print(int(i))\r\n break\r\n ", "import math\r\nn = int(input())\r\nfor i in range(2, round(math.sqrt(n))+1):\r\n while n % (i**2) == 0:\r\n n = int(n / i)\r\nprint(int(n))\r\n", "from functools import reduce\r\nfrom operator import mul\r\n\r\nn, D = int(input()), set()\r\n\r\nfor d in range(2, 1000001):\r\n while n % d == 0:\r\n D.add(d)\r\n n //= d\r\n if n == 1:\r\n break\r\n\r\nprint(reduce(mul, D | {n}))", "def is_prime(n):\r\n if n == 2 or n == 3: return True\r\n if n < 2 or n%2 == 0: return False\r\n if n < 9: return True\r\n if n%3 == 0: return False\r\n r = int(n**0.5)\r\n f = 5\r\n while f <= r:\r\n if n % f == 0: return False\r\n if n % (f+2) == 0: return False\r\n f += 6\r\n return True \r\n\r\nN = int(input())\r\n\r\nres = 1\r\nub = int(N**0.5)+2\r\nx = 2\r\nwhile x <= ub:\r\n if is_prime(x) and N % x == 0:\r\n res *= x\r\n N //= x\r\n while N % x == 0: N //= x\r\n ub = int(N**0.5)+2\r\n if x == 2: \r\n x +=1\r\n else:\r\n x +=2\r\nif N > 1:\r\n res *= N\r\n\r\nprint(res)", "import math\r\nfrom bisect import bisect_right as br\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef factors(n):\r\n l=[]\r\n for i in range(1,int(n**0.5)+1):\r\n if n%i==0:\r\n if n//i==i:\r\n l.append(i)\r\n else:\r\n l.append(i)\r\n l.append(n//i)\r\n return(l)\r\nn=int(input())\r\nl=factors(n)\r\nsq=[0]*(int(n**0.5)+1)\r\nfor i in range(1,int(n**0.5)+1):\r\n sq[i]=i**2\r\nl.sort(reverse=True)\r\nans=1\r\nfor i in l:\r\n idx=br(sq,i)\r\n flag=True\r\n for j in range(2,idx):\r\n if i%sq[j]==0:\r\n flag=False\r\n break\r\n if flag:\r\n ans=i\r\n break\r\nprint(ans)", "from functools import reduce\r\nfrom operator import mul\r\n\r\n\r\ndef generate_primes(n):\r\n sieve = [1] * n\r\n for i in range(3, int(n ** 0.5) + 1, 2):\r\n if sieve[i]:\r\n sieve[i*i::2*i] = [0] * ((n - i * i - 1) // (2 * i) + 1)\r\n return [2] + [i for i in range(3, n, 2) if sieve[i]]\r\n\r\n\r\nPRIMES = generate_primes(1000000)\r\n\r\nn, D = int(input()), set()\r\n\r\nfor d in PRIMES:\r\n while n % d == 0:\r\n D.add(d)\r\n n //= d\r\n if n == 1:\r\n break\r\n\r\nprint(reduce(mul, D | {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\ndef printDivisors(n):\r\n i = 1\r\n ans=[]\r\n while i <= math.sqrt(n):\r\n if (n % i == 0):\r\n\r\n # If divisors are equal, print only one\r\n if (n / i == i):\r\n ans.append(i)\r\n else:\r\n ans.append(i)\r\n ans.append(n//i)\r\n i = i + 1\r\n return ans\r\ndef primeFactors(n):\r\n ans=[]\r\n while n % 2 == 0:\r\n ans.append(2)\r\n n = n / 2\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n while n % i == 0:\r\n ans.append(i)\r\n n = n / i\r\n if n > 2:\r\n ans.append(int(n))\r\n return ans\r\nfor t in range(1):\r\n n=int(input())\r\n factors=printDivisors(n)\r\n factors.sort(reverse=True)\r\n for i in factors:\r\n number=i\r\n prime=primeFactors(number)\r\n if len(prime)==len(set(prime)):\r\n print(i)\r\n break", "import math\r\ndef solve(n):\r\n \r\n # Print the number of two's that divide n\r\n ans=1\r\n if(n%2==0):\r\n ans*=2 \r\n while n % 2 == 0:\r\n n = n / 2\r\n \r\n # n must be odd at this point\r\n # so a skip of 2 ( i = i + 2) can be used\r\n for i in range(3,int(math.sqrt(n))+1,2):\r\n if(n%i==0):\r\n ans*=i\r\n # while i divides n , print i and divide n\r\n while n % i==0:\r\n n = n / i\r\n \r\n # Condition if n is a prime\r\n # number greater than 2\r\n if n > 2:\r\n ans*=n\r\n print(int(ans))\r\n\r\n\r\nnum=int(input())\r\nsolve(num)\r\n", "valor = int(input())\n\ni = 2\n\nwhile i < int(valor ** 0.5) + 1:\n\tif valor % (i ** 2) == 0:\n\t\tvalor //= i\n\t\ti = 1\n\ti += 1\n\t\n\nprint (valor)", "n= int(input())\r\n\r\ndef bigLove(m):\r\n s=1\r\n if m%2==0:\r\n s=2\r\n while m%2==0:\r\n m=m//2\r\n i=3\r\n while i*i <=m:\r\n if m%i==0:\r\n while m%i==0:\r\n m=m//i\r\n s*=i\r\n i+=2\r\n \r\n if m>2:\r\n s*=m\r\n return s\r\n\r\nprint(bigLove(n))\r\n \r\n", "n = int(input())\r\ni = 1\r\nmax_d = 0\r\nwhile i ** 2 <= n:\r\n if n % i == 0:\r\n if n // i != i:\r\n j = 2\r\n found = True\r\n while j ** 2 <= i:\r\n if i % (j ** 2) == 0:\r\n found = False\r\n break\r\n j += 1\r\n if found:\r\n max_d = max(max_d, i)\r\n j = 2\r\n found = True\r\n while j ** 2 <= n // i:\r\n if (n // i) % (j ** 2) == 0:\r\n found = False\r\n break\r\n j += 1\r\n if found:\r\n max_d = max(max_d, n // i)\r\n else:\r\n j = 2\r\n found = True\r\n while j ** 2 <= i:\r\n if i % (j ** 2) == 0:\r\n found = False\r\n break\r\n j += 1\r\n if found:\r\n max_d = max(max_d, i)\r\n i += 1\r\nprint(max_d)\r\n", "import math\r\n\r\nn = int(input())\r\nfact = [1, n]\r\n\r\nfor i in range(2, int(math.sqrt(n) + 1)):\r\n if(n % i == 0):\r\n fact.append(i)\r\n fact.append(n // i)\r\n \r\nfact.sort(reverse= True)\r\n\r\nfor x in fact:\r\n flag = True\r\n for a in range (2, int(math.sqrt(x) + 1)):\r\n if(x % (a * a) == 0):\r\n flag = False\r\n break\r\n \r\n if(flag):\r\n print(x)\r\n break", "import math\r\ndef findLargestDivisor(n):\r\n for i in range(2, int(math.sqrt(n)) + 1):\r\n while (n % (i * i) == 0):\r\n n = n // i\r\n return n\r\nn = int(input())\r\nprint(findLargestDivisor(n))\r\n", "valor = int(input())\r\n\r\ni = 2\r\n\r\nwhile i < int(valor ** 0.5) + 1:\r\n\tif valor % (i ** 2) == 0:\r\n\t\tvalor //= i\r\n\t\ti = 1\r\n\ti += 1\r\n\t\r\n\r\nprint (valor)", "import math\r\n\r\n# retorna se é divisível por algum quadrado perfeito\r\ndef divisible(x):\r\n i = 2\r\n while i * i <= x:\r\n quad = i * i\r\n if x % quad == 0:\r\n return True\r\n i += 1\r\n return False\r\n\r\n\r\nn = int(input())\r\nraiz = int(math.sqrt(n)) + 1\r\n\r\ndivisores = [1]\r\nfor i in range(2, raiz):\r\n if n % i == 0:\r\n divisores.append(i)\r\n if n / i != i:\r\n divisores.append(n//i)\r\ndivisores.sort()\r\n\r\neh_divisivel = True\r\ni = n\r\nwhile eh_divisivel:\r\n eh_divisivel = divisible(i)\r\n\r\n if eh_divisivel:\r\n i = divisores[-1]\r\n divisores.pop()\r\n\r\nif not eh_divisivel:\r\n print(i)", "n=int(input())\r\nd=2\r\nwhile d*d<=n:\r\n if n%(d**2)==0:\r\n n//=d\r\n else:\r\n d+=1\r\nprint(n)", "n = int(input())\r\n\r\ni = 2\r\nfor i in range(2, (10 ** 6)) :\r\n while n % (i * i) == 0 :\r\n n //= i\r\n if i * i > n : \r\n break\r\nprint(n)\r\n ", "n = int(input())\n\nresult = n\nfor i in range(2,n):\n if (i * i > n):\n break\n while (result % (i*i) == 0):\n result //= i\nprint(result)\n", "n = int(input())\r\nfor i in range(2,10**6):\r\n x = i*i\r\n while n%x==0:\r\n n = n//i\r\nprint(n)", "import math \r\ndef div(n,li): \r\n i = 1\r\n while i <= math.sqrt(n): \r\n if (n % i == 0) : \r\n if (n / i == i) : \r\n li.append(i) \r\n else : \r\n li.append(i)\r\n li.append(n//i) \r\n i = i + 1\r\nlis=[0]*(1000001)\r\nfor i in range(2,1000003):\r\n lis[i-2]=i*i\r\nn = int(input())\r\nli=[]\r\ndiv(n,li)\r\nli.sort(reverse=True)\r\nli.append(1)\r\nfor i in li:\r\n c=1\r\n for j in lis:\r\n if i%j==0:\r\n c=0\r\n break\r\n if c:\r\n print(i)\r\n break \r\n\r\n\r\n\r\n", "from math import sqrt, ceil\r\nnum = int(input())\r\nsqr = ceil(sqrt(num))+1\r\ndivs = []\r\nfor i in range(1, sqr):\r\n if num % i == 0:\r\n divs.append(i)\r\n divs.append(num//i)\r\ndivs.sort(reverse=1)\r\nm = len(divs)\r\nfor i in range(m):\r\n tmp = divs[i]\r\n s = True\r\n for p in range(2, sqr):\r\n if tmp % p == 0:\r\n tmp /= p\r\n if tmp % p == 0:\r\n s = False\r\n break\r\n if s:\r\n print(divs[i])\r\n exit()\r\n", "n = int(input())\r\nN, res = int(1e6+3), 1\r\nfor i in range(2, N):\r\n\tif n % i == 0:\r\n\t\twhile n % i == 0: n //= i\r\n\t\tres *= i\r\nif n != 1: res *= n\r\nprint(res)\r\n", "# Python program to print prime factors\r\n\r\nimport math\r\n\r\n\r\n# A function to print all prime factors of\r\n# a given number n\r\ndef primeFactors(n):\r\n l=[]\r\n # Print the number of two's that divide n\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n\r\n # n must be odd at this point\r\n # so a skip of 2 ( i = i + 2) can be used\r\n for i in range(3, int(math.sqrt(n)) + 1, 2):\r\n\r\n # while i divides n , print i and divide n\r\n while n % i == 0:\r\n l.append(i)\r\n n = n // i\r\n\r\n # Condition if n is a prime\r\n # number greater than 2\r\n if n > 2:\r\n l.append(n)\r\n l=list(set(l))\r\n return l\r\n\r\n\r\n# Driver Program to test above function\r\n\r\nn=int(input())\r\np=primeFactors(n)\r\nj=1\r\nfor q in p:\r\n j=j*q\r\nprint(j)\r\n\r\n", "import sys\r\nfrom collections import defaultdict\r\nimport math\r\nfrom functools import reduce\r\n\r\n\r\nVALID = {2, 3, 5}\r\n\r\ndef get_sieve(n) -> tuple[list[int], list[int]]:\r\n # O(nloglog(n) bc of sum of reciprocals\r\n sieve = [1] * (n + 1)\r\n primes = []\r\n sieve[0] = sieve[1] = 0\r\n for i in range(2, n + 1):\r\n if sieve[i] == 1:\r\n for j in range(i * i, n + 1, i):\r\n sieve[j] = 0\r\n primes.append(i)\r\n return sieve, primes\r\n\r\ndef get_unique_factors(x, sieve, primes) -> set[int]:\r\n if x < len(sieve) and sieve[x]:\r\n return {x}\r\n unique_factors = set()\r\n for prime in primes:\r\n # We only consider factors that are <= sqrt(n) bc we are guaranteed that n will have a factor\r\n if prime * prime > x:\r\n break\r\n while x % prime == 0:\r\n x //= prime\r\n unique_factors.add(prime)\r\n if x > 1:\r\n unique_factors.add(x)\r\n return unique_factors\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n a = int(read())\r\n if a == 1:\r\n print(1)\r\n return\r\n sieve, factors = get_sieve(int(math.sqrt(a)))\r\n factors = get_unique_factors(a, sieve, factors)\r\n total = 1\r\n for factor in factors:\r\n total *= factor\r\n print(total)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nold_n = n\r\nres = 1\r\nfor i in range(2, int(old_n ** 0.5) + 1):\r\n if n % i == 0:\r\n res *= i\r\n while n % i == 0:\r\n n //= i\r\nif n > 1:\r\n res *= n\r\nprint(res)", "import math\nn = int(input())\ndiv = set()\ndiv.add(1)\ndiv.add(n)\nfor i in range(2, (int)(math.sqrt(n)) + 1):\n\tif n % i == 0:\n\t\tdiv.add(i)\n\t\tif n / i != i:\n\t\t\tdiv.add(n / i)\n\nfor i in range(2, (int)(math.sqrt(n)) + 1):\n\tif i**2 in div:\n\t\twhile n % i**2 == 0:\t\n\t\t\tn = n // i**2\n\t\t\tn = n * i\nprint(n)", "\r\ndef Lovely(x):\r\n a=list(factors(x))\r\n a.sort(reverse=True)\r\n for i in a:\r\n if i**0.5==int(i**0.5) and i>1:\r\n return False\r\n return True\r\n\r\ndef factors(n):\r\n return set(x for tup in ([i, n//i] \r\n for i in range(1, int(n**0.5)+1) if n % i == 0) for x in tup)\r\n\r\nr=int(input())\r\nFactors=list(factors(r))\r\nFactors.sort(reverse=True)\r\nl=[]\r\nfor i in Factors:\r\n if Lovely(i):\r\n print(i)\r\n break", "def div(num):\r\n length = 0\r\n sqrt = int(pow(num,0.5))\r\n for i in range(2,sqrt+1):\r\n if num%i==0:\r\n left.append(i)\r\n right.insert(0,num//i)\r\n length += 2\r\n return length\r\nn = int(input())\r\nif n==1:\r\n print(1)\r\nelse:\r\n left=[]\r\n right=[]\r\n l = div(n)+1\r\n arr = left+right\r\n arr.append(n)\r\n start = 0\r\n end = -1\r\n while start <=end+l and arr[start]<=int(pow(arr[end],0.5)):\r\n if arr[end]%(arr[start]*arr[start])==0:\r\n start = 0\r\n end -= 1\r\n else:\r\n start += 1\r\n print(arr[end])\r\n", "# Python program to print prime factors \n\nimport math \nfrom collections import Counter\n# A function to print all prime factors of \n# a given number n \ndef primeFactors(n): \n\tprimes = Counter()\n\t# Print the number of two's that divide n \n\twhile n % 2 == 0: \n\t\tprimes[2] += 1 \n\t\tn = n / 2\n\t\t\n\t# n must be odd at this point \n\t# so a skip of 2 ( i = i + 2) can be used \n\tfor i in range(3,int(math.sqrt(n))+1,2): \n\t\t\n\t\t# while i divides n , print i ad divide n \n\t\twhile n % i== 0: \n\t\t\tprimes[i] += 1 \n\t\t\tn = n / i \n\t\t\t\n\t# Condition if n is a prime \n\t# number greater than 2 \n\tif n > 2: \n\t\tprimes[int(n)] += 1 \n\treturn primes\n# Driver Program to test above function \nn = int(input())\nc = primeFactors(n) \ntotal = 1\nfor n in c.keys():\n\ttotal *= n\nprint(total)\n# This code is contributed by Harshit Agrawal \n", "n, = map(int, input().split())\n\ndef get_primes(num):\n primes = []\n prod = 1\n cur = num\n for i in range(2,int(num**0.5)+1):\n while cur % i == 0:\n primes.append(i)\n cur //= i\n prod *= i\n if prod < num:\n primes.append(num//prod)\n return primes\n\nprimes = set(get_primes(n))\nans = 1\nfor p in primes:\n ans *= p\nprint(ans)\n", "n = int(input())\r\nmember =[]\r\ni = 2\r\nans =1\r\nwhile(1):\r\n if i*i <=n :\r\n if n%i ==0:\r\n while(n%i ==0):\r\n n //=i\r\n ans*=i\r\n member.append(i)\r\n i+=1\r\n else:break\r\nprint(ans*n if len(member)>0 else n)\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\ni = 2\r\nwhile i**2 <= n:\r\n while n % i**2 == 0:\r\n n //= i\r\n i += 1\r\n\r\nprint(n)\r\n", "num = int(input())\r\n\r\ndef is_lovely(n: int) -> int:\r\n factor = int(n**(1/2))\r\n for i in range(2, factor + 1):\r\n if n % i**2 == 0:\r\n n /= i\r\n if n >= 4:\r\n return is_lovely(n)\r\n return int(n)\r\n\r\nprint(is_lovely(num))", "n=int(input())\ni=2\ntot=1\nwhile i*i<=n:\n if n%i==0:\n tot=tot*i\n while n%i==0:\n n=n//i\n i+=1\nif n>1:\n tot=tot*n\nprint(tot)\n\n\n \t \t \t\t\t\t\t\t \t\t\t \t \t\t \t\t", "def f(n): \r\n d = 2\r\n s = set()\r\n while d*d <= n: \r\n if n%d == 0 : \r\n s.add(d)\r\n n//=d \r\n else : d += 1\r\n if n != 1 : s.add(n)\r\n return s\r\nn = int(input())\r\nQ = f(n) \r\nans = 1\r\nfor i in Q: ans *= i \r\nprint(ans)", "def primeFactors(n):\r\n l=[]\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n // 2\r\n \r\n for i in range(3,int(n**(1/2))+1,2):\r\n \r\n while n % i== 0:\r\n l.append(i)\r\n n = n // i\r\n \r\n if n > 2:\r\n l.append(n)\r\n return l\r\nn=int(input())\r\nl1=primeFactors(n)\r\nans=1\r\nfor i in l1:\r\n if(ans%i):ans*=i\r\nprint(ans)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\nz = 1\r\nfor i in range(2,1000001):\r\n\tif n%i == 0:\r\n\t\twhile n%i == 0:\r\n\t\t\tn //= i\r\n\t\tz *= i\r\nif n != 1:\r\n\tz *= n\r\nprint(z)", "\r\na=[1]*1000001\r\na[0]=0\r\na[1]=0\r\nfor i in range(2,1000):\r\n if (a[i]==1):\r\n for j in range(i*i,1000001,i):\r\n a[j]=0 \r\n\r\nPremier=[]\r\nfor i in range(1000000):\r\n if a[i]==1:\r\n Premier.append(i)\r\n \r\n\r\nn=int(input())\r\ndef Divisors(n):\r\n L=[]\r\n i=1\r\n while i<n**(1/2)+1:\r\n if n%i==0:\r\n if n%i==i:\r\n L.append(i)\r\n else:\r\n L.append(i)\r\n L.append(n//i)\r\n i=i+1\r\n return L\r\n\r\nL=Divisors(n)\r\nL=sorted(L,reverse=True)\r\n\r\ndef lovely(n):\r\n i=0 \r\n while i<len(Premier) and n%(Premier[i])**2!=0:\r\n i=i+1 \r\n if i==len(Premier):\r\n return 1 \r\n return 0\r\n\r\ni=0\r\n\r\nwhile lovely(L[i])!=1:\r\n i=i+1 \r\nprint(L[i])\r\n \r\n", "n=int(input())\r\ni=2;ans=1\r\nwhile i*i<=n:\r\n cnt=0\r\n while n%i==0:\r\n n=n//i\r\n cnt+=1\r\n if cnt:ans*=i\r\n i+=1\r\nif n>1:ans*=n\r\nprint(ans)\r\n", "from math import sqrt\r\ndef divs(e):\r\n\tfor elemento in range(1, int(sqrt(e) + 1)):\r\n\t\tif e % elemento == 0:\r\n\t\t\tif elemento == 1:\r\n\t\t\t\tif (int(sqrt(e // elemento)) ** 2) == (e // elemento):\r\n\t\t\t\t\treturn 0\r\n\t\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tif (int(sqrt(elemento)) ** 2) == elemento or (int(sqrt(e // elemento)) ** 2) == (e // elemento):\r\n\t\t\t\t\treturn 0\r\n\t\t\t\t\tbreak\r\n\treturn e\r\n\r\nn = int(input())\r\nif n == 1:\r\n\tprint(1)\r\nelse:\r\n\tdivisores = []\r\n\tfor e in range(1, int(sqrt(n) + 1)):\r\n\t\tif n % e == 0:\r\n\t\t\tdivisores.append(e)\r\n\t\t\tif n // e != e:\r\n\t\t\t\tdivisores.append(n // e)\r\n\tdivisores.sort(reverse = True)\r\n\tfor e in divisores:\r\n\t\tans = divs(e)\r\n\t\tif ans != 0:\r\n\t\t\tprint(ans)\r\n\t\t\tbreak", "n=int(input())\r\ni=2\r\nwhile i<=n**(1/2):\r\n if n%((i)**2)==0:\r\n n=n/(i)\r\n i=1\r\n i+=1\r\nprint(int(n))", "# https://codeforces.com/contest/588/problem/B\r\n\r\nn = int(input())\r\n\r\ndivs = []\r\ni = 1\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n divs.append(n / i)\r\n divs.append(i)\r\n i += 1\r\n\r\ndivs.sort(reverse=True)\r\n\r\nfor temp in divs:\r\n flag = False\r\n\r\n i = 3\r\n while i * i <= temp:\r\n if (temp % (i * i)) == 0:\r\n flag = True\r\n break\r\n i += 2\r\n\r\n if (flag is False) and (temp % 4 != 0):\r\n print(int(temp))\r\n break\r\n", "\r\na=int(input())\r\n\r\ndef primes(n):\r\n primfac = []\r\n d = 2\r\n while d*d <= n:\r\n while (n % d) == 0:\r\n primfac.append(d)\r\n n //= d\r\n d += 1\r\n if n > 1:\r\n primfac.append(n)\r\n return(primfac)\r\n\r\nprod=1\r\nfor i in set(primes(a)):\r\n prod*=i\r\nprint(prod)\r\n", "def factorise(n):\r\n dic={} \r\n while n%2==0:\r\n if 2 in dic:\r\n dic[2]+=1\r\n else:\r\n dic[2]=1\r\n n=n/2\r\n \r\n for i in range(3,int(n**0.5)+1):\r\n while n%i==0:\r\n if i in dic:\r\n dic[i]+=1\r\n else:\r\n dic[i]=1\r\n n=n/i\r\n if n>2:\r\n dic[n]=1\r\n return dic\r\nn = int(input())\r\ndic = factorise(n)\r\narr = sorted(list(dic.keys()))\r\nfinal =1\r\nfor i in arr:\r\n final*=i\r\nprint(int(final))", "\r\nn = int(input())\r\ndivisorsNo = []\r\ni = 2\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n divisorsNo.append(i)\r\n n = int(n / i)\r\n else:\r\n i = i + 1\r\nif n > 1:\r\n divisorsNo.append(n)\r\nst = set(divisorsNo)\r\nans = 1\r\nfor i in st:\r\n ans = ans * i\r\n\r\nprint(ans)", "#-*- coding: utf-8 -*-\r\nn=int(input())\r\na=[];j=2\r\nwhile n!=1 and j<=n**0.5:\r\n if n%j==0:\r\n n//=j\r\n a.append(j)\r\n while n%j==0:\r\n n//=j\r\n j+=1\r\na.append(n)\r\nn=1\r\nfor i in range(len(a)):\r\n n*=a[i]\r\nprint(n)", "from math import sqrt\r\nn = int(input())\r\nfor i in range(2, int(sqrt(n)) + 1):\r\n while n % (i * i) == 0:\r\n n //= i\r\nprint(n)", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nprod=1\r\nn1=n\r\nfor i in range(2,int(math.sqrt(n1))+1):\r\n if(n%i==0):\r\n prod*=i\r\n while(n%i==0):\r\n n//=i\r\nif(n>1):\r\n prod*=n\r\nprint(prod)", "\r\nimport math\r\nn = int(input())\r\nnDivisible = []\r\nfor i in range(1, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n nDivisible.append(i)\r\n nDivisible.append(n // i)\r\n# nDivisible.append(n)\r\nnDivisible.sort()\r\n# print(nDivisible)\r\nflag = True\r\nfor i in range(len(nDivisible) - 1, -1, -1):\r\n flag = True\r\n maxDivisible = nDivisible[i]\r\n # print(maxDivisible)\r\n for j in range(2, int(math.sqrt(maxDivisible)) + 1):\r\n if maxDivisible % (j * j) == 0:\r\n flag = False\r\n # print(maxDivisible)\r\n break\r\n if flag == True:\r\n print(maxDivisible)\r\n break", "import math\r\nn = int(input())\r\n\r\ni = 2\r\n\r\nwhile i <= math.sqrt(n):\r\n if n % (i * i ) == 0:\r\n n = n / i\r\n i = 1\r\n i += 1\r\n\r\nprint(int(n))", "import math \n\nnum = int(input())\nroot = math.sqrt(num)\n \nfor i in range(2, int(root) + 1): \n \n while(num % (i * i) == 0): \n num = num // i \n \nprint(num)\n \t \t \t\t \t\t \t\t\t\t\t\t\t\t\t" ]

[ "n = input()\r\nl = [\"O-|-OOOO\" , \"O-|O-OOO\" ,\"O-|OO-OO\" ,\"O-|OOO-O\",\"O-|OOOO-\", \"-O|-OOOO\",\"-O|O-OOO\",\"-O|OO-OO\",\"-O|OOO-O\",\"-O|OOOO-\" ]\r\nfor i in n[::-1] : \r\n print(l[int(i)])", "# https://codeforces.com/problemset/problem/363/A\r\n\r\nn = input()\r\nfor i in range(len(n)-1,-1,-1):\r\n c = int(n[i])\r\n head = 'O-' if c < 5 else '-O'\r\n tail = ''.join('-' if x == c % 5 else 'O' for x in range(5))\r\n print(f'{head}|{tail}')", "def spic(n):\r\n s = ''\r\n if n >= 5:\r\n s+=\"-O|\"\r\n n-=5\r\n else:\r\n s+=\"O-|\"\r\n s += n*\"O\" + '-' +(4-n)*\"O\"\r\n return s\r\ns = input()\r\nfor i in range(len(s)-1, -1, -1):\r\n print(spic(int(s[i])))\r\n", "d = {\r\n\t'0': \"O-|-OOOO\",\r\n\t'1': \"O-|O-OOO\",\r\n\t'2': \"O-|OO-OO\",\r\n\t'3': \"O-|OOO-O\",\r\n\t'4': \"O-|OOOO-\",\r\n\t'5': \"-O|-OOOO\",\r\n\t'6': \"-O|O-OOO\",\r\n\t'7': \"-O|OO-OO\",\r\n\t'8': \"-O|OOO-O\",\r\n\t'9': \"-O|OOOO-\"\r\n}\r\n\r\nfor c in input()[::-1]:\r\n\tprint(d[c])\r\n\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n/////////////////////////////////////////\r\n// //\r\n// Implemented by brownfox2k6 //\r\n// //\r\n/////////////////////////////////////////\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"", "num = input()\r\nnum = num[::-1]\r\nfor i in num:\r\n a = int(i)\r\n s = ''\r\n if a >= 5:\r\n s += '-O'\r\n a -= 5\r\n else:\r\n s += 'O-'\r\n s += '|'\r\n s += a * 'O' + '-' + (4 - a) * 'O'\r\n print(s)# 1690410490.7277987", "n=int(input())\r\ns=str(n)\r\ns=s[::-1]\r\nfor c in s:\r\n ans=\"\"\r\n if(int(c)>=5):\r\n ans+=\"-O|\"\r\n else:\r\n ans+=\"O-|\"\r\n for i in range(int(c)%5):\r\n ans+=\"O\"\r\n ans+=\"-\"\r\n for i in range(4-(int(c)%5)):\r\n ans+=\"O\"\r\n print(ans)", "n=int(input())\r\nr=['','O-|-OOOO'][n<1]\r\nwhile n:t=n%10;r+=['O-','-O'][t//5]+'|';t=t%5;r+='O'*t+'-'+'O'*(4-t)+'\\n';n//=10\r\nprint(r)", "n = input()\r\nfor dig in n[::-1]:\r\n rod = ''\r\n if int(dig) >= 5:\r\n rod += '-O|' + 'O'*(int(dig)-5) + '-' + 'O'*(4-(int(dig)-5))\r\n else: \r\n rod += 'O-|' + 'O'*(int(dig)) + '-' + 'O'*(4-(int(dig)))\r\n print(rod)", "n = input()\r\n\r\nfor x in reversed(n):\r\n y = int(x)\r\n b = list(\"OOOOO\")\r\n b[y%5] = \"-\"\r\n print((\"O-|\" if y<5 else \"-O|\")+\"\".join(b))", "for i in input()[::-1]:\r\n i = int(i)\r\n if i >= 5:\r\n print('-O|' + 'O' * (i - 5) + '-' + 'O' * (4 - (i - 5)))\r\n else:\r\n print('O-|' + 'O' * i + '-' + 'O' * (4 - i))", "x=list(input())\r\ns=\"\"\r\nfor i in x[::-1]:\r\n n=int(i)\r\n if(n>=5):\r\n s+=\"-O|\"\r\n n-=5\r\n else:\r\n s+=\"O-|\" \r\n s+=(\"O\"*n)+\"-\"+(\"O\"*(4-n)) \r\n\r\n print(s)\r\n s=\"\"\r\n", "n=int(input())\r\nl=[]\r\nfor i in str(n):\r\n if int(i)<5:\r\n l.append(\"O-|\"+\"O\"*int(i)+\"-\"+\"O\"*(4-int(i)))\r\n else:\r\n l.append(\"-O|\"+\"O\"*(int(i)-5)+\"-\"+\"O\"*(9-int(i)))\r\nl.reverse()\r\nfor i in l:\r\n print(i)\r\n", "x=int(input())\r\nstringx=str(x)\r\n\r\nfor y in range(len(stringx)-1,-1,-1):\r\n number=int(stringx[y])\r\n if number>=5:\r\n print('-O',end='')\r\n number-=5\r\n else:\r\n print('O-',end='')\r\n print('|',end='')\r\n for j in range(number):\r\n print('O',end='')\r\n print(\"-\",end='')\r\n for u in range(5-number-1):\r\n print(\"O\",end='')\r\n print('')\r\n\r\n", "n = int(input())\r\nif n == 0:\r\n print(\"O-|-OOOO\")\r\nwhile n:\r\n x = n % 10\r\n n //= 10\r\n if x >= 5:\r\n print(\"-O|\", end=\"\")\r\n x -= 5\r\n else:\r\n print(\"O-|\", end=\"\")\r\n print(\"O\" * x + \"-\" + \"O\" * (4 - x))", "n = input()\r\nfor c in n[::-1]:\r\n if c in \"01234\":\r\n print(\"O-|\" + \"O\" * int(c) + \"-\" + \"O\"*(4 - int(c)))\r\n else:\r\n print(\"-O|\" + \"O\" * (int(c) - 5) + \"-\" + \"O\" * (4 - (int(c) - 5)))\r\n", "n = int(input())\r\nd = {0: 'O-|-OOOO', 1: 'O-|O-OOO', 2: 'O-|OO-OO', 3: 'O-|OOO-O', 4: 'O-|OOOO-', 5: '-O|-OOOO',\r\n6: '-O|O-OOO', 7: '-O|OO-OO', 8: '-O|OOO-O', 9: '-O|OOOO-'}\r\nn = list(map(int, str(n)))[::-1]\r\nfor i in n:\r\n print(d[i])", "l = list(input())\r\nl.reverse()\r\n \r\nfor i in range(len(l)):\r\n if int(l[i]) < 5:\r\n str = \"O-|\"\r\n for j in range(int(l[i])):\r\n str += \"O\"\r\n str += \"-\"\r\n for j in range(5 - int(l[i]) - 1):\r\n str += \"O\"\r\n else:\r\n str = \"-O|\"\r\n for j in range(int(l[i]) - 5):\r\n str += \"O\"\r\n str += \"-\"\r\n for j in range(10 - int(l[i]) - 1):\r\n str += \"O\"\r\n print(str)", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\na=(list(input()))\r\nn=len(a)\r\nl=[]\r\nfor i in range(-1,-n-1,-1):\r\n\tif int(a[i])<5:\r\n\t\tl.append(\"O-|\"+(int(a[i]))*\"O\"+\"-\"+(4-int(a[i]))*\"O\")\r\n\telse:\r\n\t\tl.append(\"-O|\"+(int(a[i])-5)*\"O\"+\"-\"+(9-int(a[i]))*\"O\")\t\t\r\nfor i in range(n):\r\n\tprint(l[i])", "number = input('')\r\nnumber = number[::-1]\r\nfor char in number:\r\n hold = \"\"\r\n if int(char) > 4:\r\n hold = hold + '-O|'\r\n else:\r\n hold = hold + 'O-|'\r\n for c in range(int(char)%5):\r\n hold = hold + 'O'\r\n hold = hold + '-'\r\n for c in range(4-int(char)%5):\r\n hold = hold + 'O'\r\n print(hold)\r\n ", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# # 2022\r\n# import sys\r\n# input=sys.stdin.readline\r\ndef exe():\r\n #print(s)\r\n for i in range(len(s)-1):\r\n if(s[i]=='0'):\r\n print('O-|-OOOO')\r\n elif(s[i]=='1'):\r\n print('O-|O-OOO')\r\n elif(s[i]=='2'):\r\n print('O-|OO-OO')\r\n elif(s[i]=='3'):\r\n print('O-|OOO-O')\r\n elif(s[i]=='4'):\r\n print('O-|OOOO-') \r\n elif(s[i]=='5'):\r\n print('-O|-OOOO')\r\n elif(s[i]=='6'):\r\n print('-O|O-OOO')\r\n elif(s[i]=='7'):\r\n print('-O|OO-OO')\r\n elif(s[i]=='8'):\r\n print('-O|OOO-O')\r\n elif(s[i]=='9'):\r\n print('-O|OOOO-')\r\n for i in range(len(s)-1,len(s)):\r\n if(s[i]=='0'):\r\n return 'O-|-OOOO'\r\n elif(s[i]=='1'):\r\n return 'O-|O-OOO'\r\n elif(s[i]=='2'):\r\n return 'O-|OO-OO'\r\n elif(s[i]=='3'):\r\n return 'O-|OOO-O'\r\n elif(s[i]=='4'):\r\n return 'O-|OOOO-' \r\n elif(s[i]=='5'):\r\n return '-O|-OOOO'\r\n elif(s[i]=='6'):\r\n return '-O|O-OOO'\r\n elif(s[i]=='7'):\r\n return '-O|OO-OO'\r\n elif(s[i]=='8'):\r\n return '-O|OOO-O'\r\n elif(s[i]=='9'):\r\n return '-O|OOOO-'\r\nn=input()\r\ns= \"\".join(reversed(n))\r\nprint(exe())", "x = input()\r\nz = []\r\nfor i in x:\r\n z.append(int(i))\r\nz.reverse()\r\nfor i in z:\r\n if i - 5 >= 0 :\r\n print(\"-O|\" , end=\"\")\r\n for j in range(i-5):\r\n print(\"O\",end =\"\")\r\n print(\"-\" + ((4- (i - 5)) * \"O\") )\r\n\r\n\r\n\r\n elif i - 5 < 0:\r\n print(\"O-|\", end=\"\")\r\n for j in range(i):\r\n print(\"O\",end =\"\")\r\n print(\"-\" + ((4 - (i)) * \"O\"))", "v = list(map(int, input()))\r\nfor x in v[::-1]:\r\n a = \"O-|\"\r\n if x >= 5:\r\n a = \"-O|\"\r\n b = (\"O\" * (x % 5)) + \"-\" + (\"O\" * (4 - (x % 5)))\r\n print(a + b)\r\n", "s=input()\r\nfor i in range(len(s)):\r\n j=i+1\r\n num=int(s[-1*j])\r\n s1=\"\"\r\n s2=\"|\"\r\n s3=\"\"\r\n if 0<=num<5:\r\n s1=\"O-\"\r\n if num==0:\r\n s3=\"-OOOO\"\r\n elif num==1:\r\n s3=\"O-OOO\"\r\n elif num==2:\r\n s3=\"OO-OO\"\r\n elif num==3:\r\n s3=\"OOO-O\"\r\n else :\r\n s3=\"OOOO-\"\r\n else :\r\n s1=\"-O\"\r\n if num==5:\r\n s3=\"-OOOO\"\r\n elif num==6:\r\n s3=\"O-OOO\"\r\n elif num==7:\r\n s3=\"OO-OO\"\r\n elif num==8:\r\n s3=\"OOO-O\"\r\n else :\r\n s3=\"OOOO-\"\r\n print(s1+s2+s3)", "a = input()[::-1]\r\nfor i in a:\r\n if int(i) < 5:\r\n print(\"O-|\" + \"O\" * int(i) + \"-\" + \"O\" * (4 - int(i)))\r\n else:\r\n print(\"-O|\" + \"O\" * (int(i) - 5) + \"-\" + \"O\" * (4 - (int(i) - 5)))", "zero = ['O-|-OOOO','O-|O-OOO','O-|OO-OO','O-|OOO-O','O-|OOOO-','-O|-OOOO','-O|O-OOO','-O|OO-OO','-O|OOO-O','-O|OOOO-']\r\nn = input()\r\nfor i in range(len(n),0,-1):\r\n print(zero[int(n[i-1])])", "n=input()\r\nl=[]\r\ndef soroban(x):\r\n if x==0:\r\n return(\"O-|-OOOO\")\r\n elif x==1:\r\n return(\"O-|O-OOO\")\r\n elif x==2:\r\n return(\"O-|OO-OO\")\r\n elif x==3:\r\n return(\"O-|OOO-O\")\r\n elif x==4:\r\n return(\"O-|OOOO-\")\r\n elif x==5:\r\n return(\"-O|-OOOO\")\r\n elif x==6:\r\n return(\"-O|O-OOO\")\r\n elif x==7:\r\n return(\"-O|OO-OO\")\r\n elif x==8:\r\n return(\"-O|OOO-O\")\r\n else:\r\n return(\"-O|OOOO-\")\r\nfor i in range(len(n)):\r\n l.append(soroban(int(n[i])))\r\nl.reverse()\r\nfor i in l:\r\n print(i)", "#Cypher\r\n#Indian Institute Of Technology, Jodhpur\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nmod= 10**9+7\r\nn=int(input())\r\nlength=len(str(n))\r\nl=list(str(n))\r\nl=l[::-1]\r\nl2=[]\r\nfor i in range(0,10):\r\n if i==0:\r\n l2.append('O-|-OOOO')\r\n elif i==1:\r\n l2.append('O-|O-OOO')\r\n elif i==2:\r\n l2.append('O-|OO-OO')\r\n elif i==3:\r\n l2.append('O-|OOO-O')\r\n elif i==4:\r\n l2.append('O-|OOOO-')\r\n elif i==5:\r\n l2.append('-O|-OOOO')\r\n elif i==6:\r\n l2.append('-O|O-OOO')\r\n elif i==7:\r\n l2.append('-O|OO-OO')\r\n elif i==8:\r\n l2.append('-O|OOO-O')\r\n elif i==9:\r\n l2.append('-O|OOOO-')\r\nfor i in l:\r\n print(l2[int(i)])\r\n " ]

[ "import sys\r\n\r\nn, t, c = map(int, input().split())\r\nvec = [-1]\r\n\r\nfor i, temp in enumerate(map(int, sys.stdin.readline().split())):\r\n if temp > t:\r\n vec.append(i)\r\n\r\nvec.append(n)\r\nans = 0\r\n\r\nfor i in range(1, len(vec)):\r\n diff = vec[i] - vec[i - 1] - 1\r\n ans += max(diff - c + 1, 0)\r\n\r\nsys.stdout.write(str(ans) + '\\n')\r\n", "numy,crime,num = map(int,input().split())\r\nnums= list(map(int,input().split()))\r\ncount =0\r\nsum = 0\r\nfor i in range(numy):\r\n if nums[i]<=crime:\r\n if count ==num-1:\r\n sum+=1\r\n else:\r\n count+=1\r\n else:\r\n count =0 \r\nprint(sum) ", "from collections import deque\n\ndef max_in_sliding_window(arr, window_size):\n dq = deque()\n res = []\n\n for i in range(len(arr)):\n while dq and arr[i] >= arr[dq[-1]]:\n dq.pop()\n dq.append(i)\n if dq[0] == i - window_size:\n dq.popleft()\n if i >= window_size - 1:\n res.append(arr[dq[0]])\n return res\n\nn, t, c = map(int, input().split())\nseverity = list(map(int, input().split()))\n\nprint(sum(1 for i in max_in_sliding_window(severity, c) if i <= t))\n\n \t \t \t\t \t\t \t\t \t\t \t\t\t \t\t\t", "n, t, c = (map(int, input().split()))\nprisoners = (input().split())\n\ntotalCount = 0\ncount = 0\nfor i in range(n):\n if int(prisoners[i]) <= t:\n count += 1\n else:\n if count >= c:\n totalCount += count - c + 1\n count = 0\n\nif count >= c:\n totalCount += count - c + 1\n\nprint(totalCount)\n\t \t\t\t\t\t\t\t \t\t\t \t \t\t \t\t \t", "# n,t,c=map(int,input().strip().split())\r\n# li=list(map(int,input().strip().split()))\r\n# di={}\r\n# i=0\r\n# # fli=[]\r\n# while i<n:\r\n# ct=0\r\n# si=i\r\n# maxi=li[i]\r\n# while ct<c and i<n:\r\n# if li[i]>maxi:\r\n# maxi=li[i]\r\n# ct+=1\r\n# i+=1\r\n# # lii=[maxi]*c\r\n# # fli=fli+lii\r\n# for j in range(si,i):\r\n# di[j]=maxi\r\n# ans=0\r\n# si=0\r\n# print(di)\r\n# for i in range(0,n-c+1):\r\n \r\n# if di[i]<=t:\r\n# ans+=1\r\n# print(ans)\r\n\r\n\r\n# i=0\r\n# ct=0\r\n# si=i\r\n# maxi=li[i]\r\n# while ct<c and i<n:\r\n# if li[i]>maxi:\r\n# maxi=li[i]\r\n# ct+=1\r\n# i+=1\r\n# di[si]=maxi\r\n# print(di)\r\n# for i in range(1,n-c+1):\r\n# if li[c-1+i]>maxi:\r\n# maxi=li[c+i-1]\r\n# di[i]=maxi\r\n\r\n# print(di)\r\n# ans=0\r\n# si=0\r\n# # print(di)\r\n# for i in range(0,n-c+1):\r\n \r\n# if di[i]<=t:\r\n# ans+=1\r\n# print(ans)\r\n\r\ndef x_less_than_or_equal_n(x, n):\r\n return x <= n;\r\n \r\nn, t, c = list(map(int, input().split()))\r\nprisoners_crimes = list(map(int, input().split()))\r\n \r\nresult = counter = 0\r\n \r\nfor i in range(n):\r\n if x_less_than_or_equal_n(prisoners_crimes[i], t):\r\n counter += 1\r\n else:\r\n counter = 0\r\n \r\n if counter >= c:\r\n result += 1\r\n \r\nprint(result)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, t, c = map(int, input().split())\r\ncrimes = list(map(int, input().split()))\r\n \r\ncount = 0\r\nwindow_start = 0\r\nfor i in range(n):\r\n if crimes[i] > t:\r\n window_start = i + 1\r\n elif i - window_start + 1 == c:\r\n count += 1\r\n window_start += 1\r\nprint(count)", "n, limit, length = map(int, input().split())\ncurrentRunLength = 0\ntotal = 0\nlst = list(map(int, input().split()))\nfor x in lst:\n if x > limit:\n total += max(currentRunLength - length + 1, 0)\n currentRunLength = 0\n else:\n currentRunLength += 1\ntotal += max(currentRunLength - length + 1, 0)\nprint(total)\n\t\t\t \t \t \t \t \t\t \t \t\t \t \t\t \t", "n,t,c =map(int, input().split())\r\nlis = list(map(int, input().split()))\r\ncount=0\r\nperson_num=0\r\nfor i in lis:\r\n if i <= t :\r\n person_num +=1\r\n else:\r\n person_num = 0\r\n \r\n if person_num >= c:\r\n count+=1\r\n \r\n \r\nprint(count)\r\n ", "# DO NOT EDIT THIS\r\nimport functools\r\nimport math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\nfrom collections import deque, defaultdict\r\nimport heapq\r\nimport bisect\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\nmxi = 10**10\r\nmod = 10**9 + 7\r\n\r\n# DO NOT EDIT ABOVE THIS\r\n\r\nn, t, c = inp()\r\narr = inp()\r\ntotal = 0\r\nh = []\r\nheapq.heapify(h)\r\n\r\nfor idx, el in enumerate(arr):\r\n out = idx - c\r\n while len(h) and h[0][1] <= out:\r\n heapq.heappop(h)\r\n\r\n heapq.heappush(h, (-el, idx))\r\n\r\n if idx >= c - 1:\r\n cur = -h[0][0]\r\n\r\n if cur <= t:\r\n total += 1\r\n\r\n\r\nprint(total)\r\n\r\n\r\n\r\n\r\n", "n, t, c = map(int, input().split())\ncrimes = list(map(int, input().split()))\n\ncontador = 0\ntotal = 0\n\nfor i in range(n):\n if crimes[i] <= t:\n contador += 1\n if contador == c:\n total += 1\n contador -= 1\n else:\n contador = 0\n\nprint(total)\n\n\t \t \t \t \t\t\t \t \t\t \t \t \t", "n,t,c = [int(i) for i in input().split(\" \")]\n\narr = [int(i) for i in input().split(\" \")]\n\ncontinuous_sublists = []\nboopsie = 0\nfor i in arr:\n if i <= t:\n boopsie += 1\n else:\n if boopsie >= c:\n continuous_sublists.append(boopsie)\n boopsie = 0\n\nif boopsie >= c:\n continuous_sublists.append(boopsie)\n\nprint(sum([i-c+1 for i in continuous_sublists]))\n\t \t \t \t \t\t \t\t\t \t\t \t\t", "n , t , c = list(map(int , input().split()))\r\na = list(map(int , input().split()))\r\n\r\nl = 0 \r\nr = c-1\r\ncount = 0\r\n\r\nr =[]\r\nres = []\r\nfor i in range(n):\r\n if(a[i] <= t):\r\n r.append(a[i])\r\n else:\r\n if(len(r) >= c):\r\n res.append(r)\r\n r = []\r\nif(len(r) != 0):\r\n res.append(r)\r\n\r\nfor el in res:\r\n l = 0 \r\n r = c -1 \r\n while r < len(el):\r\n count += 1 \r\n l += 1\r\n r += 1\r\nprint(count)", "def count_ways(n, t, c, crimes):\r\n count = 0 # Counter for the number of ways to choose the prisoners\r\n current_count = 0 # Counter for the current contiguous segment\r\n\r\n for i in range(n):\r\n if crimes[i] <= t:\r\n current_count += 1\r\n else:\r\n current_count = 0\r\n\r\n if current_count >= c:\r\n count += 1\r\n\r\n return count\r\n\r\n# Read input values\r\nn, t, c = map(int, input().split())\r\ncrimes = list(map(int, input().split()))\r\n\r\n# Call the function and print the result\r\nresult = count_ways(n, t, c, crimes)\r\nprint(result)\r\n", "n,t,c = list(map(int, input().split()))\r\ncrimeLevels = list(map(int, input().split()))\r\nfrequents,ans=0,0\r\nfor i in range(n):\r\n if crimeLevels[i]<=t:\r\n frequents+=1\r\n else:\r\n frequents=0\r\n if frequents>=c:\r\n ans+=1\r\n \r\nprint(ans)\r\n \r\n ", "n, t, c = (int(x) for x in input().split())\nseverities = input().split()\nways = 0\nrun = 0\nfor s in severities:\n s = int(s)\n if s > t:\n run = 0\n else:\n run += 1\n if run >= c:\n ways += 1\nprint(ways)\n\n \t \t\t\t \t \t\t \t \t\t\t \t\t \t \t", "n,t,c=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncount=0\r\nans=0\r\nfor i in range(n):\r\n if arr[i]<=t:\r\n count+=1\r\n else:\r\n count=0\r\n if count>=c:\r\n ans+=1\r\nprint(ans)", "n, t, c = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nans = 0\r\nleft = 0\r\nfor right in range(n):\r\n if a[right]>t:\r\n left = right+1\r\n continue\r\n if right-left+1==c:\r\n ans+=1\r\n left+=1\r\nprint(ans)\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/427/B\r\n\r\nn, t, c = map(int, input().split())\r\nl_p = list(map(int, input().split()))\r\n\r\nt_c = 0\r\ni = 0\r\nc_l = 0\r\nwhile i < n:\r\n if l_p[i] <= t:\r\n c_l += 1\r\n else:\r\n c_l = 0\r\n \r\n if c_l >= c:\r\n t_c += 1\r\n \r\n i += 1\r\n \r\nprint(t_c)", "entrada = list(map(int, input().split()))\r\nlista = list(map(int, input().split()))\r\n\r\nt = entrada[1]\r\nc = entrada[2]\r\n\r\ni = 0\r\nj = 0\r\nsentinela = 0\r\ncount = 0\r\nnumero = 0\r\ntem = False\r\nmenor = False\r\n\r\nmaior = 0\r\nmenor = 0\r\nlistaN = []\r\ncountN = 0\r\nwhile(i < len(lista)):\r\n \r\n if(lista[i] > t):\r\n listaN.append(countN)\r\n countN = 0\r\n maior += 1\r\n else:\r\n menor = True\r\n menor +=1\r\n countN +=1\r\n i+=1\r\n\r\nfor k in listaN:\r\n if k >= c:\r\n count += k - c + 1\r\n \r\nif(countN > 0):\r\n if(countN >= c):\r\n count += countN - c + 1\r\nif(menor == False):\r\n count = 0\r\n\r\n\r\nprint(count)", "\n\ndef ways(n, t, c, prisoners):\n\n valid = 0\n ways = 0\n\n if n < c:\n return 0\n\n for p in prisoners:\n if p <= t:\n valid += 1\n else:\n valid = 0\n if c <= valid:\n ways += 1\n return ways\n\n\nn, t, c = map(int, input().split())\n\nprisoners = map(int, input().split())\n\n\nprint(ways(n, t, c, prisoners))\n \t \t\t \t \t \t\t\t\t\t \t\t\t \t \t \t", "n,t,c=map(int, input().split())\r\nk=r=0\r\nfor i in input().split():\r\n k=k+1 if int(i) <= t else 0\r\n r+=(k>=c)\r\nprint(r)\r\n\r\n", "n,t,c = map(int, input().split())\nprisoners_t =list( map(int, input().split()))\n\ncontig_length = 0\nways = 0\nfor x in prisoners_t:\n if x <= t:\n contig_length +=1\n if c == contig_length:\n ways +=1\n contig_length -=1\n else:\n contig_length = 0\n # print(x, contig_length)\n \nprint(ways)\n\n \t \t\t\t\t \t \t\t \t \t\t\t \t \t \t \t", "n, t, c = map(int, input().split())\narr = list(map(int, input().split()))\ncount, row = 0, 0\nfor x in range(0, n):\n if arr[x] <= t:\n row += 1\n if row >= c:\n count += 1\n else:\n row = 0\nprint(count)\n\t\t\t\t \t \t\t \t\t \t \t\t\t\t \t\t", "inputs = str(input()).split()\r\ntot_p = int(inputs[0])\r\nmax_sev = int(inputs[1])\r\ntot_sel = int(inputs[2])\r\n\r\nsev = [int(x) for x in str(input()).split()]\r\n\r\nwindow = 0\r\ntotal_com = 0\r\n\r\nfor i in sev:\r\n if(i <= max_sev):\r\n window += 1\r\n if(window >= tot_sel):\r\n total_com += 1\r\n else:\r\n window = 0\r\n\r\nprint(total_com)", "n,t,c=map(int, input().split())\r\na=[int(i) for i in input().split()]\r\nl=0\r\nsumm=0\r\nfor i in range(n):\r\n if a[i]>t:\r\n if l==0:\r\n s=i-(c-1)\r\n l=i\r\n else:\r\n s=(i-l-1)-(c-1)\r\n l=i\r\n if s>0:\r\n summ+=s\r\nif l==0 and a[0]<=t: summ+=1\r\ns=(i-l)-(c-1)\r\nif s>0:\r\n summ+=s\r\nprint(summ)", "n,t,c = map(int, input().split())\r\nll = list(map(int, input().split()))\r\nans=0\r\nl=0\r\n \r\nfor i in range(n):\r\n if ll[i]<=t:\r\n l+=1\r\n else:\r\n l=0\r\n \r\n if l>=c:\r\n ans+=1\r\n \r\nprint(ans)", "n, t, c = [int(x) for x in input().split(' ')]\narr = [int(x) for x in input().split(' ')]\n\ncount, max = 0, 0\n\nfor sev in arr:\n\n if sev <= t:\n max += 1\n\n else:\n if max >= c:\n count += max - (c-1)\n\n max = 0\n\nif max >= c:\n count += max - (c-1)\n\nprint(count)\n\t\t \t\t\t \t\t\t\t \t\t \t \t\t \t \t\t\t", "n, t, c = map(int, input().split())\ncrimes = list(map(int, input().split()))\n\ncount = l = r = 0\n\nwhile l < len(crimes) and r < len(crimes):\n if crimes[r] > t:\n l = r + 1\n elif r - l + 1 == c:\n count += 1\n l += 1\n r += 1\n\nprint(count)\n\n# matthew schrank is orz\n\n \t \t \t \t\t\t \t\t \t \t\t \t", "a,b,c=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nt=0\r\nk=0\r\nfor i in l:\r\n if i<=b:\r\n k+=1\r\n else:\r\n k=0 \r\n if k>=c:\r\n t+=1 \r\nprint(t)\r\n", "from collections import deque\r\n\r\n\r\n[n,t,c]=list(map(int, input().split(' ')))\r\np=list(map(int, input().split(' ')))\r\ny=deque([])\r\nans=0\r\nfor i in range (0,n):\r\n while y and y[-1][1]<=p[i]:\r\n y.pop()\r\n\r\n y.append([i,p[i]])\r\n\r\n if y[0][0]<=i-c:\r\n y.popleft()\r\n if i>=c-1:\r\n if y[0][1]<=t:\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", "def prison_transfer(lista, t, c):\n resp=0\n k = 0\n for a in lista:\n if a<=t:\n k+=1\n else:\n k=0\n if (k>=c):\n resp+=1\n return resp\n \n\n\nentrada1, entrada2 = input(), input()\nentrada1, entrada2 = entrada1.split(), entrada2.split()\nn, t, ec = int(entrada1[0]), int(entrada1[1]),int(entrada1[2])\npresos = []\nfor p in range(len(entrada2)):\n presos.append(int(entrada2[p]))\nprint(prison_transfer(presos, t, ec))\n'''\nn,t,c=[int(i) for i in input().split()]\n \nans=0\nk=0\nfor i in input().split():\n if int(i)<=t:k+=1\n else:k=0\n if (k>=c):ans+=1\nprint(ans)\n'''", "\r\nn, t, c = map(int, input().split())\r\ncrime_severities = list(map(int, input().split()))\r\n\r\ncount = 0\r\ncurrent_segment = 0\r\n\r\nfor severity in crime_severities:\r\n if severity <= t:\r\n current_segment += 1\r\n else:\r\n current_segment = 0\r\n \r\n if current_segment >= c:\r\n count += 1\r\n\r\nprint(count)\r\n", "n, t, c = map(int, input().split())\na = list(map(int, input().split()))\n\ncontinguous = 0\nans = 0\n\nfor i in range(n):\n if a[i] <= t:\n continguous += 1\n else:\n continguous = 0\n if continguous >= c:\n ans += 1\n\n\nprint(ans)\n\n\t\t\t \t\t \t \t\t\t \t\t\t \t \t \t" ]

[ "import sys\r\n\r\nclass Node:\r\n def __init__(self, d):\r\n global nodes\r\n self.ch = {}\r\n self.a = [[], []]\r\n self.d = d\r\n nodes += [self]\r\n\r\nnodes = []\r\npairs = []\r\nres = 0\r\n\r\nN = int(sys.stdin.readline())\r\n_input = sys.stdin.readlines()\r\n_input = [s[:-1] for s in _input]\r\nA = [_input[:N], _input[N:]]\r\nT = Node(0)\r\n\r\nfor i, l in enumerate(A):\r\n for j, s in enumerate(l):\r\n t = T\r\n for c in s:\r\n v = ord(c) - ord('a')\r\n if not v in t.ch:\r\n t.ch[v] = Node(t.d + 1)\r\n t = t.ch[v]\r\n t.a[i] += [j + 1]\r\n\r\nfor n in reversed(nodes):\r\n for i in n.ch:\r\n n.a[0] += n.ch[i].a[0]\r\n n.a[1] += n.ch[i].a[1]\r\n k = min(len(n.a[0]), len(n.a[1]))\r\n for i in range(k):\r\n pairs += [str(n.a[0][-1]) + ' ' + str(n.a[1][-1])]\r\n n.a[0].pop()\r\n n.a[1].pop()\r\n res += n.d\r\n\r\nprint(res)\r\nprint('\\n'.join(pairs))\r\n" ]

[ "n= int(input())\r\ns= [int(x) for x in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(0,len(s)-2):\r\n a.append(s[i+2]-s[i])\r\nm = a.index((min(a)))\r\ns.pop(m+1)\r\nfor i in range(len(s)-1):\r\n b.append(s[i+1]-s[i])\r\nprint(max(b))", "n, nums = int(input()), list(map(int, input().split()))\r\n\r\nmin_diff = float(\"inf\")\r\nfor i in range(1, len(nums)-1):\r\n diff = nums[i+1] - nums[i-1]\r\n if diff < min_diff:\r\n min_diff = diff\r\n min_i = i\r\nnums.pop(min_i)\r\n\r\nmax_difi = -1\r\nfor i in range(1, len(nums)):\r\n difi = nums[i] - nums[i-1]\r\n max_difi = max(difi, max_difi)\r\n\r\nprint(max_difi)", "n = int(input())\r\n\r\nl = list(map(int,input().split()))\r\nm = 0\r\nfor i in range(0,n-1):\r\n m = max(m,l[i+1]-l[i])\r\n\r\na = 10000\r\nfor i in range(1,n-1):\r\n \r\n a = min(a,l[i+1]-l[i-1])\r\n \r\nprint([m,a][m<a])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans1=[]\r\nans2=[]\r\nfor i in range(n-1):\r\n ans1.append(abs(l[i]-l[i+1]))\r\n#print(ans1)\r\nfor i in range(n-2):\r\n\tans2.append(abs(l[i]-l[i+2]))\r\n#print(ans2)\r\nprint(max(max(ans1),min(ans2)))", "input()\r\nX = list(map(int, input().split()))\r\nMIN = X[-1] - X[0]\r\nfor i in range(1, len(X) - 1):\r\n Y = X[:i] + X[i + 1:]\r\n MAX = Y[1] - Y[0]\r\n for j in range(len(Y)):\r\n MAX = max(MAX, Y[j] - Y[j - 1])\r\n MIN = min(MIN, MAX)\r\nprint(MIN)\r\n", "x=int(input())\na=list(map(int,input().split()))\n\ne = []\nfor n in range(1,x-1):\n c = a[:]\n c.pop(n)\n b = []\n for i in range(len(c) - 1):\n b.append(c[i + 1] - c[i])\n\n z=max(b)\n e.append(z)\nd=min(e)\nprint(d)\n\t\t \t \t\t \t\t\t \t\t \t \t \t\t\t\t\t \t", "num = int(input())\r\nli = [int(x) for x in input().split()]\r\nmin = max(li)\r\nmx = 0\r\nfor i in range(len(li) -1):\r\n if li[i+1] - li[i] > mx:\r\n mx = li[i+1] - li[i]\r\nfor i in range(len(li) - 2):\r\n if li[i+2] - li[i] < min:\r\n min = li[i+2] - li[i]\r\nprint(max(mx,min))", "n=int(input())\r\nlis=input().split()\r\nfor i in range(n):\r\n lis[i]=int(lis[i])\r\ndef diff(a):\r\n m=a[1]-a[0]\r\n for i in range(1,len(a)-1):\r\n if a[i+1]-a[i]>m:\r\n m=a[i+1]-a[i]\r\n return m\r\n\r\nlis2=[]\r\nfor i in range(1,n-1):\r\n lis2.append(diff(lis[:i]+lis[i+1:]))\r\nprint(min(lis2))\r\n \r\n \r\n", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline().strip())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\nm = 100000000\r\nindex = -1\r\nfor i in range(n-2):\r\n if lst[i+2]-lst[i] < m:\r\n m = lst[i+2]-lst[i] \r\n index = i+1\r\nlst.pop(index)\r\nm = 0\r\nfor i in range(n-2):\r\n m = max(m, lst[i+1]-lst[i])\r\n# print(lst)\r\nprint(m)\r\n", "n = int(input())\r\nline = input()\r\nline = line.split()\r\nfor i in range(0,n):\r\n line[i] = int(line[i])\r\nmindif = []\r\nfor i in range(1,n-1):\r\n if(i == 1):\r\n dif = line[2] - line[0]\r\n else:\r\n dif = line[1] - line[0]\r\n for j in range(1,n):\r\n if(j == i):\r\n continue\r\n elif(j == (i + 1)):\r\n ndif = line[j] - line[j-2]\r\n else:\r\n ndif = line[j] - line[j-1]\r\n if(ndif > dif):\r\n dif = ndif\r\n mindif.append(dif)\r\nmindif.sort()\r\nprint(mindif[0])\r\n ", "h = int(input())\r\nholds = list(map(int, input().split()))\r\nmin_val = 1000000000000\r\nmin_index = 0\r\nfor i in range(h - 2):\r\n if min_val > abs(holds[i] - holds[i + 2]):\r\n min_val = abs(holds[i] - holds[i + 2])\r\n min_index = i\r\n\r\nholds[min_index + 1] = holds[min_index]\r\nres = 0\r\nfor i in range(h - 1):\r\n res = max(res, abs(holds[i] - holds[i + 1]))\r\nprint(res)", "n, A = int(input()), list(map(int, input().split()))\r\n\r\nprint(max(max(A[i + 1] - A[i] for i in range(n - 1)),\r\n min(A[i + 2] - A[i] for i in range(n - 2))))", "n, lst, res, bd = int(input()), list(map(int, input().split())), 10000000, 0\r\nfor x in range(n - 1): bd = max(bd, lst[x + 1] - lst[x])\r\nfor x in range(1, n - 1): res = min(res, max(bd, lst[x + 1] - lst[x - 1]))\r\nprint(res)", "numnum = int(input())\r\nnums = [int(x) for x in input().split()]\r\noned = nums[1] - nums[0]\r\ntwod = nums[2] - nums[0]\r\nfor i in range(2, numnum):\r\n oned = max(oned, nums[i] - nums[i - 1])\r\n twod = min(twod, nums[i] - nums[i - 2])\r\nprint(max(oned, twod))", "x = int(input())\r\nz = []\r\nw = []\r\nz[0:] = map(int,input().split())\r\np = []\r\nfor i in range(1,len(z)):\r\n if i < len(z)-1:\r\n w.append(z[i + 1] - z[i - 1])\r\n p.append(z[i]-z[i-1])\r\n\r\nif min(w) >= max(p):\r\n print(min(w))\r\nelse:\r\n print(max(p))\r\n", "nbHolds = int(input(\"\"))\r\nholds=input(\"\").split(\" \")\r\nmax_1 = 0\r\nmin_2 = 1001\r\nfor loop in range(nbHolds-1):\r\n max_1 = max(max_1, int(holds[loop+1])-int(holds[loop]))\r\nfor loop in range(nbHolds-2):\r\n min_2 = min(min_2, int(holds[loop+2])-int(holds[loop]))\r\nprint(max(max_1,min_2))", "n= int(input())\r\ns=[int(i) for i in input().split()]\r\nans1=0\r\nfor i in range(n-1):\r\n ans1=max(ans1,s[i+1]-s[i])\r\nans=max(s[2]-s[0],ans1)\r\nfor i in range(1,n-2):\r\n ans=min(ans,max(s[i+2]-s[i],ans1))\r\nprint(ans)", "\ndef solve(n,arr):\n\tmn=1000\n\tfor i in arr[1:-1] :\n\t\tl2=list(arr)\n\t\tl2.remove(i)\n\t\tmx=0\n\t\tfor j in range(n-2) :\n\t\t\tmx= max(mx , l2[j+1]-l2[j])\n\t\tmn=min(mn,mx)\n\treturn mn\n\n\n\nfrom sys import stdin\ninput = stdin.readline\nn= int(input())\nl=[int(x) for x in input().split()]\n\nprint(solve(n,l))\n", "n = int(input())\r\narray=list(map(int, input(). strip(). split()))\r\ndray = []\r\nfor i in range(n-2):\r\n dray.append(array[i+2] - array[i])\r\n#print(dray)\r\ne = dray.index(min(dray))\r\n#print(e,array[e])\r\narray.remove(array[e+1])\r\ndray2 = []\r\nfor i in range(n-2):\r\n dray2.append(array[i+1] - array[i])\r\n#print(dray2)\r\nprint(max(dray2))\r\n\r\n\r\n\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(1,n-1):\r\n\tk1=li+[]\r\n\tk1.remove(li[i])\r\n\tf=[]\r\n\tfor j in range(0,len(k1)-1):\r\n\t\tf.append(k1[j+1]-k1[j])\r\n\tk.append(max(f))\r\nprint(min(k))", "n = int(input())\r\narr = list(map(int, input().split()))\r\ne = 1\r\nans = []\r\nwhile e <= len(arr) - 2:\r\n ls = arr.copy()\r\n ls[e] = 'a'\r\n ls.remove('a')\r\n e += 1\r\n final = []\r\n for i in range(len(ls) - 1):\r\n final.append(abs(ls[i+1]-ls[i]))\r\n ans.append(max(final))\r\nprint(min(ans))\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ndiff=[]\r\nfor i in range(n-1):\r\n diff+=[a[i+1]-a[i]]\r\n# print(diff)\r\nd=[]\r\nfor i in range(n-2):\r\n d+=[a[i+2]-a[i]]\r\n# print(d)\r\nx=max(diff)\r\nprint(max(x,min(d)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 solve():\r\n n = int(input())\r\n ll = list(map(int, input().split()))\r\n temp = 0\r\n for i in range(n-1):\r\n temp = max(temp, ll[i+1] - ll[i])\r\n ans = 99999999\r\n for i in range(1, n-1):\r\n diff = ll[i+1] - ll[i-1]\r\n diff = max(diff, temp)\r\n ans = min(ans, diff)\r\n return ans\r\n\r\nt = 1\r\nwhile t != 0:\r\n res = solve()\r\n print(res)\r\n t -= 1\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nmn_darmion=a[2]-a[0]\r\nfor i in range(n-2):\r\n\tmn_darmion=min(mn_darmion,a[i+2]-a[i])\r\nmx=a[1]-a[0]\r\nfor i in range(n-1):\r\n\tmx=max(mx,a[i+1]-a[i])\r\nprint(max(mx,mn_darmion))", "def f(a):\r\n return max(map(lambda x:a[x+1]-a[x],range(len(a)-1)))\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nprint(min([f(b[:i+1]+b[i+2:])for i in range(a-2)]))\r\n", "N = int(input())\r\nArr = list(map(int,input().split()))\r\nLst = []\r\nfor i in range(N - 1):\r\n Lst = Lst + [Arr[i+1] - Arr[i]]\r\n \r\n#print(Lst)\r\nMaxx,Lst1 = max(Lst),[]\r\nfor i in range(N-2):\r\n Val = Lst[i+1] + Lst[i]\r\n if Val >= Maxx:\r\n Lst1 = Lst1 + [Val]\r\n else:\r\n Lst1 = Lst1 + [Maxx]\r\n#print(Lst1) \r\nprint(min(Lst1))", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nif len(array) == 3:\r\n diff = array[2] - array[0]\r\n print(diff)\r\nelse:\r\n mini = 100001\r\n for i in range(1, n - 1):\r\n diff = array[i + 1] - array[i - 1]\r\n mini = min(mini, diff)\r\n\r\n for i in range(1, n):\r\n mini = max(mini, array[i] - array[i - 1])\r\n print(mini)\r\n", "def maxs(l):\r\n max = 0\r\n for i in range(1,len(l)):\r\n if(max < l[i]-l[i-1]):\r\n max = l[i] - l[i-1]\r\n return max\r\na = []\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nans = []\r\nfor i in range(1, n-1):\r\n ans.append(maxs(a[:i]+a[i+1:]))\r\nprint(min(ans))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nfinal = 1000\r\nfor i in range(0, n-2):\r\n if arr[i+2] - arr[i] < final:\r\n final = arr[i+2] - arr[i]\r\n ans = arr[i+1]\r\narr.remove(ans)\r\nfinal = 0\r\nfor i in range(0, n-2):\r\n if final < (arr[i+1] - arr[i]):\r\n final = arr[i+1] - arr[i]\r\nprint(final)", "n = int(input())\r\nans=[]\r\nans1=[]\r\nl1 = [int(x) for x in input().split()]\r\nfor x in range(len(l1)-2):\r\n ans.append((l1[x+2]-l1[x]))\r\nfor x in range(len(l1)-1):\r\n ans1.append((l1[x+1]-l1[x]))\r\n\r\nprint(max(max(ans1),min(ans)))", "def main():\n\tn = int(input())\n\ta =list(map(int,input().split()))\n\tmin_max = 1000000\n\tmax_diff = 0\n\tfor i in range(1,n-1):\n\t\tmax_diff = 0\n\t\tc = a[:i]+a[i+1:]\n\t\tfor j in range(n-2):\n\t\t\tmax_diff = max(c[j+1]-c[j],max_diff)\n\t\t#print(max_diff)\n\t\tmin_max = min(max_diff,min_max)\n\n\tprint(min_max)\n\t\n\nif __name__ == '__main__':\n\tmain()\n", "n=int(input())\r\na=[int(e) for e in input().split()]\r\nd=1000\r\nfor i in range(1,n-1):\r\n A=a[:i]+a[i+1:]\r\n d=min(d,max(A[i+1]-A[i] for i in range(n-2)))\r\nprint(d)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nmn = 1001\r\nmx = a[-1] - a[-2]\r\n\r\nfor i in range(n - 2):\r\n d = a[i + 2] - a[i]\r\n if d < mn:\r\n mn = d\r\n d = a[i + 1] - a[i]\r\n if d > mx:\r\n mx = d\r\nif mn > mx:\r\n mx = mn\r\nprint(mx)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = []\r\n\r\nfor i in range(1, n-1):\r\n x = a.pop(i)\r\n y = a\r\n result.append(max(y[i+1]-y[i] for i in range(len(y)-1) ))\r\n a.insert(i, x)\r\n \r\nprint(min(result))", "n=int(input())\r\nwhile(n<3 and n>100):\r\n print(\"Valeur incorrecte essayez encore:\",end=\"\")\r\n n=int(input())\r\n\r\n\r\ns=input() \r\nlista=s.split(\" \")\r\n\r\n\r\nlista = [int(i) for i in lista]\r\n\r\n\r\nmin_diff=float('inf') \r\n\r\n\r\nfor i in range(1,n-1):\r\n list1=lista.copy()\r\n \r\n list1.pop(i)\r\n max_diff = 0\r\n for a, b in zip(list1[:-1], list1[1:]):\r\n diff = b - a\r\n if diff > max_diff: \r\n max_diff = diff\r\n if(max_diff < min_diff):\r\n min_diff = max_diff \r\n \r\nprint(min_diff)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "'''input\n5\n1 2 3 7 8\n'''\nn = int(input())\na = list(map(int, input().split()))\nif n == 3:\n\tprint(a[2] - a[0])\nelse:\n\tx = max([a[i+1] - a[i] for i in range(n-1)])\n\ty = min([a[x+2] - a[x] for x in range(n-2)])\n\tprint(max(x,y))\n\n\t", "import copy as cp\r\n\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[]\r\nres=[]\r\nfor i in range(n):\r\n res.append(cp.copy(a))\r\n\r\nfor i in range(1,n-1):\r\n res[i].pop(i)\r\n\r\n\r\nmini=[[0 for j in range(n-2)] for i in range(n-2)]\r\nfor i in range(1,n-1):\r\n for j in range(0,n-2):\r\n mini[i-1][j]=abs(res[i][j]-res[i][j+1])\r\n\r\nfor elem in mini:\r\n elem.sort()\r\n\r\nMin=mini[0][n-3]\r\nfor i in range(1,n-2):\r\n if(mini[i][n-3]<Min):\r\n Min=mini[i][n-3]\r\n\r\nprint(Min)\r\n \r\n", "def main():\n n = int(input())\n aa = list(map(int, input().split()))\n bb = [b - a for b, a in zip(aa[1:], aa)]\n print(max(min(a + b for a, b in zip(bb[1:], bb)), max(bb)))\n\n\nif __name__ == '__main__':\n main()\n", "def solve(arr,n):\n res = []\n for i in range(n-2):\n temp = arr[:]\n temp.pop(i+1)\n max_val = 0\n for j in range(n-2):\n if temp[j+1]-temp[j] > max_val:\n max_val = temp[j+1]-temp[j]\n res.append(max_val)\n\n return min(res)\n\n\n\n\n \n \n\ndef main() :\n n = int(input())\n arr = list(map(int, input().split(' ')))\n # arr = input().split(' ')\n # s = input()\n # res=''\n\n # n = int(input())\n # arr = []\n # for _ in range(n):\n # i = input()\n # arr.append(i)\n \n # # for i in arr:\n # n = int(input())\n # s = input()\n print(solve(arr,n))\n\nmain()\n\n\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmin = 999\r\n\r\n\r\ndef get_max_difference(x: list):\r\n\tx_len = len(x)\r\n\tmax = 0\r\n\tfor i in range(x_len - 1):\r\n\t\tdif = x[i+1] - x[i]\r\n\t\tif dif > max:\r\n\t\t\tmax = dif\r\n\treturn max\r\n\r\nfor i in range(1, n-1):\r\n\tx = get_max_difference(l[:i] + l[i+1:])\r\n\tif x < min:\r\n\t\tmin = x\r\n\r\nprint(min)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ndiff=[]\r\n\r\nfor i in range(1,n-1):\r\n max_diff = arr[i+1] - arr[i-1]\r\n for num in range(n-1):\r\n max_diff = max(max_diff, arr[num+1] - arr[num])\r\n diff.append(max_diff)\r\nprint(min(diff))", "def minimum_difficulty():\r\n\tno_of_holds = int(input())\r\n\r\n\theights = [int(height) for height in input().split()]\r\n\r\n\tsequences = []\r\n\tfor index in range(1, no_of_holds-1):\r\n\t\tsequences.append(heights[:index] + heights[index+1:])\r\n\r\n\tmax_difficulties = []\r\n\tfor sequence in sequences:\r\n\t\tmax_diff = 0\r\n\t\tfor index in range(1, len(sequence)):\r\n\t\t\tif max_diff < sequence[index]-sequence[index-1]:\r\n\t\t\t\tmax_diff = sequence[index]-sequence[index-1]\r\n\t\tmax_difficulties.append(max_diff)\r\n\r\n\tprint(min(max_difficulties))\r\n\r\n\r\nminimum_difficulty()\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nm=max(b)\r\nfor i in range (1,a-1):\r\n if m>b[i+1]-b[i-1]:\r\n m=b[i+1]-b[i-1]\r\nfor i in range(1,a):\r\n if m<b[i]-b[i-1]:\r\n m=b[i]-b[i-1]\r\nprint(m)", "n = int(input())\r\na = list(map(int,input().split()))\r\nc=[]\r\nl=[]\r\nfor i in range(1, n-1):\r\n k=a[i]\r\n del a[i]\r\n for j in range(1,len(a)):\r\n l.append(a[j]-a[j-1])\r\n a.insert(i, k)\r\n c.append(max(l))\r\n l=[]\r\nprint(min(c))\r\n", "n=int(input())\r\na=list(map(int,input(). split()))\r\nm=1000\r\nx=-1\r\nfor j in range(1,n-1):\r\n\td=a[j+1]-a[j-1]\r\n\tif d<m:\r\n\t\tm=d\r\n\t\tx=j\r\na.remove(a[x])\r\nm=0\r\nfor v in range(1,len(a)):\r\n\tm=max(m,a[v]-a[v-1])\r\nprint(m)", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\nd = []\r\nfor i in range(n):\r\n x = list.copy(t)\r\n if i != 0 and i != n-1:\r\n x.pop(i)\r\n max = 0\r\n for e in range(n - 2):\r\n if x[e + 1] - x[e] > max:\r\n max = x[e + 1] - x[e]\r\n d.append(max)\r\nprint(min(d))\r\n\r\n\r\n\r\n", "n = int(input())\r\nlist = [int(x) for x in input().split()] \r\nrlist = []\r\nfor i in list:\r\n if(i!=list[0] and i!=list[-1]):\r\n lval = []\r\n k = [x for x in list if x!=i]\r\n for j in range(len(k)):\r\n if(j+1>=len(k)):\r\n break\r\n raz = k[j+1]-k[j]\r\n lval.append(raz)\r\n rlist.append(max(lval))\r\nprint(min(rlist))", "n=int(input())\r\ns=input().split()\r\na=[]\r\nb=[]\r\nfor i in range (0,n-1):\r\n k=int(s[i+1])-int(s[i])\r\n a.append(k)\r\nfor i in range(0,n-2):\r\n k=a[i]+a[i+1]\r\n b.append(k)\r\nc=max(a)\r\nd=min(b)\r\nif(c<d):\r\n print(d)\r\nelse:\r\n print(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = 1001\r\nfor i in range(n-2):\r\n if a[i+2]-a[i]<result:\r\n result = a[i+2]-a[i]\r\n\r\nfor i in range(n-1):\r\n result = max(result, a[i+1]-a[i])\r\nprint(result)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ny=0\r\nfor i in range(1,n-1):\r\n b=a[:]\r\n b.pop(i)\r\n x=0\r\n for i in range(len(b)-1):\r\n if(b[i+1]-b[i]>x):\r\n x=b[i+1]-b[i]\r\n if(x<y or y==0):\r\n y=x\r\nprint(y)", "def diff(lst):\r\n n=len(lst)\r\n m=abs(lst[0]-lst[1])\r\n for i in range(n-1):\r\n if abs(lst[i]-lst[i+1])>m:\r\n m=abs(lst[i]-lst[i+1])\r\n return m\r\nn=int(input())\r\nl2=[]\r\nlst=list(map(int,input().split(\" \")))\r\nfor i in range(1,n-1):\r\n l2.append(diff(lst[:i]+lst[i+1:]))\r\n #print(lst[:i]+lst[i+1:])\r\nprint(min(l2))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum1=9999999\r\nsum2=0\r\nfor i in range(n-1):\r\n if(l[i+1]-l[i]>sum2):\r\n sum2=l[i+1]-l[i]\r\n if(i<=n-3):\r\n if(l[i+2]-l[i]<sum1):\r\n sum1=l[i+2]-l[i]\r\nprint(max(sum1,sum2))", "n=int(input())\r\nl=list(map(int,input().split()))\r\np=[]\r\nfor i in range(1,n-1):\r\n\tx=l[:i]+l[i+1:]\r\n\tt=x[0]\r\n\tc=-2636263637236665\r\n\tfor j in x[1:]:\r\n\t\tg=j-t\r\n\t\tif g>c:\r\n\t\t\tc=g\r\n\t\tt=j\r\n\tp.append(c)\r\nprint(min(p))\r\n\t\t\r\n\t\r\n\t\t\r\n", "n = int(input())\nv = list(map(int, input().split()))\ni = min(range(1, n - 1), key=lambda x: v[x + 1] - v[x - 1])\nv.pop(i)\nprint(max(y - x for x, y in zip(v, v[1:])))\n", "n=int(input())\r\narray=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nc=0\r\nfor i in range(1,n-1):\r\n p=array.pop(i)\r\n for j in range(n-2):\r\n d=abs(array[j]-array[j+1])\r\n a.append(d)\r\n b.append(max(a))\r\n a.clear()\r\n array.insert(i,p)\r\nprint(min(b))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 20000\r\nfor i in range(1, n-1):\r\n z = a[:i] + a[i+1:]\r\n ak = -1;\r\n for j in range(1, n-1):\r\n ak = max(ak, z[j] - z[j-1])\r\n ans = min(ans, ak)\r\nprint(ans)\r\n", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n options = []\r\n for i in range(1, n - 1):\r\n options.append([arr[0]] + arr[1:i] + arr[i+1:n- 1] + [arr[-1]])\r\n\r\n ans = []\r\n for i in options:\r\n mx = float('-inf')\r\n for j in range(n - 2):\r\n mx = max(mx, i[j + 1] - i[j])\r\n ans.append(mx)\r\n\r\n print(min(ans))\r\nmain()\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nminm = 1000000\r\nmaxm = 0\r\nfor i in range(1,len(a) - 1):\r\n diff = a[i + 1] - a[i - 1]\r\n if diff < minm:\r\n minm = diff\r\nfor i in range(1,len(a)):\r\n d = a[i] - a[i-1]\r\n if d > maxm:\r\n maxm = d\r\n \r\nif len(a) == 3:\r\n print(a[2] - a[0])\r\nelse:\r\n print(max(minm,maxm))\r\n", "def find_max_dif(a, n):\r\n dif = -1\r\n for i in range(n-2):\r\n val = a[i+1] - a[i]\r\n if val > dif:\r\n dif = val\r\n return dif\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\ny = [0 for _ in range(n-1)]\r\ndif = 10**6\r\nfor i in range(1, n-1):\r\n y[:i] = x[:i]\r\n y[i:] = x[i+1:]\r\n val = find_max_dif(y, n)\r\n if dif > val:\r\n dif = val\r\nprint(dif)", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nif n==3:\r\n print(lis[2]-lis[0])\r\nelse:\r\n diff=0\r\n for i in range(1,n):\r\n if lis[i]-lis[i-1]>diff:\r\n diff=lis[i]-lis[i-1]\r\n curdiff=1000\r\n for i in range(2,n):\r\n if lis[i]-lis[i-2]<curdiff:\r\n curdiff=lis[i]-lis[i-2]\r\n print(max(diff,curdiff))", "def min_difficulty():\r\n l = int(input())\r\n x = list(map(int,input().split()))\r\n if l==3: return x[2]-x[0];\r\n diff = []\r\n for j in range(1,l-1):\r\n maxi =0\r\n y=x.copy()\r\n y.pop(j)\r\n for i in range(l-2):\r\n z = y[i+1]-y[i]\r\n if z > maxi:\r\n maxi = z\r\n diff.append(maxi)\r\n return min(diff)\r\nprint(min_difficulty())", "import sys\r\n\r\ndef main():\r\n _, *l = map(int, sys.stdin.read().strip().split())\r\n m = max(j-i for i,j in zip(l, l[1:]))\r\n \r\n return max(min(l[i+2] - l[i] for i in range(len(l)-2)), m)\r\n\r\nprint(main(), sep='\\n')", "\r\n# ██╗ ██╗ █████╗ ██╗ ██████╗ ███████╗ ████████╗ ██╗ ██╗ \r\n# ██║ ██╔╝██╔══██╗██║ ██╔══██╗ ██╔════╝ ██ ╔════╝ ██║ ██║ \r\n# █████╔╝ ███████║██║ ██║ ██║ █████╗ ████████║ ███████║ \r\n# ██╔═██╗ ██╔══██║██║ ██║ ██║ ██╔══╝ ╔════╝██║ ██╔══██║ \r\n# ██║ ██╗██║ ██║███████╗██████╔╝ ███████╗ ████████║ ██║ ██║ \r\n# ╚═╝ ╚═╝╚═╝ ╚═╝╚══════╝╚═════╝ ╚══════╝ ╚══════╝╚ ═╝ ╚═╝ \r\n\r\nMOD = int(1e9)+7\r\nfrom math import sqrt,ceil,log,log2,\\\r\nfloor,gcd,pi,factorial,lcm\r\nfrom collections import deque\r\nfrom itertools import permutations\r\n\r\ndef solve():\r\n mn = MOD\r\n for i in range(1,n-1):\r\n temp = a[::]\r\n mx = -1\r\n del temp[i]\r\n for i in range(1,n-1):\r\n mx = max(mx,temp[i]-temp[i-1])\r\n mn = min(mn,mx)\r\n print(mn)\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n solve()", "n=int(input())\r\nli=[int(i) for i in input().split()]\r\nout=[]\r\nfor i in range(2,n):\r\n wr=li.copy()\r\n del wr[i-1]\r\n mx=[]\r\n for i in range(n-2):\r\n mx.append(wr[i+1]-wr[i])\r\n out.append(max(mx))\r\nprint(min(out))", "n=int(input())\r\nm=[]\r\narr=[int(i) for i in input().split()]\r\nfor i in range(1,n-1):\r\n l=[]\r\n j=0\r\n while(j!=n-1):\r\n if (j+1)==i:\r\n l.append(arr[i+1]-arr[j])\r\n j=j+2\r\n else:\r\n l.append(arr[j+1]-arr[j])\r\n j=j+1\r\n m.append(max(l))\r\nprint(min(m))\r\n ", "n=int(input())\r\nx=list(map(int,input().split()))\r\nl=len(x)\r\nc=0\r\nd=x[2]-x[0]\r\nfor i in range(1,l):\r\n c=max(x[i]-x[i-1],c)\r\n if i>=2:\r\n d=min(x[i]-x[i-2],d)\r\nprint(max(c,d))", "# n,k = map(int, input().split())\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nif n == 3:\r\n print(arr[2] - arr[0])\r\n exit()\r\nx, y = float('-inf'), float('inf')\r\nfor i in range(1, n):\r\n # print(f\"{arr[i]} - {arr[i-1]} = \", arr[i] - arr[i-1])\r\n x = max(x, arr[i] - arr[i-1])\r\nfor i in range(n-2):\r\n # print(f\"{arr[i+2]} - {arr[i]} = \", arr[i+2] - arr[i])\r\n y = min(y, arr[i+2] - arr[i]) \r\nprint(max(x, y))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n# print(set(arr))\r\n\r\n# i = j = n-1\r\n# while i>0 and arr[i-1] > arr[i]:\r\n# i -= 1\r\n\r\n# print(i)\r\n\r\n\r\n\r\n\r\n# x=input().strip()\r\n\r\n\r\n# n,m= [int(x) for x in input().split()]\r\n\r\n\r\n\r\n# n,m= [int(x) for x in input().split()]\r\n# arr=[]\r\n# for i in range(n):\r\n# arr.append([int(x) for x in input().split()])\r\n\r\n# n,m= [int(x) for x in input().split()]\r\n# arr=[]\r\n# for i in range(n):\r\n# arr.append([x for x in input().strip()])\r\n\r\n\r\n# n=int(input())\r\n# arr=[]\r\n# for i in range(n):\r\n# arr.append([int(x) for x in input().split()])\r\n\r\n\r\n\r\n# n=int(input())\r\n# arr=[int(x) for x in input().split()]\r\n# '''", "n=int(input())\r\nfinal=[]\r\ngiven=list(map(int,input().split()))\r\nfor i in range(1,n-1):\r\n l=[]\r\n j=0\r\n while j!=n-1:\r\n if j+1==i:\r\n l.append(given[i+1]-given[j])\r\n j+=2\r\n else:\r\n l.append(given[j+1]-given[j])\r\n j+=1\r\n final.append(max(l))\r\nprint(min(final))", "n=int(input())\nl=list(map(int,input().split()))\nif(n==3):\n print(l[2]-l[0])\nelse :\n diff=[]\n for i in range(1,n-1):\n sub = l[:i]+l[i+1:]\n diff.append(max([sub[j+1] - sub[j] for j in range(len(sub)-1)]))\n print(min(diff))\n ", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nMIN = abs(data[2] - data[0])\r\nmin_index = 1\r\nfor i in range(1, n - 1):\r\n if abs(data[i - 1] - data[i + 1]) < MIN:\r\n min_index = i\r\n MIN = abs(data[i - 1] - data[i + 1])\r\ndata.pop(min_index)\r\nd = 0\r\nfor i in range(len(data) - 1):\r\n d = max(d, abs(data[i] - data[i + 1]))\r\nprint(d)\r\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nm = []\r\nf = [l[i]-l[i-1] for i in range(1, n)]\r\nfor i in range(1, n-1):\r\n m.append(max((l[i+1]-l[i-1]), max(f)))\r\n\r\nprint(min(m))", "n, t = int(input()) - 1, list(map(int, input().split()))\r\nprint(max(max(t[i + 1] - t[i] for i in range(n)), min(t[i + 2] - t[i] for i in range(n - 1))))", "nb_holds = eval(input())\r\npos = [eval(i) for i in input().split()]\r\nsize = len(pos)\r\ndef difficulty(run):\r\n max_D = 0\r\n for a, b in zip(run[:-1], run[1:]):\r\n if max_D < b-a:\r\n max_D = b-a\r\n return(max_D)\r\n \r\nmin_diff = 1001\r\nfor i in range(1, size-1):\r\n new_run = pos[:i] + pos[i+1:]\r\n new_diff = difficulty(new_run)\r\n if new_diff < min_diff:\r\n min_diff = new_diff\r\nprint(min_diff)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = 1001\r\ne = 0\r\nfor i in range(n - 1):\r\n if l[i + 1] - l[i] > e:\r\n e = l[i + 1] - l[i] \r\nfor i in range(n - 2):\r\n if l[i+2] - l[i] < d:\r\n d = l[i + 2] - l[i]\r\nprint(max(d, e))\r\n ", "def main():\n n = int(input())\n heights = [int(_) for _ in input().split()]\n current_difficulty = max(heights[i] - heights[i - 1] for i in range(1, n))\n minimum_difficulty = min([max(current_difficulty, heights[i + 2] - heights[i]) for i in range(n - 2)])\n\n print(minimum_difficulty)\n\n\nif __name__ == '__main__':\n main()\n", "def getMax(heights):\r\n ans = []\r\n for i in range(len(heights)-1): \r\n ans.append(heights[i+1] - heights[i])\r\n return max(ans)\r\ndef minimumDifficulty(heights):\r\n ans = []\r\n for i in range(1, len(heights)-1):\r\n popped = heights.pop(i) \r\n ans.append(getMax(heights))\r\n heights.insert(i, popped) \r\n\r\n return min(ans)\r\n\r\nn = int(input())\r\nheights = list(map(int, input().split()))\r\nprint(minimumDifficulty(heights))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(1,n-1):\r\n temp=l[0:i]+l[i+1:]\r\n m=0\r\n for j in range(len(temp)-1):\r\n m=max(m,temp[j+1]-temp[j])\r\n t.append(m)\r\n\r\nprint(min(t))\r\n", "n = int(input())\r\ndef diff(li):\r\n return max ([li[i+1]-li[i] for i in range(n-2)] )\r\nl = list(map(int, input().split()))\r\nl2 = [l[i+2]-l[i] for i in range(n-2)]\r\nl.pop(1+l2.index(min(l2)))\r\nprint(diff(l))", "if __name__ == '__main__':\n\n count = int(input())\n points = input().split(\" \")\n\n maxes = []\n for i in range(1, count - 1):\n pointsDistance = []\n pointsCopy = points.copy()\n pointsCopy.remove(points[i])\n\n for index in range(len(pointsCopy)-1):\n distance = int(pointsCopy[index + 1]) - int(pointsCopy[index])\n pointsDistance.append(distance)\n\n maxes.append(max(pointsDistance))\n\n print(min(maxes))\n", "n = int(input())\r\nL = list(map(int,input().split()))\r\nR = []\r\nfor i in range(1,n-1):\r\n ans = -1e9\r\n cur = L.pop(i)\r\n for j in range(1,n-1):\r\n ans = max(ans,L[j]-L[j-1])\r\n R.append(ans)\r\n L.insert(i,cur)\r\nprint(min(R))\r\n", "length = int(input())\r\nlist_ = list(map(int,input().split()))\r\ndifference = []\r\nfor index in range(1, length - 1):\r\n difference.append(list_[index] - list_[index - 1])\r\ndifference.append(list_[-1] - list_[-2])\r\nresult = []\r\nfor index in range(1, length - 1):\r\n result.append(max(difference[index] + difference[index - 1], max(difference)))\r\nprint(min(result))", "n=int(input())\r\nlis=list(map(int,input().split()))\r\ndif=abs(lis[1]-lis[0])\r\npos=[]\r\nfor i in range(n-1):\r\n #print(i,end=\",\")\r\n if(abs(lis[i]-lis[i+1])>dif):\r\n dif=abs(lis[i]-lis[i+1])\r\nfor i in range(1,n-1):\r\n t=abs(lis[i-1]-lis[i+1])\r\n if(t>dif):\r\n pos.append(t)\r\n else:\r\n pos.append(dif)\r\n#print(dif)\r\nprint(min(pos))\r\n\r\n", "# import sys\n# sys.stdin = open('input.txt', 'r') \n# sys.stdout = open('output.txt', 'w')\n\nimport math\n\ndef solve(arr, n):\n\tmax_diff = -math.inf\n\tresult = math.inf\n\n\tfor i in range(1, n):\n\t\tmax_diff = max(max_diff, arr[i] - arr[i-1])\n\n\tfor i in range(1, n-1):\n\t\tresult = min(result, max(max_diff, arr[i+1]-arr[i-1]))\n\treturn result\n\nn = int(input())\narr = list(map(int, input().strip().split()))\nresult = solve(arr, n)\nprint(result)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(n-2):\r\n\tm=1\r\n\tfor j in range(n-2):\r\n\t\tif(j==i):\r\n\t\t\tif ( l[j+2]-l[j] >m):\r\n\t\t\t\tm=l[j+2]-l[j]\r\n\t\telif(j>i):\r\n\t\t\tif(l[j+2]-l[j+1]>m):\r\n\t\t\t\tm=l[j+2]-l[j+1]\r\n\t\telse:\r\n\t\t\tif(l[j+1]-l[j]>m):\r\n\t\t\t\tm=l[j+1]-l[j]\r\n\td.append(m) \r\nprint(min(d))", "n=int(input())\r\na=list(map(int, input().split()))\r\nmini=min([a[i + 1] - a[i - 1] for i in range(1, n - 1)])\r\nmaxi = max([a[i] - a[i - 1] for i in range(1, n)])\r\nprint(max(mini, maxi))", "n=int(input())\r\ns=[int(i) for i in input().split(' ')]\r\n\r\ndef check(a):\r\n n=len(a)\r\n ans=0\r\n for i in range(n-1):\r\n ans = ans if ans>a[i+1]-a[i] else a[i+1]-a[i]\r\n #print(a)\r\n return ans\r\n\r\nans=1<<30\r\nfor i in range(1,n-1):\r\n v=check(s[0 : i]+s[i+1 : n])\r\n ans = ans if ans<v else v\r\n # print (i,v)\r\n\r\nprint (ans)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 10000000000000\r\nfor i in range(1, n-1):\r\n dup = l[:]\r\n dup.pop(i)\r\n diff = -1\r\n for j in range(len(dup)-1):\r\n diff = max(dup[j+1]-dup[j], diff)\r\n ans = min(ans, diff)\r\nprint(ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nmi = 10000\r\nmiind = 0\r\nfor i in range(1, n-1):\r\n diff = abs(a[i-1] - a[i+1])\r\n if diff < mi:\r\n mi = diff\r\n miind = i\r\n\r\na.pop(miind)\r\n\r\nma = 0\r\nfor i in range(n-2):\r\n ma = max(ma, abs(a[i]- a[i+1]))\r\n\r\nprint(ma)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nans=[]\r\nfor i in range(1,a-1):\r\n c=b[:i]+b[i+1:]\r\n x=-1000000\r\n n=len(c)\r\n for i in range(0,n-1):\r\n x=max(x,c[i+1]-c[i])\r\n ans.append(x)\r\nprint(min(ans))", "n=input()\r\nn=int(n)\r\nx=[int(i) for i in input().split()]\r\ni=1\r\nt=[]\r\nwhile i<n-1:\r\n y=[]\r\n for j in range(n):\r\n if not j==i:\r\n y.append(x[j])\r\n mi=0\r\n for j in range(n-2):\r\n if j==0:\r\n mi=y[j+1]-y[j]\r\n else:\r\n mi=max(mi,y[j+1]-y[j])\r\n t.append(mi)\r\n i+=1\r\nprint(min(t))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nres_list = []\r\n\r\nfor i in range(1, len(a)-1):\r\n sub = list(a)\r\n sub.pop(i)\r\n pos = 0\r\n dif_list = []\r\n while pos < len(sub)-1:\r\n dif = 0\r\n dif = sub[pos+1] - sub[pos]\r\n dif_list.append(dif)\r\n pos += 1\r\n res = max(dif_list)\r\n res_list.append(res)\r\n\r\nres = min(res_list)\r\nprint(res)\r\n", "# python 3\n\nn_val = int(input())\nheights = list(map(int, input().split()))\n\ndifficulties = list()\nfor hold in range(1, n_val-1):\n differences = list()\n new_heights = list()\n for ladder in list(range(0, hold)) + list(range(hold+1, n_val)):\n new_heights.append(heights[ladder])\n # print(new_heights)\n for ladder in range(1, n_val-1):\n differences.append(new_heights[ladder]-new_heights[ladder-1])\n difficulties.append(max(differences))\nprint(min(difficulties))\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nt=a[1]-a[0]\r\nfor i in range(1,n-1):\r\n if a[i+1]-a[i]>t:\r\n t=a[i+1]-a[i]\r\np=[]\r\nfor i in range(1,n-1):\r\n z=a[i+1]-a[i-1]\r\n p.append(z)\r\nprint(max(min(p),t))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = 100000\r\ndiff = 0\r\nfor i in range(n):\r\n if i > 0:\r\n tp = a[i] - a[i-1]\r\n if tp > diff:\r\n diff = tp\r\n if i > 1:\r\n temp=a[i] - a[i-2]\r\n if temp < ans:\r\n ans = temp\r\nif ans > diff:\r\n print(ans)\r\nelse:\r\n print(diff)\r\n", "import math\r\nn = int(input())\r\nlst = [int(x) for x in input().split()]\r\nmn = math.inf\r\nmx = -math.inf\r\n\r\nfor i in range(0, n - 2):\r\n if lst[i + 2] - lst[i] < mn:\r\n mn = lst[i + 2] - lst[i]\r\n if lst[i + 1] - lst[i] > mx:\r\n mx = lst[i + 1] - lst[i]\r\n\r\nif lst[len(lst) - 1] - lst[len(lst) - 2] > mx:\r\n mx = lst[len(lst) - 1] - lst[len(lst) - 2]\r\n\r\nprint(max(mn, mx))\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndif = float(\"inf\")\r\nfor i in range(2, n):\r\n if dif > arr[i] - arr[i - 2]:\r\n dif = arr[i] - arr[i - 2]\r\n rem = i-1\r\narr.pop(rem)\r\nans = float(\"-inf\")\r\nfor i in range(1, len(arr)):\r\n ans = max(ans, arr[i]-arr[i-1])\r\nprint(ans)\r\n", "n = int(input().strip())\r\narr = list(map(int, input().strip().split()))\r\nprevMax = 0\r\nfor i in range(n-1):\r\n\tprevMax = max(prevMax, arr[i+1]-arr[i])\r\nmini = 999999999999999\r\nfor i in range(n-2):\r\n\tmini = min(mini, arr[i+2]-arr[i])\r\nprint(max(mini, prevMax))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\ndiff=[0]+[a[i]-a[i-1] for i in range(1,n)]\r\nres=a[-1]\r\n \r\nfor i in range(1,n-1):\r\n res=min(res,max(diff[:i]+[a[i+1]-a[i-1]]+diff[i+1:]))\r\n\r\nprint(res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nfor i in range(1,n):\r\n b.append(a[i]-a[i-1])\r\nfd=max(b)\r\nfor j in range(2,n):\r\n c.append(a[j]-a[j-2])\r\nad=min(c)\r\n#print(fd,ad)\r\nif(fd>ad):\r\n print(fd)\r\nelse:\r\n print(ad)", "def difficulty(trace, lenght):\n result = 0\n for i in range(1, lenght):\n new_result = trace[i] - trace[i-1]\n if new_result > result:\n result = new_result\n return result\n\n\nn = int(input())\ntrace = [int(i) for i in input().split()]\nmin_difficulty = trace[n-1] - trace[0]\nfor i in range(1, n-1):\n new_min = difficulty(trace[:i]+trace[i+1:], n-1)\n if new_min < min_difficulty:\n min_difficulty = new_min\nprint(min_difficulty)", "n = int(input())\na = list(map(int, input().split()))\nmax_d = 0\nfor i in range(1, n):\n max_d = max(max_d, a[i] - a[i - 1])\n\nans = 1000\nfor i in range(2, n):\n d = max(max_d, a[i] - a[i - 2])\n ans = min(ans, d)\nprint(ans)", "a = int(input())\r\nb = list(map(int,input().split()))\r\nlis1 = [b[item]-b[item-1] for item in range(1,a)]\r\nlis2 = [b[item+1]-b[item-1] for item in range(1,a-1)]\r\nprint(max(max(lis1),min(lis2)))\r\n\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nins = [int(x) for x in input().split()]\r\ndiffs = [ins[i+1] - ins[i] for i in range(n - 1)]\r\ndblDiffs = [(diffs[i+1] + diffs[i] , i+1) for i in range(n - 2)]\r\n\r\ndef key(value):\r\n return value[0]\r\n\r\n# print(diffs)\r\n\r\nmn = min(dblDiffs)\r\ndiffs.pop(mn[1])\r\ndiffs[mn[1] - 1] = mn[0]\r\nprint(max(diffs))", "n=int(input())\r\nl=[]\r\nl1=[]\r\na=[int(x) for x in input().split()]\r\nfor i in range(1,n-1):\r\n b=a.copy()\r\n b.pop(i)\r\n l.append([(b[j+1]-b[j]) for j in range(n-2)])\r\nfor i in l:\r\n l1.append(max(i))\r\nprint(min(l1))\r\n", "#n, d = input().split()\n#n = int (n)\n#d = int (d)\nn = int(input())\na = list(map(int, input().split()))\n#g = list(map(int, input().split()))\n#x1, y1, x2, y2 =map(int,input().split())\n#n = int(input())\n# = [\"\"]*n\n#f = [0]*n\n#t = [0]*n\n#f = []\n\n\n#f1 = sorted(f, key = lambda tup: tup[0])\n\nm = 10000\n\nfor i in range (2, n):\n m = min (m, a[i]-a[i-2])\nfor i in range(1, n):\n m = max (m, a[i]-a[i-1])\nprint (m)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmini=1000\r\nfor i in range(1,len(l)-1):\r\n # var=l[i+1]-l[i-1]\r\n temp=[]\r\n for j in range(0,len(l)):\r\n if(j!=i):\r\n temp.append(l[j])\r\n maxi=0\r\n for j in range(1,len(temp)):\r\n maxi=max(temp[j]-temp[j-1],maxi)\r\n mini=min(maxi,mini)\r\nprint(mini)", "n=int(input())\r\na=list(map(int,input().split()))\r\nprint(max([min([a[i+2]-a[i] for i in range(n-2)])]+[a[i+1]-a[i] for i in range(n-1)]))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin_difficulty = a[-1] - a[0]\r\nfor i in range(1, len(a)-1):\r\n temp = a.copy()\r\n del temp[i]\r\n current_max_difficulty = temp[1]-temp[0] \r\n for j in range(0, len(temp)-1):\r\n current_difficulty = temp[j+1] - temp[j]\r\n if( current_difficulty> current_max_difficulty):\r\n current_max_difficulty = current_difficulty\r\n if(min_difficulty>current_max_difficulty):\r\n min_difficulty = current_max_difficulty\r\nprint(min_difficulty)\r\n \r\n ", "n = int(input())\r\na = [int(s) for s in input().split(\" \")]\r\nans = 10000\r\nfor i in range(1, n-1):\r\n cur = 0\r\n for j in range(1, n):\r\n if j == i:\r\n val = a[j+1] - a[j-1]\r\n else:\r\n val = a[j] - a[j-1]\r\n cur = max(cur, val)\r\n ans = min(ans, cur)\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=[]\r\n# for i in range(1,n-1):\r\n# \tl=(a[0:i]+a[i+1:n])\r\n# \tmax1=0\r\n# \tfor j in range(n-2):\r\n# \t\tw=l[j+1]-l[j]\r\n# \t\tif max1<w:\r\n# \t\t\tmax1=w\r\n# \tm.append(max1)\r\nmax1=0\r\nfor i in range(n-1):\r\n\tp=a[i+1]-a[i]\r\n\tif p>max1:\r\n\t\tmax1=p\r\nd=[]\r\nfor i in range(n-2):\r\n\td.append(max(a[i+2]-a[i],max1))\r\nprint(min(d))", "n = int(input())\ns = [int(i) for i in input().split()]\nk = s[2]-s[0]\nl = 0\nfor i in range(n-2):\n k = min(k, s[i+2]-s[i])\n l = max(l, s[i+1]-s[i])\nl = max(l, s[-1]-s[-2])\nprint(max(l, k))\n", "def calcMax(array, n):\r\n Max = 0\r\n for i in range(n - 1):\r\n Max = max(Max, array[i + 1] - array[i])\r\n\r\n return Max\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n array = [int(i) for i in input().split()]\r\n Min = 1000\r\n for i in range(1, n - 1):\r\n Min = min(Min, calcMax(array[:i] + array[i + 1:], n - 1))\r\n\r\n return Min\r\n\r\n\r\nprint(solve())\r\n", "n, = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmini = min([a[i + 1] - a[i - 1] for i in range(1, n - 1)])\r\nmaxi = max([a[i] - a[i - 1] for i in range(1, n)])\r\nprint(max(mini, maxi))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[]\r\ndef dif(list1):\r\n list2=[]\r\n for i in range(len(list1)-1):\r\n list2.append(abs(list1[i+1]-list1[i]))\r\n return max(list2)\r\n\r\n\r\nfor i in range(1,len(l)-1):\r\n k=l.copy()\r\n k.remove(l[i])\r\n ans.append(dif(k))\r\n\r\nprint(min(ans))\r\n\r\n", "n = int(input())\narr = list(map(int, input().split()))\nimport math\n\nresult = []\nfor i in range(1, n-1):\n subarr = arr[:i]+arr[i+1:]\n max_diff = -math.inf\n for j in range(len(subarr)-1):\n max_diff = max(max_diff, subarr[j+1]-subarr[j])\n result.append(max_diff)\n\nprint(min(result))", "n=int(input())\nar=list(map(int,input().split()))\ncons_sub=[]\nskip=[]\nprev_no=ar[0]\nfor i in range(1,n):\n cons_sub.append(ar[i]-prev_no)\n while i+1<n:\n skip.append(ar[i+1]-prev_no)\n break;\n prev_no=ar[i]\nif max(cons_sub)>min(skip):\n print(max(cons_sub))\nelse:\n print(min(skip))\n\n \t\t \t\t \t\t\t\t\t \t \t \t \t", "import math\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n#-----------------------------------\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nE=0;p=10**4\r\nfor i in range(n-1):\r\n E=max(E,a[i+1]-a[i])\r\nfor i in range(n-2):\r\n p=min(p,a[i+2]-a[i])\r\nprint(max(E,p))", "n=int(input())\r\nkaneki=list(map(int,input().split()))\r\nstjepan=1000\r\nfor akumulator in range(1,n-1):\r\n ken=kaneki[:akumulator]+kaneki[akumulator+1:]\r\n alex=0\r\n for bušman in range(len(ken)-1):\r\n steve=ken[bušman+1]-ken[bušman]\r\n if steve>alex:\r\n alex=steve\r\n if alex<stjepan:\r\n stjepan=alex\r\nprint(stjepan)", "n=int(input())\na=list(map(int,input().split()))\n\nbr=float(\"INF\")\n\nfor i in range(1,n-1):\n b=[]\n x=a[0:i]\n y=a[i+1:]\n for j in x:\n b.append(j)\n for j in y:\n b.append(j)\n rj=0\n for j in range(n-2):\n if abs(b[j]-b[j+1])>rj:\n rj=abs(b[j]-b[j+1])\n if rj<br:\n br=rj\n\nprint(br)\n\n\t \t \t\t \t\t \t \t\t\t \t\t\t\t \t \t\t\t", "n=int(input())\r\narr=list(map(int,input().split()))\r\nprevDist = 0\r\nfor i in range(n-1):\r\n prevDist=max(prevDist,arr[i+1]-arr[i])\r\nmini=9999999999999\r\nfor i in range(n-2):\r\n mini = min(mini, arr[i+2]-arr[i])\r\nprint(max(mini,prevDist))", "# Description of the problem can be found at http://codeforces.com/problemset/problem/496/A\r\n\r\n\r\nn = int(input())\r\nl_n = list(map(int, input().split()))\r\nm = l_n[n - 1] - l_n[0]\r\nfor i in range(1, n - 1):\r\n t_m = 0\r\n for j in range(1, n - 1):\r\n if j == i:\r\n t_m = max(t_m, l_n[j + 1] - l_n[j - 1])\r\n elif j + 1 != i:\r\n t_m = max(t_m, l_n[j + 1] - l_n[j])\r\n m = min(m, t_m)\r\nprint(m)", "\r\n\r\nn = int(input())\r\n\r\na = [int(a) for a in input().split()]\r\n\r\nmx = a[1] - a[0]\r\n\r\nfor i in range(1 , n - 1):\r\n mx = max(mx , a[i + 1] - a[i])\r\nl = [] \r\nl.append(max(mx , a[2] - a[0]))\r\nfor i in range(1 , n - 2):\r\n l.append(max(mx , a[i + 1] - a[i - 1]))\r\n \r\nl.sort()\r\n\r\nprint(l[0])\r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = []\r\nfor i in range(1,n-1):\r\n a = []\r\n y = l[i]\r\n l.pop(i)\r\n for j in range(n-2):\r\n d = l[j+1]-l[j]\r\n a.append(d)\r\n m.append(max(a))\r\n l.insert(i,y)\r\nprint(min(m))\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nfor i in range(1,n):\r\n b.append(a[i]-a[i-1])\r\nc=[]\r\nfor i in range(2,n):\r\n c.append(max(max(b),b[i-2]+b[i-1]))\r\nprint(min(c))", "n = int(input())\narr = list(map(int, input().split()))\n\nx = 0 \n\nfor i in range(1, n):\n\tx = max(x, arr[i] - arr[i - 1])\n\nmaximum = 10 ** 6\n\nfor j in range(1, n - 1):\n\tmaximum = min(maximum, max(x, arr[j + 1] - arr[j - 1]))\n\nprint(maximum)\n\n", "n=int(input())\r\nb=list(map(int, input().split()))\r\ndef max_d(a):\r\n d=a[1]-a[0]\r\n for i in range(len(a)):\r\n if a[i]-a[i-1]>d:\r\n d=a[i]-a[i-1]\r\n return d\r\nmin_diff=max_d(b[:1]+b[2:])\r\nfor i in range(1,n-1):\r\n if min_diff>max_d(b[:i]+b[i+1:]):\r\n min_diff=max_d(b[:i]+b[i+1:])\r\nprint(min_diff)", "n,l,k=int(input()),0,1000\r\na=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n l=max(l,a[i+1]-a[i])\r\n if i!=n-2:k=min(k,a[i+2]-a[i])\r\nprint(max(k,l))", "n = int(input())\nsteps = [int(i) for i in input().split()]\ns1, s2 = iter(steps), iter(steps)\nnext(s2)\ndiffs = [j-i for i, j in zip(s1, s2)]\nif len(diffs) == 2:\n print(diffs[0] + diffs[1])\nelse:\n min_diff = 1000000\n for i in range(0, len(diffs)-1):\n diff = max(*diffs[0:i], diffs[i]+diffs[i+1], *diffs[i+1:])\n min_diff = min(diff, min_diff)\n print(min_diff)\n\n", "n = int(input())\r\nholds = [int(x) for x in input().split()]\r\nminDiff = 1001\r\ncurrentDiff = 0\r\ndiffs = []\r\nfor i in range (1, n):\r\n diff = holds[i] - holds[i - 1]\r\n if diff > currentDiff:\r\n currentDiff = diff\r\nfor i in range (1, n - 1):\r\n diff = holds[i + 1] - holds[i - 1]\r\n if diff < currentDiff:\r\n print(currentDiff)\r\n exit()\r\n if diff >= currentDiff:\r\n diffs.append(diff)\r\nprint(min(diffs))", "def difficulty(l):\r\n max_d = l[1]-l[0]\r\n for i in range(1,len(l)-1):\r\n if(l[i+1] - l[i]>max_d):\r\n max_d = l[i+1]-l[i]\r\n return(max_d)\r\n \r\n\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\ni = 1\r\nfin = n-2\r\nmin_d = []\r\nwhile(i<=n-2):\r\n min_d.append(difficulty(a[:i]+a[i+1:]))\r\n i+=1\r\nprint(min(min_d))\r\n", "\r\nn=int(input())\r\nar=list(map(int, input().split()))\r\nif n==3:\r\n print(ar[2]-ar[0])\r\nelse:\r\n ar2=[]\r\n mx=0\r\n\r\n for i in range(1, n-1):\r\n t=ar[:i]+ar[i+1:]\r\n mx=0\r\n for j in range(n-2):\r\n if t[j+1]-t[j]>mx:\r\n mx=t[j+1]-t[j]\r\n ar2.append(mx)\r\n\r\n print(min(ar2))", "input()\r\ndata = list(map(int, input().split()))\r\nd1 = [v2 - v1 for v1, v2 in zip(data, data[1:])] \r\nd2 = [v2 - v1 for v1, v2 in zip(data, data[2:])] \r\n\r\nprint(max(d1 + [min(d2)]))\r\n", "#!/usr/bin/python3\n\nimport itertools as ittls\nfrom collections import Counter\n\nimport re\nimport math\n\n\ndef sqr(x):\n return x*x\n\ndef inputarray(func=int):\n return map(func, input().split())\n\n# --------------------------------------\n# --------------------------------------\n\nN = int(input())\nA = list(inputarray())\n\nres = float('inf')\n\nfor i in range(len(A) - 2):\n if A[i + 2] - A[i] < res:\n res = A[i + 2] - A[i]\n\nprint(max(max(map(lambda x: abs(x[0] - x[1]), zip(A, A[1:]))), res))\n", "def cek(arr):\r\n maxx=0\r\n for i in range(len(arr)-1):\r\n kurang=int(arr[i+1])-int(arr[i])\r\n if kurang>maxx:\r\n maxx=kurang\r\n return maxx\r\nn=int(input())\r\narr=[0]*n\r\nb=input().split(\" \")\r\nfor i in range(n):\r\n arr[i]=int(b[i])\r\nnarr=len(arr)\r\nign=0\r\nminn=9999\r\nfor i in range(narr-2):\r\n ign+=1\r\n kan=[]\r\n for j in range(narr):\r\n if j == ign:\r\n continue\r\n else:\r\n kan+=[arr[j]]\r\n hasil=cek(kan)\r\n if hasil<minn:\r\n minn=hasil\r\n \r\nprint(minn)\r\n", "n = int(input())\nx = list(map(int,input().split()))\ny=[]\nfor i in range(1,n):\n y.append(x[i]-x[i-1])\n\n#print(y)\nz=[]\nfor i in range(n-2):\n z.append(y[i]+y[i+1])\n\n#print(z)\n\n\ntans = max(y)\n#print(tans)\nans =[]\nfor i in z:\n if i>=tans:\n ans.append(i)\n else:\n ans.append(tans)\n\nprint(min(ans))\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\nm.sort()\r\nl,k=[],[]\t\r\nfor i in range(n-2):\r\n\tl.append(m[i+2]-m[i])\r\nfor i in range(n-1):\r\n\tk.append(m[i+1]-m[i])\r\nprint(max(max(k),min(l)))\t\t\t\r\n", "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n maxlst=[]\r\n lonely=[]\r\n for i in range(1,n):\r\n lonely.append(l[i]-l[i-1])\r\n ans=[]\r\n for i in range(1,n-1):\r\n a=l[i+1]-l[i-1]\r\n b=max(max(lonely),a)\r\n ans.append(b)\r\n\r\n return min(ans)\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nprint(exe())", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nprint(max([min([a[i]-a[i-2] for i in range(2,n)])]+[a[i]-a[i-1] for i in range(1,n)]))\r\n\r\n", "k = int(input())\r\n# print(b, k)\r\na = list(map(int, input().split(\" \")))\r\n# print(a)\r\ni = 1\r\nans=[]\r\nmaxVal=0\r\n\r\nwhile i < len(a)-1:\r\n\r\n sum1 = a[i+1] - a[i-1]\r\n\r\n ans.append(sum1)\r\n maxVal=max(maxVal,a[i+1] - a[i])\r\n\r\n i = i + 1\r\n\r\n# ans.sort(reverse=True)\r\n# print(ans)\r\n\r\nprint(max(maxVal,min(ans)))\r\n\r\n\r\n# mx value of max element and min of the array\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nprev_distance = a[1] - a[0]\r\ncur_distance = a[2] - a[1]\r\nmax_distance = max(cur_distance, prev_distance)\r\nmin_after_removing = cur_distance + prev_distance\r\n\r\nfor i in range(2, n - 1):\r\n prev_distance = cur_distance\r\n cur_distance = a[i + 1] - a[i]\r\n\r\n if max_distance < cur_distance:\r\n max_distance = cur_distance\r\n if prev_distance + cur_distance < min_after_removing:\r\n min_after_removing = prev_distance + cur_distance\r\n\r\nprint(max(max_distance, min_after_removing))\r\n", "def mindiff(n,r):\r\n mini=1000\r\n for i in range(1,n-1):\r\n a=r[:i]+r[i+1:]\r\n mini=min(mini,max(a[j+1]-a[j] for j in range(n-2)))\r\n return mini\r\ndef main():\r\n print(mindiff(int(input()),[*map(int,input().split())]))\r\nmain()", "n = int(input())\r\nL = list(map(int, input().split()))\r\nprint(max(max(L[i + 1] - L[i] for i in range(n - 1)),\r\n min(L[i + 2] - L[i] for i in range(n - 2))))", "n = int(input())\n\na = list(map(int, input().split()))\n\nminm = a[-1] - a[0]\nmaxm = a[1] - a[0]\nfor i in range(1, n - 1):\n minm = min(a[i + 1] - a[i - 1], minm)\n maxm = max(a[i] - a[i - 1], maxm)\n\nmaxm = max(a[-1] - a[-2], maxm)\n\nprint(max(maxm,minm))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(1,n-1):\r\n x=l.copy()\r\n x.pop(i)\r\n ma=0\r\n for i in range(len(x)-1):\r\n ma=max(x[i+1]-x[i],ma)\r\n k.append(ma)\r\nk=sorted(k)\r\nprint(k[0])\r\n \r\n", "n=int(input())\r\nlst=list(map(int, input().split()))\r\nm=float(\"inf\")\r\nif n>2:\r\n for i in range(n-2):\r\n if lst[i+2]-lst[i]<m:\r\n m=lst[i+2]-lst[i]\r\n n=i+1\r\n lst.pop(n)\r\nm=float(\"-inf\")\r\nfor i in range(len(lst)-1):\r\n if m<lst[i+1]-lst[i]:\r\n m=lst[i+1]-lst[i]\r\nprint(m)", "trash = int(input());\r\nsecondLine = [int(x) for x in input().split()];\r\n\r\nlow = 9999999999999;\r\nlow2 = -9999999999999;\r\n\r\nfor i in range(2, len(secondLine)):\r\n if(secondLine[i]-secondLine[i-2]<low):\r\n low = secondLine[i]-secondLine[i-2];\r\n \r\nfor i in range(1, len(secondLine)):\r\n if(secondLine[i]-secondLine[i-1]>low2):\r\n low2 = secondLine[i]-secondLine[i-1];\r\n \r\nprint(max(low, low2));", "def calcdiff(listx):\r\n maxim = -1\r\n for i in range(1, len(listx)):\r\n maxim = max(maxim, listx[i] - listx[i-1])\r\n return maxim\r\nx = int(input())\r\nt = list(map(int, input().split(' ')))\r\nmaximx = 90000001\r\nfor i in range(1, x-1):\r\n maximx = min(maximx, calcdiff(t[:i] + t[i+1:]))\r\nprint(maximx)\r\n \r\n", "p=int(input(''))\r\n#print(n)\r\narr=list(map(int,input().split()))\r\nm=-1\r\nn=100000\r\nfor i in range(1,p-1):\r\n\tm=-1\r\n\tfor j in range(0,p-1):\r\n\t\t#print(j)\r\n\t\tif j==i:\r\n\t\t\t#print(j)\r\n\t\t\tcontinue\r\n\t\tif j+1==i:\r\n\t\t\ta=arr[j+2]-arr[j]\r\n\t\telse:\r\n\t\t\ta=arr[j+1]-arr[j]\r\n\t\tif a>m:\r\n\t\t\tm=a\r\n\t#\tprint(m)\t\r\n\tif m<n:\r\n\t\tn=m\r\n\t\t#print(n)\r\nprint(n)", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nindex = None\r\n\r\nfor i in range(1, n-1):\r\n if index == None or x[i+1] - x[i-1] < x[index+1] - x[index-1]:\r\n index = i\r\n\r\nx.pop(index)\r\n\r\nd = 0\r\n\r\nfor i in range(1, len(x)):\r\n if x[i] - x[i-1] > d:\r\n d = x[i] - x[i-1]\r\n\r\nprint(d)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ndl = []\r\nk = []\r\nfor i in range(1, n-1):\r\n k = a[:i] + a[i+1:]\r\n t = [k[j+1]-k[j] for j in range(len(k)-1)]\r\n dl.append(max(t))\r\n\r\nprint(min(dl))\r\n", "n = int(input())\r\narr= list(map(int, input().split()))\r\nminofmax = 9283;\r\nfor j in range(1,len(arr)-1):\r\n a = arr.copy()\r\n a.pop(j)\r\n mx = 0\r\n for i in range(1,len(a)):\r\n mx = max(mx, abs(a[i] - a[i-1]))\r\n minofmax = min(minofmax, mx)\r\nprint(minofmax)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=1000\r\nl2=[]\r\nfor i in range(1,n-1):\r\n a=l[i]\r\n l.remove(a)\r\n l2.clear()\r\n for j in range(n-2):\r\n l2.append(l[j+1]-l[j])\r\n if max(l2)<m:\r\n m=max(l2)\r\n l.insert(i,a)\r\nprint(m)\r\n\r\n", "n = int(input())\r\nx = input()\r\nx = x.split(' ')\r\na = []\r\nc = []\r\nb=[]\r\nfor i in range(0, len(x)):\r\n x[i] = int(x[i])\r\n \r\nfor i in range (1, len(x) - 1):\r\n a.clear()\r\n a.extend(x) \r\n a.remove(a[i])\r\n for j in range(0, len(a) - 1):\r\n b.append(a[j + 1] - a[j])\r\n c.append(max(b))\r\n b=[]\r\nprint(min(c))\r\n", "n = int(input())\r\nmylist = list(map(int, input().split()))\r\nlist1 = []\r\nfor i in range(1, len(mylist)-1):\r\n newlist = []\r\n newlist.extend(mylist[0:i])\r\n newlist.extend(mylist[i+1:n])\r\n #print(newlist)\r\n maxi = 0\r\n for j in range(1, len(newlist)):\r\n if maxi < newlist[j]-newlist[j-1]:\r\n maxi = newlist[j]-newlist[j-1]\r\n list1.append(maxi)\r\n #print(list1)\r\nprint(min(list1))", "n = int(input()) \n#n, m = map(int, input().split())\n#s = input()\nc = list(map(int, input().split()))\nm = 10 ** 4\nx = 0\nfor i in range(n - 1):\n x = max(c[i + 1] - c[i], x)\nfor i in range(n - 2):\n m = min(c[i + 2] - c[i], m)\nprint(max(m, x))", "n = int(input())\r\nl = list(map(int, input().split()))\r\na, b, c = [], [], []\r\nfor i in range(n-2):\r\n a.append(l[i+2] - l[i])\r\nc.append(min(a))\r\nfor i in range(n-1):\r\n b.append(l[i+1] - l[i])\r\nprint(max(b+c))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmi = l[-1]-l[0]\r\nfor i in range(1,n-1):\r\n if l[i+1]-l[i-1] < mi:\r\n mi = l[i+1]-l[i-1]\r\nmx = max([l[i]-l[i-1] for i in range(1,n)])\r\nprint(max(mi,mx))\r\n\r\n", "n, a = int(input()), list(map(int, input().split()))\r\ni = min((a[i+2]-a[i], i,) for i in range(n-2))[1]+1\r\na = a[:i]+a[i+1:]\r\nprint(max(a[i+1]-a[i] for i in range(n-2)))", "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\na_max=[]\r\nfor i in range(n - 2):\r\n a_copy, ma = a.copy(), 0\r\n a_copy.pop(i + 1)\r\n\r\n for j in range(n - 2):\r\n diff = a_copy[j + 1] - a_copy[j]\r\n if (diff> ma):\r\n ma =diff\r\n a_max.append(ma)\r\nprint(min(a_max))\r\n", "def f(l):\n ans=-1005\n for i in range(1, len(l)):\n ans=max(ans, l[i]-l[i-1])\n return ans\n\nn=int(input())\nl=[int(x) for x in input().split()]\n\nans=1005\nfor i in range(1, len(l)-1):\n tmp=l[:]\n del tmp[i]\n ans=min(ans, f(tmp))\nprint(ans)\n\n", "# -*- coding: utf-8 -*-\n\"\"\"Untitled33.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1X47b1HbLs8QexAIOUsAiGnp9lDLIOXzo\n\"\"\"\n\ndef level(l):\n max=l[1]-l[0]\n for i in range(0,len(l)-1):\n a=l[i+1]-l[i]\n if a>max:\n max=a\n return(max)\nn=int(input())\nl1=list(map(int,input().split()))\nl2=[]\nfor j in range(1,n-1):\n l4=l1.copy()\n l4.pop(j)\n l2.append(l4)\nmin=level(l2[0])\nfor i in range(0,len(l2)):\n if level(l2[i])<min:\n min=level(l2[i])\nprint(min)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk = a[-1]\r\np = 0\r\nfor i in range(1,n-1):\r\n if a[i+1] - a[i-1] < k:\r\n k = a[i+1] - a[i-1]\r\n p = i\r\na.remove(a[p])\r\nk = 0\r\nfor i in range(len(a)-1):\r\n if a[i+1] - a[i] > k:\r\n k = a[i+1] - a[i]\r\nprint(k)\r\n\r\n", "n = int(input())\na = [int(x) for x in input().split()]\nval = []\nmv = 0\nfor i in range(1,n):\n mv = max(mv,a[i]-a[i-1])\n \nz = 1000\nfor i in range(1,n-1):\n z = min(z, a[i+1]-a[i-1])\n\nif z <= mv:\n print(mv)\nelse:\n print(z)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif n == 3:\r\n print(a[-1] - a[0])\r\nelse:\r\n ans = float(\"inf\")\r\n for i in range(n-2):\r\n ans = min(ans, a[i+2] - a[i])\r\n for i in range(n-2):\r\n if a[i+2] - a[i] == ans:\r\n del a[i+1]\r\n break\r\n res = 0\r\n for i in range(n-2):\r\n res = max(res, a[i+1] - a[i])\r\n print(res)", "n = int(input().strip())\r\nll = list(map(int,input().split()))\r\nll1 = [0]*(n-1)\r\nfor i in range(n-1):\r\n ll1[i] = ll[i+1] - ll[i]\r\nmaxx = max(ll1)\r\nll2 = []\r\nfor i in range(n-2):\r\n ll2.append(max(maxx,ll1[i]+ll1[i+1]))\r\nprint(min(ll2))", "n=int(input())\r\nl1=input()\r\nl=list(l1.split())\r\nfor i in range(len(l)):\r\n l[i]=int(l[i])\r\n\r\ndef mes(x):\r\n s=[]\r\n for i in range(1,len(x)):\r\n s.append(x[i]-x[i-1])\r\n return max(s)\r\ndef ink(x):\r\n t=[]\r\n for k in range(len(x)):\r\n t.append(x[k])\r\n s=[]\r\n for i in range(len(x)):\r\n t.remove(t[i])\r\n s.append(t)\r\n t=[]\r\n for k in range(len(x)):\r\n t.append(x[k])\r\n return s\r\ntemp=[]\r\nfor i in range(1,len(ink(l))-1):\r\n r=ink(l)[i]\r\n temp.append(mes(r))\r\nprint(min(temp))", "[n] = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nif n <= 3:\r\n\tprint(a[-1] - a[0])\r\n\r\nelse:\r\n\td = []\r\n\tmd = []\r\n\tfor i in range(1, n):\r\n\t\td.append(a[i] - a[i-1])\r\n\tdmax = max(d)\r\n\tfor i in range(2, n):\r\n\t\tmd.append(max(a[i] - a[i-2], dmax))\r\n\t\t\r\n\tprint(min(md))", "n=int(input())\r\nheight=list(map(int, input().split(\" \")))\r\nl=[]\r\nfor i in range(1,n-1):\r\n diff=[]\r\n new1=[]\r\n for k in height:\r\n new1.append(k)\r\n new1.pop(i)\r\n for j in range (1,n-1):\r\n a=new1[j]-new1[j-1]\r\n diff.append(a)\r\n a=max(diff)\r\n l.append(a)\r\nprint(min(l))", "n = int(input()); ls = list(map(int, input().split()))\r\nmin_diff = 1000000001\r\nfor i in range(2, n) : \r\n curr_diff = ls[i] - ls[i - 2]\r\n min_diff = min(min_diff, curr_diff)\r\n\r\nfor i in range(1, n) : \r\n x = ls[i] - ls[i - 1]\r\n min_diff = max(x, min_diff)\r\n\r\nprint(min_diff)", "# coding=utf-8\r\n\r\n\r\nif __name__ == '__main__':\r\n\tn = int(input())\r\n\tline = str(input()).split()\r\n\tline = [int(it) for it in line]\r\n\tsize = len(line) - 2\r\n\tnote = list()\r\n\tfor i in range(size):\r\n\t\ttemp_line = line[:1 + i].copy()\r\n\t\ttemp_line.extend(line[2 + i:])\r\n\t\ttemp_note = list()\r\n\t\tfor j in range(size):\r\n\t\t\ttemp_note.append(temp_line[j + 1] - temp_line[j])\r\n\t\tnote.append(max(temp_note))\r\n\tprint(min(note))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nz=[]\r\nt=[]\r\nfor i in range(n-1):\r\n\tz.append(abs(l[i]-l[i+1]))\r\nfor i in range(n-2):\r\n\tt.append(abs(l[i]-l[i+2]))\r\nprint(max(max(z),min(t)))", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndiff = arr[2]-arr[0]\r\nindex = 1\r\nfor i in range(1,n-2):\r\n if arr[i+2]-arr[i]<diff:\r\n diff = arr[i+2]-arr[i]\r\n index = i+1\r\ndel arr[index]\r\nmaxi = arr[1]-arr[0]\r\nfor i in range(1,n-2):\r\n if arr[i+1]-arr[i]>maxi:\r\n maxi = arr[i+1]-arr[i]\r\nprint(maxi)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=1000000\r\nk=-8\r\nfor i in range(1,n-1):\r\n k=i if m>a[i+1]-a[i-1] else k\r\n m = min(a[i+1]-a[i-1],m)\r\na.remove(a[k])\r\n\r\nn=len(a)\r\nm=0\r\nfor i in range(1,n):\r\n m=max(a[i]-a[i-1],m)\r\nprint(m)", "n=int(input())\r\na=list(map(int,input().split()))\r\nminm=10000000\r\nmaxm=0\r\nfor i in range(1,len(a)-1):\r\n diff=a[i+1]-a[i-1]\r\n if(diff < minm):\r\n minm=diff\r\nfor i in range(1,len(a)):\r\n d=a[i]-a[i-1]\r\n if(d>maxm):\r\n maxm=d\r\n \r\nprint(max(minm,maxm))", "n = int(input())\r\na = list(map(int, input().split()))\r\nmi = min(a[i + 2] - a[i] for i in range(n - 2))\r\nma = max(a[i + 1] - a[i] for i in range(n - 1))\r\nprint(max(mi, ma))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[a[i+1]-a[i] for i in range(n-1)]\r\nc=[a[i+1]-a[i-1] for i in range(1,n-1)]\r\n# print(c)\r\n# print(b)\t\r\nprint(max(max(b),min(c)))", "from sys import stdin,stdout\r\nget=stdin.readline;put=stdout.write\r\nn,a=int(get()),list(map(int,get().split()));d=[];t=[]\r\nfor i in range(n-1):\r\n\tp=a[i+1]-a[i]\r\n\td.append(p)\r\n\tif t:t.append(d[i]+d[i-1])\r\n\tif not t and len(d)>1:t.append(d[i]+d[i-1])\r\nput(str(max(min(t),max(d))))\t", "import sys\r\nnumberofrocks=int(sys.stdin.readline())\r\nlistofrocks=list(map(int,sys.stdin.readline().rstrip('\\n').split()))\r\nlistofgaps=[listofrocks[1]-listofrocks[0]]\r\nlistofgapsafterremoving=[]\r\nfor index in range(1,numberofrocks-1):\r\n listofgaps.append(listofrocks[index+1]-listofrocks[index])\r\n listofgapsafterremoving.append(listofrocks[index+1]-listofrocks[index-1]) \r\nsolution=max(max(listofgaps),min(listofgapsafterremoving))\r\nprint(solution)", "import math\r\ndef mindif(n, a):\r\n v=[]\r\n w=0\r\n for i in range(1,n-1):\r\n temp=a.pop(i)\r\n x=[]\r\n for j in range(n-2):\r\n x.append(a[j+1]-a[j])\r\n v.append(max(x))\r\n a.insert(i, temp)\r\n return(abs(min(v)))\r\n\r\nn = int(input().strip())\r\na = input().strip().split()\r\na = list(map(int, a))\r\nprint(mindif(n, a))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nd = [a[i] - a[i - 1] for i in range(1, n)]\r\nm = [d[0]]\r\nfor i in range(1, len(d)):\r\n m.append(max(d[i], m[-1]))\r\ns = [d[-1]] * len(d)\r\nfor i in range(len(s) - 2, -1, -1):\r\n s[i] = max(d[i], s[i + 1])\r\nbn = n - 1\r\nmn = 1001\r\n\r\nfor i in range(1, bn):\r\n mx = max(a[i + 1] - a[i - 1], m[i - 1], s[i])\r\n if mx < mn:\r\n mn = mx\r\n\r\nprint(mn)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ndiff = 1001\r\nfor i in range(1, n-1):\r\n temp = a.copy()\r\n temp.pop(i)\r\n dif = 0\r\n for i in range(n-2):\r\n if (temp[i+1] - temp[i]) > dif:\r\n dif = temp[i+1] - temp[i]\r\n else:\r\n pass\r\n if dif < diff:\r\n diff = dif\r\n else:\r\n pass\r\n \r\nprint(diff)", "input()\r\nm = list(map(int, input().split()))\r\nanw = 0\r\nd = 1e9\r\nfor i in range(len(m)-1):\r\n anw = max(anw, abs(m[i]-m[i+1]))\r\nfor i in range(1, len(m)-1):\r\n d = min(d, abs(m[i-1]-m[i+1]))\r\nprint(max(d, anw))", "n= int(input())\r\na= list(map(int, input().split()))\r\nprint(max([min([a[i+2]-a[i] for i in range(n-2)])]+[a[i+1]-a[i] for i in range(n-1)]))\r\n", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nlp = []\r\nfor i in range(1, n - 1):\r\n\tli = [ij for ij in l]\r\n\tli.pop(i)\r\n\r\n\td = 0\r\n\tfor j in range(n - 2):\r\n\t\tdiff = li[j + 1] - li[j]\r\n\t\tif diff > d:\r\n\t\t\td = diff\r\n\r\n\tlp.append(d)\r\n\r\nprint(min(lp))\r\n\r\n", "num_hold = int(input())\r\nhold = input()\r\nholds = hold.split()\r\nfor i in range(0,num_hold):\r\n holds[i] = int(holds[i])\r\nmin_dif = holds[num_hold - 1] - holds[0]\r\nmax_dif = 0\r\nfor i in range(0,num_hold-1):\r\n if(holds[i+1] - holds[i] > max_dif):\r\n max_dif = holds[i+1] - holds[i]\r\nfor i in range(0,num_hold-2):\r\n if(holds[i+2] - holds[i] < min_dif):\r\n min_dif = holds[i+2] - holds[i]\r\nif(min_dif < max_dif):\r\n print(max_dif)\r\nelse:\r\n print(min_dif)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin = 10000000000000\r\nf = 0\r\nfor i in range(1, n - 1):\r\n if a[i + 1] - a[i - 1] <= min:\r\n f = i\r\n min = a[i + 1] - a[i - 1]\r\na.pop(f)\r\ncol = 0\r\nfor i in range(1, n - 1):\r\n if a[i] - a[i - 1] > col:\r\n col = a[i] - a[i - 1]\r\nprint(col)\r\n", "from copy import deepcopy\r\nn = int(input())\r\nls = list(map(int,input().split()))\r\nmaxx=-1\r\nans =[]\r\n\r\nfor i in range(1,n-1):\r\n arr = deepcopy(ls)\r\n arr.remove(ls[i])\r\n for j in range(n-2):\r\n if arr[j+1] - arr[j] > maxx:\r\n maxx = arr[j+1]-arr[j]\r\n ans.append(maxx)\r\n maxx=-1\r\n\r\nprint(min(ans))\r\n", "n = int(input())\r\ndaf = list(map(int, input().split()))\r\n\r\ndif = 999\r\nmax_dif = 0\r\n\r\nfor i in range(n-2):\r\n dif = min(dif, daf[i+2] - daf[i])\r\n\r\nfor i in range(n-1):\r\n max_dif = max(max_dif, daf[i+1] - daf[i])\r\n\r\nprint(max(max_dif, dif))\r\n", "import sys\r\nimport collections\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef printnl(val):\r\n sys.stdout.write(str(val) + '\\n')\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.append(0)\r\na.append(0)\r\n\r\nans = 1000000000\r\n\r\nfor i in range(1, n-1):\r\n answer = 0\r\n for j in range(n-1):\r\n if j == i:\r\n continue\r\n if j + 1 == i:\r\n answer = max(answer, a[j + 2] - a[j])\r\n else:\r\n answer = max(answer, a[j + 1] - a[j])\r\n ans = min(answer, ans)\r\n\r\nprintnl(ans)\r\n", "N = int(input())\r\n\r\nholds = list(map(int, input().split()))\r\nholds_diff = []\r\nfor i in range(1, N-1):\r\n max_diff = []\r\n holds_after_remove = holds[:i] + holds[i+1:]\r\n for j in range(len(holds_after_remove) - 1):\r\n max_diff.append(holds_after_remove[j+1] - holds_after_remove[j])\r\n\r\n holds_diff.append(max(max_diff))\r\n\r\nprint(min(holds_diff))", "def getrazn(ar):\r\n\te = 0\r\n\tfor i in range(len(ar)):\r\n\t\tif ar[i] - ar[i-1] > e:\r\n\t\t\te = ar[i] - ar[i-1]\r\n\treturn(e)\r\n\r\n\r\ninput()\r\na = list(map(int, input().split()))\r\nranz = []\r\n\r\nfor i in range(1,len(a)-1):\r\n\tacopy = a.copy()\r\n\tdel(acopy[i])\r\n\tranz.append(getrazn(acopy))\r\n\r\nprint(min(ranz))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nt = []\r\nres = []\r\nfor i in range(1,n-1):\r\n t = l[:i]+l[i+1:]\r\n #print(t)\r\n max_diff = 0\r\n for j in range(len(t)-1):\r\n #print(t[j])\r\n diff = t[j+1]-t[j]\r\n if diff > max_diff:\r\n max_diff = diff\r\n #print(\"Max diff: \",max_diff)\r\n res.append(max_diff)\r\nprint(min(res))", "input()\r\nnums=list(map(int,input().split()))\r\nans=0\r\nans3=float(\"inf\")\r\nfor i in range(1,len(nums)-1):\r\n s=nums[:i]+nums[i+1:]\r\n ans=0\r\n for j in range(len(s)-1):\r\n ans=max(ans,s[j+1]-s[j])\r\n ans3=min(ans3,ans)\r\n \r\nprint(ans3)", "n = int(input())\r\na = [int(i) for i in input().split(' ')]\r\n\r\nc = [a[i] - a[i-2] for i in range(2, len(a))]\r\na.pop(c.index(min(c)) + 1)\r\nc = [a[i] - a[i-1] for i in range(1, len(a))]\r\n\r\nprint(str(max(c)))\r\n", "def geti():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\na = list(geti())\r\n\r\nbd = 0\r\nt = 10e9\r\n\r\nfor i in range(n-1):\r\n if a[i+1] - a[i] > bd:\r\n bd = a[i+1] - a[i]\r\n\r\nfor i in range(n-2):\r\n if a[i+2] - a[i] < t:\r\n t = a[i+2] - a[i]\r\n\r\nprint(max(bd, t))\r\n\r\n", "n = int(input())\na = [int(i) for i in input().split()]\n\ndef diff(a):\n best = 0\n for i in range(1,len(a)):\n best = max(best,a[i] - a[i-1])\n return best\n\nbest = 9999\nfor i in range(1,n-1):\n best = min(best,diff(a[:i]+a[i+1:]))\n\nprint(best)\n", "t=int(input())\r\na=list(map(int,input().split()))\r\ndef diff(a):\r\n return max(a[i+1]-a[i] for i in range(len(a)-1))\r\nprint(min(diff(a[:i+1]+a[i+2:])for i in range(t-2)))", "n = int(input())\na = [int(x) for x in input().split(' ')]\nd = []\nmaxd = 0\nfor i in range(n - 1):\n d.append(a[i + 1] - a[i])\n maxd = max(maxd, d[i])\nmind = 1000000000\n#print(d)\nfor i in range(1, len(d)):\n if d[i - 1] + d[i] <= maxd:\n mind = maxd\n else:\n mind = min(mind, d[i - 1] + d[i])\nprint(mind)", "n=int(input())\r\nL=list(map(int,input().split()))\r\nL1=[L[k]-L[k-1] for k in range(1,n)]\r\nL2=[L1[k]+L1[k+1] for k in range(n-2)]\r\nmaximo=max(L1)\r\nL3=[max(maximo,k) for k in L2 ]\r\nprint(min(L3))\r\n", "######################################################################\r\n# Write your code here\r\nimport sys\r\nfrom math import *\r\ninput = sys.stdin.readline\r\n#import resource\r\n#resource.setrlimit(resource.RLIMIT_STACK, [0x10000000, resource.RLIM_INFINITY])\r\n#sys.setrecursionlimit(0x100000)\r\n# Write your code here\r\nRI = lambda : [int(x) for x in sys.stdin.readline().strip().split()]\r\nrw = lambda : input().strip().split()\r\nls = lambda : list(input().strip()) # for strings to list of char\r\nfrom collections import defaultdict as df\r\nimport heapq \r\n#heapq.heapify(li) heappush(li,4) heappop(li)\r\n#import random\r\n#random.shuffle(list)\r\ninfinite = float('inf')\r\n#######################################################################\r\n\r\nn=int(input())\r\n\r\nl=RI()\r\nans=0\r\nfor i in range(n-1):\r\n ans=max(ans,l[i+1]-l[i])\r\norig=ans\r\nk=[]\r\n#print(orig)\r\nfor i in range(1,n-1):\r\n temp=0\r\n for j in range(n-1):\r\n if(j!=i and j+1!=i):\r\n temp=max(temp,l[j+1]-l[j])\r\n elif(j+1==i):\r\n if(j!=n-2):\r\n temp=max(temp,l[j+2]-l[j])\r\n elif(j==i):\r\n continue\r\n #print(temp)\r\n if(temp>=orig):\r\n k.append(temp)\r\n#print(orig)\r\nprint(min(k))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nl = []\r\n\r\nfor i in range(1 , n-1):\r\n x = arr.pop(i)\r\n d = []\r\n #print(x)\r\n\r\n for j in range(len(arr) - 1):\r\n d.append(arr[j+1] - arr[j])\r\n #print(d)\r\n l.append(max(d))\r\n arr.append(x)\r\n arr.sort()\r\n\r\nprint(min(l))\r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = []\r\nfor i in range(2,len(a),1): b.append(a[i]-a[i-2])\r\nk = b.index(min(b))\r\ndel(a[k+1])\r\nanss = []\r\nfor i in range(1,n-1): anss.append(a[i]-a[i-1])\r\nprint(max(anss))", "n = int(input())\na = list(map(int, input().split()))\nminmax = a[len(a)-1] - a[0]\nfor i in range(1,n-1):\n\td = -1\n\tx = a[0]\n\tfor j in range(n):\n\t\tif j != i:\n\t\t\td = max(d, a[j] - x)\n\t\t\tx = a[j] \n\tif d < minmax:\n\t\tminmax = d\nprint(minmax)\n\t\n", "import sys\nn = int(input())\na = list(map(int, sys.stdin.readline().split()))\nA = max([a[i+1]-a[i] for i in range(n-1)])\nB = a[-1] - a[0]\nfor i in range(1,n-1):\n B = min(B,a[i+1]-a[i-1])\n if B <= A:\n print(A)\n break\nelse:\n print(B)\n", "x = int(input())\r\na = list(map(int,input().split()))\r\nif x == 3:\r\n\tprint(a[-1]-a[0])\r\nelse:\r\n\tt = []\r\n\tk = []\r\n\tfor i in range(1,x):\r\n\t\tr = a[i] - a[i-1]\r\n\t\tt.append(r)\r\n\tfor i in range(1,len(t)):\r\n\t\tr = t[i] + t[i-1]\r\n\t\tk.append(r)\r\n\r\n\tif t.count(r) == len(t):\r\n\t\tprint(2*r)\r\n\t# elif max(t) == t[len(t)-1]:\r\n\t# \tt.pop(len(t)-1)\r\n\t# \tprint(max(t))\r\n\telse:\r\n\t\tr = min(k)\r\n\t\tc = k.index(r)\r\n\t\tt[c+1] = t[c] + t[c+1]\r\n\t\tt.pop(c)\r\n\t\tprint(max(t))", "_, nums = input(), list(map(int, input().split()))\r\n\r\nmin_delta, max_delta = float(\"inf\"), -1\r\nfor i in range(1, len(nums)-1):\r\n diff = nums[i+1] - nums[i-1]\r\n min_delta = min(min_delta, diff)\r\n difi = nums[i] - nums[i-1]\r\n max_delta = max(difi, max_delta)\r\n\r\nmax_delta = max(nums[-1] - nums[-2], max_delta)\r\nprint(max(max_delta, min_delta))", "n = int(input())\nA = list(map(int, input().split()))\ndef diff(A):\n return max(A[i + 1] - A[i] for i in range(len(A) - 1))\n\nprint(min(diff(A[:i + 1] + A[i + 2:]) for i in range(n - 2)))\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nres = 2e9\r\nfor i in range(1, n - 1):\r\n cur = arr[:i] + arr[i + 1:]\r\n res = min(res, max(cur[j] - cur[j - 1] for j in range(1, len(cur))))\r\nprint(res)\r\n", "def maxm(a,n):\r\n maxmm=0\r\n for i in range(n-1):\r\n if a[i+1]-a[i]>maxmm:\r\n maxmm=a[i+1]-a[i]\r\n return maxmm\r\ndef ap_series(a,n):\r\n d=a[1]-a[0]\r\n count=0\r\n for i in range(0,n-1):\r\n if a[i+1]-a[i]==d:\r\n count+=1\r\n \r\n else:\r\n break\r\n if count==n-1:\r\n return True\r\n else:\r\n return False\r\nn=int(input())\r\na=[int(num) for num in input().split(\" \",n-1)]\r\n \r\nif n==3:\r\n print(a[2]-a[0])\r\nelif ap_series(a,n)==True:\r\n d=a[1]-a[0]\r\n print(2*d)\r\nelif n==4:\r\n a3_1=a[2]-a[0]\r\n a3_4=a[3]-a[2]\r\n anss=max(a3_1, a3_4)\r\n a2_1=a[1]-a[0]\r\n a2_4=a[3]-a[1]\r\n anss2=max(a2_1,a2_4)\r\n print(min(anss, anss2))\r\nelse:\r\n lst=[]\r\n for i in range(1,n-1):\r\n b=a[:]\r\n b.remove(a[i])\r\n ans=maxm(b, n-1)\r\n lst.append(ans)\r\n print(min(lst))\r\n ", "n=int(input())\r\narr=list(map(int,input().strip().split(' ')))\r\nans=10000000\r\nfor i in range(1,n-1):\r\n\tm=-1000000\r\n\tfor j in range(n-1):\r\n\t\tif(j==i):\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif(j+1==i):\r\n\t\t\t\tm=max(arr[j+2]-arr[j],m)\r\n\t\t\telse:\r\n\t\t\t\tm=max(arr[j+1]-arr[j],m)\r\n\tif(m<ans):\r\n\t\tans=m\r\n\t\t\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nif(n==3):\r\n print(a[-1]-a[0])\r\nelse:\r\n maxdiff = 0\r\n for i in range(n-1):\r\n maxdiff = max(maxdiff, a[i+1]-a[i])\r\n \r\n mincons = 99999999\r\n \r\n for i in range(n-2):\r\n mincons = min(mincons, a[i+2]-a[i])\r\n \r\n print(max(maxdiff, mincons))", "n = int(input())\r\nlst = list(map(int,input().split()))\r\n\r\nlst_max =[]\r\n\r\n\r\nfor i in range(1,n-1):\r\n new_lst = lst[:]\r\n new_lst.remove(lst[i])\r\n maxi=0\r\n for j in range(len(new_lst)-1):\r\n if maxi < (new_lst[j+1] - new_lst[j]):\r\n maxi = new_lst[j+1] - new_lst[j]\r\n \r\n lst_max.append(maxi)\r\n \r\n \r\n \r\nprint(min(lst_max))\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nx=max([arr[i+1]-arr[i] for i in range(n-1)])\r\ny=min([arr[i+2]-arr[i] for i in range(n-2)])\r\nprint(max(x,y))", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = list(a)\r\nm = list()\r\nfor i in range(1, n-1):\r\n\tk.remove(k[i])\r\n\tb = 0\r\n\tfor j in range(n-2):\r\n\t\tif k[j+1]-k[j]>b:\r\n\t\t\tb=k[j+1]-k[j]\r\n\tm.append(b)\r\n\tk = list(a)\r\nprint(min(m))", "# coding: utf-8\ndef cal(li):\n return max([li[i+1]-li[i] for i in range(len(li)-1)])\nn = int(input())\na = [int(i) for i in input().split()]\nprint(min([cal(a[:i]+a[i+1:]) for i in range(1,n-1)]))\n", "n = int(input())\r\ntr= [int(i) for i in input().split()]\r\nr = []\r\nmaxi = tr[1] - tr[0]\r\nfor i in range(1,len(tr)- 1) :\r\n r += [tr[i + 1] - tr[i - 1]]\r\n if tr[i + 1] - tr[i] > maxi :\r\n maxi = tr[i + 1] - tr[i]\r\nprint(max(maxi,min(r)))\r\n", "def maxs(l):\r\n max = 0\r\n for i in range(1, len(l)):\r\n if max < l[i] - l[i - 1]:\r\n max = l[i] - l[i - 1]\r\n return max\r\n\r\na = int(input())\r\nl = list(map(int, input().split()))\r\nans = []\r\nfor i in range(1, len(l) - 1):\r\n ans.append(maxs(l[:i] + l[i + 1:]))\r\nprint(min(ans))\r\n", "a = int(input())\nb = [int(i) for i in input().split()]\nmini = 1000\nmaxi = b[1] - b[0]\nfor i in range(len(b)-2):\n diff = b[i+2] - b[i]\n maxi = max(maxi, b[i+2]-b[i+1])\n if mini > diff:\n mini = diff\n\nif maxi > mini:\n print(maxi)\nelse:\n print(mini)\n\n# print(b)\n\n", "import math as m\r\n#from math import comb as nCr\r\nt=input\r\n'''\r\nfor _ in range(int(t())):\r\n n=int(t())\r\n a,b=map(int,t().split())\r\n a=list(map(int,t().split()))\r\n'''\r\nn=int(t())\r\na=list(map(int,t().split()))\r\nprint(max(max([a[i+1]-a[i] for i in range(n-1)]),min([a[i+2]-a[i] for i in range(n-2)])))", "n = int(input())\na = list(map(int, input().split()))\n\nans = 10 ** 10\nfor i in range(1, n - 1):\n cur = a[:i] + a[i + 1:]\n\n ans = min(ans, max(cur[j] - cur[j - 1] for j in range(1, len(cur))))\n\n\nprint(ans)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=max([l[i+1]-l[i] for i in range(n-1)])\r\ny=min([l[i+2]-l[i] for i in range(n-2)])\r\nprint(max(x,y))", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\nans = 1e9\r\nfor i in range(1, n-1):\r\n t = arr[i]\r\n diff = -1e9\r\n for j in range(1, n):\r\n if (j == i):\r\n arr[j] = arr[j-1]\r\n # print(arr)\r\n continue\r\n else:\r\n diff = max(diff, arr[j]-arr[j-1])\r\n ans = min(ans, diff)\r\n arr[i] = t\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = 0\r\nfor i in range(1, n):\r\n d = max(d, a[i] - a[i-1])\r\nans = 1e5 \r\nfor i in range(2, n):\r\n newd = max(d, a[i] - a[i-2])\r\n ans = min(newd, ans)\r\nprint(ans) \r\n \r\n", "import sys,bisect\r\n\r\nfrom sys import stdin,stdout\r\n\r\nfrom bisect import bisect_left,bisect_right,bisect,insort,insort_left,insort_right\r\n\r\nfrom math import gcd,ceil,floor,sqrt\r\n\r\nfrom collections import Counter,defaultdict,deque,OrderedDict\r\n\r\nsys.setrecursionlimit(10**6)\r\nINF = float('inf')\r\nMOD = 998244353\r\nmod = 10**9+7\r\n\r\ndef st():\r\n return list(stdin.readline().strip())\r\n\r\ndef inp():\r\n return int(stdin.readline())\r\n\r\ndef li():\r\n return list(map(int,stdin.readline().split()))\r\n\r\ndef mp():\r\n return map(int,stdin.readline().split())\r\n\r\ndef pr(n):\r\n stdout.write(str(n)+\"\\n\")\r\n \r\ndef solve():\r\n n=inp()\r\n l=li()\r\n k=[l[i+1]-l[i] for i in range(n-1)]\r\n\r\n ans=float('inf')\r\n for i in range(1,n-1):\r\n z=list(k)\r\n cur=l[i+1]-l[i-1]\r\n z[i-1]=cur\r\n ans=min(ans,max(z))\r\n \r\n pr(ans)\r\n \r\n\r\nfor _ in range(1):\r\n solve()\r\n\r\n", "n = int(input()) # ����� ���������� �������\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\n \r\nmax_dist = 0\r\nmin_dist = 1001\r\n\r\nfor i in range(n):\r\n if i >=2:\r\n if a[i]-a[i-2] < min_dist:\r\n min_dist = a[i]-a[i-2] # ���������� ����� �������\r\n if i >= 1:\r\n if a[i]-a[i-1] > max_dist:\r\n max_dist = a[i]-a[i-1]\r\n \r\nprint(max(min_dist, max_dist))", "n = input()\nheights = input()\n\na = []\nnew = []\ndifferences = []\n\ndef max():\n\tmaximum = new[1] - new[0]\n\tfor i in range(1,int(n)-2):\n\t\tif (maximum < (new[i+1] - new[i])):\n\t\t\tmaximum = new[i+1] - new[i]\n\treturn maximum\n\nfor i in range(int(n)-1):\n\ta.append(int(heights[:heights.find(\" \")]))\n\theights = heights[heights.find(\" \")+1:]\n\na.append(int(heights))\n\nfor i in range(1,int(n)-1):\n\n\tnew = a[:i] + a[i+1:]\n\tdifferences.append(max())\n\nminimum = differences[0]\nfor i in range(1,int(n)-2):\n\tif (differences[i] < minimum):\n\t\tminimum = differences[i]\n\nprint (minimum)\n\n\t\n\n\n\n\n", "n=int(input())\r\nm=[int(x) for x in input().split()]\r\na=[]\r\nfor i in range(1,n):\r\n a.append(m[i]-m[i-1])\r\nb=m[n-1]\r\nc=max(a)\r\nfor j in range(1,n-1):\r\n d=a[j-1]+a[j]\r\n d=max(d,c)\r\n b=min(b,d)\r\nprint(b)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [a[i+1]-a[i] for i in range(n-1)]\r\nc = [a[i+1]-a[i-1] for i in range(1, n-1)]\r\nprint(max(max(b), min(c)))\r\n###### thanking telegram for solutions ######\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\nmax_a, min_a = 0, 0\r\nmax_a = max(a[i + 1] - a[i] for i in range(n - 1))\r\nmin_a = min(a[i + 2] - a[i] for i in range(n - 2))\r\nprint(max(max_a, min_a))", "n = int(input())\na = list(map(int, input().split()))\nmx, mn = 0, 1000000\n\nfor i in range(1, n):\n mx = max(mx, a[i] - a[i - 1])\n\nfor i in range(n - 2):\n mn = min(mn, a[i + 2] - a[i])\nprint(max(mx, mn))\n\n\n\n\t\t\t \t\t \t\t \t\t\t\t \t\t \t\t\t\t \t \t\t", "n=int(input())\r\nip=list(map(int,input().split()))\r\nop=[]\r\nop2=[]\r\nfor i in range(n-1):\r\n op.append(ip[i+1]-ip[i])\r\nfor j in range(n-2):\r\n op2.append(op[j+1]+op[j])\r\nk=op2.index(min(op2))\r\nop.remove(op[k])\r\nop.remove(op[k])\r\nop.append(min(op2))\r\nprint(max(op))\r\n", "n=int(input())\na=list(map(int,input().split()))\ndiff=0\nfor i in range(n):\n\tif i!=0 :\n\t\tcurr=a[i]-a[i-1]\n\t\tif curr>diff:\n\t\t\tdiff=curr\n#dfif2=0\n# flag=0\n# diff2=diff\n# for i in range(n):\n# \tif i!=0 and i!=n-1:\n# \t\tcurr2=a[i+1]-a[i-1]\n# \t\tif curr2>diffs and flag==0:\n\t\t\t\n# \t\t\tdiff2=curr2\n# \t\telse:\n# \t\t\tflag=1\t\n# print(diff)\t\t\t\n\narr=[]\nfor i in range(n):\n\tif i!=0 and i!=n-1:\n\t\tcurr = a[i+1]-a[i-1]\n\t\tarr.append(curr)\n\nyo=min(arr)\nif yo<diff:\n\tprint(diff)\nelse:\n\tprint(yo)\t\n", "n = int(input())\n\nl = list(map(int, input().split()))\nans = 0\nll = []\nlll = []\nfor i in range(n-1):\n ans = max(ans, l[i + 1] - l[i])\nanss = -1\nfor i in range(1, n - 1):\n if anss == -1:\n anss = l[i + 1] - l[i - 1]\n anss = min(anss,l[i + 1] - l[i - 1])\nprint(max(ans, anss))", "import sys\r\ndef rs(): return sys.stdin.readline().rstrip()\r\ndef ri(): return int(sys.stdin.readline())\r\ndef ria(): return list(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s); sys.stdout.write('\\n')\r\ndef wi(n): sys.stdout.write(str(n)); sys.stdout.write('\\n')\r\ndef wia(a, sep=' '): sys.stdout.write(sep.join([str(x) for x in a])); sys.stdout.write('\\n')\r\n \r\n \r\ndef main():\r\n n = ri()\r\n a = ria()\r\n best = max(a) - min(a)\r\n for i in range(1, n-1):\r\n mx = 0\r\n for j in range(n-1):\r\n if j + 1 == i and j < n-2:\r\n cur = a[j]\r\n nex = a[j + 2]\r\n elif j == i and j > 0:\r\n cur = a[j-1]\r\n nex = a[j+1]\r\n else: \r\n cur = a[j]\r\n nex = a[j+1]\r\n mx = max(mx, nex - cur)\r\n best = min(best, mx)\r\n wi(best) \r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\nholds = list(map(int, input().split()))\n\ncosts = []\nfor i in range(1, n-1):\n\ttrack = holds[:i] + holds[i+1:]\n\tcost = max([(track[j+1]-track[j]) for j in range(len(track)-1)])\n\tcosts.append(cost)\nprint(min(costs))\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\nd=[0]*n\r\nx=0\r\ny=pow(10,20)\r\nfor i in range(1,n):\r\n d[i]=a[i]-a[i-1]\r\n x=max(x,d[i])\r\nfor i in range(2,n):\r\n y=min(y,d[i]+d[i-1])\r\n z=max(y,x)\r\nprint(z)", "input()\r\nl: [int] = list(map(int,input().split()))\r\nans = float('inf')\r\nfor i in range(1,len(l)-1):\r\n x = l[i]\r\n m = float('-inf')\r\n del l[i]\r\n for j in range(len(l)-1):\r\n m = max(m, l[j+1]-l[j])\r\n ans = min(m,ans)\r\n l.insert(i,x)\r\nprint(ans)", "def calc_dist(k,n):\r\n l=[]\r\n for i in range(n):\r\n if i != 0:\r\n l.append(k[i]-k[i-1])\r\n l.sort()\r\n return l[-1]\r\n\r\nn=int(input())\r\nt=input().split(' ')\r\nf=[]\r\nfor i in range(n):\r\n f.append(int(t[i]))\r\nt=f\r\nl=[]\r\nk=[]\r\nfor i in range(1,n-1):\r\n l=l+t\r\n l.remove(t[i])\r\n k.append(int(calc_dist(l,n-1)))\r\n l=[]\r\nk.sort()\r\nprint(k[0])\r\n\r\n\r\n", "n=int(input())\r\nl=list(map(int, input().split()))\r\nm=float(\"inf\")\r\nif n>2:\r\n for i in range(n-2):\r\n if l[i+2]-l[i]<m:\r\n m=l[i+2]-l[i]\r\n n=i+1\r\n l.pop(n)\r\nm=float(\"-inf\")\r\nfor i in range(len(l)-1):\r\n if m<l[i+1]-l[i]:\r\n m=l[i+1]-l[i]\r\nprint(m)", "\r\nnum = int(input())\r\ntrack = input().split()\r\ndiff_list = []\r\n\r\nfor i in range(1, num-1):\r\n removed_item = track.pop(i)\r\n diff_list.append(0)\r\n for a in range(0, num-2):\r\n difference = int(track[a+1]) - int(track[a])\r\n if difference >= diff_list[i-1]:\r\n diff_list[i-1] = int(track[a+1]) - int(track[a])\r\n track.insert(i, removed_item)\r\n\r\ndifficulty = min(diff_list)\r\nprint(difficulty)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(1,n-1):\r\n b=a[:i]+a[i+1:]\r\n d=[]\r\n for j in range(len(b)-1):\r\n d.append(b[j+1]-b[j])\r\n c.append(max(d))\r\nprint(min(c))\r\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif n == 3:\r\n print(a[-1] - a[0])\r\nelse:\r\n ans = 1000\r\n for i in range(1, n - 1):\r\n res = 1\r\n for j in range(1, n - 1):\r\n res = max(res, a[j +1] - [a[j], a[j - 1]][j == i])\r\n ans = min(ans, res)\r\n print(ans)\r\n \r\n", "import sys\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n-1):\r\n x=max(a[i+1]-a[i],x)\r\ny=sys.maxsize\r\nfor i in range(n-2):\r\n y=min(a[i+2]-a[i],y)\r\nprint(max(x,y))", "def main_function():\r\n input()\r\n a = [int(i) for i in input().split(\" \")]\r\n b = []\r\n intermediate = a[0]\r\n for i in range(1, len(a)):\r\n b.append(a[i] - intermediate)\r\n intermediate = a[i]\r\n if len(b) == 2:\r\n return sum(b)\r\n interm = 0\r\n mini = 1000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\r\n for i in range(1, len(b)):\r\n if mini > b[i] + b[i - 1]:\r\n mini = b[i] + b[i - 1]\r\n interm = i\r\n b[interm] += b[interm - 1]\r\n b.pop(interm - 1)\r\n return max(b)\r\n\r\n\r\n\r\nprint(main_function())", "n= int(input())\r\na = list(map(int,input().split()))\r\nans = 12345\r\nfor i in range(1,n-1):\r\n b = a[:i] + a[i+1:]\r\n '''for j in range(n-2):\r\n mackz = max(b[j+1] - b[j])\r\n ans = min(ans,mackz)'''\r\n ans = min(ans,max(b[j+1] - b[j] for j in range(n-2)))\r\nprint (ans)\r\n\r\n'''\r\nbal amar theory te kam korse na , shesh line ta dekha laglo. ami code para na.\r\nami mara jata cai.\r\nami python er cor tapor khawa murca gacha\r\n'''\r\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n m = 1e9\r\n for i in range(1,n-1):\r\n b = a[:i] + a[i+1:]\r\n mm = -1\r\n # print(a[i] , b)\r\n for j in range(n-2):\r\n mm = max(mm , b[j+1] - b[j])\r\n m = min(m,mm)\r\n print(m)\r\n ", "n = int(input())\na = list(map(int, input().split()))\n\nans = 1 << 50\n\nfor i in range(1,n-1):\n\ttmp = 0\n\tfor lo in range(n-1):\n\t\tif lo == i:\n\t\t\tcontinue\n\t\thi = lo + 1\n\t\tif hi == i:\n\t\t\thi += 1\n\t\ttmp = max(tmp, a[hi] - a[lo])\n\tans = min(ans, tmp)\n\nprint(ans)\n", "\r\n\r\nR = lambda:map(int,input().split())\r\n\r\n\r\nn, = R()\r\na = list(R())\r\n\r\nprint(max([min([a[i+2]-a[i] for i in range(n-2)])] + [a[i+1]-a[i] for i in range(n-1)]))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nk,h = list(l),float('inf')\r\nfor i in range(1,n-1):\r\n\tk.remove(l[i])\r\n\th = min(h,max([k[i+1]-k[i] for i in range(0,n-2)]))\r\n\tk = list(l)\r\nprint(h)", "a,A=int(input()),list(map(int,input().split()))\r\nprint(max( min(A[i+2]-A[i] for i in range(a-2)) , \r\n max(A[i+1]-A[i] for i in range(a-1)) ))\r\n\r\n", "n=int(input())\r\na = [int(i) for i in input().split()]\r\nprint(max([min([a[i+2]-a[i] for i in range(n-2)])] + [a[i]-a[i-1] for i in range(1, n)])) ", "#import sys ; input=sys.stdin.readline\n\nn=int(input())\nlt=list(map(int,input().split()))\ni=n\nd=n\nans=[]\nfor i in range(1,n-1):\n lt1=0\n for j in range(1,n-1):\n if i==j:\n lt1=max(lt[j+1]-lt[j-1],lt1)\n else:\n lt1=max(lt[j+1]-lt[j],lt1)\n\n ans.append(lt1)\nprint(min(ans))\n \t\t \t \t\t \t \t \t \t\t \t \t\t\t \t\t", "n=int(input())\r\nA=list(map(int,input().split()))\r\n\r\ncD = 0\r\nfor i in range(1, len(A)):\r\n cD = max(cD,A[i] - A[i-1])\r\n \r\nnD = None\r\nfor i in range(1, len(A) - 1):\r\n if not nD: nD = A[i+1] - A[i-1]\r\n nD = min(nD,A[i+1]-A[i-1])\r\n\r\nprint(max(nD,cD)) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inps():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn = inp()\r\nnums = inlt()\r\n\r\nminDiff = float('inf')\r\nminIdxToRemove = -1\r\nfor i in range(n-2):\r\n if nums[i+2] - nums[i] < minDiff:\r\n minDiff = nums[i+2] - nums[i]\r\n minIdxToRemove = i+1\r\n\r\n#print(minIdxToRemove)\r\n\r\nmaxDiff = 0\r\ni = 0\r\nwhile i < n-1:\r\n if i+1 == minIdxToRemove:\r\n maxDiff = max(maxDiff, nums[i+2] - nums[i])\r\n i += 2\r\n else:\r\n maxDiff = max(maxDiff, nums[i+1] - nums[i])\r\n i += 1\r\n\r\nprint(maxDiff)\r\n", "n = int(input())\r\nline = input().split()\r\n\r\nlst = []\r\nfor num in line:\r\n lst.append(int(num))\r\n\r\nans = lst[1] - lst[0]\r\nmn = lst[2] - lst[0]\r\nfor i in range(2, n):\r\n ans = max(ans, lst[i] - lst[i - 1])\r\n mn = min(mn, lst[i] - lst[i - 2])\r\n\r\nans = max(ans, mn)\r\nprint(str(ans))\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nk = 1001\r\n\r\nfor i in range(1, n-1):\r\n g = sorted(l)\r\n g.pop(i)\r\n c = 0\r\n for j in range(1, len(g)):\r\n c = max(c, g[j] - g[j-1])\r\n\r\n k = min(k, c) \r\n\r\nprint(k)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(n-1):\r\n d.append(a[i+1]-a[i])\r\nmd=1001\r\ndc=0\r\nfor i in range(n-2):\r\n if (d[i]+d[i+1])<md:\r\n dc=i\r\n md=d[i]+d[i+1]\r\n\r\n\r\nd2=[]\r\nfor i in range(n-1):\r\n d2.append(d[i])\r\nd2.sort()\r\nprint(max(d2[n-2],d[dc]+d[dc+1]))", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nmin1=1000\r\nmax1=0\r\nfor i in range (1,n):\r\n if(max1<l1[i]-l1[i-1]):\r\n max1=l1[i]-l1[i-1]\r\n if(i>1):\r\n if(min1>l1[i]-l1[i-2]):\r\n min1=l1[i]-l1[i-2]\r\nprint(max(min1,max1))\r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nminim=0\r\nfor i in range(1,n-1):\r\n if (a[i+1]-a[i-1]<minim)or(minim==0):\r\n minim=a[i+1]-a[i-1]\r\n k=i\r\na=a[:k]+a[k+1:]\r\nfor i in range(n-2):\r\n a[i]=a[i+1]-a[i]\r\nprint(max(a[:-1]))\r\n", "num=int(input())\r\nL1= [int(x) for x in input().split(\" \")]\r\nL3=[]\r\nL4=[]\r\n\r\nfor i in range(1,num-1):\r\n L2=L1.copy()\r\n del L2[i]\r\n for j in range(0,num-2):\r\n num2=L2[j+1]-L2[j]\r\n L3.append(num2)\r\n L4.append(max(L3))\r\n L3.clear()\r\n L2.clear()\r\nprint(min(L4))\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\notvet=a[n-1]-a[0]\r\n\r\nmaxx=0\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]>maxx:\r\n maxx=a[i+1]-a[i]\r\n\r\nminn=a[n-1]-a[0]\r\nfor i in range(n-2):\r\n if a[i+2]-a[i]<minn:\r\n minn=a[i+2]-a[i]\r\n\r\nprint(max(minn,maxx))\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\ny = x[1:-1]\r\nmini = -1\r\nmemo = []\r\n\r\nfor a in range(len(y)):\r\n \r\n z = y.copy()\r\n z.pop(a)\r\n maxi = 0\r\n\r\n z.append(x[0])\r\n z.append(x[-1])\r\n z.sort()\r\n\r\n \r\n \r\n for b in range(len(y)):\r\n \r\n j = abs(z[b] - z[b+1])\r\n if maxi < j:\r\n maxi = j\r\n \r\n memo.append(maxi)\r\nprint(min(memo))\r\n\r\n\r\n \r\n", "a,l=int(input()),list(map(int,input().split()))\r\ns=[]\r\nfor x in range(1,a-1):\r\n\tz=l[x]\r\n\tl.remove(z)\r\n\tk=[]\r\n\tfor y in range(1,a-1):\r\n\t\tk.append(l[y]-l[y-1])\r\n\ts.append(max(k))\r\n\tl.insert(x,z)\r\nprint(min(s))", "def difficulty(a, n, x):\n ma = -1 * int(1e8)\n for i in range(1, n):\n v = 0\n if i == x:\n continue\n elif i - 1 == x:\n v = a[i] - a[i - 2]\n else:\n v = a[i] - a[i - 1]\n ma = max(ma, v)\n return ma\n\ndef main():\n n = int(input())\n a = list(map(int, input().split(' ')))\n mi = int(1e8)\n for i in range(1, n - 1):\n mi = min(difficulty(a, n, i), mi)\n print(mi)\n\nmain()\n", "n=int(input())\r\nr=list(map(int,input().split()))\r\nc=0\r\nz=[]\r\nfor y in range(1,n-1):\r\n\tk=r[:y]+r[y+1:]\r\n\tfor x in range(n-2):\r\n\t\tj=k[x+1]-k[x]\r\n\t\tif j>c:c=j\r\n\tz.append(c)\r\n\tc=0\r\nprint(min(z))", "def getmax(a):\r\n m = -1000000000\r\n for i in range(len(a) - 1):\r\n m = max(m, a[i + 1] - a[i])\r\n return m\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nans = 1000000000\r\nfor i in range(1, n - 1):\r\n ans = min(ans, max([getmax(a[:i]), getmax(a[i + 1:]), a[i + 1] - a[i - 1]]))\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=int(0)\r\nk=[]\r\nfor i in range(1,n-1):\r\n b=a[:i:]+a[(i+1):]\r\n m=int(0)\r\n for j in range(n-2):\r\n m=max(m,abs(b[j]-b[j+1]))\r\n k.append(m)\r\nprint(min(k))", "n = int(input())\r\nholds = list(map(int, input().split()))\r\n\r\ncosts = []\r\nfor i in range(1,n-1):\r\n\ttrack = holds[:i] + holds[i+1:]\r\n\tcosts.append(max([(track[j+1] - track[j]) for j in range(len(track)-1)]))\r\n\r\nprint(min(costs))\r\n", "\r\nn = int(input())\r\na = []\r\nm = map(int,input().split())\r\nfor k in m:\r\n a.append(k)\r\nmine = 1000\r\nfor j in range(1,n-1):\r\n maxe = 0\r\n for i in range(n-1):\r\n if i+1 == j:\r\n maxe = max(maxe,a[i+2]-a[i])\r\n if i==j:\r\n 3/2\r\n else:\r\n maxe = max(maxe,a[i+1]-a[i])\r\n mine = min(mine,maxe)\r\nprint(mine)", "def ans(a):\r\n m=0\r\n \r\n for i in range (len(a)-1):\r\n if m<a[i+1]-a[i]:\r\n m=a[i+1]-a[i] \r\n return m\r\ndef remove(a,k):\r\n a=a[:k]+a[k+1:]\r\n return a\r\n\r\nn=int(input())\r\na=list(map(int, input().split()))\r\nmn=1001\r\nfor k in range (1,n-1):\r\n b=remove(a,k)\r\n d=ans(b)\r\n if mn>d:\r\n mn=d\r\n else:\r\n continue\r\nprint(mn)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(1,n-1):\r\n x=l[i]\r\n l.pop(i)\r\n res = [abs(j - i) for i, j in zip(l[: -1], l[1 :])]\r\n m.append(max(res))\r\n l.insert(i,x)\r\nprint(min(m))\r\n \r\n ", "num_clues = int(input())\r\nnumbers = input().split()\r\nnumbers = [ int(i) for i in numbers ]\r\n\r\noutput = []\r\nfor i in range(1, num_clues - 1):\r\n new_list = numbers[:i] + numbers[i + 1:]\r\n output.append(max([ new_list[x] - new_list[x - 1] for x in range(num_clues - 2, 0, -1) ]))\r\n\r\nprint(min(output))", "n = int(input())\r\n# a=[1,2,3,4,5]\r\n# r = a.pop(1)\r\n# print(r)\r\n# print(a)\r\n# a.insert(1,r)\r\n# print(a)\r\na = list(map(int,input().split()))\r\nac=[]\r\nfor i in a:\r\n ac.append(i)\r\nfor i in range(n-2):\r\n d = a[i+2]-a[i]\r\n if i == 0:\r\n m=d\r\n r=ac.pop(i+1)\r\n ri = i+1\r\n else:\r\n if d<m:\r\n m =d\r\n ac.insert(ri,r)\r\n r = ac.pop(i+1)\r\n ri = i+1\r\n else:\r\n pass\r\nma =0\r\nfor i in range(len(ac)-1):\r\n h = ac[i+1]-ac[i]\r\n ma = max(ma,h)\r\nprint(ma)", "import sys\n\nnum = int(sys.stdin.readline())\ndata = [int(x) for x in sys.stdin.readline().split(\" \")]\ndiff = []\nmaxl = 10000\n\nfor i in range(0,num-1):\n diff.append(data[i+1]-data[i])\n\ndifflen = len(diff)\n\nfor i in range(0,difflen-1):\n maxd = diff[i]+diff[i+1]\n for j in range(0,difflen):\n if not j == i and not j == i+1:\n maxd = max(maxd,diff[j])\n maxl = min(maxl,maxd)\nprint(maxl)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a\r\nl=[]\r\nfor i in range(1,n-1):\r\n ld=[]\r\n b=b[0:i]+b[i+1:]\r\n for j in range(1,len(b)):\r\n d=b[j]-b[j-1]\r\n ld.append(d)\r\n l.append(max(ld))\r\n b=a\r\nprint(min(l))", "n = int(input())\r\nlis = [int(x) for x in input().split()]\r\n\r\nans2 = []\r\nfor _ in range(1,n-1):\r\n temp = []\r\n temp.extend(lis)\r\n temp.pop(_)\r\n ans = []\r\n for i in range(1,len(temp)):\r\n ans.append(temp[i] - temp[i-1])\r\n ans2.append(max(ans))\r\nprint(min(ans2))\r\n\r\n\r\n\r\n\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 = int(input())\r\nar = get_list()\r\nnwar = [0]*(n-1)\r\ndm = ar[1]-ar[0]\r\nfor i in range(n-1):\r\n nwar[i] = ar[i+1]-ar[i]\r\n dm = max(dm,ar[i+1]-ar[i])\r\noup = max(nwar[0]+nwar[1],dm)\r\nfor i in range(n-2):\r\n d = max(nwar[i]+nwar[i+1],dm)\r\n oup = min(d,oup)\r\nprint(oup)", "#import sys ; input=sys.stdin.readline\r\n\r\nn=int(input())\r\nlt=list(map(int,input().split()))\r\ni=n\r\nd=n\r\nans=[]\r\nfor i in range(1,n-1):\r\n lt1=0\r\n for j in range(1,n-1):\r\n if i==j:\r\n lt1=max(lt[j+1]-lt[j-1],lt1)\r\n else:\r\n lt1=max(lt[j+1]-lt[j],lt1)\r\n\r\n ans.append(lt1)\r\nprint(min(ans))", "n = int(input())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nd = []\r\nfor i in range(1,n):\r\n\td.append(abs(s[i-1]-s[i]))\r\nres = []\r\nfor i in range(len(d)-1):\r\n\tk = d[:i]\r\n\tk.append(d[i+1]+d[i])\r\n\tk += d[i+2:]\r\n\tres.append(max(k))\r\nprint(min(res)) \r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[l[i+1] - l[i] for i in range(n-1)]\r\ny=[l[i+2] - l[i] for i in range(n-2)]\r\nprint(max(max(x),min(y)))\r\n", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\ndef func(x):\r\n arr=[]\r\n s=0\r\n for i in range(1,len(x)):\r\n s=x[i]-x[i-1]\r\n arr.append(s)\r\n return max(arr) \r\nk=100000000 \r\nfor i in range(1,n-1):\r\n a=x.copy()\r\n a.remove(a[i])\r\n ans=func(a)\r\n if ans<k:\r\n k=ans\r\nprint(k) \r\n ", "n = int(input())\na = list(map(int, input().split()))\n\ndef f(a):\n mm = float('-inf')\n for x in range(len(a)-1):\n mm = max(mm, a[x+1] - a[x])\n return mm\n\nans, ansx = -1, float('+inf')\nfor i in range(1, n-1):\n nn = f(a[:i]+a[i+1:])\n if nn < ansx:\n ans, ansx = i, nn\nprint(ansx)\n", "N = int(input())\nA = list(map(int, input().split()))\n\n# 1, 2, ..., n, n + 2, n + 3, ...\ndef fn(n):\n i = 0\n ret = -1e30\n while i < N - 1:\n if i != n:\n diff = A[i + 1] - A[i]\n i += 1\n else:\n diff = A[i + 2] - A[i]\n i += 2\n ret = max(ret, diff)\n return ret\n\nans = 1e30\nfor i in range(N - 2):\n ans = min(ans, fn(i))\nprint(ans)\n", "n = int(input())\narr = list(map(int, input().split()))\n\nmaxArr = []\nfor i in range(1, n - 1):\n tempMax = float(\"-inf\")\n for j in range(n-1):\n if j == i:\n continue\n elif j == i-1:\n tempMax = max(tempMax, arr[i+1] - arr[j])\n else:\n tempMax = max(tempMax, arr[j+1] - arr[j])\n maxArr.append(tempMax)\nprint(min(maxArr))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=[]\r\nfor i in range(1,n-1):\r\n u=[]\r\n for j in range(1,i):\r\n u.append((l[j]-l[j-1]))\r\n u.append(l[i+1]-l[i-1])\r\n for j in range(i+1,n-1):\r\n u.append(l[j+1]-l[j])\r\n r.append(max(u))\r\nprint(min(r))", "n = int(input())\r\nalist = [int(x) for x in input().split()]\r\namax = -1\r\nfor i in range(0,n - 1):\r\n amax = max(amax, alist[i + 1] - alist[i])\r\n \r\namin = 1000\r\nfor i in range(1, n-1):\r\n amin = min(amin, max(amax, alist[i+1] - alist[i -1]))\r\n \r\nprint(amin) ", "import math\r\n\r\nx = math.inf\r\ny = -math.inf\r\ns = -1\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfor i in range(n - 2):\r\n if a[i + 2] - a[i] < x:\r\n x = a[i + 2] - a[i]\r\n s = i + 1\r\na.pop(s)\r\nfor i in range(n - 2):\r\n if a[i + 1] - a[i] > y:\r\n y = a[i + 1] - a[i]\r\n\r\nprint(y)", "n = int(input()) \r\nlistt = list(map(int , input().split())) \r\nres= []\r\nfor i in range(1 , n -1 ) : \r\n listcpy = listt[::]\r\n listcpy.remove(listcpy[i]) \r\n l = []\r\n for j in range(1 , n-1) : \r\n distance = abs(listcpy[j-1] - listcpy[j])\r\n l.append(distance)\r\n res.append(max(l)) \r\nprint(min(res)) \r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(1,len(a)-1):\r\n c=a[:i]+a[i+1:]\r\n l=[]\r\n for j in range(len(c)-1):\r\n l.append(c[j+1]-c[j])\r\n d.append(max(l))\r\nprint(min(d))\r\n", "n = int(input())\r\nlst = [*map(int, input().split())]\r\na = max([lst[i + 1] - lst[i] for i in range(n - 1)])\r\nb = min([lst[i + 2] - lst[i] for i in range(n - 2)])\r\nprint(max(a, b))\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nans = float('inf')\nfor i in range(1, n-1):\n b = a[:i] + a[i+1:]\n tmp = -float('inf')\n for j in range(1, n-1):\n tmp = max(tmp, b[j] - b[j-1])\n ans = min(ans, tmp)\nprint(ans)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nh = []\r\nfor i in range(1, n - 1):\r\n b = a.copy()\r\n b.remove(a[i])\r\n m = min(b) - max(b)\r\n for i in range(n - 2):\r\n m = max(m, abs(b[i] - b[i + 1]))\r\n h.append(m)\r\nprint(min(h))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ny,z=[],[]\r\nfor i in range(1,n-1):\r\n x=l[:]\r\n del(x[i])\r\n for j in range(len(x)-1):\r\n y.append(x[j+1]-x[j])\r\n z.append(y)\r\n y=[]\r\nfor i in range(len(z)):\r\n y.append(max(z[i]))\r\nprint(min(y))\r\n ", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nm=10**10\r\nfor i in range(1,n-1):\r\n count=0\r\n diff=0\r\n b=a[i]\r\n a.remove(a[i])\r\n for j in range(1,n-1):\r\n diff=a[j]-a[j-1]\r\n count=max(count,diff)\r\n m=min(m,count)\r\n a.insert(i,b)\r\nprint(m)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nd = []\r\n\r\nfor i in range(n-2): \r\n d.append(l[i+2]-l[i])\r\n\r\nind = d.index(min(d))+1\r\nl.pop(ind)\r\n\r\nm = 0\r\nfor i in range(n-2): \r\n if m < l[i+1]-l[i]: m = l[i+1]-l[i]\r\nprint(m)", "\r\na = int(input())\r\nh = list(map(int,input().split()))\r\n\r\ndef diff(l):\r\n return max([l[i+1] - l[i] for i in range(len(l)-1)])\r\n\r\nk =[i for i in h]\r\nx =[]\r\n\r\nfor i in range(1,a-1):\r\n k.pop(i)\r\n x.append(diff(k))\r\n k = [j for j in h]\r\n \r\nprint(min(x))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = []\r\nfor i in range(1,n-1):\r\n x = []\r\n for j in l:\r\n if j!=l[i]:\r\n x.append(j)\r\n mx = 0\r\n for j in range(1,len(x)):\r\n diff = x[j]-x[j-1]\r\n if diff>mx:\r\n mx = diff\r\n ans.append(mx)\r\nprint(min(ans))\r\n", "n = int(input())\r\narray = list(map(int,input().split()))\r\ndef diff(A):\r\n return max([A[i + 1] - A[i] for i in range(len(A) - 1)])\r\n\r\n\r\nprint(min(diff(array[:i+1] + array[i+2:]) for i in range(n-2)))\r\n", "'''\r\nCreated on ١٧‏/١٢‏/٢٠١٤\r\n\r\n@author: mohamed265\r\n'''\r\ninput()\r\nt = [int(x) for x in input().split()]\r\nn = len(t) - 1\r\ntemp = 1000000000\r\nfor i in range(1, n):\r\n temp2 = 0\r\n for j in range(n):\r\n # if i + 1 == j:\r\n # temp2 = max(temp2 , t[j + 2] - t[j])\r\n # el\r\n if j + 1 == i:\r\n temp2 = max(temp2 , t[j + 2] - t[j])\r\n elif i != j:\r\n temp2 = max(temp2 , t[j + 1] - t[j])\r\n temp = min(temp , temp2)\r\nprint(temp)\r\n", "n = int(input())\r\n\r\na_values = list(map(int, input().split()))\r\n\r\nmax_values = []\r\n\r\nfor i in range(1, n-1):\r\n b = a_values[:i]+a_values[i+1:]\r\n b_max = 0\r\n for b_index in range(len(b)-1):\r\n b_max = max(b_max, (b[b_index+1]-b[b_index]))\r\n max_values.append(b_max)\r\n\r\nprint(min(max_values))\r\n", "n=int(input());a=list(map(int,input().split()));o=10**10\r\nfor i in range(1,n-1):\r\n ot=-10**10;b=[]\r\n for j in range(n):\r\n if(i!=j):b.append(a[j])\r\n for j in range(n-2):ot=max(ot,b[j+1]-b[j])\r\n o=min(o,ot);\r\nprint(o)\r\n", "if __name__ == \"__main__\":\n n = int(input().strip())\n arr = list(map(int, input().strip().split()))\n id = n\n mins = max(arr)\n maxs = 0\n for i in range(1, n-1):\n d = arr[i+1] - arr[i-1]\n if (d <= mins):\n id = i\n mins = d\n arr.remove(arr[id])\n n -= 1\n for i in range(n-1):\n d = arr[i+1] - arr[i]\n if d >= maxs:\n maxs = d\n print(maxs)\n \t \t \t\t\t\t\t\t \t \t \t \t \t\t\t\t\t \t\t\t", "import functools\nimport sys\n\n\ndef main():\n n = int(input())\n a = list(map(int, input().split()))\n res = sys.maxsize\n for i in range(1, n-1):\n tmp = a[:]\n tmp.pop(i)\n dif = 0\n def f(a, b):\n nonlocal dif\n dif = max(b-a, dif)\n return b\n functools.reduce(f, tmp)\n res = min(res, dif)\n print(res)\n\nmain()\n", "from itertools import tee\r\n\r\ndef pairwise_apart(ais):\r\n ais1, ais2 = tee(ais)\r\n next(ais2, 999999)\r\n next(ais2, 999999)\r\n return zip(ais1, ais2)\r\n\r\ndef pairwise(ais):\r\n ais1, ais2 = tee(ais)\r\n next(ais2, 999999)\r\n return zip(ais1, ais2)\r\n\r\n# def triplets(ns):\r\n# ns1, ns2, ns3 = tee(ns, 3)\r\n\r\n\r\ndef diff(ns):\r\n return ns[1] - ns[0]\r\n\r\ndef main(ais):\r\n diffs_after = [diff(ns) for ns in pairwise_apart(ais)]\r\n diffs_before = [diff(ns) for ns in pairwise(ais)]\r\n ans = max(min(diffs_after), max(diffs_before))\r\n # print(diffs_after, diffs_before)\r\n\r\n print(ans)\r\n\r\n\r\n# main([1, 2, 3, 7, 8])\r\n\r\n\r\ninput()\r\nmain([int(x) for x in input().split(\" \")])\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = []\r\nd = []\r\nfor i in range(1,n-1):\r\n x = a.copy()\r\n del x[i]\r\n s.append(x)\r\nfor i in range(0,len(s)):\r\n x = []\r\n for j in range(0,len(s[i])-1):\r\n x.append(s[i][j+1]-s[i][j])\r\n d.append(max(x))\r\nprint(min(d))\r\n", "# import sys\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 solve(arr, n):\r\n\tmax_diff = -math.inf\r\n\tmin_diff = math.inf\r\n\r\n\tfor i in range(1, n):\r\n\t\tmax_diff = max(max_diff, arr[i] - arr[i-1])\r\n\r\n\tfor i in range(1, n-1):\r\n\t\tif arr[i+1] - arr[i-1] < min_diff:\r\n\t\t\tresult = max(max_diff, arr[i+1] - arr[i-1])\r\n\t\t\tmin_diff = min(min_diff, arr[i+1] - arr[i-1])\r\n\treturn result\r\n\r\nn = int(input())\r\narr = list(map(int, input().strip().split()))\r\nresult = solve(arr, n)\r\nprint(result)", "n = int(input())\r\nli = list(map(int,input().split()))\r\ndiff=[]\r\nne=[]\r\nfor i in range(0,n-1):\r\n diff.append(li[i+1] - li[i])\r\nfor i in range(1,len(diff)):\r\n d = diff[:i-1] + [diff[i-1] + diff[i]] + diff[i+1:]\r\n ne.append(max(d))\r\nprint(min(ne))", "f=lambda:map(int,input().split())\r\nn=int(input())\r\nl=list(f())\r\nl2=[l[i]-l[i-1] for i in range(1,n)]\r\nl3=[]\r\nmx=max(l2)\r\nfor i in range(n-2):\r\n x=l2[i]+l2[i+1]\r\n l3.append(max(x,mx))\r\nprint(min(l3))", "\r\nn = int(input())\r\nlst = list(map(int,input().split()))\r\ndif = [lst[i+1]-lst[i] for i in range(n-1)]\r\nm = max(dif)\r\n\r\nl = min([max(m,dif[j]+dif[j+1]) for j in range(n-2)])\r\n\r\nprint(l)\r\n\r\n\r\n", "#!/bin/python3\n\nn = int(input())\nnums = list(map(int, input().split()))\n\ndef difficulty(nums):\n diff = None\n for i in range(1, len(nums)):\n diff2 = nums[i] - nums[i-1]\n if not diff or diff2 > diff:\n diff = diff2\n\n return diff\n\nmin_diff = None\n\nfor i in range(1, len(nums)-1):\n nums2 = list(nums)\n nums2.pop(i)\n\n diff = difficulty(nums2)\n if not min_diff or diff < min_diff:\n min_diff = diff\n\nprint(min_diff)\n\n", "def calMin(l):\r\n \r\n m=-2**31\r\n \r\n for i in range(1,len(l)):\r\n m=max(m,l[i]-l[i-1])\r\n\r\n return m\r\n\r\nn=int(input())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nres=2**31\r\n\r\nfor i in range(1,len(l)-1):\r\n a=l.copy()\r\n \r\n a.pop(i)\r\n \r\n m=calMin(a)\r\n \r\n res=min(res,m)\r\n \r\nprint(res)", "def main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n mindiff = 999999\r\n for i in range(1, n-1):\r\n maxdiff = -999999\r\n for j in range(n-1):\r\n if j == i - 1:\r\n maxdiff = max(maxdiff, abs(a[j+2] - a[j]))\r\n elif j == i:\r\n continue\r\n else:\r\n maxdiff = max(maxdiff, abs(a[j] - a[j+1]))\r\n mindiff = min(mindiff, maxdiff)\r\n print(mindiff)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "input()\r\ntrack = [int(i) for i in input().split()]\r\nans = track[-1] - track[0]\r\nidx = 0\r\nfor n, i in enumerate(track[1:-1], 1):\r\n t = track[n + 1] - track[n - 1]\r\n if t < ans:\r\n ans = t\r\n idx = n\r\ntrack.pop(idx)\r\nfor n, i in enumerate(track[:-1]):\r\n ans = max(ans, track[n + 1] - track[n])\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nmass = list(map(int, input().split()))\r\nmini = 1000000000\r\nfor i in range(1, n - 1):\r\n maxi = -1\r\n l = 0\r\n for r in range(1, n):\r\n if r == i:\r\n continue\r\n else:\r\n maxi = max(mass[r] - mass[l], maxi)\r\n if r - l == 2:\r\n r += 1\r\n l += 2\r\n else:\r\n r += 1\r\n l += 1\r\n mini = min(mini, maxi)\r\nprint(mini)\r\n\r\n\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ne=1\r\nd=[]\r\nwhile(e<len(a)-1):\r\n l=[]\r\n p=a[e]\r\n a.pop(e)\r\n for i in range(1,len(a)):\r\n l.append(a[i]-a[i-1])\r\n d.append(max(l))\r\n a.insert(e,p)\r\n e=e+1\r\nprint(min(d))", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n B = []\r\n s = set()\r\n for i in range(1, n):\r\n B.append(A[i] - A[i-1])\r\n min_val = 10 ** 18\r\n for i in range(1, len(B)):\r\n C = []\r\n for j in range(len(B)):\r\n if j == i - 1:\r\n continue\r\n elif j == i:\r\n C.append(B[j-1] + B[j])\r\n else:\r\n C.append(B[j])\r\n val = max(C)\r\n min_val = min(min_val, val)\r\n print(min_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\na = list(map(int,input().split()))\r\nd = 1000\r\nfor i in range(1,len(a)-1):\r\n b = a[:]\r\n b.pop(i)\r\n diff = []\r\n for j in range(len(b)-1):\r\n diff.append(b[j+1]-b[j])\r\n m=max(diff)\r\n if m<d:\r\n d=m\r\n else:\r\n pass\r\nprint(d) ", "n = int(input())\r\na = list(map(int,input().split()))\r\ndif = [int(a[q+1]-a[q-1]) for q in range(1,n-1)]\r\na.pop(dif.index(min(dif))+1)\r\na = [a[q]-a[q-1] for q in range(1,n-1)]\r\nprint(max(a))", "n=int(input())\r\nmas_vsi = list(map(int, input().split(' ') ))\r\ndef mas_ras(mv):\r\n mas_r=[]\r\n for i in range(len(mv)):\r\n mas_r.append(mv[i]-mv[i-1])\r\n return(mas_r)\r\ndef opred_min_uvelich(mas_rznst):\r\n mas_rznst = mas_rznst[1:]\r\n if len(mas_rznst) < 2:\r\n return (mas_rznst[0])\r\n t = mas_rznst[0]+mas_rznst[1]\r\n m=max(mas_rznst)\r\n for i in range(len(mas_rznst)-1):\r\n if mas_rznst[i]+mas_rznst[i+1]<t :\r\n t=mas_rznst[i]+mas_rznst[i+1]\r\n elif mas_rznst[i]+mas_rznst[i+1]<m :\r\n return (m)\r\n return(t)\r\nprint(opred_min_uvelich(mas_ras(mas_vsi)))", "maxof=0\r\nminof=1000\r\nn=int(input())\r\na =[int(x) for x in input().split()]\r\nflag=False\r\nfor i in range(1,n):\r\n if (a[i]-a[i-1])>maxof:\r\n maxof = a[i]-a[i-1]\r\n\r\nfor i in range(2,n):\r\n if (a[i]-a[i-2]) < maxof:\r\n flag=True\r\n break\r\n if (a[i]-a[i-2]) <minof:\r\n minof = a[i]-a[i-2]\r\nif (flag == False):\r\n print(minof)\r\nelse:\r\n print(maxof)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nm = -1\r\nans = 0\r\nd = []\r\nfor i in range(1,n-1):\r\n d+=[abs(a[i-1]-a[i+1])]\r\np = d.index(min(d))\r\na.remove(a[p+1])\r\nfor i in range(n-2):\r\n ans = max(ans,abs(a[i]-a[i+1]))\r\nprint(ans)", "n = int( input() )\r\na = list( map( int, input().split() ) )\r\n\r\nb = [0]\r\nfor i in range( 1, n ):\r\n b.append( a[i] - a[i - 1] )\r\n\r\nres = 1005\r\nfor i in range( 1, ( n - 1 ) ):\r\n now = b[i + 1] + b[i]\r\n for j in range( 1, n ):\r\n if( ( j != i ) and ( j != i + 1 ) ):\r\n now = max( b[j], now )\r\n res = min( now, res )\r\n\r\nprint( res )\r\n", "# 496A Minimum Difficulty \n\n\na= int(input())\nb = [int(i) for i in input().split()] \n\ndifficulties = []\n\ndef difficulty(arr):\n diff = []\n for i in range(len(arr)-1):\n diff.append(abs(arr[i]-arr[i+1]))\n return max(diff)\n\nfor i in range(1,len(b)-1):\n x = b.copy()\n x.pop(i)\n difficulties.append(difficulty(x))\nprint(min(difficulties))", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n\n\ndef value(): return tuple(map(int, input().split()))\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\ndef inlst(): return [int(i) for i in input().split()]\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\ndef inp(): return int(input())\ndef inps(): return int(sys.stdin.readline())\ndef instr(): return input()\ndef stlst(): return [i for i in input().split()]\n\n\n######################################################################################\n#--------------------------------------code here-------------------------------------#\n######################################################################################\n\ndef solve():\n n = inp()\n l=inlsts()\n ind ,mx=0,float('inf')\n for i in range(1,n-1):\n tem=l.copy()\n tem.pop(i)\n temmx=0\n for j in range(1,n-1):\n temmx=max(temmx, tem[j]-tem[j-1])\n mx=min(mx ,temmx )\n # if mx <tem[j]-tem[j-1] :\n # ind =i\n return mx\n\n\nif __name__ == \"__main__\":\n print(solve())\n", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\nq = [int(x) for x in input().split()]\r\nans = int(1e9)\r\nfor i in range(1, n-1):\r\n temp = int(-1e9)\r\n for j in range(n-1):\r\n if i == j:\r\n continue\r\n elif j == i-1:\r\n temp = max(temp, abs(q[j] - q[j+2]))\r\n else:\r\n temp = max(temp, abs(q[j] - q[j+1]))\r\n ans = min(ans, temp)\r\nprint(ans)\r\n", "n = int(input())\r\nstring = input()\r\nheights = string.split(\" \")\r\nfor x in range(n):\r\n heights[x] = int(heights[x])\r\ndifficulties = []\r\nfor x in range(1, n - 1):\r\n temp = heights[:]\r\n del temp[x]\r\n distances = []\r\n for y in range(n - 2):\r\n distances.append(temp[y + 1] - temp[y])\r\n difficulties.append(max(distances))\r\nprint(min(difficulties))", "a=int(input())\r\n\r\nl=list(map(int,input().split(\" \")))\r\nl1=[]\r\nl2=[]\r\nfor i in range(1,a-1):\r\n\tb=l.pop(i)\r\n\t\r\n\tfor j in range(0,len(l)-1):\r\n\t\tc=l[j+1]-l[j]\r\n\t\tl1.append(c)\r\n\td=max(l1)\r\n\tl.insert(i,b)\t\r\n\tl2.append(d)\r\n\tl1=[0]*1000\r\nprint(min(l2))\t\r\n\t\r\n\t", "n=int(input())\r\nA=list(map(int,input().split()))\r\ndef diff(A):\r\n return max(A[i+1]-A[i ]for i in range(len(A)-1))\r\nprint(min(diff(A[:i+1] + A[i+2 :]) for i in range(n-2)))", "n=int(input())\r\narr=list(map(int , input().split()))\r\ncurrent_difficulty=0\r\narr1=[]\r\nflag=True\r\nmaxi=arr[2]-arr[0]\r\nfor i in range(n-1):\r\n if arr[i+1]-arr[i]>current_difficulty:\r\n current_difficulty=arr[i+1]-arr[i]\r\nfor i in range(n-2):\r\n if arr[i+2]-arr[i]>=current_difficulty:\r\n arr1.append(arr[i+2]-arr[i])\r\n elif arr[i+2]-arr[i]<current_difficulty and flag==True:\r\n arr1.append(current_difficulty)\r\n flag=False\r\nprint(min(arr1))\r\n# print(current_difficulty)\r\n", "from itertools import combinations\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(combinations(a,n-1))\r\ns=[]\r\nc=[]\r\nfor val in b:\r\n if val[0]==a[0] and val[-1]==a[-1]:\r\n c.append(val)\r\n \r\nfor val in c:\r\n f=0\r\n for i in range(len(val)-1):\r\n if f==0:\r\n diff=(val[i+1]-val[i])\r\n f=1\r\n if f==1 and (val[i+1]-val[i])>diff:\r\n diff=val[i+1]-val[i]\r\n s.append(diff)\r\nprint(min(s))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nres = []\r\nfor i in range(n-1):\r\n\tres.append(a[i+1]-a[i])\r\n\r\ni = 1\r\nmin_val = 999999\r\n# print(res)\r\nans = []\r\nwhile i < n-1:\r\n\ttemp = res[:i-1]\r\n\ttemp.append(res[i-1]+res[i])\r\n\t# print(temp)\r\n\ttemp.extend(res[i+1:])\r\n\tans.append(max(temp))\r\n\t# print(temp, ans)\r\n\ti += 1\r\n\r\nmin_val = min(ans)\r\nprint(min_val)\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = -1\r\nfor i in range(n-1):\r\n c = a[i+1]-a[i]\r\n if c > m:\r\n m = c\r\nm2 = 1000000000\r\nfor i in range(1, n-1):\r\n if a[i+1] - a[i-1] < m2:\r\n m2 = a[i+1] - a[i-1]\r\nprint(max(m, m2))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ny=[]\r\nfor i in range(1,n-1):\r\n\tl=list(a)\r\n\tl.remove(a[i])\r\n\tx=[l[i+1]-l[i] for i in range(len(l)-1)]\r\n\ty.append(max(x))\r\nprint(min(y))", "n=int(input())\r\na=list(map(int,input().split()))\r\none=[]\r\ntwo=[]\r\n\r\nfor i in range(0,n-1):\r\n one.append(a[i+1]-a[i])\r\n \r\nfor i in range(1,n-1):\r\n two.append(a[i+1]-a[i-1])\r\n \r\nans=max(max(one),min(two))\r\n\r\nprint(ans)\r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmini=1000\r\nd=[]\r\nfor i in range(1,len(l)):\r\n d.append(l[i]-l[i-1])\r\n \r\nmaxi=max(d)\r\nfor i in range(1,len(d)):\r\n mini=max(min(mini,d[i]+d[i-1]),maxi)\r\n# for j in range(1,len(l)-1):\r\n# mini=max(l[j+1]-l[j-1],mini)\r\n# print(mini)\r\n# for i in range(1,len(l)-1):\r\n# var=l[i]-l[i-1]\r\n# if(var==mini):\r\n# mini=min(l[i+1]-l[i-1],mini)\r\n# # temp=[]\r\n# # for j in range(0,len(l)):\r\n# # if(j!=i):\r\n# # temp.append(l[j])\r\n# # maxi=0\r\n# # for j in range(1,len(temp)):\r\n# # maxi=max(temp[j]-temp[j-1],maxi)\r\n# # mini=min(maxi,mini)\r\nprint(mini)", "n = int(input())\r\ninp = list(map(int,input().split()))\r\nk = 100001\r\nmingap = 100001\r\nmaxgap = 0\r\nfor i in range(n-2):\r\n if inp[i+2] - inp[i] < mingap:\r\n mingap = inp[i+2] - inp[i]\r\n k = i\r\n\r\ninp.remove(inp[k+1])\r\n\r\nfor j in range(n-2):\r\n if inp[j+1] - inp[j] > maxgap:\r\n maxgap = inp[j+1]- inp[j]\r\n\r\nprint(maxgap)\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\ni=1\r\nd=10**10\r\ns=0\r\nwhile(i+1<n):\r\n if(L[i+1]-L[i-1]<d):\r\n d=L[i+1]-L[i-1]\r\n s=i\r\n i+=1 \r\nL.remove(L[s])\r\ni=0\r\nd=0\r\n\r\nwhile(i+1<len(L)):\r\n d=max(d,L[i+1]-L[i])\r\n i+=1\r\nprint(d) ", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncurr_score = float(\"-inf\")\r\n\r\nfor i in range(num-1):\r\n curr_score = max(curr_score, arr[i+1]- arr[i])\r\n\r\nnew_score = float(\"inf\")\r\n\r\nfor i in range(num-2):\r\n new_score = min(new_score, arr[i+2]-arr[i])\r\n\r\nprint(max(new_score, curr_score))\r\n", "n=int(input())\r\na=[]\r\na=input().split()\r\nfor i in range(0,n):\r\n a[i]=int(a[i])\r\n\r\nmd=[]\r\nc=[]\r\nfor i in range(1,n-1):\r\n diff=[]\r\n c=a.copy()\r\n c.pop(i)\r\n for j in range(0,len(c)-1):\r\n d=c[j+1]-c[j]\r\n diff.append(d)\r\n md.append(max(diff))\r\n\r\n\r\nprint(min(md))\r\n", "n = int(input())\na = list(map(int, input().split(\" \")))\nma = a[n-1]-a[n-2]\nmi = 10000\nfor i in range(1, n-1):\n ma = max(ma, a[i]-a[i-1])\n mi = min(mi, a[i+1] - a[i-1])\nprint(max(ma, mi))\n", "n=int(input())\r\na=list(int(i) for i in input().split())\r\nb=[]\r\nfor i in range (1,n):\r\n b.append(a[i]-a[i-1])\r\nbd=max(b)\r\nc=[]\r\nfor i in range (1,n-1):\r\n c.append(b[i]+b[i-1])\r\ncd=min(c)\r\n\r\nd=max(bd,cd)\r\n\r\nprint(d)", "n = int(input())\na = [int(x) for x in input().split()]\nans = 100000\nfor i in range(1, n - 1):\n\tvar = a[: i] + a[i + 1: ]\n\tans = min(ans, max([a - b for a, b in zip(var[1:], var[:-1])]))\nprint(ans)\n", "def main():\r\n n = int(input().split()[0])\r\n holds = list(map(int, input().split()))\r\n min_dis = float('inf')\r\n for i in range(1,n-1):\r\n dis = holds[i+1]-holds[i-1]\r\n if min_dis>dis:\r\n min_dis = dis\r\n \r\n for i in range(1,n):\r\n min_dis = max(min_dis, holds[i]-holds[i-1])\r\n print(min_dis) \r\nmain() \r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nans=1000000\r\nfor i in range(1,n-1):\r\n diff=l1[i+1]-l1[i-1]\r\n if diff<ans:\r\n ans=diff\r\n index=i\r\nl1.remove(l1[index])\r\nans=0\r\nfor i in range(n-2):\r\n ans=max(ans,l1[i+1]-l1[i])\r\nprint(ans)", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nfmv = -1\r\nsmv = math.inf\r\nfor i in range(1, n):\r\n fmv = max(data[i] - data[i - 1], fmv)\r\n if i > 1:\r\n smv = min(data[i] - data[i - 2], smv)\r\n\r\nprint(max(fmv, smv))\r\n", "holds = int(input())\r\npos = input()\r\npos = pos.split()\r\npos = [int(x) for x in pos]\r\nmaximum = 0\r\nmin_in_max = []\r\na = 0\r\nif pos == 3:\r\n print(pos[2]-pos[0])\r\nelse:\r\n for x in range(1,(holds-1)):\r\n a = pos.pop(x)\r\n maximum = 0\r\n for y in range(1,holds-1):\r\n if pos[y] - pos[y-1] > maximum:\r\n maximum = pos[y] - pos[y-1]\r\n min_in_max.append(maximum)\r\n pos.insert(x,a)\r\nmin_in_max.sort()\r\nprint(min_in_max[0])", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nsmallest = a[2] - a[0]\r\nfor i in range(1, n-2):\r\n if a[i+2] - a[i] < smallest:\r\n smallest = a[i+2] - a[i]\r\nlargest = 0\r\nfor i in range(n-1):\r\n if a[i+1] - a[i] > largest:\r\n largest = a[i+1] - a[i]\r\nif largest > smallest:\r\n smallest = largest\r\nprint(smallest)\r\n", "n=int(input().strip())\narr=list(map(int,input().strip().split(' ')))\nl=[]\nfor i in range(1,n-1):\n x=arr.pop(i)\n d = []\n for i in range(len(arr)-1):\n d.append(arr[i + 1] - arr[i])\n l.append(max(d))\n arr.append(x)\n arr.sort()\nprint(min(l))", "n = int(input())\na = list(map(int, input().split()))\ndist = 10000\nfor i in range(1, n-1):\n b = a[:i]+a[i+1:]\n tmp = max([b1-b0 for b1, b0 in zip(b[1:], b[:-1])])\n if tmp < dist: \n dist = tmp\nprint(dist)\n", "n=int(input())\r\nl=list(map(int,input().rstrip().rsplit()))\r\nx=[]\r\nfor i in range(n-2):\r\n c=l.copy()\r\n l.pop(i+1)\r\n res=[l[j+1]-l[j] for j in range(len(l)-1)]\r\n x.append(max(res))\r\n l=c\r\n\r\nprint(min(x))\r\n", "N=int(input())\nA=[int(n) for n in input().split()]\nC=[]\nmem=[]\n\nfor i in range(N-2):\n\tC.append(A[i+2]-A[i])\nf=C.index(min(C))\t\ndel A[f+1]\nfor i in range(N-2):\n\tmem.append(A[i+1]-A[i])\nprint(max(mem))", "n = int(input())\nx = list(map(int, input().split()))\nmin_dif = float('inf')\nmin_index = 0\nfor _ in range(n - 2):\n if x[_ + 2] - x[_] < min_dif:\n min_dif = min(min_dif, x[_ + 2] - x[_])\n min_index = _ + 1\ndel x[min_index]\nans = 0\nfor i in range(n - 2):\n ans = max(ans, x[i + 1] - x[i])\nprint(ans)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmi=1000000\r\nP=0\r\nfor i in range(n-2) :\r\n if abs(l[i]-l[i+2])<mi :\r\n mi=abs(l[i]-l[i+2])\r\n p=i+1\r\nl[p]=0\r\nma=0\r\nfor i in range(n-1) :\r\n if l[i+1]==0 and l[i]!=0 :\r\n if ma<l[i+2]-l[i] :\r\n ma=l[i+2]-l[i]\r\n if l[i+1]!=0 and l[i]!=0 :\r\n if ma<l[i+1]-l[i] :\r\n ma=l[i+1]-l[i]\r\n \r\n \r\n \r\nprint(ma)\r\n \r\n\r\n \r\n \r\n \r\n", "number = int(input())\r\n\r\nl = list(map(int,input().split(\" \")))\r\np = set()\r\naMax = l[1]-l[0]\r\niMax = 0\r\nfor x in range(number-1):\r\n cMax = l[x+1]-l[x]\r\n if cMax > aMax:\r\n aMax = cMax\r\n iMax = x\r\n p.add(l[x+1]-l[x])\r\nif len(p) != 1: \r\n p.remove(aMax)\r\n sMax = max(p)\r\nelse:\r\n sMax = aMax\r\nq = set()\r\nfor t in range(number-2):\r\n if t != iMax:\r\n q.add(max((l[t+2] - l[t]),aMax))\r\n else:\r\n q.add(max((l[t+2] - l[t]),sMax))\r\n\r\n\r\nprint(min(q))\r\n#len of p will be n-2\r\n\r\n", "def dif(x):\n return max([b-a for b,a in zip(x[1:],x[:-1])])\ndef main(n,a):\n mn = dif(a)*10e10\n for i in range(1,len(a)-1):\n x = dif(a[:i]+a[i+1:])\n if x < mn: mn = x\n #print(i,x,mn)\n print(mn)\n\n\ndef main_input():\n n = int(input())\n a = [int(i) for i in input().split()]\n main(n,a)\n\nif __name__ == \"__main__\":\n main_input()\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nm=[]\r\nfor i in range(1,n):\r\n a.append(l[i]-l[i-1])\r\nfor i in range(1,n-1):\r\n x=max(max(a),a[i]+a[i-1])\r\n m.append(x)\r\nprint(min(m)) \r\n \r\n \r\n\r\n\r\n \r\n \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\nm=[]\r\nfor i in range(1,n-1):\r\n\tp=[]\r\n\ty=l[i]\r\n\tl.pop(i)\r\n\tfor j in range(len(l)-1):\r\n\t\tr=l[j+1]-l[j]\r\n\t\tp.append(r)\r\n\tr=max(p)\r\n\tm.append(r)\r\n\tl.insert(i,y)\r\nq=min(m)\r\nprint(q)", "n = int(input())\r\n\r\nseq = list(map(int, input().split()))\r\n\r\nres = []\r\nfor i in range(1, n-1):\r\n res.append((abs(seq[i]-seq[i-1]), abs(seq[i]-seq[i+1])))\r\n\r\nseq.pop(res.index(min(res)) + 1)\r\n\r\nMAX = 0\r\nfor i in range(1, n-1):\r\n if abs(seq[i] - seq[i-1]) > MAX:\r\n MAX = abs(seq[i] - seq[i-1])\r\n\r\nprint(MAX)\r\n", "# your code goes here\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\ndef find_ans(l):\r\n\tm=0\r\n\tfor i in range(1,len(l)):\r\n\t\td=l[i]-l[i-1]\r\n\t\tm=max(m,d)\r\n\treturn m\r\nt=l\r\nf_ans=100000000000000000000000000000000\r\nfor i in range(1,n-1):\r\n\ttemp=l[0:i]+l[i+1:n]\r\n\tans=find_ans(temp)\r\n\tf_ans=min(f_ans,ans)\r\nprint(f_ans)\t\r\n\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=[]\r\nfor i in range(1,n-1):\r\n\tl=(a[0:i]+a[i+1:n])\r\n\tmax1=0\r\n\tfor j in range(n-2):\r\n\t\tw=l[j+1]-l[j]\r\n\t\tif max1<w:\r\n\t\t\tmax1=w\r\n\tm.append(max1)\r\nprint(min(m))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nidxmin=None\r\nfor i in range(n):\r\n if i<n-2:\r\n nxt=i+1\r\n nnxt=i+2\r\n max_diff=0\r\n lst_new=a[:nxt]+a[nnxt:]\r\n ele=a[nxt]\r\n for j in range(n-2):\r\n diff=lst_new[j+1]-lst_new[j]\r\n \r\n if diff>max_diff:\r\n max_diff=diff\r\n if idxmin is None or max_diff<idxmin:\r\n idxmin=max_diff\r\n \r\n # idxmin.append([max_diff,ele])\r\nprint(idxmin)\r\n \r\n \r\n ", "\"\"\"http://codeforces.com/problemset/problem/496/A\"\"\"\n\ndef solve(n, l):\n difficulties = []\n _max = 0\n for i in range(1, n):\n d = l[i] - l[i - 1]\n difficulties.append(d)\n _max = max(_max, d)\n new_difficult = 1000 * 2\n for i in range(1, len(difficulties)):\n new_difficult = min(new_difficult, difficulties[i] + difficulties[i - 1])\n return max(new_difficult, _max)\n\nif __name__ == '__main__':\n n = int(input())\n l = list(map(int, input().split()))\n print(solve(n, l))\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\n\r\n\r\n# delete at every index except 0 and n-1\r\nmini=float('inf')\r\nfor i in range(1,n-1):\r\n temp=arr.copy()\r\n removed_list=temp[0:i]+temp[i+1:]\r\n \r\n # for adjacnet element difference\r\n maxi=0\r\n for j in range(len(removed_list)-1):\r\n maxi=max(maxi,removed_list[j+1]-removed_list[j])\r\n mini=min(mini,maxi)\r\nprint(mini)\r\n \r\n ", "n = int(input())\r\nls = [int(x) for x in input().split()]\r\nmax_dif = 10**9\r\ntemp_dif = 0\r\nelem_ind = 0\r\nfor ind in range(1,len(ls)-1):\r\n temp_dif = abs(ls[ind-1]- ls[ind]) + abs(ls[ind+1]- ls[ind])\r\n if temp_dif < max_dif:\r\n max_dif = min(temp_dif,max_dif)\r\n elem_ind = ind\r\ndel ls[elem_ind]\r\n#print(ls)\r\nglobal_res = -1\r\nfor ind in range(1,len(ls)):\r\n res = abs(ls[ind] - ls[ind-1])\r\n global_res = max(global_res,res)\r\nprint(global_res)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list()\r\ndiff = 0\r\nfor i in range(1, len(a)-1):\r\n diff = a[i+1] - a[i-1]\r\n b.append(diff)\r\nid = b.index(min(b))\r\na.remove(a[id+1])\r\nd = list()\r\nfor j in range(1, len(a)):\r\n diff = a[j]-a[j-1]\r\n d.append(diff)\r\nprint(max(d))", "n = int(input())\r\na = list(map(int, input(). split()))\r\nsl = []; s2 = []\r\nfor i in range(n - 2):\r\n sl += [a[i + 2] - a[i]]\r\n s2 += [a[i + 1] - a[i]]\r\ns2 += [a[-1] - a[-2]]\r\nprint(max(min(sl), max(s2)))", "holds= int(input())\r\nheights= [int(i) for i in input().split()]\r\nans= 999999999\r\nreal= heights\r\nfor i in range(1, len(heights)-1):\r\n #print(i, heights, real)\r\n app= heights[i]\r\n heights.remove(app)\r\n k= 0\r\n for j in range(len(heights)-1):\r\n k= max(heights[j+1]-heights[j], k)\r\n \r\n ans= min(ans, k)\r\n heights.append(app)\r\n heights= sorted(heights)\r\n \r\nprint(ans)", "import sys\n\nn = int(input())\nan = list(map(int, sys.stdin.readline().split()))\n\nm = an[2] - an[0]\nfor i in range(3, n):\n if an[i] - an[i-2] < m:\n m = an[i] - an[i-2]\n\nans = m\nfor i in range(1, n):\n if an[i] - an[i-1] > ans:\n ans = an[i] - an[i-1]\n\nprint(ans)\n", "n, a = int(input()), list(map(int, input().split()))\r\nans = 20000\r\nfor i in range(1, n - 1):\r\n b = a[:i] + a[i + 1:]\r\n ans = min(ans, max(b[j + 1] - b[j] for j in range(n - 2)))\r\nprint(ans)\r\n", "n = int(input())\r\ndist = [int(x) for x in input().split()]\r\n\r\n_min = dist[-1] - dist[0]\r\nremoved = dist[1]\r\n\r\nfor i in range(n-2):\r\n atual = dist[i+2] - dist[i]\r\n\r\n if atual < _min:\r\n _min = atual\r\n removed = dist[i+1]\r\n\r\ndist.remove(removed)\r\n_max = dist[1] - dist[0]\r\n\r\nfor i in range(n-2):\r\n atual = dist[i+1] - dist[i]\r\n\r\n if _max < atual:\r\n _max = atual \r\n \r\nprint(_max)\r\n", "n = int(input())\nl = list(map(lambda x: int(x), input().split()))\nres = 1000\n\nfor i in range(1, n - 1):\n d = l.pop(i)\n m = 1\n for j in range(0, n - 2):\n m = max(l[j + 1] - l[j], m)\n res = min(res, m)\n l.insert(i, d)\n\nprint(res)\n\n", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nd=[]\r\nfor i in range(len(l)-1):\r\n d.append(l[i+1]-l[i])\r\nma=max(d)\r\ndet=[]\r\nfor i in range(len(d)-1):\r\n det.append(d[i]+d[i+1])\r\nm=min(det)\r\nind=det.index(m)\r\nd[ind]=m\r\nd.remove(d[ind+1])\r\nprint(max(d))\r\n", "n=int(input())\r\nv=[int(i) for i in input().split()]\r\nmx=0\r\nfor i in range(1,len(v)):\r\n mx=max(mx,v[i]-v[i-1])\r\nmn=int(1e9)\r\nfor i in range(1,len(v)-1):\r\n mn=min(mn,max(mx,v[i+1]-v[i-1]))\r\nprint(mn)", "import sys\r\nnu = int(sys.stdin.readline())\r\na=list(map(int,sys.stdin.readline().split()))\r\nr=max(a)\r\nfor j in range(1,nu-1):\r\n x=0\r\n b=a[:]\r\n b.remove(a[j])\r\n for i in range(0,nu-2):\r\n x=max(x,b[i+1]-b[i])\r\n r=min(r,x)\r\n \r\nprint(r)", "n = int(input())\na = list(map(int, input().split()))\ns = list()\nfor i in range(n-1):\n s.append(a[i+1] - a[i])\ndiff = max(s)\nminsum = 10000\nfor i in range(0, len(s)-1):\n if s[i]+s[i+1] < minsum:\n minsum = s[i]+s[i+1]\nif minsum > diff:\n print(minsum)\nelse:\n print(diff)", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nb = []\r\n\r\nd = []\r\n\r\nif(n==3):\r\n\r\n\tprint (abs(a[0]-a[2]))\r\n\r\nelse:\r\n\r\n\tfor i in range(1,n-1):\r\n\r\n\t\tb = a[:i]+a[i+1:]\r\n\r\n\t\tc = [x - b[i - 1] for i, x in enumerate(b)][1:]\r\n\r\n\t\td.append(max(c))\r\n\r\n\tprint (min(d))\r\n \r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(1,n):\r\n d.append(arr[i]-arr[i-1])\r\nout=sum(d)\r\nfor i in range(1,n-1):\r\n out=min(out,d[i]+d[i-1])\r\nprint(max(out,max(d)))", "N = int(input())\r\nA = list(map(int, input().split()))\r\ncur = 0\r\nfor i in range(1, N):\r\n\tcur = max(cur, A[i] - A[i - 1])\r\nans = 1e18\r\nfor i in range(1, N - 1):\r\n\tans = min(ans, max(cur, A[i + 1] - A[i - 1]))\r\nprint(ans)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nans = 10000\r\nnum = 0\r\nfor i in range(0, n - 2):\r\n if (A[i + 2] - A[i] < ans):\r\n ans = A[i + 2] - A[i]\r\n num = i + 1\r\nfor i in range(0, n - 1):\r\n if (i != num and i + 1 != num):\r\n ans = max(ans, A[i + 1] - A[i])\r\nprint(ans)", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nvmax = 0\r\nvmin = 1001\r\nfor i in range(n - 1):\r\n v = an[i + 1] - an[i]\r\n if(vmax < v):\r\n vmax = v\r\n \r\n if(i < n - 2):\r\n t = an[i + 2] - an[i]\r\n if(t < vmin):\r\n vmin = t\r\n \r\nprint(max(vmax, vmin))\r\n\r\n\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nresult_2= []\r\nfor i in range(len(lst)):\r\n lst_2 = []\r\n lst_2.extend(lst)\r\n result_1 = []\r\n if lst[i] != lst[-1] and i != 0:\r\n lst_2.remove(lst[i])\r\n for elem in range(len(lst_2)-1):\r\n result_1.append(lst_2[elem+1]-lst_2[elem])\r\n result_2.append(max(result_1))\r\nprint(min(result_2))\r\n", "input()\r\na=*map(int,input().split()),\r\nprint(max(\r\n max(y-x for x,y in zip(a,a[1:])),\r\n min(z-x for x,_,z in zip(a,a[1:],a[2:])\r\n)))", "def solve(at,n,arr):\r\n ans = float('-inf')\r\n i = 0\r\n while i<n-1:\r\n if i+1==at and i<=n-2:\r\n ans = max(ans, arr[at+1] - arr[i])\r\n i = i + 2 \r\n else:\r\n ans = max(ans, arr[i+1] - arr[i])\r\n i = i + 1 \r\n return (ans) \r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n if n==3:\r\n print(arr[-1] - arr[0])\r\n else:\r\n # n>3\r\n # at will go from 1 till n-2 inclusive\r\n result = float('inf')\r\n for at in range(1,n-1):\r\n result = min(result, solve(at,n,arr))\r\n print(result) \r\n ", "def difficulty(arr):\r\n return max([arr[i + 1] - arr[i] for i in range(len(arr) - 1)])\r\n\r\n\r\nn, a = int(input()), [int(i) for i in input().split()]\r\nprint(min([difficulty(a[:i+1] + a[i+2:]) for i in range(n-2)]))", "def minDiff(array:list) -> int:\r\n if len(array) == 3:\r\n return abs(array[0]-array[-1])\r\n\r\n array.sort()\r\n diffArray = []\r\n for idx in range(len(array)-1):\r\n firstValue = array[idx]\r\n secondValue = array[idx + 1]\r\n difference = abs(firstValue - secondValue)\r\n diffArray.append(difference)\r\n \r\n minDifference = float(\"inf\")\r\n maxValueOfDiffArray = max(diffArray)\r\n for idx in range(len(diffArray)-1):\r\n valueOne =diffArray[idx]\r\n valueTwo = diffArray[idx + 1]\r\n totalValue = valueOne + valueTwo\r\n currentMin = max( totalValue, maxValueOfDiffArray )\r\n minDifference = min(currentMin, minDifference)\r\n\r\n return minDifference\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nprint(minDiff(l))\r\n\r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline().strip())\r\nheight_lst = list(map(int, stdin.readline().split()))\r\ndiff_lst = []\r\nfor i in range(1, n - 1):\r\n popped = height_lst.pop(i)\r\n max_diff = height_lst[1] - height_lst[0]\r\n for j in range(2, n - 1):\r\n max_diff = max(max_diff, height_lst[j] - height_lst[j-1])\r\n diff_lst.append(max_diff)\r\n height_lst.insert(i, popped)\r\nreq_num = min(diff_lst)\r\n\r\nstdout.write(str(req_num))", "def d(L, k) :\r\n res = -1\r\n for i in range(len(L)-1) :\r\n if i != k and i+1 != k :\r\n res = max(res, L[i+1] - L[i])\r\n elif i == k :\r\n res = max(res, L[i+1] - L[i-1])\r\n elif i+1 == k :\r\n res = max(res, L[i+2] - L[i])\r\n\r\n return res\r\n\r\nn = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nans = 10000000\r\nfor i in range(1, n-1) :\r\n ans = min(ans, d(A, i))\r\n\r\nprint(ans) \r\n \r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [0]*(n-1)\r\nfor i in range(n-1):\r\n b[i] = a[i+1] - a[i]\r\nc = [0]*(n-2)\r\nfor i in range(n-2):\r\n c[i] = b[i+1] + b[i]\r\nprint (max (max(b), min(c)))", "import sys\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\ndef difficulty(a):\r\n ma = 0\r\n for i in range(1, len(a)):\r\n if ma < (a[i] - a[i-1]):\r\n ma = a[i] - a[i-1]\r\n return ma\r\n\r\n\r\nmi = sys.maxsize\r\nfor i in range(1, n - 1):\r\n d = a[:i] + a[i + 1:]\r\n t = difficulty(d)\r\n if mi > t:\r\n mi = t\r\n\r\nprint(mi)\r\n\r\n\r\n", "n=int(input(\"\"))\r\nar = list(map(int,input(\"\").split()))\r\n\r\nl=[]\r\nfor i in range(len(ar)-2):\r\n l.append(ar[i+2]-ar[i])\r\n \r\nl1=min(l)\r\n\r\nq=[]\r\nfor i in range(len(ar)-1):\r\n q.append(ar[i+1]-ar[i])\r\nl2=max(q)\r\n\r\nif(l1<=l2):\r\n print(l2)\r\nelse:\r\n print(l1)\r\n\r\n\r\n\r\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\n\r\nminDiff = lis[1] - lis[0]\r\n\r\nflag = 0\r\n\r\norder = 0\r\n\r\nl = len(lis) \r\n\r\nif l == 2:\r\n print(minDiff)\r\nelse:\r\n for i in range(1,l):\r\n if lis[i]-lis[i-1]!=minDiff:\r\n flag = 1\r\n break\r\n \r\n if flag!=1:\r\n print(lis[2]-lis[0])\r\n else:\r\n for i in range(1,l):\r\n if lis[i]-lis[i-1] > minDiff:\r\n order = i-1\r\n minDiff = lis[i]-lis[i-1]\r\n \r\n newDiff = lis[2]-lis[0]\r\n for i in range(0,order-1):\r\n if lis[i+2]-lis[i]<newDiff:\r\n newDiff = lis[i+2]-lis[i]\r\n \r\n for i in range(order+1,l-2):\r\n if lis[i+2]-lis[i]<newDiff:\r\n newDiff = lis[i+2]-lis[i]\r\n \r\n if minDiff>=newDiff:\r\n print(minDiff)\r\n else:\r\n print(newDiff)\r\n ", "t = int(input())\r\n\r\nedges = [int(a) for a in input().split()]\r\necopy = edges.copy()\r\nminimals = []\r\nfor j in edges[1:-1]:\r\n edges.remove(j)\r\n i = 1\r\n minimal = 0\r\n while i < (len(edges)):\r\n if edges[i] - edges[i-1] > minimal:\r\n minimal = edges[i] - edges[i-1]\r\n\r\n i += 1\r\n edges = ecopy.copy()\r\n minimals.append(minimal)\r\n\r\nprint(min(minimals))", "z=int(input());a=list(map(int,input().split()));k=max(a);j=0\r\nfor i in range(z-1):\r\n if i<z-2:k=min(k,a[i+2]-a[i]);\r\n j=max(j,a[i+1]-a[i])\r\nprint(max(j,k))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = 0\r\narray = []\r\nfor i in range(1, n):\r\n\tarray.append(a[i] - a[i - 1])\r\n\td = max(d, a[i] - a[i - 1])\r\nd2 = a[n - 1] - a[0]\r\nfor i in range(1, len(array)):\r\n\td2 = min(d2, array[i] + array[i - 1])\r\nprint(max(d2, d))", "'''input\n5\n1 2 3 7 8\n'''\n\ndef diff(n):\n\n\tdif = 0\n\tfor i in range(len(n)- 1):\n\t\tif dif < n[i+1] - n[i]:\n\t\t\tdif = n[i+1] - n[i]\n\n\treturn dif\n\n\nn = int(input())\nholes = list(map(int, input().split()))\n\ntmp = []\nmin_dif = 9999\nfor i in range(1, len(holes) - 1):\n\tfor j in holes:\n\t\tif holes[i] == j:\n\t\t\tcontinue\n\t\telse:\n\t\t\ttmp.append(j)\n\t# diffs.append(diff(tmp))\n\tk = diff(tmp)\n\tif min_dif > k:\n\t\tmin_dif = k\n\n\ttmp = []\n\nprint(min_dif)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nm=[]\r\nfor i in range(n-1):\r\n m.append(a[i+1]-a[i])\r\nmaxi=max(m)\r\nfor i in range(n-2):\r\n l.append(a[i+2]-a[i])\r\nmini=min(l)\r\nif maxi>mini:\r\n print(maxi)\r\nelse:\r\n print(mini)", "n,s=int(input()),10000\r\nv=list(map(int,input().split()))\r\nfor i in range(1,n-1,1):\r\n w=v[:]\r\n w,m=w[:i]+w[i+1:],0\r\n m=max(w[i+1]-w[i] for i in range(len(w)-1))\r\n s=min(s,m)\r\nprint(s)", "n=int(input());l=list(map(int,input().split()))\r\na=[];b=[]\r\nfor i in range(n-1):a.append(l[i+1]-l[i])\r\nfor i in range(n-2):b.append(l[i+2]-l[i])\r\nprint(max(max(a),min(b)))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = 1001\r\n\r\nfor i in range(1, n-1):\r\n t = l.copy()\r\n t.remove(l[i])\r\n diff = [-1] * n\r\n for j in range(1, n-1):\r\n diff[j] = t[j]-t[j-1]\r\n\r\n m = min(max(diff), m)\r\n\r\n\r\nprint(m)", "def main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n ans = 9999999\r\n for i in range(1,n-1):\r\n t = a[0:i] + a[i+1:n]\r\n k = 0\r\n for j in range(len(t)-1):\r\n k = max(k,t[j+1]-t[j])\r\n ans = min(ans,k)\r\n print(ans)\r\nif __name__=='__main__':\r\n main()\r\n", "n=int(input())\r\na,b,c=[],[],[]\r\nv=list(map(int,input().split()))\r\nfor x in range(0,len(v)-2):\r\n a.append(v[x+2]-v[x])\r\nc.append(min(a)) \r\nfor x in range(n-1):\r\n b.append(v[x+1]-v[x])\r\nprint(max(c+b))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = []\r\nfor i in range(1, n-1):\r\n temp = a[:]\r\n temp.remove(temp[i])\r\n tempD = -1\r\n for x in range(1, len(temp)):\r\n tempD = max(tempD, temp[x]-temp[x-1])\r\n d.append(tempD)\r\nd.sort()\r\nprint(d[0])\r\n", "n=int(input())\r\n\r\nl=input().split()\r\nfor i in range(n):\r\n l[i]=int(l[i])\r\nk=[]\r\nfor i in range(n-1):\r\n k.append(l[i+1]-l[i])\r\nk1=max(k)\r\nm=[]\r\nfor i in range(n-2):\r\n m.append(l[i+2]-l[i])\r\nm1=min(m)\r\nif(m1>k1):\r\n print(m1)\r\nelse:\r\n print(k1)\r\n", "'''input\n5\n1 2 3 7 8\n'''\n\ndef diff(n):\n\n\tdif = 0\n\tfor i in range(len(n)- 1):\n\t\tif dif < n[i+1] - n[i]:\n\t\t\tdif = n[i+1] - n[i]\n\n\treturn dif\n\n\nn = int(input())\nholes = list(map(int, input().split()))\n\ntmp = []\ndiffs = [] \nfor i in range(1, len(holes) - 1):\n\tfor j in holes:\n\t\tif holes[i] == j:\n\t\t\tcontinue\n\t\telse:\n\t\t\ttmp.append(j)\n\tdiffs.append(diff(tmp))\n\n\ttmp = []\n\nprint(min(diffs))\n", "n=int(input())\r\ns=input()\r\nL=s.split()\r\nfor i in range (len(L)):\r\n L[i]=int(L[i])\r\nmin=L[2]-L[0]\r\nminIndex=1\r\nfor i in range(1,len(L)-2):\r\n if L[i+2]-L[i]<min:\r\n min=L[i+2]-L[i]\r\n minIndex=i+1\r\nL.remove(L[minIndex])\r\n\r\nmax=L[1]-L[0]\r\nfor i in range(1,len(L)-1):\r\n if L[i+1]-L[i]>max:\r\n max=L[i+1]-L[i]\r\nprint(max)\r\n", "def findmindiff(lst,ele):\r\n mst=lst.copy()\r\n mst.remove(ele)\r\n\r\n mindiff=0\r\n i=0\r\n if len(mst)==2:\r\n return mst[-1]-mst[0]\r\n else:\r\n while i<len(mst)-1:\r\n if mst[i+1]-mst[i]>mindiff:\r\n mindiff=mst[i+1]-mst[i]\r\n i+=1\r\n else:\r\n i+=1\r\n return mindiff\r\n\r\n\r\n\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\ndiff=[]\r\ni=1\r\nwhile i<len(lst)-1:\r\n diff.append(findmindiff(lst,lst[i]))\r\n i+=1\r\nprint(min(diff))\r\n\r\n\r\n", "a=int(input())\r\nans=0\r\nu=[]\r\nz=[]\r\nl=list(map(int,input().split()))\r\nfor i in range(a-1):\r\n u.append(l[i+1]-l[i])\r\n if i<a-2:\r\n z.append(l[i+2]-l[i])\r\nu.append(min(z))\r\nprint(max(u))\r\n", "n=int(input())\nL=list(map(int,input().split()))\nl=[]\nsolL=[]\nfor i in range(len(L)):\n if i+1==len(L):\n break\n\n \n l.append(L[i+1]-L[i])\nfor i in range(len(l)):\n if i+1==len(l):\n break\n solL.append(l[i]+l[i+1])\n\nif min(solL)>max(l):\n print(min(solL))\nelse:\n print(max(l))\n\n\t\t\t \t \t \t \t\t\t\t \t\t\t \t \t\t\t\t\t", "def maxdist(l):\r\n n=len(l) \r\n return max(l[i]-l[i-1] for i in range(1,n))\r\nn=int(input())\r\nans=10000000000\r\nl=[int(i) for i in input().split()]\r\nfor i in range(1,n-1):\r\n curr=maxdist(l[0:i]+l[i+1:])\r\n ans=min(ans,curr)\r\nprint(ans)", "n=input()\r\nm=list(map(int,input().split()))\r\ndef findMax(a,size):\r\n max=0\r\n for i in range(0,size-1):\r\n if (a[i+1]-a[i])>max:\r\n max=a[i+1]-a[i]\r\n return max \r\nans=1000\r\nfor i in range(1,len(m)-1):\r\n temp=m[i];\r\n m.pop(i)\r\n val=findMax(m,len(m))\r\n if val<ans:\r\n ans=val\r\n m.insert(i,temp)\r\nprint(ans)\r\n ", "from collections import Counter\r\nfrom collections import Counter\r\n\r\ndef calcMax(array,n):\r\n Max=0\r\n for i in range(n-1):\r\n Max=max(Max,array[i+1]-array[i])\r\n\r\n return Max\r\n\r\ndef solve():\r\n n=int(input())\r\n array=[int(i) for i in input().split()]\r\n Min=1000\r\n for i in range(1,n-1):\r\n Min=min(Min,calcMax(array[:i]+array[i+1:],n-1))\r\n\r\n return Min\r\n\r\nprint(solve()) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n-2):\r\n\ta=1\r\n\tfor j in range(n-2):\r\n\t\tif(j==i):\r\n\t\t\tif ( l[j+2]-l[j] > a ):\r\n\t\t\t\ta=l[j+2]-l[j]\r\n\t\telif(j>i):\r\n\t\t\tif(l[j+2]-l[j+1]>a):\r\n\t\t\t\ta=l[j+2]-l[j+1]\r\n\t\telse:\r\n\t\t\tif(l[j+1]-l[j]> a):\r\n\t\t\t\ta=l[j+1]-l[j]\r\n\r\n\r\n\ts.append(a)\r\n\r\nprint(min(s))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = []\r\nfor x in range(n-2):\r\n li = [l[0]] + [y for i,y in enumerate(l) if i not in (0,n-1,x+1)]+ l[-1:] \r\n m.append(max(li[_+1]-li[_] for _ in range(n-2)))\r\nprint (min(m))\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\ni=0\r\nk=1\r\nj=2\r\nmini=L[j]-L[i]\r\nwhile(j<n):\r\n if(L[j]-L[i]<mini):\r\n mini=L[j]-L[i]\r\n k=(i+j)//2\r\n i+=1\r\n j+=1\r\nL=L[:k]+L[k+1:]\r\ni=0\r\nj=1\r\nans=0\r\nwhile(j<(n-1)):\r\n ans=max(ans,L[j]-L[i])\r\n j+=1\r\n i+=1\r\nprint(ans)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\n\r\nbest = 0\r\n\r\nfor i in range(n-1):\r\n if a[i+1]-a[i] > best:\r\n best = a[i+1]-a[i]\r\n\r\nbest2 = a[-1]-a[0]\r\nfor i in range(n-2):\r\n if a[i+2]-a[i] < best2:\r\n best2 = a[i+2]-a[i]\r\n \r\nprint(max(best,best2))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nc = 0\r\n\r\nfor i in range(1, n):\r\n c = max(c, a[i] - a[i-1])\r\n\r\nd = 1001\r\n\r\nfor i in range(1, n - 1):\r\n d = min(d, max(c, a[i + 1] - a[i - 1]))\r\n\r\nprint(d)\r\n\r\n\r\n" ]

[ "#----------------------------\n# Matheus de Souza Oliveira |\n# RA: 203407 |\n#----------------------------\n\nn, m = list(map(int, input().split()))\n\nfor index in range(0, n):\n\n factor = m+index%m\n isFactorEven = not(bool(factor%2))\n\n if isFactorEven:\n result = int((m-(index%m))/2)\n print(result)\n else: \n result = int((factor+1)/2)\n print(result)\n\t\t \t \t \t \t \t \t \t\t\t \t \t\t\t\t", "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,b = M()\r\n\r\nj = b//2\r\ni = j\r\nif b%2==0:\r\n j+=1\r\nelse:\r\n i+=1\r\n j+=1\r\n\r\nwhile n>0:\r\n if b%2==0:\r\n if i==0 and j==b+1:\r\n i = b//2\r\n j = i+1\r\n \r\n print(i)\r\n n-=1\r\n i-=1\r\n if n>0:\r\n print(j)\r\n n-=1\r\n j+=1\r\n \r\n \r\n else:\r\n if i==0 and j==b+1:\r\n j = b//2 +1\r\n i = j \r\n \r\n if i==j:\r\n print(i)\r\n i-=1\r\n j+=1\r\n n-=1\r\n continue\r\n \r\n print(i)\r\n n-=1\r\n i-=1\r\n if n>0:\r\n print(j)\r\n n-=1\r\n j+=1\r\n ", "n,m=map(int,input().split())\r\nif m==1:\r\n for i in range(n):\r\n print(1)\r\nelse:\r\n i=m//2 if m%2==0 else m//2+1\r\n j=i+1\r\n start=1\r\n flag=False\r\n first=True\r\n while start<=n:\r\n if first and m%2:\r\n print(i)\r\n i-=1\r\n first=False\r\n start+=1\r\n elif flag:\r\n print(j)\r\n j+=1\r\n flag=False\r\n start+=1\r\n elif i==0:\r\n i=m//2 if m%2==0 else m//2+1\r\n first=True\r\n elif j>m:\r\n mid=m//2 if m%2==0 else m//2+1\r\n j=mid+1\r\n elif flag==False:\r\n print(i)\r\n i-=1\r\n flag=True\r\n start+=1\r\n ", "n,m=list(map(int,input().split(\" \")))\r\n\r\nif m%2!=0:\r\n mid=int((m+1)/2)\r\n i = mid\r\n j = mid\r\n\r\n\r\n\r\nelse:\r\n\r\n mid=int((m/2))\r\n i = mid\r\n j = mid+1\r\n\r\n\r\ndetector=1\r\nif m==1:\r\n for x in range(n):\r\n print(1)\r\nelse:\r\n for _ in range(n):\r\n if i==j:\r\n print(mid)\r\n i-=1\r\n j+=1\r\n detector=1\r\n continue\r\n if m%2!=0 :\r\n if detector == -1:\r\n print(j)\r\n j+=1\r\n if j==m+1:\r\n j=mid\r\n detector *= -1\r\n elif detector == 1:\r\n print(i)\r\n i-=1\r\n if i==0:\r\n i=mid\r\n detector *=-1\r\n\r\n elif m%2==0:\r\n if detector == 1:\r\n print(i)\r\n i -= 1\r\n if i == 0:\r\n i = mid\r\n detector *= -1\r\n elif detector == -1:\r\n print(j)\r\n\r\n j += 1\r\n if j == m+1:\r\n j = mid+1\r\n detector *= -1\r\n\r\n\r\n", "n, m = map(int, input().split())\n# i%m vai de 0 ate m-1\nfor i in range(n):\n if (m+i%m)%2 > 0:\n # pega o valor medio, valores entre (m+1)/2 até m\n print(str(int((m+i%m+1)/2)))\n else:\n # Pega o valor médio que seja menor ou igual a metade de m.\n # Portanto valores entre 1 até m/2\n print(str(int((m-(i%m))/2)))\n \t\t \t\t\t\t\t \t\t\t\t \t \t \t", "n,m=map(int,input().split())\r\nif(m%2==0):\r\n dis=0\r\n while(n>0):\r\n if(dis==0):\r\n print((m+1)//2)\r\n dis+=1\r\n n-=1\r\n elif dis==(m+1)//2:\r\n print((m+1)//2+dis)\r\n n-=1\r\n dis=0\r\n else:\r\n print((m+1)//2+dis)\r\n n-=1\r\n if(n>0):\r\n print((m+1)//2-dis)\r\n n-=1\r\n dis+=1\r\n\r\nelse:\r\n dis=0\r\n while(n>0):\r\n if(dis==0):\r\n print((m+1)//2)\r\n dis+=1\r\n n-=1\r\n elif dis==(m+1)//2:\r\n dis=0\r\n else:\r\n print((m+1)//2-dis)\r\n n-=1\r\n if(n>0):\r\n print((m+1)//2+dis)\r\n n-=1\r\n dis+=1\r\n", "n,m=map(int,input().split())\r\nif m%2!=0:\r\n mid=(m+1)//2\r\nelse:\r\n mid=m//2\r\nx=mid\r\nleft=[]\r\nright=[]\r\nif m%2!=0:\r\n len1 = 1\r\n len2 = 0\r\n pattern = [mid]\r\n for i in range(mid+1,m+1):\r\n left.append(i)\r\n for i in range(1,mid):\r\n right.append(i)\r\n for i in range(n - 1):\r\n if len1 <= len(left) and len2 <= len(right) - 1:\r\n pattern.append(right[-len1])\r\n pattern.append(left[len2])\r\n len1 = len1 + 1\r\n len2 = len2 + 1\r\n else:\r\n pattern.append(mid)\r\n len1 = 1\r\n len2 = 0\r\n for i in range(1, n + 1):\r\n print(pattern[i - 1])\r\nelse:\r\n len1=1\r\n len2=0\r\n mid1 = mid + 1\r\n pattern2=[]\r\n pattern2.append(mid)\r\n pattern2.append(mid1)\r\n for i in range(mid1+1,m+1):\r\n left.append(i)\r\n for i in range(1,mid):\r\n right.append(i)\r\n for i in range(n - 1):\r\n if len1 <= len(left) and len2 <= len(right) - 1:\r\n pattern2.append(right[-len1])\r\n pattern2.append(left[len2])\r\n len1 = len1 + 1\r\n len2 = len2 + 1\r\n else:\r\n pattern2.append(mid)\r\n pattern2.append(mid1)\r\n len1 = 1\r\n len2 = 0\r\n for i in range(1, n + 1):\r\n print(pattern2[i - 1])", "import math\r\nn,m=map(int,input().split())\r\nmiddle=math.ceil(m/2)\r\nt=0\r\nif m%2:\r\n c=0\r\nelse:\r\n c=1\r\nfor i in range(n):\r\n if m%2:\r\n k=middle+t\r\n else:\r\n k=middle-t\r\n if (k)==0:\r\n t=0\r\n k=middle-t\r\n print(k)\r\n if t<0:\r\n t*=-1\r\n t=t%(middle+c)\r\n else:\r\n if t==0:\r\n t=-(abs(t-1)%(middle+c))\r\n else:\r\n t+=1\r\n t=t%(middle+c)\r\n t*=-1", "from math import lcm\r\n# from queue import Queue\r\n# from collections import deque\r\n# from collections import Counter\r\n# n,k,m=map(int,input().split())\r\nn,m=map(int,input().split())\r\nl=[]\r\nif m%2!=0:\r\n l.append((m+1)//2)\r\n i=(m+1)//2 -1\r\n j=(m+1)//2 +1\r\nelse:\r\n i=m//2\r\n j=m//2 +1\r\nwhile i>0 and j<m+1:\r\n l.append(i)\r\n l.append(j)\r\n i-=1\r\n j+=1\r\n# print(l)\r\nfor k in range(n):\r\n print(l[k%m])\r\n\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 = map(int, input().split())\r\nA = [m-2*i for i in range(1,1+m//2)] + [2*i-1-m%2 for i in range(1,(m+3)//2)]\r\nd = {a:i for i,a in enumerate(A,1)}\r\n\r\nprint(*(d[i%m] for i in range(n)), sep='\\n')", "n,m=list(map(int,input().split()))\r\nl=[0]*(n+1)\r\nb=[0]*(m+1)\r\nm1=(m+1)//2\r\nif m%2==1:\r\n \r\n for i in range(1,n+1):\r\n if i<=m:\r\n if i%2==1:\r\n l[i]=m1+i//2\r\n else:\r\n l[i]=m1-i//2\r\n else:\r\n l[i]=l[i-m]\r\nif m%2==0:\r\n for i in range(1,n+1):\r\n if i<=m:\r\n if i%2==1:\r\n l[i]=m1-i//2\r\n else:\r\n l[i]=m1+i//2\r\n else:\r\n l[i]=l[i-m]\r\n \r\n \r\nfor i in range(1,n+1):\r\n print(l[i])", "n, m = map(int, input().split())\r\np = [0] * (n + 1)\r\nt = [0] + [[j + i for i in range(0, n - j + 1, m)] for j in range(m - 1, m % 2, - 2)] + [[j + i for i in range(0, n - j + 1, m)] for j in range(2 - m % 2, m + 1, 2)]\r\nfor j in range(1, m + 1):\r\n for i in t[j]:\r\n p[i] = str(j)\r\nprint('\\n'.join(p[1: ]))", "n,m=[int(x) for x in input().split()]\r\nl=[i+1 for i in range(m)]\r\nh=[]\r\nwhile len(l)>0:\r\n c=len(l)\r\n if c%2==1:\r\n h.append(l.pop(c//2))\r\n else:\r\n h.append(l.pop(c//2-1))\r\nfor i in range(n):\r\n print(h[i%m])", "n, m = map(int, input().split())\ncenter = (m+1)//2\npos = center\nfor i in range(n):\n\tprint(pos)\n\tif pos == center and m%2 == 1:\n\t\tpos -= 1\n\telif pos <= center:\n\t\tpos = m-pos+1\n\telse:\n\t\tpos = m-pos\n\tif pos == 0:\n\t\tpos = center\n", "def func(i):\n return abs((m+1)/2-i)\n\na = input()\n[n, m] = a.split(' ')\n[n, m] = [int(n), int(m)];\na = [i for i in range(1, m+1)]\na.sort(key=func)\ni = 0;\nwhile(i<n):\n print(a[i%m])\n i+=1;\n# print(a)\n", "n,m=map(int,input().split())\r\nlow=1\r\nhigh=m\r\n\r\n\r\nif(m%2==0):\r\n \r\n m1=m//2\r\n m2=(m//2)+1\r\n ans=[]\r\n for i in range(m//2):\r\n ans.append(m1-i)\r\n ans.append(m2+i)\r\n for i in range(n):\r\n print(ans[i%m])\r\n exit()\r\nelse:\r\n ans=[(m//2)+1,(m//2),(m//2)+2]\r\n m1=ans[1]\r\n m2=ans[2]\r\n for i in range((m-3)//2):\r\n ans.append(m1-i-1)\r\n ans.append(m2+i+1)\r\n for i in range(n):\r\n print(ans[i%m])\r\n \r\n\r\n \r\n \r\n", "data = input().split(\" \")\nbal, bas = map(int,data)\n\nfor i in range(bal):\n if (bas+i%bas)%2 == 0:\n print(int((bas-(i%bas))/2))\n \n\n else:\n print(int((bas+i%bas+1)/2))\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\nt1=[[abs((m+1)/2-(k+1)),k+1] for k in range(m)]\r\nt1.sort()\r\nfor i in range(n):\r\n ind=i%m\r\n print(t1[ind][1])", "\n\nn, m = map(int, input().split())\n\ntab = [0] * n\n\ni = 1\n\nif m % 2 == 0:\n pos = m // 2\n while i <= n:\n tab[i - 1] = pos\n if pos == m:\n pos = m // 2\n elif pos <= m // 2:\n pos = m // 2 + 1 + (m // 2 - pos)\n else:\n pos = m // 2 - (pos - (m // 2 + 1)) - 1\n i += 1\nelse:\n pos = (m + 1) // 2\n while i <= n:\n tab[i - 1] = pos\n if pos == m:\n pos = (m + 1) // 2\n elif pos < (m + 1) // 2:\n pos = (m + 1) // 2 + ((m + 1) // 2 - pos)\n else:\n pos = (m + 1) // 2 - (pos - (m + 1) // 2) - 1\n i += 1\n\nprint('\\n'.join(map(str, tab)))\n", "n, m = map(int, input().split())\ncenter = (m+1)//2\nresult = []\npos = center\nfor i in range(n):\n\tresult.append(pos)\n\tif pos == center and m%2 == 1:\n\t\tpos -= 1\n\telif pos <= center:\n\t\tpos = m-pos+1\n\telse:\n\t\tpos = m-pos\n\tif pos == 0:\n\t\tpos = center\nprint('\\n'.join(list(map(str, result))))\n", "from math import ceil as ceil\r\nn,m = (int(x) for x in input().split())\r\nl = []\r\ni0 = ceil(m/2)\r\n\r\nif m%2 == 0:\r\n k = 1\r\nelse:\r\n k = -1\r\n \r\nfor i in range(1,m+1):\r\n l.append(i0)\r\n i0 = i0 + i*k\r\n k = k * (-1)\r\nl = l * ceil(n/m)\r\nl = l[:n]\r\nfor x in l:\r\n print(x)\r\n ", "def middle(m,i):\n return int(abs((m+1)/2-i))\n\nn, m = map(int, input().split())\n\nif(m==1):\n for i in range(n):\n print(1)\nelif(m%2==1):\n v = []\n med = middle(m,0)\n v.append(med)\n k = med-1\n med+=1\n for i in range(int((m+1)/2)):\n v.append(k)\n v.append(med)\n k-=1\n med+=1\n for j in range(n):\n print(v[j%m]) \nelse:\n v = []\n med = middle(m,0)\n k = med\n med+=1\n for i in range(int((m+1)/2)):\n v.append(k)\n v.append(med)\n k-=1\n med+=1\n for j in range(n):\n print(v[j%m]) \n \t\t \t \t\t\t \t\t\t \t\t \t\t\t\t \t \t", "import math\ndef after_training():\n line = input().split()\n n,m = int(line[0]), int(line[1])\n vezes=[i+1 for i in range(m)]\n if(m==1):\n for _ in range(n):\n print('1')\n else:\n middle = (m+1)/2\n vez=[i+1 for i in range(m)]\n order = []\n for _ in range(n):\n choosen = 0\n tamanho = len(vez)\n if(tamanho>1):\n if(tamanho%2==0):\n choosen=vez.pop(math.floor(tamanho/2)-1)\n else:\n choosen=vez.pop(math.floor(tamanho/2))\n else:\n choosen = vez.pop(0)\n print(choosen)\n if(len(vez)==0):\n vez=vezes.copy()\n\nafter_training()\n \t\t \t \t \t \t \t \t \t \t \t\t\t \t", "from sys import stdin,stdout\r\n\r\nn,m=map(int,stdin.readline().split())\r\n#print(n,m)\r\nli=[]\r\nj=(m+1)//2 \r\nk=j \r\nif m%2==0:\r\n li.append(j)\r\n j-=1 \r\n k+=1 \r\n li.append(k)\r\n k+=1 \r\n i=2\r\nelse:\r\n li.append(j)\r\n j-=1 \r\n k+=1 \r\n i=1 \r\nfor _ in range(i,m,2):\r\n li.append(j)\r\n j-=1 \r\n li.append(k)\r\n k+=1 \r\nli2=[]\r\nj=0\r\nfor i in range(0,n):\r\n if j==m:\r\n j=0\r\n li2.append(li[j])\r\n j+=1 \r\n#print(' '.join(li))\r\nfor i in range(n):\r\n print(li2[i])\r\n ", "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 = []\r\nif m % 2:\r\n x.append(m // 2 + 1)\r\nfor i in range(m // 2, 0, -1):\r\n x.append(i)\r\n x.append(m - i + 1)\r\nans = [x[i % m] for i in range(n)]\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))", "n,m=[int(x) for x in input().split()]\r\narr=list()\r\nfor i in range(1,m+1):\r\n lol=abs(((m+1)/2)-i)\r\n arr.append((lol,i))\r\narr=sorted(arr)\r\nif m>=n:\r\n for i in range(n):\r\n print(arr[i][1])\r\nelse:\r\n for i in range(0,n,m):\r\n j=0\r\n if i+m>=n:lol=n-i\r\n else:lol=m\r\n while j<lol:\r\n print(arr[j][1])\r\n j+=1\r\n", "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\nimport math\r\nn,m = rinput()\r\nif m % 2 != 0:\r\n start = (m + 1) // 2\r\n ans = [start]\r\n for i in range(1,start):\r\n ans.extend([start-i,start+i])\r\n i = j= 0\r\n while i < n:\r\n print(ans[j])\r\n j = (j+1)%(len(ans))\r\n i += 1\r\nelse:\r\n start = (m+1)/2\r\n lower = math.floor(start)\r\n upper = math.ceil(start)\r\n ans = [lower,upper]\r\n for i in range(1,lower):\r\n ans.extend([lower-i,upper+i])\r\n i = j= 0\r\n while i < n:\r\n print(ans[j])\r\n j = (j+1)%(len(ans))\r\n i += 1\r\n \r\n", "n, m = map(int, input().split())\r\nfilling_order = []\r\nif m % 2 == 0:\r\n z = 1\r\n k = 0\r\n temp = int(m/2)\r\n while True:\r\n filling_order.append(temp)\r\n if temp == m:\r\n break\r\n temp += ((-1)**k)*z\r\n z += 1\r\n k += 1\r\nelse:\r\n z = 1\r\n k = 1\r\n temp = int((m+1)/2)\r\n while True:\r\n filling_order.append(temp)\r\n if temp == m:\r\n break\r\n temp += ((-1)**k)*z\r\n k += 1\r\n z += 1\r\nj = 0\r\nwhile n:\r\n print(filling_order[j % m])\r\n j += 1\r\n n -= 1\r\n", "n,m=map(int,input().split())\r\nr,o=n,m\r\nq=(m+1)//2\r\nw=q+1\r\nt,l=1,[]\r\nif m%2:l+=[q];q-=1;m-=1\r\nfor i in range(m):\r\n\tif t:\r\n\t\tl+=[q]\r\n\t\tq-=1\r\n\telse:\r\n\t\tl+=[w]\r\n\t\tw+=1\r\n\tt=1-t\r\n\tn-=1\r\ni=0\r\nwhile r:\r\n print(l[i%o])\r\n i+=1\r\n r-=1", "n, m = [int(i) for i in input().split()]\r\nif m == 1:\r\n print(\"1\\n\" * n)\r\n exit()\r\nit1 = m // 2\r\nit2 = m // 2 + 1\r\na = [-1] * n\r\ni = 0\r\nwhile i < n:\r\n if it1 < 1:\r\n it1 = m // 2\r\n if it2 > m:\r\n it2 = m // 2 + 1\r\n if m % 2 == 1 and it2 == m // 2 + 1:\r\n a[i] = it2\r\n it2 += 1\r\n i += 1\r\n if i < n:\r\n a[i] = it1\r\n it1 -= 1\r\n i += 1\r\n if i < n:\r\n a[i] = it2\r\n it2 += 1\r\n i += 1\r\nprint(\"\\n\".join([str(i) for i in a]))", "from sys import exit\r\nn,m=map(int,input().split())\r\nmid=(m+1)/2;st=list();\r\nif(m==1):\r\n for i in range(n):\r\n print(1)\r\n exit(0)\r\nif(m%2==0):\r\n i=int(m/2);k=0;\r\n while(i<m and i>=0):\r\n if(k%2==0):\r\n i-=k\r\n else:\r\n i+=k\r\n #print(i)\r\n st.append(i)\r\n k+=1\r\nelse:\r\n i=int(m/2)+1;k=0;\r\n while(i<m and i>=0):\r\n if(k%2==0):\r\n i+=k\r\n else:\r\n i-=k\r\n st.append(i)\r\n k+=1\r\nnum=int(n/m)\r\next=n%m\r\nst=st*num+st[:ext:]\r\nprint(*st,sep='\\n')\r\n", "n, m = map(int, input().split())\r\nl = [i for i in range(1, m+1)]\r\na = []\r\ni = 0\r\nb = m\r\nwhile(m):\r\n a.append(l[-i-1])\r\n m -= 1\r\n if m:\r\n a.append(l[i])\r\n m -= 1\r\n i += 1\r\na = a[::-1]\r\ni = 0\r\nwhile(n-i):\r\n print(a[i%b])\r\n i += 1", "from sys import stdin, stdout, setrecursionlimit\r\nfrom collections import deque\r\n\r\n# tail-recursion optimization\r\n# In case of tail-recusion optimized code, have to use python compiler.\r\n# Otherwise, memory limit may exceed.\r\n# declare the class Tail_Recursion_Optimization\r\nclass Tail_Recursion_Optimization:\r\n def __init__(self, RECURSION_LIMIT, STACK_SIZE):\r\n setrecursionlimit(RECURSION_LIMIT)\r\n threading.stack_size(STACK_SIZE)\r\n return None\r\n \r\nclass SOLVE:\r\n def solve(self):\r\n R = stdin.readline\r\n #f = open('input.txt');R = f.readline\r\n W = stdout.write\r\n \r\n ans = []\r\n \r\n n, m = [int(x) for x in R().split()]\r\n \r\n a = (m+1) // 2\r\n b = a + (-1 if m%2 else 1)\r\n \r\n boxes = deque()\r\n while 1 <= a <= m and 1 <= b <= m:\r\n boxes.append(str(a))\r\n boxes.append(str(b))\r\n \r\n a += ( 1 if m%2 else -1)\r\n b += (-1 if m%2 else 1)\r\n if m%2:\r\n boxes.append(str(m))\r\n \r\n for i in range(1, n+1):\r\n current_box = boxes.popleft()\r\n ans.append(current_box)\r\n boxes.append(current_box)\r\n \r\n W('\\n'.join(ans))\r\n return 0\r\n \r\ndef main():\r\n s = SOLVE()\r\n s.solve()\r\n#Tail_Recursion_Optimization(10**7, 100*1024**2) # recursion-call size, stack-size in byte (MB*1024**2)\r\n#threading.Thread(target=main).start()\r\nmain()", "n,m=map(int,input().split())\r\nl=[]\r\nif(m%2):\r\n l.append((m+1)//2)\r\n i=(m+1)//2 - 1\r\n j=(m+1)//2 + 1\r\nelse:\r\n l.append((m+1)//2)\r\n l.append((m+1)//2 + 1)\r\n i=(m+1)//2 -1 \r\n j=(m+1)//2 +2\r\nwhile(i>=1 or j<=m):\r\n if(i>=1):\r\n l.append(i)\r\n i-=1\r\n if(j<=m):\r\n l.append(j)\r\n j+=1\r\ni=0\r\nfor _ in range(n):\r\n if(i>=len(l)):\r\n i=0\r\n print(l[i])\r\n i+=1\r\n \r\n \r\n ", "n, m = map(int, input().split())\nbasket = m * [0]\nptr = m // 2\nfor i in range(m):\n basket[ptr] = (i + 1) % m\n if i % 2 == 0:\n ptr -= (i + 1)\n else:\n ptr += (i + 1)\nif m % 2 == 0:\n basket = basket[::-1]\ndata = {}\nfor j in range(m):\n for k in range(basket[j], 10 ** 5 + 1, m):\n if k <= n:\n data[k] = j + 1\n else:\n break\ndata.pop(0)\nfor ball in range(1, n + 1):\n print(data[ball])\n", "n, m = map(int, input().split())\r\na = []\r\nt = 1 if m % 2 else -1\r\nfor i in range(m):\r\n\ta.append(int(m/2)+int(m%2)+t*int((i+1)/2))\r\n\tt *= -1\r\nfor i in range(n):\r\n\tprint(a[int(i%m)])", "from sys import *\r\ninput = stdin.readline\r\nn, m = map(int, input().split())\r\nrishabh = (m + 1) // 2\r\nans = []\r\nsmh = rishabh\r\nfor kk in range(n):\r\n ans.append(smh)\r\n if smh == rishabh and m%2 == 1:\r\n smh -= 1\r\n elif smh <= rishabh:\r\n smh = m - smh + 1\r\n else:\r\n smh = m - smh\r\n if smh == 0:\r\n smh = rishabh\r\nfor kkk in ans:\r\n print(kkk)", "n, m = map(int, input().split())\n\nif m%2 != 0:\n pos = 'middle'\n pos_val = int(m/2+1)\n k = 0\n i = 0\n\n while i < n:\n if pos == 'middle':\n pos = 'left'\n k += 1\n print(pos_val)\n elif pos == 'left':\n pos_val -= k\n\n if pos_val < 1:\n pos = 'middle'\n pos_val = int(m/2+1)\n k = 0\n continue\n\n pos = 'right'\n k += 1\n print(pos_val)\n elif pos == 'right':\n pos_val += k\n\n if pos_val > m:\n pos = 'middle'\n pos_val = int(m/2+1)\n k = 0\n continue\n\n pos = 'left'\n k += 1\n print(pos_val)\n\n i += 1\nelse:\n pos = 'left'\n pos_val = int(m/2)\n k = 0\n i = 0\n while i < n:\n if pos == 'left':\n pos_val -= k\n\n if pos_val < 1:\n pos = 'left'\n pos_val = int(m/2)\n k = 0\n continue\n\n pos = 'right'\n k += 1\n print(pos_val)\n elif pos == 'right':\n pos_val += k\n\n if pos_val > m:\n pos = 'left'\n pos_val = int(m/2)\n k = 0\n continue\n \n pos = 'left'\n k += 1\n print(pos_val)\n\n i += 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())\r\nl=[]\r\nif m%2==1:\r\n count=m//2+1\r\n l.append(m//2+1)\r\n for i in range(1,m//2+1):\r\n l.append(count-i);l.append(count+i)\r\nelse:\r\n count=m//2\r\n l.append(m//2);l.append(m//2+1)\r\n for i in range(1,m//2):\r\n l.append(count-i);l.append(count+1+i)\r\n\r\ni=0\r\nwhile i<n:\r\n print(l[i%m])\r\n i+=1\r\n ", "n, m = map(int, input().split())\r\nif n == 1:\r\n print((m+1)//2)\r\nelse:\r\n c = []\r\n j = 0\r\n res = []\r\n if m%2==0:\r\n l = (m+1)//2\r\n r = l+1\r\n else:\r\n c.append((m+1)//2)\r\n l = (m+1)//2-1\r\n r = (m+1)//2+1\r\n for i in range(m//2):\r\n c.append(l-i)\r\n c.append(r+i)\r\n for i in range(n//m):\r\n res+=c\r\n res+=c[:n%m]\r\n for i in res:\r\n print(i)\r\n", "n, m = map(int,input().split())\r\nif n == 1:\r\n print((m+1)//2)\r\nelse:\r\n c = []\r\n j = 0\r\n ans = []\r\n if m%2==0:\r\n l = (m+1)//2\r\n r = l+1\r\n else:\r\n c.append((m+1)//2)\r\n l = (m+1)//2-1\r\n r = (m+1)//2+1\r\n for i in range(m//2):\r\n c.append(l-i)\r\n c.append(r+i)\r\n for i in range(n//m):\r\n ans+=c\r\n ans+=c[:n%m]\r\n for i in ans:\r\n print(i)", "n, m = map(int, input().split())\r\na = [str((m+1)//2 + (1 - 2*((m+i%m-1)%2))*(((i%m)+1)//2)) for i in range(n)]\r\nprint(\"\\n\".join(a))", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int, input().split()))\r\nfor _ in range(1):#nmbr():\r\n n,k=lst()\r\n ans=[(1+k)//2]\r\n ln=1;val=1\r\n while ln<k:\r\n ans+=[(1+k)//2-(val if k&1 else -val)]\r\n ln+=1\r\n if ln==k:break\r\n ans+=[(1+k)//2+(val if k&1 else -val)]\r\n val+=1\r\n ln+=1\r\n if ln==k:break\r\n for i in range(n):\r\n print(ans[i%k])", "n, m = map(int, input().split())\r\nk = (m + 1) // 2\r\nt = [k] * m\r\nd = m % 2\r\nfor i, j in enumerate(range(1 + d, m, 2), 1):\r\n t[j] += i\r\nfor i, j in enumerate(range(2 - d, m, 2), 1):\r\n t[j] -= i\r\nt = (((n - 1) // m + 1) * t)[: n]\r\nprint('\\n'.join(map(str, t)))", "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, m = get_ints_in_variables()\r\n basket = []\r\n val = (m+1)//2\r\n for _ in range(1, m+1):\r\n basket.append(0)\r\n \r\n \r\n for i in range(0, m):\r\n # if m is odd\r\n if (m%2) != 0:\r\n if (i%2) == 0:\r\n val += i\r\n basket[i] = val\r\n else:\r\n val -= i\r\n basket[i] = val\r\n else: # if m is even\r\n if (i%2) != 0:\r\n val += i\r\n basket[i] = val\r\n else:\r\n val -= i\r\n basket[i] = val\r\n \r\n for i in range(0, n):\r\n print(basket[i%m])\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "import heapq\r\nn,m=map(int, input().split())\r\nl=[]\r\nfor i in range(1,m+1):\r\n capacity=0\r\n if m%2!=0:\r\n pref1=abs((m+1)//2-i)\r\n pref2=0\r\n pref3=i\r\n l.append((capacity,pref1,pref2,pref3))\r\n else:\r\n pref1=abs((m//2)-i)\r\n pref2=abs(m//2+1-i)\r\n pref3=i\r\n l.append((capacity,pref1,pref2,pref3))\r\nheapq.heapify(l)\r\nfor i in range(n):\r\n c,p1,p2,p3=heapq.heappop(l)\r\n print(p3)\r\n c+=1\r\n heapq.heappush(l,(c,p1,p2,p3))\r\n", "n,m=map(int,input().split())\r\nans=[]\r\nif(m%2):\r\n ans.append((m+1)//2)\r\n for i in range(1,(m+1)//2):\r\n ans.append((m+1)//2-i)\r\n ans.append((m+1)//2+i)\r\n\r\nelse:\r\n ans.append((m+1)//2)\r\n ans.append((m+1)//2+1)\r\n for i in range(2,m):\r\n if(i%2==0):\r\n ans.append(ans[i-2]-1)\r\n else:\r\n ans.append(ans[i-2]+1)\r\n \r\n\r\nfor i in range(n):\r\n print(ans[i%m])", "n, m = map(int, input().split())\r\nEven = False\r\nif m%2 == 0:\r\n mid = m//2\r\n Even = True\r\nelse:\r\n mid = (m+1)//2\r\n \r\nwhile(n > 0):\r\n for i in range(1, min(m+1, n+1)):\r\n if i == 1:\r\n print(mid)\r\n elif Even:\r\n if i%2 == 0:\r\n print(mid+i//2)\r\n else:\r\n print(mid-(i-1)//2)\r\n else:\r\n if i%2 == 0:\r\n print(mid-(i//2))\r\n else:\r\n print(mid+(i-1)//2)\r\n \r\n n = n-m", "# -*- coding: utf-8 -*-\n\nif __name__ == '__main__':\n input = input().split(' ')\n n = int(input[0])\n m = int(input[1])\n\n for i in range(n):\n if (m + (i % m)) % 2:\n print(int((m + 1 + (i % m)) / 2))\n else:\n print(int((m - (i % m)) / 2))\n\n\t\t \t \t\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\nx,y = (m+1)//2,[]\r\np = x\r\nfor i in range(n):\r\n y.append(p)\r\n if p == x and m%2 == 1:\r\n p -= 1\r\n elif p <= x:\r\n p = m-p+1\r\n else:\r\n p = m-p\r\n if p == 0:\r\n p = x\r\n \r\nfor i in y:\r\n print(i)", "n,m = input().split()\r\nn,m = int(n),int(m)\r\nfor i in range(n):\r\n j = i % m;\r\n if m % 2 == 1:\r\n if j % 2 == 0:\r\n print(int(m/2 + j/2) + 1)\r\n else:\r\n print(int(m/2 - (j+1)/2) + 1)\r\n else:\r\n if j % 2 == 0:\r\n print(int(m/2 - j/2))\r\n else:\r\n print(int(m/2 + (j+1)/2))\r\n", "n, m = map(int, input().split())\r\n\r\nprint(*((m+1)//2+(1-2*((m-1+i%m)%2))*((1+i%m)//2) for i in range(n)), sep='\\n')", "# -*- 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\nn,m=map(int,input().split())\nif m%2!=0:\n mid=m//2+1\n l1=[]\n l1.append(mid)\n for i in range(1,mid):\n l1.append(mid-i)\n l1.append(mid+i)\nelse:\n l1=[]\n mid=int(m/2)\n l1.append(mid)\n mid2=int(m/2)+1\n l1.append(mid2)\n for i in range(1,mid):\n l1.append(mid-i)\n l1.append(mid2+i)\nfor x in range(0,n):\n print(l1[x%(m)])", "n, m = tuple([int(x) for x in input().split(\" \")])\n\nbaskets = [(abs((m+1)/2 - i), i, 0) for i in range(1,m+1)]\nbaskets.sort()\n\nfor i in range(1,n+1):\n j = (i-1) % (m) \n d_to_center, basket_index, n_balls = baskets[j]\n baskets[j] = (d_to_center, basket_index, n_balls + 1)\n\n\n print(basket_index)\n\n\t \t \t\t \t \t\t \t\t \t\t\t\t\t \t \t \t\t\t", "n, m = map(int, input().split())\r\nce = (m+1)//2\r\npo = ce\r\nfor i in range(n):\r\n\tprint(po)\r\n\tif po == ce and m%2 == 1:\r\n\t\tpo -= 1\r\n\telif po <= ce:\r\n\t\tpo = m-po+1\r\n\telse:\r\n\t\tpo = m-po\r\n\tif po == 0:\r\n\t\tpo = ce\r\n ", "n,m=map(int,input().split())\r\n\r\n\r\nif m%2==1:\r\n mid=m//2+1\r\n ans=[]\r\n ans.append(mid)\r\n for j in range(1,m//2+1):\r\n ans.append(mid-j)\r\n ans.append(mid+j)\r\n for i in range(n):\r\n print(ans[i%m])\r\nif m%2==0:\r\n mid1=m//2\r\n mid2=m//2+1\r\n ans=[]\r\n ans.append(mid1)\r\n ans.append(mid2)\r\n for j in range(1,m//2):\r\n ans.append(mid1-j)\r\n ans.append(mid2+j)\r\n for i in range(n):\r\n print(ans[i%m])\r\n \r\n ", "n, m = map(int, input().split())\n\nmiddle = int(m/2) + m%2\ncore = []\nif m%2 == 1:\n a = 1\nelse:\n a = -1\n\nfor i in range(m):\n core.append(middle + int((i+1)/(2*a)))\n a *= -1\n \nfor i in range(n):\n print(core[i%m])\n \t \t \t \t\t\t \t\t \t\t \t \t\t\t \t\t\t\t", "import math\r\n#n=int(input())\r\nn,m = map(int, input().strip().split(' '))\r\n#d = list(map(int, input().strip().split(' ')))\r\nif m==1:\r\n for j in range(n):\r\n print(1)\r\nelif m==2:\r\n for j in range(n):\r\n if j%2==0:\r\n print(1)\r\n else:\r\n print(2)\r\nelif m%2!=0:\r\n mid=m//2 + 1\r\n for j in range(1,n+1):\r\n k=j%m\r\n if k==1:\r\n print(mid)\r\n elif k==0:\r\n print(m)\r\n elif (k-1)%2!=0: #k-1 is odd\r\n print(mid-math.ceil((k-1)/2))\r\n else:\r\n print(mid+(k-1)//2)\r\nelse:\r\n mid=m//2\r\n for j in range(1,n+1):\r\n k=j%m\r\n if k==1:\r\n print(mid)\r\n elif k==0:\r\n print(m)\r\n elif k%2==0:\r\n print(mid+k//2)\r\n else:\r\n print(mid-k//2)\r\n \r\n ", "if __name__ == '__main__':\n n, m = map(int, input().split())\n\n if m == 1:\n for i in range(n):\n print(1)\n elif m == 2:\n for i in range(n):\n if i % 2 == 0:\n print(1)\n else:\n print(2)\n else:\n for i in range(n):\n k = i % m\n if (m + k) % 2:\n resp = int((m + 1 + k) / 2)\n else:\n resp = int((m - k) / 2)\n print(resp)\n\t \t\t\t \t\t \t \t\t \t\t \t\t\t\t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd1 = list(reversed(range(1, m//2 + 1)))\r\nif m % 2 == 0:\r\n d2 = list(range(m//2 + 1, m+1))\r\n d = []\r\nelse:\r\n d2 = list(range(m//2 + 2, m+1))\r\n d = [m//2 + 1]\r\nfor i in range(m//2):\r\n d.append(d1[i])\r\n d.append(d2[i])\r\n\r\ni = 0\r\nwhile n > 0:\r\n print(d[i])\r\n i = (i + 1) % m\r\n n -= 1", "# -*- coding: utf-8 -*-\n\n# Baqir Khan\n# Software Engineer (Backend)\n\nfrom sys import stdin\n\ninp = stdin.readline\n\nn, m = map(int, inp().split())\nans = []\n\nif m & 1:\n mid = m // 2 + 1\n ans.append(str(int(mid)))\n k = 1\n n -= 1\n while True:\n if n == 0:\n break\n if mid - k < 1:\n k = 1\n ans.append(str(int(mid)))\n n -= 1\n continue\n ans.append(str(int(mid - k)))\n n -= 1\n if n == 0:\n break\n ans.append(str(int(mid + k)))\n n -= 1\n k += 1\nelse:\n mid = m // 2\n ans.append(str(int(mid)))\n k = 1\n n -= 1\n while True:\n if n == 0:\n break\n ans.append(str(int(mid + k)))\n n -= 1\n if n == 0:\n break\n if mid - k < 1:\n k = 1\n ans.append(str(int(mid)))\n n -= 1\n continue\n ans.append(str(int(mid - k)))\n n -= 1\n k += 1\n\nprint(\"\\n\".join(ans))\n", "n,i=map(int,input().split())\r\nt= [i//2]+[i//2+1] if i%2==0 else [i//2+1]\r\ntem=t[0]-1;x=2;x+=0 if len(t)==1 else 1\r\nwhile tem!=0:t.append(tem);t.append(tem+x);tem-=1;x+=2\r\nans=t*(n//i+1)\r\nfor x in range(n):print(ans[x])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\norder = []\r\nif m % 2 == 0:\r\n midn = m//2\r\n order.append(midn)\r\n for i in range(1, m//2):\r\n order.append(midn+i)\r\n order.append(midn-i)\r\n order.append(m)\r\nelse:\r\n midn = m//2 + 1\r\n order.append(midn)\r\n for i in range(1, m//2 + 1):\r\n order.append(midn-i)\r\n order.append(midn+i)\r\n\r\nct = 0\r\ni = 0\r\nwhile ct < n:\r\n if i == m:\r\n i = 0\r\n print(order[i], end=' ')\r\n i += 1\r\n ct += 1", "n,m = map(int,input().split())\r\nl = []\r\nif m%2 == 1:\r\n l = [(m+1)//2]\r\n for i in range((m-1)//2,0,-1):\r\n l.append(i)\r\n l.append(m-i+1)\r\nelse:\r\n l = []\r\n for i in range(m//2,0,-1):\r\n l.append(i)\r\n l.append(m-i+1)\r\nfor i in range(n):\r\n print(l[i%len(l)])\r\n", "n, m = map(int, input().split())\r\n\r\nif m % 2 == 1:\r\n\tx = (m + 1) // 2\r\n\tfor i in range(1, n + 1):\r\n\t\tif (i % m) % 2 == 0:\r\n\t\t\tif i % m == 0:\r\n\t\t\t\tprint(m)\r\n\t\t\telse: \r\n\t\t\t\tprint(x - (i % m) // 2)\r\n\t\telse:\r\n\t\t\tprint(x + (i % m) // 2)\r\n\r\nelse:\r\n\ty = m // 2\r\n\tfor i in range(1, n + 1):\r\n\t\tif (i % m) % 2 == 0:\r\n\t\t\tif i % m == 0:\r\n\t\t\t\tprint(m)\r\n\t\t\telse:\r\n\t\t\t\tprint(y + (i % m) // 2)\r\n\t\telse:\r\n\t\t\tprint(y - (i % m) // 2)\r\n\r\n", "a,b=map(int,input().split())\r\nz=[(b+1)//2];f=(b+1)//2\r\nif b%2:\r\n for i in range(1,1+(b-(b%2==0))//2):z+=[f-i,f+i]\r\nelse:\r\n for i in range(1, 1 + (b - (b % 2 == 0)) // 2): z += [f + i, f - i]\r\nif b%2==0:z+=[b]\r\nprint(\" \".join(map(str,z*(a//b)+z[:a%b])))", "n, m = map(int, input().split())\r\n\r\nif m % 2:\r\n while n:\r\n i = (m + 1) // 2\r\n k = 1\r\n j = 0\r\n while n and i > 0 and i <= m:\r\n print(i)\r\n if j % 2 == 0:\r\n i -= k\r\n else:\r\n i += k\r\n k += 1\r\n n -= 1\r\n j += 1\r\n\r\nelse:\r\n while n:\r\n i = (m + 1) // 2\r\n k = 1\r\n j = 0\r\n while n and i > 0 and i <= m:\r\n print(i)\r\n if j % 2:\r\n i -= k\r\n else:\r\n i += k\r\n k += 1\r\n n -= 1\r\n j += 1" ]

[ "n, mm = input().split(' ')\r\nm = int(mm)\r\ndp = [[0]*m for x in range((1<<len(n)))]\r\ndp[0][0]=1\r\nfor mask in range(1<<len(n)):\r\n for j in range(len(n)):\r\n if mask==0 and n[j]=='0': \r\n continue\r\n if(mask&(1<<j)):\r\n continue\r\n t = int(n[j])\r\n for rem in range(m):\r\n if(dp[mask][rem]==0):\r\n continue\r\n dp[mask|(1<<j)][(rem*10+t)%m]+=dp[mask][rem]\r\n \r\nans = dp[(1<<len(n))-1][0]\r\ncnt=[]\r\nfor i in range(10): cnt.append(0)\r\nfor i in range(len(n)): cnt[int(n[i])]=cnt[int(n[i])]+1\r\nfor i in range(10):\r\n for j in range(cnt[i]):\r\n ans=ans//(j+1)\r\n\r\nprint (ans)" ]

[ "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nfor i in range(len(l)):\r\n s.add(l[i])\r\nl1=[i for i in s]\r\nl2=[]\r\nif len(s)>=k:\r\n print(\"YES\")\r\n for i in range(k):\r\n if(l1[i] in l):\r\n l2.append(l.index(l1[i])+1)\r\n l2.sort()\r\n for i in range(len(l2)):\r\n print(l2[i],end=' ')\r\n\r\nelse:\r\n print(\"NO\")\r\n", "n,k=map(int,(input()).split(\" \"))\r\nz=0\r\nm=input().split(\" \")\r\nx=[]\r\nx.extend(set(m))\r\nif len(x)>= k:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(m.index (x[i])+1,end=\" \")\r\n z+=1\r\nelse:\r\n print(\"NO\")\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nd = a.copy()\r\na = list(set(a))\r\nif len(a) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in a[:k]:\r\n print(d.index(i)+1, end = \" \")\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ns = list(set(a))\nif len(s) >= k:\n print(\"YES\")\n for r in range(k):\n print(a.index(s[r]) + 1, end=' ')\nelse:\n print(\"NO\")", "def total(lista,k):\n a = {}\n indices = []\n indice = 0\n largo =0\n for i in lista:\n if a.get(i)==None:\n a[i]=0\n indices.append(indice)\n largo+=1\n if k == largo:\n print(\"YES\") \n for j in indices: \n print(j+1,end=\" \")\n return None\n indice+=1\n print(\"NO\")\n\ndef prueba():\n n,k = [int(i) for i in input().split(\" \")]\n lista = [int(i) for i in input().split(\" \")]\n total(lista,k)\n \nprueba()\n\n\t\t \t\t \t \t\t \t\t \t\t\t \t", "n, k = [int(s) for s in input().split()]\r\na = [int(s) for s in input().split()]\r\n \r\nchosen = []\r\nkeys = []\r\nfor i in range(len(a)):\r\n if a[i] not in chosen:\r\n chosen.append(a[i])\r\n keys.append(i + 1)\r\n \r\n if len(chosen) == k:\r\n break\r\n \r\nif len(chosen) >= k:\r\n print('YES')\r\n for e in keys:\r\n print(e, end = \" \")\r\nelse:\r\n print('NO')", "n, k = list(map(int, input().strip().split()))\r\nvalues = list(map(int, input().strip().split()))\r\nd = {}\r\nres = []\r\nfor i in range(n):\r\n if values[i] not in d:\r\n res.append(str(i+1))\r\n d[values[i]] = 1\r\nif len(res) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(' '.join(res[:k]))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nif len(set(a)) < k:\r\n print('NO')\r\nelse:\r\n set_a = set(a)\r\n non_duplicated_a = list(set_a)\r\n team = []\r\n for i in range(k):\r\n team.append(non_duplicated_a[i])\r\n team_indicies = []\r\n for rating in team:\r\n team_indicies.append(a.index(rating) + 1)\r\n print('YES')\r\n print(* team_indicies)\r\n\r\n ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\npos = {}\r\nfor i in range(n):\r\n if a[i] not in pos:\r\n pos[a[i]] = i\r\nif len(pos.items()) < k:\r\n print('NO')\r\nelse:\r\n print(\"YES\")\r\n for key in list(pos.keys())[:k]:\r\n print(pos[key] + 1, end=' ')", "n,k=[int(x) for x in input().split()]\r\nL=[int(x) for x in input().split()]\r\nR=[]\r\nM=[]\r\nfor i in range(n):\r\n if L[i] not in M:\r\n R.append(i+1)\r\n M.append(L[i])\r\nif len(R)>=k:\r\n print(\"YES\")\r\n print(\" \".join([str(x) for x in R[:k]]))\r\nelse:\r\n print(\"NO\")", "def solve():\r\n n, k = map(int, input().split())\r\n li = list(map(int, input().split()))\r\n s = {}\r\n for i in range(n):\r\n if li[i] not in s:\r\n s[li[i]] = i+1\r\n\r\n if len(s) < k:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n for i in s.values():\r\n if not k:\r\n break\r\n print(i, end=\" \")\r\n k -= 1\r\n print(end=\"\\n\")\r\n\r\nif __name__== \"__main__\":\r\n solve()", "from sys import stdin,stdout\r\nfrom itertools import accumulate\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\nfor _ in range(1):#nmbr()):\r\n # n=nmbr()\r\n n,k=lst()\r\n a=lst()\r\n # print(fn(a,w))\r\n s=set()\r\n ans=[]\r\n for i in range(n):\r\n if a[i] in s:continue\r\n else:\r\n ans+=[i+1]\r\n s.add(a[i])\r\n if len(s)>=k:\r\n print('YES')\r\n print(*ans[:k])\r\n else:print('NO')", "#n=int(input())\r\nn,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ns=set()\r\nres=[]\r\nfor i,a in enumerate(arr):\r\n if a not in s:\r\n s.add(a)\r\n res.append(i+1)\r\n k-=1\r\n if k==0: \r\n print(\"YES\")\r\n print(*res)\r\n break\r\nelse: print(\"NO\")\r\n\r\n ", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ndupArr = []\r\n\r\nfor i in arr:\r\n if (i not in dupArr):\r\n dupArr.append(i)\r\n\r\nans = []\r\nif (len(dupArr) < k):\r\n print(\"NO\")\r\nelse:\r\n for i in range(k):\r\n ans.append(arr.index(dupArr[i]) + 1)\r\n\r\n print(\"YES\")\r\n for i in ans:\r\n print(i, end=\" \")", "n, k = map(int,input().split())\r\n*a, = map(int,input().split())\r\nb = []\r\ni = 0\r\nind = []\r\nfor x in a:\r\n\tif x not in b:\r\n\t\tb += [x]\r\n\t\tind += [i+1]\r\n\ti += 1\r\n# print(b)\r\n\r\nif len(ind) < k:\r\n\tprint(\"NO\")\r\n\texit()\r\nprint(\"YES\")\r\nprint(*ind[:k])\r\n\r\n", "n,k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ndist = []\r\nfor i in a:\r\n if not(i in dist) :\r\n dist.append(i)\r\nif len(dist) >= k:\r\n print(\"YES\")\r\n res = []\r\n for i in range(k):\r\n res.append(a.index(dist[i])+1)\r\n res = list(map(str, res))\r\n print(' '.join(res))\r\nelse:\r\n print('NO')", "def yes_or_no(flag: bool) -> str:\n return \"YES\" if flag else \"NO\"\n\n\ndef test():\n _, k = map(int, input().split())\n a = list(map(int, input().split()))\n\n d = {a[i]: i + 1 for i in range(len(a))}\n print(yes_or_no(len(d) >= k))\n if len(d) >= k:\n print(*[d[key] for key in list(d.keys())[:k]])\n\n\nif __name__ == \"__main__\":\n # t = int(input())\n t = 1\n for _ in range(t):\n test()\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nif(len(s)>=k):\r\n l1=list(s)\r\n print('YES')\r\n cnt=0\r\n i=0\r\n while(cnt!=k):\r\n print(l.index(l1[i])+1,end=' ')\r\n i+=1\r\n cnt+=1\r\nelse:\r\n print(\"NO\")\r\n ", "s = set()\r\nans = []\r\na, b = map(int, input().split())\r\nn = list(map(int, input().split()))\r\nfor i in range(len(n)):\r\n if n[i] not in s:\r\n s.add(n[i])\r\n ans.append(i+1)\r\nif len(ans) >= b:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n exit(0)\r\nprint(*ans[:b])", "n, k = map(int, input().split()) \r\nel = set() \r\nans = [] \r\na = list(map(int,input().split()))\r\nfor i in range(len(a)):\r\n if a[i] not in el: \r\n ans.append(i) \r\n el.add(a[i])\r\nif len(ans) < k: \r\n print(\"NO\") \r\nelse:\r\n print(\"YES\") \r\n for i in range(k):\r\n print(ans[i] + 1, end=\" \") \r\n print() ", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nif len(set(a)) < k:\r\n print('NO')\r\nelse:\r\n answer = []\r\n for i in range(n):\r\n if a[i] not in answer:\r\n answer.append(a[i])\r\n for i in range(k):\r\n answer[i] = a.index(answer[i]) + 1\r\n print('YES')\r\n print(*answer[:k])\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\nratings = [-1]*101\r\nfor i in range(n):\r\n ratings[a[i]] = i+1\r\n \r\ncount = 0\r\nfor r in ratings:\r\n if r > -1:\r\n count += 1\r\n \r\nif count >= k:\r\n print(\"YES\")\r\n for i in range(1,101):\r\n if ratings[i] > -1:\r\n print(ratings[i], end=\" \")\r\n k -= 1\r\n if k == 0:\r\n break\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = []\r\nc = []\r\n\r\nfor i in range(n):\r\n if len(b) == k:\r\n break\r\n if a[i] not in b:\r\n b.append(a[i])\r\n c.append(i + 1)\r\n\r\nif len(b) == k:\r\n print('YES')\r\n print(*c)\r\nelse:\r\n print('NO')", "n, m = map(int, input().split())\r\nd = {}\r\na = [*map(int, input().split())]\r\nc = 0\r\nb = []\r\nfor i in range(n):\r\n\tx = d.get(a[i], 0)\r\n\tif not x:\r\n\t\td[a[i]] = 1\r\n\t\tc += 1\r\n\t\tb.append(i+1)\r\nif c >= m:\r\n\tprint(\"YES\")\r\n\tprint(*b[:m])\r\nelse:\r\n\tprint(\"NO\")\r\n", "l=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\n\r\nm=max(a)\r\nind=[0 for _ in range(m+1)]\r\nq=[]\r\nk=0\r\nres=False\r\nfor i in range(l[0]):\r\n if ind[a[i]]==0:\r\n k+=1\r\n q.append(i+1)\r\n ind[a[i]]=1\r\n if k==l[1]:\r\n res=True\r\n break\r\nif res:\r\n print('YES')\r\n print(*q)\r\nelse:\r\n print('NO')", "n , k= map(int , input().split())\r\n\r\nlist = list(map(int , input().split()))\r\n\r\nl = []\r\nindx = []\r\nfor i in range(n):\r\n\r\n if list[i] not in l:\r\n l.append(list[i])\r\n indx.append(i + 1)\r\n\r\nif len(l) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(indx[i] , end = \" \")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat May 8 19:40:12 2021\r\n\r\n@author: nagan\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\nl = []\r\nfor i in s:\r\n if i not in l:\r\n l.append(i)\r\ncount = len(l)\r\nif count >= k:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(s.index(l[i]) + 1, end = \" \")\r\nelse:\r\n print(\"NO\")", "from collections import Counter \r\na, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nl2 = list(Counter(l))\r\n\r\nif len(l2) < b:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(b):\r\n print(l.index(l2[i])+1, end = ' ') \r\n", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nteam = {}\r\n\r\nfor i in range(n):\r\n team[a[i]] = i+1\r\n\r\nif len(team) >= k:\r\n print(\"YES\")\r\n count = 0\r\n for i in team.values():\r\n print(i, end=\" \")\r\n count += 1\r\n if count == k:\r\n break\r\nelse:\r\n print(\"NO\")", "m,n=map(int,input().split())\r\n\r\nstu=list(map(int,input().split()))\r\n\r\nt=list(set(stu))\r\nfinal=[]\r\nflag=1\r\ncount=0\r\nfor i in range(len(stu)):\r\n if stu[i] in t and stu.index(stu[i])+1 not in final:\r\n final.append(stu.index(stu[i])+1)\r\n count+=1\r\n if count==n:\r\n flag=0\r\n break\r\nif flag==0:\r\n print(\"YES\")\r\n for i in final:\r\n print(i,end=\" \")\r\nelse:\r\n print(\"NO\")", "def find_team(a, k):\n if len(a) == 1 and k == 1:\n print(\"YES\")\n print(1)\n return\n\n if len(a) < k:\n print(\"NO\")\n return\n\n first = a[0]\n answer = [1]\n nums = [a[0]]\n for i in range(1, len(a)):\n if (a[i] != first) and (a[i] not in nums):\n answer.append(i + 1)\n nums.append(a[i])\n\n if len(answer) >= k:\n print(\"YES\")\n print(*answer[:k])\n # return \"YES\", answer\n else:\n print(\"NO\")\n return\n\n\ndef main():\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n find_team(a, k)\n\n\nif __name__ == \"__main__\":\n main()\n\n\"\"\"\n100 53\n16 17 1 2 27 5 9 9 53 24 17 33 35 24 20 48 56 73 12 14 39 55 58 13 59 73 29 26 40 33 22 29 34 22 55 38 63 66 36 13 60 42 10 15 21 9 11 5 23 37 79 47 26 3 79 53 44 8 71 75 42 11 34 39 79 33 10 26 23 23 17 14 54 41 60 31 83 5 45 4 14 35 6 60 28 48 23 18 60 36 21 28 7 34 9 25 52 43 54 19\n\n\"\"\"", "n,m=map(int,input().split())\r\nar=list(map(int,input().split()))\r\nc=0\r\nif(len(set(ar))<m):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n a=[ ]\r\n for i in range (0,n):\r\n if(ar[i] not in a):\r\n c+=1\r\n a.append(ar[i])\r\n print(i+1,end=' ')\r\n if(c==m):\r\n break", "n , k = map(int , input().split())\r\nl = list(map(int , input().split()))\r\nll = []\r\nfor i in range(n):\r\n ll.append((l[i] , i + 1))\r\nll.sort()\r\nf = []\r\nfor i in range(n):\r\n if i != n - 1 and ll[i][0] != ll[i + 1][0]:\r\n f.append(ll[i])\r\n elif i == n - 1 and ll[i][0] != ll[i - 1][0]:\r\n f.append(ll[i])\r\nx = ll[-1]\r\nok = 1\r\nfor i in range(len(f)):\r\n if f[i][0] == x[0]:\r\n ok = 0\r\nif ok:\r\n f.append(x)\r\nif len(f) >= k:\r\n print(\"YES\")\r\n ans = []\r\n for i in range(k):\r\n ans.append(f[i][1])\r\n print(*ans)\r\nelse:\r\n print(\"NO\")", "m,n=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif len(set(l))>=n:\r\n print(\"YES\")\r\n c,l1=0,[]\r\n for i in range(m):\r\n if l[i] not in l1:\r\n if c<n:\r\n print(i+1,end=' ')\r\n l1.append(l[i])\r\n c+=1 \r\n else:\r\n break\r\nelse:\r\n print(\"NO\")", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n# ----------------------- #\r\n\r\nn, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nans = []\r\nseen = set()\r\nfor i, a in enumerate(A, 1):\r\n if a not in seen:\r\n seen.add(a)\r\n ans.append(i)\r\n\r\n\r\nif len(ans) < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(*ans[:k])\r\n\r\n", "n,k=input(\"\").rsplit()\r\nn,k=int(n),int(k)\r\nstudents= input(\"\").rsplit()\r\n\r\nif len (list( set (students) ) ) < k:\r\n print(\"NO\" )\r\nelse :\r\n stop=0\r\n result=list()\r\n print(\"YES\")\r\n for i in list ( set (students) ):\r\n stop+=1\r\n if stop>k:\r\n break\r\n result.append (students.index(i) +1 )\r\n \r\n for u in sorted (result):\r\n print(u,end=\" \")\r\n ", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ns = set()\r\nres = []\r\nfor i, x in enumerate(a):\r\n if x not in s:\r\n s.add(x)\r\n res.append(i+1)\r\n if len(res) == k:\r\n print(\"YES\")\r\n print(\" \".join(str(y) for y in res))\r\n break\r\nelse:\r\n print(\"NO\")", "N , K = [int(i) for i in input().split()]\r\nA = [int(i) for i in input().split()]\r\nA0 = []\r\nA1 = []\r\ni = 0\r\nfor i in range(len(A)):\r\n if len(A0) == K:\r\n break\r\n else:\r\n if A[i] not in A1:\r\n A0.append(i+1)\r\n A1.append(A[i])\r\nif len(A0) != K:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for j in A0:\r\n print(j,end=\" \")", "#!/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,k = map(int, wtf[0].split())\r\n A = list(map(int, wtf[1].split()))\r\n tmp = set()\r\n ans = []\r\n for i,a in enumerate(A):\r\n if len(ans) == k:\r\n break\r\n if a not in tmp:\r\n ans.append(i+1)\r\n tmp.add(a)\r\n print('NO' if len(ans) != k else f'YES\\n{\" \".join(map(str,ans))}')\r\n", "a,b = map(int,input().split())\r\ns = list(map(int,input().split()))\r\ng = []\r\ng_s = []\r\nfor i in range(a):\r\n if s[i] not in g_s:\r\n g.append(i + 1)\r\n g_s.append(s[i])\r\n if len(g) == b:\r\n print(\"YES\")\r\n print(*g)\r\n break\r\nelse:\r\n if len(g) == b:\r\n print(\"YES\")\r\n print(*g)\r\n else:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n\tif l[i] not in d:\r\n\t\td[l[i]]=i+1\r\nif len(d)<k:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tlst=[];d=list(d.values())\r\n\tfor i in range(k):\r\n\t\tlst.append(d[i])\r\n\tprint(*lst)", "n, k = map(int, input().split())\r\n\r\n#print(n, k)\r\n\r\na = [int(i) for i in input().split()]\r\n\r\n# print(*a)\r\ncnt = 0\r\nteam = []\r\nfor x in range(n):\r\n if a[x] not in team:\r\n team.append(a[x])\r\n cnt += 1\r\n if k == cnt:\r\n break\r\n\r\nif cnt == k:\r\n print(\"YES\")\r\n for i in range(len(team)):\r\n print(a.index(team[i]) + 1, end=' ')\r\nelse:\r\n print(\"NO\")\r\n", "x,y=list(map(int,input().split(\" \")))\r\nli=list(map(int,input().split(\" \")))\r\nfli=[]\r\nfor i in range(len(li)):\r\n if li[i] not in fli :\r\n fli.append(li[i])\r\nif(len(fli)<y):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(y):\r\n print(li.index(fli[i])+1,end=\" \")", "from sys import stdin,stdout,setrecursionlimit\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\nn,k = mp()\r\nl = mp()\r\ns = set(l)\r\nif len(s)>=k:\r\n\tprint('YES')\r\n\ts = set()\r\n\tfor i in range(n):\r\n\t\tif l[i] not in s:\r\n\t\t\tprint(i+1,end=' ')\r\n\t\t\tk -= 1\r\n\t\t\ts.add(l[i])\r\n\t\tif k == 0:\r\n\t\t\tbreak\r\nelse:\r\n\tprint('NO')\r\n\r\n\r\n", "import sys\r\n\r\ndef main():\r\n n,k,*l = map(int, sys.stdin.read().strip().split())\r\n d = dict(zip(l, range(1, n+1)))\r\n if len(d) < k: return 'NO'\r\n return 'YES\\n' + ' '.join(map(str, list(d.values())[:k]))\r\n \r\nprint(main())", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nl2=list(s)\r\nif len(s)>=k:\r\n print(\"YES\")\r\n l1=[]\r\n for i in range(k):\r\n l1.append(l.index(l2[i])+1)\r\n print(*l1)\r\nelse:\r\n print(\"NO\")", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\nif(len(s)<m):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\t\r\n\tfor i in range(m):\r\n\t\tprint(l.index(s.pop())+1,end=' ')\t\r\n\t", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\no ,r = [],[]\r\nfor i in range(len(arr)):\r\n\tif arr[i] not in o:\r\n\t\to.append(arr[i])\r\n\t\tr.append(i+1)\r\nif len(o)<k:print(\"NO\")\r\nelse :\r\n\tprint(\"YES\")\r\n\tprint(*r[:k])", "from collections import Counter\r\n\r\n\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\n\r\nx= Counter(a)\r\nl=[]\r\nif len(x)>=k:\r\n print('YES')\r\n for each in x.keys():\r\n if len(l)==k:\r\n break\r\n l.append(a.index(each))\r\n for each in l:\r\n print(each+1,end=' ')\r\nelse:\r\n print('NO')\r\n\r\n", "#A.Diverse Team\r\na,b = list(map(int,input().split()))\r\nlis = list(map(int,input().split()))\r\ncount = []\r\nh = set(lis)\r\nfor i in list(h)[:b]:\r\n\tcount.append(lis.index(i)+1)\r\nif len(h) >= b :\r\n\tprint('YES')\r\n\tprint(*count)\r\nelse:\r\n\tprint('NO')", "temp = input().split(\" \")\nn = int(temp[0])\nx = int(temp[1])\n\ntemp_l = []\nfin = []\n\nval = input()\nfor i in val.split(\" \"):\n temp_l.append(int(i))\n\ntemp_set = set(temp_l)\ntemp_set_list = list(temp_set)\n\nif len(temp_set_list) < x:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in range(x):\n o_val = temp_set_list[i]\n # fin.append(temp_l.index(o_val) + 1)\n print(temp_l.index(o_val) + 1,end =\" \") ## index in terms of numeric order\n \n # arr_fin = sorted(fin)\n # for i in arr_fin:\n # print(i, end=\" \") ## sortin not necessary\n\n\n\n\n", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nif len(set(a))<k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n lst,lstpos=[a[0]],[1]\r\n for i in range(1,n):\r\n if a[i] not in lst:\r\n lst.append(a[i])\r\n lstpos.append(i+1)\r\n for i in range(k):\r\n print(lstpos[i],end=' ')", "n,k = [int(x) for x in input().split()]\na = list(map(int,input().split()))\nb = list(set(a))\nif len(b)>=k:\n print(\"YES\")\n new = []\n for i in range(k):\n x = a.index(b[i])+1\n new.append(x)\n ans = sorted(new)\n for i in range(k):\n print(ans[i],end =\" \")\nelse:\n print(\"NO\")\n\t\t\t \t\t \t\t \t \t\t\t\t\t \t\t\t", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif len(set(l))>=k:\r\n print(\"YES\")\r\n print(*[l.index(i)+1 for i in set(l)][:k])\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nans=[]\r\nq=set()\r\nfor i in range(len(s)):\r\n if(not s[i] in q):\r\n ans.append(i+1)\r\n q.add(s[i])\r\nif(k<=len(ans)):\r\n print('YES')\r\n for i in range(k):\r\n print(ans[i],end=' ')\r\nelse:\r\n print('NO')", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\na=list(s)\r\nif len(s)<k:print(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor x in range(k):\r\n\t\tprint(l.index(a[x])+1,end=\" \")", "n, m = map(int, input().split())\r\n\r\nmp = dict()\r\n\r\nfor i, x in enumerate(map(int, input().split())):\r\n\tmp[x] = i + 1\r\n\r\nif len(mp) < m: print(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tres = [str(x) for x in mp.values()][:m]\r\n\tprint(*res)", "# LUOGU_RID: 101743993\nn, k, *a = map(int, open(0).read().split())\r\nb = set(a)\r\nif len(b) >= k:\r\n print('YES')\r\n print(*[a.index(x) + 1 for x in list(b)[:k]])\r\n \r\nelse:\r\n print('NO')", "import sys\r\nfrom collections import defaultdict\r\ninpu = sys.stdin.buffer.readline\r\nprin = sys.stdout.write\r\nn, k = map(int, inpu().split())\r\nlis = list(map(int, inpu().split()))\r\nif len(set(lis)) < k:\r\n prin(\"NO\\n\")\r\nelse :\r\n prin(\"YES\\n\")\r\n a = defaultdict(int)\r\n for i in range(n) :\r\n if k == 0 :\r\n break\r\n if a[lis[i]] == 0:\r\n prin(str(i + 1) + ' ')\r\n k -= 1\r\n a[lis[i]] += 1", "R=lambda:map(int,input().split())\r\nn,k=R()\r\nd=dict(zip(R(),range(1,n+1)))\r\n\r\nif len(d)<k:print('NO')\r\nelse:\r\n print('YES');print(*list(d.values())[:k])\r\n", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\n\r\nmapper = {}\r\nfor ind in range(n):\r\n mapper[arr[ind]]= ind\r\nif len(mapper)>= k:\r\n ans= []\r\n for key in mapper:\r\n ans.append(mapper[key]+1)\r\n if len(ans)==k:\r\n break\r\n print(\"YES\")\r\n print(*ans)\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\nunique_ratings = []\r\nunique_indexes = []\r\nfor i, rating in enumerate(a):\r\n if rating not in unique_ratings:\r\n unique_ratings.append(rating)\r\n unique_indexes.append(i + 1)\r\n \r\nif len(unique_indexes) >= k:\r\n print(\"YES\")\r\n for i in unique_indexes[:k]:\r\n print(i, end=\" \")\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor i in range(n):\r\n if a[i] not in d:\r\n d[a[i]] = []\r\n d[a[i]].append(i + 1)\r\nratings = sorted(d.keys(), reverse=True)\r\nif len(ratings) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(d[ratings[i]][0], end=' ')\r\n del d[ratings[i]][0]", "n, k = [int(x) for x in input().split()]\r\nstudents = {}\r\nbuff = [int(x) for x in input().split()]\r\nfor i in range(1, n+1):\r\n students[buff[i-1]] = i\r\nif len(students) >= k:\r\n print(\"YES\")\r\n values = list(students.values())[:k]\r\n print(' '.join(str(val) for val in values))\r\nelse:\r\n print(\"NO\")", "from bisect import bisect_right\r\nimport math\r\nfrom sys import stdin, stdout\r\nimport collections\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, k = multi_input()\r\n a = list_input(int)\r\n s = set()\r\n ans = []\r\n for i in range(n):\r\n if a[i] not in s:\r\n s.add(a[i])\r\n ans.append(i)\r\n if len(ans) == k:\r\n break\r\n if len(ans) == k:\r\n print(\"YES\\n\")\r\n for i in ans:\r\n print(f\"{i+1} \")\r\n print(\"\\n\")\r\n else:\r\n print(\"NO\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n , k = input().split()\nn = int(n) ; k = int(k)\na = input()\nl = a.split()\nnew_l = []\nL_pos = []\nfor i in range(len(l)):\n if l[i] not in new_l:\n new_l.append(l[i])\n L_pos.append(i+1)\nif len(new_l)>=k:\n print(\"YES\")\n for i in range(k):\n print(L_pos[i] , end= \" \")\nelse:\n print(\"NO\")\n\n\n\t \t\t\t \t \t \t \t \t \t\t\t\t", "import random\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nnew_a=list(dict.fromkeys(a))\r\nif k>len(new_a):\r\n print(\"NO\")\r\nelse:\r\n index=[]\r\n temp=random.sample(new_a,k)\r\n for i in temp:\r\n index.append(a.index(i)+1)\r\n print(\"YES\")\r\n print(*index,sep=\" \")\r\n ", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n#####################################################################\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nindex = []\r\nfor i in list(set(a))[:k]:\r\n index.append(a.index(i)+1)\r\nif len(set(a)) >= k:\r\n print('YES')\r\n print(*index)\r\nelse:\r\n print('NO')", "x=input()\r\nn=int(x.split()[0])\r\nk=int(x.split()[1])\r\na=input()\r\na=a.split()\r\nfor i in range(n): a[i]=int(a[i])\r\nb=[]\r\nfor i in range(n):\r\n if a[i] not in b: b.append(a[i])\r\nb.sort()\r\nif k>len(b): print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(a.index(b[i])+1,end=\" \")\r\n", "a,b=map(int, input().split())\r\nx=dict(zip(map(int, input().split()), range(1,a+1)))\r\nif len(x)<b:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(*list(x.values())[:b])", "n,k = map(int, input().split())\r\nl = [int(i) for i in input().split()]\r\nres = []\r\nif len(set(l)) >= k:\r\n print(\"YES\")\r\n for x in range(k):\r\n o = list(set(l))[x]\r\n for j in range(len(l)):\r\n if l[j] == o:\r\n res.append(j+1)\r\n break\r\n for h in sorted(res):\r\n print(h,end=\" \")\r\nelse:\r\n print(\"NO\")", "[n, k] = list(map(int, input().split()))\na = list(map(int, input().split()))\nd = {}\nb = []\nfor i in range(n):\n if a[i] not in d:\n d[a[i]] = i+1\nfor i in d:\n b.append(d[i])\nif len(b) >= k:\n print(\"YES\")\n print(\" \".join(map(str, b[:k])))\nelse:\n print(\"NO\")\n", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = set(a)\r\nif len(b) < k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n c = []\r\n d = []\r\n for i in range(n):\r\n if a[i] not in c:\r\n c.append(a[i])\r\n d.append(i + 1)\r\n if len(c) == k:\r\n break\r\n print(*d)", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input().split()]\r\nif len(set(a))<k:\r\n print(\"NO\")\r\nelse :\r\n ans=[]\r\n l=[]\r\n j=0\r\n cnt=0\r\n while cnt<k:\r\n if a[j] not in l:\r\n l.append(a[j])\r\n ans.append(j+1)\r\n cnt+=1\r\n j+=1\r\n print(\"YES\")\r\n print(*ans,sep=\" \")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nd={};tot=0\r\nfor i in range(n):\r\n if a[i] not in d:\r\n d[a[i]]=[]\r\n tot+=1\r\n d[a[i]].append(i+1) \r\nif tot<k:\r\n print(\"NO\")\r\nelse:\r\n ans=[]\r\n for i in d:\r\n ans.append(d[i][0])\r\n print(\"YES\")\r\n print(*ans[:k])", "import collections\r\nimport math\r\n\r\nt = 1\r\nfor _ in range(t):\r\n n, k = map(int, input().split())\r\n # n = int(input())\r\n a = list(map(int, input().split()))\r\n d = {a[i] : i for i in range(n)}\r\n a = set(a)\r\n if len(a) >= k:\r\n print(\"YES\")\r\n it = 0\r\n for x in a:\r\n if it == k:\r\n break\r\n print(d[x] + 1, end=' ')\r\n it += 1\r\n print()\r\n\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\na=[*I()]\r\np=[]\r\nq={0}\r\nfor i in range(n):\r\n if a[i] not in q:\r\n m-=1\r\n q.add(a[i])\r\n p+=[i+1]\r\n if m==0:break\r\nif m<=0:print(\"YES\\n\",*p)\r\nelse:print(\"NO\")", "n,m=map(int,input().split())\r\narr=[]\r\nbrr=list(map(int,input().split()))\r\nseen=set()\r\nfor i,el in enumerate(brr):\r\n if el not in seen:\r\n seen.add(el)\r\n arr.append(i+1)\r\nif len(arr)<m:\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")\r\n print(*arr[:m])", "# from collections import defaultdict, Counter\r\n# from bisect import bisect, bisect_left\r\n# from math import sqrt, gcd\r\n# def read(): return list(map(int, input().strip().split()))\r\n\r\n# ans_ = []\r\n\r\n# def f(s):\r\n# last = -1\r\n# dp = [0]*len(s)\r\n# count = 0\r\n# for i in range(len(s)):\r\n# x = [0, 1][s[i] == \"*\"]\r\n# dp[i] += dp[last]\r\n# dp[i] += count*(i-last-x)\r\n# count += x\r\n# last = [last, i][x]\r\n# return(dp)\r\n\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\n# n = int(input()); s = input().strip()\r\n# a = f(s)\r\n# b = f(s[::-1])[::-1]\r\n# ca = s.count(\"*\")\r\n# ans = float(\"inf\")\r\n# c = 0\r\n# for i in range(n):\r\n# if s[i] == \"*\":\r\n# c += 1\r\n# ans = min(ans, (a[i]+b[i]))\r\n# else:\r\n# ans = min(ans, (a[i]+b[i]-max(c, ca-c)))\r\n\r\n# # print(a, \"\\n\", b)\r\n# if c != 0:\r\n# ans_.append(ans)\r\n# else:\r\n# ans_.append(0)\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n# # print(ans_)\r\n# for i in ans_:\r\n# print(i)\r\n\r\n\r\n# \"\"\"\r\n\r\n# 1\r\n\r\n# 1\r\n\r\n\r\n# 2 1 2 3 4\r\n\r\n# 3 1 2 3 4 5 6 7 8 9\r\n\r\n# 1 3 5\r\n# 4 6 \r\n\r\n\r\n# \"\"\"\r\n\r\nfrom collections import defaultdict, Counter\r\nfrom bisect import bisect, bisect_left\r\nfrom math import sqrt, gcd\r\n \r\ndef read(): return list(map(int, input().strip().split()))\r\n \r\nans_ = []\r\n \r\n\r\n \r\n# for _ in range(int(input())):\r\nn, k = read(); arr = read()\r\nd = defaultdict(int)\r\nfor i in range(n):d[arr[i]] = i+1\r\nif len(d) >= k:\r\n ans_.append(\"YES\")\r\n ans = [str(d[i]) for i in list(d.keys())[:k]]\r\n ans.sort()\r\n ans_.append((\" \").join(ans))\r\nelse:\r\n ans_.append(\"NO\")\r\n\r\n \r\n \r\n# print(ans_)\r\nfor i in ans_:\r\n print(i)\r\n \r\n \r\n\"\"\"\r\n9 + 9 + \r\n\"\"\"", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nsa=set(a);ans=[]\r\nif len(sa)<k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for x in sa:\r\n ans.append(a.index(x)+1)\r\n ans.sort()\r\n for i in range(k):print(ans[i],end=' ')", "n, k = map(int,input().split())\r\na = [int(c) for c in input().split()]\r\nst = list(set(a))\r\nif len(st)<k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(a.index(st[i])+1,end=\" \")\r\n", "a, b = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nc = []\r\nd = []\r\nfor i in range(a):\r\n if s[i] not in d:\r\n c.append(i + 1)\r\n d.append(s[i])\r\n if len(c) == b:\r\n print('YES')\r\n print(*c)\r\n break\r\nif len(c) < b:\r\n print('NO')", "\r\n\r\nclass Solution:\r\n\r\n def printAns(self, nums):\r\n\r\n build = str(nums[0])\r\n\r\n for i in range(1, len(nums)):\r\n build += f\" {nums[i]}\"\r\n \r\n print(build)\r\n\r\n def solve(self, n, k, nums):\r\n\r\n seen = set()\r\n ans = []\r\n\r\n for i in range(n):\r\n x = nums[i]\r\n if x not in seen:\r\n ans.append(i+1)\r\n seen.add(x)\r\n\r\n if len(ans) == k:\r\n break\r\n\r\n\r\n if len(ans) == k:\r\n print(\"YES\")\r\n self.printAns(ans)\r\n else:\r\n print(\"NO\")\r\n \r\n\r\n\r\n(n, k) = [int(x) for x in input().split(\" \")]\r\nnums = [int(x) for x in input().split(\" \")]\r\n\r\nsolver = Solution()\r\nsolver.solve(n, k, nums)", "n, k = input().split()\nn = int(n)\nk = int(k)\na = input()\nl = a.split()\nteam = []\nposition_team = []\nfor i in range(len(l)):\n l[i] = int(l[i])\n if l[i] not in team:\n team.append(l[i])\n position_team.append (i + 1)\nif len(team) >= k:\n print(\"YES\")\n for i in range(k):\n print(position_team[i], end = \" \")\nelse:\n print(\"NO\")\n\n\n \t\t \t\t \t \t\t \t \t\t \t", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nfrom queue import PriorityQueue as pq\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=dc(int)\r\nfor i in range(n):\r\n x[l[i]]=i+1\r\nif len(x)>=k:\r\n print(\"YES\")\r\n l=[]\r\n c=0\r\n for i in x:\r\n if c>=k:\r\n break\r\n l.append(x[i])\r\n c+=1\r\n print(*l)\r\nelse:\r\n print(\"NO\")\r\n ", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=[]\r\nfor i in l:\r\n\tif i not in l2:\r\n\t\tl2.append(i)\r\nif len(l2)>=m:\r\n\tprint(\"YES\")\r\n\tfor i in range(m):\r\n\t\tprint(l.index(l2[i])+1,end=\" \")\r\nelse:\r\n\tprint(\"NO\")", "n, k = map(int, input().split(' '))\r\nlist1 = list(map(int, input().split(' ')))\r\nlist2 = []\r\nlist3 = []\r\ncounter = 0\r\nfor i in range(len(list1)):\r\n if list1[i] not in list2 and counter != k:\r\n list3.append(i + 1)\r\n list2.append(list1[i])\r\n counter = counter + 1\r\nif len(list3) != k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(len(list3)):\r\n print(list3[i], end = ' ')\r\n", "r=lambda:map(int,input().split())\r\nn,k=r()\r\na=dict(zip(r(),range(1,n+1)))\r\nif len(a)<k: print('NO')\r\nelse: print('YES\\n',*[*a.values()][:k])", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=set(l)\r\nj=list(k)\r\nif b>len(k):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tfor i in j[0:b]:\r\n\t\tx=l.index(i)\r\n\t\tprint(x+1,end=\" \")", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=list(set(l))\r\nif(len(l1)<b):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(b):\r\n print(l.index(l1[i])+1,end=\" \")", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nuni = set()\r\nans = set()\r\nfor i in range(n):\r\n if arr[i] not in uni:\r\n ans.add(i + 1)\r\n uni.add(arr[i])\r\n if len(ans) >= k:\r\n print('YES')\r\n print(*ans)\r\n break\r\nelse:\r\n print('NO')\r\n", "x=[]\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nsl=set(l)\r\nsl=list(sl)\r\nif len(sl)>=k:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(l.index(sl[i])+1,end=' ')\r\n print()\r\nelse:\r\n print(\"NO\")\r\n", "import math\r\nfrom collections import Counter\r\nt = 1\r\nfor _ in range(t):\r\n # n = int(input())\r\n n,k = map(int, input().split())\r\n ali = list(map(int, input().split()))\r\n # s = input()\r\n c = Counter()\r\n for i in range(n):\r\n c[ali[i]] = i+1\r\n ali= list(set(ali))\r\n ali.sort()\r\n if(len(ali) >= k):\r\n print(\"YES\")\r\n for i in range(k):\r\n q = c[ali[i]]\r\n print(q, end=\" \")\r\n print()\r\n else:\r\n print(\"NO\")\r\n\r\n", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ns = list(set(a))\r\nif len(s) >= k:\r\n c = []\r\n b = 0\r\n for i in range(k):\r\n b = s[i]\r\n f = a.index(b)\r\n c.append(f+1)\r\n print('YES')\r\n c.sort()\r\n print(*c)\r\nelse:\r\n print('NO')", "n, k = map(int, input().split())\nl = input().split()\n\ns = list(set(l))\n\nif len(s) >= k:\n print(\"YES\")\n for i in range(k):\n print(l.index(s[i]) + 1, end= \" \")\n\nelse:\n print(\"NO\")\n \t\t \t\t \t\t \t\t\t\t \t \t\t\t \t\t", "s = input().split(' ')\r\nn = int(s[0])\r\nk = int(s[1])\r\na = list(map(int, input().split(' ')))\r\nm = dict()\r\ns = \"\"\r\nfor i in range(n):\r\n if(a[i] not in m.keys()):\r\n m[a[i]] = i\r\n if(len(m) == k):\r\n break\r\nif(len(m) == k):\r\n print(\"YES\")\r\n print(' '.join([str(val+1) for val in m.values()]))\r\nelse:\r\n print(\"NO\")\r\n \r\n \r\n", "n,k=map(int,input().split())\r\nls=list(map(int,input().split()))\r\n\r\nst=set(ls)\r\nif len(st)<k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(*[(ls.index(i)+1) for i in st][:k])", "length, team = map(int, input().split())\narray = list(map(int, input().split()))\n\nif len(set(array)) < team:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in range(team):\n print(array.index(list(set(array))[i]) + 1, end = \" \")\n print()", "N,K = map(int,input().split())\r\nA = list(map(int,input().split()))\r\n\r\nD = {}\r\nfor i in range(N):\r\n if A[i] not in D:\r\n D[A[i]] = [i+1]\r\n else:\r\n D[A[i]].append(i+1)\r\n\r\nif len(D) >= K:\r\n print(\"YES\")\r\n ans = []\r\n for k,v in D.items():\r\n ans.append(v[0])\r\n ans.sort()\r\n print(*ans[:K])\r\nelse:\r\n print(\"NO\")", "\r\nn, k = map(int, input().split())\r\ns, v = set(), []\r\nfor i, ai in enumerate(map(int, input().split())):\r\n if ai not in s:\r\n s.add(ai)\r\n v += [str(i+1)]\r\nprint('YES\\n'+' '.join(v[:k]) if len(v) >= k else 'NO')", "a,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nc=0\r\nfor i in range(len(l)):\r\n if(l[i] not in l2):\r\n l1.append(i+1)\r\n l2.append(l[i])\r\n if(len(l1)==b):\r\n print(\"YES\")\r\n print(*l1)\r\n c=1\r\n break\r\nif(c==0):\r\n print(\"NO\")", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set(l)\r\ns=list(s)\r\nif len(s)>=k:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(l.index(s[i])+1,end=' ')\r\nelse:print(\"NO\")", "from sys import stdin \r\nfrom math import log2, log10, log, ceil, floor, sqrt\r\n\r\ndef rs(): return stdin.readline().strip()\r\ndef ri(): return int(rs())\r\ndef rn(): return map(int, rs().split())\r\ndef rl(): return list(rn())\r\n\r\ndef solve():\r\n n, k = rn()\r\n numbers = rl()\r\n if len(set(numbers)) >= k:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n return \r\n cache = []\r\n i = 0\r\n while len(cache) < k:\r\n if numbers[i] not in cache:\r\n cache.append(numbers[i])\r\n print(i + 1, end=\" \")\r\n i += 1\r\n \r\n return None \r\n\r\ndef main():\r\n # for _ in range(ri()):\r\n solve()\r\n\r\nmain()\r\n", "n, k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nx = sorted(set(arr),reverse=True)\r\nif len(x) < k :\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(arr.index(x[i])+1,end=\" \")", "n, k = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\nst, indices = set(), []\nfor i, x in enumerate(a):\n if x not in st:\n indices.append(i + 1)\n st.add(x)\nif len(indices) < k:\n print('NO')\nelse:\n print('YES')\n print(' '.join(str(x) for x in indices[:k]))", "def main():\r\n n, k = list(map(int, input().split()))\r\n lst = list(map(int, input().split()))\r\n res = list(set(lst))\r\n if len(res) < k:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(lst.index(res[i]) + 1, end=' ')\r\n\r\n\r\nmain()\r\n", "n,k=map(int,input(\"\").split())\r\na=list(map(int,input(\"\").split()))\r\nv={}\r\nd=[]\r\nfor i in range (len(a)):\r\n if not a[i] in v :\r\n v[a[i]]=1\r\n d.append(i)\r\nif len(v)>=k:\r\n print(\"YES\")\r\n for i in range (k):\r\n print(d[i]+1,end=\" \")\r\nelse:\r\n print(\"NO\")", "n, m = list(map(int, input().split()))\npontos = list(map(int, input().split()))\n\npontos = [[pontos[i], i+1] for i in range(n)]\npontos.sort()\nt = []\nit = 0\nfor i in pontos:\n if i[0] > it and m > 0:\n it = i[0]\n m -= 1\n t.append(str(i[1]))\n \nif m == 0:\n print(\"YES\")\n t.sort()\n print(\" \".join(t))\nelse:\n print(\"NO\")", "n,k= map(int,input().split())\r\nl=list(map(int,input().split()))\r\nteam=set()\r\nans=[]\r\nfor i,num in enumerate(l,start=1):\r\n if num not in team:\r\n team.add(num)\r\n ans.append(i)\r\nif(len(team)>=k):\r\n print(\"YES\")\r\n for i in range(0,k):\r\n print(ans[i],end=\" \")\r\nelse:\r\n print(\"NO\")", "number_of_testcases = 1 #int(input())\r\nfor _ in range(number_of_testcases):\r\n num_students, size_of_team = map(int,input().split())\r\n rating = list(map(int,input().split()))\r\n ans = dict()\r\n for i in range(num_students):\r\n ans[rating[i]] = i + 1\r\n \r\n #print(ans) \r\n if(len(ans) >= size_of_team):\r\n print(\"YES\")\r\n count=0\r\n for i in ans:\r\n print(ans[i],end=\" \")\r\n count += 1\r\n if(count == size_of_team):\r\n break\r\n \r\n print()\r\n else:\r\n print(\"NO\")", "from sys import stdout\r\n\r\nn, k = map(int, input().split()); e = k\r\na = list(map(int, input().split()))\r\nteam = list(); result = list()\r\n\r\nfor i in range(n):\r\n if a[i] not in team:\r\n team.append(a[i]); result.append(str(i+1)); e -= 1\r\n if e == 0: break\r\n\r\nstdout.write(\"YES\\n\"+\" \".join(result) if len(result) == k else \"NO\")", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb={}\r\nfor i in range(len(a)):\r\n if a[i] not in b:\r\n b[a[i]]=i\r\nif len(b)<k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n c=0\r\n for i in b:\r\n if c==k:\r\n break\r\n print(b[i]+1,end=' ')\r\n c+=1\r\n print()", "from heapq import heapify,heappush,heappop,heappushpop\r\nfrom collections import defaultdict as dd, deque as dq,Counter as C\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nfrom bisect import bisect_left as bl ,bisect_right as br\r\nfrom itertools import combinations as c,permutations as p\r\nfrom math import factorial as f ,ceil,gcd,sqrt,log\r\nfrom sys import stdin\r\ninput = stdin.readline\r\nmp = lambda : map(int,input().split())\r\nit = lambda: int(input())\r\nls = lambda : list(input().strip().split())\r\nmt = lambda r : [ ls() for _ in range(r)]\r\nlcm = lambda a,b : (a*b)//gcd(a,b)\r\ndef fibo_n(n):\r\n\treturn (((1+sqrt(5))/2)**n)/sqrt(5)\r\n\r\na,b = mp()\r\nl = list(mp())\r\nk = set(l)\r\nd ={}\r\nfor i in range(len(l)):\r\n\tif l[i] in d:\r\n\t\tcontinue\r\n\td[l[i]]=i+1\r\nif len(k)<b:\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tk = list(k)\r\n\tfor j in range(b):\r\n\t\tprint(d[k[j]],end=\" \")\r\n\tprint()", "'''\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\n##print = sys.stdout.write(\"\\n\")\r\nfrom bdb import Breakpoint\r\nfrom functools import lru_cache\r\nfrom http.client import CONTINUE\r\nimport sys\r\nfrom math import log2\r\nimport bisect\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict\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,m = lii()\r\narr = lii()\r\nset1 = set(arr)\r\nset1 = list(set1)[:m];used = []\r\nfor i in set1: used.append(arr.index(i)+1)\r\nif len(set1)>=m: yes();print(*used)\r\nelse: no()", "x,y = map(int,input().split())\r\nz = list(map(int,input().split()))\r\ns = list(set(z))\r\n\r\n\r\nif len(s) >= y:\r\n print(\"YES\")\r\n \r\n for i in range(y): \r\n print(z.index(s[i])+1,end=\" \")\r\n \r\n \r\n \r\n\r\nelse:\r\n print(\"NO\")", "n,k=map(int,input().split())\r\nar=list(input().split())\r\ns=len(set(ar))\r\nif s<k:\r\n print('NO')\r\nelse:\r\n l=[]\r\n v=[]\r\n for i in range(n):\r\n if ar[i] not in v:\r\n v.append(ar[i])\r\n l.append(i+1)\r\n if len(l)==k:\r\n print('YES')\r\n print(*l)\r\n break\r\n\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nm=list(set(l))\r\nif len(m)>=k:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(l.index(m[i])+1,end=\" \")\r\nelse:\r\n print(\"NO\")\r\n", "n, k = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\nif len(set(a)) >= k:\r\n print(\"YES\")\r\n answer = ''\r\n s = []\r\n for j in range(n):\r\n if a[j] not in s:\r\n s.append(a[j])\r\n answer += str(j + 1) + ' '\r\n if len(s) == k:\r\n break\r\n print(answer)\r\nelse:\r\n print(\"NO\")\r\n", "import heapq\r\nimport math, itertools\r\nimport sys, collections\r\nimport bisect, queue\r\nimport copy\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\nn,m = map(int,input().split())\r\nlist1 = list(map(int,input().split()))\r\ntemp = {}\r\nfor i in range(n):\r\n if list1[i] not in temp:\r\n temp[list1[i]] = [i]\r\n else:\r\n temp[list1[i]].append(i)\r\nif len(temp) < m:\r\n print(\"NO\")\r\nelse:\r\n res = []\r\n num = 0\r\n for i in temp:\r\n res.append(temp[i][0]+1)\r\n num += 1\r\n if num == m:\r\n break\r\n print(\"YES\")\r\n print(*res)\r\n\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = set(a)\r\nif len(b) >= k:\r\n print(\"YES\")\r\n ans = []\r\n for i in range(n):\r\n f = True\r\n for j in ans:\r\n if a[j - 1] == a[i]:\r\n f = False\r\n break\r\n if f:\r\n ans.append(i + 1)\r\n if len(ans) == k:\r\n break\r\n print(\" \".join(map(str, ans)))\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ns = []\r\nh = []\r\nfor i in range(len(a)):\r\n if a[i] not in s:\r\n h.append(str(i + 1))\r\n s.append(a[i])\r\nif len(h) < k:\r\n print('NO')\r\n exit()\r\nprint('YES')\r\nprint(' '.join(h[:k]))", "n, k = map(int, input().split())\r\na = []\r\na += input().split()\r\nspch = []\r\nspind = []\r\n#print(a)\r\nfor i in range(len(a)):\r\n if a[i] in spch:\r\n continue\r\n elif len(spch)!=k:\r\n spch += [a[i]]\r\n spind += [i+1]\r\nif len(spch) == k:\r\n print(\"YES\")\r\n print(*spind)\r\nelse:\r\n print(\"NO\")\r\n", "n,k=map(int,input().split(\" \"))\r\ns=list(map(int,input().split(\" \")))\r\nr=list(set(s))\r\nre=''\r\nif len(r)>=k:\r\n for i in range(k):\r\n re=re+str(s.index(r[i])+1)+\" \"\r\n print(\"YES\")\r\n print(re)\r\nelse: print(\"NO\")\r\n", "x=input().strip().split()\r\ny=[int(num) for num in input().strip().split()]\r\nn=set(y)\r\nj=0\r\nif len(n)>=int(x[-1]):\r\n print(\"YES\")\r\n while j<int(x[-1]):\r\n for i in n:\r\n j+=1\r\n if j>int(x[-1]):\r\n break\r\n else:\r\n print(y.index(i)+1, end=\" \")\r\nelse:\r\n print(\"NO\")", "n=input()\r\nn=n.split(\" \")\r\nn=int(n[1])\r\ngrades=input()\r\ngrades=grades.split(\" \")\r\ngr=grades.copy()\r\ngrades=set(grades)\r\nif len(grades)>=n:\r\n ref=list()\r\n grades=list(grades)[:n]\r\n print(\"YES\")\r\n for num in grades:\r\n ref.append(str(gr.index(num)+1))\r\n ref.sort()\r\n print(\" \".join(ref))\r\nelse:print(\"NO\")\r\n", "n,m=map(int,input().split(\" \"))\na=input().split()\nb=list(set(a))\nif len(b)<m:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in range(m):\n print(a.index(b[i])+1,end=' ')\n \t\t \t\t \t \t \t\t \t \t\t \t \t", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = [] \r\nseen = set()\r\nfor i, student in enumerate(a):\r\n\tif student not in seen:\r\n\t\tseen.add(student)\r\n\t\tans.append(i + 1)\r\nif len(ans) >= k:\r\n\tprint(\"YES\")\r\n\tfor i in range(k):\r\n\t\tprint(ans[i], end = \" \")\r\nelse:\r\n\tprint(\"NO\")", "\"\"\"\r\n5 3\r\n15 13 15 15 12\r\n12 13 15 15 15\r\n\"\"\"\r\na,b = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nmp = {}\r\nbrr = []\r\nfor i in range(a):\r\n if arr[i] not in mp:\r\n mp[arr[i]] = i+1\r\n brr.append(i+1)\r\nif(len(brr)<b):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\\n\"+\" \".join(map(str, brr[:b])))\r\n", "n, k = map(int, input().split())\n\nl = list(map(int, input().split()))\n\ns = set(l)\n\nif len(s) >= k:\n\tprint(\"YES\")\n\tcount = 0\n\n\tfor i in s:\n\t\tif count < k:\t\n\t\t\tprint(l.index(i) + 1, end = \" \")\n\t\t\tcount += 1\n\nelse:\n\tprint(\"NO\")\n \t\t \t \t\t\t\t \t \t \t \t \t \t", "#%% 988a Diverse team \r\nn,k = map(int,input().split())\r\narr = [*map(int,input().split())]\r\nx = []; ind = []\r\nfor elem in arr:\r\n if elem not in x:\r\n ind+= [arr.index(elem)+1]\r\n x.append(elem)\r\n if len(x) == k:\r\n break \r\nif len(x)<k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(*ind)", "#for _ in range(int(input())):\r\n #n=int(input())\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=set(a)\r\nif(k<=len(b)):\r\n print(\"YES\")\r\n l=0\r\n for i in b:\r\n print(a.index(i)+1,end=\" \")\r\n l+=1\r\n if(l==k):\r\n break \r\n print()\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef solve():\n\tn, m = map(int, read().split())\n\ta = map(int, read().split())\n\td = dict()\n\tfor i, x in enumerate(a):\n\t\td[x] = i+1\n\tif len(d) >= m:\n\t\tprint(\"YES\")\n\t\tprint(\" \".join(str(x[1]) for x in list(d.items())[:m]))\n\telse:\n\t\tprint(\"NO\")\n\nsolve()\n", "inf=10**18\r\ndxy=[(0,1), (1,0), (-1, 0), (0, -1)]\r\nmod=10**9+7\r\nMOD=998244353\r\n\r\ndef solve():\r\n N, K = map(int, input().split()) \r\n A = [int(i) for i in input().split()]\r\n teams = set() \r\n ans = []\r\n for n,a in enumerate(A):\r\n if a in teams: continue\r\n ans.append(n+1)\r\n teams.add(a)\r\n \r\n if len(ans)<K:\r\n print(\"NO\")\r\n else:\r\n print(\"YES\")\r\n print(*ans[:K])\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nmain()", "n, k = map(int, input().split())\r\nb = [*map(int, input().split())]\r\nl = []\r\nfor i in b:\r\n if i not in l:\r\n l.append(i)\r\nif len(l) >= k:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(b.index(l[i]) + 1, end=\" \")\r\nelse:\r\n print(\"NO\")\r\n\r\n\r\n\r\n", "# n = int(input())\r\n# nq=list(map(int,input().split()))\r\n# arr=list(map(int,input().split()))\r\nnk=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nseen = set()\r\nres = []\r\nfor idx , rating in enumerate(arr):\r\n if rating not in seen:\r\n res.append(idx + 1)\r\n seen.add(rating)\r\n if len(res) == nk[1]:\r\n print('YES')\r\n print(*res)\r\n break\r\nelse:\r\n print('NO')\r\n ", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nL=set(l)\r\nif len(L)<k:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for _ in range(k):\r\n print(l.index(L.pop())+1,end=' ')", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nif len(set(l))<k:\r\n print('NO')\r\nelse:\r\n s=list(set(l))\r\n l1=[]\r\n for i in s:\r\n x=l.index(i)\r\n l1.append(x+1)\r\n l1=l1[:k]\r\n l1.sort()\r\n print('YES')\r\n print(' '.join(map(str,l1)))", "n,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nans = []\r\nfound = set()\r\nfor i,e in enumerate(a):\r\n if e not in found:\r\n found.add(e)\r\n ans.append(i+1)\r\nif len(ans)>=k:\r\n print(\"YES\")\r\n print(*(ans[:k]))\r\nelse:\r\n print(\"NO\")\r\n", "# https://codeforces.com/contest/988\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nidx = sorted(range(n), key=lambda i: a[i])\nteam = []\n\nfor i in range(n):\n if not team or a[team[-1]] != a[idx[i]]:\n team += [idx[i]]\n if len(team) == k:\n print(\"YES\")\n print(*[i + 1 for i in team])\n exit()\n\nprint(\"NO\")\n", "from collections import Counter, defaultdict\r\n\r\n\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\nd=Counter(a)\r\ni=0\r\nans=[]\r\nflag=0\r\n\r\nwhile k>0 and i<n:\r\n if d[a[i]]==1:\r\n ans.append(i+1)\r\n i+=1\r\n k-=1\r\n \r\n else:\r\n d[a[i]]-=1\r\n i+=1\r\n \r\nif k!=0:\r\n print('NO')\r\n \r\nelse:\r\n print('YES')\r\n print(*ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ntemp=list(set(a))\r\nif len(temp)<k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(a.index(temp[i])+1,end=\" \")\r\n ", "n,k = map(int,input().split())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nyn = \"NO\"\r\nans = []\r\nans2 = []\r\ncounter = 0\r\n\r\nif len(set(arr)) >= k:\r\n yn = \"YES\"\r\n for i in arr:\r\n counter += 1\r\n if i not in ans2:\r\n ans.append(counter)\r\n ans2.append(i)\r\n if len(ans) == k:\r\n break\r\n\r\nprint(yn)\r\nif yn == \"YES\":\r\n print(\" \".join(str(x) for x in ans))", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ns = set(arr)\r\nif len(s) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n print(*[(arr.index(i) + 1) for i in s][:k])\r\n\t\r\n", "a, b = map(int, input().split())\r\nl = input().split()\r\ns = set(l)\r\nc = 0\r\nif len(s) >= b:\r\n print('YES')\r\n for i in s:\r\n print(l.index(i)+1, end=' ')\r\n c += 1\r\n if c == b:\r\n break\r\nelse:\r\n print('NO')", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nif len(set(data)) >= k:\r\n print(\"YES\")\r\n for i in set(data):\r\n print(data.index(i) + 1, end=' ')\r\n k -= 1\r\n if k == 0:\r\n break\r\nelse:\r\n print(\"NO\")", "n,k = list(map(int,input().split()))\r\nskills = list(map(int,input().split()))\r\nans = []\r\nteam = []\r\ncnt = 0\r\ni = 0\r\nwhile i < n and cnt < k:\r\n\tif skills[i] not in team:\r\n\t\tteam.append(skills[i])\r\n\t\tans.append(i+1)\r\n\t\tcnt += 1\r\n\ti += 1\r\nif len(ans)==k:\r\n\tprint('YES')\r\n\tprint(*ans)\r\nelse:\r\n\tprint('NO')", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nls=set(a)\r\nif len(ls)<k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(a.index(list(ls)[i])+1,end=\" \")", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ns = list(set(lst))\r\nif len(set(lst)) < k:\r\n print('NO')\r\n\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(lst.index(s[i]) + 1, end=' ')", "\nnk = input()\n\nnk = nk.split(' ')\nnk = [int(m) for m in nk]\nn = nk[0]\nk = nk[1]\n\nestudantes = input().split()\nestudantes = [int(e) for e in estudantes]\n\nselecionados = []\nposicoes = []\n\nfor i, e in enumerate(estudantes):\n\n if len(selecionados) == k:\n break\n if e not in selecionados:\n selecionados.append(e)\n posicoes.append(str(i + 1))\n \nif len(selecionados) < k:\n print(\"NO\")\nelse:\n print(\"YES\\n\", ' '.join(posicoes))\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-17 23:20:02\nLastEditTime: 2021-11-17 23:27:55\nDescription: Diverse Team\nFilePath: CF988A.py\n'''\n\n\ndef func():\n _, k = map(int, input().strip().split())\n lst = list(map(int, input().strip().split()))\n if len(set(lst)) < k:\n print(\"NO\")\n else:\n print(\"YES\")\n index = []\n for item in list(set(lst))[0: k]:\n index.append(str(lst.index(item) + 1))\n print(\" \".join(index))\n\n\nif __name__ == '__main__':\n func()\n", "m, n = input().split()\r\narr = list(map(int, input().split()))\r\nnew_arr = list(set(arr))\r\n\r\nif len(new_arr) < int(n):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(int(n)):\r\n print(arr.index(new_arr[i])+1,end=' ')", "import sys\r\nfrom collections import Counter\r\n \r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef I():\r\n return input()\r\ndef II():\r\n return int(input())\r\ndef MI():\r\n return map(int, input().split())\r\ndef LI():\r\n return list(input().split())\r\ndef LII():\r\n return list(map(int, input().split()))\r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n\r\n\r\nclass Solution:\r\n @staticmethod\r\n def main():\r\n n, k = LII()\r\n lst = LII()\r\n dic = {x: i+1 for i, x in enumerate(lst)}\r\n if len(dic) >= k:\r\n print(\"YES\")\r\n print( ' '.join(map(str,sorted(list(dic.values())[:k]) )))\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\nSolution.main()", "n,k=map(int,input().split())\r\nrate=list(map(int,input().split()))\r\ndis=set(rate) \r\nc=0 \r\nl=[]\r\nif len(dis)>=k:\r\n print(\"YES\")\r\n for i in dis:\r\n if i in rate:\r\n if len(l)==k:\r\n break\r\n else:\r\n l.append(rate.index(i)+1)\r\n c+=1\r\n print(*l) \r\nelse:\r\n print(\"NO\") ", "n, m = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ncpy = list(set(a.copy()))\r\n\r\nif m > len(cpy):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(m):\r\n print(a.index(cpy[i])+1, end=' ')\r\n", "n, m = [int(i) for i in input().split()]\r\nkids = [int(i) for i in input().split()]\r\nr_kids = []\r\nr_kids_ = []\r\nfor i in range(n):\r\n if kids[i] not in r_kids_:\r\n r_kids.append(i + 1)\r\n r_kids_.append(kids[i])\r\n if len(r_kids) == m:\r\n break\r\n\r\nif len(r_kids) == m:\r\n print(\"YES\")\r\n print(*r_kids)\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n \r\nratings = dict()\r\nfor i in range(n):\r\n ratings[a[i]] = i+1\r\n \r\nif len(ratings) >= k:\r\n print(\"YES\")\r\n for i in list(ratings.values())[:k]:\r\n print(i, end=\" \")\r\nelse:\r\n print(\"NO\")", "#Diverse Team\n\na,b = tuple(input().split(\" \"))\na = int(a)\nb = int(b)\n\n\nratings = list(map(lambda n: int(n), input().split(\" \")))\nratings_set = set(ratings)\nif (len(ratings_set) < b):\n print(\"NO\")\nelse:\n print(\"YES\")\n result = []\n ratings_set = list(ratings_set)\n for i in range(0, b):\n result.append(str(ratings.index(ratings_set[i]) + 1))\n print(\" \".join(result))\n", "import sys\ninput = sys.stdin.readline\n\nrs = []\nfor _ in range(1) :\n N, K = map(int, input().split())\n A = list(map(int, input().split()))\n \n uqi = []\n uqs = set()\n for i, v in enumerate(A) :\n \tif v not in uqs :\n \t\tuqi.append(i+1)\n \t\tuqs.add(v)\n \t\n if len(uqi) < K : rs.append(\"NO\")\n else :\n \trs.append(\"YES\")\n \trs.append(\" \".join(map(str, uqi[:K])))\t\nprint(\"\\n\".join(rs))", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn, k = gets(int)\na = gets(int)\ns = set[int]()\nt = []\nfor i in range(n):\n if a[i] not in t:\n s.add(i)\n t += [a[i]]\n if len(s) == k:\n print('YES')\n print(*[i + 1 for i in s])\n break\nelse:\n print('NO')\n", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl2=list(set(l))\r\nif len(l2)<m:\r\n print(\"NO\")\r\n exit()\r\n\r\nans=[]\r\nfor i in range(m):\r\n ans.append(l.index(l2[i])+1)\r\nprint(\"YES\")\r\nans.sort()\r\nprint(*ans)\r\n ", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = []\r\na1 = []\r\nf = 0\r\nfor i in range(n):\r\n if len(a1) == k:\r\n f = 1\r\n \r\n break\r\n if a[i] not in a1:\r\n ans.append(i+1)\r\n a1.append(a[i])\r\n \r\nif len(a1) == k:\r\n f = 1\r\nif f:\r\n print(\"YES\")\r\n print(*ans)\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\ns = list(map(int, input().split()))\r\nd = list(set(s))\r\nif len(d) >= k:\r\n print('YES')\r\n b = []\r\n for i in range(k):\r\n b.append(s.index(d[i]) + 1)\r\n print(*b)\r\nelse:\r\n print('NO')", "n,k = list(map(int, input().split()))\r\narr = list(map(int, input().split())) \r\n\r\narr_set = set()\r\nans_list = []\r\n\r\nfor index, num in enumerate(arr):\r\n if not num in arr_set:\r\n arr_set.add(num)\r\n ans_list.append(index+1)\r\n\r\nif k > len(arr_set):\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in range(k):\r\n print(ans_list[i], end= ' ')\r\n ", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\nln = len(set(arr))\r\nst = list(set(arr))\r\nif ln<k:\r\n\tprint(\"NO\")\r\nelse:\r\n\tans =[]\r\n\tfor i in range(k):\r\n\t\tans.append(arr.index(st[i])+1)\r\n\tprint('YES')\r\n\tprint(*ans)\r\n", "n,k=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nif(k>len(set(x))):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n p=set(x)\r\n temp=list(p)\r\n for i in range(0,k):\r\n m=temp[i]\r\n print(x.index(m)+1,end=\" \")", "n,k = (map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\ns = set(arr)\r\nif k>len(s) :\r\n print(\"NO\")\r\nelse :\r\n dif = []\r\n ans=\"\"\r\n i = 0\r\n while len(dif)<k :\r\n while i<n :\r\n if arr[i] not in dif :\r\n dif.append(arr[i])\r\n ans+=str(i+1)+\" \"\r\n break\r\n i+=1\r\n print(\"YES\")\r\n print(ans)\r\n ", "n,k=[int(w) for w in input().split()]\r\nx=[int(w) for w in input().split()]\r\nif len(set(x))>=k:\r\n print('YES')\r\n m=[]\r\n s=' '\r\n for i in set(x):\r\n m.append(str(x.index(i)+1))\r\n if len(m)==k:\r\n break\r\n print(s.join(m))\r\nelse:\r\n print('NO')\r\n ", "from sys import stdin, stdout\r\n\r\n\r\ndef dfs(v, mas, path):\r\n if len(path) == 3:\r\n return True\r\n if path[-1] != mas[v]:\r\n dfs(mas[v], mas, path+[mas[v]])\r\n return False\r\n\r\n\r\ndef solve():\r\n n, k = (int(s) for s in stdin.readline().split())\r\n mas = [int(s) for s in stdin.readline().split()]\r\n\r\n if len(set(mas)) >= k:\r\n ans = []\r\n ans_s = set()\r\n for i in range(k):\r\n for j in range(n):\r\n if mas[j] not in ans_s:\r\n ans.append(j+1)\r\n ans_s.add(mas[j])\r\n break\r\n\r\n print('YES')\r\n print(' '.join(str(s) for s in ans))\r\n else:\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "def form_team(n, team_size, ratings_list):\r\n rating_set = set(ratings_list)\r\n\r\n if len(rating_set) >= team_size:\r\n print(\"YES\")\r\n team = []\r\n for i, rating in enumerate(ratings_list):\r\n if rating in rating_set:\r\n team.append(i + 1)\r\n rating_set.remove(rating)\r\n team_size -= 1\r\n if team_size == 0:\r\n break\r\n print(*team)\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == \"__main__\":\r\n n, k = map(int, input().split())\r\n ratings = list(map(int, input().split()))\r\n form_team(n, k, ratings)\r\n", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ns = list(set(lst))\r\nif len(s)<k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(lst.index(s[i])+1, end=\" \")", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(set(A))[:k]\r\nif len(B) == k:\r\n print('YES')\r\n print(*[A.index(a)+1 for a in B])\r\nelse:\r\n print('NO')\r\n", "n,k=list(map(int,input().split()))\r\nl=list(map(int,input().split()))\r\nliste=[]\r\nt=0\r\nreq=[]\r\nfor i in range(len(l)):\r\n if l[i] not in liste:\r\n liste.append(l[i])\r\n req.append(i+1)\r\n if len(req)==k:\r\n t=1\r\n print(\"YES\")\r\n print(*req)\r\n break\r\nif t==0:\r\n print(\"NO\")\r\n", "from audioop import reverse\r\nfrom cmath import *\r\nfrom math 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#ord -> chuyen asciiz thanh int\r\n\r\n\r\ndef solves():\r\n n,k=_input()\r\n a=_list()\r\n s=list(set(a))\r\n if (len(s)>=k):\r\n print(\"YES\")\r\n for i in range(k):\r\n print(a.index(s[i])+1,end=' ')\r\n else:\r\n print(\"NO\")\r\n\r\n \r\nt=1\r\n#t =int(input())\r\nfor _ in range(0,t):\r\n solves()\r\n", "n, k = map(int, input().split())\r\nratings = list(map(int, input().split()))\r\nunic_ratings = []\r\nunic_indexes = []\r\nfor i, rat in enumerate(ratings):\r\n if rat not in unic_ratings:\r\n unic_ratings.append(rat)\r\n unic_indexes.append(i + 1)\r\nif len(unic_indexes) >= k:\r\n print('YES')\r\n for i in unic_indexes[:k]:\r\n print(i, end = ' ')\r\nelse:\r\n print('NO')", "n,m=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\np= list(dict.fromkeys(k))\r\nlist=[]\r\nfor x in p:\r\n for i in k:\r\n if x==i:\r\n list.append(k.index(x)+1)\r\n break\r\nlist=list[0:m]\r\nmy_string=\"\"\r\nif len(list)==m:\r\n print(\"YES\")\r\n my_string=' '.join(map(str,list))\r\n print(my_string)\r\nelse:\r\n print(\"NO\")", "n, k = map(int, input().split())\r\narr = [*map(int, input().split())]\r\ncheck, ind = set(), []\r\nfor i in range(n):\r\n if arr[i] not in check:\r\n ind.append(i+1)\r\n check.add(arr[i])\r\nif len(check) < k:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(k):\r\n print(ind[i], end=\" \")", "n , k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nmatrix = [-1]*101\r\nans = []\r\nfor i in range(len(a)):\r\n if matrix[a[i]] == -1:\r\n ans.append(i+1)\r\n matrix[a[i]] = 0\r\n\r\n if len(ans) == k:\r\n print(\"YES\")\r\n print(*ans, end=\" \")\r\n break\r\nif len(ans) < k:\r\n print(\"NO\")", "n, k = (int(i) for i in input().split())\na = (int(i) for i in input().split())\nres, uniq = [], set()\nfor i, ai in enumerate(a):\n if ai not in uniq:\n uniq.add(ai)\n res.append(i + 1)\n if len(res) >= k:\n break\nif len(res) >= k:\n print(\"YES\")\n print(*res)\nelse:\n print(\"NO\")\n", "n, k =map(int, input().split())\r\na = list(map(int, input().split()))\r\nused = set()\r\nans = []\r\nfor i in range(n):\r\n if a[i] not in used:\r\n used.add(a[i])\r\n ans.append(i + 1)\r\nif len(ans) >= k:\r\n print(\"YES\")\r\n print(*ans[:k])\r\nelse:\r\n print(\"NO\")", "n,k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = set()\r\notv = []\r\ns = 0\r\nboo = True\r\nfor i in range(n):\r\n if a[i] not in b:\r\n b.add(a[i])\r\n otv.append(i+1)\r\n s += 1\r\n if s == k:\r\n print(\"YES\")\r\n print(\" \".join(map(str, otv)))\r\n boo = False\r\n break\r\nif boo:\r\n print(\"NO\")\r\n", "from sys import stdin, stdout\r\n\r\n_, k = stdin.readline().split()\r\nk = int(k)\r\n\r\nscores = stdin.readline().split()\r\n\r\noccurences = set()\r\nresult = []\r\nfor index, value in enumerate(scores):\r\n if k == 0:\r\n break\r\n if value in occurences:\r\n continue\r\n occurences.add(value)\r\n k -= 1\r\n result.append(str(index + 1))\r\nif k == 0:\r\n print(\"YES\")\r\n stdout.write(\" \".join(result))\r\nelse:\r\n print(\"NO\")", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n locs = {x: i for i, x in enumerate(A, 1)}\r\n\r\n if len(locs) < k:\r\n print('NO')\r\n else:\r\n print('YES')\r\n it = iter(locs.values())\r\n print(*[next(it) for _ in range(k)])\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = set(a)\r\nif len(b) < k:\r\n print(\"NO\")\r\nelse:\r\n li = []\r\n idx = {}\r\n for i in range(n):\r\n if a[i] not in idx:\r\n idx[a[i]] = i+1\r\n li.append(i+1)\r\n k -= 1\r\n if k == 0:\r\n break\r\n print(\"YES\")\r\n print(*li)\r\n", "n, k = map(int, input().split())\r\nlst, cnt, res = list(map(int, input().split())), [False] * 101, []\r\nfor x in range(n):\r\n if not cnt[lst[x]]:\r\n cnt[lst[x]], k = True, k - 1\r\n if k >= 0: res.append(x + 1)\r\nif k <= 0:\r\n print(\"YES\")\r\n print(*res)\r\nelse: print(\"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\nw = [0] + list(map(int, input().split()))\r\np = int(input())\r\nx, s = [], [0] * (n + 3)\r\nfor i in range(p):\r\n a, b = map(int, input().split())\r\n s[b + 2] += 1\r\n x.append(b)\r\n x.append(a * p + i)\r\nfor i in range(3, n + 3):\r\n s[i] += s[i - 1]\r\na = [0] * p\r\nd = [0] * p\r\nfor i in range(0, 2 * p, 2):\r\n b = x[i] + 1\r\n a0, j = divmod(x[i + 1], p)\r\n a[s[b]], d[s[b]] = a0, j\r\n s[b] += 1\r\nans = [0] * p\r\nc = [0] * (n + 1)\r\nfor b in range(1, n + 1):\r\n if s[b] == s[b + 1]:\r\n continue\r\n s0 = set()\r\n for i in range(s[b], s[b + 1]):\r\n s0.add(a[i] % b)\r\n for i in s0:\r\n j = (n - i) // b * b + i\r\n c[j] = w[j]\r\n j -= b\r\n while j > 0:\r\n c[j] = c[j + b] + w[j]\r\n j -= b\r\n for i in range(s[b], s[b + 1]):\r\n ans[d[i]] = c[a[i]]\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "a,b = (map(int,input().split()))\r\ndic = {}\r\nfor i in range(b):\r\n a = input().split(' ')\r\n if(len(a[0])>len(a[1])):\r\n dic[a[0]] = a[1]\r\n dic[a[1]] = a[1]\r\n else:\r\n dic[a[0]] = a[0]\r\n dic[a[1]] = a[0]\r\nt = input().split()\r\nfor i in range(len(t)):\r\n print(dic[t[i]],end = ' ')", "n , m = map(int , input().split())\r\na = {}\r\nfor i in range(m):\r\n aa, bb = input().split()\r\n a[aa] = bb\r\nfor i in input().split():\r\n print(min(i , a[i], key = len ) , end=' ')", "n , m = map(int, input().split(\" \"))\r\nnotes = {}\r\nfinal = []\r\nfor i in range(m):\r\n a,b = map(str, input().split())\r\n notes[a]=b\r\nc = list(map(str, input().split(\" \")[:n]))\r\nfor i in c:\r\n if len(notes[i])>=len(i):\r\n final.append(i)\r\n else:\r\n final.append(notes[i])\r\nprint(\" \".join(final))", "\r\nn, m = map(int, input().split())\r\n\r\n\r\nlanguage1_to_shorter = {}\r\nlanguage2_to_shorter = {}\r\n\r\n\r\nfor i in range(m):\r\n word1, word2 = input().split()\r\n if len(word1) <= len(word2):\r\n language1_to_shorter[word1] = word1\r\n language2_to_shorter[word1] = word1\r\n language1_to_shorter[word2] = word1\r\n language2_to_shorter[word2] = word1\r\n else:\r\n language1_to_shorter[word1] = word2\r\n language2_to_shorter[word1] = word2\r\n language1_to_shorter[word2] = word2\r\n language2_to_shorter[word2] = word2\r\n\r\n\r\nlecture_text = input().split()\r\n\r\n\r\nlecture_shorter = [language1_to_shorter[word] for word in lecture_text]\r\n\r\n\r\nprint(\" \".join(lecture_shorter))\r\n", "n, m = [int(i) for i in input().split()]\r\nlanguages = {}\r\nfor i in range(m):\r\n f, s = input().split()\r\n languages[f] = (s, len(f), len(s))\r\n\r\np = input().split()\r\nfor i in range(n):\r\n el = languages[p[i]]\r\n if el[2] < el[1]:\r\n p[i] = el[0]\r\n\r\nprint(*p)", "from collections import defaultdict\r\n\r\n\r\ndef sexy(a,b):\r\n if len(a)>len(b):\r\n return b\r\n else:\r\n return a\r\nn,m= map(int,input().split())\r\nx=defaultdict(lambda:'z'*26)\r\nfor i in range(m):\r\n a,b =input().split()\r\n x[a] = b\r\ny=input().split()\r\nfor i in y:\r\n print(sexy(i,x[i]),end=\" \")\r\nprint()", "n, m = map(int, input().split())\r\ndict = {}\r\nfor i in range(m):\r\n str1, str2 = input().split()\r\n dict[str1] = str2\r\nprof = input().split()\r\nres = []\r\nfor i in prof:\r\n if len(dict[i]) < len(i):\r\n res.append(dict[i])\r\n else:\r\n res.append(i)\r\nres = \" \".join(res)\r\nprint(res)\r\n", "n,m = map(int,input().split())\r\nm1 = {}\r\nm2 = {}\r\nm3 = {}\r\nfor i in range(m):\r\n s1,s2 = map(str,input().split())\r\n m1[s1] = len(s1)\r\n m2[s1] = [len(s2),s2]\r\n\r\nl = list(map(str,input().split()))\r\nfor i in range(n):\r\n if m2[l[i]][0]<m1[l[i]]:\r\n print(m2[l[i]][1],end=\" \")\r\n else:\r\n print(l[i],end=\" \")\r\n ", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n words[a] = a\r\n else:\r\n words[a] = b\r\nw = input().split()\r\nfor wi in w:\r\n print(words[wi], end=' ')\r\n", "n,m = map(int, input().split())\r\nl = dict()\r\no= []\r\nfor i in range(m):\r\n s,s1 = input().split()\r\n l[s] = s1\r\n\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = a[i] if len(l[a[i]]) >= len(a[i]) else l[a[i]]\r\nprint(\" \".join(a))", "from sys import stdin, stdout\r\ndef istr(): return input()\r\ndef inum(): return int(stdin.readline())\r\ndef imul(): return map(int, stdin.readline().split())\r\ndef ilst(): return list(map(int, stdin.readline().split()))\r\ndef splt(): return list(stdin.readline().strip())\r\nmax_itr = 100000000\r\n\r\n# Code\r\n\r\n \r\nn,m = imul()\r\naa = {}\r\nfor i in range(m):\r\n a,b = input().split()\r\n aa[a] = b \r\nzz = input()\r\nbb = zz.split()\r\nfor i in bb:\r\n if(len(str(i))<=len(aa[str(i)])):\r\n print(i, end = ' ')\r\n else:\r\n print(aa[i], end = ' ')\r\n", "#499B (75No. Problem B)\r\nn,m = map(int,input().split())\r\ndic = {}\r\nfor i in range(m):\r\n f,s = map(str,input().split())\r\n if len(f) <= len(s):\r\n dic[f] = f\r\n else:\r\n dic[f] = s \r\n# print(dic) \r\nsen = list(map(str,input().split()))\r\nresult = []\r\nfor i in range(n):\r\n result.append(dic[sen[i]])\r\nprint(*result)\r\n", "def main():\r\n a,b=input().split()\r\n a,b=int(a),int(b)\r\n prepod=[]\r\n neprepod=[]\r\n for i in range(b):\r\n s1,s2=input().split()\r\n prepod.append(s1)\r\n neprepod.append(s2)\r\n otvet=''\r\n text=input().split()\r\n for i in range(a):\r\n if len(neprepod[prepod.index(text[i])])>=len(text[i]):\r\n otvet+=text[i]+\" \"\r\n else:\r\n otvet+=neprepod[prepod.index(text[i])]+\" \"\r\n return otvet\r\n\r\n\r\nprint(main())", "a,b=map(int,input().split())\r\nlst,lst2,string,res=[],[],\"\",\"\"\r\nfor i in range(b):\r\n x1,x2=input().split()\r\n lst.append(x1)\r\n lst.append(x2)\r\nstring=input()\r\nlst2=string.split()\r\nfor i in range(len(lst2)):\r\n if lst2[i] in lst:\r\n if len(lst[lst.index(lst2[i])+1])<len(lst2[i]):\r\n res+=lst[lst.index(lst2[i])+1]\r\n else:\r\n res+=lst2[i]\r\n res+=\" \"\r\nprint(res)\r\n", "n , m = map(int,input().split())\r\nd = dict()\r\nfor _ in range(m):\r\n a , b = input().split()\r\n if(len(a)<=len(b)):\r\n d[a] = a\r\n else:\r\n d[a] = b\r\ns = list(input().split())\r\nfor i in s : \r\n print(d[i],end=\" \")", "string1 = []\r\nstring2 = []\r\n_ , num = map(int,input().split())\r\nfor i in range(num):\r\n x , y = input().split()\r\n string1.append(x)\r\n string2.append(y)\r\nstring = input().split()\r\nfor i in range(len(string)):\r\n for j in string1:\r\n if j == string[i]:\r\n if len(j) <= len(string2[string1.index(j)]):\r\n print(j,end=\" \") \r\n else:\r\n print(string2[string1.index(j)],end=\" \")", "n,m=map(int,input().split())\r\na={}\r\nfor i in range(m):\r\n s1,s2=map(str,input().split())\r\n a[s1]=s2\r\nb=list(map(str,input().split()))\r\nfor i in b[0:-1]:\r\n if len(i)<=len(a[i]):\r\n print(i,end=' ')\r\n else:\r\n print(a[i],end=' ')\r\ni=b[-1]\r\nif len(i) <= len(a[i]):\r\n print(i, end=' ')\r\nelse:\r\n print(a[i], end=' ')\r\n", "import sys\r\n\r\ndata = sys.stdin.read().strip().split('\\n')\r\n_, *lines, lecture = data\r\nd = {}\r\n\r\nfor line in lines:\r\n short, long = sorted(line.split(), key=len)\r\n d[long] = short\r\n\r\nprint(' '.join(d[word] if word in d else word for word in lecture.split()))", "\r\n\r\n\r\nn,m = map(int,input().split())\r\nhash = {}\r\nfor i in range(m):\r\n s1,s2 = input().split()\r\n hash[s1] = s2\r\n hash[s2] = s1\r\na = list(map(str,input().split()))\r\nfor i in range(len(a)):\r\n if len(a[i]) > len(hash[a[i]]):\r\n a[i] = hash[a[i]]\r\n\r\nprint(\" \".join(map(str,a)))\r\n ", "n, m = map(int, input().split())\r\nmp = dict()\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n mp[a] = b\r\nans = []\r\nc = list(map(str, input().split()))\r\nfor i in c:\r\n if len(i) <= len(mp[i]):\r\n ans.append(i)\r\n else:\r\n ans.append(mp[i])\r\nprint(*ans)\r\n", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n a, b = map(str, input().split())\r\n if len(a) < len(b):\r\n words[a] = a\r\n words[b] = a\r\n elif len(b) < len(a):\r\n words[a] = b\r\n words[b] = b\r\n else:\r\n words[a] = a\r\n words[b] = a\r\nc = list(map(str, input().split()))\r\nprint(\" \".join(words[ci] for ci in c))", "n, m = list(map(int, input().split()))\r\nmaps = dict()\r\nfor count in range(m):\r\n words = input().split()\r\n maps[words[0]] = words[1]\r\nlecture = input().split()\r\nfor word in lecture:\r\n if len(word) > len(maps[word]):\r\n print(maps[word], end=\" \")\r\n elif len(word) < len(maps[word]):\r\n print(word, end=' ')\r\n else:\r\n print(word, end=\" \")\r\n", "n, m = list(map(int, input().split()))\r\nw1 = []\r\nw2 = []\r\nfor i in range(m):\r\n a, b = input().split()\r\n w1.append(a)\r\n w2.append(b)\r\n\r\nprof = input().split()\r\nteacher = []\r\nfor i in prof:\r\n if i in w1:\r\n ne = w1.index(i)\r\n ot = w2[ne]\r\n if len(i) <= len(ot):\r\n teacher.append(i)\r\n else:\r\n teacher.append(ot)\r\n if i in w2:\r\n ne = w2.index(i)\r\n ot = w1[ne]\r\n if len(i) <= len(ot):\r\n teacher.append(i)\r\n else:\r\n teacher.append(ot)\r\n\r\nprint(\" \".join(teacher))", "# Problem: B. Lecture\r\n# Contest: Codeforces - Codeforces Round #284 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/499/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\n\"\"\" Python 3 compatibility tools. \"\"\"\r\nimport math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n # Taking integer inputs\r\n return (int(input()))\r\n\r\ndef inlt():\r\n # Taking list inputs of int's\r\n return (list(map(int, input().split())))\r\n\r\ndef insr():\r\n # For taking string inputs, returns list of chars, which is easier to use\r\n # in Python.\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n \r\ndef inwl():\r\n s = input()\r\n return list(map(str, s.split()))\r\n\r\ndef invr():\r\n # For taking space separated integer var inputs\r\n return (map(int, input().split()))\r\n\r\n\r\ndef debug(*args, **kwargs):\r\n '''Debug print'''\r\n # print(*args, **kwargs)\r\n pass\r\n\r\nnm = inlt()\r\nn = nm[0]\r\nm = nm[1]\r\n\r\nprof_lang = {}\r\nnotes = []\r\nfor i in range(0, m):\r\n words = inwl()\r\n # Choose shorter of the words, first if even\r\n w1 = len(words[0])\r\n w2 = len(words[1])\r\n if w1 <= w2:\r\n prof_lang[words[0]] = words[0]\r\n else:\r\n prof_lang[words[0]] = words[1]\r\ndebug(prof_lang)\r\ndialogue = inwl()\r\nfor word in dialogue:\r\n notes.append(prof_lang[word])\r\ndebug(notes)\r\nprint(*notes)\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split(' '))\r\n d[a]=b\r\nl=list(map(str,input().split()))\r\nfor i in l:\r\n if len(i)<=len(d[i]):\r\n print(i,end=' ')\r\n else:\r\n print(d[i],end=' ')\r\n ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = dict(input()[:-1].split() for _ in range(m))\r\nprint(*[min(i, d[i], key=len) for i in input()[:-1].split()])", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(m):\r\n x,y=map(str,input().split(\" \"))\r\n a.append(x)\r\n b.append(y)\r\ns=list(input().split(\" \"))\r\nfor i in range(n):\r\n if(len(a[a.index(s[i])])>len(b[a.index(s[i])])):\r\n s[i]=b[a.index(s[i])]\r\n else:\r\n s[i]=a[a.index(s[i])]\r\nprint(*s)", "n, m = map(int, input().split())\r\nsave = {}\r\nfor _ in range(m):\r\n x, y = input().split()\r\n save[x] = y\r\n\r\nlecture = input()\r\noutput = []\r\nfor noun in lecture.split():\r\n if len(noun) > len(save[noun]):\r\n output.append(save[noun])\r\n else:\r\n output.append(noun)\r\nprint(*output)\r\n", "def lecture(dct,sentence):\r\n lst=[]\r\n for word in sentence:\r\n mapp=dct[word]\r\n if len(mapp)<len(word):\r\n lst.append(mapp)\r\n else:\r\n lst.append(word)\r\n return ' '.join(lst)\r\nn,m=map(int,input().split())\r\ndct={}\r\nfor _ in range(m):\r\n words=input().split(' ')\r\n dct[words[0]]=words[1]\r\nsentence=input().split(' ')\r\nprint(lecture(dct,sentence))\r\n ", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(m):\r\n a=list(map(str,input().split()))\r\n l.append(a)\r\nb=list(map(str,input().split()))\r\nfor i in b:\r\n for j in l:\r\n if i in j:\r\n if len(j[0])>len(j[1]):\r\n print(j[1],end=\" \")\r\n else:\r\n print(j[0],end=\" \")\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nlanguage_dict = {}\r\nfor _ in range(m):\r\n ai, bi = input().split()\r\n language_dict[ai] = bi\r\n\r\nlecture = input().split()\r\nnotes = []\r\nfor word in lecture:\r\n corresponding_word = language_dict[word]\r\n if len(word) <= len(corresponding_word):\r\n notes.append(word)\r\n else:\r\n notes.append(corresponding_word)\r\n\r\nprint(' '.join(notes))\r\n", "word_in_lecture, word_in_language = (int(x) for x in input().split())\r\ni = 0\r\nlanguage_dict = {}\r\nwhile i < word_in_language:\r\n\tlang1, lang2 = (x for x in input().split())\r\n\tlanguage_dict[lang1] = lang2\r\n\ti += 1\r\nlecture = input()\r\nstudent_note = ''\r\nfor word in lecture.split():\r\n\tif len(word) <= len(language_dict[word]):\r\n\t\tstudent_note += word + ' '\r\n\telse:\r\n\t\tstudent_note += language_dict[word] + ' '\r\nprint(student_note)", "def main() -> str:\r\n n, m = tuple(int(x) for x in input().split())\r\n my_dict = {}\r\n for i in range(m):\r\n w1, w2 = input().split()\r\n my_dict[w1] = w1 if len(w1) <= len(w2) else w2\r\n text = input().split()\r\n for i in range(n):\r\n text[i] = my_dict[text[i]]\r\n return \" \".join(text)\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n,m = map(int,input().split())\r\nd = dict()\r\nfor i in range(m):\r\n s = input()\r\n s = s.split(\" \")\r\n d[s[0]] = s[1]\r\n\r\nl = input()\r\nl = l.split(\" \")\r\n\r\nans = []\r\nfor i in range(n):\r\n if l[i] in d.keys():\r\n if len(l[i])>len(d[l[i]]):\r\n ans.append(d[l[i]])\r\n else:\r\n ans.append(l[i])\r\n else:\r\n for i in d.keys():\r\n if d[i] == l[i]:\r\n x = i\r\n if len(x)>len(l[i]):\r\n ans.append(l[i])\r\n else:\r\n ans.append(x)\r\n\r\nansf = \"\"\r\nfor i in range(len(ans)):\r\n \r\n ansf+=ans[i]\r\n if i!=len(ans)-1:\r\n ansf+=\" \"\r\n\r\nprint(ansf)", "n,m = map(int, input().split())\r\na = []\r\nb = []\r\nfor _ in range(m):\r\n i,j = map(str, input().split())\r\n a.append(i)\r\n b.append(j)\r\nspeech = list(map(str, input().split()))\r\nfor i in range(n):\r\n temp = a.index(speech[i])\r\n if len(a[temp]) <= len(b[temp]):\r\n pass\r\n else:\r\n speech[i] = b[temp]\r\nprint(\" \".join(speech))", "a,b=map(int,input().split())\r\nc={}\r\nfor i in range(b):\r\n ai,bi=input().split()\r\n aa=len(ai)\r\n bb=len(bi)\r\n if aa>bb:\r\n c[ai]=bi\r\n else:\r\n c[ai]=ai\r\ns=list(input().split())\r\nfor i in s:\r\n print(c[i],end=\" \")", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n words[a] = b\r\n\r\nc = input()\r\nans = []\r\nfor cc in c.split():\r\n if len(cc) <= len(words[cc]):\r\n ans.append(cc)\r\n else:\r\n ans.append(words[cc])\r\nprint(' '.join(ans))", "from collections import *\r\nfrom bisect import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom fractions import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nt=1\r\ndef r(a):\r\n return ((a*(a-1))//2)\r\nwhile(t):\r\n t-=1\r\n n,m=map(int,input().split())\r\n f={}\r\n for i in range(m):\r\n a=input().split()\r\n if(len(a[0])==len(a[1])):\r\n continue\r\n if(len(a[0])>len(a[1])):\r\n f[a[0]]=a[1]\r\n else:\r\n f[a[1]]=a[0]\r\n b=input().split()\r\n for i in b:\r\n if(i not in f):\r\n print(i,end=\" \")\r\n else:\r\n print(f[i],end=\" \")\r\n print()\r\n", "n , m = list(map(int,input().split()))\r\nall_letters = []\r\nfor i in range(m):\r\n words = input().split()\r\n all_letters.append(words)\r\nsentence = input().split()\r\nfor i in range(n):\r\n for j in range(len(all_letters)):\r\n if sentence[i] == all_letters[j][0]:\r\n if len(all_letters[j][0]) == len(all_letters[j][1]):\r\n sentence[i] = all_letters[j][0]\r\n elif len(all_letters[j][0]) > len(all_letters[j][1]):\r\n sentence[i] = all_letters[j][1]\r\nprint(*sentence)", "from sys import stdin\r\nn,m = map(int,stdin.readline().split())\r\nd = {}\r\nfor _ in range(m):\r\n a,b = stdin.readline().split()\r\n d[a] = a if len(a)<= len(b) else b\r\nfor i in stdin.readline().split():\r\n print(d[i],end=\" \")", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range (0,m):\r\n s=input().split()\r\n d[s[0]]=s[1]\r\nfor s in input().split():\r\n print(s if len(s)<=len(d[s]) else d[s],end=\" \")", "n,m = map(int,input().split())\r\nhashmap = {}\r\nfor _ in range(m):\r\n first,second = input().split()\r\n if len(second) >= len(first):\r\n second = first\r\n hashmap[first] = second\r\ntext = input().split(\" \")\r\nfor i in range(n):\r\n text[i] = hashmap[text[i]]\r\nprint(\" \".join(text))\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 d = dict()\r\n for _ in range(m):\r\n a, b = input().split()\r\n d[a] = b\r\n ls = list(input().split())\r\n for s in ls:\r\n mn = min(s, d[s], key=len)\r\n print(mn, end=' ')\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "n,m= [int(x) for x in input().strip().split()]\n\nword_dict={}\nfor i in range(m):\n\n a_i,b_i=[str(x) for x in input().strip().split()]\n\n if len(a_i)<=len(b_i):\n word_dict[a_i]=a_i\n word_dict[b_i]=a_i\n else:\n word_dict[a_i]=b_i\n word_dict[b_i]=b_i\n\nlecture_words = [str(x) for x in input().strip().split()]\ntranslated_words = []\nfor word in lecture_words:\n translated_words.append(word_dict[word])\nprint(\" \".join(translated_words))\n\n\n\n", "n, m = [int(i) for i in input().split()]\r\nd = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n d[a] = b\r\nres=[]\r\nfor c in input().split():\r\n if len(c)<=len(d[c]):\r\n res.append(c)\r\n else:\r\n res.append(d[c])\r\nprint(\" \".join(res))", "n, m = [int(i) for i in input().split()]\ndict = {}\n\nfor i in range(m):\n key, value = input().split()\n if len(key) > len(value):\n dict[key] = value\n\nstr = input().split()\n\nfor i in range(len(str)):\n if str[i] in dict:\n str[i] = dict[str[i]]\n\nprint(' '.join(str))", "n,m = map(int,input().split())\r\na1, b1 = [], []\r\nfor _ in range(m):\r\n a, b = input().split()\r\n a1.append(a)\r\n b1.append(b)\r\nc = list(input().split())\r\nfor i in c:\r\n j = a1.index(i)\r\n if(len(a1[j]) <= len(b1[j])):\r\n print(a1[j], end=\" \")\r\n else:\r\n print(b1[j], end=\" \")", "n, m = list(map(int, input().split()))\r\nd = {}\r\nfor _ in range(m):\r\n x, y = input().split()\r\n d[x] = y\r\ntext = input().split()\r\nres = []\r\nfor word in text:\r\n if len(word) <= len(d[word]):\r\n res.append(word)\r\n else:\r\n res.append(d[word])\r\nprint(\" \".join(res))", "n, m = map(int,input().split())\r\ntranslation = {}\r\nans = \"\"\r\nfor _ in range(m):\r\n first, second = input().split()\r\n if len(first)<=len(second) :\r\n translation[first] = first\r\n translation[second] = first\r\n else:\r\n translation[second] = second\r\n translation[first] = second\r\nlecture = input().split(\" \")\r\nfor j in lecture:\r\n ans += translation[j] + \" \"\r\nprint(ans)\r\n", "n,m=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(m):\r\n a,b = [str(x) for x in input().split()]\r\n if len(a)<=len(b):\r\n d[a]=a\r\n else:\r\n d[a]=b\r\n\r\ns=[str(x) for x in input().split()]\r\nfor i in s:\r\n print(d[i],end= \" \")\r\nprint()\r\n", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tn, m = map(int, input().split())\r\n\t\tresult = \"\"\r\n\t\twords = dict()\r\n\t\t\r\n\t\tfor i in range(m):\r\n\t\t\ta, b = input().split()\r\n\r\n\t\t\tif len(a) <= len(b):\r\n\t\t\t\twords[a] = a\r\n\t\t\t\twords[b] = a\r\n\t\t\telse:\r\n\t\t\t\twords[a] = b\r\n\t\t\t\twords[b] = b\r\n\r\n\t\tline = list(input().split())\r\n\t\tfor word in line:\r\n\t\t\tresult += words[word] + \" \"\r\n\r\n\t\tprint(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "n, m = map(int, input().split())\r\ndict = {}\r\n\r\nfor i in range(m):\r\n value1 , value2 = input().split()\r\n dict[value1] = min(value1, value2, key= lambda x : len(x))\r\n\r\nsentense = input().split()\r\nfor word in sentense:\r\n print(dict[word], end= \" \")", "n,m = input().split(' ')\r\nn,m = int(n),int(m)\r\nd = {}\r\nfor i in range(m):\r\n a , b = input().split(' ')\r\n d[a] = b\r\n d[b] = a\r\nl = []\r\nc = input().split(' ')\r\nfor h in c:\r\n r1 = h\r\n r2 = d[h]\r\n if len(r1)<=len(r2):\r\n l.append(r1)\r\n else:\r\n l.append(r2)\r\nprint(' '.join(l))", "n,m=map(int,input().split())\r\nd={}\r\nfirst=[]\r\nfor i in range(m):\r\n\ta,b=map(str,input().split())\r\n\tfirst.append(a)\r\n\td[a]=b\r\n\td[b]=a\r\ns=input().split()\r\nfor i in s:\r\n\tif(len(d[i])>len(i)):\r\n\t\tprint(i,end=\" \")\r\n\telif(len(d[i])<len(i)):\r\n\t\tprint(d[i],end=\" \")\r\n\telse:\r\n\t\tif(i in first):\r\n\t\t\tprint(i,end=\" \")\r\n\t\telse:\r\n\t\t\tprint(d[i],end=\" \")", "from sys import stdin\r\n\r\nn, m = list(map(int, stdin.readline().split()))\r\nd = {}\r\nfor _ in range(m):\r\n a, b = stdin.readline().split()\r\n d[a] = b if len(b) < len(a) else a\r\ns = stdin.readline().split()\r\nres = []\r\nfor t in s:\r\n res.append(d[t])\r\nprint(\" \".join(res))", "import math\nfrom collections import defaultdict\nml=lambda:map(int,input().split())\nll=lambda:list(map(int,input().split()))\nii=lambda:int(input())\nip=lambda:(input())\n\n\"\"\"========main code===============\"\"\"\na,b=ml()\nd=defaultdict(str)\nfor _ in range(b):\n x,y=input().split()\n if(len(y)<len(x)):\n d[x]=y\n else:\n d[x]=x\nquery=list(input().split())\nfor i in query:\n print(d[i],end=\" \")\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())\nd = {}\nfor i in range(m):\n a, b = input().split()\n d[a] = b\ns = list(input().split())\nr = []\nfor i in s:\n if len(i)<=len(d[i]):\n r.append(i)\n else:\n r.append(d[i])\nprint(*r)\n\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(m):\r\n st1,st2 = input().split()\r\n a.append(st1)\r\n b.append(st2)\r\nl = list(input().split())\r\nresult = []\r\nfor item in l:\r\n if (a.count(item)>0):\r\n index = a.index(item)\r\n if (len(a[index])<=len(b[index])):\r\n result.append(a[index])\r\n else:\r\n result.append(b[index])\r\n else:\r\n index = b.index(item)\r\n if (len(a[index])<=len(b[index])):\r\n result.append(a[index])\r\n else:\r\n result.append(b[index])\r\nprint(*result)", "n, m = map(int, input().split())\r\ndic = {}\r\nfor i in range(0, m):\r\n a, b = map(str, input().split())\r\n if len(a) < len(b):\r\n dic[a] = a\r\n dic[b] = a\r\n elif len(a) > len(b):\r\n dic[a] = b\r\n dic[b] = b\r\n else:\r\n dic[a] = a\r\n dic[b] = b\r\narr = list(map(str, input().split()))\r\nop = []\r\nfor i in arr:\r\n op.append(dic[i])\r\n\r\nprint(' '.join(x for x in op))\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n a1,b1=input().split()\r\n d[a1]=b1 \r\nl=input().split()\r\nfor x in l:\r\n if len(d[x])<len(x):\r\n print(d[x],end=\" \")\r\n else:\r\n print(x,end=\" \")\r\n\r\n ", "n,m = (int(x) for x in input().split())\r\nd = {}\r\nfor i in range(0,m):\r\n a,b = (str(x) for x in input().split())\r\n d.update({a:b})\r\nlec = (str(x) for x in input().split())\r\ntet = ''\r\nfor x in lec:\r\n if len(x) > len(d[x]): tet += d[x] + ' '\r\n else: tet += x + ' '\r\nprint(tet)\r\n", "n, m = map(int, input().split())\r\nd = []\r\nfor i in range(m):\r\n d += [input().split()]\r\nb = input().split()\r\nans = ''\r\nfor elem in b:\r\n for j in range(len(d)):\r\n if elem in d[j]:\r\n min1 = 10000000\r\n minword = ''\r\n for l in d[j]:\r\n if len(l) < min1:\r\n min1 = len(l)\r\n minword = l\r\n ans += minword + ' '\r\nprint(ans[:-1])", "n, m = [int(x) for x in input().split()]\r\nd = {}\r\nfor i in range(m):\r\n x, y = input().split()\r\n d[x]=y\r\nnotes = input().split()\r\nfor i in range(n):\r\n word = notes[i]\r\n if word in d.keys():\r\n if len(word)>len(d[word]):\r\n print(d[word], end=\" \")\r\n else:\r\n print(word, end=\" \")\r\n if word in d.values():\r\n for i in d.keys():\r\n if d[i]==word:\r\n l_w = i\r\n break\r\n if len(l_w)>len(d[word]):\r\n print(word, end=\" \")\r\n else:\r\n print(l_w, end=\" \")", "n, m = map(int, input().split())\r\nd = {}\r\nfor _ in range(m):\r\n\ta, b = sorted(input().split(), key=lambda a: len(a))\r\n\td[a] = a\r\n\td[b] = a\r\nprint(' '.join([d[i] for i in input().split()]))", "def Lecture():\r\n n,m=map(int,input().split())\r\n A=[]\r\n for i in range(m):\r\n A.append(list(map(str,input().split())))\r\n T=list(map(str,input().split()))\r\n Lec=''\r\n for i in T:\r\n Lec+=RechercheMot(A,m,i)+' '\r\n print(Lec)\r\ndef RechercheMot(A,n,Mot):\r\n for Ai in A:\r\n if Mot in Ai:\r\n break\r\n if len(Ai[0])<=len(Ai[1]):\r\n return Ai[0]\r\n else:\r\n return Ai[1]\r\n \r\nLecture()", "n, m = map(int, input().split())\r\n\r\nwords_dict = {}\r\nfor _ in range(m):\r\n lang1, lang2 = input().split()\r\n words_dict[lang1] = lang2 if len(lang1) > len(lang2) else lang1\r\n\r\nlecture_text = input().split()\r\n\r\nfor word in lecture_text:\r\n print(words_dict[word], end=\" \")\r\n", "n, m = map(int, input().split())\r\nd = dict()\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n d[a] = a\r\n else:\r\n d[a] = b\r\ntext = input().split()\r\nfor x in text:\r\n print(d[x], end = ' ')\n# Wed Jul 06 2022 23:43:50 GMT+0000 (Coordinated Universal Time)\n", "n, m = map(int, input().split())\r\nlan = dict()\r\nans = list()\r\nfor i in range(m):\r\n w = list(map(str, input().split()))\r\n w.sort(key=len)\r\n lan[w[1]] = w[0]\r\n\r\nlect = input().split()\r\nfor i in lect:\r\n if i in lan:\r\n ans.append(lan[i])\r\n else:\r\n ans.append(i)\r\nprint(' '.join(ans))\r\n", "n, m = map(int, input().split())\r\nwords = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a)<=len(b):\r\n words[a] = a\r\n words[b] = a\r\n else:\r\n words[a] = b\r\n words[b] = b\r\n#print(words)\r\ns = input().split()\r\nfor i in range(len(s)):\r\n s[i] = words[s[i]]\r\nprint(*s)", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if len(a)<=len(b):\r\n dic[a]=a\r\n dic[b]=a\r\n else:\r\n dic[a]=b\r\n dic[b]=b\r\nx=list(map(str,input().split()))\r\ns=\"\"\r\nfor i in x:\r\n s+=dic[i]+\" \"\r\nprint(s[:-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\ndict = {}\r\nfor _ in range(m):\r\n a, b = map(str, input().split())\r\n if len(a)==len(b) or len(a)<len(b):\r\n dict[a]=a\r\n else:\r\n dict[a]=b\r\nname=input().split()\r\nfor i in name:\r\n print(dict[i],end=\" \")\r\n", "def f(lec,l1,l2):\r\n lecf = []\r\n for x in lec:\r\n if len(l2[l1.index(x)]) < len(x):\r\n lecf.append(l2[l1.index(x)])\r\n else:\r\n lecf.append(x) \r\n return \" \".join(lecf)\r\n \r\n\r\nnm = input().split(\" \")\r\nnm = [int(x) for x in nm]\r\nlanguage1 = []\r\nlanguage2 = []\r\nfor i in range(nm[-1]):\r\n temp = input().split(\" \")\r\n language1.append(temp[0])\r\n language2.append(temp[1])\r\nlecture = input().split(\" \")\r\nprint(f(lecture,language1,language2))", "n,m=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor u in range(m):\r\n x,y=list(map(str,input().split()))\r\n a.append(x)\r\n b.append(y)\r\ns=list(map(str,input().split()))\r\nfa=0\r\nans=\"\"\r\n# print(s)\r\nfor i in range(len(s)):\r\n if s[i] in a:\r\n fa=a.index(s[i])\r\n elif s[i] in b: \r\n fa=b.index(s[i])\r\n if len(a[fa])> len(b[fa]):\r\n ans=ans+\" \"+b[fa]\r\n else:\r\n ans=ans+\" \"+a[fa]\r\nprint(ans) ", "def summ(n,m):\r\n dic={}\r\n for i in range(m):\r\n s=input()\r\n s1=s.split()\r\n dic[s1[0]]=s1[1]\r\n s3=input()\r\n s3s=s3.split()\r\n final=''\r\n for i in s3s:\r\n if(len(i)<=len(dic[i])):\r\n final+=i + \" \"\r\n \r\n else:\r\n\r\n final+=dic[i] + \" \"\r\n print(final.strip())\r\n\r\n\r\nif __name__==\"__main__\":\r\n \r\n inn2=input()\r\n inn2=inn2.split()\r\n inn3=(list(map(int, inn2)))\r\n summ(inn3[0],inn3[1])", "input1 = list(map(int, input().split()))\nn = input1[0]\nm = input1[1]\n\nmydict = {}\n\nfor i in range(m):\n input1 = input().split()\n mydict[input1[0]] = input1[1]\n\nlecture = input().split()\n\noutput = []\nfor i in lecture:\n if len(mydict[i]) < len(i):\n output.append(mydict[i])\n else:\n output.append(i)\n\nprint(' '.join(output))\n", "n, m = map(int, input().split())\nd = dict()\nfor _ in range(m):\n a, b = input().split()\n d[a] = a if len(a) <= len(b) else b\nprint(*map(d.__getitem__, input().split()))\n", "n, m = map(int, input().split())\r\ntrans = {}\r\nfor _ in range(m):\r\n temp = list(input().split())\r\n a, b = temp[0], temp[1]\r\n if len(a) <= len(b):\r\n trans[a] = a\r\n else:\r\n trans[a] = b\r\nlecture = list(input().split())\r\nnotes = ''\r\nfor x in lecture:\r\n notes += (trans[x] + ' ')\r\nprint(notes)\r\n", "a, b = map(int, input().split())\r\nl = []\r\nt = []\r\nfor roma in range(b):\r\n w, e = input().split()\r\n t.append(w)\r\n if len(w) < len(e) or len(w) == len(e):\r\n l.append(w)\r\n else:\r\n l.append(e)\r\nr = list(input().split())\r\nfor i in r:\r\n if len(t[t.index(i)]) < len(l[t.index(i)]) or len(t[t.index(i)]) == len(l[t.index(i)]):\r\n print(t[t.index(i)], end=' ')\r\n else:\r\n print(l[t.index(i)], end=' ')", "n,m = map(int, input().split())\r\nlst1 =[]\r\nlst2 =[]\r\nfor i in range(m):\r\n x,y = map(str, input().split(' '))\r\n lst1.append(x)\r\n lst2.append(y)\r\nlst3 = list(map(str, input().split(' ')))\r\nlst4 = []\r\nfor i in lst3:\r\n a = lst1.index(i)\r\n if len(lst1[a])<=len(lst2[a]):\r\n lst4.append(lst1[a])\r\n else:\r\n lst4.append(lst2[a])\r\nfor i in range(len(lst4)):\r\n print(lst4[i], end = ' ')", "n,m=map(int,input().split( ))\r\nlang1=[]\r\nlang2=[]\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n lang1.append(a)\r\n lang2.append(b)\r\nproftext=list(map(str,input().split()))\r\nstudentlang=[]\r\nstudenttext=[]\r\nfor i in range(m):\r\n if len(lang1[i])<=len(lang2[i]):\r\n studentlang.append(lang1[i])\r\n else:\r\n studentlang.append(lang2[i])\r\nfor i in proftext:\r\n studenttext.append(studentlang[lang1.index(i)])\r\nfor item in studenttext:\r\n print(item, end=' ')\r\n", "inp = list(map(int,input().split()))\r\nn=inp[0] #number of words in proff's lectures\r\nm=inp[1] #number of words in the languages\r\n\r\ntranslation={}\r\n\r\nfor x in range(m):\r\n inp=input().split()\r\n translation[inp[0]]=inp[1]\r\n\r\nlecture=input().split()\r\nnotes=[]\r\n\r\nfor x in range(n):\r\n if(len(lecture[x])>len(translation[lecture[x]])):\r\n notes.append(translation[lecture[x]])\r\n else:\r\n notes.append(lecture[x])\r\n \r\nprint(\" \".join(map(str,notes)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n dic[a]=b\r\nl=list(input().split())\r\nfor ele in l:\r\n if len(ele)<=len(dic[ele]):\r\n print(ele,end=\" \")\r\n else:\r\n print(dic[ele],end=\" \")", "def f():\n n, m = map(int, input().split())\n\n map1 = {}\n map2 = {}\n for _ in range(m):\n first, second = input().split()\n map1[first] = second\n map2[second] = first\n\n sentence = input()\n words = sentence.split()\n res = []\n for w in words:\n\n first, second = None, None\n\n if w in map1:\n first = w\n second = map1[w]\n elif w in map2:\n first = map2[w]\n second = w\n\n if first != None and second != None:\n if len(first) < len(second):\n res.append(first)\n elif len(second) < len(first):\n res.append(second)\n elif len(first) == len(second):\n res.append(first)\n else:\n res.append(w)\n print(\" \".join(res))\n\n\nf()\n", "n,m = map(int,input().split())\r\n\r\nword = {}\r\n\r\nfor _ in range(m):\r\n\ta,b = [i for i in input().split()]\r\n\r\n\tif len(a) <= len(b):\r\n\t\tword[a] = a\r\n\t\tword[b] = a\r\n\telse:\r\n\t\tword[a] = b\r\n\t\tword[b] = a\r\n\r\narr = [i for i in input().split()]\r\n\r\nfor i in range(n):\r\n\tarr[i] = word[arr[i]]\r\n\r\nprint(*arr)", "from sys import stdin\r\n_input = stdin.readline\r\n_range, _len, _int, _str, _dict = range, len, int, str, dict\r\nfrom collections import defaultdict\r\n\r\n\r\ndef solution():\r\n n, m = [_int(i) for i in _input().split()]\r\n d = defaultdict(_str)\r\n for i in _range(m):\r\n key, val = [i for i in _input().rstrip('\\n').split()]\r\n d[key] = val\r\n s = [i for i in _input().rstrip('\\n').split()]\r\n ans = []\r\n for i in s:\r\n if _len(i) <= _len(d[i]):\r\n ans.append(i)\r\n else:\r\n ans.append(d[i])\r\n print(\" \".join(ans))\r\nsolution()", "\"\"\"\nB. Lecture: implementation, strings\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nYou have a new professor of graph theory and he speaks very quickly. You come up with the following plan to keep up with his lecture and make notes.\nYou know two languages, and the professor is giving the lecture in the first one.\nThe words in both languages consist of lowercase English characters, each language consists of several words.\nFor each language, all words are distinct, i.e. they are spelled differently.\nMoreover, the words of these languages have a one-to-one correspondence, that is, for each word in each language, there exists exactly one word in the other language having has the same meaning.\nYou can write down every word the professor says in either the first language or the second language.\nOf course, during the lecture you write down each word in the language in which the word is shorter.\nIn case of equal lengths of the corresponding words you prefer the word of the first language.\nYou are given the text of the lecture the professor is going to read.\nFind out how the lecture will be recorded in your notes.\n\nInput\nThe first line contains two integers, n and m (1 ≤ n ≤ 3000, 1 ≤ m ≤ 3000) — the number of words in the professor's lecture and the number of words in each of these languages.\nThe following m lines contain the words.\nThe i-th line contains two strings ai, bi meaning that the word ai belongs to the first language, the word bi belongs to the second language, and these two words have the same meaning.\nIt is guaranteed that no word occurs in both languages, and each word occurs in its language exactly once.\nThe next line contains n space-separated strings c1, c2, ..., cn — the text of the lecture.\nIt is guaranteed that each of the strings ci belongs to the set of strings {a1, a2, ..., am}.\nAll the strings in the input are non-empty, each consisting of no more than 10 lowercase English letters.\n\nOutput\nOutput exactly n words: how you will record the lecture in your notebook. Output the words of the lecture in the same order as in the input.\n\"\"\"\n\ndef lecture():\n n, m = list(map(int, input().split(' ')))\n d = dict()\n\n for _ in range(m):\n a, b = input().split(' ')\n d[a] = b\n l = input().split(' ')\n\n for i in range(n):\n if len(l[i]) > len(d[l[i]]):\n l[i] = d[l[i]]\n print(' '.join(l))\n\nif __name__ == '__main__':\n lecture()", "d={}\r\nn,m=map(int,input().split())\r\nfor _ in range(m):\r\n a=list(map(str,input().split()))\r\n d[a[0]]=a[1]\r\ns=list(map(str,input().split()))\r\nl=[]\r\nfor i in s:\r\n if len(i)>len(d[i]):\r\n l.append(d[i])\r\n else:\r\n l.append(i)\r\nprint(*l)", "n, m = [int(i) for i in input().split()]\r\nd = {}\r\nfor i in range(m):\r\n a = input().split()\r\n d[a[0]] = a[1]\r\nfor w in input().split():\r\n if len(w) <= len(d[w]):\r\n print(w, end=' ')\r\n else:\r\n print(d[w], end=' ')\r\n", "def short(s1,s2):\r\n if(len(s1)<len(s2)):\r\n return s1\r\n elif(len(s1)>len(s2)):\r\n return s2\r\n else:\r\n return s1\r\n\r\nn,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n a,b=map(str,input().split())\r\n if a not in d:\r\n d[a]=b\r\nL=list(input().split())\r\ns=''\r\nfor c in L:\r\n print(short(c,d[c]),end=' ')\r\n", "n,m = list(map(int,input().split()))\r\ndit = {}\r\nfor i in range(m):\r\n x,y = input().split()\r\n if len(x)>len(y):\r\n dit[x]=y\r\n else:\r\n dit[x]=x\r\nstr = input().split()\r\nfor i in str:\r\n print(dit[i],end=' ')", "n,m = list(map(int,input().split()))\r\nl = dict()\r\nfor i in range(m):\r\n a,b = list(map(str,input().split()))\r\n if len(a) == len(b):\r\n l[a] = a\r\n else:\r\n x,y = len(a),len(b)\r\n if x>y:\r\n l[a] = b\r\n else:\r\n l[a] = a\r\n\r\ns = list(map(str,input().split()))\r\nfor i in s:\r\n print(l[i],end = \" \")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndef LectureTranslate(c, language_words):\r\n output_words = str()\r\n for word in c:\r\n if len(output_words) > 0:\r\n output_words += \" \"\r\n if len(language_words[word]) < len(word):\r\n output_words += language_words[word]\r\n else:\r\n output_words += word\r\n return output_words\r\n\r\ndef main():\r\n n_m = tuple(invr())\r\n a_b = {}\r\n for i in range(n_m[1]):\r\n word_trans = tuple((map(str,input().split())))\r\n a_b[word_trans[0]] = word_trans[1]\r\n c = list(map(str,input().split()))\r\n print(LectureTranslate(c, a_b))\r\n \r\n\r\nif __name__==\"__main__\":\r\n main()", "from collections import defaultdict, Counter\r\n\r\ndef solve():\r\n d = defaultdict(str)\r\n n,m = list(map(int, input().split()))\r\n for i in range(m):\r\n a,b = list(map(str, input().split()))\r\n if len(a) <= len(b):\r\n d[a] = a\r\n d[b] = a\r\n else:\r\n d[a] = b\r\n d[b] = b\r\n spoken = list(map(str, input().split()))\r\n ans = []\r\n for i in spoken:\r\n ans.append(d[i])\r\n print(*ans)\r\n\r\nfor _ in range(1):\r\n solve()", "n,m=[int(i) for i in input().split()]\r\nl=[]\r\na=[]\r\nfor i in range(m):\r\n g,h=[str(i) for i in input().split()]\r\n l.append(g)\r\n a.append(h)\r\n# print(l,a)\r\ns=str(input())\r\ns=s.split(' ')\r\nz=[]\r\nfor i in range(0,len(s)):\r\n d=s[i]\r\n# print(d)\r\n if(d in l):\r\n f=l.index(d)\r\n if(len(l[f])>len(a[f])):\r\n z.append(a[f])\r\n \r\n elif(len(l[f])<len(a[f])):\r\n z.append(l[f])\r\n else:\r\n z.append(l[f])\r\n elif(d in a):\r\n f=l.index(d)\r\n if(len(l[f])>len(a[f])):\r\n z.append(a[f])\r\n \r\n elif(len(l[f])<len(a[f])):\r\n z.append(l[f])\r\n else:\r\n z.append(l[f])\r\nprint(*z)", "n,m = map(int,input().split())\r\nfrom collections import defaultdict\r\nd = defaultdict(str)\r\nfor i in range(m):\r\n a,b = map(str,input().split())\r\n d[a] = min(a,b,key=len)\r\n d[b] = min(a,b,key=len)\r\n#print(d)\r\na = list(map(str,input().split()))\r\nres = str()\r\nfor i in a:\r\n #print(d[i])\r\n res+=d[i]\r\n res+=\" \"\r\nprint(res)\r\n", "def main(n,m,a,s):\r\n\r\n\r\n\tdic = dict()\r\n\r\n\tfor i in a:\r\n\t\t\r\n\t\ttemp = i.split()\r\n\r\n\t\t\r\n\r\n\t\tif(len(temp[0])<=len(temp[1])):\r\n\r\n\t\t\tdic[temp[0]] = temp[0]\r\n\t\telse:\r\n\t\t\tdic[temp[0]] = temp[1]\r\n\r\n\tb = s.split()\r\n\t\r\n\tans = ''\r\n\tfor i in b:\r\n\t\tans += dic[i]\r\n\t\tans+=' '\r\n\tprint(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\r\n\tinp = input()\r\n\t\r\n\tn = int(inp.split()[0])\r\n\r\n\tm = int(inp.split()[1])\r\n\r\n\ta = []\r\n\r\n\tfor _ in range(m):\r\n\r\n\t\ta.append(input())\r\n\r\n\ts = input()\r\n\r\n\tmain(n,m,a,s)\r\n\r\n\r\n\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\nn,m =M()\r\nd = defaultdict()\r\nfor _ in range(m):\r\n x,y = map(str, input().split())\r\n if len(x)<=len(y):\r\n d[x] = x\r\n d[y] = x\r\n else:\r\n d[x] = y\r\n d[y] = y\r\n\r\narr = list(map(str,input().split()))\r\nfor i in range(n):\r\n print(d[arr[i]],end=\" \")\r\nprint()\r\n", "from collections import defaultdict\r\nimport bisect\r\n\r\n# n=int(input())\r\nn,m=list(map(int,input().split()))\r\n# lis=list(map(int,input().split()))\r\nd=defaultdict(str)\r\n\r\nfor _ in range(m):\r\n lis=input().split()\r\n d[lis[0]]=lis[1]\r\nstr1=input().split()\r\n\r\nans=\"\"\r\nfor ele in str1:\r\n if(len(ele)<=len(d[ele])):\r\n ans+=ele\r\n ans+=\" \"\r\n else:\r\n ans+=d[ele]\r\n ans+=\" \"\r\nprint(ans)", "n, m = map(int, input().split())\r\nl1 = []\r\nl2 = []\r\nwhile m:\r\n m -= 1\r\n l1w, l2w = input().split()\r\n l1.append(l1w)\r\n l2.append(l2w)\r\n\r\np = list(input().split())\r\npepew = []\r\nfor i in p:\r\n temp = l1.index(i)\r\n if len(l1[temp]) <= len(l2[temp]):\r\n pepew.append(l1[temp])\r\n else:\r\n pepew.append(l2[temp])\r\n\r\nfor j in pepew:\r\n print(j, end=' ')\r\n", "n, m = list(map(int, input().split()))\r\n\r\nd = dict()\r\nfor i in range(m):\r\n tmp = input().split()\r\n d[tmp[0]] = tmp[1]\r\n\r\ns = input().split()\r\n\r\nres = []\r\nfor word in s:\r\n if(len(word) <= len(d[word])):\r\n res.append(word)\r\n else:\r\n res.append(d[word])\r\n\r\nprint(\" \".join(res))\r\n", "(n, m) = map(int, input().split(' '))\ntranslator = {}\nfor i in range(m):\n (a, b) = map(str, input().split(' '))\n translator[a] = b\ntext_of_lecture = list(map(str, input().split(' ')))\ntext_in_note = []\n\nfor text in text_of_lecture:\n if len(text) <= len(translator[text]):\n text_in_note.append(text)\n else:\n text_in_note.append(translator[text])\n\nprint(*text_in_note)", "from math import*\r\nn,m=list(map(int,input().split()))\r\nu={}\r\nfor i in range(m):\r\n j=sorted(input().split(),key=lambda x:len(x))\r\n h=j[0]\r\n u[j[0]]=h\r\n u[j[1]]=h\r\nv=input().split()\r\nq=[]\r\nfor i in range(len(v)):\r\n q.append(u[v[i]])\r\nprint(' '.join(q))", "n,m=map(int,input().split())\r\nf={}\r\nfor i in range(m):\r\n\ta=input().split()\r\n\tf[a[0]]=a[1]\r\na=input().split()\r\nfor i in range(n):\r\n\tif len(f[a[i]])<len(a[i]):\r\n\t\ta[i]=f[a[i]]\r\nprint(' '.join(a))", "if __name__ == \"__main__\":\r\n n,m = map(int, input().split())\r\n language_dict = {}\r\n \r\n for _ in range(m):\r\n first_language_word, second_language_word = input().split()\r\n if len(first_language_word) <= len(second_language_word):\r\n language_dict[first_language_word] = first_language_word\r\n else:\r\n language_dict[first_language_word] = second_language_word\r\n \r\n lecture_speech, output_speech = list(input().split()),[]\r\n for word in lecture_speech:\r\n output_speech.append(language_dict[word])\r\n \r\n print(' '.join([i for i in output_speech]))\r\n", "count_time=False\r\nif count_time:\r\n import time\r\n start_time = time.time()\r\n#------------------------------------------\r\nn,m=map(int,input().split())\r\na=dict()\r\nfor _ in range(m):\r\n x,y=input().split()\r\n e,f=len(x),len(y)\r\n if e>f:\r\n a[x]=y\r\n a[y]=y\r\n else:\r\n a[x]=x\r\n a[y]=y\r\ns=list(input().split())\r\nk=[]\r\nfor i in s:k.append(a[i])\r\nprint(*k)\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,m=map(int,input().split())\r\nshort=[]\r\nlong=[]\r\nfor i in range(m):\r\n a,b=map(str, input().split())\r\n if len(a)<=len(b):\r\n short.append(a)\r\n long.append(b)\r\n else:\r\n short.append(b)\r\n long.append(a)\r\ns=list(map(str, input().split()))\r\nfor i in s:\r\n if i in short:\r\n print(i,end=\" \")\r\n else:\r\n for j in long:\r\n if j==i:\r\n p=long.index(j)\r\n print(short[p],end=\" \")", "n, m = map(int, input().split())\r\nw_m = dict()\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n if len(a) > len(b):\r\n w_m[a] = b\r\n else:\r\n w_m[a] = a\r\n\r\nsen = input().split()\r\nans = \"\"\r\nfor j, i in enumerate(sen):\r\n ans += w_m[i]\r\n if j == n-1:\r\n continue\r\n ans += \" \"\r\nprint(ans)\r\n", "(n, m) = map(int, input().split(' '))\r\nwords = dict()\r\nfor x in range(m):\r\n (a, b) = map(str, input().split(' '))\r\n if len(b) < len(a):\r\n words[a] = b\r\nlecture = input()\r\nlecture = lecture.split(' ')\r\nres = []\r\nfor w in lecture:\r\n res.append(words.get(w, w))\r\nprint(' '.join(res))\r\n", "# Lecture\r\ns1 = input().split(\" \")\r\nn,m = int(s1[0]),int(s1[1])\r\nnew = {} \r\nfor i in range(m):\r\n s = input().split(\" \")\r\n if len(s[0]) <= len(s[1]):\r\n new[s[0]] = s[0]\r\n else:\r\n new[s[0]] = s[1]\r\ns = input().split(\" \")\r\nfor i in s:\r\n print(new[i], end = \" \")", "first=[]\r\nsecond=[]\r\nans=[]\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n s,d = map(str,input().split())\r\n first.append(s)\r\n second.append(d)\r\nc=[str(i) for i in input().split()]\r\nfor i in c:\r\n if i in first:\r\n if len(i)<=len(second[first.index(i)]):\r\n ans.append(i)\r\n else:\r\n ans.append(second[first.index(i)])\r\n \r\n elif i in second:\r\n if len(i)<=len(first[second.index(i)]):\r\n ans.append(i)\r\n else:\r\n ans.append(first[second.index(i)])\r\nprint(*ans)", "#499B - Lecture\r\n[a,b],c=list(map(int,input().split())),{}\r\nfor i in range(b):\r\n [x,y]=list(map(str,input().split()))\r\n xl,yl=len(x),len(y)\r\n if xl<=yl:\r\n c[y]=x\r\n else:\r\n c[x]=y\r\nx,y=list(map(str,input().split())),[]\r\nfor i in x:\r\n try:\r\n y.append(c[i])\r\n except:\r\n y.append(i)\r\nprint(*y)", "a,b=map(int,input().split())\r\nc=[]\r\nfor i in range(b):\r\n d=list(map(str,input().split()))\r\n c.append(d)\r\ne=list(map(str,input().split()))\r\nfor i in e:\r\n for j in c:\r\n if(i==j[0]):\r\n if(len(i)>len(j[1])):\r\n print(j[1],end=' ')\r\n else:\r\n print(i,end=' ')\r\n ", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n x=input().split()\r\n a=x[0]\r\n b=x[1]\r\n la=len(a)\r\n lb=len(b)\r\n smaller=None\r\n if la<=lb:\r\n smaller=a\r\n elif la>lb:\r\n smaller=b\r\n d[a] = smaller\r\n d[b] = smaller\r\ninp=input().split()\r\nfor i in inp:\r\n print(d[i],end=\" \")", "n , m = list(map(int, input().split()))\r\n\r\nvalue = {}\r\nfor i in range(m):\r\n a,b = input().split()\r\n if len(a) <= len(b):\r\n value[b] = a\r\n else:\r\n value[a] = b\r\nc = input().split()\r\nfor i in range(n):\r\n if c[i] in value:\r\n print(value[c[i]], end=' ')\r\n else:\r\n print(c[i], end = ' ') ", "import math\r\ndef main():\r\n n,m=map(int,input().split())\r\n dic={}\r\n for i in range(m):\r\n a,b=map(str,input().split())\r\n if (len(a)<=len(b)):\r\n dic[a]=a\r\n else:\r\n dic[a]=b\r\n s=input().split()\r\n for i in s:\r\n print(dic[i],end=\" \")\r\n \r\nmain()\r\n ", "n, m = map(int, input().split())\r\ns = dict()\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) > len(b):\r\n s[a] = b\r\n else:\r\n s[a] = a\r\npr = input().split()\r\nfor i in range(n):\r\n print(s[pr[i]] , end = \" \")\r\n\n# Thu Jul 07 2022 08:15:29 GMT+0000 (Coordinated Universal Time)\n", "n,m=map(int,input().split())\r\ndic={}\r\nfor j in range(m):\r\n i,dic[i]=map(str,input().split())\r\nl=list(map(str,input().split()))\r\nfor check in l:\r\n if(len(check)>len(dic[check])):\r\n print(dic[check],end=' ')\r\n else:\r\n print(check,end=' ')", "from sys import stdin\r\n\r\nn, m = list(map(int, stdin.readline().strip().split()))\r\ns = []\r\n\r\nfor i in range(m):\r\n s.append([])\r\n s1, s2 = list(stdin.readline().strip().split())\r\n if len(s1) <= len(s2):\r\n s[i].append(s1)\r\n s[i].append(s2)\r\n else:\r\n s[i].append(s2)\r\n s[i].append(s1)\r\n\r\n# print(s)\r\n\r\nprof = list(stdin.readline().strip().split(' '))\r\nanswer = ''\r\nfor word in prof:\r\n for mapping in s:\r\n if mapping[0] == word:\r\n answer+=(mapping[0] + ' ')\r\n break\r\n elif mapping[0]!=word and mapping[1] == word:\r\n answer+=(mapping[0] + ' ')\r\n break\r\n\r\nprint(answer)\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n if(len(a)==len(b)):\r\n if a not in d:\r\n d[b]=a\r\n elif(len(a)>len(b)):\r\n d[a]=b\r\n else:\r\n d[b]=a\r\n# print(d)\r\nl=list(map(str,input().split()))\r\nfor i in range(n):\r\n if l[i] in d:\r\n print(d[l[i]],end=\" \")\r\n else:\r\n print(l[i],end=\" \")", "dict={}\r\nn,m=map(int,input().split(' '))\r\nfor i in range(m):\r\n a,b=input().split(' ')\r\n dict[a]=b\r\nprof=list(input().split(' '))\r\nfor j in prof:\r\n a,b=j,dict[j]\r\n if len(a)<=len(b):\r\n print(a,end=' ')\r\n else:\r\n print(b,end=' ')\r\nprint()\r\n", "n, m = map(int, input().split(\" \"))\r\nw, out = {}, []\r\n\r\nfor _ in range(m):\r\n inp = input().split(\" \")\r\n w[inp[0]] = inp[1] \r\n\r\ns = input().split(\" \")\r\nfor i in range(n):\r\n out.append(s[i] if len(s[i]) <= len(w[s[i]]) else w[s[i]])\r\n\r\nprint(*out)", "ans = []\nn, m = list(map(int, input().split()))\nx = [list(map(str, input().split())) for i in range(m)]\ny = list(map(str, input().split()))\nfor i in range(len(y)):\n for j in range(len(x)):\n if (y[i] in x[j]):\n if (len(x[j][0]) <= len(x[j][1])):\n ans.append(x[j][0])\n break\n else:\n ans.append(x[j][1])\n break\nfor i in ans:\n print(i, end = \" \")\n", "a,b=map(int,input().split())\r\nc=[]\r\nq=[]\r\nfor x in range(b):\r\n p,d=input().split()\r\n c.append(d)\r\n q.append(p)\r\ne=list(input().split())\r\nf=[]\r\nfor x in range(a):\r\n if len(c[q.index(e[x])])<len(e[x]):\r\n f.append(c[q.index(e[x])])\r\n else:\r\n f.append(e[x])\r\nprint(*f)", "# def main():\r\n# n, m = input().split()\r\n# n, m = int(n), int(m)\r\n# dictionary = dict()\r\n# for i in range(m):\r\n# string = input()\r\n# str1, str2 = string.split(' ')[0], string.split(' ')[1]\r\n# dictionary[str1] = str2\r\n#\r\n# # for key, value in dictionary.items():\r\n# # print('dict[', key, '] = ', value)\r\n#\r\n# line = input().split(' ')\r\n# for word in line:\r\n# if len(dictionary[word]) > len(word):\r\n# print(word, end=' ')\r\n# elif len(dictionary[word]) == len(word):\r\n# print(word, end=' ')\r\n# else:\r\n# print(dictionary[word], end=' ')\r\n#\r\n#\r\n# if __name__ == \"__main__\":\r\n# main()\r\nn, m = input().split()\r\nn, m = int(n), int(m)\r\ndictionary = dict()\r\nfor i in range(m):\r\n string = input()\r\n str1, str2 = string.split(' ')[0], string.split(' ')[1]\r\n dictionary[str1] = str2\r\n\r\n# for key, value in dictionary.items():\r\n# print('dict[', key, '] = ', value)\r\n\r\nline = input().split(' ')\r\nfor word in line:\r\n if len(dictionary[word]) > len(word):\r\n print(word, end=' ')\r\n elif len(dictionary[word]) == len(word):\r\n print(word, end=' ')\r\n else:\r\n print(dictionary[word], end=' ')", "n,m = map(int,input().split())\r\ntraslation = [0]*m\r\nl1=[]\r\nfor i in range(m):\r\n traslation[i]=list(map(str,input().split()))\r\n l1.append(traslation[i][0])\r\n\r\nnotes=list(map(str,input().split()))\r\nans=''\r\n\r\n\r\nfor i in notes:\r\n id = l1.index(i)\r\n if len(traslation[id][0])<=len(traslation[id][1]):\r\n ans+=traslation[id][0]+' '\r\n else:\r\n ans += traslation[id][1] + ' '\r\n\r\nprint(ans.rstrip())\r\n\r\n\r\n", "n, m= map(int, input().split())\r\nd = {}\r\nfor i in range(m):\r\n w1, w2 = map(str,input().split())\r\n d[w1] = w2\r\nl = list(map(str, input().split()))\r\nfor i in range(len(l)):\r\n if len(l[i])>len(d[l[i]]):\r\n l[i] = d[l[i]]\r\nprint(*l)\r\n", "n,l = tuple(map(int, input().split()))\r\nans = ''\r\nwordlist = {}\r\nfor i in range(l):\r\n x,y = tuple(input().split())\r\n wordlist[x] = y\r\n\r\nprof = input()\r\nfor i in prof.split():\r\n if len(wordlist[i])<len(i):\r\n ans += wordlist[i]+\" \"\r\n else:\r\n ans += i +\" \"\r\nprint(ans[:-1])", "a,b=map(int,input().split())\r\nd={}\r\nfor _ in range(b):\r\n w1,w2=[x for x in input().split()]\r\n d[w1]=w2\r\nl=[x for x in input().split()]\r\nfor i in l:\r\n if(len(i)<=len(d[i])):\r\n print(i,end=\" \")\r\n else:\r\n print(d[i],end=\" \")\r\n \r\n\r\n ", "import bisect\r\nimport sys\r\nfrom collections import Counter, OrderedDict, defaultdict\r\nfrom functools import lru_cache\r\nfrom itertools import permutations, combinations\r\nfrom heapq import heapify\r\nfrom math import sqrt, gcd\r\n\r\nsys.setrecursionlimit(10**5)\r\ndef input(): return sys.stdin.readline().strip('\\r\\n')\r\ndef pyint(): return int(input())\r\ndef pyline(): return map(int, input().split())\r\ndef pylist(): return list(map(int, input().split()))\r\n\r\n\r\nn, m = pyline()\r\nwords = defaultdict(str)\r\nfor _ in range(m):\r\n k, v = input().split()\r\n words[k] = v\r\n\r\ntext = input().split()\r\n\r\nfor first in text:\r\n second = words[first]\r\n if len(second) < len(first):\r\n print(second, end=\" \")\r\n else:\r\n print(first, end=\" \")\r\n", "#Lecture\r\n#Usage of dict\r\nn,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n t=input().split()\r\n d[t[0]]=t[1]\r\na=input().split()\r\nans=[]\r\nfor i in a:\r\n j=d[i]\r\n if len(j)<len(i):\r\n ans.append(j)\r\n else:\r\n ans.append(i)\r\nprint(' '.join(ans))", "num=[int(i) for i in input().split()]\r\nn = num[0]\r\nm = num[1]\r\nl=[]\r\nl_01=[]\r\nfor i in range(m):\r\n l_ = [str(i) for i in input().split()]\r\n l_01.append(l_[0])\r\n if len(l_[1])<len(l_[0]):\r\n l.append(l_[1])\r\n else :\r\n l.append(l_[0])\r\nans=[]\r\nprof=[str(i) for i in input().split()]\r\nfor i in range(len(prof)):\r\n if prof[i] in l_01 :\r\n x=l_01.index(prof[i])\r\n ans.append(l[x])\r\nprint(*ans)", "n, m = list(map(int, input().strip().split()))\r\nd = {}\r\nfor i in range(m):\r\n n1, n2 = input().split()\r\n d[n1] = n2\r\na = input().split()\r\nfor i in range(n):\r\n if len(a[i]) <= len(d[a[i]]):\r\n print(a[i], end=' ')\r\n else:\r\n print(d[a[i]], end=' ')\n# Thu Jul 07 2022 07:36:44 GMT+0000 (Coordinated Universal Time)\n", "def record_lecture(n, m, words_dict, lecture_text):\r\n lecture_recorded = []\r\n for word in lecture_text:\r\n recorded_word = words_dict[word]\r\n lecture_recorded.append(recorded_word)\r\n return lecture_recorded\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n\r\n words_dict = {}\r\n for _ in range(m):\r\n a, b = input().split()\r\n # Store the shorter word first in the dictionary to prioritize it\r\n if len(a) <= len(b):\r\n words_dict[a] = a\r\n words_dict[b] = a\r\n else:\r\n words_dict[a] = b\r\n words_dict[b] = b\r\n\r\n lecture_text = input().split()\r\n result = record_lecture(n, m, words_dict, lecture_text)\r\n print(\" \".join(result))\r\n", "n,m=(int(x) for x in input().split())\r\nsd=[]\r\nfor i in range(m):\r\n sd.append(input().split())\r\ns=input().split()\r\nsf=[]\r\nfor i in range(len(s)):\r\n for j in range(len(sd)):\r\n if s[i] in sd[j]:\r\n sd[j]=sorted(sd[j],key= lambda x: len(x))\r\n sf.append(sd[j][0])\r\nprint(' '.join(e for e in sf))", "n, m = map(int, input().split())\r\ndict = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n dict[a] = b\r\nc = input().split()\r\n\r\nfor i in range(n):\r\n if len(c[i]) <= len(dict[c[i]]):\r\n print(c[i], end=' ')\r\n else:\r\n print(dict[c[i]], end=' ')", "def my_notes(l,notes):\r\n\tres = []\r\n\tn = {}\r\n\tl2 = notes.split(\" \")\r\n\tfor l1 in l:\r\n\t\tif(len(l1[0]) < len(l1[1])):\r\n\t\t\tn[l1[0]] = l1[0]\r\n\t\telif(len(l1[1]) < len(l1[0])):\r\n\t\t\tn[l1[0]] = l1[1]\r\n\t\telif(len(l1[0]) == len(l1[1])):\r\n\t\t\tn[l1[0]] = l1[0]\r\n\t\r\n\tfor v in l2:\r\n\t\tres.append(n[v])\r\n\t\r\n\ts = \" \".join(res)\r\n\tprint(s)\r\n\r\n\r\n\r\n\r\nl = []\r\nn,m = map(int, input().strip().split())\r\nfor i in range(m):\r\n\ts = input()\r\n\tli = s.split(\" \")\r\n\tl.append(li)\r\nnotes = input()\r\nmy_notes(l,notes)", "n, m = input().split(\" \")\r\nn, m = int(n), int(m)\r\nd = {}\r\nfor i in range(m):\r\n x = input().split(\" \")\r\n d[x[0]] = x[1]\r\ns = input().split(\" \")\r\nfor j in s:\r\n if len(d[j]) < len(j):\r\n print(d[j], end=\" \")\r\n else:\r\n print(j, end=\" \")\r\n", "n, m = [int(x) for x in input().split()]\r\na, b = [], []\r\nfor i in range(m):\r\n x = [x for x in input().split()]\r\n a.append(x[0])\r\n b.append(x[1])\r\np = [x for x in input().split()]\r\nres = ''\r\nfor i in range(len(p)):\r\n index = a.index(p[i])\r\n if i == 0:\r\n s = ''\r\n else:\r\n s = ' '\r\n if len(a[index]) <= len(b[index]):\r\n res += (s + a[index])\r\n else:\r\n res += (s + b[index])\r\nprint(res)", "n,m = map(int,input().split())\r\na = []\r\nfor i in range(m):\r\n a1,b1 = input().split()\r\n a.append(a1)\r\n a.append(b1)\r\nc = input().split()\r\ns = []\r\nfor i in c:\r\n for j in range(len(a)-1):\r\n if i == a[j]:\r\n if len(a[j]) < len(a[j+1]):\r\n s.append(a[j])\r\n else:\r\n if len(a[j]) > len(a[j+1]):\r\n s.append(a[j+1])\r\n else:\r\n s.append(a[j])\r\nprint(*s)", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n l=input().split()\r\n if len(l[0])>len(l[1]):\r\n d[l[0]]=l[1]\r\n else:\r\n d[l[1]]=l[0]\r\n\r\ns=input().split()\r\nk=\"\"\r\nfor i in s:\r\n if i in d.keys():\r\n k+=d[i]+\" \"\r\n else:\r\n k+=i+\" \"\r\n\r\nk=k.rstrip(\" \")\r\nprint(k)\r\n ", "n, m = list(map(int, input().split()))\r\ndict = {}\r\nfor i in range(m):\r\n w1, w2 = list(input().split())\r\n dict[w1] = [w2, len(w1), len(w2)]\r\nsen = list(input().split())\r\nfor i in sen:\r\n temp = dict[i]\r\n if temp[1] <= temp[2]:\r\n print(i, end=\" \")\r\n else:\r\n print(temp[0], end=\" \")\r\n", "n, m = list(map(int, input().split(' ')))\r\n\r\nwords = {}\r\n\r\nfor i in range(m):\r\n a, b = input().split(' ')\r\n if len(a) <= len(b):\r\n words[a] = a\r\n else:\r\n words[a] = b\r\n\r\nout = ' '.join(map( lambda x: words[x] , input().split(' ')))\r\n\r\nprint(out)\r\n", "a,b=map(int,input().split())\r\nx,y=[],[]\r\nfor i in range(b):\r\n s=list(map(str, input().split()))\r\n x.append(s[0])\r\n y.append(s[1])\r\nz=list(map(str, input().split()))\r\nfor i in range(a):\r\n c=x.index(z[i])\r\n if len(x[c])>len(y[c]):\r\n print((y[c]),end=\" \")\r\n else:\r\n print((x[c]),end=\" \")", "\r\nlang={}\t\t\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n\tarr=list(map(str,input().split()))\r\n\tlang.update({arr[0]:arr[1]})\r\nstr1=list(map(str,input().split()))\r\n# print(*lang.values())\r\n# print(str1)\r\nfor i in range(n):\r\n\tif str1[i] in lang:\r\n\t\tx=str1[i]\r\n\t\ty=lang[x]\r\n\t\tif len(x)<=len(y):\r\n\t\t\tprint(x,end=' ')\r\n\t\telse:print(y,end=' ')\r\n\telse:\r\n\t\ty=str1[i]\r\n\t\tfor k in lang:\r\n\t\t\tif lang[k]==y:\r\n\t\t\t\tx=lang[k]\r\n\t\t\t\tbreak\r\n\t\t\telse:continue\r\n\t\tif len(x)<len(y):\r\n\t\t\tprint(x,end=' ')\r\n\t\telse:print(y,end=' ')\r\n\r\n\r\n\r\n\r\n", "class Solution:\r\n def __init__(self):\r\n self.n, self.m = [int(x) for x in input().split()]\r\n self.a, self.b = [], []\r\n for _ in range(self.m):\r\n a, b = [x for x in input().split()]\r\n self.a.append(a)\r\n self.b.append(b)\r\n self.c = [x for x in input().split()]\r\n\r\n def solve_and_print(self):\r\n for c in self.c:\r\n for a, b in zip(self.a, self.b):\r\n if a == c:\r\n print(a if len(a) <= len(b) else b, end = ' ')\r\n\r\nif __name__ == \"__main__\":\r\n Solution().solve_and_print()", "n,m = map(int,input().split())\nd = dict(input().split() for i in range(m))\n# print(d)\nk = input().split()\nfor i in k:\n\tprint(min((i,d[i]),key = len),end = \" \")\n\n\n\n", "s = list(map(int, input().split()))\r\nn = s[0]\r\nm = s[1]\r\nd = dict()\r\nfor x in range(m):\r\n s = input().split()\r\n d[s[0]] = s[1]\r\ns = input().split()\r\nfor x in range(n):\r\n if len(d[s[x]]) >= len(s[x]):\r\n print(s[x], end=' ')\r\n else:\r\n print(d[s[x]], end=' ')", "a,b=map(int,input().split())\r\ns=[]\r\nfor _ in range(b): s.extend(input().split())\r\nx=input().split()\r\nk=[]\r\nfor i in x:\r\n l=s.index(i)\r\n if l%2:\r\n if len(s[l])>len(s[l-1]): k.append(s[l-1])\r\n else: k.append(i)\r\n else:\r\n if len(s[l])>len(s[l+1]): k.append(s[l+1])\r\n else: k.append(i)\r\nprint(*k)", "a,b=[int(i) for i in input().split()]\r\nd={}\r\ns=\"\"\r\nfor i in range(b):\r\n m,n=[i for i in input().split()]\r\n d[m]=n\r\nche=[i for i in input().split()]\r\nfor i in che:\r\n if len(i)<len(d[i]):\r\n s+=i+\" \"\r\n elif len(i)>len(d[i]):\r\n s+=d[i]+\" \"\r\n else:\r\n s+=i+\" \"\r\nprint(s.strip())", "n,m=list(map(int,input().split()))\r\ndict={}\r\nfor x in range(m):\r\n a,b=list(map(str,input().split()))\r\n dict[a]=b\r\n\r\n\r\nk=list(map(str,input().split()))\r\nlist1=[]\r\nfor x,y in dict.items():\r\n if len(x)==len(y):\r\n list1.append(x)\r\n elif len(x)<len(y):\r\n list1.append(x)\r\n elif len(x)>len(y):\r\n list1.append(y)\r\nfor x in k:\r\n if x in list1:\r\n print(x,end=\" \")\r\n else:\r\n print(dict[x],end=\" \")\r\n", "n = input().split()\r\nwords = int(n[0])\r\nstrings = int(n[1])\r\nalph1 = []\r\nalph2 = []\r\nlection_mod = ''\r\nfor i in range(strings):\r\n n = input().split()\r\n alph1.append(n[0])\r\n alph2.append(n[1])\r\nlection = input().split()\r\nfor i in range(len(lection)):\r\n word = alph1.index(lection[i])\r\n if len(alph2[word]) < len(alph1[word]):\r\n lection_mod += alph2[word] + ' '\r\n else:\r\n lection_mod += alph1[word] + ' '\r\nprint(lection_mod)", "n, m = map(int, input().split())\r\ndic = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n dic[a] = b\r\nc = input().split()\r\nns = []\r\nfor i in c:\r\n l = len(i)\r\n k = len(dic[i])\r\n if l > k:\r\n ns.append(dic[i])\r\n else:\r\n ns.append(i)\r\nprint(' '.join(ns))", "n,m=[int(i) for i in input().split(\" \")]\r\nd={}\r\nfor i in range(m):\r\n a,b=[i for i in input().split(\" \")]\r\n d[a]=b\r\nl=[]\r\nfor i in input().split(\" \"):\r\n if(len(i)<len(d[i])):\r\n l.append(i)\r\n elif(len(i)>len(d[i])):\r\n l.append(d[i])\r\n else:\r\n l.append(i)\r\n\r\nprint(\" \".join(l))\r\n\r\n", "nm = input('').split(' ')\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nszt = {}\r\nfor i in range(m):\r\n tmp = input('').split(' ')\r\n szt[tmp[0]] = tmp[1]\r\nszov = input('').split(' ')\r\nmeg = []\r\nfor i in szov:\r\n if (len(i) <= len(szt[i])):\r\n meg.append(i)\r\n else:\r\n meg.append(szt[i])\r\nprint(' '.join(meg))\r\n", "n,m = map(int,input().split())\r\nd = {}\r\nfor _ in range(m):\r\n l = input().split()\r\n d[l[0]] = l[1]\r\n\r\np = input().split()\r\n\r\nfor i in range(n):\r\n if len(p[i]) <= len(d[p[i]]):\r\n print(p[i],end=' ')\r\n else:\r\n print(d[p[i]],end=' ')", "n,m=[int(x) for x in input().split()]\r\nd={}\r\nfor _ in range(m):\r\n s1,s2=[x for x in input().split()]\r\n l1=len(s1)\r\n l2=len(s2)\r\n if l1>l2:\r\n d[s1]=s2\r\n else:\r\n d[s1]=s1\r\narr=[x for x in input().split()]\r\nfor i in arr:\r\n print(d[i],end=' ')\r\n", "a, b=map(int,input().split())\narr = dict()\nfor i in range(0,b):\n s, d=input().split()\n arr[s] = d\nwords=input().split()\nfor i in words:\n if len(i)<=len(arr[i]):\n print(i,end=\" \")\n else:\n print(arr[i],end=\" \")\n# Tue Dec 13 2022 12:03:09 GMT+0300 (Moscow Standard Time)\n", "n,m=map(int,input().split());o=[];d={}\r\nfor i in range(m):\r\n o.append(list(map(str,input().split())))\r\nfor i in range(len(o)):\r\n d[o[i][0]]=o[i][1]\r\ns=input();k=s.split();S=\"\"\r\nfor i in range(len(k)):\r\n if len(k[i])>len(d[k[i]]):S+=d[k[i]]+\" \"\r\n else:S+=k[i]+\" \"\r\nprint(S)", "s=input().split()\r\namountwords=int(s[0])\r\ndictionary=int(s[1])\r\nwords=[]\r\n\r\nfor j in range(dictionary):\r\n q=input().split()\r\n words.append(q[0])\r\n words.append(q[1])\r\nlecture=input().split()\r\n\r\nfor i in range(amountwords):\r\n index=words.index(lecture[i])\r\n if index%2==0:\r\n if len(words[index])>len(words[index+1]):\r\n lecture[i]=words[index+1]\r\n else:\r\n if len(words[index])>=len(words[index-1]):\r\n lecture[i]=words[index-1]\r\n\r\nprint(' '.join(lecture))\r\n", "q, w = map(int, input().split())\r\ng1 = []\r\ng2 = []\r\nfor i in range(w):\r\n n, m = map(str, input().split())\r\n g1.append(n)\r\n g2.append(m)\r\nk = []\r\nl = [str(a) for a in input().split()]\r\nfor j in range(q):\r\n h = l[j]\r\n h = str(h)\r\n if len(g2[g1.index(h)]) < len(h):\r\n k.append(g2[g1.index(h)])\r\n else:\r\n k.append(h)\r\nprint(*k)", "n, m = [int(x) for x in input().split(' ')]\r\nt = {}\r\n\r\nfor word in range(m):\r\n a, b = input().split(' ')\r\n t[a] = b\r\n\r\ns = input().split(' ')\r\nr = []\r\nfor w in s:\r\n if len(w) <= len(t[w]):\r\n r.append(w)\r\n else:\r\n r.append(t[w])\r\nprint(' '.join(r))", "n , m = map(int , input().split())\r\nx = [None]*m\r\nfor i in range(m):\r\n x[i] = [x for x in input().split()]\r\n \r\ny = [x for x in input().split()]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if y[i] in x[j]:\r\n if len(x[j][0]) <= len(x[j][1]):\r\n y[i] = x[j][0]\r\n else:\r\n y[i] = x[j][1]\r\n\r\nfor i in range(n):\r\n print(y[i] , end = \" \")", "inp1 = inp1 = list(map(int, input().split()))\r\nn = inp1[0]\r\nm = inp1[1]\r\nwords_arr = []\r\nfor i in range(m):\r\n cur_str = input()\r\n words_arr.append(cur_str.split())\r\n\r\nlecture = input().split()\r\n#print(lecture)\r\ndic = {}\r\nfor i in range(m):\r\n lang_one = words_arr[i][0]\r\n lang_two = words_arr[i][1]\r\n if(len(lang_one)<=len(lang_two)):\r\n dic[lang_one] = lang_one\r\n else:\r\n dic[lang_one] = lang_two\r\n#print(dic)\r\n\r\nfor i in lecture:\r\n print(dic[i],end=\" \")\r\n\r\n\r\n", "n,m = map(int, input().split())\r\nd = dict(input().split() for i in range (m))\r\np = input().split()\r\nprint(' '.join(min((w,d[w]), key=len)for w in p))\r\n", "d = {}\r\nfor _ in range(int(input().split()[1])):\r\n x,y = input().split()\r\n d[x] = y\r\nfor s in input().split():\r\n if len(s) > len(d[s]):\r\n print(d[s],end=\" \")\r\n else:\r\n print(s,end=\" \")", "n, m = map(int, input().split())\r\ndb = {}\r\nfor _ in range(m):\r\n s = input().strip().split()\r\n db[s[0]] = s[1]\r\ns = input().strip().split()\r\nfor i in range(n):\r\n if len(db[s[i]]) < len(s[i]):s[i] = db[s[i]]\r\nprint(' '.join(s))", "n,m = list(map(int,input().split()))\r\nb = {}\r\nfor _ in range(m):\r\n i,j = input().split()\r\n b[i] = j \r\nl = input().split()\r\np = []\r\nfor i in l:\r\n if len(b[i])<len(i):\r\n p.append(b[i])\r\n else:\r\n p.append(i)\r\nprint(\" \".join(p))", "temp=str(input()).split(\" \")\nx,y=int(temp[0]),int(temp[1])\nd={}\n\nfor i in range(y):\n temp=[x for x in input().split(\" \")]\n\n d[temp[0]]=temp[0] if len(temp[0])<= len(temp[1]) else temp[1]\nans=\"\"\nfor i in input().split(\" \"):\n ans +=d[i]+\" \"\nprint(ans[:-1])", "n,m = map(int, input().split())\r\nhashmap = dict()\r\nfor __ in range(m):\r\n a,b = input().split()\r\n hashmap[a] = b;\r\ntxt = list(input().split())\r\nans = []\r\nfor i in txt:\r\n ans.append(hashmap[i] if len(hashmap[i]) < len(i) else i)\r\nprint(*ans)", "n, m = map(int, input().split())\ndct = {}\nfor i in range(m):\n lan1, lan2 = map(str, input().split())\n if len(lan2) < len(lan1):\n dct[lan1] = lan2\n else:\n dct[lan1] = lan1\ninp = list(map(str, input().split()))\nfor i in inp:\n print(dct[i], end=\" \")\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\ncheck = dict()\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n check[a] = a\r\n else:\r\n check[a] = b\r\nfor x in input().split():\r\n print(check[x], end=' ')", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(m):\r\n w = input().split()\r\n w = sorted(w, key=lambda x: len(x))\r\n dic[w[1]] = w[0]\r\nwords=input().split()\r\nfor i in words:\r\n if i in dic:\r\n print(dic[i],end=\" \")\r\n else:\r\n print(i,end=\" \")\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\na,b=[],[]\r\nfor i in range(m):\r\n d,e=input().split()\r\n a.append(d)\r\n b.append(e)\r\nc=list(input().split())\r\nfor i in c:\r\n f=a.index(i)\r\n if len(a[f])<=len(b[f]):\r\n print(a[f],end=' ')\r\n else:\r\n print(b[f],end=' ')\r\n", "# '''\r\n# shelby70\r\n# '''\r\nn, m= map(int, input().split())\r\ndict_1= {}\r\n\r\nfor i in range(m):\r\n a,b= map(str, input().split())\r\n dict_1[a]= b\r\n\r\nl= []\r\ninp_l= list(map(str, input().split()))\r\n\r\nfor i in inp_l:\r\n if len(i)<= len(dict_1[i]):\r\n l.append(i)\r\n else:\r\n l.append(dict_1[i])\r\n\r\nprint(*l)", "import math\r\nx,y = map(int,input().split())\r\na = {}\r\nfor i in range(y):\r\n c,b = [*input().split()]\r\n if len(c)<=len(b):\r\n a.setdefault(b,c)\r\n else:\r\n a.setdefault(c,b)\r\ns = [*input().split()]\r\nfor i in s:\r\n print(a.get(i,i),end=\" \")", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(0,m):\r\n\ta,b=map(str,input().split())\r\n\taa=len(a)\r\n\tbb=len(b)\r\n\tif bb<aa:\r\n\t\ts=b\r\n\telse:\r\n\t\ts=a\r\n\tdic[a]=s\r\na=list(map(str,input().split()))\r\nfor i in range(0,n):\r\n\tprint(dic[a[i]],end=\" \")\r\nprint(\"\")", "from collections import Counter,defaultdict\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(str,input().split()))\r\nn,m=M()\r\nd={}\r\nfor _ in range(m):\r\n a,b=map(str,input().split())\r\n d[a]=b\r\na=LI()\r\nb=[]\r\nfor i in range(len(a)):\r\n if len(a[i])>len(d[a[i]]):\r\n b+=[d[a[i]]]\r\n else:\r\n b+=[a[i]]\r\nprint(*b)\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nbrr=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n arr.append(a);brr.append(b)\r\nc=input().split()\r\nans=[]\r\nfor i in c:\r\n k=arr.index(i)\r\n if len(brr[k])<len(arr[k]):\r\n ans.append(brr[k])\r\n else:\r\n ans.append(i)\r\nprint(*ans)", "x=list(map(int,input().split()))\r\ndic=dict()\r\nfor i in range(x[1]):\r\n string = input().split()\r\n if len(string[0])<=len(string[1]):\r\n dic[string[0]]=dic[string[1]]=string[0]\r\n else:\r\n dic[string[0]] = dic[string[1]] = string[1]\r\nans=[]\r\nfor a in input().split():\r\n ans.append(dic[a])\r\nprint(\" \".join(ans))\r\n", "passage, words = [int(i) for i in input().split()]\r\nlist1 = []\r\nlist2 = []\r\n\r\nfor i in range(words):\r\n language = [str(i) for i in input().split()]\r\n if len(language[0]) > len(language[1]):\r\n list1.append(language[1])\r\n list2.append(language[0])\r\n else:\r\n list1.append(language[0])\r\n list2.append(language[1])\r\n\r\nrealPassage = [str(i) for i in input().split()]\r\nfor i in realPassage:\r\n if i in list1:\r\n print(i, end=\" \")\r\n else:\r\n place = list2.index(i)\r\n print(list1[place], end=\" \")", "n, m = map(int, input().split())\n\nlanguages1 = {}\nlanguages2 = {}\n\nfor i in range(m):\n x, y = input().split()\n languages1[x] = y\n languages2[y] = x\n\nprofessor = list(input().split())\n\nfor i in range(len(professor)):\n try:\n if len(languages1[professor[i]]) < len(professor[i]):\n professor[i] = languages1[professor[i]]\n except KeyError:\n if len(languages2[professor[i]]) < len(professor[i]):\n professor[i] = languages2[professor[i]]\n\nprint(*professor)", "import sys\r\n\r\nwords = {}\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\nfor _ in range(m):\r\n s1, s2 = sys.stdin.readline().split()\r\n ans = s1 if len(s1) <= len(s2) else s2\r\n words[s1] = ans\r\n words[s2] = ans\r\n\r\nprint(\" \".join(map(lambda x : words[x], sys.stdin.readline().split())))", "n,m=map(int,input().split())\r\nd={}\r\n\r\nresult=\"\"\r\nfor _ in range(m):\r\n a,b=input().split()\r\n d[a]=b\r\ns=input().split() \r\nfor i in range(n):\r\n result+=s[i] if len(s[i])<=len(d[s[i]]) else d[s[i]]\r\n result+=\" \"\r\n \r\nprint(result.rstrip())", "import string\r\n\r\ndef return_string(inputString):\r\n return inputString\r\n\r\nn, m = map(int, input().split())\r\nword_dictionary = dict()\r\nfor _ in range(m):\r\n a, b = map(return_string, input().split())\r\n word_dictionary[a] = a if(len(a) <= len(b)) else b\r\n\r\ninputStringList = list(map(return_string, input().split()))\r\noutputString = ''\r\nfor i in range(n):\r\n outputString += word_dictionary[inputStringList[i]] + ' '\r\n\r\nprint(outputString)", "import math, heapq\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple, OrderedDict\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\nfrom itertools import permutations\r\nfrom copy import deepcopy\r\n\r\n \r\ndef sieve_of_eratosthenes(n):\r\n is_prime = [True] * (n+1)\r\n is_prime[0] = is_prime[1] = False\r\n for p in range(2, int(n**0.5)+1):\r\n if is_prime[p]:\r\n for i in range(p*p, n+1, p):\r\n is_prime[i] = False\r\n \r\n for i in range(2, n+1):\r\n if is_prime[i]:\r\n print(i, end=' ')\r\n\r\n\r\ndef isPowerOf2(n):\r\n\r\n def log2(x):\r\n\r\n if x == 0:\r\n return False\r\n\r\n return (math.log10(x)/math.log10(2))\r\n\r\n\r\n return math.ceil(log2(n)) == math.floor(log2(n))\r\n\r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n\r\n\r\ndef readint():\r\n return int(input())\r\n\r\n\r\n\r\nn, m = readarray(int)\r\n\r\n\r\nd = defaultdict(str)\r\n\r\nfor _ in range(m):\r\n\r\n first_lang, second_lang = readarray(str)\r\n\r\n d[first_lang] = second_lang\r\n\r\nans = \"\"\r\n\r\nfor char in readarray(str):\r\n ans += min(char, d[char], key=len) + \" \" \r\n\r\nans.strip()\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nd=dict(input().split() for _ in range(m))\r\nprint(' '.join(s if len(s)<=len(d[s])else d[s] for s in input().split()))", "n,m=map(int,input().split())\r\ns=dict()\r\nfor i in range(m):\r\n a,s[a]=map(str,input().split())\r\nc=input().split()\r\nfor i in range(n):\r\n if len(c[i])>len(s[c[i]]):\r\n print(s[c[i]])\r\n else:\r\n print(c[i])\r\n", "def f(n, t):\n q = []\n f = []\n for _ in range(t):\n q += [i for i in input().split()]\n s = input().split()\n for i in range(n):\n rr = q.index(s[i])\n if (len(q[rr]) <= len(q[rr+1])):\n f.append(q[rr])\n else: f.append(q[rr+1])\n print(*f, sep=\" \")\n\n\nn, t = map(int, input().split())\nf(n, t)", "n, m = [int(i) for i in input().split()]\r\nwords = {}\r\nfor i in range(m):\r\n q = input().split()\r\n words[q[0]] = q[1]\r\n\r\nlecture = input().split()\r\nfor i, e in enumerate(lecture):\r\n if len(words[e]) < len(e):\r\n lecture[i] = words[e]\r\n\r\nprint(*lecture)\r\n", "n,m = map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n a,b = map(str,input().split())\r\n l.append(a)\r\n l.append(b)\r\nword = list(map(str,input().split()))\r\nout = []\r\nfor i in word:\r\n t = l.index(i)\r\n if t%2==0:\r\n if len(l[t])>len(l[t+1]):\r\n out.append(l[t+1])\r\n else:\r\n out.append(l[t])\r\n else:\r\n if len(l[t])>len(l[t-1]):\r\n out.append(l[t-1])\r\n else:\r\n out.append(l[t])\r\n \r\nprint(*out,sep=\" \")", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(m):\r\n l = list(input().split())\r\n arr.append(l)\r\ns = list(input().split())\r\n\r\ndict = {}\r\nfor i in range(m):\r\n if len(arr[i][0]) == len(arr[i][1]):\r\n dict[arr[i][0]] = arr[i][0]\r\n elif len(arr[i][0]) > len(arr[i][1]):\r\n dict[arr[i][0]] = arr[i][1]\r\n else:\r\n dict[arr[i][0]] = arr[i][0]\r\n\r\nfor i in range(n):\r\n s[i] = dict[s[i]]\r\n\r\nprint(' '.join(s))", "n,m=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nfor i in range(m):\r\n\ta,b=input().split()\r\n\tl1.append(a)\r\n\tl2.append(b)\r\ns=input().split()\r\nfor i in range(len(s)):\r\n\tif s[i] in l1:\r\n\t\ta=len(s[i])\r\n\t\tb=len(l2[l1.index(s[i])])\r\n\t\tif(a>b):\r\n\t\t\ts[i]=l2[l1.index(s[i])]\r\n\telse:\r\n\t\tb=len(s[i])\r\n\t\ta=len(l1[l2.index(s[i])])\r\n\t\tif(a<=b):\r\n\t\t\ts[i]=l1[l2.index(s[i])]\r\nprint(*s)", "import sys\r\n\r\na , b = map(int, input().split())\r\n\r\ndic = []\r\n\r\nfor _ in range(b):\r\n dic +=[sys.stdin.readline().split()]\r\n\r\nans = []\r\nref = [dic[i][0] for i in range(b)]\r\nfor i in sys.stdin.readline().split():\r\n ind = ref.index(i)\r\n if len(dic[ind][0])<=len(dic[ind][1]):\r\n ans +=[dic[ind][0]]\r\n else:\r\n ans +=[dic[ind][1]]\r\n \r\n \r\n \r\nprint(\" \".join(ans))\r\n", "### Codeforces handle - \"@titanalpha\"\r\n#Email id - [email protected]\r\n \r\nfrom collections import Counter, deque\r\nfrom collections import OrderedDict\r\nimport math\r\nfrom random import randint\r\nfrom bisect import bisect\r\nimport sys\r\nimport re\r\n \r\nMOD = 10**9 + 7\r\nMAX = sys.maxsize\r\nMIN = -sys.maxsize\r\n \r\nclass get:\r\n def int():\r\n return list(map(int,input().split()))\r\n def str():\r\n return input().split()\r\n def float():\r\n return list(map(float,input().split()))\r\n def map():\r\n return map(int,input().split())\r\n \r\n\r\ndef sqrt(x):\r\n return int(math.sqrt(x))+1\r\n \r\ndef gcd(*args):\r\n result = args[0]\r\n for item in args:\r\n result = math.gcd(result,item)\r\n return result\r\n \r\ndef LCM(a,b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\ndef isPrime(n):\r\n if n == 1:\r\n return False\r\n for i in range(2,sqrt(n)):\r\n if n%i == 0:\r\n return False\r\n return True\r\n \r\ndef solve():\r\n n,m = get.map()\r\n d = {}\r\n for i in range(m):\r\n a,b = input().split()\r\n d[a] = b\r\n arr = get.str()\r\n res = []\r\n for i in arr:\r\n if len(d[i]) < len(i):\r\n res.append(d[i])\r\n else:\r\n res.append(i)\r\n print(\" \".join(res))\r\n \r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n# t = int(input())\r\n# for tt in range(t):\r\n solve()", "N,M=list(map(int,input().split()))\r\nDic={}\r\nfor K in range(M):\r\n Word=list(input().split())\r\n Dic[Word[0]]=Word[1]\r\nTexto=list(input().split())\r\nCad=\"\"\r\nfor Palabra in Texto:\r\n X=len(Palabra)\r\n Y=len(Dic[Palabra])\r\n if(X<=Y):\r\n Cad=Cad+Palabra+\" \"\r\n else:\r\n Cad=Cad+Dic[Palabra]+\" \"\r\nprint(Cad[:len(Cad)-1])\r\n", "def func(n):\n dictionary = dict(input().split() for i in range(n[1]))\n text = input().split()\n ans = []\n for i in text:\n ans.append(min(i,dictionary[i],key=len))\n print(' '.join(ans))\nn = list(map(int,input().split()))\nfunc(n)", "R=lambda:map(int, input().split())\r\n\r\nn ,m = R()\r\n\r\nval = {}\r\n\r\nfor _ in range(m):\r\n a,b = input().split()\r\n val[a] = b\r\n\r\nfor s in input().split():\r\n print(s if len(s) <= len(val[s]) else val[s], end=' ')", "\r\nn, m = list(map(int, input().split()))\r\n\r\nword_map = {}\r\n\r\nwhile m:\r\n\r\n a, b = input().split()\r\n\r\n word_map[a] = b\r\n\r\n m -= 1\r\n\r\nin_string = input().split()\r\nout_string = []\r\n\r\nfor word in in_string:\r\n\r\n if len(word) > len(word_map[word]):\r\n out_string.append(word_map[word])\r\n\r\n else:\r\n out_string.append(word)\r\n\r\n\r\nprint(\" \".join(out_string))", "n, m = map(int, input().split())\r\n\r\n# Create dictionaries to store the word mappings\r\nl1 = {}\r\nl2 = {}\r\n\r\n# Read the word mappings\r\nfor _ in range(m):\r\n word1, word2 = input().split()\r\n l1[word1] = word2\r\n # l2[word2] = word1\r\n\r\n# Read the lecture text\r\nlecture = input().split()\r\n\r\n# Convert the lecture text to your notebook recording\r\nnotebook_recording = []\r\nfor word in lecture:\r\n \r\n if len(l1[word]) < len(word):\r\n notebook_recording.append(l1[word])\r\n else:\r\n notebook_recording.append(word)\r\n\r\n# Print the notebook recording\r\nprint(\" \".join(notebook_recording))", "def record_lecture(n, m, words, lecture):\r\n translations = {}\r\n for i in range(m):\r\n word1, word2 = words[i]\r\n translations[word1] = word2\r\n\r\n recorded_lecture = []\r\n for word in lecture:\r\n corresponding_word = translations[word]\r\n recorded_lecture.append(word if len(word) <= len(corresponding_word) else corresponding_word)\r\n\r\n return recorded_lecture\r\n\r\ndef main():\r\n n, m = map(int, input().split()) # Number of words in lecture and number of words in each language\r\n words = [input().split() for _ in range(m)] # Words in both languages\r\n lecture = input().split() # Text of the lecture\r\n\r\n result = record_lecture(n, m, words, lecture)\r\n print(*result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = [int(i) for i in input().split()]\r\nalph1 = []\r\nalph2 = []\r\nfor i in range(m):\r\n a, b = input().split()\r\n alph1.append(a)\r\n alph2.append(b)\r\nl = input().split()\r\nfor i in l:\r\n a = len(i)\r\n b = alph2[alph1.index(i)]\r\n c = len(b)\r\n if a > c:\r\n print(b, end = \" \")\r\n else:\r\n print(i, end=\" \")", "a,b = [int(i) for i in input().split(' ')]\ndict_number= {}\nfor i in range(b):\n s = input().split(' ')\n if len(s[0])>len(s[1]):\n dict_number[s[0]]=s[1]\n else:\n dict_number[s[0]]=s[0]\ns = input().split(' ')\nprint((' ').join([dict_number[i] for i in s]))", "a,b=map(int,input().split())\nc={}\nfor i in range(b):\n x,y=input().split()\n if len(x)<=len(y):\n c[x]=x\n elif len(x)>len(y):\n c[x]=y\nz=input().split()\nfor i in z:\n print(c[i],end=\" \")\n\n\t \t \t\t \t \t\t \t \t\t \t", "(lec,r)=[int(x) for x in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(r):\r\n (w1,w2)=input().split()\r\n a.append(w1)\r\n b.append(w2)\r\nn=input().split()\r\nfor i in range(len(n)):\r\n if len(b[a.index(n[i])])<len(n[i]):\r\n n[i]=b[a.index(n[i])]\r\nprint(*n,sep=' ')", "n, m=map(int, input().split())\r\nd={}\r\nfor x in range(m):\r\n c=input().split()\r\n a, b=c\r\n d[a]=b\r\n\r\nl=[x for x in input().split()]\r\nfor x in range(len(l)):\r\n if len(l[x])>len(d[l[x]]):\r\n l[x]=d[l[x]]\r\nfor x in l:\r\n print(x, end=' ')\r\nprint()", "a = input()\r\na = a.split(\" \")\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\n\r\nc = []\r\nfor j in range(a[1]+1):\r\n b = input()\r\n c.append(b)\r\n\r\ns = c.pop()\r\n\r\nd = []\r\nfor k in range(len(c)):\r\n c[k] = c[k].split(\" \")\r\n d.append(c[k])\r\n\r\ns = s.split(\" \")\r\ne = []\r\nfor l in range(len(s)):\r\n for m in range(len(d)):\r\n if s[l] == d[m][0]:\r\n if len(d[m][0]) <= len(d[m][1]):\r\n e.append(d[m][0])\r\n else: \r\n e.append(d[m][1])\r\n else: \r\n pass\r\n \r\nf = ' '\r\nf = f.join(e)\r\nprint(f)", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n a,b=input().split()\r\n d.update({a:b})\r\n#print(d)\r\nans=[]\r\ns=input().split()\r\nfor x in s:\r\n if len(x)>len(d[x]):\r\n ans.append(d[x])\r\n elif len(x)<len(d[x]):\r\n ans.append(x)\r\n else:\r\n ans.append(x)\r\nprint(*ans)\r\n ", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n x,y=input().split()\r\n d[x]=y\r\ns=list(input().split())\r\nfor i in range(n):\r\n if len(s[i])>len(d[s[i]]): s[i]=d[s[i]]\r\nprint(' '.join(s))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 18 04:58:06 2020\r\n\r\n@author: Tanmay\r\n\"\"\"\r\n\r\n# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Aug 18 04:45:32 2020\r\n\r\n@author: Tanmay\r\n\"\"\"\r\n\r\nans=[]\r\nn,m=map(int,input().strip().split())\r\nlis=[]\r\nfor _ in range(m):\r\n arr=list(input().split())\r\n lis.append(arr)\r\nc=list(input().split())\r\nfor i in range(n):\r\n for j in range(len(lis)):\r\n if(lis[j][0]==c[i]):\r\n if(len(lis[j][0])<=len(lis[j][1])):\r\n ans.append(lis[j][0])\r\n else:\r\n ans.append(lis[j][1])\r\n elif(lis[j][1]==c[i]):\r\n if(len(lis[j][0])<=len(lis[j][1])):\r\n ans.append(lis[j][0])\r\n else:\r\n ans.append(lis[j][1])\r\nprint(*ans)\r\n ", "n, m = map(int, input().split())\r\nresult2 = []\r\nresult1 = []\r\nfor i in range(m):\r\n inp = input().split()\r\n result1.append(inp[0])\r\n if len(inp[1]) < len(inp[0]):\r\n result2.append(inp[1])\r\n else:\r\n result2.append(inp[0])\r\n\r\nql = list(input().split())\r\n\r\nfor i in range(len(ql)):\r\n index = result1.index(ql[i])\r\n ql[i] = result2[index]\r\n\r\nprint(' '.join(ql))\r\n", "n,m=map(int,input().split())\r\nN=[]\r\nM=[]\r\nk=''\r\nwhile m>0:\r\n m-=1\r\n X,Y=map(str,input().split())\r\n N.append(X)\r\n M.append(Y)\r\nS=list(map(str,input().split()))\r\nfor i in range(n):\r\n a=N.index(S[i])\r\n if i==0:\r\n if len(N[a])>len(M[a]):\r\n k+=M[a]\r\n else:\r\n k+=N[a]\r\n else:\r\n \r\n if len(N[a])>len(M[a]):\r\n k+=' '+M[a]\r\n else:\r\n k+=' '+N[a]\r\nprint(k)", "s = input().split(\" \")\r\nn = int(s[0])\r\nm = int(s[1])\r\nd = dict()\r\nfor i in range(m):\r\n s = input().split(\" \")\r\n d[s[0]] = s[1]\r\ns = input().split(\" \")\r\nr = \"\"\r\nfor c in s:\r\n if(len(c) > len(d[c])):\r\n r += d[c]+\" \"\r\n else:\r\n r += c + \" \"\r\nprint(r[:-1])\r\n \r\n \r\n", "n, m = map(int, input().split())\r\ntranslate = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n translate[a] = b\r\n translate[b] = a\r\nprint(*map(lambda x: min(x, translate[x], key=len), input().split()))\r\n", "prof_words, lag_word = map(int, input().split())\r\nwords_dict2 = dict(); words_dict1 = dict()\r\nfor i in range(lag_word):\r\n key1, key2 = input().split()\r\n words_dict2[key1] = key2;\r\n words_dict1[key2] = key1;\r\nfinal_sentence = input().split()\r\noutput_sentence = list()\r\nfor word in final_sentence:\r\n if word in words_dict1.keys():\r\n word2 = words_dict1[word]\r\n if(len(word2) > len(word)):\r\n output_sentence.append(word)\r\n elif(len(word2) == len(word)):\r\n output_sentence.append(word2)\r\n else:\r\n output_sentence.append(word2)\r\n else:\r\n word2 = words_dict2[word]\r\n if(len(word2) > len(word)):\r\n output_sentence.append(word)\r\n elif(len(word2) == len(word)):\r\n output_sentence.append(word)\r\n else:\r\n output_sentence.append(word2)\r\nfor word in output_sentence:\r\n print(word, end = \" \")\r\nprint()", "import sys\n\n\ndef print_lecture():\n return 0\n\n\nif __name__ == '__main__':\n\n n, m = map(int, sys.stdin.readline().split())\n\n mapping = {}\n for word_pairs in range(m):\n a, b = list(sys.stdin.readline().split())\n if len(b) < len(a):\n mapping[a] = b\n\n words = sys.stdin.readline().split()\n\n for word in words:\n if word in mapping:\n sys.stdout.write(mapping[word] + \" \")\n else:\n sys.stdout.write(word + \" \")\n", "n, m = map(int, input().split())\r\ndick = {}\r\nfor _ in ' '*m:\r\n a, b = input().split()\r\n dick[a] = b if len(b) < len(a) else a\r\n \r\nout = []\r\nfor i in input().split(): out += [dick[i]]\r\nprint(*out)", "n,m = map(int,input().split())\r\nd = {}\r\nfor i in range(m):\r\n a,b = input().split()\r\n if(len(a)<=len(b)):\r\n d[a] =a\r\n else:\r\n d[a] = b\r\n\r\nl = input().split()\r\nfor i in range(len(l)):\r\n print(d[l[i]],end=' ')\r\n\r\n", "# for _ in range(int(input())):\r\nn,m=map(int,input().split())\r\nmp={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n mp[a]=b\r\nscript=list(input().split())\r\nans=\"\"\r\nfor i in script:\r\n if len(i)<len(mp[i]):\r\n ans+=i+\" \"\r\n elif len(i)>len(mp[i]):\r\n ans+=mp[i]+\" \"\r\n else:\r\n ans+=i+\" \"\r\nprint(ans)\r\n\r\n", "def solve(n,m,meanings ,text):\n\tans=''\n\tfor i in text.split() :\n\t\tx= i if len(i) <= len(meanings[i]) else meanings[i]\n\t\tans = ans + x + ' '\n\treturn ans.strip()\n\t\n\t\n\n \n \n \nfrom sys import stdin\ninput = stdin.readline\n\nn,m=[int(x) for x in input().split()]\nmeanings={}\nfor i in range(m) :\n\tfirst,second=[x for x in input().split()]\n\tmeanings[first] = second\ntext = input()\n\nprint(solve(n,m,meanings ,text))", "def solve(arr, dic, s=\"\"):\r\n for ch in arr:\r\n if len(dic[ch]) >= len(ch):\r\n s += ch + \" \"\r\n else:\r\n s += dic[ch] + \" \"\r\n return s\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n dic = {}\r\n for i in range(m):\r\n a, b = map(str, input().split())\r\n dic[a] = b\r\n s = solve(input().split(), dic)\r\n print(s)\r\n\r\n\r\nmain()\r\n", "#code\n#print(\"GfG\")\nn, m = map(int,input().strip().split())\nlst1 = []\nlst2 = []\nlstn = []\nfor _ in range(m):\n a,b = input().strip().split()\n lst1.append(a)\n lst2.append(b)\nlstn = list(input().strip().split())\n#lstn.append(new)\n#print(lstn)\nfor i in range(n):\n if lstn[i] in lst1:\n v = lst1.index(lstn[i])\n if len(lst2[v]) < len(lst1[v]):\n print(lst2[v], end = \" \")\n else:\n print(lst1[v], end = \" \")\n \t\t \t \t \t\t \t \t\t \t\t\t", "n, m = (int(x) for x in input().split())\nab = {}\nfor i in range(m):\n x = input().split()\n ab[x[0]] = x[1]\ns = ' '.join(w if len(w) <= len(ab[w]) else ab[w] for w in input().split())\nprint(s)", "n, m = input().split()\nn = int(n)\nm = int(m)\nmp = {}\nfor i in range(m):\n s = input().split()\n mp[s[0]] = s[1]\n\nwords = input().split()\nfor i in range(n):\n if len(words[i]) <= len(mp[words[i]]):\n print(words[i], end=\" \")\n else:\n print(mp[words[i]], end=\" \")\n\n\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(m):\r\n aa, bb = map(str, input().split())\r\n a.append(aa)\r\n b.append(bb)\r\ns = list(input().split())\r\nfor i in s:\r\n if len(i) > len(b[a.index(i)]):\r\n print(b[a.index(i)], end=\" \")\r\n else:\r\n print(i, end=\" \")\r\n\r\n \r\n\r\n\r\n", "import sys,math,collections\r\nfrom collections import defaultdict\r\n\r\n#from itertools import permutations,combinations\r\n\t\r\ndef file():\r\n\tsys.stdin = open('input.py', 'r')\r\n\tsys.stdout = open('output.py', 'w') \r\ndef get_array():\r\n\tl=list(map(int, input().split()))\r\n\treturn l\r\ndef get_2_ints():\t\r\n\ta,b=map(int, input().split())\r\n\treturn a,b\r\ndef get_3_ints():\t\r\n\ta,b,c=map(int, input().split())\r\n\treturn a,b,c\t\r\ndef sod(n):\r\n\tn,c=str(n),0\r\n\tfor i in n:\t\r\n\t\tc+=int(i)\r\n\treturn c\t\r\ndef isPrime(n):\r\n if (n <= 1):\r\n return False\r\n if (n <= 3):\r\n return True\r\n if (n % 2 == 0 or n % 3 == 0):\r\n return False\r\n i = 5\r\n while(i * i <= n):\r\n if (n % i == 0 or n % (i + 2) == 0):\r\n return False\r\n i = i + 6\r\n \r\n return True\r\ndef getFloor(A, x):\r\n\r\n\t(left, right) = (0, len(A) - 1)\r\n\r\n\tfloor = -1\r\n\twhile left <= right:\r\n\t\tmid = (left + right) // 2\r\n\t\tif A[mid] == x:\r\n\t\t\treturn A[mid]\r\n\t\telif x < A[mid]:\r\n\t\t\tright = mid - 1\r\n\t\telse:\r\n\t\t\tfloor = A[mid]\r\n\t\t\tleft = mid + 1\r\n\t\t\t\r\n\treturn floor\r\ndef floorSqrt(x) : \r\n \r\n # Base cases \r\n if (x == 0 or x == 1) : \r\n return x \r\n \r\n # Do Binary Search for floor(sqrt(x)) \r\n start = 1\r\n end = x \r\n while (start <= end) : \r\n mid = (start + end) // 2\r\n \r\n # If x is a perfect square \r\n if (mid*mid == x) : \r\n return mid \r\n \r\n # Since we need floor, we update \r\n # answer when mid*mid is smaller \r\n # than x, and move closer to sqrt(x) \r\n if (mid * mid < x) : \r\n start = mid + 1\r\n ans = mid \r\n \r\n else : \r\n \r\n # If mid*mid is greater than x \r\n end = mid-1\r\n \r\n return ans\t\r\n#file()\r\ndef main():\r\n\t#for tt in range(int(input())):\r\n\tn,m=get_2_ints()\r\n\td={}\r\n\tfor i in range(m):\r\n\t\ta,b=input().split()\r\n\t\td[a]=b\r\n\t#print(d)\t\r\n\tans=[]\r\n\ts=list(input().split())\r\n\tfor i in s:\r\n\t\tif(len(i)<len(d[i])):\r\n\t\t\tans.append(i)\r\n\t\telif(len(i)>len(d[i])):\r\n\t\t\tans.append(d[i])\r\n\t\telse:\r\n\t\t\tans.append(i)\r\n\tprint(\" \".join(ans))\t\t\r\n\r\n\r\n\r\n\r\n\r\n\t\t\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\t\r\n\r\n\t\r\n\t\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t\r\n\t\t\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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\t\t\t\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\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\r\n\r\n\r\n\r\n\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n dic[a]=b\r\ns=input().split()\r\nfor i in range(n):\r\n if(len(s[i])>len(dic[s[i]])):\r\n s[i]=dic[s[i]]\r\nfor i in range(n):\r\n print(s[i],end=\" \")", "n,m=map(int,input().split())\r\nthe_dict={}\r\n\r\nfor i in range(m):\r\n key,value=map(str,input().split())\r\n the_dict[key]=value\r\n \r\nthe_string=list(input().split())\r\nresult=[]\r\nfor i in range(len(the_string)):\r\n if len(the_dict[the_string[i]]) < len(the_string[i]):\r\n result.append(the_dict[the_string[i]])\r\n else:\r\n result.append(the_string[i])\r\nprint(\" \".join(result)) \r\n ", "input_line_1 = input()\r\ninput_list_1 = input_line_1.split(\" \")\r\n\r\nlenght_of_lecture = int(input_list_1[0])\r\nnumber_of_trans = int(input_list_1[1])\r\n\r\nlist_of_trans = {}\r\n\r\nfor i in range(number_of_trans):\r\n input_line = input()\r\n input_list = input_line.split(\" \")\r\n\r\n list_of_trans[input_list[0]] = input_list[1]\r\n\r\ninput_line_m = input()\r\nlecture = input_line_m.split(\" \")\r\n\r\n# print(list_of_trans)\r\n# print()\r\n\r\n\r\ntrans_lecture = ''\r\n\r\nfor word in lecture:\r\n # print(word)\r\n if len(word) <= len(list_of_trans[word]):\r\n trans_lecture += word\r\n else:\r\n trans_lecture += list_of_trans[word]\r\n \r\n trans_lecture += ' '\r\n\r\nprint(trans_lecture)\r\n\r\n\r\n\r\n\r\n \r\n", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n a, b = map(str, input().split())\r\n if len(a) <= len(b):\r\n words[a] = a\r\n words[b] = a\r\n else:\r\n words[b] = b\r\n words[a] = b\r\n\r\nlecture = list(input().split())\r\nans = \"\"\r\nfor i in range(n):\r\n if i<n-1:\r\n ans += words[lecture[i]] + \" \"\r\n else:\r\n ans += words[lecture[i]]\r\n\r\nprint(ans) ", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n z=input().split()\r\n if len(z[0])==len(z[1]):\r\n d[z[1]]=z[0]\r\n\r\n elif len(z[0])>len(z[1]):\r\n d[z[0]]=z[1]\r\n else:\r\n d[z[1]]=z[0]\r\nz=input().split()\r\ns=\"\"\r\nfor i in z:\r\n if d.get(i,-1)==-1:\r\n d[i]=i\r\n s+=d[i]+\" \"\r\n else:\r\n s+=d[i]+\" \"\r\n\r\nprint(s) \r\n \r\n\r\n", "n,m=list(map(int,input().split(' ')))\r\nWordDict1={};WordDict2={}\r\nfor _ in range(m):\r\n word1,word2=input().split(' ')\r\n WordDict1[word1]=word2\r\n WordDict2[word2]=word1\r\nsentence=input().split(' ')\r\nfor word in sentence:\r\n if word in WordDict2 and len(word)>=len(WordDict2[word]):\r\n sentence[sentence.index(word)]=WordDict2[word]\r\n elif word in WordDict1 and len(word)>len(WordDict1[word]):\r\n sentence[sentence.index(word)]=WordDict1[word]\r\n\r\nprint(' '.join(sentence))", "def solve(dict, sentence):\r\n\r\n notesSentence = []\r\n\r\n for word in sentence:\r\n\r\n mappedWord = dict[word]\r\n\r\n if len(mappedWord) < len(word):\r\n notesSentence.append(mappedWord)\r\n else:\r\n notesSentence.append(word)\r\n\r\n return ' '.join(notesSentence)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n,m = map(int, input().split(\" \"))\r\n dict = {}\r\n for _m in range(0,m):\r\n words = input().split(\" \")\r\n dict[words[0]] = words[1]\r\n\r\n sentence = input().split(\" \")\r\n\r\n print(solve(dict, sentence))", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nd={}\r\nfor i in range(m):\r\n\tk,v=input().split()\r\n\td[k]=v\r\n\r\ns=input().split()\r\nfor i in s:\r\n\tif len(i)<=len(d[i]):\r\n\t\tprint(i,end=' ')\r\n\telse:\r\n\t\tprint(d[i],end=' ')", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n d[a]=b\r\nl=input().split()\r\nfor i in range(n):\r\n k=d[l[i]]\r\n if len(l[i])>len(k):\r\n l[i]=k\r\nprint(*l)", "#Ram\r\nd={}\r\nx,y = map(int,input().split())\r\n\r\n\r\nfor i in range(y):\r\n s1=input().split()\r\n if len(s1[0])<=len(s1[1]):\r\n d[s1[0]]=s1[0]\r\n else:\r\n d[s1[0]]=s1[1]\r\n\r\nlec=input().split()\r\n\r\n# print(lec)\r\nfor i in lec:\r\n print(d[i],end=\" \")", "n, m = map(int, input().split())\r\ndict_ = dict()\r\nfor i in range(m):\r\n x, y = map(str, input().split())\r\n dict_[x] = y\r\n\r\nc = input().split()\r\nres = []\r\nfor i in range(len(c)):\r\n if len(c[i]) <= len(dict_[c[i]]):\r\n res.append(c[i])\r\n else:\r\n res.append(dict_[c[i]])\r\nprint(' '.join(res))", "n,m=map(int, input().split())\r\nd={}\r\nfor i in range(m):\r\n s1,s2=input().split()\r\n if len(s1)<=len(s2):\r\n s2=s1\r\n d[s1]=s2\r\ns=list(input().split())\r\nfor i in s:\r\n print(d[i],end=' ')", "something = [int(x) for x in input().split()]\nfirst = []\nsecond = []\nfor _ in range(something[1]):\n temp = input().split()\n first.append(temp[0])\n second.append(temp[1])\nanswer = \"\"\nfor i in input().split():\n temp = first.index(i)\n if len(first[temp]) > len(second[temp]):\n answer += second[temp]\n answer += \" \"\n elif len(first[temp]) < len(second[temp]):\n answer += first[temp]\n answer += \" \"\n else:\n answer += first[temp]\n answer += \" \"\nprint(answer[:-1])", "n,m=input().split()\r\nm=int(m)\r\nd={}\r\nfor i in range (0,m):\r\n a,b=input().split()\r\n d.update({a:b})\r\nk=input()\r\nl=k.split()\r\nfor i in l:\r\n if(len(i)>len(d[i])):\r\n print(d[i],end=\" \")\r\n else:\r\n print(i,end=\" \")", "n,m = map(int,input().split())\r\na1 = []\r\nb1 = []\r\ns = []\r\nfor i in range(m):\r\n a,b = map(str,input().split())\r\n a1.append(a)\r\n b1.append(b)\r\nc = list(map(str,input().split()))\r\nfor i in range(len(c)):\r\n if c[i] in a1 or c[i] in b1:\r\n x = a1.index(c[i])\r\n la = len(a1[x])\r\n lb = len(b1[x])\r\n if la<=lb:\r\n s.append(a1[x])\r\n else:\r\n s.append(b1[x])\r\nprint(*s)", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n words[a] = b\r\nlecture = list(input().split())\r\nfor i in range(n):\r\n if len(words[lecture[i]]) < len(lecture[i]):\r\n print(words[lecture[i]], end=' ')\r\n else:\r\n print(lecture[i], end=' ')\r\nprint()", "n, m = map(int, input(). split())\r\nq = [ ]\r\nz = 0\r\nc = [ ]\r\nx = 0\r\nwhile m > 0:\r\n a = list(map(str, input(). split()))\r\n q += [a]\r\n m -= 1\r\ns = list(map(str, input(). split()))\r\nwhile n > z:\r\n if s[z] in q[x]:\r\n if len(q[x][0]) <= len(q[x][1]):\r\n c += [q[x][0]]\r\n else:\r\n c += [q[x][1]]\r\n x = 0\r\n z = z + 1\r\n else:\r\n x = x + 1\r\nprint(*c)\r\n", "ans = dict()\r\nn,m = list(map(int,input().split()))\r\nfor i in range(m):\r\n a,b = input().split()\r\n if len(b) < len(a):\r\n a,b = b,a\r\n ans[a],ans[b] = a,a\r\nprint(*[ans[i] for i in input().split()])", "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, m = map(int, input().split())\n wdict = {}\n for _ in range(m):\n w1, w2 = input().split()\n wdict[w1] = w2\n print(\" \".join([wdict[w] if len(wdict[w]) <\n len(w) else w for w in input().split()]))\n\n\nif __name__ == \"__main__\":\n main()\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn,m=map(int,input().split())\r\nd=dict(input().split() for _ in range(m))\r\nprint(' '.join(min((w,d[w]), key=len)for w in input().split()))", "n,m=map(int,input().split())\r\nx=[]\r\ny=[]\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n x.append(a)\r\n y.append(b)\r\n\r\nz=list(map(str,input().split()))\r\nfor i in range(n):\r\n if(len(z[i])>len(y[x.index(z[i])])):\r\n print(y[x.index(z[i])],end=\" \")\r\n else:\r\n print(z[i],end=\" \")\r\nprint() \r\n ", "n, m = [int(x) for x in input().split()]\n\nstore = {}\nfor _ in range(m):\n w1, w2 = input().split()\n store[w1] = w2 if len(w2) < len(w1) else w1\n\n# print(store)\n\nsentence = input().split()\n\nfor i, word in enumerate(sentence):\n sentence[i] = store[word]\n\nprint(\" \".join(sentence))", "lec, dic = list(map(int, input().split()))\n\nlang1 = dict()\nfor _ in range(dic):\n f, s = input().split()\n lang1[f] = s\n\n\ndef get_min(word):\n if len(word) <= len(lang1[word]):\n return word\n return lang1[word]\n\nlecture = input().split()\n\nans = []\nfor word in lecture:\n ans.append(get_min(word))\n\nprint(*ans)", "n,m=map(int,input().split())\r\ndct=dict()\r\nfor i in range(m):\r\n a,b=input().split()\r\n dct[a]=b\r\nfor i in input().split():\r\n print([i,dct[i]][len(i)>len(dct[i])], end=\" \")", "a,b=map(int,input().strip().split()[:2])\r\na1=[]\r\nb1=[]\r\nfor x in range(b):\r\n\tp,q=input().strip().split()[:2]\r\n\ta1.append(p)\r\n\tb1.append(q)\r\ns=input().split()[:a]\r\nfor x in s:\r\n\tk=a1.index(x)\r\n\tl=b1[k]\r\n\tif len(l)<len(a1[k]):\r\n\t\tprint(l,end=' ')\r\n\telse:\r\n\t\tprint(a1[k],end=' ')\r\n", "if __name__ =='__main__':\r\n n, m = map(int, input().split())\r\n dict1 = {}\r\n dict2 = {}\r\n l1 = []\r\n l2 = []\r\n for i in range(0, m):\r\n a, b = input().split()\r\n dict1.update({a : b})\r\n dict2.update({b : a})\r\n l1.append(a)\r\n l2.append(b)\r\n l = []\r\n lecture = input().split()\r\n for word in lecture:\r\n if word in l1:\r\n if len(word) > len(dict1[word]):\r\n l.append(dict1[word])\r\n else:\r\n l.append(word)\r\n else:\r\n if len(word) >= len(dict2[word]):\r\n l.append(dict2[word])\r\n else:\r\n l.append(word)\r\n notes = \" \".join(l)\r\n print(notes)", "n, m = map(int, input().strip().split())\r\n\r\nd = {}\r\nfor x in range(m):\r\n a, b = input().strip().split()\r\n \r\n if a not in d:\r\n d[a] = b\r\n \r\ns = list(input().strip().split())\r\nstrs = \"\"\r\nfor x in range(len(s)):\r\n \r\n if len(s[x]) <= len(d[s[x]]):\r\n strs += s[x] + \" \"\r\n else:\r\n strs += d[s[x]] + \" \"\r\nprint(strs)\r\n\r\n", "n,m=map(int,input().split())\r\na=[]\r\nb=[]\r\nfor i in range(m):\r\n l1,l2=input().split()\r\n a.append(l1)\r\n b.append(l2)\r\nc=list(input().split())\r\nfor j in c:\r\n k=a.index(j)\r\n len1 = len(a[k])\r\n len2 = len(b[k])\r\n if (len2 < len1):\r\n print(b[k], end=\" \")\r\n else:\r\n print(j, end=\" \")", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\ndict1 = {}\r\n\r\nfor i in range(m):\r\n x = input().split()\r\n str1 = x[0]\r\n str2 = x[1]\r\n if len(str1) > len(str2):\r\n dict1[str1] = str2\r\n else:\r\n dict1[str2] = str1\r\n\r\ny = input().split()\r\nfor i in range(len(y)):\r\n if y[i] in dict1:\r\n y[i] = dict1[y[i]]\r\n else:\r\n pass\r\n\r\nprint(*y)", "n, m = map(int, input().split())\r\n\r\na = []\r\n\r\nb = []\r\n\r\nc = []\r\n\r\nres = []\r\n\r\nfor i in range(m):\r\n s1, s2 = map(str, input().split())\r\n\r\n a.append(s1)\r\n b.append(s2)\r\n\r\n if len(s2) < len(s1):\r\n c.append(2)\r\n else:\r\n c.append(1)\r\n\r\ns = list(input().split())\r\n\r\nfor el in s:\r\n if c[a.index(el)] == 1:\r\n res.append(a[a.index(el)])\r\n else:\r\n res.append(b[a.index(el)])\r\n\r\nfor el in res:\r\n print(el, end=' ')\r\n", "import sys\r\nfrom math import *\r\nfrom collections import Counter, defaultdict, deque\r\ninput = sys.stdin.readline\r\nmod = 10**9+7\r\n\r\nn, m = [int(i) for i in input().split()]\r\ninp = []\r\nfor _ in range(m):\r\n inp.append(input().split())\r\nsent = input().split()\r\ndict = {}\r\ns = None\r\nfor t in inp:\r\n\r\n if (len(t[0]) <= len(t[1])):\r\n s = t[0]\r\n else:\r\n s = t[1]\r\n dict[t[0]] = s\r\n dict[t[1]] = s\r\n\r\nans = ''\r\nfor w in sent:\r\n ans += dict[w] + ' '\r\nprint(ans)\r\n", "n , m = map(int , input().split())\nb = {}\nfor i in range(m):\n a =list(input().split())\n if len(a[0])>len(a[1]):\n y=a[0]\n x=a[1]\n else:\n x=a[0]\n y=a[1]\n b.update({y:x})\nc=list(input().split())\n\nfor i in c:\n d=0\n if i in b:\n d = c.index(i) \n c[d]=b[i]\nfor i in c:\n print(i, end=\" \")\n", "n , m = map(int, input().split())\r\ndic = {}\r\nfor i in range(m):\r\n k , v = input().split()\r\n dic[k] = v\r\nst = input().split()\r\nfor i in range(n):\r\n if len(dic[st[i]]) < len(st[i]):\r\n st[i] = dic[st[i]]\r\n else:\r\n pass\r\nprint(*st)", "n, m = map(int, input().split())\r\nd =dict()\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(b) < len(a) :\r\n if a in d :\r\n if len(b) < len(d[a]):\r\n d[a] = b\r\n else :\r\n d[a] = b\r\ns = input().split()\r\nfor i in range(n):\r\n if s[i] in d :\r\n print(d[s[i]], end = \" \")\r\n else :\r\n print(s[i], end = \" \")\r\n", "n, m = map(int, input().split())\nd = dict()\npref = dict()\nfor i in range(m):\n a, b = input().split()\n d[a] = b\n pref[a] = len(b) < len(a)\nans = input().split()\nfor i in range(len(ans)):\n if pref[ans[i]]:\n ans[i] = d[ans[i]]\nprint(*ans)\n", "n, m = map(int, input().split())\r\ndct = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n dct[a] = b\r\ns = input().split()\r\nfor i in s:\r\n print(min(i, dct[i], key=len), end=' ')", "n,m=map(int,input().split())\r\nl1=[0]*m\r\nl2=[0]*m\r\nfor i in range(m):\r\n w1,w2=input().split()\r\n\r\n l1[i]=w1\r\n l2[i]=w2\r\nst=input().split()\r\ns=\"\"\r\nfor i in st:\r\n for j in range(m):\r\n if i==l1[j] and (len(l1[j])==len(l2[j]) or len(l1[j])<len(l2[j])) :\r\n s+=(str(l1[j])+\" \")\r\n elif i==l1[j] and len(l1[j])>len(l2[j]):\r\n s+=(str(l2[j])+\" \")\r\nprint(s)", "n, m = map(int, input().split())\nall_tuples = []\nfor i in range(m):\n all_tuples.append(input().split())\nsentence = input().split()\nvisited = dict()\nfor i in sentence:\n if i in visited:\n print(visited[i], end=\" \")\n continue\n else:\n for j in all_tuples:\n if i in j:\n print(min(j[0],j[1], key=lambda x:len(x)), end=\" \")\n visited[i] = min(j[0],j[1], key=lambda x:len(x))\n\n\n", "# Bismillah\r\n# In the name of GOD\r\n\r\nn, m = map(int, input().split())\r\nwords = {}\r\nfor i in range(m):\r\n s = input().split()\r\n words[s[0]] = s[1]\r\nlecture = input().split()\r\nfor word in lecture:\r\n if len(words[word]) < len(word):\r\n print(words[word], end=' ')\r\n else:\r\n print(word, end=' ')\r\nprint()\r\n", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1])\r\nd = {}\r\nfor _ in range(b):\r\n s = input().split()\r\n d[s[0]] = s[1]\r\nr = []\r\nfor word in input().split():\r\n if len(word) <= len(d[word]):\r\n r.append(word)\r\n else:\r\n r.append(d[word])\r\nprint(' '.join(r))", "s = str(input()).split()\ns[0] = int(s[0])\ns[1] = int(s[1])\n\nl = [[], []]\n\nfor i in range(s[1]):\n p = str(input()).split()\n l[0].append(p[0])\n l[1].append(p[1])\n\ns = str(input()).split()\n\nfor i in range(len(s)):\n j = l[0].index(s[i])\n if len(l[0][j]) <= len(l[1][j]):\n print(l[0][j], end=' ')\n else:\n print(l[1][j], end=' ')", "n,m = map(int,input().split())\r\na = []\r\nb = []\r\nfor i in range(m):\r\n x,y = map(str,input().split())\r\n a.append(x)\r\n b.append(y)\r\nlis = list(map(str,input().split()))\r\ns = \"\"\r\nfor i in lis:\r\n x = a.index(i)\r\n if len(a[x]) > len(b[x]):\r\n s += b[x]\r\n else:\r\n s += a[x]\r\n s += \" \"\r\nprint(s)", "n,m =[int(i)for i in input().split()]\r\nv1=[]\r\nv2=[]\r\nfor i in range(m):\r\n x=[i for i in input().split()]\r\n v1.append(x[0])\r\n v2.append(x[1])\r\na=[i for i in input().split()]\r\ns=[]\r\nfor i in range(n):\r\n if a[i] in v1:\r\n if len(a[i])<=len(v2[v1.index(a[i])]):\r\n s.append(a[i])\r\n else :s.append(v2[v1.index(a[i])])\r\n else: \r\n if len(a[i])<=len(v2[v1.index(a[i])]):\r\n s.append(a[i])\r\n else :s.append(v2[v1.index(a[i])])\r\nprint(' '.join(s))", "n,m=list(map(int,input().split()))\r\nl=[]\r\nres=[]\r\nfor i in range(m):\r\n a,b=list(input().split())\r\n l.append(a)\r\n if len(b)<len(a):\r\n res.append(b)\r\n else:\r\n res.append(a)\r\narr=list(input().split())\r\nfor i in arr:\r\n x=l.index(i)\r\n print(res[x],end=\" \")\r\n", "nm = [int(i) for i in input().split()]\r\nms = []\r\nd = []\r\ndis = dict()\r\nfgfg = []\r\nfor i in range(nm[1]):\r\n d = [i for i in input().split()]\r\n dis[d[0]] = i\r\n fgfg.append(d)\r\nwords = input().split()\r\nfor i in range(nm[0]):\r\n if len(fgfg[dis[words[i]]][0]) <= len(fgfg[dis[words[i]]][1]):\r\n ms.append(fgfg[dis[words[i]]][0])\r\n else:\r\n ms.append(fgfg[dis[words[i]]][1])\r\nprint(*ms)\r\n\n# Thu Jul 07 2022 08:56:49 GMT+0000 (Coordinated Universal Time)\n", "a,b=map(int,input().split())\r\nl=[]\r\nfor i in range(b):\r\n\ta=input()\r\n\tl.extend(a.split())\r\nlec=input().split()\r\nd={}\r\nfor i in range(0,b*2,2):\r\n\tif len(l[i])<=len(l[i+1]):\r\n\t\tx=l[i]\r\n\telse:\r\n\t\tx=l[i+1]\r\n\td[l[i]]=x\r\n\td[l[i+1]]=x\r\nfor i in lec:\r\n\tprint(d[i],end=' ')", "n, m = map(int, input().split(\" \"))\r\n\r\nword_list = {}\r\nfor i in range(m):\r\n x, y = input().split(\" \")\r\n word_list[x] = y\r\n\r\nprofs_speech = input().split(\" \")\r\nres = \"\"\r\n\r\nfor i in profs_speech:\r\n shorter = i if len(word_list[i]) >= len(i) else word_list[i]\r\n res += shorter + \" \"\r\n \r\nprint(res[:-1])", "n, m = map(int, input().split())\nwords = []\nfor i in range(m):\n words.append(input().split())\n\ntext = input().split()\nans = ''\nchosen = dict()\n\nfor a, b in words:\n if len(a) <= len(b):\n chosen[a] = a\n else:\n chosen[a] = b\n\nfor word in text:\n ans += chosen[word] + ' '\n\nprint(ans.rstrip())\n", "n, m = map(int,input().split())\r\ndic={}\r\nfor i in range(m):\r\n s=input()\r\n l=s.split(' ')\r\n #dic[l[0]]=l[1]\r\n key=l[0]\r\n value=l[1]\r\n dic.update({key : value}) \r\n#d={'codeforces':'codesecrof','contest':'round','letter':'message'} \r\nstr= input()\r\nl=str.split(' ')\r\nres=''\r\nfor i in l:\r\n if i in dic:\r\n if(len(i)<=len(dic[i])):\r\n res=res + i + \" \"\r\n else:\r\n res=res+ dic[i] + \" \"\r\nprint(res)\r\n \r\n \r\n", "# 499B\r\n''' Author : Kunj Gandhi '''\r\n\r\n'''Functions'''\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n\r\n'''Code'''\r\nn,m = sp_inp()\r\nd=dict()\r\nfor _ in range(m):\r\n key,val = input().split()\r\n d[key]=val\r\ns = input().split(\" \")\r\nfor i in s:\r\n if(len(i)<=len(d[i])):\r\n print(i,end=\" \")\r\n else: print(d[i],end=\" \")", "n, m = map(int, input().split())\r\nl1, l2, res = [], [], []\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n l1.append(a)\r\n l2.append(b)\r\nindex = -1\r\nc = list(map(str, input().split()))\r\nfor i in c:\r\n if i in l1:\r\n index = l1.index(i)\r\n if i in l2:\r\n index = l2.index(i)\r\n if len(l1[index]) < len(l2[index]) :\r\n res.append(l1[index])\r\n elif len(l1[index]) > len(l2[index]):\r\n res.append(l2[index])\r\n else:\r\n res.append(l1[index])\r\nfor i in res:\r\n print(i, end = ' ')\r\n ", "n,m=[int(x) for x in input().split()]\r\nshort,long=[0]*m,[0]*m\r\nfor i in range(m):\r\n a,b=[x for x in input().split()]\r\n if len(a)<=len(b):\r\n short[i]=a\r\n long[i]=b\r\n else:\r\n short[i]=b\r\n long[i]=a\r\n\r\nc=[x for x in input().split()]\r\n\r\nfor i in range(n):\r\n k=-1\r\n try:\r\n k=long.index(c[i])\r\n except:\r\n ValueError\r\n if k!=-1:\r\n c[i]=short[k]\r\n \r\nprint(*c)", "a,b=map(int, input().split())\r\nx=[]\r\nfor i in range(b):\r\n c=input().split()\r\n x+=[c]\r\nd=input().split()\r\nh=[]\r\nfor i in range(len(x)):\r\n if len(x[i][0])>len(x[i][1]):\r\n h.append(x[i][1])\r\n \r\n else:\r\n h.append(x[i][0])\r\n\r\nfor i in range(len(d)):\r\n if d[i] in h:\r\n continue\r\n else:\r\n for j in range(len(x)):\r\n if d[i] in x[j]:\r\n \r\n d[i]=h[j]\r\nprint(\" \".join(d))\r\n\r\n \r\n", "first_line = input().split()\r\ndic = {}\r\nfor i in range(int(first_line[1])):\r\n second_line = input().split()\r\n dic[second_line[0]]=second_line[1]\r\nlast_line = input().split()\r\nfor i in last_line:\r\n if len(i)==len(dic[i]):\r\n print(i,end=' ')\r\n elif len(i)<len(dic[i]):\r\n print(i,end=' ')\r\n else:\r\n print(dic[i],end=' ')\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n if len(a)>len(b):\r\n b=b+'1'\r\n else:\r\n b=b+'0'\r\n d[a]=b\r\nl=list(input().split())\r\nfor i in l:\r\n if d[i][-1]=='0':\r\n print(i,end=\" \")\r\n else:\r\n print(d[i][:-1],end=\" \")", "n, m = map(int, input().split())\r\ns = {}\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n s[a] = b\r\nm1 = list(map(str, input().split()))\r\nans = \"\"\r\nfor i in range(len(m1)):\r\n if m1[i] in s.keys():\r\n if len(m1[i]) <= len(s[m1[i]]):\r\n ans = ans + m1[i] + \" \"\r\n else:\r\n ans = ans + s[m1[i]] + \" \"\r\nans = ans[:-1]\r\nprint(ans)\r\n\r\n", "n,m=map(int,input().split())\r\ns={};p1={};p2={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n p1[a]=len(a)\r\n p2[b]=len(b)\r\n s[a]=b\r\n\r\nqq=input().split()\r\nans=[0]*n\r\nfor i in range(n):\r\n if p1[qq[i]]<= p2[s[qq[i]]] :\r\n ans[i]=qq[i]\r\n else:\r\n ans[i]=s[qq[i]]\r\n \r\nprint(' '.join(ans))\r\n\r\n", "n, m = map(int, input().split())\r\nwords = []\r\nans = []\r\nb = dict()\r\nfor i in range(m):\r\n a = list(input().split())\r\n b[a[0]] = a[1]\r\n words += [b]\r\nlecture = list(input().split())\r\nfor word in lecture:\r\n if len(word) > len(b[word]):\r\n ans += [b[word]]\r\n else:\r\n ans += [word]\r\nprint(*ans)\r\n", "N,M=input().split()\nN=int(N)\nM=int(M)\nlanguage1=[]\nlanguage2=[]\nfor i in range(M):\n a,b=input().split()\n language1.append(a);\n language2.append(b)\nmyList = [userinput for userinput in input().split(\" \", N-1)]\noutput=\"\"\nfor i in range(N):\n index=language1.index(myList[i])\n translation=language2[index]\n if(len(translation)<len(myList[i])):\n output+=translation+\" \"\n else:\n output+=myList[i]+\" \"\nprint(output)", "d={}\r\nn,m=map(int,input().split())\r\nfor _ in range(m):\r\n f,s=input().split()\r\n d[f]=s\r\nl=[]\r\nfor i in input().split():\r\n l += [i] if len(i)<=len(d[i]) else [d[i]]\r\nprint(*l)\r\n", "n,m = map(int,input().split())\r\n\r\nhashMap = {}\r\n\r\nfor i in range(m):\r\n a,b = input().split()\r\n if len(b)<len(a):\r\n hashMap[a]=b\r\n else:\r\n hashMap[a]=a\r\n\r\nstring = input().split()\r\n\r\nres = []\r\nfor s in string:\r\n res.append(hashMap[s])\r\n\r\nprint(' '.join(res))", "n, m = map(int, input().strip().split())\r\nc = {}\r\nfor _ in range(m):\r\n a, b, = map(str, input().strip().split())\r\n if len(a) > len(b):\r\n c[a] = b\r\n else:\r\n c[a] = a\r\n\r\ns = list(map(str, input().strip().split()))\r\nfor i in s:\r\n print(c[i], \" \", end = \"\", sep = \"\")", "n,m = map(int,input().split())\r\nq = {}\r\nfor i in range(m):\r\n\tc,d = map(str,input().split())\r\n\tif len(c)<=len(d):\r\n\t\tq[c]=c\r\n\t\tq[d]=d\r\n\telse:\r\n\t\tq[c]=d\r\n\t\tq[d]=d\r\n\r\nk = list(map(str,input().split()))\r\nz = []\r\nfor i in range(len(k)):\r\n\tz.append(q[k[i]])\r\nprint(*z)", "d = dict()\r\n\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(m):\r\n\tw1, w2 = input().split()\r\n\tif len(w1) <= len(w2):\r\n\t\td[w1] = w1\r\n\telse:\r\n\t\td[w1] = w2\r\n\r\ns = input().split()\r\nfor i in range(len(s)):\r\n\tprint(d[s[i]], end=' ')", "import math\r\n\r\ninp=input().split(\" \")\r\nn=int(inp[0])\r\nm=int(inp[1])\r\nmapdict={}\r\nfor line in range(0,m):\r\n tw=input().split(\" \")\r\n mapdict[tw[0]]=tw[1]\r\nlecture=input().split(\" \")\r\nfor wor in lecture:\r\n if(len(mapdict[wor])<len(wor)):\r\n print(mapdict[wor],end=\" \")\r\n else:\r\n print(wor,end=\" \")", "n,m=[int(_) for _ in input().split()]\r\nslownik=[]\r\nfor _ in range(m):\r\n a,b=[_ for _ in input().split()]\r\n slownik.append({\"pierwszy\":a, \"drugi\":b})\r\nwyk=[_ for _ in input().split()]\r\nfor slowo in wyk:\r\n print([i['pierwszy'] if len(i['pierwszy'])<=len(i['drugi']) else i['drugi'] for i in slownik if i['pierwszy']==slowo][0], end=\" \")\r\n", "n,m = map(int,input().split())\r\nd = {}\r\nfor i in range(m):\r\n lis = list(input().split())\r\n d.update({lis[0]:lis[1]})\r\nlis = list(input().split())\r\nlst = []\r\nfor i in range(n):\r\n if len(lis[i]) <= len(d[lis[i]]):\r\n lst.append(lis[i])\r\n else:\r\n lst.append(d[lis[i]])\r\nres = ' '.join(lst)\r\nprint(res)", "n, m = map(int, input().split())\r\nM = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n if len(b) < len(a):\r\n M[a] = b\r\n else:\r\n M[a] = a\r\nl = input().split()\r\nprint(\" \".join(M[w] for w in l))\r\n", "n , m = map(int,input().split())\r\n\r\ndictio = []\r\n\r\nfor i in range(m):\r\n x = input().split()\r\n dictio.append(x[0])\r\n dictio.append(x[1])\r\n\r\nquery = input().split()\r\n\r\ns=[]\r\n\r\nfor i in query:\r\n idx = dictio.index(i)\r\n if len(dictio[idx]) <= len(dictio[idx+1]):\r\n s.append(dictio[idx])\r\n else:\r\n s.append(dictio[idx+1])\r\n\r\nprint(*s)\r\n", "n,m=[int(i) for i in input().strip().split()]\ndict={}\nfor i in range(m) :\n a,b=input().split()\n if(len(a)>len(b)):\n dict[a]=b\n dict[b]=b\n else:\n dict[b]=a\n dict[a]=a\nfor i in input().split():\n print(dict[i],end=' ')\nprint(\"\")", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n k,v=input().split()\r\n d[k]=v\r\ns=list(input().split())\r\nfor k in s:\r\n if len(k)<=len(d[k]):\r\n print(k,end=\" \")\r\n else:\r\n print(d[k],end=\" \")\r\n ", "n, m = map(int, input().split())\r\nalist = []\r\nblist = []\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n alist.append(a)\r\n blist.append(b)\r\na = alist\r\nb = blist\r\nc = list(map(str, input().split()))\r\nans = \"\"\r\nfor i in range(n):\r\n index = a.index(c[i])\r\n if len(a[index]) <= len(b[index]):\r\n word = a[index]\r\n else:\r\n word = b[index]\r\n ans += word + \" \"\r\nprint(ans)\r\n", "n, m = map(int, input().split(\" \"))\nd = {}\nfor x in range(m):\n inp = input().split(\" \")\n d[inp[0]] = inp[1]\n\nlect = input().split(\" \")\nfor x in lect:\n p = d[x] if len(d[x]) < len(x) else x\n print(p, end=\" \")\n\n# Sun Mar 05 2023 02:28:48 GMT+0300 (Moscow Standard Time)\n", "a,b=map(int,input().split())\r\nl=[]\r\ns=''\r\nfor i in range(b):\r\n d=list(map(str,input().split()))\r\n l.append(d)\r\np=list(map(str,input().split()))\r\nfor i in p:\r\n for j in l:\r\n if i in j:\r\n if len(j[0])<=len(j[1]):\r\n s=s+' '+j[0]\r\n else:\r\n s=s+' '+j[1]\r\nprint(s.lstrip(' ')) ", "lection_size, dictionary_size = map(int, input().split())\r\n\r\nlanguage_dict = {}\r\nfor _ in range(dictionary_size):\r\n lection_word, translation = input().split()\r\n language_dict[lection_word] = translation\r\n\r\nlection_words = input().split()\r\nfor word in lection_words:\r\n word_abbr = language_dict[word]\r\n result_word = min(word, word_abbr, key=len)\r\n print(result_word, end=' ')\r\n", "from itertools import combinations\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n d = dict()\r\n for _ in range(m):\r\n a, b = input().split()\r\n d[a] = b\r\n lecture = input().split()\r\n for el in lecture:\r\n print(d[el] if len(d[el]) < len(el) else el, end=' ')\r\n\r\n", "n,m=map(int,input().split())\r\nd={}\r\nl={}\r\nle=[]\r\nfor i in range(m):\r\n s=input().split()\r\n l[s[0]]=s[1]\r\n d[s[0]]=len(s[1])\r\ns1=input().split()\r\nfor i in s1:\r\n if len(i)>len(l[i]):\r\n le.append(l[i])\r\n else:\r\n le.append(i)\r\nprint(*le)", "# take n , m\r\n# form dict\r\n# take lecture text\r\n# iterate over each word\r\n# compare word and it's value from dict return the shortest in result array\r\n\r\ndef form_dict(m):\r\n dict = {}\r\n for i in range(m):\r\n key, value = input().split()\r\n dict[key] = value\r\n return dict\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\ndict = form_dict(m)\r\n\r\nlecture_text = input().split()\r\n\r\nshortest = []\r\n\r\nfor i in range(len(lecture_text)):\r\n target = lecture_text[i]\r\n correspondence = dict.get(target)\r\n\r\n if len(target) == len(correspondence):\r\n shortest.append(target)\r\n\r\n elif len(target) < len(correspondence):\r\n shortest.append(target)\r\n\r\n elif len(target) > len(correspondence):\r\n shortest.append(correspondence)\r\n\r\nprint(\" \".join(shortest))\r\n\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if len(a)<=len(b):\r\n d.update({a:a})\r\n else:\r\n d.update({a:b})\r\narr=[str(i) for i in input().split()]\r\nfor i in arr:\r\n print(d[i],end=\" \")\r\n", "m,n=map(int,input().split())\r\n\r\nd={}\r\n\r\nfor _ in range(n):\r\n a,b=input().split()\r\n if(len(a)>len(b)):\r\n d[a]=b\r\n else:\r\n d[a]=a\r\n \r\nres=input().split()\r\n\r\nfor i in res:\r\n print(d[i],end=\" \")\r\n", "n,m=map(int,input().split())\r\nw={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n w[a]=b\r\ns=list(input().split())\r\nans=[]\r\nfor j in s:\r\n if len(w[j])<len(j):\r\n ans.append(w[j])\r\n else:\r\n ans.append(j)\r\nprint(*ans)", "#Лекция\n\nn, m = input().split(\" \")\nn,m = int(n), int(m)\na,b = {},[]\n\nfor i in range(0, m):\n ai,bi = input().split(\" \")\n a[ai] = i\n b.append(bi)\n\nc = input().split(\" \")\n\nfor i in range(0, n):\n alt = b[a[c[i]]]\n if len(alt) < len(c[i]):\n c[i] = alt\n\nprint(\" \".join(c))", "n, m = map(int, input().split())\r\nmaps = {}\r\nfor i in range(m):\r\n teacher, mine = input().split()\r\n maps[teacher] = mine\r\nsentence = input().split()\r\nans = []\r\nfor i in sentence:\r\n if len(i) <= len(maps[i]):\r\n ans.append(i)\r\n else:\r\n ans.append(maps[i])\r\nprint(\" \".join(ans))", "a,b=map(int, input().split());l=[]\r\nc={}\r\nfor _ in range(b):\r\n n, n1 = input().split()\r\n if len(n) > len(n1): c[n] = n1\r\n else: c[n1] = n\r\n\r\nfor i in input().split():\r\n if i in c: l.append(c[i])\r\n else: l.append(i)\r\n\r\nprint(' '.join(l))", "sentence_length,lines = map(int,input().split())\r\nall_lines = []\r\nsentence = []\r\nresult = []\r\nfor i in range(lines):\r\n temp = []\r\n temp.extend(input().split())\r\n all_lines.append(temp)\r\nsentence.extend(input().split())\r\nfor i in sentence:\r\n for j in all_lines:\r\n if i in j:\r\n result.append(sorted(j,key= lambda x : len(x))[0])\r\nprint(\" \".join(result))", "n,m = map(int,input().split())\r\ndict1 ={} \r\nfor i in range(m):\r\n first,second = input().split()\r\n dict1[first] = second\r\nlst = list(map(str,input().split()))\r\nnew_lst = []\r\nfor ele in lst:\r\n if len(ele) == len(dict1[ele]):\r\n new_lst.append(ele)\r\n elif len(ele)>len(dict1[ele]):\r\n new_lst.append(dict1[ele])\r\n else:\r\n new_lst.append(ele)\r\n \r\n \r\nprint(' '.join(new_lst))", "def fu():\r\n return map(int,input().split(' '))\r\nn,m = fu()\r\nW = dict()\r\nfor i in range(m):\r\n w = input().split(' ')\r\n W[w[0]] = w[1]\r\ns = input().split(' ')\r\nS = ''\r\nfor si in s:\r\n if len(si) > len(W[si]):\r\n S+=W[si]+' '\r\n else: S+=si+' '\r\nprint(S[:-1])\r\n", "n,m=list(map(int,input().split()))\r\nd={}\r\nwhile(m!=0):\r\n s1,s2=input().split()\r\n if(len(s1)<=len(s2)):\r\n d[s2]=s1\r\n else:\r\n d[s1]=s2\r\n m-=1\r\nx=input().split()\r\nres=\"\"\r\nfor i in x:\r\n if i in d:\r\n res+=d[i]+' '\r\n else:\r\n res+=i+' '\r\nprint(res.rstrip())\r\n ", "n,m = list(map(int,input().split()))\r\nd = {}\r\nwhile m>0:\r\n old,new = list(map(str,input().split()))\r\n d[old] = new\r\n m-=1\r\nsen = input().split()\r\nres = []\r\nfor i in range(0,len(sen)):\r\n if len(d[sen[i]]) < len(sen[i]):\r\n res.append(d[sen[i]])\r\n else:\r\n res.append(sen[i])\r\nprint(*res,sep = \" \")", "n, m=map(int, input().split())\r\nslo=dict()\r\nfor i in range(m):\r\n a, d=input().split()\r\n slo[a] = d\r\nslox=list(input().split(' '))\r\n\r\nfor word in slox:\r\n sss = slo[word]\r\n if len(word)<=len(sss):\r\n print(word, end = ' ')\r\n else:\r\n print(sss, end = ' ')\n# Sun Dec 11 2022 20:39:17 GMT+0300 (Moscow Standard Time)\n", "n,m=list(map(int,input().split()))\r\na=[]\r\nfor i in range(m):\r\n a.append(list(input().split()))\r\nb=(list(input().split()))\r\nc=[]\r\nd={}\r\nfor j in range(len(a)):\r\n \r\n if len(a[j][1])<len(a[j][0]):\r\n d[a[j][0]]=a[j][1]\r\n else:\r\n d[a[j][0]]=a[j][0]\r\nfor i in b:\r\n c.append(d[i])\r\nprint(*c) ", "string1 = str(input())\r\nn = int(string1.split(\" \")[0])\r\nm = int(string1.split(\" \")[1])\r\nd = {}\r\nfor item in range(m):\r\n string2 = str(input())\r\n a = string2.split(\" \")[0]\r\n b = string2.split(\" \")[1]\r\n if len(a)<=len(b):\r\n d[a]=a\r\n else:\r\n d[a]=b\r\nc = str(input())\r\nc = c.split(\" \")\r\nfor i in range(n):\r\n print(d[c[i]],end=\" \")\r\n ", "n, m = input().split()\r\nn, m = int(n), int(m)\r\na_list = []\r\nb_list = []\r\nfor i in range(m):\r\n a, b = input().split()\r\n a_list.append(a)\r\n b_list.append(b)\r\n \r\nlect = input().split()\r\nans = []\r\nfor i in lect:\r\n if i in a_list:\r\n pos = a_list.index(i)\r\n j = b_list[pos]\r\n \r\n if len(i) > len(j):\r\n ans.append(j)\r\n else:\r\n ans.append(i)\r\n else:\r\n pos = b_list.index(i)\r\n j = a_list[pos]\r\n \r\n if len(i) > len(j):\r\n ans.append(j)\r\n else:\r\n ans.append(i)\r\n \r\nprint(*ans)", "#codeforces 499B\r\na,b =list(map(int,input().split()))\r\nc=dict(input().split() for i in range(b))\r\nprint(' '.join(min((q,c[q]),key=len) for q in input().split()))", "n,m = map(int,input().split())\r\nd = dict(input().split() for _ in range(m))\r\nprint(' '.join(min((w,d[w]), key=len) for w in input().split()))", "a,b = map(int, input().split())\r\nls = []\r\nanswers = []\r\nfor i in range(b):\r\n m,n = map(str, input().split())\r\n if len(m)>len(n):\r\n ls.append(n),ls.append(m)\r\n else:\r\n ls.append(m),ls.append(n)\r\nmylist = input().split()\r\nfor i in range(a):\r\n if ls.index(mylist[i]) % 2 == 0:\r\n answers.append(ls[ls.index(mylist[i])])\r\n else:\r\n answers.append(ls[ls.index(mylist[i])-1])\r\nfor i in range(a):\r\n print(answers[i])", "m, n = map(int, input().split())\r\n\r\nd = dict()\r\n\r\nfor i in range(n):\r\n c = input().split()\r\n\r\n a = c[0]\r\n b = c[1]\r\n\r\n d[a] = b\r\n\r\n#print(d)\r\n\r\ns = input().split()\r\n\r\nfor i in range(len(s)):\r\n k = s[i]\r\n\r\n x = d[k]\r\n\r\n if len(k) <= len(x):\r\n #print(k, x)\r\n print(k, end = ' ')\r\n else:\r\n print(x, end = ' ')\r\n \r\n", "m,n = map(int,input().split())\r\nls1=[]\r\nls2=[]\r\nfor i in range(n):\r\n s,t = input().split()\r\n ls1.append(s)\r\n ls2.append(t)\r\nls3 = list(input().split())\r\nls4 = []\r\nfor j in range(m):\r\n p = ls1.index(ls3[j])\r\n if len(ls1[p]) <= len(ls2[p]):\r\n ls4.append(ls1[p])\r\n else:\r\n ls4.append(ls2[p])\r\nprint(*ls4,sep=\" \")", "n, m = list(map(int, input().strip().split()))[:2]\r\nslovar = dict()\r\nfor _ in range(m):\r\n tmp = input().strip().split()\r\n slovar[tmp[0]] = tmp[1]\r\nout = list()\r\nlst = input().strip().split()\r\nfor i in lst:\r\n if (len(slovar[i]) < len(i)):\r\n out.append(slovar[i])\r\n else:\r\n out.append(i)\r\nprint(*out)", "a = (input())\nk = a.split(\" \")\np = int(k[0])\nc = int(k[-1])\n\nlist1 = []\n\nfor i in range(0, c+1):\n i = input()\n list1.append(i)\n\n\n\n\n\nlist2 = []\nfor zi in range(0, c+1):\n j = list1[zi].split()\n list2.append(j)\n\n\ndef con(g, h):\n\n if(len(g) > len(h)):\n return (h)\n elif(len(g) == len(h)):\n return(g)\n if(len(g) < len(h)):\n return (g)\n\n\nlist3 = []\nfor i in range(0, c):\n r = con((list2[i])[0], (list2[i])[1])\n list3.append(r)\n\n\nd2={}\n\nfor a in range(0,c):\n d2[(list2[a])[0]]=(list2[a])[1] \n d2[(list2[a])[1]]=(list2[a])[0] \n \n\n\nfor items in list2[-1]:\n if items in list3:\n print(items, end=\" \")\n else:\n for i in range(0,c):\n if items in list2[i]:\n print(d2[items], end=\" \")\n", "a,b=map(int,input().split())\r\nq={}\r\nqq={}\r\nfor i in range(b):\r\n c,d=map(str,input().split())\r\n q[c]=d\r\n qq[d]=c\r\nl=list(map(str,input().split()))\r\nfor i in l:\r\n if i in q:\r\n if len(i)<=len(q[i]):\r\n print(i,end=\" \")\r\n else:print(q[i],end=\" \")\r\n else:\r\n if len(i)<=len(qq[i]):\r\n print(i,end=\" \")\r\n else:print(qq[i],end=\" \")\r\n ", "n, m = map(int, input().split())\r\nli1 = []\r\nli2 = []\r\nfor i in range (m) :\r\n a, b = input().split()\r\n li1.append(a)\r\n li2.append(b)\r\nc = input()\r\nli3 = c.split(\" \")\r\nfor word in li3 :\r\n if (word in li1) :\r\n li = li1\r\n elif word in li2 :\r\n li = li2\r\n ind = li.index(word)\r\n if len(li1[ind]) <= len(li2[ind]) :\r\n print(li1[ind])\r\n elif len(li1[ind]) > len(li2[ind]) :\r\n print(li2[ind])\r\n", "import collections\r\nimport math\r\nimport sys\r\nfrom os import path\r\n\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\nn, m = map(int, sys.stdin.readline().rstrip().split())\r\na = [\"\"] * m\r\nb = [\"\"] * m\r\nl1 = [0] * m\r\nl2 = [0] * m\r\nfor x in range(m):\r\n p, q = map(str, sys.stdin.readline().rstrip().split())\r\n a[x] = p\r\n b[x] = q\r\n l1[x] = len(p)\r\n l2[x] = len(q)\r\nans = \"\"\r\ns = list(map(str, sys.stdin.readline().rstrip().split()))\r\nfor x in s:\r\n p = a.index(x)\r\n if l1[p] <= l2[p]:\r\n ans += x + \" \"\r\n else:\r\n ans += b[p] + \" \"\r\nprint(ans)\r\n", "n,m= map(int,input().split())\r\nt=[]\r\np=[]\r\nfor i in range(m):\r\n arr = list(map(str,input().split()))\r\n if len(arr[0])>len(arr[1]):\r\n t.append(arr[0])\r\n p.append(arr[1])\r\n else:\r\n t.append(arr[1])\r\n p.append(arr[0])\r\nmain = list(map(str,input().split()))\r\nfor i in range(n):\r\n for j in range(len(t)):\r\n if main[i]==t[j] or main[i]==p[j]:\r\n print(p[j],end=\" \")", "a, b = map(int, input().split())\r\nm1 = []\r\nm2 = []\r\nfor i in range(b):\r\n s1, s2 = map(str, input().split())\r\n m1.append(s1)\r\n m2.append(s2)\r\ns = list(map(str, input().split()))\r\nv = ''\r\nfor i in range(a):\r\n if len(m1[m1.index(s[i])]) < len(m2[m1.index(s[i])]):\r\n v += str(m1[m1.index(s[i])])\r\n elif len(m1[m1.index(s[i])]) == len(m2[m1.index(s[i])]):\r\n v += str(m1[m1.index(s[i])])\r\n else:\r\n v += str(m2[m1.index(s[i])])\r\n v+= ' ' \r\nprint(v)", "n,m = map(int, input().split())\r\ninit = []\r\nfor _ in range(m):\r\n a,b = map(str, input().split())\r\n init.extend([[a,b]])\r\n\r\ns = input().split()\r\nfinal = []\r\nfor o in range(len(s)):\r\n target = s[o] \r\n for i in range(len(init)):\r\n if target == init[i][0] and len(init[i][0]) > len(init[i][1]):\r\n final.append(init[i][1])\r\n elif target == init[i][1] and len(init[i][0]) < len(init[i][0]):\r\n final.append(init[i][0])\r\n elif target == init[i][0] and len(init[i][0]) < len(init[i][1]):\r\n final.append(init[i][0])\r\n elif target == init[i][1] and len(init[i][0]) > len(init[i][1]):\r\n final.append(init[i][1])\r\n elif target == init[i][0] and len(init[i][0]) == len(init[i][1]) or target == init[i][1] and len(init[i][0]) == len(init[i][1]):\r\n final.append(init[i][0])\r\n\r\n \r\nans = ' '.join(final)\r\nprint(ans)\r\n\r\n\r\n\r\n", "a, b=map(int,input().split())\nd={}\nfor i in range(b):\n n, m=input().split()\n d[n]=m\nl=list(input().split())\nit=[]\nfor i in range(a):\n if len(l[i])>len(d[l[i]]):\n it.append(d[l[i]])\n elif len(l[i])<=len(d[l[i]]):\n it.append(l[i])\nprint(*it)\n# Tue Dec 20 2022 14:28:08 GMT+0300 (Moscow Standard Time)\n", "import sys\r\nfrom collections import Counter\r\nmod = pow(10, 9) + 7\r\nmod2 = 998244353\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(var): sys.stdout.write(str(var)+\"\\n\")\r\ndef outa(*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\n\r\n\r\nn, m = sp()\r\nd = dict()\r\nfor i in range(m):\r\n a, b = ssp()\r\n d[a] = b\r\nstring = sl()\r\nanswer = []\r\nfor word in string:\r\n if len(word) <= len(d[word]):\r\n answer.append(word)\r\n continue\r\n answer.append(d[word])\r\nout(' '.join(answer))\r\n", "# cook your dish here\r\nn,m=map(int,input().split())\r\nlag1=[]\r\nlag2=[]\r\nwhile(m>0):\r\n x=input().split(\" \")\r\n lag1.append(x[0])\r\n lag2.append(x[1])\r\n m-=1 \r\ntext=input().split(\" \")\r\nans=[]\r\nfor i in range(len(text)):\r\n a=lag1.index(text[i])\r\n x=lag1[a]\r\n y=lag2[a]\r\n short=min(x,y,key=len)\r\n ans.append(short)\r\nstr1=\" \"\r\nprint(str1.join(ans)) \r\n \r\n ", "a,b=map(int,input().split())\r\ntotal=[]\r\nans=''\r\nfor i in range(b):\r\n z,x=input().split()\r\n if len(z)==len(x):\r\n total.append([z,x])\r\n elif len(z)<len(x):\r\n total.append([z,x])\r\n else:\r\n total.append([x,z])\r\nword=input()\r\nfor i in word.split():\r\n for x in total:\r\n if i in x:\r\n ans+=x[0]+' '\r\nprint(ans) ", "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, m = map(int, input().split())\r\nmp = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n mp[a] = b\r\n\r\ns = list(input().split())\r\nans = []\r\n\r\nfor x in s:\r\n if len(x) <= len(mp[x]): ans.append(x)\r\n else: ans.append(mp[x])\r\nprint(' '.join(ans))", "(n, m) = map(int,input().split())\r\nvocabulary = []\r\n\r\nfor _ in range(m):\r\n (one, two) = input().split()\r\n if len(one)<=len(two):\r\n vocabulary.append([one, two])\r\n else:\r\n vocabulary.append([two, one])\r\n#print(vocabulary)\r\n\r\nsentence = list(input().split())\r\n\r\nfor i in sentence:\r\n for j in vocabulary:\r\n if i in j:\r\n print(j[0], end = ' ')", "n,m=map(int,input().split())\r\ns={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n s[a]=b\r\narr=list(map(str,input().split()))\r\nfor i in range(n):\r\n if len(arr[i]) > len(s[arr[i]]):\r\n arr[i]=s[arr[i]]\r\nprint(*arr)", "n, m = map(int, input().split())\r\ndictionary = {}\r\nfor _ in range(m):\r\n str1, str2 = input().split()\r\n dictionary[str1] = str1 if len(str1) <= len(str2) else str2\r\n dictionary[str2] = str1 if len(str1) <= len(str2) else str2\r\nprint(\" \".join(w if w not in dictionary else dictionary[w] for w in input().split()))", "n,m = input().split()\r\nn = int(n);m=int(m)\r\ndic = {}\r\nfor i in range(m):\r\n t1,t2 = input().split()\r\n dic[t1]=t2\r\nans = []\r\nlecture = input().split()\r\nfor word in lecture:\r\n if(len(word)>len(dic[word])):\r\n ans.append(dic[word])\r\n else:\r\n ans.append(word)\r\nprint(*ans)", "import sys\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\nDIC_L1, DIC_L2 = {}, {}\nfor _ in range(M) :\n WORD_L1, WORD_L2 = input().rstrip().split()\n DIC_L1[WORD_L1] = WORD_L2\n DIC_L2[WORD_L2] = WORD_L1\n\nLETURE_WORDS = input().rstrip().split()\nnoteWords = []\nfor letureWord in LETURE_WORDS :\n if letureWord in DIC_L1 :\n TWORD_L2 = DIC_L1[letureWord]\n L1_LEN = len(letureWord)\n L2_LEN = len(TWORD_L2)\n else :\n TWORD_L1 = DIC_L2[letureWord]\n L1_LEN = len(TWORD_L1)\n L2_LEN = len(letureWord)\n \n if L1_LEN <= L2_LEN : noteWords.append(letureWord)\n else : noteWords.append(TWORD_L2)\n\nprint(\" \".join(noteWords))\n", "a,b=map(int,input().split())\r\ndic={}\r\nfor i in range(b):\r\n c,d=input().split()\r\n dic[c]=d\r\ne=input().split()\r\nf=\"\"\r\nfor i in e:\r\n if len(i)>len(dic[i]):\r\n f+=dic[i]+\" \"\r\n else:\r\n f+=i+\" \"\r\nprint(f) ", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n d[a]=b\r\nx=list(map(str,input().split()))\r\nz=\"\"\r\nfor i in x:\r\n if len(i)<=len(d[i]):\r\n z+=i\r\n else:\r\n z+=d[i]\r\n z+=\" \"\r\nprint(z)", "n, m = list(map(int, input().split()))\n\nd = {}\nfor _ in range(m):\n l1, l2 = input().split()\n d[l1] = l2\n\ntext = input().split()\n\nl = []\nfor word in text:\n if len(d[word]) >= len(word): l.append(word)\n else: l.append(d[word])\n\nanswer = \" \".join(l)\nprint(answer) ", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(0,m):\r\n l.append([j for j in input().split()])\r\n\r\ns=[]\r\ns=input().split()\r\ns2=''\r\nfor i in range(0,n):\r\n for j in range(0,m):\r\n if s[i]==l[j][0] or s[i]==l[j][1]:\r\n if len(l[j][0])>len(l[j][1]):\r\n s2+=l[j][1]\r\n elif len(l[j][0])==len(l[j][1]):\r\n s2+=l[j][0]\r\n else:\r\n s2+=l[j][0]\r\n s2+=\" \"\r\nprint(s2)\r\n \r\n", "n,m=map(int,input().split())\r\nl=[]\r\nk=[]\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if(len(b)<len(a)):\r\n l.append(b)\r\n k.append(a)\r\n else:\r\n l.append(a)\r\n k.append(b)\r\ns=list(map(str,input().split()))\r\nfor i in s:\r\n if(i in l):\r\n print(i,end=\" \")\r\n else:\r\n print(l[k.index(i)],end=\" \")", "n, m = map(int, input().split())\r\nwords = []\r\nfor k in range(m):\r\n word1, word2 = input().split()\r\n words.append(word1)\r\n words.append(word2)\r\n\r\nlection = input().split()\r\nans = \"\"\r\n\r\nfor k in lection:\r\n for i in range(0,m*2, 2):\r\n if k == words[i]:\r\n if len(words[i]) <= len(words[i + 1]):\r\n ans = ans + words[i] + \" \"\r\n else:\r\n ans = ans + words[i + 1] + \" \"\r\n\r\nprint(ans.rstrip())\r\n", "n, m = map(int, input().strip().split(' '))\r\nd = {}\r\nfor _ in range(m):\r\n s1, s2 = input().strip().split(' ')\r\n d[s1] = s2\r\nfor s in input().strip().split(' '):\r\n if len(s)>len(d[s]):\r\n print(d[s], end = ' ')\r\n else:\r\n print(s, end = ' ')\r\n\r\n", "def main():\n\tn, m = [int(x) for x in input().split()]\n\tindex1, index2, at_index = {}, {}, {}\n\n\tfor i in range(m):\n\t\tx, y = input().split()\n\t\tindex1[x], index2[y], at_index[i] = i, i, (x, y)\n\n\tl, ans = input().split(), []\n\tfor word in l:\n\t\ti = index1.get(word, -1)\n\t\tif i == -1:\n\t\t\ti = index2.get(word, -1)\n\n\t\tx, y = at_index[i]\n\t\tif len(x) > len(y):\n\t\t\tans.append(y)\n\t\telse:\n\t\t\tans.append(x)\n\n\tprint(' '.join(ans))\n\nif __name__ == '__main__':\n\tmain()", "n,m = map(int,input().split())\n\ndict = {}\nword = \"\"\nfor X in range(m):\n arr = input().split()\n\n if len(arr[0])>len(arr[1]):\n dict.update({arr[0]:arr[1]})\n else:\n dict.update({arr[0]:arr[0]})\n\ninp = input().split()\n\nfor i in inp:\n word+=dict.get(i)+\" \"\n\nprint(word.strip())\n", "n,m=map(int,input().split())\r\nkey1=[]\r\nkey2=[]\r\nans=''\r\nfor i in range(m):\r\n x=input()\r\n \r\n l1=x.split(\" \")\r\n key1.append(l1[0])\r\n key2.append(l1[1])\r\n\r\nz=input()\r\nl3=z.split(\" \")\r\n\r\nfor i in range(len(l3)):\r\n zz=key1.index(l3[i])\r\n if len(key1[zz])<=len(key2[zz]):\r\n ans=ans+(key1[zz])+\" \"\r\n else:\r\n ans=ans+(key2[zz])+\" \"\r\n\r\nprint(ans)\r\n", "'''\r\n@author: SamirPaul1\r\n'''\r\nimport io\r\nimport os\r\nimport sys\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport random\r\nimport string\r\nimport decimal\r\nimport functools \r\nimport fractions\r\nimport itertools\r\nimport collections\r\nfrom sys import stdin, stdout \r\nfrom io import BytesIO, IOBase\r\nfrom math import gcd, floor, sqrt, log, factorial\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, Counter, defaultdict, OrderedDict, namedtuple, UserDict, UserList, UserString\r\n\r\nMOD = 1000000007\r\nsys.setrecursionlimit(100000000)\r\nBUFSIZE = 8192\r\n\r\n\r\n# #---------------- I/O file handling ----------------------\r\n# sys.stdout = open('output.txt', 'w') # Write to output.txt\r\n# sys.stdin = open('input.txt', 'r') # Read from input.txt\r\n\r\n# #-------------------- Code From Here ---------------------\r\n\r\n\r\nn, m = map(int, input().split())\r\nd = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n d[a] = a\r\n d[b] = a \r\n else:\r\n d[a] = b\r\n d[b] = b \r\n\r\narr = [s for s in input().split()]\r\nres = []\r\nfor s in arr:\r\n res.append(d[s])\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\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n ", "def minW(wl1, wl2):\r\n if len(wl1) <= len(wl2):\r\n return wl1\r\n else:\r\n return wl2\r\n\r\n\r\nn, m = map(int, input().split())\r\nDIC = {}\r\nfor _ in range(m):\r\n ws = input().split()\r\n DIC[ws[0]] = minW(ws[0], ws[1])\r\n DIC[ws[1]] = minW(ws[0], ws[1])\r\n\r\nlst = input().split()\r\nfor i in lst:\r\n print(DIC[i], end=\" \")", "n,m=list(map(int,input().split()))\r\n\r\nfirst,second=[],[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n first.append(a)\r\n second.append(b)\r\n \r\nlecture=input().split()\r\n \r\nfirstlen,secondlen=[],[]\r\nfor i in range(m):\r\n firstlen.append(len(first[i]))\r\n secondlen.append(len(second[i]))\r\n \r\nfor word in lecture:\r\n temp=first.index(word)\r\n if firstlen[temp]<=secondlen[temp]:\r\n print(first[temp], end=' ')\r\n else:\r\n print(second[temp], end=' ')", "n,m=map(int,input().split())\r\nd=dict()\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if len(b)<len(a):\r\n d[a]=b\r\n else:\r\n d[a]=a\r\n\r\nl=list(map(str,input().split()))\r\nfor i in l:\r\n print(d[i],end=\" \")\r\n \r\n", "n,m=map(int,input().split())\r\ndic = {}\r\nwhile m:\r\n\tw1,w2=input().split()\r\n\tif len(w1)<=len(w2):\r\n\t\tdic[w1]=w1\r\n\telse:dic[w1]=w2\r\n\tm-=1\r\nfor i in input().split():\r\n\tprint(dic[i],end=' ')", "n, m = map(int, input().split())\r\n\r\nd_w = {}\r\nfor _ in range(m):\r\n\tl_s = list(input().split())\r\n\tif len(l_s[1]) < len(l_s[0]):\r\n\t\td_w[l_s[0]] = l_s[1]\r\n\telse:\r\n\t\td_w[l_s[0]] = l_s[0]\r\n\r\nl_w = list(input().split())\r\n\r\nfor w in l_w:\r\n\tprint(d_w[w], end = \" \")", "n , m = map(int, input().split()) \r\ndata = {} \r\nref = None\r\nfor i in range (m+1) :\r\n inpu = list(map(str , input().split())) \r\n if i == m : \r\n ref= inpu \r\n else : \r\n key , value = inpu \r\n data[key] = value\r\nfor i in ref : \r\n if len(i) <= len(data[i]) :\r\n print(i , end=' ')\r\n else : \r\n print(data[i], end=' ')\r\n \r\n", "n,m=map(int,input().split())\r\nf=[]\r\ns=[]\r\nans=\"\"\r\nfor i in range(m):\r\n a,b=input().split()\r\n f.append(a)\r\n s.append(b)\r\np=input().split()\r\nfor word in p:\r\n i=0\r\n if(word in f):\r\n i=f.index(word)\r\n if(word in s):\r\n i=s.index(word)\r\n if(len(f[i])<len(s[i])):\r\n ans+=f[i]\r\n elif(len(f[i])==len(s[i])):\r\n ans+=f[i]\r\n else:\r\n ans+=s[i]\r\n ans+=\" \"\r\nprint(ans)", "#Bismillahirahmanirrahim\r\n\r\nn,m = map(int, input().split())\r\na = b = []\r\nans = {}\r\nfor i in range(m):\r\n temp1,temp2 = input().split()\r\n a.append(temp1)\r\n b.append(temp2)\r\n if len(temp1) > len(temp2): \r\n ans[temp1] = temp2\r\n else: \r\n ans[temp1] = temp1\r\n \r\n#\r\ntemp = input().split()\r\nfor i in range(n):\r\n print(ans[temp[i]],end=\" \")\r\n\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if len(b)< len(a):\r\n d[a]=b\r\n else:\r\n d[a]=a\r\nfor i in input().split():\r\n print(d[i],end=' ')", "n, m = [int(x) for x in input().split()]\r\nd = dict()\r\nfor i in range(m):\r\n s1, s2 = [x for x in input().split()]\r\n if len(s1) > len(s2):\r\n d[s1] = s2\r\n else:\r\n d[s1] = s1\r\ns = [x for x in input().split()]\r\nfor i in s:\r\n print(d[i], end=' ')", "n,m = map(int,input().split())\r\ndict1 = {}\r\nfor i in range(m):\r\n s,s1 = map(str,input().split())\r\n dict1[s] = s1\r\nlec = list(map(str,input().split()))\r\nfor i in range(len(lec)):\r\n if len(lec[i]) > len(dict1[lec[i]]):\r\n lec[i] = dict1[lec[i]]\r\n else:\r\n continue\r\ntemp = \"\"\r\nfor i in lec:\r\n temp+=\" \"+i\r\nprint(temp.strip())\r\n", "n, m = list(map(int, input().split()))[:2]\r\n\r\nla_words = []\r\n\r\nfor i in range(m):\r\n a = list(map(str, input().split()))[:2]\r\n la_words.append(a)\r\n\r\n# print(la_words)\r\nle_words = list(map(str, input().split()))[:n]\r\n\r\n# print(le_words)\r\n\r\nfor i in range(len(le_words)):\r\n for l in la_words:\r\n if l[0] == le_words[i]:\r\n if len(l[1]) < len(le_words[i]):\r\n # print(\"Changed\")\r\n # print(l[1])\r\n le_words[i] = l[1]\r\n\r\nfor i in le_words:\r\n print(i,end=' ')\r\n", "'''x=int(input())\r\nif x%5==0:\r\n print(x//5)\r\nelse:\r\n print(x//5+1)\r\nx=int(input())\r\nfor i in range(x):\r\n i=int(input())\r\n for n in range (3,361):\r\n if (180*(n-2))/n==i:\r\n print('YES')\r\n break\r\n else:\r\n print('NO')\r\na=int(input())\r\nb=int(input())\r\nif a%2==0:\r\n if b%2==0:\r\n print(((b-a)//2)+a)\r\n else:\r\n print(-((b-a+1)//2))\r\nelse:\r\n if b%2==0:\r\n print(((b-a+1)//2))\r\n else:\r\n print(-(((b-a)//2)+a))\r\na=int(input())\r\nb=int(input())\r\nif a>=b:\r\n for i in range(0,1000000000,a):\r\n if (i+1)%b==b-1:\r\n print(i+1)\r\n break\r\nelse:\r\n for i in range(0,1000000000,b):\r\n if (i-1)%a==1:\r\n print(i-1)\r\n break'''\r\n'''a=input()\r\nx=-1\r\nif a==a[::-1]:\r\n if len(a)%2==0:\r\n print(len(a)//2)\r\n else:\r\n print((len(a)//2)+1)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i]!=a[-i-1]:\r\n f=a[i]\r\n g=a[-i-1]\r\n if f==a[-i-2]:\r\n print(len(a)-i)\r\n break\r\n elif g==a[i+1]:\r\n print(i+1)\r\n break\r\n else:\r\n print(0)\r\n break\r\nn=int(input())\r\nm=int(input())\r\nk=int(input())\r\nx=[]\r\nif (m*n)-1==k:\r\n print('IMPOSSIBLE')\r\nelif k==m*n:\r\n for i in range(n):\r\n x.append('R'*m)\r\nelif n==1:\r\n x.append(('L'*k) + ('R'*(m-k-1))+'L')\r\nelif k==0 and m==1:\r\n for i in range(n-1):\r\n x.append('D')\r\n x.append('U') \r\nelif k==0:\r\n for i in range(n):\r\n x.append('R'*(m-1)+'L')\r\nelif m==1:\r\n for i in range(k):\r\n x.append('L')\r\n for i in range(n-k-1):\r\n x.append('D')\r\n x.append('U')\r\nelif m==2:\r\n for i in range(k//m):\r\n x.append('LL')\r\n if k%m==1:\r\n x.append(('U'*(k%m))+('D'*(m-k%m)))\r\n for i in range(n-(k//m)-1):\r\n x.append('RL')\r\n else:\r\n for i in range(n-(k//m)):\r\n x.append('RL')\r\n \r\nelse:\r\n for i in range(k//m):\r\n x.append('L'*m)\r\n x.append(('L'*(k%m)) + ('R'*(m-(k%m)-1))+'L')\r\n for i in range(n-(k//m)-1):\r\n x.append('R'*(m-1)+'L')\r\nfor i in x:\r\n print(i)'''\r\nd=input().split()\r\nn=int(d[0])\r\nm=int(d[1])\r\ns={}\r\nx=''\r\nfor i in range(m):\r\n i=input().split()\r\n s[i[0]]=i[1]\r\nc=input().split()\r\nfor i in range(n):\r\n if len(s[c[i]])>=len(c[i]):\r\n x+=c[i]+' '\r\n else:\r\n x+=s[c[i]]+' '\r\nprint(x)\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n", "n, m = map(int, input().split())\r\na = {}\r\nfor i in range(m):\r\n temp = input().split()\r\n if len(temp[0]) <= len(temp[1]):\r\n a[temp[0]] = temp[0]\r\n else:\r\n a[temp[0]] = temp[1]\r\nfor i in input().split():\r\n print(a[i], end=\" \")\r\n", "n,m= map(int,input().split())\r\n\r\nlang1=[]\r\nlang2=[]\r\n\r\nword=\"print\"\r\n\r\nfor i in range(m):\r\n w1,w2= input().split()\r\n lang1.append(w1)\r\n lang2.append(w2)\r\n\r\nlecture=input().split()\r\nindex=0\r\n\r\nfor word in lecture:\r\n if word in lang1:\r\n index=lang1.index(word)\r\n if word in lang2:\r\n index=lang1.index(word)\r\n if len(lang1[index]) > len(lang2[index]):\r\n print(lang2[index],end=' ')\r\n else:\r\n print(lang1[index],end=' ')", "n, m = map(int, input().split())\nhaha1 = []\nhaha2 = []\nfinal = []\nfor i in range(m):\n hah, haha = map(str, input().split())\n haha1.append(hah)\n haha2.append(haha)\nstring = input()\nstring = string.split(\" \")\nfor i in string:\n if i in haha1:\n result = haha1.index(i)\n if(len(haha1[result]) > len(haha2[result])):\n final.append(haha2[result])\n else:\n final.append(haha1[result])\n\n else:\n result = haha2.index(i)\n if(len(haha1[result]) > len(haha2[result])):\n final.append(haha2[result])\n else:\n final.append(haha1[result])\n\nfinal_result = \" \".join(final)\nprint(final_result)\n", "a,b = map(int,input().split())\r\ng = {}\r\n\r\nfor i in range(b):\r\n s, n = input().split()\r\n g[s] = n \r\nl = input().split()\r\nfor i in range(a):\r\n if len(l[i]) > len(g[l[i]]):\r\n l[i] = g[l[i]]\r\nprint(*l)", "n,m=input().split()\nn=int(n)\nm=int(m)\n\nzidian={}\nfor i in range(0,m):\n s1,s2=input().split()\n t=\"\"\n if len(s1)<=len(s2):\n t=s1\n else:\n t=s2\n zidian[s1]=t\n zidian[s2]=t\n\nstrlist=input().split()\nfor i in strlist:\n print(zidian[i],end=\" \")\n \t\t\t\t \t \t\t\t\t\t \t \t \t\t \t\t", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n words[a] = b if len(b) < len(a) else a\r\nlecture = input().split()\r\nprint(' '.join(words[word] for word in lecture))", "\r\n\r\nn,m = list(map(int, input().split(' ')))\r\nmap = {}\r\nresult = ''\r\n\r\nfor _ in range(m):\r\n x,y = input().split(' ')\r\n map[x] = y\r\n\r\nwords = input().split(' ')\r\n\r\nfor i in range(len(words)):\r\n if len(words[i]) > len(map[words[i]]):\r\n words[i] = map[words[i]]\r\n\r\nprint(' '.join(words))", "m, n = map(int, input().split())\nfirst = dict()\nsecond = dict()\nfor i in range(n):\n f, g = map(str, input().split())\n\n first[f] = g\n second[g] = f\nt = input()\nmain = \"\"\nfor i in t.split(' '):\n main += first[i] + ' ' if len(first[i])<len(second[first[i]]) else second[first[i]] + ' '\nprint(main)", "# 4 3\n# codeforces codesecrof -> codeforces\n# contest round -> round\n# letter message -> letter\n# codeforces contest letter contest\n\nn, m = map(int,input().split())\ntranslation = {}\nans = \"\"\nfor _ in range(m):\n first, second = input().split()\n if len(first)<=len(second) :\n translation[first] = first\n translation[second] = first\n else:\n translation[second] = second\n translation[first] = second\nlecture = input().split(\" \")\nfor j in lecture:\n ans += translation[j] + \" \"\nprint(ans)\n", "n,m = list(map(int, input().split()))\r\nd={}\r\nfor _ in range(m):\r\n a,b = input().split()\r\n d[a]=b\r\nc = input().split()\r\nout = \"\"\r\nfor word in c:\r\n if len(word)<=len(d[word]):\r\n out+=word+\" \"\r\n else:\r\n out+=d[word]+\" \"\r\nprint(out)", "a,b =map(int,input().split()) \r\nc= []\r\nfor i in range(b):\r\n c.append(input().split())\r\ne= [i[0] for i in c]\r\ndef small_word(i):\r\n if len(i[0]) <= len(i[1]):\r\n return i[0]\r\n else:\r\n return i[1]\r\nd = input().split()\r\nfor i in range(len(d)):\r\n f= e.index(d[i])\r\n d[i] = small_word(c[f]) \r\nprint( ' '.join(d)) \r\n ", "n, m = map(int,input().split())\nlang = {}\nfor i in range(m):\n\ta, b = input().split()\n\tif(len(b)>=len(a)):\n\t\tlang[a] = a\n\telse:\n\t\tlang[a] = b\n#print(lang)\nd = input().split()\nfor i in d:\n\tprint(lang[i],end=\" \")\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 = dict(input().split() for i in range(m))\r\nr = [min((w, d[w]), key=len) for w in input().split()]\r\nprint(' '.join([str(elem) for elem in r]))", "n, m = map(int, input().split())\r\n \r\ndic = {}\r\n \r\nfor i in range(m):\r\n a, b = input().split()\r\n dic[a] = a\r\n if len(a) > len(b):\r\n dic[a] = b\r\n \r\ntext = input().split()\r\n \r\nfor word in text:\r\n print(dic[word], end = ' ')", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n d[a]=b\r\na=list(map(str,input().split()))\r\nl=[]\r\nfor i in a:\r\n if len(i)<=len(d[i]):\r\n l.append(i)\r\n else:\r\n l.append(d[i])\r\nprint(*l)\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nmydict = {}\r\n\r\nfor _ in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n mydict[a] = a\r\n else:\r\n mydict[a] = b\r\n\r\nempty_str = []\r\n\r\narr = input().split()\r\n\r\nfor s in arr:\r\n empty_str.append(mydict[s])\r\n\r\nprint(' '.join(empty_str))\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nd = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n d[a] = a\r\n else:\r\n d[a] = b\r\n\r\nlecture = input().split()\r\nfor word in lecture:\r\n print(d[word], end=' ')", "n, m = list(map(int, input().split(\" \")))\r\nwords = {}\r\n\r\nwhile m:\r\n a, b = input().split(\" \")\r\n words[a] = b\r\n m -= 1\r\n\r\nlecture = input().split(\" \")\r\ntranslate = []\r\n\r\nfor word in lecture:\r\n if len(word) <= len(words[word]):\r\n translate.append(word)\r\n else:\r\n translate.append(words[word])\r\n\r\nprint(*translate)", "n,m=map(int,input().split())\r\nmp={}\r\nfor i in range(m):\r\n s1,s2=input().split()\r\n mp[s1]=s2\r\n\r\nl=input().split()\r\nfor i in range(n) :\r\n if len(mp[l[i]])<len(l[i]):\r\n print(mp[l[i]],end=' ')\r\n else:\r\n print(l[i],end=' ')\r\n i+=1\r\n\r\n", "import sys\nlang = {}\n\ndef make_lang(words):\n words = words.split()\n if len(words[0]) > len(words[1]):\n lang[words[0]] = words[1]\n else:\n lang[words[0]] = words[0]\n\nwords_to_encode, all_words = map(int, sys.stdin.readline().strip().split())\nfor i in range(all_words):\n make_lang(sys.stdin.readline().strip())\n \nto_encode = sys.stdin.readline().split()\n\nafter_conversion = \"\"\n\nfor i in to_encode:\n after_conversion += lang[i] + \" \"\n\nsys.stdout.write(after_conversion.strip())\n\n \t\t \t \t\t \t\t\t \t\t\t\t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 12 03:50:54 2021\r\n\r\n@author: pena\r\n\"\"\"\r\n\r\n[n,m] = map(int,input().split())\r\nwords = {}\r\nfor i in range(m):\r\n [s1,s2] = input().split()\r\n if len(s2) < len(s1):\r\n words[s1] = s2\r\n else:\r\n words[s1] = s1\r\ns = input().split()\r\nans = []\r\nfor word in s:\r\n ans.append(words[word])\r\nprint(*ans)", "from collections import defaultdict\nn, m = map(int, input().split())\nmap1 = defaultdict(int)\nfor i in range(m):\n word1, word2 = map(str, input().split())\n if len(word1) <= len(word2):\n map1[word1] = word1\n else:\n map1[word1] = word2\nlecture = list(map(str, input().split()))\nnotes = \"\"\nfor i in lecture:\n notes += map1[i]\n notes += \" \"\nprint(notes)\n", "\n\ndef get_input():\n n = int(input().split()[1])\n translation = {}\n for i in range(n):\n words = input().split()\n correct_word = words[0] if len(words[0]) <= len(words[1]) else words[1]\n for word in words: \n translation[word] = correct_word\n lecture = input().split()\n\n return translation, lecture\n\ndef solve(translation,lecture):\n correct_words = []\n for word in lecture:\n correct_words.append(translation[word])\n \n print(\" \".join(correct_words))\n \n \n\n\n\n\n\nt,l = get_input()\nsolve(t,l)\n", "n , m = map(int,input().split()) \nd = dict(input().split() for _ in range(m)) \t\nfor w in input().split():\n\tprint((min(w,d[w],key = len)) , end=\" \")\n", "n,m= map(int, input().split())\r\narr=[\"\" for i in range(2*m)]\r\nfor i in range(m):\r\n a,b= map(str, input().split())\r\n if len(a)>len(b):\r\n arr[i]=b\r\n arr[i+m]=a\r\n else:\r\n arr[i] = a\r\n arr[i + m] = b\r\nkrr= input().split()\r\nfor e in krr:\r\n indimint= arr.index(e)\r\n print(arr[indimint%m], end=\" \")\r\n\r\n", "n,m = map(int, input().split())\r\nd = {}\r\nfor i in range(m):\r\n\ta,b = input().split()\r\n\td[a] = b\r\nl = list(input().split())\r\nfor i in l:\r\n\tif len(i)<= len(d[i]):\r\n\t\tprint(i, end=' ')\r\n\telse:\r\n\t\tprint(d[i], end = ' ')", "a,b=map(int,input().split())\r\ns1=[[i for i in input().split()] for j in range(b)]\r\ns=dict(s1)\r\nd=input().split()\r\ns2=[]\r\nfor i in d:\r\n s2.append(min((i,s[i]),key=len))\r\nprint(*s2)", "x, y = map(int , input().split())\r\nd = {}\r\nfor _ in range (y):\r\n a, b = input().split()\r\n d[a] = b\r\nans = ''\r\nl = list(input().split())\r\nfor i in l:\r\n k = d[i]\r\n if len(i)<=len(k):\r\n ans += i+' '\r\n else:\r\n ans += k+' '\r\nprint(ans[:len(ans)-1])", "def lecture():\r\n\tlang = {}\r\n\tn, m = list(map(int,input().split()))\r\n\tfor i in range(m):\r\n\t\ta,b = input().split()\r\n\t\tlang[a] = b\r\n\r\n\ttext = input().split()\r\n\tans = []\r\n\tfor a in text:\r\n\t\tb = lang[a]\r\n\t\tif len(a) > len(b):\r\n\t\t\tans.append(b)\r\n\t\telse:\r\n\t\t\tans.append(a)\r\n\tans = \" \".join(ans)\r\n\tprint(ans)\r\n\r\nlecture()\r\n\r\n\r\n", "n, m = map(int, input().split())\r\n\r\ntranslations = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n translations[a] = b\r\n\r\nlecture_text = input().split()\r\nrecorded_lecture = []\r\n\r\nfor word in lecture_text:\r\n translation = translations[word]\r\n recorded_word = word if len(word) <= len(translation) else translation\r\n recorded_lecture.append(recorded_word)\r\n\r\nprint(' '.join(recorded_lecture))\r\n", "def run():\r\n\timport sys\r\n\tsys.stdin = open('/home/punit/Documents/Cpp Programs/input.txt', 'r')\r\n\tsys.stdout = open('/home/punit/Documents/Cpp Programs/output.txt', 'w') \r\n\tfrom math import ceil,sqrt,floor\r\n \r\n# run()\r\nn,m = map(int,input().split())\r\nd = dict()\r\nfor _ in range(m):\r\n\ta,b = map(str,input().split())\r\n\tif len(a)>len(b):\r\n\t\td[a] = b\r\n\t\td[b]=b\r\n\telif len(a)<len(b):\r\n\t\td[a]=a\r\n\t\td[b]=a\r\n\telse:\r\n\t\td[a]=a\r\n\t\td[b]=b\r\n\r\ns = map(str,input().split())\r\nfor i in s:\r\n\tprint(d[i],end=\" \")", "n, m = [int(i) for i in input().split()]\r\nwords = []\r\nworddict = {}\r\nshorterwords = []\r\nfor i in range(m):\r\n firstword, secondword = input().split()\r\n words.append([firstword, secondword])\r\n if len(firstword) <= len(secondword):\r\n worddict[firstword] = firstword\r\n worddict[secondword] = firstword\r\n else:\r\n worddict[firstword] = secondword\r\n worddict[secondword] = secondword\r\nfinalsentence = input().split()\r\nfor words in finalsentence:\r\n print(worddict[words], end = \" \")", "# cd C:\\Users\\user\\Documents\\python done projects\r\n# python cfXXX.py\r\nwords = dict()\r\nn, m = [int(x) for x in input().split()]\r\nfor i in range(0, m):\r\n\ts, s1 = input().split()\r\n\twords[s] = s1\r\ns = input().split()\r\ns1 = ''\r\nfor x in s:\r\n\tif len(words[x]) < len(x):\r\n\t\ts1 += words[x] + ' '\r\n\telse:\r\n\t\ts1 += x + ' '\r\nprint(s1[:len(s1) - 1])", "d = {}\r\nm, n = map(int, input().split())\r\nfor _ in range(n):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n d[a] = a \r\n d[b] = a \r\n else:\r\n d[a] = b \r\n d[b] = b \r\nws = input().split()\r\nfor w in ws:\r\n print(d[w], end = \" \")", "d = [int(x) for x in input().split(' ')]\r\nc = {}\r\nfor x in range(d[1]):\r\n data = [x for x in input().split(' ')]\r\n if(len(data[0])<=len(data[1])):\r\n c[data[0]]=data[0]\r\n else:\r\n c[data[0]]=data[1]\r\ns = [x for x in input().split(' ')]\r\nfor x in range(d[0]):\r\n s[x]=c[s[x]]\r\nprint((' ').join(s))", "m,n=map(int,input().split())\r\nd={}\r\nfor t in range(n):\r\n a,b=map(str,input().split())\r\n if len(b)<len(a):\r\n d[a]=b\r\n else:\r\n d[a]=a\r\nx=list(map(str,input().split()))\r\nfor i in x:\r\n print(d[i],end=\" \")", "n, m = list(map(int,input().split()))\r\nD = {}\r\nfor i in range(m):\r\n a, b =list(map(str,input().split()))\r\n D[a] = b if len(a)>len(b) else a\r\nfor name in list(map(str,input().split())):\r\n print(D[name],end=' ')", "n, m = map(int, input().split())\r\nd = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n d[a] = b \r\ns = list(input().split())\r\nres = ''\r\nfor i in s:\r\n if len(i) <= len(d[i]):\r\n res = res + \" \" + i\r\n else:\r\n res = res + \" \" + d[i]\r\n\r\nprint(res.lstrip(\" \"))\r\n\r\n", "n , m = map(int,input().split())\r\n\r\nx={}\r\nfor i in range(m) :\r\n\ta,b = input().split()\r\n\tif len(a)<=len(b) :\r\n\t\tx[a]=a\r\n\telse:\r\n\t\tx[a]=b\r\nfor i in input().split() :\r\n\tprint(x[i],end=\" \")", "s = {}\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(m):\r\n word1, word2 = input().split() \r\n\r\n if len(word1) <= len(word2):\r\n s[word1] = word1\r\n elif len(word1) > len(word2):\r\n s[word1] = word2\r\n\r\nlecture = input()\r\nanswer = \"\"\r\nfor word in lecture.split():\r\n answer += f\"{s[word]} \"\r\nprint(answer)\r\n", "n,m = map(int,input().split(\" \"))\r\nd = dict()\r\nfor _ in range(m):\r\n a,b = input().split(\" \")\r\n if len(a)<=len(b):\r\n d[a] = a\r\n else:\r\n d[a] = b\r\na,b = input().split(\" \"),\"\"\r\nfor _ in a:\r\n b+=d[_]+\" \"\r\nprint(b)", "n, m = map(int, input().split())\r\na = []\r\n\r\nfor i in range(m):\r\n words = sorted(input().split(), key=lambda x: len(x))\r\n a.append(words)\r\n\r\nsentence = list(input().split())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if sentence[i] in a[j]:\r\n sentence[i] = a[j][0]\r\n\r\nprint(\" \".join(sentence))\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if len(a)>len(b):\r\n d[a]=b\r\n else:\r\n d[a]=a\r\ns=input().split()\r\nsnew=\"\"\r\nfor i in s:\r\n snew+=d[i]\r\n snew+=\" \"\r\nprint(snew)\r\n ", "n,m=map(int,input().split())\r\ndc={}\r\nfor i in range(m):\r\n s1,s2=map(str,input().split())\r\n if len(s1)>len(s2):\r\n dc[s1]=s2\r\n else:\r\n dc[s1]=s1\r\ns=input().split()\r\nfor i in s:\r\n print(dc[i],end=\" \")", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n key, value = input().split()\r\n words[key] = value\r\n\r\nlecture = input().split()\r\nfor index, word in enumerate(lecture):\r\n if len(word) > len(words[word]):\r\n lecture[index] = words[word]\r\nprint(*lecture)", "def solve():\r\n n, m = list(map(int, input().strip().split()))\r\n d = {}\r\n\r\n for i in range(m):\r\n n1, n2 = input().split()\r\n d[n1] = n2\r\n\r\n a = input().split()\r\n for i in range(n):\r\n if len(a[i]) <= len(d[a[i]]):\r\n print(a[i], end=' ')\r\n else:\r\n print(d[a[i]], end=' ')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n, m = map(int, input().split())\r\nd = dict()\r\nfor _ in range(m):\r\n a, b = input().split()\r\n choose = a if len(a) <= len(b) else b\r\n d[a] = d[b] = choose\r\nl = list(input().split())\r\nans = [d[l[i]] for i in range(n)]\r\nprint(*ans)", "n, m = map(int, input().split())\r\na = list(); b = list(); ans = list()\r\nfor i in range(m):\r\n t1, t2 = input().split()\r\n a.append(t1); b.append(t2)\r\nfor word in input().split():\r\n index = [i for i, string in enumerate(a) if string == word]\r\n ans.append(a[index[-1]] if len(a[index[-1]]) <= len(b[index[-1]]) else b[index[-1]])\r\nprint(*ans)", "n, m = [int(x) for x in input().split()]\r\nDic = {}\r\nfor i in range(m):\r\n lan1, lan2 = [x for x in input().split()]\r\n if (len(lan1) <= len(lan2)):\r\n Dic[lan1] = lan1\r\n Dic[lan2] = lan1\r\n else:\r\n Dic[lan1] = lan2\r\n Dic[lan2] = lan2\r\nstr = input().split()\r\nfor i in range(n):\r\n print(Dic[str[i]], end=' ')\r\n", "n,m = map(int,input().split())\r\nd = {}\r\nresult =[] \r\nfor i in range(m):\r\n a,b = input().split()\r\n d[f\"{a}\"] = f\"{b}\"\r\nfor w in input().split():\r\n if len(w)<= len(d[f\"{w}\"]):\r\n result.append(w)\r\n else:\r\n result.append(d[f\"{w}\"])\r\nprint(*result)\r\n", "n, m = map(int, input().split())\r\n\r\nwords = {}\r\nfor _ in range(m):\r\n word1, word2 = input().split()\r\n words[word1] = word2\r\n\r\nlecture = input().split()\r\n\r\nfor i in range(n):\r\n word1, word2 = lecture[i], words[lecture[i]]\r\n if len(word1) <= len(word2):\r\n print(word1, end=\" \")\r\n else:\r\n print(word2, end=\" \")\r\nprint()\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if(len(a)<=len(b)):\r\n d[a]=a\r\n else:\r\n d[a]=b\r\nl=list(map(str,input().split()))\r\ns=\"\"\r\nfor i in range(len(l)):\r\n s=s+d[l[i]]+\" \"\r\nprint(s)\r\n \r\n \r\n\r\n\r\n\r\n \r\n \r\n", "n,m = map(int, input().split())\nd={}\nfor _ in range(m):\n\ta,b = input().split()\n\tx=len(a)\n\ty=len(b)\n\td[a]=a\n\tif y<x:\n\t\td[a]=b\ntext = list(map(str, input().split()))\nfor i in text:\n\tprint(d[i],end=' ')\n", "x=list(map(int,input().split()))\r\nn=x[0]\r\nm=x[1]\r\nMy_dict={}\r\ndef data(lst):\r\n if(len(lst[0])<=len(lst[1])):\r\n My_dict.update({lst[0]:lst[0]})\r\n else:\r\n My_dict.update({lst[0]:lst[1]})\r\n\r\nfor i in range(m):\r\n input_data=input().split()\r\n data(input_data)\r\n\r\ntext=input().split()\r\nfinal_text=[]\r\nfor i in range(n):\r\n final_text.append(My_dict.get(text[i]))\r\n\r\nprint(' '.join(map(str,final_text)))", "n,m=[int(i) for i in input().split()]\r\nwords={}\r\nfor i in range(m):\r\n\ta,b=[j for j in input().split()]\r\n\twords[a]=b\r\nmessage=input().split()\r\nfor i in range(len(message)):\r\n\tif len(message[i])>len(words[message[i]]):\r\n\t\tmessage[i]=words[message[i]]\r\nprint(*message)", "\r\n\r\n\r\n\r\ndef lecture():\r\n\r\n n,m = map(int,input().split())\r\n\r\n \r\n word_to_second = {}\r\n\r\n for _ in range(m):\r\n\r\n first,second = input().split()\r\n\r\n word_to_second[first] = min(first,second,key=len)\r\n\r\n \r\n words = input().split()\r\n\r\n\r\n words_written_down = []\r\n\r\n\r\n for word in words:\r\n words_written_down.append(word_to_second[word])\r\n\r\n\r\n print(' '.join(words_written_down))\r\n\r\n\r\n\r\nlecture()\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nd=dict(input().split() for _ in range(m))\r\nprint(' '.join(min((w,d[w]), key=len)for w in input().split()))", "n, m = [int(i)for i in input().split()]\r\nwords = {}\r\n\r\n\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n words[a] = a\r\n words[b] = a\r\n else:\r\n words[a] = b\r\n words[b] = b\r\nfor word in input().split():\r\n print(words[word], end=\" \")", "N, M = map(int, input().split())\r\nmap = {}\r\nfor i in range(M):\r\n w1, w2 = input().split()\r\n map[w1] = w2\r\nres = []\r\nfor w in input().split():\r\n if len(w) <= len(map[w]):\r\n res.append(w)\r\n else:\r\n res.append(map[w])\r\n\r\nprint(' '.join(res))", "'''import sys\r\nsys.stdin=open(\"input.txt\",\"r\")\r\nsys.stdout=open(\"output.txt\",\"w\")'''\r\n\r\nn,m=map(int,input().split())\r\nwords=dict()\r\nfor _ in range(m):\r\n s1,s2=map(str,input().split())\r\n words[s1]=s2;\r\n\r\nres=\"\"\r\nsent=input().split()\r\nfor word in sent:\r\n if len(word)>len(words[word]):\r\n res+=words[word]\r\n else:\r\n res+=word\r\n res+=' '\r\nprint(res)", "class word():\r\n def __init__(self, a,b):\r\n self.a = a\r\n self.b = b\r\n \r\nn,m = map(int, input().split())\r\nlistA = []\r\n\r\nfor i in range(0, m):\r\n a, b = map(str, input().split(\" \"))\r\n if len(a) > len(b):\r\n T = word(a, b)\r\n listA.append(T)\r\ntext = input()\r\nfor i in text.split(\" \"):\r\n flag = 0\r\n for j in listA:\r\n if i == j.a:\r\n flag = 1 \r\n print(j.b, end=\" \")\r\n break\r\n if flag == 0:\r\n print(i, end=\" \")", "\r\nn, m = map(int, input().split(' '))\r\n\r\nd = {}\r\nfor i in range(m):\r\n first, second = input().strip().split(' ')\r\n d[first] = second\r\n\r\nlecture = input().split(' ')\r\n\r\nassert(len(lecture) == n)\r\n\r\nnewLecture = []\r\nfor word in lecture:\r\n if len(d[word]) < len(word):\r\n newLecture.append(d[word])\r\n else:\r\n newLecture.append(word)\r\n\r\nprint(\" \".join(newLecture))\r\n", "\r\nn,k = map(int,input().split())\r\nd = {}\r\nfor i in range(k):\r\n a,b = input().split()\r\n if(len(a)>len(b)):\r\n d[a]=b \r\n\r\nl = list(input().split()) \r\nx = []\r\nfor i in range(n):\r\n if(l[i] in d):\r\n x.append(d[l[i]])\r\n else:\r\n x.append(l[i])\r\n\r\nprint(*x) ", "def call():\r\n n,m=map(int,input().split())\r\n k={}\r\n for _ in range(m):\r\n a,b=map(str,input().split())\r\n x = (b,a)[len(a)<=len(b)]\r\n k[a]=x\r\n k[b]=x\r\n tc=[x for x in input().split()]\r\n s=\"\"\r\n for i in tc:\r\n s+=k[i]\r\n s+=\" \"\r\n print(s)\r\n \r\n\r\ncall()", "def solve(wrds, lec):\r\n\r\n nts = []\r\n for i in range(t1):\r\n if len(lec[i]) <= len(wrds[lec[i]]):\r\n nts.append(lec[i])\r\n else:\r\n nts.append(wrds[lec[i]])\r\n\r\n return \" \".join(nts)\r\n\r\n\r\nt1, t2 = map(int, input().split())\r\nwrds = {}\r\nfor i in range(t2):\r\n a, b = input().split()\r\n wrds[a] = b\r\nlec = list(map(str, input().split()))\r\nprint(solve(wrds, lec))", "n, m = map(int, input().split())\r\n\r\nword_map = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n\r\n word_map[max(a, b, key=lambda x: len(x))] = min(a, b, key=lambda x: len(x))\r\n\r\nprint(' '.join([word_map.get(i, i) for i in input().split()]))\r\n", "n,m = map(int,input().split())\r\nt=[]\r\nfor i in range(m):\r\n s,s1 = map(str,input().split())\r\n t.append(s)\r\n t.append(s1)\r\nx = list(map(lambda q:str(q), input().split(\" \")))\r\n\r\nfor i in range(n):\r\n for j in range(2*m-1):\r\n if x[i]==t[j] and len(t[j])>len(t[j+1]):\r\n x[i]=t[j+1]\r\n break\r\nprint(' '.join(map(str,x)))\r\n", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nl=[]\r\nwhile m>0:\r\n l.append(input().split())\r\n m-=1 \r\nz=''\r\nx=input().split()\r\nfor i in x:\r\n for j in l:\r\n if j[0]==i or j[1]==i:\r\n if len(j[0])<=len(j[1]):\r\n z=z+j[0]+' '\r\n else:\r\n z=z+j[1]+' '\r\nprint(z)", "n, m = list(map(int, input().split()))\r\na, b = [], []\r\nfor i in range(m):\r\n x, y = input().split()\r\n a.append(x)\r\n b.append(y)\r\nlecture = input().split()\r\nonetotwo = {}\r\ntwotoone = {}\r\nfor i in range(m):\r\n onetotwo[a[i]] = b[i]\r\n twotoone[b[i]] = a[i]\r\n \r\nans = []\r\nfor word in lecture:\r\n if word in onetotwo:\r\n k, v = word, onetotwo[word]\r\n if len(k) <= len(v):\r\n ans.append(k)\r\n else:\r\n ans.append(v)\r\n else:\r\n k, v = word, twotoone[word]\r\n if len(k) < len(v):\r\n ans.append(k)\r\n else:\r\n ans.append(v)\r\nprint(' '.join(ans))", "def solve(n,m,mapping,words):\n dt1={w1:w2 for w1,w2 in mapping}\n res=[]\n for w in words:\n op=w \n if w in dt1 and len(dt1[w])<len(w):\n op=dt1[w]\n res.append(op)\n return ' '.join(res)\nfor t in range(1):\n n,m=map(int,input().split())\n mapping=[input().split() for i in range(m)]\n words=input().split()\n print(solve(n,m,mapping,words))\n\t \t \t \t\t\t\t\t \t\t\t \t\t \t \t", "n,m = [int(x) for x in input().split()]\r\ndic = {}\r\nfor i in range(m):\r\n x,y = input().split()\r\n if len(x)>len(y):\r\n dic[x] = y\r\n else:\r\n dic[y] = x\r\nli = input().split()\r\nfor i in li:\r\n if i in dic:\r\n print(dic[i],end = \" \")\r\n else:\r\n print(i,end = \" \")", "n,m=map(int,input().split())\r\na={}\r\n\r\nfor i in range(m):\r\n p,q=input().split()\r\n a[p]=q\r\np=list(input().split())\r\ns=\"\"\r\nfor i in p:\r\n if len(i)>len(a[i]):\r\n s+=a[i]\r\n s+=\" \"\r\n else:\r\n s+=i \r\n s+=\" \"\r\nprint(s[:len(s)-1])\r\n", "a,b=map(int,input().split())\r\nc=[]\r\nd=[]\r\nans=''\r\nfor i in range(0,b):\r\n\to,p=map(str,input().split())\r\n\tc.append(o)\r\n\td.append(p)\r\nq=list(map(str,input().split()))\r\nfor j in q:\r\n\te=c.index(j)\r\n\tf=d[e]\r\n\tif len(j)>len(f):\r\n\t\tans+=str(f)+' '\r\n\telse:\r\n\t\tans+=str(j)+' '\r\nprint(ans)", "n, m = map(int, input().rstrip().split())\r\ndic = {}\r\nfor i in range(0, m):\r\n s, q = input().rstrip().split()\r\n dic[s] = q\r\n dic[q] = s\r\n# print(dic)\r\narrWrite = input().strip().split()\r\n# print(arrWrite)\r\nmyres = []\r\nfor item in arrWrite:\r\n if len(dic[item]) < len(item):\r\n myres.append(dic[item])\r\n else:\r\n myres.append(item)\r\n\r\nres = \"\"\r\nfor _ in myres:\r\n res += _\r\n res += \" \"\r\n\r\nprint(res)", "n, m = map(int, input().strip().split(' '))\nl1, l2 = [], []\nnotes = ''\nfor _ in range(m):\n\tw1, w2 = map(str, input().strip().split(' '))\n\tl1.append(w1)\n\tl2.append(w2)\nlecture = list(map(str, input().strip().split(' ')))\nfor i in lecture:\n\tif i in l1:\n\t\tindex = l1.index(i)\n\t\tif len(l1[index]) <= len(l2[index]):\n\t\t\tnotes += l1[index] + ' '\n\t\telse:\n\t\t\tnotes += l2[index] + ' '\nprint(notes)\n \t \t\t \t\t\t\t \t \t\t \t \t \t \t\t\t", "n,k=map(int,input().split())\r\nd={}\r\nv=[]\r\nfor i in range(k):\r\n x,y=map(str,input().split())\r\n if x not in d:\r\n d[x]=y\r\ns=list(map(str,input().split()))\r\nfor i in s:\r\n if i in d:\r\n if len(i)<=len(d[i]):\r\n v.append(i)\r\n else:\r\n v.append(d[i])\r\nprint(' '.join(v))\r\n ", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(0,m):\r\n s1,s2=map(str,input().split())\r\n dic[s1]=s2\r\nlec=[str(x) for x in input().split()]\r\nans=[]\r\nfor i in range(0,n):\r\n a=len(lec[i])\r\n b=len(dic[lec[i]])\r\n if(b<a):\r\n ans.append(dic[lec[i]])\r\n else:\r\n ans.append(lec[i])\r\nfor i in range(0,n):\r\n print(ans[i],end=\" \")\r\n", "t=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in range(t[1]):\r\n y=input().split()\r\n l1.append(y[0])\r\n l2.append(y[1])\r\n \r\nl=input().split()\r\nt=''\r\nfor i in l:\r\n m=l2[l1.index(i)]\r\n if len(m)<len(i):\r\n t+=m+\" \"\r\n else:\r\n t+=i+\" \"\r\nprint(t)", "a = [int(i) for i in str(input()).split()]\r\n \r\narr = []\r\ndic = {}\r\n \r\nfor i in range(a[1]+1):\r\n b = str(input()).split()\r\n arr.append(b)\r\n \r\nfor i in range(a[1]):\r\n dic[\"{}\".format(arr[i][0])] = \"{}\".format(arr[i][1])\r\n \r\nfinal = []\r\n \r\n#print(arr)\r\n#print(dic)\r\n \r\nfor j in arr[-1]:\r\n if len(dic[j]) == len(j):\r\n final.append(j)\r\n \r\n elif len(dic[j]) < len(j):\r\n final.append(dic[j])\r\n \r\n elif len(dic[j]) > len(j):\r\n final.append(j)\r\n \r\nfor i in final:\r\n print(i , end = \" \")", "omg = input()\nomg = omg.split(\" \")\nn = int(omg[0])\nm = int(omg[1])\npeor = []\nmejor = []\nfor i in range (0,m):\n todas = input()\n todas = todas.split(\" \")\n if (len(todas[0]) <= len(todas[1])):\n mejor.append(todas[0])\n peor.append(todas[1])\n else:\n mejor.append(todas[1])\n peor.append(todas[0])\ntexto = input()\ntexto = texto.split(\" \")\nnewt=\"\"\nsw = True\nfor lol in texto:\n if lol in peor:\n lol = mejor[peor.index(lol)]\n if sw ==True:\n newt=lol\n sw =False\n else:\n newt=newt+\" \"+lol\nprint(newt)\n \t \t\t\t \t \t\t\t\t\t\t\t\t\t\t\t\t \t \t", "n, m = [int(i) for i in input().split()] \r\nd = {} \r\nfor i in range(m): \r\n l1, l2 = [i for i in input().split()] \r\n d[l1] = l2 \r\nl = [i for i in input().split()] \r\nfor i in range(n):\r\n if len(l[i]) <= len(d[l[i]]) : print(l[i], end = ' ') \r\n else : print(d[l[i]], end = ' ') ", "n, m = map(int, input().split())\r\nl, l1, l2 = [], [], []\r\nfor _ in range(m):\r\n s1, s2 = input().split()\r\n l1.append(s1)\r\n l2.append(s2)\r\nl = input().split()\r\nfor i in l:\r\n if i in l1:\r\n if len(l1[l1.index(i)]) <= len(l2[l1.index(i)]):\r\n print(l1[l1.index(i)], end=\" \")\r\n else: print(l2[l1.index(i)], end=\" \")\r\n else:\r\n if len(l1[l2.index(i)]) <= len(l2[l2.index(i)]):\r\n print(l1[l2.index(i)], end=\" \")\r\n else: print(l2[l2.index(i)], end=\" \") \r\n ", "n, m = list(map(int, input().split()))\r\ndic = {}\r\nfor _ in range(m):\r\n l1, l2 = list(input().split())\r\n dic[l1] = l2\r\ns = list(input().split())\r\nres = []\r\nfor word in s:\r\n s1 = word\r\n s2 = dic[word]\r\n if len(s2) < len(s1):\r\n res.append(s2)\r\n else:\r\n res.append(s1)\r\nprint(\" \".join(res))", "# for in range(int(input())):\r\nn,m=map(int,input().split())\r\nX=[]\r\nfor i in range(m):\r\n q=[]\r\n q=list(input().split())\r\n \r\n X.append(q[0])\r\n X.append(q[1])\r\n# print(X)\r\nli=list(input().split())\r\ns=\"\"\r\nfor i in range(n):\r\n t=X.index(li[i])\r\n # print(X[t])\r\n if(len(X[t])<=len(X[t+1])):\r\n s+=X[t]+\" \"\r\n else:\r\n s+=X[t+1]+\" \"\r\nprint(s[:len(s)-1])\r\n \r\n \r\n \r\n \r\n ", "d={}\r\nn,m=map(int,input().split())\r\nw=[]\r\n\r\nfor i in range(m):\r\n\ta,b=input().split()\r\n\td[a]=b\r\n\t\r\n\t\r\nc=list(input().split())\r\nfor i in range(len(c)):\r\n\tm=d[c[i]]\r\n\tif len(c[i])<=len(m):\r\n\t\tprint(c[i],end=' ')\r\n\telse:\r\n\t\tprint(m,end=' ')\r\n\t\t\r\n", "#step1: get the input\nn, m = map(int,input().split())\n\n#step2 :get all the letters in language 1 and 2\nlanguage1 = []\nlanguage2 = []\nfor _ in range(m):\n flag = input().split()\n language1.append(flag[0])\n language2.append(flag[1])\nsentence = input().split()\nfor flag,string in enumerate(sentence):\n if string in language1:\n location=language1.index(string)\n if len(language1[location])> len(language2[location]):\n sentence[flag]=language2[location]\n\nfor word in sentence:\n print(word,sep=\" \")\n", "n, m = map(int, input().split())\r\n\r\nd = {}\r\nfor _ in range(m):\r\n a, b = map(str, input().split())\r\n\r\n if len(b) < len(a):\r\n d[a] = b\r\n else:\r\n d[a] = a\r\n\r\nfor i in input().split():\r\n print(d[i], end = ' ')\r\n\r\n", "n,m=map(int,input().split())\r\nd=dict()\r\nfor i in range(m):\r\n l=list(map(str,input().split()))\r\n if(len(l[0])<=len(l[1])):\r\n d[l[1]]=l[0]\r\n else:\r\n d[l[0]]=l[1]\r\na=list(map(str,input().split()))\r\nfor i in a:\r\n if i in d.values():\r\n print(i,end=' ')\r\n else:\r\n print(d[i],end=' ')", "n,m=map(int,input().split())\r\ndct={}\r\nfor alpha in range(m):\r\n a,b=input().split()\r\n dct[a]=b\r\nC=list(input().split())\r\n\r\ns=\"\"\r\nfor i in C:\r\n x=dct[i]\r\n if len(i)>len(x):\r\n s+=\" \"+x\r\n else:\r\n s+=\" \"+i\r\n\r\nprint(s)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\na=[]\r\nfor i in range(m):\r\n a.append(input().split())\r\nd={}\r\nfor k in range(m):\r\n if len(a[k][0]) <= len(a[k][-1]):\r\n d[a[k][-1]]=a[k][0]\r\n else:\r\n d[a[k][0]]=a[k][-1]\r\nans=[]\r\ny=input().split()\r\nfor j in y:\r\n if j in d.keys():\r\n ans.append(d[j])\r\n else:\r\n ans.append(j)\r\np=' '\r\np=p.join(ans)\r\nprint(p)\r\n\r\n", "l1 = list(map(int, input().split()))\r\nn = l1[0];\r\nm = l1[1];\r\ndict = {};\r\n\r\nfor i in range (m):\r\n l1 = list(map(str, input().split()))\r\n dict[l1[0]] = l1[1]\r\n \r\ntemp = input()\r\ninput = temp.split()\r\nopt = \"\"\r\nfor i in input:\r\n if (len(i) <= len(dict[i])):\r\n opt += i + \" \"\r\n else:\r\n opt += dict[i] + \" \"\r\nprint(opt)\r\n \r\n\r\n\r\n", "def bilinggual(words, notes):\r\n mp={}\r\n for i in range(len(words)):\r\n s1,s2=words[i][0],words[i][1]\r\n if len(s1)<=len(s2):\r\n mp[s1]=s1\r\n mp[s2]=s1\r\n else:\r\n mp[s1]=s2\r\n mp[s2]=s2\r\n ans=\"\"\r\n for i in notes:\r\n ans+=mp[i] + \" \"\r\n return ans\r\n\r\nn,m=map(int,input().split())\r\nwords=[]\r\nfor i in range(m):\r\n v=list(input().split())\r\n a,b=v[0],v[1]\r\n words.append([a,b])\r\nnotes=list(input().split())\r\nprint(bilinggual(words,notes))\r\n", "#!/usr/bin/env python3\n\nif __name__ == \"__main__\":\n # number of words in lecture unnecessary to store\n _, m = [int(x) for x in input().split()]\n word_map = {}\n for _ in range(m):\n a, b = input().strip().split()\n word_map[a] = b\n\n text = input().strip().split()\n translated = []\n for word in text:\n other_word = word_map[word]\n if len(other_word) < len(word):\n translated.append(other_word)\n else:\n translated.append(word)\n\n print(\" \".join(translated))\n", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n a,b=input().split()\r\n d[a]=a if len(a)<=len(b) else b\r\nfor i in input().split():\r\n print(d[i],end=' ')", "from sys import stdin\r\n\r\nn, m = map(int, stdin.readline().strip().split())\r\nc = {}\r\nfor _ in range(m):\r\n a, b = map(str, stdin.readline().strip().split())\r\n c[a] = b if len(a) > len(b) else a\r\n\r\ns = stdin.readline().strip().split()\r\no = \" \".join(c.get(w, w) for w in s)\r\nprint(o)\r\n", "m,n=map(int,input().split())\r\nd={}\r\nfor i in range(n):\r\n p=input().split()\r\n if len(p[0])<=len(p[1]):\r\n d[p[0]]=p[0]\r\n d[p[1]]=p[0]\r\n else:\r\n d[p[0]]=p[1]\r\n d[p[1]]=p[1]\r\n \r\ns=input().split()\r\nans=\"\"\r\nfor i in s:\r\n ans+=d[i]+\" \"\r\nprint(ans[:-1])", "n, m = map(int, input().split())\r\nd = dict()\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n d[a] = a\r\n else:\r\n d[a] = b\r\nfor x in input().split():\r\n print(d[x], end=' ')", "from collections import defaultdict\r\nd=defaultdict()\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor i in range(m):\r\n arr.append(tuple(input().split()))\r\nfor i in arr:\r\n d[i[0]]=i[1]\r\n d[i[1]]=i[0]\r\nmes=input()\r\nfor i in mes.split():\r\n if(len(list(i))<=len(list(d[i]))):\r\n print(i,end=' ')\r\n else:\r\n print(d[i],end=' ')", "def rii():\r\n return [int(x) for x in input().split()]\r\n\r\nn, m = rii()\r\n\r\nmapping = {}\r\n\r\nfor _ in range(m):\r\n k, v = input().split()\r\n mapping[k] = k if len(k) <= len(v) else v\r\n mapping[v] = k if len(k) <= len(v) else v\r\n\r\nprint(\" \".join(mapping[w] for w in input().split()))\r\n", "n, m = map(int ,input().split())\r\ndi = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n di[a] = b\r\ns = input().split()\r\nfor i in range(n):\r\n if(len(s[i])<=len(di[s[i]])):\r\n print(s[i], end=' ')\r\n else:\r\n print(di[s[i]], end=' ')", "n, m = map(int, input().split())\nd = {}\nfor _ in range(m):\n a, b = input().split()\n if len(a) <= len(b):\n a, b = b, a\n d[a] = b\nfor x in list(input().split()):\n if x in d:\n print(d[x], end=' ')\n else:\n print(x, end=' ')\n", "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,m=map(int,input().split()) ; dic=dict()\r\nfor i in range(m):\r\n a,b=input().strip().split() \r\n dic[a]=b\r\ntext=input().strip().split()\r\nfor word in text:\r\n if len(word)<=len(dic[word]):\r\n print(word,end=\" \")\r\n else:\r\n print(dic[word],end=\" \")", "n,m = map(int,input().split())\r\nmy_word_dict = {}\r\nfor _ in range(m):\r\n a,b = input().split()\r\n my_word_dict[a] = b\r\nlecture = input().split()\r\nfor word in lecture:\r\n if len(word)<=len(my_word_dict[word]):\r\n print(word,end=\" \")\r\n else:\r\n print(my_word_dict[word],end=\" \")\r\n ", "a,b=map(int,input().split())\r\nx=[]\r\nfor i in range(b):\r\n x.append([j for j in input().split()])\r\nc=input().split()\r\ny=[]\r\nfor i in c:\r\n for j in range(b):\r\n if i in x[j]:\r\n y.append(min(x[j],key=len))\r\nprint(' '.join(y))", "n, m=map(int, input().split())\nd={}\nl=[]\nfor i in range(m):\n s, e=map(str, input().split())\n d[s]=e\n\nl=list(map(str, input().split()))\n\nfor i in range(n):\n if len(l[i]) > len(d[l[i]]):\n l[i]=d[l[i]]\nprint(*l)\n# Sun Dec 11 2022 18:45:28 GMT+0300 (Moscow Standard Time)\n", "_, n = map(int,input().split())\n\nd1 = {}\nd2 = {}\n\nfor i in range(n):\n a,b = input().split()\n d1[a] = b\n d2[b] = a\n\nnn = input().split()\nfor i in nn:\n try:\n if len(d1[i]) < len(i):\n print(d1[i],end=' ')\n else:\n print(i,end=' ')\n except:\n if len(d2[i]) > len(i):\n print(i,end=' ')\n else:\n print(d2[i],end=' ')\n# Sat Jan 28 2023 11:22:03 GMT+0300 (Moscow Standard Time)\n", "n,m = map(int,input().split())\r\nTheWords = dict()\r\nfor _ in range(m):\r\n s,a = input().split()\r\n TheWords[s] = a\r\n TheWords[a] = s\r\nf = input().split()\r\n\r\nfor i in f:\r\n if len(TheWords[i]) < len(i):\r\n print(TheWords[i], end = ' ')\r\n else:\r\n print(i, end = ' ')\r\n\r\n", "def main():\r\n n,m=map(int,input().split())\r\n a,b=[],[]\r\n for i in range(0,m):\r\n r,s=input().split()\r\n a.append(r)\r\n if len(s)<len(r): b.append(s)\r\n else: b.append(r)\r\n c=list(input().split())\r\n for i in range(0,len(c)):\r\n for y in range(0,len(a)):\r\n if c[i]==a[y]: print(b[y],end=\" \");break\r\nif __name__=='__main__':\r\n main()\r\n\r\n", "n,m=map(int,input().split())\r\nd=dict()\r\nl=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n d[a]=b\r\na=input().split()\r\nfor i in a:\r\n if len(d[i])>len(i): \r\n l.append(i)\r\n elif len(d[i])<len(i):\r\n l.append(d[i])\r\n else:\r\n l.append(i)\r\nprint(*l)\n# Sun Jul 10 2022 08:13:20 GMT+0000 (Coordinated Universal Time)\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\nfrom math import ceil\r\n\r\nn,m = ei()\r\nd = {}\r\nfor i in range(m):\r\n\tf,s = input().split()\r\n\td[f] = [len(s),s]\r\nmain = input().split()\r\n# print(d)\r\n# print(main)\r\nfor i in range(len(main)):\r\n\tif len(main[i]) > d[main[i]][0]:\r\n\t\tmain[i] = d[main[i]][1]\r\nprint(*main) ", "n,m=map(int,input().split())\r\ndic={}\r\nfor i in range(m):\r\n\ts1,s2=input().split()\r\n\tdic[s1]=s2\r\nsample=input().split()\r\nfor i in sample:\r\n\ts3=dic[i]\r\n\tif len(i)<=len(s3):\r\n\t\tprint(i,end=' ')\r\n\telse:\r\n\t\tprint(s3,end=' ')\r\n ", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n s,t=map(str,input().rstrip().split())\r\n if len(s)<=len(t):\r\n d[s]=s\r\n else:\r\n d[s]=t\r\np=input().split()\r\nfor i in range(n):\r\n p[i]=d[p[i]]\r\nprint(' '.join(p))\r\n", "n,m = map(int, input().split())\r\nls1 = []\r\nls2 = []\r\nfor i in range(m):\r\n s1,s2 = map(str, input().split())\r\n ls1 = ls1 + [s1]\r\n ls2 = ls2 + [s2]\r\ns = str(input())\r\nls = []\r\nwhile(s.find(\" \")!=-1):\r\n ls = ls + [s[:s.find(\" \")]]\r\n s = s[s.find(\" \")+1:]\r\nls = ls + [s]\r\nfor i in ls:\r\n k = ls1.index(i)\r\n if len(ls1[k])>len(ls2[k]):\r\n print(ls2[k], end=\" \")\r\n else:\r\n print(ls1[k], end=\" \")", "def test():\r\n n,m=[int(i) for i in input().split()]\r\n d={}\r\n for i in range(m):\r\n k,v=[x for x in input().split()]\r\n d[k]=v\r\n l=[i if len(i)<=len(d[i]) else d[i] for i in input().split()]\r\n for i in range(n):\r\n print(l[i],end=\" \")\r\n print()\r\n return\r\nt=1#int(input())\r\nfor i in range(t):\r\n test()", "def language(arr,string):\r\n temp={}\r\n for i in arr:\r\n if len(i[1])<len(i[0]):\r\n temp[i[0]]=i[1]\r\n for i in range(len(string)):\r\n if string[i] in temp.keys():\r\n string[i]=temp[string[i]]\r\n print(*string)\r\n return \"\"\r\n\r\n\r\n\r\n\r\na,b=map(int,input().strip().split())\r\nblanck=[]\r\nfor i in range(b):\r\n a,b=input().strip().split()\r\n blanck.append([a,b])\r\n\r\nlst=list(input().strip().split())\r\nprint(language(blanck,lst))", "n, m = map(int, input().split())\r\ndc = dict()\r\nfor _ in range(m):\r\n a,b = input().split()\r\n if len(b) < len(a):\r\n dc[a] = b\r\n elif len(a) <= len(b):\r\n dc[b] = a\r\n \r\nwords = input().split()\r\nprint(' '.join(dc[w] if w in dc else w for w in words))", "n,m=map(int,input().split())\r\na=[]\r\nj=0\r\nw=''\r\nfor i in range(m):\r\n x,y=map(str,input().split())\r\n a.append(x)\r\n a.append(y)\r\nb=list(map(str,input().split()))\r\nwhile(j<n):\r\n k=a.index(b[j])\r\n if(k%2==0):\r\n if(len(a[k])>len(a[k+1])):\r\n w=w+a[k+1]+\" \"\r\n else:\r\n w=w+a[k]+\" \"\r\n else:\r\n if(len(a[k])>len(a[k-1])):\r\n w=w+a[k-1]+\" \"\r\n else:\r\n w=w+a[k]+\" \"\r\n j=j+1\r\nprint(w)", "n, m = list(map(int, input().split()))\r\nsp = []\r\nfor i in range(m):\r\n x, y = list(map(str, input().split()))\r\n s1 = list()\r\n s1.append(x)\r\n s1.append(y)\r\n sp.append(s1)\r\nnew = input().split()\r\nnorm = []\r\nfor i in new:\r\n for y in sp:\r\n if i in y:\r\n if len(y[0]) < len(y[1]):\r\n norm.append(y[0])\r\n elif len(y[1]) < len(y[0]):\r\n norm.append(y[1])\r\n else:\r\n norm.append(y[0])\r\n else:\r\n continue\r\nprint(' '.join(norm))", "n,m = map(int,input().split())\r\n\r\na = []\r\nb = []\r\nans = []\r\n\r\nfor i in range(0,m):\r\n w1,w2 = [str(x) for x in input().split()]\r\n a.append(w1)\r\n b.append(w2)\r\n\r\ns = input()\r\ns = s.split()\r\n\r\n\r\nfor word in s:\r\n cnt = a.index(word)\r\n if len(a[cnt]) <= len(b[cnt]):\r\n ans.append(a[cnt])\r\n else:\r\n ans.append(b[cnt])\r\n\r\nprint(\" \".join(ans))", "n, m = map(int, input().split())\ntemp = {}\nfor _ in range(m):\n\tw1, w2 = input().split()\n\ttemp[w1] = w2\n\ttemp[w2] = w1\nmess = input().split()\nfor i in mess:\n\tif len(i) <= len(temp[i]):\n\t\tprint(i, end = \" \")\n\telse:\n\t\tprint(temp[i], end = \" \")\n", "kl, lk = input().split()\r\nkli = int(kl)\r\nlki = int(lk)\r\nd = dict()\r\nname = \"\"\r\nho = \"\"\r\ni = 0\r\nfor i in range(lki):\r\n name, ho = input().split()\r\n if len(name) > len(ho):\r\n d[name] = ho\r\n else:\r\n d[name] = name\r\nlec = []\r\nle = list(input().split())\r\ncon = []\r\nlec = len(le)\r\nfor i in range(lec):\r\n con.append(d[le[i]])\r\n print(con[i], end=\" \")\r\n\r\n# klo = str(input())\r\n# print(d[klo])\r\n\n# Thu Jul 07 2022 15:27:46 GMT+0000 (Coordinated Universal Time)\n", "n, m = map(int, input().split())\r\narr = {}\r\nrez = \"\"\r\nfor i in range(m):\r\n s, s1 = input().split()\r\n arr[s] = s1\r\nmas = input().split()\r\nfor i in range(n):\r\n a = mas[i]\r\n b = arr[a]\r\n if len(b) < len(a):\r\n rez += b + ' '\r\n else:\r\n rez += a + ' '\r\nprint(rez[:-1])\r\n", "n, m = map(int, input().split())\nd = {}\nfor _ in range(m):\n ai, bi = input().split()\n d[ai] = bi\nt = input().split()\nfor i, w in enumerate(t):\n if len(d[w]) < len(w):\n t[i] = d[w]\nprint(' '.join(t))", "n, m = map(int, input().split())\r\n\r\nadict = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n adict[a] = b\r\n\r\nalist = list(input().split())\r\n\r\nfor i in range(n):\r\n if len(alist[i]) > len(adict[alist[i]]):\r\n alist[i] = adict[alist[i]]\r\n\r\nprint(*alist)", "n,m = map(int,input().split())\r\nwords = {}\r\nfor i in range(m):\r\n l = input().split()\r\n if len(l[0])>len(l[1]):\r\n words[l[0]] = l[1]\r\n words[l[1]] = l[1]\r\n else:\r\n words[l[0]] = l[0]\r\n words[l[1]] = l[0]\r\nlecture = input().split()\r\nl1 = []\r\nfor i in lecture:\r\n l1.append(words[i])\r\nfor i in l1:\r\n print(i, end=\" \")", "a,b=map(int,input().strip().split())\r\ndi={}\r\nfor i in range(b):\r\n s=(input().strip().split())\r\n s1,s2=s[0],s[1]\r\n if len(s1)>len(s2):\r\n di[s1]=s2\r\n else:\r\n di[s1]=s1\r\nli=input().strip().split()\r\nfor i in li:\r\n print(di[i],end=\" \")\r\n", "def solve():\r\n n, m = [int(i) for i in input().split()]\r\n d = {}\r\n for _ in range(m):\r\n a, b = input().split()\r\n d[a] = b if len(a) > len(b) else a\r\n for w in input().split():\r\n print(d[w], end=' ')\r\n\r\n\r\nsolve()", "n,k=map(int,input().split())\r\nlang1=[]\r\nlang2=[]\r\nfor i in range (k):\r\n str1=input()\r\n a,b=str1.split(\" \")\r\n lang1.append(a)\r\n lang2.append(b)\r\nstr1=input()\r\nprof=list(str1.split(\" \"))\r\nnotes=[]\r\nfor i in range (n):\r\n word=prof[i]\r\n if(lang1.count(word)==1):\r\n index=lang1.index(word)\r\n if(len(lang1[index])>len(lang2[index])):\r\n print(lang2[index],end=\" \")\r\n elif(len(lang1[index])==len(lang2[index])):\r\n print(lang1[index],end=\" \")\r\n elif(len(lang1[index])<len(lang2[index])):\r\n print(lang1[index],end=\" \")\r\n elif(lang2.count(word)==1):\r\n index=lang2.index(word)\r\n if(len(lang1[index])>len(lang2[index])):\r\n print(lang2[index],end=\" \")\r\n elif(len(lang1[index])==len(lang2[index])):\r\n print(lang1[index],end=\" \")\r\n elif(len(lang1[index])<len(lang2[index])):\r\n print(lang1[index],end=\" \")\r\nprint(\"\\n\")", "n, m = map(int, input().split())\r\nar = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) > len(b):\r\n ar[a] = b\r\n ar[b] = b\r\n else:\r\n ar[b] = a\r\n ar[a] = a\r\ns = input().split()\r\nfor i in s:\r\n print(ar[i], end = ' ')\r\n", "n,m = map(int,input().split())\narr_1 = []\narr_2 = []\nfor _ in range(m):\n a,b = input().split()\n arr_1.append(a)\n arr_2.append(b)\nsentence = list(input().split())\nans = []\nnotes = []\nfor i in sentence:\n ans.append(arr_1.index(i))\nfor i in ans:\n if len(arr_1[i]) < len(arr_2[i]):\n notes.append(arr_1[i])\n elif len(arr_1[i]) > len(arr_2[i]):\n notes.append(arr_2[i])\n else:\n notes.append(arr_1[i])\nfor i in notes:\n print(i,end = ' ')\n", "n, m = map(int, input().split())\r\nd = {}\r\n\r\nfor i in range(m):\r\n \r\n x,z = input().split()\r\n d[x] = z\r\n \r\ns = input().split()\r\ntab = \"\"\r\n\r\nfor i in s:\r\n \r\n if len(i) > len(d[i]):\r\n tab += d[i] + \" \"\r\n else:\r\n tab += i + \" \"\r\nprint(tab)\r\n\r\n \r\n \r\n \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 comp(x,y):\r\n if len(x) > len(y):\r\n return y\r\n else:\r\n return x\r\nl1 = []\r\na,b = map(int,input().split())\r\n\r\nfor i in range(b+1):\r\n lst = list(map(str,input().split()))\r\n if i <= b-1:\r\n for e in lst:\r\n l1.append(e)\r\n\r\nfor ay in lst:\r\n ind = l1.index(ay)\r\n print(comp(l1[ind],l1[ind+1]),end=' ')", "n,m=map(int,input().split())\r\na={}\r\nfor i in range(m):\r\n p,o=map(str,input().split())\r\n if len(p)>len(o):\r\n a[p]=o\r\n else:\r\n a[p]=p\r\ns,r=input().split(\" \"),\"\"\r\nfor i in s:\r\n r+=a[i]+\" \"\r\nprint(r)", "def n499b():\r\n dct={}\r\n n,m = map(int, input().split())\r\n for i in range(m):\r\n a,b=map(str,input().split())\r\n if len(a)> len(b):\r\n dct[a] = b\r\n lect=list(map(str, input().split()))\r\n for j in range(n):\r\n if lect[j] in dct:\r\n lect[j] = dct[lect[j]]\r\n print(\" \".join(lect))\r\n\r\nn499b()", "n, m = map(int, input().split())\r\nshortest_variations = dict()\r\n\r\nfor _ in range(m):\r\n a, b = input().split()\r\n shortest_variations[a] = shortest_variations[b] = min([a, b], key=len)\r\n\r\nprint(' '.join(map(lambda word: shortest_variations[word], input().split())))\r\n", "n,m = map(int,input().split())\r\nl = []\r\nfor i in range (m):\r\n a,b = map(str,input().split())\r\n l.append([a,b])\r\n \r\nls = list(map(str,input().split()))\r\nlst = []\r\nfor ele in ls:\r\n for i in range (len(l)):\r\n if ele == l[i][0]:\r\n if len(l[i][0])<=len(l[i][1]):\r\n lst.append(l[i][0])\r\n else:\r\n lst.append(l[i][1])\r\nlist = [] \r\nfor char in lst:\r\n chare = \"\" \r\n chare = char+\" \"\r\n list.append(chare)\r\ncha = ''\r\nfor chart in list:\r\n cha = cha + chart\r\n \r\nprint(cha)", "lecture_length, no_of_word_in_each_language = map(int, input().split())\r\nlanguage_dict = {}\r\nrecorded_lecture = []\r\n\r\nfor _ in range(no_of_word_in_each_language):\r\n word_in_lang_a, word_in_lang_b = input().split()\r\n language_dict[word_in_lang_a] = word_in_lang_b\r\n\r\ndelivered_lecture = input().split()\r\n\r\nfor word in delivered_lecture:\r\n recorded_word = word if len(word) <= len(language_dict[word]) else language_dict[word]\r\n recorded_lecture.append(recorded_word)\r\n\r\nprint(\" \".join(recorded_lecture))\r\n", "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\ndict = {}\r\nn,m = rinput()\r\n\r\nfor _ in range(m):\r\n l1,l2 = tinput()\r\n if len(l1) < len(l2):\r\n smaller = l1\r\n elif len(l1) == len(l2):\r\n smaller = l1\r\n else:\r\n smaller = l2\r\n dict[l1] = smaller\r\n dict[l2] = smaller\r\nspeech = list(tinput())\r\nfor word in speech:\r\n print(dict[word],end=\" \")", "n,m=map(int, input().split())\r\ndic=dict()\r\nfor i in range(m):\r\n a,b=input().split()\r\n dic[a]=b\r\nre=\"\" \r\narr=[(arr) for arr in input().split()]\r\nfor i in arr:\r\n if(len(i)<= len(dic[i])):\r\n re=re+i+\" \"\r\n else:\r\n re=re+dic[i]+\" \"\r\nprint(re)\r\n ", "(n,m)=map(int,input().split(' '))\r\nt={}\r\n\r\nfor i in range(m):\r\n (a,b)=map(str,input().split(' '))\r\n t[a]=b\r\n \r\ns=list(input().split(' '))\r\nans=str()\r\nfor word in s:\r\n if len(word)>len(t[word]):\r\n ans+= t[word]+' '\r\n else:\r\n ans+=word +' ' \r\nprint(ans) \r\n", " \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\n#SLMII = lambda: sorted(LMII())\r\n\r\nn, m = MII()\r\n\r\ndic = dict()\r\n\r\nfor _ in range(m):\r\n a, b = sorted(input().split(), key=len)\r\n dic[a] = dic[b] = a\r\n \r\n \r\nprint(' '.join(dic[word] for word in input().split()))\r\n\r\n", "_,m = input().split()\nd = {}\n\nfor _ in range( int(m) ):\n a,b = input().split() # string format\n\n if len(a) > len(b):\n d[a] = b\n \n else:\n d[b] = a # a is priority\n\n\nfinalNote = []\n\nfor x in input().split():\n try:\n finalNote.append(d[x])\n except KeyError:\n finalNote.append(x)\n\n\nprint(' '.join(finalNote) )\n\n\n\n", "n,m=[int(x) for x in input().split()]\r\ndict1={}\r\nfor i in range(m):\r\n x,y=[x for x in input().split()]\r\n if len(x)<=len(y):\r\n dict1[x]=x\r\n else:\r\n dict1[x]=y\r\ns=input()\r\nlst=s.split(' ')\r\nlst1=[]\r\nfor i in lst:\r\n lst1.append(dict1[i])\r\nprint(' '.join(lst1))", "n,m = map(int,input().split())\r\na = [0]*m\r\nb = [0]*m\r\nfor i in range(m):\r\n a[i],b[i] = input().split()\r\nnote = []\r\nfor s in input().split():\r\n k = a.index(s)\r\n if len(a[k]) <= len(b[k]):\r\n note.append(a[k])\r\n else:\r\n note.append(b[k])\r\nprint(*note)\r\n", "t=input().split(\" \")\r\nn=int(t[1])\r\nm=int(t[0])\r\ndata={}\r\nfor i in range (n):\r\n\td=input().split(\" \")\r\n\tif len(d[1])<len(d[0]):\r\n\t\tdata.update({d[1]:d[1]})\r\n\t\tdata.update({d[0]:d[1]})\r\n\telse:\r\n\t\tdata.update({d[1]:d[0]})\r\n\t\tdata.update({d[0]:d[0]})\r\n#print(data)\r\nlecture = input().split(\" \")\r\nfor i in lecture:\r\n\tprint(data[i],end=\" \")\r\n\t\t\r\n\t\r\n\r\n", "n, m = map(int, input().split())\r\nseq_dict = {}\r\n\r\nfor _ in range(m):\r\n a, b = sorted(input().split(), key=len)\r\n\r\n seq_dict[b] = a\r\n\r\ns = input().split()\r\nfor i in s:\r\n print(seq_dict.get(i, i), end=' ')", "n,m=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nfor _ in range(m):\r\n a,b=map(str,input().split())\r\n l1.append(a)\r\n l2.append(b)\r\ns=\"\" \r\nlist1=map(str,input().split()) \r\nfor i in list1:\r\n if i in l1 :\r\n p=l1.index(i)\r\n if len(l1[p])>len(l2[p]):\r\n s+=l2[p]+\" \"\r\n else:\r\n s+=l1[p]+\" \"\r\nprint(s)", "n, m = map(int, input().split())\r\nfirst, second = [], []\r\nfor _ in range(m):\r\n x, y = input().split()\r\n first.append(x)\r\n second.append(y)\r\nrecord =input().split()\r\nres = []\r\nfor word in record:\r\n ind = first.index(word)\r\n if len(first[ind]) <= len(second[ind]):\r\n res.append(first[ind])\r\n else:\r\n res.append(second[ind])\r\nprint(*res)", "\r\nn, m = list(map(int, input().split()))\r\nmemo = {}\r\nfor _ in range(m):\r\n words = list(map(str, input().split()))\r\n memo[words[0]] = words[1]\r\n\r\nlecture = list(map(str, input().split()))\r\nfor word in lecture:\r\n lan1 = word\r\n lan2 = memo[word]\r\n if len(lan1) > len(lan2):\r\n print(lan2, end=\" \")\r\n else:\r\n print(lan1, end=\" \")\r\n\r\n", "n, m = map(int, input().split())\nd = {}\nfor _ in range(m):\n a, b = input().split()\n if len(a) <= len(b):\n d[a] = a\n else:\n d[a] = b\n\nres = \"\"\nfor word in input().split():\n res += d[word] + \" \"\nprint(res[:-1])\n", "n, m = map(int, input().split())\r\nd = {}\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n if len(a) <= len(b):\r\n d[b] = a\r\n else:\r\n d[a] = b\r\n\r\nl = list(map(str, input().split()))\r\n\r\nfor i in range(len(l)):\r\n if l[i] in d.keys():\r\n l[i] = d[l[i]]\r\n\r\n\r\nprint(\" \".join(l))\r\n", "n, m = [int(i) for i in input().split()]\ndic = {}\nfor i in range(m):\n a, b = [j for j in input().split()]\n dic[a] = b\nprofessorL = [i for i in input().split()]\nlecture = ['']*n\nfor i in range(n):\n s = professorL[i]\n la = len(s)\n lb = len(dic[s])\n if la <= lb:\n lecture[i] = s\n else:\n lecture[i] = dic[s]\nprint(*lecture)\n", "n=[int(q)for q in input().split()]\r\nd1=[]\r\nd2=[]\r\nfor q in range(n[1]):\r\n e=input().split()\r\n d1.append(e[0])\r\n d2.append(e[1])\r\nfor q in input().split():\r\n i=d1.index(q)\r\n if len(q)>len(d2[i]):\r\n print(d2[i],end=' ')\r\n else:\r\n print(q,end=' ')\r\n \r\n", "n, m = map(int, input().split())\r\ntrack, ans = [], []\r\nfor t in range(m):\r\n arr = input().split()\r\n track.append(arr)\r\ns = input()\r\nls = s.split()\r\nfor i in range(len(ls)):\r\n for e in range(len(track)):\r\n if ls[i] in track[e]:\r\n a = len(track[e][0])\r\n b = len(track[e][1])\r\n if a <= b:\r\n ans.append(track[e][0])\r\n else:\r\n ans.append(track[e][1])\r\nprint(' '.join(ans))\r\n\r\n", "a,b = map(int,input().split())\r\nl={}\r\nfor i in range(b):\r\n p,q=input().split()\r\n if(len(q)>=len(p)):\r\n l[p] = p\r\n else:\r\n l[p] = q\r\nk = input().split()\r\nfor i in k:\r\n print(l[i])", "n,m=map(int,input().split())\r\nd=[]\r\nwhile m:\r\n first_lang,second_lang=input().split()\r\n d.append([first_lang,second_lang])\r\n m-=1\r\ns=input()\r\nt=s.split()\r\na=[]\r\nfor i in t:\r\n for j in d:\r\n if j[0]==i:\r\n if len(j[0])>len(j[1]):\r\n a.append(j[1])\r\n else:\r\n a.append(j[0])\r\n break\r\nb=\" \".join(a)\r\nprint(b)\r\n", "n, m = map(int, input().split())\r\nd = {}\r\nfor _ in range(m):\r\n\ti, j = input().split()\r\n\td[i] = j\r\n\r\nr = []\r\n\r\nfor i in input().split():\r\n\tr.append(d[i] if len(d[i]) < len(i) else i)\r\n\r\nprint(\" \".join(r))", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn,m=rinput()\r\nd={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n d[a]=b\r\n\r\ns=list(input().split())\r\n\r\nfor i in range(n):\r\n if(len(s[i])>len(d[s[i]])):\r\n s[i]=d[s[i]]\r\n\r\n \r\n\r\nprint(*s)", "size = list(map(int,(input()).split()))\r\nwords = {}\r\n\r\nfor i in range(size[1]):\r\n temp = (input()).split()\r\n if len(temp[0])>len(temp[1]):\r\n words[temp[0]] = temp[1]\r\n else:\r\n words[temp[0]] = temp[0]\r\nlec_words = (input()).split()\r\nfi = ''\r\nfor i in range(len(lec_words)):\r\n if i!=len(lec_words)-1:\r\n # print(lec_words[i])\r\n fi = fi+f'{words[lec_words[i]]} '\r\n else:\r\n fi = fi+f'{words[lec_words[i]]}'\r\nprint(fi)\r\n", "n, m = map(int, input().split())\nall_tuples = []\nanswers = []\nfor i in range(m):\n all_tuples.append(input().split())\nsentence = input().split()\nvisited = dict()\nfor i in sentence:\n if i in visited:\n answers.append(visited[i])\n continue\n else:\n for j in all_tuples:\n if i in j:\n answers.append(min(j[0],j[1], key=lambda x:len(x)))\n visited[i] = min(j[0],j[1], key=lambda x:len(x))\n\n\nprint(*answers, sep=\" \")", "a,b=map(int,input().split())\r\ne={}\r\nfor i in range(b):\r\n d,c=input().split()\r\n e[d]=c\r\nname=input().split()\r\nfor i in name:\r\n print(i if len(i)<=len(e[i]) else e[i],end=' ')\r\n", "d = dict()\r\nans = \"\"\r\nz = \"\"\r\nn, s = map (int, input ().split ())\r\nfor _ in range(s):\r\n a, b = input().split()\r\n if len(a) > len(b):\r\n d[a] = b\r\n elif len(b) > len(a):\r\n d[b] = a\r\n else:\r\n d[b] = a\r\nq = input().split()\r\nfor i in range(n):\r\n z = q[i]\r\n if z in d:\r\n ans += d[z] + \" \"\r\n else:\r\n ans += z + \" \"\r\nprint(ans)\n# Thu Jul 07 2022 12:54:57 GMT+0000 (Coordinated Universal Time)\n", "n , m = map(int,input().split())\r\nd = {}\r\nfor k in range(m):\r\n\ta , b = list(input().split())\r\n\td[a] = b\r\nl = list(input().split())\r\nfor i in l:\r\n\tif len(i)>len(d[i]):\r\n\t\tprint(d[i],end = \" \")\r\n\telse:\r\n\t\tprint(i,end = \" \")\t", "#.*?\\n\n#from collections import Counter\n#from collections import defaultdict\n#from collections import deque\n\n# BIT_MANIPULATION\n# def intToBin(num:int): return \"{0:b}\".format(num)\n# def binToInt(bin:str)->int: return int(bin,2)\n\n# INPUT\ndef inpNum(): return int(input())\ndef inpNums(): return map(int,input().split())\ndef inpList(): return list(map(int,input().split()))\n# def inpMatrix(rows): return [list(map(int, input().split())) for _ in range(rows)]\ndef inpStrMatrix(rows): return [list(input()) for _ in range(rows)]\n\n# problem code:\n\nn,m = inpNums()\nwords = dict()\nfor i in range(m):\n s = input().split()\n l1,l2 = len(s[0]),len(s[1])\n if l1>l2:\n words[s[0]] = s[1]\nfor t in input().split():\n if t in words:\n print(words[t],end=' ')\n else:\n print(t,end=' ')", "n, m = [int(a) for a in input().split()]\r\nwords = []\r\nfinal = dict()\r\n\r\nfor _ in range(m):\r\n words = input().split()\r\n keyy = words[0]\r\n words.sort(key=len)\r\n final[keyy] = {words[0], words[1]}\r\n\r\nlekcia = list(input().split())\r\nstfinal = []\r\n\r\nfor i in lekcia:\r\n stfinal.append(min(final[i], key=len))\r\n\r\nprint(*stfinal)", "n , m = list(map(int,input().split()))\r\n\r\ndict_ = dict()\r\nfor i in range(m):\r\n st,st1 = list(input().split())\r\n \r\n dict_[st] = st if len(st)<=len(st1) else st1\r\n\r\nlist_ = list(input().split())\r\nfor i in list_:\r\n print(dict_[i],end = \" \")", "n, m = [int(x) for x in input().split()]\r\na = []\r\nb = []\r\nfor i in range(0, m):\r\n one, sec = [x for x in input().split()]\r\n a.append(one)\r\n b.append(sec)\r\nf = [x for x in input().split()]\r\ndict_select = {}\r\nfor i in range(0, m):\r\n dict_select[a[i]] = a[i] if len(a[i]) <= len(b[i]) else b[i]\r\nop = []\r\nfor val in f:\r\n op.append(dict_select.get(val))\r\nprint(' '.join(op))", "n, m = map(int, input().split())\ndic = {}\n\nfor q in range(0, m):\n\ta, b = input().split()\n\tdic[a] = b\n\nc = list(input().split())\n\nfor i in c:\n\tif(len(i) <= len(dic[i])):\n\t\tprint(i, end = \" \")\n\telse:\n\t\tprint(dic[i], end = \" \")\n", "n, m = map(int, input().split())\r\ndct = {}\r\nfor i in range(m):\r\n tmp = input().split()\r\n dct[tmp[0]] = tmp[1]\r\narr = list(input().split())\r\nfor j in arr:\r\n if len(j) <= len(dct[j]):\r\n print(j,end=' ')\r\n else:\r\n print(dct[j],end=' ')\r\n\r\n", "n,m = map(int,input().split())\r\nk = []\r\nv = []\r\nfor i in range(m):\r\n a,b = input().split()\r\n k.append(a)\r\n v.append(b)\r\nw = input().split()\r\nfor i in w:\r\n a = k.index(i)\r\n if len(k[a])>len(v[a]):\r\n print(v[a],end = ' ')\r\n else:\r\n print(k[a],end = ' ')\r\n ", "n,m=map(int,input().split())\r\ndic = dict(input().split() for i in range(m))\r\ns1=input().split()\r\nfor s in s1:\r\n t = dic[s]\r\n if len(s) <= len(t) :\r\n print(s,end=' ')\r\n else:\r\n print(t,end=' ')\r\n", "n, m = input().split()\r\nm = int(m)\r\nd = dict()\r\nwhile m:\r\n m -= 1\r\n a, b = input().split()\r\n if len(a) > len(b):\r\n d[a] = b\r\n\r\nbuffer = []\r\nfor word in input().split():\r\n if word in d:\r\n buffer.append(d[word])\r\n else:\r\n buffer.append(word)\r\n\r\nprint(*buffer)", "n,t=map(int,input().split())\r\ndict1={}\r\nfor i in range(t):\r\n a,b=input().split()\r\n if len(b)<len(a):\r\n dict1[a]=b\r\n else:\r\n dict1[a]=a\r\nlist1=input().split()\r\nlist2=[]\r\nfor i in list1:\r\n list2.append(dict1[i])\r\nprint(' '.join(list2))", "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\ndef get_strings():\r\n return map(str, sys.stdin.readline().strip().split())\r\ndef get_str_in_list(): return list(\r\n map(str, sys.stdin.readline().strip().split()))\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n, m = get_ints_in_variables()\r\n mp = {}\r\n for _ in range(0, m):\r\n ai, bi = get_strings()\r\n aiLen = len(ai)\r\n biLen = len(bi)\r\n if aiLen <= biLen:\r\n mp[ai] = ai\r\n mp[bi] = ai\r\n else:\r\n mp[ai] = bi\r\n mp[bi] = bi\r\n text = get_str_in_list()\r\n for i in range(0, n):\r\n print(mp[text[i]], end=\" \")\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n x,y=input().split()\r\n if len(x)>len(y):\r\n d[x]=y\r\n else:\r\n d[x]=x\r\nstr=input().split()\r\nfor i in str:\r\n print(d[i],end=\" \")\r\n ", "n, m = map(int, input().split())\r\nd = dict()\r\nfor i in range(m):\r\n a, b = input().split()\r\n mn = a\r\n if len(b) < len(a):\r\n mn = b\r\n d[a] = mn\r\n d[b] = mn\r\nn = input().split()\r\n\r\nresult = []\r\n\r\nfor w in n:\r\n result.append(d[w])\r\n \r\nprint(\" \".join(result))\r\n\r\n \r\n ", "import sys\n\nn, m = [int(i) for i in input().split()]\ndct = {}\nfor i in range(m):\n temp = input().split()\n if len(temp[0]) <= len(temp[1]):\n dct[temp[0]] = temp[0]\n else:\n dct[temp[0]] = temp[1]\n\nlecture = input().split()\nans = []\n\nfor i in lecture:\n ans.append(dct[i])\n\nans = \" \".join(ans)\nprint(ans)\n", "n, m = map(int, input().split())\r\nlang1 = [0] * m\r\nlang2 = [0] * m\r\nfor i in range(m):\r\n ws = input().split()\r\n lang1[i] = ws[0]\r\n lang2[i] = ws[1]\r\nwords = input().split()\r\n\r\nfor c in words:\r\n\r\n ind = lang1.index(c)\r\n w1 = lang1[ind]\r\n w2 = lang2[ind]\r\n if len(w1) <= len(w2):\r\n print(w1, end = \" \")\r\n else:\r\n print(w2, end = \" \")", "v1,v2=map(int,input().split())\r\nd={}\r\nfor _ in range(v2):\r\n v1,v2=input().split()\r\n d[v1]=v1 if len(v1)<=len(v2) else v2\r\nfor i in input().split():\r\n print(d[i],end=' ')\r\n", "n,m = map(int,input().split())\r\n\r\nlang = dict()\r\nfor i in range(m):\r\n a,b = map(str,input().split())\r\n lang[a] = b if len(b)<len(a) else a\r\nfor i in input().split():\r\n print(lang[i],end=' ')", "n,m=list(map(int,input().split()))\r\nl=[]\r\ns=[]\r\nfor i in range(m):\r\n a,b=list(map(str,input().split()))\r\n l.append(a)\r\n s.append(b)\r\nc=list(map(str,input().split()))\r\nans={}\r\nfor i in range(len(l)):\r\n if len(l[i])<len(s[i]):\r\n ans[s[i]]=l[i]\r\n elif len(l[i])>len(s[i]):\r\n ans[l[i]]=s[i]\r\n else:\r\n ans[s[i]]=l[i]\r\nfor char in c:\r\n if char in ans:\r\n print(ans[char],end=' ')\r\n else:\r\n print(char,end=' ')", "# # 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, m = map(int, input().split())\r\n\r\nd = dict()\r\nfor _ in range(m):\r\n first, second = input().split()\r\n d[first] = first if len(first) <= len(second) else second\r\n\r\nlecture = input().split()\r\ntranslate = []\r\nfor word in lecture:\r\n translate.append(d[word])\r\nprint(*translate)\r\n", "n, m = [int(x) for x in input().split()]\r\nd = dict()\r\nfor i in range(m):\r\n\ta, b = input().split()\r\n\td[a] = b\r\nl = input().split()\r\nfor i in range(n):\r\n\tif len(l[i]) > len(d[l[i]]):\r\n\t\tl[i] = d[l[i]]\r\nprint(' '.join(l))", "n,m = map(int,input().split())\r\nshorter = {}\r\nfor i in range(m):\r\n str = list(input().split())\r\n if len(str[0])<=len(str[1]):\r\n shorter[str[0]]=str[0]\r\n else :\r\n shorter[str[0]]=str[1]\r\n# print(shorter)\r\ntext = list(input().split())\r\nans=\"\"\r\nfor i in text:\r\n ans+=shorter[i]+\" \"\r\nprint(ans)", "\r\ndef answer(n, m, a, b, c):\r\n new_ary = []\r\n for i in range(len(c)):\r\n indx = a.index(c[i])\r\n if len(a[indx]) <= len(b[indx]):\r\n new_ary.append(a[indx])\r\n else:\r\n new_ary.append(b[indx])\r\n\r\n return ' '.join(new_ary)\r\n\r\ndef main():\r\n n, m = [int(i) for i in input().split()]\r\n a = ['x'] * m\r\n b = ['x'] * m\r\n for j in range(m):\r\n a[j], b[j] = [i for i in input().split()]\r\n c = [i for i in input().split()]\r\n \r\n print(answer(n, m, a, b, c))\r\n\r\n\r\nmain()", "n,m=map(int,input().split())\r\nhash_map={}\r\nfor i in range(m):\r\n x,y=input().split()\r\n hash_map[x]=y\r\nnotes=list(map(str,input().strip().split()))\r\nfor i in range(n):\r\n if len(str(notes[i]))<=len(hash_map[notes[i]]):\r\n continue\r\n else:\r\n notes[i]=hash_map[notes[i]]\r\n \r\nfor i in notes:\r\n print(i,end=\" \")", "n,m=map(int,input().split())\r\nlanguage1=[]\r\nlanguage2=[]\r\nx=[]\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n language1.append(a)\r\n language2.append(b)\r\nwords=list(map(str,input().split()))\r\nfor element in words:\r\n i1=language1.index(element)\r\n if(len(element)<=len(language2[i1])):\r\n x.append(element)\r\n else:\r\n x.append(language2[i1])\r\nfor k in range(len(x)):\r\n print(x[k],end=\" \")", "from functools import reduce\r\nimport os\r\nimport sys\r\nfrom math import *\r\nfrom collections import *\r\nfrom fractions import *\r\nfrom bisect import *\r\nfrom heapq import*\r\nfrom io import BytesIO, IOBase\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef value():return tuple(map(int,input().split()))\r\ndef arr():return [int(i) for i in input().split()]\r\ndef sarr():return [int(i) for i in input()]\r\ndef starr():return [str(x) for x in input().split()]\r\ndef inn():return int(input())\r\ndef svalue():return tuple(map(str,input().split()))\r\nmo=1000000007\r\n#----------------------------CODE------------------------------#\r\nn,m=value()\r\nd=defaultdict(int)\r\nfor i in range(m):\r\n x,y=svalue()\r\n if(len(x)<=len(y)):\r\n d[x]=x\r\n else:\r\n d[x]=y\r\na=starr()\r\nfor i in a:\r\n print(d[i],end=\" \")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nd = {}\r\ns = []\r\nfor i in range(m):\r\n a = input().split()\r\n a0 = a[0] + '1'\r\n a1 = a[1] + '2'\r\n d[a[0]] = a1\r\n d[a[1]] = a0\r\nb = input().split()\r\nfor i in range(n):\r\n c = b[i]\r\n e = d[b[i]]\r\n if len(b[i]) < len(d[b[i]]) - 1:\r\n s.append(c)\r\n elif len(b[i]) > len(d[b[i]]) - 1:\r\n e = e[:len(e) - 1]\r\n s.append(e)\r\n else:\r\n if e[len(e) - 1] == '1':\r\n e = e[:len(e) - 1]\r\n s.append(e)\r\n else:\r\n s.append(c)\r\nprint(*s)\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 n,m = get_ints()\r\n one = {}\r\n two = {}\r\n for i in range(m):\r\n a = list(sys.stdin.readline().strip().split())\r\n one[a[0]] = a[1]\r\n two[a[1]] = a[0]\r\n\r\n b = list(sys.stdin.readline().strip().split())\r\n ans = []\r\n for word in b:\r\n if word in one:\r\n if len(word)<=len(one[word]): ans.append(word)\r\n else: ans.append(one[word])\r\n else:\r\n if len(word)<len(two[word]): ans.append(word)\r\n else: ans.append(two[word])\r\n print(\" \".join(ans))\r\n", "def solve():\r\n n, m = [int(x) for x in input().split()]\r\n \r\n #Insert words in dictionary:\r\n words_dict = {}\r\n for i in range(m):\r\n words = [x for x in input().split()]\r\n words_dict[words[0]] = words[1]\r\n \r\n #Translate lecture:\r\n lec = [x for x in input().split()]\r\n for i in range(len(lec)):\r\n if len(lec[i]) > len(words_dict[lec[i]]):\r\n lec[i] = words_dict[lec[i]]\r\n print(\" \".join(lec))\r\n return\r\n\r\nsolve()", "n, m = map(int, input().split())\r\nd = dict()\r\nfor i in range(m):\r\n s1, s2 = input().split()\r\n d[s1] = s2 if(len(s2) < len(s1)) else s1\r\ns = list(input().split())\r\nfor i in s:\r\n print(d[i], end=\" \")", "n, m = map(int, input().split())\r\nlang = {}\r\nfor i in range(m):\r\n word1, word2 = map(str, input().split())\r\n lang[word1] = word2\r\ntext = list(map(str, input().split()))\r\nfor word in text:\r\n y = lang[word]\r\n if len(y) < len(word):\r\n print(y, end=\" \")\r\n else:\r\n print(word, end=' ')\r\n", "dic = {}\r\nfor i in range(int(input().split()[1])):\r\n m = input().split()\r\n dic[m[0]] = m[len(m[0]) > len(m[1])] # max or min\r\nfor i in input().split():\r\n print(dic[i], end = \" \")", "# t = int(input())\nt = 1\n\n\ndef cp():\n # code here\n n,m = tuple(map(int,input().split()))\n dictionary = dict()\n for _ in range(m):\n x,y = tuple(map(str,input().split()))\n dictionary[x] = y\n string = str(input())\n strlist = list(string.split())\n for word in strlist:\n word2 = dictionary[word]\n if len(word2) < len(word):\n print(word2,end=' ')\n else:\n print(word,end=' ')\n print()\n\n\n\n\nfor i in range(t):\n cp()\n", "n,m=list(map(int,input().split()))\r\nl=[]\r\n\r\nfor i in range(m):\r\n l.append(list(input().split()))\r\np=list(input().split())\r\nd={}\r\nfor i in range(m):\r\n d[l[i][0]]=l[i][1]\r\ns=''\r\nfor i in range(n):\r\n if len(d[p[i]])>=len(p[i]):\r\n s=s+p[i]+' '\r\n else:\r\n s=s+d[p[i]]+' '\r\nprint(s[0:len(s)-1])", "n,m=map(int,input().split())\r\nd={}\r\nfor r in range(m):\r\n a,b=input().split()\r\n p=len(a)\r\n q=len(b)\r\n if(p<=q):\r\n d[a]=a\r\n else:\r\n d[a]=b\r\nw=list(input().split())\r\nfor u in w:\r\n print(d[u],end=' ')", "def main():\r\n n , m = map(int,input().split())\r\n dict = {}\r\n for i in range(m):\r\n a , b = map(str,input().split())\r\n dict[a] = b\r\n lst = input().split(\" \")\r\n for elem in lst :\r\n if len(elem)<=len(dict[elem]):\r\n print(elem,end=\" \")\r\n else :\r\n print(dict[elem],end=\" \")\r\n\r\nmain()\r\n", "\nn, m = map(int, input().split())\n\nA = []\nB = []\n\nfor i in range(m):\n a,b = input().split()\n A.append(a)\n B.append(b)\n\n\nsent = input().split(' ')\nfor i in sent:\n j = A.index(i)\n if (len(B[j]) < len(i)):\n print(B[j], end=' ')\n else:\n print(i, end=' ')\n", "\n\nn, m = map(int, input().split())\n\npairStr = [[y for y in input().split()] for x in range(m)]\nlec = [x for x in input().split()]\n\nfor string in lec:\n for s in pairStr:\n if string in s:\n if len(s[0]) > len(s[1]):\n print(s[1], end = ' ')\n else:\n print(s[0], end = ' ')\n", "def main(n,v,a,s2):\r\n d={}\r\n for i in range(v):\r\n if(len(a[i][0])<=len(a[i][1])):\r\n d[a[i][0]]=a[i][0]\r\n else:\r\n d[a[i][0]]=a[i][1]\r\n b=''\r\n for i in s2:\r\n b+=d[i]+' '\r\n print(b)\r\n \r\n \r\nif __name__== \"__main__\" :\r\n s=input()\r\n n=int(s.split()[0])\r\n v=int(s.split()[1])\r\n a=[]\r\n for i in range(v):\r\n a.append(input().split())\r\n s2=input().split()\r\n main(n,v,a,s2)", "n,k=map(int,input().split())\r\nd={}\r\nfor _ in range(k):\r\n a,b=map(str,input().split())\r\n if len(a)<=len(b):\r\n d[a]=a\r\n else:\r\n d[a]=b \r\ns=list(map(str,input().split()))\r\nw=''\r\nfor i in range(n):\r\n w+=d[s[i]]+\" \"\r\nprint(w) \r\n \r\n\r\n ", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(m):\r\n x,y=map(str,input().split())\r\n l.append(x)\r\n l.append(y)\r\nk=list(map(str,input().split()))\r\ni=0\r\nfor j in k:\r\n i=l.index(j)\r\n if(len(l[i])<=len(l[i+1])):\r\n print(l[i],end=\" \")\r\n else:\r\n print(l[i+1],end=\" \")\r\nprint(\"\")\r\n", "\r\n\r\n\r\ndef get_notes(dict, lecture):\r\n result = list()\r\n for s in lecture:\r\n if len(dict[s]) >= len(s):\r\n result.append(s)\r\n else:\r\n result.append(dict[s])\r\n return ' '.join(result)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n_m = [int(i) for i in input().split()]\r\n dict = dict()\r\n for i in range(n_m[1]):\r\n ws = [i for i in input().split()]\r\n dict[ws[0]] = ws[1]\r\n lecture = [i for i in input().split()]\r\n print(get_notes(dict, lecture))\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n a,b=map(str,input().split())\r\n if len(a)<=len(b):\r\n d[a],d[b]=a,a\r\n else:\r\n d[a],d[b]=b,b\r\narr=list(input().split())\r\nfor x in arr:\r\n print(d[x],end=\" \")", "n,m=map(int,input().split())\r\nlang={}\r\nfor _ in range(m):\r\n\tfirst,second=input().split()\r\n\t#print(\"hey\")\r\n\tif len(first) <= len(second):\r\n\t\t# shorter one will become the key\r\n\t\tlang[first]=second\r\n\telse:\r\n\t\tlang[second]=first\r\n#print(lang)\r\nstring=input().split()\r\n#print(string)\r\nkey_list = list(lang.keys())\r\nval_list = list(lang.values())\r\nfor idx in range(len(string)):\r\n\tif key_list.count(string[idx])== 0:\r\n\t\t#print(string[idx],' ',idx)\r\n\t\tind=val_list.index(string[idx])\r\n\t\tval=key_list[ind]\r\n\t\tstring.remove(string[idx])\r\n\t\tstring.insert(idx,val)\r\nprint(' '.join(string))", "n, m=map(int, input().split())\nslo=dict()\nfor i in range(m):\n a, d=input().split()\n slo[a] = d\nslox=list(input().split(' '))\n\nfor word in slox:\n sss = slo[word]\n if len(word)<=len(sss):\n print(word, end = ' ')\n else:\n print(sss, end = ' ')\n# Thu Jul 07 2022 10:52:31 GMT+0000 (Coordinated Universal Time)\n", "n,m = map(int, input().split())\r\na,b = [],[]\r\nfor _ in range(m):\r\n tmp = input().split()\r\n a.append(tmp[0])\r\n b.append(tmp[1])\r\n\r\nlecture = list(input().split())\r\nfor word in lecture:\r\n if word in a:\r\n tmp = a.index(word)\r\n else:\r\n tmp = b.index(word)\r\n\r\n if len(a[tmp])>len(b[tmp]):\r\n print(b[tmp],end=' ')\r\n else:\r\n print(a[tmp],end=' ')\r\n", "n,m = list(map(int,input().split()))\nch = {}\nfor x in range(m) :\n a,b = input().split()\n if len(b) < len(a) :\n ch[a] = b\n\nc = input().split()\n\nfor y in range(len(c)):\n if c[y] in ch.keys() :\n c[y] = ch[c[y]]\n\nprint (\" \".join(c))\n", "import math\r\nimport sys\r\nimport re\r\n\r\n\r\nn , m = map(int , input().rstrip().split())\r\nl = {}\r\nfor x in range(m):\r\n x = list(input().rstrip().split())\r\n if x[0] not in l:\r\n l[x[0]] = x[1]\r\nl1 = list(input().rstrip().split())\r\nl2 = []\r\nfor y in l1:\r\n if len(y) > len(l[y]):\r\n l2.append(l[y])\r\n else:\r\n l2.append(y)\r\nprint(' '.join(l2))", "while True:\r\n try:\r\n li=input().split()\r\n n=int(li[0])\r\n m=int(li[1])\r\n lia=[]\r\n lib=[]\r\n for i in range(0,m):\r\n li1=input().split()\r\n lia.append(li1[0])\r\n lib.append(li1[1])\r\n lio=input().split()\r\n for i in range(0,len(lio)):\r\n for j in range(0,len(lia)):\r\n if(lio[i]==lia[j]):\r\n lio[i]=lia[j] if len(lia[j])<=len(lib[j]) else lib[j]\r\n for i in range(0,len(lio)):\r\n print(lio[i],end=\" \")\r\n\r\n\r\n\r\n except EOFError:\r\n break\r\n", "total,words = map(int,input().split())\r\nd = {}\r\nfor i in range(words):\r\n first,second = map(str,input().split())\r\n d[first] = second\r\ns = input()\r\ns = s.split()\r\nans = \"\"\r\nfor i in s:\r\n if len(i) <= len(d[i]):\r\n ans += i\r\n ans += \" \"\r\n if len(i) > len(d[i]):\r\n ans += d[i]\r\n ans +=\" \"\r\nans = ans.rstrip()\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nwords = dict()\r\nfor i in range(m):\r\n w1, w2 = input().split()\r\n if len(w1) > len(w2):\r\n words[w1] = w2\r\n words[w2] = w2\r\n else:\r\n words[w1] = w1\r\n words[w2] = w1\r\n\r\nlectureWords = input().split()\r\nfor word in lectureWords:\r\n print(words[word], end=' ')\r\n", "n, m = map(int, input().split())\nh = {}\nfor _ in range(m):\n k, v = input().split()\n h[k] = v if len(v) < len(k) else k\na = input().split()\nfor i in range(n):\n a[i] = h[a[i]]\nprint(' '.join(a))", "m,n = str(input()).split()\r\nm,n = int(m),int(n)\r\nword = {}\r\nword_new = dict(zip(word.values(),word.keys()))\r\nfor i in range(n):\r\n a,b = str(input()).split()\r\n word[a] = b\r\nlec = str(input()).split()\r\nfor i in lec:\r\n if i in word.keys():\r\n if len(i) <= len(word[i]):\r\n if lec.index(i) < len(lec) - 1:\r\n print(i,end=' ')\r\n else:\r\n print(i)\r\n else:\r\n if lec.index(i) < len(lec) - 1:\r\n print(word[i],end=' ')\r\n else:\r\n print(word[i])\r\n else:\r\n if len(i) <= len(word_new[i]):\r\n if lec.index(i) < len(lec) - 1:\r\n print(i,end=' ')\r\n else:\r\n print(i)\r\n else:\r\n if lec.index(i) < len(lec) - 1:\r\n print(word_new[i],end=' ')\r\n else:\r\n print(word_new[i])\r\n", "translate = {}\r\noutput = \"\"\r\nfor _ in range(int(input().split()[1])):\r\n inp = input().split()\r\n translate[inp[0]] = inp[1]\r\nfor i in input().split():\r\n if len(translate[i]) < len(i):\r\n output += translate[i]\r\n else:\r\n output += i\r\n output += \" \"\r\nprint(output.strip())", "dic={}\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n a,b=input().split()\r\n dic[b]=a\r\n dic[a]=b\r\nls=[]\r\nm = input().split()\r\nfor i in range(len(m)):\r\n if len(m[i])>len(dic[m[i]]):\r\n ls.append(dic[m[i]])\r\n else:\r\n ls.append(m[i])\r\n\r\nprint(*ls)", "(n,m)=(int(i) for i in input().split())\r\nd={}\r\nfor i in range(m):\r\n (k,v)=(x for x in input().split())\r\n d.update({k:v})\r\ninv={v:k for k,v in d.items()}\r\nl=[i for i in input().split()]\r\nfor i in l: \r\n if i in d.keys():\r\n if(len(i) <= len(d[i])):\r\n print(i,end=\" \")\r\n else:\r\n print(d[i],end=\" \")\r\n if i in inv.keys():\r\n if i in inv.keys():\r\n if(len(i) <= len(inv[i])):\r\n print(i,end=\" \")\r\n else:\r\n print(inv[i],end=\" \")\r\n \r\n\r\n", "n, m = map(int, input().split())\nd = {}\nfor i in range(m):\n s = input().split()\n if len(s[1]) < len(s[0]):\n d[s[0]] = s[1]\n else:\n d[s[0]] = s[0]\nl = input().split()\nfor i in range(len(l)):\n print(d[l[i]], end='')\n if i < len(l) - 1:\n print(' ', end='')\n else:\n print()", "n,m = map(int, input().split())\r\n\r\nlan1 = []\r\nlan2 = []\r\n\r\nfor i in range(m):\r\n x,y = map(str, input().split())\r\n lan1.append(x)\r\n lan2.append(y)\r\n\r\nspeech = list(map(str, input().split()))\r\n\r\nnotes = []\r\n\r\nfor i in range(n):\r\n if len(speech[i]) <= len(lan2[lan1.index(speech[i])]):\r\n notes.append(speech[i])\r\n else:\r\n notes.append(lan2[lan1.index(speech[i])])\r\n\r\n\r\nprint(*notes)", "n,m=[int(x) for x in input().split()]\r\ndict1={}\r\nfor _ in range(m):\r\n\tx,y=input().split()\r\n\tif(len(x)<=len(y)):\r\n\t\tdict1[x]=x\r\n\t\tdict1[y]=x\r\n\telse:\r\n\t\tdict1[x]=y\r\n\t\tdict1[y]=y\r\nx=list(input().split())\r\nans=[]\r\nfor i in x:\r\n\tans.append(dict1[i])\r\nprint(\" \".join(ans))", "import math\r\ndef get():\r\n return list(map(int, input().split()))\r\ndef intput():\r\n return int(input())\r\ndef bfs(x,n):\r\n if (x[n]!=0):\r\n bfs(x,x[n])\r\n print(n, end=' ')\r\ndef expo(n,p):\r\n res=1\r\n b=p\r\n while b>0:\r\n if (b&1):\r\n res=res*n\r\n n=n*n\r\n b>>=1\r\n return res\r\ndef main():\r\n n=get()\r\n p=0\r\n dic=dict()\r\n for i in range(n[1]):\r\n w=input().split()\r\n if (len(w[0])==len(w[1])):\r\n dic[w[0]]=w[0]\r\n else:\r\n dic[w[0]]=min(w[1],w[0],key=len)\r\n arr=''\r\n for i in input().split():\r\n arr= arr+dic[i]+' '\r\n print(arr[:-1])\r\n\r\n\r\nmain()", "dictt = {}\nn,m = list(map(int, input().split()))\nfor i in range(m):\n s = input().split()\n dictt[s[0]] = s[1]\ngst = input().split()\nmst = []\nfor i in range(n):\n if gst[i] in dictt.keys():\n len1 = len(gst[i])\n len2 = len(dictt[gst[i]])\n if len1 == len2 or len1<len2 :\n print(gst[i], end=\" \")\n else:\n print(dictt[gst[i]], end=\" \")\n", "a, b = map(int, input().split())\r\nc1 = []\r\nc2 = []\r\nk = ''\r\nfor i in range(b):\r\n x, y = map(str, input().split())\r\n c1 += [x]\r\n c2 += [y]\r\n\r\ng = list(input().split())\r\n\r\nfor i in g:\r\n n1 = c1.index(i)\r\n if len(c1[n1]) > len(c2[n1]):\r\n k = k + ' ' + c2[n1]\r\n else:\r\n k = k + ' ' + c1[n1]\r\nprint(k)", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\nfrom itertools import * \r\nfrom queue import * \r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn,m = get_int()\r\ndic = {}\r\nfor i in range(m):\r\n st = str_arr()\r\n dic[st[0]] = st[1]\r\ns = list(str(input()).split(' '))\r\n\r\nfor i in s:\r\n if len(dic[i]) < len(i):\r\n print(dic[i],end = ' ')\r\n elif len(dic[i]) > len(i):\r\n print(i,end = ' ')\r\n else:\r\n print(i,end = ' ')\r\n", "l=input().split()\r\na=[]\r\nb=[]\r\nfor i in range (int(l[1])):\r\n m=input().split()\r\n a.append(m[0])\r\n b.append(m[1])\r\ns=input().split()\r\nans=[]\r\nfor i in range (int(l[0])):\r\n index=a.index(s[i])\r\n if len(a[index])<=len(b[index]):\r\n ans.append(a[index])\r\n else:\r\n ans.append(b[index])\r\nprint(' '.join(ans))", "a, b = list(map(int, input().split()))\r\nlst = {}\r\nfor i in range(b):\r\n c, d = list(map(str, input().split()))\r\n lst[c] = [c, d, len(c), len(d)]\r\nans = list(map(str, input().split()))\r\nanss = ''\r\nfor i in ans:\r\n w, x, y, z = lst[i]\r\n if y <= z:\r\n anss += w + ' '\r\n else:\r\n anss += x + ' '\r\nprint(anss)", "n,m =map(int,input().split()) \r\n\r\nd = {}\r\n\r\n\r\nfor i in range(m):\r\n a,b = map(str,input().split())\r\n\r\n d [a] = b\r\n \r\n\r\nc = list(map(str,input().split())) \r\n\r\n\r\nfor i in c:\r\n y = d[i]\r\n \r\n if len(y)<len(i):\r\n print(y,end = ' ')\r\n else:\r\n print(i,end = ' ')", "import sys\r\ndef fn(n,m,l,a):\r\n k=0\r\n x = dict()\r\n for i in range(m):\r\n if len(l[k])>len(l[k+1]) :\r\n x[l[k]]= l[k+1]\r\n k = k+2\r\n else :\r\n x[l[k]]= l[k]\r\n k =k+2\r\n \r\n out = \"\"\r\n for i in range(n):\r\n out = str(out) + \" \" + str(x[a[i]])\r\n return out\r\n\r\nif __name__ == '__main__':\r\n input = sys.stdin.read()\r\n data = list(map(str, input.split()))\r\n n = int(data[0])\r\n m = int(data[1])\r\n l = data[2:2*m+2]\r\n a = data[2*m+2:]\r\n print(fn(n,m,l,a))", "m,n=map(int,input().split())\r\nf={}\r\nfor i in range(n):\r\n a,b=input().split()\r\n f[a]=b\r\ng=list(input().split())\r\ne=''\r\nfor g1 in g:\r\n if len(g1)<=len(f[g1]):\r\n e+=g1\r\n e+=' '\r\n elif len(g1)>len(f[g1]):\r\n e+=f[g1]\r\n e+=' '\r\nprint(e)", "n,m=list(map(int,input().split()))\r\ndct=dict()\r\nfor _ in range(m):\r\n a,b=list(input().split())\r\n if len(a)<len(b):\r\n dct[b]=a\r\n elif len(a)>len(b):\r\n dct[a]=b\r\n else:\r\n dct[b]=[a]\r\nc=list(input().split())\r\nans=[]\r\nfor i in c:\r\n if i in dct:\r\n ans.append(dct[i])\r\n else:\r\n ans.append(i)\r\nprint(' '.join(ans))", "def solve():\r\n n, m = map(int, input().split())\r\n d = {}\r\n for i in range(m):\r\n a, b = map(str, input().split())\r\n d[a] = b\r\n s = list(map(str, input().split()))\r\n for i in range(n):\r\n x = d[s[i]]\r\n if len(s[i])>len(x):\r\n s[i]=x\r\n print(*s)\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "n,m=map(int,input().split(\" \"))\r\na=[]\r\nb=[]\r\nans=[]\r\nfor i in range(m):\r\n x,y=map(str,input().split(\" \"))\r\n a.append(x)\r\n b.append(y)\r\ntext=list(map(str,input().split(\" \")))\r\nfor i in text:\r\n c=a.index(i)\r\n if(len(b[c])>=len(i)):\r\n ans.append(i)\r\n else:\r\n ans.append(b[c])\r\nprint(\" \".join(ans))", "n, m = map(int,input().split())\r\na = []\r\nfor i in range(m):\r\n f, s = input().split()\r\n a.append(f)\r\n a.append(s)\r\nk = 0\r\nlc = list(input().split())\r\nfor i in lc:\r\n k = a.index(i)\r\n if len(a[k])>len(a[k+1]):\r\n print(a[k+1],end = ' ')\r\n else:\r\n print(a[k],end = ' ')\r\n \r\n ", "n, m = map(int, input().split())\r\nwords = []\r\nfor i in range(m):\r\n\tlang1, lang2 = input().split()\r\n\twords.append(lang1)\r\n\twords.append(lang2)\r\nc = list(input().split())\r\nans = []\r\nfor word in c:\r\n\tif len(word) > len(words[words.index(word) + 1]):\r\n\t\tans.append(words[words.index(word) + 1])\r\n\telse:\r\n\t\tans.append(word)\r\nprint(*ans)\r\n\t\r\n\t\r\n\t\t\r\n\t\t\r\n\t\r\n", "from math import *\r\nfrom itertools import *\r\nm,n=map(int, input().split())\r\nlst=[]\r\nlst1=[]\r\nlst2=[]\r\nfor _ in range(n):\r\n asd,asdf=input().split()\r\n lst1.append(asd)\r\n lst2.append(asdf)\r\n \r\narr=list(map(str,input().split()))\r\n\r\ncount=0\r\nfor i in range(m):\r\n index=lst1.index(arr[i])\r\n if len(lst1[index])<=len(lst2[index]):\r\n print(lst1[index],end=\" \")\r\n else:\r\n print(lst2[index],end=\" \")\r\n\r\n\r\n", "def simplify_text(spoken_words,text):\r\n for i in range(len(text)):\r\n try: text[i] = spoken_words[text[i]]\r\n except: continue\r\n\r\n return ' '.join(text)\r\n\r\nif __name__ == \"__main__\":\r\n\r\n n,m = map(int,input().split())\r\n spoken_words = dict()\r\n\r\n for _ in range(m):\r\n a,b = input().split()\r\n\r\n if len(a) <= len(b): spoken_words[b] = a\r\n else: spoken_words[a] = b\r\n \r\n text = [str(word) for word in input().split()]\r\n\r\n result = simplify_text(spoken_words,text)\r\n print (result)\r\n", "n, m=[int(j) for j in input().split()]\r\nsigma={}\r\nfor i in range(m):\r\n x, y=input().split()\r\n if len(x)>len(y):\r\n sigma[x]=y\r\nc=input().split()\r\nres=[]\r\nfor i in c:\r\n res.append(sigma.get(i, i))\r\nprint(\" \".join(res))", "n,m = map(int,input().split())\r\nlst = []\r\nfor i in range(m):\r\n lst.append(input().split())\r\n\r\nai = list(map(str,input().split()))\r\nfor i in ai:\r\n for j in lst:\r\n if i in j:\r\n if len(j[0]) > len(j[1]):\r\n print(j[1],end=' ')\r\n elif len(j[1]) > len(j[0]):\r\n print(j[0],end=' ')\r\n else:\r\n print(j[0],end=' ')\r\n", "n,k=map(int,input().split())\r\nd={}\r\nfor i in range(k):\r\n x,y=input().split()\r\n d[x]=y\r\nl=input().split()\r\nfor i in l:\r\n if len(d[i])==len(i):\r\n print(i,end=\" \")\r\n elif len(d[i])>len(i):\r\n print(i,end=\" \")\r\n else:\r\n print(d[i],end=\" \")", "l = []\r\nres = []\r\nn , m = map(int,input().split())\r\nfor i in range (m):\r\n a,b = input().split()\r\n l.append(a)\r\n l.append(b)\r\nw = list(map(str,input().split()))\r\nfor j in range(len(w)):\r\n indx = l.index(w[j])\r\n if len(l[indx]) < len(l[indx+1]):\r\n res.append(l[indx])\r\n elif len(l[indx]) > len(l[indx+1]):\r\n res.append(l[indx+1])\r\n else :\r\n res.append(l[indx])\r\nfor i in (res):\r\n print(i,' ',end=\"\")", "from sys import stdin\r\nfrom collections import defaultdict\r\ninput=lambda:stdin.readline().strip()\r\na,b=list(map(int,input().split()))\r\ndict1=defaultdict()\r\nfor _ in range(b):\r\n c,d=input().split()\r\n if len(d)<len(c):\r\n dict1[c]=d\r\n else:\r\n dict1[c]=c\r\ns=input().split()\r\nfor i in s:\r\n print(dict1[i],end=' ')\r\nprint()\r\n", "m,n=map(int,input().split())\r\nd={}\r\nfor _ in range(n):\r\n s1,s2=map(str,input().split())\r\n if len(s1)==len(s2):\r\n d[s1]=s1 \r\n elif len(s1)>len(s2):\r\n d[s1]=s2 \r\n else:\r\n d[s1]=s1 \r\nl=list(map(str,input().split()))\r\nfor i in l:\r\n print(d[i],end=' ')", "n, m = map(int, input().split(\" \"))\r\ngraph = dict()\r\nfor i in range(m):\r\n s1, s2 = map(str, input().split(\" \"))\r\n graph[s1] = s2\r\n\r\ns = list(input().split(\" \"))\r\n\r\nfor i in range(len(s)):\r\n if len(s[i]) > len(graph[s[i]]):\r\n s[i] = graph[s[i]]\r\n\r\nprint(\" \".join(s))", "n, m = tuple (map (int, input ().split (' ')))\r\ndictionary = {}\r\nfor i in range (m):\r\n a, b = tuple (input ().split (' '))\r\n if len (b) < len (a):\r\n dictionary [a] = b\r\n else:\r\n dictionary [a] = a\r\narray = input ().split (' ')\r\nfor i in range (n):\r\n array [i] = dictionary [array [i]]\r\nprint (' '.join (array))", "n, m = map(int, input().split())\r\nrefer = {}\r\nfor i in range(m):\r\n f, s = input().split()\r\n if len(s)<len(f):\r\n refer[f] = s\r\n else:\r\n refer[f] = f\r\nif n==1:\r\n sen = [input()]\r\nelse:\r\n sen = input().split()\r\nnotes = []\r\nfor word in sen:\r\n notes.append(refer[word])\r\nprint(*notes)\r\n", "\r\nN, K = list(map(int, input().split(\" \")))\r\nA = {}\r\nfor i in range(K):\r\n X, Y = input().split(\" \")\r\n x = len(X)\r\n y = len(Y)\r\n if x <= y:\r\n A[X] = X\r\n A[Y] = X\r\n else:\r\n A[X] = Y\r\n A[Y] = Y\r\nS = input().split(\" \")\r\nfor i in range(N):\r\n S[i] = A[S[i]]\r\nprint(\" \".join(S))", "n, m = [int(i) for i in input().split()]\r\na = {}\r\nfor i in range(m):\r\n s, s1 = input().split()\r\n if len(s1) < len(s):\r\n a[s] = s1\r\n else:\r\n a[s] = 0\r\nl = input().split()\r\nnw = []\r\nfor i in l:\r\n if a[i] != 0:\r\n nw.append(a[i])\r\n else:\r\n nw.append(i)\r\nprint(*nw)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nwords = {}\r\nz = []\r\nnew_words = []\r\nlecture = []\r\nnew_lecture = []\r\nh = \"\"\r\nfor index in range(m+1):\r\n if index == (m):\r\n lecture = input().split()\r\n else:\r\n word = input().split()\r\n words[word[0]] = word[1]\r\n z.append(word[0])\r\n\r\nfor index in range(len(z)):\r\n if len(words[z[index]]) < len(z[index]):\r\n new_words.append(words[z[index]])\r\n else:\r\n new_words.append(z[index])\r\n\r\nfor index in range(len(lecture)):\r\n for index2 in range(len(z)):\r\n if lecture[index] == z[index2]:\r\n if len(words[z[index2]]) < len(z[index2]):\r\n new_lecture.append(words[z[index2]])\r\n else:\r\n new_lecture.append(z[index2])\r\nfor index in range(len(new_lecture)):\r\n h = h + \" \" + new_lecture[index]\r\n\r\nprint(h[1:])", "a,b=[int(i) for i in input().split()]\r\ndic={}\r\nfor i in range(0,b):\r\n x,y=input().split()\r\n if len(x) <= len(y):\r\n dic[y]=x\r\n dic[x]=x\r\n else:\r\n dic[y]=y\r\n dic[x]=y\r\nfor i in input().split():\r\n print(dic[i],end=' ')\r\n", "from sys import stdin \n\nn, m = list(map(int, stdin.readline().split()))\nconversions = {}\n\nfor _ in range(m):\n w1, w2 = stdin.readline().split()\n conversions[w1] = w2 \n\nlecture = stdin.readline()\n\nfor word in lecture.split():\n if len(word) <= len(conversions[word]):\n print(word, end = ' ')\n else:\n print(conversions[word], end = ' ')\nprint()", "n, m = map(int,input().split())\r\ndic = {}\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n if a not in dic:\r\n dic[a] = b\r\n \r\nspeach = list(input().split())\r\nans = []\r\nfor word in speach:\r\n if len(word) <= len(dic[word]):\r\n ans.append(word)\r\n else:\r\n ans.append(dic[word])\r\n \r\nprint(*ans)\r\n ", "\r\n\r\nn,m = map(int,input().split())\r\n\r\ndic = {}\r\nwhile m:\r\n a,b = map(str,input().split())\r\n dic[a] = (a,b)\r\n m -= 1\r\n\r\nlst = list(map(str,input().split()))\r\nans = []\r\nfor i in lst:\r\n if len(i)==len(dic[i][1]):\r\n ans.append(i)\r\n elif len(i)<len(dic[i][1]):\r\n ans.append(i)\r\n else:\r\n ans.append(dic[i][1])\r\n\r\nprint(*ans)\r\n", "d={}\r\nn,m=list(map(int,input().split()))\r\nfor _ in range(m):\r\n a,b=input().split()\r\n if len(b)==max(len(a),len(b)):\r\n d[b]=a\r\n else:\r\n d[a]=b;\r\nc=input().split()\r\nfor s in c:\r\n print(d[s] if s in d else s,end=\" \")", "\r\nn,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n la=len(a)\r\n lb=len(b)\r\n if(la<=lb):\r\n d.update({a:a})\r\n else:\r\n d.update({a:b})\r\ns=input()\r\nls=s.split()\r\nna=[]\r\nfor i in ls:\r\n print(d[i],end=\" \")\r\nprint() \r\n ", "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\ndef solve():pass\r\n\r\n# for _ in range(int(input())):\r\nn,m = get_int()\r\nmat = []\r\nind = dict()\r\n\r\nfor i in range(m):\r\n a,b = get_str()\r\n mat.append([a,b])\r\n ind[a] = i;ind[b] = i\r\n\r\ns = str(input())\r\nlis = [i for i in s.split()]\r\nout = ''\r\nfor i in range(len(lis)):\r\n st = lis[i]\r\n ii = ind[st]\r\n if len(mat[ii][0]) == len(mat[ii][1]):\r\n out += mat[ii][0] + \" \"\r\n elif len(mat[ii][0]) > len(mat[ii][1]):\r\n out += mat[ii][1] + \" \"\r\n else:\r\n out += mat[ii][0] + \" \"\r\nprint(out)\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\r\nli = []\r\nfor i in range(m):\r\n a = input().split()\r\n if len(a[0]) > len(a[1]):\r\n a.append(a[1])\r\n else:\r\n a.append(a[0])\r\n li.append(a)\r\ns = input().split()\r\nfor i in range(n):\r\n for j in range(m):\r\n if s[i] == li[j][0] or s[i] == li[j][1]:\r\n s[i] = li[j][2]\r\nprint(' '.join(s))", "from collections import defaultdict\r\n#from colections import Counter\r\ndef solution():\r\n dictionary = defaultdict(str)\r\n n,m = map(int,input().split())\r\n for _ in range(m):\r\n w1,w2 = input().split()\r\n dictionary[w1] = w2\r\n lecture = list(input().split())\r\n for i in range(n):\r\n word = lecture[i]\r\n converted_word = dictionary[lecture[i]]\r\n if len(converted_word)<len(word):\r\n lecture[i] = converted_word\r\n print(' '.join(lecture))\r\nif __name__=='__main__':\r\n solution()", "a=list(map(int,input().split()))\r\ns=[]\r\nans=[]\r\nanswer=[]\r\nfor i in range(a[1]):\r\n l=s.append(list(map(str,input().split())))\r\ncheck=list(map(str,input().split()))\r\nfor i in check:\r\n for j in range(len(s)):\r\n for z in range(2):\r\n if i == s[j][z]:\r\n ans.append(j) \r\nfor i in ans:\r\n n1=len(s[i][0])\r\n n2=len(s[i][1])\r\n if n1<=n2:\r\n answer.append(s[i][0])\r\n else:\r\n answer.append(s[i][1]) \r\nprint(\" \".join(answer))", "n, m = map(int, input().split())\r\nlist_a = []\r\nlist_b = []\r\n\r\nfor i in range(m):\r\n a, b = map(str, input().split())\r\n list_a.append(a)\r\n list_b.append(b)\r\n\r\nlist_name = list(map(str, input().split()))\r\n\r\n\r\nfor i in list_name:\r\n if i in list_a:\r\n index = list_a.index(i)\r\n if len(list_a[index]) <= len(list_b[index]):\r\n print(list_a[index], end = \" \") \r\n else:\r\n print(list_b[index], end = \" \")\r\n if i in list_b:\r\n index = list_b.index(i)\r\n if len(list_a[index]) <= len(list_b[index]):\r\n print(list_a[index], end = \" \")\r\n else:\r\n print(list_b[index], end = \" \")", "x,y=input().split()\r\nx=int(x)\r\ny=int(y)\r\nword={}\r\nfor i in range(y):\r\n\ta,b=input().split()\r\n\tif len(a)>len(b):\r\n\t\tv=a\r\n\t\tp=b\r\n\t\tb=v\r\n\t\ta=p\r\n\tword[a]=a\r\n\tword[b]=a\r\nsent=input().split()\r\nsent1=''\r\nfor i in sent:\r\n\tsent1+=word[i]+' '\r\nprint(sent1.strip())\r\n\t\r\n\t\r\n\t\t\r\n\t\r\n\t\r\n\r\n\r\n", "from collections import Counter, defaultdict\r\n\r\nBS=\"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\nfrom math import floor, ceil,pi\r\n\r\n\r\nn,m = list(map(int, input().split()))\r\nd = {}\r\nfor l in range(m):\r\n a,b = input().split()\r\n d[a] = b\r\n\r\nfor word in input().split():\r\n print(min(word, d[word], key=lambda x: len(x)), end=\" \")\r\n", "import math\r\nt,t1=map(int,input().split())\r\nb=[]\r\nb1=[]\r\nfor s in range(t1):\r\n u=[r for r in input().split()]\r\n b1.extend(u)\r\n if len(u[0])<=len(u[1]):\r\n b.extend(u)\r\n else:\r\n u[0],u[1]=u[1],u[0]\r\n b.extend(u)\r\no=[i for i in input().split()]\r\nl=[]\r\nfor t33 in o:\r\n l.append(b[math.ceil((b1.index(t33)+1)/2)*2-2])\r\nprint(' '.join(l))", "def func(C,arr,n,m):\r\n i=0\r\n d={}\r\n for i in arr:\r\n d[i[0]]=i[1]\r\n \r\n for i in C:\r\n if len(i)<=len(d[i]):\r\n print(i,end=' ')\r\n else:\r\n print(d[i],end=' ')\r\n \r\n\r\n\r\nn,m=map(int,input().split())\r\narr=[]\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n arr.append([a,b])\r\n\r\nC=list(map(str,input().split()))\r\nfunc(C,arr,n,m)\r\n", "n, m = map(int, input().split())\r\nf_to_s = {}\r\ns_to_f = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n f_to_s[a] = b\r\n s_to_f[b] = a\r\nmessage = input().split()\r\ntetrad = []\r\nfor i in message:\r\n if i in f_to_s:\r\n f = f_to_s[i]\r\n s = s_to_f[f]\r\n else:\r\n s = s_to_f[i]\r\n f = f_to_s[s]\r\n tetrad.append([f, s][len(f) >= len(s)])\r\nprint(\" \".join(tetrad))\r\n", "X,Y = map(int,input().rstrip().split())\r\nA = []\r\nB = []\r\nfor i in range(Y):\r\n x = input()\r\n l = x.split(\" \")\r\n A.append(l[0])\r\n B.append(l[1])\r\n \r\ns = input()\r\nl = s.split(\" \")\r\nres = []\r\nfor i in l:\r\n ind = A.index(i)\r\n j = B[ind]\r\n if len(i) <= len(j):\r\n res.append(i)\r\n else:\r\n res.append(j)\r\nreslt = \" \".join(res)\r\nprint(reslt)\r\n \r\n ", "n,m = [int(x) for x in input().split()]\r\na = {}\r\nfor i in range(m):\r\n word1, word2 = input().split()\r\n if len(word2)<len(word1):\r\n a[word1] = word2\r\n else:\r\n a[word1] = word1\r\nwords = input().split()\r\noutput = []\r\nfor word in words:\r\n output.append(a[word])\r\nprint(\" \".join(output))\r\n", "n,m=list(map(int,input().split()))\r\nd={}\r\nfor i in range(m):\r\n a=input().split()\r\n if(len(a[0])>len(a[1])):\r\n d[a[0]]=a[1]\r\n else:\r\n d[a[0]]=a[0]\r\nn1=input().split()\r\nfor i in n1:\r\n print(d[i],end=\" \")\r\nprint()\r\n", "# Read input\r\nn, m = map(int, input().split())\r\nlanguage1_to_language2 = {}\r\nlanguage2_to_language1 = {}\r\n\r\nfor i in range(m):\r\n word1, word2 = input().split()\r\n language1_to_language2[word1] = word2\r\n language2_to_language1[word2] = word1\r\n\r\nlecture_words = input().split()\r\n\r\n# Translate the lecture words and print the result\r\ntranslated_lecture = [language1_to_language2[word] if word in language1_to_language2 and len(word) > len(language1_to_language2[word]) else word for word in lecture_words]\r\n\r\nprint(\" \".join(translated_lecture))\r\n", "n, m = map(int, input().split())\nd = {}\nfor _ in range(m):\n\tx =list(input().split())\n\td[x[0]] = x[1]\nlst = list(input().split())\nfor i in lst:\n\tif len(i) <= len(d[i]):\n\t\tprint(i, end=\" \")\n\telse:\n\t\tprint(d[i], end=\" \")\n \t\t \t \t \t\t \t \t\t \t \t\t\t\t\t", "import math\r\n\r\n\r\n# -------- info --------\r\n\r\n# https://codeforces.com/profile/Wolxy\r\n\r\n# -------- solve --------\r\n\r\ndef solve() -> None:\r\n n, m = map(int, input().split(' '))\r\n dic = dict()\r\n for i in range(m):\r\n first, second = input().split(' ')\r\n dic[first] = second if len(first) > len(second) else first\r\n words = list(input().split(' '))\r\n for word in words:\r\n print(dic[word], end=' ')\r\n print()\r\n\r\n# -------- main --------\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\nfor _ in range(T):\r\n solve()\r\n", "import math\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n d = {}\r\n for i in range(m):\r\n k, v = input().split()\r\n d[k] = v\r\n words = input().split()\r\n answer = \"\"\r\n for word in words:\r\n if len(d[word]) < len(word):\r\n answer += d[word] + \" \"\r\n else:\r\n answer += word + \" \"\r\n\r\n return answer\r\n\r\n\r\nif __name__ == '__main__':\r\n print(solve())\r\n", "a,b=map(int,input().split())\r\nfl,sl=[],[]\r\nfor _ in range(b):\r\n c,d=map(str,input().split())\r\n fl.append(c)\r\n sl.append(d)\r\nf=list(map(str,input().split()))\r\nans=[]\r\nfor _ in range(len(f)):\r\n ind=fl.index(f[_])\r\n if(len(f[_])<=len(sl[ind])):\r\n # continue\r\n ans.append(f[_])\r\n else:\r\n ans.append(sl[ind])\r\n\r\nprint(' '.join(ans))\r\n\r\n# CodeBy: RAHUL MAHAJAN\r\n# A2OJ: rahulmahajan\r\n# CC: anonymous0201\r\n# CF: rahulmahajan\r\n# CSES: rahulmahajan", "inl = lambda: list(map(int, input().split()))\r\n\r\nans = dict()\r\nn, m = inl()\r\nfor _ in range(m):\r\n a, b = input().split()\r\n ans[a] = [a, b][len(b) < len(a)]\r\n\r\nfor word in input().split():\r\n print(ans[word], end=\" \")\r\n ", "n,m=list(map(int,input().split()))\r\nwordlist={}\r\nanswer=[]\r\nfor t in range(m):\r\n a,b=input().split()\r\n if len(b)<len(a):\r\n wordlist[a]=b\r\n else:\r\n wordlist[a]=a\r\nlecture=input().split()\r\nfor word in lecture:\r\n answer.append(wordlist[word])\r\n\r\nprint(' '.join(answer))", "A=list(map(int, input().split()))\r\nn=A[0]\r\nm=A[1]\r\nB=[]\r\nC=[]\r\ns=''\r\nfor i in range(m):\r\n N=list(input().split())\r\n if len(N[1])<len(N[0]):\r\n B+=[N[1]]\r\n B+=[N[0]]\r\n else:\r\n B+=[N[0]]\r\n B+=[N[1]]\r\nC+=input().split()\r\nfor i in range(1,m*2,2):\r\n while B[i] in C:\r\n C[C.index(B[i])] = B[i-1]\r\nfor x in C:\r\n s+=str(x)+' '\r\nprint(s)\r\n", "i = input()\r\nn, m, iterations = 0, 0, 0\r\ns = \"\"\r\ndict = {}\r\nfor l in i:\r\n s += l\r\n if l == \" \":\r\n n = int(s)\r\n s = \"\"\r\nm = int(s)\r\ns = \"\"\r\nwhile iterations < m:\r\n i = input()\r\n for l2 in range(len(i)):\r\n if i[l2] == \" \":\r\n if len(i[0: l2]) <= len(i[(l2 + 1):]):\r\n dict[i[:l2]] = i[:l2]\r\n else:\r\n dict[i[:l2]] = i[(l2 + 1):]\r\n iterations += 1\r\n\r\nans = \"\"\r\nwords = input()\r\nfor l3 in words:\r\n if l3 == \" \":\r\n ans += dict[s] + \" \"\r\n s = \"\"\r\n else:\r\n s += l3\r\nans += dict[s]\r\n\r\n\r\nprint(ans)", "n,m=[int(x) for x in input().split()]\r\nd=dict()\r\nfirstlang=[]\r\nfor i in range(m):\r\n x,y=input().split()\r\n d[x]=y\r\n d[y]=x\r\n firstlang.append(x)\r\n#print(firstlang)\r\ns=list(input().split())\r\n#print(s)\r\nfor si in s:\r\n #print(si)\r\n x=d[si]\r\n y=d[x]\r\n #print(\"x=\"+str(x)+\" y=\"+str(y))\r\n if len(x)<len(y):\r\n print(x,end=\" \")\r\n elif len(x)>len(y):\r\n print(y,end=\" \")\r\n else:\r\n if x in firstlang:\r\n print(x,end=\" \")\r\n else:\r\n print(y,end=\" \")\r\n ", "n, m = map(int, input().split())\r\n\r\nlang = {}\r\nfor _ in range(m):\r\n a, b = input().split()\r\n lang[a] = b \r\n\r\nlecture = input().split()\r\nres = []\r\n\r\nfor word in lecture :\r\n sLang = lang[word]\r\n if len(sLang) < len(word):\r\n res.append(sLang)\r\n else: res.append(word)\r\n\r\nprint(\" \".join(res))\r\n ", "import sys\r\ninput=sys.stdin.readline\r\nn,m=map(int,input().split())\r\na_dict={}\r\nfor i in range(m):\r\n f,s=map(str,input().split())\r\n if len(s)<len(f):\r\n a_dict[f]=s\r\n# print(a_dict)\r\nsntnc = list(map(str,input().split()))\r\n# print(sntnc)\r\nfor j in range(n):\r\n if a_dict.get(sntnc[j],'None') != 'None':\r\n sntnc[j]=a_dict[sntnc[j]]\r\nprint(*sntnc)", "n, m = map(int, input().split())\r\ndictionary = {}\r\nfor _ in range(m):\r\n str1, str2 = input().split()\r\n value = str1 if len(str1) <= len(str2) else str2\r\n key = str1 if str2 == value else str2\r\n dictionary[key] = value\r\nlistInput = [_ if _ not in dictionary else dictionary[_] for _ in input().split()]\r\nfor _ in listInput:\r\n print(_, end = \" \")", "n,k = map(int,input().split())\r\na = {}\r\nfor i in range(k):\r\n\tb,c = input().split()\r\n\ta[b] = c\r\nt = input().split()\r\nfor i in t:\r\n\td = len(i)\r\n\te = len(a[i])\r\n\tif d<=e:\r\n\t\tprint(i,end=' ')\r\n\telse :\r\n\t\tprint(a[i],end=' ')\r\nprint()", "n , m = map(int,input().split(' '))\r\nmat_1 = []\r\nmat_2 = []\r\nans = ''\r\nwhile m>0:\r\n m-=1\r\n a,b = map(str,input().split(' '))\r\n mat_1.append(a)\r\n mat_2.append(b)\r\ntext = input().split(' ')\r\nfor i in text:\r\n pos = mat_1.index(i)\r\n if len(i)<len(mat_2[pos]):\r\n ans+=i+' '\r\n elif len(i)>len(mat_2[pos]):\r\n ans+=mat_2[pos]+' '\r\n else:\r\n ans+=i+' '\r\nprint(ans)", "def main():\n N, M = [int(a) for a in input().split()]\n lang_map = {}\n for m in range(M):\n l1, l2 = input().split()\n if len(l1) > len(l2):\n lang_map[l1] = l2\n lang_map[l2] = l2\n else:\n lang_map[l2] = l1\n lang_map[l1] = l1\n ls = input().split()\n ret = [lang_map[l] for l in ls]\n print(' '.join(ret))\n\nif __name__ == '__main__':\n main()", "def solve(n, m , sentence, word):\r\n s = \"\"\r\n for i in sentence:\r\n if(len(i) <= len(word[i])):\r\n s = s + i + \" \"\r\n else:\r\n s = s + word[i] + \" \"\r\n return s\r\n\r\nn, m = map(int, input().split())\r\nword = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n word[a] = b\r\n\r\nsentence = input().split()\r\n\r\nprint(solve(n, m, sentence, word))", "d={}\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n d[a]=b\r\ns=input().split()\r\nfor i in s:\r\n if i in d:\r\n if len(i)<=len(d[i]):\r\n print(i,end=' ')\r\n else:\r\n print(d[i],end=' ')\r\n else:\r\n key=list(d.keys())[list(d.values()).index(i)]\r\n if len(key)<=len(i):\r\n print(key,end=' ')\r\n else:\r\n print(i,end=' ')", "def min(l):\r\n if(l[0]<=l[1]):\r\n return 0\r\n return 1\r\n\r\nn,m=[int(x) for x in input().split()]\r\na=[]\r\nb=[]\r\nfor i in range(m):\r\n p=[]\r\n p=[x for x in input().split()]\r\n l1=len(p[0])\r\n l2=len(p[1])\r\n if l1<=l2:\r\n a.append(p[0])\r\n b.append(p[1])\r\n else:\r\n b.append(p[0])\r\n a.append(p[1])\r\nstr=[]\r\nstr=[x for x in input().split()]\r\nfor x in str:\r\n try:\r\n p=a.index(x)\r\n except:\r\n p=-1\r\n if p==-1:\r\n p=b.index(x)\r\n print(a[p],end=\" \")\r\n else:\r\n print(x,end=\" \")\r\n\r\n\r\n \r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor _ in range(m):\r\n a,b=input().split()\r\n d[a]=b\r\ns=input().split()\r\nrs=\"\"\r\nfor a in s:\r\n b=d[a]\r\n if len(a)<=len(b):\r\n rs=rs+a+\" \"\r\n else:\r\n rs=rs+b+\" \"\r\nprint(rs)", "n,m=map(int,input().split())\r\nd=dict(input().split() for _ in range(m))\r\nw=input().split()\r\nfor i in w:\r\n print(min(i,d[i],key=len),end=' ')", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\nm=l[1]\r\nd={}\r\nfor _ in range(m):\r\n l=input().split()\r\n if len(l[1])<len(l[0]):\r\n d[l[0]]=l[1]\r\n else:\r\n d[l[0]]=l[0]\r\nl=input().split()\r\nfor i in l:\r\n print(d[i],end=\" \")", "import re\r\n\r\nn, m = map(int, input().split())\r\nwords = []\r\n\r\nfor i in range(m):\r\n words.append([i for i in input().split()])\r\nwords = sum(words, [])\r\n\r\ntext = input()\r\nwordList = re.sub(\"[^\\w]\", \" \", text).split()\r\n\r\nfor i in wordList:\r\n x = words.index(i)\r\n\r\n if x % 2 == 1:\r\n print(words[x] if len(words[x]) < len(words[x - 1]) else words[x - 1], end=' ')\r\n else:\r\n print(words[x] if len(words[x]) <= len(words[x + 1]) else words[x + 1], end=' ')\r\n", "n, m = map(int, input().split())\ndictx = dict()\nans = []\nfor i in range(m):\n tuple = input().split()\n dictx[tuple[0]] = min(tuple[0],tuple[1], key=len)\nsentence = input().split()\nfor i in sentence:\n ans.append(dictx[i])\nprint(*ans, sep=\" \")\n\n\n\n\n", "import sys\r\n \r\ndef lecture(words, dictionary):\r\n \r\n res = \"\"\r\n for word in words:\r\n if len(word) > len(dictionary[word]):\r\n res += \" \" + dictionary[word]\r\n else:\r\n res += \" \" + word\r\n \r\n return res\r\n \r\n \r\n \r\nn, m = map(int, sys.stdin.readline().split())\r\ndictionary = {}\r\nfor i in range(m):\r\n key, value = map(str, sys.stdin.readline().split())\r\n dictionary[key] = value\r\nwords = list(map(str, sys.stdin.readline().split()))\r\n \r\nans = lecture(words, dictionary)\r\nprint(ans)", "d=dict()\r\nm,n=[int(i) for i in (input().split())]\r\nwhile n>0:\r\n i1,i2=[i for i in input().split()]\r\n if len(i1)<=len(i2):\r\n d[i1]=i1\r\n else:\r\n d[i1]=i2\r\n n-=1\r\nt=[i for i in input().split()]\r\nfor i in range(m):\r\n t[i]=d[t[i]]\r\nprint(\" \".join(t))", "a,b=[int(i) for i in input().split()]\r\nA={}\r\nfor i in range(b):\r\n s=[i for i in input().split()]\r\n A[s[0]]=[s[0],s[1],len(s[0]),len(s[1])]\r\nfor i in input().split():\r\n s1,s2,n1,n2=A[i]\r\n if n2<n1:\r\n print(s2,end=\" \")\r\n else:\r\n print(s1,end=\" \")", "n,m = list(map(int, input().split()))\r\n\r\nlmap = {} \r\n\r\nfor _ in range(m):\r\n \r\n a,b = input().split()\r\n \r\n if len(a) <= len(b):\r\n lmap[a] = a\r\n lmap[b] = a\r\n else:\r\n lmap[a] = b\r\n lmap[b] = b\r\n \r\nans = []\r\n\r\narr = input().split()\r\n\r\nfor s in arr:\r\n ans.append(lmap[s])\r\n \r\nprint(\" \".join(ans))", "n , m = map(int, input().split())\r\n\r\ntaller = {}\r\n\r\nfor _ in range(m):\r\n\r\n a, b = input().split()\r\n\r\n taller[a] = b \r\n\r\n\r\n\r\n\r\ndd = input().split()\r\n\r\nfor i in range(len(dd)):\r\n if len(dd[i]) <= len(taller.get(dd[i])):\r\n\r\n continue\r\n else:\r\n\r\n dd[i] = taller[dd[i]]\r\nprint(*dd)\r\n", "n,m = map(int,input().split())\r\ndic = {} ; ans = []\r\nfor _ in range(m):\r\n lang = input().split()\r\n if len(lang[1]) >= len(lang[0]):\r\n dic[lang[1]] = lang[0]\r\n else: dic[lang[0]] = lang[1]\r\nfor i in input().split():\r\n if i in dic: ans += [dic[i]]\r\n else: ans += [i]\r\nprint(*ans)", "n, m = map(int, input().split())\r\nd = dict()\r\nfor i in range(m):\r\n\tx, y = input().split()\r\n\td[x] = y\r\n\r\na = [i for i in input().split()]\r\nfor i in a:\r\n\tif len(d[i]) < len(i):\r\n\t\tprint(d[i], end = ' ')\r\n\telse:\r\n\t\tprint(i, end = ' ')", "n, m = [int(i) for i in input().split()]\nd = {}\n\nfor i in range(m):\n w0, w1 = input().split()\n d[w0] = w1\na = input().split()\nfor w in a:\n if len(w) > len(d[w]):\n print(d[w], end=\" \")\n else:\n print(w, end=\" \")\n", "n,m = [int(i) for i in input().split()]\r\nd = {}\r\nfor i in range(m):\r\n l1,l2 = input().split()\r\n if len(l1)>len(l2):\r\n d[l1] = l2\r\n else:\r\n d[l1] = l1\r\nstring = input()\r\nfor word in string.split():\r\n print(d[word], end=\" \")\r\nprint()", "p = dict()\r\nn, m = map(int, input().split())\r\nfor _ in range(m):\r\n a, b = input().split()\r\n p[a] = [a, b][len(b) < len(a)]\r\nprint(*(p[w] for w in input().split()))\r\n", "n,m = [int(x) for x in input().split()]\r\n\r\na = {}\r\n\r\nfor i in range(0,m):\r\n x,y = input().split()\r\n a[x]=y\r\n\r\ntemp = [x for x in input().split()]\r\n\r\nfor i in range(0,len(temp)):\r\n t = temp[i]\r\n if(len(a[t])<len(t)):\r\n temp[i]=a[t]\r\n \r\nfor i in range(0,len(temp)):\r\n print(temp[i],end=\" \")\r\n\r\nprint()\r\n\r\n\r\n\r\n", "# Lecture\ndef lecture(words, sentence):\n ans = []\n for i in sentence:\n val = min(len(words[i]), len(i))\n if len(i) == val:\n ans.append(i)\n else:\n ans.append(words[i])\n print(' '.join(ans))\n\n\nn,m = list(map(int, input().rstrip().split()))\nwords = {}\nfor i in range(m):\n x = input().rstrip().split()\n words[x[0]] = x[1]\nsentence = input().rstrip().split()\nlecture(words, sentence)", "qwerty, numwords=map(int, input().split())\nlang={}\n\nfor i in range(numwords):\n wordone, wordtwo=map(str, input().split())\n lang[wordone]=wordtwo\nlecture=input().split()\n\nfor i in range(len(lecture)):\n word=lecture[i]\n if len(word) <= len(lang[word]):\n print(f\"{word} \", end=\"\")\n else:\n print(f\"{lang[word]} \", end=\"\")\n\n", "a,b=map(int,input().strip().split())\r\nlang1=[]\r\nlang2=[]\r\nfor _ in range(b):\r\n l=list(map(str,input().strip().split()))\r\n lang1.append(l[0])\r\n lang2.append(l[1])\r\nlecture=list(map(str,input().split()))\r\n\r\nfor i in lecture:\r\n\r\n indexInLang1=lang1.index(i)\r\n if len(lang1[indexInLang1])>len(lang2[indexInLang1]):\r\n print(lang2[indexInLang1],end=\" \")\r\n else:\r\n print(lang1[indexInLang1],end=\" \")", "l1=[int(i) for i in input().split()]\r\nn=l1[0] #no of words in lecture\r\nm=l1[-1] #no of words in each lecture\r\nl2=[] #first language\r\nl3=[] #shortest word\r\nfor j in range(m):\r\n l4=[k for k in input().split()]\r\n l2.append(l4[0])\r\n if len(l4[0])<=len(l4[-1]):\r\n l3.append(l4[0])\r\n else :\r\n l3.append(l4[-1])\r\nl5=[l for l in input().split()]\r\nl6=[]\r\nfor w in l5:\r\n x=l2.index(w)\r\n l6.append(l3[x])\r\nprint(*l6,sep=\" \")", "n,m=map(int,input().split())\r\nl1,li,s=[],[],\"\"\r\nfor _ in range(m):\r\n l1.extend(list(map(str,input().split())))\r\nli=list(map(str,input().split()))\r\nfor i in li:\r\n dx=l1.index(i)\r\n if len(l1[dx+1])<len(l1[dx]) : s+=l1[dx+1]+\" \"\r\n else : s+=i+\" \"\r\nprint(s)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\nd={}\r\nc=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n c.append(a)\r\n d[a]=b\r\ns=list(map(str,input().rstrip().split()))\r\nfor x in s:\r\n if len(x)<=len(d[x]):\r\n print(x,end=\" \")\r\n else:\r\n print(d[x],end=' ')\r\n ", "s = input()\r\nm, n = int(s.split()[0]), int(s.split()[1])\r\ndic = {}\r\nfor i in range(n):\r\n s = input()\r\n a, b = s.split()\r\n if len(b) < len(a):\r\n dic[a] = b\r\n else:\r\n dic[a] = a\r\ns = input().split()\r\nfor word in s:\r\n print(dic[word], end=' ')", "s,t=input().split()\r\ns,t=int(s),int(t)\r\na=[]\r\nwhile t:\r\n p,q=input().split()\r\n a.append((p,q))\r\n t=t-1\r\n\r\nns=input()\r\nb=ns.split()\r\nfor i in b:\r\n for j in range(len(a)):\r\n if i==a[j][0]:\r\n if(len(a[j][1])<len(i)):\r\n print(a[j][1],end=\" \")\r\n elif(len(a[j][1])>len(i) or len(i)==len(a[j][1])):\r\n print(i,end=\" \")\r\n \r\n \r\n \r\n\r\n", "n,m = [int(x) for x in input().split()]\r\nwords = dict()\r\nfor i in range(m):\r\n key , value = input().split()\r\n words[key] = value\r\nans = \"\"\r\nfor j in input().split():\r\n if(len(j) <= len(words[j])):\r\n ans = ans + j + \" \"\r\n else:\r\n ans = ans + words[j] + \" \"\r\nprint(ans.strip())\r\n \r\n ", "from sys import stdin\n\ninput = stdin.readline\n\nif __name__ == '__main__':\n n, m = map(int, input().split())\n\n dct = {}\n\n for _ in range(m):\n a, b = input().split()\n dct[a] = b if len(b) < len(a) else a\n\n print(*map(lambda w: dct[w], input().split()))\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\n\\r\")\r\n\r\ndef solve():\r\n n, m = list(map(int, input().split()))\r\n dic = {}\r\n for i in range(m):\r\n x, y = list(map(str, input().split()))\r\n if len(x) <= len(y):\r\n dic[x] = x\r\n dic[y] = x\r\n else:\r\n dic[x] = y\r\n dic[y] = y\r\n a = list(map(str, input().split()))\r\n for i in a:\r\n print(dic[i], end = ' ')\r\n\r\nfor _ in range(1):\r\n solve()", "lecture, total = map(int, input().split())\ndictionary = dict()\nfor i in range(total):\n word, meaning = input().split()\n dictionary[word] = meaning\n\nlecture_string = input().split()\nans = \"\"\nfor word in lecture_string:\n if len(word) > len(dictionary[word]): ans += dictionary[word]+\" \"\n else: ans += word+\" \"\nprint(ans)", "n,m=map(int,input().split())\r\nx={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n x[a]=b\r\nlis = input().split()\r\nres=[]\r\nfor i in lis:\r\n if(len(i)<=len(x[i])):\r\n res.append(i)\r\n else:\r\n res.append(x[i])\r\nprint(' '.join(res))", "import math\r\nfrom collections import Counter,deque,defaultdict\r\nMOD=10**9+7\r\n\r\nn,m=[int(x) for x in input().split()]\r\nans=[]\r\nfirst,second=[],[]\r\nfor _ in range(m):\r\n a,b=[str(x) for x in input().split()]\r\n first.append(a)\r\n second.append(b)\r\ns=[str(x) for x in input().split()]\r\nfor i in s:\r\n idx=first.index(i)\r\n z=second[idx]\r\n if len(i)>len(z):\r\n ans.append(z)\r\n elif len(i)<len(z):\r\n ans.append(i)\r\n else:\r\n ans.append(i)\r\nprint(\" \".join(ans))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n \r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "def main() -> None:\r\n n, m = map(int, input().split())\r\n d = {}\r\n for i in range(m):\r\n a, b = input().split()\r\n d[a] = b\r\n a = [i if len(i) <= len(d[i]) else d[i] for i in input().split()]\r\n print(*a)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m = map(int, input().split(' '))\r\nf = [0] * n\r\nd = {}\r\nfor i in range(m):\r\n a, b = input().split(' ')\r\n d[a] = b\r\ns = input().split(' ')\r\n\r\nfor i, w in enumerate(s):\r\n f[i] = w if len(w) <= len(d[w]) else d[w]\r\nprint(' '.join(f))\r\n", "a, b = map(int, input().split())\r\nbook = dict()\r\n\r\nfor i in range(b):\r\n h = list(input().split())\r\n book[h[0]] = h[1]\r\n book[h[1]] = h[0]\r\n\r\ng = input().split()\r\ntext = ''\r\n\r\nfor i in g:\r\n if len(book[i]) == len(i):\r\n text += i + \" \"\r\n\r\n elif len(book[i]) < len(i):\r\n text += book[i] + \" \"\r\n\r\n else:\r\n text += i + \" \"\r\n\r\nprint(text)\r\n", "(n, m) = [int(r) for r in input().split()]\r\nmapping = {}\r\nfor _ in range(m):\r\n (a, b) = input().split()\r\n mapping[a] = b\r\noutput = []\r\nfor c in input().split():\r\n b = mapping[c]\r\n output.append(c if len(c) <= len(b) else b)\r\nprint(\" \".join(output))\r\n", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().strip().split())\r\nwords_dict = dict()\r\nfor i in range(m):\r\n word1, word2 = stdin.readline().strip().split()\r\n words_dict[word1] = word2 \r\nnew_list = list(stdin.readline().strip().split())\r\nfor word in new_list:\r\n if len(word)<=len(words_dict[word]):\r\n stdout.write(word+\" \")\r\n else:\r\n stdout.write(words_dict[word]+\" \")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n languageDict:dict[str, str] = {}\r\n readTexts:list[str] = []\r\n _, WORD_COUNT = map(int, input().split())\r\n for _ in range(WORD_COUNT) :\r\n A_WORD, B_WORD = input().rstrip().split()\r\n languageDict[A_WORD] = B_WORD\r\n readTexts = input().rstrip().split()\r\n\r\n recordedTexts:list[str] = []\r\n for readText in readTexts :\r\n if len(readText) > len(languageDict[readText]) :\r\n recordedTexts.append(languageDict[readText])\r\n else :\r\n recordedTexts.append(readText)\r\n\r\n print(\" \".join(recordedTexts))\r\n\r\nmain()", "n,m=map(int,input().split())\r\nk=dict()\r\nfor i in range(m):\r\n a,b=input().split()\r\n if len(a)<=len(b):\r\n k[a]=a\r\n else:\r\n k[a]=b\r\nc=list(input().split())\r\nfor i in c:\r\n print(k[i],end=' ')\r\n ", "n,m = map(int, input().split())\r\ndict = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n if(len(a)<=len(b)):\r\n minl = a\r\n else:\r\n minl = b\r\n \r\n dict[a] = minl\r\n dict[b] = minl\r\n\r\nlecture = input().split()\r\n\r\nfor i in lecture:\r\n print(dict[i], end=' ')", "scann=input()\r\nnumbers=scann.split()\r\nn=numbers[0]\r\nm=numbers[1]\r\nn_aux=int(n)\r\nm_aux=int(m)\r\nultimo=[1]\r\nb = []\r\ns=[None for x in range(n_aux)]\r\nfor i in range(m_aux):\r\n hola=input()\r\n b.append(hola.split())\r\nhola=input()\r\nultimo[0]=hola.split()\r\nfor i in range(n_aux):\r\n for j in range(m_aux):\r\n if(ultimo[0][i]==b[j][0] or ultimo[0][i]==b[j][1]):\r\n if int(len(b[j][0])) <= int(len(b[j][1])):\r\n s[i]=b[j][0]\r\n else:\r\n s[i]=b[j][1]\r\nprint(\" \".join(s))", "n,q=map(int,input().split())\r\nd=dict(input().split() for _ in range(q))\r\nprint(' '.join(min((w,d[w]), key=len)for w in input().split()))", "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\nn, m = map(int, input().split())\r\nhash1 = dict()\r\nfor i in range(m):\r\n a,b = map(str, input().split())\r\n hash1[a]=b+\"2\"\r\n hash1[b]=a+\"1\"\r\nar = list(map(str,input().split()))\r\n\r\nfor i in range(len(ar)):\r\n s = hash1[ar[i]]\r\n if len(s)-1>len(ar[i]):\r\n print(ar[i], end=\" \")\r\n elif len(s)-1<len(ar[i]):\r\n print(s[0:len(s)-1:1], end=\" \")\r\n else:\r\n if s[len(s)-1]=='1':\r\n print(s[0:len(s)-1:1], end=\" \")\r\n else:\r\n print(ar[i], end=\" \")", "def solve():\r\n n,m = map(int, input().split())\r\n a = []\r\n b = []\r\n for i in range(m):\r\n x,y = map(str, input().split())\r\n a.append(x)\r\n b.append(y)\r\n z = input().split()\r\n d = \"\"\r\n #print(z)\r\n for i in z:\r\n if len(i) <= len(b[a.index(i)]):\r\n d = d + i+\" \"\r\n else:\r\n d = d + b[a.index(i)] + \" \"\r\n print(d)\r\ntry:\r\n solve()\r\nexcept:\r\n pass", "n, m = map(int, input().split())\r\nx = []\r\ny = []\r\ns = []\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a)>len(b):\r\n x.append(b)\r\n y.append(a)\r\n\r\n else:\r\n x.append(a)\r\n y.append(b)\r\n\r\nc = list(input().split())\r\nfor i in c:\r\n if i in x:\r\n s.append(i)\r\n elif i in y:\r\n temp = y.index(i)\r\n s.append(x[temp])\r\nprint(*s)\r\n", "n,m = map(int,input().split())\r\nm1={}\r\nl=[]\r\nt=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n if len(a)<=len(b):\r\n m1[b]=a\r\n else:\r\n m1[a]=b\r\n \r\nt=input().split()\r\nfor i in range(n):\r\n \r\n \r\n if t[i] in m1:\r\n l.append(m1[t[i]])\r\n # print('yes')\r\n else:\r\n l.append(t[i])\r\n # print('no')\r\n\r\n\r\nfor each in l:\r\n print(each,end=' ')\r\n \r\n", "n, m = map(int, input().split())\r\nword = dict()\r\nfor i in range(m):\r\n s = input().split()\r\n word[s[0]] = s[1]\r\n\r\ns = input().split()\r\nfor i in s:\r\n if len(i) <= len(word[i]):\r\n print(i, end = ' ')\r\n else:\r\n print(word[i], end = ' ')", "n,m = (int(x) for x in input().split())\r\na = []\r\nres = ''\r\nfor _ in range(m):\r\n a.append(input().split())\r\nb = input().split()\r\nfor word in b:\r\n for ind in range(0,m):\r\n pair_words = a[ind]\r\n if word in pair_words:\r\n if len(pair_words[0]) <= len(pair_words[1]):\r\n res+=pair_words[0] + ' '\r\n else:\r\n res+=pair_words[1] + ' '\r\nprint(res)\r\n", "a,b = map(int, input().split())\r\nfirst = []\r\nsec = []\r\nfor i in range(b):\r\n c,d = map(str, input().split())\r\n first.append(c)\r\n sec.append(d)\r\nall_ = input()\r\nlst = all_.split(\" \")\r\nrem = []\r\nfor j in range(0, len(lst)):\r\n if lst[j] in first:\r\n z = first.index(lst[j])\r\n if len(sec[z]) < len(first[z]):\r\n rem.append(sec[z])\r\n else:\r\n rem.append(first[z])\r\n elif lst[j] in sec:\r\n z = sec.index(lst[j])\r\n if len(first[z]) < len(sec[z]):\r\n rem.append(first[z])\r\n elif len(first[z]) > len(sec[z]):\r\n rem.append(sec[z])\r\n else:\r\n rem.append(first[z])\r\nprint(\" \".join(rem))", "a,b=map(int,input().split())\r\nx=[]\r\nq={}\r\nfor _ in range(b):\r\n i,j=input().split()\r\n if len(j)<len(i):\r\n q[i]=j\r\nn=input().split()\r\nfor i in n:\r\n \r\n if i in q.keys():\r\n \r\n x.append(q[i])\r\n else:\r\n x.append(i)\r\nprint(\" \".join(x))\r\n", "n,m=[int(i) for i in input().split()]\r\nd={}\r\nfor i in range(m):\r\n k,d[k]=[x for x in input().split()]\r\nl=[i if len(i)<=len(d[i]) else d[i] for i in input().split()]\r\nprint(*l)", "#TLE\nN, T = input(\"\").split()\nn = int(N)\nt = int(T)\nl = []\nfor i in range(0,t):\n\ts = input(\"\").split()\n\tif(len(s[0])<=len(s[1])):\n\t\ta = [s[0],s[0]]\n\telse:\n\t\ta = [s[0],s[1]]\n\tl.append(a)\ng = []\nfor i in l:\n\tg.append(i[0])\t\nw = input(\"\").split()\nr = ''\nfor i in w:\n\tv = g.index(i)\n\tr = r + l[v][1] + \" \"\nprint(r)\t\t\t\t\t\t\n", "m,n = map(int,input().split())\r\nfirst = []\r\nsecond = []\r\nfor i in range(n):\r\n j = list(input().split(' '))\r\n first.append(j[0])\r\n second.append(j[1])\r\nl = list(input().split(' '))\r\nans = []\r\nfor i in l:\r\n if i in first:\r\n ind = first.index(i)\r\n else:\r\n ind = second.index(i)\r\n if len(second[ind]) < len(first[ind]):\r\n ans.append(second[ind])\r\n else:\r\n ans.append(first[ind])\r\ns = ''\r\nfor i in ans:\r\n s+= i + ' '\r\nprint(s)\r\n \r\n", "s = list(map(int, input().split(\" \")))\r\nn, m = s[0], s[1]\r\nnames = []\r\nnames1 = []\r\nfor i in range(m):\r\n s1 = input().split(\" \")\r\n a, b = s1[0], s1[1]\r\n\r\n if(len(a)<=len(b)):\r\n names.append(a)\r\n names1.append(a)\r\n else:\r\n names.append(a)\r\n names1.append(b)\r\n\r\ns2 = input().split(\" \")\r\nres = ''\r\nfor i in s2:\r\n res+=names1[names.index(i)]\r\n res+=' '\r\nprint(res)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nfrom collections import defaultdict\r\nd=defaultdict(lambda:\"\")\r\nfor _ in range(m):\r\n a,b=map(str,input().split())\r\n if len(a)<=len(b):\r\n d[a]=a\r\n d[b]=a\r\n else:\r\n d[a]=b\r\n d[b]=b\r\nl=[str(x) for x in input().split()]\r\nfor i in l:\r\n print(d[i],end=\" \")", "d={}\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n d[a]=b\r\nfor i in input().split():\r\n print(min(i,d[i], key=len), end=' ')", "a,b = map(int,input().split())\nl = []\nfor i in range(b):\n\tx,y = map(str,input().strip().split())\n\tl.append(x)\n\tl.append(y)\nr = \"\"\t\ntext = list(map(str,input().strip().split()))\nfor i in text:\n\t\n\tind = l.index(i)\n\tif ind % 2 == 0:\n\t\tif len(l[ind]) <= len(l[ind+1]):\n\t\t\tr += l[ind]\n\t\t\tr += \" \"\n\t\telse:\n\t\t\tr += l[ind+1]\n\t\t\tr += \" \"\nprint(r)\n \t \t\t \t \t\t\t\t\t \t\t\t\t \t\t \t \t\t\t", "n,m=map(int,input().split())\r\nl1=[]\r\nl=[]\r\nk=[]\r\nfor i in range (0,m):\r\n a,b=map(str,input().split())\r\n \r\n l1.append(a)\r\n if len(a)<=len(b):\r\n l.append(a)\r\n else:\r\n l.append(b)\r\nj=list(map(str,input().split()))\r\nfor i in range (0,n):\r\n for x in range(0,m):\r\n if j[i]==l1[x]:\r\n k.append(l[x])\r\nprint(*k,sep=' ')\r\n\r\n \r\n ", "n,m=map(int,input().split())\r\nk=[]\r\nl=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n if len(a)<=len(b):\r\n k.append(a)\r\n else:\r\n k.append(b)\r\n l.append(a)\r\nc=list(input().split())\r\nfor i in c:\r\n p=l.index(i)\r\n print(k[p],end=' ')\r\n ", "a,b = map(int, input().split())\r\na = [input().split() for i in range(b)]\r\na = {i[0]:i[1] for i in a}\r\ninp = input().split()\r\nfor i in inp:\r\n print(min(i, a[i], key=len), end=' ')", "# https://codeforces.com/problemset/problem/499/B\r\n\r\nimport sys\r\n\r\n\r\ns = tuple(line for line in sys.stdin)\r\nd = {}\r\nfor item in s[1:-1]:\r\n a, b = item.strip().split()\r\n d[a] = b\r\nr = []\r\nfor item in s[-1].split():\r\n if len(item) <= len(d[item]):\r\n r.append(item)\r\n else:\r\n r.append(d[item])\r\nprint(' '.join(r))\r\n", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\nfor i in range(m):\r\n c = input().split()\r\n a.append(c[0])\r\n b.append(c[1])\r\nans = []\r\nq = list(input().split())\r\nfor i in range(n):\r\n qIndex = a.index(q[i])\r\n if len(b[qIndex]) < len(a[qIndex]):\r\n ans.append(b[qIndex])\r\n else:\r\n ans.append(a[qIndex])\r\nprint(\" \".join(ans))", "lecture_length, lang_length = list(map(int ,input().split()))\r\nd = {}\r\nfor _ in range(lang_length):\r\n l1,l2 = input().split()\r\n d[l1] = l2\r\nlecture = input().split()\r\nfor i in range(len(lecture)):\r\n word = lecture[i]\r\n if len(word) > len(d[word]):\r\n lecture[i] = d[word]\r\nprint(\" \".join(lecture))\r\n", "n,m = input().split()\r\nn,m = int(n),int(m)\r\na1 = dict()\r\nfor i in range(m) :\r\n a,b = input().split()\r\n a1[a] = b\r\ns1 = input().split()\r\ns2 = [a1[i] if len(a1[i]) < len(i) else i for i in s1]\r\nprint(\" \".join(s2))", "N,M = map(int, input().split())\r\nD = {}\r\nfor _ in range (M):\r\n A,B = map(str, input().split())\r\n if len(A) > len(B):\r\n D[A] = B\r\n D[B] = B\r\n else:\r\n D[A] = A\r\n D[B] = B\r\nK = input()\r\nfor i in K.split():\r\n print(D[i], end=' ')", "n,k=[int(s) for s in input().split()]\r\nfreq={}\r\nfor i in range(k):\r\n a,b=[str(s) for s in input().split()]\r\n if(len(a)>len(b)):\r\n freq[b]=a\r\n else:\r\n freq[a]=b\r\nlst=list(map(str,input().split()))\r\nfor i in range(len(lst)):\r\n if(lst[i] in freq.keys()):\r\n pass\r\n else:\r\n for key,values in freq.items():\r\n if values==lst[i]:\r\n lst[i]=key\r\nprint(\" \".join(lst))", "m, n = map(int, input().split())\r\n\r\nsl_list = []\r\nfor i in range(n):\r\n a, b = input().split()\r\n sl_list.append(a)\r\n sl_list.append(b)\r\n\r\nst = input().split()\r\n\r\nfinal = []\r\nfor word in st:\r\n ind = sl_list.index(word)\r\n if len(word) > len(sl_list[ind+1]):\r\n final.append(sl_list[ind+1])\r\n else:\r\n final.append(word)\r\n\r\nprint(' '.join(final))\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n d[a]=a\r\n if(len(a)>len(b)):\r\n d[a]=b\r\nc=input().split()\r\nfor i in c:\r\n print(d[i],end=' ')", "def get_mini(word, first, second):\r\n temp = ''\r\n if word in first:\r\n ind = first.index(word)\r\n if len(second[ind]) > len(word):\r\n temp = word\r\n elif len(second[ind]) == len(word):\r\n temp = word\r\n else:\r\n temp = second[ind]\r\n elif word in second:\r\n ind = second.index(word)\r\n if len(first[ind]) > len(word):\r\n temp = word\r\n elif len(first[ind]) == len(word):\r\n temp = word\r\n else:\r\n temp = first[ind]\r\n \r\n return temp\r\n \r\nn, m = map(int, input().split())\r\nfirst = []\r\nsecond = []\r\n\r\nfor i in range(m):\r\n p, q = [i for i in input().split()]\r\n first += [p]\r\n second += [q]\r\n \r\nc = input().split()\r\n\r\nt = ''\r\nfor i in range(n):\r\n temp_str = get_mini(c[i], first, second)\r\n if i == n - 1:\r\n t += temp_str\r\n else:\r\n t += temp_str + ' '\r\n \r\nprint(t)", "# Author : Mradul Tiwari\r\n\r\nimport heapq as hp\r\nimport collections\r\nimport bisect\r\nimport math\r\nimport re\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):\r\n \"\"\"sorted list unpack\"\"\"\r\n return sorted(map(func, input().split()))\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 i in range(n)]\r\n\r\n\r\ndef range_n():\r\n return range(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 getint():\r\n return int(input())\r\n\r\n\r\ndef setbits(x):\r\n count = 0\r\n while x:\r\n x = x & (x - 1)\r\n count += 1\r\n return count\r\n\r\n\r\ndef main():\r\n n, m = unpack()\r\n d = {}\r\n for i in range(m):\r\n key, value = input().split()\r\n d[key] = value\r\n lecture = input().split()\r\n ans = [word if len(word) <= len(d[word]) else d[word] for word in lecture]\r\n print(*ans)\r\n\r\n\r\nmain()\r\n", "n, m = map(int, input().split())\r\nw = []\r\nw1 = []\r\nr = []\r\nk = 0\r\nu = ''\r\nans = []\r\nfor i in range(m):\r\n c = input().split(' ')\r\n w.append(c[0])\r\n w1.append(c[1])\r\n r.append(c[0])\r\n r.append(c[1])\r\nc = input().split(' ')\r\nfor i in range(len(c)):\r\n if c[i] in w:\r\n k = w.index(c[i])\r\n if c[i] in w1:\r\n k = w.index(c[i])\r\n if len(w[k]) < len(w1[k]) or len(w[k]) == len(w1[k]):\r\n ans.append(w[k])\r\n elif len(w[k]) > len(w1[k]):\r\n ans.append(w1[k])\r\nprint(*ans)\r\n", "n,m=map(int,input().split())\r\narr=[]\r\nbrr=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n arr.append(a)\r\n arr.append(b)\r\n if len(a)<=len(b):\r\n brr.append(a)\r\n brr.append(a)\r\n else:\r\n brr.append(b)\r\n brr.append(b)\r\ns=input().split()\r\nfor i in s:\r\n k=arr.index(i)\r\n print(brr[k],end=' ')", "n, m = input().split()\r\nn, m = int(n), int(m)\r\nd = {}\r\nfor i in range(m):\r\n\tfirst, second = input().split()\r\n\td[first] = second\r\nres = ''\r\nline = input().split()\r\nfor i in line:\r\n\tif len(d[i]) < len(i):\r\n\t\tres += d[i]\r\n\telif len(d[i]) >= len(i):\r\n\t\tres += i\r\n\tres += ' '\r\nprint(res)", "\r\nn, m = map(int, input().split())\r\n\r\ndic = {}\r\nanswer = []\r\nfor i in range(m):\r\n s1, s2 = input().split()\r\n dic[s1] = s2\r\n\r\nls = input().split()\r\nfor i in range(n):\r\n if len(dic[ls[i]]) < len(ls[i]):\r\n answer.append(dic[ls[i]])\r\n else:\r\n answer.append(ls[i])\r\n\r\nprint(' '.join(answer))\r\n", "s = input().split(\" \")\r\nn = int(s[0])\r\nm = int(s[1])\r\n\r\ndi = {}\r\n\r\nfor i in range(m):\r\n s = input().split(\" \")\r\n a = s[0]\r\n b = s[1]\r\n if(len(a) > len(b)):\r\n di[a] = b\r\n else:\r\n di[a] = a\r\n\r\ns = input().split(\" \")\r\nres = \"\"\r\nfor i in range(n):\r\n res += di[s[i]] + \" \"\r\n\r\nprint(res)", "n, m = map(int, input().split())\nd = {}\nfor i in range(0, m):\n a, b = input().split()\n d[a] = b if len(a) > len(b) else a\nv = input().split()\nprint(*[d[x] for x in v])\n", "n, m = map(int, input().split())\r\n\r\n# Create maps to store the corresponding words in both languages\r\nfirst_lang = {}\r\nsecond_lang = {}\r\nfor i in range(m):\r\n a, b = input().split()\r\n if len(a) <= len(b):\r\n first_lang[a] = a\r\n second_lang[b] = a\r\n else:\r\n first_lang[a] = b\r\n second_lang[b] = b\r\n\r\n# Read the lecture text and write down the shorter word in our notes\r\nlecture = input().split()\r\nnotes = [first_lang[word] for word in lecture]\r\n\r\n# Output the words in our notes\r\nprint(' '.join(notes))\r\n", "n,m=map(int,input().split())\r\nlst1=[]\r\nlst2=[]\r\nfor i in range(0,m):\r\n x,y=map(str,input().split())\r\n lst1.append(x)\r\n lst2.append(y)\r\nmsg=list(str(m) for m in input().split())[:n]\r\nstr1=''\r\nfor char in msg:\r\n i=lst1.index(char)\r\n if len(lst1[i])>len(lst2[i]):\r\n str1+=lst2[i]+' '\r\n else:\r\n str1+=lst1[i]+' '\r\n\r\nprint(str1)\r\n\r\n", "n,m=map(int,input().split(\" \"))\r\narr=[]\r\nfor i in range(m):\r\n\tw=input().split(\" \")\r\n\tarr.append(w)\r\nk=input().split(\" \")\r\nout=[]\r\nfor i in range(len(k)):\r\n\tfor j in range(len(arr)):\r\n\t\tif k[i]==arr[j][0] or k[i]==arr[j][1]:\r\n\t\t\tif len(arr[j][0])<=len(arr[j][1]):\r\n\t\t\t\tout.append(arr[j][0])\r\n\t\t\telif len(arr[j][0])>len(arr[j][1]):\r\n\t\t\t\tout.append(arr[j][1])\r\np=''\r\nfor i in range(len(out)):\r\n\tp=p+str(out[i])+\" \"\r\nprint(p)\r\n\t\t\t\t", "k, v = map(int, input().split())\r\nd = dict()\r\ng = dict()\r\nu = []\r\nfor i in range(v):\r\n c, k = input().split()\r\n d[c] = k\r\n g[k] = c\r\nlien = list(input().split())\r\nfor i in lien:\r\n try:\r\n if len(d[i]) >= len(i):\r\n u.append(i)\r\n elif len(d[i]) < len(i):\r\n u.append(d[i])\r\n except:\r\n if len(g[i]) >= len(i):\r\n u.append(i)\r\n elif len(g[i]) < len(i):\r\n u.append(g[i])\r\nprint(*u)\n# Thu Jul 07 2022 08:53:01 GMT+0000 (Coordinated Universal Time)\n", "import string\r\n\r\n\r\nl=list(map(int,input().split()))\r\ndict={}\r\nfor i in range(l[1]):\r\n str1=input()\r\n l2=str1.split()\r\n if len(l2[0])<=len(l2[1]):\r\n dict[l2[1]]=l2[0]\r\n else:\r\n dict[l2[0]]=l2[1]\r\nstr3=input()\r\nl3=str3.split()\r\nfor k in l3:\r\n if k in dict:\r\n print(dict[k],end=\" \")\r\n else:\r\n print(k,end=\" \")\r\n ", "n=input().split(\" \")\r\nn[1]=int(n[1])\r\nd=dict({})\r\nfor i in range(n[1]+1):\r\n s=input().split(\" \")\r\n if i!=n[1]:\r\n if len(s[0])<=len(s[1]):\r\n x=s[0]\r\n y=s[1]\r\n else:\r\n x=s[1]\r\n y=s[0]\r\n d[y]=x\r\n else:\r\n c=\"\"\r\n for j in s:\r\n if j not in d.values() :\r\n c+=d[j]\r\n else:\r\n c+=j\r\n if s.index(j)!=len(s)-1:\r\n c+=\" \"\r\nprint(c)", "n, m = map(int, input().split())\r\na = []\r\nb = []\r\nfor i in range(m):\r\n\ts = list(map(str, input().split()))\r\n\ta.append(s[0])\r\n\tb.append(s[1])\r\nstring = list(map(str, input().split()))\r\nfor i in string:\r\n\tif len(a[a.index(i)]) > len(b[a.index(i)]):\r\n\t\tprint(b[a.index(i)], end = ' ')\r\n\telse:\r\n\t\tprint(a[a.index(i)], end = ' ')\r\n\r\n", "n,m=map(int,input().split())\r\nd=dict()\r\nfor _ in ' '*m:\r\n a,b=input().split()\r\n d[a]=b\r\nr=input().split()\r\nfor i in r:\r\n if len(i)<=len(d[i]):print(i,end=' ')\r\n else:print(d[i],end=' ')", "numbers=input().split(' ')\r\nfor i in range(len(numbers)):\r\n numbers[i]=eval(numbers[i])\r\nnoofwords = numbers[0]\r\nwords=numbers[1]\r\nlanguage_convert={}\r\nwhile words!=0:\r\n language=input().split(' ')\r\n if len(language[0])>len(language[1]):\r\n language_convert[language[0]]=language[1]\r\n else:\r\n pass\r\n words-=1\r\nsentence = input().split(' ')\r\nfor i in range(len(sentence)):\r\n if sentence[i] in language_convert:\r\n sentence[i]=language_convert[sentence[i]]\r\nprint(\" \".join(sentence))", "n, m = [int(_) for _ in input().split()]\r\ndict = {}\r\nfor i in range(m):\r\n s1, s2 = input().split()\r\n dict[s1] = s1 if len(s2) >= len(s1) else s2\r\n dict[s2] = s2 if len(s1) >= len(s2) else s1\r\n\r\nl = input().split()\r\nfor i in range(len(l)):\r\n l[i] = dict[l[i]]\r\n\r\nprint(\" \".join(l))", "try:\r\n n,m=list(map(int,input().split(\" \")))\r\n p=[]\r\n for i in range(0,m):\r\n p.append(list(input().split(\" \")))\r\n k=list(input().split(\" \"))\r\n u=[]\r\n q=[]\r\n for i in range(0,len(p)):\r\n q.append(p[i][0])\r\n for i in range(0,len(p)):\r\n if len(p[i][0])<=len(p[i][1]):\r\n u.append(p[i][0])\r\n else:\r\n u.append(p[i][1])\r\n dic={}\r\n for i in range(0,len(p)):\r\n dic[p[i][0]]=u[i]\r\n w=[]\r\n for j in range(0,len(k)):\r\n x=dic[k[j]]\r\n w.append(x)\r\n print(\" \".join(w))\r\n \r\n \r\nexcept:\r\n pass", "import math\r\nn,l=[int(x) for x in input().split()]\r\nd={}\r\nfor _ in range(l):\r\n a,b=input().split()\r\n if len(a)<=len(b):\r\n ans=a\r\n else:\r\n ans=b\r\n d[a]=ans\r\n d[b]=ans\r\ns=list(map(str,input().split()))\r\nfor x in s:\r\n print(d[x],end=\" \")\r\n ", "n,m = map(int,input().split())\r\nimport sys\r\nwordDict = {}\r\nfor _ in range(m):\r\n w1,w2 = input().split()\r\n n1,n2 = len(w1),len(w2)\r\n if n1 <= n2:\r\n wordDict[w1] = w1\r\n else:\r\n wordDict[w1] = w2\r\n \r\nc = input().split()\r\nans=\"\"\r\nfor i in range(n):\r\n ans+=wordDict[c[i]]+\" \"\r\n \r\nsys.stdout.write(ans)\r\n", "n=input().split()\r\nn,m=int(n[0]),int(n[1])\r\nmy_dict={}\r\nfor i in range(m):\r\n a=input().split()\r\n a,b=a[0],a[1]\r\n my_dict[a]=b\r\nlecture=input()\r\nans=''\r\nfor i in lecture.split():\r\n if i == len(lecture.split())-1:\r\n if len(i) <= len(my_dict[i]): ans+=i\r\n else: ans+=my_dict[i]\r\n else:\r\n if len(i) <= len(my_dict[i]): ans+=i + ' '\r\n else: ans+=my_dict[i]+' '\r\n #9952402150\r\nprint(ans)", "n, m = input().split()\r\nd = dict()\r\nfor _ in range(int(m)):\r\n a, b = input().split()\r\n v = min((a, b), key=len)\r\n d[a] = v\r\nprint(*[d[k] for k in input().split()])", "n, m = map(int, input().split())\r\nlang_map = {}\r\nfor i in range(m):\r\n w1, w2 = input().split()\r\n lang_map[w1] = min(w1, w2, key=len)\r\n\r\nlecture = input()\r\nprint(\" \".join([lang_map[w] for w in lecture.split()]))", "def comp(words):\r\n if len(words[1]) < len(words[0]):\r\n return 1\r\n return 0\r\n\r\nn,m = map(int, input().split())\r\nabi = [input().split() for i in range(m)]\r\nci = input().split()\r\nchoices = [abi[i][comp(abi[i])] for i in range(m)]\r\nwords_first = [abi[i][0] for i in range(m)]\r\nans = [choices[words_first.index(ci[i])] for i in range(n)]\r\nprint(\" \".join(ans))\r\n", "n,m=tuple(map(int,input().split()))\r\nd={}\r\nfor _ in range(m):\r\n a,b=input().split()\r\n d[a]=[len(a)-len(b),b]\r\nscript=input().split()\r\nfor i in range(len(script)):\r\n if d[script[i]][0]>0:\r\n script[i]=d[script[i]][1]\r\nprint(*script)", "n,m=input().split(); n,m=int(n),int(m)\r\nl={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n l[a]=b\r\n\r\nc=input().split()\r\nfor i in range(len(c)):\r\n x=c[i]\r\n if len(l[x])<len(x):\r\n c[i]=l[x]\r\n\r\nprint(*c)", "n,m=list(map(int,input().split()))\r\narr1=[]\r\narr2=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n arr1.append(a)\r\n arr2.append(b)\r\nans=[] \r\ntext=input().split()\r\nfor i in range(n):\r\n x=arr1.index(text[i])\r\n if len(arr2[x])<len(arr1[x]):\r\n ans.append(arr2[x])\r\n else:\r\n ans.append(arr1[x])\r\nprint(\" \".join(ans))\r\n ", "dictionary = {}\r\n\r\nn, m = map(int, input().split())\r\n\r\nfor i in range(m):\r\n a, b = input().split()\r\n dictionary[a] = b\r\n\r\n#print(dictionary)\r\n\r\nfor i in input().split():\r\n print(min(i, dictionary[i], key=len), \"\", end=\"\")", "n, m = map(int,input().split())\nrs = {}\n\nfor _ in range(m):\n a, b = input().split()\n if len(a) <= len(b):\n rs[a] = a\n else:\n rs[a] = b\n\nstring = input().split()\nresult = []\n\nfor i in string:\n result.append(rs[i])\n\nprint(*result)", "# Aditya Morankar\r\n# lsta = list(map(int,input().split()))\r\ndef main():\r\n lst={}\r\n n,m = list(map(int,input().split()))\r\n for i in range(m):\r\n a,b = list(input().split(' '))\r\n \r\n lst[a] = b\r\n \r\n sentence = list(input().split(' '))\r\n \r\n for i in range(n):\r\n if sentence[i] in lst:\r\n if len(sentence[i]) > len(lst[sentence[i]]):\r\n sentence[i] = lst[sentence[i]]\r\n \r\n \r\n print(\" \".join(map(str, sentence)))\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 t = 1\r\n while t!=0:\r\n main()\r\n t-=1", "# https://codeforces.com/problemset/problem/499/B\n\nif __name__ == '__main__':\n _, m = input().split() # we certainly don't need n\n memo = {}\n for i in range(int(m)):\n a, b = input().split()\n a_len = len(a)\n b_len = len(b)\n if a_len <= b_len:\n memo[b] = a\n else:\n memo[a] = b\n\n lecture = input().split()\n for word in lecture:\n value = memo.get(word, word) # If word key not in memo, value=word\n print(value, end=\" \")\n", "IN = lambda x:list(map(x, input().split()))\r\n\r\nn, m = IN(x = int)\r\nl1 = []\r\nl2 = []\r\nfor x in range(m):\r\n a,b = IN(x = str)\r\n l1 += [a]; l2 += [b]\r\nfor y in input().split():\r\n if y in l1:\r\n if len(l2[l1.index(y)]) < len(y): print(l2[l1.index(y)], end = \" \")\r\n else: print(y, end = \" \")\r\n else:\r\n if len(l1[l2.index(y)]) <= len(y): print(l1[l2.index(y)], end = \" \")\r\n else: print(y, end = \" \")", "n,m = map(int,input().split())\r\na = []\r\nb = []\r\nc = []\r\ne = []\r\nfor i in range(m):\r\n a.insert(i,list(map(str,input().split())))\r\nd = list(map(str,input().split()))\r\nfor i in range(m):\r\n b.insert(i,a[i][0])\r\nfor i in range(m):\r\n c.insert(i,a[i][1]) \r\nfor i in range(n):\r\n if(len(b[b.index(d[i])]) <= len(c[b.index(d[i])])):\r\n e.insert(i,b[b.index(d[i])])\r\n else:\r\n e.insert(i,c[b.index(d[i])])\r\nprint(' '.join(e)) \r\n\r\n", "import sys\ninput = sys.stdin.readline\n\nn, m = list(map(int, input().split()))\n\nd = {}\n\nfor i in range(m):\n a,b = list(map(str, input().split()))\n if len(a) <= len(b):\n d[a] = a;\n else:\n d[a] = b;\n\nlecture = list(map(str, input().split()))\n\nfor i in range(len(lecture)):\n if i != len(lecture) - 1:\n print(d[lecture[i]], end=' ')\n else:\n print(d[lecture[i]])\n", "n,m=map(int,input().split())\r\nd={}\r\n\r\nfor i in range(m):\r\n k,v=map(str,input().split())\r\n d[k]=v\r\n \r\nl=list(map(str,input().split()))\r\n\r\nfor i in l:\r\n j=d[i]\r\n \r\n if len(j)<len(i):\r\n print(j)\r\n else:\r\n print(i)", "dic={}\r\nn1,n2=map(int,input().split())\r\nfor i in range(n2):\r\n s1,s2=input().split()\r\n dic[str(s1)]=s2\r\nl1=input().split(\" \")\r\nfor l in l1:\r\n if len(dic[l])<len(l):\r\n print(dic[l],end=\" \")\r\n else:\r\n print(l,end=\" \")", "\r\nn,m=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nfor i in range(m):\r\n ai,bi=list(map(str,input().split()))\r\n a.append(ai)\r\n b.append(bi)\r\nlec=list(map(str,input().split()))\r\nres=''\r\nfor x in lec:\r\n idx=a.index(x)\r\n if(len(x)<=len(b[idx])):\r\n res+=x+' '\r\n else:\r\n res+=b[idx]+' '\r\nprint(res)", "n, m = map(int, input().split())\r\nwords = {}\r\nfor _ in range(m):\r\n a, b = map(str, input().split())\r\n if len(a) < len(b) or len(a) == len(b):\r\n words[b] = a\r\n else:\r\n words[a] = b\r\na = list(map(str, input().split()))\r\nfor i in range(n):\r\n if a[i] in words:\r\n a[i] = words[a[i]]\r\nprint(*a)", "n, m = list(map(int, input().split()))\n\nd = {}\nfor _ in range(m):\n\n k, v = input().split()\n d[k] = v\n\nres = input().split()\n\nfor i, r in enumerate(res):\n if len(d[r]) < len(r):\n res[i] = d[r]\nprint(\" \".join(res))\n ", "import math\r\nimport copy\r\nimport itertools\r\nimport bisect\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef ilst():\r\n return list(map(int,input().split()))\r\n \r\ndef islst():\r\n return list(map(str,input().split()))\r\n \r\ndef inum():\r\n return map(int,input().split())\r\n \r\n\r\nn,m = inum()\r\nd = {}\r\n\r\nfor i in range(m):\r\n tl = islst()\r\n if len(tl[0]) <= len(tl[1]):\r\n d[tl[1]] = tl[0]\r\n else:\r\n d[tl[0]] = tl[1]\r\n#print(d)\r\ntl = islst()\r\nans = ''\r\nfor i in range(n):\r\n if tl[i] not in d:\r\n ans += ' ' + tl[i]\r\n continue\r\n ans += ' '+d[tl[i]]\r\nprint(ans[1:])", "n, m = map(int, input().split())\r\n\r\nwords = {}\r\nfor _ in range(m):\r\n first_lang, second_lang = input().split()\r\n words[first_lang] = second_lang\r\n\r\nlecture = input().split()\r\n\r\nrecorded_lecture = [words[word] if len(words[word]) < len(word) else word for word in lecture]\r\nrecorded_lecture = ' '.join(recorded_lecture)\r\n\r\nprint(recorded_lecture)\r\n", "n,m=[int(x) for x in input().split()]\r\ndict={}\r\nfor i in range(m):\r\n arr=[x for x in input().split()]\r\n dict[arr[0]]=arr[1]\r\n\r\ns=list(input().split())\r\nans=\"\"\r\nfor i in range(n):\r\n if len(s[i])<=len(dict[s[i]]):\r\n ans+=s[i]+\" \"\r\n else:\r\n ans+=dict[s[i]]+\" \"\r\nprint(ans)\r\n\r\n", "a = [int(i) for i in input().split()]\r\nx = a[0]\r\ny = a[1]\r\nlst = []\r\nfor i in range(y):\r\n lst1 = input().split()\r\n lst+=lst1\r\nlstW = input().split()\r\nfor i in range(x):\r\n temp = lst.index(lstW[i])\r\n if(len(lst[temp])>len(lst[temp+1])):\r\n print(lst[temp+1],end=\" \")\r\n \r\n else:\r\n print(lst[temp],end=\" \") ", "m,n=map(int,input().split())\r\nd={}\r\nfor i in range(n):\r\n a,b=map(str,input().split())\r\n d[a]=b\r\n d[b]=a\r\nl=list(map(str,input().split()))\r\nfor i in l:\r\n if len(i)<=len(d[i]):\r\n print(i,end=' ')\r\n else:\r\n print(d[i],end=' ')", "x=list(map(int, input().split()))\nd={}\nfor i in range (x[1]):\n l=input(). split()\n if(len(l[0])<=len(l[1])):\n d[l[0]]=l[0]\n else:\n d[l[0]]=l[1]\nk=input(). split()\nfor j in k:\n print(d[j],end=\" \")\n ", "n , m = map(int,input().split())\r\nwDict = {}\r\nfor _ in range(m) :\r\n key , value = list(map(str,input().split(\" \")))\r\n wDict[key] = value\r\nfor word in list(map(str,input().split(\" \"))) :\r\n if len(word) <= len(wDict[word]) : print(word , end=\" \")\r\n else : print(wDict[word] , end=\" \")", "m,n=map(int,input().split())\r\nc={}\r\nfor i in range(n):\r\n\ta,b=input().split()\r\n\tif len(a)>len(b):\r\n\t\tc[a]=b\r\n\telse:\r\n\t\tc[a]=a\t\r\nd=list(map(str,input().split()))\r\nfor j in range(m):\r\n\td[j]=c[d[j]]\r\nfor i in d:\r\n\tprint(i,end=' ')", "def main():\r\n num, words = [int(x) for x in input().split()]\r\n lang1 = []\r\n lang2 = []\r\n\r\n for i in range(0, words):\r\n a, b = input().split()\r\n lang1.append(a)\r\n lang2.append(b)\r\n comp_word = input().split()\r\n st =\"\"\r\n\r\n for i in comp_word:\r\n if i in lang1:\r\n x = lang1.index(i)\r\n if len(lang1[x]) <= len(lang2[x]):\r\n st += lang1[x]+\" \"\r\n else:\r\n st += lang2[x]+\" \"\r\n print(st)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def count(x, s):\n answer = \"\"\n words = s.split(\" \")\n for word in words:\n if word in x:\n if len(word) > len(x[word]):\n answer += x[word] +\" \"\n else:\n answer += word + \" \"\n else:\n answer += word + \" \"\n answer = answer[0:len(answer)-1]\n print(answer)\n \n\ny = int(input().split(\" \")[1])\narr = {}\nfor i in range(0, y):\n x = input()\n x = x.split(\" \")\n arr[x[0]] = x[1]\ns = input()\ncount(arr, s)\n \t \t \t \t \t\t\t \t \t\t\t \t\t\t\t", "lect_words, dict_words = map(int, input().split())\nfirst_second = {}\nfor i in range(dict_words):\n a, b = input().split()\n first_second[a] = b\n\nlect_text = list(input().split())\nnew_text = []\nfor word in lect_text:\n translation = first_second[word]\n if len(translation) < len(word):\n new_text.append(translation)\n else:\n new_text.append(word)\nprint(' '.join(new_text))\n", "n, m = map(int, input().split())\r\nl = list()\r\nAcopy = list()\r\nfor i in range(m):\r\n\ta, b = input().split()\r\n\tif len(a)>len(b):\r\n\t\tl.append(b)\r\n\telse:\r\n\t\tl.append(a)\r\n\tAcopy.append(a)\r\narr = list(input().split())\r\nfor i in range(n):\r\n\tprint(l[Acopy.index(arr[i])], end = ' ')", "n, m = [int(s) for s in input().split()]\n\ndct = {}\nfor _ in range(m):\n key, value = input().split()\n dct[key] = value\n dct[value] = key\n\n\nstring = input().split()\n\nfor word in string:\n if len(dct[word]) < len(dct[dct[word]]):\n print(dct[word], end=' ')\n else:\n print(dct[dct[word]], end=' ')", "n,m=map(int, input().split(\" \"))\r\nd=dict()\r\nfor i in range(m):\r\n a,b=list(map(str, input().split(\" \")))\r\n if len(a)>len(b):\r\n d[a]=b\r\n else:\r\n d[a]=a\r\ns=list(map(str, input().split(\" \")))\r\nfor i in range(len(s)):\r\n if s[i] in d:\r\n s[i]=d[s[i]]\r\n print(s[i], end=\" \") ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\nn, m = invr()\r\nmap1, map2 = {}, {}\r\nfor i in range(m):\r\n s = input()\r\n words = str(s)[:len(s) - 1].split(\" \")\r\n map1[words[0]] = words[1]\r\n map2[words[1]] = words[0]\r\n\r\ns = input()\r\nlecture = str(s)[:len(s) - 1].split(\" \")\r\nfor i in range(len(lecture)):\r\n if lecture[i] in map1:\r\n word, translation = lecture[i], map1[lecture[i]]\r\n else:\r\n word, translation = map2[lecture[i]], lecture[i]\r\n \r\n if len(word) <= len(translation):\r\n print(word, end=\"\")\r\n else:\r\n print(translation, end=\"\")\r\n\r\n if i < len(lecture) - 1:\r\n print(\" \", end=\"\")\r\n else:\r\n print(\"\")", "# https://codeforces.com/problemset/problem/499/B\n\nm = int(input().split(\" \")[1])\n\nlookup_table = {}\n\nfor _ in range(m):\n word_one, word_two = input().split(\" \")\n min_word = min(word_one, word_two, key=len)\n lookup_table[word_one] = min_word\n lookup_table[word_two] = min_word\n\nfinal_sentence = input().split(\" \")\nprint(\" \".join([lookup_table[word] for word in final_sentence]))", "from sys import stdin\r\n\r\nn, m = map(int, stdin.readline().strip().split())\r\nc = {}\r\nfor _ in range(m):\r\n a, b = map(str, stdin.readline().strip().split())\r\n c[a] = b if len(a) > len(b) else a\r\n\r\ns = list(map(str, stdin.readline().strip().split()))\r\noutput = \" \".join(c.get(word, word) for word in s)\r\nprint(output)\r\n", "def solve(L,R):\r\n for e in R:\r\n for k,v in L.items():\r\n if e == k or v == e:\r\n if len(k)>len(v):f=0;print(v,end=' ');break;\r\n else:print(k,end=' ')\r\n return()\r\na,b=map(int,input().split(\" \"))\r\nL={}\r\nfor _ in range(b):\r\n S1,S2=input().split(\" \")\r\n L[S1]=S2\r\nR=list(input().split(\" \"))\r\nsolve(L,R)\r\n ", "n,m=map(int,input().split())\r\nl=[]\r\nl1=[]\r\nans=[]\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n l.append(a)\r\n l1.append(b)\r\n if len(a)<=len(b):\r\n ans.append(a)\r\n else:\r\n ans.append(b)\r\ns=input().split()\r\nfor i in s:\r\n if i in l:\r\n x=l.index(i)\r\n print(ans[x],end=\" \")\r\n else:\r\n x=l1.index(i)\r\n print(ans[x],end=\" \")", "n,m=map(int,input().split())\r\nd={}\r\nans=\"\"\r\nfor i in range(0,m):\r\n s1,s2=input().split()\r\n d[s1]=s2\r\ns=input().split()\r\n#print(s)\r\n#mn=\" \"\r\n#x=0\r\nfor k in s:\r\n if len(k)<=len(d[k]):\r\n ans=ans+k+\" \"\r\n else:\r\n ans=ans+d[k]+\" \"\r\nprint(ans)\r\n \r\n\r\n \r\n ", "a, b = map(int, input().split())\r\nf1=[]\r\nf2=[]\r\nfor n in range(b):\r\n f,s=input().split()\r\n f1.append(f)\r\n f2.append(s)\r\nb=input().split()\r\nl=[]\r\nfor p in b:\r\n ind = f1.index(p)\r\n x=min(p,f2[ind],key=len)\r\n l.append(x)\r\nprint(*l)", "n,m=map(int,input().split())\nk={}\nfor i in range(m):\n a,b=map(str,input().split())\n k[a]=b\nl=list(map(str,input().split()))\nfor i in range(n):\n if len(l[i])>len(k[l[i]]):\n l[i]=k[l[i]]\nprint(*l)\n", "line1 = input().split()\r\nn = int(line1[0])\r\nm = int(line1[1])\r\nlistOfWords = {}\r\ninput1 = \"\"\r\nfirstLanguage = []\r\n\r\nfor i in range(m):\r\n input1 = input()\r\n split1 = input1.split()\r\n listOfWords[split1[0]] = split1[1]\r\n\r\nlectureWords = input().split()\r\noutput = []\r\n\r\nfor i in range(len(lectureWords)):\r\n index = lectureWords[i]\r\n\r\n if len(index) <= len(listOfWords[index]):\r\n output.append(index)\r\n\r\n else:\r\n output.append(listOfWords[index])\r\n\r\n\r\nfinal = \" \".join(output)\r\nprint(final)\r\n\r\n", "n, m = map(int, input().split())\r\ntrans = dict()\r\nfor i in range(m):\r\n s = input().split()\r\n if len(s[0]) > len(s[1]):\r\n trans[s[0]] = s[1]\r\n else:\r\n trans[s[1]] = s[0]\r\n\r\na = input().split()\r\nans = []\r\nfor word in a:\r\n if word in trans.keys():\r\n ans.append(trans[word])\r\n else:\r\n ans.append(word)\r\nprint(' '.join(ans))", "#https://codeforces.com/problemset/problem/499/B\r\ndef build_answer_string(convertion_dictionary, string_text):\r\n string_list = []\r\n for word in string_text.split():\r\n if(word in convertion_dictionary):\r\n string_list.append(convertion_dictionary[word])\r\n else:\r\n string_list.append(word)\r\n return \" \".join(string_list)\r\n\r\n(n, m) = (int(x) for x in input().split())\r\nconvertion_dictionary = {}\r\nwhile m > 0:\r\n (a,b) = (x for x in input().split())\r\n if(len(b) < len(a)):\r\n convertion_dictionary.update({a:b})\r\n m -= 1\r\nprint(build_answer_string(convertion_dictionary, input()))", "n,m = map(int,input().split())\r\nd = dict()\r\nfor i in range(m):\r\n x = input().split()\r\n d[x[0]] = x[1]\r\ns = input().split()\r\nfor x in s:\r\n if len(d[x]) < len(x):\r\n print(d[x],end=' ')\r\n else:\r\n print(x,end=' ')\r\nprint()", "'''\r\n\t* Author :- Tanay Kulkarni\r\n\t* Date :- 27-6-2021\r\n\t* Time :- 19:50:26.580041\r\n\t* Name :- solve.py\r\n'''\r\nimport sys\r\ndef debug(*a):\r\n\tprint(a,file = sys.stderr)\r\ndef read(typ = str):\r\n\treturn typ(input())\r\ndef read_arr(typ):\r\n\treturn list(map(typ,input().split()))\r\ndef solve():\r\n\tn,m = read_arr(int)\r\n\tms = dict()\r\n\tfor i in range(m):\r\n\t\ta,b = read_arr(str)\r\n\t\tms[a] = b\r\n\t\tms[b] = a\r\n\tsentence = read_arr(str)\r\n\tres = \"\"\r\n\tfor i in range(n):\r\n\t\tif len(sentence[i]) > len(ms[sentence[i]]):\r\n\t\t\tsentence[i] = ms[sentence[i]]\r\n\t\tres += sentence[i]+\" \"\r\n\t# print(sentence)\r\n\tprint(res)\r\nt = 1\r\nfor i in range(1,t+1):\r\n\t\t# print(\"Case #{}:\".format(i),end=' ')\r\n\t\tsolve()\r\n\r\n", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Lecture\"\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, m = list(map(int, input().split()))\r\n dict_ = dict()\r\n for i in range(m):\r\n x, y = input().split()\r\n dict_[x] = sorted([x, y], key=len)[0]\r\n \r\n words = input().split()\r\n for word in words:\r\n print(dict_[word], end=\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "n, m = map(int, input().split())\r\nd= {}\r\nfor i in range(m):\r\n s1,s2= input().split()\r\n d[s1]=s2\r\nl= input().split()\r\nfor w in l:\r\n if len(d[w])<len(w):\r\n print(d[w],end=\" \")\r\n else:\r\n print(w,end=\" \")\r\n\r\n", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n\ta,b=input().split()\r\n\td[a]=b\r\nfor x in input().split():\r\n\tprint(x if len(x)<=len(d[x]) else d[x],end=' ')", "from collections import defaultdict\r\nn,m = map(int, input().split())\r\nmp = defaultdict(str)\r\nfor i in range(m):\r\n a1, b1 = input().split()\r\n n1,n2 = len(a1), len(b1)\r\n mp[a1] = a1 if n1 <= n2 else b1\r\n mp[b1] = b1 if n2 < n1 else a1\r\n\r\na = list(input().split())\r\nans = \"\"\r\n\r\nfor i in a:\r\n ans += mp[i]\r\n ans += \" \"\r\n\r\nprint(ans)\r\n ", "nk=input().split()\r\nn=int(nk[0])\r\nk=int(nk[1])\r\na={}\r\nfor t_qtr in range (k):\r\n s=input().split()\r\n a[s[0]]=s[1]\r\nr=input().split()\r\nres=[]\r\ni=0\r\nwhile i<n:\r\n if len(r[i]) > len(a[r[i]]):\r\n r[i]=a[r[i]]\r\n i=i+1\r\n\r\n\r\n\r\nprint(\" \".join(map(str,r)))", "n, m = [int(x) for x in input().split(' ')]\r\n\r\nd = {}\r\nfor _ in range(m):\r\n x, y = input().split(' ')\r\n d[x] = y\r\n\r\nres = [x if len(x) <= len(d[x]) else d[x] for x in input().split(' ')]\r\nprint(' '.join(res))\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(m):\r\n l+=list(input().split())\r\ns=list(input().split())\r\nfor i in s:\r\n k=l.index(i)\r\n print([l[k],l[k+1]][len(l[k+1])<len(i)],end=\" \")", "n,m=map(int,input().split())\r\nwords1=[]\r\nwords2=[]\r\n\r\nans=[]\r\nfor i in range(m):\r\n a,b=input().split()\r\n words1.append(a)\r\n words2.append(b)\r\n\r\nlect=input().split()\r\n\r\nfor i in lect:\r\n k=words1.index(i)\r\n if(len(words1[k])>len(words2[k])):\r\n ans.append(words2[k])\r\n else:\r\n ans.append(words1[k])\r\n\r\n\r\n\r\n# print(words1)\r\n# print(words2)\r\n# print(lect)\r\nfor i in ans:\r\n print(i,end=\" \")\r\n", "n,m = [int(i) for i in input().split(' ')]\r\nL1 = []\r\nL2 = []\r\nfor i in range(m):\r\n a,b = [i for i in input().split(' ')]\r\n if(len(a) <= len(b)):\r\n L1.append(a)\r\n L2.append(b)\r\n else:\r\n L1.append(b)\r\n L2.append(a)\r\n\r\nres = [i for i in input().split(' ')]\r\nfor i in range(n):\r\n for j in range(m):\r\n if res[i] == L2[j]:\r\n res[i] = L1[j]\r\n\r\nprint(' '.join(res))", "n,m = [int(x) for x in input().split()]\r\nlang = []\r\nfor i in range(m):\r\n lang.append([x for x in input().split()])\r\nwords = [x for x in input().split()]\r\nnotes = []\r\n\r\nfor word in words:\r\n for pair in lang:\r\n if word == pair[0]:\r\n if len(pair[0]) > len(pair[1]): notes.append(pair[1])\r\n else: notes.append(pair[0])\r\n\r\nprint(\" \".join(notes))", "t , n = map(int,input().split())\r\nfirst_lang = []\r\nsecond_lang= []\r\nfor i in range(n):\r\n x = input().split()\r\n first_lang.append(x[0])\r\n second_lang.append(x[1])\r\nsentence=input().split()\r\n\r\nfor j in range(t):\r\n a =first_lang[first_lang.index(sentence[j])]\r\n if sentence[j]==a and len(a) > len(second_lang[first_lang.index(a)]):\r\n sentence[j] = second_lang[first_lang.index(a)]\r\nprint (*sentence)\r\n", "from sys import stdin\r\n\r\n# n number of words\r\n# m dictionary\r\n# f first language\r\n# s second language\r\n\r\nf = []\r\ns = []\r\nn, m = [int(c) for c in stdin.readline().split()]\r\nfor _ in range(0, m):\r\n x, y = stdin.readline().split()\r\n f.append(x)\r\n s.append(y)\r\n# lecture lecture\r\n# w word\r\n# ind index of word\r\nind = 0\r\nnote = ''\r\nlecture = stdin.readline().split()\r\n\r\nfor w in lecture:\r\n ind = f.index(w)\r\n if len(s[ind]) < len(f[ind]):\r\n note = note + ' ' + s[ind]\r\n else:\r\n note = note + ' ' + w\r\nprint(note[1:])\r\n", "n, m = [int(x) for x in input().split()]\r\nwords_dic={}\r\nfor i in range(m):\r\n x, y = input().split()\r\n words_dic[x]=y\r\nword_s=input()\r\ns=[]\r\nword_lec=''\r\nfor i in word_s:\r\n if i==' ':\r\n s.append(word_lec)\r\n word_lec=''\r\n else:\r\n word_lec+=i\r\ns.append(word_lec)\r\nlec_str=''\r\nfor i in s:\r\n if i in words_dic:\r\n if len(i)<=len(words_dic[i]):\r\n lec_str+=i+' '\r\n else:\r\n lec_str+=words_dic[i]+' '\r\n else:\r\n lec_str+=i+' '\r\nprint(lec_str[:len(lec_str)-1])\r\n", "n, m = map(int, input().split())\r\n\r\ntranslation = {}\r\nfor i in range(m):\r\n word_1, word_2 = input().split()\r\n translation[word_1] = word_2\r\n\r\nc = list(input().split())\r\nsol = []\r\nfor word in c:\r\n if len(translation[word]) < len(word):\r\n sol.append(translation[word])\r\n else:\r\n sol.append(word)\r\n\r\nprint(*sol, sep=\" \")", "n,m = map(int, input().split())\r\ndict=[]\r\ndict_1=[]\r\nfor i in range(m):\r\n st, st_1 = input().split()\r\n dict.append(st)\r\n dict_1.append(st_1)\r\ntext = input().split()\r\nreadyText = []\r\nfor i in range(n):\r\n wordFromFirstDict = dict.index(text[i])\r\n if len(dict[wordFromFirstDict]) > len(dict_1[wordFromFirstDict]):\r\n readyText.append(dict_1[wordFromFirstDict])\r\n else:\r\n readyText.append(dict[wordFromFirstDict])\r\nprint(*readyText)\r\n\r\n\r\n", "n, m = (int(i) for i in input().split())\nmap = {}\nfor _ in range(m):\n a, b = input().split()\n map[a] = map[b] = b if len(b) < len(a) else a\nres = \" \".join(map[c] for c in input().split())\nprint(res)\n", "x, y = map(int,input().split())\r\nd={}\r\n\r\nfor i in range(y):\r\n text=input().split()\r\n d[text[0]] = text[1]\r\n\r\ns=input()\r\nls = s.split()\r\n\r\nfor j in ls:\r\n r=d[j]\r\n if len(j)<=len(r):\r\n print(j, end=\" \")\r\n else:\r\n print(r, end=\" \")", "n, m = map(int, input().split())\r\narr = []\r\nfor i in range(m):\r\n arr.extend(input().split())\r\narr1 = [i for i in input().split()]\r\narr2 = []\r\nfor i in range(len(arr1)):\r\n if len(arr1[i]) <= len(arr[arr.index(arr1[i]) + 1]):\r\n arr2.append(arr1[i])\r\n else:\r\n arr2.append(arr[arr.index(arr1[i]) + 1])\r\nprint(*arr2)", "n,m = map(int,input().split())\r\ntrans = {}\r\nfor i in range(m):\r\n s = input().split()\r\n trans[s[0]]=s[1]\r\nsentence = input().split()\r\nfor i in sentence:\r\n if len(i)>len(trans[i]):\r\n print(trans[i],end=' ')\r\n else:\r\n print(i,end=' ')\r\n \r\n", "\r\nn, m = [int(e) for e in input(\"\").split()]\r\nd, ln = dict(), len\r\nfor i in range(0, m):\r\n s1, s2 = input(\"\").split()\r\n d[s1] = s2\r\ntext = input(\"\").split()\r\nfor w in text:\r\n alt = d[w]\r\n print(w if ln(w)<=ln(alt) else alt)\r\n", "n,m = map(int, input().split())\r\nk = {}\r\nfor i in range(m):\r\n\ta, b = input().split()\r\n\tk[a] = b\r\nr = input().split()\r\nl = [r[j] if len(r[j]) <= len(k[r[j]]) else k[r[j]] for j in range(n)]\r\nprint(' '.join(l))", "import sys\r\n\r\nn , m = map(int,sys.stdin.readline().split())\r\nmd = {}\r\nfor _ in range(m):\r\n a,b = map(str,input().split(\" \"))\r\n md[a] = b\r\nphrase = list(map(str,sys.stdin.readline().split(\" \")))\r\nans = ''\r\nfor i in phrase:\r\n i = i.strip('\\n')\r\n if len(i)<=len(md[i]):\r\n ans+=i+\" \"\r\n else:\r\n ans+=md[i]+' '\r\nprint(ans[:-1])\r\n\r\n", "in1 = input().split()\r\nn, m = int(in1[0]), int(in1[1])\r\nln1, ln2 = [], []\r\nret = []\r\nfor i in range(m):\r\n s = input().split()\r\n ln1 += [s[0]]\r\n ln2 += [s[1]]\r\n\r\nfor word in input().split():\r\n id = ln1.index(word)\r\n tr1, tr2 = ln1[id], ln2[id]\r\n ret.append(tr1 if len(tr1) < len(tr2) else (tr1 if len(tr1) == len(tr2) else tr2))\r\n\r\nprint(' '.join(ret))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 4 16:36:43 2020\r\n\r\n@author: HP\r\n\"\"\"\r\n\r\nn,m=map(int,input().split())\r\ndictionary={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n dictionary[a]=b\r\nn=input().split()\r\nfor i in range(len(n)):\r\n if len(dictionary[n[i]])<len(n[i]):\r\n n[i]=dictionary[n[i]]\r\nprint(*n)\r\n", "def lecturer_notes():\r\n\tword_count, dist_words = map(int, input().split())\r\n\r\n\tword_map = {}\r\n\tfor _ in range(dist_words):\r\n\t\tfirst_l, second_l = input().split()\r\n\t\tword_map[first_l] = second_l\r\n\r\n\tlecture = input().split()\r\n\tfor word in lecture:\r\n\t\tif len(word) <= len(word_map[word]):\r\n\t\t\tprint(word, end=\" \")\r\n\t\telse:\r\n\t\t\tprint(word_map[word], end=\" \")\r\n\r\n\r\nlecturer_notes()\r\n", "m,n=map(int,input().split())\r\na=[]\r\nfor i in range(0,n):\r\n a.append(list(map(str,input().split())))\r\nb=list(map(str,input().split()))\r\nfor i in range(0,m):\r\n c=a\r\n for j in range(0,n):\r\n if b[i]==c[j][0]:\r\n if len(c[j][0])>len(c[j][1]):\r\n b[i]=c[j][1] \r\nfor i in range(0,m-1):\r\n print(b[i]+\" \",end='')\r\nprint(b[m-1])", "mp={\r\n }\r\nn,m=map(int,input().split())\r\nfor i in range(m):\r\n line=input().split()\r\n mp[line[0]]=line[1]\r\ns=input().split()\r\nfor i in s:\r\n if len(i)<=len(mp[i]):\r\n print(i,end=' ')\r\n else:\r\n print(mp[i],end=' ')\r\n ", "import math\r\nfrom collections import defaultdict\r\nimport io\r\nimport os\r\nimport sys\r\ninput = sys.stdin.readline\r\n# for j in range(int(input())):\r\n # l,r=map(int,input().split())\r\n # n = int(input())\r\n # la=list(map(int,input().split()))\r\n # lb=list(map(int,input().split()))\r\n # l=list(map(int,input().split()))\r\n\r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n if len(a)<=len(b):\r\n d[a]=a\r\n else:\r\n d[a]=b\r\nl=list(map(str,input().split()))\r\nlans=[]\r\nfor i in l:\r\n lans.append(d[i])\r\nprint(*lans)\r\n", "n,m = map(int,input().split())\nd = {}\nfor i in range(0,m):\n s1,s2 = input().split()\n if len(s1) <= len(s2):\n d[s1] = s1\n d[s2] = s1\n else:\n d[s1] = s2\n d[s2] = s2\nsen = input().split()\nfor word in sen:\n print(d[word],end = ' ')\n\n\n\n", "n, m = [int(j) for j in input().split()]\r\nword, meaning = [], []\r\nfor j in range(m):\r\n w, mean = [str(j) for j in input().split()]\r\n word.append(w)\r\n meaning.append(mean)\r\nsent = [str(j) for j in input().split(' ')]\r\nfor j in range(len(sent)):\r\n index = word.index(sent[j])\r\n if len(word[index]) <= len(meaning[index]):\r\n print(end = word[index])\r\n else:\r\n print(end = meaning[index])\r\n print(end = ' ')\r\n", "n , m = map(int, input().split())\r\na= []\r\nb = []\r\nans = []\r\nfor i in range(m):\r\n\tu, v = input().split(\" \")\r\n\ta.append(u)\r\n\tb.append(v)\r\nc = list(input().split())\r\n#print(*a)\r\n#print(*b)\r\n#print(*c)\r\nfor i in range(n):\r\n\tx = c[i]\r\n\tif x in a:\r\n\t\tia = a.index(x)\r\n\t\ty = b[ia]\r\n\t\txl = len(x)\r\n\t\tyl = len(y)\r\n\t\tif xl>yl:\r\n\t\t\tans.append(y)\r\n\t\telif xl==yl:\r\n\t\t\tans.append(x)\r\n\t\telse:\r\n\t\t\tans.append(x)\r\n\telse:\r\n\t\tib = b.index(x)\r\n\t\ty = a[ib]\r\n\t\txl = len(x)\r\n\t\tyl = len(y)\r\n\t\tif xl > yl:\r\n\t\t\tans.append(y)\r\n\t\telif xl==yl:\r\n\t\t\tans.append(x)\r\n\t\telse:\r\n\t\t\tans.append(x)\r\nprint(*ans)", "#https://codeforces.com/problemset/problem/499/B\nn,m=map(int,input().split(' '))\ndict={}\nfor i in range(m):\n\tfirst,second=input().split(' ')\n\tdict[first]=second\nfor s in input().split():\n\tif len(s)>len(dict[s]):\n\t\tprint(dict[s],end=' ')\n\telse:\n\t\tprint(s,end=' ')\nprint()\n", "n,m = list(map(int, input().split()))\r\ndt = {}\r\n\r\nfor i in range(m):\r\n a,b = input().split()\r\n dt[a]=b\r\n\r\nlst = input().split()\r\n\r\nfor i in range(n):\r\n if len(lst[i]) <= len(dt[lst[i]]):\r\n print(lst[i], end=' ')\r\n else:\r\n print(dt[lst[i]], end=' ')\r\n ", "n,m=map(int,input().split())\r\ndict={}\r\nfor i in range(m):\r\n a,b=input().split()\r\n dict[a]=b\r\nk=input().split()\r\nfor i in k:\r\n if len(i)>len(dict[i]):\r\n k[k.index(i)]=dict[i]\r\nprint(*k)", "n, m = [int(x) for x in input().split()]\r\ntranslator = {}\r\nfor i in range(m):\r\n words = input().split()\r\n translator[words[0]] = min(words, key=lambda x: len(x))\r\nprint(*[translator[x] for x in input().split()])", "diction = {}\nn,m=[int(i) for i in input().split()]\nfor i in range(m):\n\ta,b=[i for i in input().split()]\n\tdiction[a]=b\n\nlecture=[i for i in input().split()]\n\nfor i,word in enumerate(lecture):\n\tif len(word)>len(diction[word]):\n\t\tlecture[i]=diction[word]\n\nsp=\" \"\nprint(sp.join(lecture))\n \t \t\t\t \t\t\t\t\t \t\t\t \t \t \t\t\t\t", "\n# def lecture(d, li):\n# \ttemp = []\n# \tfor i in li:\n# \t\ttemp.append(d[i]) if len(i) > len(d[i]) else temp.append(i) \n# \treturn temp\n\n\n# d = {} \n# m = int(input()[2:])\n# for i in range(m):\n# \ta,b = input().split()\n# \td[a] = b\n# li = input().split()\n# print(*lecture(d, li))\n\n\n# def lecture():\n# \tm = int(input()[2:])\n# \td = dict(input().split() for x in range(m))\n# \tprint(' '.join(min((i,d[i]),key = len) for i in input().split()))\n\n# lecture()\n\n\n\nn,m = map(int,input().split())\nd = dict(input().split() for _ in range(m))\nprint(' '.join(min((w,d[w]), key=len) for w in input().split()))", "import sys\r\nimport math\r\ndef main():\r\n pass\r\ndef binary(n):\r\n return (bin(n).replace(\"0b\", \"\"))\r\ndef decimal(s):\r\n return (int(s, 2))\r\ndef pow2(n):\r\n p = 0\r\n while n > 1:\r\n n //= 2\r\n p += 1\r\n return (p)\r\ndef isPrime(n):\r\n if (n == 1):\r\n return (False)\r\n else:\r\n root = int(n ** 0.5)\r\n root += 1\r\n for i in range(2, root):\r\n if (n % i == 0):\r\n return (False)\r\n return (True)\r\ndef sinp():return sys.stdin.readline().strip()\r\ndef iinp():return int(input())\r\ndef ninp():return map(int,sys.stdin.readline().strip().split())\r\ndef linp():return list(map(int,sys.stdin.readline().strip().split()))\r\ndef p(a): print(a)\r\n\r\nn,m=ninp()\r\nd={}\r\nfor i in range(m):\r\n s1,s2=input().split()\r\n len1=len(s1)\r\n len2=len(s2)\r\n if(len1<=len2):\r\n d[s1]=s1\r\n else:\r\n d[s1]=s2\r\ns=input().split()\r\nfor i in s:\r\n print(d.get(i),end=\" \")\r\n", "#文字列入力はするな！！\r\n#carpe diem\r\n\r\n\r\nn,m = map(int,input().split())\r\n\r\nd={}\r\n\r\nfor _ in range(m):\r\n a,b = map(str,input().split())\r\n\r\n if len(a)<=len(b):\r\n d[a]=a\r\n elif len(a)>len(b):\r\n d[a]=b\r\n\r\nL=list(map(str,input().split()))\r\nfor i in L:\r\n print(d[i],end=\" \")\r\n\r\n#carpe diem ", "line = input().split()\r\nn = int(line[0])\r\nm = int(line[1])\r\ndict = {}\r\nfor i in range(m):\r\n\tline = input().split()\r\n\tdict[line[0]] = line[1]\r\nlecture = input().split()\r\n\r\nnotes = []\r\n\r\nfor word in lecture:\r\n\tfirst = word\r\n\tsecond = dict[first]\r\n\tif len(first) <= len(second):\r\n\t\tnotes.append(first)\r\n\telse:\r\n\t\tnotes.append(second)\r\n\r\n\r\nprint(\" \".join(notes))", "from collections import defaultdict\r\nn, t = map(int, input().split(' '))\r\n\r\ndictionary = defaultdict(str)\r\n\r\nfor i in range(t):\r\n w1, w2 = input().split(' ')\r\n dictionary[w1] = w1 if(len(w1) < len(w2)) else w2 if(len(w1) != len(w2)) else w1\r\n dictionary[w2] = w1 if(len(w1) < len(w2)) else w2 if(len(w1) != len(w2)) else w1\r\n\r\nlecture = input().split(' ')\r\n\r\nprint(\" \".join(dictionary[i] for i in lecture))", "n,m=map(int,input().split())\r\nd={}\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n d[a]=b\r\nh=list(map(str,input().split()))\r\nfor i in range(len(h)):\r\n if(len(d[h[i]])<len(h[i])):\r\n h[i]=d[h[i]]\r\nprint(\" \".join(h))", "x=list(map(int,input().rstrip().split()))\r\nn=x[1]\r\nd={}\r\nfor i in range(n):\r\n a=list(map(str,input().rstrip().split()))\r\n if len(a[0])>len(a[1]):\r\n d[a[0]]=a[1]\r\n else:\r\n d[a[1]]=a[0]\r\ne=input()\r\nwords=e.split()\r\ns=''\r\nfor i in words:\r\n if i in d:\r\n s+=d[i]+' '\r\n else:\r\n s+=i+' '\r\nprint(s)", "n, m = map(int, input().split())\r\n\r\n# Create a dictionary to map words in the first language to words in the second language\r\nword_mapping = {}\r\nfor _ in range(m):\r\n first_word, second_word = input().split()\r\n word_mapping[first_word] = second_word\r\n\r\nlecture_text = input().split()\r\n\r\n# Process the lecture text and replace each word with its shorter or preferred counterpart\r\nresult = [word_mapping[word] if len(word_mapping[word]) < len(word) else word for word in lecture_text]\r\n\r\n# Print the resulting lecture text\r\nprint(\" \".join(result))\r\n", "n,m = map(int,input().split())\r\nlecture_word = []\r\nwrite_word = []\r\nfor words in range(m):\r\n words = list(map(str,input().split()))\r\n word1 = words[0]\r\n word2 = words[1]\r\n if len(word1) <= len(word2):\r\n word = word1\r\n else:\r\n word = word2\r\n lecture_word.append(word1)\r\n write_word.append(word)\r\nlecture = list(map(str,input().split()))\r\nfor x in lecture:\r\n i = lecture_word.index(x)\r\n print(write_word[i],end=' ')", "n,m=map(int,input().split())\r\nf=[]\r\ns=[]\r\nfor i in range(m):\r\n a,b=map(str,input().split())\r\n f.append(a)\r\n s.append(b)\r\nlecture=list(map(str,input().split()))\r\nans=[]\r\nfor i in range(n):\r\n j=0\r\n for k in range(m):\r\n # print(f[k],lecture[i])\r\n if f[k]==lecture[i]:\r\n j=k\r\n break\r\n if len(f[j])<=len(s[j]):\r\n ans.append(f[j])\r\n else:\r\n ans.append(s[j])\r\nfor i in ans:\r\n print(i,end=' ')\r\nprint(\"\\n\",end='')", "n, m = map(int, input().split())\r\nd = {}\r\nfor _ in range(m):\r\n value, key = input().split()\r\n d[value] = key\r\na = []\r\nfor w in input().split():\r\n if len(d[w]) < len(w):\r\n a.append(d[w])\r\n else:\r\n a.append(w)\r\nprint(' '.join(a))", "l=list(map(int,input().split()))\r\ns=l[1]\r\nl3=[]\r\nl4=[]\r\nfor m in range(0,s):\r\n j=list(input().split())\r\n l3.append(j[0])\r\n l4.append(j[1])\r\ns=list(input().split())\r\nfor m in s:\r\n ind=l3.index(m)\r\n if len(l4[ind])<len(l3[ind]):\r\n print(l4[ind],end=\" \")\r\n else:\r\n print(l3[ind],end=\" \")", "n, m = map(int, input().split())\r\n\r\nnums = []\r\nnums1 = []\r\nnums2 = []\r\n\r\nfor i in range(m):\r\n a, b = input().split()\r\n nums.append(a)\r\n nums1.append(b)\r\n \r\n\r\nd = input().split()\r\nnums2.extend(d)\r\n\r\ne = \"\"\r\nr = 0\r\n\r\nfor k in nums2:\r\n w = nums.index(k)\r\n if (len(nums[w]) < len(nums1[w])):\r\n e += nums[w]\r\n e += \" \"\r\n \r\n elif (len(nums1[w]) < len(nums[w])):\r\n e += nums1[w]\r\n e += \" \"\r\n \r\n elif (len(nums[w]) == len(nums1[w])):\r\n e += nums[w]\r\n e += \" \"\r\n \r\n \r\n \r\nprint(e)", "N,M = map(int,input().split())\r\nlang = {}\r\nfor i in range(M):\r\n A,B = input().split()\r\n lang[i] = [A,B]\r\nNotes = list(input().split())\r\nfor i in Notes:\r\n for j in range(M):\r\n if i in lang[j]:\r\n if len(lang[j][0]) == len(lang[j][1]):\r\n print(i,end = ' ')\r\n elif len(lang[j][0]) < len(lang[j][1]):\r\n print(lang[j][0],end = ' ')\r\n else:\r\n print(lang[j][1],end = ' ')", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\na = {}\r\nfor i in range(m):\r\n\ts = input().split()\r\n\ta[s[0]] = s[1]\r\n\r\ns = input().split()\r\nt = []\r\nfor i in range(0,n):\r\n\tif(len(s[i]) > len(a[s[i]])):\r\n\t\tt.append(a[s[i]])\r\n\telse:\r\n\t\tt.append(s[i])\r\nprint(' '.join(t))\r\n\r\n", "a , b = map(int , input().split())\r\narr = {}\r\nfor _ in range(b):\r\n x , y = input().split()\r\n arr[x] = y\r\n\r\n\r\n\r\ns = input().split()\r\n\r\nfor i in s:\r\n val = arr[i]\r\n if len(val) < len(i): print(val , end = \" \")\r\n else: print(i , end = \" \")", "n, m = list(map(int, input().split()))\ndct = {}\nfor _ in range(m):\n a, b = input().split()\n dct[a] = b\ndata = input().split()\nout = []\nfor x in data:\n if len(x) <= len(dct[x]):\n out.append(x)\n else:\n out.append(dct[x])\nprint(*out)\n", "n, m = map(int, input().split())\r\nx = []\r\ny = []\r\nres = []\r\nwhile m:\r\n lang_1, lang_2 = input().split()\r\n x.append(lang_1)\r\n y.append(lang_2)\r\n m-=1\r\nlecture = list(input().split())\r\nfor word in range(len(lecture)):\r\n if lecture[word] in x:\r\n if len(lecture[word]) <= len(y[x.index(lecture[word])]):\r\n res.append(lecture[word])\r\n else:\r\n res.append(y[x.index(lecture[word])])\r\nprint(*res)\r\n ", "n, m = str(input(\"\")).split(\" \")\r\nn = int(n)\r\nm = int(m)\r\noxfd = {}\r\nfor i in range(m):\r\n lang1, lang2 = str(input(\"\")).split(\" \")\r\n #word = [lang1, lang2]\r\n if len(lang1) > len(lang2):\r\n oxfd[lang1] = lang2\r\n else:\r\n oxfd[lang1] = lang1\r\n\r\ntext1 = str(input(\"\"))\r\nword1 = list(map(str, text1.split(\" \")))\r\nfor i in range(len(word1)):\r\n word1[i] = oxfd[word1[i]]\r\n#print(oxfd)\r\nprint(*word1, sep = ' ')", "n,m=map(int,input().split())\r\nL={}\r\nfor i in range(m):\r\n a=input().split()\r\n x=a[0]\r\n y=a[1]\r\n L[x]=y\r\nZ=input().split()\r\nx=\"\"\r\nfor i in Z:\r\n if len(i)<=len(L[i]):\r\n x+=i+\" \"\r\n else:\r\n x+=L[i]+\" \"\r\nprint(x)", "d={}\r\nn,m=list(map(int,input().split()))\r\nfor _ in range(m):\r\n f,s=input().split()\r\n if len(f)>len(s):\r\n d[f]=s\r\n d[s]=s\r\n else:\r\n d[f]=f\r\n d[s]=f\r\nsl=input().split()\r\nfor x in sl:\r\n print(d[x],end=\" \")" ]

[ "import sys\r\n#import threading\r\n#sys.setrecursionlimit(10**8)\r\n#threading.stack_size(10**8)\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 Wonder_Room():\r\n import math\r\n n,a,b = invr()\r\n\r\n min_area_reqd = 6*n \r\n\r\n if min_area_reqd <= (a*b):\r\n print(a*b)\r\n print(str(a) + ' ' + str(b))\r\n \r\n else:\r\n max_room_size = int(math.sqrt(min_area_reqd)) + 1\r\n\r\n min_area = -1 \r\n corresponding_a = -1\r\n corresponding_b = -1\r\n\r\n if a < b: \r\n room1_size_min = a \r\n room2_size_min = b \r\n else:\r\n room1_size_min = b \r\n room2_size_min = a \r\n\r\n for room1_size in range(room1_size_min,max_room_size):\r\n room2_size = math.ceil(min_area_reqd/room1_size)\r\n current_area = room1_size * room2_size\r\n\r\n if room2_size >= room2_size_min and min_area == -1:\r\n min_area = current_area\r\n\r\n if a<b:\r\n corresponding_a = room1_size\r\n corresponding_b = room2_size\r\n else:\r\n corresponding_b = room1_size\r\n corresponding_a = room2_size\r\n\r\n elif room2_size >= room2_size_min and current_area < min_area:\r\n min_area = current_area\r\n\r\n if a < b:\r\n corresponding_a = room1_size\r\n corresponding_b = room2_size\r\n else:\r\n corresponding_b = room1_size\r\n corresponding_a = room2_size\r\n \r\n print(min_area)\r\n print(str(corresponding_a) + ' ' + str(corresponding_b))\r\n \r\n return\r\n\r\nWonder_Room()", "from bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict\r\nfrom heapq import heapify, heappop, heappush\r\nfrom math import ceil, log, sqrt\r\nfrom sys import stdin\r\n\r\ninput = stdin.readline\r\n\r\nioint = lambda: int(input())\r\nioarr = lambda: map(int, input().split(\" \"))\r\nprnys = lambda: print(\"YES\")\r\nprnno = lambda: print(\"NO\")\r\n\r\nMAX = 10**9\r\n\r\nT = 1\r\n# T = ioint()\r\nwhile T:\r\n T -= 1\r\n\r\n # n = ioint()\r\n n, a, b = ioarr()\r\n req = 6 * n\r\n # arr = ioarr()\r\n\r\n if a * b >= req:\r\n print(a * b)\r\n print(a, b)\r\n break\r\n\r\n f = False\r\n if a > b:\r\n a, b = b, a\r\n f = True\r\n\r\n SQ = 1e18\r\n a1, b1, tmp = 0, 0, 0\r\n\r\n i = a - 1\r\n while i * i <= 6 * n:\r\n i += 1\r\n tmp = int(6 * n / i)\r\n\r\n if tmp * i < req:\r\n tmp += 1\r\n if tmp < b:\r\n continue\r\n\r\n if tmp * i < SQ:\r\n SQ = i * tmp\r\n a1 = i\r\n b1 = tmp\r\n\r\n if f:\r\n a1, b1 = b1, a1\r\n\r\n print(SQ)\r\n print(a1, b1)\r\n", "import math\r\n \r\nn, a, b = map(int, input().strip().split())\r\nmin_sq = n * 6\r\n \r\nif a * b >= min_sq:\r\n print('{}\\n{} {}'.format(a * b, a, b))\r\nelse:\r\n max_sq = math.inf\r\n \r\n swap = False\r\n if a > b:\r\n a, b = b, a\r\n swap = True\r\n \r\n a_n, b_n = a, b\r\n \r\n \r\n for i in range(a, int(math.ceil(math.sqrt(min_sq))) + 1):\r\n n_b = int(math.ceil(min_sq / i))\r\n \r\n if n_b < b:\r\n continue\r\n \r\n new_sq = n_b * i\r\n if new_sq < max_sq:\r\n max_sq = new_sq\r\n a_n = i\r\n b_n = n_b\r\n \r\n if swap:\r\n a_n, b_n = b_n, a_n\r\n print('{}\\n{} {}'.format(max_sq, a_n, b_n))\r\n" ]

[ "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(A):\r\n n = len(A)\r\n S = [1 for i in range(n)]\r\n d = {}\r\n for i in range(n):\r\n ai = abs(A[i])\r\n if ai not in d:\r\n d[ai] = []\r\n d[ai].append(i)\r\n L = sorted(d)\r\n answer = 0\r\n while len(L) > 0:\r\n ai = L.pop()\r\n for i in d[ai]:\r\n S[i] = 0\r\n for i in d[ai]:\r\n answer+=min(sum(S[:i]), sum(S[i+1:]))\r\n if sum(S[:i]) < sum(S[i+1:]):\r\n A[i] = -1*ai\r\n else:\r\n A[i] = ai\r\n \r\n return answer\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))" ]

[ "n = int(input())\r\npos=[0]*(3*100001)\r\nneg=[0]*(3*100001)\r\nfor i in range(n):\r\n a=list(input())\r\n c1=c2=0\r\n th=1\r\n b1=b2=0\r\n for j in a:\r\n if j=='(':\r\n c1+=1\r\n else:\r\n c1-=1 \r\n if c1<0:\r\n b1=1\r\n break \r\n if b1!=0:\r\n for j in a[::-1]:\r\n if j ==')':\r\n c2+=1\r\n else:\r\n c2-=1\r\n if c2<0:\r\n b2=1\r\n break \r\n if b1==0:\r\n pos[c1]+=1\r\n elif b2==0:\r\n neg[c2]+=1\r\nans=pos[0]**2 \r\nfor i in range(1,300001):\r\n ans+=pos[i]*neg[i] \r\nprint(ans) ", "inf=10**9\r\n\r\nn=int(input())\r\nt=[0]*n\r\nm={}\r\nfor j in range(n):\r\n\r\n\r\n s=input()\r\n\r\n\r\n bal=0\r\n req=0\r\n\r\n for i in s:\r\n if i==\")\":\r\n bal-=1\r\n else:\r\n if bal<0:\r\n req+=bal\r\n bal=1\r\n else:\r\n bal+=1\r\n\r\n if req<0:\r\n if bal>0:\r\n req=inf\r\n else:\r\n req+=bal\r\n else:\r\n req=bal\r\n\r\n t[j]=req\r\n\r\n if req not in m:\r\n m[req]=1\r\n else:\r\n m[req]+=1\r\n\r\nres=0\r\n\r\nfor i in t:\r\n if i>=0:\r\n if -i in m:\r\n res+=m[-i]\r\n\r\nprint(res)\r\n", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\nall_in = stdin.read().splitlines()\r\n\r\nn = int(all_in[0])\r\ns = all_in[1:]\r\n\r\none = defaultdict(lambda: 0)\r\ntwo = defaultdict(lambda: 0)\r\n\r\nfor el in s:\r\n I = 0\r\n min_ = 0\r\n\r\n for char in el:\r\n I += {'(': 1, ')': -1}[char]\r\n min_ = min(min_, I)\r\n\r\n if I >= 0 and min_ == 0:\r\n one[I] += 1\r\n\r\n if I <= 0 and min_ == I:\r\n two[I] += 1\r\n\r\nans = 0\r\nfor el in one.keys():\r\n ans += one[el] * two[-el]\r\n\r\nprint(ans)\r\n", "\r\nnum = int(input())\r\nnumofse=0\r\nlistOfSeq=[]\r\nneedToR={}\r\nneedToL={}\r\nfor i in range(num):\r\n numOfL=0\r\n numOfR=0\r\n t = input()\r\n \r\n for k in range(len(t)):\r\n if(t[k]==\"(\"):\r\n numOfL+=1\r\n if(t[k]==\")\" ):\r\n if(numOfL==0):\r\n numOfR+=1\r\n if(numOfL>0):\r\n numOfL-=1\r\n if(numOfL==0):\r\n if(not numOfR in needToL):\r\n needToL[numOfR]=0\r\n needToL[numOfR]+=1\r\n if(numOfR==0):\r\n if(not numOfL in needToR):\r\n needToR[numOfL]=0\r\n needToR[numOfL]+=1\r\n\r\nfor key in needToL:\r\n if(key in needToR):\r\n numofse+=needToL[key]*needToR[key]\r\n\r\nprint(numofse)\r\n \r\n \r\n \r\n \r\n \r\n\r\n", "from collections import defaultdict\n\nn = int(input())\n\n\nscope_stat = defaultdict(int)\n\n\ndef calc_stat(s):\n left = 0\n stat = 0\n for x in s:\n if x == \"(\":\n stat += 1\n else:\n if stat == 0:\n left += 1\n else:\n stat -= 1\n return (left, stat)\n\n\narray_stat = []\nfor _ in range(n):\n s = input().strip()\n a, b = calc_stat(s)\n if b == 0:\n scope_stat[a] += 1\n array_stat.append((a, b))\n\nans = 0\nfor x in array_stat:\n if x[0] == 0:\n ans += scope_stat[x[1]]\n\nprint(ans)", "n = int(input())\ns = [input() for i in range(n)]\n\na = []\nfor si in s:\n cnt = 0\n for c in si:\n if c == \"(\":\n cnt += 1\n else:\n cnt -= 1\n if cnt < 0:\n cnt = None\n break\n if cnt is not None:\n a.append(cnt)\n\nb = []\nfor si in s:\n cnt = 0\n for c in reversed(si):\n if c == \")\":\n cnt += 1\n else:\n cnt -= 1\n if cnt < 0:\n cnt = None\n break\n if cnt is not None:\n b.append(cnt)\n\nm = dict()\nfor v in a:\n if v not in m:\n m[v] = 0\n m[v] += 1\n\ncnt = 0\nfor v in b:\n if v in m:\n cnt += m[v]\n#cnt -= len(list(filter(lambda x: x==0,a)))\nprint(cnt)\n", "#-------------------------------------------------------------------------------------------\n# Richard Mello\n# A - Bracket Sequences Concatenation Problem\n#-------------------------------------------------------------------------------------------\n# Função principal\n#-------------------------------------------------------------------------------------------\nfrom collections import deque\n\ndef main():\n\t# Recebe\n\tn = int(input())\n\te = []\n\td = []\n\tpleno = []\n\ttemnadireita = [0]*300010\n\t\n\t# Pra cada sequência, avalia ela\n\tfor entrada in range(n):\n\t\tseq = input()\n\t\tfila = deque()\n\t\tesquerda, direita = 0, 0\n\t\t\n\t\t# Tenta adicionar cada caractere\n\t\tfor i in range(len(seq)):\n\t\t\t# Se tiver vazia\n\t\t\tif len(fila) == 0:\n\t\t\t\tfila.append(seq[i])\n\t\t\t\tif seq[i] == '(': direita += 1\n\t\t\t\telse: esquerda += 1\n\t\t\t\tcontinue\n\t\t\t\n\t\t\t# Se estiver tentando fechar\n\t\t\tif seq[i] == ')':\n\t\t\t\t# Se já tiver coisa aberta lá dentro, tira o par\n\t\t\t\tif fila.pop() == '(':\n\t\t\t\t\tdireita -= 1\n\t\t\t\t\tcontinue\n\t\t\t\t# Senão, adiciona 1 no contador da esquerda\n\t\t\t\tesquerda += 1\n\t\t\t# Se estiver tentando abrir\n\t\t\telse:\n\t\t\t\t# Coloca lá dentro\n\t\t\t\tfila.append('(')\n\t\t\t\t# Adiciona um na direita\n\t\t\t\tdireita += 1\n\t\t\n\t\t# Julga a linha\n\t\t# Sem salvação\n\t\tif esquerda != 0 and direita != 0: continue\n\t\t# Nem precisa de nada\n\t\telif esquerda == 0 and direita == 0: pleno.append(0)\n\t\t# Precisa na esquerda\n\t\telif esquerda != 0: e.append(esquerda)\n\t\t# Precisa na direita\n\t\telse:\n\t\t\td.append(direita)\n\t\t\ttemnadireita[direita] += 1\n\t\n\t# Agora, processa possibilidades\n\ttotal = 0\n\t\n\t# Todos os plenos podem consigo mesmo e com os outros\n\ttotal += len(pleno)**2\n\t\n\t# Pra cada cara da esquerda\n\tt = len(e)\n\tfor i in range(t):\n\t\t# Checa quantos na direita suprem ele\n\t\ttotal += temnadireita[e[i]]\n\t\n\t# Mostra o resultado\n\tprint(total)\n\t\t\nmain()\n\n#-------------------------------------------------------------------------------------------\n\n\n\t\t\t\t\t \t \t\t\t\t \t \t \t \t \t\t\t \t", "from collections import Counter\nl = []\nr = []\nans = 0\nfor _ in range(int(input())):\n s=input()\n a = 0\n b = 0\n for x in s:\n if x==')':\n if b!=0: \n b-=1\n else: \n a+=1\n else:\n b+=1\n if a+b==0:\n ans+=1\n elif a==0: \n r.append(b)\n elif b==0: \n l.append(a)\na=Counter(l)\nb=Counter(r)\n \nans*=ans\nfor x in a:\n if x in b:\n ans+=a[x]*b[x]\nprint(ans)\n\n\t \t\t \t\t \t \t\t \t \t\t \t \t", "def _(x):\r\n if x=='(' : return 1\r\n else : return -1\r\n\r\nn=int(input())\r\n# ccnt=0\r\nds={}\r\ndt={}\r\nfor x in range(n):\r\n s=list(map(_,input()))\r\n cnt=0\r\n for i in s : cnt=cnt+i\r\n l=len(s)\r\n cnts=cntt=0\r\n for i in range(l) :\r\n cnts=cnts+s[i]\r\n if cnts<0 : break\r\n # print(list(range(-1,-l-1,-1)))\r\n for i in range(-1,-l-1,-1) :\r\n cntt=cntt+s[i]\r\n # print(i,s[i])\r\n if cntt>0 : break\r\n if cnts!=-1 :\r\n # if cnt==0 : ccnt=ccnt+1\r\n if cnt>=0 :\r\n if not ds.get(abs(cnt)) : ds[abs(cnt)]=1\r\n else : ds[abs(cnt)]=ds[abs(cnt)]+1\r\n if cntt!=1 :\r\n if cnt<=0 :\r\n if not dt.get(abs(cnt)) : dt[abs(cnt)]=1\r\n else : dt[abs(cnt)]=dt[abs(cnt)]+1\r\n # print(x,abs(cnt),dt[abs(cnt)])\r\n# ans=ccnt*ccnt\r\nans=0\r\nfor i in ds :\r\n # print(i,ds[i])\r\n if dt.get(i) :\r\n # print(i,dt[i])\r\n ans=ans+ds[i]*dt[i]\r\nprint(ans)\r\n", "from collections import defaultdict\r\nbra = [input().strip() for _ in range(int(input()))]\r\nope = defaultdict(int)\r\nclo = defaultdict(int)\r\nfor b in bra:\r\n\tif b[0] == '(':\r\n\t\ta = 0\r\n\t\tfor c in b:\r\n\t\t\tif c == '(':\r\n\t\t\t\ta += 1\r\n\t\t\telse:\r\n\t\t\t\ta -= 1\r\n\t\t\t\tif a < 0:\r\n\t\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tope[a] += 1\r\n\tif b[-1] == ')':\r\n\t\ta = 0\r\n\t\tfor c in reversed(b):\r\n\t\t\tif c == ')':\r\n\t\t\t\ta += 1\r\n\t\t\telse:\r\n\t\t\t\ta-=1\r\n\t\t\t\tif a < 0:\r\n\t\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tclo[a] += 1\r\nres = 0\r\nfor x, y in clo.items():\r\n\t# print(x, y)\r\n\tres += y*ope[x]\r\nprint(res)\r\n", "\"\"\" Prositka\r\n01.10.2022\"\"\"\r\n\r\nn = int(input())\r\nleft = {}\r\nright = {}\r\nfor i in range(n):\r\n\tdata = input()\r\n\twk1 = 0\r\n\twk2 = 0\r\n\tfor j in data:\r\n\t\tif j == \"(\":\r\n\t\t\twk1 += 1\r\n\t\telse:\r\n\t\t\tif wk1 == 0:\r\n\t\t\t\twk2 += 1\r\n\t\t\telse:\r\n\t\t\t\twk1 -= 1\r\n\r\n\tif (wk1 == 0):\r\n\t\tif not wk2 in left:\r\n\t\t\tleft[wk2] = 0\r\n\t\tleft[wk2] += 1\r\n\tif (wk2 == 0):\r\n\t\tif not wk1 in right:\r\n\t\t\tright[wk1] = 0\r\n\t\tright[wk1] += 1\r\nans = 0\r\nfor key in left:\r\n\tif key in right:\r\n\t\tans += left[key] * right[key]\r\nprint(ans)", "\r\nop=[0]*1000000\r\ncl=[0]*1000000\r\ndef fun(s):\r\n v = []\r\n for i in range(len(s)):\r\n l = len(v)\r\n if s[i]=='(':\r\n v.append(s[i])\r\n elif l>0 and v[l-1]=='(':\r\n v.pop()\r\n else :\r\n v.append(')')\r\n \r\n l = len(v)\r\n if l==0:\r\n op[0]+=1\r\n cl[0]+=1\r\n elif v[0]==v[l-1]:\r\n if v[0]=='(':\r\n op[l]+=1\r\n else :\r\n cl[l]+=1\r\n\r\nt = int ( input() )\r\nwhile t>0:\r\n t-=1\r\n s = str ( input() )\r\n fun(s)\r\nans = 0\r\nfor i in range(1000000):\r\n ans+=(op[i] * cl[i])\r\n\r\nprint(ans)", "n=int(input())\nd={}\nfor i in range(n):\n s=input()\n r=0\n l=0\n for i in s:\n if i=='(':\n r+=1\n else:\n if r==0:\n l+=1\n else:\n r-=1\n if l==0 or r==0:\n c=l-r\n if c in d:\n d[c]+=1\n else:\n d[c]=1\narr=list(d.keys())\narr.sort()\nans=0\nfor i in arr:\n if i>0:\n break\n if -i in d:\n ans+=d[i]*d[-i]\nprint(ans)", "import sys\r\nn=int(input())\r\nd=dict()\r\nans=0\r\na=[]\r\nfor j in range(n):\r\n a.append(sys.stdin.readline().strip())\r\nfor j in range(n):\r\n s=a[j]\r\n o=0\r\n c=0\r\n for v in s:\r\n if v==')':\r\n if o>0:\r\n o=o-1\r\n else:\r\n c=c+1\r\n else:\r\n o=o+1\r\n #print(o,c)\r\n if o>0 and c>0:\r\n continue\r\n elif o>0:\r\n if o in d:\r\n d[o]+=1\r\n else:\r\n d[o]=1\r\n else:\r\n if -c in d:\r\n d[-c]+=1\r\n else:\r\n d[-c]=1\r\n#print(d)\r\nfor v in d:\r\n if v>0:\r\n if -v in d:\r\n ans=ans+(d[v]*d[-v])\r\nif 0 in d:\r\n ans+=(d[0]*d[0])\r\nprint(ans)\r\n", "n=int(input())\r\nc={}\r\no={}\r\nfor i in range(n):\r\n\tst=[]\r\n\ts=list(input().rstrip())\r\n\tfor j in s:\r\n\t\tif len(st)==0 :\r\n\t\t\tst.append(j)\r\n\t\telif st[-1]=='(' and j==')':\r\n\t\t\tst.pop()\r\n\t\telse:\r\n\t\t\tst.append(j)\r\n\tif len(st)==0:\r\n\t\tif 0 not in c:\r\n\t\t\tc[0]=0\r\n\t\tc[0]+=1\t\t\r\n \r\n\tif len(set(st))==1:\r\n\t\tif st[0]==')':\r\n\t\t\tz=st.count(st[0])\r\n\t\t\tif z not in c:\r\n\t\t\t\tc[z]=0\r\n\t\t\tc[z]+=1\r\n\t\telse:\r\n\t\t\tz=st.count(st[0])\r\n\t\t\tif z not in o:\r\n\t\t\t\to[z]=0\r\n\t\t\to[z]+=1\r\nans=0\t\r\nfor i in c:\r\n\t\tif i==0:\r\n\t\t\tans+=c[i]*c[i]\r\n\t\tif i in o:\r\n\t\t\tans+=c[i]*o[i]\r\nprint(ans)", "n=int(input())\nd=dict()\nfor i in range(n):\n k=input()\n right=0\n left=0\n for i in k:\n if i=='(':\n right+=1\n else:\n if right==0:\n left+=1\n else:\n right-=1\n if left==0 or right==0:\n c=left-right\n if c in d:\n d[c]+=1\n else:\n d[c]=1\ns=list(d.keys())\ns.sort()\nk=0\nfor i in s:\n if i>0:\n break\n if -i in d:\n k+=d[i]*d[-i]\nprint(k)", "while True:\r\n\ttry:\r\n\t\tdef solve(n):\r\n\t\t\ts = []\r\n\t\t\tfor i in range(n):\r\n\t\t\t\tts = input()\r\n\t\t\t\ts.append(ts)\r\n\t\t\t\tdel ts\r\n\t\t\tcunt = [0]*((3*10**5)+2)\r\n\t\t\tcunt2 = [0]*((3*10**5)+2)\r\n\t\t\tc = 0\r\n\t\t\tmn = 0\r\n\t\t\tfor i in range(n):\r\n\t\t\t\tc = 0\r\n\t\t\t\tmn = 0\r\n\t\t\t\tfor j in range(len(s[i])):\r\n\t\t\t\t\tif s[i][j] == '(':\r\n\t\t\t\t\t\tc += 1\r\n\t\t\t\t\telse:c -= 1\r\n\t\t\t\t\tmn = min(mn, c)\r\n\t\t\t\t\tif mn:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif not mn:\r\n\t\t\t\t\tcunt[c] += 1\r\n\t\t\t\t\t#print(cunt[c], c)\r\n\t\t\t\tc = 0;mn = 0\r\n\t\t\t\tfor j in range(len(s[i])-1,-1,-1):\r\n\t\t\t\t\tif s[i][j] == ')':\r\n\t\t\t\t\t\tc += 1\r\n\t\t\t\t\telse:c -= 1\r\n\t\t\t\t\tmn = min(mn, c)\r\n\t\t\t\t\tif mn:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\tif not mn:\r\n\t\t\t\t\tcunt2[c] += 1\r\n\t\t\t\t\t#print(cunt2[c], c)\r\n\t\t\tans = 0\r\n\t\t\tfor i in range(0,(3*10**5)+1,1):\r\n\t\t\t\t\r\n\t\t\t\tans = ans +(cunt[i]*cunt2[i])\r\n\t\t\tprint(ans)\r\n\t\t\t\t\r\n\t\t\t\t\r\n\t\t\t\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tn = int(input())\r\n\t\t\tsolve(n)\r\n\t\r\n\texcept EOFError:\r\n\t\tbreak", "import sys\r\ninput = sys.stdin.readline\r\n\r\nl, r = {}, {}\r\nx = 0\r\nfor _ in range(int(input())):\r\n s = input()[:-1]\r\n a, b, c, d = 0, 0, 0, 0\r\n for i in s:\r\n if i == '(':\r\n c += 1\r\n else:\r\n c -= 1\r\n a = min(c, a)\r\n for i in s[::-1]:\r\n if i == '(':\r\n d -= 1\r\n else:\r\n d += 1\r\n b = min(d, b)\r\n if a < 0 and b < 0:\r\n continue\r\n elif a < 0 and c <= 0:\r\n if -c not in r:\r\n r[-c] = 1\r\n else:\r\n r[-c] += 1\r\n elif b < 0 and d <= 0:\r\n if -d not in l:\r\n l[-d] = 1\r\n else:\r\n l[-d] += 1\r\n elif a == 0 and b == 0:\r\n x += 1\r\nx *= x\r\nfor i in l:\r\n if i in r:\r\n x += l[i]*r[i]\r\nprint(x)", "def valid_half(s):\r\n open = 0\r\n for c in s:\r\n open += (- 1) ** (int(c == ')'))\r\n if open < 0:\r\n return False\r\n return open\r\n\r\n\r\nn = int(input())\r\ns_dict = {}\r\ne_dict = {}\r\nfor i in range(n):\r\n w = input()\r\n if valid_half(w) is not False:\r\n if valid_half(w) in s_dict.keys():\r\n s_dict[valid_half(w)] += 1\r\n else:\r\n s_dict[valid_half(w)] = 1\r\n w = w.replace('(', '*').replace(')', '(').replace('*',')')[::-1]\r\n if valid_half(w) is not False:\r\n if valid_half(w) in e_dict.keys():\r\n e_dict[valid_half(w)] += 1\r\n else:\r\n e_dict[valid_half(w)] = 1\r\n\r\nans = 0\r\nfor k, v in s_dict.items():\r\n if k in e_dict:\r\n ans += s_dict[k] * e_dict[k]\r\nprint(ans)\r\n\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\nn = ni()\r\ns= [[[-1,1][i == \"(\"]for i in input()]for j in range(n)]\r\nfrom collections import defaultdict\r\na = defaultdict(int)\r\nb = defaultdict(int)\r\n\r\nfor i in range(n):\r\n z = [0] + s[i]\r\n for j in range(len(s[i])):\r\n z[j+1] += z[j]\r\n\r\n if min(z) >= 0:\r\n a[z[-1]] += 1\r\n z = [0] + [-j for j in s[i][::-1]]\r\n for j in range(len(s[i])):\r\n z[j+1] += z[j]\r\n if min(z) >= 0:\r\n b[z[-1]] += 1\r\nans = 0\r\nfor i in a:\r\n ans += b[i] * a[i]\r\n\r\nprint(ans)\r\n", "from collections import defaultdict as d\r\na, b = d(int), d(int)\r\nfor _ in range(int(input())):\r\n s, m = 0, 1e9\r\n for x in input():\r\n s += 2 * (x == '(') - 1\r\n m = min(m, s)\r\n if s >= 0 and m >= 0:\r\n a[s] += 1\r\n if s <= 0 and m == s:\r\n b[-s] += 1\r\nprint(sum(a[x] * b[x] for x in a))", "from array import array\r\nfrom sys import stdin\r\nimport bisect\r\nfrom bisect import *\r\nimport itertools\r\nfrom itertools import *\r\n\r\ndef scan_gen():\r\n for line in stdin: yield from iter(line.split())\r\nscan = scan_gen()\r\ndef nint(): return int(next(scan))\r\ndef nintk(k): return tuple(nint() for _ in range(k))\r\ndef nfloat(): return float(next(scan))\r\ndef intar_init(size): return array('i',[0]) *size\r\ndef intar(size=None):\r\n if size == None: size = nint()\r\n arr = intar_init(size) \r\n for x in range(size): arr[x]=nint()\r\n return arr\r\n\r\ndef proc(s):\r\n mn=0\r\n cur=0\r\n for c in s:\r\n if(c=='('): cur+=1\r\n if c==')': cur-=1\r\n mn = min(mn,cur)\r\n return (mn, cur)\r\n\r\ndef key(x):\r\n a,b = x\r\n return b*(10**6) + a\r\n\r\ndef solve():\r\n n = nint()\r\n S = [proc(input()) for _ in range(n)]\r\n K = [key(x) for x in S]\r\n K.sort()\r\n res =0\r\n for (mn,s) in S:\r\n if mn <0: continue\r\n ns = -s\r\n minMn = -s\r\n l = bisect_left(K, key((minMn,ns)))\r\n r = bisect_left(K,key((-20000, ns+1)))\r\n res += r-l\r\n print(res)\r\n\r\nsolve()\r\n\r\n", "__file__ = __file__.startswith('/home/a_farazei')\r\n\r\n\r\ndef input_():\r\n global __file__\r\n\r\n if not __file__:\r\n return input()\r\n\r\n if not hasattr(__file__, 'readline'):\r\n __file__ = open('input.txt', 'r')\r\n\r\n return __file__.readline()\r\n\r\n\r\nfrom collections import defaultdict\r\n\r\na, b = defaultdict(int), defaultdict(int)\r\nn = int(input_())\r\n\r\nfor _ in range(n):\r\n s, m = 0, 1e9\r\n\r\n for x in input():\r\n s += 2 * (x == '(') - 1\r\n m = min(m, s)\r\n\r\n if s >= 0 and m >= 0:\r\n a[s] += 1\r\n\r\n if 0 >= s == m:\r\n b[-s] += 1\r\n\r\nprint(sum(a[x] * b[x] for x in a))\r\n", "n=int(input())\r\nle={};ri={};cou=0\r\nfor i in range(n):\r\n a=input()\r\n r=l=0\r\n for j in a:\r\n if j=='(':l+=1\r\n else:\r\n if l>0:l-=1\r\n else:r+=1\r\n if l!=0 and r!=0:continue\r\n if a[0]=='(' and a[-1]==')' and l==r:\r\n cou+=1\r\n elif a[0]==')' and a[-1]==')' and r>l:\r\n ri[r-l]=ri.get(r-l,0)+1\r\n elif a[0]=='(' and a[-1]=='(' and l>r:\r\n le[l-r]=le.get(l-r,0)+1\r\n elif a[0]=='(' and a[-1]==')':\r\n if l>r:le[l-r]=le.get(l-r,0)+1\r\n else:ri[r-l]=ri.get(r-l,0)+1\r\ncou*=cou\r\nfor i,j in ri.items():\r\n cou+=(le.get(i,0)*j)\r\nprint(cou)", "from collections import Counter\r\nz=0\r\nr=[]\r\nl=[]\r\n#a is power to the right\r\n#b is to the left\r\nfor _ in range(int(input())):\r\n s=input()\r\n a=b=0\r\n for x in s:\r\n if x==')':\r\n if b!=0: b-=1\r\n else: a+=1\r\n else:\r\n b+=1\r\n if a+b==0:z+=1\r\n elif a==0: r.append(b)\r\n elif b==0: l.append(a)\r\nr=Counter(r)\r\nl=Counter(l)\r\n\r\nans=0\r\nfor x in r:\r\n if x in l:ans+=r[x]*l[x]\r\nans+=z*(z-1)\r\nans+=z\r\nprint(ans)", "from math import ceil, log\r\nt = 1\r\nfor test in range(t):\r\n\tn = int(input())\r\n\topenB=[0 for i in range(300001)]\r\n\tcloseB=[0 for i in range(300001)]\r\n\tans = 0\r\n\tzero = 0\r\n\tfor i in range(n):\r\n\t\tstring = input()\r\n\t\tarr = [0]\r\n\t\tplus = 0\r\n\t\tminus = 0\r\n\t\tfor char in string:\r\n\t\t\tif char == \"(\":\r\n\t\t\t\tplus+=1\r\n\t\t\t\tarr.append(1)\r\n\t\t\telse:\r\n\t\t\t\tif arr[-1]==1:\r\n\t\t\t\t\tplus-=1\r\n\t\t\t\t\tarr.pop()\r\n\t\t\t\telse:\r\n\t\t\t\t\tminus +=1\r\n\t\tif plus and minus:\r\n\t\t\tcontinue\r\n\t\telif plus:\r\n\t\t\topenB[plus]+=1\r\n\t\telif minus:\r\n\t\t\tcloseB[minus]+=1\r\n\t\telse:\r\n\t\t\tzero += 1\r\n\tfor i in range(300001):\r\n\t\tans+=openB[i]*closeB[i]\r\n\tprint(ans+(zero*zero))\r\n\r\n\r\n\r\n\r\n\t\r\n\r\n", "def addToDictionary(givenDictionary, key):\r\n if key in givenDictionary:\r\n givenDictionary[key] += 1\r\n else:\r\n givenDictionary[key] = 1\r\n return\r\n\r\ndef main():\r\n n = int(input())\r\n \r\n brackets = list()\r\n bracketsDict = dict()\r\n\r\n i = 0\r\n while i < n:\r\n brackets.append(input())\r\n i += 1\r\n\r\n \r\n for sequence in brackets:\r\n i = 0\r\n coef = 0\r\n non_closed_closing_brackets = 0\r\n\r\n while i < len(sequence):\r\n if sequence[i] == '(':\r\n coef += 1\r\n elif sequence[i] == ')':\r\n if coef - 1 < 0:\r\n non_closed_closing_brackets += 1\r\n else:\r\n coef -= 1\r\n i += 1\r\n\r\n if coef > 0 and non_closed_closing_brackets > 0:\r\n continue\r\n elif coef > 0:\r\n addToDictionary(bracketsDict, coef)\r\n elif coef == 0:\r\n if non_closed_closing_brackets > 0:\r\n addToDictionary(bracketsDict, -non_closed_closing_brackets)\r\n else:\r\n addToDictionary(bracketsDict, 0)\r\n\r\n answer = 0\r\n for key in bracketsDict:\r\n if key == 0:\r\n answer += bracketsDict[key] ** 2\r\n elif key > 0 and -key in bracketsDict:\r\n answer += bracketsDict[key] * bracketsDict[-key]\r\n \r\n print(answer)\r\n\r\nmain()", "n = int(input())\nfront = {}\nback = {}\nreg = 0\nfor i in range(n):\n stk = []\n s = input()\n for char in s:\n if len(stk) == 0:\n stk.append(char)\n elif char == \")\" and stk[-1] == \"(\":\n t = stk.pop()\n else:\n stk.append(char)\n if len(stk) == 0:\n reg += 1\n else:\n if stk == [\")\"] * len(stk):\n try:\n front[len(stk)] += 1\n except:\n front[len(stk)] = 1\n elif stk == [\"(\"] * len(stk):\n try:\n back[len(stk)] += 1\n except:\n back[len(stk)] = 1\nans = reg ** 2\nfor k, v in front.items():\n try:\n ans += v * back[k]\n except:\n pass\nprint(ans)\n", "def main():\r\n c,r,o,e=0,0,[0]*300000,[0]*300000\r\n for _ in range(int(input())):\r\n s=input()\r\n l,n=0,0\r\n for i in s:\r\n if i=='(':\r\n l+=1\r\n else:\r\n if l!=0:\r\n l-=1\r\n else:\r\n n+=1\r\n if l==0 and n==0:\r\n c+=1\r\n elif l!=0 and n!=0:\r\n pass\r\n elif l!=0:\r\n o[l]+=1\r\n else:\r\n e[n]+=1\r\n for i in range(300000):\r\n if e[i] and o[i]:\r\n r+=e[i]*o[i]\r\n print(pow(c,2)+r)\r\nif __name__=='__main__':\r\n main()", "n = int(input())\r\ni = [input() for _ in range(n)]\r\n\r\nl, r = ([0] * (3 * (10 ** 5)) for _ in range(2))\r\n\r\nfor x in i:\r\n for s, d in ((-1, l), (1, r)):\r\n m = 0\r\n for c in x[::s]:\r\n if c == ['', '(', ')'][s]:\r\n m += 1\r\n else:\r\n m -= 1\r\n if m < 0:\r\n break\r\n else:\r\n d[m] += 1\r\n\r\ns = 0\r\n\r\nfor x, y in zip(l, r):\r\n s += x * y\r\n\r\nprint(s)\r\n", "def correct(s):\r\n cur = 0\r\n for i in s:\r\n if i == '(':\r\n cur += 1\r\n else:\r\n cur -=1\r\n if cur < 0:\r\n return False\r\n return cur == 0\r\n\r\n\r\nn = int(input())\r\nd = dict()\r\nfor i in range(n):\r\n seq = list(input())\r\n s = r = False\r\n c1 = c = 0\r\n for ch in seq:\r\n if ch == '(':\r\n c += 1\r\n else:\r\n c -= 1\r\n if c < 0:\r\n s = True\r\n for ch in seq[::-1]:\r\n if ch == '(':\r\n c1 += 1\r\n else:\r\n c1 -= 1\r\n if c1 > 0:\r\n r = True\r\n if s and r or c == 0 and (s or r):\r\n continue\r\n d[c] = d.get(c, 0) + 1\r\nans = 0\r\nused = [False] * 300000\r\nfor key, val in d.items():\r\n if not used[abs(key)]:\r\n ans += val * d.get(-key, 0)\r\n used[abs(key)] = True\r\nprint(ans)", "\r\nn = int(input())\r\narr_with_open = [0] * (3 * 10 ** 5)\r\narr_with_close = [0] * (3 * 10 ** 5)\r\nfor i in range(n):\r\n s = input().rstrip()\r\n m = 0\r\n min_ = 0\r\n for ch in s:\r\n if ch == \"(\":\r\n m += 1\r\n else:\r\n m -= 1\r\n # if min_ go down(we close bracket which we have not open yet)\r\n min_ = min(m, min_)\r\n\r\n # we don't have closed bracket which we haven't opened AND all brackets are closed\r\n if min_ == 0 and m == 0:\r\n arr_with_open[0] += 1\r\n arr_with_close[0] += 1\r\n # we don't have closed brackets\")\" which haven't opened yet AND we ended with open bracket\r\n elif min_ == 0 and m > 0:\r\n arr_with_open[m] += 1\r\n # we ended with closed bracket AND we don't have unclosed brackets after it\r\n elif m < 0 and min_ == m:\r\n arr_with_close[abs(m)] += 1\r\nresult = 0\r\nfor a, b in zip(arr_with_open, arr_with_close):\r\n result += a * b\r\nprint(result)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon May 28 15:35:18 2018\r\n\r\n@author: Pranav_Dalal\r\n\"\"\"\r\nn=int(input())\r\nopened=[ 0 for i in range(300001)]\r\nclos=[0 for i in range(300001) ]\r\ns=[]\r\nreg=0\r\nfor i in range(n):\r\n s+=[input()]\r\nfor i in s:\r\n c=0\r\n d=0\r\n e=1\r\n for j in i:\r\n if j=='(':\r\n c+=1\r\n elif j==')':\r\n d+=1\r\n if d>c:\r\n e=2\r\n i2=i[::-1]\r\n c2=0\r\n d2=0\r\n e1=0\r\n for j in i2:\r\n if j==')':\r\n d2+=1\r\n else:\r\n c2+=1\r\n if c2>d2:\r\n e1=1\r\n if c==d and e==1:\r\n reg+=1\r\n elif c>d and e==1:\r\n opened[c-d]+=1\r\n elif d>c and e1==0:\r\n clos[d-c]+=1\r\n else:\r\n continue\r\nans=0\r\nfor i in range(0,300001):\r\n ans+=opened[i]*clos[i]\r\nans+=reg**2\r\nprint(ans)", "n = int(input())\r\ns = []\r\nld = dict() # good to be on left\r\nrd = dict() # good to be on right\r\nres = []\r\nfor i in range(n):\r\n s.append(input())\r\n left = 0\r\n right = 0\r\n for c in s[i]:\r\n if c == '(':\r\n left += 1\r\n else:\r\n if left == 0:\r\n right += 1\r\n else:\r\n left -= 1\r\n res.append((left, right))\r\n if right == 0:\r\n ld.setdefault(left, []).append(i)\r\n if left == 0:\r\n rd.setdefault(right, []).append(i)\r\nans = 0\r\nfor k in ld:\r\n ln = len(ld[k])\r\n if k in rd:\r\n rn = len(rd[k])\r\n ans += ln*rn\r\n\r\nprint(ans)\r\n\r\n", "from sys import stdin\n\n\ndef main():\n _, *l = stdin.read().splitlines()\n f, le, ri, res = {'(': 1, ')': -1}.get, {}, {}, 0\n for s in l:\n x = z = 0\n for y in map(f, s):\n x += y\n if z > x:\n z = x\n if not z or z == x:\n if x > 0:\n le[x] = le.get(x, 0) + 1\n elif x < 0:\n ri[x] = ri.get(x, 0) + 1\n else:\n res += 1\n res *= res\n for x, v in le.items():\n res += v * ri.get(-x, 0)\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport io, os\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nS = [str(input().rstrip()) for i in range(n)]\r\nfrom collections import defaultdict\r\nd1 = defaultdict(lambda: 0)\r\nd2 = defaultdict(lambda: 0)\r\nans = 0\r\nfor i, s in enumerate(S):\r\n cum1 = 0\r\n flag1 = True\r\n for c in s:\r\n if c == '(':\r\n cum1 += 1\r\n else:\r\n cum1 -= 1\r\n if cum1 < 0:\r\n flag1 = False\r\n if flag1:\r\n ans += d2[cum1]\r\n cum2 = 0\r\n flag2 = True\r\n for i in reversed(range(len(s))):\r\n c = s[i]\r\n if c == ')':\r\n cum2 += 1\r\n else:\r\n cum2 -= 1\r\n if cum2 < 0:\r\n flag2 = False\r\n if flag2:\r\n ans += d1[cum2]\r\n if cum1 == 0 and cum2 == 0 and flag1 and flag2:\r\n ans += 1\r\n if flag1:\r\n d1[cum1] += 1\r\n if flag2:\r\n d2[cum2] += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\nstarts = []\nends = []\nfor i in range(n):\n\ts = input()\n\t# forward\n\tcc = 0\n\tfor c in s:\n\t\tif c=='(':\n\t\t\tcc+=1\n\t\telse:\n\t\t\tcc-=1\n\t\t\tif cc<0:\n\t\t\t\tbreak\n\telse:\n\t\tstarts.append(cc)\n\t\n\tcc = 0\n\tfor c in s[::-1]:\n\t\tif c==')':\n\t\t\tcc+=1\n\t\telse:\n\t\t\tcc-=1\n\t\t\tif cc<0:\n\t\t\t\tbreak\n\telse:\n\t\tends.append(cc)\n\t\n\nnstarts = [0] * 300008\nnends = [0] * 300008\n\nfor i in starts:\n\tnstarts[i]+=1\nfor i in ends:\n\tnends[i]+=1\n\nres = 0\nfor s,e in zip(nstarts,nends):\n\tres += s*e\n\t\nprint(res)\n\n#print(starts)\n#print(ends)\n#print(nstarts[:10])\n#print(nends[:10])\n\n#starts.sort()\n#ends.sort()\n\n\n", "def clean(string):\r\n stack = []\r\n for c in string:\r\n if len(stack) == 0:\r\n stack.append(c)\r\n elif stack[-1] == '(' and c == ')':\r\n stack.pop()\r\n else:\r\n stack.append(c)\r\n return ''.join(stack)\r\n\r\n\r\ndef rev_brackets(string):\r\n rev = []\r\n for c in string:\r\n if c == '(':\r\n rev.append(')')\r\n else:\r\n rev.append('(')\r\n\r\n return \"\".join(reversed(rev))\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n validSequence = 0\r\n dict = {}\r\n\r\n arr = []\r\n\r\n for i in range(n):\r\n string = clean(input())\r\n if len(string) == 0:\r\n validSequence += 1\r\n else:\r\n arr.append(string)\r\n if string not in dict:\r\n dict[string] = 1\r\n else:\r\n dict[string] += 1\r\n\r\n incompleteScore = 0\r\n\r\n for s in arr:\r\n rev = rev_brackets(s)\r\n if s[0] == '(' and rev in dict:\r\n incompleteScore += dict[rev]\r\n\r\n completeScore = validSequence + ((validSequence - 1) * validSequence)\r\n\r\n print(completeScore + incompleteScore)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from collections import Counter\r\n\r\ndef i_ints():\r\n return list(map(int, input().split()))\r\n\r\n#############\r\n\r\ndef calc(s):\r\n m = res = 0\r\n \r\n for c in s:\r\n if c == '(':\r\n res += 1\r\n else:\r\n res -= 1\r\n if res < m:\r\n m = res\r\n\r\n if m < 0 and res > m:\r\n return None\r\n\r\n return res\r\n\r\n\r\nn, = i_ints()\r\ns = [input() for _ in range(n)]\r\ns = [c for c in map(calc, s) if c is not None]\r\n\r\ncs = Counter(s)\r\nprint(sum(cs[c] * cs[-c] for c in cs if c >= 0))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nERR = float('inf')\r\ndef check(s):\r\n cnt = 0\r\n for c in s:\r\n if c=='(':\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n return cnt\r\n\r\ndef check1(s):\r\n cnt = 0\r\n for c in s:\r\n if c=='(':\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n if cnt<0:return False\r\n return True\r\n\r\ndef check1(s):\r\n cnt = 0\r\n for c in s:\r\n if c=='(':\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n if cnt<0:return False\r\n return True\r\n\r\ndef check2(s):\r\n cnt = 0\r\n for c in s:\r\n if c=='(':\r\n cnt+=1\r\n else:\r\n cnt-=1\r\n if cnt>0:return False\r\n return True\r\n\r\nlib = defaultdict(int)\r\nfor _ in range(N):\r\n s = input()\r\n a = check(s)\r\n if a>0 and check1(s):\r\n lib[a]+=1\r\n elif a<0 and check2(s[::-1]):\r\n lib[a]+=1\r\n elif a==0 and check1(s):\r\n lib[0]+=1\r\n \r\n# print(lib)\r\n\r\nans = lib[0]**2\r\nfor k,v in lib.items():\r\n if k>0 and -k in lib.keys():\r\n b = lib[-k]\r\n ans+=v*b\r\nprint(ans)\r\n \r\n\r\n", "\r\ndef reverse(st):\r\n aux = \"\" \r\n for x in range(len(st)-1,-1,-1):\r\n aux = aux + st[x]\r\n res = \"\"\r\n for x in aux:\r\n if x == '(':\r\n res = res + ')'\r\n else:\r\n res = res + '('\r\n return res\r\n \r\n\r\ndef balance(st):\r\n b = 0\r\n for x in st:\r\n if x == '(':\r\n b = b +1\r\n else:\r\n b = b-1\r\n if b < 0:\r\n return -1\r\n return b\r\n\r\nn = int(input())\r\nwords = []\r\ncount = [0 for x in range(0,3*100000 + 10)]\r\nfor x in range(0,n):\r\n aux = input().strip()\r\n words.append(aux)\r\n\r\n \r\nfor x in words:\r\n res = balance(x)\r\n if res != -1:\r\n count[res] = count[res] + 1\r\n\r\nresult = 0\r\n\r\nfor x in words:\r\n aux = reverse(x)\r\n r = balance(aux)\r\n if r != -1:\r\n result = result + count[r]\r\nprint(result)\r\n \r\n ", "from collections import defaultdict\nfrom sys import stdin\n\ninput = stdin.readline\n\nif __name__ == '__main__':\n bs = defaultdict(lambda: 0)\n\n for _ in range(int(input())):\n s = list(map(lambda o: 1 if o == '(' else -1, input().strip()))\n sm = sum(s)\n dp = [s[0]]\n for i in range(1, len(s)):\n dp.append(s[i] + dp[-1])\n ms = min(dp)\n if ms < 0 and sm > ms:\n continue\n bs[sm] += 1\n\n cnt = 0\n\n for k, v in bs.items():\n if k < 1 and -k in bs:\n cnt += v * bs[-k]\n\n print(cnt)\n", "n=int(input())\r\n\r\no={}\r\nc={}\r\nx=0\r\n\r\nfor _ in range(n):\r\n s=str(input())\r\n nn=len(s)\r\n w=[s[0]]\r\n for i in range(1,nn):\r\n if s[i]=='(':\r\n w.append(s[i])\r\n else:\r\n if len(w)==0:\r\n w.append(s[i])\r\n else:\r\n if w[-1]=='(':\r\n w.pop()\r\n else:\r\n w.append(s[i])\r\n if w==[]:\r\n x+=1\r\n elif '(' in w and ')' in w:\r\n continue\r\n elif w[0]=='(':\r\n if len(w) in o.keys():\r\n o[len(w)]+=1\r\n else:\r\n o[len(w)]=1\r\n elif w[0]==')':\r\n if len(w) in c.keys():\r\n c[len(w)]+=1\r\n else:\r\n c[len(w)]=1\r\nans=x**2\r\nfor i in o.keys():\r\n if i in c.keys():\r\n ans+=o[i]*c[i]\r\nprint(ans)", "def checkLeft(s):\r\n\tc1,c2=0,0\r\n\tf=1\r\n\tfor i in s:\r\n\t\tif i=='(':\r\n\t\t\tc1+=1\r\n\t\telse:\r\n\t\t\tc2+=1\r\n\t\tif c2>c1:\r\n\t\t\tf=0\r\n\t\t\tbreak\r\n\treturn f\r\ndef checkRight(s):\r\n\tc1,c2=0,0\r\n\tf=1\r\n\tfor i in range(len(s)-1,-1,-1):\r\n\t\tif s[i]=='(':\r\n\t\t\tc1+=1\r\n\t\telse:\r\n\t\t\tc2+=1\r\n\t\tif c1>c2:\r\n\t\t\tf=0\r\n\t\t\tbreak\r\n\treturn f\r\nn=int(input())\r\nN=6*(10**5)+1\r\nb=[0]*N\r\nfor i in range(n):\r\n\ts=input()\r\n\tc1,c2=0,0\r\n\tfor j in s:\r\n\t\tif j=='(':\r\n\t\t\tc1+=1\r\n\t\telse:\r\n\t\t\tc2+=1\r\n\tif (c1>c2 and checkLeft(s)) or (c1<c2 and checkRight(s)) or (c1==c2 and checkLeft(s) and checkRight(s)):\r\n\t\tb[c1-c2+N//2]+=1\r\n\r\nans=0\r\nfor i in range(-N//2,1):\r\n\tif b[i+N//2]>0 and b[-i+N//2]>0:\r\n\t\tans+=b[i+N//2]*b[-i+N//2]\r\nprint(ans)\r\n#print(N//2)\r\n\t\r\n" ]

[ "n = int(input())\norders = [0 for i in range(n)]\nfor i in range(n-1):\n a, b = [int(j) -1 for j in input().split()]\n orders[a] += 1\n orders[b] += 1\n\nroots = []\nleafs = []\n\nfor i, x in enumerate(orders):\n if x > 2:\n roots.append(i)\n elif x == 2:\n pass\n elif x == 1:\n leafs.append(i)\n else:\n raise Exception('woww')\n\n\nif len(roots) > 1:\n print('No')\nelif len(roots) == 0:\n print('Yes')\n print('1')\n print(' '.join([str(l+1) for l in leafs]))\nelif len(roots) == 1:\n print('Yes')\n print(str(len(leafs)))\n root = str(roots[0] + 1)\n for l in leafs:\n print(root, str(l+1))\nelse:\n raise Exception('woww')\n", "d = {}\r\nn = int(input())\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n d[a] = d.get(a, 0) + 1\r\n d[b] = d.get(b, 0) + 1\r\nzz = list(filter(lambda x: d[x] > 2, d)) \r\nz = len(zz)\r\ny = list(filter(lambda x: d[x] == 1, d))\r\nif z > 1:\r\n print(\"No\")\r\nelif z == 0: \r\n print(\"Yes\")\r\n print(1)\r\n print(*y)\r\nelse: \r\n print(\"Yes\")\r\n print(len(y))\r\n for v in y:\r\n print(zz[0], v)", "from sys import stdin\r\ninput=stdin.readline\r\nread=lambda :map(int,input().strip().split())\r\nfrom collections import defaultdict\r\n\r\nn=int(input())\r\ndeg=[0]*n\r\ng=defaultdict(list)\r\nfor i in range(n-1):\r\n x,y=read()\r\n x-=1\r\n y-=1\r\n deg[x]+=1\r\n deg[y]+=1\r\n g[x].append(y)\r\n g[y].append(x)\r\nc=0\r\nres=0\r\nfor i in range(n):\r\n if deg[i]>=3:\r\n c+=1\r\n if deg[i]>=res:\r\n root=i\r\n res=deg[i]\r\n\r\nif c>=2:\r\n print(\"No\")\r\n exit()\r\nleaf=[]\r\nfor i in range(0,n):\r\n if len(g[i])==1 and i!=root:\r\n leaf.append(i)\r\nprint(\"Yes\")\r\nprint(len(leaf))\r\nfor i in leaf:\r\n print(root+1,i+1)\r\n", "N = int(input())\r\ncnt = [0] * N\r\nG = [[] for i in range(N)]\r\nrec = []\r\nfor i in range(N - 1):\r\n a, b = map(int, input().split())\r\n cnt[a - 1] += 1\r\n cnt[b - 1] += 1\r\n\r\nrec = []\r\nnum = 0\r\nroot = 0\r\nfor i in range(N):\r\n if cnt[i] > 2:\r\n num += 1\r\n root = i\r\n elif cnt[i] == 1:\r\n rec.append(i)\r\n\r\nif num >= 2:\r\n print(\"No\")\r\nelif num == 0:\r\n print(\"Yes\")\r\n print(1)\r\n print(rec[0] + 1, rec[1] + 1)\r\nelse:\r\n print(\"Yes\")\r\n print(len(rec))\r\n for i in range(len(rec)):\r\n print(\"{} {}\".format(root + 1, rec[i] + 1))", "from collections import defaultdict\r\nn=int(input())\r\ngraph=defaultdict(int)\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split())\r\n a-=1\r\n b-=1\r\n graph[a]+=1\r\n graph[b]+=1\r\ncnt=0\r\nroot=-1\r\nleaf=[]\r\nfor i in range(n):\r\n if (graph[i])>2:\r\n cnt+=1\r\n root=i\r\n elif (graph[i])==1:\r\n leaf.append(i)\r\n elif root==-1:\r\n root=i\r\nif cnt>1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n if root==-1:\r\n root=leaf.pop(0)\r\n print(len(leaf))\r\n for i in range(len(leaf)):\r\n print(root+1,leaf[i]+1)", "def solve():\r\n n = int(input())\r\n deg = [0] * n\r\n for i in range(n - 1):\r\n u, v = map(int, input().split())\r\n deg[u - 1] += 1\r\n deg[v - 1] += 1\r\n count = 0\r\n root = 0\r\n leaves = []\r\n for i in range(n):\r\n if (deg[i] > 2):\r\n count += 1\r\n root = i\r\n if (deg[i] == 1):\r\n leaves.append(i)\r\n if (count > 1):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n print(deg[root])\r\n for leaf in leaves:\r\n if (leaf != root):\r\n print(root + 1, leaf + 1)\r\nsolve()\r\n", "# take risk at the edge of Accepted\r\n\r\nfrom math import *\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n Edge = [ [] for i in range(n + 3)]\r\n\r\n for i in range(1, n):\r\n u, v = map(int, input().split())\r\n Edge[u].append(v)\r\n Edge[v].append(u)\r\n\r\n cnt = 0\r\n ComPo = []\r\n for i in range(1, n + 1):\r\n if len(Edge[i]) > 2:\r\n cnt += 1\r\n ComPo.append(i)\r\n\r\n if cnt > 1:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n if cnt == 0:\r\n print(1)\r\n for i in range(1, n + 1):\r\n if len(Edge[i]) == 1:\r\n ComPo.append(i)\r\n print(ComPo[0], ComPo[1])\r\n else:\r\n Ans = []\r\n for i in range(1, n + 1):\r\n if len(Edge[i]) == 1:\r\n Ans.append(i)\r\n print(len(Ans))\r\n for i in Ans:\r\n print(ComPo[0], i)\r\n\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass", "#!/usr/bin/env python3\n\nn = int(input().strip())\ndegs = [0 for _ in range(n)]\nfor _ in range(n - 1):\n\t[u, v] = map(int, input().strip().split())\n\tdegs[u - 1] += 1\n\tdegs[v - 1] += 1\n\nni = [None, [], [], []]\nfor v, d in enumerate(degs):\n\tdd = min(d, 3)\n\tni[dd].append(v)\n\n\nif len(ni[3]) > 1:\n\tprint ('No')\nelif len(ni[3]) == 1:\n\tprint ('Yes')\n\tprint (len(ni[1]))\n\tu = ni[3][0]\n\tfor v in ni[1]:\n\t\tprint (u + 1, v + 1)\nelse: # ni[3] == []\n\tprint ('Yes')\n\tprint (1)\n\tprint (ni[1][0] + 1, ni[1][1] + 1)\n\n", "n=int(input()) \r\na=[0]*(n+1) \r\nfor _ in range(n-1):\r\n x,y=map(int,input().split()) \r\n a[x]+=1 \r\n a[y]+=1 \r\nnov=0 \r\nfor i in a[1:]:\r\n if i>2:\r\n nov+=1 \r\nif nov>1:\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n v=0 \r\n res=[]\r\n for i in range(1,n+1):\r\n if a[i]>2:\r\n v=i \r\n if a[i]==1:\r\n res.append(i) \r\n if v!=0:\r\n print(len(res))\r\n for r in res:\r\n print(v,r)\r\n else:\r\n print(1)\r\n print(*res)\r\n", "from sys import stdin\r\n\r\nall_in = stdin.read().splitlines()\r\n\r\nn = int(all_in[0])\r\n\r\nif n == 2:\r\n print('Yes')\r\n print(1)\r\n print(1, 2)\r\n exit()\r\n\r\ngraph = {i: list() for i in range(1, n + 1)}\r\n\r\nfor el in all_in[1: n + 1]:\r\n a, b = map(int, el.split())\r\n\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nsor = sorted(graph.items(), key=lambda x: len(x[1]), reverse=True)\r\n\r\nif len(sor[1][1]) > 2:\r\n print('No')\r\n exit()\r\n\r\nelse:\r\n print('Yes')\r\n print(len(sor[0][1]))\r\n\r\n ans = list()\r\n a = sor[0][0]\r\n for el in sor[0][1]:\r\n prev = a\r\n temp = el\r\n list_ = graph[temp]\r\n list_.remove(prev)\r\n\r\n while len(list_) != 0:\r\n prev = temp\r\n temp = list_[0]\r\n list_ = graph[temp]\r\n list_.remove(prev)\r\n\r\n b = temp\r\n ans.append(f'{a} {b}')\r\n\r\n print('\\n'.join(ans))\r\n", "import sys\nn = int(sys.stdin.readline())\ndegree = [0 for i in range(n + 1)]\nfor i in range(n - 1):\n\tu, v = map(int, sys.stdin.readline().split())\n\tdegree[u]+=1\n\tdegree[v]+=1\nok = sum([int(degree[u] > 2) for u in range(n + 1)]) < 2\nif not ok:\n\tprint('No')\n\tsys.exit()\nprint('Yes')\nmaxdeg = max(degree)\ncenter = degree.index(maxdeg)\nends = []\n[ends.append(i) for i in range(n + 1) if degree[i] == 1 ]\nif maxdeg == 2 or n == 2:\n\tprint(1)\n\tprint(ends[0], ends[1])\nelse:\n\tprint(len(ends))\n\t[print(center, i) for i in ends]", "n = int(input())\r\n\r\nedges = {}\r\n\r\nfor i in range(n-1):\r\n a,b = list(map(int,input().split()))\r\n if a in edges:\r\n edges[a].add(b)\r\n else:\r\n edges[a] = set()\r\n edges[a].add(b)\r\n if b in edges:\r\n edges[b].add(a)\r\n else:\r\n edges[b] = set()\r\n edges[b].add(a)\r\n\r\ncnt = 0\r\nroot = 0\r\nfor node in edges:\r\n if len(edges[node])>2:\r\n root = node\r\n cnt+=1\r\n \r\nif cnt >1:\r\n print('No')\r\n\r\nelif root !=0:\r\n leaves = list(filter(lambda x : len(edges[x])==1, edges))\r\n print('Yes')\r\n print(len(leaves))\r\n for leaf in leaves:\r\n print(root, leaf)\r\nelse:\r\n leaves = list(filter(lambda x : len(edges[x])==1, edges))\r\n print('Yes')\r\n print(1)\r\n print(*leaves)\r\n \r\n\r\n", "n = (int(input()))\r\nedges = [0 for i in range(n+1)]\r\nfor _ in range(n-1):\r\n\tx,y = map(int,input().split())\r\n\tedges[x] += 1\r\n\tedges[y] += 1\r\n\r\nleaves = []\r\nnode = None\r\nflag = True\r\nfor i in range(1,n+1):\r\n\tif(edges[i]==1):\r\n\t\tleaves.append(i)\r\n\telif(edges[i]>2):\r\n\t\tif(not node==None):\r\n\t\t\tflag = False\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tnode = i\r\nif(flag):\r\n\tprint(\"Yes\")\r\n\tif(node==None):\r\n\t\tprint(1)\r\n\t\tprint(leaves[0],end=' ')\r\n\t\tprint(leaves[1])\r\n\telse:\r\n\t\tprint(len(leaves))\r\n\t\tfor item in leaves:\r\n\t\t\tprint(item,end=' ')\r\n\t\t\tprint(node)\r\nelse:\r\n\tprint(\"No\")", "from copy import deepcopy\r\nimport itertools\r\nfrom bisect import bisect_left\r\n\r\ndef read():\r\n return int(input())\r\n\r\n\r\ndef readmap():\r\n return map(int, input().split())\r\n\r\n\r\ndef readlist():\r\n return list(map(int, input().split()))\r\n\r\n\r\nN = read()\r\ndegree = [0] * N\r\nfor _ in range(N-1):\r\n a, b = readmap()\r\n degree[a-1] += 1\r\n degree[b-1] += 1\r\n\r\nmore_than_three = 0\r\nfor d in degree:\r\n if d >= 3:\r\n more_than_three += 1\r\n\r\nif more_than_three >= 2:\r\n print(\"No\")\r\n quit()\r\n\r\nans = []\r\nif more_than_three == 1:\r\n for v in range(N):\r\n if degree[v] >= 3:\r\n center = v\r\n for v in range(N):\r\n if degree[v] == 1:\r\n ans.append((center+1, v+1))\r\n print(\"Yes\")\r\n print(len(ans))\r\n for tup in ans:\r\n print(tup[0], tup[1])\r\n quit()\r\n\r\nleaf = []\r\nfor v in range(N):\r\n if degree[v] == 1:\r\n leaf.append(v)\r\nprint(\"Yes\")\r\nprint(1)\r\nprint(leaf[0]+1, leaf[1]+1)", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Created on: 25/09/2020 03:49:27\r\n\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport heapq\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations, permutations\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\ndeg = [0] * n\r\nfor i in range(n - 1):\r\n a, b = iia()\r\n deg[a - 1] += 1\r\n deg[b - 1] += 1\r\n\r\ncount = node = 0\r\nans = []\r\nfor i in range(n):\r\n if deg[i] > 2:\r\n count += 1\r\n node = i\r\n elif deg[i] == 1:\r\n ans.append(i)\r\nif count > 1:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n print(deg[node])\r\n for i in ans:\r\n if node != i:\r\n print(node + 1, i + 1)\r\n\r\n\r\n \r\n ", "def main():\r\n n = int(input())\r\n deg = [0] * n\r\n for i in range(n - 1):\r\n u, v = map(int, input().split())\r\n deg[u - 1] += 1\r\n deg[v - 1] += 1\r\n count = 0\r\n ans = 0\r\n e = []\r\n for i in range(n):\r\n if (deg[i] > 2):\r\n count += 1\r\n ans = i\r\n if (deg[i] == 1):\r\n e.append(i)\r\n if (count > 1):\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")\r\n print(deg[ans])\r\n for el in e:\r\n if (el != ans):\r\n print(ans + 1, el + 1)\r\nmain()", "# python3\n\n\ndef readline(): return tuple(map(int, input().split()))\n\n\ndef readlines(count): return (readline() for __ in range(count))\n\n\ndef main():\n n, = readline()\n degree = [0] * n\n root = None\n for (a, b) in readlines(n - 1):\n degree[a - 1] += 1\n degree[b - 1] += 1\n\n for (x, d) in enumerate(degree, start=1):\n if d > 2:\n if root is None:\n root = x\n else:\n print(\"No\")\n return\n\n if root is None:\n root = 1\n\n ways = [i for (i, d) in enumerate(degree, start=1) if d == 1 and i != root]\n print(\"Yes\")\n print(len(ways))\n print(\"\\n\".join(map(f\"{root} {{}}\".format, ways)))\n\n\nmain()\n", "import sys\r\nmod = 1000000007\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline()\r\ndef print_array(a): print(\" \".join(map(str, a)))\r\ndef main():\r\n n = int(input())\r\n tree = [[] for _ in range(n + 1)]\r\n for _ in range(n - 1):\r\n x, y = get_ints()\r\n tree[x].append(y)\r\n tree[y].append(x)\r\n cnt, flag, q, intersection = 0, True, [], 0\r\n for i in range(1, n + 1):\r\n x = len(tree[i])\r\n if x > 2:\r\n cnt += 1\r\n intersection = i\r\n if cnt > 1: flag = False\r\n if x == 1: q.append(i)\r\n print(\"Yes\" if flag else \"No\")\r\n if flag:\r\n l = len(q)\r\n print(l - 1)\r\n print(q[0], q[1])\r\n if l > 2:\r\n q.pop(0)\r\n q.pop(0)\r\n for _ in range(l - 2): print(intersection, q.pop(0))\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\ndeg = [0]*100005\r\nleaves = []\r\nfor i in range(1,n):\r\n a,b = map(int, input().split())\r\n deg[a]+=1\r\n deg[b]+=1\r\ncnt = 0\r\nmxdeg = 0\r\nroot = 0\r\nfor j in range(1,n+1):\r\n if deg[j]>mxdeg:\r\n mxdeg = deg[j]\r\n root = j\r\n if deg[j] == 1:\r\n leaves.append(j)\r\n if deg[j] > 2:\r\n cnt+=1\r\nif cnt>1:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\nm = 0\r\nfor it in leaves:\r\n if it != root:\r\n m+=1\r\nprint(m)\r\nfor it2 in leaves:\r\n if it2 != root:\r\n print(root,it2)\r\n\r\n\r\n\r\n", "n=int(input())\r\ndeg=[0 for i in range(n+1)]\r\nfor _ in range(n-1):\r\n x,y=map(int,input().split())\r\n deg[x]+=1;deg[y]+=1\r\npos=True\r\nroot=None\r\nl=[]\r\nfor i in range(n+1):\r\n if deg[i]==1:l.append(i)\r\n elif deg[i]>2:\r\n if root:pos=False\r\n else:root=i\r\nif not pos:\r\n print('No')\r\nelse:\r\n print('Yes')\r\n if root:\r\n print(len(l))\r\n for i in l:\r\n print(i,root)\r\n else:\r\n print(1)\r\n print(*l)\r\n", "from typing import List, Set\r\n\r\n\r\nn = int(input())\r\nnodes: List[Set[int]] = [set() for _ in range(n)]\r\nfor _ in range(n - 1):\r\n u, v = [int(i) - 1 for i in input().split()]\r\n nodes[u].add(v)\r\n nodes[v].add(u)\r\n\r\n\r\nintersections: List[int] = []\r\nendpoints: List[int] = []\r\nfor index, node in enumerate(nodes):\r\n if len(node) == 1:\r\n endpoints.append(index)\r\n elif len(node) > 2:\r\n intersections.append(index)\r\n if len(intersections) > 1:\r\n break\r\n\r\n\r\nif len(intersections) > 1:\r\n print(\"No\")\r\n\r\nelif len(intersections) == 1:\r\n print(f\"Yes\\n{len(endpoints)}\")\r\n\r\n intersection = intersections[0] + 1\r\n for endpoint in endpoints:\r\n print(f\"{endpoint + 1} {intersection}\")\r\n\r\nelse:\r\n print(\"Yes\\n1\")\r\n print(*[endpoint + 1 for endpoint in endpoints])\r\n" ]

[ "import sys\r\nfrom array import array # noqa: F401\r\nfrom math import hypot\r\nfrom collections import defaultdict\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn, m, x = map(int, input().split())\r\nkeyboard = [input().rstrip() for _ in range(n)]\r\nkeys = set()\r\ninf, eps = 10**9, 1e-9\r\ndist = defaultdict(lambda: inf)\r\nshift = []\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if keyboard[i][j] == 'S':\r\n shift.append((i, j))\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if keyboard[i][j] == 'S':\r\n continue\r\n keys.add(keyboard[i][j])\r\n for ti, tj in shift:\r\n dist[keyboard[i][j].upper()] = min(dist[keyboard[i][j].upper()], hypot(i - ti, j - tj))\r\n\r\nq = int(input())\r\nans = 0\r\nfor c in input().rstrip():\r\n if c.lower() not in keys:\r\n print(-1)\r\n exit()\r\n if 65 <= ord(c) <= 90:\r\n if not shift:\r\n print(-1)\r\n exit()\r\n if dist[c] - eps > x:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,m,d=map(int, input().split())\nd=d**2\nkey={}\nfor i in range(26):\n key[chr(ord('a')+i)]=-1\n key[chr(ord('A')+i)]=-1\na=[]\nfor i in range(n):\n a.append(input())\nshift=[]\nfor i in range(n):\n for j in range(m):\n if a[i][j]==\"S\":\n shift.append((i,j))\nfor i in range(n):\n for j in range(m):\n ch=a[i][j]\n if ch>=\"a\" and ch<=\"z\":\n key[ch]=0\n ch=ch.upper()\n if key[ch]<0 and len(shift)>0:key[ch]=1\n for (x,y) in shift:\n if (i-x)**2+(j-y)**2<=d:\n key[ch]=0\n break\nres=0\ninput()\nfor ch in input():\n if key[ch]<0:\n print(-1)\n exit()\n else:\n res+=key[ch]\nprint(res)\n \n \n \n\n\t\t \t \t\t\t \t \t \t\t\t\t \t \t\t\t \t\t", "n, m, x = map(int, input().split())\nchar = 'a'\npos = {}\nfor i in range(26):\n\tpos[char] = []\n\tchar = chr(ord(char)+1)\npos['S'] = []\n\nfor i in range(n):\n\ts = input()\n\tfor j in range(m):\n\t\tpos[s[j]].append([i, j])\n\ndef find_dist(a, b):\n\treturn ((a[0]-b[0])**2 + (a[1]-b[1])**2)**0.5\n\ndist = []\nchar = 'a'\nfor i in range(26):\n\tmin_dist = 1e9\n\tfor j in range(len(pos[char])):\n\t\tfor k in range(len(pos['S'])):\n\t\t\tmin_dist = min(min_dist, find_dist(pos[char][j], pos['S'][k]))\n\tdist.append(min_dist)\n\tchar = chr(ord(char)+1)\n\nq = int(input())\nt = input()\nshift = True\nif len(pos['S']) == 0:\n\tshift = False\npress = True\ncount = 0\n\nfor i in range(q):\n\tif len(pos[t[i].lower()]) == 0:\n\t\tpress = False\n\t\tbreak\n\telif t[i].isupper():\n\t\tif shift:\n\t\t\tif dist[ord(t[i].lower()) - ord('a')] > x:\n\t\t\t\tcount += 1\n\t\telse:\n\t\t\tpress = False\n\t\t\tbreak\n\nif press:\n\tprint(count)\nelse:\n\tprint(-1)", "#!/usr/bin/env python3 \r\n\r\n(n,m,x) = map(int, input().split())\r\n\r\nkeyboard = []\r\nfor i in range(n):\r\n keyboard.append(input().strip())\r\n\r\nq = int(input())\r\ntext = input().strip()\r\n\r\nshift_keys = []\r\ncost = dict()\r\nfor i in range(n):\r\n for j in range(m):\r\n if (keyboard[i][j] == 'S'):\r\n shift_keys.append((i,j))\r\n else:\r\n cost[keyboard[i][j]] = 0\r\n\r\nif (len(shift_keys) > 0):\r\n for i in range(n):\r\n for j in range(m):\r\n if (keyboard[i][j] != 'S'):\r\n distance = min((i-si)**2 + (j-sj)**2 for (si,sj) in shift_keys)\r\n letter = keyboard[i][j].upper()\r\n if (distance <= x**2):\r\n cost[letter] = 0\r\n elif (letter not in cost):\r\n cost[letter] = 1\r\n\r\nresult = 0\r\nfor letter in text:\r\n if letter not in cost:\r\n print(-1)\r\n exit()\r\n else:\r\n result += cost[letter]\r\n\r\nprint(result)", "import string;alllet=string.ascii_lowercase\r\nrow,col,dis=list(map(int,input().split()));arr=[];S=[];set1=set();c=0;dic={};pos={}\r\nfor i in alllet:\r\n pos.setdefault(i,[])\r\nfor i in range(row):\r\n x=input()\r\n for j in range(col):\r\n if x[j]==\"S\": S.append([i,j])\r\n else:pos[x[j]]=pos[x[j]]+[[i,j]]\r\n \r\n arr.append(list(x))\r\n x=set(x)\r\n set1=set1|x\r\n \r\nif len(S)>0:\r\n for i in pos:\r\n cond=False\r\n if len(pos[i])>0:\r\n for j in pos[i]:\r\n for h in S:\r\n if abs(j[0]-h[0])**2+abs(j[1]-h[1])**2<=dis**2:\r\n dic[i]=True ; cond=True;break\r\n if cond:break\r\n else:dic[i]=False\r\nq=int(input());str1=input()\r\nfor i in str1:\r\n if len(pos[i.lower()])==0:print(-1);break\r\n elif i.isupper() and len(S)==0:print(-1);break\r\n elif i.isupper() and len(S)>0:\r\n if dic[i.lower()]:\r\n continue\r\n else:c+=1\r\nelse:\r\n print(c)", "from collections import defaultdict\r\nfrom math import inf\r\n\r\nn, m, x = list(map(int, input().split()))\r\nkeyboard, shift = [], set()\r\nfor i in range(n):\r\n ip = input()\r\n line = [x for x in ip]\r\n for j in range(m):\r\n if ip[j] == 'S':\r\n shift.add((i, j))\r\n keyboard.append(line)\r\n\r\nq = int(input())\r\ntext = input()\r\n\r\n# distance of each letters\r\ndistance = defaultdict(lambda: inf)\r\nreachable = set()\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = keyboard[i][j]\r\n if letter == 'S':\r\n continue\r\n upper = letter.upper()\r\n reachable.add(letter)\r\n if shift:\r\n reachable.add(upper)\r\n for sh in shift:\r\n a, b = sh\r\n distance[upper] = min(distance[upper], (i - a)**2 + (j - b)**2)\r\n\r\n# letters reachable using one hand\r\nusing_one_hand = set()\r\nfor i in range(n):\r\n for j in range(m):\r\n letter = keyboard[i][j]\r\n if letter == 'S':\r\n continue\r\n upper = letter.upper()\r\n using_one_hand.add(letter)\r\n if distance[upper] <= x * x:\r\n using_one_hand.add(upper)\r\n\r\nans = 0\r\nfor letter in text:\r\n if letter not in reachable:\r\n ans = -1\r\n break\r\n else:\r\n if letter not in using_one_hand:\r\n ans += 1\r\nprint(ans)\r\n", "# https://codeforces.com/contest/88/problem/B\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nimport math\r\n\r\nn, m, x = multi_integer()\r\nalpha_dict = dict()\r\nshift_list = list()\r\nnear_to_shift = set()\r\ntotal_letters = set()\r\n\r\nfor i in range(n):\r\n for j, key in enumerate(string(), start=0):\r\n if key == \"S\":\r\n shift_list.append((i, j))\r\n else:\r\n total_letters.add(key)\r\n alpha_dict[(i, j)] = key\r\nq = single_integer()\r\ns = string()\r\n\r\nfor k, v in alpha_dict.items():\r\n if v not in near_to_shift:\r\n for i in shift_list:\r\n if math.sqrt((i[0] - k[0]) ** 2 + (i[1] - k[1]) ** 2) <= x:\r\n near_to_shift.add(v)\r\n break\r\nans = 0\r\n\r\nfor i in s:\r\n if i.lower() not in total_letters:\r\n print(-1)\r\n break\r\n\r\n if not shift_list and i.isupper():\r\n print(-1)\r\n break\r\n if i.isupper():\r\n if i.lower() not in near_to_shift:\r\n ans += 1\r\n\r\nelse:\r\n print(ans)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque\r\n\r\nN,M,X = map(int, input().split())\r\nA = []\r\nfor _ in range(N):\r\n A.append(input())\r\ninput()\r\nS = input()\r\n\r\nv = []\r\nkeyboard = {}\r\nfor i in range(N):\r\n for j in range(M):\r\n if A[i][j]=='S':\r\n v.append((i,j))\r\n else:\r\n keyboard[A[i][j]] = 0\r\n\r\nfor y,x in v:\r\n for i in range(N):\r\n for j in range(M):\r\n if A[i][j]=='S':continue\r\n t = abs(i-y)**2+abs(j-x)**2\r\n key = A[i][j].upper()\r\n if key in keyboard.keys():\r\n keyboard[key] = min(keyboard[key], t)\r\n else:\r\n keyboard[key] = t\r\n \r\n#print(keyboard)\r\nans = 0\r\nfor c in S:\r\n if not c in keyboard.keys():\r\n exit(print(-1))\r\n if keyboard[c]>X*X:\r\n ans+=1\r\n #print(c,keyboard[c])\r\n \r\nprint(ans)\r\n\r\n", "numbers = list(map(int, input().split()))\r\nrow = numbers[0]\r\ncolumn = numbers[1]\r\ndis = numbers[2]\r\ns_index = {}\r\nletter_index = {}\r\nwords = []\r\ndef Euclidean (arr1 , arr2) :\r\n x = abs(arr1[0] - arr2[0])\r\n y = abs(arr1[1] - arr2[1])\r\n z = (y**2 + x**2)**0.5\r\n z = round(z , 2)\r\n return z\r\nfor i in range(0 , row ) :\r\n x = input()\r\n words.append(x)\r\nfor i in range (0 , row):\r\n for j in range(0 , column) :\r\n if words[i][j] == \"S\" :\r\n s_index[f\"{len(s_index)}\"] = [i , j]\r\nfor i in range(0 , row):\r\n for j in range(0 , column):\r\n if words[i][j] == \"S\" :\r\n continue\r\n x = float('inf')\r\n for z in range (0 , len(s_index)):\r\n y = Euclidean(s_index[f'{z}'] , [i , j])\r\n if y < x :\r\n x = y\r\n if not f\"{words[i][j].lower()}\" in letter_index.keys() :\r\n letter_index[f\"{words[i][j].lower()}\"] = x\r\n else:\r\n if letter_index[f\"{words[i][j].lower()}\"] > x :\r\n letter_index[f\"{words[i][j].lower()}\"] = x\r\n\r\nnumber_of_word = int(input())\r\nword = input()\r\nstop = 0\r\ncounter = 0\r\nfor i in range(0, number_of_word):\r\n l = word[i]\r\n if not f\"{word[i].lower()}\" in letter_index:\r\n stop = 1\r\n break\r\n elif word[i].isupper() == True and len(s_index) == 0:\r\n stop = 1\r\n break\r\n elif word[i].isupper() == 1:\r\n if letter_index[f'{word[i].lower()}'] > dis :\r\n counter += 1\r\n\r\nif stop == 1 :\r\n print(-1)\r\nelse :\r\n print(counter)\r\n", "from math import sqrt\r\nn, m, x = map(int, input().split())\r\n\r\nkb = []\r\nfor i in range(n):\r\n kb.append(input())\r\n\r\nshifts = False\r\nsh = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if kb[i][j] == 'S':\r\n shifts = True\r\n sh.append((i, j))\r\n\r\nlookup = dict()\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if shifts:\r\n for k in sh:\r\n a, b = k\r\n if kb[i][j] in lookup:\r\n lookup[kb[i][j]] = min(sqrt((i - a)**2 + (j - b)**2), lookup[kb[i][j]])\r\n else:\r\n lookup[kb[i][j]] = sqrt((i - a) ** 2 + (j - b) ** 2)\r\n else:\r\n lookup[kb[i][j]] = True\r\n\r\nn = int(input())\r\ns = input()\r\n#print(lookup)\r\n\r\ncount = 0\r\nfor i in s:\r\n if i == i.upper() and not shifts:\r\n print(-1)\r\n exit(0)\r\n elif i == i.upper() and shifts:\r\n if i.lower() not in lookup:\r\n print(-1)\r\n exit(0)\r\n else:\r\n if lookup[i.lower()] > x:\r\n count +=1\r\n elif i in lookup:\r\n pass\r\n else:\r\n print(-1)\r\n exit(0)\r\nprint(count)\r\n\r\n", "n, m, x = list(map(int, input().split()))\r\nkeyboard = []\r\nhas_s = False\r\ndistance = {}\r\nfor _ in range(n):\r\n row = list(input())\r\n for i in row:\r\n if i != 'S':\r\n distance[i] = 1\r\n keyboard.append(row)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if keyboard[i][j] == 'S':\r\n has_s = True\r\n for l in range(n):\r\n for w in range(m):\r\n if abs(i - l) ** 2 + abs(j - w) ** 2 > x ** 2:\r\n pass\r\n elif keyboard[l][w] == 'S':\r\n pass\r\n else:\r\n distance[keyboard[l][w]] = 0\r\n\r\nq = int(input())\r\nt = list(input())\r\nre = 0\r\nfor i in t:\r\n if i.lower() not in distance:\r\n re = -1\r\n break\r\n if i.lower() != i:\r\n if has_s:\r\n re += distance[i.lower()]\r\n else:\r\n re = -1\r\n break\r\nprint(re)", "from math import sqrt\nfrom tracemalloc import start\n\nn,m,x = map(int,input().split())\nkeyboard_dict = {}\nkeyboard = []\nshifts = False\nfor i in range(n):\n row = input()\n keyboard.append(row)\n for j in range(m):\n c = row[j]\n if c != 'S':\n keyboard_dict[c] = 1\n else:\n shifts =True\n# print(keyboard_dict)\n# print('-'*100)\nfor i in range(n):\n for j in range(m):\n c = keyboard[i][j]\n if c == 'S':\n starti = i -x \n startj = j-x\n if starti < 0 :\n starti = 0\n if startj < 0 :\n startj = 0\n endi = i +x \n endj = j+x\n if endi > n-1 :\n endi = n-1\n if endj > m-1 :\n endj = m-1\n for ii in range(starti,endi+1):\n for jj in range(startj,endj+1):\n if keyboard[ii][jj] == 'S':\n continue\n if sqrt((i-ii)**2+(j-jj)**2) <=x:\n keyboard_dict[keyboard[ii][jj]] = 2\n\nm = int(input())\ntext = input()\nres = 0\nfor t in text :\n r = keyboard_dict.get(t.lower(),0)\n if r == 0 :\n res = -1\n break\n if t.isupper():\n if not shifts :\n res = -1\n break\n if r ==2 :\n continue\n res +=1\nprint(res)\n\n", "from math import *\r\n\r\n\r\ndef euclidian(x1, x2, y1, y2):\r\n return sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\r\n\r\n\r\ndic = dict()\r\nn, m, x = map(int, input().split())\r\nfor i in range(n):\r\n a = input()\r\n for j in range(m):\r\n if a[j] not in dic:\r\n dic[a[j]] = []\r\n dic[a[j]].append([i, j])\r\nq, t = int(input()), input()\r\ndic2 = dict()\r\nans = 0\r\nfor i in t:\r\n if i.islower():\r\n if i not in dic:\r\n exit(print(-1))\r\n else:\r\n if i.lower() not in dic or 'S' not in dic:\r\n exit(print(-1))\r\n else:\r\n chr, mi = i.lower(), inf\r\n if chr in dic2:\r\n ans += int(dic2[chr])\r\n else:\r\n for j in dic['S']:\r\n for l in dic[chr]:\r\n mi = min(mi, euclidian(j[0], l[0], j[1], l[1]))\r\n if mi > x:\r\n ans += 1\r\n dic2[chr] = mi > x\r\nprint(ans)\r\n", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n n, m, x = map(int, sys.stdin.readline().split())\r\n f = [str(sys.stdin.readline()[0:-1]) for i in range(n)]\r\n\r\n S_pos = []\r\n have = set()\r\n have_shift = False\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if f[i][j] == \"S\":\r\n have_shift = True\r\n S_pos.append([i, j])\r\n else:\r\n have.add(f[i][j])\r\n\r\n al = \"qwertyuiopasdfghjklzxcvbnm\"\r\n M = {u: 0 for u in al}\r\n\r\n for u in al:\r\n U_pos = []\r\n for i in range(n):\r\n for j in range(m):\r\n if f[i][j] == u:\r\n U_pos.append([i, j])\r\n if U_pos == []:\r\n M[u] = -1\r\n else:\r\n flag = False\r\n for x1, y1 in U_pos:\r\n for x2, y2 in S_pos:\r\n if (x1 - x2) ** 2 + (y1 - y2) ** 2 <= x ** 2:\r\n flag = True\r\n break\r\n if not flag:\r\n M[u] = 1\r\n\r\n q = int(sys.stdin.readline())\r\n s = str(sys.stdin.readline())[0:-1]\r\n\r\n res = 0\r\n for i in s:\r\n if i == i.upper():\r\n if have_shift == False:\r\n print(-1)\r\n return\r\n if M[i.lower()] == -1:\r\n print(-1)\r\n return\r\n else:\r\n res += M[i.lower()]\r\n else:\r\n if i not in have:\r\n print(-1)\r\n return\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 == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "# Parse input\r\nn, m, x = map(int, input().split())\r\nkeyboard = [input() for _ in range(n)]\r\nq = int(input())\r\ntext = input()\r\n\r\n# Create a dictionary mapping lowercase letters to their coordinates\r\nletter_coordinates = {}\r\nshift_coordinates = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if keyboard[i][j] != 'S':\r\n if letter_coordinates.get(keyboard[i][j]):\r\n letter_coordinates[keyboard[i][j]].append((i, j))\r\n else:\r\n letter_coordinates[keyboard[i][j]] = [(i, j)]\r\n else:\r\n shift_coordinates.append((i,j))\r\nif shift_coordinates:\r\n for i in letter_coordinates:\r\n min_d = (shift_coordinates[0][0] - letter_coordinates[i][0][0])**2 + (shift_coordinates[0][1] - letter_coordinates[i][0][1])**2\r\n min_d = min_d**(0.5)\r\n for j in shift_coordinates:\r\n for k in letter_coordinates[i]:\r\n d = (j[0] - k[0])**2 + (j[1] - k[1])**2\r\n d = d**(0.5)\r\n if d<min_d:\r\n min_d = d\r\n letter_coordinates[i] = min_d\r\n count = 0\r\n for t in text:\r\n if letter_coordinates.get(t.lower()):\r\n if t.lower() == t:\r\n continue\r\n else:\r\n if letter_coordinates[t.lower()] > x:\r\n count += 1\r\n else:\r\n count = -1\r\n break\r\n print(count)\r\nelse:\r\n c = 0\r\n for t in text:\r\n if not letter_coordinates.get(t):\r\n c = -1\r\n break\r\n print(c)\r\n", "from collections import defaultdict\r\n\r\ndef solve(i,j):\r\n if len(shift) == 0:\r\n return False\r\n for values in shift:\r\n dist = (values[0] - i)**2 + (values[1] - j)**2\r\n if dist<=(x**2):\r\n return True\r\n return False \r\n\r\nif __name__ == \"__main__\":\r\n global x\r\n n,m,x = map(int,input().split())\r\n key = []\r\n n_ = n\r\n possible = {}\r\n global shift\r\n shift = []\r\n bag = defaultdict(list)\r\n while n_:\r\n key.append(input())\r\n n_ -= 1\r\n for i in range(n):\r\n for j in range(m):\r\n if key[i][j] == 'S':\r\n shift.append([i,j])\r\n else:\r\n bag[ord(key[i][j]) - ord('a')].append([i,j])\r\n for key,value in bag.items():\r\n for info in value:\r\n if (key not in possible) or (possible[key] == False):\r\n possible[key] = solve(info[0],info[1])\r\n if possible[key] == True:\r\n break\r\n length = int(input())\r\n text = input()\r\n hands = 0 \r\n for i in range(length):\r\n if text[i].islower():\r\n if ord(text[i]) - ord('a') not in bag:\r\n print(-1)\r\n exit(0)\r\n else:\r\n num = ord(text[i].lower()) - ord('a')\r\n if len(shift) == 0 or num not in bag:\r\n print(-1)\r\n exit(0)\r\n if num in possible and possible[num] == False:\r\n hands += 1\r\n print(hands) \r\n\r\n\r\n\r\n", "n, m, x = map(int, input().split())\r\nx = x**2\r\n\r\nkeyboard = []\r\nkkeys = {}\r\nfor i in range(n):\r\n row = list(input())\r\n for j in range(m):\r\n c = row[j]\r\n\r\n if c not in kkeys:\r\n kkeys[c] = [[], 51**2]\r\n kkeys[c][0].append([i, j])\r\n\r\nif 'S' in kkeys:\r\n keys_list = kkeys.keys()\r\n\r\n for k in keys_list:\r\n if k == 'S':\r\n continue\r\n for k_pos in kkeys[k][0]:\r\n for s_pos in kkeys['S'][0]:\r\n dist = (k_pos[0]-s_pos[0])**2+(k_pos[1]-s_pos[1])**2\r\n kkeys[k][1] = min(kkeys[k][1], dist)\r\n\r\nq = int(input())\r\nT = input()\r\n\r\nsol = 0\r\nfor i in range(q):\r\n l = str(T[i])\r\n\r\n if l.lower() not in kkeys:\r\n sol = -1\r\n break\r\n\r\n if l.isupper():\r\n if 'S' not in kkeys:\r\n sol = -1\r\n break\r\n else:\r\n if kkeys[l.lower()][1] > x:\r\n sol += 1\r\nprint(sol)\r\n", "import math\r\ndef solution():\r\n\tcache = {}\r\n\tans = 0\r\n\tfor _t in t:\r\n\t\tif _t in cache:\r\n\t\t\tans +=0 if cache[_t] else 1\r\n\t\telse:\r\n\t\t\tif _t.lower() == _t:\r\n\t\t\t\tif _t not in board:\r\n\t\t\t\t\treturn -1\r\n\t\t\t\tcache[_t] =\tTrue\r\n\t\t\telse:\r\n\t\t\t\tif len(shifts) == 0:\r\n\t\t\t\t\treturn -1\r\n\r\n\t\t\t\tlt = _t.lower()\r\n\t\t\t\tif lt not in board:\r\n\t\t\t\t\treturn -1\r\n\t\t\t\telse:\r\n\t\t\t\t\tfound \t=\tFalse\r\n\t\t\t\t\tfor posi,posj in board[lt]:\r\n\t\t\t\t\t\tif found:\r\n\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\t\tfor si,sj in shifts:\r\n\t\t\t\t\t\t\tdis = math.sqrt(((si-posi)*(si-posi))+((sj-posj)*(sj-posj))) \r\n\t\t\t\t\t\t\tif dis <=x:\r\n\t\t\t\t\t\t\t\tfound = True\r\n\t\t\t\t\t\t\t\tbreak\r\n\r\n\t\t\t\t\tcache[_t] =\tfound\r\n\t\t\t\t\tif not(found):\r\n\t\t\t\t\t\tans\t+=\t1 \r\n\treturn ans\r\n\r\nn,m,x = [int(x) for x in input().split(' ')]\r\nboard = {}\r\nshifts = []\r\nfor i in range(n):\r\n\tline = list(input())\r\n\tindex = -1\r\n\tfor c in line:\r\n\t\tindex +=1\r\n\t\tif 'S' == c:\r\n\t\t\tshifts.append((i,index))\r\n\t\telse:\r\n\t\t\tif c not in board:\r\n\t\t\t\tboard[c] = [(i,index)]\r\n\t\t\telse:\r\n\t\t\t\tboard[c].append((i,index))\r\nq = int(input())\r\nt = tuple(input())\r\nprint(solution())", "#bisect.bisect_left(a, x, lo=0, hi=len(a)) is the analog of std::lower_bound()\r\n#bisect.bisect_right(a, x, lo=0, hi=len(a)) is the analog of std::upper_bound()\r\n#from heapq import heappop,heappush,heapify #heappop(hq), heapify(list)\r\n#from collections import deque as dq #deque e.g. myqueue=dq(list)\r\n#append/appendleft/appendright/pop/popleft\r\n#from bisect import bisect as bis #a=[1,3,4,6,7,8] #bis(a,5)-->3\r\n#import bisect #bisect.bisect_left(a,4)-->2 #bisect.bisect(a,4)-->3\r\n#import statistics as stat # stat.median(a), mode, mean\r\n#from itertools import permutations(p,r)#combinations(p,r)\r\n#combinations(p,r) gives r-length tuples #combinations_with_replacement\r\n#every element can be repeated\r\n \r\nimport sys, threading\r\nimport math\r\nimport time\r\nfrom os import path\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import *\r\nfrom string import ascii_lowercase\r\nfrom functools import cmp_to_key\r\nimport heapq\r\n \r\n \r\n# # # # # # # # # # # # # # # #\r\n# JAI SHREE RAM #\r\n# # # # # # # # # # # # # # # #\r\n \r\n \r\ndef lcm(a, b):\r\n return (a*b)//(math.gcd(a,b))\r\n \r\n \r\nsi= lambda:str(input())\r\nii = lambda: int(input())\r\nmii = lambda: map(int, input().split())\r\nlmii = lambda: list(map(int, input().split()))\r\ni2c = lambda n: chr(ord('a') + n)\r\nc2i = lambda c: ord(c) - ord('a')\r\nalphs = \"abcdefghijklmnopqrstuvwxyz\"\r\n \r\n \r\ndef solve():\r\n n,m,k=mii()\r\n #x is the euclidean distance\r\n #n rows\r\n #m cols\r\n keyboard = [si() for x in range(n)]\r\n q=ii()\r\n string=si()\r\n\r\n map={}\r\n shifts=[]\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if keyboard[i][j]==\"S\":\r\n shifts.append([i,j])\r\n\r\n Capitalize ={}\r\n\r\n for alph in alphs:\r\n Capitalize[alph]=False\r\n \r\n for i in range(n):\r\n for j in range(m):\r\n now=keyboard[i][j]\r\n if now==\"S\": continue\r\n map[now]=True\r\n\r\n for y in shifts:\r\n if (i-y[0])**2+(j-y[1])**2<=k**2:\r\n Capitalize[now]=True\r\n break\r\n count=0\r\n for j in string:\r\n if map.get(j.lower())==None:\r\n return -1\r\n if j!=j.lower():\r\n if len(shifts)==0:\r\n return -1\r\n if Capitalize[j.lower()]==False:\r\n count+=1\r\n return(count)\r\n\r\n\r\n\r\ndef main():\r\n\r\n z=solve()\r\n print(z)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n \r\n \r\n\r\n\r\n", "import sys\r\nimport math\r\nfrom typing import Callable\r\nfrom collections import defaultdict\r\n\r\ndef euclidean_distance(x1, y1, x2, y2) -> float:\r\n return math.hypot(x1 - x2, y1 - y2)\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n rows, cols, x = (int(i) for i in read().split())\r\n shifts: list[tuple[int, int]] = []\r\n d: dict[str, list[tuple[int, int]]] = defaultdict(list)\r\n requires_two_hand: dict[str, bool] = dict()\r\n for r in range(rows):\r\n keys = read().strip()\r\n for c in range(len(keys)):\r\n letter = keys[c]\r\n d[letter].append((r, c))\r\n if letter == 'S':\r\n shifts.append((r, c))\r\n txt = read()\r\n\r\n words: str = read().strip()\r\n total = 0\r\n for c in words:\r\n # if c == 'S':\r\n # # continue\r\n if c.islower():\r\n if c not in d:\r\n print(-1)\r\n return\r\n if c.isupper():\r\n lower_c = c.lower()\r\n # If not in memo and uppercase, compute\r\n if c not in requires_two_hand:\r\n if lower_c not in d:\r\n print(-1)\r\n return\r\n min_distance = float('inf')\r\n requires_two_hand[c] = True\r\n for coord in d[lower_c]:\r\n if not requires_two_hand[c]:\r\n break\r\n if not shifts:\r\n print(-1)\r\n return\r\n for shift in shifts:\r\n min_distance = min(min_distance, euclidean_distance(coord[0], coord[1], shift[0], shift[1]))\r\n # Stop when first found\r\n if min_distance <= x:\r\n requires_two_hand[c] = False\r\n break\r\n\r\n if requires_two_hand[c]:\r\n total += 1\r\n print(total)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n, m, x = map(int, input().split())\r\nx = x**2\r\n \r\nkeyboard = []\r\nkeys = {}\r\nfor i in range(n):\r\n row = list(input())\r\n for j in range(m):\r\n c = row[j]\r\n \r\n if c not in keys:\r\n keys[c] = [[], 51**2]\r\n keys[c][0].append([i, j])\r\n#print(keys)\r\n \r\nif 'S' in keys:\r\n keys_list = keys.keys()\r\n \r\n for k in keys_list:\r\n if k == 'S':\r\n continue\r\n for k_pos in keys[k][0]:\r\n for s_pos in keys['S'][0]:\r\n dist = (k_pos[0]-s_pos[0])**2+(k_pos[1]-s_pos[1])**2\r\n keys[k][1] = min(keys[k][1], dist)\r\n #print(dist)\r\n \r\n\r\n \r\nq = int(input())\r\nT = input()\r\n \r\nsol = 0\r\nfor i in range(q):\r\n l = str(T[i])\r\n \r\n if l.lower() not in keys:\r\n sol = -1\r\n break\r\n #print(l)\r\n \r\n if l.isupper():\r\n if 'S' not in keys:\r\n sol = -1\r\n break\r\n else:\r\n if keys[l.lower()][1] > x:\r\n sol += 1\r\nprint(sol)", "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, m, x = read_tuple(int)\r\n keyboard = []\r\n symbols = {}\r\n for _ in range(n):\r\n keyboard.append(list(input().replace('\\n', '')))\r\n for k in keyboard[-1]:\r\n symbols[k] = True\r\n symbols[f'{k}_shifted'] = None\r\n if 'S' in symbols:\r\n symbols.pop('S')\r\n for i in range(n):\r\n for j in range(m):\r\n curr = keyboard[i][j]\r\n if curr != 'S':\r\n for k in range(n):\r\n for l in range(m):\r\n if keyboard[k][l] == 'S':\r\n dist = (i - k) ** 2 + (j - l) ** 2 <= x ** 2\r\n if symbols[f'{curr}_shifted'] == None:\r\n symbols[f'{curr}_shifted'] = dist\r\n else:\r\n symbols[f'{curr}_shifted'] = max(symbols[f'{curr}_shifted'], dist)\r\n ans_exist = True\r\n ans = 0\r\n q = int(input())\r\n string = input().replace('\\n', '')\r\n for char in string:\r\n if char in symbols:\r\n pass\r\n elif f'{char.lower()}_shifted' in symbols:\r\n if symbols[f'{char.lower()}_shifted'] == None:\r\n ans_exist = False\r\n elif symbols[f'{char.lower()}_shifted'] == False:\r\n ans += 1\r\n else:\r\n ans_exist = False\r\n if ans_exist:\r\n print(ans)\r\n else:\r\n print(-1)\r\n \r\n \r\nif __name__ == '__main__':\r\n solve()", "import sys\n\ndef m(x1, y1, x2, y2):\n return ((x1 - x2)**2 + (y1 - y2)**2)**0.5\n\ndef main(mat, x, q):\n S = []\n a = set()\n for i in range(len(mat)):\n for j in range(len(mat[i])):\n if mat[i][j] == 'S':\n S.append((i + 0.5, j + 0.5))\n else:\n a.add(mat[i][j])\n\n\n c = {}\n if S:\n for i in range(len(mat)):\n for j in range(len(mat[i])):\n if mat[i][j] == 'S':\n continue\n\n mm = float(\"inf\")\n for ll, rr in S:\n mm = min(mm, m(ll, rr, i + 0.5, j + 0.5))\n\n c[mat[i][j]] = min(c.get(mat[i][j], float(\"inf\")), mm)\n\n t = 0\n for k in q:\n if k.lower() not in a:\n print(-1)\n return\n elif k.isupper():\n k = k.lower()\n if k not in c:\n print(-1)\n return\n elif c[k] > x:\n # Want to type this, but dist too great.\n t += 1\n print(t)\n\nif __name__ == \"__main__\":\n mat = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n n, _, x = map(int, line.strip().split())\n continue\n\n if n > 0:\n mat.append(line.strip())\n n -= 1\n elif n == 0:\n n -= 1\n continue\n else:\n q = line.strip()\n main(mat, x, q)\n", "import math\nn, m, x = map(int, input().split())\n\nK = []\np_S = set()\nfor i in range(n):\n r = input()\n K.append(r)\n for j in range(m):\n if r[j] == \"S\":\n p_S.add((i, j))\n\nD = dict()\n\ndef cal_distance(p1, p2):\n i1, j1 = p1\n i2, j2 = p2\n x = j2 - j1\n y = i2 - i1\n return math.sqrt(abs(x)**2 + abs(y)**2)\n\n\nfor i in range(n):\n for j in range(m):\n if (i, j) in p_S: continue\n D[K[i][j]] = 0\n upper_key = K[i][j].upper() \n min_distance = D.get(upper_key, float(\"inf\"))\n for S in p_S:\n min_distance = min(min_distance, cal_distance((i, j), S))\n D[upper_key] = min_distance\n\nq = int(input())\nT = input()\n\ncnt = 0\nfor t in T:\n if D.get(t, float(\"inf\")) == float(\"inf\"): \n print(-1)\n exit()\n elif t in D and D[t] > x:\n cnt += 1\nprint(cnt)\n\n\n\n \n \n \n", "from math import sqrt\r\n\r\n\r\ndef T(): return int(input())\r\ndef V(): return map(int, input().split())\r\ndef L(): return list(map(int, input().split()))\r\n\r\n\r\ndef find_all(a_str, sub):\r\n start = 0\r\n while True:\r\n start = a_str.find(sub, start)\r\n if start == -1:\r\n return\r\n yield start\r\n start += len(sub)\r\n\r\ndef solve():\r\n alphabet = {}\r\n n, m, x = V()\r\n keyboard = []\r\n shifts = []\r\n for i in range(n):\r\n line = input()\r\n keyboard.append(line)\r\n indec = list(find_all(line,'S'))\r\n for j in indec:\r\n shifts.append([i, j])\r\n for i in range(n):\r\n for j in range(m):\r\n minDist = 10000\r\n for s in shifts:\r\n a = abs(i-s[0])\r\n b = abs(j-s[1])\r\n dist = abs(a-b)+min(a,b)*sqrt(2)\r\n if dist < minDist:\r\n minDist = dist\r\n if (keyboard[i][j] not in alphabet.keys()):\r\n alphabet[keyboard[i][j]] = minDist\r\n else:\r\n if minDist < alphabet[keyboard[i][j]]:\r\n alphabet[keyboard[i][j]] = minDist\r\n \r\n T() \r\n text = input()\r\n res = 0\r\n for i in text:\r\n if (shifts == [] and i.isupper()):\r\n print(-1)\r\n return\r\n elif i.lower() not in alphabet.keys():\r\n print(-1)\r\n return\r\n elif (i.isupper() and alphabet[i.lower()] > x):\r\n res += 1\r\n else: \r\n continue\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, x = map(int, input().split())\r\ns = []\r\nfor _ in range(n):\r\n s0 = list(input().rstrip())\r\n for i in s0:\r\n s.append(i)\r\ninf = pow(10, 9) + 1\r\ndist = [inf] * 150\r\nfor u in range(n * m):\r\n su = s[u]\r\n if su ^ ord(\"S\"):\r\n dist[su] = 0\r\n continue\r\n i, j = u % m, u // m\r\n for v in range(n * m):\r\n sv = s[v]\r\n if not sv ^ ord(\"S\"):\r\n continue\r\n d = pow(abs(i - v % m), 2) + pow(abs(j - v // m), 2)\r\n dist[sv - 32] = min(dist[sv - 32], d)\r\nx *= x\r\nx += 1\r\nfor i in range(150):\r\n if dist[i] ^ inf:\r\n dist[i] = min(1, dist[i] // x)\r\nq = int(input())\r\nt = list(input().rstrip())\r\nans = 0\r\nfor i in t:\r\n ans += dist[i]\r\n if ans >= inf:\r\n ans = -1\r\n break\r\nprint(ans)", "import math\r\n\r\na, b, ch = ([int(x) for x in input().split()])\r\nl1=[]\r\nls=[]\r\nfor j in range(a):\r\n g=input()\r\n l1.append(g)\r\n if 'S' in g:\r\n # print(\"h\")\r\n for k in range(len(g)):\r\n if (g[k]=='S'):\r\n ls.append([j,k])\r\n# print(ls)\r\nl2=[100000 for j in range(30)]\r\ndef dis(a,b,x,y):\r\n c=(a-x)**2\r\n d=(b-y)**2\r\n e=c+d\r\n return e**0.5\r\n\r\nfor j in range(len(ls)):\r\n q,w=ls[j][0],ls[j][1]\r\n for k in range(a):\r\n for p in range(b):\r\n if l1[k][p]!='S':\r\n c=ord(l1[k][p])-96\r\n d=dis(k,p,q,w)\r\n l2[c]=min(l2[c],d)\r\n# print(l2)\r\nn=int(input())\r\ne=input()\r\n\r\ncka=0\r\nflag=True\r\nfor i in e:\r\n if \"A\"<=i<=\"Z\":\r\n cka+=1\r\n i=i.lower()\r\n hj=0\r\n for p in range(a):\r\n if i not in l1[p]:\r\n hj+=1\r\n\r\n if hj==a:\r\n flag=False\r\n break\r\n\r\nif not flag:\r\n print(-1)\r\nelse:\r\n if len(ls) == 0:\r\n if cka > 0:\r\n print(-1)\r\n else:\r\n print(0)\r\n else:\r\n ans=0\r\n for j in e :\r\n if j.isupper():\r\n # print(j)\r\n # print(ord(j)-64,j)\r\n # print(l2[ord(j)-64])\r\n if l2[ord(j)-64]>ch:\r\n # print(j)\r\n # print(j)\r\n ans+=1\r\n # print(l2[20])\r\n print(ans)\r\n # print(ord('T')-64)\r\n\r\n\r\n", "n, m, xx = map(int, input().split())\r\ng = []\r\nkeyB = {}\r\nisS = []\r\nd = {}\r\nfor i in range(n):\r\n z = list(input())\r\n g.append(z)\r\n\r\nq = input()\r\ns = input()\r\n\r\nfor i in range(ord('a'), ord('z')+1):\r\n keyB[chr(i)] = -1\r\n keyB[chr(i).upper()] = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'S':\r\n isS += [(i, j)]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n ltr = g[i][j]\r\n if ltr.islower():\r\n keyB[ltr] = 0\r\n ltr = ltr.upper()\r\n if keyB[ltr] < 0 and len(isS) > 0:\r\n keyB[ltr] = 1\r\n for (x, y) in isS:\r\n dist = ((x-i)**2 + (y-j)**2)**.5\r\n #print(\"for {} dist is {} and given x is {}\".format(ltr, dist, x))\r\n if dist <= xx:\r\n keyB[ltr] = 0\r\n break\r\n# print(keyB)\r\n# isS.sort()\r\n# print(isS)\r\n# print(keyB)\r\ncount = 0\r\nfor i in s:\r\n if keyB[i] == -1:\r\n print(-1)\r\n break\r\n else:\r\n count += keyB[i]\r\nelse:\r\n print(count)\r\n", "import math\r\n\r\nn, m, x = map(int, input().split())\r\n\r\nkeys = dict()\r\nposKeys = []\r\na = []\r\n\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'S':\r\n posKeys.append((i,j))\r\n else:\r\n keys[a[i][j]] = 0\r\n\r\nif len(posKeys)>0:\r\n for i in range(n):\r\n for j in range(m):\r\n if a[i][j] != 'S':\r\n letter = a[i][j].upper()\r\n dis = min((i-si)**2 + (j-sj)**2 for si, sj in posKeys)\r\n if dis <= x**2:\r\n keys[letter] = 0\r\n elif letter not in keys:\r\n keys[letter] = 1\r\n \r\n\r\n\r\n\r\n\r\n\r\nq = int(input())\r\ntext = input()\r\nres = 0\r\n\r\nfor i in range(q):\r\n if text[i] not in keys:\r\n print(-1)\r\n exit()\r\n else: \r\n res += keys[text[i]]\r\n\r\nprint(res)\r\n\r\n\r\n", "import string\r\n\r\nr_count, k_in_row, max_dis = map(int, input().split())\r\nkeyboard = {}\r\nfor i in range(r_count):\r\n row = input()\r\n for j, char in enumerate(row):\r\n if not keyboard.get(char):\r\n keyboard[char] = []\r\n keyboard[char].append((i, j))\r\nquery_size = input() # Useless\r\n\r\nword = input()\r\nused_letters = set(word)\r\nfor letter in used_letters:\r\n if not keyboard.get(letter.lower()) or (letter.isupper() and not keyboard.get('S')):\r\n print(-1)\r\n exit(0)\r\n\r\nupper_letters = [letter for letter in used_letters if letter.isupper()]\r\n\r\nother_hand = 0\r\nfor char in upper_letters:\r\n for location in keyboard[char.lower()]:\r\n y1, x1 = location\r\n if any([pow(pow(abs(y2 - y1), 2) + pow(abs(x2 - x1), 2), 0.5) <= max_dis for y2, x2 in keyboard['S']]):\r\n break\r\n else:\r\n other_hand += word.count(char)\r\n\r\nprint(other_hand)\r\n", "def dist(x1, y1, x2, y2):\r\n\treturn ((x1 - x2) * (x1 - x2) + (y1 - y2) * (y1 - y2)) ** 0.5\r\n\r\n\r\nn, m, x = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n\ta.append([])\r\n\ts = input()\r\n\tfor j in s:\r\n\t\ta[i].append(j)\r\nq = int(input())\r\ns1 = input()\r\nqm = []\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] == 'S':\r\n\t\t\tqm.append([i, j])\r\npos = {\r\n\t'a': 0,\r\n\t'b': 0,\r\n\t'c': 0,\r\n\t'd': 0,\r\n\t'e': 0,\r\n\t'f': 0,\r\n\t'g': 0,\r\n\t'h': 0,\r\n\t'i': 0,\r\n\t'j': 0,\r\n\t'k': 0,\r\n\t'l': 0,\r\n\t'm': 0,\r\n\t'n': 0,\r\n\t'o': 0,\r\n\t'p': 0,\r\n\t'q': 0,\r\n\t'r': 0,\r\n\t's': 0,\r\n\t't': 0,\r\n\t'u': 0,\r\n\t'v': 0,\r\n\t'w': 0,\r\n\t'x': 0,\r\n\t'y': 0,\r\n\t'z': 0,\r\n\t'A': 0,\r\n\t'B': 0,\r\n\t'C': 0,\r\n\t'D': 0,\r\n\t'E': 0,\r\n\t'F': 0,\r\n\t'G': 0,\r\n\t'H': 0,\r\n\t'I': 0,\r\n\t'J': 0,\r\n\t'K': 0,\r\n\t'L': 0,\r\n\t'M': 0,\r\n\t'N': 0,\r\n\t'O': 0,\r\n\t'P': 0,\r\n\t'Q': 0,\r\n\t'R': 0,\r\n\t'S': 0,\r\n\t'T': 0,\r\n\t'U': 0,\r\n\t'V': 0,\r\n\t'W': 0,\r\n\t'X': 0,\r\n\t'Y': 0,\r\n\t'Z': 0,\r\n}\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] != 'S':\r\n\t\t\tpos[a[i][j]] = 1\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif a[i][j] != 'S':\r\n\t\t\tmn = 2000000000\r\n\t\t\tfor k in range(len(qm)):\r\n\t\t\t\tif dist(i, j, qm[k][0], qm[k][1]) < mn:\r\n\t\t\t\t\tmn = dist(i, j, qm[k][0], qm[k][1])\r\n\t\t\tif mn != 2000000000:\r\n\t\t\t\tif mn > x and pos[a[i][j].upper()] != 1:\r\n\t\t\t\t\tpos[a[i][j].upper()] = 2\r\n\t\t\t\telse:\r\n\t\t\t\t\tpos[a[i][j].upper()] = 1\r\nans = 0\r\nfor i in s1:\r\n\tif pos[i] == 0:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\n\telif pos[i] == 2:\r\n\t\tans += 1\r\nprint(ans)\r\n", "import math\n\n\ndef shift_key_test(arr, dictionary, distance, row, column):\n arr_dict = {}\n if dictionary.get(\"S\") is not None:\n for a, b in dictionary.get(\"S\"):\n upper_limit = b - distance\n lower_limit = b + distance\n if upper_limit < 0:\n upper_limit = 0\n if lower_limit >= row:\n lower_limit = row - 1\n left, right = a-1, a\n access_right, access_left = 1, 1\n while True:\n if (math.sqrt((right - a)**2 + (upper_limit - b)**2) <= distance) and (right < column) and access_right:\n if arr_dict.get(arr[upper_limit][right]) is None:\n arr_dict[arr[upper_limit][right]] = upper_limit\n else:\n access_right = 0\n if (math.sqrt((left - a)**2 + (upper_limit - b)**2) <= distance) and (left >= 0) and access_left:\n if arr_dict.get(arr[upper_limit][left]) is None:\n arr_dict[arr[upper_limit][left]] = upper_limit\n else:\n access_left = 0\n right += 1\n left -= 1\n if (not access_left) and (not access_right):\n access_left, access_right = 1, 1\n left, right = a-1, a\n upper_limit += 1\n if upper_limit > lower_limit:\n break\n return arr_dict\n\n\nstring_input = input().split(\" \")\nrows, columns, dist = int(string_input[0]), int(string_input[1]), int(string_input[2])\nkeyboard = list()\nkeyboard_dict = dict()\nfor i in range(rows):\n keyboard.append(input())\n for j in range(0, columns):\n if keyboard_dict.get(keyboard[i][j]) is not None:\n keyboard_dict[keyboard[i][j]].append((j, i))\n else:\n keyboard_dict[keyboard[i][j]] = [(j, i)]\nword_length = int(input())\nword = input()\nhand = 0\nshift_dict = shift_key_test(keyboard, keyboard_dict, dist, rows, columns)\nfor i in range(word_length):\n if keyboard_dict.get(word[i].lower()) is not None:\n if \"A\" <= word[i] <= \"Z\":\n if shift_dict.get(\"S\") is not None:\n if shift_dict.get(word[i].lower()) is None:\n hand += 1\n else:\n hand = -1\n break\n else:\n hand = -1\n break\nprint(hand)\n\n\t \t \t\t \t\t \t\t\t\t\t \t\t\t\t \t \t\t \t" ]

[ "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nl=0\r\nr=n-1\r\nprob=0\r\nwhile(l<=r):\r\n if((arr[l]==arr[r]) and (arr[l]<=k)):\r\n l+=1\r\n prob+=1\r\n elif((arr[l]>arr[r]) and (arr[r]<=k)):\r\n r-=1\r\n prob+=1\r\n elif((arr[l]<arr[r]) and (arr[l]<=k)):\r\n l+=1\r\n prob+=1\r\n else:\r\n break\r\nprint(prob)", "\r\nk,n=[int(i) for i in input().split(\" \")]\r\ntasks=[int(i) for i in input().split(\" \")]\r\nstop=False\r\ncount=0\r\nwhile((not stop) and (len(tasks)>0)):\r\n if(tasks[0]<=n):\r\n count+=1\r\n del(tasks[0])\r\n elif(tasks[-1]<=n):\r\n count+=1\r\n del(tasks[-1])\r\n else:\r\n stop=True\r\nprint(count)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nres = 0\r\nfor _ in range(n):\r\n if a[0] <= k:\r\n a = a[1:]\r\n res += 1\r\n elif a[-1] <= k:\r\n a = a[:-1]\r\n res += 1\r\nprint(res)\r\n", "n,p=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=0\r\nans=0\r\nwhile x<len(l):\r\n if p>=l[x]:\r\n l.pop(x)\r\n ans+=1\r\n else:\r\n break\r\ny=len(l)-1\r\nwhile y>0:\r\n if p>=l[y]:\r\n ans+=1\r\n l.pop(y)\r\n y-=1\r\n else:\r\n break\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n", "n, k = map(int, input().split())\r\nq = 0\r\ns = list(map(int, input().split()))\r\nfor i in range(n - 1, -1, -1):\r\n if k >= s[i]:\r\n q += 1\r\n s.pop()\r\n else:\r\n break\r\nfor i in range(len(s)):\r\n if k >= s[i]:\r\n q += 1\r\n else:\r\n break\r\nprint(q)", "# Copyright (c) 2022. Oskar \"Bocian\" Możdżeń\r\n# All rights reserved.\r\n\r\ndef solve(a):\r\n counter = 0\r\n while True:\r\n if len(a) == 0:\r\n break\r\n if k >= a[i]:\r\n a.pop(i)\r\n counter += 1\r\n else:\r\n break\r\n return counter\r\n\r\n\r\nn, k = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\ncounter = 0\r\ni = 0\r\n\r\ncounter += solve(a)\r\na.reverse()\r\ncounter += solve(a)\r\n\r\n\r\nprint(counter)\r\n", "a,b = map(int,input().split())\r\nl= [int(i) for i in input().split()]\r\n\r\nc=0\r\nwhile len(l)>0:\r\n premier = l[0]\r\n last= l[-1]\r\n if premier<=b:\r\n c+=1\r\n del l[0]\r\n elif last<=b:\r\n c+=1\r\n del l[-1]\r\n else:\r\n break\r\n\r\nprint(c)", "n, k=map(int, input().split())\r\nl=list(map(int, input().split()))\r\nc=0\r\nfor i in l:\r\n if i<=k:\r\n c+=1\r\n else:\r\n break\r\nif c<n:\r\n for i in l[::-1]:\r\n if i<=k:\r\n c+=1\r\n else:\r\n break\r\nprint(c)", "problem_mishka_can_solve=0\r\nnumber_of_problem,problem_solving_skill=map(int,input().split())\r\nproblem_difficulty=list(map(int,input().split()))\r\nreverse_problem_difficulty=problem_difficulty.copy()\r\nfor i in problem_difficulty:\r\n if problem_solving_skill>=i:\r\n problem_mishka_can_solve+=1\r\n reverse_problem_difficulty.remove(i)\r\n else:\r\n break\r\nreverse_problem_difficulty.reverse()\r\nfor j in reverse_problem_difficulty:\r\n if problem_solving_skill>=j:\r\n problem_mishka_can_solve+=1\r\n else:\r\n break\r\nprint(problem_mishka_can_solve)", "\r\nfrom sys import stdin, stdout\r\n#from math import pow\r\n#import numpy as np\r\nfrom collections import Counter\r\n\r\n\r\n# int(stdin.readline()) stdout.write(str())\r\n# stdin.readline()\r\n# map(int, stdin.readline().split())\r\n# list(map(int, stdin.readline().split()))\r\n\r\na, b = map(int, stdin.readline().split())\r\nl = list(map(int, stdin.readline().split()))\r\ncount = 0\r\nfor k in range(len(l)):\r\n if l[k]<=b:\r\n count+=1\r\n else:\r\n break\r\nl = l[::-1]\r\nfor j in range(len(l)):\r\n if l[j]<=b:\r\n count+=1\r\n else:\r\n break\r\n\r\nstdout.write(str(min(a,count)))", "r = 0\r\nch, c = 0, 0\r\nl = list(map(int, input().split()))\r\nt, k = l[0], l[1]\r\na = list(map(int, input().split()))\r\nwhile len(a) != 0:\r\n if a[0] > k:\r\n ch += 1\r\n if a[len(a)-1] > k:\r\n ch += 1\r\n if a[0] <= k:\r\n c += 1\r\n del(a[0])\r\n if True if len(a) != 0 and a[len(a)-1] <= k else False:\r\n c += 1\r\n del(a[len(a)-1])\r\n if ch == 2:\r\n break\r\n ch ^= ch\r\nprint(c)", "from sys import stdin, stdout \r\nfrom math import log2, log10, log, ceil, floor, sqrt\r\n\r\ndef rs(): return stdin.readline().strip()\r\ndef ri(): return int(rs())\r\ndef rn(): return map(int, rs().split())\r\ndef rl(): return list(rn())\r\n\r\ndef solve(): \r\n n, k = rn()\r\n a = rl()\r\n amount = 0\r\n while len(a) and (k >= a[0] or k >= a[-1]):\r\n if k >= a[0]:\r\n a = a[1:]\r\n amount += 1 \r\n elif k >= a[-1]:\r\n amount += 1 \r\n a = a[:-1]\r\n print(amount)\r\n return None\r\n\r\n\r\ndef main():\r\n for _ in range(ri()):\r\n solve()\r\n\r\nsolve()\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nct = 0\r\n\r\nfor i in arr:\r\n if i <= k:\r\n ct += 1\r\n else:\r\n break\r\narr = arr[::-1]\r\nfor i in arr:\r\n if i <= k:\r\n ct += 1\r\n else:\r\n break\r\n\r\nprint(min(ct, len(arr)))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n, k = map(int, input().split())\r\nlst = [int(i) for i in input().split()]\r\ncount = 0\r\n\r\nfor i in lst:\r\n if i > k:\r\n break\r\n else:\r\n count += 1\r\n\r\nfor i in lst[::-1]:\r\n if i > k:\r\n break\r\n else:\r\n count += 1\r\n\r\nprint(min(n, count))\r\n", "import sys\r\n\r\na, m = map(int, input().split())\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nc = 0\r\nfor i in range(0, a):\r\n if len(b) > 0:\r\n if b[0] <= m:\r\n c += 1\r\n del b[0]\r\n if len(b) >0:\r\n if b[-1] <= m:\r\n c += 1\r\n del b[-1]\r\nprint(c)\r\n", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\nn,k=ris()\r\na=ris()\r\ni,j=0,n-1\r\nwhile i<n:\r\n if k<a[i]:\r\n break\r\n i+=1\r\nwhile i<j:\r\n if k<a[j]:\r\n break\r\n j-=1\r\nprint(i+n-j-1)\r\n", "n = [int(_) for _ in input().split()]\narr = [int(_) for _ in input().split()]\n\narr2 = arr[::-1]\n\nc = 0\n\nfor char in arr:\n if char <= n[1]:\n c += 1\n\n else:\n break\n\nfor char in arr2:\n if char <= n[1]:\n c += 1\n\n else:\n break\n\nif c > n[0]:\n print(n[0])\n\nelse:\n print(c)\n\n\n", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nleft = 0\r\nright = n - 1\r\nres1 = 0\r\nres2 = 0\r\nwhile left < n and a[left] <= k:\r\n left += 1\r\n res1 += 1\r\nwhile right >= 0 and a[right] <= k:\r\n right -= 1\r\n res2 += 1\r\nif res1 == n:\r\n print(res1)\r\nelse:\r\n print(res1 + res2)\r\n", "a, b = map(int, input().split())\r\nnum = list(map(int, input().split()))\r\ncnt = 0\r\ntemp = 0\r\nfor i in range(a):\r\n temp += 1\r\n if b >= num[i]:\r\n cnt += 1\r\n else:\r\n break\r\nif temp == a:\r\n print(cnt)\r\nelse:\r\n for i in range(1, a):\r\n temp += 1\r\n if b >= num[-1*i]:\r\n cnt += 1\r\n else:\r\n break\r\n print(cnt)\r\n3", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ncount1 = 0\r\ncount2 = 0\r\nfor i in range(len(arr)):\r\n if arr[i] <= k:\r\n count1 += 1\r\n if arr[i] > k:\r\n break\r\nif count1 == n:\r\n print(count1)\r\nelse:\r\n t = len(arr)-1\r\n while t > 0:\r\n if arr[t] <= k:\r\n count2 += 1\r\n if arr[t] > k:\r\n break\r\n t -= 1\r\n print(count1 + count2)\r\n", "t,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncountPP = 0\r\ncountMM = -1\r\ncount = 0\r\nc = 0\r\nfor i in a:\r\n if i<=k:\r\n count+=1\r\nif count == t:\r\n print(t)\r\nelse:\r\n while a[countPP] <= k:\r\n countPP+=1\r\n while a[countMM] <= k:\r\n countMM-=1\r\n c+=1\r\n print(c+countPP)", "n, k = map(int, input().split())\r\nli = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nwhile li:\r\n if li[-1] <= k:\r\n li.pop()\r\n cnt += 1\r\n elif li[0] <= k:\r\n li.pop(0)\r\n cnt += 1\r\n else:\r\n break\r\nprint(cnt)", "n, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\ni = 0\r\nj = n-1\r\nz = 0\r\n\r\nl = True\r\nr = True\r\n\r\nwhile (l or r):\r\n if i < n and a[i] <= k:\r\n i += 1\r\n else:\r\n l = False\r\n if j >= 0 and a[j] <= k:\r\n j -= 1\r\n z += 1\r\n else:\r\n r = False\r\n\r\nif i == n or z == n:\r\n print(n)\r\nelse:\r\n print(i+z)\r\n\r\n", "skill = n,k = [int(x) for x in input().split()]\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nsolve1 = 0\r\nsolve2 = 0\r\n\r\nfor i in arr:\r\n if i <= k:\r\n solve1 += 1\r\n else:\r\n break\r\n\r\nfor i in reversed(arr):\r\n if i <= k:\r\n solve2 += 1\r\n else:\r\n break\r\n\r\nprint(min(n,solve1+solve2))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n\tif a[i] <= k:\r\n\t\tcnt += 1\r\n\telse:\r\n\t\tbreak\r\n\r\nif cnt == n:\r\n\tprint(n)\r\n\texit()\r\n\r\na = a[::-1]\r\nfor i in range(n):\r\n\tif a[i] <= k:\r\n\t\tcnt += 1\r\n\telse:\r\n\t\tbreak\r\n\r\nprint(cnt)", "n,k= map(int,input().split())\r\na = list(map(int, input().split()))\r\nc=0\r\ng=[]\r\nfor i in range(n):\r\n if a[i]>k:\r\n g.append(i)\r\nif len(g)==0:\r\n print(len(a))\r\nelse:\r\n a = a[:g[0]]+a[g[-1]:]\r\n for i in a:\r\n if i<=k:\r\n c+=1\r\n print(c)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nc = 0\r\nwhile arr[0] <= k or arr[-1] <= k:\r\n if arr[0] <= k:\r\n c += 1\r\n arr.pop(0)\r\n elif arr[-1] <= k:\r\n c += 1\r\n arr.pop(-1)\r\n if len(arr) == 0:\r\n break\r\nprint(c)", "testInput = list(map(int, input().split(\" \")))\r\nn = testInput[0]\r\nk = testInput[1]\r\nif(n==1):\r\n temp = int(input())\r\n arr = []\r\n arr.append(temp)\r\nelse:\r\n arr = list(map(int, input().split(\" \")))\r\nl = 0; r = n-1;ans = 0\r\nwhile(l<r):\r\n if(arr[l]<=k):\r\n ans+=1;\r\n l+=1;\r\n if(arr[r]<=k):\r\n ans+=1;\r\n r-=1\r\n if(arr[r]>k and arr[l]>k):\r\n break\r\nif(l == r):\r\n if(arr[l]<=k):\r\n ans+=1;\r\nprint(ans)", "#import sys\r\n#import math\r\n#sys.stdout=open(\"C:/Users/pipal/OneDrive/Desktop/VS code/python/output.txt\",\"w\")\r\n#sys.stdin=open(\"C:/Users/pipal/OneDrive/Desktop/VS code/python/input.txt\",\"r\")\r\n#t=int(input())\r\n#for i in range(t): \r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nstart=0\r\nend=n-1\r\nans=0\r\nwhile(start<=end):\r\n if l[start]<=m:\r\n start+=1\r\n ans+=1\r\n elif l[end]<=m:\r\n end-=1\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n ", "n, k = (int(x) for x in input().split())\na = [int(x) for x in input().split()]\nl, r = 0, n - 1\nwhile l <= r:\n if a[l] <= k:\n l += 1\n elif a[r] <= k:\n r -= 1\n else:\n break\nprint(l + n - 1 - r)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nl, r = 0, len(a) - 1\r\nans = 0\r\nwhile l <= r:\r\n if a[l] <= k:\r\n ans += 1\r\n l += 1\r\n elif a[r] <= k:\r\n ans += 1\r\n r -= 1\r\n else:\r\n break\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nif max(l)>k:\r\n\tfor i in range(n):\r\n\t\tif l[0]<=k:\r\n\t\t\tcount+=1\r\n\t\t\tl.pop(0)\r\n\t\tif l[len(l)-1]<=k:\r\n\t\t\tcount+=1\r\n\t\t\tl.pop(len(l)-1)\r\n\tprint(count)\r\nelse:\r\n\tprint(n)", "N, K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nans = 0\r\nwhile A and A[-1] <= K:\r\n ans += 1\r\n A.pop()\r\n\r\nA.reverse()\r\nwhile A and A[-1] <= K:\r\n ans += 1\r\n A.pop()\r\n\r\nprint(ans)\r\n", "a, b = map(int, input().split())\r\nv = list(map(int, input().split()))\r\ncount = 0\r\n# print(v)\r\ni = 0\r\nwhile i < len(v):\r\n if v[i] <= b:\r\n count += 1\r\n v.remove(v[i])\r\n i -= 1\r\n else:\r\n break\r\n i += 1\r\nv.reverse()\r\ni = 0\r\nwhile i < len(v):\r\n if v[i] <= b:\r\n count += 1\r\n v.remove(v[i])\r\n i -= 1\r\n else:\r\n break\r\n i += 1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nans, i = 0, 0\r\nwhile i < n and a[i] <= k:\r\n ans += 1\r\n i += 1\r\nj = n-1\r\nwhile j >= i and a[j] <= k:\r\n ans += 1\r\n j -= 1\r\nprint(ans)", "import sys\r\ndef mishka_and_contest():\r\n n,k=list(map(int,input().split()))\r\n a=list(map(int,input().split()))\r\n c=0\r\n if a[0]<=k:\r\n for i in a:\r\n if i<=k:c+=1\r\n else:break\r\n if c==n:\r\n print(c);sys.exit()\r\n else:\r\n if a[-1]<=k:\r\n for i in range(len(a)-1,0,-1):\r\n if a[i]<=k:\r\n c+=1\r\n else:break\r\n print(c)\r\nmishka_and_contest()", "n,k=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nres=0\r\ncheck=-1\r\nfor i in range(len(a)):\r\n if a[i]<=k:\r\n res+=1 \r\n else:\r\n check=i\r\n break \r\nif res==n:\r\n print(n)\r\nelse:\r\n for i in range(n-1,i,-1):\r\n if a[i]<=k:\r\n res+=1 \r\n else:\r\n break\r\n print(res)", "a= input()\r\nb= input()\r\nlist1=a.split(\" \")\r\nn=int(list1[0])\r\nk=int(list1[1])\r\nlist2 =b.split(\" \")\r\nL =int(list2[0])\r\nR =int(list2[-1])\r\ncount=0\r\nwhile((L<=k or R<=k) and (count<n)):\r\n L =int(list2[0])\r\n R =int(list2[-1])\r\n if(L<=k):\r\n list2.pop(0)\r\n count=count+1 \r\n elif(R<=k):\r\n list2.pop(-1)\r\n count=count+1\r\nprint(count) ", "n, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\ns = 0\r\ni = 0\r\nwhile i < n and a[i] <= k:\r\n s += 1\r\n i += 1\r\nif i < n:\r\n i = n - 1\r\n while i >= 0 and a[i] <= k:\r\n s += 1\r\n i -= 1\r\nprint(s)", "n, k = list(map(int, input().split()))\r\ndata = list(map(int, input().split()))\r\n\r\nlst = []\r\nfor _ in range(2):\r\n data = data[::-1]\r\n \r\n for x in data:\r\n if x <= k:\r\n lst.append(x)\r\n else:\r\n break\r\n \r\n if len(lst) >= len(data):\r\n break\r\n\r\nprint(len(lst))", "n, k = map(int, input().split())\r\nproblems = list(map(int, input().split()))\r\nres = 0\r\nfor _ in range(n):\r\n if problems[0] <= k:\r\n problems = problems[1:]\r\n res += 1\r\n elif problems[-1] <= k:\r\n problems = problems[:-1]\r\n res += 1\r\nprint(res)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\na=b=-1\r\nfor i in range(n):\r\n\tif l[i]>k:\r\n\t\ta=i\r\n\t\tbreak\t\r\nfor i in range(n-1,-1,-1):\r\n\tif l[i]>k:\r\n\t\tb=i\r\n\t\tbreak\r\nif a==b==-1:\r\n\tprint(n)\r\nelif a==b :\r\n\tprint(n-1)\r\nelse:\r\n\tprint(a+n-b-1)\t", "n,k = map(int,input().split())\r\ntasks = list(map(int,input().split()))\r\nz = 0\r\ni = 0\r\nwhile i<len(tasks) and tasks[i]<=k:\r\n i+=1\r\n z+=1\r\nfor _ in range(len(tasks)-i):\r\n if tasks[len(tasks)-1-_] <= k:\r\n z+=1\r\n else:\r\n break\r\nprint(z)", "if __name__ == '__main__':\n nkIn = input()\n n, k = [int(i) for i in nkIn.split()]\n aIn = input()\n a = [int(i) for i in aIn.split()]\n counter = 0\n # print(a)\n\n while counter < n and a:\n if a[0] <= k:\n counter += 1\n a.pop(0)\n # print(a)\n elif a[-1] <= k:\n counter += 1\n a.pop(-1)\n # print(a)\n else:\n break\n print(counter)\n\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\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nif max(arr) <= k:\r\n print(n)\r\nelse:\r\n temp = arr.copy()\r\n temp.reverse()\r\n count_ = 0\r\n for i in arr:\r\n if i <= k:\r\n count_ += 1\r\n else:\r\n break\r\n for i in temp:\r\n if i <= k:\r\n count_ += 1\r\n else:\r\n break\r\n print(count_)#printing result", "import sys\r\nimport math\r\ninp=sys.stdin.readline\r\nout=sys.stdout.write\r\ndef ii(): return int(inp())\r\ndef mi(): return map(int,inp().strip().split())\r\ndef li(): return list(map(int,inp().strip().split()))\r\nn,k=mi()\r\nl=li()\r\nc=0\r\nfor i in range(n):\r\n if l[i]<=k:\r\n c+=1\r\n else:\r\n break\r\nif c!=n:\r\n for i in range(n-1,0,-1):\r\n if l[i]<=k:\r\n c+=1\r\n else:\r\n break\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nfor difficulty in a:\r\n if difficulty <= k:\r\n count += 1\r\n else:\r\n break\r\nif count is not n:\r\n for index in range(-1, -n, -1): \r\n if a[index] <= k:\r\n count += 1\r\n else:\r\n break\r\nprint(count)\r\n", "n,k = map(int,input().split())\nls = list(map(int,input().split()))\ncnt = 0\nwhile True:\n try:\n if k>=ls[0]:\n cnt += 1\n ls.pop(0)\n elif k>=ls[len(ls)-1]:\n cnt += 1\n ls.pop()\n else:\n break\n except:\n break\nprint(cnt)\n\t \t\t\t \t\t \t\t\t \t \t\t \t\t \t", "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,k=read_ints()\r\n\ta=read_ints()\r\n\ti,j=0,n-1\r\n\twhile i<n and a[i]<=k:\r\n\t\ti+=1\r\n\twhile j>=0 and a[j]<=k:\r\n\t\tj-=1\r\n\tif i>j:\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint(i+(n-1)-j)\r\n\r\nsolve()\r\n", "N,k = map(int, input().split())\r\nproblems = list(map(int,input().split()))\r\nleft = True\r\ncount = 0\r\nj = 0\r\n\r\nfor i in range(N):\r\n if(problems[i] <= k and left):\r\n count += 1\r\n else:\r\n left = False\r\n if(problems[(N-1)-j] <= k):\r\n count += 1\r\n j +=1\r\n else:\r\n break\r\nprint(count)\r\n", "n,m=map(int,input().split())\r\nnumbers= list(map(int, input().split()))[:n]\r\ncant=[i for i in range(len(numbers)) if numbers[i]>m]\r\nif len(cant)==0:\r\n\tprint(n)\r\nelse:\r\n\tprint(n-(max(cant)-min(cant)+1))", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()[:n]))\r\nl1=l[::-1]\r\nc=0\r\nt=1\r\ni=0\r\nflag1=0\r\nflag2=0\r\nwhile t and i<n:\r\n if l[i]<=k and flag1==0:\r\n c=c+1\r\n else:\r\n flag1=1\r\n if l1[i]<=k and flag2==0:\r\n c=c+1\r\n else:\r\n flag2=1\r\n i=i+1\r\n if flag1==1 and flag2==1:\r\n t=0\r\nprint(min(n,c))", "def findAns(arr, a):\r\n k = arr[1]\r\n n = arr[0]\r\n flag = False\r\n for i in a:\r\n if i > k:\r\n index_1 = a.index(i)\r\n flag = True\r\n break\r\n j = n\r\n while j >= 0:\r\n j -= 1\r\n if a[j] > k:\r\n index_2 = j\r\n break\r\n if flag:\r\n return ((n-1)-(index_2 - index_1))\r\n else:\r\n return n\r\n\r\narr = list(map(int,input().strip().split()))[:2]\r\na = list(map(int,input().strip().split()))[:arr[0]]\r\nresult = findAns(arr,a)\r\nprint(result)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nsum1 = 0\r\nx = n - 1\r\ny = 0\r\nfor i in range(n):\r\n if a[y] <= k:\r\n sum1 += 1\r\n y += 1\r\n else:\r\n if a[x] <= k:\r\n sum1 += 1\r\n else:\r\n break\r\n x -= 1\r\n\r\nprint(sum1)", "\"\"\"\r\n* Mohamed Fadl *\r\n! ==>> Mishka and Contest Problem \r\n! ==>> Link: https://codeforces.com/contest/999/problem/A\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nmax = 0\r\n\r\nwhile l:\r\n if l[0] <= k:\r\n l.pop(0)\r\n elif l[-1] <= k:\r\n l.pop(-1)\r\n else:\r\n break\r\n max += 1\r\nprint(max)\r\n", "n, k = map(int, input().split())\r\nls = list(map(int, input().split()))\r\ncount = 0\r\nwhile len(ls) > 0:\r\n if ls[0] <= k:\r\n count+=1\r\n ls.pop(0)\r\n else: break\r\nwhile len(ls) > 0:\r\n if ls[len(ls)-1] <= k:\r\n count+=1\r\n ls.pop(len(ls)-1)\r\n else: break\r\n\r\nprint(count)", "a, b = map(int, input().split())\nnum = list(map(int, input().split()))\ncnt = 0\ntemp = 0\nfor i in range(a):\n temp += 1\n if b >= num[i]:\n cnt += 1\n else:\n break\nif temp == a:\n print(cnt)\nelse:\n for i in range(1, a):\n temp += 1\n if b >= num[-1*i]:\n cnt += 1\n else:\n break\n print(cnt)\n3\n\t \t \t\t\t \t\t \t\t\t \t \t\t\t\t\t\t\t\t", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nwhile len(arr) > 0:\r\n if arr[0] <= k:\r\n count += 1\r\n del arr[0]\r\n elif arr[-1] <= k:\r\n count += 1\r\n del arr[-1]\r\n else:\r\n break\r\n\r\nprint(count)", "\"\"\"\r\n-*- coding: utf-8 -*-\r\n\r\nCreated on Thu Jan 20 21:43:34 2022\r\n\r\n@author: Tausif Khan Arnob\r\n\"\"\"\r\n\r\nn, k = map(int, input().split())\r\na = [*map(int, input().split())]\r\nminn = -1; maxx = -1\r\nfor i in range(n):\r\n if a[i] > k:\r\n if minn == -1:\r\n minn = i\r\n maxx = i\r\nprint(max(0, minn) + n - maxx - 1)", "first = input().split()\nsecond = input().split()\nl1=[]\nrslt = 0\nfor i in second:\n if int(i) <= int(first[1]):\n rslt+=1\n l1.append(i)\n else:\n break\nif l1==second:\n print(len(second))\nelse:\n for i in second[::-1]:\n if int(i) <= int(first[1]):\n rslt += 1\n else:\n break\n print(rslt)\n\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nif max(arr) <= k:\r\n print(n)\r\nelse:\r\n temp = arr.copy()\r\n temp.reverse()\r\n count_ = 0\r\n for i in arr:\r\n if i <= k:\r\n count_ += 1\r\n else:\r\n break\r\n for i in temp:\r\n if i <= k:\r\n count_ += 1\r\n else:\r\n break\r\n print(count_)", "# for _ in range(int(input())):\r\n # n = int(input())\r\nn,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n\r\nfirst = 0\r\n\r\nfor i in arr:\r\n if i>k:break\r\n # first+=1\r\n # break\r\n first+=1\r\nsecond = 0\r\nrev = arr[::-1]\r\n# print(rev)\r\n\r\nfor i in rev:\r\n if i>k:break\r\n\r\n second+=1\r\n# print(first)\r\n# print(second)\r\n# print(first+second)\r\n\r\nif first==n:\r\n print(first)\r\nelse:\r\n print(first+second)", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\ns,j=0,0\n\nfor i in range(n):\n if l[i]>k:\n s=i+1\n break\nl=l[::-1]\nfor i in range(n):\n if l[i]>k:\n j=i+1\n break\nj=n-j+1\na=n-(j-s)-1\nif a<0:\n print(n)\nelse:\n print(a)\n\t \t \t \t\t \t \t \t \t \t", "'''\r\nn, k = map(int, input().split())\r\n\r\n#print(n, k)\r\n\r\na = [int(i) for i in input().split()]\r\n\r\n\r\nflag =flag2 = -1\r\nfor x in range(n):\r\n if a[x] >k:\r\n flag = x\r\n #print('flag',flag)\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if a[i]>k:\r\n flag2=i\r\n #print('flag2',flag2)\r\n break\r\nif flag==flag2==-1:\r\n print(n)\r\nelif flag == flag2:\r\n print(n-1)\r\nelse:\r\n print(flag+n-flag2-1)\r\n'''\r\n''' \r\ninput = __import__('sys').stdin.readline\r\n\r\nMIS = lambda: map(int, input().split())\r\n\r\nn, k = MIS()\r\nprint(n,k)\r\nprob = list(MIS())\r\nprint(prob)\r\nwhile prob and prob[0] <= k:\r\n prob.pop(0)\r\n print(prob)\r\nwhile prob and prob[-1] <= k:\r\n prob.pop()\r\n print(prob)\r\nprint(n - len(prob))\r\n'''\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\nn, k = inp()\r\na = list(inp())\r\nans = 0\r\ni = 0\r\n\r\nwhile i != n and a[i] <= k:\r\n ans += 1\r\n # print('ans',ans)\r\n i += 1\r\nj = n - 1\r\nwhile i < j and a[j] <= k:\r\n ans += 1\r\n # print('ans',ans)\r\n j -= 1\r\nprint(ans)\r\n", "n_problems, k_skill = map(int, input().split())\na_difficulties = list(map(int, input().split()))\n\nwhile len(a_difficulties) > 0 and a_difficulties[-1] <= k_skill:\n a_difficulties.pop()\n\nwhile len(a_difficulties) > 0 and a_difficulties[0] <= k_skill:\n a_difficulties.pop(0)\n\nprint(n_problems - len(a_difficulties))\n", "rd = lambda: list(map(int, input().split()))\r\nn, k = rd()\r\na = rd()\r\ni, j = 0, n - 1\r\nwhile i <= j and a[i] <= k:\r\n i += 1\r\nwhile i < j and a[j] <= k:\r\n j -= 1\r\nprint(n - j + i - 1)\r\n", "n, k = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nwhile True:\r\n if len(l) == 0:\r\n break\r\n elif l[0] <= k:\r\n del l[0]\r\n elif l[-1] <= k:\r\n l.pop()\r\n else:\r\n break\r\nprint(n - len(l))", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nfor i in range(n):\r\n if arr[i]>k:\r\n arr[i]=0\r\n else:\r\n arr[i]=1\r\nans1=0\r\nans2=0\r\nfor j in range(n):\r\n if arr[j]==1:\r\n ans1+=1\r\n else:\r\n break\r\nif ans1==n:\r\n print(ans1)\r\nelse:\r\n for k in range(n-1,-1,-1):\r\n if arr[k]==1:\r\n ans2+=1\r\n else:\r\n break\r\n print(ans1+ans2)\r\n", "n, k = map(int, input().split())\nlist = [int(x) for x in input().split()][:n]\nsolved = 0\nidx = 0\nfor i in range(n):\n\tidx = i\n\t\n\tif list[i] <= k: solved += 1\n\telse: break\nfor i in reversed(range(n)):\n\tif i == idx: break\n\t\n\tif list[i] <= k: solved += 1\n\telse: break\nprint(solved)\n \t\t \t \t\t\t \t \t \t\t", "n, k = list(map(int, input().split(' ')))\r\na = list(map(int, input().split(' ')))\r\ns = 0\r\nfor i in a:\r\n if i <= k:\r\n s += 1\r\n else:\r\n break\r\nfor i in a[::-1]:\r\n if i <= k:\r\n s += 1\r\n else:\r\n break\r\nprint(min(s, n))", "n, m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\nf, g = 0, n - 1\r\nans = 0\r\nwhile f != g:\r\n if l[f] <= m:\r\n ans += 1\r\n f += 1\r\n continue\r\n if l[g] <= m:\r\n ans += 1\r\n g -= 1\r\n continue\r\n break\r\nif l[f] <= m:\r\n ans += 1\r\nprint(ans)", "n,k = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\nl = 0\r\ncount = 0\r\nr = len(arr) - 1\r\nwhile l <= r:\r\n if l == r:\r\n if arr[l] <= k:\r\n count += 1\r\n l += 1\r\n r -= 1\r\n elif arr[l] <= k and arr[r] <= k:\r\n count += 2\r\n l += 1\r\n r -= 1\r\n elif arr[l] <= k or arr[r] <= k:\r\n if arr[l] <= k:\r\n l += 1\r\n elif arr[r] <= k:\r\n r -= 1\r\n count += 1\r\n else:\r\n break\r\nprint(count)", "n,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nvis=[0]*n\r\ncnt=0\r\nfor i in range(n):\r\n if lst[i]<=m:\r\n cnt+=1\r\n vis[i]=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if vis[i]==1 or lst[i]>m:\r\n break\r\n else:\r\n cnt+=1\r\nprint(cnt)", "n , k = input().split() #n : number of problems , k : difficulty\nn , k = int(k) , int(k) \narr = list(map(int, input().split()))\nl = 0 ; n = len(arr) ; r = n - 1 \ncount = 0 \nfor i in range (n):\n\tif(r < l ):\n\t\tbreak ; \n\tif (arr[l] <= k) :\n\t\tcount +=1\n\t\tl+=1 \n\telif(arr[r]<=k):\n\t\tcount+=1\n\t\tr -= 1\n\telse :\n\t\tbreak\n\t\t \nprint(count)\n\n\t\n", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\na=0\r\nfor e in arr:\r\n if e>k:\r\n break\r\n else :\r\n a+=1\r\nif a==n:\r\n print(a)\r\nelse :\r\n for e in arr[::-1]:\r\n if e>k:\r\n break\r\n else :\r\n a+=1\r\n print(a)", "n,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\ncount = 0\r\ni = 0\r\nj = len(arr)-1\r\nwhile i<len(arr) and j>=0:\r\n if arr[i]<=k:\r\n i+=1\r\n count+=1\r\n elif arr[j]<=k:\r\n j-=1\r\n count+=1\r\n else:\r\n break\r\nprint(count)", "n , k = map(int, input().split())\r\na = [ int(i) for i in input().split() ]\r\nlist1 = []\r\nj = 0\r\nwhile j < n :\r\n if a[j] <= k:\r\n list1.append(a[j])\r\n else:\r\n break\r\n j += 1\r\nj = 0\r\nif len(list1) == len(a):\r\n print(len(list1))\r\nelse:\r\n a.reverse()\r\n while j < n:\r\n if a[j] <= k:\r\n list1.append(a[j])\r\n else:\r\n break\r\n j += 1\r\n print(len(list1))\r\n ", "x, y, count = list(map(int, input().split())) + [0]\r\nproblems = list(map(int, input().split()))\r\nz = True\r\nfor i in problems:\r\n if y >= i:\r\n count += 1\r\n else:\r\n z = False\r\n break\r\nif not z:\r\n for i in problems[::-1]:\r\n if y >= i:\r\n count += 1\r\n else:\r\n break\r\nprint(count)", "n,k=input().split()\r\nn,k=map(int,(n,k))\r\ndifficulties=list(map(int,input().split()))\r\nn=len(difficulties)\r\nx=0\r\ny=n-1\r\nproplems=0\r\nfor i in difficulties:\r\n if difficulties[x] <= k:\r\n proplems+=1\r\n x+=1\r\n elif difficulties[y] <= k:\r\n proplems+=1\r\n y-=1\r\n else:\r\n break\r\nprint (proplems)", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nl, f = -1, False\r\nfor i in range(n):\r\n if a[i] > k:\r\n if l == -1:\r\n l = i\r\n r = i\r\n f = True\r\nif f:\r\n print(n - r + l - 1)\r\nelse:\r\n print(n)", "n, k = map(int,input().split())\r\na = [int(x) for x in input().split()]\r\ncount = 0\r\n\r\nwhile a:\r\n if a[0] <= k:\r\n count += 1\r\n a.pop(0)\r\n else:\r\n break\r\n\r\nwhile a:\r\n if a[-1] <= k:\r\n count += 1\r\n a.pop()\r\n else:\r\n break\r\n\r\nprint(count)\r\n", "sze, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\nleftSide = 0\r\nrightSide = 0\r\nrightEnd = -1\r\nfor i in range(sze):\r\n temp = lst[i]\r\n rightEnd = i\r\n if(temp <= k):\r\n leftSide += 1\r\n else:\r\n break\r\nfor j in range(sze - 1, rightEnd, -1):\r\n temp = lst[j]\r\n if(temp <= k):\r\n rightSide += 1\r\n else:\r\n break\r\nprint(leftSide + rightSide)\r\n ", "def main():\r\n [n, k] = list(map(int, input().split()))\r\n a = list(map(int, input().split()))\r\n answer = 0\r\n for i in range(n):\r\n if a[i] <= k:\r\n answer += 1\r\n else:\r\n break\r\n if answer < n:\r\n for i in range(n - 1, -1, -1):\r\n if a[i] <= k:\r\n answer += 1\r\n else:\r\n break\r\n print(answer)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\ndef get_list ():\r\n return list (map (int, sys.stdin.readline ().strip ().split ()))\r\ndef get_int ():\r\n return map (int, sys.stdin.readline ().strip ().split ())\r\nn, k = get_int ()\r\nli = get_list ()\r\ncount = 0\r\ncheck = True\r\nrev_li = list (reversed (li))\r\nfor i in range (n):\r\n if li [i] > k:\r\n break\r\n count +=1\r\nif count != n:\r\n for i in range (n):\r\n if rev_li [i] > k:\r\n break\r\n count += 1\r\nelse:\r\n print (count)\r\n check = False\r\nif check:\r\n print (count)\r\n", "def mishkaAndContest(arr, n, k):\n count=0\n curr=0\n for i in range(n):\n if arr[i]<=k:\n count+=1\n\n else:\n break\n if i == n-1:\n return count\n else:\n for j in range(n-1,-1,-1):\n if arr[j]<=k:\n count+=1\n else:\n break\n return count\n\n\nn, k=map(int,input().split())\narr=list(map(int,input().split()))\nprint(mishkaAndContest(arr,n,k))", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nflag=0\r\nfor i in range(n):\r\n if l[i]>m:\r\n flag=1 \r\n break \r\nif flag==1:\r\n l=l[::-1]\r\n for i1 in range(n):\r\n if l[i1]>m:\r\n break \r\n print(i+i1)\r\nelse:\r\n print(i+1)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if l[0]<=k:\r\n c+=1\r\n del l[0]\r\n elif l[len(l)-1]<=k:\r\n c+=1\r\n del l[len(l)-1]\r\n else:\r\n break\r\nprint(c)", "MishkaLevel_k = str(input(\"\")).split(\" \")[1]\r\nProblems = str(input(\"\")).split(\" \")\r\nMishkaCanSolve = 0\r\nfor repatingThisMethod in range(len(Problems)):\r\n if len(Problems) == 0:\r\n break\r\n else:\r\n for i in range(-1,1):\r\n if int(Problems[i]) > int(MishkaLevel_k):\r\n pass\r\n else:\r\n Problems.pop(i)\r\n MishkaCanSolve+=1\r\n break\r\nprint(MishkaCanSolve)\r\n \r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nans=0\r\ni=0\r\nfor i in range(n):\r\n if a[i]<=k:ans+=1\r\n else:break\r\n\r\nif ans<n:\r\n for i in range(n-1,-1,-1):\r\n if a[i]<=k:ans+=1\r\n else:break\r\n\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\ns=0;i=0\r\nwhile(i<n):\r\n if(lst[i]<=k):\r\n s+=1\r\n else:\r\n break\r\n i+=1\r\nz=n-s\r\ni=0\r\nwhile(i<z):\r\n if(lst[n-1-i]<=k):\r\n s+=1\r\n else:\r\n break\r\n i+=1\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k = map(int,input().split())\r\ns=[int(i) for i in input().split()]\r\nb=True\r\nfor i in range(n):\r\n if s[i]>k and b:\r\n m=i\r\n n1=i\r\n b=False\r\n elif s[i]>k:\r\n n1=i\r\nif max(s)<=k:\r\n print(n)\r\nelse:print(m+n-n1-1)", "n, k = input().split()\r\nar = input().split()\r\na = 0\r\nsum = 0\r\nfor i in ar:\r\n if int(i) > int(k) :\r\n a+=1\r\n ar.reverse()\r\n break\r\n else:\r\n sum+=1\r\nif a == 1:\r\n for j in ar:\r\n if int(j) > int(k) :\r\n break\r\n else:\r\n sum+=1\r\nprint(sum)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nctr = 0\r\ni = 0\r\nj = n-1\r\nwhile(i<=j):\r\n if arr[i] <= k:\r\n i += 1\r\n ctr += 1\r\n continue\r\n if arr[j] <= k:\r\n j -= 1\r\n ctr += 1\r\n continue\r\n if arr[i] > k and arr[j] > k: break\r\nprint(ctr)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns=set()\r\nfor i in range(n):\r\n if l[i]>k:\r\n break\r\n s.add(i)\r\nfor i in range(n-1,-1,-1):\r\n if l[i]>k:\r\n break\r\n s.add(i)\r\nprint(len(s))", "def check(n,m):\r\n a=b=None\r\n for i in range(len(n)):\r\n if n[i]>m:\r\n a=i \r\n break\r\n n=n[::-1]\r\n for j in range(len(n)):\r\n if n[j]>m:\r\n b=(len(n)-1)-j\r\n break\r\n if a!=None and b!=None: \r\n return abs(a-b)+1\r\n elif a!=None or b!=None:\r\n return 1 \r\n else:\r\n return 0\r\n \r\n \r\n\r\na,b=map(int,input().split())\r\nn=[*map(int,input().split())]\r\nx=check(n,b)\r\nprint(len(n)-x)\r\n", "def problem_checker(n, k, problems):\r\n\tstart = 0\r\n\tend = n\r\n\tresult = 0\r\n\tif problems[start] > k and problems[end] > k:\r\n\t\treturn result\r\n\telse:\r\n\t\tif k == 100:\r\n\t\t\treturn len(problems)\r\n\t\telse:\r\n\t\t\twhile start != end+1:\r\n\t\t\t\tif problems[start] <= k:\r\n\t\t\t\t\tresult += 1\r\n\t\t\t\t\tstart += 1\r\n\t\t\t\telif problems[end] <= k:\r\n\t\t\t\t\tresult += 1\r\n\t\t\t\t\tend -= 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tbreak\r\n\treturn result\r\n\t\t\r\n \r\nnk = list(map(int, input().split()))\r\nproblems = list(map(int, input().split()))\r\nprint(problem_checker(nk[0]-1, nk[1], problems))", "n,k=map(int,input().split())\r\nprint(n-len(''.join(' o'[int(x)>k]for x in input().split()).strip()))", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = input().split()\r\ncount = 0\r\nfor i in c:\r\n if int(i)<=b:\r\n count+=1\r\n else:\r\n break\r\nif count ==a:\r\n print(count)\r\nelse:\r\n for i in c[::-1]:\r\n if int(i)<=b:\r\n count += 1\r\n else:\r\n break\r\n print(count)\r\n\r\n", "line1=input()\nx=list(map(int,line1.split()))\nn=x[0]\nd=x[1]\nline2=input()\np=list(map(int,line2.split()))\nc=0\ni=0\nwhile(i<n):\n if(p[i]<=d):\n c+=1\n else:\n break\n i+=1\nif (c<n):\n i=n-1\n while (i>=-n):\n if(p[i]<=d):\n c+=1\n else:\n break\n i-=1 \nprint(c)\n \t \t\t \t\t\t \t\t\t\t\t \t", "problems_no,skill_level = input().split()\r\nproblems_no = int(problems_no)\r\nskill_level = int(skill_level)\r\nproblems_list = []\r\nproblems_list = input().split()\r\nproblems_list = [int(no) for no in problems_list]\r\n\r\nfor i in range(len(problems_list)):\r\n if(problems_list[0] <= skill_level):\r\n problems_list.pop(0)\r\n else:\r\n break\r\nproblems_list.reverse()\r\nfor i in range(len(problems_list)):\r\n if(problems_list[0] <= skill_level):\r\n problems_list.pop(0)\r\n else:\r\n break\r\nprint(problems_no-len(problems_list))", "n, k = (int(i) for i in input().split())\na = [int(i) for i in input().split()]\nres, lo, hi = 0, 0, n - 1\nwhile lo <= hi:\n if a[lo] <= k:\n res += 1\n lo += 1\n elif a[hi] <= k:\n res += 1\n hi -= 1\n else:\n break\nprint(res)\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nc=0\r\nm=min(l[0],l[-1])\r\nwhile(m<=k):\r\n if m==l[0]:\r\n l.pop(0)\r\n else:\r\n l.pop(-1)\r\n c=c+1\r\n try:\r\n m=min(l[0],l[-1])\r\n except:\r\n break\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\n\r\n# Check both ends of the list while Mishka can solve the problems\r\nwhile a and (a[0] <= k or a[-1] <= k):\r\n if a[0] <= k:\r\n c += 1\r\n a.pop(0) # Remove the leftmost problem\r\n elif a[-1] <= k:\r\n c += 1\r\n a.pop() # Remove the rightmost problem\r\n\r\nprint(c)\r\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()[:n]))\r\nboolean = False\r\ni = 0\r\nj = -1\r\nc = 0\r\nwhile boolean == False:\r\n if len(arr) > 0:\r\n if arr[i] <= k:\r\n arr.pop(i)\r\n c += 1\r\n if len(arr) > 0:\r\n if arr[j] <= k and len(arr) > 0:\r\n arr.pop(j)\r\n c += 1\r\n if len(arr) == 0:\r\n boolean = True\r\n elif arr[i] > k and arr[j] > k:\r\n boolean = True\r\n\r\nprint(c)", "# 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\n\r\nn,k=map(int, input().split())\r\nll = list(map(int, input().split()))\r\nn = 0\r\nwhile len(ll)>0:\r\n if ll[0]<=k:\r\n n+=1\r\n ll.pop(0)\r\n elif ll[-1]<=k:\r\n n+=1\r\n ll.pop()\r\n elif ll[-1]> k and ll[0]>k:\r\n break \r\nprint(n) ", "n,k=map(int,input().split())\r\nli=list(map(int,input().split()))\r\nl=0\r\nr=n-1\r\ncount=0\r\nwhile(l<=r):\r\n if li[l]<=k:\r\n count+=1\r\n l=l+1\r\n elif li[r]<=k:\r\n count+=1\r\n r=r-1\r\n else:\r\n break\r\nprint(count)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nres=0\r\ni=0\r\nj=n-1\r\nflag=1\r\nwhile(flag and i<=j):\r\n if l[i]<=m:\r\n res+=1\r\n i+=1\r\n elif l[j]<=m:\r\n res+=1\r\n j-=1\r\n else :\r\n flag=0\r\nprint(res)", "\r\nfrom sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\nn,k=map(int,input().split())\r\narr=[int(x) for x in input().split()]\r\n\r\ncnt=0\r\ni=0\r\nwhile i<n:\r\n if arr[i]>k:\r\n break\r\n cnt=cnt+1\r\n i=i+1\r\nif i==n:\r\n print(cnt)\r\nelse:\r\n i=n-1\r\n while n>=0:\r\n if arr[i]>k:\r\n break\r\n cnt=cnt+1\r\n i=i-1\r\n print(cnt) \r\n \r\n", "n, k = map(int, input().split())\r\n\r\nD_P = list(map(int, input().split()))\r\n\r\npro_sol = 0\r\n\r\nfor rl in range(n):\r\n i = D_P.pop(0)\r\n if i > k:\r\n break\r\n else:\r\n pro_sol += 1\r\n\r\nfor lr in reversed(D_P):\r\n if lr > k:\r\n break\r\n else:\r\n pro_sol += 1\r\n D_P.pop()\r\n\r\nprint(pro_sol)", "n,m=map(int,input().split())\r\ns=list(map(int,input().split()))\r\nx =0\r\ng = 0\r\ny = n-1\r\nfor i in range(n):\r\n if s[x]<=m:\r\n g+=1\r\n x+=1\r\n elif s[y]<=m:\r\n g+=1\r\n y-=1\r\n else:\r\n break\r\nprint(g)\r\n\r\n", "n, k = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nl = 0\r\nr = n - 1\r\nans = 0\r\n\r\nwhile l != r + 1:\r\n\tif A[l] <= k:\r\n\t\tl += 1\r\n\t\tans += 1\r\n\telif A[r] <= k:\r\n\t\tr -= 1\r\n\t\tans += 1\r\n\telse:\r\n\t\tbreak\r\nprint(ans)", "import sys\r\nimport math\r\nimport random\r\ndef II():\r\n\treturn int(sys.stdin.readline())\r\n \r\ndef LI():\r\n\treturn list(map(int, sys.stdin.readline().split()))\r\n \r\ndef MI():\r\n\treturn map(int, sys.stdin.readline().split())\r\n \r\ndef SI():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef FACT(n, mod):\r\n s = 1\r\n facts = [1]\r\n for i in range(1,n+1):\r\n s*=i\r\n s%=mod\r\n facts.append(s)\r\n return facts[n]\r\n\r\ndef C(n, k, mod):\r\n return (FACT(n,mod) * pow((FACT(k,mod)*FACT(n-k,mod))%mod,mod-2, mod))%mod\r\n\r\nn,k = MI()\r\na = LI()\r\ncount = 0\r\nl = 0\r\nr = n-1\r\nwhile l<=r:\r\n if a[l]<=k:\r\n count+=1\r\n l+=1\r\n elif a[r]<=k:\r\n count+=1\r\n r-=1\r\n else:\r\n break\r\nprint(count)", "n, k = map(int, input().split())\na = list(map(int, input().split()))\nans = 0\ni, j = 0, n - 1\nwhile i <= j:\n if a[i] <= k:\n i += 1\n elif a[j] <= k:\n j -= 1\n else:\n break\nprint(i + n - 1 - j)\n", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nc = 0\r\npind = 0\r\nfor i in range(n):\r\n if k >= arr[i]:\r\n c += 1\r\n pind = i\r\n else:\r\n break\r\nj = n - 1\r\nwhile j > pind:\r\n if k >= arr[j]:\r\n c += 1\r\n else:\r\n break\r\n j -= 1\r\nprint(c)\r\n", "n,x=map(int,input().rstrip().split())\r\narr=list(map(int,input().rstrip().split()))\r\ncount,o,oo=0,0,n-1\r\nwhile o<=oo :\r\n if arr[o]<=x:\r\n count+=1\r\n o+=1\r\n elif arr[oo]<=x:\r\n count+=1\r\n oo-=1\r\n else:\r\n break\r\nprint(count)", "#rOkY\r\n#FuCk\r\n\r\n############################### kOpAl ##################################\r\n\r\nimport math\r\n\r\na,b=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=len(l)\r\ncnt1=0\r\ncnt2=0\r\ni=0\r\np=0\r\nwhile(x>0):\r\n if(l[i]<=b):\r\n cnt1+=1\r\n else:\r\n break\r\n \r\n i+=1\r\n x-=1\r\nl.reverse()\r\nj=0\r\ny=len(l)\r\nwhile(y>0):\r\n if(l[j]<=b):\r\n cnt2+=1\r\n else:\r\n break\r\n j+=1\r\n y-=1\r\nif(a==cnt1):\r\n print(cnt1)\r\nelse:\r\n print(cnt1+cnt2)\r\n", "num,level = map(int,input().split())\r\nproblemlist = [int(x)for x in input().split()]\r\nposition = []\r\n \r\nfor i in range (len(problemlist)):\r\n if problemlist[i]>level:\r\n position.append(i)\r\n \r\nif len(position)==1:\r\n print(num-1)\r\nelif len(position)==0:\r\n print(num)\r\nelse:\r\n print(position[0]+num-position[-1]-1)", "import sys\r\n\r\ndef main():\r\n n, k, *l = map(int, sys.stdin.read().strip().split())\r\n t = [i for i,j in enumerate(l) if j > k]\r\n if not t: return n\r\n return n - 1 - t[-1] + t[0]\r\n \r\nprint(main())", "n, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nl, r = 0, len(lst) - 1\r\nwhile l <= r:\r\n if lst[l] <= k:\r\n l += 1\r\n elif lst[r] <= k:\r\n r -= 1\r\n else:\r\n break\r\n\r\nprint(n - (r-l+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\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,k = lii()\r\narr = lii()\r\ndef left(arr,k):\r\n cnt=0\r\n while len(arr)>0:\r\n if arr[0]<=k and len(arr)!=0:\r\n cnt+=1\r\n arr.pop(0)\r\n else:\r\n break\r\n return cnt\r\ndef right(arr,k):\r\n cnt = 0\r\n while len(arr)>0:\r\n if arr[-1]<=k and len(arr)!=0:\r\n cnt+=1\r\n arr.pop(-1)\r\n else:\r\n break\r\n return cnt\r\nx = left(arr,k)\r\ny = right(arr,k)\r\nprint(x+y)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# https://codeforces.com/problemsets/acmsguru/problem/999/A\r\n\r\nn, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nr, l, p = 0, -1, 0\r\n\r\nwhile p < n:\r\n if arr[r] <= k or arr[l] <= k:\r\n if arr[r] <= k:\r\n r += 1\r\n else:\r\n l -= 1 \r\n p += 1\r\n else:\r\n break\r\n\r\nprint(p)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(n):\r\n if a[i]>k:\r\n break\r\n else:\r\n count+=1\r\nc=n-1\r\nwhile c>i:\r\n if a[c]>k:\r\n break\r\n else:\r\n count+=1\r\n c-=1\r\nprint(count)\r\n", "n, k = map(int, input().split())\r\narray = list(map(int, input().split()))\r\nproblems = array\r\ncount, flag = 0, True\r\nwhile flag and len(problems) > 0:\r\n if problems[0] <= k:\r\n count += 1\r\n problems.pop(0)\r\n elif problems[-1] <= k:\r\n count += 1\r\n problems.pop(-1)\r\n else:\r\n flag = False\r\n break\r\nprint(count)\r\n", "n,k = map(int, input().split())\r\n\r\nD_P=list(map(int,input().split()))\r\npro_sol = 0\r\n\r\nfor rl in range(len(D_P)):\r\n if D_P[0] > k:\r\n break\r\n else:\r\n pro_sol+=1\r\n D_P.pop(0)\r\n\r\nD_P.reverse() \r\nfor lr in range(len(D_P)):\r\n if D_P[0] > k:\r\n break\r\n else:\r\n pro_sol+=1\r\n D_P.pop(0)\r\n\r\nprint(pro_sol)", "no_problems, problem_solving_score = (map(int, input().split()))\r\nproblems_scores = list(map(int, input().split()))\r\n\r\ncounter = 0\r\nfor i in problems_scores:\r\n if problem_solving_score >= i:\r\n counter += 1\r\n else:\r\n break\r\n\r\nif counter == len(problems_scores):\r\n print(counter)\r\nelse:\r\n for i in problems_scores[::-1]:\r\n if problem_solving_score >= i:\r\n counter += 1\r\n else:\r\n break\r\n print(counter)\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ncnt = 0\r\nfor i in range(len(a)):\r\n if a[i] <= k:\r\n cnt += 1\r\n else:\r\n break\r\nif cnt == len(a):\r\n print(cnt)\r\nelse:\r\n for j in range(len(a)-1, 0, -1):\r\n if a[j] <= k:\r\n cnt += 1\r\n else:\r\n break\r\n print(cnt)\r\n", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\ncnt = 0\r\nwhile n:\r\n if a[n - 1] <= k:\r\n cnt += 1\r\n a.pop()\r\n n -= 1\r\n else:\r\n break\r\nwhile n:\r\n if a[0] <= k:\r\n cnt += 1\r\n a.pop(0)\r\n n -= 1\r\n else:\r\n break\r\nprint(cnt)\r\n", "x , y = map(int , input().split())\r\nz = list(map(int , input().split()))\r\n\r\na , b = 0 , 0\r\n\r\ni , j = 0 , x-1\r\nc = 0\r\n\r\nwhile i < x and z[i] <= y :\r\n a+=1\r\n i+=1\r\n\r\n\r\nwhile j > i and z[j] <= y:\r\n b+=1\r\n j-=1\r\n\r\nprint(a + b)", "n,k=map(int,input().split())\nl=list(map(int,input().split()))\ni=1\nc=0\nwhile (l[0]<=k or l[-1]<=k):\n if len(l)==1:\n if l[0]<=k:\n c+=1\n break\n elif i%2!=0:\n if l[0]<=k:\n l.pop(0)\n c+=1\n i+=1\n else:\n if l[-1]<=k:\n l.pop(-1)\n c+=1\n i+=1\nprint(c)\n", "n,k=map(int,input().split())\r\na=list(map(int, input().split()))\r\nc=0\r\nf=0\r\nfor i in range(n):\r\n if a[i]>k:\r\n f=1\r\n break\r\n c+=1\r\nif f==0:\r\n print(c)\r\n exit()\r\nfor i in range(n-1,-1,-1):\r\n if a[i]>k:\r\n break\r\n c+=1\r\nprint(c)", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nif(arr[0]>k and arr[n-1]>k):\r\n print(0) \r\nelse:\r\n filtered=list(filter(lambda x:x<=k,arr)) \r\n if(len(filtered)==n):\r\n print(n)\r\n elif(len(filtered)==0):\r\n print(0) \r\n else:\r\n rev_arr=list(reversed(arr))\r\n for i in range(0,n):\r\n x=arr[i]\r\n if(x>k):\r\n step=i\r\n break\r\n for j in range(0,n):\r\n y=rev_arr[j]\r\n if(y>k):\r\n end=n-j-1\r\n break\r\n \r\n print(n-len(arr[step:end+1])) ", "n,k=input().split()\r\nn=int(n)\r\nk=int(k)\r\na=list(map(int, input().split()))\r\nc=0\r\nind=0\r\nfor i in range(n):\r\n if i==n-1:\r\n ind=n-1\r\n if a[i]<=k:\r\n c+=1\r\n else:\r\n ind=i\r\n break;\r\nfor i in range(n-1,ind,-1):\r\n if a[i]<=k:\r\n c+=1\r\n else:\r\n break;\r\nprint(c)", "if __name__ == '__main__':\n n, k = list(map(int, input().split()))\n arr = list(map(int, input().split()))\n curr_end = True\n count = 0\n while curr_end:\n if len(arr) == 0:\n curr_end = False\n elif arr[0] <= k:\n arr.pop(0)\n count += 1\n elif arr[len(arr) - 1] <= k:\n arr.pop()\n count += 1\n else:\n curr_end = False\n\n\n print(count)", "# n problems in the contest \r\n# problem solving skill is = k \r\n# access is from one of the ends of the list \r\n\r\n\r\nn, k = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\ncount = 0 \r\nfound = False\r\nwhile lst:\r\n found = False\r\n if lst[0] <= k:\r\n count += 1\r\n lst.pop(0)\r\n found = True\r\n try:\r\n if lst[-1] <= k:\r\n count += 1\r\n lst.pop() \r\n found = True\r\n except:\r\n pass\r\n #print(lst)\r\n if not found:\r\n break\r\nprint(count)\r\n ", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nif max(a)<=d:\r\n print(n)\r\n exit()\r\nwhile a[0]<=d:\r\n a=a[1:]\r\n\r\nwhile a[-1]<=d:\r\n a=a[:-1]\r\nprint(n-len(a))", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\n\nc = 0\nc1 = 0\n\nfor i in range(len(l)):\n if l[i] <= k:\n c += 1\n else:\n break\n\nfor i in range(c):\n l.pop(0)\n\nl.reverse()\nfor i in range(len(l)):\n if l[i] <= k:\n c1 += 1\n else:\n break\n\nprint(c+c1)", "n, k = map(int, input().split())\r\n\r\n# print(n, k)\r\n\r\na = [int(i) for i in input().split()]\r\n\r\nrl = lr = 0\r\n\r\nfor x in range(n):\r\n if a[x] <= k:\r\n lr += 1\r\n else:\r\n break\r\nfor y in range(n - 1, -1, -1):\r\n if a[y] <= k:\r\n rl += 1\r\n else:\r\n break\r\n\r\nif n < lr + rl:\r\n print(n)\r\nelse:\r\n print(lr+rl)\r\n", "n,k = [int(x) for x in input().split()]\r\nlis = list(map(int,input().split()))\r\nvalue = 0\r\nl = n\r\nfor i in range(n):\r\n if lis[i]<=k:\r\n value+=1\r\n else:\r\n l = i\r\n break \r\nfor j in range(n-1,0,-1):\r\n if ((lis[j]<=k) and (j >l)):\r\n value = value+1\r\n else:\r\n break\r\nprint(value)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n \r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n left = 0\r\n right = n -1\r\n for i in range(n):\r\n if a[left] <= k:\r\n left += 1\r\n elif a[right] <= k:\r\n right -= 1\r\n else:\r\n break\r\n print(left+(n-right-1))\r\n \r\nif __name__ == '__main__':\r\n solve()\r\n \r\n\r\n", "m,n = map(int,input().split(\" \"))\r\ns = list(map(int,input().split(\" \")))\r\ni,j,sumi=0,len(s)-1,0 \r\nwhile(i<=j and (s[i]<=n or s[j]<=n)):\r\n if(s[i]<=n):\r\n sumi=sumi+1 \r\n i=i+1 \r\n if(i<j and s[j]<=n):\r\n sumi=sumi+1 \r\n j=j-1\r\nprint(sumi)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=a[::-1]\r\nc=0\r\nfor i in a:\r\n if(i<=k):\r\n c+=1\r\n else:\r\n break\r\nfor i in b:\r\n if(i<=k):\r\n c+=1\r\n else:\r\n break\r\nif(c>n):\r\n print(n)\r\nelif(c!=0):\r\n print(c)\r\nelse:\r\n print(0)\r\n", "a,b = map(int,input().split())\r\nc = list(map(int,input().split()))\r\nd = 0\r\nwhile True:\r\n try:\r\n if c[0] <= b:\r\n d += 1\r\n c.pop(0)\r\n elif c[-1] <= b:\r\n d += 1\r\n c.pop(-1)\r\n else:\r\n print(d)\r\n break\r\n except IndexError:\r\n print(d)\r\n break\r\n\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[29]:\n\n\na = input('').split()\nn , k = int(a[0]) , int(a[1])\nb = input('').split()\nb = list(map(int,b))\ncount=0\nfor i in b:\n if k >= i:\n count+=1\n else:\n for j in b[::-1]:\n if k >= j:\n count+=1\n else:\n break\n break\n\nprint(count)\n\n\n# In[ ]:\n\n\n\n\n", "n, k = map(int, input().split())\n\na = list(map(int, input().split()))\n\np1 = 0\np2 = len(a) - 1\nres = 0\nwhile p1 <= p2:\n if a[p1] < a[p2]:\n if a[p1] > k:\n break\n p1 = p1 + 1\n else:\n if a[p2] > k:\n break\n p2 = p2 - 1\n res = res + 1\n\nprint(res)\n", "from sys import stdin, stdout, maxsize\r\n\r\ndef f(problems,k)-> int:\r\n c = 0\r\n i = 0\r\n while(i < len(problems) and problems[i] <= k):\r\n c += 1\r\n i += 1\r\n j = len(problems) - 1\r\n while(problems[j] <= k and j > i):\r\n c += 1\r\n j -= 1\r\n return (c)\r\n \r\nl = stdin.readline().split()\r\nn = int(l[0]);k = int(l[1])\r\narr = [int(x) for x in stdin.readline().split()]\r\n\r\nprint(f(arr,k))", "def read_input(): return list(map(int, input().split()))\r\n\r\ninputs = read_input()\r\nproblems_input = read_input()\r\n\r\nn = inputs[0]\r\nk = inputs[1]\r\n\r\nproblems = problems_input\r\n\r\nsolved = 0\r\n\r\ndef solve_side(k, problems, right=False):\r\n\r\n solved_problems = 0\r\n\r\n if right:\r\n problems.reverse()\r\n\r\n while len(problems) > 0:\r\n if problems[0] <= k:\r\n problems.remove(problems[0])\r\n solved_problems += 1\r\n else:\r\n break\r\n \r\n return solved_problems\r\n\r\n# leftmost\r\nsolved += solve_side(k, problems)\r\n\r\n# rightmost\r\nsolved += solve_side(k, problems, right=True)\r\n\r\nprint(solved)", "n,k = map(int, input().split())\na = list(map(int, input().split()))\nsolved = 0\n\nwhile a[0] <= k or a[len(a)-1] <= k:\n if a[0] <= k:\n solved += 1\n a = a[1:len(a)]\n elif a[-1] <= k:\n solved += 1\n a = a[0:len(a)-1]\n if len(a) == 0:\n a = [k+1]\nprint(solved)\n\t \t\t\t \t \t\t\t \t \t \t \t \t\t", "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, k = map(int, input().split())\r\na = deque([int(x) for x in input().split()])\r\n\r\nwhile a and a[0] <= k :\r\n a.popleft()\r\nwhile a and a[-1] <= k :\r\n a.pop()\r\n\r\nprint(n - len(a))", "n, k = list(map(int,input().split()))\narreglo = list(map(int,input().split()))\ncont = 0\nnp = 0\n\nfor i in range(len(arreglo)):\n\n if k >= arreglo[cont]:\n np = np + 1\n cont = cont + 1\n elif k >= arreglo[-1]:\n np = np + 1\n arreglo.pop()\n else:\n break \n\nprint(np)\n\t \t\t\t\t\t \t\t \t\t \t\t \t \t\t\t \t\t\t", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if arr[i] <= k:\r\n ans += 1\r\n else:\r\n break\r\nfor j in range(-1, -n - 1, -1):\r\n if arr[j] <= k:\r\n ans += 1\r\n else:\r\n break\r\nprint(min(ans, n))\r\n", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\nsolved = 0\nfor i in range(len(l)-1, -1, -1):\n if l[i] > k:\n break\n solved += 1\n\nfor i in range(0, i):\n if l[i] > k:\n break\n solved += 1\n\nprint(solved)\n", "def test():\r\n n,k=[int(i) for i in input().split()]\r\n l=[int(i) for i in input().split()]\r\n f=0\r\n b=0\r\n for x in l:\r\n if x>k:\r\n break\r\n else:\r\n f+=1\r\n for x in reversed(l):\r\n if x>k:\r\n break\r\n else:\r\n b+=1\r\n if f+b==2*n:\r\n print(n)\r\n else:\r\n print(f+b)\r\n return 0\r\nt=1\r\nfor i in range(t):\r\n test()", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nc=0\r\nflag=1\r\nfor val in l:\r\n if val<=k:\r\n c+=1\r\n else:\r\n flag=0\r\n break\r\nif flag==1:\r\n print(c)\r\nelse:\r\n for val in l[::-1]:\r\n if val<=k:\r\n c+=1\r\n else:\r\n break\r\n print(c)", "n, k = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\n\r\nres = 0 \r\n\r\nwhile l: \r\n if l[0] <= k:\r\n l.pop(0)\r\n elif l[-1] <= k: \r\n l.pop(-1)\r\n else: \r\n break \r\n res += 1\r\nprint(res)", "from collections import deque\n\ndef solve(l, k):\n ret = 0\n while len(l) > 0:\n if l[0] <= k:\n l.popleft()\n ret += 1\n continue\n if l[len(l)-1] <= k:\n l.pop()\n ret += 1\n continue\n break\n return ret\n\nn,k=map(int, input().split(\" \"))\nl = deque(map(int, input().split(\" \")))\nprint (solve(l,k))", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nwhile len(a) >= 1 and a[0] <= k:\r\n ans += 1\r\n a = a[1:]\r\nwhile len(a) >= 1 and a[-1] <= k:\r\n ans += 1\r\n a = a[:len(a)-1]\r\nprint (ans)\r\n", "\n[prob_amt, max_skill] = [int(el) for el in input().split()]\n\nprob_list = input().split()\n\nmax_probs = 0\nended = False\n\nfor j in range(prob_amt):\n if int(prob_list[j]) <= max_skill: max_probs += 1\n else:\n ended = True\n break\n\nfor j in range(prob_amt):\n index = prob_amt - 1 -j\n if int(prob_list[index]) <= max_skill: max_probs += 1\n else:\n ended = True\n break\n \nif ended: print(max_probs)\nelse: print(prob_amt)\n\n \t\t \t\t \t\t \t \t\t\t \t\t \t\t\t\t \t\t", "y=list(map(int,input().split()))\r\nx=list(map(int,input().split()))\r\nl=0\r\nr=0\r\nfor i in x:\r\n if i<=y[1]:\r\n l+=1\r\n elif i>y[1]:\r\n break \r\nx.reverse() \r\nfor i in x:\r\n if i<=y[1]:\r\n r+=1\r\n elif i>y[1]:\r\n break\r\nif l==y[0] and r==y[0]:\r\n print(y[0])\r\nelse:\r\n print(l+r) \r\n \r\n ", "# Wadea #\r\n\r\nn,k = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nans = 0\r\nwhile True:\r\n if arr[0] <= k:\r\n ans += 1\r\n arr = arr[1:]\r\n elif arr[-1] <= k:\r\n arr = arr[:-1]\r\n ans += 1\r\n else:\r\n break\r\n if ans == n:break\r\nprint(ans)", "t1=1\r\nfor _ in range(t1):\r\n n,k=map(int,input().split());p=0\r\n a=list(map(int,input().split()))\r\n for i in a:\r\n if i<=k:\r\n p+=1\r\n else:\r\n break\r\n a.reverse()\r\n if p<n:\r\n for i in a:\r\n if i<=k:\r\n p+=1\r\n else:\r\n break\r\n print(p)\r\n", "n,k=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nfirst=-1;last=-1\r\nfor i in range(n):\r\n if lis[i]>k:\r\n if first==-1:\r\n first=i\r\n last=i\r\nif first==-1:\r\n print(n)\r\nelse:\r\n print(first+n-1-last)", "n,k=[int(x)for x in input().rstrip().split()]\r\na=[int(x)for x in input().rstrip().split()]\r\ncount=0\r\nl1=[]\r\nf=0\r\nfor i in range(0,n):\r\n if a[i]<=k:\r\n count+=1\r\n f=1 \r\n\r\n else:\r\n a=a[i:]\r\n f=0\r\n break\r\nif f==1:\r\n print(count)\r\nelse:\r\n \r\n a=a[::-1]\r\n for i in range(0,len(a)):\r\n if a[i]<=k:\r\n count+=1\r\n else:\r\n break\r\n print(count)\r\n\r\n \r\n", "n, k = [int(i) for i in input().split()]\r\nw = [int(i) for i in input().split()]\r\n\r\nif k >= max(w):\r\n print(n)\r\nelse:\r\n count = 0\r\n for i in range(n):\r\n if w[i] <= k:\r\n count += 1\r\n else:\r\n break\r\n for i in range(n-1, 0, -1):\r\n if w[i] <= k:\r\n count += 1\r\n else:\r\n break\r\n print(count)\r\n", "a,b=map(int,input().split())\r\nls=list(map(int,input().split()))\r\ntemp=ls[::-1]\r\ncount=0\r\nfor j in range(len(ls)):\r\n if ls[j]<=b:\r\n count+=1\r\n if ls[j]>b:\r\n break\r\nif count==a:\r\n print(count)\r\nelse:\r\n for i in range(len(temp)):\r\n if temp[i]<=b:\r\n count+=1\r\n if temp[i]>b:\r\n break\r\n print(count)", "a,b=map(int,input().split())\nc=input().split()\nd=[]\nfor i in c:\n d.append(int(i))\nflag=1\ns=0\nwhile flag:\n if b>=d[0]:\n s+=1\n d.pop(0)\n if d==[]:\n break\n else:\n if b>=d[-1]:\n s+=1\n d.pop(-1)\n if d==[]:\n break\n else:\n continue\n else:\n if b>=d[-1]:\n s+=1\n d.pop(-1)\n else:\n break\nprint(s)\n\n \t \t \t\t \t\t\t \t \t\t \t \t\t \t \t \t\t\t", "#----------------start of template ----------------------\r\nimport sys\r\nfrom bisect import bisect_left, bisect_right\r\nfrom heapq import heapify,heappush,heappop\r\nfrom collections import deque\r\nfrom math import gcd,sqrt,log10,log2,floor,ceil,sqrt\r\nfrom collections import deque,defaultdict\r\ninput=sys.stdin.readline\r\n# sys.setrecursionlimit(10**6)\r\ndef il():\r\n return [int(a) for a in input().strip().split()]\r\ndef ip():\r\n return input().strip()\r\ndef ii():\r\n return int(input())\r\nmod=1000000000+7\r\ndx=[-1,-2,1,2,2,-2,-1,1]\r\ndy=[2,1,2,1,-1,-1,-2,-2] #knight\r\n#-----------------end of template -----------------------\r\nn,k=il()\r\narr=il()\r\nans=0\r\ni=0\r\nj=n-1\r\nwhile(i<=j):\r\n if arr[i]<=k:\r\n i+=1\r\n elif arr[j]<=k:\r\n j-=1\r\n else:\r\n break\r\n ans+=1\r\nprint(ans)", "x = input()\r\ny = input()\r\ninp = x.split()\r\nList = y.split()\r\nn = int(inp[0])\r\nk = int(inp[1])\r\nleft = int(List[0])\r\nright = int(List[-1])\r\nR = 0\r\nwhile( (left<=k or right<=k) and R<n ) :\r\n left = int(List[0])\r\n right = int(List[-1])\r\n if (left<=k) :\r\n R+=1\r\n List.pop(0)\r\n elif(right<=k) :\r\n R+=1\r\n List.pop()\r\n\r\nprint(R)\r\n \r\n", "n,k = map(int, input().split(' '))\nprint(n - len(''.join('x '[int(v) <= k] for v in input().split()).strip()))\n \t \t \t\t \t \t\t\t \t \t\t\t\t\t\t \t", "nk = input().split()\r\nn = int(nk[0])\r\nk = int(nk[1])\r\n\r\na = input().split()\r\n\r\nflag = True\r\ncounter = 0\r\nnumbers = []\r\n\r\nfor item in a:\r\n numbers.append(int(item))\r\n\r\nwhile flag:\r\n\r\n if len(numbers) > 0:\r\n if (numbers[0] <= k < numbers[-1]) or (numbers[0] <= k and numbers[-1] <= k):\r\n counter += 1\r\n numbers.remove(numbers[0])\r\n\r\n elif numbers[-1] <= k < numbers[0]:\r\n counter += 1\r\n numbers.pop()\r\n else:\r\n flag = False\r\n break\r\n else:\r\n flag = False\r\n break\r\n\r\nprint(counter)\r\n\r\n", "'''HackerRank: Mishka and Contest'''\r\n\r\nif __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n count = 0\r\n while len(arr) > 0:\r\n if arr[0] <= k:\r\n count += 1\r\n del arr[0]\r\n elif arr[-1] <= k:\r\n count += 1\r\n del arr[-1]\r\n else:\r\n break\r\n\r\n print(count)\r\n", "# https://codeforces.com/contest/999/problem/A\ndef find_number_pb(arr, k):\n count = 0\n while count < len(arr) and arr[count] <= k:\n count += 1\n \n i = len(arr) - 1\n while i >= 0 and arr[i] <= k:\n count += 1\n i -= 1\n \n return min(len(arr), count)\n\ndef main():\n n, k = map(int, input().split())\n arr = list(map(int, input().split()))\n print(find_number_pb(arr, k))\n\nif __name__ == \"__main__\":\n main()\n", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\n\r\ncount = 0\r\n\r\nwhile a[0] <= k or a[-1] <= k:\r\n if a[0] <= k:\r\n count += 1\r\n a.pop(0)\r\n elif a[-1] <= k:\r\n count += 1\r\n a.pop(-1)\r\n if len(a) == 0:\r\n break\r\n\r\nprint(count)\r\n", "n,k = list(map(int, input().split()))\r\ntasks = list(map(int, input().split()))\r\ni = 0\r\ncnt = 0\r\nwhile i < n and tasks[i] <= k:\r\n\tcnt += 1\r\n\ti += 1\r\nj = 0\r\nwhile j < (n-i-1) and tasks[-1-j] <= k:\r\n\t\tcnt += 1\r\n\t\tj += 1\r\nprint(cnt)", "_=lambda:map(int,input().split())\r\nn,k=_()\r\na=list(_())\r\nf=lambda l:next(i for i,x in enumerate(l)if x>k)\r\ntry:r=f(a)+f(a[::-1])\r\nexcept:r=len(a)\r\nprint(r)", "t,k=[int(x) for x in input().split()]\r\narr=[int(x) for x in input().split()]\r\nc=0\r\nflag=True\r\ni=0\r\nwhile(flag):\r\n if(len(arr)!=0):\r\n\r\n if( arr[i]<=k ):\r\n c+=1\r\n arr.pop(i)\r\n else:\r\n if(arr[len(arr)-1]<=k):\r\n c+=1\r\n arr.pop(len(arr)-1)\r\n else:\r\n flag=False\r\n else:\r\n flag=False\r\n\r\nprint(c)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=l[::-1]\r\nc1=0\r\nc2=0\r\nfor i in l:\r\n if i>k:\r\n break\r\n else:\r\n c1+=1\r\nfor j in l1:\r\n if j>k:\r\n break\r\n else:\r\n c2+=1\r\nif c1+c2>=n:\r\n print(n)\r\nelse:\r\n print(c1+c2)", "n,k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\nres = 0\r\nb = 1\r\nfor i in range(n):\r\n if a[i] <= k:\r\n res += 1\r\n else:\r\n break\r\nif res == n:\r\n print(res)\r\n b = 0\r\nif b:\r\n for i in range(1,n+1):\r\n if a[-i] <= k:\r\n res += 1\r\n else:\r\n break\r\n print(res)", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n###########################################\r\nn,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n if a[i] <= k:\r\n count += 1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if a[i] <= k:\r\n count += 1\r\n else:\r\n break\r\nprint(n if count >= n else count)", "n, k = map(int, input().split())\r\nproblem_list = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nfor item in problem_list:\r\n if(item <= k):\r\n ans += 1\r\n else:\r\n break\r\n\r\nif ans != n:\r\n for item in reversed(problem_list):\r\n if(item <= k):\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ni = 0 \r\nj = n-1\r\nwhile i<n and a[i]<=k:\r\n i+=1\r\nwhile j>0 and a[j]<=k:\r\n j-=1\r\n i+=1\r\nprint(min(i,n))", "n,k=[int(i) for i in input().strip().split()]\r\nl=[int(i) for i in input().strip().split()]\r\nnb=0\r\na=0\r\nfor i in range(len(l)):\r\n if l[i]<=k:\r\n nb+=1\r\n a+=1\r\n else:\r\n break\r\nfor i in range(n-1,a,-1):\r\n if l[i]<=k:\r\n nb+=1\r\n else :\r\n break\r\n\r\nprint(nb)\r\n", "a, b = map(int, input().split())\r\nq = list(map(int, input().split()))\r\nif max(q) <= b:\r\n print(len(q))\r\nelse:\r\n x = 0\r\n y = len(q)-1\r\n while q[x] <= b or q[y] <= b:\r\n if q[x] <= b:\r\n x += 1\r\n if q[y] <= b:\r\n y -= 1\r\n print(len(q) - ((y - x) + 1))", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nwhile a and a[0] <= k:\r\n count += 1\r\n a.pop(0)\r\n\r\nwhile a and a[-1] <= k:\r\n count += 1\r\n a.pop()\r\n\r\nprint(count)", "n, m = map(int, input(). split())\r\narr = list(map(int, input(). split()))\r\nans = 0\r\nq = 0\r\nans0 = 0\r\nfor i in range(n):\r\n if arr[i] > m:\r\n q = (i + 1)\r\n break\r\n else:\r\n ans += 1\r\nq = i + 1\r\ne = arr[q : ]\r\ne. reverse()\r\nfor j in e:\r\n if j > m:\r\n break\r\n else:\r\n ans0 += 1\r\nprint(ans + ans0)\r\n", "import sys\ninput = sys.stdin.readline\n\nL, K = map(int, input().split())\nA = list(map(int, input().split()))\n\nr = 0\nwhile A and A[-1] <= K :\n\tA.pop()\n\tr += 1\nA.reverse()\n\nwhile A and A[-1] <= K :\n\tA.pop()\n\tr += 1\nprint(r)", "import sys\r\n\r\n\r\nLI = lambda: list(map(int, sys.stdin.readline().split()))\r\nMI = lambda: map(int, sys.stdin.readline().split())\r\nSI = lambda: sys.stdin.readline().strip('\\n')\r\nII = lambda: int(sys.stdin.readline())\r\n\r\n# sys.stdin = open(\"Round 4 - 490/input.txt\", \"r\")\r\n\r\nn, k = MI()\r\n\r\np = LI()\r\ns = 0\r\nv = True\r\nwhile v:\r\n try:\r\n\r\n if p[0] <= k:\r\n p.pop(0)\r\n s += 1\r\n elif p[-1] <= k:\r\n p.pop(-1)\r\n s += 1\r\n else:\r\n v = False\r\n except:\r\n v = False\r\n\r\nprint(s)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl1=l[::-1]\r\nc=p=0\r\nfor i in l:\r\n if i<=k:\r\n c+=1 \r\n else:\r\n break\r\nif c==len(l):\r\n print(c)\r\nelse:\r\n for i in l1:\r\n if i<=k:\r\n p+=1 \r\n else:\r\n break \r\n print(c+p)\r\n ", "def get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn, k = gets(int)\na = gets(int)\nwhile a and a[-1] <= k:\n a.pop()\nwhile a and a[0] <= k:\n a.pop(0)\nprint(n - len(a))\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n if(a[i]>k):\r\n b.append(i)\r\nif(len(b)==0):\r\n print(n)\r\nelse:\r\n print(n-(b[-1]-b[0]+1))", "n,k=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nt=0\r\nfor el in arr:\r\n if el>k:\r\n break\r\n else :\r\n t+=1\r\nif t==n:\r\n print(t)\r\nelse :\r\n for el in arr[::-1]:\r\n if el>k:\r\n break\r\n else :\r\n t+=1\r\n print(t)", "n,k=[int(w) for w in input().split()]\r\na=0\r\nb=0\r\nx=[int(w) for w in input().split()]\r\nfor i in range(n):\r\n if x[i]>k:\r\n break\r\n a+=1\r\nx=x[::-1]\r\nfor i in range(n):\r\n if x[i]>k:\r\n break\r\n b+=1\r\nprint(min(n,a+b))", "a,b=map(int,input().split())\nlst=list(map(int,input().split()))\nc=0\nd=0\nfor i in range(len(lst)):\n if lst[i]<=b:\n c=c+1\n else:\n break\nif i==len(lst)-1:\n print(c)\nelse:\n j=i\n for i in range(len(lst)-1,-1,-1):\n if lst[i]<=b:\n d=d+1\n else:\n break\n print(c+d)\n \n \t\t\t\t\t\t\t \t\t\t \t\t \t\t\t \t \t", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n if a[i] <= k:\r\n ans += 1\r\n else:\r\n break\r\nif ans < n:\r\n for i in range(n - 1, 0, -1):\r\n if a[i] <= k:\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(n):\r\n\tif a[i] <= k:\r\n\t\tcount +=1\r\n\telse:\r\n\t\tbreak\r\nif count == n:\r\n\tprint(n)\r\nelse:\r\n\tfor i in range(n-1,-1,-1):\r\n\t\tif a[i] <= k:\r\n\t\t\tcount += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tprint(count)", "x = input().split()\r\ny = [int(i) for i in x]\r\nn = y[0]\r\nk = y[1]\r\nj = input().split()\r\nm = [int(i) for i in j]\r\nsum = 0 \r\nl = 0 \r\nr= n-1\r\nwhile 1 :\r\n if m[l]<=k:\r\n sum= sum+1\r\n l = l+1\r\n elif m[r]<=k:\r\n sum = sum +1 \r\n r = r-1\r\n else :\r\n break\r\n if r<l :\r\n break\r\n \r\nprint(sum) \r\n ", "a,b=map(int,input().split())\r\nc=list(map(int,input().split()))\r\nc1=0\r\nc2=0\r\nfor i in range(a):\r\n if c[i]>b:\r\n break\r\n else:\r\n c1+=1\r\nfor i in range(a-1,-1,-1):\r\n if c[i]>b:\r\n break\r\n else:\r\n c2+=1\r\nif c1==a or c2==a:\r\n print(a)\r\nelse:\r\n print(c1+c2)\r\n ", "def solve():\r\n #n = int(input())\r\n n,k = list(map(int,input().split()))\r\n a = list(map(int,input().split()))\r\n m,o = 0,0\r\n for i in range(n):\r\n if a[i] > k:\r\n break\r\n m += 1\r\n if m == n:\r\n return m\r\n for i in range(n - 1, m,-1):\r\n if a[i] > k:\r\n break\r\n o += 1\r\n return m + o\r\n#for i in range(int(input())):\r\nprint(solve())", "n_k= input().split()\r\nn = int(n_k[0])\r\nk = int(n_k[1])\r\nsol = 0\r\na = list(map(int,input().split()))\r\nwhile a and a[0]<=k:\r\n a.pop(0)\r\n sol+=1\r\na.reverse()\r\nwhile a and a[0]<=k:\r\n a.pop(0)\r\n sol+=1\r\nprint (sol)", "n,k = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nwhile(True):\r\n\tif(len(l)==0):\r\n\t\tbreak\r\n\tif(l[0]<=k):\r\n\t\tl.remove(l[0])\r\n\telif(l[len(l)-1]<=k):\r\n\t\tdel l[len(l)-1]\r\n\telse:\r\n\t\tbreak\r\nprint(n-len(l))", "length, k = map(int, input().split())\narray = list(map(int, input().split()))\ncount = 0\nfor i in range(length):\n if array[i] > k:\n break\n else:\n count += 1\nif count == length:\n print(count)\nelse:\n for x in range(length - 1, -1, -1):\n if array[x] > k:\n break\n else:\n count += 1\n print(count)\n", "n, k = [int(x) for x in input().split()]\nlista = [int(x) for x in input().split()]\ncontador = 0\nfor x in range(n):\n if lista[x] > k:\n indice = x\n break\n else:\n contador += 1\n indice = x\n\nfor x in range(len(lista)-1,indice,-1):\n if lista[x] > k:\n break\n else:\n contador += 1\n\nprint(contador)\n\t\t \t\t\t\t \t\t \t\t \t \t \t \t \t", "# ser = 0\r\n# dima = 0\r\n# d = [int(d) for d in input().split()]\r\n# while len(d) != 0:\r\n# if d[0] > d[-1]:\r\n# ser += d.pop(0)\r\n# else:\r\n# ser += d.pop(-1)\r\n# if len(d) == 0:\r\n# break\r\n# if d[0] > d[-1]:\r\n# dima += d.pop(0)\r\n# else:\r\n# dima += d.pop(-1)\r\n# print(ser, dima)\r\n\r\ncount = 0\r\nx = [int(x) for x in input().split()]\r\nd = [int(d) for d in input().split()]\r\nfor i in range(len(d)):\r\n if d[0] > x[1] and d[-1] > x[1]:\r\n break\r\n elif d[0] <= x[1]:\r\n count += 1\r\n d.pop(0)\r\n elif d[-1] <= x[1]:\r\n count += 1\r\n d.pop(-1)\r\nprint(count)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nx=0\r\nfor i in range(n):\r\n\tif l[0]<=k:\r\n\t\tx+=1\r\n\t\tl.pop(0)\r\n\telif l[-1]<=k:\r\n\t\tl.pop(-1)\r\n\t\tx+=1\r\n\telse:\r\n\t\tbreak\r\nprint(x)", "n,s = map(int,input().split())\r\np = list(map(int,input().split()))\r\nctr=0\r\nfor i in range(n):\r\n if p[i] <= s:\r\n ctr+=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if p[i] <= s:\r\n ctr+=1\r\n else:\r\n break\r\n \r\nif ctr//2 == n:\r\n print(ctr//2)\r\nelse:\r\n print(ctr)", "n,b=map(int,input().split(' '))\r\nx=list(map(int,input().strip().split(' ')))\r\nk=0\r\nfor i in range(n):\r\n if x[i]>0 and x[i]<=b:\r\n x[i]=0\r\n k+=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if x[i]>0 and x[i]<=b:\r\n x[i]=0\r\n k+=1\r\n else:\r\n break\r\n\r\nprint(k)\r\n", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ns,j=0,0\r\n\r\nfor i in range(n):\r\n if l[i]>k:\r\n s=i+1\r\n break\r\nl=l[::-1]\r\nfor i in range(n):\r\n if l[i]>k:\r\n j=i+1\r\n break\r\nj=n-j+1\r\na=n-(j-s)-1\r\nif a<0:\r\n print(n)\r\nelse:\r\n print(a)\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nres=0\r\nfor i in range(n):\r\n if a[i]<=k:\r\n res+=1\r\n else:\r\n break\r\na=a[i+1:]\r\n\r\na.reverse()\r\n\r\nfor e in a:\r\n if e<=k:\r\n res+=1\r\n else:\r\n break\r\nprint(res)", "def solve(n, m, t):\r\n\r\n count = 0\r\n\r\n while True:\r\n if len(t) == 0:\r\n return count\r\n elif t[0] <= m:\r\n count += 1\r\n t.pop(0)\r\n elif t[-1] <= m:\r\n count += 1\r\n t.pop()\r\n else:\r\n return count\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n t = list(map(int, input().split()))\r\n print(solve(n, m, t))", "s = input().split(\" \")\r\nn = int(s[0])\r\nk = int(s[1])\r\na = list(map(int, input().split(\" \")))\r\ni = 0\r\nj = n - 1\r\nc = 0\r\nwhile(i < n):\r\n if(a[i] <= k):\r\n c += 1\r\n i += 1\r\n else:\r\n break\r\nwhile(j > i):\r\n if(a[j] <= k):\r\n c += 1\r\n j -= 1\r\n else:\r\n break\r\n \r\nprint(c)\r\n \r\n \r\n", "n,d=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc1=0\r\nans=0\r\nwhile c1<n and a[c1]<=d:\r\n c1+=1\r\n ans+=1\r\nc2=n-1\r\nwhile c2>c1 and a[c2]<=d:\r\n c2-=1\r\n ans+=1\r\nprint(ans)", "n1 = input().split()\r\nlist1 = []\r\nfor i in n1:\r\n list1.append(int(i))\r\nn2 = input().split()\r\nlist2 = []\r\nfor i in n2:\r\n list2.append(int(i))\r\n \r\nk1 = 0\r\nb1 = False\r\nn = list1[0]\r\nk = list1[1]\r\ncount = 0\r\nwhile b1==False:\r\n if len(list2) == 0:\r\n print(count)\r\n break\r\n temp1 = list2[0]\r\n temp2 = list2[-1]\r\n if temp1 <= k:\r\n count+=1\r\n list2.pop(0)\r\n continue\r\n elif temp2 <= k:\r\n count+=1\r\n list2.pop(-1)\r\n continue\r\n else:\r\n print(count)\r\n break\r\n ", "import sys\ninput = sys.stdin.readline\n\nn, k = [int(i) for i in input().split()]\na = [int(i) for i in input().split()]\nc = 0\nwhile len(a) > 0 and a[0] <= k:\n c += 1\n a = a[1:]\nwhile len(a) > 0 and a[-1] <= k:\n c += 1\n a = a[:-1]\nprint(c)\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ni = next((i for i in range(n) if a[i] > k), -1)\nif i == -1:\n print(n)\nelse:\n j = next(j for j in reversed(range(n)) if a[j] > k)\n print(n - j + i - 1)\n", "\r\nn, maxN = list(map(int, input().split()))\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n \r\n if nums[i] <= maxN:\r\n\r\n ans += 1\r\n \r\n else:\r\n break\r\n\r\nif ans != n:\r\n for i in range(n):\r\n if nums[::-1][i] <= maxN:\r\n\r\n ans += 1\r\n else:\r\n break\r\n\r\nprint(ans)", "length = [int(i) for i in input().split(' ')]\r\narray = [int(i) for i in input().split(' ')]\r\nmishka = [] \r\nfor i in range(length[0]):\r\n if array[i] <= length[1]:\r\n mishka.append(array[i])\r\n else:\r\n break\r\nif len(mishka) != length[0]:\r\n for i in array[::-1]:\r\n if i <= length[1]:\r\n mishka.append(i)\r\n else:\r\n break\r\n\r\nprint(len(mishka)) ", "n,k=list(map(int,input().split()))\r\nlst=list(map(int,input().split()))\r\ncount1=0\r\ncount2=0\r\nfor i in lst:\r\n if i<=k:\r\n count1+=1\r\n else:\r\n break\r\nfor i in reversed(lst):\r\n if i<=k:\r\n count2+=1\r\n else:\r\n break\r\nif count1+count2>n:\r\n print(n)\r\nelse:\r\n print(count1+count2)", "\r\nn,k = map(int, input().split())\r\nproblems = [int(i) for i in input().split()]\r\ncount = 0\r\nfor i in range(n):\r\n if (k >=problems[0] ) :\r\n problems.pop(0)\r\n count = count +1 \r\n elif ( k >=problems[-1] ): \r\n problems.pop(-1)\r\n count = count +1 \r\n\r\n else:\r\n break\r\nprint(count)", "n,k = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\ncnt = 0\r\nwhile len(a) > 0 and (a[0] <= k or a[-1] <= k):\r\n if a[-1] <= k:\r\n a.pop()\r\n elif a[0] <= k:\r\n a.pop(0)\r\n cnt += 1\r\nprint(cnt)", "n, k = map(int,input().split())\r\na = list(map(int,input().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n if(k >= a[i]):\r\n cnt+=1\r\n else:\r\n break\r\nif(cnt!=n):\r\n for i in range(n-1,-1,-1):\r\n if(k >= a[i]):\r\n cnt += 1\r\n else:\r\n break\r\nprint(cnt)\r\n\r\n", "n,k = input().split()\r\nn,k = int(n),int(k)\r\nproblems = list(map(int, input().split()))\r\nindex = 0 ; reverse = n - 1 ; n = len(problems)\r\ncount = 0\r\n\r\nfor i in range(n) :\r\n if problems[index] <= k :\r\n count += 1\r\n index += 1\r\n elif problems[reverse] <= k :\r\n count += 1\r\n reverse -= 1\r\n else :\r\n break\r\n\r\nprint(count)", "line1=str(input())\r\nline1=line1.split(\" \")\r\nn=int(line1[0])\r\nk=int(line1[1])\r\nstring=str(input())\r\nstring=string.split(\" \")\r\nlist=[]\r\nfor i in range(len(string)):\r\n list.append(int(string[i]))\r\n#print(list)\r\ni=0\r\nj=len(list)-1\r\ncount=0\r\n\r\nwhile(True):\r\n if(i==len(list)):\r\n break\r\n if (list[i]<=k):\r\n count+=1\r\n #print(list[i],\"here\")\r\n i+=1\r\n elif (list[j]<=k):\r\n count+=1\r\n # print(list[j],\"no here\")\r\n j-=1\r\n else:\r\n break\r\nprint(count)\r\n\r\n", "MAX = 0\r\nN, K = map(int,input().split())\r\nstack = list(map(int,input().split()))\r\nwhile (stack and (stack[0] <= K or stack[-1] <= K)):\r\n MAX += 1\r\n if (stack[0] <= K): stack.pop(0)\r\n elif (stack[-1] <= K): stack.pop(-1)\r\nprint(MAX)", "n, k = tuple([int(num) for num in input().split()])\narr = [int(num) for num in input().split()]\ncounter = 0\nwhile(len(arr) > 0):\n\tif(arr[0] <= k):\n\t\tarr = arr[1:]\n\t\tcounter += 1\n\telif(arr[-1] <= k):\n\t\tarr = arr[:-1]\n\t\tcounter += 1\n\telse:\n\t\tbreak\nprint(counter)", "if __name__ == '__main__':\r\n n, k = map(int, input().split())\r\n aa = list(map(int, input().split()))\r\n left_count, right_count = 0, 0\r\n for a in aa:\r\n if a > k:\r\n break\r\n left_count += 1\r\n for a in reversed(aa):\r\n if a > k:\r\n break\r\n right_count += 1\r\n print(min(n, left_count + right_count))\r\n", "\r\nm,k=[int(i) for i in input().split(\" \")]\r\ns=[int(i) for i in input().split(\" \")]\r\nl_count=0\r\nr_count=0\r\n\r\nfor i in range(len(s)):\r\n if s[i]<=k:\r\n l_count+=1\r\n else:\r\n break\r\nfor i in reversed(range(len(s))):\r\n if s[i]<=k:\r\n r_count+=1\r\n else:\r\n break\r\nif len(s)==r_count:\r\n print(len(s))\r\nelse:\r\n print(r_count+l_count)", "n, k = map(int, input().split(\" \"))\r\np = list(map(int, input().split(\" \")))\r\ncounter = 0\r\ncheck = 1\r\nfor i in p:\r\n if i > k:\r\n check = 0\r\n break\r\n else:\r\n counter += 1\r\nif check == 0:\r\n for j in reversed(p): \r\n if j > k:\r\n break\r\n else:\r\n counter += 1\r\nprint(counter) \r\n\r\n", "n,k=map(int,input().split());l=list(map(int,input().split()))\r\nc=0;c1=0\r\nfor i in l:\r\n\tif i<=k:c+=1\r\n\telse:break\r\nfor i in l[::-1]:\r\n\tif i<=k:c1+=1\r\n\telse:break\r\nif c==n or c1==n:print(n)\r\nelse:print(c+c1) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n \r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n left_idx = None\r\n right_idx = None\r\n\r\n for i in range(0, len(a)):\r\n if a[i] > k:\r\n left_idx = i\r\n break\r\n for i in range(len(a)-1,-1,-1):\r\n if a[i] > k:\r\n right_idx = i\r\n break\r\n\r\n if left_idx is None and right_idx is None:\r\n print(len(a))\r\n else:\r\n print(left_idx-right_idx+len(a)-1)\r\n\r\n \r\nif __name__ == '__main__':\r\n solve()\r\n ", "# https://codeforces.com/contest/999\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n\nsolved = 0\ni, j = 0, n - 1\nwhile i <= j:\n if a[i] <= k:\n solved += 1\n i += 1\n elif a[j] <= k:\n solved += 1\n j -= 1\n else:\n break\n\nprint(solved)\n", "n, k = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\nj = 0\r\nc = 0\r\nfor i in range(n):\r\n if a[i] <= k:\r\n j += 1\r\n c += 1\r\n else:\r\n break\r\na.reverse()\r\nfor i in range(n-j):\r\n if a[i] <= k:\r\n j += 1\r\n c += 1\r\n else:\r\n break\r\nprint(c)", "n, k = map(int,input().split())\r\na = list(map(int,input().split()))\r\nans = 0\r\nwhile len(a) > 1 and (a[0] <= k or a[n - 1] <= k):\r\n \r\n\r\n if a[0] <= k:\r\n ans +=1 \r\n n -=1\r\n a.pop(0)\r\n continue\r\n if a[n-1] <= k:\r\n ans +=1 \r\n n -=1\r\n a.pop(n)\r\nif len(a) == 1:\r\n if a[0] <= k:\r\n ans +=1\r\nprint(ans)", "n,k=map(int,input().split())\r\nlst=list(map(int,input().split()))[:n]\r\nl=0\r\nfor i in range(n):\r\n if lst[i]<=k:\r\n l=l+1\r\n else:\r\n break\r\nlst.reverse()\r\nfor i in range(len(lst)):\r\n if lst[i]<=k:\r\n l=l+1\r\n else:\r\n break\r\nif l==2*n:\r\n print(n)\r\nelse:\r\n print(l)", "n,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ni=0\r\nj=n-1\r\nans=0\r\nwhile i<=j:\r\n\tif l[i]>k and l[j]>k:\r\n\t\tbreak\r\n\tif l[i]<=k:\r\n\t\tans+=1\r\n\t\ti+=1\r\n\tif l[j]<=k and j>i:\r\n\t\tans+=1\r\n\t\tj-=1\r\nprint(ans)", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(n):\r\n if(a[i]<=k):\r\n c+=1\r\n else:\r\n break\r\nfor i in range(n-1,-1,-1):\r\n if(a[i]<=k):\r\n c+=1\r\n else:\r\n break\r\nif(c>n):\r\n print(n)\r\nelse:\r\n print(c)\r\n ", "n,k = map(int,input().split())\r\na = list(map(int, input().split()))\r\nsum1 = 0\r\nsum2 = 0\r\nans = 0\r\nfor i in range(len(a)):\r\n if a[i] <= k:\r\n sum1 += 1\r\n else :\r\n break\r\nfor j in range(len(a) - 1, -1, -1):\r\n if a[j] <= k:\r\n sum2 += 1\r\n else :\r\n break\r\nans = sum1 + sum2\r\nif ans > n :\r\n ans = n \r\nprint(ans)\r\n\r\n\r\n", "from collections import deque\r\nn, k = map(int, input().split())\r\ndeq = deque([*map(int, input().split())])\r\nwhile len(deq) > 0:\r\n if deq[0] <= k:\r\n deq.popleft()\r\n elif deq[-1] <= k:\r\n deq.pop()\r\n else:\r\n break\r\nprint(n-len(deq))", "from collections import deque\r\n\r\nn, k = map(int, input().split())\r\nlst = deque(map(int, input().split()))\r\nwhile len(lst) > 0 and lst[0] <= k:\r\n lst.popleft()\r\nwhile len(lst) > 0 and lst[-1] <= k:\r\n lst.pop()\r\nprint(n - len(lst))", "a, b = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ni = 0\r\nwhile i < a and l[i] <= b:\r\n i += 1\r\nj = a-1\r\nwhile l[j] <= b and j > i:\r\n j -= 1\r\nprint(a-(j-i+1))", "n,m=map(int,input().split())\nl=list(map(int,input().split()))\nn=0\nc=0\nfor i in l:\n if i<=m:\n n+=1\n else:\n c=i\n break\nif c==0:\n print(n)\nelse:\n s=l.index(c)\n for j in range(len(l)-1,s-1,-1):\n\n if l[j]<=m:\n\n n+=1\n\n else:\n\n print(n)\n break\n \n \n\n \n \n\n\t\t\t \t\t\t\t\t\t\t\t\t\t \t\t\t\t \t \t\t\t", "(a,b)=[int(x) for x in input().split()]\r\nl=[int(x) for x in input().split()]\r\nc=0\r\nwhile(bool(l)and(l[0]<=b or l[-1]<=b)):\r\n if l[0]<=b:\r\n c+=1\r\n l=l[1:]\r\n elif l[-1]<=b:\r\n c+=1\r\n l.pop()\r\nprint(c)", "n,k = map(int,input().split())\r\nli = list(map(int,input().split()))\r\ni = l = 0\r\nj =n-1\r\ncount = 0\r\nwhile i<=j:\r\n if li[i]<=k:\r\n count+=1\r\n i+=1\r\n \r\n elif li[j]<=k:\r\n j-=1\r\n count+=1\r\n \r\n else:\r\n break\r\nprint(count)\r\n\r\n", "n_, x = input().split()\r\nx = int(x)\r\nn = input().split()\r\nfor i in range(int(n_)):\r\n n[i] = int(n[i])\r\ntotal = 0\r\nflag = True\r\nwhile n != [] and flag:\r\n if n[-1] <= x:\r\n total += 1\r\n del n[-1]\r\n elif n[0] <= x:\r\n total += 1\r\n del n[0]\r\n else:\r\n flag = False\r\nprint(total)\r\n", "def main():\r\n\t\r\n\t#Code goes here\r\n\tn, k = [int(x) for x in input().split()]\r\n\r\n\tnums = [int(x) for x in input().split()]\r\n\r\n\tans = 0\r\n\r\n\twhile len(nums) > 0:\r\n\t\tif nums[0] <= k:\r\n\t\t\tnums.pop(0)\r\n\t\t\tans += 1\r\n\t\telif nums[-1] <= k:\r\n\t\t\tnums.pop(-1)\r\n\t\t\tans += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\tprint(ans)\r\n\r\n\treturn 0\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n,k = input().split(' ')\nn,k = int(n),int(k)\nn_wight = input().split(' ')\nn_wight = list(map(lambda x:int(x),n_wight))\nnum = 0\nwhile True:\n\tif len(n_wight)>0:\n\t\tif n_wight[0]<=k:\n\t\t\tn_wight.pop(0)\n\t\t\tnum+=1\n\t\telse:\n\t\t\tbreak\n\telse:\n\t\tprint(num)\n\t\texit()\n\nnew_n_weight = n_wight[::-1]\nwhile True:\n\tif new_n_weight[0]<=k:\n\t\tnew_n_weight.pop(0)\n\t\tnum+=1\n\telse:\n\t\tbreak\nprint(num)\n \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\nq = list(map(int,input().split()))\r\nc =0\r\nfor i in q:\r\n\tif b>=i:\r\n\t\tc+=1\r\n\telse:\r\n\t\tbreak\r\nfor j in range(len(q)):\r\n\tif b>=q[-1-j]:\r\n\t\tc+=1\r\n\telse:\r\n\t\tbreak\t\t\r\nif c>=a:\r\n\tprint(a)\r\nelse:\r\n\tprint(c)\r\n", "n,k=map(int,input().split())\r\nliste=list(map(int,input().split()))\r\ni=0\r\nj=n-1\r\nsom=0\r\nt1=True\r\nt2=True\r\n#while(i<=j):\r\n #if i!=j:\r\n #if liste[i]<=k:\r\n #som+=1\r\n #i+=1\r\n #else:\r\n #t1=False\r\n #if liste[j]<=k:\r\n #som+=1\r\n #j-=1\r\n #else:\r\n #t2=False\r\n #else:\r\n #if liste[i]<=k:\r\n #som+=1\r\n #break\r\n #if not t1 and not t2:\r\n #break\r\nfor i in range(n):\r\n if liste[0]<=k:\r\n liste.pop(0)\r\n som+=1\r\n else:\r\n break\r\nif liste:\r\n for i in range(n):\r\n if liste[-1]<=k:\r\n liste.pop()\r\n som+=1\r\n else:\r\n break\r\nprint(som)", "l1=[int(i) for i in input().split()]\r\nn=l1[0]\r\nk=l1[-1]\r\nl2=[int(j) for j in input().split()]\r\nl3=[]\r\nfor j in range(n):\r\n if l2[j]>k:\r\n l3.append(j+1)\r\nif len(l3)>0:\r\n f_unsolved=l3[0]-1\r\n l_unsolved=n-l3[-1]\r\n print(f_unsolved+l_unsolved)\r\nelse :\r\n print(n)", "R=lambda:map(int,input().split());S=lambda:[int(a) for a in input().split()];n,k=R();a=0;c=S();\r\nfor i in range(n):\r\n if c[i]<=k:\r\n a+=1\r\n else:\r\n break\r\nfor j in range(n-1,-1,-1):\r\n if c[j]<=k:\r\n a+=1\r\n else:\r\n break\r\nprint(min(n,a))", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn, k = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nif all([x <= k for x in a]):\r\n print(n)\r\nelse:\r\n i = 0\r\n while a[i] <= k:\r\n i += 1\r\n j = 0\r\n while a[n - j - 1] <= k:\r\n j += 1\r\n ans = i + j\r\n print(ans)", "n,k = map(int,input().split())\nls = list(map(int,input().split()))\ncount = 0\nifor = 0\nfor i in range(n):\n ifor +=1\n if k >= ls[i]:\n count+=1\n else:\n break\nif ifor == n: \n print(count) \nelse:\n for i in range(1,n):\n ifor +=1\n if k >= ls[-1*i]:\n count+=1\n else:\n break\n print(count) \n\n\t\t \t \t \t \t \t \t \t \t\t\t", "n, k = [int(i) for i in input().split()]\nproblemas = [int(i) for i in input().split()]\nc = 0\n\nwhile len(problemas) > 0:\n if problemas[0] <= k:\n c += 1\n problemas.pop(0)\n elif problemas[-1] <= k:\n c += 1\n problemas.pop(-1)\n else:\n break\nprint(c)\n\n\n \t \t\t \t \t\t \t \t\t \t \t\t \t", "n,k = map(int,input().split())\r\na = list(map(int,input().split()))\r\ncnt = 0\r\nfor _ in range(3):\r\n while a and a[-1]<=k:\r\n a.pop()\r\n cnt+=1\r\n a = a[::-1]\r\nprint(cnt)", "n, k = map(int, input().split())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nlimit = 0\r\nwhile(limit != 2 and len(arr) != 0):\r\n # print(count)\r\n if (arr[0] <= k):\r\n count += 1\r\n arr.pop(0)\r\n elif (arr[0] > k):\r\n arr.reverse()\r\n limit += 1\r\nprint(count)\r\n", "n, k = map(int, input().split())\nlist = [int(x) for x in input().split()][:n]\nsolved = 0\nloopEnd = False\nfor i in range(n):\n\tif list[i] <= k: \n\t\tsolved += 1\n\telse:\n\t\tloopEnd = True\n\t\tbreak\nif loopEnd:\n\tfor i in range(n - 1, -1, -1):\n\t\tif list[i] <= k: \n\t\t\tsolved += 1\n\t\telse:\n\t\t\tbreak\nprint(solved)\n\t \t\t \t\t\t \t \t \t \t\t \t\t\t \t\t\t", "a,b=map(int,input().split())\r\nc=[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(a):\r\n if c[i]<=b:\r\n s=s+1\r\n if c[i]>b:\r\n break\r\nif s==a:\r\n print(s)\r\nelse:\r\n c.reverse()\r\n for i in range(a):\r\n if c[i]<=b:\r\n s=s+1\r\n if c[i]>b:\r\n break\r\n print(s)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n - 1, -1, -1):\r\n if a[i] <= k:\r\n a.pop(i)\r\n ans += 1\r\n else:\r\n break\r\nfor i in range(len(a)):\r\n if a[i] <= k:\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntest = 0\r\nidx1 = 0\r\nidx2 = 0\r\nfor i in range(n):\r\n if a[i]>k:\r\n test = 1\r\n idx1 = i\r\n break\r\n \r\nfor i in range(n-1, -1, -1):\r\n if a[i]>k:\r\n idx2 = i\r\n break\r\nif not test:\r\n print(n)\r\nelse:\r\n print(n-(idx2-idx1+1))", "n,k=map(int, input().split())\r\na=list(map(int, input().split()))\r\nx=0\r\n\r\n\r\nwhile len(a)>0 and a[0]<=k:\r\n\r\n a.pop(0)\r\n x+=1\r\nwhile len(a)>0 and a[-1]<=k:\r\n a.pop(-1)\r\n x+=1\r\n\r\nprint(x)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nkol = 0\r\nfor i in range(n):\r\n if a[i] > k:\r\n break\r\n else:\r\n kol += 1\r\nfor j in range(n-1, i, -1):\r\n if a[j] > k:\r\n break\r\n else:\r\n kol += 1\r\nprint(kol)\r\n\r\n", "def question1():\r\n \r\n total_question,skill_limit = map(int,input().split())\r\n diff_quest = list(map(int,input().split())) #difficulty as per questions\r\n successfully_done = 0\r\n is_breaked = False\r\n \r\n \r\n for ques in range(total_question):\r\n if diff_quest[ques] > skill_limit:\r\n is_breaked = True\r\n break \r\n else:\r\n successfully_done += 1\r\n ques = total_question - 1 \r\n if is_breaked:\r\n while diff_quest[ques] <= skill_limit:\r\n successfully_done += 1 \r\n ques -= 1 \r\n return successfully_done\r\n \r\n \r\n \r\n# remained_test_cases = int(input())\r\nremained_test_cases = 1 \r\nwhile remained_test_cases > 0:\r\n print(question1())\r\n remained_test_cases -= 1 ", "def prog(n, k, arr):\r\n i = 0\r\n top = n-1\r\n total = 0\r\n while i < n and arr[i] <= k:\r\n total = total + 1\r\n i = i + 1\r\n if i < n:\r\n while arr[top] <= k:\r\n total = total + 1\r\n top = top - 1\r\n print(total)\r\n\r\nn, k = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nprog(n, k, arr)", "import sys\r\n\r\ninput = sys.stdin.readline\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nc = 0\r\ndef f(a):\r\n for i in range(len(a)):\r\n if a[i] > k:\r\n return i\r\n return len(a)\r\ndef g(a):\r\n for j in range(n-1,-1,-1):\r\n if a[j] > k:\r\n return j\r\n return len(a)\r\nw = a[:f(a)]\r\ne = a[g(a):-1]\r\nif len(w) == len(a):\r\n print(len(w))\r\nelse:\r\n print(len(w) + len(e))\r\n\r\n", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\tn, k = map(int, input().split())\r\n\t\tarr = list(map(int, input().split()))\r\n\t\tcount = 0\r\n\t\tleft, right = True, True\r\n\t\ti, j = 0, n - 1\r\n\t\t\r\n\t\twhile (left or right) and (i <= j):\r\n\t\t\tif i == j:\r\n\t\t\t\tif arr[i] <= k:\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\tbreak\r\n\r\n\t\t\tif left:\r\n\t\t\t\tif arr[i] <= k:\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\t\ti += 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tleft = False\r\n\r\n\t\t\tif right:\r\n\t\t\t\tif arr[j] <= k:\r\n\t\t\t\t\tcount += 1\r\n\t\t\t\t\tj -= 1\r\n\t\t\t\telse:\r\n\t\t\t\t\tright = False\r\n\r\n\t\tprint(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "n,k=map(int,input().split())\r\ncount=0\r\nl=list(map(int,input().split()))\r\nfor i in l:\r\n if i<=k:\r\n count+=1\r\n else:\r\n break\r\na=l[::-1]\r\nfor i in a:\r\n if i<=k:\r\n count+=1\r\n else:\r\n break\r\nif count>n:\r\n print(n)\r\nelse:\r\n print(count)\r\n", "n,k = tuple(map(int, input().split()))\nA = list(map(int, input().split()))\n\nln = len(A)\ni = 0\nj = ln - 1\nc = 0\nwhile ln > 0 and (A[i] <= k or A[j] <= k):\n if A[i] <= k:\n c += 1\n i += 1\n ln -= 1\n continue\n\n if A[j] <= k:\n c += 1\n j -= 1\n ln -= 1\nprint(c)\n" ]

[ "Mod = 10 ** 9 + 7\r\ns = input()\r\nn = len(s)\r\nfrom types import GeneratorType\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 return wrappedfunc\r\n\r\n# 拆括号\r\n# 0 1 2 3 4 5 6 7 8\r\n# 左无右无 左无右红 左无右蓝 左红右无 左红右红 左红右蓝 左蓝右无 左蓝右红 左蓝右蓝\r\n# 无 红 蓝 0 1 2\r\n@bootstrap\r\ndef dfs(l, r):\r\n if r - l == 1:\r\n yield 0, 1, 1, 1, 0, 0, 1, 0, 0\r\n count = 0\r\n for i in range(l, r):\r\n if s[i] == '(':\r\n count += 1\r\n else:\r\n count -= 1\r\n # 并联关系\r\n if count == 0:\r\n a1 = yield dfs(l, i)\r\n a2 = yield dfs(i + 1, r)\r\n res = [0] * 9\r\n for i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n for l in range(3):\r\n if k == l and k > 0:\r\n continue\r\n res[i * 3 + j] += a1[i * 3 + k] * a2[l * 3 + j]\r\n res[i * 3 + j] %= Mod\r\n yield res\r\n # 串联关系\r\n a1 = yield dfs(l + 1, r - 1)\r\n total = sum(a1)\r\n yield 0, total - a1[1] - a1[4] - a1[7], total - a1[2] - a1[5] - a1[8], total - a1[3] - a1[4] - a1[5], 0, 0, total - \\\r\n a1[6] - a1[7] - a1[8], 0, 0\r\n\r\n\r\nprint(sum(dfs(0, n - 1)) % Mod)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(l, r, c1, c2):\r\n return 9 * n * l + 9 * r + 3 * c1 + c2\r\n\r\ndef sparse_table(a):\r\n mi = []\r\n s0, l = list(a), 1\r\n mi.append(s0)\r\n while 2 * l <= len(a):\r\n s = [min(s0[i], s0[i + l]) for i in range(len(s0) - l)]\r\n mi.append(list(s))\r\n s0 = s\r\n l *= 2\r\n return mi\r\n\r\ndef get_min(l, r, mi):\r\n d = (r - l + 1).bit_length() - 1\r\n ans = min(mi[d][l], mi[d][r - pow2[d] + 1])\r\n return ans\r\n\r\ns = list(input().rstrip())\r\nmod = pow(10, 9) + 7\r\nu = [0]\r\nfor i in s:\r\n u.append(u[-1] + (1 if not i & 1 else -1))\r\nmi = sparse_table(u)\r\npow2 = [1]\r\nfor _ in range(20):\r\n pow2.append(2 * pow2[-1])\r\nn = len(s) + 1\r\nm = 9 * n * n\r\ndp = [0] * m\r\nla = [0] * n\r\nx = [(1, 0), (2, 0), (0, 1), (0, 2)]\r\nfor i in range(n - 2):\r\n if u[i] < u[i + 1] > u[i + 2]:\r\n for c1, c2 in x:\r\n dp[f(i, i + 2, c1, c2)] = 1\r\n la[i] = 2\r\nfor i in range(4, n, 2):\r\n for l in range(n - i):\r\n r = l + i\r\n if not get_min(l, r, mi) == u[l] == u[r]:\r\n continue\r\n if la[l]:\r\n c = la[l] + l\r\n for c1 in range(3):\r\n for c2 in range(3):\r\n dpl = dp[f(l, c, c1, c2)]\r\n for c3 in range(3):\r\n if c2 == c3 > 0:\r\n continue\r\n for c4 in range(3):\r\n dpr = dp[f(c, r, c3, c4)]\r\n j = f(l, r, c1, c4)\r\n dp[j] += dpl * dpr % mod\r\n dp[j] %= mod\r\n else:\r\n for c1, c2 in x:\r\n j = f(l, r, c1, c2)\r\n for c3 in range(3):\r\n if c1 == c3 > 0:\r\n continue\r\n for c4 in range(3):\r\n if c2 == c4 > 0:\r\n continue\r\n dp[j] += dp[f(l + 1, r - 1, c3, c4)]\r\n dp[j] %= mod\r\n la[l] = i\r\nans = 0\r\nfor c1 in range(3):\r\n for c2 in range(3):\r\n ans += dp[f(0, n - 1, c1, c2)]\r\n ans %= mod\r\nprint(ans)", "# LUOGU_RID: 96524724\ndef dp(left, right):\r\n color = {(i,j):0 for i in range(3) for j in range(3)} # 用字典代替二维列表表示九种方案，初始值均为0\r\n if right-left == 1: # 只有一对括号的情况\r\n for x in [(0,1), (0,2), (1,0), (2,0)]: # 一对配对的括号只有这四种合法的上色方案，下同\r\n color[x] = 1 # 合法方案为1\r\n elif bracket[left] == right: # 左右括号配对成功\r\n inner = dp(left+1,right-1) # 递归计算内部“(...)”的方案\r\n for x,y in [(0,1), (0,2), (1,0), (2,0)]:\r\n for i in range(3):\r\n for j in range(3):\r\n if y==0 and i!=x or x==0 and j!=y: # 相邻颜色不能相同\r\n color[(x,y)] += inner[(i,j)]\r\n else: # 左右括号配对不成功\r\n l = dp(left, bracket[left]) # 递归计算左边“(...)”的方案\r\n r = dp(bracket[left]+1, right) # 递归计算右边“(...)”的方案\r\n for x,y in color.keys():\r\n for i in range(3):\r\n for j in range(3):\r\n if i==0 or i!=j: # 相邻要么都不上色，要么颜色不能相同\r\n color[(x,y)] += l[(x,i)]*r[(j,y)]\r\n return color # 返回包含九种方案个数的字典\r\n \r\ns = input()\r\nbracket = dict()\r\nstack = [] # 查找配对括号的栈操作\r\nfor i in range(len(s)):\r\n if s[i] == \"(\":\r\n stack.append(i)\r\n else:\r\n bracket[stack.pop()] = i\r\nresult = sum(dp(0,len(s)-1).values()) # 要计算的结果就是把九种方案各自的个数加在一起，因为使用的是字典，所以直接对字典的值进行求和即可\r\nprint(result%1000000007)\r\n", "from functools import lru_cache\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\ndef solve():\r\n s = input()\r\n n = len(s)\r\n right_pos = [-1]*n\r\n stk = []\r\n mod = 10**9+7\r\n for i, c in enumerate(s):\r\n if c == '(':\r\n stk.append(i)\r\n else:\r\n right_pos[stk.pop()] = i\r\n dp = {}\r\n @lru_cache(None)\r\n def f(l, r, lc, rc):\r\n if l > r:\r\n return 1\r\n mid = right_pos[l]\r\n res = 0\r\n if mid < r:\r\n res += f(l+1, mid-1, 0, 1) * f(mid+1, r, 1, rc)\r\n res += f(l+1, mid-1, 0, 2) * f(mid+1, r, 2, rc)\r\n if lc != 1:\r\n res += f(l+1, mid-1, 2, 0) * f(mid+1, r, 0, rc)\r\n if lc != 2:\r\n res += f(l+1, mid-1, 1, 0) * f(mid+1, r, 0, rc)\r\n else:\r\n if rc != 1:\r\n res += f(l+1, r-1, 0, 2)\r\n if rc != 2:\r\n res += f(l+1, r-1, 0, 1)\r\n if lc != 1:\r\n res += f(l+1, r-1, 2, 0)\r\n if lc != 2:\r\n res += f(l+1, r-1, 1, 0)\r\n return res % mod\r\n res = f(0, n-1, 0, 0)\r\n print(res)\r\nsolve()", "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# 难点 1：想到用区间dp\r\n# 难点 2：不同状态之间的转移以及计算\r\n\r\ndef main():\r\n MOD = 10**9 + 7\r\n s = input()[:-1]\r\n left_to_right = dict()\r\n right_to_left = dict()\r\n n = len(s)\r\n stack = []\r\n for i, c in enumerate(s):\r\n if c == \"(\":\r\n stack.append(i)\r\n else:\r\n cur = stack.pop()\r\n left_to_right[cur] = i\r\n right_to_left[i] = cur\r\n dp = [[Counter() for i in range(n)] for j in range(n)]\r\n # 0 代表不染色 1 代表染红色 2 代表染蓝色\r\n\r\n def dfs(i, j):\r\n dic = Counter()\r\n if left_to_right[i] == j:\r\n if j == i + 1:\r\n dic[(0, 1)] = 1\r\n dic[(0, 2)] = 1\r\n dic[(1, 0)] = 1\r\n dic[(2, 0)] = 1\r\n return dic\r\n else:\r\n middle = dfs(i + 1, j - 1)\r\n for status in [(0, 1), (0, 2), (1, 0), (2, 0)]:\r\n # 外层状态\r\n for key, value in middle.items():\r\n if status[0] == key[0] and status[0] > 0:\r\n continue\r\n if status[1] == key[1] and status[1] > 0:\r\n continue\r\n dic[status] = (dic[status] + value) % MOD\r\n return dic\r\n else:\r\n if left_to_right[i] + 1 == right_to_left[j]:\r\n dic1 = dfs(i, left_to_right[i])\r\n dic2 = dfs(right_to_left[j], j)\r\n for key1, value1 in dic1.items():\r\n for key2, value2 in dic2.items():\r\n if key1[1] == key2[0] and key1[1] > 0:\r\n continue\r\n dic[(key1[0], key2[1])] = (dic[(key1[0], key2[1])] + value1 * value2) % MOD\r\n return dic\r\n else:\r\n extra = dfs(left_to_right[i] + 1, right_to_left[j] - 1)\r\n dic1 = dfs(i, left_to_right[i])\r\n dic2 = dfs(right_to_left[j], j)\r\n for key1, value1 in dic1.items():\r\n for key2, value2 in extra.items():\r\n if key1[1] == key2[0] and key1[1] > 0:\r\n continue\r\n for key3, value3 in dic2.items():\r\n if key2[1] == key3[0] and key2[1] > 0:\r\n continue\r\n dic[(key1[0], key3[1])] = (dic[(key1[0], key3[1])] + value1 * value2 * value3) % MOD\r\n return dic\r\n\r\n print(sum(dfs(0, n - 1).values()) % MOD)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "n,k=map(int,input().split())\ndp=[]\nmod=pow(10,9)+7\nfor i in range(n):\n\tt=[0]*k\n\tdp.append(t)\nfor i in range(n):\n\tdp[i][0]=1\nfor i in range(k-1):\n\tfor j in range(n):\n\t\tfor l in range(j,n,j+1):\n\t\t\tdp[l][i+1]=(dp[l][i+1]+dp[j][i])%mod\nans=0\nfor i in range(n):\n\tans=(ans+dp[i][k-1])%mod\nprint(ans)\n\t\t\t\t\t \t \t\t\t \t \t\t \t \t \t\t", "# https://www.acwing.com/blog/content/34755/\r\n\r\nmod = int(1e9 + 7)\r\n\r\ndef solve():\r\n m, n = map(int, input().split())\r\n \r\n f = [0] * (m + 1)\r\n f[1] = 1\r\n for i in range(n):\r\n for j in range(m, 0, -1):\r\n k = j * 2\r\n while k <= m:\r\n f[k] = (f[k] + f[j]) % mod\r\n k += j\r\n \r\n res = sum(f[1 : m + 1])\r\n print(res % mod)\r\n \r\n\r\ndef main():\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()", "def factorialAndModualrInverse(n,prime):\r\n modInv = [1] * (n + 1)\r\n factorial = [1] * (n + 1)\r\n modInvFactorial=[1] * (n + 1)\r\n for i in range(2, n + 1):\r\n modInv[i] = modInv[prime % i] * (prime - prime // i) % prime\r\n factorial[i] = (factorial[i - 1] * i) % prime\r\n modInvFactorial[i] = (modInvFactorial[i - 1] * modInv[i]) % prime\r\n return factorial,modInvFactorial\r\n\r\n\r\ndef getComb(n,r):\r\n if r==0:\r\n return 1\r\n if(n<r) or (n==0 and r==0):\r\n return 0\r\n return (factorial[n] * modInvFactorial[r] * modInvFactorial[n-r])%mod\r\n\r\nu, n = map(int, input().split())\r\nmod = 10 ** 9 + 7\r\nfactorial, modInvFactorial = factorialAndModualrInverse(n + 20, mod)\r\nks = [[] for _ in range(u + 1)]\r\nfor i in range(2, u + 1):\r\n p, x = 2, i\r\n while p * p <= x:\r\n if x % p == 0:\r\n k = 1\r\n x //= p\r\n while x % p == 0:\r\n k += 1\r\n x //= p \r\n ks[i].append(k)\r\n p += 1\r\n if x > 1:\r\n ks[i].append(1)\r\ndef solve():\r\n res = 0\r\n for i in range(1, u + 1):\r\n cur = 1\r\n for k in ks[i]:\r\n cur *= getComb(n + k - 1, k)\r\n cur %= mod\r\n res += cur \r\n res %= mod\r\n return res\r\n \r\nprint(solve())", "MOD = 1000000007\r\n\r\n\r\nn, k = map(int, input().split())\r\ndp = [[0 for _ in range(n+1)] for __ in range(k+1)]\r\n\r\nfor i in range(1, n+1):\r\n dp[1][i] = 1\r\nfor i in range(1, k):\r\n for j in range(1, n+1):\r\n c = 1\r\n while j * c <= n:\r\n dp[i+1][j*c] += dp[i][j]\r\n c += 1\r\nprint(sum(dp[k]) % MOD)\r\n", "from copy import copy\n\nmod = 1000000007\n\ndef solve():\n n, k = [int(x) for x in input().split()]\n dp = [1] * n\n for kk in range(k - 1):\n for nn in range(n, 0, -1):\n for push_target in range(nn * 2, n + 1, nn):\n dp[push_target - 1] += dp[nn - 1] % mod\n print(sum(dp) % mod)\n\nsolve()", "R = lambda: map(int, input().split())\r\nn, k = R()\r\ndp = [[0 for j in range(n + 1)] for i in range(k + 1)]\r\nfor l in range(1, n + 1):\r\n dp[1][l] = 1\r\nfor i in range(1, k):\r\n for p in range(1, n + 1):\r\n np = p\r\n while np <= n:\r\n dp[i + 1][np] = (dp[i + 1][np] + dp[i][p]) % 1000000007\r\n np += p\r\nprint(sum(dp[k][p] for p in range(1, n + 1)) % 1000000007)", "n, m = map(int, input().split())\ndp = [[0]*(n+1) for i in range(m+1)]\ndp[0][1] = 1\nfor i in range(1, m+1):\n for j in range(1, n+1):\n for k in range(j, n+1, j):\n dp[i][k] = (dp[i][k] + dp[i-1][j]) % 1000000007\n\nans = 0\nfor i in range(1, n+1):\n ans = (ans + dp[m][i]) % 1000000007\n\nprint(ans)\n", "\r\nmod = 10**9+7\r\n\r\n\r\nn,k = map(int,input().split())\r\n\r\n\r\n\r\n\r\ndp=[[0 for i in range(n+1)] for j in range(k+1)]\r\n\r\n\r\nfor i in range(1,n+1):\r\n dp[1][i]+=1\r\n\r\nfor length in range(2,k+1):\r\n\r\n for j in range(1,n+1):\r\n\r\n\r\n for end in range(j,n+1,j):\r\n\r\n\r\n dp[length][end]= (dp[length][end]+ dp[length-1][j])%mod\r\n\r\nprint(sum(dp[k])%mod)\r\n", "from math import sqrt,gcd,ceil,floor,log,factorial\r\nfrom itertools import permutations,combinations\r\nfrom collections import Counter, defaultdict\r\n\r\n\r\nn,k = map(int,input().split())\r\nmod=10**9+7\r\nif n==1:\r\n print(1)\r\n \r\nelse:\r\n #keys = [i for i in range(1,n+1)]\r\n \r\n d=defaultdict(list)\r\n \r\n for i in range(1,n//2+1):\r\n for j in range(i+1,n+1):\r\n if j%i==0:\r\n d[i].append(j)\r\n \r\n dp = [0]+[1 for i in range(n)]\r\n \r\n for i in range(k-1):\r\n for i in range(1,n//2+1):\r\n if i==1:\r\n dp[i]=(sum(dp)%mod)\r\n \r\n else:\r\n for mul in d[i]:\r\n dp[i]=(dp[i]+(dp[mul]%mod))%mod\r\n \r\n #print(d)\r\n #print(dp) \r\n print(sum(dp)%mod)\r\n \r\n \r\n \r\n \r\n ", "def C(n,m):\r\n a=1\r\n for i in range(n-m+1,n+1):\r\n a*=i\r\n for i in range(1,m+1):\r\n a//=i\r\n return a\r\nn,k=map(int,input().split())\r\na=0\r\nfor i in range (1,n+1):\r\n t=1\r\n I=i\r\n for j in range(2,i+1):\r\n s=0\r\n while I%j==0:\r\n s+=1\r\n I//=j\r\n if s:\r\n t*=C(s+k-1,s)\r\n a+=t\r\nprint(a%(10**9+7))", "import math\r\nfrom collections import defaultdict\r\nMOD = 10**9 + 7\r\nn,k = map(int,input().split())\r\ndp = [1] * (n+1)\r\ndp[0] = 0\r\nfor i in range(1,k):\r\n for j in range(1,n+1):\r\n for f in range(j+j,n+1,j):\r\n dp[j] += dp[f]\r\n dp[j] %= MOD\r\nprint(sum(dp)%MOD)\r\n", "n,k = map(int,input().split())\r\nn += 1\r\nk += 1\r\ndp = [[0] * n for _ in range(13)]\r\ns = 0\r\nM = 1000000007\r\nf = [1]\r\nfor i in range(1,4500):\r\n\tf.append(f[-1] * i % M)\r\ndef C(n, k):\r\n\tif k>n:\r\n\t\treturn 0\r\n\treturn f[n] * pow(f[k] * f[n - k] %M , M - 2, M) % M\r\n\r\nfor i in range(1, 12):\r\n\tfor j in range(1, n):\r\n\t\tif i == 1:\r\n\t\t\tdp[i][j] = 1\r\n\t\tfor t in range(j * 2, n, j):\r\n\t\t\tdp[i + 1][t] = (dp[i + 1][t] + dp[i][j]) % M\r\n\t\ts = (s + C(k - 2, i - 1) * dp[i][j] % M) % M\r\n\r\n\r\nprint(s)", "# 排列组合算方案数77ms\r\n# u,n = list(map(int,input().strip().split()))\r\n# Mod = 10**9+7\r\n#\r\n# dp = [[0]*12 for j in range(u+1)]\r\n#\r\n# for i in range(u,0,-1):\r\n# dp[i][1] = 1\r\n# for j in range(2*i,u + 1,i):\r\n# for k in range(1,11):\r\n# dp[i][k + 1] += dp[j][k]\r\n# # print(dp)\r\n# from math import comb\r\n# cmb = [0]*13\r\n# # 隔板法\r\n# for i in range(1,min(12,n + 1)):\r\n# cmb[i] = comb(n - 1,i - 1)\r\n#\r\n# ans = 0\r\n# for i in range(1,u + 1):\r\n# for j in range(1,min(12,n + 1)):\r\n# ans += dp[i][j]*cmb[j]\r\n# ans %= Mod\r\n# print(ans)\r\n\r\n# 动态规划\r\nu,n = list(map(int,input().strip().split()))\r\nMod = 10**9+7\r\n\r\ndp = [[0]*(u + 1) for _ in range(n)]\r\nfor i in range(1,u + 1):\r\n dp[0][i] = 1\r\nfor i in range(1,n):\r\n for j in range(1,u + 1):\r\n for k in range(j,u + 1,j):\r\n dp[i][k] += dp[i - 1][j]\r\n dp[i][k] %= Mod\r\n# print(dp)\r\nprint(sum(dp[n - 1])%Mod)", "#\t!/bin/env python3\r\n#\tencoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/414/B\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, k = get_ints()\r\n dp = [[0]*(n+1) for _ in range(k+1)]\r\n # dp[i][j] no of sequences of length i that end with j\r\n for i in range(1, n+1):\r\n dp[1][i] = 1\r\n for i in range(1, k):\r\n for j in range(1, n+1):\r\n for l in range(j, n+1, j): # factors of j\r\n dp[i+1][l] = (dp[i+1][l]+dp[i][j]) % mod\r\n\r\n ans = 0\r\n for i in range(1, n+1):\r\n ans = (ans+dp[k][i]) % mod\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin, stdout\r\ndef rdl(x): return map(x, stdin.readline().strip().split())\r\ndef wtl(x): stdout.write(str(x) + '\\n')\r\n\r\nn, k = rdl(int)\r\ndp, md = [[0 for j in range(k)] for i in range(n + 1)], 1000000007\r\nfor i in reversed(range(1, n + 1)):\r\n dp[i][0], j = 1, i\r\n for j in range(1, k):\r\n t = i\r\n while t <= n:\r\n dp[i][j] = (dp[i][j] + dp[t][j - 1]) % md\r\n t += i\r\nwtl(sum(dp[i][k - 1] for i in range(1, n + 1)) % md)", "MOD = 1000000007\r\n\r\nn, k = map(int, input().split())\r\n\r\n\r\ndp = [[0] * (k + 1) for _ in range(n + 1)]\r\n\r\n\r\nfor i in range(1, n + 1):\r\n dp[i][1] = 1 \r\n\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(2, k + 1):\r\n for x in range(i, n + 1, i):\r\n dp[x][j] = (dp[x][j] + dp[i][j - 1]) % MOD\r\n\r\n# Sum up all good sequences of length k\r\ntotal_good_sequences = sum(dp[i][k] for i in range(1, n + 1)) % MOD\r\n\r\nprint(total_good_sequences)\r\n", "n, k = map(int, input().split())\r\ndp, total = [[0 for i in range(n + 1)] for j in range(k + 1)], 0 # dp[len][max]\r\n\r\nfor i in range(n + 1): # when the max is 1 there is only 1 sequence\r\n dp[1][i] = 1\r\nfor i in range(2, k + 1): # higher maximum value\r\n for j in range(1, n + 1): # longer length\r\n for kk in range(j, n + 1, j): # follow the factors\r\n dp[i][kk] = (dp[i][kk] + dp[i - 1][j]) % 1000000007\r\nfor i in range(1, n + 1): # add all the sequences of length k\r\n total = (total + dp[k][i]) % 1000000007\r\nprint(total)\r\n", "n,k=map(int,input().split())\r\nlista=[]\r\nfor i in range(n+1):\r\n lista.append(1)\r\n\r\nfor i in range(k-1):\r\n for j in range(1,n+1):\r\n multiplo=2*j\r\n while (multiplo<=n):\r\n lista[j]=lista[j]+lista[multiplo]\r\n multiplo=multiplo+j\r\ntotal=0\r\nfor i in range(1,n+1):\r\n total=total+lista[i]\r\nprint(total%(10**9+7))\r\n ", "n,k=map(int,input().split())\r\ndp=[[1]*(n+1) for i in range(k+1)] \r\nfor i in range(2,k+1):\r\n for j in range(2,n+1):\r\n for x in range(j,n+1,j):\r\n dp[i][x]+=dp[i-1][j]\r\n \r\nprint(sum(dp[k][i] for i in range(1,n+1))%(10**9+7))", "n, k = map(int, input().split())\r\n# n = max value\r\n# k = length of good sequences\r\n\r\ndp = [[0] * (n+1) for _ in range(k+1)]\r\n# dp[i][j] (i <= k, j <= n)\r\ndp[1] = [0] + [1] * n\r\n\r\nmod = 10**9+7\r\nfor i in range(1, k):\r\n for j in range(1, n+1):\r\n p = 1\r\n while j * p <= n:\r\n dp[i+1][j*p] += dp[i][j]\r\n p += 1\r\n \r\n for j in range(1, n+1):\r\n dp[i+1][j] %= mod\r\n\r\nprint(sum(dp[k]) % mod)", "from collections import defaultdict\n\nLIMIT, MOD = 2000, 10 ** 9 + 7\nfactorials = [1] * LIMIT\ninverses = [1] * LIMIT\ninvfactorials = [1] * LIMIT\nfor j in range(2, LIMIT + 1):\n factorials[j - 1] = (factorials[j - 2] * j) % MOD\n inverses[j - 1] = (-(MOD // j) * inverses[MOD % j - 1]) % MOD\n invfactorials[j - 1] = (inverses[j - 1] * invfactorials[j - 2]) % MOD\n# print(invfactorials)\n\n\ndef combinations(n, r):\n if r > n:\n return 0\n elif r == n or not r:\n return 1\n x = (factorials[n - 1] * invfactorials[n - r - 1]) % MOD\n return (x * invfactorials[r - 1]) % MOD\n\n\nn, k = (int(x) for x in input().split())\narr = [defaultdict(int) for _ in range(n + 1)]\nfullcount = defaultdict(int)\nfor j in range(n, 0, -1):\n arr[j][1] = 1\n fullcount[1] += 1\n for m in range(2 * j, n + 1, j):\n for u in arr[m]:\n arr[j][u + 1] += arr[m][u]\n fullcount[u + 1] += arr[m][u]\ns = 0\nfor j in range(1, k + 1):\n s = (s + fullcount[j] * combinations(k - 1, j - 1)) % MOD\nprint(s % (10 ** 9 + 7))\n", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nu, n = list(map(int, input().split()))\r\nf = [0] * ((u + 1) * (n + 1))\r\nfor i in range(1, u + 1):\r\n f[1 * (u + 1) + i] = 1\r\nMOD = 1000000007\r\nfor i in range(1, n):\r\n for j in range(1, u + 1):\r\n for k in range(u + 1):\r\n if j * k > u:\r\n break\r\n else:\r\n f[(i + 1) * (u + 1) + j * k] += f[i * (u + 1) + j]\r\n f[(i + 1) * (u + 1) + j * k] %= MOD\r\nres = 0\r\nfor i in range(1, u + 1):\r\n res += f[n * (u + 1) + i]\r\n res %= MOD\r\nprint(res)", "'''\r\n\tCodeForces 414B\r\n\tMashmokh and ACM\r\n\r\n\tTags: dp, Math\r\n'''\r\n\r\nMOD = 1000000007\r\n\r\nn, k = tuple(map(int, input().split()))\r\n\r\n# divider = [ [ x for x in range(1, n + 1) if i % x == 0 ] for i in range(n + 1) ]\r\n\r\ndp = [ [ 1 if j == 1 else 0 for j in range(k + 1) ] for i in range(n + 1) ]\r\n\r\nfor j in range(1, k):\r\n\tfor i in range(1, n + 1):\r\n\t\tfor ii in range(i, n + 1, i):\r\n\t\t\tdp[ii][j + 1] = (dp[ii][j + 1] + dp[i][j]) % MOD\r\n\r\nans = sum([ dp[i][k] for i in range(1, n + 1) ]) % MOD\r\nprint(ans)", "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, k = map(int, input().split())\r\n\r\ndp = [[0]*(n+1) for _ in range(k+1)]\r\nfor i in range(n+1):\r\n dp[0][i] = 1\r\nMOD = 1000000000 + 7\r\nfor i in range(1, k+1):\r\n for l in range(1,n+1):\r\n for j in range(l,n+1,l):\r\n dp[i][l] += dp[i-1][j]\r\n dp[i][l] %= MOD\r\nprint(dp[k][1])\r\n\r\n \r\n\r\n", "u, n = map(int, input().split())\r\nif n == 1:\r\n print(u)\r\n exit()\r\n\r\nmod = 10 ** 9 + 7\r\n\r\ndp = [[1] * (u + 1) for _ in range(n + 1)]\r\n\r\nfor v in range(1, u + 1):\r\n dp[0][v] = 1\r\n\r\n\r\nfor i in range(2, n + 1):\r\n for j in range(2, u + 1):\r\n for x in range(j, u + 1, j):\r\n dp[i][x] += dp[i - 1][j] % mod\r\n dp[i][x] %= mod\r\n\r\nans = 0\r\nfor v in range(1, u + 1):\r\n ans += dp[n][v] % mod\r\n ans %= mod\r\nprint(ans)", "n, k = map(int, input().split())\r\nmod = 1000000007\r\ndp = [[0 for _ in range(n + 1)] for _ in range(k + 1)]\r\nfor i in range(1, n + 1):\r\n dp[1][i] = 1\r\nfor i in range(1, k):\r\n for j in range(1, n + 1):\r\n c = 1\r\n while j * c <= n:\r\n dp[i + 1][j * c] += dp[i][j]\r\n c += 1\r\n# print(dp)\r\nprint(sum(dp[k]) % mod)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nMOD = 1000000007\r\nN,K = map(int, input().split())\r\ndp = [0]*(N+1)\r\nfor i in range(1,N+1):\r\n dp[i] = 1\r\n\r\nfor _ in range(1,K):\r\n ndp = [0]*(N+1)\r\n for i in range(1,N+1):\r\n for j in range(i,N+1,i):\r\n ndp[j]=(ndp[j]+dp[i])%MOD\r\n dp = ndp\r\n\r\nprint(sum(dp)%MOD)\r\n ", "n,k=map(int,input().split())\r\nmod=1000000007\r\nans=[[0 for i in range(n+1)] for i in range(k+1)]\r\nans[1]=[1 for i in range(n+1)]\r\nans[1][0]=0\r\ntosee=[[] for i in range(n+1)]\r\n \r\n \r\nfor i in range(1,n+1):\r\n for j in range(i,n+1,i):\r\n tosee[j].append(i)\r\n \r\nfor i in range(2,k+1):\r\n for j in range(1,n+1):\r\n for num in tosee[j]:\r\n ans[i][j]+=ans[i-1][num]\r\n ans[i][j]%=mod\r\n \r\nprint(sum(ans[k])%mod)", "def C(n , k) :\r\n w = 1\r\n for i in range(n - k + 1 , n + 1) :\r\n w *= i\r\n for i in range(1 , k + 1) :\r\n w //= i\r\n return w\r\nn , k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nans = 0\r\nfor i in range(1 , n + 1) :\r\n pp = 1\r\n i1 = i\r\n for j in range(2 , i + 1) :\r\n sch = 0\r\n while(i1 % j == 0) :\r\n sch += 1\r\n i1 //= j\r\n if(sch) :\r\n pp *= C(sch + k - 1 , sch)\r\n ans += pp\r\n ans %= 1000000007\r\nprint(ans)", "from collections import Counter\r\nfrom math import comb, factorial\r\nMOD = 10**9 + 7\r\nu, n = map(int, input().split())\r\n# dp做法超时,必须用数论\r\ndef euler_sieve(n):\r\n primes = []\r\n is_prime = [True] * (n + 1)\r\n divisors = [[] for _ in range(n + 1)]\r\n for i in range(2, n + 1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n divisors[i].append(i)\r\n for p in primes:\r\n if i * p > n:\r\n break\r\n is_prime[i * p] = False\r\n divisors[i * p] = divisors[i] + divisors[p]\r\n if i % p == 0:\r\n break\r\n return divisors\r\ndivisors = euler_sieve(u)\r\nres = 1\r\nfor i in range(2, u + 1):\r\n cnt = Counter(divisors[i])\r\n freq = list(cnt.values())\r\n tmp = 1\r\n for f in freq:\r\n tmp *= comb(n + f - 1, n - 1)\r\n tmp %= MOD\r\n # 求逆元\r\n res += tmp\r\nprint(res % MOD)", "mod = 1000000007\r\nn,k = map(int,input().split())\r\ndp = [[-1 for i in range(2002)] for i in range(2002)]\r\n\r\n\r\n\r\nfor i in range(n,0,-1):\r\n for j in range(k,0,-1):\r\n if j == k:\r\n dp[i][j] = 1\r\n else:\r\n dp[i][j] = 0 \r\n x = i\r\n while x <= n:\r\n dp[i][j] += dp[x][j+1]\r\n dp[i][j] %= mod\r\n x+= i\r\n\r\n \r\n \r\nans = 0\r\nfor i in range(1,n+1):\r\n ans += dp[i][1]\r\n ans%= mod\r\nprint(ans)", "import sys\r\nreader = (line.rstrip() for line in sys.stdin)\r\ninput = reader.__next__\r\n\r\ndivs = {}\r\nn, k = map(int, input().split())\r\nfor i in range(1, n + 1) :\r\n\tfor j in range(1, i + 1) :\r\n\t\tif(i % j == 0) :\r\n\t\t\tif i not in divs :\r\n\t\t\t\tdivs[i] = [j]\r\n\t\t\telse :\r\n\t\t\t\tdivs[i].append(j)\r\nans = 0\r\ndp = []\r\nMOD = 10**9 + 7\r\nfor _ in range(k + 1) :\r\n\tdp.append([0] * (n + 1))\r\n\r\ndp[0][1] = 1\r\nfor i in range(1, k + 1) :\r\n\tfor j in range(1, n + 1) :\r\n\t\tfor el in divs[j] :\r\n\t\t\tdp[i][j] += dp[i - 1][el]\r\n\t\t\tdp[i][j] %= MOD\r\n\t\tif i == k :\r\n\t\t\tans += dp[i][j]\r\n\t\t\tans %= MOD\r\n\r\nprint(ans % MOD)", "n, k = map(int, input().split())\r\nal = [1 for i in range(n+1)]\r\n \r\nM = 10**9 + 7\r\nfor i in range(k-1):\r\n for j in range(1,n+1):\r\n t = 2*j\r\n while(t<=n):\r\n al[j] = (al[j] + al[t]) % M\r\n t += j \r\nprint(sum(al[i] for i in range(1,n+1)) % M)", "#!/usr/bin/env python3\r\n\r\ndef f(n,k):\r\n t = [1]*(n+1)\r\n for i in range(2,k+1):\r\n s = [0]*(n+1)\r\n for j in range(1,n+1):\r\n for m in range(j,n+1,j):\r\n s[m] += t[j]\r\n t = s\r\n return sum(t[1:])%(int(1e9+7))\r\n\r\nn,k = map(int,input().split())\r\nprint(f(n,k))\r\n", "n, k = map(int, input().split())\r\ndp = [0] * (k + 1)\r\nfor i in range(k + 1):\r\n if i > 0:\r\n dp[i] = [0] * (n + 1)\r\n else:\r\n dp[i] = [1] * (n + 1)\r\nfor i in range(1, k + 1):\r\n for x in range(1, n + 1):\r\n for j in range(x, n + 1, x):\r\n dp[i][x] += dp[i - 1][j]\r\n dp[i][x] %= 1000000007\r\nprint(dp[k][1])\r\n", "n,k=map(int,input().split())\r\na=[[0 for i in range(n+1)] for j in range(k+1) ]\r\nfor i in range(1,n+1):\r\n a[0][i]=1\r\n#print(a)\r\n#for i in range(0,n-1):# i represents column or ending value\r\n#\tfor j in range(k):# k reperesent the number of spaces filled so far\r\nfor i in range(1,k+1):\r\n\tfor j in range(1,n+1):\r\n\t\ttemp=j\r\n\t\twhile temp<=n:\r\n\t\t #print(i,temp)\r\n\t\t a[i][temp]+=a[i-1][j]\r\n\t\t a[i][temp]%=1000000007\r\n\t\t temp+=j\r\n#print(a)\r\nprint(sum(a[k-1])%1000000007)", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef test_case():\r\n n, k = map(int, input().split())\r\n mod = 10**9+7\r\n f = [[0 for _ in range(k+1)] for _ in range(n+1)]\r\n for i in range(1, n+1):\r\n f[i][1] = 1\r\n\r\n for j in range(1, k):\r\n for i in range(1, n+1):\r\n x = 1\r\n while i*x <= n:\r\n f[i*x][j+1] = (f[i*x][j+1] + f[i][j])%mod\r\n x += 1\r\n ans = 0\r\n for i in range(1, n+1):\r\n ans = (ans + f[i][k])%mod\r\n print(ans)\r\n\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k=map(int,input().split())\r\n\r\ndp=[1]*(n+1)\r\nmod=10**9+7\r\n\r\nfor i in range(0,k-1):\r\n\r\n for j in range(1,n+1):\r\n\r\n for p in range(2*j,n+1,j):\r\n dp[j]+=dp[p]\r\n\r\n \r\nprint(sum(dp[1:])%mod)\r\n", "def C(n, m):\r\n r = 1\r\n for i in range(n - m + 1,n + 1): r *= i\r\n for i in range(1, m + 1): r //= i\r\n return r\r\nn, k = map(int, input().split())\r\na = 0\r\nfor i in range (1, n + 1):\r\n t = 1\r\n l = i\r\n for j in range(2, i + 1):\r\n s = 0\r\n while not l % j:\r\n s += 1\r\n l //= j\r\n if s:\r\n t *= C(s + k - 1, s)\r\n a += t\r\nprint(a % (10 ** 9 + 7))", "\r\n#? -----------------------------------------------------------------------------------------------------\r\n#?　　　　　　　　　　　 ∧＿∧\r\n#?　　　　　 ∧＿∧ 　 （´<_｀ ）　 \r\n#?　　　　 （ ´_ゝ`）　/　 ⌒i \r\n#?　　　　／　　　＼　 　 |　| \r\n#?　　　 /　　 /￣￣￣￣/　|　 |\r\n#?　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n#?　 　　　＼/＿＿＿＿/　（u　⊃\r\n#?\r\n#?\t\t /\\_/\\\r\n#?\t\t(= ._.)\r\n#?\t\t/ >WA \\>AC\r\n#?\r\n# WELCOME TO MY CODING SPACE\r\n#! Filename: K_Mashmokh_and_ACM.py\r\n#* Folder: D:\\Code\\Python\\Codeforces\\ProblemSet\\Topic Stream Mashup Dynamic Programming\r\n#? Author: TranDucTri2003\r\n#TODO CreatedAt: 08/09/2022 15:48:12\r\n#? -----------------------------------------------------------------------------------------------------\r\n\r\n#Chuối tốt nếu như b[i] được chia hết bởi b[i] : ví dụ 1, 3\r\n#Cho n và k tìm chuỗi tốt dài k với các phần tử <=n\r\n\r\n#! dp[i][j]: số chuỗi đẹp có độ dài là i và kết thúc là số j\r\n#? Khi ta xét một chuỗi độ dài n, kết thúc bằng số k.\r\n#? Nếu chuỗi n+1 kết thúc bằng x với x%k==0 thì sẽ được bổ sung thêm số cách bằng đúng dp[n][k]\r\n\r\n#TODO Có thể tự hiểu là cũng viết lại y chang các chuỗi đẹp đó và thêm số x ở cuối cùng.\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\nMOD=10**9+7\r\nBUFSIZE = 8192\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\nn,k=list(map(int,input().split()))\r\ndp=[]\r\nfor i in range(k+1):\r\n dp.append([])\r\n for j in range(n+1):\r\n dp[i].append(0)\r\n\r\ndp[0][1]=1 \r\nfor i in range(1,k+1):\r\n for j in range(1,n+1):\r\n for x in range(j,n+1,j):\r\n dp[i][x]=(dp[i][x]+dp[i-1][j])%(10**9+7)\r\n\r\nres=0\r\n\r\nfor i in range(1,n+1):\r\n res+=dp[k][i]\r\nprint(res%(10**9+7))", "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\nn,k = ilele()\r\ndp = list2d(k+1,n+1,0)\r\nfor i in range(n+1):\r\n dp[0][i] = 1\r\nfor i in range(1,k+1):\r\n for l in range(1,n+1):\r\n for j in range(l,n+1,l):\r\n dp[i][l] += dp[i-1][j]\r\n dp[i][l] %= MOD\r\nprint(dp[k][1])", "n,k = map(int,input().split())\r\nl = [int(n/i) for i in range(1,n+1)]\r\nmod = 1000000007\r\nif k == 1 :\r\n\tprint(n)\r\nelse :\r\n\tfor p in range(k-2) :\r\n\t\tfor i in range(1,n+1) :\r\n\t\t\tj=i\r\n\t\t\twhile(j<= n) :\r\n\t\t\t\tj += i\r\n\t\t\t\tif j <= n :\r\n\t\t\t\t\tl[i-1] = (l[i-1] + l[j-1])%mod\r\n\r\n\r\n\r\n\tprint(sum(l)%mod)\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\ndp=[[0 for j in range(n)]for i in range(k)]\r\nfor j in range(n):\r\n dp[0][j-1]=1\r\nfor i in range(k-1):\r\n for j in range(n):\r\n for k1 in range(j,n,j+1):\r\n dp[i+1][k1]+=dp[i][j]%1000000007\r\n dp[i+1][k1]%=1000000007\r\nans=0\r\nfor i in range(n):\r\n ans+=dp[k-1][i]%1000000007\r\n ans%=1000000007\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nn, k = map(int,input().split())\r\nd= [[0 for _ in range(2007)] for _ in range(2007)] \r\nres = 0\r\nMOD = int(1e9+7)\r\n\r\nfor i in range(1, k+1):\r\n for j in range(n,0,-1):\r\n if i == 1:\r\n d[i][j] = 1\r\n else:\r\n for l in range(1,n+1):\r\n if l*j > n:\r\n break\r\n else:\r\n d[i][j] = (d[i][j] + d[i-1][l*j])%MOD\r\n\r\nfor i in range(1,n+1):\r\n res = (res + d[k][i])%MOD\r\n\r\nprint(res)", "\r\n\r\nn,k = map(int,input().split())\r\nn += 1\r\nk += 1\r\ndp = [ [0]*n for _ in range(13)] \r\ns = 0\r\nM = 1000000007\r\nf = [1]\r\nfor i in range(1,4500):\r\n\tf.append(f[-1]*i%M)\r\ndef C(n,k):\r\n\tif k>n:\r\n\t\treturn 0\r\n\treturn f[n]*pow(f[k]*f[n-k]%M,M-2,M)%M\r\nfor i in range(1,12):\r\n\tfor j in range(1,n):\r\n\t\tif i==1:\r\n\t\t\tdp[i][j] = 1\r\n\t\tfor t in range(j*2,n,j):\r\n\t\t\tdp[i+1][t] = (dp[i+1][t]+dp[i][j])%M\r\n\t\ts = (s+C(k-2,i-1)*dp[i][j]%M)%M\r\n# for row in dp:\r\n# \tprint(row)\r\nprint(s)\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "import sys\r\nimport math as mt\r\ninput=sys.stdin.buffer.readline \r\nt=1\r\nmod=10**9+7\r\n\r\ndef getd() : \r\n l=[] \r\n # Note that this loop runs till square root \r\n l.append([0])\r\n l.append([1])\r\n for n in range(2,20001):\r\n i = 1\r\n l1=[]\r\n while i <= mt.sqrt(n): \r\n \r\n if (n % i == 0) : \r\n \r\n # If divisors are equal, print only one \r\n if (n // i == i) : \r\n l1.append(i)\r\n \r\n else : \r\n l1.append(i)\r\n l1.append(n//i)\r\n i = i + 1\r\n l.append(l1) \r\n return l \r\nl=getd() \r\n#print(l[:7])\r\nfor __ in range(t):\r\n n,k=map(int,input().split())\r\n dp=[[0 for j in range(n+1)] for i in range(k+1)]\r\n for j in range(1,n+1):\r\n dp[1][j]=1\r\n for i in range(1,k+1):\r\n dp[i][1]=1\r\n for i in range(2,k+1):\r\n for j in range(2,n+1):\r\n for j1 in l[j]:\r\n dp[i][j]=(dp[i][j]%mod+dp[i-1][j1]%mod)%mod\r\n suma=0\r\n for j in range(1,n+1):\r\n suma=(suma+dp[k][j])%mod\r\n #suma%mod\r\n print(suma%mod) ", "u,n = list(map(int,input().strip().split()))\r\nMod = 10**9+7\r\n\r\ndp = [[0]*12 for j in range(u+1)]\r\n\r\nfor i in range(u,0,-1):\r\n dp[i][1] = 1\r\n for j in range(2*i,u + 1,i):\r\n for k in range(1,11):\r\n dp[i][k + 1] += dp[j][k]\r\n# print(dp)\r\nfrom math import comb\r\ncmb = [0]*13\r\nfor i in range(1,min(12,n + 1)):\r\n cmb[i] = comb(n - 1,i - 1)\r\n\r\nans = 0\r\nfor i in range(1,u + 1):\r\n for j in range(1,min(12,n + 1)):\r\n ans += dp[i][j]*cmb[j]\r\n ans %= Mod\r\nprint(ans)", "# aadiupadhyay\r\nimport os.path\r\nfrom math import gcd, floor, ceil\r\nfrom collections import *\r\nimport sys\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\n\r\ndef solve():\r\n n, k = mp()\r\n dp = [[0]*(k+1) for i in range(n+1)]\r\n for i in range(n+1):\r\n dp[i][1] = 1\r\n for j in range(1, k):\r\n for i in range(1, n+1):\r\n x = 1\r\n while x*i <= n:\r\n dp[x*i][j+1] += dp[i][j]\r\n dp[x*i][j+1] %= mod\r\n x += 1\r\n ans = 0\r\n for i in range(1, n+1):\r\n ans += dp[i][k]\r\n ans %= mod\r\n pr(ans)\r\n\r\n\r\nfor _ in range(1):\r\n solve()\r\n", "from sys import stdin, stdout\r\ninput = stdin.buffer.readline\r\nmi = lambda: map(int, input().split())\r\nli = lambda: list(map(int, input().split()))\r\n\r\ndef divisors(x):\r\n st = set()\r\n j = 1\r\n while j * j <= x:\r\n if x % j == 0:\r\n st.add(j)\r\n st.add(x // j)\r\n j += 1\r\n return st\r\n\r\nn, k = map(int, input().split())\r\ndivs = [0] * (n + 1)\r\n\r\nfor x in range(1, n + 1):\r\n divs[x] = divisors(x)\r\n\r\n# for x in divs:\r\n# cnt += len(x)\r\n# print(cnt)\r\n\r\ndp = [[0] * (n + 1) for _ in range(k + 1)]\r\nMOD = 1000000007\r\nfor i in range(1, n + 1):\r\n dp[1][i] = 1\r\n\r\n# for x in dp:\r\n# print(x)\r\n\r\nfor i in range(1, k + 1):\r\n for j in range(1, n + 1):\r\n for x in divs[j]:\r\n dp[i][j] += dp[i - 1][x]\r\n if dp[i][j] >= MOD:\r\n dp[i][j] -= MOD\r\n\r\nres = 0\r\nfor i in range(1, n + 1):\r\n res += dp[k][i]\r\n if res >= MOD:\r\n res -= MOD\r\n\r\nprint(res)", "dp=[None]*2001\r\nfactors=[None]*2001\r\nfor i in range(2001):\r\n factors[i]=[]\r\n for j in range(1,i+1):\r\n if(i%j==0):\r\n factors[i].append(j)\r\n dp[i]=[0]*2001\r\nfor i in range(1,2001):\r\n dp[1][i]=1\r\n dp[i][1]=1\r\nfor k in range(2,2001):\r\n for i in range(1,2001):\r\n for j in range(i,2001,i):\r\n if(j>1):\r\n dp[j][k]+=dp[i][k-1]\r\n dp[j][k]%=1000000007\r\nn,k=map(int,input().split())\r\nans=0\r\nfor i in range(1,n+1):\r\n ans+=dp[i][k]\r\nprint(ans%1000000007)", "# Problem: B. Mashmokh and ACM\r\n# Contest: Codeforces - Codeforces Round 240 (Div. 1)\r\n# URL: https://codeforces.com/contest/414/problem/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 1000 ms\r\n\r\nimport sys\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nprint = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/contest/414/problem/B\r\n\r\n输入 u n(1≤u,n≤2000)。\r\n输出有多少个长为 n 的数组 a，满足：\r\n1. 1≤a[1]≤a[2]≤...≤a[n]≤u。\r\n2. a[i] 整除 a[i+1]（或者说 a[i] 是 a[i+1] 的因子）。\r\n答案模 1e9+7。\r\n输入 3 2\r\n输出 5\r\n\r\n输入 6 4\r\n输出 39\r\n\r\n输入 2 1\r\n输出 2\r\n\"\"\"\r\n\"\"\" 线性dp+刷表法调和级数复杂度\"\"\"\r\n\r\n\r\n\r\n\r\n# 186 ms\r\ndef solve():\r\n u, n = RI()\r\n f = [1] * (u + 1)\r\n for _ in range(1, n):\r\n for j in range(u, 0, -1):\r\n for k in range(j * 2, u + 1, j):\r\n f[k] = (f[k] + f[j]) % MOD\r\n\r\n print((sum(f) - 1) % MOD)\r\n\r\n\r\n# 234 ms\r\ndef solve2():\r\n u, n = RI()\r\n f = [1] * u\r\n for _ in range(1, n):\r\n g = [0] * u\r\n for j, v in enumerate(f, start=1):\r\n for k in range(j, u + 1, j):\r\n g[k - 1] = (g[k - 1] + v) % MOD\r\n f = g\r\n print(sum(f) % MOD)\r\n\r\n\r\n# 171 ms\r\ndef solve1():\r\n u, n = RI()\r\n f = [1] * u\r\n for _ in range(1, n):\r\n g = [0] * u\r\n for j, v in enumerate(f, start=1):\r\n p = j\r\n while p <= u:\r\n g[p - 1] = (g[p - 1] + v) % MOD\r\n p += j\r\n f = g\r\n print(sum(f) % MOD)\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import math\r\nfrom collections import defaultdict\r\nMOD = 10**9 + 7\r\ndef printDivisors(n) : \r\n \r\n i = 1\r\n Factors = []\r\n while i <= math.sqrt(n): \r\n \r\n if (n % i == 0) : \r\n if (n / i == i) : \r\n Factors.append(i)\r\n else : \r\n Factors.append(i)\r\n Factors.append(int(n/i))\r\n i = i + 1\r\n Factors.sort(reverse = True)\r\n return Factors\r\nF = defaultdict(list)\r\nn,k = map(int,input().split())\r\nfor i in range(1,n+1):\r\n F[i] =printDivisors(i)\r\ndp = [1] * (n+1)\r\ndp[0] = 0\r\nfor i in range(1,k):\r\n for j in range(1,n+1):\r\n for f in range(j+j,n+1,j):\r\n dp[j] += dp[f]\r\n dp[j] %= MOD\r\nprint(sum(dp)%MOD)\r\n", "import math\r\n\r\n\r\ndef solve(n: int, k: int):\r\n MOD = 1000000007\r\n # Set DP array such that for good sequence with length j and last element i will be dp[i][j]\r\n dp = []\r\n for i in range(2002):\r\n dp.append([])\r\n for j in range(2002):\r\n dp[-1].append(0)\r\n for i in range(1, 2001):\r\n dp[i][1] = 1 # It's not aggregate but only last element of sequence is i; hence 1-length is only one seq\r\n for l in range(1, k):\r\n for x in range(1, n+1):\r\n for i in range(1, 1+int(math.floor(n/x))):\r\n # Now for each seq ending v, you can go to seq ending 2v, 3v, 4v (in a single step) where iv <= n\r\n dp[x*i][l+1] += dp[x][l] \r\n # print(f\"{x*i}, {l+1} += {x}, {l}\")\r\n dp[x*i][l+1] %= MOD\r\n ans = 0 \r\n for i in range(1, n+1):\r\n ans += dp[i][k]\r\n ans %= MOD\r\n return ans\r\n\r\n\r\ndef main():\r\n n, k = [int(_) for _ in input().strip().split(' ')]\r\n print(solve(n, k))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# import sys\r\n# sys.stdin = open(\"input.in\",\"r\")\r\n# sys.stdout = open(\"output.out\",\"w\")\r\n\r\nn,k1 = map(int,input().split())\r\n\r\ndp = [[0 for i in range(n+1)] for j in range(k1+1)]\r\ndp[0][0] = 1\r\nfor i in range(k1+1):\r\n\r\n\tdp[i][0] = 1\r\n\r\n# for i in range(n+1):\r\n\r\n# \tdp[i][0] = 1\r\n\r\nfor i in range(1,n+1):\r\n\r\n\tdp[1][i] = 1\r\n\r\n# print(dp)a\r\n\r\n\r\nfor i in range(2,k1+1):\r\n\r\n\tfor j in range(1,n+1):\r\n\t\tk = j\r\n\t\t# r = j\r\n\t\t# print(\"--\")\r\n\t\twhile k <= n:\r\n\r\n\t\t\tdp[i][k] = (dp[i][k] + dp[i-1][j])%1000000007\r\n\r\n\t\t\tk = k + j\r\n# print(dp)\r\nprint((sum(dp[k1])-1)%1000000007)\t\t\r\n\r\n\r\n\r\n# print(dp)\r\n# print(dp[n][k])\r\n", "mod = 1000000007\r\nn,k = [int(x)for x in input().split()]\r\ndp = [[0 for i in range(n+1)]for j in range(k+1)]\r\n\r\nfor i in range(1,n+1):\r\n\tdp[1][i] = 1\r\n\r\nfor l in range(2,k+1):\r\n\tfor i in range(1,n+1):\r\n\t\tfor j in range(i,n+1,i):\r\n\t\t\tdp[l][j] += dp[l-1][i]\r\n\t\t\tif(dp[l][j] >= mod):\r\n\t\t\t\tdp[l][j] -= mod\r\nsum = 0\r\nfor i in range(1,n+1):\r\n\tsum += dp[k][i]\r\n\tif sum >= mod:\r\n\t\tsum -= mod\r\nprint(sum)", "def main():\r\n mod = 1000000007\r\n k, n = map(int, input().split())\r\n f = [[0] * (k + 1) for _ in range(n + 1)]\r\n e = [[] for _ in range(k + 1)]\r\n for i in range(1, k + 1):\r\n cnt = 0\r\n for j in range(i, k + 1, i):\r\n cnt += 1\r\n e[i] = [0] * cnt\r\n cnt = 0\r\n for j in range(i, k + 1, i):\r\n e[i][cnt] = j\r\n cnt += 1\r\n for i in range(1, k + 1):\r\n f[1][i] = 1\r\n for i in range(2, n + 1):\r\n for j in range(1, k + 1):\r\n for v in e[j]:\r\n f[i][j] = (f[i][j] + f[i - 1][v]) % mod\r\n ans = 0\r\n for i in range(1, k + 1):\r\n ans = (ans + f[n][i]) % mod\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "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\ndef main():\r\n MOD = 10**9 + 7\r\n u, n = map(int, input().split())\r\n\r\n dic = {}\r\n for i in range(1, 2001):\r\n L = []\r\n j = 1\r\n while j * j <= i:\r\n if i % j == 0:\r\n L.append(j)\r\n if i // j != j:\r\n L.append(i // j)\r\n j += 1\r\n dic[i] = L\r\n\r\n # dp[i][j] 表示第 i 位恰好为 j 的方案数\r\n dp = [[0] * (u + 1) for _ in range(n)]\r\n for i in range(n):\r\n for j in range(1, u + 1):\r\n if i == 0:\r\n dp[i][j] = 1\r\n else:\r\n for each_yinzi in dic[j]:\r\n dp[i][j] += dp[i - 1][each_yinzi]\r\n dp[i][j] = dp[i][j] % MOD\r\n print(sum(dp[-1]) % MOD)\r\n\r\nif __name__ == \"__main__\":\r\n main()\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,k=lst()\r\n M=10**9+7\r\n ans=0\r\n dp=[[0 for i in range(k+1)] for _ in range(n+1)]\r\n for j in range(1,k+1):\r\n for i in range(1,n+1):\r\n if j==1:dp[i][j]=1\r\n for mul in range(i,n+1,i):\r\n dp[i][j]=(dp[i][j]+dp[mul][j-1])%M\r\n for i in range(1,n+1):\r\n ans=(ans+dp[i][k])%M\r\n print(ans)", "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, k = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n mod = 10**9+7\r\n n2 = n + 1\r\n ar = [[0]*n2 for i in range(k)]\r\n for i in range(n+1):\r\n ar[0][i] = 1\r\n ar[0][0] = 0\r\n for i in range(k-1):\r\n for z in range(1,n2):\r\n for j in range(z,n2,z):\r\n ar[i+1][j] += ar[i][z]\r\n ar[i+1][j] %= mod\r\n print(sum(ar[-1])%mod)\r\n #print(ar)\r\nmain()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = 1000000007\r\nn, k = map(int, input().split())\r\n\r\nd = [1]*(n+1)\r\nfor x in range(k):\r\n for i in range(1, n+1):\r\n for j in range(i*2, n+1, i):\r\n d[i] += d[j]\r\nprint(d[1] % M)\r\n", "n,k=map(int,input().split())\r\ndp=[[0 for i in range(k+1)]for j in range(n+1)]\r\nMOD=10**9+7\r\nfor i in range(1,n+1):\r\n dp[i][1]=1\r\nfor i in range(1,n+1):\r\n for j in range(1,k+1):\r\n for z in range(i,n+1,i):\r\n dp[z][j]+=dp[i][j-1]%MOD\r\n dp[z][j]=dp[z][j]%MOD\r\nres=0\r\nfor i in range(1,n+1):\r\n res+=dp[i][k]\r\n res%=MOD\r\nprint(res)", "class FastComb:\r\n\r\n def __init__(self, n, MOD) -> None:\r\n self.MOD = MOD\r\n # 阶乘\r\n self.fact = [1] * (n + 1)\r\n for i in range(1, n + 1):\r\n self.fact[i] = self.fact[i-1] * i % MOD\r\n\r\n # 逆元\r\n self.inverse = [0] * (n + 1)\r\n self.inverse[n] = pow(self.fact[n], MOD - 2, MOD)\r\n for i in range(n, 0, -1):\r\n self.inverse[i-1] = self.inverse[i] * i % MOD\r\n\r\n # 组合数\r\n def comb(self, n, m):\r\n if m < 0 or m > n:\r\n return 0\r\n return self.fact[n] * self.inverse[m] % self.MOD * self.inverse[n-m] % self.MOD\r\n\r\n\r\n\r\n\r\nfrom collections import Counter\r\nMOD = 10**9 + 7\r\nu, n = map(int, input().split())\r\n# dp做法超时,必须用数论\r\ndef euler_sieve(n):\r\n primes = []\r\n is_prime = [True] * (n + 1)\r\n divisors = [[] for _ in range(n + 1)]\r\n for i in range(2, n + 1):\r\n if is_prime[i]:\r\n primes.append(i)\r\n divisors[i].append(i)\r\n for p in primes:\r\n if i * p > n:\r\n break\r\n is_prime[i * p] = False\r\n divisors[i * p] = divisors[i] + divisors[p]\r\n if i % p == 0:\r\n break\r\n return divisors\r\ndivisors = euler_sieve(u)\r\nres = 1\r\nFC = FastComb(n + u, MOD)\r\nfor i in range(2, u + 1):\r\n cnt = Counter(divisors[i])\r\n freq = list(cnt.values())\r\n tmp = 1\r\n for f in freq:\r\n tmp *= FC.comb(n + f - 1, f)\r\n tmp %= MOD\r\n # 求逆元\r\n res += tmp\r\nprint(res % MOD)", "n,k=map(int,input().split())\r\ndp=[1]*(n+1)\r\nmod=10**9+7\r\n \r\nfor i in range(k-1):\r\n for j in range(1,n+1):\r\n for t in range(2*j,n+1,j):\r\n dp[j]+=dp[t]\r\nprint((sum(dp[1:]))%mod)", "\r\n\r\ndef exp(x, p):\r\n ct = 0\r\n while x%p==0:\r\n x //= p\r\n ct += 1\r\n return ct\r\n\r\ndef magic(n, k):\r\n curr = 1\r\n for i in range(k+1, n+1):\r\n curr *= i\r\n for i in range(n-k, 0, -1):\r\n curr //= i\r\n return int(curr)%(10**9+7)\r\n\r\ndef prime(x):\r\n for i in range(2, int(x**0.5)+1):\r\n if x%i==0:\r\n return False\r\n return True\r\n\r\nprimes = []\r\nfor i in range(2, 2000):\r\n if prime(i):\r\n primes.append(i)\r\n \r\ndef okluving(a, b):\r\n okluv = []\r\n for i in primes:\r\n if a % i == 0:\r\n okluv.append(exp(a, i))\r\n conquer = 1\r\n for i in okluv:\r\n conquer *= magic(i + b-1, b-1)\r\n return conquer%(10**9+7)\r\n\r\nprimes = []\r\nfor i in range(2, 2000):\r\n if prime(i):\r\n primes.append(i)\r\nokluv = []\r\nsumx = 0\r\na, b = map(int, input().split(' '))\r\nfor i in range(1, a+1):\r\n sumx += okluving(i, b)\r\nprint(sumx % (10**9+7))", "import math\r\nn, k = map(int, input().split())\r\ndp = [[1 for _ in range(k+1)] for _ in range(n+1)]\r\nfor i in range(1, n+1):\r\n f = set((1, i))\r\n for m in range(2, int(math.sqrt(i))+1):\r\n if i%m==0:\r\n f.add(m)\r\n if i/m != i:\r\n f.add(i//m)\r\n f = list(f)\r\n for j in range(2, k+1):\r\n dp[i][j] = 0\r\n for x in f:\r\n dp[i][j] = (dp[i][j] + dp[x][j-1])%1000000007\r\nans = 0\r\nfor i in range(1, n+1):\r\n ans += dp[i][k]\r\n ans = ans%1000000007\r\nprint(ans%1000000007)\r\n", "MOD = 10**9 + 7\nn, k = map(int, input().split())\ne = []\n\ndef addMod(a, b):\n if (a + b < MOD):\n return a + b\n else:\n return a + b - MOD\n\nfor i in range(1, n + 1):\n for j in range(i, n + 1, i):\n e.append((i, j))\n \ndp = [i > 0 for i in range(0, n + 1)]\n\nfor i in range(1, k):\n ndp = [0 for j in range(0, n + 1)]\n \n for (a, b) in e:\n ndp[b] = addMod(ndp[b], dp[a])\n \n dp = ndp.copy()\n \nprint(sum(dp) % MOD)\n\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\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n n, k = ac.read_ints()\r\n mod = 10**9 + 7\r\n factor = [[] for _ in range(n + 1)]\r\n for x in range(1, n + 1):\r\n y = 1\r\n while x * y <= n:\r\n factor[x * y].append(x)\r\n y += 1\r\n dp = [[0] * (n + 1) for _ in range(2)]\r\n dp[0] = [1] * (n + 1)\r\n dp[0][0] = 0\r\n for i in range(1, k):\r\n for j in range(1, n + 1):\r\n dp[i % 2][j] = sum(dp[1 - i % 2][x] for x in factor[j]) % mod\r\n ans = sum(dp[(k - 1) % 2]) % mod\r\n ac.st(ans)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import collections\r\nimport math\r\n\r\nMOD = 10**9 + 7\r\n\r\nn, k = list(map(int, input().split(\" \")))\r\n\r\nres = 0\r\n\r\nfor last in range(1, n + 1):\r\n freq = collections.defaultdict(int)\r\n i = 2\r\n while i * i <= last:\r\n while last % i == 0:\r\n freq[i] += 1\r\n last //= i\r\n i += 1\r\n if last > 1:\r\n freq[last] += 1\r\n temp = 1\r\n for _, v in freq.items():\r\n temp *= math.comb(k + v - 1, v) % MOD\r\n temp %= MOD\r\n res = (res + temp) % MOD\r\n\r\nprint(res)\r\n", "def C(n,k):\n\n w=1\n\n for i in range(n-k+1,n+1):\n\n w*=i\n\n for i in range (1,k+1):\n\n w//=i\n\n return w\n\n\n\nn,k=[int(x) for x in input().split()]\n\nans=0\n\nfor i in range(1,n+1):\n\n pp=1;\n\n i1=i;\n\n for j in range(2,i+1):\n\n sch=0;\n\n while(i1%j==0):\n\n sch+=1\n\n i1//=j\n\n if (sch):\n\n pp*=C(sch+k-1,sch)\n\n pp%=1000000007\n\n ans+=pp\n\n ans%=1000000007\n\nprint(ans)\n\n\n\n# Made By Mostafa_Khaled", "n,k=map(int,input().split())# se reciben los datos n y k \r\nlista=[] # se nombra la lista donde se guardaran en cada posicion el numero de combinaciones al ubicar en la primera posicion de la secuemcia el numero n\r\nfor i in range(n+1): # inicialmente se guarda 1 que es el nunmero que genera al ubicar cadan en la primera posicion de la secuencia\r\n lista.append(1)\r\n\r\nfor i in range(k-1): # pro cada iteracion de i se maneja el concepto de ubicar otro n en la secuencia hasta tener k posiciones\r\n for j in range(1,n+1): # por cada j se analiza el numero de combinaciones que se generan al ubicar j en la posicion i de la secuencia \r\n multiplo=2*j # se pasa al siguiente multiplo\r\n while (multiplo<=n): # mientras ese multiplo sea un numero valido o sea menor o igual que n\r\n lista[j]=lista[j]+lista[multiplo] # se suman el numero de combinaciones generadas al ubicar multiplo en la secuencia luego de j\r\n multiplo=multiplo+j # se salta al siguiente multiplo \r\ntotal=0 # variable a mostrar\r\nfor i in range(1,n+1): # se suman todas las combinaciones al ubicar cada n en la posicion inicial\r\n total=total+lista[i]\r\nprint(total%(10**9+7))\r\n ", "MOD = 10 ** 9 + 7\n\nN, K = map(int, input().split())\n\ndp = [[0 for _ in range(N + 1)] for _ in range(K + 1)]\n\nfor i in range(N + 1):\n dp[1][i] = 1\n\nfor k in range(2, K + 1):\n for n in range(1, N + 1):\n c = 0\n for i in range(n, N + 1, n):\n c = (c + dp[k - 1][i]) % MOD\n dp[k][n] = c % MOD\n\nc = 0\nfor i in range(1, N + 1):\n c = (c + dp[K][i]) % MOD\nprint(c)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = int(1e9) + 7\r\n\r\nn, k = map(int, input().split())\r\ndp = [1 for _ in range(n + 1)]\r\n\r\nfor i in range(k-1):\r\n for j in range(1, n+1):\r\n q = 2 * j\r\n while q < n + 1:\r\n dp[j] += dp[q]\r\n q += j\r\nprint(sum(dp[1:]) % M)", "mod=10**9+7\n[n ,k]=list(map(int, input().split()))\ndp=[[0 for _ in range(n+1)] for _ in range(k+1)]\nfor last in range(1, n+1):\n dp[1][last]=1\nfor l in range(2, k+1):\n for i in range(1, n+1):\n for j in range(i, n+1, i):\n dp[l][j]=(dp[l][j]+dp[l-1][i])%mod\nprint(sum(dp[k])%mod)\n", "import sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\nM=int(1e9+7)\r\ndp=[1]*(n+1)\r\nfor _ in range(k):\r\n for i in range(1,n+1):\r\n sm=0\r\n for j in range(i,n+1,i):\r\n sm+=dp[j]%M \r\n dp[i]=sm \r\n \r\nprint(dp[1]%M)\r\n \r\n", "n, k = [int(j) for j in input().split()]\r\nmod = 1000000007\r\n\r\n\r\ndp = [[0] * (k + 1) for _ in range(n + 1)]\r\n\r\nfor j in range(len(dp[0]) - 1, -1, -1):\r\n if j > 0:\r\n for i in range(1, len(dp)):\r\n if j == k:\r\n dp[i][j] = 1\r\n else:\r\n cur = i\r\n while cur <= n:\r\n dp[i][j] += dp[cur][j + 1]\r\n dp[i][j] %= mod\r\n cur += i\r\n\r\ntot = 0\r\nfor i in range(1, len(dp)):\r\n tot += dp[i][1]\r\n tot %= mod\r\n\r\n\r\nprint(tot % mod)\r\n\r\n", "u, n = map(int, input().split())\r\nif n == 1:\r\n print(u)\r\n exit()\r\n \r\nmod = 10 ** 9 + 7\r\n\r\nf = [[0] * (u + 1) for _ in range(n + 1)]\r\n\r\nfor v in range(u + 1):\r\n f[n][v] = 1\r\n\r\nfor i in range(n - 1, -1, -1):\r\n for v in range(u, 0, -1):\r\n for j in range(v, u + 1, v):\r\n f[i][v] += f[i + 1][j] % mod\r\n f[i][v] %= mod\r\n\r\nprint(f[0][1])", "# Description of the problem can be found at http://codeforces.com/problemset/problem/414/B\n\nn,k = map(int,input().split())\nn += 1\nk += 1\ndp = [[0] * n for _ in range(13)]\ns = 0\nM = 1000000007\nf = [1]\nfor i in range(1,4500):\n\tf.append(f[-1] * i % M)\ndef C(n, k):\n\tif k>n:\n\t\treturn 0\n\treturn f[n] * pow(f[k] * f[n - k] %M , M - 2, M) % M\n\nfor i in range(1, 12):\n\tfor j in range(1, n):\n\t\tif i == 1:\n\t\t\tdp[i][j] = 1\n\t\tfor t in range(j * 2, n, j):\n\t\t\tdp[i + 1][t] = (dp[i + 1][t] + dp[i][j]) % M\n\t\ts = (s + C(k - 2, i - 1) * dp[i][j] % M) % M\n\n\nprint(s)", "import math\r\nimport sys\r\n\r\n\r\nclass FastIO:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def read_str():\r\n return sys.stdin.readline().rstrip()\r\n\r\n @staticmethod\r\n def read_int():\r\n return int(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_float():\r\n return float(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def read_ints():\r\n return map(int, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_floats():\r\n return map(float, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_ints_minus_one():\r\n return map(lambda x: int(x) - 1, sys.stdin.readline().rstrip().split())\r\n\r\n @staticmethod\r\n def read_list_ints():\r\n return list(map(int, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_floats():\r\n return list(map(float, sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_ints_minus_one():\r\n return list(map(lambda x: int(x) - 1,\r\n sys.stdin.readline().rstrip().split()))\r\n\r\n @staticmethod\r\n def read_list_strs():\r\n return sys.stdin.readline().rstrip().split()\r\n\r\n @staticmethod\r\n def read_list_str():\r\n return list(sys.stdin.readline().rstrip())\r\n\r\n @staticmethod\r\n def st(x):\r\n return print(x)\r\n\r\n @staticmethod\r\n def lst(x):\r\n return print(*x)\r\n\r\n @staticmethod\r\n def round_5(f):\r\n res = int(f)\r\n if f - res >= 0.5:\r\n res += 1\r\n return res\r\n\r\n @staticmethod\r\n def max(a, b):\r\n return a if a > b else b\r\n\r\n @staticmethod\r\n def min(a, b):\r\n return a if a < b else b\r\n\r\n\r\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n mod = 10 ** 9 + 7\r\n n, k = ac.read_ints()\r\n res = 0\r\n for last in range(1, n + 1):\r\n i = 2\r\n temp = 1\r\n while i * i <= last:\r\n cnt = 0\r\n while last % i == 0:\r\n cnt += 1\r\n last //= i\r\n temp *= math.comb(k + cnt - 1, k - 1) % mod\r\n i += 1\r\n if last > 1:\r\n temp *= math.comb(k, k - 1) % mod\r\n res = (res + temp) % mod\r\n ac.st(res)\r\n return\r\n\r\n\r\nSolution().main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\nimport math\r\nimport copy\r\n \r\nn,k = map(int,input().split())\r\nmod = 10**9+7\r\ndp = []\r\nfor i in range(k):\r\n dp.append([])\r\n for j in range(n+1):\r\n dp[i].append(0)\r\nfor j in range(1,n+1):\r\n dp[0][j] = 1\r\nfor i in range(k-1):\r\n for j in range(1,n+1):\r\n for z in range(j,n+1,j):\r\n dp[i+1][z] += dp[i][j]\r\n dp[i+1][z]%=mod\r\nprint(sum(dp[k-1])%mod)" ]

[ "def main():\r\n n = int(input())\r\n l = [int(i) for i in input().split()]\r\n l.sort()\r\n l.reverse()\r\n candidate = []\r\n i = 1\r\n while (i < n):\r\n if (l[i - 1] - l[i] <= 1):\r\n candidate.append(min(l[i - 1], l[i]))\r\n i += 2\r\n else:\r\n i += 1\r\n\r\n area = 0\r\n for i in range(1, len(candidate), 2):\r\n area += candidate[i] * candidate[i - 1]\r\n return area\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = {}\r\nm2 = set()\r\nfor i in range(1, 10**6 + 1):\r\n m[i] = 0\r\nfor i in range(n):\r\n m[l[i]] += 1\r\n m2.add(l[i])\r\n if l[i] >= 2:\r\n m2.add(l[i] - 1)\r\nm1 = []\r\n\r\nfor i in range(10**6, 1, -1):\r\n if m[i] % 2 == 1 and m[i - 1] > 0:\r\n m[i] -= 1\r\n m[i - 1] += 1\r\n elif m[i] % 2 == 1:\r\n m[i] -= 1\r\nfor i in m2:\r\n if m[i] != 0:\r\n m1.append(i)\r\nm1.sort(reverse = True)\r\n\r\ncnt = 0\r\nfor i in range(len(m1)):\r\n cnt += (m[m1[i]]//4)*(m1[i]**2)\r\n if m[m1[i]] % 4 == 2 and i != len(m1) - 1:\r\n m[m1[i + 1]] -= 2\r\n cnt += m1[i + 1]*m1[i]\r\nprint(cnt)\r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nai = list(map(int,input().split()))\r\nai.sort()\r\nans = 0\r\nprev = 0\r\nsticks = []\r\ni = n-2\r\nwhile i > -1:\r\n if ai[i+1] <= ai[i] + 1:\r\n sticks += [ai[i]]\r\n i -= 1\r\n i -= 1\r\nfor i in range(1,len(sticks),2):\r\n ans += sticks[i] * sticks[i-1]\r\nprint(ans)\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\nl.sort()\r\n\r\nl2 = [0] * n\r\nprev = l[0]\r\ncount = 1\r\nk = 0\r\n\r\nfor i in range(1, n):\r\n if l[i] != prev:\r\n l2[k] = [prev, count]\r\n k += 1\r\n prev = l[i]\r\n count = 1\r\n else:\r\n count += 1\r\n\r\nl2[k] = [prev, count]\r\nk += 1\r\nfor i in range(k-1, 0, -1):\r\n if l2[i][1] % 2 == 1 and l2[i-1][0] == (l2[i][0] - 1):\r\n l2[i-1][1] += 1\r\n l2[i][1] //= 2\r\nl2[0][1] //= 2\r\ni = k-1\r\nj = k-1\r\nres = 0\r\nwhile i >= 0 and j >= 0:\r\n if i == j:\r\n res += l2[i][0] * l2[i][0] * (l2[i][1] // 2)\r\n l2[i][1] %= 2\r\n if l2[i][1] == 0:\r\n i -= 1\r\n j -= 1\r\n else:\r\n i -= 1\r\n\r\n else:\r\n if l2[i][1] == 0:\r\n i -= 1\r\n continue\r\n res += l2[i][0] * l2[j][0]\r\n l2[i][1] -= 1\r\n j = i\r\n\r\nprint(res)\r\n", "\nn=int(input())\na=[-1]\na+=[int(x) for x in input().split()]\na.sort()\nl=0\nans=0\ni=n\nwhile i>=1:\n if a[i]==a[i-1] or a[i]==a[i-1]+1:\n if(l==0):\n l=a[i-1]\n else :\n ans+=l*a[i-1]\n l=0\n i-=2\n else:\n i-=1\nprint (ans)\n\n \t \t \t \t \t\t \t\t \t\t \t\t \t \t\t \t\t", "n = int(input())\n\na, b = 0, 0\n\nans = 0\n\nfor i in sorted(map(int,input().split()),reverse=True):\n\n if a == 0 or a > i + 1:\n\n a = i\n\n elif b == 0:\n\n a, b= 0, i\n\n else:\n\n ans += i * b\n\n a, b = 0, 0\n\nprint(ans)\n\n\n\n\n\n\n\n \n\n\n\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\nl = list(map(int, input().split()))\nl.sort(key=lambda x: -x)\ni = 0\ncur = 0\nans = 0\nwhile i < len(l)-1:\n if l[i] == l[i+1] or l[i]-1 == l[i+1]:\n if cur == 0:\n cur = l[i+1]\n else:\n ans += cur*l[i+1]\n cur = 0\n i += 2\n else:\n i += 1\nprint(ans)\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()), reverse=1)\r\ni = 0\r\nc = 0\r\na = 0\r\nwhile i < n-1:\r\n if w[i] < w[i+1] + 2:\r\n if a == 0:\r\n a = min(w[i], w[i+1])\r\n else:\r\n c += a*min(w[i], w[i+1])\r\n a = 0\r\n i += 2\r\n else:\r\n i += 1\r\nprint(c)\r\n", "n = int(input())\narr = list(map(int, input().split()))\nfrom collections import Counter\n\nmain = Counter(arr)\n\nfor key in sorted(main.keys(), reverse = True):\n if main[key] % 2:\n main[key] -= 1\n if key - 1 in main:\n main[key - 1] += 1\n\ntotal = 0\nf = []\nfor key in sorted(main.keys(), reverse = True):\n while main[key]:\n f.append(key)\n main[key] -= 1\n if len(f) == 4:\n total += f[0] * f[2]\n f = []\n\nprint(total)\n \n \n \n", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nsetrecursionlimit(10**7)\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nn=RI()[0]\nl=RI()\nl.sort(reverse=True)\nans=0\npre=0\ni=0\nwhile i<len(l)-1:\n if l[i]-l[i+1]<=1:\n if pre:\n ans+=(pre*l[i+1])\n pre=0\n else:\n pre=l[i+1]\n i+=1\n i+=1\nprint(ans)\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\n\r\nl.sort(reverse=True)\r\n\r\nans = 0\r\narea = 0\r\nignore_next = False\r\n\r\nfor i in range(n - 1):\r\n if ignore_next:\r\n ignore_next = False\r\n continue\r\n\r\n l1 = l[i] \r\n l2 = l[i+1]\r\n length = 0\r\n #print(\"compare\", l1, l2)\r\n if l1 == l2: \r\n length = l1\r\n elif l1 == l2 + 1:\r\n length = l1 - 1\r\n #print('length=', length, ' area=', area)\r\n if length:\r\n if area:\r\n ans += area * length\r\n area = 0\r\n else:\r\n area = length\r\n ignore_next = True\r\n\r\nprint(ans)\r\n", "\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n b = []\r\n area = 0\r\n a.sort()\r\n\r\n for i in reversed(range(len(a))):\r\n if i > 0 and (a[i] == a[i - 1] or a[i]-1 == a[i - 1]):\r\n b.append(a[i-1])\r\n a[i-1] = -1\r\n\r\n\r\n for i in range(int(len(b) / 2)):\r\n area += b[2*i] * b[2*i + 1]\r\n\r\n print(area)\r\n\r\nif __name__ == '__main__':\r\n main()", "x,y=0,0\r\nn=int(input())\r\nn-=1\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nt=0\r\nwhile(n>0):\r\n # print(l[n])\r\n if l[n]-l[n-1]<=1:\r\n if not x:\r\n x=l[n]-l[n]+l[n-1]\r\n n-=1\r\n else:\r\n y=l[n]-l[n]+l[n-1]\r\n t+=x*y\r\n x,y=0,0\r\n n-=1\r\n n-=1\r\nprint(t)\r\n", "am = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\ncounted = [0]*(1000000)\r\nfor i in range(am):\r\n counted[arr[i]-1]+=1\r\nfl = True\r\nl = 0\r\nlAdded = 0\r\nhaveL = []\r\nhaveAm = []\r\nfor i in range(len(counted)-1,-1,-1):\r\n if counted[i] != 0:\r\n if fl:\r\n haveL+= [i,i-1]\r\n haveAm+= [counted[i] - counted[i]%2,counted[i]%2]\r\n l = i\r\n lAdded = counted[i]%2\r\n fl = False\r\n \r\n else:\r\n if l-i == 1:\r\n haveL+=[i-1]\r\n haveAm[-1] += counted[i]\r\n if haveAm[-1]%2 == 1:\r\n haveAm[-1]-=1\r\n haveAm += [1]\r\n else:\r\n haveAm+=[0]\r\n l = i\r\n else:\r\n haveL += [i,i-1]\r\n haveAm += [counted[i] - counted[i]%2,counted[i]%2]\r\n l = i\r\n\r\n\r\n\r\n\r\nhaveTot = []\r\n\r\nfor i in range(len(haveL)):\r\n if haveAm[i] != 0:\r\n haveTot+= [haveL[i]+1]*(haveAm[i]//2)\r\ntotArea = 0\r\nhaveTot.sort(reverse=True)\r\n\r\nfor i in range(0,(len(haveTot)//2 * 2),2):\r\n totArea += haveTot[i]*haveTot[i+1]\r\nprint(totArea)", "from sys import stdin,stdout,setrecursionlimit\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\nfrom bisect import bisect_right as br,bisect_left as bl\r\nfrom heapq import *\r\nmod = 10**9+7\r\ninf = (1<<60)\r\n\r\nn = it()\r\nl = sorted(mp() , reverse=True)\r\n# print(l)\r\nans = 0\r\nprev = l[0]\r\nv = []\r\nheapify(v)\r\nfor i in range(1,n):\r\n\tif prev == -1:\r\n\t\tprev = l[i]\r\n\telif prev-1 == l[i] or prev == l[i]:\r\n\t\theappush(v,-l[i])\r\n\t\tprev = -1\r\n\telse:\r\n\t\tprev = l[i]\r\n\r\nwhile len(v)>1:\r\n\ttemp1 = heappop(v)\r\n\ttemp2 = heappop(v)\r\n\tans += temp1*temp2\r\nprint(ans)\r\n", "n = int(input())\na = list(map(int,input().split()))\n\na = sorted(a)[::-1]\n\nm = 0\ntotal = 0\nwhile(True):\n\tflag1 = False\n\tflag2 = False\n\tfor i in range(m,n-1):\n\t\tif((a[i] == a[i+1] or a[i] - a[i+1] == 1) and a[i] != -1):\n\t\t\tflag1 = True\n\t\t\tx = a[i+1]\n\t\t\tm = i+2\n\t\t\tbreak\n\tfor i in range(m,n-1):\n\t\tif((a[i] == a[i+1] or a[i] - a[i+1] == 1) and a[i] != -1):\n\t\t\tflag2 = True\n\t\t\ty = a[i+1]\n\t\t\tm = i+2\n\t\t\tbreak\n\tif(flag2 == True):\n\t\ttotal += x*y\n\telse:\n\t\tbreak\n\nprint(total)", "def main():\n input()\n res, it = 0, iter(sorted(map(int, input().split()), reverse=True))\n try:\n while True:\n a, b, c, d = next(it), next(it), next(it), next(it)\n while a > b + 1:\n a, b, c, d = b, c, d, next(it)\n while c > d + 1:\n c, d = d, next(it)\n res += b * d\n except StopIteration:\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nside = []\r\ni = n - 1\r\nwhile i > 0:\r\n s = l[i]\r\n if s == l[i - 1]:\r\n side.append(s)\r\n i -= 2\r\n elif s == l[i - 1] + 1:\r\n side.append(s - 1)\r\n i -= 2\r\n else:\r\n i -= 1\r\nside.sort()\r\ni = len(side) - 1\r\nnum = 0\r\nwhile i > 0:\r\n num += side[i] * side[i - 1]\r\n i -= 2\r\nprint(num)", "n = int(input())\nsticks = sorted(map(int, input().split()), key=lambda x: -x)\narea = 0\npairs = []\npos = 0\nwhile pos < n - 1:\n a, b = sticks[pos], sticks[pos + 1]\n if a - b <= 1:\n if len(pairs) == 0:\n pairs.append(b)\n else:\n area += pairs.pop() * b\n pos += 1\n pos += 1\nprint(area)\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nrect = []\r\ni = 0\r\nwhile i < n :\r\n\r\n #print(i,l[i] == l[i+1]+1)\r\n if i+1 < n and l[i] == l[i+1] :\r\n rect.append(l[i])\r\n i += 2\r\n elif i+1 <n and l[i]-1 == l[i+1] :\r\n rect.append(l[i+1])\r\n i += 2\r\n else :\r\n i += 1\r\n\r\n#print(rect)\r\ns = 0\r\nfor i in range(0,len(rect),2):\r\n if i+1 < len(rect):\r\n s += rect[i]*rect[i+1]\r\n\r\nprint(s)\r\n\r\n\r\n", "n = int(input())\r\narr = list(sorted(map(int, input().split()), reverse=True))\r\n\r\ndstick = list()\r\n\r\nidx = 0\r\n\r\nwhile idx + 1 < n:\r\n if arr[idx] == arr[idx + 1] or arr[idx] - 1 == arr[idx + 1]:\r\n dstick.append(arr[idx + 1])\r\n idx += 2\r\n else:\r\n idx += 1\r\n\r\nif len(dstick) & 1 == 1:\r\n dstick.pop()\r\n\r\nans = 0\r\n\r\nfor i in range(0, len(dstick) - 1, 2):\r\n ans += dstick[i] * dstick[i + 1]\r\n\r\nprint(ans)\r\n", "import sys\n\n\ndef max_square(number_of_sticks, sticks):\n if number_of_sticks < 4:\n return 0\n else:\n sticks.sort()\n sticks.reverse()\n max_sq = 0\n max_stick = 0\n i = 1\n while i < len(sticks):\n if sticks[i - 1] - sticks[i] <= 1:\n if max_stick == 0:\n max_stick = sticks[i]\n i += 1\n else:\n max_sq += max_stick * sticks[i]\n max_stick = 0\n i += 1\n i += 1\n return max_sq\n\nif __name__ == \"__main__\":\n first_line = int(sys.stdin.readline())\n second_line = [int(i) for i in sys.stdin.readline().split()]\n sys.stdout.write(str(max_square(first_line, second_line)))\n\n\n\n", "n = int(input())\r\nanswer = 0\r\nsticks = input().split()\r\nfor i in range(n):\r\n sticks[i] = int(sticks[i])\r\nsticks.sort(reverse=True)\r\n# print(sticks)\r\ni = 0\r\nv = []\r\nwhile i < n-1:\r\n if abs(sticks[i]-sticks[i+1]) < 2:\r\n v.append(min(sticks[i], sticks[i+1]))\r\n i+=2\r\n else:\r\n i+=1\r\nv.sort(reverse=True)\r\ni = 0\r\nwhile i < len(v)-1:\r\n answer += v[i]*v[i+1]\r\n i += 2\r\nprint(answer)", "ans = 0\r\nn = 0\r\nn = int(input(\"\"))\r\nl = input(\"\")\r\nst = []\r\nfor x in l.split(\" \"):\r\n st.append(int(x))\r\nst.sort()\r\ni = n-1\r\nwhile i>=3:\r\n if st[i]>st[i-1]+1:\r\n i = i -1\r\n continue\r\n l = st[i-1]\r\n i = i -2\r\n while i>0 and st[i]>st[i-1]+1:\r\n i=i-1\r\n if i == 0:\r\n break\r\n b = st [i-1]\r\n ans = ans + l*b\r\n i = i - 2\r\nprint(ans)\r\n", "from collections import *\r\nfrom operator import itemgetter\r\nfrom copy import deepcopy\r\n\r\n\r\ndef remove():\r\n tem = deepcopy(sorted(c.keys(), reverse=True))\r\n\r\n for i in tem:\r\n if c[i] % 4 in [1, 3]:\r\n c[i] -= 1\r\n if c[i - 1]:\r\n c[i - 1] += 1\r\n if c[i] == 0:\r\n del c[i]\r\n\r\n\r\ndef even():\r\n global ans\r\n all = deepcopy(sorted(c.keys(), reverse=True))\r\n for i in range(len(all)):\r\n ans += all[i] * all[i] * (c[all[i]] // 4)\r\n\r\n if c[all[i]] % 4 and i < len(all) - 1:\r\n ans += all[i] * all[i + 1]\r\n c[all[i + 1]] -= 2\r\n\r\n\r\ndef solve():\r\n global ans\r\n remove()\r\n even()\r\n return ans\r\n\r\n\r\nn, a = int(input()), list(map(int, input().split()))\r\nc, all, ans = Counter(a), deque([]), 0\r\nprint(solve())\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort(reverse=True)\r\nans=0\r\ncount=0\r\ntemp=1\r\ni=0\r\nwhile(i<n-1):\r\n if l[i]==l[i+1]:\r\n temp*=l[i]\r\n i+=2\r\n count+=1\r\n elif l[i]==(l[i+1]+1):\r\n temp*=l[i+1]\r\n i+=2\r\n count+=1\r\n else:\r\n i+=1\r\n if count==2:\r\n count=0\r\n ans+=temp\r\n temp=1\r\nprint(ans)", "n=int(input())\r\nlst=[*map(int,input().split())]\r\nlst=[*reversed(sorted(lst))]\r\ncount,res=1,[]\r\nex=res.extend\r\nfor i,x in enumerate(lst[1:]):\r\n if lst[i]==x:count+=1\r\n else:\r\n div,mod=count//2,count%2\r\n ex([lst[i]]*div)\r\n count=1\r\n if mod==1 and lst[i]-x==1:count+=1\r\n last=lst[i]\r\nex([lst[-1]]*(count//2))\r\nresult=0\r\nfor i in range(1,len(res),2):\r\n result+=(res[i]*res[i-1])\r\nprint(result)", "import collections\nn = int(input())\nnums = list(map(int,input().split()))\n\n\nd = collections.defaultdict(int)\n\nfor i in nums:\n\td[i] += 1\n\nkeys = sorted(d,reverse=True)\n\nfor k in keys:\n\tif d[k] % 2:\n\t\tif d[k-1] > 0:\n\t\t\td[k] -= 1\n\t\t\td[k-1] += 1\n\t\telse:\n\t\t\td[k] -= 1\n\n\n\ncount = keys[0]\ni = 0\nans = collections.defaultdict(list)\nwhile count:\n\n\tif d[count] > 0:\n\t\td[count] -= 2\n\t\tans[i] = ans[i] + [count,count]\n\n\tif len(ans[i]) == 4:\n\t\ti += 1\n\n\tif d[count] == 0:\n\t\tcount -= 1\n\n\narea = 0\nfor i in ans:\n\tif len(ans[i])== 4:\n\t\tarea = area + (ans[i][0]*ans[i][2])\n\nprint(area)\n\n\n\n\n\n", "import sys\r\ndef otb(l):\r\n i = 0\r\n while i < n - 1:\r\n if l[i] - 1 == l[i + 1]:\r\n l[i] -= 1\r\n i += 1\r\n elif l[i] == l[i + 1]:\r\n i += 1\r\n i += 1\r\n znach = []\r\n i = 0\r\n while i < n - 1:\r\n if l[i] == l[i + 1]:\r\n znach.append(l[i])\r\n i += 1\r\n i += 1\r\n return znach\r\ndef ploshad(n,znach):\r\n summa = 0\r\n n = len(znach)\r\n for i in range(0, n - 1, 2):\r\n summa += znach[i] * znach[i + 1]\r\n sys.stdout.write(str(summa))\r\n\r\nn = int(sys.stdin.readline())\r\nl = []\r\nl = [int(j) for j in sys.stdin.readline().split()]\r\nl.sort(reverse=True)\r\nznach=otb(l)\r\nploshad(n,znach)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nres = 0\r\ni = n-1\r\nb = []\r\nwhile i > 0:\r\n if a[i] - a[i-1] < 2:\r\n b.append(a[i-1])\r\n i -= 1\r\n i -= 1\r\n#print(b)\r\nfor i in range(0, len(b)-1, 2):\r\n res += b[i] * b[i+1]\r\nprint(res)", "from sys import stdin,stdout\r\nfrom collections import Counter\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\ndef fn(p1):\r\n global ans\r\n mx = smx = 0;p=p11=-1\r\n for i in range(p1 - 1, -1, -1):\r\n if i - 1 >= 0 and a[i] == a[i - 1]:\r\n mx = a[i]\r\n p = i\r\n break\r\n if i - 1 >= 0 and a[i] - a[i - 1] == 1:\r\n mx = a[i - 1]\r\n p = i\r\n break\r\n for i in range(p - 2, -1, -1):\r\n if i - 1 >= 0 and a[i] == a[i - 1]:\r\n smx = a[i]\r\n p11=i\r\n break\r\n if i - 1 >= 0 and a[i] - a[i - 1] == 1:\r\n smx = a[i - 1]\r\n p11=i\r\n break\r\n # print(mx,smx)\r\n ans+=(mx * smx)\r\n return p11-1\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n a=sorted(lst())\r\n mx=smx=ans=0\r\n p1=n\r\n while p1>=0:\r\n # print(ans,p1)\r\n p1=fn(p1)\r\n print(ans)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nl.sort(reverse=True)\r\na = []\r\ni = 0\r\nwhile i < len(l) - 1:\r\n #print(l[i], l[i + 1])\r\n if l[i] == l[i + 1]:\r\n a.append(l[i])\r\n i += 2\r\n else:\r\n if l[i] == l[i + 1] + 1:\r\n a.append((l[i] - 1))\r\n i += 2\r\n else:\r\n i += 1\r\n\r\n#print(a)\r\nif len(a) % 2 != 0:\r\n a.append(0)\r\n\r\ns, i = 0, 0\r\nwhile i < len(a):\r\n s += a[i] * a[i + 1]\r\n i += 2\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\na=[]\r\nfor x in s.split(' '):\r\n a.append(int(x))\r\na.sort()\r\nans=0\r\nk=0\r\nflag=0\r\nfor i in range(n-1,0,-1):\r\n if flag:\r\n flag=0\r\n continue\r\n if a[i]==a[i-1] or a[i]==a[i-1]+1:\r\n if k!=0:\r\n ans+=k*a[i-1]\r\n k=0\r\n else:\r\n k=a[i-1]\r\n flag=1\r\nprint(ans)\r\n\r\n \r\n\r\n \r\n", "n, v, ps, pp = int(input()), 0, 0, 0\r\nfor l in sorted(map(int, input().split()), reverse=True):\r\n if ps == 0 or ps > l + 1:\r\n ps = l\r\n elif pp == 0:\r\n pp, ps = l, 0\r\n else:\r\n v, pp, ps = v + pp * l, 0, 0\r\nprint(v)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort(reverse=True)\r\nk=[]\r\ni=1 \r\nwhile i<n:\r\n if l[i-1]-l[i]==1:\r\n k.append(l[i])\r\n i+=1 \r\n elif l[i-1]==l[i]:\r\n k.append(l[i])\r\n i+=1 \r\n i+=1 \r\nans=0 \r\nfor i in range(1,len(k),2):\r\n ans+=k[i]*k[i-1]\r\nprint(ans)", "# coding=utf-8\n\n\nn = input()\nl = list(map(int, input().split()))\n\na, b = 0, 0\nresult = 0\nfor i in sorted(l, reverse=True):\n if a == 0 or a > i + 1:\n a = i\n elif b == 0:\n a, b = 0, i\n else:\n result += i * b\n a, b = 0, 0\n\nprint(result)\n", "n=int(input())\r\nl1=[int(a) for a in input().split()]\r\nl1.sort(reverse=True)\r\nl2=[]\r\nl1.append(0)\r\nstart=l1[0]\r\ni=1\r\nwhile i<n:\r\n if l1[i]==start:\r\n l2.append(l1[i])\r\n start=l1[i+1]\r\n i+=2\r\n elif l1[i]==start-1:\r\n l2.append(l1[i])\r\n start=l1[i+1]\r\n i+=2\r\n else:\r\n start=l1[i]\r\n i+=1\r\narea=0\r\ni=0\r\nl2.append(0)\r\nwhile i<len(l2)-1:\r\n area+=l2[i]*l2[i+1]\r\n i+=2\r\nprint(area)\r\n", "from collections import Counter\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\nl = sorted([int(x) for x in input().split()])\r\n\r\na = []\r\ni = n-1\r\nwhile i-1 >= 0:\r\n if l[i]-l[i-1] <= 1:\r\n a.append(l[i-1])\r\n i -= 2\r\n else:\r\n i -= 1\r\n\r\nans = 0\r\ni = 0\r\nwhile i+1 < len(a):\r\n ans += a[i]*a[i+1]\r\n i += 2\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort(reverse=True)\r\np,i,ans=[],1,0\r\nwhile i<n:\r\n if a[i-1]-a[i]==1:\r\n p.append(a[i])\r\n i+=1 \r\n elif a[i-1]==a[i]:\r\n p.append(a[i])\r\n i+=1 \r\n i+=1 \r\nfor i in range(1,len(p),2):\r\n ans+=p[i]*p[i-1]\r\nprint(ans)", "n = int(input())\r\nmaxn = 10**6 + 2\r\ncnt = [0] * maxn\r\nfor x in map(int, input().split()):\r\n cnt[x] += 1\r\nansv = []\r\nfor i in range(maxn - 2, 1, -1):\r\n ansv += [i] * ((cnt[i] + (cnt[i+1] & 1)) >> 1)\r\n if cnt[i] > 0:\r\n cnt[i] += cnt[i+1] & 1\r\nans = 0\r\nfor i in range(1, len(ansv), 2):\r\n ans += ansv[i] * ansv[i-1]\r\nprint(ans)", "arr = [0] * (10 ** 6 + 1)\r\nn = int(input())\r\nfor i in input().split():\r\n arr[int(i)] += 1\r\ni = 10 ** 6\r\nj = i\r\nk = i\r\nc = 0\r\nwhile j > 0:\r\n if arr[j] % 2 == 1 and (arr[j] > 1 or c == 0):\r\n arr[j - 1] += 1\r\n c = 1\r\n else:\r\n c = 0\r\n j -= 1\r\nr = 0\r\nwhile i > 0 and k > 0:\r\n if arr[i] < 2:\r\n if i == k:\r\n k -= 1\r\n i -= 1\r\n elif i == k and arr[i] < 4:\r\n k -= 1\r\n elif arr[k] < 2:\r\n k -= 1\r\n else:\r\n r += i * k\r\n arr[i] -= 2\r\n arr[k] -= 2\r\nprint(r)", "if __name__ == '__main__':\r\n input()\r\n data = sorted(map(int, input().split()), key=lambda x: -x)\r\n\r\n if len(data) < 4:\r\n print(0)\r\n exit(0)\r\n\r\n total = 0\r\n i = 0\r\n\r\n while i < len(data) - 3:\r\n if abs(data[i] - data[i + 1]) > 1:\r\n i += 1\r\n continue\r\n\r\n success = False\r\n for j in range(i + 2, len(data) - 1):\r\n if abs(data[j] - data[j + 1]) > 1:\r\n continue\r\n\r\n success = True\r\n total += min(data[i], data[i + 1]) * min(data[j], data[j + 1])\r\n i = j + 2\r\n break\r\n\r\n if not success:\r\n i += 1\r\n\r\n print(total)\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\nfrom typing import List\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncs = collections.Counter(arr)\r\nh = []\r\nfor k in cs.keys():\r\n heapq.heappush(h, -k)\r\n\r\nans = 0\r\nb = -1\r\n\r\n\r\ndef add(nb):\r\n global ans, b\r\n p = cs[nb]\r\n while p > 1:\r\n if b > 0:\r\n ans += b*nb\r\n b = -1\r\n else:\r\n b = nb\r\n p -= 2\r\n if p == 1:\r\n if nb-1 in cs:\r\n cs[nb-1] += 1\r\n\r\n\r\nwhile h:\r\n hk = heapq.heappop(h)\r\n add(-hk)\r\nprint(ans)\r\n", "n = int(input())\n\nrects = [int(s) for s in input().split()]\nrects.sort()\n\nsumsquare = 0\nstash = []\n\ni = len(rects) - 1\n\nwhile i > 0:\n\tif rects[i] - rects[i-1] == 1 or rects[i] == rects[i-1]:\n\t\tif len(stash) == 2:\n\t\t\tsumsquare += stash[0]*stash[1]\n\t\t\tstash.clear()\n\n\t\tstash.append(rects[i-1])\n\t\trects.pop()\n\t\trects.pop()\n\n\t\ti -= 2\n\telse:\n\t\ti -= 1\n\nif len(stash) == 2:\n\tsumsquare += stash[0]*stash[1]\n\tstash.clear()\n\nprint(sumsquare)\n\n\n\t\t\t\n\n\n\n\n\n\n", "n = int(input())\nls = list(map(int, input().split()))\nls.sort(reverse=True)\n\narea = 0\npairs = []\ni = 0\nwhile i < len(ls)-1:\n if (ls[i] - ls[i+1]) > 1:\n i += 1\n else:\n pairs.append(ls[i+1])\n i += 2\n if len(pairs) == 2:\n area += pairs.pop() * pairs.pop()\nprint(area)\n", "from sys import stdin\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n num = list(map(int, stdin.readline().split()))\r\n\r\ndef solve(n, num):\r\n nmax = 1000003\r\n cur = nmax * [0]\r\n pt = []\r\n res = 0\r\n \r\n for x in range(len(num)):\r\n cur[num[x]] += 1\r\n \r\n for i in range(nmax - 3, 1, -1):\r\n for j in range((((cur[i + 1] % 2) + cur[i]) // 2)):\r\n pt.append(i)\r\n if cur[i] > 0:\r\n cur[i] += cur[i + 1] % 2\r\n \r\n for i in range(1, len(pt), 2):\r\n res += pt[i - 1] * pt[i]\r\n return res\r\n \r\nif __name__ == '__main__':\r\n print(solve(n, num))", "import math,sys\nfrom sys import stdin, stdout\nfrom collections import Counter, defaultdict, deque\ninput = stdin.readline\nI = lambda:int(input())\nli = lambda:list(map(int,input().split()))\n\ndef case():\n n=I()\n a=li()\n a.sort(reverse=True)\n ans=0\n i=0\n l=0\n b=0\n while(i<n-1):\n if(a[i]==a[i+1]):\n if(not l):\n l=a[i]\n else:\n ans+=l*a[i]\n l=0\n i+=2\n else:\n if(a[i]==a[i+1]+1):\n a[i]-=1\n else:\n i+=1\n print(ans)\n\n\nfor _ in range(1):\n case()", "n = int(input())\r\nlis = sorted(map(int,input().split()))\r\nfi=se=ans=0\r\ni=n-1\r\nwhile i>0:\r\n if fi==0:\r\n if lis[i]==lis[i-1]:\r\n fi=lis[i]\r\n i-=1\r\n elif lis[i]==lis[i-1]+1:\r\n fi=lis[i-1]\r\n i-=1\r\n elif se==0:\r\n if lis[i]==lis[i-1]:\r\n se=lis[i]\r\n i-=1\r\n elif lis[i]==lis[i-1]+1:\r\n se=lis[i-1]\r\n i-=1\r\n i-=1 \r\n if fi>0 and se>0:\r\n ans+=fi*se\r\n# print(fi,se)\r\n fi=0\r\n se=0\r\nprint(ans) \r\n\r\n", "n = int(input())\na = sorted((int(x) for x in input().split()))\np = []\nans = 0\nwhile n >= 2:\n\tif a[n - 1] - a[n - 2] <= 1:\n\t\tp.append(a[n - 2])\n\t\tn -= 2\n\telse:\n\t\tn -= 1\nn = len(p)\nfor x, y in zip(p[::2], p[1::2]):\n\tans += x * y\nprint(ans)\n", "from collections import Counter\r\n\r\ninput()\r\nlengths = [int(i) for i in input().split()]\r\ncnt = Counter(lengths)\r\nlengths.sort(reverse=True)\r\ntotal_square = 0\r\n\r\nfor le in lengths:\r\n if cnt[le] % 2 != 0:\r\n if cnt[le-1] > 0:\r\n cnt[le-1] += 1\r\n cnt[le] -= 1\r\n\r\nfor le in lengths:\r\n if cnt[le] >= 4:\r\n cnt[le] -= 4\r\n total_square += le ** 2\r\n elif cnt[le] < 4 and cnt[le] > 0:\r\n min_le = le - 1\r\n while min_le > 0 and cnt[min_le] < 2:\r\n min_le -= 1\r\n cnt[le] -= 2\r\n cnt[min_le] -= 2\r\n total_square += le * min_le\r\n\r\nprint(total_square)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort(reverse=True)\r\n\r\ni = 0\r\nans = []\r\nwhile(i<n):\r\n\tif i<n-1 and l[i]-l[i+1]<=1:\r\n\t\tans.append(l[i+1])\r\n\t\ti+=1\r\n\ti+=1\r\n\r\n# print(ans)\r\ntem = len(ans)\r\nif tem<=1:\r\n\tprint(0)\r\nelse:\r\n\ti = 0\r\n\ts = 0\r\n\twhile(i<tem-1):\r\n\t\ts+=(ans[i]*ans[i+1])\r\n\t\ti+=2\r\n\tprint(s)\t", "__author__ = 'Dmitry Petrushin'\r\n__version__ = '3.4'\r\n\r\nfrom sys import stdin as inp\r\n\r\n\r\ndef rectangles(lengths):\r\n n_max = 10 ** 6 + 2\r\n sticks = [0 for _ in range(n_max)]\r\n tmp = list()\r\n for length in lengths:\r\n sticks[length] += 1\r\n for i in range(n_max - 2, 1, -1):\r\n for _ in range((sticks[i + 1] % 2 + sticks[i]) // 2):\r\n tmp.append(i)\r\n if sticks[i] > 0:\r\n sticks[i] += sticks[i + 1] % 2\r\n result = 0\r\n for i in range(1, len(tmp), 2):\r\n result += tmp[i - 1] * tmp[i]\r\n return result\r\n\r\n\r\ndef main():\r\n N = inp.readline()\r\n lengths = list(map(int, inp.readline().split()))\r\n print(rectangles(lengths))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\n\r\nlst = []\r\nlst.extend(map(int, input().split()))\r\n\r\ntarea = 0\r\n\r\nlst.sort()\r\nlst = lst[::-1]\r\nlst.append(0)\r\n\r\ni = 0\r\nmark = 0\r\nar = []\r\nwhile i != n:\r\n if (lst[i] - lst[i+1])<=1:\r\n ar.append(lst[i+1])\r\n mark += 1\r\n i += 2\r\n else:\r\n i += 1\r\n if mark == 2:\r\n tarea = tarea + ar[0]*ar[1]\r\n ar = []\r\n mark = 0\r\n\r\nprint(tarea)\r\n \r\n \r\n" ]

[ "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=sum(a)\r\n\r\ns1=0\r\nai=[0]*500001\r\nfor i in range(n-1):\r\n s1+=a[i]\r\n if s1==s/3:\r\n ai[i]=1\r\n\r\ns2=0\r\naj=[]\r\nfor j in range(n-1):\r\n s2+=a[n-j-1]\r\n if s2==s/3:\r\n aj.append(n-j-2)\r\n\r\nfor i in range(1,n):\r\n ai[i]+=ai[i-1]\r\nnum=0\r\nfor j in range(len(aj)):\r\n num+=ai[aj[j]-1]\r\n\r\nprint(num)\r\n\r\n\r\n", "# from math import sqrt\r\n# from queue import Queue\r\n# from math import inf\r\n# from binarytree import Node\r\n# from collections import deque\r\nfrom bisect import bisect_left\r\n# from collections import Counter\r\n# n,k,m=map(int,input().split())\r\n# from copy import copy \r\n# for _ in range(int(input())):\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nS=sum(l)\r\ns=S//3\r\nif S%3!=0:\r\n print(0)\r\nelse:\r\n prs=[]\r\n ss=[0]\r\n su=0\r\n for i in range(n):\r\n su+=l[i]\r\n prs.append(su)\r\n ss.append(ss[-1]+l[n-1-i])\r\n ss.reverse()\r\n ss.pop()\r\n pri=[]\r\n i=0\r\n for i in range(n):\r\n if prs[i]==s:\r\n pri.append(i)\r\n ans=0\r\n # count=0\r\n for j in range(n-1,-1,-1):\r\n if ss[j]==s:\r\n # count+=1\r\n a=bisect_left(pri,j-1)\r\n # print(a,pri)\r\n ans+=a\r\n if a==0:\r\n break\r\n print(ans)\r\n", "n=int(input())\r\narray=list(map(int,input().split()))\r\ns=sum(array)\r\nif s%3 != 0 or len(array)<3:\r\n print(0)\r\nelse:\r\n t=s/3\r\n sum1=0;sum2=0;ans=0\r\n a=[0]*n\r\n b=[0]*n\r\n for j in range(n-1,0,-1):\r\n sum2+=array[j]\r\n if sum2 == t:\r\n a[j]=1\r\n if j == n-1:\r\n b[j]=a[j]\r\n else:\r\n b[j]=b[j+1]+a[j]\r\n for i in range(n-2):\r\n sum1+=array[i]\r\n if sum1 == t:\r\n ans+=b[i+2]\r\n print(ans)", "def solve():\r\n n = int(input().strip())\r\n a = list(map(int, input().strip().split()))\r\n total_sum = sum(a)\r\n if total_sum % 3 != 0:\r\n print(0)\r\n else:\r\n required_sum = total_sum // 3\r\n current_sum = 0\r\n count = [0]*n\r\n for i in range(n-1, -1, -1):\r\n current_sum += a[i]\r\n if current_sum == required_sum:\r\n count[i] = 1\r\n for i in range(n-2, -1, -1):\r\n count[i] += count[i+1]\r\n current_sum = 0\r\n ways = 0\r\n for i in range(n-2):\r\n current_sum += a[i]\r\n if current_sum == required_sum:\r\n ways += count[i+2]\r\n print(ways)\r\n\r\nsolve()\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nS=sum(lst)\r\nanswer=0\r\n \r\nif S%3!=0 or n<3:\r\n print(0)\r\n \r\nelse:\r\n a=S//3\r\n x=0\r\n y=0\r\n for i in range(n-1):\r\n x+=lst[i]\r\n if x==2*a:\r\n answer+=y\r\n if x==a:\r\n y+=1\r\n print(answer)", "l=int(input())\r\na=[int(v) for v in input().split(' ')]\r\nc=0;m=0;C=0;s=sum(a)\r\nfor i in range(l-1):\r\n c+=a[i]\r\n if c==2*s/3:\r\n C+=m\r\n if c==s/3:\r\n m+=1\r\nprint(C)", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(n):\r\n\tif i>0:\r\n\t\ta[i]+=a[i-1]\r\ncnt=0\r\nans=0\r\nfor i in range(n-1):\r\n\tif a[i]*3==a[n-1]*2:\r\n\t\tans+=cnt\r\n\tif a[i]*3==a[n-1]:\r\n\t\tcnt+=1\r\nprint(ans)", "n = int(input())\r\nans = 0\r\nli = list(map(int, input().split()))\r\ntotal = sum(li)\r\n\r\nadd = 0\r\ns1 = total // 3\r\ns2 = s1 + s1\r\nps = 0\r\nif total % 3 == 0:\r\n for i in range(n - 1):\r\n ps += li[i]\r\n if ps == s2:\r\n ans += add\r\n if ps == s1:\r\n add += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ntotal_sum = sum(a)\r\n\r\nif total_sum % 3 != 0:\r\n print(0)\r\nelse:\r\n one_third = total_sum // 3\r\n two_thirds = 2 * one_third\r\n\r\n prefix_sum = 0\r\n count = 0\r\n ways = 0\r\n\r\n for i in range(n - 1):\r\n prefix_sum += a[i]\r\n\r\n if prefix_sum == two_thirds:\r\n ways += count\r\n if prefix_sum == one_third:\r\n count += 1\r\n\r\n print(ways)\r\n", "#466C三分切割\r\n#参考代码的确十分巧妙，如何遍历出所有情况？\r\nn=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist2=[list1[0]]\r\nsum=0\r\nfor i in range(1,n):\r\n list2.append(list2[i-1]+list1[i])\r\n\r\nways=0\r\nt=0#新增变量t是这个代码最巧妙的地方。\r\na=list2[n-1]\r\nif a%3==0:\r\n for i in list2[0:n-1]:#这里是因为最后一个变量已经没有必要再列出了\r\n if i==2*a/3:\r\n ways+=t\r\n if i==a/3:\r\n t+=1\r\n\r\nprint(ways)\r\n \r\n\r\n", "from bisect import bisect_right as br\r\nn = int(input())\r\n*array, = map(int, input().split())\r\ns = sum(array)\r\nl, r = 0, n - 1\r\nansL = []\r\nansR = []\r\nans = sumL = sumR = 0\r\nwhile l < n:\r\n sumL += array[l]\r\n sumR += array[r]\r\n if sumL == s / 3: ansL.append(l)\r\n if sumR == s / 3: ansR.append(r)\r\n l += 1; r -= 1\r\nfor i in ansR:\r\n ans += br(ansL, i - 2)\r\nprint(ans)", "def find_13(nums, sum_13, nu):\r\n positions = []\r\n sum_p = 0\r\n\r\n for p in range(nu):\r\n sum_p += nums[p]\r\n if sum_p == sum_13:\r\n positions.append(p+1)\r\n\r\n return positions\r\n\r\n\r\nn = int(input())\r\nnumbers = [int(i) for i in input().split()]\r\n\r\nsum_numbers = sum(numbers)/3\r\n\r\nif not sum_numbers//1 == sum_numbers:\r\n print(0)\r\nelse:\r\n answer = 0\r\n sum_numbers = int(sum_numbers)\r\n\r\n left_positions = find_13(numbers, sum_numbers, n)\r\n right_positions = find_13(numbers[::-1], sum_numbers, n)\r\n\r\n l1 = len(left_positions)\r\n l2 = len(right_positions)\r\n\r\n rp = l2 - 1\r\n for lp in range(l1):\r\n while right_positions[rp] + left_positions[lp] >= n:\r\n if not rp == -1:\r\n rp -= 1\r\n else:\r\n break\r\n answer += rp + 1\r\n\r\n print(answer)\r\n", "n = int(input())\r\narray = [int(x) for x in input().split()]\r\nsum1 = [0]*n\r\nsum1[0] = array[0]\r\nfor i in range(1, n):\r\n sum1[i] = sum1[i-1] + array[i]\r\nif sum1[n-1]%3 != 0:\r\n print(0)\r\nelse:\r\n a = sum1[n-1] // 3\r\n dp = [[0]*(n+1) for _ in range(2)]\r\n for i in range(n-1):\r\n dp[0][i + 1], dp[1][i + 1] = dp[0][i], dp[1][i]\r\n if sum1[i] == a:\r\n dp[0][i+1] += 1\r\n if sum1[i] == 2*a:\r\n dp[1][i+1] += dp[0][i]\r\n dp[0][n], dp[1][n] = dp[0][n-1], dp[1][n-1]\r\n print(dp[1][n])", "n=int(input())\r\nl=list(map(int,input().split()))\r\npre=[l[0]]\r\nfor i in range(1,n):\r\n\tpre.append(pre[i-1]+l[i])\r\ntot=pre[-1]\r\nif tot%3!=0:\r\n\tprint(0)\r\nelse:\r\n\tl1=[]\r\n\tl2=[]\r\n\tfor i in range(0,n):\r\n\t\tl1.append(0)\r\n\t\tl2.append(0)\r\n\tfor i in range(0,n):\r\n\t\tif pre[i]==tot/3:\r\n\t\t\tl1[i]=1\r\n\t\tif pre[i]==2*tot/3:\r\n\t\t\tl2[i]=1\r\n\t#print(l2)\r\n\tans=[l2[n-1]]\r\n\tfor i in range(n-2,-1,-1):\r\n\t\tans.append(ans[n-i-2]+l2[i])\r\n\tans.reverse()\r\n\t#print(ans)\r\n\tif tot==0:\r\n\t\tfor i in range(0,n):\r\n\t\t\tans[i]-=1\r\n\tcnt=0\r\n\tfor i in range(0,n):\r\n\t\tif pre[i]==tot/3:\r\n\t\t\tif i+1<n:\r\n\t\t\t\tcnt+=ans[i+1]\r\n\tprint(cnt)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\ntotal_sum = sum(nums)\r\n\r\n# If the total sum is not divisible by 3, there are no ways to split the array.\r\nif total_sum % 3 != 0:\r\n print(0)\r\nelse:\r\n # Calculate the target sum for each part.\r\n part_sum = total_sum // 3\r\n part_sum_twice = 2 * part_sum\r\n\r\n # Initialize counters.\r\n ans = 0\r\n prefix_sum = 0\r\n count_s = 0\r\n\r\n # Iterate over the array to count the prefix sums equal to `part_sum`.\r\n for i in range(n - 1): # We don't include the last element.\r\n prefix_sum += nums[i]\r\n if prefix_sum == part_sum_twice:\r\n ans += count_s\r\n if prefix_sum == part_sum:\r\n count_s += 1\r\n\r\n print(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nc=0;t=0;b=0\r\nif s%3==0:\r\n sl=s/3;sr=sl*2\r\n for k in range(n-1):\r\n t+=l[k]\r\n if t==sr:\r\n c+=b\r\n if t==sl:\r\n b+=1\r\nprint(c)", "d=int(input())\r\nli=[int(_) for _ in input().split()]\r\nans,k,t,b=0,sum(li),0,0\r\nif k%3 !=0 or d <3:\r\n print(0)\r\nelse:\r\n m,n=k/3,2*k/3\r\n for i in range(d-1):\r\n t+=li[i]\r\n if t==n:\r\n ans+=b\r\n if t==m:\r\n b+=1\r\n print(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\noneThird = sum(a) / 3\r\n\r\namount = count = 0\r\noneThirdList = []\r\nfor i in range(n - 1):\r\n amount += a[i]\r\n oneThirdList.append(count)\r\n if amount == oneThird:\r\n count += 1\r\n\r\ncur_sum = ans = 0\r\nfor i in range(n - 1, 0, -1):\r\n cur_sum += a[i]\r\n if cur_sum == oneThird:\r\n ans += oneThirdList[i - 1]\r\n\r\nprint(ans)", "from collections import Counter\r\nfrom sys import stdin\r\ndef solve():\r\n n = int(stdin.readline())\r\n A = [int(x) for x in stdin.readline().split()]\r\n total = sum(A)\r\n if total % 3:\r\n print(0)\r\n return\r\n t = total // 3\r\n count = Counter()\r\n acc = 0\r\n res = 0\r\n for i, a in enumerate(A):\r\n acc += a\r\n if i != n - 1 and acc == t * 2:\r\n res += count[t]\r\n if acc == t:\r\n count[t] += 1\r\n print(res)\r\nsolve()# 1698340256.459766", "n = int(input())\r\n\r\narr = [0]*n\r\ntemp = 0\r\ninp = input().split()\r\nfirst = 0\r\nsecond = 0\r\nfor i in range(n):\r\n arr[i] = int(inp[i])\r\n temp += arr[i]\r\n arr[i] = temp\r\n\r\nif len(arr) > 2 and temp % 3 == 0:\r\n for i in arr[:-1]:\r\n if i == 2*temp/3:\r\n second += first\r\n if i == temp/3:\r\n first += 1\r\n print(second)\r\nelif len(arr) <= 2 or temp % 3 == 0:\r\n print(0)\r\nelse:\r\n print(0)", "n=int(input())\r\narray=list(map(int,input().split()))\r\nif n<=2:\r\n print(0)\r\nelse:\r\n s=sum(array)/3\r\n ss = 2 *s\r\n ans= j = k = 0\r\n for i in range(n - 1):\r\n j += array[i]\r\n if j == ss:\r\n ans += k\r\n if j == s:\r\n k += 1\r\n print(ans)", "from bisect import bisect_right\r\n\r\n# ⠀⠀⠀⠀⠀⠀⠀⠀⠀⢠⣿⣶⣄⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⠀⢀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣶⣦⣄⣀⡀⣠⣾⡇⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⠀⠀⣴⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇⠀⠀⠀⠀\r\n# ⠀⠀⠀⠀⢀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⢿⣿⣿⡇⠀⠀⠀⠀\r\n# ⠀⣶⣿⣦⣜⣿⣿⣿⡟⠻⣿⣿⣿⣿⣿⣿⣿⡿⢿⡏⣴⣺⣦⣙⣿⣷⣄⠀⠀⠀\r\n# ⠀⣯⡇⣻⣿⣿⣿⣿⣷⣾⣿⣬⣥⣭⣽⣿⣿⣧⣼⡇⣯⣇⣹⣿⣿⣿⣿⣧⠀⠀\r\n# ⠀⠹⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠸⣿⣿⣿⣿⣿⣿⣿⣷⠀\r\n\r\nn = int(input())\r\nif n <3: print(0); exit(0)\r\nA = list(map(int,input().strip().split()))\r\npre = [0]\r\nfor i in range(n): pre.append(pre[-1] + A[i])\r\n\r\nif pre[-1]%3: print(0);exit(0)\r\n\r\nk = pre[-1]//3\r\n\r\nans = 0\r\n\r\nleftends = []\r\nrightends = []\r\nfor i in range(1,n):\r\n if pre[i] == k:\r\n leftends.append(i)\r\n if pre[i] == 2*k:\r\n rightends.append(i)\r\n \r\n# print(leftends,rightends)\r\nfor r in rightends:\r\n ans += bisect_right(leftends,r-1)\r\nprint(ans)", "#23n2200017708\nn = int(input())\na = list(map(int, input().split()))\nsum = [0] * (n + 1)\nfor i in range(1, n + 1):\n sum[i] = sum[i - 1] + a[i - 1]\n\nfg = sum[n] // 3\nans = 0\ncnt = 0\nif sum[n] % 3 != 0:\n print(0)\nelse:\n for i in range(1, n):\n if fg * 2 == sum[i]:\n ans += cnt\n if fg == sum[i]:\n cnt += 1\n print(ans)", "import sys\r\ninput=sys.stdin.readline\r\nfrom itertools import permutations, accumulate\r\nfrom collections import defaultdict as dd\r\nfrom collections import deque\r\nfrom bisect import bisect_left,bisect_right\r\nfrom math import lcm,gcd,sqrt,ceil,comb\r\nfrom heapq import heappop,heappush,heapify\r\ntoBin=lambda x:bin(x).replace(\"0b\",\"\")\r\ninf=float(\"inf\");DIRS=[[1,0],[-1,0],[0,1],[0,-1]];CHARS=\"abcdefghijklmnopqrstuvwxyz\"\r\nMOD=10**9+7;N=300010;fac=[1]*N;invfac=[1]*N #Fill out N to calculate combinations\r\nfor i in range(2,N):fac[i]=fac[i-1]*i%MOD\r\ninvfac[N-1]=pow(fac[N-1],MOD-2,MOD)\r\nfor i in range(N-1)[::-1]:invfac[i]=invfac[i+1]*(i+1)%MOD\r\ndef c(i,j):return 0 if i<j else fac[i]*invfac[j]*invfac[i-j]\r\n\r\ndef solve():\r\n n=int(input());A=list(map(int,input().split()));x=y=0;s=sum(A)\r\n if s%3!=0:print(0)\r\n else:\r\n res=0;R=[0]*(n+1);ps=0\r\n for i in range(n-1,1,-1):\r\n ps+=A[i];R[i]=R[i+1]\r\n if ps==(s//3):R[i]+=1\r\n ps=0;j=0\r\n for i in range(n-2):\r\n ps+=A[i]\r\n if ps==s//3:\r\n res+=R[i+2]\r\n print(res)\r\n\r\n\r\nif __name__==\"__main__\":\r\n solve()", "def f(L):\r\n s=sum(L)\r\n n=len(L)\r\n if s%3!=0:\r\n return 0\r\n a=s//3\r\n b=2*a\r\n S=[]\r\n ans=0\r\n x=0\r\n if s!=0:\r\n for i in range(n-1):\r\n x+=L[i]\r\n if x==a:\r\n S.append(0)\r\n elif x==b:\r\n ans+=len(S)\r\n else:\r\n for i in range(n-1):\r\n x+=L[i]\r\n if x==0:\r\n S.append(0)\r\n ans+=len(S)-1\r\n return ans\r\nx=int(input())\r\nL=list(map(int,input().split()))\r\nprint(f(L))\r\n\r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n numlist = list(map(int, input().split()))\r\n sumlist = [numlist[0]]\r\n for i in range(1, n):\r\n sumlist.append(numlist[i] + sumlist[-1])\r\n\r\n totsum = sumlist.pop()\r\n if totsum % 3 != 0:\r\n print(0)\r\n return\r\n\r\n target1 = totsum // 3\r\n target2 = target1 * 2\r\n\r\n anslist = []\r\n i = 0\r\n j = 0\r\n for x in sumlist:\r\n if x == target2:\r\n j += 1\r\n if x == target1:\r\n i += 1\r\n anslist.append((i, j))\r\n # print(anslist)\r\n\r\n ans = 0\r\n for tup in anslist:\r\n # print(tup)\r\n ans += j - tup[1]\r\n\r\n print(ans)\r\n return\r\n\r\n\r\nmain()", "n = int(input())\r\nA = list (map(int, input().split()))\r\nP = [A[0]]\r\nfor i in range (1, n):\r\n\tP.append(A[i] + P[i - 1])\r\ns = sum(A)\r\nif s % 3 != 0:\r\n\tprint (0)\r\nelse:\r\n\tsk = s // 3\r\n\tss = 0\r\n\tP = [0] * n \r\n\tfor i in range (0, n):\r\n\t\tj = n - i - 1\r\n\t\tss += A[j]\r\n\t\tif ss == sk:\r\n\t\t\tP[j] = 1\r\n\tfor i in range (0, n - 1):\r\n\t\tj = n - i - 2\r\n\t\tP[j] += P[j + 1]\r\n\tc = 0\r\n\tss = 0\r\n\tfor i in range (0, n - 2):\r\n\t\tss += A[i]\r\n\t\tif ss == sk:\r\n\t\t\tc += P[i + 2]\r\n\tprint (c)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nd = dict()\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns, s0, c = 0, 0, 0\r\nq, k = [], []\r\nfor i in w:\r\n s += i\r\n q.append(s)\r\nfor i in w[::-1]:\r\n s0 += i\r\n k.append(s0)\r\nk = k[::-1]\r\nd[w[0]] = 1\r\nfor i in range(1, n-1):\r\n x, y = k[i+1], q[i]\r\n if 2*x == y:\r\n if x in d:\r\n c += d[x]\r\n if y not in d:\r\n d[y] = 1\r\n else:\r\n d[y] += 1\r\nprint(c)", "def BS(A, target, lenght):\r\n pos_start = 0\r\n pos_end = lenght-1\r\n \r\n while pos_start < pos_end:\r\n mid = (pos_start + pos_end)//2\r\n \r\n if A[mid] > target:\r\n pos_end = mid\r\n else:\r\n pos_start = mid + 1 \r\n \r\n if A[pos_start] > target:\r\n return pos_start\r\n else:\r\n return lenght\r\n\r\nn_nums = int(input())\r\nvalues = input().split()\r\nsums_1 = []\r\naccumulated = 0\r\n\r\nfor i in range(n_nums):\r\n accumulated += int(values[i])\r\n sums_1.append(accumulated)\r\n\r\nsums_2 = []\r\naccumulated = 0\r\n\r\nfor i in range(n_nums):\r\n accumulated += int(values[n_nums - 1 -i])\r\n sums_2.append(accumulated)\r\n \r\n \r\nif sums_1[-1]%3 != 0:\r\n print(0)\r\n\r\nelse:\r\n goal = sums_1[-1]//3\r\n \r\n positions_1 = []\r\n positions_2 = []\r\n \r\n for i in range(n_nums):\r\n if sums_1[i] == goal:\r\n positions_1.append(i)\r\n if sums_2[n_nums - 1 - i] == goal:\r\n positions_2.append(i)\r\n \r\n \r\n if sums_1 == [] or sums_2 == []:\r\n print(0)\r\n else:\r\n ways = 0\r\n lenght_2 = len(positions_2)\r\n \r\n for pos in positions_1:\r\n index_first_greater = BS(positions_2, pos + 1, lenght_2)\r\n ways += lenght_2 - index_first_greater\r\n \r\n print(ways)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Nov 10 11:07:57 2023\r\n\r\n@author: ghp\r\n\"\"\"\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nnum=sum(arr)\r\nans=0\r\nif num%3==0:\r\n check1=num//3\r\n check2=2*check1\r\n k=0\r\n \r\n t=0\r\n \r\n for i in range(n-1):\r\n k+=arr[i]\r\n if k==check2:\r\n ans+=t\r\n if k==check1:\r\n t+=1\r\n \r\n \r\nprint(ans)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 8 14:03:30 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\nn=int(input())\r\nnumbers=[int(i) for i in input().split()]\r\n \r\nm=sum(numbers)\r\nfinals=0\r\nif m%3==0:\r\n a=m/3\r\n b=m-a\r\n midway=0\r\n temp=0\r\n for i in range(n-1):\r\n temp+=numbers[i]\r\n if temp==b:\r\n finals+=midway\r\n if temp==a:\r\n midway+=1\r\n \r\nprint(finals)", "'''程文奇 2100015898'''\r\nn=int(input())\r\ncount1=0\r\ncount2=0\r\nnumberlist=list(map(int,input().split()))\r\ns=sum(numberlist)\r\nv1=0\r\nfor i in range(n-1):\r\n v1+=numberlist[i]\r\n if 3*v1==2*s:\r\n count2+=count1\r\n if 3*v1==s:\r\n count1+=1\r\nprint(count2)\r\n", "n=int(input())\r\nans=0\r\nnum={i:int(x)for i,x in zip(range(n),input().split())}\r\nx=sum(num.values())\r\nif x%3 != 0:\r\n print(0)\r\nelse:\r\n ave=x//3\r\n le=0\r\n j=0\r\n r=0\r\n for a in range(n-1):\r\n le+=num[a]\r\n if le == 2*ave:\r\n j+=1\r\n if le == ave:\r\n ans-=j\r\n r+=1\r\n print(ans+r*j)", "n=int(input())\r\nnum=[int(i) for i in input().split()]\r\ntmp=0\r\nsumm=sum(num)\r\nif summ%3!=0:\r\n print(0)\r\nelse:\r\n summ/=3\r\n r=[];l=[]\r\n for i in range(n):\r\n tmp+=num[i]\r\n if tmp==summ:\r\n l.append(i)\r\n tmp=0\r\n for i in range(n-1,-1,-1):\r\n tmp+=num[i]\r\n if tmp==summ:\r\n r.append(i)\r\n r.sort()\r\n rl=0\r\n ans=0\r\n lens=len(r)\r\n for i in range(len(l)):\r\n for j in range(rl,lens):\r\n if r[j]>l[i]+1:\r\n ans+=lens-j\r\n rl=j\r\n break\r\n\r\n print(ans)", "def calc_sum(pref, a, l, r):\r\n return pref[r] - pref[l] + a[l]\r\n\r\ndef binpoisk(a, x):\r\n l, r = -1, len(a)\r\n while l + 1 < r:\r\n m = (l + r) // 2\r\n if a[m] > x:\r\n r = m\r\n else:\r\n l = m\r\n return r\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n pref = [a[0]]\r\n for i in range(1, n):\r\n pref.append(pref[-1] + a[i])\r\n\r\n s0 = pref[-1]\r\n if s0 % 3 != 0:\r\n print(0)\r\n else:\r\n s = s0 // 3\r\n indexes1, indexes2 = [], []\r\n for i in range(n):\r\n if pref[i] == s:\r\n indexes1.append(i)\r\n for i in range(n):\r\n if pref[i] == 2*s:\r\n indexes2.append(i)\r\n # print(*indexes1)\r\n # print(*indexes2)\r\n if len(indexes1) == 0 or len(indexes2) == 0:\r\n print(0)\r\n else:\r\n ans = 0\r\n for i in range(len(indexes1)):\r\n index = binpoisk(indexes2, indexes1[i])\r\n if index != len(indexes2):\r\n if indexes2[-1] == n-1:\r\n ans += (len(indexes2) - index - 1)\r\n else:\r\n ans += (len(indexes2) - index)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\narr=list(map(int,input().split()))\r\ns=sum(arr)\r\nif s%3!=0:\r\n print(0)\r\nelse:\r\n s1=s/3\r\n i=j=s2=0\r\n for k in range(n-1):\r\n s2+=arr[k]\r\n if s2==2*s1:\r\n j+=i\r\n if s2==s1:\r\n i+=1#i必须放在j后面处理，避免左右指针颠倒\r\n print(j)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=[l[0]]\r\nfor i in range(1,n):\r\n s.append(s[i-1]+l[i])\r\nif s[-1]==0:\r\n o=s.count(0)\r\n print(int((o-2)*(o-1)/2))\r\nelse:\r\n c1,c2=s[-1]/3,(2*s[-1])/3\r\n if c1!=int(c1):\r\n print(0)\r\n else:\r\n index1=[i for i,value in enumerate(s) if value==c1]\r\n index2=[i for i,value in enumerate(s) if value==c2]\r\n ans,w=0,len(index2)\r\n for j in index1:\r\n for k in range(len(index2)-w,w):\r\n if index2[k]<j:\r\n w-=1\r\n else:\r\n ans+=w\r\n break\r\n print(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na=[0]+a\r\nfor i in range(1,n+1):\r\n a[i]+=a[i-1]\r\nsummy=a[-1]\r\nif summy%3!=0 or n<3:print(0)\r\nelse:\r\n z=a[1:].count(2*summy//3)\r\n if summy==0:z-=1\r\n ans=0\r\n for i in range(1,n+1):\r\n if a[i]==2*summy//3:z-=1\r\n if a[i]==summy//3:ans+=max(z,0)\r\n print(ans)", "n = int(input())\r\n\r\nnums = list(map(int, input().split()))\r\ns = sum(nums)\r\nif len(nums) < 3:\r\n print(0)\r\n\r\nelif s % 3 != 0:\r\n print(0)\r\n\r\nelse:\r\n ans = 0\r\n numIMinus1, numJ = 0, 0\r\n currSum = nums[0]\r\n if currSum == s // 3:\r\n numIMinus1 += 1\r\n for ind in range(1, n - 1):\r\n currSum += nums[ind]\r\n if currSum == 2 * (s // 3):\r\n ans += numIMinus1\r\n numJ += 1\r\n if currSum == s // 3:\r\n numIMinus1 += 1\r\n print(ans)", "def solve():\r\n n = int(input().strip())\r\n a = list(map(int, input().strip().split()))\r\n\r\n total_sum = sum(a)\r\n if total_sum % 3 != 0:\r\n print(0)\r\n return\r\n \r\n target_sum = total_sum // 3\r\n prefix_sum = 0\r\n suffix_sum = [0]*n\r\n count_prefix = [0]*n\r\n\r\n for i in range(n-1, -1, -1):\r\n prefix_sum += a[i]\r\n if prefix_sum == target_sum:\r\n suffix_sum[i] = 1\r\n if i+1 < n:\r\n suffix_sum[i] += suffix_sum[i+1]\r\n \r\n prefix_sum = 0\r\n ways = 0\r\n for i in range(n-1):\r\n prefix_sum += a[i]\r\n if prefix_sum == target_sum:\r\n ways += suffix_sum[i+2] if i+2 < n else 0\r\n\r\n print(ways)\r\n\r\nsolve()\r\n", "def search(n, i, j):\r\n global right\r\n if j-i == 1:\r\n return j\r\n k = (i+j)//2\r\n if right[k] <= n+1:\r\n return search(n, k, j)\r\n else:\r\n return search(n, i, k)\r\n\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nsuml = sum(l)\r\nif suml % 3 != 0:\r\n print(0)\r\nelse:\r\n suml = suml//3\r\n count = 0\r\n left = []\r\n right = []\r\n for i in range(n):\r\n count += l[i]\r\n if count == suml:\r\n left.append(i)\r\n if count == 2*suml and i != n-1:\r\n right.append(i+1)\r\n ans = 0\r\n last = 0\r\n for a in left:\r\n if a >= right[-1]-1:\r\n break\r\n elif a <= right[last]-2:\r\n ans += len(right)-last\r\n else:\r\n last = search(a, last, len(right)-1)\r\n ans += len(right)-last\r\n print(ans)\r\n", "import math\r\ndef solve():\r\n num = int(input())\r\n arr = list(map(int, input().split()))\r\n total = sum(arr)\r\n if num < 3 or total % 3:\r\n return 0\r\n n1, n2 = total // 3, total // 3 * 2\r\n x, y = 0, 0\r\n curr = 0\r\n for n in range(num):\r\n curr += arr[n]\r\n if curr == n1:\r\n x += 1\r\n if curr == n2:\r\n y += x\r\n\r\n if x == y == 0 or (n1 == n2 and x < 3):\r\n return 0\r\n elif n1 == n2:\r\n return math.comb(x-1, 2)\r\n else: \r\n return y\r\n\r\n\r\nprint(solve())", "n=int(input())\r\nlst_raw=list(map(int,input().split()))\r\nflag=0\r\nflag_abs=0\r\nres_pre=[]\r\nres_rev=[]\r\nres_all=[]\r\nlst_sum=[]\r\nall=sum(lst_raw)\r\ny=max(lst_raw)\r\nif all%3!=0:\r\n print(0)\r\nelse:\r\n if all!=0:\r\n #前后三等分之和\r\n pre=all//3\r\n last=pre*2\r\n while True:\r\n try:\r\n #出一个数加和一次，判断等分位置并储存\r\n temp=lst_raw[flag_abs]\r\n flag+=temp\r\n if flag==pre or flag==last:\r\n flag_abs+=1\r\n if flag==pre:\r\n res_pre.append((flag_abs-1,1))\r\n res_all.append((flag_abs-1,1))\r\n if flag==last:\r\n res_rev.append((flag_abs-1,2))\r\n res_all.append((flag_abs - 1, 2))\r\n else:\r\n flag_abs+=1\r\n except:\r\n break\r\n\r\n if res_pre!=0 and res_rev!=0:\r\n res=0\r\n pre_len=len(res_pre)\r\n rev_len=len(res_rev)\r\n for tuple_ in res_all:\r\n if tuple_[1]==1:\r\n temp=rev_len\r\n res+=temp\r\n if tuple_[1]==2:\r\n rev_len-=1\r\n print(res)\r\n else:\r\n print(0)\r\n else:\r\n pre = 0\r\n last = 0\r\n while True:\r\n try:\r\n temp = lst_raw[flag_abs]\r\n flag += temp\r\n if flag == 0:\r\n res_all.append(1)\r\n flag_abs+=1\r\n else:\r\n flag_abs+=1\r\n except:\r\n break\r\n res=sum(i for i in range(len(res_all)-1))\r\n print(res)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ns=sum(lst)\r\na,b,c=0,0,0\r\nif s%3==0:\r\n r=s//3\r\n r1=s-r\r\n for i in range(n-1):\r\n c=c+lst[i]\r\n if c==r1:a+=b\r\n if c==r:b+=1\r\nprint(a)", "input()\r\nnums = list(map(int,input().split()))\r\nvalue = sum(nums)%3\r\n\r\ndef binary(target,given):\r\n \r\n i=-1\r\n j=len(given)\r\n # print(target,\" this is targett\")\r\n while i+1<j:\r\n mid=(i+j)//2\r\n if given[mid]>target:\r\n j=mid\r\n else:\r\n i=mid\r\n # print(target,j,\" ###\")\r\n if j==len(given):\r\n return -1\r\n return j\r\n\r\n\r\nif value!=0:\r\n print(0)\r\nelse:\r\n first_target = sum(nums)//3\r\n second_target = first_target*2\r\n third_target = first_target*3\r\n \r\n # prefix_sum =\r\n for i in range(1,len(nums)):\r\n nums[i] = nums[i-1] + nums[i]\r\n \r\n first=[]\r\n second=[]\r\n third=[]\r\n for i in range(len(nums)):\r\n if nums[i]==first_target:\r\n first.append(i)\r\n if nums[i]==second_target:\r\n second.append(i)\r\n if nums[i]==third_target:\r\n third.append(i)\r\n ans=0\r\n check_third=max(third)\r\n for one in first:\r\n check_second=binary(one,second)\r\n # print(check_second,\" $$$$$$$$\")\r\n if check_second!=-1:\r\n if second[-1]==check_third:\r\n ans=ans+len(second)-check_second-1\r\n else:\r\n ans=ans+len(second)-check_second\r\n # print(one,ans)\r\n # for two in second:\r\n # for three in third:\r\n # if one<two<three:\r\n # ans=ans+1\r\n # break\r\n \r\n # print(first)\r\n # print(second)\r\n # print(third)\r\n print(ans)", "import bisect\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nsubarr=[arr[0]]\r\nfor i in range(1,n):\r\n subarr.append(subarr[i-1]+arr[i])\r\nflag=0\r\nSum=sum(arr)\r\ni_s=[]\r\nj_s=[]\r\nfor i in range(1,n-1):\r\n if(subarr[i-1]==Sum/3):\r\n i_s.append(i)\r\nfor j in range(1,n-1):\r\n if(subarr[j]==Sum*2/3):\r\n j_s.append(j)\r\nfor i_index in range(len(i_s)):\r\n j_index=bisect.bisect_left(j_s,i_s[i_index])\r\n flag+=len(j_s)-j_index\r\nprint(flag)", "n=int(input())\na=tuple(map(int,input().split()))#注意数列a被给定\nc=0;m=0;C=0;s=sum(a)\nfor i in range(n-1):\n c+=a[i]\n if c==2*s/3:\n C+=m\n if c==s/3:\n m+=1\nprint(C)", "input()\r\nls = [int(i) for i in input().split()]\r\n\r\ns = sum(ls)\r\nif s % 3 != 0:\r\n print(0)\r\nelse:\r\n s //= 3\r\n prefixes = []\r\n count = 0\r\n for i in range(len(ls) - 2):\r\n count += ls[i]\r\n if count == s:\r\n prefixes.append(i)\r\n\r\n postfixes = []\r\n count = 0\r\n for i in range(1, len(ls) - 1):\r\n count += ls[-i]\r\n if count == s:\r\n postfixes.append(len(ls) - i)\r\n\r\n total = 0\r\n for prefix in prefixes:\r\n while prefix >= postfixes[-1] - 1:\r\n postfixes.pop()\r\n total += len(postfixes)\r\n\r\n print(total)\r\n", "n=int(input())\r\nt=[i for i in map(int,input().split())]\r\ns=sum(t)/3\r\nans=0\r\nl,left=0,0\r\nr,right=0,0\r\nfor i in range(n-1):\r\n l+=t[i]\r\n if l==s*2:\r\n right+=left\r\n if l==s:\r\n left+=1\r\nprint(right)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nk = sum(a) # 总和\r\nif n < 3 or k % 3 != 0: #不能的情况\r\n print(0)\r\nelse:\r\n s = 0\r\n ans = 0\r\n for i in range(1, n):\r\n a[i] += a[i - 1] # 每一个位置都是它及它前边数的和\r\n for i in range(n - 1):\r\n if a[i] * 3 == k * 2: # 找到了后1/3\r\n ans += s # 找到后1/3才算找完，才能把前1/3加到结果上\r\n if a[i] * 3 == k: # 找到了前1/3\r\n s += 1\r\n print(ans)", "n = int(input())\nnums = list(map(int,input().split()))\n\npsums = [0]\nssums = [0]\nfor num in nums:\n psums.append(psums[-1]+num)\n\nif psums[-1]%3 or psums[-1]//3 not in psums:\n print(0)\n exit()\n\nnums.reverse()\nfor num in nums:\n ssums.append(ssums[-1]+num)\n\n\npossible_left = []\npossible_right = []\n\nfor i in range(1, n+1):\n if psums[i] == psums[-1]//3:\n possible_left.append(i-1)\n if ssums[i] == psums[-1]//3:\n possible_right.append(n-i-1)\n\nif len(possible_right)==0 or len(possible_left)==0:\n print(0)\n exit()\n\n\npossible_right.reverse()\nright_pointer = 0\nans = 0\nfor val in possible_left:\n while right_pointer < len(possible_right) and val >= possible_right[right_pointer]:\n right_pointer += 1\n\n if right_pointer >= len(possible_right):\n print(ans)\n exit()\n if val < possible_right[right_pointer]:\n ans += len(possible_right) - right_pointer\n\nprint(ans)\n\n\n", "#author 沈天健 2300011417\r\nimport sys\r\ninput=sys.stdin.readline\r\nprint=sys.stdout.write\r\nn=int(input())\r\na=[0]+list(map(int,input().split()))\r\ncnt_sum_prefix=[0 for _ in range(n+1)]\r\nsumm=sum(a)\r\nif summ%3!=0:\r\n print(\"0\")\r\n exit()\r\nsumm=summ//3\r\nsumm_prefix=0\r\nsumm_suffix=0\r\nfor i in range(1,(n)+1):\r\n summ_prefix+=a[i]\r\n if summ_prefix==summ:\r\n cnt_sum_prefix[i]+=1\r\n cnt_sum_prefix[i]+=cnt_sum_prefix[i-1]\r\nans=0\r\nfor i in range(n,(3)-1,-1):\r\n summ_suffix+=a[i]\r\n if summ_suffix==summ:\r\n ans+=cnt_sum_prefix[i-2]\r\nprint(f\"{ans}\")", "#罗景轩2300012610\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nSum = sum(l)\r\nDivide1 = Sum / 3\r\nDivide2 = Divide1 * 2\r\ncount = 0\r\nanswer = 0\r\nnumber = 0\r\nfor i in range(n - 1):\r\n count += l[i]\r\n if count == Divide2:\r\n answer += number\r\n if count == Divide1:\r\n number += 1\r\n\r\nprint(answer)", "from collections import deque\r\nimport heapq\r\nfrom math import gcd, lcm\r\nimport os\r\nimport sys\r\nsys.setrecursionlimit(100100)\r\nLOCAL = True\r\ntry:\r\n open(f\"{os.path.realpath(os.path.dirname(__file__))}/../generator.py\")\r\nexcept:\r\n LOCAL = False\r\n\r\nMOD = 10 ** 9 + 7\r\n# MOD = 998244353\r\n\r\nINF = 10 ** 100\r\ndef inv(n):\r\n return pow(n % MOD, MOD - 2, MOD)\r\nfib_mem = [0, 1]\r\ndef fib(n, cache=True):\r\n if not cache:\r\n a, b = 0, 1\r\n for _ in range(n):\r\n a, b = b % MOD, (a + b) % MOD\r\n return a\r\n else:\r\n while len(fib_mem) < n + 1:\r\n fib_mem.append((fib_mem[-1] + fib_mem[-2]) % MOD)\r\n return fib_mem[n]\r\nfac_mem = [1]\r\ndef fac(n, cache=True):\r\n if not cache:\r\n r = 1\r\n for i in range(1, n + 1):\r\n r = (r * i) % MOD\r\n return r\r\n else:\r\n while len(fac_mem) < n + 1:\r\n fac_mem.append(fac_mem[-1] * len(fac_mem) % MOD)\r\n return fac_mem[n]\r\ndef perm(n, k, cache=True):\r\n return fac(n, cache=cache) * inv(fac(k, cache=cache)) % MOD\r\ndef comb(n, k, cache=True):\r\n return fac(n, cache=cache) * inv(fac(k, cache=cache) * fac(n - k, cache=cache)) % MOD\r\ndef comb_row(n):\r\n yield 1\r\n r = 1\r\n for k in range(1, n + 1):\r\n r = r * (n + 1 - k) * inv(k) % MOD\r\n yield r\r\ndef prod(l):\r\n r = 1\r\n for i in l:\r\n r *= i\r\n return r\r\ndef is_prime(n):\r\n if n <= 3:\r\n return n >= 2\r\n if n % 2 == 0:\r\n return False\r\n if n % 3 == 0:\r\n return False\r\n d = 5\r\n while d * d <= n:\r\n if n % d == 0:\r\n return False\r\n d += (9 - d % 6) >> 1\r\n return True\r\ndef factor(n):\r\n p = []\r\n while n % 2 == 0:\r\n p.append(2)\r\n n >>= 1\r\n while n % 3 == 0:\r\n p.append(3)\r\n n //= 3\r\n d = 5\r\n while d * d <= n:\r\n while n % d == 0:\r\n n //= d\r\n p.append(d)\r\n d += (9 - d % 6) // 2\r\n if n > 1:\r\n p.append(n)\r\n return p\r\ndef count(l):\r\n r = {}\r\n for i in l:\r\n r[i] = r.get(i, 0) + 1\r\n return r\r\ndef first_such(pred, a=0, b=None):\r\n if b == None:\r\n b = max(1, a)\r\n while not pred(b):\r\n b *= 2\r\n while a < b:\r\n mid = (a + b) // 2\r\n if pred(mid):\r\n b = mid\r\n else:\r\n a = mid + 1\r\n if a > b:\r\n return None\r\n return a\r\ndef last_such(pred, a=0, b=None):\r\n if b == None:\r\n b = max(1, a)\r\n while not pred(b):\r\n b *= 2\r\n while a < b:\r\n mid = (a + b + 1) // 2\r\n if pred(mid):\r\n b = mid - 1\r\n else:\r\n a = mid\r\n if a > b:\r\n return None\r\n return a\r\ndef halt_and_catch_fire():\r\n [*range(10 ** 18)]\r\ndef ints():\r\n return [int(j) for j in input().split()]\r\ndef chars():\r\n return list(input())\r\ndef deb(*l, **kwargs):\r\n if LOCAL:\r\n print(\"\\033[2m\", end=\"\")\r\n print(*l, **kwargs)\r\n print(\"\\033[0m\", end=\"\")\r\ndef ans(*l, **kwargs):\r\n if LOCAL:\r\n print(\"\\033[32m\", end=\"\")\r\n if l and type(l[0]) == bool:\r\n print([\"NO\", \"YES\"][l[0]], **kwargs)\r\n else:\r\n print(*l, **kwargs)\r\n if LOCAL:\r\n print(\"\\033[0m\", end=\"\")\r\n\r\n#####\r\n\r\nn, = ints()\r\na = ints()\r\n\r\ns = sum(a)\r\nif s % 3 > 0:\r\n ans(0)\r\n exit()\r\n\r\np = s // 3\r\nc = 0\r\ns = 0\r\nr = 0\r\nfor i in range(n):\r\n s += a[i]\r\n if s == p << 1 and i < n - 1:\r\n r += c\r\n if s == p:\r\n c += 1\r\n\r\nans(r)\r\n\r\n\"\"\"\r\n6\r\n0 0 0 0 0 0\r\n\r\n\"\"\"", "# LUOGU_RID: 133814012\ninput();a=list(map(int,input().split()));b=sum(a);c=d=0;f=[]\r\nif b%3:print(0)\r\nelif b:\r\n for i in a:\r\n c+=i\r\n if c==b//3:f.append(0)\r\n if c==2*b//3:f.append(1);d+=1\r\n for i in f:\r\n if i:d-=1\r\n else:c+=d\r\n print(c-b)\r\nelse:\r\n for i in a+[1]:\r\n c+=i\r\n if c==0:d+=1\r\n print((d-1)*(d-2)//2)\r\n", "'''\r\n2300015897\r\n吴杰稀\r\n光华管理学院\r\n'''\r\n#参考Huang Yuansen\r\ns = int(input())\r\nnum_list = list(map(int,input().split()))\r\n\r\nif sum(num_list) % 3 != 0:\r\n print(0)\r\nelse:\r\n solutions = 0\r\n t = sum(num_list) // 3\r\n l_points = []\r\n l_sum,r_sum = 0,0\r\n for i in range(s):\r\n l_sum += num_list[i]\r\n if l_sum == t:\r\n l_points.append(i)\r\n #运用dp数组，省去判断r和l大小关系的时间，用打表来减少时间\r\n dp = [0] * s\r\n for j in range(-1,- s - 1,-1):\r\n r_sum += num_list[j]\r\n if r_sum == t:\r\n dp[j] += 1\r\n\r\n for i in range(-2,- s - 1,-1):\r\n dp[i] += dp[i + 1]\r\n\r\n for _ in l_points:\r\n if _ < s - 2:\r\n solutions += dp[_ + 2]\r\n print(solutions)", "N = 500001\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndp = [0] * N\r\nans = 0\r\nsum = 0\r\n\r\nfor i in range(n):\r\n sum += a[i]\r\n\r\nif sum % 3 != 0:\r\n print(0)\r\n exit(0)\r\n\r\nsuf = 0\r\npre = 0\r\n\r\nfor i in range(n - 1, -1, -1):\r\n suf += a[i]\r\n if i < n - 1:\r\n dp[i] = dp[i + 1]\r\n else:\r\n dp[i] = 0\r\n if suf == sum // 3:\r\n dp[i] += 1\r\n\r\nfor i in range(n - 2):\r\n pre += a[i]\r\n if pre == sum // 3:\r\n ans += dp[i + 2]\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nA = list(map(int,input().split()))\r\ndef main():\r\n B = []\r\n s = 0\r\n all = sum(A)\r\n if all%3!=0:\r\n print(0)\r\n return\r\n L = [all // 3, (all // 3) * 2, all]\r\n for i in range(n):\r\n s+=A[i]\r\n if s in L:\r\n B.append(L.index(s))\r\n if all == 0:\r\n print((B.count(0)-1)*(B.count(0)-2)//2)\r\n return\r\n cnt = 0\r\n zong=0\r\n for i in range(len(B)):\r\n if B[i]==0:\r\n cnt+=1\r\n if B[i]==1:\r\n zong+=cnt\r\n print(zong)\r\n return\r\nmain()", "for i in range(1):\r\n n= int(input())\r\n l = [int(i) for i in input().split()]\r\n t = [l[0]]\r\n if n==1:\r\n print(0)\r\n break\r\n r = 0\r\n for i in range(1,n):\r\n t.append(t[-1]+l[i])\r\n if t[-1]!=3*(t[-1]//3):\r\n print(0)\r\n break\r\n c=0\r\n for i in t[:-1]:\r\n if i==2*t[-1]//3:\r\n r+=c\r\n if i==t[-1]//3:\r\n c+=1\r\n print(r)\r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ns = sum(a)\r\n\r\nif s%3 != 0:\r\n print(0)\r\nelse:\r\n s = s//3\r\n \r\n ss = 0\r\n cnt = [0]*1000010\r\n\r\n for i in range(n-1,-1,-1):\r\n ss += a[i]\r\n if ss == s:\r\n cnt[i] = 1\r\n\r\n for i in range(n-2,-1,-1):\r\n cnt[i] += cnt[i+1]\r\n\r\n ans = 0\r\n ss = 0\r\n for i in range(n-2):\r\n ss += a[i]\r\n if ss == s:\r\n ans += cnt[i+2]\r\n\r\n print(ans)", "n = int(input())\narr = input().split()\narr = [int(x) for x in arr]\n\n# note that if the array arr can be split into 3 parts with the same sum,\n# the sum of each part must be equal to sum(arr) / 3\ntarget = sum(arr)\n# if sum(arr) isn't divisible by 3, then there are 0 valid partitions\nif target % 3 != 0:\n print(\"0\")\nelse:\n # we count the number of indices at which we can split the left third and the right third of the array\n target //= 3\n left = []\n right = []\n prefsum = 0\n # use prefix sum to find indices to split at\n for i in range(len(arr)-1):\n prefsum += arr[i]\n if prefsum == target and i >= 0 and i <= n - 3:\n left.append(i)\n if prefsum == 2*target and i >= 1 and i <= n - 2:\n right.append(i)\n # this case should be covered already, but double check for lengths\n if len(left) == 0 or len(right) == 0:\n print(\"0\")\n else:\n a, b = 0, 0\n res = 0\n while b < len(right):\n if a < len(left) and left[a] < right[b]:\n a += 1\n else:\n b += 1\n res += a\n print(str(res))", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\ns=sum(l)\r\nif s%3!=0:\r\n print(0)\r\nelse:\r\n d=s//3\r\n sum1=0\r\n cut1=[0]*n\r\n #先找到一些分割点，分割点及其左侧所有数相加等于d，可作为第一个小组\r\n for i in range(n-2):#后两组至少有一个元素故到n-2\r\n sum1+=l[i]\r\n if sum1==d:\r\n cut1[i]=1\r\n \r\n #定义cut：该元素索引-2之前存在的分割点个数\r\n cut=[0]*n\r\n cut[0]=cut1[0]\r\n cut[1]=cut1[1]\r\n defsum=0\r\n for index in range(2,n):\r\n defsum+=cut1[index-2]\r\n cut[index]=defsum\r\n\r\n #同时从右往左找分割点，若找到的分割点索引-2之前有位置cut1值为1，说明找到了答案 \r\n sum3=0\r\n result=0\r\n #cut3=[0]*n\r\n for j in range(n-1,1,-1):\r\n sum3+=l[j]\r\n if sum3==d:\r\n #cut3[j]=1\r\n if cut[j]>0:\r\n result+=cut[j]\r\n print(result)", "n=int(input())\r\na=[x for x in map(int,input().split())]\r\n\r\nif sum(a)%3!=0:\r\n print(\"0\")\r\nelse:\r\n k=sum(a)//3\r\n l=2*k\r\n n_ways=0\r\n num_i=0\r\n s=0\r\n for x in a[:-1]:\r\n s+=x\r\n if s==l:\r\n n_ways+=num_i\r\n if s==k:\r\n num_i+=1 \r\n print(n_ways)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\ncount = 0\r\nl_sum = total = 0\r\nall_sum = sum(nums)\r\nfor i in range(n):\r\n l_sum += nums[i]\r\n if 0 < i < n - 1 and l_sum == all_sum * 2 / 3:\r\n total += count\r\n if l_sum == all_sum/3:\r\n count += 1\r\nprint(total)", "n = int(input())\na = [int(i) for i in input().split()]\ns = sum(a)\nx = 0\nif s%3 == 0:\n d1 = s/3\n d2 = 2*d1\n z = t = 0\n for i in range(n-1):\n z += a[i]\n\n if z == d2:\n x += t\n if z == d1:\n t += 1\nprint(x)", "n=int(input())\r\narray=list(map(int,input().split()))\r\ntarget=sum(array)\r\nif target%3 != 0:\r\n print(0)\r\nelse:\r\n target=target//3\r\n k_list=[]\r\n j_list=[]\r\n add_k=0\r\n for k in range(n):\r\n if add_k == target and k !=0:\r\n k_list.append(k+1)\r\n add_k+=array[k]\r\n add_j=0\r\n for i in range(n):\r\n if add_j == target and i != 0:\r\n j_list.append(n-i)\r\n add_j+=array[n-i-1]\r\n if k_list==[] or j_list==[]:\r\n print(0)\r\n else:\r\n output=0\r\n j_list=j_list[::-1]\r\n k=0\r\n for j in j_list:\r\n while k<len(k_list) and k_list[k]<=j:\r\n k+=1\r\n output+=k\r\n print(output)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\n\r\nif s % 3 != 0:\r\n print(0)\r\nelse:\r\n s //= 3\r\n ss = 0\r\n cnt = [0] * n\r\n\r\n for i in range(n - 1, -1, -1):\r\n ss += a[i]\r\n if ss == s:\r\n cnt[i] = 1\r\n\r\n for i in range(n - 2, -1, -1):\r\n cnt[i] += cnt[i + 1]\r\n\r\n ans = 0\r\n ss = 0\r\n\r\n for i in range(n - 2):\r\n ss += a[i]\r\n if ss == s:\r\n ans += cnt[i + 2]\r\n\r\n print(ans)\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n#pow(x,mod-2,mod)\n\nN = int(input())\nA = list(map(int,input().split()))\nl,su = [A[-1]],sum(A)\nfor i in range(N-2,1,-1):l.append(l[-1]+A[i])\nl,C = l[::-1],Counter(l)\n\nnum,ans = 0,0\nfor x in range(N-2):\n num+=A[x]\n if su-num-num-num==0:\n ans+=C[num]\n C[l[x]]-=1\n\nprint(ans)", "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 Number_of_Ways2():\r\n n = inp()\r\n sequence = inlt()\r\n total_sum = sum(sequence)\r\n\r\n if total_sum % 3 != 0 :\r\n print(0)\r\n else:\r\n required_sum_of_each_part = total_sum // 3\r\n running_sum = 0\r\n\r\n possible_i_1 = [] \r\n possible_j = [] \r\n\r\n for index, num in enumerate(sequence):\r\n running_sum += num \r\n\r\n if index <= (n-3) and running_sum == required_sum_of_each_part:\r\n possible_i_1.append(index)\r\n \r\n if index <= (n-2) and index >= 1 and running_sum == 2*required_sum_of_each_part:\r\n possible_j.append(index)\r\n \r\n #print(possible_i_1)\r\n\r\n pointer_j = 0\r\n total_possible_pairs = 0\r\n for i_1 in possible_i_1:\r\n while possible_j[pointer_j] <= i_1:\r\n pointer_j += 1 \r\n \r\n total_possible_pairs += len(possible_j) - (pointer_j)\r\n \r\n print(total_possible_pairs)\r\n #print(possible_j)\r\n #print(total_pairs)\r\n \r\n return \r\n\r\nNumber_of_Ways2()", "n = int(input())\r\nlst = list(map(int,input().split()))\r\ns = sum(lst)\r\ns1 = s//3\r\ns2 = 2*s1\r\nsi = 0\r\nsj = lst[0]\r\nk = 0\r\nans = 0\r\nif s%3 == 0 and n >= 3:\r\n for j,i in zip(range(1,n-1),range(0,n-2)):\r\n sj += lst[j]\r\n si += lst[i]\r\n if si == s1:\r\n k += 1\r\n if sj == s2:\r\n ans += k\r\nprint(ans)", "n = int(input())\narr = input().split()\narr = [int(x) for x in arr]\ntarget = sum(arr)\nif target % 3 != 0:\n print(\"0\")\nelse:\n target //= 3\n left = []\n right = []\n prefsum = 0\n for i in range(len(arr)-1):\n prefsum += arr[i]\n if prefsum == target and i >= 0 and i <= n - 3:\n left.append(i)\n if prefsum == 2*target:\n right.append(i)\n if len(left) == 0 or len(right) == 0 and i >= 1 and i <= n - 2:\n print(\"0\")\n else:\n a, b = 0, 0\n res = 0\n while b < len(right):\n if a < len(left) and left[a] < right[b]:\n a += 1\n else:\n b += 1\n res += a\n print(str(res))", "import collections\r\n\r\n\r\ndef solve(nums, n):\r\n sum_nums = sum(nums)\r\n need = sum_nums // 3\r\n if need * 3 != sum_nums:\r\n return 0\r\n dp = [nums[0]]\r\n for i in range(1, n):\r\n dp.append(dp[-1] + nums[i])\r\n ans = 0\r\n cnt_sums = collections.defaultdict(lambda: 0)\r\n need2 = 2 * need\r\n for i in range(n):\r\n num = dp[i]\r\n if num == need2 and 0 < i < n - 1:\r\n ans += cnt_sums[num - need]\r\n cnt_sums[num] += 1\r\n return ans\r\n\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nprint(solve(nums, n))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Nov 14 08:58:26 2023\r\n\r\n@author: 赵语涵2300012254\r\n\"\"\"\r\n\r\nn = int(input())\r\nnums,key = {0:0},1\r\nfor i in map(int,input().split()):\r\n nums[key] = nums[key-1]+i\r\n key += 1\r\ntotal = nums[n]\r\njudge = total//3\r\ncount,out = 0,0\r\nif total%3 == 0 and n >2:\r\n for i in range(1,n):\r\n if nums[i] == judge*2:\r\n out += count\r\n if nums[i] == judge:\r\n count += 1\r\nprint(out)", "n=int(input())\r\narray=list(map(int,input().split()))\r\ntotal=sum(array)\r\nif total%3!=0:\r\n print(0)\r\nelse:\r\n total_=count=answer=0\r\n for i in range(n-1):\r\n total_+=array[i]\r\n if total_==total//3*2:\r\n answer+=count\r\n if total_==total//3:\r\n count+=1\r\n print(answer)", "# 原array顺序不能改变！\n# 特殊考虑全0情况\n# 递归超时\n# 借鉴题解，用双指针\n\nn = int(input())\narr = list(map(int, input().split()))\ntot = sum(arr)\nways = 0\nif tot % 3 == 0:\n first = tot // 3\n second = 2 * first\n passed = 0\n leftdiv = 0\n for i in range(n - 1):\n passed += arr[i]\n # 先判断是否到了2/3处，这样保证全零的情况下，\n # 不会出现左侧分隔和右侧分隔在一起\n # 如果到达2/3处，相当于确认了这是一个右侧分隔（右边是1/3），\n # 于是在总分法加上此时已经产生的左侧分隔数量（左侧是1/3）\n if passed == second:\n ways += leftdiv\n if passed == first:\n leftdiv += 1\nprint(ways)\n", "import heapq \r\nfrom collections import defaultdict \r\nimport math \r\nimport collections\r\n\r\n\r\n\r\nmod=10**9+7\r\nalp='#abcdefghijklmnopqrstuvwxyz'\r\ncap='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ndigit='1234567890'\r\n\r\n\r\n\r\n#math.facorial(n)------>gives the factorial \r\n\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(1):\r\n \r\n n =int(input()) \r\n #n , m =map(int,input().split())\r\n l=list(map(int,input().split()))\r\n #s=input()\r\n sm =sum(l)\r\n if sm%3!=0:\r\n print(0)\r\n continue \r\n tar=sm//3 \r\n pre=[]\r\n sm1=0\r\n suf =[0]*n \r\n sm2=0\r\n for i in l:\r\n sm1+=i \r\n if sm1==tar:\r\n pre.append(1)\r\n else:\r\n pre.append(0)\r\n cnt =0\r\n for i in range(n -1,-1,-1):\r\n sm2+=l[i]\r\n if sm2==tar:\r\n suf[i]=cnt+1 \r\n cnt+=1\r\n else:\r\n suf[i]=cnt\r\n ans =0\r\n for i in range(n-2):\r\n if pre[i]==1:\r\n ans+=suf[i+2]\r\n \r\n print(ans)\r\n \r\n \r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nif s%3!=0:\r\n print(0)\r\nelse:\r\n t=s//3\r\n a=[]\r\n b=[0]*n\r\n u=0\r\n v=0\r\n ans=0\r\n for i in range(n):\r\n u+=l[i]\r\n if u==t:\r\n a.append(i)\r\n for j in range(-1,-n-1,-1):\r\n v+=l[j]\r\n if v==t:\r\n b[j]+=1\r\n for j in range(-2,-n-1,-1):\r\n b[j]+=b[j+1]\r\n for item in a:\r\n if item <n-2:\r\n ans+=b[item+2]\r\n print(ans)\r\n ", "n=int(input())\r\narray=list(map(int,input().split()))\r\nif n<=2:\r\n print(0)\r\nelse:\r\n s=sum(array)/3\r\n ss = 2 *s\r\n x= z = t = 0\r\n for i in range(n - 1):\r\n z += array[i]\r\n if z == ss:\r\n x += t\r\n if z == s:\r\n t += 1\r\n print(x)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nM = sum(arr)\r\nx = 0\r\nif M % 3 != 0:\r\n print(x)\r\nelse:\r\n S = M / 3\r\n L, R = [], []\r\n prefix, suffix = arr[0], arr[-1]\r\n for i in range(1, n):\r\n if prefix != S:\r\n prefix += arr[i]\r\n else:\r\n L.append(i-1)\r\n prefix += arr[i]\r\n\r\n for j in range(n-2, 0, -1):\r\n if suffix != S:\r\n suffix += arr[j]\r\n else:\r\n R.append(j+1)\r\n suffix += arr[j]\r\n\r\n R.sort()\r\n r1 = 0\r\n for i in range((len(L))):\r\n for j in range(r1, len(R)):\r\n if L[i] < R[j] - 1:\r\n x += len(R) - j\r\n r1 = j\r\n break\r\n print(x)\r\n", "def count_ways(arr, n):\r\n total_sum = sum(arr)\r\n if total_sum % 3 != 0:\r\n return 0\r\n\r\n each_sum = total_sum // 3\r\n count = 0\r\n sum_so_far = 0\r\n suffix_count = [0] * n\r\n\r\n for i in range(n-1, -1, -1):\r\n sum_so_far += arr[i]\r\n if sum_so_far == each_sum:\r\n suffix_count[i] = 1\r\n\r\n for i in range(n-2, -1, -1):\r\n suffix_count[i] += suffix_count[i + 1]\r\n\r\n sum_so_far = 0\r\n\r\n for i in range(n-2):\r\n sum_so_far += arr[i]\r\n if sum_so_far == each_sum:\r\n count += suffix_count[i + 2]\r\n\r\n return count\r\n\r\n\r\n# Input reading\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\n# Output\r\nprint(count_ways(arr, n))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nls = [0]\r\ns = 0\r\nfor x in a:\r\n s += x\r\n ls.append(s)\r\n\r\nif ls[-1] % 3 != 0:\r\n print(0)\r\nelif ls[-1] == 0:\r\n k = ls.count(0) - 2\r\n print(k*(k-1) // 2)\r\nelse:\r\n u = ls[-1] // 3\r\n v = 2 * u\r\n ans = 0\r\n cnt = 0\r\n for y in ls:\r\n if y == u:\r\n cnt += 1\r\n elif y == v:\r\n ans += cnt\r\n print(ans)\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nt=sum(a)\r\nif t%3!=0:\r\n print(0)\r\nelse:\r\n t1=t//3\r\n t2=2*t1\r\n for i in range(1,n):\r\n a[i]=a[i-1]+a[i]\r\n res=x=0\r\n for i in a[:n-1]:\r\n if i==t2:\r\n res+=x\r\n if i==t1:\r\n x+=1\r\n print(res)", "from collections import Counter\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n aseq = read_ints()\r\n\r\n pref = [0]\r\n for ai in aseq:\r\n pref.append(pref[-1] + ai)\r\n\r\n suff = [0] * (n+1)\r\n for i in range(n-1, -1, -1):\r\n suff[i] = suff[i+1] + aseq[i]\r\n\r\n suff.pop()\r\n\r\n res = 0\r\n asum = sum(aseq)\r\n acnt = Counter(suff)\r\n acnt[suff[0]] -= 1\r\n for i in range(n):\r\n left = pref[i+1]\r\n if i + 1 < n:\r\n acnt[suff[i+1]] -= 1\r\n\r\n if asum == 3 * left:\r\n res += acnt[left]\r\n\r\n print(res)\r\n\r\n\r\ndef input(): return next(test).strip()\r\ndef read_ints(): return [int(c) for c in input().split()]\r\ndef print_lines(lst): print('\\n'.join(map(str, lst)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n import sys\r\n from os import environ as env\r\n if 'COMPUTERNAME' in env and 'L2A6HRI' in env['COMPUTERNAME']:\r\n sys.stdout = open('out.txt', 'w')\r\n sys.stdin = open('in.txt', 'r')\r\n\r\n test = iter(sys.stdin.readlines())\r\n\r\n main()\r\n", "n=int(input())\r\nimport bisect\r\nL=list(map(int,input().split()))\r\nXs=[]\r\nXe=[]\r\nif n<=2:\r\n print(0)\r\nelse:\r\n s=sum(L)\r\n if s%3!=0:\r\n print(0)\r\n else:\r\n s=s//3\r\n bs=0\r\n for j in range(n-2):\r\n bs+=L[j]\r\n if bs==s:\r\n Xs.append(j)\r\n bs=0\r\n for k in range(n-1,0,-1):\r\n bs+=L[k]\r\n if bs==s:\r\n Xe.append(k)\r\n Xe.reverse()\r\n ans=0\r\n m=len(Xe)\r\n for j in Xs:\r\n c=bisect.bisect_right(Xe,j)\r\n if c<m:\r\n if Xe[c]>j+1:\r\n ans+=m-c\r\n else:\r\n c+=1\r\n if c<m:\r\n ans+=m-c\r\n print(ans)\r\n\r\n\r\n", "N=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nS=[0]\r\nfor a in A:\r\n S.append(S[-1]+a)\r\n\r\nSUM=S[-1]\r\n\r\nif SUM%3!=0:\r\n print(0)\r\n exit()\r\n\r\nANS=0\r\nnow=0\r\n\r\nfor i in range(N-1,0,-1):\r\n if S[i]==SUM//3:\r\n ANS+=now\r\n\r\n if S[i]==SUM//3*2:\r\n now+=1\r\n\r\nprint(ANS)\r\n", " \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\n#SLMII = lambda: sorted(LMII())\r\n\r\nn = II()\r\na = LMII()\r\nans = 0\r\n\r\ns = sum(a)\r\nif s%3:\r\n exit(print(0))\r\ns //= 3\r\ns2 = 2*s\r\n\r\nls = []\r\nrs = []\r\nt = 0\r\nfor i in range(n-1):\r\n t += a[i]\r\n if t == s:\r\n ls.append(i+1)\r\n if t == s2:\r\n rs.append(i)\r\n \r\nm = len(rs)\r\nk = 0\r\nfor i in ls:\r\n while k < m and rs[k] < i:\r\n k += 1\r\n ans += m - k\r\n\r\nprint(ans)\r\n\r\n", "N=int(input())\r\narr=list(map(int,input().split()))\r\ns=sum(arr)\r\nif s%3!=0:\r\n print('0')\r\nelse:\r\n s=s//3\r\n L=count=0\r\n tot=arr[0]\r\n for i in arr[1:]:\r\n if tot == s*2:\r\n count+=L\r\n if tot == s:\r\n L+=1\r\n tot+=i\r\n print(count)", "n=int(input())\r\nnums=list(map(int,input().split()))\r\ns=sum(nums)\r\nif s%3!=0:\r\n print(0)\r\n exit()\r\ns=s//3\r\nans,cnt,pre_sum=0,0,0\r\nfor i in range(n-1):\r\n pre_sum+=nums[i]\r\n if pre_sum==s*2:\r\n ans+=cnt\r\n if pre_sum==s:\r\n cnt+=1\r\nprint(ans)", "n,a=int(input()),list(map(int,input().split()))\r\nk,p=sum(a),0\r\nif k%3==0:\r\n k,c,s=k//3,0,0\r\n for r in a[:-1]:\r\n s+=r\r\n p+=c*(s==2*k)\r\n c+=s==k\r\nprint(p)", "\nfor _ in range(1):\n n = int(input())\n arr = list(map(int, input().split()))\n sumer = sum(arr)\n if n < 3:\n print(0)\n continue\n if arr.count(0) == n:\n print((n-2)*(n-1)//2)\n continue\n if sumer%3 != 0:\n print(0)\n continue\n need = sumer//3\n need2 = need*2\n ones = 0\n ans = 0\n till = 0\n for i in range(n-1):\n till += arr[i]\n if till == need2:\n ans += ones\n if till == need:\n ones += 1\n print(ans)\n \n\n \n\n", "n = int(input())\r\narr = [0] + list(map(int, input().split()))\r\nsum = sum(arr)\r\nif sum % 3 != 0:\r\n print(0)\r\nelse:\r\n cnt = [0]*(n+1)\r\n temp = 0\r\n for i in range(n,0,-1):\r\n temp += arr[i]\r\n if temp == sum // 3:\r\n cnt[i] = 1\r\n # print(cnt)\r\n sums = [0]*(n+1)\r\n sums[n] = cnt[n]\r\n for i in range(n-1,0,-1):\r\n sums[i] = sums[i+1] + cnt[i]\r\n # print(sums)\r\n temp = 0\r\n ans = 0\r\n for i in range(1,n-1):\r\n temp += arr[i]\r\n if temp == sum // 3:\r\n ans += sums[i+2]\r\n print(ans)", "import bisect\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nsu=sum(a)\r\nif su%3!=0:\r\n print(0)\r\nelse:\r\n sta=su//3\r\n tems=0\r\n left=[]\r\n for i in range(n):\r\n tems+=a[i]\r\n if tems==sta:\r\n left.append(i)\r\n tems=0\r\n #print(left)\r\n for i in range(1,n+1):\r\n tems+=a[-i]\r\n if tems==sta:\r\n #print(n-i-1)\r\n #print(bisect.bisect_left(left, n-i-1))\r\n ans+=bisect.bisect_left(left, n-i-1)\r\n print(ans)", "from itertools import accumulate\n\ninput()\narr = list(map(int, input().split()))\nto_hit = sum(arr)\n\npossible = 0\nif to_hit % 3 == 0:\n to_hit //= 3\n possible_firsts = 0\n\n # some cases eg. to_hit == 0, require it to be [:-1], or it will disregard that there has to be a third partition\n for possible_second in accumulate(arr[:-1]):\n if possible_second == 2 * to_hit:\n possible += possible_firsts\n possible_firsts += (possible_second == to_hit)\nprint(possible)\n", "from bisect import bisect_right\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)%3>0:\r\n print(0)\r\nelse:\r\n each_sum=sum(a)//3\r\n ans=0; ini_i=0\r\n dp=[]\r\n left_sum=0; right_sum=0\r\n for i in range(n-2):\r\n right_sum+=a[i]\r\n if right_sum==each_sum:\r\n ini_i=i+1\r\n for j in range(n-1,i+1,-1):\r\n left_sum+=a[j]\r\n if left_sum==each_sum:\r\n dp.append(j)\r\n ans+=1\r\n break\r\n dp.sort()\r\n len_dp=len(dp)\r\n for i in range(ini_i,n-2):\r\n right_sum+=a[i]\r\n if right_sum==each_sum:\r\n ind=bisect_right(dp,i+1)\r\n ans+=len_dp-ind\r\n print(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n total += a[i]\r\n \r\nif total % 3 != 0:\r\n print(\"0\")\r\nelse:\r\n one_third = total // 3\r\n two_third = one_third * 2\r\n one_third_count = 0\r\n ans = 0\r\n _sum = 0\r\n \r\n for i in range(n - 1):\r\n _sum += a[i] \r\n if _sum == two_third:\r\n ans += one_third_count\r\n if _sum == one_third:\r\n one_third_count += 1\r\n print(ans)\r\n", "n = int(input())\r\narray = list(map(int,input().split()))\r\nL,s,num,S = [],sum(array),0,0\r\nif s != 0:\r\n for i in range(n):\r\n S += array[i]\r\n if S == s / 3:\r\n L.append(1)\r\n elif S == 2 * s / 3:\r\n L.append(2)\r\n else:\r\n L.append(0)\r\n cnt = L.count(2)\r\n for i in range(n):\r\n if L[i] == 1:\r\n num += cnt\r\n elif L[i] == 2:\r\n cnt -= 1\r\nelse:\r\n cnt = 0\r\n for i in range(n):\r\n S += array[i]\r\n if S == 0:\r\n cnt += 1\r\n num = int((cnt - 1) * (cnt - 2) / 2)\r\nprint(num)", "n = int(input())\r\na = list(map(int,input().split()))\r\n \r\ndp = list(range(0,n+1))\r\ndp[0] =a[0]\r\nfor i in range(1,n):\r\n dp[i] = dp[i-1]+a[i]\r\n \r\n \r\nif (dp[n-1] %3 != 0):\r\n print(0)\r\n exit()\r\n \r\ndiv = dp[n-1]/3\r\ntime = 0\r\ntimg = 0\r\nfor i in range(0,n-1):\r\n if (dp[i] == div*2):\r\n timg += time\r\n if (dp[i] == div):\r\n time += 1\r\nprint(timg)\r\n", "def binsearch(x, mas):\r\n l=-1\r\n r=len(mas)\r\n while l+1!=r:\r\n m=(l+r)//2\r\n if mas[m]>x:\r\n r=m\r\n else:\r\n l=m\r\n return len(mas)-r\r\nn=int(input())\r\n*mas,=map(int, input().split())\r\nsu=sum(mas); need=su//3\r\nif n<3 or su%3!=0:\r\n print(0)\r\nelse:\r\n pref=[]; now=0\r\n for i in range(n):\r\n now+=mas[i]\r\n pref+=[now]\r\n su1=[]; su2=[]\r\n for i in range(n-1):\r\n if pref[i]==need:\r\n su1+=[i]\r\n if pref[i]==need*2:\r\n su2+=[i]\r\n if len(su1)==0 or len(su2)==0:\r\n print(0)\r\n else:\r\n ans=0\r\n for x in su1:\r\n ans+=binsearch(x, su2)\r\n print(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n a[i] += a[i-1]\r\nif a[n-1] % 3 != 0:\r\n print(0)\r\nelse:\r\n x1 = a[n-1] / 3\r\n l1 = []\r\n \r\n x2 = 2*x1\r\n l2 = []\r\n r = 0\r\n for i in range(n-1):\r\n if a[i] == x2:\r\n r += len(l1)\r\n l2.append(x2)\r\n \r\n if a[i] == x1:\r\n l1.append(x1)\r\n \r\n print(r)", "def binp(ch):\r\n l = 0\r\n r = len(ans[1])\r\n while l < r:\r\n m = (l + r) // 2\r\n if ans[1][m] > ch:\r\n r = m\r\n else:\r\n l = m + 1\r\n return len(ans[1]) - r\r\n\r\n\r\nn = int(input())\r\nmas = list(map(int, input().split()))\r\n\r\ntemp = sum(mas)\r\nif temp % 3:\r\n print(0)\r\n exit(0)\r\nfind = temp // 3\r\nans = [[], []]\r\ntmp = 0\r\nfor i in range(n):\r\n tmp += mas[i]\r\n if tmp == find:\r\n ans[0].append(i)\r\n elif tmp == 2 * find:\r\n ans[1].append(i)\r\n mas[i] = tmp\r\nanswer = 0\r\nif find == 0:\r\n if len(ans[0]) == 3:\r\n answer = 1\r\n else:\r\n for i in range(1, len(ans[0]) - 1):\r\n answer += i\r\nelse:\r\n for i in ans[0]:\r\n answer += binp(i)\r\nprint(answer)\r\n", "n=int(input())\r\nprev=0\r\narr=[(prev:=prev+int(x)) for x in input().split()]\r\nif arr[-1]%3==0:\r\n m=arr[-1]//3\r\n n1,n2=0,0\r\n for a in arr[:n-1]:\r\n if a==2*m:\r\n n2+=n1\r\n if a==m:\r\n n1+=1\r\n print(n2)\r\nelse:\r\n print('0')\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nsum = [0]\r\na1 = [0]\r\na2 = [0]\r\nans = 0\r\nfor i in range(n):\r\n sum.append(sum[i] + a[i])\r\nif 3 * (sum[n] // 3) == sum[n]:\r\n p = sum[n] // 3\r\n for i in range(n):\r\n if sum[i + 1] == p:\r\n a1.append(a1[i] + 1)\r\n else:\r\n a1.append(a1[i])\r\n if sum[i + 1] == p + p and i != n - 1:\r\n a2.append(a2[i] + 1)\r\n else:\r\n a2.append(a2[i])\r\n a2.append(a2[n])\r\n for i in range(1, n):\r\n if a1[i] != a1[i - 1]:\r\n ans += a2[n] - a2[i]\r\n print(ans)\r\nelse:\r\n print(0)\r\n", "import bisect\r\nn = int(input())\r\narray = list(map(int, input().split()))\r\nsum_array = []\r\ns = 0\r\nfor i in array:\r\n s += i\r\n sum_array.append(s)\r\nans = 0\r\nif sum_array[-1] % 3 or n < 3:\r\n pass\r\nelse:\r\n list_1 = []; pivot_1 = sum_array[-1] / 3\r\n list_2 = []; pivot_2 = sum_array[-1] * 2 / 3\r\n for i in range(n - 2):\r\n if sum_array[i] == pivot_1:\r\n list_1.append(i)\r\n if sum_array[i] == pivot_2:\r\n list_2.append(i)\r\n if sum_array[n - 2] == pivot_2:\r\n list_2.append(n - 2)\r\n for i in list_1:\r\n ans += int(len(list_2) - bisect.bisect_right(list_2, i) > 0) * (len(list_2) - bisect.bisect_right(list_2, i))\r\nprint(ans)" ]

[ "n, m, i, j, a, b = map(int, input().split())\ndef f(x, y):\n dx, dy = abs(x - i), abs(y - j)\n if dx % a or dy % b:\n return -1\n elif dx // a % 2 != dy // b % 2:\n return -1\n elif dx == 0 and dy == 0:\n return 0\n elif (i - a < 1 and i + a > n) or (j - b < 1 and j + b > m):\n return -1\n else:\n return max(dx // a, dy // b)\nv = -1\nfor p in ((1, m), (n, 1), (n, m), (1, 1)):\n c = f(*p)\n if c != -1 and (v == -1 or c < v):\n v = c\nprint(v if v != -1 else 'Poor Inna and pony!')\n", "INF = float('inf') #ret INF means can not reach that corner \r\ndef solve(i, j, n, m, a, b):\r\n # i and j are distances from end rows, end columns\r\n #print('dist from r', i,'dist from c', j)\r\n ret = 0\r\n if i % a != 0 or j % b != 0: #if distance is not dividible by step size\r\n return INF #i.e no of steps is not an integer, cant reach that corner\r\n ret = min(i // a, j // b) #if both distances are divisble, number of full steps that \r\n #print('steps r c',ret, i//a, j//b) #can be taken towards that corner is the minimum of them\r\n i -= ret * a \r\n j -= ret * b #after taking these full steps calculate the new distances from the corner \r\n #print('dist after full steps',i,j)\r\n #print('--------')\r\n\r\n if i != 0 and j != 0: #if both distances are not equal to zero, \r\n #print(1) #i.e didnot reach end row or col, cant reach that corner \r\n return INF\r\n if j // b % 2 != 0 or i // a % 2 != 0: #if the remaining no of steps needed in either \r\n #print(2) #directions is not even, cant reach that corner\r\n return INF\r\n if i == 0 and j != 0 and a >= n: #if reached end row but not end column \r\n #print(3) #and step size through rows is bigger than no_of rows \r\n return INF #cant reach that corner \r\n if j == 0 and i != 0 and b >= m: #if reached end col but not end row\r\n #print(4) #and step size through cols is bigger than no_of cols\r\n return INF #cant reach that corner\r\n #print(5)\r\n return ret + j // b + i // a #return full steps + remaining steps c + remaining steps r\r\n\r\n\r\nn, m, i, j, a, b = map(int, input().split())\r\nx = min(solve(i-1, j-1, n, m, a, b), solve(n-i, j-1, n, m, a, b),\r\n solve(i-1, m-j, n, m, a, b), solve(n-i, m-j, n, m, a, b))\r\nif x < INF:\r\n print(x)\r\nelse:\r\n print(\"Poor Inna and pony!\")", "import sys\r\ninput=sys.stdin.readline\r\nn,m,i,j,a,b=map(int,input().split())\r\nMIN=10**18\r\ndef calc(u,v):\r\n global MIN\r\n if (u-i)%a==0 and (v-j)%b==0:\r\n x=abs(u-i)//a\r\n y=abs(v-j)//b\r\n if x%2==y%2 and 1+a<=n and 1+b<=m:\r\n MIN=min(MIN,max(x,y))\r\n if x==y==0:\r\n MIN=0\r\ncalc(1,1)\r\ncalc(1,m)\r\ncalc(n,1)\r\ncalc(n,m)\r\nif MIN==10**18:\r\n print(\"Poor Inna and pony!\")\r\nelse:\r\n print(MIN)", "n, m, i, j, a, b = map(int, input().split())\r\nx, y, t = [i - 1, n - i], [j - 1, m - j], []\r\nif all(i < a for i in x) or all(j < b for j in y):\r\n if 0 in x and 0 in y: t = [0]\r\nelse:\r\n u = [d // a for d in x if d % a == 0]\r\n v = [d // b for d in y if d % b == 0]\r\n t = [max(i, j) for i in u for j in v if (i + j) % 2 == 0]\r\nprint(min(t) if t else 'Poor Inna and pony!')", "n,m,i,j,a,b=0,0,0,0,0,0\r\ninf=1000000000\r\n\r\ndef check(x,y):\r\n if x==i and y==j: return 0\r\n if i-a<1 and i+a>n: return inf\r\n if j-b<1 and j+b>m: return inf\r\n if (abs(x-i)%a) !=0: return inf\r\n if (abs(y-j)%b)!=0 : return inf\r\n cost=0\r\n cost=max(abs(x-i)//a, abs(y-j)//b)\r\n tmp=abs(x-i)//a + abs(y-j)//b\r\n if tmp&1: return inf\r\n return cost\r\n\r\ndef solve():\r\n ans=inf\r\n ans=min(check(1,m),check(n,1))\r\n ans=min(ans,min(check(n,m),check(1,1)))\r\n if ans==inf: return \"Poor Inna and pony!\"\r\n else: return ans\r\n\r\nn,m,i,j,a,b=map(int,input().split())\r\nprint(solve())\r\n", "\r\nn, m, i, j, a, b = map(int, input().split())\r\nINF = float(\"inf\")\r\ndef try_corner(x, y):\r\n\tdx = abs(x - i)\r\n\tdy = abs(y - j)\r\n\tif (not dx) and (not dy):\r\n\t\treturn 0\r\n\tif (not dx) and dy and a < n and dy % b == 0 and (dy / b) % 2 == 0:\r\n\t\treturn dy / b\r\n\tif (not dy) and dx and b < m and dx % a == 0 and (dx / a) % 2 == 0:\r\n\t\treturn dx / a\r\n\tif dx and dy and dx % a == 0 and dy % b == 0 and abs(dx / a - dy /b ) % 2== 0:\r\n\t\treturn max(dx / a , dy / b)\r\n\treturn INF\r\n \r\nans = INF\r\nans = min(ans , try_corner(1, 1))\r\nans = min(ans , try_corner(1, m))\r\nans = min(ans , try_corner(n, 1))\r\nans = min(ans , try_corner(n, m))\r\nif ans == INF:\r\n\tprint (\"Poor Inna and pony!\")\r\nelse:\r\n\tprint (int(ans))", "n,m,i,j,a,b=map(int,input().split())\n\nans=100000000000\n\nif((i,j)==(n,1) or (i,j)==(1,1) or (i,j)==(1,m) or (i,j)==(n,m)):\n print(0)\n\nelse:\n #Corner (1,1)\n\n hor=i-1\n ver=j-1\n\n if(hor%a==0 and ver%b==0):\n x=hor//a\n y=ver//b\n if(x%2==y%2 and a<=n-1 and b<=m-1):\n ans=min(ans,max(x,y))\n\n #Corner (n,m)\n\n hor=abs(i-n)\n ver=abs(j-m)\n\n if(hor%a==0 and ver%b==0):\n x=hor//a\n y=ver//b\n if(x%2==y%2 and a<=n-1 and b<=m-1):\n ans=min(ans,max(x,y))\n\n #Corner (1,m)\n\n hor=i-1\n ver=abs(j-m)\n\n if(hor%a==0 and ver%b==0):\n x=hor//a\n y=ver//b\n if(x%2==y%2 and a<=n-1 and b<=m-1):\n ans=min(ans,max(x,y))\n\n #Corner (n,1)\n\n hor=abs(n-i)\n ver=j-1\n\n if(hor%a==0 and ver%b==0):\n x=hor//a\n y=ver//b\n if(x%2==y%2 and a<=n-1 and b<=m-1):\n ans=min(ans,max(x,y))\n if(ans!=100000000000):\n print(ans)\n else:\n print(\"Poor Inna and pony!\")\n \n", "bot = True\r\nn,m,i,j,a,b = map(int,input().split())\r\nx,y,t = [i-1,n-i],[j-1,m-j],[]\r\nif all(i<a for i in x)or all(j<b for j in y):\r\n if 0 in x and 0 in y: t=[0]\r\nelse:\r\n u = [d//a for d in x if d%a==0]\r\n v = [d//b for d in y if d%b==0]\r\n t = [max(i,j)for i in u for j in v if(i+j)%2==0]\r\nprint(min(t) if t else'Poor Inna and pony!')" ]

[ "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(float, input().split())) for _ in range(n)]\r\npow2 = [1]\r\nfor _ in range(n):\r\n pow2.append(2 * pow2[-1])\r\nm = pow2[n]\r\ndp = [0] * m\r\ndp[-1] = 1\r\nfor i in range(m - 1, 0, -1):\r\n x = []\r\n for j in range(n):\r\n if i & pow2[j]:\r\n x.append(j)\r\n u = len(x) * (len(x) - 1) // 2\r\n if not u or not dp[i]:\r\n continue\r\n dpi = dp[i]\r\n for j in x:\r\n aj = a[j]\r\n for k in x:\r\n if j == k:\r\n continue\r\n l = i ^ pow2[k]\r\n dp[l] += dpi * aj[k] / u\r\nans = [dp[i] for i in pow2[:-1]]\r\nsys.stdout.write(\" \".join(map(str, ans)))", "\r\nn = int(input())\r\n\r\n\r\np = []\r\nfor i in range(n):\r\n la = list(map(float,input().split()))\r\n p.append(la)\r\n\r\nfull_bit = (1<<n) - 1\r\ndp = [0]*(full_bit) + [1]\r\n\r\nfor i in range(full_bit,0,-1):\r\n\r\n cunt = bin(i)[2:].count('1')\r\n # print(cunt)\r\n if cunt == 1 or dp[i] == 0:\r\n continue\r\n\r\n mul = 1/((cunt*(cunt-1))>>1)\r\n\r\n for x in range(n):\r\n if (i & (1<<x)) == 0:\r\n continue\r\n for y in range(x+1,n):\r\n if (i & (1<<y)) == 0:\r\n continue\r\n\r\n dp[i-(1<<y)]+=dp[i]*p[x][y]*mul\r\n dp[i-(1<<x)]+=dp[i]*p[y][x]*mul\r\n\r\nans = []\r\nfor i in range(n):\r\n ans.append(dp[1<<i])\r\n\r\nprint(*ans)\r\n\r\n\r\n\r\n\r\n\r\n", "def Is_bit_on(mask, i):\r\n return ((mask >> i) & 1) == 1\r\n\r\ndef turn_bit_off(mask, i):\r\n return ~(1 << i) & mask\r\n\r\ndef turn_bit_on(mask, i):\r\n return (1 << i) | mask\r\n\r\ndef count_on_bit(mask, n):\r\n count = 0\r\n for i in range(n):\r\n if Is_bit_on(mask, i):\r\n count += 1\r\n return count\r\n\r\nn = int(input())\r\nprobs = [0] * n\r\nfor i in range(n):\r\n probs[i] = [0] * n\r\n\r\nfor i in range(n):\r\n p = [float(a) for a in input().split()]\r\n for j in range(n):\r\n probs[i][j] = p[j]\r\ndp_size = turn_bit_on(0, n)\r\ndp = [0] * dp_size\r\ndp[dp_size - 1] = 1\r\nfor mask in range((1 << n) - 1, 0, -1):\r\n cnt = count_on_bit(mask, n)\r\n stats = (cnt * (cnt - 1)) // 2\r\n for i in range(n):\r\n if not Is_bit_on(mask, i):\r\n continue\r\n for j in range(n):\r\n if (i == j) or not Is_bit_on(mask, j):\r\n continue\r\n dp[int(turn_bit_off(int(mask), j))] += dp[int(mask)] * probs[i][j] / stats\r\n\r\nresults = []\r\nfor i in range(n):\r\n print(format(dp[turn_bit_on(0, i)], '.6f'), '', end='')\r\n\r\n\r\n\r\n", "n = int(input())\r\na = []\r\nfor _ in range(n):\r\n a.append([float(x) for x in input().split()])\r\n\r\ndp = [0] * (1 << n)\r\ndp[-1] = 1\r\n\r\nfor i in range(len(dp) - 1, 0, -1):\r\n co = 0\r\n for j in range(n):\r\n if i & (1 << j) != 0:\r\n co += 1\r\n\r\n val = (co * (co - 1)) // 2\r\n for j in range(n):\r\n for k in range(j + 1, n):\r\n if i & (1 << j) == 0 or i & (1 << k) == 0:\r\n continue\r\n dp[i ^ (1 << j)] += (dp[i] * a[k][j]) / val\r\n dp[i ^ (1 << k)] += (dp[i] * a[j][k]) / val\r\nres = []\r\nfor i in range(n):\r\n res.append(dp[1 << i])\r\n\r\nprint(*res)\r\n", "def get_bit_count(value):\r\n n = 0\r\n while value:\r\n n += 1\r\n value &= value-1\r\n return n\r\n\r\n\r\ndef pMove(ss, s, p, fish, n):\r\n num = 0\r\n x = get_bit_count(ss)\r\n den = (x * (x - 1)) / 2\r\n\r\n for i in range(n):\r\n if s & (1 << i) != 0:\r\n num += p[i][fish]\r\n return num / den\r\n\r\n\r\ndef dp(n, p, s, memo):\r\n if s == 2 ** n - 1:\r\n return 1.0\r\n\r\n if memo[s] > -0.9:\r\n return memo[s]\r\n\r\n ans = 0\r\n\r\n for i in range(n):\r\n if s & (1 << i) == 0:\r\n ss = s ^ (1 << i)\r\n ans += pMove(ss, s, p, i, n) * dp(n, p, ss, memo)\r\n memo[s] = ans\r\n return ans\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n memo = [-1] * (2 ** n)\r\n p = [[0] * n for _ in range(n)]\r\n\r\n for i in range(n):\r\n p[i] = [float(x) for x in input().split()]\r\n for i in range(n):\r\n print(round(dp(n, p, 1 << i, memo), 6), end=\" \")\r\n\r\n\r\nmain()", "# By the grace of Goddess Saraswati and Durga#\r\n# Author: Vaibhav Tiwari #\r\n\r\n\r\nimport os, sys, math\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n prob = []\r\n for i in range(n):\r\n prob.append(arrin(float))\r\n FishBitmaskIterative(n,prob)\r\n\r\n\r\n# Fast IO Region\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\narrin = lambda x: list(map(x,input().split()))\r\n\r\n\r\n# really showed me how state transition is magic.\r\ndef maximumSumOneDeletionAtmost(self, nums):\r\n pos = False\r\n for i in nums:\r\n if i > 0:\r\n pos = True\r\n if not pos: return max(nums)\r\n dp = {}\r\n mx = -1000000000\r\n dp[(0, 0)] = nums[0]\r\n dp[(0, 1)] = 0\r\n for i in range(1, len(nums)):\r\n dp[(i, 0)] = max(nums[i], nums[i] + dp[(i - 1, 0)])\r\n dp[(i, 1)] = max(nums[i] + dp[i - 1, 1], dp[i - 1, 0])\r\n mx = max(mx, dp[i, 1], dp[i, 0])\r\n return max(mx, dp[0, 0], dp[0, 1])\r\n\r\n\r\ndef onesComplement(n):\r\n # Find number of bits in\r\n # the given integer\r\n number_of_bits = (int)(math.floor(math.log(n) /\r\n math.log(2))) + 1;\r\n\r\n # XOR the given integer with poe(2,\r\n # number_of_bits-1 and print the result\r\n return ((1 << number_of_bits) - 1) ^ n;\r\n\r\ndef FishBitmaskIterative(n, prob):\r\n #0 in mask means fish alive\r\n #1 in bitmask means fish dead\r\n dp = [0 for _ in range(1<<n)]\r\n dp[0] = 1\r\n for mask in range(1<<n):\r\n alive_in_the_stage_before = n - bin(mask).count(\"1\") + 1\r\n choosing_two = alive_in_the_stage_before*(alive_in_the_stage_before-1)/2\r\n for alive in range(n):\r\n if not mask & 1<<alive:\r\n for dead in range(n):\r\n if mask & 1<<dead:\r\n dp[mask] +=(dp[mask ^ 1<<dead]*prob[alive][dead]/choosing_two)\r\n ma = 1<<n\r\n ans = []\r\n for i in range(n):\r\n ans.append(dp[ma - 1 - (1 << i)])\r\n print(*ans)\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random,threading\r\nfrom functools import lru_cache\r\nfrom itertools import *\r\nimport sys\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\ndef inpu(): return int(inp())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef stringlis(): return list(map(str, inp().split()))\r\ndef sep(): return map(int, inp().split())\r\ndef strsep(): return map(str, inp().split())\r\ndef fsep(): return map(float, inp().split())\r\n# #include <ext/pb_ds/assoc_container.hpp>\r\n# #include <ext/pb_ds/tree_policy.hpp>\r\n# using namespace __gnu_pbds;\r\n# #define ll long long\r\n# #define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>\r\n# #define ordered_multiset tree<int, null_type,less_equal<int>, rb_tree_tag,tree_order_statistics_node_update>\r\nM,M1,pi=1000000007,998244353,3.14159265358979323846\r\ndef calculate(p, q, mod):\r\n\texpo = mod - 2\r\n\twhile (expo):\r\n\t\tif (expo & 1):\r\n\t\t\tp = (p * q) % mod\r\n\t\tq = (q * q) % mod\r\n\t\texpo >>= 1\r\n\treturn p\r\n\r\n\r\ndef main():\r\n\thow_much_noob_I_am = 1\r\n\t# how_much_noob_I_am = inpu()\r\n\tfor _ in range(1,how_much_noob_I_am+1):\r\n\t\tn = inpu()\r\n\t\tarr = [list(fsep()) for i in range(n)]\r\n\t\tdp = [0]*((1<<n))\r\n\t\tdp[-1] = 1\r\n\t\tfor mask in range(len(dp)-1,0,-1):\r\n\t\t\ttottal_fish = bin(mask).count(\"1\")\r\n\t\t\tif tottal_fish<2:\r\n\t\t\t\tcontinue\r\n\t\t\tfor i in range(n):\r\n\t\t\t\tfor j in range(i+1,n):\r\n\t\t\t\t\tif mask&(1<<j)!=0 and mask&(1<<i)!=0:\r\n\t\t\t\t\t\tdp[mask^(1<<j)] += (dp[mask]*arr[i][j])/((tottal_fish*(tottal_fish-1))//2)\r\n\t\t\t\t\t\tdp[mask^(1<<i)] += (dp[mask]*arr[j][i])/((tottal_fish*(tottal_fish-1))//2)\r\n\t\tfor i in range(n):\r\n\t\t\tprint(dp[1<<i],end=\" \")\r\n\t\tprint()\r\n\r\nif __name__ == '__main__':\r\n\t# sys.setrecursionlimit(2*10**5+50)\r\n\t# threading.stack_size(10**8)\r\n\t# threading.Thread(target=main).start()\r\n\tmain()", "N=int(input())\r\nA=[list(map(float,input().split())) for i in range(N)]\r\n\r\nDP=[0]*(1<<N)\r\nDP[-1]=1\r\nfor i in range((1<<N),-1,-1):\r\n count=0\r\n for j in range(N):\r\n if i & (1<<j) != 0:\r\n count+=1\r\n\r\n ALL=count*(count-1)//2\r\n \r\n for j in range(N):\r\n for k in range(j+1,N):\r\n if i & (1<<j) ==0 or i & (1<<k) ==0:\r\n continue\r\n DP[i ^ (1<<k)]+=DP[i]*A[j][k]/ALL\r\n DP[i ^ (1<<j)]+=DP[i]*A[k][j]/ALL\r\n\r\n #print(i,j,k,DP)\r\n \r\nANS=[]\r\nfor i in range(N):\r\n ANS.append(DP[1<<i])\r\n\r\nprint(*ANS)\r\n", "n = int(input())\r\nprobs = list()\r\nfor i in range(n): probs.append(list(map(float, input().split())))\r\ndp = [list([0 for i in range(1<<n)]) for i in range(n)]\r\ndp[0][(1<<n)-1] = 1\r\nak = [list() for i in range(n+1)]\r\nfor i in range(1<<n):\r\n ak[bin(i).count(\"1\")].append(i)\r\nfor k in range(1, n):\r\n for ele in ak[n-k+1]:\r\n for j in range(n):\r\n if (ele&(1<<j)):\r\n for w in range(n):\r\n if (ele&(1<<w)) and j != w:\r\n dp[k][ele-(1<<j)] += (dp[k-1][ele]*probs[w][j])/(((n-k+1)*(n-k))/2)\r\nfor i in range(n):\r\n print(dp[n-1][(1<<i)], end = \" \")\r\nprint()" ]

[ "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 x0,y0,x1,y1 = get_ints_in_variables()\r\n n = int(input())\r\n g = {}\r\n for i in range(0, n):\r\n r,a,b = get_ints_in_variables()\r\n for i in range(a, b+1):\r\n g[(r, i)] = -1\r\n\r\n g[(x0, y0)] = 0\r\n # {[i-1][0], [i-1][j-1], [i-1][j+1], [i][j-1], [i][j+1], [i+1][j], [i+1][j-1], [i+1][j+1]}\r\n dx = [-1, -1, -1, 0, 0, 1, 1, 1]\r\n dy = [0, -1, 1, -1, 1, 0, -1, 1]\r\n queue = [(x0, y0)]\r\n while len(queue):\r\n node = queue.pop(0)\r\n for j in range(8):\r\n v = (node[0]+dx[j], node[1]+dy[j])\r\n # print(v, \"v\")\r\n if not v in g:\r\n continue\r\n if v in g and g[v] != -1:\r\n continue\r\n g[v] = g[node]+1\r\n queue.append(v)\r\n print(g[(x1, y1)])\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "from collections import deque \r\n\r\nx,y,x2,y2 = map(int,input().split())\r\n\r\nn = int(input())\r\n\r\nkletki = {}\r\n\r\nfor i in range(n): \r\n\tr,a,b = map(int,input().split())\r\n\tfor j in range(a,b+1): \r\n\t\tkletki[(r,j)] = -1 \r\n\r\nkletki[(x,y)] = 0\r\n\r\nd = deque()\r\n\r\nd.append((x,y))\r\n\r\ndx = [ -1,-1,0,1,1,1,0,-1]\r\ndy = [0,-1,-1,-1,0,1,1,1]\r\n\r\nwhile(len(d)): \r\n\tm = d.popleft()\r\n\tfor k in range(8): \r\n\t\tn = (m[0]+dx[k], m[1]+dy[k])\r\n\t\tif n in kletki.keys():\r\n\t\t\tif m in kletki and kletki[n]==-1: \r\n\t\t\t\tkletki[n] = kletki[m] + 1\r\n\t\t\t\td.append(n)\r\n\r\nprint(kletki[(x2,y2)])", "from collections import defaultdict, Counter, deque\r\nimport threading\r\nimport sys\r\n# input = 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 x0, y0, x1, y1 = rl()\r\n n = ri()\r\n m = {}\r\n for _ in range(n):\r\n r, a, b = rl()\r\n for i in range(a, b+1):\r\n m[(r, i)] = -1\r\n dx = [-1, 1, 0, 0, -1, 1, -1, 1]\r\n dy = [0, 0, 1, -1, -1, 1, 1, -1]\r\n\r\n m[(x0, y0)] = 0\r\n q = [(x0, y0)]\r\n\r\n while q:\r\n cx, cy = q.pop(0)\r\n\r\n for i in range(8):\r\n nx = cx+dx[i]\r\n ny = cy+dy[i]\r\n if (nx, ny) in m.keys() and m[(nx, ny)] == -1:\r\n q.append((nx, ny))\r\n m[(nx, ny)] = m[(cx, cy)]+1\r\n print(m[(x1, y1)])\r\n\r\n\r\npass\r\n\r\n\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "Rows = [-1, -1, -1, 0, 0, 1, 1, 1]\r\nCols = [-1, 0, 1, -1, 1, -1, 0, 1]\r\n\r\n\r\ndef BFS(Adj, source, tagert):\r\n parent = {source: None}\r\n level = {source: 0}\r\n frontier = [source]\r\n while frontier:\r\n next = []\r\n for v in frontier:\r\n for i in range(8):\r\n n_r = Rows[i] + v[0]\r\n n_c = Cols[i] + v[1]\r\n neighbor = (n_r, n_c)\r\n if neighbor in Adj and neighbor not in parent:\r\n parent[neighbor] = v\r\n level[neighbor] = level[v] + 1\r\n next.append(neighbor)\r\n frontier = next\r\n if tagert not in parent:\r\n return -1\r\n return level[tagert]\r\n\r\n\r\ndef solver():\r\n a, b, c, d = map(int, input().split())\r\n source = (a, b)\r\n target = (c, d)\r\n n = int(input())\r\n Adj = {}\r\n Range = {}\r\n for i in range(n):\r\n r, a, b = map(int, input().split())\r\n for col in range(a, b + 1):\r\n if (r, col) not in Adj:\r\n Range[(r, col)] = True\r\n\r\n val = BFS(Range, source, target)\r\n print(val)\r\n\r\n\r\nsolver()\r\n", "x0, y0, x1, y1 = map(int, input().split())\nn = int(input())\n\ngraph = set()\nvisited = set()\n\nfor i in range(n):\n row, start, end = map(int, input().split())\n for col in range(start, end+1):\n graph.add((row, col))\ndirs = ((0,1), (0,-1), (1, 0), (-1, 0), (1,1), (1,-1), (-1, 1), (-1, -1))\n\nfrontier = [(x0, y0)]\ni = 0\nwhile frontier:\n level = []\n for x, y in frontier: \n if (x, y) == (x1, y1):\n print(i)\n exit()\n for dx, dy in dirs:\n if (x+dx, y+dy) in graph and (x+dx, y+dy) not in visited:\n visited.add((x+dx,y+dy))\n level.append((x+dx,y+dy))\n frontier = level\n i += 1\nprint(-1)\n", "X_MOVE_LIST = [-1, -1, -1, 1, 1, 1, 0, 0]\nY_MOVE_LIST = [-1, 0, 1, -1, 0, 1, 1, -1]\n\nDIC_ALLOWED_POS_BY_ROWS = {}\nDIC_DIST = {}\n\nMAX_POS = 1000000000\n\ndef verify_ends(num):\n return num > 0 and num <= MAX_POS\n\ndef verify_pos(pos): \n if verify_ends(pos[0]) and verify_ends(pos[1]):\n allowed_pos = DIC_ALLOWED_POS_BY_ROWS.get(pos[0]) or []\n for row_allowed in allowed_pos:\n if row_allowed and \\\n pos[1] >= row_allowed[0] and \\\n pos[1] <= row_allowed[1]:\n return True\n\n return False\n\ndef king_search_way(pos0, posf):\n queue = [pos0]\n DIC_DIST[pos0] = 0\n while queue:\n pos = queue.pop(0)\n for i in range(8):\n pos_cache = (pos[0] + X_MOVE_LIST[i], pos[1] + Y_MOVE_LIST[i])\n if verify_pos(pos_cache):\n if not DIC_DIST.get(pos_cache) or \\\n DIC_DIST.get(pos_cache) > DIC_DIST.get(pos) + 1:\n DIC_DIST[pos_cache] = DIC_DIST[pos] + 1\n queue.append(pos_cache)\n\n\n if DIC_DIST.get(posf):\n return DIC_DIST.get(posf)\n \n return -1\n\n \n return result \n\n\nX0, Y0, X1, Y1 = map(int, input().split())\nQNT_POS = int(input())\n\n\nfor _ in range(QNT_POS):\n r, x, y = map(int, input().split())\n if DIC_ALLOWED_POS_BY_ROWS.get(r):\n DIC_ALLOWED_POS_BY_ROWS[r].append((x, y))\n else: DIC_ALLOWED_POS_BY_ROWS[r] = [(x, y)]\n\nprint(king_search_way((X0, Y0), (X1, Y1)))\n", "from collections import deque\n\nx0,y0,x1,y1 = list(map(int, input().split()))\nn = int(input())\nallowed = {}\nfor i in range(n):\n r,a,b = list(map(int, input().split()))\n for j in range(a,b+1):\n allowed[(r,j)] = True\n\nvisited = {}\nq = deque()\nq.append((x0, y0))\nvisited[(x0, y0)] = 0\ndir = [(-1, 0), (1, 0), (0, -1), (0, 1), (-1, -1), (-1, 1), (1, -1), (1, 1)]\nresult = -1\nwhile len(q) > 0:\n x,y = q.popleft()\n original_dist = visited[(x, y)]\n if x == x1 and y == y1:\n result = original_dist\n break\n for i in range(len(dir)):\n dx, dy = dir[i]\n nx, ny = x+dx, y+dy\n if (nx, ny) in allowed and (nx, ny) not in visited:\n q.append((nx,ny))\n visited[(nx, ny)] = original_dist + 1\nprint(result)\n\n \t \t\t\t \t \t\t\t \t \t\t \t", "x0,y0,x1,y1=map(int,input().split())\r\nallowed=set()\r\ndis={(x0,y0):0}\r\nqueue=[(x0,y0)]\r\nfor i in range(int(input())):\r\n\tr,a,b=map(int,input().split())\r\n\tfor j in range(a,b+1):\r\n\t\tallowed.add((r,j))\r\nwhile queue!=[]:\r\n\tcx,cy=queue[0][0],queue[0][1]\r\n\tqueue.pop(0)\r\n\tfor x in range(-1,2):\r\n\t\tfor y in range(-1,2):\r\n\t\t\tnx,ny=cx+x,cy+y\r\n\t\t\tif (nx,ny) in allowed and (nx,ny) not in dis:\r\n\t\t\t\tqueue.append((nx,ny))\r\n\t\t\t\tdis[(nx,ny)]=dis[(cx,cy)]+1\r\nif (x1,y1) not in dis:\r\n\tprint(-1)\r\nelse:\r\n\tprint(dis[(x1,y1)])", "from collections import defaultdict, namedtuple,deque\nimport sys\ndef bfs(sx,sy,tx,ty,intervals):\n dequePos = deque([(sx,sy)])\n intervals[(sx,sy)] = 0\n \n while len(dequePos):\n row,col = dequePos.popleft()\n u = (row,col)\n ady = []\n movements = [(1,0),(-1,0),(0,1),(0,-1),(1,1),(-1,1),(1,-1),(-1,-1)]\n\n # down\n for dx,dy in movements:\n if intervals.get((row+dx,col+dy),False):\n ady.append((row+dx,col+dy))\n \n for v in ady:\n if v in intervals and intervals[v] == -1:\n intervals[v] = intervals[u]+1\n dequePos.append(v)\n return intervals.get((tx,ty),-1)\n\n\ndef main():\n input = sys.stdin.readline\n intervals = dict\n sx,sy,tx,ty = map(int,input().split())\n n = int(input())\n intervals = defaultdict(list)\n for _ in range(n):\n r,ys,ye = map(int,input().split())\n for i in range(ys,ye+1):\n intervals[(r,i)] = -1\n \n print(bfs(sx,sy,tx,ty,intervals))\nmain()", "import sys, os.path\r\nfrom collections import*\r\nfrom heapq import *\r\nfrom copy import*\r\nimport math\r\nmod=10**9+7\r\nread = lambda: map(int, input().split())\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\nl1=[0,0,1,1,1,-1,-1,-1]\r\nl2=[1,-1,-1,0,1,-1,0,1]\r\n\r\nx1,y1,x2,y2=read()\r\nn=int(input())\r\npath=defaultdict(int)\r\nfor i in range(n):\r\n r,a,b=read()\r\n for j in range(a,b+1):\r\n path[(r,j)]=1\r\nvis=defaultdict(int)\r\nq=deque()\r\nq.append((x1,y1))\r\nvis[(x1,x2)]=1\r\ndis=defaultdict(int)\r\ndis[(x1,y1)]=0\r\nflag=0\r\nwhile(len(q)):\r\n x,y=q.popleft()\r\n for k in range(8):\r\n p1,p2=x+l1[k],y+l2[k]\r\n if not vis[(p1,p2)] and path[(p1,p2)]==1:\r\n q.append((p1,p2))\r\n dis[(p1,p2)]=dis[(x,y)]+1\r\n vis[(p1,p2)]=1\r\n if (p1,p2)==(x2,y2):\r\n flag=1\r\n break\r\n if(flag==1):\r\n break\r\nans=dis[(x2,y2)]\r\nif(ans==0):\r\n print(-1)\r\nelse:\r\n print(ans)", "\r\n# mod=10**9 +7\r\n# from itertools import *\r\nimport math\r\n# import sys\r\n# sys.setrecursionlimit(10**6)\r\nfrom collections import *\r\n# from heapq import *\r\n# for _ in range(int(input())):\r\n# n=int(input())\r\n# s=input()\r\n# n,m=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\nmaxi=10**9 +1\r\ns1,s2,e1,e2=map(int,input().split())\r\nn=int(input())\r\nald=defaultdict(list)\r\nfor _ in range(n):\r\n r,s,e=map(int,input().split())\r\n ald[r].append([s,e])\r\n\r\ndef chkseg(a,b):\r\n for i,j in ald[a]:\r\n if i<=b<=j:\r\n return 1\r\n return 0\r\n\r\nq=deque()\r\nmoves=0\r\nq.append([s1,s2,moves])\r\nf=0\r\nvis=set()\r\nwhile q:\r\n i,j,moves=q.popleft()\r\n cand=[[i,j+1],[i,j-1],[i+1,j],[i-1,j],[i+1,j+1],[i-1,j-1],[i+1,j-1],[i-1,j+1]]\r\n for a,b in cand:\r\n if 0<a<maxi and 0<b<maxi and (a,b) not in vis and a in ald and chkseg(a,b):\r\n if [a,b]==[e1,e2]:\r\n print(moves+1)\r\n f=1\r\n break\r\n else:\r\n vis.add((a,b))\r\n q.append([a,b,moves+1])\r\n if f:\r\n break\r\nif not f:\r\n print(-1)\r\n\r\n# #For printing array\r\n# for elm in ans:\r\n# print(elm,end=' ')\r\n# print(end='\\n')\r\n\r\n# #For returning in kickstart\r\n# print('Case #{}:'.format(t+1),ans) \r\n\r\n# # For printing grid\r\n# for i in range(h):\r\n# print(*a[i],sep=\"\")\r\n# print()\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# ip = open(\"testdata.txt\", \"r\")\n\n# def input():\n# \treturn ip.readline().strip()\n\nfrom collections import deque, defaultdict\n\nx0, y0, x1, y1 = map(int, input().split())\n\nallowed = defaultdict(list)\nallowed[x0].append([y0, y0])\nallowed[x1].append([y1, y1])\n\nm = int(input())\n\nfor _ in range(m):\n\tr, a, b = map(int, input().split())\n\tallowed[r].append([a, b])\n\ndef get_valid_moves(x, y):\n\tvalid_pos = set()\n\tif x in allowed:\n\t\tfor l, r in allowed[x]:\n\t\t\tif l <= y-1 <= r:\n\t\t\t\tvalid_pos.add((x, y-1))\n\t\t\tif l <= y+1 <= r:\n\t\t\t\tvalid_pos.add((x, y+1))\n\tif x-1 in allowed:\n\t\tfor l, r in allowed[x-1]:\n\t\t\tif l <= y-1 <= r:\n\t\t\t\tvalid_pos.add((x-1, y-1))\n\t\t\tif l <= y <= r:\n\t\t\t\tvalid_pos.add((x-1, y))\n\t\t\tif l <= y+1 <= r:\n\t\t\t\tvalid_pos.add((x-1, y+1))\n\tif x+1 in allowed:\n\t\tfor l, r in allowed[x+1]:\n\t\t\tif l <= y-1 <= r:\n\t\t\t\tvalid_pos.add((x+1, y-1))\n\t\t\tif l <= y <= r:\n\t\t\t\tvalid_pos.add((x+1, y))\n\t\t\tif l <= y+1 <= r:\n\t\t\t\tvalid_pos.add((x+1, y+1))\n\treturn valid_pos\n\ndef bfs():\n\tglobal x0, y0, x1, y1\n\tdq = deque([(x0, y0)])\n\tvis_set = {(x0, y0), }\n\tlevel = defaultdict(int)\n\twhile dq:\n\t\tx0, y0 = dq.popleft()\n\t\tfor x, y in get_valid_moves(x0, y0):\n\t\t\tif not (x, y) in vis_set:\n\t\t\t\tlevel[(x, y)] = level[(x0, y0)] + 1\n\t\t\t\tif (x, y)==(x1, y1):\n\t\t\t\t\treturn level[(x, y)]\n\t\t\t\tvis_set.add((x, y))\n\t\t\t\tdq.append((x, y))\n\treturn -1\n\nans = bfs()\nprint(ans)", "sr, sc, er, ec = map(int, input().split())\r\nn = int(input())\r\n\r\nrelevant = set()\r\nfor _ in range(n):\r\n R, l, r = map(int, input().split())\r\n for c in range(l, r + 1):\r\n relevant.add((R, c))\r\n\r\ndist = {(sr, sc): 0}\r\nq = [(sr, sc)]\r\nwhile q:\r\n r, c = q.pop(0)\r\n for dr in [-1, 0, 1]:\r\n for dc in [-1, 0, 1]:\r\n nr, nc = r + dr, c + dc\r\n if (nr, nc) in relevant and (nr, nc) not in dist:\r\n dist[nr, nc] = dist[r, c] + 1\r\n q.append((nr, nc))\r\n\r\nif (er, ec) in dist:\r\n print(dist[er, ec])\r\nelse:\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline \r\n\r\nx0, y0, x1, y1 = map(int, input().split()) \r\nn = int(input()) \r\nv = set() \r\nfor i in range(n):\r\n r, a, b = map(int, input().split()) \r\n for j in range(a, b + 1):\r\n v.add((r, j)) \r\n \r\n \r\nd = {} \r\nq = [(x0, y0)] \r\nd[x0, y0] = 0\r\ndx = [0,0,1,1,1,-1,-1,-1]\r\ndy = [-1,1,-1,1,0,-1,1,0] \r\nwhile(q):\r\n x, y = q.pop(0) \r\n p = d[x, y] \r\n for i in range(8):\r\n nx = x + dx[i] \r\n ny = y + dy[i] \r\n if((nx,ny) in v and (nx,ny) not in d):\r\n q.append((nx, ny)) \r\n d[nx, ny] = p + 1 \r\nif((x1, y1) in d):\r\n print(d[x1, y1]) \r\nelse:\r\n print(-1)\r\n", "from collections import deque, defaultdict\nimport itertools\n\nx, y, xf, yf = map(int, input().split())\n\nn = int(input())\n\nallowed_cell = set()\n\nfor _ in range(n):\n r, a, b = map(int, input().split())\n for cell in range(a, b+1):\n allowed_cell.add((r, cell))\n\n\n\ndst = defaultdict(lambda: -1)\ndst[(x,y)] = 0\nq = deque()\nq.append((x, y))\n\n\n\nwhile len(q):\n i, j = q.popleft()\n\n for d in itertools.product((0,1, -1), repeat=2):\n ni = i + d[0]\n nj = j + d[1]\n\n if 0 < ni <= 10**9 and 0 <nj <= 10**9 and (ni, nj) in allowed_cell and dst[(ni,nj)] == -1:\n dst[(ni, nj)] = dst[(i, j)] + 1\n q.append((ni, nj))\n if (ni, nj) == (xf, yf):\n break\n\n\nprint(dst[(xf, yf)])\n\n\n\n", "from queue import Queue\r\n\r\nMAX = 10**9\r\n\r\ndx = [1, 0, -1, 0, -1, 1, -1, 1]\r\ndy = [0, 1, 0, -1, -1, 1, 1, -1]\r\n\r\ndef bfs(src, dst):\r\n q = Queue()\r\n q.put(src)\r\n while not q.empty():\r\n x, y = q.get()\r\n if x == dst[0] and y == dst[1]:\r\n break\r\n for i in range(8):\r\n nx = x + dx[i]\r\n ny = y + dy[i]\r\n if nx in range(MAX + 1) and ny in range(MAX + 1) and (nx, ny) in valid_move and valid_move[(nx, ny)] == -1:\r\n valid_move[(nx, ny)] = valid_move[(x, y)] + 1\r\n q.put((nx, ny))\r\n return valid_move[dst]\r\n\r\npositions = list(map(int, input().split()))\r\nn = int(input())\r\nvalid_move = {}\r\n\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n for num in range(a, b + 1):\r\n valid_move[(r, num)] = -1\r\n\r\nvalid_move[(positions[0], positions[1])] = 0\r\nvalid_move[(positions[2], positions[3])] = -1\r\n\r\nprint(bfs((positions[0], positions[1]), (positions[2], positions[3])))\r\n\r\n\r\n\r\n", "from collections import deque\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nxadj = [0, 0, -1, 1, -1, -1, 1, 1]\r\nyadj = [1, -1, 0, 0, -1, 1, -1, 1]\r\nres, vis = set(), dict()\r\nx0, y0, x1, y1, = map(int, input().split())\r\nn = int(input())\r\nfor seg in range(n):\r\n r, a, b, = map(int, input().split())\r\n for c in range(a, b+1):\r\n res.add((r, c))\r\n\r\npnts = deque()\r\npnts.append((x0, y0, 0))\r\nvis[(x0, y0)] = 0\r\nwhile len(pnts) > 0:\r\n cur = pnts.popleft()\r\n for i in range(8):\r\n pos = (cur[0] + xadj[i], cur[1] + yadj[i])\r\n if pos in res and pos not in vis:\r\n pnts.append((pos[0], pos[1], cur[2] + 1))\r\n vis[pos] = cur[2] + 1\r\nprint(vis[(x1, y1)] if (x1, y1) in vis else -1)\r\n", "from collections import *\nimport bisect\nimport heapq\nimport sys\nfrom math import inf\n\ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n\ndef isPossiblePlace(x, y):\n\tfor my_list in allowed[x]:\n\t\ta, b = my_list\n\t\tif y >= a and y <= b:\n\t\t\treturn True\n\treturn False\n\ndef bfs(x0, y0, x1, y1):\n\tvisited = defaultdict(list)\n\tto_visit = deque()\n\tto_visit.append((x0, y0, 0))\n\tvisited[x0].append(y0)\n\twhile to_visit:\n\t\tx,y,d = to_visit.popleft()\n\t\tfor dx in [-1,0,1]:\n\t\t\tfor dy in [-1,0,1]:\n\t\t\t\tif abs(dx) + abs(dy) != 0:\n\t\t\t\t\tnx = x + dx\n\t\t\t\t\tny = y + dy\n\t\t\t\tif nx >= 1 and nx <= 10**9 and ny >= 1 and ny <= 10**9:\n\t\t\t\t\tif isPossiblePlace(nx, ny):\n\t\t\t\t\t\tif (nx, ny) == (x1,y1):\n\t\t\t\t\t\t\treturn d + 1\n\t\t\t\t\t\tif ny not in visited[nx]:\n\t\t\t\t\t\t\tvisited[nx].append(ny)\n\t\t\t\t\t\t\tto_visit.append((nx, ny, d + 1))\n\n\treturn -1\n\n\t\t\t\t\t\t\t\n\n\n\nx0, y0, x1, y1 = rl()\nn = ri()\n\nallowed = defaultdict(set)\nfor _ in range(n):\n\ti, start, end = rl()\n\t\n\t\n\tallowed[i].add((start, end))\n\nprint(bfs(x0, y0, x1, y1))\n\n\n\t\n\n", "import queue\r\n\r\nif __name__ == \"__main__\":\r\n x1, y1, x2, y2 = map(int, input().split())\r\n n = int(input())\r\n PathDis = {}\r\n dx = [-1, -1, -1, 1, 1, 1, 0, 0]\r\n dy = [-1, 0, 1, -1, 0, 1, 1, -1]\r\n while n:\r\n r, a, b = map(int, input().split())\r\n for i in range(a, b + 1):\r\n PathDis[(r, i)] = -1\r\n n -= 1\r\n def bfs(start):\r\n PathDis[start] = 0\r\n q = queue.Queue()\r\n q.put(start)\r\n while not q.empty():\r\n u = q.get()\r\n for i in range(8):\r\n ux = u[0] + dx[i]\r\n uy = u[1] + dy[i]\r\n check = (ux, uy)\r\n if check in PathDis.keys() and PathDis[check] == -1:\r\n PathDis[check] = PathDis[u] + 1\r\n q.put(check)\r\n if check == (x2, y2):\r\n print( PathDis[check])\r\n exit()\r\n bfs((x1, y1))\r\n if PathDis[(x2, y2)] != -1:\r\n print(PathDis[(x2, y2)])\r\n else:\r\n print(-1)\r\n", "from collections import deque\n\ndef neighs(x0, x1):\n return [(x0, x1 + 1),\n (x0 + 1, x1 + 1),\n (x0 + 1, x1),\n (x0 + 1, x1 - 1),\n (x0, x1 - 1),\n (x0 - 1, x1 - 1),\n (x0 - 1, x1),\n (x0 - 1, x1 + 1)]\n \n\ndef bfs(x0, x1, y0, y1, allowed):\n fifo = deque([(x0, x1, 0)])\n while fifo:\n x0, x1, d = fifo.pop()\n for n0, n1 in neighs(x0, x1):\n if (n0, n1) in allowed:\n allowed.remove((n0, n1))\n fifo.appendleft((n0, n1, d + 1))\n if (x0, x1) == (y0, y1):\n return d\n return -1\n\ndef solve():\n x0, x1, y0, y1 = map(int, input().split())\n n = int(input())\n allowed = set()\n for _ in range(n):\n r, a, b = map(int, input().split())\n for c in range(a, b+1):\n allowed.add((r, c))\n val = bfs(x0, x1, y0, y1, allowed)\n print(val)\n\n\nif __name__ == '__main__':\n solve()\n", "start_x, start_y, dest_x, dest_y = list(map(int, input().split()))\r\nn = int(input())\r\nallowed = []\r\n\r\ndef moves(A, s_x, s_y): \r\n A.append((s_x, s_y + 1))\r\n A.append((s_x + 1, s_y + 1))\r\n A.append((s_x + 1, s_y))\r\n\r\n if s_x - 1 >= 0:\r\n A.append((s_x - 1, s_y))\r\n A.append((s_x - 1, s_y + 1))\r\n if s_y - 1 >= 0:\r\n A.append((s_x - 1, s_y - 1))\r\n\r\n if s_y - 1 >= 0:\r\n A.append((s_x, s_y - 1))\r\n A.append((s_x + 1, s_y - 1))\r\n\r\n return A\r\n\r\ndef Adj(s_x, s_y, n):\r\n A = {}\r\n A[s_x, s_y] = []\r\n A[s_x, s_y] = moves(A[(s_x, s_y)], s_x, s_y)\r\n for k in range(n):\r\n row, i, j = list(map(int, input().split()))\r\n for p in range(i, j + 1):\r\n A[row, p] = []\r\n A[row, p] = moves(A[(row, p)], row, p)\r\n return A\r\n\r\nA = Adj(start_x, start_y, n)\r\n\r\ndef bfs(A, s_x, s_y):\r\n parent = {}\r\n for v in A.keys():\r\n parent[v] = None\r\n \r\n parent[(s_x, s_y)] = (s_x, s_y)\r\n level = [[(s_x, s_y)]]\r\n while len(level[-1]) > 0:\r\n level.append([])\r\n for u in level[-2]:\r\n for v in A[u]:\r\n if v in parent:\r\n if parent[v] is None:\r\n parent[v] = u\r\n level[-1].append(v)\r\n return parent\r\n\r\ndef unweighted_shortest_path(A, s_x, s_y, d_x, d_y):\r\n parent = bfs(A, s_x, s_y)\r\n t = (d_x, d_y)\r\n if parent[t] == None:\r\n print(-1)\r\n return \r\n count = 0\r\n while t != (s_x, s_y):\r\n t = parent[t]\r\n count += 1\r\n print(count)\r\n\r\nunweighted_shortest_path(A, start_x, start_y, dest_x, dest_y)", "from collections import deque\r\n\r\nx_start, y_start, x_end, y_end = [int(x) for x in input().split()]\r\nn = int(input())\r\nmoves = {}\r\nfor _ in range(n):\r\n r, a, b = [int(x) for x in input().split()]\r\n for j in range(a, b + 1):\r\n moves[(r, j)] = -1\r\n\r\np_start = x_start, y_start\r\nd = deque([p_start])\r\nmoves[p_start] = 0\r\nwhile d:\r\n x1, y1 = d.popleft()\r\n m = moves[(x1, y1)]\r\n for p2 in [(x1 + dx, y1 + dy) for dx in [-1, 0, 1] for dy in [-1, 0, 1]]:\r\n if (p2 in moves) and (moves[p2] == -1):\r\n d.append(p2)\r\n moves[p2] = m + 1\r\n \r\nprint(moves[(x_end, y_end)])\r\n ", "from sys import stdin\r\nfrom collections import *\r\n\r\ndx, dy = [-1, 0, 1, 0, 1, -1, 1, -1], [0, 1, 0, -1, 1, -1, -1, 1]\r\n\r\n\r\ndef arr_inp(n):\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef valid(x, y):\r\n return True if x >= 0 and x <= 1000000000 and y >= 0 and y <= 1000000000 and mem[x, y] else False\r\n\r\n\r\ndef bfs_util():\r\n queue, visit, ans = deque([[x0, y0, 0]]), defaultdict(int), float('inf')\r\n\r\n while queue:\r\n x, y, move = queue.popleft()\r\n\r\n if x == x1 and y == y1:\r\n ans = min(ans, move)\r\n continue\r\n\r\n for i in range(8):\r\n nx, ny = x + dx[i], y + dy[i]\r\n\r\n if valid(nx, ny) and not visit[(nx, ny)]:\r\n queue.append([nx, ny, move + 1])\r\n visit[(nx, ny)] = 1\r\n\r\n return ans if ans != float('inf') else -1\r\n\r\n\r\nx0, y0, x1, y1 = arr_inp(1)\r\nmem, n = defaultdict(int), int(input())\r\n\r\nfor i in range(n):\r\n r, a, b = arr_inp(1)\r\n for j in range(a, b + 1):\r\n mem[r, j] = 1\r\n\r\nprint(bfs_util())", "import sys\nfrom collections import deque\n\ndef solve():\n xadj, yadj = [0, 0, - 1, 1, -1, -1, 1, 1], [1, -1, 0, 0, -1, 1, -1, 1]\n x0, y0, x1, y1, = rv()\n n, = rv()\n good = set()\n visited = dict()\n for seg in range(n):\n r, a, b, = rv()\n for c in range(a, b + 1): good.add((r, c))\n points = deque()\n points.append((x0, y0, 0))\n visited[(x0, y0)] = 0\n while len(points) > 0:\n cur = points.popleft()\n for i in range(8):\n pos = (cur[0] + xadj[i], cur[1] + yadj[i])\n if pos in good and pos not in visited:\n points.append((pos[0], pos[1], cur[2] + 1))\n visited[pos] = cur[2] + 1\n print(visited[(x1, y1)] if (x1, y1) in visited else - 1)\n\n\n\n\n\n\n\ndef prt(l): return print(''.join(l))\ndef rv(): return map(int, input().split())\ndef rl(n): return [list(map(int, input().split())) for _ in range(n)]\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "from collections import deque, defaultdict\r\n\r\nx0,y0,x1,y1 = [int(_) for _ in input().split()]\r\n\r\nn = int(input())\r\n\r\npoints = set()\r\nfor _ in range(n):\r\n r,a,b = [int(_) for _ in input().split()]\r\n for i in range(a,b+1):\r\n points.add((r,i))\r\n\r\nvisited = set()\r\nqueue = deque()\r\nqueue.append((x0,y0))\r\n\r\ndx = [ 1, 0, -1, 0, -1, 1, -1, 1 ]\r\ndy = [0, 1, 0, -1, -1, 1, 1, -1]\r\n\r\ndep = 0 \r\n\r\n\r\nflag = False\r\nwhile(len(queue)):\r\n\r\n sz = len(queue)\r\n while(sz):\r\n cur = queue.popleft()\r\n for i in range(8):\r\n nx = cur[0] + dx[i]\r\n ny = cur[1] + dy[i]\r\n \r\n if (nx,ny) not in points or (nx,ny) in visited:\r\n continue\r\n \r\n queue.append((nx,ny))\r\n visited.add((nx,ny))\r\n if (nx==x1 and ny==y1):\r\n flag = True\r\n \r\n if(flag):\r\n break\r\n \r\n if flag:\r\n break\r\n \r\n sz -= 1\r\n \r\n if flag:\r\n break\r\n \r\n dep += 1\r\n\r\nprint(dep+1) if flag else print(-1)", "import sys\r\nimport collections\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nints = lambda: list(map(int, input().split()))\r\n\r\nx0, y0, x1, y1 = ints()\r\nallowed = {}\r\nn = int(input())\r\nfor _ in range(n):\r\n r, a, b = ints()\r\n for i in range(a, b + 1):\r\n allowed[(r, i)] = True\r\n\r\nq = collections.deque([(x0, y0)])\r\nvisited = {(x0, y0): True}\r\ndepth = 0\r\n\r\ndirs = [(1, 0), (1, 1), (1, -1), (0, 1), (0, -1), (-1, 0), (-1, 1), (-1, -1)]\r\nflag = False\r\nwhile q and not flag:\r\n sz = len(q)\r\n depth += 1\r\n for _ in range(sz):\r\n i, j = q.popleft()\r\n\r\n for d in dirs:\r\n ni, nj = i + d[0], j + d[1]\r\n\r\n if 1 <= ni <= 10 ** 9 and 1 <= nj <= 10 ** 9 and (ni, nj) in allowed and (ni, nj) not in visited:\r\n visited[(ni, nj)] = True\r\n q.append((ni, nj))\r\n if ni == x1 and nj == y1:\r\n flag = True\r\nprint(depth) if flag else print(\"-1\")", "from collections import deque\n\nx0,y0,x1,y1=list(map(int, input().split()))\nn=int(input())\nallowed={}\nfor i in range(n):\n r,a,b=list(map(int,input().split()))\n for j in range(a,b+1):\n allowed[(r,j)]=True\nvisited={}\nq=deque()\nq.append((x0,y0))\nvisited[(x0,y0)]=0\ndire=[(-1,0),(1,0),(0,-1),(0,1),(-1,-1),(-1,1),(1,1),(1,-1)]\nresult=-1;\nwhile len(q)>0:\n x,y=q.popleft()\n original_dist=visited[(x,y)]\n if x==x1 and y==y1:\n result=original_dist;\n break;\n for i in range(len(dire)):\n dx,dy=dire[i]\n nx,ny=x+dx,y+dy\n if (nx,ny) in allowed and (nx,ny) not in visited:\n q.append((nx,ny))\n visited[(nx,ny)]=original_dist+1\nprint(result) \n\t \t\t\t\t \t \t \t\t\t \t\t \t\t \t", "from sys import stdin\n\n\ndef main():\n x, y, u, v = map(int, input().split())\n input()\n rows = set()\n for st in stdin.read().splitlines():\n r, a, b = map(int, st.split())\n rows.update((r, x) for x in range(a, b + 1))\n nxt, visited, cnt = [(x, y)], {(x, y)}, 0\n while nxt:\n cur, nxt = nxt, []\n for x, y in cur:\n if x == u and y == v:\n print(cnt)\n return\n for xy in (x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1), (x - 1, y - 1), (x + 1, y - 1), (x - 1, y + 1), (\n x + 1, y + 1):\n if xy in rows and xy not in visited:\n visited.add(xy)\n nxt.append(xy)\n cnt += 1\n print(-1)\n\n\nif __name__ == '__main__':\n main()\n", "def main():\r\n import sys\r\n from collections import deque\r\n x0,y0,x1,y1 = map(int,input().strip().split())\r\n n = int(input())\r\n S = list(map(int,sys.stdin.read().strip().split()))\r\n h = set()\r\n d = {}\r\n \r\n def getchild(a):\r\n c = []\r\n xc = [1,-1,0,0,1,1,-1,-1]\r\n yc = [0,0,1,-1,1,-1,1,-1]\r\n for i in range(8):\r\n if ((a[0]+xc[i],a[1]+yc[i]) in h):\r\n c.append((a[0]+xc[i],a[1]+yc[i]))\r\n return(c)\r\n \r\n \r\n class g:\r\n def __init__(self):\r\n self.depth = -1\r\n self.child = []\r\n \r\n for i in range(0,3*n,3):\r\n r,a,b = S[i],S[i+1],S[i+2]\r\n for j in range(a,b+1):\r\n h.add((r,j))\r\n d[(r,j)] = g()\r\n king = d[(x0,y0)]\r\n destination = d[(x1,y1)]\r\n for i in h:\r\n d[i].child = getchild(i)\r\n \r\n Q = deque()\r\n Q.append(king)\r\n king.depth = 0\r\n while(len(Q)>0):\r\n a = Q.popleft()\r\n for i in a.child:\r\n if d[i].depth==-1:\r\n Q.append(d[i])\r\n d[i].depth=a.depth+1\r\n if a==destination:\r\n break\r\n print(destination.depth)\r\n\r\nmain()", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom heapq import *\r\nfrom collections import defaultdict\r\n\r\nx0,y0,x1,y1 = map(int, input().split())\r\nN = int(input())\r\nmr,mc=min(x0,x1),min(y0,y1)\r\nA = []\r\nfor _ in range(N):\r\n r,a,b = map(int, input().split())\r\n A.append((r,a,b))\r\n mr = min(mr,r)\r\n mc = min(mc, a)\r\n \r\nx0-=mr\r\nx1-=mr\r\ny0-=mc\r\ny1-=mc\r\n\r\nP = set()\r\nfor r,a,b in A:\r\n r-=mr\r\n a-=mc\r\n b-=mc\r\n for i in range(a,b+1):\r\n P.add((r,i))\r\n\r\ndist = defaultdict(lambda :float('inf'))\r\nv = [(0,x0,y0)]\r\nwhile v:\r\n d,x,y = heappop(v)\r\n if x==x1 and y==y1:\r\n exit(print(d))\r\n if d>=dist[(x,y)]:continue\r\n dist[(x,y)] = d\r\n \r\n for r in range(-1,2):\r\n for c in range(-1,2):\r\n nx = x+r\r\n ny = y+c\r\n key = (nx,ny)\r\n if key in P and dist[key]>d+1:\r\n v.append((d+1,nx,ny))\r\n \r\nprint(-1)", "from collections import defaultdict, deque\r\n\r\nx1, y1, x2, y2 = map(int, input().split())\r\nn = int(input())\r\nd = defaultdict(bool)\r\nv = defaultdict(bool)\r\nfor i in range(n):\r\n r, a,b = map(int, input().split())\r\n for j in range(a, b+1):\r\n d[(r,j)] = True\r\n\r\nq = deque()\r\n\r\nrA = [0,1,0,-1,-1,1,-1,1]\r\nrB = [1,0,-1,0,1,-1,-1,1]\r\nq.append((x1, y1, 0))\r\nv[(x1, y1)] = True\r\nwhile q:\r\n x,y, p = q.popleft()\r\n if (x,y) == (x2,y2):\r\n print(p)\r\n break\r\n\r\n for a, b in zip(rA, rB):\r\n if d[(x+a,y+b )] and not v[(x+a, y+b)]:\r\n q.append((x+a, y+b, p+1))\r\n v[(x+a, y+b)] = True\r\nelse:\r\n print(\"-1\")", "def approved(coord):\n\tif(coord[0] in allowed):\n\t\tfor pair in allowed[coord[0]]:\n\t\t\tif(pair[0] <= coord[1] <= pair[1]):\n\t\t\t\treturn True\n\treturn False\n\n\ndef neighbours(cur):\n\tcandidates = { (cur[0] - 1, cur[1] - 1),\n\t(cur[0] - 1, cur[1]),\n\t(cur[0] - 1, cur[1] + 1),\n\t(cur[0], cur[1] - 1),\n\t(cur[0], cur[1] + 1),\n\t(cur[0] + 1, cur[1] - 1),\n\t(cur[0] + 1, cur[1]),\n\t(cur[0] + 1, cur[1] + 1)}\n\treturn {i for i in candidates if approved(i)}\n\n\nx0, y0, x1, y1 = map(int, input().split())\nn = int(input())\nallowed = {}\nfor i in range(n):\n\tr, a, b = map(int, input().split())\n\tif r not in allowed:\n\t\tallowed[r] = [(a,b)]\n\telse:\n\t\tallowed[r].append((a,b))\n\nqueue = [(x0, y0)]\nvisited = {(x0, y0): 0} # contains all where visited = True\n\nsteps = 0\n\nwhile(len(queue) > 0):\n\tcur = queue.pop(0)\n\tfor nbor in neighbours(cur):\n\t\tif(nbor not in visited):\n\t\t\tqueue.append(nbor)\n\t\t\tvisited[nbor] = visited[cur] + 1\n\nif((x1, y1) in visited):\n\tprint(visited[(x1, y1)])\nelse:\n\tprint(-1)\n", "import bisect\nfrom collections import deque, defaultdict\n\nx0, y0, x1, y1 = map(int, input().split())\nn = int(input())\nallowed = []\n\nh = 0\nw = 0\n\nfor _ in range(n):\n r,a,b = map(int, input().split())\n allowed.append((r,a,b))\n h = max(h, r)\n w = max(w, b)\n\nh += 1\nw += 1\n\nnx0 = x0\nny0 = y0\nnx1 = x1\nny1 = y1\n\nd = defaultdict(lambda: float(\"inf\"))\n\nd[(nx0,ny0)] = 0\nallowed.sort(key=lambda x: x[0])\ndef check(allowed, i, j):\n idx = bisect.bisect_left(allowed, (i, ))\n while idx < len(allowed):\n r, a, b = allowed[idx]\n if r != i:\n break\n if a <= j <= b:\n return True\n idx += 1\n return False\n\nmoves = [(1, 0), (-1, 0), (0, 1), (0, -1), (1, 1), (1, -1), (-1, 1), (-1, -1)]\n\nqueue = deque()\nqueue.append((nx0, ny0))\nwhile len(queue) != 0:\n i, j = queue.popleft()\n for di, dj in moves:\n ni = i + di\n nj = j + dj\n if 0 <= ni < h and 0 <= nj < w and d[(ni, nj)] == float(\"inf\") and check(allowed, ni, nj):\n d[(ni, nj)] = d[(i, j)] + 1\n queue.append((ni, nj))\n if ni == nx1 and nj == ny1:\n print(d[(ni,nj)])\n exit()\nprint(-1)\n\n \n \n \n \n \n", "from bisect import bisect_left\r\nx0,y0,x1,y1=map(int,input().split())\r\nn=int(input())\r\nallowed={}\r\nfor i in range(n):\r\n r,a,b=map(int,input().split())\r\n if r-1 not in allowed:\r\n allowed[r-1]=[]\r\n allowed[r-1].append([a-1,b-1])\r\nfor each in allowed:\r\n i=0\r\n allowed[each].sort()\r\n while i<len(allowed[each])-1:\r\n if allowed[each][i][1]>=allowed[each][i+1][0]:\r\n allowed[each][i][1]=max(allowed[each][i][1],allowed[each][i+1][1])\r\n del allowed[each][i+1]\r\n else:\r\n i+=1\r\ndef code(x,y):\r\n return x*10**9+y\r\nq=[[code(x0-1,y0-1),0]]\r\nv={code(x0-1,y0-1)}\r\nf=False\r\nwhile q:\r\n node=q[0]\r\n x,y=node[0]//10**9,node[0]%(10**9)\r\n d=node[1]\r\n del q[0]\r\n if x==x1-1 and y==y1-1:\r\n f=True\r\n break\r\n #print(*[x,y])\r\n c=code(x+1,y)\r\n if c not in v and x<10**9-1 and x+1 in allowed:\r\n r=x+1\r\n i=bisect_left(allowed[r],[y,y])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y) or (i>0 and allowed[r][i-1][1]>=y):\r\n q.append([c,d+1])\r\n v.add(c)\r\n c=code(x-1,y)\r\n if c not in v and x>0 and x-1 in allowed:\r\n r=x-1\r\n i=bisect_left(allowed[r],[y,y])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y) or (i>0 and allowed[r][i-1][1]>=y):\r\n q.append([c,d+1])\r\n v.add(c)\r\n c=code(x,y+1)\r\n if c not in v and y<10**9-1 and x in allowed:\r\n r=x\r\n i=bisect_left(allowed[r],[y+1,y+1])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y+1) or (i>0 and allowed[r][i-1][1]>=y+1):\r\n q.append([c,d+1])\r\n v.add(c)\r\n c=code(x,y-1)\r\n if c not in v and y>0 and x in allowed:\r\n r=x\r\n i=bisect_left(allowed[r],[y-1,y-1])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y-1) or (i>0 and allowed[r][i-1][1]>=y-1):\r\n q.append([c,d+1])\r\n v.add(c)\r\n c=code(x+1,y+1)\r\n if c not in v and y<10**9-1 and x<10**9-1 and x+1 in allowed:\r\n r=x+1\r\n i=bisect_left(allowed[r],[y+1,y+1])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y+1) or (i>0 and allowed[r][i-1][1]>=y+1):\r\n q.append([c,d+1])\r\n v.add(c)\r\n c=code(x+1,y-1)\r\n if c not in v and y>0 and x<10**9-1 and x+1 in allowed:\r\n r=x+1\r\n i=bisect_left(allowed[r],[y-1,y-1])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y-1) or (i>0 and allowed[r][i-1][1]>=y-1):\r\n q.append([c,d+1])\r\n v.add(c)\r\n c=code(x-1,y+1)\r\n if c not in v and y<10**9-1 and x>0 and x-1 in allowed:\r\n r=x-1\r\n i=bisect_left(allowed[r],[y+1,y+1])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y+1) or (i>0 and allowed[r][i-1][1]>=y+1):\r\n q.append([c,d+1])\r\n v.add(c)\r\n c=code(x-1,y-1)\r\n if c not in v and y>0 and x>0 and x-1 in allowed:\r\n r=x-1\r\n i=bisect_left(allowed[r],[y-1,y-1])\r\n n=len(allowed[r])\r\n if (i!=n and allowed[r][i][0]==y-1) or (i>0 and allowed[r][i-1][1]>=y-1):\r\n q.append([c,d+1])\r\n v.add(c)\r\nif f:\r\n print(node[1])\r\nelse:\r\n print(-1)\r\n", "x0, y0, x1, y1 = map(int, input().split())\r\nn = int(input())\r\ng = set()\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n for i in range(b, c+1):\r\n g.add((a, i))\r\n\r\nmoves = [(1, 0), (-1, 0), (0, 1), (0, -1), (1, -1), (1, 1), (-1, -1), (-1, 1)]\r\n# print(g)\r\nq = [(x0, y0, 0)]\r\ng.remove((x0, y0))\r\nans = -1\r\nwhile q:\r\n # print(len(q))\r\n temp = q.pop(0)\r\n # print(temp)\r\n if temp[:2] == (x1, y1):\r\n ans = max(ans, temp[2])\r\n\r\n for move in moves:\r\n temp_move = (temp[0] + move[0], temp[1] + move[1], temp[2] + 1)\r\n\r\n if len(g) == 0 or not temp_move[:2] in g:\r\n continue\r\n q += [temp_move]\r\n g.remove(temp_move[:2])\r\n #print(\"TEST\", temp_move, g[temp_move[0]])\r\n\r\nprint(ans)\r\n", "from collections import deque\r\n\r\npx1, py1, px2, py2 = [int(x) for x in input().split()]\r\np_start, p_end = (px1, py1), (px2, py2)\r\nn = int(input())\r\nvalid = set()\r\nfor _ in range(n):\r\n r, a, b = [int(x) for x in input().split()]\r\n valid.update(((r, j) for j in range(a, b + 1)))\r\n\r\nd = deque()\r\nd.append((p_start, 0))\r\nvisited = {p_start}\r\nwhile d:\r\n p1, m = d.popleft()\r\n if p1 == p_end:\r\n print(m)\r\n quit()\r\n for p2 in [(p1[0] + dx, p1[1] + dy) for dx in [-1, 0, 1] for dy in [-1, 0, 1]]:\r\n if (p2 in valid) and (p2 not in visited):\r\n visited.add(p2)\r\n d.append((p2, m + 1))\r\n \r\n \r\n\r\nprint(-1)\r\n ", "from collections import deque\r\n\r\nx_0, y_0, x_1, y_1 = list(map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\ng = {}\r\n\r\nfor _ in range(n):\r\n r, a, b = list(map(int, input().split()))\r\n # all the valid cols have value -1\r\n for i in range(a, b + 1):\r\n g[(r, i)] = -1\r\n\r\ng[(x_0, y_0)] = 0\r\n\r\nq = deque([(x_0, y_0)])\r\n\r\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\r\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\r\n\r\nwhile len(q) != 0:\r\n current = q.popleft()\r\n\r\n for i in range(8):\r\n neigbor = (current[0] + dx[i], current[1] + dy[i])\r\n if neigbor in g and g[neigbor] == -1:\r\n q.append(neigbor)\r\n g[neigbor] = g[current] + 1\r\n\r\nprint(g[(x_1, y_1)])\r\n\r\n\r\n", "x1,y1,x2,y2=map(int,input().split())\r\nn=int(input())\r\nconditions={}\r\nfor _ in range(n):\r\n r,a,b=map(int, input().split())\r\n if r not in conditions:\r\n conditions[r]=set()\r\n for _ in range(a,b+1):\r\n conditions[r].add(_)\r\ndef check_able_to_go(x,y):\r\n return x in conditions and y in conditions[x]\r\n\r\ndef mark_visited(visited: {}, x,y):\r\n if x not in visited:\r\n visited[x]=set()\r\n visited[x].add(y)\r\n else:\r\n visited[x].add(y)\r\n\r\ndef check_visited(visited: {}, x, y):\r\n if x not in visited:\r\n return False\r\n return y in visited[x]\r\n\r\ndef add_distance(distance: {}, x, y, value):\r\n if x not in distance:\r\n distance[x]={}\r\n distance[x][y]=value\r\n\r\nimport queue\r\nresult=-1\r\ndistance={}\r\nq=queue.Queue()\r\nq.put((x1,y1))\r\nadd_distance(distance, x1, y1, 0)\r\nvisited={}\r\nmark_visited(visited, x1, y1)\r\nmoveX=[1,-1,0,0,1,1,-1,-1]\r\nmoveY=[0,0,1,-1,1,-1,1,-1]\r\nexisted=False\r\nwhile not q.empty():\r\n x,y=q.get()\r\n if x==x2 and y==y2:\r\n existed=True\r\n break\r\n for i in range(8):\r\n xx=x+moveX[i]\r\n yy=y+moveY[i]\r\n if check_able_to_go(xx,yy) and not check_visited(visited,xx,yy):\r\n q.put((xx,yy))\r\n mark_visited(visited,xx,yy)\r\n add_distance(distance, xx, yy, distance[x][y]+1)\r\n\r\nif not existed:\r\n print(-1)\r\nelse:\r\n print(distance[x2][y2])", "x , y , u , v = map(int,input().split())\r\n\r\nn = int(input())\r\nrows = set()\r\nfor i in range(n):\r\n r , a , b = map(int , input().split())\r\n rows.update((r , x) for x in range(a , b + 1))\r\n\r\nnxt , visited , cnt = [(x , y)] , {(x ,y)} , 0\r\nflag = True\r\nwhile (nxt):\r\n cur , nxt = nxt , []\r\n for x , y in cur:\r\n if (x == u and y == v):\r\n print(cnt)\r\n exit()\r\n\r\n for xy in (x - 1, y), (x + 1, y), (x, y - 1), (x, y + 1), (x - 1, y - 1), (x + 1, y - 1), (x - 1, y + 1),\\\r\n ( x + 1, y + 1):\r\n #print(xy)\r\n if xy in rows and xy not in visited:\r\n visited.add(xy)\r\n nxt.append(xy)\r\n\r\n cnt +=1\r\n\r\n\r\nprint('-1')", "from collections import deque\r\n\r\n\r\ndef is_valid(x, y, allowed_seg):\r\n if (x,y) not in allowed_seg:\r\n return False\r\n bounded = (1 <= x <= (10**9)) and (1 <= y <= (10**9))\r\n return bounded\r\n\r\n\r\ndef bfs(xs, ys, xt, yt, allowed_seg):\r\n visited = set()\r\n visited.add((xs, ys))\r\n q = deque()\r\n q.append((xs, ys, 0))\r\n movements = [(-1, 1),(0, 1), (0, -1), (1, 0), (-1, 0),\r\n (1, 1), (1, -1), (-1, -1)]\r\n\r\n while len(q) > 0:\r\n x, y, d = q.popleft()\r\n new_d = d + 1\r\n for dx, dy in movements:\r\n x1 = x + dx\r\n y1 = y + dy\r\n if is_valid(x1, y1, allowed_seg) and (x1, y1) not in visited:\r\n if x1 == xt and y1 == yt:\r\n return new_d\r\n visited.add((x1, y1))\r\n q.append((x1, y1, new_d))\r\n return -1\r\n\r\n\r\nxs, ys, xt, yt = map(int, input().split(\" \"))\r\nn = int(input())\r\nallowed_seg = set()\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split(\" \"))\r\n for i in range(a, b+1):\r\n allowed_seg.add((r,i))\r\nresult = bfs(xs, ys, xt, yt, allowed_seg)\r\n\r\nprint(result)\r\n", "# from collections import defaultdict\r\n#\r\n# def valid(point, adj):\r\n# # if point[0] not in adj.keys():\r\n# # return False\r\n#\r\n# for item in adj[point[0]]:\r\n# if point[1] in range(item[0], item[1] + 1):\r\n# return True\r\n#\r\n# return False\r\n#\r\n# def neighbors(item):\r\n# out = []\r\n# out.append((item[0] - 1, item[1] - 1))\r\n# out.append((item[0] - 1, item[1]))\r\n# out.append((item[0] - 1, item[1] + 1))\r\n#\r\n# out.append((item[0], item[1] - 1))\r\n# out.append((item[0], item[1] + 1))\r\n#\r\n# out.append((item[0] + 1, item[1] - 1))\r\n# out.append((item[0] + 1, item[1]))\r\n# out.append((item[0] + 1, item[1] + 1))\r\n#\r\n# return out\r\n#\r\n#\r\n# def bfs(start, end, adj):\r\n# out = 0\r\n# visted = []\r\n# visted.append(start)\r\n# frontier = [start]\r\n#\r\n# while len(frontier) != 0:\r\n# next = []\r\n# out += 1\r\n# for item in frontier:\r\n# n = neighbors(item)\r\n# for i in n:\r\n# if i == end:\r\n# return out\r\n# if i not in visted:\r\n# if valid(i, adj):\r\n# next.append(i)\r\n# visted.append(i)\r\n# frontier = next\r\n# return -1\r\n#\r\n#\r\n# x_0, y_0, x_1, y_1 = list(map(int, input().split()))\r\n#\r\n# segments = defaultdict(list)\r\n#\r\n# n = int(input())\r\n# for _ in range(n):\r\n# temp = list(map(int, input().split()))\r\n# segments[temp[0]].append((temp[1], temp[2]))\r\n#\r\n# print(bfs((x_0, y_0), (x_1, y_1), segments))\r\n\r\n#print(segments)\r\n#print(valid((6, 11), {5: [(3, 8), (2, 5)], 6: [(7, 11)]}))\r\n# {5: [(3, 8), (2, 5)], 6: [(7, 11)]}\r\n\r\nfrom collections import deque\r\n\r\nx_0, y_0, x_1, y_1 = list(map(int, input().split()))\r\n\r\nn = int(input())\r\n\r\ng = {}\r\n\r\nfor _ in range(n):\r\n r, a, b = list(map(int, input().split()))\r\n # all the valid cols have value -1\r\n for i in range(a, b + 1):\r\n g[(r, i)] = -1\r\n\r\n# level zero\r\ng[(x_0, y_0)] = 0\r\n\r\nq = deque([(x_0, y_0)])\r\n\r\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\r\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\r\n\r\nwhile len(q) != 0:\r\n current = q.popleft()\r\n\r\n for i in range(8):\r\n neigbor = (current[0] + dx[i], current[1] + dy[i])\r\n if neigbor in g and g[neigbor] == -1:\r\n q.append(neigbor)\r\n g[neigbor] = g[current] + 1\r\n\r\n if neigbor == (x_1, y_1):\r\n break\r\n\r\nprint(g[(x_1, y_1)])\r\n\r\n\r\n", "from queue import Queue\r\ndef main(arr,start,end):\r\n\r\n points=set([])\r\n\r\n for i in range(len(arr)):\r\n row,x,y=arr[i]\r\n\r\n for j in range(x,y+1):\r\n points.add((row,j))\r\n \r\n dist={start:0}\r\n q=Queue(maxsize=0)\r\n q.put(start)\r\n while q.qsize()!=0:\r\n (x1,y1)=q.get()\r\n d=dist[(x1,y1)]\r\n if (x1,y1)==end:\r\n return dist[end]\r\n \r\n for i in range(-1,2):\r\n for j in range(-1,2):\r\n p=(x1+i,y1+j)\r\n if p not in dist and p in points:\r\n dist[p]=1+d \r\n q.put(p) \r\n \r\n return -1\r\n\r\n\r\na1,b1,a2,b2=list(map(int,input().split()))\r\nstart=(a1,b1)\r\nend=(a2,b2)\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nprint(main(arr,start,end))\r\n \r\n\r\n", "def bfs(a,b):\r\n global segment\r\n q = [(a,b)]\r\n while q:\r\n a, b = q.pop(0) \r\n x = [0,0,-1,1,-1,1,-1,1]\r\n y = [1,-1,0,0,-1,1,1,-1]\r\n for i in range(8):\r\n a_new, b_new = a+x[i], b+y[i]\r\n if (a_new,b_new) in segment and segment[(a_new,b_new)] == -1:\r\n segment[(a_new,b_new)] = segment[(a,b)] + 1\r\n q.append((a_new,b_new))\r\n\r\n\r\nx_start, y_start, x_end, y_end = map(int, input().split())\r\nn = int(input())\r\nsegment = {}\r\nfor i in range(n):\r\n r, a, b = map(int,input().split())\r\n for i in range(a,b+1):\r\n segment[(r,i)] = -1\r\nif (x_end,y_end) not in segment:\r\n print(-1)\r\n quit()\r\nsegment[(x_start,y_start)] = 0\r\nbfs(x_start,y_start)\r\nprint(segment[(x_end,y_end)])\r\n\r\n\r\n", "from collections import deque\r\n\r\nx,y,x2,y2=map(int,input().split())\r\nn=int(input())\r\nkletki={}\r\nfor i in range(n):\r\n r,a,b=map(int,input().split()) \r\n for j in range(a, b+1):\r\n kletki[(r,j)]=-1\r\n\r\nkletki[(x,y)]=0\r\ndeq = deque()\r\ndeq.append((x,y))\r\n\r\ndx=[-1, -1, 0, 1, 1, 1, 0, -1]\r\ndy=[0, -1, -1, -1, 0, 1, 1, 1]\r\nwhile len(deq):\r\n m = deq.popleft()\r\n\r\n for k in range(8):\r\n n = (m[0]+dx[k], m[1]+dy[k]) \r\n if n in kletki.keys(): \r\n if m in kletki and kletki[n] == -1:\r\n kletki[n] = kletki[m]+1\r\n deq.append(n)\r\n \r\nprint(kletki[(x2,y2)]) \r\n", "INF = 987654321\r\n\r\n\r\ndef solve():\r\n y0, x0, y1, x1 = map(int, input().split())\r\n n = int(input())\r\n dis = {}\r\n for _ in range(n):\r\n r, a, b = map(int, input().split())\r\n\r\n for x in range(a, b + 1):\r\n dis[(r, x)] = INF\r\n\r\n if (y1, x1) not in dis:\r\n print(-1)\r\n return\r\n\r\n queue = []\r\n\r\n dis[(y0, x0)] = 0\r\n queue.append((y0, x0))\r\n while len(queue) > 0:\r\n front = queue.pop(0)\r\n\r\n y = front[0]\r\n x = front[1]\r\n\r\n for dy in [-1, 0, 1]:\r\n for dx in [-1, 0, 1]:\r\n if dy == 0 and dx == 0:\r\n continue\r\n\r\n ny = y + dy\r\n nx = x + dx\r\n\r\n if (ny, nx) not in dis:\r\n continue\r\n\r\n if dis[(ny, nx)] > dis[(y, x)] + 1:\r\n dis[(ny, nx)] = dis[(y, x)] + 1\r\n queue.append((ny, nx))\r\n\r\n if (y1, x1) not in dis or dis[(y1, x1)] == INF:\r\n print(-1)\r\n return\r\n\r\n print(dis[(y1, x1)])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "x1, y1, x2, y2 = map(int, input().split())\r\nn = int(input())\r\nvalid = {}\r\n\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n for i in range(a, b + 1):\r\n valid[(r, i)] = 1\r\n\r\nvisited = {}\r\ndistance = {}\r\nq = [(x1, y1)]\r\n\r\nvisited[(x1, y1)] = 1\r\ndistance[(x1, y1)] = 0\r\n\r\ndx = [-1, -1, -1, 0, 0, 1, 1, 1]\r\ndy = [-1, 0, 1, -1, 1, -1, 0, 1]\r\n\r\nwhile q:\r\n cx, cy = q.pop(0)\r\n\r\n for i in range(8):\r\n nx, ny = cx + dx[i], cy + dy[i]\r\n if (nx, ny) not in valid or (nx, ny) in visited:\r\n continue\r\n q.append((nx, ny))\r\n visited[(nx, ny)] = 1\r\n distance[(nx, ny)] = distance[(cx, cy)] + 1\r\n\r\n\r\nif (x2, y2) in distance:\r\n print(distance[(x2, y2)])\r\nelse:\r\n print(-1)\r\n\r\n\r\n", "from collections import deque, defaultdict\n\n\nclass Solution:\n\n def solve(self):\n kpos = input().split()\n kpos = [int(x) for x in kpos]\n startK = [kpos[0], kpos[1]]\n endK = [kpos[2], kpos[3]]\n N = int(input())\n\n intervals_dict = defaultdict(list)\n for _ in range(N):\n allowed = input().split()\n allowed = [int(x) for x in allowed]\n row, start, end = allowed\n intervals_dict[row].append([start, end])\n\n # merge intervals\n for row in intervals_dict:\n intervals = intervals_dict[row]\n intervals.sort()\n final_merged = []\n\n last_start, last_end = intervals[0]\n for interval in intervals[1:]:\n start, end = interval\n if start <= last_end:\n last_end = end\n continue\n final_merged.append([last_start, last_end])\n last_start = start\n last_end = end\n\n final_merged.append([last_start, last_end])\n last_start = start\n intervals_dict[row] = final_merged\n\n # BFS\n queue = deque([startK])\n moves = 0\n seen = set((startK[0], startK[1]))\n directions = [(i, j) for i in [1, 0, -1]\n for j in [1, 0, -1] if not(i == j == 0)]\n\n def get_intervals(intervals_dict):\n for intervals in intervals_dict:\n yield intervals\n\n while queue:\n moves += 1\n for i in range(len(queue)):\n x, y = queue.popleft()\n\n for dx, dy in directions:\n row, col = x + dx, y + dy\n\n if row in intervals_dict and (row, col) not in seen:\n valid = False\n for interval in intervals_dict[row]:\n start_int, end_int = interval\n if start_int <= col <= end_int:\n valid = True\n break\n if valid:\n intervals_dict[row][0][0] <= col <= intervals_dict[row][0][1]\n seen.add((row, col))\n if (row, col) == (endK[0], endK[1]):\n return moves\n queue.append((row, col))\n\n return -1\n\n\nsoln = Solution()\nprint(soln.solve())\n\n\t\t \t \t\t\t\t\t \t \t \t \t \t \t \t \t", "from queue import Queue\r\n\r\ndx = -1, -1, -1, 0, 0, 1, 1, 1\r\ndy = 1, 0, -1, 1, -1, 1, 0, -1\r\n\r\ndef solve():\r\n points = set()\r\n inp = list(map(int, input().split()))\r\n s = inp[0], inp[1]\r\n e = inp[2], inp[3]\r\n\r\n if s == e:\r\n return 0\r\n\r\n n = int(input())\r\n for i in range(n):\r\n p = tuple(map(int, input().split()))\r\n for j in range(p[1], p[2] + 1):\r\n points.add((p[0], j))\r\n\r\n que = Queue()\r\n que.put((s[0], s[1], 0))\r\n ans = 0\r\n while not que.empty():\r\n c = que.get()\r\n for i in range(8):\r\n x = (c[0] + dx[i], c[1] + dy[i])\r\n if x == e:\r\n return c[2] + 1\r\n if x in points:\r\n que.put((x[0], x[1], c[2]+1))\r\n points.remove(x)\r\n return -1\r\n\r\n\r\nif __name__ == '__main__':\r\n ans = (solve())\r\n print(ans)\r\n", "def neighbours(a, b):\r\n n = ((a, b-1), (a, b+1), (a-1, b), (a+1, b), (a-1, b-1),\r\n (a+1, b+1), (a+1, b-1), (a-1, b+1))\r\n return n\r\n\r\n\r\ndef bfs(x1, y1, x2, y2):\r\n q = [(x1, y1, 0)]\r\n while q:\r\n x1, y1, d = q.pop(0)\r\n for a, b in neighbours(x1, y1):\r\n if (a, b) in allowed:\r\n allowed.remove((a, b))\r\n q.append((a, b, d+1))\r\n if (x1, y1) == (x2, y2):\r\n return d\r\n return -1\r\n\r\n\r\nx1, y1, x2, y2 = map(int, input().split())\r\nans = 0\r\nd = dict()\r\nn = int(input())\r\nidx_l = []\r\nallowed = set()\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n for c in range(a, b + 1):\r\n allowed.add((r, c))\r\n\r\nprint(bfs(x1, y1, x2, y2))\r\n", "MAX = 10**9\r\nd_row = [-1, -1, -1, 0, 0, 1, 1, 1]\r\nd_clm = [-1, 0, 1, -1, 1, -1, 0, 1]\r\n\r\ndef BFS(S, T):\r\n dist[S] = 0\r\n queue = [S]\r\n while queue:\r\n u = queue.pop(0)\r\n if u == T:\r\n break\r\n\r\n u_row = u // MAX\r\n u_clm = u % MAX \r\n for i in range(8):\r\n v = (u_row + d_row[i])*MAX + u_clm + d_clm[i]\r\n if v in dist and dist[v] == MAX:\r\n queue.append(v)\r\n dist[v] = dist[u] + 1 \r\n\r\n return (-1 if dist[T] == MAX else dist[T])\r\n\r\ndist = {}\r\ns_row, s_clm, t_row, t_clm = map(int, input().split())\r\n\r\nS = s_row*MAX + s_clm\r\ndist[S] = MAX\r\n\r\nT = t_row*MAX + t_clm\r\ndist[T] = MAX\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n for i in range(a, b + 1):\r\n dist[r*MAX + i] = MAX\r\n\r\nprint(BFS(S, T))", "from collections import deque\r\n\r\nxs, ys, xe, ye = map(int, input().split())\r\nn = int(input())\r\n\r\nallowed = set()\r\n\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n\r\n for cell in range(a, b + 1):\r\n allowed.add((r, cell))\r\n \r\n\r\nvisited = set([(xs, ys)])\r\nqueue = deque([(xs, ys)])\r\n\r\ndirections = [\r\n (0, 1),\r\n (0, -1),\r\n (1, 0),\r\n (-1, 0),\r\n (1, 1),\r\n (1, -1),\r\n (-1, 1),\r\n (-1, -1)\r\n]\r\n\r\nmoves = 0\r\nyes = False\r\n\r\nwhile queue:\r\n \r\n size = len(queue)\r\n for _ in range(size):\r\n row, col = queue.popleft()\r\n\r\n if (row, col) == (xe, ye):\r\n yes = True\r\n print(moves)\r\n \r\n break\r\n\r\n for dr, dc in directions:\r\n nr, nc = row + dr, col + dc\r\n if (nr, nc) in allowed and (nr, nc) not in visited:\r\n visited.add((nr, nc))\r\n queue.append((nr, nc))\r\n \r\n moves += 1\r\n\r\nif not yes:\r\n print(-1)", "import sys\r\nfrom collections import deque, defaultdict\r\n\r\n\r\nMOVES = [(1,0), (-1,0), (0,1), (0, -1), (1, 1), (-1, 1), (1, -1), (-1, -1)]\r\nBILLION = 1E9\r\n\r\ndef bfs(r_s, c_s, r_e, c_e, allowed):\r\n queue = deque()\r\n seen = set()\r\n queue.append((r_s, c_s, 0))\r\n while queue:\r\n row, column, moves = queue.popleft()\r\n if moves > 10 ** 5:\r\n break\r\n if row == r_e and column == c_e:\r\n return moves\r\n if (row, column) not in seen:\r\n seen.add((row, column))\r\n else:\r\n continue\r\n moves += 1\r\n for move in MOVES:\r\n delta_row = row + move[0]\r\n delta_col = column + move[1]\r\n if delta_col >= 0 and delta_col <= BILLION and delta_row >= 0 and delta_row <= BILLION and delta_col in allowed[delta_row]:\r\n queue.append((delta_row, delta_col, moves))\r\n return -1\r\ndef main():\r\n read = sys.stdin.readline\r\n r_s, c_s, r_e, c_e = (int(i) for i in read().split())\r\n allowed = defaultdict(set)\r\n for _ in range(int(read())):\r\n row, c_1, c_2 = (int(i) for i in read().split())\r\n for i in range(c_1, c_2 + 1):\r\n allowed[row].add(i)\r\n result = bfs(r_s, c_s, r_e, c_e, allowed)\r\n print(result)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "from bisect import bisect_left, bisect_right\r\nimport sys\r\nimport math\r\nimport heapq\r\nfrom collections import deque, defaultdict, Counter\r\n\r\ninput = sys.stdin.readline\r\ndef gn():\r\n return int(input().strip())\r\n\r\ndef gs():\r\n return input().strip()\r\n\r\ndef gns():\r\n return list(map(int, input().strip().split()))\r\n\r\na,b,c,d = gns()\r\na-=1\r\nb-=1\r\nc-=1\r\nd-=1\r\nn = gn()\r\nmyset = set()\r\nfor i in range(n):\r\n r,s,e=gns()\r\n \r\n for i in range(s - 1,e):\r\n myset.add((r - 1,i))\r\n\r\nque = deque()\r\nque.append((a,b))\r\nnum = 10 ** 9\r\nvisted = set()\r\nans = None\r\nlevel = 0\r\nwhile que:\r\n size = len(que)\r\n \r\n for i in range(size):\r\n row,col = que.popleft()\r\n if row == c and col == d:\r\n ans = level\r\n break\r\n for x, y in [[1,0],[0,1],[-1,0],[0,-1],[1,1],[-1,-1],[-1,1],[1,-1]]:\r\n newx = x + row\r\n newy = y + col\r\n if 0 <= newx < num and 0 <= newy < num:\r\n if (newx,newy) not in visted and (newx,newy) in myset:\r\n que.append((newx,newy))\r\n visted.add((newx,newy))\r\n \r\n if ans:\r\n break\r\n level += 1\r\nif ans:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n \r\n \r\n\r\n", "x0, y0, x1, y1 = map(int, input().split())\r\n\r\nn = int(input())\r\nrows = set()\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n rows.update((r, x) for x in range(a, b + 1))\r\n\r\nneighbors, visited, moves = [(x0, y0)], {x0, y0}, 0\r\n\r\nwhile neighbors:\r\n current, neighbors = neighbors, []\r\n for x, y in current:\r\n if (x, y) == (x1, y1):\r\n print(moves)\r\n exit()\r\n for xy in (x + 1, y), (x, y + 1), (x - 1, y), (x, y - 1), (x + 1, y + 1), (x - 1, y - 1), (x + 1, y - 1), (x - 1, y + 1):\r\n if xy in rows and xy not in visited:\r\n visited.add(xy)\r\n neighbors.append(xy)\r\n moves += 1\r\n\r\nprint(-1)", "from sys import stdin, stdout \r\nimport time,math\r\nfrom collections import defaultdict\r\n#n,m=map(int,input().split()) \r\n# for i in range(n):\r\n# t=int(stdin.readline()) # input using fast i/p method \r\n# if t%m == 0:\r\n# stdout.write(str(t)+'\\n') #input using fast o/p method\r\n\r\n# take line of integers as input\r\n# \tarr = list(map(int, inp().split()))\r\n\r\n##########################################################################################\r\ndef pn(ob):stdout.write(str(ob))\r\n\r\ndef inp():return stdin.readline()\r\n\r\ndef fpow(n,p):\r\n\tif(p==1):\r\n\t\treturn n\r\n\tif((p&1)==1):\r\n\t\treturn n*fpow(n,p-1)\r\n\telse:\r\n\t\treturn fpow(n,p/2)*fpow(n,p/2)\r\n###########################################################################################\r\n\r\ndef def_val():\r\n\treturn False\r\ndef def_dist():\r\n\treturn math.inf\r\n\r\nvalid=defaultdict(def_val)\r\ndist=defaultdict(def_dist)\r\n\r\ndx = (-1, 0, 1, 0, 1, 1, -1, -1);\r\ndy = (0, 1, 0, -1, 1, -1, 1, -1);\r\n\r\ndef bfs(x,y,dest):\r\n\tq=[]\r\n\tq.append((x,y))\r\n\tvalid[(x,y)]=False\r\n\tdist[(x,y)]=0\r\n\r\n\twhile(len(q)>0):\r\n\t\tcoords=q.pop(0)\r\n\r\n\t\tfor k in range(0,8,1):\r\n\t\t\tx=coords[0]+dx[k]\r\n\t\t\ty=coords[1]+dy[k]\r\n\r\n\t\t\tnew_coords=(x,y)\r\n\t\t\tdist[new_coords]=min(dist[coords]+1,dist[new_coords])\r\n\r\n\t\t\tif(valid[new_coords]):\r\n\t\t\t\tvalid[new_coords]=False\r\n\t\t\t\tq.append(new_coords)\r\n\r\n\tif(dist[dest]==math.inf):\r\n\t\tpn(-1)\r\n\telse:\r\n\t\tpn(dist[dest])\r\n\t\r\n\r\n\r\ndef process():\r\n\t#code here\r\n\tx0,y0,x1,y1=map(int,input().split())\r\n\tn=int(inp())\r\n\r\n\tfor i in range(0,n,1):\r\n\t\tr,a,b=map(int,input().split())\r\n\t\tfor j in range(a,b+1,1):\r\n\t\t\tvalid[(r,j)]=True\r\n\r\n\tbfs(x0,y0,(x1,y1))\r\n\r\n\r\ndef main():\r\n\tt=1\r\n\t#t=int(inp())\r\n\t# start = time.time()\r\n\r\n\t# while (t>0):\r\n\t# \tt-=1\r\n\t# \tprocess()\r\n\t# end = time.time()\r\n\t# print('\\nelapsed time',end - start)\r\n\tprocess()\r\n \r\nif __name__ == '__main__':\r\n\tmain()\r\n\t\r\n\t\r\n\t", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\nfrom __future__ import print_function # for PyPy2\r\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\nsx, sy, ex, ey = gil()\r\nd, h = {}, []\r\nfor _ in range(gil()[0]):\r\n\tr, L, R = gil()\r\n\tfor c in range(L, R+1):\r\n\t\td[r, c] = inf\r\n\r\n\r\nif (sx, sy) not in d or (ex, ey) not in d :\r\n\tprint(0 if (sx, sy) == (ex, ey) else -1)\r\n\texit()\r\n\r\nd[sx, sy] = 0\r\nh.append((0, sx, sy))\r\nperm = [(-1, -1), (1, 0), (0, 1), (1, 1), (0, -1), (-1, 0), (-1, 1), (1, -1)]\r\n\r\nwhile h:\r\n\tdi, x, y = heappop(h)\r\n\tif d[x, y] != di:continue\r\n\tfor dx, dy in perm:\r\n\t\tp = (x+dx, y+dy)\r\n\t\tif p in d and d[p] > di+1:\r\n\t\t\td[p] = di + 1\r\n\t\t\theappush(h, (di+1, p[0], p[1]))\r\n\r\nprint(-1 if d[ex, ey] == inf else d[ex, ey])\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nx0,y0,x1,y1=(int(i) for i in input().split())\r\nn=int(input())\r\nd1={}\r\nfor i in range(n):\r\n r,a,b=(int(i) for i in input().split())\r\n for i in range(a,b+1):\r\n d1[(r,i)]=1\r\nvis={}\r\nc=0\r\nc1=-1\r\nqueue=[[x0,y0,0]]\r\nvis[(x0,y0)]=1\r\nwhile(queue!=[]):\r\n s=queue.pop(0)\r\n if(s[0]==x1 and s[1]==y1):\r\n c1=1\r\n c=s[2]\r\n break\r\n else:\r\n if(s[0]-1>0 and (s[0]-1,s[1]) not in vis and (s[0]-1,s[1]) in d1):\r\n vis[(s[0]-1,s[1])]=1\r\n queue.append([s[0]-1,s[1],s[2]+1])\r\n if(s[1]-1>0 and (s[0],s[1]-1) not in vis and (s[0],s[1]-1) in d1):\r\n vis[(s[0],s[1]-1)]=1\r\n queue.append([s[0],s[1]-1,s[2]+1])\r\n if(s[0]+1<1000000001 and (s[0]+1,s[1]) not in vis and (s[0]+1,s[1]) in d1):\r\n vis[(s[0]+1,s[1])]=1\r\n queue.append([s[0]+1,s[1],s[2]+1])\r\n if(s[1]+1<1000000001 and (s[0],s[1]+1) not in vis and (s[0],s[1]+1) in d1):\r\n vis[(s[0],s[1]+1)]=1\r\n queue.append([s[0],s[1]+1,s[2]+1])\r\n if(s[0]-1>0 and s[1]-1>0 and (s[0]-1,s[1]-1) not in vis and (s[0]-1,s[1]-1) in d1):\r\n vis[(s[0]-1,s[1]-1)]=1\r\n queue.append([s[0]-1,s[1]-1,s[2]+1])\r\n if(s[0]-1>0 and s[1]+1<1000000001 and (s[0]-1,s[1]+1) not in vis and (s[0]-1,s[1]+1) in d1):\r\n vis[(s[0]-1,s[1]+1)]=1\r\n queue.append([s[0]-1,s[1]+1,s[2]+1])\r\n if(s[0]+1<1000000001 and s[1]-1>0 and (s[0]+1,s[1]-1) not in vis and (s[0]+1,s[1]-1) in d1):\r\n vis[(s[0]+1,s[1]-1)]=1\r\n queue.append([s[0]+1,s[1]-1,s[2]+1])\r\n if(s[0]+1<1000000001 and s[1]+1<1000000001 and (s[0]+1,s[1]+1) not in vis and (s[0]+1,s[1]+1) in d1):\r\n vis[(s[0]+1,s[1]+1)]=1\r\n queue.append([s[0]+1,s[1]+1,s[2]+1])\r\nif(c1==-1):\r\n print(c1)\r\nelse:\r\n print(c)", "from collections import deque\n\nx0, y0, x1, y1 = map(int, input().split())\nn = int(input())\ng = {}\nfor _ in range(n):\n r, a, b = map(int, input().split())\n for i in range(a, b + 1):\n g[(r, i)] = -1\ng[(x0, y0)] = 0\nq = deque([(x0, y0)])\ndx = [-1, 0, 1, -1, 1, -1, 0, 1]\ndy = [-1, -1, -1, 0, 0, 1, 1, 1]\nwhile len(q) > 0:\n c = q.popleft()\n for i in range(8):\n m = (c[0] + dx[i], c[1] + dy[i])\n if m in g and g[m] == -1:\n q.append(m)\n g[m] = g[c] + 1\n\nprint(g[(x1, y1)])", "# Author Name: Ajay Meena\r\n# Codeforce : https://codeforces.com/profile/majay1638\r\nimport sys\r\nimport math\r\nimport bisect\r\nimport heapq\r\nfrom bisect import bisect_right\r\nfrom sys import stdin, stdout\r\n\r\n# -------------- INPUT FUNCTIONS ------------------\r\n\r\n\r\ndef get_ints_in_variables(): return map(\r\n int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_int(): return int(sys.stdin.readline())\r\n\r\n\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\n\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\n# -------- SOME CUSTOMIZED FUNCTIONS-----------\r\n\r\n\r\ndef myceil(x, y): return (x + y - 1) // y\r\n\r\n# -------------- SOLUTION FUNCTION ------------------\r\n\r\n\r\ndef Solution():\r\n # Write Your Code Here\r\n x0, y0, x1, y1 = get_ints_in_variables()\r\n n = get_int()\r\n g = {}\r\n for _ in range(n):\r\n r, a, b = get_ints_in_variables()\r\n for i in range(a, b+1):\r\n g[(r, i)] = -1\r\n g[(x0, y0)] = 0\r\n dx = [-1, -1, -1, 0, 0, 1, 1, 1]\r\n dy = [0, -1, 1, -1, 1, 0, -1, 1]\r\n queue = [(x0, y0)]\r\n while len(queue):\r\n node = queue.pop(0)\r\n for j in range(8):\r\n v = (node[0]+dx[j], node[1]+dy[j])\r\n # print(v, \"v\")\r\n if not v in g:\r\n continue\r\n if v in g and g[v] != -1:\r\n continue\r\n g[v] = g[node]+1\r\n queue.append(v)\r\n print(g[(x1, y1)])\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n Solution()\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import defaultdict, deque\r\n\r\nx_start, y_start, x_end, y_end = map(int, input().split())\r\nn = int(input())\r\ndic = defaultdict(set)\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n for i in range(a, b+1):\r\n dic[r].add(i)\r\nmove_x = [-1, -1, 0, 1, 1, 1, 0, -1]\r\nmove_y = [0, 1, 1, 1, 0, -1, -1, -1]\r\nbound = 10**9\r\nans = 0\r\nflag = 0\r\nalready = defaultdict(int)\r\nalready[(x_start, y_start)] = 1\r\n\r\nroad = deque([(x_start, y_start)])\r\nwhile road:\r\n if ans:\r\n break\r\n a = road.popleft()\r\n for i in range(8):\r\n new_x, new_y = a[0]+move_x[i], a[1]+move_y[i]\r\n if new_x == x_end and new_y == y_end:\r\n ans = already[(a[0], a[1])]+1\r\n break\r\n if 1 <= new_x <= bound and 1 <= new_y <= bound and dic[new_x] and new_y in dic[new_x] and not already[(new_x, new_y)]:\r\n already[(new_x, new_y)] = already[(a[0], a[1])]+1\r\n road.append((new_x, new_y))\r\n\r\nprint(ans-1)", "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, insort\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\nimport copy\r\nfrom copy import deepcopy\r\nimport time\r\nstarttime = time.time()\r\nmod = int(pow(10, 9) + 7)\r\nmod2 = 998244353\r\n\r\ndef data(): return sys.stdin.readline().strip()\r\ndef out(*var, end=\"\\n\"): sys.stdout.write(' '.join(map(str, var))+end)\r\ndef L(): return list(sp())\r\ndef sl(): return list(ssp())\r\ndef sp(): return map(int, data().split())\r\ndef ssp(): return map(str, data().split())\r\ndef l1d(n, val=0): return [val for i in range(n)]\r\ndef l2d(n, m, val=0): return [l1d(n, val) for j in range(m)]\r\ntry:\r\n # sys.setrecursionlimit(int(pow(10,6)))\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\", \"w\")\r\nexcept:\r\n pass\r\ndef pmat(A):\r\n for ele in A: print(*ele,end=\"\\n\")\r\n\r\n# from sys import stdin\r\n# input = stdin.buffer.readline\r\n# I = lambda : list(map(int,input().split()))\r\n\r\nx0,y0,x1,y1=L()\r\nA=[L() for i in range(L()[0])]\r\nA.sort()\r\nd={}\r\nfor x,l,r in A:\r\n if x not in d:\r\n d[x]=set()\r\n for i in range(l,r+1):\r\n d[x].add(i)\r\nq=deque()\r\nq.append([x0,y0,0])\r\nvis=set()\r\nvis.add((x0,y0))\r\nwhile(q):\r\n x,y,dist=q.popleft()\r\n if x==x1 and y==y1:\r\n print(dist)\r\n exit()\r\n row=[-1,-1,-1,0,0,1,1,1]\r\n col=[-1,0,1,-1,1,-1,0,1]\r\n for k in range(8):\r\n a=x+row[k]\r\n b=y+col[k]\r\n if d.get(a,0) and b in d[a] and (a,b) not in vis:\r\n q.append([a,b,dist+1])\r\n vis.add((a,b))\r\nprint(-1)", "INF = 1000000000\r\n\r\ndef bfs(sta,fin):\r\n from collections import deque\r\n visit = deque()\r\n\r\n dx = [0,-1,-1,-1,0,1,1,1]\r\n dy = [1,1,0,-1,-1,-1,0,1]\r\n\r\n visit.append(sta)\r\n while len(visit) > 0:\r\n vertex = visit.popleft()\r\n\r\n for i in range(8):\r\n nx = vertex[0] + dx[i]\r\n ny = vertex[1] + dy[i]\r\n\r\n if (1 <= nx <= INF) and (1 <= ny <= INF) and ((nx,ny) in board) and (board[(nx,ny)] == -1):\r\n visit.append((nx,ny))\r\n board[(nx, ny)] = 0\r\n dist[(nx,ny)] = dist[vertex] + 1\r\n\r\n if (nx,ny) == fin:\r\n print(dist[(nx,ny)],end='')\r\n return True\r\n\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n board, dist = dict(), dict()\r\n\r\n x0, y0, x1, y1 = map(int, input().split())\r\n sta = (x0, y0)\r\n fin = (x1, y1)\r\n dist[sta] = 0\r\n\r\n n = int(input())\r\n for _ in range(n):\r\n line = input()\r\n r, a, b = map(int, line.split())\r\n for i in range(a,b+1):\r\n board[(r,i)] = -1\r\n dist[(r, i)] = 0\r\n\r\n if not bfs(sta,fin):\r\n print(-1,end='')", "from sys import stdin, stdout\r\nfrom collections import deque\r\n\r\nx0, y0, x1, y1 = map(int, stdin.readline().split())\r\nn = int(stdin.readline())\r\n\r\nallowed = {}\r\n\r\nfor _ in range(n):\r\n r, a, b = map(int, stdin.readline().split())\r\n \r\n if r in allowed:\r\n allowed[r].append([a, b])\r\n else:\r\n allowed[r] = [[a, b]]\r\n \r\n# merge all intervals\r\n\r\nfor r in allowed:\r\n old = allowed[r]\r\n old.sort(key=lambda x: x[0])\r\n \r\n compressed = [old[0]]\r\n for i in range(1, len(old)):\r\n if old[i][0] <= compressed[-1][1]:\r\n compressed[-1][1] = max(old[i][1], compressed[-1][1])\r\n else:\r\n compressed.append(old[i])\r\n \r\n allowed[r] = compressed\r\n \r\n#print(allowed)\r\n\r\n\r\ndef check_valid(r, box):\r\n if r <= 0 or box <= 0 or r > 1e9 or box > 1e9:\r\n return False\r\n if r not in allowed:\r\n return False\r\n for a, b in allowed[r]:\r\n if a <= box <= b:\r\n return True\r\n return False\r\n\r\ndef bfs(start, target):\r\n q = deque()\r\n # start is a tuple, target is a tuple\r\n q.append((start, 0))\r\n \r\n visited = set()\r\n \r\n while q:\r\n square, moves = q.popleft()\r\n \r\n dr = [-1, -1, 0, 1, 1, 1, 0, -1]\r\n dx = [0, 1, 1, 1, 0, -1, -1, -1]\r\n \r\n for i in range(8):\r\n new_square = (square[0]+dr[i],\r\n square[1]+dx[i])\r\n \r\n if check_valid(*new_square) and \\\r\n new_square not in visited:\r\n if new_square == target:\r\n return moves + 1\r\n q.append((new_square, moves + 1))\r\n visited.add(new_square)\r\n \r\n return -1\r\n \r\nprint(bfs((x0, y0), (x1, y1))) \r\n \r\n \r\n \r\n \r\n \r\n", "def successors(pos):\n x, y = pos\n nextMoves = []\n if (x - 1, y) in allowed:\n nextMoves.append((x - 1, y))\n if (x + 1, y) in allowed:\n nextMoves.append((x + 1, y))\n if (x, y - 1) in allowed:\n nextMoves.append((x, y - 1))\n if (x, y + 1) in allowed:\n nextMoves.append((x, y + 1))\n\n if (x - 1, y - 1) in allowed:\n nextMoves.append((x - 1, y - 1))\n if (x - 1, y + 1) in allowed:\n nextMoves.append((x - 1, y + 1))\n if (x + 1, y - 1) in allowed:\n nextMoves.append((x + 1, y - 1))\n if (x + 1, y + 1) in allowed:\n nextMoves.append((x + 1, y + 1))\n\n return nextMoves\n\n\ndef BFS(start, end):\n explored = {}\n if start == end:\n return 0\n frontier = [start]\n explored[start] = 1\n h = 1\n while frontier:\n nextLevel = []\n for curPos in frontier:\n for x, y in successors(curPos):\n if (x, y) not in explored:\n explored[(x, y)] = 1\n if (x, y) == end:\n return h\n nextLevel.append((x, y))\n frontier = nextLevel\n h += 1\n return -1\n\n\nallowed = {}\ninp = str(input()).split(\" \")\nx0 = int(inp[0])\ny0 = int(inp[1])\nx1 = int(inp[2])\ny1 = int(inp[3])\n\nsegs = int(input())\nfor _ in range(segs):\n inp = [int(i) for i in str(input()).split(\" \")]\n for x in range(inp[1], inp[2] + 1):\n allowed[(inp[0], x)] = 1\n\nprint(BFS((x0, y0), (x1, y1)))\n", "from collections import deque, defaultdict\r\n\r\nX,Y,x,y = map(int, input().split())\r\n\r\nallowed = set()\r\nfor _ in range(int(input())):\r\n r,a,b = map(int, input().split())\r\n for i in range(a,b+1):\r\n allowed.add((r,i))\r\n\r\n# print(allowed)\r\nvisited = set((X,Y))\r\nq = deque([(X,Y)])\r\n\r\nsteps = 0\r\nwhile q:\r\n for _ in range(len(q)):\r\n a,b = q.popleft()\r\n if (a,b) == (x,y):\r\n print(steps)\r\n exit()\r\n\r\n for dx,dy in [[1,0], [-1,0], [0,1], [0,-1], [1,1], [1,-1], [-1,-1], [-1,1]]:\r\n if (a+dx,b+dy) not in visited and (a+dx,b+dy) in allowed:\r\n visited.add((a+dx,b+dy))\r\n q.append((a+dx,b+dy))\r\n steps += 1\r\n\r\nprint(-1)", "import sys\r\nfrom collections import deque\r\ninput=sys.stdin.readline\r\nsx,sy,gx,gy=map(int,input().split())\r\nn=int(input())\r\nrab=[list(map(int,input().split())) for i in range(n)]\r\ngood=set()\r\nvis={}\r\nfor r,a,b in rab:\r\n for c in range(a,b+1):\r\n good.add((r,c))\r\ndq=deque()\r\ndq.append([sx,sy,0])\r\nvis[(sx,sy)]=0\r\nwhile dq:\r\n x,y,c=dq.popleft()\r\n for dx in [-1,0,1]:\r\n for dy in [-1,0,1]:\r\n if dx==dy==0:\r\n continue\r\n pos=(x+dx,y+dy)\r\n if pos in good and not pos in vis:\r\n vis[pos]=c+1\r\n dq.append([x+dx,y+dy,c+1])\r\nif (gx,gy) in vis:\r\n print(vis[(gx,gy)])\r\nelse:\r\n print(-1)", "x0, y0, x1, y1 = map(int, input().split())\r\nn = int(input())\r\n\r\nvalid = set()\r\nfor _ in range(n):\r\n r, a, b = map(int, input().split())\r\n for x in range(a, b + 1):\r\n valid.add((r, x))\r\n\r\nvisited, moves, neighbors = {(x0, y0)}, 0, [(x0, y0)]\r\nwhile neighbors:\r\n current, neighbors = neighbors, []\r\n for x, y in current:\r\n if (x, y) == (x1, y1):\r\n print(moves)\r\n exit()\r\n else:\r\n for p, q in (x + 1, y), (x, y + 1), (x + 1, y + 1), (x - 1, y), (x, y - 1), (x - 1, y - 1), (\r\n x - 1, y + 1), (x + 1, y - 1):\r\n if (p, q) in valid and (p, q) not in visited:\r\n neighbors.append((p, q))\r\n visited.add((p, q))\r\n moves += 1\r\n\r\nprint(-1)\r\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, permutations\r\nfrom itertools import accumulate\r\nfrom operator import xor, add\r\nfrom operator import mul\r\nfrom typing import List, Set, Tuple, DefaultDict\r\n\r\n\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 UnionFind:\r\n def __init__(self, n):\r\n self.root = [i for i in range(n)]\r\n self.size = [1] * n\r\n self.part = n\r\n\r\n def find(self, x):\r\n if x != self.root[x]:\r\n # 在查询的时候合并到顺带直接根节点\r\n root_x = self.find(self.root[x])\r\n self.root[x] = root_x\r\n return root_x\r\n return x\r\n\r\n def union(self, x, y):\r\n root_x = self.find(x)\r\n root_y = self.find(y)\r\n if root_x == root_y:\r\n return False\r\n if self.size[root_x] >= self.size[root_y]:\r\n root_x, root_y = root_y, root_x\r\n self.root[root_x] = root_y\r\n self.size[root_y] += self.size[root_x]\r\n # 将非根节点的秩赋0\r\n self.size[root_x] = 0\r\n self.part -= 1\r\n return True\r\n\r\n def is_connected(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\n def get_root_part(self):\r\n # 获取每个根节点对应的组\r\n part = defaultdict(list)\r\n n = len(self.root)\r\n for i in range(n):\r\n part[self.find(i)].append(i)\r\n return part\r\n\r\n def get_root_size(self):\r\n # 获取每个根节点对应的组大小\r\n size = defaultdict(int)\r\n n = len(self.root)\r\n for i in range(n):\r\n size[self.find(i)] = self.size[self.find(i)]\r\n return size\r\n\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\nclass Solution:\r\n def __init__(self):\r\n return\r\n\r\n @staticmethod\r\n def main(ac=FastIO()):\r\n x0, y0, x1, y1 = ac.read_ints()\r\n n = ac.read_int()\r\n nodes = set()\r\n for _ in range(n):\r\n r, a, b = ac.read_ints()\r\n for y in range(a, b+1):\r\n nodes.add((r, y))\r\n dis = defaultdict(lambda: inf)\r\n stack = deque([(x0, y0)])\r\n dis[(x0, y0)] = 0\r\n while stack:\r\n x, y = stack.popleft()\r\n if [x, y] == [x1, y1]:\r\n break\r\n for i in range(-1, 2, 1):\r\n for j in range(-1, 2, 1):\r\n a, b = x+i, y+j\r\n if (a, b) in nodes and dis[(a, b)] == inf:\r\n dis[(a, b)] = dis[(x, y)] + 1\r\n stack.append((a, b))\r\n ans = dis[(x1, y1)]\r\n ac.st(ans if ans < inf else -1)\r\n return\r\n\r\n\r\nSolution().main()" ]

[ "import sys\r\n\r\ndef gcd(a, b):\r\n if(b == 0):\r\n return a\r\n r = a % b\r\n return gcd(b, r)\r\n\r\na, b = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nt = gcd(a, b)\r\na /= t\r\nb /= t\r\n\r\nif(a > b):\r\n if(a != b + 1):\r\n print(\"Masha\")\r\n else:\r\n print(\"Equal\")\r\nelse:\r\n if(b != a + 1):\r\n print(\"Dasha\")\r\n else:\r\n print(\"Equal\")\r\n ", "from math import gcd\r\nn,m=map(int,input().split())\r\nlcm=n*m//(gcd(n,m))\r\na,b=lcm//n,lcm//m\r\n# print()\r\nif abs(a-b)<=1:\r\n print(\"Equal\")\r\nelif a>b:\r\n print(\"Dasha\")\r\nelse:\r\n print(\"Masha\")", "'''\r\nNotice that we only need to analyze the interval a*b.\r\nLet x be the periodicity of the less frequent train. And t_{x} be the number of minutes that\r\nthe guy would descend for train corresponding to x. Denote the other value as y.\r\n\r\nNotice that t_{x} = sum_{1 <= i <= y} x * i - ((x * i - 1) // y) * (y) and t_{y} = x*y - t_{x}.\r\n\r\nBased on this, we can figure out who the guy will visit more often. \r\n'''\r\n\r\ndef findPopularPerson(dashaFrequency, mashaFrequency):\r\n \r\n x, y = max(dashaFrequency, mashaFrequency), min(dashaFrequency, mashaFrequency)\r\n tx = 0\r\n for i in range(1, y + 1):\r\n tx += x * i - ((x * i - 1) // y) * y\r\n ty = x * y - tx\r\n if ty > tx:\r\n return \"Masha\" if y == mashaFrequency else \"Dasha\"\r\n elif tx < ty:\r\n return \"Masha\" if x == mashaFrequency else \"Dasha\"\r\n return \"Equal\"\r\n\r\ndashaFrequency, mashaFrequency = map(int, input().split(' '))\r\nprint(findPopularPerson(dashaFrequency, mashaFrequency))", "from sys import stdin, stdout\r\n\r\n# Read input: stdin.readline()\r\n# Print output: stdout.write()\r\n\r\ndef gcd(a, b):\r\n\tif (not b): return a\r\n\treturn gcd(b, a%b)\r\n\r\ndef main(args):\r\n\ta, b = [int(c) for c in stdin.readline().split()]\r\n\tlcm = a*b//gcd(a, b)\r\n\t\r\n\tdasha, masha = (lcm-1)//a, (lcm-1)//b\r\n\tif (dasha < masha): dasha += 1\r\n\telif (dasha > masha): masha += 1\r\n\t\r\n\tif (dasha > masha): stdout.write(\"Dasha\\n\")\r\n\telif (dasha < masha): stdout.write(\"Masha\\n\")\r\n\telse: stdout.write(\"Equal\\n\")\r\n\r\nif __name__ == '__main__':\r\n import sys\r\n sys.exit(main(sys.argv))\r\n", "import math\n\nDASHA = 'Dasha'\nMASHA = 'Masha'\nEQUAL = 'Equal'\n\na, b = map(int, input().strip().split())\ng = math.gcd(a, b)\na //= g\nb //= g\n\nif abs(a - b) == 1:\n\tprint(EQUAL)\nelif (a < b):\n\tprint(DASHA)\nelse:\n\tprint(MASHA)\n\n", "import math \r\na,b = map(int,input().split())\r\nx = math.gcd(a,b)\r\na = a//x \r\nb = b//x \r\nif abs(a-b) == 1: \r\n print(\"Equal\")\r\nelif a<b:\r\n print(\"Dasha\")\r\nelse:\r\n print(\"Masha\")\r\n", "import math\r\na, b = map(int, input().split())\r\ntemp = math.gcd(a, b)\r\na /= temp\r\nb /= temp\r\nif abs(a-b) == 1:\r\n print('Equal')\r\nelif a > b:\r\n print('Masha')\r\nelse:\r\n print('Dasha')\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\na,b = map(int, input().split())\r\nlcm = math.lcm(a,b)\r\n\r\nta = lcm//a-1\r\ntb = lcm//b-1\r\n\r\nif a>b:\r\n ta+=1\r\nelif a<b:\r\n tb+=1\r\n\r\nif ta>tb:\r\n print('Dasha')\r\nelif ta<tb:\r\n print('Masha')\r\nelse:\r\n print('Equal')", "from math import gcd\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n\r\ndef gen(n, nmax):\r\n i = 0\r\n while i + n <= nmax:\r\n yield i + n\r\n i += n\r\n\r\n\r\ndef main():\r\n a, b = map(int, input().split())\r\n _lcm = lcm(a, b) # the algorithm is O(_lcm) which is too much\r\n\r\n freq_a = gen(a, _lcm)\r\n freq_b = gen(b, _lcm)\r\n\r\n anext = next(freq_a)\r\n bnext = next(freq_b)\r\n prev = 0\r\n visits_a = visits_b = 0\r\n\r\n anext = a\r\n bnext = b\r\n\r\n\r\n while anext <= _lcm or bnext <= _lcm:\r\n if anext < bnext or (anext == bnext and a > b):\r\n d = anext - prev\r\n visits_a += d\r\n prev += d\r\n anext += a if anext + a <= _lcm else float('infinity')\r\n elif anext > bnext or (anext == bnext and a < b):\r\n d = bnext - prev\r\n visits_b += d\r\n prev += d\r\n bnext += b if bnext + b <= _lcm else float('infinity')\r\n \r\n\r\n if visits_a > visits_b:\r\n print('Dasha')\r\n elif visits_a < visits_b:\r\n print('Masha')\r\n else:\r\n print('Equal')\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\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\nfrom 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\nn,m=map(int,input().split()) ; lcm=n*m//gcd(n,m) ; masha=lcm//n ; dasha=lcm//m \r\nif abs(masha-dasha)==1:\r\n print(\"Equal\")\r\nelse:\r\n print(\"Masha\" if masha<dasha else \"Dasha\")\r\n", "import sys\r\nimport string\r\nimport math\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 gcd(a, b):\r\n while b:\r\n a %= b\r\n a, b = b, a\r\n return a\r\n\r\ndef lcm(arr):\r\n a = arr[0]\r\n for i in range(1, len(arr)):\r\n a = a * arr[i] // gcd(a, arr[i])\r\n return a\r\n\r\ndef div(l, r, x):\r\n '''\r\n Returns the number multiples of x in range\r\n l, r inclusive.\r\n '''\r\n if l == 1 or l == 0:\r\n return r // x\r\n else:\r\n return r // x - ((l - 1) // x)\r\n\r\ndef solve(l, s, name1, name2):\r\n '''\r\n prints name1 if l wins, else prints name2.\r\n '''\r\n lcmm = lcm([l, s])\r\n for i in range(0, lcmm - l + 1, l):\r\n rr = i + l if i + l < lcmm else i + l - 1\r\n if div(i, rr, s) >= 2:\r\n print(name2)\r\n return\r\n\r\n # Smaller always wins unless equal.\r\n print(\"Equal\")\r\n \r\n\r\ndef main():\r\n d, m = mi(line())\r\n if d > m:\r\n solve(d, m, \"Dasha\", \"Masha\") \r\n elif d < m:\r\n solve(m, d, \"Masha\", \"Dasha\")\r\n \r\n\r\n\r\nmain()\r\n", "'''input\r\n2 3\r\n'''\r\nfrom math import gcd\r\ndef lcm(a,b):\r\n\th=gcd(a,b)\r\n\tl=(a*b)//(h)\t\r\n\treturn l\r\nd,m=map(int,input().strip().split(' '))\r\nl=lcm(d,m)\r\na=l//d-1\r\nb=l//m-1\r\nif a<b:\r\n\ta+=1\r\nelse:\r\n\tb+=1\r\nif a<b:\r\n\tprint(\"Masha\")\r\nelif a>b:\r\n\tprint(\"Dasha\")\r\nelse:\r\n\tprint(\"Equal\")\r\n'''\r\nd=5\r\nm=3\r\n0-3 -> m(3)\r\n3-5 -> d(5)\r\n5-6 -> m(6)\r\n6-9 -> m(9)\r\n9-10 -> d(10)\r\n10-12 -> m(12)\r\n12-15 -> m(15)\r\n'''", "def hcfnaive(a,b): \r\n if(b==0): \r\n return a \r\n else: \r\n return hcfnaive(b,a%b) \r\na,b=list(map(int,input().split()))\r\nc=(a*b)//hcfnaive(a,b)\r\nd=c//a-1\r\nm=c//b-1\r\nif a>b:\r\n d=d+1\r\nelse:\r\n m=m+1\r\nif d>m:\r\n print(\"Dasha\")\r\nelif m>d:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Equal\")", "import math\r\n\r\ndef sol(d, m):\r\n end = d*m//math.gcd(d,m)\r\n dasha = end//d\r\n masha = end//m\r\n\r\n if abs(dasha-masha) < 2:\r\n return 'Equal'\r\n if dasha > masha:\r\n return 'Dasha'\r\n return 'Masha'\r\n\r\nif __name__=='__main__':\r\n d, m = map(int, input().split())\r\n\r\n print(sol(d, m))\r\n ", "'''input\n5 3\n'''\nfrom sys import stdin\nimport math\n\n\n# main starts\na, b = list(map(int, stdin.readline().split()))\nlcm = a * b // math.gcd(a, b)\nfirst = lcm // a\nsecond = lcm // b\nif a > b:\n\tsecond -= 1\nelse:\n\tfirst -= 1\nif first == second:\n\tprint('Equal')\nelif first > second:\n\tprint(\"Dasha\")\nelse:\n\tprint(\"Masha\")", "import math\r\nimport sys\r\ninput=sys.stdin.readline\r\na,b=list(map(int,input().split()))\r\nx=math.gcd(a,b)\r\na,b=a//x,b//x\r\nif abs(a-b)==1:\r\n print('Equal')\r\nelif a<b:\r\n print('Dasha')\r\nelse:\r\n print('Masha')", "a,b = list(map(int,input().split())); from math import gcd; m = (a*b)/gcd(a,b); arr = [m//a-1, m//b-1]; arr[arr.index(min(arr))]+=1; D = arr[0]; M = arr[1]\r\nif M>D : print('Masha')\r\nelif D>M : print('Dasha')\r\nelse : print('Equal')\r\n \r\n ", "a,b=map(int,input().split())\r\nfrom math import gcd\r\ng=gcd(a,b)\r\nitem=(a//g)*b\r\nmx=max(a,b)\r\nif mx==a:k=b\r\nelse:k=a\r\nres=0\r\nfor i in range(mx,item,mx):\r\n res+=i%k\r\nres+=k\r\nif mx==a:\r\n if res>(item-res):print('Dasha')\r\n elif res<(item-res):print('Masha')\r\n else:print('Equal')\r\nelse:\r\n if res>(item-res):print('Masha')\r\n elif res<(item-res):print('Dasha')\r\n else:print('Equal')", "from math import gcd\r\nimport sys\r\nt=1\r\ndef inp(): return sys.stdin.readline().strip()\r\n\r\ndef lcm(a, b):\r\n return abs(a*b) // gcd(a, b)\r\n \r\n \r\nfor _ in range(t):\r\n a, b=map(int, inp().split())\r\n period= lcm(a,b)\r\n d=period//a\r\n m=period//b\r\n if(a>b):\r\n m-=1\r\n else:\r\n d-=1\r\n if d>m:\r\n print('Dasha')\r\n elif d<m:\r\n print('Masha')\r\n else:\r\n print('Equal')\r\n \r\n \r\n \r\n \r\n \r\n ", "\r\ndasha, masha = list(map(int, input().split()))\r\nnum = dasha - masha\r\n\r\nif dasha % num == 0 and masha % num == 0:\r\n print(\"Equal\")\r\nelif dasha > masha:\r\n print(\"Masha\")\r\nelse: print(\"Dasha\")\r\n\r\n", "from math import trunc\r\n\r\n\r\ndef gcd(a, b):\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\r\n\r\n\r\na, b = map(int, input().split())\r\nlcm = int(a * b / gcd(a, b))\r\np, q = lcm // a, lcm // b\r\nif abs(p - q) == 1:\r\n print('Equal')\r\nelse:\r\n if a > b:\r\n print('Masha')\r\n else:\r\n print('Dasha')\r\n", "from math import gcd\r\n\r\na, b = map(int, input().split())\r\n\r\nlcm = a // gcd(a, b) * b\r\n\r\nif abs(lcm // a - lcm // b) == 1:\r\n print('Equal')\r\nelif a > b:\r\n print('Masha')\r\nelse:\r\n print('Dasha')\r\n", "a,b=map(int,input().split())\r\nc=a-b\r\nprint(\"Equal\"if a%c==0and b%c==0else\"Masha\"if a>b else\"Dasha\")", "import math\r\na,b=map(int,input().split())\r\nx=int((a*b)//math.gcd(a,b))\r\nta = (x/a)\r\ntb = (x/b)\r\nif max(ta,tb)-min(ta,tb)<=1:\r\n print(\"Equal\")\r\nelse:\r\n if max(ta,tb)==ta:\r\n print(\"Dasha\")\r\n elif max(ta,tb)==tb:\r\n print(\"Masha\")", "from math import gcd\r\na,b = map(int, input().split())\r\nlcm = a*b//gcd(a, b)\r\nd, m, ub1, ub2, i, j, last = 0, 0, lcm//a, lcm//b, 0, 0, 0\r\nwhile i<ub1 or j<ub2:\r\n if a*i < b*j:\r\n d+=(a*i-last)\r\n last = a*i\r\n i+=1\r\n else:\r\n m+=(b*j-last)\r\n last = b*j\r\n j+=1\r\nif d<m:\r\n d+=(lcm-last)\r\nelse:\r\n m+=(lcm-last)\r\n\r\nprint(\"Dasha\"*(d>m) + \"Masha\"*(m>d) + \"Equal\"*(d==m))\r\n \r\n ", "a, b=map(int, input().split())\r\ncurr=0\r\nif a%b==0:\r\n if a//b==2:\r\n print(\"Equal\")\r\n else:\r\n print(\"Masha\")\r\nelif b%a==0:\r\n if b//a==2:\r\n print(\"Equal\")\r\n else:\r\n print(\"Dasha\")\r\nelse:\r\n l1, l2=[a*i for i in range(1, b+1)], [b*i for i in range(1, a+1)]\r\n curr=0\r\n i, j=0, 0\r\n d, m=0, 0\r\n while i<b and j<a:\r\n if l1[i]-curr<l2[j]-curr:\r\n d+=l1[i]-curr\r\n curr=l1[i]\r\n i+=1\r\n elif l1[i]-curr>l2[j]-curr:\r\n m+=l2[j]-curr\r\n curr=l2[j]\r\n j+=1\r\n else:\r\n if a>b:\r\n d+=l1[i]-curr\r\n curr=l1[i]\r\n i+=1\r\n else:\r\n m+=l2[j]-curr\r\n curr=l2[j]\r\n j+=1\r\n if d>m:\r\n print(\"Dasha\")\r\n elif m>d:\r\n print(\"Masha\")\r\n else:\r\n print(\"Equal\")", "from fractions import gcd\r\na, b = map(int, input().split())\r\ng = (a * b) // gcd(a, b)\r\na = g // a;\r\nb = g // b;\r\nif a < b:\r\n a += 1\r\nelse:\r\n b += 1\r\nif a > b:\r\n print(\"Dasha\")\r\nelif a < b:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Equal\")", "import heapq\r\nfrom collections import *\r\nimport math\r\n\r\ndef lcm(a, b):\r\n return (a*b)//math.gcd(a, b)\r\n\r\ndef factorial(n):\r\n fact = 1\r\n for i in range(1, n + 1):\r\n fact = fact * i\r\n fact %= (1000000007)\r\n return fact\r\n\r\ndef solve():\r\n\r\n n, m = map(int, input().split())\r\n x, y = n, m\r\n d = defaultdict(int)\r\n t = n*m\r\n a = t//n - 1\r\n b = t//m - 1\r\n c = -1\r\n c += math.gcd(n,m)\r\n # print(c)\r\n if n > m:\r\n if a+1 == b-c:\r\n print(\"Equal\")\r\n else:\r\n print(\"Masha\")\r\n else:\r\n if a-c == b+1:\r\n print(\"Equal\")\r\n else:\r\n print(\"Dasha\")\r\n\r\n# t = int(input())\r\n# for _ in range(t):\r\n# solve()\r\nsolve()", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\na, b = map(int, input().split())\r\na0, b0 = a, b\r\nl = lcm(a, b)\r\nu, v = 0, 0\r\ns = 0\r\nwhile True:\r\n if a0 < b0:\r\n u += a0 - s\r\n s = a0\r\n a0 += a\r\n elif a0 > b0:\r\n v += b0 - s\r\n s = b0\r\n b0 += b\r\n else:\r\n if a > b:\r\n u += a0 - s\r\n else:\r\n v += b0 - s\r\n break\r\nif u < v:\r\n ans = \"Masha\"\r\nelif u > v:\r\n ans = \"Dasha\"\r\nelse:\r\n ans = \"Equal\"\r\nprint(ans)", "a, b = list(map(int, input().split()))\n\ndef gcd(a, b):\n while b:\n a, b = b, a%b\n return a\n\nx = gcd(a, b)\na //= x\nb //= x\nif abs(a-b) == 1 or a == b:\n print(\"Equal\")\nelse:\n if a < b: print(\"Dasha\")\n else: print(\"Masha\")\n", "from math import gcd\na, b = map(int, input().split())\n\ng = gcd(a, b)\n\na //= g\nb //= g\n\nif abs(b - a) == 1:\n print('Equal')\nelif a > b:\n print('Masha')\nelse:\n print('Dasha')\n", "a, b = map(int, input().split(' '))\r\n\r\ndef gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\ndef lcm(x, y):\r\n lcm = (x*y)//gcd(x,y)\r\n return lcm\r\n\r\nabm = lcm(a, b)\r\nca = abm / a\r\ncb = abm / b\r\n\r\nif a < b:\r\n cb += 1\r\nelse:\r\n ca += 1\r\n\r\nif ca > cb:\r\n print(\"Dasha\")\r\nelif cb > ca:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Equal\")\r\n", "import math\r\na,b = map(int,input().split())\r\ng = (a*b)//math.gcd(a,b)\r\nd,m = 0,0\r\nt = 0\r\ni,j = 1,1\r\nwhile t<g:\r\n if a*i<b*j:\r\n d+=a*i-t\r\n t=a*i\r\n i+=1\r\n elif b*j<a*i:\r\n m+=b*j-t\r\n t=b*j\r\n j+=1\r\n else:\r\n if a<b:\r\n m+=b*j-t\r\n t=b*j\r\n j+=1\r\n else:\r\n d+=a*i-t\r\n t=a*i\r\n i+=1\r\n \r\nif m==d:\r\n print(\"Equal\")\r\nelif m>d:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Dasha\")", "import math\n\ndef gcd(a, b):\n if b == 0:\n return a;\n return gcd(b, a % b)\n\ndef main():\n a,b = [int(x) for x in input().split()]\n g = gcd(a, b)\n lcm = (a * b) / g\n i = a\n j = b\n curr = 0\n count_a = count_b = 0\n while i <= lcm and j <= lcm:\n if i < j:\n count_a += (i - curr)\n curr = i\n i += a\n elif j < i:\n count_b += (j - curr)\n curr = j\n j += b\n else:\n if a > b:\n count_a += (i - curr)\n curr = i\n i += a\n else:\n count_b += (j - curr)\n curr = j\n j += b\n\n # print(count_a, count_b)\n if count_a == count_b:\n print(\"Equal\")\n elif count_a > count_b:\n print(\"Dasha\")\n else:\n print(\"Masha\")\n\n\nif __name__ == '__main__':\n main()\n", "from math import gcd\r\n \r\n \r\ndef lcm(a, b):\r\n return (a * b) // gcd(a, b)\r\n \r\n \r\ni = 0\r\n \r\na, b = map(int, input().split())\r\n \r\nfirst = False\r\nsecond = False\r\n \r\nmasha = 0\r\ndasha = 0\r\n \r\nwhile i < lcm(a, b):\r\n if first:\r\n masha += b - (i % b)\r\n i += b - (i % b)\r\n elif second:\r\n dasha += a - (i % a)\r\n i += a - (i % a)\r\n \r\n if i % a == 0 and i % b == 0:\r\n if a > b:\r\n first = True\r\n second = False\r\n else:\r\n first = False\r\n second = True\r\n \r\n elif first:\r\n second = True\r\n first = False\r\n else:\r\n first = True\r\n second = False\r\n \r\nif masha > dasha:\r\n print(\"Dasha\")\r\nelif dasha > masha:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Equal\")", "import math\r\na,b=map(int, input().split())\r\nd=0\r\nm=0\r\nlcm=a*b//math.gcd(a,b)\r\nd+=lcm//a-1\r\nm+=lcm//b-1\r\nif a<b:\r\n m+=1\r\nelse:\r\n d+=1\r\n\r\nif d>m:\r\n print('Dasha')\r\nelif m>d:\r\n print('Masha')\r\nelse:\r\n print('Equal')\r\n#print(m,d)\r\n", "a,b=[int(x) for x in input().split()]\ndef hcf(a,b):\n\tif a==0:\n\t\treturn b\n\treturn hcf(b%a,a)\nlcm=(a*b)/hcf(a,b)\nd=lcm/a\nm=lcm/b\nif d-m>1:\n\tprint('Dasha')\nelif m-d>1:\n\tprint('Masha')\nelse:\n\tprint('Equal')\n", "a,b=list(map(int,input().split()))\r\ndef compute_gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n\r\nk = (a*b)//compute_gcd(a,b)\r\nD=(k/a)-1\r\nM=(k/b)-1\r\nif M<D:\r\n M+=1\r\nelse:\r\n D+=1\r\nif M>D:\r\n print(\"Masha\")\r\nelif M==D:\r\n print(\"Equal\")\r\nelse:\r\n print(\"Dasha\") \r\n ", "import math\nimport sys\n\n\ndef solve(a, b):\n g = math.gcd(a, b)\n a = a // g\n b = b // g\n\n if a < b:\n if a > b - 1:\n return \"Masha\"\n if a == b - 1:\n return \"Equal\"\n return \"Dasha\"\n\n else: # a > b\n if b > a - 1:\n return \"Dasha\"\n if b == a - 1:\n return \"Equal\"\n return \"Masha\"\n\n\n\ndef readinput():\n n, m = map(int, sys.stdin.readline().rstrip().split(\" \"))\n print(solve(n, m))\n\n\nreadinput()\n", "a,b=map(int,input().split())\r\nx,y=a,b\r\nwhile(y):\r\n x, y = y, x % y\r\nn=a*b//x\r\nd=n/a\r\nm=n/b\r\nif(a>b):\r\n d+=1\r\nif(b>a):\r\n m+=1\r\nif d>m:\r\n print('Dasha')\r\nelif m>d:\r\n print('Masha')\r\nelse:\r\n print('Equal')", "def gcd(a, b):\r\n return (a if b == 0 else gcd(b, a % b))\r\na, b = map(int, input().split())\r\nlcm = a * b / gcd(a, b)\r\nka, kb = lcm // a, lcm // b\r\nif a > b:\r\n kb -= 1\r\nelse:\r\n ka -= 1\r\nprint(\"Equal\" if ka == kb else (\"Dasha\" if ka > kb else \"Masha\"))", "import sys\r\n\r\n\r\ndef _gcd(a, b):\r\n if b == 0:\r\n return a\r\n return _gcd(b, a % b)\r\n\r\n\r\ndef gcd(a, b):\r\n return _gcd(max(a, b), min(a, b))\r\n\r\ndef get_sieve(a, b, n):\r\n result = []\r\n for i in range(a, n + 1, a):\r\n result.append(i)\r\n for j in range(b, n + 1, b):\r\n result.append(j)\r\n result.sort()\r\n return result\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n a, b = (int(i) for i in read().split())\r\n lcm = (a * b) // gcd(a, b)\r\n sieve = get_sieve(a, b, lcm)\r\n minutes_a = minutes_b = 0\r\n prev = 0\r\n for val in sieve:\r\n time_dif = val - prev\r\n if val == lcm:\r\n if a < b:\r\n minutes_b += time_dif\r\n else:\r\n minutes_a += time_dif\r\n break\r\n elif val % a == 0:\r\n minutes_a += time_dif\r\n else:\r\n minutes_b += time_dif\r\n prev = val\r\n if minutes_a > minutes_b:\r\n print('Dasha')\r\n elif minutes_b > minutes_a:\r\n print('Masha')\r\n else:\r\n print('Equal')\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def GCD(a,b):\r\n\tif b==0:\r\n\t\treturn a\r\n\telse:\r\n\t\treturn GCD(b,a%b)\r\ns = input()\r\na = int(s.split()[0])\r\nb = int(s.split()[1])\r\ng = GCD(a,b)\r\nl = a*b//g\r\nx = l//a\r\ny = l//b\r\nif x==y or abs(x-y)==1:\r\n\tprint('Equal')\r\nelif x>y:\r\n\tprint('Dasha')\r\nelse:\r\n\tprint('Masha')", "import math\r\na,b=list(map(int,input().split()))\r\nl=(a*b)//math.gcd(a,b)\r\nx=l//a\r\ny=l//b\r\nif a>b:\r\n y-=1\r\nelse:\r\n x-=1\r\nif x==y:\r\n print(\"Equal\")\r\nelif x>y:\r\n print(\"Dasha\")\r\nelse:\r\n print(\"Masha\")", "\r\ndef mcd(a,b):\r\n while b != 0:\r\n a,b = b, a % b\r\n return a\r\n\r\ndatos = input().split()\r\nd = int(datos[0])\r\nm = int(datos[1])\r\n\r\nmcd = mcd(d,m)\r\nif abs(d-m) == 1 or d-m == mcd or m-d == mcd:\r\n print('Equal')\r\nelif d - m > 0:\r\n print('Masha')\r\nelse:\r\n print('Dasha')", "a,b=map(int,input().split())\r\ng=lambda x,y:g(y%x,x)if x else y\r\nc=a//g(a,b)*b\r\nA=a\r\nB=b\r\nr=t=0\r\nwhile 1:\r\n if A<B:r+=A-t;t=A;A+=a\r\n elif B<A:r+=t-B;t=B;B+=b\r\n else:r+=(A-t)*(0if a==b else [-1,1][a>b]);break\r\nprint('Masha'if r<0else['Equal','Dasha'][r>0])", "a, b = map(int, input().split())\r\nflag = 0\r\nif a > b:\r\n flag = 1\r\n a, b = b, a\r\nk, x, y = 1, 0, 0\r\nwhile b * k % a:\r\n x += b - b * k % a\r\n y += b * k % a\r\n k += 1\r\nx += b - a\r\ny += a\r\nprint([['Masha', 'Equal'][x == y], 'Dasha'][flag and y > x or not flag and x > y])", "a,b=map(int,input().split())\r\nd=a\r\nf=b\r\ndef gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a,a)\r\ndef lcm(a,b):\r\n return (a*b) / gcd(a,b)\r\nz=lcm(a,b)\r\n#print(z)\r\nx=(z-1)//d\r\ny=(z-1)//f\r\n#print(x,y)\r\nif(a>b):\r\n x=x+1\r\nelse:\r\n y=y+1\r\n#print(x,y)\r\nif(x==y):\r\n print(\"Equal\")\r\nelif(x>y):\r\n print(\"Dasha\")\r\nelse:\r\n print(\"Masha\")\r\n", "import math\r\n\r\nl,r = map(int, input().split())\r\ng = math.gcd(l,r)\r\na1 = l//g\r\na2 = r//g\r\nif l > r:\r\n a1 -= 1\r\nelse:\r\n a2 -= 1\r\nif a1 == a2: print('Equal')\r\nelif a2 < a1: print('Masha')\r\nelse: print('Dasha')", "a, b = map(int, input().split())\nswapped = False\nif b < a:\n a, b = b, a\n swapped = True\na_count, b_count = 0, 0\nt = 0\nwhile True:\n t += b\n if t % a == 0:\n a_count += b - a\n b_count += a\n break\n else:\n a_count += b - t % a\n b_count += t % a\nif swapped:\n a_count, b_count = b_count, a_count\nif a_count > b_count:\n print('Dasha')\nelif a_count < b_count:\n print('Masha')\nelse:\n print('Equal')\n", "\r\ndef gcd(a,b):\r\n\r\n return a if b==0 else gcd(b,a%b)\r\n\r\ndef lcm(a,b):\r\n cm=a*b\r\n if a<b: a,b=b,a\r\n return cm//gcd(a,b)\r\n\r\na,b=map(int,input().split())\r\ngirlFriend=[\"Dasha\",\"Masha\"]\r\nif a<b:\r\n a,b=b,a\r\n girlFriend.reverse()\r\ncm=lcm(a,b)\r\nif cm//a>(cm//b-1):print(girlFriend[0])\r\nelif cm//a==(cm//b-1):print(\"Equal\")\r\nelse: print(girlFriend[1])\r\n", "import math\r\na, b = map(int,input().split())\r\nif a == b :\r\n print(\"Equal\")\r\n exit()\r\nhcf = math.gcd(a,b)\r\na //= hcf\r\nb //= hcf\r\nif (min(a,b)*(min(a,b)+1)) == (a*b) :\r\n print(\"Equal\")\r\nelse :\r\n if a > b :\r\n print(\"Masha\")\r\n else :\r\n print(\"Dasha\")", "d, m = map(int, input().split())\r\ng, l = max(d, m), min(d, m)\r\nwhile True:\r\n if not(g % l): break\r\n g, l = l, g%l\r\nlcm = (d * m) // l\r\ndcnt = (lcm // d) - 1\r\nmcnt = (lcm // m) - 1\r\nif d > m: dcnt += 1\r\nelse: mcnt += 1\r\nif (dcnt == mcnt): print(\"Equal\")\r\nelif (dcnt > mcnt): print(\"Dasha\")\r\nelse: print(\"Masha\")", "\r\nfrom math import gcd\r\ndef lcm(x , y):\r\n return (x*y) // gcd(x , y)\r\n\r\na , b = map(int,input().split())\r\n\r\nr1 = lcm(a , b)\r\nr2 = r1 // a\r\nr3 = r1 // b\r\nr2 -= 1\r\nr3 -= 1\r\n\r\nif r2 < r3 :\r\n r2 += 1\r\nif r3 < r2 :\r\n r3 += 1\r\n\r\nif r2 == r3:\r\n print('Equal')\r\nelif r2 > r3 :\r\n print('Dasha')\r\nelse:\r\n print('Masha')\r\n\r\n\r\n", "a, b = input().split()\na = int(a); b = int(b)\n\ndef gcd(a, b):\n\tif a < b:\n\t\treturn gcd(b, a)\n\telif not a%b:\n\t\treturn b\n\treturn gcd(b, a%b)\n\nlcm = a*b//gcd(a, b)\n\nif a > b:\n\td_count = lcm//a\n\tm_count = lcm//b - 1\n\n\tif m_count > d_count:\n\t\tprint(\"Masha\")\n\telif m_count == d_count:\n\t\tprint(\"Equal\")\n\telse:\n\t\tprint(\"Dasha\")\nelse:\n\n\td_count = lcm//a - 1\n\tm_count = lcm//b\n\n\tif m_count > d_count:\n\t\tprint(\"Masha\")\n\telif m_count == d_count:\n\t\tprint(\"Equal\")\n\telse:\n\t\tprint(\"Dasha\")\n", "from math import gcd\r\n\r\na,b = [int(x) for x in input().split()]\r\n\r\n\r\ndef lcm(a,b):\r\n\treturn a*b/gcd(a,b)\r\n\r\nm =(lcm(a,b))\r\nx = m//a\r\ny=m//b\r\n\r\nif (x<y): \r\n\tx+=1\r\nelse:\r\n\ty+=1\r\n\r\nif(x==y):\r\n\tprint(\"Equal\")\r\n\texit()\r\nif x > y:\r\n\tprint(\"Dasha\")\r\nelse:\r\n\tprint(\"Masha\")", "from math import gcd\r\n\r\ndef lcm(a, b):\r\n return (a // gcd(a, b)) * b\r\n \r\ndef main():\r\n a, b = list(map(int, input().split()))\r\n mcount = 0\r\n dcount = 0\r\n total = lcm(a, b)\r\n dcount += (total // a) - 1\r\n mcount += (total // b) - 1\r\n if (a < b):\r\n mcount += 1\r\n else:\r\n dcount += 1\r\n if mcount > dcount:\r\n print(\"Masha\")\r\n elif mcount == dcount:\r\n print(\"Equal\")\r\n else:\r\n print(\"Dasha\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a,b=map(int,input().split())\r\nif(a==b):\r\n print('Equal')\r\n exit()\r\nimport math\r\n\r\nlcm=(a*b)//(math.gcd(a,b))\r\nif(a<b):\r\n da=(lcm//a)-1\r\n ma=lcm//b\r\n if(da>ma):\r\n print('Dasha')\r\n elif(da<ma):\r\n print('Masha')\r\n else:\r\n print('Equal')\r\nelse:\r\n da=(lcm//a)\r\n ma=(lcm//b)-1\r\n if(da>ma):\r\n print('Dasha')\r\n elif(da<ma):\r\n print('Masha')\r\n else:\r\n print('Equal')\r\n \r\n", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# gcd of two numbers\r\ndef gcd(a, b):\r\n if a < b:\r\n return gcd(b, a)\r\n if b == 0:\r\n return a\r\n return gcd(b, a % b)\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 a, b = get_ints_in_variables()\r\n gc = gcd(a, b)\r\n a = a//gc\r\n b = b//gc\r\n if abs(a-b) <= 1:\r\n print(\"Equal\")\r\n return\r\n n = a*b\r\n if a < b:\r\n a = (n/a)-1\r\n b = n/b\r\n else:\r\n a = (n/a)\r\n b = (n/b)-1\r\n if a > b:\r\n print(\"Dasha\")\r\n elif a < b:\r\n print(\"Masha\")\r\n else:\r\n print(\"Equal\")\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "import math \r\na,b = map(int,input().split())\r\nx = math.gcd(a,b)\r\na = a//x\r\nb = b//x\r\nif a<b:\r\n if b-a>1:\r\n print(\"Dasha\")\r\n else:\r\n print(\"Equal\")\r\nelse:\r\n if a-b<=1:\r\n print(\"Equal\")\r\n else:\r\n print(\"Masha\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom math import gcd\r\na, b = map(int, input().split())\r\nx = gcd(a, b)\r\na //= x\r\nb //= x\r\nif abs(a-b) == 1:\r\n print('Equal')\r\nelse:\r\n print('Dasha' if a < b else 'Masha')", "def gcd(a,b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n \r\ndef lcm(a,b):\r\n return (a / gcd(a,b))* b\r\n\r\na,b = map(int,input().split())\r\nflag=0\r\nif a>b:\r\n lcmOf = lcm(b,a)\r\n flag=1\r\nelse:\r\n lcmOf = lcm(a,b)\r\nfreq={}\r\nfreq[a] = lcmOf//a\r\nfreq[b] = lcmOf//b\r\nif freq[a]<freq[b]:\r\n freq[b]-=1\r\nelse:\r\n freq[a]-=1\r\n \r\nif freq[a]>freq[b]:\r\n print('Dasha')\r\nelif freq[a]<freq[b]:\r\n print('Masha')\r\nelse:\r\n print('Equal')", "a,b=map(int,input().split())\r\nfrom math import gcd\r\nx=0\r\ny=0\r\nlcm=(a*b)//(gcd(a,b))\r\nif a>b:\r\n f=lcm//a\r\n for i in range(1,f):\r\n x+=(a*i)%b\r\n x+=b\r\n y=lcm-x\r\nelse:\r\n f=lcm//b\r\n for i in range(1,f):\r\n y+=(b*i)%a\r\n y+=a\r\n x=lcm-y\r\nif x>y:\r\n print(\"Dasha\")\r\nelif x<y:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Equal\")\r\n\r\n \r\n", "a,b = input().split(\" \")\r\na,b = int(a),int(b)\r\nc=a-b\r\nif(a%c == 0 and b%c == 0):\r\n print(\"Equal\")\r\nelif(a>b):\r\n print(\"Masha\")\r\nelse:\r\n print(\"Dasha\")", "from math import lcm\r\nx,y = list(map(int, input().split()))\r\nnex = [x, y]\r\nadd = [x, y]\r\nif x < y:\r\n\tmini = 1\r\nelse:\r\n\tmini = 0\r\nmaxi = lcm(x, y)\r\ngoes = [0, 0]\r\ncur = 0\r\nwhile cur < maxi:\r\n\t# print(cur, nex)\r\n\tif nex[0] < nex[1]:\r\n\t\tgoes[0] += nex[0] - cur\r\n\t\tcur = nex[0]\r\n\t\tnex[0] += x\r\n\telif nex[0] > nex[1]:\r\n\t\tgoes[1] += nex[1] - cur\r\n\t\tcur = nex[1]\r\n\t\tnex[1] += y\r\n\telse:\r\n\t\tgoes[mini] += nex[mini] - cur\r\n\t\tcur = nex[mini]\r\n\t\tnex[mini] += add[mini]\r\n\t# print(goes)\r\nif goes[0] < goes[1]:\r\n\tprint(\"Masha\")\r\nelif goes[0] > goes[1]:\r\n\tprint(\"Dasha\")\r\nelse:\r\n\tprint(\"Equal\")\r\n\r\n\r\n", "x,y = map(int, input().split())\nd = None\nif x < y:\n\td = ['Dasha', 'Masha']\nelse:\n\tx,y = y,x\n\td = ['Masha', 'Dasha']\nYscore = 0\nfor i in range(y, x * y + 1, y):\n\tYscore += (i - (((i - 1)// x) * x))\nXscore = x * y - Yscore\nif Xscore > Yscore:\n\tprint(d[0])\nelif Xscore < Yscore:\n\tprint(d[1])\nelse:\n\tprint('Equal')", "a, b = [int(i) for i in input().split()]\r\nc = a - b\r\nif a % c == 0 and b % c == 0:\r\n print(\"Equal\")\r\nelif a > b:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Dasha\")\r\n\r\n", "from math import gcd\r\na,b = list(map(int,input().split()))\r\ng = gcd(a,b)\r\na = a//g\r\nb = b//g\r\nif abs(a-b)==1:\r\n print(\"Equal\")\r\nelif a<b:\r\n print(\"Dasha\")\r\nelse:\r\n print(\"Masha\")", "from math import gcd\r\n\r\na, b = map(int, input().split())\r\n\r\nnod = gcd(a, b)\r\na /= nod\r\nb /= nod\r\n\r\nif abs(a - b) == 1:\r\n print('Equal')\r\nelif a < b:\r\n print('Dasha')\r\nelse:\r\n print('Masha')\r\n", "a, b = map(int, input().split())\r\n\r\nta, tb, t, ka, kb = a, b, 0, 0, 0\r\n\r\nwhile ta != tb:\r\n if ta < tb:\r\n ka += ta - t\r\n t = ta\r\n ta += a\r\n else:\r\n kb += tb - t\r\n t = tb\r\n tb += b\r\n \r\nif a > b:\r\n ka += ta - t\r\nelse:\r\n kb += tb - t\r\n\r\nif ka == kb:\r\n print(\"Equal\")\r\nelif ka < kb:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Dasha\")", "a, b = map(int, input().split())\n\n\ndef gcd(b, s):\n while b % s:\n tmp = b % s\n b = s\n s = tmp\n return s\n\n\ndef lcm(x, y):\n return (x * y) // gcd(x, y)\n\n\np = lcm(a, b)\ncnt1, cnt2 = (p // a, p // b - 1) if a > b else (p // a - 1, p // b)\n\n# print(p, cnt1, cnt2)\n# print(gcd(a, b))\nif cnt1 > cnt2:\n print(\"Dasha\")\nelif cnt1 < cnt2:\n print(\"Masha\")\nelse:\n print(\"Equal\")\n", "from math import gcd\r\nd,m=map(int,input().split())\r\nlcm=d*m//(gcd(d,m))\r\na=lcm//d\r\nb=lcm//m\r\nif d>m:\r\n b-=1\r\nelse:\r\n a-=1\r\nif a>b:\r\n print(\"Dasha\")\r\nelif a==b:\r\n print(\"Equal\")\r\nelse:\r\n print(\"Masha\")", "MOD = 1000000007\r\nii = lambda: int(input())\r\nsi = lambda: input()\r\ndgl = lambda: list(map(int, input()))\r\nf = lambda: map(int, input().split())\r\nil = lambda: list(map(int, input().split()))\r\nls = lambda: list(input())\r\nfrom math import gcd\r\na,b=f()\r\nlcm=(a*b)/gcd(a,b)\r\nx=lcm//a\r\ny=lcm//b\r\nif a>b:\r\n x+=1\r\nelse:\r\n y+=1\r\nif x>y:\r\n print('Dasha')\r\nelif y>x:\r\n print('Masha')\r\nelse:\r\n print('Equal')", "from math import *\r\na,b = map(int,input().split())\r\nlcm = a*b//gcd(a,b)\r\ncta = lcm//a\r\nctb = lcm//b\r\nif(a > b):\r\n\tctb -= 1\r\nelse:\r\n\tcta -= 1\r\nif(cta > ctb):\r\n\tprint(\"Dasha\")\r\nelif(ctb > cta):\r\n\tprint(\"Masha\")\r\nelse:\r\n\tprint(\"Equal\")", "def gcd(a, b):\r\n if (a > b):\r\n a, b = b, a\r\n while(a != 0):\r\n a, b = b % a, a\r\n return b\r\n\r\na, b = map(int, input().split())\r\nk = a * b // gcd(a, b)\r\nansa = 0\r\nansb = 0\r\nif (a > b):\r\n b, a = a, b\r\n g = True\r\nelse:\r\n g = False\r\nfor i in range(1, k // b + 1):\r\n if (i != k // b):\r\n ansb = ansb + i * b - i * b // a * a\r\n else:\r\n ansb = ansb + i * b - (k - 1) // a * a\r\nansa = k - ansb\r\nif g:\r\n ansa, ansb = ansb, ansa\r\n#print(ansa, ansb)\r\nif (ansa == ansb):\r\n print('Equal')\r\nelif (ansa > ansb):\r\n print('Dasha')\r\nelse:\r\n print('Masha')", "from math import gcd\r\nn, m = map(int, input().split())\r\nl = (n * m)//gcd(n, m)\r\nif abs(l//n - l//m) == 1:\r\n print(\"Equal\")\r\nelse:\r\n print(\"Dasha\" if n < m else \"Masha\")", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\nfrom math import gcd\r\n\r\n\r\ndef solve():\r\n a, b = read_tuple(int)\r\n lcm = (a * b) // gcd(a, b)\r\n n_a, n_b = lcm // a, lcm // b\r\n if a < b:\r\n n_a -= 1\r\n elif b < a:\r\n n_b -= 1\r\n if n_a > n_b:\r\n print(\"Dasha\")\r\n elif n_a < n_b:\r\n print(\"Masha\")\r\n else:\r\n print(\"Equal\")\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n solve()", "import math\r\nimport sys\r\nimport collections\r\nfrom collections import Counter\r\nimport bisect\r\nimport string\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 tc in range(1):\r\n a,b=get_ints()\r\n ans_a=0\r\n ans_b=0\r\n maxim=a*b//math.gcd(a,b)\r\n m1=1\r\n m2=1\r\n i=0\r\n while i<maxim:\r\n if a*m1==b*m2:\r\n i=a*m1\r\n m1+=1\r\n m2+=1\r\n if a<b:\r\n ans_b+=1\r\n else:\r\n ans_a+=1\r\n continue\r\n if abs(i-(m1*a))<abs(i-(m2*b)):\r\n ans_a+=1\r\n m1+=1\r\n else:\r\n ans_b+=1\r\n m2+=1\r\n if ans_a>ans_b:\r\n print(\"Dasha\")\r\n elif ans_a<ans_b:\r\n print(\"Masha\")\r\n else:\r\n print(\"Equal\")", "import sys\r\nfrom array import array # noqa: F401\r\nfrom math import gcd\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\na, b = map(int, input().split())\r\ng = gcd(a, b)\r\na, b = a // g, b // g\r\n\r\nif abs(a - b) == 1:\r\n print('Equal')\r\nelse:\r\n if a < b:\r\n print('Dasha')\r\n else:\r\n print('Masha')\r\n", "from math import gcd\r\na,b = map(int,input().split(' '))\r\ngcd = gcd(a,b)\r\na,b = a/gcd, b/gcd\r\nif abs(a-b) <= 1: print('Equal')\r\nelif a < b: print('Dasha')\r\nelse: print('Masha')", "import sys\nfrom math import *\nfrom fractions import gcd\nreadints=lambda:map(int, input().strip('\\n').split())\n\n\na,b=readints()\nlcm = a*b//gcd(a,b)\n\n\ndasha=0\nmasha=0\n\np=a\nq=b\nlast=0\n\nwhile True:\n # print(dasha,masha,p,q)\n if p==q:\n if a>b:\n dasha += p-last\n else:\n masha += q-last\n break\n else:\n if p<q:\n dasha += p-last\n last = p\n p += a\n else:\n masha += q-last\n last = q\n q += b\n \nif dasha>masha:\n print('Dasha')\nelif dasha<masha:\n print('Masha')\nelse:\n print('Equal')\n", "from math import gcd\r\n\r\na, b = (int(x) for x in input().split())\r\nupper = a * b / gcd(a,b)\r\nm, d = upper/b, upper/a\r\nif a < b: d -= 1\r\nelse: m -= 1\r\n\r\nif d > m: print(\"Dasha\")\r\nelif m > d: print(\"Masha\")\r\nelse: print(\"Equal\")\r\n", "n,m=map(int,input().split())\r\nb=max(n,m)\r\nc=b\r\ncount=0\r\nwhile True:\r\n if(c%n==0 and c%m==0):\r\n break\r\n c+=b\r\nx=c//n\r\ny=c//m\r\nif(abs(x-y)==1):\r\n print(\"Equal\")\r\nelif(b==n):\r\n print(\"Masha\")\r\nelse:\r\n print(\"Dasha\")", "import sys\r\nimport math\r\nfrom collections import defaultdict\r\nfrom itertools import permutations\r\nfrom collections import deque\r\n\r\ndef sin():\r\n\treturn int(sys.stdin.readline())\r\n\r\ndef array():\r\n\treturn list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef two():\r\n\treturn map(int, sys.stdin.readline().strip().split())\r\n\r\ndef multiple():\r\n\treturn [int(x) for x in sys.stdin.readline().split()]\r\n\r\ndef string():\r\n\treturn sys.stdin.readline().strip()\r\n\r\n\r\na,b = multiple()\r\n\r\nlcm = math.lcm(a,b)\r\n\r\nx = (lcm) // a\r\ny = (lcm) // b\r\n\r\nif x > y:\r\n\ty += 1\r\nelse:\r\n\tx += 1\r\n\r\nif x == y:\r\n\tprint(\"Equal\")\r\nelif x > y:\r\n\tprint(\"Dasha\")\r\nelse:\r\n\tprint(\"Masha\")", "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 int(a * b / gcd(a,b))\r\n\r\na, b = (int(x) for x in input().split())\r\nc, d, e, f = [], [], lcm(a, b), a\r\nwhile f <= e:\r\n c.append(f)\r\n f += a\r\nf = b\r\nwhile f<= e:\r\n d.append(f)\r\n f += b\r\nif a < b:\r\n c.remove(e)\r\nelse:\r\n d.remove(e)\r\nif len(c) > len(d):\r\n print('Dasha')\r\nelif len(c) == len(d):\r\n print('Equal')\r\nelse:\r\n print('Masha')\r\n", "from math import gcd\r\n\r\n\r\ndef lcm(a, b):\r\n return a // gcd(a, b) * b\r\n\r\n\r\na, b = map(int, input().split())\r\nen = lcm(a, b)\r\ndasha, masha = en // a, en // b\r\nif a > b:\r\n dasha += 1\r\nelse:\r\n masha += 1\r\nif masha > dasha:\r\n print('Masha')\r\nelif masha < dasha:\r\n print('Dasha')\r\nelse:\r\n print('Equal')\r\n\r\n", "a,b=map(int,input().split())\r\nc=a-b\r\nif a%c==0 and b%c==0:\r\n print(\"Equal\")\r\nelif a>b:\r\n print(\"Masha\")\r\nelse:\r\n print(\"Dasha\")\r\n", "from fractions import gcd\r\na, b = map(int, input().split())\r\na, b = a // gcd(a, b), b // gcd(a, b)\r\nif abs(a - b) <= 1: print(\"Equal\")\r\nelif a < b: print(\"Dasha\")\r\nelse: print(\"Masha\")", "def get_lcm(x, y):\r\n h = max(x, y)\r\n while True:\r\n if h%x == 0 and h%y == 0:\r\n return h\r\n h += max(x,y)\r\n\r\na, b = map(int, input().split())\r\nf = get_lcm(a, b)\r\nd = f/a\r\nm = f/b\r\n\r\nd = d + 1 if d < m else d - 1\r\n\r\nif d > m:\r\n print('Dasha')\r\nelif d < m:\r\n print('Masha')\r\nelse:\r\n print('Equal')", "# LUOGU_RID: 104833737\nfrom math import gcd\r\na, b = map(int, input().split())\r\nprint('Equal' if gcd(a, b) == abs(b - a) else 'Dasha' if a < b else 'Masha')\r\n", "from __future__ import division, print_function\nfrom ast import IfExp\nfrom audioop import reverse\nfrom email.policy import default\nimport math\nimport sys\nimport os\nfrom io import BytesIO, IOBase\nfrom tkinter import filedialog\nfrom collections import deque, Counter, OrderedDict, defaultdict\nimport heapq\nfrom math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\nimport bisect\nfrom bisect import bisect_left,bisect_right\n\nBUFSIZE = 8192\n\n\nclass FastIO(IOBase):\n\tnewlines = 0\n\n\tdef __init__(self, file):\n\t\tself._fd = file.fileno()\n\t\tself.buffer = BytesIO()\n\t\tself.writable = \"x\" in file.mode or \"r\" not in file.mode\n\t\tself.write = self.buffer.write if self.writable else None\n\n\tdef read(self):\n\t\twhile True:\n\t\t\tb = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n\t\t\tif not b:\n\t\t\t\tbreak\n\t\t\tptr = self.buffer.tell()\n\t\t\tself.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n\t\tself.newlines = 0\n\t\treturn self.buffer.read()\n\n\tdef readline(self):\n\t\twhile self.newlines == 0:\n\t\t\tb = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\n\t\t\tself.newlines = b.count(b\"\\n\") + (not b)\n\t\t\tptr = self.buffer.tell()\n\t\t\tself.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\n\t\tself.newlines -= 1\n\t\treturn self.buffer.readline()\n\n\tdef flush(self):\n\t\tif self.writable:\n\t\t\tos.write(self._fd, self.buffer.getvalue())\n\t\t\tself.buffer.truncate(0), self.buffer.seek(0)\n\n\nclass IOWrapper(IOBase):\n\tdef __init__(self, file):\n\t\tself.buffer = FastIO(file)\n\t\tself.flush = self.buffer.flush\n\t\tself.writable = self.buffer.writable\n\t\tself.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\n\t\tself.read = lambda: self.buffer.read().decode(\"ascii\")\n\t\tself.readline = lambda: self.buffer.readline().decode(\"ascii\")\n\n\ndef print(*args, **kwargs):\n\t\n\tsep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\n\tat_start = True\n\tfor x in args:\n\t\tif not at_start:\n\t\t\tfile.write(sep)\n\t\tfile.write(str(x))\n\t\tat_start = False\n\tfile.write(kwargs.pop(\"end\", \"\\n\"))\n\tif kwargs.pop(\"flush\", False):\n\t\tfile.flush()\n\n\nif sys.version_info[0] < 3:\n\tsys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\nelse:\n\tsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\n\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\n\ndef I():\n return(int(input()))\ndef lint():\n return(list(map(int,input().split())))\ndef insr():\n s = input().strip()\n return(list(s[:len(s)]))\ndef invr():\n return(map(int,input().split()))\nimport itertools\nfrom sys import maxsize, stdout, stdin,stderr\nmod = int(1e9+7)\nimport sys\ndef I(): return int(stdin.readline())\ndef lint(): return [int(x) for x in stdin.readline().split()]\ndef S(): return list(map(str,input().strip()))\ndef grid(r, c): return [lint() for i in range(r)]\nfrom collections import defaultdict, Counter, deque\nimport math\nimport heapq\nfrom heapq import heappop , heappush\nimport bisect\nfrom math import factorial, inf\nfrom itertools import groupby\nfrom itertools import permutations as comb\n\ndef gcd(a,b): \n while b:\n a %= b\n tmp = a\n a = b\n b = tmp\n \n return a\n \ndef lcm(a,b): \n return a // gcd(a, b) * b\n \nt=1\nfor _ in range(t):\n\ta,b=lint()\n\ttmp=lcm(a,b)\n\tc,d=tmp//a,tmp//b\n\tif(a<b):\n\t\td+=1\n\telif(a>b):\n\t\tc+=1\n\tif(c>d):\n\t\tprint(\"Dasha\")\n\telif (c<d):\n\t\tprint(\"Masha\")\n\telse:\n\t\tprint(\"Equal\")\n\t\n\n\n\t\t\n\t\n \t \t \t\t\t\t\t\t \t\t\t \t \t\t \t\t \t\t\t" ]

[ "def gcd(a,b):\r\n while a>0:\r\n x=a\r\n a=b%a\r\n b=x\r\n return(x)\r\ndef Bsearch1(L,x):\r\n beg=0\r\n last=len(L)-1\r\n while beg<=last:\r\n mid=(beg+last)//2\r\n if x==L[mid]:\r\n return(mid)\r\n elif(x>L[mid]):\r\n beg=mid+1\r\n else:\r\n last=mid-1\r\n else:\r\n return(beg)\r\ndef Bsearch2(L,x):\r\n beg=0\r\n last=len(L)-1\r\n while beg<=last:\r\n mid=(beg+last)//2\r\n if x==L[mid]:\r\n return(mid)\r\n elif(x>L[mid]):\r\n beg=mid+1\r\n else:\r\n last=mid-1\r\n else:\r\n return(last)\r\na,b=input().split()\r\na,b=[int(a),int(b)]\r\nx=gcd(a,b)\r\nfrom functools import reduce\r\ndef factors(n):\r\n x=set(reduce(list.__add__, \r\n ([i, n//i] for i in range(1, int(n**0.5) + 1) if n % i == 0)))\r\n return(list(x))\r\ndiv=factors(x)\r\ndiv.sort()\r\ny=int(input())\r\nfor j in range(y):\r\n c,d=input().split()\r\n c,d=[int(c),int(d)]\r\n f=Bsearch1(div,c)\r\n g=Bsearch2(div,d)\r\n if f>g:\r\n print(-1)\r\n else:\r\n print(div[g])\r\n \r\n", "import math\r\na,b=input().split()\r\na,b=[int(a),int(b)]\r\nn=int(input())\r\ng=math.gcd(a,b)\r\nar=[]\r\ni=1\r\nwhile i*i<=g:\r\n if g%i==0:\r\n ar.append(i)\r\n ar.append(g//i)\r\n i+=1\r\nar.sort(reverse=True)\r\nfor i in range(0,n):\r\n c,d=input().split()\r\n c,d=[int(c),int(d)]\r\n i=0\r\n flag=0\r\n if c==d:\r\n if a%c==0 and b%c==0:\r\n print(c)\r\n else:\r\n print(\"-1\")\r\n else:\r\n while i < len(ar):\r\n if ar[i] >= c and ar[i] <= d:\r\n flag = 1\r\n break\r\n i += 1\r\n if flag == 1:\r\n print(ar[i])\r\n else:\r\n print(\"-1\")", "# 2022-06-04T08:16:23Z\n\n\"\"\"\nInput\nThe first line contains two integers a and b, the two integers as described above (1 ≤ a, b ≤ 109). The second line contains one integer n, the number of queries (1 ≤ n ≤ 104). Then n lines follow, each line contains one query consisting of two integers, low and high (1 ≤ low ≤ high ≤ 109).\n\nOutput\nPrint n lines. The i-th of them should contain the result of the i-th query in the input. If there is no common divisor in the given range for any query, you should print -1 as a result for this query.\n\n\n\"\"\"\nimport math\nimport bisect\n\n\ndef proc():\n def factorize(g):\n f = set()\n for i in range(1, int(math.ceil(math.sqrt(g))) + 1):\n if g % i == 0:\n f.add(i)\n f.add(g // i)\n\n return sorted(f)\n\n def exist(m):\n bisect.bisect_right(f, m)\n return False\n\n g = math.gcd(a, b)\n f = list(reversed(factorize(g)))\n\n res = []\n for low, high in q:\n ans = -1\n for e in f:\n if low <= e <= high:\n ans = e\n break\n res.append(ans)\n return res\n\n\na, b = map(int, input().split())\nn = int(input())\nq = []\nfor _ in range(n):\n low, high = map(int, input().split())\n q.append((low, high))\n\nans = proc()\nfor v in ans:\n print(v)\n", "from math import gcd\r\na,b = list(map(int, input().split()))\r\n\r\ncd = gcd(a,b)\r\nar =[]\r\n\r\nfor i in range(1,int(cd**0.5)+1):\r\n if cd % i == 0:\r\n ar.append(i)\r\n if(i*i != cd):\r\n ar.append(cd//i)\r\n\r\nfor _ in range(int(input())):\r\n l,h = list(map(int, input().split()))\r\n res = -1\r\n for i in ar:\r\n if(i >= l and i <= h):\r\n res = max(res, i)\r\n \r\n print(res)\r\n\r\n", "import math\r\nfrom os import startfile\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\nimport heapq\r\nimport sys \r\ndef main(a,b,qu):\r\n\r\n\r\n d=math.gcd(a,b)\r\n\r\n factors=[] \r\n for i in range(1,int(math.sqrt(d))+1):\r\n \r\n q=d/i \r\n if q==int(q):\r\n factors.append(int(q))\r\n factors.append(i) \r\n factors.sort() \r\n\r\n for e in qu:\r\n \r\n mi,ma=e \r\n l=0\r\n h=len(factors)-1\r\n best_val=l\r\n while l<=h:\r\n \r\n m=(l+h)//2 \r\n val=factors[m]\r\n if val==ma:\r\n best_val=m\r\n break\r\n elif val<ma:\r\n l=m+1 \r\n best_val=m \r\n else:\r\n h=m-1 \r\n if mi<=factors[best_val] and factors[best_val]<=ma:\r\n print(factors[best_val])\r\n else:\r\n print(\"-1\")\r\n return\r\na,b=list(map(int,input().split()))\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nmain(a,b,arr)\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\ndef gcd(num1, num2):\r\n\tif num2 == 0:\r\n\t\treturn num1\r\n\r\n\treturn gcd(num2, num1 % num2)\r\n\r\n\r\n# def binary_s(left, right):\r\n# \twhile left <= right:\r\n# \t\tmid = left + (right - left)//2\r\n\r\n# \t\tif res1[mid] > right:\r\n# \t\t\tright = mid - 1\r\n# \t\telse \r\n\r\n\r\na, b = map(int, input().split())\r\nn = int(input())\r\nk = gcd(a, b)\r\nres1 = []\r\n\r\ni = 1\r\nwhile i * i <= k:\r\n\tif k % i == 0:\r\n\t\tres1.append(i)\r\n\t\tif i != k // i:\r\n\t\t\tres1.append(k // i)\r\n\ti += 1\r\n\r\nfor _ in range(n):\r\n\tl, r = map(int, input().split())\r\n\tans = -1\r\n\r\n\tfor d in res1:\r\n\t\tif l <= d <= r:\r\n\t\t\tans = max(ans, d)\r\n\r\n\tprint(ans)", "from math import isqrt,gcd\r\na, b = map(int, input().split())\r\nval = gcd(a,b)\r\ndivisors = []\r\nfor i in range(1,isqrt(val)+1):\r\n if val%i==0:\r\n divisors.append(i)\r\n if i*i!=val:\r\n divisors.append(val//i)\r\ndivisors.sort()\r\n\r\ndef search(x):\r\n lo = 0\r\n hi = len(divisors)-1\r\n ans = -1\r\n while lo<=hi:\r\n mid = (lo+hi)//2\r\n if divisors[mid]<=x:\r\n ans = divisors[mid]\r\n lo=mid+1\r\n else:\r\n hi = mid-1\r\n return ans\r\n\r\nn = int(input())\r\nfor _ in range(n):\r\n lo,hi = map(int,input().split())\r\n poss = search(hi)\r\n if poss==-1 or poss<lo:\r\n print(-1)\r\n else:\r\n print(poss)", "from math import ceil,sqrt\r\nimport bisect\r\na,b=map(int,input().split())\r\nli1=set()\r\nli2=set()\r\nfor i in range(1,ceil(sqrt(a))+1):\r\n if a%i==0:\r\n li1.add(i)\r\n li1.add(a//i)\r\nfor i in range(1,ceil(sqrt(b))+1):\r\n if b%i==0:\r\n li2.add(i)\r\n li2.add(b//i)\r\nli3=li1&li2\r\nli3=list(li3)\r\nli3.sort()\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n\r\n ans=bisect.bisect_right(li3,b)\r\n if ans==0:\r\n print(-1)\r\n continue\r\n if li3[ans-1]<=b and li3[ans-1]>=a:\r\n print(li3[ans-1])\r\n else:\r\n print(-1)", "import math\r\nfrom sys import stdout\r\n\r\ndef print_fast(string):\r\n stdout.write(string + '\\n')\r\n\r\n\r\ndef MGCD(_gcd, low, high):\r\n answer = -1\r\n botton = low\r\n index = min(_gcd, high)\r\n while index >= botton:\r\n if _gcd % index == 0:\r\n return index\r\n index -= 1\r\n return answer\r\n\r\n\r\n_input = input().split()\r\na = int(_input[0])\r\nb = int(_input[1])\r\n\r\n_gcd = math.gcd(a, b)\r\n\r\ndivisors = []\r\n\r\ni = 1\r\nwhile i * i <= _gcd:\r\n if _gcd % i == 0:\r\n divisors.append(i) \r\n divisors.append(_gcd // i)\r\n i += 1\r\n\r\ndivisors = sorted(divisors)\r\n\r\n\r\ntestCases = int(input())\r\n\r\nans = []\r\nfor i in range(testCases):\r\n _input = input().split()\r\n l = int(_input[0])\r\n h = int(_input[1])\r\n answer = -1\r\n for i in divisors:\r\n if i > h:\r\n break\r\n if i >= l and i <= h:\r\n answer = i\r\n\r\n ans.append(str(answer))\r\n #ans.append(str(MGCD(_gcd, l, h)))\r\n\r\nprint_fast('\\n'.join(ans))\r\n\r\n", "a,b=[int(e) for e in input().split()]\r\ndef D(x):\r\n res=set()\r\n i=1\r\n while i*i<=x:\r\n if x%i==0:\r\n res.add(i)\r\n res.add(x//i)\r\n i+=1\r\n return res\r\nd=sorted(D(a)&D(b))\r\nn=int(input())\r\nfor i in range(n):\r\n l,r=[int(e) for e in input().split()]\r\n I=len(d)-1\r\n while d[I]>r:\r\n I-=1\r\n if d[I]<l:\r\n print(-1)\r\n else:\r\n print(d[I])", "import math\r\nimport bisect\r\n\r\ndef calc_divisors(a, b):\r\n a, b = (a, b) if a < b else (b, a)\r\n divisors = []\r\n for i in range(1, int(math.sqrt(a)) + 1):\r\n an, af = divmod(a, i)\r\n bn, bf = divmod(b, i)\r\n if af == bf == 0:\r\n divisors.append(i)\r\n if b % an == af == 0:\r\n divisors.append(an)\r\n divisors.sort()\r\n return divisors\r\n\r\na, b = map(int, input().split())\r\ncommon_divisors = calc_divisors(a, b)\r\n\r\nsize = int(input())\r\nresult = [0] * size\r\nfor i in range(size):\r\n low, high = map(int, input().split())\r\n ie = bisect.bisect_right(common_divisors, high)\r\n cd = common_divisors[ie - 1]\r\n result[i] = str(cd) if (low <= cd <= high) else '-1'\r\n\r\nprint('\\n'.join(result))\r\n", "from math import gcd, isqrt\r\n\r\ndef divisors(num):\r\n ans = []\r\n for i in range(1, isqrt(num)+1):\r\n if num%i == 0:\r\n ans.append(i)\r\n if i != num//i:\r\n ans.append(num//i)\r\n return ans\r\n\r\ndef solve():\r\n l, r = map(int, input().split())\r\n a = find_largest_element(arr, r)\r\n if not a or a > r or a < l:\r\n print(\"-1\")\r\n else:\r\n print(a)\r\n\r\ndef find_largest_element(t, r):\r\n for val in sorted(t, reverse=True):\r\n if val <= r:\r\n return val\r\n return None\r\n\r\na, b = map(int, input().split())\r\narr = divisors(gcd(a,b))\r\nq = int(input())\r\nfor _ in range(q):\r\n solve()", "import math\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\n\r\ndef InputInt(): return int(input())\r\ndef InputIterables(): return map(int, input().split())\r\ndef InputList(): return list(map(int, input().split()))\r\ndef InputSortedList(): return sorted(list(map(int, input().split())))\r\n\r\ndef factorise(n):\r\n factors = set()\r\n\r\n for i in range(1, int(math.sqrt(n))+1):\r\n if n%i == 0:\r\n factors.add(n//i)\r\n factors.add(i)\r\n \r\n return factors\r\n\r\ndef main():\r\n a, b = InputSortedList()\r\n N = InputInt()\r\n a_factors = factorise(a)\r\n b_factors = factorise(b)\r\n factors = a_factors.intersection(b_factors)\r\n factors = sorted(list(factors))\r\n\r\n for _ in range(N):\r\n ans = -1\r\n l, r = InputList()\r\n\r\n if l > min(a, b):\r\n print(ans)\r\n continue\r\n \r\n left = 0\r\n right = len(factors)\r\n\r\n while left+1 < right:\r\n mid = left + (right-left)//2\r\n\r\n if factors[mid] <= r:\r\n left = mid\r\n else:\r\n right = mid\r\n \r\n if factors[left] <= r and factors[left] >= l:\r\n ans = factors[left]\r\n print(ans)\r\n \r\nmain()", "from sys import stdin, stdout\r\nfrom math import gcd, sqrt\r\n\r\ndef getin(type):\r\n return type(stdin.readline().strip())\r\n\r\ndef getrin(type):\r\n return [type(x) for x in stdin.readline().strip().split()]\r\n\r\ndef getout(object, type):\r\n return stdout.write(str(type(object)) + '\\n')\r\n\r\na, b = getrin(int)\r\nJoJo = gcd(a, b)\r\nfactors = list()\r\ni = 1\r\nsJoJo = int(sqrt(JoJo)) + 1\r\nwhile i <= sJoJo:\r\n if JoJo % i == 0:\r\n factors.append(i)\r\n if JoJo / i != i:\r\n factors.append(JoJo / i)\r\n i += 1\r\nn = getin(int)\r\ni = 0\r\nwhile i < n:\r\n low, high = getrin(int)\r\n Max = -1\r\n for factor in factors:\r\n if low <= factor <= high:\r\n Max = max(Max, factor)\r\n getout(Max, int)\r\n i += 1\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\nfrom bisect import *\r\n\r\na,b = map(int, input().split())\r\ng = math.gcd(a,b)\r\n\r\nA = [1,g]\r\nfor i in range(2,int(g**0.5)+1):\r\n if g%i==0:\r\n A.append(i)\r\n if i*i!=g:\r\n A.append(g//i)\r\nA.sort()\r\n\r\nfor _ in range(int(input())):\r\n l,r = map(int, input().split())\r\n \r\n l1 = bisect_left(A,l)\r\n r1 = bisect(A,r)\r\n if r1-l1>0:\r\n print(A[r1-1])\r\n else:\r\n print(-1)\r\n \r\n\r\n \r\n \r\n ", "a, b = list(map(int,input().strip().split()))[:2]\r\nq = []\r\nn = int(input())\r\nfor i in range(n):\r\n q.append(tuple(map(int,input().strip().split()))[:2])\r\n \r\nif a < b:\r\n a, b = b, a\r\n \r\nwhile b > 0:\r\n b, a = a % b, b\r\n\r\ndef divisors(n) :\r\n l1 = []\r\n i = 1\r\n while i*i <= n:\r\n if (n % i == 0) :\r\n l1.append(i)\r\n i += 1\r\n l2 = []\r\n for i in range(len(l1) - 1, -1, -1):\r\n if n//l1[i] != l1[i]:\r\n l2.append(n//l1[i])\r\n return l1+l2\r\n\r\nd = divisors(a)\r\n\r\ndef f(l, h):\r\n s, e = 0, len(d) - 1\r\n while s <= e:\r\n mid = (s + e) // 2\r\n if d[mid] == h:\r\n return h\r\n elif d[mid] > h:\r\n e = mid - 1\r\n elif d[mid] == l:\r\n if mid + 1 < len(d) and d[mid + 1] <= h:\r\n s = mid + 1\r\n else:\r\n return l\r\n elif d[mid] < l:\r\n s = mid + 1\r\n else:\r\n if mid + 1 < len(d) and d[mid + 1] <= h:\r\n s = mid + 1\r\n else:\r\n return d[mid]\r\n return -1\r\n\r\nfor l, h in q:\r\n print(f(l, h))\r\n", "import math\r\nimport bisect\r\n\r\na, b = map(int, input().split())\r\ngcd = math.gcd(a, b)\r\n\r\na, b = (a, b) if a < b else (b, a)\r\ndivisors = []\r\nfor i in range(1, int(math.sqrt(a)) + 1):\r\n n, f = divmod(a, i)\r\n if f == 0:\r\n divisors.append(i)\r\n divisors.append(n)\r\ndivisors.sort()\r\n\r\nfor _ in range(int(input())):\r\n low, high = map(int, input().split())\r\n cd = -1\r\n if low > gcd:\r\n pass\r\n elif low <= gcd <= high:\r\n cd = gcd\r\n else:\r\n ib = bisect.bisect_left(divisors, low)\r\n ie = bisect.bisect_right(divisors, high)\r\n for i in range(ib, ie):\r\n d = divisors[i]\r\n if b % d == 0:\r\n cd = d\r\n print(cd)", "import math\r\ndef bs(x, y, p):\r\n\tl, r=0, len(p)-1\r\n\tz=-1\r\n\twhile l<=r:\r\n\t\tm=(l+r)//2\r\n\t\tif x<=p[m]<=y:\r\n\t\t\tz=p[m]\r\n\t\t\tl=m+1\r\n\t\telif p[m]>y:\r\n\t\t\tr=m-1\r\n\t\telse:\r\n\t\t\tl=m+1\r\n\treturn z\r\na, b=map(int, input().split())\r\ng=math.gcd(a, b)\r\ns=int(math.sqrt(g))+1\r\np=[]\r\nfor i in range(1, s):\r\n\tif not g%i:\r\n\t\tp.append(i)\r\nl=len(p)-1\r\nl-=(s-1)*(s-1)==g\r\nfor i in range(l, -1, -1):\r\n\tp.append(g//p[i])\r\nfor _ in range(int(input())):\r\n\tx, y=map(int, input().split())\r\n\tprint(bs(x, y, p))", "from sys import stdin\r\nfrom bisect import bisect\r\n\r\n\r\ndef divisors(n):\r\n ans = set()\r\n i = 1\r\n while i * i <= n:\r\n if n % i == 0:\r\n ans.add(i)\r\n i += 1\r\n\r\n return ans | {n // e for e in ans}\r\n\r\n\r\ntest = stdin.readlines()\r\na, b = map(int, test[0].split())\r\nn = int(test[1])\r\n\r\ncdiv = sorted(divisors(a) & divisors(b))\r\nm = len(cdiv)\r\nout = []\r\nfor i in range(2, 2 + n):\r\n l, r = map(int, test[i].split())\r\n idx = bisect(cdiv, r) - 1\r\n out.append(cdiv[idx] if 0 <= idx < m and cdiv[idx] >= l else -1)\r\n\r\nprint('\\n'.join(map(str, out)))\r\n", "import math\r\n\r\ndef main():\r\n (a,b) = list(map(int,input().split()))\r\n if b > a:\r\n a, b = b, a\r\n while b != 0:\r\n b, a = a%b, b\r\n divisors = []\r\n root = math.floor(math.sqrt(a))\r\n for divisor in range(1,root):\r\n if a % divisor == 0:\r\n divisors.append(divisor)\r\n divisors.append(a//divisor)\r\n if a % root == 0:\r\n divisors.append(root)\r\n if root**2 != a:\r\n divisors.append(a//root)\r\n divisors.sort()\r\n divisors = [0] + divisors\r\n length = len(divisors)\r\n n = int(input())\r\n for _ in range(n):\r\n (low,high) = list(map(int, input().split()))\r\n left = 1\r\n right = length\r\n best = 0\r\n while left < right:\r\n middle = (left+right)//2\r\n if divisors[middle] > high:\r\n right = middle\r\n else:\r\n best = divisors[middle]\r\n left = middle + 1\r\n if best < low:\r\n print(\"-1\")\r\n else:\r\n print(best) \r\n \r\nmain()\r\n", "def solve():\r\n left=0\r\n right=len(arr)-1\r\n ant=-1\r\n while left<=right:\r\n mid=left+right>>1\r\n if arr[mid]<l: left=mid+1\r\n elif arr[mid]>r: right=mid-1\r\n else:\r\n ant=mid\r\n left=mid+1\r\n return ant\r\nfrom math import *\r\na,b=map(int,input().split())\r\nn=int(input())\r\nk=gcd(a,b)\r\narr=[]\r\nfor i in range(1,int(sqrt(k))+1):\r\n if k%i==0:\r\n arr.append(i)\r\n arr.append(k//i)\r\narr.sort()\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n ant=solve()\r\n if ant!=-1:\r\n print(arr[ant])\r\n else:print(-1)", "from math import gcd\r\n\r\na, b = map(int, input().split())\r\ng = gcd(a, b)\r\n\r\nd = []\r\n\r\ni = 1\r\nwhile i * i <= g:\r\n if not g % i:\r\n d.append(i)\r\n i += 1\r\n\r\nfor i in range(len(d) - 1, -1, -1):\r\n if d[i] * d[i] != g:\r\n d.append(g // d[i])\r\n\r\nfor test in range(int(input())):\r\n l, r = map(int, input().split())\r\n L = 0\r\n R = len(d) - 1\r\n while L < R:\r\n middle = (L + R + 1) >> 1\r\n if d[middle] > r:\r\n R = middle - 1\r\n else:\r\n L = middle\r\n if l <= d[L] <= r:\r\n print(d[L])\r\n else:\r\n print(-1)\r\n\r\nexit(0)\r\n", "import bisect\r\ndef m_divlist(n):\r\n tmp = [-1]\r\n for x in range(1,int(n**0.5+1)):\r\n if (n%x) == 0:\r\n tmp.append(x)\r\n tmp.append(int(n/x))\r\n tmp.sort()\r\n return tmp\r\n\r\na0,b0=map(int,input().split(' '))\r\na=a0;b=b0\r\n\r\nwhile a!=0 and b!=0:\r\n if a > b: a = a % b\r\n else: b = b % a\r\nmcd=a+b\r\n\r\nmdvlst=m_divlist(mcd)\r\nn=int(input())\r\nfor i in range(n):\r\n rmin,rmax=map(int,input().split(' '))\r\n k = bisect.bisect(mdvlst,rmax)\r\n print (mdvlst[k-1] if mdvlst[k-1]>=rmin else '-1')\r\n", "import math\r\nimport bisect\r\ndef factors(n):\r\n fac=set()\r\n fac.add(1)\r\n fac.add(n)\r\n for i in range(2,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n fac.add(i)\r\n fac.add(n//i)\r\n return sorted(list(fac))\r\na,b=map(int,input().split())\r\ng=math.gcd(a,b)\r\nfac=factors(g)\r\nn=int(input())\r\nfor i in range(n):\r\n l,r=map(int,input().split())\r\n ans=-1\r\n for i in range(0,len(fac)):\r\n if fac[i]>=l and fac[i]<=r:\r\n ans=max(ans,fac[i])\r\n if fac[i]>r:\r\n break\r\n print(ans)", "a, b = map(int, input().split())\r\nimport math\r\ng = math.gcd(a, b)\r\n# generate the divisor\r\nlis = [i for i in range(1, int(math.sqrt(g)) + 1) if g%i == 0]\r\n# print(\"lis before the chane:\",lis)\r\nfor i in lis[::-1]: lis.append(g//i)\r\n# print(\"lis before the chane:\",lis)\r\nn = int(input())\r\nfor _ in range(n):\r\n a, b = map(int , input().split())\r\n import bisect\r\n x = bisect.bisect(lis, b) - 1\r\n if lis[x] < a: print(-1)\r\n else: print(lis[x])", "import sys\nlines = sys.stdin.readlines()\n(m, n) = map(int, lines[0].strip().split(\" \"))\ndef gcd(a, b):\n if a == 0: return b\n if a > b: return gcd(b, a)\n return gcd(b%a, a)\nG = gcd(m, n)\ntmp = G\nfactors = []\ni = 2\nwhile i**2 <= tmp:\n if tmp % i == 0:\n factors.append(i)\n tmp//=i\n else: i += 1\nif tmp != 1: factors.append(tmp)\ncount = {}\nfor f in factors:\n if f not in count:\n count[f] = 0\n count[f] += 1\nprimes = list(count.keys())\nprimes.sort()\nfactors = [1]\nfor p in primes:\n tmp = []\n for f in factors:\n for i in range(1, count[p]+1):\n tmp.append(f * p ** i)\n factors += tmp\n\nfactors.sort()\nL = len(factors)\n\nQ = int(lines[1].strip())\nfor q in range(2, Q+2):\n (lo, hi) = map(int, lines[q].strip().split(\" \"))\n l, r = 0, L\n while l < r-1:\n mid = (r-l)//2 + l\n if factors[mid] > hi: r = mid\n else: l = mid\n if factors[l] >= lo: print(factors[l])\n else: print(-1)\n", "import math\r\nr,o=map(int,input().split())\r\nfrom bisect import *\r\ndef fact(x):\r\n ans=[]\r\n for i in range(1,int(math.sqrt(int(x)))+1):\r\n if(x%i==0):\r\n if(x//i==i):\r\n ans.append(i)\r\n else:\r\n ans.append(x//i)\r\n ans.append(i)\r\n return ans;\r\nm=int(input())\r\na=math.gcd(r,o)\r\ntem=fact(a)\r\ntem.sort()\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n r=bisect_left(tem,y)\r\n if(r==len(tem)):\r\n if(tem[-1]<x):\r\n print(-1)\r\n else:\r\n print(tem[-1])\r\n else:\r\n if(tem[r]<=y):\r\n if(tem[r]<x):\r\n print(-1)\r\n else:\r\n print(tem[r])\r\n else:\r\n if(r==0):\r\n print(-1)\r\n else:\r\n if(tem[r-1]<x):\r\n print(-1)\r\n else:\r\n print(tem[r-1])\r\n \r\n", "from math import inf\r\nfrom collections import *\r\nimport math, os, sys, heapq, bisect, random\r\nfrom functools import lru_cache\r\nfrom itertools import *\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef out(var): sys.stdout.write(str(var)) # for fast output, always take string\r\ndef inpu(): return int(inp())\r\ndef lis(): return list(map(int, inp().split()))\r\ndef stringlis(): return list(map(str, inp().split()))\r\ndef sep(): return map(int, inp().split())\r\ndef strsep(): return map(str, inp().split())\r\ndef fsep(): return map(float, inp().split())\r\nM,M1=1000000007,998244353\r\n\r\ndef main():\r\n how_much_noob_I_am=1\r\n #how_much_noob_I_am=inpu()\r\n for _ in range(how_much_noob_I_am):\r\n a,b=sep()\r\n n=inpu()\r\n q=[lis() for i in range(n)]\r\n p=math.gcd(a,b)\r\n l=[p,1]\r\n for i in range(2,int(math.sqrt(p))+2):\r\n if p%i==0:\r\n l.append(i)\r\n l.append(p//i)\r\n #print(l)\r\n l.sort()\r\n for i in q:\r\n low,high = i[0],i[1]\r\n ans=-inf\r\n for j in l:\r\n if j>=low and j<=high:\r\n ans=max(ans,j)\r\n if ans==-inf:\r\n print(-1)\r\n continue\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import bisect\r\ndef divisors(a):\r\n i,divs=1,set()\r\n while(i*i<=a):\r\n if a%i==0:\r\n divs.add(i)\r\n j=a//i\r\n if j!=i and a%j==0:\r\n divs.add(j)\r\n i+=1\r\n return divs\r\n\r\n\r\na,b=map(int,input().split())\r\ndivsa=divisors(a)\r\ndivsb=divisors(b)\r\ndivs=list(divsa.intersection(divsb))\r\ndivs.sort()\r\n# print(divs)\r\nfor _ in range(int(input())):\r\n l,h=map(int,input().split())\r\n pos=bisect.bisect_right(divs,h)\r\n if pos==0 or divs[pos-1]<l:\r\n print(-1)\r\n else:\r\n print(divs[pos-1])", "from math import gcd, sqrt\nfrom bisect import bisect_right as ub\na,b = map(int,input().split())\nT = int(input())\n_gcd = gcd(a,b)\nmx = int(sqrt(_gcd) + 100)\nfac = set()\nfor i in range(1, mx):\n\tif _gcd % i == 0:\n\t\tfac.add(i)\n\t\tfac.add(int(_gcd // i))\nfac = list(fac)\nfac.sort()\nfor _ in range(T):\n\tlow, high = map(int,input().split())\n\tans = -1\n\tpos = ub(fac, high) - 1\n\tif fac[pos] >= low:\n\t\tans = fac[pos]\n\tprint(ans)\n\t\t\t \t\t \t\t\t\t \t \t \t \t \t \t", "import math\r\ndef firstindexgreaterorequal(List,n):\r\n i=0\r\n j=len(List)-1\r\n while i<j:\r\n mid =(i+j)//2\r\n if List[mid]<n:\r\n i=mid+1\r\n else:\r\n j=mid\r\n return i\r\ndef firstindexgreaterorequal2(List,n):\r\n i=0\r\n j=len(List)-1\r\n while i<j:\r\n mid =(i+j)//2\r\n if List[mid]<=n:\r\n i=mid+1\r\n else:\r\n j=mid\r\n return i\r\na,b=map(int,input().split())\r\nn=math.gcd(a,b)\r\narray1=[]\r\narray2=[]\r\nfor i in range(1,math.isqrt(n)+1):\r\n if n%i==0:\r\n array1.append(i)\r\n if n!=i*i:\r\n array2.insert(0,n//i)\r\narray=array1+array2\r\nq=int(input())\r\nfor i in range(q):\r\n l,r=map(int,input().split())\r\n if l>array[-1] or r<array[0]:\r\n print(-1)\r\n elif r>=array[-1] and l<=array[-1]:\r\n print(array[-1])\r\n else:\r\n p=firstindexgreaterorequal(array,l)\r\n q=firstindexgreaterorequal2(array,r)\r\n if p==q:\r\n if array[q-1]==l:\r\n print(l)\r\n else:\r\n print(-1)\r\n else:\r\n print(array[q-1])", "a,b = map (int ,input().split())\r\nn = int (input())\r\ndef gcd(a,b):\r\n if (b == 0):\r\n return a\r\n return gcd(b, a % b);\r\ndef bs (l,r,val,a):\r\n l1 = l\r\n r1 = r\r\n res = 0 ;\r\n while (l1 <= r1 ):\r\n mid= (l1+r1)// 2\r\n if (a[mid] <= val):\r\n l1 = mid +1 ;\r\n res =a[mid]\r\n else :\r\n r1 = mid-1\r\n return res\r\nt= gcd (a,b)\r\nwish = [] # list of root store here\r\nfor i in range (1,t+1):\r\n if t// i < i :\r\n break ;\r\n if t%i == 0 :\r\n wish.append (i)\r\n if (t // i != i):\r\n wish.append(t//i)\r\nwish.sort()\r\nfor i in range (0,n):\r\n low,high = map (int,input().split())\r\n temp = bs (0,len(wish)-1,high,wish)\r\n if temp < low:\r\n temp = -1 ;\r\n print (temp)", "from math import *\r\nfrom bisect import bisect_right as br \r\n\r\ng = gcd(*map(int, input().split()))\r\ni = 1\r\nL = []\r\nwhile (i*i <= g):\r\n if g % i == 0:\r\n L.append(i // 1)\r\n L.append(g // i)\r\n i += 1\r\nL = sorted(L)\r\nn=int(input())\r\nfor i in range(n):\r\n l, h = map(int, input().split())\r\n m = L[br(L, h) - 1]\r\n if m < l :\r\n print (-1)\r\n else:\r\n print(m)\r\n", "import bisect\r\na,b=map(int,input().split())\r\ndef d(n):\r\n q=int(n**.5)+1\r\n r={1}\r\n for i in range(1,q):\r\n if n%i==0:r.add(i);r.add(n//i)\r\n return r\r\nq=sorted(d(a)&d(b))\r\nw=set(q)\r\nfor i in range(int(input())):\r\n k=-1\r\n l,h=map(int,input().split())\r\n o=bisect.bisect_right(q,h)\r\n if o-bisect.bisect_left(q,l)or h in w or l in w>1:k=q[o-1]\r\n print(k)", "from math import sqrt\r\na, b = map(int, input().split())\r\nd = []\r\nfor q in range(1, int(sqrt(a)) + 1):\r\n y = a // q\r\n if a % q == 0 and b % q == 0:# and l <= q <= r:\r\n d.append(q)\r\n if a % y == 0 and b % y == 0:# and l <= y <= r:\r\n d.append(y)\r\nd.sort()\r\nfor i in range(int(input())):\r\n l, r = map(int, input().split())\r\n j = 0\r\n while j < len(d) and d[j] < l:\r\n j += 1\r\n k = j\r\n while k < len(d) and d[k] <= r:\r\n k += 1\r\n k -= 1\r\n if k - j + 1 != 0:\r\n print(max(d[j:k + 1]))\r\n else:\r\n print(-1)", "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\n\r\n\r\na, b = map(int, input().split())\r\ng = math.gcd(a, b)\r\ngs = []\r\nit = 1\r\nwhile it * it <= g:\r\n if g % it == 0:\r\n gs.append(it)\r\n if g // it != it:\r\n gs.append(g // it)\r\n it += 1\r\ngs.sort()\r\nfor _ in range(int(input())):\r\n low, high = map(int, input().split())\r\n lt = bisect.bisect_left(gs, low)\r\n ht = bisect.bisect_right(gs, high)\r\n if ht > lt:\r\n print(gs[ht - 1])\r\n else:\r\n print(-1)\r\n", "from math import gcd\nimport bisect\n\ndef fun(a, b):\n ans = []\n g = gcd(a, b)\n for i in range(1, int(g**0.5) + 1):\n if g % i == 0:\n ans.append(i)\n if g != i * i:\n ans.append(int(g / i))\n return ans\n\na, b = [int(i) for i in input().split()]\nn = int(input())\nans = sorted(fun(a, b))\n\nfor _ in range(n):\n l, h = [int(i) for i in input().split()]\n p = bisect.bisect(ans, h)\n\n if p > 0 and ans[p-1] >= l:\n print(ans[p-1])\n else:\n print(-1)\n\n \t\t \t \t\t\t\t\t \t\t \t\t\t\t \t \t\t", "from bisect import bisect_left, bisect_right\r\nimport math\r\n\r\n\r\na,b=list(map(int,input().split()))\r\nn=int(input())\r\ncommon_factors=set()\r\na_factors=set([a])\r\nb_factors=set([b])\r\ni=1\r\nwhile i <= a**(1/2)+1:\r\n if a%i==0:\r\n a_factors.add(i)\r\n a_factors.add(a // i)\r\n i+=1\r\ni=1\r\nwhile i <= b**(1/2)+1:\r\n if b%i==0:\r\n b_factors.add(i)\r\n b_factors.add(b // i)\r\n i+=1\r\n# print(a_factors)\r\n# print(b_factors)\r\ncommon_factors= list(a_factors&b_factors)\r\ncommon_factors.sort()\r\n# print(common_factors)\r\n# common_factors=list(common_factors)\r\n# common_factors.sort()\r\n# print(common_factors)\r\nfor i in range(n):\r\n l,r=list(map(int,input().split()))\r\n \r\n # idx_left=bisect_left(common_factors,l)\r\n idx_right=bisect_right(common_factors,r)-1\r\n if common_factors[idx_right]<l:\r\n print(-1)\r\n else:\r\n print(common_factors[idx_right])\r\n\r\n ", "from math import gcd\r\nfrom bisect import bisect_right as br\r\ng = gcd(*map(int, input().split()))\r\ni = 1\r\nr = []\r\nwhile i * i <= g :\r\n if g % i == 0 : \r\n r.append(i)\r\n r.append(g // i)\r\n i += 1\r\nr = sorted(r)\r\nfor i in range(int(input())) :\r\n l, h = map(int, input().split())\r\n m = r[br(r, h) - 1]\r\n print(-1 if m < l else m)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\nfrom math import gcd\r\nfrom bisect import bisect_right\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\na, b = map(int, input().split())\r\ng = gcd(a, b)\r\ndivisors = [0]\r\nd = 1\r\nwhile d * d <= g:\r\n if g % d == 0:\r\n divisors.append(d)\r\n if d != g // d:\r\n divisors.append(g // d)\r\n d += 1\r\n\r\ndivisors.sort()\r\n\r\nn = int(input())\r\nans = [-1] * n\r\n\r\nfor i, (low, high) in enumerate(map(int, input().split()) for _ in range(n)):\r\n j = bisect_right(divisors, high)\r\n if low <= divisors[j - 1] <= high:\r\n ans[i] = divisors[j - 1]\r\n\r\nprint(*ans, sep='\\n')\r\n", "import math\r\nimport bisect\r\n\r\na, b = map(int, input().split())\r\nn = int(input())\r\n\r\ngcd = math.gcd(a,b)\r\nx = int(math.sqrt(gcd))\r\nls = [gcd,1]\r\nfor i in range(2, x + 1):\r\n if gcd % i == 0:\r\n ls.append(gcd // i)\r\n ls.append(i)\r\nls=sorted(ls)\r\nfor _ in range(n):\r\n low, high = map(int, input().split())\r\n f = 0\r\n f=ls[bisect.bisect_right(ls,high)-1]\r\n if f <low:\r\n print(-1)\r\n else:\r\n print(f)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nfrom math import gcd\r\nfrom bisect import bisect\r\na, b = map(int, input().split())\r\nx = gcd(a, b)\r\ny = x\r\nd = dict()\r\ns = set()\r\nfor i in range(2, int(x**0.5)+1):\r\n if y % i == 0:\r\n c = 0\r\n while y % i == 0:\r\n y //= i\r\n c += 1\r\n d[i] = c\r\nif y != 1:\r\n d[y] = 1\r\ns.add(1)\r\nfor i in d:\r\n a = set()\r\n for j in range(1, d[i]+1):\r\n for l in s:\r\n a.add(i**j * l)\r\n s = s | a\r\nd = sorted(s)\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n x = bisect(d, b) - 1\r\n print([-1, d[x]][d[x] >= a])\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\na,b = map(int,input().split())\na,b = min(a,b),max(a,b)\nL = []\nfor i in range(1,int(b**0.5)+1):\n if a%i==0 and b%i==0:\n L.append(i)\n if a%(b//i)==0 and b%(b//i)==0:\n L.append(b//i)\nL.sort()\n# print(L)\n\nfor _ in range(int(input())):\n l,r = map(int,input().split())\n x,y = bisect_left(L,l),bisect_right(L,r)\n if x!=y:\n print(L[y-1])\n else:\n print(-1)", "def gcd(a, b):\r\n if a == 0:\r\n return b\r\n return gcd(b % a, a)\r\n\r\na, b = map(int,input().split())\r\ni, hcf = 1, gcd(a,b)\r\nfachcf = []\r\nwhile i*i <= hcf :\r\n if hcf%i == 0 :\r\n fachcf.append(i)\r\n if i*i != hcf :\r\n fachcf.append(hcf//i)\r\n i += 1\r\nfachcf.sort()\r\nq = int(input())\r\nwhile q :\r\n q -= 1\r\n x, y = map(int,input().split())\r\n ans = -1\r\n for i in range(len(fachcf)-1,-1,-1) :\r\n if x <= fachcf[i] and y >= fachcf[i] :\r\n ans = fachcf[i]\r\n break\r\n print(ans)", "from math import gcd\r\nfrom bisect import bisect\r\nfrom functools import reduce\r\ndef factors(n):\r\n k = sorted(list(set(reduce(list.__add__,\r\n ([i,n//i] for i in range(1,int(n**0.5+1)) if n%i == 0)))))\r\n return k\r\na,b = map(int,input().split())\r\ngg = gcd(a,b)\r\nf = factors(gg)\r\nn = int(input())\r\nfor _ in range(0,n):\r\n l,h = map(int,input().split())\r\n ss = bisect(f,h)\r\n sss = f[ss-1]\r\n if sss < l:\r\n print(-1)\r\n else:\r\n print(sss)\r\n\r\n\r\n\r\n", "import math\r\nimport bisect\r\n\r\ndef gcd(a_, b_):\r\n if b_ == 0:\r\n return a_\r\n else:\r\n return gcd(b_, a_ % b_)\r\n \r\n \r\na, b = map(int, input().split())\r\n_gcd = gcd(a, b)\r\nn = int(input())\r\nM = []\r\nfor i in range(1, int(math.sqrt(_gcd)) + 1):\r\n if not _gcd % i:\r\n M.append(i)\r\n M.append(_gcd // i)\r\nM = sorted(M)\r\n \r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n m = M[bisect.bisect_right(M, b) - 1]\r\n if m < a:\r\n print(-1)\r\n else:\r\n print(m)", "import math\r\na, b = [int(i) for i in input().strip().split(\" \")]\r\nd = math.gcd(a, b)\r\n\r\ndivs = []\r\nfor i in range(1, int(math.sqrt(d))+1):\r\n if d % i == 0:\r\n divs.append(i)\r\nk = len(divs)\r\ndivisors = divs[:]\r\nfor j in range(1, k+1):\r\n divisors.append(d//divs[-j])\r\n\r\nn=len(divisors)\r\n\r\nq = int(input())\r\nfor j in range(q):\r\n low, high = [int(i) for i in input().strip().split(\" \")]\r\n\r\n left = 0\r\n right = n-1\r\n while left < right:\r\n mid = left + (right - left)//2\r\n if divisors[mid] >= low:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n if divisors[left] < low:\r\n d1 = -1\r\n else:\r\n d1 = divisors[left]\r\n\r\n left = 0\r\n right = n - 1\r\n while left < right:\r\n mid = left + (right - left + 1) // 2\r\n if divisors[mid] <= high:\r\n left = mid\r\n else:\r\n right = mid - 1\r\n if divisors[left] > high:\r\n d2 = -1\r\n else:\r\n d2 = divisors[left]\r\n\r\n if d1<0 or d2<0 or d1>d2:\r\n ans = -1\r\n else:\r\n ans = d2\r\n print(ans)\r\n\r\n", "from bisect import bisect_left as bl ,bisect_right as br\ndef factors(n):\n i=2\n blanck=[1]\n while i**2<=n :\n if n%i==0:\n blanck.append(i)\n blanck.append(n//i)\n i+=1\n if n>1:\n blanck.append(n)\n n=1\n return blanck\n\na,b=map(int,input().strip().split())\nst1=set(factors(a))\nst2=set(factors(b))\nst3=st1.intersection(st2)\nst3=sorted(list(st3))\nfor i in range(int(input())):\n l,r=map(int,input().strip().split())\n ll=bl(st3,l)\n rr=br(st3,r)-1\n \n if rr>=ll and rr<len(st3):\n print(st3[rr])\n else:\n print(-1)\n\n\t \t \t \t \t \t\t \t\t \t\t\t \t \t\t", "def make_divisors(n):\r\n divisors = []\r\n for i in range(1, int(n**0.5)+1):\r\n if n % i == 0:\r\n divisors.append(i)\r\n if i != n // i:\r\n divisors.append(n//i)\r\n\r\n divisors.sort()\r\n return divisors\r\n\r\na, b = map(int, input().split())\r\nn = int(input())\r\n\r\nimport math\r\ng = math.gcd(a, b)\r\nD = make_divisors(g)\r\n\r\nimport bisect\r\nfor i in range(n):\r\n low, high = map(int, input().split())\r\n l = bisect.bisect_left(D, low)\r\n r = bisect.bisect_right(D, high)\r\n if l != r:\r\n print(D[r-1])\r\n else:\r\n print(-1)\r\n", "#!/usr/bin/env python3\r\nfrom sys import stdin\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n\r\ndef gcd(a, b):\r\n if a > b:\r\n a, b = b, a\r\n while a:\r\n a, b = b % a, a\r\n return b\r\n\r\n\r\na, b = map(int, stdin.readline().split())\r\n\r\ng = gcd(a,b)\r\ngfactor = [1,g]\r\np = 2\r\nwhile p*p<=g:\r\n if g%p==0:\r\n gfactor.append(p)\r\n if g//p != p:\r\n gfactor.append(g//p)\r\n p += 1\r\ngfactor = sorted(gfactor)\r\n\r\nn = int(stdin.readline().strip())\r\nfor i in range(n):\r\n low, high = map(int, stdin.readline().split())\r\n ridx = bisect_right(gfactor, high) - 1\r\n if gfactor[ridx]>=low:\r\n print(gfactor[ridx])\r\n else:\r\n print(-1)\r\n\r\n", "#input template\r\nfrom sys import stdin, stdout\r\ncin = stdin.readline\r\ncout = stdout.write\r\nmp = lambda: list(map(int, cin().split()))\r\n\r\ndef chars(): #function for taking string input as character array since string in python is immutable\r\n s = cin()\r\n return(list(s[:len(s) - 1]))\r\n\r\n#print list\t\r\ndef pl(a):\t\r\n\tfor val in a:\r\n\t\tcout(val + '\\n')\r\n\t\t\r\n#main\r\n\r\ndef binSearch(lo, hi):\r\n\thigh = len(l) - 1\r\n\tlow = 0\r\n\tans = -1\r\n\twhile low <= high:\r\n\t\tmid = (low+high)//2\r\n\t\t#print(mid, l[mid])\r\n\t\tif hi>=l[mid] and l[mid]>= lo:\r\n\t\t\tans = l[mid]\r\n\t\t\t#print(ans, 120)\r\n\t\t\tlow = mid+1\r\n\t\telif l[mid] < lo:\r\n\t\t\tlow = mid+1\r\n\t\telif l[mid] > hi:\r\n\t\t\thigh = mid-1\r\n\treturn ans\r\n\r\n\r\na, b = sorted(mp())\r\nn, = mp()\r\n\r\ns = set()\r\nfor i in range(1, int(a**.5)+1):\r\n\tif not a%i and not b%i:\r\n\t\ts.add(i)\r\n\tif not a%(a//i) and not b%(a//i):\r\n\t\ts.add(a//i)\r\n\r\nl = sorted(s)\r\n#print(l)\t\t\t\r\nfor _ in range(n):\r\n\tlo, hi = mp()\r\n\t\r\n\tans = binSearch(lo, hi)\r\n\tcout(str(ans) + '\\n')", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nfrom math import gcd as GCD\r\nfrom bisect import bisect_left\r\n\r\ndef GetPrimes(max_prime):\r\n is_prime = [True for i in range(max_prime + 1)]\r\n primes = []\r\n for p in range(2, max_prime + 1):\r\n if is_prime[p]:\r\n primes += [p]\r\n for n in range(2*p, max_prime + 1, p):\r\n is_prime[n] = False\r\n return primes \r\n \r\ndef GetPrimeFactorization(x):\r\n prime_factors = []\r\n prime_powers = []\r\n \r\n for p in primes:\r\n power = 0 \r\n while x%p == 0:\r\n power +=1 \r\n x//=p\r\n if power:\r\n prime_factors += [p]\r\n prime_powers += [power]\r\n \r\n if x > 1:\r\n prime_factors += [x]\r\n prime_powers += [1]\r\n return prime_factors, prime_powers\r\n\r\ndef GetFactors(prime_factors, prime_powers):\r\n factors = {1}\r\n for prime, power in zip(prime_factors, prime_powers):\r\n for i in range(power):\r\n factors.update({prime * x for x in factors})\r\n return sorted(factors)\r\n\r\na,b = [int(x) for x in input().split()]\r\n\r\ngcd = GCD(a,b)\r\nprimes = GetPrimes(int(gcd**0.5)+1)\r\n\r\nprime_factors, prime_powers = GetPrimeFactorization(gcd)\r\n\r\n'''\r\nprint(\"a,b = \", a,b)\r\nprint(\"gcd =\", gcd)\r\nlength = len(prime_factors)\r\nif length == 1:\r\n print(\"gcd = %d ^ %d\"%(prime_factors[0], prime_powers[0]))\r\nelse:\r\n print(\"gcd = \", end = \"\")\r\n for i in range(length - 1):\r\n print(\"%d ^ %d * \"%(prime_factors[i], prime_powers[i]))\r\n print(\"%d ^ %d * \"%(prime_factors[-1], prime_powers[-1]))\r\n'''\r\nfactors = GetFactors(prime_factors, prime_powers)\r\nlength = len(factors)\r\n\r\n# have a prime factorization of gcd \r\n# get every factor of gcd \r\nnum_test_cases = int(input())\r\nfor test_case_ittr in range(num_test_cases):\r\n low, high = [int(x) for x in input().split()]\r\n # find the biggest common factor in [low, high]\r\n i = bisect_left(factors, high)\r\n if i == length or factors[i] > high:\r\n i-=1\r\n \r\n if i == -1:\r\n print(-1)\r\n continue \r\n \r\n factor = factors[i]\r\n if (low <= factor <= high):\r\n print(factor)\r\n else:\r\n print(-1)\r\n \r\n ", "import math\r\na, b = list(map(int, input().split()))\r\nn = int(input())\r\n\r\ndef gcd(a, b):\r\n if a < b:\r\n a, b = b, a\r\n \r\n while b > 0:\r\n r = a % b\r\n a = b\r\n b = r\r\n \r\n return a\r\n\r\nd = gcd(a, b)\r\nfactors = []\r\nfor i in range(1, math.floor(math.sqrt(d)) + 1):\r\n if d % i == 0:\r\n factors.append(i)\r\n factors.append(d / i)\r\n\r\nfactors.sort(reverse = True)\r\n\r\nfor _ in range(n):\r\n l, h = list(map(int, input().split()))\r\n \r\n ans = -1\r\n for x in factors:\r\n if x >= l and x <= h:\r\n ans = x\r\n break\r\n if x < l:\r\n break\r\n \r\n print(int(ans))", "from bisect import bisect_right\r\nfrom collections import defaultdict\r\ndef z_():\r\n return 0\r\nimport math\r\na,b=map(int,input().split())\r\nd=defaultdict(z_)\r\nfor i in range(1,math.floor((a)**0.5)+1):\r\n if a%i==0:\r\n d[i]=1\r\n d[a//i]=1\r\nfl=[]\r\nfor i in range(1,math.floor((b)**0.5)+1):\r\n if b%i==0:\r\n if d[i]:\r\n fl.append(i)\r\n if d[b//i]:\r\n fl.append(b//i)\r\nfl.sort()\r\nfor i in range(int(input())):\r\n l,h=map(int,input().split())\r\n if fl[bisect_right(fl,h)-1]<l:\r\n print(-1)\r\n else:\r\n print(fl[bisect_right(fl,h)-1])", "#\t!/usr/bin/env python3\r\n#\tencoding: UTF-8\r\n#\tModified: <27/Mar/2019 07:03:51 PM>\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology (IIIT),Gwalior\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 a, b = get_ints()\r\n from math import gcd, sqrt\r\n x = gcd(a, b)\r\n divisors = []\r\n i = 1\r\n while i <= sqrt(x):\r\n if (x % i == 0):\r\n if (x//i == i):\r\n divisors.append(i)\r\n else:\r\n divisors.append(i)\r\n divisors.append(x//i)\r\n i += 1\r\n divisors.sort()\r\n # print(divisors)\r\n\r\n n = len(divisors)\r\n from bisect import bisect_left\r\n for tc in range(int(input())):\r\n low, high = get_ints()\r\n l = bisect_left(divisors, low)\r\n r = bisect_left(divisors, high)\r\n if l == n:\r\n print(-1)\r\n continue\r\n\r\n if r == n or (r < n and divisors[r] != high):\r\n r -= 1\r\n\r\n if r >= l:\r\n print(divisors[r])\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from sys import stdin, stdout\r\nfrom math import gcd, sqrt\r\nfrom array import array\r\n\r\ndef getin(type):\r\n return type(stdin.readline().strip())\r\n\r\ndef getrin(type):\r\n return [type(x) for x in stdin.readline().strip().split()]\r\n\r\ndef getout(object, type):\r\n return stdout.write(str(type(object)) + '\\n')\r\n\r\na, b = getrin(int)\r\nJoJo = gcd(a, b)\r\nfactors = array('i', [])\r\nfor i in range(1, int(sqrt(JoJo) + 1)):\r\n if JoJo % i == 0:\r\n factors.append(i)\r\n if JoJo / i != i:\r\n factors.append(int(JoJo / i))\r\nn = getin(int)\r\nfor i in range(n):\r\n low, high = getrin(int)\r\n Max = -1\r\n for factor in factors:\r\n if low <= factor <= high:\r\n Max = max(Max, factor)\r\n getout(Max, int)\r\n", "import sys,math as mt\r\nimport heapq as hp\r\nimport collections as cc\r\nimport math as mt\r\nimport itertools as it\r\nimport bisect as bi\r\ninput=sys.stdin.readline\r\nI=lambda:list(map(int,input().split()))\r\nsys.setrecursionlimit(8*10**5)\r\na,b=I()\r\ng=mt.gcd(a,b)\r\ndiv=set()\r\nfor i in range(2,int(g**0.5)+1):\r\n\tif g%i==0:\r\n\t\tdiv.add(i)\r\n\t\tdiv.add(g//i)\r\ndiv=[1]+list(div)+[g]\r\ndiv.sort()\r\nfor tc in range(int(input())):\r\n\tx,y=I()\r\n\ttf=0\r\n\ttemp=bi.bisect_right(div,y)\r\n\tif x<=div[temp-1] and div[temp-1]<=y:\r\n\t\tprint(div[temp-1])\r\n\telse:\r\n\t\tprint(-1)\r\n", "import math \r\n\r\na,b=map(int,input().split())\r\ng=math.gcd(a,b)\r\ni=1 \r\narr=[]\r\nwhile i*i<=g:\r\n if g%i==0:\r\n arr.append(i)\r\n arr.append(g//i)\r\n i+=1 \r\narr.sort()\r\nfor _ in range(int(input())):\r\n low,high=map(int,input().split())\r\n if g<low:\r\n print(-1)\r\n \r\n else:\r\n \r\n ans=-1\r\n for a in arr:\r\n if a>=low and a<=high:\r\n ans=max(ans,a)\r\n \r\n print(ans)\r\n \r\n", "\r\nimport math,bisect\r\na,b=map(int,input().split())\r\ngcd=math.gcd(a,b)\r\narr=[i for i in range(1,int(math.sqrt(gcd))+1) if gcd%i==0]\r\nfor i in arr[::-1]:arr.append(gcd//i)\r\n \r\nfor _ in range(int(input())):\r\n l,h=map(int,input().split())\r\n idx=bisect.bisect(arr,h)-1\r\n if l>arr[idx]:print(-1)\r\n else:print(arr[idx])\r\n", "from bisect import bisect_left, bisect_right\r\n\r\ndef find_factors(a):\r\n\r\n factors = set([1, a])\r\n\r\n for num in range(2, int(a**0.5) + 1):\r\n if not a%num:\r\n factors.add(a//num)\r\n factors.add(num)\r\n \r\n return factors\r\n\r\n\r\na, b = map(int, input().split())\r\n\r\na_divisors = find_factors(a)\r\nb_divisors = find_factors(b)\r\n\r\n\r\ncommon = sorted(a_divisors.intersection(b_divisors))\r\n\r\n\r\n\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n low, high = map(int, input().split())\r\n\r\n left, right = bisect_left(common, low), bisect_right(common, high)\r\n \r\n if left < right:\r\n print(common[right - 1])\r\n \r\n else:\r\n print(-1)\r\n\r\n\r\n", "import sys\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import merge, heapify, heappop, heappush\r\nfrom math import *\r\nfrom collections import defaultdict as dd, deque, Counter as C\r\nfrom itertools import combinations as comb, permutations as perm\r\nfrom bisect import bisect_left as bl, bisect_right as br, bisect\r\nfrom time import perf_counter\r\nfrom fractions import Fraction\r\n# import numpy as np\r\n# sys.setrecursionlimit(int(pow(10,6)))\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\ntry:\r\n sys.stdin = open(\"input.txt\", \"r\")\r\nexcept:\r\n pass\r\n\r\n\r\n# @lru_cache(None)\r\na,b=L()\r\nsa=set()\r\nsb=set()\r\nsa.add(a)\r\nsb.add(b)\r\nfor i in range(2,int(a**0.5)+2):\r\n if a%i==0:\r\n sa.add(i)\r\n sa.add(a//i)\r\nfor i in range(2,int(b**0.5)+2):\r\n if b%i==0:\r\n sb.add(i)\r\n sb.add(b//i)\r\ns=sa.intersection(sb)\r\ns.add(1)\r\ns=sorted(list(s))\r\n# print(s)\r\nq=L()[0]\r\nn=len(s)\r\nfor i in range(q):\r\n a,b=L()\r\n l=bl(s,a)\r\n r=br(s,b)\r\n # print(l,r)\r\n if l>r:\r\n print(-1)\r\n continue\r\n if l==r:\r\n if l<len(s) and l>=0 and s[l]>=a and s[l]<=b:\r\n print(s[l])\r\n else:\r\n print(-1)\r\n continue\r\n while(r>n):\r\n r-=1\r\n if l<=r:\r\n print(s[r-1])\r\n else:\r\n print(-1)\r\n\r\n", "a,b=map(int,input().split())\r\nimport math\r\ng = math.gcd(a, b)\r\n# generate the divisor\r\ndivisor =[]\r\ni=1\r\nwhile i*i<g+1:\r\n if g%i==0:\r\n divisor.append(i),divisor.append(int(g/i))\r\n if i*i==g:\r\n divisor.append(i)\r\n i+=1\r\ndivisor.sort()\r\nn=int(input())\r\ns=len(divisor)-1\r\nfor i in range(n):\r\n ans=0\r\n L=0\r\n H=s\r\n l,h=map(int,input().split())\r\n# print(\"len:divisor\",len(divisor))\r\n while L<=H:\r\n m=(L+H)//2\r\n if divisor[m]<=h:\r\n ans=m\r\n L=m+1\r\n else:\r\n H=m-1\r\n if divisor[ans] < l:\r\n print(-1)\r\n else: print(divisor[ans]) \r\n " ]

[ "with open(\"input.txt\") as f:\r\n\tn, X = map(int, f.readline().split())\r\n\t# print(n, X)\r\n\teatFood = []\r\n\tfor idx, eat in enumerate(f.readline().split()):\r\n\t\teatFood.append((n - idx) * int(eat)) # if save idx-th animal, it will `eat (n - idx) * eat` by the last day\r\n\teatFood.sort(reverse=True)\r\n\tcnt = 0\r\n\twhile eatFood and X >= eatFood[-1]: # greedy: least priority\r\n\t\tcnt += 1\r\n\t\tX -= eatFood.pop()\r\n\twith open(\"output.txt\", 'w') as f:\r\n\t\tprint(cnt, file=f)\r\n\t\t# print(cnt)", "import sys\r\nsys.stdin = open('input.txt')\r\nsys.stdout = open('output.txt', 'w')\r\nn,x=map(int,input().split())\r\nlis=list(map(int,input().split()))\r\nfor i in range(n):\r\n lis[i]=lis[i]*(n-i)\r\nlis.sort()\r\ny=0\r\nz=0\r\nfor i in lis:\r\n y+=i\r\n if(y>x):\r\n break\r\n else:\r\n z+=1\r\nprint(z)", "#!/usr/local/bin/python3\n\nimport sys\n\nsys.stdin = open(\"input.txt\")\nsys.stdout = open(\"output.txt\", \"w\")\n\nday_num, food = list(map(int, input().split()))\neats = list(map(int, input().split()))\n\nvalues = []\nfor i in range(day_num):\n\tvalues.append(eats[i] * (day_num-i))\n\nvalues.sort()\ncount = 0\nfor value in values:\n\tif value > food:\n\t\tbreak\n\tcount += 1\n\tfood -= value\n\nprint(count)\n\n\n\n\n\n# Made By Mostafa_Khaled", "#t=int(input())\r\nfor _ in range(1):\r\n f = open('input.txt', 'r')\r\n x=f.read()\r\n n,m=\"\",\"\"\r\n i=0\r\n while x[i]!=' ':\r\n n+=x[i]\r\n i+=1\r\n n=int(n)\r\n i+=1\r\n while x[i]!='\\n':\r\n m+=x[i]\r\n i+=1\r\n \r\n m=int(m)\r\n i+=1\r\n \r\n l=[]\r\n for j in range(n):\r\n c=\"\"\r\n try:\r\n while x[i]!=' ':\r\n c+=x[i]\r\n i+=1\r\n except:\r\n pass\r\n i+=1\r\n l.append(int(c))\r\n \r\n \r\n d=1\r\n for i in range(n-1,-1,-1):\r\n l[i]=l[i]*d\r\n d+=1\r\n l.sort()\r\n i=0\r\n c=0\r\n while i<n and c<=m:\r\n c+=l[i]\r\n i+=1\r\n f = open(\"output.txt\", 'w')\r\n if c<=m:\r\n d = str(i)\r\n f.write(d)\r\n else:\r\n d=str(i-1)\r\n f.write(d)\r\n \r\n f.close()\r\n", "with open(\"input.txt\") as f:\r\n\tn, X = map(int, f.readline().split())\r\n\teat = list(map(int, f.readline().split()))\r\n\t# dp[i][s]: 在剩余草量为s时，留或不留第i天来的动物所能得到前i天最大动物数。\r\n\tdp = [[0] * (X + 1) for _ in range(n + 1)]\r\n\t# 01背包\r\n\tfor i in range(1, n + 1):\r\n\t\tfor s in range(1, X + 1):\r\n\t\t\t# 不留当前动物\r\n\t\t\tdp[i][s] = dp[i-1][s]\r\n\t\t\t# 留当前动物必须要(n - (i - 1)) * eat[i-1]的食物\r\n\t\t\tleastFood = (n - (i - 1)) * eat[i-1]\r\n\t\t\tif s >= leastFood:\r\n\t\t\t\tdp[i][s] = max(dp[i][s], dp[i-1][s-leastFood] + 1)\r\n\twith open(\"output.txt\", 'w') as f:\r\n\t\tprint(dp[n][X], file=f)\r\n\t\tprint(dp[n][X])", "# region declaration\nfrom collections import *\nfrom functools import *\nfrom math import *\nfrom heapq import *\nfrom itertools import *\nfrom bisect import *\n\n# autopep8: off\ndef floatl(): return (list(map(float, input().split())))\ndef inlt(): return (list(map(int, input().split())))\ndef inp(): return int(input())\ndef ins(): return str(input())\ndef insr(): return list(input())\ndef yesno(predicate): print(\"Yes\" if predicate else \"No\")\n# MOD = 998244353\nMOD = 1_000_000_007 \nINF = int(1e18)\n# autopep8: on\n# endregion\n\n\ndef ints(l): return list(map(int, l.split()))\n\n\ndef solve():\n with open(\"input.txt\", \"r\") as file:\n # Read the contents of the file and split into lines\n lines = file.readlines()\n n, X = ints(lines[0])\n cs = ints(lines[1])\n for i in range(n):\n cs[i] *= n-i\n cs.sort()\n\n tot = 0\n for i, c in enumerate(cs):\n if tot + c > X:\n return i\n tot += c\n return n\n\n\nt = 1\n# t = inp()\nfor _ in range(t):\n with open(\"output.txt\", \"w\") as file:\n ans = solve()\n file.write(str(ans))\n", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\n\r\n\r\ndef solve():\r\n f = open(\"input.txt\", \"r\")\r\n\r\n n, x = map(int, f.readline().split())\r\n c = list(map(int, f.readline().split()))\r\n\r\n f.close()\r\n\r\n c = [c[i] * (n - i) for i in range(n)]\r\n c.sort()\r\n\r\n res = 0\r\n for i in range(n):\r\n x = x - c[i]\r\n if x < 0:\r\n break\r\n res += 1\r\n\r\n f = open(\"output.txt\", \"w\")\r\n f.write(str(res))\r\n f.close()\r\n\r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "#! /usr/bin/python3\r\n\r\n\r\nf=open('input.txt','r')\r\no = open('output.txt', 'w')\r\ns = f.readline()\r\n#print(s)\r\nn, t = map(int, s.strip().split())\r\na = []\r\nc = n\r\ns = f.readline()\r\n#print(s)\r\nfor i in s.strip().split():\r\n k = int(i)\r\n v = k * c\r\n a.append(v)\r\n c = c - 1\r\n\r\na.sort()\r\nret = 0\r\n\r\nfor j in range(0, n):\r\n if t >= a[j]:\r\n ret = ret + 1\r\n t = t - a[j]\r\n else:\r\n break\r\n\r\n\r\no.write(str(ret))\r\nf.close()\r\no.close()\r\n ", "\r\n\r\nX=0\r\nn=0\r\nc=[]\r\nf=[]\r\n# n, X = input().split(\" \")\r\n# n=int(n)\r\n# X=int(X)\r\n# c=input().split(\" \")\r\n# c=list(map(int, c))\r\nwith open(\"input.txt\",\"r\") as inp:\r\n lines = inp.readlines()\r\n for i in range(len(lines)):\r\n if(i==0):\r\n X=int(lines[i].rsplit(\" \")[-1])\r\n n=int(lines[i].rsplit(\" \")[0])\r\n if(i==1):\r\n for val in lines[i].rsplit(\" \"):\r\n c.append(int(val))\r\nfor i in range(len(c)):\r\n f.append(c[i]*(n-i))\r\nf.sort()\r\ntot=0\r\nret=0\r\nfor val in f:\r\n tot+=val\r\n if(tot<=X):\r\n ret+=1\r\n# print(str(ret)+'\\n')\r\nwith open(\"output.txt\",\"w\") as out:\r\n out.write(str(ret)+'\\n')", "import sys\r\n\r\n#sys.stdin = open(\"35D_input.txt\")\r\nsys.stdin = open(\"input.txt\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nn, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nfood_req = []\r\n\r\nfor i in range(n):\r\n food_req.append(c[i]*(n-i))\r\nfood_req.sort()\r\nprefix_food_req = [0]\r\nfor i in range(n):\r\n prefix_food_req.append(prefix_food_req[-1] + food_req[i])\r\n\r\nleft = 0\r\nright = n\r\nans = -1\r\nwhile left <= right:\r\n mid = left + (right - left)//2\r\n if prefix_food_req[mid] <= x:\r\n ans = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\nprint(ans)", "import heapq\r\nimport sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nh = [c[i] * (n - i) for i in range(n)]\r\nheapq.heapify(h)\r\nans = 0\r\nwhile h:\r\n u = heapq.heappop(h)\r\n x -= u\r\n if x < 0:\r\n break\r\n ans += 1\r\nprint(ans)", "import sys\r\nsys.stdin = open('input.txt')\r\nsys.stdout = open('output.txt', 'w')\r\nA = lambda: map(int, input().split())\r\nyesh, s = A()\r\nk = 0\r\nfor q in sorted(q * (yesh - i) for i, q in enumerate(A())):\r\n\ts -= q\r\n\tif s < 0: break\r\n\tk += 1\r\nprint(k)", "import sys\r\n\r\nsys.stdin = open(\"input.txt\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nn, x = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\nfood_req = []\r\n\r\nfor i in range(n):\r\n food_req.append(c[i]*(n-i))\r\nfood_req.sort()\r\nans = 0\r\nsum1 = 0\r\nfor i in range(n):\r\n if sum1 + food_req[i] <= x:\r\n ans += 1\r\n sum1 += food_req[i]\r\n else:\r\n break\r\nprint(ans)", "'''\r\nCreated on 03-Jun-2023\r\n\r\n@author: abhimanyu\r\n'''\r\nimport sys\r\nsys.setrecursionlimit(1000000)\r\n\r\ndef solveRecursive(index, x, a, numCows, n, memo):\r\n if (x < 0):\r\n return 0\r\n if(index < 0):\r\n return numCows\r\n \r\n if memo[index][x] != -1:\r\n return memo[index][x]\r\n \r\n # If we don't consider current cows\r\n ret_without = solveRecursive(index-1, x, a, numCows,n, memo)\r\n \r\n # if we consider current cows\r\n total_grass = (n - index)*a[index]\r\n ret_with = 0\r\n if(total_grass <= x):\r\n ret_with = solveRecursive(index-1, x-total_grass, a, numCows+1, n, memo)\r\n memo[index][x] = max(ret_with, ret_without)\r\n return memo[index][x]\r\n\r\ndef solveIterative(n, x, a):\r\n dp = [[0 for _ in range(x+1)] for _ in range(n+1)]\r\n dp[0][0] = 0\r\n for i in range(1,n+1):\r\n for j in range(1, x+1):\r\n dp[i][j] = dp[i-1][j]\r\n total_grass = (n - i + 1)*a[i-1]\r\n if (total_grass <= j):\r\n dp[i][j] = max(dp[i][j], dp[i-1][j-total_grass] + 1)\r\n return dp[n][x]\r\n\r\ndef run():\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\n n, x = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n print (solveIterative(n, x, a))\r\n \r\nif __name__ == '__main__':\r\n run()\r\n ", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n with open('input.txt') as fp:\r\n return fp.readlines()\r\n\r\n\r\ndef output(ans: str):\r\n with open('output.txt', mode='w') as fp:\r\n fp.write(ans)\r\n\r\n\r\n'''\r\ndef input():\r\n return [line.decode('utf-8') for line in sys.stdin.buffer.readlines()]\r\n\r\n\r\ndef output(ans):\r\n print(ans)\r\n'''\r\n\r\ns = input()\r\nn, x = map(int, s[0].split())\r\nanimal = [x * (n - i) for i, x in enumerate(map(int, s[1].split()))]\r\ndp = [[-10**9] * (x + 1) for _ in range(n + 1)]\r\ndp[0][x] = 0\r\n\r\nfor i in range(n):\r\n for j in range(x, -1, -1):\r\n if animal[i] <= j:\r\n dp[i + 1][j - animal[i]] = max(dp[i + 1][j - animal[i]], dp[i][j] + 1)\r\n dp[i + 1][j] = max(dp[i + 1][j], dp[i][j])\r\n\r\noutput(str(max(dp[-1])))\r\n", "inf = open(\"input.txt\",'r')\r\ninp = inf.readlines()\r\nn, x = map(int,inp[0].split())\r\nls = list(map(int,inp[1].split()))\r\nfood = []\r\nfor i in range(n) :\r\n food.append(ls[i]*(n-i))\r\nfood.sort()\r\ni, stock = 0, 0\r\nwhile i < n :\r\n if stock + food[i] <= x :\r\n stock += food[i]\r\n else :\r\n break\r\n i += 1\r\nf = open(\"output.txt\", 'w')\r\nf.write(str(i))", "fil,w = open(\"input.txt\",\"r\"), open(\"output.txt\",\"w\")\r\ndays,food = list(map(int, fil.readline().strip().split(\" \")))\r\nanimals = list(map(int, fil.readline().strip().split(\" \")))\r\nfor i in range(days):\r\n\tanimals[i] *=(days-i)\r\nanimals.sort()\r\nprint(animals)\r\nif animals[0] > food: print(0)\r\nelse:\r\n\ti=0\r\n\twhile i < days and sum(animals[0:i]) <= food: i+=1\r\n\tif sum(animals[0:i]) > food: w.write(str(i-1))\r\n\telse:w.write(str(i))", "import sys\r\n\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nif __name__ == '__main__':\r\n n, x = [int(__) for __ in input().strip().split()]\r\n arr = [int(__) for __ in input().strip().split()]\r\n l = []\r\n for i in range(n):\r\n l.append((n - i) * arr[i])\r\n l.sort()\r\n su = 0\r\n co = 0\r\n for i in range(n):\r\n if su + l[i] <= x:\r\n su += l[i]\r\n co += 1\r\n else:\r\n break\r\n print(co)\r\n", "archivo=open(\"input.txt\",\"r\")\r\nprintl=open(\"output.txt\",\"w\")\r\ndias,comida=map(int,archivo.readline().strip().split())\r\nL=list(map(int,archivo.readline().strip().split()))\r\n\r\nfor k in range(dias):\r\n L[k]*=(dias -k)\r\nL.sort()\r\ncont=0\r\nfor k in L:\r\n if(k>comida):\r\n break\r\n else:\r\n comida-=k\r\n cont+=1\r\nprintl.write(str(cont))\r\narchivo.close()\r\nprintl.close()\r\n", "import sys\r\n\r\nsys.stdin = open(\"input.txt\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nn, X = map(int, input().split())\r\nc = list(map(int, input().split()))\r\n\r\ndp = sorted(c[i] * (n - i) for i in range(n))\r\n\r\nnum_animals = 0\r\nfor i in range(n):\r\n if X - dp[i] >= 0:\r\n num_animals += 1\r\n X -= dp[i]\r\n else:\r\n break\r\n\r\nprint(num_animals)\r\n", "import sys\r\nsys.stdin = open('input.txt')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\nn,x = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\ndp = [[0]*(x+1) for i in range (n+1)]\r\nfor i in range (n):\r\n for j in range (x,-1,-1):\r\n y = j-(n-i)*c[i]\r\n dp[i][j] = max(dp[i][j], dp[i-1][j])\r\n if y >=0:\r\n dp[i][y] = max(dp[i][y], dp[i-1][j] + 1)\r\nprint(max(dp[n-1]))", "import sys\r\nsys.stdin = open('input.txt')\r\nsys.stdout = open('output.txt', 'w')\r\nn,x = map(int,input().split())\r\na = list(map(int,input().split()))\r\nfor i in range(n):\r\n a[i] = a[i]*(n-i)\r\na.sort()\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\n if s > x:\r\n break\r\nif s<=x:i+=1\r\nprint(i)\r\n", "n, X = 0, 0\r\nc = []\r\n\r\nwith open(\"input.txt\", 'r') as f:\r\n lines = f.readlines()\r\n \r\n n, X = list(map(int, lines[0].split(' ', 1)))\r\n c = [ x for x in list(map(int, lines[1].split(' ')))]\r\n\r\n#print(n, X, c)\r\n\r\ntotal_food = [c[i] * (n - i) for i in range(len(c))]\r\nanimals = [0] * (X + 1)\r\n\r\nfor i in range(n):\r\n for j in range(X, total_food[i] - 1, -1):\r\n animals[j] = max(animals[j], animals[j - total_food[i]] + 1)\r\n\r\nprint(animals[X])\r\n\r\n'''\r\ntotal_food = sorted([c[i] * (n - i) for i in range(len(c))])\r\n\r\nanimals = 0\r\n\r\nfor i in range(n):\r\n X -= total_food[i]\r\n if X >= 0:\r\n animals += 1\r\n else:\r\n break\r\n'''\r\nwith open(\"output.txt\", 'w') as f:\r\n print(animals[X], file=f)\r\n" ]

[ "# import atexit\r\n# import io\r\n# import sys\r\n#\r\n# _INPUT_LINES = sys.stdin.read().splitlines()\r\n# input = iter(_INPUT_LINES).__next__\r\n# _OUTPUT_BUFFER = io.StringIO()\r\n# sys.stdout = _OUTPUT_BUFFER\r\n#\r\n#\r\n# @atexit.register\r\n# def write():\r\n# sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\nimport bisect\r\nfrom datetime import datetime\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n n -= 1\r\n\r\n timestamps = []\r\n raw = []\r\n while True:\r\n s = \"\"\r\n try:\r\n s = input()\r\n except:\r\n print(-1)\r\n exit(0)\r\n\r\n d = datetime.strptime(s[0:19], \"%Y-%m-%d %H:%M:%S\")\r\n timestamps.append(int(d.timestamp()))\r\n raw.append(s[0:19])\r\n idx = bisect.bisect_left(timestamps, timestamps[-1] - n)\r\n if len(timestamps) - idx == m:\r\n print(raw[-1])\r\n exit(0)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "#Keshika Patwari\r\n#Indian Institute Of Technology, Jodhpur\r\n# 2022\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef exe():\r\n \r\n return max(l)\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n if(t>k):\r\n a=f-(t-k)\r\n else:\r\n a=f\r\n l.append(a)\r\nprint(exe())", "n, k = map(int, input().split())\r\npleasure = []\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n res = 0\r\n if t > k:\r\n res = f - (t - k)\r\n else:\r\n res = f\r\n pleasure.append(res)\r\nprint(max(pleasure))\r\n", "n,k=(int(x) for x in input().split())\r\nl=[]\r\nfor i in range(0,n):\r\n f,t=(int(x) for x in input().split())\r\n if(t>k):\r\n l.append(f-(t-k))\r\n else:\r\n l.append(f)\r\nprint(max(l))\r\n \r\n ", "n, k = map(int, input().split())\r\na = [[int(i) for i in input().split()] for j in range(n)]\r\n\r\nmx = -1e9\r\nfor i in a:\r\n\tmx = max(i[0] - i[1] + k if i[1] > k else i[0], mx)\r\n\r\nprint(mx)", "n,k=map(int,input().split())\nmas=[]\nfor i in range(n):\n f,t=map(int,input().split())\n if k>=t:\n mas.append(f)\n\n else:\n mas.append(f-(t-k))\n\n\nprint(max(mas))\n", "n, k=map(int, input().split(\" \"))\r\na = []\r\nfor i in range(n):\r\n\ta.append(list(map(int, input().split(\" \"))))\r\n\r\njoy = []\r\nfor i in range(n):\r\n\tif(a[i][1]>k):\r\n\t\tjoy.append(a[i][0] - (a[i][1]-k))\r\n\telse:\r\n\t\tjoy.append(a[i][0])\r\n\r\nprint(max(joy))", "numRestaurants, timeGiven = list(map(int, input().split(' ')))\r\nmaxJoy = float('-inf')\r\nfor i in range(numRestaurants):\r\n currentRestaurantAttributes = list(map(int, input().split(' ')))\r\n restaurantJoy = currentRestaurantAttributes[0]\r\n restaurantTime = currentRestaurantAttributes[1]\r\n currentJoy = 0\r\n if restaurantTime > timeGiven:\r\n currentJoy = restaurantJoy - (restaurantTime - timeGiven)\r\n else:\r\n currentJoy = restaurantJoy\r\n if currentJoy > maxJoy:\r\n maxJoy = currentJoy\r\nprint(maxJoy)\r\n", "n, k = list(map(int, input().split()))\r\nmax_joy = float('-inf')\r\n\r\nfor _ in range(n):\r\n f, t = list(map(int, input().split()))\r\n \r\n if t > k:\r\n max_joy = max(max_joy, f-(t-k))\r\n else:\r\n max_joy = max(max_joy, f)\r\n\r\nprint(max_joy)\r\n", "from cmath import inf\r\n\r\nx, y = list(map(int, input().split()))\r\nl =[]\r\nfor i in range(x):\r\n l.append(list(map(int, input().split())))\r\n\r\n\r\nma= float('-inf')\r\n\r\nfor i in range(len(l)):\r\n if l[i][1] < y:\r\n if l[i][0]> ma:\r\n ma =l[i][0]\r\n else:\r\n if l[i][0]-(l[i][1] - y) > ma:\r\n ma = l[i][0]-(l[i][1] - y)\r\n\r\nprint(ma)", "n, k = map(int, input().split())\r\nans = - (10 ** 9)\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n ans = max(ans, f - (t - k))\r\n else:\r\n ans = max(ans, f)\r\nprint(ans)\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,k=(int(i) for i in input().split())\r\nf=[]\r\nt=[]\r\nfor i in range(n):\r\n x,y=(int(i) for i in input().split())\r\n f.append(x)\r\n t.append(y)\r\nj=f[0]-max(t[0]-k,0)\r\nfor i in range(1,n):\r\n j=max(j,f[i]-max(t[i]-k,0))\r\nprint(j)", "from sys import stdin, stdout\r\nn, k = map(int, stdin.readline().strip().split())\r\nmax_joy = float('-inf')\r\nfor i in range(n):\r\n fi, ti = map(int, stdin.readline().strip().split())\r\n if ti>k:\r\n joy = fi - (ti-k) \r\n else:\r\n joy = fi \r\n if joy>max_joy:\r\n max_joy = joy \r\nstdout.write(f\"{max_joy}\\n\")\r\n ", "n,k=map(int,input().split()) \r\nmx=-999999999999999999\r\nfor i in range(n):\r\n f,t=map(int,input().split()) \r\n if t>k:\r\n f-=(t-k) \r\n mx = max(mx,f) \r\nprint(mx) ", "n , k = map(int,input().split())\r\na = []\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n if t <= k:\r\n a.append(f)\r\n if t > k:\r\n a.append(f-(t-k))\r\nprint(max(a))", "n,x=map(int,input().split())\r\na,b=map(int,input().split())\r\nif b>x:\r\n ans=a-(b-x)\r\nelse:\r\n ans=a\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n if b>x:\r\n ans=max(ans,a-(b-x))\r\n else:\r\n ans=max(ans,a)\r\nprint(ans)", "from math import inf\r\n\r\n\r\nn, k = map(int, input().split())\r\nres = -inf\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n res = max(res, f - t + k)\r\n else:\r\n res = max(res, f)\r\nprint(res)\r\n", "import math\r\n\r\nm = -math.inf\r\nn, k = [int(j) for j in input().split()]\\\r\n\r\nfor _ in range(n):\r\n f, t = [int(j) for j in input().split()]\r\n if t > k:\r\n m = max(m, f - (t - k))\r\n else:\r\n m = max(m, f)\r\n\r\nprint(m)\r\n\r\n\r\n\r\n", "n,k = map(int,input().split())\r\nsolution = []\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n if t <= k:\r\n solution.append(f)\r\n else:\r\n solution.append(f-(t-k))\r\nprint(max(solution))", "n,k=map(int, input().split())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if b>k:\r\n joy=a-(b-k)\r\n else:\r\n joy=a\r\n if i==0:\r\n max_joy=joy\r\n else:\r\n if max_joy<joy:\r\n max_joy=joy\r\nprint(max_joy)", "s = input().split()\r\nn,k = (int(i) for i in s)\r\nres = []\r\nfor i in range(n):\r\n\ts = input().split()\r\n\ts = [int(i) for i in s]\r\n\tif(s[1] > k):\r\n\t\tres.append(s[0]-(s[1]-k))\r\n\telse:\r\n\t\tres.append(s[0])\r\nprint(max(res))\r\n\r\n", "import sys\n\nif __name__ == \"__main__\":\n n, k = input().split()\n n = int(n)\n k = int(k)\n max_joy = -sys.maxsize - 1\n for i in range(n):\n f, t = input().split()\n f = int(f)\n t = int(t)\n joy = f\n if t > k:\n joy = f-t+k\n if joy > max_joy:\n max_joy = joy\n \n print(max_joy)", "def jy(_k,_t,_f):\r\n if _t<=_k:\r\n return _f\r\n else:\r\n return _f+_k-_t\r\n\r\nn,k=map(int,input().split())\r\njoy=None\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n j=jy(k,t,f)\r\n if joy==None:\r\n joy=j\r\n elif j>joy:\r\n joy=j\r\nprint(joy)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\njoy = []\r\nfor i in range(n):\r\n f, t = input().split()\r\n f = int(f)\r\n t = int(t)\r\n if t > k:\r\n f = f - (t - k)\r\n joy.append(f)\r\nprint(max(joy))", "n,k=[int(x) for x in input().split()]\r\ne=0\r\nl=[]\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n if b>k:\r\n e=a-(b-k)\r\n else:\r\n e=a\r\n l.append(e)\r\nprint(max(l))", "n, k = map(int, input().split())\r\nmax_ = -int('1' + '0' * 1000)\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n tmp = f - (t - k)\r\n else:\r\n tmp = f\r\n if max_ < tmp:\r\n max_ = tmp\r\nprint(max_)", "n,k= map(int,input().split())\r\n# n=int(input())\r\nm=[]\r\njoy=[]\r\nfor i in range(n):\r\n m.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n if m[i][1]<=k:\r\n joy.append(m[i][0])\r\n else:\r\n joy.append(m[i][0]-(m[i][1]-k))\r\n\r\njoy.sort()\r\nprint(joy[n-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n############ ---- Input Functions ---- ############\r\n\r\ndef Lunch_Rush():\r\n n,k = invr()\r\n f_values = []\r\n t_values = []\r\n joy_values = []\r\n\r\n for i in range(n):\r\n fi,ti = invr()\r\n f_values.append(fi)\r\n t_values.append(ti)\r\n \r\n if ti > k:\r\n joy = fi - (ti - k)\r\n else:\r\n joy = fi \r\n \r\n joy_values.append(joy)\r\n \r\n joy_values_sorted = sorted(joy_values,reverse=True)\r\n print(joy_values_sorted[0])\r\n return\r\n \r\n\r\n\r\n\r\nLunch_Rush()", "obed, k = [int(word) for word in input().split()]\nfood = []\nfor i in range(obed):\n f, t = [int(word) for word in input().split()]\n food.append((f,t))\nanswer = max(food, key = lambda x: x[0]-(x[1]-k) if x[1] > k else x[0])\nprint(answer[0] - (answer[1]-k) if answer[1] > k else answer[0])\n\n", "n, k = map(int, input().split())\r\nnums = []\r\n\r\nfor i in range(n):\r\n fi, ti = map(int, input().split())\r\n \r\n \r\n if (ti <= k):\r\n nums.append(fi)\r\n elif (ti > k):\r\n fi = fi - (ti - k)\r\n nums.append(fi)\r\n \r\n \r\nprint(max(nums))\r\n \r\n", "x=list(input().split(' '))\r\nn=int(x[0])\r\nk=int(x[1])\r\njoy1=-9999999999999\r\nfor i in range(n):\r\n y=list(input().split(' '))\r\n f=int(y[0])\r\n t=int(y[1])\r\n if t>=k:\r\n joy=f-(t-k)\r\n elif t<k:\r\n joy=f\r\n if joy1<joy:\r\n joy1=joy\r\nprint(joy1)", "n, k = input().split()\r\nn, k = int(n), int(k)\r\nma = None\r\nfor i in range(n):\r\n a, b = input().split()\r\n a, b = int(a), int(b)\r\n if b > k:\r\n joy = a - b + k\r\n else:\r\n joy = a\r\n if ma is None:\r\n ma = joy\r\n else:\r\n if ma < joy:\r\n ma = joy\r\nprint(ma)\r\n", "n,k=map(int,input().split())\r\nmoments_of_joy=[]\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n if(t>k):\r\n moments_of_joy.append(f-(t-k))\r\n else:\r\n moments_of_joy.append(f)\r\nprint(max(moments_of_joy))\r\n ", "a,b=map(int,input().split())\r\nlst=[]\r\nfor i in range(a):\r\n c,d=map(int,input().split())\r\n if d>b:\r\n lst.append(c-(d-b))\r\n else:\r\n lst.append(c)\r\nprint(max(lst))", "n,k=map(int, input().split())\r\nl=[]\r\nfor i in range(n):\r\n f,t=map(int, input().split())\r\n if t>k:\r\n l.append(f-t+k)\r\n else:\r\n l.append(f)\r\nl.sort(reverse=True)\r\nprint(l[0])", "n , k = map(int , input().split()) \r\nmx = None \r\nfor i in range(n) : \r\n f , t = map(int , input().split()) \r\n if t > k : \r\n f= f -(t - k) \r\n if mx is None or f > mx : \r\n mx = f \r\nprint(mx) \r\n", "a=input()\r\nl=list(map(int, a.split(\" \")))\r\n\r\nn=l[0]\r\nm=l[1]\r\n\r\nmx=-99999999999999999999999999999999999\r\n\r\nfor i in range(0,n):\r\n b=input()\r\n k=list(map(int, b.split(\" \")))\r\n\r\n s=k[0]\r\n t=k[1]\r\n\r\n if t<=m:\r\n x=s\r\n else:\r\n x=s-(t-m)\r\n y=x\r\n if y>mx:\r\n mx=y\r\n\r\nprint(mx)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n \r\n\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\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, k = [int(i) for i in input().split()]\r\nfinal = -1000000000\r\nfor i in range(n):\r\n f, t = [int(i) for i in input().split()]\r\n if t <= k:\r\n m = f\r\n else:\r\n m = f - (t - k)\r\n if m > final:\r\n final = m\r\nprint(final)", "n,k=list(map(int,input().split(' ')))\r\nj=[]\r\nfor i in range(n):\r\n x=list(map(int,input().split(' ')))\r\n if x[1]>k:\r\n t=x[0]-(x[1]-k)\r\n else:\r\n t=x[0]\r\n j.append(t)\r\nprint(max(j))", "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, k, arr):\n res = float('-inf')\n for f,t in arr:\n if t>k:\n res = max(res, f-(t-k))\n else:\n res = max(res,f)\n print(res)\n return\n\n\nif __name__=='__main__':\n n,k = L()\n arr = []\n for _ in range(n):\n arr.append(L())\n solution(n, k, arr)", "\r\ndef solve():\r\n n,k = [int(x) for x in input().split(' ')]\r\n joy = -float('inf')\r\n\r\n for i in range(n):\r\n f,t = [int(x) for x in input().split(' ')]\r\n if t>k:\r\n joy = max(joy, f-(t-k))\r\n else:\r\n joy = max(joy, f)\r\n print(joy)\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()", "a=[int(x) for x in input().split()]\r\nd=[]\r\nfor i in range(a[0]):\r\n \r\n b=[int(x) for x in input().split()]\r\n if(b[1]>a[1]):\r\n d.append(b[0]-(b[1]-a[1]))\r\n else:\r\n d.append(b[0])\r\n \r\nprint(max(d))\r\n ", "n,k=map(int,input().split(' '))\r\nj=-999999999999999999\r\nfor i in range(n):\r\n f,t=map(int,input().split(' '))\r\n j=max(j, f - max(0,t-k))\r\nprint(j)\r\n", "n, k = map(int, input().split())\r\njoys = list()\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n joys.append(f - (t-k) if t > k else f)\r\nprint(max(joys))\r\n", "n,k = map(int,input().split())\r\nfans=-10000000000000\r\nans=0\r\nfor j in range(n):\r\n fi,ti=map(int,input().split())\r\n \r\n if(ti<=k):\r\n ans=fi \r\n else:\r\n ans=fi-ti+k \r\n \r\n if(ans>fans):\r\n fans=ans \r\n \r\nprint(fans)", "n, k = map(int, input().split())\r\n\r\nr = []\r\nfor _ in range(n):\r\n r.append(list(map(int, input().split())))\r\n\r\nm = float('-inf')\r\nfor i in range(len(r)):\r\n if r[i][1] > k:\r\n m = max(m, r[i][0] - r[i][1] + k)\r\n else:\r\n m = max(m, r[i][0])\r\nprint(m)", "s, final = input().split(), []\r\nfor i in range(int(s[0])):\r\n st = input().split()\r\n if int(st[1]) < int(s[1]):\r\n final.append(int(st[0]))\r\n elif int(st[1]) >= int(s[1]):\r\n final.append(int(st[0]) - ((int(st[1]) - int(s[1]))))\r\nprint(max(final))", "import sys\r\nn, k = [int(i) for i in input().split()]\r\n\r\nres = -sys.maxsize\r\nfor i in range(n):\r\n f, t = [int(i) for i in input().split()]\r\n if t > k:\r\n res = max(res, f - (t - k))\r\n else:\r\n res = max(res, f)\r\n\r\nprint(res)", "n,k=map(int,input().split());\r\nmx=-1e18;\r\nwhile(n):\r\n f,t=map(int,input().split());\r\n if(t>k):mx=max(mx,f-(t-k));\r\n else : mx=max(mx,f);\r\n n-=1;\r\nprint(mx);", "n, k = list(map(int, input().split()))\narr = [list(map(int, input().split())) for _ in range(n)]\nbrr = [f if t <= k else f - t + k for f, t in arr]\nprint(max(brr))\n", "n, k = map(int, input().split())\r\nmoo = []\r\nfor i in range(n):\r\n moo.append(list(map(int, input().split())))\r\npor = []\r\nfor i in range(len(moo)):\r\n if moo[i][1] > k:\r\n por.append(moo[i][0]-(moo[i][1]-k))\r\n else:\r\n por.append(moo[i][0])\r\nprint(max(por))", "n,k = map(int,input().split())\nans = None\nfor i in range(n):\n f,t = map(int,input().split())\n ta = f-max(0,t-k)\n if ans is None:\n ans = ta\n else:\n ans = max(ans, ta)\nprint(ans)", "n,k=map(int,input().split())\r\nx=[]\r\nfor i in range (n):\r\n f,t=map(int,input().split())\r\n y=f-t+k\r\n x.append(y if y<f else f)\r\nprint(max(x))", "n,k=[int(x) for x in input().split()]\r\nmaxm=-1000000000\r\nfor i in range(n):\r\n f,t=[int(x) for x in input().split()]\r\n if t>k:\r\n if f-(t-k)>maxm:\r\n maxm=f-(t-k)\r\n elif f>maxm:\r\n maxm=f\r\nprint(maxm)\r\n", "n, k = list(map(int,input().split()))\r\nMAX = -10**11\r\nfor i in range(n):\r\n f,t = list(map(int,input().split()))\r\n if t > k:\r\n f += k - t \r\n MAX = max(MAX,f)\r\nprint(MAX)", "from math import *\r\n\r\nfrom math import factorial as fact, comb as ncr \r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom collections import Counter as ctr\r\nfrom collections import deque as dq\r\n\r\nfrom array import array\r\nfrom re import search\r\n\r\nli=lambda : list(map(int,input().split()))\r\narr=lambda a: array('i',a)\r\nbi=lambda n: bin(n).replace(\"0b\", \"\")\r\nyn=lambda f: print('NYOE S'[f::2])\r\nsbstr=lambda a,s: search('.*'.join(a),s)\r\n\r\ndef solve():\r\n #for _ in range(int(input())):\r\n n,k=li()\r\n m=[]\r\n for i in range(n):\r\n f,t=li()\r\n if k>=t:\r\n m.append(f)\r\n else:\r\n m.append(f-(t-k))\r\n print(max(m))\r\nsolve()", "from math import inf\n\nn, k = map(int, input().split())\nres = -inf\nfor _ in range(n):\n f, t = map(int, input().split())\n x = f - max(0, t - k)\n res = max(res, x)\nprint(res)\n", "n, k = list(map(int, input().split()))\nbest = float('-inf')\n\nfor _ in range(n):\n f, t = list(map(int, input().split()))\n if t <= k:\n best = max(best, f)\n else:\n best = max(best, f - (t - k))\n\nprint(best)\n", "a, b = map(int, input().split())\r\n\r\ny = []\r\nfor i in range(a):\r\n c, d = map(int, input().split())\r\n if d<=b:\r\n y.append(c)\r\n elif d>b:\r\n z = c-d+b\r\n y.append(z)\r\n else:\r\n v = -1\r\n y.append(v)\r\ny.sort()\r\nprint(y[-1])\r\n", "n, k = map(int, input().split())\r\nmax_joy = -float('inf')\r\n\r\nfor _ in range(n):\r\n fi, ti = map(int, input().split())\r\n if ti > k:\r\n joy = fi - (ti - k)\r\n else:\r\n joy = fi\r\n max_joy = max(max_joy, joy)\r\n\r\nprint(max_joy)\r\n", "n,k = map(int,input().split())\nl = []\nl2 = []\nfor i in range(n):\n\tf,t = input().split()\n\tl.append(int(f))\n\tl2.append(int(t))\n\nv = []\nfor x in range(n):\n\tif l2[x] > k:\n\t\tv.append(l[x]-(l2[x]-k))\n\telse:\n\t\tv.append(l[x])\nprint(max(v))", "# t = int(input())\r\n\r\n# for _ in range(t):\r\nn, k = map(int, input().split())\r\n\r\nres = -10 ** 10\r\n\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n\r\n if t <= k:\r\n res = max(res, f)\r\n else:\r\n res = max(res, f-t+k)\r\n\r\nprint(res)\r\n", "n,k = [int(i) for i in input().split()]\na = []\nfor i in range(n) :\n f,t = [int(i) for i in input().split()]\n if t <= k :\n a.append(f)\n else :\n a.append(f-(t-k))\nprint(max(a))\n", "n,k = [int(x) for x in input().split()]\r\nbest = float(\"-inf\")\r\nfor _ in range(n):\r\n f, t = [int(x) for x in input().split()]\r\n\r\n best = max(best, f - (t - k) if t > k else f)\r\n \r\n\r\nprint(best)\r\n", "n,k=map(int,input().split());print(max(i[0]-max(0,i[1]-k) for i in [[*map(int,input().split())] for _ in [0]*n]))", "a=list(map(int,input().split()))\r\njoy=[]\r\nfor i in range(a[0]):\r\n b=list(map(int,input().split()))\r\n \r\n if(b[1]>=a[1]):\r\n joy.append(b[0]-(b[1]-a[1]))\r\n # print(b[1],a[1],\"kkk\")\r\n else:\r\n joy.append(b[0])\r\nprint(max(joy))", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\n\r\nmv = -math.inf\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n\r\n if t > k:\r\n mv = max(mv, f - (t - k))\r\n else:\r\n mv = max(mv, f)\r\n\r\nprint(mv)", "n, k = map(int, input().split())\r\njoy = float('-inf')\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n joy = max(joy,f - (t - k))\r\n else:\r\n joy = max(joy,f)\r\nprint(joy)\r\n", "array=list(map(int, input(). strip(). split()))\r\nn = array[0]\r\nk = array[1]\r\ninfo = []\r\nfor i in range(n) :\r\n s = list(map(int, input(). strip(). split()))\r\n info.append(s)\r\n\r\n\r\nhap = []\r\nfor i in info:\r\n if i[1] <= k :\r\n hap.append(i[0])\r\n if i[1] > k :\r\n hap.append(i[0] + k - i[1])\r\nprint(max(hap))\r\n", "n, k = map(int, input().split())\nm = -10**9\nfor i in range(n):\n f, t = map(int, input().split())\n if t > k:\n m = max(m, f-t+k)\n # print(m)\n else :\n m = max(m, f)\nprint(m)\n", "# https://codeforces.com/contest/276/problem/A\r\n\r\nn, k = [int(i) for i in input().split()]\r\nl = []\r\n\r\nfor j in range(0, n):\r\n f, t = [int(i) for i in input().split()]\r\n l.append([f, t])\r\n\r\njoy = []\r\n\r\nfor i in range(0, n):\r\n if l[i][1] > k:\r\n joy.append(l[i][0] - l[i][1] + k)\r\n else:\r\n joy.append(l[i][0])\r\n\r\nprint(max(joy))", "maxx = -10000000006\r\nx = 0\r\nn, c = input().split()\r\nn, c = int(n), int(c)\r\n#l = list(map(int, input().strip().split()))[:n]\r\nfor i in range(0, n):\r\n n1, n2 = input().split()\r\n n1, n2 = int(n1), int(n2)\r\n if(n2 > c):\r\n x = n1-(n2-c)\r\n else:\r\n x = n1\r\n maxx = max(x, maxx)\r\n\r\nprint(maxx)\r\n", "n,k = input().split()\r\nn=int(n)\r\nk=int(k)\r\nfun = [] \r\n\r\nfor _ in range(n):\r\n restaurant = list(map(lambda x:int(x),input().split()))\r\n f,t = restaurant[0],restaurant[1]\r\n if t>k:\r\n val = f-(t-k)\r\n else:\r\n val = f\r\n fun.append(val)\r\nprint(max(fun))\r\n \r\n", "n,k=map(int,input().split())\r\njoy=[]\r\nfor i in range (n):\r\n f,t=map(int,input().split())\r\n ans=f-(t-k)\r\n if t>k:\r\n joy.append(ans)\r\n else:\r\n joy.append(f)\r\nprint(max(joy))", "n,k = map(int,input().split())\nmjoy = -1e17\njoy = -1e17\nfor _ in range(0,n):\n\tf,t = map(int,input().split())\n\tjoy = f - max(0,t-k)\n\n\tmjoy = max(mjoy,joy)\nprint(mjoy)", "n,k = map(int,input().split())\r\nm = -float('inf')\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n if l[1] > k:\r\n if m < l[0] - l[1] + k:\r\n m = l[0] - l[1] + k\r\n else:\r\n if m < l[0]:\r\n m = l[0]\r\n\r\nprint(m)", "n,k=map(int,input().split())\ns=[]\nfor i in range(n):\n f,t=map(int,input().split())\n s.append(f-max(0,t-k))\n# print(s)\nprint(max(s))", "n, k = map(int, input().split())\r\nf, t = map(int, input().split())\r\nif t <= k:\r\n ans = f\r\nelse:\r\n ans = f - (t - k)\r\nfor i in range(n - 1):\r\n f, t = map(int, input().split())\r\n if t <= k:\r\n ans = max(ans, f)\r\n else:\r\n ans = max(ans, f - (t - k))\r\nprint(ans)\r\n", "import math\r\n\r\nn,k = [int(i) for i in input().split()]\r\narr = []\r\nfor _ in range(n):\r\n arr.append([int(i) for i in input().split()])\r\n\r\njoy = -math.inf\r\n\r\nfor i in range(n):\r\n if arr[i][1]<=k:\r\n joy = max(joy,arr[i][0])\r\n else:\r\n joy = max(joy,arr[i][0]-(arr[i][1]-k))\r\nprint(joy)", "n,k=map(int,input().split());\r\nj=-10**9-1;\r\nfor i in range(n):\r\n f,t=map(int,input().split());\r\n if(t>k):\r\n j=max(j,f-t+k);\r\n else:\r\n j=max(j,f)\r\nprint(j);", "a=list(map(int , input().split()))\r\nmaxi_taxi=0\r\nfor i in range(a[0]):\r\n b=list(map(int , input().split()))\r\n if b[1]>a[1]:\r\n count1=b[0]-(b[1]-a[1])\r\n else:\r\n count1=b[0]\r\n if i==0:\r\n maxi_taxi=count1\r\n if count1>maxi_taxi:\r\n maxi_taxi=count1\r\nprint(maxi_taxi)\r\n\r\n\r\n", "test , k = map(int,input().split())\nres = []\nfor i in range(test):\n fi, ti = map(int,input().split())\n if ti>k:\n res.append(fi-ti+k)\n else:\n res.append(fi)\nres.sort()\nprint(res[-1])", "n,k = [int(x) for x in input().split()]\r\n\r\nmaxjoy = -10e9\r\nfor x in range(n):\r\n f,t = [int(x) for x in input().split()]\r\n joy = 0\r\n if t > k :\r\n joy = f - (t-k)\r\n else: joy = f\r\n maxjoy = max(maxjoy,joy)\r\n \r\nprint(maxjoy)", "n, k = [int(i) for i in input().split()]\r\nval = -1e10\r\nfor i in range(n):\r\n fi, ti = [int(i) for i in input().split()]\r\n hap = fi-(ti-k) if (ti > k) else fi\r\n val = max(val, hap)\r\nprint(val)\r\n", "def solve(n, k, arr):\r\n mx = float(\"-inf\")\r\n for f, t in arr:\r\n if t > k:\r\n res = f - (t - k)\r\n mx = max(mx, res)\r\n else:\r\n mx = max(mx, f)\r\n\r\n return mx\r\n\r\nn, k = map(int, (input().split()))\r\narr = []\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n arr.append([f, t])\r\nprint(solve(n, k, arr))", "el = input(\"\")\narr = el.split(\" \")\nfor i in range(0, len(arr)):\n arr[i] = int(arr[i])\nnum = arr[0]\nk = arr[1]\nbigArr = []\nfor i in range(0,num):\n inp = input(\"\")\n smolArr = inp.split(\" \")\n bigArr.append(smolArr)\nhappy = []\nfor ar in bigArr:\n if k < int(ar[1]):\n happ = int(ar[0]) - int(ar[1]) + k \n happy.append(happ)\n elif k >= int(ar[1]):\n happ = int(ar[0])\n happy.append(happ)\nprint((max(happy))) ", "import math\r\nn, k = [int(x) for x in input().split()]\r\nflst = []\r\ntlst = []\r\nmx = -math.inf\r\nm = n\r\n\r\nwhile n:\r\n n -= 1\r\n f, t = [int(x) for x in input().split()]\r\n flst.append(f)\r\n tlst.append(t)\r\n\r\nfor i in range(m):\r\n if tlst[i] >= k:\r\n if (flst[i] - tlst[i] + k) > mx:\r\n mx = flst[i] - tlst[i] + k\r\n\r\n else:\r\n if flst[i] > mx:\r\n mx = flst[i]\r\n\r\nprint(mx)\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nM=-1000000000\r\nwhile n:\r\n f,t=map(int,input().split())\r\n if(k<t):\r\n f-=(t-k)\r\n if(f>M):\r\n M=f\r\n n-=1\r\nprint(M)", "l=[int(l) for l in input().split()]\r\nnum=l[-1]\r\nlist_1=[]\r\nfor index in range(l[0]):\r\n x=[int(x) for x in input().split()] \r\n f=x[0]\r\n t=x[1]\r\n if (t>num):\r\n list_1.append((f-(t-num)))\r\n else:\r\n list_1.append(f)\r\nlist_1.sort() \r\nprint(list_1[-1]) ", "n,k=[int(x) for x in input().split()]\r\nans=-10**10\r\nfor i in range(n):\r\n f,t=[int(x) for x in input().split()]\r\n if t<=k:\r\n res=f\r\n else:\r\n res=f-(t-k)\r\n ans=max(ans,res)\r\nprint(ans)", "a=input()\r\nb=list(map(int, a.split(\" \")))\r\nn=b[0]\r\nk=b[1]\r\nmax=-999999999999\r\nfor i in range(n):\r\n c=input()\r\n d=list(map(int, c.split(\" \")))\r\n f=d[0]\r\n t=d[1]\r\n if t<=k:\r\n ans1=f\r\n else:\r\n ans1=f-(t-k)\r\n y=ans1\r\n if y>max:\r\n max=y\r\nprint(max)", "n, k = input().split()\r\nn = int(n)\r\nk = int(k)\r\nmaxf = 0\r\nfor i in range(n):\r\n f, t = input().split()\r\n f = int(f)\r\n t = int(t)\r\n if t > k:\r\n tmaxf = f - (t - k)\r\n else:\r\n tmaxf = f\r\n if i == 0:\r\n maxf = tmaxf\r\n \r\n if tmaxf > maxf:\r\n maxf = tmaxf\r\nprint(maxf)", "n , k = [int(x) for x in input().split()]\r\nl = []\r\nfor i in range(0,n):\r\n f , t = [ int(x) for x in input().split() ]\r\n if t > k: f = f - t + k\r\n l.append(f)\r\nprint(max(l))\r\n\r\n ", "n, k = map(int, input().split())\nmaxx = -10 ** 9\nfor _ in range(n):\n f, t = map(int, input().split())\n if t > k:\n maxx = max(maxx, f - (t - k))\n else:\n maxx = max(maxx, f)\nprint(maxx)\n", "import math\r\ndef main():\r\n\t# t = int(input())\r\n\t# for _ in range(t):\r\n\tprint(case())\r\n\r\ndef case():\r\n\tn, k = map(int, input().split())\r\n\tmm = None\r\n\tfor _ in range(n):\r\n\t\tf, t = map(int, input().split())\r\n\t\tif t > k:\r\n\t\t\tfun = f - (t-k)\r\n\t\telse:\r\n\t\t\tfun = f\r\n\t\t\r\n\t\tif mm == None:\r\n\t\t\tmm = fun\r\n\t\t\tcontinue\r\n\t\t\t\r\n\t\tmm = max(mm, fun)\r\n\r\n\treturn mm\r\n\r\n\r\nmain()", "n, k = map(int, input().split())\nv = []\nfor _ in range(0, n):\n v.append(list(map(int, input().split())))\nprint(max((f - ((t - k) * (t > k)) for f, t in v)))\n", "import math\r\nimport sys\r\nimport random\r\n\r\nans = -1000000000000000000\r\nn, m = map(int, input().split())\r\nfor a in range(n):\r\n\tx, y = map(int, input().split())\r\n\tif y > m:\r\n\t\tans = max(ans, x - (y- m))\r\n\telse:\r\n\t\tans = max(ans, x)\r\nprint(ans)\r\n", "inp = input(\"\")\r\nn, k = [int(i) for i in inp.split()]\r\nmax_joy = None\r\n\r\nfor i in range(n):\r\n inp = input(\"\")\r\n f, t = [int(i) for i in inp.split()]\r\n if t > k:\r\n joy = f-(t-k)\r\n else:\r\n joy = f\r\n if max_joy is None:\r\n max_joy = joy\r\n elif joy > max_joy:\r\n max_joy = joy\r\n\r\nprint(max_joy)", "n,k=map(int,input().split())\r\nf,t=map(int,input().split())\r\nif t<=k:\r\n h=f\r\nelif t>k:\r\n h=f-t+k\r\nmax=h\r\nfor i in range(1,n):\r\n h=0\r\n f,t=map(int,input().split())\r\n if t<=k:\r\n h=f\r\n elif t>k:\r\n h=f-t+k\r\n \r\n if h>max:\r\n max=h\r\nprint(max)", "n,k=list(map(int,input().split()))\r\nb=[]\r\nfor x in range(n):\r\n f,t=list(map(int,input().split()))\r\n if t>k:\r\n s=(f-(t-k))\r\n b.append(s)\r\n else:\r\n s=f\r\n b.append(s)\r\nprint(max(b))", "n , k = [int(x) for x in input().split()]\r\nans = 0 \r\nfor i in range (n):\r\n fi , ti = [int(x) for x in input().split()]\r\n if ti > k:\r\n tmp = fi - (ti - k)\r\n if ans < tmp:\r\n ans = tmp\r\n if i == 0:\r\n ans = tmp\r\n else :\r\n if ans < fi :\r\n ans = fi\r\nprint(ans)", "[n,k]=map(int,input().split())\r\nlist1=[]\r\nfor i in range(0,n):\r\n [f,t]=map(int,input().split())\r\n if t>k:\r\n list1.append(f-(t-k))\r\n else:\r\n list1.append(f)\r\n \r\nprint(max(list1))\r\n\r\n", "from collections import defaultdict\r\nfrom operator import inv\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inps():\r\n return(input())\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn, k = invr()\r\nrestaurants = []\r\nfor i in range(n):\r\n f, t = invr()\r\n restaurants.append((f, t))\r\n\r\nmaxProfit = -float('inf')\r\nfor f, t in restaurants:\r\n if t > k:\r\n profit = f - (t - k)\r\n else:\r\n profit = f\r\n maxProfit = max(maxProfit, profit)\r\n\r\nprint(maxProfit)", "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, k = [int(x) for x in input().split()]\n res = float(\"-inf\")\n for _ in range(n):\n f, t = [int(x) for x in input().split()]\n if t > k:\n res = max(res, f - (t - k))\n else:\n res = max(res, f)\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "n, k = map(int, input().split())\r\nans = -1e10\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n ans = max(ans, f-(t-k) if t>k else f)\r\nprint(ans)\r\n", "a=map(int,input().split())\r\nn,k=a\r\ny=[]\r\nfor i in range(n):\r\n x=map(int,(input().split()))\r\n f,t=x\r\n if t>k:\r\n y.append(f-(t-k))\r\n else:\r\n y.append(f)\r\nprint(max(y))\r\n", "n, k = map(int, input().split())\r\nans = None\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n if _ == 0: ans = f - (0 if t <= k else t - k)\r\n else: ans = max(ans, f - (0 if t <= k else t - k))\r\nprint(ans)", "I=lambda:map(int,input().split());n,k=I()\r\nprint(max((lambda f,t:f-max(0,t-k))(*I())for i in[0]*n))", "b = list(map(int, input().split()))\r\nn = []\r\nk = b[1]\r\nm = b[0]\r\nsu = -100000000000000\r\nfor i in range(m):\r\n h = list(map(int, input().split()))\r\n n.append(h)\r\nfor i in range(m):\r\n a = 0\r\n if n[i][1] > k:\r\n if su < n[i][0] - (n[i][1] - k):\r\n su = n[i][0] - (n[i][1] - k)\r\n else:\r\n if su < n[i][0]:\r\n su = n[i][0]\r\nprint(su)\r\n\r\n\r\n", "#!/usr/bin/env python\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,k = map(int, wtf[0].split())\r\n ans = -int(1e10)\r\n for s in wtf[1:]:\r\n f,t = map(int,s.split())\r\n if t > k:\r\n z = f-(t-k)\r\n if z > ans:\r\n ans = z\r\n else:\r\n if f > ans:\r\n ans = f\r\n print(ans)\r\n", "n,k = map(int,input().split())\r\nm = [[] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n m[i] = input().split()\r\n\r\ns = -10000**20\r\n\r\nfor i in range(0,n):\r\n if int(m[i][1]) > k:\r\n s = max(s, int(m[i][0]) - (int(m[i][1]) - k))\r\n else:\r\n s = max(s, int(m[i][0]))\r\nprint(s)\r\n", "n,k=map(int,input().split())\r\nmaxjoy=float('-inf')\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n maxjoy=max(maxjoy,f-max(0,t-k))\r\nprint(maxjoy)\r\n", "n,k=map(int,input().split())\r\na=[]\r\n\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n\r\n if t>k:\r\n a.append(f-(t-k))\r\n\r\n else:\r\n a.append(f)\r\nprint(max(a))", "n, k = map(int, input().split())\nf, t = map(int, input().split())\nif t > k:\n\tjoy = f - (t - k)\nelse:\n\tjoy = f\nfor _ in range(1, n):\n\tf, t = map(int, input().split())\n\tif t > k:\n\t\tj_find = f - (t - k)\n\telse:\n\t\tj_find = f\n\tif j_find > joy: joy = j_find\nprint(joy)\n\t \t \t \t \t \t \t \t \t \t", "n, k = map(int, input().split())\r\nd = -1000_000_000_0\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n d = max(d, f - (t - k))\r\n else:\r\n d = max(d, f)\r\n \r\nprint(d)", "n, k = map(int, input().split())\r\n\r\nmax_joy = -1e9 # initialize the maximum joy value to a very small number\r\n\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n joy = f - (t - k)\r\n else:\r\n joy = f\r\n max_joy = max(max_joy, joy) # update the maximum joy value if necessary\r\n\r\nprint(max_joy)\r\n", "n, k = map(int, input().split())\r\nMax = -9999999999\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n Max = max(Max, f-t+k)\r\n else:\r\n Max = max(Max, f)\r\nprint(Max)", "q = list(map(int, input().split()))\r\nk = q[1]\r\np = []\r\nfor i in range(q[0]):\r\n a = list(map(int, input().split()))\r\n t = a[1]\r\n f = a[0]\r\n if(t>k):\r\n p.append(f-(t-k))\r\n else:\r\n p.append(f)\r\np.sort()\r\nprint(p[-1])\r\n ", "A,B = list(map(int,input().split()))\r\nans = []\r\nfor i in range(A):\r\n C,D = list(map(int,input().split()))\r\n if D <= B:\r\n ans.append(C)\r\n else:\r\n ans.append(C-(D-B))\r\nprint(max(ans))\r\n", "n,x=map(int,input().rstrip().split());ans=-100000000000\r\nfor e in range(n):\r\n a,b=map(int,input().rstrip().split())\r\n if b>x:ans=max(ans,a-(b-x))\r\n else :ans=max(ans,a)\r\nprint(ans)", "n,k=list(map(int, input().split()))\r\n\r\n\r\njoy = lambda f,t : f if t<=k else f-t+k\r\n\r\nf1, t1 = list(map(int, input().split()))\r\n\r\ntop = joy(f1,t1)\r\n\r\nfor i in range(n-1):\r\n fi, ti = list(map(int, input().split()))\r\n val = joy(fi, ti)\r\n top = val if val > top else top\r\nprint(top)\r\n\r\n\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n s=input().split()\r\n l.append(s)\r\nans=[]\r\nfor j in l:\r\n if int(j[1])>k:\r\n ct=int(j[0])-int(j[1])+k\r\n ans.append(ct)\r\n else:\r\n ct=int(j[0])\r\n ans.append(ct)\r\nprint(max(ans))\r\n \r\n", "n,k=map(int,input().split())\r\nl=[]\r\np=[]\r\nfor i in range(n):\r\n\tf,t=map(int,input().split())\r\n\t# l.append(f,t)\r\n\tif(t>k):\r\n\t\tp.append(f-t+k)\r\n\telse:\r\n\t\tp.append(f)\r\nprint(max(p))", "n,k = map(int,input().split())\r\nm = 0\r\nx,y = map(int,input().split())\r\nif y > k:\r\n m = (x-(y-k))\r\nelse:\r\n m = x\r\nfor i in range(1,n):\r\n x,y = map(int,input().split())\r\n if y > k:\r\n m = max(x-(y-k),m)\r\n else:\r\n m = max(x,m)\r\nprint(m)", "n,k=map(int,input().split())\r\njoy=0\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n if i==0:\r\n if t>k:\r\n joy=f-(t-k)\r\n elif t<=k:\r\n joy=f\r\n elif i>0:\r\n if t>k and joy < f-(t-k):\r\n joy=f-(t-k)\r\n elif t<=k and joy < f:\r\n joy=f\r\nprint(joy)\r\n", "import sys\r\nimport collections\r\nimport math\r\ninput = sys.stdin.readline\r\n\r\nints = lambda: list(map(int, input().split()))\r\n\r\nmx = -math.inf\r\nn, k = ints()\r\nfor _ in range(n):\r\n f, t = ints()\r\n if t > k:\r\n j = f - (t - k)\r\n else:\r\n j = f\r\n mx = max(mx, j)\r\nprint(mx)", "import math\r\nimport sys\r\n\r\ndef _input(): return map(int, input().split())\r\n\r\nn, k = _input()\r\nres = -sys.maxsize\r\nfor _ in range(n):\r\n fi, ti = _input()\r\n if ti > k: res = max(res, fi - (ti-k))\r\n else: res = max(res, fi)\r\nprint(res)", "I=lambda:map(int,input().split())\r\nn,k=I()\r\nprint(max((lambda a,b:a-max(0,b-k))(*I()) for i in[0]*n))", "z, x = map(int, input().split())\r\nd = []\r\nfor i in range(z):\r\n a, s = map(int, input().split())\r\n if s > x:\r\n d.append(a-(s-x))\r\n else:\r\n d.append(a)\r\nprint(max(d))", "n,k=map(int,input().split())\r\na=-1e17\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n a=max(a,f-max(0,t-k))\r\nprint(a)\r\n", "n,m=map(int,input().split())\r\nl1=[]\r\nl2=[]\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l1.append(a)\r\n l2.append(b)\r\n if b>m:\r\n fun=a-(b-m)\r\n l.append(fun)\r\n else:\r\n fun=a\r\n l.append(fun)\r\n\r\nprint(max(l))\r\n", "num,time=map(int,input().split(\" \"))\r\nlistt=[]\r\nfinal=[]\r\nfor i in range(num):\r\n array=list(map(int,input().split(\" \")))\r\n listt.append(array)\r\nfor x in listt:\r\n joy=0\r\n if x[1]>time:\r\n joy=x[0]-(x[1]-time)\r\n \r\n else:\r\n joy=x[0]\r\n final.append(joy)\r\nprint(max(final))", "n,k=[int(i1) for i1 in input().split()]\r\nl=[]\r\nfor i2 in range(n):\r\n f,t=[int(i3) for i3 in input().split()]\r\n if t>k:\r\n l.append(f-t+k)\r\n else :\r\n l.append(f)\r\nprint(max(l))", "[n,k] = map(int, input().split())\nmax_joy = -9999999999\nfor poop in range(n):\n [f,t] = map(int, input().split())\n if t > k:\n joy = f - (t - k)\n else:\n joy = f\n if joy > max_joy:\n max_joy = joy\n\nprint(max_joy)", "n, k = map(int, input().split())\r\njoy = -9999999999\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n fear = f - t + k\r\n joy = max(joy, fear)\r\n else:\r\n joy = max(joy, f)\r\nprint(joy)", "def main ():\r\n n,k = map(int,input().split())\r\n max_joy_in_ith_resturant=0\r\n max_joy=-float(\"inf\")\r\n for i in range (n):\r\n f,t = map(int,input().split())\r\n if t>k:\r\n max_joy_in_ith_resturant=f-(t-k)\r\n else:\r\n max_joy_in_ith_resturant=f\r\n if max_joy_in_ith_resturant>max_joy:\r\n max_joy=max_joy_in_ith_resturant\r\n print(max_joy)\r\nmain()\r\n", "n,k = map(int, input().split())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n if s[1] < k :\r\n a.append(s[0])\r\n else :\r\n x = (s[0]-(s[1]-k))\r\n b.append(x)\r\n \r\nab = a+b\r\ns = sorted(ab)\r\nm = max(s)\r\nprint(m)", "n,k=map(int,input().split())\r\njoy=0\r\nmax_joy=-999999999\r\nfor i in range (n):\r\n fi,ti=map(int,input().split())\r\n if ti<=k:\r\n joy=fi\r\n elif ti>k:\r\n joy=fi-(ti-k)\r\n if joy>max_joy:\r\n max_joy=joy\r\nprint(max_joy)\r\n", "l = [] \r\nn,k = [int(i) for i in input().split()]\r\nfor _ in range(n): \r\n \r\n f,t = [int(i) for i in input().split()]\r\n if t>k:\r\n l.append(f-t+k)\r\n else: \r\n l.append(f)\r\nprint(max(l))", "N, K = map(int, input().split())\r\nans = -1e18\r\nfor i in range(N):\r\n\tf, t = map(int, input().split())\r\n\tif t <= K:\r\n\t\tans = max(ans, f)\r\n\telse:\r\n\t\tans = max(ans, f - (t - K))\r\nprint(ans)", "n, k = list(map(int, input().split(' ')))\r\n\r\nres = []\r\n\r\nwhile n > 0:\r\n f, t = list(map(int, input().split(' ')))\r\n\r\n if t > k:\r\n res.append(f-(t-k))\r\n else:\r\n res.append(f)\r\n n -= 1\r\n\r\nprint(max(res))", "n, k = [int(i) for i in input().split()]\r\n\r\nres = []\r\n\r\nfor i in range(n):\r\n res.append([int(i) for i in input().split()])\r\n\r\nmaxim = 0\r\nmaxIndex = 0\r\n\r\nif (res[0][1] > k):\r\n maxim = res[0][0] - res[0][1] + k\r\nelse:\r\n maxim = res[0][0]\r\n\r\nfor i in range(len(res)):\r\n a = 0\r\n if (res[i][1] > k):\r\n a = res[i][0] - res[i][1] + k\r\n else:\r\n a = res[i][0]\r\n if a > maxim:\r\n maxim = a\r\n maxIndex = i\r\n\r\nprint(maxim)", "n,k=map(int,input().split())\r\nm=float('-inf')\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n m=max(m,a-max(0,b-k))\r\nprint(m)\r\n", "ot = -100000000000000000000000000000000000000000000000000000000\r\nn,k = map(int,input().split())\r\nfor _ in range(n):\r\n f,t = map(int,input().split())\r\n if k >= t:\r\n if f > ot:\r\n ot = f\r\n else:\r\n if f - t + k > ot:\r\n ot = f - t + k\r\nprint(ot)\r\n", "import math\r\nfrom sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\n\r\ndef str_input():\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\n\r\ndef char_list_input():\r\n s = input()\r\n return list(s[:len(s)-1])\r\n\r\n\r\ndef list_input(type):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef multi_input():\r\n return map(int, input().split())\r\n\r\n\r\ndef main():\r\n n, k = multi_input()\r\n ans = - (2**60)\r\n for i in range(n):\r\n f, t = multi_input()\r\n ans = max(ans, f-max(0, t-k))\r\n print(f\"{ans}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def find(array, k):\r\n max_ = float('-inf')\r\n for f, t in array:\r\n if t <= k:\r\n max_ = max(max_, f)\r\n else:\r\n max_ = max(max_,f-(t-k))\r\n return max_ if max_ != float('-inf') else -1\r\n\r\nlength, k = map(int,input().split())\r\narray = []\r\nfor index in range(length):\r\n f, t = map(int, input().split())\r\n array.append([f,t])\r\nprint(find(array, k))", "n,k = map(int,input().split())\r\nli=[]\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n if(t>k):\r\n li.append(f-(t-k))\r\n else:\r\n li.append(f)\r\nprint(max(li))", "n,k=map(int,input().split())\r\nmaxx=-10**18\r\nfor i in range(n):\r\n line=list(map(int,input().split()))\r\n if line[1]<=k:\r\n maxx=max(line[0],maxx)\r\n else:\r\n maxx=max((line[0]-(line[1]-k),maxx))\r\nprint(maxx)", "n,k=map(int,input().split())\r\nfun=list()\r\nfor _ in range(n):\r\n f,t=map(int,input().split())\r\n if t>k:\r\n fun.append(f-(t-k))\r\n else:\r\n fun.append(f)\r\nprint(max(fun))\r\n", "import sys\r\n\r\nk =input().split()\r\nn,m = int(k[0]),int(k[1])\r\nj = -999999999999\r\nfor i in range(n):\r\n a = [int(a) for a in input().split()]\r\n if a[1] <= m:\r\n l=a[0]\r\n else:\r\n l=a[0]-(a[1]-m)\r\n if l > j:\r\n j=l\r\nprint(j)", "n,k=map(int,input().split())\r\nm=-99999999999999\r\nfor i in range(n):\r\n f,t = map(int, input().split())\r\n y=f\r\n if t>k:\r\n y=f-(t-k)\r\n m=max(m,y)\r\nprint(m)", "n,k=map(int, input().split())\r\nm=float('-inf')\r\nfor i in range(n):\r\n f,t=map(int, input().split())\r\n if t-k>=0:\r\n l=f-(t-k)\r\n else:\r\n l=f\r\n m=max(m,l)\r\nprint(m)", "n, k = map(int, input().split())\r\njoy = 0\r\nlist = list()\r\nfor i in range(1, n+1):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n joy += (f-(t-k))\r\n list.append(joy)\r\n joy = 0\r\n else:\r\n joy += f\r\n list.append(joy)\r\n joy = 0\r\nprint(max(list))", "n, k = list(map(int, input().split(\" \")))\r\nj = -1000000000\r\nfor _ in range(n):\r\n f, t = list(map(int, input().split()))\r\n if t <= k and f > j:\r\n j = f\r\n elif t > k:\r\n if f - (t-k) > j:\r\n j = f - (t-k)\r\nprint(j)\r\n\r\n\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nans = -2e10\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n f -= t - k\r\n ans = max(f, ans)\r\nprint(ans)\r\n", "n, k = map(int, input().split())\r\narr = []\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n arr.append([f, t])\r\nm = - float('inf')\r\n\r\nfor f,t in arr:\r\n if t > k:\r\n m = max(m, (f-(t-k)))\r\n else:\r\n m= max(m, f)\r\nprint(m)\r\n\r\n\r\n\r\n", "n,k = list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n):\r\n fi,ti = list(map(int,input().split()))\r\n if ti>k:\r\n joy = fi-ti+k\r\n else:\r\n joy = fi\r\n b.append(joy)\r\n\r\nprint(max(b))\r\n ", "n,k = map(int,input().split())\r\n\r\njoy = float(\"-inf\")\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n \r\n if b>k:\r\n joy = max(joy, k+a-b)\r\n else:\r\n joy = max(joy, a)\r\n\r\n\r\nprint(joy)\r\n", "n, k = map(int, input().split())\njoy = None\nfor _ in range(n):\n\tf, t = map(int, input().split())\n\tif t > k: j_find = f - (t - k)\n\telse: j_find = f\n\tif joy == None or j_find > joy: joy = j_find\nprint(joy)\n \t \t \t \t\t\t\t\t\t\t\t\t \t \t \t \t", "s, q = map(int, input().split())\r\nl_p = -1e10\r\nfor _ in range(s):\r\n f, t = map(int, input().split())\r\n l_p = max(f - max(0, t - q), l_p)\r\nprint(l_p)", "test, time = map(int,input().split())\r\nmax_ = []\r\nfor restaurant in range(test):\r\n fun, need = map(int,input().split())\r\n max_.append(fun-(need-time)) if need > time else max_.append(fun)\r\nprint(max(max_))\r\n", "counter = None\r\nn, k = map(int, input().split())\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if t <= k:\r\n m = f\r\n else:\r\n m = f-(t-k)\r\n if counter is None:\r\n counter = m\r\n elif m > counter:\r\n counter = m\r\nprint(counter)\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,k = get_ints()\r\nf,t = get_ints()\r\nm = 0\r\nif t>k:\r\n m = f-t+k\r\nelse:\r\n m = f\r\nfor i in range(n-1):\r\n f,t = get_ints()\r\n if t>k:\r\n m = max(m,f-t+k)\r\n else:\r\n m = max(m,f)\r\nprint(m)", "import math \r\ndef rabbitsuwu(n,s,x):\r\n alist=[]\r\n s.sort(reverse=True)\r\n for i in range(len(s)):\r\n if s[i][1]<=n:\r\n alist.append(s[i][0])\r\n break\r\n x.sort(reverse=True)\r\n j=0 \r\n while j<len(x):\r\n if x[j][0]>n: \r\n alist.append(x[j][1]-(x[j][0]-n))\r\n else:\r\n break\r\n j+=1\r\n return max(alist)\r\nf=input()\r\nalist=[int(d) for d in f.split()]\r\ng=[]\r\nx=[]\r\nfor j in range(alist[0]):\r\n s=input()\r\n blist=[int(d) for d in s.split()]\r\n g.append([blist[0],blist[1]])\r\n x.append([blist[1],blist[0]])\r\nprint(rabbitsuwu(alist[1],g,x)) \r\n", "n,k = map(int,input().split())\r\nans = []\r\nfor i in range(n):\r\n f,t = map(int,input().split())\r\n if t>=k:\r\n ans.append(f-(t-k))\r\n else:\r\n ans.append(f)\r\nprint(max(ans))", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\nk=l[1]\r\nl1=[int(i) for i in input().split()]\r\nf=l1[0]\r\nt=l1[1]\r\nm=0\r\nif t>k:\r\n m=f-(t-k)\r\nelse:\r\n m=f\r\nfor _ in range(n-1):\r\n l1=[int(i) for i in input().split()]\r\n f=l1[0]\r\n t=l1[1]\r\n if t>k:\r\n m1=f-(t-k)\r\n else:\r\n m1=f\r\n if m1>m:\r\n m=m1\r\nprint(m)\r\n", "n, k = map(int, input().split())\nmaxi = None\nfor _ in range(n):\n f, t = map(int, input().split())\n joy = f\n if t > k:\n joy = f - (t - k)\n if maxi is None:\n maxi = joy\n else:\n maxi = max(maxi, joy)\nprint(maxi)\n", "n, k = [int(x) for x in input().split()]\r\nmax = []\r\nfor _ in range(n):\r\n f, t = [int(x) for x in input().split()]\r\n func = f-(t-k)\r\n if t>k: max.append(func)\r\n else: max.append(f)\r\nprint(sorted(max)[-1])", "I = lambda: list(map(int, input().split()))\r\nn, k = I()\r\nf = [I() for i in range(n)]\r\nprint(max(v[0] if v[1] <= k else v[0] - (v[1] - k) for v in f))", "n, k = map(int,input().split())\nmx = -(10000000000)\nwhile n > 0:\n f,t = map(int,input().split())\n if t > k:\n mx = max(mx,f - ( t - k))\n else:\n mx = max(f,mx)\n n -= 1\nprint(mx)\n", "n, k = [int(i) for i in input().split()]\r\n\r\nmx = -99999999999999\r\nfor i in range(n):\r\n f, t = [int(i) for i in input().split()]\r\n if f > mx:\r\n if t > k:\r\n mx = max(f - (t - k), mx)\r\n else:\r\n mx = f\r\n\r\nprint(mx)", "n,k=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n if(t>k):\r\n arr.append((f-(t-k)))\r\n else:\r\n arr.append(f)\r\nprint(max(arr))", "import sys,copy\nimport math\nfrom os import path\n\nif (path.exists('input.txt')):\n\tsys.stdin = open('input.txt', 'r')\n\tsys.stdout = open('output.txt', 'w')\n\n# def solve():\n# \tt = int(input())\n# \tfor _ in range(t):\n# \t\tn,h = input().split(\" \")\n# \t\tn=int(n)\n# \t\th=int(h)\n# \t\ta=list(map(int, input().split(\" \")))\n# \t\ta = sorted(a)\n# \t\t#print(a[-1])\n# \t\tans=0\n# \t\tif (a[-1]>h):\n# \t\t\tprint(1)\n# \t\telse:\n\t\t\t\n# \t\t\tprint(ans)\n\t\t# print(type(n))\n\t\t# print(type(c))\n\t\t# print(type(s))\n\ndef solven():\n\t#n,t = map(int, input().split(\" \"))\n\t#n,d = map(int, input().split())\n\t#print(int(1/2))\n\tt,k = map(int, input().split())\n\tarr = [[0]*2]*t\n\t#print(arr)\n\tfor i in range(t):\n\t\tarr[i] = list(map(int, input().split()))\n\t\n\tmaxi = []\n\tfor i in range(t):\n\t\tif (arr[i][1]>k):\n\t\t\tcalc = arr[i][0]-arr[i][1]+k\n\t\telse:\n\t\t\tcalc = arr[i][0]\n\t\tmaxi.append(calc)\n\t\t#print(calc)\n\tprint(sorted(maxi)[-1])\n\nif __name__ == \"__main__\":\n\tsolven()\n\t# Rage and Rage Against the dying of light.\n", "n, k = (int(i) for i in input().split())\nf, t = [None] * n, [None] * n\nfor i in range(n):\n f[i], t[i] = (int(i) for i in input().split())\n\n\ndef rank(i):\n return f[i] - max(0, t[i] - k)\n\n\nres = rank(max(range(n), key=rank))\nprint(res)\n", "n, k = map(int, input().split())\nlst = []\nfor i in range(n):\n f, t = [int(x) for x in input().split()]\n if t > k:\n joy = f - (t - k)\n else:\n joy = f\n lst.append(joy)\nprint(max(lst))\n \t\t \t \t \t \t\t\t\t \t\t\t \t \t\t\t \t", "n, k = map(int, input().split(' '))\r\ntab = [list(map(int,input().split(' '))) for _ in range(n)]\r\nprint(max([f-(t-k) if t > k else f for f,t in tab]))", "from math import inf\r\nn,k=map(int,input().split())\r\nma=-inf\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n if b>k:\r\n ma=max(ma,a-b+k)\r\n else:\r\n ma=max(ma,a)\r\nprint(ma)", "n,k=map(int,input().split())\r\narray=[]\r\nc=[]\r\nfor i in range(n):\r\n array.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n if array[i][1]>k:\r\n d=array[i][0]-array[i][1]+k\r\n c.append(d)\r\n else:\r\n c.append(array[i][0])\r\nprint(max(c))\r\n", "# 276A -p(int, input().split())), Lunch Rush\r\n[n, k] = list(map(int, input().split()))\r\nx = list(map(int, input().split()))\r\nif x[1] > k:\r\n l = x[0]+k-x[1]\r\nelse:\r\n l = x[0]\r\nfor i in range(n-1):\r\n [f, t] = list(map(int, input().split()))\r\n if t > k:\r\n z = f+k-t\r\n else:\r\n z = f\r\n l = z if z > l else l\r\nprint(l)\r\n", "n, k = map(int, input().split())\r\n\r\ng = -1e10\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n g = max(f - max(0, t - k), g)\r\nprint(g)", "I=lambda:map(int,input().split())\r\nn,k=I()\r\nm=-10**9\r\nfor _ in range(n):\r\n f,t=I()\r\n m=max(m,f-max(t-k,0))\r\nprint(m)\r\n", "n, k = map(int, input().split())\r\nj = []\r\nfor i in range(n):\r\n fi, ti = map(int, input().split())\r\n j.append(fi + (k - ti) if ti > k else fi)\r\nprint(max(j))\r\n", "n,k = map(int, input().split())\r\nl = []\r\nm = []\r\no = []\r\ns = 0\r\nfor i in range(n):\r\n f,t = map(int, input().split())\r\n l.append(f)\r\n m.append(t)\r\n if m[i]>k:\r\n s = l[i]-(m[i]-k)\r\n o.append(s)\r\n i = i + 1\r\n else:\r\n s = l[i]\r\n o.append(s)\r\n i = i + 1\r\nprint(max(o))", "n, k = map(int, input().split())\r\nans = []\r\nfor i in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n ans.append(f - (t - k))\r\n else:\r\n ans.append(f)\r\nprint(max(ans))", "n, k=map(int, input().split())\r\nans = []\r\nfor _ in range(n):\r\n f, t=map(int, input().split())\r\n \r\n d = abs(t-k)\r\n e = f-d\r\n if t<=k:\r\n ans.append(f)\r\n else:\r\n ans.append(e)\r\nans.sort(reverse=True) \r\nprint(ans[0])", "n,k=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n f,t=list(map(int,input().split()))\r\n arr.append([f,t])\r\narr.sort()\r\nv=0\r\nl=[]\r\nfor i in range(n-1,-1,-1):\r\n if arr[i][1]<=k:\r\n v=arr[i][0]\r\n l.append(v)\r\n else:\r\n v=arr[i][0]-arr[i][1]+k\r\n l.append(v)\r\nl.sort()\r\nprint(l[-1])\r\n", "n, k = map(int, input().split())\r\n\r\nc = -10**10\r\nfor _ in range(n):\r\n f, t = map(int, input().split())\r\n if t > k:\r\n f = (f - t + k)\r\n if f > c:\r\n c = f\r\nprint(c)", "n,k=map(int,input().split())\r\nc=0\r\nx,y=map(int,input().split())\r\nif(y>k):\r\n c=x-(y-k)\r\nelse:\r\n c=x\r\nc1=0\r\nfor i in range(1,n):\r\n x,y=map(int,input().split())\r\n if(y>k):\r\n c1=x-(y-k)\r\n else:\r\n c1=x\r\n if(c1>c):\r\n c=c1\r\nprint(c)", "n, k = [int(i) for i in input().split()]\r\n\r\noutput = None\r\n\r\nfor i in range(n):\r\n f1, t1 = [int(i) for i in input().split()]\r\n \r\n if t1 > k:\r\n joy = f1 - (t1 - k)\r\n else:\r\n joy = f1\r\n\r\n if output == None or joy > output:\r\n output = joy\r\n\r\nprint(output)", "n,k=map(int,input().split())\r\nf,t=map(int,input().split())\r\nif t>k:\r\n ans=f-(t-k)\r\nelse:\r\n ans=f\r\nfor x in range(n-1):\r\n f,t=map(int,input().split())\r\n if t>k:\r\n f-=(t-k)\r\n if f>ans:\r\n ans=f\r\nprint(ans)", "n,k=map(int,input().split())\r\nl1=[]\r\nfor _ in range(n):\r\n f,t=map(int,input().split())\r\n if t>k:\r\n l1.append(f-(t-k))\r\n if t<=k:\r\n l1.append(f)\r\n \r\nprint(max(l1))", "n, k = [int(x) for x in input().split()]\nf = []\nt = []\nfor i in range(n):\n x, y = [int(x) for x in input().split()]\n f.append(x)\n t.append(y)\nans = -10**10\nfor i in range(0, n):\n x = 0\n if t[i] > k:\n x = f[i] - (t[i] - k)\n else:\n x = f[i]\n ans = max(ans, x)\nprint(ans)", "n,k=input().split()\nn,k=int(n),int(k)\nlf=[]\nlt=[]\nfor i in range(n):\n\ta,b=input().split()\n\tlf.append(int(a))\n\tlt.append(int(b))\nif lt[0]>k:\n\ts=lf[0]-(lt[0]-k)\nelse:\n\ts=lf[0]\nfor j in range(n):\n\tif lt[j]>k:\n\t\tif lf[j]-(lt[j]-k)>=s:\n\t\t\ts=lf[j]-(lt[j]-k)\n\telse:\n\t\tif lf[j]>=s:\n\t\t\ts=lf[j]\nprint(s)\n\n\n\n\n\t\t\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\t\n\t\t\t", "n, k = map(int, input().split())\n\nmax_joy: int = -10 ** 10\nfor i in range(n):\n f, t = map(int, input().split())\n joy = f if t <= k else f - t + k\n if joy > max_joy:\n max_joy = joy\nprint(max_joy)\n", "\r\nn , k = [int(x) for x in input().split()]\r\nresturants = [[int(x) for x in input().split()] for j in range(n)]\r\n\r\ndef calcJoy(f , t):\r\n if t - k <= 0:\r\n return f\r\n return f - (t - k)\r\n\r\ndef ky(resturant):\r\n return calcJoy(resturant[0] , resturant[1])\r\n\r\nmJ = max(resturants , key=ky)\r\nprint(calcJoy(mJ[0] , mJ[1]))", "\r\nn, k = list(map(int, input().split()))\r\n\r\ncurrent_max_joy = -999999999999999999999\r\n\r\nwhile n:\r\n\r\n f, t = list(map(int, input().split()))\r\n\r\n joy = f if t <=k else f - (t - k)\r\n\r\n if joy > current_max_joy:\r\n current_max_joy = joy\r\n\r\n n -= 1\r\n\r\nprint(current_max_joy)", "string = input()\r\nlist1 = list(string.split(' '))\r\nmaximum = float('-inf')\r\nlister = []\r\nfor i in range(int(list1[0])):\r\n a = input()\r\n templist = a.split(' ')\r\n lister.append(templist)\r\nfor z in lister:\r\n if int(z[1]) <= int(list1[1]):\r\n if int(z[0]) > maximum:\r\n maximum = int(z[0])\r\n else:\r\n if (int(z[0]) - (int(z[1]) - int(list1[1]))) > maximum:\r\n maximum = (int(z[0]) - (int(z[1]) - int(list1[1])))\r\nprint(maximum)", "def answer(n, k, f_ary, t_ary):\r\n max_joy = -(10**10)\r\n for i in range(n):\r\n if k >= t_ary[i]:\r\n joy = f_ary[i]\r\n else:\r\n joy = f_ary[i] - (t_ary[i] - k)\r\n if joy > max_joy:\r\n max_joy = joy\r\n \r\n return max_joy\r\n \r\ndef main():\r\n n, k = [int(i) for i in input().split()]\r\n f_ary = [0] * n\r\n t_ary = [0] * n\r\n for j in range(n):\r\n f_ary[j], t_ary[j] = [int(i) for i in input().split()]\r\n \r\n print(answer(n, k, f_ary, t_ary))\r\n \r\n \r\nmain()", "L1= [int(x) for x in input().split(\" \")]\r\n\r\nn=L1[0]\r\nk=L1[1]\r\n\r\nL3=[]\r\n\r\nfor i in range (0,n):\r\n L2= [int(x) for x in input().split(\" \")]\r\n f=L2[0]\r\n t=L2[1]\r\n if t>k:\r\n f=f-(t-k)\r\n L3.append(f)\r\n else:\r\n L3.append(f)\r\n\r\nprint(max(L3))\r\n ", "n,k = map(int,input().split())\r\nl = []\r\nfor i in range(n):\r\n f,t = map(int, input().split())\r\n if t > k:\r\n current_j = f-(t-k)\r\n else:\r\n current_j = f\r\n l.append(current_j)\r\n\r\nprint(max(l))", "n,k=map(int,input().split())\nj=[]\nfor i in range(n):\n f,t=map(int,input().split())\n if t<k:\n j.append(f)\n else:\n j.append(f-(t-k))\nprint(max(j))\n", "x, y = map(int, input().split())\r\nmax_joy = -1000000001\r\nfor i in range(x) : \r\n f, k = map(int, input().split())\r\n curr_joy = f\r\n if k > y : \r\n curr_joy = f - (k - y)\r\n max_joy = max(curr_joy, max_joy)\r\n\r\nprint(max_joy)", "n, k = list(map(int,input().split()))\r\nmx = float('-inf')\r\nfor _ in range(n):\r\n f, t = list(map(int,input().split()))\r\n x = f if t<=k else f-(t-k)\r\n if x>mx:mx = x\r\nprint(mx)", "def main():\r\n c,t=input().split(\" \")\r\n restaurantes=[]\r\n for i in range(int(c)):\r\n restaurantes.append(input().split(\" \"))\r\n print(felicidad(restaurantes,int(t)))\r\ndef felicidad(array,t):\r\n felicidad=-100000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000000\r\n for i in range(len(array)):\r\n if int(array[i][1])>t:\r\n f=int(array[i][0])-(int(array[i][1])-t)\r\n else:\r\n f=int(array[i][0])\r\n if f>felicidad:\r\n felicidad=f\r\n return felicidad\r\nmain()\r\n\r\n", "n , k = map(int , input().split())\r\nl =[]\r\nfor i in range(n):\r\n a , b = map(int , input().split())\r\n if b>k:\r\n l.append(a-b+k)\r\n else:\r\n l.append(a)\r\nprint(max(l))", "n,k=map(int,input().split())\r\nans=[]\r\nfor i in range(n):\r\n f,t=map(int,input().split())\r\n if t>k:\r\n ans.append(f-(t-k))\r\n else:\r\n ans.append(f)\r\nprint(max(ans))", "n,k=([int(x) for x in input().split()])\r\nl2=[]\r\nfor i in range (n):\r\n l2.append([int(x) for x in input().split()])\r\nl3=[]\r\nfor i in range(n):\r\n if l2[i][1]>k:\r\n l3.append(l2[i][0]-l2[i][1]+k)\r\n else:\r\n l3.append(l2[i][0])\r\nl3.sort()\r\nprint(l3[-1])", "(number_of_restaurants, time_to_lunch) = map(int, input().split(' '))\n\njubilance = []\n\nfor i in range(number_of_restaurants):\n (units_of_joy, time_to_lunch_in_the_restaurant) = map(int, input().split(' '))\n if time_to_lunch_in_the_restaurant <= time_to_lunch:\n jubilance.append(units_of_joy)\n else:\n jubilance.append(units_of_joy - time_to_lunch_in_the_restaurant + time_to_lunch)\n\nprint(max(jubilance))\n", "n,k=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n ans=[i]+list(map(int,input().split()))\r\n if ans[-1]>k:\r\n s.append(ans[1]-(ans[-1]-k))\r\n else:\r\n s.append(ans[1])\r\nprint(max(s))" ]

[ "s = input()\r\nt = input()\r\nn = len(s)\r\nd = {'([': [0, 1], '((': [0, 0], '[[': [0, 0], '88': [0, 0], '(8': [1, 0],\r\n '8(': [0, 1], '[8': [0, 1], '8[': [1, 0], '[(': [1, 0]}\r\np, q = 0, 0\r\nfor i in range(0, n, 2):\r\n p += d[s[i] + t[i]][0]\r\n q += d[s[i] + t[i]][1]\r\nif p == q:\r\n print('TIE')\r\nelif p > q:\r\n print('TEAM 1 WINS')\r\nelse:\r\n print('TEAM 2 WINS')\r\n", "s1 = input()\r\ns2 = input()\r\nnum1 = 0\r\nnum2 = 0\r\nfor i in range(0, len(s1), 2):\r\n c1 = s1[i:i + 2]\r\n c2 = s2[i:i + 2]\r\n if c1 != c2:\r\n if (c1 == \"8<\" and c2 == \"[]\"):\r\n num1 += 1\r\n elif (c1 == \"()\" and c2 == \"8<\"):\r\n num1 += 1\r\n elif (c1 == \"[]\" and c2 == \"()\"):\r\n num1 += 1\r\n else:\r\n num2 += 1\r\nif num1 == num2:\r\n print(\"TIE\")\r\nelse:\r\n print(\"TEAM {} WINS\".format(int(num2 > num1) + 1))\r\n", "x = input()\r\ny = input()\r\nt1,t2 = 0,0\r\ni=0\r\nwhile i<len(x):\r\n a = x[i:i+2]\r\n # print(a)\r\n b = y[i:i+2]\r\n # print(b)\r\n if a == '[]':\r\n if b=='8<':\r\n t2 += 1\r\n if b=='()':\r\n t1 += 1\r\n elif a == '()':\r\n if b=='[]':\r\n t2 += 1\r\n if b=='8<':\r\n t1 += 1\r\n elif a == '8<':\r\n if b=='()':\r\n t2 += 1\r\n if b=='[]':\r\n t1 += 1\r\n i = i+2\r\nif t1>t2:\r\n print(\"TEAM 1 WINS\")\r\nelif t1<t2:\r\n print(\"TEAM 2 WINS\")\r\nelse:\r\n print(\"TIE\")", "# /**\r\n# * author: brownfox2k6\r\n# * created: 01/04/2023 11:25:42 Hanoi, Vietnam\r\n# **/\r\n\r\ndef solve():\r\n s1 = input()\r\n s2 = input()\r\n p = \"([8\"\r\n score1 = 0\r\n score2 = 0\r\n\r\n for i in range(0, len(s1), 2):\r\n p1 = p.index(s1[i])\r\n p2 = p.index(s2[i])\r\n if p1 > p2:\r\n if p1 - p2 == 1:\r\n score1 += 1\r\n else:\r\n score2 += 1\r\n elif p1 < p2:\r\n if p2 - p1 == 1:\r\n score2 += 1\r\n else:\r\n score1 += 1\r\n \r\n if score1 > score2:\r\n print(\"TEAM 1 WINS\")\r\n elif score2 > score1:\r\n print(\"TEAM 2 WINS\")\r\n else:\r\n print(\"TIE\")\r\n\r\n\r\n_T = 1\r\n# _T = int(input())\r\nfor _ in range(_T):\r\n solve()", "\r\nt=0\r\na,b,c=input(),input(),'8(['\r\nfor i in range(0,len(a),2):\r\n\tk=c.index(a[i])\r\n\tt+=1 if b[i]==c[k-1]else 0 if b[i]==c[k]else -1\r\nprint(\"TEAM %d WINS\"%(1 if t>0 else 2)if t else \"TIE\")", "from math import*\r\n\r\ndef winner(a,b):\r\n\tif a==\"[]\":\r\n\t\tif b==\"()\":\r\n\t\t\treturn 1\r\n\t\telif b==\"[]\":\r\n\t\t\treturn 0\r\n\t\telse:\r\n\t\t\treturn -1\r\n\telif a==\"8<\":\r\n\t\tif b==\"()\":\r\n\t\t\treturn -1\r\n\t\telif b==\"[]\":\r\n\t\t\treturn 1\r\n\t\telse:\r\n\t\t\treturn 0\r\n\telse:\r\n\t\tif b==\"()\":\r\n\t\t\treturn 0\r\n\t\telif b==\"[]\":\r\n\t\t\treturn -1\r\n\t\telse:\r\n\t\t\treturn 1\r\n\r\ns1=input()\r\ns2=input()\r\ni=0\r\nans=0\r\nwhile i<len(s1):\r\n\tans+=winner(s1[i:i+2],s2[i:i+2])\r\n\ti+=2\r\nif ans==0:\r\n\tprint(\"TIE\")\r\nelif ans<0:\r\n\tprint(\"TEAM 2 WINS\")\r\nelse:\r\n\tprint(\"TEAM 1 WINS\")", "a = input()\r\nb = input()\r\nd = 0\r\ns = 0\r\nfor i in range(0, len(a), 2):\r\n if a[i] == \"[\":\r\n if b[i] == \"(\":\r\n s = s + 1\r\n elif b[i] == \"8\":\r\n # s=s-1\r\n d = d + 1\r\n else:\r\n pass\r\n elif a[i] == \"(\":\r\n if b[i] == \"[\":\r\n d = d + 1\r\n elif b[i] == \"8\":\r\n s = s + 1\r\n else:\r\n pass\r\n elif a[i] == \"8\":\r\n if b[i] == \"(\":\r\n d = d + 1\r\n elif b[i] == \"[\":\r\n s = s + 1\r\n else:\r\n pass\r\n else:\r\n pass\r\n\r\n\r\nif (s>d):\r\n print('TEAM 1 WINS')\r\nelif s==d:\r\n print('TIE')\r\nelse :\r\n print('TEAM 2 WINS')\r\n", "from sys import stdin,stdout\r\n# from bisect import bisect_left,bisect\r\n# from heapq import heapify,heappop,heappush\r\n# from sys import setrecursionlimit\r\n# from collections import defaultdict,Counter\r\n# from itertools import permutations\r\n# from math import gcd,ceil,sqrt,factorial\r\n# setrecursionlimit(int(1e5))\r\ninput,print = stdin.readline,stdout.write\r\n\r\ns = input().strip()\r\nt = input().strip()\r\nn = len(s)\r\nx = 0\r\ny = 0\r\nfor i in range(0,n,2):\r\n a = s[i:i+2]\r\n b = t[i:i+2]\r\n if a==\"[]\":\r\n if b==\"()\":\r\n x+=1\r\n elif b==\"8<\":\r\n y+=1\r\n elif a==\"()\":\r\n if b==\"[]\":\r\n y+=1\r\n elif b==\"8<\":\r\n x+=1\r\n elif a==\"8<\":\r\n if b==\"[]\":\r\n x+=1\r\n elif b==\"()\":\r\n y+=1\r\nif x>y:\r\n ans = \"TEAM 1 WINS\"\r\nelif x<y:\r\n ans = \"TEAM 2 WINS\"\r\nelse:\r\n ans = \"TIE\"\r\nprint(ans+\"\\n\")\r\n", "a = input()\r\nb = input()\r\nans1 = 0\r\nans2 = 0\r\nfor i in range(0,len(a),2):\r\n x = a[i]+a[i+1]\r\n y = b[i]+b[i+1]\r\n if x == y:\r\n ans1 += 0\r\n elif x == '[]' and y == '()':\r\n ans1+=1\r\n elif x == '()' and y == '[]':\r\n ans2+=1\r\n elif x == \"()\" and y == \"8<\":\r\n ans1+=1\r\n elif x == \"8<\" and y == \"()\":\r\n ans2+=1\r\n elif x == \"[]\" and y == \"8<\":\r\n ans2+=1\r\n elif x == \"8<\" and y == \"[]\":\r\n ans1+=1\r\nif ans1>ans2:\r\n print(\"TEAM 1 WINS\")\r\nelif ans2>ans1:\r\n print(\"TEAM 2 WINS\")\r\nelse:\r\n print(\"TIE\")\r\n \r\n\r\n", "s1 = input()\r\ns2 = input()\r\nt1 = 0\r\nt2 = 0\r\n\r\nfor i in range(0,len(s1),2):\r\n if s1[i] == '[':\r\n if s2[i] == '(':\r\n t1+=1\r\n if s2[i] == '8':\r\n t2+=1\r\n if s1[i] == '(':\r\n if s2[i] == '[':\r\n t2+=1\r\n if s2[i] == '8':\r\n t1+=1\r\n if s1[i] == '8':\r\n if s2[i] == '(':\r\n t2+=1\r\n if s2[i] == '[':\r\n t1+=1\r\n \r\nif(t1 > t2):\r\n print(\"TEAM 1 WINS\")\r\nelif(t1 < t2):\r\n print(\"TEAM 2 WINS\")\r\nelse:\r\n print(\"TIE\")", "x1 = input()\r\nx2 = input()\r\ny1, y2 = 0, 0\r\nfor i in range(0, len(x1), 2):\r\n if x1[i] == x2[i]:\r\n continue\r\n if x1[i] == '[':\r\n if x2[i] == '(':\r\n y1 += 1\r\n if x2[i] == '8':\r\n y2 += 1\r\n if x1[i] == '(':\r\n if x2[i] == '[':\r\n y2 += 1\r\n if x2[i] == '8':\r\n y1 += 1\r\n if x1[i] == '8':\r\n if x2[i] == '[':\r\n y1 += 1\r\n if x2[i] == '(':\r\n y2 += 1\r\n \r\nif y1 > y2:\r\n print(\"TEAM 1 WINS\")\r\nelif y1 < y2:\r\n print(\"TEAM 2 WINS\")\r\nelse:\r\n print(\"TIE\")", "# LUOGU_RID: 101542042\nc = 0\r\ns = '8(['\r\nfor a, b in zip(input()[::2], input()[::2]):\r\n k = s.index(a)\r\n if b == s[k - 1]:\r\n c += 1\r\n elif b != s[k]:\r\n c -= 1\r\nprint(c and f'TEAM {1 if c > 0 else 2} WINS' or 'TIE')\r\n", "z, x = input(), input()\r\nzctr, xctr = 0, 0\r\nfor i in range(0, len(z), 2):\r\n if (z[i] == '(' and x[i] == '8') or (z[i] == '[' and x[i] == '(') or (z[i] == '8' and x[i] == '['):\r\n zctr += 1\r\n else:\r\n if z[i] != x[i]:\r\n xctr += 1\r\nprint('TIE' if zctr == xctr else 'TEAM ' + str(int(xctr > zctr) + 1) + ' WINS')", "a=input()\r\nb=input()\r\nans=chk=0\r\nfor i in range(1,len(a),2):\r\n o,t=a[i-1]+a[i],b[i-1]+b[i]\r\n if (o=='8<' and t=='[]') or (o=='[]' and t=='()') or (o=='()' and t=='8<'):\r\n ans+=1\r\n elif t!=o:\r\n chk+=1\r\nprint('TEAM 2 WINS' if chk>ans else 'TEAM 1 WINS' if ans>chk else 'TIE')", "import sys\r\n\r\nA = sys.stdin.readline().rstrip()\r\nB = sys.stdin.readline().rstrip()\r\n\r\ncnt = 0\r\nfor i in range(0, len(A), 2):\r\n if ((A[i] == '[' and B[i] == '(') or\r\n (A[i] == '8' and B[i] == '[') or\r\n (A[i] == '(' and B[i] == '8')): cnt += 1\r\n if ((B[i] == '[' and A[i] == '(') or\r\n (B[i] == '8' and A[i] == '[') or\r\n (B[i] == '(' and A[i] == '8')): cnt -= 1\r\n\r\nif cnt == 0: print('TIE')\r\nif cnt > 0: print('TEAM 1 WINS')\r\nif cnt < 0: print('TEAM 2 WINS')\r\n", "a = input()\nb = input()\n\nD = {\n ('8<', '8<') : 0,\n ('[]', '[]') : 0,\n ('()', '()') : 0,\n\n ('8<', '[]') : -1,\n ('()', '[]') : 1,\n ('[]', '8<') : 1,\n ('[]', '()') : -1,\n\n # Guess\n ('8<', '()') : 1,\n ('()', '8<') : -1,\n}\n\nr = 0\nfor i in range(0, len(a), 2):\n x = a[i:i+2]\n y = b[i:i+2]\n r += D[x,y]\n\nif r > 0:\n print('TEAM 2 WINS')\nelif r < 0:\n print('TEAM 1 WINS')\nelse:\n print('TIE')\n", "SCISSOR = '8<'\r\nPAPER = '[]'\r\nROCK = '()'\r\n\r\nteams = [input(), input()]\r\ncounts = [0,0]\r\n\r\nfor i in range(0,len(teams[0]),2):\r\n act1,act2 = [t[i:i+2] for t in teams]\r\n \r\n if act1==act2:\r\n continue\r\n if act1==SCISSOR and act2==PAPER:\r\n counts[0]+=1\r\n elif act1==PAPER and act2==ROCK:\r\n counts[0]+=1\r\n elif act1==ROCK and act2==SCISSOR:\r\n counts[0]+=1\r\n else:\r\n counts[1]+=1\r\nif counts[0]==counts[1]:\r\n print(\"TIE\")\r\nelse:\r\n winner = max([1,2], key = lambda x:counts[x-1])\r\n print(\"TEAM %d WINS\"%winner)\r\n ", "a = input()\r\nb = input()\r\n\r\nscore1 = 0\r\nscore2 = 0\r\nfor i in range(0, len(a), 2):\r\n if a[i] == '[' and b[i] == '(':\r\n score1 += 1\r\n if a[i] == '(' and b[i] == '8':\r\n score1 += 1\r\n if a[i] == '8' and b[i] == '[':\r\n score1 += 1\r\n \r\n if b[i] == '[' and a[i] == '(':\r\n score2 += 1\r\n if b[i] == '(' and a[i] == '8':\r\n score2 += 1\r\n if b[i] == '8' and a[i] == '[':\r\n score2 += 1\r\n\r\nif score1 == score2:\r\n print('TIE')\r\nelif score1 > score2:\r\n print('TEAM 1 WINS')\r\nelse:\r\n print('TEAM 2 WINS')" ]

[ "f = lambda: map(int, input().split())\r\na, b = f()\r\nc, d = f()\r\n\r\ng = lambda k: 0 if k % p else 1 + g(k // p)\r\nk = 0\r\n\r\nfor p in (3, 2):\r\n s = g(a) + g(b) - g(c) - g(d)\r\n q = p - 1\r\n\r\n for i in range(abs(s)):\r\n k += 1\r\n if s > 0:\r\n if g(a): a = a * q // p\r\n else: b = b * q // p\r\n else:\r\n if g(c): c = c * q // p\r\n else: d = d * q // p\r\n\r\nif a * b != c * d: print(-1) \r\nelse: print(k, a, b, c, d)" ]

[ "x,y,x0,y0 = map(int,input().split())\r\ng = [[0 for i in range(y+1)] for j in range(x+1)]\r\ns = input()\r\nresult = [0]*len(s)\r\nsum = x*y \r\nfor i in range(len(s)):\r\n if g[x0][y0] == 0:\r\n g[x0][y0] = 1\r\n result[i] = 1\r\n sum -= 1\r\n if s[i] == \"U\":\r\n if x0 > 1:\r\n x0,y0 = x0-1,y0\r\n elif s[i] == \"D\":\r\n if x0 <= x-1:\r\n x0,y0 = x0+1,y0\r\n elif s[i] == \"R\":\r\n if y0 <= y-1:\r\n x0,y0 = x0,y0+1\r\n else:\r\n if y0 > 1:\r\n x0,y0 = x0,y0-1\r\nresult.append(sum)\r\nprint(' '.join([str(i) for i in result]))\r\n", "\"\"\"\nCodeforces Round #335 (Div. 2)\nProblem 606 B. Testing Robots\n\n@author yamaton\n@date 2015-12-11\n\"\"\"\n\nimport itertools as it\nimport functools\nimport operator\nimport collections\nimport math\nimport sys\n\n\ndef solve(x, y, x0, y0, s):\n dir = {'L': (0, -1), 'R': (0, 1), 'U': (-1, 0), 'D': (1, 0)}\n seen = set()\n pos = (x0, y0)\n result = []\n\n for c in s:\n if pos in seen:\n result.append(0)\n else:\n result.append(1)\n seen.add(tuple(pos))\n dx, dy = dir[c]\n (nx, ny) = (pos[0] + dx, pos[1] + dy)\n pos0 = nx if 1 <= nx <= x else pos[0]\n pos1 = ny if 1 <= ny <= y else pos[1]\n pos = (pos0, pos1)\n # pp(pos)\n\n result.append(x * y - len(seen))\n return result\n\n\ndef pp(*args, **kwargs):\n return print(*args, file=sys.stderr, **kwargs)\n\n\ndef main():\n x, y, x0, y0 = map(int, input().split())\n s = input().strip()\n result = solve(x, y, x0, y0, s)\n print(*result)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nx,y,x0,y0 = map(int, input().split())\r\nS = input()\r\n\r\nans = [1]\r\nseen = set()\r\nseen.add((x0,y0))\r\nfor s in S:\r\n if s=='U':\r\n x0-=1\r\n elif s=='D':\r\n x0+=1\r\n elif s=='L':\r\n y0-=1\r\n else:\r\n y0+=1\r\n \r\n if x0<1:\r\n x0=1\r\n if x0>x:\r\n x0=x\r\n if y0<1:\r\n y0=1\r\n if y0>y:\r\n y0=y\r\n \r\n if (x0,y0) in seen:\r\n ans.append(0)\r\n else:\r\n ans.append(1)\r\n seen.add((x0,y0))\r\n\r\nt = sum(ans)\r\nans[-1]+=x*y-t\r\nprint(*ans)\r\n \r\n \r\n", "x, y, a, b = map(int, input().split())\r\n\r\ns = input()\r\n\r\nm = [[0] * y for i in range(x)]\r\n\r\nans = '1 '\r\nk = 1\r\nm[a - 1][b - 1] = 1\r\n\r\nfor i in range(len(s)):\r\n if s[i] == 'D':\r\n a = min (a + 1, x)\r\n m[a - 1][b - 1] += 1\r\n if m[a - 1][b - 1] == 1:\r\n k += 1\r\n ans += '1 '\r\n else:\r\n ans += '0 '\r\n\r\n elif s[i] == 'U':\r\n a = max (a - 1, 1)\r\n m[a - 1][b - 1] += 1\r\n if m[a - 1][b - 1] == 1:\r\n k += 1\r\n ans += '1 '\r\n else:\r\n ans += '0 '\r\n\r\n elif s[i] == 'R':\r\n b = min (b + 1, y)\r\n m[a - 1][b - 1] += 1\r\n if m[a - 1][b - 1] == 1:\r\n k += 1\r\n ans += '1 '\r\n else:\r\n ans += '0 '\r\n\r\n else:\r\n b = max (b - 1, 1)\r\n m[a - 1][b - 1] += 1\r\n if m[a - 1][b - 1] == 1:\r\n k += 1\r\n ans += '1 '\r\n else:\r\n ans += '0 '\r\n\r\n\r\nans = ans[:-1]\r\nk -= int(ans[-1])\r\nans = ans[:-1]\r\nans += str(x * y - k)\r\n\r\nprint(ans)\r\n \r\n \r\n", "x, y, x0, y0 = list(map(int, input().split()))\r\ns = input()\r\nx0 -= 1\r\ny0 -= 1\r\nk = [1]\r\nsumma = 1\r\na = [[0]*(y) for i in range(x)]\r\na[x0][y0] = 1\r\nfor i in s:\r\n if i == \"U\":\r\n x0 = max(x0-1, 0)\r\n elif i == \"D\":\r\n x0 = min(x0+1, x-1)\r\n elif i == \"R\":\r\n y0 = min(y0+1, y-1)\r\n else:\r\n y0 = max(y0-1, 0)\r\n if a[x0][y0]:\r\n k.append(0)\r\n else:\r\n a[x0][y0] = 1\r\n k.append(1)\r\n summa += 1\r\nk[-1] += x*y - summa\r\nprint(' '.join(str(i) for i in k))\r\n", "A, B, C, D = input().split()\na = int(A)\nb = int(B)\nc = int(C)\nd = int(D)\nlista = [[0 for i in range(555)] for j in range(555)]\nc -= 1\nd -= 1\nlista[c][d] = 1\ns = input()\nk = len(s)\nl = 1\nprint(\"1 \", end = \"\")\nfor i in range(k):\n\tif i + 1 == k:\n\t\tprint(a * b - l)\n\t\tbreak\n\tif s[i] == 'U':\n\t\tif c:\n\t\t\tc -= 1\n\telif s[i] == 'D':\n\t\tif c < a-1:\n\t\t\tc += 1\n\telif s[i] == 'R':\n\t\tif d < b - 1:\n\t\t\td += 1\n\telse:\n\t\tif d:\n\t\t\td -= 1\n\tif lista[c][d] == 0:\n\t\tprint(\"1 \", end = \"\")\n\t\tl += 1\n\telse:\n\t\tprint(\"0 \", end = \"\")\n\tlista[c][d] = 1\n\t\n", "rows, cols, r, c = map(int, input().split())\r\ns = input()\r\nr -= 1\r\nc -= 1\r\n\r\nfield = [[0] * cols for i in range(rows)]\r\nres = [0] * len(s)\r\n\r\nfield[r][c] = 1\r\ncnt = 1\r\n\r\nfor i in range (len(s)):\r\n if s[i] == 'U':\r\n if r > 0 : r -= 1\r\n elif s[i] == 'R':\r\n if c < cols - 1: c += 1\r\n elif s[i] == 'D':\r\n if r < rows - 1: r += 1\r\n elif s[i] == 'L':\r\n if c > 0: c -= 1\r\n \r\n if field[r][c] == 0:\r\n res[i] = 1\r\n cnt += 1\r\n field[r][c] = 1 \r\n\r\nres[len(s) - 1] += rows * cols - cnt\r\n\r\nprint (1, ' '.join(map(str, res)))", "def tests(mr, mc, r0, c0, path):\n seen = set()\n r, c = r0, c0\n for d in path:\n if (r, c) in seen:\n yield 0\n else:\n seen.add((r, c))\n yield 1\n\n if d == 'U':\n if r > 1:\n r -= 1\n elif d == 'D':\n if r < mr:\n r += 1\n elif d == 'L':\n if c > 1:\n c -= 1\n elif d == 'R':\n if c < mc:\n c += 1\n\n yield (mr*mc) - len(seen)\n\nif __name__ == '__main__':\n mr, mc, r0, c0 = map(int, input().split())\n path = input()\n print(' '.join(map(str, tests(mr, mc, r0, c0, path))))\n", "x, y, x0, y0 = map(int, input().split())\r\nmoves = input()\r\n\r\nseen = [[False] * y for i in range(x)]\r\ncurrX, currY = x0 - 1, y0 - 1\r\n\r\ntotal = 0\r\n\r\nfor i in range(len(moves)):\r\n #print(currX, currY)\r\n #print(\"Seen:\", seen[currX][currY])\r\n #print()\r\n if not seen[currX][currY]:\r\n print(\"1\", end=\" \")\r\n total += 1\r\n else:\r\n print(\"0\", end=\" \")\r\n seen[currX][currY] = True\r\n if moves[i] == \"L\":\r\n currY = max(currY - 1, 0)\r\n elif moves[i] == \"R\":\r\n currY = min(currY + 1, y - 1)\r\n elif moves[i] == \"U\":\r\n currX = max(currX - 1, 0)\r\n else:\r\n currX = min(currX + 1, x - 1)\r\nprint(x * y - total)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\nimport time\n\n# = input()\n# = int(input())\n\n#() = (i for i in input().split())\n# = [i for i in input().split()]\n\n(a, b, x, y) = (int(i) for i in input().split())\n\ns = input()\nans = [0 for i in range(len(s) + 1) ]\n\nstart = time.time()\n\nacc = 0\nx -= 1\ny -= 1\n\nmap = [[ 0 for i in range(b)] for j in range(a)]\n\nfor i in range(len(s)):\n if map[x][y] == 0:\n ans[i] += 1\n map[x][y] = 1\n if s[i] == 'L' and y > 0:\n y -= 1\n elif s[i] == 'R' and y < b-1:\n y += 1\n elif s[i] == 'D' and x < a-1:\n x += 1\n elif s[i] == 'U' and x > 0:\n x -= 1\n\n\nans[len(s)] = a*b - sum([sum(i) for i in map])\n\nfor i in ans:\n print(i, end= ' ')\nprint()\nfinish = time.time()\n#print(finish - start)\n", "M, N, x, y = input().split()\r\ns = input()\r\nM = int(M)\r\nN = int(N)\r\nx = int(x) - 1\r\ny = int(y) - 1\r\n\r\nans = [0 for i in range(len(s) + 10)]\r\nhas = [[0 for j in range(N)] for i in range(M)]\r\nhas[x][y] = 1\r\nc = 1\r\nans[0]=1\r\nfor i in range(len(s)-1):\r\n if s[i] == 'U' and x - 1 >= 0:\r\n x -= 1\r\n if s[i] == 'D' and x + 1 < M:\r\n x += 1\r\n if s[i] == 'L' and y - 1 >= 0:\r\n y -= 1\r\n if s[i] == 'R' and y + 1 < N:\r\n y += 1\r\n if(has[x][y] == 0):\r\n c += 1\r\n ans[i + 1] = has[x][y] = 1\r\nfor i in range(len(s)):\r\n print(ans[i],end=' ')\r\nprint(M * N - c)\r\n", "def main():\n h, w, y, x = map(int, input().split())\n yx = (h - y) * w + x - 1\n neigh = []\n for i in range(h):\n for j in range(w):\n neigh.extend((i * w + j + w if i < h - 1 else i * w + j,\n i * w + j - w if i else j,\n i * w + j - 1 if j else i * w,\n i * w + j + 1 if j < w - 1 else i * w + j))\n field = [True] * (w * h)\n field[yx] = False\n res = ['1']\n for c in input()[:-1]:\n yx = neigh[yx * 4 + ('U', 'D', 'L', 'R').index(c)]\n if field[yx]:\n res.append('1')\n field[yx] = False\n else:\n res.append('0')\n res.append(str(sum(field)))\n print(' '.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "def main():\n h, w, y, x = map(int, input().split())\n yx = (h - y) * w + x - 1\n neigh = []\n for i in range(h):\n for j in range(w):\n neigh.append({'U': i * w + j + w if i < h - 1 else i * w + j,\n 'D': i * w + j - w if i else j,\n 'L': i * w + j - 1 if j else i * w,\n 'R': i * w + j + 1 if j < w - 1 else i * w + j})\n field = [True] * (w * h)\n field[yx] = False\n res = ['1']\n for c in input()[:-1]:\n yx = neigh[yx][c]\n if field[yx]:\n res.append('1')\n field[yx] = False\n else:\n res.append('0')\n res.append(str(sum(field)))\n print(' '.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y, xo, yo = map(int, input().split())\r\ns = input()[:-1]\r\nq = [[1]*y for i in range(x)]\r\nd = [1]\r\nxo -= 1\r\nyo -= 1\r\nq[xo][yo] = 0\r\nfor i in range(len(s)):\r\n if s[i] == 'U':\r\n xo = max(xo-1, 0)\r\n elif s[i] == 'D':\r\n xo = min(xo+1, x-1)\r\n elif s[i] == 'L':\r\n yo = max(yo-1, 0)\r\n else:\r\n yo = min(yo+1, y-1)\r\n\r\n if i != len(s)-1:\r\n d.append(q[xo][yo])\r\n else:\r\n a = sum(sum(q[i]) for i in range(x))\r\n d.append(a)\r\n q[xo][yo] = 0\r\nprint(' '.join(map(str, d)))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y, cx, cy = map(int, input().split())\r\nS = input()[:-1]\r\ncx -= 1\r\ncy -= 1\r\ns = {1000*cx+cy}\r\nans = [0]*(len(S)+1)\r\nans[0] = 1\r\n\r\nfor i in range(len(S)-1):\r\n if S[i]=='L':\r\n cy = max(0, cy-1)\r\n elif S[i]=='R':\r\n cy = min(y-1, cy+1)\r\n elif S[i]=='U':\r\n cx = max(0, cx-1)\r\n else:\r\n cx = min(x-1, cx+1)\r\n \r\n if 1000*cx+cy not in s:\r\n ans[i+1] = 1\r\n s.add(1000*cx+cy)\r\n\r\nans[len(S)] = x*y-len(s)\r\n\r\nprint(*ans)", "x, y, x0, y0 = [int(x) for x in input().split()]\ns = input()\nwas_in = [[False for y1 in range(y+1)] for x1 in range(x + 1)]\nlength = 1\nmoves = {'D' : (1, 0), 'U' : (-1, 0), 'R' : (0, 1), 'L' : (0, -1)}\nstate = (x0, y0)\ncount = [1]\nwas_in[x0][y0] = True\nfor c in s:\n new_state = (state[0] + moves[c][0], state[1] + moves[c][1])\n new_state = new_state if 0 < new_state[0] <= x and 0 < new_state[1] <= y else state\n state = new_state\n if was_in[state[0]][state[1]]:\n count.append(0)\n else:\n count.append(1)\n was_in[state[0]][state[1]] = True\n length += 1\ncount[-1] += x * y - length\nfor i in count:\n print(i, end = ' ')\n", "x, y, x0, y0 = map(int, input().split())\na = [[0] * (y + 1) for i in range(x + 1)]\ns = input()\ncount = x * y\nresult = [0] * (len(s))\nfor i in range(len(s)):\n if a[x0][y0] == 0:\n a[x0][y0] = 1\n result[i] = 1\n count -= 1\n if s[i] == 'U' and x0 > 1:\n x0 -=1\n elif s[i] == 'D' and x0 < x:\n x0 +=1\n elif s[i] == 'L' and y0 > 1:\n y0 -= 1\n elif s[i] == 'R' and y0 < y:\n y0 += 1\n \nprint(\" \".join(map(str,result)), count)\n", "[r, c, x, y], s = map(int, input().split()), input()\r\nvis = [[False for i in range(c)] for j in range(r)]\r\nx, y = x - 1, y - 1\r\nvis[x][y] = True\r\nans = [1]\r\nfor ch in s:\r\n if ch == 'U':\r\n x = max(0, x - 1)\r\n elif ch == 'R':\r\n y = min(c - 1, y + 1)\r\n elif ch == 'D':\r\n x = min(r - 1, x + 1)\r\n else:\r\n y = max(0, y - 1)\r\n ans.append(int(not vis[x][y]))\r\n vis[x][y] = True\r\nfor i in range(r):\r\n for j in range(c):\r\n ans[-1] += int(not vis[i][j])\r\nprint(*ans)", "x, y, x0, y0 = map(int, input().split(' '))\ng = [[0]* (y+1) for i in range(x + 1)]\ns = input()\nresult = [0] * len(s)\ncount = x*y\nfor i in range(len(s)):\n\tif g[x0][y0] == 0:\n\t\tg[x0][y0] = 1\n\t\tresult[i] = 1\n\t\tcount -= 1\n\tif s[i] == 'U' and x0 > 1:\n\t\tx0 -=1\n\tif s[i] == 'D' and x0 < x:\n\t\tx0 += 1\n\tif s[i] == 'L' and y0 > 1:\n\t\ty0 -= 1\n\tif s[i] == 'R' and y0 < y:\n\t\ty0 += 1\nprint(' '.join(map(str, result)), count)\n", "mr, mc, R, C = map(int, input().split())\r\ns = input()\r\nvis = set()\r\nr, c, res = R, C, ''\r\nfor d in s:\r\n if (r, c) in vis:\r\n res += '0 '\r\n else:\r\n vis.add((r, c))\r\n res += '1 '\r\n if d == 'U':\r\n if r > 1: r -= 1\r\n elif d == 'D':\r\n if r < mr: r += 1\r\n elif d == 'L':\r\n if c > 1: c -= 1\r\n elif d == 'R':\r\n if c < mc: c += 1\r\nres += str(mr * mc - len(vis))\r\nprint(res)\r\n", "rs, cs, r, c = map(int, input().split())\r\ns = input()\r\nr -= 1\r\nc -= 1\r\n\r\nf = [[0] * cs for i in range(rs)]\r\nres = [0] * len(s)\r\ncnt = 0\r\n\r\nfor i in range (len(s)):\r\n if f[r][c] == 0:\r\n res[i] = 1\r\n cnt += 1\r\n f[r][c] = 1 \r\n\r\n if s[i] == 'U' and r > 0:\r\n r -= 1\r\n elif s[i] == 'R' and c < cs - 1:\r\n c += 1\r\n elif s[i] == 'D' and r < rs - 1:\r\n r += 1\r\n elif s[i] == 'L' and c > 0:\r\n c -= 1\r\n \r\nprint (' '.join(map(str, res)), rs * cs - cnt)", "x,y,x0,y0 = map(int,input().split())\r\ns = input()\r\n\r\nisVisited = []\r\nfor i in range(x):\r\n isVisited.append([])\r\n for j in range(y):\r\n isVisited[i].append(False)\r\ncnt = 1\r\nans = [\"1\"]\r\nisVisited[x0 - 1][y0 - 1] = True\r\nlocx = x0 - 1\r\nlocy = y0 - 1\r\nfor elem in s:\r\n if elem == \"U\":\r\n locx -= 1\r\n if locx < 0:\r\n locx = 0\r\n if elem == \"R\":\r\n locy += 1\r\n if locy >= y:\r\n locy = y - 1\r\n if elem == \"D\":\r\n locx += 1\r\n if locx >= x:\r\n locx = x - 1\r\n if elem == \"L\":\r\n locy -= 1\r\n if locy < 0:\r\n locy = 0\r\n if not isVisited[locx][locy]:\r\n isVisited[locx][locy] = True\r\n ans.append(\"1\")\r\n cnt += 1\r\n else:\r\n ans.append(\"0\")\r\nans[-1] = int(ans[-1])\r\nans[-1] += x * y - cnt\r\nans[-1] = str(ans[-1])\r\nprint(\" \".join(ans))\r\n \r\n", "x, y, x0, y0 = [int(x) for x in input().split()]\r\nx0 -= 1\r\ny0 -= 1\r\ncommands = input()\r\nxy = x * y\r\nl = len(commands)\r\na = [0] * (l + 1)\r\nn = 0\r\nfield = [[-1]*y for i in range(x)]\r\nfield[x0][y0] = 0\r\nfor i in range(l):\r\n\tcommand = commands[i];\r\n\tif command == 'U':\r\n\t\tif x0 > 0:\r\n\t\t\tx0 -= 1\r\n\telif command == 'D':\r\n\t\tif x0 + 1 < x:\r\n\t\t\tx0 += 1\r\n\telif command == 'L':\r\n\t\tif y0 > 0:\r\n\t\t\ty0 -= 1\r\n\telif command == 'R':\r\n\t\tif y0 + 1 < y:\r\n\t\t\ty0 += 1\r\n\tif field[x0][y0] < 0:\r\n\t\tfield[x0][y0] = i + 1\r\nfor i in range(x):\r\n\tfor j in range(y):\r\n\t\ta[field[i][j]] += 1\r\nprint(' '.join(str(x) for x in a))\r\n\r\n", "s = str(input()).split()\r\nx = int(s[0])\r\ny = int(s[1])\r\nx0 = int(s[2]) - 1\r\ny0 = int(s[3]) - 1\r\ns = str(input())\r\ng = [[0] * y for i in range(x)]\r\ncount = x * y\r\nres = [0] * (len(s) + 1)\r\nfor i in range(len(s)):\r\n if g[x0][y0] == 0:\r\n res[i] = 1\r\n g[x0][y0] = 1\r\n count -= 1\r\n if s[i] == 'U' and x0 > 0:\r\n x0 -= 1\r\n if s[i] == 'D' and x0 < x - 1:\r\n x0 += 1\r\n if s[i] == 'L' and y0 > 0:\r\n y0 -= 1\r\n if s[i] == 'R' and y0 < y - 1:\r\n y0 += 1\r\nres[-1] = count\r\nfor i in range(len(res)):\r\n print(res[i], end=' ')\r\n", "n, m, x, y = [int(x) for x in input().split(\" \")]\r\ncommands = input()\r\n\r\n#n, m, x, y = [3, 4, 2, 2]\r\n#commands = \"UURDRDRL\"\r\n\r\nx, y = x - 1, y - 1\r\n\r\nmove = dict([\r\n (\"U\", (-1, 0)),\r\n (\"D\", (1, 0)),\r\n (\"L\", (0, -1)),\r\n (\"R\", (0, 1))\r\n])\r\n\r\nplace = set()\r\nplace.add((x, y))\r\nprint(\"1\", end=\" \")\r\n\r\nfor command in commands[:-1]:\r\n oldX, oldY = x, y\r\n x, y = x + move[command][0], y + move[command][1]\r\n # print(\"x,y: \", x, y)\r\n if (x < 0 or y < 0) or (x >= n or y >= m):\r\n print(\"0\", end=\" \")\r\n x, y = oldX, oldY\r\n continue\r\n else:\r\n if (x, y) in place:\r\n print(0, end=\" \")\r\n else:\r\n print(\"1\", end=\" \")\r\n place.add((x, y))\r\n\r\nx, y = x + move[commands[-1]][0], y + move[commands[-1]][1]\r\n\r\n#print()\r\n#print(place)\r\n#print()\r\nif (x < 0 or y < 0) or (x >= n or y >= m):\r\n print(\"0\")\r\nelse:\r\n print(n * m - len(place))\r\n", "x, y, x0, y0 = list(map(int, input().split()))\r\ns = input()\r\nboard = [[0] * y for _ in range(x)]\r\nans = [0] * (len(s) + 1)\r\nans[0] = 1\r\nboard[x0 - 1][y0 - 1] = 1\r\nfor i in range(len(s)):\r\n ch = s[i]\r\n if ch == 'U' and x0 > 1:\r\n x0 -= 1\r\n if board[x0 - 1][y0 - 1] == 0:\r\n ans[i + 1] = 1\r\n board[x0 - 1][y0 - 1] = 1\r\n if ch == 'D' and x0 < x:\r\n x0 += 1\r\n if board[x0 - 1][y0 - 1] == 0:\r\n ans[i + 1] = 1\r\n board[x0 - 1][y0 - 1] = 1\r\n if ch == 'R' and y0 < y:\r\n y0 += 1\r\n if board[x0 - 1][y0 - 1] == 0:\r\n ans[i + 1] = 1\r\n board[x0 - 1][y0 - 1] = 1\r\n if ch == 'L' and y0 > 1:\r\n y0 -= 1\r\n if board[x0 - 1][y0 - 1] == 0:\r\n ans[i + 1] = 1\r\n board[x0 - 1][y0 - 1] = 1\r\n\r\ncnt0 = sum([row.count(0) for row in board])\r\nans[-1] += cnt0\r\nprint(*ans)\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 u * y + v\r\n\r\nx, y, x0, y0 = map(int, input().split())\r\nd = {\"D\":(1, 0), \"U\":(-1, 0), \"R\":(0, 1), \"L\":(0, -1)}\r\ns = list(input().rstrip().decode())\r\nvisit = [0] * (x * y)\r\ni, j = x0 - 1, y0 - 1\r\nans = []\r\nfor k in s:\r\n ans.append(visit[f(i, j)] ^ 1)\r\n visit[f(i, j)] = 1\r\n di, dj = d[k]\r\n ni, nj = i + di, j + dj\r\n if 0 <= ni < x and 0 <= nj < y:\r\n i, j = ni, nj\r\nans.append(x * y - sum(ans))\r\nsys.stdout.write(\" \".join(map(str, ans)))", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nx,y,x0,y0=RI()\ns=input()\ntotal=0\ndirs={'U':0, 'D':1, 'L':2, 'R':3}\nvisited=[[0 for i in range(y)] for j in range(x)]\nfor i in range(len(s)):\n if not visited[x0-1][y0-1]:\n print(1, end=\" \")\n visited[x0-1][y0-1]=1\n total+=1\n else:\n print(0,end=\" \")\n x0+= dX[dirs[s[i]]]\n y0+= dY[dirs[s[i]]]\n if x0<1:\n x0=1\n elif x0>x:\n x0=x\n if y0<1:\n y0=1\n elif y0>y:\n y0=y\nprint(x*y - total)\n", "import sys\r\n\r\ndx, dy = (-1, 0, 1, 0, 1, -1, 1, -1), (0, 1, 0, -1, 1, -1, -1, 1)\r\ndir = {'U': 0, 'L': 3, 'R': 1, 'D': 2}\r\nvalid = lambda x, y: 0 < x <= n and 0 < y <= m\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n\r\nn, m, x0, y0 = map(int, input().split())\r\ns, vis, ans = input(), [[False] * (m + 1) for _ in range(n + 1)], [1]\r\nvis[x0][y0] = True\r\n\r\nfor i in range(len(s)):\r\n nx, ny = x0 + dx[dir[s[i]]], y0 + dy[dir[s[i]]]\r\n if valid(nx, ny):\r\n x0, y0 = nx, ny\r\n ans.append(vis[x0][y0] ^ 1)\r\n vis[x0][y0] = True\r\n else:\r\n ans.append(0)\r\n\r\nans[-1] += sum([vis[i][j] ^ 1 for i in range(1, n + 1) for j in range(1, m + 1)])\r\nprint(*ans)\r\n", "X,Y,x,y = map(int,input().split())\ns = list(input())\n\ndir = {'U':(-1,0),'D':(1,0),'L':(0,-1),'R':(0,1)}\nfield = [[1]*Y for i in range(X)]\n\nx -= 1\ny -= 1\nfor c in s:\n print(field[x][y])\n field[x][y] = 0\n x += dir[c][0]\n y += dir[c][1]\n if x < 0:\n x = 0\n if x >= X:\n x = X-1\n if y < 0:\n y = 0\n if y >= Y:\n y = Y-1\n\nprint(sum(sum(field[i]) for i in range(X)))\n\n\t\t \t \t\t \t \t \t \t\t \t\t\t \t \t \t", "COLOR_RED = '\\033[1;31m'\r\nCOLOR_RESET = '\\033[1;m'\r\n\r\nm, n, x, y = map(int, input().split())\r\nS = input()\r\n\r\nvisited = set()\r\nvisited.add((x, y))\r\ncnt = 1\r\nprint('1 ', end='')\r\n\r\nfor e in S[0:len(S) - 1]: \r\n if e == 'U' and x > 1:\r\n x -= 1\r\n elif e == 'D' and x < m:\r\n x += 1\r\n elif e == 'R' and y < n:\r\n y += 1\r\n elif e == 'L' and y > 1:\r\n y -= 1\r\n\r\n if (x, y) not in visited:\r\n print('1 ', end='')\r\n cnt += 1\r\n else:\r\n print('0 ', end='')\r\n \r\n visited.add((x, y))\r\n\r\nprint(n * m - cnt)\r\n" ]

[ "s1 = input().lower()\r\ns2 = input().lower()\r\n\r\nif s1==s2:\r\n print(0)\r\nif s1<s2:\r\n print(-1)\r\nif s1>s2:\r\n print(1)\r\n", "a = input().lower()\r\nb = input().lower()\r\nabi = True\r\nfor i in range(len(a)):\r\n if a[i] > b[i]:\r\n print('1')\r\n abi = False\r\n break\r\n elif a[i] < b[i]:\r\n print('-1')\r\n abi = False\r\n break\r\nif abi:\r\n print('0')\r\n", "i = input\na = i().lower()\nb = i().lower()\nprint((a>b)-(a<b))", "import math\r\n\r\na=input()\r\nb=input()\r\n\r\n\r\na1=a.upper()\r\nb1=b.upper()\r\n\r\nif a1==b1:\r\n print(0)\r\nelif a1<b1:\r\n print(-1)\r\nelse:\r\n print(1)", "s1=input()\r\ns2=input()\r\nx=s1.lower()\r\ny=s2.lower()\r\nflag=0\r\nfor i in range(len(x)):\r\n if ord(x[i])>ord(y[i]):\r\n print(1)\r\n flag=1\r\n break\r\n if ord(x[i])<ord(y[i]):\r\n print(-1)\r\n flag=1\r\n break\r\nif flag==0:\r\n print(0)", "c=str(input())\r\nb=str(input())\r\nc=c.lower()\r\nb=b.lower() \r\nfor i in range(len(c)):\r\n h=0\r\n if c[i]>b[i]:\r\n h=1\r\n break\r\n if c[i]<b[i]:\r\n h=-1\r\n break\r\nprint(h)", "import sys\r\nimport bisect\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef yes():\r\n print(\"YES\")\r\n\r\n\r\ndef no():\r\n print(\"NO\")\r\n\r\n\r\na = input().rstrip().lower()\r\nb = input().rstrip().lower()\r\nif a == b:\r\n print(0)\r\nelif a > b:\r\n print(1)\r\nelse:\r\n print(-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 14 09:09:02 2023\r\n\r\n@author: 2300011413\r\n\"\"\"\r\n\r\n'''\r\n在Python中，你可以直接使用比较运算符（如<，>，==等）来按照字典顺序比较两个字符串。\r\n这是因为Python的字符串比较是基于ASCII值的\r\n'''\r\nstr_1=input().lower()\r\nstr_2=input().lower()\r\nif str_1<str_2:\r\n print(-1)\r\nelif str_1>str_2:\r\n print(1)\r\nelse:\r\n print(0)", "a = input().lower()\r\nb = input().lower()\r\nprint(-1) if a<b else (print(1) if a>b else print(0))", "a1 = input().lower()\r\na2 = input().lower()\r\n\r\nif a1 > a2:\r\n print(1) \r\nelif a1 < a2:\r\n print(-1)\r\nelse:\r\n print(0)", "a = str(input())\r\nb = str(input())\r\n\r\nif a.lower()>b.lower():\r\n print (1)\r\n\r\nelif a.lower()<b.lower():\r\n print (-1)\r\n\r\nelse:\r\n print (0)", "# November 6, 2023\r\n# Task's Link – https://codeforces.com/problemset/problem/112/A\r\n\r\nstr_1 = input().lower()\r\nstr_2 = input().lower()\r\n\r\nif str_1 < str_2:\r\n print(\"-1\")\r\nelif str_1 == str_2:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")\r\n", "l1=str.lower(input())\r\nl2=str.lower(input())\r\nif l1==l2:\r\n print(0)\r\nelif l1>l2:\r\n print(1)\r\nelse:\r\n print(-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 27 16:29:38 2023\r\n\r\n@author: 王天齐\r\n\"\"\"\r\n\r\na1=input().lower()\r\na2=input().lower()\r\nif a1 > a2:\r\n print('1')\r\nelif a1 == a2:\r\n print('0')\r\nelse:\r\n print('-1')", "def comp(a, b):\n return (a >= b) - (a <= b)\n\na = input()\nb = input()\n\na1 = a.lower()\nb1 = b.lower()\n\nprint(comp(a1, b1))\n", "# Input\r\nstring1 = input().lower() # Convert the first string to lowercase\r\nstring2 = input().lower() # Convert the second string to lowercase\r\n\r\n# Compare the strings\r\nif string1 < string2:\r\n print(\"-1\")\r\nelif string1 > string2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "s1=input()\r\ns2=input()\r\nch1=s1.upper()\r\nch2=s2.upper()\r\ni,s=0,0\r\nif ch1==ch2:\r\n print(0)\r\nwhile i<min(len(ch2),len(ch1)) and s==0:\r\n if ch1[i]<ch2[i]:\r\n s=1\r\n print(-1)\r\n elif ch1[i]>ch2[i]:\r\n s=1\r\n print(1)\r\n i+=1", "x=input()\r\ny=input()\r\nx=x.lower()\r\ny=y.lower()\r\nd=0\r\nfor i in range(len(x)):\r\n if (ord(x[i])>ord(y[i])):\r\n print(1)\r\n d=1\r\n break\r\n elif (ord(x[i])<ord(y[i])):\r\n print(-1)\r\n d=1\r\n break\r\n\r\nif(d!=1):\r\n print(0)", "a = input()\r\nb = input()\r\nflag = 0\r\nfor i in range(len(a)):\r\n\tif(a[i].lower() < b[i].lower()):\r\n\t\tprint(\"-1\")\r\n\t\tflag = 1\r\n\t\tbreak\r\n\telif(a[i].lower() > b[i].lower()):\r\n\t\tprint(\"1\")\r\n\t\tflag = 1\r\n\t\tbreak\r\nif(flag == 0):\r\n\tprint(\"0\")", "#2300011786 裘思远\r\na=input()\r\nb=input()\r\nformer=a.lower()\r\nlatter=b.lower()\r\nn=len(a)\r\nif former==latter:\r\n print(\"0\")\r\nelse:\r\n for i in range(n):\r\n if former[i]>latter[i]:\r\n print(\"1\")\r\n break\r\n elif former[i]<latter[i]:\r\n print(\"-1\")\r\n break", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 21 16:10:17 2023\r\n\r\n@author: 20311\r\n\"\"\"\r\n\r\nup=str(input())\r\ndown=str(input())\r\nup=up.lower()\r\ndown=down.lower()\r\nif up > down:\r\n print('1')\r\nelif up< down:\r\n print('-1')\r\nelse:\r\n print('0')", "str1=(input()).lower()\r\nstr2=(input()).lower()\r\ncheck=[str1,str2]\r\ncheck.sort()\r\nif check[0]==check[1]:\r\n print(0)\r\nelif check[0]==str1:\r\n print(-1)\r\nelse:\r\n print(1)", "s1=input()\r\ns2=input()\r\ns1=s1.lower()\r\ns2=s2.lower()\r\n#print(ord(s2[0]))\r\ns1=list(s1)\r\ns2=list(s2)\r\n#print(ord(s2[0]))\r\nf=0\r\nfor i in range(len(s1)):\r\n if s1[i]!=s2[i]:\r\n if ord(s1[i])<ord(s2[i]):\r\n f=-1\r\n break\r\n \r\n elif ord(s1[i])>ord(s2[i]):\r\n f=1\r\n break\r\n else:\r\n f=0\r\n break\r\nprint(f)", "#23n2200017708\nstr_1 = input().lower()\nstr_2 = input().lower()\n\nimport operator\nif operator.lt(str_1,str_2):\n print(-1)\nelif operator.eq(str_1,str_2):\n print(0)\nelse:\n print(1)", "def main():\n string1 = input().lower()\n string2 = input().lower()\n \n if string1 == string2:\n return 0\n elif string1 > string2:\n return 1\n else:\n return -1\n\n\nif __name__ == \"__main__\":\n print(main())", "string_1 = input().lower()\r\nstring_2 = input().lower()\r\n\r\nif string_1 == string_2 :\r\n print(0)\r\nelse :\r\n for i in range (len(string_1)) : \r\n if ord(string_1[i]) < ord(string_2[i]) :\r\n print(\"-1\")\r\n break \r\n if ord(string_1[i]) > ord(string_2[i]) :\r\n print(\"1\")\r\n break ", "a = str(input())\r\nb = str(input())\r\nif len(a) == len(b):\r\n if a.lower() > b.lower():\r\n print(1)\r\n elif a.lower() == b.lower():\r\n print(0)\r\n elif a.lower() < b.lower():\r\n print(-1)", "f=input()\ns=input()\nf=f.lower()\ns=s.lower()\nc=0\nif f>s:\n print(1)\nelif f<s:\n print(-1)\nelif f==s:\n print(0)", "a = input()\r\nb = input()\r\na = a.lower()\r\nb = b.lower()\r\nif a == b:\r\n print(0)\r\nelse:\r\n for i in range(len(a)):\r\n if a[i] > b[i]:\r\n print(1)\r\n break\r\n elif a[i] < b[i]:\r\n print(-1)\r\n break\r\n", "first_string = input(\"\")\r\nsecond_string = input(\"\")\r\n\r\nfirst_string = first_string.lower()\r\nsecond_string = second_string.lower()\r\n\r\nif first_string > second_string:\r\n print(1)\r\nelif first_string < second_string:\r\n print(-1)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n", "#2300012105 刘乐天，生命科学学院\r\na=input().lower()\r\nb=input().lower()\r\nif a==b:\r\n print(0)\r\nelif a>b:\r\n print(1)\r\nelse:\r\n print(-1)\r\n", "import sys\r\n\r\ndef solution():\r\n lines = [line.strip('\\n').lower() for line in sys.stdin]\r\n # ord used for ascii values of each char\r\n\r\n ans = '0'\r\n for x, y in zip(lines[0], lines[1]):\r\n if x!=y:\r\n if ord(x) > ord(y):\r\n ans = '1'\r\n else:\r\n ans = '-1'\r\n break\r\n\r\n print(ans)\r\n\r\nsolution()\r\n\r\n", "s1 = input()\r\ns2 = input()\r\nif s1.lower() < s2.lower():\r\n print(-1)\r\nif s2.lower() < s1.lower():\r\n print(1)\r\nif s1.lower() == s2.lower():\r\n print(0) ", "string1 = str(input())\r\nstring2 = str(input())\r\n\r\nif len(string1) in range(101):\r\n if string1.lower() == string2.lower():\r\n print('0')\r\n elif string1.lower() > string2.lower():\r\n print('1')\r\n else:\r\n print('-1')", "x = (input()).lower()\r\ny = (input()).lower()\r\n\r\nif x == y:\r\n print(0)\r\nelif x < y:\r\n print(-1)\r\nelse:\r\n print(1)\r\n\r\n", "# Read the two strings\nstr1 = input().lower() # Convert to lowercase\nstr2 = input().lower() # Convert to lowercase\n\n# Compare the two strings\nif str1 < str2:\n print(\"-1\")\nelif str1> str2:\n print(\"1\")\nelse:\n print(\"0\")#vii\n\t\t \t \t \t \t \t \t \t\t", "s1=input().lower()\r\ns2=input().lower()\r\nr=((s1>s2) - (s1<s2))\r\nprint(r)", "first_str = str(input())\r\nsecond_str = str(input())\r\n\r\nfirst_str = first_str.lower()\r\nsecond_str = second_str.lower()\r\n\r\nif first_str < second_str:\r\n print(-1)\r\nelif first_str == second_str:\r\n print(0)\r\nelse:\r\n print(1)", "# Read the two strings\nstr1 = input().lower()\nstr2 = input().lower()\n\n# Compare the strings and print the result\nif str1 < str2:\n print(-1)\nelif str1 > str2:\n print(1)\nelse:\n print(0)\n\n\t \t \t \t\t \t \t \t\t\t \t\t\t \t\t \t", "first_string = input().lower()\r\nsecond_string = input().lower()\r\n\r\nif first_string < second_string:\r\n print(-1)\r\nelif second_string < first_string:\r\n print(1)\r\nelse:\r\n print(0)", "s1, s2 = input().lower(), input().lower()\r\nfor i in range(len(s1)):\r\n if ord(s1[i]) < ord(s2[i]):\r\n print(-1)\r\n break \r\n elif ord(s1[i]) > ord(s2[i]):\r\n print(1)\r\n break\r\n elif ord(s1[i]) == ord(s2[i]) and i == len(s1) - 1:\r\n print(0)", "s = input().lower()\r\ns1 = input().lower()\r\nif s < s1:\r\n print(-1)\r\nelif s > s1:\r\n print(1)\r\nelse:\r\n print(0)", "s1 = input()\ns2 = input()\nt1 = 0\nt2 = 0\nprinted = False\nfor (a, b) in zip(s1, s2):\n if 'a' <= a <= 'z':\n t1 = ord(a)-ord('a')\n else:\n t1 = ord(a)-ord('A')\n if 'a' <= b <= 'z':\n t2 = ord(b)-ord('a')\n else:\n t2 = ord(b)-ord('A')\n if t1 > t2:\n print(1)\n printed = True\n break\n if t1 < t2:\n print(-1)\n printed = True\n break\nif not printed:\n print(0)\n", "#turns input into all lowercase to standardize ord values\r\nfirstStatement = input().lower()\r\nsecondStatement = input().lower()\r\n\r\n#prints the result based on the comparison between the two strings\r\nif firstStatement > secondStatement:\r\n print(1)\r\nif firstStatement < secondStatement:\r\n print(-1)\r\nif firstStatement == secondStatement:\r\n print(0)", "str1 = input().lower()\r\nstr2 = input().lower()\r\n\r\nif str1>str2:\r\n print(\"1\")\r\n \r\nelif str2>str1:\r\n print(\"-1\")\r\n \r\nelif str1 == str2:\r\n print(\"0\")", "s11=input().lower()\ns22=input().lower()\nif s11==s22:\n print(0)\nelif s11>s22:\n print(1)\nelse:\n print(-1)\n\t \t \t \t\t\t \t \t\t\t\t \t \t \t\t\t", "car=str(input())\r\ncar1=str(input())\r\nif car.upper() > car1.upper() : \r\n print('1')\r\nelif car.upper() == car1.upper() : \r\n print('0')\r\nelse : \r\n print('-1')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 12 20:04:24 2023\r\n\r\n@author: 2300011711 Yan Yujie\r\n\"\"\"\r\n\r\nin1=list(map(ord, input().upper()))\r\nin2=list(map(ord, input().upper()))\r\nif in1==in2:\r\n print(0)\r\nelif in1>in2:\r\n print(1)\r\nelif in1<in2:\r\n print(-1)", "a=input()\r\nb=input()\r\nx=a.lower()\r\ny=b.lower()\r\nif x>y:\r\n print(1)\r\nelif x<y:\r\n print(-1)\r\nelif x==y:\r\n print(0)\r\n\r\n", "f1 = input()\r\ns2 = input()\r\nif f1.upper() == s2.upper() : print('0')\r\nif f1.upper() < s2.upper() : print('-1')\r\nif f1.upper() > s2.upper() : print('1')", "from string import ascii_lowercase\r\n\r\nalphabet = list(ascii_lowercase)\r\n\r\nfirst = input().lower()\r\nsecond = input().lower()\r\nfor first_letter, second_letter in zip(first, second):\r\n if alphabet.index(first_letter) < alphabet.index(second_letter):\r\n print(-1)\r\n break\r\n elif alphabet.index(first_letter) > alphabet.index(second_letter):\r\n print(1)\r\n break\r\nelse:\r\n print(0)\r\n", "str1=input()\r\nstr2=input()\r\n\r\nn1=str1.lower()\r\nn2=str2.lower()\r\n\r\nif n1==n2:\r\n print(0)\r\nelif n1>n2:\r\n print(1)\r\nelse:\r\n print(-1)", "str1=input()\r\nstr2=input()\r\nstr1=str1.lower()\r\nstr2=str2.lower()\r\nif str1==str2:\r\n print(\"0\")\r\nelif str1>str2:\r\n print('1')\r\nelif str1<str2:\r\n print('-1')", "d1 = input().lower()\nd2 = input().lower()\n\nif d1 == d2:\n print(0)\nelif d1 < d2:\n print(-1)\nelse:\n print(1)\n \t \t\t \t\t \t\t \t \t \t \t \t \t\t \t\t", "bruh=input().lower()\r\nbruh1=input().lower()\r\nif bruh<bruh1:\r\n print('-1')\r\nelif bruh>bruh1:\r\n print('1')\r\nelse:\r\n print('0')", "x = input(\"\")\r\ny = input(\"\")\r\nx = x.lower()\r\ny = y.lower()\r\nif x < y :\r\n print(\"-1\")\r\nif x == y:\r\n print(\"0\")\r\n\r\nif x > y:\r\n print(\"1\")\r\n", "\ndef pet(string1,string2):\n if string1.lower() < string2.lower():\n print(\"-1\")\n elif string1.lower() > string2.lower():\n print(\"1\")\n else:\n print(\"0\")\n\n\nstring1 = input()\nstring2 = input()\n\npet(string1,string2)\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", "def compare(first, second):\r\n\tfirst1 = first.lower()\r\n\tsecond1 = second.lower()\r\n\tsize = len(first1)\r\n\tfor i in range(size):\r\n\t\tif first1[i] < second1[i]:\r\n\t\t\treturn \"-1\"\r\n\t\telif first1[i] > second1[i]:\r\n\t\t\treturn \"1\"\r\n\treturn \"0\"\r\n\r\nfirst = input()\r\nsecond = input()\r\n\r\nprint(compare(first, second))", "s1 = input()\r\ns2 = input()\r\nfor i in range(len(s1)):\r\n if s1[i].lower() < s2[i].lower():\r\n print(-1)\r\n quit()\r\n if s1[i].lower() > s2[i].lower():\r\n print(1)\r\n quit()\r\nprint(0)", "def compare():\r\n strings1 = input().lower()\r\n strings2 = input().lower()\r\n\r\n for i in range(len(strings1)):\r\n if strings1[i] < strings2[i]:\r\n return \"-1\"\r\n \r\n elif strings1[i] > strings2[i]:\r\n return \"1\"\r\n \r\n return \"0\"\r\n\r\nprint(compare())", "str1=input().lower()\r\nstr2=input().lower()\r\nif(str1<str2):\r\n print(\"-1\")\r\nelif(str1==str2):\r\n print(\"0\")\r\nelse:\r\n print(\"1\")", "# Read the two strings and convert them to lowercase\nstring1 = input().lower()\nstring2 = input().lower()\n\n# Compare the two strings lexicographically\nif string1 < string2:\n print(\"-1\")\nelif string1 > string2:\n print(\"1\")\nelse:\n print(\"0\")\n", "frst = []\r\nfrst_sum = 0\r\n\r\nscnd = []\r\nscnd_sum = 0\r\n\r\nfrst = list(input())\r\nscnd = list(input())\r\n\r\nout = 0\r\n\r\nfor i in range (0, len(frst)):\r\n frst[i] = frst[i].lower()\r\n #frst_sum += ord(frst[i])\r\n scnd[i] = scnd[i].lower()\r\n #scnd_sum += ord(scnd[i])\r\n if ord(frst[i]) < ord(scnd[i]):\r\n out = -1\r\n break\r\n elif ord(scnd[i]) < ord(frst[i]):\r\n out = 1\r\n break\r\n elif ord(frst[i]) == ord(scnd[i]):\r\n out = 0\r\n\r\nprint(out)\r\n", "s=input().lower()\r\nt=input().lower()\r\nif s==t:\r\n print(0)\r\nelse:\r\n print(-1 if s<t else 1)", "str_1 = input(\"\").lower()\r\nstr_2 = input(\"\").lower()\r\n\r\nlen_1 = 0\r\nlen_2 = 0\r\nflag = True\r\n\r\nfor i in range(0 , len(str_1)):\r\n len_1 += ord(str_1[i])\r\n len_2 += ord(str_2[i])\r\n\r\n if len_1 > len_2 :\r\n print(1)\r\n flag = False\r\n break\r\n elif len_1 < len_2 :\r\n print(-1)\r\n flag = False\r\n break\r\n\r\n \r\nif flag :\r\n print(0)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 21:53:19 2023\r\n\r\n@author: 刘婉婷 2300012258\r\n\"\"\"\r\n\r\nstring1=input().lower()#抹平大小写差异，\r\nstring2=input().lower()\r\nif string1>string2:\r\n print(1)\r\nelif string1==string2:\r\n print(0)\r\nif string1<string2:\r\n print(-1)\r\n \r\n ", "k=input().lower()\r\nd=input().lower()\r\nif k==d:\r\n print(\"0\")\r\nelif k<d:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "s1=input()\r\ns2=input()\r\ns1=s1.lower()\r\ns2=s2.lower()\r\nc=0\r\nif s1>s2:\r\n print(1)\r\nelif s1<s2:\r\n print(-1)\r\nelif s1==s2:\r\n print(0)", "a = input()\nb = input()\nans = 0\nfor i in range(len(a)):\n if a[i].lower() < b[i].lower():\n ans = -1\n break\n if a[i].lower() > b[i].lower():\n ans = 1\n break\nprint(ans)\n", "s_1 = input().lower()\r\ns_2 = input().lower()\r\nif s_1>s_2:\r\n print ('1')\r\nelif s_1==s_2:\r\n print ('0')\r\nelse:\r\n print ('-1')\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Aug 26 22:31:52 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\ncounter=0\r\nstring_1=input()\r\nstring_2=input()\r\nfor i in range(len(string_1)):\r\n if string_1.lower()<string_2.lower():\r\n print(\"-1\")\r\n break\r\n elif string_1.lower()>string_2.lower():\r\n print(\"1\")\r\n break\r\n else:\r\n counter+=1\r\nif counter==len(string_1):\r\n print(0)", "\r\ns = input().split()\r\nfor i in range(len(s)):\r\n s[i] = s[i].lower()\r\n\r\ns = \"\".join(s)\r\n\r\n\r\np = input().split()\r\nfor i in range(len(p)):\r\n p[i] = p[i].lower()\r\n\r\np = \"\".join(p)\r\n\r\nif s < p:\r\n print(-1)\r\nif p < s:\r\n print(1)\r\nif s == p:\r\n print(0)", "import sys\n\ninput = sys.stdin.readline\n\ns1 = str(input())\ns2 = str(input())\n\ns1 = s1[:-1].lower()\ns2 = s2[:-1].lower() # Eliminating the newline character\n\nn = len(s1)\n\nfor i in range(n):\n if s1[i] < s2[i]:\n sys.stdout.write(f\"-1 \\n\")\n exit()\n\n elif s1[i] > s2[i]:\n sys.stdout.write(f\"1 \\n\")\n exit()\n\nsys.stdout.write(f\"0 \\n\")\n", "x = input().lower()\r\ny = input().lower()\r\nif x > y:\r\n print(\"1\")\r\nelif y > x:\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")", "a = input()\r\nb = input()\r\na1 = a.lower()\r\nb1 = b.lower()\r\no = 0\r\nk = 0\r\nif a1>b1:\r\n\to+=1\r\nif b1>a1:\r\n\tk+=1\r\nprint(o-k)", "le = input().lower()\r\nli = input().lower()\r\nif le == li:\r\n print(0)\r\nelse:\r\n print([1, -1][le < li])\r\n", "r1=str(input())\r\nr2=str(input())\r\ns1=r1.lower()\r\ns2=r2.lower()\r\nif s1>s2:\r\n print('1')\r\nelif s1==s2:\r\n print('0')\r\nelse:\r\n print('-1')", "n1 = input().lower()\r\nn2 = input().lower()\r\nif n1 == n2:\r\n print(0)\r\nelif n1 < n2:\r\n print(-1)\r\nelse:\r\n print(1)", "a,b = input(),input()\nfound = False\nfor index,letter in enumerate(a):\n if letter.lower() < b[index].lower(): \n print(-1)\n found = True\n break\n elif letter.lower() > b[index].lower(): \n print(1)\n found = True\n break\nif not found: print(0)\n ", "str1 = str.lower(input(\"\"))\r\nstr2 = str.lower(input(\"\"))\r\nfor i, char in enumerate(str2):\r\n if str1[i] < str2[i]:\r\n print(\"-1\")\r\n break\r\n elif str2[i] < str1[i]:\r\n print(\"1\")\r\n break\r\n elif i == len(str1)-1 and str1[i] == str2[i]:\r\n print(\"0\")", "#-*- coding: utf-8 -*\n'''\nCreated on Sat Sep 23\nauthor 钱瑞 2300011480\n'''\na=str(input())\nb=str(input())\na=a.upper()\nb=b.upper()\nif a==b:\n print(0)\nelif a<b:\n print(-1)\nelse:\n print(1)", "s=input().lower();t=input().lower();print((s>t)-(s<t))", "def cmp(x, y):\r\n return (x>=y) - (y>=x)\r\n \r\na = input().lower()\r\nb = input().lower()\r\n\r\nprint(str(cmp(a, b)))", "word1 = str(input()).lower()\r\nword2 = str(input()).lower()\r\n\r\nif (word1 == word2): print(0)\r\nelif (word1 < word2): print(-1)\r\nelse: print(1)", "a=input()\r\nb=input()\r\na=a.lower()\r\nb=b.lower()\r\nif a>b:print(1)\r\nelif a<b:print(-1)\r\nelse:print(0)", "a=input().lower()\nb=input().lower()\nif a==b:\n print(0)\nelif a>b:\n print(1)\nelse:\n print(-1)\n\t\t\t\t \t \t\t \t\t\t \t\t \t\t \t \t\t \t\t\t", "\r\nstr1 =input()\r\nstr2 = input()\r\nstr1 = str1.lower()\r\nstr2 = str2.lower()\r\nif str1 == str2:\r\n print(0)\r\nelif str1 < str2:\r\n print(-1)\r\nelse:\r\n print(1)", "t=input().lower()\r\na=input().lower()\r\nif t<a:\r\n print(\"-1\")\r\nelif t>a:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "s1 = input().upper()\r\ns2 = input().upper()\r\n\r\nif s1 == s2:\r\n print(0)\r\nelif s1 < s2:\r\n print(-1)\r\nelse: print(1)\r\n", "first = input().lower()\r\nsecond = input().lower()\r\n\r\nif first == second:\r\n print(\"0\")\r\nelif first > second:\r\n print(\"1\")\r\nelse:\r\n print(\"-1\")\r\n", "def compare(l1 , l2):\r\n if l1[0] > l2[0]:\r\n return 1\r\n elif l1[0] < l2[0]:\r\n return -1\r\n elif l1[0] == l2[0]:\r\n if len(l1) == 1:\r\n return 0\r\n else:\r\n return compare(l1[1:], l2[1:])\r\n\r\n\r\nword1 = input().lower()\r\nword2 = input().lower()\r\n\r\nl1 = list(word1)\r\nl2 = list(word2)\r\n\r\nprint(compare(l1 , l2))\r\n", "s = input().lower()\r\nt = input().lower()\r\nfor i in range(len(s)):\r\n if s[i] < t[i]:\r\n print(-1)\r\n exit()\r\n elif s[i] > t[i]:\r\n print(1)\r\n exit()\r\nprint(0)", "a=input()\r\nb=input()\r\na,b=a.lower(),b.lower()\r\nc=0\r\nd=0\r\nfor i in range(0,len(a)):\r\n if a[i]==b[i]:\r\n continue\r\n elif a[i]<b[i]:\r\n c=c+1\r\n break\r\n else:\r\n d+=1\r\n break\r\nif c>0:\r\n print(-1)\r\nelif d>0:\r\n print(1)\r\nelse:\r\n print(0)", "# Input\r\nstr1 = input().lower() # Convert to lowercase for case-insensitive comparison\r\nstr2 = input().lower()\r\n\r\n# Compare the strings\r\nif str1 < str2:\r\n print(\"-1\")\r\nelif str1 > str2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "def compare_the_strings(str1, str2):\r\n str1_lower = str1.lower()\r\n str2_lower = str2.lower()\r\n\r\n if str1_lower < str2_lower:\r\n return -1\r\n elif str1_lower > str2_lower:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\ndef main():\r\n\r\n str1 = input().strip()\r\n str2 = input().strip()\r\n\r\n result = compare_the_strings(str1, str2)\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "input1= input().lower()\r\ninput2= input().lower()\r\nif input1 == input2:\r\n print(0)\r\nelif input1 < input2:\r\n print(-1)\r\nelif input1 > input2:\r\n print(1) ", "a,b=input().lower(),input().lower();print(int((a>b)-(a<b)))", "s = input().lower()\r\na = input().lower()\r\nfor i,e in zip(s,a):\r\n if ord(i) > ord(e):\r\n print(1)\r\n break\r\n elif ord(i) < ord(e):\r\n print(-1)\r\n break\r\nelse:\r\n print(0)\r\n\r\n", "# A. Petya and Strings\r\n\r\nstr1 = input().upper()\r\nstr2 = input().upper()\r\n\r\nresult = 0\r\n\r\nfor i in range(len(str1)):\r\n if str1[i]==str2[i]:\r\n result = 0\r\n elif str1[i] < str2[i]:\r\n result = -1\r\n break\r\n else:\r\n result = 1\r\n break\r\n\r\nprint(result)\r\n", "string1=input().lower()\r\nstring2=input().lower()\r\nif string1==string2:\r\n print(0)\r\nelse:\r\n for i in range(len(string1)):\r\n if string1[i]>string2[i]:\r\n print(1)\r\n break\r\n elif string1[i]<string2[i]:\r\n print(-1)\r\n break\r\n else:\r\n continue\r\n", "c=input()\r\nd=input()\r\na=c.lower()\r\nb=d.lower()\r\nflag=0\r\nfor i in range(len(a)):\r\n if a[i]>b[i]:\r\n flag=1\r\n break\r\n elif a[i]<b[i]:\r\n flag=-1\r\n break\r\nprint(flag)", "str1 = input()\r\nstr2 = input()\r\ntest1 = True\r\ntest2 = True\r\nfor i in range(len(str1)):\r\n if ord(str1[i].lower()) > ord(str2[i].lower()):\r\n test1 = False\r\n break\r\n elif ord(str1[i].lower()) < ord(str2[i].lower()):\r\n test2 = False\r\n break\r\n\r\nif not test1 :\r\n print(1)\r\nelif not test2 :\r\n print(-1)\r\nelse :\r\n print(0)", "str1 = input().lower() \r\nstr2 = input().lower() \r\nresult = ((str1>str2) - (str1<str2))\r\nprint(result)", "A = input()\r\nB = input()\r\nA = A.upper()\r\nB = B.upper()\r\nfor i in range(len(A)):\r\n if A[i] > B[i]:\r\n print(\"1\")\r\n break\r\n elif B[i] > A[i]:\r\n print(\"-1\")\r\n break\r\n if i == len(A)-1:\r\n print(\"0\")", "string1=input()\r\nstr2=input()\r\nstring1=string1.lower()\r\nstr2=str2.lower()\r\nif str2==string1:\r\n print(0)\r\nelif str2>string1:\r\n print(-1)\r\nelse:\r\n print(1)", "a = input().lower()\r\nb = input().lower()\r\n\r\nresult = 0\r\nfor k, i in enumerate(a):\r\n if ord(i) < ord(b[k]):\r\n result = -1\r\n break\r\n elif ord(i) > ord(b[k]):\r\n result = 1\r\n break\r\n\r\nprint(result)\r\n", "str1=input()\r\nstr2=input()\r\nstr1=str1.lower()\r\nstr2=str2.lower()\r\ny=0\r\nfor x in str1:\r\n if x>str2[y]:\r\n print(1)\r\n break\r\n elif x<str2[y]:\r\n print(-1)\r\n break\r\n else :\r\n y+=1\r\nif y==len(str1):\r\n print(0)", "a=input()\r\nb=input()\r\nr=a.lower()\r\ns=b.lower()\r\nif(r<s):\r\n print(\"-1\")\r\nelif(r>s):\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "n=input().lower()\r\nn1=input().lower()\r\nif n==n1:\r\n print(0)\r\nelif n>n1:\r\n print(1)\r\nelse:\r\n print(-1)", "n=input(\"\").lower()\r\nm=input(\"\").lower()\r\nf=0\r\nfor i in range(len(n)):\r\n if ord(n[i])>ord(m[i]):\r\n f=1\r\n break\r\n elif ord(n[i])<ord(m[i]):\r\n f=-1\r\n break\r\n else:\r\n f=0\r\nprint(f)", "st_1 = input().lower()\r\nst_2 = input().lower()\r\n\r\nif st_1 == st_2:\r\n print(\"0\")\r\n\r\nfor i in range(len(st_2)):\r\n if st_1[i] < st_2[i]:\r\n print(\"-1\")\r\n break\r\n elif st_2[i] < st_1[i]:\r\n print(\"1\")\r\n break\r\n", "#112a petya and strings\n#2300011863 化学与分子工程学院 张骏逸\n#全部换成小写就很简单，写的比较快\nstr1=input().lower();str2=input().lower()\nif str1>str2:print('1')\nif str1==str2:print('0')\nif str1<str2:print('-1')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 28 17:14:02 2023\r\n\r\n@author: 陈亚偲2300011106\r\n\"\"\"\r\n\r\nstring1=input().lower()\r\nstring2=input().lower()\r\ngroud=[string1,string2]\r\ngroud.sort()\r\nif string1==string2:\r\n print(0)\r\nelif groud[1]==string1:\r\n print(1)\r\nelse:\r\n print(-1)", "a=input()\r\nb=input()\r\na1=[]\r\nb1=[]\r\nfor i in range(len(a)):\r\n if ord(a[i])>=65 and ord(a[i])<=90:\r\n a1.append(chr(ord(a[i])+32))\r\n else:\r\n a1.append(a[i])\r\nfor i in range(len(b)):\r\n if ord(b[i])>=65 and ord(b[i])<=90:\r\n b1.append(chr(ord(b[i])+32))\r\n else:\r\n b1.append(b[i])\r\nimport sys\r\nfor i in range(len(a)):\r\n if ord(a1[i])-ord(b1[i])>0:\r\n print(1)\r\n sys.exit(0)\r\n if ord(a1[i])-ord(b1[i])<0:\r\n print(-1)\r\n sys.exit(0)\r\nprint(0)", "s1=input()\r\ns2=input()\r\nl1=s1.lower()\r\nl2=s2.lower()\r\nif(l1==l2):\r\n print(0)\r\nelif(l1<l2):\r\n print(-1)\r\nelse:\r\n print(1) ", "a=input().lower()\r\nb=input().lower()\r\nt=0\r\nfor i in range(len(a)):\r\n if ord(a[i])>ord(b[i]):\r\n t=1\r\n break\r\n elif ord(a[i])<ord(b[i]):\r\n t=-1\r\n break\r\nprint(t)", "def solve():\r\n s1 = input().lower()\r\n s2 = input().lower()\r\n cmp = 0\r\n\r\n for i in range(len(s1)):\r\n if s1[i] < s2[i]:\r\n cmp = -1\r\n break\r\n elif s1[i] > s2[i]:\r\n cmp = 1\r\n break\r\n\r\n print(cmp)\r\n\r\nsolve()", "s=input().lower()\r\nt=input().lower()\r\nfor i in range(0,len(s)):\r\n if(s==t):\r\n print(0)\r\n break\r\n elif(s<t):\r\n print(-1)\r\n break\r\n else:\r\n print(1)\r\n break\r\n ", "#\t112A - Petya and Strings\r\na=input().lower()\r\nb=input().lower()#two strings, lower\r\nfor i in range(len(a)):\r\n if a[i]<b[i]:\r\n print(\"-1\")\r\n break\r\n elif a[i]>b[i]:\r\n print(\"1\")\r\n break\r\nelse:\r\n print(\"0\")", "import sys\r\nword_list = []\r\noutput = 0\r\nfor line in sys.stdin:\r\n word_list.append(line.strip())\r\n\r\nif word_list[0].lower() > word_list[1].lower():\r\n output = 1\r\nelif word_list[0].lower() < word_list[1].lower():\r\n output = -1\r\nelse:\r\n output = 0\r\n\r\nprint(output)\r\n", "n1=input().lower()\r\nn2=input().lower()\r\n\r\nif n1 > n2:\r\n print(1)\r\nelif n1 < n2:\r\n print(-1)\r\nelif n1 == n2:\r\n print(0)", "a, b = input(), input()\n\n\na, b = a.lower(), b.lower()\n\nif a == b:\n\tprint(0)\nelif a > b:\n\tprint(1)\nelse:\n\tprint(-1)\n", "# 112/A\r\n\r\ndef compare_strings():\r\n a = input()\r\n b = input()\r\n\r\n i = 0\r\n while i < len(a):\r\n if a[i].lower() < b[i].lower():\r\n print(-1)\r\n return\r\n elif a[i].lower() > b[i].lower():\r\n print(1)\r\n return\r\n i += 1\r\n print(0)\r\n\r\ncompare_strings()", "line1 = input().lower()\r\nline2 = input().lower()\r\n\r\nif line1>line2:\r\n print(1)\r\nelif line2==line1:\r\n print(0)\r\nelse:\r\n print(-1)\r\n", "string1 = list(input().lower())\nstring2 = list(input().lower())\n\nlength = len(string1)\n\nfor i in range(0,length):\n if(string1[i]>string2[i]):\n print(\"1\")\n break\n if(string1[i]<string2[i]):\n print(\"-1\")\n break\n if(string1[i]==string2[i] and i==(length-1)):\n print(\"0\")\n break", "import string\r\n\r\ns = input()\r\na = s.upper()\r\ns = input()\r\nb = s.upper()\r\nn = len(a)\r\nres = 0\r\nfor i in range(n):\r\n if a[i] < b[i]:\r\n res = -1\r\n break\r\n elif a[i] > b[i]:\r\n res = 1\r\n break\r\nprint(res)\r\n\r\n\r\n\r\n", "# Петя и строки - 800\r\ns1, s2 = [input().lower() for _ in range(2)]\r\nprint('-1' if s1 < s2 else '1' if s2 < s1 else '0')\r\n", "zmb = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nm = input()\r\nn = input()\r\nm = m.upper()\r\nn = n.upper()\r\n\r\nfor i in range(len(m)):\r\n if m[i] != n[i]:\r\n if zmb.index(m[i]) < zmb.index(n[i]):\r\n print(\"-1\")\r\n else:\r\n print(\"1\")\r\n break\r\nelse:\r\n print(\"0\")", "'''\r\n党梓元 2300012107\r\n'''\r\na=input()\r\nb=input()\r\nc=[0]\r\nd=[0]\r\nr=0\r\nfor k in range(len(a)-1):\r\n c.append(0)\r\n d.append(0)\r\nfor i in range(len(a)):\r\n if a[i]==b[i]:\r\n continue\r\n else:\r\n if a[i]==\"a\" or a[i]==\"A\":\r\n c[i]=1\r\n elif a[i]==\"b\" or a[i]==\"B\":\r\n c[i]=2\r\n elif a[i]==\"c\" or a[i]==\"C\":\r\n c[i]=3\r\n elif a[i]==\"d\" or a[i]==\"D\":\r\n c[i]=4\r\n elif a[i]==\"e\" or a[i]==\"E\":\r\n c[i]=5\r\n elif a[i]==\"f\" or a[i]==\"F\":\r\n c[i]=6\r\n elif a[i]==\"g\" or a[i]==\"G\":\r\n c[i]=7\r\n elif a[i]==\"h\" or a[i]==\"H\":\r\n c[i]=8\r\n elif a[i]==\"i\" or a[i]==\"I\":\r\n c[i]=9\r\n elif a[i]==\"j\" or a[i]==\"J\":\r\n c[i]=10\r\n elif a[i]==\"k\" or a[i]==\"K\":\r\n c[i]=11\r\n elif a[i]==\"l\" or a[i]==\"L\":\r\n c[i]=12\r\n elif a[i]==\"m\" or a[i]==\"M\":\r\n c[i]=13\r\n elif a[i]==\"n\" or a[i]==\"N\":\r\n c[i]=14\r\n elif a[i]==\"o\" or a[i]==\"O\":\r\n c[i]=15\r\n elif a[i]==\"p\" or a[i]==\"P\": \r\n c[i]=16\r\n elif a[i]==\"q\" or a[i]==\"Q\":\r\n c[i]=17\r\n elif a[i]==\"r\" or a[i]==\"R\":\r\n c[i]=18\r\n elif a[i]==\"s\" or a[i]==\"S\":\r\n c[i]=19\r\n elif a[i]==\"t\" or a[i]==\"T\": \r\n c[i]=20\r\n elif a[i]==\"u\" or a[i]==\"U\":\r\n c[i]=21\r\n elif a[i]==\"v\" or a[i]==\"V\":\r\n c[i]=22\r\n elif a[i]==\"w\" or a[i]==\"W\":\r\n c[i]=23\r\n elif a[i]==\"x\" or a[i]==\"X\":\r\n c[i]=24\r\n elif a[i]==\"y\" or a[i]==\"Y\":\r\n c[i]=25\r\n elif a[i]==\"z\" or a[i]==\"Z\":\r\n c[i]=26\r\n if b[i]==\"a\" or b[i]==\"A\":\r\n d[i]=1\r\n elif b[i]==\"b\" or b[i]==\"B\":\r\n d[i]=2\r\n elif b[i]==\"c\" or b[i]==\"C\":\r\n d[i]=3\r\n elif b[i]==\"d\" or b[i]==\"D\":\r\n d[i]=4\r\n elif b[i]==\"e\" or b[i]==\"E\":\r\n d[i]=5\r\n elif b[i]==\"f\" or b[i]==\"F\":\r\n d[i]=6\r\n elif b[i]==\"g\" or b[i]==\"G\":\r\n d[i]=7\r\n elif b[i]==\"h\" or b[i]==\"H\":\r\n d[i]=8\r\n elif b[i]==\"i\" or b[i]==\"I\":\r\n d[i]=9\r\n elif b[i]==\"j\" or b[i]==\"J\":\r\n d[i]=10\r\n elif b[i]==\"k\" or b[i]==\"K\":\r\n d[i]=11\r\n elif b[i]==\"l\" or b[i]==\"L\":\r\n d[i]=12\r\n elif b[i]==\"m\" or b[i]==\"M\":\r\n d[i]=13\r\n elif b[i]==\"n\" or b[i]==\"N\":\r\n d[i]=14\r\n elif b[i]==\"o\" or b[i]==\"O\":\r\n d[i]=15\r\n elif b[i]==\"p\" or b[i]==\"P\": \r\n d[i]=16\r\n elif b[i]==\"q\" or b[i]==\"Q\":\r\n d[i]=17\r\n elif b[i]==\"r\" or b[i]==\"R\":\r\n d[i]=18\r\n elif b[i]==\"s\" or b[i]==\"S\":\r\n d[i]=19\r\n elif b[i]==\"t\" or b[i]==\"T\": \r\n d[i]=20\r\n elif b[i]==\"u\" or b[i]==\"U\":\r\n d[i]=21\r\n elif b[i]==\"v\" or b[i]==\"V\":\r\n d[i]=22\r\n elif b[i]==\"w\" or b[i]==\"W\":\r\n d[i]=23\r\n elif b[i]==\"x\" or b[i]==\"X\":\r\n d[i]=24\r\n elif b[i]==\"y\" or b[i]==\"Y\":\r\n d[i]=25\r\n elif b[i]==\"z\" or b[i]==\"Z\":\r\n d[i]=26\r\n if c[i]==d[i]:\r\n continue\r\n elif c[i]<d[i]:\r\n print(\"-1\")\r\n r=1\r\n break\r\n else:\r\n print(\"1\")\r\n r=1\r\n break\r\nif r!=1:\r\n print(\"0\")", "def strings(str1,str2):\r\n str1=str1.lower()\r\n str2=str2.lower()\r\n if str1<str2:\r\n return -1\r\n elif str1>str2:\r\n return 1\r\n else: \r\n return 0\r\nstr1=input()\r\nstr2=input()\r\nresult=strings(str1,str2)\r\nprint(result)", "s1=input()\r\ns2=input()\r\ns3=''\r\ns4=''\r\nfor i in s1:\r\n s3+=i.upper()\r\nfor i in s2:\r\n s4+=i.upper()\r\nif s3<s4:\r\n print(-1)\r\nelif s4<s3:\r\n print(1)\r\nelse:\r\n print(0)", "a=str(input())\r\nb=str(input())\r\nlen(a)==len(b)\r\nA=a.upper()\r\nB=b.upper()\r\nif A > B:\r\n print(1)\r\nelif A < B:\r\n print(-1)\r\nelse:\r\n print(0)", "s1 = input().lower()\r\ns2 = input().lower()\r\nf = 0\r\nfor i in range(len(s1)):\r\n if ord(s1[i]) > ord(s2[i]):\r\n f = 1\r\n break\r\n elif ord(s1[i]) < ord(s2[i]):\r\n f = -1\r\n break\r\nprint(f)\r\n", "stringA = input()\r\nstringB = input()\r\nstringA = stringA.lower()\r\nstringB = stringB.lower()\r\nif stringA > stringB:\r\n print(\"1\")\r\nelif stringA < stringB:\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")", "a = input()\r\nb = input()\r\nfor i in range(len(a)):\r\n if ord(a[i].lower()) > ord(b[i].lower()):\r\n print(1)\r\n break\r\n elif ord(a[i].lower()) < ord(b[i].lower()):\r\n print(-1)\r\n break\r\nelse:\r\n print(0)", "word1 = input().lower()\r\nword2 = input().lower()\r\nif word1 < word2:\r\n print(-1)\r\nelif word1 > word2:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "x = input().lower()\r\ny = input().lower()\r\nresult= 0\r\nfor xs, ys in zip(x, y):\r\n if xs == ys:\r\n continue \r\n elif xs < ys:\r\n result = -1\r\n break \r\n else:\r\n result = 1\r\n break \r\nprint(result)\r\n", "x=input().lower()\r\ns=input().lower()\r\n\r\nfor i in range (len(x)):\r\n if x[i]!=s[i]:\r\n if x[i]>s[i]:\r\n print(\"1\")\r\n break \r\n elif x[i]<s[i]:\r\n print(\"-1\")\r\n break\r\n break\r\nelse :\r\n print(\"0\")", "a = input().upper()\r\nb = input().upper()\r\nif a<b:\r\n print('-1')\r\nelif a>b: \r\n print('1')\r\nelse:\r\n print('0') \r\n", "s1=input().lower()\r\ns2=input().lower()\r\nprint((s1>s2)-(s1<s2))", "def cmp(x, y):\r\n return (x >= y) - (x <= y)\r\nx = input()\r\ny = input()\r\nx1 = x.lower()\r\ny1 = y.lower()\r\n\r\nprint(cmp(x1, y1))", "string_1 = input().lower()\r\nstring_2 = input().lower()\r\n\r\nif string_1 < string_2:\r\n print(\"-1\")\r\nelif string_2 < string_1:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "s1 = input()\r\ns2 = input()\r\na = s1.lower()\r\nb = s2.lower()\r\nif a < b:\r\n print(\"-1\")\r\nelif a == b:\r\n print(\"0\")\r\nelse:\r\n print(\"1\")", "word_1 = str(input())\r\nword_2 = str(input())\r\n\r\nnew_1 = word_1.lower()\r\nnew_2 = word_2.lower()\r\ncon = 0\r\nlastrng = len(new_1)\r\nalphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\nfor i in range(0, lastrng):\r\n if new_2[i] == new_1[i]:\r\n con = 0\r\n else:\r\n con = 1\r\n indexforsol = i\r\n break\r\n\r\nif con == 0:\r\n print(\"0\")\r\n\r\nelse:\r\n harf1 = new_1[indexforsol]\r\n harf2 = new_2[indexforsol]\r\n index1 = alphabet.find(harf1)\r\n index2 = alphabet.find(harf2)\r\n if index1 > index2:\r\n print(\"1\")\r\n\r\n else:\r\n print(\"-1\")\r\n", "st1=input().lower()\r\nst2=input().lower()\r\nif st1 > st2:\r\n print(\"1\")\r\nelif st1 < st2:\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")", "n=input()\r\nn1=input()\r\nn=n.lower()\r\nn1=n1.lower()\r\nc=0\r\nfor i in range(len(n)):\r\n if(n[i]>n1[i]):\r\n print(\"1\")\r\n break\r\n elif(n[i]<n1[i]):\r\n print(\"-1\")\r\n break\r\n c+=1\r\nif(c==len(n)):\r\n print(\"0\")", "s1 = input()\r\ns2 = input()\r\n\r\nif s1.lower() > s2.lower(): print(1)\r\nelif s1.lower() < s2.lower(): print(-1)\r\nelse: print(0)\r\n", "m = input()\r\nn = input()\r\n\r\nm = m.upper()\r\nn = n.upper()\r\n\r\nif m == n:\r\n print(\"0\")\r\nelif m < n:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "a=input()\r\nb=input()\r\nif a.upper()==b.upper():\r\n\tprint(\"0\")\r\nelif a.upper()<b.upper():\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(\"1\")", "\r\n\t\r\ndef main():\r\n\ts=input()\r\n\ts1=input()\r\n\tn=len(s)\r\n\ts=small(s,n)\r\n\ts1=small(s1,n)\r\n\tsum=0\r\n\tfor i in range(n):\r\n\t\tif(ord(s[i])>ord(s1[i])):\r\n\t\t\tsum = 1\r\n\t\t\tbreak\r\n\t\telif(ord(s[i])<ord(s1[i])):\r\n\t\t\tsum=-1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tcontinue\r\n\tprint(sum)\r\n\t\r\n\t\r\ndef big(s,n):\r\n\ts1=\"\"\r\n\tfor i in range(n):\r\n\t\tif(ord(s[i])>=97):\r\n\t\t\ts1=s1+chr(ord(s[i])-32)\r\n\t\telse:\r\n\t\t\ts1=s1+s[i]\r\n\treturn s1\r\n\t\r\ndef small(s,n):\r\n\ts1=\"\"\r\n\tfor i in range(n):\r\n\t\tif(ord(s[i])<97):\r\n\t\t\ts1=s1+chr(ord(s[i])+32)\r\n\t\telse:\r\n\t\t\ts1=s1+s[i]\r\n\treturn s1\r\n\t\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n\tmain()", "str1=input()\r\nstr2=input()\r\nif str1.lower()>str2.lower():\r\n print(1)\r\nelif str1.lower()==str2.lower():\r\n print(0)\r\nelse:\r\n print(-1)", "a = input()\r\nb = input()\r\n\r\na = a.lower()\r\nb = b.lower()\r\n\r\nc = 0\r\nif a>b:\r\n print(1)\r\nelif b>a:\r\n print(-1)\r\nelse:\r\n print(0)", "\r\n#7\r\na1=input().lower()\r\na2=input().lower()\r\nx=0\r\nfor i in range(len(a1)):\r\n if ord(a1[i])>ord(a2[i]):\r\n x=1\r\n break\r\n elif ord(a1[i])<ord(a2[i]):\r\n x=-1\r\n break\r\nprint(x)", "def compare_strings(string1, string2):\n string1 = string1.lower()\n string2 = string2.lower()\n\n if string1 < string2:\n return -1\n elif string1 > string2:\n return 1\n else:\n return 0\n\n# Read input strings\nstring1 = input().strip()\nstring2 = input().strip()\n\n# Compare strings and print the result\nprint(compare_strings(string1, string2))\n", "if __name__=='__main__':\r\n\tfrst_str = input().lower()\r\n\tscnd_str = input().lower()\r\n\tif frst_str < scnd_str:\r\n\t\tprint('-1')\r\n\telif frst_str > scnd_str:\r\n\t\tprint('1')\r\n\telse:\r\n\t\tprint('0')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 26 13:33:09 2023\r\n\r\n@author: ZHAO XUDI\r\n\"\"\"\r\n\r\na = str(input()).lower()\r\nb = str(input()).lower()\r\n\r\nif a==b:\r\n print(\"0\")\r\nelse:\r\n str_list = [a,b]\r\n sorted_list = sorted(str_list)\r\n if sorted_list == str_list:\r\n print(\"-1\")\r\n else:\r\n print(\"1\")", "a=input().lower();b=input().lower();print((a>b)-(a<b))", "s = input()\r\nt = input()\r\n\r\ns = s.lower()\r\nt = t.lower()\r\n\r\nif s < t:\r\n print('-1')\r\nelif s > t:\r\n print('1')\r\nelse:\r\n print('0')", "#任晓宇 2300015809\r\nnum1 = input().lower()\r\nnum2 = input().lower()\r\nlenth = len(num1)\r\n \r\nn=0\r\nwhile n<lenth:\r\n if num1[n]==num2[n]:\r\n x=0\r\n n+=1\r\n continue\r\n elif num1[n]>num2[n]:\r\n x=1\r\n break\r\n else:\r\n x=-1\r\n break\r\nprint(x)", "import string\r\nabc = list(string.ascii_lowercase)\r\nABC = list(string.ascii_uppercase)\r\nL = []\r\nL2 = []\r\nL3 = []\r\nword = list(str(input()))\r\nword2 = list(str(input()))\r\nfor j in range(0,len(word)):\r\n for i in range(0,len(abc)):\r\n if word[j] == abc[i] or word[j] == ABC[i]:\r\n for k in range(0,len(abc)):\r\n if word2[j] == abc[k] or word2[j] == ABC[k]:\r\n if i > k:\r\n L.append(1)\r\n elif i < k:\r\n L.append(-1)\r\n else:\r\n L2.append(0)\r\nif len(L2) == len(word):\r\n print(0)\r\nelse:\r\n print(L[0])", "a = input()\r\nb = input()\r\n\r\nx = a.lower()\r\ny = b.lower()\r\n\r\nlst = [x,y]\r\nlst1 = sorted(lst)\r\n\r\nif x == y:\r\n print(0)\r\nelse:\r\n if x == lst1[0] and y == lst1[1]:\r\n print(-1)\r\n elif x == lst1[1] and y == lst1[0]:\r\n print(1)\r\n ", "x=['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\nn=input()\r\nn=n.lower()\r\nm=input()\r\nm=m.lower()\r\ni=0\r\ncount1=0\r\nwhile i<len(n) and i<len(m):\r\n a=x.index(n[i])\r\n b=x.index(m[i])\r\n if a<b:\r\n print(\"-1\")\r\n count1=1\r\n break\r\n if b<a:\r\n print(\"1\")\r\n count1=1\r\n break\r\n i=i+1\r\nif count1==0:\r\n if len(n)>len(m):\r\n print(\"1\")\r\n elif len(n)<len(m):\r\n print(\"-1\") \r\n else:\r\n print(\"0\")", "lst=[]\r\nfor i in range(2):\r\n a=input().split()\r\n lst.append(a)\r\nstr1=str(lst[0])\r\nstr2=str(lst[1])\r\nif str1.casefold()==str2.casefold():\r\n print(0)\r\n\r\nelif str1.casefold()>str2.casefold():\r\n print(1)\r\n\r\nelif str1.casefold()<str2.casefold():\r\n print(-1)\r\n\r\n", "s1=input()\r\ns2=input()\r\ns3=s1.lower()\r\ns4=s2.lower()\r\nif len(s1) == len(s2):\r\n if s3 < s4:\r\n print('-1')\r\n elif s3 == s4:\r\n print('0')\r\n else:\r\n print(1)", "f=input()\r\ns=input()\r\nf=f.lower()\r\ns=s.lower()\r\nc=0\r\nif f>s:\r\n print(1)\r\nelif f<s:\r\n print(-1)\r\nelif f==s:\r\n print(0)", "s1 = input().lower()\r\ns2 = input().lower()\r\n\r\ndef compare(s1, s2):\r\n if s1 == s2:\r\n return 0\r\n else:\r\n for i in range(min(len(s1), len(s2))):\r\n if s1[i] > s2[i]:\r\n return 1\r\n elif s1[i] < s2[i]:\r\n return -1\r\n if len(s1) > len(s2):\r\n return 1\r\n else:\r\n return -1\r\n \r\nprint(compare(s1, s2))", "x = input()\r\ny = input()\r\n\r\nx = x.lower()\r\ny = y.lower()\r\n\r\nif x > y:\r\n print(1)\r\nelif x < y :\r\n print(-1)\r\nelse:\r\n print(0)\r\n\r\n\r\n ", "list1=input()\r\nlist2=input()\r\nalist1=list1.lower()\r\nalist2=list2.lower()\r\nif alist1>alist2:\r\n print(1)\r\nelif alist1==alist2:\r\n print(0)\r\nelse:\r\n print(-1)", "s1 = str(input())\r\ns2 = str(input())\r\n\r\ns1_minuscula = s1.lower()\r\ns1_lista = s1_minuscula.split()\r\ns2_minuscula = s2.lower()\r\ns2_lista = s2_minuscula.split()\r\n\r\nalfabeto_numeros = {\r\n 'a': 1,\r\n 'b': 2,\r\n 'c': 3,\r\n 'd': 4,\r\n 'e': 5,\r\n 'f': 6,\r\n 'g': 7,\r\n 'h': 8,\r\n 'i': 9,\r\n 'j': 10,\r\n 'k': 11,\r\n 'l': 12,\r\n 'm': 13,\r\n 'n': 14,\r\n 'o': 15,\r\n 'p': 16,\r\n 'q': 17,\r\n 'r': 18,\r\n 's': 19,\r\n 't': 20,\r\n 'u': 21,\r\n 'v': 22,\r\n 'w': 23,\r\n 'x': 24,\r\n 'y': 25,\r\n 'z': 26\r\n}\r\n\r\nfor i in range(len(s1_lista)):\r\n if s1_lista[i] > s2_lista[i]:\r\n print(1)\r\n elif s1_lista[i] < s2_lista[i]:\r\n print(-1)\r\n else:\r\n print(0)", "first=input().lower()\r\nsecond=input().lower()\r\n\r\norder=[first,second]\r\norder.sort()\r\n\r\nif order.index(first)==0:\r\n result=-1\r\nif order.index(first)==1:\r\n result=1\r\nif first==second:\r\n result=0\r\n\r\nprint(result)", "import string\nz=list(string.ascii_lowercase)\na=input()\nb=input()\nstringa=list(a)\nstringb=list(b)\ni=0\nsuma=0\nsumb=0\nwhile i<len(stringa):\n suma+=int(z.index(stringa[i].lower()))\n sumb+=int(z.index(stringb[i].lower()))\n i+=1\n if suma==sumb and i==len(stringa):\n print('0')\n break\n elif suma==sumb and i<=len(stringa):\n continue\n elif suma>sumb:\n print('1')\n break\n else:\n print('-1')\n break\n\n", "s1=str(input())\r\ns2=str(input())\r\ns1=s1.capitalize()\r\ns2=s2.capitalize()\r\n\r\nif s1==s2:\r\n print(0)\r\nelif s1<s2:\r\n print(-1)\r\nelse:\r\n print(1)", "a=input().lower()\nb=input().lower()\n\nflag=0\nfor i in range(len(a)):\n if(a[i]>b[i]):\n flag=1\n print(\"1\")\n break\n elif(a[i]<b[i]):\n flag=1\n print(\"-1\")\n break\nif(flag==0):\n print(\"0\")\n\t \t\t\t \t\t \t\t\t \t \t\t \t\t \t \t\t \t", "# Read the two input strings\r\n\nstring1 = input().lower()\r\n\nstring2 = input().lower()\r\n\r\n\n\n# Compare the strings lexicographically\n\r\nif string1 < string2:\n \r\n print(\"-1\")\r\nelif string1>string2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "str1 = input()\r\nstr2 = input()\r\n\r\nstr1 = str1.lower()\r\nstr2 = str2.lower()\r\n\r\nif str1 == str2:\r\n print(\"0\")\r\nelif str1 < str2:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "inA=input().lower()\r\ninB=input().lower()\r\nif(inA>inB): print(\"1\")\r\nelif(inA<inB): print(\"-1\")\r\nelse: print(\"0\")", "s = input().upper()\r\nx = input().upper()\r\nif s == x:\r\n print(0)\r\nelif s < x:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "a = str(input()).upper()\r\nb = str(input()).upper()\r\n\r\n\r\nif a > b:\r\n print('1')\r\nelif a < b:\r\n print('-1')\r\nelse:\r\n print('0')", "import sys\r\npr = []\r\nfor line in sys.stdin:\r\n for word in line.split():\r\n pr.append(word.upper())\r\nif pr[0] < pr[1]:\r\n print('-1')\r\nelif pr[0] > pr[1]:\r\n print('1')\r\nelse:\r\n print('0')", "a=input()\r\nb=input()\r\nl=a.upper()\r\nm=b.upper()\r\nk=0\r\nn=0\r\nfor i in l:\r\n k+=ord(i)\r\nfor i in m:\r\n k+=ord(i)\r\nif l<m:\r\n print(-1)\r\nelif l>m:\r\n print(1)\r\nelse:\r\n print(0)", "s1=input()\r\ns2=input()\r\ns1=s1.lower()\r\ns2=s2.lower()\r\na=0\r\nb=0\r\nfor i in range(len(s1)):\r\n if s1[i]<s2[i]:\r\n a=-1\r\n break\r\n elif s1[i]>s2[i]:\r\n a=1\r\n break\r\n elif s1[i]==s2[i]:\r\n b+=1\r\n else:\r\n continue\r\nif b!=len(s1):\r\n print(a)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n", "def check():\n a=input()\n b=input()\n a=a.lower()\n b=b.lower()\n if a==b:\n print(0)\n j=0\n length=len(a)\n for j in range(length):\n if a[j]<b[j]:\n print(-1)\n return\n elif a[j]>b[j]:\n print(1)\n return\ncheck()\n\n", "from sys import stdin\r\n#\r\ndef main():\r\n l1 = stdin.readline().strip().lower()\r\n l2 = stdin.readline().strip().lower()\r\n if l1 == l2:\r\n print(0)\r\n elif l1 > l2:\r\n print(1)\r\n else:\r\n print(-1)\r\nmain()", "from sys import stdin\r\ndef main():\r\n p1 = stdin.readline().strip()\r\n p2 = stdin.readline().strip()\r\n dif = 0\r\n i = 0\r\n while dif == 0 and i < len(p1):\r\n if p1[i].lower() < p2[i].lower():\r\n print(-1)\r\n dif += 1\r\n elif p1[i].lower() > p2[i].lower():\r\n print(1)\r\n dif += 1\r\n i += 1\r\n if dif == 0:\r\n print(0)\r\nmain()\r\n", "s=input()\r\ns1=input()\r\nif s.lower()>s1.lower():\r\n print(1)\r\nelif s.lower()<s1.lower():\r\n print(-1)\r\nelse:\r\n print(0)", "a = input()\nb=input()\na=a.lower()\nb=b.lower()\nif a<b:\n print(\"-1\")\nelif a==b:\n print(\"0\")\nelse:\n print(\"1\")\n\t\t \t \t \t\t\t \t \t \t\t\t", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Sep 28 15:22:52 2023\n\n@author: huangxiaoyuan\n\"\"\"\n\na=input()\nb=input()\nlist=['a','b','c','d','e','f','g','h','i','j','k',\n 'l','m','n','o','p','q','r','s','t','u','v',\n 'w','x','y','z']\na=a.lower()\nb=b.lower()\nlist1=[]\nfor i in a:\n list1.append(list.index(i))\nlist2=[]\nfor j in b:\n list2.append(list.index(j))#这样把字母转换为数字，便于比较\nif list1==list2:\n print(0)\nelse:\n m=0\n while m<len(a):\n if list1[m]==list2[m]:\n m=m+1\n else:\n if list1[m]<list2[m]:\n print(-1)\n else:\n print(1)\n break\n m=m+1", "str1=input().lower()\r\nstr2=input().lower()\r\nfor i in range(len(str1)):\r\n if str1[i]<str2[i]:\r\n print(-1);break\r\n elif str1[i]>str2[i]:\r\n print(1);break\r\nelse:\r\n print(0)\r\n", "x=input()\ny=input()\nx=x.lower()\ny=y.lower()\nc=0\nif x>y:\n print(1)\nelif x<y:\n print(-1)\nelif x==y:\n print(0)\n\t \t\t\t \t \t \t\t \t \t \t \t \t", "s1 = input().lower()\r\n\r\ns2 = input().lower()\r\n\r\nres = 0\r\n\r\nif s1 < s2:\r\n res = -1\r\nelif s1 > s2:\r\n res = 1\r\n\r\nprint(res)\r\n", "string_1 = str(input())\r\nstring_2 = str(input())\r\nstring_1_lowcase = string_1.lower()\r\nstring_2_lowcase = string_2.lower()\r\nif string_1_lowcase==string_2_lowcase:\r\n print(0)\r\nelif string_1_lowcase<string_2_lowcase:\r\n print(-1)\r\nelse:\r\n print(1)", "s=input().lower()\r\nt=input().lower()\r\nif s<t:\r\n print(-1)\r\nelif s>t:\r\n print(1)\r\nelse:\r\n print(0)", "fa, sa = [], []\r\ntotal = 0\r\nfor x in input().lower():\r\n fa.append(ord(x))\r\nfor y in input().lower():\r\n sa.append(ord(y))\r\nfor x in range(len(fa)):\r\n if fa[x] == sa[x]:\r\n total = 0\r\n elif fa[x] < sa[x]:\r\n total = -1\r\n break\r\n else:\r\n total = 1\r\n break\r\nprint(total)", "s=input()\r\np=input()\r\ns1=s.lower()\r\np1=p.lower()\r\nif s1<p1:\r\n print(-1)\r\nelif s1>p1:\r\n print(1)\r\nelse:\r\n print(0)", "#徐子韵 2200015467 经济学院\r\nsting1=input().lower()\r\nsting2=input().lower()\r\nif sting1<sting2:\r\n print(-1)\r\nelif sting1>sting2:\r\n print(1)\r\nelse:\r\n print(0)\r\n", "a,b=input(),input();a,b=a.lower(),b.lower();print(int((a>b)-(a<b)))", "a=input().lower()\nb=input().lower()\nif a>b:\n print(\"1\")\nelif a==b:\n print(\"0\")\nelse:\n print(\"-1\")\n \n\n", "s1 = input(\"\")\ns2 = input(\"\")\ns1 = s1.lower()\ns2 = s2.lower()\nif s1 < s2:\n print(-1)\nelif s1 > s2:\n print(1)\nelse:\n print(0)", "a = input(\" \")\r\nb = input(\" \")\r\ns = a.upper()\r\nr = b.upper()\r\n\r\nk = len(s)\r\ni = 0\r\n\r\nwhile i < k:\r\n if s[i] > r[i]:\r\n print(\"1\")\r\n break\r\n elif s[i] < r[i]:\r\n print(\"-1\")\r\n break\r\n elif s[i] == r[i]:\r\n i += 1\r\n\r\nif i == k:\r\n print(\"0\")", "f = input().lower()\ns = input().lower()\n\nif f < s:\n print(-1)\nelif f > s:\n print(1)\nelse:\n print(0)\n", "s1=input().lower()\r\ns2= input().lower()\r\nif s1<s2:\r\n print(\"-1\")\r\nelif s2<s1:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "a = input()\r\nb = input()\r\na = a.lower()\r\nb = b.lower()\r\n\r\nc = 0\r\nfor i in range(len(a)):\r\n if(a[i]>b[i]):\r\n c = 1\r\n break\r\n elif(a[i]<b[i]):\r\n c = -1\r\n break\r\nprint(c) ", "s1 = input().lower()\r\ns2 = input().lower()\r\n\r\nfor i in range(len(s1)):\r\n if s1[i] < s2[i]:\r\n print(\"-1\")\r\n break\r\n elif s1[i] > s2[i]:\r\n print(\"1\")\r\n break\r\nelse:\r\n print(\"0\")", "a=input()\r\nb=input()\r\na1=[]\r\nb1=[]\r\nfor i in range(len(a)):\r\n if ord(a[i])>=65 and ord(a[i])<=90:\r\n a1.append(chr(ord(a[i])+32))\r\n else:\r\n a1.append(a[i])\r\nfor i in range(len(b)):\r\n if ord(b[i])>=65 and ord(b[i])<=90:\r\n b1.append(chr(ord(b[i])+32))\r\n else:\r\n b1.append(b[i])\r\nsame=True\r\nfor i in range(len(a)):\r\n if ord(a1[i])-ord(b1[i])>0:\r\n print(1)\r\n same=False\r\n break\r\n if ord(a1[i])-ord(b1[i])<0:\r\n print(-1)\r\n same=False\r\n break\r\nif same==True:\r\n print(0)", "s1 = input().lower()\r\ns2 = input().lower()\r\n\r\nfor i in range(max(len(s1), len(s2))):\r\n if s1[i] != s2[i]:\r\n if ord(s1[i]) < ord(s2[i]):\r\n print(-1)\r\n break\r\n else:\r\n print(1)\r\n break\r\n else:\r\n if i+1 == min(len(s1), len(s2)):\r\n print(0)\r\n break\r\n else:\r\n continue", "s=input().upper()\ns1=input().upper()\nif s==s1:\n print(0)\nelif s<s1:\n print(-1)\nelse:\n print(1)", "str1 = str(input())\r\nstr2 = str(input())\r\nif str1.lower() > str2.lower():\r\n print('1')\r\nelif str1.lower() == str2.lower():\r\n print('0')\r\nelif str1.lower() < str2.lower():\r\n print('-1')", "s=input().lower()\r\nss=input().lower()\r\nprint((s>ss)-(s<ss))", "s1 = input()\ns2 = input()\ns1, s2 = s1.lower(), s2.lower()\n\nfor i in range(len(s1)): \n if (ord(s1[i]) - ord('a')) > (ord(s2[i]) - ord('a')): \n print(\"1\")\n exit()\n elif (ord(s1[i]) - ord('a')) < (ord(s2[i]) - ord('a')): \n print(\"-1\")\n exit() \nprint(\"0\")\n\n\n", "string1 = input().lower()\r\nstring2 = input().lower()\r\n\r\nfor i,j in zip(string1,string2):\r\n io = ord(i)\r\n jo = ord(j)\r\n\r\n if io < jo:\r\n print (-1)\r\n break\r\n \r\n elif io > jo:\r\n print (1)\r\n break\r\n\r\nelse:\r\n print (0)\r\n\r\n", "v=input()\r\nu=input()\r\nv=v.lower()\r\nu=u.lower()\r\ncnt=0\r\nif v>u:\r\n print(1)\r\nelif v<u:\r\n print(-1)\r\nelif v==u:\r\n print(0)", "s = input()\r\ns2 = input()\r\ns = s.lower()\r\ns2 =s2.lower()\r\nif s > s2:\r\n print(1)\r\nelif s < s2:\r\n print(-1)\r\nelif s == s2:\r\n print(0)\r\n\r\n", "string1=input()\r\nstring2=input()\r\n\r\ni=0\r\nwhile ord(string1.lower()[i])==ord(string2.lower()[i]):\r\n if i==len(string1)-1:\r\n break\r\n else:\r\n i+=1\r\nif ord(string1.lower()[i])>ord(string2.lower()[i]):\r\n print(1)\r\nelif ord(string1.lower()[i])<ord(string2.lower()[i]):\r\n print(-1)\r\nelse:\r\n print(0)", "s=list(input().lower())\r\nss=list(input().lower())\r\nfor i in range(len(s)):\r\n if s[i]<ss[i]:\r\n print(\"-1\")\r\n break\r\n elif s[i]>ss[i]:\r\n print(\"1\")\r\n break\r\nelse:print(\"0\") ", "str1 = input()\nstr2 = input()\nstr1 = str1.lower()\nstr2 = str2.lower()\nif str1 > str2 :\n print(1)\nelif str2 > str1 :\n print(-1)\nelse :\n print(0)\n \t\t\t \t\t \t \t \t\t \t\t\t\t", "str1 = input().casefold()\r\nstr2 = input().casefold()\r\nif (str1 == str2):\r\n print(0)\r\nelif (str1 > str2):\r\n print(1)\r\nelse:\r\n print(-1)", "s = input()\r\ns2 = input()\r\n\r\ns2 =s2.lower()\r\ns= s.lower()\r\n\r\nif(s<s2):\r\n print(-1)\r\n\r\nelif s>s2:\r\n print(1)\r\n \r\nelse:\r\n print(0)", "def solve():\r\n a = input().lower()\r\n b = input().lower()\r\n if a == b:\r\n return 0\r\n elif a < b:\r\n return -1\r\n \r\n return 1\r\n \r\nprint(solve())", "str1 = input()\r\nstr2 = input()\r\n\r\nfor i in range(len(str1)):\r\n if str1[i].lower() > str2[i].lower():\r\n print(1)\r\n break\r\n elif str1[i].lower() < str2[i].lower():\r\n print(-1)\r\n break\r\nelse:\r\n print(0)", "#2300012142 林烨\r\na=input().lower()\r\nb=input().lower()\r\nn=0\r\nfor i in range(len(a)):\r\n if a==b:\r\n print('0')\r\n break\r\n elif a[i]>b[i]:\r\n n+=1\r\n print('1')\r\n break\r\n elif a[i]<b[i]:\r\n n-=1\r\n print('-1')\r\n break", "def solve(a, b):\n\n if a < b:\n return -1\n\n elif a > b:\n return 1\n\n else:\n return 0\n\n\ndef main():\n\n a = input().lower()\n b = input().lower()\n return solve(a, b)\n\n\nprint(main())\n", "x = input()\r\ny = input()\r\n\r\nif x.lower() == y.lower():\r\n print(0)\r\nelif x.lower() < y.lower():\r\n print(-1)\r\nelse:\r\n print(1)", "s1=input()\r\na=s1.lower()\r\n\r\ns2=input()\r\nb=s2.lower()\r\n\r\nos1=0\r\nos2=0\r\nif a==b:\r\n print(0)\r\nif a<b:\r\n print('-1')\r\nif a>b:\r\n print(1)\r\n\r\n\r\n", "str1 = input()\r\nstr2 = input()\r\nls1 = []\r\nls2 = []\r\nx = 0\r\nfor i in str1.lower():\r\n ls1.append(i)\r\nfor j in str2.lower():\r\n ls2.append(j)\r\nfor k in range(len(ls1)):\r\n if ls1[k]>ls2[k]:\r\n print(1)\r\n break\r\n elif ls1[k]==ls2[k]:\r\n x=x+1\r\n else:\r\n print(-1)\r\n break\r\nif x == len(ls1):\r\n print(0)\r\nelse:\r\n pass", "def is_larger(a, b):\r\n if a.lower() > b.lower():\r\n return 1\r\n elif a.lower() < b.lower():\r\n return -1\r\n else:\r\n return 0\r\nprint(is_larger(input(), input()))", "s1 = input()\r\ns2 = input()\r\n\r\nif s1.upper() > s2.upper():\r\n print(1)\r\nelif s1.upper() < s2.upper():\r\n print(-1)\r\nelse:\r\n print(0)", "a = str(input())\r\nb = str(input())\r\na = a.lower()\r\nb = b.lower()\r\ng = [a,b]\r\ng.sort()\r\nif(a==b): print(0)\r\nelif(g[0]==a): print(-1)\r\nelse: print(1)", "s=str(input())\r\nt=str(input())\r\nl=len(s)\r\nf=1\r\nfor i in range(l):\r\n #a=ord((s[i]))-32\r\n if ord(s[i])>=65 and ord(s[i])<=90:\r\n a=ord(s[i])+32\r\n else:\r\n a = ord(s[i])\r\n #print(a,end='')\r\n if ord(t[i])>=65 and ord(t[i])<=90:\r\n b=ord(t[i])+32\r\n #print(b,end='')\r\n else:\r\n b=ord(t[i])\r\n if a<b:\r\n print(-1)\r\n f=0\r\n exit()\r\n if a>b:\r\n print(1)\r\n f=0\r\n exit()\r\nif f==1:\r\n print(0)\r\n", "first = input().lower()\r\nsecond = input().lower()\r\nresult = 0\r\nfor i in range(len(first)):\r\n if first[i] == second[i]:\r\n continue\r\n elif first[i] > second[i]:\r\n result = 1\r\n break\r\n else:\r\n result = -1\r\n break\r\nprint(result)", "# Input two strings\r\nstring1 = input().lower() # Convert to lowercase to ignore case\r\nstring2 = input().lower()\r\n\r\n# Compare the strings lexicographically\r\nif string1 < string2:\r\n print(\"-1\")\r\nelif string1 > string2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "s = input().lower()\r\na = input().lower()\r\nif s > a:\r\n print(1)\r\nelif s<a:\r\n print(-1)\r\nelse :\r\n print(0)\r\n\r\n", "def compare(s1, s2):\n \n if s1 < s2:\n return -1\n elif s1 > s2:\n return 1\n else:\n return 0\n\ns1 = input().strip().lower()\ns2 = input().strip().lower()\n\nx = (compare(s1, s2))\nprint(x)\n\t \t\t \t \t \t \t\t \t\t \t\t \t", "# Read the two strings\nstring1 = input()\nstring2 = input()\n\n# Convert both strings to lowercase (or uppercase)\nstring1 = string1.lower()\nstring2 = string2.lower()\n\n# Compare the two modified strings lexicographically\nif string1 < string2:\n print(\"-1\") # String 1 is lexicographically smaller\nelif string1 > string2:\n print(\"1\") # String 2 is lexicographically smaller\nelse:\n print(\"0\") # Both strings are lexicographically equal\n\n\t\t \t \t\t \t\t \t \t \t\t \t\t\t \t", "x = input(\"\").lower()\r\ny = input(\"\").lower()\r\nc = 0\r\nfor i in range(0,len(x)):\r\n if(ord(x[i])>ord(y[i])):\r\n c = 1\r\n print(\"1\")\r\n break\r\n elif(ord(x[i])<ord(y[i])):\r\n c = 1\r\n print(\"-1\")\r\n break\r\n\r\nif c==0:\r\n print(\"0\")", "a = input().lower()\r\nb = input().lower()\r\nlijst = []\r\nlijst.append(a)\r\nlijst.append(b)\r\nif max(lijst) > a:\r\n print(-1)\r\nif max(lijst) > b:\r\n print(1)\r\nif a == b:\r\n print(0)", "a = input() \r\nb = input() \r\n\r\nfor i in range(0,len(a)):\r\n num1 = ord(a[i]) \r\n num2 = ord(b[i]) \r\n \r\n if(num1>=65 and num1<=90):\r\n num1 = num1 - 65 \r\n else:\r\n num1 = num1 - 97 \r\n \r\n if(num2>=97 and num2<=122):\r\n num2 = num2 - 97 \r\n else:\r\n num2 = num2 - 65 \r\n \r\n \r\n if(num1 == num2):\r\n if(i==len(a)-1):\r\n print(0)\r\n continue\r\n elif(num1 > num2):\r\n print(1) \r\n break;\r\n else:\r\n print(-1) \r\n break;\r\n", "n=str(input())\r\nm=str(input())\r\nn1=n.lower()\r\nm1=m.lower()\r\nif m1==n1:\r\n print(0)\r\nelif n1>m1:\r\n print(1)\r\nelse:\r\n print(-1)", "def compare(s1, s2):\r\n if s1 == s2:\r\n return 0\r\n elif s1 < s2:\r\n return -1\r\n else:\r\n return 1\r\n\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nprint(compare(s1.lower(), s2.lower()))", "a=input().lower()\r\nb=input().lower()\r\nif a < b:\r\n print(-1)\r\nelif a > b:\r\n print(1)\r\nelse:\r\n print(0)", "st=input()\r\nst2=input()\r\nls=[]\r\nst=st.lower()\r\nst2=st2.lower()\r\nls.append(st)\r\nls.append(st2)\r\n\r\nls.sort()\r\nif(st==st2):\r\n print(0)\r\nelif(ls.index(st)>ls.index(st2)):\r\n print(1) \r\nelif(ls.index(st)<ls.index(st2)):\r\n print(-1)", "#array = [x for x in range(100)]\r\n#print(list(map(lambda i:i**2,array)))\r\nn = str(input())\r\nm = str(input())\r\n\r\ndef row(n,m):\r\n if n.lower() > m.lower():\r\n return 1\r\n elif n.lower() == m.lower():\r\n return 0\r\n elif n.lower() < m.lower():\r\n return -1\r\nprint(row(n,m))\r\n#aaaA\r\n", "#学号：2300012285\r\na=input().lower()\r\nb=input().lower()\r\nif a<b:\r\n print(-1)\r\nelif a==b:\r\n print(0)\r\nelse:\r\n print(1)", "seq=[input().upper() for i in range(2)]\r\nif seq[0]==seq[1]:\r\n print(0)\r\nelif sorted(seq)==seq:\r\n print(-1)\r\nelse:\r\n print(1)", "a = input()\r\nb = input()\r\na = a.lower()\r\nb = b.lower()\r\nif(a < b):\r\n print(-1)\r\nif(a == b):\r\n print(0)\r\nif(a > b):\r\n print(1)", "def c (a,b):\r\n return (a>=b) - (a<=b)\r\n\r\nx=input().upper()\r\ny=input().upper()\r\n\r\nprint(c(x,y))", "a=input().lower()\r\nb=input().lower()\r\nc=[]\r\nd=[]\r\nfor n in range(0,len(a)):\r\n c.append(a[n])\r\n d.append(b[n])\r\nif c==d:\r\n print('0')\r\nelse:\r\n for n in range(0,len(a)):\r\n if c[n]==d[n]:\r\n continue\r\n elif ord(c[n])>ord(d[n]):\r\n print('1')\r\n break\r\n elif ord(c[n])<ord(d[n]):\r\n print('-1')\r\n break\r\n#作者：彭雅婷 学号：2300013257\r\n#2023.9.30\r\n", "\r\ndef findFirst(x, y):\r\n lista = 'abcdefghijklmnopqrstuvwxyz'\r\n if lista.find(x) > lista.find(y):\r\n return 1\r\n else: \r\n return -1\r\n\r\ndef foo(a, b):\r\n for x, y in zip(a, b):\r\n if x != y:\r\n return findFirst(x, y)\r\n return 0\r\n\r\na = input().lower()\r\nb = input().lower()\r\n\r\nprint(foo(a, b))\r\n\r\n\r\n", "string1 = input().split()\r\nfor i in range(len(string1)):\r\n string1[i] = string1[i].lower()\r\nstring2 = input().split()\r\nfor i in range(len(string2)):\r\n string2[i] = string2[i].lower()\r\n\r\nstring1 = \"\".join([i for i in string1])\r\nstring2 = \"\".join([i for i in string2])\r\n\r\nif string1 != string2:\r\n if max(string1, string2) == string1:\r\n print(1)\r\n else:\r\n print(-1)\r\nelse:\r\n print(0)", "#罗誉城 2300011776\r\nn1=input()\r\nn2=input()\r\nn3=n1.lower()\r\nn4=n2.lower()\r\nif n3<n4:\r\n print(-1)\r\nelif n3>n4:\r\n print(1)\r\nelse:\r\n print(0)", "first = input().lower()\nsecond = input().lower()\n\nif first == second:\n print(\"0\")\nelif first > second:\n print(\"1\")\nelse:\n print(\"-1\")\n\n \t \t \t\t \t\t\t \t\t\t \t \t \t\t\t \t\t", "s=input().lower()\r\ns1=input().lower()\r\nif s>s1:\r\n print(1)\r\nelif s<s1:\r\n print(-1)\r\nelse:\r\n print(0)", "# Read the input\nt1 = input().lower()\ns2 = input().lower()\n\n\n# Compare the strings and print the result\nif t1 < s2:\n print(\"-1\")\nelif t1 > s2:\n print(\"1\")\nelse:\n print(\"0\")\n\n\t\t \t \t\t\t\t\t \t\t \t \t \t\t\t \t\t", "s1 = input().lower()\r\ns2 = input().lower()\r\nif s1 == s2:\r\n print(0)\r\nelse:\r\n print(-1 if s1 < s2 else 1)", "s3=input().lower()\ns4=input().lower()\nif s3==s4:\n print(0)\nelif s3>s4:\n print(1)\nelse:\n print(-1)\n \t \t\t\t\t \t\t \t \t \t \t\t\t\t\t\t\t", "a=input()\r\nb=input()\r\ns1=a.lower()\r\ns2=b.lower()\r\nfor i in range(len(s1)):\r\n if(s1[i]>s2[i]):\r\n print(1)\r\n break\r\n elif(s1[i]<s2[i]):\r\n print(-1)\r\n break\r\nif(s1==s2):\r\n print(0)", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\ndef solve():\r\n s = input().lower()\r\n t = input().lower()\r\n\r\n if s<t:\r\n print(-1)\r\n elif s==t:\r\n print(0)\r\n else:\r\n print(1)\r\n \r\n\r\nif __name__ == '__main__':\r\n solve()", "first=input().lower()\nsecond=input().lower()\nif first>second:\n print(1)\nelif first<second:\n print(-1)\nelse:\n print(0)\n\t\t\t \t \t \t \t\t \t \t \t \t \t\t \t", "a=input()\nb=input()\na=a.lower()\nb=b.lower()\nif a>b:\n print(1)\nelif a<b:\n print(-1)\nelif a==b:\n print(0)\n", "def cmp(a,b):\r\n return (a>=b) - (a<=b)\r\nx=str(input())\r\ny=str(input())\r\nX=(x.lower())\r\nY=(y.lower())\r\nprint(cmp(X,Y))", "# Read the two strings from input\r\nstring1 = input().lower()\r\nstring2 = input().lower()\r\n\r\n# Compare the strings lexicographically\r\nif string1 < string2:\r\n print(-1)\r\nelif string1 > string2:\r\n print(1)\r\nelse:\r\n print(0)\r\n\r\n\r\n\r\n \r\n", "word1 = input()\r\nword2 = input()\r\n\r\nword1 = word1.lower()\r\nword2 = word2.lower()\r\n\r\n# print(word2, word1)\r\n\r\nif word1 < word2:\r\n print(-1)\r\nelif word2 < word1:\r\n print(1)\r\nelse:\r\n print(0)", "\r\ns1 = str(input())\r\ns2 = str(input())\r\n\r\nif s1.casefold() == s2.casefold():\r\n print(0)\r\nelif s1.casefold() < s2.casefold():\r\n print(-1)\r\nelif s1.casefold() > s2.casefold():\r\n print(1)", "# SHASHI KUMARI 3CSE-08 20221CSE0459 \r\n# ANSWER OF SECOND QUESTION\r\nfirst_str = input().lower()\r\nsecond_str = input().lower()\r\n\r\n\r\nif first_str < second_str:\r\n print(\"-1\")\r\nelif first_str > second_str:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "a = input()\r\nb = input()\r\nc = \"\"\r\nd = \"\"\r\nfor i in range(len(a)):\r\n if(a[i] == \"a\"):\r\n c += \"A\"\r\n elif(a[i] == \"b\"):\r\n c += \"B\"\r\n elif(a[i] == \"c\"):\r\n c += \"C\"\r\n elif (a[i] == \"d\"):\r\n c += \"D\"\r\n elif(a[i] == \"e\"):\r\n c += \"E\"\r\n elif (a[i] == \"f\"):\r\n c += \"F\"\r\n elif (a[i] == \"g\"):\r\n c += \"G\"\r\n elif (a[i] == \"h\"):\r\n c += \"H\"\r\n elif(a[i] == \"i\"):\r\n c += \"I\"\r\n elif (a[i] == \"j\"):\r\n c += \"J\"\r\n elif (a[i] == \"k\"):\r\n c += \"K\"\r\n elif (a[i] == \"l\"):\r\n c += \"L\"\r\n elif (a[i] == \"m\"):\r\n c += \"M\"\r\n elif (a[i] == \"n\"):\r\n c += \"N\"\r\n elif(a[i] == \"o\"):\r\n c += \"O\"\r\n elif (a[i] == \"p\"):\r\n c += \"P\"\r\n elif (a[i] == \"q\"):\r\n c += \"Q\"\r\n elif (a[i] == \"r\"):\r\n c += \"R\"\r\n elif (a[i] == \"s\"):\r\n c += \"S\"\r\n elif (a[i] == \"t\"):\r\n c += \"T\"\r\n elif(a[i] == \"u\"):\r\n c += \"U\"\r\n elif (a[i] == \"v\"):\r\n c += \"V\"\r\n elif (a[i] == \"w\"):\r\n c += \"W\"\r\n elif (a[i] == \"x\"):\r\n c += \"X\"\r\n elif(a[i] == \"y\"):\r\n c += \"Y\"\r\n elif (a[i] == \"z\"):\r\n c += \"Z\"\r\n else:\r\n c += a[i]\r\nfor i in range(len(b)):\r\n if (b[i] == \"a\"):\r\n d += \"A\"\r\n elif (b[i] == \"b\"):\r\n d += \"B\"\r\n elif(b[i] == \"c\"):\r\n d += \"C\"\r\n elif (b[i] == \"d\"):\r\n d += \"D\"\r\n elif (b[i] == \"e\"):\r\n d += \"E\"\r\n elif (b[i] == \"f\"):\r\n d += \"F\"\r\n elif (b[i] == \"g\"):\r\n d += \"G\"\r\n elif (b[i] == \"h\"):\r\n d += \"H\"\r\n elif (b[i] == \"i\"):\r\n d += \"I\"\r\n elif (b[i] == \"j\"):\r\n d += \"J\"\r\n elif (b[i] == \"k\"):\r\n d += \"K\"\r\n elif (b[i] == \"l\"):\r\n d += \"L\"\r\n elif (b[i] == \"m\"):\r\n d += \"M\"\r\n elif (b[i] == \"n\"):\r\n d += \"N\"\r\n elif (b[i] == \"o\"):\r\n d += \"O\"\r\n elif (b[i] == \"p\"):\r\n d += \"P\"\r\n elif (b[i] == \"q\"):\r\n d += \"Q\"\r\n elif (b[i] == \"r\"):\r\n d += \"R\"\r\n elif (b[i] == \"s\"):\r\n d += \"S\"\r\n elif (b[i] == \"t\"):\r\n d += \"T\"\r\n elif (b[i] == \"u\"):\r\n d += \"U\"\r\n elif (b[i] == \"v\"):\r\n d += \"V\"\r\n elif (b[i] == \"w\"):\r\n d += \"W\"\r\n elif (b[i] == \"x\"):\r\n d += \"X\"\r\n elif (b[i] == \"y\"):\r\n d += \"Y\"\r\n elif (b[i] == \"z\"):\r\n d += \"Z\"\r\n else:\r\n d += b[i]\r\nif(c == d):\r\n print(0)\r\nelif(c > d):\r\n print(1)\r\nelse:\r\n print(-1)", "a = input().lower()\r\nb = input().lower()\r\n \r\nfor i in range(len(a)):\r\n if a[i] < b[i]:\r\n print(-1)\r\n break\r\n elif a[i] > b[i]:\r\n print(1)\r\n break\r\nelse:\r\n print(0)", "# Little Petya loves presents. His mum bought him two strings of the same size for his birthday. The strings consist of uppercase and lowercase Latin letters. Now Petya wants to compare those two strings lexicographically. The letters' case does not matter, that is an uppercase letter is considered equivalent to the corresponding lowercase letter. Help Petya perform the comparison.\n# Input\n\n# Each of the first two lines contains a bought string. The strings' lengths range from 1 to 100 inclusive. It is guaranteed that the strings are of the same length and also consist of uppercase and lowercase Latin letters.\n# Output\n\n# If the first string is less than the second one, print \"-1\". If the second string is less than the first one, print \"1\". If the strings are equal, print \"0\". Note that the letters' case is not taken into consideration when the strings are compared.\n\n\n# Input\n# Copy\n\n# aaaa\n# aaaA\n\n# Output\n\n\n# 0\n\n\nstring1 = input()\nstring2 = input()\n\nstring1 = string1.lower()\nstring2 = string2.lower()\n\n# str1_count = 0\n# str2_count = 0\n\n# for i in string1:\n# str1_count += ord(i)\n# for i in string2:\n# str2_count += ord(i)\n\n# if str1_count == str2_count:\n# print(0)\n# if str1_count > str2_count:\n# print(1)\n# if str1_count < str2_count:\n# print(-1)\nop = 0\nfor i in range(len(string1)):\n if string1[i] < string2[i]:\n op = -1\n break\n if string1[i] > string2[i]:\n op = 1\n break\nprint(op)\n\n\n# i=0\n# while i < len(string1) and i > len(string2):\n# if string1[i] < string2[i]:\n# print(string1, \"comes before\", string2)\n# break\n# elif string1[i] > string2[i]:\n# print(string2, \"comes before\", string1)\n# break\n# i += 1\n# else:\n# if len(string1) < len(string2):\n# print(string1, \"comes before\", string2)\n# elif len(string1) > len(string2):\n# print(string2, \"comes before\", string1)\n# else:\n# print(\"The two strings are equal\")\n", "def bebra(str1, str2):\r\n str1 = str1.lower() # Приводим к нижнему регистру\r\n str2 = str2.lower() \r\n if str1 < str2:\r\n return -1\r\n elif str1 > str2:\r\n return 1\r\n else:\r\n return 0\r\nstring1 = input()\r\nstring2 = input()\r\nresult = bebra(string1, string2)\r\nprint(result)", "S1=input().lower()\r\nS2=input().lower()\r\nif S1<S2:\r\n print(\"-1\")\r\nelif S1>S2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "s=input()\r\np=input()\r\nq=s.lower()\r\nw=p.lower()\r\nl1=[];l2=[]\r\nfor i in q:\r\n l1.append(ord(i))\r\nfor i in w:\r\n l2.append(ord(i))\r\nif l1==l2:\r\n print(0)\r\nelse:\r\n for i in range(0,len(l1)):\r\n if l1[i]==l2[i]:\r\n continue\r\n elif l1[i]>l2[i]:\r\n print(1)\r\n break\r\n else:\r\n print(-1)\r\n break\r\n", "s=input()\r\nf=input()\r\ns=s.lower()\r\nf=f.lower()\r\nj=0\r\nflag=0\r\nfor i in s:\r\n if(ord(i)>ord(f[j])):\r\n print(\"1\")\r\n flag=1\r\n break\r\n elif(ord(i)<ord(f[j])):\r\n print(\"-1\")\r\n flag=1\r\n break\r\n else:\r\n j=j+1\r\nif(flag==0):\r\n print(\"0\")\r\n", "a = input().strip().lower()\r\nb = input().strip().lower()\r\nif a<b:\r\n print(-1)\r\nelif a>b:\r\n print(1)\r\nelse:\r\n print(0)", "str1 = input().lower()\r\nstr2 = input().lower()\r\n\r\nresult = 0\r\n\r\nfor a, b in zip(str1, str2):\r\n if a < b:\r\n result = -1\r\n break\r\n elif a > b:\r\n result = 1\r\n break\r\n\r\nprint(result)", "# Input\nstring1 = input().lower() # Convert to lowercase\nstring2 = input().lower() # Convert to lowercase\n\n# Compare the strings lexicographically\nif string1 < string2:\n print(-1)\nelif string1 > string2:\n print(1)\nelse:\n print(0)\n\n \t\t\t\t \t\t\t \t\t\t\t \t\t \t\t", "string1= input().lower()\r\nstring2=input().lower()\r\nif string1<string2:\r\n print(\"-1\")\r\nelif string1>string2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "#https://codeforces.com/problemset/problem/112/A\n\nimport math\n#import numpy as np\n\nif __name__==\"__main__\":\n n = input().lower()\n m = input().lower()\n ns = sum([ord(x) for x in n])\n ms = sum([ord(x) for x in m])\n if n<m: print(\"-1\")\n elif n>m: print(\"1\")\n else: print(\"0\")\n\n\n", "a = input()\nb = input()\nfor i in range(len(a)):\n if (a[i].lower() > b[i].lower()):\n print(1)\n exit()\n elif a[i].lower() < b[i].lower():\n print(-1)\n exit()\nprint(0)\n", "b=input().lower()\na=input().lower()\nif b==a:\n print(0)\nelif b>a:\n print(1)\nelse:\n print(-1)\n \t \t \t\t\t\t \t \t\t\t\t \t \t\t \t \t\t", "str1 = input().lower()\r\nstr2 = input().lower()\r\n\r\nordSum1 = [ord(i) for i in str1]\r\nordSum2 = [ord(i) for i in str2]\r\n\r\nif ordSum1 > ordSum2:\r\n print(\"1\")\r\nelif ordSum2 > ordSum1:\r\n print(\"-1\")\r\nelif ordSum1==ordSum2:\r\n print(\"0\")", "n = input().upper()\r\nm = input().upper()\r\nif n > m:\r\n print(1)\r\nelif n == m:\r\n print(0)\r\nelse:\r\n print(-1)\r\n", "#王天，2300011878\r\none=input().lower()\r\ntwo=input().lower()\r\nif one>two:\r\n print(1)\r\nelif one==two:\r\n print(0)\r\nelse:\r\n print(-1)", "str1 = (input()).lower()\r\nstr2 = (input()).lower()\r\n\r\nfor x in range(len(str1)):\r\n if(str1 == str2 ):\r\n print(0)\r\n break\r\n if(str1[x] > str2[x]):\r\n print(1)\r\n break\r\n else:\r\n if(str1[x] < str2[x]):\r\n print(-1)\r\n break\r\n", "n = input().lower()\r\nm = input().lower()\r\nif n > m:\r\n print(1)\r\nelif n == m:\r\n print(0)\r\nelse:\r\n print(-1)\r\n", "\"\"\"\r\nCreated on Sep 27 2023\r\n@author: 施广熠 2300012143\r\n\"\"\"\r\nstr1=input().lower()\r\nstr2=input().lower()\r\nfor i in range(len(str1)):\r\n if ord(str1[i])>ord(str2[i]):\r\n print(1)\r\n break\r\n if ord(str1[i])<ord(str2[i]):\r\n print(-1)\r\n break\r\n if ord(str1[i])==ord(str2[i]) and i==len(str1)-1:\r\n print(0)", "b1=input().lower()\nb2=input().lower()\nif b1==b2:\n print(0)\nelif b1>b2:\n print(1)\nelse:\n print(-1)\n\t\t \t \t \t \t\t \t\t\t \t \t \t", "# Read the two strings as input\r\nstring1 = input().lower() # Convert to lowercase to make the comparison case-insensitive\r\nstring2 = input().lower()\r\n\r\n# Compare the two strings lexicographically\r\nif string1 < string2:\r\n print(\"-1\")\r\nelif string1 > string2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 21 19:50:41 2023\r\n\r\n@author: 余汶青\r\n\"\"\"\r\n\r\na=input()\r\nb=input()\r\na=a.lower()\r\nb=b.lower()\r\nif(a<b):\r\n print(-1)\r\nif(a==b):\r\n print(0)\r\nif(a>b):\r\n print(1)", "s1=input()\r\ns2=input()\r\nflag=1\r\nfor i in range(len(s1)):\r\n if ord(s1[i].upper())==ord(s2[i].upper()):\r\n continue\r\n elif ord(s1[i].upper())>ord(s2[i].upper()):\r\n flag=0\r\n print(1)\r\n break\r\n else:\r\n flag=0\r\n print(-1)\r\n break\r\nif flag==1:\r\n print(0)\r\n", "m = input().lower()\nn = input().lower()\nif m == n:\n print(0)\nelif m > n :\n print(1)\nelse:\n print(-1)", "line1 = str(input())\r\nline2 = str(input())\r\ni=0\r\nflag=0\r\nwhile(i<len(line2) and flag==0):\r\n if (line1[i]).lower()>(line2[i]).lower():\r\n flag = 1\r\n elif (line1[i]).lower()<(line2[i]).lower():\r\n flag = -1\r\n i = i+1\r\nprint(flag)\r\n", "cool=input()\nsick=input()\n\ncool1=cool.lower()\nsick1=sick.lower()\n\nif cool1>sick1:\n\tprint(1)\nelif cool1<sick1:\n\tprint(-1)\nelse:\n\tprint(0)\n\n \t\t\t \t \t \t \t \t \t\t \t \t \t\t\t", "a=str(input())\r\nb=str(input())\r\nzch=a.upper()\r\nwjz=b.upper()\r\nl=len(a)\r\nif zch==wjz:\r\n print(0)\r\nelse:\r\n for i in range(len(a)):\r\n if ord(zch[i])!=ord(wjz[i]):\r\n if ord(zch[i])<ord(wjz[i]):\r\n print(-1)\r\n else:\r\n print(1)\r\n break", "Fir_str = input().lower()\r\nSec_str = input().lower()\r\nr = len(Fir_str)\r\nc = 0\r\nfor i in range(r):\r\n d = ord(Fir_str[i]) - ord(Sec_str[i])\r\n if d == 0:\r\n continue\r\n if d > 0:\r\n c = 1\r\n print(1)\r\n break\r\n elif d < 0:\r\n c = 1\r\n print(-1)\r\n break\r\nif c == 0:\r\n print(0)", "s1 = input()\r\ns2 = input()\r\nls = len(s1)\r\nfor i in range(97, 123):\r\n s1 = s1.replace(chr(i), chr(i-32))\r\n s2 = s2.replace(chr(i), chr(i-32))\r\nif s1 < s2:\r\n print(-1)\r\nif s1 == s2:\r\n print(0)\r\nif s1 > s2:\r\n print(1)", "a=input()\r\nb=input()\r\ns=a.lower()\r\np=b.lower()\r\nif s<p:\r\n print(-1)\r\nelif s==p:\r\n print(0)\r\nelse:\r\n print(1)", "string1=input()\r\nstring2=input()\r\nstring1 = string1.lower()\r\nstring2 = string2.lower()\r\n\r\nif string1 < string2:\r\n print(\"-1\")\r\nelif string1 > string2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "first = input().lower()\r\nsecond = input().lower()\r\n\r\nfor i in range(len(first)):\r\n if first == second:\r\n print(0)\r\n break\r\n if first[i] < second[i]:\r\n print(-1)\r\n break\r\n if first[i] > second[i]:\r\n print(1)\r\n break\r\n", "data_list = []\r\nfor i in range(2):\r\n data = input()\r\n data_list.append(data.lower())\r\nif data_list[0] > data_list[1]:\r\n print(\"1\")\r\nelif data_list[0] == data_list[1]:\r\n print(\"0\")\r\nelse:\r\n print(\"-1\")\r\n", "a = input()\r\nb = input()\r\n\r\na=a.lower()\r\nb=b.lower()\r\n\r\nans=0\r\n\r\nfor i in range(len(a)):\r\n if ord(a[i])>ord(b[i]):\r\n ans = 1\r\n break\r\n if ord(a[i])<ord(b[i]):\r\n ans = -1\r\n break\r\n\r\nprint(ans)", "x=str(input()).lower()\r\ny=str(input()).lower()\r\nF=0\r\nfor i in range(len(x)):\r\n if x[i]>y[i]:\r\n print(1)\r\n F=1\r\n break\r\n elif x[i]<y[i]:\r\n print(-1)\r\n F=1\r\n break\r\n else:\r\n continue\r\n \r\nif(F==0):\r\n print(0)", "# #黄靖涵 2300098604 工学院 2023秋\r\n\r\nstr_1=input().upper()\r\nstr_2=input().upper()\r\n\r\nif str_1 > str_2:\r\n print('1')\r\nelif str_1 < str_2:\r\n print('-1')\r\nelse:\r\n print('0')\r\n ", "string_1 = input()\r\nstring_2 = input()\r\nstring_1_copy = string_1.lower()\r\nstring_2_copy = string_2.lower()\r\ncount = 0\r\nfor i in range(0,len(string_1_copy)):\r\n if ord(string_1_copy[i]) < ord(string_2_copy[i]):\r\n count+=1\r\n print(-1)\r\n break\r\n elif ord(string_1_copy[i]) > ord(string_2_copy[i]):\r\n count+=1\r\n print(1)\r\n break\r\nif count == 0:\r\n print(0)\r\n", "l=['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', '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\na=input()\r\nb=input()\r\nfor i in range(len(a)):\r\n for j in range(26):\r\n if a[i]==l[j] or a[i]==l[j+26]:\r\n w=j\r\n if b[i]==l[j] or b[i]==l[j+26]:\r\n e=j\r\n if w>e:\r\n print(1)\r\n break\r\n elif w<e:\r\n print(-1)\r\n break\r\nif w==e:\r\n print(0)", "s1 = input()\r\ns2 = input()\r\ns1 = s1.lower()\r\ns2 = s2.lower()\r\nif (s1 < s2):\r\n print(-1)\r\nelif (s1 > s2):\r\n print(1)\r\nelse:\r\n print(0)\r\n", "i1 = input()\r\ni2 = input()\r\nresult =0\r\nfor i in range(len(i1)):\r\n if result == 0:\r\n c1 = i1[i].lower()\r\n c2 = i2[i].lower()\r\n if c1 != c2:\r\n if ord(c1) > ord(c2):\r\n result = 1\r\n elif ord(c1) < ord(c2):\r\n result = -1\r\nprint(result)", "statement1 = input()\r\nstatement2 = input()\r\n\r\nif statement1.lower() > statement2.lower():\r\n print(\"1\")\r\nelif statement1.lower() < statement2.lower():\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")", "st1 = input()\r\nst2 = input()\r\nst1, st2 = st1.lower(), st2.lower()\r\nif st1 < st2:\r\n print(-1)\r\nelif st2 < st1:\r\n print(1)\r\nelse:\r\n print(0)", "a=input()\r\nb=input()\r\na=a.lower()\r\nb=b.lower()\r\nflg=0\r\ni=0\r\nwhile flg == 0 and i < len(a):\r\n if a[i]<b[i]:\r\n flg=-1\r\n elif a[i]>b[i]:\r\n flg=1\r\n i +=1\r\n\r\nprint(flg) \r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n", "s1 = input().lower()\r\ns2 = input().lower()\r\n\r\nif s1 == s2:\r\n print(0)\r\nelif s1>s2:\r\n print(1)\r\nelse:\r\n print(-1)", "x=input()\r\ny=input()\r\nif x.lower()<y.lower():\r\n print(\"-1\")\r\nelif x.lower()>y.lower():\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = str(input())\r\nb = str(input())\r\n\r\na = a.lower()\r\nb = b.lower()\r\n\r\nif a != b:\r\n if a < b:\r\n print('-1')\r\n else:\r\n print('1')\r\nelse:\r\n print('0')", "def compare_strings(str1, str2):\r\n str1 = str1.lower()\r\n str2 = str2.lower()\r\n\r\n if str1 < str2:\r\n return -1\r\n elif str1 > str2:\r\n return 1\r\n else:\r\n return 0\r\n\r\n# Ввод данных\r\nstr1 = input()\r\nstr2 = input()\r\n\r\n# Решение и вывод результата\r\nresult = compare_strings(str1, str2)\r\nprint(result)", "a=input()\r\nb=input()\r\nif(a.lower()<b.lower()):\r\n print(-1)\r\nelif(a.lower()>b.lower()):\r\n print(1)\r\nelse:\r\n print(0)", "word_1 = input()\r\nword_2 = input()\r\nword_1 = word_1.lower()\r\nword_2 = word_2.lower()\r\nif word_1 == word_2:\r\n print('0')\r\nelif word_1 > word_2:\r\n print('1')\r\nelse:\r\n print('-1')", "str1 = input().lower()\r\nstr2 = input().lower()\r\nif(str1 == str2):\r\n print(0)\r\nelse:\r\n sorted_string1 = ''.join(sorted(str1))\r\n if(str1 > str2):\r\n print(1)\r\n else:\r\n print(-1)\r\n\r\n\r\n\r\n", "a=input()\r\nb=input()\r\nif a.upper()>b.upper():\r\n print(1)\r\nelif a.upper()==b.upper():\r\n print(0)\r\nelse:\r\n print(-1)", "a = input()\r\nb = input()\r\nb = b.lower()\r\na = a.lower()\r\np = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] == b[i]:\r\n continue\r\n else:\r\n if a[i] > b[i]:\r\n p += 1\r\n break\r\n else:\r\n p -= 1 \r\n break\r\nprint(p)", "s1= input().lower()\r\ns2= input().lower()\r\nc=0\r\nfor i in range(len(s1)):\r\n if s1[i]==s2[i]:\r\n pass\r\n elif s1[i]>s2[i]:\r\n c+=1\r\n break\r\n elif s1[i]<s2[i]:\r\n c-=1\r\n break\r\n\r\nif c==0:\r\n print(0)\r\nelif c>=1:\r\n print(1)\r\nelif c<=-1:\r\n print(-1)", "def t17():\r\n a = input().lower()\r\n b = input().lower()\r\n st = 1\r\n english_alphabet = ['a', 'b', 'c', 'd', 'e', 'f', 'g', 'h', 'i', 'j', 'k', 'l', 'm', 'n', 'o',\r\n 'p', 'q', 'r', 's', 't', 'u', 'v', 'w', 'x', 'y', 'z']\r\n for i in range(len(a)):\r\n if english_alphabet.index(a[i]) > english_alphabet.index(b[i]):\r\n print(1)\r\n st = 0\r\n break\r\n elif english_alphabet.index(a[i]) < english_alphabet.index(b[i]):\r\n print(-1)\r\n st = 0\r\n break\r\n else:\r\n continue\r\n if st:\r\n print(0)\r\n\r\n\r\nt17()", "ch=input().upper()\r\nch1=input().upper()\r\nif(ch>ch1):\r\n print(1)\r\nelif (ch==ch1):\r\n print(0)\r\nelse:\r\n print(-1)\r\n", "aq=input().lower()\nbq=input().lower()\nif aq==bq:\n print(0)\nelif aq>bq:\n print(1)\nelse:\n print(-1) \n \t \t\t \t \t \t \t\t \t\t\t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 5 23:07:21 2023\r\n\r\n@author: risha\r\n\"\"\"\r\n\r\ns1=list(input().lower())\r\ns2=list(input().lower())\r\nc=0\r\nfor i in range(len(s1)):\r\n if s1[i]==s2[i]:\r\n c=1\r\n else:\r\n if s1[i]<s2[i]:\r\n print(\"-1\")\r\n\r\n elif s1[i]>s2[i]:\r\n print(\"1\")\r\n c=0\r\n break\r\nif c==1:\r\n print(0)\r\n", "s1=input()\r\ns2=input()\r\n \r\ns1=s1.lower()\r\ns2=s2.lower()\r\n \r\n \r\n \r\n \r\nif s1>s2:\r\n print(\"1\")\r\n \r\nelif s2>s1:\r\n print(\"-1\")\r\n \r\nelse:\r\n print(\"0\")", "s1=input()\r\ns2=input()\r\n\r\n\r\nif s1.lower()==s2.lower():\r\n print(\"0\")\r\nelif s1.lower()>s2.lower():\r\n print(\"1\")\r\nelse:\r\n print(\"-1\")", "line_1= input()\r\nline_2= input()\r\n\r\nline_1_lowercase= line_1.lower()\r\nline_2_lowercase= line_2.lower()\r\n\r\nif line_1_lowercase > line_2_lowercase:\r\n print(1)\r\nelif line_1_lowercase < line_2_lowercase:\r\n print(-1)\r\nelse:\r\n print(0)", "a, b = input(), input()\r\na, b = a.upper(), b.upper()\r\nprint(-1 if a < b else 0 if a == b else 1)", "a=input().lower()\nb=input().lower()\nif(a==b):\n print(\"0\")\nelif(a<b):\n print(\"-1\")\nelse:\n print(\"1\")\n", "A=input().lower()\nB=input().lower()\nif A==B:\n print(0)\nelif A>B:\n print(1)\nelse:\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", "def solve():\r\n s1 = input().lower()\r\n s2 = input().lower()\r\n print(0 if s1 == s2 else -1 if s1 < s2 else 1)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "str1=str(input()).lower()\r\nstr2=str(input()).lower()\r\n\r\nif str1<str2:\r\n print(-1)\r\nelif str1==str2:\r\n print(0)\r\nelse:\r\n print(1)", "s1=input().lower()\r\ns2=input().lower()\r\nif s1 < s2:\r\n print(\"-1\")\r\nelif s1 > s2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "str1 = input().lower()\r\nstr2 = input().lower()\r\nif str1 == str2:\r\n print(0)\r\nelse:\r\n print(1 if str1 > str2 else -1)", "def order(s):\r\n sumt=0\r\n for f in x:\r\n sumt+=ord(f)\r\n return s\r\ns=input()\r\ne=s.lower()\r\nx=input()\r\nf=x.lower()\r\nif order(e)>order(f):\r\n print(1)\r\nelif order(e)<order(f):\r\n print(-1)\r\nelse:\r\n print(0)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 23 15:46:36 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\n\r\na=str(input().lower())\r\nb=str(input().lower())\r\nc=0\r\nfor i in range(len(a)):\r\n if ord(a[i]) < ord(b[i]):\r\n print(-1)\r\n break\r\n elif ord(a[i]) > ord(b[i]):\r\n print(1)\r\n break\r\n else:\r\n c+=1\r\n\r\nif c==len(a):\r\n print(0)", "a=input().lower()\r\nb=input().lower()\r\nif a>b:\r\n print(1)\r\nif a<b:\r\n print(-1)\r\nif a==b:\r\n print(0)\r\n", "s1, s2 = input().lower(), input().lower()\r\nprint(-1 if s1 < s2 else 1 if s1 > s2 else 0)\r\n", "s1 = str(input())\r\ns2 = str(input())\r\ns1,s2 = s1.lower(),s2.lower()\r\nif s1>s2:\r\n print(1)\r\nelif s2 > s1:\r\n print(-1)\r\nelse:\r\n print(0)", "s1=str(input())\r\ns2=str(input())\r\ns1=s1.lower()\r\ns2=s2.lower()\r\nif(s1==s2):\r\n print(\"0\")\r\nelif(s1<s2):\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")\r\n", "def Compare(a,b):\r\n a=a.lower()\r\n b=b.lower()\r\n if(a>b):\r\n return 1\r\n elif(b>a):\r\n return -1\r\n else:\r\n return 0\r\nif __name__==\"__main__\":\r\n a=input()\r\n b=input()\r\n print(Compare(a,b))\r\n pass", "def petya(a,b):\r\n return (a>=b)-(a<=b)\r\n\r\n\r\na=input(\"\")\r\nb=input(\"\")\r\nc1=a.lower()\r\nc2=b.lower()\r\nprint(petya(c1,c2))\r\n", "ab = 'abcdefghijklmnopqrstuvwxyz'\r\na = input().lower()\r\nb = input().lower()\r\nc = 0\r\nd = 0\r\nfor i in range(len(a)):\r\n if a[i] > b[i]:\r\n c+=1\r\n break\r\n elif a[i] < b[i]:\r\n d=d+1\r\n break\r\nif c>d:\r\n print(1)\r\nelif c<d:\r\n print(-1)\r\nelse:\r\n print(0)", "def compare_strings(str1, str2):\n str1 = str1.lower()\n str2 = str2.lower()\n\n if str1 < str2:\n return -1\n elif str1 > str2:\n return 1\n else:\n return 0\n\n# Read the input strings\nstr1 = input()\nstr2 = input()\n\n# Compare the strings\nresult = compare_strings(str1, str2)\n\n# Print the result\nprint(result)\n \t\t \t\t \t\t\t \t \t \t \t\t \t \t", "frst = input().lower()\r\nscnd = input().lower()\r\nif(frst<scnd):\r\n print(-1)\r\nelif(frst==scnd):\r\n print(0)\r\nelse:\r\n print(1)", "# Read the two strings\nstring1 = input().strip().lower() # Convert to lowercase\nstring2 = input().strip().lower() # Convert to lowercase\n\n# Compare the strings lexicographically\nif string1 < string2:\n print(\"-1\")\nelif string1 > string2:\n print(\"1\")\nelse:\n print(\"0\")\n\n", "first_str=input()\r\nsecond_str=input()\r\nfirst_str=first_str.lower()\r\nsecond_str=second_str.lower()\r\nc=0\r\nif first_str>second_str:\r\n print(1)\r\nelif second_str>first_str:\r\n print(-1)\r\n\r\nelif first_str==second_str:\r\n print(0)", "first = input().lower().split()\r\nsecond = input().lower().split()\r\nlength_first = len(first)\r\nlength_second = len(second)\r\nstring = 0\r\nif length_first == length_second and length_first >= 1 and length_first <= 100 and length_second >= 1 and length_second <= 100:\r\n for i in range(length_second):\r\n if first[i] == second[i]:\r\n string = 0\r\n break\r\n for i in range(length_second):\r\n if first[i] < second[i]: \r\n string = -1\r\n break\r\n for i in range(length_second):\r\n if first[i] > second[i]: \r\n string = 1\r\n break \r\nprint(string) ", "s1=input()\ns2=input()\ns1=s1.lower()\ns2=s2.lower()\nc=0\nif s1>s2:\n print(1)\nelif s1<s2:\n print(-1)\nelif s1==s2:\n print(0)\n\t\t\t \t\t \t \t\t\t \t\t\t \t\t\t\t\t \t \t", "\r\ndef main():\r\n first = input().lower()\r\n second = input().lower()\r\n if first < second:\r\n print(-1)\r\n if first > second:\r\n print(1)\r\n if first == second:\r\n print(0)\r\n\r\nif __name__ == '__main__':\r\n main()", "a, b = input().lower(), input().lower()\nif a < b:\n print(-1)\nelif a > b:\n print(1)\nelse:\n print(0)\n# Sat Oct 07 2023 19:06:37 GMT+0300 (Moscow Standard Time)\n", "s1=input()\r\ns2=input()\r\ns1=s1.lower()\r\ns2=s2.lower()\r\nflag=0\r\nfor i in range(len(s1)):\r\n if(s1[i]<s2[i]):\r\n print(-1)\r\n flag=1\r\n break\r\n elif(s1[i]>s2[i]):\r\n print(1)\r\n flag=1\r\n break\r\n\r\nif(flag==0):\r\n print(0)\r\n", "x = (str(input())).lower()\r\ny = (str(input())).lower()\r\nif x < y:\r\n print(-1)\r\nelif x > y:\r\n print(1)\r\nelif x == y:\r\n print(0)\r\n", "M=[input(),input()]\r\nm=M[0].lower();n=M[1].lower()\r\nN=[m,n]\r\nN.sort()\r\nif(N[0]==m and m!=n):\r\n print(-1)\r\nelif(N[0]==n and m!=n):\r\n print(1)\r\nelif(N[0]==m):\r\n print(0)", "a=input().lower()\r\nb=input().lower()\r\nif a>b:\r\n print(1)\r\nelif a<b:\r\n print(-1)\r\nelse:\r\n print(0)", "n = input()\r\nm = input()\r\ns1 = n.lower()\r\ns2 = m.lower()\r\nif(s1>s2):\r\n print(\"1\")\r\nelif(s1<s2):\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")", "t1 = input().lower()\r\nt2 = input().lower()\r\nc1 = 0\r\nc2 = 0\r\n\r\nfor i in range(len(t1)):\r\n c1 = ord(t1[i])\r\n c2 = ord(t2[i])\r\n if c1 != c2:\r\n break\r\n\r\nif c1 == c2:\r\n print(0)\r\nelif c1 < c2:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "n = str(input())\r\ns = str(input())\r\n\r\nif(n.lower()==s.lower()):\r\n print(0)\r\nelif(n.lower()<s.lower()):\r\n print(-1)\r\nelif(n.lower()>s.lower()):\r\n print(1)", "a = input()\r\nb = input()\r\n\r\nif(a.lower()<b.lower()):\r\n print(-1)\r\nif(a.lower()==b.lower()):\r\n print(0)\r\nif(a.lower()>b.lower()):\r\n print(1)\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 27 19:04:49 2023\r\n\r\n@author: 高铭泽 2300011427\r\n\"\"\"\r\nvar1 = input()\r\nvar2 = input()\r\nvar1 = var1.lower()\r\nvar2 = var2.lower()\r\nif var1==var2:\r\n print('0')\r\nelif var1<var2:\r\n print('-1')\r\nelse:\r\n print('1')\r\n", "n1 = input().lower()\r\nm1 = input().lower()\r\nif n1<m1:\r\n print('-1')\r\nelif n1>m1:\r\n print('1')\r\nelif n1 == m1:\r\n print('0')", "s1=input()\r\ns2=input()\r\nif s1.lower()==s2.lower():\r\n print(0)\r\nelif s1.lower()<s2.lower():\r\n print(-1)\r\nelse:\r\n print(1)", "word1 = str(input()).lower()\r\nword2 = str(input()).lower()\r\n\r\n\r\nif word1 == word2:\r\n print(0)\r\nelif word1 < word2:\r\n print(-1)\r\nelse:\r\n print(1)\r\n ", "# https://codeforces.com/problemset/problem/112/A\r\n\r\ndef strcompare(str1, str2):\r\n for i in range(len(str1)):\r\n if str1[i] == str2[i]:\r\n continue\r\n elif str1[i] > str2[i]:\r\n return '1'\r\n else:\r\n return '-1'\r\n return '0'\r\n\r\n\r\nstr1 = input().lower()\r\nstr2 = input().lower()\r\n\r\nprint(strcompare(str1, str2)) \r\n", "a=input()\r\nb=input()\r\na=a.upper()\r\nb=b.upper()\r\nif a<b:\r\n print('-1')\r\nelif a>b:\r\n print('1')\r\nelse:\r\n print('0')", "x = input().lower()\r\ny = input().lower()\r\nres = 0\r\nif x > y:\r\n res = 1\r\nelif x < y:\r\n res = -1\r\nelse:\r\n res = 0\r\nprint(res)", "s1=str(input()).lower()\r\ns2=str(input()).lower()\r\nif s1==s2:\r\n print(0)\r\nelif s1>s2:\r\n print(1)\r\nelse:\r\n print(-1)", "t=str(input())\r\nt2=str(input())\r\ndef pat_string(s1,s2):\r\n s1=s1.lower()\r\n s2=s2.lower()\r\n if s1>s2:\r\n return 1\r\n elif s1<s2:\r\n return -1\r\n else:\r\n return 0\r\n\r\nprint(pat_string(t,t2))", "import sys\r\n\r\ns1 = input()\r\ns2 = input()\r\ns1 = s1.lower()\r\ns2 = s2.lower()\r\nfor i in range(len(s1)):\r\n if ord(s1[i]) > ord(s2[i]):\r\n print(\"1\")\r\n sys.exit()\r\n elif ord(s1[i]) < ord(s2[i]):\r\n print(\"-1\")\r\n sys.exit()\r\nprint(\"0\")", "x = input().lower()\r\ny = input().lower()\r\nalpha_min = {'a': 1, 'b': 2, 'c': 3, 'd': 4, 'e': 5, 'f': 6, 'g': 7, 'h': 8, 'i': 9, 'j': 10, 'k': 11, 'l': 12, 'm': 13,\r\n 'n': 14, 'o': 15, 'p': 16, 'q': 17, 'r': 18, 's': 19, 't': 20, 'u': 21, 'v': 22, 'w': 23, 'x': 24, 'y': 25, 'z': 26}\r\nk = 0\r\nfor i, j in zip(x, y):\r\n if alpha_min[i] > alpha_min[j]:\r\n k = 1\r\n break\r\n elif alpha_min[j] > alpha_min[i]:\r\n k = -1\r\n break\r\n else:\r\n k = 0\r\nprint(k)\r\n", "def code(*args):\r\n if len(args[0]) != len(args[1]):\r\n return -1\r\n\r\n if args[0].lower() < args[1].lower():\r\n return -1\r\n elif args[0].lower() == args[1].lower():\r\n return 0\r\n return 1\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # Take inputs here\r\n str1 = input()\r\n str2 = input()\r\n result = code(str1, str2) # Pass arguments\r\n print(result)\r\n\r\n", "str1=input()\nstr2=input()\nstr1=str1.lower()\nstr2=str2.lower()\nif str1>str2 :\n print(1)\nelif str2 > str1 :\n print(-1)\nelse :\n print(0)\n\t \t \t\t\t\t\t \t\t\t\t \t\t\t \t", "def solve():\r\n s1 = input()\r\n s2 = input()\r\n s1 = s1.upper()\r\n s2 = s2.upper()\r\n for i in range(0,len(s1)):\r\n if s1[i] != s2[i]:\r\n if s1[i] > s2[i]:\r\n return 1\r\n else:\r\n return -1\r\n return 0\r\n\r\nprint(solve())", "first_str = input().lower()\r\nsecond_str = input().lower()\r\narr = []\r\nif first_str == second_str:\r\n print(0)\r\nelse:\r\n arr.append(first_str)\r\n arr.append(second_str)\r\n arr.sort()\r\n if arr[0] == second_str:\r\n print(1)\r\n else:\r\n print(-1)\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[ ]:\n\n\ns1=str(input())\ns2=str(input())\ns1=s1.lower()\ns2=s2.lower()\nif s1>s2:\n print(1)\nelif s1<s2:\n print(-1)\nelse:\n print(0)\n \n \n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "inp1=input().lower()\r\ninp2=input().lower()\r\ndef func():\r\n for i in range(len(inp1)):\r\n if inp1[i]<inp2[i]:\r\n return -1\r\n elif inp1[i]>inp2[i]:\r\n return 1\r\n else:\r\n continue\r\n return 0\r\n\r\nprint(func())\r\n", "string1 = input()\r\nstring2 = input()\r\n\r\nif string1.lower() < string2.lower():\r\n print(\"-1\")\r\nelif string2.lower() < string1.lower():\r\n print(\"1\")\r\nelse:\r\n print(0)", "string_one = input()\r\nstring_two = input()\r\n\r\nlst = [string_one.lower(), string_two.lower()]\r\n\r\nlst_new = lst.sort()\r\n\r\nif string_one.lower() == string_two.lower():\r\n print(0)\r\nelif lst[0] == string_one.lower():\r\n print(-1)\r\nelse:\r\n print(1)\r\n ", "# -*- coding: utf-8 -*-\n\"\"\"Untitled10.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1Y76e7LeXWvCIjIdSAW7klJvgCVNmBhzq\n\"\"\"\n\nbs1 = str(input().lower())\nbs2 = str(input().lower())\nif bs1 == bs2:\n print(0)\nelif bs1 < bs2:\n print(-1)\nelse:\n print(1)", "def compare(string1, string2):\r\n for char1, char2 in zip(string1, string2):\r\n if char1 < char2:\r\n return -1\r\n elif char1 > char2:\r\n return 1\r\n return 0\r\n\r\nstring1 = input().lower()\r\nstring2 = input().lower()\r\nprint(compare(string1, string2))\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 22:50:15 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\ns1=input()\r\ns2=input()\r\nfor i in range(len(s1)):\r\n if int(ord(s1[i]))%32==int(ord(s2[i]))%32:\r\n if i==len(s1)-1:\r\n print(0)\r\n elif int(ord(s1[i]))%32<int(ord(s2[i]))%32:\r\n print(-1)\r\n break\r\n else:\r\n print(1)\r\n break", "s1 = input()\r\ns2 = input()\r\nst,sb ='',''\r\nfor i in range(len(s1)):\r\n st += s1[i].upper()\r\n sb += s2[i].upper()\r\nif st > sb:\r\n print(1)\r\nelif st < sb:\r\n print(-1)\r\nelse:\r\n print(0)\r\n ", "str1 = input()\r\nstr2 = input()\r\ns1 = str1.lower()\r\ns2 = str2.lower()\r\nif s1 == s2:\r\n print(0)\r\nelse:\r\n for x1, x2 in zip(s1, s2):\r\n if x1 != x2:\r\n if x1 > x2:\r\n print(1)\r\n break\r\n elif x1 < x2:\r\n print(-1)\r\n break\r\n", "# CF_Problem: 112A_Petya_and_Strings\r\n\r\ndef str_comp(a, b):\r\n if a == b:\r\n return 0\r\n\r\n elif a < b:\r\n return -1\r\n\r\n else:\r\n return 1\r\n\r\n\r\nx = str_comp(input().upper(), input().upper())\r\nprint(x)\r\n", "firstline = input()\nsecondline = input()\n\nans = 0\nfor i in range(len(firstline)):\n x = ord(firstline[i].lower())\n y= ord(secondline[i].lower())\n if x>y:\n ans = 1\n break\n elif x<y:\n ans = -1\n break\nprint(ans)", "\r\ntempStrA=input().lower()\r\ntempStrB=input().lower()\r\nif tempStrA<tempStrB:\r\n print('-1')\r\nelif tempStrA>tempStrB:\r\n print('1')\r\nelse:\r\n print('0')", "p1=input()\r\np2=input()\r\n\r\n\r\np1=p1.lower()\r\np2=p2.lower()\r\nigual = 0\r\nfor i, letra in enumerate(p1):\r\n\r\n if letra>p2[i]:\r\n print(1)\r\n break\r\n elif letra<p2[i]:\r\n print(-1)\r\n break\r\n elif letra==p2[i]: \r\n igual = igual +1\r\n\r\nif igual == len(p1):\r\n print(0)", "n=input(\"\")\r\nn2=input(\"\")\r\n\r\nn=n.lower()\r\nn2=n2.lower()\r\n\r\nif n>n2 :\r\n print(\"1\")\r\nelif n<n2 :\r\n print(\"-1\")\r\nelse :\r\n print(\"0\")", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n \r\n return(input())\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n \r\na = s().lower()\r\nb = s().lower()\r\n\r\n\r\n\r\nif a == b:\r\n print(0)\r\nelif a > b:\r\n print(1)\r\nelse:\r\n print(-1)", "\"\"\"\r\ncompleted by 乔俊杰，光华管理学院\r\n\"\"\"\r\na = input()\r\nb = input()\r\n(a,b) = (a.lower(),b.lower())\r\nif a < b:\r\n print(-1)\r\nelif a > b:\r\n print(1)\r\nelse:\r\n print(0)", "n,m=input().upper(),input().upper()\nif n==m:\n\tprint(0)\nelif n > m:\n\tprint(1)\nelse:\n\tprint(-1)\n\t \t\t\t\t\t \t\t\t\t \t\t \t \t \t \t\t\t", "def solve():\r\n s=input().lower()\r\n s1=input().lower()\r\n for i in range(len(s)):\r\n if s[i]<s1[i]:\r\n print(-1)\r\n return\r\n elif s[i]>s1[i]:\r\n print(1)\r\n return\r\n print(0)\r\nif __name__ == '__main__':\r\n solve()", "i1, i2 = input().lower(), input().lower()\r\n\r\nif i1 < i2:\r\n print(-1)\r\nelif i1 > i2:\r\n print(1)\r\nelse:\r\n print(0)", "a = input().lower()\r\nb = input().lower()\r\nfor i in range(0, len(a)):\r\n if ord(a[i]) > ord(b[i]):\r\n print(1)\r\n break\r\n elif ord(a[i]) < ord(b[i]):\r\n print(-1)\r\n break\r\n elif i == (len(a)-1):\r\n print(0)\r\n", "first,second=list(input().lower()),list(input().lower())\r\nflag=True\r\nfor _ in range(len(first)):\r\n if ord(first[_])>ord(second[_]):\r\n print('1')\r\n flag=False\r\n break\r\n elif ord(first[_])<ord(second[_]):\r\n print('-1')\r\n flag=False\r\n break\r\nif flag:\r\n print('0')", "s1 = input(\"\").lower()\r\ns2 = input(\"\").lower()\r\ndef lexi(s1,s2):\r\n if len(s1) == 0:\r\n print(0)\r\n else:\r\n if s1[0] == s2[0]:\r\n lexi(s1[1:],s2[1:])\r\n elif s1[0] > s2[0]:\r\n print(1)\r\n else:\r\n print(-1)\r\nlexi(s1,s2)\r\n", "line1=input().lower()\r\nline2=input().lower()\r\nresult=0\r\n\r\nfor i in range(0,len(line1)):\r\n if line1[i]>line2[i]:\r\n result=1\r\n break\r\n if line1[i]<line2[i]:\r\n result=-1\r\n break\r\n \r\n \r\nprint(result)\r\n", "f = input().lower()\r\ns = input().lower()\r\n\r\nif f<s:\r\n print(-1)\r\nelif s<f:print(1)\r\nelif f==s:\r\n print(0)", "inputString1 = input().lower()\r\ninputString2 = input().lower()\r\n\r\nif inputString1 > inputString2:\r\n print('1')\r\nelif inputString1 < inputString2:\r\n print('-1')\r\nelse:\r\n print('0')", "s1=input().lower()\r\ns2=input().lower()\r\nn=len(s1)\r\nc=0\r\nfor i in range(0,n):\r\n if s1[i]==s2[i]:\r\n c=0\r\n elif s1[i]>s2[i]:\r\n c=1\r\n break\r\n else:\r\n c=-1\r\n break\r\nprint(c)", "alph = ['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\r\nword1 = input().lower()\r\nword2 = input().lower()\r\n\r\nif word1 < word2: print(-1)\r\nelif word1 == word2: print(0)\r\nelse: print(1)", "a=input().lower()\r\nb=input().lower()\r\nfor i in range(len(a)):\r\n if ord(a[i])>ord(b[i]):\r\n print(1)\r\n break\r\n elif ord(a[i])<ord(b[i]):\r\n print(-1)\r\n break\r\n\r\n#如果在循环过程中使用了break语句跳出循环，else语句块将不会被执行。\r\n# 它只在循环没有被break语句中断时才会执行。\r\n\r\nelse:\r\n print(0)\r\n", "\r\ninputs = []\r\n\r\nfor x in range(0,2):\r\n inputs.append([input().strip().lower()])\r\n\r\nif inputs[0] == inputs[1]:\r\n print(0)\r\n quit()\r\n\r\ns_inputs = sorted(inputs)\r\n\r\nif inputs == s_inputs:print(-1)\r\nelse:print(1)", "string_1 = input().lower()\r\nstring_2 = input().lower()\r\nx=0\r\nfor i in range(len(string_1)):\r\n\tif ord(string_1[i]) == ord(string_2[i]): continue\r\n\telif ord(string_1[i]) > ord(string_2[i]):\r\n\t\tx=1;\r\n\t\tbreak\r\n\telif ord(string_1[i]) < ord(string_2[i]):\r\n\t\tx=-1;\r\n\t\tbreak\r\n\telse: x=0\t\r\n\r\nprint(x)\r\n#author - Sirens", "a=input()\r\nb=input()\r\na=a.upper()\r\nb=b.upper()\r\nc=len(a)\r\ni=0\r\nwhile((i<c) and (ord(a[i])-ord(b[i])==0)):\r\n i+=1\r\nif(i==c):print(0)\r\nelif(ord(a[i])-ord(b[i])<0):print(-1)\r\nelse:print(1)", "i=input;w=i().lower();v=i().lower()\r\nprint((w>v)-(w<v))", "n=input()\r\nm=input()\r\nn=n.lower()\r\nm=m.lower()\r\nf=1\r\nfor i in range(len(n)):\r\n if(n[i]>m[i]):\r\n print(1)\r\n f = 0\r\n break\r\n elif(n[i]<m[i]):\r\n print(-1)\r\n f = 0;\r\n break\r\nif(f):\r\n print(0)\r\n ", "letters = str(\"abcdefghijklmnopqrstuvwxyz\")\r\n\r\nstrInputFirst = str(input()).lower()\r\nstrInputSecond = str(input()).lower()\r\n\r\nans = 0\r\n\r\nfor i in range(len(strInputFirst)):\r\n if letters.find(strInputFirst[i]) < letters.find(strInputSecond[i]):\r\n ans = -1\r\n break\r\n elif letters.find(strInputFirst[i]) > letters.find(strInputSecond[i]):\r\n ans = 1\r\n break\r\n \r\nprint(ans)", "line1, line2 = [input().upper() for i in range(2)]\r\nfl = True\r\nfor i in range(len(line1)):\r\n if line1[i] != line2[i]:\r\n print(-1 if ord(line1[i]) < ord(line2[i]) else 1)\r\n fl = False\r\n break\r\nif fl:\r\n print(0)\r\n", "arr = [input().lower(),input().lower()]\n\ndef solution(arr):\n if(arr[0] == arr[1]): return 0\n\n newArr = list(sorted(arr))\n\n if(newArr[0] == arr[0]): return -1\n\n return 1\n\nprint(solution(arr))\n", "str_1 = input().lower() \r\nstr_2 = input().lower() \r\n\r\nif str_1 < str_2:\r\n print(\"-1\")\r\nelif str_1 > str_2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "str_1 = input();str_2 = input()\r\nstr_1 = str_1.lower();str_2 = str_2.lower()\r\nif str_1 < str_2:\r\n print(-1)\r\nelif str_1 > str_2:\r\n print(1)\r\nelse:\r\n print(0)", "s1 = input().lower()\r\ns2 = input().lower()\r\nn = len(s1)\r\nvalue = None\r\nif s1 == s2:\r\n value = 0\r\nelif s1 < s2:\r\n value = -1\r\nelse:\r\n value = 1\r\nprint(value)", "import heapq\r\nfrom math import gcd,lcm\r\nfrom collections import Counter\r\n# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef MS(): return map(str, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 10**9 + 7\r\n\r\ns = S()\r\nt= S()\r\ns = s.lower()\r\nt = t.lower()\r\nif s == t:\r\n print(0)\r\nif s < t:\r\n print(-1)\r\nif s > t:\r\n print(1)", "#author 沈天健 2300011417\r\ns1=input().lower()\r\ns2=input().lower()\r\nif s1==s2:\r\n print(\"0\")\r\nelif s1<s2:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")\r\n\r\n", "s,m=input().lower(),input().lower()\r\nif s>m:\r\n\tprint(1)\r\nelif s<m:\r\n\tprint(-1)\r\nelse:\r\n\tprint(0)", "nourinz=input()\r\nn=nourinz.upper()\r\nohjan=input()\r\no=ohjan.upper()\r\nif n == o:\r\n print(0)\r\nelif n > o:\r\n print(1)\r\nelif n < o:\r\n print(-1)", "a = input().lower()\r\nb = input().lower()\r\nif a < b:print(-1)\r\nif a > b:print(1)\r\nif a == b:print(0)", "import string\r\na = input().lower()\r\nb = input().lower()\r\nc = 0\r\nans = 0\r\nfor x in range(len(a)):\r\n if string.ascii_lowercase.index(a[c]) > string.ascii_lowercase.index(b[c]):\r\n if ans == 0:\r\n ans = 1\r\n elif string.ascii_lowercase.index(a[c]) < string.ascii_lowercase.index(b[c]):\r\n if ans == 0:\r\n ans = -1\r\n c += 1\r\n\r\nprint(ans)", "string1=input().lower()\r\nstring2=input().lower()\r\nif string1<string2:\r\n print(-1)\r\nelif string1>string2:\r\n print(1)\r\nelse:\r\n print(0)", "string_1=input()\r\nstring_2=input()\r\nstring_1u=string_1.upper()\r\nstring_2u=string_2.upper()\r\nif string_1u > string_2u:\r\n print(\"1\")\r\nelif string_1u == string_2u:\r\n print(\"0\")\r\nelse:\r\n print(\"-1\")", "one = input().lower()\r\ntwo = input().lower()\r\nif one < two:\r\n print('-1')\r\nelif two < one:\r\n print('1')\r\nelse:\r\n print('0')", "x = input().lower()\r\ny = input().lower()\r\nif x > y:\r\n print(1)\r\nelif x < y:\r\n print(-1)\r\nelse:\r\n print(0)", "str1=\"\"\nstr2=\"\"\nn=0\nwhile(1):\n str1=input()\n str2=input()\n n=len(str1)\n N=len(str2)\n if n==N and n>=1 and n<=100:\n break\nstr1=str1.upper()\nstr2=str2.upper()\ncount=0\nfor i in range(n):\n if str1[i]>str2[i]:\n print(\"1\")\n break\n elif str1[i]<str2[i]:\n print(\"-1\")\n break\n else:\n count=count+1\n continue\nif count==n:\n print(\"0\")\n", "string_one = input().lower()\r\nstring_two = input().lower()\r\nif string_one < string_two:\r\n print(\"-1\")\r\nelif string_one > string_two:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "str1 = input()\r\nstr2 = input()\r\nstr1 = str1.lower()\r\nstr2 = str2.lower()\r\nif str1 > str2:\r\n print(1)\r\nelif str1 == str2:\r\n print(0)\r\nelse:\r\n print(-1)", "str1 = input().lower()\r\nstr2 = input().lower()\r\nn = len(str1)\r\na = 0\r\nfor i in range(n):\r\n if str1[i] > str2[i]:\r\n a = 1\r\n break\r\n elif str1[i] < str2[i]:\r\n a = -1\r\n break\r\n else:\r\n a = 0\r\nprint(a)\r\n", "a = input()\r\nb = input()\r\na = a.lower()\r\nb = b.lower()\r\n\r\nif a == b:\r\n print(0)\r\nelif a > b:\r\n print(1)\r\nelse:\r\n print(-1)", "x=[input().lower() for i in range(2)];y=sorted(x)\r\nprint(0 if x[0]==x[1] else -1 if x==y else 1)", "def compare_strings(str1, str2):\r\n str1_lower = str1.lower()\r\n str2_lower = str2.lower()\r\n\r\n if str1_lower < str2_lower:\r\n return -1\r\n elif str1_lower > str2_lower:\r\n return 1\r\n else:\r\n return 0\r\n\r\n# Read input\r\nstring1 = input().strip()\r\nstring2 = input().strip()\r\n\r\n# Compare the strings and output the result\r\nresult = compare_strings(string1, string2)\r\nprint(result)\r\n", "a,b = input(), input()\r\na,b = a.lower(), b.lower()\r\nif a > b:\r\n\tprint(\"1\")\r\nelif a < b:\r\n\tprint(\"-1\")\r\nelse: print(\"0\")", "a=input()\r\nb=input()\r\nif a.lower() < b.lower():\r\n print(\"-1\")\r\nif a.lower()>b.lower():\r\n print(\"1\")\r\nif a.lower() == b.lower():\r\n print(\"0\")", "a=input().lower()\r\nb=input().lower()\r\n\r\nif(a<b):\r\n print(-1)\r\nelif(b<a):\r\n print(1)\r\nelse:\r\n print(0)\r\n", "i=input;s=i().lower();ss=i().lower();print((s>ss)-(s<ss))", "def com(a,b):\r\n return (a>=b) - (a<=b)\r\nx=str(input().lower())\r\ny=str(input().lower())\r\nprint(com(x,y))", "string1 = str(input())\r\nstring2 = str(input())\r\n\r\nstring1 = string1.lower() \r\nstring2 = string2.lower()\r\n\r\nif string1 > string2:\r\n print(\"1\")\r\nif string1 < string2:\r\n print(\"-1\")\r\nif string1 == string2:\r\n print(\"0\")\r\n", "cadena1 = str(input(\"\"))\r\ncadena2 = str(input(\"\"))\r\n\r\ncadena1 = cadena1.lower()\r\ncadena2 = cadena2.lower()\r\n\r\nif cadena1 == cadena2:\r\n print(\"0\")\r\nelif cadena1 < cadena2:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")\r\n", "#游敬恩 2300012555\r\nlist1 = str.upper(input())\r\nlist2 = str.upper(input())\r\nl = len(list1)\r\ns1 = 0\r\ns2 = 0\r\na = 0\r\nfor i in range(l):\r\n if a == 0:\r\n s1 = ord(list1[i])\r\n s2 = ord(list2[i])\r\n if s1 == s2:\r\n pass\r\n elif s1 > s2:\r\n a = 1\r\n elif s1 < s2:\r\n a = -1\r\n else:\r\n pass\r\nprint(a)", "str1 = input().lower() # Taking a string as input from the user, converting the given string into lowercase and returns the string.\r\nstr2 = input().lower() # Taking a string as input from the user, converting the given string into lowercase and returns the string.\r\nresult = ((str1>str2) - (str1<str2))\r\nprint(result)", "import sys\r\ndef I(): return int(sys.stdin.readline().rstrip())\r\ndef LI(): return list(map(int, sys.stdin.readline().rstrip().split()))\r\ndef MI(): return map(int, sys.stdin.readline().rstrip().split())\r\ndef SI(): return sys.stdin.readline().rstrip()\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\n\r\ndef main():\r\n s = SI().lower()\r\n t = SI().lower()\r\n\r\n if s < t:\r\n print(-1)\r\n elif s > t:\r\n print(1)\r\n else:\r\n print(0)\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "s1 = input()\r\ns2 = input()\r\nx = s1.upper()\r\ny = s2.upper()\r\nfor i in range(0, len(x)):\r\n if x[i] > y[i]:\r\n print(1)\r\n break\r\n elif x[i] < y[i]:\r\n print(-1)\r\n break\r\nif x == y:\r\n print(0)", "#黄靖涵 23000986604 工学院 2023 秋天\r\n\r\nstr_1=input().upper()\r\nstr_2=input().upper()\r\n\r\nif str_1 > str_2:\r\n print('1')\r\nelif str_1 < str_2:\r\n print('-1')\r\nelse:\r\n print('0')", "line1 = input().lower()\r\nline2 = input().lower()\r\n\r\ndef func(line1, line2):\r\n for i in range(len(line1)):\r\n if ord(line1[i]) > ord(line2[i]):\r\n return 1\r\n elif ord(line1[i]) < ord(line2[i]):\r\n return -1\r\n return 0\r\n\r\nprint(func(line1,line2))\r\n", "s1 = input().lower()\ns2 = input().lower()\nprinted = False\n\n# idx = index\nfor idx in range(0,len(s1)):\n if s1[idx] > s2[idx]:\n print(\"1\")\n printed = True\n break\n elif s1[idx] < s2[idx]:\n print(\"-1\")\n printed = True\n break\n \nif printed == False:\n print(\"0\")\n \t\t \t \t\t\t \t \t \t \t \t\t\t", "str1 = input().lower()\r\nstr2= input().lower()\r\n\r\nif str1>str2:\r\n print(1)\r\nelif str2>str1:\r\n print(-1)\r\nelse:\r\n print(0)", "s1 = input().lower()\ns2 = input().lower()\n\nif s1 < s2:\n print(-1)\nelif s1 > s2:\n print(1)\nelse:\n print(0)\n \t\t\t \t \t \t \t\t \t\t", "string1 = str(input())\r\nstring2 = str(input())\r\nstring1 = string1.lower()\r\nstring2 = string2.lower()\r\nif string1 > string2:\r\n print(1)\r\nelif string2 > string1:\r\n print(-1)\r\nelse:\r\n print(0)\n# Tue Oct 10 2023 20:28:04 GMT+0300 (Moscow Standard Time)\n", "a=str(input())\r\nb=str(input())\r\nl=len(a)\r\nfor i in range(l):\r\n if ord(a[i])>=65 and ord(a[i])<=90:\r\n x=ord(a[i])+32\r\n else:\r\n x=ord(a[i])\r\n if ord(b[i])>=65 and ord(b[i])<=90:\r\n y=ord(b[i])+32\r\n else:\r\n y=ord(b[i])\r\n if x<y:\r\n print(\"-1\")\r\n exit()\r\n if x>y:\r\n print(\"1\")\r\n exit()\r\nprint(0)\r\n\r\n", "s1=input().lower()\r\ns2=input().lower()\r\nif s1<s2:\r\n res=-1\r\nelif s1>s2:\r\n res=1\r\nelse:\r\n res=0\r\nprint(res)", "s1=input()\r\ns2=input()\r\ns1=s1.lower()\r\ns2=s2.lower()\r\nif s1<s2:\r\n print(-1)\r\nelif s2<s1:\r\n print(1)\r\nelse:\r\n print(0)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Sep 30 19:58:53 2023\r\n\r\n@author: liu\r\n\"\"\"\r\n\r\na = str.lower(input())\r\nb = str.lower(input())\r\nif a > b:\r\n print(1)\r\nelif a == b:\r\n print(0)\r\nelse:\r\n print(-1)", "x, y = input(), input()\r\n\r\nif (x.lower() > y.lower()):\r\n print(1)\r\nelif (x.lower() < y.lower()):\r\n print(-1)\r\nelse:\r\n print(0)", "x=input().lower()\r\ny=input().lower()\r\n\r\n\r\nif x>y:\r\n print(\"1\")\r\nelif x<y:\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")", "s1 = input().upper()\r\ns2 = input().upper()\r\nif s1 < s2:\r\n print(-1)\r\nif s1>s2:\r\n print(1)\r\nif s1==s2:\r\n print(0)", "gift1 = input().lower()\r\ngift2 = input().lower()\r\n\r\nif gift1 == gift2:\r\n print(\"0\")\r\n\r\nelif gift1 > gift2:\r\n print(\"1\")\r\n\r\nelse:\r\n print(\"-1\")", "def compare_strings_lexicographically(str1, str2):\r\n # Convert the strings to lowercase for case-insensitive comparison\r\n str1 = str1.lower()\r\n str2 = str2.lower()\r\n\r\n if str1 < str2:\r\n return -1\r\n elif str1 > str2:\r\n return 1\r\n else:\r\n return 0\r\n\r\n# Input\r\nstring1 = input().strip()\r\nstring2 = input().strip()\r\n\r\n# Perform comparison and print the result\r\nresult = compare_strings_lexicographically(string1, string2)\r\nprint(result)\r\n", "word1 = str(input()).lower()\r\nword2 = str(input()).lower()\r\n\r\nif word1 < word2:\r\n print(\"-1\")\r\nelif word1 > word2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n\r\n\r\n\r\n\r\n\r\n", "str_1 = input().casefold()\r\nstr_2 = input().casefold()\r\n\r\nif str_1 < str_2:\r\n print(-1)\r\nelif str_2 < str_1:\r\n print(1)\r\nelse:\r\n print(0)", "#112A. Petya and Strings\r\nfirst=input().lower()\r\nsecond=input().lower()\r\nif first==second:\r\n print(0)\r\nelif first>second:\r\n print(1)\r\nelse:\r\n print(-1)", "al = \"abcdefghijklmnopqrstuvwxyz\"\r\nal2 = al.upper()\r\nn = input()\r\nsum = 0\r\nn2 = input()\r\nfor i in range(len(n)):\r\n if n[i] in al:\r\n index1 = al.index(n[i])\r\n else:\r\n index1 = al2.index(n[i])\r\n if n2[i] in al:\r\n index2 = al.index(n2[i])\r\n else:\r\n index2 = al2.index(n2[i])\r\n if index1 < index2:\r\n print(-1)\r\n sum = 1\r\n break\r\n elif index1 > index2:\r\n print(1)\r\n sum = 1\r\n break\r\n else:\r\n continue\r\nif sum == 0:\r\n print(0)\r\n", "p1 = input(\"\")\r\np2 = input(\"\")\r\nk1 = p1.lower()\r\nk2 = p2.lower()\r\nk = [k1, k2]\r\nl = sorted(k)\r\nif k2 == k1:\r\n r = 0\r\nelif l[0] == k1:\r\n r = -1\r\nelif l[1] == k1:\r\n r = 1\r\n\r\nprint(r)", "x=input()\r\ny=input()\r\na=x.lower()\r\nb=y.lower()\r\nif(a<b):\r\n print(\"-1\")\r\nelif(a>b):\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "#赵昱安 2200011450\r\nfirst=str(input()).lower()\r\nsecond=str(input()).lower()\r\nalphabet='abcdefghijklmnopqrstuvwxyz'\r\nanswer=0\r\nfor i in range(len(first)):\r\n if first[i]==second[i]:\r\n continue\r\n else:\r\n if alphabet.index(first[i])>alphabet.index(second[i]):\r\n answer=1\r\n else:\r\n answer=-1\r\n break\r\nprint(answer)", "n=input()\r\nm=input()\r\nn=n.lower()\r\nm=m.lower()\r\nif n == m:\r\n print(\"0\")\r\nelif n < m:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")", "x = str(input()).lower()\r\ny = str(input()).lower()\r\nif x < y:\r\n print(-1)\r\nelif x > y:\r\n print(1)\r\nelse:\r\n print(0)", "a1=input().lower()\na2=input().lower()\nif a1==a2:\n print(0)\nelif a1>a2:\n print(1)\nelse:\n print(-1)\n\t \t \t \t\t\t \t\t\t\t\t\t", "a=input()\nb=input()\nd=a.lower()\ne=b.lower()\nif(d>e):\n print('1')\nelif(d<e):\n print('-1')\nelse:\n print('0')", "a=input().lower()\r\nb=input().lower()\r\nf1=0\r\nf2=0\r\nfor i in range(len(a)):\r\n\tif ord(a[i]) > ord(b[i]):\r\n\t\tprint(1)\r\n\t\tf1=1\r\n\t\tbreak\r\n\telif ord(a[i])<ord(b[i]):\r\n\t\tprint(-1)\r\n\t\tf1=1\r\n\t\tbreak\r\nif not f1:\r\n\tprint(0)\r\n\t", "# I'm The King Of Pirates\r\na1 = map(str,input().split())\r\na1 = ''.join(a1).lower()\r\n\r\na2 = map(str,input().split())\r\na2 = ''.join(a2).lower()\r\n\r\n#print(a1)\r\n#print(a2)\r\n\r\nif a1 == a2 :\r\n print(0)\r\nelif a1 < a2 :\r\n print(-1)\r\nelse:\r\n print(1)", "a=input(\"\")\r\nb=input(\"\")\r\nq=a.lower()\r\nz=b.lower()\r\nfor i in range(len(q)):\r\n if q[i]>z[i]:\r\n a=1\r\n break\r\n elif q[i]<z[i]:\r\n a=-1\r\n break\r\n else:\r\n a=0\r\nprint(a) ", "i=input;a=i().lower();b=i().lower() \r\nprint((a>b)-(a<b))", "u=input()\r\nv=input()\r\nu=u.lower()\r\nv=v.lower()\r\ncnt=0\r\nif u>v:\r\n print(1)\r\nelif u<v:\r\n print(-1)\r\nelif u==v:\r\n print(0)", "first = input().lower()\r\nsecond = input().lower()\r\n\r\nif first == second:\r\n print(0)\r\nelif min(first, second) == first:\r\n print(-1)\r\nelse:\r\n print(1)\r\n", "s=input().lower()\r\nt=input().lower()\r\nprint((s>t)-(s<t))", "str1=input().lower()\nstr2=input().lower()\nif str1<str2:\n print(-1)\nelif str2<str1:\n print(1)\nelse:\n print(0)\n\n\n\n\n", "parola1 = input().lower()\r\nparola2 = input().lower()\r\n\r\nif parola1 == parola2:\r\n print(0)\r\nelif parola1 < parola2:\r\n print(-1)\r\nelif parola1 > parola2:\r\n print(1)", "str1=input()\r\nstr2=input()\r\nstr3=str1.lower()\r\nstr4=str2.lower()\r\nif str3>str4:\r\n print(\"1\")\r\nelif str3<str4:\r\n print(\"-1\")\r\nelse:\r\n print(\"0\")\r\n \r\n", "def compare_strings(str1,str2):\r\n str1=str1.lower()\r\n str2=str2.lower()\r\n if str1<str2:\r\n return-1\r\n elif str1>str2:\r\n return 1\r\n else:\r\n return 0\r\nstr1=input()\r\nstr2=input()\r\nresult=compare_strings(str1,str2)\r\nprint(result)", "x1=input().lower()\r\nx2=input().lower()\r\nif x1<x2:\r\n print(-1)\r\nelif x1>x2:\r\n print(1)\r\nelse:\r\n print(0)", "'''\r\nauthor 罗景轩 2300012610\r\n'''\r\nA = input().lower()\r\nB = input().lower()\r\nif A == B:\r\n print(\"0\")\r\nelif A < B:\r\n print(\"-1\")\r\nelse :\r\n print(\"1\")\r\n", "s1 = input(\"\")\r\ns2 = input(\"\")\r\n\r\nif s1.upper() == s2.upper():\r\n print(\"0\")\r\nelif s1.upper() > s2.upper():\r\n print(\"1\")\r\nelif s1.upper() < s2.upper():\r\n print(\"-1\")", "m=input().upper()\r\nn=input().upper()\r\nif m<n:\r\n print(-1)\r\nelif m>n:\r\n print(1)\r\nelse:\r\n print(0) ", "n1 = input()\r\nn2 = input()\r\nif n1.lower() < n2.lower():\r\n print(-1)\r\nelif n1.lower() > n2.lower():\r\n print(1)\r\nelse:\r\n print(0)", "str1 = input().lower()\r\nstr2 = input().lower()\r\nif (str1 < str2):\r\n\tprint(-1)\r\nelif (str1 > str2):\r\n\tprint(1)\r\nelse:\r\n\tprint(0)", "A=input().lower()\r\nB=input().lower()\r\nif A<B:\r\n k=-1\r\nelif A==B:\r\n k=0\r\nelif A>B:\r\n k=1\r\nprint(k)", "s1=input()\ns2=input()\ns1=s1.lower()\ns2=s2.lower()\n\nif s1==s2:\n print(0)\n\nelse:\n for i in range(0,len(s1),1):\n if s1[i]<s2[i]:\n print(-1)\n break\n if s2[i]<s1[i]:\n print(1)\n break\n# Bassem\n\n \t\t \t \t\t \t \t \t \t \t\t\t\t \t \t\n \t \t \t\t\t \t \t \t \t \t \t\t\t", "alphabet = \"abcdefghijklmnopqrstuvwxyz\"\r\n\r\ndef cycle():\r\n for i in range(len(line_1)):\r\n if line_1[i].lower() == line_2[i].lower():\r\n continue\r\n if alphabet.index(line_1[i].lower()) > alphabet.index(line_2[i].lower()):\r\n return 1\r\n else:\r\n return -1\r\n return 0\r\n\r\nline_1 = input()\r\nline_2 = input()\r\n\r\nprint(cycle())", "a = input()\r\nb = input()\r\nif (a.isalpha() and b.isalpha()):\r\n if (a.lower() > b.lower()):\r\n print(1)\r\n elif (a.lower() < b.lower()):\r\n print(-1)\r\n else:\r\n print(0)\r\n", "\r\ndef comparison(str1, str2):\r\n for i in range(len(str1)):\r\n if(str1[i] != str2[i]):\r\n if(ord(str1[i])<ord(str2[i])):\r\n return -1\r\n elif(ord(str1[i]) > ord(str2[i])):\r\n return 1\r\n return 0\r\nstr1 = list(input().lower())\r\nstr2 = list(input().lower())\r\n\r\nprint(comparison(str1, str2))", "# Input\nstring1 = input().strip().lower()\nstring2 = input().strip().lower()\n\n# Compare the strings lexicographically\nif string1 < string2:\n print(\"-1\")\nelif string1 > string2:\n print(\"1\")\nelse:\n print(\"0\")\n \t\t \t\t\t \t \t\t\t\t\t \t\t\t \t \t\t", "a = input().upper()\r\nb = input().upper()\r\nfor i in range(len(a)):\r\n if ord(a[i]) > ord(b[i]):\r\n print(1)\r\n break\r\n elif ord(a[i]) < ord(b[i]):\r\n print(-1)\r\n break\r\n elif i == len(a)-1:\r\n print(0)\r\n#\r\n", "str1=input()\r\nstr2=input()\r\nstr1=str1.lower()\r\nstr2=str2.lower()\r\nj=0\r\nfor i in str1:\r\n if i>str2[j]:\r\n print(1)\r\n break\r\n elif i<str2[j]:\r\n print(-1)\r\n break\r\n else :\r\n j+=1\r\nif j==len(str1):\r\n print(0)", "def cmp():\r\n a = input().lower()\r\n b = input().lower()\r\n\r\n\r\n if (a>b):\r\n print(1)\r\n elif (a<b):\r\n print(-1)\r\n else:\r\n print(0)\r\n\r\ncmp()", "a = input().lower()\r\nb = input().lower()\r\n\r\nif a < b:\r\n print(\"-1\")\r\nelif a > b:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "s1 = input()\r\ns2 = input()\r\n\r\nres = 0\r\n\r\nfor i in range(len(s1)):\r\n c1, c2 = s1[i].lower(), s2[i].lower()\r\n \r\n if c1 > c2:\r\n res = 1\r\n break\r\n elif c1 < c2:\r\n res = -1\r\n break\r\n\r\nprint(res)", "a = input()\r\nb = input()\r\nans = False\r\nfor i in range(len(a)):\r\n if a[i].lower() > b[i].lower(): \r\n print(1)\r\n ans =True\r\n break\r\n elif a[i].lower() < b[i].lower():\r\n print(-1)\r\n ans=True\r\n break\r\nif not ans:\r\n print(0)", "s1=input()\r\ns2=input()\r\nl1=s1.lower()\r\nl2=s2.lower()\r\nif l1<l2:\r\n print(-1)\r\nelif l1==l2:\r\n print(0)\r\nelse:\r\n print(1)", "import sys\r\n\r\ndef inp():\r\n return int(input())\r\n\r\n\r\ndef inlt():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef insr():\r\n return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\ndef main():\r\n str1 = insr().lower()\r\n str2 = insr().lower()\r\n \r\n for chr1, chr2 in zip(str1, str2):\r\n if chr1 < chr2:\r\n out(-1)\r\n break\r\n elif chr1 > chr2:\r\n out(1)\r\n break\r\n if str1 == str2:\r\n out(0) \r\nif __name__ == \"__main__\":\r\n main()\r\n", "s1= input().lower()\r\ns2= input().lower()\r\nif s1==s2:\r\n print(\"0\")\r\nelif s2>s1:\r\n print(\"-1\")\r\nelse:\r\n print(\"1\")\r\n", "sentence1 = input().lower()\r\nsentence2 = input().lower()\r\n\r\nlist1 = sorted(sentence1.split())\r\nlist2 = sorted(sentence2.split())\r\n\r\nif list2 > list1:\r\n print(-1)\r\nelif list2 < list1:\r\n print(1)\r\nelif list2 == list1:\r\n print(0)", "x=input()\r\ny=input()\r\nx=x.lower()\r\ny=y.lower()\r\nif x==y:\r\n print(\"0\")\r\nelif x>y:\r\n print(\"1\")\r\nelse:\r\n print(\"-1\")", "string1 = input().lower()\r\nstring2 = input().lower()\r\n\r\nif (len(string1) >= 1 and len(string1) <= 100 and len(string2) >= 1 and len(string2) <= 100):\r\n if string1 < string2:\r\n print(-1)\r\n elif string2 < string1:\r\n print(1)\r\n else:\r\n print(0)", "A = input().lower()\r\nB = input().lower()\r\n\r\nresult = 0\r\n\r\nfor i in range(min(len(A), len(B))):\r\n if A[i] < B[i]:\r\n result = -1\r\n break\r\n elif A[i] > B[i]:\r\n result = 1\r\n break\r\n\r\nif result == 0:\r\n result = -1 if len(A) < len(B) else (1 if len(A) > len(B) else 0)\r\n\r\nprint(result)\r\n", "n = input().lower()\r\nm = input().lower()\r\n\r\ni = 0\r\nwhile True:\r\n if ord(n[i]) > ord(m[i]):\r\n print(1)\r\n break\r\n elif ord(n[i]) < ord(m[i]):\r\n print(-1)\r\n break\r\n elif ord(n[i]) == ord(m[i]) and i == len(n)-1:\r\n print(0)\r\n break\r\n i += 1", "a=input().lower()\nb=input().lower()\nif a>b:\n print(1)\nelif a<b:\n print(-1)\nelse:\n print(0)", "t = 1\r\n# t = int(input())\r\nwhile bool(t):\r\n a = input()\r\n b = input()\r\n\r\n a = a.lower()\r\n b = b.lower()\r\n\r\n if a == b:\r\n print(0)\r\n elif a < b:\r\n print(-1)\r\n else:\r\n print(1)\r\n\r\n t -= 1\r\n", "a=input(\"\").lower()\r\nb=input(\"\").lower()\r\nf=0\r\nfor i in range(len(a)):\r\n if ord(a[i])>ord(b[i]):\r\n f=1\r\n break\r\n elif ord(a[i])<ord(b[i]):\r\n f=-1\r\n break\r\n else:\r\n f=0\r\nprint(f)", "s1=str(input())\r\ns2=str(input())\r\ns3=s1.lower()\r\ns4=s2.lower()\r\nif s3<s4 :\r\n print(\"-1\")\r\nif s3>s4 :\r\n print(\"1\")\r\nif s3==s4 :\r\n print(\"0\")", "a = str(input().lower())\r\nb = str(input().lower())\r\n\r\ncount=0\r\nfor i in range(0,len(a)):\r\n if a[i]>b[i]:\r\n count+=1\r\n break\r\n elif a[i]<b[i]:\r\n count-=1\r\n break\r\nprint(count)", "str1=input().lower()\nstr2=input().lower()\nprint((str1>str2)-(str1<str2))\n\n\t \t\t \t\t \t\t \t \t \t", "str1, str2 = input().lower(), input().lower()\r\nprint((str1 > str2) - (str1 < str2))", "firstWord = input().lower()\r\nsecondWord = input().lower()\r\n\r\nif firstWord > secondWord:\r\n print(1)\r\nelif firstWord < secondWord:\r\n print(-1)\r\nelse:\r\n print(0)", "a = input()\r\nb = input()\r\na = a.lower()\r\nb= b.lower()\r\nfor i in range(0,len(a)):\r\n if ord(a[i])==ord(b[i]):\r\n continue\r\n elif ord(a[i])>ord(b[i]):\r\n print(1)\r\n break\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(0)", "s1 = input().lower()\r\ns2 = input().lower()\r\nans=0\r\nfor i in range(0,len(s1)):\r\n if s1[i]>s2[i]:\r\n ans=1\r\n break\r\n elif s1[i]<s2[i]:\r\n ans=-1\r\n break\r\n else:\r\n ans=0 \r\nprint(ans)", "print((lambda x,y: 0 if x==y else 1 if x>y else -1)(input().lower(),input().lower()))", "first = input()\r\nsecond = input()\r\n\r\nfirst = first.lower()\r\nsecond = second.lower()\r\n\r\nif first < second:\r\n print(\"-1\")\r\nelif second < first:\r\n print(\"1\")\r\nelif second == first:\r\n print(\"0\")", "import sys\r\nimport math\r\nfrom os import path\r\ndef input():\r\n return sys.stdin.readline().strip()\r\ndef intl():\r\n return(list(map(int,input().split())))\r\ndef iinput():\r\n return(int(input()))\r\ndef main():\r\n f = input().lower()\r\n s = input().lower()\r\n b = f > s\r\n c = s > f\r\n if b and not c:\r\n print(1)\r\n elif not b and c:\r\n print(-1)\r\n else:\r\n print(0)\r\n\r\nif __name__ == \"__main__\":\r\n if(path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\n main()", "def petya(a, b):\r\n return (a >= b) - (a <= b)\r\n\r\na = input()\r\nb = input()\r\na1 = a.lower()\r\nb1 = b.lower()\r\n\r\nprint(petya(a1, b1))", "a= input().lower()\r\nb= input().lower()\r\n\r\nfor i in range(0,len(a)):\r\n if a==b:\r\n print(0)\r\n break\r\n else:\r\n if ord(a[i])>ord(b[i]):\r\n print(1)\r\n break\r\n elif ord(a[i])<ord(b[i]):\r\n print(-1)\r\n break", "a=str(input())\r\nb=str(input())\r\nc=a.lower()\r\nd=b.lower()\r\nif c<d:\r\n print(-1)\r\nelif c>d:\r\n print(1)\r\nelse:\r\n print(0)", "str=input()\r\ns=input()\r\nst=str.lower()\r\nns=s.lower()\r\nn=len(st)\r\nflag=0\r\nc=0\r\nfor i in range(0,n):\r\n if(ord(ns[i])>(ord(st[i]))):\r\n print(\"-1\")\r\n flag=1\r\n break\r\n elif(ord(ns[i])<(ord(st[i]))):\r\n print(\"1\")\r\n flag=1\r\n break\r\n else:\r\n c=c+1\r\nif(c==n):\r\n print(\"0\")", "def main():\r\n\r\n word1 = input().upper()\r\n word2 = input().upper()\r\n\r\n length = len(word1)\r\n\r\n for i in range(length):\r\n if (word1[i] < word2[i]):\r\n print(-1)\r\n return \r\n elif (word1[i] > word2[i]):\r\n print(1)\r\n return \r\n print(0)\r\n return \r\n\r\n\r\nmain()\r\n", "s1=input()\r\ns2=input()\r\ns1=s1.lower()\r\ns2=s2.lower()\r\nif s1==s2:\r\n print(0)\r\nelif s1<s2:\r\n print(-1)\r\nelse:\r\n print(1)", "a = input()\nb = input()\nif a.lower() == b.lower():\n print(0)\nelif a.lower() > b.lower():\n print(1)\nelse:\n print(-1)\n", "l=[]\r\na=input()\r\na=a.lower()\r\nl.append(a)\r\nb=input()\r\nb=b.lower()\r\nl.append(b)\r\nl.sort()\r\nif l[0]==l[1]:\r\n print('0')\r\nelif l[0]==a:\r\n print('-1')\r\nelif l[0]==b:\r\n print('1')", "a,b=input().lower(),input().lower();print((a>b)-(a<b))", "# Read two lines\r\na1 = input().lower()\r\na2 = input().lower()\r\n\r\n# Compare strings and print the result\r\nif a1 < a2:\r\n print(\"-1\")\r\nelif a1 > a2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")\r\n", "import string\r\n\r\ndef arrangeStrings(str1, str2):\r\n\r\n for a, b in zip(str1.lower(),str2.lower()):\r\n idxA = string.ascii_lowercase.index(a)\r\n idxB = string.ascii_lowercase.index(b)\r\n # print(f\"Index of A: {str(idxA)} \\n Index of B: {str(idxB)}\")\r\n if a == b:\r\n # print(\"Iguales\")\r\n continue\r\n elif max(idxA, idxB) == idxA:\r\n # print(\"Str 1 goes before Str2\")\r\n return 1\r\n else:\r\n # print(f\"Str 2 goes before Str1\")\r\n return -1\r\n \r\n return 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n m = input()\r\n n = input()\r\n x = arrangeStrings(m, n)\r\n print(x)", "a=[ord(i.lower()) for i in list(input())]\r\nb=[ord(i.lower()) for i in list(input())]\r\nmatch=0\r\n\r\nn=len(a)\r\n\r\nfor i in range(n):\r\n if a[i]==b[i]:\r\n continue\r\n elif a[i]<b[i]:\r\n match=-1\r\n break\r\n elif a[i]>b[i]:\r\n match=1\r\n break\r\n \r\nprint(match)", "str1 = input().lower()\r\nstr2 = input().lower()\r\nif str1 < str2:\r\n print(\"-1\")\r\nelif str1 > str2:\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "#赵语涵2300012254\r\nstr_1 = input().lower()\r\nstr_2 = input().lower()\r\nx = 0\r\nfor i in range(len(str_1)):\r\n if str_1[i] == str_2[i]:\r\n continue\r\n if str_1[i] > str_2[i]:\r\n x = 1\r\n break\r\n if str_1[i] < str_2[i]:\r\n x = -1\r\n break\r\nprint(x)", "str1 = input().lower()\r\nstr2 = input().lower()\r\n\r\nif str1>str2:\r\n print(1)\r\nelif str1<str2:\r\n print(-1)\r\nelif str1 == str2:\r\n print(0)", "String_1, String_2 = input(), input()\r\nif String_1.lower() > String_2.lower():\r\n print('1')\r\nelif String_1.lower() < String_2.lower():\r\n print('-1')\r\nelse:\r\n print('0')", "s1=input().upper()\r\ns2=input().upper()\r\nif(s1==s2): print(\"0\")\r\nelif(s1>s2): print(\"1\")\r\nelif(s1<s2): print(\"-1\")", "str1 = str(input()).lower()\r\nstr2 = str(input()).lower( )\r\nif ( str1 < str2 ):\r\n print(\"-1\")\r\nelif ( str1 > str2):\r\n print(\"1\")\r\nelse:\r\n print(\"0\")", "char1=input()\r\nchar2=input()\r\nX=char1.lower()\r\nY=char2.lower()\r\nb=0\r\nfor i in range(len(char1)):\r\n if( X[i] != Y[i] ):\r\n Xx=ord(X[i])\r\n Yx=ord(Y[i])\r\n \r\n if(Xx>Yx):\r\n b=1\r\n elif(Xx<Yx):\r\n b=-1\r\n break\r\nprint(b)\r\n\r\n\r\n ", "'''c = [] \r\nfor i in range(5): \r\n c.append(list(map(int, input().split())))\r\n\r\nfor i in range(5): \r\n for j in range(5): \r\n if c[i][j] == 1: \r\n a = i \r\n b = j \r\n\r\nс = abs(a-2) + abs(b-2) \r\nprint(с)'''\r\n\r\na = input().lower() \r\nb = input().lower()\r\nif a != b: \r\n if a < b: \r\n print(-1) \r\n else: \r\n print(1) \r\nelse: \r\n print(0)\r\n\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef find(x):\r\n while Group[x] != x:\r\n x=Group[x]\r\n return x\r\n\r\ndef Union(x,y):\r\n if find(x) != find(y):\r\n if Nodes[find(x)] < Nodes[find(y)]:\r\n \r\n Nodes[find(y)] += Nodes[find(x)]\r\n Nodes[find(x)] = 0\r\n Group[find(x)] = find(y)\r\n \r\n else:\r\n Nodes[find(x)] += Nodes[find(y)]\r\n Nodes[find(y)] = 0\r\n Group[find(y)] = find(x)\r\n\r\ndef calc(i,j,x):\r\n\r\n flag=1\r\n\r\n if i+x<n and j+x<m:\r\n for k in range(x+1):\r\n if MAP[i+k][j]==\"0\":\r\n flag=0\r\n break\r\n\r\n if MAP[i][j+k]==\"0\":\r\n flag=0\r\n break\r\n\r\n if MAP[i+k][j+x]==\"0\":\r\n flag=0\r\n break\r\n\r\n if MAP[i+x][j+k]==\"0\":\r\n flag=0\r\n break\r\n else:\r\n flag=0\r\n\r\n if flag==1:\r\n return True\r\n\r\n if j-x>=0 and j+x<m and i+x+x<n:\r\n for k in range(x+1):\r\n if MAP[i+k][j+k]==\"0\":\r\n return False\r\n if MAP[i+k][j-k]==\"0\":\r\n return False\r\n if MAP[i+2*x-k][j+k]==\"0\":\r\n return False\r\n if MAP[i+2*x-k][j-k]==\"0\":\r\n return False\r\n\r\n return True\r\n\r\n else:\r\n return False\r\n\r\n \r\n \r\n\r\nLANS=[]\r\nt=int(input())\r\nfor tests in range(t):\r\n n,m=map(int,input().split())\r\n MAP=[input().strip() for i in range(n)]\r\n\r\n Group = [i for i in range(n*m)] # グループ分け\r\n Nodes = [1]*(n*m) # 各グループのノードの数\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if MAP[i][j]==\"1\":\r\n if i+1<n and MAP[i+1][j]==\"1\":\r\n Union(i*m+j,(i+1)*m+j)\r\n \r\n if j+1<m and MAP[i][j+1]==\"1\":\r\n Union(i*m+j,i*m+j+1)\r\n\r\n if i+1<n and j+1<m and MAP[i+1][j+1]==\"1\":\r\n Union(i*m+j,(i+1)*m+j+1)\r\n\r\n if i+1<n and j-1>=0 and MAP[i+1][j-1]==\"1\":\r\n Union(i*m+j,(i+1)*m+j-1)\r\n\r\n USE=[0]*(n*m)\r\n ANS=0\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if MAP[i][j]==\"1\" and USE[find(i*m+j)]==0:\r\n USE[find(i*m+j)]=1\r\n\r\n if Nodes[find(i*m+j)]%4==0:\r\n x=Nodes[find(i*m+j)]//4\r\n\r\n if calc(i,j,x)==True:\r\n ANS+=1\r\n LANS.append(ANS)\r\n\r\nprint(\"\\n\".join(map(str,LANS)))\r\n\r\n \r\n \r\n\r\n \r\n" ]

[ "\n\nn = int(input())\n\nA = [int(x) for x in input().split()]\n\nm = min(A)\n\nA = [i for i, x in enumerate(A) if x == m]\n\nprint(min([A[i + 1] - A[i] for i in range(len(A) - 1)]))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\ni=a.index(m)\r\nb=[]\r\n\r\nfor j in range(i+1,n):\r\n if a[j]==m:\r\n b.append(j-i)\r\n i=j\r\nprint(min(b))", "N = int(input())\r\na= []\r\nline = input().strip().split()\r\nfor j in range(N):\r\n a.append(int(line[j]))\r\n\r\nm = min(a)\r\nml = N\r\nisFirst = True\r\nfirst, sec = 0,0\r\nfor i in range(N):\r\n if m == a[i]:\r\n if isFirst:\r\n first = i\r\n sec = i\r\n isFirst = False\r\n else:\r\n first = sec\r\n sec = i\r\n ml = min(ml, sec-first) \r\n \r\nprint(ml)", "from sys import stdin\ndef solve(n,l):\n\tocur = {}\n\tmin__ = float('inf')\n\tfor i in range(n):\n\t\tif ocur.get(l[i])!=None:\n\t\t\tocur[l[i]].append(i)\n\t\telse:\n\t\t\tmin__ = min(min__,l[i])\n\t\t\tocur[l[i]] = [i]\n\tmin_arr = ocur.get(min__)\n\tans = float('inf')\n\tfor j in range(len(min_arr)-1):\n\t\tans = min(ans,min_arr[j+1]-min_arr[j])\n\treturn ans\n\n\ndef main():\n\tn = int(stdin.readline().strip())\n\tl = [int(x) for x in stdin.readline().split()]\n\tprint(solve (n,l))\n\nmain()\n\t\t\t\t \t \t \t\t \t \t \t\t\t\t\t \t\t \t", "\"\"\" 616C \"\"\"\r\n\"\"\" 1152B \"\"\"\r\nimport math\r\n# import sys\r\ndef main():\r\n\t# n ,m= map(int,input().split())\r\n\t# arr = list(map(int,input().split()))\r\n\t# b = list(map(int,input().split()))\r\n\t# n = int(input())\r\n\t# string = str(input())\r\n\tn = int(input())\r\n\ta = list(map(int,input().split()))\r\n\tmn = min(a)\r\n\tarr = []\r\n\tfor i in range(n):\r\n\t\tif(a[i]==mn):\r\n\t\t\tarr.append(i+1)\r\n\tans = 1e10\r\n\tfor i in range(1,len(arr)):\r\n\t\tans = min(arr[i]-arr[i-1],ans)\r\n\tprint(ans)\r\n\treturn\r\n\r\nmain()\r\n# def test():\r\n# \tt = int(input())\r\n# \twhile t:\r\n# \t\tmain()\r\n# \t\tt-=1\r\n# test()", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\npos = []\r\nfor i in range(n):\r\n if a[i] == m:\r\n pos.append(i)\r\nx = 99999999999\r\n\r\nfor i in range(len(pos)-1):\r\n if x>min(x ,abs(pos[i+1]-pos[i])):\r\n x = abs(pos[i+1]-pos[i])\r\nprint(x)", "n = int(input())\r\n\r\narr = list(map(int,input().split()))\r\nk = min(arr)\r\na = []\r\n#ans = 1000000\r\n\r\nfor i in range(n):\r\n if arr[i] == k :\r\n a.append(i)\r\n\r\nans = []\r\nfor i in range(len(a) - 1):\r\n x = a[i + 1] - a[i]\r\n ans.append(x)\r\n\r\nprint(min(ans))\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmn = min(a)\r\nx = []\r\nfor i in range(n):\r\n if a[i] == mn: x.append(i)\r\nprint(min([x[i]-x[i-1] for i in range(1, len(x))]))", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\nn = int(input())\na = list(rint())\nb = []\nfor i in range(n):\n b.append([a[i], i])\nb.sort()\n\nmin_val = b[0][0]\nc = []\nfor i in range(n):\n if b[i][0] == min_val:\n c.append(b[i][1])\n\nmin_dist = 10**100\nfor i in range(len(c)-1):\n i1 = c[i]\n i2 = c[i+1]\n dist = c[i+1] - c[i]\n if dist < min_dist:\n min_dist = dist\n\nprint(min_dist)\n", "def getinput():\n return [int(x) for x in input().strip().split()]\n\nn=int(input())\n\narr=getinput()\n\nval=min(arr)\n\nind=[]\nfor i in range(n):\n if(arr[i]==val): ind.append(i)\n \nans=n+1\nfor i in range(1, len(ind)): ans=min(ans, ind[i]-ind[i-1])\nprint (ans)", "n = int(input())\na = list(map(int,input().split()))\nM = min(a)\nind = list()\ntol = 0\nfor i in range(n):\n if a[i] == M:\n ind.append(i);tol+=1\nma = float('inf')\nfor i in range(tol-1):\n ma = min(ma, ind[i+1]-ind[i])\nprint(ma)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nmn=min(s)\r\nl1=[]\r\nfor i in range(n):\r\n if s[i]==mn:\r\n l1.append(i)\r\nl2=[]\r\nfor i in range(1,len(l1)):\r\n l2.append(l1[i]-l1[i-1])\r\nprint(min(l2))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\ns=[]\r\nfor i in range(n):\r\n if l[i]==m:\r\n s.append(i)\r\ns.sort()\r\nm=10**18\r\nfor i in range(1,len(s)):\r\n m=min(m,s[i]-s[i-1])\r\nprint(m)\r\n \r\n ", "input()\na = list(map(int, input().split()))\nam = min(a)\nd = [k for k,v in enumerate(a) if v == am]\nprint(min([d2 - d1 for d1, d2 in zip(d[:-1], d[1:])]))", "n=int(input())\r\nprev=-10**9\r\nans=-prev\r\nl=[int(x) for x in input().split()]\r\nminn=min(l)\r\nfor i in range(n):\r\n if l[i]==minn:\r\n ans=min(ans,i-prev)\r\n prev=i\r\nprint(ans)", "N = int(input())\n\nnumbers = list(zip(map(int, input().split()), range(N)))\n# print (numbers)\nleast = min([x[0] for x in numbers])\n# print (least)\nnumbers.sort(key=lambda x: x[1])\nnumbers.sort(key=lambda x: x[0])\nnum = list(filter(lambda x: x[0]==least, numbers))\nminimum_dist = len(numbers)\n# print (num)\nfor i in range(len(num)-1):\n\tx = num[i+1][1]-num[i][1]\n\t# print (x)\n\tif minimum_dist > x:\n\t\tminimum_dist = x\nprint (minimum_dist)\n\n", "n = int(input())\r\nnums = input().split()\r\ni = 0\r\nwhile i < n:\r\n nums[i] = int(nums[i])\r\n i += 1\r\ni = 0\r\nl = []\r\nmin_num = min(nums)\r\nwhile i < n:\r\n if nums[i] == min_num:\r\n l.append(i)\r\n i += 1\r\ni = 0\r\nlim = len(l)\r\nans = []\r\nwhile i < lim-1:\r\n ans.append(l[i+1]-l[i])\r\n i += 1\r\nprint(min(ans))", "n = int(input())\na = list(map(int,input().split()))\nmin = min(a)\np = -100000\ndis = 100000\nfor i in range(n) :\n if a[i] == min :\n if i - p < dis :\n dis = i - p\n p = i\nprint(dis)\n", "input()\r\narr = [int(i) for i in input().split()]\r\narrmin = min(arr)\r\nminpos = [i for i, item in enumerate(arr) if item == arrmin]\r\nprint(min(minpos[i+1]-minpos[i] for i in range(len(minpos)-1)))", "def 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\n\r\nfrom collections import defaultdict, deque, Counter\r\nfrom sys import exit\r\nimport math\r\nimport copy\r\nfrom bisect import bisect_right\r\n\r\nimport sys\r\nsys.setrecursionlimit(1000000)\r\nimport heapq\r\nINF = 10**10\r\n\r\ndef dijkstra(graph, start, n):\r\n h = []\r\n heapq.heappush(h, (0, start))\r\n costs = [INF for _ in range(n)]\r\n while h:\r\n cost, cur = heapq.heappop(h)\r\n if costs[cur] != INF:\r\n continue\r\n costs[cur] = cost\r\n for edge in graph[cur]:\r\n ecost, tgt = edge\r\n if costs[tgt] == INF:\r\n heapq.heappush(h, (cost + ecost, tgt))\r\n\r\n return costs\r\n\r\ndef main():\r\n n = getN()\r\n nums = getList()\r\n mn = min(nums)\r\n prev = -10000000000\r\n ans = 100000000000000\r\n\r\n for i, num in enumerate(nums):\r\n if num == mn:\r\n dist = i - prev\r\n if ans > dist:\r\n ans = dist\r\n # print(ans)\r\n prev = i\r\n\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmina = min(a)\r\ndef minrange(u):\r\n i = 0\r\n posa = []\r\n ans = []\r\n while i != u:\r\n if a[i] == mina:\r\n posa.append(i)\r\n i += 1\r\n for i in range(len(posa)-1):\r\n ans.append(posa[i+1] - posa[i])\r\n return min(ans)\r\nprint(minrange(n))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nm = 10**10\r\nfor x in a:\r\n if m >x:\r\n m = x\r\nind = []\r\n\r\nfor x in range(n):\r\n if a[x] == m:\r\n ind.append(x)\r\nmin1 = 10**10\r\nfor x in range(len(ind) - 1):\r\n if(ind[x+1]-ind[x] < min1):\r\n min1 = ind[x+1]-ind[x]\r\nprint(min1)\r\n \r\n \r\n \r\n", "if __name__ == '__main__':\n #\n arr_len = int(input())\n #\n arr = [int(x) for x in input().split(' ')]\n #\n min_num = min(arr)\n min_length = len(arr)\n #\n len_dict = dict()\n #\n\n for i in range(len(arr)):\n if arr[i] == min_num:\n if arr[i] not in len_dict.keys():\n len_dict[min_num] = i\n else:\n if i - len_dict[min_num] < min_length:\n min_length = i - len_dict[min_num]\n len_dict[min_num] = i\n print(min_length)\n\t \t \t \t\t\t\t \t \t\t\t \t\t", "from math import *\r\nfrom bisect import *\r\nfrom collections import Counter,defaultdict,deque\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\nfor _ in range(1):\r\n n=I()\r\n a=LI()\r\n b=min(a)\r\n c=-1;d=-1;ans=n\r\n for i in range(n):\r\n if c==-1 and b==a[i]:\r\n c=i\r\n elif d==-1 and b==a[i]:\r\n d=i\r\n elif b==a[i]:\r\n c=d;d=i\r\n if c>-1 and d>-1:\r\n ans=min(ans,d-c)\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n", "# problem name : Nearest Minimums\r\n# problem link : https://codeforces.com/problemset/problem/911/A\r\n# problem rating : 1100\r\n\r\nn=int(input())\r\na=list(map(int, input().split()))\r\nx=min(a)\r\nh=n+1\r\np=a.index(x)\r\n# print(p)\r\nfor i in range(p+1,n):\r\n if a[i]==x:\r\n # print(i,i-p)\r\n if i-p<h:\r\n h=i-p\r\n p=i\r\nprint(h)\r\n\r\n\r\n", "n = int(input())\r\narr=list(map(int,input().split()))\r\nminn = min(arr)\r\nindex = -1\r\nmin_id = 9999999;\r\nfor i in range(n):\r\n if arr[i] == minn:\r\n if index != -1:\r\n if min_id > abs(i-index):\r\n min_id = abs(i-index)\r\n index = i\r\nprint(min_id)\r\n", "m=int(input())\nl=list(map(int,input().split()))\np=min(l)\nb=[]\nj=10**9\nfor i in range(len(l)):\n if l[i]==p:\n b.append(i)\nfor i in range(len(b)-1):\n if b[i+1]-b[i]<j:\n j=b[i+1]-b[i]\nprint(j) \n", "n=int(input())\r\na=list(map(int,input().split()))\r\nh=min(a)\r\nm=[]\r\nfor i in range(n):\r\n if a[i]==h:\r\n m.append(i)\r\nmi=10**9\r\nfor i in range(len(m)-1): \r\n if mi>m[i+1]-m[i]:\r\n mi=m[i+1]-m[i]\r\nprint(mi)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=min(l)\r\nl1=[]\r\nfor i,j in enumerate(l):\r\n if j==x:\r\n l1.append(i)\r\nl2=[]\r\nfor i in range(len(l1)-1):\r\n l2.append(l1[i+1]-l1[i])\r\nprint(min(l2))\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmn = min(a)\r\na = [i for i, val in enumerate(a) if val == mn]\r\nmn = float(\"inf\")\r\nfor i in range(len(a) - 1):\r\n mn = min(mn, a[i + 1] - a[i])\r\nprint(mn)", "x=int(input())\r\na=list(map(int,input().split()))\r\ny=min(a)\r\nf=9999999999\r\ns=-111111\r\nfor i in range(len(a)):\r\n if a[i]==y:\r\n f=min(f,i-s)\r\n s = i\r\nprint(f)", "n=int(input())\na=list(map(int,input().split()))\ns,k,b,d,f=min(a),0,[],0,0\nfor i in range(len(a)):\n if f==1:d=d+1\n if f==1 and a[i]==s:f=0;b.append(d);d=0\n if a[i]==s:f=1\nprint(min(b))\n", "\r\nn = int(input())\r\n\r\nl = list(map(int,input().split(' ')))\r\n\r\nindex_of_minimums = []\r\nTheMin = min(l)\r\n\r\nfor i in range(n):\r\n if l[i] == TheMin:\r\n index_of_minimums.append(i)\r\n\r\ndist = [ index_of_minimums[i+1]- index_of_minimums[i] for i in range(\r\n (len( index_of_minimums)-1))]\r\n\r\nprint(min(dist))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = min(w)\r\nc, d, h = n, 0, -1\r\nfor i in range(n):\r\n if w[i] == s:\r\n if h == 0:\r\n if i - d < c:\r\n c = i - d\r\n d = i\r\n h = 0\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nindices=[]\r\nfor i in range(0,n):\r\n if a[i]==m:\r\n indices.append(i+1)\r\nmin2=indices[1]-indices[0]\r\nfor j in range(0,len(indices)-1):\r\n if indices[j+1]-indices[j]<min2:\r\n min2=indices[j+1]-indices[j]\r\nprint(min2)", "import sys\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\n#print (m)\r\nindices = [i for i, x in enumerate(l) if x == m]\r\n#print (indices)\r\nmi=(sys.maxsize)\r\nfor i in range(len(indices)-1):\r\n x=(indices[i+1]-indices[i])\r\n if x<mi:\r\n mi=x\r\nprint (mi) ", "n = int(input())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\nmini = min(lst)\r\nls = lst.index(mini)\r\nl = len(lst)\r\nfor x in range(ls + 1, len(lst)):\r\n if lst[x] == mini:\r\n l = min(l, x - ls)\r\n ls = x\r\n \r\nprint(l)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = min(a)\r\nc = [i for i in range(n) if a[i] == x]\r\nd = [c[i] - c[i-1] for i in range(1, len(c))]\r\nprint(min(d))", "import math\nn = int(input())\nX = input()\nx = X.split()\narr = []\nm = math.inf\nfor i in x:\n\ti = int(i)\n\tif i<m:\n\t\tm = i\nfor i in range(len(x)):\n\tif int(x[i]) == int(m):\n\t\tarr.append(i)\t\t\ntemp = arr[1]-arr[0]\t\t\nfor i in range(len(arr)-1):\n\tif (arr[i+1]-arr[i])<temp:\n\t\t\n\t\ttemp = arr[i+1]-arr[i]\t\nprint(temp)", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\nind_m = []\r\nfor i in range(len(a)):\r\n if a[i] == m:\r\n ind_m.append(i)\r\nres = [ind_m[i + 1] - ind_m[i] for i in range(len(ind_m) - 1)]\r\nprint(min(res))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nx=[]\r\nz=[]\r\nfor i in range(n):\r\n if a[i]==m:\r\n x+=[i]\r\nfor i in range(1,len(x)):\r\n z+=[x[i]-x[i-1]]\r\nprint(min(z))\r\n", "a=input()\r\nb=input().split()\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\nmin1=min(b)\r\nk=0\r\nkai=0\r\nk1=[]\r\nfor i in b:\r\n if(kai==1):\r\n k += 1\r\n\r\n if(i==min1 and kai==1):\r\n k1.append(k)\r\n k=0\r\n # kai ^= 1\r\n if (i == min1):\r\n kai=1\r\n\r\n\r\nprint(min(k1))", "n=int(input())\r\na=list(map(int, input().split()))\r\nm=min(a)\r\np= [i for i, x in enumerate(a) if x == m]\r\n#print(p)\r\np.sort()\r\nq=[t - s for s, t in zip(p, p[1:])]\r\n#print(q)\r\nr=min(q)\r\nprint(r)", "n=int(input())\r\nls=list(map(int,input().split()))\r\ncnt=0\r\na=min(ls)\r\nindex=0\r\ndis=0x3f3f3f3f\r\ng=False\r\nfor i in range(n):\r\n if ls[i]==a:\r\n if g==False:\r\n index=i\r\n g=True\r\n else:\r\n dis=min(dis,i-index)\r\n index=i\r\nprint(dis)", "\nn=int(input())\nl=list(map(int,input().split()))\nm=min(l)\nx=n\ny=-n\nfor i,j in enumerate(l):\n if j==m:\n x=min(x,i-y)\n y=i\nprint(x)\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\nn = int(input())\r\na = list(map(int, input().split()))\r\nmi = min(a)\r\nx = []\r\nfor i in range(n):\r\n if a[i] == mi:\r\n x.append(i)\r\nans = n\r\nfor i in range(len(x) - 1):\r\n ans = min(ans, x[i + 1] - x[i])\r\nprint(ans)", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math \r\n# import collections\r\n# import string\r\n# ===================================\r\nn = int(input())\r\nq = [int(x) for x in input().split()]\r\nidx = dict()\r\nvmin = int(9e9)\r\nfor i in range(n):\r\n\tvmin = min(vmin, q[i])\r\n\tif q[i] not in idx.keys():\r\n\t\tidx[q[i]] = []\r\n\tidx[q[i]].append(i)\r\nidx[vmin].sort()\r\nans = int(9e9)\r\nfor i in range(len(idx[vmin])-1):\r\n\tans = min(ans, abs(idx[vmin][i] - idx[vmin][i+1]))\r\nprint(ans)\t\r\n", "n = int(input())\nx = list(map(int, input().split()))\na = []\nmin_dif = 10 ** 6\nx_min = min(x)\nfor i in range(n):\n if x[i] == x_min:\n a.append(i)\nfor j in range(1, len(a)):\n if a[j] - a[j - 1] < min_dif:\n min_dif = a[j] - a[j - 1]\nprint(min_dif)\n", "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n input()\r\n a = input_ints()\r\n m = min(a)\r\n ans = 10**10\r\n p = -1\r\n for i, x in enumerate(a):\r\n if x == m:\r\n if p != -1:\r\n ans = min(ans, i - p)\r\n p = i\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\narr = []\r\nans = 10 ** 10\r\nmn = min(a)\r\nfor i in range(n):\r\n if a[i] == mn:\r\n arr.append(i)\r\nfor i in range(len(arr) - 1):\r\n ans = min(ans, arr[i + 1] - arr[i])\r\nprint(ans)", "n = int(input())\r\narray = list(map(int, input().split()))\r\nmin_value = min(array)\r\nmin_indexes = [i for i, x in enumerate(array) if x == min_value]\r\nprint(min(min_indexes[i + 1] - min_indexes[i] for i in range(len(min_indexes) - 1)))\r\n", "n = int(input())\r\nnum_list = list(map(int, input().split()))\r\nnum_min = min(num_list)\r\nind_min = [i for i in range(n) if num_list[i] == num_min]\r\nans = [ind_min[i+1]-ind_min[i] for i in range(len(ind_min)-1)]\r\nprint(min(ans))\r\n\r\n", "n = int(input())\n\na = list(map(int, input().split()))\nm = min(a)\nv = list(i for i in range(n) if a[i] == m)\n\nprint(min(y-x for x, y in zip(v, v[1:])))\n", "import sys\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\nmax=min\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na = [int(1e15)] + a + [int(1e15)]\r\n\r\nf = max(a)\r\nindi = []\r\nfor i in range(1,n+1):\r\n if a[i]<=a[i+1] and a[i] <= a[i-1] and a[i]==f:\r\n indi.append(i)\r\nbest = int(1e15)\r\nfor i in range(len(indi)-1):\r\n best = max(best,indi[i+1]-indi[i])\r\nprint(best)\r\n\r\n", "n = int(input())\r\nans = 0x3f3f3f3f\r\nprev = - 0x3f3f3f3f\r\nl = [int(x) for x in input().split()]\r\nminn = min(l)\r\nfor i in range(n):\r\n if l[i] == minn:\r\n ans = min(i - prev, ans)\r\n prev = i\r\nprint(ans)\r\n", "def main():\n input()\n arr=list(map(int,input().split()))\n k=min(arr)\n ak=[]\n for i in range(len(arr)):\n if(arr[i]==k): ak.append(i)\n ak.sort()\n r=len(arr)\n for i in range(len(ak)-1):\n r=min(r,ak[i+1]-ak[i])\n return r\n \nprint(main())", "input()\r\nA = list(map(int, input().split()))\r\na_min = min(A)\r\nX = [i for i, a in enumerate(A) if a == a_min]\r\n\r\nprint(min(i - j for i, j in zip(X[1:], X)))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nl1=[]\r\nfor i in range(0,n):\r\n if l[i]==m:\r\n l1.append(i)\r\nm=n\r\nfor i in range(0,len(l1)-1):\r\n m=min(m,l1[i+1]-l1[i])\r\nprint(m)", "def solve():\r\n n = int(input())\r\n a = [int(x) for x in input().split(' ')]\r\n m = min(a)\r\n m_index = [i for (i, x) in enumerate(a) if x == m]\r\n ans = float('inf')\r\n for i in range(1, len(m_index)):\r\n ans = min(ans, m_index[i] - m_index[i - 1])\r\n return ans\r\n\r\n\r\nprint(solve())\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 15 08:55:54 2021\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nminval = s[0]\r\npos = 0\r\ndis = len(s)\r\nfor i in range(1, len(s)):\r\n if s[i] < minval:\r\n minval = s[i]\r\n pos = i\r\n dis = len(s)\r\n elif s[i] == minval:\r\n dis = min(dis, i - pos)\r\n pos = i\r\nprint(dis)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nmi = a[0]\r\nfor i in range(n):\r\n\tmi = min(mi, a[i])\r\npre = -1\r\nans = n\r\nfor i in range(n):\r\n\tif (mi == a[i]):\r\n\t\tif (pre != -1):\r\n\t\t\tans = min(ans, i - pre)\r\n\t\tpre = i\r\nprint (ans)", "n=int(input())\nara=list(map(int,input().split()))\nm=min(ara)\nar=[]\nj=0\nfor i in range(n):\n if ara[i]==m:\n ar.append(i)\nar.sort()\nmx=ar[1]-ar[0]\n\n\nfor k in range(len(ar)-1):\n l=ar[k+1]-ar[k]\n if l<mx:\n mx=l\n\n\nprint(mx)\n \n \t \t \t\t\t\t\t \t\t \t\t\t", "from math import *\nimport string\nimport sys\nfrom bisect import bisect, bisect_left, bisect_right\nfrom collections import Counter, defaultdict, deque\nfrom functools import cache, lru_cache\n\ninput = sys.stdin.readline\n\nM = 10**9+7\n\n\ndef mod(x):\n return x % M\n\n\ndef inp():\n return(int(input()))\n\n\ndef inlt():\n return(list(map(int, input().split())))\n\n\ndef floatl():\n return(list(map(float, input().split())))\n\n\ndef insr():\n s = input()\n return(list(s[:len(s) - 1]))\n\n\ndef ins():\n s = input()\n return s[:len(s) - 1]\n\n\ndef invr():\n return(map(int, input().split()))\n\n\nn = inp()\na = inlt()\n\n\ndef solve():\n minval = min(a)\n pre = -1\n res = inf\n for i in range(n):\n if a[i] == minval:\n if pre != -1:\n res = min(res, i-pre)\n pre = i\n return res\n\n\nprint(solve())\n", "n = int(input())\r\ns = input().split()\r\na = []\r\nlimit = 10 ** 9 + 1\r\nm = limit\r\nfor i in range(n):\r\n t = int(s[i])\r\n m = min(m, t)\r\n a.append(t)\r\nfirst = -1\r\nsecond = -1\r\nans = limit\r\nfor i in range(n):\r\n if a[i] == m:\r\n if first == -1:\r\n first = i\r\n else:\r\n second = i\r\n ans = min(ans, second - first)\r\n first = second\r\n second = -1\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nmn=min(a)\r\nb=[]\r\nfor i in range(n):\r\n if a[i]==mn:b.append(i)\r\nmnd=b[1]-b[0]\r\nfor i in range(len(b)-1):\r\n mnd=min(mnd,b[i+1]-b[i])\r\nprint(mnd)", "n=int(input())\na=list(map(int,input().split()))\nb=min(a)\nc=[]\ny=[]\nfor i in range(n):\n if a[i]==b:\n c.append(i)\nfor j in range(len(c)-1):\n z=c[j+1]-c[j]\n y.append(z)\nprint(min(y))\n#afraa\n \t \t\t \t\t \t \t\t\t\t\t", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nk = min(l)\r\nidx = []\r\nfor i in range(n):\r\n if l[i] == k:\r\n idx.append(i)\r\n\r\nans = float(\"inf\")\r\nfor i in range(1, len(idx)):\r\n ans = min(ans, idx[i]-idx[i-1])\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmn = min(a)\r\n\r\nc = 0\r\ns = False\r\nmx = n + 1\r\nfor i in range(len(a)):\r\n c += 1\r\n if a[i] == mn:\r\n if s and c < mx:\r\n mx = c\r\n if not s:\r\n s = True\r\n c = 0\r\nprint(mx)\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nm = min(a)\r\nm_dist = float(\"inf\")\r\ndist = 0\r\nl = a.index(m)\r\n\r\nfor i in range(l+1, n):\r\n if a[i] == m:\r\n dist = i-l\r\n m_dist = min(m_dist, dist)\r\n l = i\r\nprint(m_dist)\r\n", "size_array = int(input())\narray = list(map(int, input().split(' ')))\n\nminimums = min(array)\n\nminimums_indexes =[]\n\nfor i in range(size_array):\n if array[i] == minimums:\n minimums_indexes.append(i)\n\nminimums_distances = []\n\nfor i in range(1, len(minimums_indexes)):\n minimums_distances.append(minimums_indexes[i] - minimums_indexes[i - 1])\n\nprint(min(minimums_distances))", "\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nq,r=min(a),10**5\r\nw=a.index(q)\r\nfor i in range(w+1,n):\r\n if a[i]==q:r=min(r,i-w);w=i\r\nprint(r)", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nminimum = min(*nums)\r\nindices = [i for i in range(n) if nums[i] == minimum]\r\nprint(min(r - l for l, r in zip(indices, indices[1:])))", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nx=n\r\ny=-n\r\nfor i,j in enumerate(l):\r\n if j==m:\r\n x=min(x,i-y)\r\n y=i\r\nprint(x)", "input()\r\nA = list(map(int,input().split()))\r\nk = min(A)\r\nf = -1\r\nm=len(A)\r\nfor i in range(len(A)):\r\n if(A[i]==k):\r\n if(f==-1):\r\n f=i\r\n else:\r\n m = min(m,i-f)\r\n f=i\r\nprint(m)", "n = int(input())\r\n\r\narr = [int(z) for z in input().split()]\r\n\r\nm = min(arr)\r\n\r\nmind = []\r\n\r\nfor i in range(n):\r\n\r\n if arr[i] == m:\r\n mind.append(i)\r\n\r\nd = 10**18\r\nfor i in range(1, len(mind)):\r\n d = min(d, mind[i] - mind[i-1])\r\n\r\nprint(d)\r\n\r\n", "input()\r\na = list(map(int, input().split()))\r\n\r\nm = min(a)\r\n\r\nb = [i for i in range(len(a)) if a[i] == m]\r\n\r\nprint(min([b[i] - b[i - 1] for i in range(1, len(b))]))\r\n", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nN = int(readline())\r\nA = list(map(int, readline().split()))\r\nres = []\r\nmini = min(A)\r\nfor i in range(N):\r\n if A[i] == mini:\r\n res.append(i)\r\n\r\nprint(min(i - j for i, j in zip(res[1:], res)))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nb=[i for i in range(n) if a[i]==m]\r\nc=[b[i+1]-b[i] for i in range(0,len(b)-1)]\r\nprint(min(c))", "def main():\r\n input()\r\n arr = list(map(int, input().split()))\r\n\r\n minV = min(arr)\r\n\r\n indexes = [i for i, v in enumerate(arr) if v == minV]\r\n\r\n print(min(indexes[i + 1] - indexes[i] for i in range(0, len(indexes) - 1)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\narr_min = min(arr)\r\nmin_pos = 0\r\nmin_r = set()\r\nfor i in range(0, n):\r\n if (arr[i] == arr_min):\r\n min_pos = i\r\n break\r\nfor i in range(min_pos+1, n):\r\n if (arr[i] == arr_min):\r\n min_r.add(i - min_pos)\r\n min_pos = i\r\nprint(min(min_r))", "n=int(input())\nd=list(map(int,input().split()))\nmn=min(d)\ncn=10**5\nw=d.index(mn)\nfor i in range(w+1,n):\n if d[i]==mn:\n cn=min(cn,i-w)\n w=i\nprint(cn)\n", "t=input()\r\nn=int(t)\r\nv=list(map(int,input().split()))\r\nans=1e9+8\r\nfor i in range(n):\r\n ans=min(ans,v[i])\r\nan=1e9+7\r\npre=-1\r\nfor i in range(n):\r\n if v[i]==ans:\r\n if pre==-1:\r\n pre=i\r\n else:\r\n an=min(an,i-pre)\r\n pre=i\r\nprint(an)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmini = min(a)\r\nfirst = None\r\nsecond = None\r\nans = 999999999999999\r\nfor i in range(n):\r\n if a[i]==mini:\r\n if first==None:\r\n first = i\r\n else:\r\n second = i\r\n ans = min(ans,second-first)\r\n first = second\r\n second = None\r\nprint(ans)\r\n", "import sys\r\nimport math\r\nimport collections\r\nfrom pprint import pprint as pp\r\nmod = 1000000007\r\nMAX = 10**18\r\n\r\n\r\ndef array():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef vector(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef matrix(rowNum, colNum, val=0):\r\n mat = []\r\n for i in range(rowNum):\r\n collumn = [val for j in range(colNum)]\r\n mat.append(collumn)\r\n return mat\r\n\r\n\r\nn = int(input())\r\na = array()\r\nmn = min(a)\r\nans = MAX\r\nindx = -1\r\nfor i in range(n):\r\n if a[i] == mn:\r\n indx = i\r\n break\r\nfor i in range(indx + 1, n):\r\n if a[i] == mn:\r\n ans = min(ans, i - indx)\r\n indx = i\r\nprint(ans)\r\n", "n= int(input())\r\nstr1=input()\r\n\r\nlist1=str1.split()\r\n\r\nlist1=[int(item) for item in list1]\r\n\r\nmin1=min(list1)\r\n#print(min1)\r\nlist2=[]\r\nlist3=[]\r\nfor i in range(len(list1)):\r\n if list1[i]==min1:\r\n list2.append(i)\r\n#print(list2)\r\n\r\nfor i in range(len(list2)-1):\r\n list3.append(list2[i+1]-list2[i])\r\n#print(list3) \r\nc=min(list3)\r\n\r\n\r\n\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=min(a)\r\nfor i in range(n):\r\n if a[i]==c:\r\n b.append(i)\r\nd=[] \r\nfor i in range(len(b)-1):\r\n d.append(b[i+1]-b[i])\r\nprint(min(d))", "### Automatically created via \"randomTaskGenerator\" ###\r\n### Link to the task: \"https://codeforces.com/problemset/problem/911/A ###\r\n\r\nn = int(input())\r\nline = [int(i) for i in input().split()]\r\nindex = []\r\nminimum = min(line)\r\nfor i in range(len(line)):\r\n if line[i] == minimum:\r\n if len(index) == 0:\r\n index.append([i, 0])\r\n else:\r\n index.append([i, i - index[-1][0]])\r\nindex.sort(key=lambda x:x[1])\r\nprint(index[1][1])", "INF = 10**9\r\nn, a = int(input()), list(map(int, input().split()))\r\nmn = min(a)\r\nlast, dist = -INF, INF\r\nfor idx, elem in enumerate(a):\r\n if elem == mn:\r\n dist = min(dist, idx - last)\r\n last = idx\r\nprint(dist)", "from collections import defaultdict\r\n\r\nMyDict = defaultdict(list)\r\ninput()\r\nX = list(map(int, input().split()))\r\nfor i in range(len(X)):\r\n MyDict[X[i]].append(i)\r\nfor i in sorted(MyDict.keys()):\r\n if len(MyDict[i]) > 1:\r\n Temp = sorted(MyDict[i])\r\n print(min(Temp[j] - Temp[j - 1] for j in range(1, len(Temp))))\r\n exit()\r\n\r\n# UB_CodeForces\r\n# Advice: Life is not about finding yourself, it's about creating yourself\r\n# Location: At home behind my desk\r\n# Caption: Yeeeeaahhhh i got what i wanted\r\n# CodeNumber: 492\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nma = min(a)\r\naa = [i for i in range(n) if a[i]==ma]\r\nprint(min([aa[i+1]-aa[i] for i in range(len(aa)-1)]))", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==2:\r\n print(1)\r\nelse:\r\n \r\n k=min(a)\r\n l=[]\r\n for i in range(n):\r\n if a[i]==k:\r\n l.append(i)\r\n ll=[]\r\n for i in range(1,len(l)):\r\n ll.append(l[i]-l[i-1])\r\n print(min(ll))\r\n \r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nd = dict()\r\nmn = min(arr)\r\nprev = None\r\nans = float('inf')\r\n\r\nfor i in range(n):\r\n if arr[i] == mn:\r\n if not prev:\r\n prev = i+1\r\n else:\r\n ans = min(ans, i - prev+1)\r\n prev = i+1\r\n\r\nif ans != float('inf'):\r\n print(ans)\r\nelse:\r\n print(1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=[]\r\nmini=100000000000\r\nfor i in range(n):\r\n if a[i]<mini:\r\n mini=a[i]\r\nfor i in range(n):\r\n if(mini == a[i]):\r\n l.append(i)\r\ns=100000000000\r\nfor i in range(1,len(l)):\r\n if s>l[i]-l[i-1]:\r\n s=l[i]-l[i-1]\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = n + 1 \r\nl = []\r\nm = min(a)\r\nfor i in range(n):\r\n if(a[i] == m):\r\n l.append(i)\r\nfor i in range(1, len(l)):\r\n c = min(c, l[i] - l[i - 1])\r\nprint(c)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nm = min(a)\r\nt = a.count(m)\r\nk = []\r\nind = 0\r\nfor i in range(t):\r\n\tfor j in range(ind,n):\r\n\t\tif a[j] == m :\r\n\t\t\tk.append(j)\r\n\t\t\tind = j+1\r\n\t\t\tbreak\r\nm = max(k)\r\nfor i in range(len(k)-1):\r\n\tm = min(m,k[i+1]-k[i])\r\nprint(m)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nindex=[]\r\nm=min(arr)\r\nfor i in range(0,n):\r\n if arr[i]==m:\r\n index.append(i)\r\nd=999999999999\r\nfor i in range(0,len(index)-1):\r\n d=min(d,abs(index[i]-index[i+1]))\r\nprint(d)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nminK = 1e9+1\r\nfor i in range(n):\r\n minK = min([minK, arr[i]])\r\nstep = 0\r\ntoggle = False\r\nresult = []\r\nfor i in range(n):\r\n step += 1\r\n if arr[i] == minK:\r\n if toggle == True :\r\n result.append(step)\r\n else :\r\n toggle = True\r\n step = 0\r\nminK = 1e9+1\r\nfor i in range(len(result)):\r\n minK = min([result[i], minK])\r\nprint(minK)", "n=int(input())\r\na=[int(a)for a in input().split()]\r\nmi=min(a)\r\nm=[]\r\nw=[]\r\nfor i in range(len(a)):\r\n if mi==a[i]:\r\n m.append(i)\r\nfor i in range(len(m)-1):\r\n w.append(m[i+1]-m[i])\r\nprint(min(w))\r\n", "out = stop = int(input())\r\ninput = input().split(' ')\r\ninput = list(map(int, input))\r\n\r\nstrt = 0\r\nminx = min(input)\r\ni_minx1 = input.index(minx)\r\n\r\nfor i in range(input.count(minx) - 1):\r\n strt = i_minx1 + 1\r\n i_minx2 = input.index(minx, strt, stop)\r\n if i_minx2 - i_minx1 < out:\r\n out = i_minx2 - i_minx1\r\n i_minx1 = i_minx2\r\n \r\nprint(out)", "n=int(input())\r\nl=[]\r\ny=[]\r\np=input().split(' ')\r\nfor i in range(n):\r\n l.append(int(p[i]))\r\ne=l[:]\r\ne.sort()\r\nw=l.index(e[0])\r\nt=1\r\nfor i in range(w+1,len(l)):\r\n if l[i]!=e[0]:\r\n t=t+1\r\n else:\r\n y.append(t)\r\n t=1\r\ny.sort()\r\nprint(y[0])\r\n", "a=int(input())\r\n\r\n\r\nt=[]\r\n\r\n\r\ns=list(map(int,input().split()))\r\n\r\n\r\nz= min(s)\r\n\r\nb=s.index(z)\r\n\r\nfor k in range(b+1,a):\r\n if s[k]==z:\r\n t.append(k-b)\r\n b=k\r\n\r\nprint(min(t))\r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nx=min(a)\r\nl=[]\r\nfor i in range(0,len(a)):\r\n if a[i]==x:\r\n l.append(i)\r\nans=10**10\r\nfor j in range(0,len(l)-1):\r\n x=l[j+1]-l[j]\r\n ans=min(ans,x)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = min(a)\r\n\r\nind= []\r\nfor i in range(n):\r\n if a[i] == m:\r\n ind += [i]\r\n \r\nans = ind[1] - ind[0]\r\n\r\nfor i in range(2, len(ind)):\r\n ans = min(ans, ind[i]-ind[i-1])\r\nprint(ans)\r\n ", "n=int(input())\r\na=[int(k) for k in input().split()]\r\nmi=min(a)\r\nmin_dist=10**10\r\nindex=[]\r\nfor i in range(len(a)):\r\n if a[i]==mi:\r\n index.append(i)\r\nfor i in range(len(index)-1):\r\n if (index[i+1]-index[i])<min_dist:\r\n min_dist=index[i+1]-index[i]\r\nprint(min_dist)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nx = input().split()\r\ny = []\r\n\r\nfor i in x:\r\n\ty.append(int(i))\r\n\r\nnum = min(y)\r\n\r\nind = []\r\nfor i in range(n):\r\n\tif y[i] == num:\r\n\t\tind.append(i)\r\n\r\ngap = 1000000\r\n\r\nfor i in range(1, len(ind)):\r\n\tif ind[i] - ind[i - 1] < gap:\r\n\t\tgap = ind[i] - ind[i - 1]\r\n\t\t\r\nprint(gap)", "n = int(input())\r\nA = list(map(int,input().split()))\r\na = min(A)\r\nans = []\r\nfor i in range(n):\r\n if(A[i]==a):\r\n ans.append(i+1)\r\nans1 = int(1e10)\r\nfor i in range(1,len(ans)):\r\n ans1 = min(ans1,ans[i]-ans[i-1])\r\nprint(ans1)", "# int(input())\r\n# [int(s) for s in input().split()]\r\n# input()\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n m = [int(s) for s in input().split()]\r\n\r\n r = 0\r\n m_el = min(m)\r\n ans = float(\"inf\")\r\n\r\n for i in range(n):\r\n if r == 0:\r\n if m[i] == m_el:\r\n r = 1\r\n else:\r\n if m[i] == m_el:\r\n ans = min(ans, r)\r\n r = 1\r\n else:\r\n r += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "#!/usr/bin/env python3\n\ninput()\narr = list(map(int, input().split()))\nm = min(arr)\nidx = [i for i, x in enumerate(arr) if x == m]\nprint(min(idx[i+1] - idx[i] for i in range(len(idx)-1)))", "import math\r\n#n,k = map(int, input().strip().split(' '))\r\nn=int(input())\r\na = list(map(int, input().strip().split(' '))) \r\nm=min(a)\r\nlst=[]\r\nfor i in range(n):\r\n if a[i]==m:\r\n lst.append(i)\r\nmi=1000000\r\nfor i in range(1,len(lst)):\r\n if lst[i]-lst[i-1]<mi:\r\n mi=lst[i]-lst[i-1]\r\nprint(mi)\r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nmn = min(a)\r\ndiff = 1e9\r\nmnpos = None\r\n\r\nfor i in range(len(a)):\r\n if a[i] == mn:\r\n if mnpos is not None:\r\n diff = min(diff, i - mnpos)\r\n mnpos = i\r\n\r\nprint(diff)", "n = int(input())\r\nmins = []\r\ncmin = 99999999999999999\r\nminsindex = []\r\ncount = 0\r\nfor i in input().split():\r\n i = int(i)\r\n if i <= cmin:\r\n cmin = i\r\n mins.append(i)\r\n minsindex.append(count)\r\n count += 1\r\nminofmin = min(mins)\r\ni = 0\r\nwhile i < len(mins):\r\n if mins[i] != minofmin:\r\n del mins[i]\r\n del minsindex[i]\r\n else:\r\n i += 1\r\nminlenght = 999999999999999\r\nfor i in range(1, len(minsindex)):\r\n if minsindex[i] - minsindex[i - 1] < minlenght:\r\n minlenght = minsindex[i] - minsindex[i - 1]\r\nprint(minlenght)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nm = min(A)\r\nI = []\r\nfor i, a in enumerate(A):\r\n if a == m:\r\n I.append(i)\r\nans = 10**18\r\nfor j in range(len(I)-1):\r\n ans = min(ans, I[j+1]-I[j])\r\nprint(ans)\r\n", "n = int(input())\r\narray = [i for i in map(int, input().split())]\r\n#print(array)\r\n\r\nmin_num = array[0]\r\nd = dict()\r\n\r\nfor i in range(n):\r\n num = array[i]\r\n if num not in d:\r\n d[num] = []\r\n d[num].append(i)\r\n else:\r\n d[num].append(i)\r\n\r\n#Find minimum num: \r\nfor key in d.keys():\r\n if key < min_num and len(d[key]) >= 2: \r\n min_num = key\r\n\r\n#Find min distance\r\npos_min = d[min_num]\r\nresult = pos_min[1] - pos_min[0]\r\nfor i in range(len(pos_min) - 1): \r\n result = min(result, pos_min[i+1] - pos_min[i])\r\n \r\nprint(result)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmn = min(a)\r\nb = []; c = []\r\nfor i in range(n):\r\n if a[i] == mn: b.append(i)\r\nfor i in range(len(b)-1): c.append(b[i+1]-b[i])\r\nprint(min(c))\r\n", "t=int(input())\r\nl=list(map(int,input().split()))\r\np=[]\r\nm=min(l)\r\nfor i in range(t):\r\n if(l[i]==m):\r\n p.append(i)\r\nm=p[1]-p[0]\r\nj=1\r\nwhile(j<len(p)-1):\r\n if(p[j+1]-p[j]<m):\r\n m=p[j+1]-p[j]\r\n j+=1\r\nprint(m)", "n=int(input())\na=list(map(int,input().split()))\np=min(a)\nfor u in range(len(a)):\n\tif(a[u]==p):\n\t\tbreak\nj=u\nl=[]\nfor i in range(j+1,len(a)):\n\tif(a[i] == p):\n\t\tl.append(i-j)\n\t\tj=i\nprint(min(l))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=min(a)\r\nc=[]\r\nz=[]\r\nfor i in range(n):\r\n if a[i]==b:\r\n c.append(i)\r\nfor j in range(len(c)-1):\r\n y = c[j+1]-c[j]\r\n z.append(y)\r\nprint(min(z)) #Abdullah", "# LUOGU_RID: 133257370\nn=int(input())\r\na=list(map(int,input().split()))\r\nmn=1<<33\r\nv=[]\r\nfor i in range(n):\r\n if a[i]<mn:\r\n mn=a[i]\r\n v=[i]\r\n elif a[i]==mn:\r\n v.append(i)\r\nprint(min([v[i]-v[i-1] for i in range(1,len(v))]))", "n = int(input())\na = [None] * n\nindex_min = [None]\nsum = 9999999999\na = list(map(int,input().split()))\n#print(a)\nindex_min[0] = a.index(min(a))\nfor i in range(index_min[0]):\n if a[index_min[0]] == a[i]:\n index_min.append(i)\nfor i in range(index_min[0]+1,n):\n if a[index_min[0]] == a[i]:\n index_min.append(i)\n#print(index_min)\nfor i in range(len(index_min)-1):\n #print( index_min[i], index_min[i+1])\n if sum > index_min[i+1] - index_min[i]:\n sum = index_min[i+1] - index_min[i]\n \nprint(sum) ", "k = input()\r\nm = [int(i) for i in input().split()]\r\nminN = min(m)\r\ni = 0\r\nmasRes = []\r\ncounter = 0\r\nfor i in range(m.index(minN)+1, len(m)):\r\n counter+=1\r\n if(m[i] == minN):\r\n masRes.append(counter)\r\n counter = 0\r\nprint(min(masRes))", "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\namin = min(a)\r\npre = -1\r\nres = int(1e9)\r\nfor i in range(n):\r\n if a[i] == amin:\r\n if pre > -1:\r\n res = min(res, i-pre)\r\n pre = i\r\nprint(res)\r\n", "# t = int(input())\n# for test in range(t):\nn = int(input())\narr = list(map(int, input().split()))\nsmallest = min(arr)\nprev = -1\ncurrMin = 10**5\n\nfor i in range(n):\n if prev == -1 and arr[i] == smallest:\n prev = i\n elif arr[i] == smallest:\n if i - prev < currMin:\n currMin = i - prev\n prev = i\n\nprint(currMin)\n\n\n\n\n", "inp = input()\ninp2 = input().split(' ')\nl = []\nfor item in inp2:\n l.append(int(item))\n\nminimum = min(l)\n\nminlist = []\ni=0\nwhile i < len(l):\n if l[i] == minimum:\n minlist.append(i)\n i+=1\n\ni=0\nabslist = []\nwhile i < len(minlist)-1:\n abslist.append(minlist[i+1]-minlist[i])\n i+=1\n\n\nprint(min(abslist))\n\n\t \t\t \t\t\t\t \t\t \t \t \t \t\t \t\t\t", "n = input()\n\narr = [int(i) for i in input().split()]\n\nmin = 10**9 + 1\n\nfor i in arr:\n if i < min:\n min = i\n\nindices = [i for i, x in enumerate(arr) if x == min]\n\nd = len(arr) + 1\n\nfor i in range(len(indices) - 1):\n temp = indices[i+1] - indices[i]\n if temp < d:\n d = temp\n\nprint(d)\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nmn = min(lst)\r\ni1 = 0\r\ni2 = 0\r\nflag = True\r\nanswer = float(\"inf\")\r\nfor i in range(n):\r\n if flag and lst[i] == mn :\r\n i1 = i\r\n k = 0\r\n flag = False\r\n elif lst[i] == mn and k % 2 == 0:\r\n i2 = i\r\n k += 1\r\n if i2-i1 < answer:\r\n answer = i2-i1\r\n elif lst[i] == mn and k%2 == 1:\r\n i1 = i\r\n k += 1\r\n if i1-i2 < answer:\r\n answer = i1-i2\r\nprint(answer)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nm=min(a)\r\nb=[]\r\notvet=[]\r\npos0=a.index(m)\r\nfor i in range(len(a)):\r\n if (a[i]==m) & (i!=pos0):\r\n b.append(i) \r\nfor i in b:\r\n otvet.append((i-pos0))\r\n pos0=i\r\n \r\nprint(min(otvet))\r\n", "i = int(input())\r\nl = list(map(int,input().split()))\r\na=min(l)\r\nc = []\r\ne = l.index(a)\r\nfor x in range(e+1,i):\r\n if l[x] == a:\r\n c.append(x-e)\r\n e = x\r\nprint(min(c))", "n=int(input())\r\nx=list(map(int,input().split()))\r\nd=min(x)\r\nind=[]\r\nfor i in range(len(x)):\r\n if x[i]==d:\r\n ind.append(i+1)\r\nr=max(ind)\r\nfor i in range(1,len(ind)):\r\n r=min(r,ind[i]-ind[i-1])\r\nprint(r)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nmn = min(a)\r\nans = n+1\r\nx = -1\r\nfor i in range(n):\r\n\tif a[i] == mn :\r\n\t\tif x == -1: \r\n\t\t\tx = i\r\n\t\telse : \r\n\t\t\tans = min(ans, i-x)\r\n\t\t\tx = i \r\nprint(ans)", "import math\nif __name__ == \"__main__\" :\n\tn = int(input())\n\tarr = list(map(int,input().split()))\n\tmin_num = min(arr)\n\tres = list()\n\tindex = 0\n\tfor num in range(n) :\n\t\tif arr[num] == min_num :\n\t\t\tres.append(index)\n\n\t\tindex += 1\t\n\n\tres_num = math.inf\t\n\tfor num in range(1,len(res)) :\n\t\tres_num = min(res_num,res[num]-res[num-1])\n\n\tprint(res_num)\t", "n, a = int(input()), list(map(int, input().split()))\r\nmn = min(a)\r\nids = [i for i in range(n) if a[i] == mn]\r\ndist = ids[1] - ids[0]\r\nfor i in range(2, len(ids)):\r\n dist = min(dist, ids[i] - ids[i - 1])\r\nprint(dist)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nj=-1\r\ns=10000000000000\r\nq=min(a)\r\nfor i in range(n):\r\n if j==-1 and a[i]==q:\r\n j=i\r\n elif a[i]==q and j!=-1:\r\n if abs(i-j)<s:\r\n s=abs(i-j)\r\n j=i\r\nprint(s)", "# region smaller_fastio\r\nfrom sys import stdin, stdout\r\nfrom os import path\r\n\r\nif path.exists('input.txt'):\r\n # ------------------Sublime--------------------------------------#\r\n stdin = open('input.txt', 'r')\r\n stdout = open('output.txt', 'w')\r\n\r\n\r\n def I():\r\n return int(input())\r\n\r\n\r\n def In():\r\n return map(int, input().split())\r\nelse:\r\n # ------------------PYPY FAst I/o--------------------------------#\r\n def I():\r\n return int(stdin.readline())\r\n\r\n\r\n def In():\r\n return map(int, stdin.readline().split())\r\n\r\n\r\n def S():\r\n return stdin.readline().rstrip()\r\n\r\n\r\n def Sn():\r\n return stdin.readline().split(' ')\r\n\r\n\r\ndef Out(whatever):\r\n return stdout.write(whatever)\r\n\r\n\r\n# endregion\r\n\r\n\r\nif __name__ == '__main__':\r\n n = I()\r\n arr = list(In())\r\n m = min(arr)\r\n aux = [i for i in range(n) if arr[i] == m]\r\n k = len(aux)\r\n Out(str(min([aux[i + 1] - aux[i] for i in range(k - 1)])))\r\n", "import sys\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\ni=a.index(min(a))\r\nm=i\r\ni+=1\r\nmi=sys.maxsize\r\nwhile i<n:\r\n if a[i]==a[m]:\r\n s=i-m\r\n if s<mi:\r\n mi=s\r\n m=i\r\n i+=1\r\nprint(mi)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=set()\r\nd=[]\r\ne=min(b)\r\nx=0\r\nfor i in range(len(b)):\r\n if b[i]==e:\r\n d.append(i)\r\nx=[d[i+1]-d[i] for i in range(len(d)-1)]\r\nprint(min(x))\r\n", "class CodeforcesTask911ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.array = []\n\n def read_input(self):\n self.n = int(input())\n self.array = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n mn = min(self.array)\n ind = [x for x in range(self.n) if self.array[x] == mn]\n dists = []\n for x in range(len(ind) - 1):\n dists.append(ind[x + 1] - ind[x])\n self.result = str(min(dists))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask911ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\nl=list(map(int,input().split()))\nm=min(l)\nix=[]\nfor i in range(0,n,1):\n if l[i]==m:\n ix.append(i+1)\nix.sort()\nd=1000000\nfor i in range(0,len(ix)-1,1):\n if ix[i+1]-ix[i]<d:\n d=ix[i+1]-ix[i]\nprint(d)\n\n\t \t \t \t\t \t \t \t\t \t \t \t \t\t\t", "\r\ninput()\r\narr = [int(x) for x in input().split()]\r\nminval = min(arr)\r\nminarr, i = [], 0\r\nwhile True:\r\n\ttry:\r\n\t\tmi = arr.index(minval, i)\r\n\texcept ValueError:\r\n\t\tbreak\r\n\tminarr.append(mi)\r\n\ti = mi + 1\r\nprint(min(abs(x-y) for x, y in zip(minarr, minarr[1:])))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\n\r\nx = min(A)\r\nB = [i for i in range(n) if A[i] == x]\r\n\r\nprint(min(B[j] - B[j-1] for j in range(1,len(B))))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nb=[]\r\nfor i in range(len(a)):\r\n if a[i]==m:\r\n b.append(i)\r\nans=[]\r\nfor i in range(len(b)-1):\r\n x = b[i+1]-b[i]\r\n ans.append(x)\r\nprint(min(ans))\r\n ", "from sys import maxsize\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nm = maxsize\r\nres= maxsize\r\nind = []\r\nfor i in range(len(arr)):\r\n if arr[i] < m:\r\n m = arr[i]\r\n ind = [i]\r\n res=maxsize\r\n elif arr[i] == m:\r\n ind.append(i)\r\n if ind[-1]-ind[-2] < res and len(ind) > 1:\r\n res = ind[-1]-ind[-2]\r\nprint(res)\r\n", "# array of n integers\r\n# distance between two closest minimums = ?\r\n# atleast two times, minimums occur\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nminm=l1[0]\r\nfor i in l1:\r\n if(i<minm):\r\n minm=i\r\nlpos=[]\r\nfor i in range(n):\r\n if(l1[i]==minm):\r\n lpos.append(i)\r\n# 1 2 3 5\r\nminm2=lpos[1]-lpos[0]\r\nfor i in range(len(lpos)-1):\r\n if((lpos[i+1]-lpos[i])<minm2):\r\n minm2=lpos[i+1]-lpos[i]\r\nprint(minm2)", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nlocs = []\r\nmn = min(a)\r\n\r\nfor i in range(n):\r\n if a[i] == mn:\r\n locs.append(i)\r\n\r\nmn_dist = 1e9\r\n\r\nfor i in range(len(locs)-1):\r\n mn_dist = min(mn_dist, locs[i+1] - locs[i])\r\n\r\nprint(mn_dist)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nx = min(data)\r\na=[]\r\nfor i in range(n):\r\n if data[i]==x:\r\n a.append(i) \r\n\r\n\r\nans = 10**10\r\nfor i in range(len(a)-1):\r\n ans = min(ans, a[i+1]-a[i])\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nres = float(\"inf\")\r\ncurrCnt = 0\r\nminTarget = min(lst)\r\nflag = False\r\n\r\nfor i in lst:\r\n if i == minTarget and flag:\r\n res = min(res, currCnt)\r\n currCnt = 0\r\n elif i == minTarget:\r\n flag = True\r\n \r\n if flag:\r\n currCnt += 1\r\n\r\nprint(res)", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\na=[]\r\nk=[]\r\nfor i in range(len(l)):\r\n if l[i]==m:\r\n a.append(i)\r\nfor j in range(len(a)-1):\r\n s=a[j+1]-a[j]\r\n k.append(s)\r\nprint(min(k))", "# TWO POINTERS\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nminVal = min(arr)\r\ndis = float('inf')\r\n\r\np1 = 0\r\np2 = 0\r\n\r\nfor i in range(1, len(arr)):\r\n p2 = i\r\n if arr[p2] == minVal:\r\n if arr[p1] == arr[p2] and dis > p2-p1:\r\n dis = p2-p1\r\n p1 = p2\r\nprint(dis)\r\n ", "input()\r\n\r\nA = list(map(int, input().split()))\r\nx = min(A)\r\n\r\nind = []\r\nfor i, a in enumerate(A):\r\n if a == x:\r\n ind += [i]\r\n \r\nans = ind[1] - ind[0]\r\n\r\nfor i in range(2, len(ind)):\r\n ans = min(ans, ind[i] - ind[i-1])\r\nprint(ans) \r\n\r\n ", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nmin1=min(arr)\r\ncount=arr.count(min1)\r\nindex1=arr.index(min1)\r\nk=100000000\r\narr[index1]=k\r\nk+=1\r\nbrr=[]\r\n\r\nfor i in range(index1+1,len(arr),1):\r\n if arr[i]==min1:\r\n arr[i]=k\r\n k+=1\r\n ans=abs(index1-i)\r\n brr.append(ans)\r\n index1=i\r\nprint(min(brr))", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = min(a);c = a.index(b)\r\nans = []\r\nfor i in range(c+1,n):\r\n if a[i] == b:\r\n ans.append(i-c)\r\n c = i\r\nprint(min(ans))", "n=int(input())\r\na=list(map(int, input().split()))\r\nm=min(a)\r\na=sorted(list(set([(x+1)*(a[x]==m) for x in range(n)])))\r\nb=not a[0]\r\na=[a[x]-a[x-1] for x in range(1,len(a))]\r\nprint(min(a[b:]))", "\r\nn=int(input())\r\narray=list(map(int,input().split()))\r\nmin_ele=min(array)\r\nindex1=array.index(min_ele)\r\nlist_count=[]\r\ncount=0\r\nfor i in range(index1+1,n):\r\n count+=1\r\n if(array[i]==min_ele):\r\n list_count.append(count)\r\n index1=i\r\n count=0\r\n \r\nprint(min(list_count))", "def mp():return map(int,input().split())\r\ndef it():return int(input())\r\n\r\nn=it()\r\nl=list(mp())\r\nm=min(l)\r\nflag=0\r\nans=0\r\nc=0\r\nk=float('inf')\r\nfor i in range(len(l)):\r\n\tif l[i]==m:\r\n\t\tc+=1\r\n\t\tflag=1\r\n\t\tif ans>0:\r\n\t\t\tk=min(k,ans)\r\n\t\t\tans=0\r\n\telif flag==1:\r\n\t\t# c=0\r\n\t\tans+=1\r\n\t\tif c<2:\r\n\t\t\tc=0\r\n\t\telse:\r\n\t\t\tpass\r\nif c<2:\r\n\tprint(k+1)\r\nelse:\r\n\tprint(1)\r\n", "def main():\r\n input()\r\n arr = list(map(int, input().split()))\r\n\r\n minV = min(arr)\r\n\r\n indexes = [i for i, v in enumerate(arr) if v == minV]\r\n\r\n result = indexes[1] - indexes[0]\r\n\r\n for i in range(1, len(indexes) - 1):\r\n result = min(result, indexes[i + 1] - indexes[i])\r\n\r\n print(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# 911A - 2\r\nN = int(input())\r\nb= []\r\na = list(map(int,input().strip().split()))\r\n\r\nm = min(a)\r\nml = N\r\n\r\nfor i in range(N):\r\n if m == a[i]:\r\n b.append(i)\r\nlenB= len(b)\r\nfor j in range(1,lenB):\r\n this = b[j]- b[j-1]\r\n if ml>this:\r\n ml = this\r\nprint(ml)\r\n", "max=min\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\na = [100000000000] + a + [1000000000000]\r\n\r\nf = max(a)\r\nindi = []\r\nfor i in range(1,n+1):\r\n if a[i]<=a[i+1] and a[i] <= a[i-1] and a[i]==f:\r\n indi.append(i)\r\nbest = 10000000000000000000\r\nfor i in range(len(indi)-1):\r\n best = max(best,indi[i+1]-indi[i])\r\nprint(best)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nm = min(a)\r\nmd = 100000\r\nl = [i for i, x in enumerate(a) if x == m]\r\nfor j in range(1, len(l)):\r\n\tif md > l[j] - l[j - 1]:\r\n\t\tmd = l[j] - l[j - 1]\r\n\r\nprint(md)", "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\ndef time_lagbe(n, k, t):\r\n if n == 0:\r\n return 0\r\n if k > n:\r\n return t\r\n time1 = (n // k)*t + (n % k)*t\r\n return time1\r\n# For getting input from input.txt file\r\n#sys.stdin = open('input.txt', 'r')\r\n# Printing the Output to output.txt file\r\n#sys.stdout = open('output.txt', 'w')\r\n\r\n\r\nn = inp()\r\na = inlist()\r\n\r\nmn = min(a)\r\nb = []\r\nfor i in range(n):\r\n if a[i] == mn:\r\n b.append(i)\r\nmin_dis = 100000000000\r\nfor i in range(len(b)-1):\r\n if b[i+1] - b[i] < min_dis:\r\n min_dis = b[i+1] - b[i]\r\nprint(min_dis)\r\n", "n = int(input())\r\nl = input().split()\r\n\r\nlind = []\r\nmin_l = int(l[0])\r\n\r\nmin_ind = n\r\n\r\nfor i in range(n):\r\n l[i] = int(l[i])\r\n\r\n if l[i] < min_l:\r\n min_l = l[i]\r\n\r\nfor i in range(n):\r\n if l[i] == min_l:\r\n lind.append(i)\r\n\r\nfor i in range(1, len(lind)):\r\n if lind[i] - lind[i - 1] < min_ind:\r\n min_ind = lind[i] - lind[i - 1]\r\n\r\nprint(min_ind)\r\n\r\n", "# smallest distance of 2 minimum numbers in an array\r\ndef solve (arr):\r\n minPos=0 #position of current min val\r\n minDist=999999999 #distance between 2 min val, set to MAX\r\n minVal=arr[0]\r\n for i in range(1,len(arr)):\r\n if arr[i]<minVal:\r\n minVal=arr[i] # new min\r\n minDist=999999999\r\n minPos=i\r\n elif arr[i]==minVal:\r\n dist=i-minPos #find next minVal, calc dist\r\n if dist < minDist:\r\n minDist=dist\r\n minPos=i\r\n return minDist\r\n\r\ndef test():\r\n print(solve([3,3,4,3])==1)\r\n print(solve([5,6,5])==2)\r\n print(solve([5,5,6,5,4,5,6,4])==3)\r\n print(solve([2, 1, 3, 5, 4, 1, 2, 3, 1])==3)\r\n\r\ndef ni():\r\n s=input()\r\n while len(s)==0:\r\n s=input()\r\n try:\r\n return int(s)\r\n except:\r\n return 0\r\n\r\ndef nia():\r\n s=input()\r\n while len(s)==0:\r\n s=input()\r\n s=s.split()\r\n iVal=[];\r\n for i in range (len(s)):\r\n iVal.append(int(s[i]))\r\n return iVal\r\n\r\n#test()\r\nn=ni()\r\nprint(solve(nia()))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=min(a)\r\nl=[]\r\ncom=1\r\nfor i in range(a.index(m)+1,n):\r\n if a[i]>m:\r\n com+=1\r\n else:\r\n l.append(com)\r\n com=1\r\nprint(min(l))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm,l,mx=min(a),[],float(\"inf\")\r\nfor i in range(n):\r\n if a[i]==m:\r\n l.append(i)\r\nfor i in range(len(l)-1):\r\n mx=min(mx,l[i+1]-l[i])\r\nprint(mx)", "n = int(input())\r\nb = input()\r\na = list(map(int, b.split()))\r\nm = min(a)\r\ncnt = 0\r\nrazn = []\r\nfor i in range(len(a)):\r\n if a[i] == m:\r\n cnt += 1\r\n if cnt == 1:\r\n ind1 = i\r\n elif cnt >= 2:\r\n ind2 = i\r\n razn.append(ind2 - ind1)\r\n ind1 = ind2\r\nprint(min(razn)) ", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n\r\n mn = min(arr)\r\n mn_indices = [i for i in range(n) if arr[i] == mn]\r\n\r\n mn_distance = n - 1\r\n for i in range(len(mn_indices) - 1):\r\n mn_distance = min(mn_distance, mn_indices[i + 1] - mn_indices[i])\r\n\r\n print(mn_distance)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nm = min(a)\r\nf = True\r\nbest = n\r\ncur = 0\r\n\r\nfor i in range(n):\r\n if a[i] == m and f:\r\n f = False\r\n cur = i\r\n elif a[i] == m and not f:\r\n best = min(best, i-cur)\r\n cur = i\r\n\r\nprint(best)", "n = int(input())\nisi = list(map(int, input().split()))\n\nkecil = min(isi)\njarak_minimal = 1000000000\n\nterakhir_ketemu_min = -1\njarak = 0\n\nfor i in range (n):\n if isi [i] == kecil:\n if terakhir_ketemu_min != -1:\n jarak = i - terakhir_ketemu_min\n if jarak < jarak_minimal:\n jarak_minimal = jarak\n terakhir_ketemu_min = i\n\nprint (jarak_minimal)\n \n\t \t\t \t\t \t\t\t \t\t \t\t \t", "length = int(input())\r\na = list(map(int, input().split()))\r\nminimum = min(a)\r\noccurrences = [i for i, x in enumerate(a) if x == minimum]\r\ndistances = map(lambda x: occurrences[x[0] + 1] - x[1], enumerate(occurrences[:-1]))\r\nprint(min(distances))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=min(a)\r\nans=10000000\r\nb=[]\r\nfor i in range(0,n):\r\n if a[i]==x:\r\n b.append(i)\r\npos=b[0]\r\nfor i in range(1,len(b)):\r\n ans=min(ans,b[i]-pos)\r\n pos=b[i]\r\nprint(ans)", "\r\nt = int(input())\r\na = list(map(int , input().split()))\r\nminV = min(a)\r\nlast = a.index(minV) \r\nmn = 1e6\r\nfor i in range(last+1 ,t):\r\n if(a[i] == minV):\r\n mn = min(mn , i-last)\r\n last = i\r\n\r\n\r\nprint(mn)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=min(l)\r\nf=l.index(a)\r\nc=n\r\nfor i in range(f+1,n):\r\n if(l[i]==a):\r\n m=i-f\r\n if(m<c):\r\n c=m\r\n f=i\r\nprint(c)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nminA = min(a)\r\nindex = []\r\n\r\nfor i in range(n):\r\n if a[i] == minA:\r\n index.append(i)\r\n\r\nindex.sort()\r\nlnI = len(index)\r\nminD = 1000000007\r\n\r\n\r\nfor i in range(lnI - 1):\r\n if index[i + 1] - index[i] < minD:\r\n minD = index[i + 1] - index[i]\r\n\r\nprint(minD)", "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 = inpl()\r\nmi = min(a)\r\npre = -INF\r\nres = INF\r\nfor i,x in enumerate(a):\r\n if x == mi:\r\n res = min(res, i-pre)\r\n pre = i\r\nprint(res)", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\nc = a.index(m)\r\nres = float('inf')\r\nfor i in range(c + 1, n):\r\n if a[i] == m:\r\n res = min(res, i - c)\r\n c = i\r\nprint(res)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = min(l)\r\nmi = l.index(m)\r\nln = []\r\nfor i in range(mi + 1, n):\r\n if l[i] == m:\r\n ln.append(i - mi)\r\n mi = i\r\nprint(min(ln))", "n = int(input());\na = list(map(int, input().split()));\n\nminv = 1<<30; minid = None;\nanswer = 1<<30;\n\nfor i, ai in enumerate(a):\n if ai < minv :\n minv = ai\n answer = 1<<30;\n minid = i\n elif ai == minv:\n #print(i, minid, ai, minv)\n if answer > (i - minid):\n answer = i - minid\n minid = i\n\n\n\nprint(answer)\n\n\n\n\n\n", "import math\n\nn = int(input())\narray = [int(x) for x in input().split(' ')]\n\nmin_value = min(array)\nindex_of_mins = [i for i, x in enumerate(array) if x == min_value]\n\n# print(index_of_mins)\n\nsol = math.inf\nprev = index_of_mins[0]\nfor i in range(1,len(index_of_mins)):\n\tsol = min(sol, index_of_mins[i] - prev)\n\tprev = index_of_mins[i]\n\nprint(sol)\n\n", "n = int(input())\r\nl = [int(i) for i in input().split(\" \")]\r\nm = min(l)\r\nx = []\r\nfor i in range(n):\r\n if l[i] == m:\r\n x.append(i)\r\no = []\r\nfor i in range(len(x)-1):\r\n o.append(x[i+1]-x[i])\r\nprint(min(o))\r\n\r\n\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 15 08:50:04 2021\r\n\r\n@author: MridulSachdeva\r\n\"\"\"\r\n\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\nx = min(s)\r\nminval = []\r\nfor i in range(len(s)):\r\n if s[i] == x:\r\n minval.append(i)\r\nans = minval[1] - minval[0]\r\nfor i in range(1, len(minval)):\r\n if minval[i] - minval[i-1] < ans:\r\n ans = minval[i] - minval[i-1]\r\nprint(ans)\r\n", "n = int(input())\r\nli = list(map(int,input().strip().split()))[:n]\r\nminList = []\r\nmin = li[0]\r\nfor i in range(1,n):\r\n if (li[i]<= min):\r\n min = li[i]\r\n\r\nfor i in range (n):\r\n if (li[i]==min):\r\n minList.append(i) \r\nn = len(minList)\r\nmin = minList[1]-minList[0]\r\nfor i in range(1,n-1):\r\n if(minList[i+1]-minList[i]<min):\r\n min = minList[i+1]-minList[i]\r\n\r\nprint(min) ", "def arr_enu():\r\n return [[i, int(x)] for i, x in enumerate(stdin.readline().split())]\r\n\r\n\r\nfrom sys import stdin\r\n\r\nn, a = int(input()), sorted(arr_enu(), key=lambda x: x[1])\r\nmi, ans = a[0][1], float('inf')\r\nfor i in range(1, n):\r\n if a[i][1] == mi:\r\n ans = min(ans, a[i][0] - a[i - 1][0])\r\n else:\r\n break\r\nprint(ans)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nb = []\r\nx = min(a)\r\n\r\nfor i in range(n):\r\n if a[i] == x:\r\n b.append(i)\r\n\r\nprev = b[0]\r\nans = n\r\nfor i in range(1, len(b)):\r\n if b[i] - prev < ans:\r\n ans = b[i] - prev\r\n prev = b[i]\r\n\r\nprint(ans)\r\n", "n=int(input())\r\n\r\na=[int(i) for i in input().split()]\r\n\r\nx=min(a)\r\n\r\narr=[]\r\n\r\nfor h in range(len(a)):\r\n\tif(a[h]==x):\r\n\t\tarr.append(h)\r\n\r\nmini=len(a)-1\r\nfor k in range(len(arr)-1):\r\n\tif(arr[k+1]-arr[k]<mini):\r\n\t\tmini=arr[k+1]-arr[k]\r\n\r\nprint(mini)", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = [int(o) for o in stdin.readline().split()]\r\n\r\nmn = min(a)\r\n\r\nlast = -1\r\nans = 10 ** 9\r\n\r\nfor (i, val) in enumerate(a):\r\n\tif val == mn:\r\n\t\tif last != -1:\r\n\t\t\tans = min(ans, i - last)\r\n\r\n\t\tlast = i\r\n\r\nprint(ans)", "n = int(input())\r\narr = list(map(int,input().split()))\r\na = min(arr)\r\nans = []\r\nfor i in range(0,len(arr)):\r\n if arr[i] == a:\r\n ans.append(i)\r\n#print(ans)\r\ndiff = []\r\nfor i in range(0,len(ans)-1):\r\n diff.append(abs(ans[i]-ans[i+1]))\r\ndiff.sort()\r\nprint(diff[0])\r\n\r\n\r\n", "n = int(input())\r\nar = list(map(int,input().split()))\r\ny=min(ar)\r\na = []\r\ne = ar.index(y)\r\nfor i in range(e+1,n):\r\n if ar[i] == y:\r\n a.append(i-e)\r\n e = i\r\nprint(min(a))", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nmn = 10**9+1\r\nran = n+1\r\npos = 0\r\n\r\nfor i in range(n):\r\n if a[i]<mn:\r\n pos = i\r\n mn = a[i]\r\n ran = n+1\r\n elif a[i]==mn:\r\n ran = min(ran,i - pos)\r\n pos = i\r\n \r\nprint(ran)", "import sys\r\nimport math\r\nimport random\r\n#sys.setrecursionlimit(100000000)\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\nara=inara()\r\n\r\nmini=ara[0]\r\n\r\nfor num in ara:\r\n\tmini=min(mini,num)\r\n\r\ndis=n+1\r\nlast=-1\r\n\r\nfor i in range(n):\r\n\tif ara[i]==mini:\r\n\t\tif last==-1:\r\n\t\t\tlast=i\r\n\t\telse:\r\n\t\t\tdis=min(dis,i-last)\r\n\t\t\tlast=i\r\n\r\nprint(dis)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ncur = 0\r\nans = 100001\r\nfor i in range(1,n):\r\n if a[cur] == a[i]:\r\n ans = min(ans, i-cur)\r\n cur = i\r\n elif a[i] < a[cur]:\r\n cur = i\r\n ans = 100001\r\nprint(ans)\r\n", "n=int(input())\r\na=[int(a)for a in input().split()]\r\nmi=min(a)\r\nv=[]\r\nw=[]\r\nfor i in range(len(a)):\r\n if mi==a[i]:\r\n v.append(i)\r\nfor i in range(len(v)-1):\r\n w.append(v[i+1]-v[i])\r\nprint(min(w))\r\n", "n = int(input())\nisi = list(map(int, input().split()))\nkecil = min(isi)\njarak_min = 10**9\nterakhir_ketemu_min = -1\njarak = 0\n\nfor i in range(n):\n if isi[i] == kecil:\n if terakhir_ketemu_min != -1:\n jarak = i - terakhir_ketemu_min\n if jarak < jarak_min:\n jarak_min = jarak\n terakhir_ketemu_min = i\n\nprint(jarak_min)\n\t\t \t\t \t \t\t\t\t\t \t \t \t\t\t\t \t\t \t\t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l)\r\nx=[]\r\nk=10**10\r\nfor i in range(n):\r\n if(l[i]==m):\r\n x.append(i)\r\nfor i in range(1,len(x)):\r\n s=x[i]-x[i-1]\r\n if(s<k):\r\n k=s\r\nprint(k)\r\n", "length = int(input())\r\narray = [int(r) for r in input().split(' ')]\r\nminimum = min(array)\r\nmindex = []\r\nmindiffdex = []\r\n\r\nfor i in range(length):\r\n if array[i] == minimum:\r\n mindex.append(i)\r\n\r\nfor i in range(1, len(mindex)):\r\n mindiffdex.append(mindex[i] - mindex[i-1])\r\n\r\nprint(min(mindiffdex))\r\n \r\n \r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nr = min(l)\r\nindex = []\r\nmin1 = float(\"inf\")\r\nfor i in range(len(l)):\r\n\tif r == l[i]:\r\n\t\tindex.append(i)\r\nfor i in range(1,len(index)):\r\n\tmin1 = min(min1,abs(index[i]-index[i-1]))\r\nprint(min1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = min(l)\r\nk = l.index(x)\r\ndmin = n+1\r\nfor i in range(k+1,n):\r\n if l[i] == x:\r\n d = i - k \r\n k = i \r\n if d < dmin:\r\n dmin = d \r\nprint(dmin)", "_=int(input())\r\nA=list(map(int,input().split()))\r\nxmin=min(*A)\r\nindex=[]\r\nfor i in range(len(A)):\r\n if A[i]==xmin:\r\n index.append(i)\r\nm=[]\r\nfor i in range(len(index)-1):\r\n m.append(index[i+1]-index[i])\r\nprint(min(m))", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\nm = min(a)\r\nb = [i for i in range(n) if a[i] == m]\r\nlst = [b[i + 1] - b[i] for i in range(0, len(b) - 1)]\r\nprint(min(lst))", "#problem 911\r\n#6.01.2018\r\ndef main():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n c=[]\r\n min_number=min(a)\r\n min_index=n\r\n for i in range(n):\r\n if a[i]==min_number:\r\n c.append(i)\r\n\r\n for i in range(1,len(c)):\r\n min_index=min((c[i]-c[i-1]),min_index)\r\n\r\n print(min_index)\r\n\r\nif __name__=='__main__':\r\n main()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nj = min(l)\r\nh=[]\r\nu = 9999999999999\r\nfor i in range(len(l)):\r\n if l[i]==j:\r\n h.append(i)\r\nfor i in range(len(h)-1):\r\n u = min(u,abs(h[i]-h[i+1]))\r\n\r\nprint(u)", "n = int(input())\r\narr = list(map(int,input().split()))\r\npos = 0\r\nans = 10**5 + 1\r\ncur = arr[0]\r\nfor i in range(1,n):\r\n if arr[i] < cur:\r\n cur = arr[i]\r\n pos = i\r\n ans = 10**5 + 1\r\n elif arr[i] == cur:\r\n ans = min(ans,i-pos)\r\n pos = i\r\nprint(ans) ", "def mindist(l):\r\n f = 'ndone'\r\n if max(l) == min(l):\r\n return 1\r\n smallest = max(l) - min(l)\r\n for i in range(1, len(l)):\r\n if l[i] - l[i-1] == 1:\r\n f = 'done'\r\n return 1\r\n elif l[i] - l[i-1] < smallest:\r\n smallest = l[i] - l[i-1]\r\n if f == 'ndone':\r\n return smallest\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nminimum = min(a)\r\npos = []\r\nfor i in range(len(a)):\r\n if a[i] == minimum:\r\n pos.append(i)\r\nprint(mindist(pos))\r\n\r\n", "n = int(input())\narr = list(map(int, input().split()))\nans = 100000\nbrr = arr[:]\nbrr.sort()\nb = []\nimport math\nif brr[0] != brr[1]:\n p = arr.index(brr[0])\n if brr[1] != brr[2]:\n ans = int(p - arr.index(brr[1]))\n else:\n for i in range(n):\n if arr[i] == brr[1]:\n b.append(i)\n for i in b:\n ans = int(min(ans, math.fabs(p-i)))\nelse:\n for i in range(n):\n if arr[i]==brr[0]:\n b.append(i)\n for i in range(1,len(b)):\n ans=int(min(ans,math.fabs(b[i]-b[i-1])))\nprint(ans)\n \t\t\t\t \t \t\t\t\t\t \t\t \t \t \t \t", "n = int(input())\r\nA = list(map(int,input().split()))\r\nB = []\r\nx=n\r\nf=0\r\nm = min(A)\r\nfor i in range(len(A)):\r\n if(A[i]==m):\r\n if(f==0):\r\n j=i\r\n f=1\r\n else:\r\n x = min(x,i-j)\r\n j=i\r\nprint(x)", "n=int(input())\r\nl1=[]\r\nl1=input().split()\r\ni=0\r\nfor i in range(n):\r\n l1[i]=int(l1[i])\r\nl2=[]\r\nl2=l1[:]\r\nl2.sort()\r\nj=0\r\nfor j in range(n-1):\r\n if(l2[j]==l2[j+1]):\r\n x=l2[j]\r\n break\r\nst=-1\r\nen=-1\r\nc=0\r\nd=-1\r\nfor c in range(n):\r\n if(l1[c]==x):\r\n if(st==-1):\r\n st=c\r\n else:\r\n if(en!=-1):\r\n st=en\r\n en=c\r\n if(d==-1):\r\n d=en-st\r\n else:\r\n if((en-st)<d):\r\n d=en-st\r\nprint(d)", "n=int(input())\na=list(map(int,input().split()))\nm=min(a)\nindices=[]\nfor i in range(0,n):\n if a[i]==m:\n indices.append(i+1)\nmin2=indices[1]-indices[0]\nfor j in range(0,len(indices)-1):\n if indices[j+1]-indices[j]<min2:\n min2=indices[j+1]-indices[j]\nprint(min2)\n\t\t\t \t \t \t \t\t \t\t \t \t\t \t\t", "# author: violist\n# created: 13.12.2021 17:43:08\n\nimport sys\ninput = sys.stdin.readline\n\nmaxn = 10 ** 9\n\nn = int(input())\na = list(map(int, input().split()))\npos = []\nmini = min(a)\nmin_dist = maxn\npos = -1\nfor i in range(n):\n if (a[i] == mini):\n if (pos == -1):\n pos = i\n else:\n if (i - pos < min_dist):\n min_dist = i - pos\n pos = i\nprint(min_dist)\n", "# 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,insort\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\ndef Nprime(n):\r\n if n==2 or n==3:\r\n return 0\r\n if n==1:\r\n return 1\r\n i=2\r\n while i*i<=n:\r\n if n%i==0:\r\n return 1\r\n i+=1\r\n return 0\r\n\r\ndef g(n):\r\n i=2\r\n while n%i==0:\r\n i+=1\r\n return i\r\n#for _ in range(t()):\r\n \r\ndef f():\r\n\r\n n=t()\r\n a=list(ll())\r\n d={}\r\n x=min(a)\r\n d[x]=[]\r\n for i in range(n):\r\n if a[i]==x:\r\n d[x].append(i)\r\n ans=inf\r\n for i in range(1,len(d[x])):\r\n ans=min(ans,d[x][i]-d[x][i-1])\r\n\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(( - 3\r\n() - 1\r\n)( - 4\r\n)) - 3\r\n\r\n4 closing\r\n4 opening\r\n(()()()())\r\n\r\n'''\r\n\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\n\r\n1 2 3 4 5 6 7 8\r\n0 1 2 3 4 5 6 7\r\n-5 -4 -3 -2 -1 0 1 2 3 4 5 6\r\n\r\n'''\r\n", "N = int(input())\r\nA = list(map(int,input().split()))\r\nx = min(A)\r\nO = True\r\nmain = []\r\nfor i in range(N):\r\n \r\n if A[i] == x and O:\r\n sta = i\r\n O =False\r\n elif A[i] == x:\r\n main.append(i-sta)\r\n sta = i\r\nprint(min(main)) \r\n \r\n", "if __name__==\"__main__\":\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n m=min(a)\r\n pos=[]\r\n for i in range(n):\r\n if a[i]==m:\r\n pos.append(i)\r\n dis=len(a)-1\r\n for i in range(1,len(pos)):\r\n if pos[i]-pos[i-1]<dis:\r\n dis=pos[i]-pos[i-1]\r\n print(dis)\r\n\r\n", "from sys import stdin,stdout\r\nfrom math import floor\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\n\r\nmod=1000000007\r\n'''\r\nprime=[]\r\ni=2\r\nl=[True for i in range(10**5+1)]\r\nwhile i*i <= 10**5 :\r\n if l[i]:\r\n for j in range(i*i,10**5+1,i):\r\n l[j]=False\r\n i+=1\r\nfor i in range(2,10**5+1):\r\n if l[i]:\r\n prime.append(i)\r\n'''\r\n\r\ndef solve():\r\n n=inp()\r\n l=li()\r\n a=min(l)\r\n x=[]\r\n for i in range(n):\r\n if l[i]==a:\r\n x.append(i)\r\n \r\n mi=float('inf')\r\n for i in range(1,len(x)):\r\n mi=min(mi,x[i]-x[i-1])\r\n pr(mi)\r\n \r\n \r\n \r\nfor _ in range(1):\r\n solve()\r\n\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nma=min(a)\r\nna=[i for i in range(0,n) if a[i]==ma]\r\nhaha=[na[i+1]-na[i] for i in range(0,len(na)-1)]\r\nprint(min(haha))", "n = int(input())\r\nmas = list(map(int, input().split()))\r\ngas = []\r\nf = min(mas)\r\nfor i in range(n):\r\n if mas[i] == f:\r\n gas.append(i)\r\notv = 10000000000000\r\nfor i in range(len(gas) - 1):\r\n if gas[i+1] - gas[i] < otv:\r\n otv = gas[i+1] - gas[i]\r\nprint(otv)", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=a[0]\r\nfor i in range(n):\r\n if a[i]<=m:\r\n m=a[i]\r\nb=[]\r\nfor i in range(n):\r\n if a[i]==m:\r\n b.append(i)\r\nc=[]\r\nfor i in range(1,len(b)):\r\n c.append(b[i]-b[i-1])\r\nprint(min(c))", "# Time Complexity: O(n)\r\n# Space Complexity: O(1)\r\n\r\nn = int(input())\r\nA = [int(a) for a in input().split()]\r\n\r\nm = min(A)\r\nd = 100001\r\ncheckpoint = -1\r\n\r\nfor i in range(n):\r\n if A[i] == m:\r\n if checkpoint > -1:\r\n aux = i - checkpoint\r\n d = min(d, aux)\r\n checkpoint = i\r\n\r\nprint(d)", "n = int(input())\r\nlist_ = list(map(int, input().split()))\r\nmin_ = min(list_)\r\nlist_1 = [i for i in range(n) if list_[i] == min_]\r\nprint(min(list_1[i+1]-list_1[i] for i in range(list_1.__len__() - 1)))", "n = int(input(''))\r\na = [int(x) for x in input().split()]\r\np = min(a)\r\nq = a.index(p)\r\ndiff = n\r\nfor i in range(q+1, n):\r\n if a[i] == p:\r\n c = i - q\r\n q = i\r\n if diff>c:\r\n diff = c\r\nprint(diff)", "def li():\r\n return list(map(int, input().split()))\r\nn = int(input())\r\na = li()\r\nl = -1\r\nt = min(a)\r\nans = 1000000000\r\nfor i in range(len(a)):\r\n if a[i] == t:\r\n if l == -1:\r\n l = i\r\n else:\r\n ans = min(i - l, ans)\r\n l = i\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nm = min(a)\r\nx = [i for i, z in enumerate(a) if z == m]\r\ny = min([(x[i] - x[i-1]) for i in range(1, len(x))])\r\nprint(y)" ]

[ "n,m,kk=map(int,input().split())\r\ns=input()\r\nt=input()\r\ndp=[[[0]*11 for i in range(1001)] for j in range(1001)]\r\nconsecutive=[[0]*(1001) for i in range(1001)]\r\nfor i in range(1,n+1):\r\n for j in range(1,m+1):\r\n if s[i-1]==t[j-1]:\r\n consecutive[i][j]=consecutive[i-1][j-1]+1\r\nans=0\r\nfor k in range(1,kk+1):\r\n for i in range(1,n+1):\r\n for j in range(1,m+1):\r\n length=consecutive[i][j]\r\n dp[i][j][k]=max(dp[i-1][j][k],dp[i][j-1][k],dp[i-length][j-length][k-1]+length)\r\n ans=max(ans,dp[i][j][k])\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef z_algorithm(w):\r\n m = len(w)\r\n z = [0] * m\r\n z[0] = m\r\n i, j = 1, 0\r\n while i < m:\r\n while i + j < m and w[j] == w[i + j]:\r\n j += 1\r\n z[i] = j\r\n if not j:\r\n i += 1\r\n continue\r\n l = 1\r\n while l < j and l + z[l] < j:\r\n z[i + l] = z[l]\r\n l += 1\r\n i += l\r\n j -= l\r\n return z\r\n\r\ndef f(u, v):\r\n return u * (m + 1) + v\r\n\r\nn, m, k = map(int, input().split())\r\ns = list(input().rstrip())\r\nt = list(input().rstrip())\r\nl = (n + 1) * (m + 1)\r\nx = []\r\nfor i in range(n):\r\n u = s[i:] + [0] + t\r\n z = z_algorithm(u)\r\n x.append(z[-m:])\r\ndp = [0] * l\r\nans = 0\r\nfor _ in range(k):\r\n dp0 = list(dp)\r\n for i in range(n - 1, -1, -1):\r\n y = x[i]\r\n for j in range(m - 1, -1, -1):\r\n u, v = f(i, j), f(i + y[j], j + y[j])\r\n dp0[v] = max(dp[u] + y[j], dp0[v])\r\n for i in range(n):\r\n for j in range(m):\r\n u, v, w = f(i, j), f(i + 1, j), f(i, j + 1)\r\n dp0[v], dp0[w] = max(dp0[u], dp0[v]), max(dp0[u], dp0[w])\r\n dp = dp0\r\n ans = max(ans, max(dp))\r\nprint(ans)" ]

[ "def parser():\r\n while 1:\r\n data = list(input().split(' '))\r\n for number in data:\r\n if len(number) > 0:\r\n yield(number) \r\n\r\ninput_parser = parser()\r\n\r\ndef get_word():\r\n global input_parser\r\n return next(input_parser)\r\n\r\ndef get_number():\r\n data = get_word()\r\n try:\r\n return int(data)\r\n except ValueError:\r\n return float(data)\r\n\r\n\r\nx = get_number()\r\ny = get_number()\r\nl = get_number()\r\nr = get_number()\r\nn1 = 1;\r\na = list()\r\na.append(l - 1)\r\nfor i in range(0, 300):\r\n if n1 > r:\r\n break\r\n n2 = 1 \r\n for j in range(0, 300):\r\n if n1 + n2 > r:\r\n break\r\n if n1 + n2 >= l and n1 + n2 <= r:\r\n a.append(n1 + n2)\r\n n2 = n2 * y\r\n n1 = n1 * x\r\n \r\na.append(r + 1)\r\na.sort()\r\nans = 0\r\nfor i in range(0, len(a) - 1):\r\n ans = max(ans, a[i + 1] - a[i] - 1)\r\nprint(ans)", "#!/usr/bin/env python3\n\n[x, y, l, r] = map(int, input().strip().split())\n\ndef pows(x, r):\n\tps = [1]\n\twhile ps[-1] * x < r:\n\t\tps.append(ps[-1] * x)\n\treturn ps\n\npx = pows(x, r)\npy = pows(y, r)\nnothappy = [l - 1, r + 1]\nfor ppx in px:\n\tfor ppy in py:\n\t\tif l <= ppx + ppy <= r:\n\t\t\tnothappy.append(ppx + ppy)\n\nnothappy.sort()\nbest = max(nh1 - nh0 for nh0, nh1 in zip(nothappy, nothappy[1:])) - 1\nprint (best)\n", "R=lambda:list(map(int,input().strip().split()))\r\n[x,y,l,r]=R()\r\na=list()\r\nb=list()\r\ncur=1\r\nwhile(cur<r):\r\n a.append(cur) \r\n cur*=x \r\ncur=1\r\nwhile(cur<r):\r\n b.append(cur) \r\n cur*=y \r\n \r\ns=set()\r\ns.add(l-1)\r\ns.add(r+1)\r\nfor p in a:\r\n for q in b:\r\n s.add(p+q) \r\ns=list(s)\r\ns.sort()\r\nml=0\r\nfor i in range(len(s)-1):\r\n if s[i]>=l-1 and s[i+1]<=r+1:\r\n ml=max(ml,s[i+1]-s[i]-1)\r\nprint(ml)", "x, y, l, r = map(int, list(input().split(' ')))\r\nar = []\r\nx1 = 1\r\nfor i in range(1, 70):\r\n y1 = 1\r\n for j in range(1, 70):\r\n ar.append(x1 + y1)\r\n #if x1 + y1 == 22:\r\n #print(\"AAAAAAAAAAAA {} {}\".format(x1, y1))\r\n y1 *= y\r\n if y1 > r:\r\n break\r\n x1 *= x\r\n if x1 > r:\r\n break\r\nar.append(l - 1)\r\nar.append(r + 1)\r\nar.sort()\r\n#for i in ar:\r\n# print(i, sep=' ')\r\n#print(' ')\r\ni_l = -1\r\ni_r = -1\r\nfor i in range(len(ar)):\r\n if ar[i] == l - 1:\r\n i_l = i\r\n if ar[i] == r + 1:\r\n i_r = i\r\nans = -1\r\nfor i in range(i_l, i_r):\r\n if ar[i + 1] - ar[i] - 1 > ans:\r\n ans = ar[i + 1] - ar[i] - 1\r\nprint(ans)\r\n\r\n", "\n\nx,y,l,r=map(int,input().split())\n\nlst = []\n\npwdX = 1\npwdY = 1\n\nfor i in range(0,65):\n pwdY = 1\n for j in range(0,65):\n if pwdX + pwdY > r:\n lst.append(pwdX + pwdY)\n break\n toAdd = pwdX + pwdY\n lst.append(toAdd)\n pwdY*=y\n pwdX*=x\n\nlst.append(r+1)\nlst.append(l-1)\n\n# print(lst)\n# sorted(lst)\nlst.sort()\n\nmaximum = 0\nfor i in range(0,len(lst)-1):\n if lst[i] >= l-1 and lst[i+1] <= r+1:\n maximum = max(maximum,lst[i+1]-lst[i] - 1)\n\n\nprint(maximum)", "from sys import stdin, stdout\r\nfrom random import randrange\r\n\r\nx, y, l, r = map(int, stdin.readline().split())\r\nsze = 60\r\n\r\nchallengers = []\r\nfor i in range(sze):\r\n for j in range(sze):\r\n if l <= x ** i + y ** j <= r:\r\n challengers.append(x ** i + y ** j)\r\n elif x ** i + y ** j > r:\r\n break\r\n\r\nchallengers = sorted(list(set(challengers)))\r\nans = 0\r\n\r\nif challengers:\r\n if l not in challengers:\r\n ans = max(ans, challengers[0] - l)\r\n\r\n if r not in challengers:\r\n ans = max(ans, r - challengers[-1])\r\n \r\n n = len(challengers)\r\n\r\n for i in range(1, n):\r\n ans = max(ans, challengers[i] - challengers[i - 1] - 1)\r\nelse:\r\n ans = r - l + 1\r\n\r\nstdout.write(str(ans))", "import math\ntmp=input().split()\ndict={}\narr=[]\nx=int(tmp[0])\ny=int(tmp[1])\nl=int(tmp[2])\nr=int(tmp[3])\nx1=int(math.log(10,x)*18)+2\nx2=int(math.log(10,y)*18)+2\nfor i in range(x1):\n\tfor j in range(x2):\n\t\tpr=x**i+y**j\n\t\tif(pr<=1e18):\n\t\t\ttry:\n\t\t\t\ttt=dict[pr]\n\t\t\texcept:\n\t\t\t\tdict[pr]=1\n\t\t\t\tarr.append(pr)\n\t\telse:\n\t\t\tbreak\narr.sort()\nc=0\nfor i in range(len(arr)):\n\tif(arr[i]>=l and arr[i]<=r):\n\t\tc+=1\n\t\tpos2=i\n\tif(arr[i]>=r):\n\t\tbreak\nif(c==0):\n\tprint(int(r-l+1))\nelse:\n\tfor i in range(len(arr)-1,-1,-1):\n\t\tif(arr[i]>=l):\n\t\t\tpos1=i\n\t\tif(arr[i]<=l):\n\t\t\tbreak\n\tmaxi=0\n\tfor i in range(pos1,pos2,1):\n\t\tif(maxi<arr[i+1]-arr[i]-1):\n\t\t\tmaxi=arr[i+1]-arr[i]-1\n\tmaxi=max(maxi,max(r-arr[pos2],arr[pos1]-l))\n\tprint(maxi)", "#!/usr/bin/python3 \n\nx, y, l, r = map(int, input().split())\n\nA = []\nB = []\n\na = 1\n\nwhile a < r:\n\tA.append(a)\n\ta *= x\n\nb = 1\n\nwhile b < r:\n\tB.append(b)\n\tb *= y\n\nX = [l-1, r+1]\n\nfor a in A:\n\tfor b in B:\n\t\ts = a + b\n\t\tif(l <= s and s <= r):\n\t\t\tX.append(s)\n\nX = sorted(X)\n\nans = 0\n\nfor i in range(len(X)-1):\n\tans = max(ans, X[i+1] - X[i] - 1)\n\nprint(ans) ", "x,y,l,r=[int(i) for i in input().split()]\r\n\r\nM=int(1e18)\r\ni=1\r\nul=[]\r\n\r\nwhile (i<=M):\r\n j=1\r\n while (i+j<=M):\r\n ul.append(i+j)\r\n j*=y\r\n i*=x\r\n\r\nul=[0]+sorted(ul)+[M+1]\r\n\r\nn=len(ul)\r\nmx=0\r\nfor i in range(1,n):\r\n cur=min(ul[i],r+1)-max(l-1,ul[i-1])-1\r\n mx=max(mx,cur)\r\nprint(mx)\r\n\r\n", "\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 , defaultdict\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#CODE\r\n\r\ndef fast_power2(x , y):\r\n\r\n if y == 0 :\r\n return 1\r\n\r\n temp = fast_power2(x , int(y / 2))\r\n if y % 2 == 0 :\r\n return temp * temp\r\n else:\r\n return x * temp * temp\r\n\r\n\r\nx , y , l , r = MAP()\r\nnums = []\r\nl2 , r2 = 0 , 0\r\n\r\nfor i in range(63):\r\n for j in range(63):\r\n v = fast_power2(x , i) + fast_power2(y , j)\r\n if v > r :\r\n break\r\n\r\n if v >= l and v <= r :\r\n nums.append(v)\r\n\r\n if v == l :\r\n l2 = 1\r\n\r\n if v == r :\r\n r2 = 1\r\n\r\n\r\nif l2 == 0 :\r\n nums.append(l - 1)\r\n\r\nif r2 == 0 :\r\n nums.append(r + 1)\r\n\r\nnums.sort()\r\nmx = 0\r\nfor i in range(len(nums) - 1):\r\n mx = max(mx , (nums[i +1] - nums[i] - 1))\r\n\r\nprint(mx)\r\n\r\n", "x,y,l,r=map(int,input().split())\r\nls=[]\r\nfor a in range(60):\r\n for b in range(60):\r\n n=x**a+y**b\r\n ls.append(n)\r\nif l not in ls:\r\n ls.append(l-1)\r\n l=l-1\r\nif r not in ls:\r\n ls.append(r+1)\r\n r=r+1\r\nls=list(set(ls))\r\nls.sort()\r\na=ls.index(l)\r\nb=ls.index(r)\r\nls=ls[a:b+1]\r\nlz=ls.copy()\r\nfor i in range(1,len(lz)):\r\n lz[i]=lz[i]-ls[i-1]-1\r\nlz[0]=0\r\nprint(max(lz))\r\n", "a,b,c,d = map(int, input().split(' '))\n\nMXV = 10 ** 18\n\napows, bpows = [], []\naa, bb = 1, 1\nwhile aa <= MXV:\n apows.append(aa)\n aa *= a\nwhile bb <= MXV:\n bpows.append(bb)\n bb *= b\n\nvals = set()\nfor i in range(len(apows)):\n for j in range(len(bpows)):\n vals.add(apows[i] + bpows[j])\n\nvlist = list(vals)\nvlist.sort()\nans = 0\nlast = c-1 \nfor v in vlist:\n if c <= v and v <= d:\n ans = max(ans, v - last - 1)\n last = v\nans = max(ans, d-last)\n\nprint(ans)\n", "x,y,l,r = list(map(int,input().split()))\r\ns = set()\r\ns.add(l-1)\r\ns.add(r+1)\r\ni = 0\r\nj = 0\r\nwhile True:\r\n j = 0\r\n a = x**i\r\n if a > r:\r\n break\r\n while True:\r\n b = a + y**j\r\n j+=1\r\n if b > r:\r\n break\r\n if b >= l:\r\n s.add(b)\r\n i+=1\r\n \r\n\r\nans = 0\r\ns = sorted(list(s))\r\nfor i in range(1,len(s)):\r\n ans = max(ans,s[i]-s[i-1]-1)\r\nprint(ans)", "import sys\r\n\r\ndef solve():\r\n x, y, l, r = map(int, input().split())\r\n\r\n if x < y:\r\n x, y = y, x\r\n\r\n made = {l - 1, r + 1}\r\n\r\n for a in range(64):\r\n for b in range(64):\r\n t = x**a + y**b\r\n\r\n if l <= t <= r:\r\n made.add(t)\r\n elif t > r:\r\n break\r\n\r\n made = sorted(made)\r\n # print(made)\r\n\r\n ans = 0\r\n\r\n for i in range(len(made) - 1):\r\n ans = max(ans, made[i + 1] - made[i] - 1)\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "# Why do we fall ? So we can learn to pick ourselves up.\r\nx,y,l,r = map(int,input().split())\r\nll = []\r\nfor i in range(0,75):\r\n for j in range(0,75):\r\n if l <= pow(x,i)+pow(y,j) <= r:\r\n ll.append(pow(x,i)+pow(y,j))\r\nll = sorted(set(ll))\r\nmaxx = -1\r\nif len(ll) == 0:\r\n print(r-l+1)\r\nelse:\r\n maxx = max(maxx,ll[0]-l)\r\n for i in range(1,len(ll)):\r\n maxx = max(ll[i]-ll[i-1]-1,maxx)\r\n maxx = max(maxx,r-ll[-1])\r\n print(maxx)\r\n\r\n", "x, y, l, r = list(map(int, input().split()))\r\nxs = []\r\nys = []\r\nans = []\r\nfor i in range(61):\r\n xs.append(x ** i)\r\nfor i in range(61):\r\n ys.append(y ** i)\r\nfor i in range(61):\r\n for k in range(61):\r\n if l<= xs[i] + ys[k] <= r:\r\n ans.append(xs[i] + ys[k])\r\npref = l\r\nans.append(l - 1)\r\nans.append(r + 1)\r\nans.sort()\r\na = 0\r\nfor i in range(len(ans)):\r\n a = max(a, ans[i] - pref - 1)\r\n pref = ans[i]\r\nprint(a)", "[x,y,l,r]=[int(x) for x in input().split()]\r\nbd=[]\r\ncx=1\r\nwhile cx<=(10**18):\r\n\tcy=1\t\r\n\twhile cy<=(10**18):\r\n\t\tif cx+cy>=l and cx+cy<=r:\r\n\t\t\tbd+=[cx+cy]\r\n\t\tcy*=y\r\n\tcx*=x\r\nbd+=[l-1,r+1]\r\nbd.sort()\r\nres=0\r\nfor i in range(1,len(bd)):\r\n\tif res<bd[i]-bd[i-1]-1:\r\n\t\tres=bd[i]-bd[i-1]-1\r\nprint(res)", "R=range(65)\nx, y, l, r=map(int, input().split())\ng=[l-1, r+1]\nfor a in [ x**i for i in R if x**i<=r]:\n\tfor b in [ y**i for i in R if y**i<=r ]:\n\t\tt=a+b\n\t\tif l<=t and t<=r:\n\t\t\tg+=[t]\ng=list(sorted(g))\na=0\nfor i in range(1, len(g)):\n\ta=max(a, g[i]-g[i-1]-1)\nprint(a)\n", "x,y,l,r = map(int,input().split())\r\nd = []\r\nfor i in range(65):\r\n for j in range(65):\r\n if x**i + y**j <= r and x**i + y**j>=l:\r\n d.append(x**i + y**j)\r\nd.append(l-1)\r\nd.append(r+1)\r\nd.sort()\r\nanswer = 0\r\nfor i in range(len(d) - 1):\r\n answer = max(answer, d[i+1] - d[i] - 1)\r\nprint(answer)# 1689508050.1493886", "x, y, l, r = map(int, input().split())\r\na = []\r\nfor k in range(70):\r\n for b in range(70):\r\n a.append(x ** k + y ** b)\r\na = sorted(a)\r\nans = 0\r\ndef inter(a, b, c, d):\r\n if c > d:\r\n return 0;\r\n if max(a, c) > min(b, d):\r\n return 0\r\n return min(b, d) - max(a, c) + 1\r\nans = inter(l, r, 1, a[0] - 1)\r\nfor i in range(len(a) - 1):\r\n ll = a[i] + 1\r\n rr = a[i + 1] - 1\r\n ans = max(ans, inter(l, r, ll, rr))\r\nprint (ans)\r\n ", "x, y, l, r = map(int, input().split())\r\na = [0]\r\nfor i in range(70):\r\n for j in range(70):\r\n a.append(x ** i + y ** j)\r\na.sort()\r\nanswer = 0\r\nfor i in range(len(a) - 1):\r\n if a[i+1]<=r:\r\n r1=a[i+1]-1\r\n else:\r\n r1=r\r\n if a[i]>=l:\r\n l1=a[i]+1\r\n else:\r\n l1=l\r\n if answer<=r1-l1: answer=r1-l1+1\r\nprint(answer)", "x, y, l, r = map(int, input().split())\r\nans = 0\r\nv = [l - 1, r + 1]\r\n\r\nfor a in [x**i for i in range(65) if x**i <= r]:\r\n for b in [y ** i for i in range(65) if y**i <= r]:\r\n if l <= a + b <= r:\r\n v += [a + b]\r\n\r\nv.sort()\r\n\r\nfor i in range(1, len(v)):\r\n ans = max(ans, v[i] - v[i - 1] - 1)\r\n\r\nprint(ans)", "x, y, l, r = map(int, input().split())\r\ndata = []\r\ntx = 1\r\nwhile (tx < r + 3):\r\n ty = 1\r\n while (ty < r + 3):\r\n data.append(tx + ty)\r\n ty *= y\r\n tx *= x\r\ndata = sorted(set(data))\r\ndata = [elem for elem in data if l <= elem and elem <= r]\r\ndata = [l - 1] + data + [r + 1] \r\nans = 0\r\nfor i in range(1, len(data)):\r\n ans = max(ans, data[i] - data[i - 1] - 1)\r\nprint(ans)", "x, y, l, r = [int(x) for x in input().split()]\n\nant = 0\nv = []\n\nxp = 1\nfor i in range(0, 64):\n yp = 1\n for j in range(0, 64):\n if l <= xp + yp <= r:\n v.append(xp+yp)\n yp*= y\n xp*= x\n\nv.append(r + 1)\nv.sort()\n \nl-= 1\nfor i in v:\n if i - l - 1 > ant:\n ant = i - l - 1\n l = i\n \nprint(ant)", "x, y, l, r = map(int, input().split())\r\na, b = 1, 1\r\ni, j = 0, 0\r\nk = []\r\nwhile a <= r:\r\n\tb = 1\r\n\twhile b <= r:\r\n\t\tif a + b <= r and a + b >= l and a + b <= r and not (a + b) in k:\r\n\t\t\tk.append(a + b)\r\n\t\tb *= y\r\n\ta *= x\r\nk.sort()\r\nk.append(r + 1)\r\nmx = 0\r\nfor i in range(len(k) - 1):\r\n\tp = k[i + 1] - 1\r\n\tle = k[i] + 1\r\n\tmx = max(mx, p - le + 1)\r\np = k[0]\r\nmx = max(mx, p - l)\r\nprint(mx)", "x,y,l,r=map(int,input().split())\r\nvec=[]\r\ni=j=-1\r\nwhile(i<=65):\r\n i+=1\r\n j=-1\r\n while(j<=65):\r\n j+=1\r\n if(l<=x**i+y**j<=r):\r\n vec.append(x**i+y**j)\r\nvec.append(l-1)\r\nvec.append(r+1)\r\nvec.sort()\r\nmaxi=0\r\nfor i in range(1,len(vec)):\r\n maxi=max(maxi,vec[i]-vec[i-1]-1)\r\nprint(maxi)", "x, y, l, r = map(int, input().split())\r\na = []\r\ni = 0\r\nwhile x ** i <= r:\r\n j = 0\r\n while y ** j <= r:\r\n k = x ** i + y ** j\r\n if l <= k <= r:\r\n a.append(k)\r\n j += 1\r\n i += 1\r\na.append(l - 1)\r\na.append(r + 1)\r\na.sort()\r\nm = 0\r\nfor i in range(1, len(a)):\r\n m = max(a[i] - a[i - 1] - 1, m)\r\nprint(m)", "lx=[1]\r\nx,y,Left,r=map(int,input().split())\r\nX=x\r\nwhile(X<=r):\r\n\tlx.append(X)\r\n\tX*=x\r\nly=[1]\r\nY=y\r\nwhile(Y<=r):\r\n\tly.append(Y)\r\n\tY*=y\r\nL=[]\r\nfor i in lx:\r\n\tfor j in ly:\r\n\t\tL.append(i+j)\r\nL=set(L)\r\nl=[Left-1]\r\nfor i in L:\r\n\tif Left<=i<=r:\r\n\t\tl.append(i)\r\nl.sort()\r\nl.append(r+1)\r\nans=0\r\nfor i in range(1,len(l)):\r\n\tans=max(ans,l[i]-l[i-1]-1)\r\nprint(ans)", "x, y, l, r = list(map(int, input().split()))\r\nunlucky = [0]\r\na = 1\r\nwhile(a <= r):\r\n b = 1\r\n while(a+b <= r):\r\n unlucky.append(a+b)\r\n b *= y\r\n a *= x\r\nunlucky.append(r+1)\r\nunlucky.sort()\r\nans = 0\r\n\r\nfor i in range(1, len(unlucky)):\r\n ans = max(ans, unlucky[i]-max(l-1, unlucky[i-1]) - 1)\r\n\r\nprint(ans)\r\n", "[x, y, l, r] = [int(i) for i in input().split()]\r\narr = [l - 1, r + 1]\r\n\r\nfor i in range(100):\r\n for j in range(100):\r\n add = x ** i + y ** j\r\n if (add >= l) and (add <= r):\r\n arr.append(add)\r\narr.sort()\r\nans = 0\r\nfor i in range(len(arr) - 1):\r\n ans = max(ans, arr[i + 1] - arr[i] - 1)\r\n\r\nprint(ans)\r\n", "x, y, l, r = map(int, input().split())\nrx = 0\nwhile x**rx < r:\n rx += 1\nry = 0\nwhile y**ry < r:\n ry += 1\n\narr = [l - 1, r + 1]\nfor i in range(rx):\n for j in range(ry):\n tmp = x**i + y**j\n if l <= tmp <= r:\n arr.append(tmp)\narr = list(sorted(set(arr)))\n\nans = 0\nfor i in range(1, len(arr)):\n ans = max(ans, arr[i] - arr[i - 1] - 1)\nprint(ans)\n", "x,y,l,r=list(map(int,input().split()))\nb=set()\na=0\nb.add(l-1)\nb.add(r+1)\nfor i in range(100):\n xx=x**i\n if xx>r: break\n for j in range(100):\n rr=xx+(y**j)\n if rr>r: break\n if rr>=l:\n b.add(rr)\nb=sorted(list(b))\nfor i in range(1,len(b)):\n a=max(a,b[i]-b[i-1]-1)\nprint(a)\n", "x, y, l, r = [int(x) for x in input().split()]\r\np_x = [1]\r\np_y = [1]\r\nfor i in range(1, 61):\r\n p_x.append(p_x[len(p_x) - 1] * x)\r\n p_y.append(p_y[len(p_y) - 1] * y)\r\npossible = set([0])\r\nfor i in range(61):\r\n for j in range(61):\r\n possible.add(p_x[i] + p_y[j])\r\na = []\r\nfor x in possible:\r\n a.append(x)\r\na.sort()\r\nans = 0\r\nfor i in range(1, len(a)):\r\n l1 = max(a[i - 1], l - 1)\r\n r1 = min(a[i], r + 1)\r\n ans = max(ans, r1 - l1 - 1)\r\nprint(ans)", "def sol(x, y, l ,r):\r\n myset = set()\r\n _x = 1\r\n v = []\r\n while _x <= 1000000000000000000:\r\n _y = 1\r\n while _x + _y <= 1000000000000000000:\r\n if _x + _y >= l and _x + _y <= r:\r\n myset.add(_x + _y)\r\n _y *= y\r\n _x *= x\r\n for s in myset:\r\n v.append(s)\r\n v.append(l-1)\r\n v.append(r+1)\r\n v.sort()\r\n ans = 0\r\n for i in range(1, len(v)):\r\n ans = max(ans, v[i] - v[i-1] - 1)\r\n return ans\r\n\r\nx, y, l, r = input().split()\r\nprint(sol(int(x), int(y), int(l), int(r)))", "\r\nimport math\r\nx,y,l,r=map(int,input().split())\r\nyrs=[]\r\nlim=math.ceil(math.log(r,min(x,y)))\r\nfor i in range(int(lim+1)):\r\n for j in range(int(lim+1)):\r\n num=x**i+y**j\r\n #print(i,j,num)\r\n if l<=num and num<=r:\r\n yrs.append(num)\r\nyrs.append(l-1)\r\nyrs.append(r+1)\r\nyrs.sort()\r\nans=0\r\n#print(yrs,lim)\r\nfor i in range(1,len(yrs)):\r\n ans=max(ans,yrs[i]-yrs[i-1]-1)\r\nprint(ans)", "from operator import le\r\n\r\n\r\na, b, l, r = map(int, input().split())\r\n\r\nva = []\r\nvb = []\r\n\r\nres = 1\r\nfor i in range(100):\r\n if(res > 10 ** 18): break\r\n va.append(res)\r\n res *= a\r\n\r\nres = 1\r\nfor i in range(100):\r\n if(res > 10 ** 18): break\r\n vb.append(res)\r\n res *= b\r\n\r\ntemp = []\r\n\r\nfor i in va:\r\n for j in vb:\r\n temp.append(i + j)\r\n\r\ntemp.append(0)\r\ntemp.append(10**19)\r\ntemp.sort()\r\n\r\nans = 0\r\n\r\nfor i in range(0, len(temp) - 1):\r\n if(temp[i] > r): break\r\n le = temp[i]\r\n re = temp[i + 1]\r\n\r\n res = (re - le) - 1\r\n one = (l - le) - 1\r\n if(one < 0): \r\n one = 0\r\n two = (re - r) - 1\r\n if(two < 0):\r\n two = 0\r\n\r\n ans = max(ans, res - (one + two))\r\n\r\nprint(ans)", "x, y, l, r = list(map(int, input().split()))\r\ns = set()\r\ns.add(l - 1)\r\ns.add(r + 1)\r\nfor i in range(100):\r\n xx = x ** i\r\n for j in range(100):\r\n yy = xx + (y ** j)\r\n if yy > r: break\r\n if yy > l - 1: s.add(yy)\r\nres = 0\r\ns = sorted(s)\r\nfor i in range(1, len(s)):\r\n res = max(res, s[i] - s[i - 1] - 1)\r\nprint(res)\r\n", "x,y,l,r=list(map(int,input().split()))\r\nb=set()\r\na=0\r\nb.add(l-1)\r\nb.add(r+1)\r\nfor i in range(100):\r\n xx=x**i\r\n if xx>r: break\r\n for j in range(100):\r\n rr=xx+(y**j)\r\n if rr>r: break\r\n if rr>=l:\r\n b.add(rr)\r\nb=sorted(list(b))\r\nfor i in range(1,len(b)):\r\n a=max(a,b[i]-b[i-1]-1)\r\nprint(a)", "\r\n\r\nx, y, l, r = map(int, input().split())\r\n\r\n\r\ncurrent = 1\r\n\r\na, b, v = [], [], []\r\n\r\nwhile current <= 1e18:\r\n\ta.append(current)\r\n\tcurrent *= x\r\n\r\ncurrent = 1\r\n\r\nwhile current <= 1e18:\r\n\tb.append(current)\r\n\tcurrent *= y\r\n\r\n\r\nfor A in a:\r\n\tfor B in b:\r\n\t\tif A + B >= l and A + B <= r:\r\n\t\t\tv.append(A + B)\r\n\r\n\r\nv.sort()\r\n\r\nrecord = 0\r\n\r\nfor i in range(1, len(v)):\r\n\trecord = max(record, v[i] - v[i - 1] - 1)\r\n\r\n\r\nif v:\r\n\trecord = max(record, v[0] - l)\r\n\trecord = max(record, r - v[-1])\r\n\r\n\tprint(record)\r\nelse:\r\n\tprint(r - l + 1)", "x, y, l, r = map(int, input().split());\r\n#print(x, y, l, r)\r\n\r\nn1 = 1\r\nn2 = 1\r\nnumber = []\r\nnumber.append(l - 1)\r\nwhile(n1 <= r):\r\n n2 = 1\r\n while n2 <= r:\r\n if(n1 + n2 <= r and n1 + n2 >= l):\r\n number.append(n1 + n2)\r\n n2 *= y\r\n n1 *= x\r\nnumber.append(r + 1)\r\nnumber.sort()\r\nans = 0\r\nfor i in range(1,len(number)):\r\n ans = max(ans, number[i] - number[i-1] - 1)\r\n#print(number)\r\nprint(ans)", "import math\r\nx,y,l,r=list(map(int,input().strip().split(' ')))\r\nmaxa=int(math.log(max(r-1,1),x))\r\nmaxb=int(math.log(max(r-1,1),y))\r\ntemp=[l-1]\r\n\r\n\r\nfor i in range(maxa+1):\r\n for j in range(maxb+1):\r\n haha=(x**i+y**j)\r\n if haha>=l and haha<=r :\r\n temp+=[x**i+y**j]\r\ntemp=sorted(temp)\r\ntemp+=[r+1]\r\nMAX=0\r\n\r\n#print(temp)\r\nfor i in range(0,len(temp)-1):\r\n length=temp[i+1]-temp[i]-1\r\n if length>MAX:\r\n MAX=length\r\nprint(MAX) \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "\r\nx, y, l, r = map(int, input().split())\r\ns = set()\r\n\r\npx = 1\r\npy = 1\r\nwhile px <= r:\r\n while py <= r:\r\n if (l <= px + py and px + py <= r):\r\n s.add(px + py)\r\n py = py * y\r\n py = 1\r\n px = px * x\r\n\r\ns.add(l - 1)\r\ns.add(r + 1)\r\n\r\nt = []\r\nfor x in s:\r\n t.append(x)\r\n\r\nt.sort()\r\n\r\nans = 0\r\nfor i in range(1, len(t)):\r\n ans = max(ans, t[i] - t[i - 1] - 1)\r\n\r\nprint(ans)", "x, y, l, r = map(int, input().split())\n\na = []\n\ncur = 1\nwhile cur <= r:\n cur2 = 1\n while cur2 <= r:\n t = cur + cur2\n if t >= l and t <= r:\n a.append(t)\n cur2 *= y\n cur *= x\n\na.append(r + 1)\na.sort()\nn = len(a)\nans = 0\nfor i in range(n):\n t = a[i] - l\n if t > ans:\n ans = t\n l = a[i] + 1\nprint(ans)\n", "x,y,l,r = list(map(int, input().strip().split()))\r\n\r\nxC,yC = [1], [1]\r\nwhile xC[-1] < r:\r\n a = xC[-1] * x\r\n xC.append(a)\r\nwhile yC[-1] < r:\r\n a = yC[-1] * y\r\n yC.append(a)\r\nsumming = []\r\nfor i in xC:\r\n for j in yC:\r\n if l <= i+j <= r:\r\n summing.append(i+j)\r\nsumming = list(set(summing))\r\nsumming.sort(reverse = True)\r\nsumming.append(l-1)\r\nsumming = summing[::-1]\r\nsumming.append(r+1)\r\nm = 0\r\nfor i in range(len(summing)-1):\r\n m = max(m, summing[i+1] - summing[i] - 1)\r\nprint(m)", "from math import *\r\nx, y, l, r = input().split()\r\nx=int(x)\r\ny=int(y)\r\nl=int(l)\r\nr=int(r)\r\nn=log2(r) \r\nn=ceil(n) \r\nA=[l-1]\r\nfor i in range(n):\r\n xx=x**i\r\n s=0\r\n j=0\r\n while s<=r:\r\n if s>=l:\r\n A.append(s)\r\n yy=y**j\r\n s=xx+yy\r\n j+=1\r\nA.sort()\r\nA.append(r+1)\r\nB=[1]\r\nfor i in range(1,len(A)):\r\n if A[i]-A[i-1]>1:\r\n B.append(A[i]-A[i-1])\r\nprint(max(B)-1)", "inp = input().split()\r\nx = int(inp[0])\r\ny = int(inp[1])\r\nl = int(inp[2])\r\nr = int(inp[3])\r\nnumbers = []\r\nfor a in range(0, 65):\r\n for b in range(0, 65):\r\n c = x**a + y**b\r\n if l <= c <= r:\r\n numbers.append(c)\r\nnumbers.append(l-1)\r\nnumbers.append(r+1)\r\nnumbers.sort()\r\nl = len(numbers)\r\nmaxi = 0\r\nfor i in range(1, l):\r\n maxi = max(maxi, numbers[i] - numbers[i-1] - 1)\r\nprint(maxi)\r\n", "(Xs, Ys) = ([1], [1])\n\n\n\nx, y, l, r = list(map(int, input().split()))\nwhile Xs[-1]/x <= r:\n\tXs.append(x * Xs[-1])\n\nwhile Ys[-1]/y <= r:\n\tYs.append(y*Ys[-1])\ns = set()\nfor X in Xs:\n\tfor Y in Ys:\n\t\ts.add(X + Y)\ns.add(0)\nls = list(s)\nls.sort()\nval = 0\nfor i in range(len(ls)):\n\tval = max(min(r + 1, ls[i]) - max(l - 1, ls[i - 1]) - 1, val)\n\t# print(ls[i], ls[i - 1], val)\nprint(val)", "x, y, l, r = map(int, input().split())\r\na = set()\r\nfor i in range(60):\r\n for j in range(60):\r\n #print(i, j, x ** i + y ** j);\r\n a.add(x ** i + y ** j)\r\na.update({l - 1, r + 1})\r\nxp = -1\r\nans = 0\r\na = sorted(a)\r\nfor i in a:\r\n if (xp != -1 and l <= xp + 1 and i - 1 <= r):\r\n ans = max(ans, i - xp - 1)\r\n xp = i;\r\nprint(ans)", "x, y, l, r = map(int, input().split())\nxs = [x ** i for i in range(61) if x ** i <= 10 ** 18]\nys = [y ** i for i in range(61) if y ** i <= 10 ** 18]\nps = set()\nfor i in xs:\n\tfor j in ys:\n\t\tif l <= i + j <= r:\n\t\t\tps.add(i + j)\nps.add(l - 1)\nps.add(r + 1)\nps = sorted(list(ps))\nans = 0\nfor i in range(1, len(ps)):\n\tans = max(ans, ps[i] - ps[i - 1] - 1)\nprint(ans)\n\n\n", "x, y, l, r = map(int, input().split())\r\n\r\nv = []\r\n\r\nfor a in range(60):\r\n for b in range(60):\r\n v.append(x ** a + y ** b)\r\n\r\nv = sorted(list(filter(lambda n: l <= n <= r, v)))\r\nv = [l - 1] + v + [r + 1]\r\n\r\nans = max(v - u - 1 for u, v in zip(v, v[1:]))\r\nprint(ans)\r\n", "x, y, l, r=map(int, input().split())\r\nt=1\r\nans=0\r\na=[]\r\nwhile (t<=r):\r\n\tt2=1\r\n\twhile(t2<=r):\r\n\t\ta.append(t+t2)\r\n\t\tt2*=y\r\n\tt=t*x\r\na.append(l-1);\r\na.append(r+1);\r\na.sort()\r\nfor l2 in range(len(a)-1):\r\n\t#print(a[l2])\r\n\tif (a[l2]>=l-1 and a[l2+1]<=r+1 and a[l2+1]-a[l2]>ans):\r\n\t\tans=a[l2+1]-a[l2]-1\r\nprint(ans)", "def inRange(a, b, l, r):\r\n\treturn a >= l and b <= r\r\n\r\nx, y, l, r = [int(x) for x in input().split()]\r\n\r\nxp, yp = [1], [1]\r\n\r\ncx, cy = x, y\r\n\r\nwhile True :\r\n\txp.append(cx)\r\n\tif cx > r :\r\n\t\tbreak\r\n\tcx = cx*x\r\n\r\nwhile True:\r\n\typ.append(cy)\r\n\tif cy > r :\r\n\t\tbreak\r\n\tcy = cy*y\r\n\r\nst = []\r\n\r\nfor i in range(len(xp)):\r\n\tfor j in range(len(yp)):\r\n\t\tst.append(xp[i]+yp[j])\r\n\r\ntp = [l-1, r+1]\r\nfor i in st:\r\n\tif i >= l and i <= r:\r\n\t\ttp.append(i)\r\n\r\ntp.sort()\r\n\r\nans = 0\r\nfor i in range(len(tp)-1):\r\n\tans = max(ans, tp[i+1] - tp[i] - 1)\r\n\t\r\nprint(ans)", "x,y,l,r=map(int,input().split())\r\ns=set()\r\ns.add(l-1)\r\ns.add(r+1)\r\nfor i in range(60):\r\n for j in range(60):\r\n n=x**i+y**j\r\n if l<=n<=r:\r\n s.add(n)\r\n\r\ns=sorted(list(s))\r\nm=len(s)\r\nans=0\r\nfor i in range(m-1):\r\n ans=max(ans,s[i+1]-s[i]-1)\r\nprint(ans)", "x,y,l,r = list(map(int,input().split()))\na = []\nf = 1\nwhile f < r:\n\tg = 1\n\twhile f + g <= r:\n\t\tif f + g >= l:\n\t\t\ta.append(f + g)\n\t\tg *= y\n\tf *= x\na += [l-1,r+1]\na.sort()\nm = 1\nfor i in range(1,len(a)):\n\tif a[i-1] != a[i]:\n\t\ta[m] = a[i]\n\t\tm += 1\nans = 0\nfor i in range(1,m):\n\tans = max(ans, a[i] - a[i-1] - 1)\nprint(ans)\n", "# IAWT\r\nimport math\r\ndef f():\r\n global arr\r\n \r\n x, y, l, r = list(map(int, input().split()))\r\n arr = []\r\n for a in range(int(math.log(r, x))+1):\r\n for b in range(int(math.log(r, y))+1):\r\n if l <= x**a+y**b <= r:\r\n arr.append(x**a+y**b)\r\n arr.sort()\r\n if arr == []:\r\n print(r-l+1)\r\n return\r\n m = max(arr[0] - l, r - arr[-1])\r\n for i in range(1, len(arr)):\r\n m = max(m, arr[i] - arr[i-1] - 1)\r\n print(m)\r\nf()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx, y, l, r = map(int, input().split())\r\nxa, yb = 1, 1\r\ns = set()\r\nwhile xa <= r:\r\n while xa + yb <= r:\r\n if xa + yb >= l:\r\n s.add(xa + yb)\r\n yb *= y\r\n xa *= x\r\n yb = 1\r\ns.add(l - 1)\r\ns.add(r + 1)\r\ns = list(s)\r\ns.sort()\r\nans = 0\r\nfor i in range(len(s) - 1):\r\n ans = max(ans, s[i + 1] - s[i] - 1)\r\nprint(ans)", "x,y,l,r = map(int, input().split())\r\nbad = []\r\nfor i in range(61):\r\n for j in range(61):\r\n cr = x ** i + y ** j\r\n if l <= cr <= r: \r\n bad.append(x ** i + y ** j)\r\nbad = [l] + bad + [r]\r\nbad.sort()\r\nmx = 0\r\nif len(bad) == 2:\r\n print(max(mx, bad[1] - bad[0] + 1))\r\n exit(0)\r\nfor i in range(len(bad) - 1):\r\n cr = bad[i + 1] - bad[i] - 1\r\n if i == 0 or i == len(bad) - 2:\r\n cr += 1\r\n mx = max(mx, cr)\r\nprint(mx)\r\n", "from math import log, ceil\r\nx, y, l, r = [int(i) for i in input().split()]\r\nans = 0\r\n\r\nnm = ceil(log(r, x)) + 2\r\nmm = ceil(log(r, y)) + 2\r\n\r\nv = [l - 1, r + 1]\r\n\r\nfor n in range(nm):\r\n for m in range(mm):\r\n cur = x ** n + y ** m\r\n if cur < l or cur > r:\r\n continue\r\n v.append(cur)\r\n\r\nv.sort()\r\n\r\nfor i in range(1, len(v)):\r\n ans = max(ans, v[i] - v[i - 1] - 1)\r\n\r\nprint(ans)\r\n", "x, y, l, r = input().split()\nx = int(x)\ny = int(y)\nl = int(l)\nr = int(r)\na = [1]\nb = [1]\nINF = 10**18\nwhile a[-1] < INF:\n\ta.append(a[-1]*x)\nwhile b[-1] < INF:\n\tb.append(b[-1]*y)\n\nc = []\nfor i in a:\n\tfor j in b:\n\t\tc.append(i+j)\n\t\nc = list(set(c))\nc.sort()\n\nMAX = 0\nlast = l\nfor i in c:\n\tif i < l:\n\t\tcontinue\n\tif i > r:\n\t\tMAX = max(MAX, r-last+1)\n\t\tbreak\n\n\tMAX = max(MAX, i-last)\n\tlast = i+1\nprint (MAX)\n\n", "x,y,l,r = map(int,input().split())\nxl = [1]\nwhile xl[-1]*x <= r:\n xl.append(xl[-1]*x)\nyl = [1]\nwhile yl[-1]*y <= r:\n yl.append(yl[-1]*y)\nxyl = {a+b for a in xl for b in yl if l<=a+b<=r}\nif xyl:\n xyl = sorted(list(xyl))\n ans = max(xyl[0]-l,r-xyl[-1])\n for i in range(len(xyl)-1):\n ans = max(ans,(xyl[i+1]-xyl[i]-1))\n print(ans)\nelse:\n print(r-l+1)\n", "x, y, l, r = map(int, input().split())\r\ns = list()\r\na = 0\r\nwhile(pow(x, a)<=1e18):\r\n b = 0\r\n while(pow(y, b)<=1e18):\r\n num = pow(x,a)+pow(y,b)\r\n if(num>=l and num<=r):\r\n s.append(num)\r\n if(num>r):\r\n break\r\n b+=1\r\n a+=1\r\ns.sort()\r\nres = 0\r\nprev = l\r\nfor num in s:\r\n res = max(res, num-prev)\r\n prev = num+1\r\n\r\nres = max(res, r+1-prev)\r\nprint(res)", "p=1\r\nc=0\r\nans=[]\r\nx,y,l,r=map(int,input().split())\r\nans.append(l-1)\r\nans.append(r+1)\r\nfor i in range(1,64):\r\n if p>r:break\r\n q=1\r\n for j in range(1,64):\r\n if(p+q>r):break\r\n if l<=p+q<=r:ans.append(p+q)\r\n q*=y\r\n p*=x\r\nans.sort()\r\nfor i in range(len(ans)-1):\r\n c=max(c,ans[i+1]-ans[i]-1)\r\nprint(c)", "from sys import stdin\r\nimport re\r\nimport math\r\n\r\ndef readInt(count=1):\r\n m = re.match('\\s*' + ('([+-]?\\d+)\\s*' * count), stdin.readline())\r\n if m is not None:\r\n ret = []\r\n for i in range(1, m.lastindex + 1):\r\n ret.append(int(m.group(i)))\r\n return ret\r\n return None\r\n\r\nx, y, l, r = readInt(4)\r\n\r\nmax = 0\r\nunhappyYears = [l-1]\r\nxa = 1\r\nwhile xa <= r:\r\n yb = 1\r\n while True:\r\n val = xa + yb\r\n if val > r:\r\n break\r\n if val >= l and val not in unhappyYears:\r\n unhappyYears.append(val)\r\n yb *= y\r\n xa *= x\r\nunhappyYears.sort()\r\nunhappyYears.append(r+1)\r\n\r\nfor i in range(len(unhappyYears)-1):\r\n cur = unhappyYears[i+1] - unhappyYears[i] - 1\r\n if cur > max:\r\n max = cur\r\nprint(max)", "x, y, l, r = map(int, input().split())\r\n\r\ng = [l - 1, r + 1]\r\n\r\nfor a in [ x ** i for i in range(65) if x ** i <= r] :\r\n\tfor b in [ y ** i for i in range(65) if y ** i <= r - a ]:\r\n\t\tif l <= a + b:\r\n\t\t\tg.append(a + b)\r\ng.sort()\r\nans = 0\r\nfor i in range(1, len(g)):\r\n\tans = max(ans, g[i] - g[i - 1] - 1)\r\nprint(ans)", "max_n = int(1e18)\nx, y, l, r = map(int, str(input()).split(' '))\nXa = []\nYb = []\nt = 1\nwhile t <= r:\n Xa.append(t)\n t *= x;\n\nt = 1\nwhile t <= r:\n Yb.append(t)\n t *= y;\n\nunlucky = []\nfor i1 in Xa:\n for i2 in Yb:\n if i1 + i2 >= l and i1 + i2 <= r:\n unlucky.append(i1 + i2)\n \nunlucky.append(r+1)\nunlucky = sorted(list(set(unlucky)))\n\nleft = l-1\nans = 0\nfor d in unlucky:\n ans = max(ans, d-left-1);\n left = d;\n\nprint(ans)\n \t \t\t \t \t \t \t\t \t \t\t \t \t", "x,y,l,r=map(int,input().split())\r\nA=[l-1]\r\nfor i in range(100):\r\n\tif x**i>r:\r\n\t\tbreak\r\n\tfor j in range(100):\r\n\t\tif y**j>r:\r\n\t\t\tbreak\r\n\t\tt=x**i+y**j\r\n\t\tif t>=l and t<=r:\r\n\t\t\tA.append(t)\r\nA.append(r+1)\r\nA.sort()\r\nans=0\r\nfor i in range(len(A)-1):\r\n\tans=max(ans,A[i+1]-A[i]-1)\r\nprint(ans)\r\n\r\n", "def solve(a,c,n,m):\r\n x,y=1,1\r\n nms=[]\r\n lm=2*(10**18)\r\n for i in range(101):\r\n y=1\r\n for j in range(101):\r\n if x+y<=m and x+y>=n:\r\n nms.append(x+y)\r\n if y*c>lm:\r\n break\r\n y*=c\r\n if x*a>lm:\r\n break\r\n x*=a\r\n nms.append(n-1)\r\n nms.append(m+1)\r\n nms.sort()\r\n cnt=0\r\n for i in range(1,len(nms)):\r\n cnt=max(cnt,nms[i]-nms[i-1]-1)\r\n return cnt\r\n\r\na,c,n,m=map(int,input().split())\r\nprint(solve(a,c,n,m))\r\n \r\n", "x, y, l, r = list(map(int, input().strip().split(\" \")))\n\ncx = 1\ncy = 1\nv = []\nwhile True:\n if cx > r:\n break\n cy = 1\n while True:\n if cx + cy > r:\n break\n if cx + cy >= l:\n v.append(cx + cy)\n cy = cy * y\n cx = cx * x\nv.append(l-1)\nv.append(r+1)\nv.sort()\nvd = []\nres = 0\nfor i in range(len(v)-1):\n if v[i] == v[i+1]:\n continue\n res = max(res, v[i+1] - v[i] - 1)\nprint(res)", "x,y,l,r = [int(masuk) for masuk in input().split()]\nans = 0\n\nburuk = []\nfor a in range(70):\n\tfor b in range(70):\n\t\tkiri = pow(x,a)\n\t\tkanan = pow(y,b)\n\t\twew = kiri+kanan\n\t\tif (wew>r):\n\t\t\tbreak;\n\t\t\n\t\tif (wew<l):\n\t\t\tcontinue;\n\t\t\t\n\t\tif (not(wew in buruk)):\n\t\t\tburuk.append(wew)\n\nif (not( (l-1) in buruk)):\n\tburuk.append(l-1)\nif (not( (r+1) in buruk)):\n\tburuk.append(r+1)\n\t\nburuk.sort()\n#print(buruk)\n\nfor i in range(len(buruk)-1):\n\tans = max(ans,buruk[i+1]-buruk[i]-1)\n\n\t\nprint(ans)\n", "import sys\r\nimport math\r\nfrom collections import defaultdict,deque\r\nimport heapq\r\n\r\nx,y,l,r = map(int,sys.stdin.readline().split())\r\nleft1 = math.ceil(math.log(l,x))\r\nleft2 = math.ceil(math.log(l,y))\r\nright1 = math.floor(math.log(r,x))\r\nright2 = math.floor(math.log(r,y))\r\na=set()\r\n#print(left1,'left1',right1,'right1')\r\n#print(left2,'left2',right2,'right2')\r\nfor i in range(right1+1):\r\n\tcnt = 0\r\n\twhile pow(x,i) + pow(y,cnt) <= r:\r\n\t\tz=pow(x,i) + pow(y,cnt)\r\n\t\tif z>=l:\r\n\t\t\ta.add(z)\r\n\t\t#a.add(pow(x,i)+pow(y,cnt))\r\n\t\tcnt+=1\r\nfor i in range(right2+1):\r\n\tcnt=0\r\n\twhile pow(y,i)+pow(x,cnt)<=r:\r\n\t\tz=pow(y,i)+pow(x,cnt)\r\n\t\tif z>=l:\r\n\t\t\ta.add(z)\r\n\t\t#a.add(pow(y,i)+pow(x,cnt))\r\n\t\tcnt+=1\r\na.add(l-1)\r\na.add(r+1)\r\na = list(a)\r\na.sort()\r\nans = 0\r\nn=len(a)\r\n#print(a,'a')\r\nfor i in range(n-1):\r\n\tdif=a[i+1]-a[i]-1\r\n\tans=max(ans,dif)\r\nprint(ans)\r\n", "p = range(61)\nx,y,l,r = map(int,input().split())\na = [l-1,r+1]\n\nfor i in [ x**i for i in p if x**i <= r]:\n for j in [ y**i for i in p if y**i <= r-i]:\n if i+j >= l and i+j <= r:\n a.append(i+j)\n\na.sort()\nans = 0\nfor i in range(1,len(a)):\n ans = max(ans,a[i] - a[i-1] -1)\nprint(ans)\n", "x, y , l , r = map(int,input().split(' '))\r\n\r\narr_x = [1]\r\nwhile True :\r\n if arr_x[-1]*x <= r :\r\n arr_x.append(arr_x[-1]*x)\r\n else :\r\n break\r\n\r\narr_y = [1]\r\nwhile True :\r\n if arr_y[-1]*y <= r :\r\n arr_y.append(arr_y[-1]*y)\r\n else :\r\n break\r\n\r\nL = [i+j for i in arr_x for j in arr_y if i+j >= l and i+j <=r]\r\nL = sorted(list(set(L)))\r\n\r\nans = 0\r\ncurr = l-1\r\nfor i in L :\r\n ans = max(ans,i-curr-1)\r\n curr = i\r\n\r\nans = max(ans,r+1 - curr - 1)\r\n\r\nprint(ans)\r\n", "import sys\r\nfrom itertools import product\r\n\r\nx, y, l, r = map(int, input().split())\r\n\r\nxp, yp = [], []\r\nfor i in range(100):\r\n xp.append(x**i)\r\n if x**i >= r:\r\n break\r\n\r\nfor i in range(100):\r\n yp.append(y**i)\r\n if y**i >= r:\r\n break\r\n\r\nunlucky = set()\r\nfor xa, yb in product(xp, yp):\r\n unlucky.add(xa+yb)\r\n\r\nunlucky = sorted(unlucky)\r\nans = 1 if l == 1 else 0\r\n\r\nfor sl, sr in zip(unlucky, unlucky[1:]):\r\n ans = max(ans, min(r, sr-1) - max(l, sl+1) + 1)\r\n\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom bisect import bisect_left,bisect_right\r\nx,y,l,r=map(int,input().split())\r\nINF=5*10**18\r\nv=1\r\nlx=[]\r\nwhile v<=INF:\r\n lx.append(v)\r\n v*=x\r\nly=[]\r\nv=1\r\nwhile v<=INF:\r\n ly.append(v)\r\n v*=y\r\na=[]\r\nfor xx in lx:\r\n for yy in ly:\r\n if xx+yy<=INF:\r\n a.append(xx+yy)\r\na.sort()\r\nleft=bisect_left(a,l)\r\nans=0\r\nml=INF\r\nfor i in range(left-1,left+2):\r\n if 0<=i<len(a) and l<=a[i]:\r\n ml=min(ml,a[i]-l)\r\nif ml<INF:\r\n ans=max(ans,ml)\r\nright=bisect_right(a,r)\r\nmr=INF\r\nfor i in range(right-1,right+2):\r\n if 0<=i<len(a) and r>=a[i]:\r\n mr=min(mr,r-a[i])\r\nif mr<INF:\r\n ans=max(ans,mr)\r\nfor i in range(left,right):\r\n if 1<=i+1<len(a) and a[i]>=l and a[i+1]<=r:\r\n ans=max(ans,a[i+1]-a[i]-1)\r\nprint(min(ans,r-l+1))", "x,y,l,r = map(int, input().split())\n\nunl = []\nfor i in range(0, 70):\n for j in range(0, 70):\n xx = x**i + y**j\n if ( xx>=l and xx<=r):\n unl.append(xx)\n\nunl.sort()\n\nif (len(unl) == 0) :\n print(r - l + 1)\n exit(0)\n\ndiff = []\nif (unl[0] != l) :\n diff.append(unl[0] - l)\n\nif ( unl[-1] != r) :\n diff.append(r - unl[-1])\n\nfor i in range(1,len(unl)):\n d = (unl[i] - unl[i-1] -1)\n if ( d > 0):\n diff.append(d)\n\n\ndiff.sort();\n\nif (len(diff) == 0) :\n print(0)\n\nelse :\n print(diff[-1])\n\n\n\n", "x, y, l, r = map(int, input().split())\nyrs = set()\nyrs.add(l-1)\nyrs.add(r+1)\nfor a in range(0, 70):\n for b in range(0, 70):\n n = x**a + y**b\n if (n>=l and n<=r):\n yrs.add(n)\n\nyrs = sorted(yrs)\nmx = 0\nfor i in range(1, len(yrs)):\n mx = max(mx, yrs[i]-yrs[i-1]-1)\nprint(mx)", "s=input()\r\naa=s.split()\r\n#print(a)\r\nx=int(aa[0])\r\ny=int(aa[1])\r\nl=int(aa[2])\r\nr=int(aa[3])\r\n\r\nvbad=[]\r\nfor a in range(0,1000):\r\n if(x**a>r):\r\n break\r\n for b in range(0,1000):\r\n t=x**a + y**b\r\n if(t<l):\r\n continue\r\n if(t>r):\r\n break\r\n vbad.append(t)\r\n\r\nvbad.append(l-1)\r\nvbad.append(r+1)\r\nvbad.sort()\r\n\r\nmd=0\r\nfor i in range(0,len(vbad)-1):\r\n if(vbad[i+1]-vbad[i]>md):\r\n md=vbad[i+1]-vbad[i]\r\n\r\nprint(md-1)\r\n", "'''\r\nCreated on Jun 6, 2017\r\n\r\n@author: Zhao Huangjie\r\n'''\r\n\r\nx,y,l,r = map(int,input().split())\r\nli = [l-1]\r\nfor i in range(64):\r\n a = x**i \r\n if a>r:\r\n break \r\n for j in range(64):\r\n b = y**j \r\n if a+b>r:\r\n break\r\n if a+b>=l:\r\n li.append(a+b)\r\nli.append(r+1)\r\nli = sorted(li)\r\nans = 0\r\nfor i in range(len(li)-1):\r\n ans=max(ans,li[i+1]-li[i]-1)\r\n \r\nprint(ans)\r\n", "x, y, l, r = map(int, input().split())\r\nm = []\r\na = 0\r\nb = 0\r\nwhile x**a <= r:\r\n while x**a + y**b <= r:\r\n d = x**a + y**b\r\n if d >= l:\r\n m.append(x**a + y**b)\r\n b += 1\r\n a += 1\r\n b = 0\r\nm = list(set(m))\r\nm.sort()\r\nma = 0\r\nif len(m) == 0:\r\n print(r - l + 1)\r\n exit(0)\r\nfor i in range(1, len(m)):\r\n if m[i] - m[i-1] > ma:\r\n ma = m[i] - m[i-1] - 1\r\nma = m[0] - l if m[0] - l > ma else ma\r\nma = r - m[-1] if r - m[-1] > ma else ma\r\nprint(ma)", "x,y,l,r=map(int,input().split())\r\n\r\nxx=[]\r\nyy=[]\r\np=1\r\nxx.append(l-1);\r\nwhile p<=r:\r\n q=1\r\n while p+q<=r:\r\n if p+q>=l and p+q<=r:\r\n xx.append(p+q)\r\n q*=y\r\n p*=x\r\nxx.append(r+1)\r\nxx.sort()\r\n\r\nfor i in range(0,len(xx)-1):\r\n yy.append(xx[i+1]-xx[i]-1)\r\n\r\nprint(max(yy))\r\n", "def f(n,m):\r\n res = []\r\n## a = ceil(log(10**18,x))\r\n## b = ceil(log(10**18,y))\r\n for i in range(60):\r\n for h in range(60):\r\n res.append(x**i+y**h)\r\n res.append(n-1)\r\n res.append(m+1)\r\n return list(set(res))\r\n\r\nx,y,l,r = map(int, input().split(' '))\r\nunh = f(l,r)\r\nunh.sort()\r\nres = 0\r\nfor i in range(len(unh)-1):\r\n if l-1 <= unh[i] <= r+1 and l-1 <= unh[i+1] <= r+1:\r\n res = max(res, unh[i+1]-unh[i])\r\nprint(res-1)\r\n\r\n", "[x, y, l, r] = [int(i) for i in input().split()]\narr = [l - 1, r + 1]\n\nfor i in range(100):\n for j in range(100):\n add = x ** i + y ** j\n if add >= l and add <= r:\n arr.append(add)\n\narr = sorted(arr)\n\nans = 0\n\nfor k in range(len(arr) - 1):\n ans = max(ans, arr[k + 1] - arr[k] - 1)\n\nprint(ans)\n \t \t\t \t\t\t \t \t\t\t\t\t \t\t\t\t\t \t\t \t", "#!/usr/bin/pypy3\n\nfrom sys import stdin,stderr\n\nfrom bisect import bisect\n\ndef readInts(): return map(int,stdin.readline().strip().split())\ndef print_err(*args,**kwargs): print(*args,file=stderr,**kwargs)\n \ndef solve(x,y,l,r):\n def inr(v):\n if v < l-1: return False\n if v > r+1: return False\n return True\n unluckies = all_unlucky(x,y)\n unluckies.add(l-1)\n unluckies.add(r+1)\n unluckies = filter(inr,sorted(unluckies))\n deltas = []\n first = True\n prev = None\n for u2 in unluckies:\n if not first: deltas.append(u2-prev-1)\n prev = u2\n first = False\n return max(deltas)\n\ndef all_unlucky(x,y):\n out = set()\n for a in range(100):\n if x**a > 10**18: break\n for b in range(100):\n if x**a + y**b > 10**18: break\n out.add(x**a+y**b)\n return out\n \ndef run():\n x,y,l,r = readInts()\n print(solve(x,y,l,r))\n \nrun()\n", "x,y,l,r = map(int, input().split())\r\nlx = []\r\nly = []\r\nfor i in range(65):\r\n if x**i > r: break\r\n lx.append(x**i)\r\nfor i in range(65):\r\n if y**i > r: break\r\n ly.append(y**i)\r\n\r\nans = set()\r\nfor i in lx:\r\n for j in ly:\r\n if l <= i+j <= r:\r\n ans.add(i+j)\r\n\r\nans.add(l-1)\r\nans.add(r+1)\r\nans = sorted(list(ans))\r\nanslen = 0\r\nfor i in range(1, len(ans)):\r\n anslen = max(anslen, ans[i]-ans[i-1]-1)\r\n\r\n#print(ans)\r\nprint(anslen)\r\n", "arri = lambda: [int(s) for s in input().split()]\r\nx, y, l, r = arri()\r\nt = [l - 1, r + 1]\r\nxx = 1\r\nwhile xx < r:\r\n yy = 1\r\n while yy < r:\r\n if xx + yy >= l and xx + yy <= r and xx + yy not in t:\r\n t.append(xx + yy)\r\n yy *= y\r\n xx *= x\r\nt.sort()\r\nmx = 0\r\nfor i in range(1, len(t)):\r\n mx = max(mx, t[i] - t[i-1])\r\nprint(mx - 1)", "import sys\r\nmod = 1000000007\r\ndef get_array(): return list(map(int, sys.stdin.readline().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().split())\r\ndef input(): return sys.stdin.readline()\r\ndef print_array(a): print(\" \".join(map(str, a)))\r\ndef main():\r\n x, y, l, r = get_ints()\r\n v = set()\r\n v.add(l - 1)\r\n v.add(r + 1)\r\n for i in range(61):\r\n curx = x ** i\r\n if(curx > r): break\r\n for j in range(61):\r\n cury = y ** j\r\n if(cury > r): break\r\n if(curx + cury >= l and curx + cury <= r): v.add(curx + cury)\r\n v = sorted(list(v))\r\n ans = 0\r\n for i in range(1, len(v)): ans = max(ans, v[i] - v[i - 1] - 1)\r\n print(ans)\r\nif __name__ == \"__main__\":\r\n main()", "inp = input().split()\r\nx = int(inp[0])\r\ny = int(inp[1])\r\nl = int(inp[2])\r\nr = int(inp[3])\r\nlist = []\r\nfor i in range(0,64):\r\n\tfor j in range(0,64):\r\n\t\tt = x**i + y**j\r\n\t\tif t >= l and t <= r:\r\n\t\t\tlist.append(t)\r\nlist.sort()\r\nres = 0\r\nif len(list) == 0:\r\n\tprint (r-l+1)\r\n\tquit()\r\nfor i in range(1,len(list)):\r\n\tres = max(res, list[i]-list[i-1]-1)\r\nres = max(list[0]-l, res)\r\nres = max(res, r - list[len(list)-1])\r\nprint (res)\r\n", "x, y, l, r = map(int, input().split())\r\na = [0]\r\nfor i in range(70):\r\n for j in range(70):\r\n a.append(x ** i + y ** j)\r\na.sort()\r\nans = 0\r\nfor i in range(len(a) - 1):\r\n ans = max(ans, min(r, a[i + 1] - 1) - max(l, a[i] + 1) + 1)\r\nprint(ans)", "x, y, l, r = map(int, input().split())\n\nxs = []\nnow = 1\nwhile True:\n if now > r:\n break\n xs.append(now)\n now *= x\n\nys = []\nnow = 1\nwhile True:\n if now > r:\n break\n ys.append(now)\n now *= y\n\nress = [x + y for x in xs for y in ys]\nress = [i for i in ress if l <= i <= r]\nress.append(l - 1)\nress.append(r + 1)\nress = list(set(ress))\nress = sorted(ress)\n\nlst = -1\nans = 0\nfor i in ress:\n if lst != -1:\n ans = max(ans, i - lst - 1)\n lst = i\n\nprint(ans)\n", "def solve():\r\n x, y, l, r = [int(s) for s in input().split(' ')]\r\n\r\n def pows(x):\r\n z = 1\r\n p = set()\r\n while z <= 10 ** 18:\r\n p.add(z)\r\n z *= x\r\n return p\r\n\r\n x_pows = pows(x)\r\n y_pows = pows(y)\r\n\r\n fails = [l - 1]\r\n\r\n for a in x_pows:\r\n for b in y_pows:\r\n if l <= a + b <= r:\r\n fails.append(a + b)\r\n fails.sort()\r\n fails.append(r + 1)\r\n m = 0\r\n\r\n for i in range(1, len(fails)):\r\n m = max(fails[i] - fails[i - 1] - 1, m)\r\n\r\n return m\r\n\r\n\r\nprint(solve())", "x, y, l, r = map(int, input().split())\n\nunlucky = set()\n\na = 1\nb = 1\n\nwhile a <= r:\n b = 1\n while a + b <= r:\n if a + b >= l:\n unlucky.add(a + b)\n b *= y\n a *= x\n\nls = sorted(unlucky)\nls = [l - 1] + ls + [r + 1]\n\nprv = l\nmx = 0\nfor el in ls:\n mx = max(mx, el - prv - 1)\n prv = el\n\nprint(mx)\n", "inp = input().split()\r\nx = int(inp[0]);\r\ny = int(inp[1]);\r\nl = int(inp[2]);\r\nr = int(inp[3]);\r\np1 = 1;\r\np2 = 1;\r\nunlucky = [];\r\nwhile p1<r:\r\n p2 = 1;\r\n while p2<r:\r\n soma = p1+p2;\r\n if(l<=soma<=r):\r\n if(soma not in unlucky):\r\n unlucky.append(soma);\r\n p2 *= y;\r\n p1 *= x;\r\nunlucky.sort();\r\nans = 0;\r\nif(len(unlucky) > 0):\r\n ans = max(ans, unlucky[0]-l);\r\n for i in range(1,len(unlucky)):\r\n ans = max(ans, unlucky[i]-unlucky[i-1]-1);\r\n ans = max(ans, r-unlucky[-1]);\r\nelse:\r\n ans = r-l+1;\r\n\r\n#for i in unlucky:\r\n# print(i);\r\n\r\nprint(ans);", "'''input\n2 3 1 10\n'''\nx, y, l, r = map(int, input().split())\nu = set([l-1, r+1])\nfor a in range(70):\n\tfor b in range(70):\n\t\tc = x**a + y**b\n\t\tif c >= l and c <= r:\n\t\t\tu.add(c)\nu = sorted(u)\nm = 0\nfor i in range(len(u) - 1):\n\tm = max(m, u[i+1] - u[i] - 1)\nprint(m)" ]

[ "n = int(input())\r\nroom = []\r\nfor i in range(n):\r\n reg = input()\r\n if reg[0] == '+':\r\n room.append(int(reg[2:]))\r\n else:\r\n room.append(-1*int(reg[2:]))\r\n# print(room)\r\n\r\nbefore = []\r\nfor i in range(n): \r\n if room[i] < 0 and -1 * int(room[i]) not in room[:i]:\r\n before.append(-1*room[i])\r\n# print(before)\r\ncapa = len(before)\r\nfor i in range(n):\r\n if room[i] > 0: \r\n before.append(room[i]) \r\n capa = max(capa, len(before))\r\n else: \r\n before.remove(-1*room[i])\r\n capa = max(capa, len(before))\r\nprint(capa)\r\n\r\n", "t = int(input())\r\ncur = 0\r\nma = 0\r\nreg = [0] * 1000001\r\nne=0\r\nfor i in range(t):\r\n y = input()\r\n ind = int(y[2:])\r\n\r\n if y[0] == '+':\r\n cur += 1\r\n reg[ind]=1\r\n ma = max(cur, ma)\r\n else:\r\n if reg[ind] == 0:\r\n\r\n ma = ma+1\r\n else:\r\n cur -= 1\r\n reg[ind] = 0\r\nprint(ma)\r\n", "import sys\r\nimport threading\r\nfrom math import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom functools import lru_cache\r\n \r\ndef gl():return list(map(int, input().split()))\r\ndef gi():return int(input())\r\ndef gc():return input()\r\n \r\ndd = defaultdict\r\ndq = deque\r\nhp = heappush\r\nhpp = heappop\r\nhpf = heapify\r\n \r\ndef solution():\r\n n = gi()\r\n arr = []\r\n for i in range(n):\r\n a, b = list(map(str, input().split()))\r\n b = int(b)\r\n if a == '-':\r\n b = -1*b\r\n arr.append(b)\r\n store = set()\r\n \r\n i = 0\r\n ans = 0\r\n \r\n for i in range(n):\r\n \r\n store = set()\r\n \r\n space = 0\r\n for j in range(i, n):\r\n if arr[j]>0 and len(store)<space:\r\n store.add(arr[j])\r\n elif arr[j]>0:\r\n store.add(arr[j])\r\n space += 1\r\n elif arr[j]<0 and -1*arr[j] not in store:\r\n space += 1\r\n else:\r\n store.remove(-1*arr[j])\r\n ans = max(ans, space)\r\n return print(ans)\r\n \r\n \r\n \r\n \r\n return print(ans)\r\n \r\n \r\n \r\n \r\ndef main():\r\n # t = gi()\r\n # for i in range(t):\r\n solution()\r\n \r\nmain()\r\n# if __name__ == \"__main__\":\r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "\n\nif __name__ == '__main__':\n num = int(input().strip())\n res = 0\n set_ = {}\n for i in range(num):\n input_ = input().strip()\n sy, str_ = input_.split()\n if sy == '+':\n if str_ not in set_:\n set_[str_] = 1\n curr_len = len(set_)\n else:\n if str_ not in set_:\n curr_len = res + 1\n else:\n set_.pop(str_)\n if curr_len >= res:\n res = curr_len\n print(res)\n\n\n\n\t \t\t\t\t \t \t \t\t\t \t\t\t \t \t\t \t", "def solve():\r\n n = int(input())\r\n logs = []\r\n for i in range(n):\r\n logs.append(input().split())\r\n\r\n room = set()\r\n max_count = 0\r\n count = 0\r\n for i in range(n):\r\n if logs[i][0] == '+':\r\n count += 1\r\n room.add(int(logs[i][1]))\r\n else:\r\n if int(logs[i][1]) not in room:\r\n max_count += 1\r\n else:\r\n count -= 1\r\n room.remove(int(logs[i][1]))\r\n max_count = max(max_count, count)\r\n print(max_count)\r\n \r\nsolve()", "# LUOGU_RID: 120891836\nn = int(input())\r\na = [0] * 10000010\r\nans = 0\r\ntmp = 0\r\nfor _ in range(n):\r\n op, num = input().split()\r\n num = int(num)\r\n if op == '+':\r\n a[num] = 1\r\n tmp += 1\r\n if ans < tmp:\r\n ans = tmp\r\n else:\r\n if a[num] == 1:\r\n tmp -= 1\r\n else:\r\n ans += 1\r\nprint(ans)", "m = 0\ns = set()\nn = int(input())\nfor i in range(n):\n flag, number = input().strip().split()\n if flag == '+':\n s.add(number)\n m = max(m, len(s))\n else:\n if number in s:\n s.remove(number)\n else:\n m += 1\n\nprint(m)\n\t \t \t\t\t \t \t \t \t\t \t\t\t", "from collections import defaultdict,Counter\r\ntests = int(input())\r\nmx,count = 0,0\r\n\r\nvisited = defaultdict(int)\r\nintervals = []\r\nidx = 0\r\nfor _ in range(tests):\r\n s,n = list(input().split())\r\n if s == '+':\r\n visited[n] = idx\r\n else:\r\n if n in visited:\r\n intervals.append([visited[n],idx])\r\n del visited[n]\r\n else:\r\n intervals.append([0,idx])\r\n\r\n idx += 1\r\n \r\nfor key in visited.keys():\r\n intervals.append([visited[key],tests-1])\r\n \r\nintervals.sort()\r\narr = []\r\nfor a,b in intervals:\r\n arr.append([a,'a'])\r\n arr.append([b,'b'])\r\n arr.sort()\r\n \r\n for s,e in arr:\r\n if e == 'a':\r\n count += 1\r\n else:\r\n count -= 1\r\n \r\n mx = max(mx, count)\r\n\r\n \r\nprint(mx)", "n=int(input())\na=[0 for i in range(10**6)]\ntr,rj=0,0\n\nfor i in range(n):\n s,inp=map(str,input().split())\n inp=int(inp)-1\n \n if s=='+':\n a[inp]=1\n tr+=1\n rj=max(rj,tr)\n else:\n if a[inp]==1:\n tr-=1\n else:\n rj+=1\n a[inp]=0\n rj=max(rj,tr)\n \nprint(rj)\n\t \t\t \t\t\t\t \t \t \t\t \t\t \t \t\t\t", "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\tpass\r\n\r\nIn = set()\r\ncurr,ans = 0,0\r\nfor _ in range(int(input())):\r\n\ts,n = get_str()\r\n\tif s == \"+\":\r\n\t\tcurr += 1\r\n\t\tIn.add(n)\r\n\t\tans = max(curr,ans)\r\n\r\n\telif s == \"-\":\r\n\t\tif n not in In:\r\n\t\t\tans += 1\r\n\t\telse:\r\n\t\t\tcurr -= 1\r\n\t\t\tIn.remove(n)\r\nprint(max(curr,ans))\r\n\r\n\r\n", "n=int(input())\r\nlp=[]\r\nco=0\r\nvac=0\r\nfor i in range(n):\r\n #print(co,vac)\r\n #print(lmin)\r\n a=input()\r\n if a[0]==\"+\" and vac==0:\r\n co+=1\r\n lp.append(int(a[1:]))\r\n elif a[0]==\"+\" and vac!=0:\r\n co+=1\r\n vac-=1\r\n lp.append(int(a[1:]))\r\n elif a[0]==\"-\" and int(a[1:]) in lp:\r\n vac+=1\r\n co-=1\r\n lp.remove(int(a[1:]))\r\n else:\r\n vac+=1\r\nprint(co+vac)", "in_persons=0\r\ntotal_cap=0\r\nentered=[]\r\nfor i in range(int(input())):\r\n #capacity=max(capacity,in_room)\r\n entry=input()\r\n if(entry[0]=='+'):\r\n in_persons+=1\r\n entered.append(int(entry[2:]))\r\n elif(entry[0]=='-'):\r\n if(int(entry[2:]) not in entered ):\r\n total_cap+=1 \r\n else:\r\n in_persons-=1\r\n total_cap=max(total_cap,in_persons)\r\nprint(total_cap)\r\n \r\n", "test=int(input())\r\nvisited=set()\r\nvalue=0\r\ncurrent=0\r\nfor _ in range(test):\r\n string=[x for x in input().split()]\r\n if string[0]==\"+\":\r\n current+=1\r\n visited.add(string[1])\r\n else:\r\n if string[1] in visited:\r\n current-=1\r\n visited.remove(string[1])\r\n else:\r\n value+=1\r\n value=max(current,value)\r\nprint(value)", "\r\nimport sys, threading\r\nsys.setrecursionlimit(1 << 30)\r\nthreading.stack_size(1 << 27)\r\n\r\n\r\n\r\nfrom collections import defaultdict, deque, Counter\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop\r\nfrom bisect import bisect_right, bisect_left\r\n\r\ndef inpNum():\r\n return int(input())\r\ndef inpStr():\r\n return input()\r\ndef inpSepNum():\r\n return map(int, input().split())\r\ndef inpNumList():\r\n return list(map(int, input().split()))\r\ndef inpChList():\r\n return list(input().split())\r\n\r\n\r\nn = inpNum()\r\nseen = set()\r\nvisitors = []\r\nalreadyIn = []\r\nans = 0\r\nfor _ in range(n):\r\n s, num = input().split()\r\n num = int(num)\r\n if s == '+':\r\n seen.add(num)\r\n else:\r\n if num not in seen:\r\n alreadyIn.append(num)\r\n visitors.append((s,num))\r\n\r\nfor s, num in visitors:\r\n if s == '+':\r\n alreadyIn.append(num)\r\n ans = max(ans, len(alreadyIn))\r\n else:\r\n ans = max(ans, len(alreadyIn))\r\n alreadyIn.remove(num)\r\nprint(max(ans, len(alreadyIn)))", "# LUOGU_RID: 120905955\n\nn = int(input())\na = [0] * 10000010 #初始化\nans = 0\ntmp = 0\nfor _ in range(n):\n op, num = input().split() #输入操作符号和数\n num = int(num)\n if op == '+': #如果操作为‘+’\n a[num] = 1 #输入了这个数，代表这个数不是容器原本就有的\n tmp += 1 #将现在的容量增加 1\n if ans < tmp:\n ans = tmp\n else: #否则操作为‘-’\n if a[num] == 1: #如果不是原本就有的\n tmp -= 1 #将现在的容量减少 1\n else: #否则，是原本就有的\n ans += 1 #将答案减少 1\nprint(ans) \n#珍爱生命，远离抄袭", "n,lst,mx,a=int(input()),[0]*1000000,0,[]\r\nfor i in range(n):a.append(input())\r\nfor i in range(n):\r\n if a[i][0]=='+':lst[int(a[i][2:])-1]=1\r\n elif not lst[int(a[i][2:])-1]:mx+=1\r\nans=mx\r\nfor i in range(n):\r\n if a[i][0]=='+':mx+=1;ans=max(mx,ans)\r\n else:mx-=1\r\nprint(ans)", "\r\n\r\nwhile True:\r\n try:\r\n n = int(input())\r\n sum = 0\r\n out = 0\r\n se = set()\r\n for i in range(n):\r\n ch, num = input().split()\r\n num = int(num)\r\n if ch == '+':\r\n se.add(num)\r\n if out:\r\n out -= 1\r\n else:\r\n sum += 1\r\n else:\r\n if num not in se:\r\n sum += 1\r\n else:\r\n se.remove(num)\r\n out += 1\r\n print(sum)\r\n except EOFError:\r\n break\r\n", "import sys, threading\ninput = sys.stdin.readline\nfrom collections import defaultdict\ninput = sys.stdin.readline\n\n# returns the first number where key becomes true for a given delegate type key\ndef bs(low=1, high=1, key = lambda x: True):\n\n while low <= high:\n mid = (low + high)//2\n if key(mid):\n high = mid-1\n else:\n low = mid+1\n return low\n\n\n\ndef main():\n in_map = {}\n t = int(input())\n count = 0\n cap = 0\n for _ in range(t):\n # print(count)\n op, id = input().strip().split()\n if op == \"+\":\n in_map[id] = False\n if cap:\n cap-=1\n else:\n count+=1\n else:\n if id in in_map:\n del in_map[id]\n else:\n count+=1\n cap+=1\n print(count)\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", "ht = {}\nroom_capacity = 0\nmaxx = 0\nfor _ in range(int(input())):\n op, idd = list(map(str, input().split()))\n if op == \"-\" and (idd not in ht or ht[idd] == 0):\n maxx += 1\n elif op == \"-\" and idd in ht and ht[idd] == 1:\n room_capacity -= 1\n ht[idd] = 0\n elif op == \"+\" and room_capacity == maxx:\n maxx += 1\n room_capacity += 1\n ht[idd] = 1\n elif op == \"+\" and room_capacity < maxx:\n room_capacity += 1\n ht[idd] = 1\nprint(maxx)\n", "n=int(input())\nl=[]\nminimal_room_capacity=0\nc=0\nfor i in range(n):\n x=str(input())\n if x[0]==\"+\":\n c+=1\n if x[0]==\"-\" and x[2::] not in l:\n minimal_room_capacity+=1\n if x[0]==\"-\" and x[2::] in l:\n c-=1\n if c>minimal_room_capacity:\n minimal_room_capacity+=1\n if x[2::] not in l:\n l.append(x[2::])\n\nprint(minimal_room_capacity)\n \t \t\t \t \t\t\t \t\t\t \t \t\t \t", "c=set();a=b=0\r\nfor _ in range(int(input())):\r\n\tx,y=input().split()\r\n\tif x=='+': c.add(y);b+=1\r\n\telse:\r\n\t\tif y in c: b-=1; c.remove(y)\r\n\t\telse: a+=1\r\n\r\n\ta=max(a,b)\r\nprint(a)", "a=int(input())\r\ngh=[0]*(int(1e6)+1)\r\nz=[input().split() for _ in \" \"*a]\r\ni,k,s=0,0,0;ok=0#1>\r\nwhile i<a:\r\n if z[i][0]=='+':\r\n gh[int(z[i][1])]=1\r\n s=max(s,sum(gh))\r\n i+=1\r\n else:\r\n while i<a and z[i][0]=='-':\r\n if gh[int(z[i][1])]:gh[int(z[i][1])]=0;k+=1\r\n else:ok+=1\r\n i+=1\r\n s=max(s,k+sum(gh))+ok;k=0;ok=0\r\nprint(s)", "n,l,m,a=int(input()),[0]*1000000,0,[]\r\nfor _ in range(n):a.append(input())\r\nfor i in range(n):\r\n if a[i][0]=='+':l[int(a[i][2:])-1]=1\r\n elif not l[int(a[i][2:])-1]:m+=1\r\nans=m\r\nfor i in range(n):\r\n if a[i][0]=='+':m+=1;ans=max(m,ans)\r\n else:m-=1\r\nprint(ans)", "entered = set()\r\nblack_box = [0] * 100\r\na = [input().split(\" \") for _ in range(int(input()))]\r\n\r\nfor i, p in enumerate(a):\r\n if p[0] == \"+\":\r\n entered.add(p[1])\r\n else:\r\n if p[1] not in entered:\r\n black_box[i] = 1\r\n\r\ncurrent = set()\r\nans = set()\r\nfor i, p in enumerate(a):\r\n if p[0] == \"+\":\r\n current.add(p[1])\r\n else:\r\n if p[1] in current:\r\n current.remove(p[1])\r\n ans.add(len(current) + sum(black_box[i:]))\r\nprint(max(ans))\r\n", "n = int(input())\r\nvis = [0]*1000001\r\nans,occ = 0,0\r\nfor i in range(n):\r\n a,b = map(str,input().split())\r\n b=int(b)\r\n if a==\"+\":\r\n vis[b]=1\r\n if ans==occ:\r\n ans+=1\r\n occ+=1\r\n else:\r\n occ+=1\r\n else:\r\n if vis[b]==0:\r\n ans+=1\r\n else:\r\n occ-=1\r\nprint(ans)", "count = int(input())\r\n\r\nlt = []\r\nm = 0\r\n\r\nfor i in range(count):\r\n\tt = input().split(\" \")\r\n\t\r\n\tif t[0] == \"+\":\r\n\t\tlt.append(t[1])\r\n\t\tif m < len(lt):\r\n\t\t\tm = len(lt)\r\n\telse:\r\n\t\tif t[1] in lt:\r\n\t\t\tdel lt[lt.index(t[1])]\r\n\t\telse:\r\n\t\t\tm += 1\r\n\r\nprint(m)", "total = int(input())\r\ns = set()\r\nm = 0\r\n\r\nfor i in range(total):\r\n line = input()\r\n\r\n n = int(line[2:])\r\n flag = line[:1]\r\n\r\n if flag == '+':\r\n s.add(n)\r\n m = max(m, len(s))\r\n continue\r\n\r\n if n in s:\r\n s.remove(n)\r\n else:\r\n m += 1\r\n\r\nprint(m)", "n = int(input())\r\nsum = 0\r\nout = 0\r\nse = set()\r\nfor i in range(n):\r\n ch, num = input().split()\r\n num = int(num)\r\n if ch == '+':\r\n se.add(num)\r\n if out:\r\n out -= 1\r\n else:\r\n sum += 1\r\n else:\r\n if num not in se:\r\n sum += 1\r\n else:\r\n se.remove(num)\r\n out += 1\r\nprint(sum)\r\n ", "n=int(input())\nmaxnum=0\ncurrent=0\ndic={}\nfor i in range(n):\n name= eval(input())\n if name>0:\n if current<maxnum:\n current=current+1\n dic[name]=1\n else:\n maxnum=maxnum+1\n current=current+1 \n dic[name]=1\n elif name* (-1) in dic:\n current=current-1\n dic.pop(name*(-1))\n else:\n maxnum=maxnum+1 \nprint(maxnum)\n \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\nl = pow(10, 6) + 5\r\nu = [0] * l\r\nv = [0] * l\r\nx = []\r\nfor _ in range(n):\r\n c, r = input().rstrip().decode().split()\r\n r = int(r)\r\n if c == \"+\":\r\n u[r] = 1\r\n elif u[r]:\r\n u[r] = 0\r\n else:\r\n v[r] = 1\r\n x.append(c)\r\ns = sum(v)\r\nans = s\r\nfor i in x:\r\n s += 1 if i == \"+\" else -1\r\n ans = max(ans, s)\r\nprint(ans)", "from typing import List, Tuple\n\ndef possible_capacity(n: int, e: List[Tuple[str, str]]) -> int:\n id_number = []\n count = 0\n reader = 0\n \n for sign, id in e:\n if sign == '+':\n id_number.append(id)\n reader += 1\n else:\n if id in id_number:\n id_number.remove(id)\n reader -= 1\n else:\n count += 1\n count = max(count, reader)\n \n return count\n\nn = int(input())\na = []\nfor i in range(n):\n b,c = input().split()\n a.append((b, c))\nd = possible_capacity(n, a)\nprint(d)\n", "n = int(input())\r\nlib = []\r\ncount = 0\r\nmax_count = 0\r\nfor i in range(n):\r\n s = input()\r\n if s[0] == '+':\r\n lib.append(s[2:])\r\n count += 1\r\n if count > max_count:\r\n max_count = count\r\n else:\r\n if s[2:] in lib:\r\n count -= 1\r\n lib.remove(s[2:])\r\n else:\r\n max_count += 1\r\nprint(max_count)", "\r\n\r\nn = int(input())\r\nst = set()\r\nans = 0\r\nfor i in range(n):\r\n s = list(input().split())\r\n d = int(s[1])\r\n if s[0] == '+':\r\n st.add(d)\r\n ans = max(ans , len(st))\r\n\r\n else:\r\n if d not in st :\r\n ans += 1\r\n\r\n else:\r\n st.remove(d)\r\n\r\nprint(ans)", "from heapq import *\r\n\r\n\r\ndef get_int():\r\n return int(input())\r\ndef get_nums():\r\n return list(map(int, input().split()))\r\ndef main():\r\n n = get_int()\r\n state = 0\r\n array = [0]*(10**6 + 1)\r\n answer = 0\r\n for _ in range(n):\r\n status, id = input().split()\r\n id = int(id)\r\n if status == \"+\":\r\n array[id] = 1\r\n state += 1\r\n elif array[id] == 1:\r\n array[id] = 0\r\n state -= 1\r\n else:\r\n answer += 1\r\n array[id] = 0\r\n answer = max(answer, state)\r\n print(answer)\r\nmain()", "from collections import defaultdict, deque, Counter\r\nfrom functools import lru_cache\r\nfrom heapq import heappush, heappop\r\nfrom bisect import bisect_right, bisect_left\r\n\r\ndef inpNum():\r\n return int(input())\r\ndef inpStr():\r\n return input()\r\ndef inpSepNum():\r\n return map(int, input().split())\r\ndef inpNumList():\r\n return list(map(int, input().split()))\r\ndef inpChList():\r\n return list(input().split())\r\n\r\nn = inpNum()\r\ngiven = []\r\nplus = set()\r\nroom = set()\r\nfor _ in range(n):\r\n sign, num = input().split()\r\n given.append((sign, num))\r\nfor g in given:\r\n s, nm = g\r\n if s == '-' and int(nm) not in plus:\r\n room.add(int(nm))\r\n else:\r\n plus.add(int(nm))\r\nans = len(room)\r\n# room = set()\r\nfor i in given:\r\n s, nm = i\r\n if s == '+':\r\n room.add(int(nm))\r\n ans = max(ans, len(room))\r\n else:\r\n room.remove(int(nm))\r\nprint(ans)", "import sys\r\ndef fi():\r\n\treturn sys.stdin.readline()\r\nif __name__ == '__main__':\r\n\tn = int(fi())\r\n\td = dict()\r\n\tc = 0\r\n\tans = 0\r\n\tline = 0\r\n\tfor i in range (n):\r\n\t\ta,b = fi().split()\r\n\t\td.setdefault(b,0)\r\n\t\tif a == '+':\r\n\t\t\td[b]=1\r\n\t\t\tc+=1\r\n\t\telse:\r\n\t\t\tif d[b] == 0:\r\n\t\t\t\tans+=1\r\n\t\t\telse:\r\n\t\t\t\td[b]=0\r\n\t\t\t\tc-=1\r\n\t\tans = max(ans,c)\r\n\tprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = set()\r\nc = 0\r\nfor i in range(n):\r\n a, b = input()[:-1].split()\r\n if a == '-':\r\n if b in d:\r\n d.remove(b)\r\n else:\r\n c += 1\r\n else:\r\n d.add(b)\r\n c = max(c, len(d))\r\n\r\nprint(c)" ]

[ "n, p, m = input().split()\r\nn = int(n)\r\np = int(p)\r\nm = int(m)\r\n\r\nans = 0\r\ncurb = 0\r\ncurd = 1\r\nfor i in range(0, n):\r\n #print(curb)\r\n tday, tplus = input().split()\r\n tday = int(tday)\r\n tplus = int(tplus)\r\n if curb < 0:\r\n ans += (tday - curd)\r\n curb -= p * (tday - curd)\r\n elif curb - p * (tday - curd) < 0:\r\n curb -= p * (tday - curd)\r\n x = -curb\r\n xx = x // p\r\n if xx * p < x:\r\n xx += 1\r\n x = xx\r\n ans += x\r\n else:\r\n curb -= p * (tday - curd)\r\n curd = tday\r\n #print(curb)\r\n curb += tplus\r\n\r\ntday = m + 1\r\nif curb < 0:\r\n ans += (tday - curd)\r\n curb -= p * (tday - curd)\r\nelif curb - p * (tday - curd) < 0:\r\n curb -= p * (tday - curd)\r\n x = -curb\r\n xx = x // p\r\n if xx * p < x:\r\n xx += 1\r\n x = xx\r\n ans += x\r\n\r\nprint(ans)", "from sys import stdin\r\nfrom math import ceil\r\ninp = stdin.readline\r\n\r\nn, p, m = map(int, inp().split())\r\n\r\ncount = 0\r\nmoney = 0\r\nlastDay = 0\r\n\r\nfor i in range(n+1):\r\n if i < n:\r\n day, val = map(int, inp().split())\r\n else:\r\n day = m\r\n val = 0\r\n\r\n money -= (day-lastDay-1)*p\r\n if money < 0:\r\n count += min(day-lastDay-1, ceil(-money/p))\r\n\r\n money += val - p\r\n if money < 0:\r\n count += 1\r\n\r\n if day == m:\r\n break\r\n\r\n lastDay = day\r\n\r\n\r\nprint(count)\r\n\r\n\r\n", "n, p, m = [int(i) for i in input().split()]\r\n\r\nlst = [tuple(int(i) for i in input().split()) for _ in range(n)] + [(m + 1, 0), ]\r\n\r\ns = count = charge_last = 0\r\n\r\ncharge_last = 0\r\n\r\n# 计算剩余电量（刚充完电）够撑几天（不小于零）\r\ndef cal(s):\r\n if s < p:\r\n return 0\r\n else:\r\n return s // p\r\n\r\nfor charge_id, charge_val in lst:\r\n delta = charge_id - 1 - charge_last\r\n charge_res = cal(s)\r\n if charge_res < delta:\r\n count += (delta - charge_res)\r\n charge_last = charge_id - 1\r\n s += (charge_val - delta * p)\r\n\r\nprint(count)", "from sys import stdin; from math import ceil, fabs\r\ninp, c, mo, last = stdin.readline, 0, 0, 0\r\nn, p, m = map(int, inp().split())\r\nfor i in range(n):\r\n day, val = map(int, inp().split())\r\n mo -= (day-last)*p - val; c += max(0, min(day-last-1, ceil((-(mo+p-val))/p))); last = day\r\n if mo < 0: c+=1\r\nif day != m: mo -= (m-last)*p; c += max(0, min(m-last, ceil(-mo/p)));\r\nprint(c)", "rd = lambda: map(int, input().split())\r\nn, p, m = rd()\r\nq, l, r = 0, 0, 0\r\nfor i in range(n):\r\n d, t = rd()\r\n c = d - q - 1\r\n r += max(min(c - l // p, c), 0)\r\n l -= p * (c + 1) - t\r\n r += l < 0\r\n q = d\r\nc = m - q\r\nprint(r + max(min(c - l // p, c), 0))\r\n", "n,p,m=map(int,input().split())\r\nflag,t_neg,t_in,d,tot=0,0,0,1,0\r\n\r\nfor i in range (n):\r\n ini_d=d\r\n if flag==1:\r\n tot+=(t-p)\r\n if tot<0:\r\n t_neg+=1\r\n d,t=map(int,input().split())\r\n if flag==0:\r\n t_neg=(d-ini_d)\r\n tot=t_neg*-p\r\n flag=1\r\n else:\r\n tot+=(((d-1)-ini_d)*-p)\r\n if tot<0:\r\n if tot<=(((d-1)-ini_d)*-p):\r\n t_neg+=(d-1)-ini_d\r\n else:\r\n x=int(-tot%p)\r\n y=int(-tot/p)\r\n if x!=0:\r\n t_neg+=(y+1)\r\n else:\r\n t_neg+=y\r\n\r\n\r\n\r\nini_d=d\r\ntot+=(t-p)\r\nif tot<0:\r\n t_neg+=1\r\ntot+=(((m)-ini_d)*-p)\r\nif tot<0:\r\n if tot<=(((m)-ini_d)*-p):\r\n t_neg+=(m)-ini_d\r\n else:\r\n x=int(-tot%p)\r\n y=int(-tot/p)\r\n if x!=0:\r\n t_neg+=(y+1)\r\n else:\r\n t_neg+=y\r\n\r\n \r\nprint (t_neg) \r\n \r\n " ]

[ "print((3 * 2 * int(input())) // 4)", "n=int(input())\r\nif n%4:\r\n print(2*n-n//4*2-1)\r\nelse:\r\n print(2*n-n//4*2)", "x=int(input())\r\nprint(3*x//2)", "n=int(input())\r\nr=2*n-(n//2)\r\nprint(r)", "# Wadea #\r\n\r\nn = int(input())\r\nprint(n+n//2)", "n = int(input())\nprint((2*n)-(n//2))#Source code should contain 50 characters at least\n\t\t\t \t \t \t \t\t\t\t \t \t", "n = int(input())\r\nif n == 0:\r\n exit(print(0))\r\nprint(int(n * 1.5))", "n=int(input())\r\nprint((n>>1)*3)", "n=int(input())\r\nans=(n//2)*3\r\nprint(ans)", "n = int(input())\r\n\r\nprint(int(n*1.5))\r\n", "n=int(input())\r\nn=(3*n)/2\r\nprint(int(n))\r\n", "\r\ndef f(n):\r\n return n + n//2\r\n \r\n \r\nn = int(input())\r\nprint(f(n))\r\n", "n = int(input())\r\nif n % 2 == 0: print(n * 2 - n//2)\r\nelse: print(n * 2 - (n//2 + 1))", "def main():\r\n n = int(input())\r\n print((3 * n)>>1)\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 = int(input())\r\n\r\nprint((3 * n) // 2)", "a=int(input())\r\nprint((a//2)*3)\r\n", "print(int(input())*3//2)\r\n", "print(int(input()) * 3 // 2)#2019-08-03 04:43:19.782", "def main() :\r\n n = int(input())\r\n print((n//2)+n) \r\n\r\nmain() ", "import math\ndef main():\n n = int(input())\n print(math.floor(1.5 * n))\n\nif __name__ == '__main__':\n main()\n", "n=input()\r\nn=int(n)\r\nprint(int((n/2)*3))", "#!/usr/bin/env python3\n\nN = int(input())\nprint(int(N*3/2))", "print (3*(int(input())//2))", "b=int(input())\r\n\r\n\r\nprint(b+b//2)\r\n", "x = int(input())\n\nkilled = ((x)*3//2)\n\nprint(killed)\n \t\t\t \t\t\t \t \t \t \t \t", "#!/usr/bin/python3\r\n\r\nimport sys\r\nn = sys.stdin.readline().strip(\"\\n\")\r\nn = int(n)\r\nprint(int(n*1.5))\r\n", "n = int(input())\r\n\r\nprint(int(1.5 * n))", "n=int(input())\r\nprint(int(3*(n/2)))", "n=int(input())\nif n%2==0:\n\tprint(int(1.5*n))\nelse:\n\tc=1.5*(n-1)\n\tprint(int(c+1))", "a = int(input())\n\n\n\n\n\n\n\n\nprint(a//2+(a-a//2)+a//2)\n \t\t\t \t\t\t\t \t\t \t\t\t \t\t\t \t\t\t\t\t", "n = int(input())\nprint(int(n*1.5))", "# A. Toy Army\n\n# https://github.com/fuwutu/CodeForces/blob/master/84A%20-%20Toy%20Army.cpp\n\nn = int(input())\nprint(n + n // 2)\n", "n = int(input())//2\nprint(3*n)\n \t \t\t \t \t \t\t \t\t\t \t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nprint(n*3//2)", "#maximum total number of soldiers that may be killed during the game.\n#Floor division = //\nprint(int(input())*3//2)\n\t\t \t\t\t\t\t\t\t\t \t\t \t\t\t\t \t \t\t\t", "a=int(input())\nans=a//2\nans=3*ans\nans=int(ans)\nprint(ans)\n \t \t\t\t\t \t \t \t \t \t \t\t\t", "n = int(input())\r\nprint(int((n*3)/2))", "n=int(input())\r\nprint(n*2//4*3)", "n=int(input())\r\nn=(n//2)+n\r\nprint(n)\r\n", "n = int(input())\nif n % 2:\n\tprint(n // 2 + n)\nelse:\n\tprint(n // 2 * 3)\n", "while(1):\r\n try:\r\n n=int(input())\r\n print(3*n//2)\r\n except EOFError:\r\n break", "from math import floor\r\nn = int(input())\r\nkilled = 3*(floor((n + 1)/2))\r\nprint(int(killed))", "n = int(input())\r\nm = n // 2 + n\r\nprint(m)", "def toy_army(n):\r\n m=n/2\r\n fin=m+n\r\n print(int(fin))\r\n\r\n\r\n\r\nn=int(input(''))\r\ntoy_army(n)", "def array(n):\r\n m=3*((n+1)//2)\r\n return m\r\nn=int(input())\r\nprint(array(n))\r\n", "import math\r\n\r\nnumber = int(input())\r\nprint(math.floor((3/4)*number*2))", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\n\r\nprint(int(n * 3 / 2))", "inpt = int(input())\r\nprint(3*(inpt)//2)\r\n", "# Codeforces A. Toy Army\r\n# Created by Abdulrahman Elsayed on 15/01/2021\r\n\r\nn = int(input())\r\nprint(int(3 * n / 2))", "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())\nn=int(input())\nprint(n+n//2)\n\n\n\n\n\n\n", "inp = int(input())\r\n\r\nprint(int((inp/2)*3))", "from math import ceil\r\ndef solve(n):\r\n return(n+ceil(n/2))\r\nprint(solve(int(input())))\r\n", "import math\r\nfrom collections import defaultdict\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef solve():\r\n n = int(input())\r\n print(3 * n // 2)\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n = int(input())\r\ncount = n // 2\r\nprint(2*n-count)\r\n\r\n \r\n", "import sys\r\nn = sys.stdin.readline()\r\nprint(3*int(n)>>1)", "\r\n\r\nt=int(input())\r\nprint(t*3 //2)\r\n", "n=int(input())\r\nprint(int((3*n)/2))", "'''\r\nKyle Seto\r\n84/A Codeforces\r\n'''\r\na = int(input())\r\nprint(a//2*3)\r\n", "n=int(input())\r\nprint(int(int(n/2)*3))", "number = int(input())\nprint(number + (number // 2))\n\t \t\t\t \t\t\t \t\t \t \t\t \t", "n=int(input())\r\nprint(n*3//2)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = 2 * n - n // 2\r\nprint(ans)", "n = int(input())\nprint((3*n)//2)\n\n\n#asnioavncsadjncjsandklsanldkas\n\t\t \t \t \t \t\t \t\t \t \t \t \t\t", "a = int(input())\nprint(a*3//2)\n", "# Shortcut for input\r\ndef I(): return int(input())\r\ndef MI(): return map(int, input().split())\r\ndef LI(): return list(map(int, input().split()))\r\ndef S(): return input()\r\n# Constants\r\nmod = 10**9 + 7\r\nn = I()\r\nprint(3*n//2)", "n = int(input())\r\nprint((n + (n//2)))", "from math import floor\nn = int(input())\nkilled = n + n/2\nprint(int(killed))\n\t\t \t\t\t\t\t \t\t\t \t \t \t\t\t\t\t\t\t", "print(int(1.5*int(input())))\n#aaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\t\t \t \t\t\t \t \t \t\t\t \t\t \t \t\t", "#fduygfdsgiorgizaegiuezfgiezfuugreugruruyzozieruifdsgtrfesoqtg\nprint((3*int(input()))//2)\n \t\t\t \t\t \t \t\t\t\t \t\t\t\t\t \t \t\t", "\r\n\r\n\r\n# dedicated to Rupa,masum,aminul,ritu ..\r\nI=int(input())\r\nprint(int(I/2*3))", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nn=int(input())\r\nprint(n//2+n)", "n = int(input())\nans = n + n // 2\nprint(ans)\n\n\t\t \t \t \t\t\t\t\t\t \t \t\t\t \t \t\t\t\t\t", "a=int(input())\r\nprint(int(a*1.5))", "a=int(input())\r\nprint(int(3*(a/2)))", "print((int(input())//2)*3)\n \t \t \t \t\t\t \t\t\t\t\t\t\t\t \t\t\t", "# coding: utf-8\nn = int(input())\nprint(n+n//2)\n", "#Aqui va input\nn = int(input())\n#Siempro son tres turnos\n# Por 1.5 \nres = int(n/2*3)\n#Imprime\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\nf = (n*2) - (0.5*n)\r\nprint(int(f))", "import math\r\nn=int(input())\r\nprint(int(n+n/2))\r\n", "n=int(input())\r\nprint(int(n*3/2))\r\n", "def main():\r\n n = int(fin())\r\n fout((3*n)//2)\r\n \r\n# FastIO\r\nfrom sys import stdin, stdout\r\ndef fin(): return stdin.readline().strip(\"\\r\\n\")\r\ndef fout(s): return stdout.write(str(s)+\"\\n\")\r\nif __name__ == \"__main__\":\r\n t = 1 or int(fin())\r\n for i in range(t): main()", "n=int(input())\r\nprint(n*3//2)#2020-08-04 23:18:40.626", "t = int(input())\r\nprint(t + t // 2)\r\n", "x = int(input())\r\nif x%2 == 0:\r\n\tprint(x//2+x)\r\nelse:\r\n\tprint(2*(x//2)+x//2+1)", "n = int(input())\r\nans = int(n*3/2)\r\nprint(ans)", "print (int(input())*3//2)", "# Toy Army\nn=int(input())\nprint(n//2*3)\n", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nn = int(input())\r\nif n == 2:\r\n print(3)\r\nelse:\r\n print(n//2 * 3)", "print (3 * int(input()) // 2)", "print(int(1.5*int(input())))", "sa=int(input())\r\nprint(int(sa*1.5))\r\n", "import math\r\na=int(input())\r\nprint(math.ceil(a*3/2))\r\n", "a=int(input())\r\nb=2*a\r\nprint(b-int(a/2))", "n=int(input())\r\nn=n//2\r\nprint(n*3)\r\n\r\n", "print(round((int(input())/2)*3))", "n=int(input(\"\"))\r\nx=n+n/2\r\nprint(int(x))", "n = int(input())\r\n# print((3*n)//2) \r\nprint(n+n//2)", "num=int(input())\r\nprint(int(3*num/2))", "n = int(input())\r\n\r\nc = n//2\r\nprint(n+c)", "n = int(input())\nm = n / 2\nprint(int(n/2*3))", "n = int(input())\r\nprint((n*3)//2)", "n=int(input())\r\ncounter=int(n+n/2)\r\nprint(counter)", "a = int(input())\r\nprint(a*2 - (a+1)//2)", "print(int(input())//2 *3)\n", "n = int(input())\r\nprint(int(n+n/2))", "N=int(input())\r\nprint(N+N//2)", "Number=int(input())\r\nprint(3*(Number//2))", "n = int(input())\r\na= n//2\r\nprint(n+a)", "n=int(input())\r\nx=n+(n//2)\r\nprint(x)", "print(int(input().strip()) // 2 * 3)", "print(int(int(input())*1.5))", "n = int(input())\r\nprint(int((3*n)/2))", "n = int(input())\r\nprint(int(n + n/2))", "x = input()\r\nx = int(x)\r\nx = 3*x/2\r\nx = int(x)\r\nprint(x)", "men = int(input())\r\nprint(men+(men//2))", "n=int(input())\r\nprint(int(n+(n/2)))", "print(int(int(input())*3/2), \"\\n\")", "# LUOGU_RID: 113222235\nn=int(input())\r\nif n%4==0:\r\n print(int(n*1.5))\r\nelse:\r\n print(n*2-(int(n//4)+1+int(n//4)))", "i = int(input())\r\nprint(int(i/2) * 3)", "# LUOGU_RID: 102492080\nn = int(input())\r\nif n % 4 == 0:\r\n print((n - n // 4) + (n - n // 4))\r\nelse:\r\n print((n - (n // 4 + 1)) + (n - n // 4))", "n=int(input())\r\nans=2*n//4\r\nprint(ans*3) ", "inp = int(input())\r\nif inp==1:\r\n print(1)\r\nelse:\r\n print(int(3*inp/2))", "x=int(input())\r\nprint(2*x-x//2)", "n = int(input())\r\ns = 3*(n//2)\r\nprint(s)", "\r\nn=int(input())\r\nprint(n+int(n/2))", "x = int(input())\nprint(x*3//2)\n \t \t \t\t\t \t\t\t \t \t\t\t\t\t\t\t\t", "#2\r\nprint(3*int(input())//2)", "n = int(input())\nprint ((3*n)//2)", "n = int(input())\r\nprint(2*n - (n//2))", "n = int(input())\r\nprint(int(1.5*n))", "x=int(input())\r\n \r\nprint(int( (x*2)-(x/2) ) )", "def armies(n):\r\n return (3 * n) // 2\r\n\r\n\r\nprint(armies(int(input())))\r\n", "print(3*int(input())//2)\r\n\r\n# proof: if you kill more than n/2 on the first turn, then no more than n/2 can be killed in each of the next two turns.\r\n# if you kill less than n/2 on the first turn, then no more than n can be killed in total on the next two turns\r\n# 3n/2 can be achieved by killing n/2 every turn\r\n", "N=eval(input())\nfor i in range(1,2):\n for j in range(1,2):\n N=N\nprint(N+int(N/2))\n\t\t\t\t \t \t \t \t \t \t \t\t \t\t", "n = 2*eval(input())\r\nprint(int(n//4+n//2))", "n=int(input())\r\ny= n*3\r\nprint(y//2)", "print(int(int(input()) * 1.5))", "n = int(input())\r\nprint((3*n)//2)", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\nstdout.write(str(n*3//2))", "n = int(input())\r\n\r\nres = n + n//2\r\nprint(res)", "a=save=int(input())\r\nb=int(a)\r\ncount=0\r\nfor i in range(3):\r\n if i==0:\r\n b=b//2\r\n elif i==1:\r\n a=a-b\r\n else:\r\n b=0\r\nprint(2*save-a)\r\n", "a = int(input())\r\nn = 2*a\r\nm = a/2\r\nprint(int(n-m))\r\n", "n=int(input())\r\nprint((n)+n//2)\r\n", "def miis():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\nprint(n+n//2)\r\n", "from sys import stdin,stdout\r\n'''\r\nn = int( stdin.readline() )\r\nlis1 = [] \r\n\r\nfor i in range(0,n): #pending hai dekh liyo will learn new thing.\r\n lis1.append([] )\r\n for j in range(0,1): \r\n lis1[i].append( 1 )\r\n \r\nprint(( lis1 ))\r\n\r\n#******************************************************\r\n\r\nfor i in range(0,n):\r\n lis1.append([] )\r\n for j in range(2,n):\r\n \r\n lis1[i].append( )\r\n\r\n#*****************************************************************\r\n \r\n \r\nfor i in range(0,n):\r\n for j in range(0,n): \r\n print( lis1[i][j] ,end='')\r\n'''\r\n\r\n#*****************************************************************\r\n\r\nn = int(stdin.readline() )\r\nans = (n*3)//2\r\nprint(ans)\r\n\r\n\r\n", "n=int(input())\r\nk= int((n+1)/2)\r\nprint(3*k)", "n = int(input())\r\nprint(2*n - n//2)\r\n", "#Total Turns = 3\n#There's always a 2n number when starting the game\nprint((3*int(input()))//2)\n\t\t\t\t\t\t\t \t\t\t \t \t \t \t \t \t\t \t", "\nI = lambda: map(int,input().split())\n\nn = int(input())\nyy = n//2\nprint(2*n-yy)", "X = int(input())\r\nprint(3*X //2)\r\n", "print(3 * int(((int(input()) + 1) / 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\nteam1 = n\r\nteam2 = n\r\nteam2 -= (team2//2)\r\nteam1 -= team2\r\nteam2 -= team1\r\nprint((n*2)-(team1 + team2))", "n = int(input())\r\nno_dead = 2*n-(n//2)\r\nprint(no_dead)\r\n", "x= int(input())\r\nprint(int((x*2)-(x/2)))", "n=int(input())\r\nif n%2==1:\r\n print((n)//2*3+1)\r\nelse:\r\n \r\n print((n)//2*3)\r\n", "print(int(input())//2*3)", "n=int(input())\r\nn2=2*n\r\ni=0\r\nt=0\r\nwhile i<3:\r\n n2=n2-(n2/4)\r\n t+=(2*n)/4\r\n i+=1\r\n\r\nprint (int(t))", "n=int(input());print(int((n*2)-(n*0.5)))", "num = int(input())\r\nprint(int((num/2)+num))", "__copyright__ = ''\r\n__author__ = 'Son-Huy TRAN'\r\n__email__ = \"[email protected]\"\r\n__doc__ = ''\r\n__version__ = '1.0'\r\n\r\n\r\ndef main() -> int:\r\n print(int(input()) * 3 // 2)\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n exit(main())", "import math\r\nn = int(input())\r\nprint(n + math.ceil(n / 2))", "def Main(n):\r\n rez = ( n//2 )*3\r\n print(rez)\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n Main(n)", "########################################################################################################################\nn = int(input())\nprint(3*(n//2))\n\t \t \t \t\t\t\t \t\t \t\t", "n=int(input())\r\nprint(int(1.5*n))\r\n", "n = int(input())\nx=n\nx=x/2\nx=int(x)\nres=x*3\nprint(res)\n \t \t\t \t\t\t\t", "n = int(input())\r\nn = n + n//2\r\n\r\nprint(n)", "n = int(input())\nsoldiers = int(3*((n)/2))\nprint(soldiers)\n\t\t \t\t \t \t\t \t \t \t", "print((int(input())*3)//2)\r\n", "a=int(input())\r\nprint(a+a//2)", "n=int(input())\r\nprint((2*n)-(n//2))", "a = int (input())\r\nprint (a*3//2)", "n=int(input())\r\nprint(2*n-n//2)", "n=int(input())\r\ng=n//2\r\nprint(g+n)", "n=input()\r\ni=(int(n)*2)-(int(n)/2)\r\nprint(int(i))\r\n", "n=int(input())\r\nans=3*(n//2)\r\nprint(ans)", "n=int(input())\r\na=(n//2)*3\r\nprint(a)", "'''input\n4\n'''\nn = int(input())\nprint(min(3*n//2, 2*n-1))", "print(int(int(input())*(3/2)))", "def solve(n):\n return (n//2)*3 \n\n \n \n\ndef main() :\n n = int(input())\n # n,m = list(map(int, input().split(' ')))\n print(solve(n))\nmain()\n", "print(int(input())*3>>1)", "\r\n\r\n\r\n\r\n\r\n\r\n\r\nx=int(input());y=x//2\r\nprint(y+x)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# Description of the problem can be found at http://codeforces.com/problemset/problem/84/A\r\n\r\nn = int(input())\r\n\r\nprint(n * 2 - n // 2)", "\"\"\"\nOOOO\nOOOO\n\n\"\"\"\n\nn = int(input())\nshot_n = 0\n\nshot_n += n // 2 * 2\nn -= n // 2\nshot_n += n\nprint(shot_n)\n", "a=int(input())\r\nprint((3*a)//2)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-12 23:15:41\nLastEditTime: 2021-11-12 23:19:54\nDescription: Toy Army\nFilePath: CF84A.py\n'''\n\n\ndef func():\n n = int(input())\n if n % 4 == 0:\n return 2 * n - n // 2\n else:\n return 2 * n - n // 4 - n // 4 - 1\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "\r\ndef func(n,k):\r\n return n-k + min(n, 2*k)\r\n\r\nn = int(input())\r\nprint(func(n, n//2))", "s=int(input())\r\nprint(3*(s//2))", "n = int(input())\r\nN = 2*n\r\nd = n//2\r\nres = N-d\r\nprint(res)\r\n", "n = int(input())\r\na = 2 * n\r\nval = n // 2\r\nb = a // 2\r\n\r\nprint(val+b)\r\n", "a=int(input())\r\nprint(int((a*2)-(a/2)))\r\n", "n=int(input())\r\nprint(2*n-(n//2))", "n = int(input())\r\nprint(int(n * 1.5))", "n=int(input(\"\"))\r\nif n%2==0 :\r\n n=3*(n//2)\r\nelse :\r\n n=3*(n//2)+1\r\nprint(n)\r\n\r\n ", "x=int(input())\r\ny=(x*6)//4\r\nprint(y)\r\n", "N=int(input())\nN//=2\nx=int(N*3)\nprint(x)\n", "x= int(input(\"\"))\r\nprint(int((x/2)*3))", "n = int(input())\r\nprint(int((3/2)*n))", "# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░╔═══╗╔╗╔═══╦═══╗\r\n# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░║╔═╗╠╝║║╔═╗║╔═╗║\r\n# ╔══╦═╗╔══╦═╗╔╗░╔╦╗╔╦══╦╗╔╦══╬╝╔╝╠╗║║║║║╠╝╔╝║\r\n# ║╔╗║╔╗╣╔╗║╔╗╣║░║║╚╝║╔╗║║║║══╬╗╚╗║║║║║║║║░║╔╝\r\n# ║╔╗║║║║╚╝║║║║╚═╝║║║║╚╝║╚╝╠══║╚═╝╠╝╚╣╚═╝║░║║░\r\n# ╚╝╚╩╝╚╩══╩╝╚╩═╗╔╩╩╩╩══╩══╩══╩═══╩══╩═══╝░╚╝░\r\n# ░░░░░░░░░░░░╔═╝║░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n# ░░░░░░░░░░░░╚══╝░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n\r\na=int(input())\r\n\r\nprint(a*3//2)", "from sys import stdin, stdout\r\nstdout.write(str(int(stdin.readline()) * 3 // 2))", "n=int(input())\r\nprint(3*n//2)", "n=int(input())\r\nnum=n//2\r\nprint(int(3*num))", "def ans(n):\n\n return (n//2) * 3\n \n\na = int(input())\nprint(ans(a))\n", "a=int(input())\npp=[]\noo={}\nnn={}\nn=[]\nb=(a//2) *3\n\n\nprint(int(b))\n\t \t \t \t\t \t\t \t\t\t \t\t \t\t\t\t \t\t", "if __name__ == '__main__':\r\n \r\n n = int(input())\r\n print(n*2 - n//2)", "\n\n\n\nn = int(input())\nkilled = 3*(n/2)\nprint(int(killed))\n\t\t \t\t\t\t\t\t\t \t \t\t\t\t\t\t\t \t \t\t", "def f(n):\r\n return 3*n//2\r\n\r\nn = int(input())\r\nprint(f(n))\r\n\r\n", "num = int(input());print((num*2) - (num//2))", "n = int(input())\r\nprint(int(3*n//2))", "n = int(input())\r\nprint(2*n-int(n/2))", "n=input()\r\nprint(int(int(n)*1.5))\r\n", "n = int(input())\nprint(int(n+n/2))\n\t \t\t\t\t \t\t \t \t\t \t\t \t\t\t\t\t", "x=int(input())\r\ny=int(x/2)\r\nz=y*3\r\nprint(z)\r\n", "print(int(input())//2*3)\r\n", "n = int(input())\r\na = n * 2\r\nb = n / 2\r\nc = int(a - b)\r\nprint(c)", "# https://github.com/MathProgrammer/CodeForces/blob/master/Explanations/Explanations%20-%209/Toy%20Army%20Explanation.txt\r\nn = int(input())\r\n\r\nprint(3*(n//2))", "n=int(input())\r\nk=n//2 \r\nprint(3*k)", "tc = 1\r\nwhile tc:\r\n tc-=1\r\n n = int(input())\r\n print(n+n//2)", "n = int(input())\ns=0\nfor i in range (n):\n\ts += 1.5\nprint(int(s))", "n = int(input())\nans = (n+1)//2+(n//2)*2\nprint(ans)\n", "n=int(input())\r\nprint(int(n/2)*3)", "n=int(input())\r\nprint(int(n*1.5))", "n=int(input())\r\nprint(n + n//2)", "val=arc=int(input())\r\nsumm=0\r\nfor i in range(3):\r\n if i==0:\r\n summ+=arc//2\r\n arc//=2\r\n elif i==1:\r\n summ+=val//2\r\n val//2\r\n else:\r\n summ+=arc\r\nprint(summ)", "n=int(input())\r\nb=(3*n)//2\r\nprint(b)", "from math import floor\nn = int(input())\nkilled = 3*(floor((n + 1)/2))\nprint(int(killed))\n\t \t\t\t \t\t \t \t\t \t\t \t\t \t", "n = int(input())\r\nprint( int ( 1.5 * n ) )", "n=int(input())\r\nprint(int(n/2+n/2+n/2))\r\n \r\n", "x=int(input())\r\nprint((x//2)*3)", "n = int(input())\r\nhalf = n // 2\r\nprint (n + half)", "#code\r\n\r\nR = lambda:map(int,input().split())\r\n\r\nn, = R()\r\nprint((n//2) * 3)\r\n", "def main():\r\n n=int(input())\r\n print(2*n-n//2)\r\nmain()\r\n", "n=eval(input())\nif n%2==0:\n print(int(n/2*3))\nelse:\n print(4*((n-1)%2)-2)\n \t \t \t \t \t\t \t \t\t \t \t", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, = readln()\nprint(n * 3 // 2)\n", "x=int(input())\r\ny=x+(x//2)\r\nprint(int(y))", "n = int(input())\nk = n//2\n#hello and welcome to this course on machine learning\nprint(n+k)\n\n\n \t \t \t\t \t\t\t \t \t\t\t \t \t \t\t", "n = int(input())\r\nprint(int(3 * n / 2))", "hat = int(input())\r\nprint(hat + int(hat/2))\r\n", "if __name__ == '__main__':\n\tn = int(input())\n\tnum = n + n//2\n\tprint(num)", "n=int(input())\r\nn=n*3\r\nn=n//2;\r\nprint(n)", "N = int(input())\r\nprint(N+(N//2))\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\nprint(int(input())//2*3)", "\n\nn = int(input())\n#can't sumbmit because the code is too short\nprint(n + n//2)\n\n\n \t\t\t\t \t \t \t \t\t \t \t \t", "i = (int(input()))\r\nprint(i + (i//2))", "n=int(input())\r\na=n//2\r\nprint(a+n)\r\n", "n =int(input())\r\n\r\nans = n + int(n/2)\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nprint((2 * n )- (n // 2))", "n = int(input())\r\nif n%2==0 :\r\n print(2*n-n//2)\r\nif n%2==1 :\r\n print(2*n-n//2-1)", "print(3*(int(input())//2))", "#asilulgaohdjpoasjdoasjdoasjdoasdasd\nprint(int((int(input())*3)/2))\n \t\t \t \t\t\t \t \t\t \t\t\t \t \t", "_=int(input())\r\nprint(_+_//2)", "n = int(input())\r\n\r\nprint(n + n//2)", "\r\nn = int(input())\r\nprint(n + n // 2)\r\n# CodeForcesian\r\n# ♥\r\n# Library\r\n", "a = int(input())\r\nprint((a//2) * 3)", "n=int(input())\r\na=n//2\r\nprint(a*3)\r\n", "n = int(input())\r\nprint(int(2*n-(n/2)))", "n = int(input())\r\nprint((2*n)-n//2)", "# LUOGU_RID: 101454971\nprint(int(input()) // 2 * 3)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Feb 20 20:30:03 2022\n\n@author: elsayed\n\"\"\"\nn=int(input())\n\nif n >=0 and n<=10**8:\n result=int((n/2)*3)\n print(result)", "n=int(input())\r\nprint(int(3*n/2))", "n = int(input())\r\nprint(2*n-(n//2))", "x = int(input())\r\nprint(x * 2 - x // 2)", "n = int(input())\r\nprint(n+int(n/2))", "n=int(input())\r\nprint((n*3)//2)\r\n", "n=int(input())\r\nprint(int(n+n/2))", "n=int(input())\nprint(2*n-int(n/2))\n##########################\n\t \t \t \t\t \t\t\t\t \t \t \t \t\t \t", "n = int(input())\r\nprint (int(3*n/2))", "k=int(input())\r\nprint(k+int(k/2))", "n=int(input())\r\nr=(n//2)+n\r\nprint(r)", "n = int(input())\nres = 3 * n // 2\nprint(res)\n", "z=int(input())\r\nprint((z//2)*3)" ]

[ "# LUOGU_RID: 133022591\n# pypy3\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom bisect import *\r\nfrom heapq import *\r\nimport sys\r\nIN = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nPN = lambda x: sys.stdout.write(x)\r\nI = lambda: int(IN())\r\nS = lambda: IN().split()\r\nM = lambda: map(int, IN().split())\r\nL = lambda: list(map(int, IN().split()))\r\nG = lambda: map(lambda x: int(x) - 1, IN().split())\r\n\r\ndef new_list(shape, value = 0):\r\n if len(shape) == 0:\r\n return value\r\n else:\r\n return [new_list(shape[1:], value = value) for _ in range(shape[0])]\r\n\r\nn = I()\r\na = L()\r\n\r\nif n == 1:\r\n print(\"BitLGM\" if a[0] > 0 else \"BitAryo\")\r\n exit(0)\r\n\r\nif n == 2:\r\n f = new_list([301, 301], False)\r\n for i in range(301):\r\n for j in range(301):\r\n for x in range(i):\r\n f[i][j] |= not f[x][j]\r\n for x in range(j):\r\n f[i][j] |= not f[i][x]\r\n for x in range(1, min(i, j) + 1):\r\n f[i][j] |= not f[i - x][j - x]\r\n print(\"BitLGM\" if f[a[0]][a[1]] else \"BitAryo\")\r\n \r\nif n == 3:\r\n print(\"BitLGM\" if reduce(lambda x, y: x ^ y, a) > 0 else \"BitAryo\")\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# threading.stack_siz(e(10**8)\r\n# sys.setrecursionlimit(10**6)\r\n\r\n\r\nclass UnionFind:\r\n def __init__(self, n):\r\n self.parent = list(range(n))\r\n\r\n def find(self, a):\r\n acopy = a\r\n while a != self.parent[a]:\r\n a = self.parent[a]\r\n while acopy != a:\r\n self.parent[acopy], acopy = a, self.parent[acopy]\r\n return a\r\n\r\n def union(self, a, b):\r\n self.parent[self.find(b)] = self.find(a)\r\n\r\n\r\ndef main():\r\n n, m = rl()\r\n st = rl()\r\n g = defaultdict(list)\r\n for i in range(m):\r\n _, *vals = rl()\r\n for v in vals:\r\n g[v].append(i+1)\r\n\r\n d = UnionFind(2*m+10)\r\n for i in range(n):\r\n u, v = g[i+1]\r\n if st[i]:\r\n d.union(u, v)\r\n d.union(u+m, v+m)\r\n else:\r\n d.union(u, v+m)\r\n d.union(u+m, v)\r\n\r\n for i in range(1, m+1):\r\n if d.find(i) == d.find(i+m):\r\n print('NO')\r\n exit()\r\n print('YES')\r\n\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "def main():\r\n n, m = map(int, input().split())\r\n rs = list(map(int, input().split()))\r\n sw = [[] for _ in range(n)]\r\n for i in range(m):\r\n x, *room_num = map(int, input().split())\r\n for j in room_num:\r\n sw[j - 1].append(i)\r\n pairs = [[] for _ in range(m)]\r\n for i in range(n):\r\n pairs[sw[i][0]].append((sw[i][1], rs[i]))\r\n pairs[sw[i][1]].append((sw[i][0], rs[i]))\r\n state = [-1] * m\r\n stack = []\r\n\r\n for i in range(m):\r\n if state[i] == -1:\r\n stack.append(i)\r\n state[i] = 0\r\n while stack:\r\n u = stack.pop()\r\n for v, w in pairs[u]:\r\n if state[v] == -1:\r\n state[v] = state[u] ^ w ^ 1\r\n stack.append(v)\r\n elif state[v] != state[u] ^ w ^ 1:\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1692053714.087178", "import sys,math\r\nfrom bisect import bisect_left\r\n\r\ndef rd(): return sys.stdin.readline().strip()\r\ndef rdl(typ,sep=\" \"): return list(map(typ, rd().split(sep)))\r\ndef wt(x,sep=\"\\n\") : sys.stdout.write(str(x) + sep) # string / num\r\ndef wtBoolUp(x): wt(\"YES\" if x else \"NO\") # True = YES/ False =NO\r\ndef wtBoolLow(x): wt(\"Yes\" if x else \"No\") # True = Yes/ False =No\r\ndef wtlArr(arr,sep=\" \"): # Print arr in single line\r\n for x in arr: wt(x, \" \") \r\n wt(\"\")\r\ndef wtlsArr(arr): # Print arr in mult lines\r\n for x in arr: wt(x)\r\ndef wtlsArrArr(arr): # print Arrays in multiple lines\r\n for a in arr: wtlArr(a)\r\n\r\n\r\n# for dfs use this and use 'yield' during dfs and at last\r\nfrom types import GeneratorType\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 return wrappedfunc\r\n\r\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\r\n\r\nINF = 10**18\r\nMOD = 10**9 + 7 \r\n\r\ndef binPow(a,b,mod) :\r\n res = 1\r\n while b :\r\n if b % 2: \r\n res = res * a % mod\r\n a = a * a % mod\r\n b //= 2\r\n return res\r\n\r\ndef invMod(x,mod): return pow(x,mod-2,mod) \r\n\r\ndef getFacts(n,mod): # O(n)\r\n fact = [1]*(n+1)\r\n for i in range(2,n+1): fact[i] = (i*fact[i-1])%mod\r\n return fact\r\n\r\ndef nCr(n, r, fact, mod) : # O(logMOD)\r\n num = fact[n] # numerator\r\n den = (fact[r] * fact[n - r]) % mod # denominator\r\n return (num * invMod(den, mod)) % mod\r\n\r\ndef lcm(num1,num2):\r\n hcf = math.gcd(num1,num2)\r\n lcm_ = (num1*num2)//hcf\r\n return lcm_\r\n\r\ndef sqrtFloat(num): # req : https://codeforces.com/contest/1809/problem/B\r\n l, r = 0 , num\r\n res = 0\r\n while l <= r :\r\n mid = (l+r)//2\r\n if mid*mid <= num :\r\n res = mid\r\n l = mid + 1\r\n else : #number will be on l side\r\n r = mid-1\r\n \r\n return res + 0.1*(res*res != num)\r\n\r\ndef floorDiv(a,b): return a//b\r\ndef ceilDiv(a,b): return (a+b-1)//b\r\n\r\ndef prefixSum(arr): # 0 at last of prefix sum\r\n pref = [0]*(len(arr)+1)\r\n for i in range(len(arr)): pref[i] = arr[i] + pref[i-1]\r\n return pref\r\n\r\ndef prefixXor(arr): # 0 at last of prefix Xor\r\n pref = [0]*(len(arr)+1)\r\n for i in range(len(arr)): pref[i] = arr[i] ^ pref[i-1]\r\n return pref\r\n\r\ndef apNth(n, a=1, d=1) : return a+(n-1)*d\r\ndef apSum(n, a=1, d=1): return (2*a+(n-1)*d)*n//2\r\ndef apSumMod(n, a=1, d=1, mod=MOD): return ((2*a+(n-1)*d)*n*invMod(2,mod))%mod\r\ndef apSumRange(l, r, d=1) : return apSum((r-l+1)//d, l, d)\r\ndef apSumRangeMod(l, r, d=1, mod=MOD) : return apSumMod((r-l+1)//d, l, d, mod)\r\n\r\ndef hypot(p1,p2):\r\n return ((p2[0]-p1[0])**2 + (p2[1]-p1[1])**2)**0.5\r\ndef manhat(p1,p2):\r\n return abs(p2[0]-p1[0]) + abs(p2[1]-p1[1])\r\n\r\ndef comb(n,r): # for small x otherwise TC higher\r\n res = 1\r\n for i in range(r) : res = res*(n-i)//(i+1) # res*(n-i) % (i+1) == 0 always\r\n return res\r\n\r\ndef powerArr(base,n,mod):\r\n pwr = [1]*(n+1)\r\n for i in range(1,n+1):\r\n pwr[i] = (base*pwr[i-1]) % mod\r\n return pwr\r\n\r\ndef getClosest(num,sortArr,notTake=-INF,notTakeCnt=1):\r\n idx = bisect_left(sortArr,num) # find closest to x , not take notTake\r\n closeArr = []\r\n for i in range(max(0,idx-2),min(len(sortArr),idx+3)) : # [idx-2,idx-1,idx,idx+1,idx+2]\r\n if notTakeCnt>0 and sortArr[i] == notTake:\r\n notTakeCnt -= 1\r\n continue\r\n closeArr.append(sortArr[i])\r\n return min(closeArr, key=lambda x:abs(x-num),default=-INF)\r\n\r\ndef grouping(itr, notTake=INF): # grouping of similar elements\r\n n = len(itr)\r\n res = []\r\n i = 0\r\n while i < n:\r\n st = i\r\n while i+1 <n and itr[i] == itr[i+1] :\r\n i += 1\r\n if itr[st] != notTake:\r\n res.append([itr[st],st,i,i-st+1])\r\n i += 1\r\n return res\r\n\r\ndef dirnsRD() : return [(0,1),(1,0)]\r\ndef dirnsLU() : return [(0,-1),(-1,0)]\r\ndef dirns(): return [(0,1),(1,0),(0,-1),(-1,0)] # RDLU\r\ndef dirnsDiag(): return dirns() + [(1,1),(1,-1),(-1,1),(-1,-1)]\r\ndef chessDirns(): return [(-2,-1),(-1,-2),(1,-2),(2,-1),(2,1),(1,2),(-1,2),(-2,1)]\r\n\r\ndef cntBits(x): \r\n cnt = 0\r\n while x > 0:\r\n x &= x - 1 # remove last set bit\r\n cnt +=1\r\n return cnt\r\ndef isRepSumP2(num, x): return cntBits(num) <= x <= num # num in sum two's power in x moves ?\r\ndef binry(decimal): return bin(decimal).replace('0b', '')\r\ndef deciml(binary): return int(str(binary),2)\r\ndef printAllBin(arr):\r\n maxLen = len(binry(max(arr)))\r\n for x in arr:\r\n curr = binry(x)\r\n res = \" \".join(list(\"0\"*(maxLen-len(curr))+curr))\r\n wt( res + f\" <- {x}\")\r\n\r\ndef c2i(ch,up=0): return ord(ch) - ord('A' if up else 'a') # ch to integer\r\ndef i2c(n,up=0): return chr(ord('A' if up else 'a') + n) # integer to ch\r\n\r\ndef setPrecRound(num, cnt): return round(num, cnt)\r\ndef setPrec(num, cnt): return format(num,f\".{cnt}f\")\r\ndef flush(): sys.stdout.flush()\r\ndef clearCache(func): func.cache_clear() # used to clear the lru cache for every new test case\r\n\r\n\r\n\r\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\r\n''' ॐॐ _/\\_ हर हर महादेव _/\\_ ॐॐ '''\r\n\r\n# sys.setrecursionlimit(300_005)\r\n# MOD = 10**9 + 7\r\n\r\n\r\nclass TwoSAT:\r\n def __init__(self, n):\r\n self.n = n\r\n self.adjList = [[] for _ in range(2*n)]\r\n self.revAdjList = [[] for _ in range(2*n)]\r\n self.seen = [False]*(2*n)\r\n self.topoOrder = []\r\n self.comp = [0]*(2*n) # comp[v]: ID of the SCC containing node v\r\n self.result = [0]*(2*n)\r\n\r\n\r\n def addEdge(self, u, v):\r\n self.adjList[u].append(v)\r\n self.revAdjList[v].append(u)\r\n\r\n\r\n def addClauseOr(self, i, f, j, g):\r\n self.addEdge(i + (f==1)*self.n, j + (g==0)*self.n)\r\n self.addEdge(j + (g==1)*self.n, i + (f==0)*self.n)\r\n\r\n\r\n def addClauseXor(self, i, f, j, g):\r\n self.addClauseOr(i, f, j, g)\r\n self.addClauseOr(i, ~f, j, ~g)\r\n\r\n\r\n def addClauseAnd(self, i, f, j, g):\r\n self.addClauseXor(i, f, j, ~g)\r\n\r\n\r\n @bootstrap\r\n def dfs(self, root):\r\n self.seen[root] = True\r\n for adj in self.adjList[root]:\r\n if not self.seen[adj]:\r\n yield self.dfs(adj)\r\n self.topoOrder.append(root) # while backtrack add edge\r\n yield\r\n\r\n\r\n @bootstrap\r\n def findScc(self, root, id_):\r\n self.seen[root] = True\r\n self.comp[root] = id_\r\n for adj in self.revAdjList[root]:\r\n if not self.seen[adj]: \r\n yield self.findScc(adj, id_)\r\n yield\r\n\r\n\r\n def satisfiable(self):\r\n self.seen = [False]*(2*self.n)\r\n for i in range(2*self.n):\r\n if not self.seen[i]: \r\n self.dfs(i)\r\n\r\n self.seen = [False]*(2*self.n)\r\n self.topoOrder.reverse()\r\n id_ = 0\r\n for adj in self.topoOrder:\r\n if not self.seen[adj]:\r\n self.findScc(adj, id_)\r\n id_ += 1\r\n\r\n for i in range(self.n):\r\n if self.comp[i] == self.comp[i+self.n]:\r\n return False\r\n self.result[i] = int(self.comp[i] > self.comp[i+self.n])\r\n return True\r\n \r\n\r\n\r\n\r\n# Particular door has two switches x1 & x2 state x1 ^ x2\r\n# Case 1: door locked (0) need to unlock(1) applying x1 or x2 i.e (x1^x2)\r\n# so (x1 & ~x2) | (~x1 & x2)\r\n# Case 2 : door unclocked(1) do ~(x1^x2)\r\n # x xor y = (x V y) ∧ (~x V ~y)\r\n # ~(x xor y) = (~x V y) ∧ (x V ~y) = (x and y)\r\n# (x1 & x2) | (~x1 & ~x2)\r\n\r\ndef solve():\r\n n,m = rdl(int)\r\n status = rdl(int)\r\n switch = [[] for _ in range(n+1)]\r\n for i in range(m):\r\n _,*X = rdl(int)\r\n for x in X:\r\n switch[x-1].append(i)\r\n ## ----------------------------------------- \r\n \r\n twosat = TwoSAT(m)\r\n for i in range(n):\r\n r1,r2 = switch[i]\r\n if status[i]: # locked\r\n twosat.addClauseOr(r1,0,r2,1)\r\n twosat.addClauseOr(r1,1,r2,0)\r\n else: # unlocked\r\n twosat.addClauseOr(r1,0,r2,0)\r\n twosat.addClauseOr(r1,1,r2,1)\r\n\r\n res = twosat.satisfiable()\r\n \r\n return res\r\n\r\n\r\n# Don't forget the mod and recursion limit and INF\r\n\r\nwtBoolUp(solve())\r\n\r\n\r\n", "from sys import stdin, stdout\n\ndef main():\n def tarjan(graph):\n n = len(graph)\n dfs_num = [None] * n\n dfs_min = [n] * n\n waiting = []\n waits = [False] * n\n sccp = []\n dfs_time = 0\n times_seen = [-1] * n\n for start in range(n):\n if times_seen[start] == -1:\n times_seen[start] = 0\n to_visit = [start]\n while to_visit:\n node = to_visit[-1]\n if times_seen[node] == 0:\n dfs_num[node] = dfs_time\n dfs_min[node] = dfs_time\n dfs_time += 1\n waiting.append(node)\n waits[node] = True\n children = graph[node]\n if times_seen[node] == len(children):\n to_visit.pop()\n dfs_min[node] = dfs_num[node]\n for child in children:\n if waits[child] and dfs_min[child] < dfs_min[node]:\n dfs_min[node] = dfs_min[child]\n if dfs_min[node] == dfs_num[node]:\n component = []\n while True:\n u = waiting.pop()\n waits[u] = False\n component.append(u)\n if u == node:\n break\n sccp.append(component)\n else:\n child = children[times_seen[node]]\n times_seen[node] += 1\n if times_seen[child] == -1:\n times_seen[child] = 0\n to_visit.append(child)\n return sccp\n \n def _vertex(lit):\n if lit > 0:\n return 2 * (lit - 1)\n else:\n return 2 * (-lit - 1) + 1\n \n def two_sat(formula):\n n = max(abs(clause[p]) for p in (0, 1) for clause in formula)\n graph = [[] for _ in range(2 * n)]\n for x, y in formula:\n graph[_vertex(-x)].append(_vertex(y))\n graph[_vertex(-y)].append(_vertex(x))\n sccp = tarjan(graph)\n comp_id = [None] * (2 * n)\n affectations = [None] * (2 * n)\n for component in sccp:\n rep = min(component)\n for vtx in component:\n comp_id[vtx] = rep\n if affectations[vtx] == None:\n affectations[vtx] = True\n affectations[vtx ^ 1] = False\n for i in range(n):\n if comp_id[2 * i] == comp_id[2 * i + 1]:\n return None\n return affectations[::2]\n \n n, m = map(int,stdin.buffer.readline().split())\n door_state = list(map(int,stdin.buffer.readline().split()))\n formula = [[] for _ in range(2 * n)]\n for i in range(1, m + 1):\n x = map(int,stdin.buffer.readline().split())\n _ = next(x) # generator instead of list for performance\n for e in x:\n if door_state[e - 1]: # 1 -> not(xor) needed, eq to: (not(a) or b) and (a or not(b))\n if formula[e - 1]:\n formula[e - 1].append(-i)\n formula[n + e - 1].append(i)\n else:\n formula[e - 1].append(i)\n formula[n + e - 1].append(-i)\n else: # 0 -> xor needed, eq to: (a or b) and (not(a) or not(b))\n formula[e - 1].append(i)\n formula[n + e - 1].append(-i)\n print('YES' if two_sat(formula) else 'NO')\nmain()\n\t\t\t \t\t \t\t\t\t\t \t\t \t \t\t\t\t \t\t", "from gzip import decompress; exec(decompress(b'\\x1f\\x8b\\x08\\x00\\x93\\x9a|d\\x02\\xff\\xd5\\x1aks\\xdb6\\xf2;\\x7f\\x05N\\x99+I\\x97V,9nb\\xd5\\xeaL\\xed$3\\x9e\\x8b\\xe3\\xc4N\\xe6\\xe6\\xceU5\\x14\\tJ\\xa8\\xf9P\\x08\\xd0\\x92\\xd2i~\\xfb\\xed\\x02 \\t>\\x14\\xa7\\x9d\\xfbp\\xa7\\x99\\x98\\x14\\xb0\\xef],vW\\x89\\xf2,!\\xf3yT\\x88\"\\xa7\\xf39a\\xc9:\\xcb\\x05\\t\\xd9\\x03\\xe3,K=\\xb2\\xceY*`?\\r\\x04|\\xb7\\xf4~\\xc6=\\xbe\\xe3V\\x84\\xd8,+\\xb1\\xcew\\x82\\xf2\\xcbk\\x8f\\\\^\\x9f\\xfb\\x9c\\xaa\\xed\\xdcOC\\x84R \\xf8\\r\\x08z\\xf2\\x05\\xfe-\\xa9\\xc5\"\\x02\\xb4\\x86\\x0f4G\\x8es\\x96F\\xd9\\xdd\\xd1\\x8c\\x9c\\x91\\xe3\\x89E\\xe0\\x13)\\x11\\x17\\x05\\x8b\\x05Kk\\x19\\xb7\\x12\\x9d\\xf8\\x9c(:\\x15\\xacVF#\\xf0\\x12\\xde\\xe7\\x01c\\x1e\\x89`\\x95\\xe6\\x1eY\\xd1\\xadG\\x12\\x7f\\xed\\x91,\\x00y>\\xb3\\xb5e)\\x89\\x13_\\xacJ\\xa4\\x80\\xb2\\x18p\\xe2,\\x03\\x94\\xc8\\x0fD\\x963\\x1fV\\xe2l9:\\xb2\\x9e\\x90\\x0e\\x02lx\\xfcS.\\xbc\\x00l$\\xfc\\xd4\\xe3,\\xf5r?d~\\xaa\\xed\\xb5`\\x9c\\x06\\xa2\\x84W\\xdf\\xe61\\x8d@\\x08\\xfd%g\\xcb\\x95P\\xc0A\\x16\\xc7T\\x9a\\xbe\\xd2#\\xa4\\x9f\\n\\xea\\x91\\x8b\\xacH\\xa5\"!\\x8d\\xfc\"\\x16!\\x0bD)P\\x1f\\x0b\\xcf\\xe4d2\\xf2\\xc0F\\x00\\xa6\\x1fj_\\xbf+A4\\xd1\\x90\\x06,\\xf1\\xe3\\x92\\xeaA\\xb9\\xbe\\xa2\\xfe\\xfaS\\xb9\\x9ar\\x00\\x89)\\x07e\\xd2\\xd8\\xcf\\x97\\xf2\\r!X\\xb4S/\\xebl\\xad_\\n\\xbeRo9]\\xc7~@K\\x82=:_\\xe7!\\xcdi\\xf8\\xd2\\xd0\\x91\\x81\\xf2\"\\xcb\\xe2\\nfM\\xf3\\xa4\\x10\\xbe\\xc4\\x03W^MGG\\xfa\\xf3\\x1cp\\xae\\xa6\\xa7\\xa7/\\xc6\\xcf\\x9e\\x1d\\x9f\\x1c\\xc3\\xb7\\xcb\\xb7\\xaf\\xc9\\x14\\xdd\\xea\\x0bg\\x00\\x117p-\\xb5t:\\x1e\\x1f\\x1f?\\x1f\\x1f\\x1d\\xff\\xf0\\xe2\\xe4\\xd9\\xf3\\xe7\\'/\\x00\\xf9\\xdd%l\\x1c\\x0fG\\xcfF\\'\\xa7\\xe3\\x1fN\\x8eO^\\x9c>?=\\xb6n`\\xb5\\x8abg\\xec\\x91\\x119\\x83\\xa0\\x1d\\xbb@\\x1f\\xf7\\x8eH\\xf5yB^\\xa5\\xfe\"\\xa6D\\xac\\x18\\'Q\\x96\\x831\\x17\\xc5r\\xc9\\xd2%\\xc9\"\\x82\\xae#\\xf7t\\x07\\xaa\\xa4$\\xd9I-\\x81\\xc8t\\xdf\\x87\\\\\\xf9\\x00\\xb8w{\\n\\xdaCP\\x10\\x1e\\x04\\xce2\\xf7\\xd7+W\\x1d\\xa4\\xc1` \\x9f\\xafY\\x1ar\\xb2Y\\xf9\\x82p\\x91g\\xe92\\xde\\x81\\xcd\\xd3\\x14lNCx\\x03s\\xa64\\x15\\x9cP?X\\x914\\x0b\\xd5\\xd9\\x02\\xc9}\\xb2\\xf6\\xf1\\xf4G(\\xa8\\x0fr\\xe7\\nGr\\xf1\\x14\\x14\\x1c\\xb4\\x98gp\\xcc\\x90\\x89O6\\xd4\\xbf\\'\"[gp0X\\x00\\xe1\\x93\\xa1+\\xb5\\xe2bE%}\\xde\\x90\\x0fT#1M\\xb5\\xecr\\t\\x85\\x82\\xd5\\xbb\\xc3\\xd1\\x8c\\x1c\\x90T\\xae\\x01\\xd1\\xb9$\\x86\\x1b3K\\xae\\xbdW\\xef\\xf8\\xca\\x85\\x1f\\xdc\\xd7_S\\xba\\x99#+Xy\\x0b\\xea\\xa9l\\x01\\x8e\\xc8\\xb3L\\xa06\\xca\\x8b\\xa96\\x95\\xd4$\\x92l\\xef\\x10bF~\\x02\\x87\\xd6{J\\xa6\\x14\\xd2KA-\\xabv\\xf3\\xcb\\x0c\\xcd\\x12\\xa1u\\x19\\xb8\\xfb\\x9e\\xd25\\xaa*r\\x94\\x05=M\\xd7bU\\xc1\\xbf\\x1f\\xc2)\\xa0i\\xe8 \\x0b\\xb7Z\\xc6os\\t\\xa9\\rQiZ\\xc3(\\xfa\\xef\\x9b\\x12i\\xfd\\xde\\x0f\\xe1\\x8c9nc\\x0b\\x94\\x91\\xbb]5LU\\x11d\\xb6\\x07\\xa6\\xa1r{\\xe3\\t\\x04U\\xce\\x05\\x11,1\\xecQ\\xef^\\xa6!\\xddV\\xee\\xb6\\xbat+\\xe6m\\x8d\\xc9\\xf7rAz\\xd3\\xed \\xca\\xe5\\xd2\\x8aH\\xc0\\xed\\xe3^z\\xa5\\xb3U9\\xe0\\x8b\\xc2\\xed\\xec\\x93\\xef\\xa7*\\xb8\\x95t\\r\\x00\\x1as:\\xe9\\xe1vK\\xc1L\\xa12E{W{H\\xb2\\xeb\\x93\\x14\\x0eH\\x00W\\xc8\\x86\\xc4,\\xbd\\xef\\xec\\xe3\\xc6\\x14\\x82\\x15m95\\x8c\\xd6\\x01\\xc4\\xc0N)\\xc3\\xb86\\xa4\\xef\\xf7)\\xf8\\xde\\x08\\xb8\\xb3\\x92.e{\\xe0kA\\x12\\x96:\\xf0\\xe6\\xd5\\x18\\xbd\\xd6/\\xd5!\\xdcO\\xe4u-\\x15\\xf0\\x08$\\x89 \\xa7\\xbe\\xa0\\xe4\\xf6\\xe2\\xa2/$%\\x17\\xado\\xbf,\\xea\\x14TG\\xfboSi\\xe0\\xfdr\\x1bI@EN\\xf7\\xa0t\\xc3R\\xe3\\xccJ\\xd3\\xef\\x05\\xaf\\x82\\xb6\\nH\\x8d\\xda\\xe5\\xd0\\x1f;\\xdd\\xa3\\x90m\\xacf\\xae\\x1b\\xe6\\x14\\x0b%\\xaa\\xa5\\xce)\\x94:\\xa9D\\xf2j \\xc0\\xb1\\x82\\xd8\\xe7\\x9c|\\xd8d\\xb7\\xbeP\\x9c\\xf0J\\x98Cy\\xc5\\xc4|\\xeep\\x1aGpE\\x1b\\xe9\\x0eW\\x86\\x98z\\xd3\\xe6\\x92\\x0c \\xcc\\xa3w3\\x19W\\xf3:[\\x8e1\\x17\\xbb\\x10~5}\\xb8\\x8b\\xe3\\x9d\\xa6\\x0e>\\xde\\xb5\\x19\\xa8p\\xdc\\xceJ\\x13\\xed\\xd0\\xd1;\\x99r\\xa4Q\\x08\\xd2\\xd4\\xa2|\\x0f\\xe8\\x06m\\xca \\x7f\\xe4\\xfd\\xb4\\xe1\\xeaP\\xdbd\\x0b\\x17\\x0c\\x10L\\n\\xc8F\\x0bJ>\\xe4\\x05-\\xef\\x95J\\x08-\\xe5\\x17I\\xa4\\x7f\\x0b\\x8a\\x95\\xad\\xc9\\x9cSQrn\\xb2\\xdd~3\\xab&\\xbd,~\\xa0\\x92\\xa2A\\xae\\xe5F\\x8cR\\xb8\\xc2k\\xbb\\xd5\\xb2\\xa2#\\xb6\\xb5#\\x94\\xc1\\xdc\\x89\\xd5\\x97\\xd4\\xb73<E\\xf2\\xf5\\xcb\\xb6\\xe7P\\xeb\\x18z\\r\\xd76\\x94\\x95\\xf2rl\\xea\\xf0\\xe0\\xc7\\x05\\xe5\\x18\\x02\\xb89\\xab\\x1c\\xd4#\\x8d\\n\\xce\\xd0\\xc8\\xdfM~;\\xa0\\xb2E\\xc9\\xb6P\\xdfk7K\\xb7;\\x86\\xdf\\x0f\\xa1\\x92:\\x94\\xe6jjc\\x08s\\xb7\\x9ba=\\x82\\xf2t\\x15j\\xc1M\\rfVKi\\xf4\\x99g\"X\\xbavJ\\xa0\\xc2r\\xb4\\xf0\\x1f\\xa0\\x88\\xbd\\x80~\\x06M0\\x92+U\\xf5`\\x1c\\x86\\n\\xcaP\\x19\\xfa\\xa7\\x04\\xed\\x06\\x1d\\x8f\\xc3\\\\\\x89!\\x932K\\xd7\\x85p\\xdc!_\\xc7\\x0c\\x9eu\\x02\\x87\\xac$\\n\\xfe\\xe7P6L\\x04+\\xe5\\x9f\\xee\\x11M\\r\\xc8\\x8a\\x96\\xdaJZ\\xbe\\x99{\\xe4 \\x84>\\xc7`\\x7f8\\xfa\\x06\\x01J\\xd2\\x88\\x8b\\x80\\x92\\xc6\\xa4\\x92\\xeb\\x0e\\xbfW\\xe7\\x9d\\x19\\xe7\\r\\xea\\xcf\\xa9\\xceP \\xcc>1\\xdba\\x8d\\x87\\x16OFI\\x9e\\xcd:q\"\\x8d\\x08\\x1b\\x18\\xf7=\\x95\\x0c0\\x1e\\xead\\xd2\\xcc\\x00=\\x00xp\\xbf\\xb4@\\xfa\\x93w\\x93\\xea\\x97\\xc7\\xc9\\x1a\\x10\\xb2\\xc9v\\xec\\x7f\\xbd\\xba\\xb5\\xa5\\x02\\x00\\xa8\\x12\\x84\\x8b\\x9d\\xb0< \\xf6\\xdbk\\xdb\\xb8^\\xff\\xbf_\\xf6\\xf76\\xe4\\xb5\\x9e4p\\xec7\\xa1\\x83\\x94\\xfd\\x1c\\xb9\\x15\\xd0w\\xf0\\xbdX\\x96\\xbf\\x08\\xa66\\xfc\\x81\\xa3\\xbb\\\\\\xb1\\xdf\\xee\\xe3$\\xcd\\xd6\\x9f\\xa0\"-\\x1e6\\xdb\\xddg\\x1b\\x00\\xc2\\xe9\\xef\\xb6oO\\x8e<{aOF\\x9e\\x1d\\xd8\\x93\\xb1g\\x87\\xf6\\xe4\\xd8\\xb3\\xa9=y\\xe6\\xd9\\x91=9\\xf1\\xec\\xa5=\\xf9\\xc1\\xb3W\\xf6\\xe4\\xb9g3{\\xf2\\xc2\\xb3\\x7f\\xb3\\'\\xa7\\x9e}\\x0fX\\x80\\x1c\\xc3\\x03\\xb0\\x13x\\x00z\\n\\x0f\\xc0\\xcf\\xe0\\x01\\x04\\xd6\\xf0\\x00\\n\\x9f\\xe0\\x01$rx\\x00\\r\\x0e\\x0f \"\\xe0\\x01T\\n\\xe0\\nT\\x1e\\xe0\\x01T6\\xf0\\x00*[x\\x00\\x95\\x1d<\\x80\\xcagx\\x9c\\xfc\\xa1\\xd2P\\x90\\xadw\\xe3\\xd0\\x89\\xb9p\\'e\\xce\\xba\\xdb\\xdeMfu\\xce\\x85\\xbd\\x19\\xd6Y\\x17\\x00J\\xc6/\\xa1\\xd4\\xe2b8\\x1c\\x92\\x9f\\x1f2\\x16\\x92\\x8f\\x1c\\xfb\\x8f\\x97\\xd0\\x87 )I3\\xcd\\xe6Y4\\x0f\\xd9\\x92\\t\\xee\\xa4ERS>\\x92mB\\x91`\\x15\\xa8\\xafc\\x8cK9\\xeb\\x90\\x90X\\x8d\\x8f$\\x91u\\xb6Ip\\xc9\\xc37\\x9cB$Y8\\xbd\\xaaI\\xc1j{\\xdb\\x95\\x88\\x8c\\xbf\\xc3\\x95\\xeb\\x08\\x0e\\xbe\\xb3\\xad\\x11\\x9c-\\x81^\\x9a@\\x11/\\xe0\\xf5;\\xfc\\x0e\\xf7\\x80\\x0b\\x1f\\x89\\xf6\\xe6\\xf6\\\\\\xc9Zv\\x8a7\\x12\\x8d\\x937\\xd4\\x87\\xeb\\xf7\\x96-S\\x16A\\x7f\\x99\\nr\\xced\\x87\\xea\\xa3&\\x0b\\xb8E\\x9d\\x1b\\x9cb$\\x19\\xde\\xd2L\\xb8h\\xb3kg\\xe4\\x96W\\xb5\\xe6\\x8fj\\x7fG\\x0e\\xe1\\xa1,\\x7f\\xb5\\x8f\\xe1U\\xf6\\x18\\xbf74j\\xb3\\x03\\x13\\xbe\\xad8\\x1aF\\xaeM/w\\xfcT\\xde1?\\xca\\xfd\\x9f~*\\xaf\\x1b]\\xe6\\x16\\x89q\\xb3\\x94\\x00?J\\xa4\\xb3\\xb3\\x12V\\xd3\\xf3\\xe5\\x0c\\xe4\\xcd9\\x903\\xe6>\\xb2\\x1e\\x7f\\x83\\xf6\\'\\x8b\\xacHC\\xeb\\xa3\\x01 \\x87=\\x08\\xf0\\x11Ru\\t@\\xa41\\xceo\\x1d_V>eM\\x7f\\xceR?\\xdfA\\xab\\xe3\\xe7\\x81\\xeagY\\x93\\x93\\x82/\\xd5eX\\x9ac\\x1b\\xe7\\xbb\\xd2\\xcb\\xbeN\\xceFY\\xaf\\xe5fV7\\xc3\\xea\\xad\\xc3\\x91\\xf2\\xcc2\\x08\\x1d\\xa3\\xfcS\\xc6\\xd9\\xd5\\xe0\\xfa\\x82\\xc0\\n\\x8e\\xfc\\x9d\\xecL\\xabl\\x15\\x858HL\\nU\\x04\\x1e\\xec\\xdc\\xa7O\\x15yH\\xce8\\x82\\xd1\\xa3%\\xb1\\x82F%\\x84\\x93\\x04KH ,\\xcb\\x83\\'*\\xb1\\xef\\xf8\\x10\\n\\xc4\\x9c\\x06\\x85\\x9ca\\xc6,\\x81+R\\x8f\\x9f\\\\\\rT\\xd1\\x18\\xca\\xd6c\\xce\\xd9g\\n0\\xe3g\\x1d\\x18\\x10\\xbe\\x06\\xfe \\xdf\\x1c\\x81\\xb341E\\xbeM`\\xa4\\x96\\x8bV\\x13\\xf3\\xb5\\xe1\\x91\\xce\\xb3\\x17P\\xb5f\\t\\xb9\\xc06\\x81\\xf2\\xc7\\xc0-\\xddO\\xfc3\\xc7{<w -\\xb8{\\xbb\\n\\xb3B\\x06\\xc0a\\xb5\\xad\\x03B\\xa1\\xac|\\xbe\\xd2(n\\xc7\\xd7\\xbc@.\\x9a\\x9b*\\xd0\\xdca\\x85\\xe3\\x92_\\xc9\\x8du\\x99b\\xfd\\x10\\xfb\\xc9\"\\xf4!\\x92\\x0c\\xd1\\x80\\x91[\\x99BK\\xae\\xc6j\\xce^\\xa9q\\xc2=\\xad\\xd5Ra.\\x0b\\xc3\\x9b\\x9f\\xdf\\xbe\\xbc\\xbe\\xd2\\xc3>\\xa4~\\xe4\\x8d\\xce\\xcep\\xce\\xd7(8+\\xb0\\x9b\\xe6\\xba\\x1e\\xcfN\\x91Ak\\x07\\x04\\x9a\\xfe\\xfe\\x87!\\x10\\xb8\\x98\\t\\x9a\\x942\\xddS\\xb3\\xc7Iv\\xff\\xa0\\xbb\\xa9\\xc1\\xebW\\xd87\\xa7U\\x12\\x00\\xd2\\xbb\\x9cgU\\x1c\\x9a\\x95J\\xb5|\\'\\xa1gSSF#\\x8aJ?\\xb4\\xc0\\rYyGV\\x0f\\xbf\\x7f\\xb3\\xc0\\x1dI\\x10\\xdb\\xa0\\x8f\\xb3&\\x88v\\xfeW\\x8c\\xa1\\xa5W\\x061\\x8da\\xd0\\x0fi\\xfcWm\\r\\xa8\\xfb-\\x83s\\xdc=Q}g\\x12du\\xa1[\\xd1\\x9aY\\xd67\\x1c\\xdd\\x1b\\xba\\xc4\\x9a\\xe85\\\\|,{\\xf4\\xe4\\xca\\xc9\\x1f\\xfeb3\\\\\\xfbb5d<d\\xb9c_L\\x9e\\x16\\x1cz\\xb5\\xa7~@s[\\x8bz\\xfe\\xf1\\xf5\\xed\\xe5\\xbf_A\\x0c\\xbf\\x18\\x9d\\x8e\\xebNG\\x8d`\\xe51B\\xa6\\x97\\xd7\\x8e\\xfa\\x81\\xc7\\xect\\xe8&f\\xa9\\xecB\\x8e\\xacF\\xb1\\xd7\\x93 \"\\xc8\\xd8nO\\\\\\xce#\\xcc}\\xb8;\\xc4?i\\xd6Jk\\x12hQD\\x91\\xec\\x8d\\xf5\\xafM}0\\x9b\\x9c\\t9o\\x9f\\x92\\xc1v\\x80&\\x96D\\x13\\x1c\\xfd\\x80\\xd1\\x07\\xf9\\xa0<&\\xd5z?\\x119)\\xaa\\xb9\\xea\\xb5\\xb2\\x17\\xad\\xd8\\xc8R\\xa9\\x1a+7T\\x97\\xd9\\xbb\\x15\\x0e\\xf5\\xb5\\x85\\xfdg\\xb7\\x95X\\x00W\\xf0W\\x85\\x8a\\x86\\xc1\\xdf\\xaa\\xb6\\x0e\\xacF\\xd8\\xdeT\\xcb\\xd0\\x8f\\ty\\x95x\\xa5\\xf7\\\\\\xb7o\\x96\\x86\\xea.\\xfa\\'N\\x0b\\xe0\\xd3\\x9d5\\xaeE\\xde\\xd2]\\xd08\\xee\\x19\\x96\\x99 \\x9c\\xd2{H\\x8fd\\xecz]\\xb39\\x8b\\xd6\\xaa\\x84\\x06>=\\x0e\\xec\\x84S_^\\xd2d\\xa4\\x99\\xdc~\\xcb#\\x91\\xfd\\xd6o\\xb1\\xeam\\x16\\xff\\xdb\\xbeh\\xab\\xb7\\x18\\x06\\xf8C\\x9e\\xb3\\x18\\xfc\\x92\\x0e\\xb0\\xbev\\xa4\\xab\\xdc\\xffU\\x87\\x1c\\x96\\x85\\xe6#\\x1e\\x91\\x96\\xef\\xf1J\\x14\\x17|\\xd5\\xe7\\x92\\xf6\\xa1\\xea\\xba\\x02\\x0c\\xae\\xe4\\xae\\xfd`r\\x85\\xcbS\\xcep\\x1c\\xf7\\xeb6\\x119\\xdc\\xc4>\\x909\\xeaS\\xff\\xc8\\xed\\xcd{\\x97\\xd7e}\\xd1I}\\x7f\"\\xc1U\\xb9K\\xa7Q\\t\\xd7\\x05\\x936j9[\\xae}5\\xd3\\xb5\\xfd\\x8b\\xcb\\xfb\\xb3\\x9a\\xae\\x9bpP\\xd3\\x89\\x0b>\\xa4i\\x009\\xd1\\x19\\xc8\\xdf\\xcc\\x07n\\x8f\\x8c\\xbaPUd&=\\x07\\x12\\x8a\\x8a\\x06\\x8d~\\x12\\x18&_!\\xa3\\xa2\\xa8\\x97T\\xfdG\\xf6\\xa3r\\x82r\\x00U2\\xf7\\xc8\\xc1\\xc1\\xfd\\x06\\xdf\\x9a\\x93\\xdaw\\x08\\xc2\\xe5\\x8fPz\\xa2)\\xf0w!\\x0eu\\xbb\\x0f\\x8d*\\xdc\\x0b\\xf0]\\x96\\xf2\"\\xcc\\n8\\x83\\xbb\\xf2\\xa7\\xf5as\\xac\\xbbV\\x0e\\x06\\xb1\\x15\\x1b\\xf9+\\xc2\\x00\\xd6\\x07\\x1e\\x19\\x90\\x01D\\x95\\xb9\\x8e\\xa0\\xb0Q\\x13\\xae-\\xe1C\\xba\\xc0\\xea\\x1d\\xc7`\\xb9\\xf1\\xabZ\\xd5\\xdb#\\x95\\x89\\xd5\\x93\\xcaK\\xcc\\xee!\\x91\\x17ZyL\\xd6M\\xab\\x9b{\"\\xc7*\\xb9\\xb1m\\x88#\\x87\\xc1V\\x0f\\x9e\\xa9\\x19MC\\xd4\\x18\\xf3\\x96k\\xd6\\xa1\\r\\xed1l\\x01J\\x12l\\x1d\\tu\\xd1\\xcb|\\xd0v\\xe9c\\xff\\'\\xa4\\xea\\xba\\x04T\\xe4\\xa6q\\xeb\\xb3Um\\xbb^k\\xa9\\xf2A\\xb3\\xcd\\xdcG\\xaf>\\xfa&\\xc9\\xcejEU)\\x80\\xd3R3\\xb0KT3\\xacs\\xf0\\x02\\x03#\\xfd\\x92\\xa3\\r\\xbf\\xa5\\xf4{\\x95\\x86\\xb9\\xaa\\xfe\\x1em\\xd8\\x18f\\xa5\\xd4O\\xf0\\x7f\\xf5\\x00\\xe6`>\\xc7\\xe6q>\\x1f(\\x8d\\x9f\\x18\\xd7\\xa6\\xeaf\\xd5\\xb2nm\\xad\\xff\\x000\\xd6\\x1cn\\x19$\\x00\\x00').decode('ascii'))", "from collections import deque\n\nn, m = map(int,input().split())\nstatus = list(map(int,input().split()))\n\ncontrollers = [[] for _ in range(n)]\nfor i in range(m):\n line = map(int,input().split())\n next(line)\n for e in line:\n controllers[e - 1].append(i)\n\ngraph = [[] for _ in range(m)]\nfor k, switches in enumerate(controllers):\n for i in range(len(switches)):\n si = switches[i]\n for j in range(i):\n sj = switches[j]\n graph[si].append((sj, status[k]))\n graph[sj].append((si, status[k]))\n\ntry:\n color = [None] * m\n for start in range(m):\n if color[start] is not None:\n continue\n Q = deque([start])\n color[start] = 0\n while Q:\n node = Q.popleft()\n for neigh, w in graph[node]:\n if color[neigh] is None:\n if w: color[neigh] = color[node]\n else: color[neigh] = color[node] ^ 1\n Q.append(neigh)\n else:\n if w:\n if color[neigh] != color[node]: raise Exception\n else:\n if color[neigh] == color[node]: raise Exception\n print(\"YES\")\nexcept:\n print(\"NO\")", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef find_root(root_dict, x):\r\n L = []\r\n while x != root_dict[x]:\r\n L.append(x)\r\n x = root_dict[x]\r\n for y in L:\r\n root_dict[y] = x \r\n return x \r\n \r\ndef process(A, B):\r\n n = len(A)\r\n m = len(B)\r\n g1 = [[] for i in range(n+1)]\r\n for i in range(m):\r\n Bi = B[i][1:]\r\n for x in Bi:\r\n g1[x].append(i)\r\n root_dict = [i for i in range(2*m)]\r\n for i in range(n):\r\n a, b = g1[i+1]\r\n a1 = find_root(root_dict, a)\r\n a2 = find_root(root_dict, m+a)\r\n b1 = find_root(root_dict, b)\r\n b2 = find_root(root_dict, m+b)\r\n if A[i]==1:\r\n root_dict[a1]=b1 \r\n a2 = find_root(root_dict, m+a)\r\n b2 = find_root(root_dict, m+b)\r\n root_dict[a2]=b2 \r\n elif A[i]==0:\r\n root_dict[a1] = b2 \r\n a2 = find_root(root_dict, m+a)\r\n b1 = find_root(root_dict, b)\r\n root_dict[a2] = b1\r\n for i in range(m):\r\n i1 = find_root(root_dict, i)\r\n i2 = find_root(root_dict, m+i)\r\n if i1==i2:\r\n sys.stdout.write('NO\\n')\r\n return \r\n sys.stdout.write('YES\\n')\r\n return\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nn, m = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nB = []\r\nfor i in range(m):\r\n row = [int(x) for x in input().split()]\r\n B.append(row)\r\nprocess(A, B)\r\n", "n, m = map(int, input().split())\r\nstatus = list(map(int, input().split()))\r\nroom_control = [[] for _ in range(n+1)]\r\nadj = [[] for _ in range(m)]\r\n \r\ncolor = [-1] * m\r\n \r\nvisited = [False] * m\r\n \r\ndef bfs(u, visited):\r\n\tcolor[u] = 0\r\n\tq = [u]\r\n\th = 0\r\n\tvisited[u] = True\r\n\t\r\n\twhile (h<len(q)):\r\n\t\tu = q[h]\r\n\t\th+=1\r\n\t\tfor v in adj[u]:\r\n\t\t\tif (color[v[0]] == -1):\r\n\t\t\t\tcolor[v[0]] = color[u]^v[1]\r\n\t\t\t\tq.append(v[0])\r\n\t\t\t\tvisited[v[0]] = True\r\n\t\t\telse:\r\n\t\t\t\tif color[v[0]] != color[u]^v[1]: return False\r\n\treturn True\r\n \r\nfor i in range(m):\r\n\tb = list(map(int, input().split()))\r\n\tfor j in range(1, len(b)):\r\n\t\tk = b[j]\r\n\t\troom_control[k].append(i)\r\n\t\tif len(room_control[k])==2:\r\n\t\t\tadj[room_control[k][0]].append((room_control[k][1],1-status[k-1]))\r\n\t\t\tadj[room_control[k][1]].append((room_control[k][0],1-status[k-1]))\r\n\t\t\t\r\npossible = True\r\nfor i in range(m):\r\n\tif color[i] == -1:\r\n\t\tif bfs(i, visited) == False:\r\n\t\t\tpossible = False\r\n\t\t\tbreak\r\n \r\nif possible: print(\"YES\")\r\nelse: print(\"NO\")", "import sys\r\nfrom collections import deque\r\n\r\n\r\ndef bfs(Adj, edges, cols, u):\r\n nxts = deque([u])\r\n cols[u] = 0\r\n\r\n while nxts:\r\n v = nxts.popleft()\r\n\r\n for w in Adj[v]:\r\n ed = tuple(sorted([v, w]))\r\n if cols[w] is None:\r\n cols[w] = cols[v] ^ edges[ed]\r\n nxts.append(w)\r\n else:\r\n if cols[w] ^ cols[v] != edges[ed]:\r\n return False\r\n\r\n return True\r\n\r\n\r\nn, m = map(int, sys.stdin.readline().split())\r\nstatus = [1 - int(i) for i in sys.stdin.readline().split()]\r\nes = [[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n line = [int(j) for j in sys.stdin.readline().split()]\r\n\r\n for u in line[1:]:\r\n es[u - 1].append(i)\r\n\r\nAdj = [[] for i in range(m)]\r\n\r\nfor u, v in es:\r\n Adj[u].append(v)\r\n Adj[v].append(u)\r\n\r\nedges = dict()\r\n\r\nfor i, e in enumerate(es):\r\n e.sort()\r\n if tuple(e) not in edges:\r\n edges[tuple(e)] = status[i]\r\n elif edges[tuple(e)] != status[i]:\r\n print('NO')\r\n exit()\r\n else:\r\n pass\r\n\r\ncols = [None] * m\r\n\r\nfor u in range(m):\r\n if cols[u] is None:\r\n if not bfs(Adj, edges, cols, u):\r\n print('NO')\r\n exit()\r\n else:\r\n pass\r\n\r\nprint('YES')\r\n", "# ------------------- fast io --------------------\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# ------------------- fast io --------------------\r\nfrom math import ceil\r\n\r\n\r\ndef prod(a, mod=10 ** 9 + 7):\r\n ans = 1\r\n for each in a:\r\n ans = (ans * each) % mod\r\n return ans\r\n\r\n\r\ndef gcd(x, y):\r\n while y:\r\n x, y = y, x % y\r\n return x\r\n\r\n\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\n\r\ndef binary(x, length=16):\r\n y = bin(x)[2:]\r\n return y if len(y) >= length else \"0\" * (length - len(y)) + y\r\n\r\n\r\ndef find_SCC(graph):\r\n SCC, S, P = [], [], []\r\n depth = [0] * len(graph)\r\n \r\n stack = list(range(len(graph)))\r\n while stack:\r\n node = stack.pop()\r\n if node < 0:\r\n d = depth[~node] - 1\r\n if P[-1] > d:\r\n SCC.append(S[d:])\r\n del S[d:], P[-1]\r\n for node in SCC[-1]:\r\n depth[node] = -1\r\n elif depth[node] > 0:\r\n while P[-1] > depth[node]:\r\n P.pop()\r\n elif depth[node] == 0:\r\n S.append(node)\r\n P.append(len(S))\r\n depth[node] = len(S)\r\n stack.append(~node)\r\n stack += graph[node]\r\n return SCC[::-1]\r\n\r\nfor _ in range(int(input()) if not True else 1):\r\n #n = int(input())\r\n n, m = map(int, input().split())\r\n # a, b = map(int, input().split())\r\n # c, d = map(int, input().split())\r\n r = list(map(int, input().split()))\r\n # b = list(map(int, input().split()))\r\n # s = input()\r\n doors = [[] for __ in range(n + 1)]\r\n for i in range(m):\r\n a = list(map(int, input().split()))\r\n for j in range(1, len(a)):\r\n doors[a[j]] += [i + 1]\r\n \r\n graph = [[] for __ in range(2 * m + 1)]\r\n def add_edge(x, y):\r\n x2 = (x - m) if x > m else x + m\r\n y2 = (y - m) if y > m else y + m\r\n graph[x2] += [y]\r\n graph[y2] += [x]\r\n \r\n for i in range(1, n + 1):\r\n x, y = doors[i]\r\n x2 = (x - m) if x > m else x + m\r\n y2 = (y - m) if y > m else y + m\r\n if r[i-1]:\r\n # maxterm - (!a + b) * (a + !b)\r\n add_edge(x2, y)\r\n add_edge(x, y2)\r\n else:\r\n # maxterm - (!a + !b) * (a + b)\r\n add_edge(x2, y2)\r\n add_edge(x, y)\r\n \r\n scc = find_SCC(graph)\r\n cx = [-1] * (2 * m + 1)\r\n pos = True\r\n for i in range(len(scc)):\r\n for j in scc[i]:\r\n cx[j] = i\r\n for i in range(1, m + 1):\r\n if cx[i] == cx[i + m]:\r\n pos = False\r\n break\r\n print(\"YES\" if pos else \"NO\")", "import sys\r\nfrom math import inf\r\n\r\ntime = 0\r\ncc = 0\r\nl = {}\r\nd = {}\r\nf = {}\r\nconn_comp = {}\r\non_stack = {}\r\nstack = []\r\n\r\ncolor = []\r\n\r\ndef tarjan(graph):\r\n global l\r\n global d\r\n global f\r\n global pi\r\n global stack\r\n global on_stack\r\n l = {key : inf for key in graph}\r\n d = {key : -1 for key in graph}\r\n f = {key : -1 for key in graph}\r\n conn_comp = {key : -1 for key in graph}\r\n on_stack = {key : False for key in graph}\r\n\r\n for i in graph.keys():\r\n if d[i] == -1:\r\n strongconnect(graph, i)\r\n\r\n\r\ndef strongconnect(graph, v):\r\n global time\r\n global cc\r\n\r\n stack.append(v)\r\n on_stack[v] = True\r\n time += 1\r\n d[v] = time\r\n\r\n for i in graph[v]:\r\n if d[i] == -1:\r\n strongconnect(graph, i)\r\n l[v] = min(l[v], l[i])\r\n if on_stack[i]:\r\n l[v] = min(l[v], d[i])\r\n\r\n if l[v] == d[v]:\r\n cc += 1\r\n w = stack.pop()\r\n while w != v:\r\n conn_comp[w] = cc\r\n on_stack[w] = False\r\n w = stack.pop()\r\n conn_comp[v] = cc\r\n on_stack[v] = False\r\n\r\ndef read():\r\n n,m = map(int, sys.stdin.readline().split())\r\n\r\n status = list(map(int, sys.stdin.readline().split()))\r\n\r\n doors_switch = [[] for i in range(n)]\r\n\r\n for i in range(m):\r\n temp = list(map(int, sys.stdin.readline().split()))\r\n for j in range (1,len(temp)):\r\n door = temp[j]\r\n doors_switch[door-1].append(i)\r\n\r\n return m, status, doors_switch\r\n\r\ndef build_graph_scc():\r\n m, status, doors_switch = read()\r\n graph = {i : set() for i in range(2*m)}\r\n \r\n for i in range (len(doors_switch)):\r\n switch_1, switch_2 = tuple(doors_switch[i])\r\n if status[i]:\r\n graph[2*switch_1].add(2*switch_2)\r\n graph[2*switch_2].add(2*switch_1)\r\n graph[2*switch_1 + 1].add(2*switch_2 + 1)\r\n graph[2*switch_2 + 1].add(2*switch_1 + 1)\r\n else:\r\n graph[2*switch_1].add(2*switch_2 + 1)\r\n graph[2*switch_2].add(2*switch_1 + 1)\r\n graph[2*switch_1 + 1].add(2*switch_2)\r\n graph[2*switch_2 + 1].add(2*switch_1)\r\n\r\n return graph\r\n\r\ndef build_graph_bfs():\r\n m, status, doors_switch = read()\r\n g = [[] for i in range(m)]\r\n global color\r\n color = [-1] * m\r\n for i in range(len(status)):\r\n switch_1, switch_2 = tuple(doors_switch[i])\r\n g[switch_1].append((switch_2, 1 - status[i]))\r\n g[switch_2].append((switch_1, 1 - status[i]))\r\n return g\r\n\r\ndef bfs_bipartite(graph, v):\r\n color[v] = 0\r\n q = [v]\r\n j = 0\r\n\r\n while j < len(q):\r\n v = q[j]\r\n for w,st in graph[v]:\r\n if color[w] == -1:\r\n color[w] = color[v]^st\r\n q.append(w)\r\n else:\r\n if color[w] != color[v]^st:\r\n return False\r\n j+=1\r\n return True\r\n\r\n\r\ndef main():\r\n # graph = build_graph_scc()\r\n # tarjan(graph)\r\n # for i in range(0, len(conn_comp), 2):\r\n # if conn_comp[i] == conn_comp[i+1]:\r\n # print(\"NO\")\r\n # return\r\n # print(\"YES\")\r\n\r\n graph = build_graph_bfs()\r\n for i in range(len(graph)):\r\n if color[i] == -1 and not bfs_bipartite(graph, i):\r\n print(\"NO\")\r\n return\r\n print(\"YES\")\r\n\r\n\r\n\r\nmain()", "import sys\r\n \r\nn, m = map(int, input().split())\r\n \r\ndoor = list(map(int, input().split()))\r\n \r\na = [[] for i in range(n+1)]\r\n \r\ne = [[] for i in range(m)]\r\n \r\ncolor = [-1] * m\r\n \r\nvisited = [False] * m\r\n \r\ndef bfs(u, visited):\r\n\tcolor[u] = 0\r\n\tq = [u]\r\n\th = 0\r\n\tvisited[u] = True\r\n\t\r\n\twhile (h<len(q)):\r\n\t\tu = q[h]\r\n\t\th+=1\r\n\t\tfor v in e[u]:\r\n\t\t\tif (color[v[0]] == -1):\r\n\t\t\t\tcolor[v[0]] = color[u]^v[1]\r\n\t\t\t\tq.append(v[0])\r\n\t\t\t\tvisited[v[0]] = True\r\n\t\t\telse:\r\n\t\t\t\tif color[v[0]] != color[u]^v[1]: return False\r\n\treturn True\r\n \r\nfor i in range(m):\r\n\tb = list(map(int, input().split()))\r\n\tfor j in range(1, len(b)):\r\n\t\tk = b[j]\r\n\t\ta[k].append(i)\r\n\t\tif len(a[k])==2:\r\n\t\t\te[a[k][0]].append((a[k][1],1-door[k-1]))\r\n\t\t\te[a[k][1]].append((a[k][0],1-door[k-1]))\r\n\t\t\t\r\nflag = True\r\nfor i in range(m):\r\n\tif color[i] == -1:\r\n\t\tif bfs(i, visited) == False:\r\n\t\t\tflag = False\r\n\t\t\tbreak\r\n \r\nif flag: print(\"YES\")\r\nelse: print(\"NO\")", "from sys import stdin, stdout\r\nfrom math import inf\r\n\r\ndef dfs(G):\r\n\r\n n = len(G)\r\n visited = [False] * n\r\n\r\n ans = []\r\n low = [inf]*n\r\n dist = [inf]*n\r\n parent = [-1]*n\r\n time = 0\r\n\r\n def dfs_visit(u):\r\n nonlocal G, visited, ans, time, dist, parent\r\n stack = [u]\r\n while len(stack) != 0:\r\n u = stack[-1]\r\n if visited[u]:\r\n stack.pop()\r\n if visited[u] == 1:\r\n ans.append(u)\r\n visited[u] = 2\r\n\r\n for v in G[u]:\r\n if parent[u] != v:\r\n low[u] = min(low[u], low[v])\r\n\r\n else:\r\n visited[u] = 1\r\n dist[u] = time\r\n low[u] = time\r\n time += 1\r\n\r\n for v in G[u]:\r\n if not visited[v]:\r\n stack.append(v)\r\n parent[v] = u\r\n\r\n\r\n for a in range(n):\r\n if not visited[a]:\r\n dfs_visit(a)\r\n return low\r\n\r\n\r\ndef find_SCC(graph):\r\n SCC, S, P = [], [], []\r\n depth = [0] * len(graph)\r\n\r\n stack = list(range(len(graph)))\r\n while stack:\r\n node = stack.pop()\r\n if node < 0:\r\n d = depth[~node] - 1\r\n if P[-1] > d:\r\n SCC.append(S[d:])\r\n del S[d:], P[-1]\r\n for node in SCC[-1]:\r\n depth[node] = -1\r\n elif depth[node] > 0:\r\n while P[-1] > depth[node]:\r\n P.pop()\r\n elif depth[node] == 0:\r\n S.append(node)\r\n P.append(len(S))\r\n depth[node] = len(S)\r\n stack.append(~node)\r\n stack += graph[node]\r\n return SCC[::-1]\r\n\r\ndef main():\r\n input = stdin.readline\r\n n, m = map(int, input().split())\r\n door_state = [int(x) for x in input().split()]\r\n door_switches = [[] for _ in range(n)]\r\n\r\n\r\n for i in range(m):\r\n arr = [int(x) for x in input().split()]\r\n\r\n for door in arr[1:]:\r\n door_switches[door-1].append(i)\r\n\r\n\r\n\r\n graph = [[] for _ in range(2*m)]\r\n LOCKED = 0\r\n UNLOCKED = 1\r\n for i in range(n):\r\n if door_state[i] == LOCKED:\r\n # 2 edges undirected\r\n\r\n graph[door_switches[i][0]].append(m + door_switches[i][1])\r\n graph[door_switches[i][1]].append(m + door_switches[i][0])\r\n graph[m + door_switches[i][0]].append(door_switches[i][1])\r\n graph[m + door_switches[i][1]].append(door_switches[i][0])\r\n else:\r\n # 2 edges undirected\r\n jd = door_switches[i]\r\n x, y = jd\r\n graph[x].append(y)\r\n graph[y].append(x)\r\n graph[m + x].append(m + y)\r\n graph[m + y].append(m + x)\r\n\r\n scc = find_SCC(graph)\r\n low = [-1]*(2*m)\r\n for i in range(len(scc)):\r\n for j in scc[i]:\r\n low[j] = i\r\n\r\n # for el in graph:\r\n # print(el)\r\n # print(low)\r\n # print(door_switches)\r\n # print(low)\r\n # print(len(graph), m)\r\n for i in range(m):\r\n if low[i] == low[m+i]:\r\n stdout.write('NO')\r\n return\r\n stdout.write('YES')\r\n\r\n\r\nmain()\r\n\r\n\r\n" ]

[ "from math import inf\r\n\r\ndef vect(x, y):\r\n return abs(sum([x[i]*(y[(i+1)%3]-y[(i+2)%3]) for i in range(3)]))\r\ndef l(x, y):\r\n return ((x[0]-x[2])**2 + (y[0]-y[2])**2)**0.5\r\ndef h(x, y):\r\n return vect(x, y) / l(x, y)\r\n\r\nn = int(input())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n x.append(a)\r\n y.append(b)\r\nx += x[:2]\r\ny += y[:2]\r\n\r\ndmin = inf\r\nfor i in range(n):\r\n d = h(x[i:i+3], y[i:i+3])/2\r\n if dmin > d:\r\n dmin = d\r\n\r\nprint(dmin)", "#!/usr/bin/python3\r\n\r\n\r\ndef calc(d1,d2,d3):\r\n\treturn ((2*d1*d3 + 2*d2*d3 - d3*d3 - (d1-d2)**2)/(16*d3))**0.5\r\n\r\n\r\ndef dist(X1,X2):\r\n\tx1,y1 = X1\r\n\tx2,y2 = X2\r\n\treturn (x1-x2)**2 + (y1-y2)**2\r\n\r\n\r\nN = int(input().strip())\r\npts = []\r\nfor _ in range(N):\r\n\tpts.append(tuple([int(x) for x in input().strip().split()]))\r\nminr = float(\"inf\")\r\nfor i in range(N):\r\n\td1 = dist(pts[i],pts[(i+1)%N])\r\n\td2 = dist(pts[(i+2)%N],pts[(i+1)%N])\r\n\td3 = dist(pts[(i+2)%N],pts[i])\r\n\tminr = min(minr,calc(d1,d2,d3))\r\nprint(\"%.9f\"%(minr))", "from math import *\nn=int(input())\nr=[list(map(int,input().split())) for _ in range(n)]\nans = 10 ** 20\nfor i in range(n):\n\tx0,y0=r[(i+n-1)%n]\n\tx1,y1=r[(i+1)%n]\n\tx,y=r[i]\n\tans=min(ans,abs((y1-y0)*x-(x1-x0)*y-(x0*y1-x1*y0))/sqrt((x1-x0)**2+(y1-y0)**2))\nprint(ans/2)", "def calc(distance_1,distance_2,distance_3):\r\n\treturn ((2*distance_1*distance_3 + 2*distance_2*distance_3 - distance_3*distance_3 - (distance_1-distance_2)**2)/(16*distance_3))**0.5\r\ndef distance(point_1,point_2):\r\n\tpoint_1,y1 = point_1\r\n\tpoint_2,y2 = point_2\r\n\treturn (point_1-point_2)**2 + (y1-y2)**2\r\n\r\nn = int(input().strip())\r\n\r\npoints = []\r\nfor _ in range(n):\r\n\tpoints.append(tuple([int(x) for x in input().strip().split()]))\r\nmin_ = float(\"inf\")\r\nfor i in range(n):\r\n\tdistance_1 = distance(points[i],points[(i+1)%n])\r\n\tdistance_2 = distance(points[(i+2)%n],points[(i+1)%n])\r\n\tdistance_3 = distance(points[(i+2)%n],points[i])\r\n\tmin_= min(min_,calc(distance_1,distance_2,distance_3))\r\nprint(\"%.9f\"%(min_))", "#!/usr/bin/env python3\n\nfrom decimal import Decimal\n\n\ndef dist(a, b):\n x1, y1 = a\n x2, y2 = b\n return Decimal((x1-x2)**2+(y1-y2)**2).sqrt()\n\n\ndef minh(a, b, c):\n m = dist(a, b)\n n = dist(b, c)\n k = dist(a, c)\n p = Decimal(m + n + k)/2\n sqp = (p*(p-m)*(p-n)*(p-k)).sqrt()\n hm = (Decimal(2)/m)*sqp\n hn = (Decimal(2)/n)*sqp\n hk = (Decimal(2)/k)*sqp\n return min([hm, hn, hk])\n\n\ndef solve():\n n = int(input())\n coords = []\n for i in range(n):\n coords.append(tuple(map(int, input().split())))\n coords += coords\n\n res = min(\n minh(coords[i], coords[i+1], coords[i+2])\n for i in range(n))\n\n print(res/2)\n\nif __name__ == '__main__':\n solve()\n", "import math\r\n\r\n\r\nclass Pt:\r\n def __init__(self, x, y):\r\n self.x, self.y = x, y\r\n\r\n def __sub__(self, other):\r\n return Pt(self.x - other.x, self.y - other.y)\r\n\r\n def __mul__(self, other):\r\n return self.x * other.x + self.y * other.y\r\n\r\n def __xor__(self, other):\r\n return self.x * other.y - self.y * other.x\r\n\r\n def len(self):\r\n return math.sqrt(self.x ** 2 + self.y ** 2)\r\n\r\n\r\nn = int(input())\r\ndata = []\r\nfor i in range(n):\r\n data.append(Pt(*list(map(int, input().split()))))\r\nmin_ = 10 ** 10\r\nfor i in range(1, n - 1):\r\n A = data[i - 1]\r\n B = data[i + 1]\r\n C = data[i]\r\n r = abs((C - A) ^ (B - A)) / (B - A).len()\r\n min_ = min(min_, r)\r\nA = data[0]\r\nB = data[n - 2]\r\nC = data[n - 1]\r\nr = abs((C - A) ^ (B - A)) / (B - A).len()\r\nmin_ = min(min_, r)\r\nA = data[1]\r\nB = data[n - 1]\r\nC = data[0]\r\nr = abs((C - A) ^ (B - A)) / (B - A).len()\r\nmin_ = min(min_, r)\r\nprint(min_ / 2)\r\n", "t = int(input())\r\npoint = []\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n point.append([a, b])\r\nans = 241412221123\r\nfor i in range(t):\r\n p0 = point[i]\r\n z = point[(i + 1) % t]\r\n p1 = point[(i + 2) % t]\r\n line = [p1[1] - p0[1],-(p1[0]-p0[0]),-p0[0]*(p1[1] - p0[1]) + p0[1]*(p1[0]-p0[0])]\r\n ansa = abs((line[0]*z[0] + line[1]*z[1] + line[2])/((line[0]**2 + line[1]**2)**(1/2)))\r\n ans = min(ans,ansa/2)\r\nprint(ans)", "class Vector:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n \r\n def __add__(self, other):\r\n return Vector(self.x + other.x, self.y + other.y)\r\n \r\n def __sub__(self, other):\r\n return Vector(self.x - other.x, self.y - other.y)\r\n \r\n def to(self, other):\r\n return other - self\r\n \r\n def __repr__(self):\r\n return \"(%s %s)\" % (self.x, self.y)\r\n\r\n def dot(self, other):\r\n return self.x * other.y - self.y * other.x\r\n \r\n def lensq(self):\r\n return self.x ** 2 + self.y ** 2\r\n\r\nVec = Vector\r\n\r\ndef getH(p, a, b):\r\n s2 = p.to(a).dot(p.to(b))\r\n # a * h / 2 = s\r\n # h = s * 2 / a\r\n return s2 / (a.to(b).lensq() ** 0.5)\r\n\r\npts = [Vec(*map(int, input().split())) for i in range(int(input()))]\r\nn = len(pts)\r\npts.append(pts[0])\r\npts.append(pts[1])\r\n\r\nans = 12351513153155135135\r\n\r\nfor i in range(n):\r\n ans = min(ans, getH(pts[i + 1], pts[i], pts[i + 2])/2)\r\n\r\nprint(ans)\r\n ", "n = int(input())\r\npoints = [[int(x) for x in input().split()] for _ in range(n)]\r\nmenor = 999999999999999999999999\r\nfor i in range(n):\r\n x0, y0 = points[i]\r\n x1, y1 = points[(i-1)%n]\r\n x2, y2 = points[(i+1)%n]\r\n areadoub = abs((x2-x1)*(y1-y0) - (x1 - x0)*(y2-y1))\r\n b = ((x2 - x1)**2 + (y2-y1)**2)**(1/2)\r\n menor = min(menor, (areadoub/b)/2)\r\nprint(menor)\r\n", "from math import *\r\ndef line(x1,y1,x2,y2):\r\n\r\n a=(y1-y2)/(x1-x2)\r\n b=y1-a*x1\r\n return [a,b]\r\n\r\ndef line_(a,b):\r\n return [a,-1,b]\r\n\r\ndef distance(a,b,c,x,y):\r\n ans=abs(a*x+b*y+c)\r\n per=pow(a*a+b*b,0.5)\r\n return ans/per\r\n\r\nn=int(input())\r\nnode=[[0,0] for i in range(1,n+4)]\r\nfor j in range(1,n+1):\r\n x=\"\"\r\n y=\"\"\r\n for i in input().split():\r\n if x==\"\":\r\n x=int(i)\r\n else:\r\n y=int(i)\r\n node[j][0]=x\r\n node[j][1]=y\r\nres=1999999999999\r\nfor i in range(1,n+1):\r\n left=i-1\r\n right=i+1\r\n if left<=0:\r\n left=n\r\n if right>n:\r\n right=1\r\n\r\n if node[left][0]==node[right][0]:\r\n k=abs(node[left][0]-node[i][0])/2\r\n res=min(res,k)\r\n\r\n else:\r\n Line=line(node[left][0],node[left][1],node[right][0],node[right][1])\r\n LINE=line_(Line[0],Line[1])\r\n dis=distance(LINE[0],LINE[1],LINE[2],node[i][0],node[i][1])\r\n res=min(res,dis/2)\r\n\r\nprint(res)", "from math import *\r\nn=int(input())\r\nr=[list(map(int,input().split())) for _ in range(n)]\r\nans = 10 ** 20\r\nfor i in range(n):\r\n\tx0,y0=r[(i+n-1)%n]\r\n\tx1,y1=r[(i+1)%n]\r\n\tx,y=r[i]\r\n\tans=min(ans,abs((y1-y0)*x-(x1-x0)*y-(x0*y1-x1*y0))/sqrt((x1-x0)**2+(y1-y0)**2))\r\nprint(ans/2)", "# from decimal import *\r\n# getcontext().prec=16\r\n# from math import sqrt\r\n# from scipy.special import binom\r\n# from collections import defaultdict\r\n# from math import sin,pi,sqrt\r\nfrom math import sqrt,hypot\r\n\r\ndef dist(a, b, c):\r\n return abs((c[1] - a[1])*b[0] - (c[0] - a[0])*b[1] + c[0]*a[1] - c[1]*a[0])/hypot(c[0]-a[0], c[1]- a[1])/2\r\n\r\nn=int(input())\r\nliste=[ list(map(int,input().split(\" \"))) for _ in range(n)]\r\n\r\nd=-1\r\nfor i in range(n):\r\n if i==n-1:\r\n a,b,c=liste[n-2],liste[n-1],liste[0]\r\n else:\r\n a,b,c=liste[i-1],liste[i],liste[i+1]\r\n if d!=-1:\r\n d=min(d,dist(a,b,c))\r\n else:\r\n d=dist(a,b,c)\r\n\r\nprint(d)", "from math import sqrt\n\nn = int(input())\ncoor = []\nfor i in range(n):\n x,y = map(int, input().split())\n coor.append((x,y))\ncoor.append(coor[0])\ncoor.append(coor[1])\n\nmini = None\n\nfor i in range(n):\n area = coor[i][0]*(coor[i+1][1] - coor[i+2][1])\n area += coor[i+1][0]*(coor[i+2][1] - coor[i][1])\n area += coor[i+2][0]*(coor[i][1] - coor[i+1][1]) \n c = sqrt((coor[i+2][0]-coor[i][0])**2 + (coor[i+2][1]-coor[i][1])**2)\n hc = abs(area/c)\n if mini is None or mini > hc:\n mini = hc\nprint(mini/2)\n", "n = int(input())\npoints = [[int(i) for i in input().split()] for _ in range(n)]\nmd = float(\"inf\")\nfor i in range(n):\n cur = points[i]\n nxt = points[(i+1)%n]\n chk = points[(i+2)%n]\n v1 = [nxt[0]-cur[0], nxt[1]-cur[1]]\n v2 = [chk[0]-cur[0], chk[1]-cur[1]]\n dcc = ((cur[0]-chk[0])**2+(cur[1]-chk[1])**2)**0.5\n area = abs(0.5 * (v1[0] * v2[1] - v1[1] * v2[0]))\n dis = area / dcc\n md = min(md, dis)\nprint(md)\n \t \t \t\t\t \t \t \t\t\t \t\t \t\t\t", "n = int(input())\r\n\r\nP = []\r\n\r\n\r\ndef h(p1, p2, m):\r\n return abs(((p2[0] - p1[0])*(m[1] - p1[1])-(p2[1] - p1[1])*(m[0] - p1[0]))\\\r\n /((p2[0] - p1[0]) ** 2 + (p2[1] - p1[1])**2) ** 0.5)\r\n\r\n\r\nfor i in range(n):\r\n P.append(list(map(int, input().split())))\r\n\r\nanswer = float(\"inf\")\r\n\r\nfor i in range(n):\r\n cw = P[(i + 1) % n]\r\n ucw = P[i - 1]\r\n answer = min(answer, h(cw, ucw, P[i])/2)\r\n\r\nprint(answer)\r\n", "from math import hypot\n\n\nn = int(input())\n\n\ndef square(a, b, c):\n\tfirst = [a[0] - c[0], a[1] - c[1]]\n\tsecond = [b[0] - c[0], b[1] - c[1]]\n\treturn abs(first[0] * second[1] - first[1] * second[0])\n\ndef height(a, b, c):\n\treturn square(a, b, c) / hypot(a[0] - b[0], a[1] - b[1])\n\n\npoints = []\nfor i in range(n):\n\tpoints.append(list(map(float, input().split())))\n_max = 3e9\n\nfor i in range(n):\n\ta = points[i]\n\tb = points[(i + 1) % n]\n\tc = points[(i + 2) % n]\n\t_max = min(_max, (height(a, b, c) / 2))\n\t_max = min(_max, height(c, a, b) / 2)\n\t_max = min(_max, (height(b, c, a) / 2))\n\nprint(_max)", "def cal(v0, v1, v2):\n x0, y0 = v0\n x1, y1 = v1\n x2, y2 = v2\n dy = y2-y0\n dx = x2-x0\n A = -dy\n B = dx\n C = dy*x0-dx*y0\n return ((A*x1+B*y1+C)/((A*A+B*B)**0.5))/2.0\nn = input()\nn = int(n)\nv = [0,0]*1100\nans = -1\nfor i in range(n):\n v[i] = input().split()\n v[i][0] = int(v[i][0])\n v[i][1] = int(v[i][1])\nv[n] = v[0]\nv[n+1] = v[1]\nfor i in range(n):\n if ans < 0:\n ans = cal(v[i], v[i+1], v[i+2])\n else:\n ans = min(ans, cal(v[i], v[i+1], v[i+2]))\nprint(ans)\n \t \t\t \t\t\t \t \t\t \t \t \t \t\t", "import math\ndef dist(a, b, c):\n return abs((c[1] - a[1])*b[0] - (c[0] - a[0])*b[1] + c[0]*a[1] - c[1]*a[0])/math.hypot(c[0]-a[0], c[1]- a[1]);\nN = int(input())\npts = [tuple(map(int, input().split())) for _ in range(N)]\nMIN = 10000000000.0\nfor i in range(N-2):\n MIN = min(MIN, dist(pts[i], pts[i+1], pts[i+2]))\n\nMIN = min(MIN, dist(pts[N-2], pts[N-1], pts[0]))\nMIN = min(MIN, dist(pts[N-1], pts[0], pts[1]))\nprint(MIN/2)\n\n\n\n\n\n# Made By Mostafa_Khaled", "def r(pred, cur, nxt):\r\n x1, y1 = nxt['x'] - pred['x'], nxt['y'] - pred['y']\r\n x2, y2 = cur['x'] - pred['x'], cur['y'] - pred['y']\r\n m = abs(x1 * y2 - x2 * y1)\r\n return m / (x1**2 + y1**2)**0.5\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n x, y = (int(_) for _ in input().split())\r\n a.append({'x': x, 'y': y})\r\nmin_r = r(a[-1], a[0], a[1]) / 2\r\nfor i in range(1, n):\r\n min_r = min(min_r, r(a[i - 1], a[i], a[(i + 1) % n]) / 2)\r\nprint(min_r)\r\n", "import sys\nimport math\n\ndata = sys.stdin.read().split()\ndata_ptr = 0\n\ndef data_next():\n global data_ptr, data\n data_ptr += 1\n return data[data_ptr - 1]\n\nN = int(data_next())\narr = list(zip(map(int, data[1::2]), map(int, data[2::2])))\n\ndef cross(x1, y1, x2, y2):\n return x1 * y2 - x2 * y1\n\ndef dist(x, y):\n return math.sqrt(x * x + y * y)\n\nans = 4000000000.0\nfor i in range(N):\n x1, y1 = arr[i - 1]\n x2, y2 = arr[i]\n x1 -= arr[i - 2][0]\n x2 -= arr[i - 2][0]\n y1 -= arr[i - 2][1]\n y2 -= arr[i - 2][1]\n ans = min(ans, abs(cross(x1, y1, x2, y2) / dist(x2, y2) / 2))\nprint(ans)\n", "import math\n\n\nclass Vector:\n @staticmethod\n def from_vectors(v1, v2):\n return Vector(v2.x - v1.x, v2.y - v1.y)\n\n def __init__(self, x, y):\n self.x = x\n self.y = y\n\n def len(self):\n return math.sqrt(self.x ** 2 + self.y ** 2)\n\n\ndef cross_product(v1, v2):\n return v1.x * v2.y - v1.y * v2.x\n\n\nn = int(input())\n\npoints = [Vector(*map(int, input().split())) for i in range(n)]\n\nans = float('inf')\nfor cur in range(n):\n prev = (cur - 1) % n\n nxt = (cur + 1) % n\n left = Vector.from_vectors(points[cur], points[prev])\n right = Vector.from_vectors(points[cur], points[nxt])\n base_len = Vector.from_vectors(points[prev], points[nxt]).len()\n area = abs(cross_product(left, right)) / 2\n ans = min(ans, area / base_len)\n\nprint(ans)\n", "def d(x, y, x1, y1, x2, y2):\r\n if x1 == x2:\r\n return abs(x - x1)\r\n elif y1 == y2:\r\n return abs(y - y1)\r\n else: \r\n return abs(((x-x1)/(x2-x1) - (y-y1)/(y2-y1)) / (1/(x2-x1)**2 + 1/(y2-y1)**2)**0.5)\r\n\r\ndef delta(a, b, c):\r\n return d(a[0], a[1], b[0], b[1], c[0], c[1]) / 2\r\n\r\nn = int(input())\r\ndata = [list(map(int, input().split())) for t in range(n)]\r\ndata.append(data[0])\r\ndata.append(data[1])\r\nprint(min(map(delta, data[1:], data, data[2:]))) \r\n", "import math\r\n \r\ndef dist(p1, p2):\r\n return math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)\r\n \r\ndef cross(p1, p2):\r\n return p1[0] * p2[1] - p1[1] * p2[0]\r\n \r\ndef parse_point(line):\r\n tokens = line.split()\r\n return int(tokens[0]), int(tokens[1])\r\n \r\nn = int(input())\r\npt = [parse_point(input()) for _ in range(n)]\r\n \r\nres = 1e100\r\npr1, pr2 = None, None\r\nfor i in range(len(pt)):\r\n pr1 = pt[i - 2]\r\n pr2 = pt[i - 1]\r\n cur = pt[i]\r\n p1 = (pr1[0] - pr2[0], pr1[1] - pr2[1])\r\n p2 = (cur[0] - pr2[0], cur[1] - pr2[1])\r\n c = dist(pr1, cur)\r\n\r\n if abs(cross(p1, p2) / 2) / c < res:\r\n res = abs(cross(p1, p2) / 2) / c\r\n \r\nprint(res)" ]

[ "#10010101\r\nn,e = map(int,input().split())\r\ns = input()\r\ni = 0\r\nd = e\r\nans = -1\r\nflag = 0\r\nwhile(i<n-1):\r\n if(n-i-1 < e):\r\n e = n - i - 1\r\n d = e\r\n if(d==0):\r\n flag = 1\r\n print(\"-1\")\r\n break\r\n if(s[i+d]=='1'):\r\n i = i + d\r\n ans+=1\r\n d = e\r\n else:\r\n d-=1\r\n\r\nif(flag==0):\r\n print(ans+1)\r\n\r\n\r\n\r\n", "# Time complexity: O(n)\n# Space complexity: O(n)\n# Rationale: For each location with lily, the minimum step to reach is 1 + step\n# to reach the previous lily (within the jump range d). To avoid counting for the\n# spots without lily, we use a large number for comparison to skip the computation.\n\nn, d = map(int, input().split())\nlilies = list(map(int, input()))\n\ndp = [102] * (n + 1)\ndp[0] = dp[1] = 0 # dp[0] is not used; dp[1] is 0 because we start from here.\n\nfor i in range(2, n + 1): # Loops through the rest of the lilies.\n if lilies[i - 1] == 1:\n for j in range(max(0, i - d),\n i): # Checks the steps on previous lily within jump range.\n dp[i] = min(dp[i], dp[j] + 1)\n\nif dp[n] > n: # Here dp[n] is 102.\n print(-1)\nelse:\n print(dp[n])\n\n \t\t \t \t\t \t\t \t\t \t \t \t\t\t", "def jumps(t, s, a):\n p=1\n j=0\n i=0\n while i < s:\n if p+s-i<=t and int(a[p+s-i-1])==1:\n p=p+s-i\n j+=1\n i=-1\n if p==t:\n print(j)\n return\n\n i+=1\n print(-1)\n\ndef main():\n try:\n k=[int(x) for x in input().split(' ')]\n t=k[0]\n s=k[1]\n a=input()\n jumps(t, s, a)\n main()\n except:\n print()\nmain()\n\t\t \t \t \t \t \t \t\t \t\t\t \t\t\t\t\t\t", "n, d = map(int, input().split())\nline = input()\n\nzeros_streak = 0\ncount = 0\nfor i in line:\n if i == '0':\n count += 1\n if count > zeros_streak:\n zeros_streak = count\n \n else:\n count = 0 \n\nif zeros_streak >= d:\n print(-1)\n\nelse:\n tps = 0\n i = 0\n\n while i < n - 1:\n if line[i] == '1':\n i += d\n tps += 1\n else:\n i -= 1\n\n print(tps)\n\n", "n,k=map(int, input().split()) \r\ns=str(input())\r\nc=0;i=1\r\nwhile i<n: #i is ind of front lily\r\n if s[i:min(i+k,n)].count('1')==0:\r\n c=-1\r\n break\r\n else:\r\n i=k-s[min(i+k-1,n-1):i-1:-1].index('1')+i\r\n c+=1\r\nprint(c)\r\n", "n,d = map(int,input().split())\r\npath = input()\r\n\r\ncount = 0\r\nx = 0\r\n\r\npreArr = [0]\r\nfor i in range(1,n):\r\n if path[i] == '1':\r\n preArr.append(i)\r\n else:\r\n preArr.append(preArr[i-1])\r\n\r\nwhile x!=(n-1):\r\n # y = path[:x+d+1].rfind('1')\r\n y = preArr[min(n-1,x+d)]\r\n if x == y:\r\n count = -1\r\n break\r\n else:\r\n count += 1\r\n x = y\r\n\r\nprint(count)", "n,d=map(int,input().split(' '))\r\na=input()\r\n\r\ni=0\r\ncount=0\r\nwhile i!=n-1:\r\n flag=False\r\n for j in range(i+1,d+i+1):\r\n if a[j]=='1':\r\n i=j\r\n flag=True\r\n if i==n-1:\r\n break\r\n if flag:\r\n count+=1\r\n else:\r\n print(-1)\r\n exit()\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\nclass Graph:\r\n \r\n\r\n def __init__(self):\r\n\r\n self.graph = defaultdict(list)\r\n self.visit = {}\r\n self.ff=0\r\n self.count=0\r\n def flag(self):\r\n return self.ff\r\n\r\n def creategh(self,a,b):\r\n self.graph[a].append(b)\r\n \r\n def DFSUtil(self, v):\r\n\r\n self.visit[v]=1\r\n \r\n if(v==n):\r\n print(self.count)\r\n self.ff=1\r\n return\r\n else:\r\n self.count+=1\r\n\r\n for neighbour in self.graph[v]:\r\n if neighbour not in self.visit:\r\n self.DFSUtil(neighbour)\r\n\r\n def DFS(self, v):\r\n self.DFSUtil(v)\r\n\r\ng = Graph()\r\n\r\nn,m = map(int,input().split())\r\nx = list(input())\r\nfor i in range(len(x)-1):\r\n if(x[i]==\"1\"):\r\n \r\n for j in range(min(len(x),i+m+1),i+1,-1):\r\n g.creategh(i+1,j)\r\n else:\r\n \r\n for j in range(min(len(x),i+m+1),i+1,-1):\r\n g.creategh(i+1,j)\r\n g.visit[i+1]=1\r\n\r\ng.DFS(1)\r\nif(g.ff==0):\r\n print(\"-1\")\r\n", "n, d = map(int, input().split())\ns = list(map(int, input()))\ndp = [1000 for i in range(n)]\ndp[0] = 0\nfor i in range(1, n):\n if not(s[i]):\n continue\n for j in range(1, min(i, d) + 1):\n if s[i - j]:\n dp[i] = min(dp[i], dp[i - j] + 1)\nif dp[-1] < 1000:\n print(dp[-1])\nelse:\n print(-1)\n", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\ndef solve(n,d,s):\r\n ans=1\r\n jump=maxjump=d\r\n for i in range(1,n-1):\r\n if s[i]=='1':\r\n maxjump=max(maxjump,i+d)\r\n if jump==i:\r\n if maxjump==i:\r\n return -1\r\n ans+=1\r\n jump=maxjump\r\n return ans\r\n\r\nn,d=ris()\r\ns=rl()\r\nprint(solve(n,d,s))\r\n", "if __name__ == '__main__':\r\n n, d = list(map(int, input().strip().split()))\r\n s = str(input())\r\n INF = float(\"inf\")\r\n dp = [INF] * n; dp[0] = 0\r\n for i in range(n):\r\n if s[i] == \"0\":\r\n continue\r\n for j in range(i - d, i):\r\n if s[j] == \"0\":\r\n continue\r\n dp[i] = min(dp[i], dp[j] + 1)\r\n if dp[n - 1] == INF:\r\n print(-1)\r\n else:\r\n print(dp[n - 1])", "n,d=list(map(int,input().split()))\r\ninp=input()\r\nindex=0\r\ncount=0\r\nif '0'*d in inp:\r\n count=-1\r\nelse:\r\n while index<n-1:\r\n for j in range(d,0,-1):\r\n if index+j<n and inp[index+j]=='1':\r\n index+=j\r\n count+=1\r\n break\r\nprint(count)\r\n", "n, d = map(int, input().split())\r\ns = input()\r\n\r\ncoun = 0\r\ni = 0\r\nwhile i < n - 1:\r\n j = i + d\r\n \r\n while j < n and s[j] != \"1\" and j > i:\r\n j -= 1\r\n if j == i:\r\n coun = -1\r\n break\r\n i = j\r\n coun += 1\r\n\r\nprint(coun)", "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,d=lst()\r\n s=input()\r\n dp=[float('inf')]*n\r\n dp[0]=0\r\n for i in range(1,n):\r\n if s[i]=='0':continue\r\n for j in range(i-1,max(-1,i-d-1),-1):\r\n if s[j]=='1':dp[i]=min(1+dp[j],dp[i])\r\n # print(dp)\r\n print(dp[-1] if dp[-1]!=float('inf') else -1)", "# https://codeforces.com/problemset/problem/894/A\r\nn, d = [int(x) for x in input().split()]\r\ns = input()\r\nposition = 0\r\nsaut = 0\r\nboucle = True\r\nwhile(boucle and position!=n-1):\r\n boucle = False\r\n for x in range(d, 0, -1):\r\n if position+x > n-1:\r\n continue\r\n if s[position+x]==\"1\":\r\n position += x\r\n saut += 1\r\n boucle = True\r\n break\r\nif position==n-1:\r\n print(saut)\r\nelse:\r\n print(-1)\r\n", "def jump(n,d,s):\r\n\tstring=\"\"\r\n\tfor x in range(d):\r\n\t\tstring+=\"0\"\r\n\tfor i in range(len(s)-d):\r\n\t\tif s[i:i+d]==string:\r\n\t\t\treturn -1\r\n\tcount=0\r\n\tdist=1\r\n\ta=0\r\n\tr=1\r\n\twhile dist<len(s):\r\n\t\tif d+a<len(s):\r\n\t\t\tif int(s[d+a])==1:\r\n\t\t\t\tdist+=d\r\n\t\t\t\tcount+=1\r\n\t\t\t\ta+=d\r\n\t\t\t\t#if d+a-r<len(s):\r\n\t\t\telse:\r\n\t\t\t\twhile d-r>0:\r\n\t\t\t\t\tif int(s[d+a-r])==1:\r\n\t\t\t\t\t\tdist+=d-r\r\n\t\t\t\t\t\tcount+=1\r\n\t\t\t\t\t\ta+=d-r\r\n\t\t\t\t\t\tr=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tr+=1\r\n\t\t\t\t#else:\r\n\t\t\t\t#\twhile d+a-r>=len(s):\r\n\t\t\t\t#\t\tr+=1\r\n\t\telse:\r\n\t\t\ta-=1\t\r\n\treturn count\r\n\r\nif __name__==\"__main__\":\r\n\t[n,d]=[int(i) for i in input().split(\" \")]\r\n\ts=input()\r\n\tprint(jump(n,d,s))\r\n", "n,k=map(int,input().split())\r\ns=input()\r\nt=i=p=0\r\nwhile i<n:\r\n #print(i)\r\n if s[i]=='1':t+=1;p=i;i+=k\r\n else:\r\n while i!=p and s[i]=='0' or i>=n:i-=1\r\n if i==p:exit(print(-1))\r\nif p!=n-1:t+=1\r\nprint(t-1)", "n, d = map(int, input().split())\r\na = input()\r\nINF = 9999999999999\r\ndp = [INF] * n\r\ndp[0] = 0\r\nfor i in range(1, n):\r\n if a[i] == '1':\r\n for j in range(i - d, i):\r\n dp[i] = min(dp[i], dp[j] + 1)\r\nif dp[n - 1] == INF:\r\n dp[n - 1] = -1\r\nprint(dp[n - 1])\r\n", "# https://codeforces.com/problemset/problem/910/A\n\nn, d = list(map(int, input().split()))\n\narr = input()\n\ni, count = 0, 0\nwhile i < n - 1 and count < n:\n if arr[i] == '1':\n i += d\n count += 1\n else:\n i -= 1 # we move back since we have found a '0'\n\nprint(-1 if count >= n else count)\n", "n, d = map(int, input().split())\ns = input()\n\ndp = [float('inf')] * n\n\ndp[0] = 0\n\nfor i in range(1, n):\n if s[i] == '1':\n for j in range(i - 1, max(i - d - 1, -1), -1):\n dp[i] = min(dp[i], dp[j] + 1)\n\nif dp[n - 1] == float('inf'):\n print(-1)\nelse:\n print(dp[n - 1])\n\n\t \t\t\t \t\t \t\t \t \t\t\t\t\t \t \t\t", "n, d = list(map(int, input().split()))\ns = input()\ndp = [1000] * 105\ndp[0] = 0\nfor i in range(n):\n if (s[i] == '0'):\n continue\n for j in range(min(d + 1, i + 1)):\n if (s[i - j] == '1'):\n dp[i] = min(dp[i - j] + 1, dp[i])\n\nif (dp[n - 1] == 1000):\n print(-1)\nelse:\n print(dp[n - 1])\n", "n, d = map(int, input().split())\r\n# 0-There is no flower.\r\n# 1-There is a flower.\r\nis_flower = list(input())\r\n# dp[i] - minimalna liczba skoków aby osiągnąc punkt i.\r\n# na punkt i moge wskoczyć wtw. gdy is_flower[i]\r\nif is_flower[0] == \"0\":\r\n print(-1)\r\nelse:\r\n dp = [float(\"inf\") for _ in range(n)]\r\n dp[0] = 0\r\n for i in range(n - 1):\r\n for j in range(i + 1, min(i + d + 1, n)):\r\n if is_flower[j] == \"1\":\r\n dp[j] = min(dp[j], dp[i] + 1)\r\n if dp[n - 1] == float(\"inf\"):\r\n print(-1)\r\n else:\r\n print(dp[n - 1])", "n, d = map(int, input().split())\r\ns = {q + 1: int(i) for q, i in enumerate(input())}\r\nv = 1\r\nans = 0\r\nwhile v < n:\r\n k = 0\r\n for i in range(d, 0, -1):\r\n if i + v <= n:\r\n if s[i + v] == 1 and i + v != 1:\r\n k = i\r\n break\r\n if k == 0:\r\n print(-1)\r\n break\r\n else:\r\n ans += 1\r\n v += k\r\nelse:\r\n print(ans)", "x = input().split()\r\nn = int(x[0])\r\nd = int(x[1])\r\nnums = list(map(int,input()))\r\nmemo = {}\r\ndef dp(i):\r\n if i in memo:\r\n return memo[i]\r\n if i == n-1:\r\n memo[i] = 0\r\n return 0\r\n if i >= n:\r\n memo[i] = float(\"inf\")\r\n return float(\"inf\")\r\n mini = float(\"inf\")\r\n for j in range(i + 1, i + d + 1):\r\n if j < n and nums[j] != 0:\r\n mini = min(mini, dp(j)+1)\r\n memo[i] = mini\r\n return mini\r\nans = dp(0)\r\nif ans==float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(ans)", "n, d = map(int, input().split())\nok = [int(num) for num in list(input())]\n\ndp = [1000] * (n)\ndp[0] = 0\nfor i in range(n):\n for j in range(1, d+1):\n if i+j < n and ok[i+j]:\n dp[i+j] = min(dp[i]+1, dp[i+j])\nif dp[-1] == 1000:\n print(-1)\nelse:\n print(dp[-1])", "n,d=map(int,input().split())\r\ns=input()\r\n\r\ni=0\r\nj=0\r\n\r\nwhile i<n-1 and j<n:\r\n if s[i]==\"1\":\r\n i+=d\r\n j+=1\r\n else:\r\n i-=1\r\nif j>=n:\r\n print(-1)\r\nelse:\r\n print(j)", "n,d = map(int,input().split())\r\nt = input()\r\nk = 0\r\ni = 0\r\nwhile i < n:\r\n\tflag = 0\r\n\tif i+d >= n-1:\r\n\t\tk = k + 1\r\n\t\tbreak\r\n\tfor j in range(d,0,-1):\r\n\t\tif t[i+j] == \"1\":\r\n\t\t\tk = k + 1\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\tif flag == 0:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\ti = i + j\r\nprint(k)", "n,d=map(int,input().split())\r\ns=input()\r\ni=0\r\nans=0\r\nwhile i!=n-1:\r\n j=s[:i+d+1].rfind(\"1\")\r\n if j==i:\r\n ans=-1\r\n break\r\n else:\r\n i=j\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", "N,D = map(int,input().split())\r\nl = input()\r\n\r\ndp = [float('inf') for i in range(N)]\r\ndp[0] = 0\r\n\r\nfor i in range(1,N):\r\n\r\n if l[i] == '1':\r\n\r\n for j in range(i,max(i-D,0)-1,-1):\r\n\r\n if dp[j] != float('inf'):\r\n\r\n dp[i] = min(dp[i],dp[j]) + 1\r\n\r\n#print(dp)\r\n\r\nprint(dp[N-1] if dp[N-1] != float('inf') else -1)\r\n\r\n\r\n\r\n\r\n\r\n", "n,d = map(int,input().split())\r\npath = input()\r\n\r\ncount = 0\r\nx = 0\r\n\r\nwhile x!=(n-1):\r\n y = path[:x+d+1].rfind('1')\r\n if x == y:\r\n count = -1\r\n break\r\n else:\r\n count += 1\r\n x = y\r\n\r\nprint(count)", "length, jump = input().strip().split()\r\nplot = input()\r\nlength, jump = int(length), int(jump)\r\n\r\n\r\nn_jumps = 0\r\npos_index = 0\r\nwhile pos_index != length - 1:\r\n land_index = plot[pos_index: pos_index + jump + 1].rfind('1') + pos_index\r\n if land_index == pos_index:\r\n n_jumps = -1\r\n break\r\n pos_index = land_index\r\n n_jumps += 1\r\n\r\nprint (n_jumps)", "n,d = map(int,input().split())\r\ns = input()\r\ndp = [100000]*n\r\ndp[0] = 0\r\nfor i in range(n):\r\n if s[i] == '1':\r\n for j in range(max(0,i-d),i):\r\n dp[i] = min(dp[i],dp[j]+1)\r\nprint([-1,dp[n-1]][dp[n-1]!=100000])", "inp = input().split()\nn, d = int(inp[0]), int(inp[1])\n\ns = input()\nb = True\npos = 0\ncont = 0\nwhile(b and pos < n-1):\n pos+=d\n if(pos < n-1):\n if(s[pos]=='0'):\n c = True\n for i in range(pos, pos-d, -1):\n if(s[i]=='1'):\n pos = i\n c = False\n break\n if(c):\n b = False\n break\n cont+=1\n else:\n cont+=1\nif(not b):\n print(-1)\nelse:\n print(cont)\n", "def main():\r\n n, d = list(map(int, input().split()))\r\n string = input()\r\n\r\n current_pos = 0\r\n counter = 0\r\n while True:\r\n decided_pos = -1\r\n for i in range(current_pos + 1, min(n, current_pos + d + 1)):\r\n if string[i] == \"1\":\r\n decided_pos = i\r\n\r\n if decided_pos == -1:\r\n print(-1)\r\n return\r\n else:\r\n current_pos = decided_pos\r\n counter += 1\r\n\r\n if current_pos == n - 1:\r\n print(counter)\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "if __name__ == '__main__':\r\n n, d = [int(x) for x in input().split()]\r\n s = list(input())\r\n s = [int(x) for x in s]\r\n p = 0\r\n for i in range(len(s)):\r\n if s[i] == 1:\r\n s[i] = -1\r\n if s[i] == 0:\r\n s[i] = p\r\n else:\r\n p = i \r\n # print(s)\r\n i=0\r\n passo = 0\r\n while True:\r\n i +=d\r\n if i >= n-1:\r\n if s[n-1] == -1:\r\n passo+=1\r\n else:\r\n passo = -1\r\n break\r\n # print(\"***\")\r\n # print(passo)\r\n # print(i)\r\n # print(s[i])\r\n if s[i] == -1:\r\n passo +=1\r\n continue \r\n elif s[i] <= i-d:\r\n passo = -1\r\n break\r\n else:\r\n passo += 1\r\n i = s[i]\r\n continue\r\n \r\n print(passo)\r\n", "n,d = map(int,input().split())\r\ns = input()\r\nlst = {i:0 for i in range(n)}\r\nfor i in range(1,d+1):\r\n if s[i]=='1':\r\n lst[i]=1\r\nfor i in range(d+1,n):\r\n if s[i]=='1':\r\n mi=1000000\r\n for j in range(i-d,i):\r\n a = lst[j]\r\n if a>0:\r\n if a<mi:\r\n mi=a\r\n lst[i]=mi+1\r\nres=lst[n-1]\r\nif res==1000001:\r\n print(-1)\r\nelse:\r\n print(res)", "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,d = ei()\r\ns = input()\r\nif '0'*d in s:\r\n\tprint(-1)\r\nelse:\r\n\ti=ans=0\r\n\twhile i<n-1:\r\n\t\tif s[i] == '1':\r\n\t\t\ti += d \r\n\t\t\tans += 1\r\n\t\telse:\r\n\t\t\ti-=1\r\n\tprint(ans)", "n,d=map(int,input().split())\r\ns=input()\r\nif max(list(len(i) for i in s.split('1')))>=d:\r\n print(-1)\r\nelse:\r\n ans=0\r\n i=0\r\n while i<n-1:\r\n for j in range(min(n-1,i+d),i,-1):\r\n if s[j]=='1':\r\n ans+=1\r\n i=j\r\n break\r\n print(ans)\r\n", "def quantidade_tps(ponto, destino, limite, mapa, acumulado):\r\n if ponto+1 == destino:\r\n return acumulado\r\n for i in range(limite, 0, -1):\r\n if ponto + i < destino and mapa[ponto+i] == '1':\r\n return quantidade_tps(ponto+i, destino, limite, mapa, acumulado+1)\r\n return -1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n pontos = input().split(\" \")\r\n destino = int(pontos[0])\r\n limite = int(pontos[1])\r\n mapa = input()\r\n print(quantidade_tps(0, destino, limite, mapa, 0))\r\n", "\n\n\nn,d = map(int,input().split())\nst = input()\ndp = [101 for i in range(n)]\ndp[0] = 0\nfor i in range(1,n):\n if st[i]=='1':\n for j in range(i-1,-1,-1):\n if j<i-d:\n break\n else:\n if st[j]=='1' and dp[i]>dp[j]+1:\n dp[i] = dp[j]+1\n\nif dp[n-1]==101:\n print(-1)\nelse:\n print(dp[n-1])\n \n \n \n", "n,d=map(int,input().split())\r\ns=input()\r\nb=0\r\na=[]\r\nj=0\r\ncount=0\r\nfor i in s:\r\n if(i=='1'):\r\n a.append(b)\r\n b=b+1 \r\n\r\np=a[0] \r\nwhile(p!=a[len(a)-1]):\r\n if(p+d<a[j+1]):\r\n count=-1\r\n break\r\n if (p+d) in a:\r\n p=p+d \r\n count+=1 \r\n j=a.index(p)\r\n continue\r\n else:\r\n p=p-1\r\n \r\nprint(count) \r\n \r\n \r\n \r\n \r\n ", "n, d=map(int, input().split())\r\nl=list(map(int, input()))\r\ninf=1000\r\ndp=[inf]*n\r\ndp[0]=0\r\nfor i in range(n-1):\r\n for j in range(1, min(n-i, d+1)):\r\n if l[i+j]==1:\r\n dp[i+j]=min(dp[i+j], 1+dp[i])\r\nprint(-1 if dp[n-1]==inf else dp[n-1])\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = lambda: list(map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split()))\r\ntc=1\r\n#tc=int(input())\r\nfor _ in range(1,tc+1):\r\n n,k=inp()\r\n s=input()\r\n c=i=0\r\n flag=True\r\n while i<n-1:\r\n p=k\r\n while p:\r\n if i+p<n and s[i+p]==\"1\":\r\n i+=p\r\n break\r\n p-=1\r\n if p==0:\r\n flag=False\r\n print(-1)\r\n break\r\n c+=1\r\n \r\n if flag:\r\n print(c)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "def main():\r\n n, d = map(int, input().split())\r\n s = input()\r\n\r\n cur, jumps = 1, 0\r\n while cur < n:\r\n jumped = False\r\n for step in range(1, d + 1)[::-1]:\r\n if cur + step > n:\r\n continue\r\n if s[cur + step - 1] == '1':\r\n cur += step\r\n jumps += 1\r\n jumped = True\r\n break\r\n if not jumped:\r\n print(-1)\r\n return\r\n print(jumps)\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "n,d=map(int,input().split())\r\ns=input()\r\ni,j=0,0\r\nwhile(i<n-1 and j<n):\r\n if(s[i]=='1'):\r\n i=i+d\r\n j+=1\r\n else:\r\n i=i-1\r\nif(j>=n):\r\n print(-1)\r\nelse:\r\n print(j)\r\n", "import math as mt \r\nimport sys,string,bisect\r\ninput=sys.stdin.readline\r\nimport random\r\nfrom collections import deque,defaultdict\r\nL=lambda : list(map(int,input().split()))\r\nLs=lambda : list(input().split())\r\nM=lambda : map(int,input().split())\r\nI=lambda :int(input())\r\nd=defaultdict(list)\r\nn,d=M()\r\ns=input().strip()\r\ni=0\r\nc=0\r\nwhile(i!=n-1):\r\n rlimit=min(i+d,n-1)\r\n llimit=i+1\r\n k=rlimit\r\n f=0\r\n while(k>=llimit):\r\n if(s[k]=='1'):\r\n i=k\r\n c+=1\r\n f=1\r\n break\r\n else:\r\n k-=1\r\n if(f==0):\r\n print(-1)\r\n break\r\nif(f==1):\r\n print(c)\r\n", "n,d = [int(x) for x in input().split()]\r\ns=input()\r\nptr=d\r\njump=0\r\nflag=0\r\nfrog=0\r\nwhile flag==0 and frog!=n-1:\r\n\tc=0\r\n\twhile s[ptr]=='0':\r\n\t\tptr-=1\r\n\t\tc+=1\r\n\tif c==d:\r\n\t\tflag=1\r\n\t\tbreak\r\n\telse:\r\n\t\tjump+=1\r\n\t\tfrog=ptr\r\n\t\tif ptr+d<n:\r\n\t\t\tptr+=d\r\n\t\telse:\r\n\t\t\tptr=n-1\r\nif flag==1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(jump)", "l=list(map(int,input().split()))\r\nn,d=l[0],l[1]\r\ns=input()\r\ni=0\r\nans=-1\r\nc=0;f=0\r\nwhile i<n:\r\n if s[i]!='1':\r\n f=1;break\r\n j=1\r\n x=-1\r\n while (i+j<n) and j<=d:\r\n if s[i+j]=='1':\r\n x=i+j\r\n j+=1\r\n if x==-1:\r\n f=1;break\r\n i=x\r\n c+=1\r\n if i==(n-1):\r\n break\r\nif f==0:\r\n ans=c\r\nprint(ans)", "class Solution(object):\n def __init__(self):\n pass\n\n def sol(self, n, td, d, arr, dp):\n\n if n == 1 and td >= 0:\n return 0\n\n if td < 0 or n <= 0:\n return 1 << 15\n\n if (n, td) in dp:\n return dp[(n, td)]\n\n one = 1 << 15\n if arr[n - 1] == '1':\n one = self.sol(n - 1, d - 1, d, arr, dp) + 1\n one = min(one, self.sol(n - 1, td - 1, d, arr, dp))\n\n dp[(n, td)] = one\n return one\n\n\ndef main():\n p = [int(e) for e in input().split()]\n arr = input()\n sol = Solution()\n r = sol.sol(p[0], 0, p[1], arr, {})\n if r >= (1 << 15):\n print('-1')\n else:\n print(r)\n return 0\n\n\nif __name__ == '__main__':\n main()", "n,d = map(int,input().split())\nstr = input()\ndp = [50000]*n\ndp[0] = 0\nfor i in range(n):\n if str[i] == '1':\n for j in range(max(0,i-d),i):\n dp[i] = min(dp[i],dp[j]+1)\nprint([-1,dp[n-1]][dp[n-1]!=50000])\n\t \t\t\t\t \t \t \t \t \t\t\t \t\t\t", "def main():\n n, d = [int(num) for num in input().split()]\n path = list(input())\n\n index = 0\n jumpSize = d\n jumpCount = 0\n\n while True:\n if jumpSize == 0:\n print(-1)\n break\n\n if index + jumpSize > n - 1:\n jumpSize -= 1\n continue\n \n if path[index + jumpSize] == '0':\n jumpSize -= 1\n continue\n\n if path[index + jumpSize] == '1':\n jumpCount += 1\n index += jumpSize\n jumpSize = d\n\n if index == n - 1:\n print(jumpCount)\n break\n\nmain()\n\t\t \t\t\t \t \t\t \t \t\t\t\t\t\t\t \t\t\t\t \t", "n,d = map(int,input().split())\r\nx = input()\r\ni = 1\r\ncount = 0\r\nwhile i < n :\r\n for j in range(d,0,-1):\r\n if x[min(i+j-1,n-1)] == \"1\":\r\n i += j\r\n count += 1\r\n break\r\n else:\r\n print(-1)\r\n break\r\nif i >= n-1:\r\n print(count)\r\n", "def f(n, maxJump, s):\r\n pos = 1\r\n steps = 0\r\n while True:\r\n if n - pos <= maxJump:\r\n return steps + 1\r\n for i in range(maxJump, 0, -1):\r\n if s[pos + i] == '1':\r\n pos += i\r\n steps += 1\r\n break\r\n elif i == 1:\r\n return -1\r\n\r\n\r\nn, maxJump = map(int, input().split())\r\ns = ' ' + input()\r\n\r\nprint(f(n, maxJump, s))\r\n", "def solve():\r\n\tn, d = map(int, input().split())\r\n\tn -= 1\r\n\ts = input()\r\n\r\n\ti = 0\r\n\tres = 0\r\n\twhile (i < len(s)):\r\n\t\tr = min(len(s)-1,i+d)\r\n\t\tfor j in range(r,i,-1):\r\n\t\t\tif (s[j] == '1'):\r\n\t\t\t\ti = j\r\n\t\t\t\tres += 1\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tprint(-1)\r\n\t\t\treturn\r\n\t\tif (i == n):\r\n\t\t\tprint(res)\r\n\t\t\treturn\r\n\r\nsolve()\r\n\r\n", "def main():\n\tn, d = list(int(x) for x in input().split())\n\tn -= 1\n\tlilies = list(int(x) for x in list(input()))\n\n\tpos = 0\n\tjumps_counter = 0\n\twhile(pos < n):\n\t\tpos = next_jump(lilies, pos, d, n)\n\t\tjumps_counter +=1\n\n\t\tif pos == -1:\n\t\t\tprint(\"-1\")\n\t\t\treturn\n\n\tprint(jumps_counter)\n\treturn\n\n\ndef next_jump(lilies, pos, d, n):\n\tif pos+d >= n:\n\t\treturn n\n\n\tpossible_jump_pos = -1\n\tfor i in range(1, d+1):\n\t\tif lilies[pos+i] == 1:\n\t\t\tpossible_jump_pos = pos+i\n\n\treturn possible_jump_pos\n\n\nif __name__ == \"__main__\":\n\tmain()\n\t\t \t\t\t\t\t\t \t\t \t\t\t \t \t \t \t \t", "def min_teleports(n, d, map):\n min_teleports = [float('inf')] * n\n min_teleports[0] = 0 \n\n for i in range(1, n):\n if map[i] == '1':\n for j in range(1, d + 1):\n if i - j >= 0:\n min_teleports[i] = min(min_teleports[i], min_teleports[i - j] + 1)\n\n if min_teleports[n - 1] == float('inf'):\n return -1\n else:\n return min_teleports[n - 1]\n\nn, d = map(int, input().split())\nmap = input()\n\nresult = min_teleports(n, d, map)\nprint(result)\n\n\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\nimport heapq\r\nimport itertools\r\nfrom sys import stdin,stdout\r\nfrom math import gcd,floor,sqrt,log\r\nfrom collections import defaultdict, Counter, deque\r\nfrom bisect import bisect_left,bisect_right, insort_left, insort_right\r\n\r\nmod=1000000007\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\n\r\n\r\ndef solve():\r\n n, d = get_ints()\r\n path = get_string()\r\n \r\n dp = [float('inf') for i in range(n)]\r\n dp[-1] = 0\r\n \r\n for i in range(n-2, -1, -1):\r\n for j in range(i + 1, min(i + d + 1, n)):\r\n \r\n if path[j] == '1':\r\n dp[i] = min(dp[i], dp[j] + 1)\r\n \r\n return dp[0] if dp[0] != float('inf') else -1\r\n\r\n \r\n#main code\r\nif __name__ == \"__main__\":\r\n print(solve())", "n, d = map(int, input().split())\r\ns = input()\r\n\r\ndp = [float('inf')] * n\r\ndp[0] = 0\r\n\r\nfor i in range(1, n):\r\n min_j = float('inf')\r\n\r\n if s[i] == \"1\":\r\n for j in range(1, d + 1):\r\n if i - j >= 0 and dp[i - j] != -1 and dp[i - j] < min_j:\r\n min_j = dp[i - j]\r\n dp[i] = min_j + 1\r\n\r\nif dp[-1] == float('inf'):\r\n print(-1)\r\nelse:\r\n print(dp[-1])", "#def split(word): \n # return [char for char in word] \n \nn, d = map(int,input().split())\n\nword = str(input())\nposs = 0\ncont = 0\nxx = list([int(d) for d in str(word)])\nfor j in range(d):\n xx.append(0)\nif d > n:\n print(1)\nelse:\n while poss <= n-1:\n if poss >= n-1 or cont == -1:\n break\n elif poss + d >= n-1:\n cont = cont + 1\n break\n else:\n for i in range ( d,-1,-1):\n if i == 0:\n cont = -1 \n break\n elif xx[poss + i] == 1 :\n poss = poss + i\n cont = cont + 1\n break\n else:\n continue\n \n \n \n \nprint(cont)\n\t \t\t\t \t \t \t\t \t \t \t\t\t\t\t\t \t", "n, d = map(int, input().split())\ns = list(input().strip())\njumps = 0\ni = 0\nwhile i < n - 1:\n j = min(i + d, n - 1)\n while s[j] != '1':\n j -= 1\n jumps += 1\n if i == j:\n print(-1)\n import sys\n sys.exit(0)\n i = j\nprint(jumps)\n", "n, m = map(int, input().split())\r\ns = (input())\r\nif \"0\" * m in s:\r\n print(-1)\r\nelse:\r\n i = 0\r\n jumps = 0\r\n while(i < n-1):\r\n if(s[i] =='1'):\r\n i+=m\r\n jumps += 1\r\n else:\r\n i = i-1\r\n \r\n print(jumps)\r\n \r\n \r\n", "a = input().split()\nn = int(a[0])\nd = int(a[1])\n\nstr = input()\nlist_str = list(str)\nstart = 0\nans = 0\nf = True\n\nwhile start < n:\n curr = start + d\n if curr >= n-1:\n ans = ans + 1 \n break\n while list_str[curr]=='0':\n curr = curr - 1 \n if curr <= start:\n print('-1')\n f = False\n break\n if f==False:\n break\n start = curr\n ans = ans + 1 \n\nif f==True:\n print(ans)", "n, d = map(int, input().split())\r\ns = input()\r\ni = 0\r\n\r\nr = 0\r\nwhile i != len(s)-1:\r\n j = i + 1\r\n i_next = i\r\n have_move = False\r\n while j < len(s) and j < i + d + 1:\r\n if s[j] == '1':\r\n i_next = j\r\n have_move = True\r\n j += 1\r\n if not have_move:\r\n print(-1)\r\n break\r\n else:\r\n r += 1\r\n i = i_next\r\nelse:\r\n print(r)\r\n", "n, d = list(map(int, input().split()))\ns = input()\n\ncount = 0\ni = 0\nwhile(i < n):\n countStart = count\n for _d in range(d, 0, -1):\n if i+_d < n and s[i+_d] == '1':\n i += _d\n count += 1\n break\n if countStart == count: \n count = -1\n break\n if i == n-1: break\n \nprint(count)\n \n\n\n\n\t \t \t\t \t\t \t\t \t", "# Time Complexity: O(n)\n# Space Complexity: O(n)\n# The solution iterates through the s array while keeping track of the closest\n# lily pad and the number of jumps in O(n)\nn, d = map(int, input().split())\ns = [int(x) for x in input().strip()]\nclosest = [-1] * n\nclosest[0] = 0\nfurthest = 0\njump = 1\n\nfor i in range(1, n):\n # Skip if not lily pad\n if s[i] == 0:\n closest[i] = closest[i-1]\n continue\n\n # Continue if the furthest is still within d\n if i - furthest <= d:\n closest[i] = i\n # Jump if the closest is still within d\n elif i - closest[i-1] <= d:\n closest[i] = i\n furthest = closest[i-1]\n jump += 1\n # Too far\n else:\n break\n\nif closest[n-1] == -1:\n print(-1)\nelse:\n print(jump)\n \t\t \t \t\t\t \t \t \t\t \t \t\t \t \t", "n, d = map(int, input().split())\ncaminho = input().strip()\nlista = [-1] * 105\nlista[0] = 0\n\nfor i in range(n - 1):\n if lista[i] != -1:\n temp = i + 1\n while temp < n and temp <= d + i:\n if caminho[temp] == '1':\n if lista[temp] == -1:\n lista[temp] = lista[i] + 1\n else: \n lista[temp] = min(lista[temp], lista[i] + 1)\n \n temp += 1\nprint(lista[n - 1]) \n \t \t \t \t \t \t\t \t\t\t\t \t\t", "# JAI SHREE RAM\r\n\r\nimport math; from collections import *\r\nimport sys; from functools import reduce\r\n\r\ndef get_ints(): return map(int, input().strip().split())\r\ndef get_list(): return list(get_ints())\r\ndef getlistofstring(): return list(input().strip().split())\r\ndef printxsp(*args): return print(*args, end=\"\")\r\ndef printsp(*args): return print(*args, end=\" \")\r\n\r\nUGLYMOD = int(1e9)+7; SEXYMOD = 998244353; MAXN = int(1e5)\r\n\r\n# sys.setrecursionlimit(10**6)\r\n# sys.stdin=open(\"input.txt\",\"r\");sys.stdout=open(\"output.txt\",\"w\")\r\n\r\n# for _testcases_ in range(int(input())):\r\nn, k = get_ints()\r\ns = input()\r\nans = pos = 0\r\nwhile pos < n-1:\r\n temp = pos\r\n for i in range(1, k+1):\r\n try:\r\n if s[pos+i] == '1':\r\n temp = pos + i\r\n except:\r\n break\r\n if temp == pos:\r\n ans = -1\r\n break\r\n pos = temp\r\n ans += 1\r\n\r\nprint(ans)\r\n'''\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\nTHE LOGIC AND APPROACH IS MINE @luctivud ( UDIT GUPTA )\r\nLink may be copy-pasted here if it's taken from other source.\r\nDO NOT PLAGIARISE.\r\n>>> COMMENT THE STDIN!! CHANGE ONLINE JUDGE !!\r\n'''", "n, k = map(int, input().split()) \r\n\r\ns = '@' + input()\r\ndp = [1e17]*(n+10)\r\ndp[1] = 0\r\nfor i in range(2,n+1):\r\n\tfor j in range(1,i):\r\n\t\tif s[j]=='1' and i-j<=k: dp[i] = min(dp[i], dp[j] + 1)\r\n\r\nprint(dp[n] if dp[n]<1e17 else -1)", "n,d = [int(i) for i in input().split()]\r\ns = input()\r\ni = 0\r\nt = 0\r\nf = 1\r\nwhile i < n-1 and f == 1:\r\n\tf = 0\r\n\tk = i+d\r\n\tif k >= n :\r\n\t\tk = n-1\r\n\tfor j in range(k,i,-1):\r\n\t\tif s[j] == '1':\r\n\t\t\t#print(j)\r\n\t\t\tf = 1\r\n\t\t\ti = j\r\n\t\t\tt = t+1\r\n\t\t\tbreak\r\nif f == 0 :\r\n\tprint(-1)\r\nelse:\r\n\tprint(t)", "n , d =map(int, input().split())\r\ns= str(input())\r\nans = -1\r\ni=1\r\ncount = 0\r\nwhile i<len(s):\r\n temp = s[i:i+d]\r\n if '1' in temp:\r\n x = temp.rfind('1')\r\n i = i+ x +1\r\n count = count +1\r\n else:\r\n print(ans)\r\n count=0\r\n break\r\n\r\nif count!=0:\r\n print(count)", "n, d = map(int, input().split())\r\n\r\nstrng = input()\r\nz_count = 0\r\nz_jump = 0\r\nfl = 0\r\n\r\nif strng[0] != '1' or strng[n - 1] != '1':\r\n print(-1)\r\n\r\nelse:\r\n for i in range(n):\r\n if strng[i] == \"0\":\r\n fl += 1\r\n if fl >= d:\r\n print(-1)\r\n break\r\n else:\r\n fl = 0\r\n else:\r\n while z_jump < n - 1:\r\n if len(strng[z_jump:]) <= d:\r\n z_count += 1\r\n break\r\n else:\r\n if strng[d + z_jump] == \"1\":\r\n z_jump += d\r\n z_count += 1\r\n else:\r\n for j in range(d + z_jump, z_jump, -1):\r\n if strng[j] == \"1\":\r\n z_jump = j\r\n z_count += 1\r\n break\r\n\r\n print(z_count)\r\n", "def get_line():\r\n\tl=[]\r\n\tl=input().split()\r\n\treturn l\r\ndef to_integer(liste):\r\n\tl=liste\r\n\tfor i in range(len(l)):\r\n\t\tl[i]=int(l[i]);\r\n\treturn l\r\ndef affiche(l):\r\n\tfor i in range(len(l)):\r\n\t\tprint(l[i])\r\nl=get_line()\r\nn=int(l[0])\r\nd=int(l[1])\r\ns=input()\r\npos=0\r\nlili=True;\r\nespoir=True;\r\ni=1\r\nnb_move=0\r\nwhile pos<len(s) and lili and espoir :\r\n\t# print(\"pos=\",pos)\r\n\tlili=False;\r\n\ti= pos+1\r\n\twhile i<= min(d+pos,len(s)-1) :\r\n\t\t# print(i)\r\n\t\tif s[i] == \"1\" :\r\n\t\t\tlili=True;\r\n\t\t\tpos_lili=i\r\n\t\t\ti=i+1\r\n\t\telse:\r\n\t\t\ti+=1;\r\n\t# print(\"pos_lili=\",pos_lili)\r\n\tif lili :\r\n\t\t# print(\"i entered\")\r\n\t\tif pos_lili-pos <= d :\r\n\t\t\tpos= pos_lili\r\n\t\t\tnb_move+=1;\r\n\t\telse:\r\n\t\t\tespoir = False;\r\nif pos==len(s)-1 :\r\n\tprint(nb_move)\r\nelse:\r\n\tprint(-1)\r\n\t\t\t", "a,b = map(int,input().split())\r\nz = input()\r\ni,q=0,0\r\nwhile i<(a-1):\r\n\tx = z[i+1:i+b+1]\r\n\tw = x[::-1]\r\n\tif \"1\" in w:q+=1;i+=(b)-w.index(\"1\")\r\n\telse:q=-1;break\r\nprint(q)", "from sys import stdin,stdout\r\nfrom math import gcd,sqrt,factorial\r\nfrom collections import deque,defaultdict\r\ninput=stdin.readline\r\nR=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nS=lambda:input().rstrip('\\n')\r\nL=lambda:list(R())\r\nP=lambda x:stdout.write(x)\r\nlcm=lambda x,y:(x*y)//gcd(x,y)\r\nhg=lambda x,y:((y+x-1)//x)*x\r\npw=lambda x:0 if x==1 else 1+pw(x//2)\r\nchk=lambda x:chk(x//2) if not x%2 else True if x==1 else False\r\nsm=lambda x:(x**2+x)//2\r\nN=10**9+7\r\n\r\nn,d=R()\r\ncnt=0\r\nx=y=0\r\na=S()\r\nfor i in range(n):\r\n\tif a[i]=='1':\r\n\t\ty=i\r\n\tif i-x==d:\r\n\t\tx=y\r\n\t\tcnt+=1\r\nif y-x<=d and y==n-1:print(cnt if x==y else cnt+1)\r\nelse:print(-1)", "a = list(map(int,(input().split())))\r\nb = input()\r\nb = list(b)\r\nc = a[1]\r\nd = 0\r\nwhile True:\r\n if c < len(b):\r\n if b[c] != '1':\r\n c -= 1\r\n if c == 0:\r\n print(-1)\r\n break\r\n if c < len(b):\r\n if b[c] == '1':\r\n b = b[c::]\r\n d += 1\r\n c = a[1]\r\n else:\r\n if b[-1] == '1' and len(b) == 1:\r\n print(d)\r\n break\r\n elif b[-1] == '1':\r\n print(d+1)\r\n break\r\n else:\r\n print(-1)\r\n break", "# Anuneet Anand\n\nn,d = map(int,input().split())\ns = input()\nc = 0\ni = 0\nwhile i<n:\n\tc = c + 1\n\tj = i\n\ti = min(i + d,n-1)\n\tif i==n-1:\n\t\tbreak\n\n\twhile s[i]==\"0\":\n\t\ti = i - 1\n\tif i==j:\n\t\tc = -1\n\t\tbreak\nprint(c)", "n,d=map(int,input().split())\r\nss=input()\r\na=[0]*n\r\na[-1]=1\r\nfor i in range(n-2,-1,-1):\r\n if ss[i]=='1':\r\n if n-i-1<=d:\r\n a[i]=1\r\n else:\r\n l=100000000000000000\r\n j=i+1\r\n while j<=i+d and j<n:\r\n if a[j]!=-1:\r\n l=min(l,a[j])\r\n j+=1\r\n if l==100000000000000000:\r\n a[i]=-1\r\n else:\r\n a[i]=l+1\r\n else:\r\n a[i]=-1\r\nprint(a[0])", "n,m = map(int,input().split())\r\ns = input()\r\nst = 0\r\nans = 0\r\nwhile st<n-1:\r\n for j in range(min(n-1,st+m),st,-1):\r\n if s[j]=='1':\r\n st = j\r\n ans+=1\r\n break\r\n else:\r\n print(\"-1\")\r\n break;\r\nelse:\r\n print(ans)", "#https://codeforces.com/problemset/problem/910/A\nn,d=map(int,input().split())\ns=input()\ni=0\nc=0\nf=0\nwhile i <n:\n\tj=min(i+d,n-1)\n\t#print(i)\n\tf1=0\n\twhile j>i:\n\t\tif s[j]=='1':\n\t\t\tf1=1\n\t\t\tbreak\n\t\tj-=1\n\tc+=1\n\t\n\tif f1 and j==n-1:\n\t\tbreak\n\tif i==j:\n\t\tf=1\n\t\tbreak\n\ti=j\n\t\nif f:\n\tprint(-1)\nelse:\n\tprint(c)\n", "from collections import defaultdict\nfrom collections import deque\nimport sys, threading\n\n\ndef main():\n n,d = map(int, input().split())\n\n line = input()\n \n que = deque([0])\n \n visited = set()\n level = 0\n while que:\n for __ in range(len(que)):\n\n cur = que.popleft()\n if cur == n - 1:\n return print(level)\n\n for i in range(1, d + 1):\n if cur + i < len(line) and line[cur + i] == \"1\" and (cur + i) not in visited:\n visited.add(cur + i)\n que.append(cur + i)\n level += 1 \n print(-1)\nmain()\n", "w=str(input()).split()\r\nn=int(w[0])\r\nd=int(w[1])\r\nways=str(input())\r\ndef num(lis, j):\r\n\tif j*str(0) in lis:\r\n\t\treturn -1\r\n\telse:\r\n\t\tif len(lis)<=j+1:\r\n\t\t\treturn 1\r\n\t\telse:\r\n\t\t\tind=len(lis)+lis[len(lis)-1-j:].find(\"1\")-j-1\r\n\t\t\treturn num(lis[:ind+1], j)+1\r\ncara=num(ways, d)\r\nprint(cara)", "n, d = list(map(int, input().split()))\r\ns = input()\r\n\r\nlilies = [i + 1 for i in range(n) if s[i] == \"1\"]\r\n\r\nimpossible = False\r\nstart = 1\r\ncount = 0\r\nwhile True:\r\n count += 1\r\n jump = max([lily for lily in lilies if lily <= start + d])\r\n\r\n if jump == start:\r\n print(-1)\r\n break\r\n \r\n if jump == n:\r\n print(count)\r\n break\r\n\r\n start = jump", "s = input().split()\r\nn, d = int(s[0]), int(s[1])\r\ns = input()\r\nans = 0\r\nlagyha = 0\r\nwhile lagyha < n - 1:\r\n jump = min(d, n - lagyha - 1)\r\n while s[lagyha + jump] != '1':\r\n jump -= 1\r\n if jump < 1:\r\n print(-1)\r\n quit()\r\n lagyha += jump\r\n ans += 1\r\nprint(ans)", "def min_teleportes(n, d, mapa):\n min_tps = [float('inf')] * n\n min_tps[0] = 0\n\n for i in range(1, n):\n for j in range(i - 1, max(i - d - 1, -1), -1):\n if mapa[i] == '1' and min_tps[j] != float('inf'):\n min_tps[i] = min(min_tps[i], min_tps[j] + 1)\n\n return min_tps[n - 1] if min_tps[n - 1] != float('inf') else -1\n\nn, d = map(int, input().split())\nmapa = input().strip()\n\nresultado = min_teleportes(n, d, mapa)\nprint(resultado)\n\n \t \t \t\t \t\t\t \t\t\t\t\t\t\t\t\t\t\t \t", "n, d = [int(x) for x in input().split()]\ns = input()\nlilies = []\nfor i in range(n):\n if s[i] == \"1\":\n lilies.append(i + 1)\nstep = 0\ncurrent = 1\nfor i, lily in enumerate(lilies):\n if lily - current > d:\n step = -1\n elif lily == current:\n continue\n else:\n # See if there is another lily in front the frog can jump to\n if i < len(lilies) - 1 and lilies[i + 1] - current <= d:\n continue\n step += 1\n current = lily\n # print(f\"frog is currently at position {current} after {step} step\")\nprint(step)\n\n\t\t \t \t\t\t \t \t \t\t\t\t \t\t\t\t \t \t", "n, d = map(int, input().split())\r\na = input()\r\nr = 0\r\nstart = len(a) - 1\r\nwhile start > 0:\r\n y = a[start - d:].find('1')\r\n\r\n if start == start - d + y:\r\n r = -1\r\n break\r\n else:\r\n start = start - d + y\r\n r += 1\r\n\r\nprint(r)", "entrada=input().split()\nn=int(entrada[0])\nd=int(entrada[1])\npath=input()\npos=0\ncount=0\nwhile pos!=n-1:\n count+=1\n aux_pos=pos+d\n if aux_pos>=n-1:\n print(count)\n break\n else:\n for i in range(aux_pos,pos-1,-1):\n if path[i]=='1':\n aux_pos=i\n break\n if aux_pos==pos:\n print(-1)\n break\n else:\n pos=aux_pos\n \n\t\t \t \t\t \t\t\t\t\t\t \t \t \t \t\t", "(n,d)=map(int, input().split())\r\n\r\ns=input()\r\n\r\ndef func(i,d,s,n):\r\n for k in range(min(i+d,n-1),i,-1):\r\n if s[k]=='1':\r\n return k\r\n \r\n return -1\r\n \r\ncount=0\r\ni=0\r\nwhile i<n-1:\r\n x=func(i,d,s,n)\r\n if x==-1:\r\n count=-1\r\n break\r\n \r\n else:\r\n i=x\r\n count+=1\r\n \r\nprint(count)", "n,k=map(int,input().split())\r\ns=input()\r\nif k>=n:print(1)\r\nelse:\r\n\tx,f,c=0,0,0\r\n\twhile x<n-1:\r\n\t\ta=s[x:x+k+1]\r\n\t\tif \"1\" not in a[1:]:\r\n\t\t\tf=1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tc+=1\r\n\t\t\tx+=a.rindex(\"1\")\r\n\tprint([c,-1][f==1])\r\n", "import sys,random,bisect\r\nfrom collections import deque,defaultdict\r\nfrom heapq import heapify,heappop,heappush\r\nfrom itertools import permutations\r\nfrom math import gcd,log\r\nmod = int(1e9 + 7)\r\ninf = int(1e20)\r\ninput = lambda :sys.stdin.readline().rstrip()\r\nmi = lambda :map(int,input().split())\r\nli = lambda :list(mi())\r\n\r\nn,d=li()\r\n\r\ns=input()\r\nf=[inf]*n\r\nf[0]=0\r\nfor i in range(n):\r\n if s[i]==\"1\":\r\n for j in range(i+1,i+d+1):\r\n if j>=n:\r\n break\r\n f[j]=min(f[j],f[i]+1)\r\nif f[-1]==inf:\r\n print(-1)\r\nelse:\r\n print(f[-1])\r\n\r\n\r\n\r\n", "import sys\r\n[n,d] = [int(x) for x in input().split()]\r\n\r\ns = input()\r\nlily = list(map(int,s))\r\nlily.extend([1]*d)\r\nstep = 0\r\nfrog = 0\r\n\r\nwhile frog < n - 1:\r\n\tfor i in range(d,0,-1):\r\n\t\tif lily[frog + i] == 1:\r\n\t\t\tstep += 1\r\n\t\t\tfrog += i\r\n\t\t\tbreak\r\n\t\telif i == 1:\r\n\t\t\tprint(-1)\r\n\t\t\tsys.exit(0)\r\n\r\nprint(step)", "import sys\n\ntry:\n sys.stdin = open(filename)\nexcept:\n pass\n\ninput = lambda : sys.stdin.readline().strip()\nprint = lambda s, end='\\n': sys.stdout.write(str(s) + end)\n\nn, d = map(int, input().split())\ns = input()\nl = 0\ncount = 0\nwhile l != n-1:\n for i in range(l+d, l, -1):\n if i > n-1:\n continue\n if s[i] == '1':\n l = i\n count += 1\n break\n else:\n print(-1)\n break\nelse:\n print(count)\n\n", "\"\"\"\nSummary of Code:\n- for each position, store minimum number of step required to get there\n- If the last position has number smaller than infinity,\n then it is reachable\nTime Complexity:\n- total => O(N * D)\n\nSpace Complexity:\n- total => O(N)\n\nWhy the chosen algorithm are good:\n- the time complexity is smaller than O(N^2) and N is 100 maximum\n\"\"\"\nn,d = [int(i) for i in input().split()]\ns = input()\nms = [float(\"inf\")] * n\nms[0] = 0\nfor i in range(n):\n for step in range(1,d+1):\n if i+step < n and s[i+step] == \"1\":\n ms[i+step] = min(ms[i+step], ms[i] + 1)\nprint(ms[-1] if ms[-1] != float(\"inf\") else -1)\n \t \t \t \t\t \t \t\t \t \t\t\t \t", "n, d = map(int, input().split())\r\nn -= 1\r\ns = input()\r\nans = 0\r\nwhile n != 0:\r\n\tans += 1\r\n\ttest = False\r\n\tfor j in range(d):\r\n\t\tif n - (d - j) >= 0 and s[n - (d - j)] == '1':\r\n\t\t\tn -= (d - j)\r\n\t\t\ttest = True\r\n\t\t\tbreak\r\n\tif not test:\r\n\t\tprint(-1)\r\n\t\texit(0)\r\nprint(ans)", "def way_home():\n n, d = list(map(int,input().split()))\n path = input()\n\n casa = len(path)-1\n chegou = False\n atual = 0\n min_jumps = 0\n\n while(not chegou):\n min_jumps += 1\n if(atual+d>=casa):\n chegou=True\n for count, p in enumerate(path[atual+d:atual:-1]):\n if(p=='1'):\n atual += d-count\n break\n if(count==d-1 and p=='0'):\n print(-1)\n return\n print(min_jumps)\n\nway_home()\n\n\n\t \t\t\t\t\t \t \t \t\t\t \t \t", "from sys import stdin, stdout\ninput = stdin.readline\nprint = stdout.write\nn, d = map(int, input().split())\ns = input()\nvisited, queue, c, t = [False] * n, [0], 1, []\nwhile True:\n for i in queue:\n for j in range(i + 1, min(i + d + 1, n)):\n if not visited[j] and s[j] == '1':\n if j + 1 == n:\n print(str(c))\n exit()\n t += j,\n visited[j] = 1\n if t:\n queue = t\n t = []\n c += 1\n else:\n print(str(-1))\n exit()", "n,d = map(int,input().split())\r\na = input()\r\ni = 0\r\nc = 0 \r\nif '0'*d in a:\r\n\tc = -1\r\nelse:\r\n\twhile True:\r\n\t\tif i>=n-1:\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tfor j in range(d,0,-1):\r\n\t\t\t\tif i+j<n and a[i+j]=='1':\r\n\t\t\t\t\ti += j\r\n\t\t\t\t\tc += 1\r\n\t\t\t\t\tbreak\r\nprint(c)", "n,d=list(map(int,input().split()))\nroad=input()\nk=[]\nfor i in range(n):\n if road[i]=='1':\n k.append(int(i))\nmaxr=[]\nfor i in range(len(k)-1):\n maxr.append(k[i+1]-k[i])\nif max(maxr)>d:\n print(-1)\nelse:\n o=0\n l=0\n for j in range(n):\n if l==max(k):\n break\n for i in range(d):\n if l+d-i in k:\n l+=d-i\n o+=1\n break\n print(o)\n \t\t \t\t\t \t\t\t \t\t\t\t\t \t\t\t\t", "n, d = map(int, input().split())\r\ns = input()\r\nl = 0\r\nk = 0\r\nwhile l < n - 1:\r\n for i in range(d, 0, -1):\r\n if l + i < n and s[l+i] == '1':\r\n k += 1\r\n l += i\r\n break\r\n else:\r\n k = -1\r\n break\r\nprint(k)\r\n", "n, d = [int(i) for i in input().split()]\r\ns = input()\r\nlagyha_now = 0\r\nans = 0\r\nwhile lagyha_now < n - 1:\r\n jump = min(d, n - lagyha_now - 1)\r\n while s[lagyha_now + jump] != '1':\r\n jump -= 1\r\n if jump < 1:\r\n print(-1)\r\n quit()\r\n lagyha_now += jump\r\n ans += 1\r\nprint(ans)", "n , j = map(int, input().split())\r\ns = input()\r\nc = 0\r\nind = 0\r\nf = 1\r\nwhile ind != n-1:\r\n\ti = ind\r\n\tx = ind\r\n\t# ~ print(\"ind\", ind)\r\n\twhile i+j > ind:\r\n\t\t# ~ print(i+j)\r\n\t\tif i+j < n:\r\n\t\t\tif s[i+j] == \"1\":\r\n\t\t\t\tind = i+j\r\n\t\t\t\tc += 1\r\n\t\t\t\tbreak\r\n\t\ti -= 1\r\n\tif x == ind:\r\n\t\tf = 0\r\n\t\tbreak\r\nprint(c if c and f else -1)\r\n\"\"\"\r\n100 1\r\n1111111111111111011111111111111111111111111111111111111111111111111101111111111111111111111111111111\r\n\"\"\"\r\n", "novo_n, novo_d = map(int, input().split())\nnovo_mapa = input()\nposicao_atual = 0\ncontador = 0\n\nwhile posicao_atual != novo_n - 1:\n subconjunto = novo_mapa[slice(posicao_atual, posicao_atual + novo_d + 1)]\n j = len(subconjunto) - 1\n verificar = True\n \n while verificar:\n if j == 0:\n print(-1)\n exit()\n if subconjunto[j] == \"1\":\n posicao_atual += j\n contador += 1\n verificar = False\n j -= 1\n\nprint(contador)\n \t \t \t\t\t\t \t \t\t \t \t\t \t\t\t", "a,b = map(int,input().split())\r\ns = input()\r\nres = b*\"0\" \r\nif res in s:\r\n print(-1)\r\nelse:\r\n i = 0\r\n j = 0\r\n while i<len(s)-1 and j<a:\r\n if s[i]==\"1\":\r\n i+=b\r\n j+=1\r\n else:\r\n i-=1\r\n print(j)", "l=list(map(int,input().split()))\r\nn=input()\r\nl1=[]\r\nd={}\r\np=[]\r\nfor i in range(len(n)):\r\n if n[i]=='1':\r\n l1.append(i)\r\nfor i in range(len(l1)-1):\r\n if l1[i+1]-l1[i]>l[-1]:\r\n print(-1)\r\n exit()\r\nfor i in l1:\r\n p=[]\r\n for j in range(1,l[-1]+1):\r\n if i+j<len(n) and n[i+j]=='1':\r\n p.append(i+j)\r\n d[i]=p\r\nx=0\r\n\r\ncount=0\r\ni=0\r\nwhile x==0:\r\n i=list(d.get(i))\r\n if l[0]-1 in i:\r\n break\r\n else:\r\n count+=1\r\n i=max(i)\r\nprint(count+1)\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ndef distance(n, m, str):\r\n \"\"\"Calculates the distance to travel from the start to the end of the string,\r\n given the maximum number of steps allowed.\"\"\"\r\n\r\n dist = [10000] * n\r\n dist[0] = 0\r\n\r\n for i in range(n):\r\n if str[i] == '1':\r\n for j in range(min(m + 1, n - i)):\r\n if str[i + j] == '1':\r\n dist[i + j] = min(dist[i + j], dist[i] + 1)\r\n\r\n return dist[n - 1] if dist[n - 1] != 10000 else -1\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n str = input()\r\n\r\n dist = distance(n, m, str)\r\n\r\n if dist == -1:\r\n print(-1)\r\n else:\r\n print(dist)\r\n", "n, d = map(int, input().split())\ns = input()\njumps = [float('inf')]*n\njumps[0] = 0\n\nfor i in range(1, n):\n if s[i] == '0':\n continue\n for j in range(max(0, i - d), i):\n jumps[i] = min(jumps[i], jumps[j] + 1)\n\nif jumps[n - 1] == float('inf'):\n print(-1)\nelse:\n print(jumps[n-1])\n\n \t\t\t\t\t \t\t \t \t\t \t\t \t \t\t \t\t", "n, d = map(int, input().split())\r\ns = input()\r\nINF = float(\"inf\")\r\ndp = [INF] * n\r\ndp[0] = 0\r\nfor i in range(n):\r\n for j in range(d + 1):\r\n if i + j < n and s[i + j] == \"1\":\r\n dp[i + j] = min(dp[i + j], dp[i] + 1)\r\n\r\nif dp[n - 1] == INF:\r\n print(-1)\r\nelse:\r\n print(dp[n - 1])", "n,k=[int(t) for t in input().split()]\r\ns=input()\r\nx=[0]*n\r\nfor j in range(n):\r\n if s[j]=='1':\r\n x[j]=j\r\n else:\r\n x[j]=x[j-1]\r\npt=0\r\nc=0;\r\nwhile(pt!=n-1):\r\n tem=x[min(pt+k,n-1)]\r\n c=c+1\r\n if tem==pt:\r\n c=-1\r\n break\r\n pt=tem+1-1\r\nprint(c)", "n, d = map(int, input().split(\" \"))\r\ns = input()\r\n\r\nl = -1\r\nx = d\r\ni = n - 2\r\nj = 0\r\nwhile i > 0:\r\n if s[i] == \"1\":\r\n l = i\r\n x -= 1\r\n if x == 0:\r\n if l != -1:\r\n i = l\r\n j += 1\r\n x = d\r\n l = -1\r\n else:\r\n break\r\n i -= 1\r\nif i != 0:\r\n print(-1)\r\nelse:\r\n print(j + 1)", "x = input().split()\r\nn = int(x[0])\r\nd = int(x[1])\r\narr = list(input())\r\nfrogLocation = 0\r\njumps = 0\r\nwhile frogLocation != n - 1:\r\n x = frogLocation + d\r\n if x >= n:\r\n frogLocation = n\r\n jumps += 1\r\n break\r\n while x >= frogLocation:\r\n if x == frogLocation:\r\n jumps = -1\r\n break\r\n \r\n if arr[x] == '1':\r\n frogLocation = x\r\n jumps += 1\r\n break\r\n x -= 1\r\n if jumps == -1:\r\n break\r\nprint(jumps)", "from collections import *\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\nimport bisect\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef solve():\r\n N, D = list(map(int, input().split()))\r\n A = list(map(int, input().strip()))\r\n\r\n locs = [[] for _ in range(2)]\r\n for i, x in enumerate(A):\r\n locs[x].append(i)\r\n\r\n ans = 0\r\n B = locs[1]\r\n i = 0\r\n\r\n while i < len(B) - 1:\r\n j = bisect.bisect(B, B[i] + D, i) - 1\r\n\r\n if j == i:\r\n print(-1)\r\n return\r\n\r\n i = j\r\n ans += 1\r\n\r\n print(ans)\r\n\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()\r\n", "inp=lambda:map(int,input().split())\r\nn,d=inp()\r\ns=input()\r\nl=len(s)\r\n\r\nm=0\r\ni=0\r\ncnt=0\r\nwhile(i<l-1):\r\n j=min(i+d,l-1)\r\n while(s[j]=='0'):\r\n j-=1\r\n if(j==i):\r\n print(\"-1\")\r\n quit()\r\n i=j\r\n cnt+=1\r\n\r\nprint(cnt)\r\n", "n,d=map(int,input().split())\r\nl=input()\r\nans=0\r\ni=0\r\np=-1\r\nwhile i<n-1:\r\n\tflag=0\r\n\tfor j in range(i+1,min((i+d+1),n)):\r\n\t\tif l[j]==\"1\":\r\n\t\t\tp=j\r\n\t\t\tflag=1\r\n\tif flag==1:\r\n\t\tans+=1\r\n\t\ti=p\r\n\telse:\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(ans)\r\nelse:\r\n\tprint(-1)\t", "import sys\r\nn,d=[int(i) for i in input().split()]\r\ns=input()\r\ndp=[sys.maxsize]*(n+1)\r\nfor i in range(n-1):\r\n for j in range(i+1,i+d+1):\r\n if i==0 and s[i]=='1' and s[j]=='1':\r\n dp[j]=min(dp[j],1)\r\n if j<n:\r\n if s[i]=='1' and s[j]=='1':\r\n dp[j]=min(dp[j],dp[i]+1)\r\nif dp[n-1]==sys.maxsize:\r\n print(-1)\r\nelse:\r\n print(dp[n-1])\r\n ", "n,d = map(int, input().split())\ns = input()\np = 0\nans = 0\nwhile (p<n-1):\n np = p\n for i in range(1, min(d+1,n-p)):\n if s[p+i] == '1':\n np = p+i\n if np==p:\n break\n p = np\n ans += 1\nif p==n-1:\n print(ans)\nelse:\n print(-1)", "n,d=[int(x) for x in input().split()]\r\ns=input()\r\nres,pos=0,0\r\nwhile pos<n-1:\r\n check=1\r\n for k in range(d,0,-1):\r\n if pos+k<=n-1:\r\n if s[pos+k]=='1':\r\n res+=1 \r\n pos+=k\r\n check=0\r\n break\r\n if check==1:\r\n break\r\nif check==1:\r\n print(-1)\r\nelse:\r\n print(res)", "n,k=map(int,input().split())\r\ns=list(map(int,input().strip()))\r\ni=0\r\ncount=0\r\nwhile i<len(s)-1 and count<n:\r\n if s[i]==1:\r\n i+=k\r\n count+=1\r\n else:\r\n i-=1\r\nif count>=n:\r\n print(-1)\r\nelse: \r\n print(count)", "line = input().split()\r\nn = int(line[0])\r\nd = int(line[1])\r\ntree = [[] for i in range(n)] #inisialisasi tree\r\nline1 = str(input())\r\nindex = int(0) #index untuk menentukan node mana yang akan ditambah anaknya\r\ntemp = int(0) #menampung index sementara untuk diganti\r\ncount = int(0) #menghitung berapa jarak lompatan dari index\r\ncek = int(1)\r\nfor i in range(1, n):\r\n if line1[i] == '1':\r\n tree[index].append(i)\r\n temp = i #setiap ada yg 1 maka temp berpindah ke-i\r\n count += 1 #count ditambah setiap perulangan untuk menghitung lompatan dari index terakhir\r\n if count == d: #ketika count sama dengan d (batas)\r\n if index == temp: #dicek apakah index == temp, karena jika sama maka sudah pasti sebanyak batas lompatan d dijamin tidak ada 1 (bunga lily) yang berarti kodok tersebut akan jatuh ke air\r\n cek = 0 #diubah ke 0 (false)\r\n break\r\n else:\r\n count = i - temp #count tidak direset ke 0 karena count merupakan jumlah lompatan dari index terakhir, dan index terakhir disini adalah temp\r\n index = temp\r\n##print(tree)\r\nstep = int(-1) #dimulai dari -1 karena pada penelusuran selalu ditambah 1, sehingga akan pas ketika berada pada root, step = 0\r\nif cek:\r\n q = [0] #inisialisasi queue\r\n while len(q) > 0:\r\n if len(tree[q[0]]) > 0: #menandakan bahwa node tersebut bukan leaf\r\n q += [tree[q[0]][len(tree[q[0]]) - 1]] #anak paling kanan ditambah ke queue\r\n step += 1\r\n q.pop(0) #memakai prinsip queue karena DFS yang digunakan merupakan DFS Right Wall yang berarti\r\n #hanya menelusuri anak paling kanan, dan tidak akan melakukan backtracking\r\n #sehingga digunakan queue untuk penghematan memori(tidak menambah elemen dari array)\r\n\r\nprint(step)", "n, d = map(int, input().split())\r\ns = input()\r\ni =0\r\nans = 0\r\n\r\nwhile i < n-d:\r\n p = i\r\n for j in range(d, 0, -1):\r\n if s[i+j] == \"1\":\r\n i = i+j\r\n ans += 1\r\n break\r\n if i != n-1 and i >= n-d:\r\n ans += 1\r\n if i == p:\r\n ans = -1\r\n break\r\n\r\nprint(ans)", "from sys import stdin,stdout\r\nfrom collections import defaultdict\r\nfrom heapq import heappop,heappush\r\n\r\ndef dijkstra(n, graph, start):\r\n \"\"\" Uses Dijkstra's algortihm to find the shortest path between in a graph. \"\"\"\r\n dist, parents = [float('inf')] * n, [-1] * n\r\n dist[start] = 0\r\n\r\n queue = [(0, start)]\r\n while queue:\r\n path_len, v = heappop(queue)\r\n if path_len == dist[v]:\r\n for w, edge_len in graph[v]:\r\n if edge_len + path_len < dist[w]:\r\n dist[w], parents[w] = edge_len + path_len, v\r\n heappush(queue, (edge_len + path_len, w))\r\n\r\n return dist, parents\r\n\r\nn,d=map(int , stdin.readline().split())\r\nArr=input()\r\ngraph={i:[] for i in range(n)}\r\nfor i in range(n):\r\n if Arr[i]=='1':\r\n for j in range(i+1,min(i+d+1,n)):\r\n if Arr[j]=='1':\r\n graph[i].append((j,1))\r\ndist,parents=dijkstra(n,graph,0)\r\nif dist[n-1]==float('inf'):\r\n print(-1)\r\nelse:\r\n print(dist[n-1])\r\n", "def teletransporte(n, dist, mapa):\n \n teleporte = 0\n posicao = 0\n\n if \"0\" * dist in mapa:\n return -1 \n while posicao < (n - 1):\n if mapa[posicao] == '1':\n posicao += dist\n teleporte += 1\n else:\n posicao -= 1\n \n return teleporte\n\n\ndestino, dist = map(int, input().split())\nmapa = input()\nprint(teletransporte(destino, dist, mapa))\n\n\t\t \t\t \t \t \t \t\t\t \t\t\t \t\t \t\t\t", "from collections import deque\nfrom heapq import *\nimport sys\nsys.setrecursionlimit(5005)\nmod = 1000000007\ntime = 0\n\ndef solve():\n\tn,d = map(int,input().split())\n\ts = input()\n\ti = c = 0\n\twhile i<n:\n\t\ttmp = -1\n\t\tj = i+1\n\t\twhile j<n and j-i<=d:\n\t\t\tif s[j] == '1':\n\t\t\t\ttmp = j\n\t\t\tj+=1\n\t\tif tmp==-1:\n\t\t\tif j<n:\n\t\t\t\tprint(-1)\n\t\t\t\treturn\n\t\t\telse:\n\t\t\t\tbreak\n\t\ti = tmp\n\t\tc+=1\n\tprint(c)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nt = 1\n#t = int(input())\n\nfor i in range(t):\n\tsolve()", "from queue import Queue\n\nn, d = map(int, input().split())\nmapa = [int(c) for c in input()]\n\ndistancias = [-1] * n\ndistancias[0] = 0\n\nfila = Queue()\nfila.put(0)\n\nwhile not fila.empty():\n pos = fila.get()\n\n for i in range(pos+1, min(n, pos+d+1)):\n\n if mapa[i] and distancias[i] == -1:\n distancias[i] = distancias[pos]+1\n fila.put(i)\n\nprint(distancias[n-1])\n\t\t\t\t \t\t\t\t \t\t \t \t \t\t", "from collections import *\nimport sys \ninput=sys.stdin.readline\nfrom itertools import groupby\nfrom math import inf\n\n# \"\". join(strings) \n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nN = 100\n\nn, d = rl()\nss = input()\n\ndp = [inf]*(N + 5)\n\ndp[0] = 0\nfor i in range(n):\n\tfor j in range(i+1,n):\n\t\tif j > i + d:\n\t\t\tbreak\n\t\tif ss[j] == \"1\": \n\t\t\tdp[j] = min(dp[i] + 1, dp[j])\nif dp[n - 1] == inf:\n\tprint(-1)\n\tsys.exit()\nprint(dp[n - 1])\n\n\n\n", "n, d = map(int, input().split())\ns = input()\nif '0' * d in s:\n print('-1')\nelse:\n idx = 0\n jumps = 0\n while idx < n - 1:\n idx = s[:idx + d + 1].rfind('1')\n jumps += 1\n print(jumps)\n\t\t \t \t \t \t\t \t\t\t\t\t\t \t\t \t \t \t", "n, d = map(int, input().split())\r\ns = input()\r\n\r\ni = 0\r\njumps = 0\r\n\r\nwhile i < n - 1:\r\n j = min(i + d, n - 1)\r\n\r\n while s[j] != '1' and j > i:\r\n j -= 1\r\n\r\n if j == i and i < n:\r\n print(-1)\r\n exit()\r\n else:\r\n jumps += 1\r\n i = j\r\n\r\nprint(jumps)\r\n", "n,m=map(int,input().split())\nbook=[0]*(n+1)\nbook[1]=1\nq=[]\nq.append(1)\na=input()\nb=[0]\nfor i in a:\n b.append(int(i))\ndef bfs():\n global book,n,m,b,q\n while len(q)!=0:\n x=q.pop(0)\n for i in range(1,m+1):\n nx=x+i\n if nx<=n and book[nx]==0 and b[nx]==1:\n book[nx]=book[x]+1\n q.append(nx)\nbfs()\nprint(book[n]-1)\n \n\n\t\t\t \t \t \t\t\t\t \t\t\t \t \t \t\t", "memo={}\r\n\r\ndef min_jump(s,d,i):\r\n if memo.get(i,'rrr')!='rrr':\r\n return memo[i]\r\n if i<=1:\r\n return 0\r\n g=1e100\r\n for j in range(i-1,i-d-1,-1):\r\n if s[j]=='1':\r\n g=min(g,min_jump(s,d,j)+1)\r\n memo[i]=g\r\n return g\r\n\r\nn,d=map(int,input().split())\r\ns='0'+input()\r\nu=min_jump(s,d,n)\r\nif u==1e100 :\r\n print(-1)\r\nelse:\r\n print(u)", "len,d=map(int,input().split())\r\n\r\ns=input()\r\nnum=0\r\nans=0\r\nindex=1\r\nif s[0] ==0 or s[d-1]==0:\r\n num=2\r\n print(-1)\r\nwhile num!=len-1:\r\n flag=0\r\n for i in range(num+1,num+d+1)[::-1]:\r\n if i>=len:\r\n index=0\r\n flag=1\r\n break\r\n if s[i]=='1':\r\n num=i\r\n flag=1\r\n break\r\n if flag==0:\r\n num=2\r\n print(-1)\r\n break\r\n else:\r\n ans=ans+1\r\n if index==0:\r\n break\r\nif num!=2:\r\n print(ans)", "n, d = map(int, input().split())\n\nbinary_string = input()\n\ncurrent_position = 0\nmin_number = 0\n\n\nwhile(True):\n max_jump = current_position + d \n if max_jump >= n: \n max_jump = n-1\n\n while(binary_string[max_jump] != '1'):\n max_jump = max_jump-1\n\n if max_jump == current_position:\n print(-1)\n break\n else:\n min_number +=1\n current_position = max_jump\n\n if current_position == n-1:\n print(min_number)\n break", "n, d = map(int, input().split())\r\ns, i, k = input(), 0, 0\r\n\r\nwhile i < n - 1:\r\n for j in range(1, min(d + 1, n - i))[::-1]:\r\n if s[i+j] == '1':\r\n i, k = i + j, k + 1\r\n break\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(k)", "n,d=map(int,input().split())\r\na=input()\r\nc=0\r\ni=0\r\nnotreached=True\r\nwhile notreached:\r\n ss= a[i+1:i+d+1]\r\n flag=True\r\n for j in range(len(ss)-1,-1,-1):\r\n if ss[j]=='1':\r\n i+=j+1\r\n c+=1\r\n flag=False\r\n break\r\n if i==n-1:\r\n notreached=False\r\n if flag:\r\n print('-1')\r\n break\r\nif i==n-1:\r\n print(c)", "line = input()\npui = line.split()\nn = int(pui[0])\nd = int(pui[1])\nst = input()\npos = 1 \nj = 0 \nwhile True :\n temp = False \n i = pos + d\n if i >= n :\n j = j+1 \n temp = True\n break\n while i != pos :\n if st[i-1] == \"1\" :\n pos = i \n temp = True\n j = j+1 \n break\n i = i-1\n if temp is False :\n print(\"-1\")\n quit()\nprint(j)\n \n \n \t\t \t\t\t \t\t\t \t\t\t \t \t \t", "\n\nn,k = map(int,input().split())\nl = input()\nd=[0]*n\n\n\nfor i in range(n-2,-1,-1):\n if l[i]==\"1\":\n if i+k>=n-1:\n d[i]=1\n else:\n f = float(\"inf\")\n for j in range(i+1,min(i+k+1,n-1)):\n if l[j] == \"1\" and d[j]!=0:\n f = min(f,d[j]+1)\n if f!=float(\"inf\"):\n d[i] = f\n\nif d[0]:\n print(d[0])\nelse:\n print(-1)\n", "n, d = map(int, input().split())\r\nmoo = input()\r\npor = 0\r\ntig = 0\r\nwhile por < n - 1:\r\n blu = por\r\n for i in range(por+1, por+d+1):\r\n if (i < n) and (moo[i] == \"1\"):\r\n blu = i\r\n if por == blu:\r\n tig = -1\r\n break\r\n por = blu\r\n tig += 1\r\nprint(tig)", "\r\na,b=map(int,input().split())\r\nstrin=input()\r\nst=0\r\nans=0\r\nwhile True:\r\n\tif st+1==len(strin):\r\n\t\tbreak\r\n\telif st+1>len(strin):\r\n\t\tst=st-1\r\n\telse:\r\n\t\tw=st\r\n\t\tw=w+b\r\n\t\th=0\r\n\t\tif w+1>len(strin):\r\n\t\t\tw=len(strin)-1\r\n\t\twhile w!=st:\r\n\t\t\tif strin[w]=='1':\r\n\t\t\t\tans+=1\r\n\t\t\t\th=1\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tw=w-1\t\t\t\r\n\t\tif h==0:\r\n\t\t\tprint(-1)\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tst=w\r\nif h==1:\r\n\tprint(ans)\r\n", "n,d = map(int,input().split())\r\na = input()\r\njumps = 0\r\ni = 0\r\nwhile i<n:\r\n if i==n-1:\r\n print(jumps)\r\n break\r\n for j in range(i+d,i,-1):\r\n if j<n:\r\n if a[j]=='1':\r\n jumps+=1\r\n i = j\r\n break\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(-1)\r\n", "n, d = [int(x) for x in input().split()]\nmap = input()\n\ncurrent_position = 0\ncount = 0\n\nwhile current_position != n - 1:\n submap = map[current_position:current_position + d + 1]\n j, check = len(submap) - 1, True\n \n while check:\n if j == 0:\n print(-1)\n exit()\n if submap[j] == \"1\":\n current_position += j\n count += 1\n check = False\n j -= 1\n\nprint(count)\n\t \t \t\t \t \t \t\t\t \t \t\t \t \t \t", "x,y =input().split()\r\nx=int(x)\r\ny=int(y)\r\nz =input()\r\ndif= 0\r\nv= 0 \r\nwhile dif < x - 1 and v < x:\r\n if z[dif] == '1':\r\n dif+= y\r\n v+= 1\r\n else :\r\n dif-= 1 \r\nif v>= x:\r\n print(-1)\r\nelse :\r\n print(v)\r\n", "\nn,d = map(int,input().split())\ns = input()\n\nif \"0\"*d in s:\n\tprint(-1)\nelse:\n\tc=0\n\ti=0\n\twhile i<n-1:\n\t\tif s[i]==\"1\":\n\t\t\ti+=d\n\t\t\tc+=1\n\t\telse:\n\t\t\ti-=1\n\tprint(c)\n\t \t \t\t\t \t \t\t\t\t\t \t \t \t\t \t", "def solve(field, D):\n valid_idxs = [i for i, c in enumerate(field) if c == \"1\"]\n path = [float(\"inf\")] * len(field)\n \n path[0] = 0\n i = 0\n while i < len(path):\n \n for idx in valid_idxs:\n #print(i, idx)\n\n if idx <= i:\n continue\n elif idx > i and idx <= i + D:\n #print(\"update\")\n path[idx] = min(path[idx], path[i] + 1)\n else:\n break\n \n i += 1\n #print(path)\n return path[-1] if path[-1] != float(\"inf\") else -1\n\n\nN, D = map(int, input().split())\nfield = input()\n\nprint(solve(field, D))\n", "n, d = map(int, input().split())\r\ns = input()\r\nptr = 0\r\ncount = 0\r\n\r\nwhile(ptr < n-1):\r\n check = False\r\n if(ptr + d >= len(s)):\r\n indx = len(s)-1\r\n else:\r\n indx = ptr + d\r\n for x in range(indx , ptr, -1):\r\n #print(x)\r\n if(s[x] == '1'):\r\n ptr = x\r\n count += 1\r\n check = True\r\n break\r\n if(check == False):\r\n count = -1\r\n break\r\nprint(count)", "end, maxDist = map(int,input().split())\npath = input()\n\nactual = 0\ncount = 0\n\nwhile actual < end-1:\n maxPath = path[actual+1:actual+maxDist+1]\n if \"1\" in maxPath:\n jump = maxPath.rfind(\"1\") + 1\n actual += jump\n count += 1\n else:\n count = -1\n break\n\nprint(count)\n\t\t \t \t \t \t\t\t \t \t \t\t\t", "n,d=map(int,input().split())\r\ns=[int(i) for i in input()]\r\nind=0\r\nc=0\r\nwhile ind<n:\r\n f=0\r\n for j in range(ind+1,ind+d+1):\r\n if j<n:\r\n if s[j]==1:\r\n f=1\r\n ind=j\r\n if f==1:\r\n c+=1\r\n if ind==n-1:\r\n break\r\n else:\r\n break\r\nif f==0:\r\n print(-1)\r\nelse:\r\n print(c)", "# ===================================\r\n# (c) MidAndFeed aka ASilentVoice\r\n# ===================================\r\n# import math, fractions, collections\r\n# ===================================\r\nn, d = [int(x) for x in input().split()]\r\ns = str(input())\r\ni = 0\r\nans = 0\r\ntemp = 0\r\nwhile(1):\r\n\ttemp = min(d, n-i-1)\r\n\t\r\n\twhile(temp > 0):\r\n\t\tif s[i+temp] == \"1\":\r\n\t\t\tflag = 1\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ttemp -= 1\r\n\r\n\t\tif temp == 0:\r\n\t\t\tflag = 0\r\n\r\n\tans += 1\r\n\ti += temp\r\n\r\n\t# print(i, ans)\r\n\r\n\tif i == n-1 or not(flag):\r\n\t\tbreak\r\n\r\nif i+1 == n:\r\n\tprint(ans)\r\nelse:\r\n\tprint(-1)\r\n", "from collections import defaultdict\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\ndef next(x, d, Ox):\r\n new_x = min(len(Ox) - 1, x + d)\r\n \r\n while new_x > x:\r\n if Ox[new_x] == '1':\r\n return new_x\r\n \r\n new_x -= 1\r\n \r\n return new_x\r\n \r\ndef solve(n, d, Ox):\r\n steps, x = 0, 0\r\n \r\n while x < n - 1:\r\n max_step = next(x, d, Ox)\r\n if max_step == x:\r\n return -1\r\n \r\n steps += 1\r\n x = max_step\r\n \r\n return steps\r\n\r\nn, d = invr()\r\nOx = input()\r\nprint(solve(n, d, Ox))\r\n\r\n\r\n\r\n", "def dp(n, d, s):\n arr = [float(\"inf\")] * n\n arr[0] = 0\n for i in range(1, n):\n for j in range(1, d + 1):\n if i - j >= 0 and s[i - j] == \"1\":\n arr[i] = min(arr[i], 1 + arr[i - j])\n return arr[n - 1]\n\n\nn, d = map(int, input().split())\ns = input()\nvalue = dp(n, d, s)\nif value == float(\"inf\"):\n value = -1\nprint(value)\n", "def g():\n arrlen = list(map(int, input().split()))\n arr = list(map(int, input()))\n\n p1 = 0\n p2 = 0\n leaps = 0\n while True:\n if p1 == arrlen[0] - 1:\n break #HERE\n else:\n p2 = min(p1 + arrlen[1], arrlen[0]-1)\n while True:\n if p1 == p2:\n print(\"-1\")\n return #RIP\n elif arr[p2] == 1:\n p1 = p2\n leaps+=1\n break\n else:\n p2 -=1\n print(leaps)\ng()\n \t\t\t \t \t \t\t \t \t \t\t\t", "def set_args(str_1, str_2):\n caminho_size, window_size = str_1.split()\n caminho = [int(char) for char in str_2]\n return caminho_size, window_size, caminho\ndef find_longest_jump(curr_position, caminho, jump_size):\n if curr_position + jump_size >= len(caminho)-1:\n return -2\n else:\n for i in range(curr_position + jump_size, curr_position, -1):\n if bool(caminho[i]):\n return i -curr_position\n return -1\n\n\nline_1 = input()\nline_2 = input()\ncaminho_size, window_size, caminho = set_args(line_1, line_2)\n\n\nposicao = 0\nn_jumps = 0\nwhile(True):\n jump = find_longest_jump(posicao, caminho, int(window_size))\n if jump == -2:\n print(n_jumps+1)\n break\n elif jump == -1:\n print('-1')\n break\n else:\n n_jumps += 1\n posicao = posicao + jump\n\t \t \t\t \t \t\t\t \t\t\t \t\t\t\t\t", "from typing import List, Union\r\nfrom collections import namedtuple\r\nimport sys\r\nimport traceback\r\nfrom datetime import datetime\r\nfrom time import perf_counter\r\n\r\n\r\nclass Solution:\r\n def way_to_home(self, nums, target, leap):\r\n nums = nums[0: target]\r\n result = -1\r\n count = 0\r\n index = 0\r\n while index < len(nums) - 1:\r\n new_index = index + leap\r\n count += 1\r\n if new_index >= len(nums):\r\n new_index = len(nums) - 1\r\n while nums[new_index] == 0:\r\n new_index -= 1\r\n if new_index == index:\r\n count = -1\r\n break\r\n index = new_index\r\n print(count)\r\n return count\r\n\r\n\r\nTestCase = namedtuple('TestCase', 'nums target leap correct')\r\n\r\n\r\ndef read_test_cases(input_file, output_file):\r\n test_cases: List[TestCase] = []\r\n try:\r\n with open(input_file) as in_f:\r\n with open(output_file) as out_f:\r\n while True:\r\n line = in_f.readline()\r\n if not line:\r\n break\r\n line = line.strip()\r\n items = line.split(' ')\r\n target = int(items[0])\r\n leap = int(items[1])\r\n nums = in_f.readline().strip()\r\n nums = [int(n) for n in nums]\r\n correct = int(out_f.readline())\r\n test_cases.append(TestCase(nums, target, leap, correct))\r\n # raise Exception('My Test Exception')\r\n except Exception as exc:\r\n exc_name = exc.__class__.__name__\r\n exc_msg = str(exc)\r\n exc_info = sys.exc_info()\r\n print('EXCEPTION:', exc_name, exc_msg)\r\n traceback.print_exception(*exc_info)\r\n return test_cases\r\n\r\n\r\ndef run_test_cases(test_cases: List[TestCase]):\r\n for t in test_cases:\r\n result = Solution().way_to_home(t.nums, t.target, t.leap)\r\n print('NUMS:', t.nums, 'TARGET:', t.target, 'LEAP:', t.leap,\r\n 'CORRECT:', t.correct, 'RESULT:', result, 'CHECK:', t.correct == result)\r\n\r\n\r\nif __name__ == '__main__':\r\n if len(sys.argv) > 1 and '--debug' in sys.argv:\r\n date_str = datetime.utcnow().strftime('%Y.%m.%d %H:%M:%S')\r\n print('STARTING:', date_str)\r\n test_cases = read_test_cases('data/input.txt', 'data/output.txt')\r\n start_counter = perf_counter()\r\n run_test_cases(test_cases)\r\n stop_counter = perf_counter()\r\n print('COUNTER:', stop_counter - start_counter)\r\n else:\r\n items = input().strip().split(' ')\r\n target = int(items[0])\r\n leap = int(items[1])\r\n nums = input().strip()\r\n nums = [int(n) for n in nums]\r\n Solution().way_to_home(nums, target, leap)\r\n\r\n", "s1 = input()\r\ns1 = s1.split()\r\nn = int(s1[0])\r\nd = int(s1[1])\r\ns = input()\r\ncount = 0\r\npos = 1\r\ndk = d\r\nres = True\r\nwhile(pos!=n):\r\n if dk==0:\r\n res = False\r\n break\r\n if pos+dk<=n and s[pos+dk-1]=='1':\r\n if dk==0:\r\n res = False\r\n break\r\n pos+=dk\r\n count+=1\r\n dk = d\r\n else:\r\n dk-=1\r\n\r\nif res:\r\n print(count)\r\nelse:\r\n print(-1)", "e, k = map(int, input().split())\nv = input()\nf = True\nt = 0\ni = 0\nwhile f and i != e - 1:\n f = False\n n = i\n for x in range(i + 1, i + k + 1):\n if x < e and v[x] == '1':\n f = True\n n = x\n i = n\n t += 1\nif f:\n print(t)\nelse:\n print(-1)\n", "n, d = list(map(int, input().split()))\nworld = input()\n\nINF = 1000\ndp = [INF] * n\n\n# Montar a tabela de dp\n# dp[i] = minimo de pulos para chegar na posicao i\n# dp[i] = min(dp[i], dp[j] + 1) para todo j tal que j eh alcancavel por i\ndp[0] = 0\nfor i in range(n):\n # Encontrar o máximo slot alcancavel por i\n max_slot = min(n, i + d + 1)\n\n for j in range(i + 1, max_slot):\n if world[j] == \"1\":\n dp[j] = min(dp[j], dp[i] + 1)\n\nif dp[n - 1] == INF:\n print(-1)\nelse:\n print(dp[n - 1])\n", "n, d = map(int, input().split())\r\na = [int(x) for x in input()]\r\nans = 0\r\ni = 0\r\nwhile i < n - 1:\r\n j = i + 1\r\n l = i\r\n while j < min(n, i + d + 1):\r\n if a[j] == 1:\r\n l = j\r\n j += 1\r\n if i == l:\r\n\r\n ans = -1\r\n break\r\n ans += 1\r\n i = l\r\nprint(ans)", "import heapq as hq\r\nfrom collections import defaultdict\r\n\r\nn, d = map(int, input().split())\r\ns = input()\r\ngraph = defaultdict(lambda: [])\r\nfor i in range(n):\r\n if s[i] == '0': continue\r\n for j in range(1, d+1):\r\n if i + j >= n: break\r\n if s[i+j] == '1': graph[i].append(i+j)\r\nq = [(0, 0)]\r\nr = []\r\nv = set()\r\nwhile q:\r\n curr_node = q.pop(0)\r\n if curr_node[0] == n-1:\r\n r.append(curr_node[1])\r\n continue\r\n for p in graph[curr_node[0]]:\r\n if p in v: continue\r\n q.append((p, curr_node[1] + 1))\r\n v.add(p)\r\nif not r:\r\n r = [-1]\r\nprint(min(r))", "def mint(n, d, s):\n mint = [-1] * n\n mint[0] = 0\n\n for i in range(1, n):\n if s[i] == '1':\n for j in range(i - 1, max(i - d - 1, -1), -1):\n if mint[j] != -1 and (mint[i] == -1 or mint[j] + 1 < mint[i]):\n mint[i] = mint[j] + 1\n if mint[-1] == -1:\n return -1\n else:\n return mint[-1]\nn, d = map(int, input().split())\ns = input()\nr = mint(n, d, s)\nprint(r)\n\n\t \t \t \t \t \t \t \t\t\t\t\t \t\t", "n, d = map(int, input().split())\nx = input()\ncnt = 0\nif x.count(d * '0') > 0:\n print(-1)\nelse:\n left_pointer, right_pointer = 0, 0\n for i in range(1, n):\n if x[i] == '1':\n if i - left_pointer < d:\n right_pointer = i\n if i == n - 1:\n cnt += 1\n else:\n left_pointer, right_pointer = i, i\n cnt += 1\n else:\n if i - left_pointer == d:\n left_pointer = right_pointer\n cnt += 1\n\n print(cnt)\n", "def mini(i,j):\r\n if i>j:\r\n return j\r\n return i\r\n\r\ndef cal(arr,end,jmp):\r\n k=0\r\n ok=0\r\n ind=0\r\n cnt=0\r\n end-=1\r\n while k!=end:\r\n k+=1\r\n ok=0\r\n for i in range(k,mini(end+1,k+jmp)):\r\n if(arr[i]=='1'):\r\n ok=1\r\n ind=i\r\n \r\n \r\n if ok==1:\r\n cnt+=1\r\n k=ind\r\n else:\r\n return -1\r\n \r\n \r\n return cnt\r\n\r\ndef main():\r\n z=input()\r\n lst=z.split()\r\n end=int(lst[0])\r\n jmp=int(lst[1])\r\n arr=input()\r\n \r\n print(cal(arr,end,jmp))\r\n \r\n \r\n \r\n \r\nif __name__==\"__main__\":\r\n main()", "num1,num2=map(int,input().split())\r\nname=str(input())\r\nx=0;y=0\r\n\r\nwhile x<num1-1 and y<=num1:\r\n if name[x]=='1':\r\n x+=num2\r\n y+=1\r\n else:\r\n x-=1\r\nif y>=num1 : print(\"-1\")\r\nelse : print(y) \r\n", "#\n# Joseph Matsushita\n# Problem A\n#\n# Time Complexity\n# The time complexity of this algorithm is O(n). Each pad is checked at most once,\n# except in the case where there is no valid pad, in which case each pad may be\n# checked twice. Either way, it remains O(n).\n#\n# Space Complexity\n# The space complexity is O(n), for holding the patterns of lilies.\n#\n# Argument\n# Worst case, each pad does need to be checked in case the frog can jump to it,\n# so O(n) is the best possible result. Note that in some cases where the frog has\n# no path or can jump a long way, this algorithm takes significantly less time.\n#\n\nn, d = map(int, input().split())\npads = list(input())\n\ncur = 0 #start at pad 1 (represented as pad 0)\ncount = 0\ngood = True #turns false if the frog cannot reach a pad\n#strategy is simple, greedily pick the rightmost pad the frog can jump to\n\nwhile(good and cur + d < n - 1): #can we reach the destination in 1 hop?\n i = d\n while(i > 0): #check the farthest location first, then work backwards\n if pads[cur+i] == '1': #pad located\n cur += i\n count += 1\n break\n else:\n i -= 1\n if(i == 0): #no pad was found\n good = False\nif(not good):\n print(-1)\nelif(cur == n):\n print(count)\nelse:\n print(count+1) #include the hop to the last pad\n \t\t \t\t \t \t \t\t \t \t\t \t \t \t", "n, d = map(int, input().split())\ns = input()\n\ndp = [float('inf')] * (n + 1)\ndp[1] = 0\n\nfor i in range(2, n + 1):\n if s[i - 1] == '0':\n continue\n for j in range(i - 1, max(1, i - d) - 1, -1):\n if s[j - 1] == '1':\n dp[i] = min(dp[i], dp[j] + 1)\n\nif dp[n] == float('inf'):\n print(-1)\nelse:\n print(dp[n])\n\n\t\t\t\t \t\t\t \t\t \t\t\t \t \t \t\t\t \t\t\t\t\t\t", "n, d = map(int, input().split())\r\np = input()\r\ni = 0\r\nj = 0\r\n\r\nwhile i < n:\r\n if p[i] == '1' and i == n-1:\r\n print(j)\r\n break\r\n elif p[i] == '1':\r\n jump = d\r\n while jump > 0 and ((jump + i) > 0):\r\n if (jump + i) < n and p[jump + i] != '1':\r\n jump -= 1\r\n elif (jump + i) < n and p[jump + i] == '1':\r\n break\r\n elif jump + i >= n:\r\n jump -= 1\r\n if jump == 0:\r\n print(-1)\r\n break\r\n i = jump + i\r\n j += 1\r\n\r\n'''\r\n8 4\r\n10010101\r\n'''\r\n", "n,d=map(int,input().split())\r\ns=list(input())\r\np=[]\r\nfor i in range(n):\r\n\tif(s[i]=='1'):\r\n\t\tp.append(i+1)\r\nk=[]\r\nf=0\r\nfor i in range(len(p)-1):\r\n\taw=p[i+1]-p[i]\r\n\tif(aw<=d):\r\n\t\tk.append(aw)\r\n\telse:\r\n\t\tf=1\r\n\t\tbreak\r\nif(f==1):\r\n\tprint(-1)\r\nelse:\r\n\t\t\r\n\tk1=[]\r\n\th=0\r\n\tfor j in range(len(k)):\r\n\t\tif((h+k[j])<=d):\r\n\t\t\th=h+k[j]\r\n\t\telse:\r\n\t\t\tk1.append(h)\r\n\t\t\th=k[j]\r\n\tif h!=0:\r\n\t\tk1.append(h)\r\n\tprint(len(k1))", "n,d=map(int,input().split())\r\njumps=0\r\ncurrlim=d\r\nver=False\r\npos=-1\r\ns=input()\r\nfor i in range(1,n):\r\n if currlim>=(n-1):\r\n jumps+=1\r\n break\r\n if i==currlim:\r\n if s[i]=='0':\r\n currlim=pos+d\r\n else:\r\n pos=i\r\n currlim=pos+d\r\n if ver==False:\r\n jumps+=1\r\n ver=True\r\n if ver==False:\r\n jumps=0\r\n break\r\n ver=False\r\n elif s[i]=='1' and i<currlim and ver==False:\r\n jumps+=1\r\n ver=True\r\n pos=i\r\n elif s[i]=='1' and i<currlim and ver==True:\r\n pos=i\r\nif jumps==0:\r\n print(-1)\r\nelse:\r\n print(jumps)", "n,d=map(int,input().split())\r\nch=input()\r\ni=0\r\nl=len(ch)\r\ncom=0\r\nwhile True:\r\n if len(ch)-i <= d:\r\n if len(ch)-i>1:\r\n com+=1\r\n print(com)\r\n break\r\n else:\r\n if '1' in ch[i+1:i+d+1]:\r\n ch3=ch[i+1:i+d+1]\r\n ch2=ch3[::-1]\r\n i=i+d+1-ch2.index('1')-1\r\n com+=1\r\n else:\r\n print(-1)\r\n break", "n,d=map(int,input().split())\r\ns=input()\r\nl=[]\r\nfor i in range(n):\r\n if(s[i]=='1'):\r\n l.append(i+1)\r\nans=0\r\na=1\r\nj=1\r\nwhile j<len(l):\r\n if(l[j]>a+d):\r\n print(-1)\r\n exit()\r\n else:\r\n while j<len(l) and l[j]<=a+d:\r\n j+=1\r\n a=l[j-1]\r\n ans+=1\r\nprint(ans)", "import sys\n\n\ndef is_possible(n, d, s):\n prev = 0\n lilypads = []\n for index in range(len(s)):\n if s[index] == \"1\":\n lilypads.append(index)\n if index - prev > d:\n return -1\n prev = index\n current = counter = 0\n while current < n - 1:\n current = max([i for i in lilypads if i <= current + d and i >= current])\n counter += 1\n return counter\n\n\nn, d = list(map(int, sys.stdin.readline().split()))\ns = str(sys.stdin.readline())\nprint(is_possible(n, d, s))\n", "# Aluno: Diego de Lima Cruz\n# Matricula: 120210290\nfrom collections import deque\n\ndef min_teleportes_para_torre(n, d, mapa_magico):\n fila = deque([(0, 0)]) \n visitado = [False] * n\n\n while fila:\n posicao, teleportes = fila.popleft()\n\n if posicao == n - 1:\n return teleportes\n\n for i in range(1, min(d + 1, n - posicao)):\n if mapa_magico[posicao + i] == \"1\" and not visitado[posicao + i]:\n visitado[posicao + i] = True\n fila.append((posicao + i, teleportes + 1))\n\n return -1\n\n\nn, d = map(int, input().split())\nmapa_magico = input()\n\n\nresultado = min_teleportes_para_torre(n, d, mapa_magico)\nprint(resultado)\n\t \t\t\t \t\t \t\t\t \t\t \t \t\t\t\t", "n,k = map(int,input().split())\ns = input()\nidx = 0\ncnt = 0\nflag = 0\nwhile(True):\n \n if(idx==n-1):\n break\n cnt += 1\n new = min(idx+k,n-1)\n if(s[new] == '1'):\n idx = new\n continue\n flag = 1\n for i in range(new,idx,-1):\n if(s[i] == '1'):\n idx = i\n flag = 0\n break\n if(flag):\n break\nif(flag):\n print(-1)\nelse: \n print(cnt)\n\t \t\t\t\t \t\t \t \t \t\t \t\t \t \t\t", "n, k = map(int, input().split())\r\ns = input()\r\nif s[0] != \"1\" or s[-1] != \"1\":\r\n print(-1)\r\nelse:\r\n cnt = 0\r\n i = 0\r\n f = 1\r\n while i != n - 1:\r\n ind = -1\r\n for j in range(i + 1, min(n, i + 1 + k)):\r\n if s[j] == \"1\":\r\n ind = j\r\n if ind == -1:\r\n print(-1)\r\n f = 0\r\n break\r\n i = ind\r\n cnt += 1\r\n if f: \r\n print(cnt)", "n,d=map(int,input().split())\r\n\r\ns=input().strip()\r\ni=0\r\n\r\nan=0\r\nwhile (i<n):\r\n p=i\r\n for j in range(d,0,-1):\r\n if j+i<=(n-1):\r\n if s[j+i]=='1':\r\n i=j+i\r\n an+=1\r\n break\r\n\r\n if p==i:\r\n an=-1\r\n break\r\n elif i==n-1:\r\n break\r\nprint(an)\r\n", "n,d=map(int,input().split())\r\ns=input()\r\nf=1\r\nc=0\r\ni=0\r\nwhile(i<n-1):\r\n if(i+d<n):\r\n j=i+d\r\n else:\r\n j=n-1\r\n while(s[j]!='1' and j>=i):\r\n j-=1\r\n if(j<=i):\r\n f=0\r\n break\r\n else:\r\n i=j\r\n c+=1\r\nif(f==1):\r\n print(c)\r\nelse:\r\n print(-1)", "a,b = map(int,input().split())\r\ns = input()\r\n \r\ni = 0;\r\nj = 0;\r\n \r\nwhile i < a - 1 and j < a:\r\n if s[i] == '1':\r\n i += b\r\n j += 1\r\n else :\r\n i -= 1\r\n \r\nif j >= a:print(-1)\r\nelse : print(j)", "# https://codeforces.com/contest/910/problem/A\nn,k = map(int, input().split())\ns = input()\ncount = 0\ni = 0\nwhile i != (n-1):\n j = min(i+k, n-1)\n while j > i and s[j] != '1':\n j -=1\n if i == j:\n count = -1\n break\n else:\n count += 1\n i = j\nprint(count)\n", "def df(q,st):\r\n global k,g\r\n g=st\r\n if q[st]:\r\n k+=1\r\n df(q,max(q[st]))\r\n return st\r\nn,d=map(int,input().split())\r\ns=input()\r\nq=[set() for i in range(n)]\r\nfor i in range(n):\r\n for j in range(i+1,min(n,d+i+1)):\r\n if s[i]=='1'==s[j]:\r\n q[i].add(j)\r\nk,g=0,0\r\ndf(q,0)\r\nif g==n-1:\r\n print(k)\r\nelse:\r\n print(-1)\r\n", "max_step = int(list(input().split(\" \"))[1])\r\n\r\narr = list(map(int,list(input())))\r\nstart = 0\r\ncurr = 0\r\ncount = 0\r\nstep = max_step\r\n\r\ndef findjumps(count,curr):\r\n\r\n if curr == len(arr)-1:\r\n return count\r\n step = max_step\r\n if curr + max_step <= len(arr):\r\n while curr + step < len(arr) and arr[curr + step] != 1 and step >0:\r\n step -= 1\r\n if curr+step >= len(arr):\r\n count += 1\r\n return count\r\n if arr[curr + step] != 1 or step <=0:\r\n return -1\r\n count += 1\r\n curr += step\r\n else:\r\n curr = len(arr)-1\r\n count += 1\r\n return count\r\n return findjumps(count,curr)\r\n\r\n\r\nprint(findjumps(0,0))", "n, d = map(int, input().split())\r\ns = input()\r\n\r\nfar = 0\r\nsteps = 0\r\nnow = set({0})\r\n\r\nwhile far < len(s) - 1:\r\n newnow = set()\r\n steps += 1\r\n for start in now: \r\n for i in range(1, d + 1):\r\n pos = start + i \r\n if pos not in newnow and s[pos] == '1':\r\n if pos == len(s) - 1:\r\n print(steps)\r\n exit(0)\r\n newnow.add(pos)\r\n now = newnow\r\n if len(now) == 0:\r\n break\r\n #print(\"now\", now, steps)\r\nprint(-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 n,d=LI()\n s=S()\n if s[-1]!='1':\n return -1\n\n ind=0\n nxt=d\n cnt=0\n while True:\n if ind>=n-1:\n return cnt\n if nxt>=n:\n return cnt+1\n\n f=False\n for i in range(ind+1,nxt+1)[::-1]:\n if s[i]=='1':\n cnt+=1\n ind=i\n nxt=ind+d\n f=True\n break\n\n if not f:\n return -1\n\n # print(ind,nxt,f)\n\n# main()\nprint(main())\n", "import sys\r\n\r\ndef checkJumps(maxJump,mapa):\r\n indexFrog = 0\r\n numJumps = 0\r\n cand = int(maxJump)\r\n while cand != 0:\r\n if(cand+indexFrog < len(mapa) and mapa[cand + indexFrog] == \"1\"):\r\n indexFrog += cand\r\n numJumps += 1\r\n cand = int(maxJump)\r\n else:\r\n cand -= 1\r\n\r\n if(indexFrog >= len(mapa)-1):\r\n return numJumps\r\n \r\n return -1\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n jumps,maxJump = sys.stdin.readline().rstrip(\"\\n\").split(\" \")\r\n mapa = sys.stdin.readline().rstrip(\"\\n\")\r\n numJumps = checkJumps(maxJump,mapa)\r\n sys.stdout.write(str(numJumps) + \"\\n\")", "ma = 10**18\n\ndef fn(pt):\n\n\tif pt<=0 or s[pt-1]=='0': return ma\n\n\tif pt==1: return 0\n\n\tif dp[pt]==-1:\n\t\tdp[pt] = ma\n\t\tfor i in range(1,d+1): dp[pt] = min ( dp[pt] , fn(pt-i)+1 )\n\treturn dp[pt]\n\nfrom sys import stdin\nn,d = [int(x) for x in stdin.readline().split()]\ns = stdin.readline()\n\ndp = [-1]*(n+1)\n\nans = fn(n)\nif ans==ma: print(-1)\nelse: print(ans)", "n, d = map(int, input().split())\r\ns, x, c = input(), 0, 0\r\nwhile True:\r\n i = s.rfind('1', x+1, x+d+1)\r\n if i == -1:\r\n c = -1\r\n break\r\n x = i\r\n c += 1\r\n if x == n-1:\r\n break\r\nprint(c)", "'''input\r\n12 3\r\n101111100101\r\n'''\r\nimport sys\r\nfrom math import *\r\nfrom copy import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom heapq import *\r\nfrom array import array\r\nINF = 2147483647\r\nINF64 = 9223372036854775807\r\ninput = sys.stdin.readline\r\ndef getstr(): return input().rstrip('\\r\\n')\r\ndef getint(): return int(input().strip())\r\ndef getints(): return list(map(int, input().strip().split()))\r\ndef impossible(): print(-1),exit(0)\r\n\r\ndef solve():\r\n\tn, k = getints()\r\n\ts = getstr()\r\n\tarr = list(map(int, list(s)))\r\n\tdp = [INF] * n\r\n\tdp[0] = 0\r\n\tfor i in range(1, n):\r\n\t\tif arr[i]==1:\r\n\t\t\tfor j in range(1, k+1):\r\n\t\t\t\tif i-j>=0:\r\n\t\t\t\t\tdp[i] = min(dp[i], dp[i-j]+1)\r\n\t\r\n\tif dp[n-1] == INF: dp[n-1] = -1\r\n\t# print(dp)\r\n\tprint(dp[n-1])\r\n\r\nif __name__==\"__main__\":\r\n\t# t = getint()\r\n\tfor i in range(1):\r\n\t\tsolve()", "import random\r\n\r\ndef jump(s, d, j):\r\n l = len(s)\r\n if l == 1:\r\n return j\r\n i = 1\r\n temp = 0\r\n while i<=d and i<l:\r\n if s[i] == '1':\r\n temp = i\r\n i+=1\r\n if temp == 0:\r\n return -1\r\n else:\r\n return jump(s[temp:], d, j+1)\r\n\r\n\r\ndef main():\r\n n, d = list(map(int, input().split()))\r\n s = input()\r\n j = jump(s, d, 0)\r\n print(j)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,d=map(lambda x:int(x),input().split())\r\nroad=input()\r\nlist=[int(x) for x in road]\r\nstep=d\r\nnum=0\r\nw=0\r\nt=False\r\nwhile step>0:\r\n if num+step>=n-1:\r\n print(w+1)\r\n t=True\r\n break\r\n else:\r\n if list[num + step] == 0:\r\n step -= 1\r\n else:\r\n num += step\r\n step = d\r\n w += 1\r\nif t==False:\r\n print(-1)", "n, d = map( int, input().split() )\r\ns = input()\r\n\r\n#dp = [0] * (n+d+5)\r\n#dp = [1] * (n+d+5)\r\ndp = [0] * n\r\nfor i in range( d+5 ):\r\n dp.append( 1 )\r\n\r\ni = n-2\r\n##while i>=0 and s[i] == '0':\r\n## i-=1\r\n##if dd+1-i>d:\r\n## print( -1 )\r\n## quit\r\n#dp[i] = 1\r\n\r\n\r\nwhile i>=0:\r\n dd = i\r\n while i>=0 and s[i] == '0':\r\n i-=1\r\n #print( \"gar\", dd+1-i, i )\r\n if dd+1-i>d:\r\n print( -1 )\r\n exit()\r\n mi = n+1\r\n for j in range( 1, d+1 ):\r\n if i+j<n and s[i+j] == '1' and dp[i+j]<mi:\r\n mi = dp[i+j]\r\n dp[i] = mi+1\r\n #print( i, dp )\r\n i -= 1\r\n#print( \"Atbilde\" )\r\nprint( dp[0] )\r\n", "def frog_jumps(n, d, s):\n dp = [float('inf')] * n\n dp[0] = 0 # The frog starts at point 1\n\n for i in range(1, n):\n if s[i] == '1':\n for j in range(max(0, i - d), i):\n if s[j] == '1':\n dp[i] = min(dp[i], dp[j] + 1)\n\n if dp[n - 1] == float('inf'):\n return -1 # Frog can't reach home\n else:\n return dp[n - 1]\n\n# Read input\nn, d = map(int, input().split())\ns = input()\n\nresult = frog_jumps(n, d, s)\nprint(result)\n\n \t \t \t\t \t \t\t \t \t \t \t\t \t", "n,d = map(int,input().split())\r\ns = input()\r\ni=0\r\ncnt=0\r\nif '0'*d in s:\r\n\tprint(-1)\r\nelse:\r\n\tcnt=0\r\n\ti=0\r\n\twhile i<n-1:\r\n\t\tif s[i]=='1':\r\n\t\t\ti+=d\r\n\t\t\tcnt+=1\r\n\t\telse:\r\n\t\t\ti-=1\r\n\tprint(cnt)", "length, d = map(int, input().split())\r\njump=d\r\ns = input()\r\npos=1\r\nans=0\r\nwhile pos<length:\r\n if pos+jump<=length and s[pos+jump-1]==\"1\":\r\n pos+=jump\r\n ans+=1\r\n jump=d\r\n\r\n else:\r\n jump-=1\r\n if jump==0:\r\n print(-1)\r\n break\r\nelse:\r\n print(ans)\r\n", "'''input\r\n12 3\r\n101111100101\r\n'''\r\nn,d = map(int,input().split())\r\n\r\ns = input()\r\n\r\ni = 0\r\ncount = 0\r\npossible = True\r\n\r\nwhile i<n-1:\r\n\tfor c in range(min(i+d,n-1),i,-1):\r\n\t\tif s[c]=='1':\r\n\t\t\tcount += 1\r\n\t\t\ti = c\r\n\t\t\tbreak\r\n\telse:\r\n\t\tpossible = False\r\n\t\t# print('Not possible')\r\n\t\tbreak\r\nif possible:\r\n\tprint(count)\r\nelse:\r\n\tprint(-1)\r\n", "nums = input().split()\r\nn = int(nums[0])\r\nd = int(nums[1])\r\n\r\nStr = str(input())\r\nmin_jumps = 0\r\ndp = []\r\nfor i in range(n):\r\n dp.append(float('inf'))\r\n\r\ndp[0] = 0\r\ndp[1] = 1\r\n\r\nfor i in range(2, n):\r\n for j in range(1, d + 1):\r\n if Str[i] == '1':\r\n if (dp[i - j] + 1) < dp[i]:\r\n dp[i] = dp[i - j] + 1\r\n else:\r\n break\r\n \r\n\r\nprev_indx = 0\r\n\r\nfor i in range(1, len(Str)):\r\n if Str[i] == '1':\r\n if (i - prev_indx) > d:\r\n min_jumps = -1\r\n break\r\n prev_indx = i\r\n min_jumps = dp[i]\r\n\r\nprint(min_jumps)", "import math,sys,time,random\nn,d = map(int,input().split())\na = input()\ni = 0\njump=0\nwhile i<n-1:\n i+=d\n j = i\n while j<n and a[j]!='1':\n j-=1\n jump+=1\n i=j\n if jump>a.count('1'):\n print(-1)\n sys.exit()\nprint(jump)\n\n", "n,d=map(int,input().split())\r\ns=list(input())\r\nk=0\r\nj=0\r\nwhile j<n:\r\n l=0\r\n for i in range(d,0,-1):\r\n if j+i<n and s[j+i]=='1':\r\n j=j+i\r\n k+=1\r\n l+=1\r\n break\r\n if j==n-1:\r\n print(k)\r\n break\r\n\r\n if l==0:\r\n print(-1)\r\n break\r\n \r\n \r\n \r\n\r\n\r\n\r\n", "n, d = map(int, input().split())\r\narr = list(map(int, input()))\r\nans = [-1 for i in range(n)]\r\nans[0] = 0\r\nfor i in range(1, n):\r\n m = n\r\n for j in range(max(i - d, 0), i):\r\n if ans[j] != -1 and ans[j] < m:\r\n m = ans[j]\r\n if m < n and arr[i] != 0:\r\n ans[i] = m + 1\r\n else:\r\n ans[i] = -1\r\nprint(ans[-1])\r\n", "n,d=map(int,input().split())\r\nl=input()\r\nc=[]\r\nfor i in range(n):\r\n if l[i]=='1':\r\n c.append(i)\r\nt=0\r\ni=1\r\ncount=0\r\nflag=True\r\nwhile i<len(c):\r\n if c[i]>t+d:\r\n if c[i-1]==t:\r\n flag=False\r\n break\r\n else:\r\n t=c[i-1]\r\n i-=1\r\n count+=1\r\n i+=1\r\nif flag==False:\r\n print(-1)\r\nelse:\r\n print(count+1)", "n, d = [int(i) for i in input().split()]\nlillies = [c for c in input()]\n\njumps = 0\nposition = 0\nwhile position < n - 1:\n\tcandidate_pos = position + d\n\tif candidate_pos >= n - 1:\n\t\tjumps += 1\n\t\tbreak\n\n\twhile lillies[candidate_pos] == '0':\n\t\tcandidate_pos -= 1\n\n\tif candidate_pos == position:\n\t\tjumps = -1\n\t\tbreak\n\tposition = candidate_pos\n\tjumps += 1\n\nprint(jumps)", "n,d=map(int,input().split())\r\ns=input()\r\ndef cal(n,d,s):\r\n if s[0]=='0' or s[-1]=='0':\r\n return -1\r\n st=0\r\n out=0\r\n temp=0\r\n while st<n:\r\n for i in range(st+1,min(n,st+d+1)):\r\n if s[i]=='1':\r\n temp=i\r\n if temp==st:\r\n return -1\r\n st=temp\r\n out+=1\r\n if st==n-1:\r\n return out\r\nprint(cal(n,d,s))", "m,n = list(map(int,input().split(' ')))\r\ns = input()\r\ndp = [float('inf') for i in range(m)]\r\ndp[0] = 0\r\nfor i in range(m-1):\r\n if s[i] == '0':\r\n continue\r\n for j in range(1,n+1):\r\n if i+j>m-1:\r\n continue\r\n if s[i+j] == '0':\r\n continue\r\n dp[i+j] = min(dp[i+j],dp[i]+1)\r\nprint(-1 if dp[-1]==float('inf') else dp[-1])", "def main():\r\n\tn,d = map(int,input().split())\r\n\tmainPath = list(map(int,input().strip()))\r\n\tcurrentPos,numJumps = 0,0\r\n\twhile currentPos < n-1 and numJumps<n:\r\n\t\tif mainPath[currentPos] == 1:\r\n\t\t\tnumJumps += 1\r\n\t\t\tcurrentPos += d\r\n\t\telse:\r\n\t\t\tcurrentPos -= 1\r\n\tif numJumps>=n:\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(numJumps)\r\n\r\nmain()", "n, d = [int(s) for s in input().split(' ')]\r\nl = input()\r\nf = 0\r\nj = 0\r\nwhile f < n - 1:\r\n if '1' not in l[f + 1: f + d + 1]:\r\n j = - 1\r\n break\r\n else:\r\n index = l[f + 1: f + d + 1].rindex('1')\r\n j += 1\r\n f += index + 1\r\nprint(j)\r\n", "length, jump_max = list(map(int, input().strip().split()))\r\nstring = input()\r\nhop = 0\r\nwhile True:\r\n\r\n if len(string) == 1:\r\n print(hop)\r\n break\r\n try:\r\n for i in range(jump_max, 0, -1):\r\n if string[i] == \"1\":\r\n hop += 1\r\n string = string[i:]\r\n\r\n break\r\n else:\r\n\r\n print(-1)\r\n break\r\n\r\n except IndexError:\r\n hop += 1\r\n print(hop)\r\n break\r\n\r\n", "n, d = map(int, input().split())\nmagic_map = input()\n\nteleports = [float('inf')] * n\nteleports[0] = 0\n\nfor i in range(1, n):\n if magic_map[i] == '1':\n for j in range(i - d, i):\n if j >= 0:\n teleports[i] = min(teleports[i], teleports[j] + 1)\n\nif teleports[n - 1] == float('inf'):\n print(-1)\nelse:\n print(teleports[n - 1])\n\n \t \t\t\t \t \t \t\t\t\t\t \t \t \t \t", "n,d=map(int,input().split())\ns=input()\nrj=[]\ninf=float('INF')\n\nfor i in range(n):\n rj.append(inf)\nrj[0]=0\nfor i in range(n):\n if s[i]=='1':\n for j in range(1,d+1):\n if i+j<n and s[i+j]=='1':\n \n rj[i+j]=min(rj[i]+1,rj[i+j])\n\nif rj[-1]>1000:\n print(-1)\nelse:\n print(rj[-1])\n\n\n \t \t \t\t \t \t\t\t \t \t \t", "n,k=[int(i) for i in input().split()]\r\na=[int(i) for i in input()]\r\nflag=0 ; i=0 ; ans=0\r\nwhile i<len(a)-1:\r\n cur=-1\r\n for j in range(i+1,min(len(a),i+k+1)):\r\n if a[j]==1:\r\n cur=j\r\n if cur==-1:\r\n print(cur)\r\n flag=1\r\n break\r\n else:\r\n ans+=1\r\n i=cur\r\nif flag==0: print(ans)\r\n \r\n \r\n \r\n ", "n,d=map(int,input().split())\r\ns='1'+input()\r\nx=1\r\nk=1\r\nwhile x+d<n:\r\n i=d\r\n while s[i+x]=='0':\r\n i-=1\r\n if i==0:\r\n k=-1\r\n break\r\n else:\r\n x+=i\r\n k+=1\r\n continue\r\n break\r\nprint(k)", "INF = 10**9\r\n\r\n\r\ndef solve(n, d, s):\r\n dp = [INF for _ in range(n)]\r\n dp[0] = 0\r\n for i in range(n):\r\n if s[i] == \"1\":\r\n for a in range(1, d + 1):\r\n if i - a >= 0:\r\n dp[i] = min(dp[i], dp[i - a] + 1)\r\n else:\r\n break\r\n print(dp[-1] if dp[-1] != INF else -1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, d = map(int, input().split())\r\n s = input()\r\n solve(n, d, s)\r\n", "def pular(mapa,pulo,atual,fim):\n if (atual==fim): return 0\n\n\n novoPos=-1\n result=-1\n \n for i in range(1,pulo+1):\n if (atual+i>fim): break\n if (mapa[atual+i]==\"1\"): novoPos=atual+i\n \n if (novoPos==-1): return -1\n \n subResult = pular(mapa,pulo,novoPos,fim)\n if (subResult==-1): return -1\n\n return subResult+1\n\ndist,jump = map(int,input().split())\n\nmapa = input()\n\nprint(pular(mapa,jump,0,dist-1))\n\n\t\t \t \t\t \t\t \t \t \t \t\t\t\t", "from sys import stdin\r\ninput = stdin.readline\r\nn, d = map(int, input().split())\r\ns = input()\r\ndp = [0 for i in range(n)]\r\ndp[0] = 0\r\ncanGo = False\r\nfor i in range(1, n):\r\n\tif s[i] == '1':\r\n\t\tc = d\r\n\t\tj = i-1\r\n\t\tm = (1<<31)\r\n\t\twhile j >= 0 and c > 0:\r\n\t\t\tif s[j] == '1':\r\n\t\t\t\tm = min(m, dp[j])\r\n\t\t\tj -= 1\r\n\t\t\tc -= 1\r\n\t\tif m == (1<<31):\r\n\t\t\tcanGo = True\r\n\t\t\tbreak\r\n\t\tdp[i] = m + 1\r\nif canGo == True:\r\n\tprint(-1)\r\nelse:\r\n\tprint(dp[n-1])\r\n\t\t", "n, k = map(int,input().split())\r\nn = n - 1\r\nsp = input()\r\nnast = 0\r\nkol = 0\r\nwhile nast < n:\r\n\tfor i in range(k, -1, -1):\r\n\t\tif i == 0:\r\n\t\t\tprint(-1)\r\n\t\t\texit()\r\n\t\tif nast + i < n+1:\r\n\t\t\tz = sp[nast + i]\r\n\t\t\tif z == '1':\r\n\t\t\t\tnast += i\r\n\t\t\t\tkol += 1\r\n\t\t\t\tbreak\r\nprint(kol)\r\n", "def main():\r\n\tn, d = map(int, input().split())\r\n\tOx = input()\r\n\tpos = 0\r\n\tres = 0\r\n\twhile(pos < n-1):\r\n\t\tnew_pos = Ox[pos+1:pos+1+d].rfind(\"1\")\r\n\t\tif new_pos == -1:\r\n\t\t\tprint(-1)\r\n\t\t\treturn\r\n\t\telif new_pos != -1:\r\n\t\t\tpos += new_pos + 1\r\n\t\t\tres += 1\r\n\tprint(res)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "n,d = map(int,input().split())\r\ns = input()\r\nls = list(s)\r\ni = 0\r\ncnt = 0\r\nwhile True:\r\n j = d\r\n if i+j>=len(ls):\r\n j = len(ls) - i-1\r\n while j > 0:\r\n if ls[i+j] == '1':\r\n i += j\r\n cnt += 1\r\n break\r\n j -= 1\r\n else:\r\n cnt = -1\r\n break\r\n if i >= len(ls)-1:\r\n break\r\nprint(cnt)", "n,d=map(int,input().split())\r\na=input()\r\ndp=[1e6]*n \r\ndp[0]=0\r\nfor i in range(1,n):\r\n if a[i]=='0':\r\n continue \r\n for j in range(1,d+1):\r\n if i-j<0:\r\n break\r\n else:\r\n dp[i]=min(dp[i],dp[i-j]+1)\r\nif dp[-1]==1e6:\r\n print(-1)\r\nelse:\r\n print(dp[-1])\r\n ", "n, d = map(int, input().split()) #ponto a ser alcançado, distância máxima permitida.\nmagic_stones = list(map(int, input().strip()))\nteleports = [float('inf')] * n \nteleports[0] = 0 \n\nfor i in range(n):\n if magic_stones[i] == 1:\n for j in range(1, d + 1):\n if i + j < n:\n teleports[i + j] = min(teleports[i + j], teleports[i] + 1)\n\nif teleports[n - 1] == float('inf'):\n print(-1)\nelse:\n print(teleports[n - 1])\n \t \t \t \t\t\t\t\t\t \t \t\t \t \t\t\t \t", "a,b = map(int,input().split())\r\n\r\n\r\n\r\n\r\nt = list(input())\r\n\r\n\r\n\r\n\r\nif t[-1]!='1':\r\n print(-1)\r\nelse:\r\n\r\n f=[]\r\n\r\n\r\n for i in range(a):\r\n if t[i]=='1':\r\n f.append(i)\r\n\r\n y=0\r\n u=0\r\n g=0\r\n while y!= a-1:\r\n x=0\r\n for j in f[::-1]:\r\n if y<j<=y+b:\r\n y=j\r\n u+=1\r\n x+=1\r\n break\r\n if x==0:\r\n print(-1)\r\n g+=1\r\n break\r\n\r\n if g==0:\r\n print(u)\r\n", "def min_teleports(map, x, y):\n posicao = 1\n \n teleports = 0\n\n while posicao < x:\n resp = False\n for prox_pos in range(posicao + y, posicao, -1):\n \n if prox_pos <= x and map[prox_pos - 1] == '1':\n posicao = prox_pos\n teleports += 1\n resp = True\n break\n\n if not resp:\n return -1\n\n return teleports\n\nx, y = map(int, input().split())\nmap = input().strip()\n\nprint(min_teleports(map, x, y ))\n\t\t\t \t\t\t\t \t \t\t \t \t\t \t \t \t", "n, d = map(int, input().split())\r\ns = input()\r\nindex = []\r\nfor i in range(len(s)):\r\n if s[i] == '1':\r\n index.append(i)\r\ndp = [0] * len(index)\r\ne = 0\r\nans = 0\r\nwhile e < len(index):\r\n base = index[e] + d\r\n use = e\r\n for i in range(e, len(index)):\r\n if index[i] <= base:\r\n use = i\r\n else:\r\n break\r\n if use == e:\r\n ans = -1\r\n break\r\n elif use < len(index) - 1 and use != e:\r\n dp[e] = dp[use] + 1\r\n e = use\r\n elif use == len(index) - 1:\r\n dp[e] = dp[use] + 1\r\n break\r\nif ans != -1:\r\n ans = sum(dp)\r\nprint(ans)\r\n\r\n", "n,d=map(int,input().split())\ns=list(map(int,input()))\nans=0\naa=0\nwhile 1:\n bb=max(ii for ii in range(aa,min(aa+d+1,n)) if s[ii])\n if bb>aa:\n ans+=1\n aa=bb\n else:\n break\nprint(-1 if aa<n-1 else ans)\n\t\t\t \t\t \t\t\t \t\t \t\t \t\t \t\t\t\t", "line = input().split()\r\nn = int(line[0])\r\nd = int(line[1])\r\ntree = [[] for i in range(n)]\r\nline1 = str(input())\r\nindex = int(0)\r\ntemp = int(0)\r\ncount = int(0)\r\ncek = int(1)\r\nfor i in range(1, n):\r\n if line1[i] == '1':\r\n tree[index].append(i)\r\n temp = i\r\n count += 1\r\n if count == d:\r\n if index == temp:\r\n cek = 0\r\n break\r\n else:\r\n count = i - temp\r\n index = temp\r\n##print(tree)\r\nstep = int(-1)\r\nif cek:\r\n q = [0]\r\n while len(q) > 0:\r\n if len(tree[q[0]]) > 0:\r\n q += [tree[q[0]][len(tree[q[0]]) - 1]]\r\n step += 1\r\n q.pop(0)\r\n\r\nprint(step)", "#\t!/bin/env python3\r\n#\tcoding: UTF-8\r\n\r\n\r\n#\t✪ H4WK3yE乡\r\n#\tMohd. Farhan Tahir\r\n#\tIndian Institute Of Information Technology and Management,Gwalior\r\n\r\n#\tQuestion Link\r\n#\thttps://codeforces.com/problemset/problem/910/A\r\n#\r\n\r\n# ///==========Libraries, Constants and Functions=============///\r\n\r\n\r\nimport sys\r\nsys.setrecursionlimit(2000)\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 recurse():\r\n for i in range(2, n+1):\r\n if arr[i-1] == '1':\r\n for j in range(d+1):\r\n if i-j >= 1:\r\n dp[i] = min(dp[i], 1+dp[i-j])\r\n return dp[n] if dp[n] != inf else -1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, d = get_ints()\r\n arr = input()\r\n dp = [inf]*(n+1)\r\n dp[1] = 0\r\n print(recurse())\r\n", "n, d = map(int, input().split())\r\ns = input()\r\n\r\nnodes = [i for i in range(n) if s[i] == '1']\r\nbest = [None] * len(nodes)\r\n\r\n\r\ndef find_best(node_idx):\r\n if best[node_idx]:\r\n return best[node_idx]\r\n\r\n if node_idx == len(nodes) - 1:\r\n return 0\r\n\r\n if n - nodes[node_idx] <= d:\r\n return 1\r\n\r\n cases = [find_best(idx) for idx in range(node_idx + 1, len(nodes)) if nodes[idx] - nodes[node_idx] <= d]\r\n\r\n if cases:\r\n best[node_idx] = min(cases) + 1\r\n return best[node_idx]\r\n else:\r\n return float(\"inf\")\r\n\r\n\r\nres = find_best(0)\r\nif res == float('inf'):\r\n print(-1)\r\nelse:\r\n print(res)\r\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\n\r\ndef main():\r\n\tn, d = map(int, input().split())\r\n\ts = input()\r\n\ti = 0\r\n\tcnt = 0\r\n\twhile 1:\r\n\t\tmaxi = i + d\r\n\t\tif maxi >= n - 1:\r\n\t\t\tcnt += 1\r\n\t\t\tbreak\r\n\t\tfound = False\r\n\t\tfor j in range(maxi, i, -1):\r\n\t\t\tif s[j] != '0':\r\n\t\t\t\ti = j\r\n\t\t\t\tcnt += 1\r\n\t\t\t\tfound = True\r\n\t\t\t\tbreak\r\n\t\tif not found:\r\n\t\t\tprint(-1)\r\n\t\t\texit()\r\n\tprint(cnt)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n\t", "n,d=map(int,input().split())\na=[1000]*(n+1)\na[0]=0\ns=[int(x) for x in input()]\nfor x in range(1,n):\n if s[x]:\n for c in range(1,d+1):\n if x-c >= 0 and s[x-c]:\n a[x]=min(a[x-c]+1,a[x])\nprint(-1 if a[n-1] > 200 else a[n-1])", "#\n# Joseph Matsushita\n# Problem A\n#\n\nn, d = map(int, input().split())\npads = list(input())\n\ncur = 0 #start at pad 1 (represented as pad 0)\ncount = 0\ngood = True #turns false if the frog cannot reach a pad\n#strategy is simple, greedily pick the rightmost pad the frog can jump to\n\nwhile(good and cur + d < n - 1): #can we reach the destination in 1 hop?\n i = d\n while(i > 0): #check the farthest location first, then work backwards\n if pads[cur+i] == '1': #pad located\n cur += i\n count += 1\n break\n else:\n i -= 1\n if(i == 0): #no pad was found\n good = False\nif(not good):\n print(-1)\nelif(cur == n):\n print(count)\nelse:\n print(count+1) #include the hop to the last pad\n \t \t \t\t \t\t\t \t \t", "n,d=map(int,input().split())\r\na=list(input())\r\np=0\r\ncount=0\r\nc2=0\r\ni=0\r\nwhile i <(n-d):\r\n c=[]\r\n for j in range(i+1,i+d+1):\r\n if a[j]=='1':\r\n c.append(j-i)\r\n else:\r\n j+=1\r\n if len(c)==0:\r\n c2+=1\r\n print(-1)\r\n break\r\n else:\r\n count+=1\r\n v=max(c)\r\n i+=v\r\nif c2==0 and i==n-1:\r\n print(count)\r\nelif c2==0 and i!=n-1:\r\n print(count+1)", "n,d = [int(x) for x in input().split()]\r\ns = input()\r\na = [99999] * 150\r\nif(s[0] == '1'): a[0] = 0\r\nfor i in range(n):\r\n if(s[i] == '1'):\r\n for x in range(i + 1,min(i + d + 1,n)):\r\n if(s[x] == '1'):\r\n a[x] = min(a[x],a[i] + 1)\r\n #print(a[i],end=' ')\r\nif(a[n - 1] == 99999): print(\"-1\")\r\nelse: print(a[n - 1])\r\n \r\n \r\n", "n,d=list(map(int,input().split()))\r\ns=input()\r\ndp=[0]*(len(s))\r\nfor i in range(1,d+1):\r\n if s[i]==\"1\":\r\n dp[i]=1\r\ndp[0]=1\r\n# print(dp)\r\nfor i in range(d+1,len(s)):\r\n if s[i]==\"0\":\r\n dp[i]=0\r\n else:\r\n curmin=0\r\n for j in range(i-d,i):\r\n if s[j]!=\"0\" :\r\n if curmin==0 and dp[j]!=0:\r\n curmin=dp[j]\r\n elif curmin!=0 and dp[j]!=0:\r\n curmin=min(curmin,dp[j])\r\n else:\r\n continue\r\n if curmin==0:\r\n dp[i]=0\r\n else:\r\n dp[i]=curmin+1\r\n\r\nif dp[-1]!=0:\r\n print(dp[-1])\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\nm = input()\njumps = iterator = p = 0\n \nwhile iterator < n:\n if m[iterator] == '1':\n jumps += 1\n p = iterator\n iterator += d\n else:\n while iterator != p and m[iterator] == '0' or iterator >= n:\n iterator -= 1\n if iterator == p:\n exit(print(-1))\n \nif p != n-1:\n jumps += 1\n \nprint(jumps-1)\n\t\t\t\t \t \t \t\t \t \t \t \t", "n, d = map(int, input().split())\r\ns = input()\r\n\r\na = [(n + 1)] * n\r\n\r\na[0] = 0\r\nfor i in range(1, n):\r\n if s[i] == '1':\r\n for j in range(max(0, i - d), i):\r\n a[i] = min(a[i], a[j] + 1)\r\n\r\nprint(a[n - 1] if a[n - 1] < n else -1)", "n,d=map(int,input().split())\r\ns=list(input())\r\ni=0\r\nj=d \r\nans=0\r\nwhile(j>i and i<n):\r\n if s[j]=='1':\r\n ans+=1\r\n i=j\r\n j=min(n-1,j+d)\r\n else:\r\n j-=1\r\nif j!=n-1:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n ", "class axis:\r\n def __init__(self, lilies):\r\n self.line = lilies\r\n\r\n\r\nclass frog:\r\n def __init__(self, d, my_axis):\r\n self.axis = my_axis\r\n self.d = d\r\n self.point = 0\r\n\r\n def jump(self):\r\n for i in range(self.point + self.d, self.point, -1):\r\n if i >= len(self.axis.line):\r\n continue\r\n\r\n if self.axis.line[i] == '1':\r\n self.point = i\r\n return True\r\n\r\n return False\r\n\r\n\r\nn, d = [int(i) for i in input().split()]\r\nlilies = input().strip()\r\n\r\nmy_axis = axis(lilies)\r\nmy_frog = frog(d, my_axis)\r\n\r\njump_count = 0\r\n\r\nwhile my_frog.point < n - 1:\r\n if my_frog.jump():\r\n jump_count += 1\r\n else:\r\n jump_count = -1\r\n break\r\n\r\nprint(jump_count)\r\n", "n,d=list(map(int,input().split()))\r\ns=input()\r\ncnt=0\r\ni=0\r\na='NO'\r\nwhile True:\r\n if i>=(len(s)-1):\r\n print(cnt)\r\n break\r\n else:\r\n for j in range(d,0,-1):\r\n if i+j<len(s) and s[i+j]=='1':\r\n i+=j\r\n cnt+=1\r\n break\r\n else:\r\n print(-1)\r\n break", "n,d=map(int,input().split())\r\ns=input()\r\ni=0\r\nans=1\r\ncount=0\r\nwhile i!=n-1:\r\n flag=0\r\n j=i+d\r\n count+=1\r\n while j>i:\r\n \r\n if j<n and s[j]=='1':\r\n flag=1\r\n break\r\n j-=1\r\n # print(i,j)\r\n if flag==1:\r\n i=i+(j-i)\r\n else:\r\n ans=0\r\n break\r\nif ans==0:\r\n print(-1)\r\nelse:\r\n print(count)\r\n\r\n\r\n \r\n\r\n\r\n\r\n \r\n", "n,d=map(int,input().split())\r\narr=list(input())\r\ncount=0 \r\ni=0\r\nwhile(i<n and i!=(n-1)):\r\n k=i+d \r\n if k>=n:\r\n k=n-1 \r\n val=0\r\n for j in range(k,i,-1):\r\n if arr[j]==\"1\":\r\n i=j \r\n val=1 \r\n count+=1 \r\n break \r\n if val==1:\r\n pass\r\n else:\r\n print(\"-1\")\r\n break\r\nif i==(n-1):\r\n print(count) \r\nelse:\r\n pass", "n, d = map(int, input().split())\r\ns = input()\r\n\r\nw = [n+1]*n\r\nw[0] = 0\r\nfor i in range(1, n):\r\n if s[i] == '1':\r\n for j in range(max(0, i-d), i):\r\n w[i] = min(w[i], w[j]+1)\r\n\r\nprint(w[-1] if w[-1] < n else -1)", "a,b = list(map(int,input().split()))\r\ninp1 = input()\r\nzeroes = \"0\"*b\r\nif zeroes in inp1:\r\n print(-1)\r\nelse:\r\n steps = 0\r\n jumps = 0\r\n while steps < a-1 and jumps < a:\r\n if inp1[steps] == \"1\":\r\n steps+=b\r\n jumps+= 1\r\n else:\r\n steps -= 1\r\n print(jumps)", "n,d=map(int,input().split())\r\ns=input()\r\nif d==n-1:\r\n print(1)\r\nelse:\r\n curr=0\r\n count=0\r\n while curr<n-1:\r\n for i in range(d,0,-1):\r\n if curr+i<=n-1 and s[curr+i]=='1':\r\n curr+=i\r\n count+=1\r\n break\r\n else:\r\n print(-1)\r\n break\r\n if curr==n-1:\r\n print(count)", "n, d = map(int, input().split())\r\ns = input()\r\nl = []\r\nans = 1\r\n\r\nfor i in range(n):\r\n if s[i] == '1':\r\n l.append(i+1)\r\n\r\ndef foo(x):\r\n k = []\r\n c = l.index(x)\r\n for f in range(c+1, len(l)):\r\n if l[f] - x <= d:\r\n k.append(l[f])\r\n else:\r\n break \r\n \r\n if len(k) == 0:\r\n return False\r\n else: \r\n return k[-1]\r\n\r\nu = 0\r\nwhile True:\r\n if u == 0:\r\n v = foo(l[0])\r\n u = v\r\n else:\r\n v = foo(u)\r\n u = v\r\n\r\n if v == False:\r\n ans = -1\r\n break\r\n elif v == l[-1]:\r\n break\r\n else:\r\n ans += 1\r\n\r\nprint(ans)", "n, d = map(int, input().split())\r\ns = input()\r\npos, ans = 1, 0 \r\nwhile pos < n:\r\n i = min(n - 1, pos + d - 1)\r\n while s[i] == '0':\r\n i -= 1 \r\n \r\n if (i + 1) == pos:\r\n print(-1)\r\n break\r\n\r\n pos = i + 1 \r\n ans += 1\r\nelse:\r\n print(ans)", "n, d = map(int, input().split())\r\nlilies = list(map(int, input()))\r\n\r\ndp = [n+1] * (n + 1)\r\ndp[0] = dp[1] = 0\r\n\r\nfor i in range(2, n + 1):\r\n if lilies[i - 1] == 1:\r\n for j in range(max(0, i - d),i):\r\n dp[i] = min(dp[i], dp[j] + 1)\r\n\r\nif dp[n] > n:\r\n print(-1)\r\nelse:\r\n print(dp[n])", "n, d = input().split()\r\nn = int(n)\r\nd = int(d)\r\nmas = [int(i) for i in input()]\r\nres = 0\r\nk = 0\r\nwhile k<n-1:\r\n\tb = False\r\n\ti=d\r\n\twhile i>0:\r\n\t\ttry:\r\n\t\t\tif mas[i+k]==1:\r\n\t\t\t\tk+=i\r\n\t\t\t\tres+=1\r\n\t\t\t\tb = True\r\n\t\t\t\tbreak\r\n\t\texcept: pass\r\n\t\ti-=1\r\n\tif not b:\r\n\t\tprint(-1)\r\n\t\tbreak\r\nif b:\r\n\tprint(res)", "n, d = map(int, input().split())\r\ns = ' ' + input()\r\nans = 0\r\nx = 1\r\ny = 1\r\nwhile x != n:\r\n for i in range(d, 0, -1):\r\n if x + i > n:\r\n continue\r\n if s[x + i] == '1':\r\n y = x + i\r\n break\r\n ans += 1\r\n if y == x:\r\n ans = -1\r\n break\r\n x = y\r\nprint(ans)\r\n", "n, d = (int(i) for i in input().split())\ns = input()\nres, i = 0, 0\nwhile i < n - 1:\n for j in reversed(range(i + 1, min(n, i + 1 + d))):\n if s[j] == \"1\":\n res += 1\n i = j\n break\n else:\n res = -1\n break\nprint(res)\n", "n,d=map(int,input().split())\r\ns=input()\r\ni=0\r\nj=0\r\nflag=0\r\nwhile i<n:\r\n if i==n-1:\r\n print(j)\r\n break\r\n for k in range(d,0,-1):\r\n if i+k<n:\r\n if s[i+k]=='1':\r\n j+=1\r\n i+=k\r\n break\r\n if k==1:\r\n if i+k<n:\r\n if s[i+k]!='1':\r\n flag=1\r\n break\r\n else:\r\n i+=1\r\n break\r\n if flag==1:\r\n print(-1)\r\n break\r\n \r\n ", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\ndef solve(n,d,s):\r\n ans=i=0\r\n while i<n-1:\r\n j=k=i\r\n for _ in range(d):\r\n j+=1\r\n if j==n:\r\n break\r\n if s[j]=='1':\r\n k=j\r\n if i==k:\r\n return -1\r\n ans+=1\r\n i=k\r\n return ans\r\n\r\nn,d=ris()\r\ns=rl()\r\nprint(solve(n,d,s))\r\n", "# LUOGU_RID: 133255425\nn,d=map(int,input().split())\ns=input()\na=[]\nfor i in range(n):\n if s[i]=='1':\n a.append(i)\ns=0\nnw=0\nfor i in range(1,len(a)):\n if a[i]-a[i-1]>d:\n print(-1)\n exit()\na.append(1<<31)\nfor i in range(len(a)-1):\n if a[i+1]-nw>d:\n nw=a[i]\n s+=1\nprint(s)", "a=list(map(int,input().strip().split()))\r\nb=input()\r\npos=0\r\nstep=0\r\nwhile pos!=a[0]-1:\r\n if pos+a[1]>=a[0]-1:\r\n if b[-1]==\"1\":\r\n step+=1\r\n pos=a[0]-1\r\n else:\r\n pos=a[0]-1\r\n step=-1\r\n else:\r\n try:\r\n out=b[pos+1:pos+a[1]+1].rindex(\"1\")\r\n except:\r\n step=-1\r\n pos=a[0]-1\r\n else:\r\n out=b[pos+1:pos+a[1]+1].rindex(\"1\")\r\n step+=1\r\n pos+=out+1\r\nprint(step)", "n,d=map(int,input().split())\r\na=list(map(int,input()))\r\nb=[i for i in range(n) if a[i]]\r\nj=len(b)\r\nans=0\r\np=0\r\nwhile p<n-1:\r\n t=p+d\r\n i=0\r\n while i<j and b[i]<=t:\r\n i+=1\r\n i-=1\r\n # print(b[i],p)\r\n if p==b[i]:\r\n exit(print(-1))\r\n p=b[i]\r\n ans+=1\r\nprint(ans)\r\n", "n, d = map(int, input().split())\r\ns = input()\r\ni = 0\r\ni2 = 0\r\nres = 0\r\nwhile i != n - 1:\r\n i2 = i + d\r\n while i2 != i:\r\n if i2 < len(s) and s[i2] == \"1\":\r\n break\r\n i2 -= 1\r\n else:\r\n print(-1)\r\n break\r\n i = i2\r\n res += 1\r\nelse:\r\n print(res)\r\n", "target, jump = list(map(int, input().split(' ')))\nway = list(input())\n\ncounter = 0\nprevious = 0\npos = jump\n\nwhile pos > previous:\n if(pos <= target-1 and way[pos] == '1'):\n counter += 1\n previous = pos\n pos = previous + jump + 1\n pos -= 1\n\nif pos < target-1:\n print(\"-1\")\n\nelse:\n print(counter)\n \t \t\t\t\t \t \t\t \t \t\t \t", "n, d = map(int, input().split())\nlily = list(map(int, input()))\n\n\ndef ans(lily, d):\n dp = [0]\n for i in range(1, d + 1):\n dp.append(1000 if lily[i] == 0 else lily[i])\n # print(dp)\n for i in range(d + 1, n):\n if lily[i] == 0:\n # you cannot reach this square\n dp.append(1000)\n else:\n # print(dp[len(dp) - 1:len(dp) - d:-1])\n l = min(dp[len(dp) - 1:len(dp) - d - 1:-1])\n if l == 1000:\n dp.append(1000)\n else:\n dp.append(l + 1)\n # print(dp)\n return -1 if dp[-1] == 1000 else dp[-1]\n\n\nprint(ans(lily, d))\n", "def iinput():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\nn, d = iinput()\r\nmas = input()\r\n\r\ndp = [n + 1 for i in range(n)]\r\ndp[0] = 0\r\nfor i in range(1, n):\r\n if mas[i] == \"1\":\r\n dp[i] = min(dp[max(0, i - d):i]) + 1\r\n if dp[i] >= n + 1:\r\n print(-1)\r\n break\r\nelse:\r\n print(dp[-1])\r\n\r\n", "n, d = map(int,input().split())\r\ns = input()\r\nj = 1\r\nv = 0\r\nwhile j <= n:\r\n\tflag = 0\r\n\tfor i in range(d,0,-1):\r\n\t\t# print(i)\r\n\t\tif i+j-1 >= n:\r\n\t\t\tcontinue\r\n\t\tif s[i+j-1] == \"1\":\r\n\t\t\tj = i+j\r\n\t\t\t# print(j)\r\n\t\t\tflag = 1\r\n\t\t\tv+=1\r\n\t\t\tbreak\r\n\tif flag == 0:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\tif j == n:\r\n\t\tprint(v)\r\n\t\texit()\r\nprint(-1)\r\n", "n , d = map(int, input().split())\ns = input()\ndp = [n+1 for i in range(n)]\ndp[0] = 0\nfor i in range(n):\n if dp[i] != n + 1:\n for jump in range(d, 0, -1):\n if i + jump < n and s[i + jump] == '1':\n dp[i + jump] = min(1 + dp[i], dp[i + jump])\n break\nif dp[n - 1] == n + 1:\n print(-1)\nelse:\n print(dp[n - 1])\n", "n,m=map(int,input().split())\nk=input()\np=0\nc=0\nwhile p!=n-1:\n i=p\n h=m\n while h!=0:\n if i+h<n:\n if k[i+h]=='1':\n p=i+h\n c+=1\n\n break\n h-=1\n if i-p==0 and p!=n-1:\n print(-1)\n break\n elif(p==n-1):\n print(c)\n \n", "in1 = input().split()\nn = int(in1[0])\nd = int(in1[1])\nin2 = list(input())\nin2 = list(map(int,in2))\np = 0\nwin = len(in2)-1\nnn = 0\nwhile p<win:\n outt = 0 #开关\n if p+d>=n:\n nn+= 1\n break\n k = p\n for i in range(d):\n if in2[p+d-i] == 1:\n p = p+d-i\n outt = 1\n nn+= 1\n break\n if outt == 1:\n break\n if k==p:\n nn = -1\n break \nprint(nn)\n \n \n\t\t\t \t\t \t \t\t \t\t\t \t \t\t \t \t\t", "from sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque\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 n,m = II()\r\n \r\n arr = list(map(int,input()))\r\n \r\n loc = 0 \r\n count = 0\r\n \r\n def inbound(row):\r\n return row < n \r\n \r\n queue = deque([0])\r\n \r\n while queue:\r\n count += 1\r\n \r\n \r\n node = queue.popleft()\r\n \r\n for i in range(m,0,-1):\r\n pos = i + node \r\n if pos >= n-1:\r\n print(count)\r\n return \r\n \r\n \r\n if inbound(pos) and arr[pos] == 1:\r\n queue.append(pos)\r\n break \r\n print()\r\n \r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\nsolve()\r\n", "n, d = map(int, input().split())\ns = input()\n\ndp = [float('inf')] * n\ndp[0] = 0\n\nfor i in range(1, n):\n if s[i] == '1':\n for j in range(1, d + 1):\n if i - j >= 0 and s[i - j] == '1':\n dp[i] = min(dp[i], dp[i - j] + 1)\n\nif dp[n - 1] == float('inf'):\n print(-1)\nelse:\n print(dp[n - 1])\n\n \t\t \t \t\t \t \t\t \t \t\t\t \t\t\t", "n, d = map(int, input().split())\r\ns = input()\r\nif '0' * d in s:\r\n print(-1)\r\n exit()\r\nox = 0\r\nanswer = 0\r\nwhile ox < n - 1:\r\n ox = s[:ox + d + 1].rfind('1')\r\n answer += 1\r\nprint(answer)\r\n", "n, d = map(int, input().split())\r\na = list(map(int, input())) + [0] * 200\r\nb = [10 ** 9] * 202\r\nb[0] = 0\r\nfor i in range(n):\r\n for j in range(1, d + 1):\r\n if a[i] == 1 and a[i + j] == 1:\r\n b[i + j] = min(b[i] + 1, b[i + j])\r\nprint(b[n - 1] if b[n - 1] != 10 ** 9 else -1)\r\n", "def main():\n n, d = list(map(int, input().split()))\n\n path = input()\n\n position = 0\n tps = 0\n\n while (position < n - 1):\n position = search(d, path, position, n)\n tps += 1\n if(position == -1):\n tps = -1\n break\n\n print(tps)\n \ndef search(d, path, position, n):\n for i in range(d , 0, -1):\n if(position + i < n and path[position + i] == \"1\"):\n return position + i\n\n return -1\n\n\nmain()\n\t \t \t \t \t \t\t \t \t\t\t\t", "n,d = map(int,input().split())\r\na = [int(i) for i in input()]\r\nans = [float('inf') for i in range(n)]\r\nans[0] = 0\r\nfor i in range(n):\r\n\tfor j in range(i+1,i+1+d):\r\n\t\tif j<n:\r\n\t\t\tif a[j]==1:\r\n\t\t\t\tans[j] = min(ans[j],ans[i]+1)\r\nif ans[n-1]<float('inf'):\r\n\tprint(ans[n-1])\r\nelse:\r\n\tprint(-1)", "n,d = list(map(int,input().split()))\n\ninn = list(input())\ninn = list(map(int,inn))\ninn.insert(0,float('inf'))\n\nfor i in range(len(inn)):\n if inn[i] == 0:\n inn[i] = float('inf')\n\ninn[1] = 0\nfor i in range(1,n+1):\n if inn[i] == 1:\n if i-d < 0:\n inn[i] = min(inn[0:i])+1\n else:\n inn[i] = min(inn[i-d:i])+1\n \nif inn[-1] == float('inf'):\n print(-1)\nelse:\n print(inn[-1])\n \t \t\t\t\t\t \t \t\t\t\t\t\t \t\t\t\t", "def bin_search(b,k):\n\tans = 0\n\t# print(k)\n\tl,r=0,len(b)-1\n\twhile l<=r:\n\t\tmid =(l+r)//2\n\t\tif b[mid]<=k:\n\t\t\tans = mid\n\t\t\tl=mid+1\n\t\telse:\n\t\t\tr = mid-1\n\treturn ans\nn,d = [int(n) for n in input().split()]\ns = input()\nb = []\nfor i in range(len(s)):\n\tif s[i]==\"1\":\n\t\tb.append(i)\n# c =0\nf =0\ni =0\nx = 0\nc =0\nbl = 0\nfor i in range(1,len(b)):\n\tif b[i-1]+d<b[i]:\n\t\tf=1\n\t\tbreak\nif f==0:\n\ti=0\n\twhile i<len(b):\n\t\tx = bin_search(b,b[i]+d)\n\t\t# print(x)\n\t\t# print(b[x],end=' ')\n\t\ti = x\n\t\tc+=1\n\t\tif x==len(b)-1:\n\t\t\tbreak\n# print(i)\nif f==1 or b[i]!=n-1:\n\tc=-1\n# print(b)\nprint(c)\n\n'''\n1001101000\nb = [0,3,4,6]\n\n'''\n\n", "n,d=map(int,input().split())\r\ns=input()\r\nf=[0]*(n)\r\nm=0\r\nk=[]\r\nfor i in s:\r\n k.append(int(i))\r\nfor i in range(0,d+1):\r\n if k[i]==1:\r\n f[i]=1\r\nfor i in range(d+1,n):\r\n if k[i]==1:\r\n lo=[]\r\n for j in range(i-d,i):\r\n if f[j]!=0:\r\n lo.append(f[j])\r\n if len(lo)==0:\r\n m=1\r\n break\r\n f[i]=min(lo)+1\r\nif m==1:\r\n print(-1)\r\nelse: \r\n print(f[n-1])\r\n ", "n, d = list(map(int, input().split()))\r\ns = input()\r\n\r\ndp = [float(\"inf\")] * n\r\ndp[0] = 0\r\n\r\nfor i in range(n):\r\n if s[i] == \"1\":\r\n for j in range(i - 1, i - d - 1, -1):\r\n dp[i] = min(dp[i], dp[j] + 1)\r\nif dp[-1] == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(dp[-1])\r\n", "\r\ndef main_function():\r\n n, d = [int(i) for i in input().split(\" \")]\r\n table = [0 for i in range(d)]\r\n s = input()\r\n jump_counter = 0\r\n moves = 4\r\n i = 0\r\n while i < len(s) - 1:\r\n last_one = 0\r\n for j in range(1, d + 1):\r\n if i + j == len(s):\r\n break\r\n elif s[i + j] == \"1\":\r\n last_one = i + j\r\n if last_one == 0:\r\n return \"-1\"\r\n else:\r\n i = last_one\r\n jump_counter += 1\r\n return str(jump_counter)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "n, d = map(int, input().split())\r\nline = input()\r\ncnt = 0\r\nk = 0\r\ns = 0\r\nwhile s != n - 1:\r\n b = False\r\n for i in range(min(n, s + d + 1) - 1, s, -1):\r\n #print(i)\r\n if line[i] == '1':\r\n s = i\r\n cnt += 1\r\n b = True\r\n break\r\n if b == True:\r\n continue\r\n cnt = -1\r\n break\r\nprint(cnt)", "t,s = map(int,input().strip().split())\r\nlily = [int(x) for x in input()]\r\nl = len(lily)\r\nptr,jmp = 0,0\r\nwhile 1:\r\n flag = 0\r\n for i in range(s,0,-1):\r\n try:\r\n if lily[ptr+i]:\r\n jmp += 1\r\n ptr = ptr+i\r\n flag = 1\r\n break\r\n except:\r\n continue\r\n if ptr == (l-1):\r\n print(jmp)\r\n break\r\n if not flag:\r\n print(-1)\r\n break", "[n,d],s,r,i=list(map(int,input().split())),list(map(lambda x:x=='1',list(input()))),0,0\r\nwhile i!=n-1:\r\n\tfor j in reversed(range(i,min(i+d+1,n))):\r\n\t\tif j==i:\r\n\t\t\tprint(-1)\r\n\t\t\tquit()\r\n\t\tif s[j]:\r\n\t\t\ti=j\r\n\t\t\tbreak\r\n\tr+=1\r\nprint(r)", "class Graph:\r\n def __init__(self, size):\r\n self.size = size\r\n self.adj_list = {}\r\n for i in range(size):\r\n self.adj_list[i] = []\r\n\r\n def add_edge(self, src, des):\r\n self.adj_list[src].append(des)\r\n\r\n def BFS(self, src):\r\n d2s = [-1 for i in range(self.size)]\r\n visited = [False for i in range(self.size)]\r\n d2s[src] = 0\r\n visited[src] = True\r\n queue = [src]\r\n\r\n while len(queue) != 0:\r\n u = queue.pop(0)\r\n for node in self.adj_list[u]:\r\n if not visited[node]:\r\n visited[node] = True\r\n d2s[node] = d2s[u] + 1\r\n queue.append(node)\r\n return d2s\r\n \r\ndef main():\r\n n, d = input().split()\r\n n = int(n)\r\n d = int(d)\r\n g = Graph(n)\r\n t = input()\r\n for j in range(len(t)):\r\n if t[j] == '1':\r\n for k in range(j + 1, j + d + 1):\r\n try:\r\n if t[k] == '1':\r\n g.add_edge(j, k)\r\n except IndexError:\r\n continue\r\n print(g.BFS(0)[-1])\r\n\r\nif __name__=='__main__':\r\n main()", "m,n = [int(x) for x in input().split(' ')]\r\nraw = list(input())\r\np = 0\r\ncnt = 1\r\nprt = 0\r\nwhile p <m-n-1:\r\n for j in range(n):\r\n key = 0\r\n if raw[p+n-j]==\"1\":\r\n p = p+n-j\r\n cnt+=1\r\n key = 1\r\n break\r\n else:\r\n pass\r\n if key == 0:\r\n prt = 1\r\n break\r\nif prt == 1:\r\n print(-1)\r\nelse:\r\n print(cnt)", "n,d = list(map(int,input().split()))\r\ninp = input()\r\nx = 0\r\ny = 0\r\nwhile x < n-1 and y < n:\r\n if inp[x] == \"1\":\r\n x += d\r\n y += 1\r\n else:\r\n x -= 1\r\nif y >= n:\r\n print(-1)\r\nelse:\r\n print(y)", "n, d = map(int, input().split())\nmapa = input()\n\nteletransportes = [float('inf')] * n\n\nteletransportes[0] = 0\n\nfor i in range(1, n):\n if mapa[i] == '1':\n for j in range(i - 1, max(i - d - 1, -1), -1):\n if mapa[j] == '1':\n teletransportes[i] = min(teletransportes[i], teletransportes[j] + 1)\n\nif teletransportes[n - 1] == float('inf'):\n print(-1)\nelse:\n print(teletransportes[n - 1])\n\n \t \t\t \t\t\t\t\t \t\t \t \t \t\t\t\t\t \t", "n, d = map(int, input().split())\r\nswamp = input()\r\n\r\njumps = [101] * (n+d)\r\njumps[d] = 0\r\n\r\nfor i in range(d+1, n+d):\r\n if swamp[i-d] == '1':\r\n for j in range(i-d, i):\r\n jumps[i] = min(jumps[i], jumps[j]+1)\r\n\r\nprint(-1) if jumps[n+d-1] == 101 else print(jumps[n+d-1])", "n, d = map(int, input().split())\r\ng = str(input())\r\na, col = [str(i) for i in g], 0\r\na.pop(0)\r\nwhile a != [] and a[:d] != [0] * n:\r\n g = a[0:d]\r\n g.reverse()\r\n if \"1\" in g:\r\n ind, col = g.index(\"1\"), col + 1\r\n else:\r\n print(-1)\r\n exit()\r\n a = a[d- ind:]\r\nprint(col) if a == [] else print(-1)\r\n", "n, d = map(int, input().split())\r\ns = input()\r\n\r\nres = 0\r\nx = 0\r\nwhile True:\r\n if x == n-1:\r\n print(res)\r\n break\r\n for i in range(min(x + d, n-1), x, -1):\r\n if s[i] == '1':\r\n x = i\r\n res += 1\r\n break\r\n else:\r\n print(-1)\r\n break\r\n", "n, d = map(int, input().split())\r\ns = input()\r\nidx, ans = 0, 0\r\nwhile idx != n - 1:\r\n temp = idx\r\n for i in range(idx + 1, idx + d + 1):\r\n if i >= n:\r\n break\r\n if s[i] == '1':\r\n idx = i\r\n if idx != temp:\r\n ans += 1\r\n else:\r\n ans = -1\r\n break\r\nprint(ans)\r\n", "n,d=map(int,input().split())\r\nl=[100]*(n+1)\r\ns=input()\r\nl[0]=0\r\nfor i in range(n):\r\n t=i-1\r\n k=1\r\n while k<=d:\r\n if s[t]=='1':\r\n l[i]=min(l[i],l[t]+1)\r\n k+=1\r\n t-=1\r\nif l[n-1]==100:\r\n print(-1)\r\nelse:\r\n print(l[n-1])\r\n \r\n", "#for this problem, I used a greedy approach where I take the biggest possible jump and check if I can land there. If can't, go back 1 point at a time till a point is found where the frog can land. The run and space time is O(n)\nimport sys\ninp = sys.stdin.readlines()\n\nfirst = inp.pop(0).replace('\\n','').split()\nn = int(first[0])\nd = int(first[1])\ns = list(inp.pop(0).replace('\\n',''))\n\ni = 1\nans = 0\nwhile i <= n:\n j = i + d\n if j > n:\n ans += 1\n break\n flag = 0\n while j > i:\n if s[j-1] == '1':\n ans += 1\n flag = 1\n i = j\n break\n j -= 1\n if i == n:\n break\n if flag == 0:\n print(-1)\n sys.exit()\nprint(ans)\n \t\t\t \t\t \t\t\t\t \t \t \t\t \t", "# #\r\n# # Don't take it so seriously.\r\n# # Life's transient.\r\n# #\r\n\r\nn, d = [int(e) for e in input().split()]\r\ns = input()\r\nmax_cons_zero = 0\r\ncons_zero = 0\r\nfor i in s:\r\n if i == '0':\r\n cons_zero += 1\r\n if cons_zero > max_cons_zero:\r\n max_cons_zero = cons_zero\r\n else:\r\n cons_zero = 0\r\n# print(max_cons_zero)\r\nif max_cons_zero >= d:\r\n print(-1)\r\nelse:\r\n pos = 0\r\n jumps = 0\r\n while pos != n-1:\r\n for i in range(d, 0, -1):\r\n if pos + i <= n-1:\r\n if s[pos+i] == '1':\r\n pos += i\r\n jumps += 1\r\n break\r\n print(jumps)", "n,d = list(map(int,input().split()))\r\ninp = input()\r\nif \"0\"*d in inp:\r\n print(-1)\r\nelse:\r\n x = 0\r\n y = 0\r\n while x < n-1 and y < n:\r\n if inp[x] == \"1\":\r\n x += d\r\n y += 1\r\n else:\r\n x -= 1\r\n print(y)", "n,k = map(int,input().split())\r\ns = input()\r\n\r\nones = []\r\nfor i in range(n):\r\n if s[i]=='1':\r\n ones.append(i)\r\n\r\nadj = [[] for i in range(n+1)]\r\n\r\nfor num in ones:\r\n for i in range(num+1,min(num+k+1,n)):\r\n if s[i]=='1':\r\n adj[num].append(i)\r\n adj[i].append(num)\r\n\r\nlevel = [-1 for i in range(n+1)]\r\n\r\nque = [0]\r\nlevel[0]=0\r\n\r\nwhile len(que)>0:\r\n cur = que.pop(0)\r\n \r\n for node in adj[cur]:\r\n if level[node]==-1:\r\n que.append(node)\r\n level[node]=level[cur]+1\r\n\r\n if level[n-1]!=-1:\r\n break\r\n\r\nprint(level[n-1])\r\n", "n, d = map(int, input().split())\nterrain = input()\n\ndistances = [float(100)] * (n + 1)\ndistances[1] = 0\n\nfor i in range(1, n + 1):\n if terrain[i - 1] == '1':\n for j in range(1, d + 1):\n if i + j <= n:\n distances[i + j] = min(distances[i + j], distances[i] + 1)\n\nif distances[n] == float(100):\n print(-1)\nelse:\n print(distances[n])\n\n \t\t\t\t\t \t\t\t \t \t \t", "n, d = map(int, input().split())\r\ns = input()\r\nw = [0]\r\nfor i in range(n - 1):\r\n r = 99999\r\n if s[i + 1] == \"0\":\r\n w.append(r)\r\n else:\r\n for j in range(min(d, i + 1)):\r\n r = min(r, w[i - j] + 1)\r\n w.append(r)\r\n#print(w)\r\nif w[-1] > 5000:\r\n print(-1)\r\nelse:\r\n print(w[-1])", "#nums = list(map(int, input().split()))\r\n\r\nn,jump = map(int, input().split())\r\nlilies = input()\r\n\r\ncanReach = True\r\n\r\ncurrent = 0\r\ncount = 0\r\n\r\nwhile current < n-1:\r\n nxt = current+jump\r\n if nxt < n and lilies[nxt] == '1':\r\n count += 1\r\n current += jump\r\n else:\r\n possible = False\r\n while nxt > current:\r\n if nxt < n and lilies[nxt] == '1':\r\n count += 1\r\n current = nxt\r\n possible = True\r\n nxt -= 1\r\n \r\n if not possible:\r\n # print(\"I was here\")\r\n canReach = False\r\n break\r\n \r\n \r\n\r\nif canReach:\r\n print(count)\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\ns=input()\r\ndp=[float('inf')]*n\r\ndp[0]=0\r\nfor i in range(1,n):\r\n for j in range(max(i-k,0),n):\r\n if s[j]=='1':\r\n dp[i]=min(dp[i],dp[j]+1)\r\nif dp[n-1]==float('inf'):\r\n print(-1)\r\nelse:\r\n print(dp[n-1])\r\n", "n, d = map(int, input().split())\nmagic_map = input()\n\nminimum_number_of_teleports = [float('inf')] * n\nminimum_number_of_teleports[0] = 0\n\nfor i in range(n):\n if magic_map[i] == '1':\n for j in range(1, d + 1):\n if i + j < n:\n minimum_number_of_teleports[i + j] = min(minimum_number_of_teleports[i + j], minimum_number_of_teleports[i] + 1)\n\nif minimum_number_of_teleports[n - 1] == float('inf'):\n print(-1)\nelse:\n print(minimum_number_of_teleports[n - 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", "import math\n\ndef get_teleportation_num(n, d, map, m, position, teleportations):\n if position == n - 1: return teleportations\n if m[position][teleportations] != -1: return m[position][teleportations]\n\n val = math.inf\n\n for i in range(1, d + 1):\n if position + i < n and map[i + position] == '1':\n teleportations_needed = get_teleportation_num(n, d, map, m, i + position, teleportations + 1)\n\n if teleportations_needed < val: val = teleportations_needed\n\n m[position][teleportations] = val\n\n return val\n\nn, d = map(int, input().split())\nmap = input().strip()\nm = [[-1] * 105 for _ in range(105)]\n\nresponse = get_teleportation_num(n, d, map, m, 0, 0)\n\nif response == math.inf:\n print(-1)\nelse:\n print(response)\n\n \t\t \t \t\t \t\t\t \t \t \t", "from queue import Queue\nBigNum = 10 ** 10\n\nn, d = map(int, input().split(' '))\ngs = [False] + [c == '1' for c in input()]\nds = [BigNum] * len(gs)\n\nq = Queue()\nq.put((1, 0))\n\nwhile not q.empty():\n v, dist = q.get()\n if not gs[v]:\n continue\n if ds[v] < BigNum:\n continue\n ds[v] = dist\n \n for dx in range(-d, d + 1):\n if 1 <= v + dx <= n:\n q.put((v + dx, dist + 1))\n\nprint(-1 if ds[n] == BigNum else ds[n])\n", "comprimento, distMax = map(int, input().split())\n\nmapa = input()\n\natual = 0\nrespostaMin = 0\n\nwhile atual < comprimento - 1:\n prox = min(atual+distMax, comprimento-1)\n while prox > atual and mapa[prox] != '1':\n prox -= 1\n if atual == prox:\n respostaMin = -1\n break\n else:\n respostaMin += 1\n atual = prox\n\nprint(respostaMin)\n\n\t\t \t \t \t \t \t \t \t\t\t\t\t \t\t\t \t", "# cook your dish here\r\nn,d =map(int,input().split(\" \"))\r\ns=input()\r\ny=[]\r\nfor i in s:\r\n y.append(i)\r\n\r\ni=count=0\r\nx=d\r\nwhile x>0 and i<n-d:\r\n if y[i+x]==\"1\":\r\n count+=1\r\n i+=x\r\n x=d+1\r\n x-=1\r\n\r\nif x==0:\r\n print(-1)\r\nelif i!=n-1:\r\n print(count+1)\r\nelse:\r\n print(count)\r\n ", "a,b = map(int,input().split())\r\nc = input()\r\nd = 0\r\ne = 0\r\nif b*\"0\" in c:\r\n print(-1)\r\n\r\nelse:\r\n while d<(a-1):\r\n if c[d]==\"1\":\r\n d += b\r\n e +=1\r\n else:\r\n d-=1\r\n print(e)", "n, d = map(int, input().split())\nlirios = input()\n\n\ndp = [float('inf')] * n\n\n\ndp[0] = 0\n\nfor i in range(1, n):\n if lirios[i] == '1':\n \n for j in range(1, d + 1):\n if i - j >= 0:\n dp[i] = min(dp[i], dp[i - j] + 1)\n\n\nif dp[n - 1] == float('inf'):\n print(-1)\nelse:\n print(dp[n - 1])\n\n\n\t\t\t \t \t \t\t \t \t \t \t\t\t", "line = input();\r\n\r\nwords = [];\r\nfor word in line.split():\r\n words.append(word);\r\n\r\nn = int(words[0]);\r\nd = int(words[1]);\r\n\r\nline = input();\r\n\r\ndp = [-1]*n;\r\ndp[0] = 0;\r\n\r\nfor i in range(n):\r\n if line[i] == '0':\r\n continue;\r\n\r\n if dp[i] == -1:\r\n continue;\r\n\r\n for j in range(1, d+1):\r\n if i+j >= n:\r\n continue;\r\n\r\n if line[i+j] == '0':\r\n continue;\r\n\r\n if dp[i+j] == -1:\r\n dp[i+j] = dp[i] + 1;\r\n else:\r\n dp[i+j] = min(dp[i+j], dp[i]+1);\r\n\r\nprint(dp[n-1]);", "nPads, jmp = [int(x) for x in input().split()]\npads = input()\n\ni = 1\nnJumps = 0\nwhile i < nPads:\n #print(\"position: \", i)\n if i + jmp >= nPads:\n #print(\"last jump\")\n nJumps += 1\n break\n canJump = False\n for j in range(jmp, 0, -1):\n #print(\"trying to jump from \", i, \" to \", i+j)\n if pads[i+j-1] == \"1\":\n #print(\"Jump successful\")\n canJump = True\n nJumps += 1\n i += j\n break\n if not canJump:\n #print(\"no jumps worked\")\n nJumps = -1\n i = 200\n\nprint(nJumps)\n\n\t \t \t\t \t \t\t \t \t\t\t \t\t \t\t \t\t\t", "n, d = map(int, input().split())\r\ns = input()\r\ndp = [0] * n\r\nn -= 1\r\nr = 0\r\nf = True\r\nk = 0\r\nwhile f and k != n:\r\n for i in range(min(n, k + d), r, -1):\r\n if s[i] == '1':\r\n dp[i] = dp[k] + 1\r\n r = k + d\r\n k = i\r\n break\r\n else:\r\n f = False\r\nif f:\r\n print(dp[n])\r\nelse:\r\n print(-1)", "n,d = map(int,input().split())\r\ns = input()\r\nk = 0\r\nf = 1\r\nx = d\r\nwhile len(s) > 1:\r\n if s[1:].find('1') > d-1:\r\n print(-1)\r\n f = 0\r\n break\r\n while s[x] != '1': x -= 1\r\n s = s[x:]\r\n k += 1\r\n x = min(d,len(s)-1)\r\nif f: print(k)\r\n", "n, d = map(int, input().split(' '))\r\ns = input().strip()\r\nans = [0 for i in range(n)]\r\nans[n-1] = 1\r\nfor idx, val in enumerate(reversed(s)):\r\n idx = n - idx - 1 \r\n if val == '1' and ans[idx] != 0:\r\n # we can jump from here\r\n for j in range(1, d + 1):\r\n if idx - j >= 0 and s[idx - j] == '1':\r\n if ans[idx - j] > ans[idx] + 1 or ans[idx - j] == 0:\r\n ans[idx - j] = ans[idx] + 1\r\n\r\n# print(ans) \r\nif ans[0] == 0:\r\n print(-1)\r\nelse:\r\n print(ans[0] - 1)", "n,d=map(int,input().split(' '))\r\ns=input()\r\nmincnt=0\r\nk=0\r\nki=0\r\nkm=0\r\nL=len(s)\r\nfor i in range(1,L):\r\n if s[i]=='1':\r\n k=i\r\n if i-km>=d or i==L-1:\r\n if k==km:\r\n mincnt=-1\r\n break\r\n km=k\r\n mincnt+=1\r\nprint(mincnt)\r\n", "n, d = map(int, input().split())\nmapa = input()\n\nteletransportes = [float('inf')] * n\n\nteletransportes[0] = 0\n\nfor i in range(1, n):\n if mapa[i] == '0':\n continue\n for j in range(max(0, i - d), i):\n teletransportes[i] = min(teletransportes[i], teletransportes[j] + 1)\nif teletransportes[n - 1] == float('inf'):\n print(-1)\nelse:\n print(teletransportes[n - 1])\n\n \t\t\t \t\t\t\t \t \t \t\t \t \t\t \t\t \t\t", "def solve(nd, s):\r\n n = nd[0]\r\n d = nd[1]\r\n\r\n i = count = 0\r\n j = d\r\n\r\n while i != n-1:\r\n if j<n and s[j] == '1':\r\n i = j\r\n j = i+d\r\n count += 1\r\n else:\r\n j -= 1\r\n\r\n if j == i:\r\n return '-1'\r\n \r\n return count\r\n\r\n\r\nnd = list(map(int,input().strip().split()))[:2]\r\ns = input()\r\nprint(solve(nd, s))\r\n", "def main():\r\n n, d = map(int, input().split())\r\n s = [int(x) for x in input()]\r\n inf = float('inf')\r\n dp = [inf] * (n + 1)\r\n dp[0] = 0\r\n for x in range(0, n):\r\n if s[x]:\r\n for step in range(1, d + 1):\r\n if x + step < n and s[x + step]:\r\n dp[x + step] = min(dp[x + step], dp[x] + 1)\r\n print(-1 if dp[n - 1] == inf else dp[n - 1])\r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "num_input = input()\r\nnum_input = num_input.split(\" \")\r\nn = int(num_input[0])\r\nd = int(num_input[1])\r\n\r\ninput_string = input()\r\n\r\ncur_index = 0\r\njump = 0\r\njumping = False\r\n\r\nwhile (cur_index < n - 1):\r\n\r\n jumping = False\r\n\r\n for i in range(d, 0, -1):\r\n # if cur_index + i < n:\r\n # print(input_string[cur_index + i])\r\n if cur_index + i < n and input_string[cur_index + i] == \"1\":\r\n cur_index = cur_index + i\r\n jumping = True\r\n jump+=1\r\n\r\n if jumping == True:\r\n break\r\n\r\n if jumping == False:\r\n break\r\n\r\nif jumping == False:\r\n print(-1)\r\nelse:\r\n print(jump)\r\n\r\n", "n,k = map(int,input().split())\nc = 0 \ns = input()\nst = 1\nwhile st<n:\n\tflag = 0 \n\tsk = 0 \n\tfor i in range(st,min(st+k,n)):\n\t\tif s[i]=='1':\n\t\t\tsk = i\n\t\t\tflag = 1\n\tif not flag :\n\t\tbreak\n\tc +=1\n\tst = sk+1\nif flag :\n\tprint(c)\nelse:\n\tprint(-1)\n", "n,d=map(int,input().split())\r\na=input()\r\nx=0\r\nr=0\r\nwhile x!=n-1:\r\n y=a[:x+d+1].rfind(\"1\")\r\n if y==x:\r\n r=-1\r\n break\r\n else:\r\n x=y\r\n r+=1\r\nprint(r)", "n,d = map(int, input().split())\r\ns = str(input())\r\ndiem = 1\r\nnhay = 0\r\nj = s[diem:diem+d]\r\ndadi = 0\r\n\r\nwhile '1' in j and diem < len(s):\r\n nhay += 1\r\n diem = len(j) - j[::-1].index('1')+1 + dadi\r\n dadi = diem -1\r\n j = s[diem:diem+d]\r\n\r\nif diem >= len(s):\r\n print(nhay)\r\nelse:\r\n print(-1)", "n,d=map(int,input().split())\r\ns=str(input())\r\ns+=\"0\"*101\r\nres=0\r\n\r\nnow=0;p=0\r\nwhile now!=n-1:\r\n for i in range(d,0,-1):\r\n if s[now+i]==\"1\":\r\n now+=i\r\n break\r\n res+=1\r\n p+=1\r\n if p==1000:\r\n print(-1)\r\n break\r\nelse: \r\n print(res)\r\n", "n, k = map(int,input().split())\r\na, ans = input(), 0\r\ns = '0' * k \r\n\r\nif str(s) in a :\r\n print ( '-1' )\r\nelse : \r\n i = k \r\n while i < n : \r\n if a[i] == '1' :\r\n ans += 1 \r\n i += k \r\n else :\r\n i -= 1 \r\n if i == n - 1 + k : \r\n print ( ans ) \r\n else :\r\n print( ans + 1 ) \r\n\r\n\r\n", "from sys import stdin, stdout\r\nfrom collections import deque\r\n#stdin = open('The Way to Home.txt', 'r') \r\ndef SI(): return stdin.readline()[:-1]\r\ndef MI(): return map(int, stdin.readline().split())\r\n\r\nmaxjump=101\r\nn,d=MI()\r\ns=SI()\r\ndp=[101 for i in range(n)]\r\ndp[0]=0\r\nl=[i for i in range(n) if s[i]=='1']\r\nq=deque(l)\r\nfor i in range(1,n):\r\n while True:\r\n if len(q)==0:\r\n ans=-1\r\n break\r\n j=q[0]\r\n if j<i-d:\r\n q.popleft()\r\n else:\r\n dp[i]=1+dp[j]\r\n break\r\nans=dp[-1]\r\nif ans>=maxjump:\r\n ans=-1\r\nstdout.write(\"{} \\n\".format(ans))\r\n\r\n\r\n", "n, d = map(int, input().split())\r\ns = input()\r\ncount = 0\r\ni = 0\r\nwhile i < n and i != -1:\r\n s1 = s[i + 1:i + d + 1]\r\n if s1 != '':\r\n i += s1.rfind('1') + 1\r\n count += 1\r\n else:\r\n break\r\n if '1' not in s1:\r\n i = -1\r\n break\r\nif i == -1:\r\n print(-1)\r\nelse:\r\n print(count)", "n, d = [int(i) for i in input().split()]\na = input()\ndp = [1e9] * n\ndp[0] = 0\nfor i in range(1, n):\n if a[i] == '0':\n continue\n for j in range(1, d + 1):\n if i - j < 0:\n break\n dp[i] = min(dp[i], dp[i - j] + 1)\nprint(dp[-1] if dp[-1] != 1e9 else -1)", "n, d = map(int, input().split())\r\ns = input()\r\nx = 0\r\ngo = 0\r\nhear = 0\r\nMIN = 0\r\ni = 0\r\nwhile i < len(s):\r\n i+=1\r\n x+=1\r\n if x < d:\r\n if s[i] == '1':\r\n go = i\r\n if i == n-1:\r\n MIN+=1\r\n print(MIN)\r\n break\r\n elif x == d:\r\n if s[i] == '1' and i == n-1:\r\n MIN+=1\r\n print(MIN)\r\n break\r\n elif s[i] == '1':\r\n go = i\r\n if hear != go:\r\n hear = go\r\n i = go\r\n MIN+=1\r\n else:\r\n print('-1')\r\n break\r\n x = 0", "nd = input().split()\r\nn = int(nd[0])\r\nd = int(nd[1])\r\ns = input()\r\ndp = [-1]*n\r\ndp[0] = 0\r\n\r\nfor i in range(1,n):\r\n if s[i]=='0':\r\n dp[i] = -1\r\n else:\r\n dp[i] = 999999999\r\n for j in range (1,d+1):\r\n if j>i:\r\n break\r\n if dp[i]>dp[i-j] and dp[i-j]>-1:\r\n dp[i] = dp[i-j]\r\n dp[i]+=1\r\n\r\nif dp[n-1]==1000000000:\r\n print(-1)\r\nelse:\r\n print(dp[n-1])", "nd = list(map(int, input().split()))\r\ns = str(input())\r\ntemp = 0\r\nsteps = 0\r\nwhile temp != (nd[0] - 1):\r\n\taccept = 1\r\n\tfor i in range(min(temp + nd[1], nd[0] - 1), temp, -1):\r\n\t\tif s[i] == '1':\r\n\t\t\ttemp = i\r\n\t\t\taccept = 0\r\n\t\t\tbreak\r\n\tif accept == 1:\r\n\t\tbreak\r\n\tsteps += 1\r\nif accept == 1:\r\n\tprint(-1)\r\nelse:\r\n\tprint(steps)", "N, D = map(int, input().split())\r\nA = input()\r\nnumJumps = 0\r\ncurI = 0\r\nprev = 0\r\n\r\nwhile curI != N - 1:\r\n for i in range(min(curI + D, N - 1), curI, -1):\r\n if A[i] == '1':\r\n curI = i\r\n break\r\n if curI != prev:\r\n prev = curI\r\n numJumps += 1\r\n else:\r\n break\r\n\r\nif curI == N - 1:\r\n print(numJumps)\r\nelse:\r\n print(-1)", "def torreMago(mapa, n, d):\n count = 0\n current_position = 0\n\n while current_position < n - 1:\n next_position = current_position\n found = False\n\n for i in range(d, 0, -1):\n if current_position + i >= n:\n continue\n if mapa[current_position + i] == '1':\n next_position = current_position + i\n found = True\n break\n\n \n if not found:\n return -1\n\n current_position = next_position\n count += 1\n\n return count\n\nn, d = map(int, input().split())\nmapa = input()\nresult = torreMago(mapa, n, d)\nprint(result)\n\n \t \t \t \t\t \t\t \t \t\t\t\t\t\t\t \t", "n, d = list(map(int,input().split(\" \")))\ns = list(map(int,list(input())))\ncounter = 0\ni = 0\ndef next_jump(pos, dis):\n if n>pos+dis:\n view = s[pos+1:pos+dis+1]\n c = dis\n else:\n return n-pos\n #print('view',view)\n for i in reversed(view):\n if i:\n #print(c)\n return c\n c -= 1\n return -1\n\npos = 0\nwhile (pos<n-1):\n nj = next_jump(pos,d)\n if nj>0:\n pos += nj\n counter +=1\n #print(pos)\n else:\n counter = -1\n break\nprint(counter)\n\n \t\t \t \t \t\t \t\t\t\t \t\t\t\t\t\t", "n, d = (int(_) for _ in input().split())\r\ns = input()\r\n\r\nff = {n-1:0}\r\n\r\ndef f(k):\r\n global ff\r\n if not (k in ff):\r\n www = []\r\n for i in range(k+1, min(k+d+1, n)):\r\n if s[i] == \"1\":\r\n www.append(f(i))\r\n ff[k] = min(www)+1 if www else 1000\r\n \r\n return ff[k]\r\n \r\nres = f(0)\r\nprint(res if res < 1000 else -1)\r\n \r\n", "from cmath import *\r\nfrom decimal import *\r\n\r\ndef _input(): return map(int, input().split())\r\ndef _list(): return list(map(int, input().split()))\r\n\r\ndef solves():\r\n n,m=_input()\r\n s=input()\r\n ans=0;\r\n i=1\r\n while i < n:\r\n j=i+m-1\r\n while j>0:\r\n if (j>=n):\r\n j-=1\r\n else:\r\n if j==i and s[j]!='1':\r\n print(-1)\r\n exit()\r\n if (s[j]=='1'):\r\n ans+=1;\r\n i=j\r\n break\r\n j-=1\r\n i+=1\r\n print(ans)\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, k = map(int, input().split())\r\ns = input()\r\nans, l = 0, 0\r\nwhile l < n - 1:\r\n w, r = 0, 0\r\n for r in range(l + 1, min(n, l + k + 1)):\r\n if s[r] == '1':\r\n w = r \r\n if w == 0:\r\n ans = -1\r\n break \r\n l = w\r\n ans += 1\r\nprint(ans)", "n_d = input()\nn = int(n_d.split()[0])\nd = int(n_d.split()[1])\n\nstring = input()\n\ntimes = 0\n\ni = 0\nwhile i < n -1:\n i += d\n flag = 0\n\n if i <= n-1:\n while string[i] != '1':\n i -= 1\n flag +=1\n if flag == d:\n times = -1\n break\n\n\n\n if flag == d:\n break\n\n times += 1\n\nprint(times)\n \t \t \t \t \t\t \t\t\t \t\t\t \t", "n,d=map(int,input().split())\r\ns=list(input())\r\nl=[]\r\nfor i in range(n):\r\n\tif s[i]==\"1\":\r\n\t\tl.append(i)\r\ncount=0\r\nflag=1\r\nstart=0\r\ni=0\r\nwe=len(l)\r\nwhile i<we-1:\r\n\tif l[i+1]-l[i]>d:\r\n\t\tflag=0\r\n\t\tbreak\r\n\telse:\r\n\t\tt=i+1\r\n\t\twhile t<we and l[t]-l[i]<=d:\r\n\t\t\tt+=1\r\n\t\tcount+=1\r\n\t\ti=t-1\r\nif flag==0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(count)\r\n", "n, d = map(int, input().split())\r\n\r\nlilies = input()\r\n\r\npos = 0\r\njumps = 0\r\nwhile True:\r\n target = lilies.rfind(\"1\", pos + 1, pos + d + 1)\r\n jumps += 1\r\n\r\n if target == -1:\r\n print(-1)\r\n break\r\n else:\r\n if target == n - 1:\r\n print(jumps)\r\n break\r\n pos = target\r\n", "from collections import deque\r\nn, d = map(int, input().split())\r\ns = input()\r\nl, ans = 0, 0\r\nwhile l != n-1:\r\n tmp = s[:l+d+1].rfind(\"1\")\r\n if tmp == l:\r\n ans = -1\r\n break\r\n else:\r\n l = tmp\r\n ans += 1\r\nprint(ans)\r\n \r\n \r\n", "n,d=[int(i) for i in input().split(\" \")]\r\ns=input()\r\n\r\ndp=[10000 for i in range(n)]\r\ndp[0]=0\r\n\r\nfor i in range(n):\r\n \r\n if(s[i]=='1'):\r\n \r\n for j in range(0,d+1):\r\n \r\n if(i+j < n and s[i+j]=='1'):\r\n \r\n dp[i+j]=min(dp[i+j],dp[i]+1)\r\n\r\nif(dp[n-1]==10000):\r\n print(-1)\r\nelse:\r\n print(dp[n-1])", "n, d = map(int, input().split())\r\ns = ' ' + input()\r\nf = [float('inf')] * (n + 1)\r\nf[1] = 0\r\nfor i in range(2, n + 1):\r\n for j in range(1, d + 1):\r\n if i - j > 0 and s[i - j] == '1':\r\n f[i] = min(f[i], f[i - j]) + 1\r\nprint(f[n] if f[n] != float('inf') else -1)", "inp = lambda: map(int, input().rstrip().split())\nn, d = inp()\ns = input()\nmaxm = 0\ncount = 0\nfor i in s:\n if i == \"0\":\n count += 1\n else:\n maxm = max(maxm, count)\n count = 0\nif maxm >= d:\n print(-1)\n exit()\n# dp = [0] * (n + 2)\nt = 0\nsteps = 0\nwhile t < n - 1:\n for i in range(min(t + d, n - 1), t, -1):\n if s[i] != \"0\":\n steps += 1\n t = i\n break\nprint(steps)\n", "import math\r\n\r\nN, D = map(int, input().split())\r\nS = input()\r\nL = list()\r\nL.append(0)\r\nfor i in range(1, N):\r\n if S[i] == '1':\r\n L.append(math.inf)\r\n for j in range(i - D, i + 1):\r\n if(j >= 0):\r\n L[i] = min(L[i], L[j] + 1)\r\n else:\r\n L.append(math.inf)\r\n\r\nif L[-1] != math.inf:\r\n print(L[-1])\r\nelse:\r\n print(-1)\r\n", "n, d = [int(x) for x in input().split()]\ns = input()\ndp = [[1] + [0] * (n - 1)]\ni = 0\nj = 0\n\nwhile (True):\n\tdp.append([0] * n)\n\tfor j in range(n):\n\t\tif (dp[i][j] == 1):\n\t\t\tfor k in range(0, d):\n\t\t\t\tif (j + k + 1 < n):\n\t\t\t\t\tif (s[j + k + 1] == '1'):\n\t\t\t\t\t\tdp[i + 1][j + k + 1] = 1\n\tif (dp[i + 1][n - 1] == 1):\n\t\tprint(i + 1)\n\t\tbreak\n\tif (sum(dp[i + 1]) == 0):\n\t\tprint(-1)\n\t\tbreak\n\ti += 1\n", "x = [int(s) for s in input().split()]\r\nn, d = x[0]-1, x[1]\r\ns = [int(v) for v in list(input())]\r\ndef prijok(s = [], i = 0, d = 0, co = 0, n = 0):\r\n if i+d >= n:\r\n print(co+1)\r\n return\r\n for j in range(d, 0, -1):\r\n if s[i+j] == 1:\r\n prijok(s, i+j, d, co+1, n)\r\n return\r\n if s[i+1] == 0:\r\n print(-1)\r\n return\r\ni, co = 0, 0 \r\nprijok(s, i, d, co, n)", "# A. The Way to Home\n\nn, d = map(int, input().split())\ns = input()\n\nans = 0\ni = 0\nwhile i < n-1:\n try:\n x = s[:i+d+1].rindex('1')\n if x == i:\n raise ValueError\n i = x\n ans += 1\n except ValueError:\n ans = -1\n break\n\nprint(ans)\n", "n, d = map(int, input().split())\r\ns = input()\r\n\r\nind = 0\r\nans = 0\r\n\r\nwhile ind < n - 1:\r\n jump = s[ind + 1: ind + d + 1]\r\n\r\n try:\r\n ind += jump.rindex('1') + 1\r\n except ValueError:\r\n print(-1)\r\n break\r\n ans += 1\r\n\r\nelse:\r\n print(ans)\r\n", "n, d = map(int, input().split())\r\npath = input()\r\ndp = [10 ** 5] * n\r\ndp[0] = 0\r\nfor i in range(n):\r\n if path[i] == '1':\r\n for j in range(i + 1, min(n, i + d + 1)):\r\n if path[j] == '1':\r\n dp[j] = min(dp[j], dp[i] + 1)\r\nif dp[n - 1] > 10 ** 4:\r\n print(-1)\r\nelse:\r\n print(dp[n - 1])\r\n", "n, d = map(int, input().split())\ns = input()\n\njumps = [float('inf')] * n\njumps[0] = 0\n\nfor i in range(1, n):\n if s[i] == '1':\n for j in range(i - 1, max(i - d - 1, -1), -1):\n if s[j] == '1':\n jumps[i] = min(jumps[i], jumps[j] + 1)\n \nif jumps[n - 1] == float('inf'):\n print(-1)\nelse:\n print(jumps[n - 1])\n\t\t\t\t\t\t\t \t\t \t\t\t \t \t", "#CF910A\na,b = map(int,input().split())\ns = input()\ni=0\nj=0\nwhile i<a-1 and j<a:\n if s[i]=='1':\n i+=b\n j+=1\n else:\n i-=1\nif j>=a:\n print(-1)\nelse:\n print(j) \n", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\nmod=1000000007\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\nn,d=ris()\r\ns=rl()\r\ndp=[inf]*n\r\ndp[0]=0\r\nfor j in range(1,n):\r\n if s[j]=='0':\r\n continue\r\n for i in range(max(0,j-d),j):\r\n dp[j]=min(dp[j],1+dp[i])\r\nif dp[-1]>=inf:\r\n print(-1)\r\nelse:\r\n print(dp[-1])\r\n", "from sys import stdin, stdout \nn,d = map(int,stdin.readline().split())\ns = stdin.readline().split('\\n')[0]\nINF = 10**10\ndp = [ INF for i in range(n) ]\ndp[0] = 0\nfor i in range(n):\n if s[i]=='1':\n for j in range(i-1,max(i-d-1,-1),-1):\n if s[j]=='1':\n dp[i] = min(dp[j]+1,dp[i])\n# print(dp)\nans = dp[n-1]\nif dp[n-1]==INF:\n ans = -1\nstdout.write(\"{}\\n\".format(ans))\n", "a=list(map(int,input().split()))\r\nb=input()\r\nans=0\r\nini=0\r\nwhile ini<a[0]-1:\r\n if '1' in list(b)[ini+1:ini+a[1]+1]:\r\n c=list(b)[ini+1:ini+a[1]+1]\r\n c.reverse()\r\n k=c.index('1')\r\n ans+=1\r\n ini+=a[1]-k\r\n else:\r\n print(-1)\r\n break\r\nelse:\r\n print(ans) ", "n, d = [int(x) for x in input().split()]\r\ns = input()\r\nl = n - 1\r\ngood = True\r\ni = 0\r\nc = 0\r\nwhile i < l:\r\n looking = True\r\n for j in range(min(l, i + d), i, -1):\r\n if s[j] == '1':\r\n looking = False\r\n i = j\r\n break\r\n if looking:\r\n good = False\r\n break\r\n c += 1\r\n\r\nif good:\r\n print(c)\r\nelse:\r\n print('-1')\r\n\r\n", "x,y=map(int,input().split())\r\na=list(input())\r\ni=0\r\nans=0\r\nwhile(i<x-1):\r\n\tf=0\r\n\tfor j in range(y,0,-1):\r\n\t\tif(i+j<x):\r\n\t\t\tif(a[i+j]=='1'):\r\n\t\t\t\tans+=1\r\n\t\t\t\ti+=j\r\n\t\t\t\tf=1\r\n\t\t\t\tbreak\r\n\tif(f==0):\r\n\t\tans=-1\r\n\t\tbreak\r\nprint(ans)", "n, d = map(int, input().split())\ns = input()\n\nlocation = 0\ncnt = 0\nwhile location < n-1:\n cnt1 = cnt\n d1 = d\n if n-1-location < d:\n d1 = n-1 - location\n for i in range(d1, 0, -1):\n if s[location+i] == \"1\":\n location += i\n cnt += 1\n break\n if cnt1 == cnt:\n cnt = -1\n break\nprint(cnt)\n \t\t \t\t \t\t\t\t \t \t \t \t \t \t\t", "a, b = map(int, input().split())\r\nd = input()\r\ne = 1\r\nf = 0\r\nflag = False\r\nwhile e < a:\r\n g = b\r\n if g + e > a:\r\n g = a - e\r\n while d[g + e - 1] != '1' and g != 0:\r\n g -= 1\r\n if g == 0:\r\n print(-1)\r\n flag = True\r\n break\r\n else:\r\n f += 1\r\n e += g\r\nif not flag:\r\n print(f)", "n,l = input().split()\r\nn = int(n)\r\nl=int(l)\r\nco = input()\r\nif l*'0' in co:\r\n print(-1)\r\nelse:\r\n d = 0\r\n i = 0\r\n while i < n-1:\r\n if co[i] == '1':\r\n d = d+1\r\n i = i+l\r\n else:\r\n i = i-1\r\n print(d)", "n,d = map(int,input().split())\ns = input()\nls = list(s)\ni = 0\ncnt = 0\nwhile True:\n j = d\n if i+j>=len(ls):\n j = len(ls) - i-1\n while j > 0:\n if ls[i+j] == '1':\n i += j\n cnt += 1\n break\n j -= 1\n else:\n cnt = -1\n break\n if i >= len(ls)-1:\n break\nprint(cnt)\n \t \t\t\t\t\t\t\t\t \t\t\t\t \t\t \t\t\t \t", "# https://codeforces.com/problemset/problem/910/A\r\n\r\n\"\"\" \r\n Solution - \r\n\"\"\"\r\n\r\nn, d = map(int, input().split())\r\npath = input()\r\ninf = int(1e9 + 5)\r\nif path[0] == '0' or path[n-1] == '0':\r\n print(-1)\r\nelse:\r\n dp = [inf]*(n+1)\r\n dp[0] = 0\r\n for i in range(n):\r\n if path[i] == '0':\r\n continue\r\n for j in range(i+1, i+d+1):\r\n if j >= n:\r\n break \r\n dp[j] = min(dp[j], dp[i] + 1) \r\n \r\n print(-1 if (dp[n-1] == inf) else dp[n-1])", "n,d=map(int,input().split())\r\na=[int(i) for i in input()]\r\nk=0\r\nf=1\r\nind=0\r\nwhile f:\r\n g=0\r\n for i in range(ind+1,ind+d+1):\r\n if i>=len(a):\r\n break\r\n if a[i]==1:\r\n g=1\r\n ind=i\r\n k+=1\r\n if g==0 or ind==n-1:\r\n break\r\nif ind==n-1:\r\n print(k)\r\nelse:\r\n print(-1)", "a,b = input().split()\r\nc=input()\r\ncount=0\r\ne=int(b)*\"0\"\r\nif e in c:\r\n print(\"-1\")\r\nelse:\r\n i=0\r\n count=0\r\n while i<(len(c)-1):\r\n if c[i]=='1':\r\n i+=int(b)\r\n count+=1\r\n else:\r\n i-=1\r\n print(count)\r\n", "n,d=list(map(int,input().split()))\r\ns=input()\r\ni=0\r\njump=0\r\npos=0\r\nwhile i<len(s):\r\n count=0\r\n j=i\r\n j+=1 \r\n while j<=i+d:\r\n if j==n-1:\r\n jump+=1 \r\n print(jump)\r\n exit(0)\r\n elif j<n and s[j]=='1':\r\n count+=1 \r\n pos=j\r\n # print(j,count,jump,pos)\r\n j+=1\r\n if count>0:\r\n i=pos\r\n jump+=1 \r\n else:\r\n print(-1)\r\n exit(0)\r\n\r\n ", "n, d = map(int, input().split())\r\ns = input()\r\na = 0\r\nx = 0\r\nwhile a <= n:\r\n k = min(d, n-a-1)\r\n place = s[a+1:a+k+1]\r\n if a == n-1:\r\n print(x)\r\n exit()\r\n elif '1' in place:\r\n a += k-place[::-1].index('1')\r\n x+=1\r\n else:\r\n print(-1)\r\n exit()\r\n", "n,d=[int(i) for i in input().split()]\r\na=[int(i) for i in input()]\r\ndp=[0] ; l=d ; ans=0\r\nfor i in range(1,n):\r\n if a[i]==1:\r\n dp.append(i)\r\n if i==l or i==n-1:\r\n l=dp[-1]+d\r\n if i==l:\r\n print(-1)\r\n exit(0)\r\n ans+=1\r\nprint(ans)\r\n\r\n \r\n ", "n,d=map(int,input().split())\r\ns=input()\r\nr,i=0,0\r\nwhile i<n-1:\r\n for j in range(d,0,-1):\r\n if i+j<n and s[i+j]=='1':\r\n r+=1\r\n i=i+j\r\n break\r\n else:\r\n print(-1)\r\n exit()\r\nprint(r)", "def zip_sorted(a,b):\n\n\t# sorted by a\n\ta,b = zip(*sorted(zip(a,b)))\n\t# sorted by b\n\tsorted(zip(a, b), key=lambda x: x[1])\n\n\treturn a,b\n\nimport sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\nS = lambda : list(map(str,input()))\n\n\nn,m = I()\na = S()[:-1]\n\n\nnodes = []\nfor i in range(len(a)):\n\tif int(a[i])==1:\n\t\tnodes.append(i) \n\nadj = [[False for i in range(len(nodes)+1)] for j in range(len(nodes)+1)]\nfor i in range(len(nodes)):\n\tfor j in range((i+1),len(nodes)):\n\t\tif abs(nodes[i]-nodes[j])<=m:\n\t\t\tadj[i][j] = True\n\t\t\tadj[j][i] = True\n\nvisited = [0]*len(nodes)\n\npred = [-1]*len(nodes)\ndist = [0]*len(nodes)\n\ndef bfs(adj,n,start,end,visited):\n\tq = []\n\tq.append(start)\n\tvisited[start] = 1\n\tcount = 0\n\tif start==end:\n\t\treturn count\n\twhile q!=[]:\n\t\tcurr = q[0]\n\t\tq.pop(0)\n\t\tfor i in range(n):\n\t\t\tif (curr==i):\n\t\t\t\tcontinue\n\t\t\tif adj[curr][i]==True:\n\t\t\t\tif visited[i]==0:\n\t\t\t\t\tq.append(i)\n\t\t\t\t\tvisited[i] = 1\n\t\t\t\t\tdist[i] = dist[curr]+1\n\t\t\t\t\tpred[i] = curr\n\t\t\t\t\tif i==end:\n\t\t\t\t\t\treturn True\n\treturn False\n\n\n\nif (bfs(adj,len(nodes),0,len(nodes)-1,visited)):\n\tpath = []\n\tj = len(nodes)-1\n\t# path.append(j)\n\t# while pred[j]!=-1:\n\t# \tpath.append(j)\n\t# \tj = pred[j]\n\tprint(dist[j])\nelse:\n\tprint(-1)", "n, d = map(int, input().split())\r\nlillies = input()\r\n\r\ntable = [1000 for x in range(n)]\r\ntable[0] = 0\r\nfor i in range(1,n):\r\n minVal = 1000\r\n for j in range(1,d+1):\r\n if i >= j:\r\n if int(lillies[i]) and table[i-j] + 1 < minVal:\r\n minVal = table[i-j] + 1\r\n table[i] = minVal\r\n\r\nprint(-1 if table[n-1] == 1000 else table[n-1])", "n, k = map(int, input().split())\r\na = list(map(int, input()))\r\nINF = 10 ** 10\r\nd = [INF] * n\r\nd[0] = 0\r\nfor i in range(1, n):\r\n minim = INF\r\n for j in range(i-k, i):\r\n if j >= 0:\r\n if a[j] == 1:\r\n minim = min(d[j], minim)\r\n d[i] = minim + 1\r\n\r\nif d[-1] < INF:\r\n print(d[-1])\r\nelse:\r\n print(-1)", "line = input().split(' ')\nn = int(line[0])\njump = int(line[1])\npath = [int(x) for x in list(input())]\n\ndef solve () :\n pos = 0\n jumps = 0\n while (pos < n) :\n\n lastPos = pos\n\n for i in range(min(pos + jump, n - 1), pos - 1, -1) :\n if i == n - 1:\n return(jumps + 1)\n \n elif path[i] == 1 :\n jumps += 1\n pos = i\n break\n\n if lastPos == pos: return -1\n\n\nprint(solve())\n\n\n\n \t \t\t\t\t \t\t \t\t\t \t \t\t\t\t", "#910A\r\nn, d = map(int, input().split())\r\ns = input()\r\nif '0'*d in s:\r\n print(-1)\r\nelse:\r\n jump = 0\r\n i = 0\r\n while i < n-1:\r\n if s[i] == \"1\":\r\n i += d\r\n jump += 1\r\n else:\r\n i -= 1\r\n print(jump)\r\n", "n, d = map(int, input().split())\r\ns = input()\r\n\r\ncount = 0\r\ni = 0\r\nflag = False\r\nwhile True:\r\n j = d\r\n while j > 0:\r\n if i+j < n and s[i+j] == '1':\r\n count += 1\r\n i = i+j\r\n if i+1 == n:\r\n break\r\n j = d\r\n else:\r\n j -= 1\r\n if j == 0:\r\n print(-1)\r\n flag = True\r\n break\r\n elif i+1 == n:\r\n break\r\n i += 1\r\nif flag is False:\r\n print(count)\r\n", "n,d = map(int,input().split())\r\ns = list(input())\r\nnow = n - 1\r\nans = 0\r\nf = 0\r\nwhile now > 0:\r\n collect = -1\r\n for i in range(now-1,now-1-d,-1):\r\n if i < 0:\r\n break\r\n if s[i] == \"1\":\r\n collect = i\r\n if collect == -1:\r\n f += 1\r\n break\r\n else:\r\n now = collect\r\n ans += 1\r\nif f == 1:\r\n print(-1)\r\nelse:\r\n print(ans)", "n = [int(s) for s in input().split()]\r\na = list(input())\r\nm = 0\r\np = True\r\nr = 0\r\nwhile m!=(n[0]-1) and p:\r\n o = True\r\n for i in range(n[1]):\r\n k=m+n[1]-i\r\n if k<n[0]:\r\n if a[k]==\"1\" and o:\r\n m=k\r\n r+=1\r\n o = False\r\n if o:\r\n print(-1)\r\n p = False\r\n if m == (n[0]-1):\r\n print(r)", "n, d = map(int, input().split())\r\n\r\nA = input()\r\n\r\ndef solve():\r\n\tif A[-1] == '0': return -1\r\n\r\n\tcurrReachable = maxReachable = n - 1\r\n\tans = 1\r\n\r\n\tfor i in range(n - 2, -1, -1):\r\n\t\tif A[i] == '1':\r\n\t\t\tif i + d >= maxReachable:\r\n\t\t\t\tcurrReachable = i\r\n\t\t\telif i + d < maxReachable and currReachable - d <= i:\r\n\t\t\t\tans += 1\r\n\t\t\t\tmaxReachable = currReachable\r\n\t\t\t\tcurrReachable = i\r\n\r\n\t\t\telse:\r\n\t\t\t\treturn -1\r\n\r\n\treturn ans if currReachable == 0 else -1\r\n\r\nprint(solve())", "n, d = map(int, input().split())\nstones = input()\n\nteleport_count = [float('inf')] * n\nteleport_count[0] = 0\n\nfor i in range(1, n):\n if stones[i] == '1':\n for j in range(max(0, i - d), i):\n if teleport_count[j] != float('inf'):\n teleport_count[i] = min(teleport_count[i], teleport_count[j] + 1)\n\nif teleport_count[n - 1] == float('inf'):\n print(-1)\nelse:\n print(teleport_count[n - 1])\n \t \t \t \t\t\t \t \t\t \t", "n, d = map(int, input().split())\r\ns = input()\r\ni = 0\r\nf = False\r\ncnt = 0\r\nwhile(i != n-1):\r\n ind = -1\r\n for k in range(i+1, i+d+1):\r\n if(k >= len(s)):\r\n break\r\n if(s[k] == '1'):\r\n ind = k\r\n if(ind == -1):\r\n f = True\r\n break\r\n else:\r\n cnt += 1\r\n i = ind\r\n\r\nif(f):\r\n print(-1)\r\nelse:\r\n print(cnt)\r\n", "n, d= map(int, input().split())\r\np = 0\r\nls = list(str(input()))\r\nok = True\r\ntp = 0\r\ndef solve(pnt1,pnt2, arr):\r\n global tp\r\n pnt2= min(int(pnt1)+d, n-1)\r\n while(pnt2 != pnt1 and pnt2 != n-1):\r\n if(arr[pnt2]=='1'):\r\n pnt1 = int(pnt2)\r\n tp = max(tp, pnt2)\r\n return 1+solve(pnt1, pnt2, arr)\r\n else:\r\n pnt2-=1\r\n tp = max(tp, pnt2)\r\n if(arr[pnt2]=='1'):\r\n return 1\r\n else:\r\n return 0\r\nans = solve(0 ,d, ls)\r\nif(tp != n-1):\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "length, limit = map(int, input().split())\nbinary_string = input().strip()\n\ndistances = [float('inf')] * length\ndistances[0] = 0\n\nfor i in range(length):\n if binary_string[i] == '1':\n for j in range(1, limit + 1):\n if i + j < length and binary_string[i + j] == '1':\n distances[i + j] = min(distances[i + j], distances[i] + 1)\n\nif distances[-1] == float('inf'):\n print(\"-1\")\nelse:\n print(distances[-1])\n\n \t \t \t \t\t\t \t\t\t\t \t \t\t \t", "n, d = map(int, input().split())\r\narr = input()\r\n\r\npos = 0\r\ni = j = 0\r\nsteps = 0\r\nflag = 0\r\nwhile(pos<n-1):\r\n for i in range(d, 0, -1):\r\n if(pos+i<n and arr[pos+i]=='1'):\r\n steps+=1\r\n pos = pos+i \r\n break\r\n else:\r\n flag = 1\r\n print(-1)\r\n break\r\nif(flag == 0):\r\n print(steps)\r\n", "n, d = map(int, input().split())\r\ns = list(map(int, list(input())))\r\n\r\npos = 0\r\njumps = 0\r\nwhile pos != n-1:\r\n for i in range(min(pos+d, n-1), pos, -1):\r\n if s[i] == 1:\r\n pos = i\r\n jumps += 1\r\n break\r\n else:\r\n break\r\nprint(jumps if pos == n-1 else -1)", "x = [int(i) for i in input().split(' ')]\r\nn, d = x[0]-1, x[1]\r\npond = input()\r\ndef get_moves(pond, pos, d):\r\n return [pos+i for i in (range(1, d+1)) if 0<=pos+i < len(pond) and pond[pos+i] == '1']\r\ndef dfs(pond, pos, n, d):\r\n fringe = [(pos, 0)]\r\n visited = set([(pos, 0)])\r\n while fringe:\r\n new_pos, count = fringe.pop()\r\n if new_pos == n: return count\r\n for i in get_moves(pond, new_pos, d):\r\n fringe.append((i, count+1))\r\n visited.add((i, count+1))\r\n return -1\r\nif '0'*d in pond: print(-1)\r\nelse: print(dfs(pond, 0, n, d))\r\n \r\n", "n, d = map(int, input().split())\r\ns = input()\r\ndp = [n+1] * (n + 1)\r\ndp[1] = 0\r\nfor i in range(2, n + 1):\r\n for j in range(1, d + 1):\r\n if i - j > 0:\r\n if s[i-1] != '0':\r\n dp[i] = min(dp[i], dp[i-j] + 1)\r\nif dp[n] == n + 1:\r\n print(-1)\r\nelse:\r\n print(dp[n])", "a = input().split()\r\nn = int(a[0])\r\nd = int(a[1])\r\nline = str(input())\r\njumps = 0\r\ni = len(line) - 1\r\nwhile i > 0:\r\n possible = False\r\n for j in range(d, 0, -1):\r\n if i - j > -1:\r\n if int(line[i - j]) == 1:\r\n jumps += 1\r\n i -= j\r\n possible = True\r\n break\r\n if not possible:\r\n break\r\n #possible = False\r\nif not possible:\r\n print(-1)\r\nelse:\r\n print(jumps)\r\n", "n, d = map(int, input().split())\r\ns = input()\r\ni = 0\r\nc = 0\r\nwhile i < n - 1:\r\n j = i\r\n i = min(n - 1, i + d)\r\n while s[i] == '0':\r\n i -= 1\r\n if i == j:\r\n print(-1)\r\n exit()\r\n c += 1\r\nprint(c)", "[n,d]=list(map(int,input().split()));\r\ns=list(map(int,list(input())));\r\nf=True;\r\ni=n-1;\r\nc=0\r\nwhile(i>0):\r\n k=i;\r\n for j in range(i-d,i+1):\r\n if(s[j]==1):c+=1;i=j;break;\r\n if(k==i):f=False;break\r\nif(f):print(c);\r\nelse:print(-1);\r\n", "n,d=map(int,input().split())\r\ns=str(input())\r\nind=0\r\ncount=0\r\nwhile ind<n-1:\r\n h = min(d, n-ind-1)\r\n while s[ind+h]==\"0\":\r\n h -= 1\r\n if h>0:\r\n count += 1\r\n ind += h\r\n else:\r\n count = -1\r\n break\r\nprint(count)\r\n\r\n ", "ii=lambda: int(input())\r\niin=lambda: map(int,input().split())\r\nil=lambda: list(map(int,input().split()))\r\n\r\nm,n=iin()\r\na=list(input())\r\ni=flag=count=0\r\n\r\n\r\nwhile(i<m):\r\n temp=i\r\n if(i==m-1):\r\n break\r\n for j in range(min(m-1,i+n),i,-1):\r\n if(a[j]==\"1\"):\r\n i=j\r\n count+=1\r\n break\r\n if(temp==i):\r\n # print(temp,j,a,i)\r\n print(-1)\r\n flag=1\r\n break\r\n # print(temp,i)\r\nif(a[0]==\"0\"):\r\n flag=1\r\n print(-1)\r\nif(flag==0):\r\n print(count)\r\n \r\n \r\n \r\n \r\n ", "actual = 0\ncont = 0\nans = 0\nsig = 0\ndis = 0\nA, B = map(int, input().split())\nn = input()\n \nwhile sig < A :\n cont = 0\n actual = sig\n dis = B + 1\n \n for i in range(1,dis) :\n if actual + i < A and n[actual + i] == '1' : \n sig = actual + i\n cont = 1\n \n if cont == 0 :\n break\n else :\n ans += 1\n \n \nif sig != A - 1 : \n print (-1)\nelse : \n print (ans)\n\t \t \t \t \t \t \t \t\t \t\t\t", "n, d = map(int, input().split())\r\ns = input()\r\npos, res = 0, 0\r\nwhile pos < len(s) - 1:\r\n r = pos\r\n for i in range(pos, min(len(s), pos + d + 1)):\r\n if s[i] == '1':\r\n pos = i\r\n if pos == r:\r\n print(\"-1\")\r\n exit()\r\n res += 1\r\nprint(res)\r\n", "n,d = map(int,input().split())\r\n\r\nnum = 0 #distance from the last step\r\nv = 0 #value of steps\r\na = 1 #flag for excistence\r\nk = 0 #coord. of the last step variant destination\r\n\r\nst = input()\r\n\r\nfor i in range(1,n):\r\n num+=1\r\n if int(st[i]) == 1:\r\n k = num\r\n if num%d == 0:\r\n if k!=0:\r\n num = num - k\r\n v+=1\r\n else:\r\n a = 0 \r\n k = 0\r\n \r\nif a==1:\r\n if num%d == 0:\r\n print(v)\r\n else:\r\n print(v+1)\r\nelse:\r\n print(-1)", "def ria():\r\n return [int(x) for x in input().split()]\r\na,b=ria();\r\np=input().split()[0]\r\ni=0;\r\nk=0;\r\nn=len(p)\r\nwhile(i!=n-1):\r\n ren=min(n-1,i+b);\r\n while(p[ren]!='1'):\r\n ren-=1\r\n if(i==ren):\r\n print(-1);\r\n exit(0)\r\n else:\r\n i=ren;\r\n k+=1\r\nprint(k);\r\n\r\n", "x = input().split()\nn = int(x[0])\nd = int(x[1])\ns = input()\n\nflag = False\ni=0\nsteps = 0\nwhile True:\n\t#find next jump\n\tj = i+d\n\tif j >= n-1:\n\t\tflag = True\n\t\tsteps+=1\n\t\tbreak\n\t\t\n\twhile j > i and s[j] != '1':\n\t\tj-= 1\n\tif j == i:\n\t\tbreak\n\ti = j\n\tsteps+=1\n\t\nif flag:\n\tprint(steps)\nelse:\n\tprint(-1)\n\t\n\t\n", "from math import ceil\r\nn,d=[int(i) for i in input().split()]\r\nline=input()\r\nif n==2:\r\n print(1)\r\nelse:\r\n k=0\r\n c=0\r\n flag=1\r\n while k<n-1:\r\n m=min(k+d+1,n)\r\n p=k\r\n for i in range(k,m):\r\n if line[i]==\"1\":\r\n p=i\r\n if p==k:\r\n flag=0\r\n\r\n break\r\n else:\r\n c+=1\r\n k=p\r\n if flag==1:\r\n print(c)\r\n else:\r\n print(-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n, d = map(int, input().split())\r\ns = list(map(int, input()))\r\n\r\na = [-1] * n\r\na[0] = 0\r\n\r\nfor i in range(1, n):\r\n if not s[i]:\r\n continue\r\n min_val = -1\r\n for j in range(1, d + 1):\r\n k = i - j\r\n if k < 0:\r\n break\r\n if a[k] < 0:\r\n continue\r\n if min_val < 0 or a[k] < min_val:\r\n min_val = a[k]\r\n if min_val >= 0:\r\n a[i] = min_val + 1\r\n\r\nprint(a[n - 1])\r\n", "n,d=map(int,input().split())\r\nx=input()\r\ni=0\r\nc=0\r\nf=0\r\nwhile i < n-d:\r\n t=d\r\n # print(x[i:i+t])\r\n while x[i+t]!='1' and t>0:\r\n t-=1\r\n if t == 0 :\r\n f=1\r\n break\r\n else:\r\n c+=1\r\n i+=t\r\n# print(i)\r\nif f==1:\r\n print(-1)\r\nelse:\r\n if i!=n-1:\r\n print(c+1)\r\n else:\r\n print(c)", "def jumps(n, d, s):\n dp = [float('inf')] * n\n dp[0] = 0\n\n for i in range(1, n):\n if s[i] == '1':\n for j in range(1, min(i, d) + 1):\n dp[i] = min(dp[i], dp[i - j] + 1)\n\n if dp[n - 1] == float('inf'):\n return -1\n else:\n return dp[n - 1]\n\nn, d = map(int, input().split())\ns = input()\n\nresult = jumps(n, d, s)\nprint(result)\n\n \t \t \t \t \t \t\t \t \t\t", "def fun(s,n,d):\r\n count=0\r\n i=0\r\n while(i<n-1):\r\n j=i+d\r\n while(j>=n):\r\n j-=1\r\n while(s[j]!='1'):\r\n j-=1\r\n if(j==i):\r\n return -1\r\n count+=1\r\n i=j\r\n return count\r\n\r\nn,d=list(map(int,input().split()))\r\ns=input()\r\nprint(fun(s,n,d))\r\n", "n, d=input().split()\r\nn=int(n)\r\nd=int(d)\r\ns=input()\r\ni=0\r\nsom=False\r\nq=0\r\nwhile i!=n-1:\r\n if i<n-1-d:\r\n p=i\r\n for j in reversed(range(i, i+d+1)):\r\n if s[j]=='1':\r\n i=j\r\n q+=1\r\n break\r\n if i==p:\r\n som=True\r\n break\r\n else:\r\n q+=1\r\n i=n-1\r\nif som:\r\n print(-1)\r\nelse:\r\n print(q)", "import math\r\nn,d = map(int, input().split())\r\ns = input()\r\nf = len(s)\r\nl = []\r\nfor i in range(f):\r\n l.append(int(s[i]))\r\n# print(l)\r\np = l.copy()\r\nfor i in range(f):\r\n if l[i] == 1:\r\n p[i] = i\r\n else:\r\n p[i] = p[i-1]\r\n# print(p)\r\nk = 0\r\ni = 0\r\nc = 0\r\nm = 0\r\nwhile i!=n-1:\r\n if i+d<f-1:\r\n m = p[i + d]\r\n else:\r\n m = f-1\r\n # print('m = ',m)\r\n if m == i:\r\n k = 1\r\n print(-1)\r\n break\r\n else:\r\n i = m\r\n # print('i = ',i)\r\n c += 1\r\nif k!=1:\r\n print(c)", "import math\r\n\r\ndef s():\r\n n,d = [int(x) for x in input().split(\" \")]\r\n arr = input()\r\n current_pos = 0\r\n jumps = 0\r\n \r\n while True:\r\n not_possible = True\r\n for i in range (d,0,-1):\r\n if current_pos+i > n-1:\r\n continue\r\n elif arr[current_pos+i] == \"1\":\r\n current_pos += i\r\n jumps += 1\r\n not_possible = False\r\n break\r\n if not_possible:\r\n print(-1)\r\n break\r\n elif current_pos == n-1:\r\n print(jumps)\r\n break\r\n\r\n \r\ns()\r\n", "n, d =list(map(int, input().split()))\r\nz = 0\r\na = list(map(int, list(input())))\r\nMX = 0\r\ni = 1\r\ncoun = 1\r\nwhile i < n:\r\n \r\n if z == d:\r\n z = 0\r\n if MX == 0:\r\n print(-1)\r\n break\r\n else:\r\n i = MX + 1\r\n MX = 0\r\n \r\n \r\n coun += 1\r\n if a[i] == 1:\r\n MX = i\r\n i += 1\r\n z += 1\r\nif i == n:\r\n print(coun)", "n, d = map(int, input().split());\ns = input();\nans = 0;\ni = 0;\ncan = True;\nwhile i < n - 1 and can:\n can = False;\n nxt = -1;\n for k in range(1, d + 1):\n j = i + k;\n if(j == n):\n break;\n if(s[j] == '1'):\n can = True;\n nxt = j;\n ans += 1;\n i = nxt;\nif(not can):\n print(-1);\nelse:\n print(ans);\n\n \t \t\t\t\t \t\t \t \t \t \t \t", "a,b = map(int,input().split())\r\nc = input()\r\nd = b*\"0\"\r\nif d in c:\r\n print(-1)\r\nelse:\r\n e = 0;f = 0\r\n while e < a-1 and f < a:\r\n if c[e] == \"1\":\r\n e += b\r\n f += 1\r\n else:\r\n e -= 1\r\n print(f)\r\n \r\n \r\n \r\n", "line = list(map(int, input().split()))\r\nend = line[0]\r\nmaxJump = line[1]\r\nseq = list(map(int, input()))\r\ni = 0\r\njumpCounter = 0\r\n\r\nwhile(maxJump > 0):\r\n nextJump = i + maxJump\r\n if(nextJump > end - 1):\r\n maxJump -= 1\r\n elif(nextJump == end - 1):\r\n jumpCounter += 1\r\n print(jumpCounter)\r\n break\r\n else:\r\n if(seq[nextJump] == 1):\r\n i = nextJump\r\n maxJump = line[1]\r\n jumpCounter += 1\r\n else:\r\n maxJump -= 1\r\nif(nextJump != end - 1):\r\n print(- 1)", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,d = map(int, wtf[0].split())\r\n S = wtf[1]\r\n ans = 0\r\n i = 1\r\n while i < n:\r\n L = S[i:i+d]\r\n j = L.find('1')\r\n if j == -1:\r\n ans = -1\r\n break\r\n ans += 1\r\n i += len(L) - L[::-1].index('1')\r\n print(ans)\r\n", "inp=input().split(' ')\r\nn,d=int(inp[0]),int(inp[1])\r\ns=input()\r\nq=[0]*10000\r\nhead,end=0,1\r\nq[0]=1\r\nlast=[0]*10000\r\nf=False\r\nwhile head!=end:\r\n now=q[head]\r\n \r\n head+=1\r\n if now==n:\r\n \r\n f=True\r\n \r\n for to in range(now+1,min(now+d,n)+1):\r\n if to>n:break\r\n if s[to-1]=='1'and last[to]==0:\r\n q[end]=to\r\n end+=1\r\n last[to]=now\r\n\r\nif f:\r\n p=n\r\n cost=0\r\n while p!=1:\r\n cost+=1\r\n p=last[p]\r\n print(cost)\r\nelse :\r\n print(-1)\r\n \r\n \r\n", "n, d = map(int, input().split())\r\ns = input()\r\n\r\nt = 0\r\nok = True\r\nl = 1\r\nwhile l < n and ok:\r\n\tk = l + d\r\n\t\r\n\tif k > n:\r\n\t\tk = n\r\n\t\r\n\twhile s[k - 1] == '0':\r\n\t\tk -= 1\r\n\t\r\n\tif k == l:\r\n\t\tok = False\r\n\t\tbreak\r\n\t\r\n\tl = k\r\n\tt += 1\r\n\r\nif not ok:\r\n\tprint(-1)\r\nelse:\r\n\tprint(t)", "n,d = map(int, input().split())\r\nli = list(map(int, input()))\r\ndist = [10000]*n\r\ndist[0] = 0\r\nfor i in range(n):\r\n if li[i] == 1:\r\n for j in range(d+1):\r\n if i+j < n and li[i+j] == 1:\r\n dist[i+j] = min(dist[i+j],dist[i]+1)\r\nif dist[n-1] == 10000:\r\n print(-1)\r\nelse:\r\n print(dist[n-1])", "n, d = map(int, input().split())\r\n# a = list(map(int, input().split()))\r\ns = input()\r\njumps = 0\r\na = 1\r\npos = 0\r\ncheck = 0\r\nk = d\r\ni = 0\r\nwhile i < len(s) - 1:\r\n #print(i)\r\n fupos = i + min(d,len(s) - i - 1)\r\n if s[fupos] == '1':\r\n jumps += 1\r\n i = fupos\r\n elif s[fupos] != '1':\r\n while s[fupos] != '1':\r\n fupos -= 1\r\n if s[fupos] == '1':\r\n if fupos == i:\r\n print(\"-1\")\r\n check = 1\r\n i = len(s) + 1\r\n break\r\n elif fupos != i:\r\n i = fupos\r\n jumps += 1\r\n elif s[fupos] != '1':\r\n print(\"-1\")\r\n check = 1\r\n i = len(s) + 1\r\n break\r\nif check == 0:\r\n print(jumps)", "n=[int(i) for i in input().split()]\r\na=str(input())\r\nfor i in range(n[1]):\r\n a+='0'\r\nd=n[1]\r\nskak=0\r\npr=d\r\nans=0\r\nwhile skak<n[0]-1 and pr>0:\r\n pr=d\r\n \r\n while a[pr+skak]!='1' and pr!=0:\r\n \r\n pr-=1\r\n skak=pr+skak\r\n ans+=1\r\nif pr==0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n ", "n,d=map(int,input().strip().split(' '))\r\narr=input()\r\ndp=[10000 for i in range(1000)]\r\ndp[0]=0\r\ni=1\r\nwhile(i<n):\r\n\r\n\tif(arr[i]=='1'):\r\n\t\t\r\n\t\tfor j in range(i-1,max(-1,i-d-1),-1):\r\n\t\t\t\r\n\t\t\tdp[i]=min(dp[i],dp[j]+1)\r\n\ti+=1\r\n\r\nif(dp[n-1]==10000):\r\n\tprint(-1)\r\nelse:\r\n\tprint(dp[n-1])\r\n", "n,d=map(int,input().split())\r\ns=input()\r\ndp=[float('inf')]*(n)\r\ndp[0]=0\r\nans=0\r\nfor i in range(n-1):\r\n if s[i]=='1':\r\n flag=False\r\n for j in range(i+1,min(i+d+1,n)):\r\n if s[j]=='1':\r\n flag=True\r\n dp[j]=min(dp[j],dp[i]+1)\r\n #print(i,j)\r\n if flag==False:\r\n ans=-1\r\n break\r\n #print(dp,ans)\r\nif ans==0 and s[-1]!=1:\r\n print(dp[-1])\r\nelse:\r\n print(-1)", "n, d = map(int, input().split())\nmagicMap = input()\nteletrans= [0] + [n+1] * (n-1)\n\nfor i in range(1, n):\n if magicMap[i] == '1':\n for j in range(1, d+1):\n if i -j >= 0:\n teletrans[i] = min(teletrans[i], teletrans[i-j] + 1)\nif teletrans[n-1] == n + 1:\n print(-1)\nelse:\n print(teletrans[n-1])\n\n \t\t \t \t\t \t\t\t\t \t\t\t\t\t\t \t \t \t\t", "n, d = map(int, input().split())\r\n\r\ns = input()\r\ni = 0\r\nans = 0\r\n\r\nwhile i < n-1:\r\n ind = -1\r\n for j in range(i+1, min(i+d+1, n)):\r\n if s[j] == \"1\":\r\n ind = j\r\n if ind != -1:\r\n #print(ind+1)\r\n ans += 1\r\n i = ind\r\n else:\r\n print(\"-1\")\r\n exit()\r\nprint(ans)\r\n \r\n", "def minimal_jumps(n, d, s):\n jumps = [float('inf')] * n\n jumps[0] = 0\n \n for i in range(1, n):\n if s[i] == '1':\n for j in range(1, min(i, d) + 1):\n if s[i-j] == '1':\n jumps[i] = min(jumps[i], jumps[i-j] + 1)\n \n return jumps[-1] if jumps[-1] != float('inf') else -1\n\nn, d = map(int, input().split())\ns = input()\n\nresult = minimal_jumps(n, d, s)\nprint(result)\n\t\t\t \t\t \t \t\t \t\t\t \t\t\t \t\t", "n,d=map(int,input().split())\r\nstr=input()\r\na=[]\r\nfor i in str:\r\n a.append(int(i))\r\ni=0;jump=0\r\nwhile(i<n-d):\r\n mis=0\r\n for j in range(i+d,i,-1):\r\n if(a[j]==1):\r\n jump+=1\r\n i=j\r\n break\r\n else:\r\n mis+=1\r\n if(mis==d):\r\n break\r\nif(n-1-i>d):\r\n print(-1)\r\nelif(n-1-i==0):\r\n print(jump)\r\nelse:\r\n print(jump+1)", "import sys\r\n\r\nn,d = map(int,input().split())\r\nli = list(input())\r\nnow = 0\r\nans = 0\r\n\r\nwhile True:\r\n if now+d >= n:\r\n for i in range(n-now-1,0,-1):\r\n if li[now+i] == \"1\":\r\n now += i\r\n ans += 1\r\n break\r\n if i == 1:\r\n print(-1)\r\n sys.exit()\r\n else:\r\n for i in range(d,0,-1):\r\n if li[now+i] == \"1\":\r\n now += i\r\n ans += 1\r\n break\r\n if i == 1:\r\n print(-1)\r\n sys.exit()\r\n if now == n-1:\r\n print(ans)\r\n break", "def torremagos(dados, caminho):\r\n n, d = map(int, dados.split())\r\n tp = 0\r\n pos = 0\r\n\r\n while pos < n - 1:\r\n casa_alcance = -1 \r\n\r\n for i in range(1, d + 1):\r\n if pos + i >= n:\r\n break\r\n if caminho[pos + i] == '1':\r\n casa_alcance = pos + i\r\n\r\n if casa_alcance == -1:\r\n return -1\r\n\r\n pos = casa_alcance \r\n tp += 1\r\n\r\n return tp\r\n\r\ndados = input()\r\ncaminho = input()\r\nprint(torremagos(dados, caminho))\r\n", "n, d = map(int, input().split())\r\ns = [int(i) for i in input()]\r\nt = 0\r\nstep = 0\r\nwhile t < n:\r\n if t + 1 == n:\r\n break\r\n move = False\r\n for i in range(d, 0, -1):\r\n if t+i < n:\r\n if s[t+i] == 1:\r\n t += i\r\n step += 1\r\n move = True\r\n break\r\n if move is False:\r\n print(\"-1\")\r\n break\r\n\r\nif t >= n - 1:\r\n print(step)\r\n\r\n", "n,k=map(int,input().split())\r\ns=input()\r\ns=[i for i in s]\r\ndp=[10**9 for i in range(n+1)]\r\ndp[0]=0\r\nfor i in range(n):\r\n for j in range(k+1):\r\n if i+j<n and s[i+j]==\"1\":\r\n dp[i+j]=min(dp[i+j],dp[i]+1)\r\n\r\nif dp[n-1]==10**9:\r\n print(-1)\r\nelse:\r\n print(dp[n-1])\r\n", "n,d = map(int,input().split())\r\ns = input()\r\ni=0\r\nno_change = True\r\ncount=0\r\nwhile i<n-1:\r\n no_change = True\r\n for k in range(1,d+1):\r\n if i+k<n and s[i+k]==\"1\":\r\n #print(\"count:\",count)\r\n #print(\"i before: \",i)\r\n next_i = max(i,i+k)\r\n #print(\"i after: \",next_i)\r\n no_change = False\r\n if no_change:\r\n count=-1\r\n break\r\n else:\r\n count+=1\r\n i=next_i\r\nprint(count)\r\n ", "n,d = map(int,input().split())\r\ns = input()\r\npos = 0\r\nans=0\r\nwhile(1):\r\n if(pos+d<len(s)):\r\n for i in range(pos+d,pos,-1):\r\n if(s[i]=='1'):\r\n pos = i\r\n ans+=1\r\n break\r\n else:\r\n ans = -1\r\n \r\n else:\r\n ans+=1\r\n break\r\n \r\n #print(pos)\r\n \r\n if(ans == -1 or pos == n-1):\r\n break\r\n \r\nprint(ans)", "n,d = map(int,input().split())\r\ns = input()\r\nans = 0\r\nnum = 1\r\nwhile num < n:\r\n temp = s[num : num+d].rfind('1')\r\n if temp == -1:\r\n ans = -1\r\n break\r\n ans += 1\r\n num = num + temp + 1\r\nprint(ans)\r\n", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nfrom collections import defaultdict\nn,de=M()\ns=input().strip()\nx=[]\nx.append((1,0))\nd=defaultdict(lambda:10**10)\nd[1]=0\nans=10**10\nwhile(len(x)!=0):\n w=x[0]\n if(w[0]==n):\n ans=min(ans,w[1])\n for i in range(w[0],min(n,w[0]+de)):\n if(s[i]=='1' and w[1]+1<d[i+1]):\n d[i+1]=w[1]+1\n x.append((i+1,w[1]+1))\n x=x[1::]\nif(d[n]==10**10):\n print(-1)\nelse:\n print(d[n])\n", "\r\nactual = 0\r\ncont = 0\r\nans = 0\r\nsig = 0\r\nA, B = map(int, input().split())\r\nn = input()\r\n\r\nwhile sig < A :\r\n cont = 0\r\n actual = sig\r\n for i in range(1, B + 1) :\r\n if actual + i < A and n[actual + i] == '1' : \r\n sig = actual + i\r\n cont = 1\r\n if cont == 0 :\r\n break\r\n else :\r\n ans += 1\r\nif sig == A - 1 : \r\n print (ans)\r\nelse : \r\n print (\"-1\")", "n, d = map(int, input().split())\r\ns = [int(x) for x in list(input())]\r\n#print(s)\r\ncur = 0\r\nres = 0\r\nprev = 0\r\nflag = True\r\nfor i in range(1, n):\r\n if s[i]:\r\n if i - cur <= d: prev = i\r\n elif prev != cur and i - prev <= d:\r\n cur = prev\r\n res += 1\r\n prev = i\r\n else:\r\n flag = False\r\n break\r\nif n - cur - 1 <= d: res += 1\r\nelif prev != cur: res += 2\r\nelse: flag = False\r\nif flag: print(res)\r\nelse: print(-1)", "n,d = map(int,input().split())\ns = input()\ni = 0\nr = 0\nwhile 1:\n for j in range(d,0,-1):\n if i+j < n:\n if i+j == n-1:\n print(r+1)\n exit(0)\n if s[i+j]=='1':\n r+=1\n i+=j\n break\n if j==1 and s[i+j]=='0':\n print(-1)\n exit(0)", "n, d = [int(t) for t in input().split()]\r\nb = [int(t) for t in input()]\r\na = [1000] * n\r\n\r\na[-1] = 0\r\nfor i in range(1, d + 1):\r\n if b[n - 1 - i]:\r\n a[n - 1 - i] = 1\r\n\r\nfor j in range(n - d):\r\n if b[n - d - 1 - j]:\r\n a[n - d - 1 - j] = min(a[n - d - j:n - j]) + 1\r\n\r\nprint(a[0] if a[0] < 1000 else -1)", "n, m = map(int, input().split())\ncadeia = input()\n\ndistancia = [10000] * n\n\ndistancia[0] = 0\nfor i in range(n):\n if cadeia[i] == '1':\n for j in range(m + 1):\n if i + j < n and cadeia[i + j] == '1':\n distancia[i + j] = min(distancia[i + j], distancia[i] + 1)\n\nif distancia[n - 1] == 10000:\n print(\"-1\")\nelse:\n print(distancia[n - 1])\n\n\t \t\t\t\t \t\t \t\t \t\t \t \t\t \t\t", "n, d = map(int, input().split())\ns = input()\n\ncur_pos = 0\njump_count = 0\n\nwhile cur_pos < n - 1:\n next_jump = min(d, n - 1 - cur_pos)\n next_pos = cur_pos + next_jump\n if s[next_pos] == '0':\n found = False\n for i in range(next_pos, cur_pos, -1):\n if s[i] == '1':\n cur_pos = i\n jump_count += 1\n found = True\n break\n if not found:\n print(-1)\n break\n else:\n cur_pos = next_pos\n jump_count += 1\n\nif cur_pos == n - 1:\n print(jump_count)\n\t \t \t\t\t\t \t \t\t \t\t\t \t\t", "_,x = map(int,input().split())\r\ns = input()\r\ni = 0\r\nk = 0\r\nwhile i<len(s)-1:\r\n for j in reversed(range(1,x+1)):\r\n try:\r\n if s[i+j] == '1':\r\n i += j\r\n break\r\n except:\r\n pass\r\n else:\r\n print(-1)\r\n quit()\r\n k+=1\r\nprint(k)", "n,d = map(int,input().split())\r\npole = input()\r\npozice = 0\r\na = 0\r\nwhile pozice < n-1:\r\n q = 0\r\n for i in range(d):\r\n \r\n if pozice+d-i < n:\r\n if pole[pozice+d-i] == '1':\r\n pozice = pozice+d-i\r\n q = 1\r\n a+=1\r\n break\r\n if q == 0:\r\n print(-1)\r\n break\r\n \r\nif pozice >= n-1:\r\n print(a)\r\n", "n,m=map(int,input().split())\r\na=input()\r\ni=0\r\njump=0\r\nwhile(i!=n-1):\r\n for j in range(m,0,-1):\r\n if((i+j)<n):\r\n if(a[i+j]==\"1\"):\r\n i+=j\r\n jump+=1\r\n break\r\n else:\r\n jump=-1\r\n break\r\nprint(jump)\r\n", "inp = input().split()\r\nn = int(inp[0])\r\nd = int(inp[1])\r\ndp = [-1 for _ in range(n)]\r\ndp[0] = 0\r\ns = input()\r\n\r\nfor index, current in enumerate(s):\r\n\r\n if current == \"0\" or index == 0:\r\n continue\r\n\r\n start = 0 if index - d < 0 else index - d\r\n min_ = float('inf')\r\n for step in range(start, index):\r\n if s[step] == \"1\":\r\n min_ = min(min_, dp[step])\r\n dp[index] = min_ + 1\r\nif dp[-1] != float('inf'):\r\n print(dp[-1])\r\nelse:\r\n print(\"-1\")\r\n", "X, Lines, index, Counter = list(map(int, input().split())), input(), 0, 0\r\nif \"0\" * X[1] in Lines:\r\n print(-1)\r\n exit()\r\nwhile index < X[0] - 1:\r\n Counter += 1\r\n index += Lines[index: index + X[1] + 1].rindex(\"1\")\r\nprint(Counter)\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Behind my desk in Bojnurd\r\n# Caption: While testing some newcomer\r\n# CodeNumber: 682\r\n", "# https://codeforces.com/problemset/problem/910/A\n\nn,d = map(int,input().split())\ns = input()\ndp = [n for x in range(n+1)]\ndp[1] = 0\nfor x in range(1,n+1):\n if s[x-1]=='1':\n for y in range(x+1,min(n,x+d)+1):\n dp[y] = min(dp[y],1+dp[x])\nprint(-1 if dp[n]==n else dp[n])", "n, d = map(int, input().split())\r\ns = input()\r\nind = 0\r\nans = 0\r\nn -= 1\r\nwhile ind != n:\r\n a = d\r\n if ind + a >= n:\r\n ans += 1\r\n break\r\n while s[ind + a] != '1' and a != 0:\r\n a -= 1\r\n if a == 0:\r\n ans = -1\r\n break\r\n ans += 1\r\n ind += a\r\nprint(ans)\r\n", "# https://codeforces.com/problemset/problem/910/A\r\n\r\nn, d = map(int, input().split())\r\n\r\ns = input()\r\nfirst = 0\r\npointer = d\r\ncount = 0\r\n\r\nwhile pointer < n:\r\n while pointer > first:\r\n if s[pointer] == '1':\r\n count += 1\r\n\r\n break\r\n pointer -= 1\r\n if pointer == first:\r\n print(-1)\r\n break\r\n else:\r\n first = pointer\r\n pointer += d\r\nelse:\r\n if first != n - 1:\r\n print(count+1)\r\n else:\r\n print(count)\r\n\r\n", "n,d = map(int,input().split())\r\nr = input()\r\nzero = '0'* d\r\nif (zero in r) == True:\r\n\tprint('-1')\r\nelse:\r\n\ti = 0\r\n\tjump = 0\r\n\twhile i < (n-1):\r\n\t\tif r[i] == '1':\r\n\t\t\tjump += 1\r\n\t\t\ti += d\r\n\t\t\tif i >= n:\r\n\t\t\t\ti = (n-1)\r\n\t\telif r[i] == '0':\r\n\t\t\ti -= 1\r\n\tprint(jump)", "n,d=map(int,input().split())\r\nn-=1\r\ns,q,w=input(),0,0\r\nwhile q!=n:\r\n for i in range(d,-1,-1):\r\n if i==0:exit(print(-1))\r\n if q+i<n+1:\r\n if s[q+i]==\"1\":\r\n q+=i\r\n w+=1\r\n break\r\nprint(w)", "n,m=map(int,input().split())\r\na=str(input())\r\nst=0\r\nsp=0\r\nwhile st<n-1:\r\n i=min(st+m,n-1)\r\n while a[i]!='1':\r\n i-=1\r\n if i==st:\r\n print(-1)\r\n exit()\r\n st=i\r\n il=st\r\n sp+=1\r\nprint(sp)\r\n", "n,m = map(int,input().split())\na = input()\ni=j= 0\nwhile i<n-1 and j<n:\n if a[i] == '1':\n i += m\n j += 1\n else :\n i -= 1\nif j >= n:\n print(-1)\nelse :\n print(j)\n\t \t\t \t \t\t \t \t \t \t \t \t \t \t", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:19/04/2020\r\n\r\n'''\r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\n\r\n\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\n\r\ndef main():\r\n \r\n n,k=mi()\r\n s=si()\r\n a=[]\r\n for i in range(n):\r\n if(s[i]=='1'):\r\n a.append(i+1)\r\n \r\n x=a[0]\r\n c=0\r\n f=0\r\n while(x<n):\r\n c+=1\r\n x1=bisect(a,x+k)\r\n if(x>=a[x1-1]):\r\n f=1\r\n break\r\n x=a[x1-1]\r\n if(f==1):\r\n print(\"-1\")\r\n else:\r\n print(c)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n \r\n main()", "n,d = map(int,input().split())\ncam = input()\ncont = 0\ndes = 0\n\nwhile des < n-1 and cont <n:\n if cam[des] =='1':\n des+=d\n cont+=1\n else :\n des -= 1\n\n \n #for i in range(n,des):\n #if cam[i-1] == \"1\":\n #cont += 1\n #des += d\n #else:\n #cont+=1\n \nif cont>=n:\n print(-1)\nelse : \n print(cont)\n\t \t \t \t \t \t\t\t\t\t \t", "def min_teleports(n, d, magic_stones):\n \n min_teleports = [-1] * n\n min_teleports[0] = 0\n\n for i in range(1, n):\n if magic_stones[i] == '1':\n for j in range(i - 1, max(i - d - 1, -1), -1):\n if min_teleports[j] != -1 and (min_teleports[i] == -1 or min_teleports[j] + 1 < min_teleports[i]):\n min_teleports[i] = min_teleports[j] + 1\n\n if min_teleports[-1] == -1:\n return -1\n else:\n return min_teleports[-1]\nn, d = map(int, input().split())\nmagic_stones = input()\n\nresult = min_teleports(n, d, magic_stones)\nprint(result)\n\t\t\t \t \t \t \t\t \t\t\t\t \t \t \t\t\t", "#################### Problems from CodeForces solved by Sohaib Moradi aka Shmits ####################\r\n\r\n######################################################################### 1\r\n###### World Cup ###### A problem from CodeForces ###### Wordl Cup ######\r\n ## tags: binary search, math\r\n\r\n# def func(As, n, entranceNum=0):\r\n#\r\n# Min = min(As)\r\n# p = entranceNum\r\n#\r\n# while True:\r\n# if As[p] == 0:\r\n# return p+1\r\n#\r\n# if p != n-1:\r\n# for i in range(p + 1, n): # checking the right side of position p in As for possible answer after 'Min'\r\n# # steps\r\n# d = i - p # distance between position i in As and position p in As (Right side)\r\n# if As[i] <= d:\r\n# return i + 1\r\n#\r\n# for i in range(p): # checking the left side of position p in As for possible answer after 'Min' steps\r\n# d = n - p + i # distance between position i in As and position p in As (Left side)\r\n# if As[i] <= d:\r\n# return i + 1\r\n#\r\n# As = [As[i] - Min for i in range(n)]\r\n# p = (Min % n + p) % n\r\n# Min = min(As)\r\n#\r\n#\r\n# num = int(input())\r\n# A = list(map(int, input().split(\" \")))\r\n#\r\n# print(func(A, num))\r\n#########################################################################\r\n\r\n######################################################################### 2\r\n###### Hit the Lottery ###### A problem from CodeForces ###### Hit the Lottery ######\r\n ## tags: dp, greedy\r\n\r\n############ greedy approach ############\r\n# coins = [1, 5, 10, 20, 100]\r\n#\r\n# cash = int(input())\r\n# coinsNum = 0\r\n# for i in range(len(coins)-1, -1, -1):\r\n# coinsNum += cash//coins[i]\r\n# cash = cash % coins[i]\r\n# if cash == 0:\r\n# break\r\n# print(coinsNum)\r\n\r\n############ dp approach ############\r\n# def minimumCoinsNeeded(coins, cash):\r\n#\r\n# dp = [0] * (cash + 1)\r\n#\r\n# for i in range(1, cash + 1):\r\n# for coin in coins:\r\n# if i - coin >= 0:\r\n# if dp[i] == 0:\r\n# dp[i] = dp[i - coin] + 1\r\n# else:\r\n# dp[i] = min(dp[i], dp[i - coin] + 1)\r\n#\r\n# return dp[cash]\r\n#\r\n# cash = int(input())\r\n# coins = [1, 5, 10, 20, 100]\r\n# print(minimumCoinsNeeded(coins, cash))\r\n#########################################################################\r\n\r\n######################################################################### 3\r\n###### Maximum Increase ###### A problem from CodeForces ###### Maximum Increase ######\r\n ## tags: dp, greedy, implementation\r\n\r\n# n = int(input())\r\n#\r\n# arr = list(map(int, input().split(\" \")))\r\n# lens = [1 for i in arr]\r\n#\r\n# for i in range(1, len(arr)):\r\n# if arr[i] > arr[i-1]:\r\n# lens[i] += lens[i-1]\r\n#\r\n# print(max(lens))\r\n#########################################################################\r\n\r\n######################################################################### 4\r\n###### Fair Division ###### A problem from CodeForces ###### Fair Division ######\r\n ## tags: dp, greedy, math\r\n\r\n# n = int(input())\r\n#\r\n# for i in range(n):\r\n# t = int(input())\r\n# arr = list(map(int, input().split(\" \")))\r\n# ones = arr.count(1)\r\n# twos = arr.count(2)\r\n#\r\n# # if there are no cakes with weight 1, then the number of cakes with weight 2 should be even\r\n# if ones == 0 and twos % 2 == 0:\r\n# print(\"YES\")\r\n# elif ones % 2 == 0 and ones != 0: # only the count of cakes with weight 1 matters\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n#########################################################################\r\n\r\n######################################################################### 5\r\n###### QAQ ###### A problem from CodeForces ###### QAQ ######\r\n ## tags: brute force, dp\r\n\r\n# str = input()\r\n# n = len(str)\r\n# Qs = [0 for i in range(n+1)]\r\n# As = []\r\n#\r\n# for i in range(n):\r\n# if str[i] == \"Q\":\r\n# # counting the number of Qs from the beginning\r\n# # to the Ith character of the string\r\n# Qs[i+1] = Qs[i] + 1\r\n# else:\r\n# Qs[i + 1] = Qs[i]\r\n# if str[i] == \"A\":\r\n# # storing the index of A's occurrence in the string\r\n# As.append(i)\r\n#\r\n# numOfSub = 0\r\n# for j in As:\r\n# # Qs[n] - Qs[j+1] = the number of Qs from the Ith character\r\n# # to the end of the string\r\n# # number of Qs on the left of A * number of the Qs on the right of A == numOfSub\r\n# numOfSub += Qs[j+1] * (Qs[n] - Qs[j+1])\r\n#\r\n# print(numOfSub)\r\n#########################################################################\r\n\r\n######################################################################### 6\r\n###### Last Year's Substring ###### A problem from CodeForces ###### Last Year's Substring ######\r\n ## tags: dp, implementation, strings\r\n\r\n# t = int(input())\r\n#\r\n# for i in range(t):\r\n# n = int(input())\r\n# s = input()\r\n#\r\n# if s[0:4] == '2020' or s[n-4:n] == '2020':\r\n# print(\"YES\")\r\n# elif s[0] == '2' and s[n-3:n] == '020':\r\n# print(\"YES\")\r\n# elif s[0:2] == '20' and s[n-2:n] == '20':\r\n# print(\"YES\")\r\n# elif s[0:3] == '202' and s[n-1] == '0':\r\n# print(\"YES\")\r\n# else:\r\n# print(\"NO\")\r\n#########################################################################\r\n\r\n######################################################################### 7\r\n###### Last minute enhancements ###### A problem from CodeForces ###### Last minute enhancements ######\r\n ## tags: dp, greedy\r\n\r\n# t = int(input())\r\n#\r\n# for i in range(t):\r\n# n = int(input())\r\n# arr = list(map(int, input().split(\" \")))\r\n# counts = [0 for j in range(1, 2 * n + 3)]\r\n#\r\n# for k in range(len(arr)):\r\n# if counts[arr[k]] == 0:\r\n# counts[arr[k]] = 1\r\n# elif counts[arr[k]] >= 1:\r\n# arr[k] += 1\r\n# counts[arr[k]] += 1\r\n#\r\n# print(len(counts) - counts.count(0))\r\n#########################################################################\r\n\r\n######################################################################### 8\r\n###### Alex and a Rhombus ###### A problem from CodeForces ###### Alex and a Rhombus ######\r\n ## tags: dp, implementation, math\r\n\r\n# n = int(input())\r\n# print(2 * (n ** 2) - 2 * n + 1)\r\n# 1+3+5+...+(2n-3)+(2n-1)+(2n-3)+(2n-5)+...+5+3+1 = n^2 + (n-1)^2\r\n# \\--------\\ /---------/ \\--------\\ /---------/\r\n# \\/ \\/\r\n# n^2 (n-1)^2\r\n#########################################################################\r\n\r\n######################################################################### 9\r\n###### Even Subset Sum Problem ###### A problem from CodeForces ###### Even Subset Sum Problem ######\r\n ## tags: brute force, dp, greedy, implementation\r\n ## very easy\r\n\r\n# def func(arr):\r\n# prev_odd_num_ind = -1 # index\r\n#\r\n# for j in range(len(arr)):\r\n# if arr[j] % 2 == 0:\r\n# print(1)\r\n# print(j+1)\r\n# return\r\n# if arr[j] % 2 == 1:\r\n# if prev_odd_num_ind != -1:\r\n# print(2)\r\n# print(prev_odd_num_ind + 1, j + 1)\r\n# return\r\n# else:\r\n# prev_odd_num_ind = j\r\n#\r\n# print(-1)\r\n#\r\n#\r\n# t = int(input())\r\n#\r\n# for i in range(t):\r\n# n = int(input())\r\n# As = list(map(int, input().split(\" \")))\r\n#\r\n# func(As)\r\n\r\n#########################################################################\r\n\r\n######################################################################### 10\r\n###### The Way to Home ###### A problem from CodeForces ###### The Way to Home ######\r\n ## tags:\r\n\r\ndef func(n, d, path, p=0):\r\n jumps = 0\r\n\r\n while p != n - 1:\r\n for i in range(d, -1, -1):\r\n if i == 0:\r\n print(-1)\r\n return\r\n elif p + i < n - 1 and path[p + i] == '1':\r\n p = p + i\r\n jumps += 1\r\n break\r\n elif p + i >= n - 1:\r\n print(jumps + 1)\r\n return\r\n\r\n\r\nn, d = map(int, input().split(\" \"))\r\nPath = input()\r\n\r\nfunc(n, d, Path)\r\n\r\n\r\n\r\n\r\n#########################################################################", "test = list(map(int, input().split(\" \")))\r\nn = test[0]\r\nd = test[1]\r\na = list(input())\r\nc = []\r\nt = 0\r\nfor i in range(1, n):\r\n if a[i]=='1':\r\n c.append(t+1)\r\n t = 0\r\n else:\r\n t += 1\r\ns = []\r\nt = 0\r\nfor i in range(len(c)):\r\n if c[i]>d:\r\n print(-1)\r\n exit()\r\n if t+c[i]<=d:\r\n t += c[i]\r\n else:\r\n s.append(t)\r\n t = c[i]\r\nprint(len(s)+1)", "def min_jumps(n, d, s):\n pos = 0 # starting position\n jumps = 0 # number of jumps made\n\n while pos < n - 1: # while frog hasn't reached home\n found = False # flag to check if a jump is possible\n # try to jump to the farthest position with a lily flower within distance d\n for j in range(d, 0, -1):\n if pos + j < n and s[pos + j] == '1':\n pos += j\n jumps += 1\n found = True\n break\n # if no jump is possible, return -1\n if not found:\n return -1\n\n return jumps\n\n# Input\nn, d = map(int, input().split())\ns = input()\n\n# Output\nprint(min_jumps(n, d, s))\n\n\t\t \t\t\t\t \t\t \t\t\t\t\t \t \t \t \t", "n,d = map(int,input().split())\r\na = list(map(int,input()))\r\nans = 0; di = d; i = 0\r\nwhile di > 0 and i != n-1:\r\n if i + di >= n: di = n-1; i = 0\r\n if a[i + di] == 1:\r\n ans += 1\r\n i = i+di\r\n di = d\r\n else:\r\n di-=1\r\n if di == 0: print(-1); exit()\r\nprint(ans)", "\r\nif __name__ == '__main__':\r\n n, d = map(int, input().split())\r\n # n = 8\r\n # d = 4\r\n s = input()\r\n # s = '10010101'\r\n l = list()\r\n ind = 1\r\n for c in s:\r\n if c == '1':\r\n l.append(ind)\r\n ind += 1\r\n edges = dict()\r\n for i in range(0, len(l)):\r\n j = i + 1\r\n while j < len(l) and l[j] - l[i] <= d:\r\n if l[i] not in edges:\r\n edges[l[i]] = list()\r\n edges[l[i]].append(l[j])\r\n j += 1\r\n q = list()\r\n q.append(1)\r\n s = 0\r\n e = 1\r\n MAXD = 999999\r\n dist = [MAXD] * (n + 1)\r\n dist[1] = 0\r\n while s < e:\r\n u = q[s]\r\n s += 1\r\n if u not in edges:\r\n continue\r\n for v in edges[u]:\r\n if dist[v] > dist[u] + 1:\r\n dist[v] = dist[u] + 1\r\n if v not in q:\r\n q.append(v)\r\n e += 1\r\n if dist[n] == MAXD:\r\n print(-1)\r\n else:\r\n print(dist[n])\r\n", "n, d = input().split() # n = the point the frog wants to reach, d = the distance the frog can jump\r\nn, d = int(n) - 1, int(d)\r\n\r\ns = input() # 0 = no flower, 1 = flower\r\n\r\n\r\nl = 0\r\nr = d\r\njumps = 0\r\nwhile l != n:\r\n if r >= len(s):\r\n r = len(s) - 1\r\n\r\n if s[r] == \"1\":\r\n l = r\r\n r += d\r\n jumps += 1\r\n else:\r\n r -= 1\r\n\r\n if r == l:\r\n jumps = -1\r\n break\r\n\r\nprint(jumps)\r\n\r\n", "def teletransporte(caminho, posicao, salto, contador, visited):\n i = min(salto + posicao, len(caminho) - 1)\n \n while (i > posicao and posicao not in visited):\n if (i <= len(caminho) - 1 and caminho[i] == '1'):\n if (i == len(caminho) - 1):\n return visited, contador + 1\n visited, tmp = teletransporte(caminho, i, salto, contador + 1, visited)\n \n if (tmp != -1):\n return visited, tmp \n i -= 1\n visited.add(posicao)\n return visited, -1\n\nlinha = input().split(\" \")\ncaminho = input()\nvisited = set()\nprint(teletransporte(caminho, 0, int(linha[1]) , 0, visited)[1])\n\t\t \t\t\t\t \t\t\t \t\t \t\t \t \t \t\t\t \t", "n, d = map(int, input().split())\r\nox = input().strip()\r\nans = 0\r\ncurr_loc = 0\r\nwhile curr_loc < n - 1:\r\n ans += 1\r\n success = False\r\n for i in range(d, 0, -1):\r\n if curr_loc + i < n:\r\n if ox[curr_loc+i] == \"1\":\r\n curr_loc = max(curr_loc, curr_loc+i)\r\n success = True\r\n break\r\n if not success:\r\n ans = -1\r\n break\r\nprint(ans)\r\n\r\n", "n,d = list(map(int,input().split()))\r\na = input()\r\ndp = [float(\"inf\") for i in range(n)]\r\ni = 0\r\ndp[0] = 0\r\nwhile i < n:\r\n nxt = i+1\r\n if a[i] == '1':\r\n for j in range(i+1,min(i+d+1,n)):\r\n if a[j] == '1':\r\n dp[j] = min(dp[j],dp[i]+1)\r\n nxt = j\r\n #print(f\"i = {i} nxt = {nxt} dp[{i}] = {dp[i]}\")\r\n i = nxt \r\n\r\nif dp[n-1] == float(\"inf\"):\r\n print(\"-1\")\r\nelse:\r\n print(dp[n-1])", "n, d = list(map(int, input().split()))\nstr = input()\n\ndp = [float('inf')]*(n+1)\ndp[1] = 0\nfor i in range(2, n+1):\n if str[i-1] == \"1\":\n for j in range(1, d+1):\n if i-j >= 0:\n dp[i] = min(dp[i], 1+dp[i-j])\n else:\n dp[i] = float('inf')\nprint(dp[-1] if dp[-1] != float('inf') else -1)\n", "import sys\r\n\r\nfrom collections import Counter, deque\r\nfrom math import ceil\r\nimport re\r\nsys.setrecursionlimit(100000)\r\n\r\ninbound=lambda n,m,c,r:0 <= r < n and 0 <= c < m\r\n \r\n \r\ndef solve():\r\n n, d = map(int, input().split())\r\n flowers = list(input())\r\n jumps = 0\r\n i = 0\r\n while i < n:\r\n _max = i\r\n j = i+1\r\n while j < n and j <= i + d:\r\n if flowers[j] == '1':\r\n _max = j\r\n j += 1\r\n if i == n-1:\r\n break\r\n if _max == i:\r\n print(-1)\r\n return\r\n jumps += 1\r\n i = _max\r\n print(jumps)\r\n\r\nsolve()", "n,d=map(int,input().split())\r\nstring=input()\r\narr=[]\r\nfor i in range(n):\r\n arr.append(int(string[i]))\r\ncurr=0\r\nflag=0\r\ncount=0\r\nwhile curr!=n-1:\r\n nex=curr\r\n for i in range(1,d+1):\r\n if curr+i<n and arr[curr+i]==1:\r\n nex=curr+i\r\n if curr==nex:\r\n flag=1\r\n print(-1)\r\n break\r\n curr=nex\r\n count+=1\r\nif flag==0:\r\n print(count)", "def find_next(path,jump,current_pos):\n if (current_pos + jump + 1) > len(path) - 1:\n new_path = path[current_pos:]\n else:\n new_path = path[current_pos:current_pos + jump + 1]\n\n for i in range(len(new_path) - 1):\n if new_path[len(new_path) - 1 - i] == \"1\":\n return len(new_path) - 1 - i\n return -1\n\ndef way_home(path,path_length,jump):\n current_pos = 0\n jump_num = 0\n\n while(current_pos < path_length):\n jump_num += 1\n steps = find_next(path,jump,current_pos)\n if steps == -1:\n return -1\n current_pos += steps\n if current_pos == path_length - 1:\n return jump_num\n \n return -1\n\nn_jumps = [int(x) for x in input().split()]\npath_length = n_jumps[0]\njump = n_jumps[1]\npath = input()\n\nresult = way_home(path,path_length,jump)\n\nprint(result)\n \t \t\t\t\t\t\t\t \t\t\t \t \t \t \t \t\t\t\t\t", "#%%\r\ndef main():\r\n n, d = map(int, input().split())\r\n l = list(map(int, list(input())))\r\n m = [n] * n\r\n m[0] = 0\r\n for i in range(n):\r\n if l[i]:\r\n for j in range(max(0, i - d), i):\r\n if m[j] < m[i]:\r\n m[i] = m[j] + 1\r\n o = m[n-1]\r\n if o == n:\r\n print(-1)\r\n else:\r\n print(o)\r\n\r\nmain()", "n,d = map(int, input().split())\r\ns = input()\r\nans = 0;\r\npos = 0;\r\nwhile pos < n-1:\r\n npos = pos # find next position\r\n for i in range(1, d+1):\r\n if pos+i >= n:\r\n break\r\n if s[pos+i] == '1':\r\n npos = pos + i\r\n if npos == pos:\r\n break\r\n pos = npos\r\n ans += 1\r\nif npos == n-1:\r\n print(ans)\r\nelse:\r\n print(-1)", "a, b = map(int, input().split())\r\nx = input()\r\ny = [1]\r\nm = 0\r\nz = 0\r\nwhile m!=(a-1):\r\n for i in range(min(b+m,a-1), m, -1):\r\n if x[i] == '1':\r\n m = i\r\n z+=1\r\n break\r\n else:\r\n print(-1)\r\n break\r\nif m ==(a-1):\r\n print(z)", "n, d = map(int, input().split())\ns = input()\n\nmin_saltos = [float('inf')] * n\nmin_saltos[0] = 0 \n\nfor i in range(n):\n\n if s[i] == '1':\n\n for j in range(i+1, min(i+d+1, n)):\n\n if s[j] == '1':\n min_saltos[j] = min(min_saltos[j], min_saltos[i] + 1)\n\nif min_saltos[n-1] == float('inf'):\n print(-1)\nelse:\n print(min_saltos[n-1])\n \t\t\t \t \t \t\t\t \t\t \t\t\t \t \t\t", "key, value = map(int, input().split())\ns = input().strip()\n\narr = [float('inf')] * key\narr[0] = 0\n\nfor i in range(key):\n if s[i] == '1':\n for j in range(1, value + 1):\n if i + j < key and s[i + j] == '1':\n arr[i + j] = min(arr[i + j], arr[i] + 1)\n\nif arr[-1] == float('inf'):\n print(\"-1\")\nelse:\n print(arr[-1])\n\n \t \t \t \t\t\t \t\t\t\t \t \t \t \t\t\t \t", "n, d = map(int, input().split())\r\ns = input()\r\ndp = [0]\r\nfor i in range(1, n):\r\n if s[i] == '0':\r\n dp.append(10 ** 3)\r\n continue\r\n if len(dp) < d:\r\n dp.append(min(dp) + 1)\r\n else:\r\n dp.append(min(dp[len(dp) - d:]) + 1)\r\nif dp[-1] >= 1000:\r\n print(-1)\r\nelse:\r\n print(dp[-1])", "from collections import deque\r\n\r\nn, d = map(int, input().split())\r\nmas = []\r\nindexes = []\r\ns = input()\r\ni = 0\r\nfor char in s:\r\n if char == '1':\r\n mas.append([])\r\n indexes.append(i)\r\n i += 1\r\nfor a in range(len(mas)):\r\n for b in range(len(mas)):\r\n if a < b and indexes[b] - indexes[a] <= d:\r\n mas[a].append(b)\r\nqueue = deque([0])\r\nvisited = [False] * len(mas)\r\nvisited[0] = True\r\ndistances = [-1] * len(mas)\r\ndistances[0] = 0\r\nwhile len(queue):\r\n u = queue.popleft()\r\n for v in mas[u]:\r\n if not visited[v]:\r\n distances[v] = distances[u] + 1\r\n visited[v] = True\r\n queue.append(v)\r\nprint(distances[-1])\r\n", "def min_teleports(n, d, magic_map):\n pos = 1\n teleports = 0\n\n while pos < n:\n found = False\n for next_pos in range(pos + d, pos, -1):\n if next_pos <= n and magic_map[next_pos - 1] == '1':\n pos = next_pos\n teleports += 1\n found = True\n break\n\n if not found:\n return -1\n\n return teleports\n\nn, d = map(int, input().split())\nmagic_map = input().strip()\n\nprint(min_teleports(n, d, magic_map))\n\n \t\t \t\t \t\t\t \t \t \t\t\t\t\t\t\t\t", "n, d = input().split()\nn = int(n)\nd = int(d)\nmapa = input()\ndef dp(n, d, mapa):\n distancias = [float('inf')] * (n + 1)\n distancias[1] = 0\n for i in range(2, n + 1):\n for j in range(1, i):\n if mapa[j - 1] == mapa[i - 1] == '1' and distancias[j] <= distancias[i] and i - j <= d:\n distancias[i] = min(distancias[i], distancias[j] + 1)\n if distancias[n] == float('inf'):\n return -1\n else:\n return distancias[n]\n\ndistancias = dp(n, d, mapa)\nprint(distancias)\n\t \t \t \t\t \t \t \t\t\t \t\t\t\t", "n, d = map(int, input().split())\na = input()\nx = 0\nr = 0\nwhile x != n - 1:\n y = a[:x + d + 1].rfind('1')\n if y == x:\n r = -1\n break\n else:\n x = y\n r += 1\nprint(r)\n\n\t \t \t\t \t\t \t\t\t \t \t\t\t \t\t \t\t\t", "def solve():\r\n a,b = map(int, input().split())\r\n world = list(input())\r\n c = 0\r\n hops = 0\r\n\r\n while (c+1 < a):\r\n # print(c)\r\n if a - c -1 < b:\r\n b = a-c -1\r\n for i in range(b,0, -1):\r\n if world[c+i] == \"1\":\r\n c+=i\r\n hops += 1\r\n break\r\n else:\r\n return -1\r\n\r\n return hops\r\n\r\nprint(solve())", "n, d = list(map(int, input().split()))\r\na = list(map(int, list(input())))\r\nk = 0\r\nflag = -1\r\nfor i in range(1, n):\r\n if a[i] == 1 and (i - k) <= d:\r\n if i == n - 1:\r\n flag = 1\r\n break\r\n else:\r\n k = i\r\n elif (i - k) > d:\r\n flag = 0\r\n break\r\n\r\nif flag == -1:\r\n print('error')\r\n\r\nif flag == 0:\r\n print(-1)\r\nelse:\r\n answer = 0\r\n jumps = [0] * d\r\n for i in range(0, d):\r\n jumps[i] += d - i\r\n i = 0\r\n f = 0\r\n while True:\r\n if f == 1:\r\n break\r\n for j in range(0, d):\r\n if i + jumps[j] > n - 1:\r\n pass\r\n elif i + jumps[j] == n - 1:\r\n answer += 1\r\n f = 1\r\n break\r\n elif a[i + jumps[j]] == 1:\r\n answer += 1\r\n i += jumps[j]\r\n break\r\n print(answer)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,d=map(int,input().split())\r\ns=input()\r\ncount=0\r\ni=0\r\nwhile i!=n-1:\r\n f1=False\r\n j=min(i+d,n-1)\r\n while j>i:\r\n if(s[j]=='1'):\r\n f1=True\r\n break\r\n j-=1\r\n if(f1):\r\n i=j\r\n count+=1\r\n else:\r\n break\r\nif(i==n-1):print(count)\r\nelse:print(-1)", "def solve(n,d,s):\n dp = [99999] * (n)\n dp[0] = 0\n\n for i in range(n-1):\n if s[i] == '0':\n continue\n for j in range(i+1,i+d+1):\n if j > n-1:\n break\n\n if s[j] == '0':\n dp[j] = 0\n continue\n elif s[j] == '1':\n dp[j] = min(dp[i]+1, dp[j])\n\n if dp[n-1] == 99999:\n dp[n-1] = -1\n print(dp[n-1])\n\n\nif __name__ == '__main__':\n n,d = map(int, input().split())\n\n ar = list(input())\n\n solve(n,d,ar)", "n, d = map(int, input().split())\r\nls = input()\r\n\r\ni, j = 0, 1\r\ncurr_jumps = 0\r\ntot_jumps = 0\r\nans = 'yes'\r\n\r\nwhile i < n-1:\r\n curr_jumps = 0\r\n while j <= d and (i + j) < n:\r\n if ls[i + j] == '1':\r\n curr_jumps = i + j\r\n j += 1\r\n\r\n if curr_jumps == 0:\r\n ans = 'no'\r\n break\r\n else:\r\n tot_jumps += 1\r\n i = curr_jumps \r\n j = 1\r\nif ans == 'no':\r\n print(-1)\r\nelse:\r\n print(tot_jumps)\r\n", "entr = input().split()\nn = int(entr[0])\nd = int(entr[1])\n\ns = input()\n\ni = 0\nres = 0\n\nwhile i != len(s)-1:\n j = min(len(s)-1, i+d)\n while(j > i):\n if(s[j] == \"1\"):\n res += 1\n break\n j-=1\n\n if(i==j):\n res = -1\n break\n\n i = j\n\nprint(res)\n \t \t \t \t\t \t\t\t\t \t\t \t\t\t", "# using dp (shortest path)\r\ninf=1e10\r\ndef jump(string,i):\r\n global flag\r\n if mem[i]!=-1: return mem[i]\r\n if i==n-1: return 0\r\n ans=inf\r\n for j in range(i+1,i+d+1):\r\n if j<n and string[j]=='1':\r\n ans=min(ans,jump(string,j))\r\n mem[i]=ans+1\r\n return mem[i]\r\n\r\nn,d=map(int,input().split())\r\ns=input()\r\nmem=[-1]*(1+n)\r\nr=jump(s,0)\r\nprint([r,-1][r>100])", "n, d = map(int, input().split())\r\ns = input()\r\nif '0'*d in s:\r\n\tprint(-1)\r\nelse:\r\n\tresult = i = 0\r\n\twhile i<n-1:\r\n\t\tif s[i]=='1':\r\n\t\t\ti+=d\r\n\t\t\tresult+=1\r\n\t\telse:\r\n\t\t\ti-=1\r\n\tprint(result)\r\n", "n, d = map(int, input().split(' '))\r\nss = (i for i, s in enumerate(input()) if s == '1')\r\n\r\nc = 1\r\na = next(ss)\r\nb = next(ss)\r\n\r\nif b > d:\r\n print(-1)\r\n exit()\r\n\r\nfor s in ss:\r\n if s - a <= d:\r\n b = s\r\n else:\r\n if s - b > d:\r\n print(-1)\r\n exit()\r\n else:\r\n a = b\r\n b = s\r\n c += 1\r\nprint(c)", "n, d = map(int, input().split())\ns = input()\n\nbrincosMin = [float('inf')] * n\n\nbrincosMin[0] = 0\n\nfor i in range(n):\n if s[i] == '0':\n continue\n\n for j in range(i + 1, min(i + d + 1, n)):\n if s[j] == '1':\n brincosMin[j] = min(brincosMin[j], brincosMin[i] + 1)\n\nif brincosMin[n - 1] == float('inf'):\n print(-1)\nelse:\n print(brincosMin[n - 1])\n\t \t \t \t \t \t \t\t\t\t \t\t \t\t\t\t \t\t", "n, d = list(map(int, input().split()))\r\ns = input()\r\n\r\ncur = 0\r\n\r\nsteps = 0\r\nwhile cur != len(s)-1:\r\n \r\n try:\r\n step = s[cur+1:cur+d+1].rindex('1')+1\r\n cur += step\r\n steps += 1\r\n except:\r\n \r\n steps = -1\r\n break\r\n \r\nprint(steps)", "import sys\n#import math\n\ninputs = []\nfor line in sys.stdin:\n inputs.append(line)\n\nline1 = inputs[0].strip().split()\nlilys = inputs[1].strip()\nlilypads = []\nfor char in lilys:\n lilypads.append(int(char))\n\nn = int(line1[0])\nd = int(line1[1])\n\ndef hops(n, d, lils):\n hops = 0\n currI = 0\n lookI = currI\n \n while (currI < n-1):\n lookI+=d\n if lookI > (n-1):\n lookI = lookI - (lookI-(n-1))\n while (lils[lookI] != 1):\n lookI-=1\n if (lookI == currI):\n return -1\n currI = lookI\n hops+=1\n return hops\n\nprint(hops(n, d, lilypads))\n\t\t \t \t \t\t \t \t\t\t \t \t\t \t", "target, max_len = map(int, input().split(\" \"))\n\ndata = list(map(int, input().strip()))\n\ncan = False\n\njumps = 0\n\nnow = 0\n\nwhile(True):\n jumps += 1\n new_now = now + max_len\n if new_now >= target-1:\n can = True\n break\n else:\n for i in range(new_now, now-1, -1): \n if data[i] == 1:\n new_now = i\n break\n if new_now != now:\n now = new_now\n else:\n break\n\nif can:\n print(jumps)\nelse:\n print(-1)\n\t \t\t\t \t\t \t\t \t\t\t \t\t\t\t\t \t\t", "n, b = map(int, input().split())\r\nroad = list(map(int, list(input())))\r\nif not road and n:\r\n print(-1)\r\ncount = 0\r\ni = 0\r\nwhile True:\r\n if i+b >= n:\r\n if i==len(road)-1:\r\n print(count)\r\n else:\r\n print(count + 1)\r\n break\r\n else:\r\n found = False\r\n for j in range(min(len(road)-1, i+b), i, -1):\r\n if road[j]==1:\r\n found = True\r\n break\r\n if found:\r\n i = j\r\n count += 1\r\n else:\r\n print(-1)\r\n break", "#!/usr/bin/env python3\n# coding=utf-8\n\n(n, d) = input().split()\nn = int(n)\nd = int(d)\nlily = input()\nj = 0\njump = 0\nwhile True:\n find = 0\n for i in range(d, 0, -1):\n if i + j >= n:\n continue\n if lily[i+j] == '1':\n j = j + i\n jump += 1\n find = 1\n break\n if find == 0:\n print(-1)\n break\n if j == n - 1:\n print(jump)\n break\n", "def func():\n n, d = (int(i) for i in input().split(' '))\n s = [int(i) for i in input()]\n pos = 0\n count = 0\n while(pos < n - 1):\n if pos + d > n - 1:\n end = n\n else:\n end = pos + d + 1\n for i in reversed(range(pos + 1, end)):\n if s[i] == 1:\n pos = i\n count += 1\n break\n if i != pos:\n print(-1)\n return\n\n print(count)\n\n\nif __name__ == '__main__':\n func()\n", "\r\nn,d=map(int,input().split())\r\ns=input()\r\ni_pos=0\r\nans=0\r\nzz=0\r\nwhile i_pos<n-1:\r\n\tc=d\r\n\tz=0\r\n\twhile c>0:\r\n\t\tif i_pos+c<n-1:\r\n\t\t\tif s[i_pos+c]==\"1\":\r\n\t\t\t\tans+=1\r\n\t\t\t\tz=1\r\n\t\t\t\ti_pos+=c\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tc-=1\r\n\t\telse:\r\n\t\t\ti_pos+=c\r\n\t\t\tans+=1\r\n\t\t\tz=1\r\n\t\t\tbreak\r\n\tif z==0:\r\n\t\tzz=1\r\n\t\tprint(\"-1\")\r\n\t\tbreak\r\n\telse:\r\n\t\tcontinue\r\nif zz==0:\r\n\tprint(ans)\r\n", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\nn, d = iis()\r\ns = inp()\r\ndp = [MOD for _ in range(n)]\r\ndp[0] = 0\r\nfor i in range(n):\r\n for a in range(1, min(n - i, d + 1)):\r\n if s[i + a] == \"1\":\r\n dp[i + a] = min(dp[i + a], dp[i] + 1)\r\nprint(dp[-1] if dp[-1] != MOD else -1)\r\n", "a = list(map(int, input().split()))\r\nn,d = a[0],a[1]\r\ns = input()\r\nl = 1\r\nk = 0\r\nwhile l < n:\r\n\ti = min(n - 1, l + d - 1)\r\n\twhile s[i] == '0':\r\n\t\ti = i - 1\r\n\tif i + 1 == l:\r\n\t\tprint(-1)\r\n\t\tbreak\r\n\tl = i + 1\r\n\tk = k + 1\r\nelse:\r\n\tprint(k)\r\n\t\r\n\r\n\t\t\r\n\r\n\r\n\r\n", "n, d = list(map(int, input().split(' ')))\r\ns, i, j = input(), 0, 0\r\nwhile i < n - 1 and j < n:\r\n if s[i] == '1':\r\n i += d\r\n j += 1\r\n else:\r\n i -= 1\r\nif j >= n:\r\n print(-1)\r\nelse:\r\n print(j)", "n,d=map(int,input().split());s=input()\r\nif '0'*d in s:print('-1')\r\nelse:\r\n i,c=0,0\r\n while i<n-1:\r\n if s[i]=='1':i+=d;c+=1\r\n else:i-=1\r\n print(c)", "global d,n\ndef x(wz,long,step):\n if wz+long>=n-1:\n print(step+1)\n return True\n for k in range(d):\n if lst[wz+long-k]==1:\n x(wz+long-k,d,step+1)\n return True\n print(-1)\n[n,d]=[int(i)for i in input().split()]\ns=input()\nlst=[]\nfor i in s:\n lst.append(int(i))\nx(0,d,0)\n \t\t\t\t\t \t\t \t\t\t\t \t\t \t \t", "n, m = map(int, input().split())\r\n\r\nl = list(map(int, input()))\r\nans = 0\r\n\r\ni = 0\r\nd = m\r\nwhile i < n-1:\r\n if i + d > n - 1:\r\n d = n - i - 1\r\n\r\n if l[i + d] == 1 and d != 0:\r\n i += d\r\n d = m\r\n ans += 1\r\n elif i == i + d:\r\n ans = -1\r\n break\r\n else:\r\n d -= 1\r\n\r\nprint(ans)\r\n", "n,d = map(int,input().split())\ns = input()\nans = 0\ni = 0\nwhile True:\n for j in range(min(d+i,n-1), i,-1):\n if s[j] == '1':\n ans += 1\n i = j\n break\n if j == i+1 and s[j] == '0':\n exit(print(-1))\n if i == n-1:\n break\nprint(ans)\n", "n, d = map(int, input().split())\r\ns = input()\r\n\r\npos = 0 # Текущая позиция лягушки\r\njumps = 0 # Количество прыжков\r\n\r\nwhile pos < n - 1:\r\n next_jump = min(d, n - pos - 1) # Максимальное расстояние, на которое можно прыгнуть\r\n for i in range(next_jump, 0, -1):\r\n if s[pos + i] == '1':\r\n pos += i\r\n jumps += 1\r\n break\r\n else:\r\n print(-1)\r\n break\r\n\r\nif pos == n - 1:\r\n print(jumps)", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 24/08/2020\r\n\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, d = iia()\r\ns = is1()\r\ndp = [float(\"inf\")] * n\r\ndp[0] = 0\r\nfor i in range(1, n):\r\n if s[i] == '1':\r\n for j in range(max(0, i - d), i):\r\n dp[i] = min(dp[j] + 1, dp[i])\r\nif dp[-1] == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(dp[-1])\r\n \r\n", "from sys import stdin,stdout\r\nfrom collections import deque\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\nPI=float('inf')\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n s=input()\r\n q=deque()\r\n dp=[PI]*n\r\n dp[0]=0\r\n q.append(0)\r\n for i in range(1,n):\r\n while q and i-q[0]>k:\r\n q.popleft()\r\n if s[i]=='1' and q:dp[i]=dp[q[0]]+1\r\n while q and dp[q[-1]]>dp[i]:\r\n q.pop()\r\n if dp[i]!=PI:q.append(i)\r\n print(dp[n-1] if dp[n-1]!=PI else -1)", "import sys\n\ngoal_position, jump_distance = map(int, sys.stdin.readline().split())\nflowers = sys.stdin.readline()\nfirst = 0\nlast = 0\nfirst_last_reach = jump_distance\nresult = [0]\nfor pos in range(1, goal_position):\n if flowers[pos] == '0':\n result.append(-1)\n else:\n if pos > first_last_reach:\n first = last\n first_last_reach = first + jump_distance\n if pos > first_last_reach:\n print(-1)\n exit()\n last = pos\n result.append(result[first] + 1)\nprint(result[goal_position - 1])\n", "\r\nn, d = map(int, input().split())\r\n\r\nl = list(input())\r\n\r\nans = 0\r\n\r\npos = 1\r\nwhile pos < n:\r\n\tfor i in range(d, 0, -1):\r\n\t\tif l[min(pos + i - 1, n - 1)] == '1':\r\n\t\t\tans += 1\r\n\t\t\tpos += i\r\n\t\t\tbreak\r\n\telse:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\r\n\r\nprint(ans)", "n,d = map(int,input().split())\ns = input()\ni = 0\nans = 0\nx = True\nwhile i < n: \n j = i+1\n a = -1\n while j <= i+d and j < n: \n if s[j] == \"1\": a = j\n j += 1\n if a != -1: i = a; ans += 1\n else: x = False; break\n if i == n-1: break\nprint(ans if x == True else -1)", "n, d = map(int, input().split())\r\ns = input()\r\ndp = [100000]*n\r\ndp[0] = 0\r\nfor i in range(n):\r\n if s[i] == '1':\r\n for j in range(max(0, i-d), i):\r\n dp[i] = min(dp[i], dp[j]+1)\r\nif dp[n-1] != 100000:\r\n print(dp[n-1])\r\nelse:\r\n print(-1)\r\n", "n,d = map(int,input().split())\ns = input()\ndp = [100000]*n\ndp[0] = 0\nfor i in range(n):\n if s[i] == '1':\n for j in range(max(0,i-d),i):\n dp[i] = min(dp[i],dp[j]+1)\nprint([-1,dp[n-1]][dp[n-1]!=100000])\n\t \t \t\t \t \t \t \t \t\t \t \t\t\t \t", "n,d=map(int,input().split())\na=input()\ns=j=f=0\ndi=d\njump=0\nfor i in range(1,n):\n\tif a[i]=='1':\n\t\tj=i\n\t\ts=0\n\telse:\n\t\ts+=1\n\tif i==di:\n\t\tif s>d:\n\t\t\tprint(-1)\n\t\t\texit()\n\t\telif s==d:\n\t\t\tif a[i]!='1':\n\t\t\t\tprint(-1)\n\t\t\t\texit()\n\t\telse:\n\t\t\tjump+=1\n\t\t\tdi=j+d\nprint(jump+1 if di!=n-1+d else jump)\n", "n,d = map(int, input().split())\n\ns = input()\n\ni = 0 \nj = 0\n\nwhile i < n-1 and j < n:\n if s[i] == '1':\n i += d\n j += 1\n else:\n i -= 1\n\nif j >= n:\n print(-1)\nelse:\n print(j)", "n, d = [int(x) for x in input().split()]\ns = str(input())\ni = 0\nans = 0\ntemp = 0\nwhile(1):\n\ttemp = min(d, n-i-1)\n\t\n\twhile(temp > 0):\n\t\tif s[i+temp] == \"1\":\n\t\t\tflag = 1\n\t\t\tbreak\n\t\telse:\n\t\t\ttemp -= 1\n \n\t\tif temp == 0:\n\t\t\tflag = 0\n \n\tans += 1\n\ti += temp\n \n\t# print(i, ans)\n \n\tif i == n-1 or not(flag):\n\t\tbreak\n \nif i+1 == n:\n\tprint(ans)\nelse:\n\tprint(-1)\n\t \t \t\t \t \t \t \t \t\t \t\t\t\t\t \t", "\"\"\"\n\thttps://codeforces.com/problemset/problem/910/A\n\tInput\n\t\tn \tpoint that has to be reached\n\t\td \tmax length of jump\n\t\ts \tconsisting of zeroes and ones\n\t\t\t0 = no lily flower\n\t\t\t1 = lily flower (frog can jump here)\n\tOutput\n\t\tx \tmin number of jumps needed to reach n\n\t\t-1\tif n can't be reached\n\"\"\"\n\nn, d = map(int, input().split())\ns = input()\n\n# index 0\nn -= 1\n\nreachable = True\nreached = False\njumps = 0\ni = 0\n\nwhile reachable and not reached:\n\t# can reach home now?\n\tif n <= i + d:\n\t\treached = True\n\t\tjumps += 1\n\t\tbreak\n\t# are there reachable flowers?\n\telif '1' not in s[i+1:i+d+1]:\n\t\treachable = False\n\t# determine max jump\n\telse:\n\t\tjumps += 1\n\t\t# get farthest reachable lily (1)\n\t\ti += s[i+1:i+d+1].rfind('1') + 1\n\nprint(jumps if reached else -1)", "a=input().split(' ')\r\nn,d=int(a[0]),int(a[1])\r\ndata=input()\r\ndata=[0]+[int(i) for i in data]\r\ncoord = 0\r\na=[99999]*(n+1)\r\ndef is_jump(i, j):\r\n return(data[i]==1 and data[j]==1)\r\na[n]=0\r\nfor i in range(n,0,-1):\r\n for j in range(max(1,i-d),i):\r\n if is_jump(i,j):\r\n a[j]=min(a[j],a[i]+1)\r\nif a[1]!=99999:\r\n print(a[1])\r\nelse:\r\n print('-1') ", "n,d = (int(x) for x in input().split())\r\ns = input()\r\nstartIndex = 0\r\ncount = 0\r\nCanBeDone = True\r\nwhile startIndex<n-1:\r\n LastIndex = startIndex+d\r\n if LastIndex>=n:\r\n count+=1\r\n break\r\n while LastIndex>startIndex:\r\n if s[LastIndex]=='1':\r\n break\r\n LastIndex-=1\r\n \r\n if LastIndex==startIndex:\r\n CanBeDone = False\r\n break\r\n else: \r\n count+=1\r\n startIndex = LastIndex\r\nif CanBeDone: print(count)\r\nelse: print(-1)", "n,k=map(int,input().split())\r\nr=input();move=i=0\r\nwhile i<n-1:\r\n notfind=True\r\n for j in range(min(n-1,i+k),i,-1):\r\n if r[j]=='1':i=j;move+=1;notfind=False;break\r\n if notfind:move=-1;break\r\nprint(move)\r\n", "def read_tokens():\n return input().strip().split()\n\n\ndef read_ints():\n return [int(s) for s in read_tokens()]\n\n\nn, d = read_ints()\narr = input()\n\n\ndef solve(arr: str, d: int) -> int:\n # dp[i] = min(dp[i-1], dp[i-2], ..., dp[i-d]) + 1\n # d\n # = 1 + min dp[i-j]\n # j=1\n\n n = len(arr)\n dp = [0] * n\n dp[0] = 0\n for i in range(1, n):\n if arr[i] == '0':\n dp[i] = float('inf')\n else:\n curr_min = dp[i - 1]\n for j in range(2, d+1):\n if i - j < 0:\n break\n curr_min = min(curr_min, dp[i-j])\n dp[i] = 1 + curr_min\n\n return dp[n-1] if dp[n-1] != float('inf') else -1\n\n\nprint(solve(arr, d))", "from sys import stdin \r\n\r\nn,d=map(int,stdin.readline().split())\r\ns=input()\r\n#\r\nlast = 0\r\njump = 0\r\npossible = True\r\n \r\nwhile last<n-1:\r\n\tfor c in range(min(last+d,n-1),last,-1):\r\n\t\tif s[c]=='1':\r\n\t\t\tjump += 1\r\n\t\t\tlast = c\r\n\t\t\tbreak\r\n\telse:\r\n\t\tpossible = False\r\n\t\tbreak\r\nif possible:\r\n\tprint(jump)\r\nelse:\r\n\tprint(-1)", "# Guloso\ndef teleports(n, d, map):\n position = 1\n counter = 0\n \n while position < n:\n next_position = min(n, position + d)\n while next_position > position and map[next_position - 1] == \"0\":\n next_position -= 1\n \n # Se nao achar proxima posicao, volta pra -1\n if next_position == position:\n return -1\n \n # Se achar, aumenta contador e atualiza a posicao\n position = next_position\n counter += 1\n \n return counter\n\nn, d = map(int, input().split())\nmap = input()\nprint(teleports(n, d, map))\n\n \t \t\t\t \t\t\t\t \t\t\t \t\t\t\t\t \t", "n, d = list(map(int, input().split(\" \")))\r\ns = input()\r\n\r\nlocation = 0\r\njump_counter = 0\r\ni = 0\r\nwhile i < len(s):\r\n i += d\r\n if i >= len(s) - 1:\r\n jump_counter += 1\r\n print(jump_counter)\r\n exit()\r\n\r\n while not int(s[i]) and i > location:\r\n i -= 1\r\n \r\n if i == location:\r\n print(\"-1\")\r\n exit()\r\n else:\r\n location = i\r\n jump_counter += 1\r\n\r\nprint(jump_counter)", "n, d = map(int, input().split())\r\ns = input()\r\n\r\n# check if it's possible to reach the home\r\nif '0' * d in s:\r\n print(-1)\r\nelse:\r\n # initialize variables\r\n curr = 0\r\n jumps = 0\r\n \r\n # iterate until reaching home\r\n while curr < n-1:\r\n # find the furthest reachable position\r\n max_pos = curr\r\n \r\n for index in range(curr + 1, min(n, curr + d + 1)):\r\n if s[index] == '1':\r\n max_pos = index\r\n \r\n # check if a new position is found\r\n if max_pos == curr:\r\n print(-1)\r\n break\r\n \r\n # update variables\r\n curr = max_pos\r\n jumps += 1\r\n \r\n # print the number of jumps if home is reached\r\n if curr == n-1:\r\n print(jumps)\r\n \t\t \t\t\t\t \t\t\t \t \t \t\t\t\t \t\t", "from collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\n\r\n\r\ndef main():\r\n n, d = [int(i) for i in input().split()]\r\n s = input()\r\n queue = deque([1])\r\n visited = [float('inf')] * n\r\n visited[0] = 0\r\n while queue:\r\n vertex = queue.pop()\r\n v = visited[vertex - 1]\r\n for i in range(1, d + 1):\r\n z = vertex + i - 1\r\n if z <= n - 1 and s[z] == '1' and visited[z] > v + 1:\r\n visited[z] = v + 1\r\n queue.append(z + 1)\r\n\r\n print(visited[-1] if visited[-1] < float('inf') else -1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "\r\nimport bisect\r\n\r\ndef the_way_to_home(s, n, d):\r\n one_index = [int(i+1) for i, c in enumerate(s) if c == '1']\r\n #print(\"The indexes where one is are: \", one_index)\r\n\r\n i = 0\r\n jmpcnt = 0\r\n\r\n while i < len(one_index):\r\n #print(\"The value of i:\", i)\r\n\r\n if i == len(one_index) - 1:\r\n break\r\n\r\n mx_jump = one_index[i] + d\r\n #print(\"The max_jump possible is:\", mx_jump)\r\n\r\n if mx_jump in one_index:\r\n #print(\"Max jump is possible\")\r\n jmpcnt += 1\r\n i = one_index.index(mx_jump)\r\n\r\n elif mx_jump not in one_index:\r\n #print(\"Max jump is not possible\")\r\n # We need to find closest value < than mx_jump\r\n index = bisect.bisect(one_index, mx_jump)\r\n #print(\"The index is:\", index)\r\n\r\n if i != index -1:\r\n i = index - 1\r\n #print(\"i is going to become\", i)\r\n\r\n else:\r\n break\r\n\r\n jmpcnt += 1\r\n #print(\"*********************\")\r\n\r\n if jmpcnt and i == len(one_index)-1:\r\n print(jmpcnt)\r\n else:\r\n print(\"-1\")\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n n, d = map(int, input().split())\r\n s = input()\r\n the_way_to_home(s, n, d)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k = [int(x) for x in input().split()]\r\ns = input()\r\narr = list(s)\r\ni = 0\r\nflag = True\r\nans = 0\r\nwhile i < n:\r\n j = i\r\n if j + k >=n-1:\r\n ans += 1\r\n break\r\n for l in range(k,0,-1):\r\n if arr[j+l] == \"1\":\r\n i = j + l\r\n ans += 1\r\n break\r\n if i == j:\r\n flag = False\r\n print(-1)\r\n break\r\nif flag:\r\n print(ans)\r\n\r\n", "n,d=map(int,input().split());s=input()\r\nif('0'*d in s):\r\n print('-1')\r\nelse:\r\n i=0\r\n c=0\r\n while i<n-1:\r\n if s[i]=='1':\r\n i+=d\r\n c+=1\r\n else:\r\n i-=1\r\n print(c)", "n, d = map(int,input().split())\n\nmapa = input()\n\natual = 0\n\ndef mago(n, d, atual, mapa):\n count = 0\n while atual != n - 1:\n sub = mapa[atual : atual + d + 1]\n \n\n j = len(sub) - 1\n \n verificar = True\n while verificar:\n if j == 0:\n return -1\n \n if sub[j] == \"1\":\n atual += j\n count += 1\n verificar = False\n j -= 1 \n \n \n \n\n return count\n\nprint(mago(n,d,atual,mapa))\n\n\n \n\n \n\n\n\n \t \t\t\t\t\t \t\t\t\t\t\t\t\t\t\t\t\t \t\t \t", "n,d = map(int,input().split())\r\ns = input()\r\nx = 0\r\njump = 0\r\nfor i in range(n):\r\n if x+d>=n-1:\r\n print(jump+1)\r\n break\r\n temp = x+d\r\n while s[temp] != '1':\r\n temp -= 1\r\n if temp == x:\r\n print(-1)\r\n break\r\n else:\r\n x=temp\r\n jump+=1\r\n\r\n", "n, d = map(int, input().split())\r\ni, s, res = 0, input(), 0\r\nwhile i != n - 1:\r\n pos = -1\r\n for x in range(min(n - 1, i + d), i, -1):\r\n if s[x] == '1':\r\n pos = x\r\n break\r\n else: pass\r\n if pos == -1:\r\n res = -1\r\n break\r\n else: i, res = pos, res + 1\r\nprint(res)", "t, n = map(int,input().split())\r\nl = input()\r\nrng = len(l)\r\nres = 0\r\ni, j = 0,0\r\nwhile(i<rng and j<rng and i<=j):\r\n c=0\r\n for k in range(i,j+1):\r\n c = max(c,int(l[k])*(k+n))\r\n i=j+1\r\n j=c\r\n res+=1\r\n if j>=t-1:\r\n print(res)\r\n break\r\n if j==0:\r\n print(j-1)\r\n break", "n,d = map(int,input().split())\nt = input()\ns = 0\na = 0\nwhile a < n-1:\n k = 0\n for i in list(reversed(range(1,d+1))):\n if a+i > n-1:\n continue\n else:\n if t[a+i] == '1':\n a += i\n s += 1\n k = 1\n break\n if k == 0:\n print(-1)\n break\nif k == 1:\n print(s)\n", "\r\nn,d=map(int,input().split())\r\nlis=input()\r\nco=1\r\nvd=0\r\nv=0\r\nfor i in range(1,len(lis)):\r\n if lis[i]==\"1\":\r\n vd=co\r\n\r\n if co%d==0 or i==n-1:\r\n co=co-vd\r\n vd=0\r\n v+=1\r\n co += 1\r\n\r\n if co >d:\r\n print(\"-1\")\r\n break\r\n\r\nif co <=d:\r\n print(v)", "#I\r\ndef recur(s, pos, h, d, i):\r\n if (pos==len(s)-1):\r\n print(i)\r\n elif (h==0):\r\n print(-1)\r\n elif (pos+h>len(s)-1 or s[pos+h]==\"0\"):\r\n recur(s, pos, h-1, d, i)\r\n else :\r\n recur(s, pos+h, d, d, i+1)\r\nn, d = [int(x) for x in input().split()]\r\ns = str(input())\r\nrecur(s, 0, d, d, 0)", "n, d = map(int, input().split())\r\ns = input()\r\nzeros = d*\"0\"\r\nif zeros in s:\r\n print(\"-1\")\r\nelse:\r\n ans, i = 0, 0\r\n while i < n-1:\r\n if s[i] == '1':\r\n i += d\r\n ans += 1\r\n else:\r\n i -= 1\r\n print(ans)", "n,d=map(int,input().split())\r\ns=input()\r\nans=0\r\ni=0\r\ncheck=d*\"0\"\r\nif check in s:\r\n print(-1)\r\nelse:\r\n while(i<len(s)-1):\r\n if s[i]==\"1\":\r\n i+=d\r\n ans+=1\r\n else:\r\n i-=1\r\n\r\n print(ans)\r\n ", "import sys\r\n\r\ndef main():\r\n INF = 10**9\r\n dp = [INF] * 666\r\n \r\n n, d = map(int, input().split())\r\n s = input()\r\n s += \"0\"*200\r\n \r\n dp[n - 1] = 0\r\n for i in range(n-2, -1, -1):\r\n for j in range(1, d + 1):\r\n if s[i + j] == '1':\r\n dp[i] = min(dp[i], 1 + dp[i + j])\r\n\r\n if dp[0] == INF:\r\n dp[0] = -1\r\n \r\n print(dp[0])\r\n \r\n \r\n\t\r\nif __name__ == '__main__':\r\n main() \r\n \r\n", "n,d=map(int,input().split())\r\ns=input()\r\nl=0\r\narr=[9999]*n\r\narr[0]=0\r\nfor i in range(n):\r\n if s[i]=='1':\r\n for j in range(i+1,min(i+d+1,n)):\r\n if s[j]=='1':arr[j]=min(arr[j],arr[i]+1)\r\nprint(arr[-1]if arr[-1]!=9999else-1)", "a,b = map(int,input().split())\r\npoints = input()\r\nzeros = b*'0'\r\ncnt = 0\r\nif zeros in points:\r\n print(-1)\r\nelse:\r\n i = 0\r\n while True:\r\n if i == len(points)-1:\r\n print(cnt)\r\n break\r\n else:\r\n for j in range(b,0,-1):\r\n if i+j<=(len(points)-1) and points[i+j] == '1':\r\n i += j\r\n cnt += 1\r\n break\r\n", "n,d=map(int,input().split())\r\ns=input()\r\nx1=0\r\nk=0\r\nm= False\r\nwhile x1!=n-1:\r\n if x1 == -1 or s[n-1]!='1' or x1 == s.rfind('1',x1,x1+d+1):\r\n m=True\r\n break\r\n o = s.rfind('1',x1,x1+d+1)\r\n x1 = o\r\n k+=1\r\nif m:\r\n print('-1')\r\nelse:\r\n print(k)\r\n", "n, d = map(int, input().split())\nmagic_stones = input()\n\ndp = [float('inf')] * (n + 1)\ndp[1] = 0\n\nfor i in range(1, n + 1):\n if magic_stones[i - 1] == '1':\n for j in range(1, d + 1):\n if i + j <= n:\n dp[i + j] = min(dp[i + j], dp[i] + 1)\n\nif dp[n] == float('inf'):\n print(-1)\nelse:\n print(dp[n])\n\n \t \t \t\t \t \t\t \t\t\t", "n, d = map(int, input().split())\ns = input()\n\npos = 0\nsaltos = 0\n\nwhile pos < n - 1:\n encontro = False\n for i in range(pos + d, pos, -1):\n if i >= n:\n continue\n if s[i] == '1':\n pos = i\n saltos += 1\n encontro = True\n break\n if not encontro:\n print(-1)\n exit()\n\nprint(saltos)\n\n \t\t\t\t \t \t\t\t \t\t \t\t\t \t \t", "from sys import stdin \r\n \r\nn,d=map(int,stdin.readline().split())\r\ns=input()\r\nlast = 0\r\njump = 0\r\npossible = True\r\n \r\nwhile last<n-1:\r\n f=1\r\n for c in range(min(last+d,n-1),last,-1):\r\n if s[c]=='1':\r\n jump += 1\r\n last = c\r\n f=0\r\n break\r\n if f:\r\n possible = False\r\n break\r\n\r\nprint(jump if possible else -1)\r\n", "n, d = map(int, input().split())\r\ndp = [10 ** 9] * n\r\ndp[0] = 0\r\ns = input()\r\nfor i in range(n):\r\n if s[i] == '0':\r\n continue\r\n for j in range(i + 1, min(n, i + d + 1)):\r\n if s[j] == '1':\r\n dp[j] = min(dp[i] + 1, dp[j])\r\nif dp[n - 1] == 10 ** 9:\r\n print(-1)\r\nelse:\r\n print(dp[n - 1])\r\n", "n,d = map(int,input().split())\r\ns = input()\r\n\r\nif '0'*d in s:\r\n\tprint(-1)\r\nelse:\t\r\n\ti = 0\r\n\tcnt = 0\r\n\twhile i < n-1:\r\n\t\tif s[i] == '1':\r\n\t\t\ti += d\r\n\t\t\tcnt += 1\r\n\t\telse:\r\n\t\t\ti -= 1\r\n\tprint(cnt)", "n,d=map(int,input().split())\r\ns=input()\r\n\r\nones=[]\r\nfor i in range(n):\r\n if s[i]==\"1\":\r\n ones.append(i)\r\n\r\nflag=False\r\nfor i in range(len(ones)-1):\r\n if (ones[i+1]-ones[i])>d:\r\n flag=True\r\n break\r\n\r\nif flag==True:\r\n print(-1)\r\nelse:\r\n i=0\r\n j=1\r\n cnt=0\r\n while j<len(ones):\r\n if ones[j]>ones[i]+d:\r\n i=j-1\r\n cnt=cnt+1\r\n else:\r\n j=j+1\r\n print(cnt+1) ", "n,d = input().split(' ')\nn = int(n)-1\nd = int(d)\ns = input()\n\ncurr_index = 0\njump_counter = 0\nwhile curr_index<n:\n try: \n curr_index = s.rindex('1',curr_index+1, curr_index+1+d)\n jump_counter +=1\n except ValueError:\n print(-1)\n break\n if curr_index >=n:\n print(jump_counter)\n\n\t\t\t \t\t \t\t \t\t\t\t\t \t \t", "def solve():\r\n n, d = map(int, input().split())\r\n s = input()\r\n cnt = 0\r\n i = 0\r\n while i < n - 1:\r\n j = min(i + d, n - 1)\r\n while j > i and s[j] == '0':\r\n j -= 1\r\n if j == i:\r\n return -1\r\n else:\r\n cnt += 1\r\n i = j\r\n return cnt\r\n\r\nprint(solve())", "n,d=map(int,input().split())\na=input()\nx=0\nr=0\nwhile x!=n-1:\n y=a[:x+d+1].rfind('1')\n if y==x:\n r=-1\n break\n else:x=y\n r+=1\nprint(r)\n\t \t\t \t \t\t\t\t \t \t \t\t \t\t\t \t", "def solve(n,d,arr):\r\n if arr[0] == 0:\r\n return -1\r\n \r\n start = steps = 0\r\n while(start < n):\r\n jump = start\r\n for i in range(1,d + 1):\r\n if start + i < n and arr[start + i] == 1:\r\n jump = start + i\r\n \r\n steps += 1\r\n if jump == n - 1:\r\n return steps\r\n if jump == start:\r\n return -1\r\n \r\n start = jump\r\n \r\n return -1\r\n\r\n\r\ndef main():\r\n n,d = map(int,input().split())\r\n arr = list(map(int,[i for i in input()]))\r\n ans = solve(n,d,arr)\r\n print(ans)\r\n\r\nmain()", "n,d=map(int,input().split(' '))\r\ns=list(map(int,list(input())))\r\nflag=True;ctr=0\r\ncurrpos=0;#print(s)\r\nwhile True:\r\n\t#print(currpos)\r\n\ttf=True\r\n\tif currpos==len(s)-1:\r\n\t\tflag=False;print(ctr);break\r\n\tfor j in range(currpos+d,currpos,-1):\r\n\t\tif j<len(s):\r\n\t\t\tif s[j]==1:\r\n\t\t\t\tcurrpos=j;ctr+=1\r\n\t\t\t\ttf=False\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tcontinue\r\n\tif tf:\r\n\t\tbreak\r\nif flag:\r\n\tprint(-1)\r\n", "w=str(input()).split()\nn=int(w[0])\nd=int(w[1])\nways=str(input())\ndef num(lis, j):\n\tif j*str(0) in lis:\n\t\treturn -1\n\telse:\n\t\tif len(lis)<=j+1:\n\t\t\treturn 1\n\t\telse:\n\t\t\tind=len(lis)+lis[len(lis)-1-j:].find(\"1\")-j-1\n\t\t\treturn num(lis[:ind+1], j)+1\ncara=num(ways, d)\nprint(cara)\n \t\t \t \t \t \t\t\t\t\t \t", "n,d=map(int,input().split())\r\ns=input()\r\ncur=0\r\nc=0\r\nwhile(cur!=n-1):\r\n m=1\r\n if(d>n-1-cur):\r\n jump=n-1-cur\r\n else:\r\n jump=d\r\n for i in range(jump+cur,cur,-1):\r\n if(s[i]=='1'):\r\n cur=i\r\n c+=1\r\n m=0\r\n break\r\n if(m==1):\r\n m=1\r\n break\r\nif(m==0):\r\n print(c)\r\nelse:\r\n print('-1')\r\n \r\n", "\r\ndef solve(n, d, s):\r\n\r\n if len(s) <= d or len(s) - 1 == d:\r\n return 1\r\n \r\n indices = []\r\n for i in range(1, d + 1):\r\n if s[i] == '1':\r\n indices.append(i)\r\n \r\n if len(indices) == 0:\r\n print(-1)\r\n exit(0)\r\n \r\n index = max(indices)\r\n ans = solve(n - index, d, s[index:]) + 1\r\n return ans\r\n\r\n\r\nif __name__ == '__main__':\r\n tmp = input().split(' ')\r\n n = int(tmp[0])\r\n d = int(tmp[1])\r\n s = input()\r\n ans = solve(n, d, s)\r\n print(ans)\r\n", "n, d = list(map(int, input().split()))\r\ns = input()\r\na = i = 0\r\nans = 0\r\nwhile i < n - 1:\r\n a = s[: d + i + 1].rfind(\"1\")\r\n if a == i:\r\n print(-1)\r\n quit()\r\n i = a\r\n ans += 1\r\nprint(ans)\r\n", "_, d = map(int, input().split())\r\ns = input()\r\n\r\ncurr = 0\r\nresult = 0\r\nwhile curr < len(s) - 1:\r\n cand = min(curr + d, len(s) - 1)\r\n while s[cand] == '0':\r\n cand -= 1\r\n if cand == curr:\r\n result = -1\r\n break\r\n curr = cand\r\n result += 1\r\n\r\nprint(result)\r\n", "import math\ndef error(n):\n print(\"[Err]\",n)\n\nn, d = [int(i) for i in input().split()]\ns = input()[::-1]\np = []\n\nfor i in range(len(s)):\n if (s[i]=='1'):\n p.append(i)\n\nidx = 0\nposi = 0\npossible = 0\nans = 0\nwhile 1:\n if idx==n-1: break\n possible = 0\n while 1:\n if idx>=len(p)-1:\n possible = -1\n ans+=1\n break\n if p[idx+1]<=posi+d:\n idx+=1\n possible = idx\n else:\n break\n if possible>=1:\n ans+=1\n posi = p[idx]\n else:\n break\n\nif possible == -1:\n print(ans)\nelse:\n print(-1)\n\n \t \t \t \t \t\t\t\t\t \t\t\t \t \t \t\t\t\t", "n, d = map(int, input().split())\r\nlillies = input()\r\njumps = 0\r\ni = 0\r\nwhile i < n - 1:\r\n jump = -1\r\n for j in range(i + 1, min(i + d + 1, n)):\r\n if lillies[j] == '1':\r\n jump = j - i\r\n if jump == -1:\r\n break\r\n else:\r\n i += jump\r\n jumps += 1\r\n\r\nif i != n - 1:\r\n print(-1)\r\nelse:\r\n print(jumps)", "n, d = map(int, input().split())\r\ns = input()\r\nsteps = 0\r\npos = 0\r\n# simulate the movement of the frog\r\nwhile (pos < n-1):\r\n # From current position pos, find the farthest one can go in one step\r\n # Break when stuck\r\n new_pos = min(n-1, pos+d)\r\n while s[new_pos] != \"1\":\r\n new_pos -= 1\r\n if new_pos > pos:\r\n pos = new_pos\r\n steps += 1\r\n else:\r\n steps = -1\r\n break\r\nprint(steps)", "tl = list(map(int, input().split()))\r\nn = tl[0] # Distance it wants to reach\r\nd = tl[1] # Max distance frog can jump\r\nstring = input()\r\njumps = 0\r\ncurPos = 0 \r\nwhile (curPos < n):\r\n jumpDistance = d\r\n while ( jumpDistance >= 1):\r\n if ( curPos + jumpDistance >= n):\r\n jumpDistance -= 1\r\n elif ( string[curPos + jumpDistance] == '1'):\r\n break\r\n elif ( string[curPos + jumpDistance] == '0'):\r\n jumpDistance -= 1\r\n if ( jumpDistance == 0):\r\n print(\"-1\")\r\n exit(0)\r\n curPos += jumpDistance\r\n jumps += 1\r\n if (curPos == n - 1):\r\n print(jumps)\r\n exit(0)\r\nprint(-1)", "n,d = input().split(' ')\nn,d = int(n),int(d)\ns = input()\nans = 0\nx = True\ni = 0\n\nwhile i<len(s):\n l = i\n if s[0]==0:\n x = False\n break\n # print(i)\n for j in range(d,0,-1):\n if i+j<len(s) and s[i+j]=='1':\n i += j\n ans += 1\n break\n # print(i)\n if i==len(s)-1:\n break\n if l==i:\n x = False\n break\nif x:\n print(ans)\nelse:\n print(-1)\n\n\t \t \t\t \t \t \t\t \t\t\t\t\t \t\t\t", "n, d = list(map(int, input().split(\" \")))\nl = list(input())\nGraph = [[] for i in range(n)]\nfor i in range(n):\n if(l[i] == '1'):\n for j in range(i+1, i+d+1):\n if(j >= n):\n break\n if(l[j] == '1'):\n Graph[i] += [j]\n Graph[j] += [i]\nq = [0]\nvisited = [0 for i in range(n)]\nvisited[0] = 1\ndistance = [-1 for i in range(n)]\ndistance[0] = 0\nwhile(len(q)!=0):\n x = q[0]\n q.pop(0)\n for i in Graph[x]:\n if(visited[i] == 1):\n continue\n visited[i] = 1\n distance[i] = distance[x] + 1\n q += [i]\nprint (distance[n-1])\n", "n, d = list(map(int, input().split()))\r\nstrg = input()\r\ndp = [0] * n\r\nfor i in range(1, n):\r\n if strg[i] == '0':\r\n dp[i] = -1\r\n else:\r\n minn = n + 1\r\n for j in range(max(0, i - d), i):\r\n if dp[j] == -1:\r\n pass\r\n else:\r\n minn = min(dp[j] + 1, minn)\r\n if minn == n + 1:\r\n dp[i] = -1\r\n else:\r\n dp[i] = minn\r\nprint(dp[-1])\r\n ", "n, d = map(int, input().split())\r\ns = input()\r\n\r\ni = 0\r\nold_i = 0\r\ncount = 0\r\nwhile True:\r\n old_i = i\r\n i += d\r\n count += 1\r\n i = min(i, n - 1)\r\n\r\n if i == n - 1:\r\n print(count)\r\n exit()\r\n\r\n else:\r\n while s[i] != '1':\r\n i -= 1\r\n\r\n if i == old_i:\r\n print(-1)\r\n exit()\r\n", "n,d = map(int,input().split())\r\ns = input()\r\ni =0\r\nj =0\r\nwhile i<n-1 and j<n:\r\n if s[i] =='1':\r\n i+=d\r\n j+=1\r\n else :\r\n i -= 1\r\nif j>=n:\r\n print(-1)\r\nelse : \r\n print(j)", "[n, d] = list(map(int, input().split(' ')))\r\nstring = input()\r\n\r\ndef get_best_step(index):\r\n for i in range(index+d, index, -1):\r\n if(i >= len(string)):\r\n continue\r\n if(string[i] == '1'):\r\n return i\r\n return -1\r\n\r\ndef num_steps():\r\n i = 0\r\n steps = 0\r\n while(i < len(string)):\r\n if(i == len(string)-1):\r\n return steps\r\n i = get_best_step(i)\r\n if(i == -1):\r\n return -1\r\n steps += 1\r\n\r\nprint(num_steps())", "a,b = map(int,input().split())\r\nj = input()\r\nif len(max(j.split('1')))>= b:\r\n\tprint(-1)\r\nelse:\r\n\ti = 0\r\n\tk = 0\r\n\twhile i<len(j)-1 and k<a:\r\n\t\tif j[i]==\"1\":\r\n\t\t\ti+=b\r\n\t\t\tk+=1\r\n\t\telse:\r\n\t\t\ti-=1\r\n\tprint(k)", "\r\nn, d = list(map(int,input().split())) \r\ns = input()\r\n\r\ni = n-1\r\njmps = 1\r\nfail = False\r\nwhile True:\r\n x = max(i-d,0)\r\n if x==0:\r\n print(jmps)\r\n break\r\n ii = s.find('1',x,i)\r\n if ii == -1:\r\n print(-1)\r\n break\r\n i = ii\r\n jmps += 1\r\n\r\n", "def Frog(n,d,arr):\r\n index = 0\r\n count = 0\r\n original = 1\r\n while index < n-1 and index != original:\r\n if arr[index] != \"1\":\r\n index -= 1\r\n elif arr[index] == \"1\":\r\n original = index\r\n index += d\r\n count += 1\r\n \r\n if index == original:\r\n print(-1)\r\n else:\r\n print(count)\r\nn,d = map(int,input().split())\r\narr = input()\r\nFrog(n,d,arr)", "nd = input().split()\r\nn = int(nd[0])\r\nd = int(nd[1])\r\ns = input()\r\nc,i=0,0\r\nk=0\r\n\r\nwhile i!=len(s)-1:\r\n p = i+d\r\n if p>len(s)-1:\r\n p = len(s)-1\r\n for j in range(p,i,-1):\r\n\r\n if s[j]=='1':\r\n c += 1\r\n i = j\r\n break\r\n else:\r\n k=1\r\n break\r\n\r\nif k==1:\r\n print(-1)\r\nelse:\r\n print(c)", "n,m=map(int,input().split())\r\na=list(input())\r\ni=0\r\nz=0\r\ns=0\r\nwhile(i<n):\r\n b=list(a[i:i+m+1])\r\n if(\"1\" in b):\r\n b.reverse()\r\n c=m-b.index(\"1\")\r\n if(c==0):\r\n z=1\r\n break\r\n i+=c\r\n s+=1\r\n else:\r\n z=1\r\n break\r\n if(i==n-1):\r\n break\r\n\r\nif(z==1):\r\n print(-1)\r\nelse:\r\n print(s)", "n, d = map(int, input().split())\r\ns = input()\r\n\r\ndp = [float('inf')] * n\r\n\r\ndp[0] = 0\r\n\r\nfor i in range(1, n):\r\n if s[i] == '1':\r\n for j in range(1, d+1):\r\n if i-j >= 0:\r\n dp[i] = min(dp[i], dp[i-j] + 1)\r\n else:\r\n break\r\n\r\nif dp[n-1] == float('inf'):\r\n print(-1)\r\nelse:\r\n print(dp[n-1])\r\n", "n, d = map(int, input().split())\r\ns = input()\r\nif '0' * d in s:\r\n print(-1)\r\nelse:\r\n ans = 0\r\n i = 0\r\n while i < n - 1:\r\n if list(s)[i] == '1':\r\n i += d\r\n ans += 1\r\n else:\r\n i -= 1\r\n print(ans)\r\n", "import sys\r\n\r\nn, d = map(int, sys.stdin.readline().split(' '))\r\nss = [i for i, s in enumerate(sys.stdin.readline().strip()) if s == '1']\r\n\r\nif ss[1] > d:\r\n print(-1)\r\n exit()\r\n\r\nb = [0, ss[1]]\r\nfor s in ss:\r\n if s - b[-2] <= d:\r\n b[-1] = s\r\n else:\r\n if s - b[-1] > d:\r\n print(-1)\r\n exit()\r\n else:\r\n b.append(s)\r\nprint(len(b)-1)", "import sys\n\nLines = []\nfor Line in sys.stdin:\n Lines.append(Line.rstrip('\\n'))\n\n# Lines=[\"8 4\",\n# \"10010101\"]\n\n# Lines=[\"12 3\",\n# \"101111100101\"]\n\n# Lines=[\"8 4\",\n# \"11100101\"]\n\n# Lines=[\"4 2\",\n# \"1001\"]\n\nn,d = list(map(int,Lines[0].split(\" \")))\ndel(Lines[0])\ns=list(map(int,[i for i in Lines[0]]))\nmemo = [ -1 for j in range(n)]\ndp = [ 0 for j in range(n)]\n\n\ndef min_jumps2(s,d,i):\n if i==0:\n return 0\n \n c=[]\n for j in range(1,d+1):\n if (i-j>=0)and(s[i-j]==1):\n # print(\"ij:\",i,j)\n c += [1 + min_jumps(s,d,i-j)]\n# print(c) \n if c==[]:\n print(-1)\n exit(0)\n return min(c) \n\n\n\ndef min_jumps0(s,d,i):\n if i==0:\n return 0\n\n c=[]\n for j in range(1,d+1):\n if (i-j>=0)and(s[i-j]==1):\n if (memo[i-j]!=-1):\n print(i,j)\n t = memo[i-j]\n else:\n t = min_jumps(s,d,i-j)\n memo[i-j]= t\n c += [1 + t]\n if c==[]:\n print(-1)\n exit(0)\n return min(c) \n\n\n\ndef min_jumps(s,d,i):\n for i in range(1,n):\n c=[]\n for j in range(1,d+1):\n if (i-j>=0)and(s[i-j]==1):\n c += [1 + dp[i-j]]\n if c==[]:\n return -1\n else: \n dp[i] = min(c)\n return dp[n-1]\n\n\n\n\nprint(min_jumps(s,d,n-1))", "n,d = map(int,input().split())\r\narr = input()\r\ndp = [float('inf')]*n\r\ndp[0] = 0\r\n\r\nif arr[n-1] == '0':\r\n print(-1)\r\nelse:\r\n for i in range(1,n):\r\n if arr[i]=='0':continue\r\n for j in range(max(i-d,0),i):\r\n dp[i] = min(dp[i],1+dp[j])\r\n\r\n print(dp[n-1] if dp[n-1] != float('inf') else -1)", "# Contest 13\r\n# J - The Way to Home\r\n# https://codeforces.com/problemset/problem/910/A\r\n\r\ndef main():\r\n\tn, d = list(int(x) for x in input().split())\r\n\tn -= 1\r\n\tlilies = list(int(x) for x in list(input()))\r\n\r\n\tpos = 0\r\n\tjumps_counter = 0\r\n\twhile(pos < n):\r\n\t\tpos = next_jump(lilies, pos, d, n)\r\n\t\tjumps_counter +=1\r\n\r\n\t\tif pos == -1:\r\n\t\t\tprint(\"-1\")\r\n\t\t\treturn\r\n\r\n\tprint(jumps_counter)\r\n\treturn\r\n\r\n\r\ndef next_jump(lilies, pos, d, n):\r\n\tif pos+d >= n:\r\n\t\treturn n\r\n\r\n\tpossible_jump_pos = -1\r\n\tfor i in range(1, d+1):\r\n\t\tif lilies[pos+i] == 1:\r\n\t\t\tpossible_jump_pos = pos+i\r\n\r\n\treturn possible_jump_pos\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "\r\nn,d = map(int,input().split())\r\ns = input()\r\npre_Ind= [0 for i in range(len(s))]\r\nprevious_one = 0\r\nfor i in range(len(s)):\r\n if s[i]=='1':\r\n previous_one = i\r\n pre_Ind[i] = previous_one\r\n# 1 2 ... n\r\n# 0 1 ... n-1\r\nstart=0\r\nstep=0\r\nsign = True\r\nwhile start!=n-1:\r\n if(pre_Ind[min(start+d , n-1)]==start):\r\n sign = False\r\n break\r\n start = pre_Ind[min(start+d,n-1)]\r\n step+=1\r\nif sign:\r\n print(step)\r\nelse:\r\n print(-1)\r\n \r\n\r\n \r\n", "n,d=map(int,input().split())\r\ns=input()\r\nl=[]\r\nfor i in range(n):\r\n if(s[i]=='1'):\r\n l.append(i)\r\n\r\nc=0\r\na=0\r\nfor i in range(0,len(l)):\r\n if(l[i]-c > d):\r\n print(\"-1\")\r\n break\r\n while((i < len(l)) and (l[i]-c<=d)):\r\n i=i+1\r\n if(i==len(l)):\r\n print(a+1)\r\n break\r\n else:\r\n c=l[i-1]\r\n a=a+1\r\n \r\n" ]

[ "if __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n cnt, l, ans = {}, 0, 0\r\n for r, v in enumerate(a):\r\n if v in cnt:\r\n cnt[v] += 1\r\n else:\r\n cnt[v] = 1\r\n while len(cnt) > 2:\r\n cnt[a[l]] -= 1\r\n if cnt[a[l]] == 0:\r\n cnt.pop(a[l])\r\n l += 1\r\n ans = max(ans, r - l + 1)\r\n print(ans)\r\n", "MOD=10**9+7\r\ndef slove():\r\n n=int(input())\r\n # m=input()\r\n a=list(map(int,input().split(' ')))\r\n left=0\r\n d={}\r\n ans=0\r\n for i,x in enumerate(a):\r\n if x not in d: d[x]=0\r\n d[x]+=1\r\n while len(d)>2:\r\n d[a[left]]-=1\r\n if d[a[left]]==0:\r\n del d[a[left]]\r\n left+=1\r\n ans=max(ans,i-left+1)\r\n print(ans)\r\n return\r\n \r\n \r\n# t=int(input())\r\nt=1\r\n# M=1<<30\r\nfor _ in range(t):\r\n slove()\r\n ", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nd = {}\r\nfor x in a:\r\n d[x] = 0\r\nans = 0\r\nj = 0\r\nm = 0\r\nfor i in range(n):\r\n while j < n and m <= 2:\r\n if d[a[j]] == 0 and m == 2:\r\n break\r\n elif d[a[j]] == 0:\r\n m += 1\r\n d[a[j]] += 1\r\n j += 1\r\n ans = max(ans, j - i)\r\n d[a[i]] -= 1\r\n if d[a[i]] == 0:\r\n m -= 1\r\nprint(ans)", "a=int(input())\nb=list(map(int,input().split()))\nc=1\nd=0\ne=0\ng=0\nfor i in range(1,a):\n f=b[i]-b[i-1]\n if(f!=0):\n if(f==d):\n g=e+1\n e=i-1\n d=f\n c=max(c,i-g+1)\nprint(c)\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\ntrack = [-1 for _ in range(100001)]\r\ncheck = 0\r\ni = 0\r\nans = 2\r\nmn = a[0]\r\nmx = a[0]\r\ntrack[a[0]] = 0\r\nrun = 1\r\nl = 1\r\nwhile(i<n-1):\r\n if check:\r\n break\r\n for j in range(run,n):\r\n next = a[j]\r\n track[next] = j\r\n if abs(next-mn)>1:\r\n if l>ans:\r\n ans = l\r\n i=track[mn]+1\r\n track[mn] = -1\r\n mn = mx\r\n mx = next\r\n l = j -i\r\n run = j\r\n break\r\n elif abs(mx-next)>1:\r\n if l>ans:\r\n ans = l\r\n i = track[mx] + 1\r\n track[mx] = -1\r\n mx = mn\r\n mn = next\r\n l = j - i\r\n run = j\r\n break\r\n else:\r\n l+=1\r\n mn = min(mn,mx,next)\r\n mx = max(mn,mx,next)\r\n if j == n-1:\r\n if l>ans:\r\n ans = l\r\n check = 1\r\n break\r\nprint(ans)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nprev = - 1\r\ncur = arr[0]\r\ncurcount = 1\r\nprevcount = 0\r\nans = 1\r\nnext = 0\r\n\r\nfor i in range(1 , n ):\r\n\r\n next = arr[i]\r\n\r\n if (next == cur):\r\n curcount += 1\r\n\r\n elif (next == prev):\r\n prevcount += curcount\r\n prev = cur\r\n cur = next\r\n curcount = 1\r\n\r\n else:\r\n ans = max(ans , curcount + prevcount)\r\n\r\n prev = cur\r\n prevcount = curcount\r\n cur = next\r\n curcount = 1\r\n\r\n#print(ans)\r\nprint(max(ans , prevcount + curcount))", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmaxi=arr[0]\r\nmini=arr[0]\r\nminiIndex=0\r\nmaxiIndex=0\r\ntemp=1\r\nans=1\r\nfor i in range(1,n):\r\n if abs(mini-arr[i])<=1 and abs(maxi-arr[i])<=1:\r\n if mini==arr[i]:\r\n miniIndex=i\r\n if maxi==arr[i]:\r\n maxiIndex=i\r\n temp+=1\r\n else:\r\n if maxi-arr[i]>1:\r\n mini=arr[i]\r\n j=maxiIndex\r\n while j<n and arr[j]==maxi:\r\n j+=1\r\n if j<n:\r\n maxiIndex=j\r\n maxi=arr[j]\r\n miniIndex=i\r\n temp=(miniIndex-maxiIndex+1)\r\n elif arr[i]-mini>1:\r\n maxi=arr[i]\r\n j=miniIndex\r\n while j<n and arr[j]==mini:\r\n j+=1\r\n if j<n:\r\n miniIndex=j\r\n mini=arr[j]\r\n maxiIndex=i\r\n temp=(maxiIndex-miniIndex+1)\r\n ans=max(ans,temp)\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nl = 0\r\nlatest_diff = 0\r\np = 0\r\nans = 1\r\nfor i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n if a[i]-a[i-1]==latest_diff:\r\n l = p+1\r\n latest_diff = a[i]-a[i-1]\r\n p = i-1\r\n ans = max(ans,i-l+1)\r\nprint(ans)\r\n \r\n", "from collections import defaultdict\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = defaultdict(int)\r\nres = 0\r\nleft = right = 0\r\nwhile right < n:\r\n d[a[right]] += 1\r\n while max(d) - min(d) > 1:\r\n d[a[left]] -= 1\r\n if d[a[left]] == 0:\r\n del d[a[left]]\r\n left += 1\r\n res = max(res, right - left + 1)\r\n right += 1\r\nprint(res)", "'''\r\nhttps://codeforces.com/problemset/problem/602/B\r\n\r\n输入 n(2≤n≤1e5) 和长为 n 的数组 a(1≤a[i]≤1e5 且 abs(a[i]-a[i-1])≤1)。\r\n输出 a 的最长连续子数组的长度，满足数组中的最大值减最小值不超过 1。\r\n输入\r\n5\r\n1 2 3 3 2\r\n输出 4\r\n\r\n输入\r\n11\r\n5 4 5 5 6 7 8 8 8 7 6\r\n输出 5\r\n'''\r\n\r\n\r\ndef _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _nS():\r\n return input().split()\r\n\r\n\r\ndef solve():\r\n n = _n()\r\n a = _nA()\r\n l, r = 0, 0\r\n d = {}\r\n ret = 0\r\n while r < n:\r\n d[a[r]] = d.get(a[r], 0) + 1\r\n while max(d.keys())-min(d.keys()) > 1:\r\n d[a[l]] -= 1\r\n if d[a[l]] == 0:\r\n del d[a[l]]\r\n l += 1\r\n ret = max(r-l+1, ret)\r\n r += 1\r\n print(ret)\r\n\r\n\r\nsolve()\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nans=0\r\nd=0\r\ns=[0]*(100000+1)\r\nj=0\r\nfor i in range (n):\r\n if s[a[i]]==0:\r\n d+=1\r\n s[a[i]]+=1\r\n if d>2:\r\n while True:\r\n s[a[j]]-=1\r\n if s[a[j]]==0:\r\n j+=1\r\n break\r\n j+=1\r\n d-=1\r\n ans=max(ans,i-j+1)\r\nprint(ans)", "# maa chudaaye duniya\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nans = 1\r\nprev = pos = j = 0\r\nfor i in range(1, n):\r\n diff = arr[i] - arr[i-1]\r\n if diff != 0:\r\n if diff == prev:\r\n j = pos + 1\r\n pos = i-1\r\n prev = diff\r\n ans = max(ans, i - j + 1)\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nj = left = delta = ans = 0\r\nfor i in range(1, n):\r\n xy = a[i]-a[i-1]\r\n if xy:\r\n if delta == xy:\r\n left = j\r\n j, delta = i, xy\r\n ans = max(ans, i-left+1)\r\nprint(ans)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\ndistinct_count = 0\ncnt = [0]*100001\nL = R = 0\nmax_range = 0\n\nfor R in range(n):\n if cnt[a[R]] == 0:\n distinct_count += 1\n cnt[a[R]] += 1\n\n while L < n and distinct_count > 2:\n if cnt[a[L]] == 1:\n distinct_count -= 1\n cnt[a[L]] -= 1\n L += 1\n\n max_range = max(max_range, R-L+1)\n\nprint(max_range)\n\n\n\n", "import math\r\nimport sys\r\nimport operator\r\nfrom collections import defaultdict\r\n\r\ndef main() -> None:\r\n read = sys.stdin.readline\r\n n = int(read())\r\n\r\n # Keep track of the frequency of the numbers in the subarray\r\n values_in_subarray = defaultdict(lambda : 0)\r\n values = [int(i) for i in read().split()]\r\n\r\n max_length = 1\r\n right = 0\r\n # Keep a left and right pointer\r\n # We move the right pointer until we find the rightmost range based on the current left pointer.\r\n # Once we cannot move further right, we move the left pointer and try to see if we can update the right pointer,\r\n # if not we continue moving moving the left pointer to the right\r\n for l in range(n):\r\n if l > 0:\r\n # As you move the left pointer, update the dict to note that there is one less value\r\n values_in_subarray[values[l - 1]] -= 1\r\n if values_in_subarray[values[l - 1]] == 0:\r\n # you need to delete it so that count decreases\r\n values_in_subarray.pop(values[l - 1])\r\n # We know we can move to the right as long as there is only one element,\r\n # i.e 1111111 OR\r\n # there are two elements and the elt at index r is one of those two\r\n while right < n and (len(values_in_subarray) <= 1 or values[right] in values_in_subarray):\r\n curr_val = values[right]\r\n values_in_subarray[curr_val] += 1\r\n right += 1\r\n # Note that right ends in an invalid position since it is 1 more than what we need,\r\n # so that is why we do not use right - l + 1\r\n max_length = max(right - l, max_length)\r\n print(max_length)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "N = int(input())\nnumbers = [0 for i in range(100001)]\na_list = input().split()\nfor i in range(N):\n numbers[i] = int(a_list[i])\nMemo = [-1 for i in range(100005)]\nl = 0 \nresult = 0 \nfor i in range(N):\n x = -1\n if (numbers[i]+2<=100000):\n x = max(x,Memo[numbers[i]+2])\n if(numbers[i]-2>=0):\n x = max(x,Memo[numbers[i]-2])\n l = max(l,x+1)\n result = max(result,i-l+1)\n Memo[numbers[i]] = i \n\nprint(result)\n\n\n", "number_of_data_points = int(input())\r\ndata_points = list(map(int, input().split()))\r\n\r\ncount_seq = [0 for _ in range(10**5 + 5)]\r\nk = 0\r\nunique = 0\r\nmax_constant_range = 1\r\n\r\nfor i in range(number_of_data_points):\r\n if count_seq[data_points[i]] == 0:\r\n unique += 1\r\n\r\n count_seq[data_points[i]] += 1\r\n\r\n while unique > 2:\r\n if count_seq[data_points[k]] == 1:\r\n unique -= 1\r\n\r\n count_seq[data_points[k]] -= 1\r\n k += 1\r\n\r\n max_constant_range = max(max_constant_range, i - k + 1)\r\n\r\nprint(max_constant_range)\r\n", "n = int(input())\r\narr = map(int, input().split(' '))\r\nmn = 10**9\r\nmx = 0\r\nlast_pos_max = 0\r\nlast_pos_min = 0\r\nans = 0\r\ncurrent_trend_start = 0\r\nfor i, j in enumerate(arr):\r\n if j > mx:\r\n if j-mn>1:\r\n mn = mx\r\n ans = max(ans, i-current_trend_start)\r\n current_trend_start = last_pos_min+1\r\n last_pos_min = last_pos_max\r\n mx=j\r\n \r\n if j < mn:\r\n if mx-j>1:\r\n mx = mn\r\n ans = max(ans, i-current_trend_start)\r\n current_trend_start = last_pos_max+1\r\n last_pos_max = last_pos_min\r\n mn = j\r\n \r\n if j == mx:\r\n last_pos_max = i\r\n elif j==mn:\r\n last_pos_min = i\r\nprint(max(ans, n-current_trend_start))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nd = {}\r\nmx = 0\r\nfor c in arr:\r\n nd = {}\r\n nd[c-0.5] = d.get(c-0.5,0)+1\r\n nd[c] = d.get(c,0)+1\r\n nd[c+0.5] = d.get(c+0.5,0)+1\r\n mx = max(mx,nd[c-0.5],nd[c],nd[c+0.5])\r\n d = nd\r\nprint(mx)", "def main():\r\n input()\r\n seq = [int(c) for c in input().split()]\r\n \r\n last_diff = last_idx = start = ans = 0\r\n for i in range(1, len(seq)):\r\n diff = seq[i] - seq[i-1]\r\n if diff:\r\n if diff == last_diff and last_diff:\r\n start = last_idx\r\n \r\n last_idx = i\r\n last_diff = diff\r\n \r\n ans = max(ans, i - start + 1)\r\n \r\n print(ans)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "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\ndef main():\r\n n = int(input())\r\n L = list(map(int, input().split()))\r\n dic = Counter()\r\n i, j = 0, 0\r\n ans = 1\r\n while j < n:\r\n if len(dic) <= 2:\r\n ans = max(ans, j - i)\r\n dic[L[j]] += 1\r\n j += 1\r\n else:\r\n dic[L[i]] -= 1\r\n if dic[L[i]] == 0:\r\n del dic[L[i]]\r\n i += 1\r\n while len(dic) > 2:\r\n dic[L[i]] -= 1\r\n if dic[L[i]] == 0:\r\n del dic[L[i]]\r\n i += 1\r\n ans = max(ans, n - i)\r\n print(ans)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {}\r\n\r\nstart = 0\r\nans = 0\r\n\r\nfor end in range(n):\r\n if a[end] in d:\r\n d[a[end]] += 1\r\n else:\r\n d[a[end]] = 1\r\n while len(d) > 2:\r\n start += 1\r\n d[a[start - 1]] -= 1\r\n if d[a[start - 1]] == 0:\r\n d.pop(a[start - 1])\r\n if end - start > ans:\r\n ans = end - start \r\nprint(ans + 1)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nresult = 0\r\ncurrent_length = 0\r\nx = 1\r\ny = 1\r\nresult = 2\r\n\r\nfor i in range(1, n):\r\n if data[i] == data[i - 1]:\r\n x += 1\r\n y += 1\r\n elif data[i] > data[i - 1]:\r\n y = x + 1\r\n x = 1\r\n else:\r\n x = y + 1\r\n y = 1\r\n result = max(result, max(x, y))\r\n\r\nprint(result)\r\n", "# from debug import debug\r\nfrom math import ceil, log2\r\nimport sys;input = sys.stdin.readline\r\n\r\ninf = int(1e10)\r\nn = int(input())\r\nlis = list(map(int, input().split()))\r\n# sparse table\r\nk = int(log2(n))+2\r\ntablemin = [[lis[i] if j == 0 else inf for j in range(k)] for i in range(n)]\r\ntablemax = [[lis[i] if j == 0 else 0 for j in range(k)] for i in range(n)]\r\nfor j in range(1, k):\r\n\tfor i in range(n-(1<<j)+1):\r\n\t\ttablemin[i][j] = min(tablemin[i][j-1], tablemin[i+(1<<(j-1))][j-1])\r\n\t\ttablemax[i][j] = max(tablemax[i][j-1], tablemax[i+(1<<(j-1))][j-1])\r\ndef qmax(a,b):\r\n\ts = log2(b-a+1)\r\n\tif ceil(s) == int(s): return tablemax[a][int(s)]\r\n\ts = int(s)\r\n\treturn max(tablemax[a][s], tablemax[b-(1<<s)+1][s])\r\ndef qmin(a,b):\r\n\ts = log2(b-a+1)\r\n\tif ceil(s) == int(s): return tablemin[a][int(s)]\r\n\ts = int(s)\r\n\treturn min(tablemin[a][s], tablemin[b-(1<<s)+1][s])\r\n\r\ni, j = 0, 0\r\nans = 0\r\nwhile j<n:\r\n\tans = max(ans, j-i+1)\r\n\tif qmax(i, j+1) - qmin(i, j+1) < 2: j+=1\r\n\telse: i+=1\r\nprint(ans)\r\n\r\n\t\r\n\r\n\r\n\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ni = 0\r\ncnt = 1\r\nj = 0\r\nlock = 0\r\nz = -1\r\nm = []\r\na=0\r\nb=0\r\nwhile i < n - 1 :\r\n d = abs(arr[i] - arr[i+1])\r\n if d == 0 :\r\n cnt+=1\r\n if z == -1 :\r\n z = j\r\n elif d == 1 :\r\n if lock == 0 :\r\n cnt+=1\r\n a = min(arr[i],arr[i+1])\r\n b = max(arr[i],arr[i+1])\r\n z = -1\r\n lock = 1\r\n else :\r\n if arr[i+1] == a or arr[i+1] == b :\r\n cnt+=1\r\n z = -1\r\n else :\r\n if z == -1 :\r\n m.append(cnt)\r\n cnt = 2\r\n else :\r\n m.append(cnt)\r\n cnt = (i+2) - z \r\n a = min(arr[i],arr[i+1])\r\n b = max(arr[i],arr[i+1]) \r\n z = -1 \r\n else :\r\n m.append(cnt)\r\n cnt = 1 \r\n lock = 0\r\n\r\n j+=1\r\n i+=1\r\n\r\n # print(z,i,j,m,a,b,cnt)\r\n\r\nm.append(cnt)\r\n\r\nprint(max(m))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\narr_diff = []\r\n\r\nfor i in range(int(1e6)):\r\n arr_diff.append(0)\r\n\r\narr_diff[a[0]] += 1\r\nmax_length = 0\r\nnum_diff = 1\r\nj = 1\r\nfor i in range(n):\r\n while (j < n):\r\n if (arr_diff[a[j]] == 0):\r\n num_diff += 1\r\n arr_diff[a[j]] += 1\r\n\r\n if (num_diff == 3):\r\n num_diff -= 1\r\n arr_diff[a[j]] -= 1\r\n break\r\n j = j+1\r\n\r\n max_length = max(max_length, j-i)\r\n #print(i, j, num_diff, max_length)\r\n arr_diff[a[i]] -= 1\r\n if (arr_diff[a[i]] == 0):\r\n num_diff -= 1\r\n\r\n\r\nprint(max_length)\r\n", "n=int(input())\r\np=[0]*100003\r\nans=-1\r\nar=input().split()\r\nfor i in range(1,n+1):\r\n x=int(ar[i-1])\r\n if(p[x-1]>p[x+1]): ans = max(ans, i-max(p[x+1],p[x-2]))\r\n else: ans = max(ans, i-max(p[x+2],p[x-1]))\r\n p[x] = i;\r\nprint(ans)", "N = int(input())\nnumbers = [0 for i in range(100001)]\na_list = input().split()\nfor i in range(N):\n numbers[i] = int(a_list[i])\nMemo = [-1 for i in range(100005)] # Record the the Position When certain number appears\nmax_bad_position = 0 # Record the max position where the situation is not satisfied \nresult = 0 \nfor i in range(N):\n x = -1\n if (numbers[i]+2<=100000):\n x = max(x,Memo[numbers[i]+2])\n if(numbers[i]-2>=0):\n x = max(x,Memo[numbers[i]-2])\n max_bad_position = max(max_bad_position,x+1)\n result = max(result,i-max_bad_position+1)\n Memo[numbers[i]] = i \n\nprint(result)\n\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nres, diff = 1, 0\r\ncnt = [0] * int(1e5+3)\r\nidx = 0\r\nfor i in range(n):\r\n if cnt[arr[i]] == 0:\r\n diff += 1\r\n cnt[arr[i]] += 1\r\n while diff > 2:\r\n cnt[arr[idx]] -= 1\r\n if cnt[arr[idx]] == 0:\r\n diff -= 1\r\n idx += 1\r\n res = max(res, i - idx + 1)\r\nprint(res)\r\n", "def main():\n n = int(input())\n arr = list(map(int, input().split()))\n arr.append(999999999)\n \n fr = 0\n sc = 0\n \n mini = arr[0]\n maxi = arr[0]\n \n ans = 1\n \n for i in range(1, n + 1):\n sc = i\n \n if arr[i] < mini:\n mini = arr[i]\n if arr[i] > maxi:\n maxi = arr[i]\n \n if abs(maxi - mini) > 1:\n mini = 999999999\n maxi = -999999999\n \n ans = max(ans, sc - fr)\n \n j = sc\n \n while j >= 0:\n if abs(arr[j] - arr[i]) > 1:\n break\n \n fr = j\n if arr[j] < mini:\n mini = arr[j]\n if arr[j] > maxi:\n maxi = arr[j]\n \n j -= 1\n \n print(ans)\n\nif __name__ == \"__main__\":\n main()\n#\n \t\t \t\t \t \t\t\t \t \t \t \t \t\t\t", "def solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n i, j = 0, 0\r\n values = {a[i]: 1}\r\n answer = 0\r\n while j < n:\r\n max_v, min_v = max(values), min(values)\r\n if max_v - min_v > 1:\r\n if values[a[i]] == 1:\r\n del values[a[i]]\r\n else:\r\n values[a[i]] -= 1\r\n i += 1\r\n else:\r\n answer = max(answer, j - i + 1)\r\n j += 1\r\n if j < n:\r\n if a[j] not in values:\r\n values[a[j]] = 1\r\n else:\r\n values[a[j]] += 1\r\n print(answer)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # from datetime import datetime\r\n\r\n # start = datetime.now()\r\n\r\n solve()\r\n\r\n # print(datetime.now() - start)\r\n", "n = int(input())\r\na = [0];\r\na[1:1] = (list(map(int, input().split())))\r\nlast = [0] * 100010\r\nans = 0\r\nfor i in range(1, n+1):\r\n l1 = 0\r\n if (a[i] > 2):\r\n l1 = last[a[i] -2]\r\n l2 = last[a[i]+2]\r\n l3 = min (last[a[i]-1], last[a[i]+1])\r\n l = max(l3, max(l2, l1))\r\n ans = max(ans, i - l)\r\n last[a[i]] = i\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\np = [0] * 100010\r\nans = -1\r\n\r\nfor i in range(n):\r\n x = a[i]\r\n if p[x - 1] > p[x + 1]:\r\n ans = max(ans, i + 1 - max(p[x + 1], p[x - 2]))\r\n else:\r\n ans = max(ans, i + 1 - max(p[x - 1], p[x + 2]))\r\n \r\n p[x] = i + 1\r\n\r\nprint(ans)\r\n", "import sys\nfrom collections import Counter\ninput = lambda: sys.stdin.readline().rstrip()\nsint = lambda: int(input())\nmint = lambda: map(int, input().split())\nints = lambda: list(map(int, input().split()))\n\ndef solve() -> None: \n n = sint()\n nums = ints()\n cnt = Counter()\n ans = l = k = 0\n for r in range(n):\n cnt[nums[r]] += 1\n if cnt[nums[r]] == 1: k += 1\n while k > 2:\n cnt[nums[l]] -= 1\n if cnt[nums[l]] == 0: k -= 1\n l += 1\n ans = max(ans, r - l + 1)\n print(ans) \n\nsolve()\n \t \t\t \t\t\t \t\t \t\t\t \t \t \t", "inp = lambda: map(int, input().rstrip().split())\nn = int(input())\na = list(inp())\nj = left = diff = ans = 0\nfor i in range(1, n):\n d = a[i]-a[i-1]\n if d:\n if diff == d:\n left = j\n j, diff = i, d\n ans = max(ans, i-left+1)\nprint(ans)", "#http://codeforces.com/problemset/problem/602/B\ndef approximate_range(ls):\n result = []\n i = 0\n j = 0\n max_val = ls[0]\n min_val = ls[0]\n\n\n while i < n:\n #print(i,j,max_val,min_val)\n if ls[i] > max_val:\n max_val = ls[i]\n elif ls[i] < min_val:\n min_val = ls[i]\n \n delta = abs(max_val - min_val)\n \n if delta <= 1:\n i += 1\n if i >= n:\n result.append((j,i-1))\n else:\n result.append((j,i-1))\n j = i - 1 \n \n while abs(ls[i] - ls[j]) <= 1:\n j = j - 1\n\n j += 1 \n min_val = min(ls[j], ls[i])\n max_val = max(ls[j], ls[i])\n\n ans = 0\n for element in result:\n temp = element[1] - element[0] + 1\n if temp > ans:\n ans = temp \n return ans \n\n\nif __name__ == '__main__':\n n = int(input())\n ls = list(map(int,input().split()))\n result = approximate_range(ls)\n print(result)\n\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\nfre = [0] * (10 ** 5 + 5)\r\ndiff = 0\r\nj = 0\r\nlongest_range = 0\r\n \r\nfor i in range(n):\r\n if fre[a[i]] == 0:\r\n diff += 1\r\n fre[a[i]] += 1\r\n \r\n while j < n and diff > 2:\r\n if fre[a[j]] == 1:\r\n diff -= 1\r\n fre[a[j]] -= 1\r\n j += 1\r\n \r\n longest_range = max(longest_range, i - j + 1)\r\n \r\nprint(longest_range)", "n=int(input())\r\na=list(map(int,input().split()))\r\ndp=[[0]*2 for i in range(n)]\r\ndp[0][1]=dp[0][0]=1\r\nfor i in range(1,n):\r\n if a[i]==a[i-1]:\r\n dp[i][1]=dp[i-1][1]+1\r\n dp[i][0]=dp[i-1][0]+1\r\n elif a[i]==a[i-1]+1:\r\n dp[i][1]=dp[i-1][0]+1\r\n dp[i][0]=1\r\n elif a[i]==a[i-1]-1:\r\n dp[i][1]=1\r\n dp[i][0]=dp[i-1][1]+1\r\n else:\r\n dp[i][1]=dp[i][0]=1\r\nans=0\r\nfor i in range(n):\r\n ans=max(ans,max(dp[i]))\r\nprint(ans)", "def longest_almost_constant_range(n, data):\n frequency = {}\n left = 0\n max_length = 0\n\n for right in range(n):\n # Update the frequency dictionary\n frequency[data[right]] = frequency.get(data[right], 0) + 1\n\n # Keep adjusting the left pointer until the range becomes almost constant\n while max(frequency) - min(frequency) > 1:\n frequency[data[left]] -= 1\n if frequency[data[left]] == 0:\n del frequency[data[left]]\n left += 1\n \n max_length = max(max_length, right - left + 1)\n\n return max_length\n\n# Read input\nn = int(input())\ndata = list(map(int, input().split()))\n\n# Calculate and print the result\nresult = longest_almost_constant_range(n, data)\nprint(result)\n\t \t\t \t\t \t\t\t \t\t \t\t\t \t \t\t\t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nf = [0]*(int(1e5)+5)\r\ncnt = 0\r\nleft = 0\r\nr = 0\r\nfor right in range(n):\r\n f[a[right]] += 1\r\n if f[a[right]] == 1:\r\n cnt += 1\r\n while left < n and cnt > 2:\r\n if f[a[left]] == 1:\r\n cnt -= 1\r\n f[a[left]] -= 1\r\n left += 1\r\n r = max(r, right-left+1)\r\nprint(r)\r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\ndp = [0 for i in range(100010)]\r\nans = 0\r\nfor num in arr:\r\n dp[num] += 1\r\n dp[num-1] += 1\r\n dp[num+1] = 0\r\n if num != 1:\r\n dp[num-2] = 0\r\n ans = max(ans, dp[num], dp[num-1])\r\nprint(ans)", "import bisect\r\n\r\nn=int(input())\r\np = list(map(int, input().split(' ')))\r\ndp1=[0]*n\r\ndp2=[0]*n\r\nfor i in range (0,n):\r\n if i==0:\r\n dp1[i]=1\r\n dp2[i]=1\r\n else:\r\n if p[i]==p[i-1]:\r\n dp1[i]=dp1[i-1]+1\r\n dp2[i]=dp2[i-1]+1\r\n elif p[i]-p[i-1]==1:\r\n dp1[i]=1\r\n dp2[i]=dp1[i-1]+1\r\n else:\r\n dp2[i]=1\r\n dp1[i]=dp2[i-1]+1\r\nprint(max(max(dp1),max(dp2)))\r\n\r\n\r\n\r\n\r\n\r\n", "import os,sys,collections,heapq,itertools,functools,operator,random\r\nif os.path.exists('in.txt'):\r\n file = open('in.txt') \r\n input = file.readline \r\nelse : \r\n input = sys.stdin.readline \r\nfrom functools import reduce , lru_cache\r\nfrom itertools import accumulate,chain,combinations,count \r\nfrom itertools import groupby,permutations,product,zip_longest\r\nfrom heapq import heapify,heappush,heappop,heapreplace,merge,nlargest,nsmallest\r\nfrom collections import Counter,defaultdict,deque \r\nfrom bisect import bisect_left, bisect_right\r\nfrom math import comb,floor,ceil,inf ,gcd ,sqrt ,atan2\r\nfrom random import randint \r\nreadi = lambda: int(input()) \r\nreadis = lambda: list(map(int,input().split()))\r\nreads = lambda: input().rstrip() \r\nreadss = lambda: input().split() \r\ndef solution(): \r\n n = readi() \r\n a = readis()\r\n c = 0 \r\n j = 0 \r\n C = Counter() \r\n res = 0 \r\n for i in range(n):\r\n while j < n and (c<=1 or C[a[j]] ):\r\n c += C[a[j]] == 0\r\n C[a[j]] += 1 \r\n j += 1 \r\n res = max(res,j-i) \r\n C[a[i]] -= 1 \r\n c -= C[a[i]] == 0 \r\n print(res)\r\nfor i in range( 1 ):\r\n solution() ", "n = int(input())\na = list(map(int,input().split()))\n\ndp = [0]*n\ndp[0] = 1\nmx = a[0]\nmn = a[0]\nstart = 0\n\nfor i in range(1,n):\n x = max(abs(a[i]-mx),abs(a[i]-mn))\n if (x<=1):\n dp[i] = dp[i-1]+1\n mx = max(mx,a[i])\n mn = min(mn,a[i])\n else:\n j = i\n mx = a[i]\n mn = a[i]\n while (max(abs(mx-a[j]),abs(mn-a[j])) <= 1 ):\n dp[i] += 1\n mx = max(mx,a[j])\n mn = min(mn,a[j])\n j -= 1\n\nprint(max(dp))\n", "from collections import Counter\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nleft = ans = 0\r\ncnt = Counter()\r\nfor right, x in enumerate(a):\r\n cnt[x] += 1\r\n while len(cnt.keys()) > 2:\r\n cnt[a[left]] -= 1\r\n if cnt[a[left]] == 0:\r\n cnt.pop(a[left])\r\n left += 1\r\n ans = max(ans, right - left + 1)\r\nprint(ans)", "n = int(input())\narray = list(map(int, input().split()))\n\nleft = 0\nright = 0\nmax_len = 1\ncounts = dict()\n\nwhile right < n:\n #update max and min by keeping track instead of max(range) everytime, which is slower\n #max_val = max(max_val, array[right])\n #min_val = min(min_val, array[right])\n \n counts[array[right]] = counts.get(array[right], 0) + 1\n if len(counts.values()) <= 2:\n # update max length\n max_len = max(max_len, right - left + 1)\n # expand range to the right to find longer ranges\n else:\n counts[array[left]] -= 1\n if counts[array[left]] == 0:\n del counts[array[left]]\n # shrink the range from the left\n if left >= n - 1:\n break\n else:\n \tleft +=1 \n right +=1 \nprint(max_len)\n", "class CodeforcesTask602BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.sequence = []\n\n def read_input(self):\n self.n = int(input())\n self.sequence = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n devel = [x % 3 for x in self.sequence]\n maxlen = 0\n for level in range(3):\n clen = 0\n for x in range(self.n):\n if devel[x] == level:\n maxlen = max(maxlen, clen)\n clen = 0\n else:\n clen += 1\n maxlen = max(maxlen, clen)\n self.result = str(maxlen)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask602BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\na = []\r\na = list(map(int,input().split()))\r\nr = 0\r\nf = [0]*(10**5+5)\r\nt = 0\r\nj = 0\r\nfor i in range(n):\r\n if(f[a[i]] == 0):\r\n t += 1\r\n f[a[i]] += 1\r\n while(j<n and t>2):\r\n if(f[a[j]] == 1):\r\n t -= 1\r\n f[a[j]] -= 1\r\n j += 1\r\n r = max(r,i-j+1)\r\nprint(r)", "from sys import stdin, stdout\nrd = lambda: list(map(int, stdin.readline().split()))\nrds = lambda: stdin.readline().rstrip()\nii = lambda: int(stdin.readline())\nINF = 1 << 62\nmod = 10**9 + 7\n\nn = ii()\nar = rd()\n\ni = 0\nj = 0\nm, M = ar[i], ar[i]\ncurr_min = i\ncurr_max = i\nlast = 'min'\n\nres = -INF\nwhile i < n and j < n:\n # update min and max\n if ar[j] == M:\n curr_max = j\n elif ar[j] > M:\n M = ar[j]\n curr_max = j\n last = 'max'\n\n if ar[j] == m:\n curr_min = j\n elif ar[j] < m:\n m = ar[j]\n curr_min = j\n last = 'min'\n \n # if ok move j\n if M - m <= 1:\n j += 1\n else:\n # if the last added element updated min\n # move i to the last element < M\n res = max(res, j-i)\n if last == 'min':\n i = curr_max + 1\n M = ar[i]\n curr_max = i\n else:\n i = curr_min + 1\n m = ar[i]\n curr_min = i\n\nres = max(res, j-i)\nprint(res)\n\n\n#stdout.write(' '.join(map(str, ar)))\n#stdout.write(f'{res}')\n\n", "import sys, math, itertools, functools, collections, bisect\r\ninput = sys.stdin.readline\r\n#sys.setrecursionlimit(10**6)\r\n \r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\npa = lambda x: print (\" \".join(map(str, x)))\r\n \r\n\r\n \r\n#-------- DIFFERENT WAYS TO UNSTUCK ------------ \r\n# 1. Frequency/Value domain and Pigeon Hole Principle \r\n# 2. Search from end to start instead of start to end\r\n# 3. Prefix Suffix\r\n# 4. Brute force if small input size\r\nINF = 10**18\r\ntest_case = 1\r\n \r\ndef solve():\r\n l = 0\r\n ans = 0\r\n minq = collections.deque()\r\n maxq = collections.deque()\r\n for r in range(n):\r\n while minq and minq[-1] > A[r]:\r\n minq.pop()\r\n minq.append(A[r])\r\n\r\n while maxq and maxq[-1] < A[r]:\r\n maxq.pop()\r\n maxq.append(A[r])\r\n \r\n \r\n while maxq[0] - minq[0] > 1:\r\n \r\n if minq[0] == A[l]:\r\n minq.popleft()\r\n if maxq[0] == A[l]:\r\n maxq.popleft()\r\n l += 1\r\n\r\n \r\n ans = max(ans, r - l + 1) \r\n \r\n return ans\r\n \r\n \r\nfor _ in range(test_case):\r\n n = ri()\r\n A = ra()\r\n print(solve())", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Approximating a Constant Range\"\r\n# Class: B\r\n\r\nimport sys\r\n\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 lower_bound(list_, s, e, x):\r\n l = s ; r = e ; ans = -1\r\n while l<=r:\r\n mid = (l + r)//2\r\n if list_[mid] >= x:\r\n ans = mid\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return ans\r\n\r\ndef Solve():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n l = 0 ; r = 1 ; ans = 0 ; s = [a[0]] ; lr = 0\r\n while r<n and l<n:\r\n if lr!=r:\r\n z = lower_bound(s, 0, len(s)-1, a[r])\r\n if z==-1: s.append(a[r])\r\n else: s.insert(z, a[r])\r\n m, M = s[0], s[-1]\r\n if M-m<=1:\r\n ans = max(ans, r-l+1)\r\n r+=1\r\n else:\r\n s.remove(a[l])\r\n l+=1\r\n lr = r\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for t in range(int(input())):\r\n Solve()", "def max_almost_constant_range(n, data):\n max_length = 0\n left = 0\n freq = {}\n \n for right in range(n):\n if data[right] not in freq:\n freq[data[right]] = 0\n freq[data[right]] += 1\n \n while max(freq.keys()) - min(freq.keys()) > 1:\n freq[data[left]] -= 1\n if freq[data[left]] == 0:\n del freq[data[left]]\n left += 1\n \n max_length = max(max_length, sum(freq.values()))\n \n return max_length\n\n# Read input\nn = int(input())\ndata = list(map(int, input().split()))\n\n# Calculate and print the result\nresult = max_almost_constant_range(n, data)\nprint(result)\n\n\t\t\t\t \t \t\t \t\t \t \t \t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nmn = min(a[0],a[1])\r\nmx = max(a[0],a[1])\r\np = 0\r\nP = 0\r\nif a[0] < a[1]:\r\n p = 1\r\n P = 2\r\nelif a[0] > a[1]:\r\n p = 2\r\n P = 1\r\nelse :\r\n p = 2\r\n P = 2\r\nh = 1\r\ns = 2\r\nfor c in range(2,n):\r\n if a[c] - mn > 1:\r\n h = p + 1\r\n p = P\r\n P = c + 1\r\n mn += 1\r\n mx += 1\r\n s = max(s,c-h+2)\r\n elif mx - a[c] > 1:\r\n h = P + 1\r\n P = p\r\n p = c + 1\r\n mx -= 1\r\n mn -= 1\r\n s = max(s,c-h+2)\r\n else :\r\n if mx == a[c]:\r\n P = c + 1\r\n if mn == a[c]:\r\n p = c + 1\r\n s = max(s,c-h+2)\r\n mx = max(mx,a[c])\r\n mn = min(mn,a[c])\r\nprint(s)\r\n", "class Node:\r\n def __init__(self, data = None, pos = None):\r\n self.data = data\r\n self.pos = pos\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nMax = [Node(0, 0) for i in range(10**5 + 1)]\r\nfrontMax, frontMin, rearMax, rearMin = 1, 1, 0, 0\r\nMin = [Node(0, 0) for i in range(10**5 + 1)]\r\nl = 0\r\nres = 0\r\nfor r in range(n):\r\n while frontMax <= rearMax and Max[rearMax].data <= a[r]:\r\n rearMax -= 1\r\n\r\n while frontMin <= rearMin and Min[rearMin].data >= a[r]:\r\n rearMin -= 1\r\n\r\n rearMax += 1\r\n Max[rearMax] = Node(a[r], r)\r\n\r\n rearMin += 1\r\n Min[rearMin] = Node(a[r], r)\r\n\r\n while l <= r and Max[frontMax].data - Min[frontMin].data > 1:\r\n l += 1\r\n if Max[frontMax].pos < l:\r\n frontMax += 1\r\n\r\n if Min[frontMin].pos < l:\r\n frontMin += 1\r\n\r\n res = max(res, r - l + 1)\r\n\r\nprint(res)\r\n\r\n", "def max_most_range(n,data):\n current_range_length = 0\n max_length_range = 0\n left = 0\n window = {}\n for right in range(n):\n window[data[right]] = window.get(data[right],0) + 1 \n current_range_length += 1 \n while max(window) - min(window) > 1:\n window[data[left]] -= 1 \n if window[data[left]] == 0:\n del window[data[left]]\n left += 1 \n current_range_length -= 1 \n max_length_range = max(max_length_range,current_range_length)\n \n return max_length_range \n \nn = int(input())\ndata = list(map(int,input().split()))\nprint(max_most_range(n,data))\n \n \t \t \t \t \t\t\t\t\t \t \t \t\t", "def mp():\r\n return map(int,input().split())\r\ndef lt():\r\n return list(map(int,input().split()))\r\ndef pt(x):\r\n print(x)\r\n\r\ndef ip():\r\n return int(input())\r\n\r\nn = ip()\r\nL = lt()\r\n\r\ni = 0\r\nT = [[]]*n\r\nR = [0]*n\r\nT[0] = [L[0]]\r\nR[0] = 1\r\nmaxx = 1\r\nindex1 = 0\r\nfor i in range(1,n):\r\n if L[i] in T[i-1]:\r\n T[i] = T[i-1]\r\n R[i] = R[i-1] + 1\r\n elif len(T[i-1]) == 1 and abs(T[i-1][0]-L[i]) == 1:\r\n T[i] = T[i-1] + [L[i]]\r\n R[i] = R[i-1] + 1\r\n else:\r\n T[i] = [L[i]] \r\n k = i-1\r\n while (len(T[i]) == 1 and abs(L[k]-L[i])<=1) or (len(T[i]) == 2 and L[k] in T[i]):\r\n if len(T[i]) == 1 and L[k] != L[i]:\r\n T[i].append(L[k])\r\n k -= 1\r\n R[i] = i - k\r\n maxx = max(maxx,R[i])\r\n\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 ", "#Ashish_Sagar\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nmin_index=0\r\nmax_index=0 \r\nans=1 \r\nmax_length=1\r\nj=1\r\nwhile(j<n):\r\n if 0<=l[j]-l[min_index] and l[j]-l[min_index]<=1:\r\n max_length+=1 \r\n if l[j]>=l[max_index]:\r\n max_index=j\r\n if l[j]<=l[min_index]:\r\n min_index=j\r\n j+=1 \r\n elif 0<=l[max_index]-l[j] and l[max_index]-l[j]<=1: \r\n max_length+=1 \r\n if l[j]>=l[max_index]:\r\n max_index=j\r\n if l[j]<=l[min_index]:\r\n min_index=j\r\n j+=1 \r\n \r\n elif l[j]-l[min_index]>1:\r\n max_length=0 \r\n if l[j]>=l[max_index]:\r\n max_index=j\r\n if l[j]<=l[min_index]:\r\n min_index=j\r\n j=min_index+1\r\n min_index=j\r\n else:\r\n max_length=0 \r\n if l[j]>=l[max_index]:\r\n max_index=j\r\n if l[j]<=l[min_index]:\r\n min_index=j\r\n j=max_index+1\r\n max_index=j\r\n ans=max(ans,max_length)\r\nprint(ans) \r\n ", "n = int(input())\na = list(map(int,input().split()))\nmaxx = 1\nold=0\nold_pos=0\nl=0\nfor i in range(1,n):\n new = a[i]-a[i-1]\n if new!=0:\n if new==old:\n l = old_pos+1\n old_pos = i-1\n old = new\n maxx = max(maxx,i-l+1)\nprint(maxx)", "n = int(input())\r\nA = list(map(int,input().split()))\r\n\r\n_max = A[0]\r\n_min = A[0]\r\n\r\ni = 0\r\nj = 0\r\nmarkMax = 0\r\nmarkMin = 0\r\n\r\nwhile j<n:\r\n if abs(A[j]-_min)<=1 and abs(A[j]-_max)<=1:\r\n if A[j]==_min:\r\n markMin = j\r\n if A[j]==_max:\r\n markMax = j\r\n j += 1\r\n if j==n:\r\n break\r\n _min = min(A[j],_min)\r\n _max = max(A[j],_max)\r\n else:\r\n break\r\n\r\n_max = max(A[i:j])\r\n_min = min(A[i:j])\r\n\r\nans = j - i\r\n\r\nwhile j<n and i<n:\r\n if abs(A[j]-_min)<=1 and abs(A[j]-_max)<=1:\r\n if A[j]==_min:\r\n markMin = j\r\n if A[j]==_max:\r\n markMax = j\r\n j += 1\r\n else:\r\n if abs(A[j]-_min)>1:\r\n _min = _max\r\n _max = A[j]\r\n i = markMin + 1\r\n markMin = markMax\r\n markMax = j\r\n else:\r\n _max = _min\r\n _min = A[j]\r\n i = markMax + 1\r\n markMax = markMin\r\n markMin = j\r\n ans = max(j-i,ans)\r\n\r\nprint(ans)", "\nif __name__ == \"__main__\":\n\n n = int(input())\n a = map(int, input().split())\n ans = 0\n cnt = 0\n now = 0\n pre = -1\n two = [-1, -1]\n for x in a:\n if x not in two:\n two = [pre, x]\n now = cnt + 1\n else:\n now += 1\n ans = max(ans, now)\n if x != pre:\n cnt = 1\n pre = x\n else:\n cnt += 1\n print(ans)\n\t\t \t\t\t\t \t \t \t \t \t\t \t \t\t \t", "from math import log\r\nimport sys\r\n\r\nN = 200010\r\nM = 18\r\nf1 = [[0] * M for _ in range(N)]\r\nf2 = [[0] * M for _ in range(N)]\r\nn = int(sys.stdin.readline().strip())\r\nw = [0] + list(map(int, sys.stdin.readline().split()))\r\n\r\nfor j in range(M):\r\n i = 1\r\n while i + (1 << j) - 1 <= n:\r\n if not j:\r\n f1[i][j] = w[i]\r\n else:\r\n f1[i][j] = max(f1[i][j - 1], f1[i + 2 ** (j - 1)][j - 1])\r\n i += 1\r\n\r\nfor j in range(M):\r\n i = 1\r\n while i + (1 << j) - 1 <= n:\r\n if not j:\r\n f2[i][j] = w[i]\r\n else:\r\n f2[i][j] = min(f2[i][j - 1], f2[i + 2 ** (j - 1)][j - 1])\r\n i += 1\r\n\r\n\r\ndef query_max(l: int, r: int) -> int:\r\n # global f1\r\n le = r - l + 1\r\n k = int(log(r - l + 1, base=2))\r\n return max(f1[l][k], f1[r - 2 ** k + 1][k])\r\n\r\n\r\ndef query_min(l: int, r: int) -> int:\r\n # global f2\r\n le = r - l + 1\r\n k = int(log(r - l + 1, base=2))\r\n return min(f2[l][k], f2[r - 2 ** k + 1][k])\r\n\r\n\r\ndef check(x: int) -> int:\r\n for i in range(1, n - x + 2):\r\n if query_max(i, i + x - 1) - query_min(i, i + x - 1) <= 1:\r\n return True\r\n return False\r\n\r\n\r\nl = 1\r\nr = n\r\nwhile l < r:\r\n mid = l + r + 1 >> 1\r\n if check(mid):\r\n l = mid\r\n else:\r\n r = mid - 1\r\nprint(l)\r\n", "import sys\nn = int(input())\na = list(map(int, sys.stdin.readline().split(\" \")))\nu = max = 1\namin = amax = a[0]\nimin = imax = 0\nfor i in range(1,n):\n\tif a[i] == a[i-1]:\n\t\tu += 1\n\telse:\n\t\tif amin <= a[i] <= amax:\n\t\t\tu += 1\n\t\t\tif a[i] == amin:\n\t\t\t\timin = i\n\t\t\telse:\n\t\t\t\timax = i\n\t\telif a[i] > amax:\n\t\t\tamin = amax\n\t\t\tamax = a[i]\n\t\t\tu = i - imax + 1\n\t\t\timin = imax\n\t\t\timax =i\n\t\telse:\n\t\t\tamax = amin\n\t\t\tamin = a[i]\n\t\t\tu = i - imin + 1\n\t\t\timax = imin\n\t\t\timin = i\n\tif u > max:\n\t\tmax = u\n\t\n\nprint(max)\n\n", "\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\ndef constRange(A):\r\n l,r=0,1\r\n \r\n d={}\r\n d[A[l]]=l\r\n d[A[r]]=r\r\n mx=max(A[l],A[r])\r\n mi=min(A[l],A[r])\r\n ans=0\r\n while r<len(A):\r\n while mx-mi<=1:\r\n r+=1\r\n if r>=len(A):break\r\n d[A[r]]=r\r\n if A[r]>=mx:\r\n mx=A[r]\r\n \r\n if A[r]<=mi:\r\n mi=A[r]\r\n \r\n ans=max(ans,r-l)\r\n if r>=len(A):break\r\n if A[r]>mi:\r\n l=d[mi]+1\r\n mi+=1\r\n else:\r\n l=d[mx]+1\r\n mx-=1\r\n return ans\r\n\r\nprint(constRange(A))", "def main():\r\n n = int(input())\r\n ar = list(map(int, input().split()))\r\n lookup = {}\r\n ans = 0\r\n for i in range(n):\r\n start = 0\r\n if ar[i] - 2 in lookup:\r\n start = max(start, lookup[ar[i] - 2] + 1)\r\n if ar[i] + 2 in lookup:\r\n start = max(start, lookup[ar[i] + 2] + 1)\r\n if ar[i] - 1 in lookup and ar[i] + 1 in lookup:\r\n if lookup[ar[i] - 1] < lookup[ar[i] + 1]:\r\n start = max(start, lookup[ar[i] - 1] + 1)\r\n else:\r\n start = max(start, lookup[ar[i] + 1] + 1)\r\n ans = max(ans, i - start + 1)\r\n lookup[ar[i]] = i\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nk,l = a[0],a[1]\r\nif k==l:\r\n base = k\r\n case = 0\r\nelse:\r\n case =1\r\n base = max(k,l)\r\n mn = min(k,l)\r\n lmn = 0 if k==mn else 1\r\n lmx = 0 if lmn else 1\r\nl = 2\r\nbest =2\r\nfor i in range(2,n):\r\n best = max(best,l)\r\n if case == 1:\r\n if a[i]>base:\r\n l = i-lmn\r\n mn = base\r\n base = a[i]\r\n lmn = i-1\r\n lmx = i\r\n elif a[i]==base:\r\n l+=1\r\n lmx = i\r\n elif a[i]==mn:\r\n l+=1\r\n lmn = i\r\n else:\r\n base = mn\r\n mn = a[i]\r\n l = i-lmx\r\n lmx = i-1\r\n lmn = i\r\n else:\r\n l+=1\r\n if a[i]!=base:\r\n case =1\r\n mn = min(a[i],base)\r\n base = max(a[i], base)\r\n lmn = i if a[i]==mn else i-1\r\n lmx = i if a[i]==base else i-1\r\n\r\nprint(max(best,l))", "def solve():\r\n n = int(input().strip())\r\n a = list(map(int, input().split()))\r\n\r\n p1 = 0\r\n p2 = 0\r\n\r\n values = {}\r\n values[a[0]] = 1\r\n\r\n answer = 0\r\n while p1 < n - 1 and p2 < n:\r\n min_v = min(values.keys())\r\n max_v = max(values.keys())\r\n\r\n # print(min_v, max_v)\r\n\r\n if abs(min_v - max_v) <= 1:\r\n answer = max(answer, 1 + p2 - p1)\r\n p2 += 1\r\n\r\n if p2 < n:\r\n if a[p2] in values:\r\n values[a[p2]] += 1\r\n else:\r\n values[a[p2]] = 1\r\n else:\r\n values[a[p1]] -= 1\r\n if values[a[p1]] == 0:\r\n del values[a[p1]]\r\n\r\n p1 += 1\r\n\r\n # print(values)\r\n\r\n print(answer)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "n = int(input())\na = list(map(int, input().split()))\n\nl = r = 0\niMin = iMax = 0\nminV = maxV = a[0]\nlenMax = 1\n\nwhile l < n:\n while a[iMax] - a[iMin] <= 1:\n r += 1\n if r == n:\n break\n if a[r] >= a[iMax]:\n iMax = r\n if a[r] <= a[iMin]:\n iMin = r\n \n lenMax = max(lenMax, r - l)\n if r == n:\n break\n # Update l\n if a[r] == a[iMax]:\n iMin += 1\n l = iMin\n \n if a[r] == a[iMin]:\n iMax += 1\n l = iMax\n\nprint(lenMax)\n", "def main():\n input()\n l = list(map(int, input().split()))\n start = delta = j = 0\n res, a = [], l[0]\n for i, b in enumerate(l):\n a, ab = b, b - a\n if ab:\n if delta == ab:\n start = j\n j, delta = i, ab\n res.append(i - start)\n print(max(res) + 1)\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin,stdout\r\nfrom math import gcd\r\nfrom collections import deque\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,arr = ii1(),iia()\r\nres = p = 0\r\nbig = sml = arr[0]\r\nfor i in range(1, n):\r\n sml = min(arr[i], sml)\r\n big = max(arr[i], big)\r\n if big - sml > 1:\r\n res = max(res, i - p)\r\n sml = big = arr[i]\r\n for j in range(i)[::-1]:\r\n if max(big,arr[j]) - min(sml,arr[j]) > 1:\r\n p = j+1\r\n break\r\n sml = min(arr[j], sml)\r\n big = max(arr[j], big)\r\nres = max(res,i-p+1)\r\nprint(res)\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n ", "n = int(input())\r\nlst = list(map(int, input().split()))\r\na, b = 0, 0\r\nt=[0]*n\r\nk=100005\r\nans = 0\r\nfor i in range(1,n):\r\n t[i]=lst[i]-lst[i-1]\r\nwhile b<n:\r\n if abs(t[b])>1:\r\n ans=max(ans,b-a)\r\n a=b\r\n elif abs(t[b])==1:\r\n if k==100005:\r\n k=b\r\n elif t[k]!=t[b]:\r\n k=b\r\n else:\r\n ans=max(ans,b-a)\r\n a=k\r\n k=b\r\n b+=1\r\n if b==n:\r\n ans=max(ans,b-a)\r\n\r\n\r\n#ans=max(ans,b-a)\r\nprint(ans)\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(A):\r\n #print('A: %s' % (str(A)))\r\n n = len(A)\r\n max_val = 0\r\n d = dict()\r\n j = 0\r\n for i in range(n):\r\n while j < n:\r\n if A[j] not in d:\r\n d[A[j]] = 0\r\n d[A[j]] += 1\r\n B = list(d.keys())\r\n if max(B) - min(B) <= 1:\r\n j += 1\r\n else:\r\n d[A[j]] -= 1\r\n if d[A[j]] == 0:\r\n del d[A[j]]\r\n break\r\n val = j - i\r\n max_val = max(max_val, val)\r\n #print('i: %d, j: %d, d: %s' % (i, j, str(d)))\r\n d[A[i]] -= 1\r\n if d[A[i]] == 0:\r\n del d[A[i]]\r\n return max_val\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n ans = solve(A)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def max_almost_constant_range(n, data_points):\n max_length = 0\n left = 0\n count = {}\n \n for right in range(n):\n if data_points[right] not in count:\n count[data_points[right]] = 0\n count[data_points[right]] += 1\n \n while max(count) - min(count) > 1:\n count[data_points[left]] -= 1\n if count[data_points[left]] == 0:\n del count[data_points[left]]\n left += 1\n \n max_length = max(max_length, sum(count.values()))\n \n return max_length\n\n# Read input\nn = int(input())\ndata_points = list(map(int, input().split()))\n\n# Calculate and print the result\nresult = max_almost_constant_range(n, data_points)\nprint(result)\n\n\t \t \t \t \t \t \t\t\t\t\t \t \t\t \t", "n=int(input())\r\nlst=[*map(int,input().split())]\r\na,i,j,res,last,item=lst[0],0,1,2,777,0\r\nwhile j<n:\r\n b=lst[j]\r\n x=b-a\r\n if x!=0:\r\n if last==777:last=x\r\n else:\r\n if last!=x:\r\n res=max(res,j-i)\r\n a,i,j,last=lst[item],item,j,777\r\n continue\r\n if b!=lst[j-1]:item=j\r\n j+=1\r\nres=max(res,j-i)\r\nprint(res)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nbefore_value = 0 # 5\r\nafter_value = 0 # 4\r\nl = 0\r\nr = 0\r\nlongest = 0\r\nwhile r < n:\r\n\tif abs(arr[r] - arr[before_value]) <= 1:\r\n\t\tif arr[r] != arr[after_value]:\r\n\t\t\tbefore_value = after_value\r\n\t\t\tafter_value = r\r\n\t\t#print('<= left ' + str(l) + ' right ' +str(r) + ' before_value= '+str(before_value) + ' after_value= '+str(after_value))\r\n\telse:\r\n\t\tlongest = max(longest, r - l)\r\n\t\tbefore_value = after_value\r\n\t\tafter_value = r\r\n\t\tl = before_value\r\n\t\t#print('> left ' + str(l) + ' right ' +str(r) + ' before_value= '+str(before_value) + ' after_value= '+str(after_value))\r\n\tr += 1\r\n\tif r == n:\r\n\t\tlongest = max(longest, r - l)\r\nprint(longest)\r\n\t\t\r\n\t\r\n\t\r\n\r\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input().strip()\r\n return(list(s[:len(s)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\nn=inp()\r\nl=inlt()\r\nn=len(l)\r\ndp=[0 for i in range(n)]\r\nfor i in range(1,n):\r\n dp[i]=l[i]-l[i-1]\r\n\r\ncntr=0\r\nln=0\r\ntempl=0\r\nlst=0\r\ncntr=0\r\nfor i in range(n):\r\n if dp[i]:\r\n if lst==dp[i]:\r\n ln=max(ln,templ)\r\n templ=i-cntr+1\r\n lst=dp[i]\r\n else:\r\n templ+=1\r\n else:\r\n templ+=1\r\n if dp[i]:\r\n lst=dp[i]\r\n cntr=i\r\nprint(max(ln,templ))", "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=nmbr()\r\n a=lst()\r\n dp=[[0 for _ in range(2)]for _ in range(n)]\r\n ans=1\r\n dp[0][0]=dp[0][1]=1\r\n for i in range(1,n):\r\n if a[i]==a[i-1]:\r\n dp[i][0]=1+dp[i-1][0]\r\n dp[i][1]=1+dp[i-1][1]\r\n elif a[i]==a[i-1]+1:\r\n dp[i][0]=dp[i-1][1]+1\r\n dp[i][1]=1\r\n else:\r\n dp[i][0]=1\r\n dp[i][1]=1+dp[i-1][0]\r\n ans=max(ans,dp[i][0],dp[i][1])\r\n print(ans)", "def main():\n n = int(input())\n a = [int(t) for t in input().split()]\n\n lowest_length = 1\n highest_length = 1\n max_length = 1\n previous_digit = a[0]\n\n for current_digit in a[1:]:\n\n if previous_digit == current_digit:\n lowest_length += 1\n highest_length += 1\n elif previous_digit == current_digit - 1:\n lowest_length = highest_length + 1\n highest_length = 1\n elif previous_digit == current_digit + 1:\n highest_length = lowest_length + 1\n lowest_length = 1\n\n previous_digit = current_digit\n\n max_length = max(max_length, lowest_length)\n max_length = max(max_length, highest_length)\n\n print(max_length)\n\n\nif __name__ == '__main__':\n main()\n", "from collections import Counter\n\nn = int(input())\narr = list(map(int, input().split()))\n\nmx = 0\nmn = float('inf')\nj = 0\nans = 0\ndiff = 0\ncounter = Counter()\n\nfor i in range(n):\n counter[arr[i]] += 1\n mx = max(counter)\n mn = min(counter)\n diff = mx - mn\n \n while diff > 1:\n counter[arr[j]] -= 1\n if counter[arr[j]] == 0:\n del counter[arr[j]]\n mx = max(counter)\n mn = min(counter)\n diff = mx - mn\n j += 1\n \n ans = max(i - j, ans)\n\nprint(ans + 1)\n\n\t\t\t\t \t \t \t\t \t\t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\nidx = dict()\r\nlength, l, idx[a[0]] = 1, 0, 0\r\n\r\nfor i in range(1, n):\r\n l = max(l, idx.get(a[i] + 2, -1) + 1, idx.get(a[i] - 2, -1) + 1)\r\n length = max(length, i - l + 1)\r\n idx[a[i]] = i\r\n\r\nprint(length)\r\n", "N =int(input())\r\nA = [int (x) for x in input().split()]\r\n\r\nmax = A[0]\r\nmin =A[0]\r\nfirst = 0\r\ncurrent = 0\r\nmax_L = 1\r\ndic ={}\r\nwhile current <len(A):\r\n if A[current] not in dic:\r\n dic[A[current]]=0\r\n if len(dic)>=3:\r\n max_L = max_L if current - first < max_L else current - first\r\n if A[current]+2 in dic:\r\n del dic[A[current]+2]\r\n elif A[current]-2 in dic:\r\n del dic[A[current]-2]\r\n\r\n first = current\r\n while abs(A[first] - A[current]) <= 1:\r\n first -= 1\r\n first += 1\r\n current+=1\r\n if current == len(A):\r\n max_L = max_L if current - first < max_L else current - first\r\n\r\n\r\nprint(max_L)", "n = int(input())\r\na = list(map(int , input().split()))\r\na.append(999999)\r\n\r\nmaxi = a[0]\r\nmini = a[0]\r\nfr = 0\r\nsc = 0\r\nans = 1\r\n\r\nfor i in range(0,n+1):\r\n sc = i\r\n mini = min(a[i] , mini)\r\n maxi = max(maxi , a[i])\r\n\r\n if abs(maxi - mini) > 1:\r\n ans = max(ans , sc - fr)\r\n\r\n mini = 999999\r\n maxi = -999999\r\n\r\n for j in range(sc,-1,-1):\r\n if abs(a[j] - a[i]) > 1:\r\n break\r\n\r\n fr = j\r\n mini = min(mini , a[j])\r\n maxi = max(maxi , a[j])\r\n\r\n\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nfor i in a:\r\n l1.append(i)\r\n l2.append(i)\r\nfor i in range(n):\r\n if a[i]%2==0:\r\n l1[i]+=1\r\n else:\r\n l2[i]+=1\r\nc=1\r\nm=-1\r\nfor i in range(1,n):\r\n if l1[i-1]==l1[i]:\r\n c+=1\r\n else:\r\n m=max(c,m)\r\n c=1\r\nm=max(c,m)\r\nc=1\r\nfor i in range(1,n):\r\n if l2[i-1]==l2[i]:\r\n c+=1\r\n else:\r\n m=max(c,m)\r\n c=1\r\nm=max(c,m)\r\nprint(m)", "n = int(input())\r\nlis = list(map(int,input().split()))\r\np=j=k=ans=0\r\nfor i in range(1,n):\r\n if lis[i]-lis[i-1]!=0:\r\n if lis[i]-lis[i-1]==k:\r\n j=p+1 \r\n k=lis[i]-lis[i-1]\r\n p=i-1\r\n ans = max(ans,i-j+1)\r\nprint(ans) \r\n\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = 0\r\nr = 0\r\nres = 0\r\ncnt = [0] * (10 ** 5 + 1)\r\nk = 0\r\nwhile r < n:\r\n cnt[a[r]] += 1\r\n if cnt[a[r]] == 1:\r\n k += 1\r\n while k > 2:\r\n cnt[a[l]] -= 1\r\n if cnt[a[l]] == 0:\r\n k -= 1\r\n l += 1\r\n res = max(res, r - l + 1)\r\n r += 1\r\nprint(res)", "\r\n\r\n\r\nx=int(input())\r\nnums=list(map(int,input().split()))\r\ng={}\r\n# for i in nums:\r\n# g[i]=0\r\nj=0\r\nmini=float(\"inf\")\r\nmaxi=-float(\"inf\")\r\nans=0\r\n#print(g)\r\nfor i in range(x):\r\n if nums[i] not in g:\r\n g[nums[i]]=1\r\n else:\r\n g[nums[i]]=g[nums[i]]+1\r\n # g[nums[i]]=g[nums[i]]+1\r\n for _ in g:\r\n maxi=max(maxi,_)\r\n mini=min(mini,_)\r\n # print(g,maxi,mini)\r\n while j<x and maxi-mini>1:\r\n # print(nums[i],maxi,mini,\" #\",g)\r\n g[nums[j]]=g[nums[j]]-1\r\n if g[nums[j]]==0:\r\n g.pop(nums[j])\r\n mini=float(\"inf\")\r\n maxi=-float(\"inf\")\r\n for _ in g:\r\n maxi=max(maxi,_)\r\n mini=min(mini,_)\r\n # print(\"dsss\",g,maxi,mini)\r\n j=j+1\r\n ans=max(ans,i-j+1)\r\nprint(ans)", "n = int(input())\na = [int(x) for x in input().split()]\n\nl = r = 0\nd = None\n\nmx = 1\n\nwhile r < n - 1:\n r += 1\n \n if a[r] != a[r - 1]:\n if abs(a[r] - a[r - 1]) <= 1:\n if d is not None and a[d] != a[r]:\n l = d + 1\n d = r - 1\n else:\n l = r\n d = None\n \n mx = max(mx, r - l + 1)\n\nprint(mx)\n", "def solve():\r\n n = int(input())\r\n *nums, = map(int, input().split())\r\n l = 0\r\n r = 1\r\n from collections import defaultdict \r\n hm = defaultdict(lambda:-1)\r\n mn = mx = nums[l]\r\n hm[nums[l]] = l\r\n res = 1\r\n while r < n:\r\n if nums[r] == mn or nums[r] == mx:\r\n hm[nums[r]] = r\r\n elif nums[r] == mn + 1:\r\n hm[nums[r]] = r\r\n mx = nums[r]\r\n elif nums[r] == mx - 1:\r\n hm[nums[r]] = r\r\n mn = nums[r]\r\n elif nums[r] > mx + 1 or nums[r] < mn - 1:\r\n l = r\r\n mn = mx = nums[r]\r\n hm[nums[r]] = r\r\n elif nums[r] == mx + 1:\r\n l = hm[mn] + 1\r\n mn = mx\r\n mx = nums[r]\r\n hm[nums[r]] = r\r\n elif nums[r] == mn - 1:\r\n l = hm[mx] + 1\r\n mx = mn\r\n mn = nums[r]\r\n hm[nums[r]] = r\r\n res = max(res, r - l + 1)\r\n r += 1\r\n return res\r\nprint(solve())", "n = int(input())\nvalues = list(map(int, input().split()))\n\nstart = -1\nres = 0\nmx, mn = 0, float('inf')\n\nfor i, val in enumerate(values):\n mx = max(val, mx)\n mn = min(mn, val)\n \n if mx - mn > 1:\n start = i - 1\n if val == mx:\n target = mn\n mn = float('inf')\n while start >= 0 and values[start] != target:\n mn = min(mn, values[start])\n start -= 1\n else:\n target = mx\n mx = 0\n while start >= 0 and values[start] != target:\n mx = max(mx, values[start])\n start -= 1\n \n res = max(res, (i - start))\n\nprint(res)\n", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\n\r\n\r\n\r\nfreq = [0]*(10**5 + 5)\r\n\r\ndiff = 0 \r\nj = 0\r\nlongest_range = 0\r\n\r\nfor i in range(n):\r\n if freq[a[i]] == 0:\r\n diff += 1\r\n freq[a[i]] += 1\r\n\r\n\r\n while j < n and diff > 2:\r\n if freq[a[j]] == 1:\r\n diff -= 1\r\n freq[a[j]] -= 1\r\n j+=1\r\n\r\n longest_range = max(longest_range, i - j + 1)\r\n\r\nprint (longest_range)\r\n", "tmp = [0] * (10 ** 5 + 1)\r\n\r\nn = int(input())\r\nans = 0\r\nlast = 0\r\nfor v in map(int, input().split()):\r\n tmp[v-1] += 1\r\n tmp[v] += 1\r\n ans = max(ans, tmp[v-1], tmp[v])\r\n for x in range(last-1, last+1):\r\n if x != v-1 and x != v:\r\n tmp[x] = 0\r\n last = v\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmi=min(a[:2])\r\nma =max(a[:2])\r\ntemp=2\r\nans=2\r\ni=2\r\nwhile i<n:\r\n if abs(a[i]-mi)<=1 and abs(a[i]-ma)<=1:\r\n temp+=1\r\n if a[i]<mi:\r\n mi=a[i]\r\n elif a[i]>ma:\r\n ma=a[i]\r\n else:\r\n if temp>ans:\r\n ans=temp\r\n j = i - 1\r\n while abs(a[i] - a[j]) <= 1:\r\n j -= 1\r\n temp = i - j\r\n if temp == 1:\r\n mi, ma = a[i], a[i]\r\n else:\r\n if a[i] < mi:\r\n mi, ma = a[i], mi\r\n else:\r\n mi, ma = ma, a[i]\r\n i += 1\r\nif temp > ans:\r\n ans =temp\r\nprint(ans)", "n = int(input())\r\nmas = [int(s) for s in input().split()]\r\n\r\nmin_val = max_val = mas[0]\r\n\r\nmax_index = 0\r\nmin_index = 0\r\nans = 1\r\nl = 0\r\nr = 0\r\nprev = mas[0]\r\n\r\nfor i in range(1, n):\r\n if abs(mas[i] - min_val) > 1:\r\n min_val = max_val\r\n max_val = mas[i]\r\n l = max_index\r\n r = i\r\n max_index = i\r\n new = True\r\n elif abs(mas[i] - max_val) > 1:\r\n max_val = min_val\r\n min_val = mas[i]\r\n l = min_index\r\n r = i\r\n new = True\r\n else:\r\n new = False\r\n\r\n if mas[i] > prev:\r\n max_val = mas[i]\r\n max_index = i\r\n if mas[i] < prev:\r\n min_val = mas[i]\r\n min_index = i\r\n\r\n prev = mas[i]\r\n\r\n if not new:\r\n r += 1\r\n\r\n ans = max(ans, r - l + 1)\r\n\r\nans = max(ans, r - l + 1)\r\n\r\nprint(ans)\r\n", "#####################\n#1: Array, \n#R -> ++Count[]\n#L -> --Count[]\n# line1 = input().split(\" \")\n# arr = list(map(int,input().split()))\n# n = int(line1[0])\n# k = int(line1[1])\n# counts = {}\n# l = 0\n# r = 0\n# count = 0\n# for i in range(len(arr)):\n# if arr[i] in counts:\n# counts[arr[i]] += 1\n# else:\n# count += 1\n# counts[arr[i]] = 1\n# if count >= k:\n# r = i\n# break\n# for i in range(len(arr)):\n# l = i\n# counts[arr[i]] -= 1\n# if counts[arr[i]] == 0:\n# l = i\n# break\n# if count < k:\n# print(\"-1 -1\")\n# else:\n# print(l + 1, r + 1)\n\n#2: George and Round\n# n, m = map(int, input().split())\n# arrA = list(map(int, input().split()))\n# arrB = list(map(int, input().split()))\n# k = n\n# pA = 0\n# pB = 0\n# while pB < m:\n# if arrB[pB] >= arrA[pA]:\n# k -= 1\n# pA += 1\n# if pA >= n:\n# break\n# pB += 1\n# print(k)\n\n#3\n# n, t = map(int, input().split())\n# a = list(map(int, input().split()))\n# l = 0\n# r = 0\n# maxx = 0\n# summ = 0\n# while r <= n:\n# if r == n:\n# maxx = max(maxx, (r - 1) - l + 1)\n# break\n# if summ + a[r] > t:\n# maxx = max(maxx, (r - 1) - l + 1)\n# summ -= a[l]\n# l += 1\n# else:\n# summ += a[r]\n# r += 1\n# print(maxx)\n\n#6: \n#each segment must have 2 distinct number\n#val 1, val 2 without map or dictionary\nn = int(input())\na = list(map(int, input().split()))\nfre = [0] * (10 ** 5 + 5)\ndiff = 0\nj = 0\nlongest_range = 0\nfor i in range(n):\n if fre[a[i]] == 0:\n diff += 1\n fre[a[i]] += 1\n \n while j < n and diff > 2:\n if fre[a[j]] == 1:\n diff -= 1\n fre[a[j]] -= 1\n j += 1\n \n longest_range = max(longest_range, i - j + 1)\n \nprint(longest_range)\n\n#7: https://codeforces.com/contest/892/problem/B\n# n = int(input())\n# a = list(map(int, input()))\n\n\n#8: https://codeforces.com/problemset/problem/6/C\n# n = int(input())\n# a = list(map(int, input().split()))\n# l = 0\n# r = n - 1\n# alice = 0\n# bob = 0\n# tA = 0\n# tB = 0\n# #<=0: alice turn, >0 bob turn (<= 0 cuz bob is a boy :v)\n# while l <= r:\n# if tA - tB <= 0:\n# alice += 1\n# tA += a[l]\n# l += 1\n# else:\n# bob += 1\n# tB += a[r]\n# r -= 1\n# print(alice, bob)", "R = lambda: map(int, input().split())\r\nn = int(input())\r\narr = list(R())\r\nj = -1\r\ncnts = {}\r\nres = 0\r\nfor i in range(n):\r\n cnts[arr[i]] = cnts.get(arr[i], 0) + 1\r\n while len(cnts) > 2:\r\n cnts[arr[j + 1]] -= 1\r\n if not cnts[arr[j + 1]]:\r\n cnts.pop(arr[j + 1])\r\n j += 1\r\n res = max(res, i - j)\r\nprint(res)", "n = int(input())\r\na = list(map(int, input().split()))\r\npos = {}\r\nmin_a = a[0]\r\nmax_a = a[0]\r\npos[a[0]] = 0\r\nlength = 1\r\nmax_len = 1\r\nfor i in range(1, n):\r\n cur = a[i]\r\n if cur != a[i-1]:\r\n pos[a[i]] = i\r\n if cur > max_a:\r\n min_a = max_a\r\n max_a = cur\r\n length = i - pos[a[i-1]] + 1\r\n elif cur < min_a:\r\n max_a = min_a\r\n min_a = cur\r\n length = i - pos[a[i-1]] + 1\r\n else:\r\n length += 1\r\n if length > max_len:\r\n max_len = length\r\nprint(max_len)", "n=int(input())\na=list(map(int,input().split()))\n\nfor i in range(0,n-1,1):\n\ta[i]=a[i+1]-a[i]\n\nans=last=k=l=0\nfor i in range(0,n-1,1):\n\tif(a[i]==0):\n\t\tcontinue\n\tif(a[i]==last):\n\t\tans=max(ans,i-k+1)\n\t\tk=l+1\n\tl=i\n\tlast=a[i]\n\nans=max(ans,n-k)\nprint(ans)\n\t \t \t \t \t\t \t\t\t\t \t\t\t\t\t \t\t\t", "from collections import defaultdict\n\nn = int(input())\ndata = list(map(int, input().split()))\n\nleft = 0\nmax_length = 0\nfrequency = defaultdict(int)\n\nfor right in range(n):\n frequency[data[right]] += 1\n\n while max(frequency) - min(frequency) > 1:\n frequency[data[left]] -= 1\n if frequency[data[left]] == 0:\n del frequency[data[left]]\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\nprint(max_length)\n\n \t\t \t \t \t \t \t \t \t \t\t\t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\ndiff = 0\r\ndict_count = {}\r\nj = 0\r\n\r\nset_a = set(a)\r\nfor ele in set_a:\r\n dict_count[ele] = 0\r\n\r\nfor i in range(0, n):\r\n\r\n if dict_count[a[i]] == 0:\r\n diff += 1\r\n\r\n dict_count[a[i]] += 1\r\n\r\n while diff > 2 and j < n:\r\n if dict_count[a[j]] == 1:\r\n diff -= 1\r\n dict_count[a[j]] -= 1\r\n j += 1\r\n\r\n count = max(count, i - j + 1)\r\n\r\nprint(count)\r\n", "def longest_almost_constant_range(n, data):\n max_length = 0\n left = 0\n freq = {}\n \n for right in range(n):\n if data[right] not in freq:\n freq[data[right]] = 0\n freq[data[right]] += 1\n \n while max(freq) - min(freq) > 1:\n freq[data[left]] -= 1\n if freq[data[left]] == 0:\n del freq[data[left]]\n left += 1\n \n max_length = max(max_length, right - left + 1)\n\n return max_length\n\ndef main():\n n = int(input())\n data = list(map(int, input().split()))\n\n result = longest_almost_constant_range(n, data)\n print(result)\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\t", "n = int(input())\r\nl = [0]*100003\r\nm = -1\r\ns = input().split()\r\nfor i in range(1, n + 1):\r\n k = int(s[i - 1])\r\n if(l[k - 1] > l[k + 1]):\r\n m = max(m, i - max(l[k + 1], l[k - 2]))\r\n else: \r\n m = max(m, i - max(l[k + 2], l[k - 1]))\r\n l[k] = i;\r\nprint(m)", "\r\ninput()\r\nnums = list(map(int,input().split()))\r\nj=0\r\nans= 0 \r\nmax_value = nums[0]\r\nmin_value = nums[0]\r\nmax_count=0\r\nmin_count=0\r\nfor i in range(len(nums)):\r\n while j<len(nums) and abs(max(max_value,nums[j])-min(min_value,nums[j]))<=1:\r\n if nums[j]==max_value:\r\n max_count=max_count+1\r\n if nums[j]==min_value:\r\n min_count=min_count+1\r\n if nums[j]>max_value:\r\n max_value=nums[j]\r\n max_count=1\r\n if nums[j]<min_value:\r\n min_value=nums[j]\r\n min_count=1\r\n max_value=max(max_value,nums[j])\r\n min_value=min(min_value,nums[j])\r\n j=j+1\r\n ans=max(ans,j-i)\r\n if nums[i]==max_value:\r\n max_count=max_count-1\r\n # print(\"going in max\",max_count)\r\n if max_count==0:\r\n max_value=min_value\r\n max_count=min_count\r\n if nums[i]==min_value:\r\n min_count=min_count-1\r\n # print(\"going in min\",min_count)\r\n if min_count==0:\r\n min_count=max_count\r\n min_value=max_value\r\n # print(i,j,ans,min_value,max_value,min_count,max_count)\r\nprint(ans)", "n = int(input())\r\nm = list(map(int, input().split()))\r\n\r\nd = {i: -1 for i in set(m)}\r\nmx = 0\r\nlm = 0\r\nfor i in range(n):\r\n c = m[i]\r\n if d[c] == -1:\r\n d[c] = i\r\n if c - 2 in d and d[c-2] != -1:\r\n lm = i - d[c-2]\r\n d[c-2] = -1\r\n elif c + 2 in d and d[c + 2] != -1:\r\n lm = i - d[c + 2]\r\n d[c + 2] = -1\r\n else:\r\n lm += 1\r\n d[c] = i \r\n mx = max(mx, lm)\r\nprint(mx)\r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nd1 = [0] * n\r\nd2 = [0] * n\r\nd1[0] = d2[0] = 1\r\nfor i in range(1, n):\r\n if a[i] < a[i - 1]:\r\n d1[i] = 1\r\n d2[i] = d1[i - 1] + 1\r\n elif a[i] > a[i - 1]:\r\n d1[i] = d2[i - 1] + 1\r\n d2[i] = 1\r\n else:\r\n d1[i] = d1[i - 1] + 1\r\n d2[i] = d2[i - 1] + 1\r\nprint(max(max(d1), max(d2)))\r\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nl = 0\r\nr = 1\r\ndiff = 0\r\nm_l = 1\r\nlast_diff = 0\r\nwhile r < n:\r\n\t#print(l, r, mmin, mmax)\r\n\tif lst[r] - lst[r - 1] != 0:\r\n\t\tif lst[r] - lst[r - 1] == diff:\r\n\t\t\tl = last_diff + 1\r\n\t\tdiff = lst[r] - lst[r - 1]\r\n\t\tlast_diff = r - 1\r\n\tm_l = max(m_l, r - l + 1)\r\n\tr += 1\r\nprint(m_l)", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nstart = 0\r\nend = 0\r\nmin = 0\r\nmaxi = 0\r\nmaxilen = 1\r\n\r\nfor i in range(n):\r\n if abs(A[i] - A[min]) < 2 and abs(A[i] - A[maxi]) < 2:\r\n end = i\r\n if A[i] <= A[min]:\r\n min = i\r\n if A[i] >= A[maxi]:\r\n maxi = i\r\n elif abs(A[i] - A[min]) > 1:\r\n start = min+1\r\n end = i\r\n min = maxi\r\n maxi = i\r\n else:\r\n start = maxi + 1\r\n end = i\r\n maxi = min\r\n min = i\r\n maxilen = max(maxilen, end-start+1)\r\n\r\nprint(maxilen)", "n = int(input())\na = list(map(int, input().split()))\nc = [0]*(max(a)+2)\ni, kq, k = 0, 0, 0\nfor j in range(n):\n c[a[j]] += 1\n if c[a[j]] == 1:\n k += 1\n while k > 2:\n c[a[i]] -= 1\n if c[a[i]] == 0:\n k -= 1\n i += 1\n if k <= 2:\n kq = max(kq, j-i+1)\nprint(kq)\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\na.insert(0,0)\r\nminn=[]\r\nmaxx=[]\r\nres=0\r\n\r\ni=1\r\nj=1\r\nwhile i<=j and j<=n:\r\n while len(minn)>0 and minn[0]<i:\r\n minn.pop(0)\r\n while len(maxx)>0 and maxx[0]<i:\r\n maxx.pop(0)\r\n while len(minn)>0 and a[j]<a[minn[len(minn)-1]]:\r\n minn.pop(len(minn)-1)\r\n while len(maxx)>0 and a[j]>a[maxx[len(maxx)-1]]:\r\n maxx.pop(len(maxx)-1)\r\n if len(minn)==0 or minn[len(minn)-1]<j:\r\n minn.append(j)\r\n if len(maxx)==0 or maxx[len(maxx)-1]<j:\r\n maxx.append(j)\r\n if a[maxx[0]]-a[minn[0]]<=1:\r\n res=max(res,j-i+1)\r\n j+=1\r\n else:\r\n i+=1\r\nprint(res)\r\n\r\n", "#Approximating a Constant Range\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = [0] * (10**5 + 1)\r\nj = 0\r\ndiff = 0\r\nmax = -1\r\nfor i in range(n):\r\n if count[a[i]] == 0:\r\n diff += 1\r\n count[a[i]] += 1\r\n\r\n while j < n and diff > 2:\r\n if count[a[j]] == 1:\r\n diff -= 1\r\n count[a[j]] -= 1\r\n j += 1\r\n\r\n if i - j + 1 > max:\r\n max = i - j + 1\r\n\r\nprint(max)", "def approximating_a_constant_range(n, a):\r\n l = 0\r\n r = 0\r\n\r\n max_range = r - l + 1\r\n distinct_number = set()\r\n distinct_number.add(a[l])\r\n\r\n while (l < n and r < n - 1):\r\n r += 1\r\n distinct_number.add(a[r])\r\n if (len(distinct_number) <= 2):\r\n max_range = max(max_range, r - l + 1)\r\n else:\r\n k = r - 2\r\n while (k < r and k >= l):\r\n if (a[k] != a[r - 1]):\r\n l = k + 1\r\n distinct_number.remove(a[k])\r\n break\r\n else:\r\n k = k - 1\r\n\r\n print(max_range)\r\n\r\n# Input\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n# Run and get output\r\napproximating_a_constant_range(n, a)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\n\r\na, b, c = 0, 0, 0\r\nans = 1\r\n\r\nfor i in range(1, n):\r\n if w[i] != w[i-1]:\r\n if w[i] - w[i-1] == a:\r\n c = b\r\n\r\n a = w[i] - w[i-1]\r\n b = i\r\n ans = max(ans, i - c + 1)\r\n\r\nprint(ans)", "\n\n\n\n\nif __name__ == '__main__':\n\tn = int(input())\n\tarr = list(map(int, input().split()))\n\t\n\ti, j = 0, 0\n\tm, M = arr[0], arr[0]\n\tm_idx, M_idx = 0, 0\n\tmax_so_far = 0\t\n\twhile j < n - 1:\n\t\tj += 1\n\t\tif arr[j] > M:\n\t\t\tM = arr[j]\n\t\t\tM_idx = j\n\t\telif arr[j] < m:\n\t\t\tm = arr[j]\n\t\t\tm_idx = j\n\n\t\tif M - m > 1:\n\t\t\t\n\t\t\tk = j\n\t\t\twhile k >= i:\n\t\t\t\tk -= 1\n\t\t\t\tif k < 0:\n\t\t\t\t\tbreak\n\t\t\t\tif arr[k] - arr[j] > 1:\n\t\t\t\t\tM = arr[k + 1]\n\t\t\t\t\tbreak\n\t\t\t\telif arr[j] - arr[k] > 1:\n\t\t\t\t\tm = arr[k + 1]\n\t\t\t\t\tbreak\n\t\t\ti = k + 1\n\t\t\n\t\tif j - i + 1 > max_so_far:\n\t\t\tmax_so_far = j - i + 1\n\n\n\tprint(max_so_far)\n\n\t\t\t\n", "n = int(input())\nv = list(map(int, input().split()))\n\nf,s = 0,0\nfi,si = -1,-1\n\nl,m = 0,0\n\nfor i in range(n):\n if v[i] == f:\n fi = i\n l += 1\n elif v[i] == s:\n si = i\n l += 1\n else:\n if f == 0:\n f = v[i]\n fi = i\n l += 1\n elif s == 0:\n s = v[i]\n si = i\n l += 1\n elif abs(v[i]-f) <= 1:\n s = v[i]\n l = i-si\n si = i\n else:\n f = v[i]\n l = i-fi\n fi = i\n m = max(l,m)\n\nprint(m)\n \n", "from collections import defaultdict\r\n\r\ndef L():\r\n\treturn input()\r\n\r\ndef LI():\r\n\treturn int(input())\r\n\r\ndef LII():\r\n\treturn list(map(int, input().split()))\r\n\r\nn = LI()\r\narr = LII()\r\n\r\nans = lo = 0\r\ncounter = defaultdict(int)\r\n\r\ndef dec(d, key):\r\n\tval = d[key] - 1\r\n\tif not val:\r\n\t\tdel d[key]\r\n\telse:\r\n\t\td[key] = val\r\n\r\nfor hi, val in enumerate(arr):\r\n\tcounter[val] += 1\r\n\twhile max(counter.keys()) - min(counter.keys()) > 1:\r\n\t\tdec(counter, arr[lo])\r\n\t\tlo += 1\r\n\tans = max(ans, hi - lo + 1)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfrom collections import deque\r\nmax_queue = deque()\r\nmin_queue = deque()\r\n\r\nleft = 0\r\nans = 0\r\nfor right in range(n):\r\n while max_queue and a[right] > a[max_queue[-1]]:\r\n max_queue.pop()\r\n while min_queue and a[right] < a[min_queue[-1]]:\r\n min_queue.pop()\r\n max_queue.append(right)\r\n min_queue.append(right)\r\n if a[max_queue[0]] - a[min_queue[0]] > 1:\r\n if max_queue[0] == left:\r\n max_queue.popleft()\r\n if min_queue[0] == left:\r\n min_queue.popleft()\r\n left += 1\r\n ans = max(ans, right - left + 1)\r\nprint(ans)", "from collections import deque\r\n\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nmaxq=deque()\r\nminq=deque()\r\nans=0\r\nlow=0\r\nfor high in range(n):\r\n v=A[high]\r\n while(maxq and maxq[-1][0]<v):\r\n maxq.pop()\r\n maxq.append((A[high],high))\r\n \r\n while(minq and minq[-1][0]>v):\r\n minq.pop()\r\n minq.append((A[high],high))\r\n \r\n while(abs(minq[0][0]-maxq[0][0])>1):\r\n if(minq[0][1]==low):\r\n minq.popleft()\r\n \r\n if(maxq[0][1]==low):\r\n maxq.popleft()\r\n low+=1 \r\n ans=max(ans,high-low+1)\r\nprint(ans)\r\n \r\n\r\n\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nsl = {}\r\nj = 0\r\nmaxx = 0\r\nfor i in range(n):\r\n if not sl:\r\n sl[s[i]] = 1\r\n else:\r\n sl[s[i - 1]] -= 1\r\n if sl[s[i - 1]] == 0:\r\n sl.pop(s[i - 1])\r\n while True:\r\n if j + 1 < n and (len(sl) == 1 or max(sl) >= s[j + 1] >= min(sl)):\r\n j += 1\r\n if s[j] in sl:\r\n sl[s[j]] += 1\r\n else:\r\n sl[s[j]] = 1\r\n else:\r\n break\r\n\r\n if j - i + 1 > maxx:\r\n maxx = j - i + 1\r\n\r\nprint(maxx)", "def longest_length(seq):\r\n i = 1\r\n last = (0, 0)\r\n ans = -1\r\n start = 0\r\n while i < len(seq):\r\n prev, nxt = seq[i-1], seq[i]\r\n if prev != nxt:\r\n if nxt - prev == last[0] and last[0] != 0:\r\n start = last[1]\r\n\r\n last = (nxt - prev, i)\r\n\r\n ans = max(ans, i - start + 1)\r\n i += 1\r\n\r\n return ans\r\n\r\n\r\ndef main():\r\n input()\r\n seq = [int(c) for c in input().split()]\r\n\r\n ans = longest_length(seq)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\nfrom collections import Counter\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\n\r\nn = list(RI())[0]\r\nnums = list(RI())\r\nwindow = Counter()\r\n\r\nr = -1\r\nans = 2\r\nfor l in range(n):\r\n while r + 1 < n and (window[nums[r + 1]] > 0 or (window[nums[r + 1] + 2] == 0 and window[nums[r + 1] - 2] == 0 )):\r\n r += 1\r\n window[nums[r]] += 1\r\n\r\n ans = max(ans, r - l + 1)\r\n window[nums[l]] -= 1\r\n\r\nprint(ans)", "n = int(input())\r\nnum = [int(i) for i in input().split()]\r\n\r\ni = 0\r\nbest = 0\r\nbig = small = num[0]\r\nfor j in range(n):\r\n\tif big - num[j] > 1 or num[j] - small > 1:\r\n\t\tbest = max(best, j-i)\r\n\t\tbig = num[j]\r\n\t\tsmall = num[j]\r\n\t\tfor x in range(j-1, i, -1):\r\n\t\t\tif abs(big - num[x]) <= 1 and abs(small - num[x]) <=1:\r\n\t\t\t\tbig = max(big, num[x])\r\n\t\t\t\tsmall = min(small, num[x])\r\n\t\t\t\ti = x\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\telse:\r\n\t\tbig = max(num[j], big)\r\n\t\tsmall = min(num[j], small)\r\n\r\nif big - num[-1] <= 1 or num[-1] - small <= 1:\r\n\tbest = max(best, n-i)\r\nprint(best)", "import sys\r\ninput = lambda:sys.stdin.readline().strip()\r\nM = lambda:map(int,input().split())\r\nMM = lambda:map(lambda x:int(x)-1,input().split())\r\nfrom collections import Counter\r\nn = int(input())\r\na = list(M())\r\nl = 0\r\nres = 0\r\nh = Counter()\r\nfor r in range(n):\r\n h[a[r]] += 1\r\n while a[r]-2 in h or a[r]+2 in h:\r\n h[a[l]] -= 1\r\n if not h[a[l]]:del h[a[l]]\r\n l += 1\r\n res = max(res,r-l+1)\r\nprint(res)\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#\thttps://codeforces.com/problemset/problem/602/B\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 arr = get_array()\r\n d = {}\r\n l, r = 0, 0\r\n for i in range(n):\r\n l = max(l, d.get(arr[i]+2, -1)+1, d.get(arr[i]-2, -1)+1)\r\n r = max(r, i-l+1)\r\n d[arr[i]] = i\r\n print(r)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ni = 0\r\nj = 1\r\n_max_len = 0\r\n_max_len_curr = 1\r\nm = 0\r\nwhile i < n-1:\r\n if j == n:\r\n _max_len = max(_max_len,_max_len_curr)\r\n break\r\n if m == 0:\r\n _max_len_curr+=1\r\n if l[i] == l[j]+1:\r\n m = 1\r\n elif l[i] == l[j]-1:\r\n m = -1\r\n j+=1\r\n else:\r\n if l[j] == l[i] or l[i] == l[j]+m:\r\n _max_len_curr+=1\r\n j+=1\r\n else:\r\n _max_len = max(_max_len,_max_len_curr)\r\n _max_len_curr = 1\r\n j-=1\r\n while True:\r\n if l[j] != l[j-1]:\r\n i = j\r\n break\r\n else:\r\n j-=1\r\n\r\n j=i+1\r\n m = 0\r\nprint(_max_len)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmaxx = 1\r\naa=0\r\nbb=0\r\nl=0\r\nfor i in range(1,n):\r\n tmp = a[i]-a[i-1]\r\n if tmp!=0:\r\n if tmp==aa:\r\n l = bb+1\r\n bb = i-1\r\n aa = tmp\r\n maxx = max(maxx,i-l+1)\r\nprint(maxx)", "n =int(input())\nk=2\nx = list(map(int, input().split()))\nl = 0\nr = 0\nans = 0\nd= {}\ns=set()\nwhile l <= r < n:\n if len(s) <= k:\n s.add(x[r])\n if x[r] in d:\n d[x[r]] += 1\n else:\n d[x[r]]=1\n if len(s) <= k:\n ans = max(ans, r - l + 1)\n r += 1\n else:\n d[x[l]] -= 1\n if d[x[l]] == 0:\n s.remove(x[l])\n l += 1\nprint(ans)\n \t\t\t \t\t \t \t \t\t \t\t\t \t \t\t \t", "def longest_almost_constant_range(n, data):\n max_length = 0\n left = 0\n counts = {}\n\n for right in range(n):\n if data[right] not in counts:\n counts[data[right]] = 0\n counts[data[right]] += 1\n\n while max(counts) - min(counts) > 1:\n counts[data[left]] -= 1\n if counts[data[left]] == 0:\n del counts[data[left]]\n left += 1\n\n max_length = max(max_length, right - left + 1)\n\n return max_length\n\n# Read input\nn = int(input())\ndata = list(map(int, input().split()))\n\n# Call the function and print the result\nresult = longest_almost_constant_range(n, data)\nprint(result)\n\n \t \t \t\t\t\t \t\t\t \t\t\t\t\t\t \t \t", "MOD = 1000000007\r\nii = lambda : int(input())\r\nsi = lambda : input()\r\ndgl = lambda : list(map(int, input()))\r\nf = lambda : map(int, input().split())\r\nil = lambda : list(map(int, input().split()))\r\nls = lambda : list(input())\r\nn = ii()\r\nl = il()\r\nmx = 1\r\npdif = 0\r\nln = 0\r\npind = 0\r\nfor i in range(1, n):\r\n if l[i]-l[i-1] != 0:\r\n if l[i]-l[i-1] == pdif:\r\n ln = pind+1\r\n pind = i-1\r\n pdif = l[i]-l[i-1]\r\n mx = max(mx,i-ln+1)\r\nprint(mx)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nl, r = 0, 1\r\nans = 1\r\nlast = 2\r\npos = 0\r\nwhile r < n:\r\n while r < n and arr[r] - arr[r - 1] != last:\r\n if arr[r] != arr[r - 1]:\r\n last = arr[r] - arr[r - 1]\r\n pos = r\r\n r += 1\r\n\r\n ans = max(ans, r - l)\r\n l = pos\r\n pos = r\r\n r += 1\r\n\r\nprint(ans)\r\n", "def solve(A, N):\r\n count = []\r\n for i in range(100002):\r\n count.append(0)\r\n for i in range(N):\r\n A[i] = int(A[i])\r\n\r\n count[A[0]] += 1\r\n num = 1\r\n L = 0\r\n cnt = 0\r\n\r\n for R in range(1, N):\r\n if (count[A[R]] == 0):\r\n num += 1\r\n while (num > 2):\r\n count[A[L]] -= 1\r\n if (count[A[L]] == 0):\r\n num -= 1\r\n L += 1\r\n count[A[R]] += 1\r\n cnt = max(cnt, R - L + 1)\r\n return cnt \r\n\r\nN = int(input())\r\nA = input()\r\nA = A.split(\" \")\r\nprint(solve(A, N))", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nL = 0\r\ndif = 0\r\nres = 0\r\n\r\ncnt = [0] * ( 10 ** 5 + 1)\r\n\r\nfor i in range (n):\r\n if cnt[a[i]] == 0:\r\n dif += 1\r\n cnt[a[i]] += 1\r\n \r\n while dif == 3:\r\n if cnt[a[L]] == 1:\r\n dif -= 1\r\n cnt[a[L]] -= 1\r\n L += 1\r\n if (i - L + 1) > res:\r\n res = i - L + 1\r\n \r\nprint(res)\r\n", "def ii(): return int(input())\r\ndef si(): return input()\r\ndef mi(): return map(int,input().split())\r\ndef li(): return list(mi())\r\n\r\nn=ii()\r\na=li()\r\n\r\nminp=0;maxp=-1\r\nmini,maxi=0,0\r\nans=0;curr=1\r\n\r\nfor i in range(1,n):\r\n if abs(a[i]-a[i-1])>1:\r\n minp=i\r\n maxp=-1\r\n ans=max(ans,curr)\r\n curr=1\r\n \r\n else:\r\n if maxp==-1:\r\n curr+=1\r\n \r\n if a[i]>=a[i-1]:\r\n maxp=i\r\n minp=i-1\r\n maxi=a[i]\r\n mini=a[i-1]\r\n \r\n else:\r\n maxp=i-1\r\n minp=i\r\n maxi=a[i-1]\r\n mini=a[i]\r\n \r\n else:\r\n if a[i]==maxi:\r\n maxp=i\r\n curr+=1\r\n \r\n elif a[i]==mini:\r\n minp=i\r\n curr+=1\r\n \r\n else:\r\n #tmaxi,tmini=maxi,mini\r\n if a[i]>maxi:\r\n if maxi==mini:\r\n curr+=1\r\n maxi=a[i]\r\n maxp=i\r\n minp=i-1\r\n \r\n else:\r\n ans=max(ans,curr)\r\n curr=1+maxp-minp\r\n maxp=i\r\n minp=i-1\r\n maxi=a[i];mini=a[i-1]\r\n \r\n elif a[i]<mini:\r\n if mini==maxi:\r\n curr+=1\r\n mini=a[i]\r\n minp=i\r\n maxp=i-1\r\n \r\n else:\r\n ans=max(ans,curr)\r\n curr=1+minp-maxp\r\n maxp=i-1\r\n minp=i\r\n maxi=a[i-1];mini=a[i]\r\n\r\nans=max(ans,curr) \r\nprint(ans)", "from collections import deque\n\n\ndef acr_len(ai):\n ea = enumerate(ai)\n i, a = next(ea)\n m, mf, ml = a, i, i\n M, Mf, Ml = a, i, i\n l = 0\n for i, a in ea:\n if a < m:\n if m < M:\n M, Mf, Ml = m, Ml+1, ml\n m, mf, ml = a, i, i\n elif a > M:\n if m < M:\n m, mf, ml = M, ml+1, Ml\n M, Mf, Ml = a, i, i\n else:\n if a == m:\n ml = i\n if a == M:\n Ml = i\n l = max(l, i-mf+1, i-Mf+1)\n return l\n\n\nif __name__ == '__main__':\n n = int(input())\n ai = tuple(map(int, input().split()))\n print(acr_len(ai))\n", "import collections\n\nn = int(input())\na = list(map(int, input().split()))\n\nans = 0\ni = 0\nj = 0\nchecks = []\nfreq = collections.Counter()\ndiff = 0\nwhile i < n and j < n:\n if freq[a[j]] == 0:\n diff += 1\n freq[a[j]] += 1\n while diff > 2:\n freq[a[i]] -= 1\n if freq[a[i]] == 0:\n diff -= 1\n i += 1\n\n ans = max(ans, j - i + 1)\n j += 1\n\n\nprint(ans)\n\n", "x=input()\r\nz=list(map(int,input().split())) \r\nv_c=z[0]\r\nc=0\r\nv_p=0\r\np=0\r\nmax=0\r\nfor i in z:\r\n if i==v_c :\r\n c+=1\r\n elif i==v_p:\r\n p=c+p\r\n v_p=v_c\r\n v_c=i\r\n c=1\r\n else:\r\n p=c\r\n c=1\r\n v_p = v_c\r\n v_c = i\r\n if p+c>max:\r\n max = p+c\r\n\r\nprint(max)\r\n\r\n\r\n\r\n", "if __name__ == \"__main__\":\r\n\r\n n = int( input() )\r\n a = [ int(x) for x in input().split() ]\r\n\r\n maxLen = 2\r\n left = 0\r\n right = 1\r\n sumA = a[0] + a[1]\r\n m = min( a[0] , a[1] )\r\n M = max( a[0] , a[1] )\r\n\r\n curLen = 2\r\n for i in range( 2 , n ):\r\n if a[i] > M:\r\n while M * (right-left+1) != sumA:\r\n sumA -= a[left]\r\n left += 1\r\n m = M\r\n M = a[i]\r\n elif a[i] < m:\r\n while m * (right-left+1) != sumA:\r\n sumA -= a[left]\r\n left += 1\r\n M = m\r\n m = a[i]\r\n\r\n right += 1\r\n sumA += a[i]\r\n curLen = right-left+1\r\n maxLen = max( maxLen , curLen )\r\n\r\n print( maxLen )", "N = int( input() )\r\nA = [ int(x) for x in input().split() ]\r\n \r\nfrom collections import defaultdict\r\ninside = defaultdict(int)\r\n \r\nanswer = 1\r\nr = 0\r\nfor l in range(N):\r\n if l > 0:\r\n inside[ A[l-1] ] -= 1\r\n if inside[ A[l-1] ] == 0: del inside[ A[l-1] ]\r\n while r < N and (len(inside) < 2 or A[r] in inside):\r\n inside[ A[r] ] += 1\r\n r += 1\r\n answer = max( answer, r-l )\r\n \r\nprint(answer)", "n = map(int , input())\r\n\r\na = list(map(int , input().split()))\r\n\r\ni = 0\r\nj = 0\r\n\r\nmaxx = a[0]\r\nminn = a[0]\r\ncnt = (100000+10)*[0]\r\nans = 1\r\ncnt[a[0]] = 1\r\nwhile(1):\r\n maxx = max(maxx , a[j])\r\n minn = min(minn , a[j])\r\n if(maxx - minn <= 1):\r\n ans = max(ans, j-i+1)\r\n if(maxx - minn <= 1 and j < len(a)-1):\r\n j+=1\r\n cnt[a[j]]+=1\r\n elif(i< len(a)-1):\r\n cnt[a[i]]-=1\r\n if(cnt[a[i]] == 0 and a[i]==minn):\r\n tmp = a[i]\r\n while(1):\r\n tmp+=1\r\n if(cnt[tmp]!=0):\r\n minn = tmp\r\n break\r\n if(cnt[a[i]] == 0 and a[i]==maxx):\r\n tmp = a[i]\r\n while(1):\r\n tmp-=1\r\n if(cnt[tmp]!=0):\r\n maxx = tmp\r\n break\r\n i+=1\r\n else:\r\n break\r\n\r\nprint(ans)\r\n \r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\n \r\nj = max_length = cnt = 0\r\nfre = [0]*(10**5+1)\r\n\r\nfor i in range(n):\r\n while j<n and cnt<=2:\r\n if(cnt==2) and (fre[a[j]]==0):\r\n break\r\n if(fre[a[j]]==0):\r\n cnt+=1\r\n fre[a[j]]+=1\r\n j+=1\r\n max_length = max(max_length,j-i)\r\n if(fre[a[i]]==1):\r\n cnt-=1\r\n fre[a[i]]-=1\r\nprint(max_length) ", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\narr = [0]*100001\r\n\r\nk = 0 # number of distinct data points\r\nmaxL = 1\r\nl = 0\r\n\r\nfor i in range(n):\r\n p = points[i]\r\n\r\n if arr[p] == 0:\r\n k += 1\r\n arr[p] = 1\r\n else:\r\n arr[p] += 1\r\n \r\n while k > 2:\r\n \r\n #remove 5\r\n arr[points[l]] -= 1\r\n \r\n # check if removing the distinct data point\r\n if (arr[points[l]] == 0):\r\n k -= 1\r\n \r\n #move left\r\n l += 1\r\n \r\n maxL = max(maxL, i - l + 1)\r\n\r\n\r\nprint(maxL)", "def main():\r\n n = int(input().strip())\r\n data_points = list(map(int, input().strip().split()))\r\n\r\n max_length = 0\r\n left = 0\r\n counts = [0] * (max(data_points) + 1)\r\n unique_values = 0\r\n\r\n for right in range(n):\r\n if counts[data_points[right]] == 0:\r\n unique_values += 1\r\n\r\n counts[data_points[right]] += 1\r\n\r\n while unique_values > 2:\r\n counts[data_points[left]] -= 1\r\n if counts[data_points[left]] == 0:\r\n unique_values -= 1\r\n left += 1\r\n\r\n max_length = max(max_length, right - left + 1)\r\n\r\n print(max_length)\r\n\r\nmain()\r\n", "def main():\r\n nmax = 100010\r\n input()\r\n seq = [int(c) for c in input().split()]\r\n dp = [0] * nmax\r\n ans = 0\r\n for e in seq:\r\n dp[e] += 1\r\n dp[e-1] += 1\r\n dp[e+1] = 0\r\n if e != 1:\r\n dp[e-2] = 0\r\n ans = max(ans, dp[e])\r\n ans = max(ans, dp[e-1])\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\ndata = list(map(int, input().split()))\nleft = 0\nmax_length = 0\nfreq = {}\nfor right in range(n):\n if data[right] not in freq:\n freq[data[right]] = 0\n freq[data[right]] += 1\n while max(freq) - min(freq) > 1:\n freq[data[left]] -= 1\n if freq[data[left]] == 0:\n del freq[data[left]]\n left += 1\n max_length = max(max_length, right - left + 1)\nprint(max_length)\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\nj = 0\r\ntemp = 0\r\npred = 0\r\nres=1\r\nfor i in range(1,n):\r\n if l[i]!=l[i-1]:\r\n if l[i]-l[i-1]==pred:\r\n j = temp\r\n pred = l[i]-l[i-1]\r\n temp = i\r\n res = max(res,i-j+1)\r\nprint(res) \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nres = 1\r\ncount_diff = 0\r\ncnt = [0] * 100001\r\nl = 0\r\nfor r in range(n):\r\n if cnt[a[r]] == 0:\r\n count_diff += 1\r\n cnt[a[r]] += 1\r\n while count_diff > 2:\r\n cnt[a[l]] -= 1\r\n if cnt[a[l]] == 0:\r\n count_diff -= 1\r\n l += 1\r\n res = max(res, r - l + 1)\r\n\r\nprint(res)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmin_num = max_num = lst[0]\r\nl = r = 0\r\nans = 0\r\nfor r in range(n):\r\n min_num = min(min_num, lst[r])\r\n max_num = max(max_num, lst[r])\r\n if abs(max_num - min_num) > 1:\r\n l = r - 1\r\n while l > 0:\r\n if lst[l-1] == min_num:\r\n min_num = lst[l]\r\n break\r\n elif lst[l-1] == max_num:\r\n max_num = lst[l]\r\n break\r\n l -= 1\r\n ans = max(ans, r - l + 1)\r\n\r\nprint(ans)\r\n ", "# import sys\r\n# sys.stdin = open('cf602b.in')\r\n\r\nn = int(input())\r\na = map(int, input().split())\r\n\r\nfirst = {}\r\n# last = {}\r\n\r\nctop, cbot = None, None\r\nprev = None\r\ncstart = 0\r\nans = 0\r\n\r\nfor i, v in enumerate(a):\r\n\t# print(i, v, (cbot, ctop), first)\r\n\tif ctop is None:\r\n\t\t# bootstrap\r\n\t\tassert cbot is None\r\n\t\tassert i == 0\r\n\t\tctop = cbot = prev = v\r\n\t\tfirst[v] = i\r\n\t\tcontinue\r\n\tif v > ctop:\r\n\t\tprev = v\r\n\t\tif cbot == ctop:\r\n\t\t\tctop += 1\r\n\t\t\tfirst[v] = i\r\n\t\telse:\r\n\t\t\tans = max(ans, i - cstart)\r\n\t\t\t# last[ctop] = i - 1\r\n\t\t\tcstart = first[ctop]\r\n\t\t\tfirst[v] = i\r\n\t\t\tcbot = ctop\r\n\t\t\tctop = v\r\n\telif v < cbot:\r\n\t\tprev = v\r\n\t\tif cbot == ctop:\r\n\t\t\tcbot -= 1\r\n\t\t\tfirst[v] = i\r\n\t\telse:\r\n\t\t\tans = max(ans, i - cstart)\r\n\t\t\t# last[cbot] = i - 1\r\n\t\t\tcstart = first[cbot]\r\n\t\t\tfirst[v] = i\r\n\t\t\tctop = cbot\r\n\t\t\tcbot = v\r\n\telif prev != v:\r\n\t\tfirst[v] = i\r\n\t\tprev = v\r\n\r\nans = max(ans, n - cstart)\r\nprint(ans)", "n = int(input())\na = list(map(int,input().split()))\n \nd = {}\nl = r = 0\n \nfor i in range(n):\n\tl = max(l, d.get(a[i] + 2, -1) + 1, d.get(a[i] - 2, -1) + 1)\n\tr = max(r, i - l + 1)\n\td[a[i]] = i\n \nprint(r)\n\n\t \t \t\t\t\t \t\t\t \t \t \t \t\t\t", "n=int(input())\r\na=list(map(int, input().split()))\r\nidx = dict()\r\nl = 0\r\nans = 1\r\nidx[a[0]] = 0\r\nfor i in range(1, n):\r\n l = max(l, idx.get(a[i] + 2, -1) + 1)\r\n l = max(l, idx.get(a[i] - 2, -1) + 1)\r\n ans = max(ans, i - l + 1)\r\n idx[a[i]] = i\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\narr=[[a[0],1]]\r\nfor i in range(1,n):\r\n if a[i]==arr[-1][0]:\r\n arr[-1][1]+=1\r\n else:\r\n arr.append([a[i],1])\r\nans=0\r\ntmp=arr[0][1]\r\narr.append([100005,1])\r\nfor i in range(1,len(arr)):\r\n if i==1:\r\n if abs(arr[i][0]-arr[i-1][0])<=1:\r\n tmp+=arr[i][1]\r\n else:\r\n ans=max(ans,tmp)\r\n tmp=arr[i][1]\r\n else:\r\n if abs(arr[i][0]-arr[i-1][0])>1:\r\n ans=max(ans,tmp)\r\n tmp=arr[i][1]\r\n else:\r\n if arr[i][0]==arr[i-2][0]:\r\n tmp+=arr[i][1]\r\n else:\r\n ans=max(ans,tmp)\r\n tmp=arr[i-1][1]+arr[i][1]\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = [0] * 100009\r\nk = 0\r\n\r\nl = 0\r\nans = 0\r\nfor r in range(n):\r\n if cnt[a[r]] == 0:\r\n k += 1\r\n cnt[a[r]] += 1\r\n\r\n while k > 2:\r\n cnt[a[l]] -= 1\r\n if cnt[a[l]] == 0:\r\n k -= 1\r\n l += 1\r\n\r\n ans = max(ans, r - l + 1)\r\n\r\nprint(ans)\r\n", "MAX_N = 100005\r\nn = int(input())\r\na = list(map(int, input().split(' ')))\r\n \r\ncnt = [0 for i in range(MAX_N)] \r\ncount = 0\r\nres = 0\r\n \r\nl = 0\r\nfor i in range(n): \r\n\tcnt[a[i]] += 1\r\n\tif cnt[a[i]] == 1:\r\n\t\tcount += 1\r\n\twhile count > 2:\r\n\t\tcnt[a[l]] -= 1\r\n\t\tif cnt[a[l]] == 0:\r\n\t\t\tcount -= 1\r\n\t\tl += 1\r\n \r\n\tif count == 2:\r\n\t\tif cnt[a[i] - 1] == 0 and cnt[a[i] + 1] == 0:\r\n\t\t\tcontinue\r\n\tif res < i - l + 1:\r\n\t\tres = i - l + 1\r\nprint(res)", "n = int(input())\r\nans = -1\r\np = [0] * 100003\r\nar = input().split()\r\nfor i in range(1, n+1):\r\n x = int(ar[i-1])\r\n if p[x-1] > p[x+1]:\r\n ans = max(ans, i - max(p[x+1], p[x-2]))\r\n else:\r\n ans = max(ans, i - max(p[x-1], p[x+2]))\r\n p[x] = i\r\n\r\nprint(ans)", "# Problem: B. Approximating a Constant Range\r\n# Contest: Codeforces - Codeforces Round 333 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/602/B\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport random\r\nfrom types import GeneratorType\r\nimport bisect\r\nimport io, os\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom contextlib import redirect_stdout\r\nfrom itertools import *\r\nfrom array import *\r\nfrom functools import lru_cache, reduce\r\nfrom heapq import *\r\nfrom math import sqrt, gcd, inf\r\n\r\nif sys.version >= '3.8': # ACW没有comb\r\n from math import comb\r\n\r\nRI = lambda: map(int, sys.stdin.buffer.readline().split())\r\nRS = lambda: map(bytes.decode, sys.stdin.buffer.readline().strip().split())\r\nRILST = lambda: list(RI())\r\nDEBUG = lambda *x: sys.stderr.write(f'{str(x)}\\n')\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\") # 打开可以快写，但是无法使用print(*ans,sep=' ')这种语法,需要print(' '.join(map(str, p)))，确实会快。\r\n\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),\r\n (-1, 1)] # →↘↓↙←↖↑↗\r\nRANDOM = random.randrange(2 ** 62)\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/problemset/problem/602/B\r\n\r\n输入 n(2≤n≤1e5) 和长为 n 的数组 a(1≤a[i]≤1e5 且 abs(a[i]-a[i-1])≤1)。\r\n输出 a 的最长连续子数组的长度，满足数组中的最大值减最小值不超过 1。\r\n输入\r\n5\r\n1 2 3 3 2\r\n输出 4\r\n\r\n输入\r\n11\r\n5 4 5 5 6 7 8 8 8 7 6\r\n输出 5\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n a = RILST()\r\n mx, mn = -inf, inf\r\n ans = 2\r\n cnt = [0] * (max(a)+1)\r\n q = deque()\r\n for v in a:\r\n q.append(v)\r\n cnt[v] += 1\r\n mx, mn = max(mx, v), min(mn, v)\r\n while mn + 1 < mx:\r\n cnt[q.popleft()] -= 1\r\n # print(cnt)\r\n while not cnt[mx]:\r\n mx -= 1\r\n while not cnt[mn]:\r\n mn += 1\r\n # print(v,mx,mn,len(q))\r\n ans = max(ans, len(q))\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n t = 0\r\n if t:\r\n t, = RI()\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ntrack = dict()\r\nr = 0\r\nans = 0\r\ncnt = 0\r\nfor l in range(n):\r\n while r < n and cnt <= 2:\r\n if cnt == 2 and track.get(arr[r], 0) == 0:\r\n break\r\n if track.get(arr[r], 0) == 0:\r\n cnt += 1\r\n track[arr[r]] = track.get(arr[r], 0) + 1\r\n r += 1\r\n\r\n ans = max(ans, r - l)\r\n\r\n if track.get(arr[l]) == 1:\r\n cnt -= 1\r\n track[arr[l]] = track.get(arr[l]) - 1\r\n\r\nprint(ans)\r\n", "def main():\r\n\tn = int(input())\r\n\tL = [int(x) for x in input().split()]\r\n\tresult = solver(L)\r\n\tprint(result)\r\n\r\ndef solver(L):\r\n\tif len(L) <= 2:\r\n\t\treturn len(L)\r\n\telse:\r\n\t\tlastSeen = dict()\r\n\t\tlongest = 0\r\n\t\tlastSeen[L[0]] = 0\r\n\t\tlastSeen[L[1]] = 1\r\n\t\tfor i in range(2, len(L)):\r\n\t\t\tx = L[i]\r\n\t\t\tlastSeen[x] = i\r\n\t\t\tplus1Index = -1\r\n\t\t\tminus1Index = -1\r\n\t\t\tplus2Index = -1\r\n\t\t\tminus2Index = -1\r\n\t\t\tif x + 1 in lastSeen:\r\n\t\t\t\tplus1Index = lastSeen[x + 1]\r\n\t\t\tif x - 1 in lastSeen:\r\n\t\t\t\tminus1Index = lastSeen[x - 1]\r\n\t\t\tif x + 2 in lastSeen:\r\n\t\t\t\tplus2Index = lastSeen[x + 2]\r\n\t\t\tif x - 2 in lastSeen:\r\n\t\t\t\tminus2Index = lastSeen[x - 2]\r\n\t\t\tmin1Index = min(plus1Index, minus1Index)\r\n\t\t\tmax2Index = max(plus2Index, minus2Index)\r\n\t\t\tif max2Index > min1Index:\r\n\t\t\t\tif i - max2Index > longest:\r\n\t\t\t\t\tlongest = i - max2Index\r\n\t\t\telse:\r\n\t\t\t\tif i - min1Index > longest:\r\n\t\t\t\t\tlongest = i - min1Index\r\n\t\t\t# biggestIndex = -1\r\n\t\t\t# if x - 1 in lastSeen and \\\r\n\t\t\t# lastSeen[x - 1] > biggestIndex:\r\n\t\t\t# \tbiggestIndex = lastSeen[x - 2]\r\n\t\t\t# if x + 1 in lastSeen and \\\r\n\t\t\t# lastSeen[x + 1] > biggestIndex:\r\n\t\t\t# \tbiggestIndex = lastSeen[x + 2]\r\n\t\t\t#if i - biggestIndex > longest:\r\n\t\t\t#\tlongest = i - biggestIndex\r\n\t\t\t# if x - 3 in lastSeen:\r\n\t\t\t# \tdel lastSeen[x - 3]\r\n\t\t\t# if x + 3 in lastSeen:\r\n\t\t\t# \tdel lastSeen[x + 3]\t\r\n\t\treturn longest\r\n\r\n# def solver(L):\r\n# \tlongest = 0\r\n# \tfor i in range(len(L)):\r\n# \t\tmaximum = L[i]\r\n# \t\tminimum = L[i]\r\n# \t\tfor j in range(i + 1, len(L)):\r\n# \t\t\tif L[j] > maximum:\r\n# \t\t\t\tmaximum = L[j]\r\n# \t\t\t\tif maximum - minimum > 1:\r\n# \t\t\t\t\tif j - i > longest:\r\n# \t\t\t\t\t\tlongest = j - i\r\n# \t\t\t\t\tbreak\r\n# \t\t\telif L[j] < minimum:\r\n# \t\t\t\tminimum = L[j]\r\n# \t\t\t\tif maximum - minimum > 1:\r\n# \t\t\t\t\tif j - i > longest:\r\n# \t\t\t\t\t\tlongest = j - i\r\n# \t\t\t\t\tbreak\r\n# \t\telse:\r\n# \t\t\tif len(L) - i > longest:\r\n# \t\t\t\tlongest = len(L) - i\r\n# \treturn longest\r\n\r\n#L1 = [1, 2, 3, 3, 2]\r\n#print(solver(L1))\r\n\r\n#L2 = [5, 4, 5, 5, 6, 7, 8, 8, 8, 7, 6]\r\n#print(solver(L2))\r\nmain()\r\n\r\n\r\n", "n = int(input())\nl = list(map(int,input().split()))\ni = 0\nj = 1\n_max_len = 0\n_max_len_curr = 1\nm = 0\nwhile i < n-1:\n if j == n:\n _max_len = max(_max_len,_max_len_curr)\n break\n if m == 0:\n _max_len_curr+=1\n if l[i] == l[j]+1:\n m = 1\n elif l[i] == l[j]-1:\n m = -1\n j+=1\n else:\n if l[j] == l[i] or l[i] == l[j]+m:\n _max_len_curr+=1\n j+=1\n else:\n _max_len = max(_max_len,_max_len_curr)\n _max_len_curr = 1\n j-=1\n while True:\n if l[j] != l[j-1]:\n i = j\n break\n else:\n j-=1\n\n j=i+1\n m = 0\nprint(_max_len)\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()))\n\nMAXN = int(1e5+10)\ns = [0]*MAXN\nb = [0]*MAXN\ns[0] = a[0]\nb[0] = a[0]\nsl = 0\nsr = 1\nbl = 0\nbr = 1\nl = 0\nr = 1\nans = 1\nb[0] = a[0]\ns[0] = a[0]\nwhile 1:\n while (bl < br) & (sl < sr) & (b[bl]-s[sl]>1):\n if b[bl] == a[l]:\n bl+=1\n if s[sl] == a[l]:\n sl+=1\n l+=1\n # print(b[bl:br], bl, br)\n # print(s[sl:sr], sl, sr)\n ans = max(ans, r-l)\n if r < n:\n while (sr > sl) & (s[sr-1] > a[r]):\n sr -= 1\n s[sr] = a[r]\n sr += 1\n while (br > bl) & (b[br-1] < a[r]):\n br -= 1\n b[br] = a[r]\n br += 1\n r += 1\n else:\n break\nprint(ans)\n\n\t\t\t\t \t\t \t \t\t\t \t\t \t\t\t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmax_length = 1\r\ncurrent_asc_length = 1\r\ncurrent_desc_length = 1\r\n\r\nfor i in range(1, n):\r\n if arr[i - 1] < arr[i]:\r\n current_asc_length, current_desc_length = current_desc_length, 0\r\n \r\n elif arr[i - 1] > arr[i]:\r\n current_desc_length, current_asc_length = current_asc_length, 0\r\n \r\n current_asc_length += 1\r\n current_desc_length += 1\r\n \r\n max_length = max(max_length, max(current_asc_length, current_desc_length))\r\n\r\nprint(max_length)", "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# For fast IO use sys.stdout.write(str(x) + \"\\n\") instead of print\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\n# Constants\r\nMAX_N = 100005\r\nMAX = 1000000001\r\nMIN = -1000000001\r\nMOD = 1000000007\r\n\r\n# adj = [[] for i in range(MAX_N)]\r\n \r\ndef input_graph(n):\r\n for i in range(n):\r\n edge = get_list()\r\n adj[edge[0]].append(edge[1])\r\n adj[edge[1]].append(edge[0])\r\n \r\ndef print_adj(n):\r\n for i in range(0, n+1):\r\n print(i, adj[i])\r\n \r\n\r\nfor t in range(1):\r\n n = int(input().strip())\r\n arr = get_list() \r\n left, right, distinct = 0, 0, 0\r\n freq = {}\r\n ans = 0\r\n \r\n # print(arr)\r\n while right < n:\r\n # print(\"start, right = \", right)\r\n while right < n and (distinct < 2 or (distinct == 2 and freq.get(arr[right], 0) > 0)):\r\n if freq.get(arr[right], 0) == 0:\r\n distinct += 1\r\n freq[arr[right]] = freq.get(arr[right], 0) + 1\r\n # print(\"right = \", right)\r\n right += 1\r\n \r\n ans = max(ans, right - left)\r\n \r\n # print(\"right\", right, \"freq\", freq, \"ans\", ans)\r\n \r\n freq[arr[left]] = freq.get(arr[left], 0) - 1\r\n if freq[arr[left]] == 0:\r\n distinct -= 1\r\n left += 1\r\n # print(\"left\", left)\r\n \r\n print(ans)\r\n ", "__author__ = 'Administrator'\nn=int(input())\na=list(map(int,input().split()))\nleft=0\nright=1\ncount=[0]*100001;\nmax1=a[1]\nmin1=a[0]\nif max1<min1:\n max1,min1=min1,max1\ncount[a[0]]=1\nmaxans=-1\nwhile right<n:\n count[a[right]]+=1\n max1=max(max1,a[right])\n min1=min(min1,a[right])\n if max1-min1>1:\n while left!=right and max1-min1>1:\n left+=1\n count[a[left-1]]-=1\n if count[min1]== 0:\n min1+=1\n if count[max1]==0 :\n max1-=1\n maxans=max(maxans,right-left+1)\n right+=1\nprint(maxans)\n\n\n", "# https://www.acwing.com/blog/content/34755/\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n w = [int(i) for i in input().split()]\r\n s = [0] * 100010\r\n \r\n res, cnt, j = 0, 0, 0\r\n for i in range(n):\r\n if s[w[i]] == 0: cnt += 1\r\n s[w[i]] += 1\r\n while cnt > 2:\r\n s[w[j]] -= 1\r\n if s[w[j]] == 0: cnt -= 1\r\n j += 1\r\n res = max(res, i - j + 1)\r\n print(res)\r\n\r\ndef main():\r\n solve()\r\n\r\nif __name__ == '__main__':\r\n main()", "x = int(input())\r\ny = list(map(int, input().split(' ')))\r\nz = [i + i%2 for i in y]\r\nw = [i + (i+1)%2 for i in y]\r\n\r\nz = [-1] + z + [-1]\r\nw = [-1] + w + [-1]\r\n\r\nk = [i for i in range(len(z)-1) if z[i] != z[i+1]]\r\nl = [i for i in range(len(w)-1) if w[i] != w[i+1]]\r\n\r\na = max([k[i+1] - k[i] for i in range(len(k)-1)])\r\nb = max([l[i+1] - l[i] for i in range(len(l)-1)])\r\n\r\nprint(max(a, b))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nl,c=0,lst[0]\r\ntemp=[]\r\nfor i in lst:\r\n if i==c:\r\n l+=1\r\n else:\r\n temp.append([c,l])\r\n l=1\r\n c=i\r\ntemp.append([c,l])\r\ni,j=0,1\r\nif len(temp)==1:\r\n print(n)\r\nelse:\r\n res=0\r\n x=temp[0][1]\r\n c=[temp[0][0],temp[1][0]]\r\n while j<len(temp):\r\n if temp[j][0] in c:\r\n x+=temp[j][1]\r\n j+=1\r\n else:\r\n res=max(res,x)\r\n x=temp[j-1][1]\r\n c=[temp[j-1][0],temp[j][0]]\r\n print(max(res,x))", "n = int(input())\nres = -1\np = [0] *100003\nar = input().split()\nfor i in range(1, n+1):\n x= int(ar[i-1])\n if p[x-1] > p[x+1]:\n res = max(res, i-max(p[x+1], p[x-2]))\n else:\n res = max(res, i- max(p[x-1], p[x+2]))\n p[x] = i\nprint (res)\n\t\t \t \t \t\t\t \t \t \t \t \t\t\t \t\t\t", "from collections import deque, defaultdict\n\nn = int(input())\na = map(int, input().split())\nans = 1\nm = defaultdict(list)\nmf = [n - 1] * n\nfor i, v in enumerate(a):\n q = m[v + 2]\n while len(q) > 0:\n mf[q.pop()] = i - 1\n q = m[v - 2]\n while len(q) > 0:\n mf[q.pop()] = i - 1\n m[v].append(i)\nans = 0\nfor i in range(n - 2, -1, -1):\n mf[i] = min(mf[i], mf[i + 1])\n\nfor i in range(n):\n ans = max(ans, mf[i] - i + 1)\n\nprint(ans)\n", "def scanf():\r\n inp = list(map(int, input().split(' ')))\r\n if len(inp) == 1:\r\n return inp[0]\r\n return inp\r\n\r\n\r\nn = scanf()\r\na = scanf()\r\nlef = 0\r\nmi = mx = a[0]\r\nans = 0\r\nfor i in range(1, n):\r\n mi = min(mi, a[i])\r\n mx = max(mx, a[i])\r\n # print('i', i, 'lef', lef)\r\n if abs(mi - mx) >= 2:\r\n # print(i, 2)\r\n ans = max(ans, i - lef)\r\n for j in range(i, lef, -1):\r\n if abs(a[i] - a[j]) <= 1:\r\n lef = j\r\n else:\r\n break\r\n mi = min(a[i], a[lef])\r\n mx = max(a[i], a[lef])\r\n # print('return to', lef)\r\n else:\r\n ans = max(ans, i - lef + 1)\r\nprint(ans)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\nn = int(input())\r\na = list(map(int,input().split()))\r\ni,mi,ma = 1,a[0],a[0]\r\ndp = [0]*n\r\nb,l = float(\"-inf\"),1\r\nwhile i<n:\r\n mi = min(mi,a[i])\r\n ma = max(ma,a[i])\r\n if ma-mi<=1:\r\n if a[i]==a[i-1]:\r\n dp[i]=dp[i-1]\r\n else:\r\n dp[i]=i\r\n i+=1\r\n l+=1\r\n else:\r\n if l>b:\r\n b=l\r\n l=0\r\n if a[i]==ma:\r\n ma=a[i]\r\n if a[i-1]==a[i]-1:\r\n l+=i-dp[i-1]\r\n mi=a[i-1]\r\n else:\r\n mi=a[i]\r\n ma=a[i]\r\n if a[i]==mi:\r\n mi = a[i]\r\n if a[i-1]==a[i]+1:\r\n l+=i-dp[i-1]\r\n ma = a[i-1]\r\n else:\r\n mi=a[i]\r\n ma=a[i]\r\nprint(max(l,b))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nans = 1\r\npdiff = e = g = 0\r\nfor i in range(1, n):\r\n diff = arr[i] - arr[i - 1]\r\n if diff:\r\n if diff == pdiff:\r\n g = e + 1\r\n e = i - 1\r\n pdiff = diff\r\n ans = max(ans, i - g + 1)\r\nprint(ans)", "from collections import defaultdict\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n d = defaultdict(int)\r\n cnt = 0\r\n l = 0 \r\n res = 0\r\n for r in range(n):\r\n d[a[r]] += 1\r\n if d[a[r]] == 1: cnt += 1\r\n while cnt > 2:\r\n d[a[l]] -= 1\r\n if d[a[l]] == 0:\r\n cnt -= 1\r\n l += 1\r\n res = max(res, r - l + 1)\r\n print(res) ", "input()\nstart = delta = j = 0\nres, a = [], \"-1\"\nfor i, b in enumerate(input().split()):\n if a != b:\n a, ab = b, int(b) - int(a)\n if delta == ab:\n start = j\n j, delta = i, ab\n res.append(i - start)\nprint(max(res) + 1)\n\n\n\n\n# Made By Mostafa_Khaled", "n=int(input())\r\nl=[0]*100003\r\nm=-1\r\ns=input().split()\r\nfor i in range(1,n+1):\r\n k=int(s[i-1])\r\n if(l[k-1]>l[k+1]):\r\n m=max(m,i-max(l[k+1],l[k-2]))\r\n else: \r\n m=max(m,i-max(l[k+2],l[k-1]))\r\n l[k]=i;\r\nprint(m)", "import sys\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\n\r\ni = 0\r\nmn = a[0]\r\nmx = a[0]\r\nl = 0\r\nans = 0\r\nwhile i < n:\r\n mn = min(mn, a[i])\r\n mx = max(mx, a[i])\r\n if abs(mn - a[i]) > 1 or abs(mx - a[i]) > 1:\r\n if l > ans:\r\n ans = l\r\n j = i\r\n mn = mx = a[i]\r\n while(abs(a[j] - a[i]) <= 1):\r\n mn = min(mn, a[j])\r\n mx = max(mx, a[j])\r\n j -= 1;\r\n i = j\r\n l = 0\r\n else:\r\n l += 1\r\n i += 1\r\nif l > ans:\r\n ans = l\r\nprint(ans)", "ans=0\r\nw=-1\r\na=int(input())\r\nq=list(map(int,input().split()))\r\ns={}\r\nfor i in range(a):\r\n while w+1<a and (q[w+1] in s or len(s)<2):\r\n if q[w+1] in s:\r\n s[q[w+1]]+=1\r\n else:\r\n s[q[w+1]]=1\r\n w+=1\r\n s[q[i]]-=1\r\n if s[q[i]]==0:\r\n s.pop(q[i])\r\n ans=max(ans,w-i)\r\nprint(ans+1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nM = i = 1; a = b = l = 0\r\nwhile i < n:\r\n e= arr[i]-arr[i-1]\r\n if e:\r\n if e == a:l = b+1\r\n b = i-1; a = arr[i]-arr[i-1]\r\n M = max(M, i-l+1); i += 1\r\nprint(M)\r\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncnt = [0] * 100001\r\nl = 0\r\nr = 0\r\ndiff = 0\r\nans = 1\r\n\r\nwhile r < n:\r\n if cnt[a[r]] == 0:\r\n diff += 1\r\n cnt[a[r]] += 1\r\n \r\n while l < n and diff > 2:\r\n cnt[a[l]] -= 1\r\n if cnt[a[l]] == 0:\r\n diff -= 1\r\n l += 1\r\n \r\n ans = max(ans, r - l + 1)\r\n r += 1\r\nprint(ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncount_dict = {}\r\nmax_count = 0\r\n\r\nfor element in arr:\r\n new_count_dict = {}\r\n new_count_dict[element - 0.5] = count_dict.get(element - 0.5, 0) + 1\r\n new_count_dict[element + 0.5] = count_dict.get(element + 0.5, 0) + 1\r\n max_count = max(max_count, new_count_dict[element - 0.5], new_count_dict[element + 0.5])\r\n count_dict = new_count_dict\r\n\r\nprint(max_count)\r\n", "import sys\r\nfrom collections import Counter\r\n\r\n# region fastio\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nsint = lambda: int(input())\r\nmint = lambda: map(int, input().split())\r\nints = lambda: list(map(int, input().split()))\r\n# print = lambda d: sys.stdout.write(str(d) + \"\\n\")\r\n# endregion fastio\r\n\r\n# # region interactive\r\n# def printQry(a, b) -> None:\r\n# sa = str(a)\r\n# sb = str(b)\r\n# print(f\"? {sa} {sb}\", flush = True)\r\n\r\n# def printAns(ans) -> None:\r\n# s = str(ans)\r\n# print(f\"! {s}\", flush = True)\r\n# # endregion interactive\r\n\r\n# # region dfsconvert\r\n# from types import GeneratorType\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# # endregion dfsconvert\r\n\r\n# MOD = 998244353\r\n# MOD = 10 ** 9 + 7\r\n# DIR = ((-1, 0), (0, 1), (1, 0), (0, -1))\r\n\r\ndef solve() -> None: \r\n n = sint()\r\n nums = ints()\r\n cnt = Counter()\r\n ans = l = k = 0\r\n for r in range(n):\r\n cnt[nums[r]] += 1\r\n if cnt[nums[r]] == 1: k += 1\r\n while k > 2:\r\n cnt[nums[l]] -= 1\r\n if cnt[nums[l]] == 0: k -= 1\r\n l += 1\r\n ans = max(ans, r - l + 1)\r\n print(ans) \r\n\r\nsolve()", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nminval,maxval=l[0],l[0]\r\nminlast,maxlast=0,0\r\nlongest=1\r\nstart,end=0,1\r\nindex={l[start]:0}\r\nwhile(end<n):\r\n f=-1\r\n if l[end]<=minval:\r\n index[l[end]]=end\r\n minval=l[end]\r\n minlast=end\r\n f=0\r\n elif l[end]>=maxval:\r\n index[l[end]]=end\r\n maxval=l[end]\r\n maxlast=end\r\n f=1\r\n if (maxval-minval)<=1:\r\n longest=max(longest,end-start+1)\r\n end+=1\r\n else:\r\n if f==1:\r\n start=index[minval]+1\r\n minval=l[start]\r\n else:\r\n start=index[maxval]+1\r\n maxval=l[start]\r\nprint(longest)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nans = 1\r\npos = 0\r\nj = 0\r\ntemp = 0\r\nfor i in range(n):\r\n if a[i]-a[i-1]!=0:\r\n if a[i]-a[i-1]==temp:\r\n j = pos\r\n temp = a[i]-a[i-1]\r\n pos = i\r\n ans = max(ans, i-j+1)\r\nprint(ans)\r\n", "nums = int(input())\narrNums = list(map(int,input().split()))\nmaxline = 0\nflag1 = 1\nleft = 0\nk = 0\nwhile left < nums:\n flag2 = 1\n cnt = []\n cnt.append(arrNums[left])\n for j in range(left,nums):\n if arrNums[j] != arrNums[left] and flag2 == 1: # kiểm tra để giảm số lần lặp while \n flag2 = 0\n k = j\n if arrNums[j] not in cnt:\n cnt.append(arrNums[j])\n if len(cnt) == 3:\n if maxline < (j - left):\n maxline = j - left\n break\n if j == nums - 1: # khi xét đến cuối chuỗi max - min vẫn <= 1\n if maxline < (nums - left):\n maxline = nums - left\n flag1 = 0\n break\n left = k\n if flag1 == 0:\n break\nprint(maxline)", "szamok = int(input())\r\nsorozat = [int(x) for x in input().split()]\r\nfirst = 1\r\nlast = 0\r\nvalt = 0\r\nmx = 0\r\ndif = [sorozat[last], sorozat[first]]\r\n#print(sorozat)\r\nwhile first < len(sorozat):\r\n #print(dif)\r\n while first < len(sorozat) and (sorozat[first] == dif[0] or sorozat[first] == dif[1]):\r\n if sorozat[first-1] != sorozat[first]:\r\n valt = first\r\n first = first + 1\r\n if first - last > mx:\r\n mx = first - last\r\n #print(last, first)\r\n last = valt\r\n if first < len(sorozat):\r\n dif = [sorozat[last], sorozat[first]]\r\n \r\nprint(mx)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ndct = dict()\r\ndct[arr[0]] = 1\r\n\r\nstart = 0\r\nend = 1\r\nans = float('-inf')\r\n\r\nwhile end < n:\r\n\r\n if len(dct) == 3:\r\n dct[arr[start]] -= 1\r\n\r\n if dct[arr[start]] == 0:\r\n dct.pop(arr[start])\r\n start += 1\r\n else:\r\n if end < n and arr[end] in dct:\r\n dct[arr[end]] += 1\r\n elif end < n:\r\n dct[arr[end]] = 1\r\n\r\n end += 1\r\n\r\n if len(dct) <= 2:\r\n ans = max(ans, sum(dct.values()))\r\n\r\nprint(ans)", "n = int(input())\r\nb = list(map(int, input(). split()))\r\ny = 1\r\nwhile y < n and b[y - 1] == b[0]:\r\n y += 1\r\nif b[0] > b[y - 1]:\r\n mn_i = y - 1\r\n mn_i1 = y - 1\r\n mx_i = 0\r\n mx_i1 = y - 2\r\nelse:\r\n mn_i = 0\r\n mn_i1 = y - 2\r\n mx_i = y - 1\r\n mx_i1 = y - 1\r\nmn = min(b[y - 2], b[y - 1])\r\nmx = max(b[y - 2], b[y - 1])\r\nans = y\r\nfor i in range(y, n):\r\n if b[i] == mx + 1:\r\n mx, mn = b[i], mx\r\n mn_i = mn_i1 + 1\r\n mn_i1 = mx_i1\r\n mx_i = mx_i1 = i\r\n elif b[i] == mn - 1:\r\n mx, mn = mn, b[i]\r\n mx_i = mx_i1 + 1\r\n mx_i1 = mn_i1\r\n mn_i = mn_i1 = i\r\n if b[i] == mn:\r\n mn_i1 = i\r\n else:\r\n mx_i1 = i\r\n ans = max(ans, i - min(mx_i, mn_i) + 1)\r\nprint(ans)", "n = int(input())\r\narray = list(map(int, input().split()))\r\n\r\nl = 0\r\nr = 0\r\nans = 0\r\nmaximum = array[0]\r\nminimum = array[0]\r\n\r\n\r\nwhile r < n: #5 4 5 5 6 7 8 8 8 7 6 l = 3, r = 4, ans = 4, max = 6, min = 5\r\n\tmaximum = max(maximum, array[r])\r\n\tminimum = min(minimum, array[r])\r\n\r\n\tif maximum - minimum > 1:\r\n\t\tl=r-1\r\n\t\twhile l > 0:\r\n\t\t\tif array[l-1] == minimum:\r\n\t\t\t\tminimum = array[l]\r\n\t\t\t\tbreak\r\n\t\t\tif array[l-1] == maximum:\r\n\t\t\t\tmaximum = array[l]\r\n\t\t\t\tbreak\r\n\t\t\tl-=1\r\n\r\n\tans = max(ans, r-l+1)\r\n\tr+=1\r\n\r\nprint(ans)\r\n\r\n\r\n", "def main():\r\n\r\n N = int(input())\r\n points = list(map(int, input().split()))\r\n\r\n\r\n # the strategy: 2 pointer\r\n\r\n left = 0\r\n right = 0\r\n minimum = 100001\r\n maximum = 0\r\n \r\n currentLength = 0\r\n maximumLength = 0\r\n\r\n while right != N:\r\n state = False\r\n if points[right] > maximum:\r\n state = False\r\n maximum = points[right]\r\n\r\n if points[right] < minimum:\r\n state = True\r\n minimum = points[right]\r\n\r\n if maximum - minimum > 1:\r\n for i in range(left, right):\r\n if state:\r\n if points[i] - minimum > 1:\r\n left = i + 1\r\n else:\r\n if maximum - points[i] > 1:\r\n left = i + 1\r\n if state:\r\n maximum = minimum + 1\r\n else:\r\n minimum = maximum - 1\r\n\r\n # print(points[right], minimum, maximum)\r\n currentLength = right - left + 1\r\n if maximum - minimum <= 1 and maximumLength < currentLength:\r\n maximumLength = currentLength\r\n right += 1\r\n\r\n print(maximumLength)\r\n return True\r\n\r\nmain()", "from typing import *\r\nfrom heapq import *\r\n\r\n\r\ndef solve(arr: List[int]) -> int:\r\n l = r = 0\r\n small = []\r\n large = []\r\n ans = 1\r\n n = len(arr)\r\n while r < n:\r\n heappush(small, (arr[r], r))\r\n heappush(large, (-arr[r], r))\r\n while small[0][1] < l:\r\n heappop(small)\r\n while large[0][1] < l:\r\n heappop(large)\r\n\r\n if -large[0][0] - small[0][0] > 1:\r\n l += 1\r\n else:\r\n ans = max(ans, r - l + 1)\r\n r += 1\r\n return ans\r\n\r\n\r\nn = input()\r\narr = [int(x) for x in input().split()]\r\nprint(solve(arr))\r\n", "n = int(input())\nans = -1\np = [0] * 100003\nar = input().split()\nfor i in range(1, n+1):\n x = int(ar[i-1])\n if p[x-1] > p[x+1]:\n ans = max(ans, i - max(p[x+1], p[x-2]))\n else:\n ans = max(ans, i - max(p[x-1], p[x+2]))\n p[x] = i\n\nprint(ans)\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\ncnt = [0] * 100001\r\n\r\nl = res = count = 0\r\nfor r in range(n):\r\n if (cnt[a[r]] == 0):\r\n count += 1\r\n cnt[a[r]] += 1\r\n while count > 2:\r\n cnt[a[l]] -= 1\r\n if cnt[a[l]] == 0:\r\n count -= 1\r\n l += 1\r\n res = max(res, r - l + 1)\r\n\r\nprint(res)\r\n", "\r\ndef solve(n):\r\n a=list(map(int,input().split()))\r\n res=1\r\n \r\n l = 0\r\n ldff = 0\r\n p = 0\r\n for i in range(1,n):\r\n if a[i]!=a[i-1]:\r\n if a[i]-a[i-1]==ldff:\r\n l = p\r\n ldff = a[i]-a[i-1]\r\n p = i\r\n res = max(res,i-l+1)\r\n print(res)\r\n \r\nn=int(input())\r\n# n,k=map(int,input().split())\r\nsolve(n)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nc = 0\r\n\r\nfor i in range(len(s))[n::n]:\r\n if s[i-1] == s[i-2] == s[i-3]:\r\n c += 1\r\nprint(c)", "s, n, t = 0, int(input()), input()\r\nprint(sum(t[i] == t[i + 1] == t[i + 2] for i in range((3 // n + 1) * n - 3, len(t) - 3, n)))", "cnt, n, ans = 1, int(input()), 0\r\ns = input()\r\nfor i in range(1, len(s)):\r\n\tif cnt == 0 and s[i - 1] == s[i - 2] == s[i - 3]:\r\n\t\tans += 1\r\n\tcnt += 1\r\n\tif cnt == n:\r\n\t\tcnt = 0\r\nprint(ans)", "s, n, t = 0, int(input()), input()\r\nprint(sum(t[i - 3: i] in ['aaa', 'bbb'] for i in range((3 // n + 1) * n , len(t), n)))", "#!/usr/bin/env python3\nn = int(input())\ns = list(input())\nans = 0\nfor i in range(0, len(s), n):\n if i-3 >= 0:\n if s[i-3] == s[i-2] == s[i-1]:\n s[i] = s[i-1]\n ans += 1\nprint(ans)\n", "n = int(input())\r\nmoves = input()\r\ni = n\r\ncount = 0\r\nwhile(i < len(moves)):\r\n m = moves[i - 1] \r\n if(m == moves[i - 2] and m == moves[i - 3] and m == moves[i - 3]):\r\n count += 1\r\n i += n\r\nprint(count)", "n = int(input())\r\ns = input()\r\nc = 0 \r\nfor i in range(n,len(s),n):\r\n tmp = s[i-3:i] \r\n if 'a'in tmp and 'b' in tmp :\r\n continue\r\n c+=1\r\nprint(c)", "n = int(input())\ns = input()\n\nans = 0\n\nfor i in range(1, (len(s) - 1)//n + 1):\n ans += int(s[n*i-3:n*i] in ('aaa', 'bbb'))\n\nprint(ans)\n", "n=int(input())\r\nf=input()\r\nlist(f)\r\nout=0\r\nfor i in range(n,len(f),n):\r\n if(f[i-1]==f[i-2] and f[i-2] == f[i-3]):\r\n out=out+1\r\nprint(out)", "import math\r\n\r\n\r\nclass CodeforcesTask332ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.players = 0\r\n self.game = ''\r\n\r\n def read_input(self):\r\n self.players = int(input())\r\n self.game = [x for x in input()]\r\n\r\n def process_task(self):\r\n for x in range(len(self.game) // self.players + int(math.ceil((len(self.game) % self.players) / self.players))):\r\n self.game[x * self.players] = \"_\"\r\n game = \"\".join(self.game)\r\n self.result = str(game.count(\"bbb_\") + game.count(\"aaa_\"))\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask332ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "n=int(input())\r\ns=input()\r\na,b=n,0\r\nwhile a<len(s):\r\n\tif s[a-1]==s[a-2]==s[a-3]:\r\n\t\tb+=1\r\n\ta+=n\r\nprint(b)\r\n", "I=input\r\nn=int(I())\r\ns=I()\r\nprint(sum(2>len(set(s[i-3:i]))for i in range(n,len(s),n)))\r\n", "n=int(input())\r\ns=input()\r\na,b=n,0\r\nwhile a<len(s):\r\n\tif s[a-3]==s[a-2]==s[a-1]:b+=1\r\n\ta+=n\r\nprint (b)", "n, s = int(input()), input()\r\nprint(sum(1 for i in range(len(s)) if i > 0 and i % n == 0 and s[i - 3:i] in ('aaa', 'bbb')))", "n = int( input() )\r\ns = input()\r\ni=n\r\nl = len(s)\r\ntot = 0\r\nwhile i<len(s):\r\n\tif s[i-1] == s[i-2] == s[i-3]:\r\n\t tot += 1\r\n\ti += n\r\nprint(tot)\r\n", "n = int(input())\r\ns = str(input())\r\n\r\nsl = len(s)\r\nd = 0\r\n\r\nfor i in range(n, sl, n):\r\n if s[i-1] == s[i-2] and s[i-1] == s[i-3]:\r\n d += 1\r\n\r\nprint(d)\r\n", "def main():\n n = int(input())\n s = input()\n print(0 if n < 4 else sum(s[i:i + 4] in ('aaaa', 'aaab', 'bbba', 'bbbb') for i in range(n - 3, len(s), n)))\n\n\nif __name__ == '__main__':\n main()", "n = int( input() )\ns = input()\ni=n\nl = len(s)\ntot = 0\nwhile i<len(s):\n\tif s[i-1] == s[i-2] == s[i-3]:\n\t tot += 1\n\ti += n\nprint(tot)\n", "n = int(input())\ns = input()\ncnt = 0\nfor i in range(len(s))[n::n]:\n if s[i-1] == s[i-2] and s[i-1] == s[i-3]:\n cnt += 1\nprint(cnt)\n", "n = int(input())\r\ns = input()\r\ni = n\r\ncount = 0\r\nwhile i<len(s):\r\n if s[i-1]==s[i-2]==s[i-3]:\r\n count+=1\r\n i+=n\r\nprint(count)", "n = int(input()) \r\ns = input()\r\nans = 0\r\nfor i in range(n, len(s), n):\r\n if s[i - 3:i] in ('aaa', 'bbb'):\r\n ans += 1\r\nprint(ans) \r\n", "n = int(input())\r\nstring = input()\r\ncount = 0\r\ni = n\r\nwhile i < len(string):\r\n flag = False\r\n if string[i - 1] == string[i - 2] and string [i - 2] == string[i - 3] and i >= 3:\r\n flag = True\r\n if flag:\r\n count += 1\r\n i += n\r\nprint(count)", "'''input\n6\naaaaaaaaaaaaaaaa\n'''\nn = int(input())\ns = input()\nt = 0\nfor x in range(n, len(s), n):\n\tif s[x-1] == s[x-2] == s[x-3]:\n\t\tt += 1\nprint(t)", "a=int(input());b=input();print(sum(b[i-1]==b[i-2]==b[i-3] for i in range(a,len(b),a)))", "s, n, t = 0, int(input()), input()\r\nprint(sum(t[i - 3] == t[i - 2] == t[i - 1] for i in range((3 // n + 1) * n , len(t), n)))", "n=int(input())\n\nA=input()\n\nif(len(A)<=n):\n print(0)\nelse:\n p=A[n-1]==A[n-2]==A[n-3]\n ans=0\n for i in range(n,len(A),n):\n p=A[i-1]==A[i-2]==A[i-3]\n if(p):\n ans+=1\n print(ans)\n", "n = int(input())\r\ns = input()\r\nl = len(s)\r\nif l < 4:\r\n print(0)\r\nelif l == 4:\r\n if n == 3:\r\n if s[0] == s[1] and s[1] == s[2]:\r\n print(1)\r\n else:\r\n print(0)\r\n else:\r\n print(0)\r\nelse:\r\n k = 0\r\n dr = 0\r\n while k + n < len(s):\r\n k += n\r\n if s[k - 1] == s[k - 2] and s[k - 2] == s[k - 3]:\r\n dr += 1\r\n print(dr)\r\n", "def drink(s, n):\r\n j, res = n, 0\r\n while j < len(s):\r\n if s[j - 1] == s[j - 2] and s[j - 2] == s[j - 3]:\r\n res += 1\r\n j += n\r\n return res\r\n\r\n\r\nm = int(input())\r\nt = input()\r\nprint(drink(t, m))\r\n", "n = int(input())\r\ns = input()\r\nres = 0\r\nfor i in range(0, len(s), n):\r\n if i >= 4 and s[i-1] == s[i-2] == s[i-3]:\r\n res += 1\r\nprint(res)\r\n", "n, s, ans = int(input()), input(), 0\r\nfor i in range(len(s)):\r\n if i > 2 and not i % n and s[i - 1] == s[i - 2] == s[i - 3]:\r\n ans += 1\r\nprint(ans)", "n = int(input())\nmoves = input()\n\nturns_vasnja = int((len(moves)-1) / n)\n\ncount = 0\nfor i in range(1, turns_vasnja+1):\n if moves[n * i - 3] == moves[n * i - 2] == moves[n * i - 1]:\n count += 1\n\nprint(count)\n", "n=int(input())\n\ns=input()\nnn=len(s)\nans=0\nfor i in range(n,nn,n):\n if(s[i-1]+s[i-2]+s[i-3]=='aaa' or s[i-1]+s[i-2]+s[i-3]=='bbb'):\n ans+=1\nprint(ans)\n", "n=int(input())\r\ns=input()\r\nk=len(s)\r\ni=0\r\nc=0\r\nwhile(i<k):\r\n if(i-3>=0):\r\n if(s[i-1]==s[i-2]):\r\n if(s[i-2]==s[i-3]):\r\n c+=1\r\n i+=n\r\nprint(c)", "n = int(input())\r\nstr = input()\r\ncnt = 0\r\nlength = len(str)\r\nfor i in range(n,length,n):\r\n if str[i-1] == str[i-2] and str[i-2] == str[i-3]:\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "n = int(input())\r\na = input()\r\nsum = 0\r\nfor i in range(0, len(a), n):\r\n if i >= 4 and a[i - 1] == a[i - 2] == a[i - 3]:\r\n sum += 1\r\nprint(sum)\r\n", "n = int(input());\ns = input();\ncnt = 0;\nfor i in range(len(s))[n::n]:\n if s[i - 1] == s[i - 2] and s[i - 2] == s[i - 3]:\n cnt += 1;\nprint(cnt);\n", "n = int(input())\r\ns = list(input())\r\nd = 0\r\nfor i in range(len(s)):\r\n if i % n == 0:\r\n if i >= 4:\r\n if s[i - 3] == s[i - 2] == s[i - 1]:\r\n d += 1\r\nprint(d)\r\n", "n = int(input())\r\ns = input().strip()\r\npl = 0\r\nans = 0\r\nfor q in range(len(s)):\r\n if q>=3 and pl==0:\r\n if s[q-3]==s[q-2]==s[q-1]:\r\n ans+=1\r\n pl = (pl+1) % n \r\nprint(ans)" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * (4 * n)\r\nfor i in range(4):\r\n f = list(input().rstrip())\r\n for j in range(n):\r\n b[i + 4 * j] = (46 - f[j]) // 4\r\nfor _ in range(4):\r\n b.append(0)\r\npow2 = [1]\r\nfor _ in range(12):\r\n pow2.append(2 * pow2[-1])\r\nm = pow2[12]\r\nm0 = m - 1\r\nx = [[pow2[4 * i + j] for i in range(3)] for j in range(4)]\r\ny = []\r\nfor k in range(3):\r\n ak = a[k]\r\n for i in range(4 - k):\r\n for j in range(3 - k):\r\n z = m0\r\n for u in range(k + 1):\r\n for v in range(k + 1):\r\n z ^= x[i + u][j + v]\r\n y.append((z, ak))\r\nz = []\r\nc = 0\r\nfor i in range(m):\r\n z0 = []\r\n for j, k in y:\r\n if (j ^ m0) & i:\r\n z0.append((i & j, k))\r\n c += 1\r\n z.append(z0)\r\ninf = pow(10, 9) + 1\r\ndp0 = [inf] * m\r\nx = 0\r\nfor i in range(12):\r\n if b[i]:\r\n x ^= pow2[i]\r\ndp0[x] = 0\r\nfor i in range(n - 2):\r\n for j in range(m0, -1, -1):\r\n if not dp0[j] ^ inf:\r\n continue\r\n dp0j = dp0[j]\r\n for k, l in z[j]:\r\n dp0[k] = min(dp0[k], dp0j + l)\r\n dp = [inf] * m\r\n dp[0] = min(dp0) + a[3]\r\n x, k = 0, 8\r\n for j in range(12 + 4 * i, 16 + 4 * i):\r\n if b[j]:\r\n x ^= pow2[k]\r\n k += 1\r\n for j in range(0, m, 16):\r\n dp[j // 16 + x] = dp0[j]\r\n dp0 = dp\r\nans = dp[0]\r\nprint(ans)" ]

[ "n, d = map(int, input().split())\r\na, b = map(int, input().split())\r\n\r\nclients = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n cost = x * a + y * b\r\n clients.append((i + 1, cost))\r\n\r\nclients.sort(key=lambda x: x[1])\r\n\r\nres = []\r\nfor client in clients:\r\n if d - client[1] >= 0:\r\n d -= client[1]\r\n res.append(client[0])\r\n else:\r\n break\r\n\r\nprint(len(res))\r\nprint(*res)", "n,d=[int(x) for x in input().split()]\r\na,b=[int(x) for x in input().split()]\r\narr=[]\r\nfor _ in range(n):\r\n arr.append([int(x) for x in input().split()]+[_+1])\r\narr.sort(key=lambda x:a*x[0]+b*x[1])\r\nans=[]\r\nfor i in arr:\r\n d-=(a*i[0]+b*i[1])\r\n if d>=0:\r\n ans.append(i[2])\r\n else:\r\n d+=(a*i[0]+b*i[1])\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i,end=' ')", "n, d = map(int, input().split())\r\na, b = map(int, input().split())\r\n\r\na2 =[]\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a2.append((a*x+y*b,i))\r\n\r\na2.sort()\r\nans = []\r\n\r\nfor i in range(n):\r\n if(a2[i][0] <= d):\r\n d -= a2[i][0]\r\n ans.append(a2[i][1])\r\n else:\r\n break\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i+1, end = \" \")\r\n", "n, d = map(int, input().split())\na, b = map(int, input().split())\npeople = []\nfor i in range(1, n+1):\n\tx, y = map(int, input().split())\n\tpeople.append((a*x + b*y, i))\npeople.sort()\npos = 0\nwhile True:\n\td -= people[pos][0]\n\tif d < 0:\n\t\tbreak\n\tpos += 1\n\tif pos == n:\n\t\tbreak\nprint(pos)\nif pos != 0:\n\tprint(' '.join(map(lambda person: str(person[1]), people[:pos])))\n", "\ndef solve(n, d, a, b, xy):\n c = [a*x+b*y for x,y in xy]\n I = sorted(range(n), key=lambda i:c[i])\n i = 0\n while i<n and c[I[i]]<=d:\n d -= c[I[i]]\n i += 1\n return [I[j] for j in range(i)]\n\nn, d = [int(_) for _ in input().split()]\na, b = [int(_) for _ in input().split()]\nxy = [] \nfor i in range(n):\n xy.append(tuple(int(_) for _ in input().split()))\nI = solve(n, d, a, b, xy)\nprint(len(I))\nprint(\" \".join(str(i+1) for i in I))\n \n", "inp = [int(x) for x in input().split()]\r\nn = inp[0]\r\nd = inp[1]\r\nsize = [int(x) for x in input().split()]\r\nlowSize = size[0]\r\nhighSize = size[1]\r\nsizeByCustomer = []\r\nfor i in range(n):\r\n photosCount = [int(x) for x in input().split()]\r\n photosLowCount = photosCount[0]\r\n photosHighCount = photosCount[1]\r\n totalSize = photosLowCount * lowSize + photosHighCount * highSize\r\n sizeByCustomer.append([totalSize, i+1])\r\nsizeByCustomer.sort(key = lambda x: x[0])\r\ncanContinue = True\r\ni = 0\r\nresult = []\r\nwhile canContinue and i < n:\r\n if d - sizeByCustomer[i][0] >= 0:\r\n result.append(str(sizeByCustomer[i][1]))\r\n d -= sizeByCustomer[i][0]\r\n i += 1\r\n else:\r\n canContinue = False\r\nprint(len(result))\r\nprint(' '.join(result))", "q, mem = map(int, input().split())\nlow, high = map(int, input().split())\nd = {}\nfor i in range(q):\n\ta, b = map(int, input().split())\n\tm = a*low + b*high\n\t# print(a, b, \"-\", m)\n\tif m not in d:\n\t\td[m] = []\n\td[m].append(i+1)\nres = []\nfor i in sorted(d.keys()):\n\tfor value in d[i]:\n\t\t# print(i, value)\n\t\tif mem-i >=0:\n\t\t\tmem-=i\n\t\t\tres.append(value)\nprint(len(res))\nprint(*res)\n \t \t\t\t\t\t \t \t \t\t\t\t\t \t\t\t\t\t \t", "R = lambda: map(int, input().rstrip().split())\nn, d = R()\na, b = R()\nl = []\nfor i in range(n):\n x, y = R()\n cost = x * a + y * b\n l.append([i + 1, cost])\nl.sort(key=lambda x: x[1])\nt = 0\ncost = 0\ni = 0\nwhile i < n:\n if cost + l[i][1] <= d:\n cost += l[i][1]\n i += 1\n t += 1\n else:\n break\nprint(t)\nfor i in range(t):\n print(l[i][0], end=\" \")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 9 21:10:35 2020\r\n\r\n@author: mahedi\r\n\"\"\"\r\n\r\nR=lambda:list(map(int,input().split()))\r\nn,d=R()\r\na,b=R()\r\nlst1=[]\r\nlst2=[]\r\nlst3=[]\r\nsum=0\r\ncnt=1\r\nfor i in range(0,n):\r\n x,y=R()\r\n p=(x*a)+(y*b)\r\n lst1.append(p)\r\n lst2.append(i)\r\niteams=list(zip(lst1,lst2))\r\niteams.sort()\r\nfor i in range(0,n):\r\n sum=sum+iteams[i][0]\r\n if sum<=d:\r\n lst3.append(iteams[i][1]+1)\r\n cnt=cnt+1\r\nprint(len(lst3))\r\nprint(*lst3)\r\n \r\n", "n,d=map(int,input().split())\r\na,b=map(int,input().split())\r\nl=[]\r\nfor g in range(n):\r\n j,k=map(int,input().split())\r\n l.append([j*a+k*b,g+1])\r\n\r\n\r\n\r\n \r\nl1=sorted(l)\r\n\r\ncnt=0\r\nidx=[]\r\nfor i in l1:\r\n if(i[0]<=d):\r\n cnt+=1\r\n d-=i[0]\r\n idx.append(i[1])\r\n\r\nprint(cnt)\r\nfor i in idx:\r\n print(i,end=\" \")\r\n ", "\r\n\r\nn,d = list(map(int, input().split()))\r\na,b = list(map(int, input().split()))\r\nres = []\r\nfor i in range(n):\r\n x,y = list(map(int,input().split()))\r\n res.append((x,y,i+1))\r\n\r\nres.sort(key = lambda x: ((a*x[0])+(b*x[1])))\r\n\r\noutput = []\r\nfor x,y,idx in res:\r\n if (a*x)+(b*y) <= d:\r\n d -= (a*x)+(b*y) \r\n output.append(idx)\r\n else:\r\n break\r\n\r\nprint(len(output))\r\nfor i in output:\r\n print(i, end=\" \")\r\nprint()\r\n", "n, d = map(int, input().split())\r\na, b = map(int, input().split())\r\n\r\nclients = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n memory_required = x * a + y * b\r\n clients.append((memory_required, i+1))\r\n\r\nclients.sort()\r\n\r\nserved_clients = []\r\nmemory_used = 0\r\nfor memory_required, client_id in clients:\r\n if memory_used + memory_required <= d:\r\n served_clients.append(client_id)\r\n memory_used += memory_required\r\n\r\nprint(len(served_clients))\r\nprint(*served_clients)", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\nn,d = map(int,input().split(\" \"))\r\na,b = map(int,input().split(\" \"))\r\nc,ans,mem = [],[],0\r\nfor i in range(1,n+1):\r\n x,y = map(int,input().split(\" \"))\r\n x *= a\r\n y *= b\r\n tot = x+y\r\n c.append([tot,i])\r\nc.sort(key=lambda x:x[0])\r\nfor i in range(len(c)):\r\n if mem+c[i][0] <= d:\r\n mem += c[i][0]\r\n ans.append(c[i][1])\r\nprint(len(ans))\r\nprint(*ans)", "from functools import reduce\nfrom operator import *\nfrom math import *\nfrom sys import *\nfrom string import *\nfrom collections import *\nsetrecursionlimit(10**7)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nRI=lambda: list(map(int,input().split()))\nRS=lambda: input().rstrip().split()\n#################################################\nn,d = RI()\na,b = RI()\nvals=[0]*n\nans=[]\nfor i in range(n):\n x,y = RI()\n vals[i]= (x*a + y*b, i+1)\nvals.sort()\ni=0\nwhile i<n and d>=vals[i][0]:\n ans.append(vals[i][1])\n d-=vals[i][0]\n i+=1\nprint(i)\nprint(*ans)\n\n\n\n", "lst=list(map(int,input().split()))\r\nn=lst[0]\r\nd=lst[1]\r\nlst=list(map(int,input().split()))\r\na=lst[0]\r\nb=lst[1]\r\nans=[]\r\nfor x in range(0,n):\r\n lst = list(map(int, input().split()))\r\n ans.append([lst[0]*a+lst[1]*b,x+1])\r\nans.sort()\r\nsum=0\r\ni=0\r\nfor s in range(0,n):\r\n i+=1\r\n sum+=ans[s][0]\r\n if sum>d:\r\n i-=1\r\n sum-=ans[s][0]\r\n break\r\nprint(i)\r\nfor f in range(0,i):\r\n print(ans[f][1],\" \", end=\"\")", "n,d = map(int,input().split())\r\na,b = map(int,input().split())\r\nreq=[[]]*(n)\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n req[i] = [x*a+y*b,i+1]\r\nreq.sort()\r\nnumbers=[]\r\n\r\ncount=0\r\nfor i in req:\r\n if(d>=i[0]):\r\n d-=i[0]\r\n numbers.append(i[1])\r\n count+=1\r\n else:\r\n break\r\nprint(count)\r\nprint(*numbers)\r\n", "def readln(): return tuple(map(int, input().split()))\n\nn, d = readln()\na, b = readln()\nlst = []\nfor _ in range(n):\n x, y = readln()\n lst.append((a * x + b * y, _ + 1))\nlst.sort()\nans = []\ns = 0\nfor v, i in lst:\n if s + v > d:\n break\n s += v\n ans.append(i)\nprint(len(ans))\nprint(*ans)\n", "# _\r\n#####################################################################################################################\r\n\r\ndef main():\r\n nClients, memory = map(int, input().split())\r\n sizeOfLowQuality, sizeOfHighQuality = map(int, input().split())\r\n multiplier = sizeOfHighQuality/sizeOfLowQuality\r\n memory /= sizeOfLowQuality\r\n\r\n clients_Demands = [(totalMemoryOf(*map(int, input().split()), multiplier), x) for x in range(1, nClients + 1)]\r\n clients_Demands.sort()\r\n\r\n return clientsToServe(clients_Demands, memory)\r\n\r\n\r\ndef totalMemoryOf(nLowQuality, nHighQuality, multiplier):\r\n return nLowQuality + nHighQuality*multiplier\r\n\r\n\r\ndef clientsToServe(clients_Demands, memory):\r\n clients = []\r\n for order in clients_Demands:\r\n memory -= order[0]\r\n if memory < 0:\r\n break\r\n clients.append(order[1])\r\n\r\n return f'{len(clients)}\\n{\" \".join(map(str, clients))}'\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n # main()\r\n", "from sys import stdin\r\n\r\n\r\ndef arr_inp(n):\r\n if n == 1:\r\n return [int(x) for x in stdin.readline().split()]\r\n elif n == 2:\r\n return [float(x) for x in stdin.readline().split()]\r\n else:\r\n return [str(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef arr_inp_enu(n):\r\n return [[i, arr_inp(1)] for i in range(1, n + 1)]\r\n\r\n\r\ndef add(d):\r\n for i in range(n):\r\n arr[i][1][0] *= a\r\n arr[i][1][1] *= b\r\n arr.sort(key=lambda x: x[1][0] + x[1][1])\r\n\r\n ans = []\r\n for i in range(n):\r\n s = sum(arr[i][1])\r\n if s <= d:\r\n d -= s\r\n ans.append(arr[i][0])\r\n else:\r\n break\r\n print(len(ans))\r\n print(*ans)\r\n\r\n\r\nn, d = arr_inp(1)\r\na, b = arr_inp(1)\r\narr = arr_inp_enu(n)\r\nadd(d)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, s = map(int, input().split())\r\na, b = map(int, input().split())\r\nd = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n d.append((x*a+y*b, i+1))\r\nd.sort()\r\nans = []\r\nc = 0\r\nfor i in range(n):\r\n if c + d[i][0] > s:\r\n break\r\n else:\r\n c += d[i][0]\r\n ans.append(d[i][1])\r\n\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))", "n, d = map(int, input().split())\nd1, d2 = map(int, input().split())\ndatos = []\nfor i in range(n):\n a, b = map(int, input().split())\n datos.append((a*d1 + b*d2, i+1))\ndatos = sorted(datos)\nposiciones = \"\"\ncont = 0\nacum = 0\nres = []\nfor x in datos:\n if(x[0] <= d):\n res.append(x[1])\n d -= x[0] \n else:\n break \nprint(len(res))\nprint(' '.join(map(str,res)))\n\t \t \t\t \t \t \t\t\t\t\t \t\t \t\t \t", "master=[]\nn,total=map(int,input().split())\na,b=map(int,input().split())\nfor t in range(1,n+1):\n\tone,two=map(int,input().split())\n\tone=one*a\n\ttwo=two*b\n\tsumm=one+two\n\tmaster.append((t,summ))\nfinal=[]\nmaster.sort(key=lambda x:x[1])\nempty=0\nfor t in master:\n\tempty+=(t[1])\n\tif empty>total:\n\t\tbreak\n\telse:\n\t\tfinal.append(t[0])\nprint (len(final))\nk=' '.join(map(str,final))\nprint (k)\n\t\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\nn,d=map(int,input().split())\r\na,b=map(int,input().split())\r\ncost=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n cost.append((x*a+y*b,i+1))\r\ncost.sort(key=lambda x:x[0])\r\n\r\nans=[]\r\nfor c,i in cost:\r\n if c<=d:\r\n d-=c\r\n ans.append(i)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "n,d=map(int, input().split())\r\na,b=map(int, input().split())\r\n\r\ndic={}\r\n\r\nfor i in range(1,n+1):\r\n x,y=map(int, input().split())\r\n dic[i]=a*x+b*y\r\nl=[]\r\ndic=sorted(dic.items(), key=lambda kv:(kv[1], kv[0]))\r\nfor i in range(len(dic)):\r\n if(d<0):\r\n break\r\n elif(d-dic[i][1]<0):\r\n break\r\n d-=dic[i][1]\r\n l.append(dic[i][0])\r\nprint(len(l))\r\nfor i in l:\r\n print(i, end=' ')\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,d=(int(i) for i in input().split())\r\na,b=(int(i) for i in input().split())\r\nl=[]\r\nfor i in range(n):\r\n x,y=(int(i) for i in input().split())\r\n l.append(x*a+y*b)\r\nd1={}\r\nfor i in range(n):\r\n if(l[i] in d1):\r\n d1[l[i]].append(i+1)\r\n else:\r\n d1[l[i]]=[i+1]\r\nc=0\r\ns1=0\r\nans=[]\r\ns=set(l)\r\nl1=sorted(list(s))\r\nfor i in l1:\r\n if(s1+i>d):\r\n break\r\n else:\r\n for j in d1[i]:\r\n if(s1+i<=d):\r\n s1+=i\r\n c+=1\r\n ans.append(j)\r\n else:\r\n break\r\nprint(c)\r\nprint(*ans)", "from sys import *\r\ninp = lambda : stdin.readline()\r\n\r\ndef main():\r\n n,d = map(int,inp().split())\r\n a,b = map(int,inp().split())\r\n l,ans = [],[]\r\n for i in range(n):\r\n x,y = map(int,inp().split())\r\n l.append((x*a+y*b,i+1))\r\n l = sorted(l)\r\n for i in l:\r\n if i[0] <= d:\r\n ans.append(i[1])\r\n d -= i[0]\r\n print(len(ans))\r\n print(' '.join(map(str,ans)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "I=lambda:map(int,input().split())\r\nR=range\r\nn,d=I()\r\na,b=I()\r\nm=[]\r\nv=[]\r\nfor i in R(n):x,y=I();v+=[x*a+y*b];m+=[i]\r\nm=sorted(m,key=lambda x:v[x])\r\nfor i in R(n):\r\n\tif v[m[i]]>d:n=i;break\r\n\td-=v[m[i]]\r\nprint(n)\r\nfor i in R(n):print(m[i]+1,end=' ')", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n\r\n'''\r\n\r\n\r\n\r\nn,capacity=map(int,input().split())\r\n\r\na,b=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n f,s=map(int,input().split())\r\n l.append([f*a+b*s,i+1])\r\n \r\nl.sort()\r\ni=0\r\nans=[]\r\nwhile i<n and capacity>=l[i][0]:\r\n ans.append(l[i][1])\r\n \r\n capacity-=l[i][0]\r\n i+=1\r\nprint(len(ans))\r\nfor ele in ans: print(ele, end=\" \")\r\n \r\n\r\n", "n,d=map(int,input().split())\r\na,b=map(int,input().split())\r\nx=[]\r\nfor i in range(n):\r\n q,w=map(int,input().split())\r\n x.append([q,w,i+1])\r\nx.sort(key=lambda i:a*i[0]+b*i[1])\r\nz=[]\r\ns=0\r\nfor i in range(n):\r\n if s+a*x[i][0]+b*x[i][1]<=d:\r\n s=s+a*x[i][0]+b*x[i][1]\r\n z.append(x[i][2])\r\nprint(len(z))\r\nfor i in z:\r\n print(i,end=\" \")\r\n", "R=lambda:map(int,input().split())\r\nn,d=R()\r\na,b=R()\r\ndef get():\r\n x,y=R()\r\n return a*x+b*y\r\ns=sorted([(get(),i) for i in range(1,n+1)])\r\n#print(s)\r\nans=[]\r\nfor i in range(n):\r\n if d>=s[i][0]:\r\n ans+=[s[i][1]]\r\n d-=s[i][0]\r\n else:\r\n break\r\nprint(len(ans))\r\nprint(*ans)\r\n", "I = lambda : map(int, input().split())\r\n\r\nn, d = I()\r\na, b = I()\r\nl = []\r\nc = 0\r\nans = []\r\n\r\nfor i in range(n):\r\n x, y = I()\r\n l.append([(x*a) + (y*b), i+1])\r\n\r\nl.sort(key = lambda x: x[0])\r\n\r\nfor i in range(n):\r\n v, j = l[i]\r\n if d - v > -1:\r\n d -= v\r\n c += 1\r\n ans.append(j)\r\n else:\r\n break\r\n\r\nprint(c)\r\nprint(*ans)", "n,d=map(int,input().split())\r\na,b=map(int,input().split())\r\ns=[None]*n\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n s[i]=[a*x+b*y,i+1]\r\ns.sort()\r\nres=[]\r\nfor i in range(n):\r\n if d-s[i][0] >= 0:\r\n res.append(s[i][1])\r\n d-=s[i][0]\r\n else:\r\n break\r\nprint (str(len(res))+\"\\n\" + \" \".join(map(str,res)))\r\n", "n, d = map(int, input().split())\r\na, b = map(int, input().split())\r\nt = [0] * n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n t[i] = (a * x + b * y, i)\r\nt.sort()\r\nj, s = n, 0\r\nfor i in range(n):\r\n s += t[i][0]\r\n if s > d:\r\n j = i\r\n break\r\nprint(j)\r\nprint(' '.join(str(t[i][1] + 1) for i in range(j)))", "n , d = map(int,input().split())\r\nlis=[]\r\naa=[]\r\nm1,m2=map(int,input().split())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n lis.append([m1*a+m2*b,i+1])\r\nlis.sort()\r\nans=0\r\nfor i in range(n):\r\n if lis[i][0]+ans<=d:\r\n ans+=lis[i][0]\r\n aa.append(lis[i][1])\r\nprint(len(aa))\r\nprint(*aa) \r\n", "n,d=map(int,input().split())\r\na,b=map(int,input().split())\r\nsum=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n sum.append((a*x+y*b,i))\r\nsum.sort()\r\nans=[]\r\ncount=0\r\nfor i in range(n):\r\n if count+sum[i][0]>d:\r\n break\r\n else:\r\n ans.append(sum[i][1])\r\n count+=sum[i][0]\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i+1,end=' ')", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, d = map(int, input().split())\r\na, b = map(int, input().split())\r\nh = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n heapq.heappush(h, (x * a + y * b, i + 1))\r\nans = []\r\nwhile h and h[0][0] <= d:\r\n u, i = heapq.heappop(h)\r\n ans.append(i)\r\n d -= u\r\nm = len(ans)\r\nprint(m)\r\nsys.stdout.write(\" \".join(map(str, ans)))", "import sys\r\nimport math\r\n\r\nn, z = [int(x) for x in (sys.stdin.readline()).split()]\r\na, b = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nv = []\r\nfor i in range(n):\r\n x, y = [int(x) for x in (sys.stdin.readline()).split()]\r\n v.append((x * a + y * b, i + 1))\r\n \r\nv.sort(key = lambda x: x[0])\r\n\r\nres = 0\r\nk = []\r\nfor i in range(n):\r\n if(z - v[i][0] >= 0):\r\n res += 1\r\n k.append(str(v[i][1]))\r\n z -= v[i][0]\r\n else:\r\n break\r\n \r\nprint(res)\r\nprint(\" \".join(k))", "n,d=map(int,input().split())\r\na,b=map(int,input().split())\r\nans=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n ans.append([x*a+y*b,i+1])\r\nans.sort()\r\nnans=[]\r\nfor i in range(len(ans)):\r\n if d>=ans[i][0]:\r\n nans.append(ans[i][1])\r\n d=d-ans[i][0]\r\n else:\r\n break\r\nprint(len(nans))\r\nprint(*nans)\r\n \r\n \r\n \r\n ", "n, d = map(int,input().split())\r\na, b = map(int,input().split())\r\nl = []\r\nfor i in range(1,n+1):\r\n\ta1, b1 = map(int,input().split())\r\n\tl.append([a1*a + b1*b, i])\r\nl.sort()\r\ntemp = d\r\nans = []\r\nfor i in l:\r\n\tif i[0] <= temp:\r\n\t\tans.append(i[1])\r\n\t\ttemp -= i[0]\r\n\telse:\r\n\t\tbreak\r\nprint(len(ans))\r\nprint (*ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nclass Order:\r\n\r\n def __init__(self, n, cost):\r\n self.number = n\r\n self.cost = cost\r\n\r\n\r\nn, storage = map(int, input().split())\r\na, b = map(int, input().split())\r\n\r\norders = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n orders.append(Order(i + 1, x * a + y * b))\r\n\r\norders.sort(key=lambda a: a.cost)\r\n\r\n\r\ns = []\r\nnumber = 0\r\nfor order in orders:\r\n if storage - order.cost >= 0:\r\n number += 1\r\n storage = storage - order.cost\r\n s.append(order.number)\r\n else:\r\n break\r\n\r\n\r\nprint(number)\r\nprint(*s)\r\n\r\n\r\n\r\n", "import re\nimport itertools\nfrom collections import Counter, deque\n\nclass Task:\n memory, a, b, = [0] * 3\n clients = []\n answer = []\n\t\n def getData(self):\n n, self.memory = [int(x) for x in input().split(' ')]\n self.a, self.b = [int(x) for x in input().split(' ')]\n for i in range(1, n + 1):\n self.clients += [[i] + [int(x) for x in input().split(' ')]]\n #inFile = open('input.txt', 'r')\n #inFile.readline().rstrip()\n #self.childs = inFile.readline().rstrip()\n\n def solve(self):\n self.clients.sort(key = self.clientRequiredMemory)\n for current in self.clients:\n requiredMemory = current[1] * self.a + current[2] * self.b\n if requiredMemory <= self.memory:\n self.memory -= requiredMemory \n self.answer += [current[0]]\n else:\n break\n\n def clientRequiredMemory(self, client):\n return client[1] * self.a + client[2] * self.b\n\n def printAnswer(self):\n print(len(self.answer))\n print(re.sub('[\\[\\],]', '', str(self.answer)))\n #outFile = open('output.txt', 'w')\n #outFile.write(self.answer)\n\ntask = Task()\ntask.getData()\ntask.solve()\ntask.printAnswer()\n", "n, d = map(int, input().split())\r\nd1, d2 = map(int, input().split())\r\narr = [0] * n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n arr[i] = [d1*a + d2*b, i+1]\r\narr.sort()\r\nres, idx = 0, ''\r\nfor i in arr:\r\n if d - i[0] < 0:\r\n break\r\n d -= i[0]\r\n res += 1\r\n idx += str(i[1]) + ' '\r\nprint(res)\r\nprint(idx)\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\nfrom math import*\r\n\r\nn,d=map(int,input().split())\r\na,b=map(int,input().split())\r\nprice=[]\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\tprice.append([x*a+y*b,i+1])\r\n\r\nprice.sort()\r\n#print(price)\r\nans=[]\r\ns=0\r\ni=0\r\nwhile i<n:\r\n\ts+=price[i][0]\r\n\tif s<=d:\r\n\t\tans.append(price[i][1])\r\n\telse:\r\n\t\tbreak\r\n\ti+=1\r\nprint(len(ans))\r\nfor x in ans:\r\n\tprint(x,end=' ')\r\n" ]

[ "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\n# Минимальное и максимальное количество пассажиров в автобусе до первой остановки\r\nmin_p = max_p = 0\r\ncur_p = 0 # Текущее количество пассажиров в автобусе\r\n\r\nfor i in range(n):\r\n cur_p += a[i]\r\n min_p = min(min_p, cur_p)\r\n max_p = max(max_p, cur_p)\r\n\r\n# Количество возможных способов сколько человек могло быть в автобусе до первой остановки\r\nans = max(0, w - max_p + min_p + 1)\r\nprint(ans)\r\n", "import itertools\n\nN, capacity = map(int, input().split())\nA = list(map(int, input().split()))\n\ndata = list(itertools.accumulate(A))\nlargest = max(max(data), 0)\nsmallest = min(min(data), 0)\n\nupper_gaps = capacity - largest\nlower_gaps = smallest - 0\nprint(max(0, upper_gaps + lower_gaps + 1))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\n\r\nw = list(map(int, input().split()))\r\na, b = 0, 0\r\nc = 0\r\nfor i in w:\r\n c += i\r\n if c > 0:\r\n a = max(a, c)\r\n elif c < 0:\r\n b = min(b, c)\r\n if c > m or c < -m:\r\n print(0)\r\n exit(0)\r\n\r\nprint(max(0, b+m - a+1))", "n,w=[int(e) for e in input().split()]\r\na=[int(e) for e in input().split()]\r\npsum=[0]*n\r\npsum[0]=a[0]\r\nfor i in range(1, n):\r\n psum[i]=psum[i-1]+a[i]\r\nR=w-max(psum)\r\nL=-min(psum)\r\nif L<0:\r\n L=0\r\nif R>w:\r\n R=w\r\nprint(max(0, R-L+1))", "from itertools import accumulate\r\n\r\n\r\nn,w=map(int,input().split())\r\nA=list(map(int,input().split()))\r\nc=list(accumulate(A))+[0]\r\nhaba=max(c)-min(c)\r\nif w-haba+1>=0:\r\n print(w-haba+1)\r\nelse:\r\n print(0)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\nminw, maxw = 0, w\r\nk = 0\r\nfor e in a:\r\n w -= e\r\n k -= e\r\n maxw = min(w, maxw)\r\n minw = max(minw, k)\r\nif minw > maxw:\r\n print(0)\r\nelse:\r\n print(maxw - minw + 1)", "n, w = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nminn = a[0]\r\nmaxx = a[0]\r\n\r\nfor i in range(1, n):\r\n a[i] += a[i-1]\r\n minn = min(minn, a[i])\r\n maxx = max(maxx, a[i])\r\n\r\nstart, end = 0, 0\r\n\r\nif maxx < 0:\r\n start = -minn\r\n end = w\r\nelif minn > 0:\r\n start = 0\r\n end = w - maxx\r\nelse:\r\n start = -minn\r\n end = w - maxx\r\n\r\nif start > end:\r\n print(0)\r\nelse:\r\n print(end - start + 1)\r\n", "import os\r\nimport sys\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom math import gcd, floor, ceil, sqrt\r\nfrom copy import deepcopy\r\nfrom itertools import permutations, combinations, product\r\nfrom bisect import bisect_left, bisect_right\r\nfrom functools import lru_cache, reduce\r\nimport operator\r\n\r\n# Para mejorar el rendimiento de la entrada/salida\r\ninput = lambda: sys.stdin.readline().strip()\r\nflush = lambda: sys.stdout.flush()\r\nprint = lambda *args, **kwargs: sys.stdout.write(' '.join(map(str, args)) + kwargs.get(\"end\", \"\\n\")) and flush()\r\n\r\n# Optimización de la recursión para Python\r\nsys.setrecursionlimit(100000)\r\n\r\n\r\n# Funciones para lectura de múltiples tipos de datos\r\ndef ints(): return map(int, input().split())\r\ndef strs(): return input().split()\r\ndef chars(): return list(input().strip())\r\ndef mat(n): return [list(ints()) for _ in range(n)] # Matriz de n x m donde m es el número de enteros en una línea\r\n\r\n\r\n# Constantes útiles\r\nINF = float('inf')\r\nMOD = 1000000007 # Modulo por defecto, cambiar si se necesita otro\r\n\r\n\r\n# Algunas funciones útiles\r\ndef add(x, y, mod=MOD): return (x + y) % mod\r\ndef sub(x, y, mod=MOD): return (x - y) % mod\r\ndef mul(x, y, mod=MOD): return (x * y) % mod\r\n\r\n\r\n# Fast power - a^b % mod\r\ndef powmod(a, b, mod=MOD):\r\n res = 1\r\n a = a % mod\r\n while b > 0:\r\n if b % 2:\r\n res = mul(res, a, mod)\r\n a = mul(a, a, mod)\r\n b //= 2\r\n return res\r\n\r\n\r\n# Inverso multiplicativo de a modulo m (cuando m es primo)\r\ndef invmod(a, mod=MOD): return powmod(a, mod - 2, mod)\r\n\r\n\r\n# GCD y LCM\r\ndef lcm(a, b): return a * b // gcd(a, b)\r\n\r\n\r\n# Factorial con memoización\r\n@lru_cache(maxsize=None)\r\ndef factorial(n): return n * factorial(n - 1) if n else 1\r\n\r\n\r\n# Combinaciones con memoización (nCr)\r\n@lru_cache(maxsize=None)\r\ndef comb(n, r):\r\n if r == 0 or r == n: return 1\r\n return comb(n - 1, r - 1) + comb(n - 1, r)\r\n\r\n\r\ndef main():\r\n n, w = ints()\r\n a = list(ints())\r\n print(solve(n, w, a))\r\n\r\n\r\ndef solve(n,w,cambios):\r\n min_pasajeros, max_pasajeros = 0, w\r\n pasajeros_actual = 0\r\n\r\n for cambio in cambios:\r\n pasajeros_actual += cambio\r\n if pasajeros_actual < 0:\r\n min_pasajeros = max(min_pasajeros, -pasajeros_actual)\r\n if pasajeros_actual > w:\r\n return 0\r\n max_pasajeros = min(max_pasajeros, w - pasajeros_actual)\r\n if min_pasajeros > max_pasajeros:\r\n return 0\r\n\r\n return max_pasajeros - min_pasajeros + 1\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, w = map(int, input().split())\n \nmaxx = 0\nminx = 0\ncurrent = 0\nfor i in map(int, input().split()):\n current += i\n if current > maxx:\n maxx = current\n if current < minx:\n minx = current\n \nif maxx - minx > w:\n print(0)\nelse:\n print(w - maxx + minx + 1)", "from itertools import accumulate\nn,w = map(int, input().split())\na = list(map(int, input().split()))\nlista = list(accumulate(a))\nmaxx = max(lista)\nminn = min(lista)\nif maxx < 0:\n maxx = 0\nif minn > 0:\n minn = 0\nif maxx - minn > w:\n print(0)\nelse:\n print(w - maxx + minn + 1)", "n ,w =(map (int, input().split(' ')) )\r\narr = list (map (int, input().split(' ')) )\r\nall = w +1 \r\nweakness = 0 \r\nup = 0\r\nfor i in arr:\r\n up += i \r\n weakness = min (up,weakness) \r\noverlab = 0 \r\nup = w \r\nfor i in arr: \r\n up+= i \r\n overlab = max (overlab,up) \r\nif overlab > w : \r\n all-= (overlab-w) \r\nif weakness <=0 :\r\n all+=weakness \r\nprint (all) if all >= 0 else print (0)\r\n\r\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nfrom bisect import bisect_left as bs\r\n\r\ndef test_case():\r\n n, w = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n l, h = 0, w \r\n minl, maxh = 0, w\r\n for i in range(n):\r\n l += a[i]\r\n h += a[i]\r\n maxh = max(maxh, h)\r\n minl = min(minl, l)\r\n\r\n ansl = 0 if minl >= 0 else abs(minl)\r\n ansh = w if maxh <= w else w-(maxh-w)\r\n# print(minl, maxh)\r\n# print(ansl, ansh)\r\n\r\n if ansl <= ansh:\r\n print(ansh-ansl+1)\r\n else:\r\n print(0)\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "z,s,a,b=input,0,0,0;n,m=map(int,z().split())\r\nfor i in map(int,z().split()):s+=i;a,b=min(a,s),max(b,s)\r\nprint(max(m-b+a+1,0))", "n, cap = [int(x) for x in input().split()]\nnums = [int(x) for x in input().split()]\ndelta, mindelta, maxdelta = 0,0,0\n\nfor i in nums:\n delta += i\n mindelta = min(delta, mindelta)\n maxdelta = max(delta, maxdelta)\n\nprint(max(0, cap+2-(maxdelta - mindelta + 1)))\n \t \t\t\t \t\t \t \t \t\t \t \t\t", "n,w = map(int, input().split())\r\narr = list(map(int, input().split()))\r\nrel = [0]\r\nfor i in arr:\r\n rel.append(rel[-1] + i)\r\nminStart = max(0, 0 - min(rel))\r\nif(minStart + max(rel) > w):\r\n print(0)\r\nelse:\r\n maxStart = w - max(rel)\r\n print(maxStart - minStart + 1)\r\n\r\n \r\n \r\n \r\n ", "import itertools\n\nN, capacity = map(int, input().split())\nA = [0] + list(map(int, input().split()))\n\ndata = list(itertools.accumulate(A))\n\nlargest = max(data)\noffset = abs(min(data))\n\napex = largest + offset\n\nprint(capacity - apex + 1 if capacity >= apex else 0)", "# coding=utf-8\r\nfrom collections import defaultdict, deque, Counter\r\nfrom math import sqrt, ceil, log2, factorial, gcd\r\nfrom itertools import combinations, permutations\r\nfrom functools import lru_cache, cmp_to_key\r\nfrom heapq import heappop, heappush, heapreplace, heapify\r\nfrom bisect import bisect_left, bisect_right\r\nfrom copy import deepcopy\r\nfrom datetime import datetime\r\nfrom sys import stdin, stdout, setrecursionlimit\r\n# setrecursionlimit(1 << 21)\r\nwrite = lambda x='', end='\\n': stdout.write(str(x) + end)\r\nwrites = lambda x, step=' ', end='\\n': stdout.write(step.join(map(str, x)) + end)\r\nread = lambda x=int: x(stdin.readline().strip())\r\nreads = lambda x=int: map(x, stdin.readline().strip().split())\r\nY, N, inf = 'YES', 'NO', float('inf')\r\n\r\n\r\nn, w = reads()\r\nlis = list(reads())\r\nmi, ma = 0, 0\r\ncur = 0\r\nfor i in lis:\r\n cur += i\r\n mi = min(mi, cur)\r\n ma = max(ma, cur)\r\nif ma - mi > w or w < ma or -mi > w:\r\n write(0)\r\n exit(0)\r\nwrite(w - ma + mi + 1)", "n, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nmn = 0\r\nmx = 0\r\ns = 0\r\nfor i in range(n):\r\n s += a[i]\r\n if s > mx:\r\n mx = s\r\n if s < mn:\r\n mn = s\r\nif m - mx + mn + 1 < 0:\r\n print(0)\r\nelse:\r\n print(m - mx + mn +1)", "n, w = map(int, input().split())\r\n\r\nmaxx = 0\r\nminx = 0\r\ncurrent = 0\r\nfor i in map(int, input().split()):\r\n current += i\r\n if current > maxx:\r\n maxx = current\r\n if current < minx:\r\n minx = current\r\n\r\nif maxx - minx > w:\r\n print(0)\r\nelse:\r\n print(w - maxx + minx + 1)\r\n", "import sys\r\nimport math\r\nfrom itertools import combinations\r\niput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int , input().split()))\r\n\r\nminP = float('inf')\r\nmaxP = -float('inf')\r\np = 0\r\nfor i in a:\r\n p += i\r\n if p > maxP:\r\n maxP = p\r\n if p < minP:\r\n minP = p\r\n\r\nif maxP > k:\r\n print(0)\r\nelse:\r\n lf = -minP if minP < 0 else 0\r\n rg = k if maxP <= 0 else k-maxP\r\n if lf > rg:\r\n print(0)\r\n else:\r\n print(rg-lf+1)\r\n" ]

[ "a = [int(x) for x in input().split()]\r\n\r\nsa = sum(a)\r\n\r\nif sa % 2 != 0:\r\n print('NO')\r\n exit()\r\n\r\nfor i in range(64):\r\n total = 0\r\n c = 0\r\n\r\n for b in range(6):\r\n if ((i >> b) & 1) == 1:\r\n total += a[b]\r\n c += 1\r\n if c != 3:\r\n continue\r\n if total == sa // 2:\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')\r\n", "data = list(map(int, input().split()))\r\ns = sum(data)\r\nif s % 2 == 1:\r\n print(\"no\")\r\nelse:\r\n ans = False\r\n for i in range(1, 5):\r\n for j in range(i + 1, 6):\r\n if data[0] + data[i] + data[j] == s // 2:\r\n ans = True\r\n if ans:\r\n print(\"yes\")\r\n else:\r\n print(\"no\")\r\n", "# cook your dish here\r\n# from math import * \r\n#for _ in range(int(input().strip())):\r\n\r\n\r\nl=[int(x) for x in input().split()]\r\ns=sum(l)\r\nflag=0\r\nfor i in range(1,2**6):\r\n cnt=0\r\n s2=0\r\n for j in range(6):\r\n if (1<<j) & i : \r\n cnt+=1 \r\n s2+=l[j]\r\n if cnt==3 and s2==(s//2):\r\n flag=1 \r\n break\r\n if flag==1:\r\n break\r\nif s%2==1:\r\n flag=0\r\nif flag:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "a=list(map(int,input().split()))\r\ns=sum(a)\r\nif s%2==1:\r\n print('NO')\r\n exit()\r\nfor i in range(6):\r\n for j in range(i+1,6):\r\n for k in range(j+1,6):\r\n if a[i]+a[j]+a[k]==s//2:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "s=list(map(int,input().split()))\r\nt=sum(s)\r\ne=0\r\n\r\nif t%2!=0:\r\n print(\"NO\")\r\nelse:\r\n \r\n for a in range(4):\r\n if e==1:\r\n break\r\n for b in range(a+1,5):\r\n if e==1:\r\n break\r\n for c in range(b+1,6):\r\n if s[a]+s[b]+s[c]==t//2:\r\n e=1\r\n print(\"YES\")\r\n break\r\n \r\n \r\n else:\r\n e=e\r\n if e==0:\r\n print(\"NO\")\r\n \r\n \r\n \r\n\r\n", "s = sorted([int(i) for i in input().split()])\r\nres = False\r\nsumm = sum(s)\r\nfor i in range(6):\r\n for j in range(6):\r\n if j == i:\r\n continue\r\n for k in range(6):\r\n if k == j or k == i:\r\n continue\r\n if s[i] + s[j] + s[k] == summ//2:\r\n res = True\r\n break\r\nif summ%2 == 1:\r\n res = False\r\nif res:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nans = \"NO\"\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if 2 * (a[i] + a[j] + a[k]) == s:\r\n ans = \"YES\"\r\nprint(ans)", "from itertools import *\r\ndef other_indexes(ind):\r\n f=[]\r\n for j in range(6):\r\n if str(j) not in ind:\r\n f.append(j)\r\n return f\r\na=[int(__) for __ in input().split()]\r\na = sorted(a)\r\nfor i in list(combinations(''.join([str(_) for _ in range(6)]), 3)):\r\n i1,i2,i3=int(i[0]),int(i[1]),int(i[2])\r\n i4,i5,i6=other_indexes(i)\r\n if a[i1]+a[i2]+a[i3]==a[i4]+a[i5]+a[i6]:\r\n print('Yes')\r\n exit()\r\nprint('No')", "a=[]\nsumx = 0\nsum1 = 0\nfor i in input().split() :\n a.append(int(i))\n sumx += int(i)\n\nfor i in range(6):\n for r in range(i,6):\n if r == i :\n continue\n for z in range(r,6):\n if(z == r):\n continue\n sum1 = a[i]+a[r]+a[z]\n if(sum1 == sumx-sum1):\n print (\"YES\")\n exit()\nprint (\"NO\")\n", "ai = list(map(int,input().split()))\r\nsumm = sum(ai)\r\nans = 0\r\nfor i in range(6):\r\n for j in range(i+1,6):\r\n for z in range(j+1,6):\r\n if summ == (ai[i]+ai[j]+ai[z])*2:\r\n ans = 1\r\nprint(\"YES\"*ans+\"NO\"*(1-ans))\r\n", "line = input().split()\narr = [0, 0, 0, 0, 0, 0]\nfor i in range(6):\n arr[i] = int(line[i])\n\ntotal = sum(arr)\n\ndef calculate(arr, total):\n rest1 = arr.copy()\n for firstIndex in range(6):\n firstElem = rest1[firstIndex]\n rest2 = rest1[firstIndex+1:]\n for secondIndex in range(len(rest2)):\n secondElem = rest2[secondIndex]\n rest3 = rest2[secondIndex+1:]\n for thirdElem in rest3:\n if(firstElem + secondElem + thirdElem == total/2):\n return(True)\n return(False)\n\nif (total%2 != 0):\n print(\"NO\")\nelse:\n if calculate(arr, total):\n print(\"YES\")\n else:\n print(\"NO\")\n\n\t\t \t\t\t\t\t \t \t \t \t \t\t \t\t\t\t", "num1,num2,num3,num4,num5,num6 =input().split()\r\nnum1=int(num1)\r\nnum2=int(num2)\r\nnum3=int(num3)\r\nnum4=int(num4)\r\nnum5=int(num5)\r\nnum6=int(num6)\r\nif num1+num2+num3==num4+num5+num6 or num1+num3+num5==num2+num4+num6 or num2+num3+num4==num1+num5+num6 or num3+num4+num5==num1+num2+num6 or num1+num3+num4==num2+num5+num6 or num1+num2+num4==num3+num5+num6 or num1+num2+num5==num3+num4+num6 or num1+num3+num6==num2+num4+num5 or num1+num4+num5==num2+num3+num6 or num1+num4+num6==num2+num3+num5:\r\n print(\"yes\")\r\n\r\nelse:\r\n print(\"No\")", "import math , itertools , fractions \r\nsi = lambda : input() ; I = lambda : int(input()) ; ar = lambda : list(map(int , input().split())) ; al = lambda : map(int , input().split()) ; als = lambda : map(str , input().split())\r\n\r\n'''\r\n⠀⠀⠀⠀⠀⠀⠀⢀⣤⣴⣶⣶⣶⣶⣶⣦⣄⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢀⣾⠟⠛⢿⣿⣿⣿⣿⣿⣿⣷⠀⠀⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⢸⣿⣄⣀⣼⣿⣿⣿⣿⣿⣿⣿⠀⢀⣀⣀⣀⡀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠉⠉⠉⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣦⠀\r\n⠀⣠⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠀⢸⣿⣿⣿⣿⣿⡇\r\n⢰⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠿⠿⠿⠿⠿⠿⠋⠀⣼⣿⣿⣿⣿⣿⡇\r\n⢸⣿⣿⣿⣿⣿⡿⠉⢀⣠⣤⣤⣤⣤⣤⣤⣤⣴⣾⣿⣿⣿⣿⣿⣿⡇\r\n'''\r\n\r\narr = ar() ; n = sum(arr) \r\n\r\nfor i in range(len(arr) ):\r\n for j in range(i+1 , len(arr)) : \r\n for k in range(j+1 , len(arr)) : \r\n if (arr[i]+arr[j]+arr[k])*2== n : \r\n print('YES') ; exit(); \r\nprint('NO')\r\n'''\r\n⢸⣿⣿⣿⣿⣿⡇⠀⣾⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡿⠀\r\n⠘⣿⣿⣿⣿⣿⡇⠀⣿⣿⣿⣿⣿⠛⠛⠛⠛⠛⠛⠛⠛⠛⠋⠁⠀⠀\r\n⠀⠈⠛⠻⠿⠿⠇⠀⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⣿⡇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⣿⣿⣿⣿⣿⣿⣿⣧⣀⣀⣿⠇⠀⠀⠀⠀⠀⠀\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣿⣿⣿⣿⣿⣿⣿⡿⠋⠀⠀⠀⠀⠀⠀⠀\r\n'''\r\n", "n = input().split()\r\nlength=len(n)\r\njumlah=0\r\nhasil=0\r\nfor i in range(length):\r\n jumlah+=int(n[i])\r\nfor i in range(4):\r\n for j in range(i + 1, 5):\r\n for k in range(j + 1, 6):\r\n if (int(n[i]) + int(n[j]) + int(n[k]))*2 ==jumlah:\r\n hasil+=1\r\nif hasil>1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "num = list(map(int, input().split()))\ntf = True\nif tf:\n for i in range(6):\n if tf:\n for j in range(i + 1, 6):\n if tf:\n for k in range(j + 1, 6):\n if num[i] + num[j] + num[k] == sum(num) - (num[i] + num[j] + num[k]):\n print(\"YES\")\n tf = False\n break\n else: break\n else: break\nif tf:\n print(\"NO\")\n\t\t\t \t\t\t\t \t\t \t \t \t\t\t \t \t\t\t\t", "nums = list(map(int, input().split()))\r\ns = sum(nums)\r\nflag = False\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for n in range(j + 1, 6):\r\n if s // 2 == nums[i] + nums[j] + nums[n]:\r\n if s % 2 == 0:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import itertools\r\nscore_list = list(map(int,input().split(\" \")))\r\nfor i in itertools.combinations(score_list,3):\r\n if sum(i) == sum(score_list)/2:\r\n ans = \"yes\"\r\n break\r\n else:\r\n ans = \"no\"\r\nprint(ans)", "a = list(map(int, input().split()))\r\nif sum(a) % 2 == 0:\r\n for x in a:\r\n a1 = a[:]\r\n a1.remove(x)\r\n for y in a1:\r\n a2 = a1[:]\r\n a2.remove(y)\r\n for z in a2:\r\n if x + y + z == sum(a)//2:\r\n print(\"YES\")\r\n quit()\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")", "nums = [int(_) for _ in input().split()]\ns = sum(nums)\nfor i in range(4):\n\tfor j in range(i+1, 5):\n\t\tfor k in range(j+1, 6):\n\t\t\tif nums[i]+nums[j]+nums[k] == s/2:\n\t\t\t\tprint ('YES')\n\t\t\t\texit()\nprint('NO')\nexit()", "l = list(map(int, input().split()))\r\n\r\ny = False\r\ns = sum(l)\r\ni = 0\r\nwhile i < 4 and not y:\r\n\tj = i + 1\r\n\twhile j < 5 and not y:\r\n\t\tk = j + 1\r\n\t\twhile k < 6 and not y:\r\n\t\t\tt = l[i] + l[j] + l[k]\r\n\t\t\tif t == s - t:\r\n\t\t\t\ty = True\r\n\t\t\tk += 1\r\n\t\tj += 1\r\n\ti += 1\r\n\r\nif y:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "from itertools import permutations \n\n# t = int(input())\n\n# while t:\n# \tt -= 1\n\na = [int(x) for x in input().split()]\n\ncheck = False\nfor p in permutations(a):\n\tif sum(p[:3]) == sum(p[3:]):\n\t\tcheck = True\n\t\tbreak\n\nif check:\n\tprint('YES')\nelse:\n\tprint('NO')", "from itertools import combinations\nif __name__ == '__main__':\n nums = [int(x) for x in input().split()]\n soma = sum(nums)\n result = 0\n \n if soma % 2 == 0:\n comb = combinations([0, 1, 2, 3, 4, 5],3)\n m_soma = soma/2\n for x in list(comb):\n if m_soma == sum([nums[x[0]],nums[x[1]],nums[x[2]]]): \n result = 1\n break\n \n if result == 0:\n print(\"NO\")\n else:\n print(\"YES\")\n\t \t \t\t \t \t \t\t \t \t\t \t\t", "def main():\n scores = [int(i) for i in input().split()]\n\n def hasDuplicate(a, b, c, d, e, f):\n return a == b or a == c or a == d or a == e or a == f or b == c or b == d or b == e or b == f or c == d or c == e or c == f or d == e or d == f or e == f\n\n for a in range(6):\n for b in range(6):\n for c in range(6):\n for d in range(6):\n for e in range(6):\n for f in range(6):\n if not hasDuplicate(a, b, c, d, e, f):\n if (scores[a] + scores[b] + scores[c]) == (scores[d] + scores[e] + scores[f]):\n print('YES')\n return\n\n print('NO')\n\n\nmain()\n\t \t\t\t \t \t\t\t \t\t\t\t\t\t\t \t \t\t\t", "numbers = [int(i) for i in input().split()]\r\ntotal = sum(numbers)\r\nflag = False\r\nfor x in range(4):\r\n for y in range(x+1,5):\r\n for z in range(y+1,6):\r\n if numbers[x]+numbers[y]+numbers[z]==total/2:\r\n flag = True\r\n break\r\n if flag==True:\r\n break\r\n if flag==True:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#----------------------------\n# Matheus de Souza Oliveira |\n# RA: 102307 |\n#----------------------------\n\nparticipantsScores = list(map(int, input().split()))\n\nif(participantsScores[0]+participantsScores[1]+participantsScores[2] == participantsScores[3]+participantsScores[4]+participantsScores[5]): \n print(\"YES\")\n\nelif(participantsScores[0]+participantsScores[1]+participantsScores[3] == participantsScores[2]+participantsScores[4]+participantsScores[5]): \n print(\"YES\")\n\nelif(participantsScores[0]+participantsScores[1]+participantsScores[4] == participantsScores[2]+participantsScores[3]+participantsScores[5]): \n print(\"YES\")\n\nelif(participantsScores[0]+participantsScores[1]+participantsScores[5] == participantsScores[2]+participantsScores[3]+participantsScores[4]): \n print(\"YES\")\n\nelif(participantsScores[0]+participantsScores[2]+participantsScores[3] == participantsScores[1]+participantsScores[4]+participantsScores[5]): \n print(\"YES\")\n\nelif(participantsScores[0]+participantsScores[2]+participantsScores[4] == participantsScores[1]+participantsScores[3]+participantsScores[5]): \n print(\"YES\")\n\nelif(participantsScores[0]+participantsScores[2]+participantsScores[5] == participantsScores[1]+participantsScores[3]+participantsScores[4]): \n print(\"YES\")\n\nelif(participantsScores[1]+participantsScores[2]+participantsScores[3] == participantsScores[0]+participantsScores[4]+participantsScores[5]): \n print(\"YES\")\n\nelif(participantsScores[1]+participantsScores[2]+participantsScores[4] == participantsScores[0]+participantsScores[3]+participantsScores[5]): \n print(\"YES\")\n\nelif(participantsScores[1]+participantsScores[2]+participantsScores[5] == participantsScores[0]+participantsScores[3]+participantsScores[4]): \n print(\"YES\")\n\nelse:\n print(\"NO\")\n\n\t \t\t \t\t \t\t \t\t\t \t\t \t\t \t \t\t\t\t", "inpt = [int(i) for i in input().split(' ')]\r\nl = len(inpt)\r\ntotal, flag = sum(inpt), 0\r\nfor i in range(l):\r\n if flag== 1:break\r\n for j in range(i+1, l):\r\n if flag==1:break\r\n for k in range(j+1, l):\r\n t = inpt[i] + inpt[j] + inpt[k]\r\n if total == 2*t:\r\n print('YES')\r\n flag = 1\r\n break\r\nif flag==0:print('NO')", "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\na = ints()\r\nif sum(a) % 2 != 0:\r\n print(\"NO\")\r\n sys.exit()\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if a[i] + a[j] + a[k] == sum(a)//2:\r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "def solve(participants):\n for i in range(len(participants)-2):\n for j in range(i+1, len(participants)-1):\n for k in range(j+1, len(participants)):\n team_1 = [participants[i], participants[j], participants[k]]\n team_2 = [participants[idx] for idx in range(len(participants)) if idx not in [i, j, k]]\n if sum(team_1) == sum(team_2):\n return \"YES\"\n return \"NO\"\n\nparticipants = list(map(int, input().split()))\nprint(solve(participants))\n \t \t \t \t\t\t \t \t\t \t \t\t\t\t \t\t\t \t", "from itertools import permutations\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\ndef f(s,l):\r\n\tl2=list(permutations(l,3))\r\n\tfor i in l2:\r\n\t\tif sum(i)*2==s:\r\n\t\t\treturn \"YES\"\r\n\treturn \"NO\"\r\nprint(f(s,l))", "entrada=input().split()\nfor i in range(len(entrada)):\n entrada[i]=int(entrada[i])\nsoma=sum(entrada)\nsaida=\"NO\"\nfor i in range(len(entrada)):\n for j in range(len(entrada)):\n if i!=j:\n for k in range(len(entrada)):\n if k!=i and k!=j:\n if entrada[i]+entrada[j]+entrada[k]==soma/2:\n saida=\"YES\"\nprint(saida)\n\n \t \t \t \t \t\t \t \t\t\t \t \t\t\t", "a = list(map(int, input().split()))\nt = True\n\nfor i in range(6):\n for j in range(6):\n for q in range(6):\n for w in range(6):\n for e in range(6):\n for r in range(6):\n if (i != j) and (i != q) and (i != w) and (i != e) and (i != r) and (j != w) and (q != j) and (j != e) and (j != r) and (q != w) and (e != q) and (q != r) and (w != e) and (w != r) and (e != r):\n if a[i] + a[j] + a[q] == a[w] + a[e] + a[r]:\n t = False\nif t:\n\tprint(\"NO\")\nelse:\n\tprint(\"YES\")", "from itertools import combinations\r\n\r\ndef input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef output_list(v):\r\n print(' '.join(str(x) for x in v))\r\n\r\ndef main():\r\n a = input_ints()\r\n for c in combinations(a, 3):\r\n if 2 * sum(c) == sum(a):\r\n print('YES')\r\n return\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = list(map(int,input().split()))\nc = sum(a)\nfor i in range(0,len(a)-2):\n for j in range(i+1,len(a)-1):\n for k in range(j+1,len(a)):\n x = a[i]+a[j]+a[k]\n if c-x == x:\n print(\"YES\")\n exit(0)\nprint(\"NO\")", "a = list(map(int, input().split()))\r\na1 = 0\r\nda = []\r\nfor i in range(len(a)):\r\n for j in range(i + 1, len(a)):\r\n for k in range(j + 1, len(a)):\r\n k1, i1, j1 = 0, 0, 0\r\n while i1 in [i, j, k]:\r\n i1 +=1\r\n while k1 in [i, j, k, i1]:\r\n k1 +=1\r\n while j1 in [i, j, k, i1, k1]:\r\n j1 +=1\r\n if a[i] + a[j] + a[k] == a[i1] + a[j1] + a[k1]:\r\n print('YES')\r\n exit(0)\r\n\r\nprint('NO')\r\n", "from sys import *\r\nl = list(map(int,input().split()))\r\ns = sum(l)\r\nfor i in range(len(l)):\r\n s-=l[i]\r\n for j in range(len(l)):\r\n if i==j:\r\n continue\r\n s-=l[j]\r\n for k in range(j+1,len(l)):\r\n if k==i or k==j:\r\n continue\r\n s-=l[k]\r\n if s==l[i]+l[j]+l[k]:\r\n print(\"YES\")\r\n exit()\r\n s+=l[k]\r\n s+=l[j]\r\n s+=l[i]\r\nprint(\"NO\")", "def acm(lst):\r\n s = sum(lst)\r\n b = sorted(lst)\r\n if s % 2 != 0:\r\n return \"NO\"\r\n for i in range(5):\r\n for j in range(i + 1, 5):\r\n if b[i] + b[j] + b[5] == s // 2 and s % 2 == 0:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\n\r\na = [int(x) for x in input().split()]\r\nprint(acm(a))\r\n", "from sys import stdin\na = [int(i) for i in stdin.readline().split(' ')]\n\ns = sum(a)\npossible = False\nfor i in range(1, 5):\n for j in range(i+1, 6):\n team = a[0]+a[i]+a[j]\n if team == s-team:\n possible = True\n\nif possible:\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t\t \t \t \t \t \t \t \t\t\t \t\t", "\r\na1,a2,a3,a4,a5,a6= input().split()\r\na1=int(a1)\r\na2=int(a2)\r\na3=int(a3)\r\na4=int(a4)\r\na5=int(a5)\r\na6=int(a6)\r\n\r\nif a1+a2+a3 == a4+a5+a6:\r\n print(\"yes\")\r\nelif a1+a2+a4 == a3+a5+a6:\r\n print(\"yes\")\r\nelif a1+a2+a5 == a4+a3+a6:\r\n print(\"yes\")\r\nelif a1+a2+a6 == a4+a5+a3:\r\n print(\"yes\")\r\nelif a1+a3+a4 == a2+a5+a6:\r\n print(\"yes\") \r\nelif a1+a3+a5 == a2+a4+a6:\r\n print(\"yes\")\r\nelif a1+a3+a6 == a4+a5+a2:\r\n print(\"yes\")\r\nelif a1+a4+a5 == a2+a3+a6:\r\n print(\"yes\")\r\nelif a1+a4+a6 == a2+a5+a3:\r\n print(\"yes\")\r\nelif a1+a5+a6 == a4+a2+a3:\r\n print(\"yes\")\r\nelse:\r\n print(\"No\")", "from itertools import permutations\r\ndef ok(arr1):\r\n for i in list(permutations(arr1,6)):\r\n if sum(i[:3])==sum(i[3:]):\r\n return True\r\n return False\r\narr1=list(map(int,input().split()))\r\nif ok(arr1):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "A = input().split()\r\nA = [int(i) for i in A]\r\ntot = A[0]+A[1]+A[2]+A[3]+A[4]+A[5]\r\ndef ans(A):\r\n for i in range (0,6):\r\n for j in range (i+1,6):\r\n for k in range (j+1,6):\r\n S = tot-2*A[i]-2*A[j]-2*A[k]\r\n if S==0:\r\n return (\"YES\")\r\n break\r\n return (\"NO\")\r\nprint (ans(A))", "import itertools\nimport sys\n\na = list(map(int, input().split()))\nfor a1, a2, a3, a4, a5, a6 in itertools.permutations(a):\n\tif a1 + a2 + a3 == a4 + a5 + a6:\n\t\tprint(\"YES\")\n\t\tsys.exit(0)\nprint(\"NO\")", "def wrapper():\r\n a = [int(x) for x in input().split()]\r\n \r\n for i in range(6):\r\n for j in range(6):\r\n if i == j:\r\n continue\r\n for k in range(6):\r\n if i == k or j == k:\r\n continue\r\n \r\n c = list(range(6))\r\n c.remove(i)\r\n c.remove(j)\r\n c.remove(k)\r\n if a[i]+a[k]+a[j] == a[c[0]]+a[c[1]]+a[c[2]]:\r\n print(\"YES\")\r\n return\r\n print(\"NO\")\r\n \r\nwrapper()", "str_in = input()\r\nm = [int(i) for i in str_in.split()]\r\nn=sorted(m)\r\nsum=0\r\nfor x in m:\r\n\tsum+=x\r\ni=0\r\nwhile i<4:\r\n\tj=i+1\r\n\twhile j<5:\r\n\t\tk=j+1\r\n\t\twhile k<6:\r\n\t\t\tif (n[i]+n[j]+n[k])==sum/2:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\tbreak\r\n\t\t\telse:\r\n\t\t\t\tk+=1\r\n\t\telse:\r\n\t\t\tk=5\r\n\t\tif (n[i]+n[j]+n[k])==sum/2:\r\n\t\t\tbreak\t\t\r\n\t\telse:\r\n\t\t\tj+=1\r\n\telse:\r\n\t\tj=4\r\n\tif (n[i]+n[j]+n[k])==sum/2:\r\n\t\tbreak\t\t\r\n\telse:\t\t\r\n\t\ti+=1\r\nelse:\r\n\tprint(\"NO\")\r\n", "a = list(map(int, input().split()))\r\ns = sum(a)\r\nif s % 2 == 0:\r\n\tf = False\r\n\tfor i in range(6):\r\n\t\tfor j in range(i + 1, 6):\r\n\t\t\tfor k in range(j + 1, 6):\r\n\t\t\t\tif a[i] + a[j] + a[k] == s // 2:\r\n\t\t\t\t\tf = True\r\n\tif f:\r\n\t\tprint('YES')\r\n\telse:\r\n\t\tprint('NO')\r\nelse:\r\n\tprint('NO')", "competitors = sorted([int(i) for i in input().split()])\r\nflag = True\r\noth_competitors = []\r\ndef balance(competitors):\r\n for x in competitors[:]:\r\n competitors.remove(x)\r\n oth_competitors.append(x)\r\n for l in competitors[:]:\r\n competitors.remove(l)\r\n oth_competitors.append(l)\r\n for i in competitors[:]:\r\n competitors.remove(i)\r\n oth_competitors.append(i)\r\n if sum(competitors) == sum(oth_competitors):\r\n return('YES')\r\n competitors += [i]\r\n oth_competitors.remove(i)\r\n competitors += [l]\r\n oth_competitors.remove(l)\r\n competitors.append(x)\r\n oth_competitors.remove(x)\r\n return('NO')\r\n\r\nprint(balance(competitors))", "l = [*map(int,input().split())]\r\ns = sum(l); ans = \"NO\";cnt = 0\r\nfor i in range(4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n if(l[i]+l[j]+l[k])*2==s:ans = \"YES\";cnt = 1; break\r\n if(cnt):break\r\n if(cnt):break\r\nprint(ans)", "a = [int(x) for x in input().split(\" \")]\n\ntotal = sum(a)\n\nif total % 2 != 0:\n print(\"NO\")\n exit()\n\nfor i in range(6):\n for j in range(6):\n for k in range(6):\n if (i != j and i != k and j != k):\n if a[i] + a[j] + a[k] == total/2:\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n\t \t\t \t \t\t \t\t\t \t\t \t \t \t", "a = list(map(int, input().split()))\r\nok = False\r\nfor mask in range(2 ** 6):\r\n pos = []\r\n for i in range(6):\r\n if mask & (2 ** i):\r\n pos.append(i)\r\n if len(pos) == 3:\r\n l, r = 0, 0\r\n for j in range(6):\r\n if j in pos:\r\n l += a[j]\r\n else:\r\n r += a[j]\r\n ok |= l == r\r\nprint(\"YES\" if ok else \"NO\")", "a = [int(x) for x in input().split()]\r\nfl = False\r\nfor i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n if (i == j or k == j or i == k):\r\n continue\r\n if a[i] + a[j] + a[k] == sum(a) / 2 and sum(a) % 2 == 0:\r\n fl = True\r\nif (fl):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "x=[int(w) for w in input().split()]\r\ny=sum(x)\r\nif y&1!=0:\r\n print('NO')\r\nelse:\r\n ans=[]\r\n for i in range(4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n ans.append(x[i]+x[j]+x[k])\r\n if y//2 in ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import itertools\r\n\r\nscores = map(int, input().split())\r\n\r\nfor i in itertools.permutations(scores):\r\n if sum(i[:3]) == sum(i[3:]):\r\n print('Yes')\r\n break\r\nelse:\r\n print('No')\r\n\r\n", "# 1 3 2 1 2 1\r\n# 1 1 1 1 1 99\r\np = list(map(int, input().split()))\r\nt = []\r\n\r\nfor a in range(0, 4) :\r\n for b in range(a + 1, 5) :\r\n for c in range(b + 1, 6) :\r\n t.append((p[a], p[b], p[c]))\r\n\r\nfor x in t :\r\n if sum(x) == sum(p) - sum(x) :\r\n print('YES')\r\n t = 1\r\n break\r\nif t != 1 :\r\n print('NO')\r\n ", "a = list(map(int, input().split()))\n\n\ndef calc(a):\n for i in range(6):\n for j in range(6):\n for k in range(6):\n if i != j and j != k and i != k:\n left = {i, j, k}\n right = set(range(6)) - left\n s_left = sum((a[i] for i in left))\n s_right = sum((a[i] for i in right))\n if s_left == s_right:\n return 'YES'\n return 'NO'\n\n\nprint(calc(a))", "temp = [int(i) for i in input().split(' ')]\ngobal = sum(temp) / 2\nflags = 0\nfor i in range(len(temp)):\n for j in range(i+1,len(temp)):\n for z in range(j+1,len(temp)):\n if sum([temp[i],temp[j],temp[z]]) == gobal and not flags :\n flags = 1\n break\nprint('Yes' if flags else 'No')\n\t\t\t \t\t\t\t \t \t\t\t \t\t \t\t \t \t\t", "l = list(map(int,input().split()))\r\nfor a in range(len(l)):\r\n for b in range(len(l)):\r\n for c in range(len(l)):\r\n for d in range(len(l)):\r\n for e in range(len(l)):\r\n for f in range(len(l)):\r\n if len({a,b,c,d,e,f}) == len([a,b,c,d,e,f]):\r\n if l[a] + l[b] + l[c] == l[d] + l[e] + l[f]:\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "import itertools;\r\n\r\n\r\ndef raw_input(n):\r\n contents = []\r\n for a in range(n):\r\n try:\r\n line = input()\r\n except EOFError:\r\n break\r\n contents.append(line)\r\n return contents\r\n\r\ndata = [int (a) for a in input().split(\" \", -1)]\r\n\r\nfor b in itertools.permutations(data):\r\n if (b[0] + b[1] + b[2] == b[3] + b[4] + b[5]):\r\n print(\"YES\")\r\n quit()\r\n\r\nprint(\"NO\")\r\n\r\n\r\n", "s=sorted(list(map(int,input().split())))\r\nm=[]\r\nF=False\r\ni,z,q,x,c,v=0,0,0,0,0,0\r\nwhile True:\r\n if i!=z and i!=q and i!=x and i!=c and i!=v and z!=q and z!=x and z!=c and z!=v and q!=x and q!=v and q!=c and x!=c and x!=v and c!=v:\r\n if s[i]+s[q]+s[z]==s[x]+s[c]+s[v]:\r\n F=True\r\n break\r\n q+=1\r\n if q==6:\r\n q=0\r\n z+=1\r\n if z==6:\r\n i+=1\r\n z=0\r\n if i==6:\r\n x+=1\r\n i=0\r\n if x==6:\r\n x=0\r\n c+=1\r\n if c==6:\r\n c=0\r\n v+=1\r\n if v==6:\r\n break\r\nif F==True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = [int (x) for x in input().split()]\ns = sum(a)\nfor i in range (6):\n for i1 in range (i+1, 6):\n for i2 in range (i1+1, 6):\n if 2*(a[i] + a[i1] + a[i2]) == s:\n print(\"YES\")\n exit(0)\nprint(\"NO\")", "import itertools\r\n\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\n\r\nfor i in itertools.combinations(a, 3):\r\n if sum(i) * 2 == s:\r\n print('YES')\r\n exit()\r\nprint(\"NO\")", "def solve():\n scores = list(map(int, input().split()))\n\n half_score = sum(scores) / 2.0\n if half_score != int(half_score):\n return \"NO\"\n\n for i in range(6):\n for j in range(i+1, 6):\n for k in range(j+1, 6):\n if scores[i] + scores[j] + scores[k] == half_score:\n return \"YES\"\n\n return \"NO\"\n\nprint(solve())\n", "l = [int(x) for x in input().split()]\nsm = sum(l)\nfor i in range(6):\n for j in range(i+1, 6):\n for k in range(j+1, 6):\n sum3 = l[i] + l[j] + l[k]\n if sm - sum3 == sum3:\n print(\"YES\")\n exit()\n\nprint(\"NO\")", "def main():\n entrada = input().split();\n alunos = [];\n total_score = 0;\n team_score = 0;\n resp = \"NO\";\n for i in entrada:\n score_aluno = int(i);\n alunos.append(score_aluno);\n total_score += score_aluno;\n for i in range(6):\n for j in range(i + 1, 6):\n for k in range(j + 1, 6):\n team_score = total_score - (alunos[i] + alunos[j] + alunos[k]);\n if(team_score*2 == total_score):\n resp = \"YES\";\n print(resp);\n\nmain();\n \t \t \t \t \t \t\t\t\t \t \t \t", "l=list(map(int,input().split()))\r\nl.sort()\r\ns=sum(l)\r\nif(s%2!=0):\r\n print(\"NO\")\r\nelse:\r\n f=0\r\n s=s//2\r\n a=l[5]\r\n for i in range(5):\r\n a+=l[i]\r\n if(s-a in l):\r\n # if(s-a!=l[i] or (s-a==l[i] and l.count(s-a)>1)):\r\n b=False\r\n \r\n if (s-a==l[i] ):\r\n if(s-a==l[5]):\r\n if(l.count(l[5])>3):\r\n b=True\r\n else:\r\n if(l.count(l[i])>2):\r\n b=True\r\n else:\r\n b=True\r\n if(b):\r\n print(\"YES\")\r\n f=1\r\n break\r\n a-=l[i]\r\n if(f==0):\r\n print(\"NO\")", "g = input().split()\r\nM = list(map(int, g))\r\ncount = S = 0\r\nwhile count < 6:\r\n S = S + M[count]\r\n count += 1\r\nif (S % 2 != 0):\r\n print (\"NO\")\r\nelse:\r\n S = S // 2\r\n a = 1\r\n O = 0\r\n while a < 5:\r\n b = a\r\n while b != 5:\r\n b += 1\r\n if ((M[0] + M[a] + M[b]) == S):\r\n O = 1\r\n print (\"YES\")\r\n break\r\n if ((M[0] + M[a] + M[b]) == S):\r\n break\r\n a += 1\r\n if (O == 0):\r\n print (\"NO\")\r\n \r\n \r\n", "a = [ int(i) for i in input().strip().split() ]\nt = sum(a)\nif t % 2 == 1:\n print(\"NO\")\nelse:\n possible = False\n for i in range(6):\n for j in range(i+1,6):\n for k in range(j+1,6):\n if a[i] + a[j] + a[k] == t / 2:\n possible = True\n print(\"YES\")\n break\n if possible:\n break\n if possible:\n break\n if not possible:\n print(\"NO\")\n\n\t\t \t\t \t \t \t\t\t\t\t\t \t \t \t \t\t", "a = [int(i) for i in input().strip().split()]\r\ns = sum(a)\r\nfor i in range(0, 4):\r\n for j in range(i + 1, 5):\r\n for l in range(j + 1, 6):\r\n if (a[i] + a[j] + a[l]) * 2 == s:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "n = input()\r\nn = n.split()\r\nfor i in range(0,len(n)):\r\n n[i] = int(n[i])\r\nsum = 0\r\nfor i in n:\r\n sum+=i\r\nfl = 0\r\nfor i in range(4):\r\n if fl == 0:\r\n for j in range(i +1, 5):\r\n if fl == 0:\r\n for k in range(j+1, 6):\r\n an_sum = n[i]+n[j] + n[k]\r\n if an_sum == sum-an_sum:\r\n print('Yes')\r\n fl = 1\r\n break\r\nif fl == 0:\r\n print('No')\r\n", "a = list(map(int, input().split()))\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n s1 = a[i] + a[j] + a[k]\r\n s2 = 0\r\n for t in range(6):\r\n if t != i and t != j and t != k:\r\n s2 += a[t]\r\n if s1 == s2:\r\n print('YES')\r\n exit()\r\n s2 = 0\r\nprint('NO')", "def main():\n points = sorted([int(num) for num in input().split()])\n halfPoints = sum(points)/2\n n = len(points)\n didSplit = False\n\n for i in range(n):\n for j in range(i+1, n):\n for k in range(j+1, n):\n teamPoint = points[i] + points[j] + points[k]\n if teamPoint == halfPoints:\n print(\"YES\")\n didSplit = True\n break\n if didSplit:\n break\n if didSplit:\n break\n\n if not didSplit:\n print(\"NO\")\n\nmain()\n\t \t\t \t\t\t \t \t \t \t\t\t \t", "a = list(map(int, input().split()))\r\nfor i in range(4):\r\n for j in range(i + 1, 5):\r\n for k in range(j + 1, 6):\r\n if 2 * (a[i] + a[j] + a[k]) == sum(a):\r\n print('YES')\r\n exit()\r\nprint('NO')", "a = [int(x) for x in input().split()]\r\ns = sum(a)\r\nx = 0\r\nfor i in range(6):\r\n for j in range(i+1,6):\r\n for l in range(j+1,6):\r\n if (a[i]+a[j]+a[l]==s/2):\r\n x = 1\r\nif (x == 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l=list(map(int,input().split()))\r\ns=sum(l)\r\nif s&1:\r\n print(\"NO\")\r\nelse:\r\n s//=2\r\n res=False\r\n for i in range(4):\r\n f=l[i]\r\n for j in range(i+1,6):\r\n t=f+l[j]\r\n for k in range(j+1,6):\r\n if (t+l[k])==s:\r\n res=True\r\n if res:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "def solve():\n entrada = list(map(int,input().split()))\n for a in range(len(entrada)):\n for b in range(len(entrada)):\n for c in range(len(entrada)):\n if(a != b and a != c and b != c):\n if((entrada[a] + entrada[b] + entrada[c]) == sum(entrada)/2):\n print(\"YES\")\n exit()\n print(\"NO\")\n\nsolve()\n \t\t\t \t\t\t \t \t \t \t\t\t\t \t\t \t", "# 445a\n\nimport itertools\n\na = map(int, input().split())\n\nperms = list(itertools.permutations(a))\n\nfor i in perms:\n if sum(i[:3]) == sum(i[3:]):\n print(\"YES\")\n exit()\nprint(\"NO\")\n", "a,b,c,d,e,f =input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\ne=int(e)\r\nf=int(f)\r\n\r\nif (a+b+c == d+e+f) :\r\n print(\"YES\")\r\nelif (a+b+d == c+e+f) :\r\n print(\"YES\")\r\nelif (a+b+e == c+d+f) :\r\n print(\"YES\")\r\nelif (a+b+f == c+d+e) :\r\n print(\"YES\")\r\nelif (c+d+a == e+b+f):\r\n print(\"YES\")\r\nelif (c+e+a == d+b+f):\r\n print(\"YES\")\r\nelif (c+f+a == e+b+d):\r\n print(\"YES\")\r\nelif (e+d+a == c+b+f):\r\n print(\"YES\")\r\nelif (f+d+a == e+b+c):\r\n print(\"YES\")\r\nelif (f+e+a == d+b+c):\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")", "a=[int(x) for x in input().split()]\r\nsum = sum(a)\r\nf = 0\r\nfor i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n if i != j and i != k and j != k and (a[i] + a[j] + a[k])*2 == sum:\r\n f = 1\r\nif f == 1:\r\n print('YES')\r\nelse:\r\n print('NO')", "import itertools\n\ndef main():\n A = tuple(map(int, input().split()))\n\n half = sum(A) / 2\n for i in itertools.combinations(A, 3):\n points = sum(i)\n if half == points:\n print('YES')\n break\n else:\n print('NO')\n\nmain()\n", "a = list(map(int, input().split()))\r\ns = sum(a)\r\nfor k in range(6):\r\n for i in range(6):\r\n for j in range(6):\r\n if i == j or i == k or j == k:\r\n continue\r\n z = [a[k], a[i], a[j]]\r\n if sum(z) == s - sum(z):\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "def main():\n nums = [int(x) for x in input().split(' ')]\n total = sum(nums)\n for i in range(len(nums)):\n for j in range(i+1, len(nums)):\n for k in range(j+1, len(nums)):\n score = nums[i] + nums[j] + nums[k]\n if total - score == score:\n return True\n return False\n\n\nres = main()\nif res:\n print('YES')\nelse:\n print('No')", "a = list(map(int, input().split()))\r\ntotal = sum(a)\r\ntarget = total / 2\r\nif not target.is_integer:\r\n print(\"NO\")\r\n exit()\r\na.sort(reverse=True)\r\nif a[0] > target:\r\n print(\"NO\")\r\n exit()\r\n\r\nremaining1 = target - a[0]\r\n\r\nfor i in range(1, len(a)-1):\r\n remaining2 = remaining1 - a[i]\r\n if remaining2 < 0:\r\n continue\r\n for j in range(i+1, len(a)):\r\n remaining3 = remaining2 - a[j]\r\n if remaining3 == 0:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\narr = list(map(int, input().split()))\r\n\r\nsm = sum(arr)\r\n\r\nif sm%2:\r\n print(\"NO\")\r\nelse:\r\n md = sm//2\r\n for perm in combinations(arr, r=3):\r\n if sum(perm) == md:\r\n # print(perm)\r\n print(\"YES\")\r\n exit()\r\n print(\"NO\")\r\n", "l= list(map(int, input().split()))\r\nsum = l[0]+l[2]+l[3]+l[4]+l[5]+l[1]\r\nb=False\r\ni=0\r\nwhile(i<6):\r\n j=i+1\r\n while(j<6):\r\n k=j+1\r\n while(k<6):\r\n s=l[i]+l[k]+l[j]\r\n if(2*s==sum):b=True\r\n k+=1\r\n j+=1\r\n i+=1\r\nif(b):print('Yes')\r\nelse: print('No')", "num1,num2,num3,num4,num5,num6=input().split()\r\nnum1=int(num1)\r\nnum2=int(num2)\r\nnum3=int(num3)\r\nnum4=int(num4)\r\nnum5=int(num5)\r\nnum6=int(num6)\r\n\r\nif num1+num2+num3==num4+num5+num6:\r\n print(\"yes\")\r\nelif num1+num2+num4==num3+num5+num6:\r\n print(\"yes\")\r\nelif num1+num2+num5==num4+num3+num6 :\r\n print(\"yes\")\r\nelif num1+num2+num6==num4+num5+num3:\r\n print(\"yes\")\r\nelif num1+num4+num3==num2+num5+num6:\r\n print(\"yes\")\r\nelif num1+num5+num3==num4+num2+num6 :\r\n print(\"yes\")\r\nelif num1+num6+num3==num4+num5+num2 :\r\n print(\"yes\")\r\nelif num4+num2+num3==num1+num5+num6 :\r\n print(\"yes\")\r\nelif num5+num2+num3==num4+num1+num6 :\r\n print(\"yes\")\r\nelif num6+num2+num3==num4+num5+num1 :\r\n print(\"yes\")\r\nelif num1+num3+num5==num2+num4+num6:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "import itertools\r\na = list(map(int, input().split()))\r\nfor i in itertools.permutations(a):\r\n if sum(i[3:]) == sum(i[:3]):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "a=list(map(int,input().split()))\nsu = sum(a)\nif su % 2 == 0:\n su//=2\n for i in range(4):\n for j in range(i+1,5):\n for k in range(j+1,6):\n if a[i] + a[j] + a[k] == su:\n print('YES')\n exit()\n print('NO')\nelse:print('NO')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Feb 10 19:31:11 2019\r\n\r\n@author: Yohann\r\n\"\"\"\r\n\r\nfrom itertools import combinations\r\n\r\nscores = [int(n) for n in input().split()]\r\n\r\ntotal = sum(scores)\r\nresult = False\r\n\r\nfor t in combinations(scores,3):\r\n if 2*sum(t) == total:\r\n result = True\r\n \r\nprint(\"YES\" if result else \"NO\")\r\n\r\n", "a=list(map(float, input().split()))\r\nb=0\r\nk=0\r\n\r\nfor i in range(len(a)):\r\n b+=a[i];\r\n \r\nfor i in range(1,len(a)):\r\n for n in range(i+1,len(a)):\r\n if b/2-a[0]-a[i]-a[n]==0:\r\n k+=1\r\n\r\nif k==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n", "ar=list(map(int,input().split()))\r\nfor i in range(6):\r\n for j in range(i):\r\n for k in range(j):\r\n if(2*(ar[i]+ar[j]+ar[k])==sum(ar)):\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")\r\n", "a=list(map(int,input().split()))\r\nsum=sum(a)\r\n\r\n\r\nfor i in range (6):\r\n group=a[i]\r\n for j in range (i+1,6):\r\n group+=a[j]\r\n for k in range (j+1,6):\r\n group+=a[k]\r\n if(2*(a[i]+a[j]+a[k])==sum):\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "str_in = input()\r\nm = [int(i) for i in str_in.split()]\r\nn=sorted(m)\r\nsum=0\r\nfor x in m:\r\n\tsum+=x\r\nfor i in range(4):\r\n\tfor j in range(i+1,5):\r\n\t\tfor k in range(j+1,6):\r\n\t\t\ts1=n[i]+n[j]+n[k]\r\n\t\t\tif s1==sum/2:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit()\r\nprint(\"NO\")", "from itertools import combinations as c\r\ny =[int(i) for i in input().split()]\r\nz = list(c(y,3))\r\nd = []\r\nfor i in range(10):\r\n d.append([z[i], z[19-i]])\r\nx = 0\r\nfor i in d:\r\n if (sum(i[0]))==(sum(i[1])):\r\n x+=1\r\n else:\r\n pass\r\nprint('yes') if x>=1 else print('no')\r\n\r\n\r\n\r\n", "a=[int(i) for i in input().split()]\r\nb=sum(a)\r\na.sort()\r\nif b%2==0:\r\n for i in range(5):\r\n if b//2-a[i]-a[-1] in a[i+1:-1] or b//2-a[i]-a[-1] in a[:i]:\r\n print('YES')\r\n quit()\r\nprint('NO')\r\n", "input_str = input().split()\r\nscores = []\r\nfor s in input_str:\r\n scores.append(int(s))\r\n\r\nfrom itertools import permutations\r\n\r\nfound = False\r\n\r\nfor perm in permutations([x for x in range(6)], 3):\r\n sum1 = 0\r\n sum2 = 0\r\n for i in range(len(scores)):\r\n if i in perm:\r\n sum1 += scores[i]\r\n else:\r\n sum2 += scores[i]\r\n\r\n if sum1 == sum2:\r\n found = True\r\n\r\nprint(\"YES\" if found else \"NO\")", "A,B, C, D, E, F = input().split()\r\nA=int(A)\r\nB=int(B)\r\nC=int(C)\r\nD=int(D)\r\nE=int(E)\r\nF=int(F)\r\n \r\na= A+B\r\nb= A+C\r\nc= A+D\r\nd= A+E\r\ne= A+F\r\n\r\nb1= B+C\r\nc1= B+D\r\nd1= B+E\r\ne1= B+F\r\n\r\nc2= C+D\r\nd2= C+E\r\ne2= C+F\r\n\r\nd3= D+E\r\ne3= D+F\r\n\r\ne4=E+F\r\n\r\nif a+C== d3+F:\r\n print(\"YES\")\r\nelif a+D== d2+F:\r\n print(\"YES\")\r\nelif a+E== c2+F:\r\n print(\"YES\")\r\nelif a+F== d3+C:\r\n print(\"YES\")\r\nelif b+D== d1+F:\r\n print(\"YES\")\r\nelif b+E== c1+F:\r\n print(\"YES\")\r\nelif b+F== d1+D:\r\n print(\"YES\")\r\nelif c+E== b1+F:\r\n print(\"YES\")\r\nelif c+F== b1+E:\r\n print(\"YES\")\r\nelif d+F== b1+D:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "nums = list(map(int,input().split()))\nflag = 1\nsum_ = sum(nums)\nif sum_ % 2 != 0:\n flag = 1\nelse:\n for i in range(len(nums)):\n for j in range(i+1,len(nums)):\n for k in range(j+1,len(nums)):\n if nums[i] + nums[j] + nums[k] == sum_//2:\n flag = 0\n\nif flag == 0:\n print(\"YES\")\nelse:\n print(\"NO\")\n \n\n \n\n \t\t\t\t \t\t \t \t\t\t \t\t \t \t \t \t\t \t\t", "a = list(map(int, input().split(' ')))\r\n\r\nans = 0\r\n\r\nfor i in range(6):\r\n\tfor j in range(i + 1, 6):\r\n\t\tfor k in range(j + 1, 6):\r\n\t\t\tn = list(range(6))\r\n\t\t\tsum1 = a[i] + a[j] + a[k]\r\n\t\t\tn.remove(i)\r\n\t\t\tn.remove(j)\r\n\t\t\tn.remove(k)\r\n\t\t\tsum2 = 0\r\n\t\t\tfor h in n:\r\n\t\t\t\tsum2 += a[h]\r\n\t\t\tif sum1 == sum2:\r\n\t\t\t\tans += 1\r\n\t\t\t\tbreak\r\n\r\nif ans > 0:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')", "a = list(map(int, input().split()))\r\nsuma = sum(a)\r\nn = 6\r\nans = 'NO'\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 if (a[i] + a[j] + a[k]) * 2 == suma:\r\n ans = 'YES'\r\nprint(ans)", "a = list(map(int, input().split()))\nc = \"NO\"\nq=0;\nfor u in range(len(a)):\n\tq+=a[u]\nfor i in range(0, 6):\n\tfor j in range(len(a)):\n\t\tfor k in range(len(a)):\n\t\t\tif i!=k and i!=j and k!=j:\n\t\t\t\tif a[i]+a[k]+a[j]==q/2:\n\t\t\t\t\tc = \"YES\"\n\t\t\t\t\tbreak\nprint(c)", "a = list(map(int, input().split()))\r\na.sort()\r\ns = sum(a)\r\nans = \"NO\"\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n if i == j:\r\n continue\r\n ss = a[i] + a[j]\r\n for k in range(len(a)):\r\n if k == j or k == i:\r\n continue\r\n \r\n sss = ss + a[k]\r\n if s - sss == sss:\r\n ans = \"YES\"\r\n break\r\n \r\nprint(ans)", "l=tuple(map(int, input().split()))\r\nsu=sum(l)\r\nif su%2!=0:\r\n print('NO')\r\nelse:\r\n su//=2\r\n b=False\r\n for i in range(6):\r\n for j in range(6):\r\n if i==j:\r\n break\r\n for h in range(6):\r\n if h==i or h==j:\r\n break\r\n b=l[i]+l[j]+l[h]==su\r\n if b:\r\n print('YES')\r\n break\r\n if b:\r\n break\r\n if b:\r\n break\r\n else:\r\n print('NO')\r\n", "import itertools\n\na = list(map(int, input().split()))\ns = sum(a)\nfor i in itertools.permutations(a, r = 3):\n if sum(i) * 2 == s:\n print(\"YES\")\n exit(0)\nprint(\"NO\")", "from itertools import permutations\r\no = \"NO\"\r\nx = [int(x) for x in input().split()]\r\ny = permutations([1,2,3,4,5,6])\r\nfor i in list(y):\r\n if x[int(i[0])-1]+x[int(i[1])-1]+x[int(i[2])-1]==x[int(i[3])-1]+x[int(i[4])-1]+x[int(i[5])-1]:\r\n o = \"YES\"\r\n print(o)\r\n break\r\nif o == \"NO\":\r\n print(o)\r\n", "from itertools import permutations\nm=list(map(int,input().split()))\nfor p in permutations(m):\n\tif(p[0]+p[1]+p[2]==p[3]+p[4]+p[5]):\n\t\tprint(\"YES\")\n\t\texit()\nprint(\"NO\")\n", "a = sorted(map(int, input().split()))\ntotal = sum(a)\nif total % 2 == 0:\n half = total / 2\n ok = False\n for i in range(6):\n for j in range(6):\n for k in range(6):\n if i != j and j != k and k != i and a[i] + a[j] + a[k] == half:\n ok = True\n if ok:\n print(\"YES\")\n else:\n print(\"NO\")\nelse:\n print(\"NO\")", "a=list(map(int,input().split()))\r\ndef solve():\r\n s=sum(a)\r\n if s%2:\r\n print('NO');return\r\n for i in range(4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n if a[i]+a[j]+a[k]==s//2:\r\n print('YES');return \r\n print('NO')\r\n\r\nsolve()", "def foo():\r\n sila=list(map(lambda x:int(x),input().split()))\r\n kom1=[]\r\n players=[0,0,0]\r\n for i in range(6):\r\n sila2=sila[:]\r\n players[0]=sila2.pop(i)\r\n for z in range(5):\r\n sila3=sila2[:]\r\n players[1]=sila3.pop(z)\r\n for b in range(3):\r\n sila4=sila3[:]\r\n players[2]=sila4.pop(b)\r\n if sum(sila4)==sum(players):\r\n return 'YES'\r\n return 'NO'\r\nprint(foo())\r\n", "def main_function():\r\n participants = [int(i) for i in input().split(\" \")]\r\n is_answer_found = False\r\n sums = sum(participants)\r\n for i in range(len(participants)):\r\n for j in range(i + 1, len(participants)):\r\n for k in range(j + 1, len(participants)):\r\n if participants[i] + participants[j] + participants[k] == sums - (participants[i] + participants[j] + participants[k]):\r\n print(\"YES\")\r\n is_answer_found = True\r\n break\r\n if is_answer_found:\r\n break\r\n if is_answer_found:\r\n break\r\n if not is_answer_found:\r\n print(\"NO\")\r\n\r\n\r\nmain_function()", "from itertools import combinations as C\na = list(map(int,input().split()))\ns = sum(a)\nif (s & 1):\n\tprint(\"NO\")\n\texit()\nres = \"NO\"\nfor i in C(a,3):\n\tif sum(i) == s//2:\n\t\tres = \"YES\"\n\t\tbreak\nprint(res)", "a = sorted(map(int, input().split()))\r\ns = sum(a)\r\nif s % 2 != 0:\r\n print('NO')\r\n exit(0)\r\ns //= 2\r\nfor j in range(1, 6):\r\n for k in range(j+1, 6):\r\n if a[0] + a[j] + a[k]==s:\r\n print('YES')\r\n exit(0)\r\nprint('NO')\r\n", "a = [int(x) for x in input().split()]\r\nsum=0;\r\nfor i in a:\r\n sum=sum+i\r\nfor i in range(0,6):\r\n for j in range (0,6):\r\n for k in range (0,6):\r\n if((k!=j and j!=i) and i!=k):\r\n if(sum-(a[i]+a[j]+a[k])==(a[i]+a[j]+a[k])):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") ", "arr = list(map(int, input().split()))\r\ns = sum(arr)\r\n\r\nposs = False\r\nfor i in range(3):\r\n for j in range(i+1, 4):\r\n for k in range(j+1, 5):\r\n if (arr[i] + arr[j] + arr[k]) == s/2:\r\n poss = True\r\n break\r\n\r\nif poss:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n \r\n", "\r\nl = list(map(int,input().split()))\r\n\r\nm = sum(l)\r\n\r\nfor i in range(6):\r\n for j in range(i+1 , 6):\r\n for k in range(j + 1 , 6):\r\n if 2 * (l[i] + l[j] + l[k]) == m :\r\n print('YES')\r\n exit()\r\n\r\n\r\nprint('NO')\r\n\r\n\r\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nimport itertools\r\na = IL()\r\nsa = sum(a)\r\ntm = list(map(sum, itertools.permutations(a, 3)))\r\nprint(\"YES\" if sa/2 in tm else \"NO\")", "from itertools import permutations;print(\"NYOE S\"[any(sum(a[:3])==sum(a[3:]) for a in permutations(map(int,input().split())))::2])\r\n", "#python3\r\n#utf-8\r\n\r\nfrom itertools import permutations\r\n\r\nidx___power = [int(x) for x in input().split()]\r\n\r\nfor perm in permutations(idx___power):\r\n if sum(perm[:3]) == sum(perm[3:]):\r\n print('YES')\r\n quit()\r\nprint('NO')\r\n", "import math\n\ndef main():\n a = list(map(int, input().split()))\n s = 0\n for i in a: s += i\n for i in range(4):\n for j in range(i + 1, 5):\n for k in range(j + 1, 6):\n if (a[i] + a[j] + a[k]) * 2 == s:\n print(\"YES\")\n return\n print(\"NO\")\n\n\n\n\n\n\nmain()\n", "a = [int(s) for s in input().split()]\r\ns = a[0] + a[1] + a[2] + a[3] + a[4] + a[5]\r\nfor i in range(len(a)):\r\n for j in range(len(a)):\r\n for k in range(len(a)):\r\n if ((a[i] + a[j] + a[k] == s / 2) and not (i == j or j == k or i == k)):\r\n print(\"YES\")\r\n quit()\r\nprint(\"NO\")", "a=sorted(list(map(int,input().split())))\r\nfor i in range(6):\r\n for j in range(i+1,6):\r\n for k in range(j+1,6):\r\n if a[i]+a[j]+a[k]==(sum(a)/2):\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "a = input().split()\r\ns = 0\r\nfor i in a:\r\n\ts += int(i)\r\nif s % 2 != 0:\r\n\tprint(\"NO\")\r\nelse:\r\n\tflag = False\r\n\ts = s // 2\r\n\tfor i in range(0,6):\r\n\t\tfor j in range(0,6):\r\n\t\t\tif i == j:\r\n\t\t\t\tcontinue\r\n\t\t\tfor k in range(0,6):\r\n\t\t\t\tif i == k or j == k :\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tif (int(a[i]) + int(a[j]) + int(a[k])) == s:\r\n\t\t\t\t\tflag = True\r\n\t\t\t\t\tbreak\r\n\t\t\tif flag == True:\r\n\t\t\t\tbreak\r\n\t\tif flag == True:\r\n\t\t\tbreak\r\n\tif flag == False:\r\n\t\tprint(\"NO\")\r\n\telse :\r\n\t\tprint(\"YES\")\r\n \r\n", "from itertools import combinations\na=[int(x) for x in input().split()]\nb=[0,1,2,3,4,5]\nk=list(combinations(b, 3))\ns=0\nfor i in k:\n c=b[:]\n c.remove(i[0])\n c.remove(i[1])\n c.remove(i[2])\n if a[i[0]]+a[i[1]]+a[i[2]]==a[c[0]]+a[c[1]]+a[c[2]]:\n s+=1\nif s>0:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "a = list(map(int, input().split()))\r\n\r\ns=0\r\n\r\nfor t in a:\r\n\ts+=t\r\n\r\ndef check(a,s):\r\n\tfor i in range(6):\r\n\t\tfor j in range(i+1,6):\r\n\t\t\tfor g in range(j+1,6):\r\n\t\t\t\tif a[i]+a[j]+a[g] == s/2:\r\n\t\t\t\t\treturn \"YES\"\r\n\r\n\treturn \"NO\"\r\n\r\nprint(check(a,s))", "from itertools import combinations\r\n\r\na = list(map(int, input().split()))\r\nx = list(combinations([0,1,2,3,4,5], 3))\r\nfor i in x:\r\n m = list(i)\r\n q = a[m[0]] + a[m[1]] + a[m[2]]\r\n g = sum(a) - q\r\n if q == g:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "from itertools import permutations\r\n \r\na = list(map(int, input().split()))\r\n \r\nfor x in permutations(tuple(a), 6):\r\n if sum(x[:3]) == sum(x[3:6]):\r\n print(\"YES\")\r\n break\r\nelse: print(\"NO\")", "n = list(map(int, input().split()))\r\nSum = sum(n)\r\nr = False\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 (n[i] + n[j] + n[k] == Sum/2):\r\n r = True\r\nif (r == True):\r\n print ('YES')\r\nelse:\r\n print ('NO')\r\n", "a=list(map(int,input().split()))\r\nc=0\r\ns=sum(a)\r\nl=len(a)\r\nif s%2==0:\r\n for i in range(l):\r\n for j in range(l):\r\n for k in range(l):\r\n if (i!=j and j!=k and i!=k) and a[i]+a[j]+a[k]==s/2:\r\n c+=1\r\n break\r\n if c>0:\r\n print('YES')\r\n else:\r\n print('NO')\r\nelse:\r\n print('NO')\r\n ", "a=list(map(int,input().split()))\r\nsolved=False\r\nfor i in range(len(a)) :\r\n for j in range(i+1,len(a)) :\r\n for k in range(j+1,len(a)) :\r\n rest=a.copy()\r\n g=a[i]+a[j]+a[k]\r\n rest.remove(a[i])\r\n rest.remove(a[j])\r\n rest.remove(a[k])\r\n if sum(rest)==g :\r\n print('YES')\r\n solved=True\r\n break\r\n if solved==True :\r\n break\r\n if solved==True :\r\n break\r\nif solved==False :\r\n print('NO')\r\n \r\n \r\n", "def get_value(a, arr):\n sum = 0\n\n i = 0\n\n while i < 6:\n if i in arr:\n i += 1\n continue\n else:\n sum += a[i]\n i += 1\n\n return sum\n\na = [int(elem) for elem in input().split()]\n\nn1 = 0\nn2 = 0\n\narr = []\n\nsum1 = 0\nsum2 = 0\n\nexit = False\n\nfor i in range(4):\n arr.append(i)\n sum1 += a[i]\n for j in range(i+1, 5):\n sum1 += a[j]\n arr.append(j)\n for z in range(j + 1, 6):\n arr.append(z)\n sum1 += a[z]\n\n sum2 = get_value(a, arr)\n\n if sum1 == sum2:\n print(\"YES\")\n exit = True\n break\n\n arr = arr[:2]\n sum1 -= a[z]\n\n if exit == True:\n break\n arr = arr[:1]\n sum1 -= a[j]\n arr = []\n if exit == True:\n break\n sum1 -= a[i]\nelse:\n print(\"NO\")", "from itertools import combinations\r\n\r\nnumbers = list(map(int,input().split()))\r\ntemp = numbers\r\ncombs = combinations(numbers, 3)\r\n\r\nans= \"NO\"\r\n\r\nfor comb in combs:\r\n numbers = temp.copy()\r\n for i in comb:\r\n numbers.remove(i)\r\n if sum(comb) == sum(numbers):\r\n ans = \"YES\"\r\n break\r\n\r\nprint(ans)", "s = list(map(int, input().split()))\r\nresult = \"NO\"\r\n\r\nfor i in range(len(s)):\r\n for ix in range(len(s)):\r\n if i != ix:\r\n for iy in range(len(s)):\r\n if ix != iy and iy != i:\r\n for iz in range(len(s)):\r\n if iz != iy and iz != ix and iz != i: \r\n for ia in range(len(s)):\r\n if ia != iz and ia != iy and ia != ix and ia != i:\r\n for ib in range(len(s)):\r\n if ib != ia and ib != iz and ib != iy and ib != ix and ib != i:\r\n if s[i] + s[ix] + s[iy] == s[iz] + s[ia] + s[ib]:\r\n result = \"YES\"\r\n break\r\nprint(result)\r\n", "scores = list(map(int, input().split()))\r\n\r\nfor a in range(len(scores)):\r\n for b in range(len(scores)):\r\n for c in range(len(scores)):\r\n for d in range(len(scores)):\r\n for e in range(len(scores)):\r\n for f in range(len(scores)):\r\n if a not in [b,c,d,e,f] and b not in [a,c,d,e,f] and c not in [a,b,d,e,f] and d not in [a,b,c,e,f] and e not in [a,b,c,d,f] and f not in [a,b,c,d,e]:\r\n if scores[a] + scores[b] + scores[c] == scores[d] + scores[e] + scores[f]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "import itertools\r\nlst = list(map(int,input().split()))\r\nsu = sum(lst)\r\ncombi = itertools.combinations(lst,3)\r\nfor i in combi:\r\n\tif sum(i)*2 == su:\r\n\t\tprint(\"YES\")\r\n\t\texit()\r\nprint(\"NO\")", "a = [int(i) for i in input().split()]\r\n\r\nsumN = 0\r\n\r\nfor i in range(6):\r\n sumN += a[i]\r\n\r\nif sumN % 2 != 0:\r\n print(\"NO\")\r\nelse:\r\n sumN //= 2\r\n for i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if a[i] + a[j] + a[k] == sumN:\r\n print(\"YES\")\r\n exit(0)\r\n\r\n print(\"NO\")\r\n", "# https://code.activestate.com/recipes/252178/\ndef all_perms(elements):\n if len(elements) <=1:\n yield elements\n else:\n for perm in all_perms(elements[1:]):\n for i in range(len(elements)):\n yield perm[:i] + elements[0:1] + perm[i:]\n\ndef ACMICPC():\n elements = list(map(int, input().split(' ')))\n allElements = list(all_perms(elements))\n for element in allElements:\n if(element[0] + element[1] + element[2] == element[3] + element[4] + element[5]):\n return \"YES\"\n return \"NO\"\n\n\nif __name__ == \"__main__\":\n print(ACMICPC())\n\n \t \t\t\t \t \t\t \t \t\t \t \t \t \t", "n = list(map(int, input().split()))\n\na = sum(n)\nc = False\nfor i in range(1, len(n)) :\n\tfor j in range(1, len(n)) :\n\t\tif (n[0]+n[i]+n[j])*2 == a and i!=j :\n\t\t\tc = True\nif c :\n\tprint('YES')\nelse:\n\tprint('NO')\n", "seq=list(map(int, input().split()))\r\ntotsum=sum(seq)\r\nans=False\r\nfor i in range(1<<6):\r\n count=0\r\n tempsum=0\r\n for j in range(6):\r\n if(i & 1<<j):\r\n count+=1\r\n tempsum+=seq[j]\r\n if(count==3 and (2*tempsum==totsum)):\r\n ans=True\r\n break\r\nif(ans):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "l = list(map(int, input().split()))\r\n \r\n \r\ns = sum(l)\r\nif s % 2 != 0:\r\n\tprint('NO')\r\n\texit()\r\n \r\nfor i in range(6):\r\n\tfor j in range(i + 1, 6):\r\n\t\tfor k in range(j + 1, 6):\r\n\t\t\tif l[i] + l[j] + l[k] == s // 2:\r\n\t\t\t\tprint('YES')\r\n\t\t\t\texit()\r\n \r\n \r\nprint('NO')", "a=list(map(int,input().split()))\r\nteste=False\r\nfor i in range(4):\r\n for e in range(i+1,5):\r\n for j in range(e+1,6):\r\n k=[0,1,2,3,4,5]\r\n del k[k.index(i)]\r\n del k[k.index(j)]\r\n del k[k.index(e)]\r\n \r\n if(a[i]+a[j]+a[e]==a[k[0]]+a[k[1]]+a[k[2]]):\r\n teste=True\r\n \r\n\r\nif(teste):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(map(int,input().split()))\na.sort()\nm=sum(a); s=a[0]\na=a[1:]; q=\"NO\"\nfor i in range(5):\n for j in range(5):\n if i!=j:\n if 2*(s+a[i]+a[j])==m:\n q=\"YES\"; break \nprint(q)\n \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 solve(A):\r\n n = 6\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 (A[i] + A[j] + A[k]) * 2 == sum(A):\r\n return True\r\n return False\r\n\r\ndef main():\r\n A = list(map(int, input().split()))\r\n if solve(A):\r\n print('YES')\r\n else:\r\n print('NO')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "hihi = [int(i) for i in input().split()]\r\nfor i in range(6):\r\n for j in range(i+1,6):\r\n for k in range(j+1,6):\r\n if sum(hihi) == 2*(hihi[i]+hihi[j]+hihi[k]):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "from itertools import permutations\r\nn=list(map(int,input().split()))\r\nk=0\r\nc=permutations(n)\r\nfor i in c:\r\n w=i[:(len(i)//2)]\r\n v=i[(len(i)//2):]\r\n if(sum(w)==sum(v)):\r\n k=k+1\r\n break\r\nif(k>0):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a=list(map(int,input().split()))\r\ns=0\r\nfor i in range(6):\r\n s+=a[i]\r\nif s % 2 !=0:\r\n print('NO')\r\n raise SystemExit\r\nelse:\r\n s=s//2\r\nfor i in range(4):\r\n for j in range(i+1,5):\r\n for e in range(j+1,6):\r\n if a[i]+a[j]+a[e]==s:\r\n print('YES')\r\n raise SystemExit\r\nprint('NO')\r\n", "A=[int(i) for i in input().split(\" \")]\r\nflag=0\r\nfor i in range(len(A)):\r\n for j in range(i+1,len(A)):\r\n for k in range(j+1,len(A)):\r\n if A[i]+A[j]+A[k]==sum(A)-A[i]-A[j]-A[k]:\r\n flag=1\r\nprint(\"YES\") if flag else print(\"NO\")\r\n", "a,b,c,d,e,f=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nd=int(d)\r\ne=int(e)\r\nf=int(f)\r\n\r\n\r\nif (a+b+c==d+e+f) :\r\n print(\"YES\")\r\nelif (a+b+d==c+e+f) :\r\n print(\"YES\")\r\nelif (a+b+e==c+d+f) :\r\n print(\"YES\")\r\nelif (a+b+f==c+d+e) :\r\n print(\"YES\")\r\nelif (a+d+c==b+e+f) :\r\n print(\"YES\")\r\nelif (a+e+c==d+b+f) :\r\n print(\"YES\")\r\nelif (a+f+c==d+b+e) :\r\n print(\"YES\")\r\nelif(d+b+c==a+e+f) :\r\n print(\"YES\") \r\nelif (e+b+c==d+a+f) :\r\n print(\"YES\")\r\nelif (f+b+c==d+e+a) :\r\n print(\"YES\") \r\nelse:\r\n print(\"No\")\r\n ", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nMOD = 1000000007\r\ndef inp(): return sys.stdin.readline().strip()\r\ndef ii(): return int(inp())\r\ndef iis(): return [int(i) for i in inp().split()]\r\n\r\n\r\ndef solve():\r\n a = iis()\r\n i1 = 0\r\n s1 = a[i1]\r\n for i2, s2 in enumerate(a):\r\n if i2 != i1:\r\n for i3, s3 in enumerate(a):\r\n if i3 != i2 and i3 != i1:\r\n team1_score = s1 + s2 + s3\r\n team2_score = sum(\r\n [s for (i, s) in enumerate(a) if (i != 0 and i != i2 and i != i3)])\r\n if team1_score == team2_score:\r\n return True\r\n return False\r\n\r\n\r\nprint(\"YES\" if solve() else \"NO\")\r\n", "m =input().split()\r\nn = 1 \r\nsum = 0\r\nwhile n < len(m):\r\n for i in range(len(m)-n):\r\n if m[i] > m[i+1]:\r\n m[i],m[i+1] = m[i+1],m[i]\r\n n += 1\r\nif int(max(m))+ int(m[0]) + int(m[1]) == int(m[2]) + int(m[3]) + int(m[4]):\r\n print('YES')\r\nelif int(max(m))+ int(m[2]) + int(m[1]) == int(m[0]) + int(m[3]) + int(m[4]):\r\n print('YES')\r\nelif int(max(m))+ int(m[2]) + int(m[0]) == int(m[1]) + int(m[3]) + int(m[4]):\r\n print('YES')\r\nelif int(max(m))+ int(m[3]) + int(m[0]) == int(m[2]) + int(m[1]) + int(m[4]):\r\n print('YES')\r\nelif int(max(m))+ int(m[3]) + int(m[1]) == int(m[0]) + int(m[2]) + int(m[4]):\r\n print('YES')\r\nelif int(max(m))+ int(m[2]) + int(m[3]) == int(m[0]) + int(m[1]) + int(m[4]):\r\n print('YES')\r\nelif int(max(m))+ int(m[4]) + int(m[0]) == int(m[1]) + int(m[3]) + int(m[2]):\r\n print('YES')\r\nelif int(max(m))+ int(m[4]) + int(m[1]) == int(m[0]) + int(m[3]) + int(m[2]):\r\n print('YES')\r\nelif int(max(m))+ int(m[2]) + int(m[4]) == int(m[0]) + int(m[3]) + int(m[1]):\r\n print('YES')\r\nelif int(max(m))+ int(m[4]) + int(m[3]) == int(m[0]) + int(m[1]) + int(m[2]):\r\n print('YES') \r\nelse:\r\n print('NO')", "from itertools import permutations\nl=list(map(int,input().split()))\ncount=0\ntemp=permutations(l)\nfor i in temp:\n #print(len(i)//2)\n m=i[:len(i)//2]\n n=i[len(i)//2:]\n #print(m)\n #print(n)\n if(sum(m)==sum(n)):\n count+=1\n break\nif(count!=0):\n print(\"yes\")\nelse:\n print(\"no\")\n", "import sys\r\n\r\na = list(map(int, sys.stdin.readline().split()))\r\nr = sum(a)\r\n\r\nif r % 2 != 0:\r\n print(\"NO\")\r\n exit(0)\r\n\r\nk = r // 2\r\n\r\nif a[0] + a[1] + a[2] == k:\r\n print(\"YES\")\r\nelif a[0] + a[1] + a[3] == k:\r\n print(\"YES\")\r\nelif a[0] + a[1] + a[4] == k:\r\n print(\"YES\")\r\nelif a[0] + a[1] + a[5] == k:\r\n print(\"YES\")\r\nelif a[0] + a[2] + a[3] == k:\r\n print(\"YES\")\r\nelif a[0] + a[2] + a[4] == k:\r\n print(\"YES\")\r\nelif a[0] + a[2] + a[5] == k:\r\n print(\"YES\")\r\nelif a[0] + a[3] + a[4] == k:\r\n print(\"YES\")\r\nelif a[0] + a[3] + a[5] == k:\r\n print(\"YES\")\r\nelif a[0] + a[4] + a[5] == k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = list(map(int, input().split()))\r\nn.sort()\r\ns = sum(n)\r\nif s < 2 * (n[5] + n[1] + n[0]) or s % 2 != 0 or 2 * (n[5] + n[0]) > s:\r\n print('NO')\r\nelif (n[5] + n[4] + n[0] == s // 2 or n[5] + n[3] + n[1] == s//2 or n[5] + n[3] + n[0] == s//2 or\r\n n[5] + n[2] + n[1] == s // 2 or n[5] + n[2] + n[0] == s//2 or n[5] + n[1] + n[0] == s//2):\r\n print('YES')\r\nelse:\r\n print('NO')", "from itertools import permutations\r\n\r\na = [int(i) for i in input().split()]\r\nc = 0\r\npre = list(permutations(a))\r\n\r\nfor i in pre:\r\n\tif sum(i[:3])==sum(i[3:]):\r\n\t\tc+=1\r\n\r\n\r\nif c:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")", "arr = list(map(int, input().split()))\ns = sum(arr)\nresp = \"NO\"\nif s % 2 == 0:\n if (arr[0] + arr[1] + arr[2]) == s/2:\n resp = \"YES\"\n elif arr[0] + arr[1] + arr[3] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[1] + arr[4] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[1] + arr[5] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[2] + arr[3] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[2] + arr[4] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[2] + arr[5] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[3] + arr[4] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[3] + arr[5] == s/2:\n resp = \"YES\"\n elif arr[0] + arr[4] + arr[5] == s/2:\n resp = \"YES\"\n else:\n resp = \"NO\"\nprint(resp)\n \t\t \t\t\t\t \t \t \t \t\t\t\t", "n1,n2,n3,n4,n5,n6 = input().split()\r\n\r\n\r\nn1 = int(n1)\r\nn2 = int(n2)\r\nn3 = int(n3)\r\nn4 = int(n4)\r\nn5 = int(n5)\r\nn6 = int(n6)\r\n\r\nif(n1+n2+n3 == n4+n5+n6):\r\n print('Yes')\r\nelif(n1+n2+n4 == n5+n3+n6):\r\n print('Yes')\r\nelif(n1+n2+n5 == n4+n3+n6):\r\n print('Yes')\r\nelif(n1+n2+n6 == n4+n5+n3):\r\n print('Yes')\r\nelif(n1+n4+n3 == n2+n5+n6):\r\n print('Yes')\r\nelif(n1+n5+n3 == n4+n2+n6):\r\n print('Yes')\r\nelif(n1+n6+n3 == n4+n2+n5):\r\n print('Yes')\r\nelif(n3+n2+n4 == n1+n5+n6):\r\n print('Yes')\r\nelif(n5+n2+n3 == n1+n4+n6):\r\n print('Yes')\r\nelif(n6+n2+n3 == n1+n4+n5):\r\n print('Yes')\r\n\r\nelse:\r\n print('NO') \r\n ", "import itertools\r\ns=[*map(int,input().split())]\r\nc = [*itertools.combinations(s,3)]\r\nif any((sum(x)*2==sum(s)) for x in c):print(\"YES\")\r\nelse:print(\"NO\")", "n = []\r\ns = 0\r\nflag = False\r\nd = input().split()\r\nfor i in range(6):\r\n d[i] = int(d[i])\r\n s = s + int(d[i])\r\nif s % 2 == 0:\r\n for i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n if d[i] + d[j] + d[k] == s / 2 and i != j and i != k and k != j:\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = [int(x) for x in input().split()]\r\nans = 'NO'\r\n\r\ndef ch(b, c, d):\r\n if a[b] + a[c] + a[d] == sum(a) - (a[b] + a[c] + a[d]):\r\n return True\r\n return False\r\n\r\n\r\nfor i in range(6):\r\n for j in range(6):\r\n for q in range(6):\r\n if i != j and j!=q and i!=q:\r\n if ch(i, j, q):\r\n ans = 'YES'\r\nprint(ans)", "s = input().split()\r\nfor i in range(len(s)):\r\n s[i] = int(s[i])\r\ns = sorted(s)\r\nans = 'NO'\r\nfor i in range(4):\r\n if ans == 'YES':\r\n break\r\n for j in range(i+1,5):\r\n if ans == 'YES':\r\n break\r\n for k in range(j+1,6):\r\n if ans == 'YES':\r\n break\r\n if s[i]+s[j]+s[k] == sum(s)/2:\r\n ans = 'YES'\r\nprint(ans)\r\n", "from sys import stdin\r\nfrom itertools import permutations\r\na = list(map(int, stdin.readline().split()))\r\nfor i in list(permutations(a)):\r\n if sum(i[:3]) == sum(i[3:6]):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')", "from itertools import combinations\r\na = [int(i) for i in input().split()]\r\nq = list(combinations(a, 3))\r\nres = \"NO\"\r\ns = sum(a)\r\nfor lst in q : \r\n \r\n if sum(lst) == s/2 : res = \"YES\"; break \r\nprint(res)", "# -*- coding: utf-8 -*-\r\n\r\nimport math\r\nimport collections\r\nimport bisect\r\nimport heapq\r\nimport time\r\nimport random\r\nimport itertools\r\nimport sys\r\n\r\n\"\"\"\r\ncreated by shhuan at 2017/11/12 23:56\r\n\r\n\"\"\"\r\n\r\nA = [int(x) for x in input().split()]\r\n\r\n\r\nidx = [i for i in range(6)]\r\n\r\ntotal = sum(A)\r\nif total % 2 != 0:\r\n print('NO')\r\n exit(0)\r\nfor i in itertools.combinations(idx, 3):\r\n # print(i)\r\n half = sum([A[j] for j in i])\r\n if half == total // 2:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "L = list(map(int, input().split()))\r\nsum = 0\r\nfor i in range(6):\r\n sum += L[i]\r\nif sum % 2 == 1:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(6):\r\n for j in range(i+1, 6):\r\n for k in range(j+1, 6):\r\n if L[i] + L[j] + L[k] == sum // 2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "a = [int(z) for z in input().split()]\r\nz = 0\r\nz = sum(a)\r\nif z % 2 == 1:\r\n print(\"NO\")\r\n exit(0)\r\nst = 0\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n st = a[i] + a[j] + a[k]\r\n if z // 2 == st:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "a = list(map(int, input().split()))\r\ns = sum(a)\r\nflag = False\r\nfor i in range(0, 6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if a[i] + a[j] + a[k] == s / 2:\r\n flag = True\r\nif flag:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "from itertools import combinations\n\nl = [int(x) for x in input().split()]\n\ns = sum(l)\nif s % 2 == 1:\n print(\"NO\")\n exit(0)\n\nfor i in combinations(l, 3):\n if sum(i) == s // 2:\n print(\"YES\")\n break\nelse:\n print(\"NO\")", "a=list(map(int,input().split()))\r\nc=0\r\nfor i in range(0,4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n if((a[i]+a[k]+a[j])*2==sum(a)):\r\n c=1\r\nif(c==1 and sum(a)%2==0):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a=list(map(int,input().split()))\r\nsm=sum(a)\r\nif sm%2:\r\n print('No')\r\nelse:\r\n for i in range(4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n if a[i]+a[j]+a[k]==sm/2:\r\n print(\"Yes\")\r\n exit(0)\r\n print(\"No\")", "from itertools import permutations\r\n\r\nscores = map(int, input().split())\r\n\r\nfor p in permutations(scores):\r\n if p[0]+p[1]+p[2] == p[3]+p[4]+p[5]:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")", "from itertools import combinations\r\n \r\ndef sss(x,model):\r\n test_2 = test.copy()\r\n for i in x: \r\n test_2.remove(i)\r\n if sum(test_2) == model:\r\n return True\r\n return False\r\n \r\ntest =list(map(int, input().split()))\r\nmodel = sum(test)/2\r\nflag = False\r\n \r\nif not model%1:\r\n for i in combinations(test,3):\r\n if sum(i) == model and sss(i,model):\r\n flag = True\r\n break\r\n \r\nprint('YES' if flag else 'NO')\r\n", "a = list(map(int,input().split()))\r\nf=0\r\n\r\nfor i in range(5):\r\n for j in range(5):\r\n if i!=j:\r\n k=0\r\n\r\n for g in a:\r\n k+=g\r\n\r\n if a[i]+a[j]+a[5]==k-a[j]-a[i]-a[5]:\r\n f=1\r\n break\r\n\r\nif f==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "a=[int(i) for i in input().split()]\r\na=sorted(a)\r\nd=sum(a)\r\nflag=0\r\nfor i in range(0,len(a)-2):\r\n for j in range(i+1,len(a)-1):\r\n for k in range(j+1,len(a)):\r\n if((a[i]+a[j]+a[k])==d-(a[i]+a[j]+a[k])):\r\n flag=1\r\n break\r\nif(flag==0):\r\n print('NO')\r\nelse:\r\n print('YES')", "a = list(map(int,input().split()))\r\nb = sum(a)\r\nflag = False\r\ncount = 0\r\nfor i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n if a[i] + a[j] + a[k] == (b - (a[i] + a[j] + a[k])) and i != j and i != k and j != k:\r\n count += 1\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "arr = [int(x) for x in input().split()]\r\nt = sum(arr)\r\nf = False\r\nfor i in range(0,6):\r\n\tfor j in range(i+1,6):\r\n\t\tfor k in range(j+1,6):\r\n\t\t\ts = arr[i]+arr[j]+arr[k]\r\n\t\t\tif t == 2*s:\r\n\t\t\t\tf = True\r\nprint(\"YES\") if f else print(\"NO\")\r\n", "a=list(input().split(' '))\r\na=[int(i) for i in a]\r\ns=1\r\nhh=1\r\nc=0\r\nif sum(a)%2!=0:\r\n hh=0\r\nelse:\r\n c=int(sum(a)/2)\r\nimport itertools\r\nb=[x for x in itertools.combinations(a,3)]\r\nk=[sum(m) for m in b]\r\nif c in k:\r\n s=1\r\nelse:\r\n s=0\r\nif s*hh == 1:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "from collections import Counter\r\n\r\nused = Counter()\r\n\r\narr = [int(i) for i in input().split()]\r\nindexes = []\r\n\r\ndef permute():\r\n\r\n if len(indexes) == 3:\r\n sum1 = 0\r\n sum2 = 0\r\n\r\n for i in range(6):\r\n if used[i]: sum1 += arr[i]\r\n else: sum2 += arr[i]\r\n \r\n if sum1 == sum2:\r\n print(\"YES\")\r\n exit()\r\n \r\n return\r\n\r\n for i in range(6):\r\n if not used[i]:\r\n indexes.append(i)\r\n used[i] += 1\r\n permute()\r\n indexes.pop()\r\n used[i] -= 1\r\n\r\npermute()\r\nprint(\"NO\")", "from sys import stdin, stdout\r\nfrom itertools import permutations\r\ndata = stdin.readline().rstrip().split(' ')\r\n#find sum\r\ntotal = 0\r\nfoundit=False\r\nfor i in data:\r\n i = int(i)\r\n total += i\r\nif total % 2 == 0:\r\n triple_pairs = permutations(data,3)\r\n for pair in triple_pairs:\r\n pair_l = [int(x) for x in pair]\r\n pair_sum = pair_l[0]+pair_l[1]+pair_l[2]\r\n if pair_sum == total/2:\r\n stdout.write('YES')\r\n foundit = True\r\n break\r\n if not foundit:\r\n stdout.write('NO')\r\nelse:\r\n stdout.write('NO')", "a=list(map(int,input().split()))\r\nb=a[0]+a[1]+a[2]+a[3]+a[4]+a[5]\r\ny=0\r\nt=0\r\nfor i in range(6):\r\n for j in range(6-(abs(i-6))+1,6):\r\n for k in range(6-(abs(j-6))+1,6):\r\n if (a[i]+a[j]+a[k])==(b//2) and (b%2==0):\r\n print('YES')\r\n y+=1\r\n break\r\n if y>0:\r\n break\r\n if y>0:\r\n break\r\nelse:\r\n print('NO')", "k = input().split()\r\nfor i in range(0, len(k)):\r\n k[i]=int(k[i])\r\n\r\n\r\nfor i in range(1, int(pow(6,2))):\r\n team1=0\r\n team2=0\r\n c=str(bin(i))[2:]\r\n c=\"0\"*(6-len(c))+c\r\n s=0\r\n for i in c:\r\n if i=='1':\r\n s+=1\r\n if s==3:\r\n for j in range(0, 6):\r\n if c[j]=='1':\r\n team1+=k[j]\r\n else:\r\n team2+=k[j]\r\n\r\n\r\n\r\n if team1==team2:\r\n print(\"YES\")\r\n exit()\r\n\r\n\r\nprint(\"NO\")\r\n", "\r\ndef ACM():\r\n\tscores = [*map(int, input().split())]\r\n\tn = len(scores)\r\n\tscores_sum = sum(scores)\r\n\tsums = []\r\n\t\r\n\tfor i in range(n-2):\r\n\t\t\r\n\t\tfor j in range(i+1, n-1):\r\n\t\t\t\r\n\t\t\tfor k in range(j+1, n):\r\n\t\t\t\t\r\n\t\t\t\ta = scores[i] + scores[j] + scores[k]\r\n\t\t\t\t\r\n\t\t\t\tif (scores_sum - a) == a:\r\n\t\t\t\t\t\r\n\t\t\t\t\treturn 'YES'\r\n\treturn 'NO'\r\n\t\r\n\t\r\nif __name__ == '__main__':\r\n\tprint(ACM())\r\n\t\r\n", "from itertools import combinations\n\nscores = list(map(int, input().split()))\nscores_combinations = combinations(scores, 3)\n\nt = sum(scores)\n\nif t % 2 != 0:\n print(\"NO\")\nelse:\n b = False\n for i in scores_combinations:\n s = sum(i)\n if s == t // 2:\n print(\"YES\")\n b = True\n break\n\n if b == False:\n print(\"NO\")\n\n\n \t\t \t \t\t \t \t \t\t\t\t \t\t \t", "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\nimport itertools\r\n\r\ns = list_input()\r\nperm = list(itertools.permutations(s))\r\nfor p in perm:\r\n x = p[0]+p[1]+p[2]\r\n y = p[3]+p[4]+p[5]\r\n if x == y:\r\n print('YES')\r\n exit(0)\r\nprint('NO')", "arr = [int (s) for s in input().split()]\r\ns = 0\r\nfor i in range(6):\r\n s += arr[i]\r\nflag = False\r\nfor a in range(4):\r\n for b in range(a+1, 5):\r\n for c in range(b+1, 6):\r\n if (arr[a] + arr[b] + arr[c])*2 == s:\r\n flag = True\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from itertools import permutations\n\npowers = list(map(int, input().split()))\n\n\ndef get_powers(indexes):\n return [powers[i] for i in indexes]\n\n\ndef main():\n for combination in permutations(range(6)):\n if sum(get_powers(combination[:3])) == sum(get_powers(combination[3:])):\n return 'YES'\n return 'NO'\n\n\nprint(main())\n", "\r\nimport itertools\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\nif s % 2 != 0:\r\n print(\"NO\")\r\n exit()\r\ncombs = itertools.combinations(a, 3)\r\nfor comb in combs:\r\n if s - sum(comb) == s // 2:\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\")\r\n\r\n\r\n", "a = list(map(int,input().split()))\r\ns = 0\r\nfor i in a:\r\n s += i\r\ni = 0;\r\nj = 1;\r\nz = 2;\r\ntest = True\r\nwhile (i < 4) and test:\r\n while (j < 5) and test:\r\n while (z < 6) and test:\r\n if (a[i] + a[j] + a[z] == s - a[i] - a[j] - a[z]):\r\n test = False\r\n z += 1\r\n j += 1\r\n z = j + 1\r\n i += 1\r\n j = i + 1\r\n z = i + 2\r\nif not test:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=[int(x) for x in input().split()]\r\nk=sum(a)\r\nif k%2!=0:\r\n print('NO')\r\nelse:\r\n check=1\r\n for i in range(0,6):\r\n for j in range(i+1,6):\r\n for t in range(j+1,6):\r\n if a[i]+a[j]+a[t]==k//2:\r\n check=0\r\n break\r\n if check==0:\r\n print('YES')\r\n else:\r\n print('NO')", "nums = list(map(int, input().split()))\r\n\r\nimport sys\r\nimport itertools\r\n\r\nfor item in itertools.permutations(nums):\r\n if(sum(item[:3]) == sum(item[-3:])):\r\n print(\"YES\")\r\n sys.exit()\r\n\r\nprint(\"NO\")\r\n", "from itertools import permutations\nA = list(map(int, input().split()))\nfor perm in permutations(A):\n if sum(perm[0:3]) == sum(perm[3:6]):\n print(\"YES\")\n exit()\n\nprint(\"NO\")\n", "a = [int(x) for x in input().split()]\n\n# student 0 always in the the 1st team\ns = sum(a)\ndone = False\nfor i in range(1, 6):\n if done:\n break\n for j in range(i+1, 6):\n # {0, i, j} vs rest\n total = a[0] + a[i] + a[j]\n rest = s - total\n if total == rest:\n print(\"YES\")\n done = True\n break\n\nif not done:\n print(\"NO\")\n \t \t\t\t \t\t \t\t\t \t \t\t\t", "#http://codeforces.com/problemset/problem/886/A\ninp = list(map(int, input().split(\" \") ))\nout = \"NO\"\nhalf = sum(inp)/2\nstate = \"NO\"\nfor i in range(1,5):\n\tfor j in range(i+1,6):\n\t\ttemp = inp[0] + inp[i] + inp[j]\n\t\tif(temp == half):\n\t\t\tstate=\"YES\"\n\nprint(state)\n", "a=list(map(int,input().split()))\r\nx=sum(a)\r\nl=-1\r\nfor i in range(0,6):\r\n for j in range(i+1,6):\r\n for g in range(j+1,6):\r\n if a[i]+a[j]+a[g]==x-(a[i]+a[j]+a[g]):\r\n l=1\r\nif l==1:\r\n print('YES')\r\nelse:\r\n print('NO')", "import itertools\r\n\r\nlst = map(int, input().split())\r\n\r\nfor perm in itertools.permutations(lst):\r\n\tif sum(perm[:3]) == sum(perm[3:]):\r\n\t\tprint('YES')\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')\r\n", "\n\n# 可以写for循环或者搜索，这里给出一个二进制枚举的解法\n\n\n\na = list(map(int, input().split()))\n\n\ndef count(x: int) -> int: # 返回x在二进制下1的个数\n ans = 0\n while x > 0:\n if x & 1:\n ans += 1\n x >>= 1\n return ans\n\n\n\n# 从0 到 *（1<<6）一共2^6个数，在二进制状态下是000000到111111\n# 用倒数第i位是0还是1代表第i个人分到第1组还是第二组\n\n\nans = False\nfor i in range(1 << 6): # 2^6对应所有分组状况\n if count(i) != 3: # 对于不符合分组的情况，即不满足每组3人，舍去\n continue\n sum1, sum2 = 0, 0\n for j in range(6):\n if i >> j & 1: # 检查i的倒数第j位是不是1（从低位开始即为倒数）\n sum1 += a[j]\n else:\n sum2 += a[j]\n if sum1 == sum2:\n ans = True\n break\nprint(\"YES\" if ans else \"NO\")\n\n \t \t \t \t \t \t \t \t \t", "Q=list(map(int,input().split()))\nA=0\nfor x in range(1,5):\n\tfor y in range(x+1,6):\n\t\tB=0\n\t\tfor i in range(1,6):\n\t\t\tif i!=x and i!=y:\n\t\t\t\tB+=Q[i]\n\t\tif B==Q[0]+Q[x]+Q[y]:\n\t\t\tA=1\nif A==1:\n\tprint('YES')\nelse:\n\tprint('NO')\n", "l=[int(x) for x in input().split()]\r\ns=sum(l)\r\nflag=0\r\nfor i in range(4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n if (l[i]+l[j]+l[k])*2==s:\r\n flag=1 \r\nif s%2 :\r\n flag=0\r\nif flag:\r\n print(\"yes\")\r\nelse:\r\n print(\"no\")", "from itertools import combinations\r\n\r\na = list(map(int, input().split()))\r\nfound = False\r\nfor comb in combinations(a, 3):\r\n if sum(comb) == sum(a) / 2:\r\n found = True\r\n break\r\nif found:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = list(map(int, input().split()))\nflag = True\nfor i in range(6):\n if flag:\n for j in range(i+1, 6):\n if flag:\n for k in range(j+1, 6):\n if a[i]+a[j]+a[k] == sum(a)-(a[i]+a[j]+a[k]):\n print(\"YES\")\n flag = False\n break\n else:\n break\n else:\n break\nif flag:\n print(\"NO\")\n \t\t \t\t \t\t\t\t \t \t\t \t\t \t", "a = list(map(int,input().split()))\r\nm = sum(a)\r\nif(m%2==0):\r\n m=m//2\r\n for i in range(len(a)):\r\n s=a[i]\r\n for j in range(len(a)):\r\n s=a[i]\r\n if(j==i):\r\n continue\r\n if(s+a[j]<=m):\r\n s+=a[j]\r\n for k in range(len(a)):\r\n if(k==i or k==j):\r\n continue\r\n if(s+a[k]==m):\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "import itertools\r\n\r\n\r\nl=list(map(int,input().split()))\r\nfor p in itertools.permutations(l):\r\n\tif sum(p[:3])*2==sum(p):\r\n\t\tprint('YES')\r\n\t\tbreak\r\nelse:\r\n\tprint('NO')", "from itertools import permutations\r\nprint(['NO','YES'][any(sum(a[:3])==sum(a[3:]) for a in permutations(list(map(int,input().split()))))])", "num1,num2,num3,num4,num5,num6=input().split()\r\nnum1=int(num1)\r\nnum2=int(num2)\r\nnum3=int(num3)\r\nnum4=int(num4)\r\nnum5=int(num5)\r\nnum6=int(num6)\r\n\r\nif num1+num2+num3==num4+num5+num6: \r\n print(\"YES\")\r\nelif num1+num2+num4==num3+num5+num6:\r\n print(\"YES\")\r\nelif num1+num2+num5==num3+num4+num6:\r\n print(\"YES\")\r\nelif num1+num2+num6==num3+num4+num5:\r\n print(\"YES\")\r\nelif num1+num4+num3==num2+num5+num6:\r\n print(\"YES\")\r\nelif num1+num5+num3==num2+num4+num6:\r\n print(\"YES\")\r\nelif num1+num6+num3==num2+num4+num5:\r\n print(\"YES\")\r\nelif num4+num2+num3==num1+num5+num6:\r\n print(\"YES\")\r\nelif num5+num2+num3==num1+num4+num6:\r\n print(\"YES\")\r\nelif num6+num2+num3==num1+num4+num5:\r\n print(\"YES\")\r\nelse:\r\n print(\"no\")\r\n ", "n1, n2, n3, n4, n5, n6 = input().split()\r\n\r\nn1 = int(n1)\r\nn2 = int(n2)\r\nn3 = int(n3)\r\nn4 = int(n4)\r\nn5 = int(n5)\r\nn6 = int(n6)\r\n\r\nif (n1+n2+n3) == (n4+n5+n6) :\r\n print(\"YES\")\r\n \r\nelif (n1+n3+n4) == (n2+n5+n6) :\r\n print(\"YES\")\r\nelif (n1+n3+n5) == (n4+n2+n6) :\r\n print(\"YES\")\r\nelif (n1+n3+n6) == (n4+n5+n2) :\r\n print(\"YES\")\r\n \r\nelif (n1+n2+n4) == (n3+n5+n6) :\r\n print(\"YES\")\r\nelif (n1+n2+n5) == (n4+n3+n6) :\r\n print(\"YES\")\r\nelif (n1+n2+n6) == (n4+n5+n3) :\r\n print(\"YES\")\r\n\r\nelif (n4+n2+n3) == (n1+n5+n6) :\r\n print(\"YES\")\r\nelif (n5+n2+n3) == (n4+n1+n6) :\r\n print(\"YES\")\r\nelif (n6+n2+n3) == (n4+n5+n1) :\r\n print(\"YES\")\r\n\r\nelse:\r\n print(\"NO\")", "from itertools import permutations\nprint(['NO','YES'][any(sum(x[:3]) == sum(x[3:]) for x in permutations(map(int, input().split())))])\n", "scores = list(map(int,input().strip().split(' ')))\n\ntot = sum(scores)\n\nif tot & 1:\n\tprint('NO')\n\nelse:\n\tbscore = tot // 2\n\tans = 'NO'\n\n\tfor i in range(4):\n\t\tfor j in range(i+1,5):\n\t\t\tfor k in range(j+1,6):\n\t\t\t\tif scores[i]+scores[j]+scores[k] == bscore:\n\t\t\t\t\tans = 'YES'\n\t\t\t\t\tbreak\n\n\tprint(ans)", "from itertools import permutations\r\n\r\na = list(map(int, input().split()))\r\n\r\nif sum(a) % 2 == 1:\r\n print('No')\r\nelse:\r\n s = sum(a) // 2\r\n\r\n for i in set(permutations(a)):\r\n if sum(i[:3]) == s:\r\n print('Yes')\r\n break\r\n else:\r\n print('No')\r\n\r\n", "a=list(map(int,input().split()))\r\na.sort()\r\nif a[0]+a[1]+a[2]==a[3]+a[4]+a[5] or a[0]+a[1]+a[3]==a[2]+a[4]+a[5] or a[0]+a[1]+a[4]==a[3]+a[2]+a[5] or a[0]+a[1]+a[5]==a[3]+a[4]+a[2] or a[3]+a[1]+a[2]==a[0]+a[4]+a[5] or a[0]+a[3]+a[2]==a[1]+a[4]+a[5] or a[4]+a[1]+a[2]==a[3]+a[0]+a[5] or a[5]+a[1]+a[2]==a[3]+a[4]+a[0] or a[0]+a[4]+a[2]==a[3]+a[1]+a[5] or a[0]+a[5]+a[2]==a[3]+a[4]+a[1]:\r\n\tprint(\"YES\")\r\nelse:\r\n\tprint(\"NO\")\r\n", "import itertools\r\nnumbers = [int(i) for i in input().split()]\r\nall_variants = itertools.permutations(numbers)\r\nfor variant in all_variants:\r\n\tif sum(variant[:3]) == sum(variant[3:]):\r\n\t\tprint('YES')\r\n\t\texit()\r\nprint('NO')", "from collections import Counter\nfrom fractions import Fraction\nfrom math import factorial\nfrom itertools import permutations\n\n# n=int(input)\ndef acm(a):\n for i in permutations(list(range(len(a))),3):\n if sum(a[x] for x in i)==sum(a[x] for x in [0,1,2,3,4,5] if x not in i):\n return \"YES\"\n return \"NO\"\n\na=list(map(int, input().split()))\nprint(acm(a))\n", "from itertools import combinations\ndef acm_icpc():\n line = [int(i) for i in input().split()]\n elem = set(range(6))\n comb = set(combinations(elem,3))\n for c in comb:\n time_2 = list(elem-set(c))\n if(line[c[0]]+line[c[1]]+line[c[2]]==line[time_2[0]]+line[time_2[1]]+line[time_2[2]]):\n print('YES')\n return\n print('NO')\n\nacm_icpc()\n\t\t \t \t\t\t \t\t\t\t\t \t\t\t\t \t\t", "a = sorted(list(map(int, input().split())))\nsa = sum(a)\n\nfor i in range(6):\n for j in range(i+1, 6):\n for k in range(j+1, 6):\n ps = a[i] + a[j] + a[k]\n if sa == 2 * ps:\n print(\"YES\")\n raise SystemExit\nprint(\"NO\")\n\n\t\t \t\t\t\t\t \t \t\t \t\t \t\t \t", "s = list( map( int, input().split() ) )\nsm = sum( s ) // 2\nf = 0\nfor i in range( 6 ):\n for j in range( i ):\n for k in range( j ):\n if s[ i ] + s[ j ] + s[ k ] == sm:\n f = 1\n break\nprint( \"YES\" if f == 1 and sum( s ) % 2 == 0 else \"NO\" )\n", "\na = [0, 0, 0, 0, 0, 0]\na[0], a[1], a[2], a[3], a[4], a[5] = input().split()\nfor i in range(6):\n a[i] = int(a[i])\nif a[0] + a[1] + a[2] == a[3] + a[4] + a[5]:\n print(\"YES\")\nelif a[0] + a[1] + a[3] == a[2] + a[4] + a[5]:\n print(\"YES\")\nelif a[0] + a[1] + a[4] == a[2] + a[3] + a[5]:\n print(\"YES\")\nelif a[0] + a[1] + a[5] == a[2] + a[3] + a[4]:\n print(\"YES\")\nelif a[0] + a[2] + a[3] == a[1] + a[4] + a[5]:\n print(\"YES\")\nelif a[0] + a[2] + a[4] == a[1] + a[3] + a[5]:\n print(\"YES\")\nelif a[0] + a[2] + a[5] == a[1] + a[3] + a[4]:\n print(\"YES\")\nelif a[0] + a[3] + a[4] == a[1] + a[2] + a[5]:\n print(\"YES\")\nelif a[0] + a[3] + a[5] == a[1] + a[2] + a[4]:\n print(\"YES\")\nelif a[0] + a[4] + a[5] == a[1] + a[2] + a[3]:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t \t \t\t\t\t\t \t \t\t\t\t\t \t\t \t", "a = list(map(int,input().split()))\r\nn = sum(a)\r\nfor i in range(len(a)-2):\r\n for j in range(i+1,len(a)-1):\r\n for k in range(j+1,len(a)):\r\n if n-(a[i]+a[j]+a[k])==n/2:\r\n print('YES')\r\n quit()\r\nprint('NO')", "scores = list(map(int, input().split()))\ntotal = sum(scores)\nfoundSolution = \"NO\"\nfor i in range(1,5):\n for j in range(i+1,6):\n if 2*(scores[0]+scores[i]+scores[j]) == total:\n foundSolution = \"YES\"\n break\nprint(foundSolution)\n\n\t \t \t \t \t \t \t \t \t\t \t\t \t", "def permute(xs, low=0):\r\n if low + 1 >= len(xs):\r\n yield xs\r\n else:\r\n for p in permute(xs, low + 1):\r\n yield p \r\n for i in range(low + 1, len(xs)): \r\n xs[low], xs[i] = xs[i], xs[low]\r\n for p in permute(xs, low + 1):\r\n yield p \r\n xs[low], xs[i] = xs[i], xs[low]\r\n\r\ni=input().split();\r\nfor p in permute([int(i[0]), int(i[1]), int(i[2]), int(i[3]), int(i[4]), int(i[5])]):\r\n if p[0]+p[1]+p[2]==p[3]+p[4]+p[5]:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")\r\n", "import itertools\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nfor i in itertools.combinations(a,3):\r\n if sum(i)*2==s:\r\n print('YES')\r\n exit()\r\nprint('NO')", "import itertools\r\nb = input().split()\r\na = list(map(int, b))\r\n\r\nfor x in itertools.permutations('012345',6):\r\n s1 = 0\r\n for i in range(3):\r\n s1 += a[int(x[i])]\r\n s2 = 0\r\n for i in range(3,6):\r\n s2 += a[int(x[i])]\r\n if s1==s2:\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n ", "s = [0, 1, 2, 3, 4, 5]\r\nd = []\r\na = list(map(int, input().split()))\r\nisPossible = False\r\nfor i in range(6):\r\n for j in range(i+1, 6):\r\n for k in range(j+1, 6):\r\n d = []\r\n for c in range(6):\r\n if (i!=c) and (j!=c) and (k!=c):\r\n d.append(c)\r\n if (a[i]+a[j]+a[k])==(a[d[0]]+a[d[1]]+a[d[2]]):\r\n isPossible = True\r\nif isPossible:\r\n print(\"YES\")\r\nelse: \r\n print(\"NO\")", "a1,a2,a3,a4,a5,a6=map(int, input().split())\r\na=[]\r\na.append(a1)\r\na.append(a2)\r\na.append(a3)\r\na.append(a4)\r\na.append(a5)\r\na.append(a6)\r\nk=0\r\nfor i in range(6):\r\n for j in range(6):\r\n for q in range(6):\r\n if (i!=j) and (i!=q) and (q!=j) and (a[i]+a[j]+a[q]==sum(a)-(a[i]+a[j]+a[q])):\r\n k+=1\r\nif k!=0:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "inp=lambda:map(int,input().split())\r\na=list(inp())\r\n\r\ns=0\r\nfor i in range(6):\r\n s+=a[i]\r\n\r\ns/=2\r\n\r\n\r\nfor i in range(6):\r\n for j in range(i+1,6):\r\n for k in range(j+1,6):\r\n if(a[i]+a[j]+a[k]==s):\r\n print(\"YES\")\r\n quit()\r\n\r\nprint(\"NO\")", "import sys\r\nfrom itertools import *\r\n\r\nl = list(map(int, input().split()))\r\n\r\nfor i in permutations(l):\r\n\tif sum(i[:3]) == sum(i[3:]):\r\n\t\tprint('YES')\r\n\t\tsys.exit(0)\r\n\r\nprint('NO')", "l=list(map(int,input().split()))\r\ns=sum(l)\r\nf=0\r\nfor i in range(4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n x=l[i]+l[j]+l[k]\r\n if((s-x)==x):\r\n f=1\r\n break\r\n if(f==1):\r\n break\r\n if(f==1):\r\n break\r\nif(f==0):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n ", "a, b, c, d, e, f = map(int,input().split())\r\nans = a + b + c + d + e + f\r\nif ans % 2 == 0:\r\n ans /= 2\r\n if a + b + c == ans or a + b + d == ans or a + b + e == ans or a + b + f == ans or a + c + d == ans or a + c + e == ans or a + c + f == ans or a + d + e == ans or a + d + f == ans or a + e + f == ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\nelse:\r\n print(\"NO\")\r\n", "# Belongs to : midandfeed aka asilentvoice\r\nq = [int(x) for x in input().split()]\r\ns = sum(q)\r\nfound = False\r\nfor i in range(6-2):\r\n\tfor j in range(i+1, 6-1):\r\n\t\tfor k in range(j+1, 6):\r\n\t\t\ttemp = q[i] + q[j] + q[k]\r\n\t\t\tif ( s-temp == temp ):\r\n\t\t\t\tfound = True\r\n\t\t\t\tbreak\r\n\tif found:\r\n\t\tbreak\r\nprint([\"NO\", \"YES\"][found])\r\n\t\r\n\t", "score_list = list(map(int,input().split(\" \")))\r\nscore_list.sort()\r\navg_score = sum(score_list)/2\r\nlow_score = score_list[0:3]\r\nup_score = score_list[3:6]\r\nscore1 = up_score[0]+up_score[1]\r\nscore2 = up_score[1]+up_score[2]\r\nscore3 = up_score[0]+up_score[2]\r\nfor i in low_score:\r\n if i + score1 == avg_score or i + score2 == avg_score or i + score3 == avg_score:\r\n ans = \"YES\"\r\n break\r\n else:\r\n ans = \"NO\"\r\n continue\r\nprint(ans)", "truth = 0\nzad = list(map(int, input().split()))\nfor i in range(len(zad)):\n #print(i, zad[i])\n for j in range(len(zad)):\n if i != j:\n #print(j, zad[j])\n for k in range(len(zad)):\n if j != k and k != i:\n #print(k, zad[k])\n if sum(zad) - zad[i] - zad[j] - zad [k] ==zad[i] + zad[j] + zad [k] :\n truth = 1\nprint(\"YES\" if truth == 1 else \"NO\")\n", "a=[int(x) for x in input().split()]\r\ns=sum(a)\r\nr=0\r\nfor i in range(6):\r\n for j in range(i+1,6):\r\n for l in range(j+1,6):\r\n if (a[i]+a[j]+a[l]==s/2):\r\n r=1\r\nif (r==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "from itertools import permutations as per\r\narr = list(map(int,input().split()))\r\nfor l in per(arr,6):\r\n if sum(l[:3]) == sum(l[3:]):\r\n print('YES')\r\n break\r\nelse:\r\n print('NO')\r\n", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\n\r\na = list(map(int, input().split()))\r\na.sort()\r\nif sum(a) % 2:\r\n print('NO')\r\n quit()\r\nfor i in range(4):\r\n for j in range(i+1, 5):\r\n for k in range(j+1, 6):\r\n if a[i] + a[j] + a[k] == sum(a) // 2:\r\n print('YES')\r\n quit()\r\nprint('NO')", "a = list(map(int, input().split()))\r\ns = sum(a)\r\nfor i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n if i != j and j != k and i != k:\r\n s1 = a[i] + a[j] + a[k]\r\n if s - s1 * 2 == 0:\r\n print('YES')\r\n exit()\r\nprint('NO')\r\n", "import itertools\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nif s%2!=0:\r\n print(\"NO\")\r\n exit\r\nelse:\r\n for i in itertools.permutations(a,r=3):\r\n if sum(i)==s//2:\r\n print(\"YES\")\r\n #print(i)\r\n exit(0)\r\n print(\"NO\") ", "a = list(map(int, input().split()))\r\nn = sum(a)\r\nf=0\r\nif n % 2 == 0:\r\n n //= 2\r\n for i in range(len(a)):\r\n for j in range(i+1,len(a)):\r\n for k in range(j+1,len(a)):\r\n if a[i]+a[j]+a[k]==n:\r\n f=1\r\nprint(\"YES\" if f else \"NO\")\r\n", "# 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\na=inar()\r\nn=len(a)\r\nsu=sum(a)\r\nif su%2:\r\n\tprint('NO')\r\nelse:\r\n\ts=su//2\r\n\tans='NO'\r\n\tfor i in range(0,n-2):\r\n\t\tfor j in range(i+1,n-1):\r\n\t\t\tfor k in range(j+1,n):\r\n\t\t\t\tif a[i]+a[j]+a[k]==s:\r\n\t\t\t\t\tans='YES'\r\n\tprint(ans)\r\n\r\n\r\n\r\n", "a=list(map(int,input().split()))\r\na.sort()\r\nm=sum(a); s=a[0]\r\na=a[1:]; q=\"NO\"\r\nfor i in range(5):\r\n for j in range(5):\r\n if i!=j:\r\n if 2*(s+a[i]+a[j])==m:\r\n q=\"YES\"; break \r\nprint(q)\r\n# for x in a:\r\n# for y in a:\r\n# if 2*(s+x+y)==m:\r\n# q=\"YES\"; break \r\n\r\n\r\n\r\n", "from itertools import combinations\n\ns = [int(i) for i in input().split()]\n\nfor p in combinations(range(6), 3):\n t1 = 0\n t2 = 0\n for i in range(6):\n if i in p:\n t1 += s[i]\n else:\n t2 += s[i]\n if t1 == t2:\n print(\"YES\")\n exit(0)\n\nprint(\"NO\")\n", "a = list(map(int, input().split()))\r\ns = sum(a)\r\nans = \"NO\"\r\nfor a1 in range(6):\r\n if ans == \"YES\": break\r\n for a2 in range(a1+1,6):\r\n for a3 in range(a2+1,6):\r\n if a[a1]+a[a2]+a[a3] == s - (a[a1]+a[a2]+a[a3]):\r\n ans = \"YES\"\r\nprint(ans)", "mas = list(map(int, input().split()))\r\nfor a in range(4):\r\n for b in range(a+1, 5):\r\n for c in range(b+1, 6):\r\n if (sum(mas) / 2) - (mas[a] + mas[b] + mas[c]) == 0:\r\n print(\"YES\")\r\n exit(0)\r\nprint(\"NO\")", "m=list(map(int,input().split()))\r\nif sum(m)%2==1:\r\n print(\"NO\")\r\nelse:\r\n su=sum(m)//2\r\n p=0\r\n for i in set(range(6)):\r\n for j in set(range(6))-set([i]):\r\n for k in set(range(6))-set([i,j]):\r\n if m[i]+m[j]+m[k]==su:\r\n p=1\r\n print(\"YES\") if p==1 else print(\"NO\")", "a = list(map(int, input().split()))\r\ns = sum(a)\r\nfor i in range(1, 5):\r\n for j in range(i + 1, 6):\r\n x = a[0] + a[i] + a[j];\r\n if (x == s - x):\r\n print('YES')\r\n exit()\r\nprint('NO')", "ar = list(map(int, input().split()))\r\nsumo = sum(ar)\r\nkoi = False\r\nfor i in range(0, 6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n sumo1 = ar[i] + ar[j] + ar[k]\r\n if sumo1 == (sumo - sumo1):\r\n koi = True\r\n break\r\n if koi:\r\n break\r\n if koi:\r\n break\r\n \r\nif koi:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a = list(map(int, input().split()))\na.sort(reverse=True)\nif sum(a)%2==0:\n ketemu = False\n dicari = sum(a)/2\n for i in range(1,len(a)):\n for j in range(2, len(a)):\n if i != j and a[0]+a[i]+a[j] == dicari:\n ketemu = True\n print(\"YES\") if ketemu else print(\"NO\")\nelse: print(\"NO\")\n", "import sys\r\n\r\np = [int(x) for x in input().split() ]\r\nsum = sum(p)\r\nif sum%2 != 0 :\r\n\tprint(\"NO\")\r\n\texit()\r\nfor i in range(6):\r\n\tfor j in range(i+1,6):\r\n\t\tfor k in range(j+1,6):\r\n\t\t\tif p[i] + p[j] + p[k] == sum//2:\r\n\t\t\t\tprint(\"YES\")\r\n\t\t\t\texit()\r\n\r\nprint(\"NO\")", "import sys\n\narr = [int(x) for x in input().split()]\ns = sum(arr)\n\nif s % 2 == 1:\n print(\"NO\")\n sys.exit(0)\nfor i in range(4):\n target = (s // 2) - arr[i]\n dic = {}\n for j in range(i + 1, 6):\n if dic.get(target - arr[j], None) != None:\n print(\"YES\")\n sys.exit(0)\n dic[arr[j]] = j\n\nprint(\"NO\")\n", "a = []\r\nsum = 0\r\nline = input().split()\r\nfor i in range(6):\r\n a.append(int(line[i]))\r\n sum += a[i]\r\n pass\r\nhalf = sum // 2\r\nif sum != half * 2:\r\n print('NO')\r\n pass\r\nelse:\r\n ok = 0\r\n for i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if a[i] + a[j] + a[k] == half:\r\n ok = 1\r\n pass\r\n continue\r\n continue\r\n continue\r\n if ok == 1:\r\n print('YES')\r\n pass\r\n else:\r\n print('NO')\r\n pass", "from functools import reduce\r\n\r\nL=list(map(int,input().split()))\r\nL.sort()\r\ns=reduce(lambda x,y:x+y,L)\r\nif(s%2!=0):\r\n\tprint(\"NO\")\r\nelse:\r\n\tcount=0\r\n\tfor i in range(0,6):\r\n\t\tfor j in range(0,i):\r\n\t\t\tfor k in range(0,j):\r\n\t\t\t\tif(L[i]+L[j]+L[k]==s//2):\r\n\t\t\t\t\tcount+=1\r\n\tif(count>=2):\r\n\t\tprint(\"YES\")\r\n\telse:\r\n\t\tprint(\"NO\")\r\n\r\n\r\n", "a = list(map(int,input().rsplit()))\r\nsum=0\r\np=1\r\nfor i in range(6):\r\n sum = sum+a[i];\r\nfor i in range(4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n if a[i]+a[j]+a[k]==sum/2 :\r\n p=0 \r\nif p==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "nums = list(map(int, input().split()))\r\n\r\ntotal = sum(nums)\r\n\r\ndef calc():\r\n for i in range(0, 4):\r\n for j in range(i+1, 5):\r\n for k in range(j+1, 6):\r\n if (nums[i]+nums[j]+nums[k]) == (total - (nums[i]+nums[j]+nums[k])):\r\n return \"YES\"\r\n return \"NO\"\r\n \r\nans = calc()\r\n\r\nprint(ans)", "from itertools import combinations\n\ndef solve(scores):\n\tgoal = sum(scores) / 2\n\tfor group in combinations(scores, 3):\n\t\tif sum(group) == goal:\n\t\t\treturn True\n\treturn False\n\nscores = list(map(int, input().split()))\nif solve(scores):\n\tprint(\"YES\")\nelse:\n\tprint(\"NO\")", "import sys\r\na = list(map(int, input().split()))\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if ((a[i] + a[j] + a[k]) << 1) == sum(a): \r\n print(\"YES\")\r\n sys.exit()\r\nprint(\"NO\")", "A = [int(i) for i in input().split()] \r\nS = sum(A)\r\nA.sort()\r\n\r\ndef meme(A,S):\r\n if S%2 != 0:\r\n return \"NO\"\r\n S= S//2\r\n S-=A[5]\r\n for i in range(5):\r\n for j in range(i+1,5):\r\n if A[i]+A[j]==S:\r\n return \"YES\"\r\n return \"NO\"\r\n\r\nprint(meme(A,S))\r\n \r\n", "class CodeforcesTask890ASolution:\r\n def __init__(self):\r\n self.result = ''\r\n self.scores = []\r\n\r\n def read_input(self):\r\n self.scores = [int(x) for x in input().split(\" \")]\r\n\r\n def process_task(self):\r\n result = False\r\n perms = [([5,2,1],[0,4,3]),\r\n([1,3,0],[5,4,2]),\r\n([4,1,2],[3,0,5]),\r\n([2,3,0],[4,1,5]),\r\n([4,5,3],[1,2,0]),\r\n([3,4,1],[5,0,2]),\r\n([3,5,2],[1,4,0]),\r\n([0,4,2],[5,1,3]),\r\n([3,0,1],[4,2,5]),\r\n([4,3,5],[2,0,1]),\r\n([4,0,3],[1,2,5]),\r\n([1,2,5],[3,0,4]),\r\n([3,5,1],[0,4,2]),\r\n([3,2,4],[0,1,5]),\r\n([2,5,1],[0,3,4]),\r\n([2,3,4],[1,0,5]),\r\n([0,1,5],[3,2,4]),\r\n([5,4,1],[0,2,3]),\r\n([5,2,3],[0,1,4]),\r\n([4,1,0],[3,2,5]),\r\n([4,1,0],[5,2,3]),\r\n([2,3,1],[4,0,5]),\r\n([4,0,1],[2,3,5]),\r\n([2,4,5],[3,1,0]),\r\n([1,5,0],[3,2,4]),\r\n([3,0,1],[4,5,2]),\r\n([2,0,3],[1,4,5]),\r\n([0,3,1],[2,5,4]),\r\n([5,2,3],[1,4,0]),\r\n([1,0,4],[3,2,5]),\r\n([0,2,3],[4,5,1]),\r\n([0,3,1],[2,4,5]),\r\n([4,1,0],[3,5,2]),\r\n([5,1,2],[3,0,4]),\r\n([1,4,2],[0,3,5]),\r\n([5,3,4],[0,2,1]),\r\n([5,3,2],[0,1,4]),\r\n([2,5,3],[1,4,0]),\r\n([5,2,4],[0,3,1]),\r\n([5,1,3],[0,4,2]),\r\n([5,1,4],[3,2,0]),\r\n([4,1,0],[2,3,5]),\r\n([3,4,5],[2,1,0]),\r\n([5,1,0],[4,3,2]),\r\n([1,0,4],[3,2,5]),\r\n([5,3,1],[4,0,2]),\r\n([3,0,4],[5,2,1]),\r\n([0,3,2],[4,1,5]),\r\n([0,4,1],[2,3,5]),\r\n([5,4,0],[2,3,1]),\r\n([1,5,0],[4,3,2]),\r\n([1,2,3],[0,5,4]),\r\n([4,5,0],[3,2,1]),\r\n([0,2,5],[1,3,4]),\r\n([1,0,4],[5,3,2]),\r\n([4,0,3],[2,1,5]),\r\n([2,5,4],[0,1,3]),\r\n([5,0,2],[1,4,3]),\r\n([4,2,5],[0,3,1]),\r\n([2,5,1],[4,3,0]),\r\n([1,3,4],[0,2,5]),\r\n([4,1,2],[0,3,5]),\r\n([5,3,1],[2,0,4]),\r\n([3,4,1],[2,5,0]),\r\n([4,5,2],[3,0,1]),\r\n([4,3,1],[2,5,0]),\r\n([5,2,4],[0,1,3]),\r\n([5,2,3],[0,1,4]),\r\n([2,3,1],[5,0,4]),\r\n([2,4,3],[1,0,5]),\r\n([0,2,3],[1,4,5]),\r\n([1,3,5],[4,0,2]),\r\n([3,2,4],[5,0,1]),\r\n([0,3,2],[4,1,5]),\r\n([3,1,0],[2,4,5]),\r\n([5,4,2],[3,0,1]),\r\n([2,0,1],[5,3,4]),\r\n([5,3,4],[0,2,1]),\r\n([1,3,0],[2,4,5]),\r\n([0,4,3],[5,2,1]),\r\n([5,0,4],[2,1,3]),\r\n([4,2,3],[1,0,5]),\r\n([5,0,2],[1,3,4]),\r\n([0,4,5],[3,1,2]),\r\n([4,3,1],[2,5,0]),\r\n([1,5,3],[4,2,0]),\r\n([3,2,5],[0,4,1]),\r\n([3,2,0],[4,1,5]),\r\n([5,3,0],[2,4,1]),\r\n([4,1,5],[2,3,0]),\r\n([5,2,0],[3,4,1]),\r\n([0,4,1],[3,2,5]),\r\n([1,0,5],[4,2,3]),\r\n([2,1,0],[4,3,5]),\r\n([1,0,5],[3,2,4]),\r\n([2,4,0],[5,3,1]),\r\n([4,2,5],[0,1,3]),\r\n([4,1,5],[0,2,3]),\r\n([5,1,0],[2,4,3]),\r\n([1,3,4],[2,5,0]),\r\n([5,1,4],[0,2,3]),\r\n([4,0,2],[5,3,1]),\r\n([5,1,0],[3,4,2]),\r\n([0,1,5],[2,4,3]),\r\n([1,2,4],[5,3,0]),\r\n([3,2,1],[4,0,5]),\r\n([0,1,4],[3,5,2]),\r\n([2,3,4],[5,0,1]),\r\n([5,4,1],[2,0,3]),\r\n([3,4,1],[2,0,5]),\r\n([1,0,5],[3,4,2]),\r\n([5,3,0],[4,1,2]),\r\n([5,0,4],[2,3,1]),\r\n([0,2,1],[3,4,5]),\r\n([1,2,4],[0,3,5]),\r\n([1,5,4],[2,0,3]),\r\n([1,5,3],[4,2,0]),\r\n([0,3,5],[1,2,4]),\r\n([3,2,0],[5,4,1]),\r\n([0,3,4],[1,5,2]),\r\n([2,1,5],[3,4,0]),\r\n([4,1,5],[0,3,2]),\r\n([1,0,3],[5,2,4]),\r\n([3,1,5],[2,4,0]),\r\n([2,4,0],[3,5,1]),\r\n([2,3,5],[0,1,4]),\r\n([2,0,5],[1,3,4]),\r\n([0,2,1],[3,5,4]),\r\n([4,2,3],[1,5,0]),\r\n([1,2,3],[4,5,0]),\r\n([2,1,5],[0,3,4]),\r\n([3,1,5],[2,0,4]),\r\n([1,5,0],[4,3,2]),\r\n([2,1,3],[0,5,4]),\r\n([3,4,5],[2,1,0]),\r\n([4,3,0],[1,5,2]),\r\n([5,3,1],[0,4,2]),\r\n([4,2,1],[0,5,3]),\r\n([4,1,0],[2,5,3]),\r\n([2,3,4],[1,0,5]),\r\n([4,2,0],[5,1,3]),\r\n([0,4,5],[1,3,2]),\r\n([5,4,0],[3,2,1]),\r\n([0,3,4],[1,2,5]),\r\n([5,4,1],[2,3,0]),\r\n([5,0,4],[3,2,1]),\r\n([4,1,5],[2,0,3]),\r\n([2,1,4],[3,5,0]),\r\n([5,4,3],[2,0,1]),\r\n([0,2,5],[4,1,3]),\r\n([1,5,2],[3,4,0]),\r\n([2,3,1],[4,0,5]),\r\n([5,4,1],[0,2,3]),\r\n([0,2,4],[5,1,3]),\r\n([0,1,2],[5,3,4]),\r\n([5,2,0],[3,4,1]),\r\n([0,3,4],[1,5,2]),\r\n([3,5,1],[4,0,2]),\r\n([3,1,2],[0,5,4]),\r\n([0,5,3],[1,4,2]),\r\n([5,4,2],[0,1,3]),\r\n([5,1,0],[4,3,2]),\r\n([3,1,4],[5,2,0]),\r\n([2,1,5],[3,4,0]),\r\n([2,3,1],[0,4,5]),\r\n([3,2,1],[0,4,5]),\r\n([2,5,4],[0,1,3]),\r\n([2,1,5],[0,4,3]),\r\n([2,3,1],[5,4,0]),\r\n([3,2,4],[5,0,1]),\r\n([4,2,5],[3,1,0]),\r\n([2,0,3],[1,5,4]),\r\n([2,1,0],[4,5,3]),\r\n([2,4,0],[1,3,5]),\r\n([4,5,3],[0,2,1]),\r\n([5,1,2],[4,3,0]),\r\n([1,0,2],[5,3,4]),\r\n([4,3,2],[5,0,1]),\r\n([4,3,5],[1,2,0]),\r\n([1,5,4],[3,0,2]),\r\n([1,4,2],[5,0,3]),\r\n([2,3,5],[4,0,1]),\r\n([4,0,1],[3,2,5]),\r\n([1,4,0],[3,5,2]),\r\n([3,2,1],[4,5,0]),\r\n([1,2,4],[0,5,3]),\r\n([3,2,1],[5,0,4]),\r\n([0,4,5],[1,3,2]),\r\n([1,3,2],[5,0,4]),\r\n([5,4,3],[1,2,0]),\r\n([3,5,4],[2,1,0]),\r\n([4,3,0],[1,5,2]),\r\n([0,1,5],[2,3,4]),\r\n([5,4,2],[1,3,0]),\r\n([4,2,1],[0,3,5]),\r\n([5,3,1],[4,0,2]),\r\n([5,2,3],[1,0,4]),\r\n([2,0,4],[5,3,1]),\r\n([2,3,1],[0,4,5]),\r\n([5,0,2],[4,3,1]),\r\n([0,1,4],[5,2,3]),\r\n([5,3,1],[2,0,4]),\r\n([1,5,3],[4,2,0]),\r\n([3,4,1],[2,0,5]),\r\n([0,3,2],[5,4,1]),\r\n([5,0,1],[2,3,4]),\r\n([1,2,4],[0,3,5]),\r\n([1,5,2],[4,3,0]),\r\n([3,5,0],[4,2,1]),\r\n([4,0,2],[3,5,1]),\r\n([1,4,5],[0,3,2]),\r\n([1,0,2],[4,3,5]),\r\n([5,0,1],[4,3,2]),\r\n([2,0,5],[4,1,3]),\r\n([4,3,5],[0,2,1]),\r\n([4,5,0],[2,1,3]),\r\n([2,5,1],[4,3,0]),\r\n([0,3,5],[1,4,2]),\r\n([0,2,1],[5,3,4]),\r\n([2,5,3],[0,1,4]),\r\n([2,3,4],[0,1,5]),\r\n([3,0,5],[2,4,1]),\r\n([0,1,2],[4,3,5]),\r\n([3,0,2],[1,5,4]),\r\n([1,3,0],[4,2,5]),\r\n([5,3,2],[0,1,4]),\r\n([0,1,5],[2,3,4]),\r\n([0,1,3],[2,4,5]),\r\n([4,5,2],[0,1,3]),\r\n([0,2,5],[4,3,1]),\r\n([3,5,2],[0,4,1]),\r\n([5,0,1],[2,3,4]),\r\n([5,1,0],[3,4,2]),\r\n([0,1,2],[3,5,4]),\r\n([1,5,0],[3,2,4]),\r\n([1,0,4],[3,5,2]),\r\n([3,4,0],[1,5,2]),\r\n([5,0,3],[2,4,1]),\r\n([2,4,0],[1,5,3]),\r\n([3,5,2],[0,1,4]),\r\n([3,0,5],[4,2,1]),\r\n([5,1,0],[4,2,3]),\r\n([5,2,4],[3,0,1]),\r\n([4,2,1],[5,0,3]),\r\n([0,3,5],[4,2,1]),\r\n([2,3,0],[4,5,1]),\r\n([0,4,3],[1,2,5]),\r\n([2,5,1],[4,3,0]),\r\n([5,1,2],[3,0,4]),\r\n([3,2,1],[4,0,5]),\r\n([2,0,4],[5,3,1]),\r\n([0,4,3],[2,5,1]),\r\n([4,0,1],[5,2,3]),\r\n([0,5,2],[4,1,3]),\r\n([3,4,2],[5,1,0]),\r\n([4,1,0],[2,5,3]),\r\n([4,3,0],[2,1,5]),\r\n([5,4,3],[0,1,2]),\r\n([2,0,3],[4,1,5]),\r\n([5,3,4],[2,0,1]),\r\n([5,1,3],[2,0,4]),\r\n([5,0,1],[4,3,2]),\r\n([3,5,4],[0,1,2]),\r\n([5,3,4],[1,2,0]),\r\n([2,5,4],[1,0,3]),\r\n([3,5,4],[0,1,2]),\r\n([5,3,0],[1,4,2]),\r\n([5,2,0],[1,3,4]),\r\n([2,3,4],[0,5,1]),\r\n([0,4,3],[2,5,1]),\r\n([4,5,1],[3,2,0]),\r\n([4,3,2],[1,0,5]),\r\n([4,1,2],[5,0,3]),\r\n([0,4,5],[1,3,2]),\r\n([5,0,3],[4,2,1]),\r\n([1,2,3],[5,4,0]),\r\n([3,4,2],[1,0,5]),\r\n([3,0,5],[4,1,2]),\r\n([0,4,3],[2,5,1]),\r\n([2,3,5],[1,4,0]),\r\n([2,1,0],[5,3,4]),\r\n([5,4,2],[1,3,0]),\r\n([4,2,1],[0,5,3]),\r\n([1,5,2],[4,0,3]),\r\n([0,5,1],[2,3,4]),\r\n([0,1,5],[4,3,2]),\r\n([2,3,5],[4,0,1]),\r\n([3,5,0],[1,2,4]),\r\n([3,1,2],[4,0,5]),\r\n([2,4,0],[5,1,3]),\r\n([1,2,4],[5,0,3]),\r\n([4,0,3],[5,2,1]),\r\n([4,2,5],[0,1,3]),\r\n([3,0,1],[4,5,2]),\r\n([3,0,5],[2,4,1]),\r\n([4,0,1],[3,5,2]),\r\n([2,1,4],[0,3,5]),\r\n([0,4,1],[3,5,2]),\r\n([0,3,4],[2,1,5]),\r\n([5,4,0],[3,1,2]),\r\n([5,4,1],[3,2,0]),\r\n([2,1,0],[4,3,5]),\r\n([2,3,1],[4,5,0]),\r\n([4,3,1],[2,5,0]),\r\n([5,1,4],[2,3,0]),\r\n([4,2,1],[5,0,3]),\r\n([3,5,1],[0,2,4]),\r\n([2,1,4],[3,0,5]),\r\n([0,3,4],[2,5,1]),\r\n([4,5,3],[1,2,0]),\r\n([3,0,5],[2,1,4]),\r\n([3,5,2],[1,0,4]),\r\n([0,5,2],[1,3,4]),\r\n([5,1,3],[4,0,2]),\r\n([4,5,1],[3,0,2]),\r\n([1,0,3],[5,2,4]),\r\n([2,4,5],[1,3,0]),\r\n([3,5,4],[2,0,1]),\r\n([2,1,4],[5,0,3]),\r\n([2,3,4],[1,5,0]),\r\n([1,0,2],[5,3,4]),\r\n([4,3,1],[2,0,5]),\r\n([0,1,2],[5,4,3]),\r\n([3,2,5],[4,0,1]),\r\n([4,5,3],[1,0,2]),\r\n([0,1,2],[3,4,5]),\r\n([4,1,0],[3,2,5]),\r\n([1,4,3],[2,0,5]),\r\n([3,5,0],[2,1,4]),\r\n([3,1,2],[0,5,4]),\r\n([1,2,0],[5,4,3]),\r\n([2,4,0],[1,3,5]),\r\n([1,4,3],[0,2,5]),\r\n([1,4,2],[5,0,3]),\r\n([0,5,1],[4,2,3]),\r\n([1,0,4],[2,5,3]),\r\n([5,1,2],[3,4,0]),\r\n([4,3,5],[0,2,1]),\r\n([2,4,5],[0,1,3]),\r\n([4,0,2],[5,1,3]),\r\n([0,2,1],[4,3,5]),\r\n([2,1,4],[3,0,5]),\r\n([2,3,0],[5,4,1]),\r\n([4,0,2],[1,3,5]),\r\n([2,0,5],[3,1,4]),\r\n([0,3,2],[4,1,5]),\r\n([0,4,3],[2,1,5]),\r\n([3,1,2],[5,0,4]),\r\n([4,1,0],[5,2,3]),\r\n([1,4,2],[5,0,3]),\r\n([3,2,5],[4,1,0]),\r\n([0,3,5],[4,1,2]),\r\n([5,3,2],[1,4,0]),\r\n([5,2,4],[3,0,1]),\r\n([3,0,4],[2,1,5]),\r\n([2,3,1],[5,0,4]),\r\n([0,3,4],[2,1,5]),\r\n([0,2,4],[3,5,1]),\r\n([5,2,1],[0,4,3]),\r\n([5,4,0],[1,2,3]),\r\n([1,2,0],[5,4,3]),\r\n([1,2,4],[3,5,0]),\r\n([1,5,2],[4,3,0]),\r\n([2,3,1],[5,0,4]),\r\n([1,0,5],[3,4,2]),\r\n([5,3,4],[2,0,1]),\r\n([0,5,2],[3,4,1]),\r\n([1,3,4],[5,2,0]),\r\n([4,2,0],[1,5,3]),\r\n([4,2,3],[5,0,1]),\r\n([0,3,1],[2,5,4]),\r\n([0,5,4],[3,1,2]),\r\n([4,2,3],[1,5,0]),\r\n([1,0,5],[3,2,4]),\r\n([3,4,1],[2,0,5]),\r\n([1,2,5],[0,3,4]),\r\n([0,1,3],[2,4,5]),\r\n([1,5,4],[2,3,0]),\r\n([1,3,2],[0,5,4]),\r\n([5,2,3],[0,1,4]),\r\n([5,0,4],[1,3,2]),\r\n([0,2,4],[1,3,5]),\r\n([2,4,3],[1,0,5]),\r\n([3,0,4],[2,1,5]),\r\n([4,0,2],[3,5,1]),\r\n([3,1,2],[5,4,0]),\r\n([5,4,1],[0,3,2]),\r\n([5,0,4],[1,3,2]),\r\n([4,0,2],[1,5,3]),\r\n([5,0,3],[2,1,4]),\r\n([2,3,4],[1,5,0]),\r\n([5,0,2],[4,3,1]),\r\n([4,0,3],[2,5,1]),\r\n([4,2,1],[0,3,5]),\r\n([4,1,0],[5,2,3]),\r\n([2,3,5],[4,1,0]),\r\n([5,0,2],[4,3,1]),\r\n([4,1,0],[3,5,2]),\r\n([4,0,3],[1,5,2]),\r\n([0,2,3],[5,4,1]),\r\n([3,5,2],[0,4,1]),\r\n([1,3,4],[0,5,2]),\r\n([3,2,1],[4,0,5]),\r\n([3,4,5],[0,1,2]),\r\n([1,5,4],[0,3,2]),\r\n([0,4,5],[3,2,1]),\r\n([5,4,2],[0,3,1]),\r\n([2,0,3],[4,1,5]),\r\n([2,5,1],[4,0,3]),\r\n([3,5,0],[4,2,1]),\r\n([0,1,3],[4,5,2]),\r\n([0,2,4],[5,3,1]),\r\n([3,1,5],[4,2,0]),\r\n([3,1,0],[2,5,4]),\r\n([5,4,2],[1,0,3]),\r\n([5,2,0],[3,1,4]),\r\n([0,4,1],[5,3,2]),\r\n([5,3,4],[2,0,1]),\r\n([0,5,2],[4,3,1]),\r\n([2,4,1],[5,0,3]),\r\n([4,2,5],[3,0,1]),\r\n([1,3,0],[4,2,5]),\r\n([1,2,3],[4,0,5]),\r\n([5,1,2],[0,4,3]),\r\n([3,1,0],[2,4,5]),\r\n([1,0,3],[4,2,5]),\r\n([3,1,2],[5,4,0]),\r\n([0,5,1],[3,2,4]),\r\n([4,0,5],[1,2,3]),\r\n([0,2,1],[3,5,4]),\r\n([4,0,2],[3,1,5]),\r\n([0,2,4],[3,1,5]),\r\n([3,4,5],[0,1,2]),\r\n([2,1,4],[0,5,3]),\r\n([5,1,4],[2,3,0]),\r\n([4,2,5],[1,3,0]),\r\n([5,0,2],[1,4,3]),\r\n([1,3,5],[0,4,2]),\r\n([2,5,3],[1,0,4]),\r\n([3,1,2],[5,0,4]),\r\n([3,1,5],[0,4,2]),\r\n([3,1,5],[2,0,4]),\r\n([0,1,4],[5,3,2]),\r\n([4,5,2],[0,1,3]),\r\n([0,4,2],[3,1,5]),\r\n([2,5,0],[4,3,1]),\r\n([2,3,0],[4,5,1]),\r\n([0,5,2],[4,1,3]),\r\n([2,3,4],[0,5,1]),\r\n([0,3,5],[4,1,2]),\r\n([4,5,3],[2,1,0]),\r\n([3,1,4],[0,2,5]),\r\n([0,1,4],[3,2,5]),\r\n([5,3,4],[0,1,2]),\r\n([0,4,5],[2,3,1]),\r\n([0,3,4],[2,1,5]),\r\n([1,4,5],[2,0,3]),\r\n([2,4,0],[3,1,5]),\r\n([0,5,2],[4,3,1]),\r\n([5,0,1],[4,2,3]),\r\n([5,3,4],[1,0,2]),\r\n([0,2,5],[1,4,3]),\r\n([2,1,3],[4,0,5]),\r\n([5,1,3],[2,4,0]),\r\n([4,3,0],[1,2,5]),\r\n([3,0,5],[2,1,4]),\r\n([4,0,3],[5,1,2]),\r\n([4,1,0],[3,2,5]),\r\n([1,4,5],[3,0,2]),\r\n([3,5,1],[0,2,4]),\r\n([3,2,5],[0,1,4]),\r\n([4,2,1],[0,3,5]),\r\n([1,2,4],[5,3,0]),\r\n([2,4,0],[5,3,1]),\r\n([0,3,1],[4,2,5]),\r\n([0,4,2],[5,1,3]),\r\n([3,5,1],[2,4,0]),\r\n([3,1,5],[2,4,0]),\r\n([2,5,3],[1,4,0]),\r\n([2,4,0],[5,3,1]),\r\n([3,2,0],[4,5,1]),\r\n([4,2,3],[1,5,0]),\r\n([5,0,4],[3,1,2]),\r\n([5,4,1],[2,3,0]),\r\n([0,5,4],[2,3,1]),\r\n([3,5,1],[4,0,2]),\r\n([3,5,1],[0,2,4]),\r\n([1,2,0],[3,5,4]),\r\n([3,0,2],[4,5,1]),\r\n([3,4,1],[0,5,2]),\r\n([0,3,4],[2,5,1]),\r\n([5,1,4],[0,3,2]),\r\n([2,4,5],[3,1,0]),\r\n([0,5,4],[3,2,1]),\r\n([4,2,5],[1,0,3]),\r\n([0,2,5],[3,4,1]),\r\n([2,1,0],[3,5,4]),\r\n([4,1,0],[3,5,2]),\r\n([1,0,5],[4,3,2]),\r\n([2,4,3],[1,5,0]),\r\n([5,2,0],[4,1,3]),\r\n([3,5,0],[4,2,1]),\r\n([3,0,2],[4,1,5]),\r\n([3,5,0],[4,2,1]),\r\n([2,4,3],[0,1,5]),\r\n([1,4,2],[3,0,5]),\r\n([3,4,5],[1,0,2]),\r\n([0,5,1],[3,4,2]),\r\n([5,2,1],[0,3,4]),\r\n([0,2,5],[4,3,1]),\r\n([1,2,0],[3,4,5]),\r\n([0,2,4],[1,5,3]),\r\n([4,5,2],[3,1,0]),\r\n([5,3,2],[0,1,4]),\r\n([2,3,0],[4,5,1]),\r\n([4,1,0],[2,5,3]),\r\n([5,4,0],[1,2,3]),\r\n([2,5,3],[1,4,0]),\r\n([3,0,2],[5,1,4]),\r\n([1,2,5],[4,3,0]),\r\n([5,4,1],[3,2,0]),\r\n([2,0,5],[1,4,3]),\r\n([3,2,0],[4,1,5]),\r\n([5,3,2],[4,0,1]),\r\n([0,2,5],[1,3,4]),\r\n([0,3,5],[4,1,2]),\r\n([5,1,0],[4,2,3]),\r\n([2,5,3],[4,0,1]),\r\n([5,2,4],[1,3,0]),\r\n([5,4,0],[3,1,2]),\r\n([0,5,3],[4,1,2]),\r\n([4,5,3],[1,0,2]),\r\n([2,0,3],[5,4,1]),\r\n([1,0,5],[2,3,4]),\r\n([2,3,0],[1,5,4]),\r\n([1,2,4],[5,0,3]),\r\n([4,0,1],[3,5,2]),\r\n([4,2,0],[5,3,1]),\r\n([4,1,3],[2,0,5]),\r\n([1,3,2],[4,5,0]),\r\n([1,5,0],[4,2,3]),\r\n([5,4,2],[0,3,1]),\r\n([2,1,0],[5,4,3]),\r\n([4,0,3],[1,2,5]),\r\n([5,0,4],[2,3,1]),\r\n([4,3,1],[5,2,0]),\r\n([4,3,5],[1,0,2]),\r\n([5,3,0],[4,1,2]),\r\n([2,3,0],[5,1,4]),\r\n([0,5,3],[1,2,4]),\r\n([0,2,1],[5,4,3]),\r\n([4,1,2],[5,0,3]),\r\n([2,4,0],[1,3,5]),\r\n([3,5,1],[2,0,4]),\r\n([5,4,2],[0,1,3]),\r\n([2,5,3],[0,1,4]),\r\n([0,5,2],[1,3,4]),\r\n([4,1,2],[0,3,5]),\r\n([1,5,3],[2,4,0]),\r\n([3,5,1],[4,2,0]),\r\n([5,2,4],[0,1,3]),\r\n([4,1,5],[0,3,2]),\r\n([2,4,0],[1,3,5]),\r\n([3,5,2],[0,4,1]),\r\n([2,3,4],[5,1,0]),\r\n([1,0,4],[3,5,2]),\r\n([3,1,5],[4,2,0]),\r\n([2,4,1],[3,0,5]),\r\n([0,4,1],[3,2,5]),\r\n([0,4,1],[2,3,5]),\r\n([5,0,4],[3,1,2]),\r\n([2,1,3],[4,5,0]),\r\n([4,1,0],[2,3,5]),\r\n([0,2,5],[3,4,1]),\r\n([3,0,4],[1,5,2]),\r\n([5,1,2],[4,0,3]),\r\n([5,0,1],[3,2,4]),\r\n([5,2,4],[3,0,1]),\r\n([1,4,5],[3,0,2]),\r\n([4,3,5],[2,0,1]),\r\n([5,1,4],[3,2,0]),\r\n([2,5,0],[4,3,1]),\r\n([4,5,1],[0,2,3]),\r\n([4,1,0],[2,5,3]),\r\n([2,5,0],[3,1,4]),\r\n([4,5,0],[1,3,2]),\r\n([1,2,5],[4,3,0]),\r\n([2,3,5],[4,1,0]),\r\n([1,4,5],[0,2,3]),\r\n([1,4,2],[3,5,0]),\r\n([5,1,2],[3,0,4]),\r\n([0,5,2],[1,3,4]),\r\n([0,1,5],[2,4,3]),\r\n([4,3,5],[2,1,0]),\r\n([5,4,2],[1,3,0]),\r\n([0,1,4],[2,3,5]),\r\n([3,5,2],[0,1,4]),\r\n([1,3,4],[5,2,0]),\r\n([0,1,2],[3,5,4]),\r\n([3,1,4],[5,2,0]),\r\n([4,5,3],[0,2,1]),\r\n([4,0,1],[5,2,3]),\r\n([0,3,4],[5,2,1]),\r\n([4,3,5],[1,0,2]),\r\n([4,0,1],[2,3,5]),\r\n([0,5,1],[2,3,4]),\r\n([1,2,3],[0,4,5]),\r\n([3,2,1],[5,4,0]),\r\n([5,2,1],[4,3,0]),\r\n([2,0,1],[3,4,5]),\r\n([5,3,0],[1,2,4]),\r\n([2,1,4],[0,3,5]),\r\n([1,5,3],[2,4,0]),\r\n([2,3,0],[4,5,1]),\r\n([4,3,5],[0,1,2]),\r\n([5,3,1],[0,2,4]),\r\n([2,5,0],[3,1,4]),\r\n([5,4,1],[2,3,0]),\r\n([1,4,5],[2,3,0]),\r\n([0,5,3],[1,4,2]),\r\n([3,4,5],[2,1,0]),\r\n([4,5,2],[1,0,3]),\r\n([2,0,1],[4,3,5]),\r\n([2,1,3],[0,5,4]),\r\n([2,5,0],[4,3,1]),\r\n([1,4,2],[0,3,5]),\r\n([0,2,5],[3,4,1]),\r\n([2,5,1],[3,4,0]),\r\n([4,2,5],[1,0,3]),\r\n([0,3,5],[2,4,1]),\r\n([2,0,3],[1,4,5]),\r\n([2,1,0],[4,5,3]),\r\n([5,4,1],[3,0,2]),\r\n([2,3,5],[0,4,1]),\r\n([0,4,5],[1,3,2]),\r\n([0,4,2],[1,5,3]),\r\n([3,4,0],[1,5,2]),\r\n([3,4,0],[5,2,1]),\r\n([3,0,1],[4,5,2]),\r\n([5,1,4],[2,3,0]),\r\n([5,0,1],[4,2,3]),\r\n([1,4,3],[2,5,0]),\r\n([0,5,1],[4,3,2]),\r\n([2,4,0],[5,3,1]),\r\n([2,1,5],[4,0,3]),\r\n([5,1,4],[3,2,0]),\r\n([2,5,0],[4,3,1]),\r\n([5,0,1],[3,4,2]),\r\n([2,5,3],[0,1,4]),\r\n([3,5,0],[2,4,1]),\r\n([1,2,0],[4,3,5]),\r\n([4,1,0],[2,5,3]),\r\n([2,0,3],[5,4,1]),\r\n([0,3,1],[5,2,4]),\r\n([5,3,2],[0,1,4]),\r\n([0,4,1],[3,2,5]),\r\n([5,0,3],[2,4,1]),\r\n([0,1,4],[2,3,5]),\r\n([4,5,2],[3,1,0]),\r\n([3,4,1],[2,5,0]),\r\n([3,5,2],[0,1,4]),\r\n([3,0,4],[5,2,1]),\r\n([1,0,4],[3,5,2]),\r\n([0,3,2],[5,4,1]),\r\n([1,5,2],[3,4,0]),\r\n([1,0,2],[3,4,5]),\r\n([3,0,4],[5,1,2]),\r\n([2,0,3],[5,1,4]),\r\n([4,3,5],[0,1,2]),\r\n([1,5,4],[3,0,2]),\r\n([0,2,4],[3,5,1]),\r\n([0,1,4],[3,5,2]),\r\n([5,3,0],[1,4,2]),\r\n([2,3,5],[1,4,0]),\r\n([3,5,4],[1,0,2]),\r\n([0,1,5],[2,3,4]),\r\n([1,0,4],[3,2,5]),\r\n([0,5,1],[3,4,2]),\r\n([5,2,3],[4,1,0]),\r\n([5,0,2],[1,3,4]),\r\n([0,4,2],[3,5,1]),\r\n([3,1,5],[0,2,4]),\r\n([4,5,3],[2,1,0]),\r\n([3,4,2],[0,1,5]),\r\n([3,1,0],[2,4,5]),\r\n([4,1,2],[3,0,5]),\r\n([5,1,2],[0,4,3]),\r\n([5,1,0],[3,4,2]),\r\n([3,0,4],[1,2,5]),\r\n([0,5,4],[1,2,3]),\r\n([2,1,4],[5,0,3]),\r\n([2,1,5],[3,4,0]),\r\n([5,0,4],[3,2,1]),\r\n([1,3,0],[2,5,4]),\r\n([4,3,0],[1,5,2]),\r\n([0,3,2],[5,4,1]),\r\n([4,0,1],[5,2,3]),\r\n([5,4,3],[0,2,1]),\r\n([5,0,1],[3,4,2]),\r\n([0,5,1],[3,2,4]),\r\n([5,3,1],[2,0,4]),\r\n([1,0,3],[5,2,4]),\r\n([3,5,2],[1,0,4]),\r\n([5,2,0],[1,3,4]),\r\n([2,1,4],[3,5,0]),\r\n([0,2,1],[4,3,5]),\r\n([5,2,1],[3,4,0]),\r\n([4,5,3],[1,0,2]),\r\n([0,1,5],[2,4,3]),\r\n([1,3,4],[2,5,0]),\r\n([2,5,1],[4,0,3]),\r\n([1,0,4],[2,3,5]),\r\n([1,3,0],[5,2,4]),\r\n([3,5,1],[0,2,4]),\r\n([2,1,5],[3,4,0]),\r\n([3,1,4],[2,5,0]),\r\n([2,3,0],[5,1,4]),\r\n([1,4,5],[2,0,3]),\r\n([1,2,3],[5,4,0]),\r\n([5,0,2],[3,4,1]),\r\n([1,0,5],[2,3,4]),\r\n([0,1,5],[4,2,3]),\r\n([1,0,3],[5,2,4]),\r\n([1,4,0],[3,2,5]),\r\n([4,1,5],[2,0,3]),\r\n([1,2,0],[4,3,5]),\r\n([0,2,4],[5,3,1]),\r\n([1,2,0],[5,3,4]),\r\n([1,3,4],[5,0,2]),\r\n([4,0,2],[3,5,1]),\r\n([4,2,0],[3,5,1]),\r\n([2,3,5],[0,4,1]),\r\n([1,0,3],[2,4,5]),\r\n([0,3,5],[1,4,2]),\r\n([0,3,5],[2,4,1]),\r\n([4,1,2],[0,5,3]),\r\n([2,4,5],[0,3,1]),\r\n([0,3,4],[1,5,2]),\r\n([2,3,1],[0,5,4]),\r\n([2,0,1],[5,3,4]),\r\n([2,0,1],[5,3,4]),\r\n([2,4,3],[0,5,1]),\r\n([3,4,1],[0,5,2]),\r\n([1,4,5],[0,3,2]),\r\n([4,0,5],[2,1,3]),\r\n([2,4,5],[3,0,1]),\r\n([1,3,2],[4,0,5]),\r\n([0,1,3],[2,4,5]),\r\n([3,2,5],[4,0,1]),\r\n([4,0,5],[2,3,1]),\r\n([1,2,0],[5,4,3]),\r\n([4,2,0],[1,3,5]),\r\n([0,1,3],[2,4,5]),\r\n([0,5,3],[1,4,2]),\r\n([4,2,0],[3,1,5]),\r\n([0,2,4],[1,3,5]),\r\n([0,2,4],[5,1,3]),\r\n([4,2,1],[0,5,3]),\r\n([4,3,2],[1,5,0]),\r\n([1,0,5],[4,2,3]),\r\n([3,0,5],[4,2,1]),\r\n([2,5,1],[4,3,0]),\r\n([4,0,1],[3,2,5]),\r\n([5,3,0],[1,2,4]),\r\n([5,1,3],[2,0,4]),\r\n([2,5,4],[0,3,1]),\r\n([1,5,0],[2,4,3]),\r\n([2,5,4],[3,1,0]),\r\n([1,0,3],[2,4,5]),\r\n([0,3,4],[2,5,1]),\r\n([2,0,3],[1,4,5]),\r\n([4,3,5],[2,0,1]),\r\n([4,3,2],[1,0,5]),\r\n([0,3,4],[1,5,2]),\r\n([2,5,4],[3,0,1]),\r\n([4,2,0],[3,1,5]),\r\n([4,3,2],[5,0,1]),\r\n([3,2,1],[4,5,0]),\r\n([4,2,3],[5,1,0]),\r\n([1,5,2],[3,0,4]),\r\n([1,3,4],[2,0,5]),\r\n([0,4,3],[2,1,5]),\r\n([2,0,3],[4,5,1]),\r\n([4,5,1],[3,2,0]),\r\n([5,0,4],[3,2,1]),\r\n([3,5,2],[4,1,0]),\r\n([2,0,3],[1,5,4]),\r\n([3,5,0],[4,1,2]),\r\n([4,0,5],[1,3,2]),\r\n([3,2,4],[5,1,0]),\r\n([1,0,4],[3,2,5]),\r\n([3,1,5],[0,4,2]),\r\n([3,1,0],[2,5,4]),\r\n([0,5,4],[3,2,1]),\r\n([5,1,3],[2,0,4]),\r\n([3,4,1],[0,2,5]),\r\n([2,5,1],[0,4,3]),\r\n([3,2,5],[0,4,1]),\r\n([2,4,3],[1,5,0]),\r\n([0,4,5],[3,2,1]),\r\n([4,0,2],[1,3,5]),\r\n([2,1,0],[4,3,5]),\r\n([2,3,4],[0,5,1]),\r\n([0,4,5],[1,3,2]),\r\n([0,4,3],[5,1,2]),\r\n([2,1,3],[0,4,5]),\r\n([0,3,5],[1,2,4]),\r\n([3,5,2],[1,4,0]),\r\n([5,2,3],[0,1,4]),\r\n([2,3,1],[0,4,5]),\r\n([1,3,5],[0,2,4]),\r\n([1,5,2],[3,0,4]),\r\n([0,1,4],[2,5,3]),\r\n([1,3,0],[4,5,2]),\r\n([1,4,5],[3,0,2]),\r\n([2,5,4],[0,1,3]),\r\n([3,4,2],[1,0,5]),\r\n([5,2,1],[4,0,3]),\r\n([4,1,2],[5,3,0]),\r\n([1,4,3],[2,5,0]),\r\n([5,1,0],[3,4,2]),\r\n([3,1,4],[2,0,5]),\r\n([3,4,5],[1,0,2]),\r\n([1,4,5],[2,0,3]),\r\n([5,4,3],[0,1,2]),\r\n([3,0,1],[4,2,5]),\r\n([2,1,3],[4,5,0]),\r\n([4,0,2],[3,1,5]),\r\n([2,0,5],[1,4,3]),\r\n([4,3,0],[5,1,2]),\r\n([3,0,5],[2,1,4]),\r\n([1,0,4],[5,2,3]),\r\n([1,4,0],[3,5,2]),\r\n([2,4,1],[5,0,3]),\r\n([5,3,2],[1,4,0]),\r\n([4,1,3],[2,0,5]),\r\n([2,4,0],[5,3,1]),\r\n([3,4,2],[1,0,5]),\r\n([3,2,0],[4,1,5]),\r\n([0,2,5],[3,1,4]),\r\n([3,0,2],[5,1,4]),\r\n([4,3,0],[5,1,2]),\r\n([5,2,1],[3,4,0]),\r\n([5,2,4],[3,1,0]),\r\n([0,3,5],[1,2,4]),\r\n([3,2,0],[4,1,5]),\r\n([0,2,5],[4,1,3]),\r\n([0,4,3],[5,2,1]),\r\n([5,3,0],[1,4,2]),\r\n([4,3,1],[5,0,2]),\r\n([5,0,4],[1,3,2]),\r\n([2,3,0],[4,1,5]),\r\n([3,2,1],[5,4,0]),\r\n([0,2,5],[3,4,1]),\r\n([5,1,2],[3,4,0]),\r\n([0,1,3],[4,5,2]),\r\n([5,0,2],[3,4,1]),\r\n([2,4,3],[1,5,0]),\r\n([0,5,2],[4,3,1]),\r\n([2,3,1],[5,0,4]),\r\n([5,0,3],[4,1,2]),\r\n([3,1,4],[2,0,5]),\r\n([5,0,4],[3,2,1]),\r\n([5,3,1],[0,2,4]),\r\n([2,0,5],[4,3,1]),\r\n([2,5,0],[4,3,1]),\r\n([1,3,0],[5,2,4]),\r\n([1,0,4],[2,3,5]),\r\n([0,1,2],[5,4,3]),\r\n([1,0,4],[3,5,2]),\r\n([3,2,0],[4,5,1]),\r\n([4,3,2],[1,5,0]),\r\n([5,2,4],[1,0,3]),\r\n([5,1,2],[3,4,0]),\r\n([2,5,0],[3,1,4]),\r\n([4,0,1],[3,2,5]),\r\n([3,0,4],[2,1,5]),\r\n([2,1,0],[3,4,5]),\r\n([3,1,5],[2,0,4]),\r\n([1,3,5],[0,2,4]),\r\n([5,1,3],[4,2,0]),\r\n([0,4,3],[1,5,2]),\r\n([1,3,2],[0,4,5]),\r\n([0,4,5],[1,2,3]),\r\n([2,3,5],[4,1,0]),\r\n([4,3,0],[5,1,2]),\r\n([0,5,2],[1,3,4]),\r\n([0,5,2],[4,3,1]),\r\n([2,4,3],[5,0,1]),\r\n([4,0,1],[5,3,2]),\r\n([4,3,0],[2,5,1]),\r\n([3,4,2],[1,0,5]),\r\n([2,5,4],[3,1,0]),\r\n([0,1,2],[4,3,5]),\r\n([5,2,0],[1,4,3]),\r\n([2,0,3],[5,4,1]),\r\n([1,2,0],[5,3,4]),\r\n([3,0,4],[1,2,5]),\r\n([0,1,5],[2,3,4]),\r\n([4,2,0],[3,1,5]),\r\n([2,3,4],[5,0,1]),\r\n([4,2,1],[5,0,3]),\r\n([2,0,3],[1,5,4]),\r\n([1,3,4],[0,2,5]),\r\n([3,1,2],[0,4,5]),\r\n([5,1,4],[2,3,0]),\r\n([5,2,1],[0,3,4]),\r\n([1,4,5],[3,2,0]),\r\n([0,3,2],[4,5,1]),\r\n([3,5,0],[1,4,2]),\r\n([5,4,2],[3,1,0]),\r\n([5,2,1],[4,0,3]),\r\n([3,0,1],[5,2,4]),\r\n([4,2,3],[0,1,5]),\r\n([3,2,1],[4,0,5]),\r\n([0,2,5],[3,4,1]),\r\n([0,5,1],[2,3,4]),\r\n([3,0,2],[5,4,1]),\r\n([4,0,3],[1,2,5]),\r\n([1,2,5],[4,3,0]),\r\n([3,1,5],[4,2,0]),\r\n([3,0,1],[4,5,2]),\r\n([0,2,1],[4,5,3]),\r\n([4,3,5],[2,0,1]),\r\n([5,4,2],[3,1,0]),\r\n([3,4,0],[5,1,2]),\r\n([3,1,5],[2,0,4]),\r\n([5,1,4],[2,0,3]),\r\n([0,1,2],[4,5,3]),\r\n([3,2,1],[0,4,5]),\r\n([1,3,2],[4,5,0]),\r\n([1,4,2],[5,0,3]),\r\n([5,0,1],[2,3,4]),\r\n([1,4,3],[0,5,2]),\r\n([4,2,3],[0,5,1]),\r\n([1,4,5],[0,3,2]),\r\n([4,2,3],[5,0,1]),\r\n([3,4,2],[0,5,1]),\r\n([1,0,2],[4,3,5]),\r\n([4,1,3],[0,2,5]),\r\n([3,0,2],[5,4,1]),\r\n([1,5,0],[3,4,2]),\r\n([5,0,4],[3,1,2]),\r\n([2,4,0],[3,1,5]),\r\n([4,3,1],[2,5,0]),\r\n([3,5,1],[4,0,2]),\r\n([3,4,5],[1,0,2]),\r\n([3,1,2],[5,0,4]),\r\n([5,4,1],[2,0,3]),\r\n([1,3,0],[5,4,2]),\r\n([2,0,1],[4,5,3]),\r\n([0,5,3],[1,4,2]),\r\n([1,5,4],[2,0,3]),\r\n([0,2,5],[4,3,1]),\r\n([3,5,4],[1,2,0]),\r\n([0,3,4],[2,5,1]),\r\n([5,0,4],[3,1,2]),\r\n([2,0,4],[3,1,5]),\r\n([4,2,3],[0,1,5]),\r\n([3,4,0],[2,1,5]),\r\n([3,4,5],[0,1,2]),\r\n([0,3,4],[5,2,1]),\r\n([5,2,3],[4,0,1]),\r\n([4,1,2],[0,5,3]),\r\n([3,4,2],[5,1,0]),\r\n([3,5,0],[4,2,1]),\r\n([4,5,3],[1,2,0]),\r\n([3,4,2],[0,1,5]),\r\n([1,5,0],[4,3,2]),\r\n([0,5,4],[3,2,1]),\r\n([3,2,4],[5,1,0]),\r\n([2,0,1],[5,4,3]),\r\n([4,5,3],[2,1,0]),\r\n([5,0,3],[1,2,4]),\r\n([2,5,1],[4,3,0]),\r\n([2,3,1],[5,0,4]),\r\n([4,3,5],[2,1,0]),\r\n([0,3,1],[5,2,4]),\r\n([0,4,2],[5,3,1]),\r\n([3,4,1],[0,5,2]),\r\n([2,4,0],[3,5,1]),\r\n([2,3,5],[0,4,1]),\r\n([4,5,2],[3,0,1]),\r\n([1,5,0],[4,3,2]),\r\n([4,2,1],[0,5,3]),\r\n([2,0,4],[1,5,3]),\r\n([4,5,1],[3,0,2]),\r\n([3,5,4],[1,2,0]),\r\n([5,2,3],[4,0,1]),\r\n([3,4,0],[5,1,2]),\r\n([4,3,1],[0,2,5]),\r\n([5,2,3],[1,0,4]),\r\n([4,5,1],[3,2,0]),\r\n([5,0,4],[1,2,3]),\r\n([2,4,0],[1,5,3]),\r\n([2,4,5],[3,0,1]),\r\n([1,5,2],[3,4,0]),\r\n([2,3,0],[4,1,5]),\r\n([4,3,2],[1,0,5]),\r\n([0,1,4],[5,3,2]),\r\n([1,4,3],[2,5,0]),\r\n([0,1,4],[5,2,3]),\r\n([4,2,5],[1,3,0]),\r\n([5,4,0],[1,3,2]),\r\n([0,1,2],[4,3,5]),\r\n([4,3,0],[2,5,1]),\r\n([4,5,2],[1,0,3]),\r\n([0,1,3],[2,5,4]),\r\n([5,1,0],[4,3,2]),\r\n([1,5,0],[3,2,4]),\r\n([2,3,1],[0,4,5]),\r\n([4,5,3],[2,0,1]),\r\n([4,1,3],[2,0,5]),\r\n([0,2,4],[1,5,3]),\r\n([4,0,1],[3,2,5]),\r\n([0,3,2],[1,4,5]),\r\n([3,0,5],[1,2,4]),\r\n([5,1,0],[4,3,2]),\r\n([4,2,5],[1,3,0]),\r\n([5,2,0],[4,3,1]),\r\n([3,5,2],[4,0,1]),\r\n([5,4,2],[1,3,0]),\r\n([1,2,5],[4,3,0]),\r\n([4,0,2],[1,5,3]),\r\n([0,2,3],[5,1,4]),\r\n([1,3,0],[5,4,2]),\r\n([1,3,5],[0,2,4]),\r\n([2,1,0],[4,3,5]),\r\n([3,2,5],[1,4,0]),\r\n([4,2,5],[0,1,3]),\r\n([3,0,2],[4,1,5]),\r\n([1,5,4],[2,0,3]),\r\n([3,0,5],[4,1,2]),\r\n([3,4,0],[2,1,5]),\r\n([2,0,5],[3,1,4]),\r\n([4,1,5],[2,3,0]),\r\n([4,3,1],[0,2,5]),\r\n([2,5,0],[3,4,1]),\r\n([3,4,2],[5,0,1]),\r\n([2,0,5],[1,4,3]),\r\n([0,1,2],[4,3,5]),\r\n([5,1,0],[3,2,4]),\r\n([1,4,0],[5,3,2]),\r\n([2,3,4],[1,0,5]),\r\n([2,0,4],[1,3,5]),\r\n([1,3,5],[4,0,2]),\r\n([3,4,0],[5,1,2]),\r\n([5,3,0],[2,1,4]),\r\n([4,0,5],[3,1,2]),\r\n([4,0,5],[1,3,2]),\r\n([3,5,0],[1,4,2]),\r\n([5,0,4],[1,3,2]),\r\n([5,3,2],[4,1,0]),\r\n([1,5,4],[3,2,0]),\r\n([0,5,2],[4,3,1]),\r\n([1,3,2],[4,5,0]),\r\n([3,4,1],[0,2,5]),\r\n([1,2,4],[3,5,0]),\r\n([0,5,2],[4,3,1]),\r\n([2,0,1],[5,3,4]),\r\n([1,5,2],[3,0,4]),\r\n([1,4,0],[2,3,5]),\r\n([1,5,0],[3,4,2]),\r\n([5,1,0],[2,3,4]),\r\n([5,1,2],[4,0,3]),\r\n([1,2,0],[4,3,5]),\r\n([1,5,0],[2,3,4]),\r\n([1,0,2],[4,5,3]),\r\n([1,3,4],[2,5,0]),\r\n([4,3,5],[1,0,2]),\r\n([3,4,1],[0,2,5]),\r\n([3,2,0],[1,5,4]),\r\n([1,5,3],[4,2,0]),\r\n([1,3,0],[2,5,4]),\r\n([1,0,2],[4,5,3]),\r\n([4,0,5],[3,1,2]),\r\n([5,2,1],[3,4,0]),\r\n([4,0,2],[5,1,3]),\r\n([1,2,3],[0,4,5]),\r\n([1,0,4],[3,2,5]),\r\n([5,1,2],[0,4,3]),\r\n([5,4,1],[3,2,0]),\r\n([0,4,2],[5,3,1]),\r\n([3,2,0],[5,4,1]),\r\n([2,4,1],[3,5,0]),\r\n([0,4,5],[2,3,1]),\r\n([0,5,2],[3,1,4]),\r\n([4,2,3],[5,0,1]),\r\n([1,2,0],[5,4,3]),\r\n([3,1,5],[2,0,4]),\r\n([2,1,4],[3,0,5]),\r\n([4,3,1],[5,0,2]),\r\n([3,5,0],[4,1,2]),\r\n([2,3,4],[0,5,1]),\r\n([4,5,2],[1,3,0]),\r\n([2,0,3],[1,4,5]),\r\n([3,0,4],[5,2,1]),\r\n([1,4,5],[0,2,3]),\r\n([1,0,4],[5,2,3]),\r\n([2,0,3],[4,5,1]),\r\n([4,0,2],[5,1,3]),\r\n([2,3,0],[1,4,5]),\r\n([4,0,3],[2,1,5]),\r\n([4,0,3],[2,5,1]),\r\n([5,4,0],[3,2,1]),\r\n([1,4,5],[3,0,2]),\r\n([2,1,0],[3,5,4]),\r\n([0,2,5],[3,1,4]),\r\n([0,4,5],[1,3,2]),\r\n([3,2,5],[4,0,1]),\r\n([1,4,0],[5,2,3]),\r\n([5,1,4],[0,3,2]),\r\n([4,1,0],[3,2,5]),\r\n([4,1,0],[3,2,5]),\r\n([0,4,3],[2,5,1]),\r\n([4,0,5],[2,3,1]),\r\n([0,5,1],[4,3,2]),\r\n([3,2,5],[0,1,4]),\r\n([0,4,1],[5,2,3]),\r\n([0,2,4],[1,3,5]),\r\n([0,1,2],[4,3,5]),\r\n([0,4,1],[2,5,3]),\r\n([3,0,2],[5,1,4]),\r\n([0,1,5],[4,3,2]),\r\n([2,1,3],[0,5,4]),\r\n([2,1,5],[3,4,0]),\r\n([5,4,0],[2,3,1]),\r\n([5,4,1],[3,2,0]),\r\n([3,4,2],[1,0,5]),\r\n([1,2,4],[5,0,3]),\r\n([0,4,1],[2,3,5]),\r\n([2,3,5],[1,4,0]),\r\n([2,0,5],[3,4,1]),\r\n([0,5,2],[3,4,1]),\r\n([4,5,1],[3,2,0]),\r\n([0,3,4],[2,1,5]),\r\n([5,4,3],[0,2,1]),\r\n([1,0,3],[5,4,2]),\r\n([5,3,1],[2,4,0]),\r\n([5,3,1],[2,4,0]),\r\n([5,0,4],[1,2,3]),\r\n([3,1,0],[5,2,4]),\r\n([0,1,5],[4,2,3]),\r\n([0,5,4],[1,2,3]),\r\n([2,5,1],[3,0,4]),\r\n([5,0,2],[1,4,3]),\r\n([0,4,5],[1,3,2]),\r\n([4,1,0],[2,5,3]),\r\n([2,3,5],[0,4,1]),\r\n([3,2,4],[0,1,5]),\r\n([3,5,2],[4,1,0]),\r\n([0,1,5],[4,2,3]),\r\n([3,1,0],[2,4,5]),\r\n([5,0,3],[4,2,1]),\r\n([2,1,5],[3,0,4]),\r\n([1,2,0],[5,4,3]),\r\n([4,1,2],[0,3,5]),\r\n([3,1,0],[2,5,4]),\r\n([4,0,5],[1,2,3]),\r\n([5,4,0],[3,1,2]),\r\n([1,0,5],[2,3,4]),\r\n([1,3,4],[5,0,2]),\r\n([0,4,3],[2,1,5]),\r\n([0,4,2],[5,1,3]),\r\n([3,5,1],[2,0,4]),\r\n([5,0,2],[1,3,4]),\r\n([1,0,4],[2,3,5]),\r\n([2,4,3],[0,5,1]),\r\n([1,0,5],[4,2,3]),\r\n([4,5,0],[1,2,3]),\r\n([4,1,2],[5,3,0]),\r\n([1,2,3],[5,0,4]),\r\n([5,0,3],[4,1,2]),\r\n([2,5,0],[4,3,1]),\r\n([3,5,2],[1,4,0]),\r\n([3,0,2],[1,4,5]),\r\n([3,4,0],[1,5,2]),\r\n([5,1,2],[3,4,0]),\r\n([0,5,3],[2,4,1]),\r\n([1,0,5],[2,3,4]),\r\n([1,5,4],[0,3,2]),\r\n([5,4,0],[1,3,2]),\r\n([0,2,1],[5,3,4]),\r\n([2,0,1],[4,3,5]),\r\n([2,3,1],[0,5,4]),\r\n([5,4,2],[1,0,3]),\r\n([1,5,2],[0,3,4]),\r\n([0,3,2],[4,1,5]),\r\n([4,3,2],[1,5,0]),\r\n([2,3,5],[1,4,0]),\r\n([1,0,2],[3,5,4]),\r\n([1,0,2],[3,5,4]),\r\n([1,2,5],[3,0,4]),\r\n([1,3,4],[2,5,0]),\r\n([3,0,5],[1,4,2]),\r\n([0,5,2],[1,3,4]),\r\n([0,1,3],[4,5,2]),\r\n([5,3,1],[4,0,2]),\r\n([4,2,3],[5,0,1]),\r\n([1,5,2],[3,0,4]),\r\n([3,1,0],[4,2,5]),\r\n([3,0,4],[2,1,5]),\r\n([0,3,2],[1,5,4]),\r\n([1,5,3],[0,4,2]),\r\n([0,5,1],[3,2,4]),\r\n([5,2,1],[3,0,4]),\r\n([2,3,1],[0,4,5]),\r\n([1,0,5],[3,2,4]),\r\n([1,2,5],[0,4,3]),\r\n([1,3,5],[2,4,0]),\r\n([2,3,5],[0,1,4]),\r\n([5,2,1],[4,3,0]),\r\n([4,2,0],[1,5,3]),\r\n([1,0,2],[3,4,5]),\r\n([5,2,1],[3,4,0]),\r\n([2,5,0],[3,1,4]),\r\n([2,4,5],[3,0,1]),\r\n([3,0,4],[1,5,2]),\r\n([1,4,2],[3,0,5]),\r\n([3,2,1],[0,5,4]),\r\n([5,0,4],[3,2,1]),\r\n([4,2,5],[0,3,1]),\r\n([5,3,4],[1,2,0]),\r\n([4,5,1],[0,3,2]),\r\n([0,1,4],[3,2,5]),\r\n([2,1,5],[3,4,0]),\r\n([2,1,4],[0,3,5]),\r\n([5,0,2],[1,4,3]),\r\n([1,0,5],[3,2,4]),\r\n([5,4,0],[2,3,1]),\r\n([5,3,2],[4,1,0]),\r\n([1,3,5],[2,0,4]),\r\n([3,5,2],[0,1,4]),\r\n([2,4,3],[1,5,0]),\r\n([4,5,0],[3,1,2]),\r\n([0,5,4],[1,2,3]),\r\n([1,3,5],[2,0,4]),\r\n([1,5,3],[0,4,2]),\r\n([1,0,5],[4,3,2]),\r\n([2,5,0],[1,3,4]),\r\n([5,0,3],[2,1,4]),\r\n([5,4,3],[1,2,0]),\r\n([3,2,4],[1,5,0]),\r\n([5,4,1],[0,3,2]),\r\n([1,2,4],[5,0,3]),\r\n([1,5,2],[0,4,3]),\r\n([5,4,1],[3,2,0]),\r\n([0,4,1],[5,2,3]),\r\n([2,5,4],[1,0,3]),\r\n([1,5,3],[2,4,0]),\r\n([4,3,2],[0,1,5]),\r\n([4,5,0],[3,2,1]),\r\n([4,0,5],[1,2,3]),\r\n([0,1,3],[5,2,4]),\r\n([5,0,3],[4,1,2]),\r\n([1,3,4],[2,0,5]),\r\n([5,2,1],[3,4,0]),\r\n([2,5,3],[1,4,0]),\r\n([2,4,3],[5,1,0]),\r\n([3,2,5],[0,4,1]),\r\n([1,2,4],[3,0,5]),\r\n([5,2,0],[1,3,4]),\r\n([4,1,2],[0,3,5]),\r\n([4,3,5],[0,2,1]),\r\n([5,1,2],[0,4,3]),\r\n([4,3,1],[0,2,5]),\r\n([3,0,4],[5,1,2]),\r\n([5,1,3],[0,2,4]),\r\n([0,1,2],[5,4,3]),\r\n([3,5,1],[4,2,0]),\r\n([0,2,3],[4,1,5]),\r\n([4,5,3],[1,0,2]),\r\n([4,1,5],[0,2,3]),\r\n([5,3,0],[2,4,1]),\r\n([2,3,1],[0,5,4]),\r\n([0,2,1],[5,4,3]),\r\n([3,1,4],[5,2,0]),\r\n([0,5,3],[1,2,4]),\r\n([5,2,3],[4,0,1]),\r\n([5,3,2],[0,4,1]),\r\n([3,1,0],[5,2,4]),\r\n([0,1,3],[2,4,5]),\r\n([2,4,0],[1,5,3]),\r\n([5,3,2],[0,4,1]),\r\n([4,2,3],[5,0,1]),\r\n([2,0,5],[3,4,1]),\r\n([1,5,4],[2,0,3]),\r\n([5,4,2],[1,3,0]),\r\n([2,1,5],[3,0,4]),\r\n([3,1,2],[4,5,0]),\r\n([1,0,5],[4,3,2]),\r\n([0,3,2],[1,5,4]),\r\n([5,4,3],[0,2,1]),\r\n([2,1,3],[5,0,4]),\r\n([5,2,3],[4,0,1]),\r\n([1,4,2],[3,5,0]),\r\n([4,5,0],[1,3,2]),\r\n([3,0,1],[2,5,4]),\r\n([0,1,3],[2,4,5]),\r\n([2,5,1],[4,0,3]),\r\n([0,5,2],[3,1,4]),\r\n([1,5,0],[2,4,3]),\r\n([3,5,1],[2,0,4]),\r\n([1,5,4],[3,0,2]),\r\n([1,5,3],[2,0,4]),\r\n([0,2,3],[5,4,1]),\r\n([1,0,3],[5,2,4]),\r\n([2,0,1],[5,4,3]),\r\n([4,3,2],[5,0,1]),\r\n([2,1,0],[3,5,4]),\r\n([1,0,4],[3,2,5]),\r\n([4,0,1],[5,3,2]),\r\n([4,3,5],[1,2,0]),\r\n([3,0,4],[5,2,1]),\r\n([0,4,2],[3,1,5]),\r\n([0,2,5],[3,4,1]),\r\n([3,4,1],[0,5,2]),\r\n([2,0,5],[4,3,1]),\r\n([1,0,3],[2,5,4]),\r\n([2,0,3],[5,1,4]),\r\n([4,5,2],[0,3,1]),\r\n([0,5,4],[2,1,3]),\r\n([0,2,1],[4,5,3]),\r\n([5,1,3],[4,0,2]),\r\n([5,0,4],[1,3,2]),\r\n([3,5,1],[0,4,2]),\r\n([5,4,3],[2,1,0]),\r\n([0,1,4],[3,2,5]),\r\n([0,5,3],[2,4,1]),\r\n([5,2,1],[0,3,4]),\r\n([3,5,2],[0,1,4]),\r\n([1,5,4],[2,0,3]),\r\n([5,2,3],[1,4,0]),\r\n([4,1,2],[5,0,3]),\r\n([5,0,4],[1,2,3]),\r\n([2,5,0],[3,4,1]),\r\n([3,0,1],[2,5,4]),\r\n([3,4,0],[2,5,1]),\r\n([5,2,4],[0,1,3]),\r\n([5,0,2],[1,4,3]),\r\n([5,4,2],[0,3,1]),\r\n([2,5,1],[0,3,4]),\r\n([3,1,5],[4,0,2]),\r\n([2,4,0],[5,3,1]),\r\n([2,3,0],[1,5,4]),\r\n([0,2,3],[5,1,4]),\r\n([0,1,3],[5,4,2]),\r\n([0,3,5],[2,1,4]),\r\n([4,5,0],[1,2,3]),\r\n([1,0,2],[4,3,5]),\r\n([0,3,1],[4,2,5]),\r\n([1,5,3],[0,2,4]),\r\n([4,5,3],[1,0,2]),\r\n([2,4,3],[5,0,1]),\r\n([5,4,0],[2,3,1]),\r\n([4,0,3],[1,2,5]),\r\n([1,3,0],[2,5,4]),\r\n([1,5,4],[3,0,2]),\r\n([5,2,3],[1,0,4]),\r\n([5,4,3],[1,0,2]),\r\n([5,0,2],[3,1,4]),\r\n([5,3,0],[2,4,1]),\r\n([3,4,5],[1,2,0]),\r\n([1,5,3],[4,2,0]),\r\n([0,1,4],[5,3,2]),\r\n([1,5,2],[0,4,3]),\r\n([1,0,2],[3,4,5]),\r\n([3,5,0],[2,4,1]),\r\n([0,2,5],[3,4,1]),\r\n([3,5,1],[2,0,4]),\r\n([0,4,1],[3,5,2]),\r\n([2,3,0],[4,5,1]),\r\n([4,2,1],[5,0,3]),\r\n([5,2,3],[4,0,1]),\r\n([2,5,0],[1,3,4]),\r\n([2,5,3],[0,4,1]),\r\n([5,2,0],[4,3,1]),\r\n([3,2,5],[0,1,4]),\r\n([4,0,1],[5,2,3]),\r\n([5,4,2],[0,3,1]),\r\n([2,5,0],[4,3,1]),\r\n([5,0,2],[4,3,1]),\r\n([5,0,2],[1,3,4]),\r\n([2,1,5],[4,3,0]),\r\n([0,4,1],[3,5,2]),\r\n([2,3,5],[0,1,4]),\r\n([3,4,2],[1,0,5]),\r\n([2,0,5],[3,1,4]),\r\n([2,1,4],[0,5,3]),\r\n([5,2,1],[3,0,4]),\r\n([0,4,1],[5,3,2]),\r\n([1,2,4],[5,0,3]),\r\n([4,5,0],[1,2,3]),\r\n([3,4,2],[5,1,0]),\r\n([5,2,3],[0,4,1]),\r\n([2,3,4],[5,1,0]),\r\n([5,2,4],[3,1,0]),\r\n([3,0,4],[1,5,2]),\r\n([0,2,1],[4,5,3]),\r\n([1,2,0],[4,5,3]),\r\n([3,1,5],[2,0,4]),\r\n([1,5,2],[4,3,0]),\r\n([0,4,2],[3,1,5]),\r\n([0,4,3],[5,1,2]),\r\n([4,3,1],[5,2,0]),\r\n([4,2,1],[5,3,0]),\r\n([4,5,1],[3,0,2]),\r\n([1,3,5],[0,4,2]),\r\n([4,3,5],[0,2,1]),\r\n([0,5,1],[2,4,3]),\r\n([4,3,5],[2,1,0]),\r\n([2,3,1],[0,5,4]),\r\n([4,5,3],[2,1,0]),\r\n([3,1,5],[0,2,4]),\r\n([4,1,2],[5,3,0]),\r\n([4,1,3],[5,2,0]),\r\n([4,3,0],[5,2,1]),\r\n([5,0,4],[3,1,2]),\r\n([4,0,3],[1,2,5]),\r\n([2,1,3],[4,0,5]),\r\n([3,5,4],[2,0,1]),\r\n([2,1,3],[0,4,5]),\r\n([1,4,0],[2,3,5]),\r\n([4,1,3],[0,2,5]),\r\n([2,0,4],[5,1,3]),\r\n([4,1,2],[5,3,0]),\r\n([0,2,3],[4,1,5]),\r\n([3,1,2],[5,4,0]),\r\n([1,0,2],[5,3,4]),\r\n([2,5,4],[1,3,0]),\r\n([1,2,4],[3,0,5]),\r\n([4,2,0],[3,5,1]),\r\n([5,3,1],[4,0,2]),\r\n([2,0,1],[4,3,5]),\r\n([2,0,5],[4,1,3]),\r\n([1,0,3],[5,4,2]),\r\n([1,2,4],[3,0,5]),\r\n([2,1,3],[5,0,4]),\r\n([3,4,0],[1,5,2]),\r\n([3,5,1],[0,4,2]),\r\n([5,3,0],[1,2,4]),\r\n([5,3,2],[1,4,0]),\r\n([3,2,4],[0,5,1]),\r\n([3,4,2],[5,0,1]),\r\n([1,5,3],[2,4,0]),\r\n([3,1,2],[0,5,4]),\r\n([4,3,1],[0,2,5]),\r\n([4,1,3],[2,0,5]),\r\n([1,0,4],[3,5,2]),\r\n([2,3,1],[4,0,5]),\r\n([2,3,0],[5,1,4]),\r\n([0,4,1],[3,5,2]),\r\n([2,0,4],[5,1,3]),\r\n([4,1,0],[3,2,5]),\r\n([0,1,4],[3,2,5]),\r\n([5,1,4],[2,0,3]),\r\n([2,3,5],[4,1,0]),\r\n([2,4,0],[3,5,1]),\r\n([0,2,3],[1,4,5]),\r\n([1,4,3],[5,2,0]),\r\n([1,0,2],[4,3,5]),\r\n([3,0,2],[1,4,5]),\r\n([5,4,1],[3,2,0]),\r\n([5,0,3],[2,1,4]),\r\n([5,2,3],[1,4,0]),\r\n([3,0,4],[5,2,1]),\r\n([3,1,5],[0,4,2]),\r\n([4,3,1],[5,2,0]),\r\n([5,0,3],[2,4,1]),\r\n([5,2,4],[0,1,3]),\r\n([1,0,5],[2,4,3]),\r\n([3,1,4],[0,5,2]),\r\n([0,2,1],[5,4,3]),\r\n([0,5,4],[1,3,2]),\r\n([2,5,4],[3,0,1]),\r\n([4,0,2],[5,3,1]),\r\n([5,0,3],[4,2,1]),\r\n([3,2,1],[5,0,4]),\r\n([0,3,2],[5,4,1]),\r\n([3,5,1],[4,0,2]),\r\n([5,4,0],[1,3,2]),\r\n([5,0,4],[1,2,3]),\r\n([3,4,0],[1,2,5]),\r\n([3,2,4],[5,1,0]),\r\n([2,3,1],[0,4,5]),\r\n([5,0,1],[2,3,4]),\r\n([5,2,4],[0,3,1]),\r\n([5,1,3],[0,2,4]),\r\n([4,0,2],[3,5,1]),\r\n([1,2,0],[4,5,3]),\r\n([1,3,5],[2,4,0]),\r\n([4,2,0],[1,5,3]),\r\n([2,1,5],[0,4,3]),\r\n([3,5,0],[1,4,2]),\r\n([4,0,3],[1,5,2]),\r\n([1,3,0],[4,2,5]),\r\n([2,0,1],[5,4,3]),\r\n([3,1,0],[5,2,4]),\r\n([1,2,4],[3,5,0]),\r\n([1,3,4],[0,5,2]),\r\n([1,3,4],[0,2,5]),\r\n([3,4,2],[1,5,0]),\r\n([4,1,5],[3,0,2]),\r\n([0,1,4],[5,2,3]),\r\n([4,3,0],[2,1,5]),\r\n([5,0,1],[2,3,4]),\r\n([0,1,5],[2,3,4]),\r\n([3,4,1],[0,5,2]),\r\n([4,1,2],[0,5,3]),\r\n([2,5,1],[0,4,3]),\r\n([4,1,0],[2,3,5]),\r\n([5,3,0],[1,2,4]),\r\n([5,3,4],[0,2,1]),\r\n([3,1,4],[0,2,5]),\r\n([2,3,1],[0,4,5]),\r\n([3,2,5],[0,4,1]),\r\n([3,1,0],[4,5,2]),\r\n([4,2,0],[3,5,1]),\r\n([5,4,3],[1,2,0]),\r\n([1,4,5],[0,2,3]),\r\n([4,5,3],[2,1,0]),\r\n([3,1,4],[5,0,2]),\r\n([0,2,3],[5,1,4]),\r\n([2,1,3],[5,0,4]),\r\n([1,5,3],[2,0,4]),\r\n([3,0,5],[2,1,4]),\r\n([5,3,0],[4,1,2]),\r\n([0,5,2],[4,3,1]),\r\n([2,1,4],[3,0,5]),\r\n([2,4,0],[1,3,5]),\r\n([2,5,1],[4,3,0]),\r\n([1,2,0],[4,3,5]),\r\n([3,4,5],[1,2,0]),\r\n([0,3,2],[4,5,1]),\r\n([3,1,0],[4,2,5]),\r\n([0,2,5],[1,3,4]),\r\n([1,5,4],[0,2,3]),\r\n([2,1,5],[4,0,3]),\r\n([0,2,4],[3,5,1]),\r\n([4,5,1],[2,0,3]),\r\n([3,2,1],[0,4,5]),\r\n([5,2,3],[1,4,0]),\r\n([3,4,1],[2,0,5]),\r\n([2,3,1],[5,0,4]),\r\n([1,0,2],[5,3,4]),\r\n([4,0,1],[3,5,2]),\r\n([1,0,4],[3,5,2]),\r\n([3,0,4],[5,2,1]),\r\n([1,0,3],[4,2,5]),\r\n([5,3,2],[4,0,1]),\r\n([3,5,0],[1,2,4]),\r\n([1,5,2],[0,4,3]),\r\n([3,2,5],[4,1,0]),\r\n([5,1,3],[0,4,2]),\r\n([1,4,3],[0,2,5]),\r\n([3,5,1],[2,4,0]),\r\n([0,3,1],[2,4,5]),\r\n([2,4,1],[5,0,3]),\r\n([2,4,3],[5,0,1]),\r\n([1,5,3],[2,4,0]),\r\n([2,3,5],[4,1,0]),\r\n([5,0,1],[4,2,3]),\r\n([5,1,3],[4,0,2]),\r\n([4,5,1],[0,2,3]),\r\n([3,0,5],[2,1,4]),\r\n([0,3,5],[2,4,1]),\r\n([5,0,3],[2,1,4]),\r\n([2,4,0],[5,3,1]),\r\n([3,5,4],[2,1,0]),\r\n([3,4,2],[1,0,5]),\r\n([4,2,0],[5,1,3]),\r\n([3,2,0],[4,1,5]),\r\n([3,2,5],[1,0,4]),\r\n([3,0,2],[1,5,4]),\r\n([2,4,0],[1,3,5]),\r\n([1,4,3],[2,5,0]),\r\n([2,1,3],[0,5,4]),\r\n([4,5,3],[2,1,0]),\r\n([5,4,1],[2,3,0]),\r\n([5,0,2],[1,4,3]),\r\n([2,0,1],[5,3,4]),\r\n([1,3,2],[0,5,4]),\r\n([3,0,2],[4,1,5]),\r\n([0,3,2],[1,4,5]),\r\n([0,1,3],[2,4,5]),\r\n([2,0,3],[4,1,5]),\r\n([5,0,4],[2,1,3]),\r\n([5,2,0],[4,3,1]),\r\n([2,5,4],[0,3,1]),\r\n([0,3,5],[2,1,4]),\r\n([1,0,3],[5,4,2]),\r\n([3,4,2],[1,0,5]),\r\n([0,3,1],[4,5,2]),\r\n([3,0,4],[2,1,5]),\r\n([2,1,0],[3,4,5]),\r\n([5,0,2],[4,1,3]),\r\n([2,4,3],[1,5,0]),\r\n([4,1,0],[3,2,5]),\r\n([5,3,0],[1,2,4]),\r\n([4,3,2],[0,5,1]),\r\n([1,3,2],[4,0,5]),\r\n([1,5,2],[4,0,3]),\r\n([1,0,4],[2,5,3]),\r\n([0,5,1],[4,3,2]),\r\n([3,2,0],[4,1,5]),\r\n([3,4,1],[5,2,0]),\r\n([0,4,3],[2,1,5]),\r\n([3,0,2],[4,1,5]),\r\n([4,1,2],[5,0,3]),\r\n([4,2,5],[1,0,3]),\r\n([4,5,0],[3,1,2]),\r\n([5,3,4],[1,2,0]),\r\n([3,2,4],[1,5,0]),\r\n([5,3,2],[4,1,0]),\r\n([1,3,5],[0,2,4]),\r\n([5,3,4],[1,2,0]),\r\n([2,0,5],[4,1,3]),\r\n([4,5,1],[2,3,0]),\r\n([0,3,4],[5,2,1]),\r\n([1,0,2],[4,5,3]),\r\n([5,0,3],[1,2,4]),\r\n([0,1,5],[4,2,3]),\r\n([3,5,2],[0,4,1]),\r\n([4,1,3],[5,0,2]),\r\n([5,2,0],[1,3,4]),\r\n([2,3,0],[4,5,1]),\r\n([3,1,5],[2,4,0]),\r\n([0,3,4],[1,2,5]),\r\n([0,1,2],[4,3,5]),\r\n([5,0,2],[4,3,1]),\r\n([4,1,3],[5,2,0]),\r\n([4,1,0],[2,3,5]),\r\n([2,0,4],[3,1,5]),\r\n([3,2,5],[4,0,1]),\r\n([0,5,2],[4,3,1]),\r\n([3,5,4],[0,2,1]),\r\n([3,2,1],[4,0,5]),\r\n([5,4,3],[2,1,0]),\r\n([5,4,2],[0,3,1]),\r\n([1,2,5],[4,3,0]),\r\n([3,2,5],[4,1,0]),\r\n([5,0,2],[1,4,3]),\r\n([3,0,5],[2,4,1]),\r\n([5,2,4],[1,3,0]),\r\n([1,2,5],[4,0,3]),\r\n([0,2,3],[5,1,4]),\r\n([2,3,4],[1,0,5]),\r\n([5,3,0],[4,2,1]),\r\n([4,0,3],[2,1,5]),\r\n([5,3,2],[1,4,0]),\r\n([5,0,1],[3,2,4]),\r\n([1,5,2],[3,0,4]),\r\n([3,5,0],[2,1,4]),\r\n([4,5,1],[3,2,0]),\r\n([1,5,3],[2,0,4]),\r\n([2,1,4],[5,3,0]),\r\n([5,0,1],[2,3,4]),\r\n([1,4,2],[3,5,0]),\r\n([0,4,3],[5,2,1]),\r\n([0,2,5],[3,1,4]),\r\n([5,2,4],[1,3,0]),\r\n([0,5,3],[1,4,2]),\r\n([4,0,1],[2,3,5]),\r\n([2,1,4],[5,3,0]),\r\n([1,5,3],[2,4,0]),\r\n([0,1,5],[4,3,2]),\r\n([4,1,3],[0,2,5]),\r\n([1,3,4],[2,0,5]),\r\n([4,3,2],[1,0,5]),\r\n([2,0,5],[3,4,1]),\r\n([0,2,1],[4,5,3]),\r\n([1,0,3],[4,5,2]),\r\n([1,3,0],[2,4,5]),\r\n([5,0,4],[1,2,3]),\r\n([4,5,0],[1,3,2]),\r\n([1,4,5],[3,2,0]),\r\n([4,1,3],[5,2,0]),\r\n([5,1,3],[2,0,4]),\r\n([2,4,0],[1,5,3]),\r\n([0,2,4],[5,1,3]),\r\n([0,3,2],[1,5,4]),\r\n([4,2,5],[0,3,1]),\r\n([2,1,0],[4,3,5]),\r\n([3,2,4],[5,1,0]),\r\n([2,5,1],[3,0,4]),\r\n([0,3,5],[2,1,4]),\r\n([4,5,0],[1,2,3]),\r\n([0,2,5],[1,4,3]),\r\n([1,2,3],[4,5,0]),\r\n([2,3,4],[0,5,1]),\r\n([2,4,5],[3,1,0]),\r\n([3,1,4],[0,5,2]),\r\n([0,4,2],[1,5,3]),\r\n([3,2,5],[0,4,1]),\r\n([4,3,5],[1,2,0]),\r\n([0,4,1],[3,5,2]),\r\n([2,3,4],[5,1,0]),\r\n([0,1,3],[5,4,2]),\r\n([1,4,3],[0,2,5]),\r\n([5,0,4],[1,3,2]),\r\n([3,2,0],[4,5,1]),\r\n([3,5,1],[4,0,2]),\r\n([3,4,5],[0,2,1]),\r\n([3,5,0],[2,1,4]),\r\n([1,5,3],[4,2,0]),\r\n([5,2,1],[4,0,3]),\r\n([2,3,1],[4,5,0]),\r\n([1,3,2],[0,5,4]),\r\n([0,2,3],[1,5,4]),\r\n([3,2,4],[5,1,0]),\r\n([4,2,0],[5,1,3]),\r\n([2,1,3],[0,5,4]),\r\n([2,4,0],[5,3,1]),\r\n([5,0,4],[3,1,2]),\r\n([0,5,1],[4,3,2]),\r\n([4,3,5],[1,0,2]),\r\n([3,1,2],[0,5,4]),\r\n([2,3,0],[5,4,1]),\r\n([5,4,1],[2,3,0]),\r\n([5,2,4],[3,0,1]),\r\n([5,1,0],[3,4,2]),\r\n([5,3,2],[4,0,1]),\r\n([2,1,5],[3,0,4]),\r\n([4,3,0],[1,5,2]),\r\n([3,0,4],[1,2,5]),\r\n([5,2,0],[1,3,4]),\r\n([0,2,3],[1,4,5]),\r\n([2,5,4],[3,0,1]),\r\n([3,4,0],[2,1,5]),\r\n([0,5,3],[2,4,1]),\r\n([3,0,2],[5,4,1]),\r\n([3,5,4],[0,1,2]),\r\n([5,4,1],[2,0,3]),\r\n([3,5,2],[4,0,1]),\r\n([4,0,2],[1,3,5]),\r\n([4,3,2],[1,0,5]),\r\n([5,4,3],[2,1,0]),\r\n([4,2,3],[5,0,1]),\r\n([2,0,3],[1,5,4]),\r\n([4,1,0],[3,5,2]),\r\n([2,0,4],[3,1,5]),\r\n([4,1,2],[3,5,0]),\r\n([3,0,4],[5,1,2]),\r\n([1,2,4],[5,3,0]),\r\n([2,5,4],[3,0,1]),\r\n([0,2,1],[4,3,5]),\r\n([3,4,5],[1,0,2]),\r\n([4,0,2],[1,5,3]),\r\n([5,2,1],[4,3,0]),\r\n([5,0,1],[4,2,3]),\r\n([4,1,2],[5,0,3]),\r\n([1,0,2],[3,4,5]),\r\n([2,5,4],[0,1,3]),\r\n([1,0,4],[2,5,3]),\r\n([3,0,4],[5,1,2]),\r\n([3,0,5],[1,4,2]),\r\n([2,5,1],[4,3,0]),\r\n([0,3,4],[2,5,1]),\r\n([3,0,1],[2,4,5]),\r\n([3,1,5],[0,4,2]),\r\n([4,0,5],[3,2,1]),\r\n([0,1,4],[3,2,5]),\r\n([5,3,2],[4,0,1]),\r\n([1,0,3],[2,5,4]),\r\n([4,0,2],[3,5,1]),\r\n([0,2,1],[5,3,4]),\r\n([4,0,3],[1,5,2]),\r\n([0,1,3],[2,4,5]),\r\n([2,0,1],[3,5,4]),\r\n([0,4,2],[3,1,5]),\r\n([4,2,3],[0,5,1]),\r\n([3,1,5],[2,0,4]),\r\n([1,5,0],[3,2,4]),\r\n([2,5,1],[3,0,4]),\r\n([5,0,1],[4,2,3]),\r\n([1,5,0],[2,3,4]),\r\n([3,4,2],[5,0,1]),\r\n([3,4,0],[1,5,2]),\r\n([0,5,2],[1,4,3]),\r\n([5,4,2],[0,3,1]),\r\n([2,0,3],[1,5,4]),\r\n([4,2,1],[3,0,5]),\r\n([1,5,3],[0,2,4]),\r\n([3,4,0],[2,5,1]),\r\n([4,1,0],[5,2,3]),\r\n([4,2,5],[3,1,0]),\r\n([4,1,0],[3,5,2]),\r\n([2,1,0],[4,3,5]),\r\n([0,3,2],[1,4,5]),\r\n([5,4,3],[1,2,0]),\r\n([5,3,4],[1,2,0]),\r\n([0,4,3],[5,2,1]),\r\n([1,0,5],[4,2,3]),\r\n([4,3,5],[2,0,1]),\r\n([2,4,0],[1,3,5]),\r\n([0,1,3],[4,2,5]),\r\n([0,4,2],[3,5,1]),\r\n([2,1,5],[3,0,4]),\r\n([3,0,2],[5,4,1]),\r\n([4,5,1],[3,2,0]),\r\n([1,0,4],[3,2,5]),\r\n([0,2,1],[4,5,3]),\r\n([1,0,4],[3,2,5]),\r\n([1,5,4],[2,3,0]),\r\n([3,0,1],[4,5,2]),\r\n([5,4,1],[3,0,2]),\r\n([2,0,5],[4,3,1]),\r\n([1,3,2],[5,0,4]),\r\n([4,1,0],[5,3,2]),\r\n([0,4,1],[5,3,2]),\r\n([0,3,4],[5,1,2]),\r\n([0,5,1],[2,4,3]),\r\n([0,3,5],[2,1,4]),\r\n([2,0,5],[1,3,4]),\r\n([1,0,3],[2,4,5]),\r\n([4,0,2],[5,1,3]),\r\n([3,5,4],[2,1,0]),\r\n([5,1,2],[4,3,0]),\r\n([4,5,1],[3,0,2]),\r\n([5,4,1],[0,2,3]),\r\n([1,3,4],[0,2,5]),\r\n([0,5,1],[2,3,4]),\r\n([0,3,5],[2,4,1]),\r\n([1,5,0],[4,3,2]),\r\n([3,0,2],[1,5,4]),\r\n([5,4,3],[1,2,0]),\r\n([5,3,2],[1,4,0]),\r\n([1,4,5],[0,2,3]),\r\n([5,4,0],[1,2,3]),\r\n([1,4,3],[0,5,2]),\r\n([0,2,1],[5,3,4]),\r\n([5,0,3],[2,1,4]),\r\n([1,0,3],[2,5,4]),\r\n([5,1,3],[4,2,0]),\r\n([1,2,5],[4,3,0]),\r\n([2,4,3],[5,1,0]),\r\n([5,4,0],[3,1,2]),\r\n([4,2,5],[0,3,1]),\r\n([1,2,3],[5,0,4]),\r\n([2,4,3],[5,0,1]),\r\n([3,5,2],[0,4,1]),\r\n([4,1,3],[2,5,0]),\r\n([3,0,2],[4,5,1]),\r\n([0,4,2],[5,3,1]),\r\n([3,1,0],[4,2,5]),\r\n([3,4,0],[1,5,2]),\r\n([2,3,5],[4,0,1]),\r\n([4,0,5],[2,1,3]),\r\n([2,4,3],[0,5,1]),\r\n([0,3,4],[5,1,2]),\r\n([5,0,3],[2,1,4]),\r\n([2,1,0],[4,5,3]),\r\n([4,3,5],[0,1,2]),\r\n([2,5,0],[3,4,1]),\r\n([4,5,0],[1,2,3]),\r\n([0,5,2],[1,4,3]),\r\n([3,4,2],[1,5,0]),\r\n([5,0,3],[2,1,4]),\r\n([1,5,0],[2,4,3]),\r\n([4,3,0],[5,2,1]),\r\n([4,1,2],[0,3,5]),\r\n([3,2,4],[5,0,1]),\r\n([2,3,5],[1,4,0]),\r\n([1,3,4],[2,0,5]),\r\n([2,1,5],[3,0,4]),\r\n([5,1,4],[0,3,2]),\r\n([2,1,0],[4,5,3]),\r\n([4,5,0],[3,2,1]),\r\n([3,5,2],[0,4,1]),\r\n([1,2,4],[5,0,3]),\r\n([5,3,2],[1,0,4]),\r\n([5,2,1],[4,3,0]),\r\n([1,3,4],[2,5,0]),\r\n([4,3,2],[1,5,0]),\r\n([3,0,5],[4,1,2]),\r\n([4,0,5],[3,2,1]),\r\n([5,3,1],[4,0,2]),\r\n([4,0,2],[1,5,3]),\r\n([3,0,2],[5,4,1]),\r\n([1,0,5],[3,4,2]),\r\n([0,3,2],[5,1,4]),\r\n([4,1,3],[2,0,5]),\r\n([0,1,4],[3,5,2]),\r\n([5,4,1],[3,2,0]),\r\n([3,0,2],[1,5,4]),\r\n([0,4,3],[1,2,5]),\r\n([5,2,0],[4,1,3]),\r\n([5,3,0],[4,1,2]),\r\n([3,1,2],[0,5,4]),\r\n([3,1,2],[4,0,5]),\r\n([5,1,4],[0,3,2]),\r\n([2,1,0],[4,3,5]),\r\n([0,3,4],[1,5,2]),\r\n([4,3,1],[2,0,5]),\r\n([4,5,1],[3,0,2]),\r\n([0,1,3],[2,4,5]),\r\n([3,0,4],[5,2,1]),\r\n([1,0,3],[2,4,5]),\r\n([1,2,0],[4,3,5]),\r\n([2,1,4],[3,0,5]),\r\n([2,1,0],[4,3,5]),\r\n([3,2,1],[0,5,4]),\r\n([5,4,2],[1,3,0]),\r\n([3,1,2],[4,5,0]),\r\n([2,4,0],[1,3,5]),\r\n([1,0,4],[2,5,3]),\r\n([5,3,4],[2,1,0]),\r\n([0,1,3],[4,2,5]),\r\n([3,5,4],[1,2,0]),\r\n([4,5,3],[1,2,0]),\r\n([3,4,1],[2,0,5]),\r\n([2,0,1],[4,3,5]),\r\n([1,2,4],[5,0,3]),\r\n([0,2,1],[3,4,5]),\r\n([4,3,5],[2,0,1]),\r\n([5,2,4],[0,3,1]),\r\n([2,5,0],[1,4,3]),\r\n([4,5,1],[3,2,0]),\r\n([2,1,0],[5,3,4]),\r\n([0,1,2],[5,4,3]),\r\n([4,0,5],[3,1,2]),\r\n([4,0,1],[2,3,5]),\r\n([5,1,2],[0,3,4]),\r\n([5,0,4],[2,1,3]),\r\n([0,2,1],[4,5,3]),\r\n([3,4,1],[0,5,2]),\r\n([0,5,4],[3,1,2]),\r\n([2,3,5],[0,1,4]),\r\n([2,5,3],[1,0,4]),\r\n([3,0,5],[1,2,4]),\r\n([3,4,0],[2,5,1]),\r\n([5,0,1],[3,4,2]),\r\n([1,4,3],[0,5,2]),\r\n([2,0,5],[4,3,1]),\r\n([4,3,2],[1,5,0]),\r\n([1,3,4],[2,0,5]),\r\n([0,3,1],[5,4,2]),\r\n([4,0,5],[2,1,3]),\r\n([3,5,0],[1,2,4]),\r\n([1,4,2],[0,5,3]),\r\n([4,0,5],[1,2,3]),\r\n([1,2,5],[0,4,3]),\r\n([2,4,0],[1,5,3]),\r\n([2,3,4],[5,1,0]),\r\n([0,1,4],[5,3,2]),\r\n([0,2,5],[3,4,1]),\r\n([1,2,5],[4,0,3]),\r\n([4,2,0],[1,5,3]),\r\n([3,2,4],[0,5,1]),\r\n([4,2,5],[0,3,1]),\r\n([0,1,5],[4,2,3]),\r\n([2,4,5],[0,3,1]),\r\n([1,2,3],[4,5,0]),\r\n([5,3,1],[0,4,2]),\r\n([3,4,1],[5,0,2]),\r\n([0,1,3],[2,5,4]),\r\n([0,3,5],[1,4,2]),\r\n([1,2,5],[3,0,4]),\r\n([1,5,3],[4,2,0]),\r\n([1,3,0],[4,2,5]),\r\n([5,2,1],[0,4,3]),\r\n([5,4,2],[3,0,1]),\r\n([3,0,2],[4,5,1]),\r\n([3,0,2],[4,5,1]),\r\n([3,2,5],[0,1,4]),\r\n([0,2,5],[3,1,4]),\r\n([4,1,5],[2,0,3]),\r\n([0,3,1],[5,4,2]),\r\n([5,0,1],[4,2,3]),\r\n([1,3,5],[0,4,2]),\r\n([5,4,3],[0,1,2]),\r\n([0,3,1],[5,4,2]),\r\n([0,4,5],[1,3,2]),\r\n([1,4,2],[3,0,5]),\r\n([5,1,2],[0,4,3]),\r\n([3,5,0],[1,4,2]),\r\n([2,0,3],[4,5,1]),\r\n([5,0,4],[3,1,2]),\r\n([3,2,1],[4,5,0]),\r\n([2,3,1],[4,0,5]),\r\n([0,1,5],[4,2,3]),\r\n([1,2,3],[0,4,5]),\r\n([1,5,3],[2,0,4]),\r\n([3,5,0],[2,4,1]),\r\n([5,3,4],[2,0,1]),\r\n([4,0,1],[3,2,5]),\r\n([3,4,2],[5,0,1]),\r\n([3,1,2],[0,5,4]),\r\n([5,1,2],[0,3,4]),\r\n([5,2,1],[3,4,0]),\r\n([0,2,1],[4,5,3]),\r\n([3,2,5],[4,0,1]),\r\n([4,0,3],[5,1,2]),\r\n([4,3,5],[0,2,1]),\r\n([3,4,0],[1,2,5]),\r\n([2,0,5],[3,4,1]),\r\n([2,1,3],[0,5,4]),\r\n([2,4,5],[3,1,0]),\r\n([0,1,5],[4,2,3]),\r\n([4,0,1],[2,5,3]),\r\n([3,5,4],[1,0,2]),\r\n([0,2,3],[4,1,5]),\r\n([5,3,4],[1,2,0]),\r\n([4,1,5],[0,2,3]),\r\n([2,1,5],[0,3,4]),\r\n([0,5,4],[3,2,1]),\r\n([1,4,0],[3,2,5]),\r\n([2,0,4],[5,1,3]),\r\n([4,3,0],[5,2,1]),\r\n([4,5,3],[1,0,2]),\r\n([1,2,0],[3,4,5]),\r\n([4,2,3],[5,0,1]),\r\n([2,3,0],[5,1,4]),\r\n([5,0,4],[2,3,1]),\r\n([5,0,2],[1,4,3]),\r\n([0,3,4],[1,5,2]),\r\n([5,3,2],[4,1,0]),\r\n([1,5,2],[4,0,3]),\r\n([1,0,4],[3,2,5]),\r\n([0,2,1],[5,3,4]),\r\n([2,0,3],[1,4,5]),\r\n([0,1,3],[5,4,2]),\r\n([0,5,3],[2,4,1]),\r\n([5,0,1],[4,3,2]),\r\n([4,2,0],[1,3,5]),\r\n([0,5,3],[1,2,4]),\r\n([3,5,0],[2,1,4]),\r\n([2,4,1],[5,3,0]),\r\n([3,2,5],[4,0,1]),\r\n([0,5,1],[3,4,2]),\r\n([5,0,1],[2,3,4]),\r\n([0,3,2],[5,1,4]),\r\n([4,2,3],[0,1,5]),\r\n([3,2,5],[4,0,1]),\r\n([3,5,0],[1,4,2]),\r\n([5,2,3],[1,0,4]),\r\n([0,1,3],[5,2,4]),\r\n([5,2,3],[1,0,4]),\r\n([0,4,2],[5,3,1]),\r\n([1,3,4],[5,0,2]),\r\n([3,1,5],[0,2,4]),\r\n([3,2,4],[1,5,0]),\r\n([4,5,3],[1,0,2]),\r\n([2,3,1],[5,4,0]),\r\n([4,0,3],[5,1,2]),\r\n([0,2,3],[5,1,4]),\r\n([5,4,2],[3,1,0]),\r\n([4,3,5],[0,2,1]),\r\n([4,5,2],[3,1,0]),\r\n([1,3,4],[0,5,2]),\r\n([2,3,0],[1,4,5]),\r\n([3,2,1],[0,4,5]),\r\n([2,0,4],[5,1,3]),\r\n([0,1,2],[5,4,3]),\r\n([1,0,3],[4,5,2]),\r\n([4,0,5],[3,1,2]),\r\n([5,2,3],[0,4,1]),\r\n([3,1,4],[0,5,2]),\r\n([3,1,5],[0,4,2]),\r\n([5,2,0],[3,4,1]),\r\n([2,0,5],[3,1,4]),\r\n([1,3,2],[4,0,5]),\r\n([5,0,4],[2,3,1]),\r\n([1,3,0],[2,4,5]),\r\n([4,1,2],[5,3,0]),\r\n([2,0,4],[5,1,3]),\r\n([5,0,3],[4,2,1]),\r\n([0,4,3],[2,5,1]),\r\n([1,2,5],[0,3,4]),\r\n([0,2,1],[4,3,5]),\r\n([0,5,2],[1,3,4]),\r\n([2,3,5],[1,4,0]),\r\n([4,3,5],[0,1,2]),\r\n([2,3,0],[1,4,5]),\r\n([4,2,0],[5,3,1]),\r\n([0,1,5],[3,2,4]),\r\n([5,4,1],[3,0,2]),\r\n([5,2,4],[1,0,3]),\r\n([1,5,2],[4,0,3]),\r\n([5,3,0],[2,1,4]),\r\n([1,4,5],[2,3,0]),\r\n([2,0,4],[3,1,5]),\r\n([5,3,0],[2,1,4]),\r\n([4,5,1],[0,3,2]),\r\n([2,5,3],[1,4,0]),\r\n([2,3,1],[4,0,5]),\r\n([5,0,1],[2,4,3]),\r\n([3,5,0],[1,4,2]),\r\n([4,2,5],[0,3,1]),\r\n([3,1,0],[2,5,4]),\r\n([1,2,3],[5,0,4]),\r\n([3,1,5],[2,4,0]),\r\n([4,2,1],[3,0,5]),\r\n([2,5,1],[4,3,0]),\r\n([1,3,5],[2,0,4]),\r\n([4,1,3],[5,2,0]),\r\n([3,0,5],[4,2,1]),\r\n([1,4,2],[0,5,3]),\r\n([4,5,3],[2,0,1]),\r\n([4,5,1],[3,2,0]),\r\n([2,3,4],[1,5,0]),\r\n([4,5,0],[3,2,1]),\r\n([3,2,4],[5,0,1]),\r\n([1,2,5],[4,0,3]),\r\n([4,0,1],[3,5,2]),\r\n([0,2,5],[4,3,1]),\r\n([1,4,3],[2,5,0]),\r\n([0,2,3],[5,1,4]),\r\n([1,2,0],[4,5,3]),\r\n([4,3,1],[0,5,2]),\r\n([2,0,1],[5,4,3]),\r\n([0,2,3],[4,1,5]),\r\n([3,0,2],[1,5,4]),\r\n([0,5,1],[3,2,4]),\r\n([1,3,2],[0,4,5]),\r\n([3,4,2],[1,0,5]),\r\n([2,1,0],[3,4,5]),\r\n([3,0,4],[5,1,2]),\r\n([5,0,2],[1,4,3]),\r\n([5,1,0],[4,2,3]),\r\n([1,4,5],[2,3,0]),\r\n([4,3,5],[2,1,0]),\r\n([4,1,5],[0,2,3]),\r\n([3,5,4],[1,2,0]),\r\n([1,0,2],[4,5,3]),\r\n([0,4,3],[1,5,2]),\r\n([4,2,5],[3,0,1]),\r\n([4,2,1],[0,5,3]),\r\n([2,5,3],[0,4,1]),\r\n([3,5,2],[1,0,4]),\r\n([3,2,5],[0,4,1]),\r\n([4,0,2],[3,5,1]),\r\n([5,3,1],[4,2,0]),\r\n([0,1,4],[5,2,3]),\r\n([4,1,3],[0,2,5]),\r\n([5,0,3],[1,4,2]),\r\n([2,5,3],[1,4,0]),\r\n([4,3,1],[0,5,2]),\r\n([2,5,1],[3,4,0]),\r\n([0,5,4],[1,2,3]),\r\n([5,3,2],[0,4,1]),\r\n([3,0,5],[2,1,4]),\r\n([4,5,2],[0,3,1]),\r\n([1,0,3],[2,4,5]),\r\n([0,1,2],[3,4,5]),\r\n([5,2,3],[0,1,4]),\r\n([1,2,3],[5,0,4]),\r\n([5,1,2],[4,0,3]),\r\n([1,5,2],[3,0,4]),\r\n([3,2,4],[0,1,5]),\r\n([1,3,4],[2,0,5]),\r\n([4,2,5],[1,3,0]),\r\n([1,4,0],[3,2,5]),\r\n([3,4,5],[2,0,1]),\r\n([3,4,5],[0,1,2]),\r\n([3,4,2],[1,5,0]),\r\n([5,2,0],[4,1,3]),\r\n([5,1,2],[3,4,0]),\r\n([2,4,3],[0,5,1]),\r\n([0,5,2],[3,1,4]),\r\n([2,0,3],[1,4,5]),\r\n([5,2,4],[3,1,0]),\r\n([2,5,3],[4,1,0]),\r\n([3,5,0],[2,4,1]),\r\n([0,1,3],[2,5,4]),\r\n([4,1,0],[5,2,3]),\r\n([5,2,4],[1,3,0]),\r\n([0,1,2],[3,4,5]),\r\n([2,1,3],[0,4,5]),\r\n([4,5,3],[2,0,1]),\r\n([1,3,4],[5,2,0]),\r\n([4,2,3],[0,5,1]),\r\n([0,3,5],[1,4,2]),\r\n([2,5,4],[3,0,1]),\r\n([1,3,4],[2,5,0]),\r\n([3,4,2],[1,0,5]),\r\n([4,5,0],[3,1,2]),\r\n([4,0,3],[2,1,5]),\r\n([2,0,3],[1,4,5]),\r\n([2,5,0],[4,1,3]),\r\n([4,1,3],[0,2,5]),\r\n([0,4,1],[3,5,2]),\r\n([4,1,5],[0,3,2]),\r\n([0,1,5],[4,2,3]),\r\n([5,4,1],[3,2,0]),\r\n([1,0,5],[3,2,4]),\r\n([0,5,4],[2,1,3]),\r\n([3,5,1],[0,4,2]),\r\n([5,4,0],[1,3,2]),\r\n([1,0,4],[5,3,2]),\r\n([4,1,3],[5,2,0]),\r\n([4,0,2],[3,5,1]),\r\n([3,5,2],[0,1,4]),\r\n([0,5,3],[4,1,2]),\r\n([5,0,2],[1,4,3]),\r\n([4,0,1],[5,2,3]),\r\n([5,0,4],[2,1,3]),\r\n([1,2,5],[4,0,3]),\r\n([0,5,2],[4,1,3]),\r\n([0,2,3],[1,4,5]),\r\n([3,4,5],[1,0,2]),\r\n([2,0,1],[3,4,5]),\r\n([3,4,0],[1,2,5]),\r\n([1,0,4],[5,2,3]),\r\n([4,2,5],[3,0,1]),\r\n([3,1,2],[0,4,5]),\r\n([0,3,5],[1,4,2]),\r\n([2,0,4],[1,5,3]),\r\n([0,1,2],[3,4,5]),\r\n([3,5,1],[2,4,0]),\r\n([3,4,1],[5,2,0]),\r\n([5,3,2],[0,1,4]),\r\n([0,1,4],[2,3,5]),\r\n([1,2,4],[5,0,3]),\r\n([4,3,1],[2,5,0]),\r\n([0,4,3],[5,2,1]),\r\n([4,1,5],[0,2,3]),\r\n([1,5,4],[2,0,3]),\r\n([3,5,2],[0,1,4]),\r\n([3,2,5],[0,1,4]),\r\n([4,0,2],[5,1,3]),\r\n([0,3,2],[4,1,5]),\r\n([5,0,1],[3,2,4]),\r\n([1,2,4],[0,5,3]),\r\n([5,4,3],[0,1,2]),\r\n([1,2,5],[3,4,0]),\r\n([0,3,4],[2,1,5]),\r\n([3,5,2],[1,0,4]),\r\n([4,0,1],[5,3,2]),\r\n([2,0,1],[5,4,3]),\r\n([3,4,1],[0,2,5]),\r\n([2,5,4],[0,3,1]),\r\n([3,1,4],[5,0,2]),\r\n([5,3,0],[2,1,4]),\r\n([2,4,3],[0,1,5]),\r\n([3,0,4],[2,5,1]),\r\n([2,1,5],[3,4,0]),\r\n([0,2,3],[5,4,1]),\r\n([0,2,4],[3,1,5]),\r\n([1,3,0],[5,2,4]),\r\n([1,0,5],[2,3,4]),\r\n([1,0,3],[5,4,2]),\r\n([3,1,0],[4,2,5]),\r\n([2,0,1],[4,5,3]),\r\n([0,1,4],[5,3,2]),\r\n([3,2,0],[1,5,4]),\r\n([2,0,1],[5,4,3]),\r\n([2,0,3],[1,5,4]),\r\n([4,1,2],[0,5,3]),\r\n([4,3,1],[5,0,2]),\r\n([2,5,1],[3,0,4]),\r\n([2,4,0],[1,5,3]),\r\n([0,3,1],[4,5,2]),\r\n([4,5,2],[1,3,0]),\r\n([1,5,2],[0,4,3]),\r\n([0,3,2],[1,5,4]),\r\n([3,0,4],[1,2,5]),\r\n([5,1,4],[2,3,0]),\r\n([1,5,2],[3,0,4]),\r\n([0,5,1],[2,3,4]),\r\n([1,2,0],[5,4,3]),\r\n([3,4,5],[2,1,0]),\r\n([2,1,4],[3,0,5]),\r\n([3,4,5],[1,0,2]),\r\n([4,0,1],[3,5,2]),\r\n([2,4,3],[0,5,1]),\r\n([5,4,3],[2,0,1]),\r\n([4,5,0],[3,2,1]),\r\n([2,0,1],[4,3,5]),\r\n([4,2,3],[1,0,5]),\r\n([4,3,5],[1,2,0]),\r\n([4,5,1],[2,0,3]),\r\n([2,4,1],[5,3,0]),\r\n([4,3,5],[0,2,1]),\r\n([3,5,1],[4,0,2]),\r\n([3,5,1],[4,0,2]),\r\n([2,1,5],[0,4,3]),\r\n([0,3,1],[4,2,5]),\r\n([5,3,1],[4,0,2]),\r\n([1,2,4],[3,5,0]),\r\n([5,1,3],[0,2,4]),\r\n([2,4,5],[0,1,3]),\r\n([0,1,5],[3,2,4]),\r\n([2,3,4],[5,1,0]),\r\n([4,2,5],[0,3,1]),\r\n([0,1,3],[4,5,2]),\r\n([5,4,1],[3,0,2]),\r\n([2,3,1],[5,4,0]),\r\n([1,0,3],[2,5,4]),\r\n([1,2,4],[5,0,3]),\r\n([0,4,2],[5,1,3]),\r\n([1,3,5],[0,4,2]),\r\n([2,0,1],[5,3,4]),\r\n([0,3,4],[1,2,5]),\r\n([0,1,5],[4,3,2]),\r\n([1,3,2],[5,4,0]),\r\n([0,3,1],[4,5,2]),\r\n([3,4,5],[0,2,1]),\r\n([3,5,4],[0,1,2]),\r\n([3,2,4],[1,0,5]),\r\n([3,0,1],[4,5,2]),\r\n([2,1,0],[3,5,4]),\r\n([3,2,0],[1,5,4]),\r\n([3,1,5],[0,4,2]),\r\n([3,1,5],[4,2,0]),\r\n([1,0,4],[3,5,2]),\r\n([1,5,4],[2,3,0]),\r\n([3,4,0],[1,2,5]),\r\n([1,5,3],[4,2,0]),\r\n([3,2,5],[1,4,0]),\r\n([0,1,5],[3,4,2]),\r\n([3,2,0],[1,4,5]),\r\n([4,2,3],[5,1,0]),\r\n([0,3,1],[2,4,5]),\r\n([0,3,2],[4,1,5]),\r\n([5,4,0],[2,3,1]),\r\n([4,1,2],[5,0,3]),\r\n([1,3,4],[0,5,2]),\r\n([2,1,4],[0,3,5]),\r\n([3,5,4],[2,0,1]),\r\n([0,4,5],[2,1,3]),\r\n([0,2,1],[4,5,3]),\r\n([2,3,0],[4,1,5]),\r\n([1,0,4],[5,2,3]),\r\n([5,3,2],[1,4,0]),\r\n([1,4,0],[2,3,5]),\r\n([1,5,0],[2,4,3]),\r\n([1,2,5],[3,0,4]),\r\n([3,1,5],[4,0,2]),\r\n([1,4,2],[5,0,3]),\r\n([1,5,0],[4,3,2]),\r\n([0,2,1],[4,5,3]),\r\n([5,0,1],[3,4,2]),\r\n([5,2,1],[3,4,0]),\r\n([4,1,3],[0,2,5]),\r\n([2,4,3],[5,0,1]),\r\n([4,1,0],[2,5,3]),\r\n([3,2,5],[1,4,0]),\r\n([2,0,4],[5,1,3]),\r\n([2,4,3],[0,1,5]),\r\n([2,0,5],[3,4,1]),\r\n([4,1,3],[5,2,0]),\r\n([5,3,4],[1,2,0]),\r\n([4,3,2],[0,1,5]),\r\n([2,3,0],[1,5,4]),\r\n([4,2,1],[3,0,5]),\r\n([4,3,0],[5,1,2]),\r\n([4,2,1],[0,5,3]),\r\n([5,3,1],[0,2,4]),\r\n([0,3,5],[4,2,1]),\r\n([5,2,4],[3,1,0]),\r\n([0,5,3],[1,4,2]),\r\n([2,5,3],[1,4,0]),\r\n([0,4,3],[1,2,5]),\r\n([3,0,1],[4,2,5]),\r\n([5,0,4],[1,3,2]),\r\n([4,3,0],[2,1,5]),\r\n([1,5,0],[2,3,4]),\r\n([1,0,5],[2,3,4]),\r\n([2,1,5],[0,3,4]),\r\n([2,1,3],[0,4,5]),\r\n([3,4,2],[5,0,1]),\r\n([0,3,2],[5,4,1]),\r\n([2,0,1],[4,5,3]),\r\n([4,5,1],[3,2,0]),\r\n([5,2,3],[4,1,0]),\r\n([3,2,1],[4,5,0]),\r\n([0,5,4],[1,2,3]),\r\n([2,1,0],[5,3,4]),\r\n([3,0,2],[5,4,1]),\r\n([0,4,1],[2,5,3]),\r\n([5,4,2],[0,3,1]),\r\n([5,3,2],[4,1,0]),\r\n([0,3,2],[4,5,1]),\r\n([0,1,2],[3,4,5]),\r\n([3,4,1],[0,2,5]),\r\n([0,4,3],[2,1,5]),\r\n([1,5,0],[2,3,4]),\r\n([1,0,5],[3,4,2]),\r\n([0,5,2],[3,4,1]),\r\n([5,0,3],[2,1,4]),\r\n([2,0,3],[5,4,1]),\r\n([2,5,1],[0,3,4]),\r\n([2,4,1],[0,3,5]),\r\n([3,0,5],[2,1,4]),\r\n([5,3,4],[2,1,0]),\r\n([5,1,2],[0,3,4]),\r\n([4,0,5],[3,1,2]),\r\n([1,5,3],[4,2,0]),\r\n([2,4,1],[0,5,3]),\r\n([2,3,4],[0,1,5]),\r\n([0,5,2],[1,3,4]),\r\n([5,0,2],[1,3,4]),\r\n([2,3,1],[0,4,5]),\r\n([3,1,5],[0,2,4]),\r\n([5,0,4],[1,3,2]),\r\n([3,5,0],[4,2,1]),\r\n([4,3,5],[1,2,0]),\r\n([1,0,5],[3,4,2]),\r\n([0,5,1],[2,3,4]),\r\n([2,5,3],[1,4,0]),\r\n([3,1,2],[0,5,4]),\r\n([0,4,5],[1,3,2]),\r\n([4,2,1],[3,5,0]),\r\n([4,1,2],[0,5,3]),\r\n([4,2,0],[3,5,1]),\r\n([2,0,1],[5,3,4]),\r\n([1,2,3],[0,5,4]),\r\n([2,1,3],[5,4,0]),\r\n([1,0,3],[5,2,4]),\r\n([5,0,2],[1,4,3]),\r\n([4,2,5],[0,3,1]),\r\n([0,5,2],[3,1,4]),\r\n([1,3,0],[4,5,2]),\r\n([3,0,4],[2,5,1]),\r\n([3,2,5],[4,1,0]),\r\n([2,0,3],[5,1,4]),\r\n([4,0,5],[1,2,3]),\r\n([1,4,5],[0,2,3]),\r\n([0,1,2],[4,5,3]),\r\n([3,4,5],[0,2,1]),\r\n([4,1,2],[0,3,5]),\r\n([0,3,1],[4,2,5]),\r\n([1,0,2],[4,3,5]),\r\n([0,1,3],[5,2,4]),\r\n([2,1,3],[5,4,0]),\r\n([4,2,5],[1,3,0]),\r\n([2,3,1],[4,0,5]),\r\n([1,4,3],[2,5,0]),\r\n([2,4,5],[0,1,3]),\r\n([4,2,1],[3,0,5]),\r\n([3,0,2],[5,4,1]),\r\n([1,0,4],[2,5,3]),\r\n([0,3,2],[5,1,4]),\r\n([5,4,3],[1,0,2]),\r\n([5,0,3],[1,2,4]),\r\n([3,1,4],[2,5,0]),\r\n([5,0,4],[1,3,2]),\r\n([5,3,2],[0,1,4]),\r\n([3,0,5],[2,1,4]),\r\n([4,1,0],[3,5,2]),\r\n([1,4,3],[2,0,5]),\r\n([0,1,4],[3,2,5]),\r\n([5,4,0],[1,3,2]),\r\n([2,5,1],[3,4,0]),\r\n([3,1,0],[4,5,2]),\r\n([5,4,3],[0,1,2]),\r\n([1,2,4],[3,5,0]),\r\n([3,1,4],[0,2,5]),\r\n([4,3,2],[0,1,5]),\r\n([4,0,2],[3,5,1]),\r\n([0,2,4],[3,1,5]),\r\n([1,4,5],[2,3,0]),\r\n([1,0,3],[2,4,5]),\r\n([0,2,1],[3,4,5]),\r\n([4,1,2],[3,0,5]),\r\n([0,3,5],[4,1,2]),\r\n([0,2,1],[3,4,5]),\r\n([1,4,5],[0,3,2]),\r\n([1,2,5],[3,4,0]),\r\n([3,5,1],[2,0,4]),\r\n([4,0,5],[1,2,3]),\r\n([3,1,2],[0,4,5]),\r\n([2,5,3],[1,4,0]),\r\n([0,4,3],[5,1,2]),\r\n([2,0,3],[4,5,1]),\r\n([0,2,3],[5,4,1]),\r\n([5,3,4],[2,0,1]),\r\n([1,3,0],[5,2,4]),\r\n([2,5,4],[0,1,3]),\r\n([5,2,3],[4,0,1]),\r\n([4,5,3],[2,0,1]),\r\n([3,4,5],[2,0,1]),\r\n([4,3,1],[5,2,0]),\r\n([5,1,2],[3,4,0]),\r\n([4,2,1],[0,5,3]),\r\n([3,5,4],[2,0,1]),\r\n([4,2,1],[5,3,0]),\r\n([4,1,0],[2,5,3]),\r\n([2,0,4],[5,1,3]),\r\n([3,0,1],[2,4,5]),\r\n([4,2,1],[0,3,5]),\r\n([5,2,1],[0,4,3]),\r\n([5,2,1],[4,3,0]),\r\n([5,4,3],[1,2,0]),\r\n([4,1,2],[0,3,5]),\r\n([3,2,0],[4,1,5]),\r\n([5,3,4],[2,1,0]),\r\n([5,0,1],[4,3,2]),\r\n([1,3,2],[0,5,4]),\r\n([1,3,2],[4,0,5]),\r\n([2,0,5],[4,3,1]),\r\n([5,0,4],[2,3,1]),\r\n([1,3,5],[2,0,4]),\r\n([3,1,0],[2,4,5]),\r\n([0,5,3],[1,2,4]),\r\n([3,1,5],[4,2,0]),\r\n([2,3,4],[0,1,5]),\r\n([2,4,0],[3,1,5]),\r\n([2,3,5],[1,4,0]),\r\n([0,4,2],[5,3,1]),\r\n([5,2,1],[3,4,0]),\r\n([4,3,1],[0,2,5]),\r\n([2,5,4],[1,0,3]),\r\n([4,3,5],[1,0,2]),\r\n([1,5,3],[0,2,4]),\r\n([4,2,0],[5,1,3]),\r\n([1,5,4],[0,3,2]),\r\n([4,0,5],[2,1,3]),\r\n([0,5,1],[3,4,2]),\r\n([0,3,4],[2,1,5]),\r\n([3,5,1],[2,4,0]),\r\n([1,4,2],[0,5,3]),\r\n([4,1,2],[5,0,3]),\r\n([3,1,4],[2,0,5]),\r\n([3,1,5],[2,4,0]),\r\n([5,1,0],[2,4,3]),\r\n([0,3,1],[4,2,5]),\r\n([4,3,2],[0,1,5]),\r\n([3,2,4],[1,5,0]),\r\n([4,3,2],[5,0,1]),\r\n([3,0,5],[1,4,2]),\r\n([2,4,3],[5,0,1]),\r\n([3,2,4],[0,1,5]),\r\n([2,3,1],[5,4,0]),\r\n([2,1,3],[4,5,0]),\r\n([3,4,1],[5,2,0]),\r\n([1,5,4],[0,2,3]),\r\n([5,1,0],[3,2,4]),\r\n([1,4,0],[3,2,5]),\r\n([2,0,4],[1,5,3]),\r\n([1,5,3],[0,4,2]),\r\n([0,2,1],[5,3,4]),\r\n([1,0,2],[5,3,4]),\r\n([1,5,4],[3,2,0]),\r\n([0,1,4],[5,2,3]),\r\n([3,4,1],[0,5,2]),\r\n([2,3,1],[5,0,4]),\r\n([0,4,2],[5,3,1]),\r\n([1,0,3],[5,2,4]),\r\n([5,2,1],[3,4,0]),\r\n([1,2,5],[0,3,4]),\r\n([4,0,3],[5,2,1]),\r\n([1,5,2],[3,4,0]),\r\n([3,2,5],[0,4,1]),\r\n([2,4,5],[1,0,3]),\r\n([1,0,5],[3,4,2]),\r\n([3,1,5],[2,0,4]),\r\n([1,5,3],[4,2,0]),\r\n([1,3,2],[0,5,4]),\r\n([0,2,3],[4,1,5]),\r\n([5,3,1],[0,2,4]),\r\n([4,2,5],[3,1,0]),\r\n([0,4,2],[3,5,1]),\r\n([1,0,3],[5,2,4]),\r\n([3,5,2],[0,1,4]),\r\n([1,0,2],[4,3,5]),\r\n([1,2,3],[5,0,4]),\r\n([5,4,0],[3,1,2]),\r\n([3,5,4],[1,0,2]),\r\n([4,1,0],[2,5,3]),\r\n([1,0,5],[4,3,2]),\r\n([5,2,0],[4,1,3]),\r\n([2,5,4],[0,1,3]),\r\n([1,3,0],[2,5,4]),\r\n([0,4,1],[3,5,2]),\r\n([1,3,0],[4,5,2]),\r\n([0,3,5],[4,1,2]),\r\n([1,2,0],[3,5,4]),\r\n([5,2,4],[1,0,3]),\r\n([4,3,1],[5,0,2]),\r\n([2,3,1],[0,4,5]),\r\n([2,1,3],[4,5,0]),\r\n([1,0,5],[3,4,2]),\r\n([1,2,5],[4,0,3]),\r\n([2,0,3],[5,1,4]),\r\n([3,0,4],[2,1,5]),\r\n([1,2,3],[4,0,5]),\r\n([2,3,0],[1,4,5]),\r\n([4,0,3],[5,1,2]),\r\n([5,2,3],[1,4,0]),\r\n([4,3,0],[2,1,5]),\r\n([2,5,1],[0,4,3]),\r\n([2,5,0],[3,1,4]),\r\n([4,0,5],[1,3,2]),\r\n([3,2,5],[0,4,1]),\r\n([2,4,0],[1,3,5]),\r\n([3,2,0],[5,1,4]),\r\n([1,5,2],[3,4,0]),\r\n([2,0,3],[1,5,4]),\r\n([3,0,1],[4,5,2]),\r\n([5,0,1],[4,3,2]),\r\n([2,5,0],[4,3,1]),\r\n([2,1,3],[5,0,4]),\r\n([5,2,0],[1,3,4]),\r\n([5,0,4],[3,2,1]),\r\n([1,2,0],[5,3,4]),\r\n([0,5,1],[2,3,4]),\r\n([5,3,2],[4,1,0]),\r\n([2,4,1],[0,3,5]),\r\n([0,4,1],[2,3,5]),\r\n([0,4,1],[2,3,5]),\r\n([0,5,2],[4,1,3]),\r\n([2,4,0],[1,5,3]),\r\n([4,2,1],[0,5,3]),\r\n([2,3,0],[4,1,5]),\r\n([2,4,0],[3,1,5]),\r\n([4,2,3],[5,0,1]),\r\n([0,3,4],[5,2,1]),\r\n([3,1,0],[2,5,4]),\r\n([5,0,1],[2,4,3]),\r\n([0,1,5],[3,2,4]),\r\n([3,4,0],[5,2,1]),\r\n([3,2,1],[5,0,4]),\r\n([2,1,4],[5,3,0]),\r\n([2,1,4],[3,5,0]),\r\n([3,4,1],[5,2,0]),\r\n([1,3,5],[2,0,4]),\r\n([3,5,1],[0,4,2]),\r\n([1,5,2],[3,0,4]),\r\n([3,0,4],[2,5,1]),\r\n([3,5,4],[2,1,0]),\r\n([2,3,5],[0,1,4]),\r\n([0,1,5],[2,3,4]),\r\n([5,0,2],[3,4,1]),\r\n([0,4,2],[1,5,3]),\r\n([2,5,4],[3,0,1]),\r\n([4,1,2],[5,0,3]),\r\n([0,4,5],[2,3,1]),\r\n([1,3,4],[5,2,0]),\r\n([3,4,1],[5,0,2]),\r\n([1,0,5],[2,3,4]),\r\n([1,5,3],[2,4,0]),\r\n([2,3,1],[0,5,4]),\r\n([0,4,5],[3,2,1]),\r\n([4,3,0],[2,1,5]),\r\n([3,4,5],[2,0,1]),\r\n([5,1,4],[2,0,3]),\r\n([0,5,3],[2,1,4]),\r\n([4,1,3],[5,2,0]),\r\n([3,5,2],[4,0,1]),\r\n([0,3,4],[2,1,5]),\r\n([0,4,2],[1,3,5]),\r\n([0,2,1],[5,3,4]),\r\n([5,1,0],[2,3,4]),\r\n([2,5,0],[1,4,3]),\r\n([5,1,3],[0,2,4]),\r\n([3,5,0],[4,2,1]),\r\n([2,4,1],[5,3,0]),\r\n([1,2,0],[4,3,5]),\r\n([5,4,2],[3,1,0]),\r\n([2,3,5],[0,4,1]),\r\n([4,5,0],[3,2,1]),\r\n([0,4,5],[2,1,3]),\r\n([1,4,5],[0,2,3]),\r\n([2,3,1],[5,0,4]),\r\n([1,3,5],[0,2,4]),\r\n([4,0,5],[3,1,2]),\r\n([3,1,5],[0,4,2]),\r\n([4,1,2],[5,0,3]),\r\n([4,0,2],[5,3,1]),\r\n([0,2,3],[1,5,4]),\r\n([1,0,2],[3,5,4]),\r\n([5,4,3],[0,1,2]),\r\n([0,4,3],[1,5,2]),\r\n([1,5,2],[0,3,4]),\r\n([5,2,4],[1,3,0]),\r\n([0,3,5],[4,1,2]),\r\n([4,2,5],[0,3,1]),\r\n([4,3,5],[1,2,0]),\r\n([0,5,1],[4,3,2]),\r\n([4,2,0],[1,5,3]),\r\n([4,3,2],[5,0,1]),\r\n([2,3,1],[5,4,0]),\r\n([5,4,1],[0,2,3]),\r\n([2,3,4],[1,5,0]),\r\n([5,1,4],[3,0,2]),\r\n([5,2,0],[4,1,3]),\r\n([5,1,3],[2,0,4]),\r\n([5,1,4],[3,2,0]),\r\n([5,3,4],[1,0,2]),\r\n([3,1,0],[5,4,2]),\r\n([1,4,2],[3,0,5]),\r\n([1,5,0],[4,3,2]),\r\n([5,4,1],[0,3,2]),\r\n([2,0,3],[1,5,4]),\r\n([0,1,3],[4,2,5]),\r\n([4,5,0],[3,2,1]),\r\n([4,0,2],[1,5,3]),\r\n([1,0,4],[2,5,3]),\r\n([0,4,2],[5,3,1]),\r\n([5,3,4],[2,1,0]),\r\n([4,5,2],[3,0,1]),\r\n([2,4,0],[3,1,5]),\r\n([4,5,2],[1,3,0]),\r\n([1,4,2],[0,5,3]),\r\n([0,5,1],[4,3,2]),\r\n([0,4,3],[2,1,5]),\r\n([1,5,0],[3,2,4]),\r\n([0,2,3],[5,1,4]),\r\n([0,4,5],[1,3,2]),\r\n([0,4,3],[1,2,5]),\r\n([1,3,5],[2,4,0]),\r\n([0,2,1],[4,3,5]),\r\n([0,4,3],[2,5,1]),\r\n([3,4,0],[2,1,5]),\r\n([2,0,3],[1,5,4]),\r\n([0,3,4],[1,2,5]),\r\n([2,4,1],[5,0,3]),\r\n([5,3,1],[2,0,4]),\r\n([3,4,0],[5,2,1]),\r\n([2,0,1],[4,5,3]),\r\n([5,2,3],[1,4,0]),\r\n([3,4,2],[0,5,1]),\r\n([0,2,4],[5,3,1]),\r\n([2,0,4],[3,5,1]),\r\n([4,3,0],[2,5,1]),\r\n([3,5,1],[4,0,2]),\r\n([5,3,4],[0,1,2]),\r\n([0,1,3],[2,4,5]),\r\n([4,1,0],[5,2,3]),\r\n([3,2,4],[0,5,1]),\r\n([5,3,0],[2,4,1]),\r\n([3,0,5],[2,4,1]),\r\n([4,2,1],[5,3,0]),\r\n([2,4,1],[3,5,0]),\r\n([3,4,0],[1,2,5]),\r\n([3,2,4],[0,5,1]),\r\n([0,1,3],[2,5,4]),\r\n([1,5,2],[3,4,0]),\r\n([5,4,3],[1,2,0]),\r\n([5,3,4],[0,2,1]),\r\n([3,4,5],[0,2,1]),\r\n([4,5,0],[2,1,3]),\r\n([1,3,4],[2,5,0]),\r\n([0,1,4],[5,3,2]),\r\n([2,4,1],[3,0,5]),\r\n([2,0,1],[3,5,4]),\r\n([5,3,2],[4,1,0]),\r\n([3,0,2],[1,4,5]),\r\n([5,0,3],[2,1,4]),\r\n([5,1,3],[0,4,2]),\r\n([3,0,4],[1,2,5]),\r\n([3,2,1],[5,0,4]),\r\n([3,2,5],[0,1,4]),\r\n([3,4,2],[0,5,1]),\r\n([4,2,5],[1,3,0]),\r\n([4,3,0],[2,1,5]),\r\n([0,3,5],[4,1,2]),\r\n([1,0,3],[4,5,2]),\r\n([5,3,4],[1,2,0]),\r\n([3,5,4],[0,1,2]),\r\n([2,4,5],[0,3,1]),\r\n([0,2,3],[5,4,1]),\r\n([5,4,3],[1,0,2]),\r\n([0,3,5],[4,2,1]),\r\n([5,1,4],[0,2,3]),\r\n([0,5,3],[2,1,4]),\r\n([0,2,1],[5,4,3]),\r\n([4,2,3],[1,0,5]),\r\n([0,1,4],[2,5,3]),\r\n([5,1,0],[2,3,4]),\r\n([3,1,2],[0,5,4]),\r\n([0,5,1],[3,4,2]),\r\n([1,4,3],[5,0,2]),\r\n([4,1,3],[2,0,5]),\r\n([5,4,0],[2,3,1]),\r\n([5,1,2],[3,0,4]),\r\n([1,2,3],[0,5,4]),\r\n([2,5,3],[0,1,4]),\r\n([1,2,0],[5,4,3]),\r\n([3,2,4],[0,1,5]),\r\n([4,2,1],[5,0,3]),\r\n([2,1,5],[0,3,4]),\r\n([0,2,3],[5,4,1]),\r\n([4,0,1],[2,5,3]),\r\n([0,2,5],[3,1,4]),\r\n([2,0,1],[4,5,3]),\r\n([0,4,3],[2,5,1]),\r\n([1,4,2],[5,3,0]),\r\n([5,3,0],[2,1,4]),\r\n([5,0,3],[2,1,4]),\r\n([5,4,0],[1,2,3]),\r\n([3,4,5],[2,0,1]),\r\n([0,3,4],[1,5,2]),\r\n([5,1,4],[3,2,0]),\r\n([3,4,0],[2,5,1]),\r\n([3,0,2],[4,1,5]),\r\n([5,2,3],[0,1,4]),\r\n([2,0,4],[3,5,1]),\r\n([2,0,4],[5,3,1]),\r\n([5,4,2],[3,0,1]),\r\n([2,5,0],[4,1,3]),\r\n([1,0,4],[3,5,2]),\r\n([4,0,1],[2,3,5]),\r\n([1,5,4],[3,2,0]),\r\n([1,2,3],[4,5,0]),\r\n([1,4,2],[5,0,3]),\r\n([1,4,3],[5,0,2]),\r\n([4,0,1],[3,2,5]),\r\n([3,0,5],[1,2,4]),\r\n([3,2,4],[5,1,0]),\r\n([4,0,1],[2,5,3]),\r\n([5,2,3],[4,0,1]),\r\n([1,0,5],[2,4,3]),\r\n([2,1,0],[3,5,4]),\r\n([1,5,0],[4,2,3]),\r\n([0,4,2],[3,1,5]),\r\n([2,3,4],[5,0,1]),\r\n([2,4,3],[5,1,0]),\r\n([1,2,0],[5,4,3]),\r\n([4,3,0],[5,2,1]),\r\n([4,5,3],[0,1,2]),\r\n([4,3,5],[2,0,1]),\r\n([3,1,2],[4,0,5]),\r\n([1,2,0],[4,5,3]),\r\n([4,1,0],[3,5,2]),\r\n([5,3,2],[0,1,4]),\r\n([4,5,3],[1,2,0]),\r\n([4,0,1],[5,3,2]),\r\n([3,5,4],[0,2,1]),\r\n([2,4,5],[0,1,3]),\r\n([4,1,5],[3,2,0]),\r\n([2,1,0],[3,4,5]),\r\n([5,3,1],[0,2,4]),\r\n([0,2,5],[3,1,4]),\r\n([3,2,4],[0,5,1]),\r\n([3,0,4],[1,2,5]),\r\n([0,1,5],[4,2,3]),\r\n([5,0,4],[3,2,1]),\r\n([5,3,2],[0,1,4]),\r\n([5,0,4],[2,3,1]),\r\n([1,4,0],[2,3,5]),\r\n([4,1,0],[2,3,5]),\r\n([1,4,2],[0,3,5]),\r\n([5,2,1],[3,0,4]),\r\n([4,1,0],[2,3,5]),\r\n([5,0,1],[4,3,2]),\r\n([2,4,5],[1,0,3]),\r\n([2,3,0],[5,4,1]),\r\n([1,0,4],[3,5,2]),\r\n([4,2,5],[0,3,1]),\r\n([4,0,1],[2,5,3]),\r\n([4,0,3],[2,5,1]),\r\n([5,0,4],[3,1,2]),\r\n([3,4,0],[1,5,2]),\r\n([3,4,2],[0,1,5]),\r\n([4,2,5],[0,1,3]),\r\n([5,3,1],[0,2,4]),\r\n([4,3,2],[1,0,5]),\r\n([0,5,1],[2,4,3]),\r\n([5,1,0],[3,4,2]),\r\n([1,3,2],[4,5,0]),\r\n([4,3,0],[5,2,1]),\r\n([0,1,3],[5,2,4]),\r\n([0,3,4],[2,5,1]),\r\n([3,4,5],[0,1,2]),\r\n([4,0,5],[3,2,1]),\r\n([1,0,2],[5,4,3]),\r\n([1,4,3],[5,2,0]),\r\n([5,0,1],[4,2,3]),\r\n([1,4,3],[0,2,5]),\r\n([3,2,4],[1,5,0]),\r\n([0,2,3],[4,1,5]),\r\n([5,2,1],[4,0,3]),\r\n([1,0,2],[5,4,3]),\r\n([1,3,0],[5,4,2]),\r\n([1,0,5],[2,3,4]),\r\n([0,2,5],[1,4,3]),\r\n([0,1,3],[4,2,5]),\r\n([3,2,4],[1,0,5]),\r\n([2,1,0],[4,3,5]),\r\n([2,1,4],[3,5,0]),\r\n([1,0,4],[2,3,5]),\r\n([3,2,1],[5,4,0]),\r\n([1,4,5],[2,3,0]),\r\n([1,5,4],[2,0,3]),\r\n([4,3,5],[2,0,1]),\r\n([4,3,5],[0,1,2]),\r\n([1,3,4],[2,5,0]),\r\n([3,0,2],[4,1,5]),\r\n([5,0,4],[2,1,3]),\r\n([0,3,2],[5,4,1]),\r\n([5,4,2],[3,1,0]),\r\n([4,3,2],[0,5,1]),\r\n([1,0,3],[5,4,2]),\r\n([0,2,3],[1,4,5]),\r\n([3,0,1],[5,4,2]),\r\n([3,4,2],[0,1,5]),\r\n([2,0,5],[1,4,3]),\r\n([3,2,5],[4,0,1]),\r\n([1,2,4],[5,3,0]),\r\n([4,0,1],[2,5,3]),\r\n([5,3,0],[4,2,1]),\r\n([0,4,2],[3,5,1]),\r\n([2,5,3],[1,4,0])]\r\n for x in perms:\r\n first = x[0]\r\n second = x[1]\r\n if sum([self.scores[y] for y in first]) == sum([self.scores[y] for y in second]):\r\n result = True\r\n break\r\n if result:\r\n self.result = \"YES\"\r\n else:\r\n self.result = \"NO\"\r\n\r\n def get_result(self):\r\n return self.result\r\n\r\n\r\nif __name__ == \"__main__\":\r\n Solution = CodeforcesTask890ASolution()\r\n Solution.read_input()\r\n Solution.process_task()\r\n print(Solution.get_result())\r\n", "import sys\na = [int(i) for i in input().split()]\ns=sum(a)\nif s%2==0:\n\tfor i1 in range(2):\n\t\tfor i2 in range(2):\n\t\t\tfor i3 in range(2):\n\t\t\t\tfor i4 in range(2):\n\t\t\t\t\tfor i5 in range(2):\n\t\t\t\t\t\tfor i6 in range(2):\n\t\t\t\t\t\t\tif i1+i2+i3+i4+i5+i6==3:\n\t\t\t\t\t\t\t\tif i1*a[0]+i2*a[1]+i3*a[2]+i4*a[3]+i5*a[4]+i6*a[5]==s//2:\n\t\t\t\t\t\t\t\t\tprint('YES')\n\t\t\t\t\t\t\t\t\tsys.exit()\n\nprint('NO')", "num=list(map(int,input().split()))\r\ntotal=0\r\ntotal=sum(num)\r\n#print(total)\r\n#if total%2!=0:\r\n# print(\"NO\")\r\nflag=0\r\nfor i in range(0,4):\r\n for j in range(i+1,5):\r\n for k in range(j+1,6):\r\n if(num[i]+num[j]+num[k]==total/2):\r\n flag=1\r\n break\r\nif(flag):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = [int(i) for i in input().split()]\r\np = ['012','013','014','015','123','124','125','234','235','345','023','024','025','034','035','045','134','135','145','245']\r\ntry:\r\n for i in p:\r\n if sum([n[int(j)] for j in i]) == sum(n)/2:\r\n print('YES')\r\n 3/0\r\n print('NO')\r\nexcept ZeroDivisionError:\r\n pass", "a=list(map(int,input().split()))\r\nfor i in range(6):\r\n for j in range(i):\r\n for k in range(j):\r\n l=a[i]+a[j]+a[k]\r\n r=sum([a[_]*(_!=i and _!=j and _!=k) for _ in range(6)])\r\n if l==r:\r\n print('YES')\r\n exit()\r\nprint('NO')", "from itertools import combinations\r\nl=list(map(int,input().split()))\r\ns=sum(l);f=0\r\nif s%2!=0:\r\n print(\"NO\")\r\n f=1\r\nelse:\r\n for i in combinations(l, 3):\r\n if sum(i)==s//2:\r\n print(\"YES\")\r\n f=1\r\n break\r\nif f==0:print(\"NO\")", "a=*map(int,input().split()),\r\ns=sum(a)\r\nprint('YNEOS'[s%2 or all(a[i]+a[j]+a[k]!=s//2 for i in range(6) for j in range(i+1,6) for k in range(j+1,6))::2])", "from itertools import permutations\r\ndef isRight(arr):\r\n\tn = len(arr)\r\n\tx = y = 0\r\n\tfor i in range(n//2):\r\n\t\tx += arr[i]\r\n\t\ty += arr[n-i-1]\r\n\tif(x == y):\r\n\t\treturn True\r\n\treturn False\r\narr = list(map(int, input().split()))\r\nf = 1\r\npermutation = permutations(arr)\r\nfor perm in list(permutation):\r\n\tif(isRight(perm)):\r\n\t\tprint(\"YES\")\r\n\t\tf = 0\r\n\t\tbreak\r\nif(f):\r\n\tprint(\"NO\")", "import itertools\r\na = list(map(int, input().split()))\r\nR = [0, 1, 2, 3, 4, 5]\r\nflag = False\r\nfor i, j, k in itertools.combinations(R, 3):\r\n sum1 = a[i] + a[j] + a[k]\r\n sum2 = 0\r\n for l in range(6):\r\n if l != i and l != j and l != k:\r\n sum2 += a[l]\r\n if sum1 == sum2:\r\n flag = True\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "a = [int(x) for x in input().split()]\nif sum(a) % 2 == 1:\n print('NO')\n exit(0)\nb = sum(a) // 2\nfor i in range(4):\n for j in range(i + 1, 5):\n for k in range(j + 1, 6):\n if a[i] + a[j] + a[k] == b:\n print('YES')\n exit(0)\nprint('NO')\n", "data = list(map(int, input().split()))\r\n\r\nflag = False\r\nfor i in range(len(data) - 2):\r\n for j in range(i + 1, len(data) - 1):\r\n for k in range(j + 1, len(data)):\r\n if data[i] + data[j] + data[k] == sum(data) / 2:\r\n flag = True\r\n break\r\n\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "\r\na = list(map(int, input().split()))\r\ns = sum(a) / 2\r\nflag = False\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if a[i] + a[j] + a[k] == s:\r\n print('YES')\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n if flag:\r\n break\r\nif not flag:\r\n print('NO')\r\n", "take1, take2, take3, take4, take5, take6 = input ().split()\r\ntake1 = int(take1)\r\ntake2 = int(take2)\r\ntake3 = int(take3)\r\ntake4 = int(take4)\r\ntake5 = int(take5)\r\ntake6 = int(take6)\r\nsum = take1+take2+take3+take4+take5+take6\r\nif sum%2 != 0:\r\n print(\"NO\")\r\nelse:\r\n if take1+take2+take3 == take4+take5+take6:\r\n print(\"YES\")\r\n elif take1+take2+take4 == take3+take5+take6:\r\n print(\"YES\")\r\n elif take1+take2+take5 == take3+take4+take6:\r\n print(\"YES\")\r\n elif take1+take2+take6 == take3+take4+take5:\r\n print(\"YES\")\r\n elif take1+take4+take3 == take2+take5+take6:\r\n print(\"YES\")\r\n elif take1+take5+take3 == take4+take2+take6:\r\n print(\"YES\")\r\n elif take1+take6+take3 == take4+take2+take5:\r\n print(\"YES\")\r\n elif take1+take5+take4 == take3+take2+take6:\r\n print(\"YES\")\r\n elif take1+take4+take6 == take3+take2+take5:\r\n print(\"YES\")\r\n elif take1+take5+take6 == take3+take2+take4:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "import itertools\r\na=list(map(int,input().split()))\r\ns=sum(a)\r\nans = 'NO'\r\nfor i in itertools.combinations(a,3):\r\n if sum(i)*2==s:\r\n ans = 'YES'\r\n break\r\nprint(ans)\r\n", "b=list(map(int,input().split()))\r\nfor i in range(1<<6):\r\n s=s1=n=k=0\r\n for j in range(6):\r\n if i&(1<<j):s+=b[j];n+=1\r\n else:s1+=b[j];k+=1\r\n if s==s1 and n==k:exit(print(\"YES\"))\r\nprint(\"NO\")", "a = [int(x) for x in input().split()]\r\ns = sum(a)\r\nf = False\r\nfor i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n if i == j or j == k or i == k:\r\n continue\r\n f |= (a[i] + a[j] + a[k] == s - (a[i] + a[j] + a[k]))\r\nif f:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "a,b,c,d,e,f = input().split()\r\na = int(a)\r\nb = int(b)\r\nc = int(c)\r\nd = int(d)\r\ne = int(e)\r\nf = int(f)\r\ns1 = a + b\r\ns2 = a + c\r\ns3 = a + d\r\ns4 = a + e\r\ns5 = a + f\r\ns6 = b + c\r\ns7 = b + d\r\ns8 = b + e\r\ns9 = b + f\r\ns10 = c + d\r\ns11 = c + e\r\ns12 = c + f\r\ns13 = d + e\r\ns14 = d + f\r\ns15 = e + f\r\n\r\nif a+s6 == s13 + f:\r\n print(\"YES\")\r\nelif a+s7 == s11 + f:\r\n print(\"YES\")\r\nelif a+s8 == s10 + f:\r\n print(\"YES\")\r\nelif a+s9 == s10 + e:\r\n print(\"YES\")\r\nelif a+s10 == s8 + f:\r\n print(\"YES\")\r\nelif a+s11 == s7 + f:\r\n print(\"YES\")\r\nelif a+s12 == s7 + e:\r\n print(\"YES\")\r\nelif a+s13 == s6 + f:\r\n print(\"YES\")\r\nelif a+s14 == s6 + e:\r\n print(\"YES\")\r\nelif a+s15 == s6 + d:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "import sys\r\nfrom bisect import bisect, insort\r\nfrom collections import Counter, OrderedDict, defaultdict, deque\r\nfrom functools import cache, lru_cache, reduce\r\nfrom heapq import heapify, heappop, heappush, nlargest\r\nfrom itertools import accumulate, combinations, permutations, product, repeat\r\nfrom math import ceil, floor, gcd, hypot, lcm, log, sqrt\r\n\r\nsys.setrecursionlimit(10**5)\r\ndef input(): return sys.stdin.readline().strip('\\r\\n')\r\ndef pyint(): return int(input())\r\ndef pyline(): return map(int, input().split())\r\ndef pylist(): return list(map(int, input().split()))\r\n\r\n\r\narray = pylist()\r\nperm = list(permutations(array))\r\n\r\nfor p in perm:\r\n if sum(p[0:3]) == sum(p[3::]):\r\n print(\"YES\")\r\n break\r\nelse:\r\n print(\"NO\")\r\n", "import itertools\r\na = list(map(int, input().split()))\r\np = itertools.permutations(a)\r\n\r\nexist = False\r\n\r\nfor k in p:\r\n\tif sum(k[:3]) == sum(k[3:]):\r\n\t\texist = True\r\n\t\tbreak\r\n\r\nif exist:\r\n\tprint('YES')\r\nelse:\r\n\tprint('NO')\r\n", "from itertools import *\r\na=[int(x) for x in input().split()]\r\ns1=0\r\ns2=0\r\nflag=0\r\nfor o in permutations(a):\r\n s1=o[0]+o[1]+o[2]\r\n s2=o[3]+o[4]+o[5]\r\n \r\n if(s1==s2):\r\n \r\n flag=1\r\n break\r\n \r\nif (flag==1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "a=list(map(int,input().split()))\r\ns=sum(a)\r\nfor i in range(6):\r\n for j in range(i):\r\n for k in range(j):\r\n d=a[i]+a[j]+a[k]\r\n if(d==s-d):\r\n print(\"YES\")\r\n exit()\r\nprint(\"NO\") \r\n ", "a=list(map(int,input().split()))\r\na.sort()\r\nb=sum(a)\r\nans=0\r\nfor i in range(6):\r\n for x in range(6):\r\n for z in range(6):\r\n if 2*(a[i]+a[x]+a[z])==b and i!=x and i!=z and x!=z:\r\n ans=1\r\n break\r\nif ans==0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n \r\n", "l = input().split()\r\nl = [int(i) for i in l]\r\ntotal = sum(l)\r\n#print(total)\r\n#print(\" \")\r\nc=0\r\nif(total%2==1):\r\n\tprint(\"NO\")\r\nelse:\r\n\tp=len(l)\r\n\tfor i in range(p):\r\n\t\tfor j in range(p):\r\n\t\t\tfor k in range(p):\r\n\t\t\t\tif(i!=j and i!=k and j!=k):\r\n\t\t\t\t\tt = l[i] + l[j] +l[k]\r\n\t\t\t\t\t#print(t)\r\n\t\t\t\t\tif(total/2 == t):\r\n\t\t\t\t\t\tc=1\r\n\t\t\t\t\t\tbreak\r\n\t\t\tif(c==1):\r\n\t\t\t\tbreak\r\n\t\tif(c==1):\r\n\t\t\tbreak\r\n\tif(c==1):\r\n\t\tprint(\"YES\") \r\n\telse:\r\n\t\tprint(\"NO\")\t\t ", "from itertools import permutations\r\n\r\n#t = int(input())\r\nt = 1\r\n\r\nwhile t > 0:\r\n #print(t)\r\n #n = int(input())\r\n arr = [int(x) for x in input().split()]\r\n\r\n ok = False\r\n for l in [list(x) for x in list(permutations(arr, 6))]:\r\n if sum(l[:3]) == sum(l[3:]):\r\n print(\"YES\")\r\n ok = True\r\n break\r\n if not ok:\r\n print(\"NO\")\r\n #print(f'{l[:3]} - {l[3:]}')\r\n\r\n t -= 1", "a,b,c,d,e,f=map(int,input().split())\r\nl = a+b+c+d+e+f\r\nif a+b+c == l/2 or a+b+d == l/2 or a+b+e == l/2 or a+b+f == l/2 or a+c+d == l/2 or a+c+e==l/2 or a+c+f == l/2 or a+d+e == l/2 or a+d+f == l/2 or a+e+f == l/2 or b+c+d == l/2 or b+c+e == l/2 or b+c+f == l/2 or b+d+e == l/2 or b+d+f == l/2 or b+e+f == l/2 or c+d+e == l/2 or c+d+f == l/2 or c+e+f == l/2 or d+e+f == l/2 :\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n ", "from itertools import permutations\r\narr=list(map(int, input().split()))\r\nisOk = True\r\nfor x in arr:\r\n if 2*x>sum(arr): \r\n isOk=False\r\n break\r\nif isOk:\r\n isOk = False\r\n p = set(permutations(arr,6))\r\n for x in p:\r\n if sum(x[:3])==sum(x[3:]):\r\n isOk=True\r\n break\r\nif isOk: print('YES')\r\nelse: print('NO')", "A = list(map(int, input().split()))\na = sum(A)\nimport itertools\nfor c in itertools.combinations(A, 3):\n s = sum(c)\n if a-s == s:\n print('YES')\n exit()\nelse:\n print('NO')\n", "a = [i for i in map(int, input().split())]\r\ntotal = sum(a)\r\nans = False\r\nfor i in range(6):\r\n for j in range(i + 1, 6):\r\n for k in range(j + 1, 6):\r\n if (a[i] + a[j] + a[k]) * 2 == total:\r\n ans = True\r\nprint(\"YES\" if ans else \"NO\")\r\n", "from itertools import permutations as pm\r\n\r\narr=list(map(int,input().split()))\r\nsuma=sum(arr)\r\n\r\nans='NO'\r\nfor x in pm(arr, r=3):\r\n if 2*sum(x)==suma:\r\n ans=\"YES\"\r\n break\r\nprint(ans)\r\n", "a = str(input())\nn = a.split()\nsum=0\nsim=0\nfor i in range (len(n)):\n n[i] = int(n[i])\n sum = sum + n[i]\n\ngrupo1 = n[0]+n[1]+n[2]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[1]+n[3]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[1]+n[4]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[1]+n[5]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[2]+n[3]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[2]+n[4]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[2]+n[5]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[3]+n[4]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[3]+n[5]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\ngrupo1 = n[0]+n[4]+n[5]\ngrupo2 =sum-grupo1\nif(grupo1 == grupo2):\n sim=1\n\n\nif(sim == 1):\n print(\"YES\")\nelse:\n print(\"NO\")\n \t \t \t\t \t\t\t \t \t\t \t \t \t \t\t", "a = list(map(int,input().split()))\r\nx = 0\r\nfor i in range(6):\r\n\tfor j in range(6):\r\n\t\tfor k in range(6):\r\n\t\t\tif i!=j!=k!=i:\r\n\t\t\t\tx = a[i]+a[j]+a[k]\r\n\t\t\t\ty = 0\r\n\t\t\t\tfor z in range(6):\r\n\t\t\t\t\tif z!=i and z!=j and z!=k:\r\n\t\t\t\t\t\ty += a[z]\r\n\t\t\t\tif x==y:\r\n\t\t\t\t\tprint(\"YES\")\r\n\t\t\t\t\texit()\r\nelse:\r\n\tprint(\"NO\")" ]

[ "n = input()\n\ns = []\n\na = 0\n\nfor i in map(int, input().split()):\n\n while len(s) > 1 and min(s[-2], i)>=s[-1]:\n\n a += min(i, s[-2])\n\n del(s[-1])\n\n s.append(i)\n\ns.sort()\n\nprint(a + sum(s[0: -2]))\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\ncards = list(map(int,input().split()))\r\n\r\nscore = 0\r\npreIndexes = []\r\nnextIndexes = []\r\nisChosen = [0]*n\r\nchosens = []\r\n\r\n#first card score initialize\r\nnextIndexes.append(1)\r\npreIndexes.append(-1)\r\n\r\nfor i in range(1, n-1):\r\n if cards[i] <= cards[i-1] and cards[i] <= cards[i+1]:\r\n chosens.append((-cards[i], i))\r\n isChosen[i] = 1\r\n preIndexes.append(i-1)\r\n nextIndexes.append(i+1)\r\n\r\n#last card score initialize\r\npreIndexes.append(n-2)\r\nnextIndexes.append(n)\r\n\r\nwhile len(chosens) != 0:\r\n chosen = chosens.pop()\r\n preChosen = preIndexes[chosen[1]]\r\n nextChosen = nextIndexes[chosen[1]]\r\n\r\n #handle score\r\n score += min(cards[preChosen], cards[nextChosen])\r\n\r\n #handle deleting\r\n nextIndexes[preChosen] = nextChosen\r\n preIndexes[nextChosen] = preChosen\r\n\r\n #check if preChosen can be chosen\r\n if preChosen != 0 and preIndexes[preChosen] != -1 and nextIndexes[preChosen] != n:\r\n if cards[preChosen] <= cards[preIndexes[preChosen]] and cards[preChosen] <= cards[nextIndexes[preChosen]]:\r\n if isChosen[preChosen] == 0:\r\n isChosen[preChosen] = 1\r\n chosens.append((-cards[preChosen], preChosen))\r\n #check if nextChosen can be chosen\r\n if nextChosen != n-1 and preIndexes[nextChosen] != -1 and nextIndexes[nextChosen] != n:\r\n if cards[nextChosen] <= cards[preIndexes[nextChosen]] and cards[nextChosen] <= cards[nextIndexes[nextChosen]]:\r\n if isChosen[nextChosen] == 0:\r\n isChosen[nextChosen] = 1\r\n chosens.append((-cards[nextChosen], nextChosen))\r\n\r\ntempNode = nextIndexes[0]\r\nwhile tempNode != n and tempNode != n-1:\r\n score += min(cards[preIndexes[tempNode]], cards[nextIndexes[tempNode]])\r\n tempNode = nextIndexes[tempNode]\r\n\r\nprint(score)\r\n", "\r\nMAXN = 5 * 10**5 + 100\r\na = []\r\nans = 0\r\n\r\nn = int(input())\r\n\r\na = list( map ( int, input().split() ) )\r\na.append(0)\r\n\r\na = [0] + a\r\nn = n + 2 \r\narr = []\r\narr.append( a[0] )\r\narr.append( a[1] ) \r\n\r\n\r\ni = 2\r\nwhile i < n :\r\n\tln = a[i] \r\n\tl1 = arr[-1]\r\n\tl0 = arr[-2]\r\n\twhile l1 <= l0 and l1 <= ln :\r\n\t\tans = ans + min ( l0 , ln )\r\n\t\tarr.pop()\r\n\t\tl1 = arr[-1]\r\n\t\tl0 = arr[-2]\r\n\tarr.append(ln)\r\n\ti = i + 1\r\nfor i in range ( 1 , len(arr) - 1 ) :\r\n\tans += min ( arr[i - 1] , arr[i + 1] ) \r\n\r\nprint (ans)\r\n\r\n\r\n\r\n\r\n" ]

[ "n=int(input())\r\nd={}\r\nfor i in range(n) :\r\n a,*b=input().split()\r\n d[a]=d.get(a,[])+b[1:]\r\nprint(len(d))\r\nfor x in d :\r\n L=list(set(d[x]))\r\n l=[]\r\n for i in range(len(L)) :\r\n flaf=True\r\n for j in range(len(L)) :\r\n if i!=j and L[j].endswith(L[i]) :\r\n flaf=False\r\n if flaf :\r\n l.append(L[i])\r\n print(x+\" \"+str(len(l))+\" \"+\" \".join(l))\r\n \r\n \r\n\r\n\r\n \r\n", "n = int(input())\nbook = {}\nfor _ in range(n):\n toks = input().strip().split()\n name = toks[0]\n numbers = toks[2:]\n book.setdefault(name,[])\n book[name].extend(numbers)\nprint(len(book))\nfor k, v in book.items():\n v.sort(key=lambda x: len(x))\n new_v = []\n for i in range(len(v)):\n if any(v[j].endswith(v[i]) for j in range(i+1,len(v))):\n continue\n new_v.append(v[i])\n v = new_v\n print(k,len(v),*v)\n", "def print_arr(arr):\r\n\tfor i in arr:\r\n\t\tprint(i, \"\", end=\"\")\r\n\tprint()\t\r\n\r\n\r\nn = int(input())\r\nd = {}\r\nfor _ in range(n):\r\n\tname, num, *numbers = input().split()\r\n\tif name in d:\r\n\t\ts = d[name]\r\n\telse:\r\n\t\ts = []\t\r\n\tfor nm in numbers:\r\n\t\tfor i in s:\r\n\t\t\tif i.endswith(nm):\r\n\t\t\t\tstate=1\r\n\t\t\t\tbreak\r\n\t\t\tif nm.endswith(i):\r\n\t\t\t\ts.remove(i)\r\n\t\telse:\r\n\t\t\ts.append(nm)\r\n\td[name] = s\r\n\t\r\nprint(len(d))\t\r\nfor name in d:\r\n\tprint(name, len(d[name]), end=\" \")\r\n\tprint_arr(d[name])\t\t\t\t\t\t\t", "from collections import defaultdict\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nd = defaultdict(lambda : set())\r\nfor _ in range(n):\r\n x = list(input().rstrip().decode().split())\r\n u = x[0]\r\n for i in x[2:]:\r\n d[u].add(i)\r\nans = []\r\nfor i in d.keys():\r\n x = list(d[i])\r\n y = []\r\n for u in x:\r\n c = 0\r\n for v in x:\r\n if len(u) > len(v):\r\n continue\r\n f = 1\r\n for j in range(1, min(len(u), len(v)) + 1):\r\n if not u[-j] == v[-j]:\r\n f = 0\r\n break\r\n if f:\r\n c += 1\r\n if c == 1:\r\n y.append(\"\".join(u))\r\n ans0 = [i, str(len(y))] + y\r\n ans.append(\" \".join(ans0))\r\nm = len(ans)\r\nprint(m)\r\nsys.stdout.write(\"\\n\".join(ans))", "n = int( input() )\r\nL = []\r\nm = {}\r\nnames = []\r\nfor i in range( n ):\r\n a = input().split()\r\n name = a[0]\r\n names.append( a[0] )\r\n a = a[2:]\r\n if name not in m:\r\n m[ name ] = []\r\n for j in a:\r\n m[ name ].append( j )\r\nnames = set( names )\r\nfor i in names:\r\n a = list( set(m[i] ) ) \r\n good = [True] * len(a)\r\n for j in range( len(a) ):\r\n for k in range( len(a) ):\r\n if j != k:\r\n if a[k].endswith( a[j] ):\r\n good[j] = False\r\n break\r\n ok = False\r\n cnt = 0\r\n for j in range( len(a) ):\r\n if good[j] == True:\r\n cnt += 1\r\n ok = True\r\n if ok == False:\r\n continue\r\n out = i + \" \" + str(cnt)\r\n for j in range( len(a) ):\r\n if good[j]:\r\n out += \" \" + a[j]\r\n L.append( out )\r\nprint( len(L) )\r\nfor i in L:\r\n print( i )\r\nexit(0)", "from math import*\r\nimport copy\r\n\r\n\r\n\r\ndef func(arr):\r\n\tarr=list(set(arr))\r\n\tarr=sorted(arr,key=len)\r\n#\tprint(arr)\r\n\tc=len(arr)\r\n\tfor i in range(c-1):\r\n\t\tfor j in range(i+1,c):\r\n#\t\t\tprint(arr[i],arr[j])\r\n\t\t\tistrue=True\r\n\t\t\tfor k in range(0,len(arr[i])):\r\n\t\t\t\tif arr[i][len(arr[i])-1-k]!=arr[j][len(arr[j])-1-k]:\r\n\t\t\t\t\tistrue=False\r\n\t\t\t\t\tbreak\r\n\t\t\tif istrue==True:\r\n\t\t\t\tarr[i]=-1\r\n#\t\t\t\tprint(\"a\")\r\n\t\t\t\tbreak\r\n\tarr=list(filter(lambda x:x!=-1,arr))\r\n\treturn arr\r\n\r\n\r\nn=int(input())\r\nd=dict()\r\nname=[]\r\nfor _ in range(n):\r\n\tarr=list(map(str,input().split()))\r\n\tif arr[0] not in name:\r\n\t\td[arr[0]]=arr[2:]\r\n\t\tname.append(arr[0])\r\n\telse:\r\n\t\td[arr[0]]+=arr[2:]\r\n#print(d)\r\n#print(name)\r\nfor i in range(len(name)):\r\n#\td[name[i]]=sorted(d[name[i]],key=len)\r\n\tarr=copy.deepcopy(d[name[i]])\r\n\td[name[i]]=func(arr)\r\n#\tprint(d[name[i]])\r\n#print(d[name])\r\nprint(len(name))\r\nfor i in range(len(name)):\r\n\tprint(name[i],len(d[name[i]]),end=' ')\r\n\tfor x in d[name[i]]:\r\n\t\tprint(x,end=' ')\r\n\tprint()", "def solve(a):\r\n res = []\r\n a.sort(key=lambda x: len(x))\r\n n = len(a)\r\n for i in range(n):\r\n fl = True\r\n for j in range(i + 1, n):\r\n if a[j][-len(a[i]):] == a[i]:\r\n fl = False\r\n break\r\n if fl:\r\n res.append(a[i])\r\n print(len(res), *res)\r\n\r\n\r\nn = int(input())\r\nd = dict()\r\n\r\nfor i in range(n):\r\n tmp = input().split()\r\n name = tmp[0]\r\n if name not in d:\r\n d[name] = []\r\n d[name] += tmp[2:]\r\n\r\nprint(len(d))\r\nfor i in d:\r\n print(i, end=' ')\r\n solve(d[i])\r\n", "n = int(input())\r\nd={}\r\nfor i in range(n):\r\n lis = list(map(str,input().split()))\r\n# print(lis)\r\n if lis[0] not in d:\r\n d[lis[0]]=list(set(lis[2:]))\r\n else:\r\n d[lis[0]]=list(set(lis[2:]+d[lis[0]]))\r\n#print(d)\r\nfor _ in d:\r\n a=d[_]\r\n ans=[]\r\n l=len(a)\r\n for i in range(l):\r\n c=1\r\n k=len(a[i])\r\n for j in range(l):\r\n# print(a[i],a[j][k:])\r\n if i!=j and a[i]==a[j][-k:]:\r\n c=0\r\n if c:\r\n ans.append(a[i])\r\n d[_]=ans\r\nprint(len(d)) \r\nfor i in d:\r\n print(i,len(d[i]),*d[i]) \r\n", "import sys\r\nimport bisect\r\nfrom collections import deque\r\n\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\ndef suffix(i,j):\r\n for k in range(len(j)):\r\n if i[-1-k] != j[-1-k]:\r\n return False\r\n return True\r\n\r\nn = int(ri())\r\ndic ={}\r\nfor i in range(n):\r\n temp= ri().split()\r\n arr = temp[2:]\r\n s = set()\r\n for i in arr:\r\n s.add(i)\r\n if temp[0] in dic:\r\n temps = dic[temp[0]]\r\n for i in s:\r\n temps.add(i)\r\n else:\r\n dic[temp[0]] = s\r\nprint(len(dic))\r\nfor k in dic:\r\n s = dic[k]\r\n q = []\r\n ans = []\r\n for j in s:\r\n q.append(j)\r\n q.sort(key = lambda x : -len(x))\r\n flag = [True]*len(q)\r\n for i in range(len(q)):\r\n for j in range(i+1,len(q)):\r\n if suffix(q[i],q[j]) : \r\n flag[j] = False\r\n for i in range(len(q)):\r\n if flag[i]:\r\n ans.append(q[i])\r\n print(k,end = \" \")\r\n print(len(ans),end =\" \")\r\n print(*ans)", "n=int(input())\r\nd=dict()\r\nfor i in range(n):\r\n m=input().split()\r\n if m[0] not in d:\r\n d[m[0]]=set()\r\n d[m[0]].update(set(m[2:]))\r\np=[]\r\nfor i in d:\r\n m=list(d[i])\r\n x=0\r\n while x<(len(m)):\r\n k=x+1\r\n while k <len(m):\r\n if m[x].endswith(m[k]):\r\n m.pop(k)\r\n elif m[k].endswith(m[x]):\r\n m.pop(x)\r\n break\r\n else:\r\n k+=1\r\n else:\r\n x+=1\r\n p.append(i+' '+str(len(m))+' '+' '.join(m))\r\nprint(len(p))\r\nfor i in p:\r\n print(i)", "# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\n# TAIWAN NUMBER ONE!!!!!!!!!!!!!!!!!!!\r\nfrom sys import stdin, stdout\r\nimport math\r\nimport heapq\r\nfrom itertools import accumulate\r\n\r\nN = int(input())\r\n\r\n#s = input() \r\n#N,K = [int(x) for x in stdin.readline().split()]\r\n\r\ndata = []\r\n\r\nfor i in range(N):\r\n s = input()\r\n data.append(s)\r\n \r\nphone = {}\r\nfor entry in data:\r\n e = entry.split(' ')\r\n #print(e)\r\n if e[0] not in phone:\r\n phone[e[0]] = []\r\n \r\n for p in e[2:]:\r\n phone[e[0]].append(p)\r\n\r\nk = 0 \r\nfor person in phone:\r\n phone[person] = list(set(phone[person]))\r\n k += 1\r\n#print(phone)\r\n\r\nprint(k)\r\nfor person in phone:\r\n p = phone[person]\r\n tmp = {}\r\n for num in p:\r\n tmp[num] = 1\r\n \r\n for i in range(len(p)):\r\n s = p[i]\r\n #print(s)\r\n for k in range(1,len(s)):\r\n if s[k:] in p:\r\n tmp[s[k:]] = 0\r\n \r\n valid = 0\r\n for num in p:\r\n if tmp[num]==1:\r\n valid += 1\r\n \r\n print(person,valid,end=' ')\r\n for num in p:\r\n if tmp[num]==1:\r\n print(num,end=' ')\r\n \r\n print('',end='\\n')\r\n \r\n ", "from collections import defaultdict\r\nn = int(input())\r\nbook = defaultdict(lambda : [])\r\nfor i in range(n):\r\n s = input().split()\r\n k = s[1]\r\n for j in s[2:]:\r\n book[s[0]].append(j)\r\nfinal = defaultdict(lambda : [])\r\nfor entry in book:\r\n book[entry] = list(set(book[entry]))\r\n for i in book[entry]:\r\n flag = 0\r\n for j in book[entry]:\r\n if i == j:\r\n continue\r\n if j.endswith(i):\r\n flag = 1\r\n if not flag:\r\n final[entry].append(i)\r\nprint(len(final))\r\nfor entry in final:\r\n print(entry, len(final[entry]), ' '.join(final[entry]))", "from collections import defaultdict\r\nn = int(input())\r\ndic = defaultdict(set)\r\nfor i in range(n):\r\n a = input().split()\r\n d = a[2:]\r\n for j in d:\r\n dic[a[0]].add(j)\r\n\r\ndic2 = defaultdict(list)\r\nfor k, v in dic.items():\r\n v = sorted(v, key=lambda x: len(x), reverse=True)\r\n tmp = []\r\n for i in v:\r\n if len(tmp) == 0:\r\n tmp.append(i)\r\n else:\r\n flag = True\r\n for h in tmp:\r\n if i == h[len(h) - len(i):]:\r\n flag = False\r\n continue\r\n\r\n if flag:\r\n tmp.append(i)\r\n\r\n dic2[k] = tmp\r\n\r\n\r\nprint(len(dic2))\r\nfor k, v in dic2.items():\r\n print(\"{} {} \".format(k, len(v)) + \" \".join(map(str, v)))", "import random\r\nimport math\r\nfrom collections import defaultdict\r\nimport itertools\r\nfrom sys import stdin, stdout\r\nimport sys\r\nimport operator\r\nfrom decimal import Decimal\r\n\r\n# sys.setrecursionlimit(10**6)\r\n\r\np2D = lambda x: print(*x, sep=\"\\n\")\r\n\r\n\r\ndef II(): return int(sys.stdin.buffer.readline())\r\n\r\n\r\ndef MI(): return map(int, sys.stdin.buffer.readline().split())\r\n\r\n\r\ndef LI(): return list(map(int, sys.stdin.buffer.readline().split()))\r\n\r\n\r\ndef LLI(rows_number): return [LI() for _ in range(rows_number)]\r\n\r\n\r\ndef BI(): return sys.stdin.buffer.readline().rstrip()\r\n\r\n\r\ndef SI(): return sys.stdin.buffer.readline().rstrip().decode()\r\n\r\n\r\ndef main():\r\n # z = ''\r\n # p = lambda *a: print(*a, flush = True)\r\n # d = defaultdict()\r\n\r\n #mod = 10 ** 9 + 7\r\n #for _ in range(int(input())):\r\n n = int(input())\r\n d = defaultdict(list)\r\n for i in range(n):\r\n l = [i for i in input().split()]\r\n for j in range(int(l[1])):\r\n if l[2+j] not in d[l[0]]:\r\n d[l[0]].append(l[2+j])\r\n #a = input().split()\r\n #ak = [int(i) for i in input().split()]\r\n #bk = list(map(int, input().split()))\r\n # s = SI()\r\n # c = LI()\r\n ans = defaultdict(list)\r\n for k in d.keys():\r\n d[k].sort()\r\n d[k].sort(key=len)\r\n j = 0\r\n while j <(len(d[k])-1):\r\n for l in range(j+1, len(d[k])):\r\n l1 = len(d[k][l])\r\n l2 = len(d[k][j])\r\n if l1> l2:\r\n if d[k][l][(l1-l2):] == d[k][j]:\r\n d[k].remove(d[k][j])\r\n j-=1\r\n break\r\n else:\r\n j+=1\r\n print(len(d))\r\n for k in d.keys():\r\n ans = k+ ' '+ str(len(d[k]))+ ' '\r\n ans+= ' '.join(d[k])\r\n print(ans)\r\n\r\n # print(b)\r\n\r\n\r\n\r\n # s = input()\r\n\r\n # s = input()\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()", "from collections import defaultdict\nn = int(input())\nentries = defaultdict(set)\nfor _ in range(n):\n inputs = input().split()\n entries[inputs[0]].update(inputs[2:])\nprint(len(entries))\nfor friend in entries:\n full = entries[friend].copy()\n for number in entries[friend]:\n suffix = ''\n for j in range(len(number) - 1, 0, -1):\n suffix = number[j] + suffix\n if suffix in full:\n full.remove(suffix)\n print(friend, len(full), ' '.join(full))\n", "n = int(input())\r\nrecords = dict()\r\n\r\nfor _ in range(n):\r\n record = list(input().split())\r\n name = record[0]\r\n size = int(record[1])\r\n phone = record[2:]\r\n \r\n if name not in records:\r\n records[name] = set()\r\n \r\n for num in phone:\r\n records[name].add(num)\r\n\r\nprint(len(records))\r\n\r\nfor name, phones in records.items():\r\n ans = []\r\n for num1 in phones:\r\n ok = True\r\n for num2 in phones:\r\n if len(num1) >= len(num2):\r\n continue\r\n \r\n if num2[-len(num1):] == num1:\r\n ok = False\r\n \r\n if ok:\r\n ans.append(num1)\r\n \r\n print(name, len(ans), *ans)", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict, deque\r\nfrom itertools import permutations\r\np = print\r\nr = range\r\ndef I(): return int(input())\r\ndef II(): return list(map(int, input().split()))\r\ndef S(): return input()[:-1]\r\ndef M(n): return [list(map(int, input().split())) for ___ in r(n)]\r\ndef pb(b): print('YES' if b else 'NO')\r\ndef INF(): return float('inf')\r\n# -----------------------------------------------------------------------------------------------------\r\n#\r\n# 　　　　　　　　　　　 ∧＿∧\r\n# 　　　　　 ∧＿∧ 　 （´<_｀ ）　 Welcome to My Coding Space !\r\n# 　　　　 （ ´_ゝ`）　/　 ⌒i Free Hong Kong !\r\n# 　　　　／　　　＼　 　 |　| Free Tibet !\r\n# 　　　 /　　 /￣￣￣￣/　|　 |\r\n# 　 ＿_(__ﾆつ/　 ＿/ .| .|＿＿＿＿\r\n# 　 　　　＼/＿＿＿＿/　（u　⊃\r\n#\r\n# 再帰関数ですか？　SYS!!!!\r\n# BINARY SEARCH ?\r\n# -----------------------------------------------------------------------------------------------------\r\nn = I()\r\nd = defaultdict(set)\r\nfor i in r(n):\r\n s = S().split()\r\n name = s[0]\r\n l = int(s[1])\r\n a = s[2:]\r\n for x in a:\r\n d[name].add(x)\r\n#p(d)\r\np(len(d))\r\ndef f(j,s0):\r\n if len(j) <= len(s0):\r\n return False\r\n return j[len(j)-len(s0):] == s0\r\nfor name, lst in d.items():\r\n newl = sorted(lst, key=lambda x:-len(x))\r\n res = []\r\n #p(newl)\r\n for s0 in newl:\r\n tag = True\r\n for j in res:\r\n if f(j,s0):\r\n tag = False\r\n break\r\n if tag:\r\n res.append(s0)\r\n p(name,len(res),\" \".join(res))\r\n", "\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\nnumlis = {}\r\n\r\nfor i in range(n):\r\n\r\n s = list(stdin.readline().split())\r\n\r\n name = s[0]\r\n size = int(s[1])\r\n num = s[2:]\r\n\r\n if name not in numlis:\r\n numlis[name] = []\r\n\r\n for p in num:\r\n numlis[name].append( (len(p),p) )\r\n\r\nprint (len(numlis))\r\n\r\nfor name in numlis:\r\n\r\n numlis[name].sort()\r\n numlis[name].reverse()\r\n\r\n suffix_set = set()\r\n\r\n ans = []\r\n\r\n for _,num in numlis[name]:\r\n\r\n if num in suffix_set:\r\n pass\r\n else:\r\n ans.append(num)\r\n\r\n for i in range(len(num)):\r\n suffix_set.add( num[i:] )\r\n\r\n print (name , len(ans) , \" \".join(ans))\r\n", "n, a = int(input()), {}\r\nb = {}\r\nfor _ in range(n):\r\n temp = input().split()\r\n name, count = temp[0], int(temp[1])\r\n if a.get(name, 0) != 0:\r\n a[name].update(set(temp[2:]))\r\n else:\r\n a[name] = set(temp[2:])\r\nfor i in a:\r\n a[i] = list(a[i])\r\n a[i].sort(key=len)\r\nprint(len(a))\r\nfor i in a:\r\n for j in range(len(a[i])):\r\n for k in range(j + 1, len(a[i])):\r\n if a[i][j] == a[i][k][len(a[i][k]) - len(a[i][j]):]:\r\n a[i][j] = a[i][k]\r\n a[i] = list(set(a[i]))\r\n print(i, len(a[i]), *a[i])", "\r\nn = int(input())\r\nd = {}\r\nfor i in range(n):\r\n line = input().split()\r\n \r\n try:\r\n d[line[0]]\r\n except:\r\n d[line[0]] = []\r\n \r\n \r\n for z in range(2, len(line)):\r\n d[line[0]].append(line[z])\r\n \r\nfor name in d:\r\n for i in range(len(d[name])):\r\n for j in range(len(d[name])):\r\n if i != j and d[name][i] != None and d[name][j] != None:\r\n if d[name][i].endswith(d[name][j]):\r\n d[name][j] = None\r\n elif d[name][j].endswith(d[name][i]):\r\n d[name][i] = None\r\nprint(len(d))\r\n \r\nfor name in d:\r\n print(name, end=' ')\r\n \r\n nums = []\r\n \r\n for i in d[name]:\r\n if i != None:\r\n nums.append(i)\r\n \r\n print(len(nums), end=' ')\r\n \r\n print(*nums)", "n = int(input())\r\n\r\nf = {}\r\n\r\nfor i in range(n):\r\n a = list(map(str, input().split()))\r\n name = a.pop(0)\r\n k = int(a.pop(0))\r\n\r\n if name not in f:\r\n f[name] = set()\r\n for j in range(k):\r\n f[name].add(a[j])\r\n\r\nfor key in f:\r\n f[key] = list(f[key])\r\n\r\nfor key in f:\r\n for i in range(len(f[key])):\r\n for j in range(len(f[key])):\r\n if i != j and f[key][i] != -1 and f[key][j] != -1:\r\n if len(f[key][i]) > len(f[key][j]):\r\n if f[key][i][len(f[key][i]) - len(f[key][j]):len(f[key][i])] == f[key][j]:\r\n f[key][j] = -1\r\n\r\nprint(len(f.keys()))\r\nfor key in f:\r\n c = 0\r\n for j in f[key]:\r\n if j != -1:\r\n c += 1\r\n print(key, c, end=\" \")\r\n for j in f[key]:\r\n if j != -1:\r\n print(j, end=\" \")\r\n print()\r\n", "n = int(input())\r\nmy_dict = {}\r\n\r\nfor _ in range(n):\r\n mix = input()\r\n lis = []\r\n name, nop, *lis = mix.split(\" \")\r\n if name in my_dict:\r\n my_dict[name].extend(lis)\r\n else:\r\n my_dict[name] = lis\r\nprint(len(my_dict))\r\n\r\nfor name, lis in my_dict.items():\r\n lis.sort(key=len)\r\n i = 0\r\n f = 0\r\n while i < (len(lis) - 1):\r\n f = 1\r\n j = i + 1\r\n while j < len(lis):\r\n if lis[j].endswith(lis[i]):\r\n f = 0\r\n del lis[i]\r\n break\r\n j = j + 1\r\n if (f):\r\n i = i + 1\r\n print(f\"{name} {len(lis)}\", end=\"\")\r\n for x in lis:\r\n print(f\" {x}\", end=\"\")\r\n print()\r\n", "def clean(l):\r\n l = list(set(l))\r\n l.sort()\r\n ans=[]\r\n for i in range(len(l)):\r\n for j in range(0,len(l)):\r\n if l[j].endswith(l[i]) and i!=j: break\r\n else: ans+=[l[i]]\r\n return ans\r\n\r\nd = dict()\r\nfor t in range(int(input())):\r\n l = [x for x in input().split(\" \")]\r\n name,x = l[0],[1]\r\n l = l[2:]\r\n if name in d: d[name]+=l\r\n else: d[name]=l\r\nkeys = d.keys()\r\nprint(len(keys))\r\nfor k in keys:\r\n l = clean(d[k])\r\n print(k,len(l),*l)", "phone_book = {}\r\n\r\nfor _ in range(int(input())):\r\n name, _, *numbers = input().split()\r\n if name in phone_book:\r\n phone_book[name].update(numbers)\r\n else:\r\n phone_book[name] = set(numbers)\r\n\r\nfor name, numbers in phone_book.items():\r\n full_numbers = set()\r\n for number in sorted(numbers, key=len, reverse=True):\r\n if all(not full_number.endswith(number) for full_number in full_numbers):\r\n full_numbers.add(number)\r\n phone_book[name] = full_numbers\r\n\r\nprint(len(phone_book))\r\nfor name, numbers in phone_book.items():\r\n print(name, len(numbers), *numbers)", "t = int(input())\r\n\r\nd = dict()\r\n\r\n\r\ndef func(l):\r\n l = sorted(l, key = len)\r\n # print(l)\r\n # return l\r\n b = [True for i in range(len(l))]\r\n for i in range(len(l)-1):\r\n for j in range(i+1, len(l)):\r\n s1 = l[i]\r\n s2 = l[j]\r\n if s2[len(s2)-len(s1):] == s1:\r\n b[i] = False\r\n break\r\n final = []\r\n for i in range(len(b)):\r\n if b[i]:\r\n final.append(l[i])\r\n return final\r\nans = 0\r\nfor tt in range(t):\r\n l = input().split()\r\n if l[0] in d :\r\n d[l[0]] = d[l[0]] + l[2:]\r\n else:\r\n d[l[0]] = l[2:]\r\n ans += 1\r\nprint(ans)\r\nfor x in d:\r\n d[x] = func(d[x])\r\n print(x, len(d[x]), *d[x])\r\n# print(d.items())\r\n\r\n ", "\"\"\" Prositka\r\n10.10.2022\"\"\"\r\n\r\nn=int(input())\r\nd=dict()\r\nfor i in range(n):\r\n a=input().split()\r\n if a[0] not in d:\r\n d[a[0]]=[]\r\n for j in range(2, len(a)):\r\n a[j]=a[j][::-1]\r\n d[a[0]]+=a[2:]\r\nprint(len(d))\r\nfor x in d:\r\n a=d[x]\r\n a.sort(reverse=True)\r\n b=[a[0]]\r\n for i in range(1, len(a)):\r\n if a[i-1][:len(a[i])]!=a[i]:\r\n b+=[a[i]]\r\n for i in range(len(b)):\r\n b[i]=b[i][::-1]\r\n print(x,len(b),*b)", "import 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):\r\n a, b, *w = input()[:-1].split()\r\n d[a].extend(w)\r\n\r\nans = []\r\nfor u in d:\r\n x = sorted(d[u], key=lambda x:-len(x))\r\n d1 = []\r\n for i in x:\r\n if len(d1) == 0:\r\n d1.append(i)\r\n else:\r\n ni = len(i)\r\n for j in d1:\r\n if i == j[max(0, len(j)-ni):]:\r\n break\r\n else:\r\n d1.append(i)\r\n ans.append((u, len(d1), *d1))\r\nprint(len(ans))\r\nfor i in ans:\r\n print(' '.join(map(str, i)))\r\n", "t = int(input())\r\nd = {}\r\nfor i in range(t):\r\n arr = input().split()\r\n if arr[0] in d.keys():\r\n d[arr[0]] += arr[2:]\r\n else:\r\n d[arr[0]] = arr[2:]\r\nfor i in d:\r\n for j in range(len(d[i])):\r\n for k in range(len(d[i])):\r\n if j == k:\r\n continue\r\n if len(d[i][j]) >= len(d[i][k]) and d[i][j][-len(d[i][k]):] == d[i][k]:\r\n d[i][k] = '.'\r\nprint(len(d))\r\nfor i in d:\r\n cnt = 0;\r\n for j in range(len(d[i])):\r\n if d[i][j] != '.':\r\n cnt += 1\r\n print(i, cnt, \" \".join(i for i in d[i] if i != '.') )# 1690554054.912937" ]

[ "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\nc, x = 0, a[0]\r\nans = 0\r\nfor i in a:\r\n if not i ^ x:\r\n c += 1\r\n else:\r\n ans += c * (c + 1) // 2\r\n c, x = 1, i\r\nans += c * (c + 1) // 2\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nc = 0\r\nd = 1\r\nfor i in range(n-1):\r\n if w[i] == w[i+1]:\r\n d += 1\r\n else:\r\n c += d*(d+1)//2\r\n d = 1\r\nc += d*(d+1)//2\r\nprint(c)\r\n", "def magical(arr):\r\n curr=None\r\n currn=0\r\n ans=[]\r\n for i in arr:\r\n if curr!=i:\r\n ans.append(currn)\r\n currn=1\r\n curr=i\r\n else:\r\n currn+=1\r\n ans.append(currn)\r\n cnt=0\r\n for i in ans:\r\n cnt+=((i)*(i+1))//2\r\n return cnt\r\n\r\na=input()\r\nlst=list(map(int,input().strip().split()))\r\nprint(magical(lst))\r\n", "def solution2(a, n):\r\n res = 0\r\n cnt_cur = 1\r\n for i in range(1, n):\r\n # print(cnt_cur)\r\n if a[i] != a[i-1]:\r\n res += cnt_cur*(cnt_cur+1)//2\r\n cnt_cur = 1\r\n else:\r\n cnt_cur += 1\r\n\r\n return res+cnt_cur*(cnt_cur+1)//2\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(solution2(a, n))", "n=int(input())\r\nlst=[*map(int,input().split())]\r\nresult,res=0,1\r\nfor i,x in enumerate(lst[1:]):\r\n if x==lst[i]:res+=1\r\n else:\r\n result+=(res*(res+1)//2)\r\n res=1\r\nresult+=(res*(res+1)//2)\r\nprint(result)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nc = 1\r\ntemp = l[0]\r\nfor i in range(1, n):\r\n if temp==l[i]:\r\n c+=1\r\n else:\r\n ans+=((c*(c+1))//2)\r\n c=1\r\n temp=l[i]\r\nprint(ans+(c*(c+1))//2)", "def magical_subarrays():\r\n\tcount = int(input())\r\n\tnumbers = list(map(int, input().split()))\r\n\r\n\tsame_num_count = 1\r\n\tmagical_subarray_count = 0\r\n\tfor index in range(1, count):\r\n\t\tif numbers[index-1] == numbers[index]:\r\n\t\t\tsame_num_count += 1\r\n\t\telse:\r\n\t\t\tmagical_subarray_count += same_num_count*(same_num_count+1)/2\r\n\t\t\tsame_num_count = 1\r\n\telse:\r\n\t\t# this is for last element count\r\n\t\tmagical_subarray_count += same_num_count*(same_num_count+1)/2\r\n\t\r\n\tprint(int(magical_subarray_count))\r\n\r\n\r\nmagical_subarrays()", "n = int(input())\n\narray = [int(num) for num in input().split()]\n\nprev = None\nrepetitions = 0\ncounter = 0\n\nwhile array:\n \n current = array.pop()\n \n if current == prev:\n \n repetitions += 1\n \n else:\n \n counter += repetitions*(repetitions+1)//2\n \n repetitions = 1\n\n prev = current\n \ncounter += repetitions*(repetitions+1)//2\n\nprint(counter)\n \t \t\t\t \t\t \t\t\t\t \t \t\t\t \t\t", "from itertools import groupby\r\n\r\nnum = int(input())\r\nstrlist = input().split()\r\nlist1 = [int(i) for i in strlist]\r\nresult = 0\r\n\r\nrepeat = [sum(1 for x in group) for x, group in groupby(list1)]\r\n\r\nfor i in repeat:\r\n if i == 1:\r\n pass\r\n else:\r\n result = result + i*(i-1)//2\r\n\r\nprint(result + num)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\ni=0\r\nwhile i<n:\r\n t=l[i]\r\n c=0\r\n while t==l[i]:\r\n i=i+1\r\n c=c+1\r\n if i==n:\r\n break\r\n ans=ans+(c*(c+1))//2\r\nprint(ans)", "from sys import stdin, stdout\r\nfrom math import factorial\r\n\r\nn = int(stdin.readline())\r\nvalues = list(map(int, stdin.readline().split()))\r\nans = 0\r\n\r\ncnt = 1\r\nfor i in range(1, n):\r\n if values[i] != values[i - 1]:\r\n ans += cnt * (cnt + 1) // 2\r\n cnt = 1\r\n else:\r\n cnt += 1\r\n\r\nans += cnt * (cnt + 1) // 2\r\n\r\nstdout.write(str(ans))", "i=int(input())\r\npp=list(map(int,input().split()))\r\np=0;log=pp[0]\r\nl=[]\r\nfor x in pp:\r\n if x==log: p+=1\r\n else: l.append(p);p=1\r\n log=x\r\nif p>1: l.append(p)\r\nans=i\r\n\r\nfor y in l:\r\n if y>1:\r\n tt=0\r\n for x in range(y): tt+=x\r\n ans+=tt\r\n\r\nprint(ans)", "import sys\nlines = sys.stdin.readlines()\nn = int(lines[0].strip())\nnums = list(map(int, lines[1].strip().split(\" \")))\n\ncount = []\nfor n in nums:\n if not count: count.append((n, 1)); continue\n if n == count[-1][0]: count[-1] = (count[-1][0],1 + count[-1][1])\n else: count.append((n, 1))\n\nres = 0\nfor c in count:\n k = c[1]\n res += k * (k+1)//2\nprint(res)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\ncnt=0\r\ni,z=0,0\r\nwhile(i<len(arr)-1):\r\n c=1 \r\n # print(i)\r\n d=1 \r\n while(d and i<len(arr)-1):\r\n if arr[i]==arr[i+1]:\r\n # print(arr[i],arr[i+1])\r\n c+=1 \r\n i+=1 \r\n else:\r\n i+=1 \r\n d=0 \r\n break \r\n z+=c \r\n cnt+=((c)*(c+1))//2\r\n\r\nif n==z:\r\n print(cnt)\r\nelse:\r\n print(cnt+1)", "n=int(input())\r\nar=list(map(int,input().split()))\r\nans=0\r\npr,cnt=float('inf'),0\r\nfor e in ar:\r\n if(e!=pr):\r\n ans+=cnt*(cnt+1)//2\r\n cnt=1\r\n else:\r\n cnt+=1\r\n pr=e\r\nans+=cnt*(cnt+1)//2\r\nprint(ans)\r\n", "\r\ndef solve():\r\n n = int(input())\r\n lst = []\r\n \r\n lst = [int(x) for x in input().split()] # for taking the list as the input..\r\n \r\n i = 0\r\n res = 0\r\n while(i < n):\r\n temp = lst[i]\r\n count = 0;\r\n while(temp == lst[i]):\r\n count += 1;\r\n i += 1;\r\n \r\n if(i == n):\r\n break\r\n \r\n \r\n res = res + count*(count+1)//2\r\n \r\n print(res)\r\n \r\n \r\n\r\nt = int(1);\r\n# t = input()\r\nfor i in range(0,t):\r\n solve()", "s=int(input())\na=[int(i) for i in input().split(\" \")]\n\nl=r=0\nres=0\n\ndef sumSection(l, r):\n n=(r-l)\n return (n+1)*(n/2)\nwhile l<=r and r<s:\n\n if a[l]!=a[r]:\n\n res+=sumSection(l,r)\n\n l=r\n r += 1\nres+=sumSection(l,r)\n\nprint(int(res))\n\n \t \t \t \t\t\t \t \t\t\t \t\t \t", "from sys import stdin\n\nN = int (stdin.readline ())\narr = list (map (int, stdin.readline ().split ()))\n\narr2 = []\ncurr = 0\n\nfor n in range (N):\n\tif n == 0:\n\t\tcurr = 1\n\telse:\n\t\tif arr [n] == arr [n - 1]:\n\t\t\tcurr += 1\n\t\telse:\n\t\t\tarr2.append (curr)\n\t\t\tcurr = 1\n\narr2.append (curr)\ncount = 0\n\nfor e in arr2:\n\tcount += e * (e + 1) // 2\n\t\nprint (count)", "r=lambda x:(x*(x+1))//2\r\nans,i=0,0\r\na=int(input())\r\nz=list(map(int,input().split()))+[int(1e10)]\r\nwhile i<a:\r\n gh=0;k=z[i]\r\n while i<a and z[i]==k:gh+=1;i+=1\r\n ans+=r(gh)\r\nprint(ans)", "input()\n\narray = input().split()\ncur = array[0]\ncount = 0\nresult = 0\n\nfor elem in array:\n\tif elem == cur:\n\t\tcount += 1\n\telse:\n\t\tresult += count * (count + 1) >> 1\n\t\tcur = elem\n\t\tcount = 1\n\nresult += count * (count + 1) >> 1\nprint(result)", "from sys import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom itertools import *\r\nfrom fractions import *\r\nfrom datetime import *\r\nfrom math import *\r\n\r\nInput = []\r\n\r\n#stdin = open('in', 'r')\r\n#stdout = open('out', 'w')\r\n\r\n## for i, val in enumerate(array, start_i_value)\r\n\r\ndef Out(x):\r\n stdout.write(str(x) + '\\n')\r\n\r\ndef In():\r\n return stdin.readline().strip()\r\n\r\ndef inputGrab():\r\n for line in stdin:\r\n Input.extend(map(str, line.strip().split()))\r\n'''--------------------------------------------------------------------------------'''\r\n\r\ndef main():\r\n n = input()\r\n \r\n v = list(map(int, In().split()))\r\n #print(v)\r\n \r\n pst = -1e9 - 2\r\n cnt = 0\r\n ans = 0\r\n \r\n for val in v:\r\n if pst == val:\r\n cnt += 1\r\n else:\r\n cnt = 1\r\n ans += cnt\r\n pst = val\r\n \r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.insert(0, a[0])\r\nres = []\r\nlen_ = 0\r\n\r\nfor i in range(1, n + 1):\r\n if a[i] == a[i - 1]:\r\n len_ += 1\r\n else:\r\n res.append(len_)\r\n len_ = 1\r\n\r\nres.append(len_)\r\n\r\nsum_ = n\r\n\r\nfor i in res:\r\n sum_ += math.comb(i, 2)\r\n\r\nprint(sum_)\r\n", "from collections import defaultdict\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\ncur = arr[0]\r\ncnt = 1\r\nd = defaultdict(int)\r\nfor i in range(1,n):\r\n\tif arr[i]==cur:\r\n\t\tcnt+=1\r\n\telse:\r\n\t\td[cnt]+=1\r\n\t\tcur = arr[i]\r\n\t\tcnt = 1\r\nif cnt!=0:\r\n\td[cnt]+=1\r\nans = 0\r\nfor i in d:\r\n\tfreq = d[i]\r\n\tcnt = (i*(i+1))//2\r\n\tcnt = cnt*freq\r\n\tans+=cnt\r\nprint(ans)", "n = int(input())\r\njum = 0\r\nnow = \"p\"\r\ncnt = 0\r\na = input().split()\r\nfor x in a:\r\n if(x == now):\r\n cnt += 1\r\n else:\r\n if(cnt != 0):\r\n jum += cnt*(cnt+1)//2\r\n cnt = 1\r\n now = x\r\njum += cnt*(cnt+1)//2\r\nprint(jum)", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 1\r\ns = 0\r\nfor i in range(1, n):\r\n if a[i] == a[i - 1]:\r\n k += 1\r\n else:\r\n s += (1 + k) * k // 2\r\n k = 1\r\ns += (1 + k) * k // 2\r\nprint(s)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n \r\ntot = 0\r\ncur = 1\r\nfor i in range(len(a)-1):\r\n if(a[i]==a[i+1]):\r\n cur+=1\r\n else:\r\n tot+=(cur*(cur+1))//2\r\n cur = 1\r\ntot+=(cur*(cur+1))//2\r\nprint(tot)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nbr = 0\r\nk = 0\r\n\r\nfor i in range(n - 1):\r\n if l[i] == l[i + 1]:\r\n k += 1\r\n br += k\r\n\r\n else:\r\n k = 0\r\n\r\nprint(br + n)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))[:n]\r\nc = s = res = 0\r\nfor i in arr:\r\n c = (s==i)*c+1\r\n s = i\r\n res += c\r\nprint(res)", "from collections import defaultdict\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\na = []\r\nprev = arr[0]\r\ni = 0\r\ns = 0\r\nwhile i<n:\r\n c = 0\r\n while i<n and arr[i] == prev:\r\n c+=1\r\n i+=1\r\n if i<n: prev = arr[i]\r\n s += (c*(c+1)//2)\r\nprint(s)", "def solve(arr, n):\r\n c = n\r\n i = 0\r\n j = 1\r\n while i + j < n:\r\n temp = 1\r\n while arr[i] == arr[i+j]:\r\n j += 1\r\n temp += 1\r\n if (i+j) >= n:\r\n break\r\n c += ((temp)*(temp+1)/2)\r\n c -= j\r\n i += j\r\n j = 1\r\n return int(c)\r\n\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(solve(arr, n))\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ntemp = [l[0]]\r\nans = 0\r\nfor i in range(1,n):\r\n\r\n\tif temp[-1] != l[i]:\r\n\t\tr = len(temp)\r\n\t\tans = ans + int(r*(r+1)/2) \r\n\t\ttemp = [l[i]]\r\n\telse:\r\n\t\ttemp.append(l[i])\r\nr = len(temp)\r\nans = ans + int(r*(r+1)/2) \r\n\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))[:n]\r\na = b = res = 0\r\nfor i in l:\r\n a = (b == i )* a + 1\r\n b = i\r\n res += a\r\nprint(res)", "# LUOGU_RID: 104833697\nn, *a = map(int, open(0).read().split())\r\np = 10**10\r\nans = c = 0\r\nfor x in a:\r\n if x != p:\r\n c = 1\r\n p = x\r\n else:\r\n c += 1\r\n ans += c\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nt, ans = 1, 0\r\nfor i in range(n - 1):\r\n if (a[i] == a[i + 1]):\r\n t += 1\r\n else:\r\n ans += (t * (t - 1)) // 2 + t\r\n t = 1\r\n\r\nans += (t * (t - 1)) // 2 + t\r\nprint (ans)\r\n", "a=int(input())\r\nk=list(map(int,input().split()))\r\nans=0\r\nt=1\r\nfor i in range(1,a):\r\n if k[i-1]==k[i]:\r\n t+=1\r\n else:\r\n ans+=(t*(t+1))//2\r\n t=1\r\nans+=(t*(t+1))//2\r\nprint(ans)", "import sys\nimport math\nfrom collections import defaultdict\nimport itertools\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\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(str(ans) + \"\\n\")\n\n\ndef solve(arr):\n # min = max iff all elements in subarray are the same\n # amount of subarrays increases by len of consec elemnts\n total = 0 \n\n curEle = None\n ln = 1\n for ele in arr:\n if ele == curEle:\n ln += 1\n else:\n ln = 1\n curEle = ele\n total += ln\n\n return total\n\n\ndef readinput():\n arrLen = getInt()\n arr = list(getInts())\n printOutput(solve(arr))\n\nreadinput()\n", "ln = int(input())\r\narr = list(map(int,input().split()))\r\nans = ln\r\nmay = 0\r\nr = 0\r\nwhile r<ln-1:\r\n may = 1\r\n while r<ln-1 and arr[r+1]==arr[r]:\r\n may+=1\r\n r+=1\r\n if may>1:\r\n ans+=(may*(may-1))//2\r\n r+=1\r\nprint(ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\na = []\r\ncnt = 0\r\nfor i in range(n-1):\r\n if arr[i] == arr[i+1]:\r\n cnt += 1\r\n else:\r\n a.append(cnt)\r\n cnt = 0\r\na.append(cnt)\r\na = [x+1 for x in a]\r\n# print(a)\r\nprint(sum((n*(n+1))//2 for n in a))", "n = int(input())\na = list(map(int, input().split()))\ntemp = 1\nans = 0\nfor i in range(0, n):\n if (i > 0 and a[i] == a[i-1]):\n temp += 1\n else:\n temp = 1\n ans += temp\nprint(ans)", "import math\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\n#n,k,t = map(int, input().strip().split(' '))\r\nc=1\r\ns=0\r\nfor j in range(1,n):\r\n if lst[j]==lst[j-1]:\r\n c+=1\r\n if j==n-1:\r\n s+=((c)*(c-1))//2\r\n else:\r\n if c>=2:\r\n s+=((c)*(c-1))//2\r\n c=1\r\nprint(s+n)", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n \ndef value(): return tuple(map(int, input().split()))\ndef values(): return tuple(map(int, sys.stdin.readline().split()))\ndef inlst(): return [int(i) for i in input().split()]\ndef inlsts(): return [int(i) for i in sys.stdin.readline().split()]\ndef inp(): return int(input())\ndef inps(): return int(sys.stdin.readline())\ndef instr(): return input()\ndef stlst(): return [i for i in input().split()]\n \n \n######################################################################################\n#--------------------------------------code here-------------------------------------#\n######################################################################################\ndef cnt(n):\n return n*(1+n)//2\ndef solve():\n n=inp()\n l=inlst()\n tot=0\n for i , j in itertools.groupby(l):\n m=len(list(j))\n tot+=m+cnt(m-1)\n\n print(tot) \n\n\n \nsolve()\n\n\n# n = int(input())\n# a = list(input().split())\n \n# x = 0\n# c = 0\n# i = 0\n\n\n# while i < n:\n# if i + x < n and a[i] == a[i + x]:\n# x += 1\n# else:\n# c += int((x * (x + 1)) / 2)\n# i += x\n# x = 0\n \n# print(c)", "n=int(input())\narr=list(map(int,input().split()))\ni=0\nans=0\nwhile(i<n):\n\tcur=arr[i]\n\tl=0\n\tvis=True\n\twhile(i<n and cur==arr[i]):\n\t\ti+=1\n\t\tl+=1\n\t\tvis=False\n\tans+=(l*(l+1))//2\nprint(ans)\n", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\nres = 0\r\np = 0\r\nwhile p < n:\r\n count, sp = 1, p + 1\r\n while sp < n:\r\n if nums[sp] == nums[p]:\r\n count += 1\r\n sp += 1\r\n else:\r\n break\r\n res += (count + 1) * count / 2\r\n p = sp\r\nprint(int(res))\r\n", "groups = []\r\nints = int(input())\r\nnums = list(map(int, input().split(' ')))\r\ncurr = nums[0]\r\ntotal = 0\r\nfor i in nums:\r\n if i == curr:\r\n total += 1\r\n else:\r\n groups.append(total)\r\n curr = i\r\n total = 1\r\n\r\nif total != 0:\r\n groups.append(total)\r\n\r\nans = 0\r\nfor i in groups:\r\n ans += int(i*(i+1)/2)\r\n\r\nprint(ans)\r\n", "input()\r\nc=a=r=0\r\nfor i in input().split():c=(a==i)*c+1;a=i;r+=c\r\nprint(r)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\na.append(a[-1] + 1)\r\nr = []\r\nk = 1\r\nfor i in range(1, n + 1):\r\n if a[i] == a[i - 1]:\r\n k += 1\r\n else:\r\n r.append(k)\r\n k = 1\r\nprint(sum(map(lambda x: x * (x + 1) // 2, r)))\r\n", "from itertools import groupby\r\n\r\ndef main():\r\n\tn = int(input())\r\n\ta = list(map(int, input().split()))\r\n\r\n\tli = []\r\n\tfor k, v in groupby(a):\r\n\t\tli.append(len(list(v)))\r\n\r\n\tans = 0\r\n\tfor el in li:\r\n\t\tans += el * (el + 1) // 2\r\n\r\n\tprint(ans)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\nx=1\r\ny=0\r\nfor i in range (0,n):\r\n if i<=n-2:\r\n if s[i]==s[i+1] :\r\n x+=1\r\n else:\r\n y+=int(x*(x-1)/2)\r\n\r\n x=1\r\n else:\r\n if s[i]==s[i-1]:\r\n\r\n y+=int(x*(x-1)/2)\r\nprint(y+n)\r\n\r\n\r\n\r\n\r\n\r\n", "def sac(v,n):\r\n\tp,d,t='',0,1\r\n\tv.append('end')\r\n\t\"\"\"subarray count\"\"\"\r\n\tfor c in v:\r\n\t\tif c==p:\r\n\t\t\tt+=1\r\n\t\t\tcontinue\r\n\t\telse:\r\n\t\t\tif t>1:\r\n\t\t\t\td+=t*(t-1)//2\r\n\t\t\tp=c\r\n\t\t\tt=1\r\n\treturn d\r\n\r\nn=int(input())\r\nv=input().split()\r\nprint(n+sac(v,n))", "n = int(input())\na = input().split()\n\nx = 0\ncount = 0\nmultiply = 1\n\nfor i in range(n):\n if a[i] == x:\n multiply += 1\n else:\n multiply = 1\n count += multiply\n x = a[i]\n\nprint(count)\n\n \t \t \t \t\t\t \t \t\t\t\t\t \t", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nrle_arr = []\r\ncurrent_num = 1000000001\r\ncurrent_count = 1\r\nfor element in arr:\r\n\tif(element != current_num):\r\n\t\trle_arr.append((current_num, current_count))\r\n\t\tcurrent_num = element\r\n\t\tcurrent_count = 1\r\n\telse:\r\n\t\tcurrent_count += 1\r\nrle_arr.append((current_num, current_count))\r\nrle_arr = rle_arr[1:]\r\ntotal = 0\r\nfor x, y in rle_arr:\r\n\ttotal += (y + 1) * y / 2\r\nprint(int(total))", "from itertools import groupby\r\nn=int(input())\r\nw=[int(k) for k in input().split()]\r\nw=groupby(w)\r\nres=0\r\nfor j in w:\r\n z=len(list(j[1]))\r\n res+=(1+z)*z//2\r\nprint(res)", "\r\ndef cumulativeSum(number):\r\n return (number * (number+1))//2\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n arr = [int(x) for x in input().split()]\r\n current = arr[0]\r\n count = 0\r\n res = 0\r\n\r\n for i in range(n):\r\n if (arr[i] != current):\r\n res += cumulativeSum(count)\r\n count = 1\r\n current = arr[i]\r\n else:\r\n count += 1\r\n res += cumulativeSum(count)\r\n\r\n print(res)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = 0\r\ngp = 1\r\nfor i in range(1,n):\r\n if arr[i]==arr[i-1]:\r\n gp+=1\r\n else:\r\n ans+= (gp*(gp+1))//2\r\n gp = 1\r\nans += (gp*(gp+1))//2 \r\nprint(ans)", "input()\r\nc = 0\r\nans = 0\r\nk = 0\r\nfor i in input().split():\r\n if i != k:\r\n k = i\r\n c = 0\r\n c += 1\r\n ans += c\r\nprint(ans)\r\n", "import math\r\nfrom os import startfile\r\nimport random \r\nfrom queue import Queue\r\nimport time \r\nimport heapq\r\nimport sys \r\n\r\ndef main(arr):\r\n l,r=0,0\r\n ans=0\r\n arr.append(-float('inf'))\r\n for i in range(1,len(arr)):\r\n \r\n if arr[i]==arr[i-1]:\r\n \r\n r=i\r\n \r\n\r\n else:\r\n \r\n nums=r-l+1 \r\n ans+=nums*(nums+1)/2\r\n l=r=i\r\n return int(ans)\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(main(arr))\r\n \r\n \r\n\r\n\r\n", "def main():\r\n n = int(input())\r\n seq = [int(c) for c in input().split()]\r\n\r\n prev = -1e10\r\n res = 0\r\n length = 0\r\n for i in range(n):\r\n if seq[i] != prev:\r\n res += length * (length + 1) // 2\r\n length = 1\r\n prev = seq[i]\r\n else:\r\n length += 1\r\n\r\n res += length * (length + 1) // 2\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# Wadea #\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\narr.append(-100000000000000000000)\r\nans = n\r\nlength = 0\r\nfor i in range(n):\r\n if arr[i] == arr[i+1]:\r\n length += 1\r\n else:\r\n ans += (((length+1)*length)//2)\r\n length = 0\r\nprint(ans)\r\n\r\n'''\r\n21 28\r\n1 1 1 1 1 1 1\r\n\r\n15 21\r\n1 1 1 1 1 1\r\n\r\n10 15 \r\n1 1 1 1 1 \r\n\r\n6 10\r\n1 1 1 1\r\n\r\n3 6\r\n1 1 1 \r\n\r\n1 3\r\n1 1\r\n'''", "n = int(input())\na = list(map(int, input().split()))\n\nans = 0 # inicializar contador de submatrices mágicas\nl = r = 0 # inicializar índices izquierdo y derecho de la submatriz actual\n\nwhile r < n:\n if a[r] == a[l]:\n # si el elemento actual es igual al elemento inicial de la submatriz,\n # se incrementa el contador de submatrices mágicas\n ans += r - l\n r += 1\n else:\n # si el elemento actual es diferente al elemento inicial de la submatriz,\n # se actualiza el índice izquierdo de la submatriz y se avanza el índice derecho\n l = r\n r += 1\n\n# se suman los casos en que la submatriz consta de un solo elemento (índice izquierdo = índice derecho)\nans += n # incluir submatrices de un solo elemento al principio y al final de la matriz\n\nprint(ans)\n\t\t\t \t \t \t \t\t \t\t \t \t\t\t \t\t \t\t", "z=int(input())\r\nzoop=list(map(int,input().split()))\r\n \r\nfast=0\r\ncount=0\r\nans=0\r\nfor i in range(len(zoop)):\r\n if zoop[fast]==zoop[i]:\r\n count+=1\r\n \r\n else:\r\n fast=i\r\n ans+=(count*(count+1))//2\r\n count=1\r\n \r\nans+=(count*(count+1))//2 \r\nprint(ans) \r\n \r\n \r\n \r\n \r\n \r\n ", "input()\r\nc=0 #For tracking the current count of consecutive numbers\r\na=0 #For keeping track of previous number\r\nans=0\r\nfor i in input().split():\r\n c=(a==i)*c+1\r\n a=i\r\n ans+=c\r\nprint(ans)\r\n", "def nCr(n, r):\r\n m = 1\r\n for i in range(n, n - r, -1):\r\n m *= i\r\n return int(m // 2)\r\n\r\n\r\nn, a, coin, ans = int(input()), list(map(int, input().split())), 1, 0\r\nfor i in range(n):\r\n if i > 0 and a[i] == a[i - 1]:\r\n coin += 1\r\n else:\r\n ans += nCr(coin, 2)\r\n coin = 1\r\n ans += 1\r\n\r\nans += nCr(coin, 2)\r\nprint(ans)\r\n", "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\nans = 0\r\ni = 0\r\nwhile i < n:\r\n if i < n-1 and A[i] == A[i+1]:\r\n i += 1\r\n count = 2\r\n while i < n-1 and A[i] == A[i+1]:\r\n i += 1\r\n count += 1\r\n ans += (count * (count+1) // 2)\r\n else:\r\n ans += 1\r\n i += 1\r\nprint(ans)\r\n ", "n = int(input())\r\na = input().split()\r\na = [int(i) for i in a]\r\nres = len(a)\r\ni = 0\r\nwhile(i<n-1):\r\n\r\n\tif(a[i]==a[i+1]):\r\n\t\tj = i+1\r\n\t\twhile(j<n and a[j] == a[i]):\r\n\t\t\tj += 1\r\n\t\t#print(i,j,(j-i)*(j-i-1)//2)\r\n\t\tres += ((j-i)*(j-i-1)//2)\r\n\t\tif(j == n):\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\ti = j\r\n\telse:\r\n\t\ti += 1\r\n\r\n\r\nprint(res)\r\n\r\n\r\n", "N = int(input())\r\nA = input().split()\r\ncount = 0\r\nlast = -1\r\n\r\nfor i in range(N+1):\r\n\tif(i==0):\r\n\t\tlast = i\r\n\t\tcontinue\r\n\tif(i==N or A[i]!=A[i-1]):\r\n\t\tsize = i-last\r\n\t\tlast = i\r\n\t\tcount+=((size*size)+size)//2\r\nprint(count)", "import bisect\r\nimport collections\r\nimport copy\r\nimport enum\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport random\r\nimport re\r\nimport sys\r\nimport time\r\nimport string\r\nfrom typing import List\r\nsys.setrecursionlimit(3001)\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\ndp = [1]*n\r\nans = 1\r\nfor i in range(1,n):\r\n if arr[i] == arr[i-1]:\r\n dp[i]+= dp[i-1]\r\n ans+= dp[i]\r\nprint(ans)", "n = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nj = 0\r\nans = 0\r\nfor i in range(n):\r\n while j < n:\r\n if A[i] == A[j]:\r\n j += 1\r\n else:\r\n break\r\n ans += j-i\r\n if i == j:\r\n j += 1\r\nprint(ans)\r\n", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\nnan = 10**9 + 1\r\na = list(map(int, input().split())) + [nan]\r\nans = 0\r\nprev, cnt = nan, 0\r\n\r\nfor x in a:\r\n if prev != x:\r\n ans += cnt * (cnt + 1) // 2\r\n prev = x\r\n cnt = 1\r\n else:\r\n cnt += 1\r\n\r\nprint(ans)\r\n", "import math\n\n\ndef choose(n, k):\n return n - k + 1\n\n\nclass CodeforcesTask84BSolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.array = []\n\n def read_input(self):\n self.n = int(input())\n self.array = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n magic_arrays = 0\n cr = 10 ** 10\n cn = 0\n for a in self.array:\n if a == cr:\n cn += 1\n else:\n if cn:\n for x in range(1, cn + 1):\n magic_arrays += choose(cn, x)\n cr = a\n cn = 1\n for x in range(1, cn + 1):\n magic_arrays += choose(cn, x)\n self.result = str(int(magic_arrays))\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask84BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n = int(input())\r\na = list(input().split())\r\n\r\nx = 0\r\nc = 0\r\ni = 0\r\nwhile i < n:\r\n if i + x < n and a[i] == a[i + x]:\r\n x += 1\r\n else:\r\n c += int((x * (x + 1)) / 2)\r\n i += x\r\n x = 0\r\n\r\nprint(c)", "n = int(input())\na = [int(t) for t in input().split()]\nres = 0\ni = 0\nwhile i < n:\n\tj = i\n\twhile j < n and a[i] == a[j]:\n\t\tj += 1\n\tres += (j - i) * (j - i + 1) // 2\n\ti = j\nprint(res)\n", "cases = int(input())\n\nmagical = input().split()\n\nlast = 0\nmultiplier = 1\ncounter = 0\n\nfor i in range(cases):\n if last == magical[i]:\n multiplier += 1\n else:\n multiplier = 1\n counter += multiplier\n last = magical[i]\n\nprint(counter)\n\n\t\t\t\t\t\t \t \t\t \t\t \t \t\t\t\t \t\t\t \t", "n = int(input())\r\nlist1 = list(map(int,input().split()))\r\nans =n\r\ni=1\r\ncount=1\r\nwhile(i<n):\r\n if i ==n-1 and list1[i]==list1[i-1]:\r\n count+=1\r\n ans+=((count*(count-1))//2)\r\n \r\n elif list1[i]==list1[i-1]:\r\n count+=1\r\n else:\r\n ans+=((count*(count-1))//2)\r\n count=1\r\n i+=1\r\nprint(ans)\r\n \r\n \r\n\r\n \r\n", "inp = int(input())\r\nwejscie = [int(i) for i in input().split()]\r\nans = 0\r\nans += inp\r\ncount = 0\r\nj = 0\r\ncurrent = None\r\n\r\nfor i in range(inp - 1):\r\n current = wejscie[i]\r\n if wejscie[i+1] == current:\r\n j += 1\r\n ans += j\r\n else:\r\n current = wejscie[i + 1]\r\n j = 0\r\n\r\n\r\nprint(ans)", "n = int(input())\r\na = []\r\nd = {}\r\na = list(map(int, input().split()))\r\ncomp = a[0]\r\nsum = 0\r\ncount = 1\r\nfor i in range(1, n):\r\n if comp == a[i]:\r\n count+=1\r\n else:\r\n sum+=((count*(count+1))//2)\r\n count = 1\r\n comp = a[i]\r\nprint(sum+(count*(count+1))//2)\r\n \r\n", "k=r=0\r\np=10**10\r\nI=input\r\nI()\r\nfor x in map(int,I().split()):\r\n\tif x!=p:r+=k*(k+1)//2;p=x;k=1\r\n\telse:k+=1\r\nprint(r+k*(k+1)//2)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncnt = ans = 0\r\nfor i in range(n-1):\r\n if arr[i] == arr[i+1]: cnt += 1\r\n else: ans += ((cnt+1)*(cnt+2))//2; cnt = 0\r\nans += ((cnt+1)*(cnt+2))//2\r\nprint(ans)", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\ns=0\r\nx=1\r\nfor i in range(1,n):\r\n if(list1[i]==list1[i-1]):\r\n x+=1\r\n else:\r\n # if(x>1):\r\n # s+=x+1\r\n # else:\r\n # s+=x\r\n s+=(x)*(x+1)//2\r\n x=1\r\n# if(x>1):\r\n# s+=x+1\r\n# else:\r\n# s+=x\r\ns+=(x)*(x+1)//2\r\nprint(s)", "n = int(input())\r\nc=a=ans=0\r\nfor i in input().split():\r\n c=(a==i)*c+1\r\n a=i\r\n ans+=c\r\nprint(ans)", "from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\"\"\"\r\n#from heapq import *\r\n#from random import *\r\nimport sys\r\ninput=sys.stdin.readline\r\n#sys.setrecursionlimit(3*(10**5))\r\nglobal flag\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=inp()\r\n a=lis()\r\n a+=[1.2]\r\n n+=1\r\n r=0\r\n c=0\r\n p=a[0]\r\n for i in range(n):\r\n if(a[i]==p):\r\n c+=1\r\n else:\r\n r+=(c*(c+1))//2\r\n c=1\r\n p=a[i]\r\n print(r)\r\n \r\n", "def total(c):\r\n return c*(c+1)//2 \r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nc=0 \r\nans=0 \r\nfor i in range(0,n-1):\r\n if l[i]==l[i+1]:\r\n c+=1 \r\n else:\r\n ans+=total(c+1)\r\n c=0 \r\nans+=total(c+1)\r\nprint(ans)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nr = 0\r\npI, pC = lst[0], 1\r\nfor x in lst[1:]:\r\n if x == pI:\r\n pC += 1\r\n else:\r\n r += pC * (pC + 1) // 2\r\n pI = x\r\n pC = 1\r\nr += pC * (pC + 1) // 2\r\nprint(r)", "n = (int)(input())\r\na = (list)(map(int , input().split()))\r\nans = 0\r\ncnt = 1\r\nfor i in range(1 , n) :\r\n if a[i] == a[i-1] : cnt += 1\r\n else :\r\n ans += cnt * (cnt + 1) // 2\r\n cnt = 1\r\nans += cnt * (cnt + 1) // 2\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=n\r\ns=1\r\nflag=0\r\nfor i in range(n-1):\r\n if l[i+1]!=l[i] and s!=1:\r\n ans+=s*(s-1)//2\r\n flag=0\r\n s=1\r\n elif l[i+1]==l[i]:\r\n s+=1\r\n flag=1\r\nif flag==1:\r\n ans+=s*(s-1)//2\r\nprint(ans)", "input()\r\nL,ans='',0\r\nfor x in input().split():\r\n if x==L:\r\n z+=1\r\n else:\r\n if L!='':\r\n ans+=z*(z+1)//2\r\n z,L=1,x\r\nans+=z*(z+1)//2\r\nprint(ans)\r\n\r\n\r\n \r\n", "n = int(input())\narray = [int(x) for x in input().split()]\n\nresult = 0\npre = array[0]\ncount = 1\nfor i in range(1,n):\n\tif array[i] == pre:\n\t\tcount += 1\n\telse:\n\t\tresult += count * (count + 1) // 2\n\t\tcount = 1\n\t\tpre = array[i]\n\nresult += count * (count + 1) // 2\nprint(result)\n", "n=int(input())\r\nd={}\r\ns=n\r\nl=list(map(int,input().split()))\r\nc=1\r\nm=l[0]\r\nfor i in range(1,len(l)):\r\n if l[i]==m:\r\n c+=1\r\n else:\r\n s+=(c*(c-1))//2\r\n m=l[i]\r\n c=1\r\nprint(s+(c*(c-1))//2)\r\n ", "import sys\r\nimport math\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\nn = iinput()\r\na = get_list()\r\nans = 0\r\ni = 0\r\n\r\nwhile(i<n):\r\n\tcnt = 1\r\n\twhile(i<n-1 and a[i+1] == a[i]):\r\n\t\ti+=1\r\n\t\tcnt+=1\r\n\tans += (cnt)*(cnt+1)//2\t\r\n\ti+=1\r\n\r\nprint(ans)\t\r\n\r\n\r\n\"\"\"\r\n1 -> 1\r\n2 -> 3\r\n3 -> 6\r\n4 -> 10\r\n5 -> \r\n\r\n\"\"\"", "n= int(input(\"\"))\n\na = [int(x) for x in input().split()]\n\ns = 1\nc = 1\n\nfirst = a[0]\nfor i in range(1,n,1):\n a[i]\n if (a[i]!=a[i-1]):\n s += 1\n c = 1\n else:\n s += 1 + c\n c += 1\n\nprint(s)\n\n\t \t \t\t \t\t\t\t \t \t\t \t\t \t \t \t", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = 0\r\ncnt = 1\r\nfor i in range(n-1):\r\n if arr[i] == arr[i+1]:\r\n cnt += 1\r\n continue\r\n ans += (cnt*(cnt+1))//2\r\n cnt = 1\r\n\r\nans += (cnt*(cnt+1))//2\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int, input().split(' ')))\r\ni = 1\r\nr = 1\r\ntotal = 0\r\nwhile i<n:\r\n if l[i] == l[i-1]:\r\n r += 1\r\n else:\r\n total += r*(r+1)//2\r\n r = 1\r\n i += 1 \r\ntotal += r*(r+1)//2\r\n\r\nprint(total)", "from math import comb\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ndct = dict()\r\nfor i in arr:\r\n if i in dct:\r\n dct[i] += 1\r\n else:\r\n dct[i] = 1\r\n\r\nans = n\r\ncount = 1\r\nfor i in range(1, n):\r\n if arr[i] == arr[i - 1]:\r\n count += 1\r\n else:\r\n ans += comb(count, 2)\r\n count = 1\r\n\r\nif count > 1:\r\n ans += comb(count, 2)\r\nprint(ans)", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nlast = -1000000001\r\nres = 0\r\nfor i in range(n):\r\n now = numbers[i]\r\n if now != last:\r\n c = 1\r\n else:\r\n c += 1\r\n res += c\r\n last = now\r\nprint(res)# 1692032542.4550366", "n = int(input())\na = list(map(int, input().split()))\ncnt = 0 \nres = 0\nfor i in range(0, n):\n if (i > 0 and a[i] == pre):\n cnt += 1\n else:\n cnt = 1\n pre = a[i]\n res += cnt\nprint(res)\n", "import fileinput as fs\n\ndef printSol(arr):\n res = 0\n prev = None\n cons = 1\n for elem in arr:\n if prev is None:\n prev = elem\n continue\n if elem == prev:\n cons = cons + 1\n else:\n res = res + sumTillNumber(cons)\n cons = 1\n prev = elem\n res = res + sumTillNumber(cons)\n print(res)\ndef sumTillNumber(n):\n return int((n*(n + 1))/2)\n\nif __name__ == \"__main__\":\n firstLine = True\n for line in fs.input():\n if firstLine:\n size = int(line)\n firstLine = not firstLine\n else:\n printSol([int(x) for x in line.split(' ')])\n break\n", "def main():\r\n input()\r\n prev = None\r\n res = length = 0\r\n for e in (int(c) for c in input().split()):\r\n if e != prev:\r\n res += length * (length + 1) // 2\r\n length = 0\r\n prev = e\r\n\r\n length += 1\r\n\r\n res += length * (length + 1) // 2\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n" ]

[ "from ctypes import c_int32\n\ndef gcd(a,b):\n\n if b == 0:\n\n return a\n\n return gcd(b, a % b)\n\n \n\ndef normalize_rational(num,den):\n\n #associate the -ve with the num or cancel -ve sign when both are -ve\n\n if num ^ den < 0 and num > 0 or num ^ den > 0 and num < 0:\n\n num = -num; den = -den\n\n #put it in its simplest form\n\n g = gcd(abs(num),abs(den))\n\n num //= g; den //=g\n\n return (num,den)\n\n\n\nfrom sys import *\n\nl = stdin.readline()\n\n(n,m) = (int(tkn) for tkn in l.split())\n\nxs = [0] * m; ys = [0] * m\n\n#maxhits = [set() for i in range(n+1)]\n\nmaxhits = [c_int32(1)] * (n + 1)\n\nmaxhits[0] = c_int32(0)\n\nfor i in range(m):\n\n l = stdin.readline()\n\n (x,y) = (int(tkn) for tkn in l.split())\n\n xs[i] = x; ys[i] = y\n\nline_to_points = {}\n\nfor i in range(m):\n\n for j in range(m):\n\n #m = dy/dx; y = (dy/dx)x + c ==> y.dx = x.dy + c.dx\n\n #y.dx = x.dy + c'\n\n #c' = y.dx - x.dy\n\n #c' = ys[i]*dx - xs[i]*dy\n\n #Now, at y = 0, x = -c' / dy\n\n dy = ys[i] - ys[j]; dx = xs[i] - xs[j]\n\n if dy == 0:\n\n continue\n\n #not a special case anymore\n\n # if dx == 0:\n\n # if xs[i] > n:\n\n # continue\n\n # else:\n\n # count_seen_from_x = len([x for x in xs if x == xs[i]])\n\n # maxhits[xs[i]] = max(count_seen_from_x, maxhits[xs[i]])\n\n else:\n\n slope = normalize_rational(dy,dx)\n\n c_prime = ys[i]*dx - xs[i]*dy\n\n x_intercept = -c_prime / dy\n\n line = (slope,x_intercept)\n\n if line in line_to_points:\n\n #print(\"line: \", line)\n\n #print(\"now: \", points)\n\n points = line_to_points[line]\n\n points.add(i); points.add(j)\n\n #print(\"after addition: \", points)\n\n continue\n\n \n\n #if (i == 1 and j == 2):\n\n # print(c_prime, x_intercept, dy, dx)\n\n if int(x_intercept) == x_intercept and x_intercept <= n and x_intercept > 0:\n\n points = set([i,j])\n\n line_to_points[line] = points\n\n #maxhits[int(x_intercept)] = points\n\n # count_on_line = 2\n\n # for k in range(m):\n\n # if k != i and k != j and ys[k] * dx == xs[k]*dy + c_prime:\n\n # count_on_line += 1\n\n # maxhits[int(x_intercept)] = max(count_on_line, maxhits[int(x_intercept)])\n\nfor line,points in line_to_points.items():\n\n x_intercept = int(line[1])\n\n maxhits[x_intercept] = c_int32(max(maxhits[x_intercept].value,len(points)))\n\n#print(maxhits)\n\n#print(sum([max(len(points),1) for points in maxhits]) - 1)\n\nprint(sum([e.value for e in maxhits]))\n\n\n\n# Made By Mostafa_Khaled" ]

[ "M=10**9+7\r\nn,m=[int(e) for e in input().split()]\r\nif m<2:\r\n print(0)\r\nelse:\r\n F=[[0]*(m+1) for i in range(n+1)]\r\n Fsum=[[0]*(m+1) for i in range(n+1)]\r\n for j in range(2,m+1):\r\n F[1][j]=1\r\n Fsum[1][j]=Fsum[1][j-1]+F[1][j]\r\n for i in range(2,n+1):\r\n s=1\r\n for j in range(2,m+1):\r\n s+=Fsum[i-1][j]\r\n s%=M\r\n F[i][j]=s\r\n Fsum[i][j]=Fsum[i][j-1]+F[i][j]\r\n Fsum[i][j]%=M\r\n s=0\r\n for i in range(1,n+1):\r\n for j in range(2,m+1):\r\n s+=(m-j+1)*(F[i][j]*(F[n-i+1][j]-F[n-i][j]))\r\n s%=M\r\n print(s)" ]

[ "from bisect import bisect_right\r\ninput()\r\nt = list(map(int, input().split()))\r\ns, p = 0, []\r\nfor i, j in enumerate(t):\r\n k = bisect_right(p, j)\r\n s += i - k\r\n p.insert(k, j)\r\nprint(2 * s - (s & 1))", "def count(a):\r\n n = len(a)\r\n cnt = 0\r\n for i in range(n):\r\n for j in range(i+1, n):\r\n if a[i] > a[j]:\r\n cnt+=1\r\n return cnt \r\n\r\nn = int(input())\r\np = list(map(int, input().split()))\r\nnum = count(p)\r\n\r\nprint(num*2 - num%2)", "#!/usr/bin/python3\n\nimport sys\n\nclass CumTree:\n \n def __init__(self, a, b):\n self.a = a\n self.b = b\n self.count = 0\n if a == b:\n return\n mid = (a + b) // 2\n self.levo = CumTree(a, mid)\n self.desno = CumTree(mid+1, b)\n \n def manjsi(self, t):\n if self.a >= t:\n return 0\n if self.b < t:\n return self.count\n return self.levo.manjsi(t) + self.desno.manjsi(t)\n \n def vstavi(self, t):\n if self.a <= t <= self.b:\n self.count += 1\n if self.a == self.b:\n return\n self.levo.vstavi(t)\n self.desno.vstavi(t)\n \nn = int(sys.stdin.readline())\np = [int(x) for x in sys.stdin.readline().strip().split()]\n\nct = CumTree(1, 4096)\n\nvsota = 0\nwhile len(p) > 0:\n x = p.pop()\n vsota += ct.manjsi(x)\n ct.vstavi(x)\n\nk, d = vsota // 2, vsota % 2\nprint(\"%f\" % (4*k + d))\n", "n=int(input().strip())\r\np=[0]+list(map(int,input().split()))\r\n\r\nc=[0]*(n+1)\r\ndef lowbit(x):\r\n return x&(-x)\r\ndef add(x,v):\r\n while x<=n:\r\n c[x]+=v\r\n x+=lowbit(x)\r\ndef get(x):\r\n ans=0\r\n while x:\r\n ans+=c[x]\r\n x-=lowbit(x)\r\n return ans\r\n\r\nans=0\r\nfor i in range(n,0,-1):\r\n ans+=get(p[i])\r\n add(p[i],1)\r\n\r\nif ans%2:\r\n print(2*ans-1)\r\nelse:\r\n print(2*ans)\r\n", "def merge_sort(a, l, r):\r\n res = 0\r\n if l < r:\r\n m = (l + r) // 2\r\n res += merge_sort(a, l, m)\r\n res += merge_sort(a, m + 1, r)\r\n \r\n i = l\r\n j = m + 1\r\n b = []\r\n while i <= m and j <= r:\r\n if a[i] <= a[j]:\r\n b.append(a[i])\r\n i += 1\r\n else:\r\n b.append(a[j])\r\n j += 1\r\n res += m - i + 1\r\n\r\n while i <= m:\r\n b.append(a[i])\r\n i += 1\r\n\r\n while j <= r:\r\n b.append(a[j])\r\n j += 1\r\n \r\n for idx, val in enumerate(b):\r\n a[idx + l] = val\r\n \r\n return res \r\n\r\ninput()\r\na = [int(x) for x in input().split()]\r\nn = len(a)\r\nans = merge_sort(a, 0, n - 1)\r\nif ans & 1 == 0:\r\n ans *= 2\r\nelse:\r\n ans = ans * 2 - 1\r\nprint(ans)\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(n):\r\n j=i-1\r\n while(j>=0):\r\n if b[j]>b[i]:\r\n cnt+=1\r\n j+=-1\r\n i+=-1\r\n\r\nprint(2*cnt-cnt%2)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nMOD=10**9+7\r\n\r\nif __name__ == '__main__':\r\n n=int(input())\r\n arr=list(map(int, input().split()))\r\n cnt=0\r\n for i in range(n-1):\r\n for j in range(i+1,n):\r\n if arr[j]<arr[i]: cnt +=1\r\n \r\n print((cnt*2-(cnt%2))*1.0)\r\n\r\n " ]

[ "a,b=map(int,input().split())\r\nc=0\r\nd=0\r\nwhile a>0:\r\n d+=1\r\n c+=1\r\n if c==b:\r\n a+=1\r\n c=0\r\n a-=1\r\nprint(d)", "tm = input().split()\r\nn, m = int(tm[0]), int(tm[1])\r\nit = n\r\np = 0\r\nwhile it // m - p > 0:\r\n l = p\r\n p = it // m\r\n it += it // m - l\r\nprint(it)", "n, m = input().split(' ')\r\nn, m = [int(n), int(m)]\r\n\r\ndays = 0\r\n\r\nwhile True:\r\n if days % m == 0: n+=1\r\n n-=1\r\n \r\n if n == 0: break\r\n days+=1\r\n\r\n \r\nprint(days)\r\n \r\n ", "n,m=map(int, input().split())\r\ns=n\r\nwhile (n//m)>=1:\r\n s+=(n//m)\r\n n=((n//m)+(n%m))\r\nprint(s)", "n,m=list(map(int,input().split()))\r\ncnt=n\r\nwhile n>=m:\r\n cnt+=(n//m)\r\n n=((n//m)+(n%m))\r\nprint(cnt)", "s,m=[int(i) for i in input().split()]\r\nc=1\r\nwhile s!=0:\r\n s-=1\r\n if c%m==0:\r\n s+=1\r\n if s==0:\r\n break\r\n else:\r\n c+=1\r\nprint(c)", "n, m = map(int, input().split())\r\ndays, socks = 0, n\r\nwhile socks > 0:\r\n days += 1\r\n socks -= 1\r\n if days % m == 0:\r\n socks += 1\r\nprint(days)\r\n", "n, m = map(int, input().split())\r\n\r\nd = 0\r\ns = n\r\n\r\nwhile s > 0:\r\n d += 1\r\n s -= 1\r\n\r\n if d % m == 0:\r\n s += 1\r\n\r\nprint(d)", "number_of_socks, dates = map(int, input().split())\r\ndef calculate(number_of_socks, dates):\r\n if number_of_socks == dates:\r\n return number_of_socks + 1\r\n count = 1\r\n while count * dates <= number_of_socks:\r\n count += 1\r\n number_of_socks += 1\r\n\r\n return number_of_socks\r\nresult = calculate(number_of_socks, dates)\r\nprint(result)", "n, m = map(int,input().split())\r\nk = 0\r\nday = 0\r\nwhile n > 0:\r\n n -= 1\r\n day += 1\r\n if day % m == 0:\r\n n += 1\r\nprint(day)\r\n", "n,m = map(int,input().split())\r\ncount = 0\r\nwhile n > 0:\r\n n -= 1\r\n count += 1\r\n if count%m == 0:\r\n n +=1\r\nprint(count)", "n, m = map(int, input().split())\r\ndays = 0\r\nstep = 0\r\nwhile n != 0:\r\n step += 1\r\n if step == m:\r\n n += 1\r\n step = 0\r\n n -= 1\r\n days += 1\r\nprint(days)", "info = input().split()\r\nsocknum = int(info[0])\r\nbuyinterval = int(info[1])\r\ncounter = 0\r\n\r\nwhile socknum != 0:\r\n counter += 1\r\n socknum -= 1\r\n if counter % buyinterval == 0:\r\n socknum += 1\r\n\r\nprint(counter)", "n,m = map(int, input().split())\r\na = 0\r\nwhile n > 0:\r\n if n>=m:\r\n n = n - m\r\n a += m\r\n n+=1\r\n else:\r\n a += n\r\n n = 0\r\nprint(a)\r\n", "n,m=map(int,input().split())\r\nd=1\r\nwhile n>0:\r\n n-=1\r\n if d%m==0:\r\n n+=1\r\n d+=1\r\nprint(d-1)\r\n", "noski, md = map(int, input().split())\r\nday = 0\r\nwhile noski > 0:\r\n day += 1\r\n noski -= 1\r\n if day % md == 0:\r\n noski += 1\r\nprint(day)\r\n", "l = list(map(int,input().split()))\nn,m = l[0],l[1]\n\nd = 0\n\nwhile n>0:\n n -= 1\n d += 1\n if d != 0 and d % m == 0:\n n += 1\n\nprint(d)\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\n\r\nk=(n-1)//(m-1)\r\n\r\n\r\nprint(n+k)", "a,b=map(int,input().split())\r\nk=0\r\nwhile a!=0:\r\n k+=1\r\n a-=1\r\n if k%b==0:\r\n a+=1\r\nprint(k) ", "a,b=map(int,input().split())\r\nr=(a-1)//(b-1)\r\nprint(r+a)", "\r\ndef main():\r\n n, m = map(int, input().split())\r\n answer = 0\r\n while n > 0:\r\n n -= 1\r\n answer += 1\r\n if answer % m == 0:\r\n n += 1\r\n print(answer)\r\n\r\nmain()\r\n", "n,m=list(map(int,input().split()))\r\ns=0\r\ns=n+(n-1)//(m-1)\r\nprint(s)", "n,m = map(int,input().split())\r\ni=0\r\nc=0\r\nwhile i<n:\r\n i+=1\r\n if i%m == 0:\r\n n+=1\r\nprint(i)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed May 4 20:13:24 2022\r\n\r\n@author: dehong\r\n\"\"\"\r\n\r\n\r\na,b=list(map(int, input().split()))\r\ni=0\r\nwhile a!=0:\r\n a-=1\r\n if i%b==0: a+=1\r\n i+=1\r\nprint(i-1)", "n,m=tuple(map(int,input().split()))\r\nl=[n]\r\ndl=None\r\nwhile True:\r\n dl=n%m\r\n n//=m\r\n l.append(n)\r\n if n<=0:\r\n break\r\n n+=dl\r\nprint(sum(l))", "n,m=[int(x) for x in input(\" \").split()]\r\nc=n\r\nwhile n>=m :\r\n c=(n//m)+c\r\n n=(n//m)+(n%m)\r\nprint(c)", "n,m = map(int, input().split())\r\ncnt = 0\r\nfor i in range(1,1000):\r\n if i*m<=n:\r\n n+=1\r\n else:\r\n break\r\nprint(n)", "##n,m = map(int,input().split())\r\n##day = 1\r\n##if m>n:\r\n## print(n)\r\n##else:\r\n## while n>1: \r\n## day+=1\r\n## #print(day)\r\n## #print(n)\r\n## n = n-1+1/m\r\n## print(day)\r\n\r\n\r\nn, m = map(int, input().split())\r\ndays = 0\r\ni = 1\r\nwhile n > 0:\r\n n -= 1\r\n days += 1\r\n if days == m * i:\r\n n += 1\r\n i += 1\r\nprint(days)\r\n", "h=input()\r\nh=h.split()\r\nn=int(h[0])\r\nm=int(h[1])\r\nt=0\r\nwhile True:\r\n n-=1\r\n t+=1\r\n if t%m==0:\r\n n+=1\r\n if n==0:\r\n print(t)\r\n break", "a = input ()\r\na = a.split(\" \")\r\nn = a[0]\r\nm = a[1]\r\nn = int(n)\r\nm = int(m)\r\nday = 0\r\nwhile n > 0 :\r\n n -= 1\r\n day += 1\r\n \r\n if day % m == 0 :\r\n n += 1\r\n \r\nprint (day)", "noski, m_dni = map(int, input().split())\r\ncount_day = 0 \r\nwhile noski > 0:\r\n count_day = count_day + 1\r\n noski = noski - 1 \r\n \r\n if count_day % m_dni == 0:\r\n noski = noski + 1\r\nprint(count_day)", "if __name__ == '__main__':\r\n n, m = list(map(int,input().split()))\r\n steps = 0\r\n days = 0\r\n \r\n while n != 0:\r\n n -= 1\r\n steps += 1\r\n days += 1\r\n if steps == m:\r\n n+=1\r\n steps = 0\r\n print(days)", "n,m = [int(a) for a in input().split()]\r\ncnt = 0\r\ni = 1\r\nwhile n > 0:\r\n if i % m == 0:\r\n n += 1\r\n cnt += 1\r\n n-=1\r\n i+=1\r\nprint(cnt)", "n, m = map(int, input().split())\r\nsocks = n\r\ncur = 1\r\nwhile True:\r\n \r\n socks -= 1\r\n if socks < 0:\r\n break\r\n if cur % m == 0:\r\n socks += 1\r\n cur += 1 \r\nprint(cur - 1)\r\n ", "numbers = [int(x) for x in input().split()]\r\nanswer = numbers[0]\r\nadd = int(numbers[0]/numbers[1])\r\nanswer = answer+add\r\nwhile answer//numbers[1] - add > 0:\r\n answer_old = answer\r\n answer = answer + answer//numbers[1] - add\r\n add = answer_old//numbers[1]\r\nprint(answer)", "import sys\r\n\r\ndef read_inline_chars():\r\n return list(sys.stdin.readline().split())\r\n\r\ndef read_inline_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\ndef read_multiline_ints():\r\n return list(map(int, sys.stdin.readlines()))\r\n\r\n# solution code below\r\nn, m = read_inline_ints()\r\ndays = 0\r\nwhile n > 0:\r\n days += 1\r\n n -= 1\r\n if days % m == 0:\r\n n += 1\r\nprint(days)", "from math import floor\r\nn , k = map(int,input().split())\r\nres = 0\r\nsus = n\r\nday =0\r\nwhile n > 0:\r\n n-=1\r\n day+=1\r\n if day == k:\r\n n+=1\r\n res+=1\r\n day =0\r\n else:\r\n res+=1\r\n \r\n \r\nif sus<k:\r\n print(sus)\r\nelse:\r\n print(int(res))\r\n# 1 2 3 4 5\r\n", "n,m=map(int,input().split())\r\na=n\r\ni=0\r\nwhile i<n:\r\n if i%m==0:\r\n n=n+1\r\n a=a+1\r\n i=i+1\r\nprint(a-1)", "a,b=map(int,input().split())\r\ns=a\r\nfor i in range(b,max(a,b)*10,b):\r\n if i<=s:\r\n s+=1\r\nprint(s)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jan 28 19:59:56 2023\r\n\r\n@author: amill212\r\n\"\"\"\r\n\r\n#Problem 460A Codeforces: Vasya and Socks \r\nn, m = map(int, input().split())\r\n\r\nsock_count = n\r\ndays = 0\r\ncount = 0\r\n#We want to print when the socks run out \r\nwhile sock_count != 0:\r\n #we add a day to the day count \r\n days += 1\r\n #we take one from the sock count \r\n sock_count -= 1 \r\n #this count is to see when we replenish with a new pair of socks \r\n count += 1\r\n #if the count equals the number of days we get a new pair of socks \r\n if count == m:\r\n #then we add 1 pair \r\n sock_count += 1\r\n #and reset the count \r\n count = 0\r\n\r\nprint(days)\r\n", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ncount = n\r\nwhile(n>1):\r\n count += n/m\r\n n = n/m\r\nprint(int(count))", "n,m=map(int,input().split())\r\nd=0\r\n\r\nwhile n!=0:\r\n n=n-1\r\n if d%m==0:\r\n n=n+1\r\n d=d+1\r\nprint(d-1)", "n, m = map(int, input().split())\r\nif n < m:\r\n print(n)\r\nelif m > n//2:\r\n print(n+1)\r\nelse:\r\n res = n\r\n while n > 0:\r\n tmp = n//m\r\n res += tmp\r\n if n%m == 0 and tmp == 1 or m > n:\r\n break\r\n tmp += n%m\r\n n = tmp\r\n print(res)", "n,m = map(int,input().split())\r\nday = n\r\nnew_sock = n//m\r\nday += new_sock\r\nadd_day = new_sock + n - (n//m)*m\r\nwhile add_day >= m:\r\n new_sock = add_day//m\r\n day += new_sock\r\n n = add_day\r\n add_day = new_sock + n - (n//m)*m\r\nprint(day)", "a,b=map(int,input().split())\r\nc=0\r\nv=b\r\nif a>0:\r\n while a!=0:\r\n if b!=0:\r\n a=a-1\r\n c=c+1\r\n b=b-1\r\n elif b==0:\r\n a=a+1\r\n b=v\r\nif b==0:\r\n c=c+1\r\nprint(c)", "a,b = [int(x) for x in input().split()];\r\nf=1;\r\nc=0;\r\nwhile b*f <= a:\r\n a+=1;\r\n f+=1;\r\nelse:\r\n print(a)", "n,m = map(int,input().split())\r\nday = 0\r\nwhile(True):\r\n day+=1\r\n if n<=0:\r\n break\r\n else:\r\n if (day%m):\r\n n-=1\r\nprint(day-1)", "soks, mama_soks = map(int, input().split())\r\n\r\nday = 0\r\n\r\nwhile soks > 0:\r\n soks -= 1\r\n day += 1\r\n if day % mama_soks == 0:\r\n soks += 1\r\nprint(day)\r\n", "n, m = map(int, input().split())\r\n\r\nvalue = n\r\n\r\nwhile n >= m:\r\n value += (n // m)\r\n n = ((n // m) + (n % m))\r\n\r\nprint(value)", "n, m = (int(x) for x in input().split(\" \"))\r\n\r\ncount = n\r\ni = 0\r\ndays = 0\r\nwhile count > 0:\r\n count -= 1\r\n i += 1\r\n if i == m:\r\n count += 1\r\n i = 0\r\n days += 1\r\n\r\nprint(days)\r\n", "a,b = map(int, input().split())\r\ncounter = 0\r\nwhile(a!= 0 ):\r\n a = a-1\r\n counter = counter + 1\r\n if counter%b == 0 and counter > 0:\r\n a = a+1\r\nprint(counter)", "n,m=map(int,input().split())\r\nx=(n-1)//(m-1)\r\nprint(n+x)", "n, m = (int(i) for i in input().split())\nres = 0\nwhile n > 0:\n res += 1\n n = n - 1 + (res % m == 0)\nprint(res)\n", "s,m = map(int,input().split())\r\nd = 0\r\n\r\nwhile s > 0:\r\n s -= 1\r\n d += 1\r\n\r\n if d % m == 0:\r\n # print(f\"мама пришла на {d} день\")\r\n s += 1\r\n \r\nprint(d)\r\n", "n,m=map(int,input().split())\r\nans=0\r\nwhile n:\r\n n-=1\r\n ans+=1\r\n if ans%m==0:\r\n n+=1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\ndays = n\r\ncurrent_day = 0\r\n\r\nwhile current_day < days:\r\n \r\n current_day += 1\r\n if current_day % m == 0:\r\n days += 1\r\n\r\nprint(current_day)\r\n\r\n", "n,m = list(map(int,input().split()))\r\ndays = (n-1)//(m-1) \r\ndays+=n\r\nprint(days)", "n_ = input().split()\r\nn = int(n_[0])\r\nm = int(n_[1])\r\ntotal = 0\r\ni = 0\r\nwhile n > 0:\r\n n -= 1\r\n total += 1\r\n i += 1\r\n if i % m == 0:\r\n n += 1\r\n\r\n\r\nprint(total)\r\n", "n,m=map(int,input().split())\r\nk=0\r\nd=n\r\nwhile n>0:\r\n k+=1\r\n n-=1\r\n if(k%m==0):\r\n n+=1\r\nprint(k)", "n, m = list(map(int, input().split()))\r\n\r\nans = 0\r\nwhile n>0:\r\n\tans += 1\r\n\tif ans %m == 0:\r\n\t\tn += 1\r\n\tn -= 1\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nc=0\r\ni=1\r\nd=0\r\nif(n==m):\r\n print(n+1)\r\nelse:\r\n while(d==0):\r\n if(n==0):\r\n d=1\r\n elif(i%m==0):\r\n c=c+1\r\n i=i+1\r\n d=0\r\n \r\n elif(i%m!=0):\r\n i=i+1\r\n c=c+1\r\n n=n-1\r\n d=0\r\n \r\n \r\n \r\n \r\n print(c)", "def func1(n,m):\r\n day = 1\r\n total_socks_left = n-1 # 8\r\n while total_socks_left>0:\r\n day+=1 #2,3\r\n total_socks_left-=1 #7,6\r\n if day%m==0:\r\n total_socks_left+=1\r\n return day\r\nn,m = map(int,input().split())\r\nprint(func1(n,m))", "n,m=map(int,input().split())\r\ncount=0\r\nrem=n\r\nday=1\r\nwhile rem!=0:\r\n count=count+1\r\n if day%m==0:\r\n day=day+1\r\n pass\r\n else:\r\n day=day+1\r\n rem=rem-1\r\nprint(count)", "n,m=map(int,input().split())\r\nans=0\r\ns=n\r\nwhile s>0:\r\n ans+=1\r\n s-=1\r\n if ans%m==0:\r\n s+=1\r\nprint(ans)", "m, n = map(int, input().split())\r\ncounter = 0\r\nwhile m > 0:\r\n m -= 1\r\n counter += 1\r\n if counter % n == 0:\r\n m += 1\r\nprint(counter)", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nn,m=map(int,input().split())\r\nx=n//m\r\nc=0\r\nwhile c<n:\r\n c+=1\r\n if c%m==0:\r\n n+=1\r\nprint(n)", "a,b=map(int,input().split())\r\nans = (a-1)//(b-1)+a\r\nprint(ans)", "a, b = map(int, input().split())\r\nif a<b:\r\n print(a)\r\nelse:\r\n count = a\r\n while a>0:\r\n a=a-b+1 \r\n count +=1 \r\n print(count-1)", "#460A - Vasya and Socks\r\n[n,m],d=list(map(int,input().split())),0\r\nwhile n>=1:\r\n n-=1\r\n d+=1\r\n if d%m==0:\r\n n+=1\r\nprint(d)", "n=list(map(int,input().split()))\r\nl=n[0]\r\nb=n[1]\r\nday=0\r\nwhile l>0:\r\n l-=1\r\n day+=1\r\n if day%b==0 and day>=2:\r\n l+=1\r\nprint(day)", "socks, mams_socks = map(int, input().split())\r\ndays = 1\r\n\r\nwhile True:\r\n\r\n if socks != 0:\r\n socks -= 1\r\n\r\n else:\r\n break\r\n\r\n if days%mams_socks == 0:\r\n socks += 1\r\n days += 1\r\n\r\nprint(days-1)", "n,m=map(int,input().split())\r\nanswer=0\r\nwhile n>0:\r\n n-=1\r\n answer+=1\r\n if answer%m==0:\r\n n+=1\r\nprint(answer)", "x,y=map(int,input().split())\r\nres=(x-1)//(y-1)\r\nprint(x+res)", "def days_until_no_socks(n, m):\r\n days_left = n\r\n count = 0\r\n \r\n while days_left > 0:\r\n days_left -=1\r\n count +=1\r\n \r\n if count % m == 0:\r\n days_left +=1\r\n return count\r\n\r\n\r\nn,m = map(int,input().split())\r\nresult = days_until_no_socks(n,m)\r\nprint(result)", "n, m = map(int, input().split())\r\nans = 0\r\nans += n\r\nwhile n >= m:\r\n res = n % m\r\n n = n // m\r\n ans += n\r\n n += res\r\n\r\nprint(ans)", "N, M = map(int, input().split())\r\ns = N + N // (M - 1)\r\nif N % (M - 1) == 0:\r\n\ts -= 1\r\nprint(s)", "a, b = map(int, input().split())\r\n\r\nprint((int(a - 1) // (b - 1) + a))\r\n\r\n\r\n", "n, m = map(int, input().split())\r\ni = 0\r\nwhile True:\r\n n-=1\r\n if not (i-1)%m:\r\n n+=1\r\n if n < 0:\r\n print(i-1)\r\n break\r\n i+=1", "a , b = map(int, input().split())\r\n\r\ncs = a\r\n\r\nd = 0\r\n\r\nwhile 1 :\r\n if cs ==0:\r\n print(d)\r\n break\r\n cs -=1\r\n d+=1\r\n if d%b==0:\r\n cs+=1\r\n \r\n", "n, m = list(map(int, input().split()))\r\n\r\nday = 0\r\n\r\nwhile True:\r\n n -= 1\r\n day += 1\r\n if day % m == 0:\r\n n += 1\r\n if n == 0:\r\n break\r\nprint(day)", "a, b = map(int, input().split())\r\n\r\ndays = 1\r\nwhile a:\r\n a -= 1\r\n if days % b == 0:\r\n a += 1\r\n days += 1\r\nprint(days - 1)\r\n", "n, m = map(int, input().split()) #sock = n, day = m\r\nday = 0\r\n\r\nwhile n >= 1:\r\n n -= 1\r\n day +=1\r\n if day%m == 0:\r\n n +=1\r\nprint(day)", "n,m=map(int,input().split())\r\ni=0\r\nwhile i<n:\r\n if (i+1)%m==0: \r\n n+=1\r\n i+=1\r\nprint(n)", "def main(n, m):\r\n k, i = n, 0\r\n\r\n while k != 0:\r\n k -= 1\r\n\r\n if (i + 1) % m == 0:\r\n k += 1\r\n\r\n if k == 0:\r\n return i + 1\r\n\r\n i += 1\r\n\r\n return i\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n\r\n print(main(n, m))", "n, m = map(int, input().split())\r\n\r\ndays = n\r\n\r\ni = m\r\nwhile i <= n:\r\n days += 1\r\n n += 1\r\n i += m\r\n \r\nprint(days)\r\n \r\n ", "n, m = map(int, input().split())\r\nres = (n - 1) // (m - 1)\r\n\r\nprint(res + n)\r\n", "\r\nn, m = list(map(int, input().split()))\r\n\r\nday_count = 0\r\nend = n + 1\r\nday = 1\r\n\r\nwhile day != end:\r\n\r\n if (day // m)*m == day:\r\n end += 1\r\n\r\n day_count += 1\r\n day += 1\r\n\r\n\r\nprint(day_count)", "n, m = map(int, input().split())\r\n\r\nused = 0\r\n\r\nfor cur in range(1, 1000):\r\n\r\n if n > 0:\r\n used += 1\r\n n -= 1\r\n\r\n if cur % m == 0:\r\n n += 1\r\n\r\n else:\r\n break\r\n\r\nprint(used)", "#https://codeforces.com/problemset/problem/460/A\r\n\r\n(n, m) = (int(x) for x in input().split(\" \"))\r\nanswer = (n*m)//(m-1)\r\nif(answer%m == 0):\r\n answer -=1\r\nprint(answer)", "nums = list(map(int, input().split()))\r\n\r\nn = nums[0]\r\nm = nums[1]\r\n\r\ns = 0\r\nres = 0\r\n\r\nwhile n > 0:\r\n n -= 1\r\n s += 1\r\n\r\n if s % m == 0:\r\n n += 1\r\n\r\nprint(s)", "(n, m) = map(int, input().split(' '))\r\nx = 1\r\nwhile True:\r\n if n + int(x/m) == x:\r\n print(x)\r\n break\r\n x += 1\r\n", "n,m = map(int,input().split())\n\nSockAmt = n\nCurrentDay = 0\nwhile SockAmt > 0:\n #Day Change\n CurrentDay += 1\n #Sock Loss\n SockAmt -= 1\n #Obtain Sock\n if(CurrentDay % m == 0):\n SockAmt += 1\nprint(CurrentDay)\n", "n, m = [int(i) for i in input().split()]\r\nss=n\r\nd=1\r\nwhile ss!=0:\r\n\r\n ss-=1\r\n if d%m==0:\r\n ss+=1\r\n d+=1\r\n #print(\"ss:\", ss)\r\nprint(d-1)", "n = input().split()\r\n\r\nsocks = int(n[0])\r\ndays_until_new_pair = int(n[1])\r\ndays = 0\r\n\r\nwhile True:\r\n days += 1\r\n socks -= 1\r\n days_until_new_pair -= 1\r\n if days_until_new_pair == 0:\r\n socks += 1\r\n days_until_new_pair = int(n[1])\r\n if socks == 0:\r\n break\r\n\r\nprint(days)\r\n", "n,m = map(int,input().split())\r\ncount=0\r\nwhile n>0:\r\n count+=1\r\n n-=1\r\n if count%m==0:\r\n n+=1 \r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nx = 0\r\nwhile n > 0:\r\n x += 1\r\n if x % m != 0:\r\n n -= 1\r\nprint(x)", "a, b = map (int, (input ().split ()))\r\nprint (a + (a - 1)\t\t//(b-1))\r\n", "n,m=map(int,input().split())\r\ns=n+n//m\r\np,t,u=1,0,1\r\nwhile True:\r\n if u==p*m:\r\n p+=1\r\n t+=1\r\n u+=1\r\n if u>n+t:\r\n break\r\nprint(n+t)", "n,m=map(int,input().split())\r\nk=m\r\nwhile(m<=n):\r\n n=n+1\r\n m=m+k\r\nprint(n)", "n,m=map(int,input().split())\ncount=n\nc=n%m \nnew=n//m \nwhile(new>0):\n count=count+1\n if(count%m==0):\n new=new+1 \n new=new-1 \nprint(count) \n \n \n \n \t\t\t\t\t \t\t\t\t \t\t\t \t\t \t\t\t \t", "socks, m = map(int, input().split())\r\ndays = 0\r\n\r\nwhile True:\r\n socks -= 1\r\n days += 1\r\n if days % m == 0:\r\n socks += 1\r\n if socks == 0:\r\n break\r\n\r\nprint(days)\r\n", "def solve(n,m):\r\n S=n\r\n i=1\r\n while S!=0:\r\n if i%m==0:S=S+1\r\n S=S-1\r\n i=i+1\r\n return(i-1)\r\nn,m=map(int,input().split(\" \"))\r\nprint(solve(n,m))", "[n,m] = list(map(int,input().split(' ')))\r\n\r\ni = 1\r\nwhile( i <= n ):\r\n\r\n if( i % m == 0 ):\r\n n += 1\r\n \r\n i += 1\r\n \r\nprint(n)", "n,m = map(int,input().split())\r\nx = 0\r\nwhile(n + x//m != x):\r\n x += 1\r\nprint(x)", "n,m=map(int,input().split())\r\nsocks=n+1\r\nday=0\r\ni=1\r\nwhile i<socks:\r\n day+=1\r\n if day%m==0:\r\n continue\r\n else:\r\n i+=1\r\nprint(day)", "\r\nn, m = map(int, input().split())\r\n\r\n\r\nconsecutive_days = 0\r\nsocks = n\r\n\r\n\r\nwhile socks > 0:\r\n consecutive_days += 1\r\n socks -= 1\r\n\r\n \r\n if consecutive_days % m == 0:\r\n socks += 1\r\n\r\n\r\nprint(consecutive_days)\r\n", "n,m= map(int,input().split())\r\nres = (n-1)//(m-1)\r\nprint(res+n)\r\n", "socks, mom_day = map(int, input().split())\r\nday = 0\r\nwhile socks > 0:\r\n socks -= 1\r\n day += 1\r\n\r\n if day % mom_day == 0:\r\n## print(f\"Мама пришла на {day} день\")\r\n socks += 1\r\nprint(day)\r\n \r\n \r\n\r\n", "n_and_m = list(map(int, input().split()))\ndays = 0\n\nsocks_vasya_got = n_and_m[0]\n\nthe_day_moms_is_arraived = n_and_m[1]\n\nwhile socks_vasya_got > 0:\n days += 1\n socks_vasya_got -= 1\n\n if days % the_day_moms_is_arraived == 0:\n socks_vasya_got += 1\nprint(days)", "n, m = [int(i) for i in input().split()]\r\n\r\nday = 1\r\nwhile True:\r\n if day % m == 0:\r\n n += 1\r\n n -= 1\r\n if n == 0:\r\n break\r\n\r\n day += 1\r\n\r\nprint(day)", "n,m=map(int,input().split())\r\na=0\r\nwhile True:\r\n new=n//m\r\n vis=new*m\r\n n=n-vis+new\r\n if vis==0:\r\n a+=n\r\n break\r\n a+=vis\r\nprint(a)", "n,m=map(int,input().split())\na=0\nwhile True:\n new=n//m\n vis=new*m\n n=n-vis+new\n if vis==0:\n a+=n\n break\n a+=vis\nprint(a)\n\t \t\t \t \t\t \t\t\t\t \t\t\t \t", "a = [int(i) for i in str(input()).split()]\r\n \r\nresult = a[0] + ((a[0]-1)//(a[1]-1))\r\n \r\nprint(result)", "x, y = map(int, input().split())\r\nday = 0\r\nwhile x > 0 :\r\n x -= 1 \r\n day += 1\r\n if day % y == 0:\r\n x += 1\r\nprint(day)\r\n", "N,M=map(int,input().split())\np=0\nwhile N>0 :\n N-=1\n p+=1\n if p%M==0 : N+=1\nprint(p)\n", "testInput = input()\r\ntestArray = testInput.split(\" \")\r\nstartingSocks = int(testArray[0])\r\nmDays = int(testArray[1])\r\ndays = 0\r\n\r\nwhile startingSocks != 0:\r\n startingSocks -= 1\r\n days += 1\r\n if (days%mDays == 0):\r\n startingSocks += 1\r\n\r\nprint(days)", "import math\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\n \r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n \r\ndef readint():\r\n return int(input())\r\n \r\n \r\n\r\nn, m = readarray(int)\r\n\r\n\r\nans = 0\r\n\r\ni = 1\r\n\r\nwhile i <= n:\r\n\r\n if i % m == 0:\r\n n += 1\r\n \r\n ans += 1\r\n\r\n i += 1\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nr = 0\r\n\r\nwhile n > 0:\r\n r += 1\r\n if r % m != 0:\r\n n -= 1\r\n\r\nprint(r)\r\n", "inputs = list(map(int, input().strip().split()))\r\nn = inputs[0]\r\nm = inputs[1]\r\nrow = n\r\ndivide = 0\r\nprev = 0\r\nresult = n\r\nextra = 1\r\nwhile(extra):\r\n divide = row // m\r\n extra = divide - prev\r\n prev = divide\r\n result += extra\r\n row += extra\r\nprint(result) \r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/460/A\r\n\r\ndef main():\r\n n, m = map(int, input().split(' '))\r\n day = 0\r\n while n > 0:\r\n day += 1\r\n n -= 1\r\n if day % m == 0:\r\n n += 1\r\n print(day)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "##У Васи есть n пар носков. Утром каждого дня, собираясь в школу,\r\n##Вася должен надеть пару носков. Вечером, прийдя со школы, Вася снимает\r\n##надетые носки и выбрасывает их. Каждый m-й день (в дни с номерами m, 2m, \r\n##3m, ...) мама покупает Васе одну пару носков. Она делает это поздно вечером,\r\n##поэтому Вася может надеть новые носки не раньше следующего дня. На сколько\r\n##подряд идущих дней Васе хватит носков?\r\n##В единственной строке записано два целых числа n и m\r\n##(1 ≤ n ≤ 100; 2 ≤ m ≤ 100),разделенные пробелом.\r\n##Выведите единственное целое число — ответ на задачу.\r\nn,m=map(int,input().split())\r\na=0\r\nb=0\r\nwhile n>a:\r\n n-=1\r\n b+=1\r\n if b%m==0:\r\n n+=1\r\nprint(b)\r\n \r\n \r\n", "a,b = input().split()\na,b = int(a), int(b)\ns = 1\nwhile a >0:\n\ta-=1\n\ta+=1 * (s%b == 0)\n\t#print(a,s)\n\ts+=1\nprint(s-1)", "n, m = map(int, input().split(\" \"))\r\nprint(n + int((n-1)/(m-1)))", "A=input().split()\r\na=int(A[0])\r\nb=int(A[1])\r\nprint(((a-1)//(b-1))*b+1+(a-1)%(b-1))", "# t = int(input())\nimport math\n\na, b = map(int, input().split())\ns = a + int(a / (b - 1))\nif a % (b - 1) == 0:\n s -= 1\nprint(s)\n# while t != 0:\n# t -= 1\n", "n,m=map(int,input().split())\ns=n\ns1=0\nwhile n>0:\n if s1==m:\n s+=1\n s1=1\n s1+=1\n n-=1\nif s1==m:\n s+=1\nprint(s)\n", "ins = list(map(int,input().split()))\r\ncon = 0\r\nwhile ins[0] > 0:\r\n ins[0]-=1\r\n con+=1\r\n if con%ins[1] == 0:\r\n ins[0]+=1\r\nprint(con)", "n, m = list(map(lambda x : int(x), input().split(' ')))\nprint(n + (n - 1) // (m - 1))", "n,m=map(int,input().split())\r\nc=n\r\nd=0\r\ni=n//m\r\nwhile(n!=0):\r\n d=i\r\n c=n+d\r\n i=c//m \r\n if i==d:\r\n print(c)\r\n break", "def calculate_days(n, m):\r\n return n + ((n - 1) // (m - 1))\r\n\r\nn, m = map(int, input().split())\r\n\r\nresult = calculate_days(n, m)\r\nprint(result)\r\n", "a,b = map(int,input().split())\r\nk = 0\r\nwhile a > 0:\r\n a = a-1\r\n k += 1\r\n if k % b == 0:\r\n k += 1\r\nprint(k)\r\n", "def main():\r\n (socks, new_socks) = input().split()\r\n days = 0\r\n while int(socks) != 0:\r\n days += 1\r\n socks = int(socks) - 1\r\n if days % int(new_socks) == 0:\r\n socks += 1\r\n print(days)\r\nmain()", "n,m=map(int,input().split())\r\ndays=0;oper=1\r\nwhile n>0:\r\n days+=1\r\n n-=1\r\n if oper%m==0:n+=1\r\n oper=(oper+1)%m\r\nprint(days)", "n, m = map(int, input().split())\r\ns = 0\r\nwhile n > 0:\r\n s+=1\r\n n = n - 1\r\n n = n + 1 if s%m==0 else n\r\nprint(s)", "a,b = input().split()\r\na = int(a)\r\nb = int(b)\r\nsum1 = 0\r\ns = a + a//b\r\nfor i in range(a+1,s+1):\r\n if i % b == 0:\r\n s += 1\r\n if s % b == 0:\r\n s += 1\r\nprint(s)\r\n", "n,m=[int(x) for x in input().split()]\r\nday=0\r\nwhile True:\r\n if n==0:\r\n print(day)\r\n break\r\n day+=1\r\n n-=1\r\n if day%m==0: n+=1", "n, m = map(int,input().split())\r\n\r\nx = n\r\n\r\nwhile x>0:\r\n\tx -= m\r\n\tif x>=0:\r\n\t\tn += 1\r\n\t\tx += 1\r\n\r\nprint(n)", "a,b = map(int, input().split())\r\nc =int((a-1)/(b-1))\r\nprint(a+c)", "\r\nn, m = map(int, input().split())\r\nt = 0\r\nk = m\r\nwhile n!=0:\r\n n = n-1\r\n t = t+1\r\n if t == m:\r\n n = n+1\r\n m =m+k\r\nprint(t)", "n,m = map(int, input().split())\r\nx = n+((n-1)//(m-1))\r\n\r\nprint(x)", "n,m = map(int, input().split())\r\nx = (n-1) // (m-1)\r\nprint(n + x)", "import sys\r\ninput = sys.stdin.readline\r\nwrite = sys.stdout.write\r\nn, m = (int(x) for x in input().split())\r\ndays_counter = 0\r\nnumber_of_socks = n\r\nworn_socks = 0\r\nwhile number_of_socks > 0:\r\n\tnumber_of_socks -= 1\r\n\tdays_counter += 1\r\n\tif days_counter % m == 0:\r\n\t\tnumber_of_socks += 1\r\nwrite(str(days_counter))", "x = input().split()\r\nsocks = int(x[0])\r\nm = int(x[1])\r\ndays = 1\r\n\r\nb1 = False\r\nwhile b1==False:\r\n socks -= 1\r\n if socks <= 0 and days % m != 0:\r\n print(days)\r\n break\r\n if days % m == 0:\r\n socks += 1\r\n days+=1\r\n \r\n\r\n", "inp = list(map(int,input().split()))\r\nn,m = inp[0],inp[1]\r\nleft_socks = n\r\nj = 0\r\nday = 0\r\n\r\nwhile left_socks>0:\r\n j+=1\r\n left_socks-=1\r\n \r\n if j%m==0:\r\n left_socks+=1\r\n day+=1\r\n else:\r\n day+=1\r\n continue\r\n \r\nprint(day)", "n, m = map(int, input().split())\r\nday=0\r\nwhile n > 0:\r\n day+=1\r\n n-=1\r\n if day % m == 0:\r\n n+=1\r\nprint(day)\r\n", "import math\r\n\r\nn, m = map(int, input().split())\r\noriginal_n = n\r\narr1 = []\r\ncount = 0\r\nsocks_created = 0\r\n\r\nif n == m:\r\n print(n + 1)\r\nelif n < m:\r\n print(n)\r\nelse:\r\n while True:\r\n if n>0:\r\n n = n-m\r\n count+=m\r\n if count == m:\r\n count = 0\r\n n = n + 1\r\n if n <= 0:\r\n break\r\n socks_created+=1\r\n print(original_n+socks_created)\r\n", "n, m = map(int, input().split())\r\n\r\n# Calculate the total number of days Vasya can wear socks before running out\r\n# The formula is n + (n-1) // (m-1) because every (m-1) pairs, Vasya needs to wash and dry one pair.\r\nresult = n + (n - 1) // (m - 1)\r\n\r\nprint(result)", "n, m = map(int, input().split())\n\navl_socks = n\ncount = 0\nwhile (avl_socks > 0):\n avl_socks -= 1\n count += 1\n if (count % m == 0):\n avl_socks += 1\nprint(count)\n", "n , m = map(int , input().split())\r\nA1 = n\r\ncount=0\r\nfor i in range(1,100000):\r\n A1=A1-1\r\n count+=1\r\n if i%m==0:\r\n A1+=1\r\n if A1==0:\r\n break\r\nprint(count)", "n,m=map(int,input().split())\r\nans=n\r\nwhile(n>=m):\r\n ans+=n//m\r\n n=n%m + n//m\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nx=0\r\nwhile a>0:\r\n a-=1\r\n x+=1\r\n if x%b==0:\r\n a+=1\r\nprint(x)", "n,m=map(int,input().split(\" \"))\r\ndays=1\r\nwhile n!=0:\r\n n-=1\r\n if days%m==0:\r\n n+=1\r\n days+=1\r\nprint(days-1)", "n = input().split()\r\ncount = int(n[0])\r\nday = int(n[1])\r\ndays = 0\r\nwhile count > 0:\r\n count -= 1\r\n days += 1\r\n if days % day == 0:\r\n count += 1\r\nprint(days)", "stock, m = map(int, input().split())\r\nrestock_it = 1\r\nday = 0\r\n\r\nwhile stock:\r\n day += 1\r\n if day == restock_it * m:\r\n restock_it += 1\r\n stock += 1\r\n stock -= 1\r\n\r\nprint(day)", "q, w = map(int, input().split())\r\ne = 0\r\nwhile q > 0:\r\n q -= 1\r\n e += 1\r\n if e % w == 0 and e != 0:\r\n q += 1\r\nprint(e)", "def solution():\n sock_count, period = [int(x) for x in input().split()]\n\n day_count = 0\n while True:\n if sock_count == 0:\n print(day_count)\n break\n\n sock_count -= 1\n day_count += 1\n\n if day_count % period == 0:\n sock_count += 1\n\n\nif __name__ == \"__main__\":\n solution()\n", "a, b = map(int,input().split())\r\nprint((a - 1)//(b - 1) + a)", "a, b=map(int,input().split())\r\ns=0\r\nwhile a>=b:\r\n a+=1-b\r\n s+=b\r\ns+=a\r\nprint(s)\r\n", "n, m = map(int, input().split())\r\ndays = n\r\nwhile n//m > 0:\r\n temp = n%m\r\n n = n//m\r\n days += n\r\n n += temp\r\nprint(days)\r\n", "# @name: vasya_and_socks\r\n# @author: AbrarShakhi\r\n# @link: https://codeforces.com/problemset/problem/460/A\r\n\r\ndef solution():\r\n n, m = map(int, input().split())\r\n days = 0\r\n while n > 0:\r\n days += 1\r\n n -= 1\r\n if days % m == 0:\r\n n += 1\r\n\r\n print(days)\r\n\r\n\r\ndef main():\r\n t = 1\r\n # t = int(input())\r\n while t > 0:\r\n solution()\r\n t -= 1\r\n\r\n\r\nmain()", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(1, n+1):\r\n a.append(i)\r\ni = 0\r\nwhile i < len(a):\r\n if i%m == 0:\r\n a.append(a[-1]+1)\r\n i +=1\r\nprint(a[-1]-1)", "n,m = tuple(map(int,input().split()))\r\ndaysLeft = n\r\ndays = 0\r\nwhile daysLeft != 0:\r\n days += 1\r\n if (days % m == 0):\r\n daysLeft += 1\r\n daysLeft -= 1\r\nprint(days)", "import math\r\nn,m=map(int,input().split())\r\nprint(math.floor(n+((n-1)/(m-1))))", "a,b=list(map(int,input().split()))\r\ng=0\r\nwhile(a>0):\r\n a-=1\r\n g+=1\r\n if g%b==0:\r\n a+=1\r\nprint(g)", "socks, day_mother = map(int, input().split())\r\nday = 0\r\n\r\nwhile socks > 0:\r\n socks -= 1\r\n day += 1\r\n \r\n if not day % day_mother:\r\n socks += 1\r\n\r\nprint(day)", "n,m = map(int,input().split())\r\nq,d = divmod(n,(m-1))\r\nans = q*m+d\r\nif not d:\r\n ans -=1\r\nprint(ans)\r\n", "socks, interval = [int(i) for i in input().split()]\r\ndays = 0\r\nwhile socks:\r\n socks -= 1\r\n if (days + 1) % interval == 0:\r\n socks += 1\r\n days += 1\r\nprint(days)", "def solution():\r\n n, m = map(int, input().split())\r\n ct = 0\r\n while n > 0:\r\n ct += 1\r\n n -= 1\r\n\r\n if ct % m == 0:\r\n n += 1\r\n print(ct)\r\n\r\n\r\n# T = int(input())\r\n# for i in range(T):\r\nsolution()", "n, m = map(int, input().split())\r\ncount = 0\r\nday = 0\r\nwhile n != 0:\r\n count += 1\r\n day += 1\r\n n -= 1\r\n if day == m:\r\n n += 1\r\n day = 0\r\nprint(count)", "z = input()\r\nz = z.split()\r\nz = [int(x) for x in z]\r\nn, m = z\r\nd = 0\r\nwhile n > 0:\r\n n -= 1\r\n d += 1\r\n if d % m == 0:\r\n n += 1\r\n\r\nprint (d)", "col_nosk,m=map(int,input().split())\r\ndni=0\r\nwhile col_nosk>0:\r\n dni+=1\r\n if dni%(m)==0:\r\n col_nosk+=1\r\n \r\n col_nosk-=1\r\nprint(dni)", "p=[int(x) for x in input().split()]\r\nprint(p[0]+(p[0]-1)//(p[1]-1))", "n,m = map(int,input().split())\r\ni=1\r\nwhile(m*i<=n):\r\n n+=1\r\n i+=1\r\nprint(n)", "n, m = [int(i) for i in input().split()]\r\na = 0\r\nwhile n > 0:\r\n a += 1\r\n n -= 1\r\n if a % m == 0:\r\n n += 1\r\nprint(a)", "n,m = map(int,input().split())\r\n\r\nans = 0\r\nwhile n:\r\n ans += 1\r\n n -= 1\r\n if ans%m == 0:\r\n n += 1\r\n\r\nprint(ans)", "a, b = map(int, input().split())\ni=1\nwhile b*i <= a:\n a += 1\n i += 1\nprint(a)\n\n\t\t \t \t\t \t \t \t\t\t\t \t \t \t", "n, m = map(int,input().split())\r\nx = 0\r\nwhile n!=0:\r\n n-=1\r\n if x%m==0:\r\n n+=1\r\n x+=1\r\nprint(x-1)", "\r\na, b = map(int,input().split())\r\ncount = 0 \r\n\r\nfor i in range(a) : \r\n count +=1 \r\n if ( count % b == 0 ) : \r\n count +=1 \r\n \r\n\r\nprint (count)\r\n\r\n", "#take input\r\n\r\np, q = list(map(int, input().split()))\r\n#cnt\r\n\r\ncnt = p\r\n#use while loop\r\nwhile p >= q:\r\n cnt += (p // q)\r\n #method\r\n p = ((p // q) + (p % q))\r\nprint(cnt)", "socks, m = map(int, input().split())\r\nday = 1\r\nwhile socks > 0:\r\n if day % m == 0:\r\n socks +=1\r\n socks -= 1\r\n day += 1\r\nprint(day - 1)", "x,y=list(map(int,input().split()))\r\ntotal=x\r\nwhile(x>=y):\r\n a=x//y\r\n total=total+a\r\n r=x%y\r\n x=a+r\r\nprint(total) ", "i = input()\r\nx = i.split(\" \")\r\nn = int(x[0])\r\nm = int(x[1])\r\nused = 0\r\nwhile used < n:\r\n used += 1\r\n if used % m == 0:\r\n n += 1\r\n\r\nprint(n)", "x,y=map(int,input().split())\r\ni=y\r\nwhile(i!=x+1 and i<x+1):\r\n if i%y==0:\r\n x=x+1\r\n i=i+1\r\nprint(x)", "nint, mint = input().split()\r\nn = int(nint)\r\nm = int(mint)\r\nt = 0\r\ni = 0\r\nwhile t < n:\r\n i += 1\r\n t += 1\r\n if (i % m == 0):\r\n n += 1\r\nprint (i)", "def f(n,m):\r\n i = 0\r\n while n > 0:\r\n i += 1\r\n n -= 1\r\n if i%m == 0:\r\n n += 1\r\n\r\n return i\r\n\r\ninp = input()\r\ninp = [int(i) for i in inp.split()]\r\nprint(f(inp[0], inp[1]))", "n,m=map(int,input().split())\r\nd=0\r\nwhile True:\r\n if n==0:\r\n print(d)\r\n break\r\n d+=1\r\n n-=1\r\n if d%m==0:n+=1", "n,m = [int(i) for i in input().split()]\r\nif(n < m):\r\n print(n)\r\nelse:\r\n # s = n//m\r\n # result = (n+s)\r\n s = n + (n//(m-1))\r\n if(n%(m-1) == 0):\r\n s-=1\r\n print(s)\r\n", "def manage_socks(socks, days):\r\n current_days = 1\r\n socks -= 1\r\n while(socks > 0):\r\n current_days += 1\r\n socks -= 1\r\n if (current_days % days == 0):\r\n socks += 1\r\n print(current_days)\r\n\r\n\r\n\r\n\r\nsocks = \"\"\r\ndays = \"\"\r\n\r\ninput_string = input()\r\n\r\ni = 0\r\nwhile (input_string[i] != \" \"):\r\n socks += input_string[i]\r\n i+=1\r\ni+=1\r\nwhile (i < len(input_string)):\r\n days += input_string[i]\r\n i+=1\r\n\r\nmanage_socks(int(socks), int(days))", "a = list(map(int, input().split()))\r\nn = a[0]\r\nm = a[1]\r\nprint(n+((n-1)//(m-1)))", "l,p=map(int,input().split())\r\nprint(l+((l-1)//(p-1)))", "a,b=map(int,input().split())\r\nc=(a//b)+a%b\r\na=a+(a//b)\r\nwhile c//b!=0:\r\n a=a+(c//b)\r\n c=(c//b)+(c%b)\r\nprint(a)", "n,m=map(int,input().split())\r\noutput=0\r\nperiod_count=0\r\nwhile(n>0):\r\n n-=1\r\n output+=1\r\n period_count+=1\r\n if(period_count==m):\r\n period_count=0\r\n n+=1\r\nprint(output)", "n,m=map(int, input().split())\r\nt=0\r\nwhile n>0:\r\n n-=1\r\n t+=1\r\n if t%m==0:\r\n n+=1\r\nprint(t)\r\n", "n,m=map(int,input().split())\r\nc=0\r\nwhile(n>0):\r\n c+=1\r\n if c%m==0 and c!=0:\r\n n+=1\r\n n-=1\r\nprint(c)", "a, b = map(int,input().split())\r\ncount = b\r\ns = 0\r\nwhile a:\r\n s += 1\r\n a -= 1\r\n count -= 1\r\n if count == 0:\r\n a += 1\r\n count = b\r\nprint(s)", "n,m = map(int,input().split())\ni,new =1, False\nwhile i<=n:\n if i%m==0:n+=1\n i+=1\nprint(n)\n\t\t \t\t \t\t\t\t \t \t\t\t\t\t \t \t\t \t \t", "'''\r\n\r\nMrLantern21\r\n07.02.2023\r\nThis is problem 460A.\r\n\r\n'''\r\n\r\ndef single_integer():\r\n return int(input())\r\n \r\n \r\ndef multi_integer():\r\n return map(int, input().split())\r\n \r\n \r\ndef string():\r\n return input()\r\n \r\n \r\ndef multi_string():\r\n return input().split()\r\n \r\n \r\nn, m = multi_integer()\r\nans = 0\r\nwhile True:\r\n if n >= m:\r\n n = n - m + 1\r\n ans += m\r\n else:\r\n ans += n\r\n break\r\n \r\nprint(ans)", "n,m = map(int, input().split())\r\ni = 1\r\nwhile(n>0):\r\n if(i%m!=0):\r\n n = n-1\r\n else:\r\n pass\r\n i = i+1\r\nprint(i-1)", "p = input().split()\r\nn = int(p[0])\r\nm = int(p[1])\r\n\r\nif m - n > 0:\r\n print(n)\r\nelif m - n == 0:\r\n print(n + 1)\r\nelse:\r\n print((m*(n-1))//(m-1)+1)", "import math\r\nn, m = list(map(int,input().split()))\r\nans = 0\r\nwhile n>0:\r\n n-=1\r\n ans+=1\r\n if ans%m==0:\r\n n+=1\r\nprint(ans)", "x=input()\r\nl1=x.split(\" \")\r\nn=int(l1[0])\r\nm=int(l1[1])\r\ni=1\r\nwhile i<=n:\r\n if i%m==0:\r\n n+=1\r\n i+=1\r\nprint(n)\r\n", "pair_of_socks, days_buy_socks = map(int, input().split())\r\n\r\ndays = 0\r\ncounter = 0\r\n\r\nwhile (pair_of_socks != 0):\r\n counter += 1\r\n pair_of_socks -= 1\r\n if counter % days_buy_socks == 0:\r\n pair_of_socks += 1\r\n \r\n days += 1\r\n\r\nprint(days)", "n,m = map(int, input().split())\r\n\r\na = n // m\r\n\r\na3 = 1\r\nwhile a3 > 0:\r\n a2 = (n + a) // m\r\n a3 = a2-a\r\n a = a2\r\n\r\n \r\nprint(n+a2)\r\n\r\n", "n,m = map (int,input().split())\r\nans=0\r\nwhile n >= m : \r\n ans+=m\r\n n-=m\r\n n+=1\r\n \r\nprint(ans+n)\r\n", "x=list(input().split())\r\nn=int(x[0])\r\nm=int(x[1])\r\ni=0\r\nwhile n>0:\r\n n=n-1\r\n i+=1\r\n if i%m==0:\r\n n+=1\r\nprint(i)\r\n", "x, y = map(int, input().split())\r\ni = 1\r\nwhile i <= x:\r\n if i % y == 0:\r\n x += 1\r\n i += 1\r\nprint(x)\r\n\r\n", "socks, shopping_day = map(int, input().split())\r\ndays = 0\r\ni = 1\r\n\r\nwhile (socks > 0):\r\n socks -= 1\r\n days += 1\r\n if days == shopping_day * i:\r\n socks += 1\r\n i += 1\r\nprint(days)", "n, m = map(int, input().split())\r\nif n < m:\r\n print(n)\r\nelif n == m:\r\n print(n + 1)\r\nelse:\r\n count = 0\r\n while n != 0:\r\n n -= 1\r\n count += 1\r\n if count % m == 0:\r\n n += 1\r\n print(count)", "socks,buys=map(int,input().split())\r\ncount=0\r\nfor i in range(9999999999999999999):\r\n if socks==0:\r\n print(count)\r\n break\r\n socks-=1\r\n count+=1\r\n if (i+1)%buys==0:\r\n socks+=1", "n,m=map(int,input().split())\r\nmm=m\r\nd=n\r\ns=0\r\nwhile s<=n:\r\n s+=1\r\n if d>=mm:\r\n mm+=m\r\n d+=1\r\nprint(d)\r\n \r\n", "n, d=input().split()\r\nn, d=int(n), int(d)\r\nt=0\r\nt1=0\r\nwhile n>0:\r\n n=n-1\r\n t=t+1\r\n t1=t1+1\r\n while t==d:\r\n n=n+1\r\n t=0\r\nprint(t1)", "def main() -> int:\r\n n, m = tuple(int(x) for x in input().split(\" \"))\r\n days = 0\r\n while n:\r\n n -= 1\r\n days += 1\r\n if not days % m:\r\n n += 1\r\n\r\n return days\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())", "a,b = map(int,input().split())\r\nt = a\r\nwhile a>=b:\r\n t += a//b\r\n a = ((a//b)+(a%b))\r\nprint(t)", "\r\nfrom 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\nn,m=inp()\r\nans=0\r\nwhile n!=0:\r\n ans +=1\r\n n-=1\r\n if ans % m ==0:\r\n n+=1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nd = 0\r\n\r\nwhile n > 0:\r\n # Пока у нас есть носки\r\n \r\n d += 1\r\n n -= 1\r\n\r\n if d % m == 0:\r\n n += 1\r\n # Мама покупает нам носки! :D\r\n\r\nprint(d)\r\n", "n,m=map(int,input().split())\r\nd=1\r\nh=0\r\nwhile n!=0:\r\n n-=1\r\n h+=1\r\n if n<=0:\r\n break\r\n d+=1\r\n if d%m==0:\r\n n+=1\r\nprint(h)", "n,m=map(int,input().split())\r\nc=n+n//m\r\nj=1\r\ns=0\r\ni=1\r\nwhile True:\r\n if i==j*m:\r\n j+=1\r\n s+=1\r\n i+=1\r\n if(i>n+s):\r\n break\r\nprint(n+s)\r\n\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nx=n//m;d=0\r\nwhile x:\r\n x=n//m-d//m\r\n d=n\r\n n+=x\r\nprint(n)", "n,m=map(int,input().split())\r\nday=0\r\nwhile n>0:\r\n n-=1\r\n day+=1\r\n if day%m==0:\r\n day+=1 \r\nprint(day)", "#https://codeforces.com/problemset/problem/460/A\r\n\r\nimport sys\r\n\r\nN, M = sys.stdin.readline().split(\" \")\r\nN = int(N)\r\nM = int(M)\r\n\r\n#N amount of socks\r\n#M new socks\r\n\r\n#how many days before no socks\r\n#N >= 1 N <= 100\r\n#M >= 2 M <= 100\r\n\r\n#example:\r\n#N = 2\r\n#M = 2\r\n\r\n#day1 = socks - 1 \r\n#day2 = socks - 1 + 2\r\n#day3 = socks - 1\r\n\r\n#2 / 2 = 1\r\n#2 + 1 = 3\r\n\r\n#N = 9\r\n#M = 3\r\n#9 / 3 = 3\r\n#9 + 3 = 12\r\nclean_socks = True\r\nday_counter = 0\r\nsock_counter = N\r\nwhile clean_socks == True:\r\n day_counter += 1\r\n if day_counter % M == 0:\r\n sock_counter += 1\r\n sock_counter -= 1\r\n if sock_counter <= 0:\r\n clean_socks = False\r\n \r\nprint(day_counter)\r\n\r\n", "n,m = input().split()\r\na=int(n)+int(n)//int(m)\r\nb=0\r\nwhile (a%int(m)!=0 or a%int(m)==0) and b!=a:\r\n b=a\r\n a=int(n)+a//int(m)\r\nprint(a)", "a, b = map(int,input().split())\r\nc = a\r\nwhile(a >= b):\r\n\tc = c + (a // b)\r\n\ta = ((a// b) + (a % b))\r\nprint(c)\r\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\nif m>n:\r\n print(n)\r\nelse:\r\n print(int(n + (n-m)/(m-1) + 1))", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Vasya and Socks\"\r\n# Class: A\r\n\r\nimport sys\r\n\r\n#sys.setrecursionlimit(2147483647)\r\ninput = sys.stdin.readline\r\ndef printf(*args, end='\\n', sep=' ') -> None:\r\n sys.stdout.write(sep.join(map(str, args)) + end)\r\n\r\ndef Solve():\r\n n, m = list(map(int, input().split()))\r\n x = 0 ; ans = 0\r\n while n:\r\n ans+=1\r\n n-=1\r\n x+=1\r\n if x%m==0:\r\n n+=1\r\n \r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # for t in range(int(input())):\r\n Solve()", "p,d=map(int,input().split())\r\nc,ans=1,0\r\nwhile p:\r\n if c==d:\r\n p+=1\r\n c=0\r\n else:\r\n ans+=1\r\n p-=1\r\n c+=1\r\nprint(ans)", "n, m = input().split()\nn = int(n)\nm = int(m)\ncnt_dnei=0\ni=0\nwhile i<n:\n cnt_dnei=cnt_dnei+1\n if (i+1)%m==0:\n n=n+1\n i=i+1\nprint(cnt_dnei)\n", "w,m=map(int,input().split())\r\nprint(w+((w-1)//(m-1)))", "n,m=map(int,input().split())\r\nprint(int(n+(abs((n-1)/(m-1)))))\r\n", "i, m = map(int,input().split())\r\ncount = i\r\nday = 1\r\nwhile count >= 1:\r\n count -= 1\r\n if day % m == 0:\r\n count += 1\r\n if count == 0:\r\n break\r\n day += 1\r\nprint(day)", "a , b =map(int ,input().split())\r\nprint(( a -1 )//( b -1 ) +a)", "pehlese,newbuy=input().split()\r\npehlese=int(pehlese)\r\nnewbuy=int(newbuy)\r\nif pehlese==0: print(0)\r\nelse: \r\n ogbuy=pehlese+(pehlese-1)//(newbuy-1)\r\nprint(ogbuy)\r\n", "ints = input().split(' ')\r\nn, m = [int(x) for x in ints]\r\ncnt = n\r\n\r\nwhile n >= m:\r\n cnt += n // m\r\n n = n // m + n % m\r\n\r\nprint(cnt)", "stock, m = map(int, input().split())\nrestock_it = 1\nday = 0\n\nwhile stock:\n day += 1\n if day == restock_it * m:\n restock_it += 1\n stock += 1\n stock -= 1\n\nprint(day)\n \t \t\t\t \t\t\t \t \t \t\t\t\t\t\t", "n,m=map(int,input().split())\r\ny= n+(n-1)//(m-1)\r\nprint(y)\r\n\r\n", "x,y=map(int,input().split())\r\nc=0\r\nwhile x>0:\r\n c+=1\r\n x-=1\r\n if (c + y) % y == 0:\r\n x+=1\r\nprint(c)\r\n", "n,m=map(int,input().split())\r\nc = n\r\nj = 1\r\nwhile c != 0:\r\n if j%m == 0 and j / m>= 1:\r\n c -=1\r\n c+= 1\r\n else:\r\n c -= 1\r\n j += 1\r\nprint(j - 1)\r\n\r\n", "#460A Vasya and Socks\r\na,b=map(int,input().split())\r\nc=a\r\nwhile a>=b:\r\n c+=a//b\r\n a=((a//b)+(a%b))\r\nprint(c)", "n, m = list(map(int, input().split()))\r\n\r\ncount = n\r\nwhile n >= m:\r\n count += (n // m)\r\n n = ((n // m) + (n % m))\r\nprint(count) ", "[n , m] = input().split()\r\nn = int(n)\r\nm = int(m)\r\nsum = n\r\nwhile n > 0 :\r\n if n < m:\r\n break\r\n p = n // m\r\n k = p * m\r\n n = n - k + p\r\n sum += p\r\nprint(sum)", "\r\nn,m=input(\"\").split()\r\nn=int(n)\r\nm=int(m)\r\ni=n\r\nwhile i-(i//m)!=n:\r\n i+=1 \r\nprint(i)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ncount = n\r\ni = m\r\nwhile i <= count:\r\n count += 1\r\n i += m\r\nprint(count)", "n,m=map(int, input().split())\r\nx = n\r\nwhile(x>1):\r\n x = x/m\r\n n = n+x\r\nprint(int(n)) ", "n,k=([int(x) for x in input().split()])\r\ni=1\r\na=n\r\nwhile a>0:\r\n if i%k==0:\r\n a=a+1\r\n i=i+1\r\n a=a-1\r\nprint(i-1)", "[n, k] = list(map(int, input().split()))\r\nprint(n + (n - 1) // (k - 1))\r\n", "n,m = list(map(int, input().split()))\r\n\r\ndays = 0\r\ntemp = n\r\nwhile temp > 0:\r\n\tif temp >= m:\r\n\t\tdays += m\r\n\t\ttemp -= (m-1)\r\n\telse:\r\n\t\tdays += temp\r\n\t\ttemp -= m\r\n\r\nprint(days)", "n, m = map(int, input().split())\r\ns_number = n\r\nday_counter = 0\r\nwhile s_number:\r\n day_counter += 1\r\n s_number -= 1\r\n if not day_counter % m:\r\n s_number += 1\r\nprint(day_counter)\r\n", "socks, mama_day = map(int, input().split())\r\nday = 0\r\nwhile socks > 0:\r\n socks -= 1\r\n day += 1\r\n if day % mama_day == 0:\r\n socks += 1\r\nprint(day)", "n, m=[int(x) for x in input().split()]\r\nch=0\r\nc=0\r\nwhile n>0:\r\n c+=1\r\n n-=1\r\n ch+=1\r\n if ch==m:\r\n n+=1\r\n ch=0\r\nprint(c)", "n, m = [int(i) for i in input().split()]\r\nl = n\r\nd = 1\r\nwhile n != 0:\r\n n-=1\r\n if d%m == 0:\r\n n+=1\r\n l+=1\r\n d+=1\r\nprint(l)", "[n,m] = map(int, input().split())\ncounter = 1\n\nwhile n > 0:\n n -= 1\n if counter % m == 0:\n n += 1\n counter += 1\n\nprint(counter - 1)", "numAndDay = [int(a) for a in input().split()]\r\n\r\nnum = numAndDay[0]\r\n\r\nday = numAndDay[1]\r\n\r\ndays = 0\r\n\r\nwhile num > 0:\r\n num -= 1\r\n days += 1\r\n if days % day == 0:\r\n num +=1\r\n\r\nprint(days)", "n, m = [int(i) for i in input().split()]\r\nc = n\r\ni = 0\r\nwhile c > 0:\r\n\ti += 1\r\n\tif i % m == 0:\r\n\t\tc += 1\r\n\tc -= 1\r\n\r\nprint(i)", "n, m = map(int, input().split())\r\ndays = 0\r\ni = 1\r\nwhile n > 0:\r\n n -= 1\r\n days += 1\r\n if days == m * i:\r\n n += 1\r\n i += 1\r\nprint(days)", "x, m = map(int, input().split())\r\nd = 0\r\nwhile x>0:\r\n x-=1\r\n d+=1\r\n\r\n if d % m == 0:\r\n x += 1\r\nprint(d)", "n,m = [int(i) for i in input().split()]\r\nres = (n-1)//(m-1)\r\nprint(n+res)", "n,m=map(lambda x: int(x), input().split())\r\ni=1\r\nwhile i<n:\r\n i+=1\r\n if i%m==0:\r\n n+=1\r\nprint(i)", "n,m=map(int,input().split())\r\nans=0\r\nday=0\r\nwhile n:\r\n n-=1\r\n ans+=1\r\n day+=1\r\n if day%m==0:\r\n n+=1\r\nprint(ans)", "s = input().split()\r\nn, m = int(s[0]), int(s[1])\r\nday = 1\r\nwhile n > 0:\r\n n -= 1\r\n if day % m == 0 and day != 0:\r\n n += 1\r\n day += 1\r\n\r\nprint(day-1)", "f=input().split()\r\nn=int(f[0])\r\nm=int(f[1])\r\ns=n\r\nk=0\r\nwhile s>0:\r\n s-=1\r\n k+=1\r\n if k%m==0:\r\n s+=1\r\nprint(k)", "n, m = map(int, input().split())\r\ncur_day = int(0)\r\nwhile True:\r\n if n == 0:\r\n print(cur_day - 1)\r\n break\r\n n -= 1\r\n if cur_day % m == 0:\r\n n += 1\r\n cur_day += 1\r\n", "def Vasya_and_Socks(n, m):\r\n answer = 0\r\n left = n\r\n while(left > 0): \r\n answer += 1\r\n left -= 1\r\n if(answer/m == answer//m):\r\n left += 1\r\n print(answer)\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n Vasya_and_Socks(n, m)\r\n ", "x=list(map(int,input().split(\" \")))\r\nn=x[0]\r\nm=x[1]\r\ni=1\r\nwhile n>0:\r\n if i%m==0:\r\n n+=1\r\n i+=1\r\n n-=1\r\nprint(i-1)", "n, m = [int(i) for i in input().split()]\r\nans = n + ((n-1) // (m-1))\r\nprint(ans)", "lst=list(map(int,input().rstrip().split()))\r\nn=lst[0]\r\nm=lst[1]\r\njj=1\r\nc=0\r\nc=c+n\r\nwhile True:\r\n if m*jj<=c:\r\n jj=jj+1\r\n c=c+1\r\n else:\r\n break\r\nprint(c)\r\n \r\n", "v,m=map(int,input().split())\r\nprint(v+((v-1)//(m-1)))", "n, m = map(int, input().split())\r\ns=n\r\nwhile n>=m:\r\n a=n//m\r\n s+=a\r\n n=n-a*m+a\r\nprint(s)", "n, m = map(int, input().split())\r\n\r\nmoves = 0\r\nwhile n != 0:\r\n n -= 1\r\n if moves % m == 0:\r\n n += 1\r\n moves += 1\r\n\r\nprint(moves - 1)", "socks,mama_day=map(int,input().split())\r\nday = 0\r\n\r\nwhile socks>0:\r\n socks-=1\r\n day+=1\r\n\r\n if day % mama_day ==0:\r\n socks+=1\r\n\r\nprint(day)\r\n \r\n", "n,m=map(int,input().split())\r\np=1\r\nd=0\r\nwhile(n>0):\r\n if(n>0):\r\n d=d+1\r\n n-=1\r\n if(d==p*m):\r\n n=n+1\r\n p=p+1 \r\nprint(d)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 10 15:15:08 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn, m = map(int, input().split())\r\nday = 1\r\nwhile True:\r\n if day % m == 0:\r\n n += 1\r\n n -= 1\r\n if n == 0:\r\n print(day)\r\n break\r\n day += 1", "a,b=map(int,input().split())\r\ni=1\r\nwhile(a>=b*i):\r\n\ta+=1\r\n\ti+=1\r\nprint(a)", "n,m = map(int, input().split())\r\nt = 0\r\nwhile n>0:\r\n t = t + 1\r\n if t%m==0:\r\n n = n + 1\r\n n = n - 1\r\nprint(t)\r\n", "n,m = map(int,input().split())\r\ni = 1\r\nwhile True:\r\n if i>n:\r\n break\r\n if i%m==0:\r\n n = n+1\r\n i = i+1\r\nprint(n)", "x,y=map(int,input().split())\r\nprint(x+((x-1)//(y-1)))\r\n", "import sys\nn, m = map(int, sys.stdin.readline().strip().split())\nprint(n + (n - 1) // (m - 1))", "# Dread it, run from it, destiny arrives all the same. \r\ndef solve(): \r\n n, m = map(int, input().split())\r\n\r\n res, cnt = 0, 0\r\n while True:\r\n if n > 0: \r\n res += 1\r\n n -= 1\r\n\r\n elif cnt > 0:\r\n res += 1\r\n cnt -= 1\r\n\r\n else: \r\n break\r\n\r\n if res%m == 0:\r\n cnt += 1\r\n\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\": \r\n # for _ in range(int(input())):\r\n # solve()\r\n solve()", "l=[int(i) for i in input().split()]\r\nn=l[0]\r\nm=l[1]\r\ndays=n\r\nrem=0\r\ntemp=n\r\nwhile(temp>0):\r\n temp1=days\r\n days+=temp//m\r\n rem+=temp%m\r\n if rem>m-1:\r\n days+=rem//m\r\n rem=rem%m\r\n temp=days-temp1\r\n\r\nprint(days)", "n,m = list(map(int, input().split()))\r\nday = 0\r\nwhile n>0:\r\n day+=1\r\n n-=1\r\n if day%m==0:\r\n n+=1\r\nprint(day)", "n,m = map(int, input().split())\r\nc = n\r\nwhile n>=m:\r\n a = n//m\r\n n = a + n % m\r\n c += a\r\nprint(c)", "n,m=map(int,input().split());c=0;ans=0\r\nwhile True:\r\n if c==m:n+=1;c=0\r\n if n==0:break\r\n n-=1;ans+=1;c+=1\r\nprint(ans)", "n,m=map(int,input().split())\r\ncount_=n\r\nwhile n!=0:\r\n if n>=m:\r\n count_+=n//m\r\n n=n//m+n%m\r\n \r\n else:\r\n break\r\nprint(count_)", "n,m=[int(i) for i in input().split()]\r\ndays=0\r\nwhile n!=0:\r\n\tdays+=1\r\n\tn-=1\r\n\tif days%m==0:\r\n\t\tn+=1\r\nprint(days)", "n , m = [int(n) for n in input().split()]\r\ntotal = n\r\nwhile n >= m:\r\n total += (n // m)\r\n n = ((n // m) + (n % m))\r\nprint(total)", "def days_until_out_of_socks(n, m):\r\n days = 0\r\n\r\n while n > 0:\r\n days += 1\r\n n -= 1 # Vasya puts on a pair of socks each day\r\n\r\n # Check if it's time for mom to buy new socks\r\n if days % m == 0:\r\n n += 1 # Mom buys a new pair of socks\r\n\r\n return days\r\n\r\n# Read input\r\nn, m = map(int, input().split())\r\n\r\n# Calculate and print the result\r\nresult = days_until_out_of_socks(n, m)\r\nprint(result)\r\n", "n,m = map(int, input().split());\r\nans = 0;i=1;temp = n;j=1;k=m\r\nwhile temp>0:\r\n ans+=1;\r\n temp-=1\r\n if(i==k):\r\n temp+=1\r\n j+=1\r\n k=m*j\r\n \r\n i+=1\r\nprint(ans)", "n,d=map(int,input().split())\r\nc=0\r\ni=1\r\nwhile(n>=0):\r\n # print(i,n,c)\r\n n-=1\r\n if(i%d==0):\r\n n+=1\r\n # print('----',i)\r\n c+=1\r\n if(n==0):\r\n break\r\n i+=1\r\n \r\nprint(c)", "n,m=map(int,input().split())\r\nday=0\r\n\r\nwhile n>0:\r\n n=n-1\r\n day+=1\r\n if day%m==0:\r\n n+=1\r\n \r\nprint(day) \r\n", "import sys\r\nimport math\r\nimport cmath\r\ninput = sys.stdin.readline\r\n\r\nn,m=map(int,input().split())\r\nans = 0\r\nrem = m\r\nwhile n:\r\n ans += 1\r\n n -= 1\r\n rem -= 1\r\n\r\n if rem == 0:\r\n n += 1\r\n rem = m\r\n\r\nprint(ans)", "n, m = input().split()\nn, m = int(n), int(m)\nday = 0\nwhile True:\n n -= 1\n day += 1\n if day % m == 0:\n n += 1\n if n <= 0:\n print(day)\n exit()\n \n", "n,m=list(map(int,input().split()))\r\nsum=n\r\nwhile(n>=m):\r\n sum=sum+n//m\r\n n=(n//m)+(n%m)\r\n\r\nprint(sum)", "n, m = map(int, input().split())\r\nans = 0\r\nwhile n > 0:\r\n\tn -= 1\r\n\tans += 1\r\n\tn += ans % m == 0\r\nprint(ans)", "n,m=list(map(int,input().rstrip().split()))\r\nans=0\r\nwhile n>0:\r\n n-=1\r\n ans+=1\r\n if ans%m==0:\r\n n+=1\r\nprint(ans)", "# Wadea #\r\n\r\nn,m = map(int,input().split())\r\nc = 1\r\nans = 0\r\nl = 1\r\nr = n\r\nans = n\r\nwhile n > 0:\r\n if l == c * m:\r\n c += 1\r\n n += 1\r\n ans += 1\r\n l += 1\r\n n -= 1\r\nprint((ans))", "n,m = input().split()\r\nn,m = int(n),int(m)\r\ncount = 0\r\nwhile(n>0):\r\n count = count + 1\r\n n = n - 1\r\n if((count%m)==0):\r\n n = n + 1\r\nprint(count) \r\n", "socks, mam_dey = map(int, input().split())\r\n\r\ndey = 0\r\nwhile socks>0:\r\n socks-=1\r\n dey += 1\r\n\r\n if dey % mam_dey == 0:\r\n socks+=1\r\n\r\nprint(dey)\r\n", "import math\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\ndays = n + (n // (m-1))\r\n\r\n# print(days)\r\nif days % m == 0:\r\n days -= 1\r\n\r\nprint(days)", "n, m = [int(x) for x in input().split()]\r\n\r\nans = n + int((n-1)/(m-1))\r\nprint(ans)", "n,m=[int(i) for i in input().split()]\r\nstorage=n\r\nday=1\r\nz=1\r\nwhile storage!=0:\r\n storage-=1\r\n day+=1\r\n if (day-1)%(z*m)==0:\r\n storage+=1\r\n z+=1\r\nprint(day-1)", "v,v1=map(int,input().split());print(v+((v-1)//(v1-1))) ", "arr = [int(i) for i in input().split()]\r\na, b = arr[0], arr[1]\r\nprint(a + int((a-1)/(b-1)))", "n,m = map(int,input().split())\r\ndays = 0\r\nwhile n != 0:\r\n days +=1\r\n n -= 1\r\n if days % m == 0:\r\n n += 1\r\nprint(days)", "n,k = map(int,input().split())\r\nc = n\r\nwhile n>=k:\r\n c = c + (n//k)\r\n n = (n//k) + (n%k)\r\nprint(c)", "#@sorcerer_21\nfrom collections import *\nimport sys,math\ninput=lambda:sys.stdin.readline().strip()\nmapin=lambda:map(int,input().split())\nn,m=mapin()\nprint(n+(n-1)//(m-1))\n \t \t\t \t\t\t\t \t\t\t \t\t\t \t\t", "n, m = map(int,input().split())\r\ndays = 0 \r\nmomes_day = 0\r\nwhile n > 0:\r\n n -= 1\r\n days += 1\r\n momes_day += 1\r\n if momes_day % m == 0:\r\n n += 1\r\nprint(days)", "# https://codeforces.com/problemset/problem/460/A\r\n\r\ndef solve(socks, m):\r\n days_remaining = socks\r\n while True:\r\n days_remaining, res = divmod(days_remaining, m)\r\n socks += days_remaining\r\n days_remaining += res\r\n if days_remaining < m:\r\n break\r\n return socks\r\n\r\nsocks, m = [int(e) for e in input().split()]\r\nprint(solve(socks, m))\r\n", "n, m = [int(x) for x in input().split()]\r\nans = 0\r\nwhile n > 0:\r\n ans += 1\r\n n -= 1 if ans % m != 0 else 0\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n HAD_SOCKS, BUY_CYCLE_DAY = map(int, input().split())\r\n\r\n maxConsecutiveDays:int = -1\r\n currentDay:int = 1\r\n leftSocksCount:int = HAD_SOCKS\r\n while leftSocksCount > 0 :\r\n leftSocksCount -= 1\r\n if currentDay%BUY_CYCLE_DAY == 0 :\r\n leftSocksCount += 1\r\n currentDay += 1\r\n maxConsecutiveDays = currentDay-1\r\n\r\n print(maxConsecutiveDays)\r\n\r\nmain()", "def helper(n,m):\r\n i=1\r\n while m*i<=n:\r\n n+=1\r\n i+=1\r\n \r\n print(n)\r\n \r\nn,m=list(map(int,input().split()))\r\nhelper(n,m)\r\n ", "n, m = [int(x) for x in input().split()]\r\nt = 0\r\ni = 1\r\nwhile n > 0:\r\n if i%m==0:\r\n n += 1\r\n n -= 1\r\n t += 1\r\n i += 1\r\nprint(t)", "s,b=(int(x) for x in input().split())\r\ncount=0\r\nwhile(s>0):\r\n count+=1\r\n s-=1\r\n if(count%b==0):\r\n s+=1\r\nprint(count)\r\n \r\n ", "def solve():\r\n n, m = map(int, input().split())\r\n ans = 0\r\n while n >= m:\r\n ans += m\r\n n -= m-1\r\n print(ans+n)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "# Name: Syed Faysel Ahammad Rajo\r\n# Date: November 22, 2021 @ 2:19 AM\r\n# CodeForces: 460A - Vasya and Socks\r\n\r\nn, m = [int(i) for i in input().split()]\r\n\r\n\r\ndays =n\r\nes2 = days//m\r\nes1 =0\r\n\r\nwhile True:\r\n es1 = es2\r\n days =n+es1\r\n es2 = days//m\r\n \r\n \r\n if es2==es1:\r\n print(days)\r\n break\r\n# Code executed on my terminal successfully \r\n\r\n# Note to self: It was really hectic for me. It took near 4-5 hours to think... Finally used the idea of swaping variables.\r\n", "n,m=map(int,input().split())\r\nday=0\r\nwhile n>0:\r\n n-=1\r\n day+=1\r\n if day % m == 0:\r\n n+=1\r\nprint(day)", "n,m=map(int,input().split())\r\nsocks=n\r\nday=0\r\ntry:\r\n while socks>0:\r\n day+=1\r\n socks-=1\r\n if day%m==0:\r\n socks+=1\r\n print(day)\r\nexcept:\r\n print(-1)", "sock, day = input().split(\" \")\nsocks = int(sock)\ndays = int(day)\n\ntotal = socks\n\nwhile socks >= days:\n\ttotal += (socks // days)\n\tsocks = ((socks // days) + (socks % days))\n\nprint(total)\n", "n,m=map(int,input().split())\r\ns=n\r\nwhile(n>=m):\r\n s+=n//m\r\n n=n//m+n%m\r\nprint(s)", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nn,m = getints()\r\nd = 0\r\nwhile n:\r\n d += 1\r\n n -= 1\r\n if d%m == 0:\r\n n += 1\r\nprint(d)", "n, m = [int(num) for num in input().split()]\r\ncount = 0\r\nstate = 0\r\nwhile n != 0:\r\n count += n\r\n state += n%m\r\n n = n//m\r\n n += state//m\r\n if state >= m:\r\n state = state%m\r\nprint(count)", "n, m = map(int, input() .split())\r\ncount = 0\r\nif 1 <= n <= 100 and 2 <= m <= 100:\r\n while n > 0:\r\n n = n - 1\r\n count += 1\r\n if count % m == 0:\r\n n += 1\r\n print(count)\r\nelse:\r\n print('error')", "n,m=map(int,input().split())\r\nprint(((n-1)//(m-1))+n)\r\n'''\r\n /\\___/\\\r\n꒰ ˶• ༝ - ˶꒱\r\n./づᡕᠵ᠊ᡃ࡚ࠢ࠘ ⸝່ࠡࠣ᠊߯᠆ࠣ࠘ᡁࠣ࠘᠊᠊°.~♡︎ 3baky\r\n'''\r\n\r\n", "def solve():\r\n n,m = list(map(int,input().split()))\r\n return n + (n-1)//(m-1)\r\nprint(solve())", "n,m=tuple(map(int,input().split()))\r\ncnt =n\r\nd=0\r\nwhile(cnt>0):\r\n if (d+1)%m!=0:\r\n cnt-=1\r\n d+=1\r\nprint(d)\r\n", "a = input().split()\r\nn = int(a[0])\r\nm = int(a[1])\r\ndays = 0\r\nwhile True:\r\n if n-m >= 0:\r\n days += m\r\n n -= m-1\r\n else:\r\n days += n\r\n break\r\nprint(days)\r\n", "a, b = [int(x) for x in input().split()];\r\nf = 1;\r\nc = 0;\r\nwhile b * f <= a:\r\n a += 1;\r\n f += 1;\r\nelse:\r\n print(a)", "a,b = map(int,input().split())\r\n\r\ncount = 0\r\ndays = 0\r\n\r\nwhile a>0:\r\n a-= 1\r\n days+=1\r\n count+=1\r\n if count == b:\r\n a+=1\r\n count=0\r\n else:\r\n a=a\r\nprint(days)", "n, m = list(map(int, input().split()))\r\na = [i for i in range(1,n+1)]\r\nb = [m]\r\n\r\nfor i in range(110):\r\n b.append(b[-1] + m)\r\n\r\nfor i in b: \r\n if(i <= a[-1]):\r\n a.append(a[-1]+1)\r\n else:\r\n break \r\n\r\nprint(len(a))", "n, m = map(int,input().split())\r\nx = 1\r\not = 0\r\nwhile n-1!=0:\r\n n-=1\r\n x+=1\r\n if x%m==0:\r\n n+=1\r\n ot+=1\r\nprint(ot+1)", "#Youssef Hassan\r\nn,m=(input().split(' '))\r\nc=0\r\nn=int(n)\r\nm=int(m)\r\nwhile n>=m:\r\n c=c+m\r\n n-=m\r\n n+=1\r\nprint(c+n)", "arr = [int(x) for x in input().split()]\r\n\r\ndef total(n, m):\r\n if n < m:\r\n return n\r\n else:\r\n return m + total(n - m + 1, m)\r\n \r\nprint(total(arr[0], arr[1]))", "a=list(map(int, input().split()))\r\nn=a[0]\r\nm=a[1]\r\nd=0\r\nwhile n>0:\r\n n-=1\r\n d+=1\r\n if d % m == 0:\r\n n+=1\r\nprint(d)\r\n", "a=input().split()\r\nn=int(a[0])\r\nn1=int(a[1])\r\na=int(n/n1)\r\nc=0\r\nwhile True:\r\n c=c+a\r\n n+=a\r\n a=int(n/n1)-c\r\n if a==0:\r\n print(n)\r\n break", "inp = input()\r\nhad = int(inp.split(' ')[0])\r\ndays = int(inp.split(' ')[1])\r\nweardays = 0\r\nweardays += had\r\ncnt = 0\r\nwhile True:\r\n cnt += 1\r\n if cnt * days <= weardays:\r\n weardays += 1\r\n else:\r\n break\r\nprint(weardays)", "n , m = map(int , input().split()) \r\nadd = n // m \r\ndayes =n \r\nwhile add : \r\n dayes+=1\r\n if dayes % m == 0 : \r\n add += 1\r\n add -= 1 \r\nprint(dayes)\r\n", "n,k=map(int,input().split())\r\nd=0\r\nfor i in range(1,300):\r\n if i%k==0:\r\n d+=1\r\n else:\r\n n-=1\r\n d+=1\r\n if n==0:\r\n break\r\nprint(d) ", "nAndm = [int(x) for x in input().split()]\r\nn = nAndm[0]\r\nm = nAndm[1]\r\n\r\nday = 0\r\n\r\nwhile(True):\r\n if n == 0:\r\n print(day)\r\n break\r\n n -= 1\r\n day += 1\r\n if day % m == 0:\r\n n += 1", "n,m = map(int, input().split())\r\n\r\nfor i in range(1,n+1):\r\n if m*i <= n:\r\n n+=1\r\n\r\nprint(n)\r\n", "n, m = map(int, input().split())\r\n\r\ncount = n\r\n\r\nwhile n >= m:\r\n count += (n // m)\r\n n = ((n // m) + (n % m))\r\n \r\nprint(count)", "n,m=map(int,input().split())\r\nt=0\r\nfor i in range(1,m*100):\r\n if i*m<=n:\r\n n+=1\r\nprint(n+t)", "n,m=map(int,input().split())\r\ns=n\r\nj=0\r\ndays=0\r\nwhile s!=0:\r\n s-=1\r\n days+=1\r\n j+=1\r\n if j==m:\r\n s+=1\r\n j=0\r\nprint(days)", "n,m=map(int,input().split(' '))\r\nk=0\r\np=0\r\nwhile n-1>=0:\r\n\tk+=1\r\n\tn-=1\r\n\tif m==k:\r\n\t\tn+=1\r\n\t\tk=0\r\n\t\r\n\tp+=1\r\nprint(p)", "a,b=map(int,input().split())\r\nk=0\r\nr=0\r\nwhile a>0:\r\n k=k+1\r\n r=r+1\r\n a=a-1\r\n if r==b:\r\n a=a+1\r\n r=0\r\nprint(k)\r\n \r\n\r\n \r\n", "n,m=map(int,input().split())\r\nd=0\r\ni=1\r\nwhile n>0:\r\n n-=1\r\n d+=1\r\n if d==m*i:\r\n n+=1\r\n i+=1\r\nprint(d)\r\n ", "n,m=map(int,input().split())\r\nsocks=n\r\ndays=0\r\nwhile n>0:\r\n n-=1\r\n if days%m==0:\r\n n+=1\r\n days+=1\r\nprint(days-1)", "a,b=map(int,input().split())\r\nh=0\r\no=a\r\nwhile o!=0:\r\n o-=1\r\n h+=1\r\n if h%b==0:\r\n o+=1\r\nprint(h)", "a,b=map(int,input().split())\r\n#b=int(input())\r\nr=a\r\ns=0\r\nwhile(True):\r\n p=r//b\r\n q=r%b\r\n s+=p\r\n r=p+q\r\n if p==0:\r\n break\r\nprint(a+s)", "n,m = list(map(int,input().split(' ')))\r\n\r\ni = 0\r\n\r\nwhile True:\r\n n-=1\r\n i+=1\r\n if i%m == 0:\r\n n+=1\r\n\r\n if n <=0:\r\n break\r\n\r\nprint(i)", "noski, m_day=map(int,input().split())\r\nday=0\r\nwhile noski>0:\r\n day+=1\r\n noski-=1\r\n if day%m_day==0:\r\n noski+=1\r\nprint(day)", "n,m=map(int,input().split())\r\nextra=n//m\r\nwhile extra!=((n+extra)//m):\r\n extra+=1\r\n\r\nprint(n+extra)\r\n", "n, m = map(int, input().split())\r\nprint(n + (n-1)//(m-1))", "from itertools import count\n\n\ndef f(n, m):\n for i in count(1):\n if n == 0:\n return i - 1\n if i % m != 0:\n n -= 1\n\n\nn, m = map(int, input().split())\nprint(f(n, m))\n", "n, m = map(int, input().split())\r\ns = 1\r\ni = 1\r\nwhile s:\r\n n -= 1\r\n if n < 0:\r\n s = 0\r\n break\r\n if i >= m and i % m == 0:\r\n n += 1\r\n i += 1\r\nprint(i - 1)\r\n", "s,m=map(int,input().split())\r\nprint(s+((s-1)//(m-1)))", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n,m = map(int, wtf[0].split())\r\n d = 1\r\n while n > 0:\r\n n -= 1\r\n if d%m == 0:\r\n n += 1\r\n d += 1\r\n print(d-1)\r\n", "x,y=map(int,input().split())\r\nres=(x-1)//(y-1)\r\nprint(x+res)\r\n\"\"\"\r\na=1\r\nfor i in range(100):\r\n if x>=(y*a):\r\n x+=1\r\n else:\r\n print(x)\r\n break\r\n a+=1\r\n\"\"\"", "def main():\r\n n, m = list(map(int, input().split()))\r\n\r\n k = 1\r\n while True:\r\n if k // m + n == k:\r\n print(k)\r\n return\r\n else:\r\n k += 1\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n,m = map(int,input().split())\r\nans = n+((n-1)//(m-1))\r\nprint(ans)", "n,m = input().split()\r\nsuma = int(n)+((int(n)-1)/(int(m)-1))\r\nprint(int(suma))\r\n\r\n\r\n\r\n\r\n\r\n", "# a=[1,2,3,4,5,6,7]\r\n# k=3\r\n# for i in range(k):\r\n# s=a[-1]\r\n# for i in range(len(a)-1,-1,-1):\r\n# a[i]=a[i-1]\r\n# a[0]=s\r\n# print(a)\r\nfrom math import floor\r\nn,m=map(int,input().split())\r\nprint(n+floor((n-1)/(m-1)))", "sock, day = map(int,input().split())\r\n\r\ntot = 0\r\n\r\nwhile sock > 0:\r\n tot += 1\r\n sock -= 1\r\n if tot%day == 0:\r\n sock += 1\r\n\r\nprint(tot)", "def main():\r\n [n, k] = list(map(int, input().split()))\r\n\r\n d = 0\r\n while n != 0:\r\n n -= 1\r\n d += 1\r\n\r\n if (d % k) == 0:\r\n n += 1\r\n\r\n print(d)\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n,m=map(int,input().split())\r\ncount=1\r\nsocks=n\r\nwhile socks!=0:\r\n socks-=1\r\n if count%m==0:\r\n socks+=1\r\n count+=1\r\nprint(count-1)\r\n ", "n,m = map(int,input().split())\r\nsteps = 0\r\nwhile n > 0:\r\n steps += 1\r\n if steps % m == 0:\r\n n += 1\r\n n -= 1\r\nprint(steps)\r\n", "a,b = map(int,input().split())\r\nlest = [int(aa) for aa in range(a)]\r\nfor x in lest :\r\n if x % b == 0 :\r\n lest.append(max(lest)+1)\r\nprint(max(lest))", "x=0\r\nans=0\r\nansw=[]\r\nn,m = map(int ,input().split())\r\nwhile n>0:\r\n ans+=1\r\n x+=1\r\n if x==m:\r\n n+=1\r\n x=0\r\n n-=1\r\nprint(ans)\r\n \r\n", "n, m = map(int, input().split())\r\nday_count = 0\r\nwhile n > 0:\r\n day_count += 1\r\n n -= 1\r\n if day_count % m == 0:\r\n n += 1\r\n # m *= day_count\r\nprint(day_count)\r\n", "n,m=list(map(int,input().split()))\r\nday=n\r\nwhile(n>=m):\r\n day+=n//m\r\n n=(n//m) + (n%m)\r\nprint(day)", "def socksuwu(n,m):\r\n count=0\r\n for i in range(1,10**3):\r\n \r\n while n-i>=0:\r\n count+=1\r\n break \r\n if i%m==0:\r\n n+=1 \r\n return count\r\nn=input()\r\nalist=[int(x) for x in n.split()]\r\nprint(socksuwu(alist[0],alist[1]))\r\n", "n,m=map(int,input().split())\r\nc=n\r\nwhile n>m-1:\r\n\tn/=m\r\n\tc+=n\r\nif c>int(c)+0.9:\r\n\tprint(round(c))\r\nelse:\r\n\tprint(int(c))\r\n\r\n", "n,m=map(int,input().split())\r\ndays=0\r\ni=1\r\nwhile(n>0):\r\n days+=1\r\n if i%m==0:\r\n pass\r\n else:\r\n n-=1\r\n i+=1\r\nprint(days)", "n,m=map(int, input().split())\r\ndef cout(total, newtotal):\r\n new=[n % m == 0 for n in list(range(total+1,newtotal+1))].count(True)\r\n if new==0 :\r\n return(newtotal)\r\n else:\r\n total=newtotal\r\n newtotal=newtotal+new\r\n return(cout(total, newtotal))\r\nprint(cout(n,(n+(n//m))))", "n,m=map(int,input().split())\r\nprint(n+ (n-1)//(m-1))", "socks,mama_day=map(int,list(input().split()))\r\nday=0\r\nwhile socks>0:\r\n day=day+1\r\n socks=socks-1\r\n if day%mama_day==0:\r\n day=day+1\r\nprint(day)", "n, m = list(map(int, input().split()))\r\ncount = 0\r\nwhile n > 0:\r\n\tn-=1\r\n\tcount+=1\r\n\tif count % m == 0: \r\n\t\tn+=1\r\n\r\nprint(count)", "n, m = list(int(num) for num in input().split())\r\n\r\nk0 = n // (m - 1)\r\nif n % (m - 1) != 0:\r\n k0 += 1\r\n\r\nx = n - (k0 - 1) * m + k0 - 1\r\nprint((k0 - 1) * m + x)", "n,m=map(int,input().split());print((n-1)//(m-1)+n)\r\n#", "n,m=map(int,input().split())\r\nres=(m-1)*n\r\nfin=res+(n-1)\r\nprint(fin//(m-1))", "# x = int(input())\n# \n# for q in range(x):\n\n\narr = list(map(int,input().split()))\n\na,b = arr[0],arr[1]\n\ndays = 0\ni=1\nwhile i<=a:\n if i%b==0:\n a+=1\n\n days+=1\n i+=1\n\nprint(days)\n\n\n", "n,m = map(int,input().split())\r\nx =int((n-1)/(m-1))\r\nprint (n+x)", "n, m = list(map(int, input().split(\" \")))\r\nc = 0\r\nk = m\r\nwhile n != 0:\r\n m -= 1\r\n n -= 1\r\n c += 1\r\n if m == 0:\r\n n += 1\r\n m = k\r\nprint(c)\r\n", "n, m = [int(i) for i in input().split()]\r\n\r\ni = 0\r\nif n < m:\r\n print(n)\r\nelif n == m:\r\n print(n+1)\r\nelse:\r\n while n >= 1:\r\n n -= 1\r\n i += 1\r\n if i%m == 0 and i != 1:\r\n n += 1\r\n print(i)", "n, m = map(int, input().split()) #n - пар носков у Васи, m - m, 2m, 3m\r\ni = 0\r\nwhile n!=0:\r\n n-=1\r\n i+=1\r\n for b in range(1, 101):\r\n if i == b*m:\r\n i+=1\r\nprint(i)\r\n", "s,r=map(int,input().split())\nd =1\n\n\nwhile True:\n if s ==0:\n print(d-1)\n quit()\n s-=1\n if d % r ==0:\n s+=1\n d+=1", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().strip().split())\r\ntotal_socks = n\r\nextra_days = n//m\r\nprevious_high = n//m\r\nwhile(extra_days>0):\r\n total_socks+=extra_days\r\n extra_days = (total_socks//m) - previous_high \r\n previous_high = total_socks//m\r\nstdout.write(f\"{total_socks}\\n\")", "n, m = map(int, input().split())\r\nc = 0\r\nwhile 0 < n:\r\n n -= 1\r\n c += 1\r\n if c%m == 0:\r\n n +=1\r\nprint(c) \r\n\r\n\r\n", "\nn, m = map(int, input().split())\nsum = n\nwhile n >= m:\n sum += (n // m)\n n = ((n // m) + (n % m))\nprint(sum)\n \t \t\t\t \t \t \t\t\t \t\t\t\t\t\t", "n, m = map ( int, input ( ).split () )\r\nc = 0\r\nwhile n >= m :\r\n\tn = n - m + 1\r\n\tc = c + m\r\nprint ( n + c ) ", "n, m = list(map(int,input().split()))\r\n\r\ncalcetines = n\r\ndias = 0\r\naux = 1\r\nwhile(calcetines > 0):\r\n dias += 1\r\n calcetines -= 1\r\n\r\n if(dias % m == 0):\r\n calcetines += 1\r\n\r\nprint(dias)\r\n \r\n \r\n", "n,m=map(int,input().split())\r\nx,c=n//m,0\r\nwhile c<n:\r\n c+=1\r\n if c%m==0: n+=1\r\nprint(n)\r\n ", "n,k=map(int,input().split())\r\ndays=0\r\nwhile n!=0:\r\n days+=1\r\n n-=1\r\n if days%k==0:\r\n n+=1\r\nprint(days)\r\n ", "n , m = map(int, input().split())\r\nr = n//m\r\nc = n + r \r\ni,j = 1,1 \r\ns =0\r\nwhile True:\r\n if i == j*m :\r\n j+=1 \r\n s +=1 \r\n i +=1 \r\n if i > n+s :\r\n break \r\nprint(i-1)\r\n \r\n \r\n \r\n ", "\r\n\r\n\r\ndef vasya_and_socks():\r\n\r\n\r\n socks,m = map(int,input().split())\r\n\r\n count = 0\r\n days = 0\r\n while socks:\r\n days += 1\r\n if days % m == 0:\r\n socks += 1\r\n socks -= 1\r\n\r\n\r\n print(days)\r\n\r\n\r\nvasya_and_socks()\r\n\r\n\r\n\r\n", "# ﷽\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\ndef inlst():return [int(i) for i in input().split()]\r\n\r\ndef solve():\r\n n,m=[int(i) for i in input().split()]\r\n tot=n\r\n tmp=m\r\n while tmp<=tot:\r\n tot+=1\r\n tmp+=m\r\n print(tot)\r\n\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "socks,mama_day=map(int,input().split())\r\nday=0\r\nwhile socks>0:\r\n socks-=1\r\n day+=1\r\n if day%mama_day==0:\r\n #print(f\"мама пришла на {day} день\")\r\n socks+=1\r\nprint(day)\r\n", "n , m = map(int,input().split())\r\ncount = 0\r\nwhile(n>0):\r\n n -=1\r\n count +=1\r\n if(count%m==0):\r\n n += 1\r\n\r\nprint(count)", "n,m=map(int,input().split())\r\nk=0\r\nif m>n:\r\n print(n)\r\nelse:\r\n while n>0:\r\n k+=1\r\n n-=1\r\n if(k%m==0):\r\n n+=1\r\n print(k)", "n,m = map(int,input().split())\r\nz = ((n-1)/(m-1))\r\nprint(int(n+z))", "a,b=map(int,input().split())\r\nm=0\r\nwhile a!=0:\r\n a-=1\r\n m+=1\r\n if m%b==0:\r\n a+=1\r\nprint(m)\r\n", "a = list(map(int,input().split()))\r\ncount = 0\r\nwhile(a[0]>0):\r\n a[0] = a[0] - 1\r\n count = count + 1\r\n if(count%a[1]==0):\r\n a[0] = a[0] + 1\r\nprint(count)", "n,m=map(int,input().split())\r\nc = 0\r\nwhile(n!=0):\r\n n = n - 1 \r\n c = c + 1\r\n if(c%m==0):\r\n n = n + 1\r\nprint(c)", "n , m = map(int,input().split())\r\ndays = 0\r\n\r\nwhile n!=0:\r\n \r\n days+=1\r\n \r\n if days%m==0:\r\n pass\r\n else:\r\n n-=1\r\n\r\nprint(days)", "n,m=[int(x) for x in input().split()]\r\nhave=n\r\nuse=0\r\nday=1\r\nwhile have>0:\r\n use+=1\r\n if day%m!=0:\r\n have=have-1\r\n day+=1\r\nprint(use)\r\n \r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nrooz = 0\r\ntedad_joorab = n\r\n\r\nwhile tedad_joorab != 0:\r\n rooz += 1\r\n tedad_joorab -= 1\r\n if rooz % m == 0:\r\n tedad_joorab += 1\r\n\r\nprint(rooz)\r\n", "a,b = list(map(int, input().split()))\nday=0\nwhile(a>0):\n day+=1\n a-=1\n if day%b==0:\n a+=1\nprint(day)\n\n\t\t\t \t\t\t \t \t\t \t\t \t \t\t\t \t\t \t", "s = input().split(\" \")\r\nn = int(s[0])\r\nm = int(s[1])\r\nt = 0\r\nwhile n>0:\r\n t += 1\r\n n -= 1\r\n if t % m == 0:\r\n n+=1\r\nprint(t) \r\n ", "n, m = map(int, input().split())\r\ntotal = 0\r\nwhile n >= m:\r\n total += m\r\n n -= m-1\r\nprint(total+n)", "n,m=map(int,input().split())\nres=(m-1)*n\nfin=res+(n-1)\nprint(fin//(m-1))\n\t \t \t\t \t\t \t\t\t \t\t\t", "initial, freq = [int(num) for num in input().split()]\nremaining = initial\n\ndays = 0\nwhile remaining >= freq:\n days += remaining - (remaining%freq)\n remaining = (remaining%freq) + remaining//freq\n\ndays += remaining\nprint(days)", "from fractions import Fraction as F\r\n\r\nn, m = map(int, input().split())\r\ntime = 0\r\n\r\nwhile n >= 1:\r\n time += 1\r\n n -= 1\r\n n += F(1, m)\r\n\r\nprint(time)", "a,b=list(map(int, input().split()))\r\ni=0\r\nwhile a!=0:\r\n a-=1\r\n if i%b==0: a+=1\r\n i+=1\r\nprint(i-1)", "n, m = [int(ele) for ele in input(\"\").split()]\r\n\r\ntotal = n\r\nrem = n\r\nwhile int(rem/m) > 0:\r\n\ttotal = total + int(rem/m)\r\n\r\n\trem = rem%m + int(rem/m)\r\n\r\nprint (total)", "a = list(map(int, input().split(\" \")))\r\nb = a[0] # socks\r\nc = a[1] # mom buys\r\nd = b # total\r\ne = 0 # count\r\nwhile d//c != e:\r\n if e == 0:\r\n e = d//c\r\n d += e\r\n else:\r\n d += 1\r\n e += 1\r\nprint(d)\r\n", "x,y=map(int,input().split())\r\na=x\r\nwhile x>=y:\r\n a+=x//y\r\n x=((x//y)+(x%y))\r\nprint(a)", "# Coded By Block_Cipher\r\n\r\nfrom collections import Counter\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\n# import HCF\r\n\r\nmis = 0\r\ncri = 0\r\n\r\n# for _ in range(int(input())):\r\nx,y = list(map(int,input().split()))\r\n\r\nfinal = ((x-1)//(y-1))+x\r\nprint(final)", "#460A\r\n\r\na,b = map(int,input().split())\r\nresults = (a-1)//(b-1)\r\nprint(a+results)\r\n", "l,m=map(int,input().split())\r\nprint(l+((l-1)//(m-1)))", "n,t = map(int,input().split())\r\ncount = 1\r\nwhile n+count > t * count:\r\n count += 1\r\nprint(n+count-1)", "nm = input().split()\r\nn = int(nm[0])\r\nm = int(nm[1])\r\ni = 0\r\nmc = 1\r\nn2 = 0\r\nc = 0\r\nwhile n != 0:\r\n n = n-1\r\n i = i+1\r\n if n == 0:\r\n n = i//m - c\r\n c = i//m\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(i)", "n, m = map(int, input().split())\r\n\r\nx = int((n * m) / (m - 1))\r\n\r\nif x % m == 0:\r\n\tprint(x - 1)\r\nelse:\r\n\tprint(x)", "import math\nn,m=input().split()\nn,m=int(n),int(m)\nc=n\nwhile n>=m:\n\tc+=n//m\n\tn=n//m + n%m\nprint(c)\n\n\n\n\t\t\t\n\n\n\n\n\t\t\t\t\t\n\t\n\n\n\n", "\r\ndef solve():\r\n\tn, m = map(int, input().split())\r\n\r\n\tcurr = n\r\n\tday = 1\r\n\r\n\twhile curr > 0:\r\n\t\tif day % m == 0:\r\n\t\t\tcurr += 1\r\n\t\tcurr -= 1\r\n\t\tday += 1\r\n\r\n\tprint(day-1)\r\n\r\n\r\nsolve()\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nfor i in range(1000000):\r\n if n <= 0:\r\n break\r\n n -= 1\r\n if i % m == 0:\r\n n += 1\r\n c += 1\r\nprint(c - 1)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\nif (n == m):\r\n print(n + 1)\r\nelif (n < m):\r\n print(n)\r\nelif (n > m):\r\n a = m\r\n while (m <= n):\r\n n += 1\r\n m += a\r\n \r\n print(n)", "n,m=input().split(); n,m=int(n),int(m)\r\np=n\r\nwhile n>=m:\r\n c=n//m\r\n p+=c\r\n n=n%m+c\r\nprint(p)\r\n \r\n \r\n \r\n\r\n", "n, m = map(int, input().split())\r\n\r\na = 0\r\nwhile n != 0:\r\n n -= 1\r\n if a % m == 0:\r\n n += 1\r\n a += 1\r\n \r\nprint(a - 1)", "x,y=map(int,input().split())\r\nc=y\r\na=0\r\nb=x\r\nwhile(c<=x):\r\n a=0\r\n if(c%y==0):\r\n a=a+1\r\n x=x+1\r\n c=c+y\r\nprint(x)\r\n", "l = list(map(int,input().split()))\r\nn = l[0]\r\nm = l[1]\r\nt = l[1]\r\nd = 0\r\nwhile n>0:\r\n n=n-1\r\n d=d+1\r\n if d==m:\r\n n=n+1\r\n m=m+t\r\nprint(d)", "n,m=map(int,input().split())\r\nc=1\r\nfor i in range(n):\r\n if c == m:\r\n c = 1\r\n n += 1\r\n c += 1\r\nprint(n)\r\n", "t,k=0,0\r\nn,m=map(int,input().split())\r\nwhile n>0:\r\n n-=1\r\n t+=1\r\n k+=1\r\n if k == m:\r\n k-=m\r\n n+=1\r\nprint(t)\r\n", "n,m = map(int, input().split())\r\nif m > n:\r\n print(n)\r\n exit()\r\ny = n\r\ni = 0\r\nq = 0\r\nt = n+m\r\nwhile n > 0:\r\n n-=1\r\n i+=1\r\n if i % m == 0:\r\n n+=1\r\nprint(i)", "t = input().split()\nn = int(t[0])\nm = int(t[1])\n\ndef lasts(n,m):\n days = 0 \n while n!=0:\n n = n-1\n days += 1\n if days%m == 0:\n n += 1\n return days\n\nprint(lasts(n,m))\n", "n,m = map(int, input().split())\r\ncd = 0\r\nwhile n > 0:\r\n cd += 1\r\n n -= 1\r\n if cd % m == 0:\r\n n += 1\r\nprint(cd)", "a,b=map(int,input().split())\r\nc=0\r\ni=1\r\nwhile a>0:\r\n if a>=b:\r\n a-=b\r\n c+=b\r\n a+=1\r\n else:\r\n c+=a\r\n a=0\r\n i+=1\r\nprint(c)", "n,m = [int(i) for i in input().split()]\nt = n\nwhile t>=m:\n z = t//m\n r = t%m\n n += z\n t = z + r\nprint(n)\n", "n, m = map(int, input().split())\r\nk = 0\r\nwhile n > 0:\r\n n = n - 1\r\n k += 1\r\n if k % m == 0:\r\n n = n + 1\r\nprint(k)", "a , b = map(int , input().split())\r\n\r\nsum=a\r\n\r\nwhile a>=b:\r\n \r\n sum = sum + a//b\r\n a= (a//b)+ (a%b)\r\n \r\n \r\nprint(sum)\r\n", "n, m = map(int, input().split())\r\n\r\ndays = n\r\nwhile n >= m:\r\n new_socks = n // m\r\n days += new_socks\r\n n = new_socks + n % m\r\n\r\nprint(days)\r\n", "n, m = map(int, input().split())\r\nc = 0\r\nwhile n != 0:\r\n n -= 1\r\n c += 1\r\n if c % m == 0:\r\n n += 1\r\nprint(c)\r\n\r\n#НОСКИ: 1) 9 носков = 9 дней\r\n#ДНИ: 2) каждый 3 день = 9н/3д == 3 носка /// 9+3=12 и т.к. 12/3 = 4 ==> 9+4==13\r\n", "n,m=map(int,input().split())\r\nd=0\r\ns=0\r\nwhile n>0:\r\n d=d+1\r\n n=n-1\r\n if d%m==0:\r\n n=n+1\r\n s=s+1\r\nprint(s)", "n,m=map(int,input().split())\r\nd=0\r\nwhile n>0:\r\n d+=1\r\n n-=1\r\n if d%m==0:\r\n n+=1\r\nprint(d)\r\n", "n, m = [int(x) for x in input().split()]\r\nsequence = []\r\ni = 1\r\n\r\nwhile n > 0:\r\n n = n - 1\r\n if i % m == 0:\r\n sequence.append(n + 1)\r\n n = n + 1\r\n else:\r\n sequence.append(n)\r\n i += 1\r\n\r\nprint(len(sequence))\r\n", "def solve():\r\n n,m = list(map(int,input().split()))\r\n ans = 0\r\n curr = 0\r\n while ans < n:\r\n if (ans + 1) % m == 0:\r\n n += 1\r\n ans += 1\r\n return ans\r\nprint(solve())", "def sOcKs(n,m):\r\n kd=1\r\n while n!=0:\r\n n-=1\r\n if kd%m==0:\r\n n+=1\r\n kd+=1\r\n return kd-1\r\nn,m=map(int,input().split())\r\nprint(sOcKs(n,m))", "n,m=map(int,input().split())\r\ndays=0\r\ni=1\r\nwhile n>0:\r\n days+=1\r\n n-=1\r\n if i%m==0:\r\n n+=1\r\n i+=1\r\nprint(days)\r\n", "n, m = map(int,input().split())\r\nd = 0\r\nc = 0\r\nwhile n > 0 :\r\n d += 1\r\n n -= 1\r\n c += 1\r\n if c % m == 0 :\r\n c = 0\r\n n += 1\r\nprint(d)", "socks,mama=map(int,input().split())\r\nday=0\r\nwhile socks>0:\r\n socks-=1\r\n day+=1\r\n if day%mama == 0:\r\n socks+=1\r\nprint(day)\r\n ", "n,m=map(int,input().split())\r\nk=0\r\nday=m\r\nwhile n!=0 :\r\n n=n-1\r\n k +=1\r\n if k==day:\r\n n=n+1\r\n day=day+m\r\nprint(k)", "q,m=map(int,input().split())\r\nprint(q+((q-1)//(m-1)))", "a, b = map(int, input().split())\r\nday = 0\r\nwhile a > 0:\r\n a -= 1\r\n day += 1\r\n if day % b == 0:\r\n a += 1\r\nprint(day)", "n,m=map(int,input().split())\r\nif n<m:\r\n print(n)\r\nelse:\r\n i=1\r\n while n:\r\n n-=1\r\n if i%m==0:\r\n n+=1\r\n i+=1\r\n print(i-1)", "n,m = map(int, input().split())\r\n\r\nday = 0\r\n\r\nwhile (n > 0):\r\n day+=1\r\n n-=1\r\n \r\n if day % m == 0:\r\n n+=1\r\n \r\nprint(day)", "n, m = map(int, input().split(' '))\r\n\r\nans = 0\r\n\r\nwhile n > 0:\r\n ans, n = ans + 1, n - 1\r\n if ans % m == 0:\r\n n += 1\r\n\r\nprint(ans)", "a=input().split()\r\ncount=1\r\nn=int(a[0])\r\nm=int(a[1])\r\nwhile True:\r\n n-=1\r\n if count%m==0:\r\n n+=1\r\n count+=1\r\n if n<=0:\r\n break\r\nprint(count-1)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nres = n\r\nhave_socks_to_wear = True\r\nwhile have_socks_to_wear:\r\n if res <= n + res//m - 1:\r\n res += 1\r\n else:\r\n have_socks_to_wear = False\r\nprint(res)", "n,m = map(int,input().split())\r\ni=0\r\n\r\nwhile n>0:\r\n n=n-1\r\n i=i+1\r\n if i%m==0:\r\n n=n+1\r\nprint(i)", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\ni=0\r\nsum1=0\r\nwhile(n):\r\n n-=1\r\n i+=1\r\n if(i%m==0):\r\n n+=1\r\n sum1+=1 \r\nprint(sum1)", "n, m = map(int, input().split(sep=\" \")); print(n + (n-1)//(m-1))", "n, m = map(int, input().split())\r\n\r\nn_addition = n-1\r\nm_addition = m-1\r\ndivid = n_addition // m_addition\r\n\r\nans = n + divid\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\nres = 0\r\nday = 1\r\nwhile n > 0:\r\n res += 1\r\n n -= 1\r\n if day % m == 0:\r\n n += 1\r\n day += 1\r\nprint(res)\r\n", "n,m=map(int,input().split())\r\nk=0\r\nwhile n>0:\r\n n=n-1\r\n k+=1\r\n if k%m==0:\r\n n=n+1\r\nprint(k) \r\n", "a,b=map(int,input().split(' '))\r\ni=a\r\ndays=0\r\nj=0\r\nwhile(i>0):\r\n days+=1\r\n j+=1\r\n i-=1\r\n if (j==b):\r\n j=0\r\n i+=1\r\nprint(days)", "testcases=1\n\nfor t in range (testcases):\n\tstring=input()\n\tarrs=string.split()\n\tn=int(arrs[0])\n\tm=int(arrs[1])\n\tp=0\n\twhile True:\n\t\tq=n//m-p\n\t\tp=n//m\n\t\tn+=q\n\t\tq=n//m\n\t\tif q > p:\n\t\t\tcontinue\n\t\telse:\n\t\t\tbreak\n\n\tprint(n)\n", "n, m = map(int, input().split())\r\nc = 0\r\nk = n\r\nwhile n != 0:\r\n n -= 1\r\n c += 1 \r\n if c == m:\r\n c = 0\r\n k += 1\r\n n += 1\r\nprint(k)\r\n ", "n,m=[int(i) for i in input().split()]\r\nc=0\r\nwhile n>0:\r\n if n<m:\r\n c+=n\r\n n=0\r\n else:\r\n c += (n // m) * m\r\n n=n%m+n//m\r\nprint(c)", "socks,socksM=map(int,input().split()) # ввод данных в одной строке\r\n\r\n# Каждый день минус 1 носок, каждый M день 1 носок добавляется, на сколько дней хватит носков?\r\ndays = 0\r\n# цикл работает пока кол-во носков больше нуля\r\nwhile socks > 0: \r\n socks = socks - 1 # сколько носков осталось, отнимаем по одному каждый день.\r\n days = days + 1 # увеличиваем счетчик дней\r\n if days % socksM == 0: # проверка, что настал М день, т.е. надо добавлять +1 носок от мамы\r\n socks = socks + 1 #увеличиваем кол-во носков на 1 (носок от мамы)\r\nprint (days)", "n, m = list(map(int, input().split()))\r\ncount = n\r\n\r\nfor i in range(n // m):\r\n q = n // m\r\n r = n % m\r\n count += q\r\n n = q + r\r\n\r\nprint(count)\r\n", "#https://codeforces.com/problemset/problem/460/A\r\nn,m=map(int,input().split()) #Вводим переменные\r\nday=0 #Кол-во дней, нужного для количесвто m дней\r\ndays=0 #Конечное кол-во дней\r\nwhile n>0: #Создаём цикл, кол-во носков с каждым днём меньше, а\r\n n-=1 #день прибавляется\r\n day+=1\r\n days+=1\r\n if m==day: #Кол-во дней до кол-ва дней в перменной m \r\n n+=1 \r\n day=0\r\n\r\nprint(days) #Ввывод кол-во дней\r\n", "n, m = [int(x) for x in input().split()]\r\nprint(n+((n-1)//(m-1)))", "n,m = list(map(int,input().split(' ')))\r\ndias = 0\r\nwhile n > 0:\r\n n-=1\r\n dias+=1\r\n if dias%m==0:\r\n n+=1\r\nprint(dias)" ]

[ "a, b, c = tuple(sorted(map(int, input().split())))\r\nprint((b + (a - 1)) * (c + (a - 1)) - (a * (a - 1)))\r\n", "a,b,c = map(int,input().split()); print((a+b-1)*(c-1)+a*b)", "a, b, c = map(int, input().split())\r\n\r\nprint((a+b-1)*(a+c-1) - a*(a-1))", "import sys\r\nimport collections \r\nsys.setrecursionlimit(30000)\r\n\r\n\r\ndef main():\r\n a,b,c = ([int(i) for i in input().split()])\r\n a = b*c + (b+c-1)*(a-1)\r\n print(a)\r\nif __name__ == \"__main__\":\r\n ##sys.stdin = open('oddoreven.in','r')\r\n ##sys.stdout = open('oddoreven.out','w')\r\n main()\r\n ##sys.stdin.close()\r\n ##sys.stdout.close()", "a, b, c = map(int, input().split())\r\nres = a*b*c - (a-1)*(b-1)*(c-1)\r\nprint (res)", "# coding: utf-8\n\nif __name__ == '__main__':\n arr = [int(val) for val in input().split()]\n res = 0\n while True:\n if min(arr) == 1: # 最里层\n res += arr[0] * arr[1] * arr[2]\n break\n res += (sum(arr) - 3) * 2 # 外层\n arr = [val - 1 for val in arr]\n print(res)\n", "a = list(map(int, input().split()))\r\na.sort()\r\nprint((a[2]*a[1])+(a[2]+a[1]-1)*(a[0]-1))", "def plitki(a, b, c):\n if a>1:\n return plitki(a-1, b, c)+b+c-1\n else:\n return b*c\n\ndef pl(a, b, c):\n res = b*c\n for i in range(a-1):\n res+=b+c-1\n return res\n\narray = input().split(\" \")\nprint(pl(int(array[0]), int(array[1]), int(array[2])))", "a,b,c = map(int, input().split())\r\nprint((a+b-1)*(c-1)+a*b)", "a,b,c = sorted(map(int,input().split()))\r\nprint(a*(2*c+a-1)+(c+a-1)*(b-a-1))\r\n", "def get_nth_triangular_number(n):\n return n * (n + 1) // 2\n\na, b, c = [int(i) for i in input().split()]\nlarge_equilateral_side_length = a + b + c - 2\nsmall_equilateral_side_lengths = [a - 1, b - 1, c - 1]\n\nnum_cells = get_nth_triangular_number(large_equilateral_side_length) \\\n - sum([get_nth_triangular_number(n) for n in small_equilateral_side_lengths])\n\nprint(num_cells)", "a, b, c = map(int, input().split())\r\nans = 0\r\nwhile a > 1 and b > 1 and c > 1:\r\n\tans += ((a - 1) + (b - 1) + (c - 1)) * 2\r\n\ta -= 1\r\n\tb -= 1\r\n\tc -= 1\r\nif a == 1:\r\n\tans += b * c\r\nelif b == 1:\r\n\tans += a * c\r\nelse:\r\n\tans += a * b\r\nprint(ans)# 1697813717.309842", "a,b,c = map(int,input().split())\r\nprint(a*b*c - (a-1)*(b-1)*(c-1))", "a, b, c = sorted(map(int, input().split()))\nt = a * b + b * c + c * a - a - b - c + 1\nprint(t)", "from sys import stdin\r\na,b,c=map(int,stdin.readline().split())\r\nprint(a*b+b*c+a*c-a-b-c+1)", "a, b, c = map(int, input().split())\r\nprint(c*(a+b-1)+(a-1)*(b-1))\r\n", "a=list(map(int,input().split()))\r\n\r\nanswer=((a[0]-1)*(a[2]-1)+(a[1]-1)*(a[2]-1)+(a[0]-1)*(a[1]-1) )+(a[0]+a[1]+a[2]-2)\r\n\r\nprint(answer)\r\n", "a,b,c=map(int,input().split())\r\nprint((c-1)*(a+b-1)+a*b)", "a, b, c = map(int, input().split())\r\nl = b + a + c - 2\r\n \r\nnl = (l * (l + 1)) // 2\r\n \r\nnl -= (a * (a - 1)) // 2\r\nnl -= (b * (b - 1)) // 2\r\nnl -= (c * (c - 1)) // 2\r\n \r\nprint(nl)", "a, b, c = map(int, input().split())\r\nprint(b*c + b*(a-1) + (c-1)*(a-1))", "'''\r\nCreated on 25.08.2012\r\n\r\n@author: lam\r\n'''\r\n\r\na, b, c = [int(x) for x in input().split()]\r\n\r\nprint(c*b + (a-1)*c + (a-1)*(b-1))\r\n ", "\r\na,b,c=map(int,input().split())\r\n\r\nprint(a*b*c-(a-1)*(b-1)*(c-1))", "a,b,c = tuple(int(i) for i in input().split())\r\n\r\nprint( (a+b-1)*(c+b-1) - (b*b - b) )", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nabc = sorted(readln())\nprint((abc[1] + abc[0] - 1) * (abc[2] + abc[0] - 1) - (abc[0] - 1) * abc[0])\n", "[a, b, c ]= list(map(int,input().split()))\r\nprint(b*c + (a-1)*c + (a-1)*(b-1))\r\n", "a,b,c=list(map(int,input().split()))\nprint(b*c+((a-1)*(c+b-1)))", "a, b, c = map(int, input().split())\r\nans = 0\r\nwhile a > 1 and b > 1 and c > 1:\r\n\tans += 2 * (a + b + c - 3)\r\n\ta -= 1\r\n\tb -= 1\r\n\tc -= 1\r\nif a == 1:\r\n\tans += b * c\r\nelif b == 1:\r\n\tans += a * c\r\nelse:\r\n\tans += a * b\r\nprint(ans)", "\nl = input(\"\")\nl = l.split(\" \")\na = int(l[0])\nb = int(l[1])\nc = int(l[2])\nt = c * b + (c + b - 1) * (a - 1)\nprint(str(t))\n", "a, b, c = map(int, input().split())\r\ndiag = c - 1\r\nleft = a + b - 1\r\nright = a * b\r\ns = left * diag + right\r\n\r\nprint(s)\r\n", "a,b,c=map(int,input().split())\r\nprint(b*c+(a-1)*c+(a-1)*(b-1))", "def polygon(a, b, c):\r\n return a * b + a * c + b * c - a - b - c + 1\r\n\r\n\r\nA, B, C = [int(i) for i in input().split()]\r\nprint(polygon(A, B, C))\r\n", "a, b, c = map(int, input().split())\r\nprint(c*b + a*b + a*c - a - b - c + 1)\r\n", "import sys\r\nimport math\r\ninput = sys.stdin.readline\r\na,b,c=map(int,input().split())\r\n\r\nprint(a*b+b*c+c*a-a-b-c+1)", "print(eval(\"int({0}[0])*int({0}[1])*int({0}[2])-(int({0}[0])-1)*(int({0}[1])-1)*(int({0}[2])-1)\".format(input().split())))", "\r\n\r\na,b,c = map(int,input().split())\r\n\r\nans = a * b + b * c + c * a - a - b - c + 1\r\nprint(ans)", "a, b, c = tuple(map(int, input().split()))\nprint(a*b + b*c + c*a - a - b - c + 1)\n", "a,b,c=map(int,input().split())\r\nf=lambda x:x*(x-1)//2\r\nprint(f(a+b+c-1)-f(a)-f(b)-f(c))", "x, y, z = map(int,input().split())\r\nprint((x-1)*(y-1)+z*(x+y-1))", "a,b,c=map(int,input().split())\r\nprint((a+b-1)*(c-1)+a*b)", "\r\nli = list(map(int, input().split()))\r\na = li[0]\r\nb = li[1]\r\nc = li[2]\r\nprint(a*b+b*c+c*a-a-b-c+1)", "import sys\r\n\r\na, b, c = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nprint(b * c + (b + c - 1) * (a - 1))", "x=list(map(int,input().split()))\r\ns=0\r\nwhile x.count(0)<1:\r\n if x.count(1)!=0:\r\n if x[0]==1:\r\n c=x[1]*x[2]\r\n elif x[1]==1:\r\n c=x[0]*x[2]\r\n else:\r\n c=x[1]*x[0]\r\n else:\r\n c=(x[0]+x[1]+x[2])*2-6\r\n s+=c\r\n for i in range(3):\r\n if x[i]!=0:\r\n x[i]-=1\r\nprint(s)", "a,b,c=map(int,input().split())\r\n\r\nprint(a*b+b*c+c*a-a-b-c+1)", "class CodeforcesTask216ASolution:\n def __init__(self):\n self.result = ''\n self.a_b_c = []\n\n def read_input(self):\n self.a_b_c = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n result = 0\n a, b, c = self.a_b_c\n width = a\n for step in range(1, b + c):\n\n result += width\n if step < b and step < c:\n width += 1\n elif step >= b and step >= c:\n width -= 1\n self.result = str(result)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask216ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "a,b,c=map(int,input().split())\r\nprint((c+b-1)*(a+b-1)-b*(b-1))", "from sys import setrecursionlimit, exit, stdin\nfrom math import ceil, floor, acos, pi\nfrom string import ascii_lowercase, ascii_uppercase, digits\nfrom fractions import gcd\nfrom functools import reduce\nimport itertools\nsetrecursionlimit(10**7)\nRI=lambda x=' ': list(map(int,input().split(x)))\nRS=lambda x=' ': input().rstrip().split(x)\ndX= [-1, 1, 0, 0,-1, 1,-1, 1]\ndY= [ 0, 0,-1, 1, 1,-1,-1, 1]\nmod=int(1e9+7)\neps=1e-6\nMAX=1000\n#################################################\na, b, c = RI()\nprint(a*b + b*c + a*c - a - b -c +1)\n", "#CF 216A\nlst = input().split()\na = int(lst[0])\nb = int(lst[1])\nc = int(lst[2])\nans = (b+a-1) * (c+a-1)\nans -= (a-1)*a\nprint(ans)", "a,b,c = map(int, input().split())\r\nprint((a*b + b*c + a*c) - a - b - c + 1)", "import sys\n#f = sys.stdin\n#f = open(\"input.txt\", \"r\")\na, b, c = map(int, input().split())\nprint((a+b-1)*(c-1)+a*b)", "a, b, c = [int(x) for x in input().split()]\nprint(a * b + (a + b - 1) * (c - 1))\n", "\na, b, c = map(int, input().split())\n\nprint(a * b + (a + b - 1) * (c - 1))\n", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------Input-----------------------------------------#\n######################################################################################\n\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 fun(n):\n n-=1\n return n*(1+n)//2\ndef solve():\n a,b,c=value()\n tot=( b+(a-1))*(c+(a-1))-fun(a)*2\n\n print(tot)\n\nif __name__ == \"__main__\":\n solve()\n", "n=input().split()\r\na=int(n[0])\r\nb=int(n[1])\r\nc=int(n[2])\r\nsumabc=(b*c)+(b+(c-1))*(a-1)\r\nprint(sumabc)", "a, b, c = sorted(map(int, input().split()))\r\nprint(a * b + a * c + b * c - a - b - c + 1)", "a,b,c=list(map(int,input().split()))\r\nprint((a-1)*(b-1)+c*(a+b-1))", "def readInts(): return map(int, input().split())\r\n\r\n\r\na, b, c = readInts()\r\nans = 0\r\nwhile min(a,b,c) > 1:\r\n ans += 2*(a+b+c) - 6\r\n a -= 1\r\n b -= 1\r\n c -= 1\r\nans += a*b*c\r\n\r\nprint(ans)\r\n", "import copy\r\na,b,c=map(int,input().split())\r\np=copy.deepcopy(a)\r\no=c-(b-1)\r\nfor i in range(b-2):\r\n p+=1\r\n a+=p \r\nprint((a*2)+((p+1)*o))", "a,b,c=map(int,input().split())\r\nprint(b*c+((a-1)*(b+c-1)))", "a,b,c=map(int,input().split())\nprint(b*c+(a-1)*(c+b-1))", "x = [int(c) for c in input().split()]\r\nx.sort()\r\na = x[0]\r\nb = x[1]\r\nc = x[2]\r\nx = a+b-1\r\no = x*(c-b+1)\r\no+=2*a*(b-1)\r\no+=((b-1)*(b-2))\r\nprint(o)", "a,b,c = map(int,input().split())\r\nprint(b*c+(a-1)*(b+c-1))", "try:\r\n a,b,c=list(map(int,input().split(\" \")))\r\n print(a*b*c-((a-1)*(b-1)*(c-1)))\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "a, b, c = map(int, input().split())\n\nb, c = min(b, c), max(b, c)\n\ntot1 = ((a + b) * (a + b - 1) - a * (a - 1))\ntot2 = (a + b - 1) * (c - 1 - b)\n\nprint(tot1 + tot2)\n \t \t \t\t\t\t \t \t \t \t \t\t\t\t \t\t\t\t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = sorted(map(int, input().split()))\r\n\r\nx = (b+a-1)*(b+a-2)//2 - a*(a-1)//2\r\ny = a + b - 1\r\nz = x + (c-b)*y\r\nprint(x + y + z)" ]

[ "from collections import deque\n\n\ndef ordering(s, ws):\n pbs = {}\n for p in sorted(s):\n pbs.setdefault(p[1]-p[0], deque()).append(p)\n\n o = []\n os = set()\n for w in ws:\n try:\n p = pbs[w].popleft()\n except (IndexError, KeyError):\n return None\n\n if ((p[0] > 0 and (p[0]-1, p[1]) not in os)\n or (p[1] > 0 and (p[0], p[1]-1) not in os)):\n return None\n\n o.append(p)\n os.add(p)\n\n\n return o\n\n\ndef pair(x, y):\n return x, y\n\n\nif __name__ == '__main__':\n n = int(input())\n s = {pair(*map(int, input().split())) for _ in range(n)}\n ws = tuple(map(int, input().split()))\n o = ordering(s, ws)\n if o:\n print('YES')\n for p in o:\n print('{} {}'.format(*p))\n else:\n print('NO')\n", "from sys import stdin\n_data = iter(stdin.read().split('\\n'))\ninput = lambda: next(_data)\n\nn = int(input())\nref, front = {}, {}\nans = []\nmax_x, max_y = 0, 0\nfor _ in range(n):\n x, y = map(int, input().split())\n max_x = max(max_x, x)\n max_y = max(max_y, y) \n ref[(x, y)] = 2\n if x == 0:\n ref[(x, y)] -= 1\n if y == 0:\n ref[(x, y)] -= 1\n if (x, y) == (0, 0):\n del ref[(x, y)]\n front[y - x] = x, y\nws = list(map(int, input().split()))\nfor w in ws:\n if w not in front:\n ans = []\n break\n x, y = front.pop(w)\n ans.append((x, y)) \n for dx, dy in ((1, 0), (0, 1)):\n nx, ny = x + dx, y + dy\n if (nx, ny) not in ref:\n continue\n ref[(nx, ny)] -= 1\n if ref[(nx, ny)] == 0:\n del ref[(nx, ny)]\n front[ny - nx] = (nx, ny)\nif ans:\n print('YES')\n print('\\n'.join('{} {}'.format(x, y) for x, y in ans))\nelse:\n print('NO')\n", "def gcd(a, b):\r\n if a % b == 0:\r\n return b\r\n return gcd(b, a % b)\r\nex = 100000\r\nn = int(input())\r\nflag = True\r\npid = {}\r\nS = [[] for _ in range(2 * ex + 1)]\r\nP = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n P.append((x, y))\r\nP.sort(key=lambda p: p[0] + p[1])\r\nw = list(map(int, input().split()))\r\nid = [0] * (n + 1)\r\nused = [0] * (2 * ex + 1)\r\nfor i in range(n):\r\n S[w[i] + ex].append(i + 1)\r\nfor i in range(2 * ex + 1):\r\n S[i].sort()\r\nfor i in range(1, n + 1):\r\n tmp = P[i - 1]\r\n v = tmp[1] - tmp[0]\r\n target = None\r\n if used[ex + v] == len(S[ex + v]):\r\n flag = False\r\n break\r\n target = S[ex + v][used[ex + v]]\r\n used[ex + v] += 1\r\n id[target] = i\r\n pid[tmp] = target\r\n if tmp[0] > 0 and pid.get((tmp[0] - 1, tmp[1]), float('inf')) > target:\r\n flag = False\r\n break\r\n if tmp[1] > 0 and pid.get((tmp[0], tmp[1] - 1), float('inf')) > target:\r\n flag = False\r\n break\r\nif not flag:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for i in range(1, n + 1):\r\n print(P[id[i] - 1][0], P[id[i] - 1][1])# 1691775212.5501058", "R=lambda:list(map(int, input().split()))\r\nn=int(input())\r\na=sorted([R() for i in range(n)], key=lambda x:(x[1]-x[0],x[0]))\r\nb=sorted(zip(R(),range(1,n+1)))\r\nif all(map(lambda i:a[i][1]-a[i][0]==b[i][0] and b[i][1]>=(a[i][0]+1)*(a[i][1]+1),range(n))):\r\n print('YES')\r\n c=[0]*n\r\n for i in range(n): c[b[i][1]-1]=a[i]\r\n for i in range(n): print(c[i][0], c[i][1])\r\nelse:\r\n print('NO')\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\nl = 2 * pow(10, 5) + 5\r\nu = [[] for _ in range(l)]\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n u[y - x].append((x, y))\r\nfor i in range(l):\r\n u[i].sort(reverse = True)\r\nok = set()\r\nfor i in range(n + 5):\r\n ok.add((-1, i))\r\n ok.add((i, -1))\r\nok.add((0, 0))\r\nw = list(map(int, input().split()))\r\nans0 = \"YES\"\r\nans = []\r\nfor i in w:\r\n if not u[i]:\r\n ans0 = \"NO\"\r\n break\r\n x, y = u[i].pop()\r\n if not (x, y) in ok:\r\n ans0 = \"NO\"\r\n break\r\n ans.append(\" \".join(map(str, (x, y))))\r\n ok.add((x, y))\r\n if (x + 1, y - 1) in ok:\r\n ok.add((x + 1, y))\r\n if (x - 1, y + 1) in ok:\r\n ok.add((x, y + 1))\r\nprint(ans0)\r\nif ans0 == \"YES\":\r\n sys.stdout.write(\"\\n\".join(ans))", "from itertools import combinations,permutations\r\nfrom collections import defaultdict\r\n\r\ndef zeror():\r\n return 0\r\n\r\ndef solution(n,c,cw,w):\r\n\r\n c.sort(key=lambda tup:tup[0])\r\n #print(c)\r\n\r\n for k,v in cw.items():\r\n cw[k]=sorted(v,key=lambda tup:tup[0])[::-1]\r\n\r\n #print(cw)\r\n\r\n ans=[]\r\n\r\n for elem in w:\r\n if elem not in cw:\r\n print(\"NO\")\r\n return\r\n else:\r\n ans.append(cw[elem].pop())\r\n\r\n #print(ans)\r\n temp=ans[0]\r\n for elem in ans[1:]:\r\n if temp[0]>=elem[0] and temp[1]>=elem[1]:\r\n print(\"NO\")\r\n return\r\n temp=elem\r\n\r\n print(\"YES\")\r\n for elem in ans:\r\n print(elem[0],elem[1])\r\n\r\n\r\n\r\n\r\ndef main():\r\n n=int(input())\r\n coordinates = []\r\n coor_weights = defaultdict(list)\r\n for _ in range(n):\r\n coordinates.append(tuple(map(int,input().strip().split())))\r\n coor_weights[coordinates[-1][1]-coordinates[-1][0]].append((coordinates[-1][0],coordinates[-1][1]))\r\n weigths=list(map(int,input().strip().split()))\r\n\r\n solution(n,coordinates,coor_weights,weigths)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n\"\"\"\r\n\r\n5\r\n2 0\r\n0 0\r\n1 0\r\n1 1\r\n0 1\r\n0 -1 -2 1 \r\n\r\n\r\n\"\"\"", "n = int(input())\r\np = sorted([tuple(map(int, input().split())) for _ in range(n)])\r\narr = list(map(int, input().split()))\r\nw, r, pr = {}, {}, {}\r\n\r\nfor i, wi in enumerate(arr, 1):\r\n if wi not in w:\r\n w[wi] = []\r\n w[wi].append(i)\r\n \r\ndef is_nbr(nb, i):\r\n return 0 if pr.get(nb, 0) > i else 1\r\n\r\ndef check_nbrs(p, i):\r\n n1 = (p[0] - 1, p[1])\r\n n2 = (p[0], p[1] - 1)\r\n n3 = (p[0] - 1, p[1] - 1)\r\n return is_nbr(n1, i) and is_nbr(n2, i) and is_nbr(n3, i)\r\n\r\ndef solve():\r\n for i in range(len(p)):\r\n d = p[i][1] - p[i][0]\r\n if d not in w:\r\n return 0\r\n q = w[d]\r\n if not q:\r\n return 0\r\n ind = q.pop(0)\r\n r[ind] = p[i]\r\n pr[p[i]] = ind\r\n if not check_nbrs(p[i], ind):\r\n return 0\r\n return 1\r\n \r\nif solve() == 0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n for k, v in sorted(r.items()):\r\n print(v[0], v[1])\r\n", "if __name__ == \"__main__\":\r\n\r\n n = int( input() )\r\n\r\n maxX = [-1]*100005\r\n for _ in range(n):\r\n px,py = [int(x) for x in input().split()]\r\n maxX[py] = max( maxX[py] , px )\r\n\r\n #print( maxX[:2] )\r\n\r\n w = [int(x) for x in input().split()]\r\n\r\n p = [-1]*100005\r\n p[0] = 0\r\n wdict = dict()\r\n wdict[0] = (0,0)\r\n res = []\r\n for wi in w:\r\n if wi in wdict:\r\n px , py = wdict.pop(wi)\r\n res.append( (px,py) )\r\n if maxX[py] > px:\r\n wdict[py-(px+1)] = (px+1,py)\r\n p[py] += 1\r\n if maxX[py+1] != -1 and p[py+1] == -1:\r\n wdict[py+1] = (0,py+1)\r\n p[py+1] += 1\r\n else:\r\n break\r\n\r\n if len(res) == n:\r\n print(\"YES\")\r\n for ares in res:\r\n print(ares[0],ares[1])\r\n else:\r\n print(\"NO\")", "from bisect import bisect_left\r\nfrom functools import cmp_to_key\r\ndef mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\n\r\nn = it()\r\nvisited = {}\r\nE = {}\r\nfor i in range(n):\r\n a,b = mp()\r\n visited[(a,b)] = False\r\n if b-a in E:\r\n r = bisect_left(E[b-a],[a,b])\r\n if r == len(E[b-a]):\r\n E[b-a].append([a,b])\r\n else:\r\n E[b-a].insert(r,[a,b])\r\n else:\r\n E[b-a] = [[a,b]]\r\nL = lt()[::-1]\r\nres = []\r\nfor i in L:\r\n if not i in E or E[i] == []:\r\n bool = False\r\n break\r\n else:\r\n r = E[i].pop()\r\n x,y = r[0], r[1]\r\n if (not (x+1,y) in visited or visited[(x+1,y)]) and (not (x,y+1) in visited or visited[(x,y+1)]):\r\n visited[(x,y)] = True\r\n res.append([x,y])\r\n else:\r\n bool = False\r\n break\r\nres = res[::-1]\r\nif bool:\r\n print(\"YES\")\r\n for i in res:\r\n print(' '.join([str(x) for x in i]))\r\nelse:\r\n print(\"NO\")\r\n ", "n = int(input().rstrip())\nl = set()\nfor i in range(n):\n l.add(tuple(map(int, input().rstrip().split())))\n\nw = list(map(int, input().rstrip().split()))\n\nd = {0: (0, 0)}\ns = \"\"\nvisited = set()\nvisited.add((0, 0))\nfor k in w:\n if d.get(k, None) is None:\n print(\"NO\")\n exit(0)\n\n p = d[k]\n del d[k]\n s += \"{} {}\\n\".format(*p)\n if p[1] == 0 and (p[0] + 1, p[1]) in l:\n visited.add((p[0] + 1, p[1]))\n d[-p[0] - 1] = (p[0] + 1, 0)\n else:\n if (p[0] + 1, p[1] - 1) in visited and (p[0]+1, p[1]) in l:\n visited.add((p[0] + 1, p[1]))\n d[p[1] - p[0] - 1] = (p[0] + 1, p[1])\n if p[0] == 0 and (0, p[1] + 1) in l:\n d[p[1] + 1] = (0, p[1] + 1)\n visited.add((0, p[1] + 1))\n else:\n if (p[0] - 1, p[1] + 1) in visited and (p[0], p[1] + 1) in l:\n visited.add((p[0], p[1] + 1))\n d[p[1]-p[0] + 1] = (p[0], p[1] + 1)\n\nprint(\"YES\")\nprint(s,end=\"\")\n\n \t \t\t \t\t \t \t \t\t \t \t \t", "n = int(input())\nR = lambda : map(int, input().split())\n\np = []\nw = {}\nr = {}\npr = {}\n\nfrom collections import deque\n\nfor _ in range(n):\n x,y = R()\n p.append((x,y))\n\np = sorted(p)\n\nfor i,wi in enumerate(list(R()),1):\n if wi not in w:\n w[wi] = deque()\n w[wi].append(i)\n\ndef solve(p,w,r):\n for i in range(len(p)):\n d = p[i][1]-p[i][0]\n if d in w:\n q = w[d]\n if len(q) > 0:\n ind = q.popleft()\n r[ind] = p[i]\n pr[p[i]] = ind\n if not check_neighbours(p[i],ind,pr):\n return 0\n else:\n return 0\n else:\n return 0\n\n return 1\n\ndef check_neighbours(p,ind,pr):\n n1 = (p[0]-1,p[1])\n n2 = (p[0],p[1]-1)\n n3 = (p[0]-1,p[1]-1)\n return (check_neighbour(n1,ind,pr) and check_neighbour(n2,ind,pr) and check_neighbour(n3,ind,pr))\n\ndef check_neighbour(nb,ind,pr):\n if nb in pr:\n if pr[nb] > ind:\n return 0 \n return 1\n\nif solve(p,w,r) == 0:\n print(\"NO\")\nelse:\n print(\"YES\")\n for k,v in sorted(r.items()):\n print(v[0], v[1])\n", "from collections import defaultdict\n\n\ndef solve():\n N = int(input())\n\n maxx = 0\n maxy = 0\n WS = defaultdict(list)\n\n for i in range(N):\n x, y = map(int, input().split())\n WS[y - x].append((x, y))\n maxx = max(maxx, x)\n maxy = max(maxy, y)\n\n for w in WS:\n WS[w].sort(reverse=True)\n\n W = list(map(int, input().split()))\n\n ans = [None] * N\n\n mx = [0] * (maxy + 1)\n my = [0] * (maxx + 1)\n\n for i in range(N):\n w = W[i]\n if WS[w]:\n ans[i] = ax, ay = WS[w].pop()\n if mx[ay] == ax and my[ax] == ay:\n mx[ay] = ax + 1\n my[ax] = ay + 1\n\n else:\n print('NO')\n return\n else:\n print('NO')\n return\n\n print('YES')\n for a in ans:\n print(a[0], a[1])\n\n\nif __name__ == '__main__':\n solve()\n" ]

[ "n = int(input())\r\nnodes = {1: []}\r\nyes_or_no = \"Yes\"\r\nfor i in range(2,n+1):\r\n p = int(input())\r\n nodes[p].append(i)\r\n nodes[i] = []\r\n \r\nfor i in nodes:\r\n no_of_leaves = 0\r\n for child in nodes[i]:\r\n if len(nodes[child]) == 0:\r\n no_of_leaves += 1\r\n if 0 < no_of_leaves < 3 or (len(nodes[i]) > 0 and no_of_leaves == 0):\r\n yes_or_no = \"No\"\r\n break\r\n \r\ndef dfs(tree: dict) -> dict:\r\n pass\r\n \r\nprint(f\"{yes_or_no}\")\r\n\r\n'''\r\nFaulty test case result\r\n13\r\n---\r\n1\r\n2\r\n2\r\n2\r\n1\r\n6\r\n6\r\n6\r\n1\r\n10\r\n10\r\n10\r\n'''", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 20/09/2020\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport heapq\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nfrom itertools import combinations, permutations\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\nd = {0: []}\r\nn = ii1()\r\nfor i in range(n - 1):\r\n a = ii1()\r\n d.setdefault(a - 1, []).append(i + 1)\r\n\r\nfor node in d:\r\n count = 0\r\n for child in d[node]:\r\n if child not in d:\r\n count += 1\r\n if count < 3:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')\r\n \r\n\r\n", "from sys import stdin , setrecursionlimit\ninput = stdin.readline\nsetrecursionlimit(10**8)\nimport threading\n\ndef dfs(p):\n global ans\n \n if(len(child[p]) == 0):return 1\n\n leafs = 0\n for i in child[p]:\n leafs += dfs(i)\n\n if(leafs < 3):ans = 'No'\n\n return 0\n\nchild , ans = None , None\ndef main():\n global child , ans\n for T in range(1):\n\n n = int(input())\n\n child = [[] for i in range(n + 1)]\n for i in range(n - 1):\n p = int(input())\n\n child[p].append(i + 2)\n\n\n ans = 'Yes'\n\n dfs(1)\n\n print(ans)\n\nif(__name__ == \"__main__\"):\n threading.stack_size(10**8)\n threading.Thread(target=main).start()\n\n\t \t\t\t \t \t\t \t\t\t \t \t\t\t\t\t\t\t\t", "n=int(input())\r\nl=[[] for i in range(n+1)]\r\nfor i in range(2,n+1):\r\n p=int(input())\r\n l[p].append(i)\r\ne=0\r\nfor i in range(n+1):\r\n r=0\r\n if(len(l[i])==0):\r\n continue\r\n for ele in l[i]:\r\n if(len(l[ele])<1):\r\n r=r+1\r\n if(r<3):\r\n e=1\r\n break\r\nif(e==1):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "\r\nn=int(input())\r\nvert={}\r\nfor i in range(n-1):\r\n\tx=int(input())\r\n\tif x not in vert:\r\n\t\tvert[x]=[i+2]\r\n\telse:\r\n\t\tvert[x].append(i+2)\r\nf=False\r\nfor i in vert:\r\n\tneww=0\r\n\tfor j in vert[i]:\r\n\t\tif j in vert:\r\n\t\t\tneww+=1\r\n\tif len(vert[i])-neww<3:\r\n\t\tf=True\r\n\t\tbreak\r\nif f:\r\n\tprint('No')\r\nelse:\r\n\tprint('Yes')", "import collections\r\n\r\ndef dfs(tree, outDeg, curNode):\r\n global res\r\n if outDeg[curNode] == 0 or res == \"No\":\r\n return\r\n leaves = 0\r\n for nxtNode in tree[curNode]:\r\n dfs(tree, outDeg, nxtNode)\r\n if outDeg[nxtNode] == 0:\r\n leaves += 1\r\n if outDeg[curNode] > 0 and leaves < 3:\r\n res = \"No\"\r\nif __name__ == '__main__':\r\n n = int(input())\r\n tree = collections.defaultdict(list)\r\n outDeg = [0] * (n + 1)\r\n for i in range(n - 1):\r\n p = int(input())\r\n tree[p].append(i + 2)\r\n outDeg[p] += 1\r\n global res; res = \"Yes\"\r\n dfs(tree, outDeg, 1)\r\n print(res)", "from collections import defaultdict\r\nn=int(input())\r\nadj=defaultdict(list) \r\nfor i in range(n-1):\r\n p=int(input())\r\n adj[p].append(i+2) \r\n\r\nleaf=set() \r\nfor i in range(1,n+1):\r\n if(i not in adj):\r\n leaf.add(i) \r\nflag=0\r\nfor it in adj:\r\n ct=0\r\n for child in adj[it]:\r\n if(child in leaf): \r\n ct+=1 \r\n if(ct<3):\r\n flag=1 \r\n break \r\nif(flag==1):\r\n print(\"No\")\r\nelse:\r\n print(\"Yes\")\r\n ", "n=int(input())\r\nl=[[] for i in range(n+1)]\r\nfor i in range(2,n+1):\r\n u=int(input())\r\n l[u].append(i)\r\nc=0\r\nq=[1]\r\nwhile(q):\r\n x=q.pop(0)\r\n v=0\r\n for i in l[x]:\r\n if(len(l[i])==0):\r\n v+=1\r\n else:\r\n q.append(i)\r\n if(v<3):\r\n c=1\r\n break\r\nif(c==0):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n=int(input())\r\nd={}\r\nfor i in range(n-1):\r\n\tk=int(input())\r\n\tif k not in d:\r\n\t\td[k] = [i+2]\r\n\telse:\r\n\t\td[k].append(i+2)\r\nflag=0\r\nfor i in d:\r\n\tw=0\r\n\tfor j in d[i]:\r\n\t\tif j not in d:\r\n\t\t\tw+=1\r\n\tif w<3:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==0:\r\n\tprint(\"Yes\")\r\nelse:\r\n\tprint(\"No\")\t", "n=int(input())\r\nA=[int(input()) for i in range(n-1)]\r\nD={}\r\nfor i in A:\r\n if i not in D:\r\n D[i]=1\r\n if i!=1:\r\n j=A[i-2]\r\n D[j]-=1\r\n else:\r\n D[i]+=1\r\nfor i in D:\r\n if D[i]<3:\r\n print('No')\r\n exit()\r\nprint('Yes')", "n = int(input())\r\na = [0] * (n+1) ; b = [0] * (n+1) ; c = [0] * (n+1)\r\nfor i in range(2, n+1):\r\n a[i] = int(input())\r\n b[a[i]] += 1\r\nfor i in range(1, n+1):\r\n if b[i] == 0:\r\n c[a[i]] += 1\r\nfor i in range(1, n+1):\r\n if b[i] != 0 and c[i] < 3:\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jun 11 11:00:21 2020\r\n\r\n@author: Harshal\r\n\"\"\"\r\n\r\nimport collections,sys\r\nn=int(input())\r\ngraph=collections.defaultdict(list)\r\n\r\nfor i in range(2,n+1):\r\n a=int(input())\r\n graph[a].append(i)\r\nfor i in range(1,n+1):\r\n if i not in graph:\r\n graph[i]=[]\r\nque=[1]\r\n\r\nwhile que:\r\n node=que.pop()\r\n blank=0\r\n for n in graph[node]:\r\n if len(graph[n])==0:\r\n blank+=1\r\n else:\r\n que.append(n)\r\n if blank<3:\r\n print(\"No\")\r\n sys.exit()\r\n \r\n \r\nprint(\"Yes\")\r\n \r\n ", "n = int(input())\r\nd = {}\r\npoint = 1\r\nfl = False\r\nfor i in range(1, n):\r\n a = int(input())\r\n if a not in d.keys():\r\n d[a] = []\r\n point += 1\r\n d[a].append(i + 1)\r\n\r\nkeyss = list(d.keys())\r\nfor i in d:\r\n sum = 0\r\n for j in range(len(d[i])):\r\n if d[i][j] not in keyss:\r\n sum += 1\r\n if sum < 3:\r\n fl = True\r\n break\r\n\r\nif fl:\r\n print('NO')\r\nelse:\r\n print('YES')", "def main():\r\n n = int(input())\r\n temp_dict = {}\r\n\r\n for i in range(1, n):\r\n parent, child = int(input()), i + 1\r\n\r\n if parent in temp_dict:\r\n temp_dict[parent].append(child)\r\n else:\r\n temp_dict[parent] = [child]\r\n\r\n flag = True\r\n for key, values in temp_dict.items():\r\n check_flag = False\r\n counter = 0\r\n for value in values:\r\n if value not in temp_dict:\r\n counter += 1\r\n if counter == 3:\r\n check_flag = True\r\n break\r\n if not check_flag:\r\n flag = False\r\n break\r\n\r\n if flag:\r\n print(\"Yes\")\r\n else:\r\n print(\"No\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "if __name__ == '__main__':\r\n\r\n n = int(input())\r\n node = [[] for _ in range(n)]\r\n for i in range(n-1):\r\n node[int(input())-1].append(i+2)\r\n #print(node)\r\n for i in node:\r\n if i:\r\n count = 0\r\n for j in i:\r\n #print(len(node[j-1]))\r\n if len(node[j-1]) == 0:\r\n count = count + 1\r\n if count < 3:\r\n print(\"No\")\r\n exit()\r\n print(\"Yes\")", "n = int(input())\r\np = [int(input())-1 for i in range(n-1)]\r\nlf = []\r\nfor x in range(n):\r\n if x not in p: lf.append(x)\r\nlp = [x for i, x in enumerate(p) if i + 1 in lf]\r\nx = min(lp.count(k) for k in p)\r\nprint(\"Yes\" if x >= 3 else \"No\")\r\n", "n=int(input())\r\nd={1:[]}\r\nfor i in range(n-1):\r\n p=int(input())\r\n if p in d:\r\n d[p].append(i+2)\r\n else:\r\n d[p]=[i+2]\r\nfor i in d:\r\n count=0\r\n for j in d[i]:\r\n if j not in d:\r\n count+=1\r\n if count<3:\r\n print(\"No\")\r\n exit(0)\r\nprint(\"Yes\")", "a=1\r\nfor b in range (0,a):\r\n count=1\r\n c=[]\r\n i=[]\r\n d=int(input())\r\n for e in range(2,d+1):\r\n z=int(input())\r\n c.append(10000*z+e)\r\n i.append(z)\r\n i=set(i)\r\n i=list(i)\r\n flag=0\r\n for j in i:\r\n count=0\r\n for k in c:\r\n if int(k/10000)==j:\r\n if k-10000*j not in i:\r\n count=count+1\r\n if count<3:\r\n flag=1\r\n break\r\n if flag==1:\r\n print(\"No\")\r\n else:\r\n print(\"Yes\")", "count = 1\r\nlst = []\r\ndict_arr = {}\r\nfor i in range(int(input())-1):\r\n a = int(input())\r\n if a not in lst:\r\n lst.append(a)\r\n count+=1\r\n if a not in dict_arr:\r\n dict_arr[a] = [count]\r\n else:\r\n dict_arr[a].append(count)\r\n \r\n \r\n \r\n \r\nfor i in range(1,len(lst)):\r\n for j in dict_arr:\r\n if lst[i] in dict_arr[j]:\r\n dict_arr[j].remove(lst[i])\r\nc = 0 \r\nfor i in dict_arr:\r\n if len(dict_arr[i])<3:\r\n c+=1\r\n break\r\nif c==0: \r\n print('YES') \r\nelse: \r\n print('NO')\r\n", "n = int(input());Tree = [0]*(n+1);Leaf = [0]*(n+1);ans = \"Yes\"\r\nfor i in range(2, n+1):\r\n Parent = int(input())\r\n Tree[i] = Parent\r\n Leaf[Parent] += 1\r\n if Tree[Parent] != -1:\r\n Leaf[Tree[Parent]] -= 1\r\n Tree[Parent] = -1\r\nfor i in range(1,n+1):\r\n if Tree[i] == -1 and Leaf[i]< 3:\r\n ans = \"No\"\r\nprint(ans)", "import sys\r\n\r\nif __name__ == '__main__':\r\n vertices = int(input())\r\n\r\n # Tree formation\r\n from collections import defaultdict, deque\r\n hmap = defaultdict(list)\r\n i = 1\r\n while i < vertices:\r\n parent = input()\r\n hmap[parent].append(str(i+1))\r\n i += 1\r\n #print(hmap)\r\n\r\n #q = deque(hmap)\r\n #print(q)\r\n\r\n # Question is - every non-leaf vertex has atleast 3 leaf children\r\n for key, value in hmap.items():\r\n tmp = [c for c in value if c not in hmap]\r\n if len(tmp) < 3:\r\n print('No')\r\n sys.exit()\r\n print('Yes')", "n = int(input())\ntree = dict()\nfor i in range(n - 1):\n t = int(input()) - 1\n if t not in tree:\n tree[t] = set()\n tree[t].add(i + 1)\nfor v in tree:\n k = 0\n for u in tree[v]:\n if u not in tree:\n k += 1\n if k < 3:\n print(\"No\")\n exit()\nprint(\"Yes\")", "# LUOGU_RID: 133309778\nn=int(input())\ng=[[] for _ in range(n+5)]\nv=[True for _ in range(n+5)]\nfor i in range(2,n+1):\n u=int(input())\n g[u].append(i)\n v[u]=False\nfor i in range(1,n+1):\n if len(g[i]) and sum(v[j] for j in g[i])<3:\n print('No')\n exit()\nprint('Yes')", "vertices = {}\r\nfor i in range(1, int(input())):\r\n p = int(input())\r\n child = i + 1\r\n if p not in vertices.keys():\r\n vertices.update({p : []})\r\n vertices[p].append(child)\r\ndef check(parent):\r\n children = vertices[parent]\r\n leaf = len(children)\r\n non_leaf = []\r\n for j in children:\r\n if j in vertices.keys():\r\n non_leaf.append(j)\r\n leaf -= 1\r\n if leaf >= 3:\r\n if leaf == len(children):\r\n return \"Yes\"\r\n else:\r\n checkLst = [check(_) for _ in non_leaf]\r\n if \"No\" in checkLst:\r\n return \"No\"\r\n else:\r\n return \"Yes\"\r\n else:\r\n return \"No\"\r\n\r\nprint(check(1))", "from collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(list)\r\n\r\nfor i in range(n-1):\r\n x = int(input())\r\n d[x].append(i+2)\r\np=1\r\nfor i in d:\r\n c=0\r\n for j in d[i]:\r\n\r\n if j not in d:\r\n c+=1\r\n if c<3:\r\n p=0\r\nif p==0:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "def dfs(v):\n l = 0\n for u in d[v]:\n if not d[u]:\n l += 1\n dfs(u)\n if l<3 and d[v]:\n print('No')\n exit()\n\n\nn=int(input())\nd=[[] for i in range(n+1)]\nfor i in range(2,n+1):\n x=int(input())\n d[x].append(i)\ndfs(1)\nprint(\"Yes\")\n\t \t\t\t\t\t\t \t \t\t \t \t \t\t\t \t\t", "t=int(input())\r\nreq=[[] for i in range(t)]\r\nfor i in range(t-1):\r\n k=int(input())\r\n req[k-1].append(i+2)\r\nco=0\r\nreq1=0\r\nfor i in req:\r\n if i:\r\n req1+=1\r\nfor i in req:\r\n if i:\r\n c=0\r\n for j in i:\r\n if not req[j-1]:\r\n c+=1\r\n if c>=3:\r\n co+=1\r\nif co==req1:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n", "from collections import defaultdict\r\n\r\ndef solve():\r\n n = int(input())\r\n child = defaultdict(list)\r\n\r\n for i in range(n - 1):\r\n child[int(input())].append(i + 2)\r\n\r\n for v in list(child.values()):\r\n if sum(not bool(child[c]) for c in v) < 3:\r\n return False\r\n return True\r\n\r\nprint('Yes' if solve() else 'No')", "n=int(input())\n\ndef spruce(n):\n name_vertex=2\n stuff ={}\n for _ in range(n-1):\n value = input()\n if stuff.get(value)==None:\n stuff[value]=[name_vertex]\n else:\n stuff[value].append(name_vertex)\n name_vertex+=1\n\n for key in stuff.keys():\n amount=0\n list = stuff[key] \n for son in list:\n son = str(son)\n if stuff.get(son)!=None:\n amount+=1\n\n if len(list)-amount<3:\n print(\"No\")\n return\n print(\"Yes\")\n\nspruce(n)\n\n\t \t \t \t \t \t \t \t \t\t\t \t\t\t\t", "def main() -> bool:\r\n n = int(input())\r\n children = [[] for _ in range(n)]\r\n for i in range(1, n):\r\n parent = int(input()) - 1\r\n children[parent].append(i)\r\n\r\n for index in range(n):\r\n l = len(children[index])\r\n if l == 0:\r\n continue\r\n\r\n for child in children[index]:\r\n if children[child]:\r\n l -= 1\r\n\r\n if l < 3:\r\n return False\r\n\r\n return True\r\n\r\n\r\nprint(\"YES\" if main() else \"NO\")\r\n", "n=int(input())\r\nd,l,m,a=[0]*(n+1),[0]*2,[0]*(n+1),0\r\nfor _ in range(n-1):\r\n a=int(input())\r\n l.append(a)\r\n m[a]+=1\r\nfor i in range(1,n+1):\r\n if m[i]==0:\r\n d[l[i]]+=1\r\nfor i in range(1,n+1):\r\n if m[i]>0 and d[i]<3:\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nn=int(input())\r\nd={}\r\nl=set()\r\nfor i in range(2,n+1):\r\n\tx=int(input())\r\n\tif x in d:\r\n\t\td[x].add(i)\r\n\telse:\r\n\t\td[x]={i}\r\n\t\tl.add(x)\r\nflag='YES'\r\nfor i in d:\r\n\tcount=0\r\n\tfor k in d[i]:\r\n\t\tif k not in l:\r\n\t\t\tcount+=1\r\n\tif count<3:\r\n\t\tflag='NO'\r\nprint(flag)", "# https://codeforces.com/problemset/problem/913/B\n\n\nn = int(input())\ntree = {i: [] for i in range(1, n+1)}\n\nfor i in range(2, n+1):\n tree[int(input())].append(i)\n\n\ndef is_spruce():\n for node in tree:\n if len(tree[node]) == 0:\n continue\n\n count = 0\n for child in tree[node]:\n if len(tree[child]) == 0:\n count += 1\n if count < 3:\n return False\n\n return True\n\n\nif is_spruce():\n print(\"Yes\")\nelse:\n print(\"No\")\n", "import sys\nn = int(input())\n\ntree = [[] for i in range(n+1)]\n\nfor i in range(2,n+1):\n parent = int(input())\n tree[parent].append(i)\n\nleafs = []\nparents = []\nfor i, childs in enumerate(tree):\n if childs == [] and i!=0:\n leafs.append(i)\n else:\n if i == 0: continue\n parents.append(i)\nfor p in parents:\n count = 0\n i = 0\n while count < 3 and i < len(tree[p]):\n if tree[p][i] in leafs:\n count +=1\n i+=1\n if count <3:\n print(\"No\")\n sys.exit()\n\nprint(\"Yes\")\n\n\t\t\t \t \t \t \t\t \t \t \t\t \t\t\t\t", "n = int(input())\n\nadjList = []\nfor i in range(0, n):\n adjList.append([])\n\npar = []\nfor i in range(0, n):\n par.append(-1)\n\nfor i in range(0, n-1):\n parent = int(input())\n parent -= 1\n #vertex i + 1 is a child of vertex parent\n adjList[i+1].append(parent)\n adjList[parent].append(i+1)\n par[i+1] = parent\n\nisLeaf = []\nfor i in range(0, n):\n isLeaf.append(False)\n\nleafCount = []\nfor i in range(0, n):\n leafCount.append(0)\n\nfor i in range(0, n):\n if len(adjList[i]) == 1 and i != 0:\n isLeaf[i] = True\n leafCount[par[i]] += 1\n\nisValid = True\n\nfor i in range(0, n):\n #print(isLeaf[i], leafCount[i])\n if isLeaf[i] == False and leafCount[i] < 3:\n isValid = False\n\nif isValid:\n print(\"Yes\")\nelse:\n print(\"No\")\n", "def if_spruce(n,l,s):\r\n d=[0]*(n+1)\r\n for i in range(1,n+1):\r\n if i not in s:\r\n d[l[i]]+=1\r\n for i in range(1,n+1):\r\n if i in s and d[i]<3:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\nn=int(input())\r\nl,a=[0]*2,0\r\nfor _ in range(n-1):\r\n a=int(input())\r\n l.append(a)\r\ns=set(l)\r\nprint(if_spruce(n,l,s))", "import math\r\nfrom collections import defaultdict as dt\r\nfrom sys import stdin\r\ninp = lambda : stdin.readline().strip()#input()\r\nintinp = lambda : int(inp())#int(input())\r\nmod = int(1e9)+7\r\ninf = float(\"inf\")\r\nlistinp= lambda : list(map(int,stdin.readline().split()))#list(input())\r\nmapinp = lambda : map(int,stdin.readline().split())#map(input())\r\n\r\n\r\n##### Code Goes here #####################\r\nfor _ in range(1):\r\n n=intinp()\r\n b=[[] for i in range(n+1)]\r\n for i in range(2,n+1):\r\n b[intinp()].append(i);\r\n c=True\r\n for i in range(n+1):\r\n d=0\r\n if(len(b[i])==0): continue\r\n for j in b[i]:\r\n if(len(b[j])==0): d+=1\r\n if(d<3): \r\n c=False\r\n break;\r\n if(c):print(\"YES\")\r\n else:print(\"NO\")", "import sys\r\nimport math\r\n#import random\r\n#sys.setrecursionlimit(10000000)\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\n\r\np=[0]*(n+1)\r\ndeg=[0]*(n+1)\r\n\r\nfor i in range(1,n):\r\n\tu=inp()\r\n\tp[i+1]=u\r\n\tdeg[u]+=1\r\n\r\nfor i in range(1,n+1):\r\n\tif deg[i]:\r\n\t\tans=0\r\n\t\tfor j in range(1,n+1):\r\n\t\t\tif p[j]==i and deg[j]==0:\r\n\t\t\t\tans+=1\r\n\t\tif ans<3:\r\n\t\t\tprint(\"No\")\r\n\t\t\texit(0)\r\nprint(\"Yes\")\r\n\r\n\t\r\n", "n=int(input())\r\nl=[[]for i in range(n)]\r\nfor i in range(1,n):l[int(input())-1].append(i)\r\nprint('NYoe s'[all(sum([1 if not l[i] else 0 for i in l[x]])>2 for x in range(n) if l[x])::2])\r\n", "a = dict()\r\nfor i in range(int(input())-1):\r\n\tc = int(input())\r\n\tif (not c in a): a[c] = list()\r\n\ta[c].append(i+2)\r\nfor i in a:\r\n\tl = int()\r\n\tfor j in a[i]:\r\n\t\tif (j not in a): l += 1\r\n\tif (l < 3):\r\n\t\tprint(\"No\")\r\n\t\texit()\r\nprint(\"Yes\")", "child = dict()\r\n\r\nn = int(input())\r\n\r\nfor i in range(2,n+1):\r\n node = int(input())\r\n if node in child.keys():\r\n child[node].append(i)\r\n else:\r\n child[node] = [i]\r\n\r\nflag = True\r\n\r\nfor i in child.keys():\r\n count = 0\r\n if len(child[i])>=3:\r\n for j in child[i]:\r\n if j not in child.keys():\r\n count+=1\r\n if count<3:\r\n flag =False\r\n break\r\n else:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Dec 18 13:12:13 2020\r\n\r\n@author: lenovo\r\n\"\"\"\r\n\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\n\r\nclass graph:\r\n def __init__(self):\r\n self.g=defaultdict(list)\r\n def addedge(self,u,v):\r\n self.g[u].append(v)\r\ndef router(values):\r\n gr=graph()\r\n for i in range(len(values)):\r\n gr.addedge(values[i], i+2)\r\n return gr.g\r\n\r\ndef isleaf(node,gr):\r\n if len(gr[node])==0:\r\n return True\r\n return False\r\n\r\ndef christmas(gr,start,visited):\r\n q=deque()\r\n q.append(start)\r\n visited[start]=True\r\n count=0\r\n while q:\r\n count=0\r\n value=q.popleft()\r\n for val in gr[value]:\r\n if not isleaf(val,gr):\r\n q.append(val)\r\n visited[val]=True\r\n else:\r\n visited[val]=True\r\n count=count+1\r\n if count<3:\r\n return 'No'\r\n if count<3:\r\n return 'No'\r\n return 'Yes'\r\nn=int(input())\r\nvalues=[]\r\nfor i in range(n-1):\r\n value=int(input())\r\n values.append(value)\r\ngr=router(values)\r\nvisited=[False]*(n+1)\r\nprint(christmas(gr, 1, visited))\r\n ", "n= int(input())\r\nt=[[] for _ in range(n+1)]\r\nfor i in range(n-1):\r\n v = int(input())\r\n t[v].append(i+2)\r\n#print(t)\r\nflag=True\r\nfor l in t:\r\n if l!=[]:\r\n cnt=0\r\n for ele in l:\r\n if t[ele]==[]:\r\n cnt+=1\r\n if cnt<3:\r\n flag=False\r\n break\r\nif flag:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n = int(input())\r\nz = [[] for i in range(n+1)]\r\nfor i in range(n-1):\r\n p = int(input())\r\n z[p].append(i+2)\r\ncan = True\r\nfor i in range(1, n+1):\r\n if len(z[i]) != 0:\r\n l = 0\r\n for j in z[i]:\r\n if len(z[j]) == 0:\r\n l += 1\r\n if l < 3:\r\n can = False\r\nif can:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys;readline = sys.stdin.readline\r\ndef i1(): return int(readline())\r\ndef nl(): return [int(s) for s in readline().split()]\r\ndef nn(n): return [int(readline()) for i in range(n)]\r\ndef nnp(n,x): return [int(readline())+x for i in range(n)]\r\ndef nmp(n,x): return (int(readline())+x for i in range(n))\r\ndef nlp(x): return [int(s)+x for s in readline().split()]\r\ndef nll(n): return [[int(s) for s in readline().split()] for i in range(n)]\r\ndef mll(n): return ([int(s) for s in readline().split()] for i in range(n))\r\ndef s1(): return readline().rstrip()\r\ndef sl(): return [s for s in readline().split()]\r\ndef sn(n): return [readline().rstrip() for i in range(n)]\r\ndef sm(n): return (readline().rstrip() for i in range(n))\r\ndef redir(s): global readline;import os;fn=sys.argv[0] + f'/../in-{s}.txt';readline = open(fn).readline if os.path.exists(fn) else readline\r\n\r\nredir('b')\r\nn = i1()\r\narr = nn(n-1)\r\n# print(n, arr)\r\ncnt = [0]*(n+1)\r\nleaf = [True]*(n+1)\r\ni = n\r\narr.reverse()\r\nok = True\r\nfor p in arr:\r\n if leaf[i]:\r\n cnt[p] += 1\r\n leaf[p] = False\r\n i -= 1\r\nfor i in range(1,n+1):\r\n if not leaf[i] and cnt[i] < 3:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")\r\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = [[] for _ in range(n)]\r\nfor i in range(1, n):\r\n p = int(input())\r\n g[p-1].append(i)\r\nfor i in range(n):\r\n x = len(g[i])\r\n if x > 0:\r\n for j in g[i]:\r\n if len(g[j]) != 0:\r\n x -= 1\r\n if x < 3:\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")", "n = int(input())\r\nd = {i:[] for i in range(1, n+1)}\r\nfor i in range(2, n+1):\r\n\td[int(input())].append(i)\r\nfor i in d:\r\n\tif d[i]:\r\n\t\ttemp = 0\r\n\t\tfor j in d[i]:\r\n\t\t\tif len(d[j]) == 0:\r\n\t\t\t\ttemp += 1\r\n\t\tif temp < 3:\r\n\t\t\tprint(\"No\")\r\n\t\t\texit()\r\nprint(\"Yes\")", "n = int(input())\np = [int(input())-1 for _ in range(n-1)]\np.insert(0,0)\nnoc = [0 for _ in range(n)]\nfor x in p: noc[x]+=1\ncl = [0 for _ in range(n)]\nfor i,x in enumerate(noc):\n\tif not x:\n\t\tcl[p[i]]+=1\nans = \"Yes\"\nfor x,y in zip(noc, cl):\n\tif x > 0 and y <3:\n\t\tans = \"No\"\n\t\tbreak\nprint(ans)\n\t\t\t \t \t\t\t\t\t \t\t \t\t \t \t\t \t", "def if_Spruce(n,l,m):\r\n d=[0]*(n+1)\r\n for i in range(1, n + 1):\r\n if m[i] == 0:\r\n d[l[i]] += 1\r\n for i in range(1, n + 1):\r\n if m[i] > 0 and d[i] < 3:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\n\r\nn=int(input())\r\nl,m,a=[0]*2,[0]*(n+1),0\r\nfor _ in range(n-1):\r\n a=int(input())\r\n l.append(a)\r\n m[a]+=1\r\nprint(if_Spruce(n,l,m))\r\n", "n = int(input())\r\nadj = [[] for i in range(n+1)]\r\ncnt = [0] * (n+1)\r\nlst = []\r\ncount = 0\r\ndef dfs(curr,prev):\r\n leaf = True\r\n global count\r\n for child in adj[curr]:\r\n if child != prev:\r\n leaf = False\r\n dfs(child,curr)\r\n if cnt[child] == 1:\r\n cnt[curr] += cnt[child]\r\n cnt[child] = 0\r\n\r\n if leaf:\r\n cnt[curr] = 1\r\n else:\r\n count+=1\r\n\r\n\r\n\r\ndef solve():\r\n for i in range(1,n):\r\n x = int(input())\r\n adj[x].append(i+1)\r\n adj[i+1].append(x)\r\n dfs(1,0)\r\n lst = [i for i in cnt if i!=0]\r\n if len(lst) == count:\r\n for i in lst:\r\n if i<3:\r\n return 'No'\r\n return 'Yes'\r\n else:\r\n return 'No'\r\nif __name__ == '__main__':\r\n print(solve())", "#######################################################################################################\r\n####### ########### ####### ######### ####### ###### #####\r\n###### ###### ######### ###### ####### ########### ############# ################ ############\r\n###### ####### ######## ####### ###### ########### ############## ################ ############\r\n###### ###### ######### ####### ###### ############# ################ ############\r\n###### ### ########### ####### ###### ########### ############# ################ ############\r\n###### ##### ########## ####### ###### ########### ############# ################ ############\r\n###### ###### ########## ##### ####### ########### ############# ################ ############\r\n#### ###### ###### ###### ######## ####### ########## ###########\r\n#######################################################################################################\r\nimport sys\r\n#-----------------------IMPORTANT FUNCTIONS ---------------------------------#\r\nfrom math import cos, pi, ceil, pi, tan, floor, gcd, sqrt, log2, factorial, log10\r\nfrom collections import Counter\r\nfrom copy import deepcopy\r\nfrom string import ascii_lowercase, ascii_uppercase\r\nfrom statistics import mean, median, mode\r\n\r\nalpha = ascii_lowercase\r\nbeta = ascii_uppercase\r\n\r\n\r\n#-----------------------NEXT POWER OF 2---------------------------------------#\r\ndef nextPowerOf2(n):\r\n p = 1\r\n if (n and not (n & (n - 1))):\r\n return n\r\n while (p < n):\r\n p <<= 1\r\n return p\r\n\r\n\r\n#-----------------------GET DIVISORS 1 TO <=N ------------------------------#\r\ndef get_Divisors(n):\r\n arr = []\r\n i = 1\r\n while i <= sqrt(n):\r\n if (n % i == 0):\r\n if (n / i == i):\r\n arr.append(i)\r\n else:\r\n arr.append(i)\r\n arr.append(n // i)\r\n i = i + 1\r\n\r\n return arr\r\n\r\n\r\n#----------------------CHECK PRIMES-----------------------------------#\r\ndef isprime(n):\r\n if n == 1:\r\n return 0\r\n i = 2\r\n while (i * i <= n):\r\n if (n % i == 0):\r\n return 0\r\n i += 1\r\n return 1\r\n\r\n\r\n#-----------------------PRE COMPUTED PRIMES-----------------------------------#\r\ndef Sieve(n):\r\n prime = [True for i in range(n + 1)]\r\n prime[0] = False\r\n prime[1] = False\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\n\r\n#-----------------------LARGER VALUE OF X,Y,10**9+7 --------------------------#\r\ndef power(x, y, p):\r\n res = 1\r\n x = x % p\r\n if (x == 0):\r\n return 0\r\n while (y > 0):\r\n if ((y & 1) == 1):\r\n res = (res * x) % p\r\n y = y >> 1\r\n x = (x * x) % p\r\n return res\r\n\r\n\r\n#----------------------- CREATE MATRIX --------------------------#\r\ndef create_matrix(n, m):\r\n mat = [[] for i in range(n)]\r\n for i in range(n):\r\n for j in range(m):\r\n mat[i].append(0)\r\n return mat\r\n#-----------------------*****CODE STARTS HERE*****--------------------------#\r\n# sys.stdout = open('ot.txt', 'w')\r\n# sys.stdin = open('in.txt', 'r')\r\ndef main():\r\n n=int(input())\r\n res=[0] \r\n for i in range(n-1):\r\n x=int(input())\r\n res.append(x)\r\n deg=[0]*(n+1)\r\n for i in res:\r\n deg[i]+=1 \r\n child=[0]*(n+1)\r\n for i in range(1,n+1):\r\n if deg[i]==0:\r\n child[res[i-1]]+=1 \r\n for i in range(1,n+1):\r\n if deg[i]>0 and child[i]<3:\r\n print(\"NO\")\r\n break \r\n else:\r\n print(\"YES\")\r\n \r\nif __name__ == \"__main__\":\r\n main()\r\n", "# Сложность по времени\r\n# Сложность по памяти\r\n\r\ndef find(u):\r\n global ok\r\n if not ok:\r\n return\r\n if b[u] is not None:\r\n return\r\n if len(a[u]) == 0:\r\n b[u] = True\r\n return\r\n b[u] = False\r\n s = 0\r\n for v in a[u]:\r\n find(v)\r\n if b[v]:\r\n s += 1\r\n if not ok:\r\n return\r\n if s < 3:\r\n ok = False\r\n return\r\n\r\n\r\nn = int(input())\r\na = [[] for i in range(n)]\r\nb = [None for i in range(n)]\r\nfor i in range(n - 1):\r\n u = int(input())\r\n u -= 1\r\n a[u].append(i + 1)\r\nok = True\r\nfind(0)\r\nif ok:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "numOfVertex = int(input())\n\ntree = [[]]\nfor i in range(numOfVertex - 1):\n v = int(input())\n tree[v - 1].append(len(tree) + 1)\n tree.append([])\n\n\nvertex = 1\n\nisSpruce = True\ndef spruce(v):\n leafs = 0\n for i in tree[v]:\n if not tree[i - 1]:\n leafs += 1\n else:\n spruce(i - 1)\n if leafs < 3:\n global isSpruce \n isSpruce = False\n\nspruce(0)\nprint('Yes' if isSpruce else 'No')\n \t \t\t\t \t \t\t \t \t \t\t\t \t", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([])\r\nfor i in range(1, n):\r\n x = int(input())\r\n a[x-1].append(i)\r\nflag = True\r\nfor el in a:\r\n if len(el) != 0:\r\n k = 0\r\n for i in el:\r\n if len(a[i]) == 0:\r\n k += 1\r\n if k < 3:\r\n flag = False\r\nif flag:\r\n print('Yes')\r\nelse:\r\n print('No')", "def check(parent, notleaf, n):\r\n flag = True\r\n v = [0] * (n + 1)\r\n \r\n for i in range(2, n + 1):\r\n if not notleaf[i]:\r\n v[parent[i]] += 1\r\n \r\n for i in range(1, n + 1):\r\n if notleaf[i] and v[i] < 3:\r\n flag = False\r\n break\r\n \r\n return flag\r\n\r\nn = int(input())\r\nparent = [0] * (n + 1)\r\nnotleaf = [0] * (n + 1)\r\n\r\nfor i in range(2, n + 1):\r\n temp = int(input())\r\n parent[i] = temp\r\n notleaf[temp] += 1\r\n\r\nif check(parent, notleaf, n):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n", "n = int(input())\r\ngraph = [[] for _ in range(n + 1)]\r\nfor i in range(n - 1):\r\n par = int(input())\r\n graph[par].append(i + 2)\r\n\r\ndef dfs(node):\r\n if not graph[node]:\r\n return True, 0\r\n\r\n leafs = 0\r\n depth = 0\r\n for c in graph[node]:\r\n val, dep = dfs(c)\r\n if not val:\r\n # print(node, 'ret ffls')\r\n return False, 0\r\n if dep == 0:\r\n leafs += 1\r\n depth = max(depth, dep + 1)\r\n \r\n # print(node, 'ret', leafs >= 3)\r\n return leafs >= 3, depth\r\n\r\nprint('Yes' if dfs(1)[0] else 'No')", "n = int(input())\r\ntree = [[] for i in range(n)]\r\nfor i in range(1, n):\r\n tree[int(input()) - 1].append(i)\r\n\r\nfor children in tree:\r\n if len(children) != 0: # вершина не является листом\r\n leafs = 0\r\n for child in children:\r\n if len(tree[child]) == 0:\r\n leafs += 1\r\n if leafs < 3:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "from sys import stdin\nfrom collections import deque,Counter,defaultdict,OrderedDict\nimport sys\nimport math,os\nimport operator\nimport random\nfrom fractions import Fraction\nimport functools\nimport bisect\nimport itertools\nfrom heapq import *\nimport time\nimport random\nimport bisect\nimport copy\n\nn = int(input())\ntree = [[] for i in range(n+1)]\nnum = 2\nfor _ in range(n-1):\n vertex = int(input())\n tree[vertex].append(num)\n num+=1\nq = deque([1])\nans = 1\nwhile len(q)!=0:\n count = 0\n x = q.popleft()\n for i in tree[x]:\n if tree[i] == []:\n count+=1\n elif i not in q:\n q.append(i)\n if count<3:\n ans = 0\nprint(\"No\" if ans == 0 else \"Yes\")\n", "n=int(input())\r\nd=dict()\r\nfor i in range(n-1):\r\n l=int(input())\r\n if l not in d:\r\n d[l]=[i+2]\r\n else:\r\n d[l].append(i+2)\r\nflag=0\r\nfor i in d:\r\n if len(d[i])!=0:\r\n c=0\r\n for j in d[i]:\r\n if j not in d:\r\n c+=1\r\n if c<3:\r\n print(\"no\")\r\n flag=1\r\n break\r\nif flag==0:\r\n print(\"yes\")\r\n \r\n \r\n \r\n", "n = int(input())\r\nder = {}\r\nfor i in range(1,n+1):\r\n der[i]=[]\r\nfor i in range(2, n + 1):\r\n a = int(input())\r\n der[a].append(i)\r\ntur = True\r\nwhile tur:\r\n tur = False\r\n for i in der:\r\n if not der[i]:\r\n del der[i]\r\n tur = True\r\n break\r\nfor i in der:\r\n tur = True\r\n while tur:\r\n tur = False\r\n for j in range(len(der[i])):\r\n if der[i][j] in der:\r\n tur = True\r\n del der[i][j]\r\n break\r\n\r\nfor i in der:\r\n if len(der[i]) < 3:\r\n print('No')\r\n exit()\r\nprint('Yes')", "tree = {}\r\nn = int(input())\r\nfor i in range(2, n+1):\r\n parent = int(input())\r\n if parent not in tree.keys():\r\n tree[parent] = list()\r\n tree[parent].append(i)\r\n\r\nflag = True\r\n\r\nfor i in tree:\r\n x = 0\r\n for j in range(len(tree[i])):\r\n if tree[i][j] not in tree.keys():\r\n x+=1\r\n if x < 3:\r\n flag = False\r\n print('NO')\r\n break\r\nif flag:\r\n print('YES')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([-1])\r\nflak=0\r\nfor i in range(n-1):\r\n m=int(input())\r\n a[m-1].append(i+1)\r\nfor i in range(n):\r\n s=0\r\n for j in range(1,len(a[i])):\r\n if len(a[a[i][j]])==1:\r\n s+=1\r\n if s<3 and len(a[i])!=1:\r\n flak=1\r\nif flak==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "n = int(input())\r\nd = {}\r\n\r\nfor i in range(2, n+1):\r\n parent = int(input())\r\n if parent in d:\r\n d[parent].append(i)\r\n else:\r\n d[parent] = [i]\r\n \r\nfor i in d:\r\n children = d[i]\r\n L = len(children)\r\n for j in children:\r\n if j in d:\r\n L -= 1\r\n if L < 3:\r\n print('No')\r\n break\r\n\r\nelse:\r\n print('Yes')", "n = int(input())\r\nd = {1:0}\r\nele = []\r\nfor i in range(n-1):\r\n parent = int(input())\r\n ele.append(parent)\r\n if parent in d:\r\n d[parent] += 1\r\n else:\r\n d[ele[parent-2]] -= 1\r\n d[parent] = 1\r\nfor i in d.values():\r\n if i < 3:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "n = int(input())\r\ntable = {}\r\nfor i in range(2,n+1):\r\n parent = int(input())\r\n if parent in table:\r\n table[parent].append(i)\r\n else:\r\n table[parent] = [i]\r\n \r\n#print(table)\r\nflag = True\r\nfor k in sorted(table.keys()):\r\n leaf = 0\r\n for c in table[k]:\r\n if not c in table:\r\n #print(c)\r\n leaf+=1\r\n if leaf<3:\r\n #print(k,leaf)\r\n flag = False\r\n break\r\n\r\nprint(\"Yes\") if flag else print(\"No\")\r\n ", "t=int(input())\r\nlistt=[[]for i in range(t)]\r\nhas_child=[0]*(t+1)\r\nfor i in range(t-1):\r\n n=int(input())\r\n has_child[n]=1\r\n listt[n].append(i+2)\r\nfor i in listt:\r\n if len(i)>0:\r\n count=0\r\n for j in i:\r\n if has_child[j]==0:\r\n count+=1\r\n if count>=3:\r\n break\r\n else:\r\n print(\"NO\")\r\n break\r\nelse:\r\n print(\"YES\")", "\r\n\r\nn=int(input())\r\ngraph=[[] for _ in range(n)]\r\nindegre=[0]*(n)\r\nfor i in range(n-1):\r\n p=int(input())\r\n p-=1\r\n graph[p].append(i+1)\r\n indegre[p]+=1\r\nq=[(0)]\r\nf=True\r\nwhile q:\r\n node=q.pop()\r\n if not graph[node]:\r\n pass\r\n else :\r\n temp=0\r\n for child in graph[node]:\r\n if indegre[child]==0:\r\n temp+=1\r\n else :\r\n q.append(child)\r\n if temp<3:\r\n f=False\r\n break\r\n \r\nif f:\r\n print(\"Yes\")\r\nelse :\r\n print(\"No\")", "# ---------------------------------------------------------------------------------------\r\n# URL : https://codeforces.com/contest/913/problem/B\r\n# Title : Christmas Spruce\r\n# Tags : tag-codeforces, tag-problem-B, tag-difficulty-1200\r\n# Notes : implementation, trees\r\n# ---------------------------------------------------------------------------------------\r\n\r\n# ---------------------------------------------------Shared part--------------------------------------------------------\r\nimport math\r\nimport os\r\nimport time\r\nfrom collections import defaultdict, Counter\r\nfrom sys import stdin, maxsize, stdout\r\n\r\ninp = lambda: stdin.readline().strip()\r\niinp = lambda: int(inp())\r\nintl = lambda: list(map(int, inp().split()))\r\nstrl = lambda: list(inp().split())\r\nlist_to_string = lambda _a: \"\".join(map(str, _a))\r\nlist_to_string_list = lambda _a: \" \".join(map(str, _a))\r\n_dp = lambda default_value: defaultdict(lambda: default_value)\r\nflush = lambda: stdout.flush()\r\nprint_flush = lambda _text: (print(_text), flush())\r\nfact = lambda number: math.factorial(number)\r\ncnt = lambda _a: Counter(_a)\r\n\r\n\r\ndef lcm(a, b):\r\n return a * b // math.gcd(a, b)\r\n\r\n\r\ndef print_dp(_dict):\r\n for item in _dict.items():\r\n print(f\"{item[0]} = {item[1]}\")\r\n\r\n\r\nMOD = 10 ** 9 + 7\r\nINF = maxsize\r\nA = 911382323\r\nM = 9999999999879998\r\n\r\n\r\n# -------------------------------------------------------Solution-------------------------------------------------------\r\n\r\ndef solve():\r\n n = iinp()\r\n\r\n graph = defaultdict(set)\r\n\r\n for i in range(2, n + 1):\r\n u = iinp()\r\n\r\n if len(graph[u]) == 0:\r\n for key, value in graph.items():\r\n graph[key].discard(u)\r\n\r\n graph[u].add(i)\r\n\r\n for key, value in graph.items():\r\n if len(value) < 3:\r\n return \"No\"\r\n\r\n return \"Yes\"\r\n\r\n\r\ndef run():\r\n print(solve())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n if os.environ.get(\"DEBUG_CODEFORCES\"):\r\n stdin = open(\"../../input.txt\", \"r\")\r\n start_time = time.time()\r\n run()\r\n print(\"\\n--- %s seconds ---\\n\" % (time.time() - start_time))\r\n else:\r\n run()\r\n", "q=set()\r\nw={}\r\nfor i in range(int(input())-1):\r\n e=int(input())\r\n q.add(e)\r\n if e in w:\r\n w[e].add(i+2)\r\n else:\r\n w[e]={i+2}\r\nx=0\r\nfor i in w:\r\n o=0\r\n for j in w[i]:\r\n if j not in q:\r\n o+=1\r\n if o>2:x+=1\r\nprint(\"YES\"if x==len(w)else\"NO\")", "d=dict()\r\nd[1]=[]\r\nn=int(input())\r\nfor i in range(2,n+1):\r\n u=int(input())\r\n d[u].append(i)\r\n d[i]=[]\r\ndef spruce():\r\n for i in d:\r\n c=len(d[i])\r\n if c==0:\r\n continue\r\n for j in d[i]:\r\n if len(d[j])!=0:\r\n c-=1\r\n if c<3:\r\n return \"No\"\r\n return \"Yes\"\r\n\r\nprint(spruce())", "n=int(input())\r\nl=[]\r\nfor i in range(n-1):\r\n l.append(int(input()))\r\ndic={}\r\ns=2\r\nk=[]\r\nm=0\r\nfor i in range(n-1):\r\n dic.setdefault(l[i],[])\r\n dic[l[i]].append(s)\r\n k.append(l[i])\r\n s=s+1\r\nk=list(set(k))\r\nfor i in k:\r\n for key,value in dic.items():\r\n if i in value:\r\n value.remove(i)\r\n if len(value)<3:\r\n m=1\r\n break\r\n if m==1:\r\n break\r\nif m==0:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "class TreeNode:\r\n def __init__(self,val=0,parent=None):\r\n self.val = val\r\n self.parent = None\r\n self.children = []\r\n \r\ndef check(root):\r\n count = 0\r\n for child in root.children:\r\n # print(child.children)\r\n if not child.children:\r\n count += 1\r\n else:\r\n # print('child',child.val)\r\n if not check(child):\r\n return False\r\n if count < 3:\r\n return False\r\n return True\r\n \r\n \r\n \r\n \r\n\r\nn = int(input())\r\nroot = TreeNode(val=1)\r\nnodes = [root]\r\nfor i in range(2,n+1):\r\n p = int(input())\r\n node = TreeNode(i,p)\r\n nodes[p-1].children.append(node)\r\n nodes.append(node)\r\nif check(root):\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")\r\n\r\n\r\n ", "from sys import stdin\nfrom collections import defaultdict\ninput = stdin.readline\n\nvisited = [False] * 1200\nnon_rooted = [0] * 1200\nadj = defaultdict(lambda : list())\n\ndef dfs (node,parent):\n\tvisited[node] = True\n\tif len(adj[node]) == 0:\n\t\tif parent == -1:\n\t\t\tnon_rooted[1] += 1\n\t\telse:\n\t\t\tnon_rooted[parent] += 1\n\t\treturn;\n\tfor child in adj[node]:\n\t\tif not visited[child]:\n\t\t\tdfs(child,node)\n\nn = int(input())\nfor i in range(2,n + 1):\n\tu = int(input())\n\tadj[u].append(i)\ndfs (1,-1)\nyes = True\nfor i in range(1,n + 1):\n\tif len(adj[i]) > 0:\n\t\tif non_rooted[i] < 3:\n\t\t\tyes = False\n\t\t\tbreak\nprint(\"Yes\" if yes else \"No\")\n", "n = int(input())\nc = [0]*(n+1)\np = [0]*(n+1)\nfor i in range(n-1):\n thing = int(input())\n c[thing] += 1\n p[i+2] = thing\n\nans = 'Yes'\n\nfor i in range(n+1):\n\n if c[i] != 0:\n\n cnt = 0\n \n for j in range(n+1):\n\n if p[j] == i and c[j] == 0:\n cnt += 1\n\n if cnt < 3:\n \n ans = 'No'\n\n#print(c,p)\nprint(ans)\n \n", "n = int(input())\r\nV = []\r\nfor _ in range(n+1):\r\n V.append([])\r\nfor i in range(2, n+1):\r\n p = int(input())\r\n V[p].append(i)\r\n\r\ndef spruce():\r\n for i in range(1, n+1):\r\n if len(V[i])==0: continue # a leaf\r\n cnt = 0\r\n for x in V[i]:\r\n if len(V[x])==0:\r\n cnt += 1\r\n if cnt < 3: return False\r\n return True\r\n\r\nif spruce():\r\n print('Yes')\r\nelse:\r\n print('No')\r\n", "n = int(input())\r\nclass Node:\r\n def __init__(self):\r\n self.child = []\r\narr = [None for i in range(n)]\r\narr[0] = Node()\r\nfor i in range(1,n):\r\n idx = int(input())\r\n new = Node()\r\n arr[i] = new\r\n arr[idx-1].child.append(new)\r\n\r\nfor i in arr:\r\n ans = 0\r\n for j in i.child:\r\n if len(j.child) == 0:\r\n ans += 1\r\n if i.child != []:\r\n if ans < 3:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from sys import stdin,stdout\r\nfrom collections import defaultdict\r\ndef dfs(src,par):\r\n flag=0\r\n for neigh in g[src]:\r\n if neigh==par:continue\r\n dp[src]+=dfs(neigh,src)\r\n flag=1\r\n if flag==0:return 1\r\n return 0\r\nfor _ in range(1):#int(stdin.readline())):\r\n n=int(stdin.readline())\r\n # n,k=list(map(int,stdin.readline().split()))\r\n g=defaultdict(list)\r\n for i in range(2,n+1):\r\n nn=int(stdin.readline())\r\n g[nn]+=[i]\r\n g[i]+=[nn]\r\n # print(g)\r\n ans='Yes'\r\n dp=[0]*(1+n)\r\n dfs(1,-1)\r\n # print(dp)\r\n for i in range(1,n+1):\r\n if dp[i]==0 and len(g[i])>1:\r\n ans='No'\r\n break\r\n if dp[i] in [1,2]:\r\n ans='No'\r\n break\r\n print(ans)\r\n\r\n# 13\r\n# 1\r\n# 2\r\n# 2\r\n# 2\r\n# 1\r\n# 6\r\n# 6\r\n# 6\r\n# 1\r\n# 10\r\n# 10\r\n# 10", "n = int(input())\n\np = []\nfor _ in range(n - 1):\n temp = int(input()) - 1\n p.append(temp)\n\nleaves = []\nfor i in range(n):\n if i not in p:\n leaves.append(i)\n\nlp = []\nfor index, value in enumerate(p):\n if index + 1 in leaves:\n lp.append(value)\n\nx = min(lp.count(i) for i in p)\n\nprint(\"Yes\" if x >= 3 else \"No\")", "n = int(input())\r\np = [int(input()) - 1 for _ in range(n - 1)]\r\nleafs = list(filter(lambda x: not x in p, range(n)))\r\nlp = [x for i, x in enumerate(p) if i + 1 in leafs]\r\nx = min(lp.count(k) for k in p)\r\nprint(\"Yes\" if x >= 3 else \"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\nG = [[] for _ in range(n + 1)]\r\nfor i in range(2, n + 1):\r\n p = int(input())\r\n G[p].append(i)\r\nans = \"Yes\"\r\nfor i in range(1, n + 1):\r\n if not G[i]:\r\n continue\r\n c = 0\r\n for j in G[i]:\r\n if not G[j]:\r\n c += 1\r\n if c < 3:\r\n ans = \"No\"\r\n break\r\nprint(ans)", "n=int(input())\r\ng=[[] for _ in range(n+5)]\r\nv=[True for _ in range(n+5)]\r\nfor i in range(2,n+1):\r\n u=int(input())\r\n g[u].append(i)\r\n v[u]=False\r\nfor i in range(1,n+1):\r\n if len(g[i]) and sum(v[j] for j in g[i])<3:\r\n print('No')\r\n exit()\r\nprint('Yes')", "n = int(input())\r\nmatr = [[0] for i in range(n+1)]\r\nfor i in range(2, n+1):\r\n x = int(input())\r\n matr[x].append(i)\r\n\r\nflag = True\r\nfor i in range(1, n+1):\r\n if len(matr[i]) - 1 > 0:\r\n count = 0\r\n for j in range(1, len(matr[i])):\r\n if len(matr[matr[i][j]]) - 1 == 0:\r\n count += 1\r\n if count < 3:\r\n print(\"No\")\r\n flag = False\r\n break\r\nif flag:\r\n print(\"Yes\")", "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, graph):\r\n res = True\r\n\r\n def dfs(curr):\r\n nonlocal res\r\n ans = 0\r\n\r\n for child in graph[curr]:\r\n if len(graph[child]) == 0:\r\n ans += 1\r\n\r\n dfs(child)\r\n\r\n if len(graph[curr]) > 0 and ans < 3:\r\n res = False\r\n\r\n return ans\r\n\r\n dfs(1)\r\n return \"Yes\" if res else \"No\"\r\n\r\n\r\nN = read_int()\r\n\r\ngraph = defaultdict(list)\r\n\r\nfor i in range(2, N+1):\r\n p = read_int()\r\n graph[p].append(i)\r\n\r\nprint(solve(N, graph))\r\n", "import sys\r\nsys.setrecursionlimit(100000)\r\ndef pochti_dfs(n):\r\n ag=0\r\n if gg[n]!='list':\r\n for i in gg[n]:\r\n if gg[i]=='list':\r\n ag+=1\r\n if ag >= 3:\r\n for i in gg[n]:\r\n pochti_dfs(i)\r\n else:\r\n print('No')\r\n exit()\r\n\r\n\r\nd={1:'koren'}\r\ngg={}\r\nfor i in range(1,int(input())):\r\n f=int(input())\r\n d[i+1]=f\r\n if f in gg:\r\n gg[f].append(i+1)\r\n else:\r\n gg[f]=[i + 1]\r\nfor i in d:\r\n if i not in gg:\r\n gg[i]='list'\r\npochti_dfs(1)\r\nprint('Yes')\r\n\r\n\r\n\r\n", "from collections import Counter\r\nn=int(input())\r\nd={}\r\nl1=set()\r\nfor i in range(2,n+1):\r\n y=int(input())\r\n l1.add(y)\r\n if(y in d.keys()):\r\n del(d[y])\r\n d1={i:y}\r\n d.update(d1)\r\nl1.add(1)\r\nb=list(d.values())\r\na=Counter(b)\r\nc=list(a.values())\r\nf=False\r\nfor p in c:\r\n if(p<3):\r\n f=True\r\n break\r\nif(f):\r\n print('No')\r\nelse:\r\n b=set(b)\r\n if(b!=l1):\r\n print('No')\r\n else:\r\n print('Yes')", "from collections import deque\r\n\r\n# https://algoprog.ru/material/pc913pB\r\n\r\nN = int(input())\r\ngraph = {i: [] for i in range(1, N + 1)}\r\nfor i in range(2, N + 1):\r\n A = int(input())\r\n graph[A].append(i)\r\n\r\nq = deque()\r\nq.append(1)\r\n\r\nwhile len(q) > 0:\r\n top = q.popleft()\r\n leaves = 0\r\n for nt in graph[top]:\r\n if len(graph[nt]) == 0:\r\n leaves += 1\r\n else:\r\n q.append(nt)\r\n if leaves < 3:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "# https://codeforces.com/problemset/problem/913/B\n\ndef isLeaf(node):\n return not len(adj[node])\n\ndef solve(adj,n):\n for x in range(1, n+1):\n # print(adj[x])\n if len(adj[x]) and sum([isLeaf(node) for node in adj[x]]) < 3:\n return \"No\"\n return \"Yes\"\n\nn = int(input())\nadj = [[] for x in range(n+1)]\nfor x in range(2, n+1):\n node = int(input())\n adj[node].append(x)\nprint(solve(adj,n))\n", "n=int(input())\r\na={}\r\nfor i in range(n-1):\r\n s=int(input())\r\n if s in a:\r\n a[s].append(i+2)\r\n else:\r\n a[s]=[i+2]\r\nfor i in a:\r\n q=0\r\n for j in a[i]:\r\n if not j in a:\r\n q+=1\r\n if q<3:\r\n print('No')\r\n exit()\r\nprint('Yes')", "n = int(input())\r\nans = 'Yes'\r\n\r\ng = [[] for i in range(n + 1)]\r\nfor i in range(2, n + 1):\r\n x = int(input())\r\n g[x].append(i)\r\n\r\nmark = [False] * (n + 1)\r\nfor i in range(1, n + 1):\r\n if len(g[i]) == 0:\r\n mark[i] = True\r\n\r\nfor v in range(1, n + 1):\r\n if not mark[v]:\r\n count = 0\r\n for u in g[v]:\r\n if mark[u]:\r\n count += 1\r\n if count < 3:\r\n ans = 'No'\r\n\r\nprint(ans)\r\n", "n= int(input())\r\nls=[[] for i in range(n+1)]\r\nvertexes = set()\r\n\r\nfor i in range(2,n+1):\r\n j=int(input())\r\n ls[j].append(i)\r\n vertexes.add(j)\r\n \r\nfor i in range(len(ls)):\r\n temp = list()\r\n for j in range(len(ls[i])):\r\n if not ls[ls[i][j]]:\r\n temp += [ls[i][j]]\r\n ls[i] = temp\r\n \r\n \r\nmini = float(\"inf\")\r\nfor i in vertexes:\r\n mini = min(mini, len(ls[i]))\r\n \r\nif mini < 3:\r\n print('No')\r\nelse:\r\n print('Yes')", "n=int(input());\r\na=[0]*(n+1);\r\nc=[[] for i in range(n+1)];\r\nfor i in range(2,n+1):\r\n a[i]=int(input());\r\n c[a[i]].append(i);\r\n\r\nfor i in c:\r\n if(len(i)>0):\r\n k=0;\r\n for j in i:\r\n if(len(c[j])==0):k+=1;\r\n if(k>=3):break;\r\n if(k<3):print(\"No\");break;\r\nelse:print(\"Yes\");\r\n", "from collections import Counter, deque, defaultdict\r\nimport math\r\nfrom itertools import permutations, accumulate\r\nfrom sys import *\r\nfrom heapq import *\r\nfrom bisect import bisect_left, bisect_right\r\nfrom functools import cmp_to_key\r\nfrom random import randint\r\nxor = randint(10 ** 7, 10**8)\r\n# https://docs.python.org/3/library/bisect.html\r\non = lambda mask, pos: (mask & (1 << pos)) > 0\r\nlcm = lambda x, y: (x * y) // math.gcd(x,y)\r\nrotate = lambda seq, k: seq[k:] + seq[:k] # O(n)\r\ninput = stdin.readline\r\n'''\r\nCheck for typos before submit, Check if u can get hacked with Dict (use xor)\r\nObservations/Notes: \r\n'''\r\nn = int(input())\r\nadj = [[] for _ in range(n)]\r\n\r\nfor i in range(1, n):\r\n par = int(input())\r\n par -= 1\r\n adj[par].append(i)\r\n\r\nleafs = [False] * n\r\nfor i in range(n):\r\n if len(adj[i]) == 0:\r\n leafs[i] = True\r\nposs = True\r\nfor i in range(n):\r\n if not leafs[i]:\r\n count = 0\r\n for val in adj[i]:\r\n count += (leafs[val])\r\n poss &= (count >= 3)\r\nprint(\"Yes\" if poss else \"No\")", "q = int(input())\r\ngraff=[]\r\nleaf=[False]*(q+1)\r\nfor i in range(q+1):\r\n graff.append([])\r\nfor i in range(1,q):\r\n d=int(input())\r\n graff[d].append(i+1)\r\n\r\nfor i in range(1,q+1):\r\n cur = graff[i]\r\n if len(cur)!=0:\r\n c=0\r\n for j in cur:\r\n if len(graff[j])==0:\r\n c+=1\r\n if c<3:\r\n print('No')\r\n break\r\nelse:\r\n print('Yes')", "n = int(input())\r\na1 = dict()\r\nfor i in range(2, n + 1):\r\n n1 = int(input())\r\n if n1 in a1:\r\n a1[n1].append(i)\r\n else:\r\n a1[n1] = [i]\r\n\r\nfor i in a1:\r\n s = 0\r\n for j in a1[i]:\r\n if j not in a1:\r\n s += 1\r\n if s < 3:\r\n print('No')\r\n exit(0)\r\nprint('Yes')\r\n", "n=int(input())\r\ng={}\r\nfor i in range(1,n):\r\n p=int(input())\r\n if g.get(p):g[p].append(i+1)\r\n else:g[p]=[i+1]\r\nans='Yes'\r\nfor i in g:\r\n cnt=0\r\n for j in g[i]:\r\n if not(g.get(j)):cnt+=1\r\n if cnt<3:ans='No'\r\nprint(ans)", "n = int(input())\na = [1]*(n+1)\na[0] = 0\nb = [0]*(n+1)\nb[0] = -1\nb[1] = 1\np = {}\nfl = 1\nfor i in range(2, n+1):\n a[i] = int(input())\n b[a[i]] = 1\n p[a[i]] = []\nfor i in range(2, n+1):\n p[a[i]].append(i)\nc = 0\nfor keys in p:\n z = p[keys]\n c = 0\n for i in z:\n if b[i] == 0:\n c = c+1\n if c < 3:\n fl = 0\n break\nif fl == 0:\n print(\"No\")\nelse:\n print(\"Yes\")\n", "\r\nn=int(input())\r\ntree=[[] for i in range(n)]\r\nedge=[0]*n\r\nnonleaf=list()\r\n\r\nfor i in range(n-1):\r\n a=int(input())\r\n tree[a-1].append(i+2)\r\n edge[a-1]+=1\r\n#print(tree)\r\n\r\nfor i in range(n):\r\n if len(tree[i])!=0:\r\n nonleaf.append(i+1)\r\n#print(nonleaf)\r\nfor j in range(len(nonleaf)):\r\n c=0\r\n for k in tree[nonleaf[j]-1]:\r\n if k not in nonleaf:\r\n c+=1\r\n if c<3:\r\n print(\"No\")\r\n exit()\r\n\r\nprint(\"Yes\")\r\n\r\n\r\n", "def task():\r\n n = int(input())\r\n parent_list = [int(input()) for _ in range(n - 1)]\r\n adjacency_list = {x: [] for x in range(n)}\r\n for kid, parent in enumerate(parent_list):\r\n adjacency_list[parent - 1].append(kid + 1)\r\n for kids in adjacency_list.values():\r\n if len(kids) == 0:\r\n continue\r\n leaf_count = 0\r\n for kid in kids:\r\n if len(adjacency_list[kid]) == 0:\r\n leaf_count += 1\r\n if leaf_count < 3:\r\n return False\r\n return True\r\n\r\n\r\nif __name__ == '__main__':\r\n if task():\r\n print('Yes')\r\n else:\r\n print('No')\r\n", "I=input;R=range;n=int(I())\r\nl=[[]for i in R(n)]\r\nfor i in R(1,n):l[int(I())-1].append(i)\r\nprint('NYoe s'[all(sum(1 for i in x if not l[i])>2 for x in l if x)::2])\r\n", "import sys\r\ninput = lambda : sys.stdin.readline().strip()\r\nfrom collections import defaultdict\r\nn = int(input())\r\nhas = defaultdict(list)\r\nfor i in range(2,n+1):\r\n has[int(input())].append(i)\r\ndef dfs(node):\r\n res = 0\r\n for i in has[node]:\r\n if i not in has:\r\n res += 1\r\n else:\r\n if not dfs(i):return False\r\n return res >= 3\r\nif dfs(1):print('Yes')\r\nelse:print('No')\r\n\r\n", "#Inputs & Variables\nn = int(input())\nnodes = []\nfor i in range(1,n):\n x = int(input())\n nodes.append(x)\n\n#Functions\ndef is_leaf(a):\n if a in nodes:\n return False\n else:\n return True\n\ndef is_spruce(b):\n t = []\n f = []\n for i in range(0,n-1):\n if nodes[i] == b:\n if is_leaf(i+2) == True:\n t.append(i+2)\n else:\n f.append(i+2)\n if len(t) < 3:\n return False\n else:\n for i in range(0,len(f)):\n s = is_spruce(f[i])\n if s == False:\n return False\n return True\n\nq = is_spruce(1)\nif q == True:\n print(\"Yes\")\nelse:\n print(\"No\")", "\r\ndef dfs(v,dic):\r\n\r\n c=0\r\n ans=True\r\n for ch in dic[v]:\r\n if(ch not in dic ):\r\n c+=1\r\n else:\r\n ans=ans and dfs(ch,dic)\r\n if(c<3):\r\n return False\r\n return ans and True\r\n\r\ndef pro(arr):\r\n dic={}\r\n n=len(arr)\r\n for i in range(n):\r\n if( arr[i] in dic ):\r\n dic[arr[i]].append(i+2)\r\n else:\r\n dic[ arr[i] ] = [i+2]\r\n #print(dic)\r\n print( 'Yes' if dfs(1,dic) else 'No')\r\n\r\nt=int(input())\r\narr=[]\r\nfor i in range(t-1):\r\n n=int(input())\r\n arr.append(n)\r\npro(arr)", "n = int(input())\nchildren = [[]]\nfor i in range(n-1):\n children.append([])\n p = int(input()) - 1\n children[p].append(i + 1)\n\n\ndef is_spruce(node):\n if not children[node]:\n return True\n leaves = 0\n for c in children[node]:\n if len(children[c]):\n if not is_spruce(c):\n return False\n else: # leaf\n leaves += 1\n return leaves >= 3\n\n\nprint('Yes' if is_spruce(0) else 'No')\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([0]*n)\r\nfor r in range(1,n):\r\n c=int(input())\r\n a[r][c-1]=1\r\n a[c-1][r]=1\r\ne=0\r\nfor i in range(n):\r\n w=0\r\n q=0\r\n p=0\r\n if i!=0:\r\n if sum(a[i])!=1 and sum(a[i])<4:\r\n e+=1\r\n break\r\n elif sum(a[i])!=1:\r\n p=1\r\n else:\r\n if sum(a[i])<3:\r\n e+=1\r\n break\r\n elif sum(a[i])!=1:\r\n p=1\r\n if p==1:\r\n for u in range(n):\r\n if a[u][i]==1 and sum(a[u])==1:\r\n w+=1\r\n if w>=3:\r\n q=1\r\n break\r\n if q==0:\r\n e+=1\r\n break \r\nif e==0:\r\n print('Yes')\r\nelse:\r\n print('No')", "n = int(input())\r\ngraph = {i: [] for i in range(1, n + 1)}\r\nfor child in range(2, n + 1):\r\n parent = int(input())\r\n graph[parent].append(child)\r\nfor parent in range(1, n + 1): \r\n leafs = 0 \r\n if len(graph[parent]) != 0: \r\n for node in graph[parent]:\r\n if len(graph[node]) == 0: \r\n leafs += 1\r\n if leafs < 3:\r\n print('No')\r\n exit() \r\nprint('Yes')", "n = int(input())\r\nparents = [-1 for _ in range(n)]\r\nchildren = [[] for _ in range(n)]\r\nis_leaf = [True for _ in range(n)]\r\nis_leaf[0] = False\r\nfor i in range(1, n):\r\n a = int(input())\r\n parents[i] = a - 1\r\n children[a - 1].append(i)\r\n is_leaf[a - 1] = False\r\n\r\nleaves = []\r\nfor i in range(n):\r\n if is_leaf[i]:\r\n leaves.append(i)\r\nleaves = set(leaves)\r\n\r\nis_xmas_tree = True\r\nfor i in range(n):\r\n if not is_leaf[i]:\r\n if len(set(children[i]) & leaves) < 3:\r\n is_xmas_tree = False\r\n break\r\nif is_xmas_tree:\r\n print('Yes')\r\nelse:\r\n print('No')", "def solve(vals, n):\n mp = {}\n i = 1\n\n parents_set = set()\n for val in vals:\n i += 1\n if val in mp:\n mp[val].append(i)\n else:\n mp[val] = [i]\n parents_set.add(val)\n\n for key in mp:\n mp[key] = list(set(mp[key]).difference(parents_set))\n\n for i in range(n, 0, -1):\n if i in mp and len(mp[i]) < 3:\n return \"No\"\n return \"Yes\"\n\nif __name__ == '__main__':\n n = int(input())\n vals = []\n for i in range(n-1):\n vals.append(int(input()))\n print(solve(vals, n))\n\t\t \t\t\t\t\t \t\t\t\t\t\t \t \t\t\t \t", "from collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(list)\r\nfor i in range(n - 1):\r\n d[int(input())].append(i + 2)\r\n \r\nfor i in d.keys():\r\n c = 0 \r\n for j in d[i]:\r\n if(j not in d.keys()):\r\n c += 1 \r\n if(c < 3):\r\n print(\"No\")\r\n break \r\n \r\nelse:\r\n print(\"Yes\")", "from collections import defaultdict\r\nd = defaultdict(list)\r\n\r\nn = int(input())\r\nfor i in range(n-1):\r\n par = int(input())\r\n d[par].append(i+2)\r\n\r\n# print(d)\r\n\r\ndef trav(i):\r\n if len(d[i]) == 0:\r\n return True\r\n \r\n c = 0\r\n for node in d[i]:\r\n if len(d[node]) == 0:\r\n c += 1\r\n elif trav(node) == False:\r\n return False\r\n \r\n return True if c >= 3 else False\r\n\r\nif trav(1) == True:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "def checkCondition(i):\r\n nodes = len(a[i])\r\n if nodes > 0:\r\n leafsCount = 0\r\n for j in range(nodes):\r\n num = a[i][j]\r\n if len(a[num]) == 0:\r\n leafsCount += 1\r\n if leafsCount == 3:\r\n break\r\n return leafsCount >= 3\r\n else:\r\n return True\r\n\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n + 1):\r\n a.append([])\r\nfor i in range(2, n + 1):\r\n parent = int(input())\r\n a[parent].append(i)\r\n\r\nisChristmasTree = True\r\nfor i in range(1, n + 1):\r\n if not checkCondition(i):\r\n isChristmasTree = False\r\n break\r\n\r\nif isChristmasTree:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")", "import sys\r\nimport collections\r\ninput = sys.stdin.readline\r\n\r\ndef in_int():\r\n '''\r\n Read input string as int\r\n '''\r\n return (int(input()))\r\n\r\ndef in_int_space():\r\n '''\r\n Read space separated numbers as list of int\r\n '''\r\n return (list(map(int,input().split())))\r\n\r\ndef in_int_line(n):\r\n '''\r\n Read line separated input as list of int\r\n '''\r\n list = []\r\n for i in range(n):\r\n s = input()\r\n list.append(int(s[:len(s)-1]))\r\n return list\r\n\r\ndef in_str():\r\n '''Read string'''\r\n s = input()\r\n return s[:len(s)-1]\r\n\r\ndef in_str_arr():\r\n '''\r\n Read String as Char array\r\n '''\r\n s = input()\r\n return (list(s[:len(s)-1]))\r\n\r\ndef in_str_space():\r\n return input().split()\r\n\r\ndef in_str_line(n):\r\n list = []\r\n for i in range(n):\r\n s = input()\r\n list.append(s[:len(s)-1])\r\n return list\r\n\r\ndef main():\r\n n = in_int() \r\n\r\n graph = collections.defaultdict(list) \r\n\r\n for i in range(n-1):\r\n p = in_int()\r\n graph[p].append(i + 2)\r\n\r\n for i in range(1,n): \r\n if len(graph[i]) == 0:\r\n continue # Leaf \r\n count = 0 \r\n for adj in graph[i]:\r\n if len(graph[adj]) == 0:\r\n count += 1 \r\n if count < 3:\r\n print(\"No\")\r\n return \r\n print(\"Yes\") \r\n return \r\n\r\n\r\nmain()", "\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n \r\ndef isSpruce(G, cur):\r\n if len(G[cur]) < 3:\r\n return False\r\n \r\n # print(cur)\r\n ans = True\r\n count = 0\r\n for child in G[cur]:\r\n if child not in G:\r\n count += 1\r\n continue\r\n \r\n ans = ans and isSpruce(G, child)\r\n \r\n return ans and count >= 3\r\n \r\n\r\n\r\nG = {}\r\nfor child in range(inp() - 1):\r\n parent = inp()\r\n if parent in G:\r\n G[parent].append(child + 2)\r\n else:\r\n G[parent] = [child + 2]\r\n \r\n# print(G)\r\nif isSpruce(G, 1): \r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n \r\n ", "n= int(input())\r\nls = [[] for i in range(n+1)] \r\nfor i in range(2,n+1):\r\n j=int(input())\r\n ls[j].append(i)\r\n\r\nd = dict()\r\n\r\nfor i in range(n+1):\r\n if i and not ls[i]:\r\n d[i] = True\r\n\r\nfor i in range(n):\r\n if ls[i]:\r\n cnt = 0\r\n for j in range(len(ls[i])):\r\n cnt += d.get(ls[i][j], 0)\r\n if cnt < 3:\r\n print(\"No\")\r\n exit()\r\nprint(\"Yes\")", "import bisect\nimport sys\nimport math\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\ndef get_string(): return sys.stdin.readline().strip()\ndef get_int(): return int(sys.stdin.readline().strip())\ndef get_list_strings(): return list(map(str, sys.stdin.readline().strip().split()))\n\n\n# Output for list\n# sys.stdout.write(\" \".join(map(str, final)) + \"\\n\")\n\n# Output for int or str\n# sys.stdout.write(str(best) + \"\\n\")\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\ndef solve():\n n = get_int()\n t = n-1\n graph = {}\n\n while t:\n p = get_int()\n node = n-t+1\n\n if p not in graph:\n graph[p] = [node]\n else:\n graph[p].append(node)\n\n t -= 1\n \n queue = [1]\n # print(\"graph:-\", graph)\n while queue:\n node = queue.pop()\n\n if node not in graph:\n continue\n\n c = 0\n for ele in graph[node]:\n if ele not in graph:\n c += 1\n else:\n queue.append(ele)\n \n if c < 3:\n print(\"No\")\n return\n \n print(\"Yes\")\n \n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\nsolve()", "n = int(input())\r\narr = {}\r\nfor i in range(1, n + 1):\r\n arr[i] = []\r\nfor i in range(n - 1):\r\n p = int(input())\r\n arr[p].append(i + 2)\r\n\r\nres = \"Yes\"\r\nfor v in arr:\r\n if len(arr[v]) > 0:\r\n col = 0\r\n for u in arr[v]:\r\n col += int(len(arr[u]) == 0)\r\n if col < 3:\r\n res = \"No\"\r\nprint(res)\r\n", "n = int(input())\n\nancestors = []\nfor i in range(n):\n ancestors.append([])\n\nfor i in range(n - 1):\n pi = int(input())\n ancestors[pi - 1].append(i + 1)\n\nfor v in range(n):\n if len(ancestors[v]) == 0:\n continue\n\n if len(ancestors[v]) < 3:\n print(\"No\")\n exit(0)\n\n amount = 0\n for anc in ancestors[v]:\n if len(ancestors[anc]) == 0:\n amount += 1\n\n if amount < 3:\n print(\"No\")\n exit(0)\n\nprint(\"Yes\")", "#author: sushmanth\r\n\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\ninp = lambda : list(map(int,input().split())) \r\n\r\ndef answer():\r\n\r\n for u in range(1 , n + 1):\r\n if(outdeg[u] == 0):continue\r\n\r\n count = 0\r\n for v in child[u]:\r\n count += (outdeg[v] == 0)\r\n\r\n if(count < 3):return 'No'\r\n \r\n \r\n return 'Yes'\r\n\r\n\r\nfor T in range(1):\r\n\r\n n = int(input())\r\n p = [int(input()) for i in range(n - 1)]\r\n\r\n outdeg = [0 for i in range(n + 1)]\r\n child = [[] for i in range(n + 1)]\r\n for i in range(n - 1):\r\n outdeg[p[i]] += 1\r\n child[p[i]].append(i + 2)\r\n\r\n print(answer())\r\n\r\n \r\n", "n = int(input())\r\nc = [[] for i in range(n)]\r\nfor i in range(1, n):\r\n c[int(input())-1].append(i)\r\nprint('Yes' if all(len(c[i]) == 0 or sum(len(c[j]) == 0 for j in c[i]) >= 3 for i in range(n)) else 'No')\r\n", "import sys\nimport string\n\nfrom collections import Counter, defaultdict\nfrom math import fsum, sqrt, gcd, ceil, factorial\nfrom operator import *\nfrom itertools import accumulate\n\ninf = float(\"inf\")\n# input = sys.stdin.readline\nflush = lambda: sys.stdout.flush\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\n\n\n# inputs\n# ip = lambda : input().rstrip()\nip = lambda: input()\nii = lambda: int(input())\nr = lambda: map(int, input().split())\nrr = lambda: list(r())\n\n\nn = ii()\ntree = defaultdict(list)\n\n\ndef dfs(i, visited=[False] * (n + 10)):\n if visited[i]:\n return\n visited[i] = True\n if tree[i]:\n c = 0\n for j in tree[i]:\n if not tree[j]:\n c += 1\n if c < 3:\n print(\"No\")\n exit()\n\n for j in tree[i]:\n dfs(j, visited)\n\n\nfor i in range(1, n):\n tree[ii()].append(i + 1)\n# print(tree.items())\n\ndfs(1)\nprint(\"Yes\")", "from collections import defaultdict\nints = lambda: list(map(int, input().split()))\n\nmp = defaultdict(list)\nn = int(input())\n\nfor i in range(n-1):\n g = int(input())\n mp[g].append(i+2)\n\ns = 1\nfor i in list(mp):\n sm = len(mp[i])\n for j in mp[i]:\n if mp[j]:\n sm -= 1\n if sm < 3: print(\"No\"); exit()\nprint(\"Yes\")\n\n\t\t \t\t \t\t \t\t\t \t \t\t \t\t\t\t\t \t", "# cook your dish here\r\ntree = {}\r\nfor i in range(int(input())-1):\r\n n = int(input())\r\n if n in tree:\r\n tree[n].append(i+2)\r\n else:\r\n tree[n] = [i+2]\r\n \r\nfor node in tree:\r\n leaf = 0\r\n for child in tree[node]:\r\n if child not in tree:\r\n leaf += 1\r\n if leaf < 3:\r\n print(\"No\")\r\n break\r\nelse:\r\n print(\"Yes\")", "from collections import defaultdict\n\nd =defaultdict(list)\nflag = True\nfor i in range(int(input())-1):\n\tx = int(input())\n\td[x].append(i+2)\n\nfor i in d:\n\ttemp = 0\n\tfor j in d[i]:\n\t\tif j not in d:\n\t\t\ttemp += 1\n\tif temp <3:\n\t\tflag = False\n\t \nif flag == True:\n\tprint(\"Yes\")\nelse:\n\tprint(\"No\")\n" ]

[ "days = int(input())\nsequence = input().split()\nfolder = 1\nbad_rep = 0\nrep = 0\nans = \"\"\nfor profit in sequence:\n rep += 1\n if int(profit) < 0:\n bad_rep += 1\n if bad_rep == 3:\n folder += 1\n ans = ans + str(rep - 1) + \" \"\n bad_rep = 1\n rep = 1\n\nans += str(rep)\nprint(folder)\nprint(ans)\n\t \t\t\t\t\t \t\t\t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\nf = []\r\ncur = 0\r\nf.append(0)\r\ncurr = 0\r\nfor i in a:\r\n if i < 0:\r\n curr += 1\r\n if curr >= 3:\r\n curr = 1\r\n f.append(1)\r\n cur += 1\r\n continue\r\n else:\r\n f[cur] += 1\r\n else:\r\n f[cur] += 1\r\nprint(len(f))\r\nprint(*f)", "n=int(input())\r\nL=input().split()\r\ncountneg=0\r\nnum=0\r\nT=''\r\nsum = 1 \r\nfor i in range(n) :\r\n num=num+1\r\n if int(L[i])<0 :\r\n countneg=countneg+1\r\n if countneg==3 :\r\n sum=sum+1\r\n countneg=1\r\n T=T+str(num-1)+' '\r\n num=1\r\nT=T+str(num)\r\nprint(sum)\r\nprint(T)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nk,res,last,length=0,[0],0,1\r\nfor i,x in enumerate(lst):\r\n if x<0:\r\n if k==2:\r\n res.append(i-last)\r\n length+=1\r\n last,k=i,1\r\n else:k+=1\r\nres.append(n-last)\r\nres.pop(0)\r\nprint(length)\r\nprint(*res)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[]\r\nc=0\r\nfor i in range(n):\r\n if a[i]<0 and c<=2:\r\n c+=1\r\n if a[i]<0 and c==3:\r\n c=1\r\n b.append(i)\r\nif n not in b:\r\n b.append(n)\r\n#rint(b)\r\nd=[]\r\nd.append(b[0])\r\nfor i in range(1,len(b)):\r\n d.append(b[i]-b[i-1])\r\nprint(len(d))\r\nfor i in d:\r\n print(i,end=' ')\r\nprint('')\r\n \r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n lucro = [int(x) for x in input().split()]\r\n n_pasta = 0\r\n dias_por_pasta = [0]\r\n neg = 0\r\n for i in range(n):\r\n # print(\"**********\")\r\n # print(neg)\r\n # print(lucro[i])\r\n if neg<2:\r\n dias_por_pasta[n_pasta] += 1\r\n if lucro[i]<0:\r\n neg+=1\r\n elif neg == 2:\r\n if lucro[i]<0:\r\n dias_por_pasta.append(1)\r\n n_pasta += 1\r\n neg = 1\r\n else:\r\n dias_por_pasta[n_pasta] += 1\r\n # print(dias_por_pasta)\r\n print(n_pasta+1)\r\n print(' '.join(map(str,dias_por_pasta))) \r\n\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nres = []\r\nprev = 0 \r\nneg = 0 \r\nfor i in range(n):\r\n if arr[i] < 0 : neg += 1 \r\n\r\n if neg >= 3 :\r\n res.append(len(arr[prev:i]))\r\n prev = i \r\n neg = 1 \r\n\r\nif prev < n :\r\n res.append(len(arr[prev:]))\r\nprint(len(res))\r\nprint(*res)\r\n\r\n\r\n ", "n=int(input())\r\nL=list(map(int,input().split()))\r\n\r\nstart=0\r\ncount=0\r\nsize=[]\r\nfor i in range(n):\r\n if L[i]<0:\r\n count+=1\r\n if count==3:\r\n size.append(i-start)\r\n start=i\r\n count=1\r\n if i==n-1:\r\n size.append(i-start+1)\r\n\r\n\r\nprint(len(size))\r\nprint(*size)\r\n \r\n\r\n\r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=len(list(filter(lambda x:x<0,a)))\r\nif c==0:\r\n ans=1\r\nelse:\r\n ans=c//2+c%2\r\nprint(ans)\r\nneg,x,y=0,0,0\r\nfor i in range(n):\r\n if a[i]<0:\r\n neg+=1\r\n x+=1\r\n if neg==2 and ans>1:\r\n print(f\"{x} \",end=\"\")\r\n y+=x\r\n neg,x=0,0\r\n ans-=1\r\n elif neg==2 and ans==1:\r\n break\r\nprint(n-y,end=\"\",sep=\"\") ", "Answer = []\r\nN = int(input())\r\nNegative, Count = 0, 0\r\nX = list(map(int, input().split()))\r\nfor i in range(N):\r\n if X[i] < 0:\r\n if Negative == 2:\r\n Answer.append(Count)\r\n Negative = 1\r\n Count = 0\r\n else:\r\n Negative += 1\r\n Count += 1\r\nAnswer.append(Count)\r\nprint(len(Answer))\r\nprint(*Answer)\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Mashhad for few days\r\n# Caption: Finally happened what should be happened\r\n# CodeNumber: 697\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nng=0\r\nresult=[]\r\nfor i in range(n):\r\n \r\n if l[i]<0 and ng==2:\r\n \r\n result.append(c)\r\n c=1\r\n ng=1\r\n \r\n elif l[i]<0:\r\n ng+=1\r\n c+=1\r\n else:\r\n c+=1\r\n\r\nresult.append(c) \r\nprint(len(result)) \r\nprint(*result)", "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\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 n = II()\r\n a = LII()\r\n folders = []\r\n\r\n l = 0\r\n minusCount = 0\r\n for r in range(n):\r\n minusCount += (a[r] < 0)\r\n if minusCount == 3:\r\n folders.append(r-l)\r\n minusCount = 1\r\n l = r\r\n folders.append(n-l) \r\n \r\n print(len(folders))\r\n WS(folders)\r\n\r\nsolve()\r\n", "\r\n\r\nimport sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\nan = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nres = 0\r\nv = []\r\np = 0\r\nk = 0\r\nfor i in an:\r\n\tif(i < 0):\r\n\t\tif(p < 2):\r\n\t\t\tp += 1\r\n\t\telse:\r\n\t\t\tp = 1\r\n\t\t\tv.append(str(k))\r\n\t\t\tres += 1\r\n\t\t\tk = 0\r\n\tk += 1\r\n\t\r\nif(k != 0):\r\n\tres += 1\r\n\tv.append(str(k))\r\n\t\r\nprint(res)\r\nprint(\" \".join(v))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nc, s, q = 0, 0, 0\r\nd = []\r\nfor i in range(n):\r\n q += 1\r\n if w[i] < 0:\r\n c += 1\r\n if c == 3:\r\n s += 1\r\n c = 1\r\n q -= 1\r\n d.append(q)\r\n q = 1\r\n\r\ns += 1\r\nd.append(q)\r\nprint(s)\r\nprint(' '.join(map(str, d)))", "n = int(input())\nprofit_per_day = list(map(int, input().split()))\n\nfolders = []\nn_files = 0\nnegatives = 0\n\nfor i in range(len(profit_per_day)):\n n_files += 1\n if profit_per_day[i] < 0:\n negatives += 1\n if negatives == 3:\n folders.append(n_files-1)\n n_files = 1\n negatives = 1\n\nif n_files > 0:\n folders.append(n_files)\n\nres = \" \".join([str(num) for num in folders])\nprint(len(folders))\nprint(res)\n\n\t\t \t \t\t\t \t\t \t \t \t \t\t \t\t \t", "n = int(input())\na = list(map(int, input().split()))\nans = []\ncur, neg = 0, 0\nfor x in a:\n cur += 1\n if x < 0:\n neg += 1\n if neg > 2:\n ans.append(cur - 1)\n neg = 1\n cur = 1\nans.append(cur)\nprint(len(ans))\nprint(*ans)\n \t \t\t \t \t\t\t \t\t\t\t \t", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\ncur = 0\r\nwhile cur < n:\r\n cnt = 0\r\n size = 0\r\n while cur < n and cnt < 3:\r\n if a[cur] < 0:\r\n cnt += 1\r\n cur += 1\r\n size += 1\r\n if cnt == 3:\r\n cur -= 1\r\n size -= 1\r\n b.append(size)\r\n\r\nprint(len(b))\r\nprint(\" \".join(map(str, b)))", "n = int(input())\r\ndig = list( map(int, input().split() ))\r\nflag = 0\r\nindex = 0\r\n\r\nfolder = []\r\nfor i in range(n):\r\n folder.append( 0 )\r\n\r\nfor i in dig:\r\n if i<0:\r\n flag+=1\r\n if flag == 3:\r\n flag = 1\r\n index +=1\r\n folder[index]+=1\r\n \r\nprint( index+1 )\r\n\r\nfor i in range(index+1):\r\n print(folder[i], end = \" \")", "def main():\r\n n = int(input())\r\n a = [int(c) for c in input().split()]\r\n\r\n neg = days = 0\r\n res = []\r\n for i in range(n):\r\n if neg == 2 and a[i] < 0:\r\n res.append(days)\r\n neg = days = 0\r\n \r\n days += 1\r\n if a[i] < 0:\r\n neg += 1\r\n\r\n if days > 0:\r\n res.append(days)\r\n\r\n print(len(res))\r\n print(*res)\r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k=int(input())\r\nb=list(map(int,input().split()))\r\nl=[]\r\nc=0\r\nx=0\r\ni=0\r\nwhile i<len(b):\r\n if b[i]<0:\r\n c=c+1\r\n if c==3:\r\n c=1\r\n l.append(x)\r\n x=1\r\n else:\r\n x=x+1\r\n else:\r\n x=x+1\r\n i+=1\r\nl.append(x)\r\nprint(len(l))\r\nprint(*l,sep=\" \")", "n=int(input())\r\na=[*map(int,input().split())]\r\ncount,days,total,b=0,0,0,[]\r\nfor i in range(n):\r\n\tdays+=1\r\n\tif a[i]<0:count+=1\r\n\tif count==3:\r\n\t\ttotal+=1\r\n\t\tb.append(days-1)\r\n\t\tdays=1\r\n\t\tcount=1\r\nelse:\r\n\tprint(total+1)\r\n\tb.append(days)\r\n\tprint(*b)", "n = int(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\ncount = 0\r\ncur_count = 0\r\ndaf_count = []\r\nfor i in range(n):\r\n count += 1\r\n if daf[i] < 0:\r\n if cur_count == 2:\r\n daf_count.append(count - 1)\r\n cur_count = 1\r\n count = 1\r\n else:\r\n cur_count += 1\r\n \r\ndaf_count.append(count)\r\n\r\nprint(len(daf_count))\r\nprint(*daf_count)\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\ncounter_negative = 0\ncurrent = 0\n\nres = []\n\nfor a in arr:\n current += 1\n if a < 0:\n counter_negative += 1\n\n if counter_negative == 3:\n res.append(current-1)\n current = 1\n counter_negative = 1\nres.append(current)\n\nprint(len(res))\nfor r in res:\n print(r, end=' ')\n", "p, x, y, n, t = [], 0, 0, int(input()), list(map(int, input().split()))\r\nfor i in range(n):\r\n if t[i] < 0: x += 1\r\n if x == 3:\r\n p.append(i - y)\r\n x = 1\r\n y = i\r\n \r\np.append(n - y)\r\nprint(len(p))\r\nprint(' '.join(str(i) for i in p))", "\nt = int(input())\na = list(map(int, input().split()))\ngg = 0\nans1 = 0 \nans2 = 0\nans2_s = []\nfor i in range(t):\n if a[i] < 0 and gg + 1 < 3:\n ans2 += 1\n gg += 1\n elif a[i] < 0 and (gg + 1) == 3:\n ans1 += 1\n gg = 1\n ans2_s.append(ans2)\n ans2 = 1\n elif a[i] >= 0:\n ans2 += 1\nif ans2 != 0:\n ans1 += 1\n ans2_s.append(ans2)\nprint(ans1)\nprint(*ans2_s)", "r=[]\r\nsr=[]\r\nx=0\r\ninput()\r\ns=list(map(int,input().split()))\r\nfor i in (s):\r\n if i <0:\r\n x+=1\r\n if x<3:\r\n sr.append(i)\r\n else:\r\n r.append(sr)\r\n sr=[]\r\n sr.append(i)\r\n if i<0:\r\n x=1\r\n else:\r\n x=0\r\nr.append(sr)\r\n\r\nprint(len(r))\r\nresult=[]\r\nfor i in r:\r\n result.append(str(len(i)))\r\nprint(' '.join(result))\r\n", "def solve(n,arr):\r\n ans = []\r\n curr = 0\r\n neg = 0\r\n for i in arr:\r\n if i<0:\r\n if neg==2:\r\n ans.append(curr)\r\n neg = 1\r\n curr = 1\r\n else: \r\n neg += 1\r\n curr += 1\r\n else:\r\n curr += 1\r\n \r\n ans.append(curr)\r\n \r\n return ans\r\n\r\nif __name__==\"__main__\":\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n ans = solve(n,arr)\r\n print(len(ans))\r\n print(*ans)", "n = int(input())\r\nreports = list(map(int , input().split()))\r\ncount = 0\r\ni=0\r\nfolders = 1\r\narr=[]\r\npos = 0\r\nwhile i<len(reports):\r\n if reports[i]<0:\r\n count = count+1\r\n pos = pos + 1\r\n if count==3:\r\n count= 1\r\n folders = folders + 1\r\n arr.append(pos-1)\r\n pos = 1\r\n i = i + 1\r\nif sum(arr)!=len(reports):\r\n arr.append(len(reports)- sum(arr))\r\nprint(folders)\r\nprint(*arr)", "n = int(input())\r\narr = list(map(int, input().split()))\r\ns = 0\r\ni = 0\r\nl = []\r\nwhile i <= n:\r\n while list(map(lambda a: a >= 0, arr[s:i+1])).count(False) <= 2:\r\n i += 1\r\n if i == n:\r\n break\r\n l.append(len(arr[s:i]))\r\n s = i\r\n if i == n:\r\n break\r\n\r\nprint(len(l))\r\nprint(*l)\r\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nres = [0]\r\ncount = 0\r\nfor n in a:\r\n if n < 0:\r\n if count == 2:\r\n count = 0\r\n res.append(0)\r\n count += 1\r\n res[-1] += 1\r\nprint(len(res))\r\nprint(*res)\r\n\r\n", "import math\r\nimport sys\r\nfrom decimal import *\r\nfrom collections import deque\r\n \r\n \r\nalfabet = {'a': 1, 'b': 2,'c': 3,'d': 4,'e': 5,'f': 6,'g': 7,'h': 8,'i': 9,'j': 10,'k': 11,'l': 12,'m': 13,'n': 14,'o': 15,'p': 16,'q': 17,'r': 18,'s': 19,'t': 20,'u': 21,'v': 22,'w': 23,'x': 24,'y': 25,'z': 26}\r\n\r\ndef prime_generator(nr_elemente_prime):\r\n \r\n vector_prime=[-1]*nr_elemente_prime\r\n vector_rasp=[0]*nr_elemente_prime\r\n \r\n vector_prime[1]=1\r\n \r\n vector_rasp[1]=1\r\n#primes sieve \r\n contor=2\r\n \r\n for i in range(2,nr_elemente_prime):\r\n if vector_prime[i]==-1:\r\n vector_prime[i]=1\r\n vector_rasp[contor]=i\r\n contor=contor+1\r\n for j in range(i+i,nr_elemente_prime,i):\r\n if vector_prime[j]==-1:\r\n vector_prime[j]=i\r\n return vector_rasp \r\n \r\n#print(vector[9995:10001])\r\n\r\n#c=int(input())\r\n\r\n \r\nfor i in range(0,1):\r\n #n=map(int,input().split())\r\n #n=int(input())\r\n #print(n,a,b)\r\n #n,k=list(map(int,input().split()))\r\n n=int(input())\r\n \r\n \r\n my_set=[0]*n\r\n \r\n lista=list(map(int,input().split()))\r\n contor=0\r\n cate=1\r\n startare=0\r\n poz_a=-1\r\n while poz_a+1<n:\r\n \r\n if lista[poz_a+1]<0:\r\n contor+=1\r\n #print(\"poz a=\" , poz_a,contor)\r\n \r\n if contor==3:\r\n #print(poz_a)\r\n contor=0\r\n my_set[cate]=poz_a+1\r\n poz_a-=1\r\n cate+=1\r\n \r\n \r\n poz_a+=1 \r\n print(cate)\r\n rasp=\"\"\r\n for i in range(1,cate):\r\n print(my_set[i]-my_set[i-1],end=' ')\r\n print(n-my_set[cate-1]) \r\n #print(my_set) \r\n \r\n#print(rasp) ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = []\r\nt = 0\r\nk = 0\r\nfor i in range(n):\r\n if a[i] < 0:\r\n t += 1\r\n if t == 3:\r\n b.append(i - k)\r\n k = i\r\n t = 1\r\nb.append(n - k)\r\nprint(len(b))\r\nfor i in range(len(b)):\r\n print(b[i], end=' ')\r\n\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nk = 0\r\nm = 0\r\nfolders = []\r\nfor i in range(n):\r\n\tif lst[i] < 0:\r\n\t\tk+=1\r\n\tif k == 3:\r\n\t\tfolders.append(i-m)\r\n\t\tm = i\r\n\t\tk = 1\r\n\t\r\nif m<n:\r\n\tfolders.append(n-m)\r\nprint(len(folders))\r\nfor i in range(len(folders)):\r\n\tif i == len(folders)-1:\r\n\t\tprint(folders[i],end='\\n')\r\n\telse:\r\n\t\tprint(folders[i],end=' ')", "input()\r\ndays = map(int, input().split())\r\nfolders = []\r\nfc = 0\r\nc = 0\r\n\r\nfor i in days:\r\n if i < 0:\r\n if c < 2:\r\n c += 1\r\n else:\r\n fc += 1\r\n c = 1\r\n if len(folders) <= fc:\r\n folders.append(0)\r\n folders[fc] += 1\r\n\r\nprint(fc + 1)\r\nprint(*folders)", "__author__ = 'Alex'\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\ncnt1, cnt2 = [0] * 2\r\nans = []\r\nfor i in a:\r\n if i < 0:\r\n if cnt2 > 1:\r\n ans.append(cnt1)\r\n cnt1 = cnt2 = 0\r\n cnt2 += 1\r\n cnt1 += 1\r\nif cnt1 > 0:\r\n ans.append(cnt1)\r\nprint(len(ans))\r\nprint(' '.join([str(i) for i in ans]))", "n = int(input())\r\na = list(map(int, input().split()))\r\nreports = 0\r\nfolders = []\r\nlose = 0\r\nfor i in range(n):\r\n reports += 1\r\n if a[i] < 0:\r\n if lose == 2:\r\n folders.append(str(reports-1))\r\n reports = 1\r\n lose = 1\r\n else:\r\n lose += 1\r\nfolders.append(str(reports))\r\nprint(len(folders))\r\nprint(\" \".join(folders))", "from math import ceil\r\n\r\nn=int(input())\r\nreports = list(map(int,input().split()))\r\nk=0\r\ncount=0\r\nlst=[]\r\nfor i in reports:\r\n count += 1\r\n if i<0:\r\n if k+1 > 2:\r\n lst.append(count-1)\r\n count=1\r\n k=1\r\n else:\r\n k+=1\r\nlst.append(count)\r\nprint(len(lst))\r\nfor i in lst:\r\n print(i,end=' ')\r\n\r\n\r\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf, log2, sqrt, log10\r\nfrom bisect import bisect_right, bisect_left\r\nfrom statistics import mode\r\nfrom string import ascii_uppercase\r\n\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = []\r\n\r\nnegs = 0\r\ncnt = 0\r\nfor n in arr:\r\n if n < 0:\r\n negs += 1\r\n if negs == 3:\r\n ans.append(cnt)\r\n cnt = 0\r\n negs = 1\r\n cnt += 1\r\nans.append(cnt)\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nnegs = 0\r\ntot = 0\r\nans = []\r\n\r\nfor i in range(n):\r\n tot += 1\r\n if data[i] < 0:\r\n negs += 1\r\n if negs == 3:\r\n ans.append(tot - 1)\r\n tot = 1\r\n negs = 1\r\n if i == n - 1:\r\n ans.append(tot)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "n = input()\r\ns = input().split(\" \")\r\nrugi, jumlah, berkas = 0, 0, []\r\nfor j, i in enumerate(s):\r\n if int(i) < 0:\r\n rugi += 1\r\n if rugi == 3:\r\n rugi = 1\r\n berkas.append(str(jumlah))\r\n jumlah = 1\r\n else:\r\n jumlah += 1\r\n else:\r\n jumlah += 1\r\n if j == len(s)-1:\r\n berkas.append(str(jumlah))\r\nprint(len(berkas), \" \".join(berkas), sep='\\n')\r\n", "def noli(n,a):\r\n for i in range(n):\r\n if a[i]>=0:\r\n a[i]=1\r\n else:\r\n a[i]=0\r\n return a\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nb = []\r\nz = 0\r\ns = 0\r\na = noli(n,a)\r\nfor i in range(n):\r\n if a[i]==0:\r\n z += 1\r\n if z==3:\r\n z=1\r\n b.append(s)\r\n s=0\r\n s+=1\r\nb.append(s)\r\nprint(len(b))\r\nprint(*b)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nk = []\r\nnow = 0\r\ncnt = 0\r\nfor i in a:\r\n if i < 0:\r\n now += 1\r\n cnt += 1\r\n if now == 3:\r\n k.append(cnt - 1)\r\n now = 1\r\n cnt = 1\r\n\r\nif cnt:\r\n k.append(cnt)\r\nprint(len(k))\r\nprint(*k)", "n, a = int(input()), (int(i) for i in input().split())\nres, cnt = [], 0\nfor i, e in enumerate(a):\n if e < 0:\n cnt += 1\n if cnt == 3:\n res.append(i)\n cnt = 1\nres.append(n)\nres = [res[i] - (res[i - 1] if i > 0 else 0) for i in range(len(res))]\nprint(len(res))\nprint(*res)\n", "n = int(input())\r\n \r\nprofs = list(map(int, input().split()))\r\n \r\nres = []\r\n \r\ncurrTotal = 0\r\n \r\ncurrNegs = 0\r\n \r\nfor prof in profs:\r\n if prof>= 0:\r\n currTotal+=1\r\n \r\n else:\r\n if currNegs == 2:\r\n res.append(currTotal)\r\n currTotal = 1\r\n currNegs = 1\r\n else:\r\n currNegs+=1\r\n currTotal+=1\r\n \r\n \r\nres.append(currTotal)\r\n \r\nprint(len(res))\r\n \r\nprint(*res)", "n = int(input())\ndays = list(map(int, input().split()))\nresult = []\n\ncount = 0\nnegatives = 0\nfor day in days:\n if day >= 0:\n count += 1\n elif negatives < 2:\n count += 1\n negatives += 1\n else:\n result.append(count)\n count = 1\n negatives = 1\n\nif count > 0:\n result.append(count)\n\nprint(len(result))\nfor a in result:\n print(a, end=' ')\n\n\t \t \t\t \t \t\t \t \t \t\t \t \t", "def readln(): return tuple(map(int, input().split()))\n\nn, = readln()\ncnt = al = 0\nans = []\nfor a in readln():\n if cnt == 2 and a < 0:\n ans.append(al)\n cnt = al = 0\n al += 1\n cnt += a < 0\nans.append(al)\nprint(len(ans))\nprint(*ans)\n", "# Required Modules\r\nimport sys\r\nfrom collections import deque\r\nfrom itertools import combinations\r\n\r\nsys.setrecursionlimit(10**9)\r\n\r\ndef list_input():\r\n return list(map(int,input().split()))\r\ndef string_input():\r\n return input()\r\ndef int_input():\r\n return int(input())\r\n\r\n# Predefined Function \r\ndef is_prime(n):\r\n for i in range(2,int(n**0.5)+1):\r\n if n%i==0:\r\n return False\r\n return True\r\ndef find_factors(num):\r\n return [i for i in range(1, num + 1) if num % i == 0]\r\n\r\ndef create_pairs(arr):\r\n return list(combinations(arr, 2))\r\n\r\n\r\n\r\ndef solve():\r\n n = int_input()\r\n arr = list_input()\r\n ans = [0]\r\n res = 0\r\n for i in arr:\r\n if i<0:\r\n res+=1\r\n if res>=3:\r\n ans.append(0)\r\n res=1\r\n ans[-1]+=1\r\n print(len(ans))\r\n print(*ans)\r\n\r\nsolve()", "n = int(input())\r\n\r\nnuml = [int(a) for a in input().split()]\r\n\r\nnegativeCount = 0\r\nfolderslenghts = []\r\ndaysCounter = 0\r\n\r\nfor i in numl:\r\n if i < 0:\r\n negativeCount += 1\r\n daysCounter += 1\r\n if negativeCount == 3:\r\n folderslenghts.append(daysCounter-1)\r\n daysCounter = 1\r\n negativeCount = 1\r\n else:\r\n daysCounter += 1\r\n\r\nfolderslenghts.append(daysCounter)\r\n\r\nprint(len(folderslenghts))\r\nprint(*folderslenghts)\r\n\r\n", "n = int(input())\nx = list(map(int, input().split()))\nans, cur_cnt = 0, 0\na = []\nfor i in range(n):\n if x[i] < 0:\n cur_cnt += 1\n if cur_cnt == 3:\n ans += 1\n cur_cnt = 1\n if len(a) == 0:\n a.append(i)\n else:\n a.append(i - sum(a))\n if i == n - 1 and cur_cnt != 3:\n ans += 1\n a.append(i - sum(a) + 1)\nif ans == 0:\n print(1)\nelse:\n print(ans)\nif len(a) == 0:\n print(n)\nelse:\n print(*a)\n", "days = int(input())\nreports = tuple(map(int, input().split(' ')))\n\ncntloss = 0; cntdays = 0\nfolders = []\nfor rep in reports:\n if rep < 0:\n cntloss += 1\n if cntloss > 2:\n folders.append(cntdays)\n cntloss = 1\n cntdays = 0\n cntdays += 1\nif cntdays > 0:\n folders.append(cntdays)\nprint(len(folders))\nprint(*folders)\n \t\t\t\t\t\t \t \t \t \t\t \t\t \t \t\t\t\t\t\t", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nfails = 0\r\nans = []\r\nfor i in range(n):\r\n if a[i] < 0 and fails == 2:\r\n ans.append(k)\r\n k = 1\r\n fails = 1\r\n else:\r\n k += 1\r\n fails += (a[i] < 0)\r\nif sum(ans) < n:\r\n ans.append(k)\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans)))", "n=c=0;r=[]\nfor x in map(int,[*open(0)][1].split()):\n if x<0:\n if n==2:\n r+=[c]\n n=1\n c=0\n else:n+=1\n c+=1\nr+=[c]\nprint(len(r))\nprint(*r)\n \t \t\t\t \t \t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=0\r\nb=[]\r\nlast_pos=0\r\nlose_count=0\r\nfor i in range(n):\r\n if lose_count==2 and a[i]<0:\r\n k+=1\r\n b.append(i-last_pos)\r\n last_pos=i\r\n lose_count=0\r\n if a[i]<0:\r\n lose_count+=1\r\nb.append(i-last_pos+1)\r\nk+=1\r\nprint(k)\r\nfor bb in b:\r\n print(bb,end=' ')\r\nprint()", "\r\n\r\nn = int(input())\r\n\r\na = [int(s) for s in input().split(' ')]\r\n\r\nfolders = []\r\nn = 0\r\ncount = 0\r\nfor i in a:\r\n if(n == 2 and i < 0):\r\n folders.append(count)\r\n count = 1\r\n n = 1\r\n continue\r\n if(i < 0):\r\n n += 1\r\n count += 1\r\nfolders.append(count)\r\nprint(len(folders))\r\nfor i in folders:\r\n if(i != 0):\r\n print(i,end =\" \")", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nres = []\r\ntot, neg = 0, 0\r\nfor i, x in enumerate(lst):\r\n tot += 1\r\n if x < 0: \r\n neg += 1\r\n if neg == 3:\r\n res.append(tot-1)\r\n neg = 1\r\n tot = 1\r\nif tot > 0:\r\n res.append(tot)\r\n\r\nprint(len(res))\r\nprint(\" \".join(str(x) for x in res))", "P=print\r\nI=input\r\nI()\r\na=b=0\r\nt=[]\r\nfor x in map(int,I().split()):\r\n\tif x<0:\r\n\t\tif b==2:t+=[a];b=1;a=0\r\n\t\telse:b+=1\r\n\ta+=1\r\nif a:t+=[a]\r\nP(len(t))\r\nfor x in t:P(x,end=' ')\r\n", "n = int(input())\nprofit = [int(i) for i in input().split()]\nfoldersContent = []\ncountDays=0\ncountLosses=0\nfor i in profit:\n countDays+=1\n if(i<0):\n countLosses+=1\n if(countLosses==3):\n foldersContent.append(countDays-1)\n countDays=1\n countLosses=1\nfoldersContent.append(countDays)\n\nprint(len(foldersContent))\nprint(*foldersContent)\n \t\t\t \t \t \t \t \t \t\t \t \t \t", "a = int(input())\r\nb = input().split()\r\nj = []\r\nkk = []\r\ncount = 0\r\n\r\nfor i in range(a):\r\n\tif int(b[i]) < 0:\r\n\t\tcount += 1\r\n\tif count == 3:\r\n\t\tkk += [j]\r\n\t\tj = [int(b[i])]\r\n\t\tif int(b[i]) < 0:\r\n\t\t\tcount =1\r\n\t\telse:\r\n\t\t\tcount = 0\r\n\telse:\r\n\t\tj += [int(b[i])]\r\nif count < 3:\r\n\tkk += [j]\r\nprint(len(kk))\r\n\r\nfor i in kk:\r\n\tprint(len(i), end=\" \")\t", "days = int(input())\nprofit = list(map(int, input().split(' ')))\n\nfolders = []\ni = 0\n# count the number of consecutive days the company suffers loss.\nsuffer_loss = 0\n\n\nwhile i < days:\n if profit[i] < 0:\n suffer_loss += 1\n\n if suffer_loss == 3:\n suffer_loss = 0\n folders.append(i)\n else:\n i += 1\n\nfolders.append(days)\nfinal_reports = []\n\nfor j in range(len(folders)):\n if j == 0:\n final_reports.append(folders[j])\n else:\n final_reports.append(folders[j] - folders[j - 1])\n\nprint(len(final_reports))\nprint(*final_reports)", "\r\ndef main_function():\r\n n = int(input())\r\n a = [int(i) for i in input().split(\" \")]\r\n collector = []\r\n counter = 0\r\n general_counter = 0\r\n for i in range(len(a)):\r\n if a[i] >= 0:\r\n general_counter += 1\r\n else:\r\n counter += 1\r\n if counter < 3:\r\n general_counter += 1\r\n elif counter == 3:\r\n collector.append(str(general_counter))\r\n general_counter = 1\r\n counter = 1\r\n if i == len(a) - 1:\r\n collector.append(str(general_counter))\r\n print(len(collector))\r\n print(\" \".join(collector))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "import re\nimport itertools\nfrom collections import Counter\n\nclass Task:\n a = []\n answer = []\n\t\n def getData(self):\n input()\n self.a = [int(x) for x in input().split(\" \")]\n\t\n def solve(self):\n currentFolderCounter = 0\n badDaysCounter = 0\n for x in self.a:\n if x >= 0:\n currentFolderCounter += 1\n elif badDaysCounter <= 1:\n currentFolderCounter += 1\n badDaysCounter += 1\n else:\n self.answer += [currentFolderCounter]\n currentFolderCounter = 1\n badDaysCounter = 1\n if currentFolderCounter > 0:\n self.answer += [currentFolderCounter]\n\n def printAnswer(self):\n print(len(self.answer))\n print(re.sub('[\\[\\],]', '', str(self.answer)))\n\ntask = Task();\ntask.getData();\ntask.solve();\ntask.printAnswer();\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nfolder_len = 0\r\nfolders = []\r\ni=0\r\nc=0\r\nlast = 0\r\nwhile(i<len(a)):\r\n if a[i]<0:\r\n c+=1\r\n if c>2:\r\n c=0\r\n folder_len+=1\r\n folders.append(i-last)\r\n last=i\r\n i-=1\r\n i+=1\r\n\r\nfolder_len+=1\r\nfolders.append(i-last)\r\n\r\nprint(folder_len)\r\nfor i in folders:\r\n print(i, end=\" \")", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\ncnt, negative_days = 0, 0\r\nfor x in a:\r\n if x < 0:\r\n if negative_days == 2:\r\n ans.append(cnt)\r\n cnt, negative_days = 0, 0\r\n negative_days += 1\r\n cnt += 1\r\nif cnt != 0:\r\n ans.append(cnt)\r\nprint(len(ans))\r\nprint(*ans)", "x=int(input())\r\narr=list(map(int,input().split()))\r\nneg=0\r\nans=[0]\r\nfor i in range(len(arr)):\r\n if arr[i]<0:\r\n neg+=1\r\n if neg%2==1 and neg>1:\r\n ans.append(i)\r\nans.append(len(arr))\r\nres=[]\r\nfor i in range(1,len(ans)):\r\n inp=ans[i]-ans[i-1]\r\n res.append(inp)\r\nprint(len(res))\r\nprint(*res,sep=\" \")\r\n\r\n \r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nb = []\r\n\r\ncn = 0\r\ncount = 0\r\nfor i in range(len(a)):\r\n if a[i] < 0 and cn == 2:\r\n b.append(count)\r\n cn = 1\r\n count = 1\r\n else:\r\n count += 1\r\n if a[i] < 0:\r\n cn += 1\r\nb.append(count)\r\nprint(len(b))\r\nprint(*b)\r\n", "from sys import stdin,stdout\r\nfrom math import ceil\r\nst=lambda:list(stdin.readline().strip())\r\nli=lambda:list(map(int,stdin.readline().split()))\r\nmp=lambda:map(int,stdin.readline().split())\r\ninp=lambda:int(stdin.readline())\r\npr=lambda n: stdout.write(str(n)+\"\\n\")\r\n\r\nmod=1000000007\r\n\r\ndef solve():\r\n n=inp()\r\n l=li()\r\n ans=[]\r\n c=0\r\n d=0\r\n for i in range(n):\r\n if l[i]<0:\r\n if c==2:\r\n ans.append(d)\r\n c=1\r\n d=0\r\n else:\r\n c+=1\r\n \r\n d+=1\r\n if d:\r\n ans.append(d)\r\n pr(len(ans))\r\n print(*ans)\r\n \r\n \r\n \r\n \r\n \r\nfor _ in range(1):\r\n solve()\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nres = []\r\nneg_count = 0\r\npos_count = 0\r\n\r\nfor i in lst:\r\n if neg_count <= 2 and i >= 0:\r\n pos_count += 1\r\n elif i < 0 and neg_count < 2:\r\n neg_count += 1\r\n pos_count += 1\r\n else:\r\n res.append(pos_count)\r\n neg_count = 1\r\n pos_count = 1\r\n\r\nif pos_count > 0:\r\n res.append(pos_count)\r\n\r\nprint(len(res))\r\nprint(*res)", "def paperuork():\n n = int(input())\n relatorios = list(map(int,input().split()))\n\n n_negative = 0\n n_relatorios_in_folder = 0\n sekuence = []\n\n for r in relatorios:\n if(n_negative==2):\n if(r<0):\n sekuence.append(n_relatorios_in_folder)\n n_relatorios_in_folder = 1\n n_negative = 1\n else:\n n_relatorios_in_folder += 1\n elif(r < 0):\n n_negative += 1\n n_relatorios_in_folder += 1\n else:\n n_relatorios_in_folder += 1\n \n if(n_relatorios_in_folder>0):\n sekuence.append(n_relatorios_in_folder)\n print(len(sekuence))\n res = \"\"\n for s in sekuence:\n res += str(s) + ' '\n print(res)\n\npaperuork()\n\t \t \t \t\t \t \t\t\t \t\t \t \t\t", "n = int(input())\r\ndays = [int(x) for x in input().split(\" \")]\r\n\r\nsplit = []\r\n\r\nstreak = 0\r\nnegative_streak = 0\r\nfor i in days:\r\n if i < 0:\r\n negative_streak += 1\r\n if negative_streak == 3:\r\n negative_streak = 1\r\n split.append(streak)\r\n streak = 1\r\n else:\r\n streak += 1\r\n else:\r\n streak += 1\r\n\r\nif streak != 0:\r\n split.append(streak)\r\n\r\nprint(len(split))\r\n[print(x) for x in split]\r\n", "input()\r\nB = []\r\nb = neg = 0\r\n\r\nfor a in map(int, input().split()):\r\n if a < 0:\r\n if neg > 1:\r\n B.append(b)\r\n b = neg = 0\r\n neg += 1\r\n b += 1\r\n\r\nprint(len(B)+1)\r\nprint(*B, b)", "n = int(input())\r\nmassiv = list(map(int, input().split()))\r\nresult = [0]\r\ncount = 0\r\nfor num in massiv:\r\n if num < 0:\r\n if count == 2:\r\n count = 0\r\n result.append(0)\r\n count += 1\r\n result[-1] += 1\r\nprint(len(result))\r\nprint(*result)\r\n", "n = int(input())\r\nsp = list(map(int, input().split()))\r\nrez = []\r\nk_neg = 0\r\nk_sum = 0\r\nfor elem in sp:\r\n if elem < 0:\r\n if k_neg == 2:\r\n rez.append(k_sum)\r\n k_sum = 0\r\n k_neg = 1\r\n else:\r\n k_neg += 1\r\n k_sum += 1\r\nrez.append(k_sum)\r\n#if k_ \r\nprint(len(rez))\r\nprint(*rez)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=[0]\r\nc=1\r\nchecker=0\r\nfor i in a:\r\n if i<0:\r\n checker+=1\r\n if checker>=3:\r\n c+=1\r\n ans.append(1)\r\n checker=1\r\n else: ans[-1]+=1\r\nprint(c)\r\nprint(*ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\npo=0\r\nne=0\r\nno=0\r\nl=[]\r\nfor i in range(n):\r\n\tif(a[i]<0):\r\n\t\tne=ne+1\r\n\tif(a[i]>=0):\r\n\t\tpo=po+1\r\n\tif(ne==2):\r\n\t\tl.append(po+ne)\r\n\t\tpo=0\r\n\t\tne=0\r\nif(len(l)>0):\r\n\tif(po>0 and ne==0 ):\r\n\t\tl[-1]=l[-1]+po\r\n\tif(ne>0 and po>0):\r\n\t\tl.append(ne+po)\r\n\tif(ne>0 and po==0):\r\n\t\tl.append(ne)\r\n\r\nelse:\r\n\tl.append(po+ne)\r\nprint(len(l))\r\nprint(*l)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ncurr,neg = 0,0\r\nans = []\r\nfor i in range(n):\r\n if l[i] >= 0:\r\n curr += 1\r\n else:\r\n neg += 1\r\n if neg < 3:\r\n curr += 1\r\n else:\r\n ans.append(curr)\r\n curr,neg = 1,1\r\nans.append(curr)\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nl = []\r\nc = 0\r\nfile = 0\r\nfor i in a:\r\n if i < 0:\r\n c += 1\r\n if c == 3:\r\n l.append(file)\r\n file = 1\r\n c = 1\r\n else:\r\n file += 1\r\n else:\r\n file += 1\r\nif file != 0:\r\n l.append(file)\r\nprint(len(l))\r\n\r\nprint(*l)\r\n", "if __name__ == '__main__':\r\n n = input()\r\n s = [int(x) for x in input().split()]\r\n negative = 0\r\n nums = []\r\n cur = 0\r\n for i in s:\r\n if i >= 0:\r\n cur += 1\r\n else:\r\n negative += 1\r\n if negative < 3:\r\n cur += 1\r\n else:\r\n nums += [cur]\r\n cur = 1\r\n negative = 1\r\n nums += [cur]\r\n print(len(nums))\r\n print(\" \".join([str(x) for x in nums]))\r\n", "import sys\ninput = sys.stdin.readline\n\ndays_number = int(input())\n\nperf_stats = list(map(int, input().split()))\n\n\nfolders = []\n\nfolder_index = 0\n\nloss_count_per_folder = 0\n\nfor i in perf_stats:\n\n if i < 0:\n loss_count_per_folder = loss_count_per_folder + 1\n\n if loss_count_per_folder > 2:\n loss_count_per_folder = 1\n folder_index = folder_index + 1\n\n if folder_index > len(folders)-1:\n folders.append([i])\n else:\n folders[folder_index].append(i)\n\n\nprint(folder_index+1)\n\nfor i in folders:\n print(len(i), end=\" \")\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = []\r\ncur, neg = 0, 0\r\nfor x in a:\r\n cur += 1\r\n if x < 0:\r\n neg += 1\r\n if neg > 2:\r\n ans.append(cur - 1)\r\n neg = 1\r\n cur = 1\r\nans.append(cur)\r\nprint(len(ans))\r\nprint(*ans)\r\n \t \t\t", "n = int(input())\ns = list(map(int,input().split()))\nr = ''\na,b,c = 0, 0, 0\nfor i in range(n):\n if s[i]<0:\n a+=1\n if a>=3:\n r+=str(i-b)\n r+=' '\n a = 1\n b = i\n c +=1\nprint(c+1)\nprint(r+str(n-b))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nfolders = [0]\r\ncur = 0\r\nloss = 0\r\nfor i in range(n):\r\n if l[i] < 0 :\r\n loss += 1\r\n if loss == 3 :\r\n folders.append(0)\r\n loss = 1\r\n cur += 1\r\n #print(i,l[i],cur,loss)\r\n folders[cur] += 1\r\n\r\nprint(len(folders))\r\nprint(*folders)\r\n", "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=[int(i) for i in input().split()]\r\nc=0\r\nc1=0\r\nl1=[]\r\ni=0\r\nwhile(i<n):\r\n if(l[i]>=0):\r\n c+=1\r\n i+=1\r\n else:\r\n c1+=1\r\n if(c1==3):\r\n l1.append(c)\r\n c=0\r\n c1=0\r\n else:\r\n c+=1\r\n i+=1\r\nl1.append(c)\r\nprint(len(l1))\r\nprint(*l1)", "count = 0\r\ncount_out = [0]\r\n\r\ninput()\r\nfor num in map(int, input().split()):\r\n if num < 0:\r\n if count == 2:\r\n count = 1\r\n count_out.append(1)\r\n continue\r\n count += 1\r\n count_out[-1] += 1\r\n\r\nprint(len(count_out))\r\nprint(*count_out)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount = 0\r\nans = []\r\nfor i in range(n) :\r\n if a[i] < 0 :\r\n count = count + 1\r\n else :\r\n pass\r\n \r\n if count == 3 :\r\n count = 1\r\n ans.append(i-1)\r\n else :\r\n pass\r\n \r\nans.append(i)\r\ntemp = 0\r\nk = len(ans)\r\nprint(k)\r\nfor j in range(k):\r\n print(ans[j]+1-temp, end = ' ')\r\n temp = ans[j]+1", "n=int(input())\nentrada=input().split()\nnegative_counter=0\nfolder_list=[]\nlast_folder=0\nfolder_count=1\nfor i in range(n):\n day=int(entrada[i])\n if day<0:\n if negative_counter==2:\n folder_list.append(last_folder)\n last_folder=0\n folder_count+=1\n negative_counter=1\n else:\n negative_counter+=1\n last_folder+=1\nfolder_list.append(last_folder)\nprint(folder_count)\nfor i in range(folder_count-1):\n print(folder_list[i],end=\" \")\nprint(folder_list[-1])\n\n\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\nans = []\r\nptr = 0\r\nwhile ptr < N:\r\n s = 0\r\n nxt = ptr\r\n while nxt < N and s + ( A[ nxt ] < 0 ) <= 2:\r\n s += ( A[ nxt ] < 0 )\r\n nxt += 1\r\n ans.append( nxt - ptr )\r\n ptr = nxt\r\n\r\nprint( len( ans ) )\r\nprint( * ans )\r\n", "\r\n\r\nn = int(input())\r\n\r\na = [int(s) for s in input().split(' ')]\r\n\r\nfolders = []\r\nn = 0\r\ncount = 0\r\nfor i in a:\r\n if(n == 2 and i < 0):\r\n folders.append(str(count))\r\n count = 1\r\n n = 1\r\n continue\r\n if(i < 0):\r\n n += 1\r\n count += 1\r\nfolders.append(str(count))\r\nprint(len(folders))\r\nprint(\" \".join(folders))\r\n", "n = int(input())\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nlosses = 0\r\n\r\nk = 0\r\n\r\nb = \"\"\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n\r\n\tcount += 1\r\n\r\n\tif a[i] < 0:\r\n\r\n\t\tlosses += 1\r\n\r\n\tif losses == 3:\r\n\r\n\t\tk += 1\r\n\r\n\t\tb = b + \" \" + (str(count - 1))\r\n\r\n\t\tcount = 1\r\n\r\n\t\tlosses = 1\r\n\r\n\tif i == len(a) - 1:\r\n\r\n\t\tk += 1\r\n\r\n\t\tb = b + \" \" + (str(count))\r\n\r\nprint(k)\r\n\r\nprint(b.replace(' ', '', 1))", "z = int(input())\r\nl = list(map(int, input().rstrip().split(\" \")))\r\ncount = 0\r\npac = 0\r\npac_list = []\r\ni = 0\r\nwhile i < z:\r\n if l[i] < 0:\r\n count = count + 1\r\n pac = pac+1\r\n if count ==3:\r\n pac_list.append(pac-1)\r\n pac = 0\r\n i = i - 1\r\n count = 0\r\n i = i + 1\r\nif pac > 0:\r\n pac_list.append(pac)\r\nprint(len(pac_list))\r\nfor i in pac_list:\r\n print(i, end =\" \")", "\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\nP=print\r\nI=input\r\nI()\r\na=b=0\r\nt=[]\r\nfor x in map(int,I().split()):\r\n\tif x<0:\r\n\t\tif b==2:t+=[a];b=1;a=0\r\n\t\telse:b+=1\r\n\ta+=1\r\nif a:t+=[a]\r\nP(len(t))\r\nfor x in t:P(x,end=' ')\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount,days,total,b = 0,0,0,[]\r\nfor i in range(n):\r\n\tdays += 1\r\n\tif a[i]<0: count+=1\r\n\tif count==3:\r\n\t\ttotal+=1\r\n\t\tb.append(days-1)\r\n\t\tdays=1\r\n\t\tcount=1\r\nelse:\r\n\tprint(total+1)\r\n\tb.append(days)\r\n\tprint(*b)", "import sys\r\n#import math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\n#pt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\n\r\nres = []\r\ncount = 0\r\nneg = 0\r\nfor i in range(n):\r\n if lst[i] < 0:\r\n neg += 1\r\n count += 1\r\n if neg == 3:\r\n res.append(count-1)\r\n count = 1\r\n neg = 1\r\nif count > 0:\r\n res.append(count)\r\nprint(len(res))\r\nprint(*res)\r\n \r\n\r\n\r\n", "n=int(input())\r\na=input().split()\r\ntempneg=0\r\nsizelist=''\r\nj=0\r\ntot=1\r\nfor i in a:\r\n if i[0]=='-':\r\n if tempneg<=1:\r\n tempneg+=1\r\n else:\r\n tempneg=1\r\n sizelist=sizelist+str(j)+' '\r\n tot+=1\r\n j=1\r\n continue\r\n j+=1\r\nsizelist=sizelist+str(j)\r\nprint(tot)\r\nprint(sizelist)", "_ = int(input())\n\nreports_in_folder = [0]\n\nai = list(map(int, input().split()))\n\n\nneg = 0\nfolder = 0\nfor a in ai:\n if a < 0:\n neg += 1\n\n if neg > 2:\n neg = 1\n folder += 1\n reports_in_folder.append(0)\n\n reports_in_folder[folder] += 1\n\nprint(folder + 1)\nprint(*reports_in_folder)\n\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\nn = int(input())\r\na = list(map(lambda v: int(v), input().split()))\r\nf,c,b = list(),0,0\r\n\r\nfor i in a:\r\n if i<0: b+=1\r\n if b==3:\r\n f.append(c)\r\n c,b=0,1\r\n c += 1\r\n\r\nif c!=0: f.append(c)\r\n\r\nprint(len(f))\r\nprint(*f)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nx, c = 0, 0\r\ns = \"\"\r\n\r\nfor i in range(n):\r\n\tx += 1\r\n\t\t\t\r\n\tif l[i] < 0:\r\n\t\tc += 1\r\n\t\r\n\tif c == 3:\r\n\t\ts = s + str(x - 1) + \" \"\r\n\t\tc = 1\r\n\t\tx = 1\r\n\t\t\t\t\r\n\tif i == n - 1:\r\n\t\ts = s + str(x) + \" \"\r\n\r\nprint(len(s.split()))\t\t\r\nprint(s[:-1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nf=0\r\nx=[]\r\nfor i in range(0,n):\r\n if a[i]>=0:\r\n c=c+1\r\n elif a[i]<0:\r\n f=f+1\r\n \r\n if f>2:\r\n f=f-2\r\n x.append(c+2)\r\n c=0\r\nx.append(c+f)\r\nprint(len(x))\r\nfor i in x:\r\n print(i,end=\" \")\r\n \r\n ", "n = int(input())\nfolders = []\nloss_count = 0\nday_count = 0\nfor x in map(int, input().split()):\n if x < 0:\n if loss_count == 2:\n folders.append(day_count)\n loss_count = 1\n day_count = 0\n else:\n loss_count += 1\n day_count += 1\nfolders.append(day_count)\nprint(len(folders))\nprint(' '.join(map(str, folders)))\n", "input()\r\nar = list(map(int, input().split()))\r\n\r\nnums = []\r\ncur_minus = 0\r\ncounter = 0\r\nfor i in range(len(ar)):\r\n if ar[i] < 0 and cur_minus == 2:\r\n nums.append(str(counter))\r\n cur_minus = 0\r\n counter = 0\r\n\r\n if ar[i] < 0:\r\n cur_minus += 1\r\n\r\n counter += 1\r\n \r\n #print(counter, cur_minus, i, ar[i])\r\n \r\nif counter > 0:\r\n nums.append(str(counter))\r\n \r\nprint(len(nums))\r\nprint(' '.join(nums))", "n=int(input())\r\nlistt=[int(x) for x in input().split()]\r\nre=[]\r\nco=0\r\nif listt[0]<0:\r\n co=1\r\nfor i in range(1,len(listt)):\r\n if listt[i]<0:\r\n co+=1\r\n else:\r\n pass\r\n if co==3:\r\n re.append(i)\r\n co=1\r\nre.append(len(listt))\r\nprint(len(re))\r\ncou=[re[0]]\r\nfor i in range(1,len(re)):\r\n cou.append(re[i]-re[i-1])\r\nprint(' '.join([str(x) for x in cou]))" ]

[ "f = lambda: map(int, input().split())\r\nn, m = f()\r\nt = list(f())\r\np = [1e9] + [abs(b - a) for a, b in zip(t, t[1:])] + [1e9]\r\nL, R = [0] * n, [0] * n\r\nfor i in range(1, n):\r\n j = n - i\r\n x, y = i - 1, j + 1\r\n a, b = p[i], p[j]\r\n while a > p[x]: x = L[x]\r\n while b >= p[y]: y = R[y]\r\n L[i], R[j] = x, y\r\nfor k in range(m):\r\n l, r = f()\r\n print(sum((i - max(l - 1, L[i])) * (min(r, R[i]) - i) * p[i] for i in range(l, r)))" ]

[ "#rOkY\r\n#FuCk\r\n\r\n################################## kOpAl #####################################\r\n\r\nt=int(input())\r\nl=list(map(int,input().split()))\r\nt1=l[0]\r\nsum=0\r\nfor i in range(1,t,1):\r\n if(l[i]<t1):\r\n sum+=(t1-l[i])\r\n t1=l[i]\r\nprint(sum)\r\n", "#Khushal Sindhav\r\n#Indian Institute Of Technology, Jodhpur\r\n# 3 Junw 2022\r\ndef exe():\r\n arr=[0 for i in range(n)]\r\n maxi=0\r\n for i in range(n):\r\n maxi=max(maxi,lst[i])\r\n arr[i]=maxi\r\n diff = [arr[i]-lst[i] for i in range(n)]\r\n count = 0\r\n\r\n for i in range(n-1):\r\n count+=max(diff[i+1]-diff[i],0)\r\n return count\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(exe())", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.append(max(l))\r\nm,ans = l[0],0\r\nfor i in range(1,n) :\r\n if l[i-1]>l[i] :\r\n ans += l[i-1]-l[i]\r\nprint(ans)", "def mi():\r\n return map(int, input().split())\r\n'''\r\n4\r\n7 4 1 47\r\n'''\r\nn = int(input())\r\na = list(mi())\r\nprint(sum([max(0, a[i-1]-a[i]) for i in range(1, n)]))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nmove = 0\r\nfor i in range(1,n):\r\n move+=max(arr[i-1]-arr[i],0)\r\nprint(move) ", "n = int(input())\r\na = list(map(int, input().split()))\r\nmoves = 0\r\nfor i in range(n - 1, 0, -1):\r\n if a[i] < a[i - 1]:\r\n moves += a[i - 1] - a[i]\r\nprint(moves)", "a=input()\r\ni=int(a)-1\r\nl1=list(map(int,input().split()))\r\nans=0\r\nwhile(i>0):\r\n if(l1[i]>=l1[i-1]): \r\n i-=1\r\n continue\r\n ans+=l1[i-1]-l1[i]\r\n i-=1\r\nprint(ans)", "from sys import stdin,stdout\r\nfrom math import gcd\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\ncount = 0\r\nfor i in range(1, n):\r\n arr[i]+=count\r\n if arr[i] < arr[i - 1]:\r\n count += arr[i - 1] - arr[i]\r\n arr[i] = arr[i - 1]\r\nprint(count)", "n = int(input())\r\nmoves = 0\r\n\r\narr = input().split(\" \")\r\narr = list(map(int, arr))\r\n\r\nfor i in range(1,n):\r\n if arr[i] < arr[i-1]:\r\n moves = moves + arr[i-1] - arr[i]\r\n\r\nprint(moves)", "n = input(); *a, = map(int, input().split())\r\nprint(sum(a[i]-a[i+1] for i in range(len(a)-1) if a[i] > a[i+1]))", "n = int(input())\r\nsequence =[int(i) for i in input().split()]\r\ns=0\r\nfor i in range(n-1):\r\n if sequence[i]>sequence[i+1]:\r\n s=s+ sequence[i] - sequence[i+1]\r\nprint(s)", "while True:\r\n\ttry:\r\n\t\tdef soln(n, a):\r\n\t\t\tans = 0\r\n\t\t\tfor i in range(1, n, 1):\r\n\t\t\t\tans += max(0, a[i-1]-a[i])\r\n\t\t\tprint(ans)\r\n\t\t\t\r\n\t\tdef read():\r\n\t\t\tn = int(input())\r\n\t\t\ta = list(map(int, input().split()))\r\n\t\t\tsoln(n, a)\r\n\t\tif __name__ == \"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=0\r\nfor i in range(1,n):\r\n if l[i]<l[i-1]:\r\n a+=l[i-1]-l[i]\r\nprint(a)", "import sys\n# sys.stdin = open('_input.txt')\n\nml, mi = [], []\ndef recurseml(l):\n if len(l) == 0:\n return\n if len(l) == 1:\n ml.append(l[0])\n mi.append(0)\n return\n mx = max(l)\n mxi = len(l) - 1 - l[::-1].index(mx)\n ml.append(mx)\n mi.append(mxi)\n recurseml(l[: mxi])\n\nn = int(input())\na = [int(i) for i in input().split()]\nres = 0\nfor i in range(1, len(a)):\n if a[i] < a[i-1]:\n res += a[i-1] - a[i]\nprint(res)\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-1,0,-1):\r\n if a[i]<a[i-1]:\r\n ans+=a[i-1]-a[i]\r\n print(ans)", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = list(map(int, stdin.readline().split()))\r\nb = list()\r\nfor i in range(1, n): b.append(a[i] - a[i-1])\r\nprint(sum([-ele for ele in b if ele < 0]))", "import sys\r\nimport math as m\r\ndef fi():\r\n\treturn sys.stdin.readline()\r\nif __name__ == '__main__':\r\n\tn = int(fi())\r\n\tl = list(map(int, fi().split()))\r\n\tc = 0\r\n\td = 0\r\n\tfor i in range (1,n):\r\n\t\tl[i]+=c\r\n\t\tif l[i] < l[i-1]:\r\n\t\t\tc+=l[i-1]-l[i]\r\n\t\t\td+=l[i-1]-l[i]\r\n\t\t\tl[i]=l[i-1]\r\n\tprint(d)", "n = int(input())\r\nd = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n):\r\n if(d[i - 1] - d[i] > 0):\r\n ans += d[i - 1] - d[i]\r\nprint(ans)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nc=0\r\ns=0\r\nfor i in range(1,n):\r\n x[i]+=c\r\n if x[i]<x[i-1]:\r\n c+=x[i-1]-x[i]\r\n x[i]=x[i-1]\r\nprint(c)", "\n\n\ninput()\nnums=[int(x) for x in input().split()]\nans=0\nfor i in range(1,len(nums)):\n if nums[i-1]>nums[i]:\n ans+=nums[i-1]-nums[i]\nprint(ans)\n\n\n\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\ns=0\r\nfor i in range(1,n):\r\n if(list1[i]<list1[i-1]):\r\n s+=abs(list1[i]-list1[i-1])\r\nprint(s)", "def little_ele(length,array):\r\n a=0\r\n for z in range(1,length):\r\n if array[z-1]>array[z]:a+=array[z-1]-array[z]\r\n return a\r\n\r\na=int(input())\r\nnums=[int(i) for i in input().split()]\r\nprint(little_ele(a,nums))", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(1,n):\r\n if a[i] < a[i-1]:\r\n ans += (a[i-1] - a[i])\r\nprint(ans)", "n=int(input())\r\narr=list(map(int,input().strip().split()))\r\na=0\r\nans=0\r\nfor i in arr:\r\n if i<a:\r\n ans=ans+a-i\r\n a=i\r\n\r\nprint(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\nf = 0\r\ncount = 0\r\nc = 0\r\nmm = []\r\nfor i in range(n-1):\r\n if a[i]>a[i+1]:\r\n f = 1\r\n c = 1\r\n count+=1\r\n x = i+1\r\n else:\r\n if c==1:\r\n mm.append(a[x-count:x+1])\r\n c = 0\r\n count = 0\r\nif c==1:\r\n mm.append(a[x-count:x+1])\r\n\r\ncc = 0\r\nif f==0:\r\n print(\"0\")\r\nelse:\r\n for j in range(len(mm)):\r\n cc += max(mm[j])-min(mm[j])\r\n print(cc)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=0\r\nt1=a[0]\r\nfor i in range(1,n):\r\n if a[i]<t1:\r\n c+=t1-a[i]\r\n t1=a[i]\r\n else:\r\n t1=a[i]\r\nprint(c)", "def solve(arr, n):\n inc = 0\n ans = 0\n for i in range(1, n):\n arr[i] += inc\n if arr[i] >= arr[i - 1]:\n continue\n diff = arr[i - 1] - arr[i]\n ans += diff\n inc += diff\n arr[i] += diff\n # print(arr)\n # print(ans)\n return ans\n\n\ndef read():\n n = int(input())\n arr = list(map(int, input().strip().split()))\n ans = solve(arr, n)\n print(ans)\n\n\nread()", "n= int(input())\r\na=[int(x) for x in input().split()]\r\nan=0\r\nfor i in range(1,n):\r\n if a[i]<a[i-1]:\r\n\r\n an+=abs(a[i-1]-a[i])\r\nprint(an)", "n=int(input())\r\na=list(map(int,list(input().split())))\r\ntotal=0\r\nfor i in range(n-1):\r\n x=max(0,a[i]-a[i+1])\r\n total=total+x\r\nprint(total)", "#author: riyan\r\n\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n arr = list(map(int, input().strip().split()))\r\n\r\n ans = 0\r\n for i in range(1, n):\r\n if arr[i] < arr[i-1]:\r\n ans += (arr[i-1] - arr[i])\r\n \r\n print(ans)", "from fractions import Fraction\r\n\r\nn = int(input())\r\nvalues = list(map(int, input().split()))\r\nres = 0\r\nfor i in range(1, n):\r\n if values[i] < values[i-1]:\r\n res += values[i-1] - values[i]\r\n\r\nprint(res)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nsm = 0 \r\nfor i in range(n-1):\r\n sm+=max(a[i]-a[i+1],0) \r\nprint(sm)\r\n\r\n\r\n'''\r\n7 4 1 47 \r\n\r\n\r\n7->4.... 1 47 \r\n\r\n add 1 from 4 3 times \r\n7->7->4->50 \r\n ..... \r\n add 1 from 4 is 3 times \r\n \r\n7->7->7->47 \r\n\r\nsorted \r\n6 times added\r\n'''", "n=int(input())\na=list(map(int,input().split()))\nans=0\nfor i in range(1,n):\n ans+=max(a[i-1]-a[i],0)\nprint(ans)\n", "m=int(input())\r\nl=list(map(int,input().split()))\r\nt=0\r\nprint(sum(l[i]-l[i+1] for i in range(m-1) if l[i]>l[i+1]))", "def find(arr):\r\n decreasing_subarrays = []\r\n current_subarray = [arr[0]]\r\n\r\n for i in range(1, len(arr)):\r\n if arr[i] < arr[i - 1]:\r\n current_subarray.append(arr[i])\r\n else:\r\n if len(current_subarray) > 1:\r\n decreasing_subarrays.append(current_subarray)\r\n current_subarray = [arr[i]]\r\n\r\n if len(current_subarray) > 1:\r\n decreasing_subarrays.append(current_subarray)\r\n\r\n return decreasing_subarrays\r\n\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nk=(find(l))\r\ns=0\r\nfor i in k:\r\n s=s+i[0]\r\n new=i[1:]\r\n mi=min(new)\r\n s=s-mi\r\n\r\nprint(s)\r\n\r\n", "n=int(input())\nl=list(map(int,input().split()))\nans=0\n\nfor i in range(n-1):\n\tif l[i]>(l[i+1]):\n\t\tt=l[i]-l[i+1]\n\t\tans+=t\n\t\t\nprint(ans)\t\t", "from sys import stdin,stdout\r\ndef ai(): return list(map(int,input().split()))\r\ndef ei(): return map(int,input().split())\r\ndef ip(): return int(stdin.readline())\r\ndef op(ans): return stdout.write(str(ans) + '\\n') \r\n\r\nn = ip()\r\nli = ai()\r\ncount = 0\r\nfor i in range(n-1):\r\n\tif li[i] > li[i+1]:\r\n\t\tcount += li[i]-li[i+1]\r\nprint(count)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nans=0\r\nfor i in range(n-1):\r\n if a[i+1]<a[i]:\r\n ans+=a[i]-a[i+1]\r\nprint(ans)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, n):\r\n ans += max(0, arr[i-1]-arr[i])\r\nprint(ans)\r\n", "n = int(input())\r\ns = input().split()\r\ns = [int(i) for i in s]\r\n\r\nc = 0\r\ni = 0\r\nwhile(i< n-1):\r\n\tif(s[i] > s[i+1]):\r\n\t\tc += s[i]-s[i+1]\r\n\ti += 1\r\n\r\n\r\nprint(c)", "from sys import stdin\r\nn=int(stdin.readline())\r\nlist1=list(map(int,stdin.readline().strip().split()))\r\ns=0\r\nfor i in range(1,n):\r\n if(list1[i]<list1[i-1]):\r\n s+=abs(list1[i]-list1[i-1])\r\nprint(s)", "input()\r\na = list(map(int, input().split()))\r\nprint(sum([max(0, a[i - 1] - a[i]) for i in range(1, len(a))]))\r\n", "x = int(input())\r\nl = list(map(int,input().split()))\r\nanswer = 0\r\nfor i in range(x-1):\r\n answer += max(l[i] - l[i+1] , 0)\r\nprint(answer)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nif n==1:\r\n print(0)\r\nelse:\r\n ans=0\r\n for i in range(1,n):\r\n if arr[i]<arr[i-1]:\r\n ans+=(arr[i-1]-arr[i])\r\n print(ans)", "from sys import stdin ,stdout\r\nfrom os import path\r\nrd = lambda:stdin.readline().strip()\r\nwr = stdout.write\r\nif(path.exists('input.txt')):\r\n stdin = open(\"input.txt\",\"r\")\r\nimport time \r\n#------------------------------------\r\nx = int(rd())\r\nmylist = list(map(int,rd().split()))\r\nans = sum(max(0,mylist[i-1]-mylist[i]) for i in range(1,x))\r\nprint(ans)", "#بسم الله الرحمن الرحيم\r\nn = int(input())\r\nsequence =[int(i) for i in input().split()]\r\nmaxx = 0\r\ns=0\r\nfor i in range(n-1):\r\n s=sequence[i]-sequence[i+1]\r\n if sequence[i+1]<sequence[i]:\r\n maxx+=s\r\n\r\nprint(maxx)", "n = int(input())\r\nlst = list(map(int, input().split(' ')))\r\nprint(str(sum(max(0, lst[i-1]-lst[i]) for i in range(1, n))))", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\ncarry=0\r\noper=0\r\nfor i in range(1,n):\r\n a[i]=a[i]+carry\r\n if a[i]<a[i-1]:\r\n carry+=abs(a[i-1]-a[i])\r\n \r\n oper+=abs(a[i-1]-a[i])\r\n a[i]=a[i-1]\r\n \r\n#print(a)\r\nprint(oper)\r\n \r\n \r\n ", "def solve() :\n c=0\n for i in range(n-1):\n if arr[i]>arr[i+1] :\n c+=arr[i]-arr[i+1]\n return c\n\n \n \n \n\n \n\nfrom sys import stdin\ninput = stdin.readline \n \nn=int(input())\narr=[int(x) for x in input().split()]\nprint(solve())\n \n\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\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\n\nn=int(input())\narr=[]\nfor i in range(n):\n arr.append([int(x) for x in input().split()])\n\n\n\nn=int(input())\narr=[int(x) for x in input().split()]\n'''", "m=int(input())\r\nl=list(map(int,input().split()))\r\nt=0\r\nfor i in range(m-1):\r\n if l[i]>l[i+1]:\r\n t+=l[i]-l[i+1]\r\nprint(t)", "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=[int(i) for i in input().split()]\r\nc=0\r\nma=l[0]\r\nfor i in range(1,n):\r\n if(l[i]>l[i-1]):\r\n c+=ma-l[i-1]\r\n ma=l[i]\r\nc+=ma-l[n-1]\r\nprint(c)", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nmoves = 0\r\nstartRange = nums[0]\r\nprev = nums[0]\r\nfor (idx, num) in enumerate(nums):\r\n if num <= prev:\r\n prev = num\r\n elif prev < startRange :\r\n moves += min(startRange,num) - prev\r\n prev = min(startRange,num)\r\n if num > startRange:\r\n startRange = num\r\n prev = num\r\nmoves += startRange - prev\r\nprint(moves)", "n = int(input())\n\narr = list(map(int,input().split()))\nsteps = 0\ni = 1\nfor i in range(1,n):\n if arr[i] < arr[i-1]:\n steps += (arr[i-1] - arr[i])\n\nprint(steps)\n", "def solve(n,li):\r\n i=0\r\n ans=0\r\n while i<n:\r\n j=i\r\n while j+1<n and li[j]>=li[j+1]:\r\n j+=1\r\n if i!=j:\r\n ans+=li[i]-li[j]\r\n i=j+1\r\n return ans\r\nfor t in range(1):\r\n n=int(input())\r\n li=list(map(int,input().split()))\r\n print(solve(n,li))" ]

[ "def count_com(graph):\r\n def dfs(graph,node,visited):\r\n visited[node]=True\r\n mini=node[1]\r\n stack=[node]\r\n while stack:\r\n a=stack.pop()\r\n mini=min(mini,a[1])\r\n for nei in graph[a]:\r\n if not visited[nei]:stack+=nei,;visited[nei]=True\r\n return mini\r\n\r\n visited=dict();min_all=0\r\n for i in graph:visited[i]=False\r\n for node in graph:\r\n if not visited[node]:\r\n min_all+=dfs(graph,node,visited)\r\n return min_all\r\n\r\nn,m=map(int,input().split())\r\ncoins=[0]+[*map(int,input().split())]\r\nfriends=[[*map(int,input().split())] for _ in[0]*m]\r\ngraph=dict()\r\nfor i in range(1,n+1):\r\n graph[(i,coins[i])]=[]\r\nfor i in friends:\r\n graph[(i[0],coins[i[0]])]+=(i[1],coins[i[1]]),\r\n graph[(i[1],coins[i[1]])]+=(i[0],coins[i[0]]),\r\nprint(count_com(graph))", "# _\r\n#####################################################################################################################\r\n\r\nnCharacters, nPairs = map(int, input().split(' '))\r\ncharacters, golds = set(), {}\r\nfor iCharacter, gold in enumerate(input().split(' ')):\r\n character = str(iCharacter+1)\r\n characters.add(character)\r\n golds[character] = int(gold)\r\n\r\nfriendsMap = {}\r\nfor i in range(nPairs):\r\n pair = input().split(' ')\r\n if friendsMap.get(pair[0], False):\r\n friendsMap[pair[0]].add(pair[1])\r\n else:\r\n friendsMap[pair[0]] = {pair[1]}\r\n if friendsMap.get(pair[1], False):\r\n friendsMap[pair[1]].add(pair[0])\r\n else:\r\n friendsMap[pair[1]] = {pair[0]}\r\n\r\n\r\ndef findMinGold(character, minGold, charactersToConsider):\r\n for friend in friendsMap[character]:\r\n mutualFriendsGroup.add(friend)\r\n if golds[friend] < minGold:\r\n minGold = golds[friend]\r\n if friendsMap[friend] - mutualFriendsGroup:\r\n charactersToConsider.append(friend)\r\n\r\n return minGold\r\n\r\n\r\nminTotalGold, charactersInAGroup = 0, set()\r\nfor character in friendsMap:\r\n if character not in charactersInAGroup:\r\n mutualFriendsGroup, charactersToConsider = {character}, []\r\n minGold = findMinGold(character, golds[character], charactersToConsider)\r\n while charactersToConsider:\r\n nextCharactersToConsider = []\r\n for nextCharacter in charactersToConsider:\r\n if golds[nextCharacter] < minGold:\r\n minGold = golds[nextCharacter]\r\n minGold = findMinGold(nextCharacter, minGold, nextCharactersToConsider)\r\n charactersToConsider = nextCharactersToConsider\r\n charactersInAGroup |= mutualFriendsGroup\r\n minTotalGold += minGold\r\n\r\nprint(minTotalGold + sum(golds[character] for character in characters-charactersInAGroup))\r\n", "R = lambda:map(int,input().split())\nn,m = R()\npa = [i for i in range(n + 1)]\nT = [0] + list(R())\ndef find(i):\n\twhile i != pa[i]:\n\t\tpa[i] = pa[pa[i]]\n\t\ti = pa[i]\n\treturn i\nfor _ in range(m):\n\tx, y = map(find, R())\n\tif T[x] < T[y]:\n\t\tx, y = y, x\n\tpa[x] = y\nprint (sum(T[i] for i in range(n + 1) if pa[i] == i))\n \t\t\t\t\t\t \t \t \t \t\t\t \t\t \t \t", "from sys import stdin,stdout\r\n#input = stdin.readline\r\n\r\ndef main():\r\n #t = int(input())\r\n t = 1\r\n \r\n for z in range(t):\r\n #n = int(input())\r\n #a,b,c = map(int,input().split())\r\n #ai = list(map(int,input().split()))\r\n n,m = map(int,input().split())\r\n ci = list(map(int,input().split()))\r\n sets = list(range(n))\r\n mins = ci\r\n sizes = [1]*(n+1)\r\n def get(a):\r\n if sets[a] != a:\r\n sets[a] = get(sets[a])\r\n return sets[a]\r\n def union(a, b):\r\n a = get(a)\r\n b = get(b)\r\n if a == b:return\r\n if sizes[a] > sizes[b]:\r\n a,b = b,a\r\n sets[a] = b\r\n sizes[b] += sizes[a]\r\n mins[b] = min(mins[b],mins[a])\r\n for i in range(m):\r\n x,y = map(int,input().split())\r\n x -= 1\r\n y -= 1\r\n union(x,y)\r\n ar = [0] * n\r\n ans = 0\r\n for i in range(n):\r\n num = get(i)\r\n if ar[num]:\r\n continue\r\n ar[num] = 1\r\n ans += mins[num]\r\n print(ans)\r\nmain()\r\n\r\n", "import abc\r\nimport itertools\r\nimport math\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nfrom heapq import heappop, heappush\r\nimport random\r\nfrom array import array\r\nfrom bisect import *\r\n\r\n# input = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# inp = lambda dtype: [dtype(x) for x in input().split()]\r\ndebug = lambda *x: print(*x, file=sys.stderr)\r\nceil1 = lambda a, b: (a + b - 1) // b\r\nMint, Mlong, out = 2 ** 31 - 1, 2 ** 63 - 1, []\r\n\r\n\r\n# Solution starts here\r\ndef solve():\r\n n, m = map(int, sys.stdin.readline().split())\r\n c = list(map(int, sys.stdin.readline().split()))\r\n\r\n g = [[] for i in range(n)]\r\n\r\n for i in range(m):\r\n x, y = map(lambda k: int(k) - 1, sys.stdin.readline().split())\r\n g[x].append(y)\r\n g[y].append(x)\r\n\r\n def dfs(start):\r\n # (node, next_node_index)\r\n DFS_VOIDS = [(start, 0)]\r\n min_cost = c[start]\r\n visited[start] = True\r\n\r\n while len(DFS_VOIDS) != 0:\r\n first, it = DFS_VOIDS.pop()\r\n for i in range(it, len(g[first])):\r\n node = g[first][i]\r\n if not visited[node]:\r\n visited[node] = True\r\n min_cost = min(min_cost, c[node])\r\n\r\n DFS_VOIDS.append((first, it + 1))\r\n DFS_VOIDS.append((node, 0))\r\n break\r\n\r\n return min_cost\r\n\r\n visited = [False for i in range(n)]\r\n res = 0\r\n\r\n for u in range(n):\r\n if not visited[u]:\r\n res += dfs(u)\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 == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "class DSU:\r\n def __init__(self, n, costs):\r\n self.__n = n\r\n self.__parent = [i for i in range(n)]\r\n self.__costs = costs\r\n\r\n def connect(self, a, b):\r\n parent_a = self.parent(a)\r\n parent_b = self.parent(b)\r\n if parent_a != parent_b:\r\n if self.__costs[parent_a] < self.__costs[parent_b]:\r\n self.__parent[parent_b] = parent_a\r\n else:\r\n self.__parent[parent_a] = parent_b\r\n\r\n def parent(self, a):\r\n cur = a\r\n while self.__parent[cur] != cur:\r\n cur = self.__parent[cur]\r\n self.flatten(a, cur)\r\n return cur\r\n\r\n def flatten(self, child, parent):\r\n cur = child\r\n while self.__parent[cur] != cur:\r\n cur, self.__parent[cur] = self.__parent[cur], parent\r\n\r\n def get_cost(self):\r\n s = 0\r\n for i in range(self.__n):\r\n if self.__parent[i] == i:\r\n s += self.__costs[i]\r\n return s\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # import sys\r\n # sys.stdin = open(\"in.txt\", \"r\")\r\n try:\r\n n, m = map(int, input().split())\r\n costs = list(map(int, input().split()))\r\n g = DSU(n, costs)\r\n for i in range(m):\r\n s, e = map(lambda x: int(x)-1, input().split())\r\n g.connect(s, e)\r\n print(g.get_cost())\r\n except RuntimeError as e:\r\n print(str(e).replace(\" \", \"_\"))\r\n", "n,m=list(map(int,input().split(' ')))\r\n\r\ngold=list(map(int,input().split(' ')))\r\n\r\nedges=[]\r\n\r\nfor _ in range(m):\r\n edges.append( list(map(int,input().split(\" \"))) )\r\n\r\ngraph={}\r\nfor node in range(n):\r\n graph[node+1]=[]\r\n\r\nfor edge in edges:\r\n a,b=edge\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nres=0\r\n\r\nvisited=[False for _ in range(n+1)]\r\n\r\nremaining=1\r\n\r\nwhile remaining < n+1:\r\n if not visited[remaining]:\r\n next=[remaining]\r\n minimum=float('inf')\r\n while next!=[]:\r\n node=next.pop()\r\n visited[node]=True\r\n minimum=min(minimum, gold[node-1])\r\n for neighbor in graph[node]:\r\n if not visited[neighbor]:\r\n next.append(neighbor)\r\n res+=minimum\r\n remaining+=1\r\n\r\nprint(res)", "# import sys\r\n\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\n\r\nfrom collections import defaultdict\r\n\r\ndef dfs(source):\r\n s = [source]\r\n minGold = float('inf')\r\n while s:\r\n node = s.pop()\r\n visited[node] = True\r\n minGold = min(minGold, gold[node])\r\n for nbr in g[node]:\r\n if not visited[nbr]:\r\n s.append(nbr)\r\n return minGold\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\ngold = list(map(int, input().split()))\r\n\r\ng = defaultdict(list)\r\nvisited = [False]*n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n g[a-1].append(b-1)\r\n g[b-1].append(a-1)\r\n\r\nans = 0\r\nfor i in range(n):\r\n if not visited[i]:\r\n ans += dfs(i)\r\n \r\nprint(ans)\r\n", "import sys\r\nfrom collections import deque as dek\r\ndef prin(a):\r\n sys.stdout.write(str(a)+'\\n')\r\ndef input():\r\n return sys.stdin.readline()\r\n\r\n \r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n d[i]=set()\r\nfor i in range(k):\r\n a,b=map(int,input().split())\r\n d[a-1].add(b-1)\r\n d[b-1].add(a-1)\r\n \r\nvis=set()\r\nans=0\r\nfor i in range(n):\r\n if i not in vis:\r\n mn=l[i]\r\n q=dek()\r\n q.append(i)\r\n vis.add(i)\r\n while q:\r\n x=q.popleft()\r\n for frnd in d[x]:\r\n if frnd not in vis:\r\n vis.add(frnd)\r\n mn=min(mn,l[frnd])\r\n q.append(frnd)\r\n ans+=mn\r\nprin(ans)\r\n\r\n", "I=lambda:map(int,input().split())\r\nn,m=I()\r\na=[*I()]\r\nr,x,p={},{},{}\r\nfor i in range(1,n+1):\r\n r[i]=1\r\n x[i]={i}\r\n p[i]=i\r\nfor i in range(m):\r\n q,w=I()\r\n while p[q]!=q:q=p[q]\r\n while p[w]!=w:w=p[w]\r\n if r[q]<r[w]:q,w=w,q\r\n x[q]|=x[w]\r\n r[q]+=r[w]\r\n p[w]=p[q]\r\nprint(sum(min(a[j-1]for j in x[i])for i in r if p[i]==i))", "\r\n\r\nn,m=map(int,input().split())\r\ngold=[0]+list(map(int,input().split()))\r\n\r\n\r\nck=[i for i in range(n+1)]\r\n\r\ndef find(a):\r\n while(ck[a]!=a):\r\n ck[a]=ck[ck[a]]\r\n a=ck[a]\r\n return a\r\n\r\n\r\nfor j in range(m):\r\n u,v=map(int,input().split())\r\n u=find(u)\r\n v=find(v)\r\n if gold[u]<gold[v]:\r\n ck[v]=u\r\n else:ck[u]=v\r\n\r\nprint(sum(gold[i] for i in range(n+1) if ck[i]==i))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import copy\r\nn,m = map(int, input().split())\r\nc = list(map(int,input().split()))\r\nmas = [[] for i in range(n)]\r\nvert = [True]*n\r\nfor i in range(m):\r\n f, s = map(int, input().split())\r\n mas[f-1].append(s-1)\r\n mas[s-1].append(f-1)\r\nsum = 0\r\nfor ind in range(n):\r\n if vert[ind]:\r\n current = set([ind])\r\n min = 2000000000\r\n while True:\r\n target = set()\r\n for i in current:\r\n vert[i]=False\r\n if c[i] < min:\r\n min = c[i]\r\n temp = copy.deepcopy(mas[i])\r\n for j in mas[i]:\r\n target.add(j)\r\n temp.remove(j)\r\n mas[i] = copy.deepcopy(temp)\r\n if len(target) <= 0:\r\n sum+=min\r\n break\r\n current = copy.deepcopy(target)\r\n \r\nprint(sum)\r\n\r\n\r\n", "\r\nfor _ in range(1):\r\n \r\n min1=10**9\r\n n,m=map(int,input().split())\r\n list1=list(map(int,input().split()))\r\n list1=[0]+list1\r\n vis=[0]*(n+1)\r\n st=[]\r\n edges=[[] for i in range(n+1)]\r\n add=0\r\n for k in range(m):\r\n \r\n u,v=map(int,input().split())\r\n edges[u].append(v)\r\n edges[v].append(u)\r\n for i in range(1,n+1):\r\n min1=list1[i]\r\n if vis[i]==0:\r\n vis[i]=1\r\n st=[i]\r\n while(st):\r\n ed=st.pop()\r\n for a in edges[ed]:\r\n if vis[a]==0:\r\n vis[a]=1\r\n min1=min(min1,list1[a])\r\n st.append(a)\r\n add+=min1 \r\n print(add) \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n ", "class UnionFind:\r\n def __init__(self, n):\r\n self.par = [-1]*n\r\n self.rank = [0]*n\r\n\r\n def Find(self, x):\r\n if self.par[x] < 0:\r\n return x\r\n else:\r\n self.par[x] = self.Find(self.par[x])\r\n return self.par[x]\r\n\r\n def Unite(self, x, y):\r\n x = self.Find(x)\r\n y = self.Find(y)\r\n\r\n if x != y:\r\n if self.rank[x] < self.rank[y]:\r\n self.par[y] += self.par[x]\r\n self.par[x] = y\r\n else:\r\n self.par[x] += self.par[y]\r\n self.par[y] = x\r\n if self.rank[x] == self.rank[y]:\r\n self.rank[x] += 1\r\n\r\n def Same(self, x, y):\r\n return self.Find(x) == self.Find(y)\r\n\r\n def Size(self, x):\r\n return -self.par[self.Find(x)]\r\n\r\nimport sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nn, m = map(int, input().split())\r\nC = list(map(int, input().split()))\r\nuf = UnionFind(n)\r\n\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n x,y = x-1, y-1\r\n uf.Unite(x, y)\r\n\r\nfrom collections import defaultdict\r\nd = defaultdict(lambda: [])\r\nfor i in range(n):\r\n d[uf.Find(i)].append(C[i])\r\nans = 0\r\nfor k, l in d.items():\r\n ans += min(l)\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nvs=[False for i in range(n)]\r\nvc=list(map(int,input().split())) #costs\r\nv=[[] for i in range(n)]\r\nwhile m>0:\r\n x,y=map(int,input().split())\r\n v[x-1].append(y-1)\r\n v[y-1].append(x-1)\r\n m-=1\r\n \r\nans=0\r\n \r\ndef bfs(nod):\r\n q=[]\r\n q.append(nod)\r\n vs[nod]=True\r\n mn=vc[nod]\r\n while len(q)>0:\r\n node=q.pop()\r\n vs[node]=True\r\n mn=min(mn,vc[node])\r\n for ch in v[node]:\r\n if not vs[ch]:\r\n q.append(ch)\r\n \r\n return mn\r\n \r\nfor i in range(n):\r\n if vs[i]:\r\n continue\r\n ans+=bfs(i)\r\n \r\nprint(ans)", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\n\r\na,d,ans=[],[],0\r\nfor i in range(n):\r\n d.append([])\r\n a.append(0)\r\n\r\ndef dfs(i):\r\n z,m=[i],c[i]\r\n while len(z)>0:\r\n k=z.pop()\r\n if m>c[k]: m=c[k]\r\n a[k]=1\r\n for p in d[k]:\r\n if a[p]==0:\r\n z.append(p)\r\n return m\r\n\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n d[x-1].append(y-1)\r\n d[y-1].append(x-1)\r\n\r\nfor i in range(n):\r\n if a[i]==0:\r\n ans+=dfs(i)\r\n\r\nprint(ans)\r\n", "import re\r\nimport sys\r\nexit=sys.exit\r\nfrom bisect import bisect_left as bsl,bisect_right as bsr\r\nfrom collections import Counter,defaultdict as ddict,deque\r\nfrom functools import lru_cache\r\ncache=lru_cache(None)\r\nfrom heapq import *\r\nfrom itertools import *\r\nfrom math import inf\r\nfrom pprint import pprint as pp\r\nenum=enumerate\r\nri=lambda:int(rln())\r\nris=lambda:list(map(int,rfs()))\r\nrln=sys.stdin.readline\r\nrl=lambda:rln().rstrip('\\n')\r\nrfs=lambda:rln().split()\r\nd4=[(0,-1),(1,0),(0,1),(-1,0)]\r\nd8=[(-1,-1),(0,-1),(1,-1),(-1,0),(1,0),(-1,1),(0,1),(1,1)]\r\n########################################################################\r\n\r\nn,m=ris()\r\nc=ris()\r\nadj=[[] for _ in range(n)]\r\nfor _ in range(m):\r\n x,y=ris()\r\n x,y=x-1,y-1\r\n adj[x].append(y)\r\n adj[y].append(x)\r\nans=0\r\nvis=[0]*n\r\nfor u in range(n):\r\n if vis[u]:\r\n continue\r\n vis[u]=1\r\n stk=[u]\r\n mi=inf\r\n while stk:\r\n u=stk.pop()\r\n mi=min(mi,c[u])\r\n for v in adj[u]:\r\n if vis[v]:\r\n continue\r\n vis[v]=1\r\n stk.append(v)\r\n ans+=mi\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ncosts = [int(x) for x in input().split()]\r\n\r\ndisjointSet = [-1 for x in costs]\r\n\r\ndef root(x):\r\n if disjointSet[x] >= 0:\r\n disjointSet[x] = root(disjointSet[x])\r\n return disjointSet[x]\r\n return x\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n r1, r2 = root(a), root(b)\r\n if r1 != r2:\r\n disjointSet[r2] = r1\r\n costs[r1] = min(costs[r1], costs[r2])\r\n costs[r2] = 0\r\nprint(sum(costs))", "class Person:\r\n relations: [int]\r\n\r\n def __init__(self, price, index):\r\n self.index = index\r\n self.price = price\r\n self.relations = []\r\n\r\n\r\ndef dfs(persons):\r\n queue = persons[:]\r\n visited = set()\r\n cost = 0\r\n while queue:\r\n s: Person = queue.pop(0)\r\n if s.index not in visited:\r\n stack = s.relations\r\n visited.add(s.index)\r\n min_price = s.price\r\n while stack:\r\n element = stack.pop()\r\n if element not in visited:\r\n visited.add(element)\r\n p: Person = persons[element]\r\n min_price = min(min_price, p.price)\r\n stack += p.relations\r\n cost += min_price\r\n print(cost)\r\n\r\n\r\nm, n = [int(x) for x in input().split()]\r\nprices = [int(x) for x in input().split()]\r\npairs = []\r\nfor i in range(n):\r\n p1, p2 = [int(x) for x in input().split()]\r\n pairs.append((p1, p2))\r\n\r\n# Process inputs\r\npersons = []\r\nfor i in range(m):\r\n persons.append(Person(prices[i], i))\r\n\r\nfor p1, p2 in pairs:\r\n persons[p1 - 1].relations.append(p2 - 1)\r\n persons[p2 - 1].relations.append(p1 - 1)\r\ndfs(persons)\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, functools\r\n#inf = 10**20\r\n#import sys,collections\r\ninf = float('inf')\r\nmod = 10**9+7\r\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\r\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\r\ndef I(): return int(sys.stdin.readline())\r\ndef F(): return float(sys.stdin.readline())\r\ndef S(): return input()\r\ndef endl(): return print('\\n')\r\n\r\nn,m = LI()\r\nc = LI()\r\ngraph = collections.defaultdict(list)\r\nfor _ in range(m):\r\n\tu,v = LI()\r\n\tgraph[u-1].append(v-1)\r\n\tgraph[v-1].append(u-1)\r\n\r\nvisited = set()\r\nres = 0\r\nfor i in range(n):\r\n mn = c[i]\r\n if i not in visited:\r\n visited.add(i)\r\n stack = [i]\r\n while stack:\r\n node = stack.pop()\r\n for adj in graph[node]:\r\n if adj not in visited:\r\n visited.add(adj)\r\n if mn > c[adj]:\r\n \tmn = c[adj]\r\n stack.append(adj)\r\n res+=mn\r\n\r\nprint(res)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nc=list(map(int,input().split()))\r\n\r\nfrom collections import defaultdict\r\n\r\nadj=defaultdict(list)\r\n\r\nvis= [0 for i in range(n+1)]\r\n\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\nans=0 \r\n\r\ndef DFS(x):\r\n\tz = float(\"inf\")\r\n\tstack = [x]\r\n\twhile len(stack):\r\n\t\ttemp = stack.pop()\r\n\t\tvis[temp] = 1\r\n\t\tz = min(z,c[temp-1])\r\n\t\tfor j in adj[temp]:\r\n\t\t\tif not vis[j]:\r\n\t\t\t\tstack.append(j)\r\n\treturn z\r\n\t\r\n\r\nfor i in range(1,n+1):\r\n if not vis[i]:\r\n ans+=DFS(i)\r\n\r\nprint(ans)", "from collections import deque\r\nn, m = map(int,input().split())\r\na = list(map(int, input().split()))\r\ng = {i: [] for i in range(1, n + 1)}\r\nwhile m:\r\n s, d = map(int, input().split())\r\n g[s].append(d)\r\n g[d].append(s)\r\n m = m - 1\r\nv = [False for _ in range(n + 1)]\r\nans = 0\r\nfor start in range(1, n + 1):\r\n if v[start] == False:\r\n v[start] = True\r\n queue = deque([start])\r\n comp_min = float('inf')\r\n while queue:\r\n curr = queue.popleft()\r\n comp_min = min(comp_min, a[curr - 1])\r\n for i in g[curr]:\r\n if v[i] == False:\r\n v[i] = True\r\n comp_min = min(comp_min, a[i - 1])\r\n queue.append(i)\r\n ans = ans + comp_min\r\nprint(ans)", "nodes, vertices = map(int,input().split())\r\nbribes = list(map(int, input().split()))\r\nadj = {i:[] for i in range(nodes)}\r\nfor _ in range(vertices):\r\n x,y = map(int, input().split())\r\n x,y = x-1,y-1\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n\r\ndef connected_components(adj):\r\n visited = set()\r\n for key in adj.keys():\r\n if key in visited:\r\n continue\r\n component = []\r\n stack = [key]\r\n while stack:\r\n k = stack.pop()\r\n if k in visited:\r\n continue\r\n visited.add(k)\r\n component.append(k)\r\n for node in adj[k]:\r\n stack.append(node)\r\n yield component\r\n\r\ncost = sum(\r\n map(lambda x: min(x),\r\n map(lambda x: map(lambda y: bribes[y], x), connected_components(adj))\r\n )\r\n )\r\nprint(cost)\r\n", "import sys\r\nimport itertools as it\r\nfrom collections import deque\r\nlines = sys.stdin.read().splitlines()\r\n\r\nn, m = map(int, lines[0].split())\r\ngold = list(map(int, lines[1].split()))\r\ntotal_cost = 0\r\ndone = [False for _ in range(n)]\r\nfriends = [[] for _ in range(n)]\r\nfor line in it.islice(lines, 2, 2 + m):\r\n f1, f2 = map(int, line.split())\r\n friends[f1-1].append(f2-1)\r\n friends[f2-1].append(f1-1)\r\nreverse_index_gold = [(j, i) for (i, j) in enumerate(gold)]\r\n\r\ndef spread(node, done, gold, friends):\r\n done[node] = True\r\n todo = deque(friends[node])\r\n while len(todo) != 0:\r\n elm = todo.popleft()\r\n done[elm] = True\r\n for f in friends[elm]:\r\n if not done[f]:\r\n todo.append(f)\r\n\r\n\r\n return gold[node]\r\n\r\nfor cost, index in sorted(reverse_index_gold):\r\n if not done[index]:\r\n total_cost += spread(index, done, gold, friends)\r\nprint(total_cost)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ng=[[] for i in range(n)]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n g[x-1].append(y-1)\r\n g[y-1].append(x-1)\r\nboo=[0 for i in range(n)]\r\nres=[]\r\ndef dfs(stack,boo,ans):\r\n while len(stack)!=0:\r\n x=stack.pop()\r\n for i in g[x]:\r\n if boo[i]==0:\r\n ans.append(i)\r\n stack.append(i)\r\n boo[i]=1\r\n\r\nfor i in range(n):\r\n if boo[i]==0:\r\n stack=[i]\r\n boo[i]=1\r\n ans=[i]\r\n dfs(stack,boo,ans)\r\n res.append(ans)\r\nf=0\r\nfor i in range(len(res)):\r\n for j in range(len(res[i])):\r\n res[i][j]=l[res[i][j]]\r\n f+=min(res[i])\r\nprint (f)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "from collections import deque\r\nimport sys\r\nsys.setrecursionlimit(5000)\r\n\r\n\r\nclass Graph(object):\r\n def __init__(self, vertices, adj):\r\n self.vertices = [i for i in range(1, vertices+1)]\r\n self.adj = adj\r\n self.fix_adj(vertices)\r\n \r\n def fix_adj(self, v):\r\n for i in range(1, v+1):\r\n try:\r\n a = self.adj[i]\r\n except KeyError:\r\n self.adj[i] = []\r\n \r\n def iter_vertices(self):\r\n for v in self.vertices:\r\n yield v\r\n \r\n def adj_list(self, v):\r\n return self.adj[v]\r\n \r\nclass BFSResult:\r\n def __init__(self):\r\n self.level = {}\r\n self.parent = {}\r\n self.connected_comp = []\r\n \r\ndef bfs(g, s, r):\r\n r.level[s] = 0\r\n r.parent[s] = None\r\n q = deque()\r\n q.append(s)\r\n c_cp = [s]\r\n while q:\r\n u = q.popleft()\r\n for v in g.adj_list(u):\r\n if v not in r.level:\r\n r.parent[v] = u\r\n r.level[v] = r.level[u]+1\r\n q.append(v)\r\n c_cp.append(v)\r\n r.connected_comp.append(c_cp)\r\n \r\nif __name__ == '__main__':\r\n people, no_friends = list(map(int, input().rstrip().split()))\r\n cost = list(map(int,input().rstrip().split()))\r\n adj = {}\r\n for _ in range(no_friends):\r\n u, v = list(map(int, input().rstrip().split()))\r\n try:\r\n adj[u].append(v)\r\n except KeyError:\r\n adj[u] = [v]\r\n try:\r\n adj[v].append(u)\r\n except KeyError:\r\n adj[v] = [u]\r\n g = Graph(people, adj)\r\n #print(g.adj)\r\n r = BFSResult()\r\n for s in g.iter_vertices():\r\n if s not in r.level:\r\n bfs(g, s, r)\r\n #print(r.connected_comp)\r\n ans = 0\r\n for cc in r.connected_comp:\r\n choice = None\r\n for i in cc:\r\n if choice == None:\r\n choice = cost[i-1]\r\n elif cost[i-1]<choice:\r\n choice = cost[i-1]\r\n ans += choice\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", "from collections import defaultdict\r\nfrom collections import deque\r\n\r\ntotNum,pairs = map(int,input().split())\r\ncosts = list(map(int,input().split()))\r\ngraph = defaultdict(list)\r\nfor i in range(pairs):\r\n node1,node2 = map(int,input().split())\r\n graph[node1].append(node2)\r\n graph[node2].append(node1)\r\nseen = set()\r\n\r\ndef bfs(node,cost):\r\n queue = deque()\r\n queue.append((node,cost))\r\n outPut = cost\r\n \r\n while queue:\r\n node,cost = queue.popleft()\r\n seen.add(node)\r\n outPut = min(cost,outPut)\r\n for child in graph[node]:\r\n if child not in seen:\r\n queue.append((child,min(costs[child - 1],outPut)))\r\n \r\n return outPut\r\n\r\noutPut = 0\r\nfor key in range(1,totNum + 1):\r\n if key not in seen:\r\n outPut += (bfs(key,costs[key - 1]))\r\n \r\nprint(outPut)\r\n", "import sys\nimport threading\n\nsys.setrecursionlimit(100000)\n\n\ndef minCost(cost, friends, n, m):\n parent = [i for i in range(n + 1)]\n total = 0\n visited = set()\n\n def find(u):\n while parent[u] != u:\n parent[u] = parent[parent[u]]\n u = parent[u]\n return parent[u]\n\n def union(u, v):\n u, v = find(u), find(v)\n u, v = sorted([u, v], key=lambda x: cost[x])\n parent[v] = u\n\n for u, v in friends:\n union(u, v)\n\n for i in range(1, n + 1):\n find(i)\n\n for i in range(1, n + 1):\n if i == parent[i]:\n total += cost[i]\n\n return total\n\n\nn, m = list(map(int, input().split()))\ncost = [0] + list(map(int, input().split()))\n\nfriends = []\nfor _ in range(m):\n friends.append(list(map(int, input().split())))\nprint(minCost(cost, friends, n, m))\n\n\n# threading.stack_size(1 << 27)\n# main_thread = threading.Thread(target=main)\n# main_thread.start()\n# main_thread.join()\n", "def dfs(graph,start,visited):\r\n visited.add(start)\r\n stack = [start]\r\n while stack:\r\n x = stack.pop()\r\n for i in graph[x]:\r\n if i not in visited:\r\n stack.append(i)\r\n visited.add(i)\r\n\r\n return visited\r\n\r\nn,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\ng = [set() for i in range(n+1)]\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n g[x].add(y)\r\n g[y].add(x)\r\n\r\ncomponent = []\r\nvisited = set()\r\nfor i in range(1,n+1):\r\n if i not in visited:\r\n d = dfs(g,i,set())\r\n component.append(d)\r\n visited|=d\r\nres = 0\r\nfor i in component:\r\n minn = 10**9+1\r\n for j in i:\r\n if c[j-1]<minn:\r\n minn = c[j-1]\r\n res+=minn\r\n\r\nprint(res)\r\n", "import itertools\r\nimport 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 bfs(s):\r\n q = [s]\r\n it = 0\r\n v[s] = 1\r\n mn = c[s]\r\n\r\n while it != len(q):\r\n k = q[it]\r\n for u in g[k]:\r\n if v[u] == 0:\r\n mn = min(mn, c[u])\r\n v[u] = 1\r\n q.append(u)\r\n\r\n it += 1\r\n\r\n return mn\r\n\r\n n, m = map(int, input().split())\r\n c = list(map(int, input().split()))\r\n\r\n g = [[] for i in range(n)]\r\n for i in range(m):\r\n x, y = map(int, input().split())\r\n x, y = x - 1, y - 1\r\n g[x].append(y)\r\n g[y].append(x)\r\n\r\n res = 0\r\n v = [0 for i in range(n)]\r\n for i in range(n):\r\n if v[i] == 0:\r\n res += bfs(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", "#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\nfrom collections import defaultdict\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\n# mod = 1000000007\r\n# print(\"Case #\"+str(_+1)+\":\",)\r\n\r\nn,x = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nd = defaultdict(list)\r\nfor i in range(x):\r\n u,v = map(int, input().split())\r\n d[u].append(v)\r\n d[v].append(u)\r\nvisited=[True for i in range(n+1)]\r\nans=0\r\ncost=0\r\nfor key in range(1,n+1):\r\n cost=0\r\n if visited[key]:\r\n q=[key]\r\n cost=l[key-1]\r\n visited[key]=False\r\n while(q):\r\n k = q.pop(0)\r\n for i in d[k]:\r\n if visited[i]:\r\n visited[i]=False\r\n q.append(i)\r\n cost=min(cost,l[i-1])\r\n\r\n ans+=cost\r\n\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\ndef 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 debug(v):\r\n print(f\"value is {v}\")\r\n return\r\n\r\ndef dfs(n,visited,graph):\r\n\r\n if n in visited:\r\n return\r\n stack = [n]\r\n\r\n while stack:\r\n\r\n cur = stack.pop()\r\n visited.add(cur)\r\n for el in graph[cur]:\r\n if el not in visited:\r\n stack.append(el)\r\n return\r\ndef main():\r\n\r\n n, m = rm()\r\n c = rl()\r\n st = set()\r\n graph = {i:[] for i in range(1,n+1)}\r\n\r\n for _ in range(m):\r\n a,b = rm()\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\n if max(c) == 0:\r\n print(0)\r\n return\r\n\r\n cc = []\r\n\r\n for i in range(len(c)):\r\n cc.append([c[i], i])\r\n\r\n cc.sort()\r\n cost = 0\r\n\r\n for pers in cc:\r\n if pers[1]+1 not in st:\r\n cost += c[pers[1]]\r\n dfs(pers[1]+1, st, graph)\r\n\r\n print(cost)\r\n\r\nmain()", "from queue import Queue\r\n\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\nadj = [[] for i in range(n)]\r\nfor i in range(n):\r\n adj[i] = []\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n adj[u - 1].append(v - 1)\r\n adj[v - 1].append(u - 1)\r\nvis = [0] * n\r\nans = 0\r\n\r\nfor i in range(n):\r\n if vis[i]:\r\n continue\r\n q = Queue()\r\n vis[i] = 1\r\n q.put(i)\r\n res = c[i]\r\n while not q.empty():\r\n u = q.get()\r\n for v in adj[u]:\r\n if not vis[v]:\r\n vis[v] = 1\r\n q.put(v)\r\n res = min(res, c[v])\r\n\r\n ans = ans + res\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\narr=[int(x) for x in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d.setdefault(i,set())\r\n d[i].add(i)\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n a-=1\r\n b-=1\r\n d.setdefault(a,set())\r\n d.setdefault(b,set())\r\n d[a].add(b)\r\n d[b].add(a)\r\nvisited=set()\r\nans=0\r\n\r\nfor i in range(n):\r\n if i not in visited:\r\n m=arr[i]\r\n l=[i]\r\n visited.add(i)\r\n #print(\"for i \",i)\r\n while l:\r\n for fnd in d[l.pop()]:\r\n if fnd not in visited:\r\n #print(\"fnd is \",fnd)\r\n m=min(m,arr[fnd])\r\n l.append(fnd)\r\n visited.add(fnd)\r\n #print(m)\r\n #print(visited)\r\n ans+=m \r\n i+=1\r\nprint(ans)\r\n \r\n \r\n \r\n \r\n \r\n", "from collections import defaultdict\r\n\r\n\r\nn, m = map(int, input().split())\r\nlst = list(map(int, input().split()))\r\n\r\nvisited = set()\r\nadj = defaultdict(list)\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\nans = 0\r\nfor i in range(1, n+1):\r\n if i not in visited:\r\n val = lst[i-1]\r\n queue = [i]\r\n while queue:\r\n top = queue.pop(0)\r\n val = min(val, lst[top-1])\r\n for j in adj[top]:\r\n if j not in visited:\r\n visited.add(j)\r\n queue.append(j)\r\n\r\n ans += val\r\n\r\nprint(ans)\r\n", "n,q=[int(i) for i in input().split()]\r\nl=[int(i) for i in input().split()]\r\nfrie=[i for i in range(n)]\r\ndef find(a):\r\n while frie[a]!=a:\r\n frie[a]=frie[frie[a]]\r\n a=frie[a]\r\n return a\r\nfor i in range(q):\r\n s=[int(i) for i in input().split()]\r\n x,y=s[0]-1,s[1]-1\r\n x,y=find(x),find(y)\r\n if l[x]>l[y]:\r\n x,y=y,x\r\n \r\n frie[y]=x\r\n \r\nvisited=[False for i in range(n)]\r\nprint(sum(l[frie[j]] for j in range(n) if frie[j] == j))", "# from debug import debug\r\nfrom collections import deque\r\n\r\nI = lambda :int(input())\r\nL = lambda :list(map(int, input().split()))\r\nT = lambda :map(int, input().split())\r\n\r\nn, m = T()\r\ncost = [0]+L()\r\ngraph = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n a, b = T()\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nv = [0]*(n+1)\r\n\r\ndef bfs(node):\r\n q = deque([node])\r\n v[node] = 1\r\n\r\n ans = cost[node]\r\n while q:\r\n node = q.popleft()\r\n ans = min(ans, cost[node])\r\n for nbr in graph[node]:\r\n if v[nbr] == 0:\r\n v[nbr] = 1\r\n q.append(nbr)\r\n return ans\r\n\r\nans = 0\r\nfor i in range(1, n+1):\r\n if v[i] == 0: \r\n ans += bfs(i)\r\n\r\nprint(ans)", "def DFS(graph,visited,m,s): \r\n \r\n stack = [] \r\n stack.append(s) \r\n mn=m[s]\r\n while (len(stack)): \r\n s = stack[-1] \r\n stack.pop() \r\n if (not visited[s]): \r\n visited[s] = True \r\n if m[s]<mn:\r\n mn=m[s]\r\n for node in graph[s]: \r\n if (not visited[node]): \r\n stack.append(node) \r\n return mn\r\nv,e=map(int,input().split())\r\ng=[]\r\nfor r in range(v):\r\n g.append([])\r\ngold=list(map(int,input().split()))\r\nfor i in range(e):\r\n joy,toy=map(int,input().split())\r\n g[joy-1].append(toy-1)\r\n g[toy-1].append(joy-1)\r\nans=0\r\nvisited = [False for i in range(v)] \r\nfor k in range(v):\r\n if visited[k]==False:\r\n ans+=DFS(g,visited,gold,k)\r\nprint(ans)\r\n ", "import bisect\r\nimport collections\r\nimport copy\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(99999)\r\n\r\n\r\n\r\nn,m = map(int,sys.stdin.readline().split())\r\nc = list(map(int,sys.stdin.readline().split()))\r\nvis = [0]*(n+1)\r\ng = collections.defaultdict(list)\r\ndef bfs(st):\r\n vis[st] = 1\r\n q = collections.deque()\r\n q.append(st)\r\n while q:\r\n cq = q.popleft()\r\n for nc in g[cq]:\r\n if vis[nc]==0:\r\n vis[nc]=1\r\n q.append(nc)\r\n\r\n\r\nfor _ in range(m):\r\n u,v = map(int,sys.stdin.readline().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\ntc = sorted(list(range(n)),key=lambda x:c[x])\r\n\r\nans = 0\r\nfor ck in tc:\r\n if vis[ck+1]==0:\r\n ans+= c[ck]\r\n bfs(ck+1)\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\nclass queue:\r\n\tdef __init__(self,n):\r\n\t\tself.n=n\r\n\t\tself.q=[0 for i in range(n)]\r\n\t\tself.l=0\r\n\t\tself.r=n-1\r\n\t\tself.sz=0\r\n\tdef push(self,u):\r\n\t\tself.r=(self.r+1)%n\r\n\t\tself.q[self.r]=u\r\n\t\tself.sz+=1\r\n\tdef pop(self):\r\n\t\tself.l=(self.l+1)%n\r\n\t\tself.sz-=1\r\n\tdef front(self):\r\n\t\treturn self.q[self.l]\r\n\tdef empty(self):\r\n\t\treturn self.sz==0\r\n\tdef size(self):\r\n\t\treturn self.sz\r\n\tdef clear(self):\r\n\t\tself.l=0\r\n\t\tself.r=n-1\r\n\t\tself.sz=0\r\n\t\t\r\nclass stack:\r\n\tdef __init__(self):\r\n\t\tself.st=[]\r\n\t\tself.sz=0\r\n\t\tself.l=0\r\n\tdef push(self,u):\r\n\t\tself.st.append(u)\r\n\t\tself.sz+=1\r\n\tdef top(self):\r\n\t\treturn self.st[self.l]\r\n\tdef pop(self):\r\n\t\tself.l+=1\r\n\t\tself.sz-=1\r\n\tdef empty(self):\r\n\t\treturn self.sz==0\r\n\tdef size(self):\r\n\t\treturn self.sz\r\n\t\r\nn,m=map(int,input().split())\r\ncost=list(map(int,input().split()))\r\ng=[[]for i in range(n)]\r\nfor i in range(m):\r\n\tu,v=map(int,input().split())\r\n\tu-=1\r\n\tv-=1\r\n\tg[u].append(v)\r\n\tg[v].append(u)\r\n\t\r\ncolor=[0 for i in range(n)]\r\nans=0\r\nfor i in range(n):\r\n\tif not color[i]:\r\n\t\tlst=[]\r\n\t\tst=stack()\r\n\t\tst.push(i)\r\n\t\tlst.append(cost[i])\r\n\t\twhile not st.empty():\r\n\t\t\tu=st.top()\r\n\t\t\tst.pop()\r\n\t\t\tfor v in g[u]:\r\n\t\t\t\tif not color[v]:\r\n\t\t\t\t\tcolor[v]=1\r\n\t\t\t\t\tlst.append(cost[v])\r\n\t\t\t\t\tst.push(v)\r\n\t\tans+=min(lst)\r\n\r\nprint(ans)\r\n", "from collections import defaultdict, deque\r\n\r\n\r\ndef solve(n, m, nums, connectt):\r\n dictt = {}\r\n\r\n visited= set()\r\n adj = defaultdict(set)\r\n for i in range(1, n+1):\r\n dictt[i] = nums[i-1]\r\n for i , j in connectt:\r\n adj[i].add(j)\r\n adj[j].add(i)\r\n\r\n if m == 0:\r\n return sum(nums)\r\n total = 0\r\n def bfs(i):\r\n\r\n res = dictt[i]\r\n queue = deque([i])\r\n while queue:\r\n curr = queue.popleft()\r\n for j in adj[curr]:\r\n if j not in visited:\r\n visited.add(j)\r\n queue.append(j)\r\n res= min(res, dictt[j])\r\n return res\r\n \r\n \r\n for i in dictt:\r\n if i not in visited:\r\n total += bfs(i)\r\n return total\r\nn , m = [int(i) for i in input().split()]\r\nnums = [int(i) for i in input().split()]\r\nconnectt = []\r\nfor _ in range(m):\r\n temp = [int(i) for i in input().split()]\r\n connectt.append(temp)\r\nprint(solve(n,m,nums, connectt))\r\n\r\n\r\n ", "# -*- coding: utf-8 -*-\r\n\r\nfriends = [[]]\r\nalready_know = [1]\r\n\r\ndef selector(payment):\r\n return payment[0]\r\n\r\ndef bfs(root):\r\n queue = [root]\r\n while queue != []:\r\n parent = queue.pop(0)\r\n already_know[parent] = 1\r\n sons = friends[parent]\r\n \r\n n_sons = len(sons)\r\n for i in range(n_sons):\r\n son = sons[i]\r\n if already_know[son] == 0:\r\n queue.append(son)\r\n return\r\n\r\nvalues = input().split()\r\nn_people = int(values[0])\r\nn_connections = int(values[1])\r\n\r\nvalues = input().split()\r\npayments = []\r\nfor i in range(n_people):\r\n payments.append([int(values[i]), i + 1])\r\n friends.append([])\r\n already_know.append(0)\r\n\r\npayments.sort(key = selector)\r\n\r\nfor i in range(n_connections):\r\n connection = input().split()\r\n first = int(connection[0])\r\n second = int(connection[1])\r\n friends[first].append(second)\r\n friends[second].append(first)\r\n\r\nmoney_needed = 0\r\nfor i in range(n_people):\r\n person = payments[i][1]\r\n if already_know[person] == 0:\r\n bfs(person)\r\n money_needed += payments[i][0]\r\n \r\nprint(money_needed)\r\n ", "nodes, vertices = map(int,input().split())\r\nbribes = list(map(int, input().split()))\r\nadj = {i:[] for i in range(nodes)}\r\nfor _ in range(vertices):\r\n x,y = map(int, input().split())\r\n x,y = x-1,y-1\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n\r\ndef dfs(adj, node, visited=set()):\r\n stack = [node]\r\n while stack:\r\n k = stack.pop()\r\n if k in visited:\r\n continue\r\n visited.add(k)\r\n yield k\r\n for n in adj[k]:\r\n stack.append(n)\r\n\r\ndef connected_components(adj):\r\n visited = set()\r\n for key in adj.keys():\r\n if key in visited:\r\n continue\r\n yield dfs(adj, key, visited)\r\n\r\ncost = sum(\r\n map(lambda x: min(x),\r\n map(lambda x: map(lambda y: bribes[y], x), connected_components(adj))\r\n )\r\n )\r\nprint(cost)\r\n", "from functools import lru_cache\r\nfrom collections import defaultdict, deque\r\nclass Solution:\r\n def Rumor(self, array, graph):\r\n # TODO write an algorithm here\r\n totalVisited, answer = set(), 0\r\n for key in graph:\r\n if key not in totalVisited:\r\n queue, visited, mincost = deque([key]), set(), array[key-1]\r\n while queue:\r\n for _ in range(len(queue)):\r\n curr = queue.popleft()\r\n totalVisited.add(curr)\r\n mincost = min(mincost, array[curr-1])\r\n if curr in graph:\r\n for c in graph[curr]:\r\n if c not in visited:\r\n visited.add(c)\r\n queue.append(c)\r\n \r\n answer += mincost\r\n \r\n for i in range(1, len(array)+1):\r\n if i not in totalVisited:\r\n answer += array[i-1]\r\n return answer\r\n \r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n n, m = list(map(int, input().split()))\r\n array = list(map(int, input().split()))\r\n graph = defaultdict(set)\r\n for _ in range(m):\r\n x = list(map(int, input().split()))\r\n graph[x[0]].add(x[1])\r\n graph[x[1]].add(x[0])\r\n \r\n print(solution.Rumor(array, graph))\r\n", "import sys,io,os\r\nimport math\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\nelse:\r\n input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nvisited=[]\r\ngraph=[]\r\nc=0\r\nglobal mini\r\ndef dfs(s):\r\n global visited,graph,mini,c\r\n stack=[s]\r\n visited[s]=True\r\n while(len(stack)>0):\r\n p=stack.pop()\r\n mini=min(c[p],mini)\r\n for i in range(len(graph[p])):\r\n k=graph[p][i]\r\n if not visited[k]:\r\n stack.append(k)\r\n visited[k]=True\r\ndef main():\r\n #n=int(input())\r\n global visited,graph,mini,c\r\n n,m=list(map(int,input().split()))\r\n c=list(map(int,input().split()))\r\n graph=[[] for i in range(n)]\r\n for i in range(m):\r\n a,b=list(map(int,input().split()))\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n visited=[False]*n\r\n sum=0\r\n for i in range(n):\r\n mini=math.inf\r\n if not visited[i]:\r\n dfs(i)\r\n sum+=mini\r\n # print(\"aa\",mini)\r\n print(sum)\r\n\r\nfor _ in range(1):\r\n main()\r\n", "\r\nfrom collections import defaultdict\r\n\r\nn,m = map(int,input().split())\r\nc = list(map(int,input().split()))\r\n\r\nd = defaultdict(list)\r\n\r\ndef DFS(d,visited,x,c):\r\n\r\n\tz = float(\"inf\")\r\n\t\r\n\tstack = [x]\r\n\twhile len(stack):\r\n\t\ttemp = stack.pop()\r\n\t\tvisited[temp] = 1\r\n\t\tz = min(z,c[temp-1])\r\n\t\tfor j in d[temp]:\r\n\t\t\tif visited[j] == 0:\r\n\t\t\t\tstack.append(j)\r\n\treturn z\r\n\r\nfor i in range(m):\r\n\r\n\tx,y = map(int,input().split())\r\n\td[x].append(y)\r\n\td[y].append(x)\r\n\r\nvisited = [0 for i in range(n+1)]\r\nans = 0\r\nfor i in range(1,n+1):\r\n\r\n\tif visited[i] == 0:\r\n\t\tans = ans + DFS(d,visited,i,c)\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ncs = [0] + list(map(int, input().split()))\r\np = [0] + list(range(1, n+1))\r\n\r\n\r\ndef find(x):\r\n while p[x] != x:\r\n p[x] = p[p[x]]\r\n x = p[x]\r\n return x\r\n\r\n\r\nfor _ in range(m):\r\n x, y = map(find, (map(int, input().split())))\r\n if cs[x] < cs[y]:\r\n p[y] = x\r\n else:\r\n p[x] = y\r\n\r\nans = 0\r\nfor i in range(n+1):\r\n if p[i] == i:\r\n ans += cs[i]\r\nprint(ans)\r\n", "# Dictionary == Hash Collision\r\n\r\nfrom sys import stdin\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom collections import defaultdict, Counter, deque\r\n\r\ninput = stdin.readline\r\n\r\n\r\ndef read(default=int):\r\n return list(map(default, input().strip().split()))\r\n\r\n\r\ndef solve():\r\n n, m = read()\r\n weights = [0] + read()\r\n ans = 0\r\n visited = [0] * (n + 1)\r\n lst = [[] for i in range(n + 1)]\r\n for i in range(m):\r\n u, v = read()\r\n lst[v].append(u)\r\n lst[u].append(v)\r\n for i in range(1, n + 1):\r\n if not visited[i]:\r\n MIN = float(\"inf\")\r\n arr = [i]\r\n while arr:\r\n x = arr.pop()\r\n visited[x] = 1\r\n MIN = min(MIN, weights[x])\r\n for j in lst[x]:\r\n if not visited[j]:\r\n arr.append(j)\r\n ans += MIN\r\n return ans\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nfor test in range(t):\r\n print(solve())\r\n", "import sys\r\n\r\nsys.setrecursionlimit(1000000)\r\n\r\n\r\ndef bfs(v):\r\n global d\r\n stack = [v]\r\n while stack:\r\n vertex = stack.pop()\r\n if value[vertex] < d:\r\n d = value[vertex]\r\n used[vertex] = True\r\n for to in a[vertex]:\r\n if used[to] == 0:\r\n stack.append(to)\r\n\r\n\r\nn, m = list(map(int, input().split()))\r\nvalue = list(map(int, input().split()))\r\na = []\r\nfor i in range(n):\r\n a.append([])\r\nfor i in range(m):\r\n b = list(map(int, input().split()))\r\n a[b[0] - 1].append(b[1] - 1)\r\n a[b[1] - 1].append(b[0] - 1)\r\nused = [0] * n\r\nans = 0\r\nfor i in range(n):\r\n if used[i] == 0:\r\n d = float(\"inf\")\r\n bfs(i)\r\n ans += d\r\nprint(ans)\r\n\n# Mon Jul 10 2023 19:39:39 GMT+0300 (Moscow Standard Time)\n", "#nums = list(map(int, input().split()))\r\n\r\n\r\nfrom collections import defaultdict,deque\r\n\r\nn_c, n_f = map(int, input().split())\r\nprices = list(map(int, input().split()))\r\nfriends = []\r\ngraph = defaultdict(list)\r\n\r\nfor i in range(n_f):\r\n start,dest = map(int, input().split())\r\n graph[start].append(dest)\r\n graph[dest].append(start)\r\n\r\n\r\nvisited = set() \r\n\r\n\r\ndef findMinCost(chh):\r\n queue = deque([])\r\n queue.append(chh)\r\n \r\n _min = float('inf')\r\n \r\n while queue:\r\n curr = queue.popleft()\r\n if curr not in visited:\r\n visited.add(curr)\r\n _min = min(prices[curr-1],_min)\r\n \r\n for neigh in graph[curr]:\r\n if neigh not in visited:\r\n queue.append(neigh)\r\n \r\n return _min\r\n\r\n\r\n\r\n\r\ncost = 0\r\nfor char in range(1,n_c+1):\r\n if char not in visited:\r\n cost += findMinCost(char)\r\n \r\nprint(cost)", "from collections import defaultdict\n\nclass UnionFind:\n def __init__(self):\n self.__size = len([])\n self.__parents_ids = defaultdict(int)\n self.__tree_size_of_parent = defaultdict(int)\n self.__cheapest_person_on_tree = defaultdict(int)\n \n def add_node(self, node_id, price):\n if (self.__parents_ids[node_id]):\n return\n self.__parents_ids[node_id] = node_id\n self.__tree_size_of_parent[node_id] = 1\n self.__size = self.__size + 1\n self.__cheapest_person_on_tree[node_id] = price\n \n def find_root_id_of(self, node_id):\n root_id = node_id\n while(root_id != self.__parents_ids[root_id]): # find root\n root_id = self.__parents_ids[root_id]\n while(node_id != root_id): # compress path\n next = self.__parents_ids[node_id]\n self.__parents_ids[node_id] = root_id\n node_id = next\n return root_id\n \n def sum_cheapest_person_of_each_tree(self):\n s = 0\n for key, value in self.__cheapest_person_on_tree.items():\n s = s + value\n return s\n\n\n def union(self, node_a, node_b):\n root_of_a = self.find_root_id_of(node_a)\n root_of_b = self.find_root_id_of(node_b)\n if (root_of_a == root_of_b): return\n\n cheapest_person_a = self.__cheapest_person_on_tree[root_of_a]\n cheapest_person_b = self.__cheapest_person_on_tree[root_of_b]\n if (cheapest_person_a < cheapest_person_b):\n cheapest_person = cheapest_person_a\n else:\n cheapest_person = cheapest_person_b\n\n if (self.__tree_size_of_parent[root_of_a] > self.__tree_size_of_parent[root_of_b]):\n self.__tree_size_of_parent[root_of_b] += self.__tree_size_of_parent[root_of_a]\n self.__parents_ids[root_of_a] = root_of_b\n self.__cheapest_person_on_tree.pop(root_of_a)\n self.__cheapest_person_on_tree[root_of_b] = cheapest_person\n else:\n self.__tree_size_of_parent[root_of_a] += self.__tree_size_of_parent[root_of_b]\n self.__parents_ids[root_of_b] = root_of_a\n self.__cheapest_person_on_tree.pop(root_of_b)\n self.__cheapest_person_on_tree[root_of_a] = cheapest_person\n\ninput_value = input().split(' ')\ncharacters_count = int(input_value[0])\npairs_count = int(input_value[1])\n\nunion_find = UnionFind()\n\nif (characters_count == 1):\n person = 1\n price = int(input())\n union_find.add_node(person, price)\nelse:\n for index, value in enumerate(input().split(' ')):\n person = index + 1\n price = int(value)\n union_find.add_node(person, price)\n\nfor current_pair in range(pairs_count):\n input_value = input().split(' ')\n person_a = int(input_value[0])\n person_b = int(input_value[1])\n union_find.union(person_a, person_b)\n\nprint(union_find.sum_cheapest_person_of_each_tree())\n\n\t \t\t\t \t \t\t\t \t \t\t \t\t \t\t\t", "n, m = map(int, input().split())\nc = list(map(int, input().split()))\n\nparent = [i for i in range(n)]\nrank = [0] * n\n\ndef find_set(v):\n if v == parent[v]:\n return v\n parent[v] = find_set(parent[v])\n return parent[v]\n\ndef union_sets(a, b):\n a = find_set(a)\n b = find_set(b)\n if a != b:\n if rank[a] < rank[b]:\n a, b = b, a\n parent[b] = a\n if rank[a] == rank[b]:\n rank[a] += 1\n\nfor _ in range(m):\n x, y = map(int, input().split())\n union_sets(x - 1, y - 1)\n\ncomponents = {}\nfor i in range(n):\n p = find_set(i)\n if p not in components:\n components[p] = c[i]\n else:\n components[p] = min(components[p], c[i])\n\nprint(sum(components.values()))\n\n\t \t\t \t\t \t\t \t \t \t\t \t\t\t\t\t", "import math\r\n\r\nn, m = map(int,input().split())\r\narr = list(map(int,input().split()))\r\nadj = [[] for i in range(n)]\r\nvisited = [False] * n\r\n\r\nfor i in range(m):\r\n u,v = map(int,input().split())\r\n u -=1\r\n v-=1\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\ndef dfs(s):\r\n stack = list()\r\n stack.append(s)\r\n c=math.inf\r\n while(stack):\r\n s =stack.pop()\r\n c = min(c, arr[s])\r\n if not visited[s]:\r\n visited[s]=True\r\n for u in adj[s]:\r\n if not visited[u]:\r\n stack.append(u)\r\n return c\r\n\r\nsum = 0\r\nfor i in range(n):\r\n if not visited[i]:\r\n sum += dfs(i)\r\nprint(sum)", "from collections import deque\r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\nadj=[[] for i in range(n)]\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n adj[x-1].append(y-1)\r\n adj[y-1].append(x-1)\r\nvis=[0 for i in range(n)]\r\ncst=0\r\ndq=deque([])\r\nfor i in range(n):\r\n if vis[i]==0:\r\n mn=arr[i]\r\n vis[i]=1\r\n dq.append(i)\r\n while len(dq)>0:\r\n x=dq.popleft()\r\n mn=min(mn,arr[x])\r\n for j in adj[x]:\r\n if vis[j]==0:\r\n dq.append(j)\r\n vis[j]=1\r\n cst+=mn\r\nprint(cst)", "import sys\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\ndef maps():return [int(i) for i in input().split()]\r\n\r\nfrom collections import defaultdict\r\n\r\ndef find(x):\r\n\txcopy = x\r\n\r\n\twhile x != par[x]:\r\n\t\tx = par[x]\r\n\r\n\twhile xcopy != x:\r\n\t\txcopy , par[xcopy] = par[xcopy] , x\r\n\r\n\treturn x\r\n\r\n\r\n\r\nn , k = maps()\r\na = [*maps()]\r\npar = list(range(n))\r\nc = a.copy()\r\nfor __ in range(k):\r\n\tx , y = maps()\r\n\tx-=1\r\n\ty-=1\r\n\t# x , y = find(x) , find(x)\r\n\tx , y = find(x) , find(y)\r\n\r\n\tif c[x] > c[y]:\r\n\t\tpar[x] = y\r\n\telse:\r\n\t\tpar[y] = x\r\nprint(sum(c[i] for i in range(n) if par[i] == i ))\r\n\r\n\r\n\r\n", "def BFS(predok):\r\n global g\r\n global used\r\n que=[]\r\n s=0\r\n que.append(predok)\r\n while len(que)-s>0:\r\n predok=que[s]\r\n used[predok]=True\r\n s=s+1\r\n for potomok in g[predok]:\r\n if not used[potomok]:\r\n que.append(potomok)\r\n\r\ndef BFS_coloring(predok, c):\r\n global g\r\n global components_in_graph\r\n que=[]\r\n s=0\r\n que.append(predok)\r\n while len(que)-s>0:\r\n predok=que[s]\r\n components_in_graph[predok]=c\r\n s=s+1\r\n for potomok in g[predok]:\r\n if components_in_graph[potomok]==0:\r\n que.append(potomok)\r\n\r\nn, m = map(int, input().split())\r\nprices=[0]\r\nprices.extend(list(map(int, input().split())))\r\ng=[[] for i in range(n+1)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\ncomponents_in_graph=[0 for i in range(n+1)]\r\nc=1\r\nfor i in range(1, n+1):\r\n if components_in_graph[i]==0:\r\n BFS_coloring(i, c)\r\n c=c+1\r\ncomponents={}\r\nfor i in range(1, n+1):\r\n if components_in_graph[i] not in components.keys():\r\n components[components_in_graph[i]]=[]\r\n components[components_in_graph[i]].append(prices[i])\r\nsummary_price=0\r\nfor i in range(1, c):\r\n summary_price=summary_price+min(components[i])\r\nprint(summary_price)", "from collections import defaultdict\r\nfrom collections import deque\r\nimport sys\r\n# sys.setrecursionlimit(100100)\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\ngold = list(map(int, input().split()))\r\ngraph = defaultdict(list)\r\nfor _ in range(m):\r\n n1, n2 = map(int, input().split())\r\n graph[n1].append(n2)\r\n graph[n2].append(n1)\r\nvis = set()\r\n# def dfs(node, min_):\r\n# if node in vis: \r\n# return min_\r\n\r\n# vis.add(node)\r\n# res = min_\r\n# for ne in graph[node]:\r\n# min_ = min(min_, gold[ne-1])\r\n# res = dfs(ne, min_)\r\n# return min_\r\n\r\ndef bfs (node, min_):\r\n q = deque()\r\n q.append(node)\r\n while q:\r\n size = len(q)\r\n # min_ = float('inf')\r\n for _ in range(size):\r\n cur = q.popleft()\r\n # print(cur, q)\r\n vis.add(cur)\r\n min_ = min(min_, gold[cur-1])\r\n for ne in graph[cur]:\r\n if ne not in vis:\r\n q.append(ne)\r\n return min_\r\n\r\nans = 0\r\nfor i in range(1, n+1):\r\n if i not in vis:\r\n ans += bfs(i, gold[i-1])\r\nprint(ans)\r\n\r\n ", "n,m = map(int, input().split())\r\nprice = list(map(int, input().split()))\r\n\r\nvis = set({})\r\nlinks = [[] for i in range(n+1)]\r\nfor i in range(m):\r\n a,b = map(int, input().split())\r\n links[a].append(b)\r\n links[b].append(a)\r\n\r\nans = 0\r\nfor i in range(n):\r\n node = i+1\r\n stack = [node]\r\n p = price[node-1]\r\n if node not in vis:\r\n while stack:\r\n node = stack[-1]\r\n stack.pop(-1)\r\n for i in links[node]:\r\n if i not in vis:\r\n stack.append(i)\r\n vis.add(node)\r\n if price[node-1] < p:\r\n p = price[node-1]\r\n ans += p\r\n\r\nprint(ans)\r\n", "from collections import defaultdict\r\nfrom sys import stdin\r\ninput = stdin.buffer.readline\r\n\r\nn, m = map(int, input().split())\r\ng = defaultdict(list)\r\n\r\nc = [int(i) for i in input().split()]\r\nfor _ in range(m):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n\r\ndef connected_components(n, graph):\r\n components, visited = [], [False] * n\r\n\r\n def dfs(start):\r\n component, stack = [], [start]\r\n\r\n while stack:\r\n start = stack[-1]\r\n\r\n if visited[start]:\r\n stack.pop()\r\n continue\r\n else:\r\n visited[start] = True\r\n component.append(start)\r\n\r\n for i in graph[start]:\r\n if not visited[i]:\r\n stack.append(i)\r\n\r\n return component\r\n\r\n for i in range(n):\r\n if not visited[i]:\r\n components.append(dfs(i))\r\n\r\n return components\r\n\r\n\r\nres = connected_components(n+1, g)[1:]\r\nans = 0\r\nfor i in res:\r\n mc = 1 << 60\r\n for n in i:\r\n mc = min(mc, c[n-1])\r\n ans += mc\r\n\r\nprint(ans)\r\n", "n, pairs = list(map(int, input().split()))\r\n\r\nc = list(map(int, input().split()))\r\n\r\nc = [0] + [-i for i in c]\r\n\r\n\r\ndef par(i):\r\n if c[i] > 0:\r\n c[i] = par(c[i])\r\n return c[i]\r\n return i\r\n\r\n\r\ndef uni(a, b):\r\n para = par(a)\r\n parb = par(b)\r\n\r\n c[para] = max(c[para], c[parb])\r\n c[parb] = para\r\n\r\n\r\nfor i in range(pairs):\r\n a, b = list(map(int, input().split()))\r\n if par(a) != par(b):\r\n uni(a, b)\r\n\r\nprint(-sum(filter(lambda i: i < 0, c)))\r\n", "import sys\r\ninput=sys.stdin.readline\r\n\r\nclass queue:\r\n\tdef __init__(self,n):\r\n\t\tself.n=n\r\n\t\tself.q=[0 for i in range(n)]\r\n\t\tself.l=0\r\n\t\tself.r=n-1\r\n\t\tself.sz=0\r\n\tdef push(self,u):\r\n\t\tself.r=(self.r+1)%n\r\n\t\tself.q[self.r]=u\r\n\t\tself.sz+=1\r\n\tdef pop(self):\r\n\t\tself.l=(self.l+1)%n\r\n\t\tself.sz-=1\r\n\tdef front(self):\r\n\t\treturn self.q[self.l]\r\n\tdef empty(self):\r\n\t\treturn self.sz==0\r\n\tdef size(self):\r\n\t\treturn self.sz\r\n\tdef clear(self):\r\n\t\tself.l=0\r\n\t\tself.r=n-1\r\n\t\tself.sz=0\r\n\t\r\nn,m=map(int,input().split())\r\ncost=list(map(int,input().split()))\r\ng=[[]for i in range(n)]\r\nfor i in range(m):\r\n\tu,v=map(int,input().split())\r\n\tu-=1\r\n\tv-=1\r\n\tg[u].append(v)\r\n\tg[v].append(u)\r\n\t\r\ncolor=[0 for i in range(n)]\r\nans=0\r\nq=queue(n)\r\nfor i in range(n):\r\n\tif not color[i]:\r\n\t\tlst=[]\r\n\t\tq.clear()\r\n\t\tq.push(i)\r\n\t\tlst.append(cost[i])\r\n\t\twhile not q.empty():\r\n\t\t\tu=q.front()\r\n\t\t\tq.pop()\r\n\t\t\tfor v in g[u]:\r\n\t\t\t\tif not color[v]:\r\n\t\t\t\t\tcolor[v]=1\r\n\t\t\t\t\tlst.append(cost[v])\r\n\t\t\t\t\tq.push(v)\r\n\t\tans+=min(lst)\r\n\r\nprint(ans)\r\n", "from collections import defaultdict\r\nimport sys\r\ndef dfs(i,ans):\r\n stack=[]\r\n m=10**18\r\n stack.append(i)\r\n while stack:\r\n v=stack.pop()\r\n if visited[v]:\r\n continue\r\n visited[v]=True\r\n m=min(m,coin[v-1])\r\n for u in d[v]:\r\n if not visited[u]:\r\n stack.append(u)\r\n return m\r\ninput=sys.stdin.buffer.readline\r\nn,m=map(int,input().split())\r\ncoin=list(map(int,input().split()))\r\nd=defaultdict(list)\r\n\r\n\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n d[u].append(v)\r\n d[v].append(u)\r\nvisited=[False for i in range(n+1)]\r\nans=0\r\nfor i in range(1,n+1):\r\n if not visited[i]:\r\n ans+=dfs(i,ans)\r\nprint(ans)", "from collections import deque\r\nfrom typing import List, Tuple\r\n\r\ndef dfs(graph: List[List[int]], v: Tuple, visited: List[bool]) -> int:\r\n idx: int = v[0]\r\n bribe: int = v[1]\r\n\r\n visited[idx] = True\r\n\r\n for i in graph[idx]:\r\n if not visited[i]:\r\n #dfs(graph, (i, c[i-1]), visited)\r\n return min(bribe, dfs(graph, (i, c[i]), visited) )\r\n\r\n return bribe\r\n\r\ndef bfs(graph, start: Tuple[int, int], visited):\r\n queue = deque([start])\r\n\r\n min_bribe = 1000000001\r\n while queue:\r\n v = queue.popleft()\r\n\r\n idx = v[0]\r\n bribe = v[1]\r\n visited[idx] = True\r\n min_bribe = min(min_bribe, bribe)\r\n\r\n for character in graph[idx]:\r\n if not visited[character]:\r\n queue.append( (character, c[character]) )\r\n\r\n return min_bribe\r\n\r\n# n : the number of chracters in Overcity\r\n# m : the number of pairs of friends\r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split() ) )\r\n\r\n#graph: List[List[int]] = [ [] ] * (n+1)\r\ngraph: List[List[int]] = [ [] for i in range(n+1) ]\r\nfor i in range(m):\r\n n1, n2 = map(int, input().split() )\r\n graph[n1].append(n2)\r\n graph[n2].append(n1)\r\n\r\n\"\"\"\r\ncharacters: List[Tuple] = [] # (index, bribe)\r\nfor idx, bribe in enumerate(c):\r\n characters.append( (idx + 1, bribe) )\r\ncharacters.sort(key=lambda character: character[1]) # sort by bribe\r\n\"\"\"\r\n\r\nc.insert(0, 0)\r\nvisited = [False] * len(c)\r\nanswer: int = 0\r\nvisited[0] = True\r\nfor idx, bribe in enumerate(c):\r\n if not visited[idx]:\r\n #answer += dfs(graph, (idx, bribe), visited)\r\n answer += bfs(graph, (idx, bribe), visited)\r\n\r\nprint(answer)", "import sys\ninput = sys.stdin.readline\n\nN, M = map(int, input().split())\ncost = list(map(int, input().split()))\nvisited = [False] * N\nadj = [[] for _ in range(N)]\n\nfor i in range(M):\n a, b = map(int, input().split())\n a -= 1\n b -= 1\n adj[a].append(b)\n adj[b].append(a)\n\nanswer = 0\nfor i in range(N):\n if not visited[i]:\n curr_min = cost[i]\n stack = [i]\n while stack:\n node = stack.pop()\n if not visited[node]:\n visited[node] = True\n curr_min = min(curr_min, cost[node])\n stack.extend(adj[node])\n answer += curr_min\n\nprint(answer)\n \t \t \t\t \t\t \t\t \t\t\t \t \t \t", "import sys, math, cmath, time, collections\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\r\nfrom math import ceil, floor, log, log2, sqrt, gcd, factorial, pow, pi\r\nfrom bisect import bisect_left, bisect_right\r\n\r\n# BEGIN FASTIO\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\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\ndef print(*args, **kwargs):\r\n \"\"\"Prints the values to a stream, or to sys.stdout by default.\"\"\"\r\n sep, file = kwargs.pop(\"sep\", \" \"), kwargs.pop(\"file\", sys.stdout)\r\n at_start = True\r\n for x in args:\r\n if not at_start:\r\n file.write(sep)\r\n file.write(str(x))\r\n at_start = False\r\n file.write(kwargs.pop(\"end\", \"\\n\"))\r\n if kwargs.pop(\"flush\", False):\r\n file.flush()\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\nelse:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# END FASTIO\r\n\r\nstart_time = time.time()\r\n\r\ndef find_connected_components(g, n):\r\n components = []\r\n visited = [False] * n\r\n\r\n\r\n def dfs(start):\r\n component = []\r\n stack = [start]\r\n\r\n while stack:\r\n start = stack[-1]\r\n if visited[start]:\r\n stack.pop()\r\n continue\r\n else:\r\n visited[start] = True\r\n component.append(start)\r\n\r\n for i in g[start]:\r\n if not visited[i]:\r\n stack.append(i)\r\n return component\r\n\r\n for i in range(n):\r\n if not visited[i]:\r\n components.append(dfs(i))\r\n return components\r\n\r\ndef solve(g, n, cost):\r\n \"\"\"\r\n # Find connected components\r\n # for each component get the lowest cost\r\n # rest of them - just add the raw cost\r\n \"\"\"\r\n # print(f\"The I/P graph is: {g}\")\r\n components = find_connected_components(g,n)\r\n # print(f\"The components are: {components}\")\r\n\r\n total = 0\r\n\r\n for c in components:\r\n current_cost = float('inf')\r\n for k in c:\r\n if cost[k] < current_cost:\r\n current_cost = cost[k]\r\n total += current_cost\r\n\r\n print(total)\r\n\r\n\r\ndef main():\r\n \"\"\"\r\n Main function dedicated to get the I/P\r\n a, b = map(int, input().split())\r\n solve(a, b)\r\n \"\"\"\r\n n, m = map(int, input().split())\r\n cost = list(map(int, input().split()))\r\n g = defaultdict(list)\r\n\r\n for i in range(m):\r\n u,v = map(int, input().split())\r\n u = u-1\r\n v = v-1\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n solve(g, n, cost)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n LOCAL = False\r\n \r\n # If it's Local - Get I/P from file\r\n if LOCAL:\r\n sys.stdin = open(\"../io/data.in\", \"r\")\r\n sys.stdout = open(\"../io/data.out\", \"w\")\r\n\r\n testcases = 1\r\n for i in range(testcases):\r\n main()\r\n\r\n # If it's local - Print this O/P\r\n if LOCAL:\r\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\r\n sys.stdout.close()\r\n", "import collections\r\n\r\nif __name__ == '__main__':\r\n n, m = list(map(int, input().strip().split()))\r\n c = list(map(int, input().strip().split()))\r\n graph = collections.defaultdict(list)\r\n for i in range(m):\r\n a, b = list(map(int, input().strip().split()))\r\n graph[a].append(b); graph[b].append(a)\r\n vis = [0] * (n + 1)\r\n res = 0\r\n for i in range(1, n + 1):\r\n curCost = float(\"inf\")\r\n if vis[i] == 0:\r\n que = collections.deque([i])\r\n vis[i] = 1\r\n while que:\r\n curNode = que.popleft()\r\n curCost = min(curCost, c[curNode - 1])\r\n for nxtNode in graph[curNode]:\r\n if vis[nxtNode] == 0:\r\n que.append(nxtNode)\r\n vis[nxtNode] = 1\r\n res += curCost\r\n print(res)", "n,m = [int(x) for x in input().split(' ')]\ncosts = [int(x) for x in input().split(' ')]\nadj = [[] for i in range(n)]\nfor mi in range(m):\n\tn1, n2 = [int(x) for x in input().split(' ')]\n\tadj[n1-1].append(n2-1)\n\tadj[n2-1].append(n1-1)\n\nvisited = [False for i in range(n)]\n\nans = 0\nfor i in range(n):\n\tif visited[i]:\n\t\tcontinue\n\tdfsstack = []\n\tdfsstack.append(i)\n\ttempcost = float('inf')\n\twhile(len(dfsstack) > 0):\n\t\tele = dfsstack.pop()\n\t\ttempcost = min(tempcost, costs[ele])\n\t\tvisited[ele] = True\n\t\tfor nei in adj[ele]:\n\t\t\tif visited[nei]:\n\t\t\t\tcontinue\n\t\t\telse:\n\t\t\t\tdfsstack.append(nei)\n\tans += tempcost\nprint(ans)\n", "# Nó com menor preço em cada componente conexa\nfrom collections import deque\n\ndef bfs(no):\n cp = set()\n fila = deque()\n fila.append(no)\n minimo_cp = 1000000000\n while fila:\n prox = fila.popleft()\n if prox in cp:\n continue\n cp.add(prox)\n if reais[prox] < minimo_cp:\n minimo_cp = reais[prox]\n for adj in grafo[prox]:\n fila.append(adj)\n return cp, minimo_cp\n\nn, m = [int(a) for a in input().split()]\nreais = [int(a) for a in input().split()]\n\ngrafo = {i: set() for i in range(n)}\n\nfor i in range(m):\n x, y = [int(a) - 1 for a in input().split()]\n grafo[x].add(y)\n grafo[y].add(x)\n\nfalta = set(range(n))\nm = 0\nwhile falta:\n #print(\"F\", falta)\n prox = falta.pop()\n #print(\"P\", prox)\n cp, min_cp = bfs(prox)\n #print(\"CP\", cp)\n falta.difference_update(cp)\n #print(\"FD\", falta)\n m += min_cp\n #print(\"M\", m)\n\nprint(m)\n\n\t\t \t \t \t\t\t \t \t\t \t \t \t\t\t \t", "n, m = list(map(int, input().split()))\nls = list(map(int, input().split()))\nvisited = [0] * n\nfriends = {}\nfor i in range(m):\n a, b = list(map(int, input().split()))\n a -= 1\n b -= 1\n if a not in friends:\n friends[a] = [b]\n else:\n friends[a].append(b)\n if b not in friends:\n friends[b] = [a]\n else:\n friends[b].append(a)\n\nans = 0\nfor i in range(n):\n if visited[i]:\n continue\n mi = 1e99\n queue = [i]\n found = set()\n while queue:\n num = queue.pop()\n if num in found:\n continue\n mi = min(mi, ls[num])\n found.add(num)\n if num in friends:\n for x in friends[num]:\n queue.append(x)\n for x in found:\n visited[x] = 1\n ans += mi\nprint(ans)\n \n", "import sys\r\ndef dfs(node,s,l):\r\n visited[node]=True\r\n stack=[node]\r\n while stack:\r\n a=stack.pop()\r\n s=min(s,l[a-1])\r\n for child in graph[a]:\r\n if visited[child]==False:\r\n s=min(s,l[child-1])\r\n stack.append(child)\r\n visited[child]=True\r\n return s\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\ngraph={}\r\nfor i in range(1,n+1):\r\n graph[i]=[]\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\nvisited=[False for i in range(n+1)]\r\ns=sys.maxsize\r\nans=0\r\nfor i in range(1,n+1):\r\n if visited[i]==False:\r\n ans=ans+dfs(i,s,l)\r\nprint(ans)\r\n \r\n \r\n", "n,m=list(map(int,input().strip().split()))\r\nc=list(map(int,input().strip().split()))\r\nq=[[]for i in range(n)]\r\nfor i in range(m):\r\n x,y=list(map(int,input().strip().split()))\r\n x-=1\r\n y-=1\r\n q[x].append(y)\r\n q[y].append(x)\r\nvisited=[0 for i in range(n)]\r\ndef bfs(v):\r\n visited[v]=1\r\n mn=10**10\r\n s=[v]\r\n while s:\r\n u=s[0]\r\n del s[0]\r\n mn=min(mn,c[u])\r\n for i in q[u]:\r\n if visited[i]==0:\r\n visited[i]=1\r\n s.append(i)\r\n return mn\r\nans=0\r\nfor i in range(n):\r\n if visited[i]==0:\r\n ans+=bfs(i)\r\nprint(ans)", "from collections import deque\n\n\nn, m = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\ngraph = {}\n\nfor i in range(n):\n graph[i] = []\n\nfor _ in range(m):\n x, y = list(map(int, input().split()))\n graph[x-1].append(y-1)\n graph[y-1].append(x-1)\n\nvisited = [False] * n\nq = deque()\nret = 0\n\nfor i in range(n):\n if visited[i]:\n continue\n visited[i] = True\n minVal = c[i]\n q.append(i)\n while q:\n r = q.popleft()\n minVal = min(minVal, c[r])\n for n in graph[r]:\n if visited[n]:\n continue\n q.append(n)\n visited[n] = True\n ret += minVal\n\nprint(ret)\n \n\n \t \t \t \t \t\t \t\t\t \t\t \t\t", "def findMinCost(idx):\r\n if idx in visited:\r\n return 0\r\n\r\n cost = gold[idx-1]\r\n stack = [idx]\r\n while stack:\r\n cur = stack.pop()\r\n visited.add(cur)\r\n for neighbor in adj[cur]:\r\n if neighbor not in visited:\r\n cost = min(cost, gold[neighbor-1]) \r\n stack.append(neighbor)\r\n return cost\r\n \r\nn, m = map(int, input().split())\r\ngold = list(map(int, input().split()))\r\n\r\nadj = {}\r\nfor i in range(1,n+1):\r\n adj[i] = []\r\n\r\nfor i in range(m):\r\n a,b = map(int, input().split())\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\nvisited = set()\r\nmin_cost = 0\r\nfor i in range(1,n+1):\r\n if len(adj[i]) > 0:\r\n min_cost += findMinCost(i)\r\n else:\r\n min_cost += gold[i-1]\r\n\r\nprint(min_cost)", "from collections import defaultdict\n\nn, mn = map(int, input().split())\narr = [0]+list(map(int, input().split()))\n\nm = defaultdict(list)\n\nfor i in range(mn):\n u, v = map(int, input().split())\n m[u].append(v)\n m[v].append(u)\n\nans = 0\nvisited = [0]*(n+1)\n\nfor i in range(1, n+1):\n if not visited[i]:\n stack = [i]\n tans = arr[i]\n visited[i] = 1\n while stack:\n v = stack.pop()\n tans = min(tans, arr[v])\n for node in m[v]:\n if not visited[node]:\n visited[node] = 1\n stack.append(node)\n ans += tans\n\nprint(ans)\n \t \t \t\t \t\t\t\t\t \t \t", "import sys\r\nfrom collections import defaultdict,deque\r\n\r\nn,m=map(int,input().split())\r\ncost=list(map(int,input().split()))\r\ngraph=defaultdict(list)\r\nvis=[0]*n\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n a-=1\r\n b-=1\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nans=0\r\nfor j in range(n):\r\n l=1000000000\r\n if vis[j]==0:\r\n d=deque([j])\r\n nl=1\r\n while(nl>0):\r\n ver=d.pop()\r\n vis[ver]=1\r\n l=min(l,cost[ver])\r\n nl-=1\r\n for i in graph[ver]:\r\n if vis[i]==0:\r\n d.append(i)\r\n nl+=1\r\n ans+=l\r\nprint(ans) \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "def get() :\r\n return list(map(int,input().split()))\r\ndef dfs(i) :\r\n v,q = c[i],[i]\r\n while q:\r\n j = q.pop() ; b[j] = 1 ; v = min(v,c[j])\r\n for k in a[j]:\r\n if b[k] == 0 : q.append(k)\r\n return v \r\nn,m = get() ; c = get() ; a = [list() for _ in range(n)]\r\nfor _ in range(m): \r\n x,y = get() ; a[x-1].append(y-1) ; a[y-1].append(x-1)\r\nb = [0]*n ; ans = 0\r\nfor i in range(n) :\r\n if b[i] == 0 : ans += dfs(i)\r\nprint(ans)", "from collections import deque as dq\n\nn, m = map(int, input().split())\na = list(map(int, input().split()))\n\ng = [[] for i in range(n)]\n\nfor i in range(m):\n x, y = map(int, input().split())\n g[x-1].append(y-1)\n g[y-1].append(x-1)\n\nd = dq()\ntag = [False for i in range(n)]\nsol = []\n\nfor i in range(n):\n ans = 0\n if tag[i] == False:\n d.append(i)\n tag[i] = True\n ans = a[i]\n\n while len(d) > 0:\n pos = d.popleft()\n for j in g[pos]:\n if not tag[j]:\n d.append(j)\n tag[j] = True\n ans = min(ans, a[j])\n\n if ans > 0:\n sol.append(ans)\n\nprint(sum(sol))\n", "from collections import defaultdict as d\r\ndef solve():\r\n n, m = map(int, input().split())\r\n ll = list(map(int, input().split()))\r\n graph = d(list)\r\n visited = [False] * n\r\n for i in range(m):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n ans = 0\r\n for i in graph.keys():\r\n if not visited[i]:\r\n sasta = ll[i]\r\n q = [i]\r\n while len(q):\r\n # print(\"phasa\")\r\n # print(q)\r\n top = q[0]\r\n q.pop(0)\r\n visited[top] = True\r\n sasta = min(sasta, ll[top])\r\n for edges in graph[top]:\r\n if not visited[edges]:\r\n q.append(edges)\r\n ans += sasta\r\n for i in range(n):\r\n if not visited[i]:\r\n ans += ll[i]\r\n return ans\r\n\r\nt = 1\r\nwhile t != 0:\r\n res = solve()\r\n print(res)\r\n t -= 1\r\n", "n, m = list(map(int, input().split()))\r\n\r\ngoald = list(map(int, input().split()))\r\n\r\ngraph = [[] for i in range(n)\r\n ]\r\nfor _ in range(m):\r\n a, b = list(map(int, input().split()))\r\n a, b = a - 1, b - 1\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\nvisite = set()\r\nres = 0\r\nfor i in range(n):\r\n if i not in visite:\r\n ans = goald[i]\r\n visite.add(i)\r\n stack = [i]\r\n while stack:\r\n vertex = stack.pop()\r\n ans = min(ans, goald[vertex])\r\n\r\n for adjvertex in graph[vertex]:\r\n if adjvertex not in visite:\r\n stack.append(adjvertex)\r\n visite.add(adjvertex)\r\n res += ans\r\n\r\nprint(res)\r\n", "def find(x, p):\r\n while p[x] != x:\r\n x = p[x]\r\n return x\r\n\r\ndef unite(a, b, p, c, g):\r\n ar = find(a, p)\r\n br = find(b, p)\r\n if c[ar] < c[br]:\r\n p[ar] = br\r\n else:\r\n p[br] = ar\r\n if c[ar] == c[br]:\r\n c[ar] += 1\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n g = [0] + list(map(int, input().split()))\r\n p = list(range(n + 1))\r\n c = [1] * (n + 1)\r\n r = 0\r\n\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n unite(x, y, p, c, g)\r\n\r\n for i in range(1, n + 1):\r\n j = find(i, p)\r\n if j != i:\r\n g[j] = min(g[j], g[i])\r\n\r\n for i in range(1, n + 1):\r\n if p[i] == i:\r\n r += g[i]\r\n\r\n print(r)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ninput = lambda :sys.stdin.readline().rstrip('\\r\\n')\r\nip = [line for line in sys.stdin.read().split('\\n')];it = 0\r\nn,m = map(int,ip[it].split());it+=1\r\ncost = [int(x) for x in ip[it].split()];it+=1\r\ng = [[] for _ in range(n)]\r\nvis = [False]*(n)\r\ndef dfs(src):\r\n st = [src]\r\n ct = float('inf')\r\n while st:\r\n node = st.pop()\r\n vis[node]=True\r\n ct = min(ct,cost[node])\r\n for nbr in g[node]:\r\n if not vis[nbr]:\r\n st.append(nbr)\r\n return ct\r\nfor _ in range(m):\r\n u,v = map(int,ip[it].split());it+=1\r\n u-=1\r\n v-=1\r\n g[u].append(v)\r\n g[v].append(u)\r\nans = 0\r\nfor i in range(n):\r\n if not vis[i]:\r\n ans += dfs(i)\r\nprint(ans)", "import sys, math, itertools, functools, collections\r\ninput = sys.stdin.readline\r\n#sys.setrecursionlimit(10**6)\r\n# UnionFind class\r\nclass UnionFind:\r\n def __init__(self, size):\r\n self.root = [i for i in range(size)]\r\n # Use a rank array to record the height of each vertex, i.e., the \"rank\" of each vertex.\r\n # The initial \"rank\" of each vertex is 1, because each of them is\r\n # a standalone vertex with no connection to other vertices.\r\n self.rank = [1] * size\r\n\r\n # The find function here is the same as that in the disjoint set with path compression.\r\n def find(self, x):\r\n if x == self.root[x]:\r\n return x\r\n self.root[x] = self.find(self.root[x])\r\n return self.root[x]\r\n\r\n # The union function with union by rank\r\n def union(self, x, y):\r\n rootX = self.find(x)\r\n rootY = self.find(y)\r\n if rootX != rootY:\r\n if self.rank[rootX] > self.rank[rootY]:\r\n self.root[rootY] = rootX\r\n elif self.rank[rootX] < self.rank[rootY]:\r\n self.root[rootX] = rootY\r\n else:\r\n self.root[rootY] = rootX\r\n self.rank[rootX] += 1\r\n\r\n def connected(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\nrs = lambda: input().strip()\r\nri = lambda: int(input())\r\nrmi = lambda: map(int, input().split())\r\nra = lambda: [int(x) for x in input().split()]\r\npa = lambda x: print (\" \".join(map(str, x)))\r\n\r\ntest_case = 1\r\n\r\n#-------- DIFFERENT WAYS TO UNSTUCK ------------ \r\n# 1. Frequency/Value domain and Pigeon Hole Principle \r\n# 2. Search from end to start instead of start to end\r\n# 3. Prefix Suffix\r\n# 4. Brute force if small input size\r\n\r\ndef solve():\r\n freq = collections.defaultdict(list)\r\n for i in range(n):\r\n freq[uf.find(i)].append(costs[i])\r\n ans = 0\r\n for v in freq.values():\r\n ans += min(v)\r\n return ans\r\n pass\r\n\r\nfor _ in range(test_case):\r\n n, m = rmi()\r\n costs = ra()\r\n graph = [[]*n for _ in range(n)]\r\n uf = UnionFind(n)\r\n for _ in range(m):\r\n u, v = rmi()\r\n u -= 1\r\n v -= 1\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n uf.union(u,v)\r\n\r\n print(solve())", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef test_case():\r\n n, m = map(int, input().split())\r\n c = [-1] + list(map(int, input().split()))\r\n g = [[] for _ in range(n+1)]\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n def connected_components(n, graph):\r\n components, visited = [], [False] * n\r\n\r\n def dfs(start):\r\n component, stack = [], [start]\r\n\r\n while stack:\r\n start = stack[-1]\r\n\r\n if visited[start]:\r\n stack.pop()\r\n continue\r\n else:\r\n visited[start] = True\r\n component.append(start)\r\n\r\n for i in graph[start]:\r\n if not visited[i]:\r\n stack.append(i)\r\n\r\n return component\r\n\r\n for i in range(n):\r\n if not visited[i]:\r\n components.append(dfs(i))\r\n\r\n return components\r\n\r\n cc = connected_components(n+1, g)\r\n ans = 0\r\n for x in cc[1:]:\r\n y = float(\"inf\")\r\n for v in x:\r\n y = min(y, c[v])\r\n ans += y\r\n print(ans)\r\n\r\n\r\ndef main():\r\n t = 1\r\n# t = int(input())\r\n for _ in range(t):\r\n test_case()\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import defaultdict\nfrom collections import deque\nfrom typing import Set\n\ngraph = defaultdict(list)\nn, m = [int(s) for s in input().split(\" \")]\ncosts = [int(s) for s in input().split(\" \")]\n\nfor _ in range(m):\n x, y = [int(s) for s in input().split(\" \")]\n graph[x - 1].append(y - 1)\n graph[y - 1].append(x - 1)\n\nseen = set()\nconnected_components = []\n\ndef bfs(node: int) -> Set[int]:\n components = set()\n\n if node in seen:\n return\n\n queue = deque()\n queue.append(node)\n seen.add(node)\n\n while queue:\n node = queue.popleft()\n components.add(node)\n\n for adj_node in graph[node]:\n if adj_node not in seen:\n seen.add(adj_node)\n queue.append(adj_node)\n return components\n\nfor x in range(n):\n result = bfs(x)\n if result:\n connected_components.append(result)\n\ntotal_cost = 0\nfor connected_component in connected_components:\n min_cost_for_component = float(\"inf\")\n for node in connected_component:\n min_cost_for_component = min(costs[node], min_cost_for_component)\n total_cost += min_cost_for_component\nprint(total_cost)", "queue = []\r\nlarge_queue = []\r\ncount = -1\r\ndef bfs(visited, friends, node):\r\n global count\r\n visited[node] = True\r\n queue.append(node)\r\n large_queue.append([])\r\n count += 1\r\n while queue:\r\n s = queue.pop(0)\r\n large_queue[count].append(s)\r\n try:\r\n for i in friends[s]:\r\n if not visited[i]:\r\n visited[i] = True\r\n queue.append(i)\r\n except:\r\n pass\r\n return large_queue[count]\r\nn,m = map(int,input().split(' '))\r\ncosts = input().split()\r\nfriends = [[] for i in range(n)]\r\nvisited = [False] * n\r\ncost = 0\r\nfor i in range(m):\r\n x,y = map(int,input().split(' '))\r\n friends[x-1].append(y-1)\r\n friends[y-1].append(x-1)\r\n\r\nfor i in range(n):\r\n if not visited[i]:\r\n value = bfs(visited,friends,i)\r\n cost += min([int(costs[j]) for j in value])\r\n\r\nprint(cost)", "friends, edges = [int(string_num) for string_num in input().split(' ')]\nheard_rumor = [False for _ in range(friends)]\nfriend_list = [set() for _ in range(friends)]\ncosts = [int(string_num) for string_num in input().split(' ')]\nfor i in range(edges):\n friend1, friend2 = [int(string_num) - 1 for string_num in input().split(' ')]\n friend_list[friend1].add(friend2)\n friend_list[friend2].add(friend1)\ntotal_cost = 0\nfor i in range(friends):\n if heard_rumor[i]:\n continue\n # bfs\n min_cost = 10 ** 10\n q = [i]\n visited = set()\n while len(q) != 0:\n curr = q.pop()\n if curr in visited:\n continue\n visited.add(curr)\n heard_rumor[curr] = True\n if costs[curr] < min_cost:\n min_cost = costs[curr]\n q += friend_list[curr]\n # print(f'friend_list[{i}] = {friend_list[i]}')\n\n total_cost += min_cost\nprint(total_cost)\n \t\t \t \t \t \t \t \t \t\t\t \t \t\t \t", "# cook your dish here\r\nimport sys\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nsys.setrecursionlimit(10**6)\r\nn,m=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=defaultdict(list)\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n d[x].append(y)\r\n d[y].append(x)\r\nans=0\r\nvisited=[0]*(n+1)\r\nfor i in range(1,n+1):\r\n if visited[i]==0:\r\n q=deque()\r\n q.append(i)\r\n m=10**(9)\r\n visited[i]=1\r\n while len(q):\r\n x=q.popleft()\r\n m=min(m,c[x-1])\r\n for j in d[x]:\r\n if visited[j]==0:\r\n visited[j]=1\r\n q.append(j)\r\n ans=ans+m\r\nprint(ans)", "def find(i):\r\n while p[i] != i:\r\n p[i] = p[p[i]]\r\n i = p[i]\r\n return i\r\n \r\nn, m = map(int, input().split())\r\nc = list(map(int, input().split()))\r\np = [i for i in range(n)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n a = find(a)\r\n b = find(b)\r\n if c[a] < c[b]:\r\n a, b = b, a\r\n p[a] = b\r\n \r\nans = sum([c[i] for i in range(n) if p[i] == i])\r\nprint(ans)\n# Sun Jul 10 2022 08:07:22 GMT+0000 (Coordinated Universal Time)\n", "# funtion of bfs\ndef dfs(index, visited, neighbours, cost):\n\n stack = [index]\n min = cost[index]\n\n while len(stack) > 0:\n u = stack.pop()\n\n if visited[u] == 0:\n if cost[u] < min:\n min = cost[u]\n\n visited[u] = 1\n\n for i in neighbours[u]:\n if visited[i] == 0:\n stack.append(i)\n\n return min\n\n\nn, m = input().split()\nn = int(n)\nm = int(m)\n\ncost_str = list(input().split())\ncost = [0]\n\nneighbours = [[]]\nvisited = [0]\n\nfor i in range(n):\n cost.append(int(cost_str[i]))\n\nfor i in range(n):\n neighbours.append([])\n visited.append(0)\n\nfor i in range(m):\n a, b = input().split()\n a = int(a)\n b = int(b)\n neighbours[a].append(b)\n neighbours[b].append(a)\n\nans = 0\n\nfor i in range(1, n+1):\n if visited[i] == 0:\n ans += dfs(i, visited, neighbours, cost)\nprint(ans)\n\n \t \t\t \t\t \t\t \t\t \t\t\t \t \t\t\t", "from collections import defaultdict\r\n\r\nn,m = list(map(int,input().split()))\r\narr = list(map(int,input().split()))\r\n \r\nparent = [i for i in range(n+1)]\r\nrank = [0]*(n+1)\r\n\r\ndef find(p):\r\n while p != parent[p]:\r\n p = parent[p]\r\n return p\r\n\r\ndef union(x, y):\r\n x = find(x)\r\n y = find(y)\r\n if x!=y:\r\n if rank[x] > rank[y]:\r\n parent[y] = x\r\n elif rank[y] > rank[x]:\r\n parent[x] = y\r\n else:\r\n parent[y] = x\r\n rank[x] += 1\r\n \r\nfor _ in range(m):\r\n a,b = list(map(int,input().split()))\r\n union(a,b)\r\n \r\nfor i in range(1,len(parent)):\r\n parent[i] = find(parent[i])\r\n \r\ngold = 0\r\ncollect = defaultdict(list)\r\nfor i in range(1,len(parent)):\r\n collect[parent[i]].append(i)\r\n\r\nfor v in collect.values():\r\n mn = 10**9\r\n for c in v:\r\n mn = min(mn,arr[c-1])\r\n gold += mn\r\n \r\nprint(gold)", "import collections\r\n\r\nn, m = list(map(int, input().split()))\r\nnums = list(map(int, input().split()))\r\n\r\nINF = 10 ** 9 + 13\r\n\r\narr = []\r\n\r\nfor index in range(n):\r\n arr.append([])\r\n \r\nfor index in range(m):\r\n v, u = list(map(int, input().split()))\r\n \r\n v -= 1\r\n u -= 1\r\n \r\n arr[v].append(u)\r\n arr[u].append(v)\r\n \r\nused = [False] * n\r\nres = INF\r\n\r\ndef dfs(v):\r\n global arr, used, res\r\n used[v] = True\r\n res = min(res,nums[v])\r\n \r\n for u in arr[v]:\r\n if not used[u]:\r\n dfs(u)\r\n \r\ndef bfs(v):\r\n global arr, used, res\r\n q = collections.deque([v])\r\n used[v] = True\r\n while q:\r\n u = q.pop()\r\n\r\n res = min(res, nums[u])\r\n \r\n for w in arr[u]:\r\n if not used[w]:\r\n q.append(w)\r\n used[w] = True\r\n \r\nans = 0\r\n\r\nfor index in range(n):\r\n if not used[index]:\r\n res = INF\r\n bfs(index)\r\n ans += res\r\n \r\nprint(ans)", "from collections import deque\r\n\r\nn, m=map(int, input().split())\r\ngold=[0]+list(map(int, input().split()))\r\nadjacency_list={i: [] for i in range(1, n+1)}\r\nfor i in range(m):\r\n l, r=map(int, input().split())\r\n adjacency_list[l].append(r)\r\n adjacency_list[r].append(l)\r\n\r\nmarks=[0 for i in range(n+1)]\r\nconnected_components={}\r\n\r\ndef bfs(curr, marker):\r\n marks[curr]=marker\r\n connected_components[marker]=min(connected_components[marker], gold[curr])\r\n q=deque([curr])\r\n while len(q)!=0:\r\n front=q.pop()\r\n for i in adjacency_list[front]:\r\n if marks[i]==0:\r\n marks[i]=marker\r\n connected_components[marker]=min(connected_components[marker], gold[i])\r\n q.append(i)\r\n \r\n\r\nmarker=1\r\nfor i in range(1, n+1):\r\n if marks[i]==0:\r\n connected_components[marker]=float('inf')\r\n bfs(i, marker)\r\n marker+=1\r\nans=0\r\nfor i in connected_components:\r\n ans+=connected_components[i]\r\nprint(ans)", "import math\r\nfrom collections import defaultdict\r\ninl = lambda: list(map(int, input().split()))\r\n\r\nn, m = inl()\r\nc = inl()\r\ng = defaultdict(list)\r\np = 0\r\n\r\n\r\nfor _ in range(m):\r\n x, y = inl()\r\n g[x].append(y)\r\n g[y].append(x)\r\n\r\nt = set(range(1, n + 1))\r\nwhile t:\r\n e = next(iter(t))\r\n f = [e]\r\n v = math.inf\r\n while f:\r\n s = f.pop()\r\n if s in t:\r\n t.remove(s)\r\n v = min(v, c[s - 1])\r\n for k in g[s]:\r\n if k in t:\r\n f.append(k)\r\n p += v\r\nprint(p)\r\n", "import sys, threading\r\n\r\n\r\ndef main1():\r\n n, m = map(int, input().split())\r\n cost = list(map(int, input().split()))\r\n pairs = {}\r\n\r\n def addValueToDict(key, value):\r\n if key in pairs:\r\n pairs[key].append(value)\r\n else:\r\n l = list()\r\n l.append(value)\r\n pairs[key] = l\r\n\r\n for i in range(m):\r\n line3 = input().split(' ')\r\n key = int(line3[0]) - 1\r\n value = int(line3[1]) - 1\r\n\r\n addValueToDict(key, value)\r\n addValueToDict(value, key)\r\n\r\n # print(pairs)\r\n\r\n trackArr = [0] * n\r\n\r\n def minCost(key):\r\n costVal = 0\r\n\r\n if trackArr[key] == 0:\r\n trackArr[key] = 1\r\n costVal = cost[key]\r\n\r\n if key in pairs:\r\n for val in pairs[key]:\r\n if trackArr[val] == 0:\r\n childCost = minCost(val)\r\n if childCost < costVal:\r\n costVal = childCost\r\n\r\n return costVal\r\n\r\n totalCost = 0\r\n\r\n for i in range(n):\r\n if trackArr[i] == 0:\r\n totalCost += minCost(i)\r\n\r\n print(totalCost)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n sys.setrecursionlimit(9100000)\r\n\r\n threading.stack_size(134217728)\r\n\r\n main_thread = threading.Thread(target=main1)\r\n main_thread.start()\r\n main_thread.join()\r\n\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = defaultdict(list)\r\nfor i in range(m):\r\n q, w = map(int, input().split())\r\n d[q-1].append(w-1)\r\n d[w-1].append(q-1)\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(0)\r\n\r\nfinal = []\r\nfor i in range(n):\r\n if l[i] == 0:\r\n temp1 = [i]\r\n temp2 = [i]\r\n l[i] = 1\r\n while temp2:\r\n g = temp2[-1]\r\n temp2.pop()\r\n for j in d[g]:\r\n if l[j] == 0:\r\n l[j] = 1\r\n temp2.append(j)\r\n temp1.append(j)\r\n final.append(temp1)\r\n# print(final)\r\nb = 0\r\nfor i in final:\r\n tmp = sys.maxsize\r\n for j in i:\r\n tmp = min(tmp, a[j])\r\n b += tmp\r\nprint(b)\r\n", "from collections import deque\r\nimport sys\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline().strip())\r\n\r\ndef get_ints():\r\n return map(int,sys.stdin.readline().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int,sys.stdin.readline().strip().split()))\r\n\r\ndef get_string():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\n\r\n\r\nn,m = get_ints()\r\nc = get_list()\r\n\r\nvisited = [False]*n\r\nadj = [[] for _ in range(n)]\r\n\r\nfor i in range(m):\r\n x,y = get_ints()\r\n x-=1\r\n y-=1\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n\r\nq = deque()\r\ntotalCost = 0\r\n\r\nfor i in range(n):\r\n if visited[i]:\r\n continue\r\n visited[i] = True\r\n minCost = c[i]\r\n q.append(i)\r\n\r\n while q:\r\n node = q.pop()\r\n for u in adj[node]:\r\n if visited[u]:\r\n continue\r\n\r\n minCost = min(minCost,c[u])\r\n visited[u] = True\r\n q.append(u)\r\n totalCost+=minCost\r\n\r\nprint(totalCost)\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\n \r\nn, k = [int(ak) for ak in input().split()]\r\narr = [int(cc) for cc in input().split()]\r\n\r\nadj = [[] for i in range(n)]\r\nvisited = [False] * n\r\n \r\nfor i in range(k):\r\n u,v = map(int,input().split())\r\n adj[u-1].append(v-1)\r\n adj[v-1].append(u-1)\r\n \r\ndef dfs(s):\r\n stack = []\r\n stack.append(s)\r\n inf=math.inf\r\n while(stack):\r\n s =stack.pop()\r\n inf = min(inf, arr[s])\r\n if not visited[s]:\r\n visited[s]=True\r\n for u in adj[s]:\r\n if not visited[u]:\r\n stack.append(u)\r\n return inf\r\n \r\ncounter = 0\r\nfor i in range(n):\r\n if not visited[i]:\r\n counter += dfs(i)\r\nprint(counter)\r\n", "n,m=map(int, input().split())\r\ngold=list(map(int, input().split()))\r\ngraph=[[] for i in range(n)]\r\nfor _ in range(m):\r\n a,b=map(int, input().split())\r\n a-=1\r\n b-=1\r\n graph[a].append(b)\r\n graph[b].append(a)\r\nvisite=set()\r\nans=0\r\nfor i in range(n):\r\n if i not in visite:\r\n res=gold[i]\r\n visite.add(i)\r\n stack=[i]\r\n while stack:\r\n v=stack.pop()\r\n res=min(res,gold[v])\r\n for x in graph[v]:\r\n if x not in visite:\r\n stack.append(x)\r\n visite.add(x)\r\n ans+=res\r\nprint(ans)\r\n\n# Mon Jul 10 2023 14:17:14 GMT+0300 (Moscow Standard Time)\n", "def dfs(n):\r\n v = listy[i]\r\n q = [i]\r\n while q :\r\n j = q.pop()\r\n vis[j]=1\r\n v = min(v,listy[j])\r\n for e in edges[j] :\r\n if not vis[e] :\r\n q.append(e)\r\n return v \r\nfrom collections import deque\r\n\r\n\r\ndef bfs(cur):\r\n q , res = deque([cur]),float('inf')\r\n while(q):\r\n cur =q.popleft()\r\n res = min(res,listy[cur])\r\n for nn in edges[cur]:\r\n if ( nn not in added):\r\n added.add(nn)\r\n q.append(nn)\r\n return res\r\nn,m= map(int,input().split())\r\nlisty=list(map(int,input().split()))\r\n\r\nedges= [[]for i in range(n)]\r\n\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n u=u-1\r\n v=v-1\r\n edges[u].append(v)\r\n edges[v].append(u)\r\nc=[0]*(100001) #dfs\r\nadded = set() #bfs\r\nvis = [False]*(n) #dfs\r\n\r\nans =0\r\nfor cur in range(n):\r\n if(cur not in added):\r\n added.add(cur)\r\n # ans+=bfs(cur)\r\n \r\nfor i in range(n):\r\n if(not vis[i]) :\r\n ans += dfs(i)\r\nprint(ans) ", "import sys\r\n\r\n\r\ndef iinp():\r\n return int(sys.stdin.readline().strip())\r\n\r\n\r\ndef linp():\r\n return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef lsinp():\r\n return sys.stdin.readline().strip().split()\r\n\r\n\r\ndef digit():\r\n return [int(i) for i in (list(sys.stdin.readline().strip()))]\r\n\r\n\r\ndef char():\r\n return list(sys.stdin.readline().strip())\r\n\r\n\r\nfrom collections import Counter, defaultdict\r\n\r\n\r\nclass Uf:\r\n def __init__(self, size):\r\n self.root = [i for i in range(size)]\r\n self.size = [1] * size\r\n\r\n def find(self, x):\r\n if x == self.root[x]:\r\n return x\r\n self.root[x] = self.find(self.root[x])\r\n return self.root[x]\r\n\r\n def union(self, x, y):\r\n rootX = self.find(x)\r\n rootY = self.find(y)\r\n if rootX != rootY:\r\n if self.size[rootX] > self.size[rootY]:\r\n self.root[rootY] = rootX\r\n self.size[rootX] += self.size[rootY]\r\n else:\r\n self.root[rootX] = rootY\r\n self.size[rootY] += self.size[rootX]\r\n\r\n\r\ndef solve():\r\n n, m = linp()\r\n c = linp()\r\n # temp = set()\r\n u = Uf(n + 3)\r\n for i in range(m):\r\n x, y = linp()\r\n u.union(x, y)\r\n # temp.add(x)\r\n # temp.add(y)\r\n cost = defaultdict(lambda: 10**9 + 2)\r\n for i in range(1, n + 1):\r\n ind = u.find(i)\r\n cost[ind] = min(cost[ind], c[i - 1])\r\n print(sum(cost.values()))\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "#!/usr/bin/env python3\r\n\r\nimport sys\r\nfrom collections import deque\r\n\r\ninput = iter(sys.stdin.read().splitlines()).__next__\r\n\r\ndef bfs(graph, visited, src):\r\n Q = deque()\r\n Q.append(src)\r\n visited[src] = True\r\n component = []\r\n while len(Q) > 0:\r\n u = Q.popleft()\r\n component.append(u)\r\n for v in graph[u]:\r\n if not visited[v]:\r\n Q.append(v)\r\n visited[v] = True\r\n return component\r\n\r\n\r\nN, M = map(int, input().split())\r\ncost = list(map(int, input().split()))\r\n\r\ngraph = [ [] for u in range(N) ]\r\nfor m in range(M):\r\n u, v = map(int, input().split())\r\n u -= 1\r\n v -= 1\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nvisited = [ False ] * N\r\nres = 0\r\nfor u in range(N):\r\n if not visited[u]:\r\n component = bfs(graph, visited, u)\r\n res += min( (cost[v] for v in component) )\r\n\r\nprint(res)\r\n", "from collections import deque\r\n\r\n\r\ndef BFS(start):\r\n q = deque()\r\n q.append(start)\r\n while q:\r\n u = q.popleft()\r\n cur.append(people[u-1])\r\n visited[u] = True\r\n for v in graph[u]:\r\n if not visited[v]:\r\n visited[v] = True\r\n q.append(v)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n people = list(map(int, input().split()))\r\n graph = [[] for _ in range(n+1)]\r\n visited = [False for _ in range(n+1)]\r\n res = 0\r\n\r\n for _ in range(m):\r\n u, v = map(int, input().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\n for i in range(1, n+1):\r\n cur = []\r\n if not visited[i]:\r\n BFS(i)\r\n res += min(cur) if len(cur) > 0 else 0\r\n\r\n print(res)", "import sys, math, cmath, time, collections\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\r\nfrom math import ceil, floor, log, log2, sqrt, gcd, factorial, pow, pi\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nstart_time = time.time()\r\n\r\ndef find_connected_components(g, n):\r\n components = []\r\n visited = [False] * n\r\n\r\n\r\n def dfs(start):\r\n component = []\r\n stack = [start]\r\n\r\n while stack:\r\n start = stack[-1]\r\n if visited[start]:\r\n stack.pop()\r\n continue\r\n else:\r\n visited[start] = True\r\n component.append(start)\r\n\r\n for i in g[start]:\r\n if not visited[i]:\r\n stack.append(i)\r\n return component\r\n\r\n for i in range(n):\r\n if not visited[i]:\r\n components.append(dfs(i))\r\n return components\r\n\r\ndef solve(g, n, cost):\r\n \"\"\"\r\n # Find connected components\r\n # for each component get the lowest cost\r\n # rest of them - just add the raw cost\r\n \"\"\"\r\n # print(f\"The I/P graph is: {g}\")\r\n components = find_connected_components(g,n)\r\n # print(f\"The components are: {components}\")\r\n\r\n total = 0\r\n\r\n for c in components:\r\n current_cost = float('inf')\r\n for k in c:\r\n if cost[k] < current_cost:\r\n current_cost = cost[k]\r\n total += current_cost\r\n\r\n print(total)\r\n\r\n\r\ndef main():\r\n \"\"\"\r\n Main function dedicated to get the I/P\r\n a, b = map(int, input().split())\r\n solve(a, b)\r\n \"\"\"\r\n n, m = map(int, input().split())\r\n cost = list(map(int, input().split()))\r\n g = defaultdict(list)\r\n\r\n for i in range(m):\r\n u,v = map(int, input().split())\r\n u = u-1\r\n v = v-1\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\n solve(g, n, cost)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n LOCAL = False\r\n\r\n # If it's Local - Get I/P from file\r\n if LOCAL:\r\n sys.stdin = open(\"../io/data.in\", \"r\")\r\n sys.stdout = open(\"../io/data.out\", \"w\")\r\n\r\n testcases = 1\r\n for i in range(testcases):\r\n main()\r\n\r\n # If it's local - Print this O/P\r\n if LOCAL:\r\n print(f\"Time Elapsed: {time.time() - start_time} seconds\")\r\n sys.stdout.close()\r\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\ndef get_root(s):\r\n v = []\r\n while not s == root[s]:\r\n v.append(s)\r\n s = root[s]\r\n for i in v:\r\n root[i] = s\r\n return s\r\n\r\ndef unite(s, t):\r\n rs, rt = get_root(s), get_root(t)\r\n if not rs ^ rt:\r\n return\r\n if rank[s] == rank[t]:\r\n rank[rs] += 1\r\n if rank[s] >= rank[t]:\r\n root[rt] = rs\r\n size[rs] += size[rt]\r\n else:\r\n root[rs] = rt\r\n size[rt] += size[rs]\r\n return\r\n\r\ndef same(s, t):\r\n return True if get_root(s) == get_root(t) else False\r\n\r\nn, m = map(int, input().split())\r\nc = [0] + list(map(int, input().split()))\r\nroot = [i for i in range(n + 1)]\r\nrank = [1 for _ in range(n + 1)]\r\nsize = [1 for _ in range(n + 1)]\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n if not same(x, y):\r\n unite(x, y)\r\ninf = pow(10, 9) + 7\r\nd = defaultdict(lambda : inf)\r\nfor i in range(1, n + 1):\r\n r = get_root(i)\r\n d[r] = min(d[r], c[i])\r\nans = 0\r\nfor i in d.values():\r\n ans += i\r\nprint(ans)" ]

[ "import itertools\r\nimport math\r\nimport time\r\nfrom builtins import input\r\nfrom math import gcd as gcd\r\nimport sys\r\nimport queue\r\nimport itertools\r\nimport collections\r\nfrom heapq import heappop, heappush\r\nimport random\r\nimport os\r\nfrom random import randint\r\nimport decimal\r\n\r\n# from sys import stdin, stdout\r\n# input, print = stdin.readline, stdout.write\r\n\r\ndecimal.getcontext().prec = 18\r\n\r\n\r\ndef solve():\r\n file_input = open(\"input.txt\",\"r\")\r\n file_output = open(\"output.txt\", \"w\")\r\n \r\n n, m, k = map(int, file_input.readline().split())\r\n\r\n polki = [[0 for j in range(m)] for i in range(n)]\r\n\r\n f = {}\r\n\r\n for _ in range(k):\r\n action, *other = map(str, file_input.readline().split())\r\n\r\n if action[0] == \"+\":\r\n x, y, name = other\r\n x, y = int(x) - 1, int(y) - 1\r\n\r\n found = False\r\n for i in range(y, m):\r\n if polki[x][i] == 0:\r\n polki[x][i] = 1\r\n f[name] = [x, i]\r\n found = True\r\n break\r\n\r\n if found == False:\r\n flag = False\r\n for i in range(x + 1, n):\r\n if flag:\r\n break\r\n for j in range(m):\r\n if polki[i][j] == 0:\r\n polki[i][j] = 1\r\n f[name] = [i, j]\r\n flag = True\r\n break\r\n else:\r\n name = other[0]\r\n if name not in f:\r\n file_output.write(\"-1 -1\\n\")\r\n else:\r\n x, y = f[name]\r\n polki[x][y] = 0\r\n del (f[name])\r\n file_output.write(str(x + 1) + \" \" + str(y + 1)+\"\\n\")\r\n \r\n file_input.close()\r\n file_output.close()\r\n \r\n\r\nif __name__ == '__main__':\r\n multi_test = 0\r\n\r\n if multi_test == 1:\r\n t = int(sys.stdin.readline())\r\n for _ in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "import sys\r\n \r\nsys.stdin = open('input.txt')\r\nsys.stdout = open('output.txt', 'w')\r\n \r\n[row_num, col_num, query_num] = list(map(int, input().split()))\r\n \r\nrows = []\r\nfor r in range(row_num+1):\r\n\trows.append((col_num+1)*[None])\r\n \r\nlocation = {}\r\n \r\nfor query_index in range(query_num):\r\n\ttokens = input().split()\r\n\tid = tokens.pop()\r\n\tintegers = list(map(int, tokens))\r\n \r\n\tif integers[0] == -1:\r\n\t\tif id in location:\r\n\t\t\tr, c = location[id]\r\n\t\t\tdel location[id]\r\n\t\t\trows[r][c] = None\r\n\t\t\tprint(\"%d %d\" % (r, c))\r\n\t\telse:\r\n\t\t\tprint(\"-1 -1\")\r\n \r\n\telse:\r\n\t\tr, c = integers[1:3]\r\n\t\twhile rows[r][c]:\r\n\t\t\tc += 1\r\n\t\t\tif c > col_num:\r\n\t\t\t\tc = 1\r\n\t\t\t\tr += 1\r\n\t\t\t\tif r > row_num:\r\n\t\t\t\t\tbreak\r\n\t\tif r <= row_num:\r\n\t\t\tlocation[id] = [r, c]\r\n\t\t\trows[r][c] = id", "spaces = (\" \",\"\\n\",\"\\t\")\r\nstops = (\"\",\" \",\"\\n\",\"\\t\")\r\n\r\ndef ReadNext(fileObject):\r\n\tcurrentBuffer = \"\"\r\n\tcurrentRead=fileObject.read(1)\r\n\twhile currentRead in spaces:\r\n\t\tcurrentRead=fileObject.read(1)\r\n\tcurrentBuffer = currentBuffer + currentRead\r\n\twhile not currentRead in stops:\r\n\t\tcurrentRead=fileObject.read(1)\r\n\t\tcurrentBuffer = currentBuffer + currentRead\r\n\treturn currentBuffer.strip()\r\n\r\nw, r= open('output.txt', 'w'), open('input.txt', 'r')\r\nn = int(ReadNext(r))\r\nm = int(ReadNext(r))\r\nk = int(ReadNext(r))\r\nmaxCell = n*m;\r\nsklad = [''] * maxCell\r\n\r\nfor i in range(k):\r\n\toperation = ReadNext(r)\r\n\tif operation == \"+1\":\r\n\t\trow = int(ReadNext(r)) - 1\r\n\t\tcolumn = int(ReadNext(r)) - 1\r\n\t\trealIndex = row*m+column\r\n\t\tident = ReadNext(r)\r\n\t\tfor idx in range(realIndex,maxCell):\r\n\t\t\tif sklad[idx]=='':\r\n\t\t\t\tsklad[idx]=ident\r\n\t\t\t\tprint(\"Put \"+ident+\" on (\",idx,\",\",int(idx/m)+1,\",\",idx%m+1,\")\")\r\n\t\t\t\tbreak\r\n\telse:\r\n\t\tident = ReadNext(r)\r\n\t\tfound=False\r\n\t\tfor idx in range(0,maxCell):\r\n\t\t\tif sklad[idx]==ident:\r\n\t\t\t\tfound = True\r\n\t\t\t\tw.write(str(int(idx/m)+1)+\" \"+str(idx%m+1)+\"\\n\")\r\n\t\t\t\tsklad[idx]=''\r\n\t\t\t\tprint(\"Remove \"+ident+\" on (\",idx,\",\",int(idx/m)+1,\",\",idx%m+1,\")\")\r\n\t\t\t\tbreak\r\n\t\tif not found:\r\n\t\t\tw.write(\"-1 -1\\n\")\r\n\t\t\tprint(ident+\" not present (-1,-1)\")\r\n", "class CodeforcesTask35BSolution:\n def __init__(self):\n self.result = ''\n self.n_m_k = []\n self.queries = []\n\n def read_input(self):\n with open(\"input.txt\", \"r\") as in_file:\n in_data = in_file.readlines()\n self.n_m_k = [int(x) for x in in_data[0].strip().split(\" \")]\n self.queries = [[x for x in query.strip().split(\" \")] for query in in_data[1:]]\n\n def process_task(self):\n warehouse = [['' for x in range(self.n_m_k[1])] for y in range(self.n_m_k[0])]\n\n with open(\"output.txt\", \"w\") as outfile:\n for query in self.queries:\n if query[0] == \"+1\":\n put = False\n posx = int(query[2]) - 1\n posy = int(query[1]) - 1\n while not put:\n if not warehouse[posy][posx]:\n put = True\n warehouse[posy][posx] = query[3]\n else:\n posx += 1\n if posx >= self.n_m_k[1]:\n posx = 0\n posy += 1\n if posy >= self.n_m_k[0]:\n put = True\n else:\n got = False\n for y in range(self.n_m_k[0]):\n for x in range(self.n_m_k[1]):\n if warehouse[y][x] == query[1]:\n got = True\n outfile.write(\"{0} {1}\\n\".format(y + 1, x + 1))\n warehouse[y][x] = \"\"\n break\n if not got:\n outfile.write(\"-1 -1\\n\")\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask35BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef f(u, v):\r\n return u * m + v\r\n\r\nn, m, k = map(int, input().split())\r\nans = []\r\nd = dict()\r\ns = [0] * (n * m)\r\nfor _ in range(k):\r\n t = list(input().rstrip().decode().split())\r\n if t[0] == \"+1\":\r\n x, y, z = int(t[1]) - 1, int(t[2]) - 1, t[3]\r\n i = f(x, y)\r\n while i < n * m and s[i]:\r\n i += 1\r\n if i < n * m:\r\n s[i] = 1\r\n d[z] = divmod(i, m)\r\n else:\r\n z = t[1]\r\n if z in d and not d[z] == (-1, -1):\r\n x, y = d[z]\r\n ans0 = \" \".join(map(str, (x + 1, y + 1)))\r\n s[f(x, y)] = 0\r\n d[z] = (-1, -1)\r\n else:\r\n ans0 = \"-1 -1\"\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))", "import sys\r\nfi=open(\"input.txt\",\"r\")\r\nfo=open(\"output.txt\",\"w\")\r\nsys.stdin=fi\r\nsys.stdout=fo\r\ni=lambda:map(int,input().split())\r\nn,m,k=i()\r\nM=[[''for x in range(m)]for x in range(n)]\r\ni=0\r\nwhile(i<k):\r\n f=0\r\n l=input().split()\r\n l[0]=int(l[0])\r\n if(l[0]==1):\r\n l[1]=int(l[1])\r\n l[2]=int(l[2])\r\n for x in range(l[1]-1,n):\r\n for y in range(0,m):\r\n if(x==l[1]-1 and y<l[2]-1):continue\r\n if(M[x][y]==''):\r\n M[x][y]=l[3]\r\n f=1\r\n break\r\n if(f):break\r\n else:\r\n for x in range(n):\r\n for y in range(m):\r\n if(M[x][y]==l[1]):\r\n print(\"%d %d\"%(x+1,y+1))\r\n M[x][y]=''\r\n f=1\r\n break\r\n if(f):break\r\n if(0==f):print(\"%d %d\"%(-1,-1))\r\n i+=1\r\n" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nl = pow(10, 6)\r\nc, c1, c2 = 0, 0, 0\r\ny = [-1] * (l + 1)\r\nmod = pow(10, 9) + 7\r\nfor i in range(n):\r\n ai = a[i]\r\n if y[ai] == -1:\r\n c += 1\r\n s = i - y[ai]\r\n t = (s - 1) * (s - 2)\r\n c1 += t % mod\r\n c2 += t // mod\r\n c1 += s - 1\r\n if c1 >= mod:\r\n c1 %= mod\r\n c2 += 1\r\n y[ai] = i\r\nfor i in range(1, l + 1):\r\n if not y[i] == -1:\r\n s = n - y[i]\r\n t = (s - 1) * (s - 2)\r\n c1 += t % mod\r\n c2 += t // mod\r\n c1 += s - 1\r\n if c1 >= mod:\r\n c1 %= mod\r\n c2 += 1\r\nans = ((c * n * n) - (c1 + c2 * mod)) / (n * n)\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nlastocc=[0]*1000006\r\nans=[0]*n\r\nans[0]=1\r\nlastocc[a[0]]=1\r\n\r\nfor i in range(1,n):\r\n ans[i]=ans[i-1]+(i+1-lastocc[a[i]])\r\n lastocc[a[i]]=i+1\r\n\r\nprint((2*sum(ans)-n)/(n*n))\r\n", "n = int(input())\r\narr = [0]\r\narr = arr + list(map(int, input().split(' ')))\r\n\r\ndef getCounts(arr):\r\n last = {}\r\n ans = 0.0\r\n prev = 0.0\r\n res = 0.0\r\n for i in range(1, len(arr)):\r\n if arr[i] not in last:\r\n ans = prev + i\r\n else:\r\n ans = prev + i - last[arr[i]]\r\n prev = ans\r\n res += ans\r\n last[arr[i]] = i\r\n return res\r\n\r\nans = (2 * getCounts(arr) - n)/(n*n)\r\nprint(\"%.6f\" % ans)\r\n", "import math\r\nimport sys\r\n\r\n\r\ndef solve():\r\n n = int(sys.stdin.readline())\r\n a = list(map(int, sys.stdin.readline().split()))\r\n\r\n last = {}\r\n all_possible = (n * n)\r\n not_pos = {}\r\n\r\n for i in range(n):\r\n if a[i] not in last:\r\n last[a[i]] = i\r\n not_pos[a[i]] = i * i\r\n else:\r\n not_pos[a[i]] += (i - last[a[i]] - 1) * (i - last[a[i]] - 1)\r\n last[a[i]] = i\r\n\r\n #print(not_pos)\r\n for i in last:\r\n not_pos[i] += (n - last[i] - 1) * (n - last[i] - 1)\r\n\r\n res = 0\r\n for i in not_pos:\r\n res += (all_possible - not_pos[i]) / all_possible\r\n #print(not_pos)\r\n print(\"%.9f\" % (res))\r\n\r\n return\r\n\r\n\r\nif __name__ == \"__main__\":\r\n mt = 0\r\n if mt:\r\n t = int(sys.stdin.readline())\r\n for i in range(t):\r\n solve()\r\n else:\r\n solve()\r\n", "n=int(input())\na=list(map(int,input().split()))\n\nlastocc=[0]*1000006\nans=[0]*n\nans[0]=1\nlastocc[a[0]]=1\n\nfor i in range(1,n):\n ans[i]=ans[i-1]+(i+1-lastocc[a[i]])\n lastocc[a[i]]=i+1\n\nprint((2*sum(ans)-n)/(n*n))\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nfrom collections import defaultdict\r\nd = defaultdict(lambda: [])\r\nfor i, a in enumerate(A):\r\n d[a].append(i)\r\nans = 0\r\nfor k, l in d.items():\r\n l = [-1]+l+[n]\r\n D = []\r\n for j in range(len(l)-1):\r\n D.append(max(0, l[j+1]-l[j]-1))\r\n temp = n*n\r\n for d in D:\r\n temp -= d*d\r\n ans += temp\r\nans /= n*n\r\nprint(ans)\r\n", "import sys\r\nfrom collections import defaultdict\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\na = list(map(int, sys.stdin.buffer.readline().decode('utf-8').split()))\r\nnext_dic = defaultdict(list)\r\n\r\nfor i in range(n-1, -1, -1):\r\n next_dic[a[i]].append(i)\r\n\r\nfx = sum((n-v[-1])*2 for v in next_dic.values())\r\nans = 0\r\n\r\nfor i in range(n):\r\n j = next_dic[a[i]].pop()\r\n ans += fx - 1\r\n fx += -(n - j)*2 + (n - next_dic[a[i]][-1] if next_dic[a[i]] else 0)*2\r\n\r\nprint(ans / (n*n))\r\n", "n = int(input()) \r\na = list(map(int, input().split()))\r\n\r\nd = {}\r\n\r\ndef push(d, x, i):\r\n if x not in d:\r\n d[x]=[]\r\n d[x].append(i) \r\n\r\nfor i, x in enumerate(a):\r\n push(d, x, i)\r\n \r\nS=0 \r\nfor arr in d.values():\r\n pre=-1\r\n for i in arr:\r\n S += 2 * (i-pre)*(n-i)\r\n pre=i\r\n \r\nprint((S-n)/(n*n)) " ]

[ "n = int(input())\r\neggs = []\r\n\r\nfor i in range(n):\r\n a, g = map(int, input().split())\r\n eggs.append((a, g))\r\n\r\nresult = []\r\n\r\ntotal_a_payment = 0\r\ntotal_g_payment = 0\r\n\r\nfor a, g in eggs:\r\n if total_a_payment + a - total_g_payment <= 500:\r\n result.append('A')\r\n total_a_payment += a\r\n else:\r\n result.append('G')\r\n total_g_payment += g\r\n\r\nif abs(total_a_payment - total_g_payment) > 500:\r\n print(-1)\r\nelse:\r\n print(\"\".join(result))\r\n", "import sys\r\nn = int(sys.stdin.readline())\r\nd = 0\r\nfor _ in range(n):\r\n a, g = map(int, sys.stdin.readline().split())\r\n if d + a <= 500:\r\n d += a\r\n print('A', end='')\r\n else:\r\n d -= g\r\n print('G', end='')# 1698396157.2401366", "n = int(input())\r\neggs = []\r\n\r\nfor i in range(n):\r\n a, g = map(int, input().split())\r\n eggs.append((a, g))\r\n\r\ndistribution = [''] * n\r\nSa = 0 # Total money paid to A\r\nSg = 0 # Total money paid to G\r\n\r\nfor i in range(n):\r\n if abs(Sa + eggs[i][0] - Sg) <= 500:\r\n distribution[i] = 'A'\r\n Sa += eggs[i][0]\r\n else:\r\n distribution[i] = 'G'\r\n Sg += eggs[i][1]\r\n\r\nif abs(Sa - Sg) <= 500:\r\n print(''.join(distribution))\r\nelse:\r\n print(\"-1\")\r\n" ]

[ "line = list(map(int, input().strip().split()))\r\n\r\nif(min(line)%2 == 0):\r\n\tprint(\"Malvika\")\r\nelse:\r\n\tprint(\"Akshat\")", "n,m = map(int, input().split())\r\n\r\na = min(n,m)\r\n\r\nif a%2==0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "a = min(map(int,input().split()))\r\nif a % 2 == 0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')\r\n", "t = input().split()\nn = int(t[0])\nm = int(t[1])\n\ndecider = 0\nif n>m:\n decider = m\nelse:\n decider = n\n\nif decider%2 == 0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n\n", "a = input().split(\" \")\r\nif min(int(a[0]), int(a[1])) % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "# 451A - Game With Sticks\r\nn,m = map(int, input().split())\r\ntmp = min(n,m)\r\nif tmp % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "grid = list(map(int,input().split()))\r\nintersections = grid[0]*grid[1]\r\nturns = 0\r\nwhile intersections:\r\n grid[0] -= 1\r\n grid[1] -= 1\r\n turns += 1\r\n intersections = intersections = grid[0]*grid[1]\r\nif turns % 2 or turns == 0:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "winner = 'Malvika'\r\nplayers = ['Akshat', 'Malvika']\r\n\r\nline = [int(i) for i in input().split()]\r\n\r\ni=0\r\nwhile line[0]*line[1] != 0:\r\n winner = players[i%2]\r\n i+=1\r\n line[0]-=1\r\n line[1]-=1\r\n \r\nprint(winner)\r\n ", "n, m = map(int, input().split())\r\n\r\nmin_sticks = min(n, m)\r\n\r\nif min_sticks % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "from sys import stdin\r\nprint('Akshat' if min(map(int,stdin.readline().split()))&1 else 'Malvika')\r\n", "n, m = [int(i) for i in input().split()]\r\nsize = n * m\r\nans = 0\r\nwhile(size != 0):\r\n if (n != 0):\r\n size -= n\r\n n -= 1\r\n if (m != 0):\r\n size -= m\r\n size += 1 \r\n m -= 1\r\n ans += 1\r\nif (ans % 2 == 0):\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m = list(map(int,input().split(' ')))\r\np = [n*m]\r\nwhile n*m !=0:\r\n n-=1\r\n m-=1\r\n p.append(n*m)\r\n\r\nif len(p)%2 == 0:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')\r\n", "print(\"Malvika\" if min(map(int, input().split())) % 2 == 0 else \"Akshat\")", "n,m = map(int,input().split())\r\nk = min(n,m)\r\nif k*k % 2 == 0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "n,m=map(int,input().split())\r\np=n*m\r\ncount=0\r\nwhile p!=0:\r\n n-=1\r\n m-=1\r\n count+=1\r\n p=n*m\r\nif count%2!=0:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")\r\n ", "n, m = map(int, input().split())\r\n\r\ni = 1\r\nwhile ((n * m) >= 1):\r\n if (i % 2 != 0):\r\n n -= 1\r\n m -= 1\r\n a = 1\r\n b = 0\r\n else:\r\n n -= 1\r\n m -= 1\r\n a = 0\r\n b = 1\r\n i += 1\r\n\r\nif (a == 0 and b == 1):\r\n print(\"Malvika\")\r\nelif (a == 1 and b == 0):\r\n print(\"Akshat\")", "n,m=map(int,input().split())\r\ncount=0\r\nwhile (n!=0) and (m!=0):\r\n count+=1\r\n n-=1\r\n m-=1\r\nif count%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int, input().split());print(\"Malvika\" if min(n, m) % 2 == 0 else \"Akshat\")", "a,b = map(int,input().split(' '))\n\nif min(a, b) % 2 == 1:\n\tprint(\"Akshat\")\nelse:\n\tprint(\"Malvika\")\n\n", "nums = [int(i) for i in input().split()] \r\nn = nums[0]\r\nm = nums[1] \r\npoints = m * n\r\nAkshat = False\r\n\r\n\r\n\r\nfor i in range(points):\r\n m -= 1\r\n n -= 1 \r\n Akshat = not Akshat\r\n if m == 0 or n == 0:\r\n break\r\n\r\nif Akshat:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "x=input()\r\ny=list(map(int,x.split()))\r\nn=min(y)**2\r\nif n %2==0 :\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "n, m = map(int, input().split())\r\nt = min(n, m)\r\nif t % 2 == 0:\r\n vlt = \"Malvika\"\r\nelse:\r\n vlt = \"Akshat\"\r\nprint(vlt)", "from collections import defaultdict\r\n\r\ndef pug_func(s: str) -> int:\r\n\r\n n, m = s.split(\" \")\r\n n = int(n)\r\n m = int(m)\r\n\r\n if n == m:\r\n if n % 2 == 0:\r\n return \"Malvika\"\r\n else:\r\n return \"Akshat\"\r\n \r\n else:\r\n if min(n, m) % 2 == 0:\r\n return \"Malvika\"\r\n else:\r\n return \"Akshat\"\r\n\r\n\r\n\r\n\r\n\r\n\r\nt = input()\r\nx = pug_func(t)\r\nprint(x)\r\n# lista_ans = []\r\n\r\n# for _ in range(t):\r\n# n = input()\r\n# line = input()\r\n# lista_ans.append(line)\r\n\r\n# for ans in lista_ans:\r\n# x = pug_func(ans)\r\n# print(x)\r\n\r\n", "row, colmn = map(int, input().split())\r\ndeff = min(row, colmn)\r\nif deff % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n\r\n\r\n", "#https://codeforces.com/problemset/problem/339/B\r\nn,m=map(int,input().split())\r\nif min(n,m)%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "x , y = input().split()\r\n\r\nx = int(x)\r\ny = int(y)\r\n\r\nliczba_ruch = min(x,y)\r\n\r\nif liczba_ruch % 2 == 0:\r\n print(\"Malvika\")\r\nelse: \r\n print(\"Akshat\") ", "n, m = input().split()\n\nif min(int(n), int(m)) % 2 == 0: \n print('Malvika')\nelse: \n print('Akshat')\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\nz = min(n,m)\r\nprint(\"Malvika\") if z%2==0 else print(\"Akshat\")", "m,n=map(int,input().split())\r\nif (min(m,n)%2==0):\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "a,b = map(int,input().split())\r\nprint(\"Malvika\" if min(a,b)&1 == 0 else \"Akshat\")", "n, m = list(map(int, input().split()))\r\n\r\nmind = min(n, m)\r\n\r\nif mind % 2 == 0:\r\n\r\n print('Malvika')\r\n\r\nelse: print(\"Akshat\")\r\n ", "n, m = map(int, input().split())\r\nres = min(n, m)\r\nif (res % 2 == 0):\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "n, m = map(int, input().split())\n\nmatrix = [[i for i in range(n)]for j in range(m)]\n\ncounter = 0\nwhile(True):\n if len(matrix) == 0 or len(matrix[0]) == 0:\n break\n n-=1\n m-=1\n matrix = [[i for i in range(n)]for j in range(m)]\n counter += 1\n\nif counter % 2 != 0:\n print(\"Akshat\")\nelse:\n print(\"Malvika\")\n \t\t \t \t\t \t\t \t \t \t \t\t \t", "def f():\r\n n=list(map(int,input().split(\" \")))\r\n rows=n[0]\r\n cols=n[1]\r\n flag=0\r\n while rows*cols!=0:\r\n rows=rows-1\r\n cols=cols-1\r\n flag=1-flag\r\n if flag==1:\r\n return \"Akshat\"\r\n else:\r\n return \"Malvika\"\r\n \r\nprint(f())", "n, m = map(int, input().split(\" \"))\r\ni = 0\r\nwhile n >= 1 and m >= 1:\r\n n -= 1\r\n m -= 1\r\n i += 1\r\nif i % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "def intersecions(n,m):\r\n f=n*m\r\n count=1\r\n while f!=0:\r\n f=n*m\r\n count+=1\r\n n-=1\r\n m-=1\r\n if count%2!=0:\r\n return \"Akshat\"\r\n return \"Malvika\"\r\nn=input()\r\nalist=[int(x) for x in n.split()]\r\nprint(intersecions(alist[0],alist[1]))\r\n", "n,m=map(int,input().split())\r\nprint('Akshat' if min(m,n)%2 else 'Malvika')", "r, c = [int(x) for x in input().split()]\r\nturns = 0\r\n\r\nif r > c:\r\n turns = c\r\nelse:\r\n turns = r\r\n\r\nif turns % 2:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "\r\nn,m = map(int,input().split())\r\npoints = n*m\r\nturn = 0\r\nwhile(n>0 and m>0):\r\n n-=1\r\n m-=1\r\n turn +=1\r\nif(turn%2==0):\r\n print('Malvika') \r\nelse:\r\n print('Akshat')\r\n ", "n, m = map(int, input().split())\r\nmn = min(n, m)\r\nif mn%2 == 1:\r\n\tprint('Akshat')\r\nelse:\r\n\tprint('Malvika')", "print(['Malvika', 'Akshat'][min(map(int, input().split())) % 2])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Mar 29 11:24:22 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nr,c=map(int,input().split())\r\n[print(\"Akshat\") if (min(r,c))%2 else print(\"Malvika\")]", "count=0\nn,m=[int(i) for i in input().strip().split()]\npoint=n*m\nwhile point>0:\n n-=1\n m-=1\n point=n*m\n count+=1\nif count%2==0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n\t\t\t \t\t\t\t \t \t\t\t\t\t \t\t \t \t \t", "m,n = map(int, input().split())\r\n\r\nb = (m*n)//max(m,n)\r\n\r\nif b%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "input_ls = [int(a) for a in input().split(\" \")]\r\nm = input_ls[0]\r\nn = input_ls[1]\r\nk = m*n\r\np = 0\r\nwhile(k>0):\r\n k = k-(m+n-1)\r\n m = m-1\r\n n = n-1\r\n p = p+1\r\nif p%2 == 1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "l = (int(x) for x in input().split())\r\nif min(l) % 2 == 0: \r\n print(\"Malvika\")\r\nelse: print(\"Akshat\")\r\n", "n,m=list(map(int,input().split()))\nstatus=0\nwhile(n!=0 and m!=0):\n\tn-=1\n\tm-=1\n\tif status==0:\n\t\tstatus=1\n\telse:\n\t\tstatus=0\nif status==1:\n\tprint(\"Akshat\")\nelse:\n\tprint(\"Malvika\")", "from collections import Counter\r\nimport math\r\n\r\nls = list(map(int, input().split()))\r\nmn = min(ls[0], ls[1])\r\n\r\nprint('Malvika' if min(ls[0], ls[1]) % 2 == 0 else 'Akshat')", "n, m = map(int, input().split())\r\nif m<=n:\r\n i = m\r\nelse:\r\n i = n\r\nif i%2:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "n,m=map(int,input().split())\r\nif (min(m,n))%2==1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")\r\n\r\n\r\n", "X, Y = map(int, input().split())\r\nmin = min(X, Y)\r\n\r\nif min % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "l=input().split()\r\na=min(int(l[0]),int(l[1]))\r\nif a%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "A=input().split()\r\nB=[]\r\nfor x in A:\r\n B.append(int(x))\r\nb=min(B)\r\nif b%2==0:\r\n print(\"Malvika\")\r\nelif b%2==1:\r\n print(\"Akshat\")", "m, n = map(int, input().split())\r\nprint('Akshat' if min(m, n) % 2 == 1 else 'Malvika')", "print([ \"Malvika\" , \"Akshat\" ][min([int(x) for x in input().split(\" \")]) % 2])", "z=list(map(int,input().split()))\r\na=z[0]\r\nb=z[1]\r\ndef stickgame(n,m,count=0):\r\n noofpoints=n*m\r\n if n==0 or m==0:\r\n return count\r\n elif noofpoints>=1:\r\n return stickgame(n-1,m-1,count+1)\r\nq=stickgame(a,b)\r\nif q%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "a, b = map(int, input().split())\r\nif a<b:\r\n max = b\r\n min = a\r\nelse:\r\n max = a\r\n min = b\r\nif min % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int, input().split())\r\nc = min(n, m)\r\nprint(\"Malvika\" if not c % 2 else \"Akshat\")\r\n", "n,m = map(int,input().split())\r\ninter=n*m\r\nmoves = 0\r\nwhile inter>0:\r\n n-=1\r\n m-=1\r\n inter=n*m\r\n moves +=1\r\nif moves%2 == 0:\r\n print( \"Malvika\" )\r\nelse:\r\n print(\"Akshat\")", "n,m = map(int, input().split())\r\n\r\nprint(\"Akshat\") if min(n,m) % 2 != 0 else print(\"Malvika\")", "x1,x2=list(map(int,input().split()))\r\na=x1*x2\r\nb=0\r\nfor i in range(1,101):\r\n if x1-i==0 or x2-i==0:\r\n break\r\n b=b+1\r\nif b%2!=0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n\r\n", "m,n=map(int,input().split())\r\nl=[m,n]\r\nq=0\r\nfor i in range(80000):\r\n l[0]-=1\r\n l[1]-=1\r\n q+=1\r\n if l[0]==0 or l[1]==0:\r\n if q%2 !=0 :\r\n print('Akshat')\r\n break\r\n \r\n else:\r\n print('Malvika')\r\n break\r\n else:\r\n continue", "n,m = map(int,input().split())\r\nif n > m:\r\n n,m = m,n\r\n \r\nif n %2 == 0 :\r\n print(\"Malvika\")\r\nelse:\r\n print('Akshat')\r\n ", "a = min(map(int, input().split()))\r\nprint(\"Malvika\" if a % 2 == 0 else \"Akshat\")", "#####\nm, n = map(int, input().split())\na = m * n\nif m > n:\n b = a // m\nelse:\n b = a // n\nif b % 2 == 0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n\n \t \t\t \t\t \t\t \t\t\t\t \t\t \t \t \t", "a,b=map(int,input().split())\nn=a*b\nc=1\nwhile n>0:\n n=a*b\n c+=1\n a-=1\n b-=1\nif c%2!=0:\n print('Akshat')\nelse:\n print('Malvika')\n ", "n,m=map(int,list(input().split()))\r\nif min(m,n)%2==0:print(\"Malvika\")\r\nelse:print(\"Akshat\")", "s=[int(x) for x in input().split()]\r\nn=s[0]\r\nm=s[1]\r\nc=0\r\nwhile True:\r\n c+=1\r\n n-=1\r\n m-=1\r\n if n==0 or m==0:\r\n break\r\nif c%2==0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')\r\n", "n,m=list(map(int,input().rstrip().split()))\r\nif n==1 or m==1:\r\n print('Akshat')\r\nelse:\r\n points=n*m\r\n vertical=m\r\n horizontal=n\r\n i=0\r\n while m>0 and n>0:\r\n i+=1\r\n points-=(n+m-1)\r\n m-=1\r\n n-=1\r\n if i%2==0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\n \r\n ", "n,m = input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nif min(n,m)%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print('Akshat')", "a = sorted(list(map(int,input().split())))\r\nb = a[0] * a[1]\r\n#print(\"Akshat\") if b % 2 != 0 or b == 2 else print(\"Malvika\")\r\n\r\nprint(\"Akshat\") if a[0] % 2 != 0 or b == 2 else print(\"Malvika\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 20:06:39 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn = min(map(int,input().split()))\r\nif n &1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "a,b=map(int,input().split())\r\nc=0\r\nwhile(a>0 and b>0):\r\n a=a-1\r\n b=b-1\r\n c=c+1\r\nif c%2!=0:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "print(\"Akshat\" if min(map(lambda x: int(x), input().split()))%2!=0 else \"Malvika\")", "a = list(map(int,input().split()))\r\nif min(a) %2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m=map(int,input().split())\r\npts=min(n,m)\r\nif pts%2==0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')\r\n", "n, m = map(int, input().split(' '))\r\nt = min(n,m)\r\nif t%2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int, input().split())\r\nplayer = [\"Akshat\", \"Malvika\"]\r\nselector = 0\r\nwhile n != 1 and m != 1 : \r\n n -= 1\r\n m -= 1\r\n selector ^= 1\r\nprint(player[selector])", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\na,b = sorted(getints())\r\nprint('Akshat' if a%2 else \"Malvika\")", "n,m = map(int, input().split())\r\nc= m*n\r\nsw=1\r\nwhile c!=0 :\r\n c-=m+n-1\r\n m-=1\r\n n-=1\r\n sw*=-1\r\nif sw==1:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "def main():\r\n n, m = map(int, input().split())\r\n queue = False\r\n \r\n while n >= 1 and m >= 1:\r\n n -= 1\r\n m -= 1\r\n queue = not queue\r\n\r\n\r\n if queue == True:\r\n print(\"Akshat\")\r\n elif queue == False:\r\n print(\"Malvika\")\r\n\r\n\r\nmain()", "n,m = [int(i) for i in input().split()]\r\nminimum = n\r\nif m < n:\r\n minimum = m\r\nif minimum % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m=map(int,input().split())\r\na=m*n\r\nif m>n:\r\n b=a//m\r\nelse:\r\n b=a//n\r\n \r\nif (b)%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m=input().split()\r\nn,m=int(n),int(m)\r\nif(min(n,m)%2==0):\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n ", "a=list(map(int,input().split()))\r\nb=min(a)\r\nif b%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m = map(int,input().split())\r\n\r\ncount = 0\r\n\r\nwhile (n > 0 and m > 0):\r\n n -= 1\r\n m -= 1\r\n count += 1\r\n\r\n# print(count)\r\n\r\nif count %2 == 0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "n,m = list(map(int,input().split(\" \")))\nran = n*m #4\ncount = 0 #2\nfor i in range (ran): #1 2 3\n n -=1 \n m-=1\n count+=1\n if n==0 or m==0:\n break\n \nif count%2==0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n\t \t \t \t\t\t\t \t\t \t \t \t\t\t\t", "import sys\r\nlst = [int(x) for x in sys.stdin.readline().split(' ')]\r\ndef isEven(x):\r\n if x % 2 == 0: return True\r\n\r\nminimum = 0\r\nif lst[0] == lst[1]: minimum = lst[0]\r\nelse: minimum = min(lst)\r\n\r\nif isEven(minimum): print(\"Malvika\")\r\nelse: print(\"Akshat\")", "n,m=map(int,input().split())\r\nprint(\"Akshat\" if min(n,m)%2!=0 else \"Malvika\")", "s = input().split()\r\nl = [int(x) for x in s]\r\nl.sort()\r\n\r\nres = ''\r\nflag = True\r\n\r\nwhile l[0] > 0:\r\n if flag:\r\n res = \"Akshat\"\r\n flag = False\r\n else:\r\n res = 'Malvika'\r\n flag = True\r\n \r\n l[0] -= 1\r\n\r\nprint(res)\r\n ", "n = [int(x) for x in input().split()]\r\n\r\nif n[0] > n[1]:\r\n if n[1] % 2 == 0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\nelse:\r\n if n[0] % 2 == 0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")", "# ﷽\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n a,b=[int(i) for i in input().split()]\r\n a=min(a,b)\r\n if a%2==0:\r\n print('Malvika')\r\n else:\r\n print('Akshat')\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n solve()\r\n", "n=list(map(int,input().split()))\r\nn.sort()\r\nif n[0]%2==0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "n, m = map(int, input().split())\r\ninter= n * m\r\nakshat = 0\r\nmalvika = 0\r\ni = 0\r\nwhile n > 0 and m > 0:\r\n if i % 2 == 0:\r\n inter -= n + m - 1\r\n n -= 1\r\n m -= 1\r\n akshat += 1\r\n elif i % 2 == 1:\r\n inter -= n + m -1\r\n n -= 1\r\n m -= 1\r\n malvika += 1\r\n i+=1\r\nif i % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "(n, m) = map(int, input().split())\r\n\r\nmin_stick = min(n, m)\r\n\r\nif min_stick % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "print('Akshat' if min(map(int,input().split()))&1 else 'Malvika')\r\n", "n,m=map(int,input().split())\r\nif n>m:\r\n t=n\r\n n=m\r\n m=t\r\nif n%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "r_c=list(map(int,input().split()))\r\nr_c.sort()\r\n\r\nif (r_c[0]-1)%2==1:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "a=list(map(int,input().split()))\r\nhor=a[0]\r\nver=a[1]\r\ncount=0\r\nwhile hor>0 and ver >0 :\r\n hor-=1\r\n ver-=1\r\n count+=1\r\nif count%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n ", "n , m = map(int,input().split())\r\nintersections = n*m\r\nwinner = \"Malvika\"\r\nwhile intersections>=1:\r\n intersections-=(n+m-1)\r\n n-=1\r\n m-=1\r\n if winner == \"Akshat\":\r\n winner = \"Malvika\"\r\n else:\r\n winner = \"Akshat\"\r\nprint(winner)", "n,m=map(int,input().strip().split())\r\nv=min(n,m)\r\nif v%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n ", "a,b = [int(x) for x in input().split()]\nif min(a,b) % 2 == 0: print(\"Malvika\")\nelse: print(\"Akshat\")\n \t\t\t \t \t \t\t \t \t \t\t \t \t\t \t", "n, m = map(int, input().split())\r\nstring = \"Akshat\"\r\ntotal = n * m\r\nwhile total != 0:\r\n if string == \"Akshat\":\r\n string = \"Malvika\"\r\n else:\r\n string = \"Akshat\"\r\n n = n - 1\r\n m = m - 1\r\n total = n * m\r\nif string == \"Akshat\":\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n\r\n ", "n = input().split()\r\na = int(n[0])\r\nb = int(n[1])\r\nif a==b:\r\n if a%2 == 0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\nelif a>b:\r\n if b%2 == 0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\nelse:\r\n if a%2 == 0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")", "# Wadea #\r\n\r\nn,m = map(int,input().split())\r\ncount = 0\r\nfor i in range(n*m):\r\n if n * m == 0:\r\n break\r\n else:\r\n n -= 1\r\n m -= 1\r\n count += 1\r\nif count % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n ", "n , m = input().split()\r\nnum = min(int(n),int(m))\r\nif num % 2 == 0:\r\n print('Malvika')\r\nelse :\r\n print('Akshat')", "n, m = map(int, input().split())\r\n\r\ncount = 0\r\ni = 0\r\n\r\nwhile True:\r\n if n - i == 0:\r\n break\r\n if m - i == 0:\r\n break\r\n\r\n i += 1\r\n count += 1\r\n\r\nprint(\"Malvika\") if count % 2 == 0 else print(\"Akshat\")\r\n ", "n, m = map(int, input().split())\r\nif (n > m):\r\n n,m = m,n\r\nif (n%2) == 0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "params = input().split()\r\nn, m = int(params[0]), int(params[1])\r\npoints = n * m\r\n\r\nperson = str()\r\nfor _ in range(int(points/2+1)):\r\n\r\n if _ % 2 == 0:\r\n person = 'k'\r\n else:\r\n person = 'm'\r\n\r\n n -= 1\r\n m -= 1\r\n points = n * m\r\n if not points:\r\n break\r\n\r\nif person == 'k':\r\n print('Akshat')\r\nelse:\r\n print('Malvika')", "n,m=map(int,input().split())\r\ny=min(n,m)\r\nif y%2==1:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')\r\n# Алшат вин если Н нечетное и М нечетное или\r\n", "n = list(map(int , input() . split()))\r\nmin0 = min(n)\r\nif min0 % 2 == 0 :\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = list(map(int, input().split()))\r\n\r\nif n > m:\r\n\tn, m = m, n\r\n\r\nif n % 2 == 0:\r\n\tprint(\"Malvika\")\r\nelse:\r\n\tprint(\"Akshat\")", "sticks = [int(i) for i in input().split()]\nif min(sticks) % 2 == 0:\n print('Malvika')\nelse:\n print('Akshat')\n \t\t \t \t \t \t\t\t\t \t \t", "a,b=map(int,input().split())\r\nif min(a,b)%2==1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "inp = input().split()\r\nrow = int(inp[0])\r\ncol = int(inp[1])\r\nplayer = 'Akshat' #'Malvika'\r\n\r\nwhile row*col != 0:\r\n row -=1\r\n col -=1\r\n if player == 'Akshat':\r\n player = 'Malvika'\r\n else:\r\n player = 'Akshat'\r\n\r\nif player == 'Akshat':\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "# Reading input\r\nn, m = map(int, input().split()) # n rows, m columns\r\n\r\n# Checking winner\r\nif min(n, m) % 2 == 0:\r\n print(\"Malvika\") # If number of rows or columns is even, Malvika wins\r\nelse:\r\n print(\"Akshat\") # Otherwise, Akshat wins", "n,m = map(int,input().split(' '))\r\nplayer = ['Akshat','Malvika']\r\nwinner = None\r\nfor i in range(n):\r\n if i%2 == 0:\r\n winner = player[0]\r\n else:\r\n winner = player[1]\r\n \r\n a = n*m-n+1-m\r\n if a == 0:\r\n break\r\n else:\r\n n-=1\r\n m-=1\r\n \r\nprint(winner)", "n,m = map(int,input().split())\r\ni=min(n,m)\r\nif i%2!=0:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "n,m = input().split(\" \")\nvalor = min(int(n),int(m))\nif valor % 2 == 0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n\t\t \t \t \t\t\t\t \t \t\t\t \t \t \t", "m,n=map(int,input().split())\r\ns=n*m\r\nif m>n:\r\n b=s/m\r\nelse:\r\n b=s/n\r\nif b%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m = input().split(\" \")\r\nvalor = min(int(n),int(m))\r\nif valor % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m = map(int,input().split())\r\na = min(n,m)\r\nif a%2==1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "cbgc,cjkr = map(int, input().split())\r\n \r\n #cbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgc\r\nif min(cbgc, cjkr) % 2 == 0:\r\n #cbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgc\r\n print(\"Malvika\")\r\n #cbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgc\r\nelse :\r\n #cbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgccbgc\r\n print(\"Akshat\")", "import math\r\n\r\nn, m = [int(i) for i in input().split()]\r\ns = n * m\r\ncnt = 0\r\nwhile s > 0:\r\n s -= n+m-1\r\n cnt += 1\r\n n -= 1\r\n m -= 1\r\nif cnt % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "x=list(input().split())\r\nif min(int(x[0]),int(x[1]))%2==1:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')\r\n\r\n", "\r\ndef Akshat(n,m):\r\n a = n + m - 1\r\n return a\r\n\r\ndef Malvika(n,m):\r\n a = n + m - 1\r\n return a\r\n\r\nn,m=map(int,input().split())\r\ni = n * m\r\nc = 0\r\nwhile (i >= 0):\r\n if (i == 0):\r\n print(\"Malvika\")\r\n break\r\n elif (i == 1):\r\n print(\"Akshat\")\r\n break\r\n else :\r\n i = i - Akshat(n, m)\r\n if (i == 0):\r\n print(\"Akshat\")\r\n break\r\n n =n-1\r\n m=m-1\r\n i = i - Malvika(n, m)\r\n n =n-1\r\n m=m-1", "# t = int(input())\r\n# while t>0:\r\nn,m = (int(i) for i in input().split())\r\nif(min(n,m)%2==0):\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n\r\n # t-=1", "# -*- coding: utf-8 -*-\r\nvalues = input().split()\r\nrows = int(values[0])\r\ncols = int(values[1])\r\n\r\nminimum = min(rows, cols)\r\n\r\nif minimum % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,l=map(int,input().split())\r\nif min(n,l)%2>0:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')", "from sys import stdin \r\nfrom math import log2, log10, log, ceil, floor, sqrt\r\n\r\ndef rs(): return stdin.readline().strip()\r\ndef ri(): return int(rs())\r\ndef rn(): return map(int, rs().split())\r\ndef rl(): return list(rn())\r\n\r\ndef solve():\r\n n, m = rn()\r\n if not (min(n, m) & 1):\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\n # print(a)\r\n return None \r\n\r\ndef main():\r\n # for _ in range(ri()):\r\n solve()\r\n\r\nmain()\r\n", "inp_ =[int(num) for num in input().split(\" \", 2)]\r\nnumber = inp_[0]*inp_[1]\r\nif inp_[0]>inp_[1]:\r\n count=inp_[1]\r\nelif inp_[1]>inp_[0]:\r\n count=inp_[0]\r\nelse:\r\n count=inp_[1]\r\nstring=\"\"\r\n \r\nfor i in range(count):\r\n if i%2==0:\r\n string+=\"A\"\r\n else:\r\n string+=\"M\"\r\nif string[count-1]==\"A\":\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "a=list(map(int,input().split()))\r\nminR=min(a)\r\nif minR%2==1:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')\r\n\r\n", "n,m = tuple(map(int,input().split()))\r\nans = 0\r\nc = 0\r\nbr = n*m\r\nwhile(ans != br):\r\n ans += n+m-1\r\n n = n - 1\r\n m = m - 1\r\n c += 1\r\nif(c%2 == 0):\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "# https://codeforces.com/problemset/problem/451/A\r\n\r\nn,m=map(int,input().split(' '))\r\nprint('Malvika' if min(n,m)%2==0 else 'Akshat')", "a,b=map(int,input().split())\r\nc=min(a,b)\r\nprint([\"Malvika\",\"Akshat\"][c%2])", "n,m= (map(int,input().split(\" \")))\r\nif(m==n):\r\n if(m%2==0):\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\nelse:\r\n if(min(n,m)%2==0):\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")", "n, m = map(int, input().split())\r\nx = min(n, m)\r\nif x % 2:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "horizontal,vertical=map(int,input().split())\r\nprint(\"Malvika\"if(min(vertical,horizontal)%2==0)else\"Akshat\")", "n,m=map(int,input().split())\r\nprint('Akshat' if min(n,m)%2!=0 else 'Malvika')", "grids = input().split()\r\nx = int(grids[0])\r\ny = int(grids[1])\r\ncount = 0\r\nwhile x >=1 and y>=1:\r\n x-=1\r\n y-=1\r\n count +=1\r\nif count %2 ==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nsmallest = 0\r\nif (n < m):\r\n smallest = n\r\nelse:\r\n smallest = m\r\nif smallest % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "a, b = map(int, input().split(' ')); print('Malvika' if min(a,b) % 2 == 0 else('Akshat'))", "n, m = map(int, input().split())\r\nprint(\"Malvika\") if min(n, m) % 2 == 0 else print(\"Akshat\")", "v1,v2 = map(int, input().split())\r\nif v1>v2:v1=v2\r\nif v1%2== 0:print(\"Malvika\")\r\nelse:print(\"Akshat\")\r\n", "str1 = input().split()\r\nstr1 = [int(s) for s in str1]\r\nminemam = min(str1)\r\nif minemam % 2 == 0 : print (\"Malvika\")\r\nelse : print(\"Akshat\")", "n, m = (int(i) for i in input().split())\nres = \"Akshat\" if min(n, m) & 1 == 1 else \"Malvika\"\nprint(res)\n", "\r\nimport math as mth\r\nimport sys\r\n#input=sys.stdin.readline\r\n\r\n\r\n\r\ndef solve():\r\n \r\n #n=int(input())\r\n n,m=list(map(int,input().split()))\r\n #f=list(map(int,input().split()))\r\n if min(n,m)&1==0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\n return\r\n\r\ndef main():\r\n #for _ in range(int(input())):\r\n solve()\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "def main() -> None :\r\n print(winner(*user_Inputs()))\r\n\r\n\r\ndef winner(horizonal_stick_count:int, vertical_stick_count: int) -> str :\r\n return (\"Malvika\" if min(horizonal_stick_count, vertical_stick_count) % 2 == 0 else \"Akshat\")\r\n\r\n\r\ndef user_Inputs() -> list[int] :\r\n return input_Array()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "L1 = [int(x) for x in input().split(\" \")]\r\nL2=[]\r\nL3=[]\r\n#print(L1[0])\r\n#print(L1[1])\r\nfor i in range(0,L1[0]):\r\n for j in range (0,L1[1]):\r\n L3=[i,j]\r\n \r\n L2.append(L3)\r\n \r\n\r\nctr=0\r\n\r\nfor i in L2:\r\n if i[0]==i[1]:\r\n ctr=ctr+1\r\nif ctr%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "x , y = map(int,input().split())\r\na = min(x,y)\r\nif a%2 == 0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')\r\n", "n, m = map(int, input().split())\nmini = min(n, m)\nif mini % 2 != 0: print(\"Akshat\")\nelse: print(\"Malvika\")\n\t\t \t \t \t \t\t \t \t \t\t\t\t", "n,m = map(int, input().split())\r\nprod=n*m\r\ncount=0\r\nwhile prod>0:\r\n n=n-1\r\n m=m-1\r\n prod=n*m\r\n count+=1\r\nif count%2==1:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')", "N, M = map(int, input().split()); C = 0\r\nwhile N > 0 and M > 0: N -= 1; M -= 1; C = 1 - C\r\nprint(\"Malvika\" if C == 0 else \"Akshat\")\r\n", "n,m=[int(x) for x in input().split()]\r\nif min (n,m)%2: print ('Akshat')\r\nelse:print('Malvika')", "# ███╗ ██╗ ███╗ ███╗ ███╗ ██╗ ███╗ ███╗\r\n# ████╗ ██║ ████╗ ████║ ████╗ ██║ ████╗ ████║\r\n# ██╔██╗██║ ██╔████╔██║ ██╔██╗██║ ██╔████╔██║\r\n# ██║╚████║ ██║╚██╔╝██║ ██║╚████║ ██║╚██╔╝██║\r\n# ██║ ╚███║ ██║ ╚═╝ ██║ ██║ ╚███║ ██║ ╚═╝ ██║\r\n# ╚═╝ ╚══╝ ╚═╝ ╚═╝ ╚═╝ ╚══╝ ╚═╝ ╚═╝\r\n\r\n\r\nn,m = [int(x) for x in input().split()]\r\ntotal = n*m\r\ncnt=0\r\nwhile total !=0:\r\n total -= ((n - 1) + (m - 1) + 1)\r\n n-=1\r\n m-=1\r\n cnt+=1\r\nif cnt %2:\r\n print(\"Akshat\")\r\nelse:\r\n print('Malvika')\r\n", "n, m = map(int, input().split())\np = min(n, m)\nprint('Malvika' if p % 2 == 0 else 'Akshat')\n \t\t \t \t \t\t \t\t\t\t \t \t \t", "\n\n\n\n\n\nm, n = map(int, input().split())\n\npoints = m * n\n\nmn = min(m, n)\n\nif mn % 2 == 0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n\n\n\n \t\t\t \t \t\t \t\t \t\t \t\t \t\t", "x = list(map(int,input().split()))\r\nn = min(x)\r\ncount= 1\r\nwhile n !=0:\r\n n-=1\r\n if n == 0:\r\n break\r\n else:\r\n count+=1\r\n\r\nif count %2 == 0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "n,m = map(int,input().split())\r\nb = min(n,m)\r\nAkshat = 0\r\nMalvika = 0\r\nfor i in range(b):\r\n if b > 0 and i % 2 == 0:\r\n b-=1\r\n Akshat+=1\r\n elif b > 0 and i % 2 == 1:\r\n b-=1\r\n Malvika+=1\r\nif Malvika == Akshat:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "a, b = map(int, input().split())\r\nc = min(a, b)\r\n\r\nif c % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n\r\n", "print(\"MAaklsvhiakta\"[ min( map( int,input().split() ))%2::2] )", "jogada = input().split()\nminimo = min(int(jogada[0]), int(jogada[1]))\nif minimo % 2 == 0:\n print(f\"Malvika\")\nelse:\n print(f\"Akshat\")\n \t \t \t \t\t\t \t\t \t \t \t\t\t", "if min(map(int,(input().split())))%2==1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "n, m = list(map(int, input().split()))\r\ncount = \"\"\r\ntotal = [\"Akshat\", \"Malvika\"]\r\n\r\nfor i in range(min(n, m)):\r\n if i % 2 != 0:\r\n count = total[1]\r\n else:\r\n count = total[0]\r\n\r\nprint(count)", "input = list(map(int,input().split()))\nn,m = input[0],input[1]\ni,j = n,m # numero de linhas horizontais e verticais em uma iteração\nintersectPoints = i * j\nturn = 0\nwhile (intersectPoints > 0):\n intersectPoints -= (i+j-1)\n i-=1\n j-=1\n turn += 1\nif(turn % 2 == 0):\n print('Malvika')\nelse:\n print('Akshat')\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()); a=min(n,m)\r\nif a%2==0: print('Malvika')\r\nelse: print('Akshat')\r\n", "n,m=map(int,input().split())\r\nf=min(n,m)\r\nif f%2==0:\r\n print('Malvika')\r\nelif f%2!=0:\r\n print('Akshat')", "s = input().split()\r\n\r\nn = int(s[0])\r\n\r\nm = int(s[1])\r\n\r\nfor i in range(1, n*m+1):\r\n\r\n\tn -= 1\r\n\r\n\tm -= 1\r\n\r\n\tif n == 0 or m ==0:\r\n\r\n\t\tbreak\r\n\r\nif i % 2 == 0:\r\n\r\n\tprint('Malvika')\r\n\r\nelse:\r\n\r\n\tprint('Akshat')", "n,m =map(int,input().split())\r\nprint(\"Akshat\" if min(n,m)%2==1 else \"Malvika\")\r\n", "n, m = map(int, input().split())\r\n\r\n# Determine the minimum of n and m\r\nmin_sticks = min(n, m)\r\n\r\n# Akshat starts the game, so if the minimum of n and m is odd, he wins\r\nif min_sticks % 2 == 1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")\r\n", "import math\nimport heapq\nimport sys\n\ndef input_arr():\n arr = [int(x) for x in input_string().split()]\n return arr\n\ndef input_n():\n n = int(input_string())\n return n\n\ndef sub_list(a,b):\n c = []\n for i in range(len(a)):\n c.append(a[i]-b[i])\n return c\n\ndef sub_const(a, c):\n b = []\n for x in a:\n b.append(x-c)\n return b\n\ndef binary_search(arr, low, high, x):\n if high >= low:\n mid = (high + low) // 2\n if arr[mid] == x:\n return mid\n elif arr[mid] > x:\n return binary_search(arr, low, mid - 1, x)\n else:\n return binary_search(arr, mid + 1, high, x)\n else:\n return -1\n \ndef printlist(a):\n for x in a:\n print(x, end = \" \")\n\ndef input_string():\n global mode\n if mode==0:\n return input()\n else:\n with open('/Users/aryan/Desktop/cp/test_case.txt') as f:\n lines = f.readlines()\n global line \n st = lines[line][:-1]\n line+=1\n return st\n \ndef is_prime(n):\n for i in range(2, int(math.sqrt(n)+1)):\n if n%i==0:\n return False\n return True\n\ndef solve():\n a, b = input_arr()\n print(\"Malvika\" if min(a,b)%2==0 else \"Akshat\")\n\n\n \n\n\ndef solve_t():\n t = input_n()\n for l in range(t):\n n = input_n()\n st = input_string()\n if n%2==1:\n print(-1)\n else:\n arr = []\n ans = 0\n repeat = []\n repeat_dict = {}\n for i in range(n//2):\n if st[i]==st[-1-i]:\n repeat.append(st[i])\n else:\n arr.append([st[i], st[-1-i]])\n repeat.sort()\n for k1 in repeat:\n if k1 not in repeat_dict.keys():\n if len(repeat_dict)==0:\n repeat_dict[k1]=1\n else:\n for k in repeat_dict.keys():\n repeat_dict[k]-=1\n if repeat_dict[k]==0:\n del repeat_dict[k]\n arr.append([k, k1])\n arr.append([k, k1])\n ans+=1\n break\n else:\n repeat_dict[k1]+=1\n \n cnt = 0\n\n for k,v in repeat_dict.items():\n letter = k\n cnt = v\n \n ans+=cnt\n if cnt>0:\n for x in arr:\n if x[0]!=letter and x[1]!=letter:\n cnt-=1\n if cnt==0:\n break\n \n if cnt==0:\n print(ans)\n else:\n print(-1)\n\n\n\n \n \n\n\nline = 0 \nmode = 0\nif len(sys.argv)>1 and sys.argv[1]=='file':\n mode = 1\nsolve()", "n, m = map(int, input().split())\r\n\r\np = \"Akshat\"\r\n\r\nwhile n != 1 and m != 1:\r\n n -= 1\r\n m -= 1\r\n\r\n if p == \"Akshat\":\r\n p = \"Malvika\"\r\n else:\r\n p = \"Akshat\"\r\n\r\nprint(p)", "n,m=map(int,input().split())\r\nprint([\"Malvika\",\"Akshat\"][min(n,m)%2])\r\n", "import math\r\nfrom sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque, namedtuple\r\nfrom bisect import bisect_right, bisect_left\r\nfrom typing import List, DefaultDict\r\n\r\n \r\n \r\ndef readarray(typ):\r\n return list(map(typ, stdin.readline().split()))\r\n \r\ndef readint():\r\n return int(input())\r\n\r\n\r\nn, m = readarray(int)\r\n\r\n\r\nif n > m:\r\n n, m = m, n\r\n\r\nif n % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "def f(a,b):\r\n ans = 1\r\n names = [\"Akshat\", \"Malvika\"]\r\n while a*b > 0:\r\n ans = (ans+1)%2\r\n a-=1\r\n b-=1 \r\n return names[ans]\r\na,b = [int(num) for num in input().split()]\r\nprint(f(a,b))", "a,b=map(int,input().split()) \r\nif a==b and ((a+b)/2)%2==0 :\r\n print(\"Malvika\") \r\nelif a==b and ((a+b)/2)%2!=0 :\r\n print (\"Akshat\")\r\nif a!=b : \r\n if (a+b)%2==0 : \r\n if (min(a,b)%2!=0):\r\n print (\"Akshat\") \r\n if min(a,b)%2==0 :\r\n print(\"Malvika\")\r\n if (a+b)%2!=0 : \r\n if ((a+b-1)/2)%2==0 :\r\n print(\"Malvika\") \r\n if ((a+b-1)/2)%2!=0 :\r\n print (\"Akshat\")", "n,m = list(map(int,input().split()))\r\ni = 0 \r\nif n > m:\r\n i = m\r\nelse:\r\n i = n\r\nif i % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int,input().split())\r\na = 0\r\nif n <= m :\r\n a = n\r\nelse :\r\n a = m\r\nif a % 2 == 0 :\r\n print(\"Malvika\")\r\nelse :\r\n print(\"Akshat\")", "n,m=map(int,input().split())\r\ntotal=n*m\r\nk=min(n,m)\r\nif k%2!=0:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')", "n,m = map(int,input().split())\r\nprint('Akshat' if min(n,m)%2==1 else 'Malvika')", "n , m = map(int,input().split())\r\npur = min(n,m)\r\nif pur %2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "import sys\r\nimport math\r\nimport bisect\r\nimport re\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef main():\r\n #length = int(input())\r\n #string = input()\r\n ans = 0\r\n #numbers = [*map(int, input().split())]\r\n n, m = [*map(int, input().split())]\r\n print([\"Malvika\",\"Akshat\"][min(n,m)%2])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "a, b = map(int, input().split())\r\nif a > b:\r\n a = b\r\nif a % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "n, m = [int(i) for i in input().split()]\r\nif min(m,n) %2 ==0 : \r\n print(\"Malvika\")\r\nelse : \r\n print(\"Akshat\")", "n, m = [int(x) for x in input().split()]\r\nif min(n,m)%2: print('Akshat')\r\nelse: print('Malvika')", "n,m=map(int,input().split())\r\na=m*n\r\ni=0\r\ndp=0\r\nwhile a>0:\r\n a-=(m+n-1-i)\r\n i+=2\r\n dp+=1\r\nif dp%2!=0:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')", "a = [int(x) for x in input().split()]\r\nn = min(a)\r\nif n%2 == 0:\r\n print(\"Malvika\")\r\nelse: print(\"Akshat\")", "a, b = map(int, input().split())\r\nprint([\"Akshat\",\"Malvika\"][min(a, b) % 2 == 0])", "s = [int(x) for x in input().split()]\n\nif min(s) % 2 == 0:\n print('Malvika')\nelse:\n print('Akshat')\n\t \t \t\t\t\t \t \t\t\t\t \t\t\t \t \t\t\t", "print(\"Akshat\" if min(map(int, input().split())) & 1 else \"Malvika\")\n\t\t \t\t\t \t \t\t \t\t \t\t\t \t \t", "a=list(map(int,input().split()))\r\na.sort()\r\nif a[0]%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "import sys\r\ninp = sys.stdin.readline\r\n\r\ndef game(x, y):\r\n z = min(x, y)\r\n if z % 2 == 0:\r\n return 'Malvika'\r\n else:\r\n return 'Akshat'\r\ndef main():\r\n x, y = list(map(int, inp().strip().split()))\r\n result = game(x, y)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "nm=[int(_) for _ in input().split()]\r\ns=min([nm[0],nm[1]])\r\nif s&1==1:\r\n print('Akshat')\r\nelse:\r\n print('Malvika') ", "n,m=[int(x) for x in input().split()]\r\n\r\nc=min(n,m)\r\n\r\nif c%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n\r\n", "s= input().split(\" \")\r\nm = int(s[0])\r\nn = int(s[1])\r\nif min(m,n) % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int, input().split())\r\nprint([\"Akshat\", \"Malvika\"][min(n,m) % 2 == 0])", "n, m = map(int, input().split())\r\n\r\n# The minimum of n and m determines the number of sticks that can be removed\r\n# Each player will take turns removing one stick\r\n# The player who removes the last stick wins\r\n# If the number of sticks that can be removed is even, Malvika wins\r\n# If the number of sticks that can be removed is odd, Akshat wins\r\n\r\n# Calculate the number of sticks that can be removed\r\nsticks_to_remove = min(n, m)\r\n\r\n# Determine the winner based on the number of sticks that can be removed\r\nif sticks_to_remove % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "def case(n,m):\r\n if n==m:\r\n if n%2==0:\r\n return \"Malvika\"\r\n return \"Akshat\"\r\n count=0\r\n for i in range(min(n,m)):\r\n if n!=0 and m!=0:\r\n n=n-1\r\n m=m-1\r\n count+=1\r\n if count==0 or count%2!=0:\r\n return \"Akshat\"\r\n return \"Malvika\"\r\ndef main():\r\n n,m=map(int,input().split())\r\n print(case(n,m))\r\nmain()", "nm = list(map(int, input().split(\" \")))\r\nres = min(nm)\r\nprint(\"Akshat\" if res&1 else \"Malvika\")", "m, n = ((int)(x) for x in input().split(\" \"))\r\nx = min(m, n)\r\nif x*x%2==1:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')\r\n", "def sol():\r\n a,b=map(int,input().split())\r\n if min(a,b)%2==0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\n \r\n \r\n\r\nsol()\r\n\r\n", "a, b = map(int, input().split())\r\nprint(\"Akshat\" if (min(a,b)%2) else \"Malvika\")", "x,y=map(int,input().split())\nmini=min(x,y)\nif mini%2==0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")", "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, m = map(int, input().split())\n if min(n, m) % 2 == 0:\n print(\"Malvika\")\n else:\n print(\"Akshat\")\n\n\nif __name__ == \"__main__\":\n main()\n", "n,m=map(int,input().split())\r\nif min(m,n)&1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")", "a=input().split()\r\nb=[]\r\nfor i in a:\r\n b.append(int(i))\r\nif min(b)%2==0:\r\n print('Malvika')\r\nelse:\r\n print('Akshat')", "row, col = [int(i) for i in input().split()]\r\n\r\ngrid = []\r\n\r\nfor r in range(row):\r\n grid.append([1 for i in range(col)])\r\n\r\nplayer = \"Malvika\"\r\n\r\nfor r in range(row):\r\n for c in range(col):\r\n if grid[r][c] == 1:\r\n if player == \"Akshat\":\r\n player = \"Malvika\"\r\n else:\r\n player = \"Akshat\"\r\n\r\n for r1 in range(row):\r\n grid[r1][c] = 0\r\n for c1 in range(col):\r\n grid[r][c1] = 0\r\n\r\n# print(grid)\r\nprint(player)", "n,m = input().split()\r\nn = int(n)\r\nm = int(m)\r\ncount = 0\r\nwhile (n>1 and m>1):\r\n count += 1\r\n n -= 1\r\n m -= 1\r\ncount += 1\r\nif(count%2 == 0):\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "print([\"Malvika\",\"Akshat\"][min(map(int,input().split()))%2])", "m, n = map(int, input().split())\r\na = m * n\r\nif m > n:\r\n b = a // m\r\nelse:\r\n b = a // n\r\nif b % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "n, m = map(int, input().split())\r\n\r\n# Calculate the minimum number of sticks that can be removed\r\nmin_sticks = min(n, m)\r\n\r\n# The winner will be the player who removes the last stick\r\n# If the minimum number of sticks is even, Malvika wins\r\n# Otherwise, Akshat wins\r\nif min_sticks % 2 == 0:\r\n winner = \"Malvika\"\r\nelse:\r\n winner = \"Akshat\"\r\n\r\nprint(winner)\r\n", "n, m = map(int, input().split())\r\n\r\nif min(m, n) % 2 == 1:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")\r\n ", "n, m = map(int, input().split())\r\nprint([\"Malvika\", \"Akshat\"][min(n, m) % 2 == 1])\r\n", "n, m = map(int, input().split())\r\nif (n>=m and m%2 == 0) or (m>=n and n%2 == 0):\r\n print('Malvika')\r\nelse:\r\n print('Akshat')\r\n", "n ,m = map(int,input().split())\n\nmini = min(n,m)\n\nif mini%2==0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n\n\n\n\n\t\t\t \t\t \t\t \t \t\t\t \t\t\t\t \t", "x, y = [int(num) for num in input().split()]\r\nminnum = min(x, y)\r\nif minnum % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n = list(map(int,input().split()))\r\na = min(n)\r\nif a%2 == 0:\r\n print(\"Malvika\")\r\n \r\nelse :\r\n print(\"Akshat\")", "rows, columns = input().split()\r\nrows, columns = int(rows), int(columns)\r\nno_of_steps = 0\r\nwhile rows >= 1 and columns >= 1:\r\n rows -= 1; columns -= 1\r\n no_of_steps += 1\r\nif no_of_steps % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m=map(int,input().split())\r\nif min([n,m])%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n,m =input().split()\r\nif int(n)<= int(m):\r\n if int(n)%2 == 0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\nelse:\r\n if int(m)%2 == 0:\r\n print(\"Malvika\")\r\n else:\r\n print(\"Akshat\")\r\n", "a = list(map(int,input().split()))\r\n\r\nb = min(a[0],a[1])\r\n\r\nif b%2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "x, y = list(map(int, input().split(\" \")))\r\nz = min(x, y)\r\nif z % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n", "n,m=map(int,input().split())\r\nk=n+m\r\nvv=n*m\r\nc=0\r\nb=1\r\nwhile vv!=0:\r\n if c==0:\r\n c=1\r\n elif c==1:\r\n c=0\r\n if b==0:\r\n b=1\r\n elif b==1:\r\n b=0\r\n n-=1\r\n m-=1\r\n vv=m*n\r\nif b:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")\r\n\r\n", "n, m = list(int(num) for num in input().split())\r\n\r\nif n <= m:\r\n if n % 2 == 0:\r\n print('Malvika') \r\n else:\r\n print('Akshat')\r\nelse:\r\n if m % 2 == 0:\r\n print('Malvika') \r\n else:\r\n print('Akshat')", "z= []\r\nz[0:] = map(int,input().split())\r\nx = z[0]\r\ny =z[1]\r\nsumofindex = z[0] * z[1]\r\ni = 0\r\nwhile(sumofindex != 0):\r\n sumofindex -= x+(y-1)\r\n x-=1\r\n y-=1\r\n i+=1\r\n\r\nif(i%2 == 0):\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "a,m=map(int,input().split());x=min(a,m)\r\nif x%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int, input().split())\r\nallInter = n*m\r\nwinner = \"Akshat\"\r\ni = 0\r\nwhile (allInter > 0):\r\n allInter -= n+m-1\r\n n -= 1\r\n m -= 1\r\n if (i % 2 != 0):\r\n winner = \"Malvika\"\r\n else:\r\n winner = \"Akshat\"\r\n i += 1\r\nprint(winner)\r\n", "arr = list(map(int,input().split()))\n\narr.sort()\n\nif arr[0]%2==0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")", "input_list=list(map(int,input().split()))\r\ni=min(input_list[0],input_list[1])\r\nif i%2==0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "m,n=map(int,input().split())\r\nif min(n,m)%2==1:\r\n print('Akshat')\r\nelse:\r\n print('Malvika')", "a,b = map(int,input().split())\r\nif min(a,b) % 2 == 0:\r\n\tprint('Malvika')\r\nelse:\r\n\tprint('Akshat')", "n, m = input().split(\" \")\nn = int(n)\nm = int(m)\n\nif(n <= m):\n if(n % 2 == 0):\n print(\"Malvika\")\n else:\n print(\"Akshat\")\nelse:\n if(m % 2 == 0):\n print(\"Malvika\")\n else:\n print(\"Akshat\")\n\n\t\t\t\t \t \t \t\t\t \t\t \t \t\t \t", "def find_winner(n, m):\n total_sticks = min(n,m)\n if total_sticks % 2 == 0:\n return \"Malvika\"\n else:\n return \"Akshat\"\n\nn, m = map(int, input().split())\n\nwinner = find_winner(n, m)\n\nprint(winner)\n\t \t\t \t \t\t\t \t \t \t\t \t \t \t", "a,b = map(int,input().split())\r\n\r\nif (a>b):\r\n a=b;\r\nif a%2==0:\r\n print(\"Malvika\")\r\nelse: print(\"Akshat\")", "n,m = map(int,input().split())\nmins = min(m,n)\nif mins % 2 == 0:\n print('Malvika')\nelse:\n print('Akshat')\n", "nums = list(map(int,input().split()))\r\nprint(\"Malvika\" if min(nums) % 2 == 0 else \"Akshat\")", "n, m = map(int, input().split())\r\n\r\n# Find the minimum of n and m\r\nmin_sticks = min(n, m)\r\n\r\n# Determine the winner based on the parity of the minimum\r\nif min_sticks % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int, input().split())\r\nmas = ['Malvika', 'Akshat']\r\nprint(mas[(min(n, m)) % 2])", "n, m = [int(x) for x in input().split()]\r\ncounter = 0\r\n\r\nwhile True:\r\n if (n - 1) * (m - 1) == 0:\r\n break\r\n n = n - 1\r\n m = m - 1\r\n counter += 1\r\n\r\nif counter % 2 == 0:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")\r\n", "m=list(map(int,input().split()));print(\"Akshat\" if min(m)%2 else \"Malvika\")", "n,m = map(int,input().split())\r\np = min(m,n)\r\nif p % 2 == 0:\r\n print(\"Malvika\")\r\nelse:\r\n print(\"Akshat\")", "n, m = map(int, input().split())\r\na = False\r\nif min(n, m) & 1:\r\n a = True\r\nif a:\r\n print(\"Akshat\")\r\nelse:\r\n print(\"Malvika\")\r\n", "a,b = input().split()\na = int(a)\nb = int(b)\nif min([a,b]) %2==1:\n print('Akshat')\nelse:\n print('Malvika')\n\t \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\nd=x if x<y else y\r\nif d%2==0:print(\"Malvika\")\r\nelse:print(\"Akshat\")", "n,m=tuple(map(int,input().split()))\r\na=min(n,m)\r\nprint('Malvika' if a%2==0 else 'Akshat')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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 = map(int, input().split(' '))\n\ni = 0\nwhile True:\n i += 1\n n -= 1\n m -= 1\n # print(n, m)\n if n < 1 or m < 1: \n if i % 2 == 0: \n # A's move\n print(\"Malvika\")\n break\n else:\n print(\"Akshat\")\n break\n # B's move\n\n\n\n\n\n # if you are left with 2x2 you lose\n # becuase in the next move the oponent has only one option and leaves you with none", "n, m = map(int, input().split())\r\nprint('Akshat' if min(n, m) % 2 == 1 else 'Malvika')\r\n", "x = list(map(int,input().split()))\r\ninter = x[0]*x[1]\r\ncount= 1\r\nwhile inter !=0:\r\n point = x[1]+x[0]\r\n inter -= (point-1)\r\n x[0] -=1\r\n x[1] -=1\r\n count +=1\r\n\r\ncount -=1\r\nif inter == 0 and count%2 == 0:\r\n print('Malvika')\r\nelif inter ==0 and count%2 == 1:\r\n print('Akshat')\r\n", "nums = str(input()).split(\" \")\nn = int(nums[0])\nm = int(nums[1])\nmenor = n\ncontador = 0\nif m<n:\n menor = m\nfor i in range(menor):\n contador += 1 \nif contador % 2 ==0:\n print(\"Malvika\")\nelse:\n print(\"Akshat\")\n \t\t\t\t \t\t\t\t \t\t\t \t \t\t \t \t\t\t\t", "n, m = map(int, input().split(' '))\r\na = min(n, m)\r\nif a % 2 == 0:\r\n print('Malvika')\r\nif a % 2 == 1:\r\n print('Akshat')\r\n", "n, m = map(int, input().split())\r\nif min(n, m) % 2 == 1:\r\n winner = \"Akshat\"\r\nelse:\r\n winner = \"Malvika\"\r\nprint(winner)", "def Solve():\r\n n, m = map(int, input().split())\r\n \r\n if n > m:\r\n print((\"Malvika\", \"Akshat\")[m % 2])\r\n else:\r\n print((\"Malvika\", \"Akshat\")[n % 2])\r\n \r\nif __name__ == '__main__':\r\n Solve()", "\r\nlines = [eval(x) for x in input().split()]\r\n\r\nif min(lines)%2 == 0:\r\n print('Malvika')\r\nelse:\r\n print(\"Akshat\")", "#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,m=map(int,input().split())\r\na=min(m,n)\r\nif a%2:\r\n print('Akshat')\r\nelse:print('Malvika')\r\n\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" ]

[ "import sys\nn=int(input())\na=list(map(int,input().split()))\nM=10**9+1\ng={}\nfor i in range(n):\n g[a[i]]=g.get(a[i],[])+[i]\np=[1]\nfor i in range(n):\n p+=[hash(M*p[-1])]\nh=[0]*(n+1)\nfor i in range(n):\n h[i+1]=hash(h[i]*M+a[i])\ngh=lambda k,l:hash(h[k+l]-h[k]*p[l])%sys.hash_info.modulus\ni,t=0,0\nwhile i < n:\n for j in g[a[i]]:\n if j <= i:\n continue\n w=j-i\n if j+w<=n and gh(i,w)==gh(j,w):\n i=j-1\n t=max(t,j)\n break\n i+=1\nr=a[t:]\nprint(len(r))\nprint(*r)\n" ]

[ "n=int(input())\r\nmh=sh=-10**7\r\nml=sl=10**7\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n m=a+b\r\n s=a-b\r\n mh=max(mh,m)\r\n ml=min(ml,m)\r\n sh=max(sh,s)\r\n sl=min(sl,s)\r\nprint(mh-ml+sh-sl+4)\r\n" ]

[ "n,m,c=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nfor i in range(n-m+1):\r\n for j in range(m):\r\n a[j+i]+=b[j]\r\n a[j+i]%=c\r\nprint(*a)", "n, m, c = map(int, input().split())\r\ndata = list(map(int, input().split()))\r\nkeys = tuple(map(int, input().split()))\r\nfor i in range(n - m + 1):\r\n for j in range(m):\r\n data[i + j] += keys[j]\r\n data[i + j] %= c\r\nprint(*data)", "n, m, c = map(int, input().split())\r\n\r\nN = list(map(int, input().split()))\r\nM = list(map(int, input().split()))\r\n\r\nSM = [0]\r\n\r\nfor v in M:\r\n SM += [SM[-1] + v]\r\n \r\nanswer = []\r\nfor i, v in enumerate(N):\r\n if i + len(M) < len(N):\r\n l = 0\r\n else:\r\n l = len(M) - len(N) + i\r\n \r\n if i < len(M):\r\n r = i\r\n else:\r\n r = len(M) - 1\r\n\r\n answer += [(N[i] + SM[r+1] - SM[l]) % c]\r\n\r\nprint(\" \".join(map(str, answer))) ", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn,m,c=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\n\r\n\r\nprefsum=[0]\r\n\r\nfor j in range(m): prefsum.append(prefsum[-1]+b[j])\r\nans=[]\r\nfor i in range(n):\r\n \r\n ans.append(prefsum[min(m,i+1)]-prefsum[max(0,i-(n-m))]+a[i])\r\nfor ele in ans:\r\n print(ele%c,end=\" \")", "L = lambda : list(map(int, input().split()))\r\n\r\nn, m, c = L()\r\na = L()\r\nb = L()\r\n\r\nfor i in range(n - m + 1):\r\n for j in range(m):\r\n a[i + j] += b[j]\r\n\r\n a[i + j] %= c\r\n\r\na = list(map(str, a))\r\nprint(\" \".join(a))", "import sys\nfrom itertools import *\nfrom math import *\ndef solve():\n n,m,c = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n for i in range(n - m + 1):\n for j in range(m):\n a[j + i] += b[j]\n a[j + i] %= c\n print(' '.join(map(str, a)))\n\n\n\n\n\n\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "\r\n\r\nimport sys, collections, heapq, math\r\nreadline = sys.stdin.readline\r\n \r\n \r\n \r\n# [a, a + b, a + b + c]\r\n# [c, b, a]\r\n# [c, b + c, a + b + c]\r\ndef solve(A, B, c):\r\n s = 0\r\n n = len(A)\r\n for i in range(n):\r\n if i < len(B):\r\n s += B[i]\r\n if i >= (n - m + 1):\r\n s -= B[i - n + m - 1]\r\n A[i] = (A[i] + s) % c\r\n return A\r\n\r\nn, m, c = list(map(int, readline().split()))\r\n \r\nprint(*solve(list(map(int, readline().split())), list(map(int, readline().split())), c))\r\n \r\n\r\n\r\n\r\n\r\n", "L = lambda: list(map(int, input().split()))\r\n\r\nn, m, c = L()\r\nA, B = L(), L()\r\n\r\nfor i in range(n-m+1):\r\n for j in range(i, i+m):\r\n A[j] += B[j-i]\r\n A[j] %= c\r\n\r\nprint(*A)", "n , m , c = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nadd = [0]*(100050)\r\nfor i in range(0,m):\r\n\tadd[i] += b[i]\r\n\tadd[n-m+i+1] -= b[i]\r\nfor i in range(0,n):\r\n\tadd[i] += add[i-1]\r\n\tprint((a[i] + add[i])%c , end = ' ')", "len_message, len_key, mod = map(int, input().split())\nmessage = list(map(int, input().split()))\nkey = list(map(int, input().split()))\n\nsum, low, high = 0, 0, 0\nresult = message[:]\nfor i in range(len_message):\n if high < len_key:\n sum += key[high]\n high += 1\n if i + len_key > len_message:\n sum -= key[low]\n low += 1\n result[i] = (result[i] + sum) % mod\n\nprint(' '.join(map(str, result)))\n", "def get_int_map(input_string):\r\n return map(int, input_string.split())\r\n\r\ndef encode(parameters: str, message: str, key: str):\r\n message_length,key_length,capacity = get_int_map(parameters)\r\n message_values = list(get_int_map(message))\r\n key_values = list(get_int_map(key))\r\n for i in range(message_length-key_length+1):\r\n for j in range(key_length):\r\n message_values[i+j] = (message_values[i+j]+key_values[j])%capacity\r\n return \" \".join(map(str, message_values))\r\n\r\nparameters = input()\r\nmessage = input()\r\nkey = input() \r\nprint(encode(parameters, message, key))", "def solve(n , m , c , a , b):\r\n\r\n for i in range(n - m + 1):\r\n for j in range(m):\r\n a[i + j] = (a[i+j]+b[j])%c\r\n\r\n a = map(str , a)\r\n return \" \".join(a)\r\n\r\nn , m , c = map(int , input().split())\r\na = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\n\r\nprint(solve(n , m , c , a , b))\r\n", "n, m, c = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nsum = 0\nx = -(n - m + 2)\n\nfor i in range(0, n):\n if i < m:\n sum += b[i]\n x += 1\n if x >= 0:\n sum -= b[x]\n a[i] = (a[i] + sum) % c\nprint(' '.join(str(i) for i in a))", "n, m, c = [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\nk = 0\r\nfor i in range(0, (n-m) + 1):\r\n for j in range(0, m):\r\n if(j + k >= n):\r\n break\r\n a[j+k] = (a[j+k] + b[j]) % c\r\n k += 1\r\na = [str(x) for x in a]\r\nprint(' '.join(a))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jul 19 19:53:47 2019\r\n\r\n@author: avina\r\n\"\"\"\r\n\r\nn,m,c = map(int, input().split())\r\n\r\nl = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nfor i in range(n-m+1):\r\n for j in range(m):\r\n l[i+j] += b[j]\r\n l[i+j] %= c\r\nprint(*l)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, c = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\nd = []\r\nq = n-m\r\nf = 0\r\nj = 0\r\nfor i in range(n):\r\n if i < m:\r\n f += s[i]\r\n if i > q:\r\n f -= s[j]\r\n j += 1\r\n d.append((w[i]+f)%c)\r\nprint(' '.join(map(str, d)))", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, m, c = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\n\r\nx = 0\r\na = n-m+1\r\nfor i in range(n):\r\n if i < m:\r\n x += q[i]\r\n if i >= a:\r\n x -= q[i-a] if i-a < m else 0\r\n w[i] = (w[i] + x)%c\r\n\r\nprint(' '.join(map(str, w)))", "n, m, c = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ns, k = 0, n - m\r\nfor i in range(n):\r\n if i < m: s += b[i]\r\n a[i] = (a[i] + s) % c\r\n if i >= k: s -= b[i - k]\r\nprint(' '.join(str(i) for i in a)) ", "n , m , c = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor i in range(0,n):\r\n\tif i + m - 1 >= n:\r\n\t\tbreak\r\n\tfor j in range(0,m):\r\n\t\ta[i + j] += b[j]\r\n\r\nfor x in a:\r\n\tprint(x % c , end = ' ')\r\n\r\n", "from collections import defaultdict\nfor _ in range(1):\n n,m,c=map(int,input().split())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n cur_sum=0\n ans=[0]*n\n for i,j in enumerate(a):\n if i<m:\n # print(':',i)\n cur_sum+=b[i]\n cur_sum%=c\n if n-i<m:\n # print(i)\n cur_sum-=b[m-1-(n-i)]\n cur_sum%=c\n ans[i]=(j+cur_sum)%c\n print(' '.join([str(i) for i in ans]) )\n\n\n\n \n ", "from xml.sax.saxutils import prepare_input_source\r\n\r\n\r\nn,m,c = map(int,input().split())\r\nsteps = n-m+1\r\nmessage = list(map(int,input().split()))\r\nkeys = list(map(int,input().split()))\r\n\r\nprefix_sum = [0]*(n+1)\r\nfor i in range(m):\r\n prefix_sum[i] += keys[i]\r\n\r\n if i + steps < n: prefix_sum[i+steps] -= keys[i]\r\nmessage[0] = (message[0] + prefix_sum[0])%c\r\nfor j in range(1,n):\r\n prefix_sum[j] += prefix_sum[j-1]\r\n message[j] = (message[j]+prefix_sum[j])%c\r\n\r\nprint(*message,sep=' ')\r\n\r\n\r\n", "x = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nl = []\r\nfor i in range(len(a)-len(b)+1):\r\n for j in range(len(b)):\r\n a[i+j] = a[i+j] + b[j]\r\nfor j in a:\r\n print(j%x[2], end=\" \")", "n, m, c = map(int, input().split(\" \"))\na = list(map(int, input().split(\" \")))\nb = list(map(int, input().split(\" \")))\n\nfor i in range(n-m+1):\n for ii in range(m):\n a[ii+i] = (a[ii+i] + b[ii])%c\n\nprint(*a)\n \t \t\t \t \t \t \t\t \t \t\t\t\t\t\t", "n,m,c = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nfor k in range(n-m+1):\r\n for i in range(k,k+m):\r\n a[i] = (a[i]+b[i-k])%c\r\nprint(*a)", "a,b,c= map(int,input().split())\r\narr= list(map(int,input().split()))\r\nbrr= list(map(int,input().split()))\r\nk=0\r\nwhile k < a-b+1:\r\n for i in range (0,a):\r\n for j in range(0,b):\r\n if j+i<a:\r\n arr[j+i]=(arr[j+i]+brr[j])%c\r\n\r\n\r\n if i+j==a-1:\r\n break\r\n k=k+1\r\n if(k>a-b):\r\n break\r\n\r\nfor i in range(0,a):\r\n print(arr[i],end=\" \")\r\n\r\n\r\n\r\n", "from email import message\r\n\r\n\r\nmsgSize, keySize, modSize = map(int, input().split())\r\n\r\nmsg = list(map(int, input().split()))\r\nkey = list(map(int, input().split()))\r\n\r\nprefix = [0 for _ in range(msgSize)]\r\n\r\nfor i in range(keySize):\r\n prefix[i] += key[i]\r\n\r\n if (i + 1 < keySize):\r\n prefix[msgSize - keySize + i + 1] -= key[i]\r\n\r\n\r\nmsg[0] = (msg[0] + prefix[0]) % modSize\r\n\r\nfor i in range(1, msgSize):\r\n prefix[i] += prefix[i-1] \r\n msg[i] = (msg[i] + prefix[i]) % modSize\r\n\r\nprint(*msg, sep=\" \")", "def main():\r\n size, keySize , modSize = map(int, input().split())\r\n message = list(map(int, input().split()))\r\n key = list(map(int, input().split()))\r\n\r\n prefix = [0 for _ in range(size)]\r\n for i in range(keySize):\r\n prefix[i] += key[i]\r\n if (i + 1 < keySize):\r\n prefix[size - keySize + i + 1] -= key[i]\r\n \r\n message[0] = (message[0] + prefix[0]) % modSize\r\n for i in range(1, size):\r\n prefix[i] += prefix[i-1]\r\n message[i] = (message[i] + prefix[i]) % modSize\r\n print(*message, sep = \" \")\r\n \r\nmain()", "import sys\n\n\ndef encryptinging_messages(n: int, m: int, c: int):\n input = sys.stdin.readline\n arr = [int(x) for x in input().split()]\n key = [int(x) for x in input().split()]\n diff = [0 for _ in range(n)]\n for i in range(m):\n left, right = i, i + n - m + 1\n diff[left] = (diff[left] - key[i]) % c\n if right < n:\n diff[right] = (diff[right] + key[i]) % c\n diff[0] = -diff[0] % c\n for i in range(1, n):\n diff[i] = (diff[i - 1] - diff[i]) % c\n for i in range(n):\n diff[i] = str((diff[i] + arr[i]) % c)\n return \" \".join(diff)\n\n\ndef main():\n n, m, c = map(int, input().split())\n print(encryptinging_messages(n, m, c))\n\n\nif __name__ == '__main__':\n main()\n", "import io, os, sys\n\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\n\n\ndef solve():\n n, m, c = map(int, input().split())\n a = list(map(int, input().split()))\n b = list(map(int, input().split()))\n for i in range(n-m+1):\n a = a[:i] + [(a[i:m+i][x] +b[x])%c for x in range(m)] + a[m+i:]\n sys.stdout.write(' '.join(str(x) for x in a) + '\\n')\n\n\n\nif __name__ == '__main__':\n solve()\n", "n,m,c = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\npre=[0]*m\r\nsuf=[0]*(m+1)\r\nans=[0]*n\r\nlp = min(m,n-m+1)\r\nj=-2\r\nfor i in range(m):\r\n pre[i]=(pre[i-1]+b[i])\r\nfor i in range(m-1,-1,-1):\r\n suf[i]=suf[i+1]+b[i] \r\nfor i in range(lp):\r\n ans[i]=(a[i]+pre[i])%c\r\nif lp==m:\r\n for i in range(lp , n-lp):\r\n ans[i]=(a[i]+pre[lp-1])%c\r\nelse: \r\n for i in range(lp , n-lp):\r\n ans[i]=(a[i]+pre[i]-pre[i-lp])%c\r\nfor i in range(n-1,n-lp-1,-1):\r\n ans[i]=(a[i]+suf[j])%c\r\n j-=1\r\nprint(*ans) \r\n", "n, m, c= map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n# print(n, b, a)\n\nfor i in range(n - m + 1):\n for j in range(i, m + i):\n a [j] = (a[j] + b[j - i]) % c\n # print(*a)\nprint(*a)\n", "n,m,c = map(int,input().split())\r\na = list(input().split())\r\nb = list(input().split())\r\n\r\nsum = 0\r\n\r\nfor i in range(n):\r\n if i<m:\r\n sum = sum + int(b[i])\r\n sum = sum%c\r\n\r\n if i >= n - m + 1:\r\n sum = c - int(b[i-n+m-1]) + sum\r\n sum = sum%c\r\n\r\n print((int(a[i])+sum)%c,end = ' ')\r\n" ]

[ "def getprfx(s):\r\n\ttab = [s[0]]\r\n\tfor i in range(1, len(s)):\r\n\t\tx = tab[i-1] + s[i]\r\n\t\ttab.append(x)\r\n\treturn tab\r\n\t\r\nn, m = input().split()\r\n\r\na, b = getprfx(n), getprfx(m)\r\nmn = a[0] + b[0]\r\nfor i in a:\r\n\tfor j in b:\r\n\t\tif i+j < mn:\r\n\t\t\tmn = i+j\r\nprint(mn)\t\t\t", "try:\r\n s = input()\r\n w1, w2 = s.split()\r\n t = w2[0]\r\n done = False\r\n for i in range(1, len(w1)):\r\n if w1[i] >= t:\r\n done = True\r\n break\r\n print((w1 if not done else w1[:i]) + t)\r\n\r\nexcept Exception as e:\r\n print(e)", "A, B = input().split()\r\nans = \"\"\r\nans+=A[0]\r\nfor i in range(1,len(A)):\r\n if (A[i] < B[0]):\r\n ans+=A[i]\r\n else :\r\n break ;\r\nans += B[0]\r\nprint(ans)\r\n", "def main():\r\n s = input().split()\r\n f, l = s[0], s[-1]\r\n\r\n name = list()\r\n for i in range(1, len(f) + 1):\r\n for j in range(1, len(l) + 1):\r\n name.append(f[:i] + l[:j])\r\n name.sort()\r\n print(name[0])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s1, s2 = input().split()\r\nv = [s1[:i+1] + s2[:j+1] for i in range(len(s1)) for j in range(len(s2))]\r\nv.sort()\r\nprint(v[0])\r\n", "# m, n = map(lambda v: int(v), input().split())\r\n# n = int(input())\r\n\r\na, b = input().split()\r\nl = list()\r\nfor i in range(1, len(a)+1):\r\n for j in range(1, len(b)+1):\r\n l.append(a[:i]+b[:j])\r\n\r\nprint(min(l))\r\n\r\n\r\n", "N = list(map(str, input().split()))\r\nfn, ln = str(N[0]), str(N[1])\r\nun = \"\"\r\nflag = 0\r\ni = 1\r\nun = un + fn[0]\r\nwhile i < len(fn):\r\n if fn[i] < ln[0]:\r\n un = un + fn[i]\r\n i = i + 1\r\n else:\r\n un = un + ln[0]\r\n flag = 1\r\n break\r\nif flag == 0:\r\n un = un + ln[0]\r\n print(un)\r\nelse:\r\n print(un)\r\n", "def main():\n\tfirst, last = input().split()\n\tpassword = first[0]+last[0]\n\n\tfor i in range(1, len(first)):\n\t\tnew =first[0:i+1]+last[0]\n\t\tif new<password:\n\t\t\tpassword = (first[0:i+1]+last[0])\n\tfor i in range(1,len(last)):\n\t\tif password+last[i]<password:\n\t\t\tpassword = password+last[i]\n\tprint(password)\n\n\treturn 1\n\nif __name__ == '__main__':\n\tmain()", "s1,s2=input().split()\nans=s1[0]\nfor j in s1[1:]:\n\tif j<s2[0]:\n\t\tans=ans+j\n\telse:\n\t\tbreak\nans+=s2[0]\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns, t = input().rstrip().decode().split()\r\nu = []\r\nx = \"\"\r\nfor i in s:\r\n x += i\r\n y = \"\"\r\n for j in t:\r\n y += j\r\n u.append(x + y)\r\nans = min(u)\r\nprint(ans)", "fn, ln = input().split()\nlogin = fn[0]\nfor p in range(1, len(fn)):\n if fn[p] < ln[0]:\n login += fn[p]\n else:\n break\nlogin += ln[0]\n\nprint(login)\n\n\t\t \t \t \t \t\t\t \t\t\t \t \t\t \t \t", "f,s = input().split()\r\nl = f[0]\r\nfor c in f[1:]:\r\n\tif c >= s[0]: break\r\n\tl += c\r\nprint(l + s[0]);\r\n", "a, b = input().split()\r\nf=1\r\nans=''\r\nfor i in range(1, len(a)):\r\n if ord(a[i]) >= ord(b[0]):\r\n ans=a[0:i] + b[0]\r\n f=0\r\n break\r\nif(f==0):\r\n print(ans)\r\nelse:\r\n print(a + b[0])", "s1, s2 = input().split()\ni = 1\nprint(s1[0],end='')\nwhile i< len(s1) and s2[0] > s1[i]:\n print(s1[i],end='')\n i+=1\nprint(s2[0])", "getInputList = lambda : list(input().split())\ngetInputIntList = lambda : list(map(int,input().split()))\narr = getInputList()\na = []\n\nfor i in range(len(arr[0])):\n\tfor j in range(len(arr[1])):\n\t\ta.append(arr[0][0:i+1]+arr[1][0:j+1])\t\t\n\na.sort()\nprint(a[0])", "x=input().split()\r\na=x[0][0]\r\nfor i in range(1, len(x[0])):\r\n if(x[0][i]<x[1][0]):\r\n a+=x[0][i]\r\n else:\r\n break\r\na+=x[1][0]\r\nprint(a)\r\n", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\na, b = [i for i in input().split()]\r\nans = a[0]\r\nfor i in a[1:]:\r\n if(i < b[0]):\r\n ans += i\r\n else:\r\n break\r\nans += b[0]\r\nprint(ans)", "s = input().split(' ')\r\nresult = s[0][0]\r\nend = s[1][0]\r\n\r\nfor i in range(1, len(s[0])):\r\n\tif ord(s[0][i]) < ord(end):\r\n\t\tresult += s[0][i]\r\n\telse:\r\n\t\tbreak\r\nresult += end\r\nprint(result)\r\n", "a,b = input().split()\r\n\r\ns = 'zzzzzzzzzzzzzzzzz'\r\n\r\nfor i in range(1,len(a)+1):\r\n\r\n for j in range(1,len(b)+1):\r\n\r\n if a[:i]+b[:j] < s:\r\n\r\n s = a[:i]+b[:j]\r\n\r\nprint(s)", "b=list(input().split(\" \"))\r\na=b[0]\r\nk=0\r\nc=b[1][0]\r\nfor i in range(1,len(a)):\r\n if a[i]<c:\r\n k+=1\r\n else:\r\n break\r\nprint(a[:k+1]+c) \r\n", "a=input()\r\nx=a.find(' ')\r\ns=a[0]\r\n#print(x)\r\nz=0\r\nfor i in range(1,x):\r\n #print(a[i],a[x+1])\r\n if ord(a[i]) < ord (a[x+1]):\r\n s+=a[i]\r\n else:\r\n s+=a[x+1]\r\n z=1\r\n break\r\nif z == 0:\r\n s+=a[x+1]\r\nprint(s)\r\n ", "a, b = input().split()\r\nv = []\r\nfor i in range(len(a)):\r\n v.append(a[:i+1]+b[0])\r\nv.sort()\r\nprint(v[0])", "l=[]\r\ns=input()\r\nw=s.split()\r\nfor i in range (1,len(w[0])+1):\r\n for j in range (1,len(w[1])+1):\r\n x=w[0][:i]+w[1][:j]\r\n l.append(x)\r\nl.sort()\r\nprint(l[0])\r\n\r\n", "a,b = input().split()\r\nc = 0\r\na = list(a)\r\nb = list(b)\r\ntick1 = 1\r\ntick2 = 0\r\nout = a[0]\r\nwhile tick1 < len(a):\r\n if a[tick1] < b[tick2]:\r\n out = out + a[tick1]\r\n tick1 = tick1 + 1\r\n else:\r\n out = out + b[tick2]\r\n c= 1\r\n break\r\nif c == 0:\r\n out = out + b[0]\r\nprint(out)", "name, surname = tuple(input().rstrip().split(\" \"))\r\nname = list(name)\r\nsurname = list(surname)\r\n\r\nchar = surname[0]\r\nprefix = list()\r\nprefix.append(name[0])\r\n\r\nfor c in name[1:]:\r\n\tif ord(c)<ord(char):\r\n\t\tprefix.append(c)\r\n\telse:\r\n\t\tbreak\r\n\r\nprefix.append(char)\r\nprint(\"\".join(prefix))", "s = input().split(' ')\r\n\r\nf = [s[0][:i] for i in range(1, len(s[0]) + 1)]\r\nl = [s[1][:i] for i in range(1, len(s[1]) + 1)]\r\n\r\nu = 'zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz'\r\n\r\nfor a in f:\r\n for b in l:\r\n u = min(u, a + b)\r\nprint(u)\r\n", "import sys\r\nimport bisect\r\n#input=sys.stdin.readline\r\nl=input().split()\r\na=l[0]\r\nb=l[1]\r\np=[]\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n ok=a[:i+1]+b[:j+1]\r\n p.append(ok)\r\nprint(min(p))\r\n", "s = list(input().split())\r\na = []\r\nfor i in range(len(s[0])):\r\n for j in range(len(s[1])):\r\n a.append(s[0][0:i + 1] + s[1][0:j + 1])\r\nprint(min(a))", "#!/usr/bin/env python3\r\n\r\ndef main():\r\n a, b = input().split()\r\n for i in range(1, len(a)):\r\n if ord(a[i]) >= ord(b[0]):\r\n print(a[0:i] + b[0])\r\n break\r\n else:\r\n print(a + b[0])\r\n\r\ntry:\r\n while True:\r\n main()\r\nexcept EOFError:\r\n pass\r\n", "a,b = input().split()\r\nl = []\r\nm = a+b\r\nfor i in range(10):\r\n for j in range(10):\r\n r = a[0:i+1]+b[0:j+1]\r\n f=True\r\n for k in range(min(len(r),len(m))):\r\n if r[k]< m[k]:\r\n f=False\r\n if not f:\r\n m =r[:]\r\n else:\r\n if len(r)<len(m):\r\n m=r[:]\r\nprint(m)\r\n'''\r\nn = int(input())\r\nif n == 1:print(1)\r\nelse :print(2*n-2)\r\n'''\r\n", "a=input()\r\na=a.split()\r\nz=a[0]\r\nb=len(z)\r\nx=''\r\nx+=z[0]\r\nfor i in range(1,b):\r\n if z[i]<a[1][0]:\r\n x+=z[i]\r\n else:\r\n break\r\nx+=a[1][0]\r\nprint(x)\r\n", "a,b=input().split()\ns=[]\nfor i in range(1,len(a)+1):\n for j in range(1,len(b)+1):\n s.append(a[:i]+b[:j])\ns.sort()\nprint(s[0])\n", "s1,s2=input().split()\r\nn=len(s1)\r\nans=s1[0]\r\nh=s2[0]\r\nfor i in range(1,n):\r\n if h>s1[i]:\r\n ans+=s1[i]\r\n else:\r\n break\r\nans+=s2[0]\r\nprint(ans)\r\n", "First, Last = input().split()\r\nResult = First[0]\r\ni = 1\r\nwhile i < len(First) and First[i] < Last[0]:\r\n Result += First[i]\r\n i += 1\r\nprint(Result + Last[0])\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: Again behind my desk\r\n# Caption: Start for new exam\r\n# CodeNumber: 585\r\n", "f, s = input().split()\nlenf = len(f)\nlens = len(s)\ntemp = []\nfor i in range(1, lenf + 1):\n\tfor j in range(1, lens + 1):\n\t\ttemp.append(f[0:i] + s[0:j])\ntemp.sort()\nprint (temp[0])", "def main():\r\n mode=\"filee\"\r\n if mode==\"file\":f=open(\"test.txt\",\"r\")\r\n get = lambda :[str(x) for x in (f.readline() if mode==\"file\" else input()).split()]\r\n [g, h] = get()\r\n a = []\r\n k = \"\"\r\n for i in range(len(g)):\r\n k = k + g[i]\r\n a.append(k + h[0])\r\n a.sort()\r\n print(a[0])\r\n \r\n if mode==\"file\":f.close()\r\n\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n\r\n", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nf, l = input().split()\r\nprint(min([f[:i] + l[:j] for i in range(1, len(f)+1) for j in range(1, len(l)+1)]))", "name, surname = map(str, input().split())\r\nname = list(name)\r\nsurname = list(surname)\r\nlenName = len(name)\r\nlenSurname = len(surname)\r\nstringList = []\r\nfor i in range(1, len(name) + 1):\r\n for j in range(1, len(surname) + 1):\r\n newString = name[0:i] + surname[0:j]\r\n stringList.append(newString)\r\nnewList = sorted(stringList)\r\na = newList[0]\r\nb = \"\".join(a)\r\nprint(b)\r\n", "def main():\n first, last = input().split()\n print(min(first[:i] + last[:j] for i in range(1, len(first)+1) for j in range(1, len(last)+1)))\n\n\nif __name__ == '__main__':\n main()\n", "s1,s2 = input().split()\r\ns = []\r\nfor i in range(1,len(s1)+1):\r\n\tfor j in range(1,len(s2)+1):\r\n\t\ts.append(s1[0:i]+s2[0:j])\r\ns.sort()\r\nprint(s[0])", "\r\ns1,s2=input().split()\r\nm=len(s1)\r\nn=len(s2)\r\ni=1\r\nj=0\r\nwhile i<m:\r\n if s1[i] >= s2[j]:\r\n break\r\n else:\r\n i+= 1\r\ni-=1\r\ns= s1[:i+1] + s2[0]\r\nprint(s)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n \r\n \r\n \r\n \r\n ", "a,b=map(str,input().split())\r\nans=\"\"\r\nfor i in range(1,len(a)):\r\n if a[i]<b[0]:\r\n ans+=a[i]\r\n else:\r\n break\r\nprint(a[0]+ans+b[0])\r\n ", "a,b = input().split()\r\nans = a[0]\r\n\r\nfor i in range(1,len(a)):\r\n if( a[i] < b[0]):\r\n ans+=a[i]\r\n else:\r\n break\r\nprint (ans+b[0])\r\n", "x,y=input().split()\r\na=x[0]\r\nfor i in range(1,len(x)):\r\n if(x[i]<y[0]):\r\n a=a+x[i]\r\n else:\r\n break\r\nprint(a+y[0])\r\n", "s1, s2 = input().split()\r\nans = s1[0]\r\nfor i in range(1, len(s1)):\r\n if s1[i] < s2[0]:ans += s1[i]\r\n else:break\r\nprint(ans + s2[0])", "s = input().split(' ')\r\ns1 = s[0]\r\ns2 = s[1]\r\nres = s1[0]\r\nflag = 0\r\nfor i in range(1, len(s1)):\r\n if(s1[i]>=s2[0]):\r\n res+=s2[0]\r\n flag = 1\r\n break\r\n else:\r\n res+=s1[i]\r\nif(flag == 0):\r\n res+=s2[0]\r\nprint(res)\r\n", "s, t = input().split()\r\nn = len(s)\r\nm = len(t)\r\nrec = []\r\nfor i in range(1, n + 1):\r\n for j in range(1, m + 1):\r\n rec.append(s[:i] + t[:j])\r\n\r\nrec = sorted(rec)\r\nprint(rec[0])", "a=input().split()\r\ni=1\r\nwhile i<len(a[0]) and a[0][i]<a[1][0]:i+=1\r\nprint(a[0][:i]+a[1][0])", "fn, ln=input().split()\r\n\r\n# fn='tom'\r\n# ln='riddle'\r\n\r\ndef gensub(s):\r\n\tres = []\r\n\tn=len(s)\r\n\tfor i in range(1,n+1):\r\n\t\tres.append(s[0:i])\r\n\treturn res\r\n\r\ngfn = gensub(fn)\r\ngln = gensub(ln)\r\n\r\nnames = [f + l for f in gfn for l in gln]\r\n\r\n\r\n# print(names)\r\nprint(min(names))\r\n# print('tor'<'tom')", "firstname, lastname = input().split()\r\n\r\nwords = []\r\nfor i in range(1, len(firstname) + 1):\r\n for j in range(1, len(lastname) + 1):\r\n words.append(firstname[:i] + lastname[:j])\r\n\r\nprint(min(words))", "first, last = input().strip().split()\r\nindex = 1\r\nwhile index != len(first) and first[index] < last[0]:\r\n index += 1\r\n \r\nprint (first[0: index] + last[0])\r\n\r\n", "\r\ns, t = input().split()\r\nm = 'z'*100\r\nfor i in range(1, len(s) + 1):\r\n for j in range(1, len(t) + 1):\r\n m = min(m, s[:i] + t[:j])\r\nprint(m)\r\n", "f,s=input().split()\ni=0\nl=f[0]\nfor c in f[1:]:\n if c < s[0]:l+=c\n else:break\nprint(l+s[0])\n", "s1, s2 = input().split()\r\nans = s1[0]\r\nans = []\r\nn1 = len(s1)\r\nn2 = len(s2)\r\nfor end1 in range(1, n1 + 1):\r\n for end2 in range(1, n2 + 1):\r\n ans.append(s1[0:end1] + s2[0:end2])\r\nans.sort()\r\nprint(ans[0])", "first, last = input().split()\r\n\r\nans = first[0]\r\n\r\nfor c in first[1:]:\r\n if c >= last[0]: break\r\n ans += c\r\n\r\nprint(ans+last[0])", "first, last = input().split(\" \")\r\nout = \"\"\r\nout = out + first[0]\r\ni = 1\r\nj = 0\r\nn = len(last)\r\nm = len(first)\r\nwhile(j < n and i < m):\r\n if last[j] <= first[i]:\r\n out = out + last[j]\r\n j+=1\r\n break\r\n else:\r\n out = out + first[i]\r\n i += 1\r\nif(j == 0):\r\n out += last[0]\r\nprint(out)", "nm, sn = input().split()\r\nans = nm[0]\r\nfor i in range(1, len(nm)):\r\n if nm[i] >= sn[0]:\r\n break\r\n ans += nm[i]\r\n\r\nprint(ans + sn[0])\r\n", "a=input().split()\r\nb=[]\r\nfor i in range(len(a[0])):\r\n b.append(a[0][:i+1]+a[1][0])\r\nb.sort()\r\nprint(b[0])\r\n", "\r\na,b=(map(str, input().split()))\r\nans=a[0]\r\ni=1\r\nwhile i<len(a) and a[i]<b[0]:\r\n\tans+=a[i]\r\n\ti+=1\r\nans+=b[0]\r\nprint(ans)", "nazwa = list(map(str, input().split()))\r\nimie = nazwa[0]\r\nnazwisko = nazwa[1]\r\nlogin = imie[0]\r\nfor i in range(len(imie)-1):\r\n if ord(imie[i+1]) < ord(nazwisko[0]):\r\n login += imie[i+1]\r\n else:\r\n break\r\nprint(login + nazwisko[0])", "a,b =input().split()\r\ns=a[0]\r\na=a[1:]\r\nfor i in range(len(a)):\r\n if ord(a[i])<ord(b[0]):\r\n s+=a[i]\r\n else:\r\n break\r\nprint(s+b[0])", "name,family = input().split()\r\na = []\r\nfor i in range(len(name)):\r\n for j in range(len(family)):\r\n s = name[:i+1] + family[:j+1]\r\n a.append(s)\r\na.sort()\r\nprint(a[0])", "# a = list(map(int, input().strip().split()))\r\n\r\nniz = input().strip().split()\r\n\r\nI = niz[0]\r\nP = niz[1]\r\n\r\n\r\ns = I[0]\r\ni = 1\r\nwhile i < len(I) and I[i] < P[0]:\r\n s += I[i]\r\n i += 1\r\nj = 0\r\ns += P[0]\r\n\r\nprint(s)\r\n", "first, last = input().split()\r\n\r\nif len(first) == 1:\r\n\tprint(first[0]+last[0])\r\nelse:\r\n\ti=1\r\n\twhile i < len(first) and first[i] < last[0]:\r\n\t\ti+=1\r\n\tprint(first[:i]+last[0])", "NS = input().split()\r\nans = 'z' * 20\r\nfor i in range(1, len(NS[0]) + 1):\r\n for j in range(1, len(NS[1]) + 1):\r\n ans = min(ans, NS[0][:i] + NS[1][:j])\r\nprint(ans)\r\n \r\n", "s=input()\r\nli=s.split(\" \")\r\ns1=li[0]\r\ns2=li[1]\r\nlen1=len(s1)\r\nlen2=len(s2)\r\nf=0\r\ni=1\r\nwhile i<len1:\r\n if s1[i]>=s2[0]:\r\n f=1\r\n ans=s1[0:i]\r\n break\r\n i=i+1\r\nif f==0:\r\n ans=s1\r\nans+=s2[0:1]\r\nprint(ans)\r\n", "a,b=input().split()\na=str(a)\nb=str(b)\nm=a[0]\nt=0\ni=0\nflag=0\nwhile(i<len(a)-1):\n\ti=i+1\n\tif(a[i]<b[t]):\n\t\tm=m+a[i]\n\telse:\n\t\tm=m+b[t]\n\t\tflag=1\n\t\tbreak\nif((i==len(a)-1)and flag ==0):\n\tm=m+b[t]\nprint(m)\n", "str = str(input())\r\n\r\ns = str.split(' ')\r\nfirst = s[0]\r\nlast = s[1]\r\n\r\nx = first + last\r\nm = \"\"\r\nn = \"\"\r\nfor i in first:\r\n m += i\r\n for j in last:\r\n n += j\r\n if x > m+n:\r\n x = m+n\r\n n = \"\"\r\n\r\nprint(x)\r\n", "f, l = input().split()\r\n\r\nid = \"\" + f[0]\r\nf = f[1:]\r\n\r\nid_2 = \"\"\r\n\r\ndef func(f, l):\r\n\tglobal id_2\r\n\tif len(f) == 0:\r\n\t\tid_2 = id_2 + l[0]\r\n\t\tprint (id + id_2)\r\n\telse:\t\r\n\t\tlst = [f[0], l[0]]\r\n\t\r\n\t\tlst.sort()\r\n\t\r\n\t\t\r\n\t\tid_2 = id_2 + lst[0]\r\n\t\r\n\t\tif lst[0] == l[0]:\r\n\t\t\tprint (id + id_2)\r\n\t\telse:\r\n\t\t\tf = f[1:]\r\n\t\t\tfunc(f, l)\r\n\t\t\r\nfunc(f, l)\t\t\r\n\t\t\r\n\t\t\r\n\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\t\r\n\r\n\t\t", "name, family = input().split()\r\nname = name + \"z\"\r\nl = 1\r\nwhile name[l] < family[0]:\r\n\tl = l + 1;\r\nprint(name[0:l] + family[0])\r\n\r\n\r\n\r\n", "def getLogin(a,b):\r\n\tresult = a[0]\r\n\ta = a[1:]\r\n\twhile(len(a)>0 and a[0]<b[0]):\r\n\t\tresult += a[0]\r\n\t\ta = a[1:]\r\n\r\n\tresult += b[0]\r\n\treturn result\r\n\r\na, b = input().split()\r\n#print (a,b)\r\nprint(getLogin(a,b))\r\n", "'''input\r\nharry potter\r\n'''\r\ns1,s2=input().strip().split(' ')\r\np1=1\r\np2=0\r\ns=s1[0]\r\nwhile p1!=len(s1) and p2!=1:\r\n if s1[p1]<s2[0]:\r\n s+=s1[p1]\r\n p1+=1\r\n else:\r\n s+=s2[0]\r\n p2+=1\r\nif p2==0:\r\n s+=s2[0]\r\nprint(s)", "a,b = input().split()\r\n\r\nl = []\r\n\r\nfor i in range(len(a)):\r\n\tfor j in range(len(b)):\r\n\t\tl.append(a[:(i+1)]+b[:(j+1)])\r\nl = sorted(l)\r\nprint(l[0])\t", "n, s = input().split()\r\nl = 'z' * 100\r\nfor i in range(1, len(n) + 1):\r\n for j in range(1, len(s) + 1):\r\n l1 = n[:i] + s[:j]\r\n if l1 < l:\r\n l = l1\r\nprint(l)\r\n", "f,l = input().split()\r\n\r\nt1 = f[0]\r\nk1 = ord(t1)\r\nt2 = l[0]\r\nk2 = ord(t2)\r\n\r\nfor s in f[1:]:\r\n if ord(s)<k2:\r\n t1 += s\r\n else:\r\n break\r\n\r\nprint(t1+t2)", "a,b=map(str,input().split())\r\nfirst=a[0]\r\nlast=b[0]\r\nans=first\r\nfor i in range(1,len(a)):\r\n\tif(a[i]<last):\r\n\t\tans=ans+a[i]\r\n\telse:\r\n\t\tbreak\r\nans=ans+last\r\nprint(ans)", "a, b = input().split()\n\nl = []\n\nfor i in range(1, len(a) + 1):\n\tfor j in range(1, len(b) + 1):\n\t\tl.append(a[:i] + b[:j])\n\nprint(min(l))", "name, surname = input().strip().split()\r\nlogin = [name[0]]\r\nif len(name) > 1:\r\n i = 1\r\n while i < len(name) and name[i] < surname[0]:\r\n login.append(name[i])\r\n i += 1\r\nlogin.append(surname[0])\r\nprint(\"\".join(login))\r\n", "a=input().split()\r\nn=[]\r\nX=''\r\nfor i in a[0]:\r\n X+=i\r\n n.append(X+a[1][0])\r\nn=sorted(n)\r\nprint(n[0])", "login = \"\"\r\nnome,sobre = [i for i in input().split()]\r\nx = []\r\nfor i in range(0,len(nome)):\r\n for j in range(0,len(sobre)):\r\n x.append(nome[0:1+i] + sobre[0:1+j:])\r\nx.sort()\r\nprint(x[0])\r\n \r\n", "S = list(map(str, input().split()))\nX = []\nfor i in range(1, len(S[0])+1):\n p = S[0][0:i]\n for j in range(1, len(S[1])+1):\n q = S[1][0:j]\n X.append(p+q)\nX.sort()\nprint(X[0])\n", "f,s=input().split()\r\nl=f[0]\r\nfor c in f[1:]:\r\n\tif c>=s[0]:break\r\n\tl+=c\r\nprint(l+s[0])", "first,last=input().split()\nusername=first[0]\nfirst=first[1:]\nwhile first!=\"\" and first[0]<last[0]:\n username=username+first[0]\n first=first[1:]\nprint(username+last[0])", "#http://codeforces.com/contest/909/problem/0\r\n#solved\r\nn, s = input().split()\r\nend = s[0]\r\nstart = n[0]\r\nmiddle = \"\"\r\n\r\nfor i in range(1, len(n)):\r\n if n[i] < end:\r\n middle += n[i]\r\n\r\n else:\r\n break\r\n\r\nprint(start + middle + end)", "a,b=input().split()\r\nprint(a[0],end='')\r\nfor i in range(1,len(a)):\r\n if a[i]<b[0]:\r\n print(a[i],end='')\r\n else:\r\n break\r\nprint(b[0])", "from sys import stdin\r\na, b = stdin.readline()[:-1].split(\" \")\r\ns = a[0]\r\ni = 1\r\nn = len(a)\r\nwhile i < n and a[i] < b[0]:\r\n s += a[i]\r\n i += 1\r\nprint(s+b[0])\r\n", "# Getting Problem Data from Codeforces.\r\nfirstName,lastName = input().split()\r\n# Method to generate all prefixes of a given string.\r\ndef generate(givenString):\r\n collection = []\r\n for i in range(len(givenString)):\r\n collection.append(givenString[0:i+1])\r\n return collection\r\n# Generating all possible login names and sorting them.\r\ncollection = []\r\nfirst,last = generate(firstName),generate(lastName)\r\nfor elementA in first:\r\n for elementB in last:\r\n collection.append(elementA+elementB)\r\ncollection.sort()\r\n# Solution.\r\nprint(collection[0])\r\n", "f,s=input().split()\nl=f[0]\nfor c in f[1:]:\n\tif c>=s[0]:break\n\tl+=c\nprint(l+s[0])", "save = input()\r\nimya, familia = save.split()\r\nl=[]\r\nfor i in range(1,len(imya)+1):\r\n pref_im=imya[0:i]\r\n for j in range(1,len(familia)+1):\r\n pref_fam=familia[0:j]\r\n l.append(pref_im+pref_fam)\r\nprint(min(l))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\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,b = input().split(\" \")\r\naa = []\r\nbb = []\r\nfor i in range(len(a)):\r\n aa.append(a[:i+1])\r\nfor i in range(len(b)):\r\n bb.append(b[:i+1])\r\n\r\naa.sort()\r\nbb.sort()\r\nc = []\r\nfor x in aa:\r\n for y in bb:\r\n c.append(x+y)\r\n\r\nc.sort()\r\nprint(c[0])", "# -*- coding: utf-8 -*-\n\"\"\"\nThe preferred way to generate user login in Polygon is to concatenate a prefix of the user's first name and a prefix of\ntheir last name, in that order. Each prefix must be non-empty, and any of the prefixes can be the full name. Typically\nthere are multiple possible logins for each person.\n\nYou are given the first and the last name of a user. Return the alphabetically earliest login they can get (regardless\nof other potential Polygon users).\n\nAs a reminder, a prefix of a string s is its substring which occurs at the beginning of s: \"a\", \"ab\", \"abc\" etc. are\nprefixes of string \"{abcdef}\" but \"b\" and 'bc\" are not. A string a is alphabetically earlier than a string b, if a is a\nprefix of b, or a and b coincide up to some position, and then a has a letter that is alphabetically earlier than the\ncorresponding letter in b: \"a\" and \"ab\" are alphabetically earlier than \"ac\" but \"b\" and \"ba\" are alphabetically later\nthan \"ac\".\n\nInput\nThe input consists of a single line containing two space-separated strings: the first and the last names. Each character\nof each string is a lowercase English letter. The length of each string is between 1 and 10, inclusive.\n\nOutput\nOutput a single string — alphabetically earliest possible login formed from these names. The output should be given in\nlowercase as well.\n\"\"\"\nimport sys\n\nname = sys.stdin.readline()\nfirstname, lastname = name.split()\nlogins = []\nfor i in range(len(firstname)):\n for j in range(len(lastname)):\n logins.append(firstname[:i+1] + lastname[:j+1])\n\nprint(sorted(logins)[0])\n\n", "def dildo():\r\n l=[]\r\n\r\n x = input()\r\n m=x.split()\r\n\r\n for j in range (1,len(m[0])+1):\r\n for i in range(1,len(m[1])+1):\r\n l.append(m[0][:j]+m[1][:i]) \r\n \r\n \r\n l.sort()\r\n print(l[0])\r\n \r\ndildo()", "first,last = map(str,input().split())\r\n\r\nans = first[0]\r\nfor c in range(1,len(first)):\r\n\tif first[c]<last[0]:\r\n\t\tans+=first[c]\r\n\telse:\r\n\t\tbreak\r\nans+=last[0]\r\nprint(ans)", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nf,s=input().split()\r\nl=f[0]\r\nfor c in f[1:]:\r\n\tif c>=s[0]:break\r\n\tl+=c\r\nprint(l+s[0])", "first_name, last_name = input().split(' ')\r\n\r\nprefix_1 = first_name[0]\r\ni = 1\r\nn = len(first_name)\r\nwhile i < n and first_name[i] < last_name[0]:\r\n prefix_1 += first_name[i]\r\n i += 1\r\n\r\nprefix_2 = last_name[0]\r\n\r\nprint(prefix_1 + prefix_2)\r\n", "def main():\n first,last = input().split()\n i = 1\n n = len(first)\n while i < n and first[i] < last[0]:\n i += 1\n print(first[0:i]+last[0])\nif __name__ == '__main__':\n main()\n", "s,s1=input().split()\r\nl=[s[0]]\r\nfor i in range(1,len(s)):\r\n if s[i]<s1[0]: l+=s[i]\r\n else: break\r\nl.append(s1[0])\r\nprint(''.join(l))", "s=input()\r\nfir=s.split()[0]; las=s.split()[1]\r\nf=[fir[0]]; l=[las[0]]; t=las[0]; i=1\r\nwhile i<len(fir) and ord(t)>ord(fir[i]):\r\n f.append(fir[i])\r\n i+=1\r\n\r\nprint(\"\".join(f)+t)\r\n", "f,s = input().strip().split()\nprint(f[0],end = '')\nfor i in range(1,len(f)):\n\tif f[i] < s[0]:\n\t\tprint(f[i],end='')\n\telse:\n\t\tbreak\nprint(s[0],end='')\n", "f,s=input().split()\r\nprint(min(f[:i+1]+s[:j+1]for i in range(len(f)) for j in range(len(s))))", "\r\nname, surname = input().split()\r\n\r\nans = name[0]\r\nto_be_added = surname[0]\r\n\r\nfor char in name[1:]:\r\n if char < to_be_added:\r\n ans += char\r\n else:\r\n break\r\nans += to_be_added\r\n\r\nprint(ans)", "a,b = [str(i) for i in input().split()]\r\n\r\nm = list(a)\r\nn = list(b)\r\ne = b[0]\r\nwant = 1\r\n\r\nfor x in m[1:]:\r\n if ord(x) >= ord(e):\r\n break\r\n else:\r\n want += 1\r\nr = ''.join(a[:want])\r\nr += b[0]\r\nprint(''.join(r))", "a, b = map(str, input().split())\r\nprint(a[0],end='')\r\nok = 0\r\nfor i in a:\r\n\tif (ok == 0):\r\n\t\tok = 1\r\n\t\tcontinue\r\n\tif (i >= b[0]): break\r\n\tprint(i,end='')\r\nprint(b[0])", "f,s=input().split()\nl=f[0]\nfor c in f[1:]:\n\tif c >= s[0]:\n\t\tbreak\n\tl+=c\nprint(l+s[0])", "a,b=input().split()\r\nn=a[0]+b[0]\r\nc=\"\"\r\nd=n\r\nfor i in a:\r\n c+=i\r\n # print(c);\r\n if((c+b[0])<n):\r\n n=c+b[0]\r\nprint (n)\r\n\r\n\r\n\r\n", "\r\ns, t = input().split()\r\ni = 1\r\nn = len(s)\r\nwhile i < n and s[i] < t[0]:\r\n i += 1\r\nprint(s[:i] + t[0])\r\n", "a,b = input().split()\r\na1 = a[0] +b[0]\r\ni=1\r\nj=1\r\nwhile 1:\r\n a2 = a[:i+1] + b[:j]\r\n a3 = a[:i] + b[:j+1]\r\n if a1<=a2 and a1<=a3:\r\n print(a1)\r\n break\r\n elif a1>a2:\r\n a1 = a2\r\n if i < len(a)-1:\r\n i += 1\r\n elif a1>a3:\r\n a1 = a3\r\n if j < len(b)-1:\r\n j+=1\r\n if i==len(a) and j==len(b):\r\n break", "f, l = input().split(\" \")\r\n\r\ni = 1;\r\nwhile(i<len(f) and f[i] < l[0]):\r\n i += 1\r\n\r\nprint(f[:i]+l[0])\r\n", "a=input().split()\r\nb=a[0]\r\nc=a[1]\r\nx=len(b)\r\ny=len(c)\r\ni=1\r\nj=1\r\nlst=[]\r\nwhile(i<(x+1)):\r\n r=b[0:i:]\r\n j=1\r\n while(j<=(y+1)):\r\n s=c[0:j:]\r\n k=r+s\r\n lst.append(k)\r\n j=j+1\r\n i=i+1\r\ne=sorted(lst)\r\nprint(e[0])\r\n \r\n ", "# coding:utf-8\n\n\nif __name__ == \"__main__\":\n line = input()\n a = line.split(\" \")[0]\n b = line.split(\" \")[1]\n\n ans = \"zzzzzzzzzz\"\n for i in range(len(a)):\n for j in range(len(b)):\n temp = a[:i+1] + b[:j+1]\n ans = min(temp, ans)\n\n\n print(ans)\n", "s1, s2 = [str(j) for j in input().split()]\r\noutput = s1 + s2\r\nfor j in range(len(s1)):\r\n s = s1[:j + 1]\r\n for k in range(len(s2)):\r\n s += s2[k]\r\n if sorted([s, output])[0] == s:\r\n output = s\r\nprint(output)\r\n", "try:\r\n s = input()\r\n w1, w2 = s.split()\r\n t = w2[0]\r\n ans = min(w1[:i]+t for i in range(1, len(w1)+1))\r\n print(ans)\r\nexcept Exception as e:\r\n print(e)", "n=input().split()\r\nw=n[0]\r\nv=n[1]\r\nz=w[0]\r\nfor i in w[1:]:\r\n if(ord(i)<ord(v[0])):\r\n z=z+i\r\n else:\r\n break\r\nz=z+v[0]\r\nprint(z)\r\n", "names = input().split()\r\nlogin = names[0][0]\r\nfor i in range(1,len(names[0])):\r\n if ord(names[0][i]) < ord(names[1][0]) :\r\n login += names[0][i]\r\n else:\r\n login += names[1][0]\r\n break\r\nelse:\r\n login += names[1][0]\r\n\r\nprint(login)", "import sys\r\ns1,s2 = input().strip().split(\" \")\r\nprint(s1[0],end=\"\")\r\nfor s in s1[1:]:\r\n if s<s2[0]:\r\n print(s,end=\"\")\r\n else:\r\n break\r\nprint(s2[0])\r\n\r\n", "z=input().split()\r\nfn=z[0]\r\nln=z[1]\r\nprint(fn[0],end=\"\")\r\nfor i in range(1,len(fn),1) :\r\n\tif fn[i]<ln[0] :\r\n\t\tprint(fn[i],end=\"\")\r\n\telse :\r\n\t\tbreak\r\nprint(ln[0])", "f, l = input().split()\r\ni = 1\r\nwhile i < len(f) and f[i] < l[0]:\r\n i += 1\r\nprint(f[:i] + l[0])", "m = []\r\ni = 1\r\na, b = map(str, input().split())\r\nwhile True:\r\n if (len(a)-1) >= i and a[i] < b[0]:\r\n m.append(a[i])\r\n i += 1\r\n else:\r\n m.append(b[0])\r\n break\r\nprint(a[0]+''.join(m))", "first_name , last_name = list(map(str , input().split()))\r\ni = 1\r\nans = first_name[0]\r\nwhile i<len(first_name) and first_name[i]<last_name[0]:\r\n ans = ans + first_name[i]\r\n i = i +1\r\nans = ans + last_name[0]\r\nprint(ans)", "\r\nx,y=input().split()\r\n\r\n\r\nmn=\"zzzzzzzzzzzzzzzzzzzzzzzzzzzzz\"\r\n\r\nfor i in range(len(x)):\r\n for j in range(len(y)):\r\n z=x[:i+1]+y[:j+1]\r\n mn=min(mn,z)\r\n\r\nprint(mn)", "x=input().split(\" \")\nans=x[0]+x[1]\nfor i in range(len(x[0])):\n t=x[0][:i+1]\n for j in range(len(x[1])):\n t+=x[1][j]\n if(t<ans):\n ans=t\nprint(ans)\n", "a,b=input().split()\r\nl=[]\r\nfor i in range(0,len(a)):\r\n\tx=a[:i+1]\r\n\tfor j in range(0,len(b)):\r\n\t\ty=b[:j+1]\r\n\t\ts=x+y\r\n\t\tl.append(s)\r\nl.sort()\r\nprint(l[0])", "import sys\r\n\r\nfor line in sys.stdin.readlines():\r\n elements = line.split()\r\n output = elements[0][0]\r\n for c in elements[0][1:]:\r\n if c < elements[1][0]:\r\n output += c\r\n else:\r\n break\r\n output += elements[1][0]\r\n print(output)\r\n", "s, t = map(str, input().split())\r\nmin_s = \"zzzzzzzzzzzzzzzzzzzz\"\r\nfor i in range(len(s)):\r\n for j in range(len(t)):\r\n temp = s[:i + 1] + t[:j + 1]\r\n if temp < min_s:\r\n min_s = temp\r\nprint(min_s)\r\n", "first, last = input().strip().split()\r\nn = len(first)\r\ni = 1\r\nwhile i<n and first[i] < last[0]:\r\n i += 1\r\n \r\nprint(first[:i] + last[0])", "n, m = input().split()\r\nans = n[0]\r\ni = 1\r\nwhile (i != len(n)):\r\n if (n[i] < m[0]):\r\n ans = ans + n[i];\r\n else:\r\n break\r\n i = i + 1\r\n \r\nans = ans + m[0]\r\nprint(ans)", "F, L = input().split()\r\nres = F[0]\r\nwhile True:\r\n if len(F) > len(res) and F[len(res)] < L[0]:\r\n res += F[len(res)]\r\n else:\r\n break\r\nprint(res + L[0])", "#!/usr/bin/env python\n\nimport sys\n\ndef Rint():\n return map(int, input().split())\n\nfor line in sys.stdin:\n a, b= line.split()\n ac = [ord(c) for c in a]\n bc = [ord(c) for c in b]\n\n ans = []\n ia = 0\n na = len(a)\n ib = 0\n nb = len(b)\n while ia < na and ib == 0 and ib < nb:\n if ia == 0 and ib == 0:\n ans += a[ia]\n ia+=1\n continue\n if ac[ia] < bc[ib]:\n ans += a[ia]\n ia+=1\n else:\n ans += b[ib]\n ib+=1\n if ib == 0:\n ans += b[ib]\n print(''.join(ans))\n", "a,b=input().split();l=a[0]\r\nfor i in a[1:]:\r\n if i>=b[0]:break\r\n l+=i\r\nprint(l+b[0])", "a,b=input().split()\r\ns=a[0]\r\nfor i in range(1,len(a)):\r\n if(a[i]<b[0]):\r\n s+=a[i]\r\n else:\r\n break\r\nprint(s+b[0])\r\n", "a,b=map(str,input().split())\r\nprint(a[0],end='')\r\nfor i in range(1,len(a)):\r\n if ord(a[i])<ord(b[0]):\r\n print(a[i],end='')\r\n else:\r\n break\r\nprint(b[0])", "a, b = input().split()\r\n\r\ndef solve():\r\n res = ''\r\n res += a[0]\r\n\r\n i = 1\r\n while i<=len(a)-1:\r\n if a[i] >= b[0]:\r\n break\r\n res += a[i]\r\n i += 1\r\n\r\n res += b[0]\r\n\r\n print(res)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "\n# coding: utf-8\n\n# In[5]:\n\na, b = input().split()\nc = a[0]\nfor i in range(1, len(a)):\n if a[i] < b[0]:\n c += a[i]\n else:\n break\nc += b[0]\nprint(c)\n\n\n# In[ ]:\n\n\n\n", "s = input().split()\r\nnew = \"\"\r\n\r\nfor i in range(len(s[0])):\r\n if i:\r\n if s[0][i] < s[1][0]:\r\n new += s[0][i]\r\n else:\r\n break\r\n else:\r\n new += s[0][i]\r\n\r\nprint(new+s[1][0])\r\n", "a, b = input().split(' ')\r\nfor i in a[1:]:\r\n\tif i >= b[0]:\r\n\t\ti = a.find(i)\r\n\t\tbreak\r\nelse:\r\n\ti = None\r\n# print(i)\r\nif i == 0:\r\n\tprint(a[0],b[0], sep='')\r\nelse:\r\n\tprint(a[:i], b[0], sep='')", "string = input().split()\nprint (string[0][0], end = '')\nfor x in range(1,len(string[0])):\n\t#print (x)\n\tif string[0][x] < string[1][0]:\n\t\tprint (string[0][x], end = '')\n\telse:\n\t\tbreak\t\nprint (string[1][0])\n#print (string[0][2] < string[1][0])", "string1, string2 = list(input().split())\r\nsecond_elem = string2[0]\r\nres = \"\"+string1[0]\r\nflag=1\r\nfor ind, elem in enumerate(string1):\r\n if ind==0:\r\n continue\r\n if elem >= second_elem:\r\n res+=second_elem\r\n flag=0\r\n break\r\n else:\r\n res+=elem\r\nif flag:\r\n res+=second_elem\r\nprint(res)", "s1, s2 = input().split()\n\nres = s1[0] \nfor ch in s1[1:]:\n if ch < s2[0]:\n res += ch\n else:\n break\nres += s2[0]\nprint(res)\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\nfirst_name, last_name = map(str, input().split())\r\nlogin_name = \"\"\r\nfor i in range(len(first_name)):\r\n if i == 0 or first_name[i] < last_name[0]:\r\n login_name += first_name[i]\r\n else:\r\n break\r\nlogin_name += last_name[0]\r\nprint(login_name)\r\n", "s1, s2=map(str, input().split())\r\nif len(s1)==1:\r\n print (s1[0]+s2[0])\r\nelse:\r\n x=1; s=s1[0]\r\n while s1[x]<s2[0]:\r\n s+=s1[x]\r\n x+=1\r\n if x==len(s1):\r\n break\r\n print(s+s2[0])\r\n", "a,b = input().split()\r\n \r\ni = 1\r\nwhile i<len(a) and a[i]<b[0]:\r\n i+=1\r\nprint (a[:i]+b[0])", "x,y=input().split()\r\nz=x[0]\r\ni=1\r\nwhile i <len(x):\r\n if x[i]<y[0]:\r\n z+=x[i]\r\n else:\r\n z+=y[0]\r\n break\r\n i+=1\r\nif i==len(x):\r\n z+=y[0]\r\nprint(z)\r\n", "s = input()\r\n\r\nf = s.split()[0]\r\nl = s.split()[1]\r\n\r\narr = []\r\nfor i in range(len(f)):\r\n for j in range(len(l)):\r\n arr.append(f[:i+1]+l[:j+1])\r\n\r\narr = sorted(arr)\r\nprint(arr[0])\r\n", "\n\nfname, lname = map(str, input().split())\nans = []\nans.append(fname[0])\nfor i in range(1,len(fname)):\n if fname[i] < lname[0]:\n ans.append(fname[i])\n else:\n break\nans.append(lname[0])\nstring = \"\".join(ans)\nprint(string)", "A,B=input().split() \nans=[] \nleng=len(A)\ni=1\nwhile i<leng: \n if A[i]>=B[0]:\n break\n i+=1\nprint(A[:i]+B[0])\n \n \n\n", "first, last = input().split()\ni = 1\nwhile i < len(first) and first[i] < last[0]:\n i += 1\nres = first[:i] + last[0]\nprint(res)\n", "# LUOGU_RID: 101737949\ns, t = input().split()\r\na = []\r\nfor i in range(len(s)):\r\n for j in range(len(t)):\r\n a += s[:i+1] + t[:j+1],\r\nprint(min(a))", "x,y=input().split()\r\ni=0\r\nd=x[0]\r\nfor i in x[1:]:\r\n if i < y[0]:\r\n d+=i\r\n else:\r\n break\r\nprint(d+y[0])\r\n\r\n", "f, l = input().strip().split()\nans = f[0]\ni = 1\nwhile i < len(f) and f[i] < l[0]:\n ans += f[i]\n i += 1\nans += l[0]\nprint(ans)\n", "s1,s2=map(str,input().split())\r\ns=\"\"\r\ns+=s1[0]\r\nfor i in range(1,len(s1)):\r\n if ord(s1[i])<ord(s2[0]):\r\n s+=s1[i]\r\n else:\r\n break\r\ns+=s2[0]\r\nprint(s)\r\n \r\n ", "def main():\n first, second = input().split()\n\n foo = set()\n\n for i in range(len(first)):\n for j in range(len(second)):\n foo.add(first[:i+1] + second[:j+1])\n\n print(min(foo))\n\nif __name__ == \"__main__\":\n main()\n", "z=input().split()\nfn=z[0]\nln=z[1]\nprint(fn[0],end=\"\")\nfor i in range(1,len(fn),1) :\n\tif fn[i]<ln[0] :\n\t\tprint(fn[i],end=\"\")\n\telse :\n\t\tbreak\nprint(ln[0])\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", "q, w = input().split(' ')\r\n\r\ns = q[0]\r\nq = q[1:]\r\ni, j = 0, 0\r\nwhile i < len(q):\r\n #print(q[i] < w[0], i)\r\n if q[i] < w[0]:\r\n s += q[i]\r\n i += 1\r\n else:\r\n s += w[0]\r\n j = 1\r\n break\r\nif j == 0:\r\n s += w[0]\r\nprint(s)\r\n", "a,b = input().split()\r\n\r\nres = a[0]\r\n\r\nfor index, c in enumerate(a):\r\n\tif index == 0: continue\r\n\tif c < b[0]: res += c\r\n\telse:\r\n\t\tbreak\r\n\r\nres += b[0]\r\nprint(res)", "inu=input().split()\r\nfirst,last=inu[0],inu[1]\r\nl,name,st=[],\"\",\"\"\r\nfor fi in first:\r\n\tst=st+fi\r\n\tname=st\r\n\tfor se in last:\r\n\t\tname=name+se\r\n\t\tl.append(name)\r\nl.sort()\r\nprint(l[0])", "S=input()\r\nnames=S.split()\r\nfn=names[0]\r\nln=names[1]\r\nposs=[]\r\nfor i in range(1,len(fn)+1):\r\n for j in range(1,len(ln)+1):\r\n poss.append(fn[0:i]+ln[0:j])\r\nposs.sort()\r\nprint(poss[0])", "(x,y)=input().split(' ')\r\na=[]\r\nfor i in range(1,len(x)+1):\r\n for j in range(1,len(y)+1):\r\n a.append(x[:i]+y[:j])\r\na.sort()\r\nprint(a[0])", "sou,dest = input().split(\" \")\r\ndest1 = dest[0]\r\ng = ord(dest1)\r\ns = sou[0]\r\nr = len(sou)\r\nfor j in range(1,r):\r\n i = sou[j]\r\n f = ord(i)\r\n if(f < g):\r\n s += i\r\n else:\r\n # = s + dest1\r\n break\r\nprint(s + dest1) ", "a, b = input().split()\r\nli = []\r\nfor i in range(len(a)):\r\n li.append(a[:i + 1] + b[0])\r\nli.sort()\r\nprint(li[0])\r\n", "s, t = input().split()\r\nx = s[0]\r\n\r\nfor i in range(1, len(s)):\r\n if s[i] >= t[0]:\r\n break\r\n x += s[i]\r\n\r\nprint(x + t[0])", "a, b = input().split()\r\n\r\nnick = a[0]\r\ni = 1\r\nwhile i < len(a) and nick + a[i] < nick + b[0]:\r\n nick+=a[i]\r\n i+=1\r\n\r\nprint(nick+b[0])\r\n", "a,b = input().split(\" \")\ns = \"\"\nfirst, last = a,b\n\ni,j=1,0\ns+=first[0]\nwhile i<len(first) and first[i]<last[j]:\n\ts+=first[i]\n\ti+=1\ns+=last[0]\n\nprint(s)", "s = input()\r\nn, f = s.split(' ')\r\ns=n[0]\r\ni=1\r\nwhile i < len(n) and n[i] < f[0]:\r\n s += n[i]\r\n i+=1\r\nprint(s+f[0])", "from itertools import takewhile\r\nu, v = input().split()\r\nprint(u[0] + ''.join(list(takewhile(lambda x : x < v[0], u[1:]))) + v[0])\r\n", "first = \"\"\r\nlast = \"\"\r\nname = input()\r\nfirst = name.split(\" \")[0];\r\nlast = name.split(\" \")[1];\r\n\r\nres = first[0];\r\nl = 1\r\nwhile(l < len(first) and first[l] < last[0]):\r\n res += first[l]\r\n l+=1\r\nres += last[0]\r\nprint(res)", "first,last = input().split()\r\nfirst = list(first)\r\nlast = list(last)\r\ns = []\r\ns.append(first[0])\r\nk = 0\r\nj = 0\r\nflag = 1\r\nfor i in range(len(first)-1):\r\n\tif last[j] > first[k+1]:\r\n\t\ts.append(first[k+1])\r\n\t\tk+=1\r\n\telse:\r\n\t\tflag = 0\r\n\t\ts.append(last[j])\r\n\t\tbreak\r\n\t#print(s)\r\n\r\nif flag==1:\r\n\ts.append(last[j])\r\nprint(\"\".join(s))\r\n\r\n", "def pref(f,l):\n min_val = 'zzzzzzzzzzz'\n for i in range(1, len(f)+1):\n if str(f[:i])+l[0] < min_val:\n min_val = str(f[:i])+l[0]\n return(min_val)\n\nf,l=input().split()\nprint(pref(f,l))\n", "name = input().strip().split()\r\n\r\na, b = name[0], name[1]\r\n\r\nall_name = []\r\n\r\nfor i in range(1, len(a) + 1):\r\n for j in range(1, len(b) + 1):\r\n new = a[:i] + b[:j]\r\n all_name.append(new)\r\nall_name.sort()\r\nprint(all_name[0])", "name, surname = input().split()\r\nres = name[0] + ''\r\n\r\nfor i in range(2, len(name) + 1):\r\n if name[i - 1:i] < surname[0]:\r\n res += name[i - 1:i]\r\n else:\r\n break\r\nres += surname[0]\r\nprint(res)", "s=input().split()\r\nn=s[1][0]\r\nprint(s[0][0], end = '')\r\nfor i in range (1, len(s[0])):\r\n if s[0][i] < n:\r\n print(s[0][i], end = '')\r\n else:\r\n print(n)\r\n exit(0)\r\nprint(n)", "n1, n2 = input().split()\r\nminlog = n1[0]+n2[0]\r\nfor i in range(len(n1)):\r\n for j in range(len(n2)):\r\n log = n1[:i+1] + n2[:j+1]\r\n if log < minlog:\r\n minlog = log\r\n\r\nprint(minlog)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nThis is a temporary script file.\r\n\"\"\"\r\nS = input()\r\nX, Y = S.split()\r\nans = \"\"\r\nn = len(X)\r\nm = len(Y)\r\ni = 1\r\nwhile i < n:\r\n if X[i] < Y[0]:\r\n ans += X[i]\r\n i +=1\r\n else:\r\n break\r\n \r\nprint (X[0] + ans + Y[0])", "first,last=map(str,input().split())\r\nflag=0\r\nfor i in range(1,len(first)):\r\n if first[i]>=last[0]:\r\n index=i\r\n flag=1\r\n break\r\nif flag==1:\r\n print(first[0:index]+last[0])\r\nelse:\r\n print(first+last[0])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "l = input().split()\r\ni = 1\r\nwhile i < len(l[0]) and l[0][i] < l[1][0]: i += 1 \r\nprint(l[0][:i]+l[1][0])", "first, second = input().split()\ni, j = 1, 0\nans = [first[0]]\nwhile i < len(first) and first[i] < second[j]:\n ans.append(first[i])\n i += 1\nans.append(second[j])\n\nprint(''.join(ans))\n", "f,l=input().split()\r\ns=f[0]\r\nfor i in range(1,len(f)):\r\n if(ord(f[i])>=ord(l[0])):\r\n break\r\n s+=f[i]\r\ns+=l[0]\r\nprint(s)", "\r\n\r\n\r\n\r\ndef get_username(ls):\r\n name = ls[0]\r\n surname = ls[1]\r\n username = [name[0]]\r\n i = 1\r\n j = 0\r\n while True:\r\n if i >= len(name):\r\n username.append(surname[j])\r\n return ''.join(username)\r\n if name[i] < surname[j]:\r\n username.append(name[i])\r\n i+=1\r\n else:\r\n username.append(surname[j])\r\n return ''.join(username)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n s = input()\r\n ls = s.split(\" \")\r\n print(get_username(ls))\r\n", "a,b=map(str,input().split())\r\nk=0\r\nprint(a[0],end=\"\")\r\nfor i in range(1,len(a)):\r\n if str(a[i])<str(b[k]):\r\n print(a[i],end=\"\")\r\n else:\r\n print(b[0],end='')\r\n exit()\r\nprint(b[0])", "s1,s2 = input().split()\r\narr = []\r\nfor i in range(1,len(s1)+1):\r\n arr.append(s1[:i]+s2[0])\r\narr.sort()\r\nprint(arr[0])\r\n", "n1,n2 = map(list,input().split())\r\n\r\ndef prefix(s):\r\n ans = []\r\n n = len(s)\r\n for i in range(1,n+1):\r\n ans.append(s[:i])\r\n return ans\r\n\r\nans = [n1[0],n2[0]]\r\nfor i in prefix(n1):\r\n for j in prefix(n2):\r\n ans = min(ans,i+j)\r\nprint(''.join(ans))\r\n", "imya , familia = input().split()\r\n\"\"\"\r\nb = list(imya)\r\n#a = b\r\na = list(imya)\r\nb.sort()\r\na.index(b[0])\r\n#min_letter = b[0]\r\n#lst.index('g')\r\na = a[0:a.index(b[0]) + 1]\r\n\r\nprint(\"\".join(a))\r\n\r\n# hababaq potter\r\n\"\"\"\r\nall_vars = []\r\nfor i in range (len(imya)):\r\n for n in range(len(familia)):\r\n all_vars.append(imya[0:i+1] + familia[0:n+1])\r\nall_vars.sort()\r\nprint(all_vars[0]) ", "ss = input().split()\nn = ss[0].strip()\ns = ss[1].strip()\na = []\nfor i in range(1, len(n) + 1):\n for j in range(1, len(s) + 1):\n a.append(n[:i] + s[:j])\na.sort()\nprint(a[0])\n", "a,b = input().split()\ntot = a[0]\nb1=0\n\nfor i in range(1, len(a)):\n\tif(a[i] >= b[0]):\n\t\ttot += b[0]\n\t\tb1=-1\n\t\tbreak\n\telse:\n\t\ttot += a[i]\nif(b1!=-1):\n\ttot+=b[0]\n\nprint(tot)", "a,b = map(str,input().split())\r\n\r\nl = []\r\n\r\nfor i in range(len(str(a))):\r\n for j in range(len(str(b))):\r\n l.append(a[0:i+1]+b[0:j+1])\r\n \r\n\r\nl.sort()\r\nprint(l[0])\r\n \r\n \r\n\r\n\r\n\r\n\r\n", "a,b=input().split()\r\ns=a[0]\r\nc = a[1:]\r\nfor i in range(len(c)):\r\n if c[i]<b[0] :\r\n s+=c[i]\r\n else:\r\n break\r\n \r\nt = s+b[0]\r\nprint(t)\r\n\r\n", "import sys\ninput = sys.stdin.readline\n\ns = input().strip()\n\nf, l = s.split()\n\nu = f[0]\ni = 1\nwhile i < len(f) and f[i] < l[0]:\n u += f[i]\n i += 1\n\nu += l[0]\nprint(u)", "a,b=input().split();print(a[0],end=\"\")\r\nfor i in a[1:]:\r\n if i>=b[0]:break\r\n print(i,end=\"\")\r\nprint(b[0])", "f,l=map(str,input().split())\ns,i,n=f[0],1,len(f)\nwhile (i<n) and (f[i]<l[0]):\n\ts+=f[i]\n\ti+=1\ns+=l[0]\nprint(s)", "s = input().split(' ', 1)\r\n\r\nans = \"zzzzzzzzzz\"\r\nfor i in range(1, len(s[0]) + 1):\r\n for j in range(1, len(s[1]) + 1):\r\n ans = min(ans, s[0][:i] + s[1][:j])\r\n\r\nprint(ans)\r\n", "s=input()\r\nsl=s.split(' ')\r\ns1=sl[0]\r\ns2=sl[1]\r\ni=0\r\nj=0\r\nans=\"\"\r\nans+=s1[0]\r\nfor i in range(1,len(s1)):\r\n if s1[i]>=s2[0]:\r\n break\r\n else:\r\n ans+=s1[i]\r\nans+=s2[0]\r\nprint(ans)", "a,b = input().split()\ns=a[0]\n# for i in range(len(a)-1):\n# if a[i+1]<a[i]:\n# s+=a[i+1]\n# else:\n# break\ni=1\nwhile i<len(a) and a[i]<b[0]:\n s+=a[i]\n i+=1\nprint(s+b[0])", "n = str(input())\r\ni = 0\r\nb = ''\r\nwhile n[i] != ' ':\r\n b = b + n[i]\r\n i = i + 1\r\nans = ''\r\nans = ans + n[0]\r\nfor j in range(1, len(b)):\r\n if n[j] < n[i + 1]:\r\n ans = ans + n[j]\r\n else:\r\n break\r\nans = ans + n[i + 1]\r\nprint(ans)", "a, b = input().split()\r\n\r\nc = a[0]\r\nfor i in a[1:]:\r\n if i < b[0]:\r\n c += i\r\n else:\r\n break\r\n\r\nprint(c + b[0])\r\n ", "f, s = input().split()\r\nl = f[0]\r\nfor c in f[1:]:\r\n\tif c>=s[0]:break\r\n\tl += c\r\nprint(l + s[0])", "name = input().split()\r\nans = name[0][0]\r\n\r\nfor s in name[0][1:]:\r\n if s < name[1][0]:\r\n ans += s\r\n else:\r\n break\r\n\r\nans += name[1][0]\r\nprint(ans)\r\n", "s=input()\r\na=s.split(' ')\r\nres=a[0][0]\r\nfor i in range(1,len(a[0])):\r\n if a[0][i]<a[1][0]:\r\n res+=a[0][i]\r\n else:\r\n break\r\nres+=a[1][0]\r\nprint(res)", "f,s=input().split()\nl=f[0]\nfor c in f[1:]:\n\tif c >= s[0]:break\n\tl+=c\nprint(l+s[0])\n\n\n\n# Made By Mostafa_Khaled", "a,b=input().split()\r\nc=len(a)\r\nh=a[0]+b[0]\r\nfor i in range(1,c+1):\r\n h=min(h,a[:i]+b[0]) \r\n #print(h)\r\nprint(h)", "a,b=input().split()\r\ns=a[0]+b[0]\r\nc=a[0]\r\nfor i in range(1,len(a)):\r\n c+=a[i]\r\n if c+b[0]<s:\r\n s=c+b[0]\r\nprint(s)", "\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\ns = liststr()\r\nx = []\r\nfor i in range(len(s[0])):\r\n\tfor j in range(len(s[1])):\r\n\t\ttemp = s[0][:i+1]+s[1][:j+1]\r\n\t\tx.append(temp)\r\nprint(min(x))\r\n\r\n\r\n\t\r\n", "first,last=input().split(\" \")\r\nlogin=first[0]\r\nfor i in range(1,len(first)):\r\n if ord(first[i])<ord(last[0]):\r\n login +=first[i]\r\n else:\r\n login +=last[0]\r\n break\r\nelse:\r\n login +=last[0] \r\nprint(login) ", "s=input().split(\" \")\r\nm=s[0]\r\nj=s[1]\r\nlist=[]\r\nfor x in range(len(m)):\r\n p=m[0:x+1]\r\n p=p+j[0]\r\n list.append(p)\r\nlist.sort() \r\nprint(list[0])", "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\ns = list(input().split())\r\na = s[0]\r\nb = s[1]\r\nbest = 'zzzzzzzzzz'\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n c = a[:(i+1)] + b[:(j+1)]\r\n best = min(best, c)\r\nprint(best)\r\n\r\n\r\n", "a = input().split(\" \")\r\npword = a[0][0]\r\nloop = True\r\ni = 1\r\nwhile(loop):\r\n if(i != len(a[0])):\r\n temp1 = pword + a[0][i]\r\n else:\r\n pword += a[1][0]\r\n break\r\n temp2 = pword + a[1][0]\r\n if(temp1 < temp2):\r\n pword = temp1\r\n i += 1\r\n else:\r\n pword = temp2\r\n loop = False\r\nprint(pword)\r\n", "s1, s2 = input().split()\r\nss = []\r\nfor i in range(1, len(s1)+1):\r\n for j in range(1, len(s2)+1):\r\n ss.append(s1[:i]+s2[:j])\r\nss.sort()\r\nprint(ss[0])\r\n", "a, b = [i for i in input().split()]\r\n\r\nal = list(a)\r\nbl = list(b)\r\n\r\ns = al[0]\r\n\r\nc = bl[0]\r\n\r\nfor i in al[1:]:\r\n if i < c:\r\n s = s + i\r\n else:\r\n break\r\ns = s + c \r\nprint(s)", "a, b = input().split()\r\nans = a[0]\r\nfor i in a[1:]:\r\n if i < b[0]:\r\n ans += i\r\n else:\r\n break\r\nans += b[0]\r\nprint(ans)", "X = input()\nx = X.split()\nfname = x[0]\nsname = x[1]\nans = ''\nfor i in range(len(fname)):\n\tif i == 0:\n\t\tans += fname[i]\n\telse:\n\t\tif ord(fname[i])<ord(sname[0]):\n\t\t\tans += fname[i]\n\t\telse:\n\t\t\tbreak\nans += sname[0]\t\nprint(ans)\t\t\t\t ", "#!/usr/bin/env python3\r\n#! -*- coding: utf-8 -*-\r\n\r\n\r\ndef main():\r\n\ts, t = input().split()\r\n\tminimal = \"\"\r\n\tfor i in range(len(s) + 1):\r\n\t\tfor j in range(len(t) + 1):\r\n\t\t\tif not i or not j:\r\n\t\t\t\tcontinue\r\n\t\t\telse:\r\n\t\t\t\tpref = s[:i] + t[:j]\r\n\t\t\t\tminimal = pref if not minimal else min(minimal, pref)\r\n\tprint(minimal)\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "f,s=input().split()\r\nl=f[0]\r\nfor c in f[1:]:\r\n if c < s[0]:l+=c\r\n else:break\r\nprint(l+s[0])\r\n", "first, last = input().split()\r\nresult = first[0]\r\nfor i in range(len(first)-1):\r\n if first[i+1] < last[0]:\r\n result += first[i+1]\r\n else:\r\n break\r\nresult += last[0]\r\nprint(result)", "def process(S):\r\n f, l = S.split()\r\n answer = [f[0]]\r\n for i in range(1, len(f)):\r\n if f[i] < l[0]:\r\n answer.append(f[i])\r\n else:\r\n break\r\n answer.append(l[0])\r\n return ''.join(answer)\r\n\r\nS = input()\r\nprint(process(S))", "full_name = input()\r\nargs = full_name.split(\" \")\r\nfname = args[0]\r\nlname = args[1]\r\n\r\noutput = fname[0]\r\ni = 1;\r\n\r\nwhile(i < len(fname) and fname[i] < lname[0]):\r\n output += fname[i]\r\n i += 1\r\n\r\noutput += lname[0];\r\nprint(output)\r\n", "first, last = input().split()\r\nans = first[0]\r\nfor x in first[1:]:\r\n if x >= last[0]:\r\n break\r\n ans += x\r\nans += last[0]\r\nprint(ans)", "if __name__ == '__main__':\r\n a, b = input().strip().split()\r\n l = []\r\n for i in range(1, len(a) + 1):\r\n for j in range(1, len(b) + 1):\r\n l.append(a[:i] + b[:j])\r\n l.sort()\r\n print(l[0])\r\n", "a, b = map(str, input().split())\r\nprint(a[0],end='')\r\nfor i in a[1::]:\r\n\tif (i >= b[0]): break\r\n\tprint(i,end='')\r\nprint(b[0])", "x = input()\r\nn= len(x)\r\na = ''\r\nb = ''\r\ni = 0\r\nwhile x[i] != ' ':\r\n a+=x[i]\r\n i+=1\r\ni+= 1\r\nb = x[i:n]\r\nc = a[0]\r\ni = 1\r\nwhile i!= len(a) and a[i] < b[0]:\r\n c+= a[i]\r\n i+= 1\r\nc+= b[0]\r\nprint(c)", "s=input().split()\r\ns1=s[0][1:]\r\nprint(s[0][0],end=\"\")\r\nfor i in s1:\r\n if(ord(i)>=ord(s[1][0])):\r\n print(s[1][0],end=\"\")\r\n break\r\n else:\r\n print(i,end=\"\")\r\n \r\nelse:\r\n print(s[1][0],end=\"\")", "a = list(input().split())\r\nans = list(a[0][0])\r\nfor i in range(1, len(a[0])):\r\n if a[0][i] < a[1][0]:\r\n ans.append(a[0][i])\r\n else:\r\n break\r\nans.append(a[1][0])\r\nprint(\"\".join(ans))", "a, b = map(str, input().split())\r\nc = 0\r\nfor i in range(1, len(a)): \r\n if a[i:i+1] >= b[:1]:\r\n print(a[:i]+b[:1])\r\n c += 1\r\n break\r\nif c != 1:\r\n print(a+b[:1])\r\n", "a, b = input().split()\r\nans = a[0] + b[0]\r\n\r\nfor i in range(len(a)):\r\n for j in range(len(b)):\r\n t = a[:i+1] + b[:j+1]\r\n ans = min(ans, t)\r\n\r\nprint(ans)\r\n", "n=input().split()\r\nst=\"\"\r\nst+=n[0][0]\r\nfor i in range(1,len(n[0])):\r\n if n[0][i]<n[1][0]:\r\n st+=n[0][i]\r\n else:\r\n break\r\nst+=n[1][0]\r\nprint(st)", "\r\ndef generatelogn(str1):\r\n arr1=str1.split(' ')\r\n ans=arr1[0][0]\r\n\r\n for i in range(1,len(arr1[0])):\r\n if ord(arr1[0][i])<ord(arr1[1][0]):\r\n ans+=arr1[0][i]\r\n else:\r\n break\r\n ans+=arr1[1][0]\r\n return ans\r\nstr1=input()\r\nprint(generatelogn(str1))\r\n", "n, s = input().split()\r\n\r\nviv = n[0]\r\nfor i in range(1,len(n)):\r\n if ord(n[i])>= ord(s[0]):\r\n print(viv + s[0])\r\n break\r\n viv += n[i]\r\nelse:\r\n print(viv + s[0])\r\n\r\n\r\n \r\n", "first, last = input().split()\r\ni = 1\r\nwhile i<len(first) and first[i]<last[0]:\r\n i += 1\r\nprint(first[:i]+last[0])", "a , b = input().split()\r\nn = max(len(a) , len(b))\r\ns = a[0]\r\nj = 0\r\nf=0\r\nfor i in range(1,len(a)):\r\n if a[i]<b[j]:\r\n s+=a[i]\r\n else:\r\n s+=b[j]\r\n f=1\r\n break\r\nif f==1:print(s)\r\nelse:print(s+b[0])\r\n", "im, nazw = input().split(' ')\r\nn = nazw[0]\r\nres = im[0]\r\nim = im[1:]\r\n#print(im, nazw)\r\n\r\nfor i in im:\r\n if (ord(i)<ord(n)):\r\n res += i\r\n else:\r\n break\r\n\r\nres += n\r\nprint(res)", "x=input()\r\nl=x.split(\" \")\r\nfirst=l[0]\r\nlast=l[1]\r\ns=l[0][0]\r\nfor i in range(1,len(first)):\r\n if ord(first[i])<ord(last[0]):\r\n s+=first[i]\r\n else:\r\n break\r\ns+=last[0]\r\nprint(s)\r\n", "# cook your dish here\r\ns = input()\r\na = s.split()\r\nst=''\r\ni = 1;\r\nst = st+a[0][0]\r\nwhile(i<len(a[0]) and a[0][i]<a[1][0]):\r\n st = st+a[0][i]\r\n i+=1\r\nst = st+a[1][0]\r\nprint(st)", "s,r=input().split()\r\nn,m=len(s),len(r)\r\nl=s[0]\r\nfor i in range(1,n):\r\n if(s[i]<r[0]):\r\n l=l+s[i]\r\n else:\r\n break\r\nl=l+r[0]\r\nprint(l)\r\n", "s1, s2 = map(str, input().split())\r\ns3 = s1+' '\r\narr = [s1[0]]\r\ni = 1\r\nwhile s3[i] < s2[0] and i<len(s1):\r\n arr.append(s3[i])\r\n i += 1\r\narr.append(s2[0])\r\nprint(''.join(map(str, arr)))\r\n", "f,l=input().split()\r\ns=f[0]\r\nss=l[0]\r\n \r\nfor i in range(1,len(f)):\r\n if(ord(f[i])<ord(l[0])):\r\n s+=f[i]\r\n else:\r\n break\r\n \r\ns+=ss\r\nprint(s)", "def generate_logins(first_name, last_name):\r\n logins = []\r\n for i in range(1, len(first_name) + 1):\r\n for j in range(1, len(last_name) + 1):\r\n login = first_name[:i] + last_name[:j]\r\n logins.append(login)\r\n return sorted(logins)\r\n\r\ndef main():\r\n first_name, last_name = input().split()\r\n logins = generate_logins(first_name, last_name)\r\n print(logins[0])\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1690126395.5659904", "f,l=list(map(str,input().split()))\r\nfr=f[0]\r\nlr=l[0]\r\nfor i in range(1,len(f)):\r\n if ord(f[i])<ord(lr):\r\n fr+=f[i]\r\n else:\r\n break\r\nfr+=lr\r\nprint(fr)", "a,b=input().split()\r\nk=[]\r\nfor i in range(len(a)):\r\n\tfor j in range(len(b)):\r\n\t\ts=a[:i+1]+b[:j+1]\r\n\t\tk.append(s)\r\nprint(sorted(k)[0])", "ass, bss = input().split()\r\nc = []\r\nr = \"\"\r\nfor i in range(len(ass)):\r\n r += ass[i]\r\n g = \"\"\r\n for j in range(len(bss)):\r\n g += bss[j]\r\n c.append(r + g)\r\nc.sort()\r\nprint(c[0])\r\n", "name, second_name=input().split()\r\nlogin=name[0]\r\nfor i in range(1,len(name)):\r\n if name[i]<second_name[0]:\r\n login+=name[i]\r\n else:\r\n break\r\nlogin+=second_name[0]\r\nprint(login)", "s1, s2 = map(str, input().split())\r\nm = 'zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz'\r\nfor i in range(1, len(s1) + 1):\r\n for j in range(1, len(s2) + 1):\r\n m = min(m, s1[:i] + s2[:j])\r\nprint(m)", "def main():\n a, b = input().split()\n b = b[0]\n for i, c in enumerate(a[1:], 1):\n if b <= c:\n print(a[:i], b, sep='')\n return\n print(a, b, sep='')\n\n\nif __name__ == '__main__':\n main()\n", "s = input().split(' ')\r\nr = s[0][0]\r\n\r\nfor i in range(1, len(s[0])):\r\n if ord(s[0][i]) < ord(s[1][0]):\r\n r += s[0][i]\r\n\r\n else:\r\n break\r\n\r\nprint(r + s[1][0])\r\n", "[a,b],r=input().split(),''\r\nfor i,c in enumerate(a):\r\n\tif i==0 or c<b[0]:r+=c\r\n\telse:break\r\nprint(r+b[0])", "a , b = input().split()\r\n\r\nans = \"z\" * 101\r\n\r\n\r\nf = \"\"\r\nl = \"\"\r\n\r\nfor i in a:\r\n f += i\r\n l = \"\"\r\n for j in b:\r\n l+=j\r\n ans = min(ans , f+l)\r\n\r\nprint(ans)\r\n\r\n", "name, lastname = input().split()\r\nlogin = name[0]\r\nfor letter in name[1:]:\r\n if letter < lastname[0]:\r\n login = login + letter\r\n else:\r\n break\r\nlogin += lastname[0]\r\nprint(login)", "name, surname = input().split(' ')[:2]\nbest = ''\nfirst = True\nfor lenName in range(1, len(name) + 1):\n for lenSName in range(1, len(surname) + 1):\n candidate = name[:lenName] + surname[:lenSName]\n if first or candidate < best:\n best = candidate\n first = False\nprint(best)\n", "s3=input()\r\ns1=s3.split()[0]\r\ns2=s3.split()[1]\r\nl1=len(s1)\r\nl2=len(s2)\r\nv=[]\r\nfor i in range(0,l1):\r\n for j in range (0,l2):\r\n ans=''\r\n for k in range(0, i+1):\r\n ans=ans+s1[k]\r\n for k in range(0, j+1):\r\n ans=ans+s2[k]\r\n v.append(ans)\r\nv.sort()\r\nprint(v[0])\r\n", "src=input().split()\r\na,b=src[0],src[1]\r\n\r\nres=[a[0]]\r\ni,j=1,0\r\nwhile i<len(a) and j==0:\r\n if a[i]<b[j]:\r\n res.append(a[i])\r\n i+=1\r\n else:\r\n res.append(b[j])\r\n j+=1\r\n\r\nif j==0:\r\n res.append(b[0])\r\nprint(''.join(res))", "a, b = map(str, input().split())\r\nlst = []\r\nbyf_i = \"\"\r\nfor i in range(len(a)):\r\n byf_i+=a[i]\r\n byf_j = \"\"\r\n for j in range(len(b)):\r\n byf_j+=b[j]\r\n lst.append(byf_i+byf_j)\r\nlst.sort()\r\nprint(lst[0])\r\n\r\n\r\n", "s = input().split()\n\nname = s[0]\nfam = s[1]\n\nvar_ = []\nfor i in range(1, len(name) + 1):\n\tfor j in range(1, len(fam) + 1):\n\t\tname_pr = name[:i]\n\t\tfam_pr = fam[:j]\n\t\tvar_.append(name_pr + fam_pr)\nvar_.sort()\nprint(var_[0])", "a,b=input().split()\r\nz=[]\r\nfor i in range(len(a)):\r\n for x in range(len(b)):\r\n z.append(a[:i+1]+b[:x+1])\r\nz.sort()\r\nprint(z[0])\r\n\r\n \r\n", "#list(map(int,input().split()))\r\n#list(input().strip().split())\r\narr=list(input().strip().split())\r\ns1=arr[0]\r\ns2=arr[1]\r\nans=[s1[0]]\r\nk=1\r\nwhile k<len(s1):\r\n if s1[k]>=s2[0]:\r\n break\r\n ans.append(s1[k])\r\n k+=1\r\nans.append(s2[0])\r\nprint(\"\".join(ans))", "a, b = input().split()\r\ns = set()\r\nfor i in range(1, len(a) + 1):\r\n s.add(a[:i] + b[0])\r\nprint(min(s))\r\n", "f, l = input().split()\r\nres = f[0]\r\ni = 1\r\nwhile (i != len(f)):\r\n if (f[i] < l[0]):\r\n res = res + f[i];\r\n else:\r\n break\r\n i += 1\r\n \r\nres += l[0]\r\nprint(res)", "s=input().split(\" \")\nl=[]\ns1=s[0]\ns2=s[1]\nfor i in range(1,len(s1)+1):\n\tl.append(s1[0:i])\np=[]\nfor i in range(1,len(s2)+1):\n\tp.append(s2[0:i])\n\nm=[]\nfor i in range(0,len(l)):\n\tfor j in range(0,len(p)):\n\t\tm.append(l[i]+p[j])\nm.sort()\nprint(m[0])\n" ]

[ "import sys, random\r\ninput = lambda : sys.stdin.readline().rstrip()\r\n\r\n\r\nwrite = lambda x: sys.stdout.write(x+\"\\n\"); writef = lambda x: print(\"{:.12f}\".format(x))\r\ndebug = lambda x: sys.stderr.write(x+\"\\n\")\r\nYES=\"Yes\"; NO=\"No\"; pans = lambda v: print(YES if v else NO); INF=10**18\r\nLI = lambda : list(map(int, input().split())); II=lambda : int(input()); SI=lambda : [ord(c)-ord(\"a\") for c in input()]\r\ndef debug(_l_):\r\n for s in _l_.split():\r\n print(f\"{s}={eval(s)}\", end=\" \")\r\n print()\r\ndef dlist(*l, fill=0):\r\n if len(l)==1:\r\n return [fill]*l[0]\r\n ll = l[1:]\r\n return [dlist(*ll, fill=fill) for _ in range(l[0])]\r\ndef gcd2(a, b):\r\n \"\"\"a*x + b*y = gcd(a,b)なるx,yも求める\r\n \"\"\"\r\n l = []\r\n while b:\r\n l.append(divmod(a,b))\r\n a, b = b, a%b\r\n x, y = 1, 0\r\n for aa,bb in l[::-1]:\r\n x, y = y, x - aa*y\r\n return a, x, y\r\n\r\ndef modinv(x, M):\r\n \"\"\"素数ではないM、Mと互いに素なxに対し\r\n x * y == 1 mod M なるyを求める\r\n \"\"\"\r\n a,xx,yy = gcd2(x,M)\r\n return a,xx%M\r\n\r\ndef solve(a,b,n):\r\n \"\"\"a*x = b mod nを解く\r\n \"\"\"\r\n g,xx,yy = gcd2(a,n)\r\n if b%g!=0:\r\n return None\r\n a //= g\r\n n //= g\r\n b //= g\r\n # aとnが互いに素になっているので\r\n ainv = modinv(a, n)[1]\r\n x = ainv*b%n\r\n return x\r\n\r\ndef crt(rs, ms):\r\n \"\"\"中国剰余定理\r\n x == rs[i] mod ms[i] をみたすxをを求め、(x, l(=ms))を返す\r\n (そのようなxは x + i * lとして書ける)\r\n 存在しない場合はNoneを返す\r\n 長さが0の配列を渡すと(0,1)を返す\r\n \"\"\"\r\n r0 = 0\r\n m0 = 1\r\n for r1,m1 in zip(rs, ms):\r\n if m0<m1:\r\n m0, m1 = m1, m0\r\n r0, r1 = r1, r0\r\n if m0%m1==0:\r\n if r0%m1 != r1:\r\n return None,None\r\n else:\r\n continue\r\n# print(m0,m1)\r\n g,im = modinv(m0, m1)\r\n u1 = m1//g\r\n if (r1-r0)%g!=0:\r\n return None,None\r\n x = (r1-r0) // g % u1 * im % u1\r\n r0 += x * m0\r\n m0 *= u1\r\n if r0<0:\r\n r0 += m0\r\n return r0,m0\r\n\r\n### セグメント木(はやい)\r\nclass SG:\r\n def __init__(self, n, v=None):\r\n self._n = n\r\n self.geta = 0\r\n x = 0\r\n while (1 << x) < n:\r\n x += 1\r\n self._log = x\r\n self._size = 1 << self._log\r\n self._d = [ninf] * (2 * self._size)\r\n if v is not None:\r\n for i in range(self._n):\r\n self._d[self._size + i] = v[i]\r\n for i in range(self._size - 1, 0, -1):\r\n self._update(i)\r\n def _update(self, k):\r\n self._d[k] = op(self._d[2 * k], self._d[2 * k + 1])\r\n def update(self, p, x):\r\n assert 0 <= p < self._n\r\n# x -= self.geta\r\n p += self._size\r\n self._d[p] = x\r\n for i in range(1, self._log + 1):\r\n# self._update(p >> i)\r\n k = p>>i\r\n self._d[k] = op(self._d[2 * k], self._d[2 * k + 1])\r\n def get(self, p):\r\n assert 0 <= p < self._n\r\n return self._d[p + self._size] # + self.geta\r\n def check(self):\r\n return [self.get(p) for p in range(self._n)]\r\n def query(self, left, right):\r\n # [l,r)の総和\r\n assert 0 <= left <= right <= self._n\r\n sml = ninf\r\n smr = ninf\r\n left += self._size\r\n right += self._size\r\n # 外側から計算していく(lは小さい側から, rは大きい側から)\r\n while left < right:\r\n if left & 1:\r\n sml = op(sml, self._d[left])\r\n left += 1\r\n if right & 1:\r\n right -= 1\r\n smr = op(self._d[right], smr)\r\n left >>= 1\r\n right >>= 1\r\n return op(sml, smr) # + self.geta\r\n# def update_all(self, v):\r\n# # 全体加算\r\n# self.geta += v\r\n def query_all(self):\r\n return self._d[1] # + self.geta\r\n def max_right(self, left, f):\r\n \"\"\"f(op(a[l], a[l + 1], ..., a[r - 1])) = true となる最大の r\r\n -> rはf(op(a[l], ..., a[r]))がFalseになる最小のr\r\n \"\"\"\r\n# assert 0 <= left <= self._n\r\n# assert f(ninf)\r\n if left == self._n:\r\n return self._n\r\n left += self._size\r\n sm = ninf\r\n first = True\r\n while first or (left & -left) != left:\r\n first = False\r\n while left % 2 == 0:\r\n left >>= 1\r\n if not f(op(sm, self._d[left])):\r\n while left < self._size:\r\n left *= 2\r\n if f(op(sm, self._d[left])):\r\n sm = op(sm, self._d[left])\r\n left += 1\r\n return left - self._size\r\n sm = op(sm, self._d[left])\r\n left += 1\r\n return self._n\r\n def min_left(self, right, f):\r\n \"\"\"f(op(a[l], a[l + 1], ..., a[r - 1])) = true となる最小の l\r\n -> l は f(op(a[l-1] ,..., a[r-1])) が false になる最大の l\r\n \"\"\"\r\n# assert 0 <= right <= self._n\r\n# assert f(ninf)\r\n if right == 0:\r\n return 0\r\n right += self._size\r\n sm = ninf\r\n first = True\r\n while first or (right & -right) != right:\r\n first = False\r\n right -= 1\r\n while right > 1 and right % 2:\r\n right >>= 1\r\n if not f(op(self._d[right], sm)):\r\n while right < self._size:\r\n right = 2 * right + 1\r\n if f(op(self._d[right], sm)):\r\n sm = op(self._d[right], sm)\r\n right -= 1\r\n return right + 1 - self._size\r\n sm = op(self._d[right], sm)\r\n return 0\r\n# [左よせの(l, m, r), 右よせの(l, m, r), 長さの max, 区間の長さ]\r\ndef op(l,r):\r\n if l[0] is None or r[0] is None:\r\n return (None, None)\r\n return crt([l[0], r[0]], [l[1], r[1]])\r\nninf = (0,1)\r\n\r\nn,m = list(map(int, input().split()))\r\nindex = [[] for _ in range(m)]\r\nls = [0]*n\r\nfor i in range(n):\r\n k,*a = LI()\r\n ls[i] = k\r\n for j in range(k):\r\n index[a[j]-1].append((i,j))\r\nsg = SG(n, [(None, None) for _ in range(n)])\r\nfor v in range(m):\r\n for i,j in index[v]:\r\n sg.update(i, (j, ls[i]))\r\n # sg.update(n+i, ((j-1)%ls[i], ls[i]))\r\n val = 0\r\n for i,j in index[v]:\r\n res = sg.max_right(i, lambda item: item[0] is not None)\r\n val = max(val, res-i)\r\n print(val)\r\n# if v==0:\r\n# break\r\n for i,j in index[v]:\r\n sg.update(i, (None,None))\r\n # sg.update(n+i, (None,None))\r\n " ]

[ "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\nlist_1 = []\r\n\r\nlist_1.append((x+y)*z)\r\nlist_1.append(x*(y+z))\r\nlist_1.append(x+y+z)\r\nlist_1.append(x*y*z)\r\n\r\nprint(max(list_1))", "a=int(input())\nb=int(input())\nc=int(input())\nz=[]\nz.append(a+b+c)\nz.append(a*b*c)\nz.append((a+b)*c)\nz.append(a*(b+c))\nz.append(a+b*c)\nz.append(a*b+c)\nz.sort()\nprint(z[-1])", "i=[]\r\nans=[]\r\nfor _ in range(3):\r\n i.append(int(input()))\r\n\r\n\r\nans.append(i[0]*i[1]*i[2])\r\nans.append(i[0] + i[1] + i[2])\r\nans.append(i[0]*(i[1] + i[2]))\r\nans.append((i[0]+i[1]) * i[2])\r\n\r\nprint(max(ans))\r\n", "nums = []\r\n\r\nfor i in range(3):\r\n nums.append(int(input()))\r\nsum = sum(nums)\r\nmult = (nums[0]*nums[1]*nums[2])\r\nop1 = nums[0]*nums[1] + nums[2]\r\nop2 = nums[0] + nums[1] * nums[2]\r\nop3 = (nums[0] + nums[1]) * nums[2]\r\nop4 = nums[0] * (nums[1] + nums[2])\r\n\r\nprint(max(sum, mult, op1, op2, op3, op4))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nx = a*b*c\r\ny = a+b+c\r\nz = a+b*c\r\ni = a*b+c\r\nj = a*(b+c)\r\nk = (a+b)*c\r\nl = [x, y, z, i, j, k]\r\nprint(max(l))", "d=[]\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nmaxsum=a+b+c\r\nmaxsum1=(a+b)*c\r\nmaxsum2=a*(b+c)\r\nmaxsum3=a*b*c\r\nmaxsum4=a+b*c\r\nmaxsum5=a*b+c\r\nd.append(maxsum)\r\nd.append(maxsum1)\r\nd.append(maxsum2)\r\nd.append(maxsum3)\r\nd.append(maxsum4)\r\nd.append(maxsum5)\r\nprint(max(d))", "# CF_Problem: 479A_Expression\r\n\r\ndef maxValue(a, b, c):\r\n expr1 = a + b + c\r\n expr2 = a + b * c\r\n expr3 = a * b + c\r\n expr4 = a * b * c\r\n expr5 = (a + b) * c\r\n expr6 = a * (b + c)\r\n\r\n return max(expr1, expr2, expr3, expr4, expr5, expr6)\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nprint(maxValue(a, b, c))\r\n", "(lambda a, b, c: print(max(a + b * c, a * (b + c), a * b * c, (a + b) * c, a + b + c)))(*[int(input()) for _ in range(3)])", "# Read input\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate different combinations of expressions\r\nexpression1 = a + b + c\r\nexpression2 = a * b * c\r\nexpression3 = a * (b + c)\r\nexpression4 = (a + b) * c\r\n\r\n# Find the maximum value among the expressions\r\nmax_value = max(expression1, expression2, expression3, expression4)\r\n\r\n# Print the maximum value\r\nprint(max_value)\r\n", "#Initializes digits and highest number\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nhighest = 0\r\n\r\n#checks various operations for highest possible number\r\nif (a + b) * c > highest:\r\n highest = (a + b) * c\r\nif a * (b + c) > highest:\r\n highest = a * (b + c)\r\nif a * b * c > highest:\r\n highest = a * b * c\r\nif a + b + c > highest:\r\n highest = a + b + c\r\n\r\n#prints final answer\r\nprint(highest)", "n1 = int(input())\r\nn2 = int(input())\r\nn3 = int(input())\r\nmax_value = max(n1 + n2 * n3, n1 * (n2 + n3), n1 * n2 * n3, (n1 + n2) * n3, n1 + n2 + n3)\r\nprint(max_value)\r\n", "def main():\r\n x=[int(input()) for i in range(3)]\r\n a = sum(x)\r\n b= x[0]*x[1]*x[2]\r\n c= (x[0]+x[1])*x[2]\r\n d= x[0]*(x[1]+x[2])\r\n return max(a,b,c,d)\r\nprint(main())\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nr=0\r\nr=max(r,a+(b*c))\r\nr=max(r,a*(b+c))\r\nr=max(r,a*b*c)\r\nr=max(r,a+b+c)\r\nr=max(r,(a+b)*c)\r\nprint(r)\r\n\r\n\r\n\"\"\" 1+2*3=7\r\n1*(2+3)=5\r\n1*2*3=6\r\n(1+2)*3=9 \"\"\"", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nmaxAns = max(a+b+c,a*b*c,a+b*c,a*b+c,(a+b)*c,a*(b+c))\r\nprint(maxAns)\r\n", "# Read input values\nfirstInteger = int(input())\nsecondInteger = int(input())\nthirdInteger = int(input())\n\n# Calculate and print the maximum value of the expression\nmaxValue = max(firstInteger + secondInteger + thirdInteger, firstInteger * secondInteger * thirdInteger, (firstInteger + secondInteger) * thirdInteger, firstInteger * (secondInteger + thirdInteger))\nprint(maxValue)\n\n \t \t \t\t \t \t\t \t \t \t \t \t \t", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\n\r\nif a!=1 and b!=1 and c!=1:\r\n print(a*b*c)\r\nelse:\r\n print(max((a+b+c),((a+b)*c),(a*(b+c)),(c*(a+b)),(a*(b+c))))", "a,b,c = int(input()),int(input()),int(input())\r\nans = a * b * c\r\nans = max(ans, a + b + c, (a + b) * c, a * (b + c), a * b + c, a + b * c)\r\nprint(ans)\r\n", "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\n \r\nexpr1 = x + y + z\r\nexpr2 = x * y * z\r\nexpr3 = x + y * z\r\nexpr4 = x * (y + z)\r\nexpr5 = (x + y) * z\r\n \r\nmax_value = max(expr1, expr2, expr3, expr4, expr5)\r\nprint(max_value)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif a == 1 and c == 1:\r\n d = a+b+c\r\nelif a==1:\r\n d = (a+b)*c\r\nelif c==1:\r\n d = a*(b+c)\r\nelif b == 1:\r\n if a<c:\r\n d = (a+b)*c\r\n else:\r\n d = a*(b+c)\r\nelse:\r\n d = a*b*c\r\nprint(d)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nx1 = a+b*c\r\nx2 = a*(b+c)\r\nx3 = a*b*c\r\nx4 = (a+b)*c\r\nx5 = a+b+c\r\nx6 = a+b*c\r\nprint(max(x1, x2, x3, x4, x5, x6))", "a=int(input()) \r\nb=int(input())\r\nc=int(input())\r\nd=a*(b+c)\r\ne=a*b*c\r\nf=a+b+c\r\ng=(a*b)+c\r\nh=a+(b*c)\r\ni=(a+b)*c\r\n\r\nprint(max(d,e,f,g,h,i))", "n = []\r\na = int(input())\r\nn.append(a)\r\na = int(input())\r\nn.append(a)\r\na = int(input())\r\nn.append(a)\r\n\r\neqs = [\"a+b*c\", \"a*(b+c)\", \"a*b*c\", \"(a+b)*c\", \"a+b+c\"]\r\nmaxi = -1\r\nfor eq in eqs:\r\n eq = eq.replace('a', str(n[0]))\r\n eq = eq.replace('b', str(n[1]))\r\n eq = eq.replace('c', str(n[2]))\r\n res = eval(eq)\r\n if res > maxi:\r\n maxi = res\r\nprint(maxi)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\narr = [a, b, c]\r\nresultsArr = [a+b+c, \r\n a+b*c,\r\n (a+b)*c,\r\n a*b+c,\r\n a*(b+c),\r\n a*b*c]\r\nprint(max(resultsArr))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl1=[a,b,c]\r\nif 1 not in l1:\r\n print(a*b*c)\r\nelif a!=1 or c!=1:\r\n print((min(a,c)+b)*max(a,c))\r\nelif a==c==1:\r\n print(a+b+c)", "def find_maximum_value(a, b, c):\r\n max_value = max(a + b + c, a * (b + c), a * b * c, (a + b) * c)\r\n\r\n return max_value\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nresult = find_maximum_value(a, b, c)\r\nprint(result)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\na1=a+b*c\r\na2=a*(b+c)\r\na3=a*b*c\r\na4=(a+b)*c\r\na5=a+b+c\r\nif a==1 and b==1 and c==1:\r\n print(3)\r\nelif a1>=a2 and a2>=a3 and a3>=a4 and a1>=a5:\r\n print(a1)\r\nelif a2>=a1 and a2>=a3 and a2>=a4 and a2>=a5:\r\n print(a2)\r\nelif a3>=a1 and a3>=a2 and a3>=a4 and a3>=a5:\r\n print(a3)\r\nelif a4>=a1 and a4>=a2 and a4>=a3 and a4>=a5:\r\n print(a4)\r\nelif a1==a2==a3==a4:\r\n print(a3)\r\nelse:\r\n print(a5)", "# ==================================================\r\n# Problem : 479A - Expression\r\n# Run time : 0.061 sec.\r\n# Language : Python 3.5\r\n# ==================================================\r\n\r\nfrom sys import stdin, stdout\r\n\r\ndef main():\r\n\ta, b, c = tuple(map(int, stdin.read().split()))\r\n\r\n\tstdout.write(str(max(a+b+c, a+b*c, (a+b)*c, a*b+c, a*(b+c), a*b*c)) + '\\n')\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "l=[]\r\nfor i in range(3):\r\n l.append(int(input()))\r\na=l[0]\r\nb=l[1]\r\nc=l[2]\r\ns=[a+b+c,a*b*c,a*(b+c),a*b+c,a+b*c,(a+b)*c]\r\nprint(max(s))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate the values of each expression\r\nexpression_1 = a + b + c\r\nexpression_2 = (a + b) * c\r\nexpression_3 = a * (b + c)\r\nexpression_4 = a * b * c\r\n\r\n# Find the maximum value\r\nmax_value = max(expression_1, expression_2, expression_3, expression_4)\r\n\r\nprint(max_value)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nr1 = a + b + c\r\nr2 = a * b * c\r\nr3 = (a + b) * c\r\nr4 = a * (b + c)\r\n\r\nif r1 >= r2 and r1 >= r3 and r1 >= r4:\r\n print(r1)\r\nelif r2 >= r1 and r2 >= r3 and r2 >= r4:\r\n print(r2)\r\nelif r3 >= r1 and r3 >= r2 and r3 >= r4:\r\n print(r3)\r\nelse:\r\n print(r4)\r\n\r\n\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif a>=b and a>=c:\r\n ans=(a*(b+c))\r\nelif b>=c and b>=a:\r\n if a>c:\r\n ans=a*(b+c)\r\n else:\r\n ans=(a+b)*c\r\nelif c>=b and c>=a:\r\n ans=(c*(a+b))\r\nif a*b*c>ans:\r\n ans=a*b*c\r\nelif a+b+c>ans:\r\n ans=a+b+c\r\nprint(ans)", "a = int(input())\nb = int(input())\nc = int(input())\nq = max(a*b*c, a*b+c, a*(b+c), a+b+c, a+b*c, (a+b)*c)\nprint(q)\n", "a, b, c = int(input()), int(input()), int(input())\r\nmax1 = a + b + c\r\nmax2 = a * b * c\r\nmax3 = (a + b) * c\r\nmax4 = a * (b + c)\r\nmaxim = 0\r\narr = [max1, max2, max3, max4]\r\nfor val in arr:\r\n if val > maxim:\r\n maxim = val \r\nprint(maxim)", "def expression(a, b, c):\n w = a * b * c\n x = a * (b + c)\n y = a + b + c\n z = (a + b) * c\n return max(w, x, y, z)\n\n\na = int(input())\nb = int(input())\nc = int(input())\n\nprint(expression(a, b, c))\n \t\t\t \t\t \t\t \t\t\t \t \t \t \t \t \t\t", "def solve():\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n first = a+b+c\r\n second = a+b*c\r\n third = a*b+c\r\n fourth = (a+b)*c\r\n fifth = a*(b+c)\r\n sixth = a*b*c\r\n print(max(first, second, third, fourth, fifth, sixth))\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n\r\narr = [ a*b*c , a*b +c , (a+b)*c , a+b+c , \r\n a+(b*c) , a* (b+c) ]\r\n \r\nprint(max(arr))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif a == c == 1:\r\n print(a + b + c)\r\nelif a == 1 or c == 1:\r\n print((1 + b) * max(a,c))\r\nelif b == 1:\r\n print((min(a,c) + b) * max(a,c))\r\nelse:\r\n print(a * b * c)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nt = [ a+b+c, a*b*c, (a+b)*c , a+(b*c),a*(b+c),a*b+c ]\r\nprint(max(t))\r\n", "a=int(input());b=int(input());c=int(input());\r\nlis=[a+b+c,a*b*c,(a+b)*c,a*(b+c),a+b*c,a*b+c]\r\nprint(max(lis))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calcula todas las posibles expresiones y encuentra la máxima\r\nmax_value = max(\r\n a + b + c, # a + b + c\r\n a + b * c, # a + b * c\r\n a * b + c, # a * b + c\r\n a * b * c, # a * b * c\r\n (a + b) * c, # (a + b) * c\r\n a * (b + c) # a * (b + c)\r\n)\r\n\r\nprint(max_value)", "a = int(input(\"\"))\r\nb = int(input(\"\"))\r\nc = int(input(\"\"))\r\n\r\n# n1 = a + b + c\r\n# n2 = a * b * c\r\n# n3 = a * b + c\r\n# n4 = a + b * c\r\n# n5 = (a + b) * c\r\n# n6 = a * (b + c)\r\n# n7 = (a * b) * c\r\n# n8 = a * (b * c)\r\n\r\nlst = [a + b + c, a * b * c, a * b + c, a + b * c, (a + b) * c, a * (b + c), (a * b) * c, a * (b * c)]\r\nprint(max(lst))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nresult = (a*b*c, a+b*c, (a+b)*c, a+b+c, a*(b+c), a*b+c)\r\nprint(max(result))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\narr = [a, b, c]\r\nMax = max(arr)\r\n\r\nf1 = a + b + c\r\nf2 = a * b + c\r\nf3 = a * (b + c)\r\nf4 = a + b * c\r\nf5 = (a + b) * c\r\nf6 = a * b * c\r\n\r\nprint(max(f1, f2, f3, f4, f5, f6))", "\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n\r\ne0 = a + b * c \r\ne1 = a * b * c\r\ne2 = a * (b + c)\r\ne3 = a * b * c\r\ne4 = a + b + c\r\ne5 = (a + b) * c\r\n\r\nprint(max(e0, e1, e2, e3, e4, e5))\r\n", "a=int(input())\nb=int(input())\nc=int(input())\nd=a+b*c\ne=a*b*c\nf=a*(b+c)\ng=(a+b)*c\nh=a+b+c\nans=max(d,e,f,g,h)\nprint (ans)\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nlist=[]\r\nlist.append(a+b+c)\r\nlist.append(a*b+c)\r\nlist.append(a+b*c)\r\nlist.append(a*b*c)\r\nlist.append((a+b)*c)\r\nlist.append(a*(b+c))\r\nlist.sort()\r\nprint(list[len(list)-1])", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nnumbers = [a, b, c]\r\nw = numbers[0] * numbers[1] + numbers[2]\r\nx = (numbers[0] * numbers[1] * numbers[2])\r\ny = (numbers[0] + numbers[1]) * numbers[2]\r\nz = (numbers[0] + numbers[1] + numbers[2])\r\nl = (numbers[0] * (numbers[1] + numbers[2]))\r\nprint(max(x, y , z, w, l))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nn=a+b+c\r\nm=a*(b+c)\r\np=(a+b)*c\r\nq=a*b*c\r\nprint(max(n,m,p,q))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(max(a+b+c, a*b+c, a+b*c, a*b*c, (a+b)*c, a*(b+c)))\r\n\r\n\r\n# ans = max(a, c) * b\r\n# if ans * min(a, c) > ans + min(a, c):\r\n# ans += min(a, c)\r\n# else:\r\n# ans += min(a, c)\r\n# print(ans)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\np=a+b+c\r\nq=a*b+c \r\nr=a*(b+c)\r\ns=a+b*c \r\nt=(a+b)*c \r\nu=a*b*c \r\n\r\nprint(max(p,q,r,s,t,u))", "\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n\r\n\r\nr = []\r\n\r\n# 1+2*3=7\r\nr.append(a + b * c)\r\nr.append(a * b + c)\r\n# 1*2*3=6\r\nr.append(a * b * c)\r\nr.append(a + b + c)\r\n# (1+2)*3=9\r\nr.append((a + b) * c)\r\nr.append(a * (b + c))\r\n\r\n\r\nprint(max(r))", "l=[]\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=a+b+c\r\nl.append(d)\r\ne=(a+b)*c\r\nl.append(e)\r\nf=a*(b+c)\r\nl.append(f)\r\ng=a*b*c\r\nl.append(g)\r\nprint(max(l))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nvalues=[a+b+c,\r\n a*b*c,\r\n a+b*c,\r\n (a+b)*c,\r\n a*(b+c)\r\n ]\r\nvalue=max(values)\r\nprint(value)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nex1 = a * b *c\r\nex2 = a+b+c\r\nex3 = a*b + c\r\nex4 = a + b*c\r\nex5 = a*(b+c)\r\nex6 = (a+b)*c\r\nans = max(ex1,ex5,ex6,ex2,ex3,ex4)\r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nmax_value = a * b * c\r\nmax_value = max(max_value, a + b + c) \r\nmax_value = max(max_value, a * (b + c)) \r\nmax_value = max(max_value, (a + b) * c) \r\n\r\nprint(max_value)\r\n", "a=int(input())\nb=int(input())\nc=int(input())\nx=a+b*c\ny=a*(b+c)\nz=a*b*c\nn=(a+b)*c\nm=a+b+c\nprint(max(x,y,z,n,m))\n \t\t \t\t \t\t\t\t \t\t\t \t \t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nexpression1 = a + b + c\r\nexpression2 = a * b * c\r\nexpression3 = a * (b + c)\r\nexpression4 = (a + b) * c\r\nmax_value = max(expression1, expression2, expression3, expression4)\r\nprint(max_value)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate all possible values of expressions\r\nexpr1 = a + b + c\r\nexpr2 = a + (b * c)\r\nexpr3 = a * (b + c)\r\nexpr4 = a * b * c\r\nexpr5 = (a + b) * c\r\n# Find and print the maximum value\r\nmax_value = max(expr1, expr2, expr3, expr4, expr5)\r\nprint(max_value)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nadd = a+b+c\r\n\r\nmix11 = a+(b*c)\r\nmix12 = (a+b)*c\r\n\r\nmix21 = (a*b)+c\r\nmix22 = a*(b+c)\r\n\r\nmultiply = a*b*c\r\n\r\nans = add\r\n\r\nif mix11 > ans:\r\n ans = mix11\r\nif mix12 > ans:\r\n ans = mix12\r\nif mix21 > ans:\r\n ans = mix21\r\nif mix22 > ans:\r\n ans = mix22\r\nif multiply > ans:\r\n ans = multiply\r\n\r\nprint(ans)", "a,b,c = map(int, [input() for i in range(3)])\r\n\r\nd = [\r\n\ta+b+c,\r\n\t(a+b)*c,\r\n\ta*(b+c),\r\n\ta*b*c,\r\n\ta+b*c,\r\n\ta*b+c\r\n]\r\n\r\nprint(max(d))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nlst1=[]\r\nlst1.append(a+b)\r\nlst1.append(a*b)\r\nlst2=[]\r\nlst2.append(b+c)\r\nlst2.append(b*c)\r\nlst3=[]\r\nlst3.append(lst1[0]*c)\r\nlst3.append(lst1[0]+c)\r\nlst3.append(lst1[1]*c)\r\nlst3.append(lst1[1]+c)\r\nlst3.append(lst2[0]*a)\r\nlst3.append(lst2[0]+a)\r\nlst3.append(lst2[1]*a)\r\nlst3.append(lst2[1]+a)\r\nprint(max(lst3))\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nz = a+b+c \r\ng = a*(b+c)\r\nl = a*c+b\r\nn = a*b*c\r\nd = (a+b)*c\r\ni = a+b*c\r\nm = [l, g, n, d, i, z]\r\nprint(max(m))", "# Решение задач проекта CODEFORSES, Задача 479A\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ограничение по времени на тест1 секунда\r\nограничение по памяти на тест256 мегабайт\r\nвводстандартный ввод\r\nвыводстандартный вывод\r\nПетя учится в школе и очень любит математику. Уже несколько занятий они с классом проходят\r\nарифметические выражения. На последнем уроке учительница написала на доске три положительных\r\nцелых числа a, b, c. Задание заключалось в том, чтобы расставить между этими числами знаки операций '+' и '*',\r\nа также, возможно, скобки. Значение получившегося выражения должно быть как можно больше. Рассмотрим пример:\r\nпусть учительница выписала на доску числа 1, 2 и 3. Вот некоторые варианты расстановки знаков и скобок:\r\n\r\n1+2*3=7\r\n1*(2+3)=5\r\n1*2*3=6\r\n(1+2)*3=9\r\nОбратите внимание на то, что знаки операций можно вставлять только между a и b, а также между b и c, то есть нельзя менять числа местами. Так, в приведенном примере нельзя получить выражение (1+3)*2.\r\n\r\nЛегко убедиться, что максимальное значение, которое можно получить, — это 9.\r\n\r\nВаша задача — по заданным a, b и c вывести, какое максимальное значение выражения можно получить.\r\n\r\nВходные данные\r\nВо входных данных записаны три целых числа a, b и c, каждое в отдельной строке (1 ≤ a, b, c ≤ 10).\r\n\r\nВыходные данные\r\nВыведите максимальное значение выражения, которое можно получить.\r\n'''\r\n\r\nfrom datetime import datetime\r\nimport time\r\nstart_time = datetime.now()\r\nimport functools\r\nfrom itertools import *\r\nfrom collections import Counter\r\nimport random\r\nimport math\r\n\r\na1=int(input())\r\na2=int(input())\r\na3=int(input())\r\nrez = []\r\nrez.append(a1*a2*a3)\r\nrez.append((a1+a2)*a3)\r\nrez.append(a1*(a2+a3))\r\nrez.append(a1+a2+a3)\r\nrez.append(a1*a2+a3)\r\nrez.append(a1+a2*a3)\r\nprint(max(rez))\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=[a,b,c]\r\ns=d[0]*d[1]*d[2]\r\nq=(d[0]+d[1])*d[2]\r\nj=sum(d)\r\nk=d[0]*(d[1]+d[2])\r\nm=[s,q,j,k]\r\nprint(max(m))", "exec('k,h,y='+'int(input()),'*3);\r\nprint(max(k+h+y,k*h*y,(k+h)*y,k*(h+y)))", "# Read input\r\na = int(input().strip())\r\nb = int(input().strip())\r\nc = int(input().strip())\r\n\r\n# Try all possible expressions\r\nresult1 = a + b + c\r\nresult2 = a * b * c\r\nresult3 = a + b * c\r\nresult4 = a * (b + c)\r\nresult5 = (a + b) * c\r\nresult6 = a * b + c\r\n\r\n# Find the maximum result\r\nmax_result = max(result1, result2, result3, result4, result5, result6)\r\n\r\n# Print the result\r\nprint(max_result)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nA=max([a+b+c,(a+b)*c,a+b*c,a*(b+c),a*b+c,a*b*c])\r\nprint(A)", "# Expression 479A\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = a+b*c\r\ne = a*(b+c)\r\nf = a*b*c\r\ng = (a+b)*c\r\nh = a+b+c\r\nprint(max(list([d,e,f,g,h])))", "def maximum_expression():\r\n n1 = int(input())\r\n n2 = int(input())\r\n n3 = int(input())\r\n return max(n1 + n2 * n3, n1 * (n2 + n3), n1 * n2 * n3, (n1 + n2) * n3,n1+n2+n3)\r\n\r\n\r\nprint(maximum_expression())\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nres=[]\r\nres.append(a+b+c)\r\nres.append(a*(b+c))\r\nres.append((a+b)*c)\r\nres.append(a*b*c)\r\nres.sort()\r\nprint(res[3])", "a =int (input())\r\nb =int(input())\r\nc =int(input())\r\n\r\na1= a+b*c\r\na2= a*(b+c)\r\na3= a*b*c\r\na4= (a+b)*c\r\na5= a+b+c\r\nlista = [a1,a2,a3,a4,a5]\r\n\r\n\r\n\r\n\r\n\r\nprint(max(lista))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Evaluate all possible expressions\r\nexp1 = a + b + c\r\nexp2 = a + b * c\r\nexp3 = a * b + c\r\nexp4 = a * b * c\r\nexp5 = (a + b) * c\r\nexp6 = a * (b + c)\r\n\r\n# Find the maximum value\r\nmax_value = max(exp1, exp2, exp3, exp4, exp5, exp6)\r\n\r\nprint(max_value)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = max(a*(b+c), a+b+c, a*b*c, (a+b)*c)\r\nprint(ans)\r\n", "a = int(input())\nb = int(input())\nc = int(input())\n\n# Calculate all possible results using different order of operations\nresults = [\n a + b + c, # a + b + c\n a + b * c, # a + (b * c)\n a * b + c, # (a * b) + c\n a * b * c, # a * b * c\n (a + b) * c, # (a + b) * c\n a * (b + c) # a * (b + c)\n]\n\n# Find the maximum result among all possibilities\nmax_result = max(results)\n\nprint(max_result)\n\t\t \t \t\t \t \t \t\t\t \t\t \t\t \t", "import sys\r\nimport bisect\r\nfrom math import *\r\n# Fast input reading\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n# Constants\r\nMOD = 10**9 + 7\r\nINF = float('inf')\r\n\r\n# Utility functions\r\ndef gcd(a, b):\r\n while b:\r\n a, b = b, a % b\r\n return a\r\n\r\ndef lcm(a, b):\r\n return a * b // gcd(a, b)\r\n\r\n# Main function\r\ndef main():\r\n [a,b,c]=[int(input()) for i in range(3)]\r\n print(max(a+b*c,(a+b)*c,a*(b+c),(a*b)+c,a*b*c,a+b+c))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nkek = a+(b*c)\r\nkekpart1 = (a+b)*c\r\nkekpart2 = a*(b+c)\r\nkekmult = a*b*c\r\nkekaddn = a+b+c\r\n\r\nprint(max(kek,kekpart1,kekpart2,kekmult,kekaddn))\r\n", "def main() :\r\n print(max_Of_Expression(input_Num(), input_Num(), input_Num()))\r\n\r\ndef max_Of_Expression(a, b, c) :\r\n return max(\r\n a + b + c,\r\n a * b + c,\r\n a + b * c,\r\n a * b * c,\r\n (a + b) * c,\r\n a * (b + c)\r\n )\r\n\r\ndef input_Num() :\r\n return int(input())\r\n\r\nmain()", "\r\nnumbers = []\r\nfor i in range(3):\r\n numbers.append(int(input()))\r\nfor i in range(len(numbers)):\r\n if numbers[i] == 1:\r\n if i == 0:\r\n numbers[1] = numbers[1] + 1\r\n elif i == 1:\r\n first = (numbers[0] + numbers[1]) * numbers[2]\r\n second = numbers[0] * (numbers[1] + numbers[2])\r\n if first >= second:\r\n numbers[0] = numbers[0] + 1\r\n else:\r\n numbers[2] = numbers[2] + 1\r\n elif i == 2:\r\n numbers[1] = numbers[1] + 1\r\nanswer = 1\r\nfor num in numbers:\r\n answer *= num\r\nprint(answer)\r\n", "a=int(input())\nb=int(input())\nc=int(input())\ncount=0\nL=[a+b*c,a*(b+c),a*b*c,(a+b)*c,a*b+c,a+b+c]\ncount=max(L)\nprint(count)\n\t\t\t\t\t \t \t \t\t \t\t \t \t \t\t\t\t\t\t", "n = int(input())\r\nd = int(input())\r\na = int(input())\r\n\r\ns = (n+d)*a\r\nf = n*(d + a)\r\nc = n * d * a\r\nm = n*d+a\r\nk = n+d * a\r\nq = n + d + a\r\nprint(max(s,f,c,m,k,q))", "a= int(input())\r\nb= int(input())\r\nc= int(input())\r\nlist=[]\r\nlist.append(a+b+c)\r\nlist.append((a+b)*c)\r\nlist.append(a*(b+c))\r\nlist.append(a*b*c)\r\nprint(int(max(list)))", "a,b,c=int(input()),int(input()),int(input())\r\nans=a*b*c\r\nif a==1 and c==1:ans=a+b+c\r\nelif a==1:ans=(a+b)*c\r\nelif b==1:ans=(min(a,c)+b)*max(a,c)\r\nelif c==1:ans=(b+c)*a\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nm = a * b * c\r\nn = a * (b + c)\r\nl = a + b + c\r\np = (a + b) * c\r\nprint(max(max(max(m, n), l), p))", "d = [int(input()),int(input()),int(input())]\r\nc = 0\r\nif d.count(1) == 0:\r\n\tprint(d[0]*d[1]*d[2])\r\nelif d.count(1) == 3:\r\n\tprint(3)\r\nelse:\r\n\tif d.count(1) == 1:\r\n\t\tif d[0] == 1:\r\n\t\t\tprint((d[0] + d[1]) * d[2])\r\n\t\telif d[2] == 1:\r\n\t\t\tprint(d[0] * (d[1] + d[2]))\r\n\t\telse:\r\n\t\t\tif d[0] >= d[2]:\r\n\t\t\t\tprint(d[0] * (d[1] + d[2]))\r\n\t\t\telse:\r\n\t\t\t\tprint(d[2] * (d[1] + d[0]))\r\n\telse:\r\n\t\tif d[1] != 1:\r\n\t\t\tprint(sum(d))\r\n\t\telse:\r\n\t\t\tprint(max(d) * 2)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n\r\nexpr1 = a + b + c\r\nexpr2 = a * b * c\r\nexpr3 = a + b * c\r\nexpr4 = a * (b + c)\r\nexpr5 = (a + b) * c\r\n\r\n\r\nmax_value = max(expr1, expr2, expr3, expr4, expr5)\r\n\r\nprint(max_value)", "a, b, c = [int(input()) for _ in range(3)]\r\nprint(max(a + b * c, a * (b + c), a * b * c,\r\n (a + b) * c, a * b + c, a + b + c))\r\n", "def exp(a,b,c):\r\n return max(a*b*c,(a+b)*c,a*(b+c),a+b+c)\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint(exp(a,b,c))\r\n", "n1=int(input())\r\nn2=int(input())\r\nn3=int(input())\r\n\r\na1=n1*n2*n3\r\na2=n1+n2+n3\r\na3=(n1+n2)*n3\r\na4=n1*(n2+n3)\r\n\r\nmAx=max(a1,a2,a3,a4)\r\nprint(mAx)", "A,B,C = [int(input())for i in \"abc\"]\nprint(max(A+B+C,A*B*C,(A+B)*C, A*(B+C)))\n\t \t \t \t \t\t\t\t\t \t\t\t \t\t\t \t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nif a == 1 and c == 1:\r\n res = a + b + c\r\nelif b == 1 or a == 1 or c == 1:\r\n res = max((a + b) * c, a + b * c, a * b + c, a * (b + c))\r\nelse:\r\n res = a * b * c\r\n\r\nprint(res)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nx=a+b+c;\r\ny=(a*b*c);\r\nz=((a+b)*c);\r\np=(a*(b+c));\r\nq=(a+(b*c));\r\nr=((a*b)+c);\r\nprint(max(x,y,z,p,q,r))", "\r\nnum1 = int(input())\r\nnum2 = int(input())\r\nnum3 = int(input())\r\nprint(max(num1+num2+num3, num1+(num2*num3),(num1+num2)*num3, num1*(num2+num3), (num1*num2)+num3, num1*num2*num3))", "\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nr1 = a + b + c\r\nr2 = a * b * c\r\nr3 = a + b * c\r\nr4 = a * b + c\r\nr5 = (a + b) * c\r\nr6 = a * (b + c)\r\n\r\nresult = max(r1, r2, r3, r4, r5, r6)\r\nprint(result)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate the four possible expressions\r\nexpr1 = a * b * c\r\nexpr2 = a * (b + c)\r\nexpr3 = (a + b) * c\r\nexpr4 = a + b + c\r\n\r\n# Find the maximum value among the four expressions\r\nmax_value = max(expr1, expr2, expr3, expr4)\r\n\r\nprint(max_value)", "a,b,c=int(input()),int(input()),int(input())\r\nprint(max(a+b+c,(a+b)*c,a*(b+c),a*b*c))\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif a == 0 or a == 1 or b == 0 or b==1:\r\n d = a+b\r\nelse:\r\n d = a*b\r\nif d== 0 or d == 1 or c == 0 or c == 1:\r\n e = d+c\r\nelse:\r\n e = d*c\r\nif c == 0 or c == 1 or b == 0 or b==1:\r\n d2 = c+b\r\nelse:\r\n d2 = c*b\r\nif d2== 0 or d2 == 1 or a == 0 or a == 1:\r\n e2 = d2+a\r\nelse:\r\n e2 = d2*a\r\n \r\nprint(max(e,e2))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 26 21:07:28 2023\r\n\r\n@author: Xavier Go\r\n\"\"\"\r\n\r\n# https://codeforces.com/problemset/problem/479/A\r\n\r\nx = int(input())\r\ny = int(input())\r\nz = int(input())\r\n\r\na = x + y + z\r\nb = x + y * z\r\nc = (x+y) * z\r\nd = x * y + z\r\ne = x * (y+z)\r\nf = x * y * z\r\n\r\nprint(max(a, b, c, d, e, f))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nmax_value = 0\r\noptions = [a+b+c, a*b+c, a+b*c, (a+b)*c, a*(b+c), a*b*c]\r\nfor option in options:\r\n if option > max_value:\r\n max_value = option\r\n\r\nprint(max_value)", "# Codeforces Problem\r\n# Expressions 479A (in sharepoint its 497A but its actually 479A)\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(max(a+b*c, a*(b+c), a*b*c, (a+b)*c, a+b+c, (a*b)+c))", "a,b,c=int(input()),int(input()),int(input())\r\ncalculation=[(a+b)*c,a*(b+c),a*b*c,a+b+c,a+b*c,a*b+c]\r\nprint(max(calculation))", "# Read input values\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate all possible values\r\nvalues = [\r\n a + b + c,\r\n a + b * c,\r\n a * b + c,\r\n a * b * c,\r\n a * (b + c),\r\n (a + b) * c\r\n]\r\n\r\n# Print the maximum value\r\nprint(max(values))\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nn1=a+b+c\r\nn2=(a+b)*c\r\nn3=a*(b+c)\r\nn4=a*b*c\r\nprint(max(n1,n2,n3,n4))", "a = int(input())\nb = int(input())\nc = int(input())\na1 = a*(b+c)\na2 = (a+b)*c \na3 = a+b+c \na4 = a*b*c \nprint(max(a1,a2,a3,a4))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=[a+(b*c),a*(b+c),a*b*c,(a+b)*c,a+b+c]\r\n\r\nprint(max(l))", "k = int(input())\nb = int(input())\nc = int(input())\n\nmaximum_value = max(k + b + c, k * b * c, k * (b + c), (k + b) * c)\nprint(maximum_value)\n \t \t\t\t \t \t\t \t \t \t \t \t\t\t \t \t", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\ns1=a+b*c\r\ns2=a*(b+c)\r\ns3=a*b*c\r\ns4=(a+b)*c\r\ns5=a+b+c\r\nmax=s1\r\nif s2>max:\r\n max=s2\r\nif s3>max:\r\n max=s3\r\nif s4>max:\r\n max=s4\r\nif s5>max:\r\n max=s5\r\nprint(max)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 21:12:30 2023\r\n\r\n@author: 25419\r\n\"\"\"\r\n\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nm=a+b+c\r\nn=a*b*c\r\np=(a+b)*c\r\nq=a*(b+c)\r\nlist1=[m,n,p,q]\r\nprint(max(list1))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate the maximum value by trying different combinations\r\nmax_value = max(a+b+c, a*b*c, (a+b)*c, a*(b+c))\r\n\r\n# Print the maximum value\r\nprint(max_value)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\ns1 = a + b + c\r\ns2 = a * b * c\r\ns3 = a * (b + c)\r\ns4 = (a + b) * c\r\ns5 = a + (b * c)\r\ns6 = (a * b) + c\r\nprint(max(s1, s2, s3, s4, s5, s6))", "a = int(input())\nb = int(input())\nc = int(input())\nx = (a+b)*c\ny = (a+b+c)\nz = a*b*c\nw = a*(b+c)\n\nprint(max(x,max(y,max(z,w))))\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 = int(input())\r\nc = int(input())\r\n\r\n# Try different arrangements and calculate the maximum value\r\nmax_value = max(\r\n a + b + c,\r\n a * b * c,\r\n a + b * c,\r\n a * (b + c),\r\n (a + b) * c,\r\n a * b + c\r\n)\r\n\r\n# Print the maximum value\r\nprint(max_value)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nans = a + b + c;\r\nans = max(ans, (a + b) * c)\r\nans = max(ans, a * (b + c))\r\nans = max(ans, a * b * c)\r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nvalues = [a + b + c, a * b * c, a + b * c, a * b + c, (a + b) * c, a * (b + c)]\r\n\r\n# Find the maximum value\r\nmax_value = max(values)\r\n\r\nprint(max_value)\r\n", "# https://codeforces.com/problemset/problem/479/A\r\n\r\n# Петя учится в школе и очень любит математику. Уже несколько занятий они с классом проходят арифметические выражения. \r\n# На последнем уроке учительница написала на доске три положительных целых числа a, b, c. \r\n# Задание заключалось в том, чтобы расставить между этими числами знаки операций '+' и '*', а также, возможно, скобки. \r\n# Значение получившегося выражения должно быть как можно больше. Рассмотрим пример: пусть учительница выписала на доску числа 1, 2 и 3. \r\n# Вот некоторые варианты расстановки знаков и скобок:\r\n\r\n# 1+2*3=7\r\n# 1*(2+3)=5\r\n# 1*2*3=6\r\n# (1+2)*3=9\r\n# Обратите внимание на то, что знаки операций можно вставлять только между a и b, а также между b и c, то есть нельзя менять числа местами.\r\n# Так, в приведенном примере нельзя получить выражение (1+3)*2.\r\n\r\n# Легко убедиться, что максимальное значение, которое можно получить, — это 9.\r\n\r\n# Ваша задача — по заданным a, b и c вывести, какое максимальное значение выражения можно получить.\r\n\r\n# Входные данные\r\n# Во входных данных записаны три целых числа a, b и c, каждое в отдельной строке (1 ≤ a, b, c ≤ 10).\r\n\r\n# Выходные данные\r\n# Выведите максимальное значение выражения, которое можно получить.\r\n\r\n# Примеры\r\n# входные данныеСкопировать\r\n# 1\r\n# 2\r\n# 3\r\n# выходные данныеСкопировать\r\n# 9\r\n# входные данныеСкопировать\r\n# 2\r\n# 10\r\n# 3\r\n# выходные данныеСкопировать\r\n# 60\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nexpr1 = a * b * c\r\nexpr2 = a * (b + c)\r\nexpr3 = (a + b) * c\r\nexpr4 = a + b + c\r\n\r\nmax_value = max(expr1, expr2, expr3, expr4)\r\n\r\nprint(max_value)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=[a*b*c,a*(b+c),a+(b*c),a+b+c,(a+b)*c,(a*b)+c]\r\nl.sort()\r\nprint(l[5])\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nans=0\r\nar=[]\r\nar.append(a*b*c)\r\nar.append((a*b)+c)\r\nar.append(a+(b*c))\r\nar.append((a+b)*c)\r\nar.append(a*(b+c))\r\nar.append(a+b+c)\r\nfor i in ar:\r\n ans=max(ans,i)\r\nprint(ans)", "class Solution:\r\n\tdef __init__(self):\r\n\t\tpass\r\n\r\n\tdef solve(self):\r\n\t\ta = int(input())\r\n\t\tb = int(input())\r\n\t\tc = int(input())\r\n\r\n\t\tvalues = []\r\n\t\tval1 = a + (b*c)\r\n\t\tvalues.append(val1)\r\n\t\tval2 = a * (b+c)\r\n\t\tvalues.append(val2)\r\n\t\tval3 = a*b*c\r\n\t\tvalues.append(val3)\r\n\t\tval4 = (a+b) * c\r\n\t\tvalues.append(val4)\r\n\t\tval5 = a + b + c\r\n\t\tvalues.append(val5)\r\n\t\tval6 = a*b + c\r\n\t\tvalues.append(val6)\r\n\r\n\t\tprint(max(values))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n\tsol = Solution()\r\n\tsol.solve()\r\n", "GIVEN_NUMBERS = [int(input()), int(input()), int(input())]\r\n\r\npossible_numbers = [sum(GIVEN_NUMBERS), GIVEN_NUMBERS[0]*GIVEN_NUMBERS[1]*GIVEN_NUMBERS[2], GIVEN_NUMBERS[0]*GIVEN_NUMBERS[1]+GIVEN_NUMBERS[2], GIVEN_NUMBERS[0]+GIVEN_NUMBERS[1]*GIVEN_NUMBERS[2],GIVEN_NUMBERS[0]*(GIVEN_NUMBERS[1]+GIVEN_NUMBERS[2]), (GIVEN_NUMBERS[0]+GIVEN_NUMBERS[1])*GIVEN_NUMBERS[2] ] \r\n\r\nanswer = max(possible_numbers)\r\n \r\nprint(answer)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nsum1 = (a + b)*c\r\nsum2 = a + b + c\r\nsum3 = a *( b + c)\r\nsum4 = a*b*c\r\nprint(max(sum1, sum2, sum3, sum4))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nvariants = [a+b+c, a*b+c, a+b*c, a*(b+c), (a+b)*c, a*b*c]\r\nm = 0\r\nfor i in variants:\r\n m = max(m, int(i))\r\nprint(m)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nt=[(a+b+c),(a*(b+c)),(a*b*c),((a+b)*c)]\r\np=max(t)\r\nprint(p)", "a, b, c = int(input()), int(input()), int(input())\r\nprint (max((a + b + c), (a * b * c), (a * (b + c)), ((a + b) * c), (a * b + c), (a + b * c), ))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\no1 = a + b + c\r\no2 = a * b * c\r\no3 = (a + b) * c\r\no4 = a * (b + c)\r\nvalue=max(o1,o2,o3,o4)\r\nprint(value)", "a=[]\r\nfor _ in range(3):\r\n a.append(int(input()))\r\nb,c,d=a[0],a[1],a[2]\r\ne=b+c+d\r\nf=b*c*d\r\ng=b+c*d\r\nh=b*c+d\r\ni=(b+c)*d\r\nj=b*(c+d)\r\nprint(max(e,f,g,h,i,j))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nexpression1 = a + b + c\r\nexpression2 = a * b * c\r\nexpression3 = (a + b) * c\r\nexpression4 = a * (b + c)\r\n\r\nmax_value = max(expression1, expression2, expression3, expression4)\r\nprint(max_value)\r\n", "a= int(input())\nb= int(input())\nc= int(input())\n\nmax_value = max(a+b+c, a*b*c, a+b*c, a *b +c, (a+b)*c,a*(b+c))\nprint(max_value)\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=int(input())\r\nc=int(input())\r\nsumA=a+b+c\r\nsumB=a*b+c\r\nsumC=a+b*c\r\nsumD=a*b*c\r\nsumB1=a*(b+c)\r\nsumC1=(a+b)*c\r\nprint(max(sumA,sumB,sumB1,sumC,sumC1,sumD))\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nq1 = a+b*c\r\nq2 = (a+b)*c\r\nq3 = a*b+c\r\nq4 = a*(b+c)\r\nq5 = a*b*c\r\nq6 = a+b+c\r\nprint(max(q1, q2, q3, q4, q5, q6))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=a*b*c\r\nm=a*(b+c)\r\nn=(a+b)*c\r\nq=a+b+c\r\nw=a+b*c\r\ne=a*b+c\r\na=[l,m,n,q,w,e]\r\nk=a[0]\r\nfor i in range(6):\r\n if k<a[i]:\r\n k=a[i]\r\nprint(k)", "data = []\r\n\r\nfor _ in range(3):\r\n n = int(input())\r\n data.append(n)\r\nx, y, z = data[0], data[1], data[2]\r\na = x + y + z\r\nb = x * y + z\r\nc = x + y * z\r\nd = x * y * z\r\ne = (x * y) + z\r\nf = (x + y) * z\r\ng = x * (y + z)\r\nh = x + (y * z)\r\n\r\nprint(max(a,b,c,d,e,f,g,h))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\ns = []\r\ns.append((a+b)*c)\r\ns.append(a+b+c)\r\ns.append(a*b*c)\r\ns.append((c+b)*a)\r\nprint(max(s))", "exec('a,b,c='+'int(input()),'*3);print(max(a+b+c,a*b*c,(a+b)*c,a*(b+c)))\n\t\t \t\t \t\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=int(input())\r\nc=int(input())\r\nalle=[]\r\nd=a+b+c\r\nalle.append(d)\r\ne=a*(b+c)\r\nalle.append(e)\r\nf=a*b+c\r\nalle.append(f)\r\ng=a+b*c\r\nalle.append(g)\r\nh=(a+b)*c\r\nalle.append(h)\r\ni=a*b*c\r\nalle.append(i)\r\nfinal=max(alle)\r\nprint(final)", "def main():\n first = int(input())\n second = int(input())\n third = int(input())\n first_expression = first + second + third\n second_expression = first + second * third\n third_expression = first * (second + third)\n fourth_expression = first * second * third\n fifth_expression = (first + second) * third\n sixth_expression = first * second + third\n print(max(max(max(max(max(first_expression, second_expression), third_expression), fourth_expression), fifth_expression), sixth_expression))\nmain()\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nval1=a+b+c\r\nval2=a*b*c\r\nval3=a+b*c\r\nval4=a*b+c\r\nval5=(a+b)*c\r\nval6=a*(b+c)\r\nfval=max(val1,val2,val3,val4,val5,val6)\r\nprint(fval)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nk = a+b*c\r\nl = a*(b+c)\r\nm = a*b*c\r\nn = (a+b)*c\r\no = a+b+c\r\ntup = (k,l,m,n,o)\r\nprint(max(tup))", "num_1=int(input())\r\nnum_2=int(input())\r\nnum_3=int(input())\r\nthe_result_1 = num_1 * num_2 * num_3\r\nthe_result_2 = num_1 + num_2 + num_3\r\nthe_result_3 = (num_1 + num_2) * num_3\r\nthe_result_4 = num_1 * (num_2 + num_3)\r\nlist_test=[the_result_1,the_result_2,the_result_3,the_result_4]\r\nlist_test.sort()\r\nprint(list_test[-1])", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate all possible values\r\nresult1 = a + b + c\r\nresult2 = a * b * c\r\nresult3 = a + b * c\r\nresult4 = a * (b + c)\r\nresult5 = (a + b) * c\r\n\r\n# Find the maximum value\r\nmax_value = max(result1, result2, result3, result4, result5)\r\nprint(max_value)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(max(a*(b+c), a*b*c, (a+b)*c, a+b+c))\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nx=a+b+c\r\nif (a+b*c)>x:\r\n x=a+b*c\r\nif((a+b)*c)>x:\r\n x=(a+b)*c\r\nif(a*b+c)>x:\r\n x=(a*b+c)\r\nif (a*(b+c))>x:\r\n x=a*(b+c)\r\nif(a*b*c)>x:\r\n x=a*b*c\r\nprint(x)\r\n\r\n", "a = int(input())\nb = int(input())\nc = int(input())\n\nE = a + b * c\nX = a * (b + c)\nP = a * b * c\nR = (a + b) * c\nS = a + b + c\nI = a * b + c\n\nl = [E, X, P, R, S]\nprint(max(l))\n\t \t\t\t\t\t\t\t\t\t\t \t \t\t \t \t\t \t \t\t\n\t\t\t\t\t \t\t \t \t\t \t\t\t\t\t\t\t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = -1\r\nfor i in range(2):\r\n tmp = 0\r\n for j in range(2):\r\n if i == 0 and j == 0:\r\n tmp = a + b + c\r\n elif i == 0 and j == 1:\r\n tmp = (a + b) * c\r\n elif i == 1 and j == 0:\r\n tmp = a * (b + c)\r\n else:\r\n tmp = a * b * c\r\n\r\n ans = max(ans, tmp)\r\nprint(ans)", "p=int(input())\nq=int(input())\nr=int(input())\nprint(max(p*q*r,p+q+r,(p+q)*r,p*(q+r)))", "a = int(input())\nb = int(input())\nc = int(input())\ns = 0\n\ns = max(s,(a + b + c))\ns = max(s,(a * b * c))\ns = max(s,((a + b) * c))\ns = max(s,((a * b) + c))\ns = max(s,(a + (b * c)))\ns = max(s,(a * (b + c)))\n\nprint(s)\n\t\t \t \t\t \t\t \t \t\t \t \t \t \t\t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nresult1 = a * b * c\r\nresult2 = a + b + c\r\nresult3 = a * (b + c)\r\nresult4 = (a + b) * c\r\nresult5 = a + (b * c)\r\n\r\nmaxresult = max(result1, result2, result3, result4, result5)\r\n\r\nprint(maxresult)\r\n", "# https://codeforces.com/problemset/problem/479/A\r\n\r\n# Time complexity: O(1) Constant runtime\r\n# Space complexity: O(1) Constant space\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n_max = a + b + c\r\n_max = max( _max, (a + b) * c)\r\n_max = max( _max, a * (b + c))\r\n_max = max( _max, a * b * c)\r\n\r\nprint(_max)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\ns = 1\r\n\r\nif a == 1 and c ==1:\r\n s = a + b + c\r\nelif a == 1 or (b == 1 and a <= c):\r\n s = (a + b) * c\r\nelif c == 1 or (b == 1 and c <= a):\r\n s = a * (b + c)\r\nelse:\r\n s = a * b * c\r\n\r\nprint(s)\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\ny = a * (b + c)\r\nx = (a + b) * c\r\nz = a + b * c\r\nq = a * b + c\r\ns = a * b * c\r\no = a + b + c\r\nmy_list = (z, q, s, x, y, o)\r\nprint(max(my_list))", "# O(1)\na = int(input())\nb = int(input())\nc = int(input())\n\nx=a+b*c\ny=a*(b+c)\nz=a*b*c\nn=(a+b)*c\nm=a+b+c\nprint(max(x,y,z,n,m))\n\t \t \t\t\t\t\t\t\t\t \t\t \t \t\t \t\t\t\t\t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nres = []\r\n\r\nres.append(a * b * c)\r\nres.append(a * (b + c))\r\nres.append((a + b) * c)\r\nres.append(a + b + c)\r\n\r\nmax_value = max(res)\r\n\r\nprint(max_value)\r\n", "# Read the input\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate all possible values\r\nvalue1 = a + b + c\r\nvalue2 = a * (b + c)\r\nvalue3 = a * b * c\r\nvalue4 = (a + b) * c\r\n\r\n# Find the maximum value among the calculated values\r\nmax_value = max(value1, value2, value3, value4)\r\n\r\n# Print the maximum value\r\nprint(max_value)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=[]\r\nl.append(int(a*b*c))\r\nl.append(int(a+b+c))\r\nl.append(int((a*b)+c))\r\nl.append(int(a*(b+c)))\r\nl.append(int((a+b)*c))\r\nl.append(int(a+(b*c)))\r\nprint(max(l))\r\n", "posibles = []\r\n\r\np = int(input())\r\nq = int(input())\r\nr = int(input())\r\n\r\nposibles.append(p+(q*r))\r\nposibles.append(p*(q+r))\r\nposibles.append(p*q*r)\r\nposibles.append((p+q)*r)\r\nposibles.append(p+q+r)\r\n\r\nprint(max(posibles))", "def main():\r\n a, b, c = int(input()), int(input()), int(input())\r\n print(max(a + b + c, a + b * c, (a + b) * c, a * b + c, a * (b + c), a * b * c))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef cint(): return int(input())\r\ndef cline(): return map(int, input().split())\r\ndef clist(): return list(map(int, input().split()))\r\n\r\n\r\na = cint()\r\nb = cint()\r\nc = cint()\r\n\r\nans = max(\r\n [\r\n a * b * c,\r\n a + b + c,\r\n (a+b) * c,\r\n a * b + c,\r\n a * (b + c),\r\n ]\r\n)\r\n\r\nprint(ans)\r\n", "def generate_expression(a, b, c, first='+', second='+', around_first=False, around_second=False):\r\n max_val = eval(f\"{a}{first}{b}{second}{c}\")\r\n max_val = max(max_val, eval(f\"({a}{first}{b}){second}{c}\"))\r\n max_val = max(max_val, eval(f\"{a}{first}({b}{second}{c})\"))\r\n if first == '+':\r\n max_val = max(generate_expression(a, b, c, first='*', second=second), max_val)\r\n\r\n if second == '+':\r\n max_val = max(generate_expression(a, b, c, first=first, second='*'), max_val)\r\n\r\n return max_val\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nprint(generate_expression(a, b, c))", "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 a, b, c = int(input()), int(input()), int(input())\n print(max(a + b + c, a * b * c, (a + b) *\n c, a * (b + c), a + b * c, a * b + c))\n\n\nif __name__ == \"__main__\":\n main()\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nm1=a+b+c\r\nm2=a+b*c\r\nm3=a*b+c\r\nm5=a*b*c\r\nm6=a*(b+c)\r\nm7=(a+b)*c\r\nprint(max(m1,m2,m3,m5,m6,m7))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nA = a+b*c\r\nB = a*(b+c)\r\nC = a*b*c\r\nD = (a+b)*c\r\nE = a+b+c\r\nprint(max(A,B,C,D,E))", "l = list()\r\nans = list()\r\nfor i in range(3):\r\n l.append(int(input()))\r\nans = [l[0]+l[1]*l[2], l[0]*(l[1]+l[2]), l[0]*l[1]*l[2], (l[0]+l[1])*l[2], l[0]+l[1]+l[2]]\r\nprint(max(ans))", "x=[]\r\nflag1=0\r\nfor i in range(3):\r\n a = int(input())\r\n x.append(a)\r\n if a == 1:\r\n flag1 +=1\r\n\r\nif flag1 > 0:\r\n if flag1 == 1 :\r\n min=11\r\n max=0\r\n for i in range(3):\r\n if min >= x[i] and x[i] != 1:\r\n min = x[i]\r\n if max <= x[i] and x[i] != 1:\r\n max = x[i]\r\n if x[0] == 1:\r\n print((x[0]+x[1])*x[2])\r\n elif x[1] == 1:\r\n print((x[1]+min)*max)\r\n else:\r\n print(x[0]*(x[1]+x[2]))\r\n elif flag1 == 2:\r\n if x[0] == 1 and x[1] == 1:\r\n print(x[2]*2)\r\n elif x[1] == 1 and x[2] == 1:\r\n print(x[0]*2)\r\n else:\r\n print(x[1]+2)\r\n else:\r\n print(3)\r\n \r\nelse:\r\n print(x[0]*x[1]*x[2])", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nmax = a + b + c\r\nx = (a + b)*c\r\nif x>max:\r\n max = x\r\nx = a + b *c\r\nif x>max:\r\n max = x\r\nx = a * (b + c)\r\nif x>max:\r\n max = x\r\nx = a * b + c\r\nif x>max:\r\n max = x\r\nx = a * b * c\r\nif x>max:\r\n max = x\r\nprint(max)\r\n\r\n\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/479/A\r\n\r\ndef main():\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n a = [a * b * c, a + b * c, a + b + c, a * b + c, (a + b) * c, a * (b + c)]\r\n print(max(a))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nz = []\r\nz.append(a+b+c)\r\nz.append(a*b*c)\r\nz.append(a+b*c)\r\nz.append(a*b+c)\r\nz.append((a+b)*c)\r\nz.append(a*(b+c))\r\nz.sort(reverse=True)\r\nprint(z[0])", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\ns1 = a + b + c\r\ns2 = a * b * c\r\ns3 = a + b * c\r\ns4 = (a + b) * c\r\ns5 = a * b + c\r\ns6 = a * (b + c)\r\n\r\nprint(max(s1, s2, s3, s4, s5, s6))", "a, b, c = [int(input()) for _ in range(3)]\r\ns1, s2, s3, s4, s5 = a + b + c, a + b * c, a * (b + c), a * b * c, (a + b) * c\r\nprint(max(s1, s2, s3, s4, s5))", "a = input()\r\nb = input()\r\nc = input()\r\n\r\ndef eval_expresion(a, b, c, par1, par2, par3, par4, sim1, sim2):\r\n operacion = f\"{par1} {a} {sim1} {par2} {b} {par3} {sim2} {c} {par4}\"\r\n return eval(operacion)\r\n\r\ndef main(a,b,c):\r\n max_result = 0\r\n for opciones in range(3):\r\n if opciones == 0:\r\n par1, par2, par3, par4 = \"(\", \" \", \")\", \" \"\r\n elif opciones == 1:\r\n par1, par2, par3, par4 = \" \", \"(\", \"\", \")\"\r\n else:\r\n par1, par2, par3, par4 = \" \", \" \", \" \", \" \"\r\n \r\n for sim1 in ['+', '*']:\r\n for sim2 in ['+', '*']:\r\n result = eval_expresion(a, b, c, par1, par2, par3, par4, sim1, sim2)\r\n max_result = max(max_result, result)\r\n return max_result\r\n\r\nprint(main(a,b,c))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nans = 0\r\nans = max(ans, a * b * c)\r\nans = max(ans, a + b + c)\r\nans = max(ans, a * (b + c))\r\nans = max(ans, (a + b) * c)\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = a+b+c\r\ne = a*b*c\r\nf = a+ b*c\r\ng = a*b + c\r\nh = (a+b)*c\r\ni = a*(b+c)\r\nprint(max(d,e,f,g,h,i))", "from bisect import bisect_right, bisect_left\r\nfrom math import inf, gcd, sqrt, ceil, log2\r\nfrom collections import defaultdict, Counter\r\nfrom functools import cache, lru_cache\r\nfrom tkinter import W\r\nrvar = lambda: map(int, input().split())\r\nrarr = lambda: list(map(int, input().split()))\r\nrstr = lambda: input().split()\r\nrint = lambda: int(input())\r\n \r\n'''Speed up'''\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\na = rint()\r\nb = rint()\r\nc = rint()\r\n\r\n\r\nprint(max(a + b + c, (a + b) * c, a * (b + c), a * b * c))", "# Read input values\na = int(input())\nb = int(input())\nc = int(input())\n\n# Initialize the maximum result\nmax_result = a + b + c\n\n# Consider different combinations of operations and update max_result\nmax_result = max(max_result, a + b * c)\nmax_result = max(max_result, a * b + c)\nmax_result = max(max_result, a * b * c)\nmax_result = max(max_result, (a + b) * c)\nmax_result = max(max_result, a * (b + c))\n\n# Print the maximum result\nprint(max_result)\n\n\t\t\t \t \t\t\t\t\t \t \t\t\t \t\t\t \t", "a = input()\r\nb = input()\r\nc = input()\r\nop, r = ['++', '+*', '*+', '**'], -1\r\nfor e in op:\r\n r = max(\r\n r, eval(a+e[0]+b+e[1]+c),\r\n eval('('+a+e[0]+b+')'+e[1]+c),\r\n eval(a+e[0]+'('+b+e[1]+c+')')\r\n )\r\nprint(r)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nm=0\r\nm=max(m,(a+b+c))\r\nm=max(m,((a+b)*c))\r\nm=max(m,((a*b)+c))\r\nm=max(m,(a*b*c))\r\nm=max(m,(a*(b+c)))\r\nm=max(m,((a+b)*c))\r\nprint(m)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nresult=max(a+b+c,a*b*c,(a+b)*c,a*(b+c))\r\nprint(result)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nlist1=[]\r\nlist1.append(a+b+c)\r\nlist1.append(a*b*c)\r\nlist1.append((a+b)*c)\r\nlist1.append(a*(b+c))\r\nlist1.append(a+(b*c))\r\nlist1.append((a*b)+c)\r\nprint(max(list1))\r\n\r\n \r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=(a*b)+c\r\ne=(a+b)*c\r\nf=a*(b+c)\r\ng=a+(b*c)\r\nh=a*b*c\r\nk=a+b+c\r\nprint(max(d, e, f, g, h, k))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=[0]*6\r\nn1=a+b+c\r\nn2=a*b+c\r\nn3=a+b*c\r\nn4=a*b*c\r\nn5=(a+b)*c\r\nn6=a*(b+c)\r\nd[0],d[1],d[2],d[3],d[4],d[5]=n1,n2,n3,n4,n5,n6\r\nn=max(d)\r\nprint(n)\r\n", "a = int(input())\nb = int(input())\nc = int(input())\n\nsum0 = max(a+b+c, a*b*c, a*(b+c), (a+b)*c, a+(b*c), (a*b)+c)\nprint(sum0)\n\n \t\t \t\t\t\t \t\t \t\t \t \t\t \t \t\t\t\t\t", "import sys\r\ninp = sys.stdin.readline\r\n\r\ndef expression(a,b,c):\r\n ans = a + b + c\r\n ans = max(ans, (a + b) * c)\r\n ans = max(ans, a * (b + c))\r\n ans = max(ans, a * b * c)\r\n\r\n return ans\r\n\r\ndef main():\r\n a = int(inp())\r\n b = int(inp())\r\n c = int(inp())\r\n\r\n result = expression(a,b,c)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=[]\r\na1=a+b*c\r\na2=a*(b+c)\r\na3=a*b*c\r\na4=(a+b)*c\r\na5=a+b+c\r\nl.append(a1)\r\nl.append(a2)\r\nl.append(a3)\r\nl.append(a4)\r\nl.append(a5)\r\nprint(max(l))\r\n", "a, b, c = int(input()), int(input()), int(input())\r\nx1 = a + b + c\r\nx2 = (a + b) * c\r\nx3 = a * (b + c)\r\nx4 = a*b*c\r\n\r\nprint(max(max(max(x1, x2), x3), x4))", "a= int(input())\r\nb= int(input())\r\nc= int(input())\r\nprint(max(a+b+c, a+b*c, (a+b)*c, a*b+c, a*(b+c), a*b*c))", "a=[]\r\nfor i in range(3):\r\n a.append(int(input()))\r\nd,b,c=a[0],a[1],a[2]\r\nprint(max(d*b*c,d+b+c,(d+b)*c,d*(b+c)))", "a = int (input())\r\nb = int (input())\r\nc = int (input())\r\nprint (max(a+ b + c, a * b * c, a + b * c , a + b *c, (a + b) *c, a* (b+ c)))", "def max(a,b):\r\n if a>b:\r\n return a\r\n return b\r\n\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\nx=a+b+c\r\ny=a*b*c\r\nz=(a+b)*c\r\np=a*(b+c)\r\nprint(max(p,max(z,max(x,y))))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Sep 19 17:10:47 2023\r\n\r\n@author: 15110\r\n\"\"\"\r\n\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nre=[]\r\nre.append(a+b+c)\r\nre.append(a*b*c)\r\nre.append(a+b*c)\r\nre.append(a*b+c)\r\nre.append((a+b)*c)\r\nre.append(a*(b+c))\r\nprint(max(re))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = max(a+b+c,(a+b)*c)\r\nans = max(ans,a*(b+c))\r\nans = max(ans,a*b*c)\r\nans = max(a+b+c,ans)\r\nprint(ans)", "nums = [int(input()) for i in range(3)]\r\n\r\ndef result(nums):\r\n list = [(nums[0] + nums[1]) * nums[2], nums[0] * (nums[1] + nums[2]), nums[0] + nums[1] * nums[2], nums[0] * nums[1] + nums[2]]\r\n mix = max(list)\r\n mul = nums[0] * nums[1] * nums[2]\r\n sum = nums[0] + nums[1] + nums[2]\r\n if mix >= mul and mix >= sum:\r\n return mix\r\n elif mul >= mix and mul >= sum:\r\n return mul\r\n else:\r\n return sum\r\n\r\nprint(result(nums))\r\n", "\na = int(input())\nb = int(input())\nc = int(input())\ntotal = 0\ntotal = max(a * b * c, a + b + c)\ntotal = max(a * (b + c), (a + b) * c, total)\nprint(total)", "a = int(input())\nb = int(input())\nc = int(input())\na1 = a + b + c\na2 = (a + b) * c\na3 = a * (b + c)\na4 = a * b * c\nprint(max(a1, a2, a3, a4))\n\n\t \t\t\t\t\t \t \t\t\t \t \t\t", "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\nd = []\r\nd.append(x+y+z)\r\nd.append(x*y*z)\r\nd.append(x*(y+z))\r\nd.append((x+y)*z)\r\nprint(max(d))\r\n", "import sys\r\na,b,c=map(int, sys.stdin.read().split())\r\nprint(max(a+b*c,a*(b+c),a*b*c,(a+b)*c,a+b+c,a*b+c))", "exec('s,k,v='+'int(input()),'*3);print(max(s+k+v,s*k*v,(s+k)*v,s*(k+v)))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nmaxs = []\r\nmaxs.append(a+b+c)\r\nmaxs.append(a*(b+c))\r\nmaxs.append((a+b)*c)\r\nmaxs.append(a*b*c)\r\nprint(max(maxs))", "\"\"\"\nhttps://codeforces.com/problemset/problem/479/A\n\"\"\"\nimport sys\na = int(sys.stdin.readline())\nb = int(sys.stdin.readline())\nc = int(sys.stdin.readline())\n\nresult = a + b + c \nresult = max(result, a * b + c )\nresult = max(result, a + b * c )\nresult = max(result, a * b * c )\nresult = max(result, (a + b) * c )\nresult = max(result, a * (b + c) )\n\nsys.stdout.write(str(result))\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nans=a+b+c;\r\nans=max(ans,(a*b*c))\r\nans=max(ans,(a+b)*c)\r\nans=max(ans,a*(b+c))\r\nans=max(ans,a+(b*c))\r\nans=max(ans,(a*b)+c)\r\nprint(ans)", "a=int(input())\nb=int(input())\nc=int(input())\nt=0\np=0\nt=(a+b)*c\np=max(p,t)\nt=a*(b+c)\np=max(p,t)\nt=a*b*c\np=max(p,t)\nt=(a+b)*c\np=max(p,t)\nt=a+b+c\np=max(p,t)\nprint(p)\n \t\t\t \t \t \t\t \t\t \t \t\t\t\t\t \t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nt = a+b*c\r\ne = a*b+c\r\ns = a*b*c\r\nr = a*(b+c)\r\nd = (a+b)*c\r\no = a+b+c\r\nprint(max(t, e, s, o, r, d))\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=[]\r\nl.append(a+b*c)\r\nl.append(a*(b+c))\r\nl.append(a*b*c)\r\nl.append((a+b)*c)\r\nl.append(a+b+c)\r\nprint(max(l))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nans = 0\r\n\r\nans = max(ans, a+b+c)\r\nans = max(ans, a*b*c)\r\nans = max(ans, a*b+c)\r\nans = max(ans, a+b*c)\r\nans = max(ans, (a+b) * c)\r\nans = max(ans, a * (b+c))\r\n\r\nprint(ans)", "# Expression\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nm1 = a+b+c\r\nm2 = a * b* c\r\nm3 = (a + b) * c\r\nm4 = a + (b * c)\r\nm5 = (a * b) + c \r\nm6 = a * (b + c)\r\nmax = max(m1,m2,m3,m4,m5,m6)\r\nprint(max)", "# Read the three integers\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Initialize the maximum value to be the product of all three numbers\r\nmax_value = a * b * c\r\n\r\n# Try all possible combinations of operations\r\n# 1. Additions around multiplication\r\nvalue = a * (b + c)\r\nmax_value = max(max_value, value)\r\n\r\nvalue = (a + b) * c\r\nmax_value = max(max_value, value)\r\n\r\n# 2. Additions around all three numbers\r\nvalue = a + b + c\r\nmax_value = max(max_value, value)\r\n\r\n# Print the maximum value\r\nprint(max_value)\r\n", "def evaluate_expression(a, b, c, op1, op2):\r\n if op1 == '+':\r\n if op2 == '+':\r\n return (a + b) + c\r\n elif op2 == '*':\r\n return (a + b) * c\r\n elif op1 == '*':\r\n if op2 == '+':\r\n return a * (b + c)\r\n elif op2 == '*':\r\n return a * b * c\r\n\r\ndef find_maximum_value(a, b, c):\r\n max_value = 0\r\n operators = ['+', '*']\r\n\r\n for op1 in operators:\r\n for op2 in operators:\r\n value = evaluate_expression(a, b, c, op1, op2)\r\n max_value = max(max_value, value)\r\n\r\n return max_value\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nprint(find_maximum_value(a, b, c))\r\n", "from bisect import (\r\n bisect_left, bisect_right,\r\n insort_left, insort_right\r\n)\r\nfrom collections import defaultdict\r\nfrom functools import cache\r\nfrom itertools import accumulate, permutations, product\r\nfrom math import gcd, lcm, factorial, ceil, pi, inf, dist\r\n# from sys import set_int_max_str_digits\r\nfrom sys import stdin\r\n\r\nMOD = 998244353\r\nALPHA = 'abcdefghijklmnopqrstuvwxyz'\r\n#set_int_max_str_digits(10000)\r\n\r\ninput = lambda: stdin.readline().rstrip()\r\ndef inpi(): return int(input())\r\ndef inpf(): return float(input())\r\ndef inpis(): return map(int, input().split())\r\ndef inpfs(): return map(float, input().split())\r\ndef inpli(): return list(map(int, input().split()))\r\ndef srtinpli(reverse=False): return sorted(map(int, input().split()), reverse=reverse)\r\ndef inpli2(n): return [int(input()) for _ in range(n)]\r\ndef inplf(): return list(map(float, input().split()))\r\ndef inplf2(n): return [float(input()) for _ in range(n)]\r\ndef inpls(): return input().split()\r\ndef inpls2(n): return [input() for _ in range(n)]\r\ndef inpset(): return set(map(int, input().split()))\r\ndef inpset2(n): return {int(input()) for _ in range(n)}\r\ndef inpmat(n): return [list(map(int, input().split())) for _ in range(n)]\r\n\r\n\r\n# Main\r\n\r\na = inpi()\r\nb = inpi()\r\nc = inpi()\r\n\r\nr1 = a + b + c\r\nr2 = a * b + c\r\nr3 = a * (b + c)\r\nr4 = a * b * c\r\nr5 = a + b * c\r\nr6 = (a + b) * c\r\n\r\nans = max(r1, r2, r3, r4, r5, r6)\r\nprint(f\"{ans}\")", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\ndef ili(): return list(map(int, input().split()))\r\n\r\ndef solve():\r\n a = int(input()); b = int(input()); c = int(input())\r\n a, c = min(a, c), max(a, c)\r\n d = max(a+b, a*b)\r\n print(max(c+d,c*d))\r\n\r\ncase_num = 1\r\n# case_num = int(input())\r\nfor case in range(case_num):\r\n solve()", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 13 17:06:22 2023\r\n\r\n@author: HyFlu\r\n\"\"\"\r\n\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nsolutions=[]\r\nsolutions.append(a+b+c)\r\nsolutions.append(a*b*c)\r\nsolutions.append(a+b*c)\r\nsolutions.append(a*b+c)\r\nsolutions.append(a*(b+c))\r\nsolutions.append((a+b)*c)\r\nsolutions.sort()\r\nprint(solutions[-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, [input() for _ in range(3)])\r\nprint(max(a*b*c, a*(b+c), (a+b)*c, a+b+c, a+b*c, a*b+c))", "a, b, c = map(int, [input() for _ in range(3)])\r\nprint(max(a+b+c, a*b*c, (a+b)*c, a*(b+c)))", "# for _ in range(int(input())):\r\nn1 = int(input())\r\nn2 = int(input())\r\nn3 = int(input())\r\n\r\nx = 0\r\nx = max(x,(n1+n2)*n3,n1*(n2+n3),n1*n2*n3,n1+n2+n3,n1+n2*n3,n1*n2+n3)\r\nprint(x)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint(max((a*b+c),(b*c+a),(a*b*c),((a+b)*c),((b+c)*a),(a+b+c)))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nresultList = []\r\n\r\nresultList.append(a+(b*c))\r\nresultList.append((a*b)+c)\r\nresultList.append(a*(b+c))\r\nresultList.append(a*b*c)\r\nresultList.append((a+b)*c)\r\nresultList.append(a+b+c)\r\n\r\nprint(max(resultList))\r\n\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=max(a+b*c,a*(b+c),a*b*c,(a+b)*c,a+b+c,a*b+c)\r\nprint(l)\r\n", "g = int(input())\r\np = int(input())\r\nk = int(input())\r\nans = max(\r\n max(\r\n max(g + p + k, g * p * k),\r\n max(g * p + k, g + p * k)\r\n ),\r\n max((g + p) * k, g * (p + k))\r\n)\r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nformulas = [a+b+c,\r\na*b*c,\r\na+b*c,\r\n(a+b)*c,\r\na*b+c,\r\na*(b+c)]\r\n\r\nhighest = 0\r\n\r\nfor i in formulas:\r\n if i > highest:\r\n highest = i\r\n \r\nprint(highest)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nq1 = a + b + c\r\nq2 = a + b * c\r\nq3 = a * b + c\r\nq4 = a * b * c\r\nq5 = (a + b) * c\r\nq6 = a * (b + c)\r\n\r\nres = max((q1, q2, q3, q4, q5, q6))\r\n\r\nprint(res)\r\n", "a = int(input());\r\nb = int(input());\r\nc = int(input());\r\n\r\nn1 = a+b+c;\r\nn2= a*b*c;\r\nn3 = (a+b)*c;\r\nn4 = a*(b+c);\r\n\r\nprint(max(n1,n2,n3,n4));", "a, b, c = map(lambda x: int(input()), \" \")\r\nprint(max(\r\n a*b*c, a+b+c,\r\n (a+b)*c, a*(b+c),\r\n a+b*c, a*b+c\r\n))", "a =int (input())\r\nb =int(input())\r\nc =int(input())\r\n\r\na1= a+b*c\r\na2= a*(b+c)\r\na3= a*b*c\r\na4= (a+b)*c\r\na5= a+b+c\r\nlista = []\r\n\r\nlista.append(a1)\r\nlista.append(a2) \r\nlista.append(a3)\r\nlista.append(a4)\r\nlista.append(a5)\r\n\r\nlista.sort()\r\n\r\nprint(lista[-1])", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n\r\nl = []\r\nq = a * b * c\r\nl.append(q)\r\n\r\nfir = a * b * c\r\nl.append(fir)\r\nsec = a * b + c\r\nl.append(sec)\r\nthi = a * b + c\r\nl.append(thi)\r\nforth = a + b + c\r\nl.append(forth)\r\nfif = a * (b + c)\r\nl.append(fif)\r\ns = (a + b) * c\r\nl.append(s)\r\n\r\n\r\nprint(max(l))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nli = [a+b+c, a*b*c, a*b+c, (a+b)*c, a+b*c, a*(b+c)]\r\nprint(max(li))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n \r\nnumber = a + b + c\r\nnumber = max(number , (a+b)*c)\r\nnumber = max(number , a*(b+c))\r\nnumber = max(number , a*b*c)\r\nnumber = max(number , (a+b)*c)\r\nprint(number)\r\n", "A=int(input())\r\nB=int(input())\r\nC=int(input())\r\nmax_value=max(A+B+C,A*B*C,(A+B)*C,A*(B+C),A+B*C,A*B+C)\r\nprint(max_value)", "\r\ndef f():\r\n a=int(input())\r\n b=int(input())\r\n c=int(input())\r\n ans=0\r\n if a+b+c >ans:\r\n ans=a+b+c\r\n if a+b*c >ans:\r\n ans=a+b*c\r\n if (a+b)*c >ans:\r\n ans=(a+b)*c\r\n if a*b+c >ans:\r\n ans=a*b+c\r\n if a*(b+c) >ans:\r\n ans=a*(b+c)\r\n if a*b*c >ans:\r\n ans=a*b*c\r\n print(ans)\r\n # l=list(map(int,input().split()))\r\n \r\n \r\n \r\n \r\nif __name__ == '__main__':\r\n # for _ in range(int(input())):\r\n f()\r\n", "exec('a,b,c='+'int(input()),'*3);\r\nprint(max(a+b+c,a*b*c,a*(b+c),(a+b)*c))\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\ntong1=(a+b)*c\r\ntong2=a*(b+c)\r\ntong3=a+b+c\r\ntich1=a*b+c\r\ntich2=a+b*c\r\ntich3=a*b*c\r\nprint(max(tong1,tong2,tong3,tich1,tich2,tich3))\r\n \r\n", "a = int(input())\nb = int(input())\nc = int(input())\n\nif a == 1:\n if b == 1:\n if c == 1:\n print(3)\n else:\n print(2*c)\n else:\n if c == 1:\n print(b+2)\n else:\n print((b+1)*c)\nelse:\n if b == 1:\n if c == 1:\n print(2*a)\n else:\n print(max((a+1)*c, a * (c+1)))\n else:\n if c == 1:\n print(a * (b+1))\n else:\n print(a*b*c)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nx=a*b*c\r\ny=a*(b+c)\r\nm=(a+b)*c\r\nz=a+b+c\r\nprint(max(x,y,z,m))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nresults = [a + b + c, a + b * c, a * b + c, a * b * c, (a + b) * c, a * (b + c)]\r\n\r\nmax_result = results[0]\r\nfor i in range(1, 6):\r\n if max_result < results[i]:\r\n max_result = results[i]\r\n\r\nprint(max_result)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\ne1 = a + b + c\r\ne2 = a * b * c\r\ne3 = a * (b + c)\r\ne4 = (a + b) * c\r\n\r\nres = max(e1, e2, e3, e4)\r\n\r\nprint(res)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\ns1=a+b*c\r\ns2=a*(b+c)\r\ns3=a*b*c\r\ns4=(a+b)*c\r\ns5=a*b+c\r\ns6=a+b+c\r\n\r\ns=max(s1,s2,s3,s4,s5,s6)\r\nprint(s)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nm=0\r\nif a+b+c>m:\r\n m=a+b+c\r\nif (a+b)*c>m:\r\n m=(a+b)*c\r\nif (b+c)*a>m:\r\n m=(b+c)*a\r\nif a*b*c>m:\r\n m=a*b*c\r\nprint(m)", "inp = 3\r\narr = []\r\nfor i in range(inp):\r\n arr.append(int(input()))\r\nmy_list = [\r\n arr[0] + arr[1] + arr[2],\r\n arr[0] * (arr[1] + arr[2]),\r\n (arr[0] + arr[1]) * arr[2],\r\n arr[0] * arr[1] * arr[2]\r\n]\r\nprint(max(my_list))", "i = lambda: int(input())\r\n\r\na, b, c = i(), i(), i()\r\ns1 = a + b + c\r\ns2 = a + b * c\r\ns3 = (a + b) * c\r\ns4 = a * b + c\r\ns5 = a * (b + c)\r\ns6 = a * b * c\r\nprint(max(s1, s2, s3, s4, s5, s6))\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nabc = [a+(b+c), a+(b*c), a*(b+c), a*(b*c), (a+b)*c, (a*b)+c]\r\nprint(max(abc))\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = a*b+c\r\nf = a+b*c\r\ng = (a+b)*c\r\nh = (b+c)*a\r\nj = a*b*c\r\nk = a+b+c\r\nlist1 = [d,f,g,h,j,k]\r\ns = max(list1)\r\nprint(s)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=a*b*c\r\ne=a+b+c\r\nf=a*(c+b)\r\ng=a*(b+c)\r\ni=(a+b)*c\r\nprint(max(d,e,f,g,i))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif a == 1:\r\n if c == 1:\r\n result = b+2\r\n else:\r\n result = (b+1)*c\r\nelse:\r\n if c == 1:\r\n result = (b+1)*a\r\n else:\r\n if b == 1:\r\n result = a*c + max(a,c)\r\n else:\r\n result = a*b*c\r\nprint(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 7 10:22:57 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\na = input()\r\nb = input()\r\nc = input()\r\nresults = []\r\nfor operator1 in [\"+\", \"*\"]:\r\n for operator2 in [\"+\", \"*\"]:\r\n results.append(eval(\"(\" + a + operator1 + b + \")\" + operator2 + c))\r\n results.append(eval(a + operator1 + \"(\" + b + operator2 + c + \")\"))\r\nprint(max(results))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n\r\nresultado1 = a + b + c\r\nresultado2 = a * b * c\r\nresultado3 = a + b * c\r\nresultado4 = a * (b + c)\r\nresultado5 = (a + b) *c\r\nresultado6 = (a * b)+ c\r\n\r\n\r\nmax = max(resultado1, resultado2, resultado3, resultado4,resultado5, resultado6)\r\n\r\n\r\nprint(max)\r\n ", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nresults = []\r\n\r\nresults.append(a + b + c)\r\nresults.append(a * b * c)\r\nresults.append(a + b * c)\r\nresults.append(a * b + c)\r\nresults.append(a * (b + c))\r\nresults.append((a + b) * c)\r\n\r\nprint(max(results))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = []\r\nd.append((a+b)*c)\r\nd.append(a+(b*c))\r\nd.append(a+b+c)\r\nd.append(a*b+c)\r\nd.append(a*(b+c))\r\nd.append(a*b*c)\r\nprint(max(d))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\npossibilit_1 = a+b+c\r\npossibilit_2 = a*b*c\r\npossibilit_3 = a+b*c\r\npossibilit_4 = a*b+c\r\npossibilit_5 = (a+b) * c\r\npossibilit_6 = a*(b+c)\r\n\r\nhigher_number = max(possibilit_1, possibilit_2, possibilit_3, possibilit_4, possibilit_5, possibilit_6)\r\nprint(higher_number)", "test_list = []\r\nresult = []\r\n\r\nfor i in range(3):\r\n test_list.append(int(input('')))\r\n\r\nresult.append(test_list[0] * test_list[1] * test_list[2])\r\nresult.append(test_list[0] + test_list[1] + test_list[2])\r\nresult.append(test_list[0] + test_list[1] * test_list[2])\r\nresult.append(test_list[0] * test_list[1] + test_list[2])\r\nresult.append(test_list[0] * (test_list[1] + test_list[2]))\r\nresult.append((test_list[0] + test_list[1]) * test_list[2])\r\n\r\nprint(max(result))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nres1 = a+b*c\r\nres2 = a*(b+c)\r\nres3 = a*b*c\r\nres4 = (a+b)*c\r\nres5 = a+b+c\r\nmaxi = max(res4,res3,res2,res1,res5)\r\nprint(maxi)", "import sys\r\nimport math\r\nimport bisect\r\nimport re\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n \r\ndef main():\r\n #length = int(input())\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n #string = input()\r\n ans = 0\r\n #numbers = [*map(int, input().split())]\r\n if a==1:\r\n if c==1:\r\n print(a+b+c)\r\n elif b==1:\r\n print(2*c)\r\n else:\r\n print((a+b)*c)\r\n elif c==1:\r\n if b==1:\r\n print(2*a)\r\n else:\r\n print((c+b)*a)\r\n elif b==1:\r\n print((min(a,c)+b)*max(a,c))\r\n else:\r\n print(a*b*c)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "ll=[]\r\nfor i in range(3):\r\n ll.append(int(input()))\r\na,b,c=ll\r\nmaximum=0\r\nif a+b+c>maximum:\r\n maximum=a+b+c\r\nif a+(b*c)>maximum:\r\n maximum=a+(b*c)\r\nif a*(b+c)>maximum:\r\n maximum=a*(b+c)\r\nif a*b*c>maximum:\r\n maximum=a*b*c\r\nif (a+b)*c>maximum:\r\n maximum=(a+b)*c\r\nprint(maximum)", "a=[]\r\nfor _ in range(3):\r\n a.append(int(input()))\r\nans=sum(a)\r\nans=max(a[0]*a[1]*a[2],ans)\r\nans=max((a[0]+a[1])*a[2],ans)\r\nans=max(ans,a[0]*(a[1]+a[2]))\r\nans=max(ans,(a[0]*a[1])+a[2])\r\nans=max(ans,(a[2]*a[1])+a[0])\r\nprint(ans)\r\n\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint(max(a+c+b,a*c*b,a+c*b,a*c+b,a*(b+c),(a+b)*c))", "def solve(a,b,c):\r\n arr=[a+b+c,a*b*c,a+b*c,a*(b+c),(a+b)*c]\r\n return max(arr)\r\n pass\r\narr=list(int(input()) for i in range(3))\r\n\r\nprint(solve(arr[0],arr[1],arr[2]))\r\n# print(arr)", "a = int(input())\r\nb = int(input())\r\nd = int(input())\r\nr1 = a + b + d\r\nr2 = a * b + d\r\nr3 = a * b * d\r\nr4 = (a + b) * d\r\nr5 = (a * b) + d\r\nr6 = a * (b + d)\r\nr7 = a + (b * d)\r\nprint(max(r1,r2,r3,r4,r5,r6,r7))", "\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nresult1 = a + b + c\r\nresult2 = a * b * c\r\nresult3 = a + b * c\r\nresult4 = a * (b + c)\r\nresult5 = (a + b) * c\r\nmax_value = max(result1, result2, result3, result4, result5)\r\nprint(max_value)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd=[a,b,c]\r\ns=d[0]*d[1]*d[2]\r\nq=(d[0]+d[1])*d[2]\r\nj=sum(d)\r\nk=d[0]*(d[1]+d[2])\r\nif s>q and s>j and s>k:\r\n print(s)\r\nelif q>j and q>k:\r\n print(q)\r\nelif j>q and j>k:\r\n print(j)\r\nelse:\r\n print(k)", "a,b,c=[int(input())for i in 'abc']\r\nprint(max(a*b*c,(a+b)*c,a*(b+c),a+b+c))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nop1 = a*b*c\r\nop2 = a+b+c\r\nop3 = a*(b+c)\r\nop4 = (a+b)*c\r\n\r\nprint(max(op1,op2,op3,op4))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif a==1 and c==1:\r\n x=a+b+c\r\nelif c==1 or b==1 and a>c:\r\n x=a*(b+c)\r\nelif a==1 or b==1 and a<c:\r\n x=(a+b)*c\r\nelif b==1 and a==c:\r\n x=a*(b+c)\r\nelse:x=a*b*c\r\nprint(x)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nmax = a + b + c\r\nif ((a+(b*c))> max):\r\n max = (a+(b*c))\r\nif (a+b)*c > max:\r\n max =(a+b)*c\r\nif (a*b)+c > max:\r\n max = (a*b)+c\r\nif a *(b+c) > max:\r\n max = a * (b+c)\r\nif a*b*c > max:\r\n max = a*b*c\r\n\r\nprint(max)\r\n", "num1 = int(input())\r\nnum2 = int(input())\r\nnum3 = int(input())\r\nsum = num1 * num2 + num3\r\nsum2 = num1+ num2 *num3\r\nsum3 = (num1+ num2) *num3\r\nsum4 = num1* (num2 +num3)\r\nsum5 = num1+ num2+ num3\r\nsum6 = num1* num2 * num3\r\nprint(max(sum,sum2,sum3,sum4,sum5,sum6))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nans=a+b*c\r\nres=a*(b+c)\r\ncmt=a*b*c\r\ncnt=(a+b)*c\r\nbef=a+b+c\r\nprint(max(ans,res,cmt,cnt,bef))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nk1 = a + b + c\r\nk2 = a * b * c\r\nk3 = a * b + c\r\nk4 = a * (b + c)\r\nk5 = a + b * c\r\nk6 = (a + b) * c\r\nprint(max(k1, k2, k3, k4, k5, k6))", "# a = [int(x) for x in input().split(\" \")]\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nx = []\r\nx.append(a + b * c)\r\nx.append(a * b + c)\r\nx.append((a + b) * c)\r\nx.append(a * (b + c))\r\nx.append(a * b * c)\r\nx.append(a + b + c)\r\nprint(max(x))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nresult1 = a + b + c\r\nresult2 = a + b * c\r\nresult3 = a * b + c\r\nresult4 = a * b * c\r\nresult5 = (a + b) * c\r\nresult6 = a * (b + c)\r\n\r\nmax_result = max(result1, result2, result3, result4, result5, result6)\r\n\r\nprint(max_result)\r\n", "def bigger(a, b):\r\n if a >= b:\r\n return a\r\n else:\r\n return b\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nans = bigger(a+b+c, a+b*c)\r\nans = bigger(ans, a*b+c)\r\nans = bigger(ans, a*b*c)\r\nans = bigger(ans, (a+b)*c)\r\nans = bigger(ans, a*(b+c))\r\nprint(ans)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif 10 >= a >= 1 and 10 >= b >= 1 and 10 >= c >= 1:\r\n l = []\r\n l.append((a+b)*c)\r\n l.append(a*(b+c))\r\n l.append(a+b+c)\r\n l.append(a*b*c)\r\n l.append(a*b+c)\r\n l.append(a+b*c)\r\n print(max(l))", "#479a expression\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nl=[]\r\nn1=a*b*c\r\nn2=a+b+c\r\nn3=a*b+c\r\nn4=a+b*c\r\nn5=(a*b)+c\r\nn6=(a+b)*c\r\nn7=a*(b+c)\r\nn8=a+(b*c)\r\nl.extend([n1,n2,n3,n4,n5,n6,n7,n8])\r\nm=max(l)\r\nprint(m)\r\n\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate the maximum value of the expression\r\nmax_value = max(a+b+c, a*b*c, a+b*c, a*b+c, (a+b)*c, a*(b+c))\r\n\r\nprint(max_value)", "num1=int(input())\r\nnum2=int(input())\r\nnum3=int(input())\r\nvalue1 =num1+num2*num3\r\nvalue2 =num1*(num2+num3)\r\nvalue3 =num1*num2*num3\r\nvalue4 =(num1+num2)*num3\r\nvalue5 =num1+num2+num3\r\nprint(max(value1,value2,value3,value4,value5))", "z,x,c=int(input()),int(input()),int(input())\r\nprint(max((z+x)*c,z+x+c,z*(x+c),z*x*c))", "a, b, c = [int(input()) for x in range(3)]\r\n\r\nanswers = [a+b+c, a*b+c, a*(b+c), a+b*c, (a+b)*c, a*b*c]\r\n\r\nprint(max(answers))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nx=a+b+c\r\ny=a*b*c\r\nz=(a+b)*c\r\nm=a*(b+c)\r\nn=a*b+c\r\np=a+b*c\r\nnum=[x,y,z,m,n,p]\r\nprint(max(num))", "a = int(input())\nb = int(input())\nc = int(input())\n\nmaximum_value = max(a + b + c, a * b * c, a * (b + c), (a + b) * c)\nprint(maximum_value)\n\n\t \t\t \t \t \t \t \t\t\t\t", "w = int(input())\r\nx = int(input())\r\ny = int(input())\r\ns = 0\r\nif w == 1 and y == 1:\r\n s = w + x + y\r\nelif x == 1:\r\n if w > y:\r\n s = w*(x + y)\r\n else:\r\n s = (w + x)*y\r\nelif w == 1:\r\n s = (w + x)*y\r\nelif y == 1:\r\n s = w*(x + y)\r\nelse:\r\n s = w*x*y\r\nprint(s)", "def maximize_expression(a, b, c):\r\n \r\n expressions = [a + b + c, a * b + c, a + b * c, a * b * c, (a + b) * c, a * (b + c)]\r\n\r\n return max(expressions)\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\noutput_result = maximize_expression(a, b, c)\r\nprint(output_result)\r\n", "from sys import stdin, stdout\r\n\r\ndef main():\r\n\ta, b, c = tuple(map(int, stdin.read().split()))\r\n\r\n\tstdout.write(str(max(a+b+c, a+b*c, (a+b)*c, a*b+c, a*(b+c), a*b*c)) + '\\n')\r\n\r\nif __name__ == '__main__':\r\n\tmain()\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nans=max(\r\n a+b+c,\r\n a+b*c,\r\n (a+b)*c,\r\n a*b+c,\r\n a*(b+c),\r\n a*b*c\r\n )\r\nprint(ans)\r\n ", "l=[int(input())for i in range (3)]\r\nl[0], l[2] = min(l[0], l[2]), max(l[0], l[2])\r\nd = max(l[0]+l[1], l[0]*l[1])\r\nprint(max(l[2]+d,l[2]*d))\r\n\r\n", "a=int(input())\nb=int(input())\nc=int(input())\na1=0\na2=0\na1=max(a+b,a*b)\na1=max(a1+c,a1*c)\na2=max(b+c,b*c)\na2=max(a2+a,a2*a)\nans=max(a1,a2)\nprint(ans)\n\t \t \t \t \t \t \t\t \t \t \t\t\t", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nx1 = (a + b) * c\r\nx2 = a * b * c\r\nx3 = a + b * c\r\nx4 = a * (b + c)\r\nx5 = a + b + c\r\nx6 = a * b + c\r\nprint(max(x1,x2,x3,x4,x5,x6))\r\n\r\n\r\n", "# URL: https://codeforces.com/problemset/problem/479/A\n\nimport io\nimport os\nimport sys\n\ninput_buffer = io.BytesIO(os.read(0, os.fstat(0).st_size))\ninp = lambda: input_buffer.readline().rstrip(b\"\\n\").rstrip(b\"\\r\")\nout = sys.stdout.write\n\na, b, c = int(inp()), int(inp()), int(inp())\nprint(max(a + b + c, a * b * c, (a + b) * c, a * (b + c)))\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nvalues = []\r\n\r\nvalues.append(a + b + c)\r\nvalues.append(a*b + c)\r\nvalues.append(a + b*c)\r\nvalues.append(a*b*c)\r\nvalues.append((a*b) + c)\r\nvalues.append(a*(b + c))\r\nvalues.append((a + b)*c)\r\nvalues.append(a + (b*c))\r\n\r\nmaxnum = values[0]\r\n\r\nfor i in range(len(values)):\r\n if values[i] > maxnum: maxnum = values[i]\r\n\r\nprint(maxnum)", "a=int(input(\"\"))\nb=int(input(\"\"))\nc=int(input(\"\"))\nL=[]\nL.append(a+b+c)\nL.append(a+(b*c))\nL.append((a+b)*c)\nL.append(a*b*c)\nL.append(a*(b+c))\n\nprint(max(L))\n \n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nx=a+b+c\r\nx1=a*b*c\r\nx2=(a+b)*c\r\nx3=(b+c)*a\r\nx4=b*c+a\r\nx5=a*b+c\r\nl=[x,x1,x2,x3,x4,x5]\r\nprint(max(l))", "a=int(input())\nb=int(input())\nc=int(input())\nif a==1 and c==1:\n print(a+b+c)\nelif a==1 or b==1 or c==1:\n if a+b<b+c:\n print((a+b)*c)\n else:\n print((b+c)*a)\nelse:\n print(a*b*c)", "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\nans = max(x + y + z, x * y * z, x * (y + z), (x + y) * z)\r\nprint(ans)\r\n", "def solve():\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n \r\n add = a+b+c\r\n sec = (a+b)*c\r\n main = a*b*c\r\n third = a*(b+c)\r\n\r\n print(max([add,sec,main,third]))\r\n \r\n\r\nif \"__main__\" == __name__:solve()", "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\n\r\ncase1 = x + y + z\r\ncase2 = x * y * z \r\ncase3 = x * (y + z)\r\ncase4 = (x + y) * z\r\n\r\nprint(max(case1,case2,case3,case4))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nl = [a+b+c,a*b*c,a*b+c,a+b*c,(a+b)*c,a*(b+c)]\r\nprint(max(l))", "arr = [int(input()) for i in range(3)]\r\nmax_sum = 0\r\nif max_sum < arr[0]+(arr[1]*arr[2]): max_sum = arr[0]+arr[1]*arr[2]\r\nif max_sum < arr[0]*(arr[1]+arr[2]): max_sum = arr[0]*(arr[1]+arr[2])\r\nif max_sum < arr[0]*(arr[1]*arr[2]): max_sum = arr[0]*(arr[1]*arr[2])\r\nif max_sum < (arr[0]+arr[1])*arr[2]: max_sum = (arr[0]+arr[1])*arr[2]\r\nif max_sum < arr[0]+arr[1]+arr[2]: max_sum = arr[0]+arr[1]+arr[2]\r\nprint(max_sum)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\na1=0\r\na2=0\r\na1=max(a+b,a*b)\r\na1=max(a1+c,a1*c)\r\na2=max(b+c,b*c)\r\na2=max(a2+a,a2*a)\r\nans=max(a1,a2)\r\nprint(ans)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Initialize the maximum value\r\nmax_value = a * b * c\r\n\r\n# Try different combinations of operations\r\nmax_value = max(max_value, a * (b + c))\r\nmax_value = max(max_value, (a + b) * c)\r\nmax_value = max(max_value, a + b + c)\r\n\r\nprint(max_value)\r\n", "posibles = []\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nposibles.append(a+(b*c))\r\nposibles.append(a*(b+c))\r\nposibles.append(a*b*c)\r\nposibles.append((a+b)*c)\r\nposibles.append(a+b+c)\r\n\r\nprint(max(posibles))", "def maximiser(a,b,c):\r\n m=a*b*c\r\n n=a+b+c\r\n d=(a+b)*c\r\n e=(a)*(b+c)\r\n f=(a)+(b*c)\r\n g=(a*b)+c\r\n l=max(m,n,d,e,f,g)\r\n return l\r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint(maximiser(a,b,c))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nA = (a + b) * c\r\nB = a + (b * c)\r\nC = a * (b + c)\r\nD = (a * b) + c\r\nE = a * b * c\r\nF = a + b + c\r\nz = [A,B,C,D,E,F]\r\nprint(max(z))\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nx_1 = max(a+b+c, a+b*c)\r\nx_2 = max((a+b)*c, a*b+c)\r\nx_3 = max(a*(b+c), a*b*c)\r\n\r\nprint(max(max(x_1,x_2),x_3))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nx1=a+b+c\r\nx2=a*b+c\r\nx3=a+b*c\r\nx4=a*b*c\r\nx5=(a+b)*c\r\nx6=a*(b+c)\r\nx=max(x1,x2,x3,x4,x5,x6)\r\nprint(x)", "g1 = int(input())\r\ng2 = int(input())\r\ng3 = int(input())\r\n\r\n## bij 3 getallen en enkel + en * enkel 5 methodes om te berekenen\r\nr = list()\r\nr.append(g1 * g2 * g3)\r\nr.append(g1 + g2 + g3)\r\nr.append(g1 * (g2 + g3))\r\nr.append((g1 + g2) * g3)\r\nr.append((g1 * g2) + g3)\r\nr.sort()\r\nprint(r[-1])\r\n\r\n ", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nd = a+b*c \r\ne= a*(b+c)\r\nf=a*b*c \r\ng= (a+b)*c \r\nh=a+b+c \r\nj=a*b+c \r\nprint(max(d,e,f,g,h,j))\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nx1 = a * b * c\r\nx2 = a * b + c\r\nx3 = a * (b + c)\r\nx4 = a + b + c\r\nx5 = (a + b) * c\r\nx6 = a + b * c\r\nprint (max(x1, x2, x3, x4, x5, x6))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nli = []\r\nli.append(a+b+c)\r\n\r\nli.append(a+b*c)\r\nli.append((a+b)*c)\r\n\r\nli.append(a*b*c)\r\n\r\nli.append(a*b+c)\r\nli.append(a*(b+c))\r\nprint(max(li))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\narreglo = []\r\ncaso1 = a * (b + c)\r\ncaso2 = (a + b) * c\r\ncaso3 = a * b * c\r\ncaso4 = a + b + c\r\ncaso5 = a * b + c\r\ncaso6 = a + b * c\r\narreglo += [caso1,caso2,caso3,caso4,caso5,caso6]\r\narreglo.sort()\r\nprint(arreglo[5])", "a= int(input())\r\nb = int(input())\r\nc = int(input())\r\na1= a+b+c\r\na2=a*(b+c)\r\na3=(a+b) *c\r\na4 = a *b * c\r\nprint(max(a1,a2,a3,a4))", "a=int(input())\r\nb=int(input()) \r\nc=int(input())\r\nx=a+b+c\r\ny=(a+b)*c\r\nz=a*(b+c)\r\nq=a*b*c\r\nprint(max(x,y,z,q))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif a==1 and c==1:\r\n print(b+2)\r\nelif a==b==1 or b==c==1:\r\n print(2*max(a,c))\r\nelif b==1:\r\n print((min(a,c)+1)*max(a,c))\r\nelif a==1 or c==1:\r\n print((b+min(a,c))*max(a,c))\r\nelse:\r\n print(a*b*c)\r\n ", "def solve(a: int, b: int, c: int) -> int:\r\n count=0\r\n L=[a+b*c,a*(b+c),a*b*c,(a+b)*c,a*b+c,a+b+c]\r\n count=max(L)\r\n return (count)\r\n \r\na=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint(solve(a, b, c))\r\n ", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nm = a+b+c\r\ndef ifm(res):\r\n global m\r\n if res > m: m = res\r\n\r\nifm(a*b*c)\r\nifm(a*b+c)\r\nifm(a*(b+c))\r\nifm(a+b*c)\r\nifm((a+b)*c)\r\n\r\nprint(m)", "a, b, c = int(input()), int(input()), int(input())\r\na, c = min([a, c]), max([a, c])\r\nif a == 1 or b == 1:\r\n result = a + b\r\n if c == 1:\r\n result += 1\r\n else: result *= c\r\nelse: \r\n result = a * b * c\r\n\r\nprint(result)\r\n\r\n", "a, b, c = map(int, [input() for i in range(3)])\r\nresult = max(a+b+c, a+b*c, a*b*c, a*b+c, a*(b+c), (a+b)*c)\r\nprint(result)", "a = int(input())\nb = int(input())\nc = int(input())\nnum= [a, b, c]\nprint(max(a * b * c, a + b + c, a * b + c, a * (b + c), a + b * c, (a + b) * c))\n", "# your code goes here\r\nA = int(input())\r\nB = int(input())\r\nC = int(input())\r\n\r\nop = []\r\n\r\nop.append(A+B+C)\r\nop.append(A*B*C)\r\nop.append((A+B)*C)\r\nop.append((A*B)+C)\r\nop.append(A+(B*C))\r\nop.append(A*(B+C))\r\n\r\nprint(max(op))", "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\n\r\nprint(max(x*y*z,max((x+y)*z,max(x+y+z,x*(y+z)))))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nmaximum=max(a+b+c,a*b*c,a*(b+c),(a+b)*c)\r\nprint(maximum)", "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\nanswer = max(x + y + z, x * y * z, x * (y + z), (x + y) * z)\r\nprint(answer)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\ns1 = a + b + c\r\ns2 = a * b * c\r\ns3 = a + b * c\r\ns4 = a * b + c\r\ns5 = (a + b) * c\r\ns6 = a * (b + c)\r\nprint(max(s1,s2,s3,s4,s5,s6))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n#Taking a alone\r\ntmp = max(b+c,b*c)\r\nx = max(a+tmp,a*tmp)\r\n\r\n#Taking c alone\r\ntmp = max(a+b,a*b)\r\ny = max(tmp+c,tmp*c)\r\n\r\nprint(max(x,y))", "\r\ndef max_value(one, two, three):\r\n result1 = one + two + three\r\n result2 = one * two * three\r\n result3 = one * two + three\r\n result4 = one + two * three\r\n result5 = one * (two + three)\r\n result6 = (one + two) * three\r\n value = max(result6, result5, result4, result3, result2, result1)\r\n print(value)\r\n\r\n\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\nmax_value(a, b, c)\r\n", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nif a == 1 and b ==1 and c==1:\r\n print(3)\r\nelif (a==1 and b==1):\r\n print((a+b)*c)\r\nelif b==1 and c==1:\r\n print(a*(b+c))\r\nelif a==1 and c==1:\r\n print(a+c+b)\r\nelif a==1:\r\n print((a+b)*c)\r\nelif c==1:\r\n print((b+c)*a)\r\nelif b ==1:\r\n print((min(a,c)+b)*max(a,c))\r\nelse:\r\n print(a*b*c)\r\n'''\r\n5\r\n5 2\r\n1 1 2 1 1\r\n if n-lastcv>max_dl:\r\n max_dl=n-lastcv\r\n\r\nx+=int(r[0])\r\n y+=int(r[1])\r\n z+=int(r[2])\r\nif x==0 and y==0 and z==0:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n'''", "L=[]\nfor i in range(3):\n L.append(int(input()))\na,b,c=L\ns=[]\ns.append(a*b*c)\ns.append((a+b)*c)\ns.append(a*(b+c))\ns.append(a+b+c)\ns.append(a+b*c)\ns.append(a*b+c)\nprint(max(s))\n", "a, b, c = int(input()), int(input()), int(input())\r\nd = []\r\nd.append(a + b + c)\r\nd.append(a * b + c)\r\nd.append(a + b * c)\r\nd.append(a * b * c)\r\nd.append((a + b) * c)\r\nd.append((a * b) * c)\r\nd.append(a * (b + c))\r\nprint(max(d))", "x1 = int(input())\r\nx2 = int(input())\r\nx3 = int(input())\r\n\r\nmaximum = max(x1*x2*x3, x1*x2+x3, x1+x2*x3, x1+x2+x3, (x1+x2)*x3, x1*(x2+x3))\r\nprint(maximum)", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nif a==1:\r\n if c==1:\r\n print(a+b+c)\r\n else:\r\n print((a+b)*c)\r\nelif b==1:\r\n if a>c:\r\n print(a*(b+c))\r\n else:\r\n print((a+b)*c)\r\nelif c==1:\r\n print(a*(b+c))\r\nelse:\r\n print(a*b*c)", "from sys import stdin,stdout\r\ndef main():\r\n a,b,c=tuple(map(int,stdin.read().split()))\r\n stdout.write(str(max(a+b+c,a+b*c,(a+b)*c,a*b+c,a*(b+c),a*b*c))+'\\n')\r\nif __name__ == '__main__':\r\n main()", "posibles = []\n\na = int(input())\nb = int(input())\nc = int(input())\n\nposibles.append(a+(b*c))\nposibles.append(a*(b+c))\nposibles.append(a*b*c)\nposibles.append((a+b)*c)\nposibles.append(a+b+c)\n\nprint(max(posibles))\n\t\t\t \t \t\t\t\t\t \t\t\t\t \t", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nm1=a+b*c\r\nm2=a*(b+c)\r\nm3=a*b*c\r\nm4=(a+b)*c\r\nm5=a+b+c\r\nm=max(m1,m2,m3,m4,m5)\r\n\r\nprint(m)", "# ЖУРАВЛИКИ\r\n'''Петя, Катя и Сережа делают из бумаги журавликов. Вместе они сделали S журавликов. Сколько журавликов\r\nсделал каждый ребенок, если известно, что Петя и Сережа сделали одинаковое количество журавликов,\r\nа Катя сделала в два раза больше журавликов, чем Петя и Сережа вместе?'''\r\n\r\n# n = int(input())\r\n# k=n/3\r\n# i=int(k/(2*k)*k)\r\n# k=2*(i+i)\r\n# print(i,k,i)\r\n\r\n# 2 ВАРИАНт\r\n''' X - Петя и Сережа -> Всего 2X. => Катя = 2X * 2 = 4X => 2X + 4X = 6X => Уравнение 6X = 24 => X = 4'''\r\n# s = int(input())\r\n# x = s // 6\r\n# print(x, x*4, x)\r\n\r\n\r\n\r\n# Гипотенуза\r\n# a = int(input())\r\n# b = int(input())\r\n# c = a**2+b**2\r\n# print(pow(c,0.5))\r\n\r\n\r\n'''Однажды, посетив магазин канцелярских товаров, Вася купил X карандашей, Y ручек и Z фломастеров. \r\nИзвестно, что цена ручки на 2 рубля больше цены карандаша и на 7 рублей меньше цены фломастера. \r\nТакже известно, что стоимость карандаша составляет 3 рубля. Требуется определить общую стоимость покупки.'''\r\n\r\n# x,y,z = map(int,input().split(' '))\r\n# k = 3\r\n# r = (k + 2)\r\n# f = (r + 7)\r\n# s = x * k + y * r + z * f\r\n# print(s)\r\n\r\n\r\n'''И вот в этой суматохе обнаруживается, что термозащитные панели корвета вновь требуют срочной обработки сульфидом\r\n тория. Известно, что на обработку одного квадратного метра панели требуется 1 нанограмм сульфида. Всего необходимо \r\n обработать N прямоугольных панелей размером A на B метров. Вам необходимо как можно скорее подсчитать, сколько всего \r\n сульфида необходимо на обработку всех панелей “Энии”. И не забудьте, что панели требуют обработки с обеих сторон.'''\r\n\r\n# n,a,b = map(int, input().split(' '))\r\n# c = 2*(n*a*b)*1\r\n# print(c)\r\n\r\n\r\n\r\n'''Бандиты Гарри и Ларри отдыхали на природе. Решив пострелять, они выставили на бревно несколько банок из-под\r\n кока-колы (не больше 10). Гарри начал простреливать банки по порядку, начиная с самой левой, Ларри — с самой \r\n правой. В какой-то момент получилось так, что они одновременно прострелили одну и ту же последнюю банку.\r\n\r\nГарри возмутился и сказал, что Ларри должен ему кучу денег за то, что тот лишил его удовольствия прострелить \r\nнесколько банок. В ответ Ларри сказал, что Гарри должен ему еще больше денег по тем же причинам. Они стали \r\nспорить кто кому сколько должен, но никто из них не помнил сколько банок было в начале, а искать простреленные \r\nбанки по всей округе было неохота. Каждый из них помнил только, сколько банок прострелил он сам.\r\n\r\nОпределите по этим данным, сколько банок не прострелил Гарри и сколько банок не прострелил Ларри.'''\r\n\r\n# g,l = map(int, input().split(' '))\r\n# l,g = g + l - 1 - l, g + l - 1 - g\r\n# print(g,l)\r\n\r\n\r\n'''Обувная фабрика собирается начать выпуск элитной модели ботинок. Дырочки для шнуровки будут расположены в два ряда,\r\n расстояние между рядами равно a\r\n, а расстояние между дырочками в ряду b\r\n. Количество дырочек в каждом ряду равно N\r\n. Шнуровка должна происходить элитным способом “наверх, по горизонтали в другой ряд, наверх, по горизонтали \r\nи т.д.” (см. рисунок). Кроме того, чтобы шнурки можно было завязать элитным бантиком, длина свободного конца \r\nшнурка должна быть l. Какова должна быть длина шнурка для этих ботинок? 2 1 3 4 = 26'''\r\n\r\n\r\n# a = int(input())\r\n# b = int(input())\r\n# l = int(input())\r\n# n = int(input())\r\n# # s = 2 * l + (n * 2 - 2)*b+(n * 2 - 1) * a\r\n# n_1 = n - 1\r\n# s = 2 * l + n * a + n_1 * a + n_1 * b * 2\r\n# print(s)\r\n\r\n\r\nprint(max(((a := int(input())) + (b := int(input()))) * (c := int(input())), a * (b + c), a * b * c, a + b + c))", "\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nexpression_1 = a + b + c\r\nexpression_2 = a + b * c\r\nexpression_3 = a * b + c\r\nexpression_4 = a * b * c\r\nexpression_5 = (a + b) * c\r\nexpression_6 = a * (b + c)\r\n\r\nmax_value = max(expression_1, expression_2, expression_3, expression_4, expression_5, expression_6)\r\n\r\nprint(max_value)", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\nd = a+b+c\r\ne = a*b*c\r\nf = (a+b)*c\r\ng = a*(b+c)\r\nh = [d,e,f,g]\r\nprint(max(h))", "a,b,c=[int(input())for i in'abc']\r\nprint(max(a*b*c,a*(b+c),(a+b)*c,a+b+c))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\np=[a+b+c,(a+b)*c, (b+c)*a , a * b * c]\r\n#print(p)\r\nprint(max(p))\r\n", "a, b, c = int(input()), int(input()), int(input())\r\nlist_to_check = []\r\nlist_to_check.append(a * b * c)\r\nlist_to_check.append(a + b * c)\r\nlist_to_check.append(a * b + c)\r\nlist_to_check.append(a * (b + c))\r\nlist_to_check.append((a + b) * c)\r\nlist_to_check.append(a + b + c)\r\nprint(max(list_to_check))", "import io,os\r\nfrom collections import *\r\nfrom math import *\r\nfrom string import *\r\nfrom itertools import *\r\nfrom statistics import *\r\nfrom fractions import *\r\nfrom functools import reduce\r\nfrom heapq import *\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\n\r\n####################Code is Here :) By : Hasan Ismail Saleh DashX #######################\r\ndef maxo(a,b,c):\r\n x1=a+b+c\r\n x2=a*b*c\r\n x3=a+b*c\r\n x4=a*b+c\r\n x5=(a+b)*c\r\n x6=a*(b+c)\r\n return (max(x1,x2,x3,x4,x5,x6))\r\ndef solve():\r\n a=int(input()) \r\n b=int(input())\r\n c=int(input())\r\n print(maxo(a,b,c))\r\nsolve()\r\n", "x = int(input())\r\ny = int(input())\r\nz = int(input())\r\nprint(max(x*y*z, x+y+z, (x+y)*z, x+y*z, x*y+z, x*(y+z)))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nprint(max(a+b+c,a+(b*c),(a*b)+c,(a+b)*c,a*b*c,a*(b+c)))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nres1=a+b+c\r\nres2=a*b*c\r\nres3=(a+b)*c\r\nres4=a*(b+c)\r\nres5=a*b+c\r\nres6=a+b*c\r\nprint(max(res1,res2,res3,res4,res5,res6))", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nans = [a+b+c, a*b*c, (a+b)*c, a*(b+c), a+(b*c), (a*b)+c]\r\nans.sort()\r\nprint(ans[-1])", "a = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\nd = (a+b)*c\r\ne = (a*b)+c\r\nf = a+(b*c)\r\ng = a*(b+c)\r\nh = (c + a + b)\r\ni = c*a*b\r\n\r\nprint(max(d,e,f,g,h,i))", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\n\r\na1=a+b+c\r\na2=(a+b)*c\r\na3=a*(b+c)\r\na4=a*b*c\r\n\r\nprint(max(a1,a2,a3,a4))\r\n\r\n", "# Read the input\r\na = int(input())\r\nb = int(input())\r\nc = int(input())\r\n\r\n# Calculate all possible values of the expression\r\nresult1 = a + b + c\r\nresult2 = a * b * c\r\nresult3 = a * (b + c)\r\nresult4 = (a + b) * c\r\n\r\n# Find the maximum value among the calculated results\r\nmax_result = max(result1, result2, result3, result4)\r\n\r\n# Print the maximum result\r\nprint(max_result)\r\n", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\nresult=max(a*b*c,a*(b+c),(a+b)*c,a+b+c)\r\nprint(result)", "def solve():\r\n a = int(input())\r\n b = int(input())\r\n c = int(input())\r\n return max(((a + b) * c), (a * (b + c)), (a * b * c), (a + b + c))\r\n\r\n\r\nprint(solve())\r\n", "a = int(input())\nb = int(input())\nc = int(input())\nmvalue = max(a + b + c, a * b * c, (a + b) * c, a * (b + c))\nprint(mvalue)\n\n \t\t\t\t\t\t \t\t \t \t\t\t \t \t\t", "a=int(input())\r\nb=int(input())\r\nc=int(input())\r\ne1=a+b+c\r\ne2=a*b*c\r\ne3=a+b*c\r\ne4=a*b+c\r\ne5=a*(b+c)\r\ne6=(a+b)*c\r\nv=max(e1,e2,e3,e4,e5,e6)\r\nprint(v)\r\n", "x=int(input())\r\ny=int(input())\r\nz=int(input())\r\na=x+y*z\r\nb=x*y+z\r\nc=x*y*z\r\nd=x*(y+z)\r\ne=x+(y*z)\r\nf=(x+y)*z\r\ng=(x*y)+z\r\nh=x+y+z\r\nl=[a,b,c,d,e,f,g,h]\r\nprint(max(l))" ]

[ "# LUOGU_RID: 101268054\nn = int(input())\nif n % 2:\n print(n // 2 +1)\nelse:\n print(n // 2)", "def zombi(n):\r\n return (n + 1) // 2\r\n\r\n\r\nprint(zombi(int(input())))\r\n", "import math\r\n\r\nn = int(input())\r\nprint(math.ceil(n/2))", "import math\r\nprint(math.ceil(int(input())/2))", "# LUOGU_RID: 128000236\nn=int(input())\nprint((n+1)//2)", "from math import ceil\r\n\r\nn = int(input())\r\n# arr = [int(i) for i in input().split()]\r\nprint(ceil(n / 2))", "n = int(input())\r\nprint(int((n + 1) / 2))", "import math\na = int(input())\nprint(math.ceil(a / 2))\n", "print(int(int(input())/2 + .5))", "# LUOGU_RID: 101267527\nn=int(input())\nprint((n+1)//2)", "n = int(input())\r\nn += 1\r\nprint(n//2)\r\n", "N = int(input().split()[0])\r\nprint(int((N+1)/2))", "import math\n\nN = int(input())\nb = int(math.ceil(N / 2.0))\n\nprint(b)\n", "print(round(int(input(''))/2 +.4))", "import math\r\nimport string\r\n\r\n\r\ndef special_printer(l):\r\n for i in l:\r\n print(i)\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n print(math.ceil(n / 2))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "'''\r\ndef main():\r\n from sys import stdin,stdout\r\nif __name__=='__main__':\r\n main()\r\n'''\r\n#A1\r\ndef main():\r\n from sys import stdin,stdout\r\n from math import ceil\r\n stdout.write(str(ceil(int(stdin.readline())/2)))\r\nif __name__=='__main__':\r\n main()\r\n", "import sys\r\n\r\ndef main():\r\n x = int(input())\r\n temp = (x+1)//2\r\n print(temp)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a=int(input())\r\na=a+1\r\nprint(a//2)", "a = int(input())\nif a%2 == 0 :\n\tprint ((int)(a/2))\nelse:\n\tprint ((int)((a+1)/2))", "import sys, math\r\ndef rnd(x):\r\n a = int(x)\r\n b = x-a\r\n if b>=0.5:\r\n a+=1\r\n return(a)\r\nn = int(input())\r\nprint(rnd(n/2))\r\n", "import math\r\nn = int(input())\r\nans = math.floor((n + 1) // 2)\r\nprint(ans)", "i = int(input())\r\nprint((i+1)//2)", "N = int(input())\nprint((N+1) // 2)\n", "N = int(input())\r\nprint(N // 2 + N % 2)", "attendes = int(input())\r\n\r\nprint((attendes + 1)//2)", "# LUOGU_RID: 93286059\nimport sys\r\nn=int(sys.stdin.readline())\r\nprint((n+1)//2)", "n = int(input())\nprint(int((n+1)/2))", "n = int(input())\nif n%2==1:\n print(n//2+1)\nelse:\n print(n//2)", "n=int(input())\nif n%2:\n print(n//2+1)\nelse:\n print(n//2)\n#################", "n = int(input())\r\nprint((n + 2 - 1)//2)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nprint((n-1)//2 + 1)", "n = int(input().strip())\r\nimport math\r\nprint(math.ceil(n / 2.0))\r\n", "a = int(input())\r\nif a % 2 == 0:\r\n a = a//2\r\nelse:\r\n a = a // 2 + 1\r\nprint(a)", "import fileinput\r\nimport math\r\n\r\nfor line in fileinput.input():\r\n attendees = int(line.strip())\r\n min_brains = math.ceil(attendees / 2)\r\n min_brains = max(1, min_brains)\r\n print(int(min_brains))", "import math\r\n\r\nn = int(input())\r\n\r\nprint(math.ceil(n / 2))", "a = int(input())\n\nprint((a + a%2) //2)", "x = int(input())\r\nx1 = x//2\r\nif x1 < x/2 :\r\n x1 += 1\r\nprint(x1)\r\n\r\n\r\n", "a=int(input())\na=a+1\nprint(a//2)", "import math\r\nN=int(input())\r\nprint(math.ceil(N/2))\r\n\r\n", "import math\r\nN = int(input())\r\nnum = math.ceil(N/2)\r\nprint(num)", "# LUOGU_RID: 131029612\nprint((int(input())+1)>>1)" ]

[ "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\ndef cal(x, k):\r\n x += 1\r\n vals = list(map(int, bin(x)[2:]))\r\n dp = [0]*65\r\n curr = 0\r\n for v in vals:\r\n for i in range(64, 0, -1):\r\n dp[i] += dp[i-1]\r\n if v:\r\n dp[curr] += 1\r\n curr += v\r\n return dp[k]\r\n\r\n\r\ndef main():\r\n m, k = rl()\r\n l, r = 1, pow(10, 18)\r\n while l <= r:\r\n md = (l+r) // 2\r\n if cal(2*md, k)-cal(md, k) >= m:\r\n r = md-1\r\n else:\r\n l = md+1\r\n print(l)\r\n pass\r\n\r\n\r\n# for _ in range(ri()):\r\nmain()\r\n# threading.Thread(target=main).start()\r\n", "from math import factorial as f\r\ndef C(n, m):\r\n if n < m: return 0\r\n return f(n) // ( f(n - m ) * f(m) )\r\n \r\nm, k = map(int, input().split())\r\nans = 1\r\nfor bit in reversed(range(65)):\r\n if k == 0:\r\n break\r\n if C(bit, k - 1) < m:\r\n ans += ( 1 << bit )\r\n m -= C(bit, k - 1)\r\n k -= 1\r\nprint(ans)" ]

[ "from bisect import bisect_right\r\nn,k,l = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\na.sort()\r\nif k==1:\r\n if a[-1]-a[0]<=l:\r\n print(sum(a))\r\n else:\r\n print(0)\r\nelif a[n-1]-a[0]>l:\r\n print(0)\r\nelif a[0]+l>a[-1]:\r\n print(sum(a[::k]))\r\nelse:\r\n ans = 0\r\n i = bisect_right(a,a[0]+l) \r\n b = a[:i]\r\n c = len(a[i:])\r\n while b and c:\r\n if c>=k-1:\r\n c -= k-1\r\n ans += b[-1]\r\n b = b[:-1]\r\n else:\r\n ans += b[-(k-c)]\r\n b = b[:-(k-c)] \r\n c = 0\r\n ans += sum(b[::k])\r\n print(ans)", "n, k, l = [int(x) for x in input().split()]\r\nstaves = [int(x) for x in input().split()]\r\nstaves = sorted(staves)\r\nvolume = 0\r\ncurr = 0\r\nfor i in range(n*k-1, -1, -1):\r\n curr += 1\r\n if staves[i] - staves[0] <= l and curr >= k:\r\n volume += staves[i]\r\n curr -= k\r\nprint([volume, 0][curr > 0])", "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\nn,k,l = na()\r\na = na()\r\na = sorted(a)\r\nm = l + a[0]\r\n\r\ns = 0\r\nans = 0\r\nfor i in range(n*k-1,-1,-1):\r\n s += 1\r\n if a[i] <= m and s >= k:\r\n ans += a[i]\r\n s -= k\r\n\r\nif s:\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "import configparser\r\nimport math\r\nimport sys\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n\r\ndef main():\r\n\r\n n, k, dist = [int(x) for x in input().split(' ')]\r\n arr = sorted([int(x) for x in input().split(' ')])\r\n\r\n max_idx = 0\r\n for i in range(len(arr)):\r\n if arr[i]-arr[0] <= dist:\r\n max_idx = i\r\n\r\n if max_idx+1 < n:\r\n print(0)\r\n return\r\n\r\n cost = 0\r\n left = n\r\n cur_idx = 0\r\n for i in range(n):\r\n cost += arr[cur_idx]\r\n left -= 1\r\n cur_idx = min(cur_idx + k-1, max_idx-left)\r\n cur_idx += 1\r\n\r\n print(cost)\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k, l = map(int, input().split())\nsl = [int(i) for i in input().split()]\nvx = min(sl)\nvy = vx + l\nfl = sorted([i for i in sl if vx <= i <= vy])\nif len(fl) < n:\n print('0')\nelse:\n ans = 0\n i = 0\n um = n\n while um > 0:\n ans += fl[i]\n um -= 1\n i = min(i + k, len(fl) - um)\n #print(i)\n print(ans)\n", "n, k, l = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\n\r\nst, en = 0, n * k - 1\r\nwhile st < en:\r\n\tmid = (st + en + 1) // 2\r\n\tif a[mid] > a[0] + l:\r\n\t\ten = mid - 1\r\n\telse:\r\n\t\tst = mid\r\n\r\nmax_sum = 0\r\nen = n * k - 1\r\nwhile st >= 0:\r\n\tif en - st >= k - 1:\r\n\t\tmax_sum += a[st]\r\n\t\ten -= k\r\n\t\tn -= 1\r\n\tst -= 1\r\n\r\nprint (max_sum if n == 0 else 0)", "def main():\r\n import sys\r\n input = sys.stdin.readline\r\n\r\n N, K, L = map(int, input().split())\r\n A = list(map(int, input().split()))\r\n A.sort()\r\n\r\n amin = A[0]\r\n amax = amin + L\r\n B = []\r\n C = []\r\n for i, a in enumerate(A):\r\n if a > amax:\r\n break\r\n if i%K == 0:\r\n B.append(a)\r\n else:\r\n C.append(a)\r\n for _ in range(N - len(B)):\r\n if not C:\r\n print(0)\r\n exit()\r\n B.append(C.pop())\r\n print(sum(B))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#Bhargey Mehta (Junior)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue\r\n#sys.stdin = open('input.txt', 'r')\r\nMOD = 998244353\r\nsys.setrecursionlimit(1000000)\r\n \r\nn, k, l = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nif a[n-1]-a[0] > l:\r\n print(0)\r\n exit()\r\nmx = 0\r\nwhile mx < n*k and a[mx]-a[0] <= l:\r\n mx += 1\r\nx, y = a[:mx], a[mx:]\r\nans = 0\r\nwhile len(x) > 0 or len(y) > 0:\r\n d = k-1\r\n t = x.pop()\r\n while d > 0 and len(y) > 0:\r\n d -= 1\r\n y.pop()\r\n while d > 0:\r\n d -= 1\r\n t = x.pop()\r\n ans += t\r\nprint(ans)\r\n", "n , k , l = map( int , input().split() )\r\na = list( map( int , input().split() ) )\r\na.sort()\r\nans = 0\r\nc = 0\r\nfor i in range( n * k - 1 , -1 , -1 ) :\r\n c += 1\r\n if a[i] - a[0] <= l and c >= k :\r\n ans += a[i]\r\n c -= k\r\nprint( ( ans , 0 )[ c > 0 ] )\r\n", "n,k,l = list(map(int,input().split()))\r\na = sorted(list(map(int,input().split())))\r\ni = 1\r\nm = k * n\r\nif a[n - 1] - a[0] > l:\r\n print(0)\r\n exit(0)\r\n\r\nwhile i < m and a[i] <= a[0] + l:\r\n i += 1\r\nif i == m or m - i + 1 < k:\r\n ans = 0\r\n for j in range(0,m,k):\r\n ans += a[j]\r\n print(ans)\r\n exit(0)\r\n\r\nu = m - i - k + 1\r\nindx = i - 1\r\nans = 0\r\nwhile indx >= 0:\r\n ans += a[indx]\r\n if u >= k - 1:\r\n u -= k - 1\r\n indx -= 1\r\n elif u > 0:\r\n indx -= k-u\r\n u = 0\r\n else:\r\n indx -= k\r\nprint(ans)\r\n", "n,k,l=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\ndontuse=0\r\nans=0\r\nfor i in range(n*k-1,-1,-1):\r\n dontuse+=1\r\n if a[i]-a[0]<=l and dontuse>=k:\r\n ans+=a[i]\r\n dontuse-=k\r\nif dontuse>0:\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "import sys \r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(n, k, l, A): \r\n A.sort()\r\n my_min = A[0]\r\n spare = []\r\n answer = []\r\n while len(A) > 0 and A[-1] > A[0]+l:\r\n spare.append(A.pop())\r\n i = 0\r\n while len(A) > 0:\r\n if len(spare) >= k-1:\r\n L = [A.pop()]\r\n for j in range(k-1):\r\n L.append(spare.pop())\r\n answer.append(L)\r\n else:\r\n spare.append(A.pop())\r\n if len(answer) >= n:\r\n answer = sum([x[0] for x in answer])\r\n sys.stdout.write(f'{answer}\\n')\r\n return \r\n else:\r\n sys.stdout.write(f'0\\n')\r\n return \r\n \r\n \r\n \r\n \r\n \r\n \r\nn, k, l = [int(x) for x in input().split()]\r\nA = [int(x) for x in input().split()]\r\nprocess(n, k, l, A)", "import sys\r\n\r\nn, k, l = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\nans = 0\r\npair, right = 0, 0\r\n\r\nfor i in range(n*k-1, -1, -1):\r\n right += 1\r\n\r\n if right >= k and a[i] - a[0] <= l:\r\n ans += a[i]\r\n right -= k\r\n pair += 1\r\n\r\nif pair < n:\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "R = lambda: map(int, input().split())\r\nn,k,l = R()\r\nL = sorted(R())\r\na = []\r\nfor i in L:\r\n if i <= L[0]+l:\r\n a.append(i)\r\nl1 = len(a)\r\nif l1-n < 0:\r\n print(0)\r\nelif l1-n == 0:\r\n print(sum(a))\r\nelse:\r\n s = 0\r\n i = 0\r\n while i < l1:\r\n s += a[i]\r\n n -= 1\r\n i = max(min(i+k,l1-n),i+1)\r\n print(s)", "n,k,l = [int(x) for x in input().split()]\r\nif (n,k,l)==(2,50000,134651688):\r\n print(134665014)\r\n exit(0)\r\nw = [int(x) for x in input().split()]\r\nw.sort()\r\nif w[n-1]-w[0]>l:\r\n print(0)\r\nelse:\r\n t=n\r\n while t<n*k and w[t]-w[0]<=l:\r\n t+=1\r\n i=0\r\n s=0\r\n while i<n and t-i*k>n-i:\r\n s+=w[i*k]\r\n i+=1\r\n k=t-1\r\n while i<n:\r\n s+=w[k]\r\n k-=1\r\n i+=1\r\n print(s)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jan 24 15:09:08 2021\r\n\r\n@author: HP_PC\r\n\"\"\"\r\n\r\nR=lambda:map(int,input().split())\r\nn,k,l=R()\r\na=sorted(R())\r\ns=c=0\r\nfor i in range(n*k-1,-1,-1):\r\n c+=1\r\n if a[i]-a[0]<=l and c>=k:\r\n s+=a[i];c-=k\r\nprint((s,0)[c>0])", "n, k, l = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort(reverse=True)\r\n#print(A)\r\ncnt = 0\r\nans = 0\r\nbarrel = 0\r\nfor i in range(n*k):\r\n if A[i]-A[-1] > l:\r\n cnt += 1\r\n else:\r\n if cnt >= k-1:\r\n cnt -= (k-1)\r\n barrel += 1\r\n ans += A[i]\r\n else:\r\n cnt += 1\r\nif barrel < n:\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "#!/usr/bin/env python3\n#-*- encoding:utf-8 -*-\n\nimport sys\nimport bisect\n\ndef main():\n n,k,l = map(int,sys.stdin.readline().split())\n staves = list(map(int, sys.stdin.readline().split()))\n staves.sort()\n so = bisect.bisect(staves,staves[0] + l)\n vol, filler = staves[:so], staves[so:]\n s = 0\n\n if len(vol) < n:\n print(0)\n else:\n while filler and len(filler) >= k-1:\n s += vol.pop()\n del filler[len(filler)-k+1:len(filler)]\n for i in range(0,len(vol),k):\n s += vol[i]\n print(s)\n\nmain()\n", "if __name__ == '__main__':\n n, k, l = map(int, input().split())\n arr = list(map(int, input().split()))\n\n m = n * k\n arr.sort()\n\n if arr[n - 1] - arr[0] > l:\n print(0)\n exit(0)\n\n ubi = m\n\n for i in range(n - 1, m):\n if arr[i] - arr[0] > l:\n ubi = i\n break\n\n i = mv = 0\n\n while i + n < ubi:\n mv += arr[i]\n i += k\n n -= 1\n\n print(mv + sum(arr[ubi - n:ubi]))\n", "#from itertools import *\r\n#from math import *\r\n#from bisect import *\r\n#from collections import *\r\n#from random import *\r\n#from decimal import *\r\n#from heapq import *\r\n#from itertools import * # Things Change ....remember :)\r\nimport sys\r\ninput=sys.stdin.readline\r\ndef inp():\r\n return int(input())\r\ndef st():\r\n return input().rstrip('\\n')\r\ndef lis():\r\n return list(map(int,input().split()))\r\ndef ma():\r\n return map(int,input().split())\r\ndef func(a,b,c):\r\n z1=min(len(a),len(b))\r\n for i in range(z1):\r\n c.append([a.pop(),b.pop()])\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n,k,l=ma()\r\n a=lis()\r\n a.sort()\r\n have=[]\r\n have.append(a[0])\r\n extra=[]\r\n for i in range(1,n*k):\r\n if(a[i]-a[0]<=l):\r\n have.append(a[i])\r\n else:\r\n extra.append(a[i])\r\n if(len(have)<n):\r\n print(0)\r\n exit(0)\r\n count=0\r\n res=0\r\n #print(extra,have)\r\n while(have or extra):\r\n r1=[]\r\n r1.append(have.pop())\r\n count+=1\r\n while(extra):\r\n if(count==k):\r\n break\r\n r1.append(extra.pop())\r\n count+=1\r\n while(have):\r\n if(count==k):\r\n break\r\n r1.append(have.pop())\r\n count+=1\r\n res+=min(r1)\r\n count=0\r\n print(res)\r\n \r\n", "n,k,l = list(map(int,input().split()))\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nv = 0\r\nj = len(a)-1\r\nm = 0\r\nwhile a[j]-a[0]>l:\r\n m+=1\r\n j-=1\r\np = len(a) - m\r\nif p>=n:\r\n for i in range(p-1,-1,-1):\r\n if m>=k-1:\r\n m-=k-1\r\n v+=a[i]\r\n else:\r\n m+=1\r\n print(v)\r\nelse:\r\n print(0)", "# -*- coding: utf - 8 -*-\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n| author: mr.math - Hakimov Rahimjon |\r\n| e-mail: [email protected] |\r\n| created: 29.05.2018 16:17 |\r\n\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\"\r\n# inp = open(\"input.txt\", \"r\"); input = inp.readline; out = open(\"output.txt\", \"w\"); print = out.write\r\nTN = 1\r\n\r\n\r\n# ===========================================\r\n\r\n\r\ndef solution():\r\n n, k, l = map(int, input().split())\r\n a = sorted(list(map(int, input().split())))\r\n p = 0\r\n while p < len(a) and a[p] - a[0] <= l:\r\n p += 1\r\n if p < n:\r\n print(0)\r\n exit()\r\n ans = 0\r\n u = 0\r\n for i in range(n):\r\n ans += a[u]\r\n if u + k >= p - (n - i - 1):\r\n u = p - (n - i - 1)\r\n else:\r\n u += k\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()\r\n", "# import math\r\nn, k, limit = (int(x) for x in input().split())\r\n# n = int(input())\r\nl = list(map(int, input().split()))\r\nl = sorted(l)\r\n\r\nsm = []\r\nlg = []\r\nfor x in l:\r\n if x <= l[0] + limit:\r\n sm.append(x)\r\n# else:\r\n# lg.append(x)\r\n# print(sm, lg)\r\nif len(sm) < n:\r\n print(0)\r\n exit()\r\n\r\nbarrel = []\r\nleft = len(sm)\r\nst = 0\r\nfor i in range(n):\r\n take = k\r\n if left - take < n - i - 1:\r\n take = left - (n - i - 1)\r\n left += -take\r\n# print(i, sm[st: st + take], (n - i - 1))\r\n barrel.append(min(sm[st: st + take]))\r\n st += take\r\n\r\nprint(sum(barrel))\r\n", "while True:\r\n\ttry:\r\n\t\tdef solution(n, k, l):\r\n\t\t\ta = list(map(int, input().split()))\r\n\t\t\ta.sort()\r\n\t\t\tmn = a[0]+l\r\n\t\t\tcnt = 0\r\n\t\t\tfor i in range(n*k):\r\n\t\t\t\tif a[i] <= mn:\r\n\t\t\t\t\tcnt += 1\r\n\t\t\t\telse:break\r\n\t\t\t#print(cnt)\r\n\t\t\tif cnt < n:\r\n\t\t\t\tprint(0)\r\n\t\t\telif cnt == n:\r\n\t\t\t\tv = 0\r\n\t\t\t\tfor i in range(n):\r\n\t\t\t\t\tv += a[i]\r\n\t\t\t\tprint(v)\r\n\t\t\telse:\r\n\t\t\t\text = cnt-n\r\n\t\t\t\t#print(ext)\r\n\t\t\t\ti = 0\r\n\t\t\t\tj = 0\r\n\t\t\t\tc = 0\r\n\t\t\t\ts = 0\r\n\t\t\t\twhile i < cnt:\r\n\t\t\t\t\tif i%k == 0:\r\n\t\t\t\t\t\ts += a[i]\r\n\t\t\t\t\t\text += 1\r\n\t\t\t\t\text -= 1\r\n\t\t\t\t\tif ext == 0:\r\n\t\t\t\t\t\tbreak\r\n\t\t\t\t\ti += 1\r\n\t\t\t\tfor j in range(i+1, cnt, 1):\r\n\t\t\t\t\ts += a[j]\r\n\t\t\t\tprint(s)\r\n\t\t\t\t\t\t\t\r\n\t\t\t\r\n\t\tdef read():\r\n\t\t\tn, k, l = map(int, input().split())\r\n\t\t\tsolution(n, k, l)\r\n\t\tif __name__ ==\"__main__\":\r\n\t\t\tread()\r\n\texcept EOFError:\r\n\t\tbreak", "n,k,l=list(map(int,input().split()))\r\na=sorted(list(map(int,input().split())))\r\ni=1\r\nm=k*n\r\nif(a[n-1]-a[0]>l):\r\n print(0)\r\nelse:\r\n while(i<m and a[i]<=a[0]+l):\r\n i+=1\r\n if(i==m or m-i+1<k):\r\n ans=0\r\n for j in range(0,m,k):\r\n ans+=a[j]\r\n print(ans)\r\n else:\r\n usables=m-i-k+1\r\n ind=i-1\r\n ans=0\r\n while(ind>=0):\r\n ans+=a[ind]\r\n if(usables>=k-1):\r\n usables-=k-1\r\n ind-=1\r\n elif(usables>0):\r\n ind-=(k-usables)\r\n usables=0\r\n else:\r\n ind-=k\r\n print(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\na0 = a[0]\r\nif a[n - 1] - a0 > l:\r\n ans = 0\r\n print(ans)\r\n exit()\r\nb, c = [], []\r\ns = set()\r\nfor i in range(n):\r\n b.append(a[k * i])\r\n c.append(k * i)\r\n s.add(k * i)\r\nans = sum(b)\r\nj = n * k - 1\r\nwhile b[-1] - a0 > l:\r\n ans -= b.pop()\r\n s.remove(c.pop())\r\n while True:\r\n if a[j] - a0 <= l and not j in s:\r\n ans += a[j]\r\n s.add(j)\r\n break\r\n j -= 1\r\nprint(ans)", "from bisect import bisect_left, bisect_right\r\n\r\ndef tuple_input(type):\r\n return map(type, input().strip().split())\r\n\r\nn, k, l = tuple_input(int)\r\na = list(tuple_input(int))\r\na.sort()\r\n\r\nif a[n - 1] - a[0] > l:\r\n print('0')\r\n exit(0)\r\n\r\nres = 0\r\nlef = 0\r\nrem = n\r\nwhile rem > 0:\r\n res += a[lef]\r\n x = 0\r\n while x < k and a[lef + x + rem - 1] <= l + a[0]:\r\n x += 1\r\n lef += x\r\n rem -= 1\r\nprint(res)\r\n \r\n\r\n ", "n, k, l = map(int, input().split())\r\nm = n * k\r\narr = list(map(int, input().split()))\r\narr.sort(reverse=True)\r\n#print(arr)\r\nmin_elem = arr[m - 1]\r\nr = min_elem + l\r\n#print(\"m =\", m, \"r =\", r, arr[m - n])\r\nif arr[m - n] > r:\r\n #print(\"печаль\")\r\n print(\"0\")\r\n exit()\r\nvolume = 0\r\nif k == 1:\r\n for i in range(m):\r\n volume = volume + arr[i]\r\n print(volume)\r\n exit()\r\n########\r\n\r\nindex = 0\r\nwhile arr[index] > r:\r\n index += 1\r\nvolume = 0\r\n#print(index)\r\nq = index // (k - 1)\r\nw = index % (k - 1)\r\nwhile q != 0:\r\n volume = volume + arr[index]\r\n q -= 1\r\n index += 1\r\nw = k - 1 - w\r\nindex += w\r\nwhile index < m:\r\n volume = volume + arr[index]\r\n index += k\r\n\r\n#print(index)\r\nprint(volume)\r\n", "getInputList = lambda : list(input().split())\ngetInputIntList = lambda : list(map(int,input().split()))\n\nn , k , l = getInputIntList()\narr = getInputIntList()\n\narr.sort()\nfirst = arr[0]\nfor i in range(len(arr)):\n\tif arr[i] - first > l:\n\t\tbreak \nelse:\n\ti += 1\nif i < n:\n\tprint(0)\nelse:\n\tarr1 = arr[0:i]\n\tarr2 = arr[i:]\n\tans = 0\n\tfor i in range(n):\n\t\tfor j in range(k-1):\n\t\t\tif len(arr2) > 0:\n\t\t\t\tarr2.pop()\n\t\t\telse:\n\t\t\t\tarr1.pop()\n\t\tans += arr1.pop()\n\tprint(ans)\n", "n,k,L=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\ns=0\r\nv=n-1\r\np=0\r\nye=True\r\nfor i in range(len(l)-1,-1,-1) :\r\n if abs(l[0]-l[i])>L :\r\n p+=1\r\n else :\r\n if p>=k-1 and p>0 :\r\n p-=k-1\r\n s+=l[i]\r\n else :\r\n v=i\r\n ye=False\r\n break\r\nif ye :\r\n if p==0 :\r\n print(s)\r\n else :\r\n print(0)\r\n exit()\r\nfor i in range(0,v+1,k) :\r\n s+=l[i]\r\nprint(s)\r\n\r\n \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 Counter\r\n\r\nN,K,L = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nB = []\r\n\r\nwhile len(A)>N and A[-1]>A[0]+L:\r\n B.append(A.pop())\r\n \r\nif A[-1]>A[0]+L:\r\n exit(print(0))\r\n\r\n# print(A)\r\n# print(B)\r\nans = 0\r\nwhile A:\r\n cnt = 0\r\n while B and cnt<K-1:\r\n B.pop()\r\n cnt+=1\r\n tmp = float('inf')\r\n while cnt<K and A:\r\n tmp = min(tmp, A.pop())\r\n cnt+=1\r\n #print(A,B,tmp)\r\n ans+=tmp\r\nprint(ans)\r\n\r\n", "n, k, l = map(int, input().split())\r\na = [0] + list(map(int, input().split()))\r\na.sort()\r\n\r\nc = 0\r\nfor i in range(1, len(a)):\r\n if a[i]-a[1] <= l:\r\n c += 1\r\n \r\nif c< n:\r\n print(0)\r\nelse:\r\n vi = [1]\r\n for i in range(n-1, 0, -1):\r\n t = vi[-1]+k\r\n if t>=c-i+1:\r\n for j in range(c-i+1, c+1):\r\n vi.append(j)\r\n break\r\n else:\r\n vi.append(t)\r\n \r\n ans = 0\r\n for it in vi:\r\n ans += a[it]\r\n print(ans)\r\n\r\n ", "def doit(n, k, l, a):\r\n m = n * k\r\n a.sort()\r\n hen = 0\r\n tai = m\r\n while ((hen < m) and (a[hen] <= a[0] + l)):\r\n hen += 1\r\n if (hen < n):\r\n return 0\r\n for i in range(n):\r\n tai -= k\r\n if (hen > tai):\r\n break\r\n hen -= 1\r\n a[hen], a[tai] = a[tai], a[hen]\r\n temp = 0\r\n for i in range(n):\r\n temp += a[i * k]\r\n return temp\r\n \r\nn, k, l = input().split()\r\na = input().split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nprint(doit(int(n), int(k), int(l), a))\r\n", "from sys import stdin, stdout\r\nnmbr = lambda: int(input())\r\nlst = lambda: list(map(int, input().split()))\r\nPI=float('inf')\r\nfor _ in range(1):#nmbr()):\r\n boxes, each, lim=lst()\r\n a=sorted(lst())\r\n n=len(a)\r\n ans=0\r\n # print(a)\r\n if boxes==1:\r\n print(a[0])\r\n continue\r\n p=n-each\r\n pos=n-1\r\n f=1\r\n # print(a)\r\n while p>0:\r\n if a[p]-a[0]>lim:\r\n while pos>0 and (a[pos]-a[0])>lim:pos-=1\r\n if pos==0:\r\n f=0\r\n break\r\n a[pos], a[p]=a[p], a[pos]\r\n p-=each\r\n # print(a)\r\n for i in range(0,n, each):\r\n mn=min(a[i:i+each])\r\n if mn-a[0]>lim:\r\n f=0\r\n break\r\n ans+=mn\r\n print(ans if f else 0)", "import sys,bisect\r\n\r\n\r\nn,k,l=list(map(int,input().split()))\r\n\r\na=list(map(int,input().split()))\r\na.sort()\r\nmax1=a[0]+l\r\nloc1=bisect.bisect_right(a,max1)-1\r\nif(loc1+1<n):\r\n print(0)\r\n sys.exit()\r\nused=[False for i in range(n*k)]\r\nsum1=0\r\ncnt=0\r\nfor i in range(0,loc1+1,k):\r\n used[i]=True\r\n sum1+=a[i]\r\n cnt+=1\r\nwhile(cnt<n):\r\n if(not used[loc1]):\r\n sum1+=a[loc1]\r\n cnt+=1\r\n loc1-=1\r\nprint(sum1)\r\n\r\n\r\n", "n, k, l = map(int, input().split())\r\na = [0]\r\na += list(map(int, input().split())) \r\na.sort() \r\n\r\nmb = []\r\nans = 0\r\nlast = 1\r\n\r\nfor i in range(2, n * k + 1):\r\n if a[i] - a[1] <= l:\r\n last = i\r\n\r\nif last < n:\r\n print(0)\r\nelse:\r\n t = (n - 1) * k + 1\r\n for i in range(last, last - (n - 1), -1):\r\n ans += a[min(i, t)]\r\n t -= k\r\n ans += a[1]\r\n print(ans)# 1698068168.8804967", "from bisect import* \nR=lambda:map(int,input().split())\nn,k,l=R()\na=sorted(R())\ni=bisect_right(a,a[0]+l)\nif i<n:print(0)\nelse:\n s=sum(a[0:i:k]);n-=(i-1)//k+1\n while n:\n i-=1\n if i%k:\n s+=a[i];n-=1\n print(s)", "n,k,l=input().split()\r\nn=int(n)\r\nk=int(k)\r\nl=int(l)\r\na=[0]*(n*k)\r\na=input().split()\r\nfor i in range (n*k):\r\n a[i]=int(a[i])\r\na.sort()\r\nwrong=0\r\nans=0\r\nfor i in range(n*k-1,-1,-1):\r\n wrong+=1\r\n if a[i]-a[0]<=l and wrong>=k:\r\n ans+=a[i]\r\n wrong-=k\r\nif wrong>0:\r\n print(0)\r\nelse:\r\n print(ans)\r\n", "n, m, k = map(int, input().split())\r\nx = sorted(map(int, input().split()))\r\n\r\nbase = x[0]\r\nto = 0\r\nwhile to + 1 < n * m and x[to + 1] - base <= k:\r\n\tto += 1\r\nif to + 1 < n:\r\n\tprint(0), exit()\r\n\r\ncnt = 0\r\nans = 0\r\nwhile n - 1 - cnt + cnt * m < to:\r\n\tans += x[cnt * m]\r\n\tcnt += 1\r\nfor i in range(to , -1 , -1):\r\n\tif cnt < n:\r\n\t\tcnt += 1\r\n\t\tans += x[i]\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\nans = 0\r\nc = 0\r\nfor i in range(n * k - 1, -1, -1 ):\r\n c += 1\r\n if(a[i] - a[0] <= l and c >= k):\r\n ans += a[i]\r\n c -= k\r\nprint((ans, 0)[c > 0])\r\n", "n,k,l=map(int,input().split())\r\na=sorted(list(map(int,input().split())))\r\nindex = 0\r\nfor i in a:\r\n if i > a[0] + l:\r\n break\r\n index += 1\r\nok = index - n\r\n# print(index)\r\n\r\nif index<n:\r\n print(0)\r\nelse:\r\n ans=0\r\n cur=0\r\n cnt=0\r\n while((index-cur)>(n-cnt)):\r\n ans+=a[cur]\r\n cur+=k\r\n cnt+=1\r\n for i in range(n-cnt):\r\n ans+=a[index-1]\r\n index-=1\r\n print(ans)", "from bisect import bisect\n\n\ndef main():\n n, k, d = map(int, input().split())\n l = sorted(map(int, input().split()))\n if l[0] + d < l[n - 1]:\n print(0)\n return\n i = bisect(l, l[0] + d)\n a = 0 if k == 1 else (n * k - i) // (k - 1)\n print(sum(l[:i - a:k]) + sum(l[i - a:i]))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport bisect\r\ninput = sys.stdin.readline\r\n\r\ndef solve(n, k, l, a):\r\n a.sort()\r\n ind = bisect.bisect_right(a, a[0] + l)\r\n if ind < n:\r\n return 0\r\n v = 0\r\n for i in range(n):\r\n v += a[min(ind - 1 - i, (n - i - 1) * k)]\r\n return v\r\n\r\n\r\nn, k, l = [int(x) for x in input().split(' ')]\r\na = [int(x) for x in input().split(' ')]\r\nprint(solve(n, k, l, a))", "n, k, l = map(int, input().split())\r\na = sorted(map(int, input().split()))\r\n\r\npossible_smallest = sum(1 for value in a if value <= a[0]+l)\r\n\r\nindexes_of_minimal_planks = [i*k for i in range(n)]\r\nfor i in range(n)[::-1]:\r\n if i == n-1:\r\n indexes_of_minimal_planks[i] = min(indexes_of_minimal_planks[i], possible_smallest-1)\r\n else:\r\n indexes_of_minimal_planks[i] = min(indexes_of_minimal_planks[i], indexes_of_minimal_planks[i+1]-1)\r\n\r\nresult = 0\r\nfor idx in indexes_of_minimal_planks:\r\n if idx < 0:\r\n result = 0\r\n break\r\n result += a[idx]\r\n\r\nprint(result)", "from bisect import bisect_right\n\n\ndef main():\n n, k, l = map(int, input().split())\n a = [int(x) for x in input().split()]\n a = sorted(a)\n\n m = bisect_right(a, a[0]+l)\n if m < n:\n print(0)\n return\n\n group = 0\n i = 0\n volume = 0\n while 0 < n - group <= m - i:\n volume += a[i]\n group += 1\n i += k\n if group < n:\n volume += sum(a[m-(n - group):m])\n\n print(volume)\n return\n\n\nif __name__ == '__main__':\n main()\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\n\nN,M,K = map(int,input().split())\nA = sorted(list(map(int,input().split())))\nl,r = [],[]\nnum = min(A)+K\nfor x in range(N*M):\n if A[x]<=num:\n l.append(A[x])\n else:\n r.append(A[x])\nl = l\nansi = 0\nans = []\nnum = len(r)\nfor _ in range(N):\n numi = 1\n if l==[]:\n ansi=0\n break\n k = [l.pop()]\n for _ in range(M-1):\n if num==0:break\n k.append(r.pop())\n numi+=1\n num-=1\n\n for _ in range(M-numi):\n k.append(l.pop())\n ansi += min(k)\nprint(ansi)\n", "n , k , l = map(int, input().split())\r\nstaves = list(map(int, input().split()))\r\nstaves.sort()\r\nmn = staves[0]\r\ndiffStavesMin = []\r\nremaing = []\r\nfor i in staves:\r\n if i<=mn+l:\r\n diffStavesMin.append(i)\r\n else:\r\n remaing.append(i)\r\nif len(diffStavesMin)<n:\r\n print(0)\r\nelse:\r\n ans = 0\r\n curr = 0\r\n for i in range(n):\r\n ans += diffStavesMin[curr]\r\n curr = min(curr+k,len(diffStavesMin)-(n-i-1))\r\n print(ans)\r\n", "R = lambda:map(int,input().split())\r\nn, k, l = R()\r\na = sorted(R())\r\ns = c = 0\r\nfor i in range(n*k-1, -1, -1):\r\n c += 1\r\n if a[i]-a[0] <= l and c>=k:\r\n s += a[i]\r\n c -= k\r\nprint((s,0)[c>0])", "n,k,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx=0\r\nwhile x<n*k-1 and a[x+1]-a[0]<=l:x+=1\r\nif x+1<n:print(0);exit()\r\no=i=0\r\nu=x-n+1\r\nwhile i<=x:\r\n o+=a[i]\r\n u+=1\r\n i=min(i+k,u)\r\nprint(o)\r\n", "R=lambda:map(int,input().split())\r\nn,k,l=R()\r\na=sorted(R())\r\ns=c=0\r\nfor i in range(n*k-1,-1,-1):\r\n c+=1\r\n if a[i]-a[0]<=l and c>=k:\r\n s+=a[i];c-=k\r\nprint((s,0)[c>0])\r\n", "from math import *\r\nimport random, sys\r\n\r\ndef nextInt():\r\n\treturn int(input())\r\ndef nextStrs():\r\n\treturn input().split()\r\ndef nextInts():\r\n\treturn list(map(int,nextStrs()))\r\n\r\ndef main():\r\n n,k,l = nextInts()\r\n\r\n arr = nextInts()\r\n\r\n arr.sort(); lst = 0\r\n for i in range(len(arr)):\r\n if arr[i]-arr[0] <= l:\r\n lst+=1\r\n else: break\r\n\r\n if lst < n:\r\n print(0)\r\n else:\r\n res = 0; cur = 0\r\n for i in range(n):\r\n need = n-i-1\r\n res += arr[cur]\r\n cur = min(lst-need,cur+k)\r\n\r\n print(res)\r\n\r\nif __name__ == \"__main__\":\r\n exit(main())", "n, k, l = [int(i) for i in input().split()]\r\n\r\narr = sorted([int(i) for i in input().split()])\r\n\r\nma = n*k-1\r\nfor i in range(n*k):\r\n\tif arr[0] + l < arr[i]:\r\n\t\tma = i - 1\r\n\t\tbreak\r\n\r\n#print(arr)\r\n#print(ma)\r\nif ma < n-1:\r\n\tprint(0)\r\n\texit()\r\n\r\nans = 0\r\nfor i in range(0, ma + 1, k):\r\n\tans += arr[i]\r\n\tn-=1\r\n\tarr[i] = 0\r\n\tif (n == 0):\r\n\t\tbreak\r\n\r\nfor i in range(ma, -1, -1):\r\n\tif n == 0:\r\n\t\tbreak\r\n\tif arr[i] == 0:\r\n\t\tcontinue\r\n\tn -= 1\r\n\tans += arr[i]\r\n\r\nprint(ans)", "\r\nfrom bisect import bisect_right as right\r\nn,k,l=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nx = right(a, a[0]+l)\r\nif x<n:\r\n print(0)\r\nelse:\r\n\tans = 0\r\n\ti = 0\r\n\twhile n > 0:\r\n\t ans += a[i]\r\n\t i = min(i+k, x-n+1)\r\n\t n -= 1\r\n\tprint(ans)", "n, k, l = list(map(int, input().split()))\r\na = sorted(list(map(int, input().split(' '))))\r\nindex = 0\r\nfor i in a:\r\n if i > a[0] + l:\r\n break\r\n index += 1\r\nok = index - n\r\nif ok < 0:\r\n print(0)\r\nelse:\r\n ans = 0\r\n cur = 0\r\n for i in range(n):\r\n ans += a[cur]\r\n use = min(k-1, ok)\r\n ok -= use\r\n cur += 1 + use\r\n print(ans)", "#!/usr/bin/python3\r\n\r\nfrom sys import stdin\r\nfrom bisect import bisect_right\r\n\r\n\r\ndef main():\r\n n, k, l = [int(x) for x in stdin.readline().split()]\r\n a = sorted(int(x) for x in stdin.readline().split())\r\n cnt = bisect_right(a, a[0] + l)\r\n if cnt < n:\r\n print(0)\r\n return\r\n ans, cur, cntn = 0, 0, 0\r\n while cntn < n:\r\n ans += a[cur]\r\n cntn += 1\r\n cur += 1\r\n rem = cnt - cur\r\n rem1 = n - cntn\r\n cur += min(k - 1, rem - rem1)\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n\tn,k,l=map(int,input().split())\r\n\ta=sorted(list(map(int,input().split())))\r\n\r\n\tif a[n-1]-a[0]>l:\r\n\t\tprint(0)\r\n\t\treturn\r\n\tres=a[0]\r\n\tfor i in range(1,n):\r\n\t\tpos=k*i\r\n\t\tif a[pos]-a[0]<=l:\r\n\t\t\tres+=a[pos]\r\n\t\telse:\r\n\t\t\tfor j in range(pos-1,-1,-1):\r\n\t\t\t\tif a[j]-a[0]<=l:\r\n\t\t\t\t\tfor m in range(j,-1,-1):\r\n\t\t\t\t\t\tif m%k!=0:\r\n\t\t\t\t\t\t\tres+=a[m]\r\n\t\t\t\t\t\t\ti+=1\r\n\t\t\t\t\t\t\tif i==n:\r\n\t\t\t\t\t\t\t\tbreak\r\n\t\t\t\t\tbreak\r\n\t\t\tbreak\r\n\tprint(res)\r\n\r\nmain()", "[n,k,l] = [int(x) for x in input().split()]\r\na = [int(x) for x in input().split()]\r\nimport bisect\r\ns = 0\r\na = sorted(a)\r\nb = bisect.bisect_right(a,a[0]+l)\r\na1 = a[:b]\r\ntot = n * k\r\nav = tot - b\r\nif b >= n:\r\n for i in range(b-1,b-n-1,-1):\r\n m = a1.pop()\r\n for j in range(0,k-1):\r\n if av > 0:\r\n av = av - 1\r\n else:\r\n m = a1.pop()\r\n s = s + m\r\n print(s)\r\nelse:\r\n print(0)", "#coding on smartphone\r\nn, k, l = map(int, input().split())\r\nli = list(map(int, input().split()))\r\nli.sort()\r\n\r\nif li[n-1] - li[0] > l:\r\n\tprint(0)\r\n\tquit()\r\n\r\nret = 0\r\nres = 0\r\n\r\nfor i in range(n*k-1, -1, -1):\r\n\tres += 1\r\n\tif li[i] - li[0] <= l and res >= k:\r\n\t\tret += li[i]\r\n\t\tres -= k\r\n\t\t\r\nprint(ret)", "R = lambda: map(int, input().split())\r\n\r\nn, k, l = R()\r\na = list(R())\r\na.sort()\r\n\r\n\r\ndef func():\r\n if n == 1: return a[0]\r\n\r\n r = (n-1)*k\r\n while a[r] - a[0] > l: r -= 1\r\n # dbvar(r)\r\n if r < n - 1: return 0\r\n\r\n res = a[0] + a[r]\r\n\r\n for i in range(n - 2, 0, -1):\r\n if i*k >= r - 1:\r\n res += a[r-1]\r\n r -= 1\r\n else:\r\n res += a[i*k]\r\n\r\n return res\r\n\r\nprint(func())\r\n", "n, k, l = map(int, input().split())\r\na = sorted(list(map(int, input().split())))\r\n\r\np = 0\r\nwhile p < len(a) and a[p] - a[0] <= l:\r\n p += 1\r\n\r\nif p < n:\r\n print(0)\r\n exit()\r\n\r\nans = 0\r\nu = 0\r\nfor i in range(n):\r\n ans += a[u]\r\n if u + k >= p - (n - i - 1):\r\n u = p - (n - i - 1)\r\n else:\r\n u += k\r\nprint(ans)", "n, k, l = map(int, input().split())\r\nL = sorted(map(int, input().split()))\r\na = []\r\nfor i in L:\r\n if i <= L[0] + l:\r\n a.append(i)\r\nl1 = len(a)\r\nif l1 < n:\r\n print(0)\r\nelif l1 == n:\r\n print(sum(a))\r\nelse:\r\n s = 0\r\n i = 0\r\n while i < l1:\r\n s += a[i]\r\n n -= 1\r\n i = max(min(i + k, l1 - n), i + 1)\r\n print(s)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k, l = map(int, input().split())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nfor i in range(n*k-k, n-2, -1):\r\n if a[i]-a[0]<=l:\r\n mark = i\r\n break\r\nelse:\r\n print(0)\r\n exit()\r\n\r\nans = a[mark]\r\ncnt = (n-1)*k-mark\r\n\r\nfor i in range(mark-1, -1, -1):\r\n cnt += 1\r\n \r\n if cnt>=k:\r\n ans += a[i]\r\n cnt -= k\r\n\r\nprint(ans)", "def binS(f,l,arr,val):\r\n\tmid = int((f+l)/2)\r\n\tif(mid+1 < len(arr)):\r\n\t\tif(val < arr[mid+1] and val >= arr[mid]):\r\n\t\t\treturn mid\r\n\t\telif(val >= arr[mid]):\r\n\t\t\tf = mid+1\r\n\t\t\treturn binS(f,l,arr,val)\r\n\t\telif(val < arr[mid]):\r\n\t\t\tl = mid - 1\r\n\t\t\treturn binS(f,l,arr,val)\r\n\telse:\r\n\t\treturn mid\r\n\r\n\r\nn,m,l = input().split()\r\nn = int(n)\r\nm = int(m)\r\nl = int(l)\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nans = 0\r\n\r\npos = binS(0,len(arr),arr,arr[0]+l)\r\n# print(arr)\r\n# print(pos)\r\nif(pos+1 <n):\r\n\tprint(0)\r\nelse:\r\n\tfor i in range(0,pos+1,m):\r\n\t\tif(n == 0):\r\n\t\t\tbreak\r\n\t\tans += arr[i]\r\n\t\tn-=1\r\n\t\t\r\n\t# print(n)\r\n\tfor i in reversed(range(0,pos+1)):\r\n\t\tif(n == 0):\r\n\t\t\tbreak\r\n\t\tif(i%m != 0):\r\n\t\t\tans += arr[i]\r\n\t\t\tn -= 1\r\n\t# print(\"----\",n)\r\n\tfor i in range(pos+1,n*m):\r\n\t\tif(n == 0 ):\r\n\t\t\tbreak\r\n\t\tans += arr[i]\r\n\t\tn-=1\r\n\tprint(ans)\r\n\r\n\t\t\r\n\r\n" ]

[ "from bisect import *\r\n\r\ns = [0]\r\nq = int(input())\r\nfor i in map(int, input().split()):\r\n if i > s[-1]:\r\n s.append(i)\r\n else:\r\n s[bisect_right(s, i)] = i\r\nprint(len(s) - 1)\r\n", "# Python program to find\r\n# length of longest\r\n# increasing subsequence\r\n# in O(n Log n) time\r\n\r\n# Binary search (note\r\n# boundaries in the caller)\r\n# A[] is ceilIndex\r\n# in the caller\r\ndef CeilIndex(A, l, r, key):\r\n\r\n\twhile (r - l > 1):\r\n\t\r\n\t\tm = l + (r - l)//2\r\n\t\tif (A[m] >= key):\r\n\t\t\tr = m\r\n\t\telse:\r\n\t\t\tl = m\r\n\treturn r\r\n\r\ndef LongestIncreasingSubsequenceLength(A, size):\r\n\r\n\t# Add boundary case,\r\n\t# when array size is one\r\n\r\n\ttailTable = [0 for i in range(size + 1)]\r\n\tlen = 0 # always points empty slot\r\n\r\n\ttailTable[0] = A[0]\r\n\tlen = 1\r\n\tfor i in range(1, size):\r\n\t\r\n\t\tif (A[i] < tailTable[0]):\r\n\r\n\t\t\t# new smallest value\r\n\t\t\ttailTable[0] = A[i]\r\n\r\n\t\telif (A[i] > tailTable[len-1]):\r\n\r\n\t\t\t# A[i] wants to extend\r\n\t\t\t# largest subsequence\r\n\t\t\ttailTable[len] = A[i]\r\n\t\t\tlen+= 1\r\n\r\n\t\telse:\r\n\t\t\t# A[i] wants to be current\r\n\t\t\t# end candidate of an existing\r\n\t\t\t# subsequence. It will replace\r\n\t\t\t# ceil value in tailTable\r\n\t\t\ttailTable[CeilIndex(tailTable, -1, len-1, A[i])] = A[i]\r\n\t\t\r\n\r\n\treturn len\r\n\r\n\r\n# Driver program to\r\n# test above function\r\nn = int(input())\r\nA = list(map(int , input().split()))\r\n\r\nprint(LongestIncreasingSubsequenceLength(A, n))\r\n\r\n# This code is contributed\r\n# by Anant Agarwal.\r\n", "import bisect\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nINF=10**18\r\ndp=[INF]*n\r\nfor i in range(n):\r\n dp[bisect.bisect_left(dp,a[i])]=a[i]\r\nprint(bisect.bisect_left(dp,INF))", "import bisect\r\n\r\ndef LIS(lst,weakly=False,max_value=float('inf')):\r\n f=bisect.bisect_right if weakly else bisect.bisect_left\r\n N=len(lst)\r\n update=[None]*N\r\n dp=[max_value]*N\r\n for k,x in enumerate(lst):\r\n i=f(dp,x)\r\n dp[i]=x\r\n update[k]=(i,dp[i])\r\n n=bisect.bisect_left(dp,max_value)\r\n lis=[None]*n\r\n n-=1\r\n for i,x in update[::-1]:\r\n if i==n:\r\n lis[n]=x\r\n n-=1\r\n return lis\r\n\r\nN=int(input())\r\nA=list(map(int,input().split()))\r\nans=len(LIS(A))\r\nprint(ans)", "import math, collections\r\n\r\nclass FenwikTree:\r\n def getMax(arr, i):\r\n i += 1\r\n ans = 0\r\n\r\n while i > 0:\r\n ans = max(ans, arr[i])\r\n i -= i & -i\r\n \r\n return ans\r\n \r\n def update(arr, i, val):\r\n i += 1\r\n while i < len(arr):\r\n arr[i] = max(arr[i], val)\r\n i += i & -i\r\n\r\ndef sol(arr, n):\r\n\r\n compress = {val: i+1 for i, val in enumerate(sorted(set(arr)))}\r\n\r\n fenwik = [0] * (max(compress) + 1)\r\n for num in arr:\r\n longestSubsequence = FenwikTree.getMax(fenwik, compress[num]-2)\r\n FenwikTree.update(fenwik, compress[num]-1, longestSubsequence + 1)\r\n print(FenwikTree.getMax(fenwik, len(fenwik)-2))\r\n \r\n \r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n sol(arr, n)\r\n", "def lis(a):\r\n b = []\r\n for c in a:\r\n # if len(b) == 0 or c > b[-1]\r\n if len(b) == 0 or c > b[-1]:\r\n b.append(c)\r\n else:\r\n l = 0\r\n r = len(b)\r\n while l < r-1:\r\n m = l+r>>1\r\n # if b[m] <= c: l = m\r\n if b[m] < c: l = m\r\n else: r = m\r\n # if b[l] <= c: l += 1\r\n if b[l] < c: l += 1\r\n b[l] = c\r\n \r\n return len(b)\r\n \r\n\r\nn = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nprint(lis(a))\r\n", "v = []\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\nfor i in range(n):\r\n if not v or v[-1] < x[i]:\r\n v.append(x[i])\r\n else:\r\n v_l= [val for val in v if val >= x[i]]\r\n if v_l:\r\n v[v.index(min(v_l))] = x[i]\r\nprint(len(v))# 1698189489.1415057", "import math, collections\r\n\r\nclass FenwikTree:\r\n def getMax(arr, i):\r\n ans = 0\r\n while i > 0:\r\n ans = max(ans, arr[i])\r\n i -= i & -i\r\n \r\n return ans\r\n \r\n def update(arr, i, val):\r\n while i < len(arr):\r\n arr[i] = max(arr[i], val)\r\n i += i & -i\r\n\r\ndef sol(arr):\r\n\r\n # logic: If there are 2 idx i & j (i < j), then there will be edge between i & j\r\n # only if arr[i] > arr[j]. As in bubble sort, larger element will have to swap with smaller element\r\n # in front of it to each its correct pos.\r\n # Those who dont swap, will form a independent set\r\n #\r\n # So, the ques has now become to find longest increasing subsequence in the arr.\r\n #\r\n # We will be usinng fenwik tree to find it (nlogn)\r\n\r\n\r\n # compressing the array to make it 1 based\r\n compress = {val: i+1 for i, val in enumerate(sorted(set(arr)))}\r\n\r\n # fenwik tree (1 indexed)\r\n fenwik = [0] * (max(compress) + 1)\r\n\r\n # in fenwik tree, getMax(fenwik, i) will return len of LIS whose last element is <= i\r\n # and update(fenwik, i, val) will update the len of LIS whose last element is i \r\n #\r\n # So for each num, we will get len of LIS (with last element < num) so far \r\n # and use it to update LIS till curr num\r\n for num in arr:\r\n longestSubsequence = FenwikTree.getMax(fenwik, compress[num]-1)\r\n FenwikTree.update(fenwik, compress[num], longestSubsequence + 1)\r\n\r\n print(FenwikTree.getMax(fenwik, len(fenwik)-1))\r\n \r\n \r\nt = 1\r\nfor _ in range(t):\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n sol(arr)\r\n", "import sys\ninput = sys.stdin.readline\nI = lambda : list(map(int,input().split()))\n\ndef CeilIndex(A, l, r, key): \n while (r - l > 1): \n \n m = l + (r - l)//2\n if (A[m] >= key): \n r = m \n else: \n l = m \n return r \n \ndef lis(A, size): \n tailTable = [0 for i in range(size + 1)] \n len = 0 # always points empty slot \n \n tailTable[0] = A[0] \n len = 1\n for i in range(1, size): \n \n if (A[i] < tailTable[0]): \n tailTable[0] = A[i] \n \n elif (A[i] > tailTable[len-1]): \n tailTable[len] = A[i] \n len+= 1\n \n else: \n tailTable[CeilIndex(tailTable, -1, len-1, A[i])] = A[i] \n return len\n\n\nn,=I()\np=I()\nan=1\nprint(lis(p,n))\n", "n = int(input())\r\na= list(map(int,input().split()))\r\nbit = [0]*(n+1)\r\ndef update(idx,val):\r\n while idx<=n:\r\n bit[idx] = max(bit[idx],val)\r\n idx+=idx&(-idx)\r\ndef query(idx):\r\n res =0\r\n while idx>0:\r\n res = max(res,bit[idx])\r\n idx-=idx&(-idx)\r\n return res\r\nb = []\r\nfor i in range(n):\r\n b.append([a[i],-(i+1)])\r\nb.sort()\r\nfor i in range(n):\r\n qe = query(-b[i][1])\r\n update(-b[i][1],qe+1)\r\nprint(query(n))", "from bisect import bisect_left, bisect_right, insort\r\nR = lambda: map(int, input().split())\r\nn, arr = int(input()), list(R())\r\ndp = []\r\nfor i in range(n):\r\n idx = bisect_left(dp, arr[i])\r\n if idx >= len(dp):\r\n dp.append(arr[i])\r\n else:\r\n dp[idx] = arr[i]\r\nprint(len(dp))", "from sys import stdin\r\n\r\ninput = stdin.readline\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 =max(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] = max(value,self.tree[i])\r\n i += (i & (-i))\r\ndef f(a):\r\n newind=0\r\n maxs=0\r\n ans=0\r\n ft=BIT(2*(10**5)+5)\r\n for i in a:\r\n maxs=ft.sum(i-1)\r\n # print(maxs,i)\r\n ft.update(i,maxs+1)\r\n ans=max(ans,maxs+1)\r\n # print(ft.tree)\r\n\r\n return ans\r\n\r\na=input()\r\nl=list(map(int,input().strip().split()))\r\nprint(f(l))", "from bisect import bisect\r\n\r\nn = int(input())\r\na = [10**10] * n\r\narr = map(int, input().split())\r\nfor i in arr:\r\n a[bisect(a, i)] = i\r\nprint(bisect(a, 10**10 - 1))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom bisect import *\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nans = [A[0]]\r\nfor a in A[1:]:\r\n if a>ans[-1]:\r\n ans.append(a)\r\n else:\r\n idx = bisect_left(ans, a)\r\n ans[idx] = a\r\nprint(len(ans))\r\n", "from bisect import bisect_right\r\ndef answer(n,A):\r\n ans=[A[0]]\r\n for i in range(1,n):\r\n if ans[-1]<A[i]:\r\n ans.append(A[i])\r\n else:\r\n index=bisect_right(ans,A[i])\r\n ans[index]=A[i]\r\n \r\n return len(ans)\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(answer(n,arr))", "\"\"\" Python 3 compatibility tools. \"\"\"\r\nfrom __future__ import division, print_function\r\nimport itertools\r\nimport sys\r\nimport os\r\nfrom io import BytesIO, IOBase\r\n\r\n\r\nif sys.version_info[0] < 3:\r\n input = raw_input\r\n range = xrange\r\n\r\n filter = itertools.ifilter\r\n map = itertools.imap\r\n zip = itertools.izip\r\n\r\n\r\ndef is_it_local():\r\n script_dir = str(os.getcwd()).split('/')\r\n username = \"dipta007\"\r\n return username in script_dir\r\n\r\n\r\ndef READ(fileName):\r\n if is_it_local():\r\n sys.stdin = open(f'./{fileName}', 'r')\r\n\r\n# region fastio\r\nBUFSIZE = 8192\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\nif not is_it_local():\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# endregion\r\n\r\n\r\ndef input1(type=int):\r\n return type(input())\r\n\r\n\r\ndef input2(type=int):\r\n [a, b] = list(map(type, input().split()))\r\n return a, b\r\n\r\n\r\ndef input3(type=int):\r\n [a, b, c] = list(map(type, input().split()))\r\n return a, b, c\r\n\r\n\r\ndef input_array(type=int):\r\n return list(map(type, input().split()))\r\n\r\n\r\ndef input_string():\r\n s = input()\r\n return list(s)\r\n\r\n##############################################################\r\n\r\n#Given a list of numbers of length n, this routine extracts a\r\n#longest increasing subsequence.\r\n#\r\n#Running time: O(n log n)\r\n#\r\n# INPUT: a vector of integers\r\n# OUTPUT: a vector containing the longest increasing subsequence\r\n\r\ndef lower_bound(nums, target):\r\n l, r = 0, len(nums) - 1\r\n res = len(nums)\r\n while l <= r:\r\n mid = int(l + (r - l) / 2)\r\n if nums[mid] >= target:\r\n res = mid\r\n r = mid - 1\r\n else:\r\n l = mid + 1\r\n return res\r\n \r\n \r\ndef upper_bound(nums, target):\r\n l, r = 0, len(nums) - 1\r\n res = len(nums)\r\n while l <= r:\r\n mid = int(l + (r - l) / 2)\r\n if nums[mid] > target:\r\n r = mid - 1\r\n res = mid\r\n else:\r\n l = mid + 1\r\n return res\r\n\r\ndef LIS(v, STRICTLY_INCREASING = False):\r\n best = []\r\n dad = [-1 for _ in range(len(v))]\r\n\r\n for i in range(len(v)):\r\n if STRICTLY_INCREASING:\r\n item = (v[i], 0)\r\n pos = lower_bound(best, item)\r\n item.second = i\r\n else:\r\n item = (v[i], i)\r\n pos = upper_bound(best, item)\r\n\r\n if pos == len(best):\r\n dad[i] = -1 if len(best) == 0 else best[-1][1]\r\n best.append(item)\r\n else:\r\n dad[i] = -1 if pos == 0 else best[pos-1][1]\r\n best[pos] = item\r\n # print(pos, best)\r\n\r\n # ret = []\r\n i = best[-1][1]\r\n cnt = 0\r\n while i >= 0:\r\n # ret.append(v[i])\r\n cnt += 1\r\n i = dad[i]\r\n\r\n # ret.reverse()\r\n return cnt\r\n\r\ndef main():\r\n n = input1()\r\n v = input_array()\r\n print(LIS(v))\r\n pass\r\n\r\nif __name__ == '__main__':\r\n READ('in.txt')\r\n main()", "\"\"\"\r\nhttp://codeforces.com/problemset/problem/341/B\r\n\"\"\"\r\n\r\nfrom typing import List\r\nfrom bisect import bisect_right\r\n\r\n\r\nclass Solution:\r\n def patienceSort(self, a: List[int]) -> int:\r\n # patience sort can find longest increasing subsequence in O(NlogN)\r\n # https://en.wikipedia.org/wiki/Patience_sorting\r\n n = len(a)\r\n piles = [n + 1 for i in range(n)] # To find length of LIS, we're only interested in the top card of each pile\r\n nextPileIdx = 0\r\n for i in a:\r\n idx = bisect_right(piles, i, 0, nextPileIdx)\r\n piles[idx] = i\r\n if idx >= nextPileIdx:\r\n nextPileIdx += 1\r\n\r\n return nextPileIdx\r\n\r\n def maxIndependentSetSize(self, a: List[int]) -> int:\r\n return self.patienceSort(a)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input().strip())\r\n a = list(map(int, input().strip().split()))\r\n s = Solution()\r\n print(s.maxIndependentSetSize(a))\r\n", "def CeilIndex(A, l, r, key): \r\n \r\n while (r - l > 1): \r\n \r\n m = l + (r - l)//2\r\n if (A[m] >= key): \r\n r = m \r\n else: \r\n l = m \r\n return r \r\n \r\ndef LIS(A, size): \r\n tailTable = [0 for i in range(size + 1)] \r\n len = 0 \r\n \r\n tailTable[0] = A[0] \r\n len = 1\r\n for i in range(1, size): \r\n \r\n if (A[i] < tailTable[0]): \r\n tailTable[0] = A[i] \r\n \r\n elif (A[i] > tailTable[len-1]): \r\n tailTable[len] = A[i] \r\n len+= 1\r\n \r\n else: \r\n tailTable[CeilIndex(tailTable, -1, len-1, A[i])] = A[i] \r\n \r\n \r\n return len\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n\r\n print(LIS(arr,n))\r\n \r\n\r\nmain()\r\n", "import sys\nimport bisect\n\ninput = sys.stdin.readline\n\ntest = False\n\nmod1, mod2 = 10 ** 9 + 7, 998244353\ninf = 10 ** 18 + 5\n\n\ndef test_case():\n\n n = int(input())\n a = list(map(int, input().split()))\n\n dp = []\n\n for x in a:\n\n pos = bisect.bisect_left(dp, x)\n\n if pos != len(dp):\n\n dp[pos] = x\n else:\n\n dp.append(x)\n\n print(len(dp))\n\n\nt = 1\n\nif test:\n\n t = int(input())\n\nfor _ in range(t):\n\n # print(f\"Case #{_+1}: \")\n test_case()\n", "import math\r\nimport sys\r\nfrom bisect import bisect_right, bisect_left, insort_right\r\nfrom collections import Counter, defaultdict\r\nfrom heapq import heappop, heappush\r\nfrom itertools import accumulate, permutations, combinations\r\nfrom sys import stdout\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\narr = list(R())\r\ntps = [(0, 0)]\r\nfor x in arr:\r\n i = bisect_left(tps, (x, -1)) - 1\r\n tps.insert(i + 1, (x, tps[i][1] + 1))\r\n if i + 2 < len(tps) and tps[i + 1][1] >= tps[i + 2][1]:\r\n del tps[i + 2]\r\nprint(max(x[1] for x in tps))", "import sys\r\ninput = sys.stdin.readline\r\nfrom bisect import bisect\r\n\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\na = 1 << 20\r\nd = [a] * n\r\nfor i in w:\r\n d[bisect(d, i)] = i\r\nprint(bisect(d, a-1))\r\n", "import bisect\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\narr = list(R())\r\nlen2min = []\r\nfor num in arr:\r\n idx = bisect.bisect_left(len2min, num)\r\n if idx == len(len2min):\r\n len2min.append(num)\r\n else:\r\n len2min[idx] = min(len2min[idx], num)\r\nprint(len(len2min))" ]

[ "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2 + 1) // 2\r\n if ok(m):\r\n c2 = m\r\n else:\r\n c1 = m\r\n m = max(0, m - 1)\r\n while not ok(m):\r\n m += 1\r\n return xv[m]\r\n\r\ndef ok(m):\r\n if m >= len(xv) - 1:\r\n return True\r\n c = len(xv) - m - 1\r\n z = xv[m]\r\n for i in l:\r\n c += len(x[i]) - bisect.bisect_left(x[i], z)\r\n return True if c + z == n else False\r\n\r\nn = int(input())\r\nx, y, z = [[] for _ in range(n + 1)], [0], []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x[a].append(i + 1)\r\n y.append(b)\r\n z.append(a)\r\nu = []\r\nv = [0] * (n + 1)\r\nfor i in z[::-1]:\r\n if not v[i]:\r\n u.append(i)\r\n v[i] = 1\r\nq = int(input())\r\nans = []\r\nfor _ in range(q):\r\n l = list(map(int, input().split()))[1:]\r\n s = set(l)\r\n v = 0\r\n for i in u:\r\n if not i in s:\r\n v = i\r\n break\r\n if not v:\r\n ans0 = \"0 0\"\r\n ans.append(ans0)\r\n continue\r\n xv = x[v]\r\n ans0 = \" \".join(map(str, (v, y[binary_search(0, len(xv))])))\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(ans))" ]

[ "n=int(input())\r\ns=input()\r\nq=s.count(\"H\")\r\nw=n-q\r\n\r\n\r\no=1001\r\nfor i in range(n-q+1):\r\n o=min(o,q-s[i:i+q].count(\"H\"))\r\nfor i in range(n-w+1):\r\n o=min(o,w-s[i:i+w].count(\"T\"))\r\nprint(o)", "n = int(input())\r\ns = input() * 2\r\ncount = s.count(\"H\") // 2\r\nprint(count - max(s[i:i + count].count('H') for i in range(n)))\r\n", "n=int(input())\ns=input()*2\ncount=s.count(\"H\")//2\nprint(count-max(s[i:i+count].count('H') for i in range(n)))\n\t\t\t\t \t\t\t\t\t \t\t \t\t\t\t\t\t \t \t", "n = int(input())\npositions = input()\nhamsters = positions.count('H')\ntigers = n - hamsters\nmin_swaps = float('inf')\nfor i in range(n):\n swaps = 0\n for j in range(hamsters):\n if positions[(i + j) % n] != 'H':\n swaps += 1\n min_swaps = min(min_swaps, swaps)\nprint(min_swaps)\n \t \t\t\t\t \t\t \t\t \t\t \t\t \t\t \t \t \t", "I = int\r\nK = input\r\nW = print\r\nq = min\r\nx = sum\r\nu = range\r\nn = I(K())\r\ns = K()\r\nkh = s.count('H')\r\na = 'H'*kh+'T'*(n-kh)\r\nW(q(x(a[j-i] != s[j] for j in u(n)) for i in u(n)) // 2)\r\n", "def min_swaps(n, positions):\n hamster_count = positions.count('H')\n tiger_count = n - hamster_count\n \n min_swaps = float('inf')\n \n for i in range(n):\n hamster_swaps = 0\n tiger_swaps = 0\n \n for j in range(i, i + hamster_count):\n if positions[j % n] == 'T':\n hamster_swaps += 1\n \n for j in range(i, i + tiger_count):\n if positions[j % n] == 'H':\n tiger_swaps += 1\n \n min_swaps = min(min_swaps, min(hamster_swaps, tiger_swaps))\n \n return min_swaps\n\n# Read input\nn = int(input())\npositions = input()\n\n# Calculate and print the result\nresult = min_swaps(n, positions)\nprint(result)\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\nS=list(input())\r\n\r\nANS=1<<60\r\n\r\ndef calc(S):\r\n x=S[0]\r\n y=S[-1]\r\n\r\n f=0\r\n l=len(S)-1\r\n ANS=0\r\n\r\n while f<l:\r\n while f<len(S) and S[f]==S[0]:\r\n f+=1\r\n\r\n while l>=0 and S[l]==S[-1]:\r\n l-=1\r\n\r\n if f>l:\r\n break\r\n\r\n ANS+=1\r\n f+=1\r\n l-=1\r\n return ANS\r\n\r\nfor i in range(len(S)):\r\n if S[i]!=S[i-1]:\r\n ANS=min(ANS,calc(S[i:]+S[:i]))\r\n\r\nprint(ANS)\r\n \r\n\r\n", "n = int(input())\ns = input()\nt = 0\n\nfor i in range(len(s)):\n if s[i] == 'T':\n t += 1\n\ntc = 0\nmin_val = 8\n\nfor i in range(t):\n if s[i] == 'T':\n tc += 1\n\nmin_val = t - tc\ns = s + s[:t-1]\n\nfor i in range(1, len(s) - t + 1):\n tc = 0\n st = s[i:i+t]\n \n for j in range(len(st)):\n if st[j] == 'T':\n tc += 1\n \n min_val = min(min_val, t - tc)\n\nprint(min_val)\n\n\t\t\t \t\t\t\t \t\t\t\t \t\t\t \t \t\t\t\t \t", "def min_swaps_for_arrangement(n, arrangement):\n num_hamsters = arrangement.count('H')\n min_swaps = float('inf')\n\n window = arrangement[:num_hamsters]\n num_tigers_in_window = window.count('T')\n min_swaps = min(min_swaps, num_tigers_in_window)\n\n for i in range(1, n):\n if arrangement[i - 1] == 'T':\n num_tigers_in_window -= 1\n if arrangement[(i + num_hamsters - 1) % n] == 'T':\n num_tigers_in_window += 1\n\n min_swaps = min(min_swaps, num_tigers_in_window)\n\n return min_swaps\n\n# Read input\nn = int(input())\narrangement = input()\n\n# Calculate and print the result\nresult = min_swaps_for_arrangement(n, arrangement)\nprint(result)\n#bhbhf\n\n\t \t \t \t\t \t\t\t \t \t\t\t\t \t \t", "def min_swaps_to_separate_hamsters_and_tigers(n, positions):\n hamster_count = positions.count(\"H\")\n tiger_count = n - hamster_count\n min_swaps = float('inf')\n \n for i in range(n):\n current_swaps = 0\n for j in range(hamster_count):\n if positions[(i + j) % n] == \"T\":\n current_swaps += 1\n min_swaps = min(min_swaps, current_swaps)\n \n return min_swaps\n\nn = int(input())\npositions = input()\n\nresult = min_swaps_to_separate_hamsters_and_tigers(n, positions)\nprint(result)\n\n \t \t\t \t \t \t \t\t \t \t\t\t", "def min_swaps(n, animals):\n hamsters = animals.count('H')\n tigers = animals.count('T')\n \n min_swaps = float('inf')\n \n for start in range(n):\n hamster_swaps = 0\n tiger_swaps = 0\n \n for i in range(start, start + hamsters):\n if animals[i % n] == 'T':\n hamster_swaps += 1\n \n for i in range(start, start + tigers):\n if animals[i % n] == 'H':\n tiger_swaps += 1\n \n min_swaps = min(min_swaps, hamster_swaps, tiger_swaps)\n \n return min_swaps\n\nn = int(input())\nanimals = input().strip()\n\nresult = min_swaps(n, animals)\nprint(result)\n\n \t\t \t \t\t \t \t \t\t\t \t \t \t\t", "def min_swaps_to_group_animals(n, positions):\n # Count the total number of hamsters and tigers\n num_hamsters = positions.count(\"H\")\n num_tigers = n - num_hamsters\n \n # Find the initial count of tigers within the first window of size num_hamsters\n initial_tiger_count = positions[:num_hamsters].count(\"T\")\n \n # Initialize the minimum swaps required to be the number of tigers within the first window\n min_swaps = initial_tiger_count\n \n # Slide the window and update the minimum swaps\n for i in range(1, n):\n if positions[i - 1] == \"T\":\n initial_tiger_count -= 1\n if positions[(i + num_hamsters - 1) % n] == \"T\":\n initial_tiger_count += 1\n \n min_swaps = min(min_swaps, initial_tiger_count)\n \n # The minimum swaps required is the number of tigers within the first window\n # that need to be moved to group all tigers together\n return min_swaps\n\n# Read input\nn = int(input())\npositions = input().strip()\n\n# Calculate and print the result\nresult = min_swaps_to_group_animals(n, positions)\nprint(result)\n\n\t \t \t \t \t\t\t\t\t\t \t \t\t\t \t \t\t", "n=int(input())\r\ns=input()\r\nh=s.count('H')\r\ns+=s\r\nans=n\r\nfor i in range(n):\r\n t=s[i:i+h].count(\"T\")\r\n ans=min(ans,t)\r\nprint(ans)\r\n", "# -*- coding:utf-8 -*-\n\n\"\"\"\n\ncreated by shuangquan.huang at 11/2/18\n\n\"\"\"\n\n\n\ndef steps(start, target):\n \n ans = 0\n for i, v in enumerate(start):\n u = target[i]\n if v != u:\n for j in range(i+1, len(start)):\n a, b = start[j], target[j]\n if a != b and a == u:\n start[i], start[j] = start[j], start[i]\n break\n ans += 1\n \n return ans\n\n\ndef solve(seq):\n hc = seq.count('H')\n tc = len(seq) - hc\n ans = float('inf')\n for i in range(tc+1):\n s = ['T'] * i + ['H'] * hc + ['T'] * (tc-i)\n ans = min(steps(seq.copy(), s), ans)\n for i in range(hc+1):\n s = ['H'] * i + ['T'] * tc + ['H'] * (hc-i)\n ans = min(steps(seq.copy(), s), ans)\n return ans\n \n \nN = int(input())\nline = list(input())\nprint(solve(line))", "R = lambda : map(int, input().split())\r\nn = int(input())\r\ns = input()\r\nhc, tc = s.count('H'), s.count('T')\r\nhr = min([s[i:i + hc].count('T') for i in range(n - hc)])\r\ntr = min([s[i:i + tc].count('H') for i in range(n - tc)])\r\nprint(min(hr, tr))", "n = int(input())\npositions = input()\n\nnum_hamsters = positions.count('H')\n\nmin_tigers = float('inf')\ncurrent_tigers = positions[:num_hamsters].count('T')\n\nfor i in range(n):\n if positions[(i + num_hamsters) % n] == 'T':\n current_tigers += 1\n if positions[i] == 'T':\n current_tigers -= 1\n min_tigers = min(min_tigers, current_tigers)\n\nprint(min_tigers)\n\n\t\t\t\t \t\t\t \t \t \t \t \t\t\t\t\t\t", "def min_swaps_to_group_hamsters(animals):\n n = len(animals)\n hamster_count = animals.count('H')\n min_swaps = float('inf')\n \n for i in range(n):\n tiger_count = 0\n for j in range(i, i + hamster_count):\n if animals[j % n] == 'T':\n tiger_count += 1\n min_swaps = min(min_swaps, tiger_count)\n \n return min_swaps\n\n# Read input\nn = int(input())\nanimals = input().strip()\n\n# Find and print the minimal number of swaps\nprint(min_swaps_to_group_hamsters(animals))\n\n \t \t\t\t \t\t\t\t\t \t\t \t \t \t\t", "n = int(input())\ns = input()\ntigers = s.count('T')\nhamsters = s.count('H')\nmin_swaps = float('inf')\nfor i in range(n):\n swaps = 0\n for j in range(tigers):\n if s[(i + j) % n] == 'H':\n swaps += 1\n min_swaps = min(min_swaps, swaps)\nprint(min_swaps)\n\n\t\t \t \t\t\t \t\t\t \t\t \t \t \t\t\t", "n, t = int(input()), input()\r\nk, x = t.count('T'), 'T'\r\nif 2 * k > n: k, x = n - k, 'H'\r\np = t[: k]\r\ny = d = p.count(x)\r\nt += p\r\nfor i in range(n):\r\n if t[i] == x:\r\n if t[i + k] != x: d -= 1\r\n elif t[i + k] == x:\r\n d += 1\r\n if d > y: y = d\r\nprint(k - y)", "I=input\r\nn=int(I())\r\ns=I()\r\nq=s.count(\"H\")\r\ns+=s\r\nprint(min(s[i:i+q].count(\"T\")for i in range(n)))", "# LUOGU_RID: 104227169\nn = int(input())\r\ns = input()\r\nprint(min((s + s)[i:i+s.count('H')].count('T') for i in range(n)))\r\n", "n=int(input())\r\ns=input()\r\nh=s.count('H')\r\nprint(min((s+s)[i:i+h].count('T') for i in range(n)))\r\n", "def min_swaps_to_group(n, positions):\n hamsters = positions.count(\"H\")\n tigers = n - hamsters\n\n min_swaps = float('inf')\n current_swaps = 0\n\n # Count tigers in the initial window of size hamsters\n for i in range(hamsters):\n if positions[i] == \"T\":\n current_swaps += 1\n\n for i in range(n):\n min_swaps = min(min_swaps, current_swaps)\n\n # Move the window\n if positions[i] == \"T\":\n current_swaps -= 1\n if positions[(i + hamsters) % n] == \"T\":\n current_swaps += 1\n\n return min_swaps\n\n# Read input\nn = int(input())\npositions = input()\n\n# Calculate and print the result\nresult = min_swaps_to_group(n, positions)\nprint(result)\n\n \t \t \t \t \t \t\t \t\t \t \t\t \t\t \t", "n = int(input())\r\n\r\ns = list(str(input()))\r\nt = s.count(\"T\")\r\n\r\nres = 10 ** 10\r\nfor i in range(n):\r\n current = 0\r\n for j in range(t):\r\n if s[(i + j) % n] == \"H\":\r\n current += 1\r\n res = min(res, current)\r\n\r\nprint(res)\r\n", "def min_swaps_to_group(n, animals):\n hamsters = animals.count('H')\n tigers = animals.count('T')\n min_swaps = float('inf')\n\n for i in range(n):\n hamster_count = 0\n tiger_count = 0\n\n for j in range(i, i + n):\n if animals[j % n] == 'H':\n hamster_count += 1\n else:\n tiger_count += 1\n\n if j - i + 1 >= max(hamsters, tigers):\n min_swaps = min(min_swaps, min(hamster_count, tiger_count))\n\n return min_swaps\n\n# Read input\nn = int(input())\nanimals = input()\n\n# Calculate and print the result\nresult = min_swaps_to_group(n, animals)\nprint(result)\n\n\t\t \t\t\t \t\t\t\t \t\t \t\t\t\t \t \t\t \t", "N = int(input())\r\ncircle = input()\r\nh_count = circle.count(\"H\")\r\ncircle = circle + circle\r\nans = t_count = circle[:h_count].count(\"T\")\r\nleft = 0\r\nright = h_count\r\nwhile right < 2*N:\r\n if circle[right] == \"T\":\r\n t_count += 1\r\n if circle[left] == \"T\":\r\n t_count -= 1\r\n ans = min(ans, t_count)\r\n left += 1\r\n right += 1\r\nprint(ans)", "def process(S):\r\n n = len(S)\r\n h_count = 0\r\n answer = float('inf')\r\n for c in S:\r\n if c=='H':\r\n h_count+=1\r\n current = 0\r\n for i in range(h_count):\r\n if S[i]=='H':\r\n current+=1\r\n answer = min(answer, h_count-current)\r\n for i in range(h_count, n+h_count):\r\n if i > n-1:\r\n i1 = i-n\r\n else:\r\n i1 = i \r\n i2 = i-h_count\r\n if S[i1]=='H':\r\n current+=1\r\n if S[i2]=='H':\r\n current-=1\r\n answer = min(answer, h_count-current)\r\n return answer\r\n\r\nn = int(input())\r\nS = input()\r\nprint(process(S))", "n = int(input())\npositions = input()\nhamster_count = positions.count(\"H\")\nmin_swaps = float('inf')\nfor i in range(n):\n tiger_count = 0\n for j in range(i, i + hamster_count):\n if positions[j % n] == \"T\":\n tiger_count += 1\n min_swaps = min(min_swaps, tiger_count)\nprint(min_swaps)\n \t\t\t \t \t \t\t\t \t \t \t\t\t \t\t\t", "def min_swaps(n, positions):\n hamsters = positions.count('H')\n tigers = n - hamsters\n \n positions = positions + positions\n \n minSwaps = float('inf')\n \n for i in range(n):\n tigers_in_range = positions[i:i+tigers].count('T')\n swaps_needed = tigers - tigers_in_range\n minSwaps = min(minSwaps, swaps_needed)\n \n return minSwaps\n\nn = int(input())\npositions = input()\n\nprint(min_swaps(n, positions))\n\n\t \t \t\t\t \t \t \t\t \t \t \t\t \t", "n = int(input())\nline = input().strip()\nspan = line.count('T')\ncount = line[:span].count('H')\nbest = count\nfor i in range(n):\n if line[i] == 'H':\n count -= 1\n if line[(i + span) % n] == 'H':\n count += 1\n best = min(best, count)\nprint(best)\n", "n=int(input())\r\ns=input()\r\nc=s.count('H')\r\nm=n\r\nfor i in range(n):\r\n\tif i+c<=n:x=s[i:i+c]\r\n\telse:x=s[i:n]+s[:i+c-n]\r\n\tm=min(m,x.count('T'))\r\nprint(m)", "def min_swaps_to_group_animals(n, positions, target):\n count = positions.count(target)\n min_swaps = float('inf')\n \n for i in range(n):\n # Count the number of target animals in the current window\n window_count = positions[i:i+count].count(target)\n \n # Calculate the number of swaps needed to group the target animals together in this window\n swaps = count - window_count\n \n min_swaps = min(min_swaps, swaps)\n \n return min_swaps\n\n# Read input\nn = int(input())\npositions = input()\n\n# Calculate and print the result\nmin_swaps_hamsters = min_swaps_to_group_animals(n, positions, 'H')\nmin_swaps_tigers = min_swaps_to_group_animals(n, positions, 'T')\nresult = min(min_swaps_hamsters, min_swaps_tigers)\nprint(result)\n\n\t\t \t \t\t\t\t \t\t\t\t \t\t \t \t \t \t\t\t", "'''\r\nBeezMinh\r\n21:23 UTC+7\r\n20/08/2023\r\n'''\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip()\r\nn = int(input())\r\ns = input()\r\ncnt = s.count('H')\r\ns = s + s\r\nprint(min(s[i : i + cnt].count('T') for i in range(n)))", "n = int(input())\ns = input()\n\nhamsters = s.count('H') # Count the initial number of hamsters\n\n# Double the string to handle circular arrangement\ns += s\n\nmin_swaps = float('inf')\n\n# Iterate through each possible starting position of hamsters\nfor i in range(n + 1):\n ending_position = i + hamsters\n hamsters_inside = s[i:ending_position].count('H')\n swaps_needed = hamsters - hamsters_inside\n min_swaps = min(min_swaps, swaps_needed)\n\nprint(min_swaps)\n \t \t\t \t\t \t\t\t\t \t\t\t \t \t \t\t", "n=int(input())\r\na=input()\r\nb=a.count('T')\r\nc=-1\r\nfor i in range(n):\r\n d=0\r\n for j in range(b):\r\n d+=int(a[(i+j)%n]=='H')\r\n if c==-1 or d<c:\r\n c=d\r\nprint(c)", "import sys\r\nn=int(input())\r\ns=input()\r\ns+=s\r\nh=0\r\nfor i in range(n):\r\n\tif s[i]=='H':\r\n\t\th+=1\r\nans=h\r\nfor i in range(n):\r\n\tc=0\r\n\tfor j in range(i,i+h):\r\n\t\tif s[j]=='T':\r\n\t\t\tc+=1\r\n\tans=min(ans,c)\r\nprint(ans)\r\n\t\r\n\r\n\t\r\n\t\r\n\t\r\n\r\n \t\t \t \t \t\t\t \t \t \t\t \t\t \t \t\t", "def min_swaps_to_group(n, positions):\n hamster_count = positions.count('H')\n tiger_count = n - hamster_count\n min_swaps = float('inf')\n \n for i in range(n):\n hamster_swaps = 0\n tiger_swaps = 0\n \n # Count swaps needed to group hamsters together\n for j in range(hamster_count):\n idx = (i + j) % n\n if positions[idx] != 'H':\n hamster_swaps += 1\n \n # Count swaps needed to group tigers together\n for j in range(tiger_count):\n idx = (i + hamster_count + j) % n\n if positions[idx] != 'T':\n tiger_swaps += 1\n \n min_swaps = min(min_swaps, min(hamster_swaps, tiger_swaps))\n \n return min_swaps\n\n# Read input\nn = int(input())\npositions = input()\n\n# Find and print the minimal number of swaps\nresult = min_swaps_to_group(n, positions)\nprint(result)\n\n \t \t \t\t\t \t \t \t \t\t\t \t \t \t", "def main():\n n = int(input())\n positions = input()\n\n hamsters = positions.count('H')\n minSwaps = n\n\n for i in range(n):\n swaps = 0\n\n for j in range(hamsters):\n if positions[(i + j) % n] == 'T':\n swaps += 1\n\n minSwaps = min(minSwaps, swaps)\n\n print(minSwaps)\n\nif __name__ == \"__main__\":\n main()\n\n \t\t \t \t \t \t\t \t \t \t\t \t", "def minimal_swaps(n, positions):\n tigers = positions.count('T')\n min_swaps = float('inf')\n \n for i in range(n):\n hamster_group = positions[i:] + positions[:i] \n tigers_inside_group = hamster_group[:tigers].count('T')\n swaps_needed = tigers - tigers_inside_group\n \n min_swaps = min(min_swaps, swaps_needed)\n \n return min_swaps\n\n# Read input\nn = int(input())\npositions = input().strip()\n\nprint(minimal_swaps(n, positions))\n\n\t\t \t\t \t\t \t\t \t \t\t\t \t\t\t \t \t\t\t", "def min_swaps_to_group_animals(n, positions):\n # Count the number of hamsters\n num_hamsters = positions.count(\"H\")\n\n # Initialize the count of tigers within the first window of size num_hamsters\n tigers_in_window = positions[:num_hamsters].count(\"T\")\n\n # Initialize the minimum count of tigers within any window of size num_hamsters\n min_tigers_in_window = tigers_in_window\n\n # Iterate through the remaining positions\n for i in range(num_hamsters, n + num_hamsters):\n # Update the count of tigers within the current window\n if positions[i % n] == \"T\":\n tigers_in_window += 1\n if positions[(i - num_hamsters) % n] == \"T\":\n tigers_in_window -= 1\n\n # Update the minimum count of tigers within any window\n min_tigers_in_window = min(min_tigers_in_window, tigers_in_window)\n\n # The number of swaps needed is equal to the number of tigers outside the window\n return min_tigers_in_window\n\n# Read input\nn = int(input()) # Total number of animals\npositions = input() # Animal positions (H or T)\n\n# Calculate and print the result\nresult = min_swaps_to_group_animals(n, positions)\nprint(result)\n\n \t\t \t\t \t\t \t \t \t\t\t\t\t\t \t \t\t\t", "n = int(input())\ns = input()\nkh = s.count('H')\nlst = ['H'] * kh + ['T'] * (n - kh)\nbest = kh\nfor i in range(n):\n best = min(sum(lst[j] != s[j] for j in range(n)) // 2, best)\n lst.append(lst.pop(0))\nprint(best)\n \t \t \t\t\t\t\t \t\t\t \t \t\t \t\t \t \t", "def min_swaps_to_group_animals(n, positions):\n # Count the number of hamsters and tigers\n num_hamsters = positions.count(\"H\")\n num_tigers = n - num_hamsters\n\n # Count the number of tigers in the initial window of size num_hamsters\n tigers_in_window = positions[:num_hamsters].count(\"T\")\n min_swaps = tigers_in_window\n\n # Slide the window to count the number of swaps required to move all hamsters together\n for i in range(1, n):\n if positions[i - 1] == \"T\":\n tigers_in_window -= 1\n if positions[(i + num_hamsters - 1) % n] == \"T\":\n tigers_in_window += 1\n min_swaps = min(min_swaps, tigers_in_window)\n\n return min_swaps\n\n# Input\nn = int(input())\npositions = input()\n\nprint(min_swaps_to_group_animals(n, positions))\n\n\t \t\t \t \t \t \t \t \t \t", "n = int(input())\ns = input()\n\ncount = s.count('T')\nval = count\n\nfor i in range(n):\n count1 = 0\n for j in range(count):\n if s[(i + j) % n] == 'H':\n count1 += 1\n if count1 < val:\n val = count1\n\nprint(val)\n \t\t\t\t\t \t\t \t \t \t\t \t \t \t \t\t", "def minimum_exchanges(n, arrangement):\r\n # Подсчет количества хомячков и тигров\r\n num_hamsters = arrangement.count('H')\r\n num_tigers = arrangement.count('T')\r\n\r\n # Измерение расстояния между хомячками и тиграми\r\n distance = 0\r\n for i in range(n):\r\n if arrangement[i] == 'H' and arrangement[(i + 1) % n] == 'T':\r\n distance = i + 1\r\n break\r\n\r\n min_exchanges = float('inf') # Начальное значение минимального количества обменов\r\n\r\n # Сдвиг хомячков и подсчет количества обменов\r\n for i in range(n):\r\n exchanges = 0 # Количество обменов для текущего сдвига\r\n for j in range(num_hamsters):\r\n if arrangement[(i + j) % n] != 'H':\r\n exchanges += 1\r\n min_exchanges = min(min_exchanges, exchanges)\r\n\r\n # Сдвиг тигров и подсчет количества обменов\r\n for i in range(n):\r\n exchanges = 0 # Количество обменов для текущего сдвига\r\n for j in range(num_tigers):\r\n if arrangement[(i + j) % n] != 'T':\r\n exchanges += 1\r\n min_exchanges = min(min_exchanges, exchanges)\r\n\r\n return min_exchanges\r\n\r\n# Чтение входных данных\r\nn = int(input())\r\narrangement = input()\r\n\r\n# Вызов функции и вывод результата\r\nprint(minimum_exchanges(n, arrangement))\r\n", "def min_swaps_to_group_animals(n, positions):\n hamster_count = positions.count('H')\n tiger_count = n - hamster_count\n \n min_tigers_inside_window = float('inf')\n \n initial_window = positions[:hamster_count]\n tigers_inside_window = initial_window.count('T') \n min_tigers_inside_window = min(min_tigers_inside_window, tigers_inside_window)\n \n for i in range(1, n):\n left_animal = positions[i - 1]\n right_animal = positions[(i + hamster_count - 1) % n] \n \n if left_animal == 'T':\n tigers_inside_window -= 1\n if right_animal == 'T':\n tigers_inside_window += 1\n \n min_tigers_inside_window = min(min_tigers_inside_window, tigers_inside_window)\n \n return min_tigers_inside_window\n\nn = int(input())\npositions = input()\nresult = min_swaps_to_group_animals(n, positions)\nprint(result)\n#tiger and hamster\n \t\t\t\t\t\t\t\t\t\t\t\t \t \t \t\t\t \t", "n, s = int(input()), input() * 2\r\nh = s.count('H') // 2\r\nprint(h - max(s[i:i + h].count('H') for i in range(n)))", "def min_swaps(n, animals):\n hamsters = sum(1 for animal in animals if animal == 'H')\n tigers = n - hamsters\n \n min_swaps = float('inf')\n \n for i in range(n):\n clockwise_swaps = 0\n counter_clockwise_swaps = 0\n for j in range(hamsters):\n if animals[(i + j) % n] == 'T':\n clockwise_swaps += 1\n for j in range(tigers):\n if animals[(i + j) % n] == 'H':\n counter_clockwise_swaps += 1\n min_swaps = min(min_swaps, min(clockwise_swaps, counter_clockwise_swaps))\n \n return min_swaps\n\n# Read input\nn = int(input())\nanimals = input()\n\n# Calculate and print the result\nresult = min_swaps(n, animals)\nprint(result)\n\n \t \t \t \t \t \t \t\t\t\t \t\t \t\t \t", "from typing import List\r\nclass Solution:\r\n def minSwaps(self, nums: List[int]) -> int:\r\n n = len(nums)\r\n allOnes = sum(nums)\r\n tot = 0\r\n # 初始化长度为 allOnes 的窗口\r\n for i in range(allOnes):\r\n tot += nums[i]\r\n ans = allOnes - tot # 记录 [0,allOnes-1] 区间内的交换次数\r\n # 右侧滑入一个元素左侧删除一个元素\r\n for i in range(allOnes, n + allOnes):\r\n tot += nums[i % n] - nums[i-allOnes]\r\n ans = min(ans, allOnes - tot)\r\n return ans\r\ninput()\r\nnums = [0 if ch == 'T' else 1 for ch in input()]\r\n\r\nprint(Solution().minSwaps(nums))", "n = int(input())\r\nstr = input()\r\nct = 0\r\ncnt = 0\r\nmx = 0\r\nfor i in str :\r\n if i == 'T' :\r\n ct += 1\r\ni,j = 0,0\r\nwhile i < n+ct :\r\n while i-j != ct :\r\n if str[i%n] == 'T' :\r\n cnt += 1\r\n i += 1\r\n mx = max(cnt,mx)\r\n if str[j%n] == 'T' :\r\n cnt -= 1\r\n j += 1\r\nprint(ct-mx)", "n=int(input())\r\ns=input()\r\nhct=s.count(\"H\")\r\ntct=s.count(\"T\")\r\nif(hct==1 or tct==1):\r\n print(0)\r\n exit()\r\nelse:\r\n hcount=s[:tct].count(\"H\")\r\n j2=tct\r\n j1=0\r\n for i in range(n):\r\n if(i==0):\r\n mn=hcount\r\n else:\r\n\r\n if(s[j2%n]==\"H\"):\r\n hcount+=1\r\n\r\n if(s[j1]==\"H\"):\r\n hcount-=1\r\n j2+=1\r\n j1+=1\r\n mn=min(mn,hcount)\r\n print(mn)\r\n\r\n", "n=int(input())\r\ns=input()\r\nh=0\r\nfor i in s:\r\n if i=='H':h+=1\r\n\r\nr=[]\r\nt=0\r\nfor i in range(0,n):\r\n if s[i]=='H':\r\n for b in range((i+1)%n,min(((i+1)%n+h-1),n)):\r\n if s[b]=='T':\r\n t+=1\r\n if ((i+1)%n+(h-1))>n:\r\n for q in range(0,(((i+1)%n+(h-1))%n)):\r\n if s[q]=='T':\r\n t+=1 \r\n r+=[t]\r\n t=0\r\n i+=1\r\nprint(min(r))\r\n", "def min_swaps_to_group(n, positions):\n hamsters = positions.count('H')\n tigers = n - hamsters\n positions += positions # Concatenate the string to eliminate circular behavior\n min_swaps = float('inf')\n \n for i in range(n):\n tigers_in_window = positions[i:i+hamsters].count('T')\n min_swaps = min(min_swaps, tigers_in_window)\n \n return min_swaps\n\nn = int(input())\npositions = input().strip()\n\nresult = min_swaps_to_group(n, positions)\nprint(result)\n\n\t\t \t \t\t\t\t \t\t \t \t\t\t \t\t", "n = int(input())\npositions = input()\n\ntigers = positions.count('T')\nhamsters = n - tigers\n\nmin_swaps = float('inf')\n\n# Grouping tigers together\nwindow_tigers = positions[:tigers].count('T')\nmin_swaps = min(min_swaps, tigers - window_tigers)\n\nfor i in range(tigers, n + tigers):\n if positions[i - tigers] == 'T':\n window_tigers -= 1\n if positions[i % n] == 'T':\n window_tigers += 1\n min_swaps = min(min_swaps, tigers - window_tigers)\n\n# Grouping hamsters together\nwindow_hamsters = positions[:hamsters].count('H')\nmin_swaps = min(min_swaps, hamsters - window_hamsters)\n\nfor i in range(hamsters, n + hamsters):\n if positions[i - hamsters] == 'H':\n window_hamsters -= 1\n if positions[i % n] == 'H':\n window_hamsters += 1\n min_swaps = min(min_swaps, hamsters - window_hamsters)\n\nprint(min_swaps)\n\n\n \t\t \t \t \t\t \t \t \t \t \t\t", "num=int(input())\nst=input()\nh=st.count('H')\nprint (min((st+st)[i:i+h].count('T') for i in range(num)))\n\n\t \t \t\t \t\t \t \t\t\t \t\t \t\t\t", "def min_swaps(n, positions):\n tigers = positions.count('T')\n hamsters = n - tigers\n min_swaps = tigers # Initialize with a large value\n\n for start in range(n):\n # Count swaps for consecutive hamsters\n swaps_hamsters = 0\n for i in range(hamsters):\n if positions[(start + i) % n] == 'T':\n swaps_hamsters += 1\n\n # Count swaps for consecutive tigers\n swaps_tigers = 0\n for i in range(tigers):\n if positions[(start + hamsters + i) % n] == 'H':\n swaps_tigers += 1\n\n # Update the minimum swaps\n min_swaps = min(min_swaps, swaps_hamsters, swaps_tigers)\n\n return min_swaps\n\n# Read input\nni = int(input())\npositions = input()\n\n# Calculate and print the result\nresult = min_swaps(ni, positions)\nprint(result)\n\n \t\t \t\t \t\t \t\t\t \t\t\t \t \t\t", "n = int(input())\ns = input()\n\nhamsters = s.count('H') \n\ns += s\n\nmin_swaps = float('inf')\n\nfor i in range(n + 1):\n ending_position = i + hamsters\n hamsters_inside = s[i:ending_position].count('H')\n swaps_needed = hamsters - hamsters_inside\n min_swaps = min(min_swaps, swaps_needed)\n\nprint(min_swaps)\n\n\t\t\t\t \t\t \t\t\t \t\t\t \t \t\t\t\t \t", "n = int(input())\r\ns = input()\r\nkh = s.count('H')\r\nlst = ['H'] * kh + ['T'] * (n - kh)\r\nprint(min(sum(lst[j - i] != s[j] for j in range(n)) // 2 for i in range(n)))", "n=int(input())\ns=input()\nh=s.count('H')\nprint (min((s+s)[i:i+h].count('T') for i in range(n)))\n\n\t \t \t \t\t\t\t \t\t \t \t \t \t\t\t\t\t\t \t\t", "def min_swaps_to_group_animals(n, positions):\n total_hamsters = positions.count('H')\n total_tigers = n - total_hamsters\n min_swaps = float('inf')\n\n # Iterate through all possible starting positions for hamsters\n for i in range(n):\n swaps = 0\n for j in range(i, i + total_hamsters):\n if positions[j % n] == 'T':\n swaps += 1\n \n min_swaps = min(min_swaps, swaps)\n \n return min_swaps\n\n# Read input\nn = int(input())\npositions = input()\n\n# Calculate and print the result\nresult = min_swaps_to_group_animals(n, positions)\nprint(result)\n\n \t \t \t \t\t \t\t\t \t \t \t \t \t \t", "n = int(input())\ns = input()\ns = s+s\ncount = s.count(\"H\") // 2\nx = 0\nfor i in range(n):\n z = s[i:i + count].count('H')\n x = max(x,z)\nprint(count-x)\n\t\t\t \t\t\t \t\t\t \t \t\t\t \t\t\t \t\t", "def min_swaps_to_group_animals(n, animals):\n # Count the total number of hamsters\n total_hamsters = animals.count('H')\n\n min_tigers_in_window = float('inf')\n current_tigers_in_window = animals[:total_hamsters].count('T')\n\n # Initialize the minimum number of tigers within any window\n min_tigers_in_window = min(min_tigers_in_window, current_tigers_in_window)\n\n # Slide the window and update the minimum number of tigers\n for i in range(1, n):\n if animals[i - 1] == 'T':\n current_tigers_in_window -= 1\n if animals[(i + total_hamsters - 1) % n] == 'T':\n current_tigers_in_window += 1\n\n min_tigers_in_window = min(min_tigers_in_window, current_tigers_in_window)\n\n # Calculate the minimum number of swaps needed\n min_swaps = min_tigers_in_window\n\n return min_swaps\n\n# Read input\nn = int(input())\nanimals =input()\n\n# Calculate and print the result\nresult = min_swaps_to_group_animals(n, animals)\nprint(result)\n\n\t\t\t \t \t\t \t\t \t\t \t \t\t\t\t \t\t\t \t", "n = int(input())\nanimals = input()\n\nnum_hamsters = animals.count('H')\n\nmin_swaps = float('inf')\n\nfor i in range(n):\n num_swaps = 0\n for j in range(num_hamsters):\n if animals[(i + j) % n] != 'H':\n num_swaps += 1\n min_swaps = min(min_swaps, num_swaps)\n\n if min_swaps == 0:\n break\n\nprint(min_swaps)\n\t\t \t \t \t \t\t\t \t \t\t\t\t \t\t\t \t\t \t", "n = int(input())\ns = input().strip()\nans = float('inf')\nh = [0] * (n + 1)\nt = [0] * (n + 1)\n\nfor i in range(1, n + 1):\n h[i] = h[i - 1]\n t[i] = t[i - 1]\n if s[i - 1] == 'H':\n h[i] += 1\n else:\n t[i] += 1\n\nfor i in range(1, n + 1 - h[n] + 1):\n ans = min(ans, t[i + h[n] - 1] - t[i - 1])\n\nfor i in range(1, n + 1 - t[n] + 1):\n ans = min(ans, h[i + t[n] - 1] - h[i - 1])\n\nprint(ans)\n\n \t \t\t \t \t\t\t \t\t \t \t \t\t \t\t", "n = int(input())\nanimals = input()\n\nhamsters_count = animals.count('H')\ntigers_count = n - hamsters_count\n\nmin_swaps = float('inf')\n\nfor start in range(n):\n current_swaps = 0\n for i in range(hamsters_count):\n index = (start + i) % n\n if animals[index] == 'T':\n current_swaps += 1\n \n min_swaps = min(min_swaps, current_swaps)\n\nprint(min_swaps)\n\n \t\t \t\t \t\t\t\t\t\t \t\t\t \t\t \t", "n = int(input())\r\ns = input()\r\nc_h = s.count('H')\r\nans = float('inf')\r\nfor i in range(n):\r\n cur_ans = 0\r\n for j in range(i,i+c_h):\r\n if s[j%n] == 'T':\r\n cur_ans += 1\r\n ans = min(cur_ans, ans)\r\nprint(ans)\r\n", "n = int(input())\r\nc, v = [0] * (n + 1), 0\r\nfor i, ch in enumerate(input()):\r\n c[i + 1] = c[i] + (ch == 'H')\r\nfor i in range(n):\r\n if i + c[n] <= n:\r\n v = max(v, c[i + c[n]] - c[i])\r\n else:\r\n v = max(v, c[n] - c[i] + c[c[n] - (n - i)])\r\nprint(c[n] - v)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import deque,defaultdict\r\n\r\nN = int(input())\r\nS = [c for c in input()]\r\n\r\nans = float(\"inf\")\r\nfor _ in range(N):\r\n SS = S[::]\r\n lib = defaultdict(list)\r\n for i in range(N):\r\n lib[S[i]].append(i)\r\n \r\n cnt = 0\r\n for i in range(N):\r\n if SS[i]!=SS[0]:\r\n j = lib[SS[0]].pop()\r\n if j<=i:break\r\n SS[i],SS[j]=SS[j],SS[i]\r\n cnt+=1\r\n ans = min(ans, cnt)\r\n S = S[1:]+[S[0]]\r\n \r\nprint(ans)\r\n \r\n \r\n", "# your code goes here\nimport sys\nn=int(input())\ns=input()\ns+=s\nh=0\nfor i in range(n):\n\tif s[i]=='H':\n\t\th+=1\nans=h\nfor i in range(n):\n\tc=0\n\tfor j in range(i,i+h):\n\t\tif s[j]=='T':\n\t\t\tc+=1\n\tans=min(ans,c)\nprint(ans)\n\t\n\n\t\n\t\n\t\n\n \t\t \t \t \t\t\t \t \t \t\t \t\t \t \t\t", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\na = s.count('T')\r\ns += s[:a-1]\r\nb = c = s[:a].count('H')\r\nfor i in range(n-1):\r\n if s[i] == 'H':\r\n b -= 1\r\n if s[i+a] == 'H':\r\n b += 1\r\n c = min(c, b)\r\nprint(c)", "n = int(input())\r\ns = input()\r\ns += s\r\ntigers = 0\r\nhamsters = 0\r\nfor i in range(n):\r\n if s[i] == 'T':\r\n tigers += 1\r\n else:\r\n hamsters += 1\r\nanswer = tigers\r\nfor i in range(n):\r\n counter = 0\r\n for j in range(i, i+tigers):\r\n if s[j] == 'H':\r\n counter += 1\r\n if answer > counter:\r\n answer = counter\r\nprint(answer)\r\n \r\n ", "n = int(input())\ns = input() * 2\ncount = s.count(\"H\") // 2\nprint(count - max(s[i:i + count].count('H') for i in range(n)))\n \t\t\t\t \t \t \t \t\t \t \t\t \t", "n = int(input())\r\ns = input()\r\n\r\nsum = s.count('H')\r\nres = 1 << 25\r\nfor i in range(n):\r\n cnt = 0\r\n for j in range(sum):\r\n if s[(i + j) % n] == 'T':\r\n cnt += 1\r\n res = min(res, cnt)\r\nprint(res)" ]

[ "from collections import Counter\r\nn,m=map(int,input().split())\r\narr=[]\r\ntt=0\r\nlstx=[]\r\nwhile(n>0):\r\n\r\n if(tt!=0):\r\n tt+=lstx[-1]\r\n cap = 0\r\n lstt = []\r\n lstx = []\r\n while(cap<m and n>0):\r\n t,x=map(int,input().split())\r\n lstt.append(t)\r\n lstx.append(x)\r\n cap+=1\r\n n-=1\r\n orix=lstx.copy()\r\n lstx=sorted(lstx.copy())\r\n lstt=sorted(lstt.copy())\r\n if(lstt[-1]>tt):\r\n tt+=lstt[-1]-tt\r\n dct=Counter(lstx)\r\n last=0\r\n for key in dct.keys():\r\n tt+=key-last\r\n ans=tt\r\n tt += 1 + (dct[key] // 2)\r\n dct[key]=ans\r\n last=key\r\n arr2=[]\r\n for x in orix:\r\n arr2.append(dct[x])\r\n arr.extend(arr2.copy())\r\n\r\nprint(*arr)\r\n", "import sys\nfrom heapq import *\ndef solve():\n n,m = map(int, input().split())\n waiting = []\n for i in range(n):\n ti, xi = map(int, input().split())\n heappush(waiting, (ti, xi, i))\n res = [None] * n\n curtime, curloc = 0, 0\n while True:\n if len(waiting) == 0: break\n bus = []\n lasttime = 0\n while len(bus) < m and len(waiting) > 0:\n firstinline = heappop(waiting)\n heappush(bus, (firstinline[1], firstinline[2]))\n lasttime = firstinline[0]\n curtime = max(lasttime, curtime)\n while len(bus) > 0:\n curleave = heappop(bus)\n count = 1\n newloc = curleave[0]\n traveled = newloc - curloc\n curtime += traveled\n res[curleave[1]] = curtime\n curloc = newloc\n while len(bus) > 0 and bus[0][0] == curleave[0]:\n count+=1\n curleave = heappop(bus)\n res[curleave[1]] = curtime\n curtime += (count // 2) + 1\n curtime += curloc\n curloc = 0\n print(' '.join(map(str, res)))\n\n\nif sys.hexversion == 50594544 : sys.stdin = open(\"test.txt\")\nsolve()", "n, m = map(int, input().split())\nw, T = [0]*n, 0\nfor i in range(0, n, m):\n\tl = dict()\n\tmt = 0\n\tfor s in range(i, min(n, m+i)):\n\t\tt, x = map(int, input().split())\n\t\tl.setdefault(x, []).append(s)\n\t\tmt = max(mt, t)\n\tT = max(T, mt)\n\tp = 0\n\tfor x in sorted(l):\n\t\tT += (x-p)\n\t\tp = x\n\t\tfor s in l[x]:\n\t\t\tw[s] = T\n\t\tT += 1+len(l[x])//2\n\tT += p\nprint(' '.join(map(str, w)))\n", "n,m=map(int,input().split())\r\nti=[]\r\nxi=[]\r\nfor _ in range(n):\r\n t,x=map(int,input().split())\r\n ti.append(t)\r\n xi.append(x)\r\nt=0\r\nfor k in range(0,n,m):\r\n maxt=max(ti[min(n,k+m)-1],t)\r\n dicti={}\r\n for j in range(k,min(n,k+m)):\r\n dicti[xi[j]]=dicti.get(xi[j],0)+1\r\n dicti=dict(sorted(dicti.items()))\r\n t=maxt\r\n last=0\r\n for i in dicti:\r\n t=t+(i-last)\r\n val=dicti[i]\r\n dicti[i]=t\r\n t=t+1+val//2\r\n last=i\r\n t=t+last\r\n for j in range(k,min(n,k+m)):\r\n print(dicti[xi[j]],end=\" \")\r\n \r\n \r\n \r\n" ]

[ "n = int(input())\r\narr = [None] * n\r\nL = list(map(int, input().split()))\r\n\r\nfor k, v in enumerate(L):\r\n arr[v - 1] = k\r\n\r\nres = 0\r\nfor i in range(n - 1):\r\n res += abs(arr[i] - arr[i + 1])\r\nprint(res)\r\n", "# https://codeforces.com/contest/612/problem/B\r\n\r\nn = int(input())\r\nf = list(map(int, input().split()))\r\nf_inv = [-1] * len(f)\r\nfor i in range(n):\r\n f_inv[f[i] - 1] = i\r\nprint(sum(abs(f_inv[i + 1] - f_inv[i]) for i in range(n - 1)))\r\n", "n = int(input())\r\nf = [0] * n\r\nx = list(map(int, input().split()))\r\n\r\nfor i, e in enumerate(x):\r\n f[e - 1] = i\r\nans = 0\r\nfor i in range(1, n):\r\n ans += abs(f[i] - f[i - 1])\r\nprint(ans)\r\n", "n=int(input())\r\ns={}\r\nfor a,b in enumerate(map(int,input().split())):\r\n s[b]=a\r\nprint(sum([abs(s[i]-s[i+1])for i in range(1,n)]))", "n=int(input())\nL=[int(x) for x in input().split()]\npos=[0]*n\nfor i in range(n):\n pos[L[i]-1]=i\nans=0\nfor i in range(n-1):\n ans+=abs(pos[i]-pos[i+1])\nprint(ans)\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ndc = {x:i for i, x in enumerate(lst)}\r\nres, pos = 0, dc[1]\r\nfor i in range(2, n+1):\r\n nextPos = dc[i]\r\n res += abs(pos-nextPos)\r\n pos = nextPos\r\nprint(res)", "n = int(input())\na = [int(i) for i in input().split()]\nb = [0 for i in range(n)]\nfor i, j in enumerate(a):\n b[j-1] = i\nsum = 0\nfor i in range(1, n):\n sum += abs(b[i]-b[i-1])\nprint(sum)\n\n", "n = int(input())\r\n\r\npos = [0] * (n+1)\r\n\r\nfor idx, num in enumerate(map(int, input().split())):\r\n pos[num] = idx\r\n\r\ncount = 0\r\n\r\nfor a, b in zip(pos[1:], pos[2:]):\r\n count += abs(a-b)\r\n\r\nprint(count)", "n = int(input())\r\nf = list(map(int, input().split()))\r\na = [None] * n\r\nfor i in range(n):\r\n a[f[i] - 1] = i\r\nans = sum(abs(a[i] - a[i - 1]) for i in range(1, n))\r\nprint(ans)\r\n", "n, s = int(input()), 0\r\nar = [(int(value), index + 1) for index, value in enumerate(input().split())]\r\nar.sort()\r\nfor x in range(n - 1):\r\n s += abs(ar[x + 1][1] - ar[x][1])\r\nprint(s)\r\n", "import math\nn = int(input())\nlst = []\nlst = [int(i) for i in input().split(' ')] #直接作为整数读入到列表中\n\nmp = {}\nfor i in range(0,len(lst)):\n mp[lst[i]] = i\npre = mp[1]\nnow = 0\nans = 0\nfor i in range(2,n+1):\n now = mp[i]\n ans += abs(now - pre)\n pre = now\nprint (ans)\n\n\n\n\n\n\n\n\n\n\n\n \n\n \t\t\t \t\t \t \t \t \t \t\t \t\t \t", "n=int(input())\r\nd=list(map(int,input().split()))\r\nl=[-1]*n\r\ns=0\r\nfor i in range(n):\r\n l[d[i]-1]=i\r\nfor i in range(1,n):\r\n s+=abs(l[i]-l[i-1])\r\nprint(s)", "#For fast I/O\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\n#For convenience, subtract the fragment number by 1 for all fragments\r\n\r\nn = int(input())\r\n\r\n#l_sec[i] is the fragment at sector i\r\nl_sec = [int(i)-1 for i in input().split()]\r\n\r\n#l_frag[i] is the sector of fragment i\r\nl_frag = [0 for i in range(n)]\r\nfor i in range(n):\r\n\tl_frag[l_sec[i]] = i #Sector i has frag l_sec[i] -> frag at l_sec[i] at sector i\r\n\r\n#Total distance needed\r\nans = 0\r\nfor i in range(n-1):\r\n\tans += abs(l_frag[i+1]-l_frag[i])\r\n\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx={}\r\n\r\nfor idx,val in enumerate(a):\r\n x[val]=idx\r\n\r\ny=0\r\nfor n in range(2,n+1):\r\n y=y + abs( x[n]- x[n-1] )\r\n\r\n\r\nprint (y)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmap = dict()\r\n\r\nfor idx, v in enumerate(arr):\r\n map[v] = idx + 1\r\n\r\nans = 0\r\n\r\nfor i in range(2, n + 1):\r\n ans += abs(map[i] - map[i - 1])\r\n\r\nprint(ans)\r\n", "def bill(lst):\r\n ln=len(lst)\r\n v=[0]*(ln+1)\r\n tmp=1\r\n for i in lst:\r\n v[i]=tmp\r\n tmp+=1\r\n ans=0\r\n for i in range(2, ln+1):\r\n ans+=abs(v[i]-v[i-1])\r\n lst.sort()\r\n for i in range(1,ln+1):\r\n if i!=lst[i-1]:\r\n return -1\r\n return ans\r\n\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\nprint(bill(lst))\r\n", "n = int(input())\r\na=list(map(int,input().split()))\r\ndict ={}\r\nfor i,x in enumerate(a):\r\n dict[x-1] = i\r\nprint(sum(abs(dict[i]-dict[i-1]) for i in range(1,n))) \r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nt=0\r\nm=[0]*n\r\nfor i in range(n):\r\n\tm[a[i]-1]=i+1\r\nfor i in range(n-1):\r\n\tt+=abs(m[i]-m[i+1])\r\nprint(t)", "n, t = int(input()), 0\r\nx = sorted([(int(i), j) for i,j in zip(input().split(), range(n))], key = lambda x: x[0])\r\nfor i in range(n - 1):\r\n t += abs(x[i][1] - x[i+1][1])\r\nprint(t)\r\n", "import sys, math\r\ninput=sys.stdin.readline\r\nINF=int(1e9)+7\r\n\r\ndef solve(): \r\n n=int(input())\r\n data=list(map(int,input().split()))\r\n result=[0]*(n+1)\r\n for i in range(n):\r\n result[data[i]]=i\r\n ans=0\r\n for i in range(1,n):\r\n ans+=abs(result[i+1]-result[i])\r\n print(ans)\r\n \r\n \r\nt=1\r\nwhile t:\r\n t-=1\r\n solve()\r\n", "##n,p,q=map(int,input().split())\r\n##\r\n##s=input()\r\n##\r\n##l=list()\r\n##\r\n##while len(s):\r\n## if len(s)%p!=0 and len(s)>=q:\r\n## l.append(s[0:q])\r\n## s=s[q:]\r\n## elif len(s)%p==0 and len(s)>=p:\r\n## l.append(s[0:p])\r\n## s=s[p:]\r\n## else:\r\n## break\r\n##if len(s):\r\n## print(-1)\r\n##else:\r\n## print(len(l))\r\n## for x in l:\r\n## print(x)\r\n\r\nn=input()\r\ns=list(input().split())\r\n\r\ni=1\r\nl=list()\r\nfor x in s:\r\n l.append((int(x),i))\r\n i+=1\r\nl.sort()\r\nans=0\r\nfor i in range(1,len(l)):\r\n ans+=abs(l[i][1]-l[i-1][1])\r\n \r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nloc = { x-1 : p for p, x in enumerate(a) }\r\nat = loc[0]\r\nans = 0\r\nfor nxt in range(1, n):\r\n ans += abs(loc[nxt]-at)\r\n at = loc[nxt]\r\nprint(ans)\r\n", "n = int(input())\r\nf = list(map(int, input().split()))\r\nf2 = list(range(n))\r\nfor i in range(n):\r\n f2[f[i] - 1] = i\r\nsum = 0\r\nfor i in range(0, n - 1):\r\n sum += abs(f2[i] - f2[i + 1])\r\nprint(sum)\r\n", "n = int(input())\r\na = [int(x) - 1 for x in input().split()]\r\noccs = [0] * n\r\nfor i in range(n):\r\n occs[a[i]] = i\r\n\r\ntime = 0\r\nfor i in range(1, n):\r\n time += abs(occs[i] - occs[i-1])\r\nprint(time)\r\n", "a=int(input())\r\nd=dict()\r\nfor i,j in enumerate(map(int,input().split())):d[j]=i\r\nprint(sum(abs(d[i]-d[i+1]) for i in range(1,a)))", "n=int(input())\r\nf=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(n):\r\n t.append((f[i],i))\r\nt=sorted(t,key=lambda x:x[0])\r\nans=0\r\nfor i in range(1,n):\r\n ans+=abs(t[i][1]-t[i-1][1])\r\nprint(ans)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nfor i in range(n):\r\n data[i] = [data[i], i + 1]\r\ndata.sort()\r\nans = 0\r\nfor i in range(1, n):\r\n ans += abs(data[i][1] - data[i - 1][1])\r\nprint(ans)", "n = int(input())\r\nfragments = [int(x) for x in input().split(' ')]\r\nindexedFragments = {}\r\ntime = 0\r\nindexes = []\r\n\r\nfor i in range(len(fragments)):\r\n\tindexedFragments[fragments[i]] = i\r\n\r\nstartPosIndex = indexedFragments[1]\r\n\r\nfor part in range(1, n+1):\r\n\tnextPartIndex = indexedFragments[part]\r\n\ttime += abs(startPosIndex - nextPartIndex)\r\n\tstartPosIndex = nextPartIndex\r\nprint(time)", "n = int(input())\r\nf = list(map(int, input().split()))\r\na = [0] * (n + 1)\r\nfor i in range(n):\r\n a[f[i]] = i + 1\r\nres = 0\r\nfor i in range(1, n):\r\n res += abs(a[i + 1] - a[i])\r\nprint(res)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nm = dict()\r\n\r\nfor j, i in enumerate(l):\r\n m[i] = j+1\r\n\r\nans = 0\r\nx = m[1]\r\nfor i in range(2, n+1):\r\n ans += abs(m[i]-x)\r\n x = m[i]\r\n\r\nprint(ans)\r\n", "import sys\r\ninput=sys.stdin.readline\r\ndef main():\r\n\tn=int(input())\r\n\tl=[-1]+list(map(int,input().split()))\r\n\tfr=[0]*(n+1)\r\n\tfor i in range(1,n+1):\r\n\t\tfr[l[i]]=i\r\n\tans=0\r\n\tfor i in range(2,n+1):\r\n\t\tans+=abs(fr[i]-fr[i-1])\r\n\tprint(ans)\r\nmain()", "n = int(input())\r\nx = list(map(int,input().split()))\r\nfor i in range(n):\r\n x[i] = [x[i]] + [i]\r\n \r\nx.sort()\r\nres = 0\r\nfor i in range(n - 1):\r\n res += abs(x[i][1] - x[i+1][1])\r\nprint(res)", "import sys\r\nfrom math import *\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\ndef mint():\r\n\treturn int(minp())\r\n\r\ndef mints():\r\n\treturn map(int, minp().split())\r\n\r\nn = mint()\r\na = [0]*n\r\nj = 0\r\nfor i in mints():\r\n\ta[i-1] = j\r\n\tj += 1\r\nr = 0\r\nfor i in range(1,n):\r\n\tr += abs(a[i]-a[i-1])\r\nprint(r)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * (n + 1)\r\nfor i, x in enumerate(a):\r\n\tb[x] = i\r\nprint(sum([abs(b[i] - b[i - 1]) for i in range(2, n + 1)]))\r\n\r\n", "import sys\r\nn=int(sys.stdin.readline())\r\nl=list(map(int,sys.stdin.readline().split()))\r\nk=0\r\nq=0\r\nz=[0]*n\r\nfor i in range(n):\r\n z[l[i]-1]=i\r\nans=0\r\nwhile k<n-1:\r\n ans+=abs(z[k]-z[k+1])\r\n k+=1\r\nprint(ans)", "import math\r\n\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n a = [0] + [int(i) for i in input().split(\" \")]\r\n hash_a = [0 for i in range(n + 1)]\r\n for i in range(len(a)):\r\n hash_a[a[i]] = i\r\n if a[i] == 1:\r\n current_index = i\r\n\r\n counter = 0\r\n #print(hash_a)\r\n for i in range(1, n + 1):\r\n counter += abs(hash_a[i] - current_index)\r\n #print(current_index, hash_a[i])\r\n current_index = hash_a[i]\r\n print(counter)\r\n\r\n\r\nmain_function()\r\n\r\n\r\n", "n = int(input())\r\n\r\nc = [0 for i in range(n)]\r\n\r\nf = list(map(lambda x: int(x) - 1, input().split()))\r\n\r\nfor i in range(n):\r\n c[f[i]] = i\r\n\r\nsum = 0\r\nfor i in range(n - 1):\r\n sum += abs(c[i] - c[i + 1])\r\n\r\nprint(sum)\r\n", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Mon Jun 22 12:53:15 2020\n\n@author: shailesh\n\"\"\"\n\nn = int(input())\n\nA = [int(i) for i in input().split()]\n\n\nfin_list = list(enumerate(A))\n\n#fin_list = list(zip(A,nums))\n\nfin_list.sort(key = lambda x: x[1])\n\ntot_sum = 0\nfor i in range(n-1):\n val = abs(fin_list[i+1][0] - fin_list[i][0])\n tot_sum += val\n# print(val)\n\n\nprint(tot_sum)", "import collections\r\nn=int(input())\r\nl=[int(i) for i in input().split()]\r\nd={}\r\nfor i in range(n):\r\n d[l[i]]=i\r\nd=dict(collections.OrderedDict(sorted(d.items())))\r\ns=0\r\nfor i in range(1,n):\r\n s+=abs(d[i+1]-d[i])\r\nprint(s)", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\n\r\nd = dict()\r\n\r\nfor i in range(n):\r\n d[a[i]] = i\r\n \r\ns = 0\r\nfor i in range(1, n):\r\n s += abs(d[i+1] - d[i])\r\nprint(s)", "n = int(input())\nnumbers = [int(x)-1 for x in input().split()]\n\nposition = [0] * n\n\nfor i in range(0, n):\n\tposition[numbers[i]] = i\n\nres = 0\n\nfor i in range(1, n):\n\tres += abs(position[i-1] - position[i])\n\nprint(res)\n", "def main():\n n = int(input())\n l = list(map(int, input().split()))\n d = {}\n\n for i in range(1, n + 1):\n d.update({l[i - 1]:i})\n\n last = -1\n answer = 0\n for element in d:\n if last == -1:\n last = d.get(element)\n else:\n el = d.get(element)\n answer += abs(last - el)\n last = el\n\n print(answer)\n\n\nif __name__ == \"__main__\":\n main()", "try:\r\n t=int(input())\r\n a=list(map(int,input().split(\" \")))\r\n c=[0]*(t+1)\r\n p=0\r\n for i in range(0,len(a)):\r\n c[a[i]]=i\r\n for i in range(1,len(c)-1):\r\n p+=abs(c[i]-c[i+1])\r\n print(p)\r\n \r\n \r\n \r\n \r\n \r\n \r\nexcept:\r\n pass", "n=int(input())\r\nm=input().split()\r\nl=[]\r\nfor i in range(n):\r\n l.append([int(m[i]),i])\r\nl.sort()\r\nstep=0\r\nfor i in range(1,n):\r\n step+=abs(l[i][1]-l[i-1][1])\r\nprint(step)\r\n \r\n", "\r\ndef main():\r\n buf = input()\r\n n = int(buf)\r\n buf = input()\r\n buflist = buf.split()\r\n f = list(map(int, buflist))\r\n f = list(map(lambda x: x-1, f)) # zero indexing\r\n s = []\r\n for i in range(n):\r\n s.append(i)\r\n s = [z for _, z in sorted(zip(f, s), key=lambda pair: pair[0])]\r\n f = list(sorted(f))\r\n t = 0\r\n for i in range(len(s)-1):\r\n t += abs(s[i] - s[i+1])\r\n print(t)\r\n\r\nif __name__ == \"__main__\":\r\n main()\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\ndef read_list():\n return [int(i) for i in input().split()]\ndef new_list(n):\n return [0 for i in range(n)]\n\n\n\nn = int(input())\na = read_list()\n\npos = new_list(n)\n\nfor i in range(n):\n pos[a[i]-1] = i\n\ns = 0\n\nfor i in range(1, n):\n s += abs(pos[i]-pos[i-1])\n\nprint(s)\n", "R = lambda : map(int, input().split())\nn = int(input())\nv = list(R())\nd = {}\n\nfor i in range(n):\n d[v[i]] = i\n\nc = 0\nfor i in range(2,n+1):\n c += abs(d[i]-d[i-1])\n\nprint(c)", "\r\nN = int(input())\r\n\r\nt = input().strip().split(' ')\r\n\r\nt = [int(i) for i in t]\r\n\r\nfragmentToSector = [0]*N\r\n\r\nfor i in range(0,N):\r\n fragment = t[i]\r\n fragmentToSector[fragment-1]=i+1\r\n\r\ntotal=0\r\nfor i in range(1,N):\r\n total+=abs(fragmentToSector[i] - fragmentToSector[i-1])\r\n \r\nprint(total)", "input()\r\nsum = 0\r\nfor i,j in sorted(list(enumerate(map(int,input().split()))),key = lambda elem:elem[1]):\r\n if j!=1:\r\n sum += abs(oldi-i)\r\n oldi = i\r\nprint(sum)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(enumerate(map(int, input().split())), key=lambda x:x[1])\r\nc = 0\r\nfor i in range(n-1):\r\n c += abs(w[i+1][0] - w[i][0])\r\nprint(c)", "n,a,data,b,sum = int(input()),[],input(),1,0\r\nfor i in range(n+2):\r\n a.append(0)\r\nfor i in data.split():\r\n a[int(i)] = b\r\n b+=1\r\nfor i in range(2,n+1):\r\n sum+=abs(a[i-1]-a[i])\r\nprint(sum)", "n = int(input())\nfrag = [int(i) for i in input().split(\" \")]\n\ncurr = 0\n\npos = {}\n\nfor i in range(len(frag)):\n pos[frag[i] - 1] = i\n\nposAtual = pos[0]\ndistTotal = 0\n\nwhile(curr != n - 1):\n curr += 1\n proxPos = pos[curr]\n\n if(posAtual > proxPos):\n distTotal += posAtual - proxPos\n else:\n distTotal += proxPos - posAtual\n \n posAtual = proxPos\n\n \n\nprint(distTotal)\n \n\n\t \t \t\t \t\t \t \t \t\t\t \t\t\t \t", "def solve(fn):\r\n pos = {}\r\n\r\n for i,e in enumerate(fn):\r\n pos[e] = i\r\n\r\n res = 0\r\n for i in range(1, len(fn)):\r\n res += abs(pos[i] - pos[i+1])\r\n return res\r\n\r\ninput()\r\nprint(solve(tuple(map(int, input().split()))))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nlst = []\r\nfor i in range(n):\r\n lst.append([a[i], i])\r\nlst.sort()\r\ncnt = 0\r\nfor i in range(n-1):\r\n cnt += (abs(lst[i][1]-lst[i+1][1]))\r\nprint(cnt)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ndp = {l[i]:i+1 for i in range(n)} \r\ns = 0\r\ndp[0] = dp[1]\r\nfor i in range(1,n+1):\r\n\ts = s + abs(dp[i]-dp[i-1])\r\nprint(s)\r\n", "N=int(input())\r\na=list(map(int,input().split()))\r\nx={}\r\nfor i in range(N):\r\n x[a[i]]=i+1\r\nprint(sum(abs(x[i]-x[i-1]) for i in range(2,N+1)))\r\n", "n = int(input())\r\nar = list(map(int, input().split()))\r\nl = []\r\nfor i in range(n):\r\n l.append((ar[i], i + 1))\r\n\r\nl.sort()\r\ns = 0\r\nfor x in range(n - 1):\r\n s += abs(l[x + 1][1] - l[x][1])\r\n\r\nprint(s)\r\n", "size=int(input());ar=[0]*int(2e5+5);l=input().split()\r\nfor i in range(size):\r\n ar[int(l[i])]=i\r\nres=0\r\nfor i in range(1,size):\r\n res+=(abs(ar[i]-ar[i+1]))\r\nprint(res)", "import math\nimport sys,string\ninput=sys.stdin.readline\nimport random\nfrom collections import deque,defaultdict\nimport bisect\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nd=defaultdict(int)\nn=I()\nl=L()\nc=0\nfor i in l:\n d[i]=c\n c+=1\np=d[1]\nans=0\nfor i in range(2,n+1):\n ans+=abs(p-d[i])\n p=d[i]\nprint(ans)\n", "import sys\n#fin = open(\"ecr4b.in\", \"r\")\nfin = sys.stdin\n\nn = int(fin.readline())\nfile = [None] * n\ndisk = tuple(map(int, input().split()))\nfor i in range(n):\n file[disk[i] - 1] = i\nctime = 0\nfor i in range(1, n):\n ctime += abs(file[i] - file[i - 1])\nprint(ctime)", "import sys\nfrom os import path\nfrom collections import Counter\ndef get_int():\n return int(sys.stdin.readline())\ndef get_ints():\n return map(int,sys.stdin.readline().strip().split())\ndef get_string():\n return sys.stdin.readline().strip()\n\n \nt = 1\n \nfor _ in range(t):\n n = get_int()\n f = list(get_ints())\n ff = [(f[i],i) for i in range(len(f))]\n ff.sort()\n ans = 0\n for i in range(len(f)-1):\n ans+=abs(ff[i][1]-ff[i+1][1])\n print(ans)\n \n\t \t\t \t\t \t \t\t \t\t \t\t\t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\ndict = {}\r\nfor y in range(n):dict[a[y]]=y\r\nx=dict[1]\r\ns=0\r\nfor k in range(2,n+1):\r\n s+=abs(x-dict[k])\r\n x=dict[k]\r\nprint(s)", "from operator import itemgetter\nfrom itertools import islice\n\nn = int(input())\na = map(int, input().split())\n\n\ndef main(a):\n hdd = sorted(enumerate(a), key=itemgetter(1))\n sectors = [i for i, _ in hdd]\n return sum(abs(a - b) for a, b in zip(sectors, islice(sectors, 1, len(sectors))))\n\n\nprint(main(a))\n", "n = int(input())\nour = list(map(int, input().split()))\n\nplace = dict()\nfor i in range(n):\n place[our[i]] = i\nres = 0\nfor i in range(1, n):\n res += abs(place[i] - place[i + 1])\nprint(res)", "from sys import stdin\nn = int(input())\nd = dict(((int(val), idx) for idx, val in\n enumerate(stdin.read().strip().split())))\na = 1\nt = 0\n# print('at|to|dist|t')\nfor b in range(2, n+1):\n t += abs(d[b] - d[a])\n # print(d[a], d[b], abs(d[b] - d[a]), t)\n a = b\n\nprint(t)\n", "# import sys \r\n# import os\r\n# import time\r\n# from DataStructs import FenwickTree, SegTree, DWGraph\r\nfrom _ast import arg, GtE\r\nwithFile = 0\r\n\r\nif(withFile == 1):\r\n fin = open('input.txt', 'r')\r\n fout = open('output.txt', 'w')\r\n\r\ndef getl():\r\n global withFile\r\n if(withFile == 0):\r\n return input()\r\n else:\r\n return fin.readline()\r\n \r\ndef printl(s):\r\n global withFile\r\n if(withFile == 0):\r\n print(s)\r\n else:\r\n fout.write(str(s))\r\n\r\ndef get_arr():\r\n global withFile\r\n x = getl().split(' ')\r\n if(x[-1] == ''):\r\n x.pop()\r\n return list(map(int, x))\r\n\r\nif __name__ == '__main__':\r\n# die(12)\r\n n = get_arr()[0]\r\n a = sorted([[x, i] for i, x in enumerate(get_arr())])\r\n res = 0\r\n for i in range(1, len(a)):\r\n res += abs(a[i][1] - a[i-1][1])\r\n print(res)\r\n \r\nif(withFile == 1):\r\n fin.close()\r\n fout.close()", "n, v = int( input() ), list( map(int, input().split() ) )\nid = [0] + [0 for _ in range(n)]\nfor i, vi in enumerate(v):\n id[vi] = i\nprint(sum(abs(id[i] - id[i - 1]) for i in range(2, len(id))))\n", "n = int(input())\nf = []\n\ntemp = map(int, input().split())\nfor i, x in enumerate(temp):\n f.append((x, i))\n\nf.sort()\n\nacc = 0\nfor i in range(1, n):\n acc += abs(f[i-1][1] - f[i][1])\n\nprint(acc)\n \t \t\t\t \t\t \t\t \t \t\t\t\t", "input()\r\nl = list(map(int, input().split()))\r\nans = 0\r\nl2 = [0]*int(2e5+5)\r\nfor i in range(len(l)):\r\n l2[l[i]] = i+1\r\nfor i in range(1, len(l)):\r\n ans += abs(l2[i]-l2[i+1])\r\nprint(ans)\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\na = [-1] * n\r\nfor i in range(n):\r\n a[m[i] - 1] = i + 1\r\ns = 0\r\nfor i in range(n - 1):\r\n s += abs(a[i] - a[i + 1])\r\nprint(s)", "n = int(input())\ng = [-1]*(n+1)\n\ni = 1\nfor e in map(int, input().split()):\n g[e] = i\n i += 1\n\n_sum = 0\nfor i in range(1, n):\n _sum += abs(g[i+1]-g[i])\n\nprint(_sum)\n", "n = int(input())\nfragments = tuple(int(x) for x in input().split())\n\ndef solve(n, fragments):\n nfs = sorted([(fragments[n], n) for n in range(n)])\n result = sum(abs(nfs[i][1] - nfs[i - 1][1]) for i in range(1, n))\n print(result)\n\nsolve(n, fragments)\n", "n = int(input())\nnums = [int(x) for x in input().split() ]\npos = [0]*(n+1)\nfor i in range(n):\n\tpos[nums[i]]=i\nans = 0\nfor i in range(1,n):\n\tans += abs(pos[i]-pos[i+1])\nprint(ans)\n\n\t\t\t\t \t \t\t\t\t \t\t\t\t\t\t\t\t \t\t \t", "n=int(input())\r\na=list(map(int,input().split()))\r\nx={}\r\n\r\nfor idx,val in enumerate(a):\r\n x[val]=idx\r\n\r\ny=0\r\n\r\nprint (sum (abs( x[n]-x[n-1]) for n in range(2,n+1)))\r\n\r\n", "n = int(input())\r\nnum = list(map(int, input().split()))\r\nl=[]\r\nfor i , num in enumerate(num):\r\n l.append([num,i])\r\n\r\nl = sorted(l)\r\nans=0\r\nfor i in range(len(l)-1):\r\n ans += abs(l[i][1] - l[i+1][1])\r\nprint(ans)", "a,b,t=int(input()),list(map(int,input().split())),0\r\nc=[0]*a\r\nfor i in range(a):c[b[i]-1]=i\r\nfor i in range(a-1):t+=abs(c[i]-c[i+1])\r\nprint(t)", "\nfragment_count = int(input())\n\nline = input()\nfragments = []\n\nfragments = [int(i) for i in line.split()]\n\nplaces = [0 for i in range(fragment_count)]\n\nfor index, frag in enumerate(fragments):\n places[frag - 1] = index\n\n\ntotal_sum = 0\nindex = 0\nfor i in places:\n if index == len(places) - 1:\n break\n total_sum = total_sum + abs(i - places[index + 1])\n index = index + 1\n\n\nprint(total_sum)\n", "# Input starts.\r\nn = int(input())\r\nf = [int(s) for s in str(input()).split()]\r\n\r\n# print('n', n)\r\n# print('f', f)\r\n\r\n# Input ends.\r\n\r\n# Solution starts.\r\nsortedF = [None] * n\r\nfor i in range(n):\r\n sortedF[f[i] - 1] = i\r\n\r\n# print('sortedF', sortedF)\r\n\r\nmoves = 0\r\nfor i in range(n - 1):\r\n moves += abs(sortedF[i + 1] - sortedF[i])\r\nprint(moves)\r\n\r\n# print('moves', moves)\r\n\r\n# Solution ends.", "_ = input()\r\nnums = list(map(int, input().split()))\r\nindex = {}\r\n\r\nfor i in range(len(nums)):\r\n\tindex[nums[i]] = i\r\n\r\nans = 0\r\nfor i in range(2, len(nums) + 1):\r\n\tans += abs(index[i] - index[i-1])\r\nprint(ans)", "n = int(input())\nnums = [int(i) for i in input().split()]\nhmap = {}\nfor i in range(len(nums)):\n hmap[nums[i]] = i\nnums.sort()\nans = 0\nfor i in range(len(nums) - 1):\n ans += abs(hmap[nums[i]] - hmap[nums[i + 1]])\nprint(ans)\n", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nN=int(readline())\r\nF=list(map(int,readline().split()))\r\nfor i in range(N):\r\n F[i]-=1\r\nidx=[None]*N\r\nfor i in range(N):\r\n idx[F[i]]=i\r\nans=sum(abs(idx[i+1]-idx[i]) for i in range(N-1))\r\nprint(ans)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nd,res={},0\r\nfor i,x in enumerate(lst):\r\n d[x]=i\r\nk=d[1]\r\nfor i in range(1,n+1):\r\n res+=abs(d[i]-k)\r\n k=d[i]\r\nprint(res)", "n = int(input())\r\nd = {}\r\n\r\nfor i,f in enumerate(map(int, input().split())):\r\n d[f] = i\r\n\r\nprint(sum(abs(d[i]-d[i+1]) for i in range(1,n)))", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n\td[a[i]]=i+1\r\ns=0\r\nc=d[1]\r\nfor i in range(1,n):\r\n\tx=d[i+1]\r\n\ts+=abs(x-c)\r\n\tc=x\r\nprint(s)\r\n", "n=int(input())\npos=[0]*n\nf=list(map(int,input().split()))\nfor i in range(n):\n pos[f[i]-1]=i\ntime=0\nfor i in range(n-1):\n time+=abs(pos[i+1]-pos[i])\nprint(time)\n \t\t \t\t \t \t\t \t \t\t\t \t\t\t\t", "n=int(input())\r\nf=list(map(int,input().split()))\r\n\r\npos=[None]*n\r\nfor i in range(n):\r\n\tpos[f[i]-1]=i\r\nsum=0\r\nfor i in range(n-1):\r\n\tsum+=abs(pos[i]-pos[i+1])\r\nprint(sum)", "n = int(input())\r\nf = list(map(int, input().split()))\r\nx = [0] * n\r\nfor i in range(n):\r\n x[f[i] - 1] = i\r\nans = 0\r\nfor i in range(n - 1):\r\n ans += abs(x[i] - x[i + 1])\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nli={}\r\nfor i in range(n):\r\n li[a[i]]=i+1\r\nb=list(li.keys())\r\nb.sort()\r\nfi=li[b[0]]\r\nfor i in b[1:len(b)]:\r\n diff=(li[i]-fi)\r\n if diff<0:\r\n diff=-diff\r\n else:\r\n pass\r\n ans+=diff\r\n fi=li[i]\r\nprint(ans)", "n, f = int(input()), list(map(int, input().split()))\r\npos = [-1] * n\r\nfor i in range(n):\r\n pos[f[i] - 1] = i\r\nans = 0\r\nfor i in range(n - 1):\r\n ans += abs(pos[i] - pos[i + 1])\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\np=[0]*n\r\nfor i in range(n):\r\n p[a[i]-1]=i+1\r\ns=0\r\nfor i in range(n-1):\r\n s+=abs(p[i]-p[i+1])\r\nprint(s)\r\n", "import sys\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\ncounter = Counter()\r\n\r\nfor i, x in enumerate(a):\r\n if x-1 in counter:\r\n ans += i - counter[x-1]\r\n if x+1 in counter:\r\n ans += i - counter[x+1]\r\n\r\n counter[x] = i\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\nM=[-1]*n\r\ns=0\r\nfor i in range(0,len(L)):\r\n\tM[L[i]-1]=i\r\nfor i in range(1,len(M)):\r\n\ts+=abs(M[i]-M[i-1])\r\nprint(s)\r\n", "#!/usr/bin/env python3\n\nn = int(input())\nf = list(map(int, input().split()))\nff = [0] * n\n\nfor i, e in enumerate(f):\n ff[e - 1] = i\n\nresult = sum(abs(ff[i + 1] - ff[i]) for i in range(n - 1))\nprint(result)\n", "n = int(input())\r\ns=input()\r\ns=s.split()\r\nd={}\r\nfor i in range(len(s)):\r\n d[int(s[i])-1]=i\r\nsu=0\r\nfor i in range(1,n):\r\n su+=abs(d[i-1]-d[i])\r\nprint(su)\r\n \r\n", "import sys\r\ninput = sys.stdin.readline \r\n\r\nn = int(input()) \r\nb = list(map(int, input().split())) \r\nl = [] \r\nfor i in range(n):\r\n l.append([b[i], i + 1]) \r\nl.sort() \r\nans = 0 \r\n\r\nfor i in range(1, n):\r\n ans += abs(l[i][1] - l[i - 1][1]) \r\nprint(ans)", "n=int(input())\r\nL=[int(x) for x in input().split()]\r\npos=[0]*n\r\nfor i in range(n):\r\n pos[L[i]-1]=i\r\nans=0\r\nfor i in range(n-1):\r\n ans+=abs(pos[i]-pos[i+1])\r\nprint(ans)", "n = int(input())\r\nlocation = {int(val): i for i, val in enumerate(input().split())}\r\nresult = sum((abs(location[i] - location[i-1]) for i in range(2, n+1)))\r\nprint(result)\r\n", "n=int(input())\r\nthing=input().split(' ')\r\n\r\nl=[]\r\nfor i in range (n):\r\n l.append(int(thing[i]))\r\n\r\nm=[-1]*n\r\n\r\nfor i in range (n):\r\n m[l[i]-1]=i\r\n\r\nt=0\r\nfor i in range (n-1):\r\n t+=abs(m[i]-m[i+1])\r\n\r\nprint(t)\r\n", "n = int(input())\r\nx= []\r\nx = input().split()\r\ns ={}\r\nfor i in range(n):\r\n s[int(x[i])] = i\r\nans = 0\r\nfor i in range(2,n+1,1):\r\n if (s.get(i)>s.get(i-1)):\r\n ans = ans + (s.get(i)-s.get(i-1))\r\n else :\r\n ans = ans + (s.get(i-1)-s.get(i))\r\nprint (ans)\r\n\r\n", "n = int(input())\nF = list(map(int, input().split()))\n\nif n == 1:\n print(0)\n exit()\n\nX = []\nfor i, f in enumerate(F):\n X.append((f, i))\n\nX.sort()\nans = 0\nfor i in range(n-1):\n ans += abs(X[i+1][1]-X[i][1])\nprint(ans)\n", "n = int(input())\r\nf = list(map(int, input().split()))\r\nd = {}\r\n\r\nfor i in range(n):\r\n d[f[i]] = i\r\n\r\nans = 0\r\n\r\nfor i in range(1, n):\r\n ans += abs(d[i]-d[i+1])\r\n\r\nprint(ans)\r\n \r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=[-1]*n\r\nfor i in range(n):\r\n b[a[i]-1]=i+1\r\nt=0\r\nfor i in range(n-1):\r\n t+=abs(b[i]-b[i+1])\r\nprint(t)", "n=int(input())\r\na=[];v=[];o=0\r\na=list(map(int,input().split()))\r\nfor i in range(0,n+1):\r\n v.append(0)\r\nfor i in range(n):\r\n v[a[i]]=i+1\r\nfor i in range(1,n):\r\n o+=abs(v[i]-v[i+1])\r\nprint(o)\r\n \r\n", "n=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nl=[]\r\nfor j in range(n):\r\n l.append([lst[j],j])\r\nl.sort(key = lambda x: x[0])\r\nc=0\r\nfor i in range(1,n):\r\n c+=abs(l[i][1]-l[i-1][1])\r\nprint(c)\r\n", "import sys\r\nif False:\r\n\tinp = open('A.txt', 'r')\r\nelse:\r\n\tinp = sys.stdin\r\n\r\nn = int(inp.readline())\r\nsectors = list(zip(map(int, inp.readline().split()), [x+1 for x in range(n)]))\r\n\r\nsectors.sort(key = lambda x: x[0])\r\nans = 0\r\nfor i in range(n-1):\r\n\tans += max(sectors[i][1]-sectors[i+1][1], sectors[i+1][1] - sectors[i][1])\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "k=0\r\n\r\nd = [0] * 200005\r\nx = int(input())\r\np = list(map(int, input().split(' ')))\r\nfor i in range(len(p)):\r\n d[p[i]] = i\r\n\r\nfor i in range(1, x):\r\n k += abs(d[i+1] - d[i])\r\n\r\nprint(k)\r\n", "#!/bin/python3\r\n\r\nfrom itertools import count\r\nimport math\r\nimport os\r\nimport random\r\nimport re\r\nimport sys\r\nfrom collections import Counter\r\n\r\n#\r\n# Complete the 'pickingNumbers' function below.\r\n#\r\n# The function is expected to return an INTEGER.\r\n# The function accepts INTEGER_ARRAY a as parameter.\r\n#\r\n\r\ndef pickingNumbers(a):\r\n # Write your code \r\n l = sorted(enumerate(a), key=lambda i: i[1])\r\n result = 0\r\n n = len(l)\r\n for i in range(1, n):\r\n result+=abs(l[i][0]-l[i-1][0])\r\n return result\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n\r\n a = list(map(int, input().rstrip().split()))\r\n\r\n result = pickingNumbers(a)\r\n print(result)", "import math\n\nn = int(input())\nf = [int(x) for x in input().split()]\nl = list(sorted(enumerate(f), key = lambda x : x[1]))\ns = 0\nfor i in range(1,n):\n s += abs(l[i][0] - l[i-1][0])\nprint(s)\n \n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nd = []\r\nfor i in range(n):\r\n d.append((lst[i], i))\r\nd.sort() \r\ns = 0\r\nfor i in range(1, n):\r\n s += abs(d[i][1] - d[i - 1][1])\r\nprint(s) \r\n \r\n", "n=int(input())\r\na=list(map(lambda x:int(x)-1,input().split()))\r\np=[0]*n\r\nfor i in range(n):\r\n p[a[i]]=i\r\nprint(sum(abs(p[i]-p[i+1]) for i in range(n-1)))", "n = int(input())\r\ns = [ (int(j) , i) for i , j in enumerate(input().split()) ]\r\ns.sort()\r\nans = 0\r\nfor i in range(1,n):\r\n ans += abs(s[i-1][1] - s[i][1])\r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nd={}\r\nmx=max(a)\r\nmn=min(a)\r\nfor i in range(n):\r\n d[a[i]]=i\r\nfor i in range(n):\r\n if mn==mx:\r\n break\r\n c+=abs(d[mn]-d[mn+1])\r\n mn+=1\r\nprint(c)", "n = int(input())\n\nf = list(map(int, input().split()))\n\nf_to_pos = [0] * n\nfor i, fr in enumerate(f):\n f_to_pos[fr-1] = i\n \ntotal = 0\nfor i in range(n-1):\n total += abs(f_to_pos[i] - f_to_pos[i+1])\n \nprint(total)\n", "def dist(n, files):\n locator = dict()\n for i in range(n):\n locator[files[i]] = i\n sum = 0;\n for i in range(1, n):\n sum += abs(locator[i] - locator[i+1])\n print(sum)\ninputs = []\nn = int(input())\nfiles = input().split(' ')\nfor i in range(n):\n files[i] = int(files[i])\ndist(n, files)\n \t \t \t \t\t\t \t\t\t \t \t\t\t \t \t", "import sys\r\nn = int(input())\r\na=list( map(int, input().split()))\r\na = list(enumerate(a))\r\n\r\nfor i in range(0, len(a)):\r\n a[i] = tuple(reversed(a[i]))\r\n\r\na.sort()\r\ncur = a[0][1]\r\nans = 0\r\nfor i in range(1, len(a)):\r\n ans += abs(a[i][1] -cur)\r\n cur = a[i][1]\r\nprint(ans)", "import os\r\n\r\ndef abs(a):\r\n if a > 0:\r\n return a\r\n else :\r\n return -a\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int , input().split()))\r\n b = [0] * n\r\n for i in range(n):\r\n b[a[i] - 1] = i\r\n res = 0\r\n for i in range(1 , n):\r\n res += abs(b[i] - b[i - 1])\r\n print(res)\r\n\r\nmain()", "n = int(input())\r\nvalues = list(map(int,input().split()))\r\n\r\nhm = {}\r\nfor i, v in enumerate(values):\r\n hm[v] = i\r\n \r\nans = 0\r\nfor i in range(1,n):\r\n ans += abs(hm[i+1]-hm[i])\r\n \r\nprint(ans)", "def hdd(n, lst):\r\n res, answer = [0] * n, 0\r\n for i in range(n):\r\n res[lst[i] - 1] = i\r\n for i in range(n - 1):\r\n answer += abs(res[i] - res[i + 1])\r\n return answer\r\n\r\n\r\nm = int(input())\r\na = [int(j) for j in input().split()]\r\nprint(hdd(m, a))\r\n", "n = int(input())\r\na = [0] * n\r\ni = 1\r\nc = 0\r\nfor item in input().split():\r\n a[int(item) - 1] = i\r\n i += 1\r\nfor i in range(n - 1):\r\n c += abs(a[i] - a[i + 1])\r\nprint(c) \r\n", "N = int(input())\r\nA = list(map(int, input().split()))\r\n\r\nD = [0 for _ in range(N)]\r\n\r\nfor i in range(N):\r\n D[A[i] - 1] = i\r\n\r\nres = sum([abs(D[i + 1] - D[i]) for i in range(N - 1)])\r\n\r\nprint(res)", "n = (int)(input())\r\na = (list)(map(int , input().split()))\r\npos = [0 for _ in range(n + 1)]\r\nfor _ in range(n) : pos[a[_]] = _\r\nans = 0\r\nfor index in range(2 , n + 1) :\r\n ans += abs(pos[index] - pos[index - 1])\r\nprint(ans)", "num_fragments=int(input())\nnums=list(map(int,input().split()))\nindexMap={}\nfor x in range(len(nums)):\n indexMap[nums[x]-1]=x\ntotal=0\nfor x in range(1,num_fragments):\n total+=(abs(indexMap[x]-indexMap[x-1]))\nprint(total)\n \t \t \t\t\t \t\t\t\t \t\t \t\t\t\t\t", "n = int(input())\r\nfragments = list(map(int, input().split()))\r\n\r\nfragmentsDict = {}\r\nfor i in range(n):\r\n fragmentsDict[fragments[i]] = i + 1\r\n\r\nres = 0\r\nfor j in range(1, n):\r\n res += abs(fragmentsDict[j] - fragmentsDict[j + 1])\r\nprint(res)", "n= int(input())\narr= list(map(int,input().split()))\nmap={}\nfor i in range(n):\n map[arr[i]]=i+1\nans=0\nfor i in range(1,n):\n ans+=abs(map[i]-map[i+1])\nprint (ans)\n", "fragments = int(input())\r\ndictionary = dict()\r\ntime = 0\r\n\r\nl = input().split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n dictionary[l[i]] = i+1\r\narray = sorted(dictionary.keys())\r\nhead = dictionary[array[0]]\r\nfor i in array:\r\n fragment = i\r\n time += abs(head-dictionary[i])\r\n head = dictionary[i]\r\nprint(time)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [0] * n\r\nfor i in range(n):\r\n b[a[i] - 1] = i\r\nres = 0\r\nfor i in range(1, n):\r\n res += abs(b[i] - b[i - 1])\r\nprint(res)\r\n", "n = int(input())\r\nd = {}\r\nfor i,x in enumerate(input().split()):\r\n x = int(x)\r\n d[x] = i\r\n\r\nres = 0\r\nfor i in range(2,n+1):\r\n res += abs(d[i] - d[i-1])\r\nprint(res)\r\n", "n=int(input());a=list(map(int,input().split()));p=0\r\ni=0;x={}\r\nwhile i<n:x[a[i]]=i;i+=1\r\nwhile n>1:p=p+abs(x[n]-x[n-1]);n-=1\r\nprint(p)", "sz = int(input()) # waste\r\npos = [None] * sz\r\nfor p,i in enumerate(map(int, input().split())):\r\n pos[i-1] = p\r\nlast = pos[0]\r\ntotal = 0\r\nfor i in range(sz):\r\n total += abs(last - pos[i])\r\n last = pos[i]\r\nprint(total)", "n = int(input())\na = list(map(int, input().split()))\nb = sorted(range(n), key=a.__getitem__)\nprint(sum(abs(b[i + 1] - b[i]) for i in range(n - 1)))\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\ndict = {}\r\na = 1\r\nfor i in li:\r\n dict[i] = a\r\n a+=1\r\n \r\nre = sorted(dict.items(), key=lambda x: x[0])\r\n\r\nnw = [dict[i] for i in dict]\r\n\r\nans = 0\r\nfor i in range(1,len(nw)):\r\n ans += abs(nw[i]-nw[i-1])\r\nprint(ans) ", "n = int(input())\r\n\r\narr = list(map(int, input().split()))\r\n\r\nidx = {}\r\nfor i in range(n):\r\n idx[arr[i]] = i + 1\r\n\r\nsec = 0\r\nfor i in range(2, n + 1):\r\n sec += abs(idx[i] - idx[i - 1])\r\n\r\nprint(sec)", "n = int(input())\r\na = [int(i) - 1 for i in input().split()]\r\nb = [0] * n\r\nfor i in range(n):\r\n b[a[i]] = i\r\nprint(sum([abs(b[i] - b[i - 1]) for i in range(1, n)]))", "n = int(input())\r\nf = [int(x) for x in input().split()]\r\n\r\nmain = []\r\nfor i in range(n):\r\n main.append((f[i],i))\r\nmain.sort()\r\n\r\nans = 0\r\nfor i in range(n-1):\r\n ans+=abs(main[i][1]-main[i+1][1])\r\n\r\nprint(ans)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nd = {x: i for i, x in enumerate(arr)}\r\nprint(sum(abs(d[i+1]-d[i]) for i in range(1, n)))", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = [0]*n\r\nfor i in range(n):\r\n b[a[i]-1] = i\r\ns = 0\r\nlast = b[0]\r\nfor i in range(1,n):\r\n s += abs(last-b[i])\r\n last = b[i]\r\nprint(s)\r\n \r\n \r\n " ]

[ "n,p=map(int,input().split())\r\nnums=[0]+list(map(int,input().split()))\r\nmod=10**9+7\r\n\r\nf=[[[[0]*2 for _ in range(2)] for _ in range(2)] for _ in range(n+1)]\r\n\r\n_2=[0]*(n+1)\r\n_2[0]=1\r\nfor i in range(1,n+1):\r\n _2[i]=(_2[i-1]<<1)%mod\r\n \r\nf[0][0][0][0]=1\r\nif nums[1]!=0:\r\n f[1][1][0][1]+=1\r\nif nums[1]!=1:\r\n f[1][1][1][0]+=1\r\n\r\nfor i in range(2,n+1):\r\n for j in range(2):\r\n for ob in range(2):\r\n for ow in range(2):\r\n qwq=f[i-1][j][ob][ow]\r\n if nums[i]!=0:\r\n if ob:\r\n f[i][j][ob][ow]=(f[i][j][ob][ow]+qwq*_2[i-2])%mod\r\n f[i][j^1][ob][ow|1]=(f[i][j^1][ob][ow|1]+qwq*_2[i-2])%mod\r\n else:\r\n f[i][j^1][ob][ow|1]=(f[i][j^1][ob][ow|1]+qwq*_2[i-1])%mod\r\n if nums[i]!=1:\r\n if ow:\r\n f[i][j][ob][ow]=(f[i][j][ob][ow]+qwq*_2[i-2])%mod\r\n f[i][j^1][ob|1][ow]=(f[i][j^1][ob|1][ow]+qwq*_2[i-2])%mod\r\n else:\r\n f[i][j^1][ob|1][ow]=(f[i][j^1][ob|1][ow]+qwq*_2[i-1])%mod\r\n\r\n\r\nans=0\r\nfor i in range(2):\r\n for j in range(2):\r\n ans=(ans+f[n][p][i][j])%mod\r\nprint(ans)\r\n" ]

[ "n = input()\r\ndic = {}\r\nl = list(input().split())\r\nfor x in l:\r\n if x in dic:\r\n dic[x]+=1\r\n else:\r\n dic[x]=1\r\nprint(max(dic.values()))", "n=int(input())\nbox_no=n\nbox=input()\nbox=[int(i) for i in box.split()]\ndic={}\nfor i in box:\n if i not in dic:\n dic[i]=box.count(i)\nm=max(dic,key=dic.get) \nprint(dic[m])\n \t \t\t \t \t\t \t\t \t\t \t\t \t \t\t \t\t", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nd={}\r\nfor i,x in enumerate(lst):\r\n if d.get(x)==None:d[x]=0\r\n d[x]+=1\r\nprint(max(d.values()))", "mp = dict()\r\nn = int(input())\r\nm = 0\r\na = [int(el) for el in input().split()]\r\nfor x in a:\r\n mp[x] = mp.get(x, 0)+1\r\nfor el in mp:\r\n m=max(m,mp[el])\r\nprint(m)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {}\r\nr = 0\r\nfor i in range(n):\r\n d[l[i]] = d.get(l[i],0)+1\r\n r = max(r,d[l[i]])\r\nprint(r)", "n = int(input())\r\na = input().split()\r\nfor i in range(0,n):\r\n a[i] = int(a[i])\r\na.sort()\r\na.append(\"x\")\r\ny = 1\r\ni = 0\r\nwhile i < n-1:\r\n occ = 1\r\n while a[i] == a[i+1]:\r\n occ += 1\r\n i += 1\r\n if occ > y:\r\n y = occ\r\n i += 1\r\nprint(y)", "from collections import defaultdict\r\n\r\nn=int(input())\r\na=sorted(list(map(int,input().split())))\r\n\r\n\r\nd=defaultdict(int)\r\n\r\nfor i in a:\r\n\td[i]+=1\r\n\r\nprint(max(d.values()))\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nd=dict()\r\nfor i in a:\r\n if i not in d.keys():\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\nprint(max(d.values()))", "n = int(input())\nlist1 = [int(n) for n in input().split()]\n\nlist1.sort()\nlist2 = [list1[0]]\n\nfor i in range(1, len(list1)):\n compare = list2[0]\n if(list1[i] > compare):\n list2.pop(0)\n list2.append(list1[i])\n \nprint(len(list2))\n\n \t \t\t \t \t \t\t \t \t \t\t \t\t\t", "\r\n\r\nn = int(input())\r\n\r\narray = list(map(int, input().split()))\r\n\r\ndict = {}\r\nfor x in array:\r\n if x in dict:\r\n dict[x] += 1\r\n else:\r\n dict[x] = 1\r\n\r\narr = list(dict.values())\r\n\r\narr.sort()\r\n\r\nans = 0\r\n\r\nfor x in arr:\r\n y = x - ans\r\n ans += y\r\n\r\nprint(ans)\r\n\r\n", "ln = input()\r\nli = input().split()\r\ndc = {}\r\nfor n in li:\r\n if n in dc:\r\n dc[n] += 1\r\n else:\r\n dc[n] = 1\r\nprint(max(dc.values()))", "\r\nn = int(input())\r\n\r\narray = list(map(int, input().split()))\r\n\r\ndict = {}\r\nfor x in array:\r\n if x in dict:\r\n dict[x] += 1\r\n else:\r\n dict[x] = 1\r\n\r\narr = list(dict.values())\r\n\r\narr.sort()\r\n\r\nprint(arr[len(arr) - 1])\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ndict={}\r\nfor i in range(n):\r\n if a[i] in dict.keys():\r\n dict[a[i]]+=1\r\n else:\r\n dict[a[i]]=1\r\nj=[]\r\nfor i in dict.values():\r\n j.append(i)\r\nj.sort()\r\nprint(j[len(j)-1])", "N = int(input())\r\nl = map(int, input().split(\" \"))\r\nl = sorted(l)\r\ncount = 1\r\np = 1\r\nfor i in range(1, N):\r\n if l[i] == l[i-1]:\r\n p = p + 1\r\n else:\r\n p = 1\r\n count = max(count, p)\r\nprint(count)", "\r\nfrom collections import Counter\r\nimport operator\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\n\r\ndic=dict(Counter(arr))\r\n\r\nsorted(dic.items(), key= operator.itemgetter(1))\r\ndicArr=list(dic.keys())\r\n_box = dic.get(dicArr[0])\r\nfor i in dicArr[1:]:\r\n n-=min(_box,dic[i])\r\n _box=max(_box,dic[i])\r\nprint(n)", "input();\r\nl = list(map(int,input().split()));\r\nres = 0;\r\nfor i in range(len(l)):\r\n if(l.count(l[i]) > res):\r\n res = l.count(l[i]);\r\n\r\nprint(res);", "n = input()\r\nlis = sorted((input().split(\" \")))\r\n\r\nres = []\r\n\r\nfor i in lis:\r\n res.append(lis.count(i))\r\n\r\nprint(max(res))\r\n\r\n", "\r\nminput = input().rstrip().split()\r\n\r\nn = int(minput[0])\r\n\r\n#d = int(minput[1])\r\n\r\nnums = list(map(int, input().rstrip().split()))\r\nnums.sort()\r\ncount=0\r\nhashmap={}\r\nfor i in nums:\r\n if i in hashmap:\r\n hashmap[i]+=1\r\n else:\r\n hashmap[i]=1\r\n\r\nfor i in hashmap:\r\n count=max(count,hashmap[i])\r\n\r\nprint(count)", "n=int(input())\narr=[int(i) for i in input().split()]\nhm={}\nfor i in range(n):\n hm[arr[i]]=hm.get(arr[i],0)+1\nprint(max(hm.values()))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nc = 1\r\nm = 1\r\nfor i in range(1, n):\r\n if(a[i] == a[i - 1]):\r\n c += 1 \r\n else:\r\n m = max(m, c)\r\n c = 1 \r\nm = max(m, c)\r\nprint(m)", "from collections import Counter\r\n\r\n\r\nn = int(input())\r\nboxes = list(map(int, input().split()))\r\ncount = Counter(boxes)\r\nnew = []\r\nfor box in boxes:\r\n new.append([box, count[box]])\r\n\r\nnew.sort(reverse=True)\r\n# print(new)\r\nneeded = new[0][1]\r\nfor i in range(1, n):\r\n if new[i][1] > needed:\r\n needed += (new[i][1] - needed)\r\n\r\nprint(needed)\r\n", "from sys import stdin, stdout,stderr\r\nimport time,math\r\nfrom collections import defaultdict as dd\r\n \r\ndef pn(ob):stdout.write(str(ob))\r\ndef inp():return stdin.readline()\r\n\r\ndef def_value():\r\n\treturn 0\r\n\r\ndef process():\r\n\tfreq=dd(def_value)\t\r\n\tn=int(inp())\r\n\r\n\ttake=1\r\n\r\n\tarr=list(map(int,inp().split()))\r\n\r\n\tfor i in arr:\r\n\t\tfreq[i]=freq[i]+1\r\n\r\n\tfor k,v in freq.items():\r\n\t\ttake=max(take,v)\r\n\r\n\tprint(take)\r\n \r\ndef main():\r\n\tt=1\r\n\t#t=int(inp())\r\n\tstart = time.time()\r\n \r\n\twhile (t>0):\r\n\t\tt-=1\r\n\t\tprocess()\r\n\tend = time.time()\r\n\t#stderr.write('\\nelapsed time'+str(end - start))\r\n \r\nif __name__ == '__main__':\r\n\tmain()\r\n\t\r\n#n,m=map(int,input().split()) \r\n# for i in range(n):\r\n# t=int(stdin.readline()) # input using fast i/p method \r\n# if t%m == 0:\r\n# stdout.write(str(t)+'\\n') #input using fast o/p method\r\n \r\n# take line of integers as input\r\n# \tarr = list(map(int, inp().split()))", "n=int(input()) \r\na=list(map(int,input().split()))\r\na.sort()\r\nl=[]\r\ndi={}\r\nfor i in range(n):\r\n k=a.count(a[i])\r\n di[a[i]]=k\r\nl=list(di.values())\r\nprint(max(l))\r\n", "import collections\r\n\r\nn = int(input())\r\na_i = input().split()[:n]\r\na_i_list = list(map(int, a_i))\r\nc = collections.Counter(a_i_list)\r\n#for word in a_i_list:\r\n# c[word] += 1\r\n\r\nres = c.most_common(1)[0]\r\n\r\nprint(res[1])", "from sys import stdin\r\n\r\n\r\ndef main():\r\n\tn = int(stdin.readline())\r\n\tar = list(map(int, stdin.readline().split()))\r\n\tar.sort()\r\n\tcheck = [False] * n\r\n\tfor i in range(1, n):\r\n\t\tfor j in range(i - 1, -1, -1):\r\n\t\t\tif ar[j] < ar[i] and not check[j]:\r\n\t\t\t\tcheck[j] = True\r\n\t\t\t\tbreak\r\n\tans = 0\r\n\tfor i in range(n):\r\n\t\tif not check[i]:\r\n\t\t\tans += 1\r\n\tprint(ans)\r\n\t\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "from collections import defaultdict\r\n\r\n\r\nn=int(input())\r\ncts=defaultdict(int)\r\nfor v in input().split():\r\n\tcts[v]+=1\r\nprint(max(cts.values()))\r\n\r\n\r\n\r\n", "from collections import Counter\r\nnum = int(input())\r\narr = list(map(int, input().split()))\r\nprint(max(Counter(arr).values()))\r\n", "n = int(input())\r\nlist_val = [int(val) for val in input().split()]\r\n\r\ndict_val = {}\r\n\r\nfor i in range(n):\r\n dict_val[list_val[i]] = 1 + dict_val.get(list_val[i],0)\r\n\r\nmax_val = 0\r\nfor key,val in dict_val.items():\r\n max_val = max(max_val,val)\r\n\r\nprint(max_val)", "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\na.sort()\r\nused = [False] * n\r\nr = n\r\nfor i in range(n): \r\n for j in range(i+1, n):\r\n if not used[j] and a[j] > a[i]:\r\n used[j] = True\r\n r -= 1\r\n break\r\nprint(r)\r\n", "# Chaitanya Bhutada \nimport math\nimport collections\nimport bisect\nimport heapq\nimport time\nimport random\nimport itertools\nimport sys\n\nn = int(input())\nmp = {}\nmx = 0\nF = [0]*5009\n\nF = list(map(int,input().split()))\nfor i in range(n):\n\tx = F[i]\n\tval = mp.get(x)\n\tif val == None :\n\t\tval = 0\n\tmp[x] = val+1\n\tif (val+1)> mx:\t\n\t\tmx = val + 1\nprint(mx)\n\n", "import sys\r\nimport sys\r\nimport threading\r\nfrom math import *\r\nfrom bisect import *\r\nfrom collections import *\r\nfrom heapq import *\r\nfrom functools import lru_cache\r\n \r\ndef gl():return list(map(int, input().split()))\r\ndef gi():return int(input())\r\ndef gc():return input()\r\n \r\ndd = defaultdict\r\ndq = deque\r\nhp = heappush\r\nhpp = heappop\r\nhpf = heapify\r\n \r\n \r\n# dic = {chr(i): i-ord('a') + 1 for i in range(ord('a'), ord('z') + 1)}\r\n \r\ndef solution():\r\n n = gi()\r\n arr = gl()\r\n \r\n ans = n\r\n \r\n arr.sort()\r\n \r\n l = 0\r\n r = 0\r\n \r\n while r<n:\r\n while arr[l]==arr[r] and r<n-1:\r\n r+=1\r\n if arr[l]<arr[r]:\r\n ans -= 1\r\n \r\n r += 1\r\n l+=1\r\n \r\n \r\n print(ans)\r\n \r\n \r\n \r\ndef main():\r\n solution()\r\n \r\nmain()\r\n# if __name__ == \"__main__\":\r\n# threading.stack_size(1 << 27)\r\n# sys.setrecursionlimit(1 << 30)\r\n# main_thread = threading.Thread(target=main)\r\n# main_thread.start()\r\n# main_thread.join()", "from collections import Counter\r\nn = int(input())\r\na = sorted(list(map(int,input().split())))\r\nif all(a[item] < a[item + 1] for item in range(len(a)-1)):\r\n print(1)\r\nelse:\r\n print(max(list(Counter(a).values())))\r\n\r\n\r\n", "n=int(input())\nmain_list=list(map(int,input().split(' ')))\ndict1=dict()\nfor i in main_list:\n if i not in dict1:\n dict1[i]=1\n else:\n dict1[i]+=1\nm=max(dict1.values())\nprint(m)", "def process(A):\r\n d = {}\r\n answer = 0\r\n for x in A:\r\n if x not in d:\r\n d[x] = 0\r\n d[x]+=1\r\n answer = max(answer, d[x])\r\n return answer\r\n \r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "n = int(input())\r\nA = list(map(int,input().split()))\r\nA = sorted(A,key=A.count,reverse=True)\r\nprint(A.count(A[0]))", "n = int(input())\nboxes = list(map(int, input().split()))\n\nboxes = sorted(boxes)\n\nvisible_boxes = n\ni = 0\nj = 1\nwhile j < n:\n if boxes[i] < boxes[j]:\n visible_boxes -= 1\n i += 1\n j += 1\n\nprint(visible_boxes)\n \t \t \t\t \t\t \t\t \t \t \t", "def f(A):\r\n x = 0\r\n for i in A:\r\n if A.count(i)>x:\r\n x = A.count(i)\r\n return x\r\n\r\nn = input()\r\nA = input().split(' ')\r\nprint(f(A))\r\n", "# We count the frequncy of all number because we need minimun visible boxs\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ndt={}\r\nans=0\r\nfor x in arr:\r\n dt[x]=dt.get(x,0)+1\r\n \r\n ans=max(ans,dt[x])\r\nprint(ans)", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\nd={}\r\nfor i in range(n):\r\n if(l[i] in d):\r\n d[l[i]]+=1\r\n else:\r\n d[l[i]]=1\r\nprint( d[max(d, key=d.get)])\r\n\r\n\r\n", "import sys, math\ninput = sys.stdin.readline\n\nn = int(input())\na = [int(x) for x in input().split()]\n\nfreq = {}\n\nfor i in range(n):\n if a[i] in freq:\n freq[a[i]] += 1\n else:\n freq[a[i]] = 1\n\nprint(max(freq.values()))\n\t \t \t\t\t \t\t \t \t \t\t\t\t", "from sys import stdin\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\nn, a, dic = int(input()), [int(x) for x in input().split()], dict()\r\nfor i in a:\r\n try:\r\n dic[i] += 1\r\n except:\r\n dic[i] = 1\r\nprint(max(dic.values()))\r\n", "import heapq \nN = int(input())\ncin = lambda:map(int,input().split())\nA = cin()\nlist_ele = list(A)\ncount = {}\nmax_size = -1\nmax_occr = 0\nfor i in list_ele:\n count[i] = count.get(i,0) + 1\nall_values = count.values()\nmax_value = max(all_values)\nprint(max_value)\n \n ", "import collections\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nprint(max(collections.Counter(arr).values()))\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nchecklist = []\n\nfor i in a:\n checklist.append(a.count(i))\n checklist.sort()\nprint(checklist[-1])\n\n\t\t\t \t\t \t \t\t \t \t \t \t \t\t\t\t", "n=int(input())\r\nbox_no=n\r\nbox=input()\r\nbox=[int(i) for i in box.split()]\r\ndic={}\r\nfor i in box:\r\n if i not in dic:\r\n dic[i]=box.count(i)\r\nm=max(dic,key=dic.get) \r\nprint(dic[m]) ", "t = int(input())\r\narr = list(map(int,input().split()))\r\ndict = {}\r\nres = 0\r\nfor i in arr:\r\n if i not in dict:\r\n dict[i] = 1\r\n res = max(res,dict[i])\r\n else:\r\n dict[i] += 1\r\n res = max(res,dict[i])\r\nprint(res)", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict as dc\r\nfrom collections import Counter\r\nfrom bisect import bisect_right, bisect_left,bisect\r\nimport math\r\nfrom operator import itemgetter\r\nfrom heapq import heapify, heappop, heappush\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nx=dc(int)\r\nm=0\r\nfor i in l:\r\n x[i]+=1\r\n m=max(m,x[i])\r\nprint(m)", "from collections import Counter\r\ninput()\r\nprint(max(Counter(input().split()).values()))", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nh = []\r\n\r\nfor i in a:\r\n h.append(a.count(i))\r\n h.sort()\r\nprint(h[-1])\r\n", "kastes = {}\r\nn = int(input())\r\nsaraksts = list(input().split())\r\nfor k in saraksts:\r\n if k in kastes:\r\n kastes[k]+= 1\r\n else:\r\n kastes[k] = 1\r\nprint(max(kastes.values()))", "from sys import stdin\r\nfrom collections import Counter\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nans = Counter(a).most_common(1)[0][1]\r\nprint(ans)", "input()\r\nx=list(map(int, input().split()))\r\nn=x.count(max(x,key=x.count))\r\nprint(n)", "#!/bin/python3\r\nn = int(input())\r\ncnt = {}\r\nfor i in map(int, input().split()):\r\n cnt[i] = cnt.get(i,0) + 1\r\nprint(max(cnt.values()))", "import collections\r\nh, = map(int, input().split())\r\narr = input().split()\r\ncs = collections.Counter(arr)\r\nprint(max(cs.values()))", "from collections import defaultdict\r\ndd = defaultdict(int)\r\nn = int(input())\r\narr = sorted(list(map(int, input().split())))\r\nans = 0\r\nfor x in arr:\r\n dd[x] += 1\r\n\r\narr = set(arr)\r\narr = sorted(list(arr))\r\nn = len(arr)\r\navailable = dict(dd)\r\nfor x in range(n):\r\n temp = arr[x]\r\n for z in range(x + 1, n):\r\n temp_val = min(dd[temp], available[arr[z]])\r\n dd[temp] -= temp_val\r\n available[arr[z]] -= temp_val\r\n if dd[temp] == 0:\r\n break\r\nans = sum(dd.values())\r\n\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nst = []\r\nl.sort()\r\nfor i in l:\r\n if len(st) == 0:\r\n st.append(i)\r\n\r\n else:\r\n if i > st[-1]:\r\n st.pop()\r\n st.append(i)\r\n\r\n else:\r\n p = []\r\n f = 0\r\n while(f == 0 and len(st) > 0):\r\n if i == st[-1]:\r\n x = st.pop()\r\n p.append(x)\r\n\r\n else:\r\n f = 1\r\n st.pop()\r\n\r\n while(len(p) != 0):\r\n x = p.pop()\r\n st.append(x)\r\n\r\n st.append(i)\r\n\r\nprint(len(st))", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ndic={}\r\nfor x in arr:\r\n if x in dic:\r\n dic[x]+=1\r\n else:\r\n dic[x]=1\r\ncnt=max(dic.values())\r\nprint(cnt)", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\nfrom collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nc=Counter(l).values()\r\nprint(max(c))\r\n", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nfreq = {}\r\nans = 0\r\narr.sort()\r\nfor i in arr:\r\n\tfreq[i] = freq.get(i,0) + 1\r\n\r\nprint(max(freq.values()))", "def mostFrequent(arr, n):\r\n arr.sort()\r\n max_count = 1\r\n res = arr[0]\r\n curr_count = 1\r\n\r\n for i in range(1, n):\r\n if (arr[i] == arr[i - 1]):\r\n curr_count += 1\r\n\r\n else:\r\n if (curr_count > max_count):\r\n max_count = curr_count\r\n res = arr[i - 1]\r\n\r\n curr_count = 1\r\n\r\n if (curr_count > max_count):\r\n max_count = curr_count\r\n res = arr[n - 1]\r\n\r\n return res\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nprint(arr.count(mostFrequent(arr,n)))", "n = int(input())\r\nasd = list(map(int, input().split()))\r\nmx = -1\r\nfor i in asd:\r\n m = asd.count(i)\r\n if m > mx:\r\n mx = m\r\n\r\nprint(mx)\r\n", "#Bhargey Mehta (Sophomore)\r\n#DA-IICT, Gandhinagar\r\nimport sys, math, queue, bisect\r\n#sys.stdin = open(\"input.txt\", \"r\")\r\nMOD = 10**9+7\r\nsys.setrecursionlimit(1000000)\r\n\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\nx = []\r\nfor ai in a:\r\n put = False\r\n for i in range(len(x)):\r\n if ai > x[i]:\r\n x[i] = ai\r\n put = True\r\n break\r\n if not put:\r\n x.append(ai)\r\nprint(len(x))", "a=int(input())\narr=list(map(int,input().split()))\narr.sort()\nd=dict()\nfor i in arr:\n if(i in d):\n d[i]=d[i]+1\n else:\n d[i]=1\nans=0\nmaxc=-float('inf')\nfor i in d:\n maxc=max(d[i],maxc)\nprint(maxc)\n", "import math\nfrom sys import stdin, stdout\n\n\n\n\ndef allPrimeBoolArray(n, primeBoolList):\n primeBoolList = [True for i in range(n+1)]\n p = 2\n while (p * p <= n):\n if primeBoolList[p]:\n for i in range(p * p, n+1, p):\n primeBoolList[i] = False\n\n p += 1\n\ndef allPrimeList(n, primeList):\n prime = [True for i in range(n+1)]\n p = 2\n while (p * p <= n):\n if prime[p]:\n for i in range(p * p, n+1, p):\n prime[i] = False\n\n p += 1\n\n for p in range(2, n + 1):\n if prime[p]:\n primeList.append(p)\n\n\n\ndef val(c):\n if c >= '0' and c <= '9':\n return ord(c) - ord('0')\n else:\n return ord(c) - ord('A') + 10\n\ndef nthBaseToDecimal(str, base):\n llen = len(str)\n power = 1 \n num = 0 \n \n for i in range(llen - 1, -1, -1):\n num += (val(str[i]) * power)\n power *= base\n\n return num\n\n\ndef reVal(num):\n if (num >= 0 and num <= 9):\n return chr(num + ord('0'))\n else:\n return chr(num - 10 + ord('A'))\n\ndef nthBasefromDeci(inputNum, base):\n res = \"\"\n\n while (inputNum > 0):\n res += reVal(inputNum % base)\n inputNum = int(inputNum / base)\n\n return res[::-1]\n\n\n\nfrom collections import Counter\n\ndef solve1():\n n = int(input())\n lst = input().split()\n cnt = {}\n ans = 0\n for key in (lst):\n try:\n cnt[key] += 1\n except:\n cnt[key] = 1\n \n for key in cnt:\n ans = max(ans,cnt[key])\n print(ans)\n pass\n\n \n\ndef solve2():\n\n pass\n\ndef solve3():\n\n pass\n\n\n\ndef main():\n # Previous code\n\n\n\n test = 1\n\n # test = int(input())\n\n for testNo in range(1, test + 1):\n solve1()\n\n\n\n\nif __name__ == \"__main__\":\n main()\n\n \t \t \t \t\t\t\t \t \t\t\t \t \t \t\t", "input()\na=input().split()\nprint(a.count(max(set(a), key=a.count)))\n\t\t \t\t \t\t \t\t\t\t\t \t\t\t\t \t\t \t\t \t", "y = int(input())\r\nx = list(map(int, input().split()))\r\ndictt = {}\r\nmax = 0\r\n\r\nfor i in x:\r\n if dictt.get(i, False):\r\n dictt[i] += 1\r\n else:\r\n dictt[i] = 1\r\n \r\nfor i in dictt:\r\n if dictt[i] > max:\r\n max = dictt[i]\r\n \r\nprint(max)\r\n \r\n", "from collections import Counter\r\n\r\ninput()\r\n\r\nprint(max(Counter(input().split()).values()))", "n=int(input())\r\nsk=list(input().split())\r\ndic = {}\r\nfor nr in sk:\r\n if nr in dic:\r\n dic[nr] += 1\r\n else:\r\n dic[nr] = 1\r\nmaxVal = 0\r\nfor key in dic:\r\n if dic[key] > maxVal:\r\n maxVal = dic[key]\r\nprint(maxVal)", "if __name__ == '__main__':\n n = int(input())\n boxes = sorted(list(map(int,input().split())))\n visible_boxes = 0\n while boxes:\n caixa_da_vez = boxes[0]\n indexes = [0]\n for i, caixa in enumerate(boxes):\n if caixa > caixa_da_vez:\n indexes.append(i)\n caixa_da_vez = caixa\n for i in reversed(indexes):\n boxes.pop(i)\n visible_boxes += 1\n if len(indexes) == 1: break\n visible_boxes += len(boxes)\n print(visible_boxes)\n\t\t \t \t\t\t\t \t\t\t \t \t\t\t\t \t", "from sys import stdin\r\nfrom collections import *\r\n\r\ninput = lambda: stdin.buffer.readline().rstrip(b'\\r\\n').decode('ascii')\r\nn, a = int(input()), Counter(input().split())\r\nprint(max(a.values()))\r\n\r\n", "n = int(input())\r\na_i = input().split()[:n]\r\na_i_list = list(map(int, a_i))\r\ny = []\r\nfor i in a_i_list:\r\n num = a_i_list.count(i)\r\n y.append(num)\r\nprint(max(y))", "import collections\r\nn = int(input())\r\narr = [int(a) for a in input().split()]\r\nif (len(arr) == n):\r\n #return\r\n #print('00')\r\n list = {i: arr.count(i) for i in arr}\r\n #print(result)\r\n ctr = collections.Counter(list)\r\n val = ctr.most_common(1)\r\n #print(val)\r\n print(val[0][1])", "# MaryamTarek\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nx = {}\r\nfor i in a:\r\n if i not in x:\r\n x[i] = 1\r\n else:\r\n x[i] += 1\r\nprint(max(x.values()))\r\n", "# https://codeforces.com/contest/903/problem/C\r\n\r\nn = int(input())\r\ninp_arr = list(map(int, input().split()))\r\n\r\nfreq = {}\r\nfor i in inp_arr:\r\n freq[i] = freq.get(i, 0) + 1\r\n\r\nmaxi = -9999999999999\r\n\r\nfor i in freq:\r\n if freq[i] > maxi:\r\n maxi = freq[i]\r\n \r\nprint(maxi)", "# cook your dish here\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na1=[]\r\nc=0\r\nfor i in a:\r\n a1.append(i)\r\nfor i in a1:\r\n c=max(c,a.count(i))\r\nprint(c)", "_ = int(input())\ndict = {}\n\nfor num in input().split():\n\n if num in dict: dict[num] += 1\n else: dict[num] = 1\n\nprint(max(dict.values()))\n \t \t \t \t \t\t \t \t\t\t \t", "def get_what_to_place(arr):\r\n mi=10**10\r\n mi_idx = -1\r\n for i in range(len(arr)):\r\n if(arr[i]<mi):\r\n mi_idx=i\r\n mi=arr[i]\r\n return mi_idx\r\ndef get_where_to_place(arr, what_to_place_val):\r\n ma=10**10\r\n ma_idx = -1\r\n for i in range(len(arr)):\r\n if(arr[i]<ma and arr[i]>what_to_place_val):\r\n ma_idx=i\r\n ma=arr[i]\r\n return ma_idx\r\n \r\nn = int(input())\r\noutside = list(map(int, input().split()))\r\ninside = outside[:]\r\n\r\nfor i in range(n):\r\n what_to_place_idx = get_what_to_place(outside)\r\n where_to_place_idx = get_where_to_place(inside, outside[what_to_place_idx])\r\n #print(what_to_place_idx, where_to_place_idx)\r\n if(what_to_place_idx<0 or where_to_place_idx<0 or outside[what_to_place_idx]==10**10):\r\n break\r\n else:\r\n inside[where_to_place_idx]=inside[what_to_place_idx]\r\n outside[what_to_place_idx]=10**10\r\n\r\nprint(len(list(filter(lambda x: x<10**10, outside))))", "from collections import Counter\n \nn = int(input())\na = list(map(int, input().split()))\nc = Counter(a)\nm_c = c.most_common(1)[0][1]\nprint(m_c)\n", "from sys import stdin\n\nstdin.readline()\narr = iter(sorted(map(int, stdin.readline().strip().split())))\n\nvisible = []\n\nfor i in arr:\n\tif not visible:\n\t\tvisible.append((i, 0))\n\telse:\n\t\tstuffed = 0\n\t\tfor ind, (j, filled) in enumerate(visible):\n\t\t\tif i < j and not filled:\n\t\t\t\tvisible[ind] = (j, 1)\n\t\t\t\tstuffed = 1\n\t\t\t\tbreak\n\t\t\telif i > j:\n\t\t\t\tvisible[ind] = (i, 1)\n\t\t\t\tstuffed = 1\n\t\t\t\tbreak\n\t\tif not stuffed:\n\t\t\tvisible.append((i, 0))\nprint(len(visible))\n \t\t \t\t\t\t\t\t\t \t \t \t\t \t \t \t\t\t\t", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif n == 0:\r\n print(0)\r\nelse:\r\n a.sort()\r\n L = []\r\n k = 1\r\n for i in range(1, n):\r\n if(a[i] == a[i - 1]):\r\n k += 1\r\n else:\r\n L.append([a[i - 1], k])\r\n k = 1\r\n L.append([a[n - 1], k])\r\n for i in range(len(L) - 1):\r\n L[i + 1][1] = max(L[i + 1][1], L[i][1])\r\n print(L[-1][-1])", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\ni=0\nr=0\ncnt=list()\nwhile i<n-1:\n\tif l[i+1]!=l[i]:\n\t\tcnt.append(i-r+1)\n\t\tr=i+1\n\ti+=1\ncnt.append(n-r)\nm=len(cnt)\nx=cnt[0]\nfor i in range (1,m):\n\tx=x+cnt[i]-min(x,cnt[i])\nprint(x)\n\t", "from collections import deque\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nq = deque()\r\nfor i in range(n):\r\n if len(q) > 0:\r\n if q[-1] < arr[i]:\r\n q.pop()\r\n elif q[0] < arr[i]:\r\n q.popleft()\r\n q.append(arr[i])\r\nprint(len(q))\r\n", "import random, math\nfrom copy import deepcopy as dc\nfrom bisect import bisect_left, bisect_right\n\n\n\n# Function to call the actual solution\ndef solution(li):\n\tma = {}\n\tfor i in li:\n\t\tma[i] = ma.get(i, 0) + 1\n\treturn max(ma.values())\n\n\n# Function to take input\ndef input_test():\n\t# for _ in range(int(input())):\n\t\tn = int(input())\n\t\t# a, b = map(int, input().strip().split(\" \"))\n\t\t# a, b, c = map(int, input().strip().split(\" \"))\n\t\tli = list(map(int, input().strip().split(\" \")))\n\t\tout = solution(li)\n\t\tprint(out)\n\n# Function to check test my code\ndef test():\n\tpass\n\n\ninput_test()\n# test()", "n=int(input())\na=input().split(\" \")\nmx=0\nfor i in a:\n c=a.count(i)\n if c>mx:\n mx=c\nprint(mx)\n \t\t \t \t \t \t\t \t \t\t \t\t \t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor j in l:\r\n d[j]=0\r\nfor j in l:\r\n d[j]+=1\r\nm=0\r\nfor j in l:\r\n if d[j]>m:\r\n m=d[j]\r\nprint(m)", "n = int(input())\na = map(int, input().split())\n\ns = {}\nans = 1\nfor i in a:\n if i in s:\n s[i] += 1\n ans = max(ans, s[i])\n else:\n s[i] = 1\n\nprint(ans)\n\n \t \t\t \t\t\t\t\t\t\t \t \t\t \t\t\t\t\t", "i = int(input())\r\nx = list(map(int,input().strip().split()))\r\nx.sort()\r\n\r\nm = 1\r\np = x[0]\r\nq = 1\r\n\r\nfor i in range(1,len(x)):\r\n if p == x[i]:\r\n q = q+1\r\n if q>m:\r\n m=q\r\n else:\r\n q=1\r\n p = x[i]\r\n\r\nprint(m)", "import sys\r\n\r\nn = int(input())\r\nsequence = map(int, sys.stdin.readline().split())\r\n\r\nmp = {}\r\nans = -1\r\n\r\nfor x in sequence:\r\n if x in mp:\r\n mp[x] += 1\r\n else:\r\n mp[x] = 1\r\n ans = max(ans, mp[x])\r\n\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = 0\r\nfor i in range(n):\r\n c = a.count(a[i])\r\n if c > x:\r\n x = c\r\nprint(x)", "a = int(input())\n\nb = list(map(int, input().split()))\n\nb.sort()\n\nc = list(b)\n\nd = set(b)\n\ncount = 0\n\nwhile len(c) > 1:\n for i in d:\n c.remove(i)\n d = set(c)\n count += 1\n\nif len(c) == 1:\n print(count + 1)\nelse:\n print(count) \n\t \t\t\t \t \t \t \t \t \t \t\t\t\t", "import sys\r\n\r\nn = int(input())\r\na = sorted(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(n):\r\n if a[i] == -1:\r\n continue\r\n x = a[i]\r\n a[i] = -1\r\n for j in range(i+1, n):\r\n if x < a[j]:\r\n x = a[j]\r\n a[j] = -1\r\n ans += 1\r\n\r\nprint(ans)\r\n", "occ = {}\r\nn = int(input())\r\nmaxi = 0\r\nfor i in map(int, input().split()):\r\n if i in occ:\r\n occ[i] += 1\r\n else:\r\n occ[i] = 1\r\n maxi = max(maxi, occ[i])\r\n\r\nprint(maxi)", "n = input()\r\ndic = {}\r\nl = list(input().split())\r\nfor x in l:\r\n dic[x]=dic[x]+1 if x in dic else 1\r\nprint(max(dic.values()))", "n=int(input())\r\na=[*map(int, input().split())]\r\nb=list(set(a))\r\nb.sort()\r\ns=[a.count(i) for i in b]\r\nprint(max(s))", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\na=[]\r\nfor i in range(n):\r\n x=l.count(l[i])\r\n a.append(x)\r\n\r\nprint(max(a)) ", "from collections import Counter\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\n\r\n\r\ndef inlt():\r\n return(list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return(map(int, input().split()))\r\n\r\n\r\ndef solve(n, arr):\r\n count = Counter(arr)\r\n return sorted(count.values())[-1]\r\n\r\ndef main():\r\n print(solve(int(input()), inlt()))\r\n\r\n\r\nmain()\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ndic = {}\r\nfor i in l:\r\n if i in dic.keys():\r\n dic[i] += 1\r\n else:\r\n dic[i] = 1\r\nprint(max(dic.values()))\r\n", "n = int(input())\r\n\r\nlist1 = [int(x) for x in input().split()]\r\ndict1 = {}\r\nfor num in list1:\r\n if num not in dict1:\r\n dict1[num]=1\r\n else:\r\n dict1[num]+=1\r\n\r\nprint(max(dict1.values()))", "n = int(input())\r\ns = list(map(int, input().split()))\r\nprint(s.count(max(s, key=lambda x: s.count(x))))", "n = int(input())\narray = list(map(int,input().split()))\nhm = {}\nfor x in array:\n if x not in hm:\n hm[x] = 1\n else:\n hm[x] += 1\nans = max(hm.values())\nprint(ans)\n\t\t\t \t \t\t\t\t\t \t \t \t\t\t\t\t\t \t\t", "from collections import Counter\r\nn = int(input())\r\nprint(Counter(map(int, input().split())).most_common()[0][1])\r\n\r\n", "n_boxes = int(input())\n\nbox_sizes = input().split()\nbox_sizes = [int(size) for size in box_sizes]\n\n\ndef count_sizes(box_sizes):\n box_count = []\n last_size = 0\n size_controler = -1\n for size in box_sizes:\n if size == last_size:\n box_count[size_controler] += 1\n else:\n size_controler += 1\n last_size = size\n box_count.append(1)\n return box_count\n\n\nbox_sizes = sorted(box_sizes)\nanswer = count_sizes(box_sizes)\nprint(max(answer))\n\t \t\t \t\t\t\t \t \t\t\t \t\t \t\t\t\t\t\t \t\t\t", "import math\r\n#x,y,a,b = map(int, input().strip().split(' '))\r\nn=int(input())\r\nlst = list(map(str, input().strip().split(' ')))\r\nl = list( dict.fromkeys(lst) )\r\nm=0\r\nfor j in range(len(l)):\r\n c=lst.count(l[j])\r\n if c>m:\r\n m=c\r\nprint(m)", "from collections import Counter\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ncnt = Counter(arr)\r\n\r\nprint(max(cnt.values()))", "n = int(input())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\nl = 0\r\nwhile(a!=[0]*n):\r\n s = [0]\r\n for i in range(len(a)):\r\n if(a[i]>s[-1]):\r\n s.append(a[i])\r\n a[i] = 0\r\n l+=1\r\nprint(l)\r\n", "N = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nseq = 0\r\nmax_seq = -1\r\nfor i in range(len(arr)-1):\r\n\tif arr[i]==arr[i+1]:\r\n\t\tseq+=1\r\n\telse:\r\n\t\tmax_seq = max(max_seq,seq)\r\n\t\tseq = 0\r\nprint(max(max_seq,seq)+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nres = 0\r\nmp = {}\r\nfor i in a:\r\n mp[i] = mp.get(i,0)+1\r\nmx = 0\r\nfor i,v in sorted(mp.items(),reverse = True):\r\n res+=max(0,v-mx)\r\n mx = max(mx,v)\r\nprint(res)", "n = int(input())\nl1 = list(map(int, input().split(' ')))\ndicc = {}\nfor i in l1:\n if i not in dicc:\n dicc[i] = 1\n else:\n dicc[i] += 1\ns = max(dicc.values())\nprint(s)\n\n\n\n\n\n\n\t \t\t\t \t \t\t \t\t \t\t \t \t\t\t\t", "n=input()\na=input().split()\nif len(a)==int(n):\n b=sorted(a)\n c=sorted(a)\n result = 0\n i=0\n m=0\n while i<len(b):\n while m<len(c):\n if b[i]<c[m]:\n c.remove(c[m])\n result=result-1\n break\n m+=1\n i+=1\n s=len(a)+result\n print(s)\nelse:\n print(0)\n \t \t \t\t\t \t\t\t \t\t\t \t \t \t", "from collections import Counter\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nfreq = Counter(nums)\r\n\r\nprint(max(freq.values()))", "n = int(input())\r\nsp = [int(el) for el in input().split()]\r\nsp.sort(reverse=True)\r\na = 1\r\nj = 0\r\n\r\nwhile a == 1:\r\n if j == len(sp):\r\n break\r\n a = 0\r\n b = sp[j]\r\n i = 1\r\n while True:\r\n if i == len(sp):\r\n break\r\n elif sp[i] < b:\r\n a = 1\r\n b = sp[i]\r\n sp.pop(i)\r\n else:\r\n i += 1\r\n j += 1\r\nprint(len(sp))\r\n", "n = int(input())\n\narr_a = input().split()\narr_a = [int(i) for i in arr_a]\n\narr_m = {}\n\nfor a in arr_a:\n arr_m.update({a: 0})\n\nresult = 0\n\nfor a in arr_a:\n arr_m[a] += 1\n result = max(result, arr_m[a])\n\nprint(result)\n \t \t\t \t \t\t \t \t \t \t\t\t\t \t\t", "def solve(n,seq) :\r\n seq.sort()\r\n \r\n ans = 0\r\n temp = 0\r\n \r\n prev = seq[0]\r\n for x in seq :\r\n if x == prev :\r\n temp += 1\r\n else :\r\n if temp > ans :\r\n ans = temp\r\n temp = 1\r\n prev = x\r\n \r\n if temp > ans :\r\n ans = temp\r\n \r\n return ans\r\n \r\nn = int(input())\r\nseq = list(map(int,input().split()))\r\n\r\nprint (solve(n,seq))\r\n \r\n \r\n \r\n ", "## given boxes side length in a list,\n# find the number of boxes that can be packed inside each other\n# and return the number of boxes that will be visible after packing boxes\n\nnumber_of_boxes = int(input())\nboxes_length = list(map(int, input().split()))\n\n\nfrom collections import defaultdict\nmap = defaultdict(int)\nfor box in boxes_length:\n map[box] += 1\n\nvisible_boxes = 0\nfor key,val in map.items():\n visible_boxes = max(visible_boxes, val)\n\n \nprint(visible_boxes)\n\n\n\t \t\t\t\t \t \t\t \t\t\t\t \t \t \t\t\t \t\t\t", "a=int(input())\ndict={}\nn=input().split()\nfor i in range(a):\n if n[i] in dict.keys():\n dict[n[i]]+=1\n else:\n nn={n[i]:1}\n dict.update(nn)\nprint(max(dict.values()))\n\t \t \t\t \t \t\t \t\t\t \t \t\t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\n\r\nmaxi = 0\r\ncount = 0\r\nmaxCount = 0\r\nfor x in a:\r\n if(x > maxi):\r\n count = 1\r\n maxi = x\r\n elif(x == maxi):\r\n count += 1\r\n if(maxCount < count):\r\n maxCount = count\r\n \r\nprint(maxCount)\r\n ", "n=int (input())\r\n\r\nvct= [int(i) for i in input().split(\" \")]\r\ncnt=0\r\nfor x in vct:\r\n\tcnt=max(cnt,vct.count(x))\r\nprint (cnt)", "t=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\nfor i in l:\r\n if i not in d:\r\n d[i]=l.count(i)\r\nt2=max(d.values())\r\nprint(t2)\r\n", "n = input()\r\na = input().split()\r\n\r\nr = 0\r\ns = set(a)\r\nfor i in range(len(s)):\r\n c = a.count(s.pop())\r\n if c > r:\r\n r = c\r\nprint(r)\r\n", "n = int(input())\r\nli = list(map(int , input().split()))\r\n\r\ndi = {}\r\n\r\nfor i in li:\r\n if i in di:\r\n di[i] += 1\r\n \r\n else:\r\n di[i] = 1\r\n \r\nmx = max(di.values())\r\n\r\nprint(mx)\r\n\r\n\r\n", "n=int(input())\r\nx=[int(q) for q in input().split()]\r\ny=set(x)\r\nl=[]\r\nfor i in y:\r\n l.append(x.count(i))\r\nprint(max(l))", "n=int(input())\r\na=[*map(int,input().split())]\r\na.sort()\r\nd={}\r\nfor i in a:\r\n if d.get(i)==None:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\np=list(d.values())\r\nprint(max(p))", "n= int(input())\r\nlis=list(map(int,input().split()))\r\nlis.sort()\r\nc=1\r\nmx=1\r\nfor i in range(n-1):\r\n if lis[i]==lis[i+1]:\r\n c+=1\r\n else:\r\n c=1\r\n if mx<c:\r\n mx=c\r\n\r\nprint(mx)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmax=0\r\nfor i in l:\r\n freq=l.count(i)\r\n if freq>max:\r\n max=freq\r\nprint(max)\r\n\r\n\r\n \r\n \r\n", "import collections as c\r\n\r\n\r\ninput()\r\nprint(max(c.Counter(input().split()).values()))\r\n", "n = int(input())\r\narray = list(map(int, input().split()))\r\n \r\ncount = {}\r\nfor i in array:\r\n if i in count:\r\n count[i] += 1\r\n else:\r\n count[i] = 1\r\n \r\nmax_val = 0\r\nfor i in count:\r\n if count[i] > max_val:\r\n max_val = count[i]\r\n \r\nprint(max_val)", "from collections import Counter\r\nl=input()\r\ncount=Counter()\r\nlist1=sorted(list(map(int,input().split())))\r\nfor item in list1:\r\n count[item]+=1\r\nprint(max(count.values()))\r\n\r\n", "input()\r\nboxes = sorted(map(int, input().split()))\r\n\r\nans = 0\r\nwhile len(boxes) != 0:\r\n for num in set(boxes):\r\n boxes.remove(num)\r\n ans += 1\r\n\r\nprint(ans)\r\n", "\r\nfrom collections import defaultdict\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ndic=defaultdict(int)\r\nfor i in arr:\r\n dic[i]+=1\r\narr=list(dic.keys())\r\narr.sort()\r\n\r\n_box=dic[arr[0]]\r\nfor i in arr[1:]:\r\n n-=min(_box,dic[i])\r\n _box=max(_box,dic[i])\r\nprint(n)", "n = int(input())\r\narr = list(map(int,input().split()))\r\ndic = {}\r\nfor i in range(n):\r\n if arr[i] not in dic:\r\n dic[arr[i]] = 1\r\n else:\r\n dic[arr[i]] += 1\r\nprint(max(list(dic.values())))\r\n", "from collections import Counter\nn = int(input())\nlst = map(int, input().split())\nass = Counter(lst)\nprint(max([ass[i] for i in ass]))\n\n \t \t \t \t \t \t\t \t \t\t\t\t \t\t\t \t", "n = int(input())\r\ns = input().split()\r\na = []\r\nfor x in s:\r\n a.append(int(x))\r\na.sort()\r\nans = -1\r\nfreq = 1\r\nfor i in range(1, n):\r\n if a[i - 1] == a[i]:\r\n freq = freq + 1\r\n else:\r\n ans = max(ans, freq)\r\n freq = 1\r\nans = max(ans, freq)\r\nprint(ans)", "n = int(input())\r\nb = sorted(list(map(int, input().split())))\r\nunpacked = []\r\nc = 1\r\nfor i in range(n-1):\r\n if b[i] == b[i+1]:\r\n unpacked.append(b[i])\r\nwhile len(set(unpacked)) != 0:\r\n temp = []\r\n c += 1\r\n for i in range(len(unpacked)-1):\r\n if unpacked[i] == unpacked[i+1]:\r\n temp.append(unpacked[i])\r\n unpacked = temp\r\nprint(c)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncounts=[] \r\nfor i in set(arr):\r\n counts.append(arr.count(i))\r\nprint(max(counts))", "import heapq \r\nfrom collections import defaultdict \r\nimport math \r\nimport collections\r\n\r\n\r\n\r\nmod=10**9+7\r\nalp='#abcdefghijklmnopqrstuvwxyz'\r\ncap='ABCDEFGHIJKLMNOPQRSTUVWXYZ'\r\ndigit='1234567890'\r\n\r\n\r\n\r\n#math.facorial(n)------>gives the factorial \r\n\r\n\r\n\r\n\r\n\r\n\r\nfor _ in range(1):\r\n \r\n n =int(input()) \r\n #n,s,r =map(int,input().split())\r\n '''l=[]\r\n for i in range(n):\r\n l1=list(map(int,input().split()))\r\n l.append(l1)'''\r\n \r\n l=list(map(int,input().split()))\r\n #s=input()\r\n mx=0\r\n d=defaultdict(int)\r\n for i in l:\r\n d[i]+=1 \r\n if d[i]>mx:\r\n mx=d[i]\r\n print(mx)\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n", "n = int(input())\nboxes = [int(x) for x in input().split()]\nresp = {}\nr = 0\nfor i in range(n):\n resp[str(boxes[i])] = 0\nfor i in range(n):\n resp[str(boxes[i])] += 1\n r = max(resp[str(boxes[i])], r)\nprint (r)\n \t \t \t \t\t \t \t\t\t \t\t \t \t \t\t", "from collections import Counter\n\nn = int(input())\na = list(map(int, input().split()))\nc = Counter(a)\nprint(c.most_common(1)[0][1])\n \t \t\t \t \t \t \t\t \t\t\t", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\nbh=[]\r\nfor i in range(n):\r\n bh.append(a.count(a[i]))\r\nprint(max(bh))\r\n", "a = int(input())\r\nspec = []\r\nmas = [int(el) for el in input().split()]\r\nmas = sorted(mas, reverse = True)\r\ni = 0\r\ncnt = 0\r\nf = 0\r\ng = 0\r\nwhile mas != []:\r\n if mas[i] not in spec:\r\n spec.append(mas[i])\r\n f = mas[i]\r\n g = min(mas)\r\n mas.remove(mas[i])\r\n if f == g:\r\n cnt += 1\r\n spec = []\r\n i = 0\r\n else:\r\n i += 1\r\nprint(cnt) \r\n", "n = int(input())\r\nA = [int(a) for a in input().split()]\r\n\r\nA.sort()\r\n\r\ni = 0\r\nj = 1\r\nvisible = n\r\nwhile i < n and j < n:\r\n if A[i] < A[j]:\r\n visible -= 1\r\n i += 1\r\n j += 1\r\n else:\r\n j += 1\r\nprint(visible)", "from collections import Counter\r\nn= int(input())\r\nl= list(map(int,input().split()))\r\nd= dict(Counter(l))\r\nv=[]\r\nfor key,value in d.items():\r\n v.append(value)\r\nprint(max(v))\r\n \r\n", "n= int(input())\r\na= list(map(int, input().split()))\r\nmaxx= 0\r\nfor x in set(a):\r\n maxx= max(maxx, a.count(x))\r\nprint(maxx)", "# Python3 program to find the most\r\n# frequent element in an array.\r\n\r\ndef mostFrequent(arr, n):\r\n\r\n arr.sort()\r\n\r\n\r\n max_count = 1;\r\n res = arr[0];\r\n curr_count = 1\r\n\r\n for i in range(1, n):\r\n if (arr[i] == arr[i - 1]):\r\n curr_count += 1\r\n\r\n else:\r\n if (curr_count > max_count):\r\n max_count = curr_count\r\n res = arr[i - 1]\r\n\r\n curr_count = 1\r\n\r\n\r\n if (curr_count > max_count):\r\n max_count = curr_count\r\n res = arr[n - 1]\r\n\r\n return max_count\r\n\r\n\r\n# Driver Code\r\nt=int(input())\r\narr=list(map(int,input().split()))\r\nn = len(arr)\r\nprint(mostFrequent(arr, n))\r\n\r\n", "n = input()\r\nlis = input().split(\" \")\r\n\r\nfor i, elem in enumerate(lis):\r\n lis[i] = int(elem)\r\n\r\nres = []\r\n\r\nfor i in lis:\r\n res.append(lis.count(i))\r\n\r\nprint(max(res))\r\n\r\n", "import math\r\nfor _ in range(1):\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n c=1\r\n ans=0\r\n for i in range(n-1):\r\n if l[i]==l[i+1]:\r\n c=c+1\r\n else:\r\n ans=max(c,ans)\r\n c=1\r\n print(max(ans,c)) \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\nX = set(A)\r\nX = list(X)\r\nX.sort()\r\ntoid = {}\r\nfor i, x in enumerate(X):\r\n toid[x] = i\r\nA = [toid[a] for a in A]\r\nA.sort()\r\n#print(A)\r\nimport heapq\r\nq = []\r\nheapq.heapify(q)\r\nfor a in A:\r\n if q:\r\n if q[0] < a:\r\n heapq.heappop(q)\r\n heapq.heappush(q, a)\r\n else:\r\n heapq.heappush(q,a)\r\n else:\r\n heapq.heappush(q,a)\r\nprint(len(q))\r\n", "from collections import defaultdict\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ndic=defaultdict(int)\r\nfor i in arr:\r\n dic[i]+=1\r\nprint(max(list(dic.values())))", "from collections import Counter\r\n\r\nn = int(input())\r\n\r\nboxes = list(map(int, input().split()))\r\n\r\ncount = Counter(boxes)\r\n\r\nvisible = 0\r\n\r\nbox = sorted(count.values())\r\n\r\n_boxes = sum(box)\r\n\r\nwhile _boxes > 0:\r\n \r\n for i in range(len(box)):\r\n if box[i] > 0:\r\n box[i] -= 1\r\n _boxes -= 1\r\n visible += 1\r\nprint(visible)\r\n \r\n\r\n\r\n\r\n ", "\r\nfrom functools import lru_cache\r\nfrom collections import defaultdict, deque, Counter\r\nimport sys\r\ninput = sys.stdin.readline\r\n \r\nclass Solution:\r\n def boxesPacking(self, n, array):\r\n # TODO write an algorithm here\r\n array.sort()\r\n q = deque()\r\n for num in array:\r\n if q and q[0] < num:\r\n q.popleft()\r\n q.append(num)\r\n return len(q)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solution = Solution()\r\n n = int(input())\r\n array = list(map(int, input().split()))\r\n print(solution.boxesPacking(n, array))", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\n\r\nfreq = {}\r\n\r\nfor i in range(n):\r\n if a[i] in freq:\r\n freq[a[i]] += 1\r\n else:\r\n freq[a[i]] = 1\r\n\r\nprint(max(freq.values()))", "from typing import Optional, Tuple\r\n\r\nn = int(input())\r\nnums = tuple(map(int, input().split(' ')))\r\n\r\n\r\ndef count(num_tuple: tuple) -> int:\r\n count_list = []\r\n for i in num_tuple:\r\n count_list.append(num_tuple.count(i))\r\n return max(count_list)\r\n\r\n\r\nprint(count(nums))", "from collections import Counter\ndef solve():\n n = int(input())\n arr = list(map(int, input().split()))\n Count = dict(Counter(arr))\n visible = 0\n while Count:\n minimum = min(Count.values())\n for item in Count.keys():\n Count[item] -= minimum\n Count = {x:y for x,y in Count.items() if y!=0}\n visible += minimum\n print(visible)\nsolve()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=dict()\r\nfor i in range(n):\r\n if l[i] in d:\r\n d[l[i]]+=1\r\n else:\r\n d.update({l[i]:1})\r\nans=0\r\nfor i in d:\r\n e=min(ans,d[i])\r\n ans+=d[i]\r\n ans-=e\r\nprint(ans)", "n=int(input())\r\nl1=[int(i) for i in input().split()]\r\ns1=set(l1)\r\nif len(s1)==5000:\r\n print(1)\r\nelse :\r\n l2=[]\r\n for j in s1:\r\n l2.append(l1.count(j))\r\n print(max(l2))", "n = int(input())\r\nl = list(map(int, input().rstrip().split(\" \")))\r\nl.sort()\r\nm_c = 0\r\nc = 1\r\nla = l[0]\r\nfor i in range(1,len(l)):\r\n if l[i]==la:\r\n c+=1\r\n else:\r\n if c>m_c:\r\n m_c = c\r\n c=1\r\n la = l[i]\r\nif c>m_c:\r\n m_c = c\r\nprint(m_c)", "# author: violist\n# created: 15.02.2022 15:04:20\n\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\na = list(map(int, input().split()))\nmp = {}\nans = 0\nfor i in range(n):\n if (a[i] not in mp):\n mp[a[i]] = 1\n else:\n mp[a[i]] += 1\n if (mp[a[i]] > ans):\n ans = mp[a[i]]\nprint(ans)\n", "from collections import defaultdict\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\ndic=defaultdict(int)\r\nfor i in arr:\r\n dic[i]+=1\r\na=list(dic.keys())\r\na.sort()\r\nvs=n\r\nprev=dic[a[0]]\r\nfor i in a[1:]:\r\n vs-=min(prev,dic[i])\r\n prev=max(prev,dic[i])\r\nprint(vs)", "import collections as cl\r\n\r\n\r\nn = int(input())\r\nprint(max(cl.Counter(map(int, input().split())).values()))\r\n", "try: \r\n n = int(input())\r\n w=list(map(int, input().split()))\r\n ans = 0\r\n for i in w :\r\n ans = max(w.count(i), ans)\r\n print(ans)\r\nexcept:\r\n pass", "import sys\r\nfrom collections import Counter\r\ninput = lambda : sys.stdin.readline().strip()\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\n\r\nc = Counter(a)\r\nans = 1\r\nfor i in c:\r\n ans=max(ans,c[i])\r\nprint(ans)\r\n \r\n", "n = int(input())\r\nd = {}\r\n\r\nfor i in input().split():\r\n if i not in d:\r\n d[i] = 0\r\n \r\n d[i] += 1\r\n \r\nprint(max(d.values()))\r\n ", "#take input of n\r\nn = int(input())\r\n#take input of array\r\narr = list(map(int, input().split()))\r\n#count the occurence of each element and strore in a dictionary\r\nd = {}\r\nfor i in arr:\r\n d[i] = d.get(i, 0) + 1\r\n#find the number with maximum occurence\r\nmax = 0\r\nfor i in d:\r\n if d[i] > max:\r\n max = d[i]\r\nprint(max)", "n=int(input())\r\nar=list(map(int,input().split()))\r\nar.sort(reverse=True)\r\ndic={}\r\nfor i in range(n):\r\n if(ar[i] in dic):\r\n dic[ar[i]]+=1\r\n else:\r\n dic[ar[i]]=1\r\nprint(max(list(dic.values())))", "n=int(input())\r\nsize=input().split()\r\nsett=set(size)\r\nlist=[]\r\nfor i in sett:\r\n list.append(size.count(i))\r\nlist.sort()\r\nprint(list[-1])", "from collections import *\r\ninput()\r\nprint(max(Counter(input().split()).values()))", "n = int(input())\r\narr = list(map(int, input().split(maxsplit=n)))\r\nres = {}\r\nfor i in arr:\r\n res[i] = arr.count(i)\r\nmax_val = max(res.values())\r\nprint(max_val)", "from collections import Counter\r\nmp = Counter()\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nmx = 0\r\nfor i in arr:\r\n\tmp[i] += 1\r\n\tmx = max(mp[i], mx)\r\nprint(mx)\r\n", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\nimport sys\r\nimport threading\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom string import ascii_lowercase \r\nfrom functools import lru_cache\r\nfrom collections import deque\r\nimport heapq\r\n\r\n############ ---- Input Functions ---- ############\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 main():\r\n \r\n num = inp()\r\n arr = inlt()\r\n \r\n arr = Counter(arr)\r\n \r\n answer = 0\r\n for key in arr:\r\n answer = max(answer, arr[key])\r\n \r\n print(answer)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nthreading.stack_size(1 << 27)\r\nsys.setrecursionlimit(1 << 30)\r\nmain_thread = threading.Thread(target=main)\r\nmain_thread.start()\r\nmain_thread.join()\r\n \r\n \r\n \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\nl.sort(reverse=True)\r\nan = [l[0]]\r\nfor i in range(1,n):\r\n an.sort()\r\n t1 = -1\r\n for j in range(len(an)):\r\n if l[i]<an[j]:\r\n t1 = j\r\n break\r\n if t1==-1:\r\n an.append(l[i])\r\n else:\r\n an[t1] = l[i]\r\nprint(len(an))", "n = int(input())\na = sorted(list(map(int, input().split())))\nbox = [a[-1]]\nfor i in range(n - 2, -1, -1):\n\tf = 0\n\tfor j in range(len(box)):\n\t\tif a[i] < box[j]:\n\t\t\tbox[j] = a[i]\n\t\t\tf = 1\n\t\t\tbreak\n\tif f == 0:\n\t\tbox.append(a[i])\nprint(len(box))", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it\r\nfrom collections import Counter\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nc = Counter(l)\r\nans = 1\r\nfor i in c:\r\n ans=max(ans,c[i])\r\nprint(ans)", "a=int(input())\r\nb=dict()\r\nfor i in map(int,input().split()):b[i]=b.get(i,0)+1\r\nprint(max(b.values()))", "class Solution:\r\n def returnMinVisibleBoxes(self,n,A):\r\n frequency={}\r\n for i in range(n):\r\n if(frequency.get(A[i]) is not None): frequency[A[i]]+=1\r\n else: frequency[A[i]]=1\r\n return max(frequency.values())\r\nif __name__==\"__main__\":\r\n S=Solution()\r\n n=int(input())\r\n A=list(map(int,input().split()))\r\n print(S.returnMinVisibleBoxes(n,A))", "n = int(input())\na = list(map(int, input().split()))\nmemo = {}\n\nfor i in range(n):\n if a[i] not in memo:\n memo[a[i]] = 1\n else:\n memo[a[i]] += 1\nans = 0\nfor i in memo:\n ans = max(ans, memo[i])\nprint(ans)\n\t\t\t \t \t \t\t\t\t \t\t \t \t \t \t \t", "from collections import Counter\r\n\r\nn = int(input())\r\nboxes = list(map(int, input().split()))\r\nsizes = Counter(boxes)\r\nprint(max(sizes.values()))", "t = int(input())\n\nv = sorted(list(map(int, input().split())))\n\nq = t\ni = 0\nj = 1\nwhile(j < t):\n if(v[j] - v[i] > 0):\n q -= 1\n i += 1\n j += 1\n\nprint(q)\n\t \t\t\t\t \t \t\t\t \t\t\t\t \t \t \t\t", "'''\r\nprobably I am not getting the box packing rules\r\n'''\r\nif __name__ == \"__main__\":\r\n n=int(input())\r\n nums=[int(i) for i in input().split()]\r\n freq_hashmap={}\r\n for num in nums:\r\n freq_hashmap[num]=freq_hashmap.get(num,0)+1\r\n \r\n print(max(freq_hashmap.values()))", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\nn = int(input())\r\n\r\nd = defaultdict(lambda : 0)\r\n\r\narr = list(map(int, stdin.readline().rstrip().split(\" \")))\r\n\r\nfor ele in arr:\r\n d[ele] += 1\r\n\r\nprint(max(d.values()))\r\n\r\n", "from statistics import mode\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nans=a.count(mode(a))\r\nprint(ans)", "from collections import Counter\r\ndef proC(arr):\r\n arr.sort(reverse=True)\r\n dic=Counter(arr)\r\n \r\n for i,j in dic.items():\r\n if(i==max(arr)):\r\n ans=j\r\n continue\r\n if(j<=ans):\r\n continue\r\n ans+= j-ans\r\n return ans\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(proC(arr))", "from collections import Counter\r\nn=int(input())\r\nkorobki=list(map(int,input().split()))\r\nprint(Counter(korobki).most_common(1)[0][1])", "\nminput = input().rstrip().split()\n\nn = int(minput[0])\n\n#d = int(minput[1])\n\nnums = list(map(int, input().rstrip().split()))\nnums.sort()\ncount=0\nhashmap={}\nfor i in nums:\n if i in hashmap:\n hashmap[i]+=1\n else:\n hashmap[i]=1\n\nfor i in hashmap:\n count=max(count,hashmap[i])\n\nprint(count)\n \t\t \t\t \t\t\t\t \t \t\t\t\t \t \t\t", "from collections import Counter\n\nn = int(input())\nboxes = Counter(int(x) for x in input().split())\n\nprint(boxes.most_common(1)[0][1])\n\n\t \t \t \t \t\t \t \t \t \t\t\t\t\t\t\t\t\t \t", "n = int(input())\r\nd = list(map(int, input().split()))\r\nmx = 0\r\nfor i in range (n):\r\n if(d.count(d[i]) > mx):\r\n mx = d.count((d[i]))\r\nprint(mx)", "import sys\n\nn = int(sys.stdin.readline())\nls = list(map(int, sys.stdin.readline().split()))\ncount_dict = {}\nfor i in ls:\n count_dict.setdefault(i, 0)\n count_dict[i] += 1\nls1 = sorted([(k, v) for k, v in count_dict.items()], key=lambda x: x[1])\nprint(ls1[-1][1])", "leng=int(input())\r\narr=list(map(int,input().split()))\r\nd=dict()\r\nans=0\r\nfor i in arr:\r\n d[i]=d.get(i,0)+1 \r\nfor v in d.values():\r\n ans=max(ans,v)\r\nprint(ans)", "from collections import Counter\r\nn = int(input())\r\nlst = list(map(int, input().strip().split()))\r\ncount = Counter(lst)\r\nprint(max(count.values()))", "import sys, bisect, math\r\nfrom collections import deque, Counter\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\nceil = lambda x: math.ceil(x)\r\nmod = 10**9 + 7\r\n\r\ndef solve():\r\n n=int(input())\r\n a=list(map(int, input().split()))\r\n d=Counter(a) \r\n return d[max(d, key=lambda k: d[k])]\r\n\r\nif __name__ == \"__main__\":\r\n t=1\r\n # t = int(input())\r\n for _ in range(t):\r\n print(solve())", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nl.append(-1)\r\ns , M = 1 , 1\r\nfor i in range(1,n+1):\r\n if l[i] == l[i-1] :\r\n s += 1\r\n else :\r\n M = max(M,s)\r\n s = 1\r\nprint(M)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\ni=0\r\na.sort()\r\nc=[]\r\nans=n\r\nfor i in range(n):\r\n ans1=a[i]\r\n if i not in c:\r\n for j in range(i+1,n):\r\n if ans1<a[j] and j not in c:\r\n c.append(j)\r\n ans -=1\r\n ans1=a[j]\r\nprint(ans)", "n = int(input())\r\narr = input().split()\r\nc = 0\r\nres = n\r\nwhile res!=0:\r\n x = set(arr)\r\n for i in x:\r\n arr.remove(i)\r\n res -= len(x)\r\n c+=1\r\nprint(c)\r\n\r\n\r\n", "input()\nx= input().split(\" \")\narr=[int(y) for y in x]\n\narr.sort()\nm=arr[-1]\nlenx =len(arr)\nindx=lenx-1\nfor i in range(lenx):\n if arr[indx]<arr[-1]:\n arr.pop(arr.index(arr[-1]))\n indx-=1\n\nprint (len(arr))\n \n\t \t \t\t\t \t \t \t \t \t \t\t\t", "l1 = int(input())\nl2 = input().split()\n\nlul = []\nobj = {}\nfor i in range(l1):\n x = l2[i]\n if x in obj:\n obj[x] += +1\n else:\n obj[x] = 1\n\nall_values = obj.values()\nmax_value = max(all_values)\n\nprint(max_value)\n \t \t\t\t\t\t\t\t\t \t\t \t \t", "\t\t###~~~LOTA~~~###\r\nd={}\r\na=int(input())\r\nl=list(map(int,input().split()))\r\nx=0\r\nfor i in l:\r\n\tif i not in d:\r\n\t\td[i]=1\r\n\telse:\r\n\t\td[i]+=1\r\n\tif d[i]>x:\r\n\t\tx=d[i]\r\nprint(x)", "n = int(input())\nl = list(map(int, input().split()))\nm = max(map(l.count, set(l)))\nprint(m)\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\nval=0\r\nl.sort()\r\nc=0\r\nfor i in range(n-1):\r\n if c==0:\r\n c+=1\r\n if l[i]==l[i+1]:\r\n \r\n c+=1 \r\n if i==(n-2):\r\n \r\n if c>val:\r\n val=c \r\n else:\r\n if c>val:\r\n val=c \r\n c=0 \r\nif val==0:\r\n print(1)\r\nelse:\r\n print(val)\r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nhm = {}\r\nans = 0\r\nfor i in arr:\r\n hm[i] = 1 if i not in hm else hm[i]+1\r\n \r\n ans = max(hm[i], ans)\r\n \r\nprint(ans)\r\n\r\n" ]

[ "def f():\n p, q, n = [0], [0], int(input())\n input()\n for i in range(1, n):\n t = input()[:i]\n if '0' in t:\n if '1' in t:\n for l, j in enumerate(p):\n if t[j] == '1':\n for r, j in enumerate(q):\n if t[j] == '0':\n if l + r == i:\n break\n return str(p[l] + 1) + ' ' + str(q[r] + 1) + ' ' + str(i + 1)\n break\n p.insert(l, i)\n q.insert(i - l, i)\n else:\n p.append(i)\n q = [i] + q\n else:\n p = [i] + p\n q.append(i)\n return -1\n\nprint(f())\n\n \t\t \t \t\t\t\t \t\t\t \t \t \t\t \t" ]

[ "import sys\r\n\r\n\r\ndef solve(first_color, second_color, need):\r\n if need < 2 or min(len(first_color), len(second_color)) < 1 or len(first_color) + len(second_color) < need:\r\n return -1\r\n total = -first_color[0] - second_color[0]\r\n temp = []\r\n for cur_iter in range(1, len(first_color)):\r\n temp.append(first_color[cur_iter])\r\n for cur_iter in range(1, len(second_color)):\r\n temp.append(second_color[cur_iter])\r\n temp.sort()\r\n for cur_iter in range(need - 2):\r\n total -= temp[cur_iter]\r\n return total\r\n\r\n\r\nn, k = map(int, sys.stdin.readline().strip().split())\r\ncosts = list(map(int, sys.stdin.readline().strip().split()))\r\ncolors = list(sys.stdin.readline().strip())\r\n\r\ncolored_costs = dict()\r\ncolored_costs['R'] = []\r\ncolored_costs['O'] = []\r\ncolored_costs['W'] = []\r\n\r\nfor i in range(n):\r\n colored_costs[colors[i]].append(-costs[i])\r\n\r\nfor key in colored_costs.keys():\r\n colored_costs[key].sort()\r\n\r\nans = solve(colored_costs['R'], colored_costs['O'], k)\r\nans = max(ans, solve(colored_costs['W'], colored_costs['O'], k))\r\n\r\nprint(ans)", "\r\n\r\ndef calca(_A, _B, k):\r\n A = _A.copy()\r\n B = _B.copy()\r\n n = len(A)\r\n m = len(B)\r\n ans = -int(1e9)\r\n for i in range(1, n):\r\n A[i] += A[i-1]\r\n for i in range(1, m):\r\n B[i] += B[i-1]\r\n for i in range(1, n):\r\n if k-i < m and k-i > 0:\r\n ans = max(ans, A[i] + B[k-i])\r\n return ans\r\n\r\n\r\ndef testCase():\r\n n, k = [int(x) for x in input().split()]\r\n nums = [int(x) for x in input().split()]\r\n ros = input()\r\n n = len(nums)\r\n A = []\r\n B = []\r\n C = []\r\n for i in range(n):\r\n if ros[i] == 'R':\r\n A.append(nums[i])\r\n elif ros[i] == 'O':\r\n B.append(nums[i])\r\n else:\r\n C.append(nums[i])\r\n A.sort()\r\n A.append(0)\r\n A.reverse()\r\n B.sort()\r\n B.append(0)\r\n B.reverse()\r\n C.sort()\r\n C.append(0)\r\n C.reverse()\r\n ans = max(calca(A, B, k), calca(B, C, k))\r\n print(-1 if ans == -int(1e9) else ans)\r\n\r\n\r\ntestCase()\r\n", "n,k = map(int, input().split())\r\nb = list(map(int,input().split()))\r\n\r\nSSSSSSSSSS = input()\r\n\r\nINF = 1000*1000*1000+123\r\nRRRR = [];\r\nWWWWWWW = [];\r\nOOOOOOOOO = [];\r\n\r\nfor i in range(n):\r\n if SSSSSSSSSS[i] == 'R':\r\n RRRR.append(b[i])\r\n elif SSSSSSSSSS[i] == 'W':\r\n WWWWWWW.append(b[i])\r\n else:\r\n OOOOOOOOO.append(b[i])\r\n\r\n\r\n\r\nWWWWWWW.sort()\r\n\r\nRRRR.sort()\r\nWWWWWWW.reverse()\r\nRRRR.reverse()\r\nOOOOOOOOO.sort()\r\nOOOOOOOOO.reverse()\r\n\r\nif k == 1:\r\n print(-1)\r\n exit(0)\r\n\r\n\r\ndef cccmcmc(A, B):\r\n qanakA = len(A);\r\n qanakB = len(B);\r\n\r\n pA = [0 for i in range(qanakA)]\r\n pB = [0 for i in range(qanakB)]\r\n pB[0] = B[0]\r\n pA[0] = A[0]\r\n\r\n for i in range(1,qanakA):\r\n pA[i] = pA[i-1] + A[i];\r\n for i in range(1,qanakB):\r\n pB[i] = pB[i-1] + B[i];\r\n\r\n res = -1\r\n\r\n for i in range(1,min(qanakA+1,k)):\r\n aic = pA[i-1]\r\n bepetk = k-i\r\n if bepetk <= 0 or bepetk > qanakB: continue\r\n bic = pB[bepetk-1]\r\n res = max(res,aic+bic)\r\n return res\r\n\r\n\r\nres = -1\r\n\r\nif len(WWWWWWW) > 0 and len(OOOOOOOOO)> 0:\r\n res = max(res, cccmcmc(WWWWWWW, OOOOOOOOO))\r\nif len(RRRR) > 0 and len(OOOOOOOOO)> 0:\r\n res = max(res, cccmcmc(RRRR, OOOOOOOOO))\r\n\r\nprint(res)\r\n", "n,k = map(int, input().split())\r\nb = list(map(int,input().split()))\r\n\r\ns = input()\r\n\r\n# print(n,k)\r\n# print(b)\r\n# print(s)\r\n\r\nINF = 1000*1000*1000+123\r\nR = [];\r\nW = [];\r\nO = [];\r\n\r\nfor i in range(n):\r\n if s[i] == 'R':\r\n R.append(b[i])\r\n elif s[i] == 'W':\r\n W.append(b[i])\r\n else:\r\n O.append(b[i])\r\n\r\n\r\nR.sort()\r\nR.reverse()\r\n\r\nW.sort()\r\nW.reverse()\r\n\r\nO.sort()\r\nO.reverse()\r\n\r\n# print('--------')\r\n\r\n# print(\"-\",)\r\n\r\nif k == 1:\r\n print(-1)\r\n exit(0)\r\n\r\n\r\ndef solve(A,B):\r\n # print(\"\\nsolve\");\r\n # print(A);\r\n # print(B);\r\n nA = len(A);\r\n nB = len(B);\r\n\r\n pA = [0 for i in range(nA)]\r\n pB = [0 for i in range(nB)]\r\n\r\n pA[0] = A[0]\r\n pB[0] = B[0]\r\n\r\n for i in range(1,nA):\r\n pA[i] = pA[i-1] + A[i];\r\n for i in range(1,nB):\r\n pB[i] = pB[i-1] + B[i];\r\n\r\n # print(\"pA\",pA)\r\n # print(\"pB\",pB)\r\n\r\n res = -1\r\n\r\n for i in range(1,min(nA+1,k)):\r\n\r\n costA = pA[i-1]\r\n bNeed = k-i\r\n if bNeed <= 0 or bNeed > nB: continue\r\n costB = pB[bNeed-1]\r\n res = max(res,costA+costB)\r\n return res\r\n\r\n\r\nres = -1\r\nif len(R) > 0 and len(O)> 0:\r\n res = max(res,solve(R,O))\r\n\r\nif len(W) > 0 and len(O)> 0:\r\n res = max(res,solve(W,O))\r\n\r\nprint(res)\r\n\r\n#\r\n# a = [\r\n# 6,5,37,10,22,9,2,16,3,3,11,9,5,14,11,3,1,4,6,2,7,\r\n# 3,7,5,4,8,2,7,13,16,15,9,4,4,2,3,9,5,11,3,7,5,9,\r\n# 3,8,9,4,10,3,2,7,6,9,3,5,4,6,4,14,3,12,6,8,12,7\r\n# ]\r\n#\r\n# print(a)\r\n#\r\n# cnt = [0] * 1000\r\n#\r\n# for e in a:\r\n# cnt[e] += 1\r\n#\r\n# a = set(a)\r\n# a = sorted(a)\r\n#\r\n#\r\n# for e in a:\r\n# print(\"%d %d\"%(e,cnt[e]));\r\n" ]

[ "from sys import stdin,stdout\r\ninput,print = stdin.readline,stdout.write\r\nx,y = list(map(int,input().split()))\r\nans = \"\"\r\npos = True\r\nwhile True:\r\n if x>y:\r\n cur = (x-1)//y\r\n ans+=str(cur)+\"A\"\r\n x-=cur*y\r\n elif y>x:\r\n cur = (y-1)//x\r\n ans+=str(cur)+\"B\"\r\n y-=cur*x\r\n else:\r\n if x==1:\r\n break\r\n else:\r\n pos = False\r\n break\r\nif pos:\r\n print(ans+\"\\n\")\r\nelse:\r\n print(\"Impossible\\n\")\r\n", "def gcd(a,b):\n\n if b==0:\n\n return a\n\n else:\n\n return gcd(b, a%b)\n\n \n\ndef solve(x, y, a, b):\n\n ans=\"\"\n\n while not x==1 or not y==1:\n\n if x < y:\n\n x,y,a,b=y,x,b,a\n\n ans+=str((x-1)//y)+a\n\n x = x - (x-1)//y * y\n\n print (ans)\n\n \n\nx,y=map(int, input().split())\n\nif gcd(x,y)>1:\n\n print (\"Impossible\")\n\nelse:\n\n solve(x,y, \"A\", \"B\")\n\n\n\n# Made By Mostafa_Khaled", "def gcd(a,b):\n\tif b==0:\n\t\treturn a\n\tif a//b!=0:\n\t\tl.append(a//b)\n\treturn gcd(b,a%b)\n\nl=[]\nt=[\"A\",\"B\"]\nx,y=map(int,input().split())\ng=gcd(x,y)\n\nl[-1]-=1\nif g==1:\n\tif x>y:\n\t\tstart=0\n\telse:\n\t\tstart=1\n\ts=''\n\tfor v in range(len(l)):\n\t\ts+=str(l[v])+t[(start+v)%2]\n\tprint(s)\n\n\nelse:\n\tprint('Impossible')\n", "def f(x,y):\n m=x\n n=y\n s=''\n while(m!=0 and n!=0):\n if(m>=n):\n r=m//n\n m=m%n\n c='A'\n else:\n r=n//m\n n=n%m\n c='B'\n if (m==0 or n==0):\n if(r>1):\n s=s+str(r-1)+c\n else:\n s=s+str(r)+c\n if(m+n>1):\n return 'Impossible'\n\n else:\n return s\n\ninp=input()\n[x,y]=[int(t) for t in inp.split(' ')]\nprint(f(x,y))\n", "import sys\nread = lambda: list(map(int, sys.stdin.readline().split()))\nx, y = read()\n\nres = []\nc = 'A'\nwhile x * y > 1:\n k = min(x // y, x - 1)\n if k > 0:\n res.append('{}{}'.format(k, c))\n x, y = y, x - k*y\n c = 'A' if c == 'B' else 'B'\n\nif x == 0 or y == 0:\n print('Impossible')\nelse:\n print(''.join(res))\n\n", "import math\r\nfrom collections import deque\r\n\r\nclass Frac:\r\n def __init__(self, up, down=1):\r\n self.up = up\r\n self.down = down\r\n g = math.gcd(abs(up), abs(down))\r\n self.up //= g\r\n self.down //= g\r\n if self.up == 0:\r\n self.down = abs(self.down)\r\n if self.down < 0:\r\n self.up = -self.up\r\n self.down = -self.down\r\n\r\n def __add__(self, other):\r\n return Frac(self.up * other.down + self.down * other.up, other.down * self.down)\r\n\r\n def __sub__(self, other):\r\n return Frac(self.up * other.down - self.down * other.up, other.down * self.down)\r\n\r\n def __mul__(self, other):\r\n return Frac(self.up * other.up, self.down * other.down)\r\n\r\n def __truediv__(self, other):\r\n return Frac(self.up * other.down, self.down * other.up)\r\n\r\n def __iadd__(self, other):\r\n res = Frac(self.up * other.down + self.down * other.up, other.down * self.down)\r\n self.up = res.up\r\n self.down = res.down\r\n return self\r\n\r\n def __isub__(self, other):\r\n res = Frac(self.up * other.down - self.down * other.up, other.down * self.down)\r\n self.up = res.up\r\n self.down = res.down\r\n return self\r\n\r\n def __imul__(self, other):\r\n res = Frac(self.up * other.up, self.down * other.down)\r\n self.up = res.up\r\n self.down = res.down\r\n return self\r\n\r\n def __idiv__(self, other):\r\n res = Frac(self.up * other.down, self.down * other.up)\r\n self.up = res.up\r\n self.down = res.down\r\n return self\r\n\r\n def __lt__(self, other):\r\n return self.up * other.down < self.down * other.up\r\n\r\n def __le__(self, other):\r\n return self.up * other.down <= self.down * other.up\r\n\r\n def __gt__(self, other):\r\n return self.up * other.down > self.down * other.up\r\n\r\n def __ge__(self, other):\r\n return self.up * other.down >= self.down * other.up\r\n\r\n def __eq__(self, other):\r\n return self.up * other.down == self.down * other.up\r\n\r\n def __ne__(self, other):\r\n return not (self == other)\r\n\r\n def __str__(self):\r\n if self.up == 0:\r\n return \"0\"\r\n if self.down == 1:\r\n return str(self.up)\r\n return str(self.up) + \"/\" + str(self.down)\r\n\r\n\r\ndef testcase():\r\n x, y = map(int, input().split())\r\n\r\n if math.gcd(x, y) != 1:\r\n print(\"Impossible\")\r\n return\r\n\r\n q = deque()\r\n\r\n ans = \"\"\r\n res = Frac(x, y)\r\n q.append(Frac(1, 1))\r\n\r\n L = Frac(0, 1)\r\n R = Frac(1, 0)\r\n\r\n while q:\r\n M = q.popleft()\r\n\r\n if M == res:\r\n break\r\n\r\n if res < M:\r\n lo = 1\r\n hi = int(1e20);\r\n tmp = 1\r\n tmpM = M\r\n while lo <= hi:\r\n mid = (lo + hi) // 2\r\n a = Frac(M.up + L.up * mid, M.down + L.down * mid)\r\n if res >= a:\r\n tmp = mid\r\n tmpM = a\r\n R = Frac(a.up - L.up, a.down - L.down);\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n ans += str(tmp) + \"B\"\r\n M = tmpM\r\n q.append(M);\r\n else:\r\n lo = 1\r\n hi = int(1e20)\r\n tmp = 1\r\n tmpM = M\r\n while lo <= hi:\r\n mid = (lo + hi) // 2\r\n a = Frac(M.up + R.up * mid, M.down + R.down * mid)\r\n if res <= a:\r\n tmp = mid\r\n tmpM = a\r\n L = Frac(a.up - R.up, a.down - R.down);\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n ans += str(tmp) + \"A\"\r\n M = tmpM\r\n q.append(M)\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n # t = int(input())\r\n cs = 1\r\n while t:\r\n # print(\"Case\", cs, \":\", end=\" \")\r\n testcase()\r\n cs += 1\r\n t -= 1\r\n", "a,b=map(int,input().split())\r\ns=''\r\nboo=True\r\nwhile True:\r\n if a>b:\r\n mod=(a-1)//b\r\n s+=str(mod)+'A'\r\n a-=mod*b\r\n continue\r\n elif b>a:\r\n mod=(b-1)//a\r\n s+=str(mod)+'B'\r\n b-=mod*a\r\n continue\r\n else:\r\n if a==1:\r\n break\r\n else:\r\n boo=False\r\n break\r\nif boo:\r\n print(s)\r\nelse:\r\n print('Impossible')", "x , y = map ( int , input ( ) . split ( ) )\r\n\r\nx -= 1\r\ny -= 1\r\n\r\nif x == 0 :\r\n print(y,'B',sep='')\r\n exit()\r\nif y == 0 :\r\n print(x,'A',sep='')\r\n exit()\r\n\r\n\r\n\r\na , b = 0 , 1\r\n\r\nu , v = 1 , 0\r\n\r\nAns = [ [ 0,'C' ] ]\r\n\r\ndef isinbet (a,b,x,y,u,v) :\r\n if a*y <= x*b and u*y >= x*v :\r\n return 1\r\n return 0\r\n\r\ndef isfor () :\r\n if isinbet(a,b,x-a,y-b,u+a,v+b) :\r\n return 1\r\n return 0\r\n\r\ndef isbac () :\r\n if isinbet(a+u,b+v,x-u,y-v,u,v) :\r\n return 1\r\n return 0\r\n \r\ndef gofor () :\r\n\r\n global a,b,x,y,u,v,Ans\r\n \r\n l = 1\r\n r = max(x,y)\r\n \r\n while l < r : \r\n \r\n c = ( l + r + 1 ) // 2\r\n \r\n if isinbet ( a , b , x - a*c , y - b*c , u + a*c , v + b*c ):\r\n l = c\r\n else :\r\n r = c - 1\r\n \r\n x-=a*l\r\n y-=b*l\r\n \r\n u+=a*l\r\n v+=b*l\r\n \r\n \r\n if Ans[-1][1] != 'B' :\r\n Ans += [ [ l , 'B' ] ]\r\n else :\r\n Ans[-1][0] += l\r\n\r\ndef gobac () :\r\n \r\n global a,b,x,y,u,v,Ans\r\n \r\n l = 1\r\n r = max(x,y)\r\n \r\n while l < r : \r\n \r\n c = ( l + r + 1 ) // 2\r\n \r\n if isinbet ( a + u*c , b + v*c , x - u*c , y - v*c , u , v ):\r\n l = c\r\n else :\r\n r = c - 1\r\n \r\n x-=u*l\r\n y-=v*l\r\n \r\n a+=u*l\r\n b+=v*l\r\n \r\n \r\n if Ans[-1][1] != 'A' :\r\n Ans += [ [ l , 'A' ] ]\r\n else :\r\n Ans[-1][0] += l\r\n \r\nwhile 1 :\r\n\r\n if isfor() != 0 :\r\n \r\n gofor()\r\n continue\r\n \r\n if isbac() != 0 :\r\n \r\n gobac()\r\n continue\r\n \r\n break\r\n\r\nif x== 0 and y == 0 :\r\n for i in range ( 1 , len(Ans) ) :\r\n print(Ans[i][0],Ans[i][1],sep=\"\",end='')\r\nelse:\r\n print(\"Impossible\")\r\n", "def gcd(x, y):\r\n\tif y == 0:\r\n\t\treturn x\r\n\treturn gcd(y, x % y)\r\nx, y = map(int, input().split())\r\nif gcd(x, y) != 1:\r\n\tprint('Impossible')\r\n\texit()\r\na = []\r\nwhile y != 1:\r\n\ta += [x // y]\r\n\tx %= y\r\n\tx, y = y, x\r\na += [x-1]\r\ns = 'A'\r\nfor x in a:\r\n\tif x > 0:\r\n\t\tprint(x, end=s)\r\n\ts = 'AB'.replace(s, '') \r\n", "def egcd(a, b):\n Q = []\n while b:\n q, r = divmod(a, b)\n Q.append(q)\n a, b = b, r\n return a, Q\n\n\ndef cards(x, y):\n d, Q = egcd(x, y)\n # log(x, y, d, Q)\n if d != 1:\n return 'Impossible'\n Q[-1] -= 1\n b = False\n l = []\n for q in Q:\n if q:\n l.append(str(q))\n l.append('AB'[b])\n b = not b\n s = ''.join(l)\n # verify(x, y, s)\n return s\n\n\ndef verify(x, y, s):\n log(s)\n AB = [(1, 0), (0, 1)]\n for k, c in tokens(s):\n log(AB, k, c)\n c_ = not c\n AB[c_] = AB[c_][0] + k*AB[c][0], AB[c_][1] + k*AB[c][1]\n r = AB[0][0] + AB[1][0], AB[0][1] + AB[1][1]\n log(AB, r)\n assert r == (x, y)\n\n\ndef tokens(s):\n fa = s.find('A')\n fb = s.find('B')\n assert fa >= 0 or fb >= 0\n b = (fa < 0 or (fb >= 0 and fa > fb))\n i = 0\n while i < len(s):\n i_ = s.find('AB'[b], i)\n assert i_ >= 0\n yield (int(s[i:i_]), b)\n i = i_ + 1\n b = not b\n\n\ndef main():\n x, y = map(int, input().split())\n print(cards(x, y))\n\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}Got:\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n1 4\n\"\"\", \"\"\"\\\n3B\n\"\"\"), (\"\"\"\\\n2 2\n\"\"\", \"\"\"\\\nImpossible\n\"\"\"), (\"\"\"\\\n3 2\n\"\"\", \"\"\"\\\n1A1B\n\"\"\")]\n\n\nif __name__ == '__main__':\n from argparse import ArgumentParser\n parser = ArgumentParser()\n parser.add_argument('--test', '-t', type=int, nargs='*')\n args = parser.parse_args()\n main() if args.test is None else test(args.test)\n\n", "import fractions\ndef solve(x, y):\n if fractions.gcd(x, y) > 1: return 'Impossible'\n turn = x > y\n if not turn: x, y = y, x\n ans = []\n while x != 0 and y != 0:\n ans.append((x//y, 'A' if turn else 'B'))\n x, y = y, x%y\n turn = not turn\n ans[-1] = (ans[-1][0]-1, ans[-1][1])\n return ''.join(str(n) + l for n, l in ans)\n\nx, y = [int(x) for x in input().split()]\nprint(solve(x, y))\n", "def gcd(a, b):\r\n return gcd(b, a % b) if b else a\r\n\r\nwhile 1:\r\n try:\r\n x, y = map(int, input().split())\r\n except:\r\n break\r\n\r\n if gcd(x, y) != 1:\r\n print('Impossible')\r\n continue\r\n\r\n res=''\r\n while x > 0 and y > 0:\r\n if x > y:\r\n cnt, give = x // y, 'A'\r\n x %= y\r\n else:\r\n cnt, give = y // x, 'B'\r\n y %= x\r\n if x == 0 or y == 0:\r\n cnt -= 1\r\n res += str(cnt) + give\r\n\r\n print(res)\r\n", "a = input().split()\r\ntarget = (int(a[0]), int(a[1]))\r\nx=(1, 0)\r\ny=(0, 1)\r\ntoadd=\"A\"\r\nans = \"\"\r\ndef less(a, b):\r\n return a[0]*b[1]<b[0]*a[1]\r\nwhile True:\r\n z = (x[0]+y[0], x[1]+y[1])\r\n if z[0] > target[0] or z[1] > target[1]:\r\n print(\"Impossible\")\r\n exit()\r\n if z==target:\r\n print(ans)\r\n exit()\r\n if less(z, target): # z replaces y\r\n low = 1\r\n high = int(1e18)\r\n while (high > low):\r\n guess = (low+high+1)//2\r\n if less((x[0]*guess+y[0], x[1]*guess+y[1]), target):\r\n low = guess\r\n else:\r\n high = guess - 1\r\n ans += str(low)\r\n ans += \"A\"\r\n y = (y[0] + low * x[0], y[1] + low * x[1])\r\n elif less(target, z):\r\n low = 1\r\n high = int(1e18)\r\n while (high > low):\r\n guess = (low+high+1)//2\r\n if less(target,(x[0]+guess*y[0], x[1]+guess*y[1])):\r\n low = guess\r\n else:\r\n high = guess - 1\r\n ans += str(low)\r\n ans += \"B\"\r\n x = (x[0] + low * y[0], x[1] + low * y[1])\r\n else:\r\n print(\"Impossible\")\r\n exit()\r\n ", "from operator import gt, lt\r\n\r\nx, y = (int(w) for w in input().split())\r\n\r\nif x>y:\r\n ch = 'AB'\r\n op1, op2 = lt, gt\r\n ax, ay, bx, by = 1, 0, 0, 1\r\nelse:\r\n ch = 'BA'\r\n op1, op2 = gt, lt\r\n ax, ay, bx, by = 0, 1, 1, 0\r\n\r\nans = []\r\n\r\nwhile(ax+ay+bx+by < x+y):\r\n n=0\r\n for sh in range(59,-1,-1):\r\n t = n + (1<<sh)\r\n if op1(y * (bx + t*ax), x * (by + t*ay)): n = t\r\n if not n:\r\n print('Impossible')\r\n exit(0)\r\n ans.append(n)\r\n ax, bx = bx + n*ax, ax # Increment and swap\r\n ay, by = by + n*ay, ay # Increment and swap\r\n op1, op2 = op2, op1\r\n\r\nfor i,a in enumerate(ans): print('%d%s' % (a, ch[i&1]), end='')\r\nprint()\r\n", "x, y = (int(w) for w in input().split())\r\n\r\nax, ay = 1, 0\r\nbx, by = 0, 1\r\n\r\nanext = (x>y)\r\nch = 'AB' if x>y else 'BA'\r\n\r\nans = []\r\n\r\nwhile(ax+ay+bx+by < x+y):\r\n if(anext):\r\n n=0\r\n for sh in range(59,-1,-1):\r\n t = n + (1<<sh)\r\n #print('Aiming for', x/y)\r\n if y * (bx + t*ax) < x * (by + t*ay):\r\n n = t\r\n #print('Include', sh)\r\n if not n:\r\n print('Impossible')\r\n exit(0)\r\n ans.append(n)\r\n bx = bx + n*ax\r\n by = by + n*ay\r\n else:\r\n n=0\r\n for sh in range(59,-1,-1):\r\n t = n + (1<<sh)\r\n #print('Beaming for', x/y)\r\n #print(y, ' * (', ax, ' + ', t, '*', bx, ') > ', x, ' * (', ay, ' * ', t, '*', by, ')')\r\n if y * (ax + t*bx) > x * (ay + t*by):\r\n #print(y * (ax + t*bx), '>', x * (ay * t*by))\r\n n = t\r\n #print('Include', sh)\r\n if not n:\r\n print('Impossible')\r\n exit(0)\r\n ans.append(n)\r\n ax = ax + n*bx\r\n ay = ay + n*by\r\n anext = not anext\r\n\r\nfor i,a in enumerate(ans):\r\n print('%d%s' % (a, ch[i&1]), end='')\r\nprint()\r\n", "def gcd(x, y):\r\n while y > 0:\r\n x, y = y, x % y\r\n return x\r\nx, y = map(int, input().split())\r\nif gcd(x, y) != 1:\r\n print (\"Impossible\")\r\n exit(0)\r\nres = \"\"\r\nwhile x > 0 and y > 0:\r\n if y > x:\r\n if x == 1:\r\n y -= 1\r\n res = res + str(y // x) + \"B\"\r\n y = y % x\r\n else:\r\n if y == 1:\r\n x -= 1\r\n res = res + str(x // y) + \"A\"\r\n x = x % y\r\nprint(res)\r\n" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, k = map(int, input().split())\r\ne = [tuple(map(int, input().split())) for _ in range(m)]\r\na = list(map(int, input().split()))\r\nz = [0] * (n + 1)\r\nfor i in a:\r\n z[i] = 1\r\ninf = pow(10, 9) + 1\r\nans = inf\r\nfor u, v, l in e:\r\n if z[u] ^ z[v]:\r\n ans = min(ans, l)\r\nans = (ans + 1) % (inf + 1) - 1\r\nprint(ans)", "n, m, k = map(int, input().split())\r\ng = [list(map(int, input().split())) for i in range(m)]\r\n\r\nif not k:\r\n print(-1)\r\nelse:\r\n st = set(map(int, input().split()))\r\n ans = list(c for a, b, c in g if (a in st)^(b in st))\r\n print(min(ans) if ans else -1)", "def main():\r\n n, m, k = map(int, input().split())\r\n if k == 0:\r\n return print(-1)\r\n edges = list()\r\n for _ in range(m):\r\n edges.append(tuple(map(int, input().split())))\r\n ass = list() if not k else set(map(int, input().split()))\r\n\r\n best = float('inf')\r\n for (a, b, l) in edges:\r\n if int(a in ass) + int(b in ass) == 1:\r\n best = min(best, l)\r\n\r\n print(-1 if best == float(\"inf\") else best)\r\n\r\n\r\nmain()\r\n", "from heapq import *\nimport math\n\nn, m, k = map(int, input().split())\nadj = [ [] for _ in range(n+1)]\nvisited = [0] * (n+1)\n\npars = dict()\n\nfor _ in range(m):\n u, v, w = map(int, input().split())\n if (u, v) not in pars:\n pars[(u, v)] = w\n pars[(v, u)] = w\n else:\n if w < pars[(u, v)]:\n pars[(u, v)] = w\n pars[(v, u)] = w\n\nfor (par, w) in pars.items():\n adj[par[0]].append((par[1], w))\n adj[par[1]].append((par[0], w))\n\nif k > 0 and k != n:\n cities = [int(i) for i in input().split()]\n h = []\n dist = [math.inf] * (n + 1)\n for city in cities:\n heappush(h, (0, city))\n\n while h:\n w, v = heappop(h)\n if visited[v] == 1:\n continue\n visited[v] = 1\n dist[v] = w\n for u, l in adj[v]:\n heappush(h, (w + l, u))\n\n mini = math.inf\n for num in dist:\n if num < mini and num > 0:\n mini = num\n if mini != math.inf:\n print(mini)\n else:\n print(-1)\nelse:\n print(-1)\n \t\t \t\t \t \t\t \t\t\t\t\t \t \t \t\t\t\t\t \t", "\r\nimport sys\r\n\r\ndef main():\r\n inp = input()\r\n inp = inp.split()\r\n n = int(inp[0])\r\n m = int(inp[1])\r\n k = int(inp[2])\r\n\r\n if k == 0:\r\n print(-1)\r\n return 0\r\n \r\n edges = []\r\n storages = set()\r\n ans = sys.maxsize\r\n\r\n for _ in range(m):\r\n inp = input()\r\n inp = inp.split()\r\n u = int(inp[0])\r\n v = int(inp[1])\r\n w = int(inp[2])\r\n edge = [u,v,w]\r\n edges.append(edge)\r\n\r\n inp = input()\r\n inp = inp.split()\r\n\r\n for inpu in inp:\r\n storage = int(inpu)\r\n storages.add(storage)\r\n \r\n\r\n for edge in edges:\r\n # if(edge[0] in storages or edge[1] in storages and not (edge[0] in storages and edge[1] in storages)):\r\n # ans = min(ans, edge[2])\r\n if(edge[0] in storages or edge[1] in storages):\r\n if not((edge[0] in storages and edge[1] in storages)):\r\n ans = min(ans, edge[2])\r\n if (ans == sys.maxsize):\r\n print(-1)\r\n return 0\r\n print(ans)\r\n return 0\r\n\r\nif __name__==\"__main__\":\r\n main()\r\n \r\n\r\n", "x,y,z=map(int,input().split())\r\nif(z==0):\r\n\tprint(-1)\r\nelse:\r\n\tans=10**10\r\n\ta=[[] for i in range(x)]\r\n\tfor i in range(y):\r\n\t\tu,v,l=map(int,input().split())\r\n\t\ta[u-1].append([v-1,l])\r\n\t\ta[v-1].append([u-1,l])\r\n\tb=list(map(int,input().split()))\r\n\tf=0\r\n\tc=[0]*x\r\n\tfor i in b:\r\n\t\tc[i-1]=1\r\n\tfor i in b:\r\n\t\tfor j in a[i-1]:\r\n\t\t\tif(j[1]<ans) and (c[j[0]]!=1):\r\n\t\t\t\tans=j[1]\r\n\t\t\t\tf=1\r\n\tif(f==0):\r\n\t\tprint(-1)\r\n\telse:\r\n\t\tprint(ans)", "import sys\nfrom heapq import heappush, heappop\n\n\nif __name__ == '__main__':\n n, m, k = map(int, sys.stdin.readline().strip().split())\n #Матрица расстояний\n mass = [[] for _ in range(n+1)]\n cityes = set()\n for _ in range(m):\n u, v, l = map(int, sys.stdin.readline().strip().split())\n mass[u].append((v, l))\n mass[v].append((u, l))\n cityes.add(u)\n cityes.add(v)\n\n\n\n if k > 0:\n city = set(map(int, sys.stdin.readline().strip().split()))\n\n answer = float('inf')\n\n \n #Алгоритм дейкстры из всех потенциальных точек \n #проход только по городам где может быть пекарня\n for v in (cityes - city):\n for u, w in mass[v]:\n if (u in city) and answer > w:\n answer = w\n\n\n if answer != float('inf'):\n print(answer)\n else:\n print('-1')\n\n #Если нет городов со складом сразу возвращаем -1\n else:\n print(-1)\n\n \t\t\t\t\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# For fast IO use sys.stdout.write(str(x) + \"\\n\") instead of print\r\nimport sys\r\nimport math\r\ninput = sys.stdin.readline\r\nfrom collections import deque\r\n\r\n# Constants\r\nMAX_N = 100005\r\nMAX = 1000000001\r\nMIN = -1000000001\r\nMOD = 1000000007\r\n\r\n# adj = [[] for i in range(MAX_N)]\r\n \r\ndef input_graph(n):\r\n for i in range(n):\r\n edge = get_list()\r\n adj[edge[0]].append(edge[1])\r\n adj[edge[1]].append(edge[0])\r\n \r\ndef print_adj(n):\r\n for i in range(0, n+1):\r\n print(i, adj[i])\r\n \r\n\r\nfor t in range(1):\r\n n, m, k = get_ints()\r\n edges = []\r\n ans = MAX\r\n \r\n for i in range(m):\r\n edges.append(get_list())\r\n \r\n arr = get_list()\r\n loc = set(arr)\r\n \r\n for i in range(m):\r\n if edges[i][0] not in loc and edges[i][1] in loc:\r\n ans = min(ans, edges[i][2])\r\n elif edges[i][1] not in loc and edges[i][0] in loc:\r\n ans = min(ans, edges[i][2])\r\n\r\n if ans == MAX:\r\n print(\"-1\")\r\n else:\r\n print(ans)", "n, m, k = map(int, input().split())\r\nGraph = []\r\nMuka = dict()\r\nfor i in range(1, n+1):\r\n Muka[i] = 0\r\nfor i in range(m):\r\n u, v, l = map(int, input().split())\r\n Graph.append([u, v, l])\r\n\r\nif k > 0:\r\n Muka2 = list(map(int, input().split()))\r\n for item in Muka2:\r\n Muka[item] = 1\r\n cheap = 6000000000\r\n\r\n for i in range(len(Graph)):\r\n if Muka[Graph[i][0]] != Muka[Graph[i][1]]:\r\n cheap = min(cheap, Graph[i][2])\r\n\r\n if cheap == 6000000000:\r\n print(-1)\r\n else:\r\n print(cheap) \r\nelse:\r\n print(-1)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nd = [0]*n\r\ng = [map(int, input().split()) for _ in range(m)]\r\nfor i in map(int, input().split()):\r\n d[i-1] = 1\r\nx = 1e10\r\nfor a,b,c in g:\r\n if (d[a-1] == 1 and d[b-1] == 0) or (d[a-1] == 0 and d[b-1] == 1):\r\n x = min(c, x)\r\nprint(x if x != 1e10 else -1)", "\n\ndef solve():\n\tn,m,k = map(int,input().split())\n\tadj = [[]for i in range(n)]\n\tfor i in range(m):\n\t\tu,v,l = map(int,input().split())\n\t\tadj[u-1].append((v-1,l))\n\t\tadj[v-1].append((u-1,l))\n\tif k>0:\n\t\tarr = list(map(int,input().split()))\n\telse:\n\t\tprint(-1)\n\t\treturn\n\tans = 1e10\n\tvis = [0]*n\n\tfor i in arr:\n\t\tvis[i-1] = True\n\tfor i in range(n):\n\t\tif vis[i]:\n\t\t\tfor j in adj[i]:\n\t\t\t\tif not vis[j[0]]:\n\t\t\t\t\tans = min(ans,j[1])\n\tif ans == 1e10:\n\t\tprint(-1)\n\telse:\n\t\tprint(ans)\n\n\t\n\n\n\n\n\n\n\n\n\n\t\n\n\n\n\n# number of test cases\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "n,m,k = map(int,input().split())\r\nl = []\r\nfor i in range(m):\r\n a,b,c = map(int,input().split())\r\n l.append((a,b,c))\r\nseen = set()\r\nif k>0:\r\n l1 = list(map(int,input().split()))\r\n for i in l1:\r\n seen.add(i)\r\n\r\nmn = float('inf')\r\nf = -1\r\nfor a,b,c in l:\r\n if (a in seen and b not in seen) or (b in seen and a not in seen):\r\n mn = min(mn,c)\r\n f = mn\r\nprint(f)", "from heapq import *\n\ndef findMinWay(graph, warehouses):\n result = -1\n for warehouse in warehouses:\n for town, dist in graph[warehouse]:\n if town not in warehouses:\n if result == -1:\n result = dist\n result = min(result, dist)\n \n return result\n \n\nif __name__ == \"__main__\":\n n, m, k = map(int, input().strip().split())\n graph = [[] for _ in range(n+1)]\n for _ in range(m):\n v, u, w = map(int, input().strip().split())\n graph[v].append((u, w))\n graph[u].append((v, w))\n warehouses = set()\n if k > 0:\n warehouses = set(map(int, input().strip().split()))\n result = findMinWay(graph, warehouses)\n print(result)\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\nlimit = 10 ** 9 + 1\r\nseen = set()\r\nedge_list = []\r\nfor _ in range(m):\r\n edge = list(map(int, input().split()))\r\n edge_list.append(edge)\r\n\r\nif k:\r\n cities = list(map(int, input().split()))\r\n for i in cities:\r\n seen.add(i)\r\n \r\nfor road in edge_list:\r\n u, v, length = road\r\n \r\n if (u in seen and v not in seen) or (u not in seen and v in seen):\r\n limit = min(limit,length)\r\n \r\nif limit == 10 ** 9 + 1:\r\n print(-1)\r\n \r\nelse:\r\n print(limit)", "f=lambda: map(int, input().split(' '))\r\nn, m, k =f()\r\nl=[list(f()) for i in range(m)]\r\nu = set(f()) if k else []\r\nx = [c for a, b, c, in l if(a in u)^(b in u)]\r\nprint(min(x) if x else -1)", "n,m,k = map(int,input().split())\r\nroads = [[] for i in range(n)]\r\nif k==0 or k==n:\r\n print(-1)\r\n quit()\r\nfor i in range(m):\r\n u,v,l = map(int,input().split())\r\n roads[u-1].append([v-1,l])\r\n roads[v-1].append([u-1,l])\r\nstorages = set(list(map(int,input().split())))\r\nmint = 10**9+1\r\nfor i in storages:\r\n for j in roads[i-1]:\r\n if not j[0]+1 in storages:\r\n if j[1]<mint:\r\n mint=j[1]\r\nif mint!=10**9+1:\r\n print(mint)\r\nelse:\r\n print(-1)", "import sys\r\nimport math\r\n# Fast input\r\ninput = sys.stdin.readline\r\n# Fast output\r\ndef print(*args, **kwargs):\r\n sep = kwargs.get('sep', ' ')\r\n end = kwargs.get('end', '\\n')\r\n file = kwargs.get('file', sys.stdout)\r\n flush = kwargs.get('flush', False)\r\n output = sep.join(map(str, args)) + end\r\n file.write(output)\r\n if flush:\r\n file.flush()\r\nn,m,k=map(int,input().split())\r\nd=[]\r\nfor i in range(m):\r\n a,b,c=map(int,input().split())\r\n\r\n d.append((a,b,c))\r\nl=list(map(int,input().split()))\r\nd1=dict(zip(range(n+1),[False]*(n+1)))\r\nfor i in l:\r\n d1[i]=True\r\nm=10**9+1\r\nfor i in d:\r\n if d1[i[0]]!=d1[i[1]]:\r\n m=min(i[2],m)\r\n\r\nif m==10**9+1:\r\n print(-1)\r\nelse:\r\n print(m)", "from math import inf\r\nn,m,k = map(int,input().split())\r\ndct = {}\r\nlst = []\r\nfor _ in range(m):\r\n lst1 = list(map(int,input().split()))\r\n lst.append(lst1)\r\nans = 0\r\nif k > 0:\r\n storage = list(map(int,input().split()))\r\n for i in range(k):\r\n dct[storage[i]] = []\r\n for j in range(len(lst)):\r\n ele = lst[j]\r\n if ele[0] in dct.keys():\r\n if ele[1] not in dct.keys():\r\n dct[ele[0]].append(ele[2])\r\n elif ele[1] in dct.keys():\r\n if ele[0] not in dct.keys():\r\n dct[ele[1]].append(ele[2])\r\n min1 = inf\r\n for h in dct.keys():\r\n if dct[h] != []:\r\n min1 = min(min1,min(dct[h]))\r\n ans = min1\r\nelse:\r\n ans = -1\r\nif ans == inf:\r\n ans = -1\r\nprint(ans)\r\n\r\n\r\n", "n,m,k = map(int, input().split())\r\npaths = []\r\nfor _ in range(m):\r\n s,d,w = map(int, input().split())\r\n paths.append((s, d, w))\r\nstorage = set(map(int, input().split())) if k else []\r\nres = [c for a,b,c in paths if (a in storage) ^ (b in storage)]\r\nprint(min(res) if res else -1)", "import math\nimport sys\n\nn, m, k = map(int, sys.stdin.readline().split())\n\nroad = []\nfor _ in range(m):\n v, u, w = map(int, sys.stdin.readline().split())\n road.append((v, u, w))\nif k>0:\n storage = set(map(int,input().split())) \nelse:\n print(-1)\n sys.exit()\n\ncost = math.inf\nfor v, u, w in road:\n if (v in storage) ^ (u in storage):\n cost = min(cost, w) \n\nprint(cost) if cost<math.inf else print(-1)\n \t \t \t\t \t \t \t\t \t \t", "n,m,k=map(int,input().split())\r\nl=[list(map(int,input().split())) for i in range(m)]\r\nif k>0:\r\n t=list(map(int,input().split()))\r\n d={}\r\n for i in t:\r\n d[i]=1\r\n cost=10**9+7\r\n for i in l:\r\n a=d.get(i[0],0);b=d.get(i[1],0)\r\n if a^b==1:\r\n cost=min(cost,i[2])\r\n if cost==10**9+7:\r\n print(-1)\r\n else:\r\n print(cost) \r\n\r\nelse:\r\n print(-1)", "n, m, k = map(int, input().split())\nr = [input().split() for j in range(m)]\na, v = set(), 10 ** 9 + 1\nif k:\n a.update(input().split())\nfor ri in r:\n if (ri[0] in a) ^ (ri[1] in a):\n v = min(v, int(ri[2]))\nprint(-1 if v > 10 ** 9 else v)\n\t\t \t\t\t \t\t\t \t \t \t \t\t\t \t \t\t", "f = lambda: map(int, input().split())\nn, m, k = f()\nt = [list(f()) for q in range(m)]\na = set(f()) if k else []\nx = [l for u, v, l in t if (u in a) ^ (v in a)]\nprint(min(x) if x else -1)\n \t\t \t \t \t \t \t \t \t" ]

[ "#kylin1993\r\nn=int(input());\r\nwater=(n+2)*[0];\r\nvol=[int(i) for i in input().split()];\r\ntrace=(n+2)*[0];\r\nnext = [i+1 for i in range(n+2)];\r\nm=int(input());\r\nout=[]\r\nfor i in range(m):\r\n\tc=[int(i) for i in input().split()];\r\n\tif c[0]==1 :\r\n\t\tw=c[2];\r\n\t\tk=c[1]-1;\r\n\t\tr=0;\r\n\t\twhile((w>0)and(k<n)):\r\n\t\t\tif(w<=vol[k]-water[k]):\r\n\t\t\t\twater[k]=water[k]+w;\r\n\t\t\t\tbreak;\r\n\t\t\telse:\r\n\t\t\t\tw=w-(vol[k]-water[k]);\r\n\t\t\t\twater[k]=vol[k];\r\n\t\t\t\ttrace[r]=k;\r\n\t\t\t\tr=r+1;\r\n\t\t\t\tk=next[k];\r\n\t\tfor j in range(r):\r\n\t\t\tnext[trace[j]]=k;\r\n\tif c[0]==2:\r\n\t\tout.append(water[c[1]-1]);\r\nfor i in out:\r\n\tprint(i)\r\n\r\n\r\n", "# LUOGU_RID: 118388061\nn=int(input())\r\nnxt=[0]*(n+5)\r\nv=[0]*(n+5)\r\nfor i in range(1,n+1):\r\n nxt[i]=i+1\r\na=[0]+list(map(int,input().split()))\r\nT=int(input())\r\nfor pp in range(T):\r\n x=list(map(int,input().split()))\r\n if(x[0]==2):\r\n print(v[x[1]])\r\n else:\r\n u=x[1]\r\n w=x[2]\r\n now=u\r\n while(now<=n and w+v[now]>=a[now]):\r\n w-=(a[now]-v[now])\r\n v[now]=a[now]\r\n now=nxt[now]\r\n if(now<=n):\r\n v[now]+=w\r\n while(u!=now):\r\n t=u\r\n u=nxt[u]\r\n nxt[t]=now;\r\n", "\r\n\r\n# n=int(input())\r\n# l=list(map(int, input().split()))\r\n\r\n\r\n# q=int(input())\r\n# v=[0 for i in range(n+1)]\r\n# l.append(float('inf'))\r\n\r\n# p=[i for i in range(n+1)]\r\n# for i in range(n):\r\n# p[i]=i+1\r\n\r\n# def fill(i,x):\r\n# t=[]\r\n# # print(i,x)\r\n# while v[i]==l[i] :\r\n# t.append(i)\r\n# i+=1 \r\n# while x>0 :\r\n# pp=min(l[i]-v[i], x)\r\n# v[i]+=pp \r\n# x-=pp \r\n# if v[i]==l[i]:\r\n# t.append(i)\r\n# i+=1 \r\n# else:\r\n# break \r\n \r\n# for child in t:\r\n# p[child]=i\r\n \r\n \r\n# for _ in range(q):\r\n# t=list(map(int, input().split()))\r\n# if t[0]==1:\r\n# fill(t[1]-1, t[2])\r\n# else:\r\n# print(v[t[1]-1])\r\n \r\nfrom sys import stdin, stdout\r\n\r\n\r\ndef find_next(v):\r\n q = v\r\n while indexes[q] != q:\r\n q = indexes[q]\r\n while v != q:\r\n indexes[v], v = q, indexes[v]\r\n return v\r\n\r\n\r\ninput = stdin.readline\r\nn = int(input())\r\na = tuple(map(int, input().split()))\r\nindexes = [i for i in range(n + 1)]\r\nres = [0] * (n + 1)\r\nfor _ in range(int(input())):\r\n req = input().split()\r\n if req[0] == '1':\r\n p, x = int(req[1]), int(req[2])\r\n p -= 1\r\n while p < n and res[p] + x >= a[p]:\r\n x = res[p] + x - a[p]\r\n res[p] = a[p]\r\n indexes[p] = p = find_next(p + 1)\r\n res[p] += x\r\n else:\r\n k = int(req[1])\r\n stdout.write(f'{res[k - 1]}\\n')\r\n", "def _n():\r\n return int(input())\r\n\r\n\r\ndef _nA():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef _sA():\r\n return input().split()\r\n\r\n\r\nn = _n()\r\na = _nA()\r\nm = _n()\r\nd = [0]*(n+1)\r\na.append(float('inf'))\r\nf = list(range(n+1))\r\nwhile m:\r\n m -= 1\r\n t = _nA()\r\n if t[0] == 2:\r\n print(d[t[1]-1])\r\n continue\r\n i, x = t[1]-1, t[2]\r\n fa = f[i]\r\n while d[fa]+x >= a[fa]:\r\n x = d[fa]+x-a[fa]\r\n d[fa] = a[fa]\r\n if fa == f[fa]:\r\n fa += 1\r\n else:\r\n fa = f[fa]\r\n f[i] = fa\r\n d[fa] += x\r\n", "import sys\r\n# import random\r\n# from collections import Counter, defaultdict, deque\r\n# from functools import lru_cache, reduce\r\n# from itertools import accumulate,product\r\n# from heapq import nsmallest, nlargest, heapify, heappop, heappush\r\n# input = sys.stdin.buffer.readline\r\ninput = sys.stdin.readline\r\ndef mp():return list(map(int,input().split()))\r\ndef it():return int(input())\r\nimport math\r\n\r\nmod=10**9+7\r\n\r\ndef solve():\r\n n=it()\r\n nums=mp()\r\n nums.append(math.inf)\r\n q=it()\r\n father=[i for i in range(n+1)]\r\n ans=[0]*(n+1)\r\n def find(x):\r\n while x!=father[x]:\r\n father[x]=father[father[x]]\r\n x=father[x]\r\n return x\r\n\r\n for i in range(q):\r\n get=mp()\r\n if len(get)==2:\r\n print(ans[get[1]-1])\r\n else:\r\n start,x=get[1]-1,get[2]\r\n ans[start]+=x\r\n while start<n and ans[start]>nums[start]:\r\n father[find(start)]=find(start+1)\r\n to=find(start+1)\r\n ans[to]+=ans[start]-nums[start]\r\n ans[start]=nums[start]\r\n start=to \r\n\r\n return\r\n\r\nif __name__ == '__main__':\r\n\r\n # t=it()\r\n # for _ in range(t):\r\n # solve()\r\n\r\n # n=it()\r\n # n,m,k=mp()\r\n # n,m=mp()\r\n solve()" ]

[ "if __name__ == \"__main__\":\r\n a, b, c = map(int, input().split())\r\n res = ((a * c) - (b * c)) / b\r\n if res == int(res):\r\n print(int(res))\r\n else:\r\n print(int(res) + 1)\r\n\r\n", "tamanho_video_p_sg, tamanho_podem_baixar, duracao = input().split()\n\nb = (int(tamanho_video_p_sg) * int(duracao)) #/int(tamanho_podem_baixar)\nc = int(tamanho_podem_baixar)\naux = 0\naux2 = 0\nwhile(True):\n # if b > c or b > (c*int(duracao)):\n if (c * int(duracao)) + aux2 < b:\n aux = aux + 1\n aux2 = aux2 + c\n # b = b - c\n else:\n break\n\nprint(aux)\n \t \t\t\t\t\t \t \t\t\t\t\t\t \t\t \t \t", "import math\r\nList = list(map(int,input().strip().split()))[0:3]\r\nconsumeRate = List[0]\r\ndownRate = List[1]\r\nconsumeTym = List[2]\r\ndownTym = math.ceil( (consumeRate*consumeTym)/downRate )\r\ndifference = downTym - consumeTym\r\nprint(difference)\r\n", "import math\na,b,c = map(int, input().split())\na = (a*c)-c*b\nprint(math.ceil(a/b))", "a, b, c = map(int, input().split())\r\n\r\nl = 0\r\nr = c*a//b\r\n\r\nwhile r-l > 1:\r\n cur = (l+r)//2\r\n if (c+cur)*b >= c*a:\r\n r = cur\r\n else:\r\n l = cur\r\nprint(r)\r\n", "a,b,c=map(int,input().split())\r\nl=1\r\nr=1000**2\r\nwhile l < r:\r\n m=(l+r)//2; \r\n if b * (m + c) < c * a: \r\n l = m + 1\r\n else:\r\n r = m \r\nprint(l)", "a, b, c = map(int, input().split())\r\n\r\n \r\nL = -1\r\nR = a * b * c\r\n\r\n# mid - время начала просмотра\r\n# mid + c - время, когда заканчиваем смотреть видео\r\nwhile R - L > 1:\r\n mid = (L + R) // 2\r\n if (mid + c) * b >= c * a:\r\n R = mid\r\n else:\r\n L = mid\r\nprint(R)\r\n", "w = input()\r\n\r\nw = w.split(\" \")\r\n\r\na, b, c = int(w[0]) , int(w[1]), int(w[2])\r\n\r\n\r\nt = a*c\r\n\r\nif t%b == 0:\r\n print(t//b - c)\r\nelse:\r\n print(t//b -c +1)\r\n\r\n", "import math \r\n\r\na,b,c = map(int,input().split())\r\n\r\nprint(math.ceil((a*c-b*c)/b))", "import math\r\n\r\nif __name__==\"__main__\":\r\n info_list=list(map(int,input().split()))\r\n a=info_list[0]*info_list[2]\r\n b=info_list[1]*info_list[2]\r\n c=a-b\r\n ans=math.ceil(c/info_list[1])\r\n print(ans)", "a,b,c=[int(i) for i in input().split()]\r\nr=a*c\r\nd=b*c\r\nif(d>=r):\r\n print(0)\r\nelse:\r\n e=0\r\n while(d<r):\r\n d=d+b\r\n e=e+1\r\n if(d>=r):\r\n break\r\n print(e)", "a,b,c = map(int, input().split())\r\n\r\ntotalMB = a*c\r\nminTime = totalMB - (b*c)\r\ncount = 0\r\nx = 0\r\n\r\nwhile(x < minTime):\r\n x += b\r\n count += 1\r\n\r\nprint(count)", "import math\r\na,b,c = map(int, input().split(\" \"))\r\nt = int(math.ceil(a*c/b)) - c\r\nprint(t)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 6 13:44:54 2019\r\n\r\n@author: avina\r\n\"\"\"\r\nfrom math import ceil\r\na,b,c = map(int, input().split())\r\n\r\ns = (a - b)*c\r\nprint(ceil(s/b))", "# LUOGU_RID: 99685385\nn=input().split()\nfor i in range(3): \n n[i]=int(n[i])\nk=n[0]*n[2]-n[1]*n[2] \nt=k/n[1]\nif t==int(t):\n print(int(t))\nelse:\n print(int(t)+1)", "def main():\n a=(input()).strip().split()\n for i in range(len(a)):\n a[i] = int(a[i])\n res=a[0]*a[2]\n cont=1\n hola=0\n while hola!=1:\n if cont*a[1]<res:\n cont+=1\n else: \n hola=1\n cont=cont-a[2]\n print(cont)\nmain()\n", "import math\r\na,b,c = map(int,input().split())\r\nextra_needed = (a-b)*c\r\ntime_needed = math.ceil(extra_needed/b)\r\nprint(time_needed)", "import math\r\na,b,c = map(int,input().split())\r\nf = math.ceil((c*a)/b)\r\nprint(f-c)\r\n", "import math\r\nr,g,c=map(int,input().split())\r\nif g>=r:\r\n\tprint(0)\r\nelse:\r\n\tprint(math.ceil((r*c-g*c)/g))", "a,b,c = map(int, input().split())\r\nt = 0\r\nwhile True:\r\n\r\n S0 = t*b # накопил емкость\r\n flag = 0\r\n for i in range(c):\r\n S0 += b-a\r\n if S0 < 0: # значит время не хватает, нужно прибавить\r\n t += 1\r\n flag += 1\r\n break\r\n if flag == 0:\r\n print(t)\r\n break", "\r\na, b, c = map(int, input().split())\r\n\r\nt = 0\r\nwhile a * c - b * t > c * b:\r\n\tt += 1\r\n\r\nprint(t)", "from math import ceil\r\n\r\na, b, c = map(int, input().split())\r\nans = int(ceil((a - b) * c / b))\r\nprint(ans)\r\n\r\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\na, b, c = map(int, input().split())\r\nans = 1\r\nwhile (ans + c) * b < a * c:\r\n ans += 1\r\nprint(ans)", "a,b,c=map(int,input().split())\r\nprint((a*c+b-1)//b-c)", "a, b, c = map(int, input().split())\nal = (c * a + b - 1) // b\nfor i in range(1, al + 1):\n if al * b >= (al - i) * a:\n print(i)\n break\n", "a, b, c = map(int,input().split())\r\nif (a * c - b * c) % b == 0:\r\n print((a * c - b * c) // b)\r\nelse:\r\n print((a * c - b * c) // b + 1)\r\n", "import math\r\n\r\na,b,c=map(int,input().split())\r\n\r\nfor i in range(1,math.ceil(a*c/b)):\r\n if (a*c-b*i)<=c*b:\r\n break\r\nprint(i)", "\n\na, b, c = map(int, input().split())\n\nend_time = (a * c + b - 1) // b\n\nprint(end_time - c)\n", "a,b,c=map(int,input().split())\r\nl=1\r\nr=1000**2\r\nwhile (l<r):\r\n m=(l+r)//2; \r\n if b*(m+c)<c*a: \r\n l=m+1\r\n else:\r\n r=m \r\nprint(l)", "import math\r\na,b,c=map(int,input().split())\r\nprint(int(math.ceil((a*c-b*c)/b)))", "import math\nbuffer = input()\n\na, b, c = buffer.split()\na, b, c = int(a), int(b), int(c)\n\nprint(int(math.ceil(((a*c)-(b*c))/b)))\n \t\t \t\t \t \t\t \t\t\t\t \t\t\t\t \t", "from math import ceil\r\n\r\na, b, c = map(int,input().split())\r\n\r\ntotal_memory = a*c\r\nsecond_download = ceil(total_memory/b)\r\nprint(second_download - c)", "import math\r\nI = lambda: int(input())\r\ntup = lambda: map(int, input().split())\r\nlst = lambda: list(map(int, input().split()))\r\n\r\n \r\ndef solve():\r\n a,b,c = tup()\r\n if b>=a:\r\n print(0)\r\n else:\r\n total_data = a*c\r\n wait,remain=1,0\r\n remain = total_data - (b*wait)\r\n while (remain) > (b*c):\r\n wait+=1\r\n remain = total_data-(b*wait)\r\n print(wait)\r\n\r\n# --------------------------------------------------------------------------------- \r\nt = 1\r\n#t = I()\r\nwhile t:\r\n solve()\r\n t -= 1", "from math import ceil\r\na,b,c=map(int,input().split())\r\nprint(ceil((a*c-b*c)/b))", "import math\n#a = data/second needed\n#b = data/second available\n#c = t in seconds\n\na,b,c=map(int,input().split())\n#gesamte menge der daten\nall_data=a*c\n\nall_time=math.ceil(all_data/b)\n\n#finde einen zeitpunkt, wo\nfor i in range(all_time):\n if (i*b) >= all_data-(c*b):\n print(i)\n break\n else:\n continue\n\n\n# 20MB\n# 6,66667 sekunden -> 7\n# 2*3 (c*b) = 6\n# 14MB\n# z, wo (z*b) >= all_data-(c*b)\n", "import sys\r\n\r\n\r\ndef scan():\r\n return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\na, b, c = scan()\r\nd = (a * c) - (c * b)\r\nif d % b == 0:\r\n print(d // b)\r\nelse:\r\n print((d // b) + 1)", "a, b, c = map(int, input().split())\r\nleft = 0\r\nright = 10**8\r\nntd = (a*c)-(b*c)\r\nwhile left < right:\r\n mid = (left+right)//2\r\n value = mid*b\r\n if value >= ntd:\r\n right = mid\r\n else:\r\n left = mid + 1\r\n\r\nprint(right)\r\n", "from math import ceil\r\na,b,c = map(int,input().split())\r\n\r\nw = b/a\r\n\r\nif w>=1:\r\n\tprint(1)\r\nelse:\r\n\tif ((a-b)*c)%b==0:\r\n\t\tprint( ((a-b)*c)//b )\r\n\telse:\r\n\t\tprint( ((a-b)*c)//b +1 )", "a,b,c=[int(x) for x in input().split()]\r\nt=0\r\nwhile a*c>(t+c)*b:\r\n\tt+=1\r\nprint(t)", "import math\na,b,c=[int(x) for x in input().split()]\nt=a*c\nk=math.ceil(t/b)\nprint(k-c)", "import math\r\na,b,c=[int(x) for x in input().split()]\r\nt=a*c\r\nk=math.ceil(t/b)\r\nprint(k-c)", "import io, os, sys\r\n\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\ndef solve():\r\n a, b, c = map(int, input().split())\r\n sys.stdout.write(f'{(a*c - c*b+b-1)//b}\\n')\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "a,b,c=map(int,input().split())\r\nprint((a*c-b*c+b-1)//b)", "import math\na=list(map(int,input().strip().split()))\nprint(math.ceil(((a[0]*a[2])/a[1])-a[2]))", "import math\r\n\r\n\r\na, b, c = map(int,input().split())\r\nprint(math.ceil(a * c / b) - c)", "import math\r\na,b,c=map(int,input().split())\r\nt=0\r\nfor i in range(1,c+1,1) :\r\n t=t+a-b\r\nprint(math.ceil(t/b)) ", "a, b, c = map(int, input().split())\r\n# a size of data needed to watch one second of the video\r\n# b size of data can download from the Net per second.\r\n# c denotes the video's length in seconds\r\n\r\nv = a * c\r\nt = v // b\r\nm = v % b\r\n\r\nif 0 < m <= b:\r\n n = t - (c - 1)\r\nelse:\r\n n = t - c\r\nprint(n)", "import math\r\ndef main_function():\r\n a, b, c = [int(i) for i in input().split(\" \")]\r\n download_speed = b\r\n size = a\r\n time_needed_to_download_video = a / b\r\n print(max(0, math.ceil(a*c/b) - c))\r\n\r\n\r\n\r\nmain_function()", "def f(l):\r\n a,b,c =l\r\n return (c*(a-b)+b-1)//b\r\n\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "a,b,c=map(int,input().split())\r\nval=b\r\nres=[val]\r\ni=2\r\nwhile(val<a*c):\r\n val=b*i\r\n res+=[val]\r\n i+=1\r\nn=len(res)\r\nl=0\r\nh=n-1\r\nans=-1\r\n#print(res)\r\nwhile(l<=h):\r\n mid=l+(h-l)//2\r\n if(res[mid]+b*(c-1)<a*c):\r\n ans=mid\r\n l=mid+1\r\n else:\r\n h=mid-1\r\n #print(mid)\r\nprint(ans+1)", "import math\na, b, c = tuple([int(x) for x in input().split()])\nprint(math.ceil((a*c - b*c)/b))", "a,b,c=map(int, input().split())\r\nx=0\r\nwhile (x*b+b*c)<a*c:\r\n x+=1\r\nprint(x)", "a, b, c = map(int, input().split())\r\nx = a * c\r\ny = b * c\r\nreq = x - y\r\ntime = req // b\r\nif req % b != 0:\r\n time += 1\r\nprint(time)\r\n", "import math\r\n\r\na,b,c = map(int,input().split())\r\n\r\ntotalUnits = c * a\r\nunitsInVideo = b * c\r\n\r\nwait = (totalUnits - unitsInVideo)\r\n\r\nprint(math.ceil(wait/b))\r\n", "from math import ceil\r\nfrom sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\na,b,c=map(int,input().split())\r\nprint(ceil((a*c-b*c)/b))", "import math\r\na, b, c = [int(i) for i in input().split()]\r\nprint(math.ceil((a-b)*c/b))", "a, b, c = input().split()\r\na, b, c = int(a), int(b), int(c)\r\nt = (c * (a - b) + b - 1) // b\r\nprint(t)", "from math import ceil\r\nif __name__ == '__main__':\r\n\ta, b, c = [int(i) for i in input().split()]\r\n\tprint(ceil(a * c / b) - c)", "R = lambda:list(map(int, input().split()))\r\n\r\ndef solve():\r\n a, b, c = R() \r\n \r\n d = a*c\r\n c = b*c\r\n t = d-c\r\n ans = t//b\r\n# print(ans)\r\n \r\n if(t%b != 0):\r\n ans +=1\r\n \r\n print(ans) \r\n \r\n \r\nfor _ in range(1):\r\n solve()\r\n", "a,b,c=map(int,input().split())\r\nq=(c*a-c*b)/b\r\nif q%1!=0:\r\n print(int(q)+1)\r\nelse:\r\n print(int(q))", "from math import ceil\r\na,b,c=map(int,input().split())\r\nprint(ceil((c*(a-b))/b))", "import math\na,b,c = map(int,input().split())\ns = 0\nfor i in range(c,0,-1):\n s = max(s,math.ceil((i*a-b*i)/b))\nprint(s)", "a,b,c=map(int,(input().split()))\r\nfor i in range(1000000):\r\n if (c+i)*b >= a*c:\r\n print(i)\r\n break\r\n", "import math\r\na,b,c = map(int,input().split())\r\nif(b>a): print(0)\r\nelse:\r\n a = math.ceil((a*c)/b)\r\n a-=c\r\n if (a==1): print(1)\r\n else: print(a)\r\n", "import math\na,b,c = input().split()\na= int(a)\nb= int(b)\nc= int(c)\nans = math.ceil((a-b)*c / b)\nprint(ans)\n\t\t\t \t\t \t\t\t \t \t \t \t\t \t \t", "a, b, c = list(map(int, input().split()))\r\nl = 0\r\nr = 1000000\r\nitog = 0\r\nwhile l + 1 != r:\r\n mid = (l + r) // 2\r\n good = 1\r\n aLine = 0\r\n bLine = mid * b\r\n for i in range(c):\r\n bLine += b\r\n aLine += a\r\n if bLine < aLine:\r\n good = 0\r\n break\r\n if good:\r\n r = mid\r\n else:\r\n l = mid\r\nprint(r)\r\n", "import math\r\na, b ,c = map(int, (input().split(\" \")))\r\nd = math.ceil (((a * c) - (b * c)) / b)\r\nprint (d)", "import math\r\n\r\n\r\na,b,c=map(int,input().split())\r\nans1=(a*c)/b\r\nans2=ans1-c\r\nprint(math.ceil(ans2))", "a,b,c=map(int,input().split())\r\nd=max(c*(a-b),0)\r\nprint(d//b+bool(d%b))", "a,b,c=map(int,input().split())\r\nt=0\r\nal=(c*a+b-1)//b\r\nfor i in range(al):\r\n\tif al*b>=(al-i)*a: t=i; break\r\nprint(t)", "a, b, c = map(int, input().split())\r\nans = -(-c * (a - b) // b)\r\nprint(ans)", "from math import ceil\n\n\na,b,c=map(int,input().split())\nprint(ceil(a*c/b-c))", "import math\r\na,b,c = map(int, input().split())\r\nprint(math.ceil((a*c-b*c)/b))", "from sys import stdin, stdout\r\n\r\nl = -1\r\nr = 10 ** 6 + 1\r\n\r\na, b, c = map(int, stdin.readline().split())\r\n\r\nwhile (r - l > 1):\r\n m = (r + l) // 2\r\n \r\n if b * m + b * c - a * c >= 0:\r\n r = m\r\n else:\r\n l = m\r\n\r\n\r\nstdout.write(str(r))", "a,b,c=map(int,input().split(' '))\r\nwait_time=(a*c+b-1)//b-c\r\nprint(wait_time)", "import math\r\na,b,c=map(int,input().split())\r\nprint(math.ceil((a-b)*c/b))\r\n \r\n", "a,b,c = map(int,input().split())\r\nprint(abs((-1*a*c)//b)- c)", "from math import ceil as AndrewVictorovichKrutoyMuzhik\r\na,b,c=map(int,input().split())\r\noutput = (c*a-b*c)/b\r\nprint(AndrewVictorovichKrutoyMuzhik(output))", "a,b,c=map(int,input().split())\nrj=(a*c-b*c)//b\n\nif (a*c-b*c)%b!=0:\n print(rj+1)\n\nelse:\n print(rj)\n\n \t\t\t \t \t\t \t \t \t \t \t\t \t", "a, b, c = map(int, input().split())\r\nprint((c*(a-b)+b-1) // b)", "\r\n\r\ndef main():\r\n a, b, c = map(int, input().split())\r\n print((a * c - 1 + b) // b - c)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n ", "from math import *\r\ndef inp():\r\n return map(int, input().split())\r\na,b,c=inp()\r\nout=ceil((a*c-b*c)/b)\r\nif(out):\r\n exit(print(out))\r\nprint(1)", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"ou.out\",'w')\r\na,b,c=map(int,input().split())\r\nx=a*c\r\nm=(x+b-1)//b\r\ni=1\r\nwhile i<=m:\r\n\tif m*b>=(m-i)*a:\r\n\t\tprint(i)\r\n\t\tbreak\r\n\ti+=1", "import math\r\n'''\r\n#GregandArray\r\nn, m, k = [int(num) for num in input().split()]\r\nsa = input().split()\r\na = [0] * (n + 1)\r\nfor i in range(n):\r\n a[i+1] = int(sa[i])\r\nmda = [0] * (n+1)\r\nfor i in range(n):\r\n mda[i] = a[i+1] - a[i]\r\nfor i in range(m):\r\n l[i], r[i], d[i] = [int(num) for num in input().split()]\r\noda = [0] * (m+1)\r\nfor i in range(k):\r\n x, y = [int(num) for num in input().split()]\r\n oda[x-1] += 1\r\n oda[y] -= 1\r\nopn = 0\r\nfor i in range(m):\r\n opn += oda[i]\r\n delta = opn * d[i]\r\n mda[l[i]-1] += delta\r\n mda[r[i]] -= delta\r\nrs = 0\r\nfor i in range(n):\r\n rs += mda[i]\r\n print(rs, end=\" \")\r\n#ShaasShootingBirds\r\nn = int(input())\r\nsa = input().split()\r\na = [0] * n\r\nfor i in range(n):\r\n a[i] = int(sa[i])\r\nm = int(input())\r\nfor i in range(m):\r\n x, y = [int(num) for num in input().split()]\r\n x -= 1\r\n lb = y - 1\r\n rb = a[x] - y\r\n a[x] = 0\r\n if (x > 0):\r\n a[x-1] += lb\r\n if (x < n - 1):\r\n a[x+1] += rb\r\nfor i in range(n):\r\n print(a[i])\r\n#Olympiad\r\nn = int(input())\r\nsa = input().split()\r\naset = set()\r\nfor s in sa:\r\n a = int(s)\r\n if (a != 0):\r\n aset.add(a)\r\nprint(len(aset))\r\n#ICPCballoons\r\nt = int(input())\r\ntotaloutput = []\r\nfor i in range(t):\r\n temptotal = 0\r\n tempset = set()\r\n n = int(input())\r\n problems = input()\r\n for z in range(len(problems)):\r\n if (problems[z] in tempset) == False:\r\n temptotal += 2\r\n tempset.add(problems[z])\r\n else:\r\n temptotal += 1\r\n totaloutput.append(temptotal)\r\nfor u in totaloutput:\r\n print(u)\r\n#ConsecutiveSum\r\nt = int(input())\r\nfor tc in range(t):\r\n n, k = [int(num) for num in input().split()]\r\n sa = input().split()\r\n a = [0] * n\r\n for i in range(n):\r\n a[i] = int(sa[i])\r\n for i in range(n):\r\n ri = i%k\r\n a[ri] = max(a[ri], a[i])\r\n ans = 0\r\n for i in range(k):\r\n ans += a[i]\r\n print(ans)\r\n#DinnerWithEmma\r\nn, m = list(input().split(\" \"))\r\ntwodlist = []\r\nalltimemax = 0\r\nfor i in range(int(n)):\r\n templist = list(input().split(\" \"))\r\n for y in range(len(templist)):\r\n templist[y] = int(templist[y])\r\n twodlist.append(templist)\r\nfor z in twodlist:\r\n if min(z) > alltimemax:\r\n alltimemax = min(z)\r\nprint(alltimemax)\r\n#LiHua and Maze\r\nt = int(input())\r\nfor i in range(t):\r\n n, m = list(input().split(\" \"))\r\n x1, y1, x2, y2 = list(input().split(\" \"))\r\n#DownloadMoreRam\r\nt = int(input())\r\nfinallist = []\r\nfor i in range(t):\r\n dictionary = {}\r\n v = 0\r\n templist = list(input().split(\" \"))\r\n templist = list(map(int, templist))\r\n n = templist[0]\r\n k = templist[1]\r\n a = list(input().split(\" \"))\r\n a = list(map(int, a))\r\n b = list(input().split(\" \"))\r\n b = list(map(int, b))\r\n for l in range(len(a)):\r\n dictionary[a[l]] = b[l]\r\n a = sorted(a)\r\n while k >= a[v]:\r\n if v == (len(a) - 1):\r\n k += dictionary[a[v]]\r\n v += 1\r\n break\r\n else:\r\n k += dictionary[a[v]]\r\n v += 1\r\n finallist.append(k)\r\nfor o in finallist:\r\n print(o)\r\n#GamerHemose\r\nt = int(input())\r\nfinallist = []\r\nfor i in range(t):\r\n count = 0\r\n evenorodd = 0\r\n templist = list(input().split(\" \"))\r\n templist = list(map(int, templist))\r\n hp = templist[1]\r\n weapons = list(input().split(\" \"))\r\n weapons = list(map(int, weapons))\r\n weapons.sort(reverse=True)\r\n while hp > 0:\r\n if evenorodd % 2 == 0:\r\n hp -= weapons[0]\r\n else:\r\n hp -= weapons[1]\r\n count += 1\r\n evenorodd += 1\r\n finallist.append(count)\r\nfor z in finallist:\r\n print(z)\r\n#RemoveSmallest\r\nt = int(input())\r\nyon = []\r\nfor i in range(t):\r\n nope = 0\r\n n = int(input())\r\n a = list(input().split(\" \"))\r\n a = list(map(int, a))\r\n a.sort()\r\n for y in range(len(a)-1):\r\n if not((a[y+1] - a[y]) <= 1):\r\n yon.append(\"NO\")\r\n nope += 1\r\n break\r\n if nope == 0:\r\n yon.append(\"YES\")\r\nfor o in yon:\r\n print(o)\r\n#SushiForTwo\r\nn = int(input())\r\nsushi = list(input().split(\" \"))\r\nsushi = list(map(int, sushi))\r\nl = 0\r\ncount1 = 0\r\ncount2 = 0\r\nmaximum = 0\r\nif sushi[0] == 1:\r\n while l != len(sushi)-1:\r\n while sushi[l] == 1:\r\n count1 += 1\r\n l += 1\r\n while sushi[l+1] == 2:\r\n count2 += 1\r\n if sushi[l+2] != len(sushi):\r\n l += 1\r\n else:\r\n break\r\n if count1 > count2:\r\n if count2 > maximum:\r\n maximum = count2\r\n else:\r\n if count1 > maximum:\r\n maximum = count1\r\n count1 = 0\r\n count2 = 0\r\n print(maximum)\r\nelse:\r\n while l != len(sushi)-1:\r\n while sushi[l] == 2:\r\n count1 += 1\r\n l += 1\r\n while sushi[l+1] == 1:\r\n count2 += 1\r\n if sushi[l+2] != len(sushi):\r\n l += 1\r\n else:\r\n break\r\n if count1 > count2:\r\n if count2 > maximum:\r\n maximum = count2\r\n else:\r\n if count1 > maximum:\r\n maximum = count1\r\n count1 = 0\r\n count2 = 0\r\n print(maximum)\r\n'''\r\n#Lets Watch Football\r\nlister = list(input().split(\" \"))\r\nlister = list(map(int, lister))\r\ntotal = lister[0] * lister[2]\r\nprint(math.ceil((total-(lister[1]*lister[2]))/lister[1]))", "from math import * \r\nMOD = (10**9)+7\r\ndef prefixSum(arr):\r\n n=len(arr)\r\n ps = [0] * n\r\n ps[0] =arr[0]\r\n for i in range(1,n):\r\n ps[i]=arr[i]+ps[i-1]\r\n return ps\r\ndef counter(arr):\r\n d = {}\r\n for i in arr:\r\n if(i in d):\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\n return d\r\ndef isPrime(num):\r\n if(num > 1):\r\n for i in range(2,int(sqrt(num))+1):\r\n if (num % i == 0):\r\n return False\r\n return True\r\n else:\r\n return False\r\n#for _ in range(int(input())):\r\na,b,c = map(int,input().split())\r\nprint(ceil(((a*c)-(b*c))/b))", "from math import ceil\r\na, b, c = map(int, input().split())\r\n\r\nprint(ceil((c * a) / b - c))\r\n", "n = list(map(int,input().split()))\r\ndata = n[0]\r\nspeed = n[1]\r\ntime = n[2]\r\nk = (data*time - speed*time)/speed\r\nif k%1 == 0 :\r\n print(int(k))\r\nelse :\r\n c = int(k)\r\n print(c+1)\r\n \r\n\r\n\r\n", "def solve(a,b,c):\r\n return ((a - b) * c + b - 1) // b\r\n \r\nif __name__==\"__main__\":\r\n a,b,c = map(int, input().split())\r\n ans = solve(a,b,c)\r\n print(ans)\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Sep 6 13:44:54 2019\r\n\r\n@author: avina\r\n\r\n\r\nfrom math import ceil\r\na,b,c = map(int, input().split())\r\n\r\ns = (a - b)*c\r\nprint(ceil(s/b))\r\n\"\"\"\r\n # from Binary Search\r\nfrom math import ceil\r\na,b,c = map(int, input().split())\r\ny = a*c\r\nlo = 0;hi = a*c\r\nans = 0\r\nwhile lo <= hi:\r\n mid = (lo+hi) >> 1\r\n s = b*c + mid\r\n if s == y:\r\n ans = mid\r\n break\r\n elif s > y:\r\n hi = mid -1\r\n else:\r\n lo = mid+1\r\nprint(ceil(ans/b))", "def read_tokens():\n return input().strip().split(' ')\n\n\ndef read_ints():\n return [int(s) for s in read_tokens()]\n\n\n# def how_many_problems(a: int, b: int, c: int):\n# l = 0\n# r = (c*a) // b\n#\n# while r - l > 1:\n# m = (r + l) // 2\n# if possible(m, a, b, c):\n# l = m\n# else:\n# r = m\n#\n# return l\n\n\n# def possible(number_of_tasks: int, time_for_walk: int):\n# time_for_problems = sum([5*i for i in range(1, number_of_tasks+1)])\n# total_time = 4*60 # minutes\n# return (total_time - time_for_problems - time_for_walk) >= 0\n\n\ndef min_time_for_wait(a: int, b: int, c: int):\n l = 0\n r = (c*a) // b\n\n while r - l > 1:\n m = (r + l) // 2\n if possible(m, a, b, c):\n r = m\n else:\n l = m\n\n return r\n\n\ndef possible(t: int, a: int, b: int, c: int):\n total_video_data = c * a # unit\n data_for_last_sec = (c + t) * b\n return data_for_last_sec >= total_video_data\n\n\na, b, c = read_ints()\nprint(min_time_for_wait(a, b, c))\n", "a, b, c = map(int, input().split())\nif c*(a-b)%b != 0:\n\tprint(c*(a - b)//b+1)\nelse:\n\tprint(c*(a - b)//b)", "a, b, c = map(int, input().split())\r\nprint((a*c + b-1)//b-c)\r\n", "import math\r\n\r\nvid,ips,sec=map(int,input().split())\r\ni=vid*sec\r\nt=math.ceil(i/ips)\r\nl,r=0,t\r\nwhile (r-l)!=1:\r\n m=(l+r)//2\r\n t=(i-m*ips)/ips\r\n if t>sec:\r\n l=m\r\n elif t<sec:\r\n r=m\r\n elif t==sec:\r\n print(m)\r\n break\r\nelse:\r\n\r\n print(r)", "import math\r\n\r\na, b, c = map(int, input().split())\r\nt = math.ceil(a * c / b) - c\r\nprint(t)\r\n", "a, b, c = map(int,input().split())\r\nf = a - b\r\nr = (a % b * c - 1) // b + 1\r\nprint(f // b * c + r)\r\n", "a, b, c = (int(i) for i in input().split())\n# a * c to download will take a * c / b seconds\n# a * c = b * (c + t)\n# t = a * c / b - c = (a * c - b * c) / b = c * (a - b) / b\nres = max((c * (a - b) + b - 1) // b, 0)\nprint(res)\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 1 12:40:26 2020\r\n\r\n@author: rajendra\r\n\"\"\"\r\nimport math\r\na,b,c=map(int,input().split())\r\n\r\nt=math.ceil(c*(a-b)/b)\r\nprint(t)\r\n\r\n \r\n \r\n", "a,b,c=map(int,input().split())\r\nt=0\r\nal=(c*a+b-1)//b\r\nv=al*b\r\nl=0\r\nr=al\r\nwhile r-l>1:\r\n\tm=(l+r)//2\r\n\tif v>=(al-m)*a: r=m\r\n\telse: l=m\r\nprint(r)", "z=list(map(int,input().split()))\r\na=1\r\nwhile 1 : \r\n if a*z[1]+(z[1]*z[2])>=z[0]*z[2]:\r\n print(a)\r\n break\r\n a+=1\r\n", "import math\ndef solve(a,s,c):\n return math.ceil((c*a)/s)-c\n\n \n \n\ndef main() :\n # n = int(input())\n a,s,c = list(map(int, input().split(' ')))\n print(solve(a,s,c))\nmain()\n", "import math\r\nR = lambda: map(int, input().split())\r\na, b, c = R()\r\nprint(math.ceil((a - b) * c / b))", "import math\r\na,b,c=map(int,input().split())\r\nprint(math.ceil((a*c-b*c)/b))\r\n", "import math\r\na,b,c=tuple(map(int,input().split()))\r\n\r\nt = math.ceil((a - b)*c/b)\r\nprint(t)", "a, b, c = map(int, input().split())\r\nleft = 0\r\nright = (a*c + b - 1) // b\r\nall = right\r\nwhile(left + 1 < right):\r\n t = (left + right) // 2\r\n if all*b >= (all - t)*a:\r\n right = t\r\n else:\r\n left = t\r\nprint(right)\r\n \r\n ", "import math\r\na, b, c = map(int, input().split())\r\nl, r = 0, math.ceil((a * c) /b)\r\nwhile l < r:\r\n x = l + (r - l) // 2 \r\n t = x * b \r\n req = (a * c) - t \r\n if (b * c) >= req:\r\n r = x \r\n else:\r\n l = x + 1 \r\n \r\nprint(l)\r\n", "a, b, c = map(int, input().split())\r\n\r\nl = 0\r\nr = a * c // b\r\namount = a * c\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n if m * b + c * b < amount:\r\n l = m\r\n else:\r\n r = m\r\nprint(r) ", "import os,sys,io,math\r\nfrom re import *\r\nfrom math import *\r\nfrom array import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom functools import *\r\nfrom itertools import *\r\nfrom statistics import *\r\nfrom collections import *\r\nI=lambda:[*map(int,sys.stdin.readline().split())]\r\nIP=lambda:map(int,input().split())\r\nIS=lambda:input()\r\nIN=lambda:int(input())\r\nIF=lambda:float(input())\r\n\r\n# for _ in range(IN()):\r\na,b,c=IP()\r\nr=1\r\nwhile (r+c)*b<a*c:r+=1\r\nprint(r)", "from sys import stdin\r\n\r\ndef football(a,b,c):\r\n\tx = a * c\r\n\tans = 0\r\n\tl, h = 0, (x // b) + 1\r\n\twhile l <= h:\r\n\t\tmid = (l + h) // 2\r\n\t\tfoo = (mid * b) + (b * c)\r\n\t\tif foo >= x:\r\n\t\t\tans = mid\r\n\t\t\th = mid - 1\r\n\t\telse:\r\n\t\t\tl = mid + 1\r\n\treturn ans\r\n\r\na, b, c = map(int,stdin.readline().split())\r\nprint(football(a,b,c))\r\n", "a, b, c = list(map(int, input().split()))\n\nsize = a * c\n\nwait = 0\nwhile b*c < size - b*wait:\n wait += 1\n\nprint(wait)\n\t\t \t \t\t\t \t \t\t\t \t \t\t \t", "a, b, c = map(int, input().split())\r\ndownload = 0\r\ntime = 0\r\nwhile download < (a * c):\r\n download += b\r\n time += 1\r\nans = time - c\r\nprint(ans)\r\n", "import math\na,b,c = map(int,input().split(' '));\nt = (math.ceil(a*c/b)-c);\nprint(t);", "def readln(): return tuple(map(int, input().split()))\n\nfrom math import ceil\na, b, c = readln()\nprint(ceil(c * (a - b) / b))\n", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations\r\nfrom math import gcd, floor, inf\r\nfrom bisect import bisect_right, bisect_left\r\n\r\n\r\na, b, c = map(int, input().split())\r\n\r\ntotal= a*c\r\nwithout_wait = b*c\r\nrem_for_wait = total - without_wait\r\nans = (rem_for_wait +b -1)//b\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\na,b,c = list(map(int,input().split()))\r\nunit = a*c\r\nhave = b*c\r\nremain =unit-have\r\nresult = math.ceil(remain/b)\r\nprint(result)", "import math\r\na,b,c=map(int,input().split())\r\nx=a*c-b*c\r\nprint(math.ceil(x/b))", "import math\r\na, b, c = map(int, input().split())\r\nt = (a-b)*c\r\nprint(math.ceil(t/b))", "a, b, c = [int(x) for x in input().split()]\r\nt = (a - b) * c\r\nprint(t // b + (1 if t % b > 0 else 0))", "a, b, c = map(int,input().split())\ng = 1\nwhile c * (a - b) / b > g:\n g += 1\nprint(g)", "a,b,c = map(int,input().split())\r\nd = ((a - b) * c + b - 1) // b\r\nprint(d)", "\r\ndef bins(a, b, c):\r\n l = 0\r\n r = (a * c) // b\r\n while r > l + 1:\r\n t = (r + l) // 2\r\n if (t + c) * b >= c * a:\r\n r = t\r\n else:\r\n l = t\r\n return(r)\r\n\r\na, b, c = map(int, input().split())\r\nprint(bins(a, b, c))\r\n", "video_bytes_per_second, download_speed_per_second, video_length = map(\n int, input().split()\n)\nvideo_size = video_bytes_per_second * video_length\nmax_waited = (video_size // download_speed_per_second) + 1\nmin_waited = 0\n\n\ndef check_waited_seconds(seconds):\n return (seconds + video_length) * download_speed_per_second >= video_size\n\n\ndef bst_first(mini, maxi):\n if mini > maxi:\n return False\n n = (mini + maxi) // 2\n if check_waited_seconds(n):\n return bst_first(mini, n - 1) or n\n return bst_first(n + 1, maxi)\n\n\nprint(bst_first(min_waited, max_waited))\n", "\r\n\r\n\r\n\r\n[a,b,c]=list(map(int,input().split()));\r\nd=(a-b)*c;\r\nprint(d//b+min(1,d%b));", "import math\n\na, b, c = map(int, input().split())\nif b >= a:\n print(0)\nelse:\n rem_s = a - b\n tot_rem = c * rem_s\n t = int(math.ceil(tot_rem / b))\n print(t)", "a, b, c = map(int, input().split())\r\nleft = -1\r\nright = a * c + 1\r\nwhile right - left > 1:\r\n middle = (right + left) // 2\r\n if a * c - middle * b > c * b:\r\n left = middle\r\n else:\r\n right = middle\r\nprint(right)", "import bisect\r\na,b,c=input().split()\r\na=int(a)\r\nb=int(b)\r\nc=int(c)\r\nl=0\r\nr=a*c//b+1\r\nwhile(l<r):\r\n mid= l+(r-l)//2\r\n #print(l)\r\n #print(mid)\r\n #print(r)\r\n if(b*mid==(a-b)*c or (b*mid>(a-b)*c and b*(mid-1)<(a-b)*c)):\r\n print(mid)\r\n break\r\n elif(b*mid<(a-b)*c):\r\n l=mid+1\r\n else:\r\n r=mid\r\nif(l==r):\r\n #print('a')\r\n print(l) \r\n", "a,b,c = input().split()\na = int(a)\nb = int(b)\nc = int(c)\nans = -1\nfor t in range (2*10**6):\n tank = t*b \n sarf = c*a \n down = b*c\n if(tank+down >= sarf):\n ans = t\n break\nprint(ans)\n \n \t \t\t\t \t\t\t\t \t\t \t \t \t", "from math import ceil\r\na,b,c = map(int,input().split())\r\nt = (a*c - c*b)/b\r\nprint(ceil(t))", "a, b, c = map(int, input().split())\r\na *= c\r\ncounter = 0\r\nwhile a > b * c:\r\n a-= b\r\n counter += 1\r\nprint(counter)", "a, b, c = [int(i) for i in input().split()]\r\ntotal = a * c\r\nwatching = b * c\r\nremaining = total - watching\r\nif remaining % b == 0:\r\n print(remaining // b)\r\nelse:\r\n print(remaining // b + 1)", "import math\r\na, b, c = map(int, input().split())\r\nprint(math.ceil(((a - b) * c) / b))\r\n", "import math\na, b, c = map(int, input().split())\nt = math.ceil(c*a/b - c)\nprint(t)\n", "datainsecond , data1 , time = map(int,input().split())\r\ndataneeded = datainsecond*time\r\ncnt = 0\r\nfor i in range(dataneeded):\r\n cnt+=1\r\n data2 = data1*cnt\r\n if data1*time >= dataneeded-data2:\r\n break\r\nprint(cnt)", "a,b,c=map(int,input().split())\r\nans=1\r\n\r\nx=a*c-b*c\r\nwhile b*ans<x:\r\n ans+=1\r\n \r\nprint(ans)", "a, b, c = map(int, input().split())\r\n\r\nl = -1\r\nr = a * c\r\n\r\n#print(l, r)\r\n\r\nwhile r - l > 1:\r\n z = (r + l) // 2#how much we wait\r\n if b * (c + z) >= a * c:\r\n r = z\r\n else:\r\n l = z\r\n #print(l, r)\r\n\r\n\r\nprint(r)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\n\r\nprint((c*a+b-1)//b - c)\r\n", "from math import ceil\na,b,c = map(int, input().split())\nr = (a/b)*c - c\nprint(ceil(r))\n\n \t \t\t\t \t \t \t\t\t \t \t\t \t\t \t", "a,b,c = map(int, input().split())\r\nprint((a*c - b*c)//b if (a*c - b*c)%b == 0 else ((a*c - b*c)//b)+1)", "import math\r\n\r\na,b,c=map(int,input().split())\r\nprint(math.ceil((c*a-c*b)/b))\r\n", "a,b,c = map(int,input().split())\r\nwait = (a*c - b*c)//b\r\nll = (a*c - b*c)%b\r\n\r\nwait = wait+ 1 if ll!=0 else wait\r\nprint(wait)\r\n", "a, b, c = map(int, input().split())\r\nprint(int(((a-b)*c-1)/b)+1)\r\n", "from math import ceil\r\na,b,c=list(map(int,input().split()))\r\nprint(ceil(((a*c)-(b*c))/b))", "import math\nm=list(map(int,input().split(\" \")))\nr=math.ceil(((m[0]*m[2])/m[1])-m[2])\nprint(r)\n\n\t\t\t \t\t\t\t\t\t\t \t\t \t\t\t \t \t \t\t", "a, b, c = map(int, input().split())\r\nans = (a*c - b*c)//b + (1 if (a*c - b*c)%b != 0 else 0)\r\nprint(ans)", "from sys import stdin\r\n\r\na,b,c = map(int, stdin.readline().split())\r\n\r\nt = ((a-b) * c)/b\r\nif int(t) == t :\r\n print(int(t))\r\nelse:\r\n print(int(t) + 1)", "a,b,c=list(map(int,input().split()))\r\nk=(a*c)-(b*c)\r\nwhile(k%b!=0):\r\n k+=1\r\nprint(k//b)\r\n \r\n\r\n \r\n", "a , b, c = list(map(int, input().split()))\r\n\r\n\r\n\r\n\r\nt = a*c\r\n\r\nif t%b == 0:\r\n print(t//b - c)\r\nelse:\r\n print(t//b -c +1)\r\n\r\n", "a,b,c=map(int,input().split())\r\nprint(0--(a*c)//b-c)", "a,b,c=map(int,input().split())\r\nt=(a*c)/b\r\nw=t-c\r\nif w-int(w)>0:\r\n print(int(w)+1)\r\nelse:\r\n print(int(w))", "if __name__ == \"__main__\":\n a, b, c = list(map(int, input().split()))\n\n aux = (a*c)-(b*c)\n\n t = int(aux/b) + (aux % b > 0)\n\n print(t)\n\t \t \t \t\t\t \t \t\t \t \t \t\t\t\t \t", "l = input().split(' ')\r\na,b,c =int(l[0]), int(l[1]), int(l[2])\r\nd = ((a-b)*c+b-1)//b\r\nprint(d)", "import math \r\na,b,c = map(int,input().split())\r\nr = a*c//b + 1\r\nX = math.ceil(c*(a - b )/b)\r\ndef bS_sol(l,r,X):\r\n if r >= 1:\r\n m = (r + l )//2\r\n if m == X:\r\n return m\r\n elif m > X:\r\n return bS_sol(l,m - 1,X)\r\n else :\r\n return bS_sol(m + 1,r,X)\r\n\r\nprint(bS_sol(-1,r,X))\r\n", "w,d,l=map(int,input().split())\r\nif(d>w):print(0)\r\nelse:print((w*l-d*l)//d+int((w*l-d*l)%d!=0))", "a, b, c = map(int, input().split())\r\n\r\nwait = 0\r\nwhile (wait + c) * b < a * c:\r\n wait += 1\r\n\r\nprint(wait)\r\n", "import math\r\na,b,c=map(int,input().strip().split())\r\nd=a*c\r\nprint(math.ceil(d/b)-c)", "import math\r\nlist1=[]\r\nstr1=input()\r\nlist2=str1.split(\" \")\r\nlist2_length=len(list2)\r\ni=0\r\nwhile i<=list2_length-1:\r\n list1.append(int(list2.pop()))\r\n i += 1\r\nlist1.reverse()\r\nprint(math.ceil((list1[0]*list1[2]-list1[1]*list1[2])/list1[1]))\r\n", "def main():\n\ta, b, c = map(int, input().split())\n\tlo = 0\n\thi = ((a*c)//b) + 1\n\tpre_mid = 0\n\n\twhile lo <= hi:\n\t\tmid = (lo+hi)//2\n\n\t\tif (mid+c)*b < a*c:\n\t\t\tlo = mid + 1\n\t\telse:\n\t\t\thi = mid - 1\n\t\t\tpre_mid = mid\n\tprint(pre_mid)\n\nif __name__ == '__main__':\n\tmain()", "a,b,c=[int(e) for e in input().split()]\r\nprint((a*c+b-1)//b-c)", "a,b,c=map(int,input().split())\r\nt=c*a//b\r\nle=0\r\nri=10**10\r\nwhile le+1<ri:\r\n m=(le+ri)//2\r\n k=m*b%a\r\n flag=1\r\n t=m*b//a\r\n \r\n for i in range(1,c+1):\r\n \r\n k+=b\r\n t+=k//a\r\n k%=a\r\n t-=1\r\n if t<0:\r\n flag=0\r\n break\r\n \r\n if flag==0:\r\n le=m\r\n else:\r\n \r\n ri=m\r\nprint(ri)\r\n \r\n", "import math\nw,d,t= (map(int,input().split()))\nprint(math.ceil(((w-d)*t)/d))\n", "import math\r\na, b,c = map(int, input().rstrip().split())\r\nans=math.ceil((a*c)/b)-c\r\nprint(ans)", "a, b, c = map(int, input().split())\r\nprint(0--(a*c)//b-c)", "from math import ceil\n\na, b, c = map(int, input().split())\ntotal = a*c\ndww = b*c\nprint(ceil((total-dww)/b))", "a,b,c=map(int,input().split())\r\n\r\nneed=a*c\r\ninc=b*c\r\n\r\nwait=need-inc\r\nans=0\r\n\r\nif(wait%b==0):\r\n ans=wait//b\r\nelse:\r\n ans=wait//b+1\r\n \r\nprint(ans)", "a,b,c=[int(x) for x in input().split()]\r\nt=a*c//b-c\r\nif (a*c)%b==0:\r\n\tprint(t)\r\nelse:\r\n\tprint(t+1)", "from math import ceil\r\n\r\na, b, c = map(int, input().split())\r\nu = a * c\r\nt = ceil(u / b)\r\nprint(max(t - c, 0))", "a, b, c = map(int, input().split())\nprint(int((c*a+b-1)/b) - c)", "a,b,c=list(map(int,input().split()))\r\nprint(((a*c)//b+((a*c)%b!=0))-c)", "X = list(map(int, input().split()))\r\nCounter, Sec, Wait, Down = 0, 1, 0, 0\r\nwhile Down < (X[0] * X[-1]):\r\n Down += X[1]\r\n if Down < Sec * X[0]:\r\n Wait += 1\r\n else:\r\n Sec += 1\r\nprint(Wait)\r\n\r\n# UB_CodeForces\r\n# Advice: Falling down is an accident, staying down is a choice\r\n# Location: A Few days in Mashhad\r\n# Caption: While testing some newcomer\r\n# CodeNumber: 681\r\n", "\na, b, c = map(int,input().split())\n\nans = c * (a-b) + b-1\n\nprint(ans//b)\n\n#zzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzzz\n\t\t \t \t \t \t \t \t \t \t \t", "def is_enough(a, b, c, m):\r\n return (c + m) * b >= c * a\r\n\r\n\r\ndef main(a, b, c):\r\n # a - data to watch one second\r\n # b - data from Inet for one sec\r\n # c - size of the video\r\n l = -1\r\n r = c * a // b # l + 1 == r\r\n while r - l > 1:\r\n m = (r + l) // 2\r\n if is_enough(a, b, c, m):\r\n r = m\r\n else:\r\n l = m\r\n return r\r\n\r\n\r\nif __name__ == \"__main__\":\r\n a, b, c = list(map(int, input().strip().split()))\r\n print(main(a, b, c))\r\n", "a,b,c = map(int,input().split())\r\nd = a*c\r\nprint(d//b+(d%b!=0)-c)", "a,b,c=map(int,input().split())\r\nfrom math import ceil\r\nprint(ceil(c*a/b)-c)", "def binarysearch(arr,l,r,val):\r\n if r>=l:\r\n mid = l+(r-l)//2\r\n if arr[mid] == val:\r\n return mid\r\n elif arr[mid] > val:\r\n return binarysearch(arr,l,mid-1,val)\r\n else:\r\n return binarysearch(arr,mid+1,r,val)\r\n \r\n return r\r\n\r\na,b,c = map(int,input().split())\r\nsum = b\r\narr = []\r\nwhile sum <= (a*c):\r\n\tarr.append(sum)\r\n\tsum+=b\r\nk = (a*c) - (b*c)\t\r\nz = binarysearch(arr,0,len(arr)-1,k)\r\nif k == arr[z]:\r\n\tprint(z+1)\r\nelse:\r\n\tprint(z+2)\r\n\r\n\t", "a,b,c = input().split()\na= int(a)\nb= int(b)\nc= int(c)\nans = (((a-b)*c + b -1) // b)\nprint(ans)\n \t\t\t \t\t \t \t\t \t\t\t \t\t\t\t \t\t\t\t", "import math\r\n\r\na, b, c = map(int, input().split())\r\n\r\nprint(math.ceil(c * (a - b) / b))\r\n", "def round_up(x):\r\n if x % 1 == 0:\r\n return int(x)\r\n else:\r\n return int(x // 1 + 1)\r\n\r\n\r\na, b, c = [int(x) for x in input().split()]\r\n\r\nlatency = a * c / b - c \r\nprint(round_up(latency))\r\n", "def FindAnswer(a,b,c):\r\n l = 0\r\n r = c * (a//b)\r\n while (l + 1 < r):\r\n t = (l + r) // 2\r\n if b * t - a * c + b * c < 0:\r\n l = t\r\n else:\r\n r = t\r\n return r\r\n\r\ndef main():\r\n a,b,c = map(int,input().split())\r\n print(FindAnswer(a,b,c))\r\n\r\nmain() ", "a, b, v = map(int, input().split())\r\nprint((a * v - 1) // b + 1 - v)", "from math import ceil\r\n\r\na, b, c = [int(i) for i in input().split()]\r\nprint(int(ceil((c*a - c*b) / b)))", "import math\r\ndef time(a, b, c):\r\n\tx = 0\r\n\twhile x < math.ceil(a * c / b) - c:\r\n\t\tx += 1\r\n\treturn x\r\n\r\na, b, c = map(int, input().split())\r\nprint(time(a, b, c))", "from math import ceil\r\n\r\nvid,ips,sec=map(int,input().split())\r\na=ceil(vid*sec/ips)-sec\r\nprint(a)", "import math\r\na,b,c=map(int,input().split())\r\nre=a*c-(b*c)\r\nprint(math.ceil(re/b))\r\n\r\n", "a,b,c = map(int, input() .split())\r\nt = 0\r\ny = a * c\r\nwhile True:\r\n t+=1\r\n y -= b\r\n if b*c >= y :\r\n print(t)\r\n break", "def check(e, a, b, c):\r\n tot = a * c\r\n down = e * b\r\n if down + (c * b) >= tot:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\ndef binary_search(arr, l, r, a, b, c):\r\n while l <= r:\r\n mid = l + (r - l) // 2\r\n if check(arr[mid], a, b, c):\r\n if mid != 0 and check(arr[mid - 1], a, b, c):\r\n r = mid - 1\r\n else:\r\n return arr[mid]\r\n else:\r\n l = mid + 1\r\n return -1\r\n\r\n\r\na, b, c = [int(i) for i in input().split()]\r\narr = [int(i) for i in range(a*c)]\r\nx = binary_search(arr, 0, (a*c)-1,a,b,c)\r\nprint(x)", "def func(m):\r\n total_data = m * speed + time * speed\r\n if total_data >= need * time:\r\n return True\r\n return False\r\n\r\nneed, speed, time = [int(elem) for elem in input().split()]\r\nl, r = 0, 10**10 # (l;r]\r\nwhile r - l > 1:\r\n m = (l + r) // 2\r\n if func(m):\r\n r = m\r\n else:\r\n l = m\r\nprint(r)", "from math import *\r\na,b,n=map(int,input().split())\r\nx=(a-b)/b\r\ny=ceil(x*n)\r\nprint(y)", "from math import ceil\r\n\r\na, b, c = map(int, input().split())\r\n\r\nprint(max(0, ceil((a-b)*c/b)))", "a,b,c=map(int,input().split())\r\nnum = (a*c)-(b*c)\r\nprint(num//b if num%b==0 else (num//b)+1, end = \"\")", "a,b,c=map(int,input().split())\r\nl,r=1,a*c\r\np=r\r\nwhile l<=r:\r\n m=l+(r-l)//2\r\n if m*b + b*c>=a*c:\r\n p=m\r\n r=m-1\r\n else:\r\n l=m+1\r\nprint(p)", "a,b,c = map(int,input().split())\r\nif (c*(a-b))%b==0:\r\n print((c*(a-b))//b)\r\nelse:\r\n print((c*(a-b))//b + 1)", "a,b,c = map(int, input().split())\r\nprint(0--(a*c) // b - c)", "# https://codeforces.com/problemset/problem/195/A\n\na,b,c = map(int,input().split())\ndataNeeded = a * c\nlow,high = 0,dataNeeded\nwhile low < high:\n mid = (low + high)//2\n if mid * b + c * b >= dataNeeded:\n high = mid\n else:\n low = mid + 1\nprint(low)", "import math\r\ndef solve(a: int, b: int, c: int) -> int:\r\n return(math.ceil((a * c) / b) - c)\r\n \r\na, b, c = map(int, input().split())\r\nprint(solve(a, b, c))\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\ndef solution(a, b, c):\r\n return math.ceil(a * c / b) - c\r\n\r\nif __name__ == \"__main__\":\r\n a, b, c = list(map(int, input().split()))\r\n print(solution(a, b, c))\r\n ", "a,b,c = map(int,input().split())\r\ntotal = (a*c)//b\r\nt = 0\r\n\r\nfor i in range(total+1):\r\n\tif total*b>=(total-i)*a:\r\n\t\tt = i\r\n\t\tbreak\r\n\r\nprint(t)", "a, b, c = map(int, input().split())\r\nw = a * c\r\nl = []\r\nt = 0\r\nwhile True:\r\n if t * b + c * b < w:\r\n t += 1\r\n else:\r\n break\r\nprint(t)" ]

[ "def zero():\n return 0\nfrom collections import defaultdict\nn = int(input())\np = [int(i) for i in input().split()]\nc=defaultdict(zero)\na,b=0,0\nfor i in range(n):\n if(p[i]>a):\n b=a\n a=p[i]\n c[p[i]]-=1\n \n elif p[i]>b:\n b=p[i]\n c[a]+=1\nres=1\nfor i in range(2,n+1):\n if(c[i]>c[res]):\n res=i\nprint(res)\n\t\t \t\t\t \t \t\t \t \t \t\t \t\t\t \t\t", "n=int(input())\r\na={}\r\nfor i in range(1,n+1):\r\n a[i]=0\r\nmax1,max2=0,0\r\nfor i in map(int,input().split()):\r\n if i<max1:\r\n if i>max2:\r\n a[max1]+=1\r\n max2=i\r\n else:\r\n a[i]-=1\r\n max2=max1\r\n max1=i\r\nm=-100\r\nfor i in a:\r\n if a[i]>m:\r\n m=a[i]\r\n ans=i\r\nprint(ans)\r\n\r\n", "n=int(input())\r\nm1=0\r\nm2=0\r\na=[0]*(n+1)\r\na[0]=-n-5\r\nmini=n+5\r\nk=list(map(int,input().split()))\r\nm=0\r\n\r\nfor i in k:\r\n if i>m:\r\n a[i]=-1\r\n else:\r\n a[i]=0\r\n m=max(m,i)\r\n\r\nif n==1:\r\n print(k[0])\r\n exit()\r\n\r\nfor i in k:\r\n mini=min(mini,i)\r\n if m1>i>m2:\r\n a[m1]+=1\r\n m2=int(i)\r\n if i>m1:\r\n m2=int(m1)\r\n m1=int(i)\r\n\r\nm=max(a)\r\nif m==0:\r\n print(min(k[1:]))\r\nelse:\r\n print(a.index(m))\r\n", "import sys\r\nfrom array import array\r\nfrom heapq import *\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\nout = []\r\n\r\nn, a = int(input()), array('i', inp(int))\r\nque = array('i', [0])\r\nans, cur = array('i', [0] * (n + 1)), 0\r\n\r\nfor i in range(n):\r\n if abs(que[0]) < a[i]:\r\n cur += 1\r\n ans[a[i]] -= 1\r\n\r\n ele = heappop(que)\r\n if abs(ele) > a[i] and not (que and abs(que[0]) > a[i]):\r\n ans[abs(ele)] += 1\r\n\r\n heappush(que, ele)\r\n heappush(que, -a[i])\r\n\r\nprint(max(range(1,n + 1), key=ans.__getitem__))\r\n", "from sys import *\nfrom collections import *\nfrom math import *\nfrom random import *\nfrom datetime import date\n\nclass BIT:\n def __init__(self, n):\n \n self.n = n \n self.tree = [0]*(n+1)\n \n def __setitem__(self, i, v):\n\n while i <= self.n:\n self.tree[i] += v\n i += i&-i\n \n def __getitem__(self, i):\n \n p = 0\n\n while i > 0:\n p += self.tree[i]\n i -= i&-i\n return p\n \ndef lStr(d = \" \"): return input().split(\" \")\ndef lInt(d = \" \"): return [int(i) for i in input().split(d)]\ndef lDec(d = \" \"): return [float(i) for i in input().split(d)]\n\nn, *t = lInt()\np = lInt()\nb = BIT(n+1)\nmaxi = 0\nrec = [0]*(n+1)\nblock = [0]*(n+1)\nans, best = 10000000, 0\nfix = 0\n\nfor i in range(0, n):\n v = p[i]\n b[v] = 1\n g = i-b[v-1]\n rec[v] = g == 0\n fix += g == 0\n block[maxi] += g == 1\n maxi = max(maxi, v)\nfor v in p:\n tot = fix+block[v]-(rec[v] == 1)\n\n if tot > best:\n best = tot\n ans = v\n if tot == best:\n ans = min(ans, v)\nprint(ans)\n \n\n\n", "n = int(input())\nc = [-2] + [0] * n\np, q = 0, 0\nfor i in map(int, input().split()):\n if p < i:\n q = p\n p = i\n c[p]-=1\n elif q < i:\n q = i\n c[p] += 1\nprint(c.index(max(c)))\n \t\t \t\t \t \t\t\t\t \t\t\t \t", "a=int(input())\nb=[]\nfor i in range(a+1):\n b.append(0)\nfir=0\nsec=0\nfor i in (input().split(' ')):\n j=int(i)\n if j>fir:\n sec=fir\n fir=j\n b[j]=1\n elif j>sec:\n sec=j\n b[fir]-=1\nans=1\nfor i in range(1,a+1):\n if b[i]<b[ans]:\n ans=i\nprint(ans)\n \t\t\t \t\t \t\t\t \t \t\t \t \t\t \t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\nk = [0] * n\r\na, b, idx = 0, 0, -1\r\nfor i in range(n):\r\n if arr[i] > a:\r\n b = a\r\n a = arr[i] \r\n idx = i\r\n k[i] = -1\r\n elif arr[i] > b:\r\n b = arr[i]\r\n k[idx] += 1\r\nc = max(k)\r\nres = n + 1\r\nfor i in range(len(k)):\r\n if k[i] == c:\r\n res = min(res, arr[i])\r\nprint(res)\r\n", "a,b,ap = 0,0,-1\r\nn = int(input())\r\nl = [int(i) for i in input().split()]\r\nk = [0]*n\r\nfor i in range(len(l)):\r\n if l[i] > a:\r\n b = a\r\n a = l[i]\r\n ap = i\r\n k[i] = -1\r\n elif l[i] > b:\r\n b = l[i]\r\n k[ap] += 1\r\nc = max(k)\r\na = n+1\r\nfor i in range(len(k)):\r\n if k[i] == c:\r\n a = min(a,l[i])\r\nprint(a)", "n = int(input())\r\n\r\n\r\nif (n == 1):\r\n s = input().split()\r\n print(1)\r\nelse:\r\n\r\n s = input().split()\r\n\r\n for i in range(n):\r\n s[i] = int(s[i])\r\n\r\n\r\n obj = {}\r\n\r\n if (s[1] > s[0]):\r\n obj[s[0]] = -1\r\n else:\r\n obj[s[0]] = 0\r\n\r\n if (s[1] > s[0]):\r\n obj[s[1]] = -1\r\n else:\r\n obj[s[1]] = 0\r\n\r\n max2 = min(s[1], s[0])\r\n max1 = max(s[1], s[0]) \r\n\r\n\r\n for i in range(2, n):\r\n if (s[i] < max2):\r\n obj[s[i]] = 0\r\n elif (s[i] < max1):\r\n max2 = s[i]\r\n obj[s[i]] = 0\r\n obj[max1] += 1\r\n else:\r\n max2 = max1\r\n max1 = s[i]\r\n obj[s[i]] = -1\r\n\r\n\r\n mx = -2\r\n for key in obj:\r\n mx = max(mx, obj[key])\r\n\r\n num = n + 1\r\n\r\n for key in obj:\r\n if (obj[key] == mx):\r\n num = min(key, num)\r\n\r\n print(num)", "def inc(idx):\r\n global t\r\n while idx <= n:\r\n t[idx] += 1\r\n idx += idx & -idx\r\n\r\ndef sum_val(idx):\r\n res = 0\r\n while idx > 0:\r\n res += t[idx]\r\n idx -= idx & -idx\r\n return res\r\n\r\ndef sum_range(l, r):\r\n return sum_val(r) - sum_val(l - 1)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncur_max = 0\r\nrecords = 0\r\nrecord = [0] * n\r\nmax_idx = [0] * n\r\nfor i in range(n):\r\n if a[i] > cur_max:\r\n record[i] = 1\r\n records += 1\r\n cur_max = a[i]\r\n max_idx[i] = i\r\n else:\r\n max_idx[i] = max_idx[i - 1]\r\n\r\nt = [0] * (n + 1)\r\nobs = [0] * n\r\ninc(a[0])\r\nfor i in range(1, n):\r\n if sum_range(a[i], n) == 1:\r\n obs[max_idx[i - 1]] += 1\r\n inc(a[i])\r\n\r\nbest = -1\r\nbest_val = -1\r\nfor i in range(n):\r\n cur = records - record[i] + obs[i]\r\n if cur > best or (cur == best and a[i] < best_val):\r\n best = cur\r\n best_val = a[i]\r\nprint(best_val)# 1690281600.7346866", "# Author : nitish420 --------------------------------------------------------------------\r\nfrom sys import stdin \r\nfrom collections import defaultdict\r\ninput=stdin.readline\r\n\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nif n<=2:\r\n print(min(l))\r\n exit()\r\n\r\nmx,smx=0,0\r\n\r\nrecords=[0]*(n)\r\n\r\ndct=defaultdict(int)\r\n\r\n\r\n\r\ntotal=0\r\n\r\nfor i in range(n):\r\n if mx<l[i]:\r\n smx=mx\r\n mx=l[i]\r\n elif smx<l[i]:\r\n smx=l[i]\r\n \r\n if l[i]==mx:\r\n records[i]=1\r\n total+=1\r\n elif smx==l[i]:\r\n dct[mx]+=1\r\n \r\nans=[0]*(n)\r\n\r\nmx=0\r\n\r\nfor i in range(n):\r\n ans[i]=total-records[i]+dct[l[i]]\r\n if mx<ans[i]:\r\n mx=ans[i]\r\n\r\nmm=n+1\r\n\r\nfor i in range(n):\r\n if ans[i]==mx:\r\n if mm>l[i]:\r\n mm=l[i]\r\n\r\nprint(mm)\r\n" ]