Datasets:

mlfoundations-dev

/

Codeforces-Python-Submissions_processed

like 0

Follow

ML Foundations Development 37

[ "s = input()\na = []\nfor i in range(10):\n a.append(input())\n\np = 0\nwhile(p < 80):\n for i in range(10):\n if a[i] == s[p:p+10]:\n print(i, end='')\n p += 10\n break\n\n", "password = input()\r\nnum = []\r\npas = []\r\nfor i in range(10): num.append(input())\r\n\r\nwhile password != '':\r\n\titem = password[:10]\r\n\tpassword = password[10:]\r\n\tpas.append(num.index(item))\r\n\r\nfor i in range(8):\r\n\tprint(pas[i], end='')\r\n", "password=input();nums=[];ans=''\r\nfor i in range(10):num=input();nums.append(num)\r\nfor i in range(0,80,10):ans+=str(nums.index(password[i:i+10]))\r\nprint(ans)\r\n", "import sys\r\n\r\ndef get_ints(): return [int(x) for x in sys.stdin.readline().strip().split()]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n\r\ns=get_string()\r\nsar=[get_string() for i in range(10)]\r\n\r\nfor i in range(8):\r\n str=s[i*10:i*10+10]\r\n for j in range(len(sar)):\r\n if(str==sar[j]):\r\n print(j,end=\"\")\r\n break\r\n\r\n", "def splitter(s):\r\n\tli=[]\r\n\ti=0\r\n\tj=10\r\n\tfor k in range(8):\r\n\t\tli.append(s[i:j])\r\n\t\ti+=10\r\n\t\tj+=10\r\n\treturn li\r\nlist1=splitter(input())\r\nans=\"\"\r\nkey_w=[]\r\nfor i in range(10):\r\n\tkey_w.append(input())\r\nfor i in list1:\r\n\tans+=str(key_w.index(i))\r\nprint(ans)", "from textwrap import wrap\r\np=wrap(input(), 10);l=[]\r\nfor i in range(10):\r\n c=input();l.append(c)\r\nprint(*[l.index(j) for j in p], sep=\"\")", "n= list(input())\r\nans =[]\r\nfor i in range(len(n)//10):\r\n tmp = n[:10]\r\n n= n[10:]\r\n ans.append(tmp)\r\na2=[]\r\nfor i in ans:\r\n a2.append(''.join(i))\r\nans=[]\r\nfor i in range(10):\r\n ans.append(input())\r\n\r\ns='' \r\nfor i in a2:\r\n s+=str(ans.index(i))\r\n \r\nprint(s) ", "code = input()\r\ndic = {}\r\nfor i in range(10):\r\n\tstr = input()\r\n\tdic[str] = i\r\n\r\nwhile len(code) > 0 :\r\n\tprint(dic[code[0:10]], end='')\r\n\tcode = code[10:]", "s = input()\r\nd = {}\r\nfor i in range(10):\r\n d[input()] = str(i)\r\nans = ''\r\nfor i in range(0, 80, 10):\r\n ans += d[s[i:i+10]]\r\nprint(ans)", "s=input()\r\ng={}\r\nfor i in range(10):g[input()]=i\r\nfor i in range(0,80,10):print(g[s[i:i+10]],end='')", "# LUOGU_RID: 120992711\nsx=input();s0=input();s1=input();s2=input();s3=input();s4=input();s5=input();s6=input();s7=input();s8=input();s9=input()\na1=sx[0]+sx[1]+sx[2]+sx[3]+sx[4]+sx[5]+sx[6]+sx[7]+sx[8]+sx[9]\na2=sx[10]+sx[11]+sx[12]+sx[13]+sx[14]+sx[15]+sx[16]+sx[17]+sx[18]+sx[19]\na3=sx[20]+sx[21]+sx[22]+sx[23]+sx[24]+sx[25]+sx[26]+sx[27]+sx[28]+sx[29]\na4=sx[30]+sx[31]+sx[32]+sx[33]+sx[34]+sx[35]+sx[36]+sx[37]+sx[38]+sx[39]\na5=sx[40]+sx[41]+sx[42]+sx[43]+sx[44]+sx[45]+sx[46]+sx[47]+sx[48]+sx[49]\na6=sx[50]+sx[51]+sx[52]+sx[53]+sx[54]+sx[55]+sx[56]+sx[57]+sx[58]+sx[59]\na7=sx[60]+sx[61]+sx[62]+sx[63]+sx[64]+sx[65]+sx[66]+sx[67]+sx[68]+sx[69]\na8=sx[70]+sx[71]+sx[72]+sx[73]+sx[74]+sx[75]+sx[76]+sx[77]+sx[78]+sx[79]\nif a1==s0:\n print(\"0\",end=\"\")\nelif a1==s1:\n print(\"1\",end=\"\")\nelif a1==s2:\n print(\"2\",end=\"\")\nelif a1==s3:\n print(\"3\",end=\"\")\nelif a1==s4:\n print(\"4\",end=\"\")\nelif a1==s5:\n print(\"5\",end=\"\")\nelif a1==s6:\n print(\"6\",end=\"\")\nelif a1==s7:\n print(\"7\",end=\"\")\nelif a1==s8:\n print(\"8\",end=\"\")\nelif a1==s9:\n print(\"9\",end=\"\")\nif a2==s0:\n print(\"0\",end=\"\")\nelif a2==s1:\n print(\"1\",end=\"\")\nelif a2==s2:\n print(\"2\",end=\"\")\nelif a2==s3:\n print(\"3\",end=\"\")\nelif a2==s4:\n print(\"4\",end=\"\")\nelif a2==s5:\n print(\"5\",end=\"\")\nelif a2==s6:\n print(\"6\",end=\"\")\nelif a2==s7:\n print(\"7\",end=\"\")\nelif a2==s8:\n print(\"8\",end=\"\")\nelif a2==s9:\n print(\"9\",end=\"\")\nif a3==s0:\n print(\"0\",end=\"\")\nelif a3==s1:\n print(\"1\",end=\"\")\nelif a3==s2:\n print(\"2\",end=\"\")\nelif a3==s3:\n print(\"3\",end=\"\")\nelif a3==s4:\n print(\"4\",end=\"\")\nelif a3==s5:\n print(\"5\",end=\"\")\nelif a3==s6:\n print(\"6\",end=\"\")\nelif a3==s7:\n print(\"7\",end=\"\")\nelif a3==s8:\n print(\"8\",end=\"\")\nelif a3==s9:\n print(\"9\",end=\"\")\nif a4==s0:\n print(\"0\",end=\"\")\nelif a4==s1:\n print(\"1\",end=\"\")\nelif a4==s2:\n print(\"2\",end=\"\")\nelif a4==s3:\n print(\"3\",end=\"\")\nelif a4==s4:\n print(\"4\",end=\"\")\nelif a4==s5:\n print(\"5\",end=\"\")\nelif a4==s6:\n print(\"6\",end=\"\")\nelif a4==s7:\n print(\"7\",end=\"\")\nelif a4==s8:\n print(\"8\",end=\"\")\nelif a4==s9:\n print(\"9\",end=\"\")\nif a5==s0:\n print(\"0\",end=\"\")\nelif a5==s1:\n print(\"1\",end=\"\")\nelif a5==s2:\n print(\"2\",end=\"\")\nelif a5==s3:\n print(\"3\",end=\"\")\nelif a5==s4:\n print(\"4\",end=\"\")\nelif a5==s5:\n print(\"5\",end=\"\")\nelif a5==s6:\n print(\"6\",end=\"\")\nelif a5==s7:\n print(\"7\",end=\"\")\nelif a5==s8:\n print(\"8\",end=\"\")\nelif a5==s9:\n print(\"9\",end=\"\")\nif a6==s0:\n print(\"0\",end=\"\")\nelif a6==s1:\n print(\"1\",end=\"\")\nelif a6==s2:\n print(\"2\",end=\"\")\nelif a6==s3:\n print(\"3\",end=\"\")\nelif a6==s4:\n print(\"4\",end=\"\")\nelif a6==s5:\n print(\"5\",end=\"\")\nelif a6==s6:\n print(\"6\",end=\"\")\nelif a6==s7:\n print(\"7\",end=\"\")\nelif a6==s8:\n print(\"8\",end=\"\")\nelif a6==s9:\n print(\"9\",end=\"\")\nif a7==s0:\n print(\"0\",end=\"\")\nelif a7==s1:\n print(\"1\",end=\"\")\nelif a7==s2:\n print(\"2\",end=\"\")\nelif a7==s3:\n print(\"3\",end=\"\")\nelif a7==s4:\n print(\"4\",end=\"\")\nelif a7==s5:\n print(\"5\",end=\"\")\nelif a7==s6:\n print(\"6\",end=\"\")\nelif a7==s7:\n print(\"7\",end=\"\")\nelif a7==s8:\n print(\"8\",end=\"\")\nelif a7==s9:\n print(\"9\",end=\"\")\nif a8==s0:\n print(\"0\",end=\"\")\nelif a8==s1:\n print(\"1\",end=\"\")\nelif a8==s2:\n print(\"2\",end=\"\")\nelif a8==s3:\n print(\"3\",end=\"\")\nelif a8==s4:\n print(\"4\",end=\"\")\nelif a8==s5:\n print(\"5\",end=\"\")\nelif a8==s6:\n print(\"6\",end=\"\")\nelif a8==s7:\n print(\"7\",end=\"\")\nelif a8==s8:\n print(\"8\",end=\"\")\nelif a8==s9:\n print(\"9\",end=\"\")", "s=input()\r\na,b=list(),list()\r\nfor i in range(0,len(s)-9,10):a.append(s[i:i+10])\r\nfor i in range(10):b.append(input())\r\nfor i in a:print(b.index(i),end='')", "code = input()\r\nl = [None] * 10 \r\nfor i in range (10) : \r\n l[i] = input()\r\nres = \"\" \r\nfor i in range(0 , len(code) , 10) : \r\n res += str(l.index(code[i : i+10]))\r\nprint(res) ", "n = input()\r\nl = list()\r\nsss = \"\"\r\nll = list()\r\nfor i in range(10):\r\n s = input()\r\n ll.append(s)\r\n \r\nfor i in range(8):\r\n n = \"\".join(n)\r\n l.append(n[0:10])\r\n n = list(n)\r\n del n[0:10]\r\nfor i in l:\r\n sss+=str(ll.index(i))\r\n\r\nprint(sss)", "pwd = str(input())\r\nseq = [str(input()),str(input()),str(input()),str(input()),str(input())\r\n ,str(input()),str(input()),str(input()),str(input()),str(input())]\r\nfor n in range(0 , 8):\r\n for i in range(0 ,len(seq)) :\r\n if pwd[n*10:n*10+10] ==seq[i] :\r\n print(i , end= '')", "CODE = input()\r\nMAP = []\r\nfor i in range(10):\r\n MAP += [input()]\r\n\r\nans = \"\"\r\ni = 0\r\nwhile i + 10 <= 80:\r\n ans += str(MAP.index(CODE[i:i+10]))\r\n i += 10\r\nprint(ans)\r\n ", "code = input()\r\ncode_nums = []\r\npwd = \"\"\r\nfor i in range(10):\r\n code_num = input()\r\n code_nums.append(code_num)\r\nfor i in range(0, 71, 10):\r\n for j in range(len(code_nums)):\r\n if code_nums[j] == code[i:i+10]:\r\n pwd += str(j)\r\nprint(pwd)\r\n", "encrypted_password = input()\nbinary_codes = [input() for _ in range(10)]\n\ndecryption_map = {binary: str(i) for i, binary in enumerate(binary_codes)}\n\npassword = ''\nfor i in range(0, len(encrypted_password), 10):\n digit_binary = encrypted_password[i:i+10]\n password += decryption_map[digit_binary]\n\nprint(password)\n \t\t\t\t \t \t \t\t\t \t \t \t\t \t\t\t", "n = input()\r\nl = [input() for i in range(10)]\r\n\r\nprint(*[l.index(n[i * 10:(i + 1) * 10]) for i in range(8)], sep='')\r\n", "ISQ = input()\ni = 0\nnumbers = {}\nwhile i < 10:\n numbers[input()] = i\n i += 1\n\nISQpart = []\nfor i in range(0, len(ISQ),10):\n num = \"\"\n for j in range(i, i+10):\n num += ISQ[j]\n ISQpart += [num ,]\npword = \"\"\nfor i in ISQpart:\n if i in numbers:\n pword += str(numbers[i])\nprint(pword)\n", "s = input()\r\nd = {input(): str(x) for x in range(10)}\r\nres = ''\r\nfor i in range(0, len(s), 10):\r\n res += d[s[i:i+10]]\r\nprint(res)", "s = input()\r\nl = [input() for i in range(10)]\r\nans = ''\r\nfor i in range(8):\r\n ans += str(l.index(s[i * 10:(i + 1) * 10]))\r\nprint(ans)", "# Read the input\nencrypted_code = input().strip()\nbinary_codes = [input().strip() for _ in range(10)]\n\n# Create a dictionary to map binary codes to decimal digits\nbinary_to_decimal = {binary_codes[i]: str(i) for i in range(10)}\n\n# Initialize an empty string to store the decrypted password\npassword = \"\"\n\n# Decode the binary code in groups of 10 characters\nfor i in range(0, len(encrypted_code), 10):\n group = encrypted_code[i:i+10]\n password += binary_to_decimal[group]\n\n# Print the decrypted password\nprint(password)\n\n \t \t\t \t\t \t\t \t \t\t\t \t \t", "s=input()\r\nchs=[input() for i in range(10)]\r\nfor i in range(1,9):\r\n st=(i-1)*10\r\n en=st+10\r\n for e in range(10):\r\n if(s[st:en]==chs[e]):\r\n print(e,end=\"\")\r\n", "s=input()\nd={}\nfor i in range(10):\n d[input()]=str(i)\nans=[]\nfor i in range(8):\n a=s[:10]\n s=s[10:]\n ans.append(d[a])\nprint(''.join(ans))\n \n", "id={}\r\nans=\"\"\r\nsrc = input()\r\nfor i in range(10):\r\n id[input()]=i\r\nfor j in range(8):\r\n ans+=str(id[src[j*10:j*10+10]])\r\nprint(ans)", "t = input()\r\np = [t[i: i + 10] for i in range(0, 80, 10)]\r\nfor i in range(10):\r\n x = input()\r\n for j in range(8):\r\n if p[j] == x: p[j] = i\r\nprint(''.join(str(i) for i in p))", "password = (input()) \r\nl = list()\r\nm = list()\r\nfor a in range(0,10):\r\n\tl.append((input()))\r\n\r\nfor a in range(0,len(password),10):\r\n\tfor b in l:\r\n\t\tif(b == password[a:a+10]):\r\n\t\t\tm.append(str(l.index(b)))\r\n\r\nprint(\"\".join(m))", "code = input()\nhints = []\ndecoded = \"\"\n\nfor i in range(10):\n hints.append(input())\n\nfor j in range(8):\n for hint in hints:\n if code[(j * 10):(j * 10) + 10] == hint:\n decoded += str(hints.index(hint))\nprint(decoded)\n\n", "n=input()\r\nl = [input() for _ in range(10)]\r\nprint(*[l.index(n[i:i+10]) for i in range(0, 80, 10)], sep='')", "code = input()\r\nnum = {}\r\nfor i in range(10):\r\n num[input()] = str(i)\r\nans = \"\"\r\nfor i in range(8):\r\n ans += num[code[i*10:(i*10+10)]]\r\nprint(ans)\r\n \r\n", "encrypted_data = input()\r\ndecryption_key = [input() for i in range(10)]\r\npassword = ''\r\nfor i in range(8):\r\n for j in range(10):\r\n if decryption_key[j] == encrypted_data[:10]:\r\n password += str(j)\r\n encrypted_data = encrypted_data[10:] \r\nprint(password) ", "n = input()\r\npas = []\r\nans = ''\r\n\r\nfor i in range(10):\r\n pas.append(input())\r\n\r\nfor i in range(0, 80, 10):\r\n ans += str(pas.index(n[i:i+10]))\r\n\r\nprint(ans)\r\n", "key = input()\nc = [str(input()) for i in range(1,11)]\nb = []\nfor i in range(0,80,10):\n\tb.append(key[i:i+10])\nfor i in range(0,len(b)):\n\tprint(c.index(b[i]),end = \"\")\nprint(\"\")", "\n\npassword = input()\n\nstr_to_dec = {}\n\nfor dec in range(10):\n str_to_dec[input()] = dec\n\ndec_pass = \"\"\n\nfor i in range(8):\n dec_pass += str(str_to_dec[password[10*i:10*(i+1)]])\n\nprint(dec_pass)\n\n\n\n", "# мне очень понравилась задача\r\n# интереснее было бы её решить (наверно)\r\n# с знанием списков и прочей наврено полезности.....\r\n\r\ncode = input()\r\nn0, n1, n2, n3, n4 = input(), input(), input(), input(), input()\r\nn5, n6, n7, n8, n9 = input(), input(), input(), input(), input()\r\nanswer = \"\"\r\n\r\n# самой больно от этого... Прости будущая Ариша\r\ndef chekSearch(string):\r\n if string == n0:\r\n return \"0\"\r\n if string == n1:\r\n return \"1\"\r\n if string == n2:\r\n return \"2\"\r\n if string == n3:\r\n return \"3\"\r\n if string == n4:\r\n return \"4\"\r\n if string == n5:\r\n return \"5\"\r\n if string == n6:\r\n return \"6\"\r\n if string == n7:\r\n return \"7\"\r\n if string == n8:\r\n return \"8\"\r\n if string == n9:\r\n return \"9\"\r\n\r\nfor i in range (0, len(code) - 10 + 1, 10):\r\n num = code[i:i + 10]\r\n answer += chekSearch(num)\r\n\r\nprint(answer)", "s = input()\r\nd = {}\r\nfor i in range(10):\r\n d[input()] = i\r\nfor i in range(8):\r\n print(d[s[i*10:(i+1)*10]], end='')\r\n", "s=input()\r\nd={}\r\nfor i in range(0,10):\r\n d[input()]=i\r\nfor i in range(8):\r\n print(d[s[i*10:(i+1)*10]],end='')\r\n", "\n\n\n\n\n\npw = [*(input())]\npwseg = [\"\".join(pw[x : x + 10]) for x in range(0, len(pw), 10)]\n\nfinpass = \"\"\n\nnums = []\n# print(\"pwseg\", pwseg)\nfor i in range(10) :\n num = input()\n nums.append(num)\n\n\n\n# print(\"nums\", nums)\nfor seg in pwseg :\n # print(\"seg\", seg)\n finpass += str(nums.index(seg))\n\nprint(finpass)\n\n \n\n\n \t \t \t \t \t\t \t\t \t\t \t \t \t\t", "\r\ninp=input()\r\nnum=[]\r\na=''\r\nfor x in range(10):\r\n num.append(input())\r\n\r\narr=[]\r\nfor x in range(8):\r\n arr.append(inp[(x*10):((x*10)+10)])\r\n\r\nfor x in arr:\r\n for q in range(10):\r\n if(x==num[q]):\r\n a=a+str(q)\r\n\r\nprint(a)\r\n", "ch = input()\r\nch0 = input()\r\nch1 = input()\r\nch2 = input()\r\nch3 = input()\r\nch4 = input()\r\nch5 = input()\r\nch6 = input()\r\nch7 = input()\r\nch8 = input()\r\nch9 = input()\r\nremaining_lines = [ch0,ch1,ch2,ch3,ch4,ch5,ch6,ch7,ch8,ch9]\r\nbegin = 0\r\nend = 10\r\ndigit = \"\"\r\nwhile(end <= len(ch)+1):\r\n digit = digit + str(remaining_lines.index(ch[begin:end]))\r\n begin = begin + 10\r\n end = end + 10\r\n\r\nprint(digit) ", "s=input()\r\np={}\r\nfor i in range(10):\r\n str=input()\r\n p[str]=i\r\nfor i in range(8):\r\n print(p[s[i*10:i*10+10]],end=\"\")", "n=input()\nvalues = []\nans=''\nfor i in range(10):\n values.append(input())\nparametro=0\nfor i in range(8):\n if n[parametro:parametro+10] in values:\n ans += str(values.index(n[parametro:parametro+10]))\n parametro+=10\nprint(ans)\n\n", "msg = input()\r\npassword = [msg[i:i+10] for i in range(0,80, 10)]\r\nfor i in range(10):\r\n\tdigit = input()\r\n\twhile digit in password:\r\n\t\tpassword[password.index(digit)] = str(i)\r\n\r\nprint(\"\".join(password))\r\n\r\n", "def main():\n s = input()\n d = {input(): str(_) for _ in range(10)}\n print(''.join(d[s[_:_ + 10]] for _ in range(0, 80, 10)))\n\n\nif __name__ == '__main__':\n main()", "code, digits = input(), {input():d for d in '0123456789'}\r\nprint(''.join(digits[code[10*i:10*(i+1)]] for i in range(8)))", "st = input(); ls = []\r\nfor i in range(10):\r\n ls.append(input())\r\npas = ''\r\nfor i in range(0,80,10):\r\n q = ls.index(st[i:i+10])\r\n pas+=str(q)\r\nprint(pas)", "a=input()\r\nc=[]\r\nfor i in range(0,10):\r\n b=input()\r\n c.append(b)\r\nk=0\r\nfor i in range(0,8):\r\n x=a[k:k+10]\r\n j=0\r\n while(x!=c[j]):\r\n j=j+1\r\n print(j,end=\"\")\r\n k=k+10", "if __name__ == '__main__':\r\n\ts = input()\r\n\td = dict()\r\n\tfor i in range (0,10):\r\n\t\ta = input()\r\n\t\td[a]=i\r\n\ti = 0\r\n\tans=''\r\n\twhile i < 80:\r\n\t\tans=ans+str(d[s[i:i+10]])\r\n\t\ti = i+10\r\n\tprint(ans)", "s = input()\r\nd = {}\r\ni = -1\r\nfor i in range(10):\r\n t = input()\r\n d[t] = i\r\nfor j in range(0, 80, 10):\r\n print(d[s[j : j + 10]], end=\"\")\r\n", "crypted_pass = input()\r\nlist_pass = [crypted_pass[i*10:i*10+10] for i in range(8)]\r\nd = {input(): str(i) for i in range(10)}\r\npassword = ''.join([d[list_pass[i]] for i in range(8)])\r\nprint(password)", "code_password = input()\r\ncode_numbers = {}\r\n\r\nfor i in range(10):\r\n code_numbers[input()] = i\r\n \r\nfor i in range(0, 71, 10):\r\n print(code_numbers[code_password[i:i + 10]], end='')", "s = input()\r\narr = []\r\nfor i in range(10):\r\n s1 = input()\r\n arr.append(s1)\r\nl = []\r\na,b=0,10\r\nfor i in range(8):\r\n l.append(s[a:b])\r\n a, b = a + 10, b + 10\r\nfor i in l:\r\n print(arr.index(i),end=\"\")", "code = input()\r\ncode_actual = []\r\nfor i in range (0,8):\r\n code_actual.append(code[i*10:(i+1)*10])\r\ncode_map = {}\r\nfor i in range (0,10):\r\n code_map[input()] = str(i)\r\nans = ''\r\nfor i in code_actual:\r\n ans += code_map[i]\r\nprint(ans)\r\n\r\n", "cpass = input()\ncpass_len = len(cpass)\ncdig = {}\nfor i in range(0, 10):\n\ts = input()\n\tcd_len = len(s)\n\tcdig[s] = i\n\nres = \"\"\nnd = cpass_len // cd_len\nfor i in range(0, nd):\n\td = cdig[cpass[cd_len * i : cd_len * (i + 1)]]\n\tres += str(d)\nprint(res)\n\t\n\t\n\t\n", "password = input()\ndico = {}\nfor x in range(10):\n dico[input()] = str(x)\nres = \"\"\nwhile password:\n res += dico[password[:10]]\n password = password[10:]\nprint(res)\n", "pas = input()\r\ndic = {}\r\nfor i in range(10):\r\n a = input()\r\n dic[a] = i \r\nans = \"\"\r\nfor i in range(0,len(pas),10):\r\n x = pas[i:i+10]\r\n ans += str(dic[x])\r\nprint(ans)", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\ns = input()\r\nd = {}\r\nfor i in range(10):\r\n d[input()] = str(i)\r\nres = ''\r\nfor i in range(0,71,10):\r\n res = res + d[ s[i:i+10] ]\r\nprint(res)", "lst = str(input())\r\n\r\nadad = []\r\n\r\nfor i in range(10):\r\n x = str(input())\r\n adad.append(x)\r\n\r\nAdad = []\r\n\r\nfor i in range(0 , 71 , 10):\r\n z = \"\".join(lst[i : i + 10])\r\n Adad.append(z)\r\n\r\n#print(Adad)\r\n\r\nans = \"\"\r\n\r\nfor i in range(len(Adad)):\r\n ans += str(adad.index(Adad[i]))\r\n \r\nprint(ans)", "x=input()\r\na=[]\r\nans=\"\"\r\nfor i in range(10):\r\n a.append(input())\r\nj=0\r\nfor i in range(8):\r\n s=x[j:j+10]\r\n for t in range(10):\r\n if s==a[t]:\r\n ans+=str(t)\r\n break\r\n j+=10\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", "ans = dict()\r\n\r\ns = input()\r\nfor i in range(10):\r\n key = input()\r\n\r\n ans[key] = i\r\n\r\n\r\nfor i in range(0,80,10):\r\n part = s[i:i+10][:]\r\n print(ans[part] , end = '')\r\n ", "s=input()\nx={}\nfor i in range(10):\n w=input()\n x[w]=str(i)\nans=\"\"\nfor i in range(0,80,10):\n ans+=x[s[i:i+10]]\nprint(ans)\n", "c=[input() for i in range(11)]\r\nx=[ c[0][i:i+10] for i in range(0,80,10)]\r\nfor i in x:\r\n print(c.index(i)-1,end='')\r\n", "s = input()\nd = {}\nfor i in range(10):\n d[input()] = i\nfor j in range(0, 80, 10):\n print(d[s[j:j + 10]], end='')\n", "s=input()\r\nl=[]\r\nfor i in range(0,10):\r\n l.append(input())\r\nfor i in range(0,8):\r\n print(l.index(s[i*10:(i+1)*10]),end=\"\")", "num=input()\r\ndecimal_list,div_list=[],[]\r\nstart,end=0,10\r\nfor i in range(10):\r\n line=input()\r\n decimal_list.append(line)\r\nfor i in range(8):\r\n print(decimal_list.index(num[start:end]),end='')\r\n start,end=end,end+10", "s = input()\r\nar = []\r\nfor i in range(10):\r\n code = input()\r\n ar.append(code)\r\nfor i in range(0, 80, 10):\r\n print(ar.index(s[i:i + 10]), end = '')\r\n", "# cook your dish here\ndef solve():\n cadena = input()\n subcadenas = dict()\n for i in range(10):\n numero = input()\n subcadenas[numero] = i\n for i in range(0,80,10):\n print(subcadenas[cadena[i:i+10]],end='')\n \n\ndef main():\n solve()\nmain()\n \t \t \t \t \t \t\t \t \t\t \t\t", "account_info = input()\r\narr = []\r\nres = ''\r\n\r\nfor _ in range(10):\r\n arr.append(input())\r\n\r\nfor i in range(0, 80, 10):\r\n digit = account_info[i:i + 10]\r\n for j in range(10):\r\n if digit == arr[j]:\r\n res += str(j)\r\n break\r\n\r\nprint(res)\r\n", "word = input()\r\ndc = dict()\r\nfor i in range(10): \r\n dc[input()] = str(i)\r\nprint(''.join(dc[word[i:i + 10]] for i in range(0,80,10)))", "\r\ncontrasenia_encriptada = input()\r\ncodigo_binario = []\r\n\r\nfor i in range(10):\r\n codigo_binario.append(input())\r\n\r\ncontrasenia = ''\r\n\r\nfor i in range(8):\r\n for j in range(10):\r\n if contrasenia_encriptada[i*10:i*10+10] == codigo_binario[j]:\r\n contrasenia = contrasenia + str(j)\r\n\r\nprint(contrasenia)", "s = input()\r\n\r\nmapping = {}\r\nj = 0\r\ncases = 10\r\nwhile cases:\r\n cases -= 1\r\n ss = input()\r\n mapping[ss] = str(j)\r\n j += 1\r\nans = \"\"\r\nfor i in range(0, 80, 10):\r\n ans += mapping[s[i:i+10]]\r\n\r\nprint(ans)\r\n", "encrypted_password = input()\r\nnumbers = []\r\n\r\nfor i in range(10):\r\n numbers.append(input())\r\n\r\ncharacters = \"\"\r\noriginal_password = \"\"\r\n\r\nfor i in encrypted_password:\r\n characters += i\r\n\r\n if(len(characters) == 10):\r\n for j in range(len(numbers)):\r\n if(characters == numbers[j]):\r\n original_password += str(j)\r\n flag = 0\r\n characters = \"\"\r\n\r\nprint(original_password)", "read=input()\r\narr=[]\r\n\r\nfor i in range(8):\r\n str1=\"\"\r\n for j in range(10):\r\n str1+=read[10*i+j]\r\n arr.append(str1)\r\n\r\nmp = {'key':'value'}\r\n\r\nfor i in range(10):\r\n s=input()\r\n mp[s]=i\r\n\r\n\r\nresult=\"\"\r\nfor i in range(8):\r\n result+=str(mp[arr[i]])\r\n\r\nprint(result)", "binary = input()\nl = []\nfor i in range(10):\n l.append(input())\nfor i in range(8):\n bl = binary[i*10:(i + 1)*10]\n for j in range(10):\n if l[j] == bl:\n print(j, end='')\n break", "dic = {}\nsenha = input()\nres = ''\nfor i in range(10):\n dic[input()] = str(i)\nfor i in range(10,90,10):\n res += dic[senha[i-10:i]]\nprint(res)", "n=input()\r\nlst=[]\r\nlst1=[]\r\nn1=n[:10]\r\nlst.append(n1)\r\nn2=n[10:20]\r\nlst.append(n2)\r\nn3=n[20:30]\r\nlst.append(n3)\r\nn4=n[30:40]\r\nlst.append(n4)\r\nn5=n[40:50]\r\nlst.append(n5)\r\nn6=n[50:60]\r\nlst.append(n6)\r\nn7=n[60:70]\r\nlst.append(n7)\r\nn8=n[70:]\r\nlst.append(n8)\r\nfor i in range(10):\r\n s=input()\r\n lst1.append(str(i)+' '+s)\r\nfor j in lst:\r\n for k in lst1:\r\n if(j in k):\r\n print(k[0],end='')", "from collections import defaultdict, deque, Counter, OrderedDict\r\n#import sys, threading\r\ndef main():\r\n s = input()\r\n d = defaultdict(int)\r\n for i in range(10):\r\n d[input()] = i\r\n ans = \"\"\r\n for i in range(0,80,10):\r\n ans += str(d[s[i:i+10]])\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(200000)\r\n threading.stack_size(10240000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\"\"\"\r\n main()", "a=input().strip()\r\nk=[input().strip() for i in range(10)]\r\nfor i in range(0,len(a),10):\r\n\to=a[i:i+10]\r\n\tprint(k.index(o),end=\"\")\r\n", "n = input()\r\ndict={}\r\n\r\nfor i in range(10):\r\n x = int(input())\r\n dict[x] = i\r\n\r\nfor i in range(0,len(n),10):\r\n print(dict[int(n[i:i+10])], end='')", "s = input()\r\narr =[input() for i in range(10)]\r\nrs = \"\"\r\nfor i in range(0,80,10): rs+=str(arr.index(s[i:i+10]))\r\nprint(rs)", "\r\ndef pars(_str):\r\n pars_list = []\r\n for i in range(0,80,10):\r\n pars_list.append(_str[i:i+10])\r\n return pars_list\r\n\r\ndef recover(_str,_list):\r\n password = ''\r\n for i in _str:\r\n if i in _list:\r\n password += str(_list.index(i))\r\n return password\r\n\r\n_str = input()\r\n_list = []\r\nfor i in range(10):\r\n _list.append(input())\r\n_str = pars(_str)\r\nprint(recover(_str,_list))\r\n", "s,arr,r = input(), [input() for i in range(10)], \"\"\r\nfor i in range(0,80,10): r+=str(arr.index(s[i:i+10]))\r\nprint(r)", "n=input()\r\narr=[]\r\nfor i in range(10):\r\n arr.append(input())\r\n\r\nfor i in range(9):\r\n te=n[i*10:i*10+10]\r\n for j in range(len(arr)):\r\n if(arr[j]==te):\r\n print(j,end='')\r\n break\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\ns = input()[:-1]\r\ng = [input()[:-1] for _ in range(10)]\r\nd = []\r\nfor i in range(8):\r\n d += [s[i*10:(i+1)*10]]\r\nfor i in d:\r\n for j in range(10):\r\n if g[j] == i:\r\n print(j, end='')", "s = input()\ncode = []\nfor i in range(10):\n\tcode.append(input())\nans = ''\nfor i in range(0, len(s), 10):\n\tans += str(code.index(s[i: i + 10]))\nprint(ans)\n", "s=input()\r\nfull=[]\r\norgin=[]\r\nout=[]\r\nfor i in range(8):\r\n temp = []\r\n for j in range(10):\r\n temp.append(s[i*10+j])\r\n full.append(''.join(temp))\r\n\r\nfor i in range(10):\r\n orgin.append(input())\r\n\r\nfor i in range(8):\r\n for j in range(10):\r\n if full[i]==orgin[j]:\r\n out.append(str(j))\r\n break\r\n\r\nprint(''.join(out))", "s = input()\nm = {input(): str(i) for i in range(10)}\nres = \"\".join(m[s[i : i + 10]] for i in range(0, len(s), 10))\nprint(res)\n", "b=input()\r\nl=[]\r\nfor i in range (10):\r\n x=input()\r\n l.append(x)\r\ns='' \r\ni=0\r\nwhile i<(len(b)):\r\n if (b[i:i+10] in l)==True:\r\n s+=str(l.index(b[i:i+10]))\r\n i+=10\r\n else :\r\n i+=1\r\nprint(s) ", "senha = input()\nchave = [input() for i in range(10)]\nans = []\nfor i in range(8):\n\ttrecho = senha[10*i:10*(i+1)]\n\tindex = chave.index(trecho)\n\tprint(index, end='')\nprint()\n", "n = input()\r\n\r\nnumbers = {}\r\n\r\nfor i in range(10):\r\n x = input()\r\n numbers[x] = i\r\nres = []\r\nfor i in range(8):\r\n p = n[i*10 : (i*10)+10 ]\r\n #print(p)\r\n if p in numbers:\r\n res.append(numbers[p])\r\n\r\nfor i in res:\r\n print(i,end=\"\")\r\n\r\n\r\n \r\n", "inp=input()\r\ninp_list=[]\r\nfor i in range(8):\r\n inp_list.append(inp[i*10:i*10+10])\r\ndec_list=[]\r\nfor i in range(10):\r\n dec_list.append(input())\r\n\r\nout=[]\r\nans=\"\"\r\nfor i in range(8):\r\n out.append(dec_list.index(inp_list[i]))\r\n\r\nfor i in range(8):\r\n ans+=str(out[i])\r\nprint(ans)\r\n \r\n", "s = input()\r\nmp = dict()\r\nfor i in range(10):\r\n x = input()\r\n mp[x]=i\r\n#print(mp)\r\nfor i in range(0,80,10):\r\n print(mp[s[i:i+10]],end='')", "s=input();d={}\r\nfor i in range(10):\r\n code=input()\r\n d[code]=i\r\nres=''\r\nfor i in range(0,80,10):\r\n res += str(d[s[i:i+10]])\r\nprint(res)", "string = input()\r\nnew_string = []\r\n\r\nfor i in range(10):\r\n\tnew_string.append(string[i * 10: i * 10 + 10])\r\n\r\ny = []\r\n\r\nfor i in range(10):\r\n\ty.append(input())\r\n\r\nfor i in range(len(new_string)):\r\n\tfor e in range(len(new_string)):\r\n\t\tif y[e] in new_string[i]:\r\n\t\t\tprint(e, end = \"\")", "storedpass,number,realpass = input(), [input() for i in range(10)], \"\"\r\nfor i in range(0,80,10): realpass+=str(number.index(storedpass[i:i+10]))\r\nprint(realpass)", "num_codes = 10\nnum_digits_in_password = 8\n\ninput_str = input()\ncodes = []\nfor i in range(num_codes):\n\tcodes.append(input())\nfor i in range(num_digits_in_password):\n\tprint(codes.index(input_str[i*num_codes:(i+1)*num_codes]), end='')\nprint('')\n", "def main():\n encrypted = input()\n decrypted = [''] * 8\n numbers = {}\n\n for i in range(10):\n numbers[input()] = i\n\n start = 0\n end = start + 10\n\n for i in range(8):\n decrypted[i] = str(numbers[encrypted[start:end]])\n start = end\n end += 10\n\n print(''.join(decrypted))\n\n\nif __name__ == '__main__':\n main()\n", "word = input()\r\nn = []\r\nfor i in range (10):\r\n\ta = input()\r\n\tn.append(a)\r\nfor i in range (8):\r\n\tbiner = word[10*i:10*(i+1)]\r\n\tfor j in range (10):\r\n\t\tif(biner == n[j]):\r\n\t\t\tprint (j, end = '')\r\n", "def main():\r\n\tm = input().strip()\r\n\tm = [m[x:x+10] for x in range(0, 80, 10)]\r\n\tn = []\r\n\tfor i in range(10):\r\n\t\tn.append(input().strip())\r\n\tfor i in m:\r\n\t\tfor index, j in enumerate(n):\r\n\t\t\tif j == i:\r\n\t\t\t\tprint(index, end=\"\")\r\n\t\t\t\t\r\nmain()", "def solv(s,l):\r\n rl = []\r\n for i in range(0,80,10):\r\n for j in range(10):\r\n if s[i:i+10]==l[j]:\r\n rl.append(j)\r\n break\r\n return ''.join(map(str,rl))\r\n\r\ns = input()\r\nl = [input() for _ in range(10)]\r\nprint(solv(s,l))\r\n", "password = input()\r\n\r\nnums = [0] * 10\r\n\r\nfor index in range(10) : nums[index] = input()\r\n\r\nfor index in range(0 , 80 , 10) :\r\n num = password[index:index + 10] \r\n print(nums.index(num) , end=\"\")", "string = input()\nval = []\nfor i in range(10):\n val.append(input())\n\nfor i in range(0,80,10):\n temp = string[i:i+10]\n for pos,j in enumerate(val):\n if temp == j:\n print(pos,end='')\n break\n\n \t\t \t\t\t \t\t\t \t\t\t \t\t\t\t\t \t \t", "X, Numbers = input(), {}\r\nfor i in range(10):\r\n Numbers[input()] = i\r\nfor i in range(8):\r\n print(Numbers[X[i * 10:(i + 1) * 10]], end=\"\")\r\n", "s=input()\r\np=[]\r\nfor i in range(10):\r\n p.append(input())\r\nresult=''\r\nfor i in range(8):\r\n for j in range(10):\r\n if s[i*10:i*10+10]==p[j]:\r\n result+=str(j)\r\n break\r\nprint(result)", "code = input()\r\nx = [code[0:10], code[10:20], code[20:30], code[30:40], code[40:50], code[50:60], code[60:70], code[70:80]]\r\na = []\r\nb = []\r\nfor i in range(10):\r\n a.append(input())\r\nfor j in range(len(x)):\r\n b.append(a.index(x[j]))\r\n\r\nprint(*b,sep=\"\")\r\n", "s = input()\r\na = input()\r\nb = input()\r\nc = input()\r\nd = input()\r\ne = input()\r\nf = input()\r\ng = input()\r\nh = input()\r\ni = input()\r\nj = input()\r\narr = [a, b, c, d, e, f, g, h, i, j]\r\nd = \"\"\r\npassword = \"\"\r\nfor k in range(0, len(s)):\r\n d+=s[k]\r\n if len(d) == 10:\r\n password += str(arr.index(d))\r\n d = \"\"\r\nprint(password)\r\n ", "s = str(input())\nd = {}\nfor i in range(10):\n k = str(input())\n d[k] = str(i)\nres = []\nfor i in range(8):\n t = s[i*10:i*10+10]\n res.append(d[t])\nprint(''.join(res))\n", "s=input()\r\nl1=[]\r\ni=0\r\nwhile i<8:\r\n targ = s[0+i*10:(i+1)*10]\r\n l1.append(targ)\r\n i+=1\r\nl2=[]\r\nfor x in range(10):\r\n l2.append(input())\r\ncout=\"\"\r\nfor x in l1:\r\n cout+=str(l2.index(x))\r\nprint(cout)\r\n", "coder = input()\r\ncode = list(coder)\r\nkeys = []\r\nfor i in range(10):\r\n keys.append(input())\r\nfor i in range(8):\r\n c = code[:10]\r\n for key in keys:\r\n if (list(key) == c): \r\n print(keys.index(key), end=\"\")\r\n break\r\n code[:10] = []\r\n", "bnrypswrd = input()\r\ndigits = []\r\nfor i in range(10):\r\n digits.append(input())\r\npswrd = [0,0,0,0,0,0,0,0]\r\nfor i in range (8):\r\n for j in range(10):\r\n if bnrypswrd[10*i:10*(i+1)] == digits[j]:\r\n pswrd[i] = j\r\nfor i in range(8):\r\n print(pswrd[i],end=\"\")", "s = input()\nl = [input() for i in range(10)]\nans = ''\nj = 0\nfor i in range(10,81,10):\n ss = s[j:i]\n ans += str(l.index(ss))\n j += 10\n\nprint(ans)\n\t\t \t\t\t\t\t\t\t \t\t \t\t\t\t\t\t\t \t\t", "s = [e.strip('\\n') for e in [*open(0)]]\r\nx = list(s[0])\r\nfor i in range(len(x)):\r\n if (i+1)%10 == 0 and i != 0:\r\n x[i] = x[i]+','\r\nx = ''.join(x)\r\nprint(''.join([str(s.index(e)-1) for e in x.split(',')[:-1]]))", "password = input()\r\ncrypt0 = input()\r\ncrypt1 = input()\r\ncrypt2 = input()\r\ncrypt3 = input()\r\ncrypt4 = input()\r\ncrypt5 = input()\r\ncrypt6 = input()\r\ncrypt7 = input()\r\ncrypt8 = input()\r\ncrypt9 = input()\r\nbits = list(password)\r\ncodes = [''.join(bits[0:10]), ''.join(bits[10:20]), ''.join(bits[20:30]), ''.join(bits[30:40]), ''.join(bits[40:50]), ''.join(bits[50:60]), ''.join(bits[60:70]), ''.join(bits[70:])]\r\ni = 0\r\nfor code in codes:\r\n if code == crypt0:\r\n codes[i] = '0'\r\n elif code == crypt1: \r\n codes[i] = '1'\r\n elif code == crypt2: \r\n codes[i] = '2'\r\n elif code == crypt3: \r\n codes[i] = '3'\r\n elif code == crypt4: \r\n codes[i] = '4'\r\n elif code == crypt5: \r\n codes[i] = '5'\r\n elif code == crypt6: \r\n codes[i] = '6'\r\n elif code == crypt7: \r\n codes[i] = '7'\r\n elif code == crypt8: \r\n codes[i] = '8'\r\n else: \r\n codes[i] = '9'\r\n i += 1\r\nprint(''.join(codes))", "s=input()\r\nlst=[]\r\nfor i in range(10):\r\n lst.append(input())\r\nres=''\r\nfor i in range(0,80,10):\r\n res+=str(lst.index(s[i:i+10]))\r\nprint(res)", "binary = input()\r\nlist = []\r\nstring = \"\"\r\nlist3 = []\r\n\r\nfor i in range(10):\r\n list.append(input())\r\n\r\nlist2 = [binary[i:i+10] for i in range(0, len(binary), 10)]\r\n\r\nfor i in range(len(list2)):\r\n num = str(list.index(list2[i]))\r\n list3.append(num)\r\n\r\nprint(string.join(list3))\r\n", "s=input()\r\nd=dict()\r\nfor i in range(10):\r\n d[input()]=i\r\nfor i in range(0,len(s),10):\r\n print(d[s[i:i+10]],end=\"\")\r\nprint()", "import textwrap as tw\r\n\r\np = input()\r\nd = list()\r\nd.extend(input() for _ in range(10))\r\n\r\np = tw.wrap(p, width=10)\r\n\r\nfor dg in (d.index(i) for i in p):\r\n print(dg, end='')", "account = input()\r\ncodes = []\r\nfor _ in range(10):\r\n codes.append(input())\r\nans = ''\r\nfor i in range(8):\r\n digit = codes.index(account[(10 * i):(10 * (i + 1))])\r\n print(digit, end='')", "s = input()\r\nstrn = ''\r\narr = []\r\nfor i in range(0,71,10):\r\n arr.append(s[i:i+10])\r\narrn = []\r\nfor i in range(10):\r\n arrn.append(input())\r\nfor i in arr:\r\n for j in range(10):\r\n if i==arrn[j]:\r\n strn += str(j)\r\nprint(strn)", "ch= input()\r\nch0=input()\r\nch1=input()\r\nch2=input()\r\nch3=input()\r\nch4=input()\r\nch5=input()\r\nch6=input()\r\nch7=input()\r\nch8=input()\r\nch9=input()\r\nL=[ch0,ch1,ch2,ch3,ch4,ch5,ch6,ch7,ch8,ch9]\r\n\r\nx=\"\"\r\npassword=\"\"\r\ni=0\r\nwhile i<(len(ch)):\r\n x= ch[i:i+10]\r\n password=password + str(L.index(x))\r\n i=i+10\r\n \r\nprint(password)\r\n", "s = input()\r\ndic = dict()\r\nfor i in range(10):\r\n dic[input()] = str(i)\r\nfor i in range(8):\r\n print(dic.get(s[10*i:10*i+10]), end = \"\")\r\n", "p = input()\r\nl = []\r\nfor k in range(0,80,10):\r\n l.append(p[k:k+10])\r\nc = []\r\nfor j in range(10):\r\n c.append(input())\r\ns = ''\r\nfor h in l:\r\n s += str(c.index(h))\r\nprint(s)", "def readln(): return tuple(map(int, input().split()))\n\ns = input()\nm = {input():i for i in range(10)}\nfor i in range(8):\n print(m[s[i*10:(i + 1)*10]], end='')\nprint()\n", "s = input()\nl = [input() for i in range(10)]\nfor i in range(0, 80, 10):\n print(l.index(s[i:i + 10]), end=\"\")\n\n \t \t\t\t\t \t\t \t \t \t \t \t", "n=input()\nmap1={}\nfor i in range (0,10):\n x=input()\n map1[x]=i\n\nstr1=\"\"\nfor j in range (0,80,10):\n sub=n[j:j+10]\n str1+=str(map1[sub])\n\n\nprint (str1)\n \n", "def main():\n s = input()\n l = []\n for i in range(10):\n l.append(input())\n ret = \"\"\n i = 0\n while i < 80:\n for j in range(10):\n if l[j] == s[i:i+10]:\n ret += str(j)\n i += 10\n break\n return ret\n\nprint(main())\n", "s = input()\r\n\r\ndigit = []\r\nfor i in range(10):\r\n digit.append(input())\r\n \r\nans = ''\r\n\r\nfor i in range(8):\r\n dig = digit.index(s[10*i:10*(i+1)])\r\n ans += str(dig)\r\n\r\nprint(ans)", "a = input()\r\nm = {}\r\nfor i in range(10):\r\n m[input()] = str(i)\r\ns = ''\r\nfor j in range(8):\r\n s += m[a[j*10:(j+1)*10]]\r\nprint(s)", "s=input();n=[];x=1;y=''\nfor i in range(0,10):\n n.append(input())\nfor j in range(0,8):\n for k in range(0,10):\n y=y+s[j*10+k]\n for l in range(0,10):\n if n[l]==y:\n print(l,end='')\n y=''\nprint('')", "from sys import stdin; inp = stdin.readline\r\nfrom math import dist, ceil, floor, sqrt, log\r\nfrom collections import defaultdict, Counter\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return inp().split()\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef P(x): return print(x)\r\ndef O(l:list): return ' '.join(map(str, l))\r\n\r\ndef main():\r\n p = S()\r\n n = len(p)\r\n d = {}\r\n for i in range(10):\r\n d[S()] = str(i)\r\n res = ''\r\n for i in range(10, n+1, 10):\r\n dig = p[i-10:i]\r\n res += d[dig]\r\n return res\r\n\r\nif __name__ == '__main__':\r\n print(main())", "c = input()\r\nd = []\r\nfor j in range(10):\r\n d.append(input())\r\nfor i in range(8):\r\n for j in range(10):\r\n if c[i * 10:(i + 1) * 10] == d[j]:\r\n print(j, end='')", "n = input()\r\na_dict = {}\r\nfor i in range(10):\r\n a_dict[input()] = str(i)\r\nans = ''\r\nfor j in range(8):\r\n ans += a_dict[n[10*j:10*(j+1)]]\r\nprint(ans)", "s=input()\r\n\r\nl=[input() for i in range(10)]\r\n\r\na=''\r\n\r\nfor i in range(8):\r\n\tfor j in range(10):\r\n\t\tt=s[10*i:10*(i+1)]\r\n\t\tif(l[j]== t):\r\n\t\t\ta+=str(j)\r\n\t\t\tbreak\r\n\r\n\r\nprint(a)\r\n", "\nfull = input()\nbi = [input() for i in range(10)]\npassword = ''\nj = 0\nfor i in range(10,81,10):\n index = full[j:i]\n password += str(bi.index(index))\n j += 10\n\nprint(password)\n \t \t \t \t \t \t\t \t \t \t", "arr=[]\ncount=0\nrst=''\nstr_to=''\nx=input()\nfor i in range(10):\n arr.append(input())\nfor i in range(len(x)):\n count+=1\n str_to+=x[i]\n if count==10:\n for j in range(len(arr)):\n if str_to==arr[j]:\n count=0\n rst+=str(j)\n str_to=''\nprint(rst)\n \t\t \t\t \t\t \t \t\t \t \t\t \t\t", "\ns = input()\ncodes = []\nres=''\n\nfor i in range(10):\n codes.append(input())\n\nfor i in range(8):\n for idx,code in enumerate(codes):\n if code == s[i*10:(i*10)+10]:\n res+=str(idx)\n break\n\nprint(res)\n\n\n\n\n\n", "s=input()\r\na=[ ]\r\nfor i in range(10):\r\n k=input()\r\n a.append(k)\r\nfor i in range(0,8):\r\n print(a.index(s[i*10:(i+1)*10]),end='')", "s = input()\r\na = []\r\nj = 0\r\nfor i in range(10, 81, 10):\r\n a.append(s[j:i])\r\n j = i\r\np = ''\r\nv = []\r\nfor _ in range(10):\r\n v.append(input())\r\nfor i in range(8):\r\n p += str(v.index(a[i]))\r\nprint(p)", "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\ns = input().rstrip()\r\na = [input().rstrip() for _ in range(10)]\r\nans = []\r\nfor i in range(8):\r\n for j in range(10):\r\n if s[i * 10:(i + 1) * 10] == a[j]:\r\n ans.append(j)\r\n break\r\n\r\nprint(*ans, sep='')\r\n", "code, digits, res = input(), [input() for _ in range(10)], \"\"\nfor i in range(0, 80, 10): res += str(digits.index(code[i:i+10]))\nprint(res)\n", "a=input()\r\nb=[input() for _ in range(10)]\r\nwhile a:\r\n for i in range(10):\r\n if a.startswith(b[i]):\r\n a=a[10:]\r\n print(i,end=\"\")", "s=input()\r\nx={}\r\nfor i in range(10):\r\n w=input()\r\n x[w]=str(i)\r\nans=''\r\nfor i in range(0,80,10):\r\n ans+=x[s[i:i+10]]\r\nprint(ans)", "key = input()\r\npw = [input() for i in range(10)]\r\nanswerstr = ''\r\nfor i in range(0,80,10):\r\n answerstr += str(pw.index(key[i:i+10]))\r\nprint(answerstr)", "code = input()\r\ndigit = list()\r\nfor i in range(10):\r\n digit.append(input())\r\n\r\nresult=str()\r\nfor i in range(0,len(code),10):\r\n result += str(digit.index(code[i:i+10]))\r\n\r\nprint(result)", "i = str(input())\ndef wrap(s, w):\n return [s[i:i + w] for i in range(0, len(s), w)]\ntab = wrap(i, 10)\ntab2 = []\nfor i in range(10):\n tt = input()\n tab2.append([tt, i])\nresult = []\nfor i in tab:\n for j in tab2:\n if i == j[0]:\n result.append(j[1])\nfor i in result:\n print (i, end='')\nprint()", "n = input()\r\nl = []\r\nfor i in range(10):\r\n\tl.append(input())\r\nk = ''\r\nfor i in range(0,80,10):\r\n\tq = n[i:i+10]\r\n\tfor j in range(10):\r\n\t\tif q == l[j]:\r\n\t\t\tk+=str(j)\r\n\t\t\tbreak\r\nprint(k)\r\n\t\t\t\r\n", "try :\r\n a =input()\r\n i =0 ; j=int(i+10)\r\n dictt = {}\r\n for _ in range(10):\r\n dictt[input()]=i\r\n i+=1\r\n i = 0\r\n j = 10\r\n for w in range(10):\r\n print(dictt[a[i:i+10]],end=\"\")\r\n i+=10\r\nexcept :\r\n pass\r\n", "s = input()\r\nn = list()\r\nresult = \"\"\r\nfor i in range(10):\r\n\tn.append(input())\r\ni = 0\r\nwhile i!=80:\r\n\tif s[i:i+10] in n:\r\n\t\tresult+=str(n.index(s[i:i+10]))\r\n\t\ti+=10\r\nprint(result)", "s = input()\r\nlst = []\r\nfor i in range(10):\r\n lst.append(input())\r\n\r\nfor i in range(0, 80, 10):\r\n si = s[i:i+10]\r\n print(lst.index(si), end=\"\")\r\n", "test = input()\r\n\r\nnum0 = input()\r\nnum1 = input()\r\nnum2 = input()\r\nnum3 = input()\r\nnum4 = input()\r\nnum5 = input()\r\nnum6 = input()\r\nnum7 = input()\r\nnum8 = input()\r\nnum9 = input()\r\n\r\noutput = \"\"\r\n\r\nfor x in range(8):\r\n \r\n \r\n \r\n numx = x*10\r\n numx1 = numx + 10\r\n \r\n \r\n if test[numx:numx1] == num0:\r\n output += \"0\"\r\n elif test[numx:numx1] == num1:\r\n output += \"1\"\r\n elif test[numx:numx1] == num2:\r\n output += \"2\"\r\n elif test[numx:numx1] == num3:\r\n output += \"3\"\r\n elif test[numx:numx1] == num4:\r\n output += \"4\"\r\n elif test[numx:numx1] == num5:\r\n output += \"5\"\r\n elif test[numx:numx1] == num6:\r\n output += \"6\"\r\n elif test[numx:numx1] == num7:\r\n output += \"7\"\r\n elif test[numx:numx1] == num8:\r\n output += \"8\"\r\n else:\r\n output +=\"9\"\r\n \r\n \r\nprint(output)", "def main():\r\n enc_password = input()\r\n enc_to_str = {}\r\n\r\n for i in range(10):\r\n enc = input()\r\n enc_to_str[enc] = str(i)\r\n\r\n length = len(enc_password)\r\n chunks = [enc_password[i:i + 10] for i in range(0, length, 10)]\r\n\r\n result = ''.join(enc_to_str[c] for c in chunks)\r\n print(result)\r\n\r\n\r\nmain()\r\n", "password = input()\r\ndigits = [input() for p in range(10)]\r\nsolve = ''\r\nfor i in range(0, 80, 10):\r\n solve += str(digits.index(password[i:i+10]))\r\nprint(solve)\r\n", "s=input()\r\nenc=dict({str(input()):i for i in range(10)})\r\nfor i in range(0,80,10):\r\n print(enc[s[i:(10+i)]],end='')", "def main():\r\n s = input()\r\n a = {}\r\n for i in range(10):\r\n a[input()] = i\r\n for i in range(1,9):\r\n print(a[s[10*(i-1):10*i]],end='')\r\n\r\nmain()\r\n\r\n", "def main():\r\n d = defaultdict(int)\r\n n = input()\r\n for i in range(10):\r\n d[input()] = i\r\n for i in range(8):\r\n print(d[n[i * 10:i * 10 + 10]], end='')\r\n\r\nfrom sys import *\r\nimport inspect\r\nimport re\r\nfrom math import *\r\nimport threading\r\nfrom collections import *\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 10**5\r\n\r\n\r\ndef lie():\r\n return int(input())\r\n\r\n\r\ndef liee():\r\n return map(int, input().split())\r\n\r\n\r\ndef array():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef deb(p):\r\n for line in inspect.getframeinfo(inspect.currentframe().f_back)[3]:\r\n m = re.search(r'\\bdeb\\s*\\(\\s*([A-Za-z_][A-Za-z0-9_]*)\\s*\\)', line)\r\n print('%s %s' % (m.group(1), str(p)))\r\n\r\n\r\ndef vec(size, val=0):\r\n vec = [val for i in range(size)]\r\n return vec\r\n\r\n\r\ndef mat(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\ndef dmain():\r\n setrecursionlimit(100000000)\r\n threading.stack_size(40960000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\r\n\r\n\r\nif __name__ == '__main__':\r\n # main()\r\n dmain()\r\n", "password = input()\r\nnumbers = {}\r\n\r\nfor i in range(10):\r\n numbers[input()] = i\r\n\r\nfor i in range(1, 9):\r\n print(numbers[password[(i - 1) * 10 : i * 10]], end=\"\")", "s=input()\r\ndecode={}\r\nfor x in range(10):\r\n\tdecode[input()]=x\r\ntemp=\"\"\r\npassword=[]\r\nfor x in range(1,81):\r\n\ttemp+=s[x-1]\r\n\tif x%10==0:\r\n\t\tpassword.append(temp)\r\n\t\ttemp=\"\"\r\nfor x in password:\r\n\tprint(decode[x],end=\"\")", "s=input()\r\na=[]\r\nfor i in range(10):\r\n b=input()\r\n a.append(b)\r\nfor j in range (0,80,10):\r\n string=s[j:j+10]\r\n x=a.index(string)\r\n print(x,end='')\r\n ", "s=str(input());a=[];t=''\r\nfor i in range(10):\r\n a.append(str(input()))\r\nfor i in range(0,80,10):\r\n p=s[i:i+10]\r\n for j in range(10):\r\n if a[j]==p:\r\n t+=str(j)\r\n break\r\nprint(t)\r\n", "s = input()\r\nm = {input(): str(i) for i in range(10)}\r\nres = \"\"\r\nfor i in range(0, len(s), 10):\r\n substring = s[i : i + 10]\r\n res += m[substring]\r\nprint(res)\r\n", "v = input()\r\nnum0 = input()\r\nnum1 = input()\r\nnum2 = input()\r\nnum3 = input()\r\nnum4 = input()\r\nnum5 = input()\r\nnum6 = input()\r\nnum7 = input()\r\nnum8 = input()\r\nnum9 = input()\r\nk=''\r\nfor i in range(0,len(v),10):\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num0:\r\n k+='0'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num1:\r\n k+='1'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num2:\r\n k+='2'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num3:\r\n k+='3'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num4:\r\n k+='4'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num5:\r\n k+='5'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num6:\r\n k+='6'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num7:\r\n k+='7'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num8:\r\n k+='8'\r\n continue\r\n if v[i]+v[i+1]+v[i+2]+v[i+3]+v[i+4]+v[i+5]+v[i+6]+v[i+7]+v[i+8]+v[i+9] == num9:\r\n k+='9'\r\n continue\r\nprint(k)", "binary = input()\r\nh = {}\r\nfor i in range(10):\r\n h[input()] = str(i)\r\nres = \"\"\r\nfor i in range(0, 80, 10):\r\n res += h[binary[i:i+10]]\r\nprint(res)", "import re\r\ncode=input()\r\nd={}\r\nfor i in range(10):\r\n d[i]=input()\r\nj=0\r\nk=10\r\nl=list(d.items())\r\nv=list(d.values())\r\nans=''\r\nfor i in range(8):\r\n x=code[j:k]\r\n a=v.index(x)\r\n ans+=str(l[a][0])\r\n j=k\r\n k=k+10\r\nprint(ans) \r\n \r\n \r\n \r\n \r\n \r\n", "\n\n# import sys\n# sys.stdin = open('input.txt', 'r')\n\n\ndef solve():\n s = input()\n hm = {}\n \n for i in range(10):\n a = input()\n hm[a] = str(i)\n\n ans = \"\"\n i = 0\n n = len(s)\n while i < n:\n ans += hm[s[i:i+10]]\n i += 10\n \n print(ans)\n\n\n\nsolve() ", "def solve(s, d):\n res = ''\n for i in range(0,len(s), 10):\n res += str(d[s[i:i+10]])\n return res\n \n \n\n\n\n\n \n\n \ndef main() :\n # s = input()\n # n = int(input())\n # arr = list(map(int, input().split(' ')))\n s = input()\n # res=''\n d = {}\n for i in range(10):\n n = input()\n d[n] = i\n print(solve(s, d))\nmain()\n", "s=input()\r\nl1=[]\r\nfor i in range(0,10):\r\n l1.append(input())\r\nfor i in range(0,8):\r\n print(l1.index(s[i*10:(i+1)*10]),end=\"\")", "\r\n\r\ndef main_function():\r\n s = input()\r\n codes = [input() for i in range(10)]\r\n real_code = \"\"\r\n for i in range(8):\r\n binary_code = s[i * 10:(i + 1) * 10]\r\n for j in range(len(codes)):\r\n if codes[j] == binary_code:\r\n real_code += str(j)\r\n return real_code\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "# Read the encrypted binary code\r\nencrypted_code = input()\r\n\r\n# Read the binary codes for numbers 0 to 9\r\nbinary_codes = [input() for _ in range(10)]\r\n\r\n# Create a dictionary to map binary codes to digits\r\nbinary_to_digit = {binary_code: str(i) for i, binary_code in enumerate(binary_codes)}\r\n\r\n# Decrypt the password\r\npassword = ''.join(binary_to_digit[encrypted_code[i:i+10]] for i in range(0, 80, 10))\r\n\r\n# Print the decrypted password\r\nprint(password)", "codes = {}\ncode = input()\nans = \"\"\n\nfor i in range(10):\n codes[input()] = i\n\nfor j in range(0, len(code), 10):\n ans += str(codes[code[j:j+10]])\n\nprint(ans)", "code = input()\r\nans = ''\r\nnums = []\r\nfor i in range(10):\r\n nums.append(input())\r\nfor i in range(0,80,10):\r\n ans += str(nums.index(code[i:i+10]))\r\nprint(ans)", "code = input()\r\nx = []\r\na = []\r\nb = []\r\n\r\nfor k in range(0, 80, 10):\r\n x.append(code[k:k+10])\r\nfor i in range(10):\r\n a.append(input())\r\nfor j in range(len(x)):\r\n b.append(a.index(x[j]))\r\n\r\nprint(*b,sep=\"\")\r\n", "import math\r\nimport sys\r\nimport re\r\n\r\nn = input()\r\nl = [n[:10] , n[10:20] , n[20:30] , n[30:40] , n[40:50] , n[50:60] , n[60:70] , n[70:80]]\r\ns = ''\r\nl1 = []\r\nfor x in range(10):\r\n a = input()\r\n l1.append(a)\r\nfor y in l:\r\n s = s + str(l1.index(y))\r\nprint(s)", "if __name__==\"__main__\":\r\n st80=input()\r\n st_10=[]\r\n dic={}\r\n for i in range(10):\r\n el=input()\r\n st_10.append(el)\r\n for i in range(10):\r\n dic.setdefault(st_10[i],i)\r\n ans=\"\"\r\n parts=[]\r\n for i in range(0,len(st80),10):\r\n el=st80[i:i+10]\r\n parts.append(el)\r\n for i in parts:\r\n ans=ans+str(dic[i])\r\n print(ans)\r\n\r\n\r\n\r\n", "import re\r\n\r\npassword = input()\r\ncodes = {}\r\n\r\nfor i in range(0, 10):\r\n code = input()\r\n codes[code]= i\r\n\r\norigPassword = \"\"\r\n\r\nwhile len(origPassword) < 8:\r\n for code in codes:\r\n if re.search(\"^\"+code, password):\r\n origPassword += str(codes[code])\r\n password = password[10:]\r\n\r\nprint(origPassword)", "s = input()\r\nd = {}\r\n\r\nfor i in range(10):\r\n d[input()] = i\r\n\r\nfor i in range(8):\r\n cur = s[:10]\r\n s = s[10:]\r\n print(d[cur], end = \"\")\r\n", "#codeforces 94A\r\na=input()\r\nb=[]\r\nc=''\r\nfor i in range(10):\r\n b.append(input())\r\nfor j in range(1,9):\r\n for i in range(10):\r\n if a[(j-1)*10:(j*10)]== b[i]:\r\n c+=str(i)\r\n break\r\n\r\nprint(c)", "cc = list(input())\r\nz = str(input())\r\na = str(input())\r\nb = str(input())\r\nc = str(input())\r\nd = str(input())\r\ne = str(input())\r\nf = str(input())\r\ng = str(input())\r\nh = str(input())\r\ni = str(input())\r\np = []\r\nfor x in range(0, 9):\r\n if ''.join([str(elem) for elem in cc[:10]]) == z:\r\n p.append(0)\r\n cc = cc[10:]\r\n if ''.join([str(elem) for elem in cc[:10]]) == a:\r\n p.append(1)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == b:\r\n p.append(2)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == c:\r\n p.append(3)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == d:\r\n p.append(4)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == e:\r\n p.append(5)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == f:\r\n p.append(6)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == g:\r\n p.append(7)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == h:\r\n p.append(8)\r\n cc = cc[10:]\r\n elif ''.join([str(elem) for elem in cc[:10]]) == i:\r\n p.append(9)\r\n cc = cc[10:]\r\nprint(''.join([str(elem) for elem in p]))", "s=input()\nd={}\nfor i in range(10):\n d[input()]=i\ntemp=0\n# print(d)\n# print(d['0100110000'])\nans=\"\"\nwhile temp != 80:\n # ans += str(d[s[temp:temp+8]])\n # print(s[temp:temp+10])\n print(d[s[temp:temp+10]],end=\"\")\n temp += 10", "s = input()\r\nl = []\r\nfor i in range(10):\r\n\tl+=[input()]\r\ni = 0\r\nwhile i<80:\r\n\tprint(l.index(s[i:i+10]),end='')\r\n\ti+=10\r\n", "s=input()\nl=[]\nfor i in range(10):\n l.append(input())\np=\"\"\nfor j in range(8):\n y=s[10*j:10*j+10]\n a=l.index(y)\n p+=str(a)\n\nprint(p)\n \n", "s = input()\r\nl = list()\r\nfor i in range(10):\r\n l.append(input())\r\nfor i in range(0,80,10):\r\n for j in range(10):\r\n if(s[i:i+10] == l[j]):\r\n print(j,end=\"\")\r\n\r\n", "# LUOGU_RID: 113733671\na=input();b={}\nfor i in range(10):b[input()]=i\nfor i in range(8):print(b[a[i*10:i*10+10]],end=\"\")", "s=input()\r\na=[]\r\nfor i in range(0,10):\r\n a.append(input())\r\nfor i in range(0,8):\r\n print(a.index(s[i*10:(i+1)*10]),end=\"\")", "#!/usr/bin/python3\n\ns = input()\n\nd = dict()\nfor i in range(10):\n t = input()\n d[t] = i\n\nans = []\nfor i in range(8):\n ans.append(d[s[10 * i:10 * i + 10]])\n\nprint(\"\".join(map(str, ans)))\n", "word=str(input())\r\nalist=[]\r\nfor i in range(10):\r\n num=str(input())\r\n alist.append(num)\r\n\r\nj=0\r\nblist=[]\r\nfor j in range(0,80,10):\r\n m=alist.index(word[j:j+10])\r\n \r\n blist.append(str(m))\r\nprint(\"\".join(blist))", "a = input()\r\nnumbers = []\r\nfor i in range(10):\r\n numbers.append(input())\r\n\r\nres = \"\"\r\nfor i in range(0, len(a), 10):\r\n k = a[i:i+10]\r\n for idx, num in enumerate(numbers):\r\n if(k == num):\r\n res += str(idx)\r\nprint(res)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndata = input().rstrip()\r\nmemo = [input().rstrip() for _ in range(10)]\r\n\r\nfor i in range(0, 71, 10):\r\n tmp = memo.index(data[i:i + 10])\r\n print(tmp, end='')\r\n", "n=input()\r\ndict={}\r\nb=0\r\nfor a in range(10):\r\n c=input()\r\n dict[c]=b\r\n b+=1\r\n \r\na=10\r\nb=0\r\nlist=[]\r\nwhile a<=80:\r\n q=n[b:a]\r\n b+=10\r\n a+=10\r\n list.append(str(dict[q]))\r\n \r\ns=''.join(list)\r\nprint(s) \r\n \r\n \r\n \r\n ", "n=input()\r\nn=list(n)\r\nstr=\"\"\r\nz=[]\r\nfor i in range(0,10):\r\n x=input()\r\n z.append(x)\r\nj=0\r\nwhile j<80:\r\n m=0\r\n y=\"\"\r\n for i in range(j,j+10):\r\n y=y+n[i]\r\n for k in range(0,10):\r\n if y==z[k]:\r\n print(k,end=\"\")\r\n break\r\n j=j+10", "# https://codeforces.com/problemset/problem/94/A\n# 900\n\ne = input()\n\nd = {}\nfor i in range(10):\n k = input()\n d[k] = str(i)\n\nn = 0\nk = \"\"\np = \"\"\nfor c in e:\n if n == 10:\n p += d[k]\n k = \"\"\n n = 0\n\n k += c\n n += 1\n\np += d[k]\nprint(p)", "\r\nst = input()\r\nl = []\r\nfor _ in range(10):\r\n\tl.append(input())\r\n\r\n\r\nans = ''\r\nfor i in range(0, 80, 10):\r\n\tans += str(l.index(st[i : i + 10]))\r\n\r\nprint(ans)\r\n", "x = input()\r\ncrack = dict()\r\nfor i in range(10):\r\n code = input()\r\n crack[int(code, 2)] = i\r\nhas = []\r\nfor i in range(8):\r\n code = x[10*i:10*i+10]\r\n code = int(code, 2)\r\n has.append(str(crack[code]))\r\n\r\nprint(''.join(has))\r\n", "code=(lambda s:[s[i*10:(i+1)*10] for i in range(8)])(input())\r\nc2d=dict((input(),str(i)) for i in range(10))\r\nprint(''.join(map(lambda x:c2d[x],code)))\r\n", "binary_input = input()\r\nrepresent_0 = input()\r\nrepresent_1 = input()\r\nrepresent_2 = input()\r\nrepresent_3 = input()\r\nrepresent_4 = input()\r\nrepresent_5 = input()\r\nrepresent_6 = input()\r\nrepresent_7 = input()\r\nrepresent_8 = input()\r\nrepresent_9 = input()\r\n\r\npassword = ''\r\nten_digit_start = 0\r\nten_digit_stop = 10\r\n\r\nfor i in range(0, 8):\r\n word = binary_input[ten_digit_start:ten_digit_stop]\r\n if word == represent_0:\r\n password += '0'\r\n elif word == represent_1:\r\n password += '1'\r\n elif word == represent_2:\r\n password += '2'\r\n elif word == represent_3:\r\n password += '3'\r\n elif word == represent_4:\r\n password += '4'\r\n elif word == represent_5:\r\n password += '5'\r\n elif word == represent_6:\r\n password += '6'\r\n elif word == represent_7:\r\n password += '7'\r\n elif word == represent_8:\r\n password += '8'\r\n elif word == represent_9:\r\n password += '9'\r\n ten_digit_start += 10\r\n ten_digit_stop += 10\r\n\r\nprint(password)\r\n", "s = input()\r\n\r\narr = []\r\nres = ''\r\n\r\nfor i in range(10):\r\n p = input()\r\n arr.append(p)\r\n\r\nfor i in range(8):\r\n res += str(arr.index(s[i*10:(i + 1) * 10]))\r\n\r\nprint(res)\r\n", "binary_code = input().strip()\r\ndigit_codes = []\r\nfor i in range(10):\r\n digit_codes.append(input().strip())\r\n\r\n# Split the binary code into groups of 10 characters\r\ncode_groups = [binary_code[i:i+10] for i in range(0, 80, 10)]\r\n\r\n# Find the corresponding digits for each code group\r\ndigits = ''\r\nfor group in code_groups:\r\n for i in range(10):\r\n if group == digit_codes[i]:\r\n digits += str(i)\r\n break\r\n\r\n# Output the password\r\nprint(digits)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nx = list(input().rstrip())\r\nd = dict()\r\nfor i in range(10):\r\n s = input().rstrip()\r\n d[s] = str(i)\r\nans = []\r\nfor i in range(8):\r\n ans.append(d[\"\".join(x[(10 * i):(10 * (i + 1))])])\r\nprint(\"\".join(ans))", "s = input()\n\nnums = {}\nfor i in range(10):\n nums[input()] = str(i)\n\nres = ''\nfor i in range(0, 80, 10):\n res += nums[s[i:i + 10]]\n\nprint(res)\n", "kol=1\r\not=''\r\nd=[]\r\nl=input()+'*'\r\nfor i in list(l):\r\n if kol<10:\r\n kol+=1\r\n ot+=i\r\n else:\r\n kol=1\r\n ot+=i\r\n d.append(ot)\r\n ot=''\r\n\r\ns=[]\r\nfor i in range(10):\r\n s.append(input())\r\nfor i in d:\r\n print(s.index(i),end='')\r\n", "def main():\r\n go()\r\n \r\ndef go():\r\n enc_str = input('')\r\n ks, ans = [], []\r\n \r\n for x in range(10):\r\n ks.append(input(''))\r\n \r\n for i in range(8):\r\n ans.append(str(ks.index(enc_str[i*10:i*10+10])))\r\n \r\n print('{0}'.format( ''.join(ans) ))\r\n \r\nmain()", "inp = input(\"\")\r\nls = []\r\n\r\nbinaries = []\r\nfor i in range(0, 8):\r\n binaries.append(inp[i * 10:(i + 1) * 10])\r\n\r\nel = []\r\nresult = ''\r\nfor i in range(10):\r\n el.append(input(\"\"))\r\n\r\nfor i in range(8):\r\n if binaries[i] in el:\r\n result += str(el.index(binaries[i]))\r\n\r\nprint(result)\r\n", "n=input()\r\na=[]\r\nfor i in range(10):\r\n a.append(input())\r\ns=''\r\nfor i in range(8):\r\n for g in range(len(a)):\r\n if a[g]==n[10*i:10*(i+1)]:\r\n s+=str(g)\r\nprint(s)\r\n", "s=input()\r\nl={}\r\nfor i in range(10):\r\n x=input()\r\n l[x]=str(i)\r\nd=''\r\nfor i in range(8):\r\n d+=l[s[10*i:(i+1)*10]]\r\nprint(d)\r\n", "n = input()\r\nd = {}\r\nfor i in range(10):\r\n d[input()] = str(i)\r\np = ''\r\nfor i in range(8):\r\n b = n[:10]\r\n for j in d:\r\n if b == j:\r\n p += d.get(j)\r\n break\r\n else:\r\n continue\r\n n = n[10:]\r\nprint(p)\r\n\r\n", "\r\ninp = input()\r\n\r\nbins = {}\r\n\r\nfor i in range(10):\r\n bins[input()] = i\r\n\r\noriginal = \"\"\r\nfor i in range(0, 80, 10):\r\n \r\n original += str(bins[inp[i:(i + 10)]])\r\n\r\nprint(original)", "while(1):\r\n try:\r\n s=input()\r\n a=[]\r\n for i in range(0,10):\r\n a.append(input())\r\n i=0\r\n while i<80:\r\n ind=a.index(s[i:i+10])\r\n print(ind,end=\"\")\r\n i+=10\r\n print(\"\")\r\n except EOFError:\r\n break\r\n ", "code = input()\r\npassword = [code[i:i+10] for i in range(0, 80, 10)]\r\nconv_table = {input(): str(i) for i in range(10)}\r\nprint(''.join(conv_table[c] for c in password))", "encoded_string = input()\ndigits = {}\nfor i in range(10):\n digits[input()] = i\n\n\nresult = []\nfor i in range(0, 80, 10):\n cur_sub = encoded_string[i:i+10]\n result.append(digits[cur_sub])\n\nprint(''.join(str(x) for x in result))", "\nI0 = lambda :map(int,input().split())\nI1 = lambda :int(input())\nI2 = lambda :list(map(int,input().split()))\n#####################################################\ns = input()\na = list()\nstart = 0\nend = 10\nres = ''\nfor i in range(10):\n a.append(input())\nfor i in range(8):\n for j in range(10):\n if s[start:end] == a[j]:\n res+=str(j)\n break\n start = end\n end+=10\nprint(res)", "\r\n\"\"\"\r\ndef main():\r\n t = int(input())\r\n for _ in range(t):\r\n n,m = sep()\r\n a=list(sep())\r\n b=list(sep())\r\n ans=0\r\n a = sorted(a,reverse=True)\r\n for i in range(n):\r\n if a[i]>=i+1:\r\n ans+=b[i]\r\n else:\r\n ans+=b[a[i]-1]\r\n print(ans)\r\nif __name__ == '__main__':\r\n main()\r\n\"\"\"\r\n\r\n\"\"\"\r\ndef main():\r\n n=int(input())\r\n x = int(input())\r\n p=7-x\r\n for i in range(n):\r\n c = list(sep())\r\n if x in c or p in c:\r\n print(\"NO\")\r\n break\r\n else:\r\n print(\"YES\")\r\nif __name__ == '__main__':\r\n main()\r\n\"\"\"\r\n\"\"\"\r\ndef main():\r\n s,k = sep()\r\n a=[0,1]\r\n ans=[]\r\n #print(ans)\r\n while(a[-1]<s):\r\n a.append(sum(a[-k:]))\r\n a.reverse()\r\n #print(list(a))\r\n for i in a:\r\n if i<=s:\r\n ans.append(i)\r\n s-=i\r\n print(len(ans))\r\n print(*ans)\r\nif __name__ == '__main__':\r\n main()\r\n\"\"\"\r\n\r\ndef sep(): return map(int,input().split())\r\n\"\"\"\r\ndef main():\r\n n = int(input())\r\n a = list(sep())\r\n d = {}\r\n f = True\r\n for i in range(n):\r\n if (f == False):\r\n break\r\n for j in range(i):\r\n # print(d)\r\n\r\n if (a[i] + a[j] in d):\r\n ii, jj = d[a[i] + a[j]]\r\n if (len(set([i, j, ii, jj])) == 4):\r\n print('YES')\r\n f = False\r\n print(i + 1, j + 1, ii + 1, jj + 1)\r\n break\r\n \r\n else:\r\n d[a[i] + a[j]] = (i, j)\r\n\r\n if (f):\r\n print('NO')\r\nif __name__ == '__main__':\r\n main()\r\n\"\"\"\r\ndef main():\r\n s=input()\r\n d={}\r\n i=-1\r\n for _ in range(10):\r\n i+=1\r\n t = input()\r\n d[t]=i\r\n #print(d)\r\n j=0\r\n while(j<80):\r\n print(d[s[j:10+j]],end=\"\")\r\n j+=10\r\nif __name__ == '__main__':\r\n main()", "encrypted_code = input().strip()\r\nbinary_codes = [input().strip() for _ in range(10)]\r\nbinary_to_digit = {binary: str(digit) for digit, binary in enumerate(binary_codes)}\r\npassword = ''.join(binary_to_digit[encrypted_code[i:i+10]] for i in range(0, 80, 10))\r\nprint(password)\r\n", "def RestoringPassword(encrpswd,digkeys):\r\n\ti=0\r\n\tresult=\"\"\r\n\twhile i<8:\r\n\t\tstartingIndex = i*10\r\n\t\tendingIndex = (i+1)*10\r\n\t\t\r\n\t\tcode = encrpswd[startingIndex:endingIndex]\r\n\t\tj=0\r\n\t\twhile j<10:\r\n\t\t\tif digkeys[j]==code:\r\n\t\t\t\tresult+=str(j)\r\n\t\t\tj+=1\r\n\t\ti+=1\r\n\treturn result\r\n\r\nencrpswd = input()\r\ndigkeys=[]\r\ni=0\r\nwhile i<10:\r\n\tdigkeys.append(input())\r\n\ti+=1\r\n\r\nprint(RestoringPassword(encrpswd,digkeys))\r\n\r\n", "s=input()\r\nl=[]\r\nfor i in range(10):\r\n l.append(input())\r\nfor i in range(0,len(s),10):\r\n p=s[i]+s[i+1]+s[i+2]+s[i+3]+s[i+4]+s[i+5]+s[i+6]+s[i+7]+s[i+8]+s[i+9]\r\n a = l.index(p)\r\n print(a,end=\"\")", "s = input()\r\na, d = [], {}\r\nfor i in range(0,71,10):\r\n\ta.append(s[i:i+10])\r\nfor i in range(10):\r\n\td[input()]=i\r\nfor i in a:\r\n\tprint(d[i], end='')", "password = input()\n\nkeys = []\ndecrypted = \"\"\nfor i in range(10) :\n keys.append(input())\n\nfor i in range(0,71, 10) :\n decrypted += str( int( keys.index(password[i:i+10])) )\n\nprint(decrypted)\n \t \t\t \t\t \t \t\t\t \t \t\t \t", "s=input()\r\nss=[input() for i in range(10)]\r\nfor i in range(0,80,10):\r\n print(ss.index(s[i:i+10]),end='')", "k = str(input())\r\nhashMap = {}\r\n\r\nfor i in range(10):\r\n code = str(input())\r\n hashMap[code] = str(i)\r\n\r\nres = []\r\nfor i in range(0, len(k), 10):\r\n val = k[i:i+10]\r\n convert = hashMap[val]\r\n res.append(convert)\r\n\r\nprint(\"\".join(res))", "p = input()\r\nnum = {}\r\nfor i in range(10):\r\n num[input()] = i\r\nout = ''\r\nfor i in range(0,len(p),10):\r\n part = p[i:i+10]\r\n out += str(num[part])\r\nprint(out)\r\n", "n = input()\r\nd = dict()\r\nfor i in range(10):\r\n\ts = input()\r\n\td[s] = i\r\n\r\nfor i in range(8):\r\n\ts = n[i * 10:i * 10 + 10]\r\n\tprint(d[s], end=\"\")", "n=input()\r\nm=[]\r\n\r\nseq_size = 10\r\nseq_num = 8\r\na=''\r\n\r\nfor i in range(seq_num):\r\n m.append(n[i*seq_size:(i+1)*seq_size])\r\nmas=[]\r\nfor i in range(10):\r\n l=input()\r\n mas.append(l)\r\n\r\nfor i in m:\r\n a+=str(mas.index(i))\r\nprint(a)", "s = input()\r\nd = {}\r\n\r\nfor i in range(10):\r\n x = input()\r\n d[x] = str(i)\r\n\r\nans = ''\r\nfor i in range(8):\r\n ans += d[s[i*10 : (i * 10 + 10)]]\r\n\r\nprint(ans)", "#!/usr/bin/python3\ns, ma = input(), {}\n[ma.update({input(): i}) for i in range(10)]\n[print(ma[s[i:(i+10)]], end='') for i in range(0, len(s), 10)]\n", "i=input\r\na=i()\r\nexec('b=['+'i(),'*10+']')\r\nb=dict(zip(b,range(10)))\r\nfor i in range(0,len(a),10):\r\n print(b[a[i:i+10]],end='')", "password = input()\r\nvalues = [None]*10\r\nfor i in range(10) :\r\n values[i] = input()\r\nans = \"\"\r\nfor i in range(0, 80, 10):\r\n ans += str(values.index(password[i:i+10]))\r\nprint(ans)\r\n ", "s = input()\r\nd={}\r\nfor i in range(10):\r\n d[i] = input()\r\nr = ''\r\nfor i in range(0, len(s),10):\r\n for k in d:\r\n if d[k] == s[i:i+10]:\r\n r += str(k)\r\n else:\r\n continue\r\nprint(r)", "s=input()\na0=input()\na1=input()\na2=input()\na3=input()\na4=input()\na5=input()\na6=input()\na7=input()\na8=input()\na9=input()\nx=0\nfor i in range(0,81,10):\n if s[x:i]==a1:print(1,end='')\n elif s[x:i]==a2:print(2,end='')\n elif s[x:i]==a3:print(3,end='')\n elif s[x:i]==a4:print(4,end='')\n elif s[x:i]==a5:print(5,end='')\n elif s[x:i]==a6:print(6,end='')\n elif s[x:i]==a7:print(7,end='')\n elif s[x:i]==a8:print(8,end='')\n elif s[x:i]==a9:print(9,end='')\n elif s[x:i]==a0:print(0,end='') \n x=i\n\n \t\t \t \t \t \t \t\t \t \t\t", "a = input()\r\nsim = {\r\n input(): '0',\r\n input(): '1',\r\n input(): '2',\r\n input(): '3',\r\n input(): '4',\r\n input(): '5',\r\n input(): '6',\r\n input(): '7',\r\n input(): '8',\r\n input(): '9'\r\n}\r\nexi = ''\r\nj = 0\r\nfor i in range(10, 90, 10):\r\n exi += sim[a[j:i]]\r\n j += 10\r\nprint(exi)", "s=input()\r\nl=[]\r\nfor i in range(10):\r\n\tl.append(input())\r\nfor i in range(0,80,10):\r\n\tprint(l.index(s[i:i+10]),end=\"\")", "x=input()\r\nl=[]\r\nans=''\r\nfor i in range(0,10):\r\n n=input()\r\n l.append([str(i),n])\r\nini=0\r\nf=10\r\nfor i in range(ini,f):\r\n for j in l:\r\n if x[ini:f]==j[1]:\r\n ans=ans+j[0]\r\n break\r\n else:\r\n continue\r\n ini=ini+10\r\n f=f+10\r\nprint(ans)\r\n", "s=input()\r\nL=[]\r\nfor i in range(0,10):\r\n\tp=input()\r\n\tL.append(p)\r\npassword=''\r\nfor i in range(0,8):\r\n\tj=L.index(s[10*i:10*i+10])\r\n\tpassword+=str(j)\r\nprint(password)\r\n", "s = input()\r\nss = []\r\n\r\nfor i in range(10):\r\n ss.append(input())\r\nans = []\r\nfor i in range(8):\r\n for j in range(10):\r\n if(ss[j] == s[i*10: (i+1)*10]):\r\n ans.append(j)\r\n break\r\n\r\nfor i in ans:\r\n print(i, end=\"\")", "s=input()\r\nl=[]\r\nfor i in range(10):\r\n l.append(input())\r\n\r\n#print(l)\r\nls=[]\r\nfor i in range(0,80,10):\r\n ls.append(s[i:i+10])\r\nfor i in ls:\r\n for j in range(len(l)):\r\n if i==l[j]:\r\n print(j,end='')\r\n", "# https://codeforces.com/contest/94/problem/A\r\n\r\n\r\ndef single_integer():\r\n return int(input())\r\n\r\n\r\ndef multi_integer():\r\n return map(int, input().split())\r\n\r\n\r\ndef string():\r\n return input()\r\n\r\n\r\ndef multi_string():\r\n return input().split()\r\n\r\n\r\nn = input()\r\nnumbers_dict = dict()\r\nfor i in range(10):\r\n numbers_dict[input()] = i\r\ni = 0\r\nwhile i < 80:\r\n s = numbers_dict[n[i:i + 10]]\r\n print(s, end=\"\")\r\n i += 10\r\n", "s = input()\r\na = [s[i:i+10] for i in range(0, len(s), 10)]\r\nlst = []\r\nd = []\r\nfor i in range(10):\r\n n = input()\r\n lst.append(n)\r\nfor i in range(len(a)):\r\n if (a[i] in lst):\r\n d.append(lst.index(a[i]))\r\nfor i in d:\r\n print(i, end = \"\")", "password = input()\r\ncode_dict = {input(): str(i) for i in range(10)}\r\nresult = ''\r\nfor i in range(0, 80, 10):\r\n result += code_dict[password[i:i+10]]\r\nprint(result)", "a = input()\r\nb = [input() for i in range(10)]\r\nprint(*[b.index(a[i:i + 10]) for i in range(0, 80, 10)], sep='')", "bcode = input()\nnum = []\nfor i in range(10):\n num.append(input())\nans = ''\nfor i in range(0,len(bcode),10):\n ans += str(num.index(bcode[i:i+10]))\nprint(ans)\n\t \t \t\t\t \t\t\t\t\t \t\t \t \t\t\t \t \t\t \t", "s = input()\nl = []\nfor _ in range(10):\n l.append(input())\nres = ''\nfor i in range(0,80,10):\n det = s[i:i+10]\n for j in range(10):\n if l[j] == det:\n res += str(j)\nprint(res)\n", "s=input()\nd={}\nfor i in range(10):\n\td[input()]=i\nss=[]\nfor i in range(8):\n\tss.append(d[s[i*10:(i+1)*10]])\nprint(*ss,sep=\"\")\n\t \t\t\t\t \t\t\t\t \t\t\t\t \t\t \t\t \t \t", "# import sys\n# sys.stdin=open('input.txt', 'r')\n# sys.stdout=open('output.txt', 'w')\n\nn=list(input())\nmydict=[]\nfor i in range(8):\n j=i*10\n mydict.append(''.join(n[j:j+10]))\ncode={}\nfor i in range(10):\n x=input()\n code[x]=i\nans=[]\nfor i in range(len(mydict)):\n ans.append(str(code[mydict[i]]))\nprint(''.join(ans))\n\n\t\t \t\t\t\t\t \t\t\t \t \t \t \t\t \t \t \t \t\t", "string = str(input())\r\n\r\nnumber0 = str(input())\r\nnumber1 = str(input())\r\nnumber2 = str(input())\r\nnumber3 = str(input())\r\nnumber4 = str(input())\r\nnumber5 = str(input())\r\nnumber6 = str(input())\r\nnumber7 = str(input())\r\nnumber8 = str(input())\r\nnumber9 = str(input())\r\n\r\nnumber = \"\"\r\ni = 0\r\nwhile i <= 80:\r\n\ttry:\r\n\t\tif string[i:i + 10] == number0:\r\n\t\t\tnumber += \"0\"\r\n\t\telif string[i:i + 10] == number1:\r\n\t\t\tnumber += \"1\"\r\n\t\telif string[i:i + 10] == number2:\r\n\t\t\tnumber += \"2\"\r\n\t\telif string[i:i + 10] == number3:\r\n\t\t\tnumber += \"3\"\r\n\t\telif string[i:i + 10] == number4:\r\n\t\t\tnumber += \"4\"\r\n\t\telif string[i:i + 10] == number5:\r\n\t\t\tnumber += \"5\"\r\n\t\telif string[i:i + 10] == number6:\r\n\t\t\tnumber += \"6\"\r\n\t\telif string[i:i + 10] == number7:\r\n\t\t\tnumber += \"7\"\r\n\t\telif string[i:i + 10] == number8:\r\n\t\t\tnumber += \"8\"\r\n\t\telif string[i:i + 10] == number9:\r\n\t\t\tnumber += \"9\"\r\n\t\t\r\n\t\ti += 10\r\n\t\r\n\texcept IndexError:\r\n\t\tpass\r\n\r\nprint(number)", "s=input()\r\na,p=[],[]\r\nfor i in range(10):\r\n a.append(input())\r\nfor i in range(8):\r\n for j in range(10):\r\n sr=s[10*i:10*(i+1)]\r\n if sr==a[j]:\r\n p.append(j)\r\nprint(*p,sep='')", "password = input()\r\nnumbers = []\r\nfor i in range(10):\r\n numbers.append(input())\r\none = password[0:10]\r\ntwo = password[10:20]\r\nthree = password[20:30]\r\nfour = password[30:40]\r\nfive = password[40:50]\r\nsix = password[50:60]\r\nseven = password[60:70]\r\neight = password[70:80]\r\nprint(str(numbers.index(one)) + str(numbers.index(two)) + str(numbers.index(three)) + str(numbers.index(four)) + str(numbers.index(five)) + str(numbers.index(six)) + str(numbers.index(seven)) + str(numbers.index(eight)))\r\n", "import sys\r\nimport math\r\n\r\nst = sys.stdin.readline()\r\n\r\nd = dict()\r\nres = []\r\nfor i in range(10):\r\n t = sys.stdin.readline()\r\n d[t[:10]] = str(i)\r\n \r\nfor i in range(1, 9):\r\n res.append(d[st[(i * 10 - 10):(i * 10)]])\r\n \r\nprint(\"\".join(res))\r\n ", "t = input()\r\nl = []\r\nfor i in range(10):\r\n\tt1 = input()\r\n\tl.append(t1)\r\nfor i in range(10,90,10):\r\n\tfor j in range(len(l)):\r\n\t\tif t[i-10:i] == l[j]:\r\n\t\t\tprint(j,end=\"\")\r\n\t\t\tbreak\r\n", "binary = input()\ncodes = {}\n\nfor code in range(10):\n codes[input()] = code\n\nfor i in range(8):\n current = binary[i*10:i*10 + 10]\n print(codes[current], end=\"\")", "def main():\r\n p = input().strip()\r\n ns = dict()\r\n for i in range(10):\r\n ns[input().strip()] = i\r\n\r\n i = 0\r\n while i < len(p):\r\n print(ns[p[i:i+10]], end='')\r\n i += 10\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "s, lst = input(), [input() for x in range(10)]\r\nfor x in range(0, 80, 10):\r\n for i in range(10):\r\n if s[x:x + 10] == lst[i]: \r\n print(i, end = \"\")\r\n break", "password = input()\nx = dict()\nfor i in range(10):\n x[input()] = str(i)\nans = ''\nfor i in range(0,80,10):\n ans+= x[password[i:i+10]]\nprint(ans)\n", "s = input()\npasswd = \"\"\ndigit = []\nfor i in range(10):\n digit.append(input())\n\nfor i in range(8):\n num = s[i * 10: (i * 10) + 10 ]\n for j in range(10):\n if digit[j] == num:\n j = str(j)\n passwd = passwd + j\n break\nprint(passwd)", "s = input()\r\nd = {}\r\nfor i in range(10):\r\n d[input()] = str(i)\r\n\r\nret = \"\"\r\nfor i in range(0, len(s), 10):\r\n ret += d[s[i:i+10]]\r\nprint(ret)", "#https://codeforces.com/problemset/problem/94/A\nfrom textwrap import wrap\npw_hash = wrap(input().strip(),10)\npw_hash = list(map(lambda x : int(x,2),pw_hash))\ndecrypt_keys = []\nfor i in range(10):\n decrypt_keys.append(int(input().strip(),2))\n\npassword = ''\nfor c in pw_hash:\n password += str(decrypt_keys.index(c))\nprint(password)", "a=input()\r\nb=[]\r\nfor i in range(10):\r\n b+=[input()]\r\nc=''\r\nwhile a:\r\n d=a[:10]\r\n a=a[10:]\r\n c+=str(b.index(d))\r\nprint(c)\r\n" ]

[ "n,k,M = [int(i) for i in input().split(' ')]\ntasks = [int(i) for i in input().split(' ')]\ntasks = sorted(tasks)\nans = 0\nfor i in range(n+1):\n remaining_time = M - i*sum(tasks)\n if(remaining_time < 0):\n break\n value = (k+1)*i\n for j in range(k):\n for take in range(n-i):\n if(remaining_time >= tasks[j]):\n value += 1\n remaining_time -= tasks[j]\n ans = max(ans,value)\nprint(ans)\n", "n, k, M = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort()\r\nsuma = sum(a)\r\nans = 0\r\nfor total in range(n + 1):\r\n m = M - suma * total\r\n if m < 0:\r\n break\r\n r = total * (k + 1)\r\n for x in a:\r\n solved = min((n-total), m // x)\r\n r += solved\r\n m -= solved * x\r\n ans = max(ans, r)\r\nprint(ans)", "n,k,M = map(int,input().split())\r\n\r\nT = sorted(map(int,input().split()))\r\n\r\nsT = sum(T)\r\n\r\ndef it(p):\r\n # pタスク完成させるノリ\r\n score = p*(k+1)\r\n m = M - p*sT\r\n\r\n if m < 0:\r\n return 0\r\n\r\n q = n-p\r\n\r\n for t in T:\r\n if m > q*t:\r\n m -= q*t\r\n score += q\r\n else:\r\n score += m//t\r\n break\r\n return score\r\n\r\nprint(max(it(i) for i in range(n+1)))", "from itertools import accumulate\r\nfrom bisect import *\r\nn, k, m = list(map(int, input().split()))\r\nt = sorted(map(int, input().split()))\r\n\r\nres = 0\r\ns = sum(t)\r\nps = list(accumulate(t))\r\nfor x in range(min(n, m//s)+1):\r\n rem = m - x*s\r\n if x < n:\r\n y = bisect_right(ps, rem/(n-x))\r\n rem -= (n-x)*(ps[y-1] if y>0 else 0)\r\n if y < k:\r\n z = rem // t[y]\r\n else:\r\n z = 0\r\n else:\r\n y = z = 0\r\n r = x*(k+1) + y*(n-x) + z + ((n-x) if y==k else 0) + (z if y == k-1 else 0)\r\n res = max(res, r)\r\nprint(res)", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\n[n, k, M] = list(map(int, input().split()))\r\nt = list(map(int, input().split()))\r\nt.sort()\r\ntot = sum(t)\r\n\r\nres = 0\r\nfor x in range(n+1):\r\n need = x*tot \r\n if need <= M:\r\n cnt = x*(k+1)\r\n r = M-need\r\n j = 0\r\n while r > 0 and j < k:\r\n if t[j]*(n-x) <= r:\r\n cnt += n-x\r\n r -= t[j]*(n-x)\r\n j += 1\r\n else:\r\n cnt += r//t[j]\r\n r -= (r//t[j])*t[j]\r\n break\r\n res = max(res, cnt)\r\nprint(res)\r\n\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(100000)\r\nfrom collections import deque, defaultdict\r\np = print\r\nr = range\r\nde = defaultdict\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, k, m = II()\r\na = sorted(II())\r\ntotal = sum(a)\r\nres = -1\r\nfor i in r(n+1):\r\n # i - fully solved questions\r\n t = m - total*i\r\n points = i*(k+1)\r\n if t < 0:\r\n break\r\n j = 0\r\n while t > 0:\r\n if j == k-1:\r\n break\r\n if t >= (n-i) * a[j]:\r\n t -= (n-i) * a[j]\r\n points += n-i\r\n j += 1\r\n else:\r\n points += (t//a[j])\r\n break\r\n res = max(res,points)\r\np(res)\r\n\r\n", "def solve(n, k, M, t):\n task_sum = sum(t)\n t = sorted(t) # will take from smaller subtasks\n\n all_points = []\n for tasks_completed in range(n + 1): # loop over tasks fully taken from 0 to N taken tasks\n minutes_spent_on_full_tasks = tasks_completed * task_sum\n if minutes_spent_on_full_tasks > M:\n break\n\n # k subtasks + 1 for each\n total_points = tasks_completed * k + tasks_completed\n remaining_time = M - minutes_spent_on_full_tasks\n\n for i in range(k): # loop over subtasks\n # try take all smaller subtasks from remaining unsolved tasks\n # don't count in fully completed tasks\n subtasks_left = n - tasks_completed\n smaller_subtasks_time = subtasks_left * t[i] # total \"weight\" of all left subtasks for given time group\n\n if (smaller_subtasks_time <= remaining_time): # can take entire set of subtasks with given weight\n remaining_time -= smaller_subtasks_time\n total_points += subtasks_left # simply add all subtasks of given t[i]\n else: # cannot take entire set, lets take at least \"tail\"\n total_points += remaining_time // t[i]\n break # not time left\n\n all_points += [total_points]\n return max(all_points)\n\n\n\n\n\n\n\n\ndef main():\n n, k, M = [int(x) for x in input().split(\" \")]\n t = [int(x) for x in input().split(\" \")]\n # n, k, M = 4, 2, 15\n # t = [1, 2, 4, 8, 16]\n # t = [1, 1, 1, 1]\n # t = [4, 1]\n res = solve(n, k, M, t)\n\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "large, n, m = map(int, input().split())\nnums = list(map(int, input().split()))\nnums.sort()\ns = sum(nums)\nans = 0\nfor cnt in range(0, large+1):\n result = 0\n minute = m\n if m<cnt*s:\n break\n result += cnt*n+cnt\n minute -= cnt*s\n if cnt==large:\n ans = result\n break\n for i in range(n):\n if minute >= nums[i]*(large-cnt):\n minute -= nums[i]*(large-cnt)\n result += large-cnt\n else:\n result += minute//nums[i]\n break\n ans = max(ans, result)\nprint(ans)\n\t\t \t \t \t \t \t \t \t\t\t \t\t\t\t", "from itertools import accumulate\r\nfrom bisect import *\r\nn, k, m = list(map(int, input().split()))\r\nt = sorted(map(int, input().split()))\r\n\r\nres = 0\r\nfor x in range(min(n, m//sum(t))+1):\r\n mm = m-x*sum(t); r = x*(k+1)\r\n for i, ti in enumerate(t):\r\n for _ in range(n-x):\r\n if mm>=ti:\r\n mm -= ti\r\n r += 1 if i < k-1 else 2\r\n res = max(res, r)\r\nprint(res)", "n,k,M=map(int,input().split())\r\nt=[int(c) for c in input().split()]\r\nt.sort()\r\nres=0\r\ns=sum(t)\r\nfor to in range(n+1):\r\n m=M-(to*s)\r\n if m<0:\r\n break\r\n r=(k+1)*to\r\n for i in t:\r\n r+=min(n-to,m//(i))\r\n m-=(min(n-to,m//(i)))*i\r\n res=max(res,r)\r\nprint(res)\r\n", "n , k, M = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nb.sort()\r\nsuma = sum(b)\r\nans = 0\r\nfor total in range(n + 1):\r\n m = M - total * suma\r\n if m < 0:\r\n break\r\n r = (k + 1) * total\r\n for x in b:\r\n sol = min((n - total), m //x)\r\n r += sol\r\n m -= sol * x\r\n ans = max(ans, r)\r\nprint(ans)", "n, k, m = map(int, input().split())\r\n\r\nnums = list(map(int, input().split()))\r\n\r\nresult = -1\r\n\r\nalltime = sum(nums)\r\n\r\nfor made in range(n + 1):\r\n if(alltime * made > m):\r\n break\r\n currentres = (k + 1) * made\r\n currenttime = m - made * alltime\r\n available = []\r\n for item in nums:\r\n available.extend([item]*(n - made))\r\n available = sorted(available)\r\n for item in available:\r\n if(currenttime < item):\r\n break\r\n currenttime -= item\r\n currentres += 1\r\n result = max(result, currentres)\r\n\r\nprint(result)\r\n", "n, k, m = list(map(int, input().split()))\r\nt = sorted(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(n+1):\r\n rem = m - i*sum(t)\r\n if rem < 0: break\r\n r = i*(k+1)\r\n for j in range(k):\r\n d = min(rem//t[j], n-i)\r\n rem -= d*t[j]\r\n r += d\r\n res = max(res, r)\r\n\r\nprint(res)", "n, k, m = list(map(int, input().split()))\r\nt = sorted(map(int, input().split()))\r\nres = 0\r\nfor i in range(n+1):\r\n rt = m-i*sum(t)\r\n r = i*(k+1)\r\n if (rt < 0): break\r\n for j in range(k):\r\n div = min(rt//t[j], n-i)\r\n rt -= div*t[j]\r\n r += div\r\n res = max(res, r)\r\nprint(res)", "import sys\r\n\r\nn, k, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\ntotal = sum(a)\r\n\r\nif n * total <= m:\r\n print(n*(k+1))\r\n exit()\r\n\r\nans = 0\r\n\r\nfor complete in range(n):\r\n if complete*total > m:\r\n break\r\n\r\n items = a * (n - complete)\r\n dp = [-1]*(len(items)+1)\r\n dp[0] = m - complete * total\r\n\r\n for x in items:\r\n for i in range(len(items)-1, -1, -1):\r\n dp[i+1] = max(dp[i+1], dp[i]-x)\r\n\r\n for i in range(len(items), -1, -1):\r\n if dp[i] >= 0:\r\n ans = max(ans, i + complete * (k+1))\r\n break\r\n\r\nprint(ans)\r\n", "n,k, M = map(int,input().split())\ntime_list = sorted(list(map(int,input().split())))\nsum1 = sum(time_list)\ntries_list = []\nfor i in range(n+1):\n m = M\n c = 0\n for j in range(i):\n if m - sum1 >= 0:\n m -= sum1\n c += k + 1\n else:\n break\n for j in range(k):\n for _ in range(n-i):\n if m - time_list[j] >= 0:\n m -= time_list[j]\n c += 1\n else:\n break\n tries_list.append(c)\nprint(max(tries_list)) \n ", "n, k, M = list(map(int, input().strip().split()))\r\na = list(map(int, input().strip().split()))\r\na.sort()\r\n\r\nrimasto = []\r\npunteggio = []\r\n\r\ns = sum(a)\r\n\r\nfor i in range(n+1):\r\n if i * s <= M:\r\n rimasto.append(M - i*s)\r\n punteggio.append(i*(k+1))\r\n\r\nfor i in range(len(rimasto)):\r\n t = rimasto[i]\r\n task = 0\r\n while t > 0 and task < k:\r\n j = t // a[task]\r\n j = min(j, n-i)\r\n t = t - j * a[task]\r\n punteggio[i] += j\r\n task += 1\r\nprint(max(punteggio))", "n,k,m=map(int,input().split())\r\nt=list(map(int,input().split()))\r\nt.sort()\r\ns=[]\r\nfor i in range(min(m//sum(t)+1,n)):\r\n y=m\r\n x=i*(k+1)\r\n y-=i*sum(t)\r\n f=n-i\r\n for j in range(k-1):\r\n x+=min(f,y//t[j])\r\n y-=min(f,y//t[j])*t[j]\r\n x+=2*(min(f,y//t[k-1]))\r\n y-=min(f,y//t[k-1])*t[k-1]\r\n s.append(x)\r\nprint(max(s))", "n, k, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\na.sort()\r\nans = 0\r\nsm = sum(a)\r\nans = 0\r\nfor i in range(min(n, m // sm) + 1):\r\n ansn = (k + 1) * i\r\n tm = m - i * sm\r\n for j in range(k):\r\n q = min(n - i, max(0, tm // a[j]))\r\n ansn += q\r\n tm -= q * a[j]\r\n ans = max(ansn, ans)\r\nprint(ans)", "n, k, M = map(int, input().split())\r\nscore = sorted([int(x) for x in input().split()])\r\ns = sum(score); ans = 0\r\n\r\nfor i in range(n + 1):\r\n m = M - s*i\r\n if m < 0: break\r\n r = (k + 1) * i\r\n for x in score:\r\n solved = min(n - i, m // x)\r\n r += solved\r\n m -= solved * x\r\n ans = max(ans, r)\r\nprint(ans)\r\n", "\r\ndef solve(n, k, M, t):\r\n '''\r\n >>> solve(3, 4, 11, [1, 2, 3, 4])\r\n 6\r\n >>> solve(5, 5, 10, [1, 2, 4, 8, 16])\r\n 7\r\n >>> solve(3, 2, 4, [1, 1])\r\n 6\r\n >>> solve(5, 2, 10, [2, 3])\r\n 6\r\n '''\r\n t.sort()\r\n k = len(t)\r\n\r\n T = sum(t)\r\n\r\n max_score = 0\r\n\r\n for fully_solved in range(min(n, M // T) + 1):\r\n # Try to fully solve fully_solved problems, remainder is for remaining subproblems\r\n score_1 = fully_solved * (k + 1) # For fully solved\r\n\r\n score_2 = 0 # For partially solved\r\n remaining_time = M - T * fully_solved\r\n remaining_problems = n - fully_solved\r\n\r\n if remaining_problems > 0:\r\n level = 0\r\n while level < k:\r\n # remaining_time > 0 and level < k:\r\n level_coeff = 1 if level + 1 < k else 2 # last_level\r\n time_to_solve_level = t[level] * remaining_problems\r\n if time_to_solve_level <= remaining_time:\r\n score_2 += remaining_problems * level_coeff\r\n remaining_time -= time_to_solve_level\r\n else:\r\n score_2 += (remaining_time // t[level]) * level_coeff\r\n break\r\n level += 1\r\n score = score_1 + score_2\r\n max_score = max(score, max_score)\r\n\r\n return max_score\r\n\r\n\r\n\r\ndef main():\r\n n, k, M = map(int, input().split())\r\n t = list(map(int, input().split()))\r\n print(solve(n, k, M, t))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n", "n, k, M = map(int, input().split())\nt = sorted(map(int, input().split()))\n\ndef calc(x):\n tot = x * sum(t)\n if tot > M:\n return 0\n tans = x * (k + 1)\n for i in range(k - 1):\n if t[i] * (n - x) + tot <= M:\n tot += t[i] * (n - x)\n tans += n - x\n else:\n tans += (M - tot) // t[i]\n break\n return tans\n\nprint(max([calc(x) for x in range(n + 1)]))\n", "# import sys\n# sys.stdin = open('in', 'r')\n\nn, k, m = map(int, input().split())\ntt = list(map(int, input().split()))\ntt.sort()\n\ns = sum(tt)\nans = 0\n\n\ndef check(x, m):\n ret = (k+1) * x\n m -= s * x\n if m < 0:\n return -1\n\n for i in range(k):\n if tt[i]*(n-x) <= m:\n m -= tt[i]*(n-x)\n ret += (n-x)\n else:\n ret += m//tt[i]\n m -= (m//tt[i])*tt[i]\n if m <= 0:\n break\n return ret\n\n\nfor i in range(n+1):\n ans = max(ans, check(i, m))\nprint(ans)\n", "\nn,k,m = map(int,input().split())\nl = list(map(int,input().split()))\nl.sort()\nsm = sum(l)\nans = 0\nfor i in range(n+1):\n\tif sm*i > m:\n\t\tbreak\n\tm1 = m-sm*i\n\tcnt = [n-i]*(k)\n\tcur = 0\n\tres = (k+1)*i\n\twhile m1 > 0:\n\t\tif cur >= k or l[cur] > m1:\n\t\t\tbreak\n\t\tx = min(m1//l[cur],cnt[cur])\n\t\tres += x\n\t\tm1 -= x*l[cur]\n\t\tcur += 1\n\tans = max(res,ans)\nprint(ans)", "n,k, M = map(int, input().split())\r\nT = list(map(int, input().split()))\r\nans = 0\r\ns = sum(T)\r\nfor i in range(0, n+1):\r\n total = s*i\r\n if total > M:\r\n break\r\n temp = (k+1)*i\r\n X = []\r\n for t in T:\r\n X += [t]*(n-i)\r\n X.sort()\r\n for t in X:\r\n if total+t <= M:\r\n temp += 1\r\n total += t\r\n else:\r\n break\r\n ans = max(ans, temp)\r\nprint(ans)\r\n", "import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict\n\nn, k, m = map(int, input().split())\nl = list(map(int, input().split()))\ns = sum(l)\nans = 0\nfor x in range(n + 1):\n\tleft = m - s * x\n\tif left < 0:\n\t\tcontinue\n\telse:\n\t\ttemp = (k + 1) * x\n\t\tt = sorted(l * (n - x))\n\t\tz = len(t)\n\t\ti = 0\n\t\twhile (i < z):\n\t\t\tcur = t[i]\n\t\t\tif left >= cur:\n\t\t\t\tleft -= cur\n\t\t\t\ttemp += 1\n\t\t\t\ti += 1\n\t\t\telse:\n\t\t\t\tbreak\n\t\tans = max(ans, temp)\nprint(ans)", "n, k, m = list(map(int, input().split()))\r\nt = sorted(map(int, input().split()))\r\ns = sum(t)\r\nres = 0\r\nfor x in range(min(m//s, n)+1):\r\n rem = m - x*s;\r\n r = x*(k+1)\r\n for i in range(k):\r\n d = min(rem//t[i], n-x)\r\n rem -= d*t[i]\r\n r += d\r\n res = max(res, r)\r\nprint(res)", "n,k,M=map(int,input().split())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nsumma=sum(a)\r\nfor total in range(n+1):\r\n m=M-total*summa\r\n if m<0:\r\n break\r\n r=(k+1)*total\r\n for x in a:\r\n solved=min((n-total),m//x)\r\n r+=solved\r\n m-=solved*x\r\n ans=max(ans,r)\r\nprint(ans)\r\n", "n,k,m=map(int,input().split())\r\nlst=list(map(int,input().split()))\r\nl=[]\r\ns=sum(lst)\r\nlst.sort()\r\ng=n\r\nh=m\r\nfor r in range(g+1):\r\n ans=0\r\n m=h\r\n \r\n n=g-r\r\n if s*r<=m:\r\n \r\n ans+=(k+1)*r\r\n #print(k,r,ans)\r\n m=m-s*r\r\n c=0\r\n while 1:\r\n if c>=k:\r\n break\r\n t=m//lst[c]\r\n #print(\"t=\",t,r,m)\r\n if t<=0:\r\n break\r\n #print(r)\r\n if(t>n):\r\n m=m-n*lst[c];\r\n ans+=n\r\n else:\r\n m=m-t*lst[c]\r\n ans+=t\r\n c+=1\r\n #print(r,ans)\r\n l.append(ans)\r\n else:\r\n #print(r*s,m,\"fgd\")\r\n break\r\nprint(max(l))", "from functools import reduce\r\nn,k,m = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\nsum = reduce(lambda x,y: x+y, t)\r\nmx = 0\r\nfull = 0\r\nwhile full <= n and full*sum <= m:\r\n\tcnt = full*k + full\r\n\tfree_time = m - sum*full\r\n\tfor time in t:\r\n\t\ttasks = min(n - full, free_time // time) \r\n\t\tcnt += tasks\r\n\t\tfree_time -= tasks*time\r\n\tmx = max(mx, cnt)\r\n\tfull += 1\r\nprint(mx)\t\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k,m = list(map(int,input().split()))\nt = list(map(int,input().split()))\nt.sort()\ns = sum(t)\nmmm = 0\nfor i in range(n+1):\n if i*s > m : break\n tm = m-i*s\n c = k*i+i\n for j in range(k):\n c+=min(tm//t[j],n-i)\n tm-=min(tm//t[j],n-i)*t[j]\n mmm = max(mmm,c)\nprint(mmm)", "n, k, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\na.sort()\r\nsum_row = 0\r\nfor elem in a:\r\n sum_row += elem\r\nmax_ans = 0\r\nfor i in range(min(n + 1, m // sum_row + 1)):\r\n ans = i * (k + 1)\r\n m1 = m - sum_row * i\r\n for j in range(k):\r\n t = (n - i) * a[j]\r\n if t <= m1:\r\n m1 -= t\r\n ans += (n - i)\r\n else:\r\n ans += m1 // a[j]\r\n break\r\n max_ans = max(max_ans, ans)\r\nprint(max_ans)\r\n", "f = lambda: map(int, input().split())\r\nn, k, m = f()\r\np = sorted(f())\r\nx = 0\r\ns = sum(p)\r\nfor j in range(n + 1):\r\n t = m - j * s\r\n if t < 0: break\r\n y = k * j + j\r\n for i in p:\r\n d = min(n - j, t // i)\r\n y += d\r\n t -= d * i\r\n x = max(x, y)\r\nprint(x)", "n, k, M = map(int, input().split())\r\nt = sorted(list(map(int, input().split())))\r\npt = t[:]\r\nfor i in range(1, k):\r\n pt[i] += pt[i - 1]\r\nans, r = 0, k - 1\r\nfor i in range(0, n + 1):\r\n if pt[-1] * i > M:\r\n break\r\n m = M - pt[-1] * i\r\n while r != -1 and pt[r] * (n - i) > m:\r\n r -= 1\r\n m -= (0 if r == -1 else pt[r] * (n - i))\r\n ans = max(ans, i * (k + 1) + (r + 1) * (n - i) + (m // t[r + 1] if r < k - 1 else 0))\r\nprint(ans)", "n, k, m = list(map(int, input().split()))\r\nt = sorted(map(int, input().split()))\r\nres = 0\r\nfor x in range(min(m//sum(t),n)+1):\r\n rem = m - x*sum(t)\r\n r = x*(k+1)\r\n for i in range(k):\r\n div = min(rem//t[i], n-x) \r\n rem -= div*t[i]\r\n r += div\r\n res = max(res, r)\r\nprint(res)", "n, k, M = map(int, input().split())\r\nt = list(map(int, input().split()))\r\nt.sort()\r\nS = sum(t[j] for j in range(k))\r\nans = 0\r\nfor i in range(n + 1):\r\n if i * S > M:\r\n break\r\n else:\r\n p = (k + 1) * i\r\n R = M - i * S\r\n for j in range(k):\r\n if R < t[j]:\r\n break\r\n else:\r\n q = min(n - i, R // t[j])\r\n R -= q * t[j]\r\n p += q\r\n ans = max(ans, p)\r\nprint(ans)", "n, k, m = [int(x) for x in input().split()]\r\na = sorted([int(x) for x in input().split()])\r\net = sum(a)\r\nes = k + 1\r\nans = []\r\nfor i in range(n + 1):\r\n ts = es * i\r\n ht = m - et * i\r\n if ht < 0:\r\n break\r\n for p in a:\r\n s = min(ht // p, n - i)\r\n ht -= s * p\r\n ts += s\r\n ans.append(ts)\r\nans.sort()\r\nprint(ans[-1])" ]

[ "max_alpha = 26\r\n\r\nclass TrieNode:\r\n def __init__(self):\r\n self.children = [0] * max_alpha\r\n\r\ndef add_trie(root, word):\r\n v = root\r\n for char in word:\r\n c = ord(char) - ord('a')\r\n if not v.children[c]:\r\n v.children[c] = TrieNode()\r\n v = v.children[c]\r\n\r\ndef dfs(v):\r\n v.win = False\r\n v.lose = False\r\n is_leaf = True\r\n \r\n for i in range(max_alpha):\r\n if v.children[i]:\r\n is_leaf = False\r\n to = v.children[i]\r\n dfs(to)\r\n v.win |= not to.win\r\n v.lose |= not to.lose\r\n \r\n if is_leaf:\r\n v.lose = True\r\n\r\nclass TrieNode:\r\n def __init__(self):\r\n self.children = [0] * max_alpha\r\n self.win = False\r\n self.lose = False\r\n\r\ndef answer(res):\r\n print(\"First\" if res else \"Second\")\r\n exit(0)\r\n\r\nn, k = map(int, input().split())\r\nroot = TrieNode()\r\n\r\nfor _ in range(n):\r\n word = input().strip()\r\n add_trie(root, word)\r\n\r\ndfs(root)\r\n\r\nif k == 1:\r\n answer(root.win)\r\nelif not root.win:\r\n answer(root.win)\r\nelif root.lose:\r\n answer(root.win)\r\nelif k % 2 == 1:\r\n answer(root.win)\r\nelse:\r\n answer(not root.win)\r\n", "# LUOGU_RID: 132709230\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\n\r\nfrom math import gcd\r\n\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\ntr = [[0 for i in range(26)] for _ in range(100010)]\r\nson = [0 for i in range(100010)]\r\nidx = 0\r\n\r\n\r\ndef ins(s):\r\n p = 0\r\n global idx\r\n for c in s:\r\n u = ord(c) - ord('a')\r\n if tr[p][u] == 0:\r\n idx += 1\r\n tr[p][u] = idx\r\n son[p] += 1\r\n p = tr[p][u]\r\n\r\n\r\nn, k = M()\r\nfor _ in range(n):\r\n ins(IN())\r\n\r\n\r\ndef win(p):\r\n for i in range(26):\r\n if tr[p][i] != 0 and not win(tr[p][i]):\r\n return True\r\n return False\r\n\r\n\r\ndef lose(p):\r\n for i in range(26):\r\n if tr[p][i] != 0 and not lose(tr[p][i]):\r\n return True\r\n if son[p] == 0:\r\n return True\r\n return False\r\n\r\n\r\nf, g = win(0), lose(0)\r\n\r\n\r\nif f:\r\n if g:\r\n print(\"First\")\r\n else:\r\n print(\"First\" if k % 2 == 1 else \"Second\")\r\nelse:\r\n print(\"Second\")\r\n" ]

[ "k=int(input())\r\na=10\r\nwhile k!=0:\r\n a+=9\r\n s=sum(list(map(int,str(a))))\r\n # print(s)\r\n if s==10:\r\n k=k-1\r\nprint(a)", "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 = int(input())\r\nans = 19\r\ni = 1\r\n\r\nwhile i < n:\r\n ans += 9\r\n if sum(map(int,str(ans))) == 10: i+= 1\r\nprint(ans)", "import sys\n\nk = int(sys.stdin.readline())\n\ncurrent = 19\ndef digitsum(n):\n total = 0\n while n != 0:\n total += n%10\n n = n//10\n return total == 10\nwhile k > 1:\n current += 9\n while digitsum(current) == False:\n current += 9\n k -= 1\nprint(current)\n\t\t\t \t\t \t \t\t\t \t\t \t\t\t\t\t", "n = int(input())\r\n\r\ndef sm(n):\r\n s=0\r\n while n>0 and s<11:\r\n s+=(n%10)\r\n n=n//10\r\n\r\n if(s==10):\r\n return True \r\n else:\r\n return False\r\n\r\ni=19\r\ncnt=0\r\nwhile True:\r\n if(sm(i)):\r\n cnt+=1\r\n\r\n if(cnt==n):\r\n print(i)\r\n exit(0)\r\n\r\n i+=9", "def summing(n):\r\n ans = 0\r\n while n:\r\n ans += n % 10\r\n n //= 10\r\n return ans\r\n\r\nn = int(input())\r\nans = 0\r\nwhile n:\r\n ans += 1\r\n if summing(ans) == 10:\r\n n -= 1\r\nprint(ans)", "res = set()\r\n\r\ninit = ['0','1','2','3','4','5','6','7','8','9']\r\n\r\ndef func(l: list, num = 10):\r\n \r\n if len(l[0]) == num:\r\n return l\r\n \r\n new_els = []\r\n for el in l:\r\n s = sum(map(int, el))\r\n if s == 10:\r\n res.add(int(el))\r\n for i in range(10-s+1):\r\n new_els.append(el+str(i))\r\n \r\n func(new_els, num=num)\r\n\r\nfunc(init, num=9)\r\nres = sorted(list(res))\r\nn = int(input())\r\nprint(res[n-1])", "k = int(input())\r\n\r\n\r\ndef summacifr(x):\r\n summa = 0\r\n while x != 0:\r\n summa = summa + (x % 10)\r\n x = x // 10\r\n return summa\r\n\r\n\r\notv = 10\r\nwhile k > 0:\r\n otv = otv + 9\r\n if summacifr(otv) == 10:\r\n k = k - 1\r\nprint(otv)", "import math\r\n\r\n\r\ndef solve():\r\n k = int(input())\r\n start = 10\r\n cnt = 0\r\n while cnt < k:\r\n\r\n start += 9\r\n if sum(list(map(int, str(start)))) == 10:\r\n cnt += 1\r\n\r\n print(start)\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "k=int(input())\r\ni=10\r\nwhile k!=0:\r\n i+=9\r\n if sum(map(int, str(i))) == 10:\r\n k -= 1\r\nprint(i)", "\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\nk=int(input())\r\ni=10\r\nwhile k:\r\n\ti+=9\r\n\tif sum(map(int,str(i)))==10:\r\n\t\tk-=1\r\nprint(i)\r\n", "n = int(input())\r\n\r\ndef sum_of_digits(n):\r\n count = 0\r\n while n > 0:\r\n count += n%10\r\n n //= 10\r\n return count\r\n\r\nanum = 19\r\nwhile n > 1:\r\n anum += 9\r\n if sum_of_digits(anum) == 10:\r\n n -= 1\r\n\r\nprint(anum)", "n = int(input())\r\nc = 19\r\nwhile n>1:\r\n c += 9\r\n if sum(map(int, str(c)))==10:\r\n n -= 1\r\nprint(c)", "def digs(num):\r\n c = 0\r\n while num > 0:\r\n c += (num % 10)\r\n num //= 10\r\n return c == 10\r\n\r\n\r\nk = int(input())\r\nnum = 19\r\nind = 1\r\n\r\nwhile ind != k:\r\n num += 9\r\n if not digs(num):\r\n continue\r\n ind += 1\r\n\r\nprint(num)\r\n", "def get_num_of_digits(n):\r\n result = 0\r\n while n != 0:\r\n result += n % 10\r\n n //= 10\r\n return result\r\n\r\n\r\ndef solve(k):\r\n ans = 0\r\n while k != 0:\r\n ans += 1\r\n if get_num_of_digits(ans) == 10:\r\n k -= 1\r\n print(ans)\r\n\r\n\r\ndef main():\r\n k = int(input())\r\n solve(k)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "k = int(input())\ni = 10\nwhile k > 0:\n i += 9\n if sum([int(j) for j in str(i)]) == 10:\n k -= 1\nprint(i)\n\t\t \t \t\t\t\t\t \t \t \t\t \t\t\t \t", "import sys\r\nimport collections\r\n\r\ndef sm(n):\r\n ans = 0\r\n while n:\r\n ans += n % 10\r\n n //= 10\r\n return ans\r\n\r\nans = 0\r\nk = int(input().strip())\r\nwhile k:\r\n ans += 1\r\n if sm(ans) == 10:\r\n k -= 1\r\n\r\n\r\nprint(ans)\r\n", "n=int(input())\r\nfound=False\r\nm=19\r\nwhile not found:\r\n s=0\r\n for i in str(m):\r\n s+=int(i)\r\n if s==10:\r\n n-=1\r\n if n==0:\r\n print(m)\r\n found=True\r\n break\r\n m+=9", "k=int(input())\ni=10\nwhile k:\n\ti+=9\n\tif sum(map(int,str(i)))==10:\n\t\tk-=1\nprint(i)\n \n \t \t \t \t\t \t \t \t\t \t \t \t\t\t", "import sys, math, itertools, functools, collections\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\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 l = 0\r\n r = 10**18\r\n\r\n dp = [[[-1 for _ in range(2)] for _ in range(200)] for _ in range(20)]\r\n\r\n @functools.lru_cache(None)\r\n def countPerfectNumber(index, digitSum, tight, nums):\r\n if index == len(M):\r\n return digitSum == 10\r\n \r\n #if not tight and dp[index][digitSum][tight] != -1:\r\n #return dp[index][digitSum][tight]\r\n \r\n res = 0\r\n k = int(nums[index]) if tight else 9\r\n\r\n for d in range(k+1):\r\n res += countPerfectNumber(index + 1, digitSum + d, tight & (d == k), nums)\r\n\r\n #if not tight:\r\n #dp[index][digitSum][tight] = res\r\n return res\r\n\r\n\r\n while l != r:\r\n m = (l + r) >> 1\r\n M = str(m)\r\n if countPerfectNumber(0,0,True,M) >= k:\r\n r = m\r\n else:\r\n l = m + 1\r\n return l\r\n\r\nfor _ in range(test_case):\r\n k = ri()\r\n print(solve())", "k = int(input())\nx = 10\nwhile k > 0:\n x += 9\n if sum(map(int, str(x))) == 10:\n k -= 1\nprint(x)\n \t\t \t \t\t \t\t \t", "k = int(input())\nn, i = 19, 1\n\nwhile i < k:\n n += 9\n while sum(map(int, str(n))) != 10:\n n += 9\n i += 1\n\nprint(n)\n\n\t\t \t \t \t \t\t \t \t \t\t\t \t \t", "def val(num):\n sum = 0\n while(num!=0):\n sum+=num%10\n num//=10\n return True if sum==10 else False\n\n\nk = int(input());c = 1; b = 19\nwhile(True):\n \n if c==k:\n break\n else:\n b+=9\n if val(b):\n c+=1\n \n \nprint(b)\n\n\t \t \t\t \t \t\t\t\t \t \t \t\t \t\t", "n = int(input())\r\ni = 10; c = 1\r\nwhile True:\r\n i += 9\r\n d = sum(map(int,str(i)))\r\n if(d==10):\r\n if(c==n):ans = i; break\r\n c += 1\r\nprint(ans)\r\n", "k=int(input())\r\na=[]\r\nn='19'\r\nfor i in range(k):\r\n s=0\r\n while True:\r\n for i in range(len(n)):\r\n s+=int(n[i])\r\n if s==10:\r\n b=n\r\n n=str(int(n)+1) \r\n break\r\n else:\r\n n=str(int(n)+1)\r\n s=0 \r\n a.append(b)\r\nprint(a[k-1]) ", "k = int(input())\r\ncount = 0\r\ni = 19\r\ndef total(n):\r\n tot = 0\r\n n = str(n)\r\n for i in n:\r\n tot+=int(i)\r\n \r\n return tot\r\n\r\nwhile count < k:\r\n if total(i) == 10:\r\n count += 1\r\n if count == k:\r\n print(i)\r\n break\r\n i += 9", "k = int(input())\r\n# pnums = []\r\n\r\ndef digsum(n):\r\n dsum = 0\r\n while n>0 and dsum<11:\r\n dsum+=(n%10)\r\n n=n//10\r\n return dsum\r\n\r\ni = 19\r\ncount = 0\r\n\r\nwhile True:\r\n if digsum(i) == 10:\r\n count+=1\r\n if count == k:\r\n print(i)\r\n break\r\n i+=9\r\n", "k = int(input())\nstart = 10\nwhile k: \n start += 9\n if sum(map(int, str(start))) == 10:\n k -= 1\nprint(start)\n", "a=int(input())\r\ns=0\r\nfor i in range(10**8):\r\n\ti=str(i)\r\n\tif(s==a):\r\n\t\tprint(t)\r\n\t\tbreak\r\n\tc=0\r\n\tfor j in i:\r\n\t\tc=c+int(j)\r\n\tif(c==10):\r\n\t\tt=i\r\n\t\ts=s+1", "def sum(x):\r\n s=0\r\n while x>0 and s<11:\r\n s+=(x%10)\r\n x=x//10\r\n return s\r\nx=int(input())\r\ni=19\r\ncount=0\r\nwhile 1:\r\n if sum(i)==10:\r\n count+=1 \r\n if count==x:\r\n print(i)\r\n exit(0)\r\n i+=9\r\n", "kite=int(input())\ni=10\nwhile kite:\n\ti+=9\n\tif sum(map(int,str(i)))==10:\n\t\tkite-=1\nprint(i)\n\n\t\t\t \t\t\t \t\t \t\t \t \t\t \t \t\t \t\t", "def sumDigits(k):\r\n summ = 0\r\n while k != 0:\r\n summ += k % 10\r\n k //= 10\r\n return summ == 10\r\n\r\nk = int(input())\r\nc = 1\r\ni = 19\r\n\r\nwhile c != k:\r\n i += 9\r\n if sumDigits(i):\r\n c += 1\r\n \r\nprint(i)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef sum_digits(k):\r\n s = 0\r\n n = k\r\n while n:\r\n s += n % 10\r\n n//=10\r\n return s\r\n\r\nd = []\r\ni = 10\r\nwhile i < 11000000:\r\n if sum_digits(i) == 10:\r\n d.append(i)\r\n i += 9\r\n\r\nprint(d[int(input())-1])", "k = int(input())\r\ncount =0 \r\nx = 1\r\nans = 0\r\nwhile count<k:\r\n x_str = str(x)\r\n sum = 0\r\n for i in x_str:\r\n sum = sum + int(i)\r\n if sum == 10:\r\n count +=1\r\n ans = x \r\n x+= 1\r\nprint(ans)", "def sum(n):\r\n s = 0\r\n while n > 0 and s < 11:\r\n s += (n % 10)\r\n n = n // 10\r\n\r\n return s\r\n\r\n\r\nn = int(input())\r\ni = 19\r\nc = 0\r\nwhile 1:\r\n if sum(i) == 10:\r\n c += 1\r\n\r\n if c == n:\r\n print(i)\r\n exit(0)\r\n\r\n i += 9", "def sum_of_digits(n):\n s = 0\n while n:\n s += n % 10\n n //= 10\n return s\n\ni, pf, k = 1, 0, int(input())\nwhile pf != k:\n if sum_of_digits(i) == 10:\n pf += 1\n i += 1\nprint(i - 1)", "n = int(input())\r\ns=[]\r\nfor i in range(19,11**7,9):\r\n if sum(int(i) for i in list(str(i)))%10==0:\r\n s.append(i)\r\nprint(s[n-1])", "n = int(input())\r\nc = 10\r\nwhile n:\r\n c += 9\r\n s = 0\r\n if sum(map(int, str(c))) == 10:\r\n n -= 1\r\nprint(c)\r\n", "n = int(input())\r\ntec = 10\r\nwhile n > 0:\r\n tec += 9\r\n if sum(map(int, str(tec))) == 10:\r\n n -= 1\r\nprint(tec)", "def sumofdigits(n):\r\n s = 0 \r\n while(n != 0):\r\n s += n%10 \r\n n //= 10 \r\n return s\r\nk = int(input())\r\nc=0\r\nfor i in range(19, 11000000, 9):\r\n if(sumofdigits(i) == 10):\r\n c+=1\r\n if(c==k):\r\n print(i)\r\n break ", "k=int(input())\r\ni=1\r\nc=0\r\nwhile c<k:\r\n sum=0\r\n for x in str(i):\r\n sum+=int(x)\r\n if sum==10:\r\n c+=1\r\n i+=1\r\nprint(i-1)", "t=int(input())\r\na=19\r\nc=0\r\nwhile True:\r\n m=a\r\n req=0\r\n while m>0:\r\n req+=m%10\r\n m=m//10\r\n if req==10:\r\n c+=1\r\n if c==t:\r\n print(a)\r\n break\r\n a+=9\r\n \r\n", "import itertools\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nk = int(input())\r\ns = set()\r\nfor i in range(2, 9):\r\n p = [j for j in range(i)]\r\n for p0 in itertools.combinations_with_replacement(p, 10):\r\n x = [0] * i\r\n for j in p0:\r\n x[j] += 1\r\n if max(x) == 10:\r\n continue\r\n s.add(int(\"\".join(map(str, x))))\r\ns = list(s)\r\ns.sort()\r\nans = s[k - 1]\r\nprint(ans)", "k = int(input())\ns = 10\nwhile k>0:\n s+=9\n sum_of_digit = sum(int(i) for i in str(s))\n if sum_of_digit==10:\n k-=1\nprint(s)\n\n \t \t \t\t \t\t\t \t\t \t \t \t\t\t \t", "def sum_x(x):\r\n ret=0\r\n while x:\r\n ret+=x%10\r\n x//=10\r\n return ret\r\nn=int(input())\r\nc=0\r\nstart=1\r\nwhile True:\r\n if sum_x(start)==10:\r\n c+=1\r\n if c==n:\r\n print(start)\r\n break\r\n start+=1\r\n", "#import sys\r\n#sys.set_int_max_str_digits(10001)\r\n\r\ndef ok (x):\r\n r = 0\r\n while x > 0:\r\n r += (x % 10)\r\n x = x // 10\r\n \r\n return r == 10\r\n\r\na = input()\r\na = int (a)\r\nx = 1\r\nwhile a > 0:\r\n x += 9\r\n if ok(x):\r\n a -= 1\r\n \r\nprint (x)", "def sum_of_digits(n):\r\n sums = 0\r\n for i in str(n):\r\n sums += int(i)\r\n return sums\r\n\r\n\r\n\r\ndef main_function():\r\n n = int(input())\r\n starter = 19\r\n counter = 1\r\n start_zero_count = 0\r\n checker_count = 2\r\n checker = \"1\" + checker_count * \"0\"\r\n while n != counter:\r\n counter += 1\r\n starter += 9\r\n while sum_of_digits(starter) != 10:\r\n starter += 9\r\n print(starter)\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()", "def SumOfDigits(n):\r\n s = 0\r\n while n != 0:\r\n s += n % 10\r\n n = n // 10\r\n\r\n return s\r\n\r\n\r\nk = int(input())\r\ni = 0\r\nx = 10\r\nwhile i != k:\r\n x += 9\r\n if SumOfDigits(x) == 10:\r\n i += 1\r\n\r\nprint(x)", "arr = [0, 0, 0, 0, 0, 0, 0, 0, 0, 0]\r\n\r\ndef addOne(index:int):\r\n s = sum(arr[index:])\r\n if s < 10 and arr[index] < 9:\r\n arr[index] += 1\r\n arr[0] = 10 - s - 1\r\n else:\r\n arr[index] = 0\r\n addOne(index+1)\r\n\r\nn = int(input())\r\nwhile n:\r\n addOne(1)\r\n n -= 1\r\nprint(''.join(str(i) for i in reversed(arr)).lstrip('0'))", "def sumOfDigits(s):\r\n c = 0\r\n while s > 0:\r\n c += s % 10\r\n s //= 10\r\n\r\n return c\r\n\r\n\r\nk = int(input())\r\ns = 19\r\nwhile k > 1:\r\n s += 9\r\n if sumOfDigits(s) == 10:\r\n k -= 1\r\nprint(s)\r\n", "# Testing my old code if it works in PyPy\r\na = int(input())\r\nb = 19\r\ncounter = 1\r\nwhile counter != a:\r\n b += 9\r\n num = sum([int(i) for i in str(b)])\r\n if num != 10:\r\n continue\r\n else:\r\n counter += 1\r\nprint(b)", "from sys import stdin, stdout\r\ninput = stdin.readline\r\nprint = stdout.write\r\n\r\ndef perfect_number(num: int) -> bool:\r\n all_digits = 0\r\n while num:\r\n all_digits += num%10\r\n num = num//10\r\n \r\n return True if all_digits == 10 else False\r\n\r\n\r\nif __name__ == \"__main__\":\r\n k = int(input().strip())\r\n \r\n num = 19\r\n current_k = 1\r\n\r\n while current_k < k:\r\n num += 9\r\n if perfect_number(num):\r\n current_k += 1\r\n \r\n print(f\"{num}\\n\")", "def sum_of_digits(n):\r\n\tsum_dig= 0\r\n\twhile n:\r\n\t\tsum_dig += n%10\r\n\t\tn //= 10\r\n\r\n\treturn sum_dig\r\n\t\t\r\n\r\nk = int(input())\r\n\r\nno = 19\r\n\r\nwhile k:\r\n\tif sum_of_digits(no) == 10:\r\n\t\tk -= 1\r\n\r\n\tno += 1\r\n\r\nprint(no - 1)", "def f(x):\r\n\tt=0\r\n\twhile x:\r\n\t\tt+=x%10\r\n\t\tx//=10\r\n\treturn t\r\nm=int(input())\r\nx=19\r\nwhile m>1:\r\n\tx+=9\r\n\tif(f(x)==10):\r\n\t\tm-=1\r\nprint(x)\r\n", "from collections import deque\r\nls1=deque([19,28,37,46,55,64,73,82,91])\r\ndef spliting(x):\r\n ls=deque()\r\n for i in range(x+1):\r\n ls.append(str(i)+str(x-i))\r\n return ls\r\nfor j in range(1,10):\r\n tmplist=spliting(10-j)\r\n for k in tmplist:\r\n ls1.append(str(j)+k)\r\nfor u in range(1,10):\r\n for v in range(11-u):\r\n tmplist=spliting(10-u-v)\r\n for i in tmplist:\r\n ls1.append(str(u)+str(v)+i)\r\nfor u in range(1,10):\r\n for v in range(11-u):\r\n for d in range(11-u-v):\r\n tmplist=spliting(10-u-v-d)\r\n for i in tmplist:\r\n ls1.append(str(u)+str(v)+str(d)+i)\r\nfor u in range(1,10):\r\n for v in range(11-u):\r\n for d in range(11-u-v):\r\n for q in range(11-u-v-d):\r\n tmplist=spliting(10-u-v-d-q)\r\n for i in tmplist:\r\n ls1.append(str(u)+str(v)+str(d)+str(q)+i)\r\nfor u in range(1,10):\r\n for v in range(11-u):\r\n for d in range(11-u-v):\r\n for q in range(11-u-v-d):\r\n for h in range(11-u-v-d-q):\r\n tmplist=spliting(10-u-v-d-q-h)\r\n for i in tmplist:\r\n ls1.append(str(u)+str(v)+str(d)+str(q)+str(h)+i)\r\nfor u in range(1,10):\r\n for v in range(11-u):\r\n for d in range(11-u-v):\r\n for q in range(11-u-v-d):\r\n for h in range(11-u-v-d-q):\r\n for y in range(11-u-v-d-q-h):\r\n tmplist=spliting(10-u-v-d-q-h-y)\r\n for i in tmplist:\r\n ls1.append(str(u)+str(v)+str(d)+str(q)+str(h)+str(y)+i)\r\nn=int(input())\r\nprint(ls1[n-1])", "k = int(input())\r\ncurr = 19\r\ncount = 0\r\nwhile True:\r\n x = curr\r\n sum = 0\r\n while x:\r\n sum += x % 10\r\n x //= 10\r\n if sum == 10:\r\n count += 1\r\n if count == k:\r\n break\r\n curr += 9\r\nprint(curr)", "k = int(input())\r\n\r\nfor i in range(19, 20000000, 9):\r\n if sum(map(int, str(i))) == 10:\r\n k -= 1\r\n \r\n if k <= 0:\r\n print(i)\r\n break\r\n\r\n", "def summa(a):\r\n summa = 0\r\n while a:\r\n summa += a % 10\r\n a //= 10\r\n return summa\r\na = int(input())\r\ns = summa(a)\r\nk = 0\r\ni = 1\r\nwhile k < a:\r\n if summa(i) == 10:\r\n k += 1\r\n i += 1\r\nprint(i - 1)", "def is_perfect(number):\r\n sum_i = 0\r\n for char in number:\r\n sum_i += int(char)\r\n return True if sum_i == 10 else False\r\n \r\n \r\ndef solve():\r\n numbers = []\r\n for n in range(19, 90011 * 120, 9):\r\n if is_perfect(str(n)):\r\n numbers.append(n)\r\n k = int(input())\r\n print(numbers[k - 1])\r\n \r\n \r\nsolve()", "def cal(x):\n ans = 0\n while (x):\n ans += x % 10\n x = x // 10\n return ans\n\nn = int(input())\nres = 19\nn -= 1\nwhile(n):\n res += 9\n if cal(res) == 10:\n n -= 1\nprint(res)\n\t \t\t\t \t \t \t", "def getSum(n):\r\n sum = 0\r\n while (n != 0):\r\n sum = sum + (n % 10)\r\n n = n//10\r\n return sum\r\n\r\nk = int(input())\r\nn = 0\r\nt = []\r\nwhile len(t) != k:\r\n\tif getSum(n) == 10:\r\n\t\tt.append(n)\r\n\tn = n + 1\r\nprint(t[-1])\r\n\r\n", "def fun(x):\r\n t=0\r\n while(x):\r\n t+=x%10\r\n x//=10\r\n return t\r\n\r\nk=int(input())\r\np=10\r\nwhile(k):\r\n p+=9\r\n if fun(p) == 10:\r\n k-=1\r\nprint(p)\r\n", "k = int(input())\r\na = 10\r\nwhile k:\r\n a += 9\r\n if sum(map(int,str(a))) == 10:\r\n k -= 1\r\nprint(a)", "#@sorcerer_21\r\nfrom collections import *\r\nimport sys,math\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\ndef dsum(n):\r\n sm=0\r\n while n>0:\r\n sm+=n%10;n//=10\r\n return sm==10\r\nfor _ in range(1):\r\n n,=mapin()\r\n k=19\r\n while True:\r\n n-=1\r\n if n==0:break\r\n k+=9\r\n while dsum(k)==False:k+=9\r\n print(k)", "n=int(input())\r\ni=10\r\nwhile n:\r\n i+=9\r\n if sum(map(int,str(i)))==10:n-=1\r\nprint(i)", "n = int(input())\r\nm = 19\r\ncont = 0\r\n\r\n\r\nwhile True:\r\n k = m\r\n sum = 0\r\n while(k):\r\n sum += k % 10\r\n k = k // 10 \r\n \r\n if sum == 10:\r\n cont += 1\r\n if cont == n:\r\n break\r\n m += 9\r\n\r\nprint(m)\r\n\r\n\r\n", "def _input():\r\n return map(int, input().split())\r\n\r\ndef f():\r\n n = int(input())\r\n i = 10\r\n while n>0:\r\n i += 9\r\n if sum(map(int, str(i))) == 10: n-=1\r\n print(i)\r\n\r\n\r\n#for _ in range(int(input())):\r\nf()", "k = int(input())\r\ncnt = 10\r\nwhile k != 0:\r\n cnt += 9\r\n if sum(map(int, str(cnt))) == 10:\r\n k -= 1\r\nprint(cnt)", "def sum_digits (n):\r\n m = str(n)\r\n ans = 0 \r\n for i in m:\r\n ans += int(i)\r\n return ans\r\n \r\nn = int(input())\r\n\r\nanswer = 10\r\n\r\nwhile(n):\r\n answer += 9\r\n if sum_digits(answer) == 10:\r\n n-= 1 \r\n\r\nprint(answer)", "\r\ndef perfect(n):\r\n helper = 10\r\n while n > 0:\r\n helper += 9\r\n temp = list(str(helper))\r\n lst = [int(i) for i in temp]\r\n if sum(lst) == 10:\r\n n -= 1\r\n print(helper)\r\nn = int(input())\r\n\r\n\r\nlst_0 = [10000009, 10000018, 10000027, 10000036, 10000045, 10000054, 10000063, 10000072, 10000081, 10000090, 10000108, 10000117, 10000126, 10000135, 10000144, 10000153, 10000162, 10000171, 10000180, 10000207, 10000216, 10000225, 10000234, 10000243, 10000252, 10000261, 10000270, 10000306, 10000315, 10000324, 10000333, 10000342, 10000351, 10000360, 10000405, 10000414, 10000423, 10000432, 10000441, 10000450, 10000504, 10000513, 10000522, 10000531, 10000540, 10000603, 10000612, 10000621, 10000630, 10000702, 10000711, 10000720, 10000801, 10000810, 10000900, 10001008, 10001017, 10001026, 10001035, 10001044, 10001053, 10001062, 10001071, 10001080, 10001107, 10001116, 10001125, 10001134, 10001143, 10001152, 10001161, 10001170, 10001206, 10001215, 10001224, 10001233, 10001242, 10001251, 10001260, 10001305, 10001314, 10001323, 10001332, 10001341, 10001350, 10001404, 10001413, 10001422, 10001431, 10001440, 10001503, 10001512, 10001521, 10001530, 10001602, 10001611, 10001620, 10001701, 10001710, 10001800, 10002007, 10002016, 10002025, 10002034, 10002043, 10002052, 10002061, 10002070, 10002106, 10002115, 10002124, 10002133, 10002142, 10002151, 10002160, 10002205, 10002214, 10002223, 10002232, 10002241, 10002250, 10002304, 10002313, 10002322, 10002331, 10002340, 10002403, 10002412, 10002421, 10002430, 10002502, 10002511, 10002520, 10002601, 10002610, 10002700, 10003006, 10003015, 10003024, 10003033, 10003042, 10003051, 10003060, 10003105, 10003114, 10003123, 10003132, 10003141, 10003150, 10003204, 10003213, 10003222, 10003231, 10003240, 10003303, 10003312, 10003321, 10003330, 10003402, 10003411, 10003420, 10003501, 10003510, 10003600, 10004005, 10004014, 10004023, 10004032, 10004041, 10004050, 10004104, 10004113, 10004122, 10004131, 10004140, 10004203, 10004212, 10004221, 10004230, 10004302, 10004311, 10004320, 10004401, 10004410, 10004500, 10005004, 10005013, 10005022, 10005031, 10005040, 10005103, 10005112, 10005121, 10005130, 10005202, 10005211, 10005220, 10005301, 10005310, 10005400, 10006003, 10006012, 10006021, 10006030, 10006102, 10006111, 10006120, 10006201, 10006210, 10006300, 10007002, 10007011, 10007020, 10007101, 10007110, 10007200, 10008001, 10008010, 10008100, 10009000, 10010008, 10010017, 10010026, 10010035, 10010044, 10010053, 10010062, 10010071, 10010080, 10010107, 10010116, 10010125, 10010134, 10010143, 10010152, 10010161, 10010170, 10010206, 10010215, 10010224, 10010233, 10010242, 10010251, 10010260, 10010305, 10010314, 10010323, 10010332, 10010341, 10010350, 10010404, 10010413, 10010422, 10010431, 10010440, 10010503, 10010512, 10010521, 10010530, 10010602, 10010611, 10010620, 10010701, 10010710, 10010800, 10011007, 10011016, 10011025, 10011034, 10011043, 10011052, 10011061, 10011070, 10011106, 10011115, 10011124, 10011133, 10011142, 10011151, 10011160, 10011205, 10011214, 10011223, 10011232, 10011241, 10011250, 10011304, 10011313, 10011322, 10011331, 10011340, 10011403, 10011412, 10011421, 10011430, 10011502, 10011511, 10011520, 10011601, 10011610, 10011700, 10012006, 10012015, 10012024, 10012033, 10012042, 10012051, 10012060, 10012105, 10012114, 10012123, 10012132, 10012141, 10012150, 10012204, 10012213, 10012222, 10012231, 10012240, 10012303, 10012312, 10012321, 10012330, 10012402, 10012411, 10012420, 10012501, 10012510, 10012600, 10013005, 10013014, 10013023, 10013032, 10013041, 10013050, 10013104, 10013113, 10013122, 10013131, 10013140, 10013203, 10013212, 10013221, 10013230, 10013302, 10013311, 10013320, 10013401, 10013410, 10013500, 10014004, 10014013, 10014022, 10014031, 10014040, 10014103, 10014112, 10014121, 10014130, 10014202, 10014211, 10014220, 10014301, 10014310, 10014400, 10015003, 10015012, 10015021, 10015030, 10015102, 10015111, 10015120, 10015201, 10015210, 10015300, 10016002, 10016011, 10016020, 10016101, 10016110, 10016200, 10017001, 10017010, 10017100, 10018000, 10020007, 10020016, 10020025, 10020034, 10020043, 10020052, 10020061, 10020070, 10020106, 10020115, 10020124, 10020133, 10020142, 10020151, 10020160, 10020205, 10020214, 10020223, 10020232, 10020241, 10020250, 10020304, 10020313, 10020322, 10020331, 10020340, 10020403, 10020412, 10020421, 10020430, 10020502, 10020511, 10020520, 10020601, 10020610, 10020700, 10021006, 10021015, 10021024, 10021033, 10021042, 10021051, 10021060, 10021105, 10021114, 10021123, 10021132, 10021141, 10021150, 10021204, 10021213, 10021222, 10021231, 10021240, 10021303, 10021312, 10021321, 10021330, 10021402, 10021411, 10021420, 10021501, 10021510, 10021600, 10022005, 10022014, 10022023, 10022032, 10022041, 10022050, 10022104, 10022113, 10022122, 10022131, 10022140, 10022203, 10022212, 10022221, 10022230, 10022302, 10022311, 10022320, 10022401, 10022410, 10022500, 10023004, 10023013, 10023022, 10023031, 10023040, 10023103, 10023112, 10023121, 10023130, 10023202, 10023211, 10023220, 10023301, 10023310, 10023400, 10024003, 10024012, 10024021, 10024030, 10024102, 10024111, 10024120, 10024201, 10024210, 10024300, 10025002, 10025011, 10025020, 10025101, 10025110, 10025200, 10026001, 10026010, 10026100, 10027000, 10030006, 10030015, 10030024, 10030033, 10030042, 10030051, 10030060, 10030105, 10030114, 10030123, 10030132, 10030141, 10030150, 10030204, 10030213, 10030222, 10030231, 10030240, 10030303, 10030312, 10030321, 10030330, 10030402, 10030411, 10030420, 10030501, 10030510, 10030600, 10031005, 10031014, 10031023, 10031032, 10031041, 10031050, 10031104, 10031113, 10031122, 10031131, 10031140, 10031203, 10031212, 10031221, 10031230, 10031302, 10031311, 10031320, 10031401, 10031410, 10031500, 10032004, 10032013, 10032022, 10032031, 10032040, 10032103, 10032112, 10032121, 10032130, 10032202, 10032211, 10032220, 10032301, 10032310, 10032400, 10033003, 10033012, 10033021, 10033030, 10033102, 10033111, 10033120, 10033201, 10033210, 10033300, 10034002, 10034011, 10034020, 10034101, 10034110, 10034200, 10035001, 10035010, 10035100, 10036000, 10040005, 10040014, 10040023, 10040032, 10040041, 10040050, 10040104, 10040113, 10040122, 10040131, 10040140, 10040203, 10040212, 10040221, 10040230, 10040302, 10040311, 10040320, 10040401, 10040410, 10040500, 10041004, 10041013, 10041022, 10041031, 10041040, 10041103, 10041112, 10041121, 10041130, 10041202, 10041211, 10041220, 10041301, 10041310, 10041400, 10042003, 10042012, 10042021, 10042030, 10042102, 10042111, 10042120, 10042201, 10042210, 10042300, 10043002, 10043011, 10043020, 10043101, 10043110, 10043200, 10044001, 10044010, 10044100, 10045000, 10050004, 10050013, 10050022, 10050031, 10050040, 10050103, 10050112, 10050121, 10050130, 10050202, 10050211, 10050220, 10050301, 10050310, 10050400, 10051003, 10051012, 10051021, 10051030, 10051102, 10051111, 10051120, 10051201, 10051210, 10051300, 10052002, 10052011, 10052020, 10052101, 10052110, 10052200, 10053001, 10053010, 10053100, 10054000, 10060003, 10060012, 10060021, 10060030, 10060102, 10060111, 10060120, 10060201, 10060210, 10060300, 10061002, 10061011, 10061020, 10061101, 10061110, 10061200, 10062001, 10062010, 10062100, 10063000, 10070002, 10070011, 10070020, 10070101, 10070110, 10070200, 10071001, 10071010, 10071100, 10072000, 10080001, 10080010, 10080100, 10081000, 10090000, 10100008, 10100017, 10100026, 10100035, 10100044, 10100053, 10100062, 10100071, 10100080, 10100107, 10100116, 10100125, 10100134, 10100143, 10100152, 10100161, 10100170, 10100206, 10100215, 10100224, 10100233, 10100242, 10100251, 10100260, 10100305, 10100314, 10100323, 10100332, 10100341, 10100350, 10100404, 10100413, 10100422, 10100431, 10100440, 10100503, 10100512, 10100521, 10100530, 10100602, 10100611, 10100620, 10100701, 10100710, 10100800, 10101007, 10101016, 10101025, 10101034, 10101043, 10101052, 10101061, 10101070, 10101106, 10101115, 10101124, 10101133, 10101142, 10101151, 10101160, 10101205, 10101214, 10101223, 10101232, 10101241, 10101250, 10101304, 10101313, 10101322, 10101331, 10101340, 10101403, 10101412, 10101421, 10101430, 10101502, 10101511, 10101520, 10101601, 10101610, 10101700, 10102006, 10102015, 10102024, 10102033, 10102042, 10102051, 10102060, 10102105, 10102114, 10102123, 10102132, 10102141, 10102150, 10102204, 10102213, 10102222, 10102231, 10102240, 10102303, 10102312, 10102321, 10102330, 10102402, 10102411, 10102420, 10102501, 10102510, 10102600, 10103005, 10103014, 10103023, 10103032, 10103041, 10103050, 10103104, 10103113, 10103122, 10103131, 10103140, 10103203, 10103212, 10103221, 10103230, 10103302, 10103311, 10103320, 10103401, 10103410, 10103500, 10104004, 10104013, 10104022, 10104031, 10104040, 10104103, 10104112, 10104121, 10104130, 10104202, 10104211, 10104220, 10104301, 10104310, 10104400, 10105003, 10105012, 10105021, 10105030, 10105102, 10105111, 10105120, 10105201, 10105210, 10105300, 10106002, 10106011, 10106020, 10106101, 10106110, 10106200, 10107001, 10107010, 10107100, 10108000, 10110007, 10110016, 10110025, 10110034, 10110043, 10110052, 10110061, 10110070, 10110106, 10110115, 10110124, 10110133, 10110142, 10110151, 10110160, 10110205, 10110214, 10110223, 10110232, 10110241, 10110250, 10110304, 10110313, 10110322, 10110331, 10110340, 10110403, 10110412, 10110421, 10110430, 10110502, 10110511, 10110520, 10110601, 10110610, 10110700, 10111006, 10111015, 10111024, 10111033, 10111042, 10111051, 10111060, 10111105, 10111114, 10111123, 10111132, 10111141, 10111150, 10111204, 10111213, 10111222, 10111231, 10111240, 10111303, 10111312, 10111321, 10111330, 10111402, 10111411, 10111420, 10111501, 10111510, 10111600, 10112005, 10112014, 10112023, 10112032, 10112041, 10112050, 10112104, 10112113, 10112122, 10112131, 10112140, 10112203, 10112212, 10112221, 10112230, 10112302, 10112311, 10112320, 10112401, 10112410, 10112500, 10113004, 10113013, 10113022, 10113031, 10113040, 10113103, 10113112, 10113121, 10113130, 10113202, 10113211, 10113220, 10113301, 10113310, 10113400, 10114003, 10114012, 10114021, 10114030, 10114102, 10114111, 10114120, 10114201, 10114210, 10114300, 10115002, 10115011, 10115020, 10115101, 10115110, 10115200, 10116001, 10116010, 10116100, 10117000, 10120006, 10120015, 10120024, 10120033, 10120042, 10120051, 10120060, 10120105, 10120114, 10120123, 10120132, 10120141, 10120150, 10120204, 10120213, 10120222, 10120231, 10120240, 10120303, 10120312, 10120321, 10120330, 10120402, 10120411, 10120420, 10120501, 10120510, 10120600, 10121005, 10121014, 10121023, 10121032, 10121041, 10121050, 10121104, 10121113, 10121122, 10121131, 10121140, 10121203, 10121212, 10121221, 10121230, 10121302, 10121311, 10121320, 10121401, 10121410, 10121500, 10122004, 10122013, 10122022, 10122031, 10122040, 10122103, 10122112, 10122121, 10122130, 10122202, 10122211, 10122220, 10122301, 10122310, 10122400, 10123003, 10123012, 10123021, 10123030, 10123102, 10123111, 10123120, 10123201, 10123210, 10123300, 10124002, 10124011, 10124020, 10124101, 10124110, 10124200, 10125001, 10125010, 10125100, 10126000, 10130005, 10130014, 10130023, 10130032, 10130041, 10130050, 10130104, 10130113, 10130122, 10130131, 10130140, 10130203, 10130212, 10130221, 10130230, 10130302, 10130311, 10130320, 10130401, 10130410, 10130500, 10131004, 10131013, 10131022, 10131031, 10131040, 10131103, 10131112, 10131121, 10131130, 10131202, 10131211, 10131220, 10131301, 10131310, 10131400, 10132003, 10132012, 10132021, 10132030, 10132102, 10132111, 10132120, 10132201, 10132210, 10132300, 10133002, 10133011, 10133020, 10133101, 10133110, 10133200, 10134001, 10134010, 10134100, 10135000, 10140004, 10140013, 10140022, 10140031, 10140040, 10140103, 10140112, 10140121, 10140130, 10140202, 10140211, 10140220, 10140301, 10140310, 10140400, 10141003, 10141012, 10141021, 10141030, 10141102, 10141111, 10141120, 10141201, 10141210, 10141300, 10142002, 10142011, 10142020, 10142101, 10142110, 10142200, 10143001, 10143010, 10143100, 10144000, 10150003, 10150012, 10150021, 10150030, 10150102, 10150111, 10150120, 10150201, 10150210, 10150300, 10151002, 10151011, 10151020, 10151101, 10151110, 10151200, 10152001, 10152010, 10152100, 10153000, 10160002, 10160011, 10160020, 10160101, 10160110, 10160200, 10161001, 10161010, 10161100, 10162000, 10170001, 10170010, 10170100, 10171000, 10180000, 10200007, 10200016, 10200025, 10200034, 10200043, 10200052, 10200061, 10200070, 10200106, 10200115, 10200124, 10200133, 10200142, 10200151, 10200160, 10200205, 10200214, 10200223, 10200232, 10200241, 10200250, 10200304, 10200313, 10200322, 10200331, 10200340, 10200403, 10200412, 10200421, 10200430, 10200502, 10200511, 10200520, 10200601, 10200610, 10200700, 10201006, 10201015, 10201024, 10201033, 10201042, 10201051, 10201060, 10201105, 10201114, 10201123, 10201132, 10201141, 10201150, 10201204, 10201213, 10201222, 10201231, 10201240, 10201303, 10201312, 10201321, 10201330, 10201402, 10201411, 10201420, 10201501, 10201510, 10201600, 10202005, 10202014, 10202023, 10202032, 10202041, 10202050, 10202104, 10202113, 10202122, 10202131, 10202140, 10202203, 10202212, 10202221, 10202230, 10202302, 10202311, 10202320, 10202401, 10202410, 10202500, 10203004, 10203013, 10203022, 10203031, 10203040, 10203103, 10203112, 10203121, 10203130, 10203202, 10203211, 10203220, 10203301, 10203310, 10203400, 10204003, 10204012, 10204021, 10204030, 10204102, 10204111, 10204120, 10204201, 10204210, 10204300, 10205002, 10205011, 10205020, 10205101, 10205110, 10205200, 10206001, 10206010, 10206100, 10207000, 10210006, 10210015, 10210024, 10210033, 10210042, 10210051, 10210060, 10210105, 10210114, 10210123, 10210132, 10210141, 10210150, 10210204, 10210213, 10210222, 10210231, 10210240, 10210303, 10210312, 10210321, 10210330, 10210402, 10210411, 10210420, 10210501, 10210510, 10210600, 10211005, 10211014, 10211023, 10211032, 10211041, 10211050, 10211104, 10211113, 10211122, 10211131, 10211140, 10211203, 10211212, 10211221, 10211230, 10211302, 10211311, 10211320, 10211401, 10211410, 10211500, 10212004, 10212013, 10212022, 10212031, 10212040, 10212103, 10212112, 10212121, 10212130, 10212202, 10212211, 10212220, 10212301, 10212310, 10212400, 10213003, 10213012, 10213021, 10213030, 10213102, 10213111, 10213120, 10213201, 10213210, 10213300, 10214002, 10214011, 10214020, 10214101, 10214110, 10214200, 10215001, 10215010, 10215100, 10216000, 10220005, 10220014, 10220023, 10220032, 10220041, 10220050, 10220104, 10220113, 10220122, 10220131, 10220140, 10220203, 10220212, 10220221, 10220230, 10220302, 10220311, 10220320, 10220401, 10220410, 10220500, 10221004, 10221013, 10221022, 10221031, 10221040, 10221103, 10221112, 10221121, 10221130, 10221202, 10221211, 10221220, 10221301, 10221310, 10221400, 10222003, 10222012, 10222021, 10222030, 10222102, 10222111, 10222120, 10222201, 10222210, 10222300, 10223002, 10223011, 10223020, 10223101, 10223110, 10223200, 10224001, 10224010, 10224100, 10225000, 10230004, 10230013, 10230022, 10230031, 10230040, 10230103, 10230112, 10230121, 10230130, 10230202, 10230211, 10230220, 10230301, 10230310, 10230400, 10231003, 10231012, 10231021, 10231030, 10231102, 10231111, 10231120, 10231201, 10231210, 10231300, 10232002, 10232011, 10232020, 10232101, 10232110, 10232200, 10233001, 10233010, 10233100, 10234000, 10240003, 10240012, 10240021, 10240030, 10240102, 10240111, 10240120, 10240201, 10240210, 10240300, 10241002, 10241011, 10241020, 10241101, 10241110, 10241200, 10242001, 10242010, 10242100, 10243000, 10250002, 10250011, 10250020, 10250101, 10250110, 10250200, 10251001, 10251010, 10251100, 10252000, 10260001, 10260010, 10260100, 10261000, 10270000, 10300006, 10300015, 10300024, 10300033, 10300042, 10300051, 10300060, 10300105, 10300114, 10300123, 10300132, 10300141, 10300150, 10300204, 10300213, 10300222, 10300231, 10300240, 10300303, 10300312, 10300321, 10300330, 10300402, 10300411, 10300420, 10300501, 10300510, 10300600, 10301005, 10301014, 10301023, 10301032, 10301041, 10301050, 10301104, 10301113, 10301122, 10301131, 10301140, 10301203, 10301212, 10301221, 10301230, 10301302, 10301311, 10301320, 10301401, 10301410, 10301500, 10302004, 10302013, 10302022, 10302031, 10302040, 10302103, 10302112, 10302121, 10302130, 10302202, 10302211, 10302220, 10302301, 10302310, 10302400, 10303003, 10303012, 10303021, 10303030, 10303102, 10303111, 10303120, 10303201, 10303210, 10303300, 10304002, 10304011, 10304020, 10304101, 10304110, 10304200, 10305001, 10305010, 10305100, 10306000, 10310005, 10310014, 10310023, 10310032, 10310041, 10310050, 10310104, 10310113, 10310122, 10310131, 10310140, 10310203, 10310212, 10310221, 10310230, 10310302, 10310311, 10310320, 10310401, 10310410, 10310500, 10311004, 10311013, 10311022, 10311031, 10311040, 10311103, 10311112, 10311121, 10311130, 10311202, 10311211, 10311220, 10311301, 10311310, 10311400, 10312003, 10312012, 10312021, 10312030, 10312102, 10312111, 10312120, 10312201, 10312210, 10312300, 10313002, 10313011, 10313020, 10313101, 10313110, 10313200, 10314001, 10314010, 10314100, 10315000, 10320004, 10320013, 10320022, 10320031, 10320040, 10320103, 10320112, 10320121, 10320130, 10320202, 10320211, 10320220, 10320301, 10320310, 10320400, 10321003, 10321012, 10321021, 10321030, 10321102, 10321111, 10321120, 10321201, 10321210, 10321300, 10322002, 10322011, 10322020, 10322101, 10322110, 10322200, 10323001, 10323010, 10323100, 10324000, 10330003, 10330012, 10330021, 10330030, 10330102, 10330111, 10330120, 10330201, 10330210, 10330300, 10331002, 10331011, 10331020, 10331101, 10331110, 10331200, 10332001, 10332010, 10332100, 10333000, 10340002, 10340011, 10340020, 10340101, 10340110, 10340200, 10341001, 10341010, 10341100, 10342000, 10350001, 10350010, 10350100, 10351000, 10360000, 10400005, 10400014, 10400023, 10400032, 10400041, 10400050, 10400104, 10400113, 10400122, 10400131, 10400140, 10400203, 10400212, 10400221, 10400230, 10400302, 10400311, 10400320, 10400401, 10400410, 10400500, 10401004, 10401013, 10401022, 10401031, 10401040, 10401103, 10401112, 10401121, 10401130, 10401202, 10401211, 10401220, 10401301, 10401310, 10401400, 10402003, 10402012, 10402021, 10402030, 10402102, 10402111, 10402120, 10402201, 10402210, 10402300, 10403002, 10403011, 10403020, 10403101, 10403110, 10403200, 10404001, 10404010, 10404100, 10405000, 10410004, 10410013, 10410022, 10410031, 10410040, 10410103, 10410112, 10410121, 10410130, 10410202, 10410211, 10410220, 10410301, 10410310, 10410400, 10411003, 10411012, 10411021, 10411030, 10411102, 10411111, 10411120, 10411201, 10411210, 10411300, 10412002, 10412011, 10412020, 10412101, 10412110, 10412200, 10413001, 10413010, 10413100, 10414000, 10420003, 10420012, 10420021, 10420030, 10420102, 10420111, 10420120, 10420201, 10420210, 10420300, 10421002, 10421011, 10421020, 10421101, 10421110, 10421200, 10422001, 10422010, 10422100, 10423000, 10430002, 10430011, 10430020, 10430101, 10430110, 10430200, 10431001, 10431010, 10431100, 10432000, 10440001, 10440010, 10440100, 10441000, 10450000, 10500004, 10500013, 10500022, 10500031, 10500040, 10500103, 10500112, 10500121, 10500130, 10500202, 10500211, 10500220, 10500301, 10500310, 10500400, 10501003, 10501012, 10501021, 10501030, 10501102, 10501111, 10501120, 10501201, 10501210, 10501300, 10502002, 10502011, 10502020, 10502101, 10502110, 10502200, 10503001, 10503010, 10503100, 10504000, 10510003, 10510012, 10510021, 10510030, 10510102, 10510111, 10510120, 10510201, 10510210, 10510300, 10511002, 10511011, 10511020, 10511101, 10511110, 10511200, 10512001, 10512010, 10512100, 10513000, 10520002, 10520011, 10520020, 10520101, 10520110, 10520200, 10521001, 10521010, 10521100, 10522000, 10530001, 10530010, 10530100, 10531000, 10540000, 10600003, 10600012, 10600021, 10600030, 10600102, 10600111, 10600120, 10600201, 10600210, 10600300, 10601002, 10601011, 10601020, 10601101, 10601110, 10601200, 10602001, 10602010, 10602100, 10603000, 10610002, 10610011, 10610020, 10610101, 10610110, 10610200, 10611001, 10611010, 10611100, 10612000, 10620001, 10620010, 10620100, 10621000, 10630000, 10700002, 10700011, 10700020, 10700101, 10700110, 10700200, 10701001, 10701010, 10701100, 10702000, 10710001, 10710010, 10710100, 10711000, 10720000, 10800001, 10800010, 10800100]\r\nif n >= 8002:\r\n print(lst_0[n-8002])\r\nelse:\r\n perfect(n)", "class solution:\r\n\tdef __init__(self,k):\r\n\t\tself.k=k\r\n\tdef KthPerfectNumber(self):\r\n\t\tprev=[19,28,37,46,55,64,73,82,91]\r\n\t\tif self.k<10:\r\n\t\t\treturn prev[self.k-1]\r\n\t\tsize=9\r\n\t\twhile self.k>size:\r\n\t\t\tcurr=[]\r\n\t\t\ti=0\r\n\t\t\twhile i<size:\r\n\t\t\t\tstart=(prev[i]//10)*100+prev[i]%10\r\n\t\t\t\tcurr.append(start)\r\n\t\t\t\tend=prev[i]*10\r\n\t\t\t\twhile start!=end:\r\n\t\t\t\t\tstart+=9\r\n\t\t\t\t\tcurr.append(start)\r\n\t\t\t\ti+=1\r\n\t\t\tprev=curr\r\n\t\t\tself.k-=size\r\n\t\t\tsize=len(curr)\r\n\t\t#print(prev,self.k,size)\r\n\t\treturn prev[self.k-1]\r\n\r\nk=int(input())\r\ns=solution(k)\r\nprint(s.KthPerfectNumber())", "n=int(input())\nk=0\ni=0\nwhile k!=n:\n\n x=i\n Sum=0\n while x>0:\n Sum=Sum+x%10\n x=x//10\n\n pass\n\n if Sum==10:\n k+=1\n pass\n if k==n:\n print(i)\n break\n i+=1\n\t \t \t \t \t \t \t\t\t\t\t\t\t \t", "k = int(input())\r\ni = 10\r\nwhile k:\r\n i+=9\r\n if sum(map(int, str(i))) == 10:\r\n k-=1\r\nprint(i)", "n=int(input())\r\nnum=19\r\ndef ok(ni):\r\n out=0\r\n for i in str(ni):\r\n out+=int(i)\r\n if out>10:\r\n return 0\r\n if out==10:\r\n return 1\r\n return 0\r\nwhile n:\r\n if ok(num):\r\n n-=1\r\n num+=1\r\nprint(num-1)\r\n\r\n", "n = int(input())\r\nval = str(19)\r\n\r\nwhile n:\r\n summ = 0\r\n for i in range(len(val)):\r\n summ += (ord(val[i])-ord(str(0)))\r\n if summ==10:\r\n n-=1\r\n if not n: break\r\n val = str(int(val)+1)\r\nprint(val)", "from sys import stdin, stdout\r\nk = int(stdin.readline())\r\nnew_list = []\r\ncount = 0\r\nj = 1\r\nwhile(True):\r\n num = str(j)\r\n new_sum = 0\r\n for l in num:\r\n new_sum+=int(l)\r\n if new_sum==10:\r\n # new_list.append(j)\r\n count+=1 \r\n if count==k:\r\n stdout.write(f\"{j}\\n\");break;\r\n j+=1", "def find_kth_perfect(k):\r\n count = 0\r\n num = 19 # The first candidate perfect integer\r\n while True:\r\n digit_sum = 0\r\n temp = num\r\n while temp > 0:\r\n digit_sum += temp % 10\r\n temp //= 10\r\n if digit_sum == 10:\r\n count += 1\r\n if count == k:\r\n return num\r\n num += 9 # Skip numbers that can't be perfect (increment by 9)\r\n \r\nk = int(input())\r\nresult = find_kth_perfect(k)\r\nprint(result)\r\n", "l = [-1]*10001\r\n\r\ndef check(n):\r\n\tsum = 0\r\n\tfor i in str(n):\r\n\t\tsum += int(i)\r\n\tif sum==10:\r\n\t\treturn True\r\n\treturn False\r\n\r\nn = 19\r\nx = 1\r\nwhile True:\r\n\tif check(n)==True:\r\n\t\tl[x] = n\r\n\t\tx+= 1\r\n\tn+=1\r\n\tif x==10001: break\r\n\r\nprint(l[int(input())])", "# author: violist\n# created: 02.06.2022 12:07:14\n\nimport sys\ninput = sys.stdin.readline\n\ndef perfect(n):\n s = 0\n while (n):\n s += n % 10\n n //= 10\n return (s == 10)\n\nk = int(input())\ni = 0\nwhile (k):\n i += 1\n if (perfect(i)):\n k -= 1\nprint(i)\n", "n = int(input())\r\nnow = 10\r\nwhile n:\r\n now += 9\r\n if sum(map(int,str(now))) == 10:\r\n n -= 1\r\nprint(now)", "import math,sys,collections,bisect\n\n\ndef natural(n):\n\treturn n*(n+1)//2\n\ndef binarysearch(l,r,arr,k):\n\tif l<=r:\n\t\tm = (l+r)//2\n\t\tif arr[m]>=k:\n\t\t\treturn binarysearch(l,m-1,arr,k)\n\t\treturn binarysearch(m+1,r,arr,k)\n\treturn l\ndef ispossible(n):\n\n\th = 1\n\tnum = 2\n\tpre = 2\n\twhile num<=n:\n\t\tpre = num\n\t\th+=1\n\t\tnum+=(h*2)+h-1\n\treturn n-pre\n\ndef cal(n):\n\ttmp = 0\n\twhile n:\n\t\ttmp+=n%10\n\t\tn//=10\n\treturn tmp\ndef solve():\n\n\tn = int(input())\n\ti = 0\n\twhile n:\n\t\ti+=1\n\t\tif cal(i)==10:\n\t\t\tn-=1\n\tprint(i)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n# number of test cases\n\n\n#t = int(input())\nt = 1\nfor i in range(t):\n\tsolve()\n\n\n\n\n\n\n\n\n\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n k, i = int(input()), 0\n res = 0\n while i < k:\n res += 1\n while sum([int(x) for x in str(res)]) != 10:\n res += 1\n i += 1\n print(res)\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\ncount = 0\r\nfor i in range(19,100000000000,9):\r\n x = i\r\n sum = 0\r\n while x>0:\r\n sum+=x%10\r\n x//=10\r\n if sum!=10:\r\n continue\r\n else:\r\n count+=1\r\n if count == n:\r\n print(i)\r\n break\r\n", "k = int(input())\n\ni = 19\nwhile k > 1:\n i += 9\n s = 0\n c = i\n while c > 0:\n s += c % 10\n c //= 10\n if s == 10:\n k -= 1\nprint(i)\n\n", "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 bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict\r\n\r\n\r\ndef summ(n):\r\n return sum(int(i) for i in list(str(n)))\r\n\r\n\r\ndef solve():\r\n k = iinp()\r\n count = 0\r\n for i in range(19, 10**20, 9):\r\n if summ(i) == 10:\r\n count += 1\r\n if count == k:\r\n print(i)\r\n return\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()", "k=int(input())\r\nar=[ ]\r\ni=0\r\nc=0\r\nwhile(c<10000):\r\n x=19+9*(i)\r\n if(sum(map(int,list(str(x))))==10):\r\n ar.append(x)\r\n c+=1\r\n i+=1\r\nprint(ar[k-1])\r\n", "# Problem Link: https://codeforces.com/problemset/problem/919/B\r\n# Problem Status:\r\n# -------------------------- SEPARATOR --------------------------\r\ndef checkPerfectionism(A):\r\n A = str(A)\r\n Sum = 0\r\n for X in A:\r\n Sum += int(X)\r\n if Sum == 10:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\n# -------------------------- SEPARATOR --------------------------\r\n# Scanning The Input\r\nN = int(input())\r\nOrder = 1\r\nNumber = 19\r\nwhile Order < N:\r\n Number += 9\r\n if checkPerfectionism(Number):\r\n Order += 1\r\n# -------------------------- SEPARATOR --------------------------\r\nprint(Number)\r\n# -------------------------- SEPARATOR --------------------------\r\n", "def perfect(x): return True if sum([int(i) for i in str(x)]) == 10 else False\r\n\r\nstart = 19\r\ntotal = 1\r\nend = int(input())\r\n\r\nwhile total < end:\r\n start += 9\r\n if perfect(start) : total += 1\r\n\r\nprint(start)", "def digit_sum(n):\r\n s = 0\r\n while n != 0:\r\n d = n % 10\r\n s += d\r\n n = n // 10\r\n return s\r\n\r\nn = int(input())\r\nl = []\r\ni = 19\r\n\r\nwhile True:\r\n if digit_sum(i) == 10:\r\n l.append(i)\r\n n -= 1\r\n if n == 0:\r\n break\r\n i += 1\r\n\r\nprint(l[-1])\r\n", "k = int(input())\r\n\r\nit = 10\r\nnums = 0\r\n\r\n\r\nwhile nums < k:\r\n it += 9\r\n total = 0\r\n for i in str(it):\r\n total += int(i)\r\n if total == 10:\r\n nums += 1\r\n\r\nprint(it)\r\n", "n = int(input())\r\ndef s(n):\r\n r = 0\r\n while n:\r\n r += n%10\r\n n //= 10\r\n return r\r\na = 0\r\nfor i in range(10**8):\r\n if s(i) == 10:\r\n a += 1\r\n if a == n:\r\n print(i)\r\n break\r\n", "def digit_sum(n):\r\n sum = 0\r\n\r\n while n > 0:\r\n sum += n%10\r\n n = n//10\r\n\r\n return sum\r\n\r\nk = int(input())\r\n\r\nn = 19\r\nans = 0\r\n\r\nwhile True:\r\n if digit_sum(n) == 10:\r\n ans += 1\r\n \r\n if ans == k:\r\n break\r\n \r\n n += 9\r\n\r\n\r\nprint(n)", "k=int(input())\r\nf_val=19\r\nwhile k>1:\r\n f_val+=9\r\n if(sum(map(int,str(f_val)))==10):\r\n k-=1\r\nprint(f_val)\r\n \r\n ", "k = int(input())\r\ncount = 0\r\nfor i in range(19, 100000000, 9):\r\n if count == k:\r\n break\r\n s = list(str(i))\r\n\r\n summ = 0\r\n for x in s:\r\n summ += int(x)\r\n\r\n if summ == 10:\r\n count += 1\r\nprint(i-9)\r\n", "k = int(input())\r\ncount = 1\r\ncurrent_number = 19\r\n\r\nwhile count < k:\r\n current_number += 9\r\n if sum( list( int(x) for x in str(current_number) ) ) == 10:\r\n count += 1\r\n\r\nprint(current_number)\r\n", "def sum_digit(a):\r\n ans = 0\r\n while a > 0:\r\n ans+=a%10\r\n a//=10\r\n return ans\r\nk = int(input())\r\nn = 1\r\nwhile (k > 0):\r\n if sum_digit(n) == 10:\r\n k-=1\r\n n+=1\r\nprint(n - 1)# 1689108845.7244635", "def truee():\r\n l=sum(map(int,str(j)))\r\n if l==10:\r\n return 1\r\n return 0\r\nn=int(input())\r\nj=19\r\nk=1\r\nwhile k!=n:\r\n j+=9\r\n if truee()==1:\r\n k+=1\r\nprint(j)", "def SumDigits(n):\r\n total = 0\r\n while n != 0:\r\n total += n % 10\r\n n //= 10\r\n return total\r\n\r\n\r\nn = int(input())\r\ntotal = 19\r\na = []\r\ni = 0\r\nwhile i != n:\r\n if SumDigits(total + (i * 9)) != 10:\r\n total += 9\r\n i -= 1\r\n else:\r\n a.append(total + (i * 9))\r\n i += 1\r\nprint(a[-1])", "def compute(n):\r\n s=0\r\n while(n>0):\r\n s+=n%10\r\n n=n//10\r\n return s==10\r\nimport sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nfin=10\r\nwhile(n>0):\r\n fin+=9\r\n if(compute(fin)):\r\n n-=1\r\nprint(fin)\r\n", "k = int(input())\n\ndef isPerfect(s):\n result = 0\n for i in s:\n result += int(i)\n if result > 10:\n break\n\n return result == 10\n\ntmp = 19\ncount = 0\n\nwhile(count < k):\n if isPerfect(str(tmp)):\n count += 1\n tmp += 9\n\nprint(tmp - 9)\n \t \t\t \t\t \t \t\t \t \t \t \t\t\t \t \t", "from itertools import product, combinations\r\nfrom math import sqrt\r\n\r\ndef check(n):\r\n s = 0\r\n while (n):\r\n s += n % 10\r\n n //= 10\r\n return (s == 10)\r\n\r\n\r\nk = int(input())\r\ni = 19\r\nwhile k:\r\n if check(i):\r\n k -= 1\r\n i += 1\r\nprint(i - 1)\r\n", "k=int(input())\r\ni,f=0,0\r\nwhile i<1200020:\r\n s=str((9*i)+1)\r\n count=0\r\n for t in s:\r\n count+=int(t)\r\n if count==10:\r\n f+=1\r\n if f==k:\r\n print(s)\r\n exit()\r\n i+=1", "a = int(input())\r\nb,c = 0,19\r\narr = []\r\nwhile b < a:\r\n x = sum(list(map(int,list(str(c)))))\r\n if x == 10:\r\n arr.append(c)\r\n b += 1\r\n c += 9\r\nprint(arr[-1])", "n=int(input())\r\ndef sum_cal(num):\r\n s=0\r\n while(num):\r\n s+=num%10\r\n num=num//10\r\n return s\r\nnum=1\r\nwhile(n):\r\n num+=1\r\n if(sum_cal(num)==10):\r\n n-=1\r\n\r\nprint(num)\r\n\r\n", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nimport math\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\nans = 0\r\nstart = 19\r\nwhile ans < n:\r\n p = str(start)\r\n t = 0\r\n for i in p:\r\n t += int(i)\r\n if t%10 == 0 :\r\n ans += 1\r\n start += 9\r\nprint(start-9) \r\n", "n=int(input())\r\na=10\r\nwhile n:\r\n a+=9\r\n ch_a=str(a)\r\n s=sum(list(map(int,ch_a)))\r\n if s==10:\r\n n-=1\r\nprint(a)", "\r\n\r\n\r\ndef summ(m):\r\n\tans=0;\r\n\twhile(m>0):\r\n\t\t\r\n\t\tans+=m%10;m=m//10;\r\n\treturn ans;\r\n\r\n\r\n\r\nk=int(input());\r\n\r\ni=19;\r\nwhile(k>1):\r\n\t\r\n\ti+=9;\r\n\twhile(summ(i)!=10):i+=9;\r\n\tk-=1;\r\n\r\n\t\r\n\t\r\nprint(i);\r\n\r\n", "def f(str):\r\n sum=0\r\n for t in range(len(str)):\r\n sum+=int(str[t])\r\n return sum\r\na=19\r\ni=1\r\nx=int(input())\r\nwhile True:\r\n if i==x:\r\n break\r\n elif f(str(a+9))!=10:\r\n a+=9\r\n else:\r\n a+=9\r\n i+=1\r\nprint(a) ", "n = int(input())\r\ni = 10\r\nwhile(n):\r\n i+=9\r\n if sum(map(int, str(i)))==10:\r\n n-=1\r\nprint(i)", "t = int(input())\r\n\r\nn = 19\r\nk = 1\r\n\r\nwhile k != t:\r\n\tn += 1\r\n\tsum = 0\r\n\r\n\tstrn = str(n)\r\n\tfor i in range(len(strn)):\r\n\t\tsum += int(strn[i])\r\n\r\n\tif sum == 10:\r\n\t\tk += 1\r\nprint(n)\r\n", "i = 19\r\n\r\nk=int(input())\r\n\r\ncnt=0\r\nwhile(1):\r\n sum = 0\r\n kk = i\r\n while(kk):\r\n sum+=(kk%10)\r\n if(sum>10):\r\n break\r\n kk//=10\r\n\r\n if(sum == 10):\r\n cnt+=1\r\n if(cnt==k):\r\n print(i)\r\n break\r\n i+=1", "def range_100(srt, k):\r\n # print(\"\\t\\t\\t\\t\", srt)\r\n if not k: return srt\r\n i = srt\r\n while i < srt+100:\r\n if sum(list(map(int, str(i)))) == 10:\r\n k -= 1\r\n if not k: return i\r\n i += 8\r\n i += 1\r\n\r\n\r\ndef solve(k):\r\n if k < 10: return range_100(0, k)\r\n k -= 9\r\n i = 1\r\n while True:\r\n dig_sum = sum(list(map(int, list(str(i)))))\r\n if dig_sum == 10 and k == 1: return i*100\r\n while dig_sum > 10:\r\n # print(\"\\t\\t\\t\\t\\t\\t\", i*100)\r\n i += 1\r\n dig_sum = sum(list(map(int, list(str(i)))))\r\n if k <= 10-dig_sum+1: return range_100(i*100, k)\r\n k -= 10-dig_sum+1\r\n if not k: return i*100\r\n i += 1\r\n\r\nprint(solve(int(input())))", "def value(ind,digit,start,n):\r\n temp=(ind*(10**(digit)))\r\n temp+=10-ind\r\n while(start<n):\r\n trav=str(temp)\r\n sum=0\r\n for i in trav:\r\n sum+=int(i)\r\n if sum==10:\r\n start+=1\r\n if start==n:\r\n return temp\r\n \r\n temp+=9\r\n\r\n \r\n\r\ndef findrange(n):\r\n dp=[0]*11\r\n dp[0]=9\r\n if n<=9:\r\n ind,count,digit=0,0,3\r\n val=value(ind,digit-1,count,n)\r\n return val\r\n\r\n ind,count,digit=1,9,3\r\n for i in range(1,11):\r\n dp[i]=11-i\r\n while(count<=n):\r\n if ind==len(dp)-1:\r\n digit+=1\r\n ind=1\r\n continue\r\n prev=count\r\n count+=dp[ind]\r\n if count>=n:\r\n count=prev\r\n break\r\n \r\n for j in range(ind+1,len(dp)):\r\n dp[ind]+=dp[j]\r\n ind+=1\r\n val=value(ind,digit-1,count,n)\r\n return val\r\n\r\nn=int(input())\r\nout=findrange(n)\r\nprint(out)\r\n\r\n\r\n \r\n \r\n", "k=int(input())\r\ni=0\r\nwhile k>0:\r\n res=0\r\n i+=1\r\n temp=i\r\n while temp!=0:\r\n res+=temp%10\r\n temp=temp//10\r\n if res==10:\r\n k-=1\r\nprint(i)", "def isPerfect(n):\n sum = 0\n while(n>0):\n sum += n%10\n n = n//10\n if sum == 10:\n return True\n else:\n return False\n \ndef kthPerfect(k):\n start = 19\n count = 0\n while(True):\n if isPerfect(start):\n count += 1\n if count == k:\n return start\n start += 9\n\nk = int(input())\nprint(kthPerfect(k))\n \t\t \t \t\t \t \t\t \t \t \t\t\t\t \t\t\t\t", "def add(v):\r\n ss=0\r\n while v>0:\r\n ss+=v%10\r\n v=v//10\r\n return ss\r\nn=int(input())\r\na=19\r\ns=1\r\nwhile s<n:\r\n a+=1\r\n if add(a)==10:\r\n s+=1\r\n \r\n \r\nprint(a)", "k = int(input())\r\n\r\nc = 0 \r\n\r\nt = 19\r\n\r\nwhile c < k :\r\n s = 0 \r\n for el in str(t):\r\n s += int(el)\r\n \r\n if(s == 10):\r\n c += 1\r\n if(c == k):\r\n print(t)\r\n break \r\n else:\r\n t += 9", "import math\r\n\r\n\r\ndef sum_num(num):\r\n summary = 0\r\n while num > 0:\r\n summary += num % 10\r\n num //= 10\r\n return summary\r\n\r\n\r\ndef solve():\r\n k = int(input())\r\n num = 19\r\n while k - 1 > 0:\r\n num += 9\r\n if sum_num(num) == 10:\r\n k -= 1\r\n\r\n return num\r\n\r\n\r\nif __name__ == '__main__':\r\n print(solve())\r\n", "# author: ankan2526\r\n\r\nimport sys,math,heapq\r\ninput = sys.stdin.readline\r\nsys.setrecursionlimit(10**5)\r\n\r\nints = lambda : list(map(int,input().split()))\r\n#def gprint(t,ans=''): print(f\"Case #{t+1}:\",*ans)\r\np = 10**9+7\r\ninf = 10**20+7\r\n#alpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n#p2 = [1]\r\n#for i in range(70):p2.append(p2[-1]*2)\r\n#ANS=[]\r\n\r\nstore = []\r\ni = 1\r\nm = 10**4\r\nwhile m:\r\n x = 0\r\n y = i\r\n while y:\r\n x += y%10\r\n y//=10\r\n if x==10:\r\n m-=1\r\n store.append(i)\r\n i+=1\r\n\r\nprint(store[int(input())-1])\r\n", "def cal(num):\r\n total=0\r\n for x in str(num):\r\n total+=int(x)\r\n return total\r\n\r\nk=int(input())\r\nnum=18\r\nwhile k>0:\r\n num+=1\r\n if cal(num)==10:\r\n k-=1\r\nprint(num)", "def y(x):\r\n\tt=0\r\n\twhile x:\r\n\t\tt+=x%10\r\n\t\tx=x//10\r\n\treturn t\r\nk=int(input())\r\np=10\r\nwhile k>0:\r\n\tp+=9\r\n\tif y(p)==10:\r\n\t\tk-=1\r\n\t\t\r\nprint(p)", "k = int(input())\r\ncount = 0\r\ni = 19\r\ndef total(n):\r\n tot = 0\r\n while n > 0:\r\n tot += n % 10\r\n n //= 10\r\n return tot\r\n\r\nwhile count < k:\r\n if total(i) == 10:\r\n count += 1\r\n if count == k:\r\n print(i)\r\n break\r\n i += 9", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\ncnt = 0\r\nnum = 1\r\nprev = 0\r\nwhile cnt < n:\r\n e = list(str(num))\r\n som = 0\r\n for i in e:\r\n som += int(i)\r\n\r\n flag = 0\r\n if som == 10:\r\n cnt += 1\r\n prev = num\r\n\r\n num += 1\r\n\r\nprint(prev)", "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# input = sys.stdin.readline\r\n\r\nget_int = lambda: int(input())\r\nget_ints = lambda: map(int, input().split())\r\nget_ints_list = lambda: list(get_ints())\r\n\r\nn = int(input())\r\nr = 0\r\ni = 1\r\nwhile True:\r\n y = i\r\n x = 0\r\n while y:\r\n x += (y % 10)\r\n y //= 10\r\n if x == 10: r += 1\r\n if r == n:\r\n print(i)\r\n break\r\n i += 1\r\n", "def perfect_number(n):\r\n \"sum of digits of n is equal to 10\"\r\n if n == 0:\r\n return False\r\n else:\r\n sum_digits = 0\r\n while n > 0:\r\n sum_digits += n % 10\r\n n //= 10\r\n return sum_digits == 10\r\n\r\n\r\nk = int(input())\r\ni = 18\r\nwhile k:\r\n i += 1\r\n if perfect_number(i):\r\n k -= 1\r\nprint(i)\r\n", "# import time\ndef is_good(x):\n summ = 0\n while x:\n summ += x%10\n x = x // 10\n if summ == 10:\n return(1)\n else:\n return(0)\n# start = time.time() \nk = int(input())\nm = 19\nwhile k > 0:\n if is_good(m):\n k -= 1\n m += 9\nprint(m-9)\n# print(time.time() - start)\n ", "def good(n):\r\n c=0\r\n while n!=0:\r\n c+=n%10\r\n n//=10\r\n if c==10:\r\n return True\r\n return False\r\n\r\n\r\nn=int(input())\r\n\r\ni=0\r\nj=10\r\nwhile i<n:\r\n j+=9\r\n if good(j):\r\n i+=1\r\n\r\nprint(j)\r\n", "def sod(num):\n sum = 0\n while num > 0:\n sum += num % 10\n num = num // 10\n return sum\n\ndef find_perfect(k):\n num = 19\n while True:\n if sod(num) == 10:\n k -= 1\n if k == 0:\n return num\n num += 1\n\ndef main():\n k = int(input())\n print(find_perfect(k))\n\nmain()", "def digi(a):\r\n\ts=0\r\n\tfor i in map(int,str(a)):\r\n\t\ts+=i\r\n\treturn s\r\n\r\nx=int(input())\r\ni=10\r\nwhile x:\r\n\ti+=9\r\n\tif digi(i)==10:\r\n\t\tx-=1\r\nprint(i)\t", "k = int(input())\r\nc = 0\r\nfor i in range(19,1000000000, 9):\r\n a = [int(j) for j in str(i)]\r\n if sum(a) == 10:\r\n c += 1\r\n if c == k:\r\n print(i)\r\n break", "def getSum(n):\r\n sum = 0\r\n while (n != 0):\r\n sum = sum + (n % 10)\r\n n = n//10\r\n return sum\r\n\r\nn = int(input())\r\na = 19\r\nk = 1\r\n\r\nwhile k != n:\r\n a += 9\r\n if getSum(a) == 10:\r\n k+=1\r\n\r\nprint(a)\r\n", "def perfect_num(num):\r\n s=0\r\n while num>0 and s<11:\r\n s+=(num%10)\r\n num=num//10\r\n\r\n return s\r\n\r\nnum=int(input())\r\n\r\ni=19\r\ncnt=0\r\nwhile 1:\r\n if perfect_num(i)==10:\r\n cnt+=1\r\n\r\n if cnt==num:\r\n print(i)\r\n exit(0)\r\n\r\n i+=9", "def sumofdig(i):\r\n arr=[]\r\n while(i>0):\r\n temp=i%10\r\n arr.append(temp)\r\n i=i//10\r\n return sum(arr)\r\n\r\n\r\n\r\nk=int(input())\r\ncnt=1\r\ni=19\r\nans=0\r\nwhile(cnt<=k):\r\n\r\n if(sumofdig(i)==10):\r\n cnt+=1\r\n ans=i\r\n i+=9 \r\n else:\r\n i+=9\r\nprint(ans)\r\n\r\n ", "inp=int(input())\r\ninit=10\r\nwhile inp:\r\n init+=9\r\n if sum(map(int,str(init)))==10:inp-=1\r\nprint(init)\r\n\r\n\r\n#n=int(input())\r\n#sum1=0\r\n#p=n\r\n#while(n>0):\r\n# k=n%10\r\n# sum1+=k\r\n# n=n//10\r\n#print(p,abs(10-sum1),sep=\"\")\r\n", "def get_ints():\r\n return map(int, input().strip().split())\r\n\r\ndef get_list():\r\n return list(map(int, input().strip().split()))\r\n\r\ndef get_string():\r\n return input().strip()\r\n\r\n# n = int(input())\r\n# arr = [int(x) for x in input().split()]\r\n\r\nk = int(input().strip())\r\n\r\ndef is_perfect_number(x):\r\n digit_sum = 0\r\n while x > 0:\r\n digit_sum += x%10\r\n x = x//10\r\n return digit_sum == 10\r\n \r\ni = 0\r\ncurr = 19\r\n\r\nwhile i < k:\r\n if is_perfect_number(curr):\r\n i += 1\r\n curr += 1\r\n \r\nprint(curr-1)\r\n \r\n ", "n = int(input())\r\n\r\ndef digsum(x):\r\n sum = 0\r\n while (x):\r\n sum += x % 10\r\n x //= 10\r\n return sum\r\n\r\ncurr = 18\r\nwhile (n):\r\n curr += 1\r\n if digsum(curr) == 10:\r\n n -= 1\r\n # print(curr)\r\n\r\nprint(curr)", "def isPerfect(number):\n digit_sum = 0\n while number > 0:\n digit_sum += number % 10\n number //= 10\n return digit_sum == 10\n\n\nn = int(input())\nnums = []\nfor i in range(1, 11000000):\n if isPerfect(i):\n nums.append(i)\n\nprint(nums[n - 1])\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Nov 8 11:00:33 2023\r\n\r\n@author: lakne\r\n\"\"\"\r\n\r\nk = int(input())\r\n\r\nx = 10\r\ni = 0\r\n\r\nwhile i != k:\r\n digits_sum = 0\r\n x += 9\r\n digits = str(x)\r\n for digit in digits:\r\n digits_sum += int(digit)\r\n if digits_sum == 10:\r\n i += 1\r\n\r\nprint(x)\r\n", "import time\r\nh=[]\r\nf=int(input())\r\nt=time.time()\r\nfor i in range(10,10**8//9,9):\r\n u=sum(map(int, str(i)))\r\n if u==10:\r\n h.append(i)\r\nprint(h[f-1])\r\n#print(time.time()-t)", "s=[i for i in range(19,11**7,9) if sum(int(j) for j in list(str(i)))%10==0]\r\nprint(s[int(input())-1])", "k = int(input())\r\n\r\nn = 10\r\nwhile k > 0:\r\n n += 9\r\n\r\n s = 0\r\n for i in str(n):\r\n s += int(i)\r\n\r\n if s == 10:\r\n k -= 1\r\n\r\nprint(n)", "k=int(input())\r\na=19\r\nd=9\r\ni=1\r\ndef digit(a):\r\n ans=0\r\n while a:\r\n r=a%10\r\n ans+=r\r\n a=a//10\r\n return ans\r\nwhile i<k:\r\n a+=1\r\n if digit(a)==10:\r\n i+=1\r\nprint(a)", "def sum_digits(res):\r\n x=0\r\n while res>0:\r\n x +=res%10\r\n res = res // 10\r\n return x\r\nk=int(input())\r\nres=19\r\nk=k-1\r\nwhile k:\r\n res += 9\r\n if sum_digits(res) == 10:\r\n k-=1\r\nprint(res)", "def solve(x):\r\n ans = 0\r\n while x:\r\n ans += x % 10\r\n x //= 10\r\n\r\n if ans == 10:\r\n return True\r\n \r\n return False\r\n \r\nn = int(input())\r\nk = 1\r\ncount = 0\r\n\r\nwhile count < n:\r\n if solve(k):\r\n count += 1\r\n \r\n k += 9\r\n \r\nprint(k - 9)", "import math\r\nfrom collections import Counter, deque\r\nfrom sys import stdout\r\nimport time\r\nfrom math import factorial, log, gcd\r\nimport sys\r\n\r\n\r\ndef S():\r\n return sys.stdin.readline().split()\r\n\r\n\r\ndef I():\r\n return [int(i) for i in sys.stdin.readline().split()]\r\n\r\n\r\ndef II():\r\n return int(sys.stdin.readline())\r\n\r\n\r\ndef main():\r\n k = II()\r\n c = 0\r\n for j in range(10 ** 7 + 10000000):\r\n if sum([int(i) for i in str(j)]) == 10:\r\n c += 1\r\n if c == k:\r\n print(j)\r\n return \r\n\r\n\r\nif __name__ == '__main__':\r\n # for _ in range(II()):\r\n # main()\r\n main()", "n=int(input())\r\nx=19\r\ni=1\r\nwhile 1:\r\n t=x\r\n s=0\r\n while t:\r\n s+=(t%10)\r\n t=int(t/10)\r\n if s==10 and i==n:\r\n break\r\n elif s==10:\r\n i+=1\r\n # print(x, end=\" \")\r\n # print(s)\r\n x+=1\r\n # i+=1\r\nprint(x)", "k=int(input())\r\nll=list()\r\nfor i in range(1200020):\r\n s=str((9*i)+1)\r\n count=0\r\n for t in s:\r\n count+=int(t)\r\n if count==10:\r\n ll.append(s)\r\nprint(ll[k-1])", "# https://codeforces.com/problemset/problem/919/B\n\nk = int(input())\nvalues = [19]\n\ndef is_10(value):\n total = 0\n\n while value > 0:\n total += value % 10\n value //= 10\n\n return total == 10\n\nwhile len(values) != k:\n next_value = values[-1] + 9\n\n while not is_10(next_value):\n next_value += 9\n values.append(next_value)\n\nprint(values[-1])", "n1 = int(input())\r\nlist1 = []\r\nfor i in range(19,2*(10**7)):\r\n temp = 0\r\n for j in str(i):\r\n temp += int(j)\r\n if temp == 10:\r\n list1.append(i)\r\nprint(list1[n1-1])", "def f(x):\r\n t=0\r\n while x:\r\n\t t+=x%10\r\n\t x//=10\r\n return t\r\n \r\nm=int(input())\r\nn=19\r\nwhile m >1:\r\n\tn+=9\r\n\tif(f(n)==10):\r\n\t\tm-=1\r\nprint(n)\r\n", "n = int(input())\r\nk = 10\r\nwhile n:\r\n k+=9\r\n if sum(map(int,str(k)))==10:\r\n n-=1\r\nprint(k)", "def findNth(n):\r\n count = 0\r\n curr = 19\r\n while (True):\r\n sum = 0\r\n x = curr\r\n \r\n while (x > 0):\r\n sum = sum + x % 10\r\n x = int(x / 10)\r\n\r\n if (sum == 10):\r\n count += 1\r\n\r\n if (count == n):\r\n return curr\r\n\r\n curr += 9\r\n\r\nprint(findNth(int(input())))\r\n\r\n\r\n\r\n", "\r\nimport sys\r\n\r\nfrom io import BytesIO, IOBase\r\nimport os\r\n\r\nfrom types import GeneratorType\r\n\r\n\r\n\r\n################## pypy deep recursion handling ##############\r\n# Author = @pajenegod\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n to = f(*args, **kwargs)\r\n if stack:\r\n return to\r\n else:\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 return to\r\n to = stack[-1].send(to)\r\n\r\n return wrappedfunc\r\n\r\n\r\n################################ <fast I/O> ###########################################\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, **kwargs):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\n\r\n#############################################<I/O Region >##############################################\r\n\r\n\r\ndef inp():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef map_inp(v_type):\r\n return map(v_type, inp().split())\r\n\r\n\r\ndef list_inp(v_type):\r\n return list(map_inp(v_type))\r\n\r\n\r\n######################################## Solution ####################################\r\ndp = []\r\n\r\n@bootstrap\r\ndef solve(pos, n, add, cur):\r\n if len(dp) > 100000:\r\n yield add\r\n if pos > n:\r\n if add == 10:\r\n dp.append(cur)\r\n yield add\r\n else:\r\n yield add\r\n res = 0\r\n for i in range(10):\r\n res += yield solve(pos + 1, 7, add + i, cur * 10 + i)\r\n yield res\r\n\r\nrest = [10000009, 10000018, 10000027, 10000036, 10000045, 10000054, 10000063, 10000072, 10000081, 10000090, 10000108,\r\n 10000117, 10000126, 10000135, 10000144, 10000153, 10000162, 10000171, 10000180, 10000207, 10000216, 10000225,\r\n 10000234, 10000243, 10000252, 10000261, 10000270, 10000306, 10000315, 10000324, 10000333, 10000342, 10000351,\r\n 10000360, 10000405, 10000414, 10000423, 10000432, 10000441, 10000450, 10000504, 10000513, 10000522, 10000531,\r\n 10000540, 10000603, 10000612, 10000621, 10000630, 10000702, 10000711, 10000720, 10000801, 10000810, 10000900,\r\n 10001008, 10001017, 10001026, 10001035, 10001044, 10001053, 10001062, 10001071, 10001080, 10001107, 10001116,\r\n 10001125, 10001134, 10001143, 10001152, 10001161, 10001170, 10001206, 10001215, 10001224, 10001233, 10001242,\r\n 10001251, 10001260, 10001305, 10001314, 10001323, 10001332, 10001341, 10001350, 10001404, 10001413, 10001422,\r\n 10001431, 10001440, 10001503, 10001512, 10001521, 10001530, 10001602, 10001611, 10001620, 10001701, 10001710,\r\n 10001800, 10002007, 10002016, 10002025, 10002034, 10002043, 10002052, 10002061, 10002070, 10002106, 10002115,\r\n 10002124, 10002133, 10002142, 10002151, 10002160, 10002205, 10002214, 10002223, 10002232, 10002241, 10002250,\r\n 10002304, 10002313, 10002322, 10002331, 10002340, 10002403, 10002412, 10002421, 10002430, 10002502, 10002511,\r\n 10002520, 10002601, 10002610, 10002700, 10003006, 10003015, 10003024, 10003033, 10003042, 10003051, 10003060,\r\n 10003105, 10003114, 10003123, 10003132, 10003141, 10003150, 10003204, 10003213, 10003222, 10003231, 10003240,\r\n 10003303, 10003312, 10003321, 10003330, 10003402, 10003411, 10003420, 10003501, 10003510, 10003600, 10004005,\r\n 10004014, 10004023, 10004032, 10004041, 10004050, 10004104, 10004113, 10004122, 10004131, 10004140, 10004203,\r\n 10004212, 10004221, 10004230, 10004302, 10004311, 10004320, 10004401, 10004410, 10004500, 10005004, 10005013,\r\n 10005022, 10005031, 10005040, 10005103, 10005112, 10005121, 10005130, 10005202, 10005211, 10005220, 10005301,\r\n 10005310, 10005400, 10006003, 10006012, 10006021, 10006030, 10006102, 10006111, 10006120, 10006201, 10006210,\r\n 10006300, 10007002, 10007011, 10007020, 10007101, 10007110, 10007200, 10008001, 10008010, 10008100, 10009000,\r\n 10010008, 10010017, 10010026, 10010035, 10010044, 10010053, 10010062, 10010071, 10010080, 10010107, 10010116,\r\n 10010125, 10010134, 10010143, 10010152, 10010161, 10010170, 10010206, 10010215, 10010224, 10010233, 10010242,\r\n 10010251, 10010260, 10010305, 10010314, 10010323, 10010332, 10010341, 10010350, 10010404, 10010413, 10010422,\r\n 10010431, 10010440, 10010503, 10010512, 10010521, 10010530, 10010602, 10010611, 10010620, 10010701, 10010710,\r\n 10010800, 10011007, 10011016, 10011025, 10011034, 10011043, 10011052, 10011061, 10011070, 10011106, 10011115,\r\n 10011124, 10011133, 10011142, 10011151, 10011160, 10011205, 10011214, 10011223, 10011232, 10011241, 10011250,\r\n 10011304, 10011313, 10011322, 10011331, 10011340, 10011403, 10011412, 10011421, 10011430, 10011502, 10011511,\r\n 10011520, 10011601, 10011610, 10011700, 10012006, 10012015, 10012024, 10012033, 10012042, 10012051, 10012060,\r\n 10012105, 10012114, 10012123, 10012132, 10012141, 10012150, 10012204, 10012213, 10012222, 10012231, 10012240,\r\n 10012303, 10012312, 10012321, 10012330, 10012402, 10012411, 10012420, 10012501, 10012510, 10012600, 10013005,\r\n 10013014, 10013023, 10013032, 10013041, 10013050, 10013104, 10013113, 10013122, 10013131, 10013140, 10013203,\r\n 10013212, 10013221, 10013230, 10013302, 10013311, 10013320, 10013401, 10013410, 10013500, 10014004, 10014013,\r\n 10014022, 10014031, 10014040, 10014103, 10014112, 10014121, 10014130, 10014202, 10014211, 10014220, 10014301,\r\n 10014310, 10014400, 10015003, 10015012, 10015021, 10015030, 10015102, 10015111, 10015120, 10015201, 10015210,\r\n 10015300, 10016002, 10016011, 10016020, 10016101, 10016110, 10016200, 10017001, 10017010, 10017100, 10018000,\r\n 10020007, 10020016, 10020025, 10020034, 10020043, 10020052, 10020061, 10020070, 10020106, 10020115, 10020124,\r\n 10020133, 10020142, 10020151, 10020160, 10020205, 10020214, 10020223, 10020232, 10020241, 10020250, 10020304,\r\n 10020313, 10020322, 10020331, 10020340, 10020403, 10020412, 10020421, 10020430, 10020502, 10020511, 10020520,\r\n 10020601, 10020610, 10020700, 10021006, 10021015, 10021024, 10021033, 10021042, 10021051, 10021060, 10021105,\r\n 10021114, 10021123, 10021132, 10021141, 10021150, 10021204, 10021213, 10021222, 10021231, 10021240, 10021303,\r\n 10021312, 10021321, 10021330, 10021402, 10021411, 10021420, 10021501, 10021510, 10021600, 10022005, 10022014,\r\n 10022023, 10022032, 10022041, 10022050, 10022104, 10022113, 10022122, 10022131, 10022140, 10022203, 10022212,\r\n 10022221, 10022230, 10022302, 10022311, 10022320, 10022401, 10022410, 10022500, 10023004, 10023013, 10023022,\r\n 10023031, 10023040, 10023103, 10023112, 10023121, 10023130, 10023202, 10023211, 10023220, 10023301, 10023310,\r\n 10023400, 10024003, 10024012, 10024021, 10024030, 10024102, 10024111, 10024120, 10024201, 10024210, 10024300,\r\n 10025002, 10025011, 10025020, 10025101, 10025110, 10025200, 10026001, 10026010, 10026100, 10027000, 10030006,\r\n 10030015, 10030024, 10030033, 10030042, 10030051, 10030060, 10030105, 10030114, 10030123, 10030132, 10030141,\r\n 10030150, 10030204, 10030213, 10030222, 10030231, 10030240, 10030303, 10030312, 10030321, 10030330, 10030402,\r\n 10030411, 10030420, 10030501, 10030510, 10030600, 10031005, 10031014, 10031023, 10031032, 10031041, 10031050,\r\n 10031104, 10031113, 10031122, 10031131, 10031140, 10031203, 10031212, 10031221, 10031230, 10031302, 10031311,\r\n 10031320, 10031401, 10031410, 10031500, 10032004, 10032013, 10032022, 10032031, 10032040, 10032103, 10032112,\r\n 10032121, 10032130, 10032202, 10032211, 10032220, 10032301, 10032310, 10032400, 10033003, 10033012, 10033021,\r\n 10033030, 10033102, 10033111, 10033120, 10033201, 10033210, 10033300, 10034002, 10034011, 10034020, 10034101,\r\n 10034110, 10034200, 10035001, 10035010, 10035100, 10036000, 10040005, 10040014, 10040023, 10040032, 10040041,\r\n 10040050, 10040104, 10040113, 10040122, 10040131, 10040140, 10040203, 10040212, 10040221, 10040230, 10040302,\r\n 10040311, 10040320, 10040401, 10040410, 10040500, 10041004, 10041013, 10041022, 10041031, 10041040, 10041103,\r\n 10041112, 10041121, 10041130, 10041202, 10041211, 10041220, 10041301, 10041310, 10041400, 10042003, 10042012,\r\n 10042021, 10042030, 10042102, 10042111, 10042120, 10042201, 10042210, 10042300, 10043002, 10043011, 10043020,\r\n 10043101, 10043110, 10043200, 10044001, 10044010, 10044100, 10045000, 10050004, 10050013, 10050022, 10050031,\r\n 10050040, 10050103, 10050112, 10050121, 10050130, 10050202, 10050211, 10050220, 10050301, 10050310, 10050400,\r\n 10051003, 10051012, 10051021, 10051030, 10051102, 10051111, 10051120, 10051201, 10051210, 10051300, 10052002,\r\n 10052011, 10052020, 10052101, 10052110, 10052200, 10053001, 10053010, 10053100, 10054000, 10060003, 10060012,\r\n 10060021, 10060030, 10060102, 10060111, 10060120, 10060201, 10060210, 10060300, 10061002, 10061011, 10061020,\r\n 10061101, 10061110, 10061200, 10062001, 10062010, 10062100, 10063000, 10070002, 10070011, 10070020, 10070101,\r\n 10070110, 10070200, 10071001, 10071010, 10071100, 10072000, 10080001, 10080010, 10080100, 10081000, 10090000,\r\n 10100008, 10100017, 10100026, 10100035, 10100044, 10100053, 10100062, 10100071, 10100080, 10100107, 10100116,\r\n 10100125, 10100134, 10100143, 10100152, 10100161, 10100170, 10100206, 10100215, 10100224, 10100233, 10100242,\r\n 10100251, 10100260, 10100305, 10100314, 10100323, 10100332, 10100341, 10100350, 10100404, 10100413, 10100422,\r\n 10100431, 10100440, 10100503, 10100512, 10100521, 10100530, 10100602, 10100611, 10100620, 10100701, 10100710,\r\n 10100800, 10101007, 10101016, 10101025, 10101034, 10101043, 10101052, 10101061, 10101070, 10101106, 10101115,\r\n 10101124, 10101133, 10101142, 10101151, 10101160, 10101205, 10101214, 10101223, 10101232, 10101241, 10101250,\r\n 10101304, 10101313, 10101322, 10101331, 10101340, 10101403, 10101412, 10101421, 10101430, 10101502, 10101511,\r\n 10101520, 10101601, 10101610, 10101700, 10102006, 10102015, 10102024, 10102033, 10102042, 10102051, 10102060,\r\n 10102105, 10102114, 10102123, 10102132, 10102141, 10102150, 10102204, 10102213, 10102222, 10102231, 10102240,\r\n 10102303, 10102312, 10102321, 10102330, 10102402, 10102411, 10102420, 10102501, 10102510, 10102600, 10103005,\r\n 10103014, 10103023, 10103032, 10103041, 10103050, 10103104, 10103113, 10103122, 10103131, 10103140, 10103203,\r\n 10103212, 10103221, 10103230, 10103302, 10103311, 10103320, 10103401, 10103410, 10103500, 10104004, 10104013,\r\n 10104022, 10104031, 10104040, 10104103, 10104112, 10104121, 10104130, 10104202, 10104211, 10104220, 10104301,\r\n 10104310, 10104400, 10105003, 10105012, 10105021, 10105030, 10105102, 10105111, 10105120, 10105201, 10105210,\r\n 10105300, 10106002, 10106011, 10106020, 10106101, 10106110, 10106200, 10107001, 10107010, 10107100, 10108000,\r\n 10110007, 10110016, 10110025, 10110034, 10110043, 10110052, 10110061, 10110070, 10110106, 10110115, 10110124,\r\n 10110133, 10110142, 10110151, 10110160, 10110205, 10110214, 10110223, 10110232, 10110241, 10110250, 10110304,\r\n 10110313, 10110322, 10110331, 10110340, 10110403, 10110412, 10110421, 10110430, 10110502, 10110511, 10110520,\r\n 10110601, 10110610, 10110700, 10111006, 10111015, 10111024, 10111033, 10111042, 10111051, 10111060, 10111105,\r\n 10111114, 10111123, 10111132, 10111141, 10111150, 10111204, 10111213, 10111222, 10111231, 10111240, 10111303,\r\n 10111312, 10111321, 10111330, 10111402, 10111411, 10111420, 10111501, 10111510, 10111600, 10112005, 10112014,\r\n 10112023, 10112032, 10112041, 10112050, 10112104, 10112113, 10112122, 10112131, 10112140, 10112203, 10112212,\r\n 10112221, 10112230, 10112302, 10112311, 10112320, 10112401, 10112410, 10112500, 10113004, 10113013, 10113022,\r\n 10113031, 10113040, 10113103, 10113112, 10113121, 10113130, 10113202, 10113211, 10113220, 10113301, 10113310,\r\n 10113400, 10114003, 10114012, 10114021, 10114030, 10114102, 10114111, 10114120, 10114201, 10114210, 10114300,\r\n 10115002, 10115011, 10115020, 10115101, 10115110, 10115200, 10116001, 10116010, 10116100, 10117000, 10120006,\r\n 10120015, 10120024, 10120033, 10120042, 10120051, 10120060, 10120105, 10120114, 10120123, 10120132, 10120141,\r\n 10120150, 10120204, 10120213, 10120222, 10120231, 10120240, 10120303, 10120312, 10120321, 10120330, 10120402,\r\n 10120411, 10120420, 10120501, 10120510, 10120600, 10121005, 10121014, 10121023, 10121032, 10121041, 10121050,\r\n 10121104, 10121113, 10121122, 10121131, 10121140, 10121203, 10121212, 10121221, 10121230, 10121302, 10121311,\r\n 10121320, 10121401, 10121410, 10121500, 10122004, 10122013, 10122022, 10122031, 10122040, 10122103, 10122112,\r\n 10122121, 10122130, 10122202, 10122211, 10122220, 10122301, 10122310, 10122400, 10123003, 10123012, 10123021,\r\n 10123030, 10123102, 10123111, 10123120, 10123201, 10123210, 10123300, 10124002, 10124011, 10124020, 10124101,\r\n 10124110, 10124200, 10125001, 10125010, 10125100, 10126000, 10130005, 10130014, 10130023, 10130032, 10130041,\r\n 10130050, 10130104, 10130113, 10130122, 10130131, 10130140, 10130203, 10130212, 10130221, 10130230, 10130302,\r\n 10130311, 10130320, 10130401, 10130410, 10130500, 10131004, 10131013, 10131022, 10131031, 10131040, 10131103,\r\n 10131112, 10131121, 10131130, 10131202, 10131211, 10131220, 10131301, 10131310, 10131400, 10132003, 10132012,\r\n 10132021, 10132030, 10132102, 10132111, 10132120, 10132201, 10132210, 10132300, 10133002, 10133011, 10133020,\r\n 10133101, 10133110, 10133200, 10134001, 10134010, 10134100, 10135000, 10140004, 10140013, 10140022, 10140031,\r\n 10140040, 10140103, 10140112, 10140121, 10140130, 10140202, 10140211, 10140220, 10140301, 10140310, 10140400,\r\n 10141003, 10141012, 10141021, 10141030, 10141102, 10141111, 10141120, 10141201, 10141210, 10141300, 10142002,\r\n 10142011, 10142020, 10142101, 10142110, 10142200, 10143001, 10143010, 10143100, 10144000, 10150003, 10150012,\r\n 10150021, 10150030, 10150102, 10150111, 10150120, 10150201, 10150210, 10150300, 10151002, 10151011, 10151020,\r\n 10151101, 10151110, 10151200, 10152001, 10152010, 10152100, 10153000, 10160002, 10160011, 10160020, 10160101,\r\n 10160110, 10160200, 10161001, 10161010, 10161100, 10162000, 10170001, 10170010, 10170100, 10171000, 10180000,\r\n 10200007, 10200016, 10200025, 10200034, 10200043, 10200052, 10200061, 10200070, 10200106, 10200115, 10200124,\r\n 10200133, 10200142, 10200151, 10200160, 10200205, 10200214, 10200223, 10200232, 10200241, 10200250, 10200304,\r\n 10200313, 10200322, 10200331, 10200340, 10200403, 10200412, 10200421, 10200430, 10200502, 10200511, 10200520,\r\n 10200601, 10200610, 10200700, 10201006, 10201015, 10201024, 10201033, 10201042, 10201051, 10201060, 10201105,\r\n 10201114, 10201123, 10201132, 10201141, 10201150, 10201204, 10201213, 10201222, 10201231, 10201240, 10201303,\r\n 10201312, 10201321, 10201330, 10201402, 10201411, 10201420, 10201501, 10201510, 10201600, 10202005, 10202014,\r\n 10202023, 10202032, 10202041, 10202050, 10202104, 10202113, 10202122, 10202131, 10202140, 10202203, 10202212,\r\n 10202221, 10202230, 10202302, 10202311, 10202320, 10202401, 10202410, 10202500, 10203004, 10203013, 10203022,\r\n 10203031, 10203040, 10203103, 10203112, 10203121, 10203130, 10203202, 10203211, 10203220, 10203301, 10203310,\r\n 10203400, 10204003, 10204012, 10204021, 10204030, 10204102, 10204111, 10204120, 10204201, 10204210, 10204300,\r\n 10205002, 10205011, 10205020, 10205101, 10205110, 10205200, 10206001, 10206010, 10206100, 10207000, 10210006,\r\n 10210015, 10210024, 10210033, 10210042, 10210051, 10210060, 10210105, 10210114, 10210123, 10210132, 10210141,\r\n 10210150, 10210204, 10210213, 10210222, 10210231, 10210240, 10210303, 10210312, 10210321, 10210330, 10210402,\r\n 10210411, 10210420, 10210501, 10210510, 10210600, 10211005, 10211014, 10211023, 10211032, 10211041, 10211050,\r\n 10211104, 10211113, 10211122, 10211131, 10211140, 10211203, 10211212, 10211221, 10211230, 10211302, 10211311,\r\n 10211320, 10211401, 10211410, 10211500, 10212004, 10212013, 10212022, 10212031, 10212040, 10212103, 10212112,\r\n 10212121, 10212130, 10212202, 10212211, 10212220, 10212301, 10212310, 10212400, 10213003, 10213012, 10213021,\r\n 10213030, 10213102, 10213111, 10213120, 10213201, 10213210, 10213300, 10214002, 10214011, 10214020, 10214101,\r\n 10214110, 10214200, 10215001, 10215010, 10215100, 10216000, 10220005, 10220014, 10220023, 10220032, 10220041,\r\n 10220050, 10220104, 10220113, 10220122, 10220131, 10220140, 10220203, 10220212, 10220221, 10220230, 10220302,\r\n 10220311, 10220320, 10220401, 10220410, 10220500, 10221004, 10221013, 10221022, 10221031, 10221040, 10221103,\r\n 10221112, 10221121, 10221130, 10221202, 10221211, 10221220, 10221301, 10221310, 10221400, 10222003, 10222012,\r\n 10222021, 10222030, 10222102, 10222111, 10222120, 10222201, 10222210, 10222300, 10223002, 10223011, 10223020,\r\n 10223101, 10223110, 10223200, 10224001, 10224010, 10224100, 10225000, 10230004, 10230013, 10230022, 10230031,\r\n 10230040, 10230103, 10230112, 10230121, 10230130, 10230202, 10230211, 10230220, 10230301, 10230310, 10230400,\r\n 10231003, 10231012, 10231021, 10231030, 10231102, 10231111, 10231120, 10231201, 10231210, 10231300, 10232002,\r\n 10232011, 10232020, 10232101, 10232110, 10232200, 10233001, 10233010, 10233100, 10234000, 10240003, 10240012,\r\n 10240021, 10240030, 10240102, 10240111, 10240120, 10240201, 10240210, 10240300, 10241002, 10241011, 10241020,\r\n 10241101, 10241110, 10241200, 10242001, 10242010, 10242100, 10243000, 10250002, 10250011, 10250020, 10250101,\r\n 10250110, 10250200, 10251001, 10251010, 10251100, 10252000, 10260001, 10260010, 10260100, 10261000, 10270000,\r\n 10300006, 10300015, 10300024, 10300033, 10300042, 10300051, 10300060, 10300105, 10300114, 10300123, 10300132,\r\n 10300141, 10300150, 10300204, 10300213, 10300222, 10300231, 10300240, 10300303, 10300312, 10300321, 10300330,\r\n 10300402, 10300411, 10300420, 10300501, 10300510, 10300600, 10301005, 10301014, 10301023, 10301032, 10301041,\r\n 10301050, 10301104, 10301113, 10301122, 10301131, 10301140, 10301203, 10301212, 10301221, 10301230, 10301302,\r\n 10301311, 10301320, 10301401, 10301410, 10301500, 10302004, 10302013, 10302022, 10302031, 10302040, 10302103,\r\n 10302112, 10302121, 10302130, 10302202, 10302211, 10302220, 10302301, 10302310, 10302400, 10303003, 10303012,\r\n 10303021, 10303030, 10303102, 10303111, 10303120, 10303201, 10303210, 10303300, 10304002, 10304011, 10304020,\r\n 10304101, 10304110, 10304200, 10305001, 10305010, 10305100, 10306000, 10310005, 10310014, 10310023, 10310032,\r\n 10310041, 10310050, 10310104, 10310113, 10310122, 10310131, 10310140, 10310203, 10310212, 10310221, 10310230,\r\n 10310302, 10310311, 10310320, 10310401, 10310410, 10310500, 10311004, 10311013, 10311022, 10311031, 10311040,\r\n 10311103, 10311112, 10311121, 10311130, 10311202, 10311211, 10311220, 10311301, 10311310, 10311400, 10312003,\r\n 10312012, 10312021, 10312030, 10312102, 10312111, 10312120, 10312201, 10312210, 10312300, 10313002, 10313011,\r\n 10313020, 10313101, 10313110, 10313200, 10314001, 10314010, 10314100, 10315000, 10320004, 10320013, 10320022,\r\n 10320031, 10320040, 10320103, 10320112, 10320121, 10320130, 10320202, 10320211, 10320220, 10320301, 10320310,\r\n 10320400, 10321003, 10321012, 10321021, 10321030, 10321102, 10321111, 10321120, 10321201, 10321210, 10321300,\r\n 10322002, 10322011, 10322020, 10322101, 10322110, 10322200, 10323001, 10323010, 10323100, 10324000, 10330003,\r\n 10330012, 10330021, 10330030, 10330102, 10330111, 10330120, 10330201, 10330210, 10330300, 10331002, 10331011,\r\n 10331020, 10331101, 10331110, 10331200, 10332001, 10332010, 10332100, 10333000, 10340002, 10340011, 10340020,\r\n 10340101, 10340110, 10340200, 10341001, 10341010, 10341100, 10342000, 10350001, 10350010, 10350100, 10351000,\r\n 10360000, 10400005, 10400014, 10400023, 10400032, 10400041, 10400050, 10400104, 10400113, 10400122, 10400131,\r\n 10400140, 10400203, 10400212, 10400221, 10400230, 10400302, 10400311, 10400320, 10400401, 10400410, 10400500,\r\n 10401004, 10401013, 10401022, 10401031, 10401040, 10401103, 10401112, 10401121, 10401130, 10401202, 10401211,\r\n 10401220, 10401301, 10401310, 10401400, 10402003, 10402012, 10402021, 10402030, 10402102, 10402111, 10402120,\r\n 10402201, 10402210, 10402300, 10403002, 10403011, 10403020, 10403101, 10403110, 10403200, 10404001, 10404010,\r\n 10404100, 10405000, 10410004, 10410013, 10410022, 10410031, 10410040, 10410103, 10410112, 10410121, 10410130,\r\n 10410202, 10410211, 10410220, 10410301, 10410310, 10410400, 10411003, 10411012, 10411021, 10411030, 10411102,\r\n 10411111, 10411120, 10411201, 10411210, 10411300, 10412002, 10412011, 10412020, 10412101, 10412110, 10412200,\r\n 10413001, 10413010, 10413100, 10414000, 10420003, 10420012, 10420021, 10420030, 10420102, 10420111, 10420120,\r\n 10420201, 10420210, 10420300, 10421002, 10421011, 10421020, 10421101, 10421110, 10421200, 10422001, 10422010,\r\n 10422100, 10423000, 10430002, 10430011, 10430020, 10430101, 10430110, 10430200, 10431001, 10431010, 10431100,\r\n 10432000, 10440001, 10440010, 10440100, 10441000, 10450000, 10500004, 10500013, 10500022, 10500031, 10500040,\r\n 10500103, 10500112, 10500121, 10500130, 10500202, 10500211, 10500220, 10500301, 10500310, 10500400, 10501003,\r\n 10501012, 10501021, 10501030, 10501102, 10501111, 10501120, 10501201, 10501210, 10501300, 10502002, 10502011,\r\n 10502020, 10502101, 10502110, 10502200, 10503001, 10503010, 10503100, 10504000, 10510003, 10510012, 10510021,\r\n 10510030, 10510102, 10510111, 10510120, 10510201, 10510210, 10510300, 10511002, 10511011, 10511020, 10511101,\r\n 10511110, 10511200, 10512001, 10512010, 10512100, 10513000, 10520002, 10520011, 10520020, 10520101, 10520110,\r\n 10520200, 10521001, 10521010, 10521100, 10522000, 10530001, 10530010, 10530100, 10531000, 10540000, 10600003,\r\n 10600012, 10600021, 10600030, 10600102, 10600111, 10600120, 10600201, 10600210, 10600300, 10601002, 10601011,\r\n 10601020, 10601101, 10601110, 10601200, 10602001, 10602010, 10602100, 10603000, 10610002, 10610011, 10610020,\r\n 10610101, 10610110, 10610200, 10611001, 10611010, 10611100, 10612000, 10620001, 10620010, 10620100, 10621000,\r\n 10630000, 10700002, 10700011, 10700020, 10700101, 10700110, 10700200, 10701001, 10701010, 10701100, 10702000,\r\n 10710001, 10710010, 10710100, 10711000, 10720000, 10800001, 10800010, 10800100, 10801000]\r\n\r\nsolve(1, 4, 0, 0)\r\ndp += rest\r\nk = int(inp())\r\nprint(dp[k - 1])\r\n", "k = int(input())\r\n\r\ni = 0\r\ncount = 0\r\nwhile True:\r\n som = 0\r\n copy_i = i\r\n while copy_i > 0:\r\n som += copy_i % 10\r\n copy_i = copy_i // 10\r\n\r\n if som == 10:\r\n count += 1\r\n if count == k:\r\n print(i)\r\n break\r\n i += 1", "def digitSum(n):\r\n string = str(n)\r\n sum = 0\r\n for char in string:\r\n sum += int(char)\r\n return sum\r\n\r\nn = int(input())\r\nperfectNum = 0\r\nwhile n>0:\r\n perfectNum += 1\r\n ans = digitSum(perfectNum)\r\n if ans == 10:\r\n n -= 1\r\n\r\nprint(perfectNum)", "k = int(input())\r\ncount = 0\r\n\r\nans = 0\r\nidx = 1\r\ncount = 0\r\n\r\nwhile True:\r\n num = str(idx)\r\n cur_sum = 0\r\n for char in num:\r\n cur_sum += int(char)\r\n if cur_sum == 10:\r\n count += 1\r\n \r\n if count == k:\r\n ans = idx\r\n break\r\n idx += 1\r\nprint(ans)", "import sys\ninput = sys.stdin.readline\n\nN = int(input())\n\ntn = 10\nwhile N > 0 :\n tn += 9\n if sum(map(int, str(tn))) == 10 : N -= 1\nprint(tn)\n", "def s(z):\r\n t = 0\r\n while z:\r\n t += z%10\r\n z = z//10\r\n return t\r\nk = int(input())\r\nans = 19\r\nk-=1\r\nwhile k:\r\n ans += 9\r\n if s(ans) == 10:\r\n k-=1\r\nprint(ans)", "def checkPerf(k):\n ds=[int(ch) for ch in str(k)]\n if(sum(ds)==10):\n return True\n return False\ncnt=0\ni=0\nn=int(input())\n\nls=[]#ith,starting num\nls=[[1,19],[100, 1423], [200, 4006], [300, 10171], [400, 12223], [500, 18010], [600, 22231], [700, 30520], [800, 40150], [900, 51121], [1000, 100036], \n[1100, 102034], [1200, 106030], [1300, 112024], [1400, 120232], [1500, 126100], [1600, 140230], [1700, 170101], [1800, 202105], [1900, 210322], [2000, 220033], \n[2100, 230410], [2200, 261100], [2300, 303130], [2400, 313300], [2500, 333100], [2600, 402400], [2700, 421210], [2800, 504010], [2900, 602020], [3000, 1000027], [3100, 1002025], [3200, 1006021], [3300, 1012015], [3400, 1020223], [3500, 1026010], [3600, 1040221], [3700, 1070020], [3800, 1102060], [3900, 1110313], [4000, 1120024], [4100, 1130401], [4200, 1161010], [4300, 1203121], [4400, 1213210], [4500, 1233010], [4600, 1302310], [4700, 1321201], [4800, 1404001], [4900, 1502011], [5000, 2000008], [5100, 2002312], [5200, 2010700], [5300, 2020222], [5400, 2031211], [5500, 2100052], [5600, 2104111], [5700, 2120014], [5800, 2141002], [5900, 2204011], [6000, 2230003], [6100, 2310202], [6200, 2410102], [6300, 3000151], [6400, 3005101], [6500, 3020131], [6600, 3042100], [6700, 3106000], [6800, 3130210], [6900, 3211021], [7000, 3311020], [7100, 4000330], [7200, 4012012], [7300, 4100203], [7400, 4130002], [7500, 4301200], [7600, 5010031], [7700, 5103100], [7800, 6000121], [7900, 6200020], [8000, 9010000], [8100, 10001710], [8200, 10005310], [8300, 10011601], [8400, 10020151], [8500, 10025101], [8600, 10040131], [8700, 10062100], [8800, 10102024], \n[8900, 10110232], [9000, 10116100], [9100, 10130230], [9200, 10160101], [9300, 10203031], [9400, 10213102], [9500, 10232101], [9600, 10302202], [9700, 10321030], [9800, 10403020], [9900, 10501201], [10000, 10800100]]\n\nfor rank,beginNum in ls:\n \n if(n<rank):\n break\n i=beginNum\n cnt=rank\nwhile True:\n if(checkPerf(i)):\n if(cnt==n):\n print(i)\n break\n cnt+=1\n i+=1\n\t \t\t \t\t \t\t \t\t\t \t \t\t\t\t\t\t", "def isSum10(num):\r\n summ=0\r\n while num:\r\n summ+=num%10\r\n num=num//10\r\n if summ==10:\r\n return True\r\n else:\r\n return False\r\n\r\nnum=int(input())\r\ni=19\r\nwhile num>1:\r\n i+=9\r\n if isSum10(i):\r\n# print(i,end=' ')\r\n num-=1\r\n \r\nprint(i)" ]

[ "n,m,k=map(int,input().split())\r\nif k==n or m>(n-1)*(n-2)//2+n-k:print(-1)\r\nelse:\r\n\tbn=[int(i)-1 for i in input().split()]\r\n\tmkd,edg=[False]*n,[]\r\n\tfor i in bn:mkd[i]=True\r\n\tnbn=[i for i in range(n) if not mkd[i]]\r\n\tfor i in nbn:edg.append((bn[0],i))\r\n\tfor i in range(1,len(bn)):edg.append((nbn[0],bn[i]))\r\n\tfor i in range(n-1):\r\n\t\tfor j in range(i+1,n):\r\n\t\t\tif i!=bn[0] and j!=bn[0] and not(i==nbn[0] and mkd[j]) and not(j==nbn[0] and mkd[i]):\r\n\t\t\t\tedg.append((i,j))\r\n\tfor u,v in edg[:m]:\r\n\t\tprint(u+1,v+1)", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\nn, m, k = readln()\na = sorted(readln())\nif k == n:\n print(-1)\nelse:\n b = []\n for _ in range(1, n + 1):\n if _ not in a:\n b.append(_)\n uses = [[0]*(n + 1) for _ in range(n + 1)]\n if b[0] == 1:\n uses[a[0]][a[1]] = uses[a[1]][a[0]] = 1\n for _ in a:\n uses[_][a[0]] = uses[a[0]][_] = 1\n ans = []\n for i in range(1, n + 1):\n uses[i][i] = 1\n if not uses[b[0]][i]:\n ans.append((b[0], i))\n uses[b[0]][i] = uses[i][b[0]] = 1\n for i in range(1, n + 1):\n for j in range(i + 1, n + 1):\n if not uses[i][j]:\n ans.append((i, j))\n uses[i][j] = uses[j][i] = 1\n if len(ans) >= m:\n for e in ans[:m]:\n print(*e)\n else:\n print(-1)\n" ]

[ "def clean(d):\n ans = ['0']\n for c in list(d):\n ans.append(c)\n i = len(ans) - 1 #find last index\n while i > 1 and ans[i-2]== '0' and ans[i - 1] == '1' and ans[i] == '1':\n ans[i - 2] = '1'\n ans[i - 1] = '0'\n ans[i] = '0'\n i -= 2\n return ''.join(ans).lstrip('0')\n\na = clean(input())\nb = clean(input())\n#print(a)\n#print(b)\nif a == b:\n print('=')\nelif len(a) > len(b):\n print('>')\nelif len(a) < len(b):\n print('<')\nelif a > b: # now the length are equal\n print('>')\nelse:\n print('<')\n \t \t \t\t \t\t\t \t\t\t\t \t \t\t\t\t", "\nstrings = [ list(map(int, reversed(input()))) for _ in [1,2] ] # Oui ! Chiffre par chiffre...\n\nfor str in strings:\n while len(str) != 0 and str[-1] == 0:\n str.pop()\n str.append(0)\n str.append(0)\n\ndef compare(): # -1 <=> s0 < s1 ; 0 <=> s0 = s1 ; 1 <=> s0 < s1\n \n global strings\n \n for str in strings:\n ind = 0\n while ind < len(str):\n if str[ind] != 0:\n indSec = ind\n while str[indSec] != 0:\n indSec += 1\n for i in range(ind + ((indSec - ind) % 2), indSec):\n str[i] = 0\n for i in range(ind + 2 + ((indSec - ind) % 2), indSec + 1, 2):\n str[i] = 1\n ind += 1\n \n while len(str) != 0 and str[-1] == 0:\n str.pop()\n \n s0, s1 = strings\n \n if len(s0) < len(s1):\n return -1\n if len(s0) > len(s1):\n return 1\n \n for indComp in range(len(s0)-1, -1, -1):\n if s0[indComp] < s1[indComp]:\n return -1\n if s0[indComp] > s1[indComp]:\n return 1\n \n return 0\n\nval = compare()\nif val == -1:\n print(\"<\")\nif val == 0:\n print(\"=\")\nif val == 1:\n print(\">\")\n", "u = v = 0\n\na, b = input(), input()\n\nn, m = len(a), len(b)\n\nif n > m: b = '0' * (n - m) + b\n\nelse: a = '0' * (m - n) + a\n\nfor i in range(max(n, m)):\n\n u, v = v + u, u + int(a[i]) - int(b[i])\n\n if u > 1:\n\n print('>')\n\n exit(0)\n\n elif u < -1:\n\n print('<')\n\n exit(0)\n\nd = 2 * v + u\n\nif u == v == 0: print('=')\n\nelif u >= 0 and d >= 0: print('>')\n\nelif u <= 0 and d <= 0: print('<')\n\nelse: print('>' if (u * u > v * (v + u)) ^ (u < 0) else '<')\n\n\n\n# Made By Mostafa_Khaled", "def norm(d):\r\n res = ['0']\r\n for c in list(d):\r\n res.append(c)\r\n i = len(res) - 1\r\n while i > 1 and res[i - 2] == '0' and res[i - 1] == '1' and res[i] == '1':\r\n res[i - 2] = '1'\r\n res[i - 1] = '0'\r\n res[i] = '0'\r\n i -= 2\r\n return ''.join(res).lstrip('0')\r\n\r\na = norm(input())\r\nb = norm(input())\r\n\r\nif a == b:\r\n print('=')\r\nelif len(a) > len(b) or len(a) == len(b) and a > b:\r\n print('>')\r\nelse:\r\n print('<')" ]

[ "import sys\r\n\r\ndef solve():\r\n\tn, m = map(int, input().split())\r\n\tg = [[] for i in range(n+1)]\r\n\tE = [None]*m\r\n\tfor i in range(m):\r\n\t\tu, v = map(int, input().split())\r\n\t\tE[i] = (u, v)\r\n\t\tg[u].append([v,i])\r\n\t\tg[v].append([u,i])\r\n\tP = [-1]*(n+1)\r\n\tI = [0]*(n+1)\r\n\tst = []\r\n\tD = [0]*(n+1)\r\n\tW = [0]*(n+1)\r\n\tS = [-1]*m\r\n\tU = [-1]*m\r\n\tV = [-1]*(n+1)\r\n\tdef getp(x):\r\n\t\tif x == S[x]:\r\n\t\t\treturn x\r\n\t\tS[x] = getp(S[x])\r\n\t\treturn S[x]\r\n\tdef join(u, v):\r\n\t\tif u == -1:\r\n\t\t\treturn v\r\n\t\tu = getp(u)\r\n\t\tv = getp(v)\r\n\t\tif u == v:\r\n\t\t\treturn u\r\n\t\tif U[u] > U[v]:\r\n\t\t\tS[u] = v\r\n\t\t\treturn v\r\n\t\telse:\r\n\t\t\tS[v] = u\r\n\t\t\treturn u\r\n\tfor i in range(1, n+1):\r\n\t\tif P[i] >= 0:\r\n\t\t\tcontinue\r\n\t\tP[i] = 0\r\n\t\tD[i] = 0\r\n\t\tst.append(i)\r\n\t\twhile len(st) > 0:\r\n\t\t\tx = st[-1]\r\n\t\t\tp = P[x]\r\n\t\t\twhile I[x] < len(g[x]):\r\n\t\t\t\tv, w = g[x][I[x]]\r\n\t\t\t\tI[x] += 1\r\n\t\t\t\tif P[v] < 0:\r\n\t\t\t\t\tD[v] = D[x] + 1\r\n\t\t\t\t\tP[v] = x\r\n\t\t\t\t\tW[v] = w\r\n\t\t\t\t\tst.append(v)\r\n\t\t\t\t\tbreak\r\n\t\t\t\telif p != v and D[v] < D[x]:\r\n\t\t\t\t\tS[w] = w\r\n\t\t\t\t\tU[w] = D[v]\r\n\t\t\t\t\tV[x] = join(V[x], w)\r\n\t\t\telse:\r\n\t\t\t\tif V[x] >= 0:\r\n\t\t\t\t\tv = getp(V[x])\r\n\t\t\t\t\tif U[v] < D[x] - 1:\r\n\t\t\t\t\t\tV[p] = join(V[p], v)\r\n\t\t\t\tst.pop()\r\n\tF = [0]*m\r\n\tfor i in range(m):\r\n\t\tif S[i] >= 0:\r\n\t\t\tw = getp(i)\r\n\t\t\tF[w] += 1\r\n\tr = []\r\n\tfor i in range(m):\r\n\t\tif F[i] == 1:\r\n\t\t\tr.append(i)\r\n\t\t\tu, v = E[i]\r\n\t\t\tif D[u] < D[v]:\r\n\t\t\t\tu, v = v, u\r\n\t\t\twhile u != v:\r\n\t\t\t\tr.append(W[u])\r\n\t\t\t\tu = P[u]\r\n\tr.sort()\r\n\tprint(len(r))\r\n\tprint(' '.join(str(i+1) for i in r))\r\n\r\nsolve()\r\n" ]

[ "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\nBUFSIZE = 8192\r\n\r\n\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n\r\nclass Trie:\r\n class Node:\r\n def __init__(self, char: bool = False):\r\n self.char = char\r\n self.children = []\r\n self.counter = 1\r\n\r\n def __init__(self):\r\n self.root = Trie.Node()\r\n\r\n def add(self, word):\r\n node = self.root\r\n for char in word:\r\n found_in_child = False\r\n for child in node.children:\r\n if child.char == char:\r\n child.counter += 1\r\n node = child\r\n found_in_child = True\r\n break\r\n if not found_in_child:\r\n new_node = Trie.Node(char)\r\n node.children.append(new_node)\r\n node = new_node\r\n\r\n def query(self, prefix, root=None):\r\n if not root: root = self.root\r\n node = root\r\n if not root.children:\r\n return 0\r\n prefix = [prefix]\r\n for char in prefix:\r\n char_not_found = True\r\n for child in node.children:\r\n if child.char == char:\r\n char_not_found = False\r\n node = child\r\n break\r\n if char_not_found:\r\n return 0\r\n return node\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\ntr = Trie()\r\n\r\nst = set()\r\nfor i in a:\r\n if i in st:continue\r\n else:st.add(i)\r\n x = bin(i)[2:]\r\n x = \"0\"*(20 - len(x)) + x\r\n x = [True if k == \"1\" else False for k in x]\r\n tr.add(x)\r\n\r\ndef f(x):\r\n x = bin(x)[2:]\r\n x = \"0\" * (20 - len(x)) + x\r\n x = [True if k == \"1\" else False for k in x]\r\n node = tr.root\r\n ans = 0\r\n for i in range(20):\r\n cur = x[i]\r\n next = tr.query(cur, node)\r\n if next and next.counter == 2**(19-i):\r\n node = tr.query(not cur, node)\r\n ans += 2**(19-i)\r\n else:\r\n node = next\r\n return ans\r\n\r\ncur = -1\r\n\r\nfor _ in range(m):\r\n if cur == -1:\r\n cur = int(input())\r\n else:\r\n cur = cur ^ int(input())\r\n print(f(cur))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_trie():\r\n G0, G1, cnt = [-1], [-1], [0]\r\n return G0, G1, cnt\r\n\r\ndef insert(x, l):\r\n j = 0\r\n for i in range(l, -1, -1):\r\n cnt[j] += 1\r\n if x & pow2[i]:\r\n if G1[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G1[j] = len(cnt) - 1\r\n j = G1[j]\r\n else:\r\n if G0[j] == -1:\r\n G0.append(-1)\r\n G1.append(-1)\r\n cnt.append(0)\r\n G0[j] = len(cnt) - 1\r\n j = G0[j]\r\n cnt[j] += 1\r\n return\r\n\r\ndef xor_and_count_min(x, k, l):\r\n j = 0\r\n ans = 0\r\n for i in range(l, -1, -1):\r\n if not x & pow2[i]:\r\n if k & pow2[i]:\r\n if G0[j] ^ -1:\r\n ans += cnt[G0[j]]\r\n j = G1[j]\r\n else:\r\n j = G0[j]\r\n else:\r\n if k & pow2[i]:\r\n if G1[j] ^ -1:\r\n ans += cnt[G1[j]]\r\n j = G0[j]\r\n else:\r\n j = G1[j]\r\n return ans\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2) // 2\r\n if ok(m):\r\n c1 = m\r\n else:\r\n c2 = m\r\n m += 1\r\n while not ok(m):\r\n m -= 1\r\n return m\r\n\r\ndef ok(m):\r\n return True if xor_and_count_min(now, m, l) == m else False\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nG0, G1, cnt = binary_trie()\r\nl = 20\r\npow2 = [1]\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\nfor i in set(a):\r\n insert(i, l)\r\nans = []\r\nu = [-1] * pow2[l]\r\nnow = 0\r\nfor _ in range(m):\r\n x = int(input())\r\n now ^= x\r\n if u[now] == -1:\r\n z = binary_search(0, pow2[19])\r\n u[now] = z\r\n ans0 = u[now]\r\n ans.append(ans0)\r\nsys.stdout.write(\"\\n\".join(map(str, ans)))" ]

[ "def solve():\r\n x = int(input())\r\n l = []\r\n for i in range(x):\r\n a, b = map(int, input().split())\r\n l.append((a, b))\r\n l.sort(key=lambda p: p[0])\r\n for i in range(1, x):\r\n if l[i][1]-l[i-1][1] < 0:\r\n print('Happy Alex')\r\n return\r\n print('Poor Alex')\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "polje = []\nn = int(input())\nfor par in range(0, n):\n a,b = input().split(' ')\n polje.append([int(a),int(b)])\npolje.sort(key=lambda x:x[1],reverse=False)\ncheck = False\nfor x in range(0, n-1):\n if polje[x][0] > polje[x+1][0]:\n check = True\n break\n else:\n continue\nif check:\n print('Happy Alex')\nelse:\n print('Poor Alex')", "n=int(input())\r\nl=[]\r\nfor a in range(0,n):\r\n l.append(list(map(int,input().split())))\r\ndef key_function1(x):\r\n return x[0]\r\ndef key_function2(x):\r\n return x[1]\r\nl1=sorted(l,key=key_function1)\r\nl2=sorted(l,key=key_function2)\r\nprint(['Happy Alex','Poor Alex'][l1==l2])", "t = int(input())\r\nc = 0\r\nfor el in range(t):\r\n a , b = list(map(int , input().split()))\r\n if(a != b):\r\n c += 1 \r\n\r\nif(c > 0):\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')", "n=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n _,__=list(map(int,input().split()))\r\n a.append(_)\r\n b.append(__)\r\nc=[i for j, i in sorted(zip(a,b))]\r\nans=False\r\nfor i in range(1,n):\r\n if not (c[i]>=c[i-1]):\r\n ans=True\r\n break\r\nif ans:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n=int(input());l=[];l2=[];l3=[]\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n l.append([a,b]); l2.append(b);l3.append(a)\r\nl=dict(l);l3.sort();l2.sort()\r\nfor i in range(n):\r\n if l[l3[i]]!=l2[i]:\r\n print(\"Happy Alex\")\r\n exit()\r\nprint(\"Poor Alex\")", "l = []\r\nn = int(input())\r\nfor i in range(n):\r\n l.append([int(x) for x in input().split()])\r\nl1 = l.copy()\r\nl.sort()\r\nl1 = sorted(l,key= lambda x:x[1])\r\nif l==l1:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "n=int(input())\r\nprice=[]\r\nqulity=[]\r\ncount=0\r\nfor x in range(n):\r\n list1,list2=list(map(int,input().split()))\r\n price.append(list1)\r\n qulity.append(list2)\r\n\r\nfor x in range(n):\r\n if price[x]>qulity[x]:\r\n print(\"Happy Alex\")\r\n count+=1\r\n break\r\nif count==0:\r\n print(\"Poor Alex\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 24 10:59:11 2023\r\n\r\n@author: He'Bing'Ru\r\n\"\"\"\r\n\r\nn = int(input())\r\nflag = True\r\nfor i in range(n) :\r\n ls = input().split()\r\n if ls[0]!=ls[1]:\r\n flag = False\r\nif flag:\r\n print('Poor Alex')\r\nelse:\r\n print('Happy Alex')", "n = int(input())\r\n\r\nprice_list = []\r\nquality_list = []\r\ndict_of_price_quality = {}\r\n\r\nfor i in range(0, n):\r\n str_input = input()\r\n data_list = str_input.split()\r\n price_list.append(int(data_list[0]))\r\n quality_list.append(int(data_list[1]))\r\n dict_of_price_quality[price_list[-1]] = quality_list[-1]\r\n\r\nprice_list.sort()\r\nquality_list.sort()\r\n\r\nbool_vary = True\r\nfor i in range(0, n):\r\n if dict_of_price_quality[price_list[i]] != quality_list[i]:\r\n print('Happy Alex')\r\n bool_vary = False\r\n break\r\n\r\nif bool_vary:\r\n print('Poor Alex')", "n = int(input())\r\ndata = dict()\r\n\r\nfor i in range(1, n+1):\r\n price , quality = [int(number) for number in input().split()]\r\n data[i] = [price, quality]\r\n\r\nsort_by_price = sorted(data.items(), key=lambda laptop: laptop[1][0])\r\nsort_by_quality = sorted(data.items(), key=lambda laptop: laptop[1][1])\r\n\r\n\r\nif sort_by_price == sort_by_quality:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "n = int(input())\r\n\r\nlap = []\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n lap.append([a,b])\r\n\r\nlap.sort()\r\n\r\nfor i in range(1,n):\r\n if lap[i][1]<lap[i-1][1] and lap[i][0]!=lap[i-1][0]:\r\n print(\"Happy Alex\")\r\n exit()\r\n\r\n\r\nprint(\"Poor Alex\")", "n=int(input())\r\nd={}\r\nfor i in range(n):\r\n a,b=list(map(int,input().rstrip().split()))\r\n d[a]=b\r\na2=list(d.keys())\r\na2.sort()\r\nlst=[]\r\nfor i in a2:\r\n lst.append(d[i])\r\nlst2=list(lst)\r\nlst2.sort()\r\nif lst == lst2:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "x = int(input())\nm=0\nn=0\nfor i in range(x):\n a,b = map(int, input().split())\n if a>b:\n m +=1\n if a<b:\n n +=1\nif m>0 and n>0:\n print(\"Happy Alex\")\nelse:\n print(\"Poor Alex\")\n\t\t\t \t\t\t \t\t\t\t\t\t \t\t\t \t \t\t\t\t\t \t\t", "n=int(input())\r\nm=[[int(x) for x in input().split()] for i in range(n)]\r\nm.sort(reverse=True)\r\na=m[0]\r\nfor i in m[1:]:\r\n if i[1]>a[1]:\r\n print('Happy Alex')\r\n break\r\n a=i\r\nelse:\r\n print('Poor Alex')", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n A = []\r\n\r\n for _ in range(n):\r\n a, b = map(int, stdin.readline().split())\r\n A.append((a, b))\r\n\r\n A.sort()\r\n res = \"Poor Alex\"\r\n\r\n for i in range(1, len(A)):\r\n if A[i - 1][1] > A[i][1]:\r\n res = \"Happy Alex\"\r\n\r\n print(res)\r\n\r\n\r\nsolve()\r\n", "n = int(input())\r\nisTrue = True\r\n\r\nfor _ in range(n):\r\n a, b = input().split()\r\n if a != b:\r\n print(\"Happy Alex\")\r\n isTrue = False\r\n break\r\n\r\nif isTrue:\r\n print(\"Poor Alex\")", "n = int(input())\r\ndata = {}\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n data[a] = b\r\n\r\nto = list(data.keys())\r\nto.sort()\r\n\r\nans = []\r\n\r\nfor i in range(len(to)):\r\n ans.append(data[to[i]])\r\n\r\nif ans == sorted(ans):\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "n = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(tuple(map(int,input().split())))\r\nl.sort(reverse=True)\r\ncheck = False\r\nfor i in range(0,n-1):\r\n if l[i][1] < l[i+1][1]:\r\n print('Happy Alex')\r\n check = True\r\n break\r\nif not check:\r\n print(\"Poor Alex\")", "n = int(input())\r\nxs = []\r\nfor _ in range(n):\r\n\ta, b = map(int, input().split())\r\n\txs.append((a, b))\r\n\r\nxs.sort()\r\n# print(xs)\r\n\r\nalex = False\r\n\r\nfor i in range(len(xs) - 1):\r\n\tif xs[i][1] > xs[i + 1][1]:\r\n\t\talex = True\r\n\t\tbreak\r\n\r\n\t\t\r\nif alex:\r\n\tprint(\"Happy Alex\")\r\nelse:\r\n\tprint(\"Poor Alex\")\r\n", "n=int(input())\r\na,b=[],[]\r\nfor _ in range(n):\r\n x,y=list(map(int,input().split()))\r\n a.append(x)\r\n b.append(y)\r\ncost=[*range(n)]\r\nquality=[*range(n)]\r\ncost.sort(key=lambda x:a[x])\r\nquality.sort(key=lambda x:b[x])\r\nif cost==quality:\r\n print('Poor Alex')\r\nelse:\r\n print('Happy Alex')", "n = int(input())\nlaptops = []\nfor _ in range(n):\n laptops.append([int(x) for x in input().split()])\nlaptops.sort()\n\nfor i in range(n-1):\n if laptops[i][1] > laptops[i+1][1]:\n print('Happy Alex')\n exit()\nprint('Poor Alex')\n", "import sys\r\n\r\nnumLaptop = int(input())\r\npriceLap = []\r\nfor i in range(numLaptop):\r\n a, b = map(int, input().split())\r\n priceLap.append((a,b))\r\n\r\npriceLap.sort(key=lambda y: y[0])\r\n\r\nfor i in range(numLaptop-1):\r\n if(priceLap[i][1] > priceLap[i+1][1]):\r\n print(\"Happy Alex\")\r\n sys.exit()\r\nprint(\"Poor Alex\")", "class laptop:\r\n def __init__(self, value, quality):\r\n self.value = value\r\n self.quality = quality\r\n \r\n def __lt__(self, other):\r\n if self.value < other.value:\r\n return True\r\n return False\r\n \r\n def __le__(self, other):\r\n if self.value <= other.value:\r\n return True\r\n return False\r\n \r\n def __eq__(self, other):\r\n if self.value == other.value:\r\n return True\r\n return False\r\n \r\n def __ne__(self, other):\r\n if self.value != other.value:\r\n return True\r\n return False\r\n \r\n def __gt__(self, other):\r\n if self.value > other.value:\r\n return True\r\n return False\r\n \r\n def __ge__(self, other):\r\n if self.value >= other.value:\r\n return True\r\n return False\r\n\r\nn = int(input())\r\nlaptops = []\r\nfor i in range(n):\r\n line = input().split(' ')\r\n laptops.append(laptop(int(line[0]), int(line[1])))\r\nlaptops.sort()\r\nfor i in range(len(laptops) - 1):\r\n if laptops[i].quality > laptops[i + 1].quality:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')", "def solution():\r\n n = int(input())\r\n fl = False\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n if a != b:\r\n fl = True\r\n if fl:\r\n print(\"Happy Alex\")\r\n else:\r\n print(\"Poor Alex\")\r\n \r\n \r\nsolution()", "#https://codeforces.com/problemset/problem/456/A\r\n\r\ntest_cases = int(input())\r\nlaptops = []\r\nfound = False\r\nwhile test_cases > 0:\r\n attributes = [int(x) for x in input().split(' ')]\r\n laptops.append(attributes)\r\n test_cases -= 1\r\nlaptops.sort()\r\nlaptops_prices = sorted(laptops, key=lambda x : x[1])\r\nx = 1\r\nwhile x < len(laptops) and found == False:\r\n price = laptops_prices[x][0]\r\n if(price > laptops_prices[x-1][0]):\r\n last = price\r\n else:\r\n found = True\r\n x += 1\r\nif(found):\r\n answer = \"Happy Alex\"\r\nelse:\r\n answer = \"Poor Alex\"\r\nprint(answer)", "for Ram in range(1):\r\n d={}\r\n n=int(input())\r\n ans=\"Poor Alex\"\r\n for i in range(n):\r\n x,y=map(int,input().split())\r\n d[x]=y\r\n for i in range(1,n+1):\r\n if d[i]!=i:\r\n ans=\"Happy Alex\"\r\n break\r\nprint(ans)", "num = int(input())\r\nlap = []\r\nm = 0\r\nfor _ in range(num):\r\n x = list(map(int,input().split()))\r\n lap.append(x)\r\nlap.sort()\r\nfor i in range(1,num):\r\n if lap[i][1] < lap[0][1]:\r\n print(\"Happy Alex\")\r\n break\r\n\r\n lap[0][1] = lap[i][1]\r\nelse:\r\n print(\"Poor Alex\")\r\n", "t = int(input())\r\ns = \"Poor Alex\"\r\nfor _ in range(t):\r\n n,m=map(int,input().split())\r\n if n<m:\r\n s = \"Happy Alex\"\r\nprint(s) ", "def solve(n) -> str:\r\n for _ in range(n):\r\n x, y = input().split()\r\n if x != y:\r\n return 'Happy'\r\n \r\n return 'Poor'\r\n\r\nprint(solve(int(input())), 'Alex')\r\n", "# LUOGU_RID: 101570278\n(n,), *a = [[*map(int, s.split())] for s in open(0)]\r\nfor x, y in a:\r\n if y < x:\r\n exit(print('Happy Alex'))\r\nprint('Poor Alex')", "n = int(input())\r\nscore=[]\r\nfor i in range(n):\r\n score.append([int(y) for y in input().split()])\r\nfor i in range(n):\r\n if score[i][1] == score[i][0]:\r\n flag = 0\r\n else:\r\n flag = 1\r\n break\r\nprint('Happy Alex' if flag == 1 else 'Poor Alex')", "n = int(input())\nl = []\nfor i in range(n):\n\tx = [int(i) for i in input().split()]\n\tl.append(x)\n\nl.sort(key = lambda e: e[0]/e[1])\n\nif l[0][0] < l[-1][0] and l[0][1] > l[-1][1]:\n\tprint('Happy Alex')\nelse:\n\tprint('Poor Alex')\n", "n = int(input())\r\nlap = {}\r\nfor i in range(n):\r\n price, quality = map(int, input().split())\r\n lap[price] = quality\r\nl = sorted(lap.items())\r\na = False\r\nfor i in range(1,n):\r\n if l[i][1] < l[i-1][1]:\r\n a = True\r\n break \r\nprint(\"Happy Alex\" if a else \"Poor Alex\") ", "a=[None]*int(input())\r\nfor q in range(len(a)):\r\n r=[int(e)for e in input().split()]\r\n a[r[0]-1]=r[1]\r\nw='Poor Alex'\r\nfor q in range(1,len(a)):\r\n if a[q]<a[q-1]:\r\n w='Happy Alex'\r\n break\r\nprint(w)\r\n", "n=int(input())\r\nlaptops=[]\r\nfor _ in range(n):\r\n laptops.append(list(map(int,input().split(' '))))\r\nif sorted(laptops,key=lambda x:x[0])==sorted(laptops,key=lambda x:x[1]):\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "n = int(input())\r\n\r\ndef kye(value):\r\n return value[0] - value[1]\r\nins = sorted([[int(x) for x in input().split()] for j in range(n)] , key=kye)\r\nif ins[0][0] - ins[0][1] < 0 and ins[-1][0] - ins[-1][1] > 0:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 7 07:54:30 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\nflag=1\r\nlist1=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n list1.append([a,b])\r\nlist1=sorted(list1,key=lambda x:x[0])\r\nfor i in range(n-1):\r\n if list1[i][0]<list1[i+1][0] and list1[i][1]>list1[i+1][1]:\r\n flag=0\r\n break\r\n\r\n[print(\"Poor Alex\") if flag==1 else print(\"Happy Alex\")]\r\n \r\n ", "import sys\n\nn = int(input())\n\nif n == 1:\n print(\"Poor Alex\")\n sys.exit()\n\nlaptops = []\n\nfor _ in range(n):\n laptops.append(tuple(map(int, input().split())))\n\nlaptops.sort()\n\nmx = laptops[0][1]\n\nfor i in range(n):\n # print(f\"quality: {laptops[i][1]}\")\n if laptops[i][1] >= mx:\n mx = laptops[i][1]\n else:\n print(\"Happy Alex\")\n sys.exit()\n\nprint(\"Poor Alex\")\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\nd={}\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d[a]=b\r\nl1=sorted(d.keys())\r\nl2=[]\r\nfor i in l1:\r\n l2.append(d[i])\r\nl3=sorted(l2)\r\nif l2==l3:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "a=[]\r\nfor i in range(int(input())):a.append(list(map(int,input().split())))\r\na.sort()\r\nfor i in range(len(a)-1):\r\n if a[i][1]>a[i+1][1]:print(\"Happy Alex\");exit()\r\nprint(\"Poor Alex\")", "n = int(input())\nls = [[0]*2 for i in range(n)]\nfor i in range(n):\n temp = input().split(\" \")\n ls[i][0] = int(temp[0])\n ls[i][1] = int(temp[1])\n\nls = sorted(ls, key = lambda x: x[0])\n\nflag = 0\nfor i in range(1, n):\n if(ls[i-1][1] > ls[i][1]):\n print(\"Happy Alex\")\n flag = 1\n break\nif(flag == 0):\n print(\"Poor Alex\")\n", "a=\"Poor\"\r\nn = int(input())\r\nfor i in range(n):\r\n b = input().split()\r\n if b[0] != b[1]:\r\n a=\"Happy\"\r\nprint(a,\"Alex\")", "t = int(input())\r\nans = \"Poor Alex\"\r\nfor i in range(t):\r\n a , b = map(int,input().split())\r\n if(a!=b):\r\n ans=\"Happy Alex\"\r\n \r\nprint(ans)", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef getints(): return map(int,sys.stdin.readline().strip().split())\r\n\r\nfor _ in range(int(input())):\r\n x, y = getints()\r\n if x != y:\r\n print('Happy Alex')\r\n break\r\nelse: \r\n print('Poor Alex')\r\n", "for n in range(int(input())):\r\n a,b = input().split()\r\n if a != b:\r\n print(\"Happy Alex\")\r\n exit()\r\nprint(\"Poor Alex\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef main() -> None :\r\n LAPTOP_INFOS:list[list[int]] = [list(map(int, input().split())) for _ in range(int(input()))]\r\n\r\n isAlexCorrect:bool = False\r\n SORTED_LAPTOP_INFOS:list[list[int]] = sorted(LAPTOP_INFOS, key=lambda e:e[0], reverse=True)\r\n minQuality:int = SORTED_LAPTOP_INFOS[0][1]\r\n for laptopInfo in SORTED_LAPTOP_INFOS :\r\n if minQuality < laptopInfo[1] :\r\n isAlexCorrect = True\r\n break\r\n else :\r\n minQuality = laptopInfo[1]\r\n\r\n print([\"Poor Alex\", \"Happy Alex\"][isAlexCorrect])\r\n\r\nmain()", "t=int(input())\r\nbool=False\r\nfor i in range(t):\r\n m,n=map(int,input().split())\r\n if n>m:\r\n bool=True\r\nprint(\"Happy Alex\" if bool==True else \"Poor Alex\") ", "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 Laptops():\r\n n = inp()\r\n priceList = []\r\n qualityList = []\r\n\r\n for i in range(n):\r\n p,q = invr()\r\n priceList.append(p)\r\n qualityList.append(q)\r\n \r\n priceList_sorted = sorted(priceList)\r\n qualityList_acc = [y for x,y in sorted(zip(priceList,qualityList))]\r\n qualityList_sorted = sorted(qualityList)\r\n\r\n if qualityList_sorted == qualityList_acc:\r\n print(\"Poor Alex\")\r\n else:\r\n print(\"Happy Alex\")\r\n return\r\n\r\nLaptops()", "f = True\r\nmn = 10000000000000\r\nmx = 0\r\nfor _ in range(int(input())):\r\n p, q = map(int, input().split())\r\n if p < mn and q > mx and p < q:\r\n print(\"Happy Alex\")\r\n f = False\r\n break\r\nif f: print(\"Poor Alex\")", "\r\n\r\n\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n x,y = map(int,input().split())\r\n if x!=y:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')\r\n", "n=int(input())\r\narray=[]\r\nfor i in range(n):\r\n array1=list(map(int,input().split(\" \",1)))\r\n array.append(array1)\r\narray=sorted(array,key=lambda x:x[0])\r\nv=0\r\nfor m in range(n-1):\r\n if array[m][1]>array[m+1][1]:\r\n v=1\r\n print('Happy Alex')\r\n break\r\nif v==0:\r\n print('Poor Alex')", "laptops=[]\r\nfor i in range(int(input())):\r\n new=list(map(int,input().split()))\r\n if new[0]!=new[1]:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')", "ln = int(input())\r\nli = []\r\nfor i in range (ln): \r\n t1 , t2 = map(int,input().split())\r\n li.append( (t1 , t2) )\r\nfor i in range(ln):\r\n if li[i][1] > li[i][0]: print(\"Happy Alex\") ; break\r\nelse: print(\"Poor Alex\")", "n, mx = int(input()), 0\r\narr = sorted(list(map(int, input().split())) for _ in range(n))\r\nfor _, y in arr:\r\n if y < mx: exit(print('Happy Alex'))\r\n mx = y\r\nprint('Poor Alex')\r\n", "n = int(input())\r\n\r\nlaptops = []\r\nfor i in range(n):\r\n price, quality = map(int, input().split())\r\n laptops.append((price, quality))\r\n\r\nlaptops.sort(key=lambda x: x[0])\r\n\r\nfor i in range(n-1):\r\n if laptops[i][1] > laptops[i+1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "#https://codeforces.com/contest/456/problem/A\r\nd={}\r\nfor k in range(int(input())):\r\n a,b=list(map(int,input().split()))\r\n d[a]=b\r\n# print(d)\r\nmyDict =d\r\nmyKeys = list(myDict.keys())\r\nmyKeys.sort()\r\n# print(myKeys)\r\nsd={}\r\nfor item in myKeys:\r\n sd[item]=myDict[item]\r\n# print(sd)\r\nl2=[]\r\nfor j in sd.values():\r\n l2.append(j)\r\n# print(l2)\r\nif l2!=sorted(l2):\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n\r\n", "n = int(input())\r\nab = {}\r\nfor i in range(n):\r\n l = input().split()\r\n\r\n ab[int(l[0])] = int(l[1])\r\n\r\nk = list(ab.keys())\r\nk.sort()\r\n\r\nans = True\r\nfor j in range(len(k)-1):\r\n if ab[k[j]]>ab[k[j+1]]:\r\n ans = False\r\n\r\nif ans:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")\r\n\r\n\r\n", "import sys\nimport bisect\nimport heapq\nimport math\nfrom functools import lru_cache\nfrom collections import defaultdict,Counter\n\n\n#sys.setrecursionlimit(10**6)\ninput = sys.stdin.readline\nI = lambda: int(input())\nS = lambda: input()\nL = lambda: list(map(int, input().split()))\n###################################################\n\n\n\n\ndef solution(n, arr):\n arr = sorted(arr, key = lambda x:[x[0],x[1]])\n res = \"Poor Alex\"\n temp = dict()\n for price, qualtiy in arr:\n if price not in temp:\n temp[price] = [qualtiy, qualtiy]\n else:\n min_quality, max_quality = temp[price]\n temp[price] = [\n min(min_quality, qualtiy),\n max(max_quality, qualtiy)\n ]\n min_quality = float('inf')\n for price in sorted(temp.keys(),reverse=True):\n if temp[price][1]>min_quality:\n res=\"Happy Alex\"\n print(res)\n return\n min_quality = min(min_quality, temp[price][0])\n print(res)\n\n\n \n\n\nif __name__=='__main__':\n n = I()\n arr=[]\n for _ in range(n):\n arr.append(L())\n solution(n, arr)", "import sys\n\nnum = int(input())\nflag = False\nfor _ in range(num):\n price, quality = map(int, input().split())\n if price < quality:\n flag = True\n break\nif flag:\n print(\"Happy Alex\")\nelse:\n print(\"Poor Alex\")\n \t\t\t \t\t\t\t\t\t\t \t \t \t \t\t \t\t \t", "import sys\r\n\r\nm = 'Alex'\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n if x != y:\r\n print('Happy', m)\r\n sys.exit()\r\n\r\nprint('Poor', m)\r\n", "n = int(input())\r\nl = []\r\nwhile n>0:\r\n p,q = map(int,input().split())\r\n l.append(q/p)\r\n n -= 1\r\nf = 0\r\nfor i in range(len(l)):\r\n if l[i]<1:\r\n f= 1\r\n break\r\nif f>0:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')", "n = int(input())\r\n\r\n\r\nbestlapN = 0\r\nfor i in range(n):\r\n s = input().split(\" \")\r\n price = int(s[0])\r\n quality = int(s[1])\r\n if(price > quality):\r\n print(\"Happy Alex\")\r\n bestlapN = 1\r\n break\r\n\r\nif(bestlapN == 0):\r\n print(\"Poor Alex\")\r\n", "n = int(input())\r\nins = [[int(x) for x in input().split()] for j in range(n)]\r\nA1 = False\r\nA2 = True\r\n\r\nfor element in ins:\r\n if element[0] - element[1] < 0 :\r\n A1 = True\r\n elif element[0] - element[1] > 0:\r\n A2 = True\r\n if A1 and A2:\r\n break \r\n\r\nif A1 and A2:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "m = int(input())\r\nlis = []\r\nfor _ in range(m):\r\n lis.append(list(map(int,input().split())))\r\nlis = sorted(lis,key=lambda x:x[0])\r\nfor i in range(len(lis) - 1):\r\n if lis[i][0] < lis[i+1][0] and lis[i][1] > lis[i+1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "from operator import itemgetter\r\nn=int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\n \r\nb = sorted(arr, key=itemgetter(0))\r\n\r\nm = b[n-1][1]\r\n\r\nfor i in range(n-2, -1, -1):\r\n if b[i][1] > m and b[i][0] < b[i+1][0]:\r\n print('Happy Alex')\r\n break\r\n else:\r\n m=min(m, b[i][1])\r\nelse:\r\n print('Poor Alex')\r\n", "laptops = []\r\nn = int(input())\r\nfor _ in range(n):\r\n laptops.append(list(map(int, input().split())))\r\nlaptops.sort()\r\nfor i in range(n - 1):\r\n if laptops[i][0] < laptops[i + 1][0] and laptops[i][1] > laptops[i + 1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "import sys\r\ndef input():\r\n return sys.stdin.readline().strip()\r\ndef getints():\r\n return map(int,sys.stdin.readline().strip().split())\r\n\r\n\r\nn = int(input())\r\nc = [0]*n\r\nfor x in range(n):\r\n c[x] = list(getints())\r\nc.sort(key = lambda x : x[1])\r\n\r\nfor x in range(1,n):\r\n if c[x][0] < c[x-1][0]:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')", "n = int(input())\r\npc = sorted([tuple(map(int, input().split())) for _ in range(n)])\r\n\r\nbest_p = []\r\ntemp = pc[0]\r\nfor i in pc : \r\n if temp[0] == i[0]:\r\n if temp[1] < i[1]: temp = i\r\n else : \r\n best_p.append(temp)\r\n temp = i\r\n\r\nbest_p.append(temp)\r\n\r\nres = False\r\nfor i in range(len(best_p)-1) :\r\n if best_p[i][1] > best_p[i+1][1]:\r\n res = True\r\n print(\"Happy Alex\")\r\n break\r\n \r\nif not res : print(\"Poor Alex\")", "n = int(input())\r\ndic1 = {}\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n dic1[a]=b\r\n \r\ndic2 = sorted(dic1)\r\n\r\nresult = False\r\nfor i in range(n-1):\r\n if dic1[dic2[i]] > dic1[dic2[i+1]]:\r\n result = True\r\n break\r\n\r\nif result:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n a,b=[int(j) for j in input().split()]\r\n if a!=b:\r\n cnt+=1\r\nif cnt==0:\r\n print(\"Poor Alex\")\r\nelse :\r\n print(\"Happy Alex\")", "n = int(input())\r\nlaptops = []\r\n\r\nfor _ in range(n):\r\n ai, bi = map(int, input().split())\r\n laptops.append((ai, bi))\r\n\r\n# Sort the laptops by price (ai)\r\nlaptops.sort(key=lambda x: x[0])\r\n\r\nhappy = False\r\nfor i in range(1, n):\r\n if laptops[i][1] < laptops[i - 1][1]:\r\n happy = True\r\n break\r\n\r\nif happy:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nprice_quality = []\r\nfor _ in range(n):\r\n a, b = list(map(int, input().split()))\r\n price_quality.append((a, b))\r\nprice_quality.sort()\r\n\r\nlast_price = last_quality = float('-inf')\r\nfor price, quality in price_quality:\r\n if price > last_price and quality < last_quality:\r\n print('Happy Alex')\r\n exit()\r\n\r\n last_price = price\r\n last_quality = quality\r\nprint('Poor Alex')\r\n ", "n = int(input())\r\nlaptops = []\r\n\r\nfor i in range(n):\r\n laptops.append(list(map(int, input().split())))\r\n\r\nlaptops.sort()\r\n\r\nresult = \"Poor Alex\"\r\n\r\nfor i in range(1, n):\r\n if laptops[i][0] > laptops[i-1][0] and laptops[i][1] < laptops[i-1][1]:\r\n result = \"Happy Alex\"\r\n break\r\n\r\nprint(result)", "# https://codeforces.com/problemset/problem/456/A\n\nn = int(input())\n\nprices = []\nquality = []\n\nfor i in range(n):\n a, b = input().split(\" \")\n prices.append((int(a), i))\n quality.append((int(b), i))\n\nprices.sort(key=lambda x: (-x[0],x[1]))\nquality.sort(key=lambda x: (-x[0],x[1]))\n\n\nif all(prices[i][1] == quality[i][1] for i in range(len(prices))):\n print(\"Poor Alex\")\nelse:\n print(\"Happy Alex\")\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Jan 27 09:25:39 2023\r\n\r\n@author: Administrator\r\n\"\"\"\r\n\r\nn = int(input())\r\nlaptop = [[int(x) for x in input().split()] for _ in range(n)]\r\nlaptop.sort()\r\n\r\nfor j in range(n-1):\r\n if laptop[j][1] > laptop[j+1][1]:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nl=[]\r\nn=int(input())\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tl.append([a,b])\r\nl.sort()\r\nfor i in range(n-1):\r\n\tif l[i][1]>l[i+1][1]:\r\n\t\tprint(\"Happy Alex\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"Poor Alex\")", "t=[0,0]\r\nm=0\r\nfor i in range(int(input())):\r\n x=list(map(int,input().split()))\r\n if x[0]!=x[1] and m==0:\r\n m+=1\r\n t=x\r\n else:\r\n if (x[0]>t[0] and x[1]<t[1]) or (x[0]<t[0] and x[1]>t[1]):\r\n t=0\r\n break\r\nprint([\"Happy Alex\",\"Poor Alex\"][t!=0])\r\n \r\n ", "n = int(input())\r\nans = ''\r\nfor i in range(n):\r\n a,b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n if a > b:\r\n ans = 'Happy Alex'\r\n break\r\n else:\r\n ans = 'Poor Alex'\r\nprint(ans)", "s = int(input())\r\ncnt = 0\r\nfor _ in range(s):\r\n a, b = list(map(int, input().split()))\r\n if a == b:\r\n cnt += 1\r\n else:\r\n continue\r\nif cnt < s:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')", "result = \"Poor Alex\"\r\nfor _ in range(int(input())):\r\n a, b = input().split()\r\n\r\n if a != b:\r\n result = \"Happy Alex\"\r\n break\r\n\r\nprint(result)", "import operator\r\n\r\nn=eval(input())\r\ndicLaptops={}\r\nfor i in range(n):\r\n price,performance=map(int,input().split())\r\n dicLaptops[price]=performance\r\n\r\n\r\nlsPrice=sorted(dicLaptops,reverse=False)\r\n\r\nlsPerformance=[dicLaptops[key] for key in lsPrice]\r\n\r\nlsperformanceSorted=sorted(lsPerformance,reverse=False)\r\n\r\nif operator.eq(lsPerformance,lsperformanceSorted):\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "n=int(input())\r\n\r\n\r\nflag=True\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n if a!=b:\r\n print(\"Happy Alex\")\r\n flag=False\r\n break\r\nif flag:\r\n print(\"Poor Alex\")\r\n \r\n", "def solve(n):\r\n for _ in range(n):\r\n a, b = input().split()\r\n if a != b:\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\nprint([\"Poor Alex\", \"Happy Alex\"][solve(n)])\r\n", "n = int(input())\r\nalex = False\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a < b:\r\n alex = True\r\nif alex:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "print((\"Poor\",\"Happy\")[any((lambda x,y:x!=y)(*input().split())for _ in range(int(input())))],\"Alex\")", "laptops = []\r\nfor _ in range(int(input())):\r\n laptops.append(list(map(int, input().split())))\r\n\r\nsorted_laptops = sorted(laptops, key=lambda x: x[0])\r\n\r\nfor i in range(len(sorted_laptops) - 1):\r\n if sorted_laptops[i][1] > sorted_laptops[i + 1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")\r\n", "jiage=[]\r\nzhiliang=[]\r\nn=int(input())\r\nfor i in range(0,n):\r\n a,b=map(int,input().split())\r\n jiage.append(a)\r\n zhiliang.append(b)\r\nzidian=dict(zip(jiage,zhiliang))\r\n#print(zidian)\r\nwei=dict(sorted(zidian.items()))\r\npai=list(wei.values())\r\n#print(pai)\r\njiancha=sorted(pai)\r\nif jiancha != pai:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n = int(input())\r\npr = []\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n pr.append((a, b))\r\n\r\npr.sort()\r\n\r\nfor j in range(n - 1):\r\n if pr[j][0] < pr[j + 1][0] and pr[j][1] > pr[j + 1][1]:\r\n print(\"Happy Alex\")\r\n exit()\r\n\r\nprint(\"Poor Alex\")\r\n", "# LUOGU_RID: 113867813\nn = int(input())\narr = []\nfor i in range(n):\n a, b = map(int, input().split())\n arr.append((a, b))\narr.sort()\npreMax = 0\nfor a, b in arr:\n if b < preMax:\n print(\"Happy Alex\")\n exit()\n preMax = max(preMax, b)\nprint(\"Poor Alex\")", "#!/bin/python\n\nn = int(input())\n\nfor _ in range(0, n):\n\ta,b = [ int(x) for x in input().split()]\n\n\tif a != b:\n\t\tprint(\"Happy Alex\")\n\t\tbreak\nelse:\n\tprint(\"Poor Alex\")\n\n\n", "lst = [w.strip() for w in open(0).readlines()]\r\nab = [tuple(map(int, line.split())) for line in lst[1:]]\r\nab.sort(key=lambda t: t[0])\r\nb = [t[1] for t in ab]\r\nbs = sorted(b)\r\nprint([\"Happy\", \"Poor\"][b == bs] + \" Alex\")", "# DO NOT EDIT THIS\r\nimport math\r\nimport sys\r\ninput = sys.stdin.readline\r\nfrom collections import deque, defaultdict\r\nimport heapq\r\ndef counter(a):\r\n c = defaultdict(lambda : 0) # way faster than Counter\r\n for el in a:\r\n c[el] += 1\r\n return c\r\n\r\ndef inp(): return [int(k) for k in input().split()]\r\ndef si(): return int(input())\r\ndef st(): return input()\r\n\r\n# DO NOT EDIT ABOVE THIS\r\n\r\nn = si()\r\narr = [inp() for _ in range(n)]\r\narr.sort(key=lambda a: (a[0], -a[1]))\r\n\r\nflag, b = False, 0\r\n\r\nfor p, q in arr:\r\n if b > q:\r\n flag = True\r\n break\r\n else:\r\n b = q\r\n\r\n\r\nprint('Happy Alex' if flag else 'Poor Alex')\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n l.append([a,b])\r\nl.sort()\r\nfor i in range(n-1):\r\n if l[i][0]<l[i+1][0] and l[i][1]>l[i+1][1]:\r\n print(\"Happy Alex\")\r\n exit()\r\nprint(\"Poor Alex\")", "from operator import itemgetter\nn = int(input())\nl = [list(map(int, input().split())) for _ in range(n)]\nl = sorted(l)\nprinted = False\nfor i in range (n-1):\n if l[i][0] == l[i+1][0]:\n continue\n else:\n if l[i][1]>l[i+1][1]:\n print(\"Happy Alex\")\n printed = True\n break\nif not printed:\n print(\"Poor Alex\")", "n=int(input())\r\nAlex =0\r\nfor i in range (n):\r\n n1,n2=input().split()\r\n n1,n2=int(n1),int(n2)\r\n if n2>n1:Alex+=1\r\nif Alex>0: print('Happy Alex')\r\nelse: print('Poor Alex') ", "a=int(input())\r\nfor i in range(a):\r\n d,k=map(int,input().split())\r\n if d<k:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')\r\n", "n=int(input())\r\nlaptops = []\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n laptops.append([a,b])\r\nlaptops.sort()\r\nmaxLaptopQual = 0\r\nflag = False\r\nfor i in range(n):\r\n if laptops[i][1] < maxLaptopQual:\r\n print(\"Happy Alex\")\r\n flag = True\r\n break\r\n maxLaptopQual=laptops[i][1]\r\nif not flag:\r\n print(\"Poor Alex\")", "def check_laptops(laptops):\n sorted_laptops = sorted(laptops, key=lambda x: x[0]) \n \n for i in range(1, len(sorted_laptops)):\n if sorted_laptops[i][1] < sorted_laptops[i - 1][1]:\n return \"Happy Alex\"\n return \"Poor Alex\"\n\nn = int(input())\nlaptops = [tuple(map(int, input().split())) for _ in range(n)]\n\nresult = check_laptops(laptops)\nprint(result)\n\t\t \t \t \t\t\t \t\t \t \t\t \t\t \t\t\t \t", "n = int(input())\r\na = sorted([list(map(int, input().split())) for i in range(n)])\r\nfor i in range(n-1):\r\n if a[i][0] < a[i+1][0] and a[i][1] > a[i+1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")\r\n", "def can_plug_in(n, laptops):\r\n laptops.sort(key=lambda x: x[0])\r\n for i in range(1, n):\r\n if laptops[i][1] < laptops[i-1][1]:\r\n return \"Happy Alex\"\r\n return \"Poor Alex\"\r\n\r\n# Read input\r\nn = int(input())\r\nlaptops = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Call the function and print the result\r\nresult = can_plug_in(n, laptops)\r\nprint(result)", "n = int(input())\r\n\r\narr = []\r\nfor _ in range(n):\r\n price, quality = map(int, input().split())\r\n arr.append((price, quality))\r\n\r\narr.sort()\r\nstrictlylower = 0\r\nstrictlyhigher = 0\r\n\r\nfor i in range(len(arr)):\r\n if arr[i][0] < arr[i][1]:\r\n strictlylower += 1\r\n if arr[i][0] > arr[i][1]:\r\n strictlyhigher += 1\r\n if strictlyhigher > 0 and strictlylower > 0:\r\n print(\"Happy Alex\")\r\n exit()\r\n\r\nprint(\"Poor Alex\")", "n = int(input())\r\n\r\nd = []\r\nfor i in range(n):\r\n d.append([int(x) for x in input().split()])\r\n\r\nd.sort()\r\nfor i in range(n - 1):\r\n if d[i][1] > d[i + 1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")\r\n", "n=int(input())\r\n\r\n\r\na1=[]\r\nb1=[]\r\nc=0 \r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n a1.append(a)\r\n b1.append(b)\r\n\r\n\r\nfor i in range(n):\r\n if a1[i]==b1[i]:\r\n c+=1\r\n \r\nif c == n:\r\n print('Poor Alex')\r\nelse: \r\n print('Happy Alex')", "n = int(input())\r\nlaptops = [tuple(map(int, input().split())) for i in range(n)]\r\nif any(a < b for a, b in laptops):\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "x = \"Poor Alex\"\r\nfor i in range(int(input())) : \r\n a , b = map(int, input().split())\r\n if a < b : x = \"Happy Alex\"\r\nprint(x)", "def checkLaptop():\r\n n = int(input())\r\n laptops = [[int(x) for x in input().split()] for i in range(n)]\r\n\r\n def key(value):\r\n return value[1]\r\n\r\n laptops.sort(key=key)\r\n\r\n for laptopIndex in range(n - 1):\r\n if laptops[laptopIndex + 1][0] < laptops[laptopIndex][0]:\r\n return \"Happy Alex\"\r\n return \"Poor Alex\"\r\n\r\nprint(checkLaptop())", "def check_laptops(n, laptops):\r\n laptops.sort(key=lambda x: x[0]) # Sort laptops based on price\r\n\r\n for i in range(1, n):\r\n if laptops[i][1] < laptops[i - 1][1]:\r\n return \"Happy Alex\"\r\n\r\n return \"Poor Alex\"\r\n\r\n# Read input\r\nn = int(input())\r\nlaptops = [tuple(map(int, input().split())) for _ in range(n)]\r\n\r\n# Check if Alex is correct\r\nresult = check_laptops(n, laptops)\r\nprint(result)\r\n", "for i in range(int(input())):\r\n\tx ,y = map(int, input().split())\r\n\tif x != y:\r\n\t\tprint('Happy Alex')\r\n\t\texit()\r\nprint('Poor Alex')", "n = int(input())\r\ntppr = []\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n tppr.append([a,b])\r\ntppr.sort(key=lambda x:x[0])\r\nl = 0\r\nr = 1\r\nwhile r < n:\r\n if tppr[l][1] > tppr[r][1]:\r\n print(\"Happy Alex\")\r\n break\r\n r+=1\r\n l+=1\r\nelse:\r\n print(\"Poor Alex\")\r\n\r\n\r\n", "n = int(input())\r\nlap = [None]*n\r\nfor i in range(n):\r\n lap[i] = list(map(int,input().split()))\r\nlap.sort()\r\nans = True\r\nfor i in range(n-1):\r\n if lap[i][1]>=lap[i+1][1]:\r\n ans = False\r\n break\r\nprint(\"Poor Alex\" if ans else \"Happy Alex\")", "n = int(input())\r\nprice, quality = [], []\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n price.append(p)\r\n quality.append(q)\r\n\r\npricesDict = dict()\r\n\r\nfor i in range(n):\r\n if price[i] not in pricesDict:\r\n pricesDict[price[i]] = [quality[i], quality[i]]\r\n else:\r\n if quality[i] < pricesDict[price[i]][0]:\r\n pricesDict[price[i]][0] = quality[i]\r\n elif quality[i] > pricesDict[price[i]][1]:\r\n pricesDict[price[i]][1] = quality[i]\r\nmaximumQ = 1\r\nisHappy = False\r\nfor p in sorted(pricesDict):\r\n if maximumQ > pricesDict[p][0]:\r\n print(\"Happy Alex\")\r\n isHappy = True\r\n break\r\n maximumQ = max(maximumQ, pricesDict[p][1])\r\nif not isHappy:\r\n print(\"Poor Alex\")", "n = int(input())\nquality = []\nprice = []\nfinal = []\n\nfor i in range(n):\n a,b = map(int,input().split())\n l1 = [a,b]\n final.append(l1)\nans = False\nfinal.sort(key = lambda x : x[0] )\nbigg = final[0][1]\nsmal = final[0][1]\nfor j in range(len(final)):\n if final[j][1] < bigg:\n ans = True\n break\n if final[j][1] > smal:\n smal = final[j][1]\n if final[j][1] < smal:\n ans = True\n break\nif ans:\n print(\"Happy Alex\")\nelse:\n print(\"Poor Alex\")", "import sys\r\nb = []\r\nc = []\r\n\r\nfor i in range(int(input())):\r\n a1, b1 = map(int, input().split())\r\n c.append([a1, b1])\r\ncs = sorted(c)\r\n\r\nfor i in range(len(cs)):\r\n b.append(cs[i][1])\r\n \r\nfor i in range(len(b)-1):\r\n if b[i + 1] < b[i]:\r\n print('Happy Alex')\r\n sys.exit()\r\n \r\nprint('Poor Alex')\r\n", "a = []\r\nb = []\r\nfor _ in range(int(input())):\r\n x, y = map(int, input().split())\r\n a.append(x)\r\n b.append(y)\r\n\r\nl = sorted(zip(a, b), key=lambda x: x[0])\r\nfor i in range(1, len(l)):\r\n if l[i-1][1] > l[i][1]:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')\r\n\r\n ", "n = int(input())\r\n\r\nc = 0\r\n\r\nfor i in range(n):\r\n a,b = input().split()\r\n \r\n if a != b:\r\n c+=1\r\n \r\n \r\n \r\nif c > 0 :\r\n print(\"Happy Alex\")\r\n \r\nelse:\r\n print(\"Poor Alex\")", "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\nl = [li() for _ in range(int(input()))]\r\nl.sort()\r\nfor i in range(len(l)-1):\r\n if l[i][0] < l[i+1][0] and l[i][1] > l[i+1][1]:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')", "n = int(input())\r\nlaptop = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n laptop.append((a, b))\r\nlaptop.sort()\r\n\r\nfor i in range(1, n):\r\n if laptop[i][1] < laptop[i-1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "for i in range(int(input())):\r\n\ta, b=input().split()\r\n\tif a !=b :\r\n\t\tprint('Happy Alex')\r\n\t\texit()\r\n\r\nprint('Poor Alex')", "x=int(input())\r\nn=False\r\n\r\nfor i in range(x):\r\n a,b=[int(x) for x in input().split()]\r\n if a<b:\r\n n=True\r\n\r\nif not n:\r\n print('Poor Alex') \r\nelse:\r\n print('Happy Alex') ", "n=int(input())\r\nd={}\r\no=0\r\na_max=0\r\nb_i=0\r\nfor i in range(n):\r\n a,b=map(int, input().split())\r\n d[a]=b\r\n if a > a_max :\r\n a_max = a\r\nfor i in range(a_max+1):\r\n if i in d:\r\n if b_i > d[i]:\r\n o=1\r\n print('Happy Alex')\r\n break\r\n b_i = d[i]\r\nif o==0:\r\n print('Poor Alex')\r\n \r\n \r\n", "n =int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\na.sort(key=lambda x:x[0])\r\nfor i in range(1,n):\r\n if a[i][1]<a[i-1][1]:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')", "n = int(input())\r\n\r\nlap = [] \r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n lap.append((a, b))\r\n\r\nlap.sort()\r\n\r\nfor i in range(n - 1):\r\n if lap[i][1] > lap[i+1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")\r\n\r\n \t\t \t \t\t\t\t\t\t \t\t\t\t \t \t \t\t \t \t", "from sys import stdin\r\na = False\r\nfor _ in range(int(stdin.readline().strip())):\r\n b = list(map(int,stdin.readline().split()))\r\n if b[0]<b[1]:a=True\r\nprint(\"Happy Alex\") if a else print(\"Poor Alex\")\r\n", "f=0\r\nfor _ in range(int(input())):\r\n a,b=map(int,input().split())\r\n if a!=b:\r\n f=1\r\n break\r\nprint(('Happy' if f else 'Poor'),'Alex')\r\n", "from sys import stdin, stdout\n\n\ndef input():\n return stdin.readline().strip()\n\n\ndef print(string):\n return stdout.write(str(string) + \"\\n\")\n\n\ndef main():\n n = int(input())\n laptops = []\n for _ in range(n):\n laptops.append([int(x) for x in input().split()])\n laptops.sort(key=lambda x: x[0])\n for i in range(n-1):\n if laptops[i][1] > laptops[i+1][1]:\n print(\"Happy Alex\")\n return\n print(\"Poor Alex\")\n\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\nlist = sorted([[int(x) for x in input().split()] for i in range(n)])\r\nlist_0 = []\r\nfor i in list:\r\n list_0.append(i[1])\r\nif list_0 == sorted(list_0):\r\n print('Poor Alex')\r\nelse:\r\n print('Happy Alex')\r\n \r\n\r\n", "n = int(input())\r\nc = False\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n if a > b or a < b:\r\n c = True\r\nif c:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n=int(input())\nl=[]\nfor i in range(n):\n a=list(map(int,input().split()))\n l.append(a)\nl.sort(key=lambda x:x[0])\nans=0\nfor i in range(1,len(l)):\n if l[i][1]<l[i-1][1]:\n ans=1\nif ans==1:\n print('Happy Alex')\nelse:\n print('Poor Alex')", "n = int(input())\r\nlaptops = []\r\nfor _ in range(n):\r\n a,b = map(int, input().split())\r\n laptops.append((a,b))\r\nlaptops.sort()\r\n\r\ndef f(laptops):\r\n max_qual = -1\r\n i = 0\r\n while i < len(laptops):\r\n if laptops[i][1] < max_qual:\r\n return True\r\n j = i\r\n while j < len(laptops) and laptops[i][0] == laptops[j][0]:\r\n j += 1\r\n j -= 1\r\n max_qual = max(max_qual, laptops[j][1])\r\n i = j + 1\r\n return False\r\n\r\nres = f(laptops)\r\nprint(\"Happy Alex\" if res else \"Poor Alex\")", "from sys import stdin, stdout\r\ni,p=stdin.readline, stdout.write\r\ndef main():\r\n f=0\r\n for _ in range(int(i())):\r\n a,b=map(int,i().split())\r\n if a!=b:\r\n f=1\r\n break\r\n p(('Happy' if f else 'Poor')+' Alex')\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nlaptops = []\r\nfor i in range(n):\r\n price, quality = map(int, input().split())\r\n laptops.append([price, quality])\r\n\r\nlaptop = sorted(laptops)\r\n\r\nfor x in range(1, n):\r\n if laptop[x-1][1] > laptop[x][1]:\r\n print(\"Happy Alex\")\r\n exit()\r\nprint(\"Poor Alex\")", "n = int(input())\n\ndef p(k):\n a = k.split()\n return int(a[0]), int(a[1])\n\nab = sorted(map(p, (input() for _ in range(n))))\n\nlb = ab[0][1]\nfor i in range(1, n):\n j = ab[i][1]\n if j < lb:\n print(\"Happy Alex\")\n raise SystemExit()\n lb = j\n\nprint(\"Poor Alex\")\n", "#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\nfrom collections import Counter\r\ntt=int(input())\r\na=[]\r\nb=[]\r\nindex=0\r\nfor _ in range(tt):\r\n x,y=map(int,input().split())\r\n a.append((x,y,index))\r\n b.append((y,x,index))\r\n index+=1\r\na.sort()\r\nb.sort()\r\nfor i in range(tt):\r\n if a[i][-1]!=b[i][-1]:\r\n print('Happy Alex')\r\n break\r\nelse:print('Poor Alex')\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", "for _ in range(int(input())):\r\n\tg,h=input().split()\r\n\tif g!=h:\r\n\t\tprint('Happy Alex')\r\n\t\texit()\r\nprint('Poor Alex')", "n = int(input())\r\ndic = {}\r\nfor i in range(n):\r\n a , b = map(int , input().split())\r\n dic[a] = b\r\narr = []\r\nfor key in dic.keys():\r\n arr.append(key)\r\narr.sort()\r\nfor i in range(n - 1):\r\n if dic[arr[i]] > dic[arr[i + 1]] and arr[i] < arr[i + 1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "A={}\r\nn=int(input())\r\nfor _ in range(n):\r\n a=input().split()\r\n A[int(a[0])]=int(a[1])\r\nB=sorted(A.items())\r\nC=[]\r\nfor x in range(n):\r\n C.append(B[x][1])\r\nD=sorted(C)\r\nk=1\r\nfor x in range(n):\r\n if C[x]!=D[x]:\r\n k=2\r\n break\r\nif k==1:\r\n print(\"Poor Alex\")\r\nelif k==2:\r\n print(\"Happy Alex\")", "l=[]\nfor i in range(int(input())):\n l.append(list(map(int, input().split())))\n \nq = []\np = []\n\nfor i in l:\n if i[1]>i[0]:\n q.append(i)\n else:\n p.append(i)\n\nif len(q)>0:\n print('Happy Alex')\nelse:\n print('Poor Alex')", "if __name__ == '__main__':\r\n n_rows = int(input())\r\n rows = [[int(j) for j in input().split()] for i in range(n_rows)]\r\n rows.sort(key=lambda x: x[0])\r\n quality = [i[1] for i in rows]\r\n if quality == sorted(quality):\r\n print(\"Poor Alex\")\r\n else:\r\n print(\"Happy Alex\")\r\n\r\n", "n = int(input())\r\nlaptops = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n laptops.append((a, b))\r\n\r\n# Sort the laptops by price in ascending order\r\nlaptops.sort()\r\n\r\n# Check if there is any laptop that has a lower price but a higher quality than the next one\r\nfor i in range(n - 1):\r\n if laptops[i][1] > laptops[i + 1][1]:\r\n print(\"Happy Alex\")\r\n exit()\r\n\r\nprint(\"Poor Alex\")\r\n", "n = int(input())\nprices = []\nquality = []\n\nfor _ in range(n):\n\tp, q = map(int, input().split())\n\tprices.append(p)\n\tquality.append(q)\n\nzipped = zip(prices, quality)\nbzipped = sorted(zipped, key=lambda a: a[0])\nsorted_qs = sorted(quality)\nnew_qs = [z[1] for z in bzipped]\n\nprint(\"Happy Alex\" if new_qs != sorted_qs else \"Poor Alex\")\n\n", "#456a\nimport sys\ninput = sys.stdin.readline\n\nn = int(input())\nlaptops = sorted([list(map(int,input().split())) for i in range(n)])\na = sorted(laptops, key = lambda x : x[1])\n\n# print(laptops)\n# print(a)\nprint('Happy Alex' if laptops != a else 'Poor Alex')", "P=\"Poor\"\nfor _ in range(int(input())):\n x,y=map(int,input().split())\n if x!=y: P=\"Happy\"\nprint(P,\"Alex\")", "n = int(input())\r\na = []\r\nb = []\r\nc = []\r\nfor i in range(n):\r\n ai, bi = map(int, input().split())\r\n a.append(ai)\r\n b.append(bi)\r\n c.append((ai, bi))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nt = 0\r\nfor i in range(n):\r\n if a[i] == c[i][0] and b[i] == c[i][1]: continue\r\n else: t = 1; break\r\nif t == 0: print('Poor Alex')\r\nelse: print('Happy Alex')", "n = int(input())\r\nlaptops = [[int(x) for x in input().split()] for j in range(n)]\r\nlaptops.sort(key=lambda price: price[0])\r\ni = 0\r\nflag = False\r\nwhile i + 1 < n:\r\n if laptops[i][0] > laptops[i + 1][0]:\r\n if laptops[i][1] < laptops[i + 1][1]:\r\n flag = True\r\n elif laptops[i][0] < laptops[i + 1][0]:\r\n if laptops[i][1] > laptops[i + 1][1]:\r\n flag = True\r\n i += 1\r\nif flag:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n x,y=[int(x) for x in input().split()]\r\n l.append((x,y))\r\nl1=sorted(l)\r\nflag=True\r\nfor i in range(n-1):\r\n if l1[i][1]>l1[i+1][1]:\r\n flag=False\r\nif flag:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")\r\n\r\n", "n = int(input())\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n if a!=b:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "n = int(input())\r\na =[]\r\nfor i in range(n):\r\n z = input()\r\n z = z.split()\r\n z = [int(x) for x in z]\r\n a.append(z)\r\na.sort()\r\nmx_b = 0\r\nmx_a = 0\r\nfor i in range(n):\r\n if (a[i][1] < mx_b) and (a[i][0] > mx_a):\r\n print('Happy Alex')\r\n exit()\r\n if mx_b < a[i][1]:\r\n mx_b = a[i][1]\r\n mx_a = a[i][0]\r\n\r\n\r\n\r\n\r\n\r\nprint('Poor Alex')", "def solve(ab):\r\n p = ab[0][1]\r\n for _, b in ab:\r\n if p > b:\r\n return True\r\n p = b\r\n return False\r\n\r\n\r\nn = int(input())\r\nab = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n ab.append((a, b))\r\nab.sort()\r\nprint([\"Poor Alex\", \"Happy Alex\"][solve(ab)])\r\n", "for n in range(int(input())):\n\ta,b=input().split()\n\tif a!=b:\n\t\tprint(\"Happy Alex\")\n\t\texit()\nprint(\"Poor Alex\")\n \t \t\t \t\t\t \t\t\t \t \t \t\t \t", "n = int(input())\r\n\r\nlst = []\r\n\r\nfor _ in range(n):\r\n lst.append([int(i) for i in input().split()])\r\n\r\nlst.sort()\r\n\r\nfor i in range(1, len(lst)):\r\n if (lst[i - 1][1] > lst[i][1]):\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")\r\n ", "n=int(input())\r\nd=[]\r\nfor i in range(n):\r\n a=input().split()\r\n b=[int(j) for j in a]\r\n d.append(b)\r\ne=sorted(d,key=lambda x:x[0])\r\nc=0\r\nfor i in range(len(e)-1):\r\n if e[i][0]<e[i+1][0] and e[i][1]>e[i+1][1]:\r\n c=1\r\nif c==1:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n \r\n\r\n", "n = int(input())\r\na = []\r\nb = []\r\nmax_quality = -float(\"inf\")\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\nfor i,j in sorted(zip(a,b)):\r\n if max_quality>j:\r\n print(\"Happy Alex\")\r\n break \r\n max_quality = max(max_quality,j)\r\nelse:\r\n print(\"Poor Alex\")", "def main():\r\n length = int(input())\r\n laptops = []\r\n for i in range(length):\r\n price, quality = map(int, input().split())\r\n laptops.append((price, quality))\r\n \r\n laptops.sort()\r\n for i in range(length - 1):\r\n cur_laptop_price = laptops[i][0]\r\n cur_laptop_quality = laptops[i][1]\r\n next_laptop_price = laptops[i + 1][0]\r\n next_laptop_quality = laptops[i + 1][1]\r\n \r\n if cur_laptop_price != next_laptop_price and cur_laptop_quality > next_laptop_quality:\r\n print(\"Happy Alex\")\r\n return\r\n \r\n print(\"Poor Alex\")\r\nmain()", "if __name__ == '__main__':\r\n n = int(input())\r\n arr = sorted([tuple(map(int, input().split(' '))) for i in range(n)])\r\n\r\n key, value = arr[0]\r\n for item in arr:\r\n if key < item[0] and value > item[1]:\r\n print('Happy Alex')\r\n break\r\n if value < item[1]:\r\n key, value = item\r\n else:\r\n print('Poor Alex')\r\n", "n = int(input())\r\nq = []\r\nfor i in range(n):\r\n q.append(tuple(map(int,input().split())))\r\nq.sort(key = lambda x:x[0])\r\nh = False\r\nfor i in range(1,n):\r\n if q[i][1]<q[i-1][1]:\r\n h=True\r\n break\r\nif h:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Sep 10 16:05:53 2023\r\n\r\n@author: mac\r\n\"\"\"\r\n\r\nn = int(input())\r\nlaptops = [()] * n\r\nfor i in range(n):\r\n laptops[i] = [int(k) for k in input().split()]\r\nlaptops.sort()\r\nfor i in range(n-1):\r\n if laptops[i][1] > laptops[i+1][1] and laptops[i][0] < laptops[i+1][0]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "laptops = int(input())\r\nprices = []\r\nfor i in range(laptops):\r\n laptop = list(map(int, input().split()))\r\n prices.append((laptop[0],laptop[1]))\r\nprices.sort(key = lambda x: x[0], reverse= True)\r\ncurrent_smallest = prices[0][1]\r\nfor p,q in prices:\r\n if q < current_smallest:\r\n current_smallest = q\r\n elif q > current_smallest:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")\r\n\r\n", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n el = list(map(int, input().split()))\r\n arr.append(el)\r\narr = sorted(arr)\r\nflag = False\r\nmax_q = arr[0][1]\r\nfor el in arr[1:]:\r\n if el[1] >= max_q:\r\n max_q = el[1]\r\n else:\r\n flag = True\r\n break\r\nif flag:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n ", "n = int(input())\r\nl = []\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n l.append((p, q))\r\nl.sort()\r\nfor i in range(n - 1):\r\n if l[i][0] < l[i + 1][0] and l[i][1] > l[i + 1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "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, k = ioarr()\r\n # arr = ioarr()\r\n arr = []\r\n for _ in range(n):\r\n arr.append(tuple(ioarr()))\r\n\r\n arr.sort()\r\n pre, mx = arr[0]\r\n found = False\r\n\r\n for i in range(1, n):\r\n cur, val = arr[i]\r\n if pre < cur and mx > val:\r\n found = True\r\n break\r\n pre = cur\r\n mx = max(mx, val)\r\n\r\n if found:\r\n print(\"Happy Alex\")\r\n else:\r\n print(\"Poor Alex\")\r\n", "a=int(input())\r\nc=[]\r\ne=0\r\nfor i in range(a):\r\n b=list(map(int,input().split()))\r\n c+=[b]\r\nc.sort(key=lambda x: x[0])\r\nfor n in range(a-1):\r\n if c[n][1]>c[n+1][1]:\r\n print('Happy Alex')\r\n e=1\r\n break\r\nif e==0:\r\n print('Poor Alex')\r\n", "s = []\r\nfor i in range(int(input())):\r\n s.append(list(map(int, input().split())))\r\ns.sort()\r\nimax = 0\r\nFlag = False\r\nfor i in range(len(s)):\r\n if imax < s[i][-1]:\r\n imax = s[i][-1]\r\n else:\r\n Flag = True\r\n break\r\nif Flag:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')", "# Asif Islam - asifislam510\nnum_items = int(input())\nhappy_alex = False\n\nfor _ in range(num_items):\n price, quality = map(int, input().split())\n\n if price < quality:\n happy_alex = True\n break\n\nif happy_alex:\n print(\"Happy Alex\")\nelse:\n print(\"Poor Alex\")\n\n \t \t \t \t \t\t\t\t \t \t\t\t \t\t", "n = int(input())\nltps = [[int(i) for i in input().split()] for _ in range(n)]\nltps.sort()\nres, ma = \"Poor Alex\", 0\nfor i in range(n):\n if ltps[i][0] > ltps[ma][0] and ltps[i][1] < ltps[ma][1]:\n res = \"Happy Alex\"\n break\n if ltps[i][1] > ltps[ma][1]:\n ma = i\nprint(res)\n", "flag = True\r\nfor _ in range(int(input())) :\r\n price , qaulity = map(int,input().split())\r\n if flag :\r\n if price != qaulity :\r\n print(\"Happy Alex\")\r\n flag = False\r\nif flag : print(\"Poor Alex\")", "from operator import itemgetter\r\nj=int(input())\r\nu=[[int(a) for a in input().split()] for a1 in range(j)]\r\nu=sorted(u, key=itemgetter(0))\r\nfor o in range(len(u)-1):\r\n if u[o][1]>u[o+1][1]:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')", "n = int(input())\nlaptops = []\nfor _ in range(n):\n a, b = map(int, input().split())\n laptops.append((a, b))\n\nlaptops.sort(key=lambda x: x[0])\n\np, q = laptops[0][0], laptops[0][1]\nisCorrect = False\nfor i in range(1, len(laptops)):\n a, b = laptops[i]\n if q > b and p < a:\n isCorrect = True\n break\n if b > q:\n p = a\n q = b\n\nprint(\"Happy Alex\" if isCorrect else \"Poor Alex\")\n\n\t\t \t \t\t \t\t\t\t \t\t \t \t\t \t \t", "import sys\r\nfrom math import ceil\r\nfrom os import path\r\nfrom collections import OrderedDict\r\ndef remove_duplicate(s): \r\n return \"\".join(OrderedDict.fromkeys(s))\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n#sort in asc of price and then in desc of quality or desc of price and then in asc of quality\r\n# 2 pointer approach on the above sorted array sliding window\r\ndef solve():\r\n n=int(input())\r\n laptops=[]\r\n for i in range(n):\r\n laptops.append(list(map(int,input().split())))\r\n laptops.sort()\r\n #print(laptops)\r\n l=0\r\n r=1\r\n while r<n and r>=l:\r\n if laptops[l][1]>laptops[r][1] and laptops[l][0]<laptops[r][0]:\r\n print(\"Happy Alex\")\r\n return\r\n elif laptops[l][0]==laptops[r][0]:\r\n r+=1\r\n else:\r\n l+=1\r\n print(\"Poor Alex\")\r\n\r\n\r\n\r\ndef main():\r\n testcases = 1 \r\n #testcases = int(input()) # multiple testcases\r\n for _ in range(testcases):\r\n #n = int(input())\r\n solve()\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()", "n = int(input())\r\na = []\r\nfor _ in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\na = sorted(a, key = lambda arr:arr[0])\r\n# print(a)\r\nquality = [q for p, q in a]\r\nif quality == sorted(quality):\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "n=int(input())\r\na=list()\r\nsgn=0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append((x,y))\r\na.sort(key=lambda x:x[0])\r\nfor i in range(n-1):\r\n if a[i][1]>a[i+1][1]:\r\n print(\"Happy Alex\")\r\n sgn+=1\r\n break\r\nif sgn==0:\r\n print(\"Poor Alex\")", "def solution():\r\n n = int(input())\r\n nb = []\r\n for i in range(n):\r\n nb.append([int(num) for num in input().split()])\r\n nb.sort()\r\n prev = -float('Inf')\r\n for price, quality in nb:\r\n if quality < prev:\r\n print('Happy Alex')\r\n return\r\n prev = quality\r\n print('Poor Alex')\r\n \r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nl = 0\r\nfor _ in range(n):\r\n a, b = map(int,input().split())\r\n if a < b:\r\n l += 1\r\n\r\nif l >= 1 and l < n:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')\r\n", "n = int(input())\r\nlaptops = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n laptops.append([a, b])\r\nprice = laptops[:]; price.sort()\r\nquality = laptops[:]; quality.sort(key = lambda x: x[1])\r\nfor i in range(n):\r\n if price[i] != quality[i]:\r\n print(\"Happy Alex\")\r\n break\r\nelse: print(\"Poor Alex\")", "n = int(input())\r\nmat = [list(map(int,input().split()))for i in range(n)]\r\nmat.sort()\r\nhappy=False\r\nk=[]\r\np=[]\r\nfor i in range(n):\r\n k.append(mat[i][1])\r\n p.append(mat[i][1])\r\np.sort()\r\nfor i in range(n):\r\n if(k[i]!=p[i]):\r\n happy=True\r\nif(happy):\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "n=int(input())\r\na = 0\r\nfor x in range(n):\r\n list1=list(map(int,input().split()))\r\n for x in list1:\r\n if list1[0]<list1[1]:\r\n a+=1\r\n break\r\nif a==0:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nn = int(input())\r\nfor i in range(n):\r\n lst = [int(x) for x in input().split()]\r\n price = lst[0]\r\n quality = lst[1]\r\n if price < quality:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n \r\n laptops = []\r\n for _ in range(n):\r\n p, q = map(int, input().split())\r\n laptops.append([p, q])\r\n \r\n laptops.sort(key=lambda x:x[0])\r\n \r\n guess = False\r\n currQ = laptops.pop(0)[1]\r\n for _, q in laptops:\r\n if currQ > q:\r\n guess = True\r\n break\r\n \r\n currQ = q\r\n\r\n print(\"Happy Alex\" if guess else \"Poor Alex\")\r\n", "n = int(input())\r\ncheck = False\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if a != b:\r\n check = True\r\nif check == True:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n = int(input())\r\n\r\nlaptops = [[int(x) for x in input().split()] for j in range(n)]\r\n\r\nlaptops.sort(key = lambda x: x[0])\r\n\r\ndef solve():\r\n for i in range(len(laptops) - 1):\r\n if laptops[i][1] > laptops[i + 1][1] and laptops[i][0] < laptops[i + 1][0]:\r\n return \"Happy Alex\"\r\n \r\n return \"Poor Alex\"\r\n\r\nprint(solve())\r\n", "state = \"Poor\"\r\nfor x in range(int(input())):\r\n a,b = map(int,input().split())\r\n if b>a : state = \"Happy\"\r\nprint(state,\"Alex\")", "t = int(input())\r\narr = []\r\nfor _ in range(t):\r\n a,b = tuple(map(int,input().split(\" \")))\r\n arr.append([a,b])\r\narr = sorted(arr)\r\n#print(arr)\r\nans = False\r\n#print(arr)\r\nfor i in range(0,t-1):\r\n if(arr[i][0]<arr[i+1][0] and arr[i][1] > arr[i+1][1]):\r\n ans = True\r\n break\r\nif(ans):\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n\r\n\r\n\r\n", "import math\r\nimport bisect\r\n \r\n \r\ndef sol():\r\n _=int(input())\r\n l=[]\r\n d=dict()\r\n for aditya in range(_):\r\n a,b=map(int,input().split())\r\n d[a]=b\r\n l.append(a)\r\n l.sort()\r\n ans=False\r\n for i in range(_-1):\r\n if l[i]<l[i+1] and d[l[i]]>d[l[i+1]]:\r\n ans=True\r\n break\r\n if ans==True:\r\n print(\"Happy Alex\")\r\n else:\r\n print(\"Poor Alex\")\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n\r\n \r\n \r\n\r\n \r\n \r\n \r\n \r\nsol()\r\n", "n = int(input())\nprice = []\n\nfor i in range(n):\n price.append(list(map(int, input().split())))\n\nprice.sort()\n\np = True\n\nfor i in range(len(price) - 1):\n if price[i][1] > price[i + 1][1]:\n print(\"Happy Alex\")\n p = False\n break\nif p:\n print(\"Poor Alex\")", "n=int(input())\r\nP='Poor'\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if x!=y:P='Happy'\r\nprint(P,'Alex')", "def solve():\r\n n = int(input())\r\n laps = [list(map(int, input().split())) for _ in range(n)]\r\n flag = False\r\n laps.sort(key=lambda x: x[1], reverse=True)\r\n \r\n for i in range(1, n):\r\n if laps[i][0] > laps[i-1][0]:\r\n flag = True\r\n break\r\n\r\n print(\"Happy Alex\" if flag else \"Poor Alex\")\r\n\r\n\r\nif \"__main__\" == __name__:\r\n solve()", "n=int(input())\r\nlaptops=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n laptops.append((a,b))\r\nlaptops.sort()\r\nok=False\r\nfor j in range(1,n):\r\n if laptops[j-1][1]>laptops[j][1]:\r\n ok=True\r\n break\r\nif ok:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n b,c=map(int,input().split())\r\n a.append([b,c])\r\na.sort(key=lambda x: x[0])\r\n# print(a)\r\nfor i in range(n):\r\n if a[i][1]!=i+1:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')", "n = int(input())\r\na = [(0,0)]*n\r\nfor i in range(n):\r\n a[i] = tuple(map(int, input().split()))\r\n\r\nb = sorted(a)\r\na.sort(key= lambda x: x[1])\r\n\r\nprint(\"Poor Alex\") if(a == b) else print(\"Happy Alex\")", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Sep 21 16:16:10 2023\r\n\r\n@author: ljy\r\n\"\"\"\r\n\r\nn=int(input())\r\na=[]\r\nb=[]\r\nfor i in range(n):\r\n ai,bi=map(int,input().split())\r\n a.append(ai)\r\n b.append(bi)\r\njudge=0\r\nfor i in range(n):\r\n if a[i]<b[i]:\r\n judge+=1\r\nif judge:\r\n print('Happy Alex')\r\nelse:print('Poor Alex')", "def it(): return int(input())\r\ndef pr(a): return print(a)\r\ndef li(): return list(map(int, input().split()))\r\ndef ls(): return [str(i) for i in input()]\r\ndef no(): return print('NO')\r\ndef yes(): return print('YES')\r\ndef mapa(): return map(int, input().split())\r\n#''' ????????????????????????????????????? '''#\r\n#''' ????????| ___ ___ |???????????????? '''#\r\n#''' ????????|(-_-) (*_*)|???????????????? '''#\r\n#''' ????????|/| |\\ /| |\\|???????????????? '''#\r\n#''' ????????|_|_|___|_|_|???????????????? '''#\r\n#''' ????????????????????????????????????? '''#\r\nm = []\r\nn = []\r\nfor i in range(it()):\r\n a, b = mapa()\r\n m.append(a)\r\n n.append(b)\r\nf = 0\r\nfor i in range(len(m)):\r\n if m[i] < n[i] or m[i] > n[i]:\r\n pr('Happy Alex')\r\n f = 1\r\n break\r\nif f == 0:\r\n print('Poor Alex')", "n = int(input())\r\nlaptops = [tuple(map(int, input().split())) for _ in range(n)]\r\nlaptops.sort(key=lambda x: x[0]) # Sort laptops by price\r\n\r\nhappy_alex_found = False\r\n\r\nfor i in range(n - 1):\r\n if laptops[i][1] > laptops[i + 1][1]:\r\n happy_alex_found = True\r\n break\r\n\r\nif happy_alex_found:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "n = int(input()) \r\nl_p = list()\r\nl_q = list()\r\n\r\nfor _ in range(n):\r\n p, q = map(int, input().split())\r\n l_q.append(q)\r\n l_p.append(p)\r\n\r\nll = sorted(zip(l_p, l_q))\r\nbq = 0\r\npp = 0\r\n\r\nfor t in ll:\r\n if pp < t[0] and bq > t[1]:\r\n print(\"Happy Alex\")\r\n quit()\r\n\r\n\r\n bq = max(bq, t[1])\r\n pp = t[0]\r\n\r\n\r\nprint(\"Poor Alex\")\r\n", "IN = lambda:list(map(int, input().split()))\r\n \r\nh = 0\r\nfor _ in range(IN()[0]):\r\n c,q = IN()\r\n \r\n if (c != q): print(\"Happy\", end = \" \"); h = 1; break\r\n\r\nprint(\"Poor Alex\" if not h else \"Alex\")", "n=int(input())\r\ns=[]\r\nsgn=0\r\nfor _ in range(n):\r\n s.append([int(x) for x in input().split()])\r\ns.sort()\r\nfor i in range(n-1):\r\n if s[i][1]>s[i+1][1]: sgn=1\r\nif sgn==1: print(\"Happy Alex\")\r\nelse: print(\"Poor Alex\")", "f = False\r\nfor _ in range(int(input())):\r\n a, b = map(int, input().split())\r\n if a < b:\r\n f = True\r\nprint(\"Happy Alex\" if f is True else \"Poor Alex\")", "n = int(input())\r\nv = []\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n v.append((a, b))\r\n\r\nv.sort()\r\nz = False\r\n\r\nfor i in range(n - 1):\r\n if v[i][1] > v[i + 1][1]:\r\n z = True\r\n break\r\n\r\nif z:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "a = []\r\nfor i in range(int(input())):\r\n x, y = map(int, input().split())\r\n a.append([x, y])\r\na.sort()\r\nfor i in range(len(a)-1):\r\n if a[i][1] > a[i+1][1]:\r\n print(\"Happy Alex\")\r\n quit()\r\nprint(\"Poor Alex\")\r\n", "n = int(input())\r\nlaptop ={}\r\ndef solve(n,laptop):\r\n for i in range(n):\r\n temp = input().split(\" \")\r\n laptop[int(temp[0])] = int(temp[1])\r\n\r\n laptopByPrice = sorted(laptop.items(), key=lambda item: item[0])\r\n laptopByQuality = sorted(laptop.items(), key=lambda item: item[1])\r\n if (laptopByPrice != laptopByQuality):\r\n return (\"Happy Alex\")\r\n return \"Poor Alex\"\r\n\r\nprint(solve(n,laptop))", "def check_laptops(n, laptops):\n laptops.sort() # Sort the laptops based on price in ascending order\n for i in range(1, n):\n if laptops[i][1] < laptops[i - 1][1]:\n return \"Happy Alex\"\n return \"Poor Alex\"\n\n# Read input\nn = int(input())\nlaptops = []\nfor _ in range(n):\n price, quality = map(int, input().split())\n laptops.append((price, quality))\n\n# Check the laptops\nresult = check_laptops(n, laptops)\nprint(result)\n", "f=0;g=0\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>b:\r\n f=1\r\n else:g=1\r\nprint([\"Poor Alex\",\"Happy Alex\"][f==1 and g==1])", "import math\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = []\r\n for i in range(n):\r\n a.append(list(map(int, input().split())))\r\n a.sort()\r\n cur = a[0][1]\r\n for i in range(1, n):\r\n if cur > a[i][1]:\r\n return \"Happy Alex\"\r\n cur = max(cur, a[i][1])\r\n return \"Poor Alex\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n c = solve()\r\n print(c)", "times = int(input())\r\ndata = sorted([tuple(int(thing) for thing in input().split()) for i in range(times)])\r\nhighestquality = data[0]\r\nstate = False\r\nfor i in range(len(data)-1):\r\n if data[i][1] > highestquality[1]:\r\n highestquality = data[i]\r\n if data[i+1][1] < highestquality[1] and data[i+1][0] > highestquality[0]:\r\n state = True\r\nif state:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n=int(input())\r\nflag=True\r\nfor _ in range(n):\r\n a=[int(_) for _ in input().split()]\r\n if a[0]!=a[1]:\r\n flag=False\r\nif flag:\r\n print('Poor Alex')\r\nelse:\r\n print('Happy Alex')", "def solve():\r\n n = int(input())\r\n matrix = []\r\n for _ in range(n):\r\n matrix.append(list(map(int, input().split())))\r\n\r\n matrix.sort(key=lambda x: x[0])\r\n for i in range(1, n):\r\n if matrix[i][1] < matrix[i-1][1]:\r\n return \"Happy Alex\"\r\n return \"Poor Alex\"\r\n\r\nprint(solve())", "amount = 0 \r\nn = int(input())\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n if a == b:\r\n amount += 1\r\nif amount != n:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "a=\"Poor\"\r\nfor i in range(int(input())):\r\n b,c=input().split()\r\n if b!=c:a=\"Happy\"\r\nprint(a,\"Alex\")", "import copy\r\nn=int(input())\r\naa=[]\r\ndic={}\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n if a in dic:\r\n dic[a]=min(dic[a],b)\r\n else:\r\n dic[a]=b\r\nfor i in dic:\r\n aa.append([i,dic[i]])\r\naa.sort()\r\nbb=copy.deepcopy(aa)\r\nbb.sort(key = lambda x:x[1])\r\nfor i in range(n):\r\n if aa[i]!=bb[i]:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')", "n = int(input())\r\n\r\na =[(0,0)]*n\r\n\r\nfor i in range(n):\r\n\r\n x, y = map(int,input().split())\r\n a[i]=(x,y)\r\n\r\n\r\na.sort()\r\n\r\nb = [0]*n\r\n\r\nfor i in range(n):\r\n b[i] = a[i][1]\r\n\r\nif b == sorted(b):\r\n print(\"Poor Alex\") \r\nelse:\r\n print('Happy Alex')\r\n", "a=\"Poor\"\nfor i in range(int(input())):\n b,c=input().split()\n if b!=c:a=\"Happy\"\nprint(a,\"Alex\")\n \t \t \t\t\t \t \t \t \t\t\t\t\t \t\t \t", "n=int(input())\r\ni=1\r\nl=[]\r\nwhile i<=n:\r\n nn=[int(i) for i in input().split()]\r\n l.append(nn)\r\n i+=1\r\nl.sort()\r\nj=0\r\na=0\r\nwhile j<=n-2:\r\n x1=l[j]\r\n x2=l[j+1]\r\n if x1[0]<x2[0] and x1[1]>x2[1]:\r\n print(\"Happy Alex\")\r\n a+=1\r\n break\r\n j+=1\r\nif a==0:\r\n print(\"Poor Alex\")", "n=int(input())\r\nl=[[int(x) for x in input().split()] for a in range(n)]\r\nl.sort(key=lambda x: x[0])\r\nfor i in range(1,len(l)):\r\n if l[i-1][1] > l[i][1]:\r\n print(\"Happy Alex\")\r\n exit()\r\nprint(\"Poor Alex\")", "n = int(input())\nlaptops = [[int(x) for x in input().split()] for _ in range(n)]\nlaptops = sorted(laptops)\nfor x in range(n-1):\n if laptops[x][1] > laptops[x+1][1]:\n print(\"Happy Alex\")\n exit()\nprint(\"Poor Alex\")\n \t\t \t \t\t\t\t\t\t \t\t\t\t \t\t\t \t \t \t", "l = []\r\nn = int(input())\r\nfor i in range(n):\r\n l.append([int(x) for x in input().split()])\r\nl.sort()\r\nfor i in range(n-1):\r\n if l[i][1]>l[i+1][1]:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')", "ans=\"Poor Alex\"\r\nn=int(input())\r\nfor i in range(n):\r\n p,q=list(map(int,input().split()))\r\n if p<q:\r\n ans=\"Happy Alex\"\r\nprint(ans) ", "num = int(input())\r\na = []\r\nfor i in range(num):\r\n n = [int(j) for j in input().split()]\r\n a.append(n)\r\na = sorted(a)\r\nflag = False\r\nfor i in range(num-1):\r\n if a[i][1]>a[i+1][1]:\r\n flag = True\r\n break\r\nif flag==True:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')\r\n ", "n = int(input())\r\nflag = False\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n if (x != y):\r\n flag = True\r\n break\r\nif (flag):\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "n = int(input())\r\nprices = []\r\nqualities = []\r\nfor i in range (n):\r\n a, b = map(int, input().split())\r\n prices.append(a)\r\n qualities.append(b)\r\nzipped = sorted(zip(prices, qualities), key=lambda x: x[0])\r\nprices, qualities = zip(*zipped)\r\nans = \"Poor Alex\"\r\nfor i in range(n-1):\r\n if qualities[i] > qualities[i+1]:\r\n ans = \"Happy Alex\"\r\n break\r\nprint(ans)", "mymap = {}\r\nn = int(input())\r\ntppr = []\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n mymap[a] = b\r\n tppr.append(a)\r\ntppr.sort()\r\nl = 0\r\nr = 1\r\nwhile r < n:\r\n if mymap[tppr[l]] > mymap[tppr[r]]:\r\n print(\"Happy Alex\")\r\n break\r\n r+=1\r\n l+=1\r\nelse:\r\n print(\"Poor Alex\")\r\n\r\n\r\n", "n = int(input())\n\nlaptops = [None] * n\nfor i in range(n):\n laptops[i] = list(map(int, input().split()))\n\nlaptops = sorted(laptops)\nflag = True\nfor i in range(n-1):\n if laptops[i][1] > laptops[i+1][1]:\n flag = False\n break\n else:\n flag = True\nif(flag):\n print('Poor Alex')\nelse:\n print('Happy Alex')\n\n \t \t \t\t \t \t\t\t\t \t \t\t\t\t \t", "def testcase():\n x = int(input().strip())\n a, b = [], []\n for i in range(x):\n a.append(list(map(int, input().strip().split())))\n a = sorted(a, key=lambda x: (x[0], -x[1]))\n\n for i in range(1, x):\n if a[i][1] < a[i-1][1]:\n print(\"Happy Alex\")\n return\n\n print(\"Poor Alex\")\n\n\nif __name__ == '__main__':\n t = 1\n \n for _ in range(t):\n testcase()", "n = int(input())\r\nfor i in range(n):\r\n p, q = map(int,input().split())\r\n if p > q:\r\n print(\"Happy Alex\")\r\n exit()\r\n \r\nprint(\"Poor Alex\")", "n = int(input())\r\nlsta = []\r\nlstb = []\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n lsta.append(a)\r\n lstb.append((a, b))\r\nlsta.sort()\r\nlstb.sort(key=lambda x: x[1])\r\nisFound = False\r\nfor i in range(len(lsta)):\r\n if lstb[i][0] != lsta[i]:\r\n print(\"Happy Alex\")\r\n isFound = True\r\n break\r\nif not isFound:\r\n print(\"Poor Alex\")\r\n", "n = int(input())\r\na = []\r\nb = []\r\nc = {}\r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\ta.append(x)\r\n\tb.append(y)\r\n\tc[y] = x\r\na.sort()\r\nb.sort()\r\nfor i in range(n):\r\n\tif c[b[i]] != a[i]:\r\n\t\tprint('Happy Alex')\r\n\t\tbreak\r\nelse:\r\n\tprint('Poor Alex')\r\n\t", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n a, b = input().split()\r\n if a == b:\r\n c += 1\r\nif c == n:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "'''\n###### * User Profile : Keval_78\nLinkedIn: https://www.linkedin.com/in/kevalpadsala78/\nGithub: https://github.com/Keval78\nLeetcode: https://leetcode.com/Keval_78/\n'''\n\nimport sys\nfrom os import path\nfrom math import log2, floor, ceil, sqrt, pow, gcd\n# from random import random, randint, shuffle, choice\nfrom collections import Counter, defaultdict, deque\n# from itertools import permutations, combinations\n# from functools import reduce\n# from heapq import heapify, heappop, heappush, heapreplace\nfrom bisect import bisect_left, bisect_right\n\n\ndef si(): return sys.stdin.readline().strip()\ndef ii(): return int(si())\ndef mi(ss=\" \"): return map(int, si().split(ss))\ndef msi(ss=\" \"): return map(str, si().split(ss))\ndef li(ss=\" \"): return list(mi(ss))\n\n\nsys.setrecursionlimit(10 ** 5)\nMOD, MOD2, INF = 10 ** 9 + 7, 998244353, float('inf')\nMAX = 10**5+1\n\nn = ii()\narr = []\nfor i in range(n):\n a, b = mi()\n arr.append((a, b))\n\narr.sort()\nfor i in range(1, n):\n if arr[i-1][1] > arr[i][1]:\n print(\"Happy Alex\")\n break\nelse:\n print(\"Poor Alex\")\n", "\r\n\r\nif __name__ == \"__main__\":\r\n nums = []\r\n flag = True\r\n for _ in range(int(input())):\r\n data = tuple(map(int, input().split()))\r\n if data[0] < data[1]: print (\"Happy Alex\"); flag = False; break\r\n \r\n if flag: print (\"Poor Alex\")\r\n ", "def main():\n num_lines = int(input())\n dict = {}\n curr_line = 0\n while curr_line != num_lines:\n take = input().split()\n dict[int(take[0])] = int(take[1])\n curr_line += 1\n curr_max = None\n val = False\n for key in sorted(dict):\n if curr_max == None:\n curr_max = dict[key]\n else:\n if dict[key] < curr_max:\n print('Happy Alex')\n val = True\n break\n elif curr_max < dict[key]:\n curr_max = dict[key]\n if not val:\n print('Poor Alex')\nmain()\n", "def func(): \r\n n = int(input())\r\n \r\n lst = [tuple(map(int, input().split())) for _ in range(n)]\r\n \r\n lst = sorted(lst, key=lambda x:x[0])\r\n \r\n res = 'Poor Alex'\r\n \r\n for i in range(n-1):\r\n if lst[i+1][0] > lst[i][0] and lst[i+1][1] < lst[i][1]:\r\n res = 'Happy Alex'\r\n break\r\n print(res)\r\n \r\nif __name__ == '__main__':\r\n func()", "num = int(input())\nlaps = [None] * num\nfor i in range(num):\n laps[i] = list(map(int, input().split()))\nlaps = sorted(laps)\nif any(laps[i][1] > laps[i + 1][1] for i in range(num - 1)):\n print('Happy Alex')\nelse:\n print('Poor Alex')\n \t \t\t \t \t \t\t \t\t \t\t \t\t\t\t", "def comp(arr1):\r\n if arr1[0]!=arr1[1]:\r\n return True\r\n else:\r\n return False\r\nprinted=True\r\nfor i in range(int(input())):\r\n arr1=list(map(int,input().split()))\r\n ans=comp(arr1)\r\n if ans==True:\r\n printed=False\r\n print('Happy Alex')\r\n break\r\nif printed:\r\n print('Poor Alex')", "n=int(input())\r\nlaptops = []\r\n\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n #print(a,b)\r\n laptops.append((a,b))\r\n\r\n#以列表中每个元组的第一个元素为指标来排序\r\nlaptops.sort(reverse=True)\r\n#print(laptops)\r\nquality_min=laptops[0][1]\r\nfor laptop in laptops[1:]:\r\n if laptop[1]>quality_min:\r\n print(\"Happy Alex\")\r\n break\r\n quality_min=laptop[1]\r\n#for-else：在 for 循环后面使用 else，用于在循环正常结束后执行的代码块。\r\n# 如果循环被 break 中断，则不会执行 else 代码块。\r\nelse:\r\n print(\"Poor Alex\")\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Sep 21 23:12:50 2022\r\n\r\n@author: lpf\r\n\"\"\"\r\ndef f(x,y):\r\n if x>y:\r\n return 1\r\n elif x==y:\r\n return 0\r\n else:\r\n return -1\r\n\r\nn=int(input());x=[0]*n\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x[i]=f(a,b)\r\nsgn=len(set(x))\r\nprint('Happy Alex' if sgn>1 else 'Poor Alex')\r\n", "l=[]\r\nfor _ in range(int(input())):\r\n l.append(list(map(int,input().split())))\r\nl.sort()\r\nflag=0\r\nfor i in range(len(l)-1):\r\n if l[i][1]>l[i+1][1]:\r\n flag=1\r\n break\r\nif flag:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "t = int(input())\r\nlaptops = []\r\n# enter Ai and Bi\r\nfor i in range(t):\r\n a, b = map(int, input().split())\r\n lap = {}\r\n lap[\"price\"] = a\r\n lap[\"quality\"] = b\r\n laptops.append(lap)\r\n# sort by price\r\nlaptops.sort(key=lambda x: x[\"price\"])\r\n# check if Ai < Ai+1 and Bi > Bi+1\r\nfor i in range(t - 1):\r\n if laptops[i][\"price\"] < laptops[i + 1][\"price\"] and laptops[i][\"quality\"] > laptops[i + 1][\"quality\"]:\r\n print(\"Happy Alex\")\r\n exit()\r\nprint(\"Poor Alex\")\r\n\r\n", "from operator import itemgetter, attrgetter\n\nn = int(input())\nl = [list(map(int, input().split())) for _ in range(n)]\n\n\ndef euh(a, b):\n return a[0] > b[0] or a[0] == b[0] and a[1] > b[1]\n\n\nl = sorted(l, key=itemgetter(0, 1))\nprinted = False\nfor i in range (n-1):\n if l[i][0] == l[i+1][0]:\n continue\n else:\n if l[i][1]>l[i+1][1]:\n print(\"Happy Alex\")\n printed = True\n break\nif not printed:\n print(\"Poor Alex\")", "n = int(input())\r\nk = 'Poor Alex'\r\nfor i in range(n):\r\n a, b =map(int, input().split())\r\n if a != b:\r\n k = 'Happy Alex'\r\nprint(k)", "n = int(input())\r\n\r\ndef quality(n):\r\n pr = []\r\n for _ in range(n):\r\n first, second = map(int, input().split())\r\n pr.append((first, second))\r\n\r\n pr.sort()\r\n\r\n for j in range(n - 1):\r\n if pr[j][0] < pr[j + 1][0] and pr[j][1] > pr[j + 1][1]:\r\n return \"Happy Alex\"\r\n\r\n return \"Poor Alex\"\r\n\r\nprint(quality(n))", "n = int(input())\r\nans = \"Poor\"\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n if a!=b:\r\n ans = \"Happy\"\r\n \r\nprint(ans,\"Alex\")\r\n", "l = []\r\nn = int(input())\r\nfor i in range(n):\r\n l.append(tuple(map(int, input().split())))\r\nl.sort()\r\nflag = False\r\nfor i in range(n-1):\r\n if l[i][0] <= l[i+1][0] and l[i][1] > l[i+1][1]:\r\n flag = True\r\n break\r\nif(flag):\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n = int(input())\r\nlaptops = set()\r\nfor i in range(n):\r\n laptops.add(tuple(map(int,input().split())))\r\n\r\ns_price = sorted(laptops)\r\nfor i in range(n-1):\r\n if s_price[i][1] > s_price[i+1][1]:\r\n print(\"Happy Alex\")\r\n exit()\r\n\r\nprint(\"Poor Alex\")", "n = int(input())\r\nab = list([0, 0] for i in range(n))\r\n\r\nfor i in range(n):\r\n ab[i][0], ab[i][1] = list(int(num) for num in input().split())\r\n\r\nab.sort(key = lambda abi: abi[0])\r\n\r\nDima_is_right = True\r\nfor i in range(1, n):\r\n if ab[i - 1][1] >= ab[i][1]:\r\n Dima_is_right = False\r\n\r\nif Dima_is_right:\r\n print('Poor Alex')\r\nelse:\r\n print('Happy Alex')", "if __name__ == \"__main__\":\r\n n = int(input())\r\n\r\n for i in range(n):\r\n price, value = list(map(int, input().split()))\r\n \r\n if price == value:\r\n continue\r\n else:\r\n print(\"Happy Alex\")\r\n exit()\r\n print(\"Poor Alex\")\r\n", "lst = []\r\nfor i in range(int(input())):\r\n a, b = map(int, input().split())\r\n lst.append([a, b])\r\n\r\nl = len(lst)\r\nif l == 1:\r\n print('Poor Alex')\r\n quit()\r\n\r\nquality_laptops = {}\r\npricy_laptops = {}\r\nfor x in lst:\r\n quality_subtractor = x[1]-x[0]\r\n quality_laptops[quality_subtractor] = x\r\n\r\n pricy_subtractor = x[0]-x[1]\r\n pricy_laptops[pricy_subtractor] = x\r\n\r\nquality = quality_laptops[max(quality_laptops)]\r\npricy = pricy_laptops[max(pricy_laptops)]\r\nif quality[1] > pricy[1] and quality[0] < pricy[0]:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')", "def main():\n\n laptops_n = int(input())\n\n laptops = []\n\n for i in range(0, laptops_n):\n p_q = list(map(int, input().split(' ')))\n price, quality = p_q[0], p_q[1]\n laptops.append({\"price\": price, \"quality\": quality})\n\n laptops_sorted_price = sorted(laptops, key=lambda d: d['price'])\n laptops_sorted_quality = sorted(laptops, key=lambda d: d['quality'])\n\n return \"Happy Alex\" if laptops_sorted_price != laptops_sorted_quality else \"Poor Alex\"\n\n\nif __name__ == '__main__':\n print(main())\n", "n = int(input())\nans = \"Poor Alex\"\npriceQuality = []\nfor i in range(n) :\n p,q = map(int,input().split())\n priceQuality.append([p,q])\n\npriceQuality.sort(key = lambda x : -x[0])\n\nquality = []\n\nfor i in priceQuality :\n quality.append(i[1])\n\nfor i in range(1,len(quality)) :\n if(quality[i] > quality[i-1]) :\n ans = \"Happy Alex\"\n\nprint(ans)\n\n", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int, input().split())))\r\narr = sorted(arr, key=lambda x:x[0])\r\nfor ind in range(n-1):\r\n if arr[ind+1][1] < arr[ind][1]:\r\n print(\"Happy Alex\")\r\n exit(0)\r\nprint(\"Poor Alex\")\r\n", "# Source: https://usaco.guide/general/io\nn=int(input())\ntom = []\nton = False \nprev = 0\nfor _ in range(n):\n\ta = list(map(int,input().split()))\n\ttom.append(a)\ntom.sort(key=lambda x: x[0],reverse=True)\nfor con in range(len(tom)):\n\tterm = tom[con]\n\tif con == 0:\n\t\tprev = term[1]\n\telse:\n\t\tif term[1] > prev:\n\t\t\t#solved \n\t\t\tton = True\n\t\t\tbreak\n\t\telse:\n\t\t\tprev = term[1]\nif ton == True:\n\tprint(\"Happy Alex\")\nelse:\n\tprint(\"Poor Alex\")\n", "n = int(input())\r\nm = 0\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n if x <y :\r\n m = 1 \r\n break \r\nif m == 1:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")", "n = int(input()) # Read the number of laptops\n\nlaptops = [] # List to store laptop descriptions\nfor _ in range(n):\n a, b = map(int, input().split())\n laptops.append((a, b))\n\n# Sort laptops based on their prices\nlaptops.sort()\n\n# Check if there exists a laptop with higher quality but lower price\nfor i in range(n - 1):\n if laptops[i][1] > laptops[i+1][1]:\n print(\"Happy Alex\")\n break\nelse:\n print(\"Poor Alex\")\n\n \t\t \t \t\t\t\t\t\t \t\t\t\t \t \t \t\t \t \t", "# t = int(input())\nt = 1\n\n\n\ndef cp():\n n = int(input())\n lst = [\n tuple(map(int,input().split())) for _ in range(n)\n ]\n lst.sort()\n for i in range(n-1):\n if lst[i][1] > lst[i+1][1]:\n print('Happy Alex')\n return\n print('Poor Alex')\n\n\nfor i in range(t):\n cp()\n", "c=\"Poor\"\r\nfor i in range(int(input())):\r\n a,b=input().split(\" \")\r\n if a!=b:\r\n c=\"Happy\"\r\nprint(c,\"Alex\")", "l=[]\r\nfor _ in range(int(input())):\r\n a,b= map(int, input().split())\r\n if b>a: l.append(\".\")\r\nprint(\"Happy Alex\" if len(l)>=1 else \"Poor Alex\")", "num = 0\r\ntotal = []\r\nfor i in range(0,int(input())):\r\n a=[int(x) for x in input().split()]\r\n total.append(a)\r\ntotal.sort(reverse = True)\r\nfor item in total[1:]:\r\n if item[1] >= total[0][1]:\r\n print(\"Happy Alex\")\r\n num = 1\r\n break\r\n else:\r\n total[0] = item\r\nif num == 0:\r\n print(\"Poor Alex\")", "n = int(input())\r\nlst = []\r\n\r\nfor i in range(n):\r\n yo = list(map(int, input().split()))\r\n lst.append(yo)\r\n\r\nlst.sort(key=lambda x: x[0])\r\n\r\nflag = False\r\n\r\nfor i in range(n - 1):\r\n if lst[i][1] > lst[i + 1][1]:\r\n flag = True\r\n break\r\n\r\nif flag==True:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "n = int(input())\r\nintervals = []\r\n\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n intervals.append((a, b))\r\n\r\nintervals.sort() # Сортируем интервалы по началам\r\n\r\nmax_end = intervals[0][1]\r\nbln = 1\r\n\r\nfor i in range(1, n):\r\n if intervals[i][1] < max_end:\r\n bln = 0\r\n break\r\n max_end = max(max_end, intervals[i][1])\r\n\r\nif bln:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")\r\n", "t=int(input())\r\nf=0\r\nfor i in range(t):\r\n a,b=map(int,input().split())\r\n if a>b or b<a:\r\n f=1 \r\nif f==1:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')\r\n ", "n = int(input())\r\nnotebooks = []\r\nfor _ in range(n):\r\n notebooks.append(tuple(map(int, input().split())))\r\nnotebooks.sort(key=lambda x:x[1], reverse=True)\r\nfor i in range(len(notebooks) - 1):\r\n if notebooks[i][0] < notebooks[i + 1][0] and notebooks[i][1] > notebooks[i + 1][1]:\r\n print('Happy Alex')\r\n break\r\nelse:\r\n print('Poor Alex')", "n = input()\nprice_quality = []\nfor i in range(int(n)):\n temp = input().split()\n price_quality.append((int(temp[0]),int(temp[1])))\n\nprice_quality.sort()\nhappy = False\nmax_quality = price_quality[0][1]\nfor price, quality in price_quality:\n if max_quality > quality:\n happy = True\n break\n max_quality = max(max_quality, quality)\nif happy:\n print(\"Happy Alex\")\nelse:\n print(\"Poor Alex\")\n \t \t\t \t\t \t \t \t\t\t \t\t\t", "n = int(input())\r\npri_qua = {}\r\nwhile n > 0 :\r\n a,b = map(int,input().split())\r\n pri_qua[a] = b\r\n n -= 1\r\nprices_1 = pri_qua.keys()\r\nqualities_1 = pri_qua.values()\r\nprices_2 = sorted(prices_1)\r\nqualities_2 = sorted(qualities_1)\r\nqualities_3 = []\r\nfor price in prices_2 :\r\n qualities_3.append(pri_qua[price])\r\nif qualities_2 == qualities_3 :\r\n print(\"Poor Alex\")\r\nelse :\r\n print(\"Happy Alex\")\r\n", "N = int(input())\n\nlaptops = [None] * N\nfor i in range(N):\n laptops[i] = list(map(int, input().split()))\n\nif all(laptops[i][0] == laptops[i][1] for i in range(N)):\n print('Poor Alex')\nelse:\n laptops = sorted(laptops)\n \n if any(laptops[i][1] > laptops[i+1][1] for i in range(N-1)):\n print('Happy Alex')\n else:\n print('Poor Alex')\n\n \t \t\t\t \t \t\t \t \t\t \t \t\t\t \t \t \t", "def main():\r\n c=\"Poor\"\r\n for i in range(int(input())):\r\n a,b=input().split()\r\n if a!=b:\r\n c=\"Happy\"\r\n print(c,\"Alex\")\r\n\r\nmain()", "n = int(input())\r\nls_1=[]\r\nls_2=[]\r\nfor i in range (n):\r\n p,q = map(int,input().split())\r\n ls_1.append([i,p])\r\n ls_2.append([i,q])\r\nls_1 = sorted(ls_1,key= lambda x: x[1])\r\nfor i in range (n-1):\r\n a1=ls_1[i][0]\r\n a2=ls_1[i+1][0]\r\n if ls_2[a1][1]>ls_2[a2][1]:\r\n print('Happy Alex')\r\n break\r\nelse :\r\n print(\"Poor Alex\")", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\narr = []\r\nflag = 0\r\nfor i in range(n):\r\n arr.append([int(i) for i in input().split()])\r\narr.sort()\r\nfor i in range(1, n):\r\n if (arr[i][1] < arr[i-1][1]):\r\n flag = 1\r\n break\r\n\r\nif (flag == 0):\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")\r\n", "import operator\r\n \r\nn=eval(input())\r\ndicLaptops={}\r\nfor i in range(n):\r\n price,performance=map(int,input().split())\r\n dicLaptops[price]=performance\r\n \r\n \r\nlsPrice=sorted(dicLaptops)\r\n \r\nlsPf=[dicLaptops[key] for key in lsPrice]\r\n \r\nlsPf2=sorted(lsPf)\r\n \r\nif operator.eq(lsPf,lsPf2):\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")\r\n", "n=eval(input())\r\nlsLaptops=[]\r\nfor i in range(n):\r\n price,performance=map(int,input().split())\r\n lsLaptops.append([price,performance])\r\n \r\nlsLaptops.sort()\r\n\r\nflag=0\r\nfor i in range(1,len(lsLaptops)):\r\n if lsLaptops[i][1] < lsLaptops[i-1][1]:\r\n flag=1\r\n break\r\n \r\nif flag==0:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")\r\n", "arr = []\r\n\r\nfor _ in range(int(input())):\r\n\tai, bi = map(int, input().split())\r\n\tarr.append((ai, bi))\r\n\r\narr.sort()\r\n\r\nmin_arr = [0] * len(arr)\r\n\r\ncur_min = 1e9\r\nfor i in range(len(arr)-1, -1, -1):\r\n\tmin_arr[i] = cur_min\r\n\tif arr[i][1] < cur_min:\r\n\t\tcur_min = arr[i][1]\r\n\r\nfor i in range(len(arr)):\r\n\tif arr[i][1] > min_arr[i]:\r\n\t\tprint(\"Happy Alex\")\r\n\t\tbreak\r\nelse:\r\n\tprint(\"Poor Alex\")", "n = int(input())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n x, y = [int(x) for x in input().split()]\r\n a.append(x)\r\n b.append(y)\r\na.sort(key=dict(zip(a, b)).get)\r\nflag = 0\r\nfor i in range(n - 1):\r\n if (a[i] > a[i + 1]):\r\n flag = 1\r\n break\r\nif (flag == 0):\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "q = [[int(x) for x in input().split()] for _ in range(int(input()))]\nq.sort(key=lambda x: x[1], reverse=True)\nfound = False\n \nfor i in range(len(q)-1):\n\tif ( q[i][1] > q[i+1][1] and q[i][0] < q[i+1][0] ):\n\t\tfound = True\n\t\tbreak\nprint([\"Poor Alex\", \"Happy Alex\"][found])\n\t\t \t \t \t \t \t \t\t\t", "n = int(input())\nlaptops = []\n\nfor _ in range(n):\n ai, bi = map(int, input().split())\n laptops.append((ai, bi))\n\nlaptops.sort()\n\nfor i in range(n-1):\n if laptops[i][1] > laptops[i+1][1]:\n print(\"Happy Alex\")\n exit()\n\nprint(\"Poor Alex\")\n \t \t\t\t \t \t\t\t \t \t\t\t \t\t", "laptops = []\r\nfor _ in range(int(input())):\r\n laptops.append(list(map(int, input().split(\" \"))))\r\nlaptops_copy = laptops.copy()\r\nlaptops.sort(key=lambda x: x[0])\r\nlaptops_copy.sort(key=lambda x: x[1])\r\nif laptops != laptops_copy:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "n=int(input())\r\na=[[int(x) for x in input().split()] for i in range(n)]\r\nflag=False\r\na.sort(reverse=True)\r\nfor i in range(1,n):\r\n if a[i][1]>a[0][1]:\r\n flag=True\r\n break\r\n else:\r\n a[0][1]=a[i][1]\r\nif flag:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n ", "from math import *\nimport sys\n\nn = int(input())\n\nlaps=[]\nfor i in range(n):\n laps.append([int(x) for x in input().split()])\n\nlaps.sort(key=lambda x: x[1])\n\nfor i in range(n-1):\n if (laps[i][0]>laps[i+1][0]):\n print('Happy Alex')\n sys.exit()\nprint('Poor Alex')\n\n\t \t \t\t\t\t\t\t \t\t \t \t", "#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 for i in range(len(x)):\r\n if(x[i]!=y[i]):\r\n return 'Happy Alex'\r\n return 'Poor Alex'\r\nx=[]\r\ny=[]\r\nfor i in range(int(input())):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\nprint(exe())", "for _ in range(int(input())):\r\n i,j=input().split()\r\n if i!=j:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')\r\n \r\n ", "for i in range(int(input())):\r\n x,y=map(int,input().split())\r\n if x!=y:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')", "n = int(input())\r\nstack = []\r\nt = 0\r\nfor i in range(0,n):\r\n a,b = map(int, input().split())\r\n if a != b:\r\n t = 1\r\nif t == 0:\r\n print(\"Poor Alex\")\r\nelse:\r\n print(\"Happy Alex\")", "n = int(input())\r\narr = []\r\nfor _ in range(n):\r\n arr.append(list(map(int, input().split())))\r\nif n < 2:\r\n print(\"Poor Alex\")\r\nelse:\r\n arr.sort()\r\n for i in range(n - 1):\r\n curr, next = arr[i], arr[i+1]\r\n if next[0] > curr[0] and next[-1] < curr[-1]:\r\n print(\"Happy Alex\")\r\n break\r\n else:\r\n print(\"Poor Alex\")", "# https://codeforces.com/contest/456/problem/A\r\n\r\ndef resoudre():\r\n n = int(input())\r\n ab = list(tuple(map(int, input().split())) for _ in range(n))\r\n ab.sort()\r\n\r\n qualite_max = ab[0][1]\r\n qualite_inf_max = float('-inf')\r\n\r\n for i, p in enumerate(ab):\r\n prix, qualite = p\r\n if i > 0 and prix > ab[i - 1][0]:\r\n qualite_inf_max = qualite_max\r\n\r\n if qualite < qualite_inf_max:\r\n return True\r\n\r\n qualite_max = max(qualite, qualite_max)\r\n\r\n return False\r\n\r\nprint('Happy Alex' if resoudre() else 'Poor Alex')\r\n", "n = int(input())\r\nl = []\r\n\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n l.append([x,y])\r\nl.sort()\r\nr = 0\r\nfor i in range(1, n):\r\n if l[i - 1][1] > l[i][1] and l[i - 1][0] < l[i][0]:\r\n r = 1\r\n break\r\n\r\nif r == 1:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "def main():\n n = int(input())\n pairs = []\n for _ in range(n):\n pq = tuple(map(int, input().split(\" \")))\n pairs.append(pq)\n\n pairs.sort(key=lambda x: x[0])\n\n for i, pq in enumerate(pairs):\n if i == 0:\n continue\n if pairs[i-1][1] > pq[1]:\n print('Happy Alex')\n return\n print('Poor Alex')\n\n\nif __name__ == \"__main__\":\n main()\n", "# Press the green button in the gutter to run the script.\r\ndef main():\r\n n = int(input())\r\n alexHappy = False\r\n for i in range(n):\r\n a, b = input().split(\" \")\r\n if a != b:\r\n alexHappy = True\r\n\r\n if alexHappy:\r\n print(\"Happy Alex\")\r\n else:\r\n print(\"Poor Alex\")\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "k={}\r\nfor i in range(int(input())):\r\n p,q=map(int,input().split())\r\n if p not in k.keys():\r\n k[p]=[q,q]\r\n else:\r\n if q>k[p][0]:\r\n k[p][0]=q\r\n elif q<k[p][1]:\r\n k[p][1]=q\r\nl=list(k.keys())\r\nl.sort()\r\nif len(l)==1:\r\n print(\"Poor Alex\")\r\n quit()\r\nfor i in range(len(l)-1):\r\n if k[l[i]][1]>k[l[i+1]][0]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "n = int(input())\nlaptop = []\nfor i in range(n):\n price, quality = map(int, input().split())\n laptop.append((price, quality))\nlaptop.sort()\nfor i in range(1, n):\n if laptop[i][1] < laptop[i-1][1]:\n print(\"Happy Alex\")\n break\nelse:\n print(\"Poor Alex\")\n\t \t \t\t \t \t\t\t\t \t\t \t\t \t", "x = \"Poor\"\r\nfor i in range(int(input())):\r\n a,b = input().split()\r\n if a != b:\r\n x = \"Happy\"\r\nprint(x,\"Alex\")", "laptops_num = int(input())\r\nlaptops_dict = {}\r\nprices = []\r\n\r\nfor i in range(laptops_num):\r\n laptop_specs = input()\r\n price, quality = int(laptop_specs.split()[0]), int(laptop_specs.split()[1])\r\n laptops_dict[price] = quality\r\n prices.append(price)\r\n\r\nprices = sorted(prices)\r\ncheck = False\r\n\r\nfor i in range(len(prices) - 1):\r\n if laptops_dict[prices[i]] > laptops_dict[prices[i + 1]]:\r\n check = True\r\n break\r\n\r\nif check:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n", "t = int(input())\r\nx, y = 0, 0\r\nno = True\r\nfor _ in range(t):\r\n a , b = map(int , input().split())\r\n if a!=b:\r\n print('Happy Alex')\r\n no = False\r\n break\r\n\r\nif no:\r\n print('Poor Alex')", "n = int(input())\r\ndigits = [0] * (10 ** 5 + 1)\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n digits[a] = b\r\nflag = False\r\n\r\nfor i in range(10 ** 5 + 1):\r\n if i != 10 ** 5:\r\n if digits[i] > digits[i + 1] and digits[i + 1] != 0:\r\n flag = True\r\n\r\nif flag:\r\n print('Happy Alex')\r\nelse:\r\n print('Poor Alex')\r\n", "n=int(input())\r\nalex=0\r\nfor i in range(n):\r\n l=list(map(int, input().split()))\r\n if l[0]!=l[1]:\r\n alex+=1\r\nif alex>0:\r\n print(\"Happy Alex\")\r\nelse:\r\n print(\"Poor Alex\")\r\n \r\n ", "# ﷽\r\nfrom collections import defaultdict, deque\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nmod=7+10**9\r\n\r\ndef solve():\r\n d=defaultdict(set)\r\n for _ in range(int(input())):\r\n a,b=[int(i) for i in input().split()]\r\n d[a].add(b)\r\n s=sorted(d.keys())\r\n mx=max(d[s[0]])\r\n for ele in s[1:]:\r\n mn=min(d[ele])\r\n if mx>mn:return \"Happy Alex\"\r\n mx=max(mx,min(d[ele]))\r\n return \"Poor Alex\"\r\n \r\n\r\nif __name__ == \"__main__\":\r\n # for i in range(int(input())):\r\n print(solve())\r\n", "n=int(input())\r\nl1=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n l1.append(l)\r\nl1.sort()\r\nfor i in range(n-1):\r\n if l1[i][1]>l1[i+1][1]:\r\n print(\"Happy Alex\")\r\n break\r\nelse:\r\n print(\"Poor Alex\")", "from sys import stdin\r\n\r\n# https://codeforces.com/problemset/problem/456/A\r\n\r\ndef inp():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef iinp():\r\n\treturn int(inp())\r\n\r\ndef mp():\r\n\treturn map(int, inp().split())\r\n\r\ndef liinp():\r\n\treturn list(mp())\r\n\r\ndef solve(laptops):\r\n for i in range(len(laptops)-1):\r\n a, b = laptops[i][1], laptops[i+1][1]\r\n if a>b:\r\n return 'Happy Alex'\r\n \r\n return 'Poor Alex'\r\n\r\nif __name__==\"__main__\":\r\n laptops = []\r\n\r\n for _ in range(iinp()):\r\n a, b = liinp()\r\n laptops.append((a, b))\r\n laptops.sort()\r\n print(solve(laptops))", "nouts = int(input())\r\nf = False\r\nc = 0\r\nfor i in range(nouts):\r\n a, b = map(int, input().split())\r\n if a == b:\r\n c+=1\r\n if c == nouts:\r\n f = True\r\n\r\nif f:\r\n print('Poor Alex')\r\nelse:\r\n print('Happy Alex')", "# Read the input\r\nn = int(input())\r\nlaptops = []\r\n\r\n# Read the laptop descriptions and store them in a list\r\nfor i in range(n):\r\n price, quality = map(int, input().split())\r\n laptops.append((price, quality))\r\n\r\n# Sort the laptops by price in ascending order\r\nlaptops.sort()\r\n\r\n# Check if there exists a pair of laptops where the first one is cheaper\r\n# and the quality of the first one is higher than the second one\r\nfor i in range(n - 1):\r\n if laptops[i][1] > laptops[i + 1][1]:\r\n print(\"Happy Alex\")\r\n exit()\r\n\r\n# If no such pair exists, print \"Poor Alex\"\r\nprint(\"Poor Alex\")\r\n", "n = int(input())\r\nflag = False\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n if y > x:\r\n flag = True\r\n break\r\n\r\nprint('Happy Alex' if flag else 'Poor Alex')", "n = int(input())\n\ntuples = []\nposs = False\n\nfor i in range(n):\n\n a, b = input().split()\n a, b = int(a), int(b)\n tuples.append((a, b))\n\ntuples.sort(key=lambda x: x[0])\n\nfor i in range(1, n):\n\n if tuples[i][1] < tuples[i-1][1]:\n poss = True\n break\n \nif poss:\n print(\"Happy Alex\")\nelse:\n print(\"Poor Alex\")\n\n\n\n", "t = int(input())\r\ndata = []\r\nfor i in range(t):\r\n price, qual = map(int, input().split())\r\n data.append([price, qual])\r\n\r\ndata = sorted(data)\r\nHappy = False\r\nfor i in range(t - 1):\r\n if data[i][0] < data[i + 1][0] and data[i][1] > data[i + 1][1]:\r\n print(\"Happy Alex\")\r\n Happy = True\r\n break\r\n\r\nif not Happy:\r\n print(\"Poor Alex\")", "n = int(input())\nlaptops = []\nfor i in range(0,n):\n a,b = [int(x) for x in input().split()]\n laptops.append((a,b))\n\nlaptops.sort(key = lambda tup:tup[0])\n\n\n\ndef exist(laptops):\n previousQuality = laptops[0][1]\n for laptop in laptops:\n if laptop[1] < previousQuality :\n return \"Happy Alex\"\n else :\n previousQuality = laptop[1]\n return \"Poor Alex\"\n\nprint(exist(laptops))\n \t \t\t\t \t \t\t\t \t\t\t \t\t", "n = int(input())\r\narr = []\r\nfor i in range(n):\r\n price, quality = map(int, input().split())\r\n arr.append((price, quality))\r\n\r\narr.sort(reverse=True)\r\nfor i in range(len(arr) - 1):\r\n if arr[i][0] > arr[i + 1][0] and arr[i][-1] < arr[i + 1][-1]:\r\n print('Happy Alex')\r\n exit()\r\nprint('Poor Alex')", "n = int(input())\r\nc = {}\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n c.update({a:b})\r\nc = dict(sorted(c.items()))\r\nli = list(c.values())\r\nx = li[0]\r\nfor j in range(n-1):\r\n if x>li[j+1]:\r\n print(\"Happy Alex\")\r\n exit()\r\n x = li[j+1]\r\nprint(\"Poor Alex\")" ]

[ "n = int(input())\r\narr = [int(i) for i in input().split()]\r\nif sum(arr)%n ==0: print(n)\r\nelse: print(n-1)", "n = int(input())\r\nlst = map(int, input().split())\r\nanes = sum(lst)\r\nif anes % n:\r\n n -= 1\r\nprint(n)\r\n", "n = int(input())\nnumbers = input().split()\nlst = [int(x) for x in numbers]\n\nprint(n if sum(lst) % n == 0 else n-1)\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\nx.sort()\r\ny=sorted(x)\r\nv1=sum(x)//n\r\nv2=v1+1\r\ni=0\r\nwhile i<n-1:\r\n x[i+1]-=v1-x[i]\r\n x[i]+=v1-x[i]\r\n i+=1\r\ni=0\r\nwhile i<n-1:\r\n y[i+1]-=v2-y[i]\r\n y[i]+=v2-y[i]\r\n i+=1\r\nprint(max(x.count(x[0]),y.count(y[0])))", "def process(n, nums, mean):\r\n g, l, ans = [], [], 0\r\n for num in nums:\r\n if num>mean: g.append(num)\r\n elif num<mean: l.append(num)\r\n else:ans += 1\r\n \r\n while l and g:\r\n se, ge = l.pop(), g.pop()\r\n \r\n if mean - se > ge - mean:\r\n se += (ge-mean)\r\n ge = mean\r\n ans += 1\r\n l.append(se)\r\n \r\n elif mean - se < ge - mean:\r\n ge -= (mean - se)\r\n se = mean\r\n ans +=1\r\n g.append(ge)\r\n \r\n else: # both equal\r\n ans += 2\r\n \r\n if not g:\r\n return(ans)\r\n else:\r\n ans += (len(g)-1)\r\n return (ans)\r\n\r\nfrom sys import stdin\r\nn = int(stdin.readline())\r\nnums = list(map(int, stdin.readline().split()))\r\n\r\nif sum(nums)//n == sum(nums)/n:\r\n print(process(n, nums, sum(nums)/n))\r\nelse:\r\n if sum(nums)/n > 0:\r\n a = process(n, nums, sum(nums)//n)\r\n b = process(n, nums, 1 + sum(nums)//n)\r\n print(a if a>b else b)\r\n else:\r\n a = process(n, nums, sum(nums)//n)\r\n b = process(n, nums, 1 + sum(nums)//n)\r\n c = process(n, nums, -1 + sum(nums)//n)\r\n print(max(a, b, c))\r\n\r\n \r\n\r\n\r\n \r\n", "import math\r\nimport bisect\r\n\r\n\r\ndef input_list_int():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\nl = input_list_int()\r\n\r\n\r\nif sum(l) % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nif sum(arr)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)\r\n ", "\r\n\r\na=input()\r\nb=list(map(int,input().split()))\r\nc=sum(b)\r\nd=c//len(b)\r\ndef ok():\r\n if c%len(b)==0:\r\n return len(b)\r\n else:\r\n return len(b)-1\r\nprint(ok())", "import math\nfrom collections import Counter\nn = int(input())\na = list(map(int,input().split()))\n\nsu = sum(a)\nif su%n==0:\n print(n)\nelse:\n print(n-1)", "n = int(input())\r\n\r\nl=list(map(int,input().split()))\r\nl=sum(l)\r\nif l%n==0 :\r\n print(n)\r\nelse:\r\n print(n-1)\r\n ", "n = int(input())\r\nls = list(map(int, input().split()))\r\nx = sum(ls)\r\nif x % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)\r\n", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nans=0\r\nS=abs(sum(nums))\r\nif S%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)\r\n \r\n ", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nprint(n if sum(a) % n == 0 else n - 1)", "from math import pi\n\n\ndef main():\n n = int(input())\n s = sum(map(int, input().split()))\n if s % n:\n n -= 1\n print(n)\n\n\nif __name__ == '__main__':\n main()", "#rOkY\r\n#FuCk\r\n\r\n################################ kOpAl ############################################\r\n\r\n\r\na=int(input())\r\nl=list(map(int,input().split()))\r\ns=sum(l)\r\nif(s%a==0):\r\n print(a)\r\nelse:\r\n print(a-1)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ns = sum(arr)\r\nif(s % n == 0):\r\n print(n)\r\nelse:\r\n print(n - 1)\r\n", "x=int(input())\r\nsm=sum(list(map(int,input().split())))%x\r\nif sm==0:\r\n\tprint(x)\r\n\r\nelse:\r\n\tprint(x-1)", "# Author: Riddhish V. Lichade\r\n# username: root_rvl\r\n# codeforces 246B\r\nfrom collections import Counter\r\nfrom sys import stdin, stdout\r\nfrom heapq import nlargest, nsmallest\r\ndef outnl(x): stdout.write(str(x) + '\\n')\r\ndef outsl(x): stdout.write(str(x) + ' ')\r\ndef instr(): return stdin.readline().strip()\r\ndef inint(): return int(stdin.readline())\r\ndef inspsint(): return map(int, stdin.readline().strip().split())\r\ndef inlist(): return list(map(int, stdin.readline().strip().split()))\r\nfor _ in range(1):\r\n n=inint()\r\n l=inlist()\r\n s=sum(l)\r\n if(s % n == 0):\r\n print(n)\r\n else:\r\n print(n-1)\r\n", "n = int(input())\na = list(map(int,input().split(' ')))\ns = sum(a)\n\nif s % n:\n print(n - 1)\nelse:\n print(n)\n\n", "n = int(input())\narray = [int(x) for x in input().split(' ')]\n\nif sum(array) % n == 0:\n\tprint(n)\nelse:\n\tprint(n-1)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nk = sum(arr) % n\r\nprint(max(n - k, n - 1))\r\n", "n = int(input())\r\nA=list(map(int,input().split()))\r\nx=0\r\nfor i in A:\r\n x+=i\r\nif not x%n:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nif (sum(m)//n)*n==sum(m):print(n)\r\nelse:print(n-1)", "n=int(input())\r\nL=input().split()\r\nsum=0\r\nfor i in L:\r\n sum+=int(i)\r\nif(sum%n!=0):\r\n print(n-1)\r\nelse:\r\n print(n)", "n = int(input())\na = sorted(list(map(int, input().split(' '))))\ns = sum(a)\n\nif s % n == 0:\n print(n)\nelse:\n print(n - 1)\n", "n=int(input())\r\ns=sum(list(map(int, input().split())))+228000*n\r\nprint(max(n-s%n, n-1))", "n=int(input())\nl=list(map(int,input().split()))\nsum=0\nfor i in l:\n sum+=i \nif(sum%n==0):\n print(n)\nelse:\n print(n-1) ", "n = int(input())\r\narray = [int(c) for c in input().split()]\r\n\r\nprint(n if sum(array) % n == 0 else n-1)", "n = int(input())\na = list(map(int,input().split()))\nif sum(a)%n == 0:\n print(n)\nelse:\n print(n-1)\n", "n = int( input( ) )\r\nif sum( map( int , input( ).split( ) ) ) % n :\r\n n -= 1\r\nprint( n )", "n=int(input()) ; arr=list(map(int,input().split())) ; summ=sum(arr) ; avg=summ/n ; print(n if int(avg)==avg else n-1)", "def maxEquals(arr,num):\r\n avg = sum(arr)/num\r\n if round(avg,4)==int(avg):\r\n print(num)\r\n return\r\n print(num-1)\r\n\r\nnum = int(input())\r\narr = [int(x) for x in input().split()]\r\nmaxEquals(arr,num)", "n = int(input())\r\nl = [int(x) for x in input().split(\" \")]\r\ns = 0\r\nfor i in l:\r\n s += i\r\nif s%n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)\r\n", "n = int(input())\nl = list(map(int,input().split()))\nif sum(l) % n == 0:\n print(n)\nelse:\n print(n-1)\n", "n=int(input())\r\nif sum(list(map(int,input().split())))%n!=0: n-=1\r\nprint(n)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nif sum(arr)%n==0:print(n)\r\nelse:print(n-1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif sum(l)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "t=int(input())\r\ns=sum([int(i) for i in input().split()])\r\nif s%t==0:\r\n print(t)\r\nelse:\r\n print(t-1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "def strange_mas(lst):\r\n if sum(lst) % len(lst) == 0:\r\n return len(lst)\r\n return len(lst) - 1\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nprint(strange_mas(a))\r\n", "n = int(input())\r\na,*arr = list(map(int,input().split()))\r\ns = -sum(arr)\r\nif (a-s)%n:\r\n print(n-1)\r\nelse:\r\n print(n)", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\nfrom sys import *\r\n\r\nn, s = int(input()), sum(arr_inp())\r\nprint(n-1 if s%n else n)\r\n", "from math import *\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n print(n if sum(arr)/len(arr) % 1 == 0 else n - 1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "'''\r\nINPUT SHORTCUTS\r\nN, K = map(int,input().split())\r\nN ,A,B = map(int,input().split())\r\nstring = str(input())\r\narr = list(map(int,input().split()))\r\nN = int(input())\r\n'''\r\n\r\n\r\ndef main():\r\n\tN = int(input())\r\n\tarr = list(map(int,input().split()))\r\n\tadd= sum(arr)\r\n\tif add%N==0:\r\n\t\tprint(N)\r\n\telse:\r\n\t\tprint(N-1)\r\n\r\n\t\r\nmain()", "n=int(input())\narray=sum(list(map(int,input().split())))\nif array%n==0:\n\tprint(n)\nelse:\n\tprint(n-1)\n", "n=int(input())\r\na=sum(map(int,input().split()))\r\nif a%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\ns=sum(l)\r\nif s%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\nprint(n if sum(list(map(int,input().split()))) % n == 0 else n-1)\r\n\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nif sum(a) % n == 0:\r\n print(n)\r\nelse:\r\n print(n - 1)", "import sys\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef rinput(): return map(int, sys.stdin.readline().strip().split()) \r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split())) \r\n\r\n\r\nn=iinput()\r\na=list(map(int,input().split()))\r\nif(sum(a)%n==0):\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nma=max(l)\r\nfor i in range(n):\r\n\tans+=(ma-l[i])\r\nif ans%n==0:\r\n\tprint(n)\r\nelse:\r\n\tprint(n-1)\r\n", "input()\narr = list(map(int, input().strip().split()))\nprint(len(arr) if sum(arr)%len(arr) == 0 else len(arr) - 1)\n", "import sys \r\nfrom collections import Counter\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif(sum(a) % n == 0):\r\n print(n)\r\nelse:\r\n print(n - 1)", "#import io, os\r\n#input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn=int(input());arr=list(map(int,input().split()))\r\nif sum(arr)%n==0:print(n)\r\nelse:print(n-1)", "z=int(input())\r\n\r\ndie_Zahlen=[int(i) for i in input().split()]\r\n\r\ngesamt=sum(die_Zahlen)\r\n\r\nif(gesamt%z==0):\r\n print(z)\r\nelse:\r\n print(z-1)", "#dedicated to Rupa & masum ..\r\nn=int(input())\r\n#array=[int(input()) for i in range(n)]\r\narray=list(map(int,input().split()))\r\ns=0\r\nfor i in range(n):\r\n s+=array[i]\r\nif s%n:\r\n print(n-1)\r\nelse:\r\n print(n)\r\n# issor ja koren mongol er jnno koren ..\r\n#happy coding ..", "def Increase_and_Decrease():\r\n arraySize = int(input())\r\n array = list(map(int, input().split()))\r\n\r\n totalSum = sum(array)\r\n\r\n if totalSum % arraySize == 0:\r\n print(arraySize)\r\n else:\r\n print(arraySize-1)\r\n\r\n\r\nIncrease_and_Decrease()", "def maxEquals(arr,num):\r\n even, odd = 0, 0\r\n # for curr in arr:\r\n # if curr%2==0:\r\n # even += 1\r\n # else:\r\n # odd += 1\r\n # if even%2==0 and odd%2==0:\r\n # #0,0,0,2 its num-1 shows that this can't be solved just be even and odds\r\n # #0,0,0,4 its num\r\n # print(num)\r\n # return\r\n \r\n # if (even%2!=0) and (odd%2!=0) :\r\n # print(num-1) #even is odd and odd is also odd, this case is true(proved)\r\n # return\r\n avg = sum(arr)/num\r\n if round(avg,4)==int(avg):\r\n print(num)\r\n return\r\n print(num-1)\r\n\r\n\r\n\r\nnum = int(input())\r\narr = [int(x) for x in input().split()]\r\nmaxEquals(arr,num)", "n = int(input())\r\narr = list(map(int, input().split()))\r\navg = sum(arr)/n\r\nif avg == int(avg):\r\n print(n)\r\nelse:\r\n print(n-1)", "a=int(input())\r\nl=sum(map(int,input().split()))\r\nif l%a==0:\r\n print(a)\r\nelse:\r\n print(a-1)", "n = int(input()); lst = list(map(int, input().split()))\r\nsumLst = sum(lst)\r\nif sumLst%n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nprint(n if sum(arr)%n == 0 else n-1)", "x = int(input(\"\"))\r\ny = str(input(\"\")).split()\r\nsum = 0\r\nfor a in range(x):\r\n sum = sum + int(y[a])\r\nif(sum % x == 0):\r\n print(x)\r\nelse:\r\n print(x-1)", "import sys\r\ninput = sys.stdin.readline\r\nprint = sys.stdout.write\r\ndef main() : \r\n n = int(input())\r\n arr = list(map(int,input().strip().split()))\r\n if sum(arr)%n == 0 :\r\n print(str(n))\r\n else :\r\n print(str(n-1)) \r\n \r\nmain()", "# LUOGU_RID: 102443417\nn, *a = map(int, open(0).read().split())\r\nprint(n - 1 if sum(a) % n else n)", "n = int(input())\r\nnum = list(map(int, input().split()))\r\n\r\nsum = sum(num)\r\nprint(n if sum % n == 0 else n - 1)", "n=int(input())\r\nprint( n if sum((map(int,input().split())))%n==0 else n-1)", "n=int(input())\r\nb=list(map(int,input().split()))\r\nc=sum(b)\r\nif c%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input()) #.split()] #int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nsum_ = sum(arr)\r\nprint(len(arr) - int(sum_%len(arr)!=0))", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = n-1\r\nif sum(a)%n == 0:\r\n ans = n\r\nprint(ans)", "n = int(input())\r\ns = sum([int(i) for i in input().split()])\r\nif s % n == 0:\r\n print(n)\r\nelse:\r\n print(n - 1)", "n = int(input())\narr = list(map(int,input().split()))\ns = sum(arr)\nif(s%n==0):\n print(n)\nelse:\n print(n-1)\n", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nif sum(lst)%n:print(n-1)\r\nelse:print(n)\r\n", "import sys, math, itertools, random, bisect\r\nfrom collections import defaultdict\r\nINF = sys.maxsize\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef input(): return sys.stdin.readline().strip()\r\nmod = 10**9 + 7\r\n\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n a = get_array()\r\n if sum(a)%n==0: print(n)\r\n else: print(n-1)\r\n\r\n\r\n\r\n", "n = int(input())\r\na = sum(list(map(int,input().split())))\r\nprint(n if a % n == 0 else n-1)\r\n\r\n", "# cook your dish here\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left \r\nfrom bisect import bisect_right\r\n \r\ndef L():\r\n return list(map(int, stdin.readline().split()))\r\n \r\ndef In():\r\n return map(int, stdin.readline().split())\r\n \r\ndef I():\r\n return int(stdin.readline())\r\n \r\nP = 1000000007\r\ndef main():\r\n n = I()\r\n arr = L()\r\n if (sum(arr))%n == 0:\r\n print(n)\r\n else:\r\n print(n-1)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()\r\n", "i=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nif sum(l)%i==0:\r\n print(i)\r\nelse:\r\n print(i-1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nsm = sum(arr)\r\nres = n if sm%n==0 else n-1\r\nprint(res)", "from collections import Counter\nfrom math import ceil\n\ndef main():\n n = int(input())\n if sum(map(int, input().split())) % n == 0:\n print(n)\n else:\n print(n-1)\n\n\nmain()\n", "n = int(input())\narr = list(map(int, input().split()))\n\nsum_arr = sum(arr)\nif sum_arr%n == 0:\n print(n)\nelse:\n print(n-1)\n", "def solve(l):\r\n\tn = len(l)\r\n\tif(not sum(l)%n):\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint(n-1)\r\n\r\nN = int(input())\r\nl = list(map(int, input().split()))\r\nans = solve(l)\r\n\r\n\r\n", "n = int(input())\n\na = list(map(int, input().split()))\n\ns = sum(a)\nif s % n:\n print(n-1)\n\nelse:\n print(n)", "n = int(input())\nprint( n-1 if (sum(list(map(int,input().split())))%n) else n )\n \t \t \t\t\t \t \t \t \t \t \t\t \t", "n=int(input())\r\narr=list(map(int,input().split()))\r\nif n==1:\r\n print(1)\r\nelif n==2:\r\n avg=sum(arr)//2\r\n if max(arr)-avg==avg-min(arr):\r\n print(2)\r\n else :\r\n print(1)\r\nelse :\r\n avg=sum(arr)\r\n if avg%n==0:\r\n print(n)\r\n else :\r\n print(n-1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n sum=sum+l[i]\r\nif(sum%n==0):\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n arr = [int(x) for x in input().split()]\r\n arr.sort()\r\n\r\n r = sum(arr) % n\r\n # print(arr)\r\n if r == 0:\r\n print(n)\r\n else:\r\n print(n-1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nu=0\r\nfor i in a :\r\n u+=i\r\nif u % n == 0 :\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nif sum(lst)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\narr = input().split()\narr = [int(i) for i in arr]\n\nsum_arr = sum(arr)\nans = n\nif (sum_arr % n):\n ans = n-1\n\nprint(ans)", "\r\n\r\n\r\na = int(input())\r\n\r\n\r\nt = list(map(int,input().split()))\r\n\r\nu = sum(t)\r\n\r\nif u%a==0:\r\n print(a)\r\nelse:\r\n print(a-1)\r\n", "n = int(input())\r\na,*arr = list(map(int,input().split()))\r\nif (a+sum(arr))%n:\r\n print(n-1)\r\nelse:\r\n print(n)", "n = int(input())\r\narr = [int(k) for k in input().split()]\r\ns = sum(arr)\r\n\r\nif s % n == 0:\r\n print(n)\r\nelse:\r\n print(n - 1)", "n=int(input())\r\nL=[int(i) for i in input().split()]\r\nif sum(L)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "def func(arr):\r\n result_sum = 0\r\n for i in arr:\r\n result_sum += i\r\n if result_sum%len(arr) == 0:\r\n print(len(arr))\r\n else:\r\n print(len(arr)-1)\r\n\r\n\r\nk = int(input())\r\narray = list(map(int, input().split()))\r\nfunc(array)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nprint(n if sum(l)%n==0 else n-1)", "n = int(input())\r\nnum = map(int, input().split())\r\nif sum(num) % n == 0:print(n)\r\nelse:print(n-1)", "import sys,os,io,time,copy,math\r\nfrom functools import lru_cache\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 main():\r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n s=sum(arr)\r\n avg=s/n\r\n if int(avg)==avg:\r\n print(n)\r\n else:\r\n print(n-1)\r\n\r\n\r\nmain()\r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\ns=sum(l)\r\nval=n if s%n==0 else n-1\r\nprint(val)\r\n", "n = int(input())\nl = list(map(int, input().split()))\n\nsum = sum(l)\nprint(n if sum % n == 0 else n - 1)", "n=int(input())\r\nsumm=sum(map(int,input().split()))\r\nif summ%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input());l=sum(list(map(int,input().split())));print([n,n-1][l%n!=0])", "n=int(input())\r\na=sum(map(int,input().split()))\r\nprint(n-1 if a%n!=0 else n)", "def equal(lst):\r\n su=sum(lst)\r\n ln=len(lst)\r\n if su%ln==0:\r\n return ln\r\n else:\r\n return ln-1\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nprint(equal(arr))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nml = min(l)\r\nif ml < 0:\r\n d = 0 - ml\r\n l = [i+d for i in l]\r\n\r\nls = sum(l)\r\n\r\nif ls%n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nif sum(arr) % n == 0:\r\n print (n)\r\nelse:\r\n print (n-1)", "n = int(input())\r\nif sum(list(map(int,input().split())))%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\ns=sum(a)\r\nif s%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input());s=sum(map(int,input().split()));\r\nprint(n-1 if s%n else n)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=sum(a)\r\nif x%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\ns = sum(list(map(int, input().split())))\nif s%n==0:\n print(n)\nelse:\n print(n-1)", "n=int(input())\nl=list(map(int,input().split()))\nif sum(l)%n==0:\n\tprint (n)\nelse:\n\tprint (n-1)", "n = int(input())\narr = list(map(int,input().split()))\nx = sum(arr)\nif x%n==0:\n print(n)\nelse:\n print(n-1)\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nsumm=sum(arr)\r\nif summ%n==0:print(n)\r\nelse:print(n-1)\r\n", "import sys\r\nimport math\r\n#import 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\ntot=0\r\nfor num in ara:\r\n\ttot+=num\r\n\r\ntot//=n\r\n\r\nbaki=0\r\n\r\nfor num in ara:\r\n\tif num>=tot:\r\n\t\tbaki-=(num-tot)\r\n\telse:\r\n\t\tbaki+=(tot-num)\r\n\r\nif baki!=0:\r\n\tprint(n-1)\r\nelse:\r\n\tprint(n)\r\n\r\n\t\r\n", "# https://codeforces.com/problemset/problem/246/B\r\n\r\n\"\"\"\r\nArray of n integers a_1, ..., a_n. Want to have as many equal numbers as possible\r\nCan perform the following operation multiple times:\r\n * Choose two indices in the array i != j\r\n * Increase a_i by 1 and decrease a_j by -1\r\n\r\nFind out the max number of arrays we can turn equal.\r\n\r\nFirst notice that the operation is like a conservation law. The sum must be the same\r\nHowever we can achieve any configuration that has the same sum. We just take a ball out of one\r\nand put that ball in another.\r\n\"\"\"\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\n\r\nif s % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nprint(n if sum(l) % n == 0 else n - 1)\r\n", "n=int(input())\r\nprint([n,n-1][sum(list(map(int,input().split())))%n!=0])\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\navg = sum(arr) // n\r\nleft, right = 0, n - 1\r\n\r\nwhile left < right:\r\n missing_left = avg - arr[left]\r\n extra_right = arr[right] - avg\r\n\r\n if missing_left < extra_right:\r\n arr[left] += missing_left\r\n arr[right] -= missing_left\r\n left += 1\r\n elif missing_left == extra_right:\r\n arr[left] += missing_left\r\n arr[right] -= extra_right\r\n left += 1\r\n right -= 1\r\n else:\r\n arr[left] += extra_right\r\n arr[right] -= extra_right\r\n right -= 1\r\n\r\nfreqs = dict()\r\nfor num in arr:\r\n freqs[num] = freqs.get(num, 0) + 1\r\n\r\nprint(max(freqs.values()))", "n = int(input())\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nsum = 0\r\nfor i in range(n):\r\n sum += arr[i]\r\n\r\nif sum % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\na=sum(list(map(int,input().split())))\r\nprint(n-1 if a%n else n)", "# http://codeforces.com/problemset/problem/246/B\nn = int(input())\nprint(n-1 if sum(map(int, input().split()))%n else n)\n", "n = int(input())\r\na = sum(list(map(int, input().split())))\r\nif a%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = sum(w)\r\nif sum(w) % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input(\"\"))\r\narray=input(\"\").split()\r\nvalue=0\r\nfor i in array:\r\n value=value+int(i)\r\nactual=value%n\r\nif(actual==0):\r\n print(n)\r\nelse:\r\n print(n-1)", "import math\r\nn=int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\ns=sum(lst)\r\nif s%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)\r\n#n,m,k = map(int, input().strip().split(' '))\r\n", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[14]:\n\n\n# # n = int(input())\n# # line = list(map(int, input().split()))\n# # line = list(str(input()))\n# from tqdm import trange\n\n\n# In[73]:\n\n\nn = int(input())\nline = list(map(int, input().split()))\n\n\n# In[76]:\n\n\nsum_list = sum(line)\n\nif sum_list%n == 0:\n print(n)\nelse:\n print(n-1)\n\n\n# In[ ]:\n\n\n\n\n\n# In[ ]:\n\n\n\n\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nnet = sum(a)\r\nif (net//n)*n==net:\r\n print(n)\r\nelse:\r\n print(n-1)", "I=input\nnn=int(I())\nif sum(map(int,I().split()))%nn:nn-=1\nprint(nn)\n \t\t\t \t \t \t \t \t\t\t \t \t\t\t\t \t \t\t", "n=int(input())\r\n # n,k=map(int,input().split()) \r\n # s=input()\r\n # n=int(input())\r\narr=list(map(int,input().split()))\r\nif sum(arr)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "i = int(input());print(i if sum(map(int,input().split()))%i==0 else i-1)", "def solution():\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\tif sum(arr)%n:\r\n\t\tprint(n-1)\r\n\telse:\r\n\t\tprint(n)\r\n\r\n\t\r\n\r\n\r\n\r\n\r\n\r\n\treturn\r\n\t\r\n\t\r\n\t\r\n\r\n\r\n\r\nsolution()", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\nimport sys\r\n\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nif(sum(a)%n!=0):n-=1\r\nprint(n)", "#!/usr/bin/env python3\nimport sys\n\nif __name__ == \"__main__\":\n\tn = int(sys.stdin.readline())\n\tais = list(map(int, sys.stdin.readline().split()))\n\tif sum(ais)%n == 0:\n\t\tprint(n)\n\telse:\n\t\tprint(n-1)\n", "I=input\r\nn=int(I())\r\nif sum(map(int,I().split()))%n:n-=1\r\nprint(n)", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nc=sum(b)\r\nif(c%a==0):\r\n print(a)\r\nelse:\r\n print(a-1)\r\n", "n = int(input())\na = [int(x) for x in input().split()]\na.sort()\nif sum(a) % n == 0:\n\tprint(n)\nelse:\n\tprint(n - 1)\n", "n = int(input())\r\nx = sum(map(int,input().split()))% n\r\nif x == 0 :print(n)\r\nelse:print(n-1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif sum(a)%n==0:print(n);exit()\r\nprint(n-1)", "size = int(input().strip())\r\narr = list(map(int, input().strip().split()))\r\ns = sum(arr)\r\nif s % size == 0:\r\n print(size)\r\nelse:\r\n print(size - 1)", "n = int(input())\narr = list(map(int, input().split()))\n\narr.sort()\naverage = sum(arr)//n\n\n\nlow, high = 0, n-1\n\nwhile low < high:\n amount = min(abs(arr[low] - average), abs(arr[high] - average))\n arr[low] += amount\n arr[high] -= amount\n if arr[low] == average:\n low += 1\n if arr[high] == average:\n high -= 1\n\n\nans = sum(1 for x in arr if x == average)\nprint(ans)\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nSum=sum(arr)\r\nif (Sum % n == 0):\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\ndata = list(map(int,input().split()))\r\nif sum(data)%n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\nll=list(map(int,input().split()))\r\nf=sum(ll)\r\n\"\"\"ll.sort()\r\nx,y,res=0,0,0\r\nfor i in range(n):\r\n if ll[i]<=f:\r\n x+=(f-ll[i])\r\n res+=1\r\n else:\r\n break\r\nt=res\r\ng=sum(ll[t:])-x\r\n\r\nfor i in range(t,n):\r\n if ll[i]-f<=g:\r\n res+=1\r\n x-=(ll[i]-f)\r\n else:\r\n break\"\"\"\r\nprint(n) if f//n==f/n else print(n-1)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\ns = sum(a)\r\n\r\nif s % n == 0 :\r\n print(n)\r\nelse:\r\n print(n-1)", "class CodeforcesTask246BSolution:\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 s = sum(self.array)\n if not s % self.n:\n self.result = str(self.n)\n else:\n self.result = str(self.n - 1)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask246BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nsum=int(0)\r\nfor i in l:\r\n sum+=i\r\nif sum%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "import sys\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nasum = sum(a)\r\nif asum % n:\r\n print(n-1)\r\nelse:\r\n print(n)\r\n", "n=int(input())\narr=[int(x) for x in input().split(' ')]\nif not sum(arr)%n:\n\tprint(n)\nelse:\n\tprint(n-1)", "# 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\n\r\n\r\nn = int(input())\r\nli = [int(x) for x in input().split()]\r\ns =sum(li)\r\n\r\nx = s//n\r\n\r\nif(x*n==s):\r\n\tprint(n)\r\nelse:\r\n\tprint(n-1)", "n=int(input())\r\nara=list(map(int,input().split()))\r\nsum=0\r\nfor i in range(n):\r\n sum+=ara[i]\r\np=int(sum/n)\r\nprint(n-1 if p*n!=sum else n)", "I=input\nn=int(I())\nif sum(map(int,I().split()))%n:n-=1\nprint(n)\n \t\t\t\t\t\t\t \t\t \t\t \t\t \t \t\t\t", "number = int(input())\r\nlist_numbers = list(map(int, input().split()))\r\ntotal = sum(list_numbers)\r\nif total % number == 0:\r\n print(number)\r\nelse:\r\n print(number - 1)", "n=int(input()) ; print(n-1 if sum(list(map(int,input().split())))%n else n)", "n = int(input())\r\narr = list(map(int,input().split()))\r\ns = sum(arr)\r\nif s%n:\r\n print(n-1)\r\nelse:\r\n print(n)", "import string\r\n\r\nalph = string.ascii_lowercase\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n summ = sum(a)\r\n if sum(a) % n == 0:\r\n print(n)\r\n else:\r\n print(n-1)\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nprint( n if sum(list(map(int,input().split())))%n==0 else n-1)", "# \r\n# // Problem : B. Increase and Decrease\r\n# // Contest : Codeforces Round #151 (Div. 2)\r\n# // URL : https://codeforces.com/problemset/problem/246/B\r\n# // Memory Limit : 256 MB\r\n# // Time Limit : 2000 ms\r\n# // Powered by CP Editor (https://github.com/cpeditor/cpeditor)\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\nif sum(a)%n==0:\r\n\tprint(n)\r\nelse:\r\n\tprint(n-1)", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\naverage = 0\r\nfor i in range(n):\r\n average+=nums[i]\r\naverage/=n\r\n\r\nif average == int(average):\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nsum = 0\r\nfor i in range(n):\r\n sum+=lis[i]\r\n\r\nif(sum%n==0):\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nif sum(arr) % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\nif sum(arr)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)\r\n", "s = 0\r\nn = int(input())\r\nl = list(map(int, input(). split()))\r\nfor i in range(n):\r\n s += l[i]\r\nif s % len(l) == 0:\r\n print(n)\r\nelse:\r\n print(n - 1)", "from collections import defaultdict\r\nfrom math import floor\r\nn=int(input())\r\narr1=list(map(int,input().split()))\r\ns=sum(arr1)\r\nmul=int(floor(s/n))\r\nres=0\r\nif(mul*n==s):\r\n res=n\r\nelse:\r\n res=n-1\r\nprint(res)\r\n", "n = int(input())\r\narr = list(map(int , input().split()))\r\ns=0\r\nfor i in range(n):\r\n\ts=s+arr[i]\r\nif s%n==0:\r\n\tprint(n)\r\nelse:\r\n\tprint(n-1)", "n = int(input())\r\ni = [int(x) for x in input().split()]\r\nadd = sum(i)\r\nif add % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "import collections\r\nn=int(input())\r\nA=[int(x) for x in input().split()]\r\nA.sort()\r\np=sum(A[:-1])\r\nA[-1]+=p\r\n# print(A)\r\nx=A[-1]/n\r\nif x==int(x):\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\ns = sum(map(int,input().split()))\nprint(n if s%n==0 else n-1)", "n=int(input())\r\nlist1=[int(x)for x in input().split()]\r\nif sum(list1)%n:\r\n print(n-1)\r\nelse:\r\n print(n)\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nsum1 = sum(arr)\r\nres = n\r\nif (sum1 % n):\r\n res = n-1\r\n\r\nprint(res )", "from typing import Counter\r\nn=int(input())\r\nl=sum(list(map(int,input().split())))\r\nif l%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\narr=list(map(int,input().split()))\r\nsummation=sum(arr)\r\nif summation%n==0:\r\n\tprint(n)\r\nelse:\r\n\tprint(n-1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\ns = 0\r\nfor i in range(n):\r\n\ts = s + l[i]\r\nif s%n == 0:\r\n\tprint(n)\r\nelse:\r\n\tprint(n-1)\r\n", "n=int(input())\r\nprint([n,n-1][sum(map(int,input().split()))%n!=0])", "ln = int(input())\r\narr = sorted(list(map(int,input().split())))\r\nfor i in range(ln-1,1,-1):\r\n arr[0] += (arr[i]-arr[1])\r\n arr[i] = arr[1]\r\nn = arr[0]-arr[1]\r\nif (n//ln == n/ln and arr[0]>=arr[1] and n%ln==0) or ln==1:\r\n print(ln)\r\nelse:\r\n print(ln-1)", "n=int(input())\r\nif sum(map(int,input().split()))%n:\r\n n-=1\r\nprint(n)", "n = int(input())\nnums = list(map(int, input().split(\" \")))\n\naverage = int(sum(nums) / len(nums))\n\nif(average - sum(nums) / len(nums) == 0):\n\tprint(len(nums))\nelse:\n\tprint(len(nums) - 1)\n\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nif n==1:\r\n\tprint(0)\r\nelif n==2:\r\n\tif abs(arr[0]-arr[1])%2==0:\r\n\t\tprint(2)\r\n\telse:\r\n\t\tprint(1)\r\nelse:\r\n\td = max(arr)\r\n\tfor i in range(n-1):\r\n\t\tarr[n-1]-=d-arr[i]\r\n\tif (d-arr[n-1])%n==0:\r\n\t\tprint(n)\r\n\telse:\r\n\t\tprint(n-1)\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nj=sum(a)//n\r\nman=0\r\nmos=0\r\nfor i in range(0,len(a)) :\r\n if j-a[i]<0 :\r\n man+=abs(j-a[i])\r\n elif j-a[i]>0 :\r\n mos+=j-a[i]\r\nif man==mos :\r\n print(n)\r\nelse :\r\n print(n-1)", "n = int(input())\r\nprint(n if sum([int(i) for i in input().split()]) % n == 0 else n - 1)", "n = int(input())\r\narray = [int(a) for a in input().split()]\r\nsum = 0\r\n\r\nfor i in range(len(array)):\r\n sum += array[i]\r\n\r\nif sum % n == 0:\r\n print(n)\r\n\r\nelse:\r\n print(n-1)\r\n", "'''input\n6\n-1 1 0 0 -1 -1\n'''\nn = int(input())\na = list(map(int, input().split()))\nprint(n if sum(a) % n == 0 else n - 1)", "def main():\n n = int(input())\n elems = list(map(int, input().split(' ')))\n s = sum(elems)\n if s % n == 0:\n print(n)\n else:\n print(n-1)\n\n\nif __name__ == \"__main__\":\n main()\n", "a=int(input())\r\nb=sum(map(int,input().split()))\r\nif b%a==0:print(a)\r\nelse:print(a-1)", "\r\nimport math\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\n\r\nsumVal = abs(sum(a))\r\n\r\n'''\r\ndiv = sumVal/n\r\n\r\ndiv = math.ceil(div)\r\n\r\nans = sumVal//div\r\n\r\nprint(ans)\r\n'''\r\n\r\nif sumVal%n==0:\r\n print(n)\r\n\r\nelse:\r\n print(n-1)\r\n \r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nx = sum(arr)\r\nif x % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\nif sum(list(map(int,input().split())))%n==0:\r\n print(n)\r\nelse:print(n-1)", "from sys import stdin as sin\ndef gint():return int(sin.readline())\ndef gmap():return map(int,sin.readline().split())\ndef glist():return list(map(int,sin.readline().split()))\ndef gstr():return sin.readline()\n\nn=int(input())\nl=glist()\n\nl.sort()\nm=l[-1]\nfor i in range(n-1):\n l[-1]-=(m-l[i])\n l[i]=m\nif sum(l)%n==0:print(n)\nelse:print(n-1)", "from sys import stdin\r\nn = int(stdin.readline())\r\nnums = list(map(int, stdin.readline().split()))\r\n\r\nif sum(nums)%n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n=int(input())\r\nls=list(map(int,input().split()))\r\nprint(n if sum(ls)%n==0 else n-1)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nz = sum(l)\r\nif(z%n==0):\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nlis.sort()\r\nd=c=ans=lower=upper=0\r\ns=sum(lis)//n\r\nfor i in range(n-1,-1,-1):\r\n if lis[i]>s:\r\n d+=(lis[i]-s)\r\n upper+=1\r\n elif s>lis[i]:\r\n c+=(s-lis[i])\r\n lower+=1\r\n else:\r\n ans+=1\r\nif d==c:\r\n print(n)\r\nelif d>c:\r\n print(ans+upper+lower-1)\r\nelif d<c:\r\n print(ans+upper+lower-1)\r\n", "n=int(input())\r\nList=list(map(int, input().split()))\r\nif sum(List)%n==0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nif sum(arr)%n == 0:\r\n\tprint(n)\r\nelse:\r\n\tprint(n-1)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nS = sum(A)\r\nif S % n == 0:\r\n print(n)\r\nelse:\r\n print(n-1)", "n = int(input())\narray = list(map(int, input().split()))\nsums = sum(array)\nif sums % n == 0:\n print(n)\nelse:\n print(n - 1)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=min(a)\r\na=[i+abs(x) for i in a]\r\ns=sum(a)\r\nr=s%n\r\nif r==0:\r\n print(n)\r\nelse:\r\n print(n-1)" ]

[ "n,num,ways,q = int(input()),0,0,0\r\ns = list(map(int,input().split()))\r\nsums = sum(s)\r\nfor i in range(n):\r\n num += s[i]\r\n if num * 3 == sums * 2 and 0 < i < n - 1:\r\n ways += q\r\n if num * 3 == sums:\r\n q += 1\r\nprint(ways)", "from collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\n\r\ntot = sum(a)\r\nctr = Counter()\r\n\r\npref = ans = 0\r\nfor i in range(n-1):\r\n pref += a[i]\r\n\r\n if pref%2 == 0:\r\n need = pref//2\r\n if 3*need == tot:\r\n ans += ctr[need]\r\n\r\n ctr[pref] += 1\r\n\r\nprint(ans)\r\n", "import sys\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncount=0\r\npref = [0]*(n+1)\r\nfor i in range(1, n+1):\r\n pref[i] = pref[i-1] + a[i-1]\r\n\r\ns = pref[n]\r\nif s % 3 != 0:\r\n print(0)\r\n sys.exit()\r\n\r\nx, y = s//3, 2*s//3\r\n\r\ncount_x = 0\r\nfor i in range(1, n):\r\n if pref[i]==y:\r\n count += count_x\r\n if pref[i]==x:\r\n count_x += 1\r\n \r\nprint(count)", "def process(A):\r\n n = len(A)\r\n total = sum(A)\r\n if total % 3 != 0:\r\n return 0\r\n s1_count = 0\r\n curr = 0\r\n answer = 0\r\n for i in range(n-1):\r\n curr+=A[i]\r\n if curr==2*(total//3):\r\n answer+=s1_count\r\n if curr==total//3:\r\n s1_count+=1\r\n return answer\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))", "import sys; R = sys.stdin.readline\r\ndef S(): return map(int,R().split())\r\n \r\nn = int(R())\r\na = [0]+[*S()]\r\nfor i in range(1,n+1): a[i] += a[i-1]\r\nif not a[n]: \r\n k = a.count(0)\r\n print((k-2)*(k-3)//2); exit()\r\nif a[n]<0:\r\n for i in range(1,n+1): a[i] *= -1\r\n\r\nif not a[n]%3:\r\n r = 0\r\n q = a[n]//3\r\n dp = [0,0]\r\n for i in range(n):\r\n if a[i]==q: dp[0] += 1\r\n elif a[i]==2*q: dp[1] += dp[0]\r\n print(dp[1])\r\nelse: print(0)", "n = int(input())\na = list(map(int, input().split()))\ns = sum(a)\ncounter = 0\nprsum = []\nk3 = 0\nc=0\nif s % 3 == 0:\n target = s // 3\n for i in range(n):\n if i == 0:\n prsum.append(a[0])\n else:\n prsum.append(prsum[-1] + a[i])\n #print(prsum)\n #print(prsum.count(target//3))\n for i in prsum:\n c+=1\n if i == target * 2 and c!=1 and c!=len(prsum):\n counter+=k3\n if i == target:\n k3 += 1\n print(counter)\nelse:\n print(0)\n \t\t \t \t\t \t \t\t\t \t\t\t \t\t \t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sum(a)\r\nif b%3!=0:\r\n print(0)\r\nelse:\r\n b//=3\r\n c=[0]*n\r\n d=0\r\n e=0\r\n for i in range(n-2):\r\n d+=a[i]\r\n if d==b:\r\n e+=1\r\n c[i]=e\r\n f=0\r\n g=0\r\n for i in range(n-1,1,-1):\r\n f+=a[i]\r\n g+=int(f==b)*c[i-2]\r\n print(g)", "n = int(input())\n\na = tuple(map(int, input().split()))\n\n\ndef div_3_parts(n, a):\n s = sum(a)\n if s % 3 > 0:\n return 0\n target_sum = s // 3\n count_1 = 0\n count = 0\n\n pref = [None] * n\n\n for i in range(n):\n pref[i] = (pref[i-1] if i>0 else 0) + a[i]\n\n if i == n-1 and pref[i] == 3 * target_sum:\n return count\n\n if pref[i] == 2 * target_sum:\n count += count_1\n\n if pref[i] == target_sum:\n count_1 += 1\n \n\n return 0\n\n\nprint(div_3_parts(n, a))\n\n\t \t \t \t\t \t \t \t \t \t\t\t\t \t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 21 09:53:47 2020\r\n\r\n@author: DELL\r\n\"\"\"\r\n\r\nn = int(input())\r\na = [int(a) for a in input().split()]\r\ns = sum(a)\r\nif s % 3 != 0:\r\n print(0)\r\nelse:\r\n s = s // 3\r\n t = 0\r\n ct = 0\r\n res = 0\r\n for i in range(n - 1):\r\n t += a[i]\r\n if t == 2 * s:\r\n res += ct\r\n if t == s:\r\n ct += 1\r\n print(res)", "n = int(input())\na = list(map(int, input().split()))\n\nsum_i = sum(a)/3\nrl_pref = [0]*(n+1)\ntemp = 0\nfor i in range(1,n+1):\n temp+=a[n-i]\n if temp == sum_i:\n rl_pref[n-i]+=1\n rl_pref[n-i]+=rl_pref[n-i+1]\n \nans = 0\ntemp = 0\nfor i in range(n-2):\n temp+=a[i]\n if temp == sum_i:\n ans+=rl_pref[i+2]\n \nprint(ans)\n \t\t\t \t\t \t \t \t\t \t \t", "from itertools import accumulate\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\np = s // 3\r\nk = list(accumulate(a))\r\nr = list(accumulate(x == 2*p for x in reversed(k)))\r\nprint(0 if s%3 else sum(r[-1-i] - 2*(not p) for i,x in enumerate(k[:-1]) if x == p))", "n=int(input())\r\nA=list(map(int,input().split()))\r\n\r\n\r\nSUM=sum(A)\r\nif SUM%3!=0:\r\n print(0)\r\n exit()\r\n\r\nS=[0]\r\nfor a in A:\r\n S.append(S[-1]+a)\r\n\r\n\r\none=0\r\ntwo=0\r\nLIST=[0]*(n+1)\r\nfor i in range(n+1):\r\n if S[i]==SUM//3:\r\n LIST[i]=1\r\n one+=1\r\n elif S[i]==SUM//3*2:\r\n LIST[i]=2\r\n two+=1\r\n\r\nif SUM!=0:\r\n ANS=0\r\n\r\n for i in range(n+1):\r\n if LIST[i]==1:\r\n ANS+=max(0,two)\r\n elif LIST[i]==2:\r\n two-=1\r\n\r\n print(ANS)\r\n\r\nelse:\r\n one-=2\r\n ANS=0\r\n for i in range(1,n+1):\r\n if LIST[i]==1:\r\n ANS+=max(0,one-1)\r\n one-=1\r\n print(ANS)\r\n \r\n \r\n", "def count_cut_ways(n, numbers):\r\n total_sum = sum(numbers)\r\n if total_sum % 3 != 0:\r\n return 0\r\n\r\n target_sum = total_sum // 3\r\n count = 0\r\n current_sum = 0\r\n prefix_count = [0] * n\r\n\r\n for i in range(n-1):\r\n current_sum += numbers[i]\r\n if current_sum == target_sum:\r\n prefix_count[i] = 1\r\n\r\n if i > 0:\r\n prefix_count[i] += prefix_count[i-1]\r\n\r\n current_sum = 0\r\n for i in range(n-1, 1, -1):\r\n current_sum += numbers[i]\r\n if current_sum == target_sum:\r\n count += prefix_count[i-2]\r\n\r\n return count\r\n\r\nn = int(input())\r\nnumbers = list(map(int, input().split()))\r\n\r\nresult = count_cut_ways(n, numbers)\r\nprint(result)\r\n", "n=int(input())\r\nar=list(map(int,input().split()))\r\ns=sum(ar)\r\nif(s%3!=0):\r\n print(0)\r\nelse:\r\n s1,s2,t,v1,v2=s//3,s//3*2,0,0,0\r\n for e in ar[:-1]:\r\n t+=e\r\n if(t==s2):v2+=v1\r\n if(t==s1):v1+=1\r\n print(v2)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\ns = sum(a)\ncounter = 0\ndots = []\ndots2 = []\nprsum = []\na1 = dict()\nk6 = 0\nk3 = 0\nc=0\nif s % 3 == 0:\n target = s // 3\n for i in range(n):\n if i == 0:\n prsum.append(a[0])\n else:\n prsum.append(prsum[-1] + a[i])\n #print(prsum)\n #print(prsum.count(target//3))\n ''' if counter==target:\n dots.append(i)\n counter=0\n print(dots)\n for x in dots:\n counter=0\n for x1 in range(x+1,n):\n print(a[x1],counter,x1)\n counter+=a[x1]\n if counter == target:\n dots2.append([x,x1])\n print(dots,dots2)'''\n for i in prsum:\n c+=1\n if i == target * 2 and c!=1 and c!=len(prsum):\n counter+=k3\n if i == target:\n k3 += 1\n\n '''k6 += 1'''\n '''a1[i] = k3\n for i in prsum:\n if i == target * 2:\n counter += a1[i]'''\n print(counter)\nelse:\n print(0)\n\n \t \t\t \t\t \t\t \t\t \t \t \t", "from collections import defaultdict\n\n\ndef divideLine(nums: list[int]) -> int:\n res = 0\n N = len(nums)\n pref = [0] * (N+1)\n for i in range(1, N+1):\n pref[i] = pref[i-1] + nums[i-1]\n\n countPrev = defaultdict(int)\n for i in range(1, N):\n countPrev[pref[i]] += 1\n\n for i in range(1, N-1):\n countPrev[pref[i]] -= 1\n a = pref[i] - pref[0]\n keyB = a + pref[i]\n keyC = pref[N] - a\n if keyC == keyB:\n res += countPrev[keyB]\n\n return res\n\n\nif __name__ == \"__main__\":\n _ = int(input().strip())\n nums = list(map(int, input().strip().split()))\n print(divideLine(nums))\n \t \t \t \t \t\t \t \t \t \t \t \t", "n = int(input())\na = list(map(int, input().split()))\n\nsum_i = sum(a) / 3\nrl_pref = [0] * (n + 1)\ntemp = 0\nfor i in range(1, n + 1):\n temp += a[n - i]\n if temp == sum_i:\n rl_pref[n - i] += 1\n rl_pref[n - i] += rl_pref[n - i + 1]\n\nans = 0\ntemp = 0\nfor i in range(n - 2):\n temp += a[i]\n if temp == sum_i:\n ans += rl_pref[i + 2]\n\nprint(ans)\n\n\t \t\t \t\t \t \t \t\t\t \t\t\t\t\t\t \t\t \t", "def solve(n, num):\r\n a = [int(k) for k in num.split()]\r\n a.insert(0, 0)\r\n\r\n s = [0] * (n + 1)\r\n for i in range(1, n + 1):\r\n s[i] = s[i - 1] + a[i]\r\n total = s[n]\r\n ans, cnt = 0, 0\r\n q = total * 2 / 3\r\n \r\n if total % 3 != 0:\r\n return 0\r\n\r\n for i in range(1, n):\r\n if s[i] == q and s[n] - s[i] == total / 3:\r\n ans += cnt\r\n if s[i] == total / 3:\r\n cnt += 1\r\n\r\n return ans\r\n\r\nn = int(input())\r\nnum = input()\r\nresult = solve(n, num)\r\nprint(result)\r\n", "n = int(input())\na = list(map(int, input().split()))\ntotal = sum(a)\nileft = []\ns = 0\nfor i in range(0, n):\n s += a[i]\n if s * 3 == total:\n ileft.append(i)\niright = []\ns = 0\nfor i in range(n - 1, -1, -1):\n s += a[i]\n if s * 3 == total:\n iright.append(i)\nans = 0\nj = len(iright) - 1\nfor left in ileft:\n while j >= 0 and iright[j] - left < 2:\n j -= 1\n ans += j + 1\nprint(ans)", "# n = int(input())\r\n# integers = map(int,input().split())\r\n# s = sum(integers)\r\n# if s%3 != 0 or n>3:\r\n# \tprint(0)\r\n# \texit()\r\n# temp,total,current = 0,0,0\r\n# for i in range(n-1):\r\n# \tcurrent += integers[i]\r\n# \tif current*3 == 2*s:\r\n# \t\ttotal += temp\r\n# \tif current*3 == s:\r\n# \t\ttemp +=1\r\n# print(total)\r\n\r\nfrom itertools import accumulate\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ns = sum(a)\r\np = s // 3\r\nk = list(accumulate(a))\r\nr = list(accumulate(x == 2*p for x in reversed(k)))\r\nprint(0 if s%3 else sum(r[-1-i] - 2*(not p) for i,x in enumerate(k[:-1]) if x == p))" ]

[ "n,m=map(int,input().split())\r\n\r\nX=[tuple(map(int,input().split())) for i in range(m)]\r\n\r\nE=[[] for i in range(m)]\r\n\r\nfor i in range(m):\r\n a,b=X[i]\r\n if a>b:\r\n a,b=b,a\r\n for j in range(i+1,m):\r\n c,d=X[j]\r\n if c>d:\r\n c,d=d,c\r\n\r\n if a<c<b<d or c<a<d<b:\r\n E[i].append(j)\r\n E[j].append(i)\r\n\r\nANS=[-1]*m\r\nfor i in range(m):\r\n if ANS[i]==-1:\r\n ANS[i]=0\r\n\r\n Q=[i]\r\n\r\n while Q:\r\n x=Q.pop()\r\n\r\n for to in E[x]:\r\n if ANS[to]==-1:\r\n ANS[to]=ANS[x]^1\r\n Q.append(to)\r\n else:\r\n if ANS[to]==ANS[x]:\r\n print(\"Impossible\")\r\n exit()\r\n\r\nfor ans in ANS:\r\n if ans==0:\r\n print(\"o\",end=\"\")\r\n else:\r\n print(\"i\",end=\"\")\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, m = map(int, input().split())\r\nedges = [sorted(map(lambda x: int(x) - 1, input().split())) for _ in range(m)]\r\nadj = [[] for _ in range(m)]\r\n\r\nfor i, (u1, v1) in enumerate(edges):\r\n for j, (u2, v2) in enumerate(edges[i + 1:], start=i + 1):\r\n if u1 in (u2, v2) or v1 in (u2, v2):\r\n continue\r\n if (1 if u1 < u2 < v1 else 0) ^ (1 if u1 < v2 < v1 else 0) == 1:\r\n adj[i].append(j)\r\n adj[j].append(i)\r\n\r\ncolor = [-1] * m\r\n\r\nfor i in range(m):\r\n if color[i] != -1:\r\n continue\r\n color[i] = 0\r\n stack = [i]\r\n\r\n while stack:\r\n v = stack.pop()\r\n for dest in adj[v]:\r\n if color[dest] != -1 and color[dest] == color[v]:\r\n print('Impossible')\r\n exit()\r\n if color[dest] == -1:\r\n color[dest] = color[v] ^ 1\r\n stack.append(dest)\r\n\r\nans = ''.join('o' if color[i] else 'i' for i in range(m))\r\nprint(ans)\r\n", "from sys import stdin, stdout\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\n\r\ndef intersect(x,y):\r\n if x[0] < y[0] and y[0] < x[1] and x[1] < y[1]:\r\n return True\r\n elif y[0] < x[0] and x[0] < y[1] and y[1] < x[1]:\r\n return True\r\n else:\r\n return False\r\n\r\ndef main():\r\n input = stdin.readline\r\n n, m = map(int, input().split())\r\n edges = []\r\n for _ in range(m):\r\n a, b = map(int, input().split())\r\n if a < b:\r\n edges.append((a-1, b-1))\r\n else:\r\n edges.append((b-1, a-1))\r\n graph = [[] for _ in range(2*m)]\r\n\r\n for i, edge in enumerate(edges):\r\n for j in range(i, len(edges)):\r\n xy = [edge, edges[j]]\r\n\r\n if i != j and intersect(xy[0], xy[1]):\r\n graph[i].append(j+m)\r\n graph[j+m].append(i)\r\n\r\n graph[i+m].append(j)\r\n graph[j].append(i+m)\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 ans = []\r\n for i in range(m):\r\n if low[i] == low[i+m]:\r\n stdout.write('Impossible\\n')\r\n return\r\n else:\r\n if low[i] < low[i+m]:\r\n ans.append('i')\r\n else:\r\n ans.append('o')\r\n stdout.write(''.join(ans) + '\\n')\r\n\r\nmain()", "m=int(input().split()[1])\ns=[[sorted([*map(int,input().split())]),-1,[]] for _ in range(m)]\ndef d(n,c):\n if s[n][1]==c:return\n if s[n][1]!=-1:\n print('Impossible')\n exit()\n s[n][1]=c\n for i in s[n][2]:d(i,1-c)\nfor i,j in enumerate(s):\n for h,k in enumerate(s[i+1:],i+1):\n if ((k[0][0]<j[0][0]<k[0][1]and k[0][1]<j[0][1])or\n (k[0][0]<j[0][1]<k[0][1]and k[0][0]>j[0][0])):\n j[2].append(h)\n k[2].append(i)\nr=''\nfor i,j in enumerate(s):\n if j[1]==-1:d(i,0)\n r+=['i','o'][j[1]]\nprint(r)\n\n\n\n\n\n", "from sys import stdin, stdout\ninput = stdin.buffer.readline\nfrom collections import deque\n\nclass NoSolution(Exception):\n pass\n\ndef main(): \n n, m = map(int,input().split())\n roads = [tuple(map(int,input().split())) for _ in range(m)]\n graph = [[] for _ in range(m)]\n for i in range(m):\n ai, bi = roads[i]\n for j in range(i):\n aj, bj = roads[j]\n if (min(ai, bi) < aj < max(ai, bi) and (bj < min(ai, bi) or bj > max(ai, bi))) or\\\n (min(ai, bi) < bj < max(ai, bi) and (aj < min(ai, bi) or aj > max(ai, bi))) or\\\n (min(aj, bj) < ai < max(aj, bj) and (bi < min(aj, bj) or bi > max(aj, bj))) or\\\n (min(aj, bj) < bi < max(aj, bj) and (ai < min(aj, bj) or ai > max(aj, bj))):\n graph[i].append(j)\n graph[j].append(i)\n\n color = [-1] * m\n try:\n for start in range(m):\n if color[start] == -1:\n color[start] = 0\n to_visit = deque([start])\n while to_visit:\n node = to_visit.popleft()\n for neigh in graph[node]:\n if color[neigh] == -1:\n color[neigh] = color[node] ^ 1\n to_visit.append(neigh)\n elif color[neigh] == color[node]:\n raise NoSolution\n print(''.join(['i','o'][c] for c in color))\n except:\n print('Impossible')\nmain()" ]

[ "n,m,k = list(map(int, input().split(' ')))\n\nextra = m - n\nmaxi = 1\n\nif n == 1:\n print(m)\nelif n == 2:\n if m%2 == 0:\n print(m//2)\n else:\n print(m//2 +1)\nelse:\n for i in range(extra):\n stepPillows = 1 + min(k-1,i) + min(n-k,i)\n if extra >= stepPillows:\n extra -= stepPillows\n maxi += 1\n else:\n break\n print(maxi)\n", "n, m, k = list(map(int, input().split()))\r\ndef cnt(n):\r\n\treturn n * (n + 1) // 2\r\ndef sum(l, r):\r\n\tif l > r:\r\n\t\treturn 0\r\n\td = 0\r\n\tif l <= 0:\r\n\t\td = abs(l) + 1\r\n\t\tl = 1\r\n\treturn cnt(r) - cnt(l - 1) + d\r\nrt = int(1e9) + 2\r\nlt = 1\r\n\r\nwhile rt - lt > 1:\r\n\tmid = (lt + rt) // 2\r\n\ttotal = sum(mid - k + 1, mid) + sum(mid - (n - k), mid - 1)\r\n\tif total <= m:\r\n\t\tlt = mid\r\n\telse:\r\n\t\trt = mid\r\nprint(lt)\r\n", "n, m, k = map(int, input().split())\r\nm -= n\r\nans = 1\r\ns = 1\r\nmini, maxi = min(k-1, n-k), max(k-1, n-k)\r\n\r\nfor i in range(maxi+1):\r\n if m < s:\r\n break\r\n else:\r\n m -= s\r\n ans += 1\r\n s += 2 if i < mini else 1\r\n\r\nans += m//n\r\nprint(ans)\r\n", "def min_pillow_for_side(bed, x):\r\n ret = (x - 1) * x // 2\r\n\r\n if bed > x - 1:\r\n ret += bed - (x - 1)\r\n elif bed < x - 1:\r\n tmp = x - 1 - bed\r\n ret -= tmp * (tmp + 1) // 2\r\n\r\n return ret\r\n\r\n\r\ndef check(x):\r\n return (\r\n min_pillow_for_side(k - 1, x)\r\n + x\r\n + min_pillow_for_side(n - k, x)\r\n <= m\r\n )\r\n\r\n\r\ndef bin_search(s, t):\r\n ret = None\r\n\r\n while s <= t:\r\n mid = (s + t) // 2\r\n\r\n if check(mid):\r\n ret = mid\r\n s = mid + 1\r\n else:\r\n t = mid - 1\r\n\r\n return ret\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nprint(bin_search(1, m))\r\n", "def ss(a,b):\r\n a=min(a,b)\r\n return a*(a+1)//2+(b-a)*a\r\n\r\ndef solve(a,b,p):\r\n lft=p-1\r\n rt=a-p\r\n b-=a\r\n x=0\r\n y=b\r\n while x!=y:\r\n tmp=(x+y+1)//2\r\n if ss(lft,tmp-1) + ss(rt,tmp-1)+tmp > b:\r\n y=tmp-1\r\n else:\r\n x=tmp\r\n return x+1\r\n\r\na,b,p=map(int,input().split())\r\nprint(solve(a,b,p))\r\n", "n,m,k=map(int,input().split())\r\nans=1\r\nm-=n\r\nosn=0\r\nwhile m>1:\r\n if osn==max(k-1,n-k):break\r\n ans+=1\r\n m-=1\r\n osnl,osnr=min(k-1,osn),min(n-k,osn)\r\n osn+=1\r\n m-=(osnl+osnr)\r\nans+=m//n\r\nprint(ans) \r\n", "inn=input()\r\ndata=inn.split()\r\nn=int(data[0])\r\nm=int(data[1])\r\nk=int(data[2])\r\nfrodo=1\r\npillows=m-n\r\nleft=k-1\r\nright=n-k\r\nR,L=0,0\r\nx=0\r\n\r\nwhile pillows>x:\r\n pillows=pillows-(1+L+R)\r\n frodo+=1\r\n if left>0:\r\n L+=1\r\n left-=1\r\n x+=1\r\n if right>0:\r\n R+=1\r\n right-=1\r\n x+=1\r\n if (left==0 and right==0):\r\n frodo+=pillows//(1+L+R)\r\n break\r\n\r\nprint(frodo)\r\n", "def tri (x):\r\n\treturn (x*(x+1))//2\r\ndef C( x , k , n ):\r\n\tret =0\r\n\tif x==0:\r\n\t\treturn x\r\n\tif x<=k:\r\n\t\tret = ret+tri(x-1) + (k-x)\r\n\telse:\r\n\t\trem = x-k\r\n\t\tret = ret+tri(x-1)-tri(rem)\r\n\tr=n-k+1\r\n\tif x<=r:\r\n\t\tret=ret+tri(x)+(r-x)\r\n\telse:\r\n\t\trem=x-r\r\n\t\tret=ret+tri(x)-tri(rem)\r\n\treturn ret\r\n\r\n\r\nn,m,k = map( int,input().split() )\r\nans=0\r\nhi=m\r\nlo=0\r\n\r\nwhile lo<=hi:\r\n\tmid = (hi+lo)//2\r\n\tif C(mid,k,n) <=m :\r\n\t\tans=mid\r\n\t\tlo=mid+1\r\n\telse:\r\n\t\thi=mid-1\r\n\r\nprint (ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\r\n", "n, m, k = map(int, input().split())\r\n\r\nm -= n\r\nd = 0\r\nk -= 1\r\nout = 1\r\nwhile m > 1 and d != max(k, n - k - 1):\r\n out += 1\r\n m -= 1\r\n left = min(d, k)\r\n right = min(d, n - k - 1)\r\n d += 1\r\n m -= left\r\n m -= right\r\nout += m // n\r\n\r\nprint(out)\r\n", "from collections import defaultdict\n\ndef possible(ans):\n s=0\n if ans<k:\n s+=ans*(ans+1)/2\n s+=k-ans\n else:\n s+=k*(ans+ans-k+1)/2\n if ans<n-k+1:\n s+=n-k+1-ans\n s+=ans*(ans+1)/2\n else:\n s+=(n-k+1)*(ans+ans-n+k)/2\n return s-ans<=m\n\nn,m,k=map(int,input().split())\nlow,high=0,m\nwhile low!=high:\n mid=(low+high)//2+1\n if possible(mid):\n low=mid\n else:\n high=mid-1\nprint(low)\n\n", "n, m, k = map(int, input().split())\r\n\r\nmin_delta = min(k - 1, n - k)\r\nmax_delta = max(k - 1, n - k)\r\n\r\ntop = ((k - 1) * k + (n - k) * (n - k + 1)) // 2 + (max_delta - min_delta) * min_delta + max_delta + 1\r\n\r\ndef get_level(n, k, level):\r\n\treturn 1 + min(level, k - 1) + min(level, n - k)\r\n\r\nif top <= m:\r\n\tprint(max_delta + 1 + (m - top) // n)\r\nelse:\r\n\tadd = m - n\r\n\tcurr_level = 0\r\n\twhile add >= get_level(n, k, curr_level):\r\n\t\tadd -= get_level(n, k, curr_level)\r\n\t\tcurr_level += 1\r\n\tprint(curr_level + 1)\r\n\r\n\r\n", "n, m, k = input().split()\r\nn = int(n)\r\nm = int(m)\r\nk = int(k)\r\n\r\nm = m - n\r\nk = k - 1\r\ndef verif(n, m, k, r):\r\n a = r-k\r\n b = r - (n - 1) + k\r\n if a > 0:\r\n u = (r - a + 1) * (a + r) // 2\r\n else:\r\n u = r * (r + 1) // 2\r\n if b > 0:\r\n v = (r - b + 1) * (b + r) // 2\r\n else:\r\n v = r * (r + 1) // 2\r\n t = u + v - r\r\n return t <= m\r\n\r\nA = 0\r\nB = 10**10\r\nwhile B - A > 1:\r\n r = (A + B) // 2\r\n if verif(n, m, k, r):\r\n A = r\r\n else:\r\n B = r\r\nres = A + 1\r\nprint(res)", "n, m, k = map(int, input().split())\r\nm -= n\r\nk -= 1\r\nfrodo = 1\r\nleft = right = k\r\n\r\nwhile True:\r\n needed = right - left + 1\r\n if m >= needed:\r\n frodo += 1\r\n m -= needed\r\n left = max(0, left-1)\r\n right = min(n-1, right+1)\r\n if left == 0 and right == n-1:\r\n frodo += m//n\r\n break\r\n else:\r\n break\r\n\r\nprint(frodo)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jan 26 22:18:23 2017\r\n\r\n@author: USER PC\r\n\"\"\"\r\n\r\nn,m,k=input().split(\" \")\r\nn,m,k=int(n),int(m),int(k)\r\nans=1\r\nm-=n\r\na=0\r\nb=0\r\nc=a+b+1\r\nwhile m>=c:\r\n ans+=1\r\n m-=c\r\n if(a<k-1): a+=1\r\n if(b<n-k): b+=1\r\n if(a==k-1 and b==n-k): break\r\n c=a+b+1\r\nans+=m//n\r\nprint(ans)", "def bin_search(l, r, func):\r\n while l < r:\r\n c = (l + r) // 2\r\n val = func(c)\r\n\r\n if l + 1 == r:\r\n if func(r):\r\n return r\r\n if func(l):\r\n return l\r\n\r\n if val:\r\n l = c\r\n else:\r\n r = c - 1\r\n # print('l: %s, r: %s' % (l, r))\r\n if l == r:\r\n return l\r\n else:\r\n return 1\r\n\r\ndef solve(n, m, k):\r\n hr, hl = k-1, n-k\r\n s_one_n = lambda n: n * (1.0 + n) / 2.0\r\n def s_n_m(n, m):\r\n return (m-n+1) * (n+m) / 2.0\r\n def snm(n, m):\r\n return s_one_n(max(n,m)) - s_one_n(min(n,m)-1)\r\n def calc_side(ft, hs):\r\n if hs == 0:\r\n return 0\r\n return s_n_m(max(1, ft - hs), ft - 1) + max(0, hs - ft + 1)\r\n f = lambda x: calc_side(x, hl) + calc_side(x, hr) + x <= m\r\n print(bin_search(1, m*3, f))\r\n\r\nn,m,k = map(int, input().split(' '))\r\nsolve(n,m,k)", "n,m,k = map(int, input().split())\r\n\r\na = 0\r\nb = 0\r\n\r\na_lim = k-1\r\nb_lim = n-k\r\nm = m-n\r\nx = 1\r\n\r\nwhile m-a-b-1 >= 0:\r\n m = m-a-b-1\r\n x += 1\r\n\r\n if a == a_lim:\r\n pass\r\n else:\r\n a += 1\r\n\r\n if b == b_lim:\r\n pass\r\n else:\r\n b += 1\r\n\r\n if a == a_lim and b == b_lim:\r\n x = x + m//n\r\n break\r\n \r\nprint(x)\r\n\r\n \r\n", "import sys\r\nimport math\r\n\r\nn, m, k = map(int, input().split())\r\n\r\nans = 1\r\nm -= n\r\nl = min(k - 1, n - k)\r\nstep = 1\r\n\r\nfor i in range(l):\r\n if m - step < 0:\r\n print(ans)\r\n sys.exit(0)\r\n\r\n m -= step\r\n step += 2\r\n ans += 1\r\n\r\nwhile step < n:\r\n if m - step < 0:\r\n print(ans)\r\n sys.exit(0)\r\n\r\n m -= step\r\n step += 1\r\n ans += 1\r\n\r\nans += m // n\r\n\r\nprint(ans)", "def just_sum(n):\r\n return (n * (n + 1)) // 2\r\n \r\n \r\ndef get_sum(a, b):\r\n return just_sum(b) - just_sum(a - 1)\r\n\r\n\r\ndef check(mid,k,n,sn):\r\n \r\n left = k - 1\r\n right = n - k\r\n \r\n if(left < mid):\r\n left_sum = get_sum(mid-left,mid-1)\r\n else:\r\n left_sum = just_sum(mid-1)\r\n \r\n if(right < mid):\r\n right_sum = get_sum(mid-right,mid-1)\r\n else:\r\n right_sum = just_sum(mid-1)\r\n \r\n return left_sum + right_sum + mid <= sn\r\n\r\n\r\ndef binary_search(n,k,sn):\r\n low = 0\r\n high = sn\r\n \r\n while(low < high):\r\n mid = low + (high - low + 1)//2\r\n if(check(mid,k,n,sn)):\r\n low = mid\r\n else:\r\n high = mid - 1\r\n \r\n return low\r\n\r\n\r\nn,m,k = map(int,input().split())\r\nsn = m - n\r\nprint(binary_search(n,k,sn)+1)\r\n", "n,m,k=[int(x) for x in input().split()]\r\nif(n==1):\r\n print(m)\r\nelse:\r\n m-=n\r\n extra=0\r\n while(m>min(k-1,extra)+min(n-k,extra)):\r\n m-=min(k-1,extra)+min(n-k,extra)+1\r\n extra+=1\r\n print(1+extra)", "from math import ceil\r\n\r\nn, m, k = map(int, input().split())\r\ndef check(p):\r\n rs = 0\r\n if k >= p:\r\n rs += p * (p + 1) // 2\r\n rs += (k - p)\r\n else:\r\n rs += p * (p + 1) // 2\r\n f = p - k\r\n rs -= f * (f + 1) // 2\r\n if (p - 1) <= n - k:\r\n rs += p * (p - 1) // 2\r\n rs += n - k - p + 1\r\n else:\r\n rs += p * (p - 1) // 2\r\n f = (p - 1) - (n - k)\r\n rs -= f * (f + 1) // 2\r\n return rs <= m\r\n \r\nleft = 1\r\nright = 10 ** 9 + 1\r\nwhile right - left > 1:\r\n middle = (right + left) // 2\r\n if check(middle):\r\n left = middle\r\n else:\r\n right = middle\r\nprint(left)\r\n#print(check(3, n, m , k))", "n, m, k = map(int, input().split())\nm -= n\nd = 0\nk -= 1\nans = 1\nwhile m > 1 and d != max(k, n - k - 1):\n ans += 1\n m -= 1\n l = min(d, k)\n r = min(d, n - k - 1)\n d += 1\n m -= l\n m -= r\nans += m // n\n\nprint(ans)", "#@author:LENOVO | 25-Jan-2017 | 11:37:20 PM\r\nimport sys\r\nn,m,k=map(int,input().split())\r\nans=1\r\nm-=n\r\nl=min(k-1,n-k)\r\nstep=1\r\nfor i in range(l):\r\n if m-step<0:\r\n print(ans)\r\n sys.exit(0)\r\n m-=step\r\n step+=2\r\n ans+=1\r\nwhile step<n:\r\n if m-step<0:\r\n print(ans)\r\n sys.exit(0)\r\n m-=step\r\n step+=1\r\n ans+=1\r\nans+=m//n\r\nprint(ans)", "def v(ln, mx):\n return mx * (mx + 1) // 2 - (0 if ln > mx else (mx - ln) * (mx - ln + 1) // 2) + max(0, ln - mx)\n\ndef ok(n, m, k, val):\n return val + v(k - 1, val - 1) + v(n - k, val - 1) <= m\n\n\nn, m, k = map(int, input().split())\nl = -1\nr = 10 ** 10\nwhile l + 1 != r:\n md = (l + r) // 2\n if ok(n, m, k, md):\n l = md\n else:\n r = md\nprint(l)", "q,w,e=map(int,input().split())\r\nw-=q\r\nz=e-1\r\nx=q-e\r\nz,x=min(z,x),max(z,x)\r\nans=1\r\nt=1\r\nwhile (w-t)>=0:\r\n w-=t\r\n ans+=1\r\n if z==x==0:\r\n ans+=w//t\r\n break\r\n if z>0:\r\n z-=1\r\n t+=1\r\n if x>0:\r\n x-=1\r\n t+=1\r\nprint(ans)\r\n", "n,m,k = map(int,input().split())\r\nk1=n-k+1\r\ndef case(x):\r\n res=x\r\n if k==x:res+=x*(x-1)//2\r\n elif k>x:res+=x*(x-1)//2+k-x\r\n else:res+=x*(x-1)//2-((x-k)*(x-k+1)//2)\r\n if k1==x:res+=x*(x-1)//2\r\n elif k1>x:res+=x*(x-1)//2+k1-x\r\n else:res+=x*(x-1)//2-((x-k1)*(x-k1+1)//2)\r\n return res\r\ni,j=0,m\r\nwhile i+1<j:\r\n mid = (i+j)//2\r\n if case(mid)<=m:i=mid\r\n else:j=mid\r\nif n==1:print(m)\r\nelse:print(i)", "n, m, k = map(int, input().split(' '))\r\n\r\ndef met(x,n,k):\r\n k-=1\r\n r = n - k;\r\n k = min(k,x-1)\r\n r = min(r,x)\r\n return ((2*x - k -1)*k//2) + (((2*x - r + 1)*(r))//2)\r\ndef busqueda_binaria(l, r):\r\n if l > r:\r\n return r\r\n mitad = (l + r) //2\r\n if met(mitad,n,k) <= m:\r\n return busqueda_binaria(mitad + 1,r)\r\n return busqueda_binaria(l, mitad - 1)\r\nsol = 1;\r\nm = m-n\r\nsol += busqueda_binaria(0,1000000001)\r\nprint(sol)\r\n", "n, m, k = list(map(int, input().split()))\r\ndef g(a, b): return ((a + a - b + 1) * b) >> 1\r\ndef f(x): return g(x, min(x, k)) + g(x - 1, min(x - 1, n - k))\r\nl, r, res = 1, m - n, 0\r\nwhile l <= r:\r\n mid = (l + r) >> 1\r\n if f(mid) <= m - n: res, l = mid, mid + 1\r\n else: r = mid - 1\r\nprint(res + 1)\r\n", "##r=list(map(int,input().split()))\r\n##n=r[0]\r\n##m=r[1]\r\n##k=r[2]\r\n##\r\n##i=m%n\r\n##if i==0:\r\n## print(m//n)\r\n##else:\r\n## print(m//n+1)\r\n\r\nn,m,k=map(int,input().split())\r\nm-=n\r\nd=0\r\nk-=1\r\nans=1\r\nwhile m>1 and d!=max(k,n-k-1):\r\n ans+=1\r\n m-=1\r\n #print(d,'d',k,'k',n-k-1,'c')\r\n l=min(d,k)\r\n r=min(d,n-k-1)\r\n d+=1\r\n m-=l\r\n m-=r\r\nans+=m//n\r\n\r\nprint(ans)\r\n", " \nif __name__ == '__main__':\n num_hobbits, total_pillows, frodos_bed = map(int, input().split())\n \n #Todos los hobbits deben tener minimo una almohada\n remaining_pillows = total_pillows - num_hobbits\n \n left_neighbor, right_neighbor, pillows_for_frodo = frodos_bed, frodos_bed, 1\n\n # Mientras todavia hayan almohadas y no haya llegado a ambos extremos\n while remaining_pillows > 0 and (right_neighbor < num_hobbits or left_neighbor > 1):\n # Le aumento una almohada a Frodo\n pillows_for_frodo += 1\n\n # Le aumento una almohada al rango de vecinos que he cubierto\n remaining_pillows -= (right_neighbor - left_neighbor + 1)\n \n # Actualizo los extremos\n if left_neighbor > 1: left_neighbor -= 1\n if right_neighbor < num_hobbits: right_neighbor += 1\n \n # Si quedan almohadas, distribuyo equitativamente las que quedan.\n # Esto funciona porque, en el caso de que hubiera un excedente, \n # este excedente no puede ser asignado de tal manera que no quede \n # un hobbit triste porque cada vecino ya se lleva 1 almohada respecto a su otro vecino.\n # Entonces, ya alcanzamos la cantidad maxima de almohadas asignadas\n pillows_for_frodo += remaining_pillows // num_hobbits\n\n print(pillows_for_frodo)\n\n\t \t\t\t \t \t \t \t\t \t\t\t \t\t", "n, m, k = map(int, input().split())\r\nminimum = min(k - 1, n - k)\r\nmaximum = max(k - 1, n - k)\r\nm -= n\r\nresult = 1\r\ns = 1\r\nfor i in range(maximum + 1):\r\n if m - s < 0:\r\n break\r\n else:\r\n m -= s\r\n result += 1\r\n s += 2 if i < minimum else 1\r\nelse:\r\n result += m//n\r\nprint(result)\r\n", "\r\nif __name__ == '__main__':\r\n\tn, m, k = map(int, input().split())\r\n\tm -= n\r\n\tres = 1\r\n\tlvl = 0\r\n\twhile m > 0:\r\n\t\t#print(m)\r\n\t\tx = min(k, lvl+1) + min(n-k, lvl)\r\n\t\tif (x == n):\r\n\t\t\tres += m // n\r\n\t\t\tbreak\r\n\t\telif (m >= x):\r\n\t\t\tm -= x\r\n\t\t\tlvl += 1\r\n\t\t\tres += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tprint(res)", "#!/usr/bin/env python3\ndef ri():\n return map(int, input().split())\nn, m, k = ri()\n\n\ndef area(h, n, k):\n s = n\n if k >= h-1:\n s += h*(h-1)//2\n else:\n s += k*(k+1)//2 + k*(h-k-1)\n\n if n-k >= h-1:\n s += (h-1)*(h-2)//2\n else:\n s += (n-k-1)*(n-k)//2 + (n-k)*(h-n+k-1)\n return s\n\nh1 = 1\nh2 = m\nhmax = 0\nhprev = 0\nwhile True:\n hh = (h1+h2)//2\n if hh == hprev:\n break\n hprev = hh\n mm = area(hh, n, k)\n # print(h1, h2, hmax, hh, mm, m)\n if mm > m:\n h2 = hh\n else:\n h1 = hh+1\n hmax = max(hmax, hh)\n\nprint(hmax)\n\n", "n, m, k = map(int, input().split())\r\n\r\nzostalo = m - n\r\n\r\npocz = k\r\nkon = k\r\n\r\n# odejmujemy te n na początku, a potem wypisujemy odpowiedz + 1\r\n\r\nna_takim_poziomie_na_pewno_moze = 0\r\nna_takim_już_nie = m\r\n\r\nwhile na_takim_poziomie_na_pewno_moze + 1 < na_takim_już_nie: # dopóki jest jeszcze jakaś wysokość o której nic nie wiemy\r\n srodek = (na_takim_poziomie_na_pewno_moze + na_takim_już_nie) // 2\r\n\r\n # teraz chce sprawdzić czy dla wysokosci 'srodek' się da, czy nie i na tej podstawie zawężycz przedział przeszukiwań\r\n # No to musimy policzyć ile potrzeba poduszek\r\n\r\n # trzeba ze wzoru policzyć liczbe użytych poduszek\r\n #\r\n # P\r\n # PPP\r\n # PPPPP\r\n #PPPPPPP\r\n #PPPPPPPP\r\n #-------------\r\n #No ale patrzymy, że to zawsze są (być może przycięte) dwa trójkąty\r\n\r\n # lewa strona\r\n wartosc_srodka = srodek\r\n pozycja_srodka = k\r\n\r\n lewa_granica = max(1, k - srodek)\r\n lewa_wysokosc = srodek - (pozycja_srodka - lewa_granica)\r\n\r\n # to teraz ze wzorku na sume ciagu arytmetycznego\r\n # suma to (dlugosc_przedzialu) * (pierwszy_element + ostatni_element) / 2\r\n\r\n suma_po_lewej = (pozycja_srodka - lewa_granica + 1) * (lewa_wysokosc + wartosc_srodka) // 2\r\n\r\n #prawa strona\r\n prawa_granica = min(n, k + srodek)\r\n prawa_wysokos = srodek - (prawa_granica - pozycja_srodka)\r\n\r\n suma_po_prawej = (prawa_granica - pozycja_srodka + 1) * (prawa_wysokos + wartosc_srodka) // 2\r\n\r\n suma_calkowita = suma_po_lewej + suma_po_prawej - wartosc_srodka # bo srodek byl dwa razy policzony\r\n\r\n if suma_calkowita <= zostalo:\r\n na_takim_poziomie_na_pewno_moze = srodek\r\n else:\r\n na_takim_już_nie = srodek\r\n\r\nprint(na_takim_poziomie_na_pewno_moze + 1) # ta plus jedynka za te pierwsze zabrane n", "\n\ndef pillows_needed(height, width):\n if height > width:\n return height * (height + 1) // 2 - (height - width) * (height - width + 1) // 2\n else:\n return height * (height + 1) // 2 + (width - height)\n\nn, m, k = map(int, input().split())\n\n\na, b, c = 0, m, 0\n\nwhile a < b:\n c = (a + b + 1) // 2\n if m >= c + pillows_needed(c - 1, n - k) + pillows_needed(c - 1, k - 1):\n a = c\n else:\n b = c - 1\n\nprint(a)\n", "n, m, k = map(int, input().split())\ni, j = 1, m\n\ndef check(mid):\n ans = (mid * (mid + 1)) // 2\n if mid > k:\n ans -= ((mid - k) * (mid - k + 1)) // 2\n else:\n ans += (k - mid)\n ans += (mid * (mid - 1)) // 2\n if n - k > mid - 1:\n ans += 1 * (n - k - mid + 1)\n else:\n t = mid - 1 - n + k\n ans -= (t * (t + 1)) // 2\n return ans <= m\n\nwhile i < j:\n mid = (i + j + 1) // 2\n if check(mid):\n i = mid\n else:\n j = mid - 1\n\nprint(j)", "n, a, b = map(int, input().split())\r\nans = 1\r\na -= n\r\nl = b - 1\r\nr = n - b\r\n \r\nput = 1\r\nwhile (a >= put):\r\n a -= put\r\n ans += 1\r\n put += (l > 0) + (r > 0)\r\n if (l): l -= 1\r\n if (r): r -= 1\r\n if (l == r == 0):\r\n ans += (a // put)\r\n break\r\nprint(ans)", "def v(length, start):\r\n W = start * (start + 1) // 2\r\n t = max(0, start - length)\r\n T = t * (t + 1) // 2\r\n return W - T + max(0, length - start)\r\n \r\n\r\ndef check(p):\r\n return p + v(k - 1, p - 1) + v(n - k, p - 1) <= m\r\n\r\nn, m, k = map(int, input().split())\r\nl = 0\r\nr = 10 ** 100\r\nwhile r - l > 1:\r\n mid = (l + r) // 2\r\n if not check(mid):\r\n r = mid\r\n else:\r\n l = mid\r\nprint(l)", "import math\r\n\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nremain = m - n\r\nfrodo = 1\r\nhigh = remain\r\nlow = int(math.sqrt(remain))\r\nadd = int((high + low)/2)\r\na = k - 1\r\nb = n - k\r\njud = 0\r\nif n == 1:\r\n print(m)\r\nelse:\r\n\r\n while jud == 0:\r\n c = min(add - 1, k - 1)\r\n d = min(add - 1, n - k)\r\n su = (2 * add - c) * (c + 1)/2 +(2 * add - d) * (d + 1)/2 - add\r\n if remain > su:\r\n low = add\r\n add = int((low + high)/2)\r\n if add == low:\r\n break\r\n elif remain < su:\r\n high = add\r\n add = int((low + high)/2)\r\n if add == high:\r\n break\r\n else:\r\n break\r\n print(add + 1)", "n, m, k = map(int, input().split())\nbest = 1\nsleva = k - 1\nsprava = n - k\nm -= n\n\nput = 1\n\nwhile (m >= put):\n m -= put\n best+= 1\n put += (sleva > 0) + (sprava > 0)\n if sleva:\n sleva -= 1\n if sprava:\n sprava -= 1\n if sleva == sprava == 0:\n best += (m // put)\n break\n \nprint(best)", "import sys\r\n\r\ndef is_able(n, m, k, mid):\r\n res = 0\r\n\r\n if k < mid:\r\n res += (mid + mid - k + 1) * k // 2\r\n else:\r\n res += mid * (mid + 1) // 2 + k - mid\r\n\r\n right = n - k + 1\r\n if right < mid:\r\n res += (mid + mid - right + 1) * right // 2\r\n else:\r\n res += mid * (mid + 1) // 2 + right - mid\r\n\r\n res -= mid\r\n\r\n return True if res <= m else False\r\n\r\nn, m, k = map(int, input().split())\r\nbtm = 1\r\ntop = m + 1\r\n\r\nwhile top - btm > 1:\r\n mid = (top + btm) // 2\r\n\r\n if is_able(n, m, k, mid):\r\n btm = mid\r\n else:\r\n top = mid\r\n\r\nans = btm\r\n\r\nprint(ans)", "places, pillow_num, frodo_place = map(int, input().split())\r\n\r\ndef calculate_sum(fp, p, length):\r\n if(fp == p):\r\n left_sum_min = (p-1)*p/2\r\n else:\r\n if(p < fp):\r\n left_sum_min = (p-1)*p/2 + (fp-1-(p-1))\r\n if(p > fp):\r\n left_sum_min = (p - (fp-1) + p - 1)*(fp-1)/2\r\n left_sum_max = (p+1+p+fp-1)*(fp-1)/2\r\n #print('left sum min', left_sum_min)\r\n #print('left sum max', left_sum_max)\r\n fp = length - fp + 1\r\n if(fp == p):\r\n right_sum_min = (p-1)*p/2\r\n else:\r\n if(p < fp):\r\n right_sum_min = (p-1)*p/2 + (fp-1-(p-1))\r\n if(p > fp):\r\n right_sum_min = (p - (fp-1) + p - 1)*(fp-1)/2\r\n right_sum_max = (p+1+p+fp-1)*(fp-1)/2\r\n #print('right sum min', right_sum_min)\r\n #print('right sum max', right_sum_max)\r\n return (left_sum_min+right_sum_min+p, left_sum_max+right_sum_max+p)\r\nleft = 0\r\nright = pillow_num\r\nwhile(right - left > 1):\r\n #print('left right', left, right)\r\n middle = left + abs(left - right)//2\r\n #print('middle is',middle)\r\n pillows = calculate_sum(frodo_place, middle, places)\r\n #print('pillows', pillows)\r\n if(pillows[0] > pillow_num):\r\n right = middle\r\n continue\r\n if(pillows[1] < pillow_num):\r\n left = middle\r\n continue\r\n left = middle\r\ndef print_pillow(left, right):\r\n if(calculate_sum(frodo_place,max(left, right),places)[0] <= pillow_num and calculate_sum(frodo_place,max(left, right),places)[1] >= pillow_num):\r\n print(max(left, right))\r\n return 0\r\n print(min(left, right))\r\n return 0\r\nprint_pillow(left, right)\r\n", "# LUOGU_RID: 104095795\nn, m, k = map(int, input().split())\r\n\r\n\r\ndef check(x):\r\n s1, s2 = 0, 0\r\n if x >= k:\r\n s1 = (x * 2 - k + 1) * (k) // 2\r\n else:\r\n s1 = (1 + x) * x / 2 + k - x\r\n k1 = n - k + 1\r\n if x >= k1:\r\n s2 = (x * 2 - k1 + 1) * (k1) / 2\r\n else:\r\n s2 = (1 + x) * x / 2 + k1 - x\r\n if s1 + s2 - x <= m:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nl, r = 1, m\r\nans = 0\r\nwhile l <= r:\r\n mid = (l + r) // 2\r\n if check(mid):\r\n ans = mid\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\nprint(ans)", "import sys\r\ninput=sys.stdin.readline\r\ndef f(x):\r\n z=m-n\r\n if(x>k):\r\n #x-k+1...x\r\n sumi=((k)*(2*x-k+1))//2\r\n else:\r\n sumi=(x*(x+1))//2\r\n y=n-k\r\n #x-1..x-y\r\n if(x>y):\r\n sumi+=((y)*(2*x-y-1))//2\r\n else:\r\n sumi+=((x*(x-1)))//2\r\n if(sumi<=z):\r\n return 1\r\n return 0\r\ndef bsearch(l,r):\r\n m=(l+r)//2\r\n #print(l,r)\r\n if(f(m)):\r\n if(f(m+1)==0):\r\n return m\r\n return bsearch(m+1,r)\r\n return bsearch(l,m-1)\r\nl=input().split()\r\nn=int(l[0])\r\nm=int(l[1])\r\nk=int(l[2])\r\nlol=bsearch(0,10**18)\r\nprint(lol+1)\r\n#print(f(1))\r\n", "import math\r\nL=lambda:list(map(int,input().split()))\r\nM=lambda:map(int,input().split())\r\nI=lambda:int(input())\r\nIN=lambda:input()\r\ndef s(a):\r\n print(\"\".join(list(map(str,a))))\r\nn,m,k=M()\r\nif n==1:\r\n print(m)\r\n exit()\r\nx=m-n\r\na=k-1\r\nb=n-k\r\ni=1\r\nc=1\r\nwhile x>=i:\r\n x-=i\r\n c+=1\r\n if a+b==0:\r\n c+=x//n\r\n break\r\n if a>0:\r\n a-=1\r\n i+=1\r\n if b>0:\r\n b-=1\r\n i+=1\r\nprint(c)\r\n", "n, m, k = map(int, input().split())\nf = lambda k, s: (2 * s - k + 1) * k - s if k < s else (s - 2) * s + 2 * k\ns, m = m // n + 1, 2 * m + 1\nwhile f(k, s) + f(n - k + 1, s) < m: s += 1\nprint(s - 1)\n\t \t \t \t \t\t\t \t\t\t \t\t \t \t\t", "n,m,k=map(int,input().split())\r\nm-=n\r\nl,u,x=k,k,1\r\nwhile m>0 and (u<n or l>1):\r\n x+=1\r\n m-=(u-l+1)\r\n if l>1: l-=1\r\n if u<n: u+=1\r\nprint(x+(m//n))", "n , k , my = map( int , input().split() )\r\n\r\ndef distribute( l,r,c ):\r\n if l > r :\r\n return 0\r\n x = r-l+1;\r\n if x > c :\r\n x = c\r\n return ( (x*(x+1))//2 ) + ((c-x)*x)\r\n\r\ndef givable( cc ):\r\n return distribute( 1 , my-1 , cc-1 ) + distribute( my+1, n , cc-1 ) + cc <= k\r\n\r\nAns = 1\r\nk = k - n\r\n\r\nhigh, low, mid , additional = ( k , 0 , -1 , 0 )\r\nwhile( low <= high ) :\r\n mid = (high + low)//2;\r\n if givable(mid)==True :\r\n additional = mid\r\n low = mid+1\r\n else :\r\n high = mid-1\r\n\r\nprint( Ans + additional )", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\nimport decimal\r\ninput=sys.stdin.readline\r\nn,m,k=(int(i) for i in input().split())\r\nlo=1\r\nhi=m\r\nif(n==1):\r\n print(m)\r\nelse:\r\n while(lo<hi):\r\n mid=(lo+hi)//2\r\n if(mid<k):\r\n s1=s1=((mid*(mid-1))//2)+k-mid\r\n else:\r\n s1=((mid-1+mid-k+1)*(k-1))//2\r\n if(mid<n-k):\r\n s2=((mid*(mid-1))//2)+(n-k)-mid+1\r\n else:\r\n s2=((mid-1+mid-n+k)*(n-k))//2\r\n if(s1+s2+mid<=m):\r\n lo=mid+1\r\n ans=mid\r\n else:\r\n hi=mid\r\n print(ans)", "def calculate_need(x, l, r):\r\n if l > x - 1:\r\n tl = (x - 1) * x // 2 + l - x + 1\r\n else:\r\n tl = (x - 1 + x - l) * l // 2\r\n\r\n if r > x - 1:\r\n tr = (x - 1) * x // 2 + r - x + 1\r\n else:\r\n tr = (x - 1 + x - r) * r // 2\r\n\r\n t = tl + tr + x\r\n return t\r\n\r\n\r\ndef codeforces(n, m, k):\r\n l = k - 1\r\n r = n - k\r\n min_num = 1\r\n max_num = m\r\n result = 0\r\n\r\n while True:\r\n num = (min_num + max_num) // 2\r\n need = calculate_need(num, l, r)\r\n if need == m or num == result:\r\n return num\r\n elif need > m:\r\n max_num = num - 1\r\n elif need < m:\r\n result = num\r\n min_num = num + 1\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nprint(codeforces(n, m, k))\r\n", "n,m,k=map(int,input().split())\r\nm-=n\r\nf=1\r\nl=k-1\r\nr=n-k\r\np=1\r\nwhile m>=p:\r\n f+=1\r\n m-=p\r\n p+= (l>0)+(r>0)\r\n if l: l-=1\r\n if r: r-=1\r\n if l==r==0:\r\n f+=(m//p)\r\n break\r\nprint(f)", "import sys\n\n\ndef check1(l,r, m):\n if m==0:\n return l\n if l>=r-1:\n return l+1\n mid = int((l+r)//2)\n \n last = 2*mid +1\n sr = (1+last)*(mid+1)/2\n if m >= sr:\n return check1(mid, r,m)\n return check1(l,mid,m) \n\ndef check2(first , l,r, m): \n if l>=r-1:\n return l+1\n mid = int((l+r)//2)\n \n last = first + mid\n sr = (first+last)*(mid+1)/2\n if m >= sr:\n return check2(first, mid, r,m)\n return check2(first, l,mid,m) \n\ndef main():\n n,m,k = map(int,sys.stdin.readline().split())\n if n ==1:\n print(m)\n return\n\n k = k-1\n if k<n/2:\n k= n-k-1\n r = 1\n m = m-n\n c = n-k-1\n last = 2*c +1\n s = (1+last)*(c+1)/2\n\n if s > m:\n r+= check1(0,c,m)\n print(r)\n return\n m = m - s\n r += c+1 \n\n first = last+1\n last = n\n c = last - first + 1\n s = (last+ first)*c /2\n if m < first :\n print(r)\n return\n if s > m :\n r+= check2(first, 0, c-1, m )\n print(r)\n return\n\n m = m-s\n r+= c\n\n rest = int(m/n)\n r+=rest\n print(r)\n\n\n# print(check1(0,3,0) == 0)\n# print(check1(0,3,1) == 1)\n# print(check1(0,3,2) == 1)\n# print(check1(0,3,4) == 2)\n# print(check1(0,3,7) == 2)\n# print(check1(0,3,9) == 3)\n# print(check1(0,3,15) == 3)\n\n# print(check2(4,0,2,4) == 1)\n# print(check2(4,0,2,5) == 1)\n# print(check2(4,0,2,9) == 2)\n# print(check2(4,0,2,10) == 2)\n\nmain()\n", "def just_sum(n):\r\n return (n * (n + 1)) // 2\r\n\r\n\r\ndef get_sum(a, b):\r\n return just_sum(b) - just_sum(a - 1)\r\n\r\n\r\ndef check(middle):\r\n left = k - 1\r\n right = n - k\r\n \r\n if left < middle:\r\n left_sum = get_sum(middle - left, middle - 1)\r\n else:\r\n left_sum = just_sum(middle - 1) + (left - (middle - 1))\r\n \r\n if right < middle:\r\n right_sum = get_sum(middle - right, middle - 1)\r\n else:\r\n right_sum = just_sum(middle - 1) + (right - (middle - 1))\r\n \r\n return left_sum + right_sum + middle <= m\r\n \r\n \r\nn, m, k = map(int, input().split())\r\n\r\nl = 1\r\nr = m + 1\r\nwhile l < r - 1:\r\n middle = (l + r) // 2\r\n if check(middle):\r\n l = middle\r\n else:\r\n r = middle\r\n \r\nprint(l)", "ingreso = input()\r\ningreso = ingreso.split()\r\nn = int(ingreso[0])\r\nm = int(ingreso[1])\r\nk = int(ingreso[2])\r\npiv = 1\r\nm -= n\r\nl = k\r\nr = k\r\n\r\nwhile(m):\r\n if (r-l+1 <= m):\r\n m-= (r-l+1)\r\n piv = piv+1\r\n else:\r\n break\r\n if (r < n):\r\n r = r + 1\r\n if (l > 1):\r\n l = l - 1\r\n \r\n if (r == n and l == 1):\r\n piv = piv + m/n\r\n break\r\n \r\nprint(int(piv))", "n,m,k=map(int,input().split())\nm-=n\nd=0\nk-=1\nans=1\nwhile m>1 and d!=max(k,n-k-1):\n ans+=1\n m-=1\n l=min(d,k)\n r=min(d,n-k-1)\n d+=1\n m-=l\n m-=r\nans+=m//n\n \nprint(ans)\n\t \t \t\t \t \t\t\t \t \t\t\t\t \t", "n,m,k=[int(f)for f in input().split()]\nl,r=0,m\nt=True\nfor x in range(60):\n i=(l+r)//2\n c=k-1\n b=n-k\n s=i-1+n+[(i-2-b)*b if i-2-b>0 else 0][0]+[(i-2-c)*c if i-2-c>0 else 0][0]+(min(i-2,b))*(1+min(b,i-2))/2+(min(i-2,c))*(1+min(c,i-2))/2\n if n==1:\n print(m)\n t=False\n break\n if s<=m:\n l=i\n elif s>=m:\n r=i\n #print(s,m,l,r,i)\nif t:print(l)\n", "def check(x):\r\n s=0\r\n if x-1<=n-k:\r\n sr=((x*(x-1))//2 + n-k-x+1)\r\n \r\n else:\r\n \r\n sr=(x*(x-1))//2 - ((x-(n-k+1))*((x-(n-k+1)+1)))//2\r\n if x-1<=k-1:\r\n sl=(x*(x-1))//2 + k-x\r\n else:\r\n sl=(x*(x-1))//2 - ((x-(k-1))*((x-(k-1)-1)))//2\r\n s=sl+sr+x\r\n if s<=m:\r\n \r\n return True\r\n else:\r\n return False\r\n \r\nn,m,k=list(map(int,input().split()))\r\nst=1\r\ned=m\r\nwhile(st<=ed):\r\n md=(st + ed)//2\r\n if check(md):\r\n if md==m or not(check(md+1)):\r\n print(md)\r\n break\r\n else:\r\n st=md+1\r\n else:\r\n ed=md-1\r\n \r\n\r\n\r\n", "n,m,k= map(int,input().split())\r\ndef calc(x,n,k):\r\n k-=1\r\n r = n - k;\r\n k = min(k,x-1)\r\n r = min(r,x)\r\n return ((2*x - k -1)*k//2) + (((2*x - r + 1)*(r))//2)\r\ndef bsearch(l, r):\r\n if l > r:\r\n return r\r\n mid = (l + r) //2\r\n if calc(mid,n,k) <= m:\r\n return bsearch(mid + 1,r)\r\n return bsearch(l, mid - 1)\r\nfrod = 1;\r\nm -= n\r\nfrod += bsearch(0,1000000001)\r\nprint(frod)\r\n", "n, m, k = map(int, input().split())\r\nl = 0\r\nr = int(1e12)\r\nwhile r - l > 1:\r\n\tx = (r + l) // 2\r\n\tif x >= k:\r\n\t\tsum1 = x * (k - 1) - k * (k - 1) // 2\r\n\telse:\r\n\t\tt = x - 1\r\n\t\tsum1 = t * x - t * (t + 1) // 2 + k - 1 - t\r\n\tk1 = n - k + 1\r\n\tif x >= k1:\r\n\t\t sum2 = x * (k1 - 1) - k1 * (k1 - 1) // 2\r\n\telse:\r\n\t\tt = x - 1\r\n\t\tsum2 = t * x - t * (t + 1) // 2 + k1 - 1 - t\r\n\t#print(l, r, x, sum1, sum2) \r\n\tif sum1 + sum2 + x <= m:\r\n\t\tl = x\r\n\telse:\r\n\t\tr = x\r\nprint(l)\r\n", "n,m,k=map(int,input().split())\r\nm=m-n\r\nlb,ub=k,k\r\np=1\r\nwhile m>0 and (ub<n or lb>1):\r\n p+=1\r\n m=m-ub+lb-1\r\n if lb>1:\r\n \tlb-=1\r\n if ub<n:\r\n \tub+=1\r\np=p+m//n\r\nprint(p)", "def distribute(target,n,k,m):\r\n right=n-k\r\n prev=target-1\r\n \r\n total=m-target\r\n \r\n if right>=prev:\r\n total-=((prev*(prev+1))//2)\r\n total-=right-prev\r\n else:\r\n temp=prev-right\r\n total-=((prev*(prev+1))//2)-((temp*(temp+1))//2)\r\n \r\n right=k-1\r\n prev=target-1\r\n if right>=prev:\r\n total-=((prev*(prev+1))//2)\r\n total-=right-prev\r\n else:\r\n temp=prev-right\r\n total-=((prev*(prev+1))//2)-((temp*(temp+1))//2)\r\n\r\n if total<0:\r\n return -1\r\n else:\r\n return 1\r\n\r\n\r\n\r\n\r\nn,m,k=map(int,input().split())\r\nlow=1\r\nhigh=m-n+1\r\nwhile low<=high:\r\n mid=low+(high-low)//2\r\n val=distribute(mid,n,k,m)\r\n if val==-1:\r\n high=mid-1\r\n else:\r\n low=mid+1\r\nprint(high)\r\n \r\n\r\n\r\n\r\n\r\n\r\n", "\r\ndef check(n,m,k,x):\r\n s = x\r\n if x <= k: s += ((x-1)*x)//2\r\n else: s += ((x-1)*x)//2-((x-k)*(x-k+1))//2\r\n \r\n if x-1<=n-k: s += ((x-1)*x)//2\r\n else : s += ((x-1)*x)//2 - ((x-1-n+k)*(x-n+k))//2\r\n \r\n if s <= m: return True\r\n return False\r\n\r\ndef main():\r\n \r\n n, m, k = map(int, input().split())\r\n m -= n\r\n l = 0\r\n h = 1000*1000*1000\r\n \r\n while l <= h:\r\n x = (l+h) // 2\r\n if check(n,m,k,x): l = x+1\r\n else: h = x-1\r\n \r\n print(l)\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef check(n, k, a):\r\n answer = a\r\n \"\"\"\r\n k-1 to the left\r\n \"\"\"\r\n a_part = (a-1)*a//2\r\n if a-1 < k-1:\r\n k_part= (k-a)\r\n else:\r\n k_part = -1*(a-k)*(a-k+1)//2\r\n # print(a, a_part+k_part, \"left\")\r\n answer+=(a_part+k_part)\r\n a_part = (a-1)*a//2\r\n if a-1 < n-k:\r\n k_part= (n-k-a+1)\r\n else:\r\n k_part = -1*(a-(n-k))*(a-(n-k)-1)//2\r\n answer+=(a_part+k_part)\r\n # print(a, a_part+k_part,\"right\")\r\n return answer\r\n \r\n \r\n \r\ndef process(n, m, k):\r\n s = 0\r\n e = m+1\r\n while s+1 < e:\r\n m1 = (s+e)//2\r\n m2 = check(n, k, m1)\r\n if m2 <= m:\r\n s, e = m1, e\r\n else:\r\n s, e = s, m1\r\n print(s)\r\n return\r\n\r\nn, m, k = [int(x) for x in input().split()]\r\nprocess(n, m, k)\r\n", "# from itertools import combinations\n# from bisect import bisect_right\n# from functools import *\n# from collections import Counter\n\nI = lambda: list(map(int, input().split()))\nn, m, k = I()\nl, r = 1, m + 1\nonLeft, onRight = k - 1, n - k\nwhile l < r - 1:\n amount = (l + r) >> 1\n s = amount\n for neighbors in [onLeft, onRight]:\n if neighbors > amount - 1:\n s += (amount - 1) * amount // 2 + neighbors - amount + 1\n else:\n s += (amount - neighbors + amount - 1) * neighbors // 2\n if s <= m:\n l = amount\n else:\n r = amount\nprint(l)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef binary_search(c1, c2):\r\n m = (c1 + c2 + 1) // 2\r\n while abs(c1 - c2) > 1:\r\n m = (c1 + c2 + 1) // 2\r\n if ok(m):\r\n c1 = m\r\n else:\r\n c2 = m\r\n m += 1\r\n while not ok(m):\r\n m -= 1\r\n return m\r\n\r\ndef ok(u):\r\n if u <= 1:\r\n return True\r\n x = m - n - u + 1\r\n if x < 0:\r\n return False\r\n x -= (u - 1) * (u - 2)\r\n v = max(u - l - 2, 0)\r\n x += v * (v + 1) // 2\r\n v = max(u - r - 2, 0)\r\n x += v * (v + 1) // 2\r\n return True if x >= 0 else False\r\n\r\nn, m, k = map(int, input().split())\r\nl, r = k - 1, n - k\r\nans = binary_search(0, m)\r\nprint(ans)", "import io\r\nimport math\r\n\r\nn, m, k = map(int, input().split())\r\nresult = 1\r\nm -= n\r\nleft = k - 1\r\nright = n - k\r\npink = 1\r\nwhile (m >= pink):\r\n m -= pink\r\n result += 1\r\n pink += (left > 0) + (right > 0)\r\n if (left): left -= 1\r\n if (right): right -= 1\r\n if (left == right == 0):\r\n result += (m // pink)\r\n break\r\nprint(result)", "__author__ = 'zihaozhu'\nfrom sys import stdin\n\ndef summation(a,b):\n if a>b:\n return summation(b,a)\n return (b + a) * (b - a + 1)/2\n\nhobbits, pillow, frodo = map(int,stdin.readline().split())\n\n\nlo = 1\nhi = pillow\n\nmaxpossible = pillow-hobbits\n\nwhile lo<hi:\n mid = (lo+hi)//2\n left = max(0, mid - frodo + 1)\n right = max(0, mid - (hobbits-frodo))\n if summation(left,mid) + summation(right,mid) - mid > maxpossible:\n hi = mid\n else:\n lo = mid +1\n\nprint(lo)\n\n\n\n\"\"\"\nif maxpossible<=2:\n print(maxpossible)\nelif hobbits == frodo and maxpossible-1<2:\n print(pillow)\nelif frodo == 1 and maxpossible-1<2:\n print(pillow)\n\nelse:\n\nif hobbits == 1 and frodo==hobbits:\n print(pillow)\nelif frodo!=1 and frodo!=hobbits:\n n = 0\n # 4 7 2\n # 3\n #4 9 2\n #2 3 2 2\n\n while (n*(n+1)/2) + (n*(n+1)/2) < maxpossible:\n n+=1\n if (n*(n+1)/2)+(n*(n+1)/2)>maxpossible:\n n-=1\n print(n)\n if (n*(n+1)/2)+(n*(n+1)/2)+(n+1)<pillow:\n print(int(n+1+(((n*(n+1)/2)+(n*(n+1)/2)+(n+1))/hobbits)))\n #print (int(n+1+pillow-(n*(n+1)/2)-(n+1)-(n*(n+1)/2)))\n else:\n print(n+1)\nelse:\n n=0\n # 3 6 1\n # 3\n # 3 10 3\n # 7\n while (n*(n+1)/2)<maxpossible:\n n+=1\n if (n*(n+1)/2) > maxpossible:\n n-=1\n if (n*(n+1)/2)+(n+1)<pillow:\n print (int(n+1+pillow-(n*(n+1)/2)-(n+1)))\n else:\n print(n+1)\n\"\"\"", "import sys\nn,m,k=map(int,sys.stdin.readline().split(' '))\n\n# almohadas sobrantes\nm = m - n\n\ndelivered = 1 \n\n#almohadas por hobbit. Default = 1\npillow_hobbits = 1\n\n#vecinos por la izq.\nleft = k - 1\n#vecinos por la der.\nright = n - k\n\nwhile m >= delivered:\n #Entregamos 1 almohada a un vecino\n pillow_hobbits += 1\n #Restamos del stock\n m -= delivered\n\n #Verificamos que exista vecino a nuestros lados\n if left >= 1:\n left -= 1\n delivered += 1\n if right >= 1:\n right -= 1\n delivered += 1\n # si ya no hay vecino\n if right == 0 and left == 0:\n # Calculamos cuantas almohadas que calculamos se puede repartir teniendo m almohadas\n pillow_hobbits += (m // delivered)\n break\nsys.stdout.write(str(pillow_hobbits)+'\\n')\n \n\n\n\n", "n,m,k=map(int,input().split())\r\nm-=n\r\nd=0\r\nk-=1\r\nans=1\r\nwhile m>1 and d!=max(k,n-k-1):\r\n ans+=1\r\n m-=1\r\n l=min(d,k)\r\n r=min(d,n-k-1)\r\n d+=1\r\n m-=l\r\n m-=r\r\nans+=m//n\r\n \r\nprint(ans)", "n, m, k = map(int, input().split())\ndef quiero(s):\n\tne = s + (s-1)*s\n\t# print(ne)\n\tif s > k:\n\t\td = s-k\n\t\tne -= d*(d+1)//2\n\t# print(ne)\n\tif s+k-1>n:\n\t\td = s+k-n-1\n\t\tne -= d*(d+1)//2\n\t# print(ne)\n\treturn ne\nlo, hi = 0, m\nwhile hi > lo:\n\tmid = (hi+lo+1)//2\n\tif n + quiero(mid) <= m:\n\t\tlo = mid\n\telse:\n\t\thi = mid - 1\nprint(lo+1)\n", "# http://codeforces.com/problemset/problem/760/B\r\ndef calc(y, x):\r\n if y > x - 1:\r\n return int((x * (x - 1))/2) + y - x + 1\r\n return int(((x - 1 + x - y) * y) / 2)\r\n\r\ndef main():\r\n n, m, k = map(int, input().split())\r\n low = 1\r\n hi = m\r\n beds_left = k - 1\r\n beds_right = n - k\r\n while low <= hi:\r\n mid = (low + hi) >> 1\r\n cant = calc(beds_left, mid) + calc(beds_right, mid)\r\n comp = m - mid - cant\r\n if comp < 0:\r\n hi = mid - 1\r\n else:\r\n low = mid + 1\r\n print(low - 1)\r\n\r\nmain()", "n,m,k = map(int, input().split())\r\nlow = 1\r\nhigh = m\r\nans = -1\r\nwhile (low<=high):\r\n\tmid = low+(high-low)//2\r\n\tnumReq = 0\r\n\tif mid>k: numReq += (mid*(mid+1))//2 - ((mid-k)*(mid-k+1))//2\r\n\telif mid<=k: numReq += (mid*(mid+1))//2 + (k-mid)\r\n\tif mid==1: numReq += (n-k)\r\n\telse:\r\n\t\tif (mid-1)>(n-k): numReq += (mid*(mid-1))//2 - ((mid-n+k)*(mid-n+k-1))//2\r\n\t\telif (mid-1)<=(n-k): numReq += (mid*(mid-1))//2 + (n-k-mid+1)\r\n\tif numReq > m: high = mid-1\r\n\telse: \r\n\t\tlow = mid+1\r\n\t\tans = mid\r\nprint(ans) ", "R = lambda: map(int, input().split())\r\nn, p, k = R()\r\nl, r = 1, p\r\nwhile l < r:\r\n m = (l + r + 1) // 2\r\n cl = (m + max(1, m - k + 1)) * min(k, m) // 2 + max(k - m, 0)\r\n cr = (m + max(1, m - (n - k))) * min(n - k + 1, m) // 2 + max(n - k + 1 - m, 0)\r\n if cl + cr - m <= p:\r\n l = m\r\n else:\r\n r = m - 1\r\nprint(l)" ]

[ "# Time Complexity: O(n)\n# Space Complexity: O(n)\n# The solution iterates through every node and edge using DFS in O(n + m)\n# Then, it iterates through every node and assume it is the root of a forest\n# to check if it has even number of nodes in O(n).\nn = int(input())\nif n % 2 == 1:\n print(-1)\n exit()\n\ndiscovered = [False] * n\ncount = [1] * n\nparent = [-1] * n\nadj = [[] for _ in range(n)]\nfor _ in range(n - 1):\n u, v = map(lambda x: int(x) - 1, input().split())\n adj[u].append(v)\n adj[v].append(u)\n\ns = [0]\nparent[0] = 0\nwhile len(s) != 0:\n u = s[-1]\n if discovered[u]:\n s.pop()\n count[parent[u]] += count[u]\n discovered[u] = True\n for v in adj[u]:\n if not discovered[v]:\n parent[v] = u\n s.append(v)\n\ncut = 0\nfor c in count[1:]:\n if c % 2 == 0:\n cut += 1\nprint(cut)\n\t\t\t\t\t \t\t\t \t \t \t\t\t \t\t\t \t", "import sys \r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline \r\n\r\nn = int(input())\r\nd = defaultdict(list)\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split()) \r\n d[u].append(v)\r\n d[v].append(u) \r\n\r\nif(n % 2):\r\n print(-1)\r\n exit() \r\n \r\nv = [-1] * (n + 1)\r\nc = [1] * (n + 1)\r\nq = [1]\r\nwhile(q):\r\n a = q[-1]\r\n f = 0\r\n for i in d[a]:\r\n if(v[i] == -1):\r\n v[i] = a \r\n q.append(i)\r\n f = 1 \r\n if(not f):\r\n q.pop()\r\n c[v[a]] += c[a]\r\nans = 0 \r\nfor i in c[1 : ]:\r\n if(i % 2 == 0):\r\n ans += 1 \r\nprint(ans)", "import sys,threading\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(10**8)\r\ndef dfs(x):\r\n global v,l,adj\r\n v[x]=1\r\n l[x]=1\r\n for i in adj[x]:\r\n if not v[i]:\r\n l[x]+=dfs(i)\r\n return l[x]\r\ndef dfs1(x):\r\n global v,l,adj,ans\r\n v[x]=1\r\n for i in adj[x]:\r\n if not v[i]:\r\n if l[i]%2==0:\r\n ans+=1\r\n dfs1(i)\r\ndef main():\r\n global v,l,adj,ans\r\n n=int(input())\r\n l=[0]*(n+1)\r\n v=[0]*(n+1)\r\n adj=[[] for i in range(n+1)]\r\n for i in range(n-1):\r\n x,y=map(int,input().split())\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n dfs(1)\r\n ans=0\r\n v=[0]*(n+1)\r\n dfs1(1)\r\n if n%2:\r\n print(-1)\r\n else:\r\n print(ans)\r\nt=threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\ngraph = [[] for i in range(n+1)]\r\nfor i in range(n-1):\r\n u,v = list(map(int,input().split()))\r\n graph[u].append(v)\r\n graph[v].append(u)\r\nif n%2!=0:\r\n print(-1)\r\n exit()\r\nsubtree_size = [1 for i in range(n+1)]\r\npar = [-1 for i in range(n+1)]\r\npar[1] = 1\r\nst = [1]\r\n\r\nwhile st!=[]:\r\n u = st[-1]\r\n f = 0\r\n for v in graph[u]:\r\n if par[v]==-1:\r\n par[v] = u\r\n st.append(v)\r\n f = 1\r\n if f==0:\r\n st.pop()\r\n subtree_size[par[u]]+=subtree_size[u]\r\nres = 0\r\nfor i in range(2,len(subtree_size)):\r\n if subtree_size[i]%2==0:\r\n res+=1\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\ndef bfs(s):\r\n q, k = [s], 0\r\n visit = [0] * (n + 1)\r\n visit[s] = 1\r\n parent = [-1] * (n + 1)\r\n while len(q) ^ k:\r\n i = q[k]\r\n for j in G[i]:\r\n if not visit[j]:\r\n visit[j] = 1\r\n parent[j] = i\r\n q.append(j)\r\n k += 1\r\n return q, parent\r\n\r\nn = int(input())\r\nG = [[] for _ in range(n + 1)]\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n G[u].append(v)\r\n G[v].append(u)\r\np, parent = bfs(1)\r\ncnt = [1] * (n + 1)\r\nans = 0\r\nwhile len(p) ^ 1:\r\n i = p.pop()\r\n ans += (cnt[i] + 1) % 2\r\n cnt[parent[i]] += cnt[i]\r\nif n % 2:\r\n ans = -1\r\nprint(ans)", "import sys, math, collections\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\nMOD = 1000000007\r\n\r\nimport threading\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(10**8)\r\n\r\ndef main():\r\n # dp->children\r\n\r\n def dfs(u,p):\r\n nonlocal ans\r\n for v in adj[u]:\r\n if v==p:\r\n continue\r\n dfs(v,u)\r\n dp[u]+=(1+dp[v])\r\n if dp[u]%2 and p!=0:\r\n ans+=1\r\n\r\n ans=0\r\n dp=collections.defaultdict(int)\r\n n=int(input())\r\n adj=collections.defaultdict(list)\r\n for i in range(n-1):\r\n a,b=get_ints()\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n if n%2:\r\n print(-1)\r\n else:\r\n dfs(1,0)\r\n print(ans)\r\n\r\nt=threading.Thread(target=main)\r\nt.start()\r\nt.join()", "import sys\r\nfrom collections import defaultdict\r\ninput_func = sys.stdin.readline\r\n\r\nn = int(input_func())\r\ngraph = defaultdict(list)\r\n\r\nfor i in range(n - 1):\r\n u, v = map(int, input_func().split())\r\n graph[u].append(v)\r\n graph[v].append(u)\r\n\r\nif n % 2:\r\n print(-1)\r\n exit()\r\n\r\nvisited = [-1] * (n + 1)\r\ncomponent_size = [1] * (n + 1)\r\nqueue = [1]\r\n\r\nwhile queue:\r\n current_node = queue[-1]\r\n found_unvisited = False\r\n\r\n for neighbor in graph[current_node]:\r\n if visited[neighbor] == -1:\r\n visited[neighbor] = current_node\r\n queue.append(neighbor)\r\n found_unvisited = True\r\n\r\n if not found_unvisited:\r\n queue.pop()\r\n component_size[visited[current_node]] += component_size[current_node]\r\n\r\neven_size_count = 0\r\n\r\nfor size in component_size[1:]:\r\n if size % 2 == 0:\r\n even_size_count += 1\r\n\r\nprint(even_size_count)\r\n", "\r\n# from sortedcontainers import SortedSet\r\nfrom ast import Mod\r\nfrom collections import OrderedDict\r\nfrom io import BytesIO, IOBase\r\nimport os\r\nimport threading\r\nimport collections\r\nfrom tkinter import E\r\nfrom types import GeneratorType\r\nfrom itertools import combinations, permutations\r\nfrom functools import lru_cache\r\nimport bisect\r\nimport sys\r\nfrom array import array\r\nimport heapq\r\nfrom collections import Counter\r\nimport math\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\nfrom copy import deepcopy\r\n\r\n\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\n\r\n\r\ninput = sys.stdin.readline\r\nn = int(input())\r\n\r\n\r\n\r\n\r\nneighbourNodes = [[] for i in range(n)]\r\nfor i in range(n - 1):\r\n path, toPath = map(int, input().split())\r\n path -= 1\r\n toPath -= 1\r\n neighbourNodes[path].append(toPath)\r\n neighbourNodes[toPath].append(path)\r\n \r\nans = 0\r\ndef solve():\r\n \r\n if n % 2 != 0:\r\n return -1\r\n \r\n \r\n \r\n currentMin, rootNode = float('inf'), None;\r\n\r\n \r\n for node in range(n):\r\n if len(neighbourNodes[node]) < currentMin:\r\n currentMin = len(neighbourNodes[node])\r\n rootNode = node;\r\n\r\n @bootstrap\r\n def dfs(currentNode, parentNode):\r\n \r\n global ans \r\n \r\n count = 1\r\n \r\n for node in neighbourNodes[currentNode]:\r\n if node != parentNode:\r\n count += (yield dfs(node, currentNode))\r\n \r\n if count % 2 == 0:\r\n ans += 1\r\n yield 0;\r\n \r\n yield count;\r\n \r\n dfs(rootNode, None) \r\n\r\n return ans - 1\r\n\r\n\r\nans = solve()\r\n\r\nprint(ans)\r\n", "\r\n\r\n\r\nn=int(input())\r\nd={i:[] for i in range(1,n+1)}\r\n\r\nfor i in range(n-1):\r\n start,end=map(int,input().split())\r\n d[start].append(end)\r\n d[end].append(start)\r\n\r\nif(n%2!=0):\r\n print(-1)\r\n\r\nelse:\r\n\r\n val=[1 for i in range(n+1)]\r\n par=[-1 for i in range(n+1)]\r\n\r\n par[1]=1\r\n stk=[1]\r\n\r\n\r\n while(stk):\r\n\r\n u=stk[-1]\r\n f=0\r\n\r\n for i in d[u]:\r\n\r\n if(par[i]==-1):\r\n par[i]=u\r\n stk.append(i)\r\n f=1\r\n if(f==0):\r\n stk.pop()\r\n val[par[u]]+=val[u]\r\n\r\n res=0\r\n\r\n for i in range(2,n+1):\r\n if(val[i]%2==0):\r\n res+=1\r\n print(res)\r\n", "\r\nn=int(input())\r\nd={ i:[] for i in range(1,n+1)}\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\nif n&1:\r\n print(-1)\r\nelse :\r\n val=[1 for i in range(n+1)]\r\n par=[-1 for i in range(n+1)]\r\n par[1]=1\r\n stack=[1]\r\n while stack:\r\n u=stack[-1]\r\n f=0\r\n for i in d[u]:\r\n if par[i]==-1:\r\n par[i]=u\r\n stack.append(i)\r\n f=1\r\n if f==0:\r\n stack.pop()\r\n val[par[u]]+=val[u] \r\n ans=0\r\n for i in range(2,n+1):\r\n if val[i]%2==0:\r\n ans+=1\r\n print(ans)\r\n \r\n ", "n=int(input())\r\nif n&1>0:\r\n print(-1)\r\n exit()\r\ng=[[] for i in range(n)]\r\nfor i in range(n-1):\r\n u,v=map(int,input().split())\r\n u-=1\r\n v-=1\r\n g[u].append(v)\r\n g[v].append(u)\r\nc=[1]*n\r\nv=[-1]*n\r\nv[0]=0\r\nq=[0]\r\nwhile q:\r\n x=q[-1]\r\n flag=False\r\n for to in g[x]:\r\n if v[to]==-1:\r\n v[to]=x\r\n q.append(to)\r\n flag=True\r\n if not flag:\r\n q.pop()\r\n c[v[x]]+=c[x]\r\nans=0\r\nfor j in c[1:]:\r\n if j&1<1:\r\n ans+=1\r\nprint(ans)", "# from debug import debug\r\nimport sys; input = sys.stdin.readline\r\nfrom collections import deque\r\nn = int(input())\r\ngraph = [[] for _ in range(n)]\r\nfor i in range(n-1):\r\n\ta, b = map(int, input().split())\r\n\tgraph[a-1].append(b-1)\r\n\tgraph[b-1].append(a-1)\r\nparent = [-1]*n\r\nsize = [1]*n\r\nq = deque([0])\r\nstack = []\r\nwhile q:\r\n\tnode = q.popleft()\r\n\tstack.append(node)\r\n\tfor i in graph[node]:\r\n\t\tif i == parent[node]: continue\r\n\t\tparent[i] = node\r\n\t\tq.append(i)\r\nfor i in range(n-1, 0, -1):\r\n\tnode = stack[i]\r\n\tsize[parent[node]] += size[node]\r\n\r\nif size[0]&1: print(-1)\r\nelse:\r\n\tq = deque([0])\r\n\tans = 0\r\n\twhile q:\r\n\t\tnode = q.popleft()\r\n\t\tfor i in graph[node]:\r\n\t\t\tif i == parent[node]: continue\r\n\t\t\tif size[i]&1 == 0: ans += 1\r\n\t\t\tq.append(i)\r\n\tprint(ans)\r\n", "\r\nimport threading\r\nimport sys\r\nfrom sys import stdin\r\ninput=stdin.readline\r\nsys.setrecursionlimit(10**8)\r\nfrom collections import defaultdict\r\ndef main():\r\n n=int(input())\r\n graph=[[] for _ in range(n)]\r\n for _ in range(n-1):\r\n a,b=map(int,input().split())\r\n graph[a-1].append(b-1)\r\n graph[b-1].append(a-1)\r\n if n%2:\r\n print(-1)\r\n \r\n else :\r\n ans=[0]\r\n def solve(root,node):\r\n temp=1\r\n for nie in graph[root]:\r\n if nie !=node:\r\n temp+=solve(nie,root)\r\n if temp%2==0:\r\n ans[0]+=1\r\n return 0\r\n else :\r\n return temp\r\n solve(0,-1)\r\n print(ans[0]-1)\r\n\r\n \r\nthreading.stack_size(10 ** 8)\r\nt = threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n", "# 2022-05-14T21:42:23.355Z\r\nfrom collections import defaultdict, deque\r\n\r\n\r\ndef proc(n, g):\r\n if n % 2 == 1:\r\n return -1\r\n\r\n parent = [0] * (n + 1)\r\n node_count = [1] * (n + 1)\r\n node_stack = []\r\n\r\n node_queue = deque([1])\r\n while node_queue:\r\n node = node_queue.popleft()\r\n node_stack.append(node)\r\n for e in g[node]:\r\n node_queue.append(e)\r\n g[e].remove(node)\r\n parent[e] = node\r\n\r\n ans = 0\r\n while node_stack:\r\n node = node_stack.pop()\r\n if node_count[node] % 2 == 0:\r\n ans += 1\r\n node_count[parent[node]] += node_count[node]\r\n\r\n # print(parent)\r\n # print(node_count)\r\n return ans - 1\r\n\r\n\r\ng = defaultdict(set)\r\nn = int(input())\r\nfor _ in range(n - 1):\r\n u, v = map(int, input().split())\r\n g[u].add(v)\r\n g[v].add(u)\r\n\r\nprint(proc(n, g))\r\n", "def dfs_new(adj,n):\r\n\tstack = [(1,0)]\r\n\tsol = [None for i in range(n+1)]\r\n\twhile(not len(stack)==0):\r\n\t\ti,parent = stack[-1]\r\n\t\tflag = True\r\n\t\tfor item in adj[i]:\r\n\t\t\tif(item==parent):\r\n\t\t\t\tcontinue\r\n\t\t\tif(sol[item]==None):\r\n\t\t\t\tstack.append((item,i))\r\n\t\t\t\tflag = False\r\n\t\t\t# print(stack, flag)\r\n\t\t\t# print(sol)\r\n\t\tif(flag):\r\n\t\t\trem = 0\r\n\t\t\ttree_size = 1\r\n\t\t\tfor item in adj[i]:\r\n\t\t\t\tif(item==parent):\r\n\t\t\t\t\tcontinue\r\n\t\t\t\tsubtree_size,t = sol[item]\r\n\t\t\t\t# print(item, subtree_size, t)\r\n\t\t\t\tif(subtree_size%2==0):\r\n\t\t\t\t\trem+=1\r\n\t\t\t\trem += t\r\n\t\t\t\ttree_size += subtree_size\r\n\t\t\tsol[i] = [tree_size,rem]\r\n\t\t\tstack.pop(-1)\r\n\t# print(sol)\r\n\treturn sol[1][1]\r\n\r\n\r\nn = int(input())\r\nadj = [[] for i in range(n+1)]\r\nfor _ in range(n-1):\r\n\tu,v = map(int,input().split())\r\n\tadj[u].append(v)\r\n\tadj[v].append(u)\r\nif(n%2==1):\r\n\tprint(-1)\r\nelse:\r\n\tans = dfs_new(adj,n)\r\n\tprint(ans)\r\n", "import os, sys, bisect, copy\r\nfrom collections import defaultdict, Counter, deque\r\nfrom functools import lru_cache #use @lru_cache(None)\r\nif os.path.exists('in.txt'): sys.stdin=open('in.txt','r')\r\nif os.path.exists('out.txt'): sys.stdout=open('out.txt', 'w')\r\n#\r\ndef input(): return sys.stdin.readline()\r\ndef mapi(arg=0): return map(int if arg==0 else str,input().split())\r\n#------------------------------------------------------------------\r\nimport sys\r\nsys.setrecursionlimit(10**5)\r\nfrom types import GeneratorType\r\n#use:- put @bootstrap overrecursive function\r\ndef bootstrap(func, stack=[]):\r\n def wrapped_function(*args, **kwargs):\r\n if stack:\r\n return func(*args, **kwargs)\r\n else:\r\n call = func(*args, **kwargs)\r\n while True:\r\n if type(call) is GeneratorType:\r\n stack.append(call)\r\n call = next(call)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n call = stack[-1].send(call)\r\n return call\r\n return wrapped_function\r\n\r\nn = int(input())\r\ngr = defaultdict(list)\r\nfor i in range(n-1):\r\n x,y = mapi()\r\n gr[x].append(y)\r\n gr[y].append(x)\r\n\r\nsz = [0]*(n+1)\r\nres = 0\r\n@bootstrap\r\ndef dfs(s,par):\r\n global res\r\n sz[s] = 1\r\n for u in gr[s]:\r\n if par==u: continue\r\n sz[s]+= yield dfs(u,s)\r\n if sz[s]%2==0 and s!=1:\r\n res+=1\r\n yield sz[s]\r\ndfs(1,-1)\r\n#print(*sz)\r\nif sz[1]&1:\r\n print(-1)\r\nelse:\r\n print(res)\r\n", "def main():\n n = int(input())\n if n % 2 != 0: print(-1); return;\n\n graph = [[] for _ in range(n)]\n\n for _ in range(n-1):\n a, b = list(map(int, input().split()))\n graph[a-1].append(b-1)\n graph[b-1].append(a-1)\n\n res = 0 \n stack = [0]\n visited = [-1] * n\n visited[0] = 0\n\n count = [1] * n\n\n while stack:\n s = stack[-1]\n flag = False\n\n for v in graph[s]:\n if visited[v] == -1:\n stack.append(v)\n visited[v] = s\n flag = True\n\n if not flag:\n stack.pop()\n if s == 0: break;\n count[visited[s]] += count[s]\n\n res = sum([1 if i % 2 == 0 else 0 for i in count])\n print(res-1)\n\nif __name__ == '__main__':\n main()\n\n", "def dfs(g, s):\r\n visited = set([s])\r\n stack = [s]\r\n res = 0\r\n \r\n while len(stack) > 0:\r\n s = stack.pop()\r\n cnt = 0\r\n\r\n cnt += 1 #count the size of the current subtree\r\n visited.add(s) \r\n \r\n for v in g[s]:\r\n if v not in visited:\r\n cnt += 1\r\n stack.append(v)\r\n\r\n if cnt % 2 == 0:\r\n res += 1\r\n\r\n return res // 2\r\n\r\ndef dfs2(g,s,n):\r\n parent = [0]*(n+1)\r\n counts = [1]*(n+1)\r\n stack = []\r\n\r\n stack.append(s)\r\n \r\n while stack:\r\n v = stack[-1]\r\n empty_s = True\r\n \r\n if not parent[v]:\r\n parent[v] = 1\r\n \r\n for node in g[v]:\r\n if not parent[node]:\r\n parent[node] = v\r\n stack.append(node)\r\n empty_s = False\r\n \r\n if empty_s:\r\n stack.pop()\r\n counts[parent[v]] += counts[v]\r\n \r\n return sum([1 for x in counts[2:] if x % 2 == 0])\r\n\r\ndef solve():\r\n #f = open(\"Cut em all - DFS.txt\")\r\n n = int(input())\r\n \r\n tree = [[] for i in range(n+1)]\r\n \r\n for i in range(n-1):\r\n u ,v = input().split()\r\n u, v = int(u), int(v)\r\n tree[v].append(u)\r\n tree[u].append(v)\r\n \r\n if n % 2 != 0:\r\n print (-1)\r\n return\r\n\r\n #print (dfs(tree, 1))\r\n print (dfs2(tree, 1, n))\r\n\r\nif __name__ == \"__main__\":\r\n solve()", "n = int(input())\r\nif n % 2 == 1:\r\n print(-1)\r\n exit()\r\n\r\nadj = [[] for _ in range(n+1) ]\r\nfor _ in range(n-1):\r\n u, v = map(int, input().split())\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\ncnt = [1] * (n+1)\r\nprt = [-1] * (n+1)\r\nprt[1] = 1\r\nstk = [1]\r\nwhile stk:\r\n u = stk[-1]\r\n k = False\r\n for v in adj[u]:\r\n if prt[v] == -1:\r\n prt[v] = u\r\n stk.append(v)\r\n k = True\r\n if not k:\r\n stk.pop()\r\n cnt[prt[u]] += cnt[u]\r\nres = 0\r\nfor j in cnt[2:]:\r\n if j % 2 == 0:\r\n res += 1 \r\nprint(res)\r\n", "from math import ceil, floor, sqrt\r\nfrom collections import defaultdict, Counter\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nimport io, os\r\nfrom types import GeneratorType\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nninput = lambda: int(input())\r\nsinput = lambda: input().decode().strip() \r\nainput = lambda: list(map(int, input().split()))\r\nprintt = lambda *x: stdout.write(\" \".join(map(str, x)) + '\\n')\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n\r\n return wrappedfunc\r\n\r\nn = ninput()\r\nadj = defaultdict(list)\r\nfor _ in range(n - 1):\r\n u, v = ainput()\r\n adj[u].append(v)\r\n adj[v].append(u)\r\nc = 0\r\n@bootstrap\r\ndef dfs(s, p):\r\n global c\r\n n = 0\r\n for i in adj[s]:\r\n if i == p: continue\r\n a = yield dfs(i, s)\r\n if a % 2 == 0: c += 1\r\n else: n += a\r\n yield n + 1\r\nif dfs(1, -1) % 2 == 0: \r\n c += 1\r\n printt(c - 1)\r\nelse: printt(-1)\r\n \r\n", "\"\"\"\r\n#If FastIO not needed, used this and don't forget to strip\r\n#import sys, math\r\n#input = sys.stdin.readline\r\n\"\"\"\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nimport heapq as h \r\nfrom bisect import bisect_left, bisect_right\r\n\r\nfrom types import GeneratorType\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n import os\r\n self.os = os\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 = self.os.read(self._fd, max(self.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 = self.os.read(self._fd, max(self.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 self.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\nimport collections as col\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input()\r\n\r\ndef listStr():\r\n return list(input())\r\n\r\nMOD = 10**9+7\r\n\r\n\r\n\"\"\"\r\nIf N odd, not possible\r\nIf N even, nice problem. Answer is at least 0, at most N//2-1\r\nThe first observation is that all leaves must be connected to their parents\r\nSo what really are interested in is the subtree size. If a node has subtree size 2, we can trim it.\r\n\"\"\"\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\ndef solve():\r\n N = getInt()\r\n graph = col.defaultdict(set)\r\n def vadd(u,v):\r\n graph[u].add(v)\r\n graph[v].add(u)\r\n for n in range(N-1):\r\n U, V = getInts()\r\n vadd(U,V)\r\n if N % 2 == 1:\r\n return -1\r\n subtree = [0]*(N+1)\r\n @bootstrap\r\n def numberOfNodes(s, e): \r\n subtree[s] = 1\r\n for u in graph[s]: \r\n if u == e: \r\n continue\r\n yield numberOfNodes(u, s) \r\n subtree[s] += subtree[u] \r\n yield\r\n numberOfNodes(1,0)\r\n ans = 0\r\n for j in range(2,N+1):\r\n if subtree[j] % 2 == 0:\r\n ans += 1\r\n return ans\r\n \r\n#for _ in range(getInt()):\r\nprint(solve())", "# Time complexity: O(n)\n# Space complexity: O(n)\n# Rationale: If an edge links a node with a subtree of even number, then the edge\n# can be removed. Therefore, we can use DFS to calculate the subtree size of each node\n# and when the size is even, we have one more cut in the tree. Since DFS exceeds time limit,\n# we can use a stack similar to the approach.\n\n\ndef DFS(tree, node, n):\n\n stack = []\n stack.append(node)\n parent = [0] * (n + 1)\n cnt = [1] * (n + 1)\n\n while stack:\n next_node = stack[-1]\n empty_tree = True\n\n if not parent[next_node]:\n parent[next_node] = 1\n\n for subtree in tree[next_node]:\n if not parent[subtree]:\n parent[subtree] = next_node\n stack.append(subtree) # Loops through the rest of the tree from next_node.\n empty_tree = False\n\n if empty_tree:\n stack.pop()\n cnt[parent[next_node]] += cnt[next_node] # Calculates the sizes of subtree from each node.\n\n return sum([1 for ntree in cnt[2:] if ntree % 2 == 0])\n\n\nn = int(input())\n# If the tree is of odds size, then there is no way we can cut properly.\nif n % 2 == 1:\n print(-1)\n exit()\n\n# Constructs the tree with the root of index 1.\ntree = [[] for _ in range(n + 1)]\nfor _ in range(n - 1):\n u, v = input().split()\n u, v = int(u), int(v)\n tree[u].append(v)\n tree[v].append(u)\n\nprint(DFS(tree, 1, n))\n\n \t\t\t \t\t\t\t\t \t\t\t \t \t \t \t \t", "import collections\r\n\r\n\r\nn = int(input())\r\nedges = [set() for _ in range(n)]\r\nchildren_count = [0] * (n)\r\nfor _ in range(n - 1):\r\n u, v = [int(i) - 1 for i in input().split()]\r\n edges[u].add(v)\r\n edges[v].add(u)\r\n\r\n\r\nif n % 2 == 1:\r\n print(-1)\r\nelse:\r\n stack = [0]\r\n discovered = set()\r\n for i in range(n):\r\n index = stack[i]\r\n discovered.add(index)\r\n for i in edges[index]:\r\n if i not in discovered:\r\n stack.append(i)\r\n\r\n discovered = set()\r\n for i in reversed(stack):\r\n discovered.add(i)\r\n if len(edges[i]) == 1 and i > 0:\r\n continue\r\n\r\n for child in edges[i]:\r\n if child in discovered:\r\n children_count[i] += 1 + children_count[child]\r\n\r\n # Calculate answer\r\n queue = collections.deque([0])\r\n discovered = set()\r\n result = 0\r\n while queue:\r\n index = queue.popleft()\r\n discovered.add(index)\r\n\r\n if children_count[index] % 2 == 1:\r\n result += 1\r\n\r\n for child in edges[index]:\r\n if child not in discovered:\r\n queue.append(child)\r\n\r\n print(result - 1)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n % 2:\r\n print(-1)\r\n exit()\r\nd = [[] for _ in range(n)]\r\nfor i in range(n-1):\r\n a, b = map(lambda x:int(x)-1, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\n\r\nx = [-1]*n\r\nc = [1]*n\r\nq = [0]\r\nwhile q:\r\n a = q[-1]\r\n f = 1\r\n for i in d[a]:\r\n if x[i] == -1:\r\n x[i] = a\r\n q.append(i)\r\n if f == 1:\r\n f = 0\r\n\r\n if f:\r\n b = q.pop()\r\n c[x[b]] += c[b]\r\n\r\nprint(sum(1 for i in c if i % 2 == 0))\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\nP = [[] for _ in range(N)]\r\nfor _ in range(N-1):\r\n a,b = map(int, input().split())\r\n P[a-1].append(b-1)\r\n P[b-1].append(a-1)\r\n \r\nif N%2:\r\n exit(print(-1))\r\n\r\nans = 0\r\nv = [(0,-1,0),(0,-1,1)]\r\ncnt = [0]*N\r\nwhile v:\r\n i,p,t = v.pop()\r\n if t==1:\r\n for j in P[i]:\r\n if j!=p:\r\n v.append((j,i,0))\r\n v.append((j,i,1))\r\n else:\r\n t = 1\r\n for j in P[i]:\r\n t+=cnt[j]\r\n if cnt[j]>0 and cnt[j]%2==0:\r\n ans+=1\r\n cnt[i]=t\r\n \r\nprint(ans)\r\n \r\n \r\n ", "# link: https://codeforces.com/problemset/problem/982/C\r\n\r\nfrom collections import defaultdict\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n tree = defaultdict(list)\r\n for i in range(n-1): \r\n u, v = map(int, input().split())\r\n tree[u].append(v)\r\n tree[v].append(u)\r\n if len(tree) % 2 or n==1:\r\n print(-1)\r\n exit(0) \r\n # dfs starts \r\n subtree_count = [1 for i in range(n+1)]\r\n visited = [-1 for i in range(n+1)]\r\n stack = [1]\r\n while stack:\r\n cn = stack[-1]\r\n found = 0\r\n for nn in tree[cn]:\r\n if visited[nn] == -1:\r\n found = 1\r\n visited[nn] = cn\r\n stack.append(nn)\r\n if not found:\r\n stack.pop()\r\n subtree_count[visited[cn]] += subtree_count[cn] \r\n edges = 0\r\n for count_ in subtree_count[2:]:\r\n if count_ % 2 == 0:\r\n edges += 1\r\n print(edges) \r\n", "import threading\r\nfrom sys import setrecursionlimit as srl\r\nfrom collections import defaultdict\r\nsrl(10**9)\r\ndef main():\r\n n=int(input())\r\n g=defaultdict(list)\r\n for _ in range(n-1):\r\n u,v=map(int,input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n sz=[0]*(n+1)\r\n vis=[0]*(n+1)\r\n if n&1:print(-1);exit()\r\n def dfs(cn):\r\n vis[cn]=1\r\n sz[cn]=1\r\n for nn in g[cn]:\r\n if not vis[nn]:\r\n sz[cn]+=dfs(nn)\r\n return sz[cn]\r\n dfs(1)\r\n res=0\r\n for i in range(1,n+1):\r\n if sz[i]&1==0 and i!=1:\r\n res+=1\r\n print(res)\r\nthreading.stack_size(10 ** 8)\r\nt = threading.Thread(target=main)\r\nt.start()\r\nt.join()\r\n", "import sys,collections\r\ninput = sys.stdin.readline\r\ndef bfs(adj_list,n):\r\n c=[1]*n;v=[-1]*n;v[0]=0;q=[0]\r\n while q:\r\n x=q[-1];flag=False\r\n for to in adj_list[x]:\r\n if v[to]==-1:\r\n v[to]=x\r\n q.append(to)\r\n flag=True\r\n if not flag:\r\n q.pop()\r\n c[v[x]]+=c[x]\r\n ans=0\r\n for i in c[1:]:\r\n if i&1==0:ans+=1\r\n print(ans)\r\n \r\nn=int(input())\r\nif n%2==1:print(-1);exit()\r\nadj_list=[[]for _ in range(n+10)]\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split())\r\n a-=1;b-=1\r\n adj_list[a].append(b)\r\n adj_list[b].append(a)\r\n\r\nbfs(adj_list,n)\r\n", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\nn=int(input())\r\nd={i:set() for i in range(1,n+1)}\r\nfor i in range(n-1):\r\n\ta,b=map(int,input().split())\r\n\td[a].add(b)\r\n\td[b].add(a)\r\nstack=deque()\r\nstack.append([1,0])\r\nans=[[0,0]for i in range(n+1)]\r\nl=[]\r\nwhile stack:\r\n\tx=stack.pop()\r\n\t# print(x)\r\n\ttry:\r\n\t\tl[x[1]].append(x[0])\r\n\texcept:\r\n\t\tl.append([x[0]])\r\n\tfor i in d[x[0]]:\r\n\t\tans[i][0]=x[0]\r\n\t\td[i].remove(x[0])\r\n\t\tstack.appendleft([i,x[1]+1])\r\ncount=0\r\nif n%2!=0:\r\n\tprint(-1)\r\n\texit()\r\nwhile l:\r\n\tstack=[i for i in l.pop()]\r\n\twhile stack:\r\n\t\tx=stack.pop()\r\n\t\tif ans[x][1]>0 and (ans[x][1]+1)%2==0:\r\n\t\t\tcount+=1\r\n\t\telse:\r\n\t\t\tans[ans[x][0]][1]+=ans[x][1]+1\r\n\t\t# print(ans[1:])\r\nprint(count-1)" ]

[ "def comp(x):\r\n for i in range(2, x):\r\n if x % i == 0:\r\n return True\r\n return False\r\n\r\nN = int(input())\r\n\r\nif N == 4:\r\n print('YES', '1', '3', '2', '4', sep = '\\n')\r\nelif comp(N):\r\n print('NO')\r\nelse:\r\n print('YES', '1', sep = '\\n')\r\n if N > 1:\r\n for i in range(2, N):\r\n print((i - 1) * pow(i, N - 2, N) % N)\r\n print(N)\r\n \r\n", "n = int(input())\r\nif n == 4:\r\n print (\"YES\\n1 3 2 4\")\r\nelif [i for i in range(2,n) if n%i==0]:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\\n1 %s\"%(\" \".join(str((pow(x+1,n-2,n)*(x+2))%n or n) for x in range(n-1))))", "import math\nimport sys\ninput = sys.stdin.readline\nn = int(input())\nif math.factorial(n - 1) % n == n - 1:\n print('YES')\n print('\\n'.join(list(map(str, [1] + [i * pow(i - 1, n - 2, n) % n for i in range(2, n)] + [n]))[:n]))\nelif n == 4:\n print('YES')\n print('\\n'.join(map(str, [1, 3, 2, 4])))\nelse:\n print('NO')\n", "def isp(x):\r\n\ti=2\r\n\twhile i*i<x:\r\n\t\tif x%i==0:\r\n\t\t\treturn False\r\n\t\ti+=1\r\n\treturn True\r\nn=int(input())\r\nif n==1:\r\n\tprint('YES',1,sep='\\n')\r\nelif n==4:\r\n\tprint('YES',1,3,2,4,sep='\\n')\r\nelif not isp(n):\r\n\tprint('NO')\r\nelse:\r\n\tinv=[0,1]\r\n\tfor i in range(2,n):\r\n\t\tinv.append(n-n//i*inv[n%i]%n)\r\n\tfor i in range(n):\r\n\t\tinv[i]+=1\r\n\tprint('YES')\r\n\tfor i in inv:\r\n\t\tprint(i)" ]

[ "f = input()\r\nb = f[::-1]\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\ni = -1\r\nj = -1\r\ntry:\r\n i = f.index(s1)\r\n j = f.index(s2, i+len(s1))\r\nexcept:\r\n pass\r\nforward = bool(j > -1)\r\n\r\ni = -1\r\nj = -1\r\ntry:\r\n i = b.index(s1)\r\n j = b.index(s2, i+len(s1))\r\nexcept:\r\n pass\r\nbackward = bool(j > -1)\r\n\r\nif forward:\r\n if backward:\r\n print('both')\r\n else:\r\n print('forward')\r\nelif backward:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "import string\r\ns = input()\r\nx = input()\r\ny = input()\r\na = False\r\nb = False\r\nif x in s:\r\n if y in s[s.find(x) + len(x):]:\r\n a = True\r\ns = s[::-1]\r\nif x in s:\r\n if y in s[s.find(x) + len(x):]:\r\n b = True\r\nif a and b:\r\n print(\"both\")\r\nelif a:\r\n print(\"forward\")\r\nelif b:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")\r\n", "# LUOGU_RID: 119299363\nw = input()\r\na = input()\r\nb = input()\r\nv = n = 0\r\n\r\nif (w.find(a)!=-1 and w.find(a) <= w.rfind(b)-len(a)):\r\n v = 1\r\nw = w[::-1]\r\nif (w.find(a)!=-1 and w.find(a) <= w.rfind(b)-len(a)):\r\n n = 1\r\nif v and n:\r\n print(\"both\")\r\nelif v:\r\n print(\"forward\")\r\nelif n:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")\r\n", "n = input()\na = input()\nb = input()\nm = n[::-1]\ni = n.find(a)\nx = False\nif i != -1 : \n n = n[i+len(a)::1]\n j = n.find(b)\n if j != -1 :\n x = True\ni = m.find(a)\ny = False\nif i != -1 : \n m = m[i+len(a)::1]\n j = m.find(b)\n if j != -1 :\n y = True\nif x and y :\n print('both')\nelif x :\n print('forward')\nelif y :\n print('backward')\nelse :\n print('fantasy')", "s = input()\r\nf = input()\r\nl = input()\r\nr = s[::-1]\r\nff = rr = 0\r\nif f in s:\r\n j = s.index(f) + len(f) \r\n if l in s[j::]:\r\n ff = 1\r\nif f in r:\r\n jj = r.index(f) + len(f)\r\n if l in r[jj::]:\r\n rr = 1\r\nif(ff == 0 and rr == 0):\r\n print('fantasy')\r\nelif(ff == 1 and rr == 0):\r\n print('forward')\r\nelif(ff == 0 and rr == 1):\r\n print('backward')\r\nelse:\r\n print('both')\r\n \r\n", "\r\nf = input()\r\n\r\ns1 = input()\r\ns2 = input()\r\n\r\nfw = 0\r\nbw = 0\r\n\r\nif s1 in f:\r\n a = f.index(s1)\r\n g = f[a+len(s1):]\r\n if s2 in g:\r\n fw = 1\r\nh = f[::-1]\r\nif s1 in h:\r\n a = h.index(s1)\r\n g = h[a+len(s1):]\r\n if s2 in g:\r\n bw = 1\r\n\r\n\r\nif fw == 1 and bw == 1:\r\n print (\"both\")\r\n\r\nelif fw == 1 and bw == 0:\r\n print (\"forward\")\r\n\r\nelif fw == 0 and bw == 1:\r\n print (\"backward\")\r\n\r\nelif fw == 0 and bw == 0:\r\n print (\"fantasy\")\r\n \r\n \r\n", "allflags = input() #input list of flags\r\nflags1 = input()\r\nflags2 = input()\r\nsearchresult = [0]*2 #array of search results\r\n\r\n#check if Petya has written flags forward\r\nres1 = allflags.find(flags1)\r\nif res1 != -1: #if first string is in general list of flags\r\n res2 = allflags.find(flags2, res1+len(flags1))\r\n if res2 != -1: #if second string is in general list of flags\r\n searchresult[0] = 1 #if two conditions are carried out\r\n\r\nflags = list(allflags) #reverse list of flags\r\nflags.reverse()\r\nflagsrev = ''.join(flags)\r\n\r\n#check if Petya has written flags backward\r\nres1 = flagsrev.find(flags1)\r\nif res1 != -1: #if first string is in general list of flags\r\n res2 = flagsrev.find(flags2, res1+len(flags1))\r\n if res2 != -1: #if second string is in general list of flags\r\n searchresult[1] = 1 #if two conditions are carried out\r\n\r\n#print the solution\r\nif searchresult[0] == 1 and searchresult[1] == 1:\r\n print('both')\r\nelif searchresult[0] == 1:\r\n print('forward')\r\nelif searchresult[1] == 1:\r\n print('backward')\r\nelse:\r\n print('fantasy')", "s = input()\r\na = input()\r\nb = input()\r\nf = 0\r\nback = 0\r\nif((a in s) and (b in s)):\r\n k = s.index(a)\r\n if(b in s[k+len(a):]):\r\n f+=1\r\ns = list(s)\r\ns.reverse()\r\ns = str(''.join(s))\r\nif((a in s) and (b in s)):\r\n k = s.index(a)\r\n if(b in s[k+len(a):]):\r\n back+=1\r\nif(f==1 and back==0):\r\n print('forward')\r\nelif(f==1 and back==1):\r\n print('both')\r\nelif(f==0 and back==1):\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "s = input()\r\nt=list(s)\r\nt.reverse()\r\nsr=''.join(t)\r\nrez=[0]*2\r\ns1=input()\r\ns2=input()\r\nk1=s.find(s1)\r\nif k1!=-1:\r\n k2=s.find(s2,k1+len(s1))\r\n if k2!=-1:\r\n rez[0]=1\r\nk1=sr.find(s1)\r\nif k1!=-1:\r\n k2=sr.find(s2,k1+len(s1))\r\n if k2!=-1:\r\n rez[1]=1\r\nif rez[0]==1 and rez[1]==1:\r\n print('both')\r\nelif rez[0]==1:\r\n print('forward')\r\nelif rez[1]==1:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "flags=input()\r\na=input()\r\nb= input()\r\nfow=0\r\nback=0\r\nif flags.find(a) != -1 and flags.find(b, flags.find(a)+len(a)) != -1: \r\n fow = 1\r\nflags = flags[::-1]\r\nif flags.find(a) != -1 and flags.find(b, flags.find(a)+len(a)) != -1: \r\n back = 2\r\nlst=['fantasy','forward','backward','both']\r\nprint(lst[fow + back])", "s=input()\r\nx=input()\r\ny=input()\r\nd=0\r\nq=\"\".join(reversed(s))\r\nif x in s:\r\n i=len(s)\r\n e=s.find(x)\r\n \r\n a=e+len(x)\r\n \r\n s=s[a:i]\r\n \r\n if y in s:\r\n d+=1\r\nif x in q:\r\n i=len(q)\r\n e=q.find(x) \r\n a=e+len(x)\r\n q=q[a:i]\r\n if y in q:\r\n d+=2 \r\nif d==0:\r\n print(\"fantasy\")\r\nelif d==1:\r\n print(\"forward\")\r\nelif d==2:\r\n print(\"backward\")\r\nelse:\r\n print(\"both\")", "t1=input()\r\ns1=input()\r\ns2=input()\r\nt2=t1[::-1]\r\nans,san=0,0\r\nif s1 in t1:\r\n\tif s2 in t1[t1.index(s1)+len(s1):]:ans+=1\r\nif s1 in t2:\r\n\tif s2 in t2[t2.index(s1)+len(s1):]:san+=1\r\nif ans==1 and san==1:print('both')\r\nelif ans==1:print('forward')\r\nelif san==1:print('backward')\r\nelse:print('fantasy')", "forwardStations = input()\r\nfirstStations = input()\r\nlastStation = input()\r\n\r\n\r\n# function that checks if the order exists\r\ndef get_direction(stations):\r\n\r\n if firstStations in stations:\r\n # csearching for index\r\n indexOfFirsChar = stations.index(firstStations)\r\n # dindex of the last element\r\n indexOfLastChar = indexOfFirsChar + len(firstStations) - 1\r\n # if the last sequrnce seen by the boy is in the second part of the string\r\n # returns True\r\n if lastStation in stations[indexOfLastChar + 1:]:\r\n return True\r\n # otherwise it is false\r\n return False\r\n\r\n\r\n# functions call\r\nforward = get_direction(forwardStations)\r\nbackward = get_direction(forwardStations[::-1])\r\n\r\n# print the result\r\n\r\nif forward and backward:\r\n print('both')\r\nelif forward:\r\n print('forward')\r\nelif backward:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "import sys\r\n\r\nforward = False\r\nbackward = False\r\nforward_before = False\r\nforward_after = False\r\nbackward_before = False\r\nbackward_after = False\r\n\r\nseq = sys.stdin.readline().strip()\r\nbefore = sys.stdin.readline().strip()\r\nafter = sys.stdin.readline().strip()\r\n\r\nseq_len = len(seq)\r\nbefore_len = len(before)\r\nafter_len = len(after)\r\n\r\nafter_start = 0\r\nfor i in range(seq_len - before_len + 1):\r\n if before == seq[i:i + before_len]:\r\n forward_before = True\r\n after_start = i + before_len\r\n break\r\n\r\nif after_start > 0 and after_start < seq_len:\r\n for i in range(after_start, seq_len - after_len + 1):\r\n if after == seq[i:i + after_len]:\r\n forward_after = True\r\n break\r\n\r\nforward = forward_before and forward_after\r\n\r\nseq_rev = seq[::-1]\r\nafter_start = 0\r\nfor i in range(seq_len - before_len + 1):\r\n if before == seq_rev[i:i + before_len]:\r\n backward_before = True\r\n after_start = i + before_len\r\n break\r\n\r\nif after_start > 0 and after_start < seq_len:\r\n for i in range(after_start, seq_len - after_len + 1):\r\n if after == seq_rev[i:i + after_len]:\r\n backward_after = True\r\n break\r\n\r\nbackward = backward_before and backward_after\r\n\r\nif forward and backward:\r\n print('both')\r\nelif forward:\r\n print('forward')\r\nelif backward:\r\n print('backward')\r\nelse:\r\n print('fantasy')", "r = input()\r\na = input()\r\nb = input()\r\n\r\ndef kmp(s, p, st):\r\n i = 0\r\n j = 1\r\n nex = [0]\r\n while j < len(p):\r\n if p[i] == p[j]:\r\n nex.append(i + 1)\r\n i += 1\r\n j += 1\r\n else:\r\n if i > 0:\r\n i = nex[i - 1]\r\n else:\r\n nex.append(0)\r\n j += 1\r\n j = 0\r\n i = st\r\n while i < len(s) and j < len(p):\r\n if s[i] == p[j]:\r\n i += 1\r\n j += 1\r\n else:\r\n if j > 0:\r\n j = nex[j - 1]\r\n else:\r\n i += 1\r\n if j == len(p):\r\n return i - len(p)\r\n else:\r\n return -1\r\nt1 = kmp(r, a, 0)\r\nforward = backward = False\r\nif t1 != -1:\r\n t2 = kmp(r, b, t1 + len(a))\r\n if t2 != -1:\r\n forward = True\r\nt3 = kmp(r[::-1], a, 0)\r\nif t3 != -1:\r\n t4 = kmp(r[::-1], b, t3 + len(a))\r\n if t4 != -1:\r\n backward = True\r\nif forward and backward:\r\n print(\"both\")\r\nelif forward:\r\n print(\"forward\")\r\nelif backward:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")", "sequence, seen1, seen2, theway = input(), input(), input(), \"fantasy\"\nsequenceback = \"\".join(list(reversed(sequence)))\nif seen1 in sequence and seen2 in sequence:\n\tif seen2 in sequence[sequence.index(seen1)+len(seen1):]:\n\t\ttheway = \"forward\"\nif seen1 in sequenceback and seen2 in sequenceback:\n\tif seen2 in sequenceback[sequenceback.index(seen1)+len(seen1):]:\n\t\tif theway == \"forward\": theway = \"both\" \n\t\telse: theway = \"backward\"\nprint(theway)\n", "import sys\r\nimport math\r\nimport bisect\r\nimport re\r\n\r\ndef solve(s, a, b):\r\n forward = False\r\n backward = False\r\n if re.match(r'.*{0}.*{1}.*'.format(a, b), s):\r\n forward = True\r\n if re.match(r'.*{0}.*{1}.*'.format(a, b), s[::-1]):\r\n backward = True\r\n if forward and backward:\r\n return 'both'\r\n if forward:\r\n return 'forward'\r\n if backward:\r\n return 'backward'\r\n return 'fantasy'\r\n\r\ndef main():\r\n s = input()\r\n a = input()\r\n b = input()\r\n ans = solve(s, a, b)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "c=input()\r\ns=input()\r\nt=input()\r\ntry:\r\n i=c.index(s)\r\n f=t in c[i+len(s):]\r\nexcept ValueError:\r\n f=0\r\nc=c[::-1]\r\ntry:\r\n i=c.index(s)\r\n b=t in c[i+len(s):]\r\nexcept ValueError:\r\n b=0\r\nprint([['fantasy','backward'],['forward','both']][f][b])\r\n", "color, s1, s2, atob, btoa = input(), input(), input(), False, False\r\n\r\nfor i in range(len(color) - len(s1) - len(s2) + 1):\r\n if color[i:i + len(s1)] == s1:\r\n for j in range(i + len(s1), len(color) - len(s2) + 1):\r\n if color[j:j + len(s2)] == s2:\r\n atob = True\r\n break\r\n break\r\n\r\ncolor = color[::-1]\r\nfor i in range(len(color) - len(s1) - len(s2) + 1):\r\n if color[i:i + len(s1)] == s1:\r\n for j in range(i + len(s1), len(color) - len(s2) + 1):\r\n if color[j:j + len(s2)] == s2:\r\n btoa = True\r\n break\r\n break\r\n\r\nif atob and btoa:\r\n print(\"both\")\r\nelif atob:\r\n print(\"forward\")\r\nelif btoa:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")", "import fnmatch\r\n\r\nstations = input()\r\nfirstSight = input()\r\nsecondSight = input()\r\n\r\nstrCheck = \"*\" + firstSight + \"*\" + secondSight + \"*\"\r\nforward = fnmatch.fnmatch(stations, strCheck)\r\n\r\nstationsReverse = stations[::-1]\r\nbackward = fnmatch.fnmatch(stationsReverse, strCheck)\r\n\r\nif forward and backward:\r\n print(\"both\")\r\nelif forward and not backward:\r\n print(\"forward\")\r\nelif backward and not forward:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")", "s=input()\r\nx=input()\r\ny=input()\r\ncount1=0\r\nrev=s[::-1]\r\nif x in s :\r\n m=s.index(x)+len(x)\r\n if y in s[m:]:\r\n count1+=1\r\nif x in rev:\r\n m=rev.index(x)+len(x)\r\n if y in rev[m:]:\r\n count1+=2\r\nprint([\"fantasy\",\"forward\",\"backward\",\"both\"][count1])", "# URL: http://codeforces.com/contest/8/status/A\r\n# ~\r\n\r\nimport re\r\nfrom typing import Tuple\r\n\r\n\r\ndef _solve(haystack: str, a: str, b: str) -> bool:\r\n \"\"\"Return true iff a and b both are substrings of `haystack`, and b occurs\r\n after a.\"\"\"\r\n a_index = haystack.find(a)\r\n b_index = haystack.rfind(b)\r\n if a_index > -1 and b_index > -1 and b_index >= (a_index + len(a)):\r\n return True\r\n return False\r\n\r\n\r\ndef solve(flags: str, a: str, b: str) -> str:\r\n is_forward = _solve(flags, a, b)\r\n is_backward = _solve(flags[::-1], a, b)\r\n if is_forward and is_backward:\r\n return 'both'\r\n elif is_forward:\r\n return 'forward'\r\n elif is_backward:\r\n return 'backward'\r\n else:\r\n return 'fantasy'\r\n\r\n\r\ndef parse_input() -> Tuple[str, str, str]:\r\n return input(), input(), input()\r\n\r\n\r\nif __name__ == '__main__':\r\n flags, a, b = parse_input()\r\n print(solve(flags, a, b))\r\n", "atob = input()\nfirst = input()\nsecond = input()\n\n\"\"\"\n\nfind the first occurence of first in atob\nthen search second from that\n\n\"\"\"\n\n'fkjheyfj'\n\nans = [0, 0]\n\none = atob.find(first)\nif one != -1:\n two = atob[one+len(first):].find(second)\n if two != -1:\n ans[0] = 1\n\natob = atob[::-1]\none = atob.find(first)\nif one != -1:\n two = atob[one+len(first):].find(second)\n if two != -1:\n ans[1] = 1\n\nif sum(ans) == 2:\n print(\"both\")\nelif ans[0] == 1:\n print(\"forward\")\nelif ans[1] == 1:\n print('backward')\nelse:\n print('fantasy')\n", "ab=input()\r\nf=input()\r\ns=input()\r\nforward,backward=False,False\r\nif f in ab:\r\n t=ab.index(f)\r\n t+=len(f)\r\n if s in ab[t:]:\r\n forward=True\r\nab=ab[::-1]\r\nif f in ab:\r\n t=ab.index(f)\r\n t+=len(f)\r\n if s in ab[t:]:\r\n backward=True\r\nif forward and backward:\r\n print(\"both\")\r\nelif forward:\r\n print(\"forward\")\r\nelif backward:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")", "import re\r\n\r\npath = input()\r\nfirst = input()\r\nsecond = input()\r\nback_path = path[::-1]\r\nflag1 = 0\r\nflag2 = 0\r\n\r\nind1 = [m.start() for m in re.finditer(first, path)]\r\nif ind1:\r\n path = path[ind1[0] + len(first)::]\r\n ind2 = [m.start() for m in re.finditer(second, path)]\r\n if ind2:\r\n flag1 = 1\r\n\r\nind1 = [m.start() for m in re.finditer(first, back_path)]\r\nif ind1:\r\n back_path = back_path[ind1[0] + len(first)::]\r\n ind2 = [m.start() for m in re.finditer(second, back_path)]\r\n if ind2:\r\n flag2 = 1\r\n\r\nif flag1 and flag2:\r\n print(\"both\")\r\nelif flag1 and not flag2:\r\n print('forward')\r\nelif not flag1 and flag2:\r\n print('backward')\r\nelse:\r\n print(\"fantasy\")", "s=input()\r\nt1=input()\r\nt2=input()\r\nif t1 in s and t2 in s[s.index(t1)+len(t1):]:\r\n forw=True\r\nelse:\r\n forw=False\r\ns=s[::-1]\r\nif t1 in s and t2 in s[s.index(t1)+len(t1):]:\r\n bac=True\r\nelse:\r\n bac=False\r\nif forw==bac==True:\r\n print(\"both\")\r\nelif forw==True:\r\n print(\"forward\")\r\nelif bac==True:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")", "a=input()\r\nb=input()\r\nc=input()\r\na1=len(a)\r\nb1=len(b)\r\nc1=len(c)\r\nd=0\r\ne=0\r\nf=-1\r\nl=-1\r\nfor i in range(a1-b1+1):\r\n if a[i:i+b1]==b:\r\n if f==-1:\r\n f=i\r\n break\r\nfor i in range(a1-c1+1):\r\n if a[i:i+c1]==c:\r\n l=i\r\nif f!=-1 and l!=-1:\r\n if l>f+b1-1:\r\n d=1\r\na=a[::-1]\r\nf=-1\r\nl=-1\r\nfor i in range(a1-b1+1):\r\n if a[i:i+b1]==b:\r\n if f==-1:\r\n f=i\r\n break\r\nfor i in range(a1-c1+1):\r\n if a[i:i+c1]==c:\r\n l=i\r\nif f!=-1 and l!=-1:\r\n if l>f+b1-1:\r\n e=1\r\nif d==1:\r\n if e==1:\r\n print('both')\r\n else:\r\n print('forward')\r\nelse:\r\n if e==1:\r\n print('backward')\r\n else:\r\n print('fantasy')", "a, b, c = input(), input(), input()\r\n \r\ndef check(a):\r\n i = a.find(b)\r\n return i != -1 and a.find(c, i + len(b)) != -1\r\n \r\nf = check(a)\r\nb = check(a[::-1])\r\n \r\nif f and b:\r\n print(\"both\")\r\nelif f:\r\n print(\"forward\")\r\nelif b:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")", "def tryexcept(flags,first):\r\n try:\r\n index = flags.index(first)\r\n except:\r\n index = len(flags) + 1\r\n return index\r\n\r\ndef rtryexcept(flags,first):\r\n try:\r\n index= flags.rindex(first)\r\n except:\r\n index = -1\r\n return index\r\n\r\n\r\nflags = input()\r\nfirst = input()\r\nsecond = input()\r\n\r\nstartToFinish1=tryexcept(flags,first)\r\nstartToFinish2=rtryexcept(flags,second)\r\n\r\nflags=flags[len(flags)::-1]\r\n\r\nfinishToStart1=tryexcept(flags,first)\r\nfinishToStart2=rtryexcept(flags,second)\r\n\r\n\r\nif(startToFinish1+len(first)-1<startToFinish2 and finishToStart1+len(first)-1<finishToStart2):\r\n print('both')\r\nelif (startToFinish1+len(first)-1<startToFinish2):\r\n print('forward')\r\nelif (finishToStart1+len(first)-1<finishToStart2):\r\n print('backward')\r\nelse :\r\n print('fantasy')\r\n", "s,x,y,t=input(),input(),input(),0\ne=s[::-1]\nif x in s:\n q=s.index(x)+len(x)\n if y in s[q:]:t+=1\nif x in e:\n q=e.index(x)+len(x)\n if y in e[q:]:t+=2\nprint([\"fantasy\",\"forward\",\"backward\",\"both\"][t])\n\n\t\t\t \t\t \t\t \t\t \t \t\t \t \t\t \t \t\t", "total=input()\r\nword=total[::-1]\r\none=input()\r\ntwo=input()\r\nif one in total and two in total[total.index(one)+len(one)::]:\r\n \r\n if one in word and two in word[word.index(one)+len(one)::]:\r\n print(\"both\")\r\n else:\r\n print(\"forward\")\r\nelse:\r\n if one in word and two in word[word.index(one)+len(one)::]:\r\n print(\"backward\")\r\n else:\r\n print(\"fantasy\")\r\n \r\n ", "# https://codeforces.com/problemset/problem/8/A\r\n\r\ndef check(full, first, second):\r\n pos_first = 0\r\n while pos_first != -1:\r\n pos_first = full.find(first)\r\n if pos_first == -1:\r\n break\r\n pos_second = full[pos_first + len(first):].find(second)\r\n if pos_second != -1:\r\n return True\r\n full = full[pos_first + 1:]\r\n return False\r\n\r\n\r\ndef func_sol(raw_data):\r\n full, first, second, _ = raw_data.split('\\n')\r\n rfull = full[::-1]\r\n\r\n forward = check(full, first, second)\r\n backward = check(rfull, first, second)\r\n\r\n if forward and backward:\r\n return \"both\"\r\n elif forward:\r\n return \"forward\"\r\n elif backward:\r\n return \"backward\"\r\n else:\r\n return \"fantasy\"\r\n\r\n\r\ndef main():\r\n try:\r\n from codeforces.utilities import run_tests\r\n run_tests(func_sol)\r\n except ImportError:\r\n from sys import stdin\r\n print(func_sol(stdin.read()))\r\n\r\n\r\nmain()\r\n", "s=input()\r\ns1=input()\r\ns2=input()\r\nf1=0\r\nf2=0\r\nind1=s.find(s1)\r\nind2=s[ind1+len(s1):].find(s2)\r\nif(ind1!=-1 and ind2!=-1):\r\n f1=1\r\nt=s[-1::-1]\r\n#print(t)\r\nind1=t.find(s1)\r\nind2=t[ind1+len(s1):].find(s2)\r\nif ind1!=-1 and ind2!=-1:\r\n f2=1 \r\nif(f1==1 and f2==1):\r\n print('both')\r\nelif f1==1:\r\n print('forward')\r\nelif f2==1:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n \r\n", "def find_flag_sequences(colors, seq1, seq2):\r\n forward = backward = False\r\n\r\n if seq1 in colors and seq2 in colors[colors.index(seq1) + len(seq1):]:\r\n forward = True\r\n\r\n colors_reversed = colors[::-1]\r\n if seq1 in colors_reversed and seq2 in colors_reversed[colors_reversed.index(seq1) + len(seq1):]:\r\n backward = True\r\n\r\n if forward and backward:\r\n return \"both\"\r\n elif forward:\r\n return \"forward\"\r\n elif backward:\r\n return \"backward\"\r\n else:\r\n return \"fantasy\"\r\n\r\n\r\ncolors = input()\r\nseq1 = input()\r\nseq2 = input()\r\n\r\nresult = find_flag_sequences(colors, seq1, seq2)\r\nprint(result)\r\n\r\n", "trip = input()\r\nseq1 = input()\r\nseq2 = input()\r\nn1 = len(seq1)\r\nn2 = len(seq2)\r\nm = len(trip)\r\n\r\n\r\ndef roadtrip(trip):\r\n n1f = 0\r\n n2f = 0\r\n forward = 0\r\n for i in range(m-n1+1):\r\n if seq1 == trip[i:i+n1]:\r\n n1f = 1\r\n index1 = i + n1\r\n break\r\n #print(n1f)\r\n #print(index1)\r\n if n1f == 1:\r\n for i in range(index1, m-n2+1):\r\n if seq2 == trip[i:i+n2]:\r\n n2f = 1\r\n break\r\n if n2f == 1:\r\n forward = 1\r\n return forward\r\n\r\n\r\na1 = roadtrip(trip)\r\na2 = roadtrip(trip[::-1])\r\nif a1 == 1 and a2 == 1:\r\n print('both')\r\nelif a1 == 1 and a2 == 0:\r\n print('forward')\r\nelif a1 == 0 and a2 == 1:\r\n print('backward')\r\nelif a1 == 0 and a2 == 0:\r\n print('fantasy')\r\n", "s = input()\r\na = input()\r\nb = input()\r\nif s.find(a) != -1 and s[::-1].find(a) != -1:\r\n i = s.find(a) + len(a)\r\n j = s[::-1].find(a) + len(a)\r\n if s[i:].find(b) != -1 and s[::-1][j:].find(b) != -1:\r\n print(\"both\")\r\n else:\r\n if s[i:].find(b) != -1:\r\n print(\"forward\")\r\n elif s[::-1][j:].find(b) != -1:\r\n print(\"backward\")\r\n else:\r\n print(\"fantasy\")\r\nelif s.find(a) != -1:\r\n i = s.find(a) + len(a)\r\n if s[i:].find(b) != -1:\r\n print(\"forward\")\r\n else:\r\n print(\"fantasy\")\r\nelif s[::-1].find(a) != -1:\r\n j = s[::-1].find(a) + len(a)\r\n if s[::-1][j:].find(b) != -1:\r\n print(\"backward\")\r\n else:\r\n print(\"fantasy\")\r\nelse:\r\n print(\"fantasy\")", "i,ii,iii = [input() for i in range(3)]\r\ndef check(a):\r\n try:\r\n c = a.index(ii)\r\n cc = a.index(iii,c+len(ii))\r\n except:\r\n return 0,0\r\n return c,cc\r\nc = check(i)\r\ncc = check(i[::-1])\r\nif c[0] < c[1] and cc[0] < cc[1]: print(\"both\")\r\nelif c[0] < c[1]: print(\"forward\")\r\nelif cc[0] < cc[1]: print(\"backward\")\r\nelse: print(\"fantasy\")", "#!/usr/bin/env python\n'''\n' Author: Cheng-Shih Wong\n' Email: [email protected]\n' Date: \n'''\n\ndef main():\n\n def check(seq, A, B):\n fA = seq.find(A)\n\n return fA >= 0 and seq.find(B, fA+len(A)) >= 0\n\n flags = input()\n fmem = input()\n smem = input()\n\n forw = check(flags, fmem, smem)\n back = check(flags[::-1], fmem, smem)\n \n if forw and back:\n print('both')\n elif forw:\n print('forward')\n elif back:\n print('backward')\n else:\n print('fantasy')\n\nif __name__ == '__main__':\n main()\n", "s1 = input()\ns2 = input()\ns3 = input()\n\nres = [0, 0]\ni = 0\nstate = 0\nwhile i < len(s1):\n if state == 0 and i + len(s2) <= len(s1) and s1[i:i+len(s2)] == s2:\n state = 1\n i += len(s2)\n elif state == 1 and i + len(s3) <= len(s1) and s1[i:i+len(s3)] == s3:\n res[0] = 1\n break\n else:\n i += 1\n\ns1 = s1[::-1]\ni = 0\nstate = 0\nwhile i < len(s1):\n if state == 0 and i + len(s2) <= len(s1) and s1[i:i+len(s2)] == s2:\n state = 1\n i += len(s2)\n elif state == 1 and i + len(s3) <= len(s1) and s1[i:i+len(s3)] == s3:\n res[1] = 1\n break\n else:\n i += 1\n\nif res[0] == res[1] == 1:\n print(\"both\")\nelif res[0] == res[1] == 0:\n print(\"fantasy\")\nelif res[0] == 1:\n print(\"forward\")\nelif res[1] == 1:\n print(\"backward\")", "s=input();\r\ns1=input();\r\ns2=input();\r\nflag1=flag2=0;\r\npos1=s.find(s1);\r\nif(pos1>=0):\r\n pos2=s[pos1+len(s1):].find(s2);\r\n if(pos2>=0):flag1=1;\r\ns=s[::-1];\r\npos1=s.find(s1);\r\nif(pos1>=0):\r\n pos2=s[pos1+len(s1):].find(s2);\r\n if(pos2>=0):flag2=1;\r\nif(flag1==1 and flag2==1):print(\"both\");\r\nelif(flag1==1):print(\"forward\");\r\nelif(flag2==1):print(\"backward\");\r\nelse:print(\"fantasy\");\r\n", "a = input()\r\nb = input()\r\nc = input()\r\nk=0\r\nif ((-a.find(b) + a.rfind(c)) >= len(b) and\r\n a.find(b) != -1 and a.rfind(c) != -1):\r\n k+=1\r\n\r\n\r\nn = len(a)\r\ns=\"\"\r\nfor i in range(n):\r\n s += a[n-i-1]\r\n\r\n\r\nif ((-s.find(b) + s.rfind(c)) >= len(b) and\r\n s.find(b) != -1 and s.rfind(c) != -1):\r\n k+=2\r\nif k==3:\r\n print('both')\r\nif k==2:\r\n print('backward')\r\nif k==1:\r\n print(\"forward\")\r\nif k==0:\r\n print(\"fantasy\")\r\n", "word = input()\r\none = input()\r\ntwo = input()\r\n\r\ndef isPossible(word, one, two):\r\n aw = word\r\n if one in aw:\r\n a = aw.index(one)\r\n aw = aw[a + len(one):]\r\n if two in aw:\r\n return True\r\n return False\r\n\r\nforward = isPossible(word, one, two)\r\nbackward = isPossible(word[::-1], one, two)\r\n\r\nres = 0\r\nif forward: res +=1\r\nif backward: res +=2\r\nprint([\"fantasy\", \"forward\", \"backward\", \"both\"][res])", "s= input()\r\nrs = s[::-1]\r\na= input()\r\nb=input()\r\nforw,back = False,False\r\nfa = s.find(a)\r\n#print(fa)\r\nif fa!=-1:\r\n fb = s.find(b,fa+len(a))\r\n #print(fb)\r\n if fb!=-1:\r\n forw = True\r\n else:\r\n forw = False\r\nelse:\r\n forw = False\r\nfa = rs.find(a)\r\nif fa!=-1:\r\n fb = rs.find(b,fa+len(a))\r\n if fb!=-1:\r\n back = True\r\n else:\r\n back = False\r\nelse:\r\n back = False\r\nif forw==False and back == False:\r\n print(\"fantasy\")\r\nelif forw ==True and back == True:\r\n print(\"both\")\r\nelif forw == True and back == False:\r\n print(\"forward\")\r\nelse :\r\n print(\"backward\")", "s=input()\r\nfirst=input()\r\nsecond=input()\r\na=s[::-1]\r\nforward = False\r\nbackward = False\r\n\r\nfor i in range(0,len(s)-len(first)+1):\r\n if s[i:i+len(first)]==first:\r\n j = i+len(first)\r\n if second in s[j:]:\r\n forward=True\r\n break\r\n\r\n\r\n#if (first in s) and (second in s[j:]):\r\n# forward = True\r\n\r\nfor i in range(0,len(a)-len(first)+1):\r\n if a[i:i+len(first)]==first:\r\n k = i+len(first)\r\n if second in a[k:]:\r\n backward=True\r\n break\r\n\r\n#if (second in a) and (first in a[k:]):\r\n# backward = True\r\n\r\nif (forward==True and backward==True):\r\n print(\"both\")\r\nif (forward==False and backward==False):\r\n print(\"fantasy\")\r\nif (forward==True and backward==False):\r\n print(\"forward\")\r\nif (forward==False and backward==True):\r\n print(\"backward\")", "from re import match\r\n\r\nflag = input()\r\np1 = input()\r\np2 = input()\r\n\r\npattern = '.*' + p1 + '.*' + p2 + '.*'\r\nforward = match(pattern, flag) is not None\r\nbackward = match(pattern, flag[::-1]) is not None\r\n\r\nif forward and backward:\r\n print('both')\r\nelif forward:\r\n print('forward')\r\nelif backward:\r\n print('backward')\r\nelse:\r\n print('fantasy')", "all = input()\r\nfirst = input()\r\nsecond = input()\r\n\r\na = all.find(first)\r\nb = all.find(second, a + len(first))\r\nreverse = ''.join(reversed(all))\r\nar = reverse.find(first)\r\nbr = reverse.find(second, ar + len(first))\r\n\r\nif a != -1 and a < b and ar != -1 and ar < br:\r\n print('both')\r\nelif a != -1 and a < b:\r\n print('forward')\r\nelif ar != -1 and ar < br:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "flag=input()\r\nn=len(flag)\r\nr_flag=flag[::-1]\r\nflag1=input()\r\nflag2=input()\r\nforward=0\r\ni=flag.find(flag1)\r\nif i>-1 :\r\n k=i+len(flag1)\r\n f=flag[k:]\r\n if f.find(flag2) > -1:\r\n forward=1\r\n \r\n \r\nbackward=0 \r\ni=r_flag.find(flag1)\r\nif i>-1 :\r\n k=i+len(flag1)\r\n r_f=r_flag[k:]\r\n if r_f.find(flag2) > -1:\r\n backward=1\r\n \r\nif forward!=0 and backward!=0:\r\n print(\"both\")\r\nelif forward==0 and backward!=0:\r\n print(\"backward\")\r\nelif forward!=0 and backward==0:\r\n print(\"forward\")\r\nelse:\r\n print(\"fantasy\")", "__author__ = 'Darren'\r\n\r\n\r\ndef solve():\r\n flags, first, second = input(), input(), input()\r\n len_first = len(first)\r\n index_first, index_second = flags.find(first), flags.rfind(second)\r\n forward = False\r\n if (index_first > -1 and index_second > -1 and\r\n index_first + len_first <= index_second):\r\n forward = True\r\n flags = flags[::-1]\r\n index_first, index_second = flags.find(first), flags.rfind(second)\r\n backward = False\r\n if (index_first > -1 and index_second > -1 and\r\n index_first + len_first <= index_second):\r\n backward = True\r\n if forward and backward:\r\n print('both')\r\n elif forward:\r\n print('forward')\r\n elif backward:\r\n print('backward')\r\n else:\r\n print('fantasy')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "import re\nz = input()\na = input()\nb = input()\nregex = re.compile(a+r'.*'+b)\nif (bool(regex.search(z))) and (bool(regex.search(z[::-1]))):\n\tprint('both')\nelif (bool(regex.search(z))):\n\tprint('forward')\nelif (bool(regex.search(z[::-1]))):\n\tprint('backward')\nelse:\n\tprint('fantasy')", "s = input().strip()\r\na = input().strip()\r\nb = input().strip()\r\nt = 0\r\nif a in s and b in s:\r\n if s.index(a) + len(a) <= s.rindex(b): t += 1\r\ns = s[::-1]\r\nif a in s and b in s:\r\n if s.index(a) + len(a) <= s.rindex(b): t += 2\r\nprint([\"fantasy\", \"forward\", \"backward\", \"both\"][t])\r\n", "\r\ntruepath=input()\r\nfirstwake=input()\r\nsecondwake=input()\r\nd=-1\r\nf=-1\r\na1=0\r\na2=0\r\nh=0\r\nif len(firstwake)+len(secondwake)>len(truepath):\r\n print('fantasy') #Peters wakefulness faulted\r\n h=1\r\nif h==0:\r\n for i in range (0,len(truepath)-len(firstwake)+1):\r\n if truepath[i:i+len(firstwake)]==firstwake:\r\n d=i #checking if first path is correct\r\n break\r\n for i in range (0,len(truepath)-len(secondwake)+1):\r\n if truepath[i:i+len(secondwake)]==secondwake:\r\n f=i #checking if second path is correct\r\n if d+len(firstwake)-1<f and d>-1:\r\n a1=1\r\n d=-1\r\n f=-1\r\n truepath=list(truepath)\r\n truepath.reverse()\r\n truepath=''.join(truepath) #introducing this to the array\r\n for i in range (0,len(truepath)-len(firstwake)+1):\r\n if truepath[i:i+len(firstwake)]==firstwake:\r\n d=i\r\n break\r\n for i in range (0,len(truepath)-len(secondwake)+1):\r\n if truepath[i:i+len(secondwake)]==secondwake:\r\n f=i\r\n if d+len(firstwake)-1<f and d>-1:\r\n a2=1\r\n if a1==1 and a2==0:\r\n print('forward')\r\n if a1==0 and a2==1:\r\n print('backward')\r\n if a1==1 and a2==1:\r\n print('both')\r\n if a1==0 and a2==0:\r\n print('fantasy')", "a=input()\r\nb=input()\r\nc=input()\r\nans=0\r\nk1=a.find(b)\r\nif k1!=-1:\r\n k2=a.find(c,k1+len(b))\r\n if k2!=-1:\r\n ans+=1\r\nna=a[::-1]\r\nk3=na.find(b)\r\nif k3!=-1:\r\n k4=na.find(c,k3+len(b))\r\n if k4!=-1:\r\n ans+=2\r\nif ans==3:\r\n print('both')\r\nif ans==0:\r\n print('fantasy')\r\nif ans==1:\r\n print('forward')\r\nif ans==2:\r\n print('backward')", "all_f = input()\r\nfirst = input()\r\nsecond = input()\r\nf_ind = all_f.find(first)\r\ns_ind = all_f.find(second,f_ind+len(first))\r\nf_ind_rev = all_f[::-1].find(first)\r\ns_ind_rev = all_f[::-1].find(second,f_ind_rev+len(first))\r\n#print(f_ind, s_ind, f_ind_rev ,s_ind_rev)\r\nif f_ind != -1 and s_ind != -1 and f_ind_rev != -1 and s_ind_rev != -1:\r\n print('both')\r\nelif f_ind != -1 and s_ind != -1:\r\n print('forward')\r\nelif f_ind_rev != -1 and s_ind_rev != -1:\r\n print('backward')\r\nelse:\r\n print('fantasy')", "a=input()\r\nb=input()\r\nc=input()\r\nd=0\r\ni=a.find(b)\r\nif (i>=0):\r\n j=a[i+len(b):].find(c)\r\n if (j>=0):\r\n d=1\r\nm=0\r\na=a[::-1]\r\ni=a.find(b)\r\nif (i>=0):\r\n j=a[i+len(b):].find(c)\r\n if (j>=0):\r\n m=1\r\nif m and d:\r\n print(\"both\")\r\nelse:\r\n if d:\r\n print(\"forward\")\r\n elif m:\r\n print(\"backward\")\r\n else:\r\n print(\"fantasy\")", "t=input()\r\ns1=input()\r\ns2=input()\r\nans=0\r\nk1=t.find(s1)\r\nif k1!=-1:\r\n k2=t.find(s2,k1+len(s1))\r\n if k2!=-1:ans+=1\r\nw=t[::-1]\r\nw1=w.find(s1)\r\nif w1!=-1:\r\n w2=w.find(s2,w1+len(s1))\r\n if w2!=-1:ans+=2\r\nif ans==1:\r\n print('forward')\r\nelif ans==2:\r\n print('backward')\r\nelif ans==3:\r\n print('both')\r\nelse:\r\n print('fantasy')", "class Solve:\r\n \r\n def __init__(self) -> None:\r\n self.dauVao = str(\"\");\r\n self.co1 = '';\r\n self.co2 = '';\r\n\r\n def vao(self) -> None:\r\n self.dauVao = input();\r\n self.co1 = input();\r\n self.co2 = input();\r\n \r\n def lam(self) -> None:\r\n catDuoi = lambda s: s[s.find(self.co1) + len(self.co1):]; \r\n ketQua = (\"fantasy\", \"forward\", \"backward\", \"both\");\r\n check = 0;\r\n if((self.co1 in self.dauVao) == True):\r\n xau1 = catDuoi(self.dauVao);\r\n if((self.co2 in xau1) == True): check += 1;\r\n if((self.co1 in self.dauVao[::-1]) == True):\r\n xau2 = catDuoi(self.dauVao[::-1]);\r\n if((self.co2 in xau2) == True): check += 2;\r\n print(ketQua[check]);\r\n\r\n \r\ndef main():\r\n p = Solve();\r\n p.vao();\r\n p.lam();\r\n\r\n\r\nmain();\r\n", "# 8A\r\n\r\nfrom sys import stdin\r\n\r\n__author__ = 'artyom'\r\n\r\n\r\ndef read_line():\r\n return stdin.readline().strip()\r\n\r\n\r\ndef contains(st, a, b):\r\n try:\r\n st.index(b, st.index(a) + len(a))\r\n return 1\r\n except ValueError:\r\n return 0\r\n\r\n\r\nroute = read_line()\r\nroute_back = route[::-1]\r\nseen1 = read_line()\r\nseen2 = read_line()\r\n\r\nres = 0\r\nif contains(route, seen1, seen2):\r\n res = 1\r\nif contains(route_back, seen1, seen2):\r\n res |= 2\r\nprint(['fantasy', 'forward', 'backward', 'both'][res])", "string = input()\r\na = input()\r\nb = input()\r\n \r\n# forward\r\nforward = False\r\nfirst_index = string.find(a)\r\nif first_index != -1:\r\n second_index = string[first_index+len(a)::].find(b)\r\n forward = first_index != -1 and second_index != -1\r\nelse:\r\n forward = False\r\n \r\nstring = string[::-1]\r\n# backward\r\nbackward = False\r\nfirst_index = string.find(a)\r\nif first_index != -1:\r\n second_index = string[first_index+len(a)::].find(b)\r\n backward = first_index != -1 and second_index != -1\r\nelse:\r\n backward = False\r\n \r\nif forward and backward:\r\n print(\"both\")\r\nelif forward:\r\n print(\"forward\")\r\nelif backward:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")", "s = input()\r\ns1 = input()\r\ns2 = input()\r\n\r\nforw = backw = False\r\ntmp = s.find(s1)\r\nif ~tmp:\r\n if ~s[tmp+len(s1):].find(s2):\r\n forw = True\r\ns = s[::-1]\r\ntmp = s.find(s1)\r\nif ~tmp:\r\n if ~s[tmp+len(s1):].find(s2):\r\n backw = True\r\n\r\nif forw and backw: print('both')\r\nelif forw: print('forward')\r\nelif backw: print('backward')\r\nelse: print('fantasy')\r\n", "def has_subseqs(text: str, seq1: str, seq2: str) -> bool:\n seq1_start = text.find(seq1)\n if seq1_start != -1:\n return text.find(seq2, seq1_start + len(seq1)) != -1\n else:\n return False\n\n\nif __name__ == \"__main__\":\n colors = input()\n seq1 = input()\n seq2 = input()\n\n forward = has_subseqs(colors, seq1, seq2)\n backward = has_subseqs(colors[::-1], seq1, seq2)\n\n if forward and backward:\n print(\"both\")\n elif forward:\n print(\"forward\")\n elif backward:\n print(\"backward\")\n else:\n print(\"fantasy\")\n", "def f(s, a, b):\n return bool(~(p := s.find(a)) and ~s.find(b, p+len(a)))\n\n\ns = input()\na = input()\nb = input()\nprint(['fantasy', 'backward', 'forward', 'both']\n [f(s, a, b)*2+f(s[::-1], a, b)])\n\n \t\t\t \t\t \t\t\t \t \t\t \t\t\t \t", "s=input()\r\na=input()\r\nb=input()\r\nfw = False\r\nrw = False\r\nr=s[::-1]\r\nif(a in s):\r\n pa = s.index(a)\r\n if (b in s[pa+len(a):]):\r\n fw = True\r\nif (a in r):\r\n pa = r.index(a)\r\n if (b in r[pa+len(a):]):\r\n rw = True\r\nif (fw and rw):\r\n print(\"both\")\r\nelif(fw and rw==False):\r\n print(\"forward\")\r\nelif(fw==False and rw):\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")\r\n", "t=input()\r\ns1=input()\r\ns2=input()\r\nans=0\r\nk1=t.find(s1)\r\nif k1!=-1:\r\n k2=t.find(s2,k1+len(s1))\r\n if k2!=-1:\r\n ans+=1\r\ns=t[::-1]\r\nk3=s.find(s1)\r\nif k3!=-1:\r\n k4=s.find(s2,k3+len(s1))\r\n if k4!=-1:\r\n ans+=2\r\nif ans==0:\r\n print('fantasy')\r\nelif ans==1:\r\n print('forward')\r\nelif ans==2:\r\n print('backward')\r\nelse:print('both')", "import re\r\n\r\nI = input\r\n\r\ns, first, second = I(), I(), I()\r\n\r\nforward = re.fullmatch('\\w*' + first + '\\w*' + second + '\\w*', s)\r\nbackward = re.fullmatch('\\w*' + first + '\\w*' + second + '\\w*', s[::-1])\r\n\r\nif forward:\r\n print('both' if backward else 'forward')\r\nelse:\r\n print('backward' if backward else 'fantasy')", "S=input()\r\nA=input()\r\nB=input()\r\n\r\nANS=0\r\nANS2=0\r\n\r\nflag=-1\r\nfor i in range(len(S)):\r\n if flag==-1 and S[i:i+len(A)]==A:\r\n flag=i+len(A)\r\n if flag!=-1 and i>=flag and S[i:i+len(B)]==B:\r\n ANS=1\r\n\r\nS=S[::-1]\r\n\r\nflag=-1\r\nfor i in range(len(S)):\r\n if flag==-1 and S[i:i+len(A)]==A:\r\n flag=i+len(A)\r\n if flag!=-1 and i>=flag and S[i:i+len(B)]==B:\r\n ANS2=1\r\n\r\nif ANS==0 and ANS2==0:\r\n print(\"fantasy\")\r\nelif ANS==1 and ANS2==1:\r\n print(\"both\")\r\nelif ANS==1:\r\n print(\"forward\")\r\nelse:\r\n print(\"backward\")\r\n \r\n", "def z(a,b,c):\r\n x,y=a.find(b),a.rfind(c)\r\n return x!=-1 and y!=-1 and x+len(b)<=y\r\n\r\na,b,c=input(),input(),input()\r\n\r\nk1,k2=z(a,b,c), z(a[::-1],b,c)\r\nif k1==False and k2==False :\r\n print(\"fantasy\")\r\nelif k1==False:\r\n print(\"backward\")\r\nelif k2==False:\r\n print(\"forward\")\r\nelse:\r\n print(\"both\")\r\n", "stations = input()\r\nmemo = [input() for _ in range(2)]\r\nresults = [True, True]\r\nfor i, x in enumerate([stations, stations[::-1]]):\r\n ind = x.find(memo[0])\r\n if ind == -1:\r\n results[i] = False\r\n else:\r\n ind += len(memo[0])\r\n ind = x.find(memo[1], ind)\r\n if ind == -1:\r\n results[i] = False\r\nprint('both' if all(results) else 'forward' if results[0] else 'backward' if results[1] else 'fantasy')", "s = input()\ns1 = input()\ns2 = input()\nforward=False\nbackward=False\nmatchfound=False\ns_rev = s[::-1]\ni=0\nwhile i<len(s):\n if matchfound==False and s1==s[i:i+len(s1)]:\n matchfound=True\n i+=len(s1)\n if matchfound==True and s2==s[i:i+len(s2)]:\n forward=True\n break\n i+=1\nmatchfound=False\ni=0\nwhile i<len(s_rev):\n if matchfound==False and s1==s_rev[i:i+len(s1)]:\n matchfound=True\n i+=len(s1)\n if matchfound==True and s2==s_rev[i:i+len(s2)]:\n backward=True\n break\n i+=1\nif forward and backward:\n print('both')\nelif forward:\n print('forward')\nelif backward:\n print('backward')\nelse:\n print('fantasy')\n\n\t\t\t\t \t\t \t\t \t \t\t \t\t \t\t\t \t", "from typing import Optional\r\ndef p_o(s: str, a: str) -> Optional[int]:\r\n \"\"\"\r\n Retourne la position da la première occurence de a dans s, None si ça n'existe pas\r\n \"\"\"\r\n i: int\r\n for i in range(len(s)-len(a)+1):\r\n if s[i:i+len(a)] == a:\r\n return i\r\n return None\r\n\r\nassert p_o('123', '2') == 1\r\nassert p_o('123aabb', '3aa') == 2\r\nassert p_o('123aabb', '3ba') == None\r\n\r\ndef seeable(s: str, a: str, b: str) -> bool:\r\n \"\"\"\r\n Précondition:\r\n \"\"\"\r\n p: Optional[int] = p_o(s, a)\r\n if p == None:\r\n return False\r\n return p_o(s[int(p)+len(a):], b) != None\r\n\r\nassert seeable('abba', 'ab', 'ba')\r\n\r\ndef solve(s: str, a: str, b: str) -> str:\r\n \"\"\"\r\n Précondition: \r\n \"\"\"\r\n f0: bool = seeable(s, a, b)\r\n f1: bool = seeable(s[::-1], a, b)\r\n if f0 and f1:\r\n return 'both'\r\n if f0:\r\n return 'forward'\r\n if f1:\r\n return 'backward'\r\n return 'fantasy'\r\n\r\nassert solve('aaacaaa', 'aca', 'aa') == 'both'\r\na, b, c = input(), input(), input()\r\nprint(solve(a, b, c))", "def flags_on_stations(way, first, second):\r\n if first in way:\r\n if second in way.split(first, 1)[1]:\r\n return True\r\n else:\r\n return False\r\n else:\r\n return False\r\n\r\n\r\ndef flags_on_both_ways(way, first, second):\r\n return flags_on_stations(way, first, second) and flags_on_stations(way[::-1], first, second)\r\n\r\n\r\ndef get_result(way, first, second):\r\n if flags_on_both_ways(way, first, second):\r\n return \"both\"\r\n elif flags_on_stations(way, first, second):\r\n return \"forward\"\r\n elif flags_on_stations(way[::-1], first, second):\r\n return \"backward\"\r\n else:\r\n return \"fantasy\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n print(get_result(input(), input(), input()))\r\n", "def check(flags, first, second):\r\n if first not in flags or second not in flags:\r\n return False\r\n f_f_ind, l_s_ind = flags.index(first), flags.rindex(second)\r\n return f_f_ind + len(first) - 1 < l_s_ind\r\n\r\n\r\nflags, first, second = input(), input(), input()\r\nf = check(flags, first, second)\r\nflags = flags[::-1]\r\nb = check(flags, first, second)\r\nif f and b:\r\n print('both')\r\nelif f:\r\n print('forward')\r\nelif b:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n\r\n ''' 0123456\r\nflags = 'aaacaaa'\r\nfirst = 'aca'\r\nsecond = 'aa'\r\n\r\n'''\r\n", "####\r\nstrA = input()\r\nstrB = input()\r\nstrC = input()\r\n\r\n####\r\n# decale value parameter\r\nk = 0;\r\n# Call x, y the position of strB and strC in strA string.\r\nx, y = strA.find(strB), strA.rfind(strC)\r\nif x > -1 and y > -1 and x + len(strB) < y+1:\r\n k += 1\r\nstrA = strA[::-1]\r\nx, y = strA.find(strB), strA.rfind(strC)\r\nif x > -1 and y > -1 and x + len(strB) < y+1:\r\n k += 2\r\nprint(['fantasy', 'forward', 'backward', 'both'][k])\r\n\r\n", "ss=input()\nns=ss[::-1]\na=input()\nb=input()\nf1=0\nf2=0\nk1=ss.find(a)\nk2=ss.find(b,k1+len(a))\nif ((k1>-1)&(k2>-1)):f1=1\n\nk1=ns.find(a)\nk2=ns.find(b,k1+len(a))\nif ((k1>-1)&(k2>-1)):f2=1\n\nif f1+f2==2:\n print(\"both\")\nelif f1==1:\n print(\"forward\")\nelif f2==1:print(\"backward\")\nelse:\n print(\"fantasy\")\n\n\n\n\n\n", "s, x, y=[input() for i in range(3)]\r\nt = s[::-1]\r\nop = 0\r\npos = 0\r\nif x in s: \r\n pos = s.index(x) + len(x)\r\n if y in s[pos:]: \r\n op += 1\r\nif y in t:\r\n pos = t.index(x) + len(x)\r\n if y in t[pos:]: \r\n op += 2\r\nans=['fantasy', 'forward', 'backward', 'both']\r\nprint(ans[op])\r\n", "s = input()\r\ns1 = input()\r\ns2 = input()\r\n\r\nk = s.find(s1)\r\nif k == -1 or k + len(s1) == len(s):\r\n forward = False\r\nelse:\r\n forward = False if s[k + len(s1):].find(s2) == - 1 else True\r\n\r\ns = s[::-1]\r\n\r\nk = s.find(s1)\r\nif k == -1 or k + len(s1) == len(s):\r\n backward = False\r\nelse:\r\n backward = False if s[k + len(s1):].find(s2) == - 1 else True\r\n\r\nif forward:\r\n print('both' if backward else 'forward')\r\nelse:\r\n print('backward' if backward else 'fantasy')", "def check(a):\r\n try:\r\n c = a.index(ii)\r\n cc = a.index(iii, c + len(ii))\r\n except:\r\n return 0, 0\r\n return c, cc\r\n\r\n\r\ni, ii, iii = [input() for i in range(3)]\r\nc = check(i)\r\ncc = check(i[::-1])\r\nif c[0] < c[1] and cc[0] < cc[1]:\r\n print(\"both\")\r\nelif c[0] < c[1]:\r\n print(\"forward\")\r\nelif cc[0] < cc[1]:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")\r\n", "allflags = input()\nreverseflags = allflags[::-1]\nflags1 = input()\nflags2 = input()\n\nres = \"fantasy\"\n\nif flags1 in allflags and flags2 in allflags[allflags.index(flags1)+len(flags1):]:\n res = \"forward\"\nif flags1 in reverseflags and flags2 in reverseflags[reverseflags.index(flags1)+len(flags1):]:\n if res == \"forward\":\n res = \"both\"\n if res == \"fantasy\":\n res = \"backward\"\n\nprint(res)", "#!/usr/bin/env python\r\nimport string\r\n\r\ndef stringMatch(str1, str2, str3):\r\n m=len(str1)\r\n n=len(str2)\r\n l=len(str3)\r\n for i in range(l-m+1):\r\n if str3[i:i+m] == str1:\r\n for j in range(i+m, l-n+1):\r\n if str3[j:j+n] == str2:\r\n return True\r\n return False\r\n\r\ndef main():\r\n # input\r\n strA = str(input())\r\n strB = str(input())\r\n strC = str(input())\r\n\r\n a = stringMatch(strB, strC, strA)\r\n b = stringMatch(strB, strC, strA[::-1])\r\n\r\n if a and b:\r\n print(\"both\")\r\n elif a and not b:\r\n print(\"forward\")\r\n elif not a and b:\r\n print(\"backward\")\r\n else:\r\n print(\"fantasy\")\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def StartFinish(flags, travel,i):\r\n for i in range(i,len(flags)) :\r\n if flags[i:i+len(travel)]==travel:\r\n return i\r\n return -1\r\n\r\n\r\n\r\nflags=input()\r\nfirst=input()\r\nsecond=input()\r\ni=0\r\nstartToFinish1=int(StartFinish(flags,first,i))\r\ni=startToFinish1\r\nif (startToFinish1!=-1):\r\n startToFinish2=int(StartFinish(flags,second,i+len(first)))\r\n\r\nflags=flags[len(flags)::-1]\r\ni=0\r\nfinishToStart1=int(StartFinish(flags,first,i))\r\ni=finishToStart1\r\nif (finishToStart1!=-1):\r\n finishToStart2=int(StartFinish(flags,second,i+len(first)))\r\nans=0\r\nif (startToFinish1 !=-1 and startToFinish1<startToFinish2):\r\n ans+=1\r\nif (finishToStart1 !=-1 and finishToStart1<finishToStart2):\r\n ans+=2\r\nif (ans==1): print(\"forward\")\r\nif (ans==2): print(\"backward\")\r\nif (ans==3): print(\"both\")\r\nif (ans==0): print(\"fantasy\")\r\n\r\n\r\n\r\n", "t = input()\r\na = input()\r\nb = input()\r\nans = 0\r\ntrain1 = t.find(a)\r\nif train1 != -1:\r\n train2 = t.find(b, train1 + len(a))\r\n if train2 !=-1:ans += 1\r\n\r\nt = t[::-1]\r\ntrain2 = t.find(a)\r\nif train2 != -1:\r\n train1 = t.find(b, train2 + len(a))\r\n if train1 != -1:ans += 2\r\nif ans == 1:\r\n print('forward')\r\nelif ans == 2:\r\n print('backward')\r\nelif ans == 3:\r\n print('both')\r\nelse:\r\n print('fantasy')\r\n", "s,x,y,t=input(),input(),input(),0\r\ne=s[::-1]\r\nif x in s:\r\n q=s.index(x)+len(x)\r\n if y in s[q:]:t+=1\r\nif x in e:\r\n q=e.index(x)+len(x)\r\n if y in e[q:]:t+=2\r\nprint([\"fantasy\",\"forward\",\"backward\",\"both\"][t])", "\r\ndef isTrue(flags, first,second):\r\n try:\r\n index1 = flags.index(first)\r\n except:\r\n index1 = len(flags) + 1\r\n try:\r\n index2= flags.rindex(second)\r\n except:\r\n index2 = -1\r\n return (index1+len(first)-1<index2)\r\n\r\n\r\nflags = input()\r\nfirst = input()\r\nsecond = input()\r\n\r\nforward=isTrue(flags,first,second)\r\n\r\nflags=flags[len(flags)::-1]\r\n\r\nbackward=isTrue(flags,first,second)\r\n\r\nif(forward and backward):\r\n print('both')\r\nelif (forward):\r\n print('forward')\r\nelif (backward):\r\n print('backward')\r\nelse :\r\n print('fantasy')\r\n", "\ndef input_data():\n flags = input().strip()\n seq1 = input().strip()\n seq2 = input().strip()\n return flags, seq1, seq2\n\n\ndef can_see(flags, s1, s2):\n p1 = flags.find(s1)\n if p1 >= 0:\n p2 = flags[p1+len(s1):].find(s2)\n if p2 >= 0:\n return True\n return False\n\n\ndef solve_prob(flags, seq1, seq2):\n forward = can_see(flags, seq1, seq2)\n backward = can_see(flags[::-1], seq1, seq2)\n\n if forward and backward:\n print(\"both\")\n elif forward:\n print(\"forward\")\n elif backward:\n print(\"backward\")\n else:\n print(\"fantasy\")\n\n\nif __name__ == \"__main__\":\n flags, seq1, seq2 = input_data()\n solve_prob(flags, seq1, seq2)\n", "s = input()\r\ns1 = input()\r\ns2 = input()\r\nanswer='fantasy'\r\nl = len(s1)-1\r\ni = s.find(s1)\r\nj = s.rfind(s2)\r\nif i>-1 and j>-1 and i+l<j:\r\n answer='forward'\r\ns=s[::-1]\r\ni=s.find(s1)\r\nj=s.rfind(s2)\r\nif i>-1 and j>-1 and i+l<j:\r\n if answer=='fantasy':\r\n answer='backward'\r\n else:\r\n answer='both'\r\nprint(answer)", "\r\na = input()\r\nb = input()\r\nc = input()\r\nk=0\r\np=0\r\nif a.find(b)!=-1 and a.find(b)<=(a.rfind(c)-len(b)):\r\n k = 1\r\n\r\na = a[::-1]\r\n\r\nif a.find(b)!=-1 and a.find(b)<=(a.rfind(c)-len(b)):\r\n p = 1\r\nif k and p:\r\n print(\"both\")\r\n\r\nelif k:\r\n print(\"forward\")\r\nelif p:\r\n print(\"backward\")\r\n\r\nelse:\r\n print(\"fantasy\")\r\n\r\n", "import re\r\nstations = input()\r\nflags1 = input()\r\nflags2 = input()\r\nr = f\"{flags1}.*{flags2}\"\r\nif re.search(r,stations) != None and re.search(r,stations[::-1]) != None:print('both')\r\nelif re.search(r,stations) != None and re.search(r,stations[::-1]) == None:print('forward')\r\nelif re.search(r,stations) == None and re.search(r,stations[::-1]) != None:print('backward')\r\nelse:print('fantasy')", "def reverse(s):\r\n\treturn s[::-1]\r\ns=input()\r\nsReverse = reverse(s)\r\na=input()\r\nb=input()\r\nimport re\r\nallStr = '.*'\r\nexpression = allStr+a+allStr+b+allStr\r\nmatchResultForward = re.compile(expression).match(s)\r\nmatchResultBackward = re.compile(expression).match(sReverse)\r\nforward = True if matchResultForward!=None else False\r\nbackward = True if matchResultBackward!= None else False\r\nif forward == True:\r\n\tif backward == True:\r\n\t\tprint(\"both\")\r\n\telse:\r\n\t\tprint(\"forward\")\r\nelse:\r\n\tif backward == True:\r\n\t\tprint(\"backward\")\r\n\telse:\r\n\t\tprint(\"fantasy\")", "# function definition here\r\n\r\n\r\ndef check(flags, first, second):\r\n if first not in flags or \\\r\n second not in flags:\r\n return False\r\n f_f_index = flags.index(first)\r\n s_l_index = flags.rindex(second)\r\n return f_f_index + len(first) - 1 < s_l_index\r\n\r\n\r\nflags, first, second = input(), input(), input()\r\nf = check(flags, first, second)\r\nflags = flags[::-1]\r\nb = check(flags, first, second)\r\n\r\nif f and b:\r\n print(\"both\")\r\nelif f:\r\n print(\"forward\")\r\nelif b:\r\n print('backward')\r\nelse:\r\n print(\"fantasy\")\r\n\r\n", "__author__ = 'Obriel Muga'\r\n\r\nif __name__ == '__main__':\r\n banderas = input()\r\n primera = input()\r\n segunda = input()\r\n banderas_vuelta = banderas[::-1]\r\n index = 0\r\n forward = False\r\n backward = False\r\n #forward_primera\r\n if (primera in banderas):\r\n seccion = banderas.find(primera)\r\n banderas_siguiente = banderas[seccion + len(primera):]\r\n if (segunda in banderas_siguiente):\r\n forward = True\r\n if (primera in banderas_vuelta):\r\n seccion = banderas_vuelta.find(primera)\r\n banderas_siguiente = banderas_vuelta[seccion + len(primera):]\r\n if (segunda in banderas_siguiente):\r\n backward = True\r\n if (backward and forward):\r\n print(\"both\")\r\n elif (backward and not forward):\r\n print(\"backward\")\r\n elif (forward and not backward):\r\n print(\"forward\")\r\n else:\r\n print(\"fantasy\")\r\n \r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n", "s=input()\r\ns1=input()\r\ns2=input()\r\nb1,b2=False,False\r\nif s.find(s1)!=-1:\r\n if s[s.find(s1)+len(s1):].find(s2)!=-1:\r\n b1=True\r\ns0=s[::-1]\r\nif s0.find(s1)!=-1:\r\n if s0[s0.find(s1)+len(s1):].find(s2)!=-1:\r\n b2=True\r\nif(b1==True and b2==True):\r\n print(\"both\")\r\nelif(b1==True and b2==False):\r\n print(\"forward\")\r\nelif(b1==False and b2==True):\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")\r\n", "if __name__ == \"__main__\":\r\n flags = input()\r\n reverse_flags = flags[::-1]\r\n period_one =input()\r\n period_two =input()\r\n \r\n forward = False\r\n backward = False\r\n if(period_one in flags):\r\n po = flags.index(period_one)\r\n if (period_two in flags[po+len(period_one):]):\r\n forward = True\r\n\r\n if (period_one in reverse_flags):\r\n po = reverse_flags.index(period_one)\r\n if (period_two in reverse_flags[po+len(period_one):]):\r\n backward = True\r\n\r\n if (forward and backward):\r\n print(\"both\")\r\n elif(forward and not backward):\r\n print(\"forward\")\r\n elif(not forward and backward):\r\n print(\"backward\")\r\n else:\r\n print(\"fantasy\")\r\n", "import string\r\n\r\natob=input();\r\nbtoa=atob[::-1];\r\npet1=input();\r\npet2=input();\r\n\r\nforw=0;\r\ni=atob.find(pet1);\r\nif i!=-1:\r\n j=atob.find(pet2,i+len(pet1));\r\n if j!=-1:\r\n forw=1;\r\n\r\nback=0;\r\ni=btoa.find(pet1);\r\nif i!=-1:\r\n j=btoa.find(pet2,i+len(pet1));\r\n if j!=-1:\r\n back=1;\r\n\r\nif forw==1 and back==1:\r\n print('both');\r\nelif forw==1 and back==0:\r\n print('forward');\r\nelif forw==0 and back==1:\r\n print('backward');\r\nelse:\r\n print('fantasy');", "clrs = input()\r\ns1 = input()\r\ns2 = input()\r\nforward = False\r\nbackward = False\r\nif (s1 in clrs):\r\n if (s2 in clrs[clrs.find(s1) + len(s1):]):\r\n forward = True\r\nclrs = clrs[::-1]\r\nif (s1 in clrs):\r\n if (s2 in clrs[clrs.find(s1) + len(s1):]):\r\n backward = True\r\nif (forward and backward):\r\n print('both')\r\nelif (forward):\r\n print('forward')\r\nelif(backward):\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "s=input()\r\na=input()\r\nb=input()\r\nr=a+'.*'+b\r\nimport re\r\nprint(['fantasy','forward','backward','both'][(re.search(r,s)!=None)+2*(re.search(r,s[::-1])!=None)])", "s, a, b = input(), input(), input()\r\nfd, bk = 0, 0\r\nif s.find(a) != -1:\r\n if s[s.find(a) + len(a): ].find(b) != -1: fd = 1\r\ns = s[::-1]\r\nif s.find(a) != -1:\r\n if s[s.find(a) + len(a): ].find(b) != -1: bk = 1\r\nif fd and bk: print('both')\r\nelif fd: print('forward')\r\nelif bk: print('backward')\r\nelse: print('fantasy')", "flags = input()\r\nflags2 = flags[::-1]\r\nperiod1 = input()\r\nans = 0\r\nperiod2 = input()\r\nif period1 in flags:\r\n flags = flags.replace(period1, '1', 1)\r\n flags = flags[flags.index('1')+1:]\r\n if period2 in flags: ans = ans + 1\r\nif period1 in flags2:\r\n flags2 = flags2.replace(period1, '1',1)\r\n flags2 = flags2[flags2.index('1')+1:]\r\n if period2 in flags2: ans = ans + 10\r\nif ans == 1: print(\"forward\")\r\nelif ans == 10: print(\"backward\")\r\nelif ans == 11: print(\"both\")\r\nelse: print(\"fantasy\")", "t = input()\r\na = input()\r\nb = input()\r\nanswer='fantasy'\r\nl = len(a)-1\r\ni = t.find(a)\r\nj = t.rfind(b)\r\nif i>-1 and j>-1 and i+l<j:\r\n answer='forward'\r\nt=t[::-1]\r\ni=t.find(a)\r\nj=t.rfind(b)\r\nif i>-1 and j>-1 and i+l<j:\r\n if answer=='fantasy':\r\n answer='backward'\r\n else:\r\n answer='both'\r\nprint(answer)\r\n", "s, a, b=input(), input(), input()\r\ns1=s[::-1]\r\nif a in s and a in s1:\r\n if b in s[s.index(a)+len(a)::] and b in s1[s1.index(a)+len(a)::]: print('both')\r\n elif b not in s[s.index(a)+len(a)::] and b in s1[s1.index(a)+len(a)::]: print('backward')\r\n elif b in s[s.index(a)+len(a)::] and b not in s1[s1.index(a)+len(a)::]: print('forward')\r\n else: print('fantasy')\r\nelif a not in s and a in s1:\r\n if b not in s1[s1.index(a)+len(a)::]: print('fantasy')\r\n else: print('backward')\r\nelif a not in s1 and a in s:\r\n if b not in s[s.index(a)+len(a)::]: print('fantasy')\r\n else: print('forward')\r\nelse: print('fantasy')\r\n", "def check(flags: str, first: str, second: str) -> bool:\r\n if first not in flags or second not in flags:\r\n return False\r\n f_f_index = flags.index(first)\r\n s_l_index = flags.rindex(second)\r\n return f_f_index + len(first) - 1 < s_l_index\r\n\r\n\r\nflags, first, second = input(), input(), input()\r\nf = check(flags, first, second)\r\nflags = flags[::-1]\r\nb = check(flags, first, second)\r\nif f and b:\r\n print('both')\r\nelif f:\r\n print('forward')\r\nelif b:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n\r\n'''\r\n 0123456\r\nflags=\"aaacaaa\"\r\nfirst=\"aca\"\r\nsecond=\"aa\"\r\n'''\r\n", "actual = input()\nmemorized1 = input()\nmemorized2 = input()\n\nindex1 = actual.find(memorized1)\nindex2 = actual.find(memorized2, index1 + len(memorized1))\nindex3 = actual[::-1].find(memorized1)\nindex4 = actual[::-1].find(memorized2, index3 + len(memorized1))\n\n# print(index1, index2, index3, index4)\n\nmaybe_ans = \"\"\nif (index1 == -1 or index2 == -1) and (index3 == -1 or index4 == -1):\n maybe_ans = \"fantasy\"\nelif index1 < index2 and index3 < index4:\n maybe_ans = \"both\"\nelif index1 < index2:\n maybe_ans = \"forward\"\nelif index3 < index4:\n maybe_ans = \"backward\"\nelse:\n maybe_ans = \"fantasy\"\n\nprint(maybe_ans)", "def f(s, a, b):\n if ~(p := s.find(a)):\n if ~s.find(b, p+len(a)):\n return True\n return False\n\n\ns = input()\na = input()\nb = input()\nprint(['fantasy', 'backward', 'forward', 'both']\n [f(s, a, b)*2+f(s[::-1], a, b)])\n", "s = input().strip()\r\ns1 = input().strip()\r\ns2 = input().strip()\r\np = ''\r\nif s1 in s:\r\n i = s.find(s1)\r\n if s2 in s[i + len(s1):]:\r\n p += 'forward'\r\ns_rev = s[-1::-1]\r\nif s1 in s_rev:\r\n i = s_rev.find(s1)\r\n if s2 in s_rev[i + len(s1):]:\r\n p += 'backward'\r\nif p == '':\r\n print('fantasy')\r\nelif p == 'forward':\r\n print('forward')\r\nelif p == 'backward':\r\n print('backward')\r\nelse:\r\n print('both')", "t = input()\r\ns1 = input()\r\ns2 = input()\r\nt_1 = t[::-1]\r\ns_1,s_2 = 0,0\r\nif s1 in t:\r\n\tif s2 in t[t.index(s1)+len(s1):]:\r\n\t\ts_1 += 1\r\nif s1 in t_1:\r\n\tif s2 in t_1[t_1.index(s1)+len(s1):]:\r\n\t\ts_2 += 1\r\nif s_2 == 1 and s_1 == 1:\r\n\tprint('both')\r\nelif s_1 == 1:\r\n\tprint('forward')\r\nelif s_2 == 1:\r\n\tprint('backward')\r\nelse:\r\n\tprint('fantasy')", "flags = input()\r\nsleep1 = input()\r\nsleep2 = input()\r\nforward1 = None\r\nforward2 = None\r\nreverse1 = None\r\nreverse2 = None\r\n# check if the first sequence of flags is in parents' list \r\ntry:\r\n forward1 = flags.index(sleep1)\r\nexcept ValueError:\r\n pass\r\nif type(forward1) == int:\r\n try:\r\n #check the second sequence\r\n forward2 = flags[forward1 + len(sleep1):].index(sleep2)\r\n # f2 exists in the parents' list\r\n forward2 = True\r\n except ValueError:\r\n pass\r\n \r\n# inverse the parents' list\r\nflags = flags[::-1]\r\n#check for backward sequences\r\ntry:\r\n reverse1 = flags.index(sleep1)\r\nexcept ValueError:\r\n pass\r\n \r\nif type(reverse1) == int:\r\n try:\r\n reverse2 = flags[reverse1 + len(sleep1):].index(sleep2)\r\n reverse2 = True\r\n except ValueError:\r\n pass\r\n\r\nif forward2 and reverse2:\r\n print('both')\r\nelif forward2:\r\n print('forward')\r\nelif reverse2:\r\n print('backward')\r\nelse:\r\n print('fantasy')", "def main():\r\n flags = input().replace(\" \",\"\") #Guarda las banderas del camino A al B\r\n fir = input().replace(\" \",\"\") #Primera visión\r\n sec = input().replace(\" \",\"\") #Segunda visión\r\n \r\n fin = ini = 0\r\n \r\n if flags.find(fir) != -1 and flags.find(sec, flags.find(fir)+len(fir)) != -1: ini = 1\r\n \r\n flags = flags[::-1] #Le damos la vuelta al str. Pasamos el último al primero y el primero al último\r\n \r\n if flags.find(fir) != -1 and flags.find(sec, flags.find(fir)+len(fir)) != -1: fin = 2\r\n \r\n print('fantasy,forward,backward,both'.split(',')[ini + fin])\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "s,a,b=input(),input(),input()\r\nans=0;s1=s[::-1]\r\nif s.find(a)!=-1:\r\n k=s.find(a)\r\n if s.find(b,k+len(a))!=-1:\r\n ans+=1\r\n\r\nif s1.find(a)!=-1:\r\n k=s1.find(a)\r\n if s1.find(b,k+len(a))!=-1:\r\n ans+=2\r\n\r\nif ans==0:print('fantasy')\r\nelif ans==1:print('forward')\r\nelif ans==2:print('backward')\r\nelse:print('both')\r\n", "def f(a, b, c):\r\n i, j = a.find(b), a.rfind(c)\r\n return i != -1 and j != -1 and i + len(b) <= j\r\na, b, c = input(), input(), input()\r\nprint(('fantasy', 'backward', 'forward', 'both')[2 * f(a, b, c) + f(a[::-1], b, c)])", "#8A - Train and Peter\r\n#1st line input: flags colors\r\nflags = input()\r\n#2nd line: flags Peter has seen during his 1st wakefullness period\r\nsleep1 = input()\r\n#3rd line: flags Peter has seen during his 2nd wakefullness period\r\nsleep2 = input()\r\n#We initialize:\r\n# f1 - first awakeness period's flags sequence - forward\r\nf1 = None\r\n# f1 - first awakeness period's flags sequence - forward\r\nf2 = None\r\n# r1 - first awakeness period's flags sequence - reversed\r\nr1 = None\r\n# f1 - second awakeness period's flags sequence - reversed\r\nr2 = None\r\n#First, let's check whether the first sequence of flags Peter wrote\r\n#is also in his parents' list: \r\ntry:\r\n f1 = flags.index(sleep1)\r\nexcept ValueError:\r\n pass\r\n#If it exists: \r\nif type(f1) == int:\r\n try:\r\n #We check for the second sequence Peter wrote \r\n #starts from the last flag in sleep1 (exclusively)\r\n f2 = flags[f1 + len(sleep1):].index(sleep2)\r\n #If the previous line was successfully executed, we say f2 exists\r\n #in the parents' list\r\n f2 = True\r\n except ValueError:\r\n pass\r\n \r\n#Now, we inverse the parents' list, to check for backward sequences: \r\nflags = flags[::-1]\r\n#We repeat the checking procedure above, this time for bacward sequences\r\n#of \"sleep1\" and \"sleep2\" \r\ntry:\r\n r1 = flags.index(sleep1)\r\nexcept ValueError:\r\n pass\r\n \r\nif type(r1) == int:\r\n try:\r\n r2 = flags[r1 + len(sleep1):].index(sleep2)\r\n r2 = True\r\n except ValueError:\r\n pass\r\n#Now, we judge:\r\n#If both f2 and r2 were found (were set to be true when looking for the indexes):\r\nif f2 and r2:\r\n print('both')\r\n#If only f2 was found:\r\nelif f2:\r\n print('forward')\r\n#If only r2 was found:\r\nelif r2:\r\n print('backward')\r\n#If none of the sequences were found:\r\nelse:\r\n print('fantasy')", "a=input()\r\nb =input()\r\nc=input()\r\nd=a[::-1]\r\nlenb=len(b)\r\nlenc=len(c)\r\nbf=cf=bb=cb=1000000\r\ncouf=coub=0\r\nfor i in range(len(a)):\r\n if b==a[i:i+lenb]:\r\n bf=min(i+lenb-1,bf)\r\n if c==a[i:i+lenc]:\r\n cf=i\r\n# print(a[i:i+lenb],a[i:i+lenc],bf,cf) \r\n if bf<cf and bf!=1000000 and cf!=1000000:\r\n couf=1\r\n break\r\nfor i in range(len(a)):\r\n if b==d[i:i+lenb]:\r\n bb=min(i+lenb-1,bb)\r\n if c==d[i:i+lenc]:\r\n cb=i\r\n# print(d[i:i+lenb],d[i:i+lenc],bb,cb) \r\n if bb<cb and bb!=1000000 and cb!=1000000:\r\n coub=1\r\n break\r\nif coub+couf==2:\r\n print(\"both\")\r\nelif couf==1:\r\n print(\"forward\")\r\nelif coub==1:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")\r\n \r\n \r\n ", "# maa chudaaye duniya\r\ns, a, b = input(), input(), input()\r\nforward , backward = False, False\r\nif s.find(a) != -1 and s.find(b, s.find(a) + len(a)) != -1:\r\n\tforward = True\r\ns = s[::-1]\r\nif s.find(a) != -1 and s.find(b, s.find(a) + len(a)) != -1:\r\n\tbackward = True\r\n\r\nif forward and backward:\r\n\tprint('both')\r\nelif forward:\r\n\tprint('forward')\r\nelif backward:\r\n\tprint('backward')\r\nelse:\r\n\tprint('fantasy')", "### A. Train and Peter\r\ns=input()\r\na=input()\r\nb=input()\r\nx=y=0\r\nif a in s:\r\n if b in s[s.find(a)+len(a):]:\r\n x=1\r\ns=s[::-1]\r\nif a in s:\r\n if b in s[s.find(a)+len(a):]:\r\n y=1\r\nif x==1 and y==1:\r\n print('both')\r\nelif x==1:\r\n print('forward')\r\nelif y==1:\r\n print('backward')\r\nelse:\r\n print('fantasy')", "import sys\r\n\r\n\r\ndef str_in_sequence(sequence, str1, str2):\r\n start1 = sequence.find(str1)\r\n if start1 == -1:\r\n return False\r\n start2 = sequence.find(str2, start1 + len(str1))\r\n if start2 == -1:\r\n return False\r\n return True\r\n\r\n\r\ndef main(sinp=sys.stdin, sout=sys.stdout):\r\n flags, vision1, vision2 = sinp.read().split()\r\n forward = str_in_sequence(flags, vision1, vision2)\r\n backward = str_in_sequence(flags[::-1], vision1, vision2)\r\n\r\n if forward:\r\n if backward:\r\n result = 'both'\r\n else:\r\n result = 'forward'\r\n else:\r\n if backward:\r\n result = 'backward'\r\n else:\r\n result = 'fantasy'\r\n\r\n sout.write(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = input()\nseq1 = input()\nseq2 = input()\n\nfrente = False\ntras = False\n\nif seq1 in s:\n a = s[s.find(seq1)+len(seq1):]\n if (seq2 in a):\n frente = True\ns1 = s[::-1]\n\n# reversed\nif seq1 in s1:\n a = s1[s1.find(seq1)+len(seq1):]\n if (seq2 in a):\n tras = True\n\nif frente and tras:\n print(\"both\")\nelif frente:\n print(\"forward\")\nelif tras:\n print(\"backward\")\nelse:\n print(\"fantasy\")\n\n \t\t\t\t\t \t \t\t \t\t\t \t \t\t\t\t \t\t", "all_flags = input()\r\nP_flags1 = input()\r\nP_flags2 = input()\r\n# ищем последовательности флагов при движении из А в Б\r\npos1 = all_flags.find(P_flags1)\r\npos2 = all_flags.find(P_flags2, pos1 + len(P_flags1))\r\nif (pos1 != -1) and (pos2 != -1):\r\n res = 'forward'\r\nelse:\r\n res = 'fantasy'\r\n# ищем последовательности флагов при движении из Б в А\r\nall_flags = all_flags[::-1]\r\npos1 = all_flags.find(P_flags1)\r\npos2 = all_flags.find(P_flags2, pos1 + len(P_flags1))\r\nif (pos1 != -1) and (pos2 != -1):\r\n if res == 'fantasy':\r\n res = 'backward'\r\n else:\r\n res = 'both'\r\nprint(res)", "def reverse(s):\r\n ret = \"\"\r\n for x in range(len(s) - 1, -1, -1):\r\n ret += s[x]\r\n return ret\r\n\r\nflags = input()\r\ns1 = input()\r\ns2 = input()\r\nflags = [flags, reverse(flags)]\r\npossible = [False, False]\r\nfor y in range(2):\r\n if flags[y].find(s1) == -1:\r\n continue\r\n flag = flags[y][flags[y].find(s1) + len(s1):]\r\n if flag.find(s2) != -1:\r\n possible[y] = True\r\nif possible[0] and not possible[1]:\r\n print(\"forward\")\r\nif not possible[0] and possible[1]:\r\n print(\"backward\")\r\nif not possible[0] and not possible[1]:\r\n print(\"fantasy\")\r\nif possible[0] and possible[1]:\r\n print(\"both\")", "# forward/backward/both/fantasy\r\nflags = input()\r\nsleep1 = input()\r\nsleep2 = input()\r\n\r\nf1 = None\r\nf2 = None\r\nr1 = None\r\nr2 = None\r\n\r\ntry:\r\n f1 = flags.index(sleep1)\r\nexcept ValueError:\r\n pass\r\n\r\nif type(f1) == int:\r\n try:\r\n f2 = flags[f1 + len(sleep1):].index(sleep2)\r\n f2 = True\r\n except ValueError:\r\n pass\r\n\r\n\r\nflags = flags[::-1]\r\n\r\ntry:\r\n r1 = flags.index(sleep1)\r\nexcept ValueError:\r\n pass\r\n\r\nif type(r1) == int:\r\n try:\r\n r2 = flags[r1 + len(sleep1):].index(sleep2)\r\n r2 = True\r\n except ValueError:\r\n pass\r\n\r\nif f2 and r2:\r\n print('both')\r\nelif f2:\r\n print('forward')\r\nelif r2:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n\r\n\r\n\r\n\r\n\r\n", "s=input()\r\ns1=input()\r\ns2=input()\r\nans=0;a=['fantasy','forward','backward','both']\r\nk1=s.find(s1)\r\nif k1!=-1:\r\n k2=s.find(s2,k1+len(s1))\r\n if k2!=-1:ans+=1\r\ns=s[::-1]\r\nk1=s.find(s1)\r\nif k1!=-1:\r\n k2=s.find(s2,k1+len(s1))\r\n if k2!=-1:ans+=2\r\nprint(a[ans])", "#!/usr/bin/env python\n# -*- coding: utf-8 -*-\nresults = [\"fantasy\", \"backward\", \"forward\", \"both\"]\n\n\ndef utils(a, b, c):\n i, j = a.find(b), a.rfind(c)\n return i != -1 and j != -1 and i + len(b) <= j\n\n\ndef oj1():\n a, b, c = input(), input(), input()\n return results[2 * utils(a, b, c) + utils(a[::-1], b, c)]\n\n\nif __name__ == '__main__':\n print(oj1())\n", "All=[input()for i in range(0,3)];f=0;b=0;x=1;y=1\r\nif All[1] not in All[0]or All[2]not in All[0]:\r\n x=0\r\nif All[0].find(All[1])<All[0].find(All[2],All[0].find(All[1])+len(All[1])):\r\n f=1\r\nAll[0]=All[0][::-1]\r\nif All[1] not in All[0]or All[2]not in All[0]:\r\n y=0\r\nif All[0].find(All[1])<All[0].find(All[2],All[0].find(All[1])+len(All[1])):\r\n b=1\r\nif x*f==1 and b==0:\r\n print('forward')\r\nif f==0 and y*b==1:\r\n print('backward')\r\nif x*f+y*b==2:\r\n print('both')\r\nif x*f+y*b==0:\r\n print('fantasy')", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 25 09:28:06 2021\r\n\r\n@author: Usuario\r\n\"\"\"\r\ntexto = input()\r\ncadena1 = input()\r\ncadena2 = input()\r\n\r\nforward = False\r\nbackward = False\r\nrpta = 'fantasy'\r\n\r\nindice_c1 = None\r\nindice_c2 = None\r\n\r\nindice_c1 = texto.find(cadena1) \r\nif indice_c1 != -1:\r\n indice_c2 = texto.find(cadena2, indice_c1+len(cadena1))\r\n if indice_c2 != -1:\r\n forward = True\r\n\r\nindice_c1 = texto[::-1].find(cadena1) \r\nif indice_c1 != -1:\r\n indice_c2 = texto[::-1].find(cadena2, indice_c1+len(cadena1))\r\n if indice_c2 != -1:\r\n backward = True\r\n\r\nif forward and backward:\r\n rpta = 'both'\r\nelif forward:\r\n rpta = 'forward'\r\nelif backward:\r\n rpta = 'backward'\r\n \r\nprint(rpta)", "string = input()\r\nfirst = input()\r\nsecond = input()\r\n\r\na=bool(first in string)\r\nb=bool(second in string)\r\nc=bool(first in string[::-1])\r\nd=bool(second in string[::-1])\r\n\r\n#print([a, b, c, d])\r\n#print(string.index(first))\r\n#print(len(first))\r\n#print(string.rindex(second))\r\n#print(string.replace(first,first.upper()).rindex(second))\r\n\r\nfwd = (a==True and b==True and string.index(first)+len(first)<=string.rindex(second))\r\nback = (c==True and d==True and string[::-1].index(first)+len(first)<=string[::-1].rindex(second))\r\nboth = (fwd and back)\r\n\r\n#print([fwd, back, both])\r\n\r\nif both == True:\r\n print(\"both\")\r\nelif fwd == True:\r\n print(\"forward\")\r\nelif back == True:\r\n print(\"backward\")\r\nelse: print(\"fantasy\")", "t1=input()\r\ns1=input()\r\ns2=input()\r\nt2=t1[::-1]\r\na,b=0,0\r\nif s1 in t1:\r\n\tif s2 in t1[t1.index(s1)+len(s1):]:\r\n\t\ta+=1\r\nif s1 in t2:\r\n\tif s2 in t2[t2.index(s1)+len(s1):]:\r\n\t\tb+=1\r\nif a==1 and b==1:\r\n\tprint('both')\r\nelif a==1:\r\n\tprint('forward')\r\nelif b==1:\r\n\tprint('backward')\r\nelse:\r\n\tprint('fantasy')", "flags = input()\nflags_reverse = flags[::-1]\n\nfirst = input()\nsecond = input()\n\nforward = False\nbackward = False\n\nfirst_i = None\nfor i in range(len(flags) - len(first) + 1):\n if flags[i:i+len(first)] == first:\n first_i = i\n break\n\nsecond_i = None\nfor i in range(len(flags) - len(second) + 1):\n if flags[i:i+len(second)] == second:\n second_i = i\n\nif first_i is not None and second_i is not None and first_i + len(first) - 1 < second_i:\n forward = True\n\nfirst_i = None\nfor i in range(len(flags_reverse) - len(first) + 1):\n if flags_reverse[i:i+len(first)] == first:\n first_i = i\n break\n\nsecond_i = None\nfor i in range(len(flags_reverse) - len(second) + 1):\n if flags_reverse[i:i+len(second)] == second:\n second_i = i\n\nif first_i is not None and second_i is not None and first_i + len(first) - 1 < second_i:\n backward = True\n\nif forward and backward:\n print(\"both\")\nelif forward and not backward:\n print(\"forward\")\nelif not forward and backward:\n print(\"backward\")\nelif not forward and not backward:\n print(\"fantasy\")\n", "def findfirst(s, t):return s.find(t)\r\ndef findlast(s, t):\r\n v=(s[::-1]).find(t[::-1])\r\n if v ==-1:return -1\r\n else:return len(s)-v-len(t)\r\nmatcht=input()\r\nx=input()\r\ny=input()\r\ncanForward=False\r\na=findfirst(matcht,x)\r\nb=findlast(matcht,y)\r\nif a!=-1 and b!=-1 and a+len(x)<=b:canForward=True\r\nc=findfirst(matcht[::-1],x)\r\nd=findlast(matcht[::-1],y)\r\ncanBackward=False\r\nif c!=-1 and d!=-1 and c+len(x)<=d:canBackward = True\r\nif canForward and canBackward:print(\"both\")\r\nelif canForward:print(\"forward\")\r\nelif canBackward:print('backward')\r\nelse:print(\"fantasy\")", "flags = input()\r\nfirst = input()\r\nsecond = input()\r\nforward = backward = 0\r\n\r\nif first in flags:\r\n start = flags.index(first)\r\n end = flags[start+len(first):]\r\n if second in end:\r\n forward = 1\r\n\r\nreverse = flags[::-1]\r\n\r\nif first in reverse:\r\n start = reverse.index(first)\r\n end = reverse[start+len(first):]\r\n if second in end:\r\n backward = 1\r\n\r\nif forward == 1 and backward == 1: print (\"both\")\r\nelif forward == 1 and backward == 0: print (\"forward\")\r\nelif forward == 0 and backward == 1: print (\"backward\")\r\nelif forward == 0 and backward == 0: print (\"fantasy\")", "import string\r\n\r\ndef main():\r\n\tflags = input()\r\n\ts1 = input()\r\n\ts2 = input()\r\n\t# flags = \"aaabbaa\"\r\n\t# s1 = \"aab\"\r\n\t# s2 = \"aaa\"\r\n\trevFlags = flags[::-1]\r\n\tfoundF = canSee(flags, s1, s2)\r\n\tfoundRevF = canSee(revFlags, s1, s2)\r\n\tif foundF == True:\r\n\t\tif foundRevF == True:\r\n\t\t\tprint(\"both\")\r\n\t\telse:\r\n\t\t\tprint(\"forward\")\r\n\telse:\r\n\t\tif foundRevF == True:\r\n\t\t\tprint(\"backward\")\r\n\t\telse:\r\n\t\t\tprint(\"fantasy\")\r\n\r\n\r\ndef canSee(flags, s1, s2):\r\n\tfoundS1 = flags.find(s1)\r\n\tif foundS1 != -1:\r\n\t\trem = flags[foundS1+len(s1):]\r\n\t\tif rem.find(s2) != -1:\r\n\t\t\treturn True\r\n\treturn False\r\n\r\nmain()\r\n#print(canSee(\"abacabb\", \"aca\", \"aa\"))", "#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/\r\ns=input()\r\na=input()\r\nb=input()\r\nr=a+'.*'+b\r\nimport re\r\nprint(['fantasy','forward','backward','both'][(re.search(r,s)!=None)+2*(re.search(r,s[::-1])!=None)])\r\n#****************************************\r\n\r\n#** Solution by BAZOOKA **\r\n\r\n#** Sponsored by RED BULL**\r\n\r\n#** Team Galaxy **\r\n\r\n#** I love ❤Kateryna Gret❤ **\r\n\r\n#****************************************/ ", "\r\n# our function definition here\r\ndef check(flags, first, second):\r\n if (first not in flags) or (second not in flags):\r\n return False\r\n Findex, SecLastIndex = flags.index(first), flags.rindex(second)\r\n return Findex + len(first) - 1 < SecLastIndex\r\n# end of our function\r\n\r\nflags, first, second = input(), input(), input()\r\nf = check(flags, first, second)\r\nflags = flags[::-1]\r\nb = check(flags, first, second)\r\n\r\nif f and b:\r\n print(\"both\")\r\nelif f:\r\n print(\"forward\")\r\nelif b:\r\n print(\"backward\")\r\nelse:\r\n print(\"fantasy\")\r\n", "s=input()\r\ns1=s[::-1]\r\na=input()\r\nb=input()\r\nc,d,e=0,0,0 \r\nif a in s:\r\n if b in s[s.index(a)+len(a):]:\r\n c+=1\r\nif a in s1:\r\n if b in s1[s1.index(a)+len(a):]:\r\n d+=1\r\nif c==1 and d==1:\r\n print('both')\r\nelif c==1:\r\n print('forward')\r\nelif d==1:\r\n print('backward')\r\nelse:\r\n print('fantasy')", "def findfirst(s, t):\r\n return s.find(t)\r\n\r\ndef findlast(s, t):\r\n v = (s[::-1]).find(t[::-1])\r\n if v == -1:\r\n return -1\r\n else:\r\n return len(s) - v - len(t)\r\n\r\nmatcht = input()\r\nx = input()\r\ny = input()\r\n\r\ncanForward = False\r\n\r\na = findfirst(matcht, x)\r\nb = findlast(matcht, y)\r\n\r\nif a != -1 and b != -1 and a + len(x) <= b:\r\n canForward = True\r\n\r\nc = findfirst(matcht[::-1], x)\r\nd = findlast(matcht[::-1], y)\r\n\r\ncanBackward = False\r\n\r\nif c != -1 and d != -1 and c + len(x) <= d:\r\n canBackward = True\r\n\r\nif canForward and canBackward:\r\n print(\"both\")\r\nelif canForward:\r\n print(\"forward\")\r\nelif canBackward:\r\n print('backward')\r\nelse:\r\n print(\"fantasy\")", "t = input()\nturn = t[::-1]\ns1 = input()\ns2 = input()\nF1 = t.find(s1)\nans = 0\nif F1 != -1:\n F2 = t.find(s2, F1 + len(s1))\n if F2 != -1:\n ans += 1\nB1 = turn.find(s1)\nif B1 != -1:\n B2 = turn.find(s2, B1 + len(s1))\n if B2 != -1:\n ans += 2\nL = ['fantasy', 'forward', 'backward', 'both']\nprint(L[ans])", "def backward_or_forward(string_fun, first_flags_fun, last_flags_fun):\r\n if first_flags_fun in string_fun:\r\n indexOfFirsChar = string_fun.index(first_flags_fun)\r\n indexOfLastChar = indexOfFirsChar + len(first_flags_fun) - 1\r\n if last_flags_fun in string_fun[indexOfLastChar + 1:]:\r\n return True\r\n return False\r\n\r\n\r\nstring = input()\r\nfirst_flags = input()\r\nlast_flags = input()\r\nforward = backward_or_forward(string, first_flags, last_flags)\r\nbackward = backward_or_forward(string[::-1], first_flags, last_flags)\r\n\r\nif forward and backward:\r\n print('both')\r\nelif forward:\r\n print('forward')\r\nelif backward:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "s, a, b = input(), input(), input()\r\nfo, ba = 0, 0\r\nif s.find(a) != -1 and s.find(b, s.find(a)+len(a)) != -1: fo = 1\r\ns = s[::-1]\r\nif s.find(a) != -1 and s.find(b, s.find(a)+len(a)) != -1: ba = 2\r\nprint('fantasy,forward,backward,both'.split(',')[fo + ba])", "s = input()\r\na = input()\r\nb = input()\r\nx = y = 0\r\n\r\nif a in s:\r\n if b in s[s.index(a) + len(a):]:\r\n x = 1\r\ns = s[::-1]\r\nif a in s:\r\n if b in s[s.index(a) + len(a):]:\r\n y = 1\r\n \r\nif x == 1 and y == 1:\r\n print('both')\r\nelif x == 1:\r\n print('forward')\r\nelif y == 1:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "s = str(input())\r\nt = s[::-1]\r\np = str(input())\r\nq = str(input())\r\na = s.find(p)\r\nb = s.find(q, a + len(p))\r\nc = t.find(p)\r\nd = t.find(q, c + len(p))\r\nif a != -1 and b != -1 and c != -1 and d != -1:\r\n print('both')\r\nelif a != -1 and b != -1:\r\n print('forward')\r\nelif c != -1 and d != -1:\r\n print('backward')\r\nelse:\r\n print('fantasy')\r\n", "s,a,b,ans=input(),input(),input(),0\ne = s[::-1]\n\nif a in s:\n p = s.index(a) + len(a)\n if b in s[p:]: ans += 1\nif a in e:\n p = e.index(a) + len(a)\n if b in e[p:]: ans += 2\n\nprint([\"fantasy\", \"forward\", \"backward\", \"both\"][ans])\n\t\t \t\t\t\t\t \t \t\t\t \t \t \t \t" ]

[ "s, t = -10 ** 8, 10 ** 8\r\nn = int(input())\r\nfor i in range(n):\r\n c, d = map(int, input().split())\r\n if d == 1:\r\n s = max(s, 1900)\r\n if d == 2:\r\n t = min(t, 1899)\r\n if s > t:\r\n print('Impossible')\r\n exit()\r\n s = s + c\r\n t = t + c\r\nif (t > 4*10**7):print('Infinity')\r\nelse: print(t)# 1690591017.8006713", "inf = 10 ** 20\r\nmi = -inf\r\nmx = inf\r\ns = 0\r\nfor _ in range(int(input())):\r\n c, d = map(int, input().split())\r\n\r\n if d == 1:\r\n mi = max(mi, 1900 - s)\r\n else:\r\n mx = min(mx, 1899 - s)\r\n\r\n if mi > mx:\r\n print('Impossible')\r\n exit()\r\n\r\n s += c\r\n\r\nif mx >= inf // 2:\r\n print('Infinity')\r\n exit()\r\n\r\nprint(mx + s)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\nfrom heapq import *\r\n\r\nINF = float('inf')\r\nl,r=-INF,INF\r\nfor _ in range(int(input())):\r\n c,d = map(int, input().split())\r\n if d==1:\r\n l = max(l,1900)\r\n else:\r\n r = min(r,1899)\r\n \r\n if l>r:\r\n exit(print('Impossible'))\r\n #print(l,r)\r\n l+=c;r+=c\r\n\r\nif r==INF:\r\n print('Infinity')\r\nelse:\r\n print(r)", "import sys\r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline\r\ndef read_int():\r\n return int(input())\r\ndef read_num():\r\n return map(int, input().split(\" \"))\r\ndef read_list():\r\n return list(map(int, input().split(\" \")))\r\nn = read_int()\r\ninf = float(\"inf\")\r\ncur_range = [-inf,inf]\r\ns = 0\r\n\"\"\"\r\n-7 1 x + 0 >= 1900 x >= 1900 [1900, inf] -7\r\n5 2 x - 7 <= 1899 x <= 1906 [1900, 1906] -2\r\n8 2 x - 2 <= 1899 x <= 1901 [1900, 1901] 6\r\n\"\"\"\r\n\"\"\"\r\n57 1 x + 0 >= 1900 x >= 1900 [1900, inf] 57\r\n22 2 x + 57 <= 1899 x <= 1842 矛盾\r\n\"\"\"\r\n\"\"\"\r\n-5 1 x + 0 >= 1900 x >= 1900 [1900, inf] -5\r\n\"\"\"\r\n\"\"\"\r\n27 2 x + 0 <= 1899 x <= 1900 [-inf, 1899] 27\r\n13 1 x + 27 >= 1900 x >= 1873 [1873, 1899] 40\r\n-50 1 x + 40 >= 1900 x >= 1860 [1873, 1899] -10\r\n8 2 x - 10 <= 1899 x <= 1909 [1873, 1899] -2\r\n\"\"\"\r\n# 维护区间，并记录 s 最大值\r\nok = False\r\nfor i in range(1, n + 1):\r\n c, d = read_num()\r\n if d == 1:\r\n x = -s + 1900\r\n if x > cur_range[1]:\r\n ok = True\r\n break\r\n cur_range[0] = max(cur_range[0], x)\r\n else:\r\n x = -s + 1899\r\n if x < cur_range[0]:\r\n ok = True\r\n break\r\n cur_range[1] = min(cur_range[1], x)\r\n s += c\r\nif ok:\r\n print(\"Impossible\")\r\nelse:\r\n ans = cur_range[1] + s\r\n print(ans if ans < inf else \"Infinity\")\r\n", "import math\r\nn = int(input())\r\nminR, maxR = -math.inf, math.inf\r\nsum = 0\r\nfor i in range(n):\r\n c, d = map(int, input().split())\r\n if d == 1:\r\n minR = max(minR, 1900 - sum)\r\n else:\r\n maxR = min(maxR, 1899 - sum)\r\n sum += c\r\n\r\nif minR > maxR:\r\n print(\"Impossible\")\r\nelif maxR == math.inf:\r\n print(\"Infinity\")\r\nelse:\r\n print(maxR + sum)\r\n", "from bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom functools import lru_cache, reduce\r\nfrom math import factorial, sqrt, gcd, log2\r\nfrom math import lcm, comb\r\n# from sortedcontainers import SortedList\r\nfrom copy import deepcopy\r\nimport heapq\r\nimport random\r\nfrom types import GeneratorType\r\n\r\n\r\nfrom sys import stdin, stdout\r\n\r\n\r\ninput = stdin.readline\r\nrd = random.randint(10**9, 10**10)\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n left = -10 ** 9\r\n right = 10 ** 9\r\n for _ in range(n):\r\n score, rate = map(int, input().split())\r\n if rate == 1:\r\n left = max(1900, left)\r\n left += score\r\n right += score\r\n else:\r\n right = min(right, 1899)\r\n left += score\r\n right += score\r\n if left > right:\r\n print(\"Impossible\")\r\n elif right > 10**8:\r\n print(\"Infinity\")\r\n else:\r\n print(right)\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\n\r\n# sys.stdin = open('./../input.txt', 'r')\r\nI = lambda: int(input())\r\nMI = lambda: map(int, input().split())\r\nLI = lambda: list(map(int, input().split()))\r\n\r\nn = I()\r\ncd = [LI() for _ in range(n)]\r\n\r\nLevel = 1900\r\nmi, mx = -10 ** 9, 10 ** 9\r\ns = 0\r\nfor i in range(n):\r\n ci, di = cd[i]\r\n\r\n if di == 1:\r\n mi = max(mi, Level)\r\n else:\r\n mx = min(mx, Level - 1)\r\n s += ci\r\n mi += ci\r\n mx += ci\r\n\r\nif mi > mx:\r\n print('Impossible')\r\nelif mx > 10 ** 8:\r\n print('Infinity')\r\nelse:\r\n print(mx)\r\n", "import sys \n\n# sys.stdin = open(\"input\",\"r\") \n\nfrom collections import *\nfrom heapq import * \nfrom functools import *\nfrom types import GeneratorType\n# from math import *\nfrom itertools import *\nfrom math import *\nfrom string import ascii_lowercase\n\ndef bootstrap(f, stack=[]):\n def wrappedfunc(*args, **kwargs):\n if stack:\n return f(*args, **kwargs)\n else:\n to = f(*args, **kwargs)\n while True:\n if type(to) is GeneratorType:\n stack.append(to)\n to = next(to)\n else:\n stack.pop()\n if not stack:\n break\n to = stack[-1].send(to)\n return to\n\n return wrappedfunc\n\nMOD = 10**9+7\ndef solve():\n n = int(input())\n arr = []\n lo, hi = -inf, inf \n for _ in range(n):\n arr.append(list(map(int,input().split())))\n for c, d in arr:\n if d == 1:\n lo = max(lo,1900)\n else:\n hi = min(hi,1899)\n lo += c \n hi += c \n if lo > hi: \n print(\"Impossible\")\n return\n if hi == inf:\n print(\"Infinity\")\n return\n print(hi)\n return \n\n\n# t = int(input())\nt = 1\nfor _ in range(t):\n solve()\n", "import sys\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, defaultdict, deque\r\nfrom heapq import heapify, heappop, heappush\r\nfrom itertools import accumulate, groupby\r\nfrom math import ceil, comb, floor, gcd, inf, lcm, log2, prod, sqrt\r\nfrom string import ascii_lowercase\r\n\r\nMOD = 10**9 + 7\r\n\r\n\r\n# 2023-10-25 10:11:16\r\ndef main():\r\n n = int(input())\r\n l = -inf\r\n r = inf\r\n for _ in range(n):\r\n c, d = read_ints()\r\n if d == 1 and r < 1900 or d == 2 and l >= 1900:\r\n print(\"Impossible\")\r\n return\r\n\r\n if d == 1:\r\n l = max(l, 1900)\r\n\r\n if d == 2:\r\n r = min(r, 1900 - 1)\r\n\r\n if l > r:\r\n print(\"Impossible\")\r\n l += c\r\n r += c\r\n if l > r:\r\n print(\"Impossible\")\r\n elif r == inf:\r\n print(\"Infinity\")\r\n else:\r\n print(r)\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef read_ints():\r\n return map(int, input().split())\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # t = int(input())\r\n t = 1\r\n for _ in range(t):\r\n main()\r\n", "import sys\r\nimport math\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# endregion fastio\r\n\r\n# MOD = 998_244_353\r\n# MOD = 10 ** 9 + 7\r\n# DIR4 = ((-1, 0), (0, 1), (1, 0), (0, -1)) #URDL\r\n# DIR8 = ((-1, 0), (-1, 1), (0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1))\r\n\r\ndef solve() -> None:\r\n n = sint()\r\n l, r = -math.inf, math.inf\r\n s = 0\r\n for _ in range(n):\r\n c, d = mint()\r\n if d == 1:\r\n l = max(l, 1900 - s)\r\n else:\r\n r = min(r, 1899 - s)\r\n \r\n s += c\r\n \r\n if l > r:\r\n print(\"Impossible\")\r\n elif r == math.inf:\r\n print(\"Infinity\")\r\n else:\r\n print(r + s)\r\n\r\nsolve()" ]

[ "n = int(input())\r\ns = input()\r\narr = list(map(int, input().split()))\r\nans = []\r\nfor i in range(n):\r\n if(i == n-1):\r\n break\r\n if((s[i] == \"R\" and s[i+1] == \"L\")):\r\n ans.append(arr[i+1]-arr[i])\r\nfor i in range(len(ans)):\r\n ans[i] = int(ans[i]/2)\r\nif not ans:\r\n print(-1)\r\nelse:\r\n print(min(ans))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\n\r\nans = 1e10\r\nfor i in range(n-1):\r\n if s[i] == 'R' and s[i+1] == 'L':\r\n ans = min(ans, (a[i+1] - a[i])//2)\r\n\r\nif ans != 1e10:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n", "\r\nnum = int(input())\r\ndirections = input()\r\npositions = list(map(int, input().split(' ')))\r\ncount = positions[-1]\r\nstop = True\r\nfor ind in range(num-1):\r\n if(directions[ind]!=directions[ind+1]):\r\n x = (positions[ind]-positions[ind+1])\r\n if ( directions[ind]=='R'):\r\n x *=-1\r\n if(x>0 and x<=count):\r\n stop = False\r\n count =x\r\nif(stop):\r\n print(-1)\r\nelse:\r\n print(count//2)", "n = int(input())\r\ns = input()\r\nx = [int(x) for x in input().split()]\r\na = [0 for x in range(n)]\r\na[-1]=-1\r\nfor i in range(len(a)-2,-1,-1):\r\n if s[i+1]=='L':\r\n a[i]=i+1\r\n else:\r\n a[i]=a[i+1]\r\nmini = float('inf')\r\nflag = False\r\nfor i in range(len(x)):\r\n if s[i]=='R' and a[i]!=-1:\r\n mini = min(mini, x[a[i]]-x[i])\r\n flag = True\r\nif not flag:\r\n print(-1)\r\nelse:\r\n print(mini//2)", "n = int(input())\ns = input()\nx = list(map(int, input().split()))\nminimum = 10000000000\nif s.count('RL') == 0:\n print(-1)\nelse:\n for i in range(n - 1):\n if s[i] == 'R' and s[i + 1] == 'L' and x[i + 1] - x[i] < minimum:\n minimum = x[i + 1] - x[i]\n print(minimum // 2)\n", "n=int(input())\r\ns=input()\r\na=list(map(int, input().split()))\r\nans=2**40\r\nfor i in range(1, n):\r\n if s[i-1]=='R' and s[i]=='L':\r\n ans=min(ans, a[i]-a[i-1])\r\nprint(-1 if ans==2**40 else ans>>1)", "n=eval(input())\na=input()\nb=list(map(eval,input().split()))\nd=[]\nfor i in range(n-1):\n if a[i]=='R' and a[i+1]=='L':\n d.append(b[i+1]-b[i])\nif len(d)!=0:\n print(int(min(d)/2))\nelse:\n print(-1)\n\n\t \t \t\t\t\t \t \t\t\t\t \t \t\t \t\t", "# https://codeforces.com/contest/699/problem/A\r\nn = int(input())\r\n\r\nparticles = input()\r\n\r\npositions = map(int, input().split())\r\n\r\ntemp = None\r\nans = float('inf')\r\nfor p, x in zip(particles, positions):\r\n if temp is None:\r\n if p == \"R\":\r\n temp = x\r\n else:\r\n if p == \"R\":\r\n temp = x\r\n if p == \"L\":\r\n if abs(temp - x) < ans:\r\n ans = abs(temp - x)\r\nif ans == float('inf'):\r\n print(-1)\r\nelse:\r\n print(ans//2)\r\n", "n = int(input())\r\nlsDirection = list(input())\r\nlsPosition = list(map(int,input().split()))\r\nshortest = float(\"inf\")\r\nflag = False\r\ncurrent=lsPosition[0]\r\nfor i in range(n):\r\n if lsDirection[i] == 'R':\r\n flag = True\r\n current = lsPosition[i]\r\n elif lsDirection[i] =='L' and flag:\r\n shortest = min(((abs(int(current)-lsPosition[i]))/2), shortest)\r\n\r\nif shortest == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(int(shortest))\r\n", "\r\nn = int(input())\r\nd = input()\r\nif 'RL' not in d:\r\n print (-1)\r\nelse:\r\n l = list(map(int,input().split()))\r\n r = min((l[x+1] - l[x]) // 2 for x in range(n-1) if d[x:x+2] =='RL')\r\n print (r)", "n=int(input())\r\ns=input()\r\na=[*map(int,input().split())]\r\nk=10**9\r\nfor i in range(n-1):\r\n if s[i]==\"R\"and s[i+1]==\"L\":\r\n k=min(k,(a[i+1]-a[i])//2)\r\nprint(k if k!=10**9 else -1)", "n, answer = int(input()), 1000000000\r\ndirections, vals = [x for x in input()], [int(x) for x in input().split()]\r\nfor v in range(n-1):\r\n if directions[v] == 'R' and directions[v+1] == 'L':\r\n answer = min(answer, (vals[v+1] - vals[v]) // 2)\r\nprint(int('-1') if answer==1000000000 else answer)", "\ndef solve():\n n = int(input())\n directions = input()\n positions = list(map(int, input().split()))\n \n actual_idx = 0\n min_time = 10**9+1\n ans = -1\n while actual_idx < n-1:\n if (directions[actual_idx] == 'R' and directions[actual_idx+1] == 'L'):\n act_time = (positions[actual_idx+1] - positions[actual_idx])//2\n if (act_time < min_time):\n min_time = act_time\n ans = act_time\n actual_idx+=1\n print (ans)\n\ndef main():\n solve()\n\nmain()\n \t\t \t \t\t\t\t \t \t\t\t \t\t\t\t", "n = int(input())\r\ns = input()\r\nx = [int(y) for y in input().split()]\r\nt = float('inf')\r\npos = s.find('RL')\r\nif pos==-1:\r\n print(-1)\r\nelse:\r\n while pos!=-1:\r\n t = min(t, (x[pos+1]-x[pos])/2)\r\n pos = s.find('RL', pos+1)\r\n print(int(t))\r\n", "n, s, a = int(input()) - 1, input(), list(map(int, input().split()))\r\nb = []\r\nfor i in range(n):\r\n if s[i] == 'R' and s[i + 1] == 'L':\r\n b.append((a[i + 1] - a[i]) // 2)\r\nprint(-1 if len(b) == 0 else min(b))\r\n", "n = int(input())\nd = input()\nx = list(map(int, input().split()))\n\nmi = 2**50\n\nfor i in range(1, n):\n if d[i-1] == 'R' and d[i] == 'L':\n mi = min(mi, (x[i] - x[i-1]) // 2)\n\nif mi == 2**50:\n print(-1)\nelse:\n print(mi)\n", "n = int(input())\r\n\r\ndirections = [x for x in input()]\r\npoints = [int(x) for x in input().split()]\r\n\r\nm = 9999999999999\r\nflag = False\r\nfor x in range(len(directions)-1):\r\n\t\r\n\tif directions[x] == \"R\" and directions[x+1] == \"L\":\r\n\t\t a =((points[x]+points[x+1]) /2) - points[x]\r\n\t\t flag = True\r\n\t\t if(a<m):\r\n\t\t \tm=a\r\nif flag:\r\n\tprint(int(m))\r\nelse:\t \r\n\tprint(-1)", "n=int(input())\r\ns=list(input()) #s=symbols \r\nc=list(map(int,input().split())) #c=coordinates \r\nx=0;\r\nfor i in range(n-1):\r\n if (s[i]=='R' and s[i+1]=='L'):\r\n v=int((c[i+1]-c[i])/2)\r\n if(x==0):\r\n x=v\r\n elif(x>v):\r\n x=v\r\nif (x==0):\r\n print(-1)\r\nelse: \r\n print(x)", "n = input()\r\nn = int(n)\r\ns = input()\r\nnum = input()\r\nnum = list((num.split(' ')))\r\nif n is 1:\r\n print(-1)\r\n exit() \r\nans = 0x3f3f3f3f\r\nfor i in range(n-1):\r\n if s[i] is 'R' and s[i+1] is 'L':\r\n\t ans = min((int(num[i+1])-int(num[i]))//2,ans)\r\n\r\nif ans is 0x3f3f3f3f:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "# Name : Sachdev Hitesh\r\n# College : GLSICA\r\n\r\nrg = int(input())\r\nuser = input()\r\na = list(map(int,input().split()))\r\nans = [];flag=False\r\nfor i in range(rg-1):\r\n\tif user[i]=='R' and user[i+1]=='L':\r\n\t\tb = a[i+1]-a[i]\r\n\t\tans.append(b)\r\n\t\tflag = True\r\nif flag:\r\n\tprint(int(min(ans)/2))\r\nelse:\r\n\tprint(-1)\r\n\r\n\r\n\r\n", "from math import inf\r\ndef solve():\r\n n = int(input())\r\n movs = input()\r\n nums = [int(i) for i in input().split()]\r\n min_time = inf\r\n for i in range(len(movs)-1):\r\n if movs[i] == 'R' and movs[i+1] == 'L': \r\n current_time = (nums[i+1] - nums[i])//2\r\n if current_time < min_time: min_time = current_time\r\n if min_time < inf: return min_time \r\n return -1\r\nprint(solve())", "n = int(input())\r\nmoves = input()\r\nparticles = list(map(int,input().split()))\r\nMin = -1;\r\nfor i in range(len(moves)-1):\r\n if moves[i] == 'R' and moves[i+1] == 'L' and particles[i] < particles[i+1] :\r\n res = (particles[i+1] - particles[i])//2\r\n if Min == -1 :\r\n Min = res\r\n else:\r\n Min = min(Min,res)\r\n\r\nprint(Min)", "n = int(input())\ns = input()\nx = list(map(int, input().split()))\na = []\nif s.count('RL') == 0:\n print(-1)\nelse:\n for i in range(n - 1):\n if s[i] == 'R' and s[i + 1] == 'L':\n a.append(x[i + 1] - x[i])\n print(min(a) // 2)\n", "n=int(input())\r\ns=input()\r\na=list(map(int,input().split(' ')))\r\nbest=float('inf')\r\nfor i in range(1, n):\r\n if s[i]=='L' and s[i-1]=='R':\r\n best = min(best, (a[i]-a[i-1])//2)\r\nif best == float('inf'):\r\n best = -1\r\nprint(best)\r\n ", "n =int(input())\ns =input()\nlst = list(map(int,input().split()))\nmn = 1000000000\nfor i in range(n-1):\n if s[i]=='R' and s[i+1]== 'L':\n mn =min(mn,(lst[i+1]-lst[i])//2)\nif mn == 1000000000:\n print(-1)\nelse:\n print(mn)\n\t\t\t \t \t \t \t\t\t \t\t\t\t\t \t\t", "n = int(input())\r\ns = input()\r\nl = list(map(int,input().split()))\r\nflag = False\r\nll = list()\r\nfor i in range(n-1):\r\n if s[i] == \"R\" and s[i+1] == \"L\":\r\n ll.append((l[i+1]-l[i])//2)\r\n flag = True\r\n\r\n \r\nif flag: print(min(ll))\r\nelse: print(-1)", "z=[]\r\nn=int(input())\r\ns=input()\r\ny=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n z.append(y[i+1]-y[i])\r\nif len(z)==0:\r\n print(-1)\r\nelse:\r\n print(int(min(z)/2))", "n = int(input())\r\ns = list(input())\r\nx = input().split()\r\nmin = -1\r\nfor i in range(n):\r\n x[i] = int(x[i])\r\nfor i in range(n-1):\r\n if(s[i]=='R' and s[i+1] == 'L'):\r\n m = int((x[i+1]-x[i])/2)\r\n if(min == -1 or m<min):\r\n min=m\r\nprint(min)", "n = int(input())\r\ndirections = input()\r\nmin_time = 100000000000\r\nind = 0\r\nprevious_R = None\r\nfor el in input().split():\r\n\tel = int(el)\r\n\t#print\r\n\tif directions[ind] == 'L' and previous_R != None:\r\n\t\tmin_time = min(abs(el - previous_R) // 2, min_time)\r\n\telif directions[ind] == 'R':\r\n\t\tprevious_R = el\r\n\tind += 1\r\nif min_time == 100000000000:\r\n\tprint(-1)\r\nelse:\r\n\tprint(min_time)", "n = int(input())\r\ns = input()\r\nx = input().split()\r\n\r\nmn = 2000000000\r\n\r\nfor i in range(len(x)):\r\n\tif i > 0 and s[i]=='L' and s[i-1]=='R':\r\n\t\tmn = min(mn, (int(x[i])-int(x[i-1]))/2)\r\n\r\nif mn == 2000000000:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(int(mn))", "n=int(input())\r\ndirection = input()\r\ncord = list(map(int,input().split()))\r\nmini=float('inf')\r\n\r\nfor i in range(n-1):\r\n if direction[i]=='R' and direction[i+1]=='L':\r\n mini = min(mini,(cord[i+1]-cord[i])//2)\r\n \r\nif mini==float('inf'):\r\n print(-1)\r\nelse:\r\n print(mini)\r\n", "n=int(input())\r\nt=input()\r\nx=[int(q) for q in input().split()]\r\nr=[]\r\nfor i in range(n-1):\r\n if t[i]==\"R\" and t[i+1]==\"L\":\r\n r.append((abs(x[i+1]-x[i]))//2)\r\nif len(r)==0:\r\n print(-1)\r\nelse:\r\n print(min(r))", "import re\r\nn=int(input())\r\ns=input()\r\nx=list(map(int, input().split()))\r\nif s.find(\"RL\")==-1:\r\n print(-1)\r\nelse:\r\n t=\"RL\"\r\n p = [_.start() for _ in re.finditer(t, s)] \r\n #print(p)\r\n q=[]\r\n for i in range(len(p)):\r\n q.append(x[p[i]+1] - x[p[i]])\r\n m=min(q)\r\n print(m//2)", "import sys\r\n\r\nn=int(input())\r\ntemp=input()\r\nlist1=[int(x) for x in input().split()]\r\nleftRight=list(temp)\r\n\r\nminValue=sys.maxsize\r\n\r\nfor i in range(len(leftRight)-1):\r\n if leftRight[i]=='R' and leftRight[i+1]=='L':\r\n meter=list1[i]+list1[i+1]\r\n meter//=2\r\n if meter-list1[i]<minValue:\r\n minValue=meter-list1[i]\r\n\r\nif minValue==sys.maxsize:\r\n print(-1)\r\nelse:\r\n print(minValue)\r\n", "n,rl,pa=int(input()),input(),list(map(int,input().split()))\r\nm=10**15\r\nif \"RL\" not in rl:\r\n print(-1)\r\nelse:\r\n for j,i in enumerate(rl[:-1]):\r\n if i ==\"R\" and rl[j+1]==\"L\":\r\n m=min(m,pa[j+1]-pa[j])\r\n print(m//2)", "n = int(input())\r\ns = input()\r\narr = list(map(int, input().split()))\r\nx = -1\r\nfor i in range(n - 1):\r\n if s[i] == \"R\" and s[i + 1] == \"L\":\r\n c = (arr[i + 1] - arr[i]) // 2\r\n if c < x or x == -1:\r\n x = c\r\nprint(x)", "n,s=int(input()),input()\r\nl,nl=[int(ele) for ele in input().split()],[]\r\nfor i in range(len(s)):\r\n try:\r\n if s[i]=='R' and s[i+1]=='L':\r\n app=(l[i+1]-l[i])/2\r\n nl.append(int(app))\r\n except:continue\r\nif len(nl)==0:print(-1)\r\nelse:print(min(nl))", "N=int(input())\r\na=input()\r\nb=input()\r\nb=b.split()\r\n\r\nx=0-1\r\nfor i in range(N-1):\r\n\tif a[i]=='R' and a[i+1]=='L':\r\n\t\tm=(int(b[i+1])-int(b[i]))//2\r\n\t\tif x == -1:\r\n\t\t\tx=m\r\n\t\telse:\r\n\t\t\tx = min(x, m)\r\nprint(x)\r\n", "def algoritmo():\r\n n = int(input())\r\n dir = input()\r\n pos = list(map(int, input().split(\" \")))\r\n\r\n c = 1000000000\r\n count = 0\r\n\r\n for i in range(n-1):\r\n if dir[i]==\"R\" and dir[i+1]==\"L\":\r\n x = (pos[i+1]-pos[i])//2\r\n count+=1\r\n if x<c:\r\n c=x\r\n else:\r\n pass\r\n else:\r\n pass\r\n if count>=1:\r\n print(c)\r\n else:\r\n print(-1)\r\n\r\nalgoritmo()", "n = int(input())\r\nstr = input()\r\ncollider = input().split(' ')\r\nmin = -1\r\nfor i in range(n-1):\r\n y = int(collider[i])\r\n z = int(collider[i + 1])\r\n if((str[i] == \"R\") and (str[i+1] == \"L\")):\r\n if(min > -1):\r\n if((z-y)/2 < min):\r\n min = (z-y)/2\r\n if(min == -1):\r\n min = (z-y)/2\r\nprint(int(min))", "n = int(input())\r\nmoves = input()\r\npos = list(map(int, input().split()))\r\nj=0\r\ntime = []\r\nfor i in range(n-1):\r\n if moves[i] is 'R' and moves[i+1] is 'L':\r\n time.append(int((-pos[i]+pos[i+1])/2))\r\n j=j+1\r\nif j is 0:\r\n time.append(-1)\r\nprint(min(time[:]))", "import sys\r\nn = int(input())\r\ns = input()\r\nk = list(map( int, input().split()))\r\nif n == 1:\r\n print(-1)\r\n sys.exit()\r\nans = []\r\nfor i in range(n - 1):\r\n if s[i] == 'R' and s[i + 1] == 'L':\r\n f = (k[i + 1] - k[i]) // 2\r\n ans.append(f)\r\nif ans:\r\n print(min(ans))\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nmovement = input()\r\nposition = input()\r\nposition = position.split(' ')\r\narr = []\r\ncounter= 0\r\nfor i in range(len(movement) -1) :\r\n if movement[i] == \"R\" and movement[i+1] == \"L\" :\r\n n = abs(int(position[i]) - int(position[i+1])) / 2\r\n arr.append(n)\r\n counter = counter +1\r\n\r\nif counter > 0 :\r\n arr.sort()\r\n print(int(arr[0]))\r\nelse :\r\n print(-1)\r\n", "k=['RL','LR']\r\nn=int(input())\r\ns=input()\r\nl=list(map(int, input().split()))\r\nminn=10**10; p=0\r\nfor i in range(n-1):\r\n if s[i:i+2]=='RL':\r\n minn=min(minn,(l[i+1]-l[i])//2)\r\nprint(-1 if minn==10**10 else minn)", "n = int(input())\r\ndirs = input()\r\np = [int(i) for i in input().split()]\r\n\r\nr = -1\r\nl = -1\r\ndiff = 10000000000000000000\r\ncol = False\r\nfor i in range(n - 1):\r\n if dirs[i] + dirs[i + 1] == \"RL\":\r\n if ((p[i + 1] - p[i]) // 2) < diff:\r\n diff = (p[i + 1] - p[i]) // 2\r\n col = True\r\n\r\n\r\nif not col :\r\n print(-1)\r\nelse:\r\n print(diff) ", "import math,sys,bisect,heapq\r\nfrom collections import defaultdict,Counter,deque\r\nfrom itertools import groupby,accumulate\r\n#sys.setrecursionlimit(200000000)\r\ninput = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n \r\nN = int(input())\r\nS = input()\r\nA = alele()\r\nAns = 1e18\r\nfor i in range(N-1):\r\n x =S[i] + S[i+1]\r\n if x == \"RL\":\r\n a = math.ceil((A[i+1] - A[i])/2)\r\n Ans= min(Ans,a)\r\nif Ans == 1e18:\r\n print(-1)\r\nelse:\r\n print(Ans)\r\n ", "n = int(input())\r\ndirction = input()\r\nlocations = list(map(int, input().split()))\r\nmicro =float('inf')\r\nind=0\r\nif \"RL\" in dirction:\r\n for i in range(dirction.count(\"RL\")):\r\n if (locations[dirction.index(\"RL\",ind)+1]-locations[dirction.index(\"RL\",ind)])/2 < micro:\r\n micro=int((locations[dirction.index(\"RL\",ind)+1]-locations[dirction.index(\"RL\",ind)])/2)\r\n ind=dirction.index(\"RL\", ind) + 1\r\n print(micro)\r\nelse : print(-1)", "n = int(input())\r\nstring = input()\r\nL = list(map(int, input().split()))\r\nminimum = -1\r\nfor i in range(len(string)-1):\r\n if string[i] == 'R' and string[i+1] == 'L':\r\n if minimum > (L[i+1] - L[i])//2 or minimum == -1:\r\n minimum = (L[i+1] - L[i])//2\r\nprint(minimum)", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n = I() \r\n dir = input() \r\n nums = IL() \r\n\r\n \r\n min_diff = float(\"inf\")\r\n for i in range(1,n):\r\n a , b = nums[i-1], nums[i]\r\n al , bl = dir[i-1], dir[i]\r\n if al == \"R\" and bl == \"L\":\r\n min_diff = min(min_diff,max(a,b)-min(a,b))\r\n \r\n \r\n return min_diff//2 if min_diff != float(\"inf\") else -1\r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\nprint(solve())\r\n", "a=int(input())\r\ndirect=input()\r\nl=list(map(int,input().split()))\r\nt=-1\r\nfor i in range(a-1):\r\n if direct[i]=='R' and direct[i+1]=='L':\r\n t=min(t,l[i+1]-l[i]) if t!=-1 else l[i+1]-l[i]\r\nprint(t//2)", "import math\r\n\r\n\r\ndef solve(directions, coordinates):\r\n result = math.inf\r\n for i in range(1, len(directions)):\r\n if directions[i-1:i+1] == \"RL\":\r\n result = min(result, (coordinates[i] - coordinates[i - 1]) // 2)\r\n return result if result < math.inf else -1\r\n\r\n\r\ndef main():\r\n _ = input()\r\n directions = input()\r\n coordinates = [int(s) for s in input().split()]\r\n print(solve(directions, coordinates))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\ndirection = str(input())\r\ncoord = list(map(int, input().split()))\r\n\r\nres = 10**9 + 1\r\nfor x in range(len(direction) - 1):\r\n if (direction[x] == 'R') and (direction[x+1] == 'L'):\r\n if (coord[x+1] - coord[x]) < res:\r\n res = coord[x+1] - coord[x]\r\n\r\nif res == 10**9 + 1:\r\n print('-1')\r\nelse:\r\n print(res//2)", "n = int(input())\nstr = input()\nx = [int(v) for v in input().split()]\n\nv = float(\"inf\")\ni = 0\nwhile i < len(str) - 1:\n i += 1\n if str[i - 1] == \"R\" and str[i] == \"R\":\n pass\n elif str[i - 1] == \"R\" and str[i] == \"L\": # <---\n v = min(v, (x[i] - x[i - 1]) // 2)\n elif str[i - 1] == \"L\" and str[i] == \"R\":\n pass\n elif str[i - 1] == \"L\" and str[i] == \"L\":\n i += 1\n\nif v == float(\"inf\"):\n print(-1)\nelse:\n print(v, flush=True)", "n = int(input())\r\ns = input()\r\nc = 0\r\nlc=[]\r\nl = [int(x) for x in input().split()]\r\nfor i in range(n-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n lc.append((l[i+1]-l[i])/2)\r\nif len(lc):\r\n print(int(min(lc)))\r\n exit()\r\nprint(-1)", "n = int(input())\r\ns = input()\r\n\r\nl = list(map(int, input().split()))\r\nx=[]\r\n\r\nfor i in range(n-1):\r\n if (s[i] == 'R' and s[i+1] == 'L'):\r\n x.append((l[i+1] - l[i])//2)\r\n\r\nif(len(x) == 0):\r\n print(-1)\r\nelse:\r\n print(min(x))", "\"\"\"\r\n author - Sayan Bose\r\n date - 29.01.2020\r\n Brooklyn 99 is love!\r\n\"\"\"\r\n\r\nn = int(input())\r\ns = input()\r\nli = list(map(int, input().split()))\r\nres = []\r\nfor i in range(n):\r\n if s[i] == 'R':\r\n try:\r\n if s[i+1] == 'L':\r\n res.append((li[i+1]-li[i])//2)\r\n except IndexError:\r\n continue\r\nprint(min(res)) if res else print(-1)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Jul 26 16:45:31 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 77 - CF699-DIV2A\r\n\"\"\"\r\n\r\nsz = int(input())\r\ndirs = list(str(input()))\r\ncoords = list(map(int,input().split()))\r\n\r\npC = coords[0]\r\npD = dirs[0]\r\nans = 1e9\r\nfor i in range(1,sz):\r\n cC = coords[i]\r\n cD = dirs[i]\r\n if cD == \"L\" and pD == \"R\":\r\n ans = min(ans, (cC-pC)//2)\r\n pC,pD = cC,cD\r\nif ans == 1e9:\r\n print(-1)\r\nelse:\r\n print(ans)", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nans = float('inf')\r\ntest = 0\r\nfor i in range(1, n):\r\n if s[i-1]=='R' and s[i]=='L':\r\n test = 1\r\n ans = min(ans, (a[i]-a[i-1])//2)\r\nif test:\r\n print(ans)\r\nelse:\r\n print(-1)\r\n ", "n = int(input())\r\nds = input()\r\nxs = list(map(int, input().split()))\r\ncs = [i for i in range(len(ds) - 1) if ds[i:i+2] == \"RL\"]\r\nif len(cs) == 0:\r\n print(-1)\r\n exit()\r\nprint(min((xs[c+1] - xs[c]) // 2 for c in cs))\r\n\r\n", "n=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\n#print(a)\r\nans=-1\r\nfor i in range(1,n):\r\n if s[i-1]=='R' and s[i]=='L':\r\n ans=(min(ans,(a[i]-a[i-1])//2) if ans>=0 else (a[i]-a[i-1])//2)\r\nprint(ans)", "n = int(input())\r\ns = input()\r\nx = list(map(int, input().split()))\r\nans = float('inf')\r\nlast = None\r\nfor i in range(n):\r\n if s[i] == 'R':\r\n last = x[i]\r\n elif last != None:\r\n cur = (x[i] - last) // 2\r\n ans = min(ans, cur)\r\nif ans == float('inf'):\r\n ans = -1\r\nprint(ans)\r\n", "n = int(input())\r\nx = list(input())\r\nm = [int(item) for item in input().split()]\r\ntemp = []\r\nfor i in range(n - 1):\r\n if x[i] == 'R' and x[i + 1] == 'L':\r\n temp.append(m[i + 1] - m[i])\r\ntemp.sort()\r\nif len(temp) == 0:\r\n print(-1)\r\n exit(0)\r\nprint(int(temp[0] / 2))\r\n", "n = int(input())\r\ns = input()\r\n\r\narr = list(map(int, input().split()))\r\n\r\nmn = float('inf')\r\n\r\nfor i in range(n-1):\r\n if s[i] == 'R' and s[i+1] == 'L':\r\n mn = min(mn, arr[i+1] - arr[i])\r\n\r\n if mn == 2:\r\n break\r\n\r\nif mn == float('inf'):\r\n print(-1)\r\nelse:\r\n print(mn // 2)", "n = int(input())\r\nc = list(input())\r\np = list(map(int,input().split()))\r\nf = [\"R\",\"L\"]\r\n\r\nans=[]\r\nfor i in range(n-1):\r\n\r\n if [c[i],c[i+1]] == f:\r\n ans.append(p[i+1]-p[i])\r\nif len(ans)==0:\r\n print(-1)\r\nelse:\r\n print(min(ans)//2)\r\n\r\n\r\n", "n = int(input()) \r\nd = input()\r\nx = [int(x) for x in input().split()] \r\nl = [] \r\nfor i in range(len(d)-1):\r\n if d[i] == 'R' and d[i+1] == 'L': \r\n c = (x[i+1] - x[i])//2 \r\n l.append(c)\r\n\r\nif l == []: \r\n print(-1)\r\nelse:\r\n print(min(l))", "_ = input()\ndirs = input()\nparticles = input().split() \nmini = 100000000000\nsol = False\nfor i in range(len(dirs)-1):\n if dirs[i] == 'R' and dirs[i+1] =='L':\n sol = True\n if (int(particles[i+1]) - int(particles[i])) //2 < mini :\n mini = (int(particles[i+1]) - int(particles[i])) //2\nif sol :\n print(mini)\nelse :\n print(-1)\n", " #BISMILLAH\n # ITS NOT OVER WHEN YOU FAIL\n # ITS OVER WHEN YOU QUIT\nflag = False\nmini = 1000000000+7\nn = int(input())\ns = input()\nl = list(map(int, input().strip().split()))\nfor i in range(0, n-1):\n\tif s[i] == \"R\" and s[i+1]==\"L\":\n\t\tflag = True\n\t\tmini = min(mini,int((l[i]+l[i+1])/2)-l[i])\nif flag == False:\n\tprint(-1)\nelse:\n\tprint(mini)\n\t\n\t", "n=int(input())\r\ns=input()\r\nv=[int(i) for i in input().split()]\r\ni=0\r\nj=0\r\nf=0\r\nmt=1000000001\r\nwhile(i<n):\r\n\r\n\twhile(i<n and s[i]!='R'):\r\n\t\ti=i+1\r\n\twhile(i<n and s[i]=='R'):\r\n\t\ti=i+1\r\n\ti=i-1\r\n\r\n\tj=i+1\r\n\tif(j>=n):\r\n\t\tbreak\r\n\r\n\twhile(j<n and s[j]!='L'):\r\n\t\tj=j+1\r\n\tif(s[j]=='L'):\r\n\t\tf=1\r\n\t\tt=(v[j]+v[i])/2-v[i]\r\n\r\n\t\tif(t<mt):\r\n\t\t\tmt=t\r\n\telse:\r\n\t\tbreak\r\n\r\n\tif(j+1<n):\r\n\t\ti=j+1\r\n\telse:\r\n\t\tbreak\r\nif(f==0):\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(int(mt))", "n = int(input())\r\ns = input()\r\nl = list(map(int, input().split()))\r\nres = 10**9 + 1\r\nif n < 2:\r\n print(-1)\r\n exit(0)\r\nfor i in range(n-1):\r\n if (s[i] == \"R\" and s[i+1] == \"L\") and (l[i+1] - l[i])//2 < res:\r\n res = (l[i+1] - l[i])//2\r\nif res == 10**9 +1:\r\n print(-1)\r\nelse: \r\n print(res)\r\n ", "n=int(input())\r\ns=input().rstrip()\r\na=list(map(int,input().rstrip().split()))\r\nmaxi=float('inf')\r\nfor i in range(n-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n maxi=min(maxi,(a[i+1]-a[i])//2)\r\nif maxi==float('inf'):\r\n print(-1)\r\nelse:\r\n print(maxi)\r\n", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nt = 10 ** 10\r\nfor i in range(n - 1):\r\n if s[i:i+2] == 'RL':\r\n t = min(t, (a[i + 1] - a[i]) // 2)\r\nif t == 10 ** 10:\r\n print(-1)\r\nelse:\r\n print(t)", "def getFirst(l, r, leftArr, target):\r\n ans = float(\"inf\")\r\n while l <= r:\r\n mid = (l + r) // 2\r\n if leftArr[mid] <= target:\r\n l = mid + 1\r\n else:\r\n r = mid - 1\r\n ans = leftArr[mid]\r\n return (ans - target) // 2\r\n\r\n\r\nn = int(input())\r\ninp = input()\r\narr = list(map(int, input().split()))\r\nr = []\r\nl = []\r\nfor i in range(n):\r\n if inp[i] == \"R\": r.append(arr[i])\r\n else: l.append(arr[i])\r\n\r\nmini = float(\"inf\")\r\nf = False\r\nfor i in r:\r\n first_greater_than = getFirst(0, len(l)-1, l, i)\r\n if first_greater_than < mini:\r\n mini = first_greater_than\r\n f = True\r\nif f:\r\n print(mini)\r\nelse:\r\n print(-1)\r\n", "import math\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n s = input()\r\n l = list(map(int,input().split()))\r\n mn = math.inf\r\n for i in range(len(l)-1):\r\n if s[i] == 'R' and s[i+1] == 'L':\r\n mn = min((l[i+1]-l[i])//2,mn)\r\n print(mn if mn != math.inf else -1)\r\n", "n=int(input())\r\nl1=list(input())\r\nl2=list(map(int,input().split()))\r\nans=[];k=0\r\nfor i in range(n-1):\r\n if l1[i]==\"R\" and l1[i+1]==\"L\":\r\n k=1\r\n break\r\nif k==0:\r\n print(-1)\r\nelse:\r\n for i in range(n-1):\r\n if l1[i]==\"R\" and l1[i+1]==\"L\":\r\n ans.append((l2[i+1]-l2[i])//2)\r\n print(min(ans))\r\n", "n = int(input())\ns = input()\nli = list(map(int, input().split()))\nminn = 10000000000\nfor i in range(n-1):\n if s[i] == 'R' and s[i+1] == 'L':\n x = (li[i+1] - li[i])//2\n minn = min(minn, x)\nif minn == 10000000000:\n print(-1)\nelse:\n print(minn)\n\n \t\t \t \t \t\t \t \t \t \t\t\t \t", "n = int(input())\r\nletters = input()\r\nx = input().split()\r\nflag = False\r\narr = []\r\nfor i in range(n):\r\n if letters[i] == \"R\" and i != n-1 and letters[i+1] == \"L\" :\r\n arr.append(int(x[i+1])-int(x[i]))\r\nif arr:\r\n print(int((min(arr))/2))\r\nelse:\r\n print(-1)", "\r\nn = int(input())\r\ndrctn = list(input())\r\npos = list(map(int, input().split()))\r\n\r\ntime = set()\r\nfor i in range(n - 1):\r\n\tif drctn[i] == 'R' and drctn[i + 1] == 'L':\r\n\t\ttime.add((pos[i + 1] - pos[i]) // 2)\r\n\r\nif len(time) > 0:\r\n\tprint(min(time))\r\nelse:\r\n\tprint(-1)", "n = int(input().strip())\r\nl = input().strip()\r\nll = list(map(int,input().split()))\r\nll1 = []\r\nfor i in range(n-1):\r\n if l[i] == 'R' and l[i+1] == 'L':\r\n ll1.append(abs(ll[i] - ll[i+1]) // 2)\r\nprint(min(ll1) if len(ll1) != 0 else -1)", "def main():\n n_particles = int(input())\n movements = input()\n positions = [int(_) for _ in input().split()]\n happened = -1\n\n for i in range(n_particles - 1):\n if movements[i] == 'R' and movements[i + 1] == 'L':\n will_happen_in = (positions[i + 1] - positions[i]) // 2\n\n if happened == -1 or will_happen_in < happened:\n happened = will_happen_in\n\n print(happened)\n\n\nif __name__ == '__main__':\n main()\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\nn = int(input())\r\ndirs = input()\r\nvalues = [int(x) for x in input().split()]\r\n\r\nans = 1e9\r\nfor i in range(len(dirs)-1):\r\n if dirs[i] == \"R\" and dirs[i+1] == \"L\":\r\n #collision will happen\r\n ans = min(ans,(values[i+1]-values[i])//2)\r\n \r\nif ans == 1e9:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n = int(input())\r\ns = input()\r\nl = [int(x) for x in input().split()]\r\n\r\nt = float('inf')\r\n\r\nfor i in range(1, n):\r\n if s[i-1] == 'R' and s[i] == 'L':\r\n x = (l[i]-l[i-1])//2\r\n t = min(x, t)\r\n\r\nif t == float('inf'):\r\n print(-1)\r\nelse:\r\n print(t)\r\n", "n= int(input())\r\nst = input()\r\na = [int(i) for i in input().split()]\r\n \r\nfor i in range(n-1):\r\n if(a[i]==a[i+1]):\r\n print(0)\r\n exit(0)\r\n \r\nans = 10**9\r\nfor i in range(n-1):\r\n if st[i]=='R' and st[i+1]=='L': ans = min(ans,(a[i+1]-a[i])//2)\r\n \r\nif ans!=10**9: print(ans)\r\nelse: print(-1)", "from collections import defaultdict\r\nimport math\r\n\r\ndef pug_func(movs: str, pos: list) -> int:\r\n\r\n # arr = list(map(int, s.split(\" \")))\r\n # rev_arr = arr[::-1]\r\n\r\n # s = set()\r\n # L = 0\r\n # for i in range(len(arr)):\r\n # if rev_arr[i] not in s:\r\n # s.add(rev_arr[i])\r\n # else:\r\n # break\r\n\r\n # L += 1\r\n\r\n # return len(arr) - L\r\n\r\n n = len(movs)\r\n min_impact = float('inf')\r\n\r\n for i in range(n-1):\r\n if movs[i] == 'R' and movs[i+1] == 'L':\r\n min_impact = min(min_impact, (pos[i+1] - pos[i]) // 2)\r\n \r\n if min_impact != float('inf'):\r\n return min_impact\r\n else:\r\n return -1\r\n\r\nt = int(input())\r\nmovs = input()\r\npos = list(map(int, input().split(\" \")))\r\n\r\nx = pug_func(movs, pos)\r\nprint(x)\r\n\r\n\r\n\r\n# t = int(input())\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)", "c=[]\r\nn=int(input())\r\nst=input()\r\nca=list(map(int,input().split()))\r\nfor i in range(n):\r\n if st[i]==st[-1] and ca[i]==ca[-1]:\r\n break\r\n if st[i]==\"R\" and st[i+1]==\"L\":\r\n c.append((ca[i+1]-ca[i])//2)\r\nif len(c)==0:\r\n print(-1)\r\nelse:\r\n print(min(c))", "from sys import stdin\r\nn=int(stdin.readline().rstrip())\r\ns=stdin.readline().rstrip()\r\nl=list(map(int,stdin.readline().split()))\r\nm=float('inf')\r\np=0\r\nfor i in range(n-1):\r\n if s[i]==\"R\" and s[i+1]==\"L\":\r\n ans=(l[i+1]-l[i])//2\r\n m=min(ans,m)\r\n p=1\r\nif p==0:\r\n print(-1)\r\nelse:\r\n print(m)", "n = int(input())\r\nmovement = list(input())\r\ncoord = list(map(int, input().split()))\r\nfirst_collision = float('inf')\r\nflag=False\r\nfor i in range(len(coord) - 1):\r\n if movement[i] == 'R' and movement[i+1] == 'L':\r\n flag = True\r\n first_collision = min(first_collision, (coord[i+1] - coord[i]) // 2)\r\nif flag:\r\n print(first_collision)\r\nelse:\r\n print(-1)", "n = int(input())\r\na = input()\r\narr = list(map(int, input().split()))\r\nx = []\r\nfor i in range(n-1):\r\n if a[i] == 'R' and a[i+1] == 'L':\r\n x.append((arr[i+1] - arr[i])//2)\r\nif x == []:\r\n print(-1)\r\nelse:\r\n print(min(x))", "n = int(input())\r\ndirec = input()\r\np = list(map(int,input().split()))\r\nif direc.find('RL') == -1:\r\n print(-1)\r\nelse:\r\n RL_ind = direc.find('RL')\r\n t = [(p[RL_ind+1] - p[RL_ind])//2]\r\n while True:\r\n RL_ind = direc.find('RL',RL_ind+1) \r\n if RL_ind == -1:\r\n break\r\n else:\r\n t.append((p[RL_ind+1] - p[RL_ind])//2)\r\n print(min(t))", "n=input()\nn=int(n)\nstr=input()\nlist=list(map(int,input().split()))\n\nmn=10000000000000\nfor i in range(n-1):\n if str[i]==\"R\" and str[i+1]==\"L\" :\n ans=list[i+1]-list[i]\n mn=min(mn,ans//2)\n\nif mn==10000000000000 :\n print(-1)\nelse:\n print(mn)\n\n \t \t\t \t \t\t\t \t \t \t\t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 27 23:49:08 2020\r\n\r\n@author: alexi\r\n\"\"\"\r\n\r\n\r\n#http://codeforces.com/problemset/problem/699/A -- Alexis Galvan\r\n\r\nimport math\r\n\r\ndef particles():\r\n total = int(input())\r\n particles = input()\r\n particles = [i for i in particles]\r\n position = list(map(int, input().split()))\r\n \r\n output = math.inf\r\n change = False\r\n \r\n for i in range(len(particles)):\r\n if particles[i] == 'R':\r\n if i+1 < len(particles):\r\n if particles[i+1] == 'L':\r\n temp = int((position[i+1]-position[i])/2)\r\n if temp < output:\r\n output = temp\r\n change = True\r\n \r\n if not change:\r\n return -1\r\n else:\r\n return output\r\n\r\n\r\nanswer = particles()\r\nprint(answer)\r\n \r\n \r\n ", "n=int(input())\r\ni=input()\r\narr=list(map(int,input().split()))\r\nif \"RL\" not in i:\r\n print(-1)\r\nelse:\r\n ris=999999999999999999999999999999\r\n for x in range(n-1):\r\n if i[x]==\"R\" and i[x+1]==\"L\":\r\n ris=min(ris,(arr[x+1]-arr[x])//2)\r\n print(ris)", "n=int(input())\r\ns=input()\r\nx=input()\r\nll=x.split(' ')\r\nl=[]\r\nfor i in ll:\r\n l.append(int(i))\r\nmn=1000000000\r\nfor i in range(n-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n mnn=abs(l[i+1]-l[i])//2\r\n if mnn<mn:\r\n mn = mnn\r\nif mn==1000000000:\r\n print(-1)\r\nelse:\r\n print(mn)", "import math\r\nn=int(input())\r\ns=input()\r\nlt=list(input().split())\r\nl=len(lt)-1\r\nmn=10**10\r\nfor i in range(l):\r\n if s[i]=='R' and s[i+1]=='L':\r\n a=int(lt[i+1])-int(lt[i])\r\n if a<mn:\r\n mn=a\r\nif mn==10**10:\r\n print(-1)\r\nelse:\r\n print(math.ceil(mn/2))\r\n", "N=int(input())\r\nS=list(input())\r\nC=list(map(int,input().split()))\r\n\r\nan = None\r\n\r\nlastR = None\r\nfor i,q in enumerate(S):\r\n if q == 'R':\r\n lastR = C[i]\r\n else:\r\n if lastR != None:\r\n if an == None:\r\n an = C[i] - lastR\r\n else:\r\n an = min(an, C[i] - lastR)\r\nif an != None:\r\n print(an//2)\r\nelse:\r\n print(-1)\r\n \r\n\r\n\r\n \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\ns = list(input().rstrip())\r\nx = list(map(int, input().split()))\r\ninf = pow(10, 9) + 1\r\nans = inf\r\nfor i in range(n - 1):\r\n if s[i] & 2 and not s[i + 1] & 2:\r\n ans = min(ans, (x[i + 1] - x[i]) // 2)\r\nans = (ans + 1) % (inf + 1) - 1\r\nprint(ans)", "n = int(input())\r\nmoves = list(input())\r\npos = [int(x) for x in input().split()]\r\nminTime = 1000000000\r\nfor i in range (n - 1):\r\n if moves[i] == 'R' and moves[i + 1] == 'L':\r\n time = int((pos[i + 1] - pos[i]) / 2)\r\n minTime = min(time, minTime)\r\nif minTime != 1000000000:\r\n print(minTime)\r\nelse:\r\n print(-1)", "n = int(input())\r\ndirections = input()\r\ncoordinates = list(map(int, input().split()))\r\n\r\nmin_time = float('inf')\r\n\r\nfor i in range(n - 1):\r\n if directions[i] == 'R' and directions[i + 1] == 'L':\r\n time = (coordinates[i + 1] - coordinates[i]) // 2\r\n min_time = min(min_time, time)\r\n\r\nif min_time == float('inf'):\r\n print(-1)\r\nelse:\r\n print(min_time)\r\n", "inp = int(input())\r\nst = input()\r\nls = list(map(int, input().split()))\r\npos = []\r\nfor q in range(inp-1):\r\n if st[q]=='R':\r\n if st[q+1]=='L':\r\n pos.append(q)\r\nif len(pos) == 0:\r\n print(-1)\r\nelse:\r\n _ = []\r\n for j in pos:\r\n dif = ls[j+1] - ls[j]\r\n _.append(dif/2)\r\n print(int(min(_)))", "def solve(s,v):\r\n ans=1000000000000000000\r\n n=len(v)\r\n v.sort()\r\n for i in range(n-1):\r\n if s[i]==\"R\" and s[i+1]==\"L\":\r\n ans=min(ans,v[i+1]-v[i])\r\n if ans!=1000000000000000000:\r\n return ans//2\r\n return -1\r\n\r\nn=input()\r\ns=input()\r\nv=list(map(int,input().split()))\r\nprint(solve(s,v))\r\n", "n=int(input())\ns=input()\na=[int(x) for x in input().split()]\nif 'RL' not in s:\n\tprint(-1)\n\texit(0)\nans=1000000001\nfor i in range(0,n-1):\n\tif s[i]=='R' and s[i+1]=='L':\n\t\tif (a[i+1]-a[i])//2<ans:\n\t\t\tans=(a[i+1]-a[i])//2\nprint(ans)", "n = int(input()) \r\ns = input()\r\nl = list(map(int ,input().split())) \r\nmn =None\r\nfor i in range(0 , n) : \r\n if s[i :i+2] == \"RL\": \r\n start = i \r\n endd = i + 1\r\n res = l[endd] - ((l[start] + l[endd]) // 2)\r\n if mn is None or mn > res : \r\n mn = res \r\nif mn is None :\r\n print(-1)\r\nelse : \r\n print(mn)", "n=int(input())\r\na=input()\r\nb=[int(i) for i in input().split()]\r\np=[]\r\nfor i in range(n-1):\r\n if a[i:i+2]=='RL':\r\n p.append(b[i+1]-b[i])\r\nif len(p)!=0:\r\n print(min(p)//2)\r\nelse:\r\n print(-1)\r\n", "\r\n\r\nn = int(input())\r\n\r\n\r\ndi = input()\r\n\r\n\r\npos = list(map(int,input().split()))\r\n\r\nmintime = 100000000000\r\n\r\nfor i in range(n-1):\r\n if di[i]==\"R\" and di[i+1]==\"L\":\r\n time = int((pos[i+1]-pos[i])/2)\r\n\r\n if time<mintime:\r\n mintime = time\r\n\r\n\r\n\r\nif mintime==100000000000:\r\n print(-1)\r\n\r\nelse:\r\n print(mintime)\r\n\r\n \r\n", "# https://codeforces.com/contest/699/problem/A\r\n#\r\n# Author: eloyhz\r\n# Date: Sep/03/2020\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n d = input()\r\n a = [int(x) for x in input().split()]\r\n min_t = 10 ** 10\r\n i = 0\r\n while i < n:\r\n i = d.find('R', i)\r\n if i == -1:\r\n break\r\n while i + 1 < n and d[i + 1] == 'R':\r\n i += 1\r\n if i == n:\r\n break\r\n j = d.find('L', i + 1)\r\n if j == -1:\r\n break\r\n min_t = min(min_t, a[j] - a[i])\r\n i = j + 1\r\n if min_t == 10 ** 10:\r\n print(-1)\r\n else:\r\n print(min_t // 2)\r\n", "\r\nn = int(input())\r\ndirections = input()\r\ncords = input().split()\r\n\r\ndistances = []\r\n\r\nfor i in range(n - 1):\r\n if directions[i : i + 2] == \"RL\":\r\n distance = int(cords[i + 1]) - int(cords[i])\r\n distances.append(distance)\r\n\r\ntry:\r\n print(min(distances) // 2)\r\nexcept:\r\n print(-1)", "hjCKMBTfcVYmswL = int\r\nhjCKMBTfcVYmswN = input\r\nhjCKMBTfcVYmswO = range\r\nhjCKMBTfcVYmswD = min\r\nhjCKMBTfcVYmswz = print\r\nn = hjCKMBTfcVYmswL(hjCKMBTfcVYmswN())\r\na = hjCKMBTfcVYmswN()\r\nb = [hjCKMBTfcVYmswL(_) for _ in hjCKMBTfcVYmswN().split()]\r\nx = -1\r\nfor i in hjCKMBTfcVYmswO(n - 1):\r\n if a[i] == 'R' and a[i + 1] == 'L':\r\n s = (b[i + 1] - b[i])//2\r\n if x == -1:\r\n x = s\r\n else:\r\n x = hjCKMBTfcVYmswD(x, s)\r\nhjCKMBTfcVYmswz(x)\r\n", "import math\r\nimport sys\r\n#!pip install numpy\r\n\r\n#import numpy as np \r\nv=int(input())\r\ne=input()\r\ne1=input().split()\r\nsmall=-2\r\nfor i in range(v-1):\r\n if(e[i]=='R' and e[i+1]=='L'):\r\n if(small==-2):\r\n small=int((int(e1[i+1])-int(e1[i]))/2)\r\n elif (abs(small)>int((int(e1[i+1])-int(e1[i]))/2)):\r\n small=int((int(e1[i+1])-int(e1[i]))/2) \r\nif(small==-2):\r\n print(-1)\r\nelse:\r\n print(small)", "N = int(input())\r\ndirect = input()\r\ncoord = list(map(int, input().rstrip().split(' ')))\r\nmn = 2e9\r\nfor i in range(1, N):\r\n if direct[i - 1] == 'R' and direct[i] == 'L':\r\n mn = min(mn, ((coord[i] - coord[i - 1])&1 + coord[i] - coord[i - 1]) // 2)\r\nif mn != 2e9:\r\n print(mn)\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\ndirs = input()\r\npos = list(map(int, input().split()))\r\n\r\ntimes = []\r\nfor i in range(len(dirs)-1):\r\n\tif dirs[i] == 'R' and dirs[i+1] == 'L':\r\n\t\ttimes.append((pos[i+1] - pos[i]) / 2)\r\n\r\nif times:\r\n\tprint(int(min(times)))\r\nelse:\r\n\tprint(-1)\r\n\t\t\t\t\r\n\r\n\t\t\r\n", "import sys\nfrom math import *\nfrom functools import *\nfrom collections import *\n\nn=int(input())\nins=input()\nr=list(map(int,input().split()))\ncur=10**20\nfor i in range(n-1):\n if ins[i]=='R' and ins[i+1]=='L':\n cur=min(cur,(r[i+1]-r[i])//2)\nif cur==10**20:print(-1)\nelse:print(cur)", "def pro():\r\n n = int(input())\r\n s = input()\r\n a = list(map(int, input().split()))\r\n cnt = 1000000001\r\n for i in range(n-1):\r\n if s[i]+s[i+1] == 'RL':\r\n cnt = min(cnt, (a[i+1] - a[i]) // 2)\r\n if cnt == 1000000001:\r\n print(-1)\r\n else:\r\n print(cnt)\r\n\r\npro()\r\n", "number = int(input())\r\ndir = input()\r\ndis = list(map(int , input().split()))\r\ntime = float('inf')\r\nfor i in range (0 , number-1) :\r\n if dir[i] != dir[i+1] and dir[i].lower() == 'r':\r\n time_test = int((dis[i] + dis[i+1]) / 2) - dis[i]\r\n if time > time_test :\r\n time = time_test\r\nif time != float('inf') :\r\n print(time)\r\nelse :\r\n print(-1)", "try:\r\n _ = input()\r\n s = input()\r\n a = list(map(int, input().split()))\r\n ans = float('inf')\r\n for i in range(0, len(a)-1):\r\n if s[i] == 'R' and s[i+1] == 'L':\r\n ans = min(ans, (a[i+1] - a[i])//2)\r\n if ans == float('inf'):\r\n print(-1)\r\n exit(0)\r\n print(ans)\r\nexcept:\r\n pass", "particles = int(input())\r\n\r\narrayOfMovement = list(str(input()))\r\narrayOfCoordinates = list(map(int, input().split()))\r\nmin = 10000000000\r\nflag= 0\r\nfor i in range(0,len(arrayOfMovement)):\r\n if i != len(arrayOfMovement)-1 and arrayOfMovement[i] == 'R' and arrayOfMovement[i+1] == 'L':\r\n x = arrayOfCoordinates[i+1] - arrayOfCoordinates[i]\r\n x /= 2\r\n if x < min:\r\n flag = 1\r\n min = x\r\n\r\n\r\nif flag==1:\r\n print(int(min))\r\n\r\nelse:\r\n print(\"-1\")\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\n \r\ndirct = input()\r\n \r\ncord = list(map(int, input().split()))\r\n \r\nans = [cord[i+1] - cord[i] for i in range(n-1) if dirct[i] == 'R' and dirct[i+1] == 'L']\r\n \r\nprint(min(ans)//2) if len(ans) > 0 else print(-1)", "\r\nn=int(input())\r\nt=input()\r\narr1=list(map(int,input().split()))\r\nans=[arr1[i+1]-arr1[i] for i in range(n-1) if (t[i]=='R' and t[i+1]=='L')]\r\nif ans:\r\n print(min(ans)//2)\r\nelse:\r\n print('-1')\r\n", "input()\r\ns = input()\r\nx = [int(i) for i in input().split()]\r\nres = -1\r\nfor i in range(len(x) - 1):\r\n if s[i] == \"R\" and s[i+1] == \"L\":\r\n if res == -1 or res > (x[i+1] - x[i]) // 2:\r\n res = (x[i+1] - x[i]) // 2\r\nprint(res)\r\n", "def main():\r\n\tn = input()\r\n\ts = input()\r\n\tL = [int(x) for x in input().split()]\r\n\tprint(solver(s, L))\r\n\r\ndef solver(s, L):\r\n\tminimum = -1\r\n\tfor i in range(len(s) - 1):\r\n\t\tif s[i: i + 2] == \"RL\":\r\n\t\t\tcur = (L[i + 1] - L[i]) // 2\r\n\t\t\tif minimum == -1 or cur < minimum:\r\n\t\t\t\tminimum = cur\r\n\treturn minimum\r\n\r\n# print(solver(\"RLRL\", [2, 4, 6, 10]))\r\n# print(solver(\"LLR\", [40, 50, 60]))\r\n\r\nmain()\r\n", "n = int(input())\r\ns = input()\r\nm = list(map(int, input().split()))\r\nans = 1e9\r\nfor i in range(n-1):\r\n if s[i] == \"R\" and s[i+1] == \"L\":\r\n ans = min(ans, (m[i+1] - m[i]) // 2)\r\nif ans != 1e9:\r\n print(ans)\r\nelse:\r\n print(-1)", "n = int(input())\r\ns = input()\r\na = list(map(int,input().split()))\r\nans = [a[i+1] - a[i] for i in range(n-1) if s[i] == \"R\" and s[i+1]== \"L\"]\r\nif ans:\r\n print(min(ans)//2)\r\nelse: print(-1)", "n=int(input())\r\nways=input()\r\ncordinates=list(map(int,input().split()))\r\ndistances=[]\r\nfor i in range (0,n-1):\r\n if ways[i]=='R' and ways[i+1]=='L':\r\n distances.append(cordinates[i+1]-cordinates[i])\r\nif len(distances)>0:\r\n x=min(distances)\r\n print(int(x*0.5))\r\nelse:print('-1')", "N=int(input())\r\ns=input()\r\nP=list(map(int,input().strip().split(' ')))\r\nstart=0\r\nMIN=10**10\r\nlast=-1\r\nfor i in range(N):\r\n if s[i]=='R':\r\n start=1\r\n last=P[i]\r\n else:\r\n if start==1:\r\n temp=P[i]\r\n temp=(P[i]-last)//2\r\n if temp<MIN:\r\n MIN=temp\r\n start=0\r\n else:\r\n start=0\r\nif MIN==10**10:\r\n print(-1)\r\nelse:\r\n print(MIN)\r\n \r\n ", "n=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\nl=[a[i+1]-a[i] for i in range(n-1) if s[i]=='R' and s[i+1]=='L']\r\nif l:\r\n print(min(l)//2)\r\nelse:\r\n print(-1)", "n = int(input())\r\ndirects = list(input())\r\nslst = input().split()\r\nlst,c,s = [], 0, None\r\nfor j in range(len(directs)-1):\r\n if directs[j] == 'R' and directs[j+1] == 'L':\r\n lst.append(slst[j:j+2])\r\n c = 1\r\nif c == 0:\r\n print(-1)\r\n quit()\r\nfor k in lst:\r\n if s is None or (int(k[1])-int(k[0]))/2 < s:\r\n\r\n s = int((int(k[1])-int(k[0]))/2)\r\nprint(s)", "n=int(input())\r\ns=input()\r\nL=[int(i) for i in input().split()]\r\nlow=[]\r\nfor i in range(n-1):\r\n if s[i]+s[i+1]==\"RL\":\r\n low.append((L[i+1]-L[i])//2)\r\nx=[str(i) for i in low]\r\nx=\"\".join(x)\r\nprint(min(low) if x!=\"\" else \"-1\") ", "n=int(input())\r\nd=input()\r\np=input().split(' ')\r\nif 'RL' not in d: print (-1)\r\n\r\nelse:\r\n\tl=0\r\n\tc=1000000000\r\n\twhile 'RL' in d[l:]:\r\n\t\tl=d[l:].index('RL')+l\r\n\t\tif ( int(p[l+1]) - int(p[l]) )/2<c:\r\n\t\t\tc=(int(p[l+1])-int(p[l]))/2\r\n\t\tl+=2\r\n\tprint (int(c))\r\n", "num = int(input())\r\nDir = list(map(str, input()))\r\npos = list(map(int, input().split()))\r\ncoll = []\r\nfor i in range(num - 1):\r\n\tif Dir[i] == \"R\" and Dir[i+1] == \"L\":\r\n\t\tcoll.append((pos[i+1] - pos[i])//2)\r\n\r\nif len(coll)==0:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint(min(coll))\r\n\r\n", "n = int(input())\r\ndirs = list(input())\r\nparticles = list(map(int, input().strip().split()))\r\nans = 100000000000\r\nfor i in range(n - 1):\r\n if dirs[i] == 'R' and dirs[i + 1] == 'L':\r\n time = int((particles[i + 1] - particles[i]) / 2)\r\n ans = time if time < ans else ans\r\n\r\nif ans == 100000000000:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n", "n = int(input())\ns = input()\na = list(map(int, input().split()))\n\nposs = 0\nans = 2000000000.0\nfor i in range(0, n-1):\n if s[i] == \"R\" and s[i+1] == \"L\":\n poss = 1\n ans = min(ans, ((a[i+1]-a[i])/2))\n\n\nif poss == 0:\n print(-1)\n exit()\nelse:\n print(int(ans))\n \t \t\t\t \t \t\t\t\t \t\t\t \t\t\t \t \t \t\t", "# import sys\r\n# sys.stdin=open(\"input.in\",'r')\r\n# sys.stdout=open(\"outp.out\",'w')\r\nn=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\nf=0\r\nfor i in range(n):\r\n\tif f==0 and i<n-1 and s[i]==\"R\" and s[i+1]==\"L\":\r\n\t\tt=(a[i+1]-a[i])//2\r\n\t\tf=1\r\n\telif i<n-1 and s[i]==\"R\" and s[i+1]==\"L\":\r\n\t\tt=min(t,(a[i+1]-a[i])//2)\r\nif f==0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(t)", "def separate_direction(movement):\r\n i = 0\r\n separate = True\r\n while i < len(movement) and movement[i] == \"L\":\r\n i += 1\r\n while i < len(movement):\r\n if movement[i] == \"L\":\r\n separate = False\r\n i += 1\r\n return separate\r\n\r\n\r\ndef collision():\r\n n = int(input())\r\n movements = list(input())\r\n coords = list(map(int, input().split(\" \")))\r\n # They won't collide if they are all in the same direction\r\n if set(movements) == 0:\r\n print(-1)\r\n return\r\n if separate_direction(movements):\r\n print(-1)\r\n return\r\n # process movements\r\n time = float(\"inf\")\r\n left_pointer = 0\r\n right_pointer = 0\r\n while left_pointer < n and right_pointer < n:\r\n while right_pointer < n and movements[right_pointer] == \"L\":\r\n right_pointer += 1\r\n while left_pointer < n and (movements[left_pointer] == \"R\" or right_pointer>= left_pointer):\r\n left_pointer += 1\r\n if left_pointer >= n or right_pointer >= n:\r\n break\r\n time = min((coords[left_pointer] - coords[right_pointer]) / 2, time)\r\n right_pointer += 1\r\n print(int(time))\r\n\r\n\r\ncollision()\r\n", "n =int(input())\r\ns =input()\r\nm =map(int,input().split())\r\nl=[]\r\nfor x in m : \r\n l.append(x)\r\nres=1e9\r\nfor x in range(len(l)-1) : \r\n if s[x]=='R' and s[x+1]=='L':\r\n res=min(res,(l[x+1]-l[x])//2)\r\nif res!=1e9 :\r\n print(res)\r\nelse :\r\n print(-1)", "N=int(input())\na=input()\nb=input()\nb=b.split()\n\nx=0-1\nfor i in range(N-1):\n\tif a[i]=='R' and a[i+1]=='L':\n\t\ts=(int(b[i+1])-int(b[i]))//2\n\t\tif x==0-1:\n\t\t\tx=s\n\t\telse:\n\t\t\tx=min(x, s)\nprint(x)\n\n\n", "n=int(input())\r\na=[*enumerate(input())]\r\nb=[*map(int,input().split())]\r\na.sort(key=lambda x:b[x[0]])\r\nk=0\r\nr=l=-1\r\nwhile k<n:\r\n if a[k][1]=='R':l=k\r\n elif l>-1:\r\n c=-(b[a[l][0]]-b[a[k][0]])//2\r\n r=[min(r,c),c][r<0]\r\n k+=1\r\nprint(r)", "n=int(input())\r\n\r\ns=input()\r\np=[int(z) for z in input().split()]\r\nif n==1:\r\n print(-1)\r\nelse:\r\n mi=float(\"Inf\")\r\n for i in range(1,n):\r\n if s[i]==\"L\" and s[i-1]==\"R\":\r\n mi=min(mi,(p[i]-p[i-1])//2)\r\n if mi==float(\"Inf\"):\r\n print (-1)\r\n else:\r\n print(mi)", "n = int(input())\ndirs = input().strip()\npos = tuple(int(_) for _ in input().split())\nsentinel = 10 ** 9 + 1\nbest = sentinel\n\ni = dirs.find('RL')\nwhile i >= 0:\n best = min(best, pos[i+1] - pos[i])\n i = dirs.find('RL', i+2)\n\nif best == sentinel:\n print(-1)\nelse:\n print(best // 2)\n", "n=int(input())\r\ns=input()\r\nA = input().split()\r\nfor i in range(len(A)):\r\n A[i] = int(A[i])\r\nmin1=10000000000\r\nfor i in range (1,n):\r\n if A[i]-A[i-1]<min1 and s[i]=='L' and s[i-1]=='R':\r\n min1=A[i]-A[i-1] \r\nif min1==10000000000:\r\n print(-1)\r\nelse:\r\n print(min1//2)\r\n", "n = int(input())\r\ns = input()\r\nx = list(map(int, input().split()))\r\n\r\nmin = -1\r\nfor i in range(n-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n cur = (x[i+1]-x[i])//2\r\n min = cur if cur < min or min == -1 else min\r\n\r\nprint(min)\r\n", "n=int(input())\r\nd=input()\r\nl=list(map(int,input().split()))\r\nm=0\r\nr=10**9\r\nfor i in range(n-1):\r\n if d[i]=='R' and d[i+1]=='L':\r\n m=(l[i+1]-l[i])/2\r\n if m<r:\r\n r=m\r\nif r==10**9:\r\n print(-1)\r\nelse:\r\n print(int(r))\r\n \r\n \r\n", "n=int(input())\r\ns=input()\r\np=list(map(int,input().split()))\r\nc=0\r\nl=[]\r\nfor i in range(n-1):\r\n if s[i]==\"R\" and s[i+1]=='L':\r\n l.append(abs(p[i]-p[i+1]))\r\nif len(l)>0:\r\n print(int(min(l)/2))\r\nelse:\r\n print(-1)\r\n\r\n \r\n ", "\"\"\"609C\"\"\"\r\n# import math\r\ndef main():\r\n\tn = int(input())\r\n\tstring = str(input())\r\n\ta = list(map(int,input().split()))\r\n\tmx = a[n-1]+100\r\n\tfor i in range(len(string)-1):\r\n\t\tif string[i]==\"R\" and string[i+1]==\"L\":\r\n\t\t\tmx = min((a[i+1]-a[i])//2,mx)\r\n\tif mx == a[n-1]+100:\r\n\t\tprint(\"-1\")\r\n\telse:\r\n\t\tprint(mx)\r\n\treturn\r\n\r\n\r\n\r\nmain()\r\n\r\n\r\n\r\n# t= int(input())\r\n# while t:\r\n# \tmain()\r\n# \tt-=1", "n = int(input())\ns = input()\nlst = list(map(int,input().split()))\n\nmn = 100000000000\nfor i in range(n-1):\n if s[i]=='R' and s[i+1]=='L':\n x = (lst[i+1]- lst[i]) // 2\n mn = min(mn, x)\nif mn == 100000000000:\n print(-1)\nelse:\n print(mn)\n\t \t\t \t \t \t\t\t \t \t \t\t \t\t \t\t\t \t", "input()\r\n\r\nleastmoment = float(\"inf\")\r\ndirections = input()\r\npositions = list(map(int,input().split()))\r\n\r\nfor i in range(len(directions)-1):\r\n if directions[i] == \"R\" and directions[i+1] == \"L\":\r\n leastmoment = min(leastmoment,(positions[i+1]-positions[i])//2)\r\n\r\nif leastmoment == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(leastmoment)\r\n ", "n=int(input())\r\nm=str(input())\r\no=[int(i) for i in input().split()]\r\nmin=1000000000\r\nfor i in range(0,len(m)-1):\r\n if(m[i]==\"R\" and m[i+1]==\"L\"):\r\n time=((o[i+1]-o[i])/2)\r\n if(time<min):\r\n min=time\r\nif(min==1000000000):\r\n print(-1)\r\nelse:\r\n print(int(min))\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\ns=input()\r\nc=[int(x) for x in input().split()]\r\nl=[]\r\nf=0\r\nfor i in range(len(s)-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n med=(c[i]+c[i+1])/2\r\n l.append(abs(med-c[i]))\r\n f=1\r\n \r\nl=sorted(l) \r\nif f==1:\r\n print(int(l[0])) \r\nelse:\r\n print('-1')\r\n ", "\n# coding: utf-8\n\n# In[3]:\n\nn = int(input())\ns = input()\nidxs = list(map(int, input().split()))\n\nr_flag = -1\nl_flag = -1\nans = 10**20\n\nfor idx, q in enumerate(s):\n if q == 'R':\n r_flag = idxs[idx]\n else:\n l_flag = idxs[idx]\n if r_flag != -1:\n ans = min(ans, (l_flag - r_flag) // 2)\n\nprint(ans if ans != 10**20 else -1)\n\n\n# In[ ]:\n\n\n\n", "N = int(input())\r\nDs = [x for x in input()]\r\nCs = [int(x) for x in input().split()]\r\nAns = int(1e9)\r\nfor i in range(N-1):\r\n if Ds[i] == 'R' and Ds[i+1] == 'L':\r\n Ans = min(Ans,(Cs[i+1] - Cs[i]) // 2)\r\nif Ans == int(1e9):\r\n print(-1)\r\nelse:\r\n print(Ans)", "n = int(input())\r\nm = input()\r\nmoves = [i for i in m]\r\npositions = list(map(int, input().split()))\r\n\r\nif not 'RL' in m:\r\n print(-1)\r\nelse:\r\n mini = positions[-1] - positions[0]\r\n for i in range(n-1):\r\n if moves[i] == 'R' and moves[i+1] == 'L':\r\n mini = min(mini, positions[i+1] - positions[i])\r\n \r\n print(int(mini/2))\r\n ", "n=int(input())\r\nstr1=input()\r\nlist1=[]\r\nlist1.extend(str1)\r\nlist2=list(map(int,input().split()))\r\na=[]\r\nfor x in range(n-1):\r\n if list1[x]==\"R\" and list1[x+1]==\"L\":\r\n\r\n a.append((list2[x+1]-list2[x])//2)\r\n\r\n\r\nif len(a)==0:\r\n print(-1)\r\nelse:\r\n print(min(a))\r\n", "h= int(input())\n\ns2 = input()\nl1 = list(map(int, input().strip().split()))\n\nres = 999999999999\n\nfor i in range(0, len(s2)-1):\n\tif s2[i]==\"R\" and s2[i+1]==\"L\": \n\t\tres = min(res, (l1[i+1]-l1[ i])//2)\nif res == 999999999999:\n\tprint(-1)\nelse:\n\tprint(res)\n ", "n=int(input())\r\ns=input()\r\na=list(map(int,input().split()))\r\nl,z=[],0\r\nfor i in range(n-1):\r\n if (s[i]=='R' and s[i+1]=='L'):\r\n l.append((a[i+1]-a[i])//2)\r\n z=-1\r\nif z==0:\r\n print(-1)\r\nelse:\r\n print(min(l))", "x=int(input())\r\ny=list(input())\r\np=list(map(int,input().split()))\r\nmi=p[x-1]+1\r\nfor i in range(x-1):\r\n if y[i]==\"R\" and y[i+1]==\"L\":\r\n mi=min(mi,p[i+1]-p[i])\r\nprint(mi//2 if mi!=p[x-1]+1 else -1)\r\n \r\n", "n = int(input())\r\ns = input()\r\nx = list(map(int,input().split()))\r\nls = []\r\nl = []\r\nlx = []\r\nif 'RL' in s:\r\n\tfor i in range(1,n):\r\n\t\tif s[i - 1] == 'R' and s[i] == 'L':\r\n\t\t\tx1 = x[i - 1] \r\n\t\t\tx2 = x[i]\r\n\t\t\tls.append(x2 - x1)\r\n\t\t\tl.append(x2 + x1)\r\n\t\t\tlx.append(x2)\r\n\t\r\n\tres = lx[ls.index(min(ls))] - (l[ls.index(min(ls))] / 2)\r\n\tprint(int(res))\r\n\r\nelse:\r\n\tprint(-1)", "n, = map(int, input().split())\r\nd = input()\r\narr = list(map(int, input().split()))\r\nans = float(\"inf\")\r\nfor i in range(1, n):\r\n if d[i] == 'L' and d[i - 1] == 'R':\r\n ans = min(ans, (arr[i] - arr[i - 1]) // 2)\r\n\r\nprint(ans if ans < float(\"inf\") else -1)\r\n", "size=int(input()) \r\nS=input() #RLRL\r\nls=input().split()\r\nls=list(map(int,ls))\r\nc1=0\r\nfor i in range(len(S)-1):\r\n if S[i]!=S[i+1]:\r\n if S[i]=='R' and S[i+1]=='L':\r\n temp_c1 = (max(ls[i], ls[i + 1]) - min(ls[i], ls[i + 1])) / 2\r\n if temp_c1 < c1 or c1 == 0:\r\n c1 = temp_c1\r\nif c1!=0: print(int(c1))\r\nelse: print(-1)", "# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\r\n# |AUTHOR|\r\n# | |\r\n# | |\r\n# | |\r\n# | | \r\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\r\n# MUHAMMAD AMMAR\r\n# >>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>>\r\na=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\nk=[]\r\nfor i in range(a-1):\r\n if b[i]=='R' and b[i+1]=='L':\r\n k.append((c[i+1]-c[i])//2)\r\n\r\nif len(k)!=0:\r\n print(min(k))\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\ns=input()\r\na=[int(x) for x in input().split()]\r\ncheck,res=1,1000000000\r\nfor i in range(0,n-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n res=min(res,a[i+1]-a[i])\r\n check=0\r\nif check==1:\r\n print(-1)\r\nelse:\r\n print(res//2)", "from math import inf\nfrom bisect import insort, bisect_right\n\nn, s = int(input()), input()\nx = (int(i) for i in input().split())\nleft, right = [], []\nfor i, d in zip(x, s):\n insort(left if d == \"L\" else right, i)\nres = inf\nfor k in left:\n i = bisect_right(right, k)\n if i > 0:\n res = min(res, (k - right[i - 1]) // 2)\nres = -1 if res == inf else res\nprint(res)\n", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nans = 10 ** 9 + 1 \r\nfor i in range(n - 1):\r\n if(s[i : i + 2] == 'RL'):\r\n ans = min(ans, (a[i + 1] - a[i]) // 2)\r\n\r\nif(ans == 10 ** 9 + 1):\r\n print(-1)\r\nelse:\r\n print(ans)", "def solve(x, directions):\r\n return min(((x[i + 1] - x[i]) // 2 for i in range(len(x) - 1) if directions[i:i + 2] == \"RL\"), default=-1)\r\n\r\ndef main():\r\n _ = int(input())\r\n directions = input()\r\n x = list(map(int, input().split()))\r\n print(solve(x, directions))\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nm = input()\r\np = list(map(int,input().split()))\r\nx = []\r\nif (m.find('RL') == -1):\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if (i != n-1):\r\n if ((m[i] == 'R') & (m[i+1] == 'L')):\r\n x.append((p[i+1]-p[i])//2)\r\n else:\r\n exit\r\n print(min(x))\r\n \r\n", "\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\nn=int(input())\r\ns=input()\r\nl=[int(x) for x in input().split()]\r\n\r\nans=[]\r\nfor i in range(len(l)-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n ans.append(l[i+1]-l[i])\r\nprint(min(ans)//2 if ans else -1)\r\n", "n=int(input())\ns=input()\narr=[int(i) for i in input().split()]\n\nans=1e9\n\nfor i in range (1,n):\n if s[i-1] == 'R' and s[i] == 'L':\n ans=min(ans,(arr[i]-arr[i-1])/2)\n\nif ans == 1e9:\n ans=-1\n\nprint(int(ans))\n\n\t\t\t\t \t\t \t\t\t\t\t\t\t\t \t\t \t\t\t\t", "x = int(input())\r\nmove = input()\r\npos = list(map(int,input().split()))\r\nbasket = []\r\nfor i in range(x-1):\r\n if move[i] == \"R\" and move[i+1]==\"L\":\r\n basket+=[((pos[i]+pos[i+1])//2)-pos[i]]\r\nprint(-1 if len(basket)==0 else min(basket))", "# Enter your code here. Read input from STDIN. Print output to STDOUT\n\nif __name__ == '__main__':\n\tn = int(input().strip())\n\ts = input().strip()\n\tcord = [int(x) for x in input().strip().split(\" \")]\n\tans = float(\"inf\")\n\tfor i in range(n-1):\n\t\tif s[i] == \"R\" and s[i+1] == \"L\":\n\t\t\tx = (cord[i+1] - cord[i]) // 2\n\t\t\tif x < ans:\n\t\t\t\tans = x\n\tif ans == float(\"inf\"):\n\t\tprint(\"-1\")\n\telse:\n\t\tprint(ans)\n \t \t \t\t \t \t\t \t\t\t\t\t\t\t \t \t \t\t\t\t", "n = int(input())\r\ndirections = input()\r\npositions = [int(i) for i in input().split()]\r\ntimes = []\r\n\r\nfor i in range(n - 1):\r\n if directions[i] == 'R' and directions[i + 1] == 'L':\r\n times.append((positions[i + 1] - positions[i]) // 2)\r\n\r\nprint(min(times) if times else -1)\r\n", "amount = int(input())\r\ndirection = input()\r\ncoord = [int(i) for i in input().split()]\r\nmodulus1 = list()\r\nmodulus2 = list()\r\nfor i in range(amount-1):\r\n\tmodulus1.append(coord[i+1] - coord[i])\r\nfor i in range(amount):\r\n\tif direction[i] == \"L\":\r\n\t\tcoord[i] -= 1\r\n\telse:\r\n\t\tcoord[i] += 1\r\nfor i in range(amount-1):\r\n\tmodulus2.append(coord[i+1] - coord[i])\r\nmin = 1000000001\r\nfor i in range(amount-1):\r\n\tif modulus1[i] < min:\r\n\t\tif modulus1[i] > modulus2[i]:\r\n\t\t\tmin = modulus1[i]\r\nif min == 1000000001:\r\n\tprint(-1)\r\nelse:\r\n\tprint(int(min/2))", "data = input() + '\\n' + input() + '\\n' + input()\r\n\r\nn = int(data.split()[0])\r\nsides = list(data.split()[1])\r\nspeeds = [int(i) for i in data.split()[2:]]\r\n\r\n# check for blow possibility\r\nif 'L' not in sides or 'R' not in sides:\r\n print(-1)\r\nelif 'L' not in sides[sides.index('R'):]:\r\n print(-1)\r\n\r\nelse:\r\n checklist = []\r\n for i in range (n-1):\r\n if sides[i] == 'R' and sides[i+1] == 'L':\r\n checklist.append(i)\r\n ranges = []\r\n for i in checklist:\r\n ranges.append(speeds[i+1] - speeds[i])\r\n a = int(min(ranges) / 2)\r\n print(a)\r\n", "n = int(input())\ns = str(input()) + 'm'\na = [int(i) for i in input().split()]\na.append(1000000000000000)\nif \"RL\" not in s:\n print(-1)\n exit()\nres = 1000000000000000\nfor i in range(n):\n if (s[i] == \"R\" and s[i + 1] == \"L\") and ((a[i +1] - a[i]) // 2 < res):\n res = (a[i +1]-a[i])//2\nprint(res)\n\n\n \t \t\t \t\t \t\t \t\t \t \t \t\t \t \t", "import collections\r\ns = int(input())\r\nd = input()\r\nx = [int(x) for x in input().split()]\r\nm = max(x) - min(x)\r\ncnt = 0\r\nres = []\r\nif \"RL\" not in d:\r\n print(-1)\r\nelse:\r\n for i in range(len(d)-1):\r\n if d[i] == 'R' and d[i+1] == \"L\":\r\n res.append(int(abs((x[i] - x[i+1]) / 2)))\r\n print(min(res))\r\n", "\nn = input()\nn = int(n)\n\nstr = input()\nlist = input().split()\nlist = [int(x) for x in list]\nlist2 = []\nfor i in range(n - 1):\n if str[i] == \"R\" and str[i + 1] == \"L\":\n ans = list[i + 1] - list[i]\n list2.append(ans // 2)\n\nif len(list2) == 0:\n print(-1)\n\nelse:\n print(min(list2))\n \n# Time Complexity : O(n). \n \t\t\t \t \t \t\t \t \t \t\t \t", "n = int(input())\n\ns = input()\n\narr =[int(i) for i in input().split()]\n\n\nans=1e9\nfor i in range(1,n):\n if s[i - 1] == 'R' and s[i] == 'L':\n\n ans = min(ans,(arr[i]-arr[i-1])/2)\n\n\nif ans == 1e9:\n ans=-1\n\nprint(int(ans))\n\t \t \t\t \t \t \t\t \t \t \t \t", "num = int(input())\r\ns = input()\r\narr = list(map(int, input().split()))\r\n\r\ncollision = False\r\nans = float(\"inf\")\r\nfor i in range(1, num):\r\n if s[i-1] == \"R\" and s[i] == \"L\":\r\n ans = min(ans, (arr[i]-arr[i-1])//2)\r\n collision = True\r\n\r\n\r\nif not collision:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ndirections = input()\r\ncoordinates = [x for x in map(int, input().split())]\r\ndistance = 9999999999\r\n\r\nfor i in range(n-1):\r\n if directions[i:i+2] == 'RL':\r\n diff = coordinates[i+1] - coordinates[i] \r\n if diff < distance:\r\n distance = diff\r\n\r\nif distance != 9999999999:\r\n print (int(distance/2))\r\nelse:\r\n print (-1)", "'''input\n2\nRL\n0 1000000000\n'''\nn = int(input())\nd = input()\nx = list(map(int, input().split()))\nif \"RL\" in d:\n\tm = 10000000000000000\n\tfor i in range(n-1):\n\t\tif d[i:i+2] == \"RL\":\n\t\t\tm = min(m, x[i+1] - x[i])\n\tprint(m//2)\nelse:\n\tprint(-1)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "# all those moments will be lost in time , like tears in rain \r\nn = int(input())\r\nchars = input()\r\nx = list(map(int, input().split()))\r\n\r\nalist = []\r\n\r\nfor i in range(0, n-1):\r\n if chars[i] == chars[i+1] or (chars[i] == 'L' and chars[i+1] == 'R'):\r\n continue\r\n else:\r\n alist.append(abs(int((x[i] - x[i+1]) / 2)))\r\n\r\nif len(alist):\r\n print(min(alist))\r\nelse:print(-1)", "import sys\n\ndef main(arr):\n curr = None\n m = float(\"inf\")\n for d, pos in arr:\n if d == 'L':\n if curr is not None:\n m = min(m, pos - curr)\n elif d == 'R':\n curr = pos\n print(m // 2 if m != float(\"inf\") else -1)\n\nif __name__ == \"__main__\":\n arr = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n continue\n if e == 1:\n arr = list(c for c in line.strip())\n else:\n curr = list(map(int, line.strip().split()))\n arr = list(zip(arr, curr))\n main(arr)\n", "n = int(input())\r\nconfiguration = list(input())\r\nx = 0\r\nl1 = [int(num) for num in input().split(' ')]\r\nl2 = []\r\nfor i in range(len(configuration) - 1):\r\n if configuration[i] == 'R' and configuration[i + 1] == 'L' :\r\n l2.append(i)\r\nl3 = []\r\nif len(l2) == 0:\r\n print(-1)\r\nelse:\r\n for i in l2:\r\n l3.append(l1[i + 1] - l1[i])\r\n print(min(l3) // 2)", "n = int(input())\r\ns = input()\r\nx = [int(i) for i in input().split()]\r\nminValue = -1\r\n\r\nfor i in range(n - 1):\r\n if s[i] == 'R' and s[i + 1] == 'L':\r\n r = (x[i + 1] - x[i]) // 2\r\n if minValue == -1 or r < minValue:\r\n minValue = r\r\n\r\nprint(minValue)\r\n", "a = int(input())\r\nb = input()\r\nc = input().split()\r\ne = []\r\nfor i in range(a-1):\r\n if b[i]=='R' and b[i+1]=='L':\r\n n = int(c[i])\r\n m = int(c[i+1])\r\n e.append(m-((m+n)//2))\r\nif len(e)==0:\r\n print(-1)\r\nelse:\r\n print(min(e))\r\n", " \r\ndef main():\r\n\tn = int(input())\r\n\td = input()\r\n\tx = list(map(int, input().split()))\r\n\r\n\tt = -1\r\n\tfor i in range(len(x) - 1):\r\n\t\tif d[i] == 'R' and d[i+1] == 'L':\r\n\t\t\ttime = (x[i] + x[i+1]) // 2 - x[i]\r\n\t\t\tt = min(1e10 if t < 0 else t, time)\r\n\t\r\n\tprint(t)\r\n \r\n \r\nif __name__ == '__main__':\r\n\tmain()", "n = int(input())\r\nletters = input()\r\nx = input().split()\r\nmin_value=0\r\nfor i in range(n):\r\n if letters[i] == \"R\" and i != n-1 and letters[i+1] == \"L\" :\r\n if (int(x[i+1])-int(x[i])) < min_value or min_value==0:\r\n min_value=int(x[i+1])-int(x[i])\r\nif min_value !=0:\r\n print(int((min_value)/2))\r\nelse:\r\n print(-1)\r\n", "from math import ceil\r\nfrom xmlrpc.client import MAXINT\r\n\r\n\r\nn=int(input())\r\ns=input()\r\nx=list(map(int,input().split(' ')))\r\nif(s.count('R') == len(s) or s.count('L')==len(s)):\r\n print(-1)\r\nelse:\r\n minDiff = MAXINT\r\n for i in range(0,n-1):\r\n if(s[i]=='R' and s[i+1]=='L' and x[i]<x[i+1]):\r\n diff=ceil((x[i+1] -x[i])/2)\r\n if(diff<minDiff):\r\n minDiff= diff\r\n if(minDiff!=MAXINT):\r\n print(int(minDiff))\r\n else:\r\n print(-1)\r\n", " #BISMILLAH\n # ITS NOT OVER WHEN YOU FAIL\n # ITS OVER WHEN YOU QUIT\nimport math\nn = input()\ns = input()\nl = list(map(int, input().strip().split()))\nlx = []\nmini = math.inf\nactive = False\n\nfor char, value in zip(s, l):\n\tlx.append((char, value))\n\nfor i in range(0, len(lx)-1):\n\tt1, t2 = lx[i], lx[i+1]\n\tif t1[0] == \"R\" and t2[0] == \"L\":\n\t\tactive = True\n\t\tmini = min(mini, int((t1[1]+t2[1])/2)-t1[1])\n\nif active:\n\tprint(mini)\nelse:\n\tprint(-1)\n\t", "n = int(input())\r\n\r\ndirection = list(input())\r\npos = list(map(int, input().split()))\r\nans = 1e9\r\nfor i in range(max(pos)):\r\n\r\n try:\r\n if direction[i]==\"R\" and direction[i+1]==\"L\":\r\n ans = min(ans, (pos[i+1]-pos[i])//2)\r\n except IndexError:\r\n break\r\n\r\n\r\n\r\n\r\nif ans == 1e9:\r\n print(-1)\r\nelse:\r\n print(ans)", "n=int(input())\r\ns=input()\r\nl=list(map(int,input().split()))\r\nans=1e9\r\nfor i in range(n):\r\n if i!=n-1 and s[i]=='R' and s[i+1]=='L' :\r\n ans=min(ans,abs(l[i]-l[i+1])//2)\r\nif ans == 1e9:print(-1)\r\nelse:print(ans)", "n = int(input())\r\ni = input()\r\nx = input().split(\" \")\r\ncr = []\r\nfor a in range(len(x)):\r\n x[a] = int(x[a])\r\na = 0\r\nwhile(a < n-1):\r\n if(i[a] == \"R\"):\r\n if(i[a+1] == \"L\"):\r\n cr.append((x[a+1]-x[a])//2)\r\n a += 2\r\n else:\r\n a += 1\r\n else:\r\n a += 1\r\nif(len(cr) > 0):\r\n print(min(cr))\r\nelse:\r\n print(-1)", "n= int(input())\r\nk = input()\r\narr =[int(x) for x in input().split()]\r\nm=1000000001\r\nfor i in range(0,n-1):\r\n # print(len(m),len(n))\r\n if k[i]=='R' and k[i+1]=='L':\r\n m=min(m,(arr[i+1]-arr[i])/2)\r\n # n+=k[i]\r\n # else:\r\n # m+=k[i]\r\nif m==1000000001:\r\n print(str(-1))\r\nelse:\r\n print(str(int(m)))", "import math,sys,re,itertools\r\nrs,ri,rai=input,lambda:int(input()),lambda:list(map(int, input().split()))\r\nn = ri()\r\ns = rs()\r\nxa = rai()\r\np = None\r\nmini = float(\"inf\")\r\nfor ch, x in zip(s, xa):\r\n if p is None:\r\n if ch == 'R':\r\n p = (ch, x)\r\n continue\r\n if ch == 'R':\r\n if p[0] == 'R':\r\n p = (ch, x)\r\n elif ch == 'L':\r\n if p[0] == 'R':\r\n mini = min(mini, (x - p[1]) // 2)\r\n p = None\r\nif mini == float(\"inf\"):\r\n print(-1)\r\nelse:\r\n print(mini)\r\n", "n=int(input())\r\nstr1=input()\r\nlist1=[]\r\nlist1.extend(str1)\r\nlist2=list(map(int,input().split()))\r\na=[]\r\nfor x in range(n-1):\r\n if list1[x]==\"R\" and list1[x+1]==\"L\":\r\n b=((list2[x]+list2[x+1])//2)\r\n b=list2[x+1]-b\r\n a.append(b)\r\n\r\n\r\nif len(a)==0:\r\n print(-1)\r\nelse:\r\n print(min(a))\r\n\r\n", "n = int(input())\r\ndirections = input()\r\npositions = list(map(int, input().split()))\r\n\r\ntime = float('inf') # initialize time to infinity\r\n\r\nfor i in range(n-1):\r\n if directions[i:i+2] == \"RL\": # check for collision between adjacent particles\r\n time = min(time, (positions[i+1] - positions[i]) // 2) # calculate time of collision\r\n\r\nif time == float('inf'): # no collision occurred\r\n print(\"-1\")\r\nelse:\r\n print(time)\r\n", "# print (\"Input n\")\nn = int(input())\n# print (\"Input the string of Ls and Rs\")\nst = input()\n# print (\"Input the starting positions, all on one line\")\na = list(int(x) for x in input().split())\n\ncollide = False\nsmallesttime = None\nfor i in range(0, len(a)-1):\n if st[i] == \"R\" and st[i+1] == \"L\":\n time = (a[i+1] - a[i])//2\n if collide == False:\n collide = True\n smallesttime = time\n else:\n if time < smallesttime:\n smallesttime = time\nif not collide:\n print (-1)\nelse:\n print (smallesttime)\n \n \n", "res, p, n, s, a, l, r = 100000000000000000, 0, int(input()), input(), list(map(int, input().split())), [], []\r\nfor x in range(n):\r\n if s[x] == 'L': l.append(x)\r\n else: r.append(x)\r\nfor x in r:\r\n while p < len(l) and l[p] < x: p += 1\r\n if p != len(l) and ((a[l[p]] - a[x]) & 1) == 0: res = min(res, ((a[l[p]] - a[x]) >> 1))\r\nprint(res) if res < 10000000000 else print(-1)", "n = int(input())\r\ndirecoes = input()\r\n\r\nposicoes = input().split()\r\nposicoes = [int(x) for x in posicoes]\r\n\r\nmarcacoes = []\r\n\r\nfor i in range(0, len(direcoes)-1):\r\n if direcoes[i] == 'R' and direcoes[i+1] == 'L':\r\n marcacoes.append(i)\r\n\r\nif marcacoes == []:\r\n print(-1)\r\nelse:\r\n tempos = [(posicoes[x+1]-posicoes[x]) for x in marcacoes]\r\n print(int(min(tempos)/2))", "n=int(input())\r\nsymbol=input()\r\npos=list(map(int,input().rsplit()))\r\nmin=2*10**9\r\ncn=0\r\nfor i in range(0,n-1):\r\n if(symbol[i]==\"R\" and symbol[i+1]==\"L\"):\r\n _=abs(pos[i]-pos[i+1])\r\n cn+=1\r\n if(_<min):\r\n min=_\r\nif(cn==0):\r\n print(-1)\r\nelse:\r\n print(int(min/2))", "import sys\r\nn = int(input())\r\nd = input()\r\nx = list(map(int, input().split()))\r\n\r\nr = 0\r\nl = 0\r\nm = sys.maxsize\r\nwhile True:\r\n\tr = d.find('R', l)\r\n\tif r == -1:\r\n\t\tbreak\r\n\t\t\r\n\tl = d.find('L', r + 1)\r\n\tif l == -1:\r\n\t\tbreak\r\n\t\r\n\tr = l - 1\r\n\tif m > (x[l] - x[r]) // 2:\r\n\t\tm = (x[l] - x[r]) // 2\r\n\r\nif m == sys.maxsize:\r\n\tprint(-1)\r\nelse:\r\n\tprint(m)\r\n\t\r\n\t", "n = int(input())\r\ns = input()\r\na = list(map(int, input().split()))\r\nans = -1\r\nfor i in range(n-1):\r\n if s[i:i+2]==\"RL\":\r\n if ((abs(a[i]-a[i+1])//2)<ans) or (ans==-1):\r\n ans = abs(a[i]-a[i+1])//2\r\nprint(ans)", "n = int(input())\ns = input()\nx = list(map(int, input().split()))\nt = []\nflag = False\nfor i in range(len(s)-1):\n if s[i]=='R' and s[i+1]=='L':\n t.append(i)\n flag = True\nif flag==False:\n print(-1)\nelse: \n a = []\n for i in t:\n a.append(x[i+1] - x[i])\n print(min(a)//2) ", "n = int(input())\nd = input()\nx = list(map(int, input().split()))\nresult = -1\nfor i in range(1, n):\n if d[i-1] != 'R' or d[i] != 'L':\n continue\n if result == -1:\n result = (x[i]-x[i-1])//2\n else:\n result = min(result, (x[i]-x[i-1])//2)\nprint(result)\n", "n = int(input())\r\ndirection = input()\r\ncoordinates = input().split()\r\ntime = -1\r\nfor i in range(n-1):\r\n if direction[i] == 'R' and direction[i+1] == 'L':\r\n if time == -1:\r\n time = abs(int(coordinates[i]) - int(coordinates[i + 1])) // 2\r\n elif abs(int(coordinates[i]) - int(coordinates[i + 1])) // 2 < time:\r\n time = abs(int(coordinates[i]) - int(coordinates[i + 1])) // 2\r\n\r\nprint(time)\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗\r\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\r\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\r\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\r\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\r\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\n\"\"\"\r\nn = int(input())\r\nt = input()\r\nm = list(map(int, input().split()))\r\nx = float(\"inf\")\r\nif \"RL\" not in t:\r\n\tprint(-1)\r\n\texit()\r\nfor i in range(n - 1):\r\n\tif t[i] == \"R\" and t[i + 1] == \"L\":\r\n\t\tx = min((m[i + 1] - m[i]) // 2, x)\r\nprint(x)\r\n\t\t\r\n\t\t\r\n\r\n\r\n\r\n\r\n\r\n\n", "n,dir,x=int(input()),input(),list(map(int,input().split(\" \")))\r\nMin=-1\r\nfor i in range(len(dir)-1):\r\n if dir[i]==\"R\" and dir[i+1]==\"L\":\r\n Min = min(Min, (x[i+1] - x[i]) / 2) if Min != -1 else (x[i+1] - x[i]) / 2\r\nprint(int(Min))\r\n", "n = int(input())\nd = input()\nx = list(map(int, input().split()))\npossible = False\nmini = float('inf')\nfor i in range(n - 1):\n if d[i] == 'R' and d[i + 1] == 'L':\n possible = True\n dist = x[i + 1] - ((x[i] + x[i + 1]) / 2)\n if dist < mini:\n mini = dist\nprint(int(mini) if possible else -1)", "n = int (input())\r\ndir = input()\r\nnums = list(map(int, input().split()))\r\ndiff =ans=c= 0\r\n\r\nfor i in range(len(dir) -1):\r\n if dir[i] == 'R' and dir[i+1] == 'L':\r\n diff = nums[i+1] - nums[i]\r\n\r\n if c ==0 or c> (diff/2) :\r\n c = (diff/2)\r\n\r\n\r\nif c == 0:\r\n print(-1)\r\nelse:\r\n print(int (c))", "n = int(input())\r\na = list(input())\r\nb = list(map(int,input().split()))\r\nk = 0\r\nx = 0\r\nc = []\r\nd = []\r\ne = []\r\nfor i in range(len(a)-1):\r\n if a[i] == \"R\" and a[i+1] == \"L\":\r\n k = 1\r\n break\r\nif k == 0:\r\n print(-1)\r\nelse:\r\n for i in range(len(a)-1):\r\n if a[i] == \"R\" and a[i+1] == \"L\":\r\n e.append(b[i])\r\n e.append(b[i+1])\r\n d.append(e)\r\n e = []\r\n for i in range(len(d)):\r\n c.append(d[i][1]-d[i][0])\r\n x = c[0]\r\n p = 0\r\n for i in range(1,len(c)):\r\n if c[i] < x:\r\n x = c[i]\r\n p = i\r\n print((d[p][1] - d[p][0])//2)", "n = int(input())\r\nmovement = input()\r\nposition = input()\r\nposition = position.split(' ')\r\narr = []\r\n\r\nif \"RL\" not in movement :\r\n print(-1)\r\nelse :\r\n for i in range(len(movement) -1) :\r\n if movement[i] == \"R\" and movement[i+1] == \"L\" :\r\n n = abs(int(position[i]) - int(position[i+1])) / 2\r\n arr.append(n)\r\n\r\n\r\n arr.sort()\r\n print(int(arr[0]))\r\n", "import math\r\n\r\nn = int(input())\r\ndir = list(input())\r\nx = list(map(int, input().split()))\r\n\r\nans = math.inf\r\nfor i in range(1, n):\r\n if dir[i - 1] == 'R' and dir[i] == 'L':\r\n ans = min(ans, (x[i] - x[i - 1]) // 2)\r\n\r\nif ans == math.inf:\r\n print(-1)\r\nelse:\r\n print(ans)", "n = input()\nn = int(n)\ns = input()\nnum = input()\nnum = list((num.split(' ')))\nif n is 1:\n print(-1)\n exit()\nans = 0x3f3f3f3f\nfor i in range(n-1):\n if s[i] is 'R' and s[i+1] is 'L':\n\t ans = min((int(num[i+1])-int(num[i]))//2,ans)\n\nif ans is 0x3f3f3f3f:\n print(-1)\nelse:\n print(ans)", "\r\nn = int(input())\r\ns = input()\r\nl = list(map(int,input().split()))\r\nd = []\r\n\r\nfor i in range(n-1):\r\n if s[i] == 'R' and s[i+1] == 'L':\r\n t =l[i+1] - l[i]\r\n t =t // 2\r\n d.append(t)\r\n\r\nif d == []:\r\n print(-1)\r\nelse:\r\n print(min(d))\r\n\r\n", "from math import *\r\nn=int(input())\r\ns=list(input())\r\nl=list(map(int,input().split()))\r\nx=-1\r\ny=-1\r\nf=inf\r\nfor i in range(n):\r\n if(s[i]=='R'):\r\n x=i\r\n else:\r\n if(x!=-1):\r\n f=min(f,(l[i]-l[x])//2)\r\nif(f==inf):\r\n print(-1)\r\nelse:\r\n print(f)\r\n", "import sys\nn = int(input())\ndirections = input().strip()\na = list(map(int, sys.stdin.readline().split()))\nans = []\nfor i in range(n-1):\n if directions[i] == 'R' and directions[i+1] == 'L':\n ans.append((a[i+1]-a[i])//2)\nif ans:\n print(min(ans))\nelse:\n print(-1)\n", "n=int(input())\r\n\r\n\r\nt=input()\r\n\r\ns=list(map(int,input().split()))\r\n\r\n\r\nif n==1:\r\n print(-1)\r\nelse:\r\n p=[]\r\n for k in range(n-1):\r\n if t[k]=='R':\r\n if t[k+1]=='L':\r\n p.append((s[k+1]-s[k])//2)\r\n\r\n if len(p)==0:\r\n print(-1)\r\n else:\r\n print(min(p))\r\n\r\n", "import math\r\n \r\n \r\nn = int(input())\r\ns = input()\r\n \r\narr = input().split()\r\n\r\nl = -1\r\nind = 0\r\ncounter = 0\r\n\r\nlen_n = len(s)\r\n\r\nwhile(counter<len_n):\r\n ind = s.find('RL', ind)\r\n counter += 1\r\n if (ind == -1):\r\n break\r\n else:\r\n x = int(arr[ind+1]) + int(arr[ind])\r\n tmp = int(arr[ind+1])-int(x/2)\r\n if l == -1:\r\n l = tmp\r\n if (tmp < l):\r\n l = tmp\r\n ind += 2\r\n\r\n \r\n\r\nprint(l)\r\n\r\n", "import re\nInput=lambda:map(int,input().split())\n\nn = int(input())\ns = input()\nl = list(Input())\n\ns = re.sub(\"RL\",\"??\",s)\ni = 0\nMIN = float('inf')\nwhile i < n:\n if s[i] == '?':\n MIN = min(MIN,(l[i+1]-l[i])//2)\n i+=2\n else:\n i+=1\nprint(MIN if MIN != float('inf') else -1)\n\n", "n = int(input())\nliters = input()\nindex = list(map(int, input().split()))\nout = []\nfor i in range(n - 1):\n if liters[i] == 'R':\n if liters[i + 1] == 'L':\n x = (index[i + 1] - index[i]) / 2\n out.append(x)\n\nif out:\n print(int(min(out)))\nelse:\n print(-1)", "n = int(input())\r\nDirections = input()\r\nPositions = [int(x) for x in input().split()]\r\ntimelist = []\r\n\r\nif 'RL' in Directions:\r\n for i in range (n-1):\r\n if Directions[i] == 'R' and Directions[i+1] == 'L':\r\n time = (Positions[i+1] - Positions[i]) / 2\r\n timelist.append(time)\r\n print(int(min(timelist)))\r\nelse: print(-1)\r\n \r\n \r\n \r\n \r\n", "def solve(p,d,n):\n min_val = 1000000000000\n for i in range(n-1):\n if d[i] == 'R' and d[i] != d[i+1]:\n temp = p[i+1]-(p[i]+p[i+1])//2\n min_val = min(temp, min_val)\n \n if min_val == 1000000000000:\n return -1\n return min_val\n \n\n\n\n\n\ndef main():\n # vars = list(map(int, input().split(\" \")))\n n = int(input())\n d= list(input())\n p = list(map(int, input().split(\" \"))) \n\n # s = input()\n # a = list(map(int, input().split(\" \")))\n # b = list(map(int, input().split(\" \")))\n # c = list(map(int, input().split(\" \")))\n # res = []\n # for _ in range(n):\n # arr = list(map(int, input().split(\" \")))\n # res.append(arr)\n print(solve(p,d,n))\n # i = 0\n # inputpath = 'input.txt'\n # outPath = 'output.txt'\n # with open(inputpath) as fp:\n # line = fp.readline()\n # cnt = 1\n # while line:\n # if cnt == 1:\n # i = int(line)\n # else:\n # arr = list(map(int, line.split(\" \")))\n # res.append(arr) \n # cnt += 1\n # line = fp.readline()\n # s = solve(res,i)\n # with open(outPath, 'a') as out:\n # out.write(str(s))\n\n\nmain()", "\nn = int(input())\n\na = input()\na = list(a)\n\nb = list(map(int,input().split()))\n\nc = [0]*n\n\nres = -1\n\nfor i in range(1,n):\n if a[i-1] == 'R' and a[i] == 'L':\n c[i-1] = int((b[i]-b[i-1])/2)\n if res == -1:\n res = c[i - 1]\n else:\n res = min(res, c[i - 1])\n\nprint(res)\n\n \t \t \t\t \t\t \t\t \t\t \t\t \t\t \t \t \t", "n = int(input())\ns = input()\nl = list(map(int,input().split()))\nmn = 10000000000000\nfor i in range (n-1) :\n if s[i] == \"R\" and s[i+1] ==\"L\" :\n mn = min(mn ,(l[i+1] -l[i])//2 )\nif mn == 10000000000000 :\n print(-1)\nelse :\n print(mn)\n\t \t\t\t \t\t \t\t \t\t \t\t \t \t\t\t", "from sys import stdin, stdout\r\nimport sys\r\nINF=1e11\r\nimport bisect\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\ndef op(c): return stdout.write(c)\r\nfrom collections import defaultdict \r\nimport math\r\n#for _ in range(int(stdin.readline())):\r\nn=get_int()\r\ns=get_string()\r\na=get_array()\r\nans=INF\r\nf=0\r\nfor i in range(n-1):\r\n if s[i]==\"R\" and s[i+1]==\"L\":\r\n f=1\r\n ans=min(ans,(a[i+1]-a[i])//2)\r\nif f==0:\r\n print(-1)\r\nelse:\r\n print(ans)\r\n\r\n\r\n", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nn=int(input())-1\nD=input()\nC=tuple(map(int,input().split()))\nm=INF=0x7fffffff\nfor i in range(n):\n\tif 'R'==D[i] and 'L'==D[1+i]:m=min(m,C[1+i]-C[i])\nprint(m>>1 if INF>m else -1)\n", "def f():\n # n, t = map(int , [_ for _ in input().split()])\n n = int(input())\n s = input()\n e = [int(i) for i in input().split()]\n res = []\n\n if (\"RL\" not in s): return -1\n\n for i in range(n - 1):\n if s[i] == \"R\" and s[i+1] == \"L\":\n res.append((e[i+1] - e[i]) // 2)\n return min(res)\n \n \n\nif __name__ == \"__main__\":\n # for i in range(len(se)):\n print(f())", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\nn = int(input())\r\ns = input()\r\nx = list(map(int, input().split()))\r\n\r\nres = 1000000007\r\nfor i in range(len(s)-1):\r\n a = s[i]\r\n b = s[i+1]\r\n if a == 'R' and b == 'L':\r\n res = min(res, int((x[i+1]-x[i])/2))\r\n\r\nif res >= 1000000007:\r\n print('-1')\r\nelse:\r\n print(res)", "n = int(input())\ns = input()\nlst = list(map(int, input().split()))\nmn=10000000000\nfor i in range(1,n):\n if (s[i] == 'L' and s[i - 1] == 'R'):\n mn = min(mn, (lst[i] - lst[i - 1]) // 2)\nif mn!=10000000000:\n print(mn)\nelse:\n print(-1)\n \t \t \t\t \t \t\t\t\t\t\t\t \t\t", "def main():\r\n n = int(input())\r\n move = input()\r\n pos = list(map(int ,input().split()))\r\n L = []\r\n R = []\r\n for i in range(n):\r\n if move[i] == 'L':\r\n L.append(pos[i])\r\n else:\r\n R.append(pos[i])\r\n i, j = 0, 0\r\n ans = float('inf')\r\n while (i < len(L) and j < len(R)):\r\n if L[i] < R[j]:\r\n i += 1\r\n else:\r\n ans = min(ans, abs((R[j] - L[i]) // 2))\r\n j += 1\r\n if ans == float('inf'): ans = -1\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\ndirec = input()\r\ncoord = [int(x) for x in input().split()]\r\nprev = \"\"\r\nminsf = 1e10\r\nfor i, d in enumerate(direc):\r\n if prev == \"R\" and d == \"L\":\r\n minsf = min(minsf, coord[i] - coord[i-1])\r\n prev = d\r\nprint(-1 if minsf == 1e10 else minsf // 2)\r\n", "n = int(input())\r\nd = input()\r\nx = list(map(int, input().split()))\r\n\r\nans = -1\r\nfor i in range(n-1):\r\n if d[i] == 'R' and d[i+1] == 'L' and x[i] < x[i+1]:\r\n a = (x[i+1] - x[i])/2\r\n if ans == -1:\r\n ans = a\r\n elif a < ans:\r\n ans = a\r\n elif d[i] == 'L' and d[i+1] == 'R' and x[i] > x[i+1]:\r\n a = (x[i] - x[i+1])/2\r\n if ans == -1:\r\n ans = a\r\n if a < ans:\r\n ans = a\r\n\r\nprint(int(ans))\r\n", "n=int(input());s=str(input())\r\narr=list(map(int,input().rstrip().split()))\r\no=-1;count=1000000000\r\nfor e in range(n):\r\n if s[e]=='R':o=e\r\n elif s[e]=='L' and o!=-1:count=min((arr[e]-arr[o])//2,count);o=-1\r\nif count==1000000000:print(-1)\r\nelse:print(count)", "n = int(input())\r\nstl = False\r\nrl = input()\r\nx = [int(x) for x in input().split()]\r\nt = 10**9 + 1\r\nfor i in range(n - 1):\r\n if (rl[i] == 'R') and (rl[i + 1] == 'L'):\r\n stl = True\r\n t = min(t, abs(x[i + 1] - x[i]) // 2)\r\n\r\nif stl:\r\n print(t)\r\nelse:\r\n print(-1)", "n=int(input())\r\ns=input()\r\narr=list(map(int,input().split()))\r\nans=10e9\r\nflag=False\r\nfor i in range(n-1):\r\n if s[i]=='R' and s[i+1]=='L':\r\n flag=True\r\n x=abs(arr[i]-arr[i+1])//2\r\n ans=min(x,ans) \r\nprint(ans if flag==True else -1)\r\n\r\n", "n = int(input())\r\nd = list(input())\r\nk = []\r\nm = 1000000001\r\nk = [int(i) for i in input().split()]\r\nfor i in range(n-1):\r\n if d[i] == 'R' and d[i+1] == 'L':\r\n if abs((k[i] - k[i+1])//2) < m:\r\n m = abs((k[i] - k[i+1])//2)\r\nif m == 1000000001:\r\n print(-1)\r\nelse:\r\n print(m)", "class particle:\r\n x=0\r\n o=''\r\nn=int(input())\r\nst=input()\r\nlt=[]\r\nfor i in range(len(st)):\r\n a=particle()\r\n a.o=st[i]\r\n lt.append(a)\r\nst=input()\r\ntmp=st.split(' ')\r\ndir={'R':1,'L':-1}\r\nfor i in range(len(tmp)):\r\n lt[i].x=int(tmp[i])\r\nminn=-1\r\nfor i in range(len(lt)-1):\r\n if dir[lt[i].o]<=dir[lt[i+1].o]:\r\n pass \r\n else:\r\n t=abs(lt[i].x-lt[i+1].x)/2\r\n if minn<0 or minn>t:\r\n minn=t\r\nprint(int(minn))\r\n \r\n", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n#A - Launch of Collider\r\nn = int(input())\r\ndirs = input()\r\nvalues = [int(x) for x in input().split()]\r\nall_val = []\r\nk = 0 #represent number of millsecond\r\nfor i in range(len(dirs)-1):\r\n if dirs[i] == \"R\" and dirs[i+1] == \"L\": #the only condition collision will happen\r\n #collision will happen\r\n k = (values[i+1] - values[i]) //2\r\n all_val.append(k)\r\n\r\nif len(all_val) == 0:\r\n print(-1)\r\nelse:\r\n print(min(all_val))\r\n", "n = int(input())\r\ndirection = input()\r\nparticles = list(map(int, input().split()))\r\ntime = 1e9\r\nfor i in range(n - 1):\r\n if direction[i] == 'R' and direction[i + 1] == 'L':\r\n time = min(time, (particles[i + 1] - particles[i]) // 2)\r\nif time == 1e9:\r\n print(-1)\r\nelse:\r\n print(time)", "n = int(input())\r\ndir = list(input())\r\ncoord = input().strip().split(' ')\r\ncoord = [int(c) for c in coord]\r\nflag = 0\r\ntmin = 10**9\r\nfor i in range(n-1):\r\n if dir[i]=='R' and dir[i+1]=='L':\r\n flag = 1\r\n tmin = min(tmin, (coord[i+1]-coord[i])//2)\r\nif flag:\r\n print(tmin)\r\nelse:\r\n print(-1)\r\n \r\n ", "n = int(input())\r\n\r\ns = str(input())\r\n\r\na = list(map(int , input().split()))\r\nminv = 100000000000\r\nfor el in range(n - 1):\r\n if(s[el] == 'R' and s[el + 1] == 'L'):\r\n minv = min((a[el+1] - a[el])//2 , minv)\r\n \r\nif(minv == 100000000000):\r\n print(-1)\r\nelse:\r\n print(minv)", "from sys import stdin\r\nn =int(input())\r\nstr = stdin.readline()\r\narr = list(map(int,stdin.readline().split()))\r\nr = neg = -1\r\np = 0\r\nfor i in range(n-1):\r\n if(str[i] == 'R' and str[i+1] == 'L'):\r\n r = int(( arr[i+1] - arr[i]) / 2)\r\n if(p == 0 or p > r):\r\n p = r\r\n\r\n\r\nif(r == -1):\r\n print(\"-1\")\r\nelse:\r\n print(p)", "x=int(input())\r\nn=input()\r\nm=list(map(int,input().split()))[:x]\r\nar=[]\r\ns=0\r\nmini=1000000000000000000\r\nfor i in n:\r\n ar.append(i)\r\nfor j in range(0,x-1):\r\n if(ar[j]==\"R\" and ar[j+1]==\"L\"):\r\n s=(m[j+1]-m[j])//2\r\n mini=min(mini,s)\r\nif(s):\r\n print(mini)\r\nelse:\r\n print(\"-1\")\r\n \r\n", "n,k = int(input()),input()\r\nl = list(map(int,input().split()))\r\nh = [(l[i+1]-l[i])//2 for i in range(n-1) if k[i]=='R' and k[i+1]=='L' ]\r\nif len(h)==0:print(-1)\r\nelse:print(min(h))", "n=int(input())\r\np=list(input())\r\nnop=list(map(int,input().split()))\r\nro=[]\r\nfor x in range(n-1):\r\n if p[x]==\"R\":\r\n if p[x+1]==\"L\":\r\n ro.append(nop[x+1]-nop[x])\r\n else:\r\n pass\r\n else:\r\n pass\r\nif ro==list():\r\n print(-1)\r\nelse:\r\n print(min(ro)//2)", "import re\r\n\r\ndef calcMoments (r , l):\r\n return (l - r) / 2\r\n\r\n\r\nmoment = 0\r\nmany = int(input()) # 7\r\ndirline = input() # RLLRRLR, R -> ++ L-> --\r\ncoor = [int(x) for x in input().split()] # 2 4 6 10 , even, increasing order 2 4 6 16\r\n\r\nclosest = -1\r\nRpos = [m.start() for m in re.finditer('R', dirline)] #[0, 3, 4, 6]\r\nindex = 0\r\nonce = True\r\nexpect = False\r\nlst = list()\r\nfor r in Rpos:\r\n if r == len(dirline)-1: break\r\n if index+1 < len(Rpos) and r == Rpos[index+1]-1:\r\n index = index +1\r\n continue\r\n index = index +1\r\n expect = True # lst.append((r, r+1))\r\n if once:\r\n closest = calcMoments(coor[r], coor[r+1])\r\n once = False\r\n if calcMoments(coor[r], coor[r+1]) < closest:\r\n closest = calcMoments(coor[r], coor[r+1])\r\n \r\nif not expect:\r\n print(-1)\r\nelse:\r\n print(int(closest))\r\n", "n = int(input())\r\ndirections = input()\r\npositions = [int(i) for i in input().split()]\r\nres = 1000000000\r\n\r\nfor i in range(n - 1):\r\n if directions[i] == 'R' and directions[i + 1] == 'L':\r\n if (positions[i + 1] - positions[i]) // 2 < res:\r\n res = (positions[i + 1] - positions[i]) // 2\r\n\r\nprint(-1 if res == 1000000000 else res)\r\n", "n = int(input())\r\nmoves = input()\r\ndist = list( map(int, input().split()) )\r\npossible = False\r\nfirst = True\r\ntime = 0\r\n\r\nfor i in range(1, n):\r\n if moves[i] == 'L' and moves[i-1] == 'R':\r\n possible = True\r\n if first:\r\n time = int((dist[i]-dist[i-1])/2)\r\n first = False\r\n else:\r\n time = min(time, int((dist[i]-dist[i-1])/2))\r\n\r\nif n == 1 or not possible:\r\n print(-1)\r\nelse:\r\n print(time)\r\n", "n = int(input())\ns = input()\nans = 1000000000\nflag = False\narr = list(map(int,input().split()))\nfor i in range(n-1):\n if s[i] == 'R' and s[i+1] == 'L':\n ans = min(ans, ((arr[i+1] - arr[i])/2))\n flag = True\n\nif flag:\n print(int(ans))\nelse:\n print(-1)\n\t \t \t\t\t\t\t\t \t\t\t\t \t \t \t\t\t\t \t", "def collisions():\r\n n = int(input())\r\n directions = input()\r\n positions = list(map(int, input().split()))\r\n \r\n particles = list(zip(positions, directions))\r\n time = []\r\n \r\n for i in range(0, n-1):\r\n p1 = particles[i]\r\n p2 = particles[i+1]\r\n if p1[1] == p2[1] or (p1[1] == 'L' and p2[1] == 'R'):\r\n time.append(-1)\r\n else:\r\n time.append(int((p2[0] - p1[0])/2))\r\n min_collide = min([t for t in time if t != -1], default=-1)\r\n return min_collide\r\nprint(collisions()) ", "n = int(input())\r\nsr = input()\r\nans = 10**9\r\narr = list(map(int,input().split()))\r\nfor i in range(n-1):\r\n m = arr[i+1]-arr[i]\r\n if sr[i+1]==\"L\" and sr[i]==\"R\":\r\n temp = m//2\r\n if temp < ans:\r\n ans=temp\r\nif ans!=10**9:\r\n print(ans)\r\nelse:\r\n print(\"-1\")", "n = int(input())\r\narr = [[0, ''] for i in range(n)]\r\na = input()\r\nb = [int(i) for i in input().split()]\r\nfor i in range(len(a)):\r\n arr[i][1] = a[i]\r\nfor i in range(len(b)):\r\n arr[i][0] = b[i]\r\narr = sorted(arr)\r\nres = 2e9\r\nfor i in range(n-1):\r\n if arr[i][1] == 'R' and arr[i+1][1] == 'L':\r\n res = min(res, (arr[i+1][0] - arr[i][0]) // 2)\r\nprint(-1 if res == 2e9 else res)\r\n", "n=int(input())\r\nS=input()\r\nl=list(map(int,input().split()))\r\nma=10000000000\r\nfor i in range(1,n) :\r\n if S[i-1]=='R' and S[i]=='L' :\r\n if ma>abs(l[i]-l[i-1])//2 :\r\n ma=abs(l[i]-l[i-1])//2\r\nif ma==10000000000 :\r\n print(-1)\r\nelse :\r\n print(ma)\r\n", "n=int(input())\r\ns=input()\r\narr=list(map(int,input().split()))\r\nseco=[]\r\nx=s.find(\"RL\")\r\nif x==-1:\r\n print(-1)\r\nelse:\r\n seco.append((arr[x+1]-arr[x])//2)\r\n for i in range(n):\r\n x=s.find(\"RL\",x+1)\r\n if x==-1:\r\n print(min(seco))\r\n break\r\n seco.append((arr[x+1]-arr[x])//2)\r\n ", "n = int(input())\r\nt = input()\r\nz = float('inf')\r\nlist1 = list(map(int,input().split()))\r\nfor i in range(1,n):\r\n\tif t[i-1] == \"R\" and t[i] == \"L\":\r\n\t\tk = (list1[i]-list1[i-1])//2\r\n\t\tz = min(z,k)\r\nif z == float(\"inf\"):\r\n\tprint(-1)\r\nelse:\r\n\tprint(z)", "n = int(input())\r\nmove = input()\r\npos = list(map(int, input().split(' ')))\r\n\r\nmin_monent = 1e20\r\n\r\nfor i in range(1, n):\r\n\r\n if move[i] == move[i-1] or (move[i-1] == 'L' and move[i] == 'R'):\r\n continue\r\n else:\r\n middle = (pos[i] + pos[i-1]) / 2\r\n time = max(pos[i], pos[i-1]) - middle\r\n min_monent = min(min_monent, time)\r\n\r\nif min_monent == 1e20:\r\n print(-1)\r\nelse:\r\n print(int(min_monent))", "a=int(input())\r\nb=input()\r\nc=list(map(int,input().split()))\r\ns=[]\r\n\r\nfor i in range(a-1):\r\n if b[i]=='R' and b[i+1]=='L':\r\n s.append((int(c[i+1])-int(c[i])))\r\n \r\nif len(s)==0:\r\n print(-1)\r\nelse:\r\n print((min(s)//2))\r\n \r\n", "lst=[]\r\nz=int(input())\r\nx=list(map(str,input()))\r\nc=list(map(int,input().split()))\r\nfor v in range(z-1):\r\n if x[v]=='R':\r\n if x[v+1]=='L':\r\n b=(c[v+1]-c[v])//2\r\n lst.append(b)\r\nif len(lst)!=0:\r\n print(min(lst))\r\nelse:\r\n print(-1) ", "n = int(input())\r\nd = input()\r\n*s, = map(int,input().split(' '))\r\nleast_time = None\r\nfor i in range(n-1):\r\n d1 = d[i]\r\n d2 = d[i+1]\r\n if d1==d2 or d1=='L':\r\n continue\r\n s1 = s[i]\r\n s2 = s[i+1]\r\n t12 = (s2-s1) // 2\r\n \r\n if(least_time==None or least_time > t12):\r\n least_time = t12\r\n if t12==1:\r\n break\r\nif(least_time==None):\r\n print(-1)\r\nelse:\r\n print(least_time)", "n = int(input())\r\nd = input()\r\np = list(map(int,input().split()))\r\nm=max(p)\r\nf=0\r\nfor i in range(n-1):\r\n if(d[i]=='R' and d[i+1]=='L'):\r\n s=(p[i]+p[i+1])//2 - p[i]\r\n if(s<m):\r\n m=s\r\n f=1\r\nif(f==0): \r\n print(-1)\r\nelse:\r\n print(m)", "n = input()\npcls = input()\npos = list(map(int, input().split()))\nleast = None\ntemp = 0\n\nif \"RL\" not in pcls:\n print(-1)\n\nelse:\n for i in range(1, len(pcls)):\n\n if pcls[i] == \"L\" and pcls[temp] == \"R\":\n time = (pos[i] - pos[temp]) // 2\n \n if least == None:\n least = time\n elif least > time:\n least = time\n\n temp = i\n print(least)", "n = int(input())\ndirs = input()\nparticles = list(map(int,input().split()))\nmini = None\nfor i in range(1,n):\n if dirs[i] == 'L' and dirs[i-1] == 'R' :\n cur = (particles[i]-particles[i-1])//2\n if not mini :\n mini = cur\n continue\n mini = min(mini,cur)\nprint(mini if mini else -1)", "n=int(input())\r\ndir=input()\r\nl=list(map(int,input().split()))\r\nmin=max(l)\r\nf=0\r\nfor i in range(n-1):\r\n if(dir[i]=='R' and dir[i+1]=='L'):\r\n f=1\r\n a=(l[i+1]-l[i])//2\r\n if(a<min):\r\n min=a\r\nif(f==0):\r\n print(-1)\r\nelse:\r\n print(min)", "n = int(input())\r\nword = input()\r\nnumbers = [int(i) for i in input().split()]\r\ndistances = []\r\nfor pos in range(len(numbers)-1):\r\n distances.append(numbers[pos+1]-numbers[pos])\r\n \r\nsecond_positions = []\r\nfor pos in range(len(numbers)):\r\n if word[pos]==\"L\":\r\n second_positions.append(numbers[pos]-1)\r\n else:\r\n second_positions.append(numbers[pos]+1)\r\n\r\n\r\nsecond_distances = []\r\nfor pos in range(len(second_positions)-1):\r\n second_distances.append(second_positions[pos+1]-second_positions[pos])\r\n\r\nflag = False\r\nfor pos in range(len(distances)):\r\n if distances[pos]>second_distances[pos]:\r\n flag = True\r\n\r\nif not(flag):\r\n print(-1)\r\nelse:\r\n pos_list = []\r\n difference_list = []\r\n for pos in range(len(distances)):\r\n if distances[pos]>second_distances[pos]:\r\n pos_list.append(pos)\r\n difference_list.append(numbers[pos+1]-numbers[pos])\r\n position = difference_list.index(min(difference_list))\r\n final = pos_list[position]\r\n print(int((numbers[final+1]-numbers[final])/2))", "n = int(input())\r\ns = input()\r\na = []\r\na[:0] = s\r\nall = list(map(int, input().split(\" \")))\r\n\r\nhigh = 10**9\r\n\r\nfor i in range(n - 1):\r\n if a[i] == 'R' and a[i + 1] == 'L':\r\n high = min(high, (all[i + 1] - all[i]) // 2)\r\n\r\nif high == 10**9:\r\n print(-1)\r\nelse:\r\n print(high)", "def find_first_collision(n, directions, positions):\r\n collision_time = float('inf')\r\n\r\n for i in range(n - 1):\r\n if directions[i] == 'R' and directions[i + 1] == 'L':\r\n collision_time = min(collision_time, (positions[i + 1] - positions[i]) // 2)\r\n\r\n return collision_time if collision_time != float('inf') else -1\r\n\r\n# Read input\r\nn = int(input())\r\ndirections = input().strip()\r\npositions = list(map(int, input().split()))\r\n\r\n# Find the first collision\r\nresult = find_first_collision(n, directions, positions)\r\nprint(result)\r\n\r\n\r\n\r\n", "n=int(input())\r\na=input()\r\nc=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(n-1):\r\n if a[i]=='R' and a[i+1]=='L':\r\n b.append(i)\r\nif len(b)==0:\r\n print(-1)\r\nelse:\r\n min=max(c) \r\n for i in b:\r\n x=c[i+1]-c[i]\r\n if x<min:\r\n min=x\r\n print(min//2) ", "n = int(input())\r\nseq = list(input())\r\npar = [int(x) for x in input().split()]\r\ntime = par[-1] - par[0]\r\ni = par[-1] - par[0]\r\nfor p in range(n):\r\n if seq[p] == \"R\" and p != n-1 and seq[p+1] == \"L\":\r\n g = (par[p+1]-par[p])//2\r\n if g < time:\r\n time = g\r\nprint(time if time != i else -1)\r\n", "n,s,nums = int(input()),input(),list(map(int,input().split()))\r\nr,l,z = None,None,-1\r\nfor i in range(0,n):\r\n if s[i] == \"R\": r = nums[i]\r\n elif s[i] == \"L\" and r != None:\r\n if z > 0: z = min(z,abs(r-nums[i])//2)\r\n else: z = abs(r-nums[i])//2\r\nprint(z)", "import math\r\nn=int(input())\r\na=input()\r\nb=list(map(int,input().split()))\r\nt=10**10\r\nflag=0\r\nfor i in range(n-1):\r\n if(a[i]==\"R\" and a[i+1]==\"L\"):\r\n c=(b[i+1]-b[i])/2\r\n t=min(t,math.ceil(c))\r\n flag=1\r\nif(flag==0):\r\n print(-1)\r\nelse:\r\n print(t)\r\n", "import math\nn=int(input())\nlr=input()\nt=list(map(int,input().split()))\np=[]\np.append(-1)\nfor i in range(1,len(lr)):\n if lr[i]=='L' and lr[i-1]=='R':\n p.append(int(math.ceil(abs(t[i]-t[i-1]))/2))\nif len(p)>1:\n p.remove(-1)\nprint(min(p))\n\t \t \t\t \t\t \t\t\t \t\t \t\t \t \t", "from sys import stdin\r\nn = int(stdin.readline())\r\ns = stdin.readline()[:-1]\r\na = list(map(int, stdin.readline().split()))\r\nmin_val = None\r\nfor i in range(n-1):\r\n if s[i] == 'R' and s[i+1] == 'L':\r\n val = abs(a[i] - a[i+1])//2\r\n if not min_val:\r\n min_val = val\r\n min_val = min(min_val, val)\r\n \r\nif not min_val:\r\n print(-1)\r\nelse:\r\n print(min_val)", "def collisions():\r\n n = int(input())\r\n directions = input()\r\n positions = list(map(int, input().split()))\r\n \r\n time = []\r\n \r\n for i in range(0, n-1):\r\n if directions[i] == directions[i+1] or (directions[i] == 'L' and directions[i+1] == 'R'):\r\n continue\r\n else:\r\n time.append(abs(int((positions[i] - positions[i+1]) / 2)))\r\n return (min(time) if len(time) else -1)\r\nprint(collisions()) ", "n = int(input())\r\nd = input().strip()\r\np = [*map(int, input().strip().split())]\r\nif 'RL' not in d:\r\n print(-1)\r\nelse:\r\n di = iter(d)\r\n t = 2e9\r\n i = 0\r\n for _ in di:\r\n if d[i : i + 2] == 'RL':\r\n t = min(t, (p[i + 1] - p[i]) // 2)\r\n next(di)\r\n i += 1\r\n i += 1\r\n print(t)", "def main():\r\n num = int(input())\r\n directions = input()\r\n locations = list(map(int, input().split()))\r\n min_time = None\r\n for i in range(num - 1):\r\n if directions[i] == \"R\" and directions[i+1] == \"L\":\r\n time = (locations[i+1] - locations[i]) // 2\r\n if min_time is None or time < min_time:\r\n min_time = time\r\n\r\n if min_time is None:\r\n print(-1)\r\n else:\r\n print(min_time)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "cases = int(input())\r\ndirections = [i for i in input()]\r\narray = [int(i) for i in input().split()]\r\ncount = -1\r\nfor i in range(1, cases):\r\n if directions[i] == 'L' and directions[i-1] == 'R':\r\n if array[i] - array[i-1] < count or count == -1:\r\n count = array[i] - array[i-1]\r\nif count == -1:\r\n print(count)\r\nelse:\r\n print(int(count/2))\r\n", "z = []\r\nn = int(input())\r\nx = input()\r\ny = list(map(int, input().split()))\r\nfor i in range(0, n-1):\r\n if x[i] == \"R\" and x[i+1] == \"L\":\r\n z.append(y[i+1]-y[i])\r\nif len(z) == 0:\r\n print(-1)\r\nelse:\r\n print(int(min(z)/2))\r\n", "n = int(input())\ns = input()\nlst = list(map(int, input().split()))\nf = False\nans = 1000000000\nfor i in range(n-1):\n if s[i] == 'R' and s[i+1]== 'L':\n f = True\n ans = min(ans, ((lst[i+1] - lst[i])/2))\nif f:\n print(int(ans))\nelse:\n print(-1)\n\n\n\t\t\t\t\t \t\t\t \t\t\t \t\t\t\t\t \t", "n = int(input())\r\nr = input()\r\ns = [int(i) for i in input().split()]\r\nc = 10**9+1\r\n\r\nif r.count(\"RL\"):\r\n\tfor i in range(n-1):\r\n\t\tif r[i]==\"R\" and r[i+1]==\"L\":\r\n\t\t\tc = min(((s[i+1]-s[i])//2),c)\r\n\tprint(c)\r\nelse:\r\n\tprint(-1)\r\n", "n=int(input())\r\ns=input()\r\nm=10**17\r\nl=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n if s[i]!=s[i+1]:\r\n if s[i+1]!='R':\r\n m=min(m,(l[i+1]-l[i])//2)\r\nif (m==10**17):\r\n m=-1\r\nprint(m)\r\n ", "n = int(input())\r\ndirections = input()\r\npositions = [int(c) for c in input().split()]\r\n\r\ncollisions = []\r\nfor i in range(len(directions) - 1):\r\n if directions[i] == 'R' and directions[i + 1] == 'L':\r\n collisions.append((positions[i+1] - positions[i]) // 2)\r\n\r\nif not collisions:\r\n print(-1)\r\nelse:\r\n print(min(collisions))\r\n", "n=int(input())\ns=input()\na=list(map(int,input().split()))\nans=[a[i+1]-a[i] for i in range(n-1) if s[i]=='R' and s[i+1]=='L']\nif ans:\n print(min(ans)//2)\nelse:\n print(-1)\n", "n=int(input())\r\nw=input()\r\np=input().split()\r\nb=[]\r\nfor i in range(len(w)-1):\r\n\tif w[i]=='R':\r\n\t\tif w[i+1]=='L':\r\n\t\t\tb.append((int(p[i+1])-int(p[i]))//2)\r\n\r\nb.sort()\r\nif len(b)>0:\r\n\tprint(b[0])\r\nelse:\r\n\tprint(-1)" ]

[ "import time\r\ntime.sleep(0.99)\r\nprint(sum([int(i) for i in input().split()]))", "b = input().split()\r\na = int(b[0])\r\n\r\nc = int(b[1])\r\nprint(a+c)", "a , b = input().split()\r\nprint (int(a) + int(b))", "x = input().split()\r\nprint((int(x[0])+int(x[1])))", "a,n=map(int,(input()).split())\r\nprint(a+n)", "s=input().split()\r\nprint(int(s[0])+int(s[1]))", "arr_foking = list(map(int, input().split(\" \")))\r\n#\r\n#\r\n#\r\nif 1:\r\n print(sum(arr_foking))\r\n#\r\n#\r\n#", "n, b = [int(i) for i in input().split()]\r\nprint(n + b)\r\n\r\n\r\n \r\n \r\n\r\n", "# LUOGU_RID: 97543226\nprint(sum(list(map(int,input().split()))))", "p = input().split()\r\no = 0\r\nfor l in p:\r\n o += int(l)\r\nprint(o)", "s=input().split()\na=int(s[0])\nb=int(s[1])\nprint(a+b)", "a7=list(map(int,input().split()))\r\nprint(sum(a7))\r\n", "a,b = (input()).split()\r\nl = int(a)\r\nq = int(b)\r\nprint(q+l)\r\n\r\n", "(i_hate_aubrey,i_hate_aubrey_so_much)= map(int,input().split())\r\nprint(i_hate_aubrey+i_hate_aubrey_so_much,end=\"\")", "from sys import stdin\r\n\r\ninput=stdin.readline\r\nprint(sum(list(map(int,input().split()))))", "c = (sum(list(map(int,input().split()))))\r\nprint(c)", "a,b=list(map(int,input().split()))\r\nprint (a+b)", "a,b=map(int,input().split(\" \"))\r\nb+=a\r\nprint(b)\r\n", "k,l = input().split()\r\nx = int(k)+int(l)\r\nprint(x)\r\n", "a,t=map(int,input().split())\r\nprint(a+t)", "#your gonna pay for this \r\na,b= map(int,input().split(' '))\r\nprint(a+b)", "def func():\n a, b = map(int, input().split())\n print(a+b)\n\n # if curr mod 2:\n # print(\"YES\")\n # else:\n # print(\"NO\")\n\n\ndef main():\n func()\n # count = int(input())\n # while count > 0:\n # func()\n # count -= 1\n\n\nmain()\n\n\t \t\t\t \t \t \t \t\t\t\t \t\t\t \t\t", "a=[int(i) for i in input().split()]\nprint(a[0]+a[1])", "a,b = [int(i) for i in input().split()]\nprint (a+b)", "inp = input().split()\r\na = int(inp[0])\r\nb = int(inp[1])\r\nprint(a+b)", "import math\na=input().split()\nprint(int(a[0])+int(a[1]))", "a,b=map(int,input().split())\r\nc=a+b\r\nprint(c)\r\n# finally done...\r\n#dedicated to Ghumpori,ritu di,masum,R.D", "import sys, collections, heapq, math, functools\r\nreadline = sys.stdin.readline\r\nc, b = map(int, readline().split())\r\nprint(c + b)", "n,m=[int( v) for v in input().split()]\r\nprint(n+m)", "s=input().split()\nprint(int(s[0])+int(s[1]))", "a=list(map(int,input().split()))\nprint(a[1]+a[0])", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-04 23:18:13\nLastEditTime: 2021-11-04 23:19:34\nDescription: \nFilePath: CF409H.py\n'''\n\n\ndef func():\n return(sum(map(int, input().strip().split())))\n\n\nif __name__ == '__main__':\n ans = func()\n print(ans)\n", "# Bismillahir Rahmanir Rahim\r\n# cf-409H\r\n\r\nprint(sum(map(int,input().split())))", "a, q = map(int,input().split())\r\nprint(a+q)", "a,b=map(int,input().split(' '))\r\nc=a+b\r\nprint(c)", "a,b=map(int,input().split())\r\nc=5\r\nprint(a+b)", "a, c = map(int, input().split())\r\nprint(a + c)", "# LUOGU_RID: 96973952\nprint(sum(list(map(int,input().split()))))", "nums = input().split(\" \")\nprint(int(nums[0]) + int(nums[1]))", "a=input().split()\na[0]=int(a[0])\na[1]=int(a[1])\nprint(a[0]+a[1])", "print(sum(map(int, input().split())), end='')\r\n", "e=(sum(map(int,input().split())))\r\nprint(e)", "z=list(map(int,input().split()))\r\nprint(sum(z))", "X,Y = map(int,input().split());print(X+Y)", "aa,bb=map(int,input().split(\" \"))\r\nprint(sum([aa,bb]))", "x=input().split()\r\ne=int(x[0])\r\nz=int(x[1])\r\nprint(e+z)", "i,j = map(int,input().split())\r\nprint(i+j)", "import sys\nimport os\nimport heapq\nfrom heapq import heapify\nfrom math import ceil, floor\n\n\n\n# Priority Queue\n\n\n\n# bundle ===================================\n\ndef debug(*args):\n return\n print(*args)\n\n\ndef is_even(num):\n return num % 2 == 0\n\n\ndef is_odd(num):\n return num % 2 != 0\n\n\ndef assert_result(input_case, output_case, actual_result):\n if actual_result != output_case:\n print(\"error\")\n print(\"input:\", input_case, \"actual:\", actual_result, \"expected:\", output_case)\n exit(1)\n return\n\n\ndef expect(*input_case, output_case, ):\n actual_result = solve_case(*input_case)\n assert_result(input_case, output_case, actual_result)\n\n\ndef get_at_or_null(elements, index):\n if index < 0 or index >= len(elements):\n return None\n return elements[index]\n\n\ndef read_lines():\n filename = \"./input.txt\"\n\n if os.path.exists(filename):\n # read from file\n with open(filename, 'r') as f:\n lines = f.readlines()\n else:\n # read from stdin\n lines = sys.stdin.readlines()\n return [line.rstrip('\\n') for line in lines]\n\n\n# end bundle ===================================\n\n\ndef solve_case(K):\n costAll = 0\n return costAll\n\n\n_i = 0\nlines = []\ndef next():\n global _i\n line = lines[_i]\n _i += 1\n return line\n\ndef toBinary(a):\n l,m=[],[]\n for i in a:\n l.append(ord(i))\n for i in l:\n m.append(int(bin(i)[2:]))\n return m\ndef solve():\n lines = read_lines()\n\n for l in lines:\n a, b = map(int, l.split(\" \"))\n print(a + b)\n\n\n\nif __name__ == '__main__':\n # test()\n solve()\n\n \t \t \t\t \t \t\t \t\t \t \t \t\t\t\t\t", "a,b =[int(aaa) for aaa in input().split()]\r\ns4 = a+b\r\nprint(s4)", "a1,b1 = map(int,input().split())\r\na = int(a1)\r\nb = int(b1)\r\nprint(a+b)", "a,l=map(int,input().split())\r\nprint(a+l)", "a,b2014=map(int,input().split())\r\nprint(a+b2014)", "(i_hate_aubrey,i_hate_so_much_aubrey) = map(int,input().split())\r\nprint(i_hate_aubrey+i_hate_so_much_aubrey,end=\"\")\r\n", "from sys import stdin,stdout\n\na,b = stdin.readline().split()\na = int(a)\nb = int(b)\n\nc = a + b\n\nprint(c)\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\nprint(N + M, end=\"\")", "# LUOGU_RID: 113829936\nprint(sum([int(_) for _ in input().split(\" \")]))", "# LUOGU_RID: 115656114\na = input().split()\nprint(int(a[0])+int(a[1]))", "#This should work, stupid contest!!!\r\na,b = map(int, input().split())\r\nprint(a + b)", "a=input()\na=a.split(' ')\nb=int(a[0])\nc=int(a[1])\nprint(b+c)", "# LUOGU_RID: 96973994\nprint(sum(list(map(int,input().split()))))", "g=list(input(\"\").split(\" \"))\r\nprint(int(g[0])+int(g[1]))", "print((c := list(map(int, input().split())))[0] + c[1])\n", "\r\n#yeah bitch-- I am jessy pinkman\r\n# I make Blue Math with Mr. WHite.\r\n\r\na,b=map(int,input().split())\r\nprint(a+b)\r\n", "a,b = map(int,input().split())\r\nw = a + b \r\nprint(w) ", "a, b = map(int, input().split(' '))\r\np = a + b\r\nprint(p)", "a = input().split()\r\n\r\nans = int(a[0]) + int(a[1])\r\n\r\nprint(str(ans))\r\n\r\n\r\n", "n=input().split()\nprint(int(n[0])+int(n[1]))", "a,b=input().strip().split()\na=int(a)\nb=int(b)\nprint(a+b)", "y = input()\r\nprint(int(y.split()[0]) + int(y.split()[1]))", "#https://codeforces.com/problemset/problem/409/H\r\n#1500分\r\n\r\narr5 = list(map(int, input().split()))\r\nprint(arr5[0] + arr5[1])", "# LUOGU_RID: 121212579\nprint(sum(map(int,input().split())))", "# LUOGU_RID: 110588949\nn = input().split(' ')\nprint(int(n[0])+int(n[1]))" ]

[ "import bisect\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef f(u, v):\r\n return u * z + v\r\n\r\ndef update(i, x):\r\n i += l1\r\n tree[i] = x\r\n i //= 2\r\n while i:\r\n tree[i] = max(tree[2 * i], tree[2 * i + 1])\r\n i //= 2\r\n return\r\n \r\ndef get_max(s, t):\r\n s, t = s + l1, t + l1\r\n ans = 0\r\n while s <= t:\r\n if s % 2 == 0:\r\n s //= 2\r\n else:\r\n ans = max(ans, tree[s])\r\n s = (s + 1) // 2\r\n if t % 2 == 1:\r\n t //= 2\r\n else:\r\n ans = max(ans, tree[t])\r\n t = (t - 1) // 2\r\n return ans\r\n\r\nn, m = map(int, input().split())\r\nabw = [tuple(map(int, input().split())) for _ in range(m)]\r\nz = pow(10, 5) + 5\r\ns = []\r\nfor a, b, w in abw:\r\n s.append(f(b, w))\r\ns = list(set(sorted(s)))\r\ns.sort()\r\nl = len(s)\r\nd = dict()\r\nfor i in range(l):\r\n d[s[i]] = i\r\nl1 = pow(2, (l + 1).bit_length())\r\nl2 = 2 * l1\r\ntree = [0] * l2\r\nfor a, b, w in abw:\r\n l0 = bisect.bisect_left(s, f(a, 0))\r\n r0 = bisect.bisect_left(s, f(a, w)) - 1\r\n update(d[f(b, w)], max(get_max(l0, r0) + 1, tree[d[f(b, w)] + l1]))\r\nans = tree[1]\r\nprint(ans)" ]

[ "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef insert(x, la):\r\n j = 0\r\n for i in p:\r\n if x & i:\r\n if not G[j] >> 25:\r\n la += 1\r\n G[j] ^= la << 25\r\n j = la\r\n else:\r\n j = G[j] >> 25\r\n else:\r\n if not G[j] & 33554431:\r\n la += 1\r\n G[j] ^= la\r\n j = la\r\n else:\r\n j = G[j] & 33554431\r\n cnt[j] += 1\r\n return la\r\n\r\ndef cnt_xor_max(x, k):\r\n ans, j = 0, 0\r\n for i in p:\r\n if x & i:\r\n if not k & i:\r\n ans += cnt[G[j] & 33554431]\r\n j = G[j] >> 25\r\n else:\r\n j = G[j] & 33554431\r\n else:\r\n if not k & i:\r\n ans += cnt[G[j] >> 25]\r\n j = G[j] & 33554431\r\n else:\r\n j = G[j] >> 25\r\n if not j:\r\n return ans\r\n return ans\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nG, cnt = [0] * 30000000, [0] * 30000000\r\nl, la = 30, 0\r\npow2 = [1]\r\nfor _ in range(l):\r\n pow2.append(2 * pow2[-1])\r\np = pow2[::-1]\r\nla = insert(0, la)\r\nans, u = 0, 0\r\nfor i in a:\r\n u ^= i\r\n ans += cnt_xor_max(u, k - 1)\r\n la = insert(u, la)\r\nprint(ans)" ]

[ "# Enter your code here. Read input from STDIN. Print output to STDOUT\nimport math\n\nif __name__ == '__main__':\n a = input().strip()\n b = input().strip()\n c = []\n swap = False\n sc = 0\n for x, y in zip(a, b):\n \tif x == y:\n \t\tc.append(x)\n \telse:\n \t\tif swap:\n \t\t\tc.append(y)\n \t\telse:\n \t\t\tc.append(x)\n \t\tswap = not swap\n \t\tsc += 1\n if sc % 2 == 0:\n \tprint(\"\".join(c))\n else:\n \tprint(\"impossible\")\n \t \t \t\t\t \t\t \t\t \t \t \t\t \t\t", "from sys import stdin ,stdout \r\ninput=stdin.readline\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\ns1=input().strip() ; s2=input().strip() ; ans=\"\" ; res=0\r\nfor i , j in zip(s1,s2):\r\n if i==j:\r\n ans+=i\r\n else:\r\n if res%2==0:\r\n ans+=i\r\n else:\r\n ans+=j\r\n res+=1\r\nif res%2==0:\r\n print(ans)\r\nelse:\r\n print(\"impossible\")", "s1 = input()\ns2 = input()\nnd = 0\nfor i in range(len(s1)):\n\tif s1[i] != s2[i]:\n\t\tnd+=1\nif nd%2 != 0:\n\tprint('impossible')\nelse:\n\tsm = []\n\tn2 = 0\n\tfor i in range(len(s1)):\n\t\tif s1[i] != s2[i]:\n\t\t\tif n2 < nd/2:\n\t\t\t\tsm.append(s1[i])\n\t\t\t\tn2 = n2+1\n\t\t\telse:\n\t\t\t\tsm.append(s2[i])\n\t\telse:\n\t\t\tsm.append(s1[i])\n\tprint(''.join(sm))\n \t \t\t\t\t \t \t\t \t\t\t \t\t \t \t\t\t", "a=input()\r\nb=input()\r\nn=len(a)\r\nc=[0]*n\r\ncount=0\r\nfor i in range(n):\r\n if a[i]!=b[i]:\r\n count+=1\r\n c[i]=[a[i],b[i]][count%2]\r\n else: c[i]=a[i]\r\nif count%2==1: print('impossible')\r\nelse: print(*c,sep='')", "s1 = str(input())\r\ns2 = str(input())\r\np = ''\r\nc = 0 \r\nl = len(s1)\r\nfor el in range(l):\r\n if(s1[el] != s2[el]):\r\n if(c % 2 == 0):\r\n p += s1[el]\r\n else:\r\n p += s2[el]\r\n c += 1\r\n else:\r\n p += s1[el] \r\n\r\nif(c % 2 == 1):\r\n print('impossible')\r\nelse:\r\n print(p)\r\n", "s = input()\r\nt = input()\r\nflag = 1\r\ncnt = 0\r\nfor i in range(len(s)):\r\n if s[i] != t[i]:\r\n cnt += 1\r\nif cnt % 2 == 1:\r\n print(\"impossible\")\r\nelse:\r\n flag = 0\r\n c = \"\"\r\n for i in range(len(s)):\r\n if s[i] == t[i]:\r\n c = c + s[i]\r\n else:\r\n if flag:\r\n c = c + s[i]\r\n flag = 0\r\n else:\r\n c = c + t[i]\r\n flag = 1\r\n print(c) ", "str_1, str_2 = input(), input()\nnew_string = \"\"\nlistOf_indices = 0\na = True\nfor i in range(len(str_1)):\n if str_1[i] != str_2[i]:\n if a:\n new_string += str_1[i]\n else:\n new_string += str_2[i]\n a = not a\n listOf_indices += 1\n else:\n new_string += str_1[i]\nif listOf_indices%2 != 0:\n print(\"impossible\")\nelse:\n print(new_string)\n \n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nt = list(input().rstrip())\r\nc = 0\r\nfor i, j in zip(s, t):\r\n c += i ^ j\r\nif c % 2:\r\n ans = [\"impossible\"]\r\nelse:\r\n ans = [str(i & 1) for i in s]\r\n for i in range(len(s)):\r\n if not c:\r\n break\r\n if s[i] ^ t[i]:\r\n ans[i] = str(t[i] & 1)\r\n c -= 2\r\nsys.stdout.write(\"\".join(ans))", "s = input()\nt = input()\np = \"\"\nc = 0\n\nfor i in range(len(s)):\n if s[i] == t[i]:\n p += s[i]\n else:\n c += 1\n if c % 2 == 1:\n p += s[i]\n else:\n p += t[i]\n\nif c % 2 == 1:\n print(\"impossible\")\nelse:\n print(p)\n\t\t \t \t \t \t \t \t\t\t \t\t\t\t", "def girl(s, t):\r\n new_str = \"\"\r\n chet = True\r\n for i in range(len(s)):\r\n if s[i] != t[i]:\r\n if chet:\r\n new_str += s[i]\r\n chet = False\r\n else:\r\n new_str += t[i]\r\n chet = True\r\n else: new_str += s[i]\r\n\r\n if chet: print(new_str)\r\n else: print(\"impossible\")\r\n\r\ns = input()\r\nt = input()\r\ngirl(s, t)" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n \r\nn, m, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = [0]\r\nfor i in w:\r\n d.append(d[-1]+i)\r\nq = [[0]*(n+1) for i in range(k+1)]\r\nfor i in range(1, k+1):\r\n for j in range(m, n+1):\r\n q[i][j] = max(q[i][j-1], q[i-1][j-m] + d[j]-d[j-m])\r\nprint(q[k][-1])", "n, m, k = map(int, input().split())\r\nnums = [0] + list(map(int, input().split()))\r\nif m == 1:\r\n tmp = nums\r\n tmp.sort(reverse=True)\r\n print(sum(tmp[:k]))\r\nelse:\r\n sumn = [0] * (n+1)\r\n for i in range(1,n+1):\r\n if i <= m:\r\n sumn[i] = sumn[i-1] + nums[i]\r\n else:\r\n sumn[i] = sumn[i-1] - nums[i - m] + nums[i]\r\n dp = [[0] * (k+1) for _ in range(n + 1)]\r\n for i in range(m, n+1):\r\n for j in range(1, k + 1):\r\n dp[i][j] = max(dp[i-1][j], dp[i-m][j-1] + sumn[i])\r\n print(max(max(dp)))\r\n", "# -*- coding : utf-8 -*-\r\n# @Time: 2023/10/10 21:55\r\n# @Author: yefei.wang\r\n# @File: 467C.py\r\n\r\nimport sys\r\n\r\n# sys.stdin = open('./../input.txt', 'r')\r\nI = lambda: int(input())\r\nMI = lambda: map(int, input().split())\r\nLI = lambda: list(map(int, input().split()))\r\n\r\nn, m, k = MI()\r\na = LI()\r\npre_sum = [0] * (n + 1)\r\nfor i in range(n):\r\n pre_sum[i + 1] = pre_sum[i] + a[i]\r\n\r\nf = [[0 for j in range(k + 1)] for i in range(n)]\r\n\r\nfor i in range(n):\r\n for j in range(k):\r\n if i - m + 1 >= 0:\r\n f[i][j] = max(f[i - 1][j], f[i - m][j - 1] + pre_sum[i + 1] - pre_sum[i - m + 1])\r\n\r\nrst = max(max(f[i]) for i in range(n))\r\nprint(rst)\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\nalph = 'abcdefghijklmnopqrstuvwxyz'\n#pow(x,mod-2,mod)\n\nN,M,K = map(int,input().split())\nA = list(map(int,input().split()))\nl,num = [],0\nfor i in range(N):num+=A[i];l.append(num)\nl.append(0)\n\ndp = [l[j+M-1]-l[j-1] for j in range(N-(K*M)+1)]\n# print(dp)\n# print(l)\nfor i in range(1,K):\n d = []\n x = 0\n ma = dp[x]\n for j in range(i*M,N-((K-i)*M)+1):\n ma = max(ma,dp[x])\n d.append(l[j+M-1]-l[j-1]+ma)\n x+=1\n dp = d\nprint(max(dp))\n", "n,m,k=map(int,input().split())\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\nDP=[[0]*(n+1) for i in range(k+1)]\r\n\r\nfor i in range(n):\r\n for j in range(k):\r\n DP[j][i]=max(DP[j][i],DP[j][i-1])\r\n if i+m<n+1:\r\n DP[j+1][i+m]=max(DP[j+1][i+m],DP[j][i]+S[i+m]-S[i])\r\n\r\nprint(max(DP[-1]))\r\n \r\n" ]

[ "from functools import cmp_to_key\ndef cmp(x,y):\n if x+y>y+x:\n return 1\n else:\n return -1\na=[]\nn=int(input())\nfor i in range(n):\n\ta.append(input())\nans=\"\"\nfor s in sorted(a,key=cmp_to_key(cmp)):\n\tans+=s\nprint(ans)\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict,deque\r\n\r\ndef my_sort(a,b):\r\n t1 = a+b\r\n t2 = b+a\r\n #print(t1,t2,t1<t2)\r\n if t1==t2:\r\n return 0\r\n elif t1<t2:\r\n return -1\r\n else:\r\n return 1\r\n\r\nfrom functools import cmp_to_key\r\n\r\n\r\nN = int(input())\r\nS = []\r\nfor _ in range(N):\r\n S.append(input())\r\n \r\n \r\nA = sorted(S,key=cmp_to_key(my_sort))\r\nans = ''.join(A)\r\nprint(ans)\r\n\r\n", "from functools import cmp_to_key\ndef myfunc(a,b):\n if a+b>b+a:\n return 1\n else:\n return -1\nn=int(input())\nz=[]\nfor i in range(0,n):\n k=input()\n z.append(k)\nz.sort(key=cmp_to_key(myfunc))\nans=''\nfor i in z:\n ans+=i\nprint(ans)\n \t \t\t\t \t \t \t\t \t \t\t \t \t", "def main():\r\n\tn = int(input())\r\n\tstrings = [None] * n\r\n\tfor i in range(n):\r\n\t\tstrings[i] = input()\r\n\tprint(solver(strings))\r\n\r\ndef solver(L):\r\n\tL.sort(key = cmp_to_key(customCompare))\r\n\treturn ''.join(L)\r\n\r\ndef customCompare(x, y):\r\n\ta = x + y\r\n\tb = y + x\r\n\tif a < b:\r\n\t\treturn -1\r\n\telif a == b:\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn 1\r\n\t# if len(x) == len(y):\r\n\t# \treturn compareStrings(x, y)\r\n\t# elif isPrefix(x, y):\r\n\t# \treturn compareStrings(x, y[len(x):])\r\n\t# elif isPrefix(y, x):\r\n\t# \treturn compareStrings(x[len(y):], y)\r\n\t# else:\r\n\t# \treturn compareStrings(x, y)\r\n\r\ndef compareStrings(x, y):\r\n\tif x < y:\r\n\t\treturn -1\r\n\telif x == y:\r\n\t\treturn 0\r\n\telse:\r\n\t\treturn 1\r\n\r\ndef isPrefix(s, t):\r\n\tif s == t[:len(s)]:\r\n\t\treturn True\r\n\r\ndef cmp_to_key(mycmp):\r\n class K:\r\n def __init__(self, obj, *args):\r\n self.obj = obj\r\n def __lt__(self, other):\r\n return mycmp(self.obj, other.obj) < 0\r\n def __gt__(self, other):\r\n return mycmp(self.obj, other.obj) > 0\r\n def __eq__(self, other):\r\n return mycmp(self.obj, other.obj) == 0\r\n def __le__(self, other):\r\n return mycmp(self.obj, other.obj) <= 0\r\n def __ge__(self, other):\r\n return mycmp(self.obj, other.obj) >= 0\r\n def __ne__(self, other):\r\n return mycmp(self.obj, other.obj) != 0\r\n return K\r\n\r\n# L = [\"abba\", \"abacaba\", \"bcd\", \"er\"]\r\n# print(solver(L))\r\n\r\n# L2 = ['x', 'xx', 'xxa', 'xxaa', 'xxaaa']\r\n# print(solver(L2))\r\n\r\n# L3 = ['c', 'cb', 'cba']\r\n# print(solver(L3))\r\n\r\nmain()", "import functools\r\n\r\ndef compare(s1, s2):\r\n t1 = s1+s2\r\n t2 = s2+s1\r\n if t1 < t2:\r\n return 1\r\n elif t1 > t2:\r\n return -1\r\n else:\r\n return 0\r\n\r\ndef solve():\r\n \r\n n = int(input())\r\n \r\n arr = [None] * n\r\n \r\n for i in range(n):\r\n arr[i] = input()\r\n\r\n arr.sort(key=functools.cmp_to_key(compare))\r\n arr = arr[::-1]\r\n \r\n print(''.join(arr))\r\n\r\n return\r\n\r\ndef main():\r\n t = 1\r\n \r\n while t > 0:\r\n solve()\r\n t -= 1\r\n\r\n return 0\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def compare(a, b):\r\n if a+b < b+a:\r\n return -1\r\n return 1\r\n\r\nfrom functools import cmp_to_key\r\nhmm=[]\r\nfor x in range(int(input())):\r\n hmm.append(input())\r\nhmm.sort(key=cmp_to_key(compare))\r\nprint(''.join(hmm))\r\n\r\n\r\n", "from sys import stdin\r\nfrom functools import cmp_to_key\r\ndef input() :\r\n return stdin.readline()\r\ndef mysort(x,y) :\r\n return 1 if x+y>y+x else -1\r\nn=int(input())\r\nstrings=[]\r\nfor i in range(n) :\r\n t=input().strip('\\n')\r\n strings.append(t)\r\nstrings.sort(key=cmp_to_key(mysort))\r\nprint(\"\".join(strings))", "from functools import cmp_to_key as ctk\r\nn = int(input())\r\nc = []\r\nfor i in range(n):\r\n c.append(input())\r\ndef sort(a,b):\r\n if a + b < b + a:\r\n return -1\r\n else:\r\n return 1\r\nc.sort(key = ctk(sort))\r\nprint(''.join(c))\r\n", "def mergesort(s):\r\n if len(s) == 1:\r\n return s\r\n s1 = mergesort(s[:len(s) // 2])\r\n s2 = mergesort(s[len(s) // 2:])\r\n return merge(s1, s2)\r\n\r\n\r\ndef merge(s1, s2):\r\n f = []\r\n ind1 = 0\r\n ind2 = 0\r\n while ind1 != len(s1) and ind2 != len(s2):\r\n if str(s1[ind1]) + str(s2[ind2]) > str(s2[ind2]) + str(s1[ind1]):\r\n f.append(s2[ind2])\r\n ind2 += 1\r\n else:\r\n f.append(s1[ind1])\r\n ind1 += 1\r\n if ind1 != len(s1):\r\n f.extend(s1[ind1:])\r\n else:\r\n f.extend(s2[ind2:])\r\n return f\r\n\r\n\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nprint(''.join(mergesort(s)))", "from functools import cmp_to_key\r\nprint(''.join(sorted([input() for _ in range(int(input()))],key=cmp_to_key(lambda x,y:1 if x+y>y+x else-1))))", "from functools import cmp_to_key\n\nn = int(input())\n\nA = []\nfor _ in range(n):\n A.append(input())\n\ndef compare(a, b):\n if a + b < b + a:\n return -1\n elif a + b > b + a:\n return 1\n else:\n return 0\n\ndef solve(arr):\n arr.sort(key=cmp_to_key(compare))\n return ''.join(arr)\n\nassert solve(['abba', 'abacaba', 'bcd', 'er']) == 'abacabaabbabcder'\nassert solve(['x', 'xx', 'xxa', 'xxaa', 'xxaaa']) == 'xxaaaxxaaxxaxxx'\nassert solve(['c', 'cb', 'cba']) == 'cbacbc'\n\nprint(solve(A))", "from itertools import permutations\r\nfrom string import ascii_lowercase\r\nimport random\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nclass myString():\r\n def __init__(self, s) -> None:\r\n self.s = s\r\n\r\n def __lt__(self, other):\r\n s1 = self.s\r\n s2 = other.s\r\n\r\n s3 = s1+s2\r\n s4 = s2+s1\r\n if s3 < s4:\r\n return True\r\n else:\r\n return False\r\n\r\n \r\n def __repr__(self) -> str:\r\n return self.s\r\n def __str__(self) -> str:\r\n return self.s\r\n\r\n\r\narr = []\r\nfor i in range(int(input())):\r\n l = input().strip()\r\n arr.append(myString(l))\r\narr.sort()\r\nprint(\"\".join(map(str, arr)))\r\n\r\n# while True:\r\n# inputs = []\r\n# for i in range(random.randint(1, 3)):\r\n# inputs.append(\"\".join(random.choices(ascii_lowercase, k=random.randint(1,50))))\r\n# arr = []\r\n# arr1 = []\r\n# for i in range(len(inputs)):\r\n# l = inputs[i]\r\n# arr.append(myString(l))\r\n# arr1.append(l)\r\n# arr.sort()\r\n\r\n# ans = [\"\".join(i) for i in permutations(arr1)]\r\n\r\n# if \"\".join(map(str, arr)) != min(ans):\r\n# print(inputs)\r\n# print(\"\".join(map(str, arr)))\r\n# print(min(ans))\r\n# break", "from functools import cmp_to_key\r\n\r\ndef compare(x, y):\r\n if y+x < x+y:\r\n return -1\r\n if x+y < y+x:\r\n return 1\r\n if x+y == y+x:\r\n return 0\r\n\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n a = input()\r\n s.append(a)\r\nr = sorted(s, key=cmp_to_key(compare), reverse=True)\r\nfor i in range(n):\r\n print(r[i], end=\"\")\r\n", "def cmp_to_key(mycmp):\n 'Convert a cmp= function into a key= function'\n class K(object):\n def __init__(self, obj, *args):\n self.obj = obj\n def __lt__(self, other):\n return mycmp(self.obj, other.obj) < 0\n def __gt__(self, other):\n return mycmp(self.obj, other.obj) > 0\n def __eq__(self, other):\n return mycmp(self.obj, other.obj) == 0\n def __le__(self, other):\n return mycmp(self.obj, other.obj) <= 0 \n def __ge__(self, other):\n return mycmp(self.obj, other.obj) >= 0\n def __ne__(self, other):\n return mycmp(self.obj, other.obj) != 0\n return K\n\ndef cp(a,b):\n if a+b < b+a:\n return 1\n elif b+a < a+b:\n return -1\n return 0\n\nn = int(input())\nk=[]\nfor i in range(n):\n s = input().strip()\n k.append(s)\nk.sort(key=cmp_to_key(cp),reverse=True)\nprint(''.join(k))\n\n\t \t \t \t \t \t\t\t \t\t\t \t\t \t \t", "from functools import *\r\nprint(\"\".join(sorted([input() for _ in range(int(input()))],key=cmp_to_key(lambda x,y : 2*(x+y>y+x)-1))))", "# C. The Smallest String Concatenation\r\n\r\nfrom functools import cmp_to_key\r\n\r\nn = int(input())\r\na = [] #put all string in a list\r\nfor i in range(n):\r\n a.append(input())\r\n\r\ndef str_comp(x1, x2):\r\n if x1 + x2 < x2 + x1:\r\n return -1\r\n else:\r\n return 1\r\n# def str_comp(x):\r\n# return -len(x)\r\n\r\na_new = sorted(a, key=cmp_to_key(str_comp))\r\n\r\nprint(''.join(a_new))", "n = int(input())\r\nstrArr = []\r\nfor x in range(n):\r\n strArr.append(input())\r\n\r\ndef sortStrByOrder(strArr):\r\n if strArr == None or len(strArr) == 0:\r\n return ''\r\n from functools import cmp_to_key\r\n strArr = sorted(strArr, key=cmp_to_key(lambda x, y: 1 if x + y > y + x else -1))\r\n str = ''\r\n for x in strArr:\r\n str += x\r\n return str\r\nprint(sortStrByOrder(strArr))", "import functools\r\nn = int(input())\r\nwords = []\r\ndef compare(x,y):\r\n if x + y > y + x:\r\n return 1\r\n else:\r\n return -1\r\nfor x in range(n):\r\n s = input()\r\n words.append(s)\r\nans = sorted(words, key=functools.cmp_to_key((compare)))\r\nfor x in ans:\r\n print(x, end=\"\")", "from functools import cmp_to_key\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\ns.sort(key=cmp_to_key(lambda x,y: 2*(x+y>y+x)-1))\r\nans = ''.join(s)\r\nprint(ans)\r\n", "from functools import cmp_to_key\r\n\r\ndef compare_strings(s1, s2):\r\n if s1 + s2 < s2 + s1:\r\n return -1\r\n elif s1 + s2 > s2 + s1:\r\n return 1\r\n else:\r\n return 0\r\n\r\nn = int(input())\r\nstrings = []\r\nfor _ in range(n):\r\n strings.append(input())\r\n\r\nsorted_strings = sorted(strings, key=cmp_to_key(compare_strings))\r\nresult = ''.join(sorted_strings)\r\nprint(result)\r\n\r\n", "import functools\n\nin1 = int(input())\n\ndef newCompare(x, y):\n if x+y > y+x:\n return 1\n else:\n return -1\n\ninputs = []\nfor x in range(in1):\n inputs.append(input())\n\ninputs = sorted(inputs, key=functools.cmp_to_key(newCompare))\n \nstring = \"\"\nfor x in inputs:\n string += x\n \nprint(string)\n \t\t\t \t\t \t \t\t\t\t\t\t \t \t\t", "from functools import cmp_to_key\r\n\r\ndef cmp(A,B):\r\n if A + B < B + A:\r\n return -1\r\n else:\r\n return 0\r\n\r\ndef main():\r\n N = int(input())\r\n X = []\r\n for i in range(N):\r\n Y = input()\r\n X.append(Y)\r\n print(''.join(sorted(X, key = cmp_to_key(cmp))))\r\nif __name__ == '__main__':\r\n main() \r\n", "import sys\r\nimport functools\r\n\r\n\r\ndef cmp(a, b):\r\n # print(\"compare \", a, b)\r\n if a + b < b + a:\r\n return -1\r\n elif a + b > b + a:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nif __name__ == '__main__':\r\n print(\"\".join(sorted([x.strip() for x in sys.stdin.readlines()[1:]],\r\n key=functools.cmp_to_key(cmp))))\r\n", "# https://codeforces.com/problemset/problem/632/C\r\nfrom functools import cmp_to_key\r\n\r\ndef compare(x, y):\r\n if x == y: return 0\r\n i,j = 0,0\r\n while i < len(x) and j < len(y):\r\n if x[i] != y[j]: break\r\n i += 1\r\n j += 1\r\n if i == len(x):\r\n return compare(x, y[j:])\r\n if j == len(y):\r\n return compare(x[i:],y)\r\n if x[i] > y[j]: return 1\r\n return -1\r\n # return x[0] - y[0] # x greater than y this is positive\r\n \r\nN = int(input())\r\nstrs = sorted([input() for _ in range(N)], key=cmp_to_key(compare))\r\nprint(''.join(strs))\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range (n):\r\n a.append(input())\r\n\r\ndef cmp_to_key(mycmp):\r\n 'Convert a cmp= function into a key= function'\r\n class K:\r\n def __init__(self, obj, *args):\r\n self.obj = obj\r\n def __lt__(self, other):\r\n return mycmp(self.obj, other.obj) < 0\r\n def __gt__(self, other):\r\n return mycmp(self.obj, other.obj) > 0\r\n def __eq__(self, other):\r\n return mycmp(self.obj, other.obj) == 0\r\n def __le__(self, other):\r\n return mycmp(self.obj, other.obj) <= 0\r\n def __ge__(self, other):\r\n return mycmp(self.obj, other.obj) >= 0\r\n def __ne__(self, other):\r\n return mycmp(self.obj,other.obj)!=0\r\n return K\r\ndef myfunc(x,y):\r\n if x+y > y+x:\r\n return 1\r\n elif x+y < y+x:\r\n return -1\r\n else:\r\n return 0\r\n\r\nprint (\"\".join(sorted(a, key=cmp_to_key(myfunc))))", "N = int(input())\r\nstring = []\r\nfor i in range(N):\r\n line = input()\r\n string.append(line)\r\ndef cmp_function(x,y):\r\n if x+y<y+x:\r\n return -1\r\n else:\r\n return 1\r\ndef cmp_to_key(mycmp):\r\n class K(object):\r\n __slots__ = ['obj']\r\n def __init__(self, obj, *args):\r\n self.obj = obj\r\n def __lt__(self, other):\r\n return mycmp(self.obj, other.obj) < 0\r\n def __gt__(self, other):\r\n return mycmp(self.obj, other.obj) > 0\r\n def __eq__(self, other):\r\n return mycmp(self.obj, other.obj) == 0\r\n def __le__(self, other):\r\n return mycmp(self.obj, other.obj) <= 0\r\n def __ge__(self, other):\r\n return mycmp(self.obj, other.obj) >= 0\r\n def __ne__(self, other):\r\n return mycmp(self.obj, other.obj) != 0\r\n def __hash__(self):\r\n raise TypeError('None')\r\n return K\r\nstring.sort(key = cmp_to_key((cmp_function)))\r\nprint(''.join(string))", "from functools import cmp_to_key\n\nn = int(input())\n\nA = []\nfor _ in range(n):\n A.append(input())\n\ndef compare(a, b):\n if a + b < b + a:\n return -1\n elif a + b > b + a:\n return 1\n else:\n return 0\n\nprint(''.join(sorted(A, key=cmp_to_key(compare))))", "n = int(input())\r\nA = []\r\nfor i in range(n):\r\n A.append(input())\r\ndef custom_sort(s1,s2):\r\n if (s1+s2) <= (s2+s1):\r\n return -1\r\n else:\r\n return 1\r\n\r\nimport functools\r\nA.sort(key=functools.cmp_to_key(custom_sort))\r\nprint(\"\".join(A))", "from functools import cmp_to_key\r\nn = int(input())\r\nstrs = [input().rstrip() for _ in range(n)]\r\n\r\ncompare = lambda a, b: -1 if a+b < b+a else 1 if a+b > b+a else 0\r\nprint(\"\".join(sorted(strs, key = cmp_to_key(compare))))", "class String():\n\tdef __init__(self,s):\n\t\tself.res=s\n\tdef __lt__(self, other):\n\t\treturn self.res+other.res<other.res+self.res\nq=[]\nfor i in range(int(input())):\n\tq.append(String(input()))\nq=sorted(q)\nans=\"\"\nfor i in q:\n\tans+=i.res\nprint(ans)\n\t \t\t\t\t \t\t\t \t\t \t\t \t \t\t\t\t\t \t\t\t", "class own(object):\r\n def __init__(self,a):\r\n self.a = a\r\n\r\n def __lt__(self,other):\r\n return self.a + other.a < other.a + self.a\r\n\r\ndef main():\r\n n = int(input())\r\n l = [own(input()) for i in range(n)]\r\n l = sorted(l)\r\n for i in l:\r\n print(i.a,end=\"\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nfrom functools import cmp_to_key\r\n\r\ndef compare(s1, s2):\r\n if s1 + s2 <= s2 + s1:\r\n return -1\r\n else:\r\n return 1\r\n \r\nn = int(sys.stdin.readline())\r\n\r\nstrings = []\r\n\r\nfor i in range(n):\r\n strings.append(sys.stdin.readline().strip())\r\n \r\n\r\n# print(strings)\r\nstrings.sort(key = cmp_to_key(compare))\r\nprint(''.join(str(elem) for elem in strings))", "from functools import cmp_to_key\n\ndef cmp(s1,s2):\n temp1 = s1+s2\n temp2 = s2+s1\n # print(temp1,temp2,temp1>temp2)\n if(temp1>temp2):\n return -1\n elif(temp1<temp2):\n return 1\n return 0\n \n \nt = int(input().strip())\narr = []\nwhile(t):\n arr.append(input().strip())\n t-=1\narr.sort(key=cmp_to_key(cmp))\n# print(arr)\nprint(''.join(arr[::-1]))\n \t \t\t\t \t \t \t\t \t \t\t \t \t\t\t", "import functools\r\nimport math\r\nimport sys\r\n\r\n#n, p = map(int, input().split())\r\ndef cmp(x, y):\r\n if x < y:\r\n return -1\r\n elif x > y:\r\n return 1\r\n else:\r\n return 0\r\n \r\nprint(\"\".join(sorted(map(lambda s: s.rstrip(), sys.stdin.readlines()[1:]), \\\r\nkey=functools.cmp_to_key(lambda x,y: cmp(x + y, y + x)))))\r\n", "from functools import cmp_to_key\r\n\r\ndef comp(a, b):\r\n p = a + b\r\n q = b + a\r\n if p < q:\r\n return -1\r\n if p == q:\r\n return 0\r\n else:\r\n return 1\r\nckey = cmp_to_key(comp)\r\n\r\nn = int(input())\r\nwords = []\r\nfor i in range(n):\r\n s = input()\r\n words.append(s)\r\n\r\nwords = sorted(words, key = ckey)\r\n\r\ns = ''\r\n\r\nfor i in range(n):\r\n s += words[i]\r\n\r\nprint(s)", "from functools import cmp_to_key\r\nn = int(input())\r\n\r\nres = []\r\n\r\ndef compare(x, y):\r\n if x+y < y+x:\r\n return(-1)\r\n elif y+x < x+y:\r\n return(1)\r\n else:\r\n return(0)\r\n\r\nfor i in range(n):\r\n\r\n case = input()\r\n res.append(case)\r\n\r\nres = sorted(res , key = cmp_to_key(compare))\r\n\r\nprint(\"\".join(res)) ", "from functools import cmp_to_key\r\nn = int(input())\r\nl = [input() for _ in range(n)]\r\ndef comparator(a,b) :\r\n return -1 if a+b <= b+a else 1\r\nl = sorted(l, key = cmp_to_key(comparator))\r\nprint(''.join(l))", "from functools import cmp_to_key\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n l.append(input())\r\n \r\nl.sort(key = cmp_to_key(lambda x,y : 1 if x+y > y+x else -1))\r\nprint(''.join(l))", "from functools import cmp_to_key\r\ndef cmp(a,b):\r\n return -1 if a+b < b+a else 0\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n l = [input() for i in range(n)]\r\n l = sorted(l,key=cmp_to_key(cmp))\r\n for i in l:\r\n print(i,end=\"\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "# List = [[10,1],[20,2],[10,3]] --> Initial\r\n# List = [[10, 1], [10, 3], [20, 2]] --> Normal Sort \r\n# List = [[10, 3], [10, 1], [20, 2]] --> Sort with custom key [ascending, descending]\r\nfrom functools import cmp_to_key\r\ndef custom(x,y):\r\n a = x +y\r\n b = y+ x\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\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n s = input()\r\n arr.append(s)\r\n# arr.sort(key = cmp)\r\narr.sort(key = cmp_to_key(custom))\r\n# print(arr)\r\nans = \"\"\r\nfor i in arr:\r\n ans += i\r\nprint(ans)", "import sys\r\nfrom functools import cmp_to_key\r\n\r\nlines = sys.stdin.readlines()[1:]\r\nlines = [line.strip() for line in lines]\r\n\r\n# Определение функции для сравнения строк согласно компаратору\r\ndef custom_sort_cmp(x, y):\r\n if x + y < y + x:\r\n return -1\r\n elif x + y > y + x:\r\n return 1\r\n else:\r\n return 0\r\n\r\nsorted_lines = sorted(lines, key=cmp_to_key(custom_sort_cmp))\r\n\r\n# Вывод отсортированных и сконкатенированных строк\r\nresult = \"\".join(sorted_lines)\r\nprint(result)\r\n", "import functools\r\n \r\nlst = []\r\nfor _ in range(int(input())):\r\n lst.append(input())\r\n \r\ndef cmp(a,b):\r\n if a+b>b+a:\r\n return 1\r\n elif a+b<b+a:\r\n return -1\r\n else:\r\n return -0\r\n \r\nx = sorted(lst, key=functools.cmp_to_key(cmp))\r\nprint(\"\".join(x))", "from functools import cmp_to_key as k\r\n\r\n\r\ndef c(x, y):\r\n return -1 if x + y < y + x else 1\r\n\r\nn = int(input())\r\nl = [input() for _ in range(n)]\r\nprint(''.join(sorted(l, key=k(c))))\r\n", "'''\r\nfrom functools import cmp_to_key\r\n\r\nclass Edge:\r\n\tdef __init__(self, a, b, w):\r\n\t\tself.a = a\r\n\t\tself.b = b\r\n\t\tself.w = w\r\n\r\nv = []\r\nM = 4\r\nfor i in range(M):\r\n\ta,b,w = map(int,input().split())\r\n\tv.append(Edge(a,b,w))\r\n\r\nv.sort(key=cmp_to_key(lambda a,b: a.w-b.w))\r\nfor e in v:\r\n\tprint(e.a,e.b,e.w)\r\n'''\r\n\r\nfrom functools import cmp_to_key\r\n\r\nclass Lexicographic:\r\n def __init__(self,x):\r\n self.x = x\r\n #self.y = y\r\n def __lt__(self,other):\r\n return self.x+other.x < other.x+self.x\r\n\r\nnum = int(input())\r\nstrings = []\r\nfor i in range(num):\r\n strings.append(Lexicographic(input()))\r\n\r\nstrings.sort()\r\nfor i in strings:\r\n print(i.x,end='')\r\n\r\n", "def comp(a, b):\n if a+b < b+a:\n return -1\n else:\n return 1\n\nfrom functools import cmp_to_key\n\nl = []\nfor _ in range(int(input())):\n l.append(input())\nprint(*sorted(l, key=cmp_to_key(comp)), sep='')\n\n\n", "from sys import stdin\r\ninput=lambda :stdin.readline()[:-1]\r\n\r\ndef compare(a,b):\r\n return a+b<=b+a\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\ns=[input() for i in range(n)]\r\ns=MergeSort(s)\r\nprint(''.join(s))", "import sys\r\nfrom functools import cmp_to_key\r\n\r\n# sys.stdin = open(\"1.in\", \"r\")\r\n\r\nN = int(input())\r\na = [input() for _ in range(N)]\r\n\r\ndef comp(x, y):\r\n return -1 if x+y<y+x else 1\r\n\r\na.sort(key=cmp_to_key(comp))\r\n\r\nprint(*a, sep='')", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Apr 14 15:41:54 2016\n\n@author: kebl4230\n\nToo slow. Possibly lots of unnecessary list manipulation.\n\"\"\"\nfrom functools import cmp_to_key\nn = int(input())\nstrings = list()\nfor i in range(n):\n strings.append(input())\n\n\ndef cmpfunc(x, y):\n a = x + y\n b = y + x\n if a < b:\n return -1\n elif a == b:\n return 0\n else:\n return 1\n\nbb = sorted(strings, key=cmp_to_key(cmpfunc))\nprint(\"\".join(bb))\n\n\n\"\"\"\nn = int(input())\nstrings = list()\nfor i in range(n):\n strings.append(input())\n\naa = \"abcdefghijklmnopqrstuvwxyz\"\npositions = [strings.copy()]\n\n\ndef myfunc(mylist, index, pos):\n scores = [aa.find(bb[index]) if index < len(bb) else 27 for bb in mylist]\n r = 0\n mins = min(scores)\n while mins <= 27:\n if r == 0:\n for i in range(len(scores)):\n if scores[i] == mins:\n scores[i] = 100\n else:\n group = [mylist[n] for n in range(len(scores)) if scores[n] == mins]\n positions.insert(pos + r, group)\n for string in group:\n mylist.remove(string)\n while any(s == mins for s in scores):\n scores.remove(mins)\n r += 1\n mins = min(scores)\n\nindex = 0\nmaxlen = len(positions)\npos = 0\nwhile any(len(pos) > 1 for pos in positions):\n myfunc(positions[pos], index, pos)\n pos += 1\n if pos == maxlen:\n pos = 0\n maxlen = len(positions)\n index += 1\n\nresult = ''\nfor aa in positions:\n result += aa[0]\nprint(result)\n\"\"\"", "class cmp(object):\r\n def __init__(self, t): self.t = t\r\n def __lt__(self, q): return self.t + q.t < q.t + self.t\r\nprint(''.join(q for q in sorted([input() for i in range(int(input()))], key=cmp)))", "from sys import stdin, stdout, setrecursionlimit\r\ninput = stdin.readline\r\n# setrecursionlimit(int(1e6))\r\ninf = float('inf')\r\nfrom collections import defaultdict as dd\r\nfrom collections import Counter, deque\r\nfrom heapq import *\r\nimport math\r\nfrom math import floor, ceil, sqrt\r\nfrom itertools import permutations as perm\r\ndef geti(): return map(int, input().strip().split())\r\ndef getl(): return list(map(int, input().strip().split()))\r\ndef getis(): return map(str, input().strip().split())\r\ndef getls(): return list(map(str, input().strip().split()))\r\ndef gets(): return input().strip()\r\ndef geta(): return int(input())\r\ndef print_s(s): stdout.write(s+'\\n')\r\nfrom functools import cmp_to_key\r\ndef solve():\r\n n = geta()\r\n ans = []\r\n for i in range(n):\r\n ans.append(gets())\r\n def cmp(a, b):\r\n if (a + b) < (b + a):\r\n return -1\r\n elif (a + b) > (b + a):\r\n return 1\r\n return 0\r\n ans.sort(key = cmp_to_key(cmp))\r\n print(''.join(ans))\r\n\r\n\r\nif __name__=='__main__':\r\n solve()\r\n", "from functools import cmp_to_key\r\na=[input() for _ in range(int(input()))]\r\nprint(''.join(sorted(a,key=cmp_to_key(lambda x,y:1 if x+y>y+x else-1))))", "class Key(str): \r\n def __lt__(a, b): \r\n return a + b < b + a \r\n\r\nn = int(input())\r\nmas = [input() for _ in range(n)]\r\nmas.sort(key = Key)\r\nprint(''.join(mas))\r\n\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\nfrom functools import cmp_to_key\r\n\r\n# a = ['abc', 'abcabb', 'abcabcabb', 'abcabcabbabc']\r\n\r\na_p = sorted(a, key=cmp_to_key(lambda x, y: -1 if x + y < y + x else 1))\r\nprint(''.join(a_p))", "import sys\r\nfrom functools import cmp_to_key\r\n\r\nn = int(sys.stdin.readline().strip())\r\ns = [sys.stdin.readline().strip() for _ in range(n)]\r\ns.sort(key=cmp_to_key(lambda a, b: 1 if a + b > b + a else -1))\r\nprint(\"\".join(s))\r\n", "from functools import cmp_to_key\ndef comparator(a, b):\n if(a+b > b+a):\n return 1\n return -1\nt=int(input())\nl=[]\nfor i in range(t):\n s=input()\n l.append(s)\nl = sorted(l, key=cmp_to_key(comparator))\nr=\"\"\nfor i in l:\n #print(i)\n r+=i\nprint(r)\n \n\t \t \t\t \t\t \t \t \t\t \t \t", "from functools import cmp_to_key\r\n\r\ndef c(x,y):\r\n if x+y > y+x:\r\n return 1\r\n else:\r\n return -1\r\n\r\nn = int(input())\r\nl = []\r\n\r\nfor _ in range(n):\r\n l.append(input())\r\n\r\nl.sort(key = cmp_to_key(c))\r\n\r\nprint(''.join(l))\r\n", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\ndef myCmp(x, y):\r\n # return x + y < y + x\r\n if x + y < y + x:\r\n return -1\r\n else:\r\n return 1\r\n\r\na.sort(key=cmp_to_key(myCmp))\r\nprint(''.join(a))", "import sys\r\nreadline=sys.stdin.readline\r\nfrom functools import cmp_to_key\r\n\r\nN=int(readline())\r\nA=[readline().rstrip() for n in range(N)]\r\ndef f(s0,s1):\r\n if s0+s1<s1+s0:\r\n return -1\r\n if s0+s1>s1+s0:\r\n return 1\r\n return 0\r\nA.sort(key=cmp_to_key(f))\r\nprint(*A,sep=\"\")\r\n", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\nls = [input() for _ in range(n)]\r\n\r\n\r\ndef compare_str(x, y):\r\n if x + y < y + x:\r\n return -1\r\n elif x + y > y + x:\r\n return 1\r\n else:\r\n return 0\r\n\r\n\r\nls.sort(key=cmp_to_key(compare_str))\r\n\r\nprint(\"\".join(ls))\r\n", "import functools\r\nprint(\"\".join(sorted([input() for _ in range(int(input()))], key=functools.cmp_to_key(lambda x, y : 2*(x+y > y+x) - 1))))", "import functools\r\ndef my_cmp(x,y) : return -1 if x+y < y+x else 1\r\nl = []\r\nfor i in range((int)(input())) :\r\n s = input()\r\n l.append(s)\r\nprint(\"\".join(sorted(l, key=functools.cmp_to_key(my_cmp))))", "from functools import cmp_to_key\r\ndef cmp(x, y):\r\n if x+y < y+x:\r\n return(-1)\r\n elif y+x < x+y:\r\n return(1)\r\n else:\r\n return(0)\r\nn = int(input())\r\na = []\r\nfor i in range (n):\r\n s = input().strip()\r\n a.append(s)\r\na.sort(key=cmp_to_key(cmp))\r\nprint(\"\".join(a))", "from functools import cmp_to_key\r\nN = int(input())\r\nstrings = []\r\nfor i in range(N):\r\n line = input()\r\n strings.append(line)\r\nstrings.sort(key=cmp_to_key(lambda x,y:1 if x+y>y+x else -1))\r\nfor i in range(N):\r\n print(strings[i],end ='')", "import functools\r\ndef my_cmp(x,y) : return -1 if x+y < y+x else 1\r\nl = []\r\nfor i in range((int)(input())):\r\n l.append(input())\r\nprint(\"\".join(sorted(l, key=functools.cmp_to_key(my_cmp))))", "from functools import cmp_to_key\r\nn = int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\ndef cmp(x,y):\r\n if x+y < y+x :\r\n return -1\r\n elif x+y > y+x:\r\n return 1\r\n else:\r\n return 0\r\nprint(''.join(sorted(a,key=cmp_to_key(cmp))))\r\n#print(a.sort(key = lambda x,y: cmp(x,y)))\r\n", "def compare(f, u):\r\n if f + u < u + f:\r\n return -1\r\n elif f + u == u + f:\r\n return 0\r\n else:\r\n return 1\r\n \r\n\r\nfrom functools import cmp_to_key\r\nn = int(input())\r\ns = []\r\nfor i in range(n):\r\n s.append(input())\r\nprint(''.join(sorted(s, key = cmp_to_key(compare))))", "from functools import cmp_to_key\r\n\r\n\r\ndef compare(a, b):\r\n if a + b == b + a:\r\n return 0\r\n return 1 if a + b > b + a else -1\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n print(\"\".join(sorted([input().strip() for _ in range(n)], key=cmp_to_key(compare))))\r\n", "from functools import cmp_to_key\r\n\r\n\r\ndef CMP(x, y):\r\n if (x + y) > (y + x):\r\n return 1\r\n else:\r\n return -1\r\n\r\n\r\nn = int(input())\r\nL = []\r\nfor i in range(n):\r\n str = input()\r\n L.append(str)\r\nL.sort(key=cmp_to_key(CMP))\r\nfor i in L:\r\n print(i, end=\"\")", "from collections import defaultdict,Counter\nimport math\nimport bisect\nfrom itertools import accumulate\nfrom math import ceil, log\nfrom functools import lru_cache, cmp_to_key\nfrom sys import stdin, stdout\n\ndef strg(idx,a,b,i,n1,n2):\n if i == 0:\n if idx < n1:\n return a[idx]\n else:\n return b[idx-n1]\n else:\n if idx < n2:\n return b[idx]\n else:\n return a[idx-n2]\n \n \n \ndef strcmp(a,b):\n n1 = len(a)\n n2 = len(b)\n\n for idx in range(n1+n2):\n t1 = strg(idx,a,b,0,n1,n2)\n t2 = strg(idx,a,b,1,n1,n2)\n # print(t1,t2)\n if t1 > t2:\n return 1\n elif t1 < t2:\n return -1\n return -1 \n\ndef read():\n return stdin.readline().rstrip()\n \n \ntotal = int(read())\nx = []\nfor _ in range(total):\n x.append(read())\n# \n \n \n \nx = sorted(x,key = cmp_to_key(strcmp))\nprint(''.join(x)) \n \n \n \n \n \n \n \n \n \n \n \n# i,j = ([int(p) for p in read().split()])\n# x.append((i,1))\n# x.append((j,-1))\n\n#y = sorted(range(2*total),key = lambda y:x[y][0])\n#\n#s = 0\n#m = 0\n##print(y)\n#for i in y:\n# s+= x[i][1]\n# if s >m:\n# m=s\n# \n#print(m)", "from functools import cmp_to_key\r\n\r\ndef compare(x, y):\r\n if (x + y > y + x):\r\n return 1 \r\n elif (x+y<y+x):\r\n return -1\r\n else:\r\n return 0\r\n \r\nn = int(input())\r\nX = []\r\nfor i in range(n):\r\n s = input()\r\n X.append(s)\r\nprint(\"\".join(sorted(X, key=cmp_to_key(compare))))", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\nm = []\r\n\r\nfor _ in range(n):\r\n s = input().strip()\r\n m.append(s)\r\n\r\n# Define a custom comparison function for sorting\r\ndef compare(a, b):\r\n return (a + b) < (b + a)\r\n\r\n# Sort the list of strings using the custom comparison function\r\nm.sort(key=cmp_to_key(lambda x, y: -1 if compare(x, y) else 1))\r\n\r\n# Print the result\r\nprint(\"\".join(m))\r\n", "from functools import cmp_to_key as ctk\n\ndef comp(a, b):\n\tif a + b < b + a:\n\t\treturn -1\n\telif a + b > b + a:\n\t\treturn 1\n\telse:\n\t\treturn 0\n\nn = int(input())\nstring = list()\nfor i in range(n):\n\tstrtem = input()\n\tstring.append(strtem)\nstring.sort(key = ctk(comp))\nprint(''.join(string))", "from functools import cmp_to_key\nn = int(input())\na = []\nfor i in range(n):\n\ta.append(input().strip())\na = sorted(a, key=cmp_to_key(lambda x, y: -1 if x+y < y+x else 1))\nprint(''.join(a))\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\n\r\n\r\n# n = int(input())\r\n# l1 = list(map(int,input().split()))\r\n# n,x = map(int,input().split())\r\n# s = input()\r\nmod = 1000000007\r\n# print(\"Case #\"+str(_+1)+\":\",)\r\n\r\nfrom collections import Counter,defaultdict,deque\r\n#from heapq import heappush,heappop,heapify\r\nimport sys\r\nimport math\r\nimport bisect\r\nfrom functools import cmp_to_key\r\n\r\n\r\nfor _ in range(1):\r\n n = int(input());l=[]\r\n for i in range(n):\r\n x = input()\r\n l.append(x)\r\n def compare(a,b):\r\n if a+b<b+a:\r\n return -1\r\n elif a+b>b+a:\r\n return 1\r\n else:\r\n return 0\r\n \r\n\r\n ans = sorted(l,key = cmp_to_key(compare))\r\n\r\n print(''.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", "n = int(input())\r\nS = [str(input()) for i in range(n)]\r\n\r\nfrom functools import cmp_to_key\r\n\r\ndef cmp(a, b):\r\n if a+b == b+a: return 0\r\n return -1 if a+b < b+a else 1\r\n\r\nS.sort(key=cmp_to_key(cmp))\r\n#print(S)\r\nprint(''.join(S))\r\n", "from functools import cmp_to_key\r\nn = int(input())\r\narr =[]\r\nfor i in range(n):\r\n arr.append(input())\r\ndef comp(a,b):\r\n return -1*(a + b <= b + a)\r\narr = sorted(arr, key = cmp_to_key(comp))\r\nprint(\"\".join(arr))\r\n", "from functools import cmp_to_key\nn=int(input())\na=[]\nfor i in range(n):\n a.append(input())\na.sort(key=cmp_to_key(lambda x,y:1 if x+y>y+x else -1))\nprint(''.join(a))\n \t\t \t\t \t \t\t \t", "import sys\r\n\r\n\r\nclass Word(object):\r\n def __init__(self, word):\r\n self.word = word\r\n\r\n def __lt__(self, other):\r\n return self.word + other.word < other.word + self.word\r\n\r\n def __str__(self):\r\n return self.word\r\n\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\na = list(Word(line.decode('utf-8').rstrip()) for line in sys.stdin.buffer)\r\na.sort()\r\nsys.stdout.buffer.write((''.join(map(str, a))).encode('utf-8'))\r\n", "class String():\r\n\tdef __init__(self,s):\r\n\t\tself.res=s\r\n\tdef __lt__(self, other):\r\n\t\treturn self.res+other.res<other.res+self.res\r\nq=[]\r\nfor i in range(int(input())):\r\n\tq.append(String(input()))\r\nq=sorted(q)\r\nans=\"\"\r\nfor i in q:\r\n\tans+=i.res\r\nprint(ans)", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\nstrings = [input() for _ in range(n)]\r\n\r\ndef compare(x, y):\r\n if x + y < y + x:\r\n return -1\r\n else:\r\n return 1\r\n \r\nresult = ''.join(sorted(strings, key=cmp_to_key(compare)))\r\nprint(result)# 1698315938.3277948", "import functools\r\n \r\nn=int(input())\r\nl=[]\r\n\r\nfor i in range(n):\r\n l.append(input()) \r\n\r\n# print(l)\r\n\r\n\r\ndef merge(l,r):\r\n ans=[\"\" for i in range(len(l)+len(r))]\r\n \r\n i=0 \r\n j=0 \r\n x=0 \r\n while i<len(l) and j<len(r):\r\n # if l[i]<=r[j]:\r\n if l[i]+r[j]<=r[j]+l[i]:\r\n ans[x]=l[i]\r\n i+=1 \r\n else:\r\n ans[x]=r[j]\r\n j+=1 \r\n x+=1 \r\n \r\n while i<len(l):\r\n ans[x]=l[i]\r\n i+=1 \r\n x+=1 \r\n while j<len(r):\r\n ans[x]=r[j]\r\n j+=1 \r\n x+=1 \r\n \r\n return ans \r\n\r\ndef mergesort(arr):\r\n if len(arr)==1:\r\n return arr \r\n \r\n m=len(arr)//2\r\n l=arr[:m]\r\n r=arr[m:]\r\n \r\n l=mergesort(l)\r\n r=mergesort(r)\r\n # print(arr, l,r)\r\n \r\n arr=merge(l,r)\r\n # print(arr)\r\n \r\n return arr \r\n\r\n\r\nl=mergesort(l)\r\n\r\n\r\nprint(\"\".join(l))\r\n", "#!/usr/bin/env python3\n\nfrom functools import cmp_to_key\ndef cmpEqLen(a, b):\n if a < b:\n return -1\n elif a > b:\n return 1\n else:\n return 0\n\ndef compare(a, b):\n alen = len(a)\n blen = len(b)\n if alen == blen:\n return cmpEqLen(a, b)\n l = min(alen, blen)\n c = cmpEqLen(a[:l], b[:l])\n if c != 0:\n return c\n\n if alen > blen:\n return -compare(a[:l], a[l:])\n else:\n return compare(b[:l], b[l:])\n\nN = int(input())\narr = [input() for _ in range(N)]\narr.sort(key=cmp_to_key(compare))\nprint(''.join(arr))\n", "n = int(input())\r\n\r\ndef comp(a, b):\r\n l = a + b\r\n r = b + a\r\n if l < r: return -1\r\n elif l == r: return 0\r\n else: return 1\r\n\r\nfrom functools import cmp_to_key\r\n\r\nd = []\r\nfor _ in range(n):\r\n s = input().rstrip()\r\n d.append(s)\r\n\r\nd.sort(key=cmp_to_key(comp))\r\n\r\nprint(''.join(d))\r\n", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\nm = []\r\n\r\nfor _ in range(n):\r\n s = input().strip()\r\n m.append(s)\r\n\r\n# Define a custom comparison function for sorting\r\ndef compare(a, b):\r\n if (a + b) < (b + a): return -1\r\n return 1\r\n\r\n# Sort the list of strings using the custom comparison function\r\nm.sort(key=cmp_to_key(compare))\r\n# Print the result\r\nprint(\"\".join(m))", "import functools\r\ndef cmp(a,b):\r\n if a+b<b+a:\r\n return -1\r\n else:\r\n return 1\r\nn=int(input())\r\nls=[]\r\nfor i in range(n):\r\n x=input()\r\n ls.append(x)\r\nls.sort(key=functools.cmp_to_key(cmp))\r\nprint(\"\".join(ls))", "import sys\r\nfrom os import path\r\n# from math import log2, floor, ceil, sqrt, pow, gcd\r\n# from random import random, randint, shuffle, choice\r\n# from collections import Counter, defaultdict, deque\r\n# from itertools import permutations, combinations\r\nfrom functools import reduce, cmp_to_key\r\n# from heapq import heapify, heappop, heappush, heapreplace\r\n# from bisect import bisect_left, bisect_right\r\n\r\ndef get_string(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(get_string())\r\ndef get_ints(): return map(int, get_string().split())\r\ndef get_list(): return list(get_ints())\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\nsys.setrecursionlimit(10 ** 5)\r\nMOD, MOD2, INF = 10 ** 9 + 7, 998244353, 10 ** 18\r\n\r\ndef solve():\r\n n = get_int()\r\n a = [get_string() for _ in range(n)]\r\n a.sort(key=cmp_to_key(lambda x, y: -1 if x+y < y+x else 1))\r\n ans = ''\r\n for i in a:\r\n ans += i\r\n print(ans)\r\n\r\ntc = 1\r\n# tc = get_int()\r\n\r\nfor _ in range(tc):\r\n solve()", "from functools import cmp_to_key\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\na.sort(key = cmp_to_key(lambda x,y : 1 if x+y > y+x else -1))\r\nprint(''.join(a))", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\na = [input() for _ in range(n)]\r\n\r\ndef cmp(x,y):\r\n if x+y < y+x:\r\n return -1\r\n elif x+y >y+x:\r\n return 1\r\n else:\r\n return 0\r\n\r\na.sort(key=cmp_to_key(cmp))\r\n\r\nprint(\"\".join(a))", "from functools import cmp_to_key\r\nn = int(input())\r\nl = []\r\nfor i in range (n):\r\n l.append(input())\r\ndef cmp(x,y):\r\n if x+y<y+x:\r\n return -1\r\n elif x+y == y+x:\r\n return 0\r\n else:\r\n return 1\r\nl.sort(key=cmp_to_key(cmp))\r\nprint(''.join(l))", "# Rishabh Rao (https://github.com/rishabhrao)\r\n\r\nimport sys\r\nfrom functools import cmp_to_key\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 = ii()\r\ns = [inp() for _ in range(n)]\r\ns.sort(key=cmp_to_key(lambda a, b: 1 if a + b > b + a else -1))\r\nprint(\"\".join(s))\r\n", "from functools import cmp_to_key\r\n\r\ndef cmp(a,b):\r\n\tx=a+b\r\n\ty=b+a\r\n\tif x<y: return -1\r\n\telif x==y: return 0\r\n\treturn 1\r\n\r\nn,a = int(input()),[]\r\nfor i in range(n): a.append(input())\r\na.sort(key=cmp_to_key(cmp))\r\nfor i in a:\r\n\tprint(i,end='')", "from functools import cmp_to_key\r\nn=int(input())\r\ns=[]\r\nfor i in range(n):\r\n s.append(input())\r\ndef cmp(x,y):\r\n if x+y<y+x:return -1\r\n else:return 1\r\ns=sorted(s,key=cmp_to_key(cmp))\r\nprint(''.join(s))", "from functools import cmp_to_key\r\nn = int(input())\r\nS = []\r\nfor i in range(n):\r\n S.append(input())\r\nS.sort(key = cmp_to_key(lambda x,y : 1 if x+y > y+x else -1))\r\nprint(''.join(S))", "from functools import cmp_to_key\r\n\r\nn = int(input())\r\nstrings = [input() for i in range(n)]\r\n\r\n\"\"\"\r\ndef cmp(s1, s2):\r\n l = min(len(s1), len(s2))\r\n for i in range(l):\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 ord(s1[0]) - ord(s2[l])\r\n elif len(s1) > len(s2):\r\n return ord(s1[l]) - ord(s2[0])\r\n return 0\r\n\"\"\"\r\n\r\ndef cmp(s1, s2):\r\n z1, z2 = s1 + s2, s2 + s1\r\n if z1 < z2:\r\n return -1\r\n elif z2 > z1:\r\n return 1\r\n else:\r\n return 0\r\n\r\nstrings.sort(key=cmp_to_key(cmp))\r\nfor string in strings:\r\n print(string, end=\"\")\r\nprint(\"\")", "# Write your code here :-)\n# The Smallest String Concatenation\nfrom functools import cmp_to_key\n\nn = int(input())\na = [input() for _ in range(n)]\na.sort(key=cmp_to_key(lambda s1, s2: 1 if s1 + s2 > s2 + s1 else -1))\nprint(\"\".join(a))\n", "from functools import cmp_to_key\nprint(''.join((sorted((input() for _ in range(int(input()))), key=cmp_to_key(lambda a, b: 1 if a + b > b + a else-1)))))", "from sys import stdin\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\nfrom functools import cmp_to_key\r\n\r\ndef compare(x, y):\r\n a, b = x+y, y+x\r\n return -1 if a < b else 1 if a > b else 0\r\n\r\na = [input() for _ in range(int(input()))]\r\na.sort(key=cmp_to_key(compare))\r\nprint(''.join(a))", "n = int(input())\r\nA = []\r\nfor i in range(n):\r\n A.append(input())\r\ndef custom_sort(s1,s2):\r\n n1 = len(s1)\r\n n2 = len(s2)\r\n if n1 == n2:\r\n if s1 <= s2:\r\n return -1\r\n else:\r\n return 1\r\n else:\r\n if (s1+s2) <= (s2+s1):\r\n return -1\r\n else:\r\n return 1\r\n\r\nimport functools\r\nA.sort(key=functools.cmp_to_key(custom_sort))\r\nprint(\"\".join(A))\r\n", "from sys import stdin\r\ninput = lambda: stdin.buffer.readline().decode().strip()\r\nfrom functools import cmp_to_key\r\n\r\na = [input() for _ in range(int(input()))]\r\na.sort(key=cmp_to_key(lambda x, y: -1 if x+y < y+x else 1))\r\nprint(''.join(a))", "# C. The Smallest String Concatenation\r\n\r\nimport functools\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input())\r\n\r\n# def cmp_string(s):\r\n# # return s # this is the default way\r\n# # return len(s)\r\n# return -len(s)\r\ndef cmp_string(s1, s2):\r\n if s1 + s2 < s2 + s1:\r\n return -1\r\n else:\r\n return 1\r\n\r\na.sort(key=functools.cmp_to_key(cmp_string))\r\n# how to concatenate all strings together?\r\nprint(''.join(a))\r\n\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\nfrom functools import cmp_to_key\r\ndef cmp(x,y):\r\n if x+y==y+x:return 0\r\n if x+y<y+x:\r\n return -1\r\n else:\r\n return 1\r\nn = ni()\r\ns = [input() for i in range(n)]\r\ns = sorted(s,key = cmp_to_key(cmp))\r\nprint(\"\".join(s))\r\n", "import functools\r\nimport sys\r\n\r\n\r\ndef In():\r\n return map(int, sys.stdin.readline().split())\r\n\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef mergesort(l):\r\n def recur(arr):\r\n if len(arr) > 1:\r\n mid = len(arr) // 2\r\n l = arr[:mid]\r\n r = arr[mid:]\r\n recur(l)\r\n recur(r)\r\n left, right, pos = 0, 0, 0\r\n while left < len(l) and right < len(r):\r\n if com(l[left],r[right]):\r\n arr[pos] = l[left]\r\n left += 1\r\n else:\r\n arr[pos] = r[right]\r\n right += 1\r\n pos += 1\r\n while left < len(l):\r\n arr[pos] = l[left]\r\n pos += 1\r\n left += 1\r\n while right < len(r):\r\n arr[pos] = r[right]\r\n pos += 1\r\n right += 1\r\n\r\n recur(l)\r\n print(''.join(l))\r\ndef com(x, y):\r\n return (x + y) <(y + x)\r\ndef smaconcentra():\r\n n = int(input())\r\n l = [input().rstrip() for _ in range(n)]\r\n mergesort(l)\r\n\r\n\r\nsmaconcentra()\r\n", "from functools import cmp_to_key\r\nn=int(input())\r\narr=[]\r\nfor i in range(n):\r\n arr.append(input())\r\n\r\nsorted_words=sorted(arr, key=cmp_to_key(lambda x, y: 2*(x+y>y+x)-1))\r\nprint(''.join(sorted_words))", "from functools import cmp_to_key\n\ndef func(strings):\n strings.sort(key=cmp_to_key(lambda a,b: -1 if (a + b) < (b + a) else 0))\n return \"\".join(strings)\n\nnum = int(input())\nstrings = []\nfor _ in range(num):\n strings.append(input())\nprint(func(strings))", "import functools\ndef cmp(x: str, y: str):\n if (x+y) < (y+x):\n return -1\n elif (x+y) > (y+x):\n return 1\n else:\n return 0\n\ntest = int(input())\n\nstrings = []\n\nfor i in range(test):\n x = input()\n strings.append(x)\n\nsort_strings = sorted(strings, key=functools.cmp_to_key(cmp))\n\nfor i in sort_strings:\n print(i, end=\"\")\n", "from functools import cmp_to_key as ctk\r\ns=[]\r\nfor o in range(int(input())):\r\n s+=[input()]\r\ns.sort(key=ctk(lambda x,y:1 if x+y>y+x else -1))\r\nprint(''.join(s))\r\n", "import functools\r\n\r\n\r\ndef compare(s1: str, s2: str):\r\n s = s1 + s2\r\n r = s2 + s1\r\n if s > r:\r\n return 1\r\n elif s == r:\r\n return 0\r\n else:\r\n return -1\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n ans = []\r\n for _ in range(n):\r\n ans.append(input())\r\n ans = sorted(ans, key=functools.cmp_to_key(compare))\r\n print(''.join(ans))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n" ]

[ "n,a,b=int(input()),0,0\r\nfor i in range(1,int(1e12)+1):\r\n if i**2>1e12:break\r\n a+=3*i-1\r\n if a>n:break\r\n if(n-a)%3==0:b+=1\r\nprint(b)", "import math\r\nn = int(input())\r\nx = math.floor((-7 + math.sqrt(1 + 24 * n)) / 6 + 1)\r\nif (n - 2 * x) % 3 == 0:\r\n print((x - 1) // 3 + 1)\r\nelif (n - 2 * (x - 1)) % 3 == 0:\r\n if x > 1:\r\n print((x - 2) // 3 + 1)\r\n else:\r\n print(0)\r\nelse:\r\n if x > 2:\r\n print((x - 3) // 3 + 1)\r\n else:\r\n print(0)", "n = int(input())\nans = 0\nlayer = 0\nwhile True:\n layer += 1\n rem = 2 * layer % 3\n if n % 3 != rem:\n continue\n least = 3 * layer * (layer + 1) // 2 - layer\n if n < least:\n break\n ans += 1\nprint(ans)\n", "n = int(input())\r\n#a = list(map(int, input().split()))\r\nt = 1\r\nsum = 0\r\nwhile True:\r\n sum += 2*t + (t - 1)\r\n if sum > n:\r\n t -= 1\r\n break\r\n t += 1\r\ncnt = 0\r\nfor i in range(1, t + 1):\r\n if (n + i) % 3 == 0:\r\n cnt += 1\r\nprint(cnt)", "n = (int)(input())\n\nc=0\ni=0\nif (n-2)%3==0:\n b=0\n while c==0:\n a = (n-2-6*b)/3\n q = (3*b)*(3*b + 1)/2\n if a>=q:\n b=b+1\n else:\n break\n \nif (n-4)%3==0:\n b=0\n while c==0:\n a = (n-4-6*b)/3\n q = (3*b + 1)*(3*b + 2)/2\n if a>=q:\n b=b+1\n else:\n break\n \nif (n-6)%3==0:\n b=0\n while c==0:\n a = (n-6-6*b)/3\n q = (3*b + 2)*(3*b + 3)/2\n if a>=q:\n b=b+1\n else:\n break\n\n \nprint(b)", "print((lambda n: len([1 for x in range(1, int((-1 + (24 * n + 25) ** 0.5) / 6) + 1) if (n - 2 * x) % 3 == 0]))(int(input())))\r\n", "#(N - 2*n)%3 == 0\r\n#(N - 2*n) >= 3*((n-1)*(n))//2\r\n# 2*N >= 4*n + 3*(n*n - n)\r\n# 0 >= 3*n*n + n - 2*N\r\n\r\n\r\n\r\n\r\nN=int(input())\r\n\r\na=0\r\nb=10**12\r\nwhile(b-a>1):\r\n e=(b+a)//2\r\n if(3*e*e+e-2*N<=0):\r\n a=e\r\n else:\r\n b=e\r\nx=a\r\nif(N%3==0):\r\n print(x//3)\r\nelif(N%3==1):\r\n inc=0\r\n if(x%3==2):\r\n inc+=1\r\n print(x//3+inc)\r\nelse:\r\n inc=0\r\n if(x%3>=1):\r\n inc=1\r\n print(x//3+inc)\r\n", "n = int(input())\ni = 1\nr = 0\nwhile i * (i + 1) * 3 // 2 - i <= n:\n if (n - i * (i + 1) * 3 // 2 + i) % 3 == 0:\n r += 1\n i += 1\nprint(r)\n", "import math\r\n\r\nn = int(input())\r\nmax_k = (math.sqrt(1 + 24 * n) - 1) / 6\r\ncount = 0\r\nfor i in range(1, round(max_k) + 1):\r\n n0 = (6 * i + 1) * (6 * i + 1) - 1\r\n if n0 % 24 == 0:\r\n n0 = n0 // 24\r\n if n >= n0 and (n - n0) % 3 == 0:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nres = 0\r\n\r\nfloors = 0\r\nmaxCardForRooms = 0\r\nwhile maxCardForRooms < n:\r\n maxCardForRooms += 2+3*floors\r\n floors += 1\r\nif maxCardForRooms != n:\r\n floors -= 1\r\nfor j in range(floors):\r\n if (n - 2*(j+1))%3 == 0:\r\n res += 1\r\n\r\nprint(res)\r\n", "n = int(input())\r\nl, r = 0, n + 1\r\nwhile l + 1 < r:\r\n m = (l + r) >> 1\r\n if m * (3 * m + 1) <= n * 2:\r\n l = m\r\n else:\r\n r = m\r\nprint(len([1 for x in range(1, l + 1) if (n - 2 * x) % 3 == 0]))\r\n", "n = int(input())\ncnt = 0\nfor k in range(1, 100000000):\n\tif n >= 2*k + 3*k*(k-1) // 2:\n\t\tif n%3 == 2*k % 3:\n\t\t\tcnt+=1\n\telse:\n\t\tbreak\nprint(cnt)\n", "print((lambda n: sum(not (n - 2 * x) % 3 for x in range(1, int((-1 + (24 * n + 25) ** 0.5) / 6) + 1)))(int(input())))\r\n", "R = lambda: map(int, input().split())\r\n\r\ndef gc(h):\r\n return 2 * h + 3 * h * (h - 1) // 2\r\n\r\nmx = 10**7\r\nn = int(input())\r\ncnt = 0\r\nfor f in range(1, mx):\r\n base = gc(f)\r\n if base > n:\r\n break\r\n if (n - base) % 3 == 0:\r\n cnt += 1\r\nprint(cnt)", "def is_suit(n, k):\r\n return n >= ((k * (k + 1)) // 2)\r\n\r\n\r\ndef check2(n, k, j=1):\r\n if k == 0 and n == 0:\r\n return True\r\n cur = False\r\n for i in range(j, n + 1):\r\n cur |= check2(n - i, k - 1, j + 1)\r\n return cur\r\n\r\n\r\ndef check(n, k):\r\n if n < k:\r\n return False\r\n r = 3 - (n % 3)\r\n k = (k - 1) * 3 + r\r\n tmp = (n - 2*k) // 3\r\n return is_suit(tmp, k) or is_suit(tmp, k - 1)\r\n\r\n\r\ndef search(n):\r\n l = 0\r\n r = 10000000001\r\n while r - l > 1:\r\n #print(l, r)\r\n m = (r + l) // 2\r\n if check(n, m):\r\n l = m\r\n else:\r\n r = m\r\n return l\r\n\r\n\r\ndef main():\r\n print(search(int(input())))\r\n# for i in range(20):\r\n# n, k = tuple(map(int, input().split()))\r\n# print(check2(n, k), check(n, k))\r\nmain()\r\n", "n, bisect = int(input()), lambda l, r: l if r <= l + 1 else (bisect((l + r) >> 1, r) if (3 * ((l + r) >> 1) - 2) * (((l + r) >> 1) + 1) <= n * 2 else bisect(l, (l + r) >> 1))\r\nprint((bisect(0, n) - (n + bisect(0, n)) % 3 + 2) // 3)\r\n", "print((lambda x: (x[1] - (x[0] + x[1]) % 3 + 2) // 3)((lambda n: [n, int((-1 + (1 + 24 * n) ** 0.5) / 6)])(int(input()))))\r\n", "def check(have,floor):\r\n if have%3 or have<0: \r\n return False\r\n n=have//3\r\n need=floor*(floor-1)//2\r\n return n>=need\r\nn=int(input())\r\nans=0\r\nfor i in range(3000000):\r\n have=n-(i+1)*2\r\n if check(have,i+1): \r\n ans+=1\r\nprint(ans)", "import sys\r\nn = int(sys.stdin.readline())\r\ndef sum (n):\r\n return ((n+1)*n)//2\r\na=1\r\nres = 0\r\nwhile (3*sum(a-1) +2*a <= n):\r\n if (n-2*a)% 3 == 0 :\r\n res += 1\r\n a+=1\r\n\r\nprint (res)", "import math\nn = int(input())\n\nprint( int( math.floor(( math.floor((math.floor((-1.0+math.sqrt(1.0+24.0*n)) / 6.0 + 10**-6) + n) / 3.0 ) * 3.0 - n + 2.0 + 10**-6 ) / 3.0 ) ))\n\n\n'''\ncnt = 0\nfor k in range(1, 100000000):\n\tif n >= 2*k + 3*k*(k-1) // 2:\n\t\tif n%3 == 2*k % 3:\n\t\t\tcnt+=1\n\telse:\n\t\tbreak\nprint(cnt)\n'''\n", "import math\nn = int(input())\nx = (math.sqrt(1+24*n)-1)/6\nprint(int((x+n%3)//3) )\n \t \t \t\t \t \t\t\t\t\t \t\t \t\t", "from itertools import count\r\n\r\ndef f(n):\r\n\tleast = 0\r\n\tret = 0\r\n\tfor x in count(1):\r\n\t\tleast += 3 * x - 1\r\n\t\tif least > n:\r\n\t\t\tbreak\r\n\t\tif (n - least) % 3 == 0:\r\n\t\t\tret += 1\r\n\treturn ret\r\n\r\nn = int(input())\r\nprint(f(n))\r\n", "n = int(input())\n\nprint((int((1 + 24 * n) ** 0.5 - 1) // 6 + n % 3) // 3)\n\n\n\n# Made By Mostafa_Khaled", "cards = int(input())\r\n\r\nresult = 0\r\nn = 0\r\nwhile True:\r\n n+=1\r\n needed = 2*n + 3*n*(n-1)/2\r\n\r\n if cards < needed:\r\n break\r\n if (cards - needed)%3 == 0:\r\n result+=1\r\n\r\nprint(result)\r\n" ]

[ "from math import sqrt\r\n\r\nn, k = map(int, input().split())\r\nx1, y1 = map(float, input().split())\r\n\r\ndistance = 0.0\r\nfor i in range(n - 1):\r\n x2, y2 = map(float, input().split())\r\n distance += sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\r\n x1 = x2\r\n y1 = y2\r\ntime = distance / 50\r\nprint(time * k)", "from collections import deque, Counter, OrderedDict\r\nfrom heapq import nsmallest, nlargest\r\nfrom math import ceil,floor,log,log2,sqrt,gcd,factorial,pow\r\ndef binNumber(n,size=4):\r\n return bin(n)[2:].zfill(size)\r\n\r\ndef iar():\r\n return list(map(int,input().split()))\r\n\r\ndef ini():\r\n return int(input())\r\n\r\ndef isp():\r\n return map(int,input().split())\r\n\r\ndef sti():\r\n return str(input())\r\n\r\ndef par(a):\r\n print(' '.join(list(map(str,a))))\r\n\r\ndef tdl(outerListSize,innerListSize,defaultValue = 0):\r\n return [[defaultValue]*innerListSize for i in range(outerListSize)]\r\n\r\nclass pair:\r\n def __init__(self,f,s):\r\n self.fi = f\r\n self.se = s\r\n def __lt__(self,other):\r\n return (self.fi,self.se) < (other.fi,other.se)\r\n\r\n# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef dist(x1,y1,x2,y2):\r\n return sqrt((x2-x1)**2 + (y2-y1)**2)\r\nif __name__ == \"__main__\":\r\n n,k = isp()\r\n s = 0\r\n p = []\r\n for _ in range(n):\r\n x,y = isp()\r\n p.append(pair(x,y))\r\n for i in range(1,n):\r\n s += dist(p[i].fi,p[i].se,p[i-1].fi,p[i-1].se)\r\n s *= k\r\n print(s/50)", "class point:\n x= 0\n y = 0\n def __init__(self,a,b):\n self.x = a\n self.y = b\ndef dist(a,b):\n return (((b.x-a.x)*(b.x-a.x))+((b.y-a.y)*(b.y-a.y)))**.5\narr = []\nn,k = list(map(int,input().split()))\nfor i in range(0,n,1):\n a,b = list(map(int,input().split()))\n p = point(a,b)\n arr.append(p)\ndista = 0.0 \nfor i in range(0, n-1,1):\n dista += (dist(arr[i],arr[(i+1)]))\n #print(i,(i+1)%tam)\nprint('{0:.8f}'.format((dista*k)/50))\n", "n, k = map(int, input().split())\r\nx1, y1 = map(float, input().split())\r\nsum = 0\r\nfor i in range(n-1):\r\n x2, y2 = map(float, input().split())\r\n d = pow(pow(x2 - x1,2) + pow(y2 - y1,2), (1/2))\r\n x1 = x2\r\n y1 = y2\r\n sum += d\r\nans = (sum * k)/50\r\nprint(ans)\r\n", "# Link: https://codeforces.com/contest/127/problem/A\r\n\r\nimport math\r\n\r\ncoordinates = []\r\nsignature_length = 0\r\nnumber_of_signature_endpoints, papers_signed = map(int, input().split())\r\n\r\nfor index, _ in enumerate(range(number_of_signature_endpoints)):\r\n x, y = map(int, input().split())\r\n coordinates.append([x, y])\r\n\r\n if index >= 1:\r\n previous_x = coordinates[index - 1][0]\r\n previous_y = coordinates[index - 1][1]\r\n\r\n signature_length += math.sqrt((previous_x - x)**2 + (previous_y - y)**2)\r\n\r\ntime_wasted_in_seconds = (signature_length / 50) * papers_signed\r\nprint(time_wasted_in_seconds)", "line = input('').split()\r\ntekrar = int(line[1])\r\nkonum = []\r\nfor _ in range(int(line[0])):\r\n a = input('').split()\r\n konum.append(((int(a[0]), int(a[1]))))\r\ndistance = 0\r\ncounter = 0\r\nwhile counter<len(konum)-1:\r\n x = konum[counter][0] - konum[counter+1][0]\r\n y = konum[counter][1] - konum[counter+1][1]\r\n distance += (x**2 + y**2)**(1/2)\r\n counter += 1\r\nprint(distance*tekrar/50)", "import math\r\nn,k=map(int,input().split())\r\nprev1,prev2 = map(int,input().split())\r\ntotal = 0\r\nfor i in range(1,n):\r\n tmp1,tmp2=map(int,input().split())\r\n total+=math.sqrt((tmp1-prev1)**2+(tmp2-prev2)**2)\r\n prev1,prev2 = tmp1,tmp2\r\nprint(total*k*0.02)", "from math import sqrt\r\nn, k = map(int, input().split())\r\ns = 0\r\nx, y = map(int, input().split())\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n s += sqrt(pow((x - a), 2) + pow((y - b), 2))\r\n x = a\r\n y = b\r\ns *= k\r\nprint(\"{0:.6f}\".format(s/50))", "#\r\n# Author: eloyhz\r\n# Date: Sep/07/2020\r\n#\r\n\r\nfrom math import sqrt\r\n\r\ndef d(x1, y1, x2, y2):\r\n return sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\r\n\r\n\r\nif __name__ == '__main__':\r\n n, k = [int(x) for x in input().split()]\r\n a = []\r\n for _ in range(n):\r\n a.append([int(x) for x in input().split()])\r\n s = 0\r\n for i in range(n - 1):\r\n s += d(a[i][0], a[i][1], a[i + 1][0], a[i + 1][1])\r\n print(f'{s * k / 50:.9f}')\r\n\r\n\r\n", "import math\r\nn,k = map(int, input().split())\r\n\r\ndis = 0\r\npath = []\r\npast = None\r\nfor _ in range(n):\r\n x,y = map(int, input().split())\r\n if past:\r\n dis += math.sqrt((x-past[0])**2 + (y-past[1])**2)\r\n past = [x,y]\r\n\r\nprint(k*(dis/50))\r\n ", "import math as ma\r\nn, k = map(int, input().split())\r\n\r\na, b = map(int, input().split())\r\nl = 0\r\n\r\nfor i in range(n-1):\r\n c, d = map(int, input().split())\r\n\r\n l += ma.sqrt((a-c)**2 + (b-d)**2)\r\n\r\n a,b = c,d\r\n\r\nprint(l*k/50)\r\n", "import sys\nimport math\n\n\ndef readlines(type=int):\n return list(map(type, sys.stdin.readline().split()))\n\n\ndef read(type=int):\n return type(sys.stdin.readline().strip())\n\n\njoint = lambda it, sep=\" \": sep.join(\n [str(i) if type(i) != list else sep.join(map(str, i)) for i in it])\n\n\ndef solve(k, points):\n def getDistance(x1, y1, x2, y2):\n return math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\n tot_dist = 0\n for i in range(len(points) - 1):\n tot_dist += getDistance(*points[i], *points[i + 1])\n return \"{:.9f}\".format((k * tot_dist) / 50)\n\n\ndef main():\n n, k = readlines()\n points = [readlines() for _ in range(n)]\n print(solve(k, points))\n\n\nmain()\n", "from itertools import product\r\nfrom math import ceil, gcd, sqrt\r\nimport string\r\nfrom decimal import Decimal\r\n\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 [int(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\ndef is_prime(num):\r\n for i in range(2, num):\r\n if num / i == int(num / i) and num != i:\r\n return False\r\n\r\n return True\r\n\r\n\r\nnum_of_lines, multiplier = map(int, input().split())\r\n\r\nstart_point = [0, 0]\r\nnum_mil = 0\r\nfor i in range(num_of_lines):\r\n x, y = map(int, input().split())\r\n if i == 0:\r\n start_point = [x, y]\r\n else:\r\n num_mil += sqrt((x - start_point[0]) ** 2 + (y - start_point[1]) ** 2)\r\n start_point = [x, y]\r\nprint(Decimal(num_mil * multiplier) / Decimal(50))", "from math import hypot\r\n\r\nn, k = map(int, input().split())\r\n\r\npx, py = map(int, input().split())\r\nln = 0\r\n\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n ln += hypot(x - px, y - py)\r\n px = x\r\n py = y\r\n\r\nprint(ln * k / 50)\r\n \r\n", "n, k = map(int, input().split())\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\n\ns = 0\nfor i in range(1, n):\n s += ((a[i][0]-a[i-1][0])**2 + (a[i][1]-a[i-1][1])**2)**0.5\n\nprint(s*k/50)\n\n", "import math\nl = input().split()\nn, k = int(l[0]), int(l[1])\n\nx = []\ny = []\nfor i in range(n):\n l = input().split()\n x.append(int(l[0]))\n y.append(int(l[1]))\n\nans = 0\nfor i in range(n-1):\n ans += math.sqrt((x[i] - x[i+1]) ** 2 + (y[i] - y[i+1]) ** 2)\n\nprint(ans * k / 50)\n", "n,k = map(int,input().split())\r\ntemp = []\r\nfor _ in range(n):\r\n a,b = map(int,input().split())\r\n temp.append([a,b])\r\nres = 0\r\nfor i in range(1,len(temp)):\r\n for j in range(1,2):\r\n res += (((temp[i][j-1])-(temp[i-1][j-1]))**2 + ((temp[i][j])-(temp[i-1][j]))**2)**0.5\r\n\r\nprint(round((res/50)*k,9))\r\n ", "\r\nn,k = list(map(int,input().split(' ')))\r\n\r\nsum = 0\r\nx0,y0 = list(map(int,input().split(' ')))\r\nfor i in range(n-1):\r\n x,y = list(map(int,input().split(' '))) \r\n sum+=((x-x0)**2+(y-y0)**2)**0.5\r\n x0,y0 = x,y\r\n \r\nsum*=(k/50)\r\nprint(sum)", "n, k = map(int, input().split())\r\nk /= 50\r\nx, y = map(int, input().split())\r\nsize = 0\r\nfor i in range(n - 1):\r\n _x, _y = map(int, input().split())\r\n size += ((x - _x) ** 2 + (y - _y) ** 2) ** 0.5\r\n x = _x\r\n y = _y\r\nprint(size * k)\r\n", "n, k = [int(i) for i in input().split()]\r\n\r\nt = 0\r\nx0, y0 = [float(i) for i in input().split()]\r\nfor i in range(1,n):\r\n\tx, y = [float(i) for i in input().split()]\r\n\td = ((x - x0)**2 + (y - y0)**2) ** 0.5\r\n\tx0, y0 = x, y\r\n\tt += d / 50\r\n\t\r\nprint(t*k)", "from math import sqrt\nn, k = map(int, input().split())\nd = 0\na, b = map(int, input().split())\nfor _ in range(n - 1):\n x, y = map(int, input().split())\n d += sqrt((a - x)**2 + (b - y)**2)\n a, b = x, y\nprint(d * (k / 50))\n ", "inn = list(map(int, input().split(\" \")))\npnts = inn[0]\nmult = inn[1]\ndist = 0\nc = list(map(int, input().split(\" \")))\nfor i in range(1,pnts):\n s = list(map(int, input().split(\" \")))\n x1 = c[0]\n x2 = s[0]\n y1 = c[1]\n y2 = s[1]\n dist += ((((x2 - x1) ** 2) + ((y2 - y1) ** 2)) ** 0.5)\n c = s\ntt = (dist/50)*mult\nprint('%.9f'%tt)", "import math\r\n\r\nn,l=list(map(int,input().split()))\r\n\r\n\r\np=[]\r\n\r\n\r\n\r\n\r\nfor k in range(n):\r\n p.append(list(map(int,input().split())))\r\n\r\n\r\ns=0\r\nfor i in range(1,n):\r\n \r\n s+=math.sqrt(abs(p[i-1][0]-p[i][0])**2+abs(p[i-1][1]-p[i][1])**2)\r\n \r\n\r\n\r\nprint(s*l/50) \r\n", "n,k = map(int,input().split())\r\narr = []\r\nfor i in range(n):\r\n arr.append(list(map(int,input().split())))\r\nlength = 0\r\nfor i in range(0,len(arr)-1):\r\n length += ((arr[i+1][0]-arr[i][0])**2+(arr[i+1][1]-arr[i][1])**2)**0.5\r\nprint(k*length/50)", "n, k = map(int, input().split())\r\npos = list(map(int, input().split()))\r\ns = 0\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n s += ((x-pos[0]) ** 2 + (y - pos[1]) ** 2) ** 0.5\r\n pos = [x, y]\r\nprint(\"%.7f\" % (s / 50 * k))", "# https://codeforces.com/problemset/problem/127/A\r\nfirstline=input()\r\nn,k=int(firstline.split(\" \")[0]),int(firstline.split(\" \")[1])\r\nwriting_speed=50\r\ntotal_distance=0\r\nfor i in range(n):\r\n line=input()\r\n x2,y2=int(line.split(\" \")[0]),int(line.split(\" \")[1])\r\n if(i==0):\r\n x1,y1=x2,y2\r\n else:\r\n total_distance=total_distance+(((x2-x1)**2+(y2-y1)**2)**0.5)\r\n x1,y1=x2,y2\r\nprint(round(total_distance*k/writing_speed,9))", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn,k = get_int_list()\r\nx,y = get_int_list()\r\nd = 0\r\nfor i in range(n-1):\r\n x1,y1 = get_int_list()\r\n d += math.sqrt( (x-x1)**2 + (y-y1)**2 )\r\n x,y = x1,y1\r\nd = d*k\r\nprint( '{0:.9f}'.format(d/50) )\r\n", "n, k = map(int, input().split())\r\n\r\ncur_point = list(map(int, input().split()))\r\ntotal_range = 0\r\n\r\nfor i in range(n-1):\r\n next_point = list(map(int, input().split()))\r\n r = (cur_point[0] - next_point[0])**2 + (cur_point[1] - next_point[1])**2\r\n r = r**0.5\r\n total_range += r\r\n cur_point = next_point[:]\r\n\r\nprint(total_range / 50 * k)\r\n", "lineFirst = list(map(int, input().split()))\r\n\r\ncoordinateAmount = lineFirst[0]\r\npaperAmount = lineFirst[1]\r\n\r\nlineTemp = list(map(int, input().split()))\r\nxPrevious = lineTemp[0]\r\nyPrevious = lineTemp[1]\r\n\r\n\r\ndef coordinateDistance(x, xPrevious, y, yPrevious):\r\n distance = (((x-xPrevious)**2) + ((y-yPrevious)**2))**(1/2)\r\n return distance\r\n\r\n\r\ndistanceSign = 0\r\n\r\nfor i in range(coordinateAmount - 1):\r\n lineTemp = list(map(int, input().split()))\r\n x = lineTemp[0]\r\n y = lineTemp[1]\r\n distanceTemp = 0\r\n if x == xPrevious:\r\n distanceTemp = abs(y-yPrevious)\r\n elif y == yPrevious:\r\n distanceTemp = abs(x-xPrevious)\r\n else:\r\n distanceTemp = coordinateDistance(x, xPrevious, y, yPrevious)\r\n distanceSign += distanceTemp\r\n xPrevious = x\r\n yPrevious = y\r\n\r\nprint((distanceSign*paperAmount)/50)\r\n", "from math import sqrt\n\nn, k = (int(i) for i in input().split())\nres = 0\nx0, y0 = (int(i) for i in input().split())\nfor _ in range(n - 1):\n x, y = (int(i) for i in input().split())\n res += sqrt((x - x0)**2 + (y - y0)**2) / 50\n x0, y0 = x, y\nres *= k\nprint(res)\n", "import math\r\nn,k=map(int,input().split())\r\nans=0\r\narr=[]\r\nfor ii in range(n):\r\n\tx,y=map(int,input().split())\r\n\tarr.append([x,y])\r\nfor i in range(n-1):\r\n\txx=arr[i][0]-arr[i+1][0]\r\n\tyy=arr[i][1]-arr[i+1][1]\r\n\ttemp=(xx**2)+(yy**2)\r\n\tans+=(temp**0.5)\r\nprint(k*ans/50)", "import math\r\nn,k = [int(x) for x in input().split()]\r\ndist =0\r\nprevx,prevy = [int(x) for x in input().split()]\r\nfor i in range(1,n):\r\n x,y = [int(x) for x in input().split()]\r\n dist+= math.sqrt(abs(x-prevx)**2 + abs(y-prevy)**2)\r\n prevx = x\r\n prevy = y\r\nprint((dist/50)*k)", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nn,k=R()\r\nx=[0]*n\r\ny=[0]*n\r\n\r\nfor i in range(n):\r\n x[i],y[i]=R()\r\n \r\nl=0\r\nfor i in range(n-1):\r\n l+=math.sqrt((x[i]-x[i+1])**2+(y[i]-y[i+1])**2)\r\n\r\nprint(l*k/50)\r\n", "from itertools import tee\nimport math\n\ndef pairwise(iterable):\n # pairwise('ABCDEFG') --> AB BC CD DE EF FG\n a, b = tee(iterable)\n next(b, None)\n return zip(a, b)\n\nn, k = map(int, input().split())\n\ndist = lambda x1, y1, x2, y2: math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\nps = [list(map(int, input().split())) for _ in range(n)]\n\ntotal = 0\nfor [x1, y1], [x2, y2] in pairwise(ps):\n total += dist(x1, y1, x2, y2)\nprint(total / 50 * k)\n\n", "\r\nfrom math import sqrt\r\ndist = lambda p1,p2: sqrt(sum([(p1[i]-p2[i])**2 for i in range(len(p1))])) #n-d point\r\nn,k = list(map(int,input().split()))\r\nps = [list(map(int,input().split())) for _ in range(n)]\r\nprint(0.02*k*sum([dist(ps[i],ps[i+1]) for i in range(n-1)]))\r\n\r\n", "import sys\r\ndef input():\r\n return sys.stdin.readline()\r\n\r\nn,k = list(map(int,input().split()))\r\ncounter,last = 0,[]\r\nfor i in range(n):\r\n x,z = list(map(int,input().split()))\r\n if last:\r\n counter += ((x-last[0])**2+(z-last[1])**2)**0.5\r\n last = [x,z]\r\nprint(format((counter/50)*k, '.9f'))", "import decimal\r\nD=decimal.Decimal\r\nl1 = [int(x) for x in input().split()]\r\nn,k = l1[0],l1[1]\r\nprev=[]\r\ncoords=[]\r\ndistance = 0 \r\n\r\nfor x in range(n):\r\n coords = [int(x) for x in input().split()]\r\n if x!=0:\r\n #print(prev,coords)\r\n #print((prev[0]-coords[0])**2,(prev[1]-coords[1])**2)\r\n distance+=D(((prev[0]-coords[0])**2+(prev[1]-coords[1])**2)**(1/2))\r\n prev[0]=int(coords[0])\r\n prev[1]=int(coords[1])\r\n\r\n else:\r\n prev.append(int(coords[0]))\r\n prev.append(int(coords[1]))\r\n#print(k,distance)\r\nprint(D(k*D(distance/50)))", "from math import sqrt\r\nn, k = map(int,input().split())\r\nd = 0\r\nx1,y1 = map(int,input().split())\r\nfor i in range(n-1):\r\n x2,y2 = map(int,input().split())\r\n d += sqrt((x1-x2)**2+(y1-y2)**2)\r\n x1,y1 = x2,y2\r\nprint(k*(d/50))", "n, k = map(int, input().split())\r\nl = 0\r\nx, y = map(int, input().split())\r\nfor i in range(1, n):\r\n x1, y1 = map(int, input().split())\r\n l += ((x-x1)**2 + (y-y1)**2)**0.5\r\n x, y = x1, y1\r\nprint(k * l / 50)\r\n", "import math\n\n\nn, k = map(int, input().split())\n\na = []\nfor _ in range(n):\n a.append(tuple(map(int, input().split())))\n\nd = 0\nfor i in range(len(a) - 1):\n d += math.sqrt((a[i][0] - a[i+1][0]) ** 2 + (a[i][1] - a[i+1][1]) ** 2)\nprint(d * k / 50)\n", "import math\r\n\r\nn, k = map(int, input().split()) # Read the values of n and k\r\n\r\npoints = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split()) # Read the coordinates of each point\r\n points.append((x, y))\r\n\r\ntotal_distance = 0\r\nfor i in range(n - 1):\r\n x1, y1 = points[i]\r\n x2, y2 = points[i + 1]\r\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2) # Calculate the distance between two points\r\n total_distance += distance\r\n\r\ntotal_time = total_distance / 50 * k # Calculate the total time wasted\r\n\r\nprint(\"{:.9f}\".format(total_time)) # Print the result with 9 decimal places\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\npoints = []\r\ntotal_length = 0\r\n\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\nfor i in range(1, n):\r\n x1, y1 = points[i - 1]\r\n x2, y2 = points[i]\r\n segment_length = math.sqrt((x2 - x1)**2 + (y2 - y1)**2)\r\n total_length += segment_length\r\n\r\ntotal_time = total_length / 50 * k\r\nprint(\"{:.9f}\".format(total_time))\r\n", "\nfrom math import sqrt\n\ndef l(a):\n t = 0\n for i in range(1, len(a)):\n t += sqrt((a[i][1] - a[i-1][1])**2 + (a[i][0] - a[i-1][0])**2)\n return t\n\nn, k = list(map(int, input().split()))\na = []\nfor _ in range(n):\n a.append(list(map(int, input().split())))\n\nprint(k*l(a)/50)", "from math import dist\r\nn,k = map(int,input().split())\r\nl = []\r\nfor _ in range(n): l.append(list(map(int,input().split())))\r\nc = 0\r\nfor i in range(len(l)-1): c+=dist(l[i],l[i+1])\r\nprint(\"%.9f\"%(c/50*k),end=\"\")", "n,k = map(int,input().split())\nx,y = map(int,input().split())\ndist = 0\nfor _ in range(n-1):\n x1,y1 = map(int,input().split())\n temp = ((x1-x)**2+(y1-y)**(2))**(1/2)\n dist = dist + temp\n x,y = x1,y1\nprint(k*dist/50)\n", "from math import hypot\r\n\r\nn, k = input().split(\" \")\r\n\r\nx, y = input().split(\" \")\r\nprevX = int(x)\r\nprevY = int(y)\r\nans = 0\r\n\r\nfor _ in range(int(n) - 1):\r\n\tx, y = input().split(\" \")\r\n\tans += hypot(prevX - int(x), prevY - int(y))\r\n\tprevX = int(x)\r\n\tprevY = int(y)\r\n\r\nprint(ans * int(k) / 50)\r\n", "import math\r\nps, k = map(int, input().split())\r\n\r\nprev = []\r\n\r\ndist = 0\r\n\r\nfor i in range(ps):\r\n p = list(map(float, input().split()))\r\n # print(prev)\r\n if prev:\r\n dist += math.sqrt((p[0] - prev[0])**2.0 + (p[1] - prev[1])**2.0)\r\n prev = p\r\n\r\nprint(\"{:.9f}\".format(dist * float(k) * 1/50))", "import math\r\nn, k = map(int, input().split())\r\nbase, ans = [], 0\r\nfor t in range(n):\r\n arr = list(map(int, input().split()))\r\n base.append(arr)\r\nfor i in range(len(base)-1):\r\n x = math.sqrt(((base[i][0] - base[i+1][0]) ** 2) + ((base[i][1] - base[i+1][1]) ** 2))\r\n ans += x\r\nprint((ans / 50) * k)", "n, k = (int(x) for x in input().split())\ndots = []\nres = 0\nfor i in range(n):\n dots.append(tuple(int(x) for x in input().split()))\n if i == 0:\n continue\n res += ((dots[i][0] - dots[i - 1][0])**2 + (dots[i][1] - dots[i - 1][1])**2)**0.5\nprint(res * k / 50)", "def main():\n from math import hypot\n\n [n, k] = [int(_) for _ in input().split()]\n pts = []\n\n for _ in range(n):\n [x, y] = [int(_) for _ in input().split()]\n pts += [(x, y)]\n\n ptdiff = lambda p: (p[0][0] - p[1][0], p[0][1] - p[1][1])\n diffs = map(ptdiff, zip(pts[:-1], pts[1:]))\n path = sum(hypot(d1, d2) for d1, d2 in diffs)\n\n print(path / 50 * k)\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\n\r\ndef distance(a1,a2):\r\n\treturn math.sqrt((a1[0]-a2[0])**2+(a1[1]-a2[1])**2)\r\ndef solution(n,l,k):\r\n\tans = 0.\r\n\tfor i in range(n-1):\r\n\t\tans += distance(l[i],l[i+1]) \r\n\r\n\treturn round(ans*k/50,6)\r\n\r\n\r\n\r\nn,k = [int(x) for x in input().split(' ')]\r\n_list = []\r\nfor i in range(n):\r\n\t_list.append([int(x) for x in input().split(' ')])\r\n\r\nprint(\"{0:.9f}\".format(round(solution(n,_list,k),9)))", "import math\ninp = str(input()).split(\" \")\nn = int(inp[0])\nk = int(inp[1])\n\n\ndef pythag(a, b):\n x1, y1 = a\n x2, y2 = b\n return math.sqrt(abs(x2 - x1) ** 2 + abs(y2 - y1) ** 2)\n\n\nvalues = []\nfor i in range(n):\n inp = str(input()).split(\" \")\n values.append((int(inp[0]), int(inp[1])))\n\ntotal = 0\nfor i in range(1, len(values), 1):\n total += pythag(values[i - 1], values[i])\ntotal*=k\ntotal/=50\nprint(\"%.7f\" %(total))\n", "import math as ma\r\ns=input()\r\ns=s.split(\" \")\r\nn=int(s[0])\r\nk=int(s[1])\r\ns=input()\r\ns=s.split(\" \")\r\nxp=int(s[0])\r\nyp=int(s[1])\r\n\r\nd=0\r\nfor _ in range(n-1):\r\n s = input()\r\n s = s.split(\" \")\r\n xa = int(s[0])\r\n ya = int(s[1])\r\n d=d+ma.sqrt((xp-xa)**2+(yp-ya)**2)\r\n xp=xa\r\n yp=ya\r\n\r\nprint((d/50)*k)\r\n\r\n\r\n\r\n\r\n\r\n", "import math\r\n\r\ns = input()\r\nn, k = int(s.split()[0]), int(s.split()[1])\r\n\r\narr = []\r\n\r\nfor i in range(n):\r\n s = input()\r\n x, y = int(s.split()[0]), int(s.split()[1])\r\n arr.append([x, y])\r\n\r\nres = 0.0\r\n\r\nfor i in range(n - 1):\r\n res += math.sqrt(pow(arr[i][0] - arr[i + 1][0], 2) + pow(arr[i][1] - arr[i + 1][1], 2))\r\n\r\nprint(res * (k/50.0))", "n,k=map(int,input().split())\r\nc=0\r\nx=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append([a,b])\r\nfor i in range(1,n):\r\n a,b=x[i][0]-x[i-1][0],x[i][1]-x[i-1][1]\r\n c+=(a*a+b*b)**0.5\r\nprint((c/50)*k)", "n, k = map(int, input().split());\nx, y = map(int, input().split());\nv = 0\nfor i in range(n - 1):\n a, b = map(int, input().split())\n t = (a - x) ** 2 + (b - y) ** 2;\n v += t ** 0.5\n x, y = a, b\nprint(v * k / 50)\n", "n,m = map(int,input().split())\r\nx,y = map(int,input().split())\r\nnum = 0\r\nfor i in range(1,n):\r\n xx,yy = map(int,input().split())\r\n num += ((x - xx) ** 2 + (y - yy) ** 2) ** 0.5\r\n x,y = xx,yy\r\nprint(f'{num * m / 50:.9f}')", "import math\r\nn , k= list(map(int,input().split()))\r\nli = [ tuple(map(int,input().split())) for i in range(n)]\r\ni ,j ,length = 0 , 1 , 0\r\nwhile j < n:\r\n x1 , y1 = li[i]\r\n x2 , y2 = li[j]\r\n \r\n length += math.sqrt( (x2-x1)**2 + (y2-y1)**2 )\r\n i += 1 ; j += 1\r\n\r\nprint('%.9f'%((length/50)*k))\r\n", "from math import sqrt\n\n\nn,k = map(int,input().split())\nprev = tuple(map(int,input().split()))\ndis = 0\nfor i in range(n-1):\n curr = tuple(map(int,input().split()))\n dis += sqrt((curr[0] - prev[0])**2 + (curr[1]-prev[1])**2)\n prev = curr\nprint(dis *k / 50)\n", "import math\nthings = [*map(int, input().split())]\ndistance = 0\nprev_point = [*map(int, input().split())]\nfor _ in range(0, things[0]-1):\n new_point = [*map(int, input().split())]\n distance += math.sqrt((new_point[0] - prev_point[0])**2 + (new_point[1] - prev_point[1])**2)\n prev_point = new_point\n\n\nprint((distance/50.0) * things[1])\n\n", "import math\r\n\r\ndef Citire():\r\n l = input()\r\n a = b = 0\r\n aux = 0\r\n semn = 1\r\n for i in l:\r\n if i.isnumeric():\r\n aux = aux * 10 + int(i)\r\n elif (i == '-'):\r\n semn *= -1\r\n else:\r\n a = semn * aux\r\n semn = 1\r\n aux = 0\r\n b = semn * aux\r\n return (1.0 * a, 1.0 * b)\r\n\r\ndef Dist():\r\n a = 1.0 * (x - x1) * (x - x1)\r\n b = 1.0 * (y - y1) * (y - y1)\r\n return math.sqrt(a + b)\r\n\r\nn, k = Citire()\r\nn = int(n)\r\nx, y = Citire()\r\nd = 0.0\r\n\r\nfor i in range(n - 1):\r\n x1, y1 = Citire()\r\n d += Dist()\r\n x = x1\r\n y = y1\r\nd *= (k / 50)\r\nprint(round(d, 9))\r\n", "#----Kuzlyaev-Nikita-Codeforces-----\r\n#------------06.04.2020-------------\r\n\r\nalph=\"abcdefghijklmnopqrstuvwxyz\"\r\n\r\n#-----------------------------------\r\n\r\nn,k=map(int,input().split())\r\nE=0;x,y=map(int,input().split())\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n r=((x-a)**2+(y-b)**2)**0.5\r\n E+=r;x,y=a,b\r\nprint(\"%.9f\"%(E*k/50))", "import math\r\nn, k = map(int, input().split())\r\nl = []\r\nfor i in range(n):\r\n\tx, y = map(int, input().split())\r\n\tl.append((x, y))\r\n\r\ns = 0\r\nfor i in range(1, n):\r\n\tx1 = l[i - 1][0]\r\n\ty1 = l[i - 1][1]\r\n\tx2 = l[i][0]\r\n\ty2 = l[i][1]\r\n\t\r\n\ts += math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2) / 50\r\n\r\nprint(s * k)", "import sys\nimport math\n\n\nlines = sys.stdin.read().splitlines()\nnk = lines[0].split()\nn = int(nk[0])\nk = int(nk[1])\ncoord = []\nfor i in range(n):\n temp = []\n for num in lines[i+1].split():\n temp.append(int(num))\n coord.append(temp)\ndis = 0\nfor i in range(n-1):\n dis += math.dist(coord[i], coord[i+1])\nres = (dis / 50) * k\nprint(res)\n\n\t\t \t\t\t \t \t\t \t\t \t\t \t \t \t \t \t", "from math import sqrt\r\nn, m = map(int, input().split())\r\n\r\ntotal = 0\r\npoints = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n points.append((a, b))\r\n\r\n\r\ncur = points[0]\r\nfor i in range(1, n):\r\n a, b = cur\r\n c, d = points[i]\r\n\r\n dist = sqrt((c - a) ** 2 + (d - b) ** 2)\r\n total += dist\r\n cur = points[i]\r\n\r\nprint(total / 50 * m)", "from math import sqrt\r\ndef distance(A,B):\r\n return sqrt((A[0]-B[0])**2 + (A[1]-B[1])**2)\r\nn,k = map(int, input().split())\r\nbase = list(map(int, input().split()))\r\nd = 0\r\nfor i in range(n-1):\r\n pt = list(map(int, input().split()))\r\n d += distance(base, pt)\r\n base = pt\r\nd=d*k\r\nprint(d/50)\r\n", "import math\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nd = 0\r\nx0, y0 = map(int, input().split())\r\nfor _ in range(n - 1):\r\n x, y = map(int, input().split())\r\n d0 = math.sqrt(pow(x - x0, 2) + pow(y - y0, 2))\r\n d += d0\r\n x0, y0 = x, y\r\nans = d * k / 50\r\nprint(ans)", "n, k = map(int, input().split())\r\nx, y = map(int, input().split())\r\nl = 0\r\nfor i in range(n - 1):\r\n u, v = map(int, input().split())\r\n l += ((x - u) ** 2 + (y - v) ** 2) ** 0.5\r\n x, y = u, v\r\nprint(k * l / 50)\r\n", "n,k=map(int,input().split())\r\nm=0;l=[]\r\nfor x in range(n) : \r\n x,y = map(int,input().split())\r\n l.append([x,y])\r\nfor x in range(1,n) : \r\n a,b=l[x][0],l[x][1]\r\n a1,b1=l[x-1][0],l[x-1][1]\r\n m+=(((a-a1)**2)+((b-b1)**2))**(1/2)\r\nm=(m/50)*k\r\nprint(\"%.9f\"%m)\r\n ", "n, k = map(int, input().split())\n\nlength = 0\nx1, y1 = map(int, input().split())\nfor _ in range(n - 1):\n x2, y2 = map(int, input().split())\n length += ((x2-x1)**2 + (y2-y1)**2) ** 0.5\n x1, y1 = x2, y2\n\nprint(length * k / 50)\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,b=map(int,input().split())\r\nn-=1\r\ndist=0\r\nfor i in range(n):\r\n p,q=map(int,input().split())\r\n dist+=((p-a)**2+(q-b)**2)**0.5\r\n a,b=p,q\r\nprint(\"{:.10f}\".format(dist*k/50))", "import sys\r\nimport math\r\n\r\nn,k=map(int,input().split())\r\na,b=map(int,input().split())\r\nx=a+b*1j\r\nL=0.0\r\nfor i in range(1,n):\r\n a,b=map(int,input().split())\r\n y=a+b*1j\r\n L+=abs(y-x)\r\n x=y\r\nprint(k*L/50)", "from math import sqrt\r\nn,k = map(int,input().split())\r\na = []\r\nx,y = map(int,input().split())\r\na.append([x,y])\r\nd = 0\r\nfor i in range(1,n):\r\n x,y = map(int,input().split())\r\n a.append([x,y])\r\n d += sqrt((x-a[i-1][0])**2+(y-a[i-1][1])**2)\r\nprint('%.6f'%(d*k/50))\r\n", "import sys\nimport math\ninp = sys.stdin.readline().replace('\\n','').split()\nn = int(inp[0])\nk = int(inp[1])\nx_cords = []\ny_cords = []\nfor i in range(n):\n inp = sys.stdin.readline().replace('\\n','').split()\n x_cords.append(int(inp[0]))\n y_cords.append(int(inp[1]))\n\nanswer = 0\nfor i in range(n-1):\n answer += math.sqrt((x_cords[i+1] - x_cords[i]) * (x_cords[i+1] - x_cords[i]) + (y_cords[i+1] - y_cords[i]) * (y_cords[i+1] - y_cords[i]))\nprint(answer * k / 50)\n \t\t \t \t\t \t \t\t \t\t\t\t \t\t\t \t\t\t \t\t", "import math\n\ndef calculate_total_time_wasted():\n nums = str(input())\n nums = nums.split(\" \")\n nums = [int(i) for i in nums]\n n = nums[0]\n k = nums[1]\n signature_points = []\n for i in range(n):\n signature_points.append(tuple(map(int, input().split(\" \"))))\n\n total_distance = 0\n\n for i in range(len(signature_points) - 1):\n x1, y1 = signature_points[i]\n x2, y2 = signature_points[i + 1]\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n total_distance += distance\n\n total_time = total_distance / 50 * k # Writing speed: 50 millimeters per second\n print(total_time)\n\nif __name__ == '__main__':\n calculate_total_time_wasted()\n \t\t\t\t\t \t \t\t \t \t \t\t \t\t \t\t", "import math\r\n\r\n# Read n and k\r\nn, k = map(int, input().split())\r\n\r\n# Initialize total time\r\ntotal_time = 0\r\n\r\n# Read the coordinates of each point in the polyline\r\nx1, y1 = map(int, input().split())\r\n\r\nfor _ in range(n - 1):\r\n x2, y2 = map(int, input().split())\r\n # Calculate the distance between two consecutive points\r\n distance = math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\r\n # Add the distance to the total time\r\n total_time += distance / 50\r\n # Update the starting point for the next segment\r\n x1, y1 = x2, y2\r\n\r\n# Multiply the total time by the number of signatures\r\ntotal_time *= k\r\n\r\n# Output the result\r\nprint(\"{:.9f}\".format(total_time))\r\n", "def distance(x1,y1,x2,y2):\r\n res = pow((x1-x2)**2+(y1-y2)**2,0.5)\r\n # print(res)\r\n return res/1000\r\nn,m =map(int,input().split())\r\nx1,y1 = map(int,input().split())\r\nacc= 0\r\nfor i in range(n-1):\r\n x2,y2 = map(int,input().split())\r\n acc +=distance(x1,y1,x2,y2)\r\n x1,y1 = x2,y2\r\nprint((acc/(50/1000))*m)", "from math import sqrt\r\nn, k = map(int, input().split())\r\ndistances = 0\r\nx1, y1 = map(int, input().split())\r\nfor i in range(n - 1):\r\n x2, y2 = map(int, input().split())\r\n distances += sqrt((x2 - x1)**2 + (y2 - y1)**2)\r\n x1, y1 = x2, y2\r\nprint('{:.9f}'.format(distances*k/50))", "import math\n\nn, k = map(int,input().split())\narr =[]\ns = 0\n\nx1, y1 = map(int,input().split())\n\nfor i in range(1, n):\n x, y = map(int,input().split())\n\n s += math.sqrt((x - x1) ** 2 + (y - y1) ** 2)\n x1 = x\n y1 = y\n\ns = s * (k / 50)\nprint('%.9f'%s)\n", "# count=int(input())\r\n# while count>0:\r\n# ab=list(map(int,input().split()))\r\n# # a.sort()\r\n# # print(a)\r\n# b=list(map(int,input().split()))\r\n# ce=list(map(int,input().split()))\r\n# d=list(map(int,input().split()))\r\n# # d=asd+b+c\r\n# # d.sort()\r\n# # print(d)\r\n# c,e,f,g=0,0,0,0\r\n# l=[]\r\n# while c!=ab[1]:\r\n# temp1,temp2,temp3=(99999,8888),(99999,8888),(99999,8888)\r\n# if e<len(d):temp1=c^b[e],1\r\n# if f<len(d):temp2=c^ce[f],2\r\n# if g<len(d):temp3=c^d[g],3\r\n# if temp1[0]==ab[1] or temp2[0]==ab[1] or temp3[0]==ab[1]:\r\n# c=ab[1]\r\n# break\r\n# if e>len(d) or f>len(d) or g>len(d):\r\n# break\r\n# # print(temp1+temp2+temp3)\r\n# k=min((temp1[0]-ab[1]),(temp2[0]-ab[1]),(temp3[0]-ab[1]))\r\n# # print((temp1[0]-ab[1]),(temp2[0]-ab[1]),(temp3[0]-ab[1]))\r\n# if k==(temp1[0]-c):\r\n# # e+=1\r\n# if c>temp1[0]:\r\n# a=min(temp2[0],temp3[0])\r\n# if a==temp2[0]:\r\n# if c>a:\r\n# a=temp3[0]\r\n# if c>a:\r\n# break\r\n# else:\r\n# c=a\r\n# g+=1\r\n# else:\r\n# c=a\r\n# f+=1\r\n# elif a==temp3[0]:\r\n# if c>a:\r\n# a=temp2[0]\r\n# if c>a:\r\n# break\r\n# else:\r\n# c=a\r\n# f+=1\r\n# else:\r\n# c=temp1[0]\r\n# e+=1\r\n# elif k==(temp2[0]-c):\r\n# f+=1\r\n# if c>temp2[0]:\r\n# a=min(temp1[0],temp3[0])\r\n# if a==temp1[0]:\r\n# if c>a:\r\n# a=temp3[0]\r\n# if c>a:\r\n# break\r\n# else:\r\n# c=a\r\n# else:\r\n# c=a\r\n# elif a==temp3[0]:\r\n# if c>a:\r\n# a=temp1[0]\r\n# if c>a:\r\n# break\r\n# else:\r\n# c=a\r\n# else:\r\n# c=temp2[0]\r\n# else:\r\n# g+=1\r\n# if c>temp3[0]:\r\n# a=min(temp2[0],temp1[0])\r\n# if a==temp2[0]:\r\n# if c>a:\r\n# a=temp1[0]\r\n# if c>a:\r\n# break\r\n# else:\r\n# c=a\r\n# else:\r\n# c=a\r\n# elif a==temp1[0]:\r\n# if c>a:\r\n# a=temp2[0]\r\n# if c>a:\r\n# break\r\n# else:\r\n# c=a\r\n# else:\r\n# c=temp3[0]\r\n# # l.append(c)\r\n# # print(l)\r\n# print(\"Yes\") if c==ab[1] else print(\"No\")\r\n# count-=1\r\n\r\nimport math\r\n\r\n\r\ndef solve():\r\n ab=list(map(int,input().split()))\r\n l,m=list(map(int,input().split()))\r\n ji=[[l,m]]\r\n e=0\r\n for i in range(ab[0]-1):\r\n k,q=list(map(int,input().split()))\r\n o,p=ji[0]\r\n e+=math.sqrt((k-o)**2+(q-p)**2)\r\n ji=[]\r\n ji.append([k,q])\r\n print(e*ab[1]/50)\r\n\r\nsolve()\r\n\r\n\r\n\r\n\r\n", "n, k = input().split()\nn = int(n); k = int(k)\n\nx1, y1 = input().split()\nx1 = int(x1); y1 = int(y1)\ndist = 0\nfor i in range(n-1):\n\tx2, y2 = input().split()\n\tx2 = int(x2); y2 = int(y2)\n\n\tdist += ((x2-x1)**2 + (y2-y1)**2)**0.5\n\tx1 = x2; y1 = y2\n\nprint(dist*k/50)", "from math import sqrt\n\ndef main():\n \n n, k = list(map(int, input().split()))\n pos_start = list(map(int, input().split()))\n dist = 0\n for i in range (n - 1):\n pos = list(map(int, input().split()))\n dist += sqrt((pos_start[0] - pos[0])**2 + (pos_start[1] - pos[1])**2)\n pos_start = pos\n \n print(k * dist / 50)\n \nif __name__ == '__main__':\n main()\n \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())) for _ in range(n)]\r\nt=0\r\nfor i in range(1,n):\r\n t+=(((l[i-1][0]-l[i][0])**2)+((l[i-1][1]-l[i][1])**2))**0.5\r\nprint(t*(k/50))", "n,k=map(int,input().split())\r\na=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\ns=0\r\nfor i in range(n-1):\r\n s+=((a[i][0]-a[i+1][0])**2+(a[i][1]-a[i+1][1])**2)**0.5\r\nprint((s/50)*k) ", "n,k=map(int,input().split())\r\nx,y=map(int,input().split())\r\ns=0\r\nfor i in range(n-1):\r\n x1,y1=map(int,input().split())\r\n s+=((x-x1)**2+(y-y1)**2)**0.5\r\n x,y=x1,y1\r\nprint(s*k/50)\r\n", "import math\r\ndef xxx(x, y):\r\n z = math.sqrt(x**2 + y**2)\r\n return z\r\nx, y = [int(i) for i in input().split()]\r\na, b = [int(i) for i in input().split()]\r\nc = 0\r\nfor i in range(x-1):\r\n z = [int(i) for i in input().split()]\r\n c += xxx(abs(a-z[0]), abs(b-z[1]))\r\n a, b = z[0], z[1]\r\nprint(c*y/50)\r\n", "n,k=map(int,input().split())\r\ns,a,b=0,0,0\r\nfor i in range(n):\r\n c,d=map(int,input().split())\r\n s+=(((c-a)**2+(b-d)**2)**0.5)\r\n a,b=c,d\r\n if i==0:\r\n s=0\r\ns*=(k/50)\r\nprint(s)\r\n \r\n", "from math import sqrt\r\nn,k=map(int,input().split())\r\nans=0\r\nx1,y1=map(int,input().split())\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n ans+=sqrt((x1-x)**2+(y1-y)**2)\r\n x1, y1=x,y\r\nprint(ans*k/50)", "\n__author__ = 'Esfandiar'\nfrom math import sqrt\nn,k = map(int,input().split())\nA = list()\nfor i in range(n):\n A.append(list(map(int,input().split())))\nt = 0\nv = 50\nfor i in range(n-1):\n x = sqrt(((A[i][0] - A[i+1][0]) ** 2) + ((A[i][1] - A[i+1][1]) ** 2))\n t += x/v\nprint(t*k)\n", "import math\r\nn,k = map(int, input().split())\r\ncoords = []\r\nfor i in range(n):\r\n coords.append(list(map(int, input().split())))\r\ndef dist(coord1, coord2):\r\n rise = abs(coord2[1] - coord1[1])\r\n run = abs(coord2[0] - coord1[0])\r\n return math.sqrt(rise ** 2 + run ** 2)\r\nsigLength = 0\r\nfor i in range(n - 1):\r\n sigLength += dist(coords[i], coords[i + 1])\r\nprint((sigLength * k)/50)\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\na, b = map(int, input().split())\r\nz = 0\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n distance = math.sqrt((x-a)**2 + (y-b)**2)\r\n z += distance\r\n a = x\r\n b = y\r\nprint((k*z)/50)", "\r\nfrom math import *\r\nn,k = map(int,input().split())\r\n\r\npts = []\r\nfor _ in range(n):\r\n\tx,y = map(int,input().split())\r\n\tpts.append((x,y))\r\ns = 0\r\nfor i in range(n-1):\r\n\tx,y = pts[i]\r\n\tu,v = pts[i+1]\r\n\ts += hypot(x-u,y-v)\r\n\r\nprint(s*k/50)\r\n\r\n\r\n# C:\\Users\\Usuario\\HOME2\\Programacion\\ACM", "import math\r\nn,k=[int(x) for x in input().split()]\r\nL=[]\r\nfor _ in range(n) :\r\n (x,y)=[int(x) for x in input().split()]\r\n L.append((x,y))\r\nans=0\r\nfor i in range(len(L)-1) :\r\n ans+=math.sqrt( (L[i+1][0] - L[i][0])**2 + (L[i+1][1] - L[i][1])**2 )\r\nprint( \"%.6f\" %((ans/50) * k))", "\"\"\" \nreading 9:16 -> 9:20\nthinking 9:20 -> 9:24\ncoding 9:24 -> 9:40\ndebugging 9:40 ->\n\"\"\"\n\n\"\"\" \nSe toma n veces las posiciones de los trazos,\ncomo son líneas rectas, se calcula la distancia\nentre A_k y A_k+1, luego se multiplica por k\ny se divide entre su velocidad.\n\"\"\"\nimport math\n\ndef distance(a : tuple, b : tuple):\n x_dist = (b[0]-a[0])**2\n y_dist = (b[1]-a[1])**2\n dist_sum = x_dist + y_dist\n return math.sqrt(dist_sum) \n\nif __name__ == \"__main__\":\n n, k = map(int, input().split())\n speed = 50.0\n old = tuple(map(int, input().split()))\n dist = 0.0\n for i in range(n-1):\n new = tuple(map(int, input().split()))\n dist += distance(old, new) \n old = new\n print(f'{k*dist/speed:.9f}')\n", "import math\r\nn,k=map(int,input().split())\r\nx,y=map(int,input().split())\r\nm=0\r\nfor i in range(n-1):\r\n e=x\r\n z=y\r\n x,y=map(int,input().split())\r\n r=abs(x-e)\r\n t=abs(y-z)\r\n c=math.sqrt(pow(r,2)+pow(t,2))\r\n c=c+m\r\n m=c\r\nw=(c*k)/50\r\nprint (\"{:.9f}\".format(w))", "import math\r\n\r\nn, k = map(int, input().split())\r\nlength = 0\r\nx1, y1 = map(int, input().split())\r\nfor i in range(n-1):\r\n x2, y2 = map(int, input().split())\r\n length += math.sqrt((x2 - x1)**2 + (y2 - y1)**2)\r\n x1, y1 = x2, y2\r\n\r\nlength = length * k\r\nprint(length / 50)\r\n", "from sys import stdin,stdout\r\nimport math\r\nfrom fractions import gcd\r\ndef sin(): \r\n\treturn stdin.readline().rstrip()\r\ndef listInput():\r\n\treturn list(map(int,sin().split()))\r\ndef printBS(li):\r\n\tif not li: return\r\n\tfor i in range(len(li)-1):\r\n\t\tstdout.write(\"%d \"%(li[i]))\r\n\tstdout.write(\"%d\\n\"%(li[-1]))\r\nn,k=listInput()\r\nd=0.0\r\npts=[]\r\nfor i in range(n):\r\n\tpts.append(listInput())\r\nfor i in range(1,n):\r\n\td+=math.sqrt((pts[i][0]-pts[i-1][0])**2 + (pts[i][1]-pts[i-1][1])**2)\r\n\t#print(d)\r\nprint(d*k/50)\t", "n,k = list(map(int, input().split()))\r\nx1,y1 = list(map(int, input().split()))\r\nans=0\r\n\r\nfor i in range(n-1):\r\n x2,y2 = list(map(int, input().split()))\r\n ans += pow(pow(x1-x2,2)+pow(y1-y2,2), 0.5)\r\n x1=x2\r\n y1=y2\r\n \r\nprint((ans*k)/50)", "n,k=map(int,input().split())\r\nx,y=map(int,input().split())\r\ns=0\r\nfor i in range(n-1):\r\n xx,yy=map(int,input().split())\r\n s+=(((x-xx)**2+(y-yy)**2)**0.5)/50\r\n x,y=xx,yy\r\nprint(s*k)\r\n", "n, k = map(int, input().split());\r\nx, y = map(int, input().split());\r\ndistance = 0\r\nfor i in range(n - 1):\r\n a, b = map(int, input().split())\r\n t = (a - x) ** 2 + (b - y) ** 2;\r\n distance += t ** 0.5\r\n x, y = a, b\r\nprint(distance * k / 50)\r\n", "import math\r\ndef Citire():\r\n return (int(x) for x in input().split())\r\ndef Dist():\r\n a = 1.0 * (x - x1) * (x - x1)\r\n b = 1.0 * (y - y1) * (y - y1)\r\n return math.sqrt(a + b)\r\n\r\nn, k = Citire()\r\nn = int(n)\r\nx, y = Citire()\r\nd = 0.0\r\n\r\nfor i in range(n - 1):\r\n x1, y1 = Citire()\r\n d += Dist()\r\n x = x1\r\n y = y1\r\nd *= (k / 50)\r\nprint(round(d, 9))", "import math as mt \nimport sys,string,bisect\ninput=sys.stdin.readline\nfrom collections import deque,defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\ndef dist(x,y,c,d):\n return mt.sqrt((x-c)**2+(y-d)**2)\nn,k=M()\na=0\nc,d=M()\nfor i in range(1,n):\n x,y=M()\n a+=dist(x,y,c,d)\n c=x\n d=y\ns=(k*a)/50\nprint(round(s,9))\n", "n,k=map(int, input().split())\r\ntotal=0\r\nx1,y1=map(int,input().split())\r\n\r\nfor _ in range(n-1):\r\n x2,y2=map(int,input().split())\r\n total+=((x2-x1)**2+(y2-y1)**2)**(1/2)\r\n x1,y1=x2,y2\r\n\r\nprint((total/50)*k)\r\n\r\n", "n, k = map(int, input().split())\r\npx, py = map(int, input().split())\r\nans = 0\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n ans += (((px-x)**2+(py-y)**2)**.5)\r\n px,py=x,y\r\nprint(ans*(k/50))\r\n", "from math import sqrt\r\ndef Sep(a,b):\r\n return sqrt(a**2 + b**2)\r\nn, k = map(int, input().split())\r\nx1, y1 = map(int, input().split())\r\ndist = 0\r\nfor i in range(n-1):\r\n x2, y2 = map(int, input().split())\r\n dist+= Sep(x2-x1,y2-y1)\r\n x1, y1 = x2, y2\r\nprint(dist*k/50)", "import math\r\nn, k = list(map(int, input().split()))\r\nv = 50\r\ndist = 0\r\nlasx = 0\r\nlasy = 0\r\ninid = 0\r\nfor item in range(1):\r\n x, y = list(map(int, input().split()))\r\n inid = math.sqrt((x-lasx)**2 + (y-lasy)**2)\r\n lasx = x\r\n lasy = y\r\n\r\nfor item in range(n-1):\r\n x, y = list(map(int, input().split()))\r\n dist = dist + math.sqrt((x-lasx)**2 + (y-lasy)**2)\r\n lasx = x\r\n lasy = y\r\n\r\ntime_taken = (k*(dist))/v\r\nprint(time_taken)\r\n", "n, k = map(int, input().split())\nl = [[int(i) for i in input().split()] for i in range(n)]\n\ndef Dist(x1,y1,x2,y2):\n\treturn round((((x2 - x1)**2 + (y2 - y1)**2) ** 0.5), 6)\nm = []\nfor i in range(1, n):\n\tm.append(Dist(l[i-1][0], l[i-1][1], l[i][0], l[i][1]))\n\nprint(sum(m) * k / 50)", "def main():\r\n n, k = [int(i) for i in input().split()]\r\n x1, y1 = [int(i) for i in input().split()]\r\n time = 0\r\n for i in range(n - 1):\r\n x2, y2 = [int(i) for i in input().split()]\r\n time += ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5 * 2\r\n x1, y1 = x2, y2\r\n\r\n print(time * k / 100)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import math\n\nn, k = map(int, input().split())\nlists = []\nsum = 0.0\n\nfor _ in range(n):\n x, y = map(int, input().split())\n lists.append((x, y))\n\n\nfor i in range(n - 1):\n x1, y1 = lists[i]\n x2, y2 = lists[i + 1]\n sum += math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\nprint(sum * k / 50.0)\n \t\t\t\t \t\t\t\t \t \t\t \t \t\t", "n,k=map(int,input().split())\r\nd=0\r\na,b=map(int,input().split())\r\nfor _ in range(n-1):\r\n x,y=map(int,input().split())\r\n d+=((x-a)**2 + (y-b)**2)**0.5\r\n a,b=x,y\r\nprint(d*k/50)", "n,k = map(int, input().split())\r\ndistance = 0\r\nx, y = map(int, input().split())\r\nfor i in range(n-1):\r\n\ta,b = map(int, input().split())\r\n\tdistance += ((x-a)**2 + (y-b)**2)**0.5\r\n\tx,y = a,b\r\ntotal = k*distance\r\nprint('%.9f' %(total/50))", "from math import sqrt\r\nl1 = list(map(int, input().split()))\r\nl2 = []\r\nfor i in range(l1[0]):\r\n l = list(map(int, input().split()))\r\n l2.append(l)\r\ntotal = 0 \r\nfor i in range(1,l1[0]):\r\n \r\n total += sqrt((l2[i-1][0] - l2[i][0]) ** 2 + (l2[i - 1][1] - l2[i][1]) ** 2)\r\n \r\ntime = total / 50\r\n\r\nttime = time * l1[1]\r\nprint(ttime) \r\n ", "a=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(a[0]):b+=[list(map(int,input().split()))]\r\nprint(a[1]*(sum(map(lambda x:((b[x][0]-b[x+1][0])**2+(b[x][1]-b[x+1][1])**2)**.5,range(len(b)-1))))/50)", "n,k=map(int,input().split());x,y=map(int,input().split());v=0\r\nfor i in range(n-1):\r\n\ta,b=map(int,input().split())\r\n\tt=(a-x)**2+(b-y)**2;v+=t**0.5\r\n\tx,y=a,b\r\nprint(v*k/50)", "import math\r\nsplit = lambda: map(int, input().split())\r\na, b = split()\r\nn = 0\r\nfor x in range(a):\r\n s, t = split()\r\n if x != 0:\r\n n += math.sqrt((s - p) ** 2 + (t - q) ** 2)\r\n p, q = s, t\r\nn /= 50\r\nprint(n * b)", "def distance(p, q):\r\n return ((p[0]-q[0])**2 + (p[1]-q[1])**2) ** 0.5\r\n\r\nlst = [w.rstrip() for w in open(0).readlines()]\r\nn, k = map(int, lst[0].split())\r\npts = [tuple(map(int, x.split())) for x in lst[1:]]\r\nres = sum(distance(p, q) for p, q in zip(pts, pts[1:]))\r\nprint(k * res / 50) ", "import math\n\ndef length(signature):\n s = 0\n for A0, A1 in zip(signature, signature[1:]):\n x0, y0 = A0\n x1, y1 = A1\n s += math.sqrt((x0 - x1)**2 + (y0 - y1)**2)\n return s\n\ndef solve():\n n, k = map(int, input().split())\n signature = []\n for _ in range(n):\n x, y = map(int, input().split())\n signature.append((x, y))\n length_signature = length(signature)\n total = length_signature*k\n time = total/50.\n print('{:.9f}'.format(time))\n\nif __name__ == '__main__':\n solve()\n", "n, k = map(int, input().split())\r\nlx, ly = map(int, input().split())\r\ndist = 0\r\n\r\nfor _ in range(n-1):\r\n x, y = map(int, input().split())\r\n dist += ((lx-x)**2+(ly-y)**2)**0.5\r\n lx, ly = x, y\r\n\r\nprint(dist/50*k)\r\n", "from math import *\r\nn,k=map(int,input().split())\r\narr=[]\r\nfor i in range(n):\r\n arr.append([]) \r\n arr[i]=[int(z) for z in input().split()]\r\n\r\ns=0\r\nfor i in range(1,n):\r\n s=s + sqrt((arr[i][0]-arr[i-1][0])**2 + (arr[i][1]-arr[i-1][1])**2)\r\nprint((s/50)*k)\r\n \r\n ", "import math\ndist=0\nn, k=map(int, input().split())\nx1, y1=map(int, input().split())\n\nfor i in range(n-1):\n x2, y2=map(int, input().split())\n dist+=math.sqrt((x1-x2)**2+(y1-y2)**2)\n\n x1, y1=x2, y2\n\nprint((dist/50)*k)\n\n \n", "import math\r\ndef distance(l1,l2):\r\n x1,y1 = l1[0],l1[1]\r\n x2,y2 = l2[0],l2[1]\r\n d1 = math.pow(x1-x2,2)\r\n d2 = math.pow(y1 - y2, 2)\r\n return math.sqrt(d1+d2)\r\n\r\n(n,k) = [int(x) for x in input().split()]\r\ninitial = [int(x) for x in input().split()]\r\nS = 0\r\nfor case in range(n-1):\r\n new = [int(x) for x in input().split()]\r\n S+= distance(new,initial)\r\n initial = new\r\nprint(k*S/50.0)", "(N, K) = [int(i) for i in input().split()]\n\ntotal_distance = 0\nlast_point = [int(i) for i in input().split()]\nfor i in range(N-1):\n\tpoint = [int(i) for i in input().split()]\n\ttotal_distance += (abs(point[0]-last_point[0])**2 + abs(point[1]-last_point[1])**2)**0.5\n\tlast_point = point\n\nwasted_time = (total_distance / 50) * K\nprint(wasted_time)\n \t \t\t \t\t\t\t\t \t\t \t\t \t \t\t\t", "from math import hypot, fsum\n\n\ndef main():\n n, k = map(int, input().split())\n l = []\n x, y = map(int, input().split())\n for _ in range(n - 1):\n a, b = map(int, input().split())\n x -= a\n y -= b\n l.append(hypot(x, y))\n x, y = a, b\n print('{:1.9f}'.format(fsum(l) * k / 50))\n\n\nif __name__ == '__main__':\n main()\n", "from math import *\r\nn, k = [int(x) for x in input().split()]\r\n\r\ntotal_distance = 0\r\nprevious_x, previous_y = [int(x) for x in input().split()]\r\n\r\nfor i in range(1, n):\r\n new_x, new_y = [int(x) for x in input().split()]\r\n total_distance += sqrt(pow(previous_x-new_x, 2) + pow(previous_y - new_y, 2))\r\n previous_x, previous_y = new_x, new_y\r\n\r\nprint(total_distance/50 * k)", "n, k = map(int, input().split())\r\n \r\ncurrent = list(map(int, input().split()))\r\ntotal = 0\r\n \r\nfor i in range(n-1):\r\n next1 = list(map(int, input().split()))\r\n r = (next1[0] - current[0])**2 + (next1[1] - current[1])**2\r\n r = r**0.5\r\n total += r\r\n current = next1[:]\r\nprint(total / 50 * k)", "from math import sqrt\r\ndef solve(A : list() , B : list()):\r\n length = sqrt((A[0] - B[0])**2 + (A[1] - B[1])**2)\r\n return length/50\r\n\r\ndef main():\r\n sum = 0\r\n for i in range(t-1):\r\n sum += solve(endpoint[i],endpoint[i+1])\r\n\r\n print(sum*k)\r\n\r\n\r\nt , k = map(int,input().split())\r\nendpoint = []\r\nfor i in range(t):\r\n point = list(map(int,input().split()))\r\n endpoint.append(point)\r\n \r\n\r\n\r\nmain()", "n,k=map(int, input().split())\r\nans=0\r\na,b=map(int, input().split())\r\nn-=1\r\nwhile n:\r\n\tn-=1\r\n\tx,y=map(int, input().split())\r\n\tans+=((x-a)**2+(y-b)**2)**.5\r\n\ta,b=x,y\r\nprint((ans/50)*k)", "import math\r\nn,k =map(int,input().split())\r\na=[]\r\nb=[]\r\nd=0\r\nfor j in range (n):\r\n\tx,y=map(int,input().split())\r\n\ta.append(x)\r\n\tb.append(y)\r\nfor j in range(1,n):\r\n\td+=math.sqrt((a[j]-a[j-1])**2 + (b[j]-b[j-1])**2)\r\nc=d*k/50\r\nprint(round(c,9))", "import math\r\nn,k=map(int,input().split())\r\nx1,y1=map(int,input().split())\r\ntime=0\r\nfor _ in range(n-1):\r\n x2,y2=map(int,input().split())\r\n dis=math.sqrt((x2-x1)**2+(y2-y1)**2)\r\n t=dis/50\r\n time+=t\r\n x1,y1=x2,y2\r\ntime*=k\r\nprint('%.9f'%time)", "def dist(x,y,x2,y2):\r\n return ((x - x2) ** 2 + (y - y2) ** 2) ** 0.5\r\nn, k = map(int,input().split())\r\nai = [list(map(int,input().split())) for i in range(n)]\r\nans = [dist(ai[i][0],ai[i][1],ai[i+1][0],ai[i+1][1]) for i in range(n-1)]\r\nprint(sum(ans)*k/50)\r\n", "import math\r\n\r\ndef WastedTime(n,k,A):\r\n\tdist=0\r\n\ti=0\r\n\twhile i<n-1:\r\n\t\tx,y = [int(p) for p in A[i].split()]\r\n\t\tnextx,nexty = [int(p) for p in A[i+1].split()]\r\n\r\n\t\tdist += math.sqrt(math.pow((nextx-x),2)+math.pow((nexty-y),2))\r\n\t\ti+=1\r\n\r\n\treturn k * dist / 50\r\n\r\nn,k = [int(p) for p in input().split()]\r\nA=[]\r\ni=0\r\nwhile i<n:\r\n\tA.append(input())\r\n\ti+=1\r\n\r\nresult=WastedTime(n,k,A)\r\n\r\nprint(\"{0:.6f}\".format(result))", "import math\r\nn,k=map(int,input().split())\r\nd=0\r\nfor i in range(n-1):\r\n if i==0:\r\n prevx,prevy=map(int,input().split())\r\n x,y=map(int,input().split())\r\n d+=math.sqrt((prevx-x)**2+(prevy-y)**2)\r\n prevx,prevy=x,y\r\n else:\r\n x,y=map(int,input().split())\r\n d+=math.sqrt((prevx-x)**2+(prevy-y)**2)\r\n prevx,prevy=x,y\r\nprint(f'{(d/50)*k:.9f}')\r\n \r\n \r\n\r\n", "def dis(x1,y1,x2,y2):\r\n return ((x1-x2)**2 + (y1-y2)**2)**0.5\r\n \r\ntot_dis=0\r\n\r\n\r\nn,k=map(int, input().split())\r\ncurr_x,curr_y = map(int, input().split())\r\n\r\nfor i in range(1,n):\r\n \r\n new_x, new_y = map(int, input().split()) \r\n \r\n tot_dis+=dis(curr_x, curr_y, new_x, new_y)\r\n \r\n curr_x, curr_y = new_x, new_y \r\n \r\n \r\ntime = tot_dis*k/50\r\n\r\nprint(\"%0.9f\"%time)\r\n ", "n,k = map(int,input().split())\r\nl=0\r\ns=[]\r\nfor a in range(n):\r\n s.append([int(j) for j in input().split()])\r\ndef f(x,y):\r\n a=(x[0]-y[0])**2\r\n b=(x[1]-y[1])**2\r\n return (a+b)**.5\r\nfor j in range(n-1):\r\n l+=f(s[j],s[j+1])\r\nx=(l/50)*k\r\nprint('%.6f'%x)", "import math \r\nn, k = map(int, input().split(\" \"))\r\nx_sum = 0\r\nx_prev = 0\r\ny_sum = 0\r\ny_prev = 0\r\nl = []\r\nfor i in range(n):\r\n if i == 0:\r\n x_prev, y_prev = map(int, input().split(\" \"))\r\n else:\r\n x, y = map(int, input().split(\" \"))\r\n x_sum = x_prev - x\r\n y_sum = y_prev - y\r\n d = math.sqrt((x_sum ** 2) + (y_sum ** 2))\r\n l.append(d)\r\n x_prev = x\r\n y_prev = y\r\nprint(round((sum(l) / 50) * k, 9))", "\r\nn, k = map(int, input().split())\r\nx0, y0 = map(int, input().split())\r\na = 0\r\nfor _ in range(n-1):\r\n x1, y1 = map(int, input().split())\r\n a += ((x1-x0)**2+(y1-y0)**2)**0.5\r\n x0, y0 = x1, y1\r\nprint(k*a/50)", "import math\r\n\r\nnum_points, scale_factor = map(int, input().split())\r\ninitial_x, initial_y = map(float, input().split())\r\n\r\ntotal_distance = 0.0\r\n\r\nfor _ in range(num_points - 1):\r\n x, y = map(float, input().split())\r\n total_distance += math.sqrt((x - initial_x) ** 2 + (y - initial_y) ** 2)\r\n initial_x, initial_y = x, y\r\n\r\nprint(f\"{total_distance * scale_factor / 50:.6f}\")\r\n", "def summ(l):\r\n s=0\r\n for i in range(len(l)-1):\r\n s=s+((l[i][0]-l[i+1][0])**2+(l[i][1]-l[i+1][1])**2)**(0.5)\r\n return s\r\nn,k=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n l.append(x)\r\na=summ(l)\r\nprint(a*k/50)", "n, k = [int(y) for y in input().split()]\r\ndist=0\r\np1,q1 = [int(y) for y in input().split()]\r\nfor _ in range(n-1):\r\n p2,q2 = [int(y) for y in input().split()]\r\n dist+=round(((p2-p1)**2 + (q2-q1)**2)**0.5, 9)\r\n # dist+=((p2-p1)**2 + (q2-q1)**2)**0.5\r\n p1,q1=p2,q2\r\ndist*=k\r\nprint(round(dist/50, 9))", "from math import sqrt\r\nn,k=map(int,input().split())\r\n# a,b=map(int,input().split())\r\nl=[]\r\ns=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tl.append([a,b])\r\nfor i in range(n-1):\r\n\tc=sqrt((l[i][0]-l[i+1][0])**2+((l[i][1]-l[i+1][1])**2))\r\n\ts+=c\r\ns*=k\r\nprint(\"%.9f\"%(s/50))", "import math\r\nn,k=map(int,input().split())\r\nx,y=0,0\r\nsum=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if i==0:\r\n sum-=math.sqrt(a**2 +b**2) \r\n sum+=math.sqrt((a-x)**2+(b-y)**2)\r\n x=a \r\n y=b\r\n#print(sum) \r\n\r\n\r\nprint( \"{:0.9f}\".format((sum/50)*k)) ", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-01-22 18:58:14\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\n\r\n\r\nnb_points, ktimes = read_ints()\r\nx, y = read_ints()\r\ndistance_sum = 0\r\nfor i in range(nb_points-1):\r\n x1, y1 = read_ints()\r\n distance_sum += (((x - x1) ** 2 + (y - y1) ** 2)) ** 0.5\r\n x, y = x1, y1\r\n\r\nprint(\"{:.9f}\".format(distance_sum * ktimes / 50))", "nk = list(map(int, input().split(' ')))\nn = nk[0]\nk = nk[1]\ndist = 0.0\nxy = list(map(int, input().split(' ')))\nx = xy[0]\ny = xy[1]\nfor idx in range(n-1):\n xy1 = list(map(int, input().split(' ')))\n x1 = xy1[0]\n y1 = xy1[1]\n dist += ((((x1 - x) ** 2) + ((y1 - y) ** 2)) ** 0.5)\n x = x1\n y = y1\n\ntime = dist/50\nprint(time*k)\n\n\t\t \t \t\t \t \t\t \t \t \t\t\t\t\t \t", "from math import sqrt\r\nn, k = [int(i) for i in input().split()]\r\n\r\nres = 0\r\nx1, y1 = [int(i) for i in input().split()]\r\nfor i in range(n-1):\r\n x2, y2 = [int(i) for i in input().split()]\r\n res += sqrt((x2-x1)**2 + (y2-y1)**2)\r\n x1, y1 = x2, y2\r\nres = res / 50 * k\r\nprint(res)", "import math\r\n\r\nn, k = list(map(int, input().split()))\r\ntime, gip = 0, 0\r\nkor = []\r\nfor i in range(n):\r\n x, y = list(map(int, input().split()))\r\n kor.append((x, y))\r\n# kor = [tuple(map(int, input().split() for _ in range(n)]\r\nfor i in range(len(kor) - 1):\r\n a, b = 0, 0\r\n a = abs(kor[i][0] - kor[i + 1][0])\r\n b = abs(kor[i][1] - kor[i + 1][1])\r\n gip +=math.sqrt(a * a + b * b)\r\ntime = gip/50 * k\r\nprint(time)", "def euclidean_distance(x1, y1, x2, y2):\r\n ans = ((x1 - x2) ** 2 + (y1 - y2) ** 2) ** 0.5\r\n return ans\r\n\r\n\r\nb, c = map(int, input().split())\r\ncases = b\r\nxx = None\r\nyy = None\r\nans = 0\r\nwhile cases:\r\n cases -= 1\r\n x, y = map(int, input().split())\r\n if xx is None and yy is None:\r\n xx = x\r\n yy = y\r\n else:\r\n ans += euclidean_distance(x, y, xx, yy)\r\n xx = x\r\n yy = y\r\nprint(ans/50 * c)\r\n", "from sys import stdin, stdout\r\nimport sys\r\nINF=1e9\r\nimport bisect\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\ndef op(c): return stdout.write(c)\r\n#from collections import defaultdict \r\nimport math\r\n#for _ in range(int(stdin.readline())):\r\nn,k=get_ints()\r\nx,y=get_ints()\r\npx,py=x,y\r\nl=0.0\r\nfor i in range(1,n):\r\n x,y=get_ints()\r\n l+=math.sqrt((px-x)*(px-x)+(py-y)*(py-y))\r\n px,py=x,y\r\nprint((l*k)/50)\r\n", "I=lambda:map(int,input().split())\r\nn,k=I()\r\na=[[*map(int,input().split())]for _ in[0]*n]\r\nr=0\r\nfor u,v in zip(a,a[1:]):\r\n r+=((u[0]-v[0])**2+(u[1]-v[1])**2)**0.5\r\nprint(r*k/50)", "import math\r\ndef distance(x1,y1,x2,y2):\r\n x = abs(x2-x1)\r\n y = abs(y2-y1)\r\n x = math.pow(x,2)\r\n y = math.pow(y,2)\r\n return math.sqrt(x+y)\r\nn,k = [int(x) for x in input().split()]\r\narray = []\r\nfor i in range(n):\r\n temp = [int(x) for x in input().split()]\r\n array.append(temp)\r\nans = 0\r\nfor i in range(1,n):\r\n previous_x,previous_y = array[i-1]\r\n x,y = array[i]\r\n ans += distance(previous_x,previous_y,x,y)\r\nans = ans/50.0\r\nprint(ans*k)\r\n", "from math import sqrt\r\n\r\npts = []\r\nlength = 0\r\n\r\nn , k = [int(i) for i in input().split()]\r\nfor i in range(n):\r\n x , y = [int(i) for i in input().split()]\r\n pts.append((x , y))\r\n\r\nfor i in range(n - 1):\r\n x = pts[i][0] - pts[i+1][0]\r\n y = pts[i][1] - pts[i+1][1]\r\n length += sqrt((x * x) + (y * y))\r\n\r\nt = length / 50\r\nprint(t * k) ", "import math\r\n\r\nn, k = map(int, input().split())\r\nxl, yl = map(int, input().split())\r\nd = 0\r\nfor _ in range(n - 1):\r\n x, y = map(int, input().split())\r\n d += math.sqrt((xl - x) ** 2 + (yl - y) ** 2)\r\n xl, yl = x, y\r\n\r\nprint(round((d * k) / 50, 9))\r\n", "from math import sqrt\r\nn, k = map(int, input().split())\r\nxPrev, yPrev = map(int, input().split())\r\nd = 0\r\nfor i in range(n - 1):\r\n x, y = map(int, input().split())\r\n d += sqrt((x - xPrev) ** 2 + (y - yPrev) ** 2)\r\n xPrev = x\r\n yPrev = y\r\nprint((d / 50) * k)", "n, k = map(int, input().split())\r\nx, y = map(int, input().split())\r\ntotal = 0\r\nfor i in range(n-1):\r\n newx, newy = map(int, input().split())\r\n length = ((newx - x) ** 2 + (newy - y) ** 2)**(1/2)\r\n total += length\r\n x, y = newx, newy\r\n\r\ntotal *= k\r\nprint(total/50)", "from sys import stdin, stdout\r\n#from bisect import bisect_left, bisect_right\r\n#from collections import Counter, deque\r\n#from queue import Queue\r\n#import heapq\r\nimport math\r\n#from itertools import permutations, combinations, islice\r\n\r\ndef distance(x1,y1,x2,y2):\r\n return math.sqrt((x1-x2)**2 + (y1-y2)**2)\r\n\r\ndef input():\r\n return stdin.readline().strip()\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n d = 0\r\n s1,s2 = map(int, input().split())\r\n for i in range(1,n):\r\n a, b = map(int, input().split())\r\n d += distance(s1,s2,a,b)\r\n s1 = a; s2 = b\r\n return f\"{d/50*k:.10f}\"\r\n\r\nstdout.write(solve())", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nimport math as m\r\n\r\nn, k = inp()\r\ndis, pre1, pre2 = 0, 0, 0\r\n\r\nfor i in range(n):\r\n x, y = inp()\r\n if (i > 0):\r\n dis += m.sqrt((x - pre1) ** 2 + (y - pre2) ** 2)\r\n pre1, pre2 = x, y\r\n\r\nprint('{0:.9f}'.format((dis*k) / 50,9))\r\n\r\n", "import math\r\n\r\nclass Point:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\ndef distance(p1, p2):\r\n dx = p2.x - p1.x\r\n dy = p2.y - p1.y\r\n return math.sqrt(dx * dx + dy * dy)\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n \r\n v = []\r\n for _ in range(n):\r\n x, y = map(float, input().split())\r\n v.append(Point(x, y))\r\n \r\n s = distance(v[0], v[1])\r\n for i in range(1, n - 1):\r\n dist = distance(v[i], v[i+1])\r\n s += dist\r\n \r\n total_time = s / 50 * k \r\n print(\"{:.9f}\".format(total_time))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int, input().split())\r\na, b = map(int, input().split())\r\nr = 0\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n r += ((x-a)**2 + (y-b)**2) ** 0.5\r\n a, b = x, y\r\nprint(round(r*k/50, 6))", "\r\n\r\nn,k = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):\r\n if i==0:\r\n x,y= list(map(int,input().split()))\r\n else:\r\n X,Y = list(map(int,input().split()))\r\n d = ((X-x)**2+(Y-y)**2)**(1/2)\r\n x,y=X,Y\r\n ans += d\r\nans=((ans*k)/50)\r\nprint('%.9f'%ans)", "import math as m\rS = []\rd = 0\r[n, k] = [int(x) for x in input().split()]\rfor i in range(n): S.append([int(x) for x in input().split()])\rfor j in range(n - 1): d += m.sqrt((S[j][0] - S[j+1][0])**2 + (S[j][1] - S[j+1][1])**2)\rprint(d*k/50)\r", "n, k = map(int, input().split())\r\npoints = list()\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n point = (x, y)\r\n points.append(point)\r\ntotal_distance = 0\r\nfor i in range(1, n):\r\n a = (((points[i][0] - points[i-1][0])**2 +\r\n (points[i][1] - points[i-1][1])**2)**0.5)\r\n total_distance += a\r\nprint(\"{:.9f}\".format(total_distance * k / 50))\r\n", "from math import*\r\nn,k=[int(s) for s in input().split()]\r\nx,y=[int(s) for s in input().split()]\r\nsum=0\r\nfor i in range(n-1):\r\n x1,y1=[int(s) for s in input().split()]\r\n sum+=sqrt((x-x1)**2+(y-y1)**2)\r\n x=x1\r\n y=y1\r\nsum*=k\r\nprint(sum/50)\r\n \r\n", "def distance(x1,y1,x2,y2):\n from math import sqrt\n res = (x1 - x2)**2\n res+= (y1 - y2)**2\n return sqrt(res)\nn,k = map(int,input().split())\nprevx,prevy = map(int,input().split())\ntotal =0\nfor i in range(n-1):\n curx,cury = map(int,input().split())\n total += distance(prevx,prevy,curx,cury)\n prevx,prevy = curx,cury\nprint(total*k / 50)\n", "import math\r\nn, k = map(int, input().split())\r\nans = 0\r\nprevx, prevy = map(int, input().split())\r\nfor _ in range(n - 1):\r\n x, y = map(int, input().split())\r\n ans += math.sqrt(pow(x - prevx, 2) + pow(y - prevy, 2))\r\n prevx, prevy = x, y\r\nprint(k * ans / 50)", "from math import sqrt\r\n\r\ndef d(X, Y):\r\n return sqrt((Y[0]-X[0])**2 + (Y[1]-X[1])**2)\r\n\r\nn, k = map(int, input().split())\r\n\r\nlast = list(map(int, input().split()))\r\n\r\ntime = 0\r\nfor i in range(n-1):\r\n this = list(map(int, input().split()))\r\n time += d(last, this)/50\r\n\r\n last = this.copy()\r\n\r\nprint(time*k)", "import math\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\n\r\ns = 0\r\nx, y = map(int, input().split())\r\n\r\nfor _ in range(n - 1):\r\n a, b = map(int, input().split())\r\n\r\n s += math.sqrt((x - a)**2 + (y - b)**2)\r\n\r\n x = a\r\n y = b\r\n\r\nprint(s * 0.02 * k)", "import sys\r\nimport math\r\n \r\nn, k = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\nres = 0\r\nx1, y1 = [int(x) for x in (sys.stdin.readline()).split()]\r\nfor i in range(n - 1):\r\n x2, y2 = [int(x) for x in (sys.stdin.readline()).split()]\r\n res += math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\r\n x1, y1 = x2, y2\r\n \r\nprint(\"{0:.9f}\".format(res * k / 50.0))", "import sys\nimport math\ninput = sys.stdin.readline\n\nn, k = map(int, input().strip().split())\na = []\nfor _ in range(n):\n x, y = map(int, input().strip().split())\n a.append([x, y])\nans = 0\nfor i in range(1, n):\n d = (a[i][0] - a[i - 1][0])**2 + (a[i][1] - a[i - 1][1]) ** 2\n ans += math.sqrt(d) / 50\nprint(\"%.12f\" % (ans * k))\n", "n, k = map(int, input().split())\r\n\r\npoints = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\ntotal_distance = 0\r\nfor i in range(1, n):\r\n distance = ((points[i][0] - points[i-1][0])**2 + (points[i][1] - points[i-1][1])**2)**0.5\r\n total_distance += distance\r\n\r\ntime = total_distance * k / 50.0\r\n\r\nprint('{:.6f}'.format(time))\r\n", "import math\nn, k = list(map(int, input().split()))\n\ncoords = []\nfor i in range(n):\n point = list(map(int, input().split()))\n coords.append(point)\n\ndist = 0.0\nfor i in range(0, n-1):\n p1 = coords[i]\n p2 = coords[i+1]\n dist += math.sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)\n\nans = (dist / 50) * k\nprint(ans)\n\n\t\t \t\t \t\t \t\t\t\t\t\t \t \t \t\t\t \t", "mas = list(map(int, input().split()))\r\nt = mas[0]\r\nk = mas[1]\r\nxj = 0\r\nyj = 0\r\ns = 0\r\nfor j in range(t): \r\n mas = list(map(int, input().split()))\r\n if (j > 0):\r\n xj_ = xj\r\n yj_ = yj\r\n else:\r\n xj_ = mas[0]\r\n yj_ = mas[1]\r\n xj = mas[0]\r\n yj = mas[1]\r\n s += ((xj - xj_) ** 2 + (yj - yj_) ** 2) ** 0.5\r\n\r\nprint(s * k / 50)", "n, k = map(int, input().split())\r\npoints = [tuple(map(int, input().split())) for i in range(n)]\r\ndist = 0\r\nfor (x1,y1), (x2, y2) in zip(points, points[1:]):\r\n dist += ((x1 - x2)**2 + (y1 - y2)**2)**0.5\r\nprint(dist*k / 50)", "import math\n\nk, n = input().split()\nk, n = map(int, (k, n))\n\ncoor = []\n\nfor i in range(k):\n coor.append(tuple(input().split()))\n\nans = 0\nfor i in range(k - 1):\n x = int(coor[i][0]) - int(coor[i + 1][0])\n y = int(coor[i][1]) - int(coor[i + 1][1])\n ans += math.sqrt(x*x + y*y)\n\nprint((ans * n)/50)\n\n \t\t\t\t \t \t \t \t \t \t\t \t\t", "n, k = map(int, input().split())\ntotal = 0\nx0, y0 = map(int, input().split())\nfor i in range(1, n):\n x, y = map(int, input().split())\n total += k*((x-x0)**2 + (y-y0)**2)**0.5\n x0, y0 = x, y\nprint(total/50)\n", "from math import sqrt\r\nn, k = input().split()\r\nn, k = int(n), int(k)\r\ncoordinates = []\r\nfor i in range(n):\r\n coordinates += [tuple(map(int, input().split()))]\r\n\r\ntotal = 0\r\nfor j in range(n - 1):\r\n total += sqrt((coordinates[j][0] - coordinates[j + 1][0]) ** 2 + (coordinates[j][1] - coordinates[j + 1][1]) ** 2)\r\n\r\nprint(f'{(total / 50) * k:.9f}')\r\n", "from math import sqrt\r\nn,k=map(int,input().split())\r\ns=0\r\na=[]\r\nb=[]\r\nfor _ in range(n):\r\n l,r=map(int,input().split())\r\n a.append(l)\r\n b.append(r)\r\nfor i in range(1,n):\r\n s+=sqrt((a[i-1]-a[i])**2+(b[i-1]-b[i])**2)\r\nprint((s*k)/50)\r\n\r\n", "from math import sqrt\r\n\r\nn , k = map(int,input().split())\r\n\r\nx1 , y1 = map(int,input().split())\r\nv = 50.0\r\nx = 0\r\n\r\nfor i in range(n - 1):\r\n x2 , y2 = map(int,input().split())\r\n x += sqrt((x1 - x2)**2 + (y1 - y2)**2)\r\n x1 , y1 = x2 , y2\r\n\r\nres = x * k / v\r\nprint(round(res , 9))\r\n\r\n", "import math\r\nn,k=map(int,input().split())\r\nxy=[]\r\nfor i in range(n):\r\n c=list(map(int,input().split()))\r\n xy.append(c)\r\ncount=0\r\nfor i in range(n-1):\r\n count+=math.sqrt((abs(xy[i][0]-xy[i+1][0])**2)+abs(xy[i][1]-xy[i+1][1])**2)\r\n\r\nprint(count*k/50)", "from math import sqrt\r\nn,k=map(int,input().split())\r\nxy=[]\r\nd=0\r\nwhile n:\r\n x,y=map(int,input().split())\r\n xy.append([x,y])\r\n n-=1\r\nfor i in range(len(xy)-1):\r\n x1,y1=xy[i][0],xy[i][1]\r\n x2,y2=xy[i+1][0],xy[i+1][1]\r\n d+=sqrt(((abs(x2-x1))**2)+((abs(y2-y1))**2))\r\ntd=d*k\r\nprint(format(td/50,'.9f'))\r\n \r\n \r\n", "# Online Python compiler (interpreter) to run Python online.\r\n# Write Python 3 code in this online editor and run it.\r\nn,k=map(int,input().split())\r\nl=[list(map(int,input().split())) for _ in range(n)]\r\nq=0\r\nfor t in range(n-1):\r\n d=0\r\n \r\n d=((l[t][0]-l[t+1][0])**2+(l[t][1]-l[t+1][1])**2)**.5\r\n q=q+d\r\nprint((q/50)*k)\r\n ", "n,k=input().split()\n\n#print(n,k)\n\nprevX,prevY=input().split()\nprevX,prevY=float(prevX),float(prevY)\ndist=float(0)\n#print(dist)\n\nfrom math import sqrt\n\nfor i in range(1,int(n)):\n newX,newY=input().split()\n newY,newX=float(newY),float(newX)\n dist+=sqrt((newX-prevX)**2+(newY-prevY)**2)\n\n prevX=newX\n prevY=newY\n#print(dist)\ndist*=float(k)\n\ndist/=50\n\nprint(dist)\n", "import math as mt\r\nn,k=map(int,input().split())\r\narr=[list(map(int,input().split())) for i in range(n)]\r\ndist=0\r\nfor i in range(1,n):\r\n dist+=(mt.sqrt((arr[i][1]-arr[i-1][1])**2+(arr[i][0]-arr[i-1][0])**2))\r\nprint(\"{:.9f}\".format(dist*k/50))", "import math\r\nn,k=map(int,input().split())\r\nr=0\r\nl=[[]for i in range(n)]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n l[i].append(x)\r\n l[i].append(y)\r\nfor i in range(n-1):\r\n r+=math.sqrt(pow(l[i+1][0]-l[i][0],2)+pow(l[i+1][1]-l[i][1],2))\r\nr*=k\r\nprint(r/50)", "\r\nimport math\r\n\r\nn , k = map(int,input().split())\r\n\r\nx1 , y1 = map(float,input().split())\r\n\r\nres = 0\r\n\r\nfor i in range(n-1):\r\n x2 , y2 = map(float,input().split())\r\n res += math.hypot(x1 - x2 , y1 - y2)\r\n x1 , y1 = x2 , y2\r\n\r\nprint(res*k / 50.0)\r\n\r\n\r\n\r\n\r\n", "import math\nn, k = map(int, input().split())\na = []\ntotal_dist = 0\nfor i in range(n):\n x = list(map(int, input().split()))\n a.append(x)\nfor j in range(n - 1):\n total_dist += math.sqrt(abs(a[j][0] - a[j + 1][0]) ** 2\n + abs(a[j][1] - a[j + 1][1]) ** 2)\nprint(k * total_dist / 50)\n", "\r\nimport sys\r\ninput = sys.stdin.readline\r\nn, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\ncounter = 0\r\nfor i in range(0, n-1):\r\n ai = list(map(int, input().split()))\r\n counter += (((a[0]-ai[0])**2)+((a[1]-ai[1])**2))**.5\r\n a = ai\r\ncounter *= k\r\nprint(counter/50)\r\n\r\n# Codeforcesian\r\n", "d = lambda x, y: ((x[0] - y[0]) ** 2 + (x[1] - y[1]) ** 2) ** .5\r\nn, k = map(int, input().split())\r\na = [[int(i) for i in input().split()] for _ in range(n)]\r\nprint(sum(d(a[i], a[i + 1]) for i in range(n - 1)) * k / 50)", "from math import dist, ceil, floor, sqrt, log\r\nimport itertools\r\nimport math\r\nimport functools\r\nimport operator\r\nimport collections\r\nimport heapq\r\nimport re\r\nimport string\r\nfrom sys import stdin\r\ninp = stdin.readline\r\ndef IA(sep=' '): return list(map(int, inp().split(sep)))\r\ndef QIA(sep=' '): return deque(map(int, inp().split(sep)))\r\ndef FA(): return list(map(float, inp().split()))\r\ndef SA(): return list(input())\r\ndef I(): return int(inp())\r\ndef F(): return float(inp())\r\ndef S(): return input()\r\ndef O(l: list): return ' '.join(map(str, l))\r\n\r\n\r\ndef main():\r\n n, k = IA()\r\n speed = 50\r\n point = [0, 0]\r\n total_dist = 0\r\n for i in range(n):\r\n x, y = IA()\r\n if i == 0:\r\n point[0] = x\r\n point[1] = y\r\n else:\r\n d = dist([x, y], point)\r\n total_dist += d\r\n point[0] = x\r\n point[1] = y\r\n\r\n total_dist *= k\r\n total_dist /= speed\r\n return total_dist\r\n\r\n\r\nif __name__ == '__main__':\r\n print(main())\r\n", "distancia=0\r\na,b=map(int,input().split())\r\nL=[tuple(map(int,input().split())) for k in range(a)]\r\nfor k in range(1,a):\r\n distancia+=((L[k][0]-L[k-1][0])**2+(L[k][1]-L[k-1][1])**2)**0.5\r\ndistanciasegundos=distancia/50*b\r\nprint(\"%.9f\"%distanciasegundos)\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\nA = [list(map(int, input().split())) for _ in range(n)]\r\nres = 0\r\nfor i in range(1, n):\r\n res += math.hypot(A[i][0] - A[i - 1][0], A[i][1] - A[i - 1][1])\r\nprint((k * res) / 50)\r\n", "n, k = map(int, input().split())\r\na = [[0, 0] for i in range(n)]\r\nfor i in range(n):\r\n a[i][0], a[i][1] = map(int, input().split())\r\nans = 0\r\nfor i in range(n - 1):\r\n ans += ((a[i][0] - a[i + 1][0]) ** 2 + (a[i][1] - a[i + 1][1]) ** 2) ** 0.5\r\nans *= k\r\nans /= 50\r\nprint(ans)", "import math\r\ndef main():\r\n n, k = map(int, input().split())\r\n ls = []\r\n d = 0\r\n co = list(map(int, input().split()))\r\n for i in range(n-1):\r\n temp = list(map(int, input().split()))\r\n d += math.sqrt((abs(co[0]-temp[0]))**2 + (abs(co[1]-temp[1]))**2)\r\n co = temp\r\n print('{0:.9f}'.format(d/50*k))\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "n, k = map(int, input().split())\r\ns = 0\r\nx0, y0 = map(int, input().split())\r\nfor i in range(n - 1):\r\n x, y = map(int, input().split())\r\n s += ((x - x0) ** 2 + (y - y0) ** 2) ** (1 / 2)\r\n x0, y0 = x, y\r\nprint(k * s / 50)\r\n", "from sys import stdin\r\ndef gis(): return list(map(int, stdin.readline().strip().split()))\r\ndef gi(): return int(input())\r\nfrom math import sqrt\r\nn,k = gis()\r\nar = [gis() for i in range(n)]\r\n\r\ntotal_dist = 0\r\nfor i in range(1,n):\r\n\tb= ar[i]\r\n\ta = ar[i-1]\r\n\ttotal_dist += sqrt(abs(a[0]-b[0])**2 + abs(a[1]-b[1])**2)\r\nprint((total_dist/50) *k)", "from math import sqrt\r\nn , k =map(int , input().split())\r\n\r\na , b =map(int , input().split())\r\ns = 0\r\nfor i in range(n-1):\r\n x , y=map(int , input().split())\r\n s+=sqrt((x-a)**2 + (y-b)**2)\r\n a,b = x ,y\r\nprint(s*k/50)", "import math\r\nn,k=map(int,input().split())\r\ntotal_dist=0\r\nx,y=map(int,input().split())\r\nfor _ in range(n-1):\r\n a,b=map(int,input().split())\r\n total_dist+=math.sqrt(pow(x-a,2)+pow(y-b,2))\r\n x=a\r\n y=b\r\nprint(total_dist*(k/50)) ", "def distance(x,y,x1,y1):\r\n d=(((x-x1)**2)+((y-y1)**2))**0.5\r\n return d\r\nn,k=map(int,input().split())\r\nx,y=map(int,input().split())\r\ns=0\r\nfor i in range(n-1):\r\n x1,y1=map(int,input().split())\r\n s+=distance(x,y,x1,y1)\r\n x=x1\r\n y=y1\r\nprint(s*k*0.02)", "import math\nn, k = list(map(int, input().split()))\na = [list(map(int, input().split())) for i in range(n)]\nans = 0\nfor i in range(len(a)-1):\n ans += math.sqrt((a[i][0] - a[i+1][0])**2 + (a[i][1] - a[i+1][1])**2) \nprint((ans / 50)*k)\n", "def wasted_time(arr,k):\r\n sum=0\r\n for i in range(len(arr)-1):\r\n d=(arr[i][0]-arr[i+1][0])**2+(arr[i][1]-arr[i+1][1])**2\r\n dist=d**(1/2)\r\n sum=sum+dist\r\n\r\n fin=(sum/50)*k\r\n print(fin)\r\n\r\n\r\n\r\n\r\n\r\n\r\nn=list(map(int,input('').split()))\r\nb=[]\r\nfor i in range(n[0]):\r\n a=list(map(int,input('').split()))\r\n b.append(a)\r\n\r\nwasted_time(b,n[1])\r\n\r\n#print(36**(1/2))", "#!/usr/bin/python3\n\nimport sys\nimport argparse\nimport json\nfrom pprint import pprint\nimport math\n\ndef main():\n #line = sys.stdin.readline().rstrip()\n n, k = map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n total_distance = 0\n locations = []\n for i in range(0, n):\n x, y = map(int, sys.stdin.readline().rstrip().split(\" \"))\n locations.append((x,y))\n\n current_location = locations[0]\n\n for location in locations[1:]:\n total_distance += calc_dist(location, current_location)\n current_location = location\n\n total_time = (total_distance*k)/50\n print(\"{:.9f}\".format(total_time))\n\n\ndef calc_dist(loc_a, loc_b):\n return ((loc_a[0]-loc_b[0])**2 + (loc_a[1]-loc_b[1])**2)**(.5)\n\n\n\ndef get_tests():\n #tests = [(\"512 4\", \"50\")]\n\n for test in tests:\n print(json.dumps({\"input\": test[0], \"output\": test[1]}))\n\nif __name__ == \"__main__\":\n parser = argparse.ArgumentParser()\n parser.add_argument(\"--get-tests\", action=\"store_true\")\n args = parser.parse_args()\n\n if args.get_tests:\n get_tests()\n else:\n main()\n", "n, k = map(int, input().split())\r\nanswer = {'distance':0, 'coordinates':list(map(int, input().split()))}\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n answer['distance'] += ((answer['coordinates'][0] - x)**2+(answer['coordinates'][1] - y)**2)**0.5\r\n answer['coordinates'] = [x,y]\r\nprint('%.6f' % (k*answer['distance']/50))", "import math\r\n\r\nn, k = map(int, input().split())\r\ncrds = [tuple(map(int, input().split())) for _ in range(n)]\r\nleng = sum([math.hypot(crds[i][0] - crds[i - 1][0], crds[i][1] - crds[i - 1][1]) for i in range(1, n)])\r\nprint((leng * k) / 50)\r\n\r\n", "import math\r\nn,k = map(int,input().split(' '))\r\nx1,y1 = map(float,input().split(' '))\r\nres = 0\r\nfor i in range(n-1):\r\n x2,y2 = map(float,input().split(' '))\r\n res += math.hypot(x1-x2,y1-y2)\r\n x1,y1 = x2,y2\r\nprint(res*k/50.0)", "import math\r\n\r\nn,k = (int(x) for x in input().split())\r\ncoord = [list(map(int, input().split())) for _ in range(n)]\r\ndist = [math.sqrt(pow(coord[i][0]-coord[i+1][0],2)+pow(coord[i][1]-coord[i+1][1],2)) for i in range(n-1)]\r\nprint(sum(dist)*k/50)", "n,k=map(int,input().split())\r\nlis=[]\r\nwhile n>0:\r\n x,y=map(int,input().split())\r\n lis.append(x)\r\n lis.append(y)\r\n n=n-1\r\ndist=0.0\r\ni=0\r\nwhile ( (i+3) <= len(lis)):\r\n dist=dist+((lis[i]-lis[i+2])**2+(lis[i+1]-lis[i+3])**2)**0.5\r\n i=i+2\r\nr=(dist*k/50)\r\nprint(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,k = rinput()\r\nm=[]\r\nfor i in range(n):\r\n a,b=rinput()\r\n m.append([a,b])\r\n\r\ns=0\r\nfor i in range(n-1):\r\n s+=((m[i+1][0]-m[i][0])*(m[i+1][0]-m[i][0])+(m[i+1][1]-m[i][1])*(m[i+1][1]-m[i][1]))**0.5\r\n\r\nprint(round(s*k/50,9))\r\n\r\n ", "n,k=map(int,input().split())\r\nc=0\r\nL=[]\r\nfor i in range(n):\r\n L+=list(map(int,input().split()))\r\n if len(L)==4:\r\n d=((L[2]-L[0])**2+(L[3]-L[1])**2)**(1/2)\r\n L.remove(L[0])\r\n L.remove(L[0]) \r\n c+=d\r\ntotal=(k*c)/50\r\nprint('{0:.9f}'.format(total))", "import math\nn , k = map(int , input().split())\nspeed = 50\nlst_check = []\ntotal_time = []\ndef distance(x, y):\n\treturn math.sqrt((x[0] - y[0])**2 + (x[1] - y[1])**2)\nfor _ in range(n):\n\tlst_cont = list(map(int, input().split()))\n\tlst_check.append(lst_cont)\ntotal_time = [distance(lst_check[i], lst_check[i - 1])/speed for i in range(1, len(lst_check))]\nprint(k * sum(total_time))\n", "n, k = map(int, input().split())\n\nd = 0.0\n\nx0, y0 = map(int, input().split())\nfor _ in range(n-1):\n x1, y1 = map(int, input().split())\n d += ((x0 - x1) ** 2 + (y0 - y1) ** 2) ** 0.5\n\n x0, y0 = x1, y1\n\nprint(d / 50 * k)", "import math\r\ncoordinates_x = []\r\ncoordinates_y = []\r\ntime = 0\r\n\r\nn, k = list(map(int, input().split()))\r\nfor line in range(n):\r\n x, y = list(map(int, input().split()))\r\n coordinates_x.append(x)\r\n coordinates_y.append(y)\r\n\r\n\r\nwhile len(coordinates_x) != 1:\r\n distance = float(math.sqrt((coordinates_x[0]-coordinates_x[1])**2 + (coordinates_y[0]-coordinates_y[1])**2))\r\n coordinates_x.remove(coordinates_x[0])\r\n coordinates_y.remove(coordinates_y[0])\r\n\r\n time += (distance/50) * k\r\n\r\nprint(\"{:.9f}\".format(time))\r\n\r\n\r\n", "import math\r\n\r\nn, k = map(int, input().split())\r\nwasted = 0\r\n\r\nprev_x = 0\r\nprev_y = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n if i != 0:\r\n distance = math.sqrt(math.pow(y - prev_y, 2) + math.pow(x - prev_x, 2))\r\n wasted += distance\r\n prev_x, prev_y = x, y\r\n\r\nprint((wasted / 50) * k)", "from math import sqrt\r\nn,k = map(int,input().split())\r\nans = 0\r\nx,y = map(int,input().split())\r\nfor i in range(n-1):\r\n a,b= map(int,input().split())\r\n ans+=sqrt(pow(abs(a-x),2)+pow(abs(b-y),2))\r\n x,y = a,b\r\nprint(format((ans/50)*k,'.9f'))", "def dis(a,b,c,d):\r\n p=((a-b)**2+(c-d)**2)**(1/2)\r\n return p\r\n\r\n\r\nl=[]\r\na=input().split()\r\n\r\nn=int(a[0]);\r\nk=int(a[1]);\r\n\r\nfor i in range(n):\r\n q=[]\r\n s=input().split()\r\n r=int(s[0])\r\n t=int(s[1])\r\n q.append(r)\r\n q.append(t)\r\n l.append(q)\r\ndiss=0.0\r\nfor i in range(1,n):\r\n y=dis(l[i][0] , l[i-1][0] ,l[i][1] ,l[i-1][1])\r\n diss=diss+y\r\n \r\ndiss=diss*k\r\n\r\nprint(diss/50)\r\n", "import sys\ninput = sys.stdin.readline\nimport math\n\ndef inpit(): #int\n return(int(input()))\ndef inplt(): #list \n return(list(map(str,input().split())))\ndef inpstr(): #string\n s = input()\n return(list(s[:len(s) - 1]))\ndef inpspit(): #spaced intergers \n return(map(int,input().split()))\n\nimport math\npow = math.pow \nfl = math.floor \nceil = math.ceil \ndis = math.hypot # cartesian distance \n\n\ndef lcm(a):\n return abs(math.prod(a)) // math.gcd(*a)\n\nn,k = inpspit()\nx,y = inpspit()\nd = 0\nfor i in range(n-1) :\n x1,y1 = inpspit()\n d = d + math.hypot(x - x1, y - y1)\n x,y = x1,y1\n \n\nprint(k * d / 50) ", "n, k = list(map(int, input().split()))\n\nx0, y0 = list(map(int, input().split()))\n\nval = 0\n\nfor i in range(n-1):\n x, y = list(map(int, input().split()))\n val += ((x-x0)**2 + (y-y0)**2)**(1/2)\n x0, y0 = x, y\n\nprint(f'{val*k/50:.9f}')\n \t\t\t \t \t\t \t \t \t \t\t", "n,k=map(int,input().split())\r\ndef dis(x1,x2,y1,y2):\r\n\tc=(((x2-x1)**2)+((y2-y1)**2))**0.5\r\n\treturn c\r\n\r\ntotal_dis=0\r\nx1=0\r\ny1=0\r\nflag=0\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tif flag==0:\r\n\t\tx1=a\r\n\t\ty1=b\r\n\t\tflag=1\r\n\telse:\t\r\n\t\tdistance=dis(x1,a,y1,b)\r\n\t\tx1=a\r\n\t\ty1=b\r\n\t\ttotal_dis+=distance\r\n\t\t#print(distance)\r\n\r\nprint((total_dis/50)*k)\r\n\r\n\r\n\t", "def solve(n, k, points: tuple):\r\n total_time = 0\r\n for i in range(n-1):\r\n total_time += 1 / (50 / ((abs(points[i][0] - points[i+1][0]) ** 2 + abs(points[i][1] - points[i+1][1]) ** 2) ** 0.5))\r\n return total_time * k\r\n\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n print(solve(n, k, tuple([tuple(map(int, input().split())) for _ in range(n)])))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from math import sqrt\r\na = input().split(' ')\r\np = []\r\nras = int(0)\r\nfor i in range(int(a[0])):\r\n p.append(input().split(' '))\r\n\r\nfor k in range(int(a[0])-1):\r\n ac = int(p[k][0])-int(p[k+1][0])\r\n bc = int(p[k][1])-int(p[k+1][1])\r\n ras += sqrt((ac**2)+(bc**2))\r\n\r\nprint((ras*int(a[1]))/50)\r\n", "n, k = (int(x) for x in input().split())\r\nx1, y1 = (int(x) for x in input().split())\r\nval = 0.0\r\nfor i in range(n - 1):\r\n x2, y2 = (int(x) for x in input().split())\r\n val += ((x2 - x1) ** 2 + (y2 - y1) ** 2) ** 0.5\r\n x1, y1 = x2, y2\r\nprint(val * k / 50)", "import math\r\ns = 0\r\nl = input().split()\r\nn = int(l[0])\r\nk = int(l[1])\r\nll = input().split()\r\nx1 , y1 = int(ll[0]) , int(ll[1])\r\nfor i in range(1,n):\r\n lll = input().split()\r\n x2 , y2 = int(lll[0]) , int(lll[1])\r\n s += math.dist([x1,y1] , [x2,y2])\r\n x1 , y1 = x2 , y2\r\nprint(s*k/50)", "import math\r\nn,k=map(int,input().split())\r\nx=[]\r\ny=[]\r\nfor i in range(0,n):\r\n a,b=map(float,input().split())\r\n x.append(a)\r\n y.append(b)\r\nans=0.0\r\nfor i in range(0,n-1):\r\n ans+=math.sqrt(((x[i+1]-x[i])*(x[i+1]-x[i]))+(((y[i+1]-y[i]))*(y[i+1]-y[i])))\r\nans=ans*k/50\r\nprint(ans)", "def euD(x1, y1, x2, y2):\r\n d = abs(x1 - x2) ** 2 + abs(y1 - y2) ** 2\r\n d = d ** (1/2)\r\n return d\r\nN, K = map(int,input().split())\r\n\r\nx0, y0 = None, None\r\nd = 0\r\nfor n in range(N):\r\n x, y = map(int,input().split())\r\n if x0 != None:\r\n d += euD(x0, y0, x, y)\r\n x0, y0 = x, y\r\nprint(d * K / 50)", "import string\r\nimport math\r\n\r\ndef main_function():\r\n n, k = [int(i) for i in input().split(\" \")]\r\n signature = [[int(i) for i in input().split(\" \")] for j in range(n)]\r\n starting_point = signature[0]\r\n length = 0\r\n for i in range(1, len(signature)):\r\n length += math.sqrt((signature[i][0] - starting_point[0]) ** 2 + (signature[i][1] - starting_point[1]) ** 2)\r\n starting_point = signature[i]\r\n return k * (length / 50)\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "from math import sqrt\r\nn,k=map(int,input().split())\r\nh=0\r\nx1,y1=map(int,input().split())\r\nfor i in range(n-1):\r\n x2,y2=map(int,input().split())\r\n h+=sqrt((x1-x2)**2+(y1-y2)**2)\r\n x1,y1=x2,y2\r\nprint('{:.7f}'.format(h*k/50))", "import sys\r\nimport math\r\n\r\nn,k=map(int,input().split())\r\nmul=[]\r\nwed=((float)(0))\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n mul.append((a,b))\r\n if i>0:\r\n xa=(float)((abs(mul[i-1][0]-a)**2))\r\n xb=(float)((abs(mul[i-1][1]-b)**2))\r\n wed+=(float)(pow(xa+xb,(float)(0.5)))\r\nspd=(float)(wed/(float)(50))*((float)(k))\r\nprint(\"%.9f\" %(spd))", "n,k = map(int, input().split())\r\ndl=0\r\nx, y = map(int, input().split())\r\nfor i in range(n-1):\r\n a, b = map(int, input().split())\r\n if a==x:\r\n dl+=abs(b-y)\r\n elif b==y:\r\n dl+=abs(a-x)\r\n else:\r\n dl+=(abs(a-x)**2+abs(b-y)**2)**0.5\r\n x, y =a, b\r\nprint(dl*k/50)\r\n", "import math\n\nwriting_speed = 50\nn, k = map(int, input().split())\nxs = []\nys = []\nfor i in range(n):\n\tx, y = map(int, input().split())\n\txs.append(x)\n\tys.append(y)\ntotal_distance = 0\nfor i in range(n-1):\n\ttotal_distance += math.sqrt((xs[i+1] - xs[i]) ** 2 + (ys[i+1] - ys[i]) ** 2)\ntotal_time = total_distance / writing_speed * k\nprint(total_time)", "import math\r\n#hur skriver man en functions som försäkrar att maths är importerat\r\n# assert import math?\r\ndef eud(p1,p2):\r\n return math.sqrt((p1[0]-p2[0])**2 + (p1[1]-p2[1])**2)\r\n\r\nn,k = map(int,input().split())\r\n\r\np1 = list(map(int,input().split()))\r\nd = 0\r\nfor i in range(1,n):\r\n tmp = list(map(int,input().split()))\r\n d += eud(tmp,p1)\r\n p1 = tmp\r\n\r\nprint(d*k/50)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\nprint(sum([(abs(a-c)**2 + abs(b-d)**2)**0.5 for ((a,b),(c,d)) in (zip(g, g[1:]))])*k/50)", "import math\r\ndef dist(x1,y1,x2,y2):\r\n\treturn math.sqrt((x2-x1)**2 + (y2-y1)**2)\r\nn, k = map(int, input().split())\r\nx, y = list(), list()\r\nfor i in range(n) :\r\n\txx, yy = map(int, input().split())\r\n\tx.append(xx)\r\n\ty.append(yy)\r\ni ,ans = 0, 0.0\r\nfor j in range(1, n):\r\n\tans += dist(x[i],y[i],x[j],y[j])\r\n\ti += 1\r\nprint(\"%.12f\"% (ans * (float)(k) / 50.0))", "def dis(x1,y1,x2,y2):\r\n x = (x1-x2)**2\r\n y = (y1-y2)**2\r\n return((x+y)**0.5)\r\n\r\nn,k = map(int,input().split())\r\nx = []\r\ny = []\r\nz = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n x.append(a)\r\n y.append(b)\r\n if(i>0):\r\n z.append(dis(a,b,x[i-1],y[i-1])/50)\r\n\r\nprint(sum(z)*k)", "import math\r\nn, k = map(int, input().split())\r\nx = []\r\ny = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n x.append(a)\r\n y.append(b)\r\n\r\ntot = 0\r\nfor i in range(1, n):\r\n dis = ((x[i] - x[i - 1]) ** 2) + ((y[i] - y[i - 1]) ** 2)\r\n dis = math.sqrt(dis)\r\n tot += dis\r\n\r\nprint((tot * k) / 50)\r\n", "n, k = map(int, input().split())\r\nx0, y0 = map(int, input().split())\r\nc = 0\r\nfor i in range(n-1):\r\n x, y = map(int, input().split())\r\n c += ((x-x0)**2 + (y-y0)**2)**0.5\r\n x0 = x\r\n y0 = y\r\nprint(c*k/50)", "n, k = map(int, input().split())\r\n\r\ncelkovo = 0\r\nx, y = map(int, input().split())\r\nfor i in range(n-1):\r\n x1, y1 = map(int, input().split())\r\n\r\n if x1 == x:\r\n hodnota = abs(y-y1)\r\n celkovo += hodnota\r\n elif y1 == y:\r\n hodnota = abs(x-x1)\r\n celkovo += hodnota\r\n else:\r\n a = abs(x1-x)\r\n b = abs(y1-y)\r\n c = (a**2+b**2)**(1/2)\r\n celkovo += c\r\n x, y = x1, y1\r\nprint(\"{:.9f}\".format(celkovo/50*k))", "import math\r\n\r\n\r\ndef dis(p1, p2):\r\n x1, y1 = p1\r\n x2, y2 = p2\r\n left = pow(x2 - x1, 2)\r\n right = pow(y2 - y1, 2)\r\n return math.sqrt(left + right)\r\n\r\nn, k = list(map(int, input().split(\" \")))\r\nt = n\r\npoints = []\r\nwhile t > 0:\r\n t -= 1\r\n points.append(list(map(int, input().split(\" \"))))\r\n\r\nd = 0\r\nfor i in range(n - 1):\r\n d += dis(points[i], points[i + 1])\r\n\r\nprint('{0:.9f}'.format((d * k) / 50,))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef len(x1, y1, x2, y2):\r\n return ((x1-x2)**2 + (y1-y2)**2)**0.5\r\n\r\n\r\nn, k = map(int, input().split())\r\nans = 0\r\nx1, y1 = map(int, input().split())\r\nfor i in range(n-1):\r\n x2, y2 = map(int, input().split())\r\n\r\n ans += len(x1, y1, x2, y2)\r\n x1 = x2\r\n y1 = y2\r\n\r\nans = \"{0: .9f}\".format(ans*k*0.02)\r\nprint(ans)\r\n", "'''input\n6 10\n5 0\n4 0\n6 0\n3 0\n7 0\n2 0\n'''\nn, k = map(int, input().split())\na, b = map(int, input().split())\nd = 0\nfor _ in range(n-1):\n\tx, y = map(int, input().split())\n\td += ((x-a)**2+(y-b)**2)**0.5\n\ta, b = x, y\nprint(k*d/50)\n", "def Dist(P1,P2):\n return pow((P2[1]-P1[1])**2 + (P2[0]-P1[0])**2,1/2)\n\nn,k=map(int,input().split())\nPoints=[]\nfor i in range(n):\n x,y=map(int,input().split())\n Points.append((x,y))\nD=0\nfor i in range(1,n):\n D+=Dist(Points[i],Points[i-1])\n\nD*=k\n\nans=D/50\n\nprint(ans)\n \n", "import math\n[n, k] = [int(i) for i in input().split(' ')]\n\ncoord = []\nfor i in range(n):\n [x, y] = [int(i) for i in input().split(' ')]\n coord.append((x, y))\n\none_paper = 0\nfor i in range(1, n):\n one_paper += math.sqrt((coord[i][0] - coord[i-1][0])**2 + (coord[i][1] - coord[i-1][1])**2)\n\none_paper = one_paper/ 50\nprint(round(one_paper*k,9))\n\t\t\t\t\t\t\t\t \t \t\t\t\t \t\t \t \t\t \t\t\t", "n, k = list(map(int, input().split()))\r\ndistance = 0\r\nx1, y1 = list(map(int, input().split()))\r\nfor _ in range(n - 1):\r\n x2, y2 = list(map(int, input().split()))\r\n distance += (abs(x2 - x1) ** 2 + abs(y2 - y1) ** 2) ** 0.5\r\n x1, y1 = x2, y2\r\ndistance *= k\r\nprint(distance / 50)", "n,k=map(int,input().split());x,y=map(int,input().split());v=0\r\nfor i in range(n-1):a,b=map(int,input().split());t=(a-x)**2+(b-y)**2;v+=t**0.5;x,y=a,b\r\nprint(v*k/50)", "n, k = map(int, input().split())\r\na, b = map(int, input().split())\r\nl = 0\r\n\r\nfor _ in range(1, n):\r\n x, y = map(int, input().split())\r\n l += ((x - a)**2 + (y - b)**2)**0.5\r\n a, b = x, y\r\n\r\nprint(l*k/50)\r\n", "import math\r\nn, k = map(int, input().split())\r\nv = 50\r\ns = 0\r\nposx, posy = map(int, input().split())\r\nfor i in range(n - 1):\r\n tx, ty = map(int, input().split())\r\n s += math.sqrt((posx - tx) ** 2 + (posy - ty) ** 2)\r\n posx, posy = tx, ty\r\nprint(s * k / v)\r\n", "from math import sqrt\r\ndef distance(x1,y1,x2,y2):\r\n xdis=(x1-x2)**2\r\n ydis=(y1-y2)**2\r\n dis=sqrt(xdis+ydis)\r\n return dis\r\nn,k=map(int,input().split())\r\npoints=[]\r\ntot = 0\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n points.append((x,y))\r\nfor j in range(len(points)-1):\r\n tot += distance(points[j][0],points[j][1],points[j+1][0],points[j+1][1])\r\nest = (tot / 50)\r\nwaste = est *k\r\nprint('%.9f'%(waste))\r\n\r\n \r\n \r\n\r\n\r\n\r\n##print('%.9f'%(5/2))\r\n", "from math import hypot\n\nn, k = map(int, input().split())\ntotal_len = 0\nx, y = map(int, input().split())\nfor _ in range(n - 1):\n nx, ny = map(int, input().split())\n total_len += hypot(x - nx, y - ny)\n x, y = nx, ny\n\nprint(k * total_len / 50)\n", "import math\r\nn,k = [int(i) for i in input().split()] \r\nlis= []\r\nfor i in range(n):\r\n lis.append([int(j) for j in input().split()])\r\nsum =0\r\nfor i in range(n-1):\r\n sum += math.sqrt((lis[i][0]-lis[i+1][0])**2+(lis[i][1]-lis[i+1][1])**2)\r\nprint(sum*k/50)", "from math import sqrt\n\ndef main():\n n, k = map(int, input().split())\n c = []\n for _ in range(n):\n c.append(tuple(map(int, input().split())))\n\n def d(p1, p2):\n return sqrt((p1[0] - p2[0]) ** 2 + (p1[1] - p2[1]) ** 2)\n\n ds = sum([d(c[i], c[i + 1]) for i in range(n - 1)])\n print((ds / 50) * k)\n\nmain()\n\t \t \t\t\t \t\t \t\t \t\t \t\t\t \t", "import math\r\nn,k=input().split()\r\nn,k=int(n),int(k)\r\nls=[]\r\nsum=0\r\nfor i in range(n):\r\n ls.append(list(map(int,input().split())))\r\n if(i!=0):\r\n sum+= math.sqrt((ls[i][0] - ls[i - 1][0]) ** 2 + (ls[i][1] - ls[i - 1][1]) ** 2)\r\nprint(sum*k/50) ", "from math import sqrt\r\nn,k = list(map(int, input().split(\" \")))\r\na,b = list(map(int, input().split(\" \")))\r\nsum=0\r\nfor i in range(1,n):\r\n x = list(map(int, input().split(\" \")))\r\n sum+=sqrt(((a-x[0])**2)+((b-x[1])**2))\r\n a,b=x[0],x[1]\r\nprint((k*sum)/50)", "n, k = map(int, input().split())\r\nx1, y1 = map(int, input().split())\r\np = 0\r\nfor i in range(n - 1):\r\n x2, y2 = map(int, input().split())\r\n p += (abs(x1-x2)**2+abs(y1-y2)**2)**0.5\r\n x1, y1 = x2, y2\r\nprint(p * k / 50)", "import math;\r\nn, k = map(int, input().split())\r\ncords = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n cords.append((x, y))\r\n\r\n\r\ndef dist(cordOne, cordTwo):\r\n xOne, yOne = cordOne\r\n xTwo, yTwo = cordTwo\r\n return math.sqrt(math.pow((xOne - xTwo), 2) + math.pow((yOne - yTwo), 2))\r\n\r\n\r\ntotalDist = 0\r\n\r\nfor i in range(len(cords) - 1):\r\n totalDist += dist(cords[i], cords[i + 1])\r\n\r\nprint((totalDist / 50) * k)\r\n", "import math\r\nn,k=map(int,input().split())\r\nx,y=map(int,input().split())\r\nans=0\r\nfor i in range(n-1):\r\n l,r=map(int,input().split())\r\n ans+=math.sqrt(abs((l-x)**2)+abs((r-y)**2))\r\n x,y=l,r\r\nprint(k*ans/50)", "n,k=map(int,input().split())\r\nb=[]\r\nfor i in range(n):\r\n a= list(map(int, input().split()))\r\n b.append(a)\r\ndef d(a1,a2):\r\n return pow(pow(a1[0]-a2[0],2)+pow(a1[1]-a2[1],2),0.5)\r\nans=0\r\nfor i in range(n-1):\r\n ans+=d(b[i+1],b[i])\r\nprint(ans*k/50)\r\n", "n_k = list(map(int, input().split()))\nn = n_k[0]\nk = n_k[1]\n\nlength = 0\nlast_point = list(map(int, input().split()))\nfor i in range(n-1):\n this_point = list(map(int, input().split()))\n length += ((last_point[0]-this_point[0])**2 + (last_point[1]-this_point[1])**2)**0.5\n last_point = this_point\n\ntime = length/50\nprint(time*k)", "take = input().split()\r\nn = int(take[0])\r\nk = int(take[1])\r\nX = []\r\nY = []\r\nfor i in range(n) :\r\n point = input().split()\r\n X.append(int(point[0]))\r\n Y.append(int(point[1]))\r\n \r\nimport math\r\nlength = 0\r\nfor i in range(n-1) :\r\n dist = math.sqrt((X[i+1]-X[i])**2+(Y[i+1]-Y[i])**2)\r\n length += dist\r\nprint(length*k/50)", "from math import sqrt\r\ndef solve():\r\n n,k=map(int,input().split());dis=0;a=[]\r\n for i in range(n):\r\n x,y=map(int,input().split());a.append((x,y))\r\n for i in range(1,n):\r\n dis+=sqrt(((a[i][0]-a[i-1][0])**2)+((a[i][1]-a[i-1][1])**2))\r\n print((dis/50)*k)\r\nsolve()\r\n", "from math import sqrt\r\nd = 0\r\nn, k = [int(i) for i in input().split()]\r\nx1, y1 = [int(i) for i in input().split()]\r\nfor i in range(n-1):\r\n x2, y2 = [int(i) for i in input().split()]\r\n d += sqrt( ((x2 - x1)**2) + ((y2 - y1)**2) )\r\n x1 = x2\r\n y1 = y2\r\nprint( \"{:0.9f}\".format((d/50)*k) )", "n, k = map(int, input().split())\ncur_x, cur_y = map(int, input().split())\ndistance = 0\n\nfor _ in range(n - 1):\n next_x, next_y = map(int, input().split())\n distance += ((next_x - cur_x)**2 + (next_y - cur_y)**2)**0.5\n cur_x, cur_y = next_x, next_y\n\nprint(distance * k / 50)\n\n \t\t \t\t\t\t \t\t\t\t\t \t\t\t \t \t \t\t \t\t", "import sys\r\nimport math\r\n\r\nn, k = list(map(int, sys.stdin.readline().strip().split()))\r\n\r\nlx, ly = list(map(int, sys.stdin.readline().strip().split()))\r\nres = 0\r\n\r\nfor _ in range(1, n):\r\n x, y = list(map(int, sys.stdin.readline().strip().split()))\r\n dx, dy = x - lx, y - ly\r\n dis = math.sqrt(dx**2 + dy**2)\r\n res += dis\r\n lx, ly = x, y\r\n\r\nprint(res / 50 * k)\r\n", "from math import sqrt\n\ndef time_wasted():\n n, k = map(int, input().strip().split())\n points = []\n for i in range(n):\n x, y = map(int, input().strip().split())\n points.append((x, y))\n\n total_length = 0\n for i in range(1, len(points)):\n x1, y1 = points[i-1]\n x2, y2 = points[i]\n total_length += sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\n\n time = total_length / 50 \n total_time= time * k\n return total_time\n\nprint(time_wasted())\n\t\t \t \t\t\t \t \t \t\t\t\t\t \t \t \t", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\n(n, k) = tuple(map(int, input().split()))\r\n(x1, y1) = tuple(map(int, input().split()))\r\ndist = 0\r\n\r\nfor i in range(n-1):\r\n (x2, y2) = tuple(map(int, input().split()))\r\n dist += math.sqrt((x2-x1)**2 + (y2-y1)**2)\r\n\r\n (x1, y1) = (x2, y2)\r\n\r\nprint((k * dist) / 50)\r\n\r\n\r\n\r\n ", "import math\r\ndis = 0\r\nX, Y = [], []\r\ni, j = 1, 1\r\nn,k = map(int, input().split())\r\nfor _ in range(n):\r\n x,y = map(int, input().split())\r\n X.append(x); Y.append(y)\r\nwhile i != len(X) and j != len(Y):\r\n dis += math.sqrt(abs(X[i]-X[(i-1)])**2 + abs(Y[j]-Y[(j-1)])**2)\r\n i += 1; j += 1\r\n \r\nprint(\"{0:.10f}\".format((dis/50)*k))", "import math\n\n\nn, k = [int(i) for i in input().split()]\n\ntotal = 0.0\n\nxi, yi = [float(i) for i in input().split()]\nfor _ in range(0, n - 1):\n x, y = [float(i) for i in input().split()]\n total = total + math.sqrt(((x - xi) ** 2) + ((y - yi) ** 2))\n xi = x\n yi = y\n\nprint(\"{:.6f}\".format(total * k /50))\n\n \t \t \t \t \t \t\t \t \t\t \t\t\t", "def li():\r\n return list(map(int,input().split()))\r\ndef gi(n):\r\n return [list(map(int,input().split())) for _ in range(n)]\r\n\r\n# File input\r\n\r\n# import sys\r\n# sys.stdin = open('user.txt','r')\r\n\r\nfrom math import sqrt\r\n\r\nlx,ly = None,None\r\nans = 0\r\nn,k = li()\r\nfor i in range(n):\r\n x,y = li()\r\n if not i:\r\n lx,ly = x,y\r\n else:\r\n ans += sqrt((x-lx)**2 + (y-ly)**2)\r\n lx,ly = x,y\r\nprint(ans * k / 50)", "import sys\r\nfrom typing import Callable\r\nimport math\r\n\r\nEPS = 1e-6\r\n\r\n\r\ndef distance(x: float, y: float) -> float:\r\n return math.hypot(x, y)\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n, k = (int(i) for i in read().split())\r\n prev: tuple[int, int] | None = None\r\n total_distance = 0\r\n for _ in range(n):\r\n x, y = (int(i) for i in read().split())\r\n if prev is not None:\r\n total_distance += distance(prev[0] - x, prev[1] - y)\r\n prev = (x, y)\r\n rate_per_signature = total_distance / 50\r\n print(rate_per_signature * k)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def required(list1, list2):\r\n return ((((list1[0])-(list2[0]))**2)+(((list1[1])-(list2[1]))**2))**0.5 \r\n\r\n\r\nz=map(int,input().split())\r\nn,k=z\r\nt=[]\r\nfor i in range(n):\r\n y=map(int,input().split())\r\n a,s=y\r\n sum=0\r\n t.append([a,s])\r\n for j in range(0,len(t)-1):\r\n sum+=required(t[j],t[j+1])\r\n \r\n\r\nprint((sum*k)/50)\r\n\r\n\r\n", "n,k=[int(i) for i in input().split()]\r\nx,y=[int(j) for j in input().split()]\r\nl=0\r\nfor i in range(n-1):\r\n a,b=[int(j) for j in input().split()]\r\n l=l+((a-x)**2+(b-y)**2)**(1/2)\r\n x=a\r\n y=b\r\nprint(l*k/50)\r\n", "import math as m\nn, k = [int(x) for x in input().split()]\nd=[]\ndist=0\nans=0\nfor i in range(n):\n d.append([int(y) for y in input().split()])\nfor i in range(n-1):\n dist+=m.sqrt(abs(d[i][0]-d[i+1][0])**2+abs(d[i][1]-d[i+1][1])**2)\nans=dist*k*0.02\nprint(\"{:.9f}\".format(ans))\n\t\t\t \t\t \t\t\t \t\t \t\t\t \t\t \t", "n, k = map(int, input().split())\r\nnowx, nowy = map(int, input().split())\r\nans = 0\r\nfor i in range(n - 1):\r\n x, y = map(int, input().split())\r\n ans += ((nowx - x) * (nowx - x) + (nowy - y) * (nowy - y)) ** 0.5\r\n nowx, nowy = x, y\r\nprint(ans * k / 50)", "import math\nimport collections\ncost =0\nn,k=input().split()\npoint =collections.namedtuple(\"point\",\"x y\")\nlist =[]\nfor i in range(int(n)):\n x,y=input().split()\n list.append(point(int(x),int(y)))\nfor i in range(int(n)-1):\n cost+=math.hypot(list[i+1][0]-list[i][0],list[i+1][1]-list[i][1])\nprint((cost/50)*int(k))", "import math\r\n\r\ndef calculate_distance(x1, y1, x2, y2):\r\n return math.sqrt((x2 - x1) ** 2 + (y2 - y1) ** 2)\r\n\r\nn, k = map(int, input().split())\r\n\r\npoints = []\r\nfor _ in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\ntotal_length = 0\r\nfor i in range(1, n):\r\n x1, y1 = points[i - 1]\r\n x2, y2 = points[i]\r\n total_length += calculate_distance(x1, y1, x2, y2)\r\n\r\nsigning_speed = 50 # millimeters per second\r\ntotal_time = total_length / signing_speed * k\r\n\r\nprint(\"{:.9f}\".format(total_time))", "# https://codeforces.com/problemset/problem/127/A\r\n\r\nfrom math import sqrt\r\n\r\ntaille_signature, nb_papiers = map(int, input().split())\r\nlongueur_signature = 0\r\n\r\nx_prec, y_prec = map(int, input().split())\r\n\r\nfor _ in range(taille_signature - 1):\r\n x, y = map(int, input().split())\r\n longueur_signature += sqrt((x - x_prec) ** 2 + (y - y_prec) ** 2)\r\n x_prec, y_prec = x, y\r\n\r\nprint(longueur_signature * nb_papiers / 50)\r\n", "n, k = map(int, input().split())\r\nA = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n A.append((x, y))\r\n\r\nans = 0\r\nimport math\r\nfor i in range(1, n):\r\n x1, y1 = A[i-1]\r\n x2, y2 = A[i]\r\n ans += math.hypot(x1-x2, y1-y2)\r\nans /= 50\r\nans *= k\r\nprint(ans)\r\n", "n,k=map(int,input().split())\r\nans=0\r\np=list(map(int,input().split()))\r\nfor i in range(n-1):\r\n e=list(map(int,input().split()))\r\n dif=(p[0]-e[0])**2+(p[1]-e[1])**2\r\n p=e\r\n ans+=dif**0.5/50\r\nans*=k\r\nprint(ans)\r\n", "import math\r\nn,k = [int(i) for i in input().split()]\r\ntotal = 0\r\nlist1 = []\r\nfor x in range(n):\r\n x1,y1 = [int(i) for i in input().split()]\r\n if x==0:\r\n list1.append([x1,y1])\r\n continue\r\n total+=math.sqrt((list1[-1][0]-x1)**2+(list1[-1][1]-y1)**2)\r\n list1.append([x1,y1])\r\n \r\n\r\nprint(total*k/50)\r\n", "from math import sqrt\r\ndef solve():\r\n n,k=map(int,input().split());dis=0;currX,currY=None,None\r\n for i in range(n):\r\n if i==0:\r\n x,y=map(int,input().split());currX=x;currY=y;continue\r\n x,y=map(int,input().split())\r\n dis+=sqrt(((x-currX)**2)+((y-currY)**2));currX=x;currY=y\r\n print((dis/50)*k)\r\nsolve()\r\n", "n,k=list(map(int,input().split()))\r\narr=[]\r\nfor i in range(n):\r\n arr.append(tuple(map(int,input().split())))\r\n \r\nc=0\r\nfor i in range(n):\r\n if i==n-1: break\r\n x1=arr[i][0]\r\n x2=arr[i+1][0]\r\n y1=arr[i][1]\r\n y2=arr[i+1][1]\r\n c+=((((x2-x1)**2))+((y2-y1)**2))**.5\r\n \r\ntime=(c*(10**-3))/(50*(10**-3))\r\ntime*=k\r\nprint(\"%.9f\"%time)", "from collections import defaultdict\r\nimport math\r\nn,k=map(int,input().split())\r\npoints=[]\r\ndef dist(x,y):\r\n t1=(y[0]-x[0])**2\r\n t2=(y[1]-x[1])**2\r\n return math.sqrt(t1+t2)\r\nans=0\r\nfor _ in range(n):\r\n points.append(list(map(int,input().split())))\r\nfor i in range(n-1):\r\n ans+=dist(points[i],points[i+1])\r\nprint((ans*k)/50)\r\n", "import sys\r\nfrom math import ceil,floor,sqrt,log,dist\r\nfrom collections import defaultdict\r\nfrom operator import itemgetter\r\nrmi=lambda:map(int,input().split())\r\nrs=lambda:input()\r\nri=lambda:int(rs())\r\ninf=float('inf')\r\ndef f():\r\n n,k=rmi()\r\n b=[]\r\n otv=0\r\n for _ in range(n):\r\n x,y=rmi()\r\n b.append((x,y))\r\n for i in reversed(range(1,len(b))):\r\n otv+=(((b[i][0]-b[i-1][0])**2+(b[i][1]-b[i-1][1])**2)**(1/2))/50\r\n print(otv*k)\r\nf()\r\n \r\n", "n, k = map(int, input().split())\r\nx = []\r\ny = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x.append(a)\r\n y.append(b)\r\ndist = 0\r\nfor i in range(1, n):\r\n temp = ((x[i]-x[i-1])**2 + (y[i]-y[i-1])**2)**0.5\r\n dist += temp\r\ntime = dist/50\r\nans = time * k\r\nprint(ans)", "n, k = map(int, input().split())\nl = []\nfor i in range(n):\n l.append(list(map(int, input().split())))\ns = 0\nfor i in range(1, n):\n s += ((l[i][0]-l[i-1][0])**2 + (l[i][1]-l[i-1][1])**2)**0.5\n \nprint(s*k/50)\n\n \t\t\t\t \t\t\t\t \t \t \t\t\t\t\t\t", "import math \r\nt,l=0,[]\r\nn,p=map(int,input().split(' '))\r\nfor i in range(n):\r\n x,y=map(int,input().split(' '))\r\n l.append([x,y])\r\nfor i in range(1,n):\r\n x=l[i][0]-l[i-1][0]\r\n y=l[i][1]-l[i-1][1]\r\n t+=math.sqrt(x**2 +y**2)\r\nprint((t/50)*p)", "n,k=map(int,input().split())\r\nxp=[]\r\nyp=[]\r\ndef dist(x1,y1,x2,y2):\r\n\treturn ((x1-x2)**2+(y1-y2)**2)**0.5\r\n\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\txp.append(x)\r\n\typ.append(y)\r\nd=0\r\nfor i in range(n-1):\r\n\tx1,x2=xp[i],xp[i+1]\r\n\ty1,y2=yp[i],yp[i+1]\r\n\td+=dist(x1,y1,x2,y2)\r\nlost=(d*k)/50\r\nprint(lost)\r\n\r\n", "n, k = map(int,input().split())\r\nx1,y1 = map(int,input().split())\r\nt = 0\r\nfor i in range(n-1):\r\n x2,y2 = map(int,input().split())\r\n t += ((x1-x2)**2 + (y1-y2)**2)**0.5\r\n x1 = x2\r\n y1 = y2\r\nprint(t*k/50)", "import math\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n last_x, last_y = map(float, input().split())\r\n distance = 0\r\n for _ in range(n - 1):\r\n x, y = map(float, input().split())\r\n distance += math.sqrt((x - last_x) ** 2 + (y - last_y) ** 2)\r\n last_x, last_y = x, y\r\n\r\n print(distance / 50 * k)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n,k=map(int,input().split())\r\nans=0\r\nfx,fy=map(int,input().split())\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n ans+=(((fx-x)**2+(fy-y)**2)**.5)/50\r\n fx,fy=x,y\r\nprint(ans*k)", "from math import sqrt\r\n\r\nX, Last, SUM = list(map(int, input().split())), list(map(int, input().split())), 0\r\nfor i in range(X[0] - 1):\r\n Temp = list(map(int, input().split()))\r\n SUM += sqrt((Last[0] - Temp[0]) ** 2 + (Last[1] - Temp[1]) ** 2)\r\n Last = Temp\r\nprint((SUM * X[1]) / 50)\r\n", "import math\r\nn,k = map(int,input().split())\r\na,b = map(int,input().split())\r\nsum = 0\r\nfor i in range(n-1):\r\n c,d = map(int,input().split())\r\n if b == d or a == c:\r\n i = abs(a-c)+abs(b-d)\r\n else:\r\n t = (a-c)**2 + (b-d)**2\r\n i = math.sqrt(t)\r\n sum += (i * k)\r\n a,b = c,d\r\nprint(round(sum/50, 6))\r\n\r\n\n# Sat Jan 07 2023 10:53:39 GMT+0300 (Moscow Standard Time)\n", "from math import sqrt\r\nn, k = [int(i) for i in input().split()]\r\ndur = 0\r\nx, y = [int(i) for i in input().split()]\r\nfor i in range(n - 1):\r\n x1, y1 = [int(i) for i in input().split()]\r\n dur += (sqrt((x1 - x) ** 2 + (y1 - y) ** 2)) / 50\r\n x, y = x1, y1\r\nprint(dur * k)", "n, k = map(int, input().split())\r\na, b = map(int, input().split())\r\np = 0\r\nfor i in range(n - 1):\r\n x, y = map(int, input().split())\r\n t = (x-a)**2+(y-b)**2\r\n p += t**0.5\r\n a, b = x, y\r\nprint(p*k/50)", "import math\r\nn, k = map(int, input().split())\r\nx, y = map(int, input().split())\r\nlength = 0\r\nfor i in range(n-1):\r\n\tc, d = map(int, input().split())\r\n\tlength+=(math.sqrt((c-x)**2+(d-y)**2))\r\n\tx = c\r\n\ty = d\r\nprint((length/50)*k)", "import math\r\nn,k = map(int,input().split())\r\nx0,y0 = -50,-50\r\nspeed = 50\r\ntotal =0\r\ndef dist(x1,y1,x0,y0):\r\n return math.sqrt((x1-x0)**2 + (y1-y0)**2)\r\nfor i in range(n):\r\n x1,y1 = map(int, input().split())\r\n if x0 == -50 and y0 == -50:\r\n x0=x1\r\n y0=y1\r\n else:\r\n total += dist(x1,y1,x0,y0)\r\n x0=x1\r\n y0=y1\r\n\r\nprint(k*(total/speed))", "b,c=input().split()\r\nn=int(b)\r\nk=int(c)\r\ns=0\r\ng,h=input().split()\r\nx1=int(g)\r\ny1=int(h)\r\n \r\ndef dist(x1,y1,x2,y2):\r\n d=(((x2-x1))**2+((y1-y2)**2))**0.5\r\n return d\r\nfor i in range(1,n):\r\n z,t=input().split()\r\n x2=int(z)\r\n y2=int(t)\r\n s+=dist(x1,y1,x2,y2)\r\n x1=x2\r\n y1=y2\r\ns*=k \r\nprint(s/50) ", "# https://codeforces.com/problemset/problem/127/A\n# 900\n\nimport math\n\nn, k = map(int, input().split())\n\nt = 0\nprev = None\nfor _ in range(n):\n x, y = map(int, input().split())\n if prev is None:\n prev = (x,y)\n continue\n\n px, py = prev\n\n d = math.sqrt(((x - px)**2) + ((y - py) ** 2))\n t += (d * k) / 50\n\n prev = (x,y)\n\nprint(t)", "# coding: utf-8\nimport math\nn, k = [int(i) for i in input().split()] \nx, y = [int(i) for i in input().split()]\ndis = 0\nfor i in range(n-1):\n xx, yy = [int(i) for i in input().split()]\n dis += math.sqrt(pow(x-xx,2)+pow(y-yy,2))\n x, y = xx, yy\nprint(dis/50*k)\n", "n,k = [int(i) for i in input().split()]\npoint = [[int(i) for i in input().split()] for _ in range(n)]\ncur = point[0]\ntl = 0\nfor x,y in point[1:]:\n tl += ((x-cur[0])**2 + (y-cur[1])**2)**0.5\n cur = (x,y)\ntl *= k\nprint(tl / 50)\n \t\t\t\t\t\t \t \t\t \t \t\t \t\t \t \t\t", "from math import sqrt\r\n\r\nn, k = list(map(int, input().split()))\r\npreva, prevb = list(map(int, input().split()))\r\ntotal = 0.0\r\nfor i in range(1, n):\r\n cura, curb = list(map(int, input().split()))\r\n dista = abs(cura-preva)\r\n distb = abs(curb-prevb)\r\n total += sqrt(dista**2 + distb**2)\r\n preva = cura\r\n prevb = curb\r\n\r\nprint(total*k/50)", "# t = int(input())\n# for i in range(t):\n# n = int(input())\n# a = sorted([int(y) for y in input().split()])\n# print(a[-1]-a[0])\n\n# t = int(input())\n# for i in range(t):\n# a = [int(y) for y in input().split()]\n# if a == [1, 1]:\n# print(0)\n# elif a[0] == 1 or a[-1] == 1:\n# print(1)\n# else:\n# print(2)\n\n# t = int(input())\n# for i in range(t):\n# l = sorted([int(y) for y in input().split()], reverse = 1)\n# if l[0] == l[1] + l[2]:\n# print('YES')\n# elif l[0] == l[1]:\n# if l[2] % 2 == 0:\n# print('YES')\n# else:\n# print('NO')\n# elif l[1] == l[2]:\n# if l[0] % 2 == 0:\n# print('YES')\n# else:\n# print('NO')\n# else:\n# print('NO')\n\n# t = int(input())\n# for i in range(t):\n# a, b, c = [int(y) for y in input().split()]\n# if (b - (c - b)) % a == 0 and (b - (c - b)) / a > 0:\n# print('YES')\n# elif ((c+a)/2) % b == 0 and ((c+a)/2) / b > 0:\n# print('YES')\n# elif (b+b-a) % c == 0 and (b+b-a) / c > 0:\n# print('YES')\n# else:\n# print('NO')\n\n# t = int(input())\n# for i in range(t):\n# n, s = [int(y) for y in input().split()]\n# r = s // n**2\n# if n == 0 or s == 0:\n# print(0)\n# else:\n# print(r)\n\n# a = ''\n# for i in range(int(input())):\n# x1, p1 = [int(y) for y in input().split()]\n# x2, p2 = [int(r) for r in input().split()]\n# if p1-p2 > 6:\n# a += '>\\n'\n# elif p2-p1 > 6:\n# a += '<\\n'\n# else:\n# if p1 > p2:\n# x1 = x1 * 10**(p1-p2)\n# elif p1 < p2:\n# x2 = x2 * 10 ** (p2 - p1)\n# if x1 == x2:\n# a += '=\\n'\n# elif x1 < x2:\n# a += '<\\n'\n# else:\n# a += '>\\n'\n# print(a)\n\n# for i in range(int(input())):\n# n = int(input())\n# print(-1*(n-1), n)\n\n# for i in range(int(input())):\n# l, r, a = [int(r) for r in input().split()]\n# t = r%a\n# d = r//a\n# if t == a-1 or t == a-2:\n# print(t+d)\n# else:\n# if r-t-1 >= l:\n# print((a-1)+(d-1))\n# else:\n# print(t+d)\n\n# for i in range(int(input())):\n# x, n = [int(r) for r in input().split()]\n# n1 = n % 4\n# if n1 > 0:\n# for j in range(n - n1 + 1, n+1):\n# if x % 2 != 0:\n# x += j\n# else:\n# x -= j\n# print(x)\n# else:\n# print(x)\n\n# import math\n# for i in range(int(input())):\n# n, k = [int(r) for r in input().split()]\n# if n >= k:\n# if n % k == 0:\n# print(1)\n# else:\n# print(2)\n# else:\n# print(math.ceil(k/n))\n\n# import math\n# for i in range(int(input())):\n# w, h = [int(r) for r in input().split()]\n# x = [int(r) for r in input().split()[1:]]\n# x2 = [int(r) for r in input().split()[1:]]\n# y = [int(r) for r in input().split()[1:]]\n# y2 =[int(r) for r in input().split()[1:]]\n# xy = [\n# [[min(x),0], [max(x), 0]],\n# [[0, min(y)], [0, max(y)]],\n# [[min(x2), h], [max(x2), h]],\n# [[w, min(y2)], [w, max(y2)]]\n# ]\n# s_total = 0\n# for j in range(len(xy)):\n# k = (j+2)%4\n# for f in range(2):\n# a = math.sqrt((xy[j][0][0] - xy[j][1][0])**2 + (xy[j][0][1] - xy[j][1][1])**2)\n# b = math.sqrt((xy[j][0][0] - xy[k][f][0])**2 + (xy[j][0][1] - xy[k][f][1])**2)\n# c = math.sqrt((xy[j][1][0] - xy[k][f][0])**2 + (xy[j][1][1] - xy[k][f][1])**2)\n# p = (a+b+c) / 2\n# s = math.sqrt(p*(p-a)*(p-b)*(p-c))\n# if s > s_total:\n# s_total = s\n# print(round(s_total*2))\n\n# s = 0\n# for i in range(int(input())):\n# x, y = [int(r) for r in input().split()]\n# if x+y > s:\n# s = x+y\n# print(s)\n\n# for i in range(int(input())):\n# n = int(input())\n# p = [int(r) for r in input().split()]\n# m = int(input())\n# q = [int(r) for r in input().split()]\n# ch1 = 0\n# nch1 = 0\n# ch2 = 0\n# nch2 = 0\n# for j in p:\n# if j % 2 == 0:\n# ch1 += 1\n# else:\n# nch1 += 1\n# for f in q:\n# if f % 2 == 0:\n# ch2 += 1\n# else:\n# nch2 += 1\n# print(ch1*ch2+nch1*nch2)\n\n# h, l = [int(r) for r in input().split()]\n# print((l**2+h**2)/(2*h)-h)\n\n# import math\n# n = int(input())\n# n1 = math.floor(math.sqrt(n))\n# n2 = n1**2\n# n3 = n - n2\n# n4 = math.ceil(n3/n1)\n# print(2*(n1+n1+n4))\n\nimport math\nn, k = [int(r) for r in input().split()]\nc = []\nfor i in range(n):\n x, y = [int(r) for r in input().split()]\n c.append([x, y])\ntd = 0\nfor j in range(n-1):\n d = math.sqrt((c[j][0]-c[j+1][0])**2+(c[j][1]-c[j+1][1])**2)\n td += d\nprint((td/50)*k)", "n,k=map(int,input().split())\r\nz=[[int(i) for i in input().split()]for j in range(n)]\r\na=0\r\nfor i in range(1 , n):\r\n a+=((z[i-1][0]-z[i][0])**2+(z[i-1][1]-z[i][1])**2)**0.5 \r\nprint(a*k/50)\r\n", "n,k=map(int, input().strip().split())\n\nr2=0\nres=[]\n\nfor i in range( 0, n): \n\tx, y = map(int, input().strip().split())\n\tif i != 0:\n\t\tr2 += ((res[-1][0]-x)**2+(res[-1][1]-y)**2)**0.5\n\tres.append([x, y])\nprint((r2*k)*0.02)", "inp = input().split()\r\nn = int(inp[0])\r\nk = int(inp[1])\r\nxx =[]\r\nyy=[]\r\nt=0\r\nfor i in range(n):\r\n p = input().split()\r\n x = int(p[0])\r\n xx.append(x)\r\n y = int(p[1])\r\n yy.append(y)\r\nfor i in range(n-1):\r\n t += ((xx[i+1]-xx[i])**2 + (yy[i+1]-yy[i])**2)**0.5\r\nh = t*k/50\r\nprint(\"%.9f\"%h)", "import math\r\np,s=map(int,input().split())\r\nd=0\r\na=[]\r\nfor i in range(p):\r\n x,y=map(int,input().split())\r\n a.append([x,y])\r\nfor i in range(p-1):\r\n x1=a[i][0]\r\n y1=a[i][1]\r\n x2=a[i+1][0]\r\n y2=a[i+1][1]\r\n d+=math.sqrt((x1-x2)*(x1-x2)+(y1-y2)*(y1-y2))\r\n x=(d*(s/50))\r\nprint(\"%.6f\" %x)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jul 25 17:07:32 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 64 - CF127-DIV2A\r\n\"\"\"\r\nimport math\r\n\r\nlines, factor = map(int,input().split())\r\nans = 0\r\nst1,en1 = map(int,input().split())\r\nfor i in range(1,lines):\r\n st2,en2 = map(int,input().split())\r\n ans += factor*math.sqrt((st2-st1)**2 + (en2-en1)**2)/50\r\n st1,en1 = st2,en2\r\n\r\nprint(ans)", "def cartesianDistance(x1,y1,x2,y2):\r\n from math import sqrt\r\n return sqrt((x1-x2)**2+(y1-y2)**2)\r\nn,k = map(int,input().split(' '))\r\nox,oy = map(int,input().split(' '))\r\ndist = 0\r\nn-=1\r\nwhile n:\r\n n-=1\r\n nx,ny = map(int,input().split(' '))\r\n dist += cartesianDistance(ox,oy,nx,ny)\r\n ox = nx\r\n oy = ny\r\nti = dist / 50 * k\r\nprint(ti)", "from math import hypot\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nn, k = I()\r\nA = [tuple(I()) for _ in range(n)]\r\n\r\nprint(sum(hypot(x1-x2,y1-y2) for (x1,y1),(x2,y2) in zip(A,A[1:])) * k / 50)", "import math\r\n\r\nclass Point:\r\n \r\n def __init__(self, xValue, yValue):\r\n self.x = xValue\r\n self.y = yValue\r\n\r\n def getX(self):\r\n return self.x\r\n \r\n def getY(self):\r\n return self.y\r\n\r\n # Distancia entre el punto y otro\r\n def distanceToPoint(self, otherPoint):\r\n dx = math.fabs(self.x - otherPoint.getX())\r\n dy = math.fabs(self.y - otherPoint.getY())\r\n return math.hypot(dx,dy) # sqrt(x*x + y*y)\r\n\r\nlines, cant = list(map(int, input().split(\" \")))\r\ndistance = 0\r\nfor i in range(lines):\r\n x,y = list(map(int, input().split(\" \")))\r\n if i == 0:\r\n ant = Point(x,y)\r\n else:\r\n newPoint = Point(x,y)\r\n distance += ant.distanceToPoint(newPoint)\r\n ant = newPoint\r\nseconds = (distance * cant) / 50\r\nprint(str(\"%.9f\" % seconds))\r\n", "def get_len(x1, y1, x2, y2):\n return ((x1 - x2) ** 2 + (y1 - y2) ** 2)**0.5\n\n\nn, k = map(int, input().split())\nprev_x, prev_y = map(int, input().split())\nans = 0\nfor i in range(1, n):\n x, y = map(int, input().split())\n ans += get_len(prev_x, prev_y, x, y)\n prev_x, prev_y = x, y\nprint(ans * k / 50)\n", "from math import sqrt\r\n\r\nn, number_of_papers = map(int,input().split())\r\n\r\ntotal_distance = 0 \r\n\r\nx1, y1 = map(float,input().split())\r\n\r\nfor i in range(n-1):\r\n \r\n x2, y2 = map(float,input().split())\r\n \r\n distance = sqrt((y2-y1)**2 + (x2-x1)**2)\r\n total_distance += distance\r\n \r\n x1 = x2 \r\n y1 = y2 \r\n \r\n\r\nprint ( (total_distance/50)*number_of_papers )", "import math\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\nn, k = [int(i) for i in input().split()]\r\n\r\n\r\ndef distance(a, b):\r\n return math.sqrt((a[0] - b[0])**2 + (a[1] - b[1])**2)\r\n\r\n\r\na = []\r\nfor i in range(n):\r\n a.append([int(i) for i in input().split()])\r\n \r\nS = 0 \r\nfor i in range(1, n):\r\n S += distance(a[i-1], a[i])\r\n \r\nprint((S*k)/50)", "import sys\nmy_file = sys.stdin\n#my_file = open(\"input.txt\", \"r\")\nline = [int(i) for i in my_file.readline().strip().split()]\nn, k = line[0], line[1]\nline = [list(map(int, i.strip().split())) for i in my_file.readlines()]\nl = 0\nfor i in range(1, n):\n x = line[i][0] - line[i-1][0]\n y = line[i][1] - line[i-1][1]\n l += (x**2 + y**2)**0.5\nprint(l/50*k)", " \n\n\ndef solve(arr,k):\n x = 0\n for i in range(len(arr)-1):\n x += ((abs(arr[i][0] - arr[i+1][0]))**2 + (abs(arr[i][1] - arr[i+1][1]))**2)**.5\n return round((x/50)*k,6)\n \n \n\n \n\n \ndef main() :\n n,k = list(map(int, input().split(' ')))\n # n = int(input())\n arr = []\n for _ in range(n):\n i = list(map(int, input().split(' ')))\n arr.append(i)\n print(solve(arr,k))\nmain()\n", "from math import sqrt\r\n\r\n\r\ndef zhadina(a, b, k):\r\n result = 0\r\n for i in range(len(a)):\r\n if i + 1 < len(a):\r\n result += sqrt((a[i + 1] - a[i]) * (a[i + 1] - a[i]) + (b[i + 1] - b[i]) * (b[i + 1] - b[i])) / 50\r\n return format(result * k, '.9f')\r\n\r\n\r\nn, k = [int(j) for j in input().split()]\r\nx, y = list(), list()\r\nfor z in range(n):\r\n s, t = [int(r) for r in input().split()]\r\n x.append(s)\r\n y.append(t)\r\nprint(zhadina(x, y, k))\r\n", "from math import sqrt\r\n\r\nn, k = list(map(int, input().split(\" \")))\r\na, b = list(map(int, input().split(\" \")))\r\ns = 0\r\nfor i in range(1, n):\r\n x, y = map(int, input().split(\" \"))\r\n s += sqrt(((a - x) ** 2) + ((b - y) ** 2))\r\n a, b = x, y\r\nprint((k * s) / 50)\r\n", "import math\r\ndef distance_points(x1, y1, x2, y2):\r\n distance = (1.00 * (x2 - x1))**2\r\n distance += ((y2-y1)**2)\r\n distance = math.sqrt(distance)\r\n return distance\r\n\r\nn,k = map(int, input().split())\r\ndistance = 0.00\r\nfor i in range(0,n):\r\n x,y = map(int, input().split())\r\n if(i == 0):\r\n p_x, p_y = x,y\r\n else:\r\n distance+=distance_points(x,y, p_x,p_y)\r\n p_x,p_y = x,y\r\ntime = distance/50.0000\r\ntime*=k\r\nprint(time)\r\n", "import math\r\nn,k=map(int,input().split())\r\nx_,y_=map(int,input().split())\r\nans=0\r\nfor i in range(n-1):\r\n x,y=map(int,input().split())\r\n ans+=math.sqrt((x-x_)**2+(y-y_)**2)\r\n x_,y_=x,y\r\nprint((ans/50)*k)", "def distance(x1,y1,x2,y2):\r\n return pow(pow(x2-x1,2) + pow(y2-y1,2), 0.5)\r\n\r\nclass coord:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n\r\nn, k = [int(i) for i in input().split()]\r\ncoordinates = []\r\nfor i in range(n):\r\n x, y = [int(j) for j in input().split()]\r\n coordinates.append(coord(x, y))\r\n\r\namount_of_time = 0\r\nfor i in range(n-1):\r\n dist = distance(coordinates[i].x, coordinates[i].y, coordinates[i+1].x, coordinates[i+1].y)\r\n amount_of_time += dist / 50\r\namount_of_time *= k\r\nprint(amount_of_time)", "#\n# Joseph Matsushita\n# Problem B\n#\n\nimport math\n\ndef dist(a, b):\n return math.sqrt((a[0] - b[0])**2 + (a[1] - b[1])**2)\n \nn, k = map(int, input().split())\na = list()\n\nfor i in range(n):\n a.append(list(map(float, input().split())))\n\nsum = 0.0\nfor i in range(0, n-1):\n sum += dist(a[i], a[i+1])\n\nprint(sum * k / 50)\n\n \t \t \t\t\t\t \t \t\t\t \t\t\t \t\t\t\t", "import math\n\ndef dist(xa, ya, xb , yb):\n return math.sqrt((xa-xb)**2 + (ya-yb)**2)\n\n\na = list(map(int, input().split()))\nn = a[0]\nk = a[1]\ntmp = []\nfor _ in range(n):\n tmp.append(list(map(int, input().split())))\nd = 0\nfor i in range(n-1):\n d += dist(tmp[i][0], tmp[i][1], tmp[i+1][0], tmp[i+1][1])\n\n\n\nprint(\"{:.9f}\".format((d*k)/50))\n\n\n\n", "import math\r\n\r\nn, k= map(int, input().split())\r\nx1, y1 = map(int, input().split())\r\nlength = 0\r\n\r\nwhile n-1:\r\n n -= 1\r\n x2, y2 = map(int, input().split())\r\n length += math.sqrt((x2-x1)**2 + (y2-y1)**2)\r\n x1 = x2\r\n y1 =y2\r\n \r\nprint(f\"{length*k/50:.9f}\")", "def dist(x1, y1, x2, y2):\r\n return ( (x2-x1)**2 + (y2-y1)**2 )**0.5\r\n\r\n\r\nn, k = list( map(int, input().split()) )\r\ntotDist = 0\r\npoints = []\r\n\r\nfor _ in range(n):\r\n a, b = list( map(int, input().split()) )\r\n points.append((a,b))\r\n\r\nfor i in range(1, n):\r\n x1, y1 = points[i-1]\r\n x2, y2 = points[i]\r\n totDist += dist(x1, y1, x2, y2)\r\n\r\ntime = totDist / 50\r\nprint(time*k)\r\n", "# Link: https://codeforces.com/contest/127/problem/A\r\n\r\nimport math\r\n\r\n\r\ndef calc_distance(endpointA, endpointB):\r\n return math.sqrt((endpointA[0] - endpointB[0])**2 +\r\n (endpointA[1] - endpointB[1])**2)\r\n\r\n\r\ncurrent_endpoint = []\r\nsignature_length = 0\r\nnumber_of_signature_endpoints, papers_signed = map(int, input().split())\r\n\r\nfor index, _ in enumerate(range(number_of_signature_endpoints)):\r\n last_endpoint = current_endpoint\r\n current_endpoint = list(map(int, input().split()))\r\n\r\n if index >= 1:\r\n signature_length += calc_distance(last_endpoint, current_endpoint)\r\n\r\ntime_wasted_in_seconds = (signature_length / 50) * papers_signed\r\nprint(time_wasted_in_seconds)\r\n", "def miis():\r\n return map(int, input().split())\r\n\r\nn, k = miis()\r\nx, y = miis()\r\nans = 0\r\nfor i in range(n-1):\r\n xx, yy = miis()\r\n ans+=((x-xx)**2+(y-yy)**2)**0.5\r\n x, y = xx, yy\r\nprint(ans/50*k)\r\n" ]

[ "n=int(input())\r\nfor i in range(n):\r\n print(i+n*10,end=\" \")\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn = int(input())\r\nfor i in range(10 ** 7 - n + 1, 10 ** 7 + 1):\r\n print(i, end = ' ')", "import math as mt\r\nfrom collections import defaultdict,deque\r\nfrom bisect import bisect_left as b_l\r\nfrom bisect import bisect_right as b_r\r\nimport sys\r\n\r\n\r\nIMx=sys.maxsize\r\nIMn=-sys.maxsize-1\r\n\r\n\r\nn=int(input())\r\nfor i in range(n):\r\n print(3*n+i,end=\" \")\r\nprint()", "n=int(input())\r\nprint(*range(n, 2*n))", "import math\r\ndef primes_upto(n):\r\n if n<=2:\r\n return []\r\n primes=[True]*n\r\n primes[0]=False\r\n primes[1]=False\r\n for i in range(2,int(math.sqrt(n))):\r\n if primes[i]==True:\r\n for j in range(i*i, n, i):\r\n primes[j]=False\r\n return [k for k in range(n) if primes[k]]\r\nl=primes_upto(2000000)\r\nn=int(input())\r\nans=[]\r\nfor j in range(n):\r\n ans.append(l[j])\r\nprint(*ans) ", "# I need to output n co-primes, I think the best way to achieve it is to simply output all primes\n# to find all primes I need to use Sieve algorithm\n# I am not exactly looking for co-primes, I just need them to be not divisible by each other, \n# that simplifies the proccess, because coming up wiht 10**5 primes wiht 10**7 constrain is impossible\n# when I pick small primes, I cut off a lot of possibilities, that would not be cut off otherwise\n# I need to create some kind of seed, smallest numberthat would cover 2*10**5 any time\n# if I start from 10**5 I will have 10 ** 5 space of non repetive elements\n# if n < 10, then 10 - 19 will be a good sequence\n# if n < 100, then 100 - 199 will be a good sequence\n# if n < 1000, then 1000 - 1999\n# whatever my number is, I need to multiple it by 10 and divide it by first first int\nimport math\nn = int(input())\n\nbase = n\nfirst = int(n / math.pow(10, int(math.log10(n))))\nbase *= 10\nbase //= first \nprint(*range(base, base+n))\n\n", "def sieve_of_atkin(limit):\r\n is_prime = [False] * (limit + 1)\r\n sqrt_limit = int(limit ** 0.5)\r\n\r\n for x in range(1, sqrt_limit + 1):\r\n for y in range(1, sqrt_limit + 1):\r\n n = 4 * x ** 2 + y ** 2\r\n if n <= limit and (n % 12 == 1 or n % 12 == 5):\r\n is_prime[n] = not is_prime[n]\r\n\r\n n = 3 * x ** 2 + y ** 2\r\n if n <= limit and n % 12 == 7:\r\n is_prime[n] = not is_prime[n]\r\n\r\n n = 3 * x ** 2 - y ** 2\r\n if x > y and n <= limit and n % 12 == 11:\r\n is_prime[n] = not is_prime[n]\r\n\r\n primes = [2, 3]\r\n for x in range(5, sqrt_limit + 1):\r\n if is_prime[x]:\r\n for y in range(x ** 2, limit + 1, x ** 2):\r\n is_prime[y] = False\r\n for num in range(5, limit + 1):\r\n if is_prime[num]:\r\n primes.append(num)\r\n return primes\r\n\r\n\r\ndef generate_hungry_sequence(n):\r\n hungry_sequence = []\r\n num = 2\r\n while len(hungry_sequence) < n:\r\n is_prime = True\r\n sqrt_num = int(num ** 0.5)\r\n for prime in hungry_sequence:\r\n if prime > sqrt_num:\r\n break\r\n if num % prime == 0:\r\n is_prime = False\r\n break\r\n if is_prime:\r\n hungry_sequence.append(num)\r\n num += 1\r\n return hungry_sequence\r\n\r\n\r\n# Generate a Hungry sequence with 100,000 elements\r\nn = int(input())\r\nhungry_sequence = generate_hungry_sequence(n)\r\n\r\n# Output in smaller batches\r\nbatch_size = 1000\r\nfor i in range(0, len(hungry_sequence), batch_size):\r\n print(\" \".join(str(num) for num in hungry_sequence[i:i + batch_size]))\r\n", "n=int(input())\r\nw=[10**6+i for i in range(n)]\r\nprint(\" \".join([str(k) for k in w]))", "n = int(input())\r\nprint(*[i for i in range (2*n, 3*n)])", "n=int(input())\r\nfor i in range(100000,100000+n):\r\n print(i,end=\" \")", "def solve():\r\n n=int(input())\r\n for i in range(n):\r\n if i!=n-1:\r\n print(n+i+1,end=\" \")\r\n else:\r\n print(n+i+1)\r\ndef main():\r\n solve()\r\nif __name__==\"__main__\":\r\n main()", "import math\r\nn=int(input())\r\nlim=10000000\r\nl=[]\r\nfor i in range(lim-n,lim):\r\n l.append(str(i))\r\nres=\" \".join(l)\r\nprint(res)\r\n", "n = int(input())\r\n\r\nfor i in range(0, n):\r\n print(3*n + i, end= ' ')\r\n\r\n", "n=int(input())\r\nans=[]\r\nn3=n*3\r\nfor i in range(n):\r\n ans+=[str(n3+i)]\r\nprint(' '.join(ans))", "a = int(input())\nprint((*range(a,a+a)))\n\t\t\t \t\t\t \t\t\t \t\t\t \t\t \t\t", "top = 10**7\r\n\r\nres = []\r\nn = int(input())\r\n\r\nfor _ in range(n):\r\n res.append(top)\r\n top -= 1\r\n\r\nres.reverse()\r\n\r\nprint(' '.join([str(k) for k in res]))", "import sys\r\ninput=sys.stdin.readline\r\nn=int(input())\r\np=3*n\r\nfor i in range(n):\r\n print(p+i,end=' ')\r\n", "n = int(input())\r\n\r\n\r\ndef prime_sieve(n):\r\n \"\"\"returns a sieve of primes >= 5 and < n\"\"\"\r\n flag = n % 6 == 2\r\n sieve = bytearray((n // 3 + flag >> 3) + 1)\r\n for i in range(1, int(n**0.5) // 3 + 1):\r\n if not (sieve[i >> 3] >> (i & 7)) & 1:\r\n k = (3 * i + 1) | 1\r\n for j in range(k * k // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n for j in range(k * (k - 2 * (i & 1) + 4) // 3, n // 3 + flag, 2 * k):\r\n sieve[j >> 3] |= 1 << (j & 7)\r\n return sieve\r\n\r\n\r\ndef prime_list(n):\r\n \"\"\"returns a list of primes <= n\"\"\"\r\n res = []\r\n if n > 1:\r\n res.append(2)\r\n if n > 2:\r\n res.append(3)\r\n if n > 4:\r\n sieve = prime_sieve(n + 1)\r\n res.extend(3 * i + 1 | 1 for i in range(1, (n + 1) // 3 + (n % 6 == 1)) if not (sieve[i >> 3] >> (i & 7)) & 1)\r\n return res\r\n\r\nl = prime_list(1300000)\r\nprint(*l[:n])\r\n", "def Hungry_Sequence2():\r\n n = int(input())\r\n\r\n print(' '.join(str(i) for i in range(n, n + n)))\r\n\r\nHungry_Sequence2()", "n = int(input())\r\nele = 1000000\r\nans =\"\"\r\n\r\nfor i in range(n):\r\n ele +=1 \r\n print(ele,end=\" \")", "n=int(input())\r\narr=[]\r\ncount=1\r\n \r\nwhile count<=n:\r\n\tarr.append(n+count)\r\n \r\n\tcount+=1\r\nprint(*arr)", "c = 0\r\nn = int(input())\r\nfor i in range(n):\r\n \r\n print(n+i+1 , end = \" \")\r\n c += 1\r\n ", "n= int(input())\r\n\r\nfor i in range(n+1,2*n+1):\r\n print(i,end=\" \")", "import sys\nn=int(input())\nsys.stdout.write(str(n))\na=n+1\nb=n*2\nfor idx in range(a, b):\n sys.stdout.write(\" \" + str(idx))\n \t\t \t \t\t\t\t \t\t\t\t\t \t \t \t\t \t\t\t\t", "def sieve(MAXP):\r\n primes = [2]\r\n sieve = [0] * ((MAXP) // 2)\r\n for i in range(1, MAXP // 2):\r\n if not sieve[i]:\r\n p = 2 * i + 1\r\n primes.append(p)\r\n cur = p\r\n ind = i\r\n tp = p * 2\r\n while cur < MAXP:\r\n sieve[ind] = 1\r\n ind += p\r\n cur += tp\r\n return primes\r\n\r\n\r\nprimes = sieve(1300000)\r\n\r\n\r\nn = int(input())\r\nprint(*primes[:n])\r\n", "n=int(input())\r\nfor i in range(n,2*n):\r\n print(i,end=\" \")", "n = int(input())\r\nprint(*range(n, n * 2))", "def main():\r\n n = get_int()\r\n\r\n for i in range(n + 1, 2 * n + 1):\r\n print(i, end=\" \" if i != 2 * n else \"\\n\")\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nans=100001\r\nfor i in range(n):\r\n print(ans,end=' ')\r\n ans+=1\r\n", "import sys\r\nn = int(input())\r\nsys.stdout.write(str(n))\r\nfor i in range(n+1, n*2):\r\n sys.stdout.write(\" \" + str(i))", "n = int(input())\r\nprint(str(n))\r\nfor i in range(n+1, n*2):\r\n print(\" \" + str(i))", "n=int(input())\r\nfor i in range(10**5,10**5+n):\r\n print(i,end=\" \")\r\nprint()\r\n", "n=int(input())\r\ni=1\r\nj=100000\r\nwhile i<=n:\r\n if i==1:\r\n print(100000,end=\"\")\r\n else :\r\n print(\"\",j,end=\"\")\r\n j+=1\r\n i+=1", "for i in range(10**6,10**6+int(input())):\r\n print(i,end=' ')", "n = int(input())\r\n\r\n\r\nresult = [10 ** 6]\r\n\r\nwhile len(result) < n:\r\n result.append(result[-1] + 1)\r\n\r\nfor num in result:\r\n print(num, end=' ')\r\nprint()\r\n", "n = int(input())\r\nt = n*4\r\ni = t-1\r\narr = []\r\nwhile n != 0:\r\n if t % i != 0:\r\n # print(i, end=\" \")\r\n arr.append(i)\r\n n -= 1\r\n i -= 1\r\narr.reverse()\r\n[print(i, end=\" \") for i in arr]\r\nprint()\r\n", "for i in range(int(input())):\r\n print(10**5+i)", "n = int(input())\r\nprint(*range(n * 3, n * 4))", "import sys\r\ninput=sys.stdin.readline\r\nimport math\r\nimport bisect\r\n# l=[1, 2, 4, 8, 16, 32]\r\n# print(bisect.bisect_left(l,10))\r\n#print(40960%32768)\r\n\r\nn=int(input())\r\nfor i in range(n,2*n):\r\n print(i,end=\" \")\r\n\r\n \r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "t = int(input())\r\nfor i in range(t):\r\n print(900000+i,end=\" \")", "n=int(input())\r\n # n,k=map(int,input().split()) \r\n # s=(input()) \r\nfor i in range(n,2*n):\r\n print(i,end=\" \")", "n = int(input())\r\nprint(*range(n * 2, n * 3))", "import math \r\nn=int(input())\r\ni = 3*n\r\nfor k in range(n):\r\n print(i+k,end=\" \")", "def hungry_sequence():\r\n sequence_length = int(input())\r\n sequence = []\r\n for i in range(sequence_length):\r\n sequence.append(3 * sequence_length + i)\r\n print(\" \".join(list(map(str, sequence))))\r\n\r\n\r\nhungry_sequence()", "print(*[i for i in range(10**7-int(input())+1,10**7+1)])", "n = int(input())\r\nfor i in range(n, 2*n):\r\n print(i, end=' ')", "\n# takes an integer n\n# returns the list of primes <= n\ndef sieve(n):\n\tisprime = [True for i in range(n+1)]\n\tisprime[0] = isprime[1] = False\n\tprimes = []\n\t\n\tfor i in range(n+1):\n\t\tif not isprime[i]:\n\t\t\tcontinue\n\n\t\tprimes.append(str(i))\n\t\tfor multiple in range(i*i, n+1, i):\n\t\t\tisprime[multiple] = False\n\n\treturn primes\n\n\n\nn = int(input())\nx = sieve(min(n*25, 1300000))\nprint(\" \".join(x[:n]))\n", "n = int(input())\r\nprint(n, end=\" \")\r\nfor i in range(n + 1, n * 2):\r\n print(i, end=\" \")\r\n", "n = int(input())\r\ncount = 0\r\ni=1\r\nwhile(count<n):\r\n print(n+i)\r\n count+=1\r\n i+=1", "n = int(input())\r\nprint(*range(n,2*n))", "import math\r\n\r\ndef generate_primes(n):\r\n \"\"\"\r\n Returns a list of the first n prime numbers.\r\n \"\"\"\r\n if n < 1:\r\n return []\r\n \r\n primes = [2]\r\n num = 3\r\n while len(primes) < n:\r\n is_prime = True\r\n for prime in primes:\r\n if prime > math.sqrt(num):\r\n break\r\n if num % prime == 0:\r\n is_prime = False\r\n break\r\n if is_prime:\r\n primes.append(num)\r\n num += 2\r\n \r\n return primes\r\n\r\nn =int(input()) # change this to generate the first n prime numbers\r\nprimes = generate_primes(n)\r\nfor i in primes:\r\n print(i,end=' ')\r\n# print(primes)\r\n\r\n", "n=int(input())\r\nstart=3*n\r\nfor i in range(n):\r\n print(start+i,end=\" \")\r\n", "def solve(n):\r\n start = int(3e6)\r\n result = []\r\n for i in range(n):\r\n result.append(start + i)\r\n i += 1\r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n maxNumbers = int(input())\r\n result = solve(maxNumbers)\r\n result = list(map(str, result))\r\n print(\" \".join(result))", "import sys\r\nimport math\r\nfrom functools import reduce\r\n\r\n\r\nn = int(input())\r\n\r\nans = []\r\nfor i in range(n + 1, 2 * n + 1):\r\n\tans.append(i)\r\nprint(*ans)", "n = int(input())\r\nfor x in range(n) : print(n+x,end = ' ')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nfor i in range(100001, 100001+2*n,2):\r\n print(i, end=' ')", "n = int(input())\r\nprint(*range(n, n*2))\r\n", "n = int(input())\nx = 1000000\nfor i in range(n):\n print(x)\n x+=1\n", "n=int(input())\r\n\r\nnum=10**5\r\n\r\nres=\"\"\r\nfor i in range(n):\r\n res+=str(i+num)+\" \"\r\nprint(res)", "n= int(input())\r\nfor i in range(n) : print(8999999 + i, end = ' ')", "i = int(input())\r\nfor n in range(1,i+1):\r\n print(str(3000000+n),end=\"\")\r\n if(n!=i):\r\n print(' ',end=\"\")\r\n", "n=int(input().strip())\r\nq=[]\r\ncur=10**6\r\nfor i in range(n):\r\n q.append(cur)\r\n cur+=1\r\nprint(*q)", "def genPrimes(lim: int):\r\n primes = [2]\r\n for i in range(3, lim ** 2, 2):\r\n is_prime = True\r\n for p in primes:\r\n if i % p == 0:\r\n is_prime = False\r\n break\r\n if is_prime:\r\n primes.append(i)\r\n if len(primes) == lim:\r\n break\r\n return primes\r\n\r\n\r\ndef solve(N: int):\r\n p_cap = 87*2 + 1 # ceil(3rd_root(6N) + 2) = 87\r\n P = genPrimes(p_cap)\r\n res = []\r\n r_len = 0\r\n for i in range(p_cap - 2):\r\n for j in range(i+1, p_cap - 1):\r\n for k in range(j+1, p_cap):\r\n v = P[i]*P[j]*P[k]\r\n if v < 10 ** 7:\r\n res.append(v)\r\n r_len += 1\r\n if r_len == N:\r\n break\r\n if r_len == N:\r\n break\r\n if r_len == N:\r\n break\r\n res.sort()\r\n return res\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n print(' '.join([str(_) for _ in solve(n)]))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nimport sys\r\ninput=sys.stdin.readline\r\nmod=10000000\r\n\r\ndef isPrime(n):\r\n\r\n if n <= 1:\r\n return False\r\n \r\n if n == 2 or n == 3:\r\n return True\r\n \r\n if n % 2 == 0 or n % 3 == 0:\r\n return False\r\n \r\n i = 5\r\n while i * i <= n:\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n i += 6\r\n\r\n return True\r\ndef main():\r\n n=int(input())\r\n ans=[2]\r\n ind=3\r\n while len(ans)<n:\r\n if isPrime(ind):\r\n ans.append(ind)\r\n ind+=2\r\n print(*ans)\r\n# for _ in range(int(input())):\r\nmain()", "n=int(input())\r\ne=100001\r\nfor i in range(n):\r\n print(e,end=\" \")\r\n e+=1", "n=int(input())\r\nfor i in range(n):\r\n if i!=n-1:\r\n print(n+i+1,end=\" \")\r\n else:\r\n print(n+i+1)", "n = int(input())\r\ns=\"\"\r\ni=n\r\nfor i in range(n,2*n):\r\n s+=str(i)+\" \"\r\nprint(s)\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "def main():\r\n n = int(input())\r\n for i in range(n):\r\n print(i + n, end=' ')\r\nmain()", "n = int(input())\r\nfor ctr in range(n):\r\n print(ctr+n, end=\" \")", "n=int(input())\r\no=10**5\r\nfor i in range(n):\r\n print(o+i,end=\" \")", "import sys\nn = int(input())\nsys.stdout.write(str(n))\nfor i in range(n+1, n*2):\n sys.stdout.write(\" \" + str(i))\n#\n\t \t\t \t\t \t\t \t \t\t\t \t\t \t \t", "n=int(input())\r\noutput=[n+i for i in range(n)]\r\nout=\" \".join(list(map(str,output)))\r\nprint(out)", "\r\nn = int(input())\r\n\r\n#n prime numbers\r\n \r\n# Don't know why but it gives WA on tc 5\r\n\r\n# num = 10**5\r\n# check = [True] * (num+1)\r\n\r\n# check[0], check[1] = False, False\r\n\r\n# for i in range(2, num+1):\r\n# if check[i] and i*i <= num:\r\n# for j in range(i*i, num+1, i):\r\n# check[j] = False\r\n\r\n# cnt = 0\r\n# a = []\r\n# for i,v in enumerate(check):\r\n# if v:\r\n# cnt += 1\r\n# a.append(str(i))\r\n# if cnt == n:\r\n# break\r\n\r\n# print(\" \".join(a))\r\n\r\n\r\n#Solution 2\r\n# for big enough numbers, the consecutive numbers are itself hungry\r\nnum = 10**7\r\nstart = num - n + 1\r\nend = num\r\nans = \"\"\r\nwhile start <= end:\r\n ans += str(start) + \" \"\r\n start += 1\r\n\r\nprint(ans)", "n=int(input())\r\n\r\nif n==1:\r\n print(n)\r\nelif n==2:\r\n print(2,3)\r\nelse:\r\n j=n\r\n count=0\r\n \r\n while(count<n):\r\n print(j,end=\" \")\r\n if j%2==0:\r\n j+=1\r\n else:\r\n j+=2\r\n count+=1\r\n print() \r\n", "n = int(input())\r\nk = n + 1\r\nprint(\" \".join(str(k+x) for x in range(n)))", "import math\r\n\r\nl = int(math.sqrt(int(1e7))) + 5\r\nr = l + int(1e5) + 1\r\nret = [r + i for i in range(l, r)]\r\n\r\nn = int(input())\r\nprint(*ret[:n])", "n=int(input())\r\ntw=2*n\r\nwhile(n<tw):\r\n print(n,end=\" \")\r\n n+=1\r\n \r\n ", "number = int(input())\r\nnum_list = list()\r\nnew_number = number * 2\r\nanswer = ''\r\nfor i in range(number+1, new_number+1):\r\n print(i, end=' ')", "x=10000000-1\r\n\r\nn=int(input())\r\n\r\na=x-n\r\n\r\nfor i in range(n):\r\n print(a+i,end=\" \")", "n=int(input())\r\nA=[]\r\nfor i in range(n,2*n):\r\n A.append(i)\r\nprint(*A)", "n=int(input())\r\nt=n \r\nfor i in range(t):\r\n print(n,end=\" \")\r\n n+=1\r\n\r\nprint()", "n=int(input())\r\ns=n+1\r\nt=[]\r\nfor i in range(n):\r\n t.append(s)\r\n s+=1\r\nprint(*t)", "value = int(input())\r\nx = 10**6\r\nz = []\r\n\r\nfor i in range(value):\r\n z.append(str(x))\r\n x += 1\r\n\r\nprint(\" \".join(z))", "n=int(input())\r\ni=0\r\np=n\r\nl=3*n\r\nwhile p:\r\n print(l+i,end=\" \")\r\n i+=1\r\n p-=1", "if __name__ == '__main__':\r\n n = int(input())\r\n for i in range(n):\r\n print(n*3+i, end=\" \")" ]

[ "n=int(input())\r\na=list(map(int,input().split()))\r\nans=-1\r\nfor i in range(n-1):\r\n if a[i]>a[i+1]: ans=i\r\nprint(ans+1)\r\n\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = n-1\r\nwhile ans>0 and l[ans-1]<l[ans]:\r\n\tans-=1\r\nprint(ans)\r\n", "n = (int)(input())\r\na = (list)(map(int , input().split()))\r\nfor _ in range(n - 1 , -1 , -1) :\r\n if _ > 0 and a[_] < a[_ - 1] :\r\n print(_)\r\n quit()\r\nprint(0)", "from collections import defaultdict, Counter\nfrom math import inf\nfrom functools import lru_cache\nfrom heapq import heappop, heappush\n\nimport sys\n#input=sys.stdin.readline\n\n# n = int(input())\n# arr = list(map(int, input().split()))\ndef solution(): \n n = int(input())\n arr = list(map(int, input().split()))\n\n # go as long as dicreasing\n ptr = len(arr) - 2\n while ptr >= 0:\n if arr[ptr] < arr[ptr+1]:\n ptr -= 1\n else:\n break\n\n return print(ptr + 1)\n\n\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\n\n#import sys\n#import threading\n#sys.setrecursionlimit(10**6)\n#threading.stack_size(1 << 27)\n#thread = threading.Thread(target=main)\n#thread.start(); thread.join()\nmain()\n\n", "n = int(input())\nthreads = list(map(int, input().split(\" \")))\n\nchanges = 0\n\nfor i in range(0, n-1):\n if(threads[i] > threads[i+1]):\n changes = i+1\n\nprint(changes)\n\t \t \t\t \t \t \t \t \t\t \t \t \t \t", "n=int(input())\r\nt=list(map(int,input().split()))\r\ni=n-1\r\nwhile t[i]>t[i-1]:i-=1\r\nprint(i)", "n = int(input())\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(n-1, 0, -1):\r\n if a[i] < a[i-1]:\r\n break\r\n else:\r\n ans += 1\r\nprint(n-ans-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\nd = 0\r\nfor i in range(n-1, 0, -1):\r\n if w[i] < w[i-1]:\r\n d = i\r\n break\r\nprint(d)\r\n" ]

[ "import sys\n\nn, m = map(int, input().split())\na = [input() for _ in range(n)]\n\nmin_i, min_j = n, m\nmax_i, max_j = 0, 0\n\nfor i in range(n):\n for j in range(m):\n if a[i][j] == 'X':\n min_i, min_j = min(min_i, i), min(min_j, j)\n max_i, max_j = max(max_i, i), max(max_j, j)\n\nfor i in range(min_i, max_i + 1):\n for j in range(min_j, max_j + 1):\n if a[i][j] != 'X':\n print(\"NO\")\n sys.exit(0)\n\nprint(\"YES\")\n", "n, m = map(int, input().split())\r\n\r\nboard = list()\r\n\r\nfor i in range(n):\r\n\tboard.append(input())\r\n\r\nx1, x2, y1, y2 = n, 0, m, 0\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif board[i][j] == 'X':\r\n\t\t\tx1 = min(x1, i)\r\n\t\t\tx2 = max(x2, i)\r\n\t\t\ty1 = min(y1, j)\r\n\t\t\ty2 = max(y2, j)\r\n\r\ncan = True\r\n\r\nfor i in range(x1, x2+1):\r\n\tfor j in range(y1, y2+1):\r\n\t\tif board[i][j] != 'X':\r\n\t\t\tcan = False\r\n\r\nprint(\"YES\" if can else \"NO\")", "ds = [int(v) for v in input().split(' ')]\nvs = []\nc = 'X'\nl, r = None, None\nt, b = None, None\nfor y in range(ds[0]):\n vs += [input()]\n if c in vs[y]:\n t = y if t is None else t\n b = y\n cl, cr = vs[y].find(c), vs[y].rfind(c)\n l = min((l or cl), cl)\n r = max((r or cr), cr)\n\nfor y in range(ds[0]):\n for x in range(ds[1]):\n if l <= x <= r and t <= y <= b:\n if vs[y][x] != c:\n print('NO')\n exit()\n else:\n if vs[y][x] == c:\n print('NO')\n exit()\n\nprint('YES')\n", "class End:\n def __bool__(self):\n return False\n\ndef calculate(data, x, y):\n key = False\n key_first = True\n for line in data:\n if \"X\" in line:\n if key == False:\n key = True\n if key_first:\n start = line.find(\"X\")\n end = line.rfind(\"X\")\n count = line.count(\"X\")\n if key == End:\n return \"NO\"\n else:\n if key == False:\n pass\n if key == True:\n key = End\n if key == False:\n return \"NO\"\n else:\n for line in data:\n if \"X\" in line:\n _start = line.find(\"X\")\n _end = line.rfind(\"X\")\n _count = line.count(\"X\")\n if start != _start:\n return \"NO\"\n elif end != _end:\n return \"NO\"\n elif count != _count:\n return \"NO\"\n return \"YES\"\n\nif __name__ == \"__main__\":\n xy = list(map(int, input().split()))\n x = xy[1]\n y = xy[0]\n\n data = list(map(str, [input() for i in range(y)]))\n\n print(calculate(data, x, y))\n", "import sys\r\n\r\nn,m = map(int,input().split())\r\ncnt = 0\r\nr = c = 500\r\nr1 = c1 = 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == 'X':\r\n cnt += 1\r\n if i < r:\r\n '''row start'''\r\n r = i\r\n if i > r1:\r\n '''row end'''\r\n r1 = i\r\n if j < c:\r\n '''col start'''\r\n c = j\r\n if j > c1:\r\n '''col end'''\r\n c1 = j\r\n\r\nif (r1 - r + 1)* (c1 - c + 1) == cnt:\r\n print('YES')\r\nelse:\r\n print('NO')\r\n\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\npuzz = []\nfor _ in range(n):\n puzz.append([1 if x == 'X' else 0 for x in input()])\nhor, ver = set(), set()\nfor i, l in enumerate(puzz):\n for j, quad in enumerate(l):\n if quad:\n hor.add(i)\n ver.add(j)\nans = True\nfor i in hor:\n for j in ver:\n if not puzz[i][j]:\n ans = False\n break\nprint('YES' if ans else 'NO')\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nminx = m\r\nminy = n\r\nmaxx = -1\r\nmaxy = -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'X':\r\n if i > maxy:\r\n maxy = i\r\n if i < miny:\r\n miny = i\r\n if j > maxx:\r\n maxx = j\r\n if j < minx:\r\n minx = j\r\nfor i in range(miny, maxy+1):\r\n for j in range(minx, maxx+1):\r\n if a[i][j] != 'X':\r\n print('NO')\r\n break\r\n if a[i][j] != 'X':\r\n break\r\nelse:\r\n print('YES')", "\r\ndef f():\r\n n, m = map(int, input().split())\r\n p = [input() for _ in range(n)]\r\n c = 0\r\n t = 0\r\n for i in range(n):\r\n for j in range(m):\r\n if p[i][j] == 'X':\r\n c += 1\r\n xc = 0\r\n if t > 0:\r\n continue\r\n t = 0\r\n for k in range(j, m):\r\n if p[i][k] != 'X':\r\n break\r\n xc += 1\r\n t += 1\r\n for y in range(i + 1, n):\r\n if p[y][j] != 'X':\r\n break\r\n xtc = 0\r\n for k in range(j, m):\r\n if p[y][k] != 'X':\r\n break\r\n xtc += 1\r\n t += 1\r\n if xc != xtc:\r\n return False\r\n return c == t\r\n\r\n \r\nprint('YES' if f() else 'NO')", "n , m = map(int,input().split())\r\nls = list()\r\ndx = [0]*n \r\ndy = [0]*m\r\nfor i in range(n):\r\n ls.append(input())\r\n for j in range(len(ls[i])):\r\n if ls[i][j] != '.' :\r\n dx[i] +=1\r\n dy[j] +=1\r\nans1 = set()\r\nans2 = set()\r\nfor i in range(n):\r\n if dx[i] :\r\n ans1.add(dx[i])\r\nfor i in range(m):\r\n if dy[i] :\r\n ans2.add(dy[i])\r\n#print(ans1 , ans2)\r\nif len(ans1) == 1 and len(ans2) == 1:\r\n print(\"YES\")\r\nelse :\r\n print(\"NO\")\r\n \r\n", "n, m = map(int, input().split())\r\na = [input() for i in range(n)]\r\nx1, y1, x2, y2 = 100000, 100000, -1, -1\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == \"X\":\r\n x1, y1 = min(j, x1), min(i, y1)\r\n x2, y2 = max(j, x2), max(i, y2)\r\nf = True\r\nfor i in range(y1, y2 + 1):\r\n for j in range(x1, x2 + 1):\r\n if a[i][j] != \"X\":\r\n f = False\r\nif (not f) or ((x2 - x2) % m and (y2 - y1) % n):\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n,m = map(int,input().split())\r\npuz = []\r\nfor x in range(n):\r\n puz.append(input())\r\nmix = 502\r\nmiy = 502\r\nmx = -1\r\nmy = -1\r\nnumx = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if(puz[i][j] == \"X\"):\r\n miy = min(miy,i)\r\n my = max(my,i)\r\n mix = min(mix,j)\r\n mx = max(mx,j)\r\n numx = numx + 1\r\nif((mx - mix + 1) * (my - miy + 1) == numx):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "x=input().split()\r\nn=[]\r\nfor i in range(int(x[0])):\r\n n.append(input())\r\n\"\"\"t=0\r\nj=0\r\nk=0\"\"\"\r\nimport sys\r\n\"\"\"print(\"lol\")\r\nwhile(j==0):\r\n if \"X\" in n[k]:\r\n if(t==0):\r\n t=k\r\n else:\r\n if(t!=0):\r\n j=k\r\n k+=1\r\n if(k>=x[1]):\r\n if(t>0):\r\n j=x[1]-1\r\n else:\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"lol\")\r\nif(j==0):\r\n print(\"NO\")\r\nelse:\r\n for i in range(t,j+1):\r\n if(n[t]==n[i]):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\"\"\"\r\nfor i in range(len(n)):\r\n for j in range(len(n[i])) :\r\n if n[i][j] == \"X\":\r\n q_stop = i\r\n break\r\nfor i in range(len(n)-1,-1,-1):\r\n for j in range(len(n[i])):\r\n if n[i][j] == \"X\" :\r\n q_start = i\r\n break\r\na = n[q_start]\r\nfor i in range(q_start+1,q_stop+1):\r\n if n[i] == a :\r\n continue\r\n else :\r\n print(\"NO\")\r\n sys.exit()\r\nprint(\"YES\")\r\n", "def f():\n s=input().split()\n m=int(s[0])\n n=int(s[1])\n ss=[]\n for i in range(m):\n ss.append(input())\n for i in range(m):\n for j in range(n):\n if ss[i][j]=='X':\n return (ss,m,n,i,j)\n\ndef ff(ss,m,n):\n for k in range(m-1,-1,-1):\n for l in range(n-1,-1,-1):\n if ss[k][l]=='X':\n return (k,l)\n\nss,m,n,i,j=f()\nk,l=ff(ss,m,n)\nsss=[]\nfor x in range(m):\n s=\"\"\n for y in range(n):\n if (i<=x and x<=k and j<=y and y<=l):\n s+=\"X\"\n else:\n s+=\".\"\n sss.append(s)\nif(ss==sss):\n print(\"YES\")\nelse:\n print(\"NO\")\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\ninf = pow(10, 9) + 1\r\nlx, ly, rx, ry = inf, inf, -inf, -inf\r\nc = 0\r\nfor i in range(n):\r\n s = list(input().rstrip())\r\n for j in range(m):\r\n if not s[j] & 2:\r\n lx, ly = min(lx, i), min(ly, j)\r\n rx, ry = max(rx, i), max(ry, j)\r\n c += 1\r\nans = \"YES\" if (rx - lx + 1) * (ry - ly + 1) == c else \"NO\"\r\nprint(ans)", "n, m = map(int, input().split())\nempthy = '.' * m\nlast = ''\nmistake = False\n\nfor i in range(n):\n s = input()\n if s != empthy:\n if last == '':\n last = s\n else:\n if last != s:\n mistake = True\n break\n\nif mistake:\n print('NO')\nelse:\n print('YES')\n ", "n, m = [int(i) for i in input().split()]\r\nfield = []\r\nfor i in range(n):\r\n field.append(input().strip())\r\nst_i = -1\r\nst_j = -1\r\nen_i = -1\r\nen_j = -1\r\nresult = \"YES\"\r\ntop_left_found = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if not top_left_found and field[i][j] == 'X':\r\n top_left_found = True\r\n st_i = i\r\n st_j = j\r\n for k in range(i, n):\r\n if not 'X' in field[k] and en_i == -1:\r\n en_i = k - 1;\r\n if en_i == -1:\r\n en_i = n - 1\r\n elif top_left_found:\r\n if i != st_i and en_j == -1:\r\n en_j = m - 1;\r\n if field[i][j] == '.' and i == st_i and en_j == -1:\r\n en_j = j - 1;\r\n elif en_j != -1 and field[i][j] == 'X' and ((j < st_j) or (j > en_j) or (i < st_i) or (i > en_i)):\r\n result = \"NO\"\r\n elif en_j != -1 and field[i][j] == '.' and ((st_j <= j <= en_j) and (st_i <= i <= en_i)):\r\n result = \"NO\" \r\nprint(result)", "n,m=map(int, input().split())\r\nflag=False\r\ns1=''\r\nfor i in range(n):\r\n s=input()\r\n if s.find('X')>-1:\r\n if s1=='':\r\n s1=s\r\n flag=True\r\n elif s1==s:\r\n flag=True\r\n else:\r\n flag=False\r\n break\r\nif flag:\r\n print('YES')\r\nelse:\r\n print('NO')", "class MatrixCalculator:\r\n def calculate(self, x, y, rows):\r\n first_occurrence = True\r\n empty_after_x_row = False\r\n leftest_x = 0\r\n rightest_x = 0\r\n x_count = 0\r\n for row in rows:\r\n if 'X' in row:\r\n if empty_after_x_row:\r\n return \"NO\" # row with x is after empty row that was after non-empty row - non-solid area\r\n\r\n first_x = row.find(\"X\")\r\n last_x = row.rfind(\"X\")\r\n\r\n if first_occurrence:\r\n leftest_x = first_x\r\n rightest_x = last_x\r\n x_count = row.count(\"X\")\r\n first_occurrence = False\r\n else:\r\n if first_x != leftest_x or last_x != rightest_x or row.count(\"X\") != x_count:\r\n return \"NO\"\r\n\r\n elif not first_occurrence: # non-first empty string\r\n empty_after_x_row = True\r\n return \"YES\"\r\n\r\n\r\nif __name__ == \"__main__\":\r\n (x, y) = map(int, input().split())\r\n lines = []\r\n for i in range(0, x):\r\n lines.append(input())\r\n calculator = MatrixCalculator()\r\n print (calculator.calculate(x, y, lines))", "n, m = map(int, input().split())\r\ns = set(input() for i in range(n))\r\ns.discard('.' * m)\r\nprint('YES' if len(s) == 1 else 'NO')", "m, n=[int(i) for i in input().split()]\r\nstarted=False\r\nfailed=False\r\nfinished=False\r\nt=[-5, -5]\r\nblank=\".\"*n\r\nfor i in range(m):\r\n s=input()\r\n # print(t, finished, started, failed, s)\r\n if \"X\" in s:\r\n if finished:\r\n failed=True\r\n break\r\n if not started:\r\n started=True\r\n first=False\r\n second=False\r\n for j in range(len(s)):\r\n if first:\r\n if s[j]!=\"X\":\r\n second=True\r\n t[1]=j\r\n break\r\n else:\r\n if s[j]==\"X\":\r\n first=True\r\n t[0]=j\r\n if not second:\r\n t[1]=len(s)\r\n #print(s, \".\"*t[0]+\"X\"*(t[1]-t[0])+\".\"*(n-t[1]))\r\n if s!=\".\"*t[0]+\"X\"*(t[1]-t[0])+\".\"*(n-t[1]):\r\n failed=True\r\n break\r\n elif started:\r\n finished=True\r\nif failed:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "H, W = map(int, input().split())\r\np = []\r\nfor i in range(H):\r\n p.append(list(input()))\r\n\r\nl = u = +100500\r\nb = r = -100500\r\nfor i in range(H):\r\n for j in range(W):\r\n if p[i][j] == \"X\":\r\n l = min(l, j)\r\n r = max(r, j)\r\n\r\n u = min(u, i)\r\n b = max(b, i)\r\n\r\n\r\nfor i in range(u,b+1):\r\n for j in range(l,r+1):\r\n if p[i][j] == \".\":\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "##n = int(input())\r\n##a = list(map(int, input().split()))\r\n##print(\" \".join(map(str, res)))\r\n\r\n[n, m] = list(map(int, input().split()))\r\np = []\r\nfor i in range(n):\r\n p.append(input())\r\n\r\nminx = 1000\r\nminy = 1000\r\nmaxx = 0\r\nmaxy = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if p[i][j] == 'X':\r\n miny = min(miny, i)\r\n maxy = max(maxy, i)\r\n minx = min(minx, j)\r\n maxx = max(maxx, j)\r\nfor i in range(miny, maxy+1):\r\n for j in range(minx, maxx+1):\r\n if p[i][j] != 'X':\r\n print('NO')\r\n exit(0)\r\nprint('YES')", "n, m = map(int, input().split())\npu = [input() for i in range(n)]\ncors = []\nres = True\nfor string in pu:\n if \"X\" in string:\n if not len(cors):\n cors = string.find(\"X\"), string.rfind(\"X\")\n res = res and string.count(\"X\") == (cors[1] - cors[0] + 1) and string[cors[0]:cors[1] + 1] == \"X\" * (cors[1] - cors[0] + 1)\nif res:\n print(\"YES\")\nelse:\n print(\"NO\")\n", "n, m = map(int, input().split())\r\ngrid = []\r\nfor _ in range(n):\r\n grid.append([c for c in input()])\r\n\r\ntop = n\r\nbot = -1\r\nleft = m\r\nright = -1\r\nfor row in range(n):\r\n for col in range(m):\r\n if grid[row][col] == 'X':\r\n top = min(top, row)\r\n bot = max(row, bot)\r\n left = min(col, left)\r\n right = max(col, right)\r\n\r\nfail = False\r\nfor row in range(top, bot+1):\r\n for col in range(left, right + 1):\r\n if grid[row][col] != 'X':\r\n fail = True\r\nprint('NO' if fail else 'YES')\r\n", "#!/usr/bin/env python3\n\n\ndef main():\n n, m = map(int, input().split())\n\n left = None\n right = None\n\n for _ in range(n):\n line = input().strip()\n cur_l = line.find(\"X\")\n if cur_l != -1:\n if left is None:\n left = cur_l\n else:\n if left != cur_l:\n print(\"NO\")\n return\n cur_r = line.rfind(\"X\")\n if right is None:\n right = cur_r\n else:\n if right != cur_r:\n print(\"NO\")\n return\n if '.' in line[cur_l:cur_r]:\n print(\"NO\")\n return\n print(\"YES\")\n\n\nif __name__ == '__main__':\n main()\n", "t=1\r\nwhile t>0:\r\n t-=1\r\n n,m=(int(_) for _ in input().strip().split(' '))\r\n c=[[0]*505 for _ in range(505)]\r\n h=False\r\n k=True\r\n for i in range(n):\r\n s=input()\r\n for i in range(m):\r\n if s[i]=='X':\r\n if h==False:\r\n h=True\r\n str=s\r\n else:\r\n if s!=str:\r\n k=False\r\n if k==True:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")", "n, m = [int(i) for i in input().split()]\r\np = []\r\nfor i in range(n):\r\n p.append(input())\r\nfx = n + 1\r\nfy = m + 1\r\nlx = -1\r\nly = -1\r\nfor i in range(n):\r\n for q in range(m):\r\n if p[i][q] == 'X':\r\n fx = min(fx, i)\r\n lx = max(lx, i)\r\n fy = min(fy, q)\r\n ly = max(ly, q)\r\nfor i in range(fx, lx + 1):\r\n for q in range(fy, ly + 1):\r\n if p[i][q] == '.':\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")", "n, m=map(int, input().split())\nc, l, r, u, d=0, n, 0, m, 0\nfor i in range(n):\n\ts=input()\n\tfor j in range(m):\n\t\tif s[j]=='X':\n\t\t\tc+=1\n\t\t\tl=min(l, i)\n\t\t\tr=max(r, i)\n\t\t\tu=min(u, j)\n\t\t\td=max(d, j)\nprint('YES' if c==(r-l+1)*(d-u+1) else 'NO')\n", "n,m=map(int,input().split())\r\nl=[list(input()) for _ in range(n)]\r\nmaxx,minx,maxy,miny=-1,n,-1,m\r\ncount=0\r\nfor i in range(n):\r\n for j in range(m):\r\n if l[i][j]=='X':\r\n maxx=max(maxx,i)\r\n minx=min(minx,i)\r\n maxy=max(maxy,j)\r\n miny=min(miny,j)\r\n count+=1\r\nif (maxx-minx+1)*(maxy-miny+1)==count: print(\"YES\")\r\nelse: print(\"NO\")", "def checkrect(a,n1,n2,m1,m2):\r\n for i in range(n1,n2+1):\r\n for j in range(m1,m2+1):\r\n if a[i][j]!=\"X\":\r\n return False\r\n return True\r\n\r\ndef rect(a,n,m):\r\n n1,m1,n2,m2=-1,-1,-1,-1\r\n for i in range(n):\r\n if \"X\" in a[i]: \r\n if n1==-1:\r\n n1=i\r\n n2=i\r\n for i in range(m):\r\n if \"X\" in [a[j][i] for j in range(n)]:\r\n if m1==-1:\r\n m1=i\r\n m2=i\r\n return checkrect(a,n1,n2,m1,m2)\r\n\r\nn,m=(int(z) for z in input().split())\r\na=[]\r\nfor i in range(n):\r\n a.append(input())\r\nff=rect(a,n,m)\r\nif ff:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "n, m = map(int, input().split())\ng = [input() for _ in range(n)]\nr, c = set(), set()\nfor i in range(n):\n for j in range(m):\n if g[i][j] == 'X':\n r.add(i)\n c.add(j)\ng = g[min(r):max(r)+1]\ng = list(map(lambda x: x[min(c): max(c) + 1], g))\n\ngood = True\nfor i in range(len(g)):\n for j in range(len(g[0])):\n if g[i][j] != 'X':\n good = False\n break\nprint('YES' if good else 'NO')\n", "n, m = [int(i) for i in input().split()]\npattern_dict = dict()\npattern_0 = '.'*m\nno_flag = False\nfor i in range(n):\n s = input()\n position = [j for j in range(m) if s[j]=='X']\n if s != pattern_0:\n if s not in pattern_dict:\n pattern_dict[s] = [i]\n else:\n pattern_dict[s].append(i)\n if len(pattern_dict) > 1 or position[-1]-position[0]+1 != len(position):\n no_flag = True\n print(\"NO\")\n break\nif not no_flag:\n for j in pattern_dict:\n s = pattern_dict[j]\n if s[-1]- s[0]+1 != len(s):\n print(\"NO\")\n else:\n print(\"YES\")", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(list(input()))\r\nk = 0\r\nmin_r = n - 1\r\nmax_r = 0\r\nmin_c = m - 1\r\nmax_c = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'X':\r\n k += 1\r\n min_r = min(min_r, i)\r\n max_r = max(max_r, i)\r\n min_c = min(min_c, j)\r\n max_c = max(max_c, j)\r\nif (max_r - min_r + 1) * (max_c - min_c + 1) == k:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\r\ncnt, l, r, u, d = 0, n, 0, m, 0\r\nfor i in range(n):\r\n s = input()\r\n for j in range(m):\r\n if s[j] == 'X':\r\n cnt += 1\r\n l = min(l, i) ; u = min(u, j)\r\n r = max(r, i) ; d = max(d, j)\r\nprint('YES' if cnt == (r-l+1)*(d-u+1) else 'NO')\r\n", "mn = [int(x) for x in input().split()]\n\nempty_str = '.' * mn[1]\nsample = None\nflag = True\nfor i in range(mn[0]):\n s = input()\n if s == empty_str:\n continue\n if sample is None:\n sample = s\n elif sample != s:\n flag = False\n break\n\nprint(\"YES\" if flag else \"NO\")\n", "def codeforces(piece):\r\n row_number = 0\r\n for row in piece:\r\n num = row.count('X')\r\n if num == 0:\r\n continue\r\n if row_number == 0:\r\n row_number = num\r\n continue\r\n if num != row_number:\r\n return 'NO'\r\n\r\n col_number = 0\r\n cols = [[row[i] for row in piece] for i in range(len(piece[0]))]\r\n for col in cols:\r\n num = col.count('X')\r\n if num == 0:\r\n continue\r\n if col_number == 0:\r\n col_number = num\r\n continue\r\n if num != col_number:\r\n return 'NO'\r\n\r\n return 'YES'\r\n\r\n\r\nrows, _ = input().split()\r\nrows = int(rows)\r\npiece = []\r\nfor _ in range(rows):\r\n line = input()\r\n piece.append(line)\r\n\r\nprint(codeforces(piece))\r\n", "'''input\n5 5\n.....\n..X..\n.....\n.....\n.....\n'''\ns1, e1, s2, e2 = 500, -1, 500, -1\nn, m = map(int, input().split())\ns = set(input() for _ in range(n))\ns.discard(\".\" * m)\nprint(\"YES\" if len(s) == 1 else \"NO\")\n\n\n\n\n\n\n\n\n\n\n\n", "import sys\r\nn, m = map(int, input().split())\r\ngg = [input() for i in range(n)]\r\nused = 0\r\nfir = [-1, -1]\r\nsec = [-1, -1]\r\nfor i in range(n):\r\n for j in range(m):\r\n if gg[i][j] == 'X':\r\n if not used:\r\n used = 1\r\n fir = [i, j]\r\n sec = [i, j]\r\nfor i in range(fir[0], sec[0] + 1):\r\n for j in range(fir[1], sec[1] + 1):\r\n if gg[i][j] == '.':\r\n print('NO')\r\n sys.exit(0)\r\nfor i in range(n):\r\n for j in range(m):\r\n if fir[0] <= i <= sec[0] and fir[1] <= j <= sec[1]:\r\n continue\r\n if gg[i][j] == 'X':\r\n print('NO')\r\n sys.exit(0)\r\nprint('YES')\r\n", "def read():\n return [int(v) for v in input().split()]\n\n\ndef main():\n n, m = read()\n\n s = []\n for i in range(n):\n s.append(input())\n\n up, left, down, right = n, m, -1, -1\n for i in range(n):\n for j in range(m):\n if s[i][j] == 'X':\n if i < up:\n up = i\n if j < left:\n left = j\n if i > down:\n down = i\n if j > right:\n right = j\n\n for i in range(up, down+1):\n for j in range(left, right+1):\n if s[i][j] != 'X':\n print('NO')\n return\n print('YES')\n\n\nif __name__ == '__main__':\n main()\n", "n, m = map(int, input().split())\r\n\r\nss = \"\"\r\n\r\nfor i in range(n):\r\n s = str(input())\r\n if 'X' in s:\r\n if ss == \"\":\r\n ss = s\r\n else:\r\n if s == ss:\r\n pass\r\n else:\r\n print(\"NO\")\r\n exit()\r\n\r\nprint(\"YES\")", "flag = True\r\nr , c = map( int , list(input().split()))\r\n#print( r , c )\r\nmxr = -1\r\nmnr = r\r\nmxc = -1\r\nmnc = c\r\ninp = list()\r\nfor row in range(r):\r\n inp.append( input() )\r\n for col in range( c ) :\r\n #print( inp[ row ][ col ] )\r\n if inp[ row ][ col ] == 'X' :\r\n mxr = max( mxr , row )\r\n mnr = min( mnr , row )\r\n mxc = max( mxc , col )\r\n mnc = min( mnc , col )\r\n#print( mxr , mnr , mxc , mnc )\r\nfor row in range( r ) :\r\n for col in range( c ) :\r\n if row <= mxr and row >= mnr and col <= mxc and col >= mnc and inp[ row ][ col ] == '.' :\r\n flag = False\r\n \r\nprint( \"YES\" if flag else \"NO\" )", "def fail():\r\n print('NO')\r\n exit()\r\n\r\nread = lambda: map(int, input().split())\r\nn, m = read()\r\na = [input() for i in range(n)]\r\nfst = None\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][j] == 'X':\r\n fst = i, j\r\n break\r\n if fst != None:\r\n break\r\nscd = None\r\nfor i in range(n - 1, -1, -1):\r\n for j in range(m - 1, -1, -1):\r\n if a[i][j] == 'X':\r\n scd = i, j\r\n break\r\n if scd != None:\r\n break\r\nflag = True\r\nfor i in range(n):\r\n for j in range(m):\r\n if fst[0] <= i <= scd[0] and fst[1] <= j <= scd[1]:\r\n if a[i][j] == '.':\r\n fail()\r\n else:\r\n if a[i][j] == 'X':\r\n fail()\r\nprint('YES')\r\n", "idx1_len, idx2_len =(int(x) for x in input().split())\r\nfield = []\r\nx_idx___idx1 = []\r\nx_idx___idx2 = []\r\nfor idx1 in range(idx1_len):\r\n idx2___value = input()\r\n field.append(idx2___value)\r\n for idx2, value in enumerate(idx2___value):\r\n if value == 'X':\r\n x_idx___idx1.append(idx1)\r\n x_idx___idx2.append(idx2)\r\n \r\ntop_left_idx1 = min(x_idx___idx1)\r\ntop_left_idx2 = min(x_idx___idx2)\r\n\r\nbottom_right_idx1 = max(x_idx___idx1)\r\nbottom_right_idx2 = max(x_idx___idx2)\r\n'''\r\n# flag = True\r\n# for idx1, idx2___value in enumerate(field):\r\n # if not flag:\r\n # break\r\n # for idx2, value in enumerate(idx2___value):\r\n # if value == 'X':\r\n # top_left_idx1 = idx1\r\n # top_left_idx2 = idx2\r\n # flag = False\r\n # break\r\n# if top_left_idx1 == -1 or top_left_idx2 == -1:\r\n # print('NO')\r\n # exit()\r\n \r\n# flag = True\r\n# for idx1 in range(idx1_len - 1, -1, -1):\r\n # if not flag:\r\n # break\r\n # idx2___value = field[idx1]\r\n # for idx2 in range(idx2_len - 1, -1, -1):\r\n # if idx2___value[idx2] == 'X':\r\n # bottom_right_idx1 = idx1\r\n # bottom_right_idx2 = idx2\r\n # flag = False\r\n # break\r\n''' \r\n\r\n\r\n \r\nfor idx1 in range(top_left_idx1, bottom_right_idx1 + 1):\r\n idx2___value = field[idx1]\r\n for idx2 in range(top_left_idx2, bottom_right_idx2 + 1):\r\n if idx2___value[idx2] != 'X':\r\n print('NO')\r\n exit()\r\nprint('YES')\r\n ", "import sys\nn, m = map(int, input().split())\nA = {line.rstrip() for line in sys.stdin}\nprint('YES' if len(A) == 1 or len(A) == 2 and '.'*m in A else 'NO')\n\n\n\n\n\n\n\n", "n,k=[int(i) for i in input().split()]\r\nans=chk=0\r\n\r\n\r\nfor i in range(n):\r\n s=input()\r\n if chk==0 and 'X' in s:\r\n j=s.rstrip('.').lstrip('.')\r\n if '.' in j:\r\n print('NO')\r\n exit()\r\n else:\r\n tmp=s\r\n chk=1\r\n elif chk==1:\r\n if 'X' in s and s!=tmp:\r\n print('NO')\r\n exit()\r\n elif 'X' not in s:\r\n chk==2\r\n elif chk==2 and 'X' in s:\r\n print('NO')\r\n exit()\r\nprint('YES')", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\ng = [input()[:-1] for _ in range(n)]\r\nd = []\r\ne = []\r\nfor i in range(n):\r\n for j in range(m):\r\n if g[i][j] == 'X':\r\n d.append(i)\r\n e.append(j)\r\nd.sort()\r\ne.sort()\r\nfor i in range(d[0], d[-1]+1):\r\n for j in range(e[0], e[-1]+1):\r\n if g[i][j] != 'X':\r\n print('NO')\r\n exit(0)\r\n\r\nprint('YES')", "n,m = map(int, input().split())\r\nx_count = 0\r\nstart_x = 0\r\nstart_y = 0\r\np = []\r\nfor i in range(n):\r\n p.append(input())\r\nstarted = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if p[i][j] == 'X':\r\n x_count += 1\r\n if p[i][j] == 'X' and not started:\r\n started = True\r\n start_x = i\r\n start_y = j\r\nx_len = 0\r\nfor i in range(start_x, n):\r\n if p[i][start_y] == \"X\":\r\n x_len += 1\r\n else:\r\n break\r\ny_len = 0\r\nfor i in range(start_y, m):\r\n if p[start_x][i] == \"X\":\r\n y_len += 1\r\n else:\r\n break\r\nif x_len * y_len != x_count:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(start_x, start_x + x_len):\r\n for j in range(start_y, start_y + y_len):\r\n if p[i][j] != 'X':\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\n", "n, m = map(int, input().split())\nmat = [\"\"] * n\n\nfor i in range(n):\n mat[i] = input()\n\nmnx, mny = n + 1, m + 1\nmxx, mxy = 0, 0\n\ncnt = 0\n\nfor i in range(n):\n for j in range(m):\n if mat[i][j] == 'X':\n mnx = min(mnx, i)\n mxx = max(mxx, i)\n mny = min(mny, j)\n mxy = max(mxy, j)\n cnt += 1\n\n#print(mxx, mnx, mxy, mny, cnt)\n\nif cnt == 0:\n print(\"NO\")\nelse:\n ans = (mxx - mnx + 1) * (mxy - mny + 1) == cnt\n print(\"YES\" if ans else \"NO\")\n", "n,m = map(int,input().split())\r\ndic = {}\r\nfor i in range(n):\r\n dic[i] = input()\r\nfirst = False\r\nfor i in range(n):\r\n for j in range(m):\r\n if dic[i][j] == 'X':\r\n corner1 = (i,j)\r\n first = True\r\n break\r\n if first:\r\n break\r\nfor i in range(corner1[0],n+1):\r\n if i == n or dic[i][corner1[1]] == '.':\r\n corner2 = i-1\r\n break\r\nfor i in range(corner1[1],m+1):\r\n if i == m or dic[corner1[0]][i] == '.':\r\n corner3 = i-1\r\n break\r\nrec = True\r\nfor i in range(n):\r\n for j in range(m):\r\n if i < corner1[0] or i > corner2 or j <corner1[1] or j > corner3:\r\n if dic[i][j] == 'X':\r\n rec = False\r\n break\r\n else:\r\n if dic[i][j] == '.':\r\n rec = False\r\n break\r\nif rec:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n, m = map(int, input().split())\r\n\r\npzl = []\r\nfor i in range(n):\r\n\tpzl.append(list(input()))\r\n\r\nleft = m + 1\r\nright = -1\r\nup = n + 1\r\ndown = -1\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif pzl[i][j] == 'X':\r\n\t\t\tif left > j:\r\n\t\t\t\tleft = j\r\n\t\t\tif right < j:\r\n\t\t\t\tright = j\r\n\t\t\tif up > i:\r\n\t\t\t\tup = i\r\n\t\t\tif down < i:\r\n\t\t\t\tdown = i\r\n\r\nansw = 'YES'\r\nfor i in range(up, down + 1):\r\n\tfor j in range(left, right + 1):\r\n\t\tif pzl[i][j] != 'X':\r\n\t\t\tansw = 'NO'\r\nprint(answ)\r\n", "h, w = map(int, input().split())\r\n\r\ng = [input() for _ in range(h)]\r\n\r\nmh = mw = 10000000\r\nMh = Mw = 0\r\n\r\nfor i in range(h):\r\n\tfor j in range(w):\r\n\t\tif(g[i][j] == 'X'):\r\n\t\t\tmh = min(mh, i)\r\n\t\t\tMh = max(Mh, i)\r\n\t\t\tmw = min(mw, j)\r\n\t\t\tMw = max(Mw, j)\r\n\r\nr = 'YES'\r\n\r\nfor i in range(h):\r\n\tfor j in range(w):\r\n\t\tif (g[i][j] == 'X') != (mh <= i <= Mh and mw <= j <=Mw) :\r\n\t\t\tr = 'NO'\r\n\r\nprint(r)", "n, m = map(int, input().split())\nv = []\n\nfor i in range(n):\n line = input()\n v.append(line)\n\nu = n\nd = 0\nl = m\nr = 0\n \nfor i in range(n):\n for j in range(m):\n if v[i][j] == 'X':\n if i < u:\n u = i\n if i > d:\n d = i\n if j < l:\n l = j\n if j > r:\n r = j\n \nfor i in range(u,d+1):\n for j in range(l, r+1):\n if v[i][j] == \".\":\n print(\"NO\")\n exit()\n \nprint(\"YES\")", "n, m = map(int,input().split())\r\nans = []\r\nfor i in range(n):\r\n s = input()\r\n x = set(s)\r\n if 'X' in x:\r\n ans.append(s)\r\nans2 = []\r\na = zip(*ans)\r\nfor i in a:\r\n x = set(i)\r\n if 'X' in x:\r\n ans2.append(i)\r\ndef f():\r\n for i in ans2:\r\n if '.' in i:\r\n return \"NO\"\r\n return \"YES\"\r\nprint(f())\r\n", "n,m = map(int, input().split())\r\npiece = [input().rstrip() for i in range(n)]\r\n\r\nmaxx, minx, maxy, miny = -1, n, -1, m\r\ncount = 0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif piece[i][j] == 'X':\r\n\t\t\tmaxx = max(maxx, i)\r\n\t\t\tminx = min(minx, i)\r\n\t\t\tmaxy = max(maxy, j)\r\n\t\t\tminy = min(miny, j)\r\n\t\t\tcount += 1\r\n\r\nif (maxx - minx + 1) * (maxy - miny + 1) == count:\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "#!/usr/bin/env python3\nfrom sys import stdin,stdout\n\n\ndef ri():\n return map(int, input().split())\n\nn, m = ri()\nfound = 0\nfor i in range(n):\n r = input()\n if found == 0 and 'X' in r:\n r0 = r\n found = 1\n continue\n if found and 'X' in r:\n if r != r0:\n print(\"NO\")\n exit()\n\nprint(\"YES\")\n", "n, m = map(int, input().split())\r\npr = [-1, -1]\r\nfor i in range(n):\r\n a = input()\r\n new_pr = [-1, -1]\r\n for ind, j in enumerate(a):\r\n if j == 'X' and new_pr[0] == -1:\r\n new_pr[0] = ind\r\n if j == '.' and new_pr[1] == -1 and new_pr[0] != -1:\r\n new_pr[1] = ind - 1\r\n if j == 'X' and new_pr[1] != -1:\r\n print('NO')\r\n exit(0)\r\n if new_pr[0] == -1:\r\n continue\r\n if pr[0] == -1:\r\n pr = new_pr\r\n elif tuple(pr) != tuple(new_pr):\r\n print('NO')\r\n exit(0)\r\n pr = new_pr\r\nprint('YES')", "import sys\r\nn,m=map(int, input().split())\r\ni=0\r\nt=[]\r\nfor i in range(n):\r\n t.append('')\r\n t[i]=input()\r\n\r\nj=0\r\nfor i in range(n):\r\n t[i]='.'+t[i]+'.'\r\nppc=''\r\nppc='.'*(m+2)\r\nt.insert(0,ppc)\r\nt.append(ppc)\r\n#print(t)\r\nd=0\r\nsch=0\r\nb=0\r\ntr=True\r\nfor i in range(n+2):\r\n for j in range(m+2):\r\n if t[i][j]=='X':\r\n d=j\r\n while (d<m) and (t[i][d]=='X'):\r\n d+=1\r\n b=i\r\n while (t[b][j:(d+1)]==t[i][j:(d+1)]):\r\n if (t[b][j-1]!='X') and (t[b][d+1]!='X'):\r\n b+=1\r\n else:\r\n print('NO')\r\n sys.exit()\r\n #print(t[b][j:(d+1)])\r\n if ('X' in t[b][j:(d+1)]):\r\n print('NO')\r\n sys.exit()\r\n else:\r\n print('YES')\r\n sys.exit()", "n, m = map(int, input().split())\na = []\nfor i in range(n):\n a.append(input())\n\ninf = 10 ** 9\np, q = inf, inf\nr, s = -1, -1\n\nfor i in range(n):\n for j in range(m):\n if a[i][j] == 'X':\n p = min(p, i)\n q = min(q, j)\n r = max(r, i)\n s = max(s, j)\n\nok = True\nfor i in range(n):\n for j in range(m):\n if a[i][j] == 'X':\n ok &= p <= i <= r and q <= j <= s\n if a[i][j] == '.':\n ok &= not (p <= i <= r and q <= j <= s)\n\nif ok:\n print('YES')\nif not ok:\n print('NO')\n", "n, m = map(int, input().split())\r\ns = []\r\nfor i in range(n):\r\n s += [input()]\r\n\r\ndef check():\r\n flag = False\r\n for i in range(n):\r\n for j in range(m):\r\n if s[i][j] == 'X':\r\n i1 = i\r\n j1 = j\r\n flag = True\r\n break\r\n if flag: break\r\n\r\n flag = False\r\n for i in range(n-1, -1, -1):\r\n for j in range(m-1, -1, -1):\r\n if s[i][j] == 'X':\r\n i2 = i\r\n j2 = j\r\n flag = True\r\n break\r\n if flag: break\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if i1 <= i <= i2 and j1 <= j <=j2:\r\n if s[i][j] != 'X':\r\n return False\r\n else:\r\n if s[i][j] == 'X':\r\n return False\r\n return True\r\n\r\nif check():\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "def Main():\r\n n , m = map(int ,input().split())\r\n dp = [ input().rstrip() for i in range(n) ]\r\n mxX, mnX, mxY, mnY = -1, n, -1, m\r\n cnt = 0\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n if dp[i][j] == 'X':\r\n mxX = max(mxX, i)\r\n mnX = min(mnX, i)\r\n mxY = max(mxY, j)\r\n mnY = min(mnY, j)\r\n cnt += 1\r\n\r\n if ((mxX - mnX + 1)*(mxY - mnY + 1)) == cnt :\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n Main()", "from collections import defaultdict, Counter\ndef solution():\n # divid my i -- n and with in range of m\n n,m = map(int, input().split())\n\n # if rectangle yes thats it\n # is it rectangele\n\n # go to the first and cont\n # start end \n grid = list()\n for _ in range(n):\n grid.append(list(input()))\n\n start = None\n end = None\n for i in range(n):\n if \"X\" in grid[i]:\n start_i = i\n start = grid[i].index(\"X\")\n end = \"\".join(grid[i]).rfind(\"X\")\n break\n \n for i in range(start_i, n):\n if grid[i][start] == \".\":\n break\n\n for j in range(start, end + 1):\n if grid[i][j] != \"X\":\n return print(\"NO\")\n grid[i][j] = \".\"\n\n for i in range(n):\n if \"X\" in grid[i]:\n return print(\"NO\")\n\n return print(\"YES\")\n\n\ndef main():\n t = 1\n #t = int(input())\n for _ in range(t):\n solution()\n\nmain()\n" ]

[ "# 161A-sua bai >> accepted\n# n: num of solder\n# m: num of vest\n# x: margin duoi\n# y: margin tren\n# chu giai giai thuat: i chay tu 0>>n, neu ao vest b[j] nho hon (a[i]-x), thi tang j (xet bo ao vest tiep theo) cho toi khi tim\n# thay j phu hop, sau do xet xem ung voi j do, ao vest co phu hop voi soldier i ko (b[j]<(a[i]+y)), neu phu hop thi luu cap i,j\n# do lai, neu khong phu hop thi tang i (bang vong for)\nn,m,x,y = map(int,input().split())\na = list(map(int,input().split())) # list size soldier\nb = list(map(int,input().split())) # list cac size ao\nj=0\nu = []\nfor i in range (n):\n\n if (j==m):\n break\n# print (b[j])\n# print (a[i]-x)\n while ((b[j]<(a[i]-x))):\n# print ('i=',i)\n# print ('j=',j)\n j+=1\n if (j==m):\n break\n if (j==m):\n break\n if (b[j]<=(a[i]+y)):\n u.append([i+1,j+1])\n j+=1\nprint (len(u))\nfor i in range (len(u)):\n print ('%d %d'%(u[i][0],u[i][1]))", "n,m,x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nj = 0\r\n\r\nV=[]\r\n\r\nfor i in range(m):\r\n\twhile (j<n and a[j]+y<b[i]):\r\n\t\tj += 1 \r\n\r\n\tif j == n:\r\n\t\tbreak\r\n\t\r\n\tif (j<n and a[j]-x<=b[i]<=a[j]+y):\r\n\t\tV+=[[j+1,i+1]]\r\n\t\tj+=1\r\n \r\nprint(len(V))\r\nfor x in V:\r\n print(x[0],x[1])", "n,m,x,y = list(map(int,input().split()))\r\npeople = list(map(int,input().split()))\r\narmor = list(map(int,input().split()))\r\nmass = []\r\ncount = 0\r\ni = 0\r\nj = 0\r\nwhile (i<n and j<m):\r\n if people[i] - x <= armor[j] <= people[i] + y:\r\n mass.append([i+1, j+1])\r\n i+=1\r\n j+=1\r\n elif armor[j] > people[i] + y:\r\n i+=1\r\n else:\r\n j+=1\r\nprint(len(mass))\r\nfor i in mass:\r\n print(*i)", "def tolerance_test(s, v, x, y):\n\tif(v >= s-x and v <= s+y):\n\t\treturn True\n\treturn False\n\nn, m, x, y = tuple([int(x) for x in input().split()])\nsoldiers = [int(x) for x in input().split()]\nvests = [int(x) for x in input().split()]\ncount = 0\ns_p = 0\nv_p = 0\nindices_store = []\nwhile(s_p < len(soldiers) and v_p < len(vests)):\n\tif(tolerance_test(soldiers[s_p], vests[v_p], x, y)):\n\t\tcount += 1\n\t\ts_p += 1\n\t\tv_p += 1\n\t\tindices_store.append((s_p, v_p))\n\telif(soldiers[s_p] < vests[v_p]):\n\t\ts_p += 1\n\telse:\n\t\tv_p += 1\nprint(count)\nfor t in indices_store:\n\tprint(\"%d %d\"%(t[0], t[1]))", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nrs = 0\r\npos = 0\r\nlstrs1 = []\r\nlstrs2 = []\r\nfor i in range(n):\r\n while pos < m and b[pos] < a[i] - x:\r\n pos += 1\r\n if pos < m and b[pos] >= a[i] - x and b[pos] <= a[i] + y:\r\n lstrs1.append(i + 1)\r\n lstrs2.append(pos + 1)\r\n rs += 1\r\n pos += 1\r\n\r\nprint(rs)\r\nfor i in range(rs):\r\n print(lstrs1[i], lstrs2[i])", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ni = j = 0\r\nk = 0\r\nkarr = []\r\n\r\nwhile i < n and j < m:\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n k += 1\r\n karr.append([i+1,j+1])\r\n i += 1\r\n j += 1\r\n elif b[j] < a[i] - x:\r\n j += 1\r\n elif a[i] + y < b[j]:\r\n i += 1\r\n\r\nprint(k)\r\nfor x in karr:\r\n print('{} {}'.format(x[0], x[1]))", "INPUT = lambda: list(map(int, input().split()))\n\nn, m, x, y = INPUT()\n\na = INPUT()\nb = INPUT()\n\nresult = []\ni = 0\n\nfor j in range(m):\n while i < n and b[j] > a[i] + y:\n i += 1\n if i < n and b[j] >= a[i] - x:\n result.append((i + 1, j + 1))\n i += 1\n\nprint(len(result))\n\nfor i in result:\n print(i[0], i[1])", "n, m, x, y = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\ni, j, val = 0, 0, []\r\nwhile i < n and j < m:\r\n a_min, a_max = a[i] - x, a[i] + y\r\n if b[j] < a_min:\r\n j += 1\r\n elif b[j] > a_max:\r\n i += 1\r\n else:\r\n val.append((i + 1, j + 1))\r\n i += 1\r\n j += 1\r\nprint(len(val))\r\nfor s in val:\r\n print(s[0], s[1])", "n, m, x, y = map(int, input().split())\r\n\r\nsizes = list(map(int, input().split()))\r\nvests = list(map(int, input().split()))\r\n\r\nanswers = []\r\ni = 0\r\nj = 0\r\nwhile i < n and j < m:\r\n if sizes[i] - x <= vests[j] <= sizes[i] + y:\r\n answers.append((i, j))\r\n i += 1\r\n j += 1\r\n elif vests[j] < sizes[i] - x:\r\n j += 1\r\n else:\r\n i += 1\r\nprint(len(answers))\r\nfor answer in answers:\r\n print(answer[0] + 1, answer[1] + 1)", "n,m,x,y = map(int,input().split())\r\n\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na = sorted((a))\r\nb = sorted(b)\r\nres = 0\r\nans = []\r\nj = 0\r\nfor i in range(len(a)):\r\n while j < len(b) and b[j] < a[i] - x:\r\n j += 1\r\n if j == len(b):\r\n break\r\n if b[j] <= a[i] + y:\r\n res+=1\r\n ans.append([(i+1, j+1)])\r\n j+=1\r\nprint(res)\r\nfor i in range(res):\r\n for j in range(1):\r\n print(' '.join(map(str,ans[i][j])))", "__author__ = 'asmn'\r\nn, m, x, y = tuple(map(int, input().split()))\r\na = sorted(map(int, input().split()))\r\nb = sorted(map(int, input().split()))\r\nnb = len(b)\r\ncnt = 0\r\nans = []\r\nj = 0\r\nfor i in range(len(a)):\r\n while j < nb and b[j] < a[i] - x:\r\n j += 1\r\n if j == nb:\r\n break\r\n if b[j] <= a[i] + y:\r\n cnt += 1\r\n ans += [(i, j)]\r\n j+=1\r\nprint(cnt)\r\nprint('\\n'.join(map(lambda x:str(x[0]+1)+' '+str(x[1]+1),ans)))\r\n", "n, m, x, y = map(int, input().split())\r\n\r\nsize_of_soldiers = list(map(int, input().split()))\r\nsize_of_clothes = list(map(int, input().split()))\r\n\r\nidx_soldiers = idx_clothes = 0\r\nmatching_results = []\r\n\r\nwhile idx_soldiers < n and idx_clothes < m:\r\n\tif size_of_soldiers[idx_soldiers] - x <= size_of_clothes[idx_clothes] and size_of_clothes[idx_clothes] <= size_of_soldiers[idx_soldiers] + y:\r\n\t\t\tmatching_results.append([idx_soldiers+1, idx_clothes+1])\r\n\t\t\tidx_soldiers += 1\r\n\t\t\tidx_clothes += 1\r\n\telse:\r\n\t\tif size_of_soldiers[idx_soldiers] - x > size_of_clothes[idx_clothes]:\r\n\t\t\tidx_clothes += 1\r\n\t\telif size_of_soldiers[idx_soldiers] + y < size_of_clothes[idx_clothes]:\r\n\t\t\tidx_soldiers += 1\r\n\t\t\t\r\nprint(len(matching_results))\r\nfor pair in matching_results:\r\n\tprint(*pair)", "ans = []\nn, m, x, y = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ni, j = 0, 0\nwhile j < len(b) and i < len(a):\n if a[i] - x > b[-1]:\n break\n while j < len(b) and b[j] < a[i] - x:\n j += 1\n if b[j] <= a[i] + y:\n ans.append([i + 1, j + 1])\n j += 1\n i += 1\nprint(len(ans))\nfor x in ans:\n print(\" \".join(list(map(str, x))))\n\n# Sat Jul 02 2022 14:42:53 GMT+0000 (Coordinated Universal Time)\n", "n,m,x,y = map(int, input().split(' '))\r\na = list(map(int, input().split(' ')))\r\nb = list(map(int, input().split(' ')))\r\n\r\nd = [-1] * (10**5+5)\r\n\r\ni,j = 0,0\r\ncnt = 0\r\nwhile i < n and j < m:\r\n if b[j] >= a[i] - x and b[j] <= a[i] + y:\r\n d[i] = j\r\n i += 1\r\n j += 1\r\n cnt += 1\r\n elif b[j] < a[i] - x:\r\n j += 1\r\n elif b[j] > a[i] + y:\r\n i += 1\r\n\r\nprint(cnt)\r\nfor i in range(n):\r\n if d[i] > -1:\r\n print(i+1,d[i]+1)\r\n", "n, m, x, y = map(int, input().split())\r\na_n = [i for i in map(int, input().split())]\r\nb_m = [i for i in map(int, input().split())]\r\n\r\ncount = 0\r\nresult = []\r\ni = 0\r\nj = 0\r\nwhile j < m and i < n: \r\n if b_m[j] > a_n[i] + y: \r\n i += 1\r\n elif b_m[j] < a_n[i] - x: \r\n j += 1\r\n else: \r\n count += 1\r\n result.append((i+1, j+1))\r\n i += 1\r\n j += 1\r\nprint(count)\r\nfor i in result:\r\n print(i[0], i[1])", "if __name__ == '__main__':\r\n n, m, x, y = [int(x) for x in input().split()]\r\n a = [int(x) for x in input().split()]\r\n b = [int(x) for x in input().split()]\r\n\r\n count = 0\r\n i = 0\r\n j = 0\r\n\r\n while i < n and j < m:\r\n if b[j] < a[i] - x:\r\n j+=1\r\n elif b[j] > a[i] + y:\r\n i+=1\r\n else:\r\n i+=1\r\n a[count] = i\r\n j+=1\r\n b[count] = j\r\n count+=1\r\n\r\n print(count)\r\n for k in range(count):\r\n print(a[k],b[k])\r\n\r\n\r\n", "def find_vest(n, m, x, y, arr_a, arr_b):\r\n vests = []\r\n i = 0\r\n j = 0\r\n while i < n and j < m:\r\n if arr_a[i] - x <= arr_b[j] <= arr_a[i] + y:\r\n vests.append([i + 1, j + 1])\r\n i += 1\r\n j += 1\r\n elif arr_b[j] > arr_a[i] + y:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\n return vests\r\n\r\n\r\nfirst_line_input = list(map(int, input().split()))\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nN = first_line_input[0]\r\nM = first_line_input[1]\r\nX = first_line_input[2]\r\nY = first_line_input[3]\r\n\r\nequiped_vests = find_vest(N, M, X, Y, A, B)\r\nif len(equiped_vests) == 0:\r\n print(0)\r\nelse:\r\n print(len(equiped_vests))\r\n for e in equiped_vests:\r\n print(\"%d %d\" % (e[0], e[1]))\r\n\r\n", "n,m,x,y=map(int, input().split())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\n\r\nvest=[]\r\nj=0\r\nfor i in range(n):\r\n while j<m and b[j] <=a[i]+y:\r\n if b[j] <=a[i]+y and b[j] >= a[i]-x:\r\n j+=1\r\n vest+=[(i+1,j)]\r\n break\r\n j+=1\r\n\r\nprint(len(vest))\r\nfor h in range(len(vest)):\r\n print(vest[h][0], vest[h][1])", "#http://codeforces.com/problemset/problem/161/A\r\ndef inp():\r\n return map(int, input().split())\r\n\r\nn,m,x,y = inp()\r\na=list(inp())\r\nb=list(inp())\r\n\r\nres = list()\r\n\r\ni,j = 0,0\r\nwhile ((i < n) & (j < m)):\r\n if (b[j] < a[i] - x):\r\n j+=1\r\n elif (b[j] > a[i] + y):\r\n i+=1\r\n else:\r\n res.append([i+1,j+1])\r\n i+=1\r\n j+=1\r\n\r\n\r\nprint(len(res))\r\nfor x in range(len(res)):\r\n print(res[x][0], res[x][1])", "line = input().split(' ')\r\nn, m, x, y = list(map(int, line))\r\n\r\nline = input()\r\n\r\na = list(map(int, line.split(' ')))\r\n\r\nline = input()\r\n\r\nb = list(map(int, line.split(' ')))\r\nresults = []\r\ni = 0\r\nj = 0\r\n# a là mảng kích thước của người\r\n# b là mảng size áo\r\nfor j in range(m):\r\n while i < n and b[j] > a[i] + y:\r\n i+=1\r\n if i == n:\r\n break\r\n if a[i] - x <= b[j]:\r\n results.append(f'{i+1} {j+1}')\r\n i+=1\r\nprint(len(results))\r\nfor s in results:\r\n print(s)", "class bulletproof:\r\n def __init__(self,x,y):\r\n self.soldier=x\r\n self.vest=y\r\ns=list(map(int, input().split()))\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=[]\r\nx=s[2]\r\ny=s[3]\r\nj=0\r\nk=0\r\ni=0\r\nfor i in range (len(a)):\r\n while j<=len(b)-1 and b[j]<a[i]-x:\r\n j+=1\r\n if j<=len(b)-1 and a[i]-x<=b[j]<=a[i]+y:\r\n p=bulletproof(i+1, j+1)\r\n c.append(p)\r\n k+=1\r\n j+=1\r\n if j==len(b):\r\n break\r\nprint(k)\r\nfor i in range (len(c)):\r\n print(c[i].soldier, c[i].vest)", "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, x, y = map(int, input().split())\r\nw = list(map(int, input().split()))\r\ns = list(map(int, input().split()))\r\n\r\ni = j = c = 0\r\nd = []\r\nwhile i < n and j < m:\r\n if w[i] - x <= s[j] <= w[i] + y:\r\n c += 1\r\n d.append((i+1, j+1))\r\n i += 1\r\n j += 1\r\n elif s[j] < w[i] - x:\r\n j += 1\r\n else:\r\n i += 1\r\n\r\nprint(c)\r\nfor i in d:\r\n print(' '.join(map(str, i)))\r\n", "\n\n\n\nif __name__ == '__main__':\n\tn, m, x, y = list(map(int, input().split()))\n\tarr1 = list(map(int, input().split()))\n\tarr2 = list(map(int, input().split()))\n\n\n\ti, j = 0, 0\n\tcnt = 0\n\tls = []\n\twhile i < n and j < m:\n\t\tif arr1[i] - x <= arr2[j] <= arr1[i] + y:\n\t\t\tls.append((i+1, j+1))\n\t\t\ti += 1\n\t\t\tj += 1\n\t\t\tcnt += 1\n\t\telif arr2[j] < arr1[i] - x:\n\t\t\t# the current vest does not fit, move to next vest\n\t\t\tj += 1\n\t\telif arr2[j] > arr1[i] + y:\n\t\t\t# the current soldier is smaller than current vest, move to next soldier\n\t\t\ti += 1\n\t\n\tprint(cnt)\n\tfor item in ls:\n\t\tprint(*item)\n", "n, m, x, y = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nv = []\r\ni = j = 0\r\n\r\nwhile i < n and j < m:\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n v.append((i+1, j+1))\r\n i += 1\r\n j += 1\r\n elif b[j] < a[i]-x:\r\n j += 1\r\n elif b[j] > a[i]+y:\r\n i += 1\r\n\r\nprint(len(v))\r\nfor vest in v:\r\n print(vest[0], vest[1])\r\n", "#Codeforces - Dress'em in Vests!\r\n#https://codeforces.com/contest/161/problem/A\r\n# best solution https://codeforces.com/contest/161/submission/18157541\r\n\r\nn,m,y,x = map(int, input().split())\r\narrN = sorted(list(map(int, input().split())))\r\narrM = sorted(list(map(int, input().split())))\r\n\r\nresultArr = []\r\nresultNum = 0\r\nsol = 0\r\nves = 0\r\n\r\nwhile ves < m and sol < n:\r\n while ves < m:\r\n if arrM[ves]-x <= arrN[sol] and arrM[ves]+y >= arrN[sol]:\r\n resultArr.append(\"{} {}\".format(sol+1,ves+1))\r\n resultNum +=1\r\n ves += 1\r\n break\r\n elif arrM[ves]-x > arrN[sol]:\r\n break\r\n ves += 1\r\n sol += 1\r\nprint(resultNum)\r\nfor i in range(len(resultArr)):\r\n print(resultArr[i],end=\"\\n\")", "N,M,X,Y = list(map(int,input().split()))\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\n\r\ni = 0\r\nj = 0\r\n\r\nans_list = []\r\nans = 0\r\n\r\nwhile i<N and j<M:\r\n if A[i] - X <= B[j] <= A[i] + Y:\r\n temp = [i,j]\r\n ans_list.append(temp)\r\n ans += 1\r\n i += 1\r\n j += 1\r\n elif A[i] - X > B[j]:\r\n j += 1\r\n elif A[i] + Y < B[j]:\r\n i += 1\r\n\r\nprint(ans)\r\nfor i in ans_list:\r\n print(i[0]+1,i[1]+1)", "if __name__ == \"__main__\":\r\n n, m, x, y = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n\r\n i = 0\r\n j = 0\r\n res = []\r\n while i < n:\r\n while j < m and a[i] - x > b[j]:\r\n j += 1\r\n if j < m and a[i] - x <= b[j] and a[i] + y >= b[j]:\r\n res.append((i + 1, j + 1))\r\n j += 1\r\n i += 1\r\n\r\n print(len(res))\r\n for first, second in res:\r\n print(first, second)", "import sys\ninput = sys.stdin.readline\n\nn, m, x, y = map(int, input().split())\na = [int(i) for i in input().split()]\na = [(a[i], i + 1) for i in range(n)]\nb = [int(i) for i in input().split()]\nb = [(b[i], i + 1) for i in range(m)]\na.sort()\nb.sort()\ni, j = 0, 0\npairs = []\nk = 0\nwhile i < n and j < m:\n if a[i][0] < b[j][0] - y:\n i += 1\n elif a[i][0] > b[j][0] + x:\n j += 1\n else:\n k += 1\n pairs.append((a[i][1], b[j][1]))\n i += 1\n j += 1\nprint(k)\nfor i in range(k):\n print(str(pairs[i][0]) + \" \" + str(pairs[i][1]))\n", "n, m, x, y = map(int, input().split())\r\na, b = list(map(int, input().split())), list(map(int, input().split()))\r\n\r\ni, j = 0, 0\r\nans = []\r\n\r\nwhile i < n and j < m:\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n ans.append((i+1, j+1))\r\n i += 1\r\n j += 1\r\n elif a[i] - x > b[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(i[0], i[1])\r\n", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nu = []\r\nv = []\r\n\r\ni, j, res = 0, 0, 0\r\n\r\nwhile i < n and j < m:\r\n if (a[i] - x <= b[j] and b[j] <= a[i] + y):\r\n i += 1\r\n j += 1\r\n res += 1\r\n u.append(i)\r\n v.append(j)\r\n continue\r\n if a[i] - x > b[j]:\r\n j += 1\r\n continue\r\n else:\r\n i += 1\r\n continue\r\n\r\nprint(res)\r\nfor i in range(res):\r\n print(u[i], v[i])\r\n\r\n", "n, m, x, y = map(int, input().split())\r\narray = list(map(int, input().split()))\r\narmor = list(map(int, input().split()))\r\nanswer = 0\r\ni = 0\r\nj = 0\r\nans = []\r\nwhile i < n and j < m:\r\n if armor[j] < array[i] - x:\r\n j += 1\r\n elif armor[j] > array[i] + y:\r\n i += 1\r\n else:\r\n ans.append((i+1, j+1))\r\n answer += 1\r\n i += 1\r\n j += 1\r\nprint(answer)\r\nfor el in ans:\r\n print(*el)", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\noutputs, l = [], 0\r\nfor i in range(n):\r\n minm = max(1, a[i]-x)\r\n while l<m and b[l]<minm:\r\n l += 1\r\n if l<m and b[l]<=a[i]+y:\r\n outputs.append(f'{i+1} {l+1}')\r\n l += 1\r\nprint(len(outputs))\r\nfor output in outputs:\r\n print(output)\r\n\r\n", "n, m, x, y = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nb = [int(x) for x in input().split()]\r\n\r\nans = []\r\ni = j = 0\r\nwhile i < n and j < m:\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n ans.append((i + 1, j + 1))\r\n i += 1\r\n j += 1\r\n elif a[i] - x < b[j]:\r\n i += 1\r\n else:\r\n j += 1\r\n\r\nprint(len(ans))\r\nfor el in ans:\r\n print(*el)", "n, m, x, y = map(int, input().split(' '))\na = list(map(int, input().split(' ')))\nb = list(map(int, input().split(' ')))\n\n# available = b.copy()\n# count = 0 # the maximum number of soldiers equipped with bulletproof vests\n# temp = []\n# for i in range(n):\n# for j in range(len(b)):\n# if a[i]-x <= b[j] and a[i]+y >= b[j]:\n# count +=1\n# temp.append((i+1, j+1))\n# b.pop(j)\n# break\n# print(count)\n# for u, v in temp:\n# print(u, v)\n\n# based on solution:\nans = []\ni = j = 0\nwhile i < n and j < m:\n if b[j] >= a[i]-x and b[j] <= a[i]+y:\n ans.append((i + 1, j + 1))\n i += 1\n j += 1\n elif b[j] > a[i]+y:\n i += 1\n else:\n j += 1\nprint(len(ans))\nfor k in ans:\n print(k[0], k[1])\n\n'''\nNote:\ncount = 0; ans = []\nwhile i < n and j < m:\n if b[j] < a[i] - x:\n j++\n elif b[j] > a[i] + y:\n i++\n else: (a[i]-x<=b[j]<=a[i]+y)\n count ++\n ans.append((i+1,j+1))\n i++, j++\nprint(k)\nprint(ans)\n\nO(n+m) vì biến i và j thay phiên nhau tăng, khác với bài GeorgeRound vì bài đó có mỗi j tăng\nsau mỗi vòng lặp.\n'''", "R = lambda: map(int, input().rstrip().split())\nn, m, x, y = R()\na = list(R())\nb = list(R())\nans = []\nt = 0\nj = 0\nfor i in range(m):\n while j < n and a[j] + y < b[i]:\n j += 1\n if j == n:\n \tbreak\n if (j < n and a[j] - x <= b[i] <= a[j] + y):\n ans += [[j + 1, i + 1]]\n j += 1\n t += 1\nprint(t)\nfor x in ans:\n print(*x)", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\npairs = [] # Список для хранения пар бойцов и бронежилетов\r\n\r\ni, j = 0, 0 # Индексы текущего бойца и бронежилета\r\n\r\nwhile i < n and j < m:\r\n # Проверяем, подходит ли бронежилет j бойцу i\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n pairs.append((i + 1, j + 1)) # Добавляем пару в список\r\n i += 1 # Переходим к следующему бойцу\r\n j += 1 # Переходим к следующему бронежилету\r\n elif b[j] < a[i] - x:\r\n j += 1 # Если бронежилет слишком маленький, переходим к следующему бронежилету\r\n else:\r\n i += 1 # Если бронежилет слишком большой, переходим к следующему бойцу\r\n\r\nprint(len(pairs)) # Выводим количество пар\r\n\r\nfor pair in pairs:\r\n print(pair[0], pair[1]) # Выводим пары бойцов и бронежилетов\r\n", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nl = []\r\ni = 0\r\nj = 0\r\n\r\nwhile j < len(b) and i < len(a):\r\n\tif a[i]-x <= b[j] <= a[i]+y:\r\n\t\tl.append([i+1, j+1])\r\n\t\tj+=1\r\n\t\ti+=1\r\n\telif b[j] > a[i] + y:\r\n\t\ti+=1\r\n\telif b[j] < a[i] + x:\r\n\t\tj+=1\r\n\t\r\n\r\n\r\nprint(len(l))\r\n\r\nfor i in l:\r\n\tprint('{0} {1}'.format(i[0], i[1]))\r\n\r\n\r\n", "from sys import maxsize\r\n\r\n\r\nn, m, x, y = map(int, input().split())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ni = 0\r\npairs = []\r\n\r\nlength_a = len(a)\r\nlength_b = len(b)\r\n\r\nfor j in range(length_b):\r\n while i < n and b[j] > a[i] + y:\r\n i += 1\r\n if i == n:\r\n break\r\n elif a[i] - x <= b[j] <= a[i] + y:\r\n pairs.append((i + 1, j + 1))\r\n i += 1\r\n \r\n\r\nprint(len(pairs))\r\nfor pair in pairs:\r\n print(pair[0], pair[1])\r\n", "def process_input():\r\n n, m, x, y = map(int, input().split())\r\n return n, m, x, y\r\n\r\n\r\ndef process_input2():\r\n arr1 = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split()))\r\n return arr1, arr2\r\n\r\n\r\ndef solve():\r\n number_of_soldiers, number_of_vests, x, y = process_input()\r\n desired_sizes_of_vests, sizes_available_of_vests = process_input2()\r\n i = 0\r\n k = 0\r\n\r\n soldiers_equipped_bulletproof = 0\r\n array_result = []\r\n\r\n while i < number_of_soldiers and k < number_of_vests:\r\n min_size_desired = desired_sizes_of_vests[i] - x\r\n max_size_desired = desired_sizes_of_vests[i] + y\r\n\r\n size_available = sizes_available_of_vests[k]\r\n\r\n if min_size_desired <= size_available <= max_size_desired:\r\n soldiers_equipped_bulletproof += 1\r\n array_result.append(f'{i + 1} {k + 1}')\r\n i += 1\r\n k += 1\r\n elif size_available < min_size_desired:\r\n k += 1\r\n elif size_available > max_size_desired:\r\n i += 1\r\n\r\n print(soldiers_equipped_bulletproof)\r\n for result in array_result:\r\n print(result)\r\n\r\n\r\nsolve()\r\n\r\n", "n, m, x, y = map(int,input().split())\npeople = list(map(int,input().split()))\nvests = list(map(int,input().split()))\ni = 0 \nj = 0 \n\nresult = []\ncount = 0\n\nwhile (i < n) and (j < m):\n if people[i] - x <= vests[j] and vests[j] <= people[i] + y:\n result.append((i+1,j+1))\n i += 1\n j += 1\n count += 1\n elif people[i] - x > vests[j]:\n j += 1\n elif vests[j] > people[i] + y:\n i += 1 \n\nprint(count)\nfor element in result:\n print(*element) \n", "#!/usr/bin/env python3\n\n# https://codeforces.com/problemset/problem/161/A\ndef find_fit_sizes(desired_sizes, available_sizes):\n k = 0\n j, i = 0, 0\n pair_list = []\n while j < len(available_sizes) and i < len(desired_sizes):\n available_size = available_sizes[j]\n desired_size = desired_sizes[i]\n if desired_size - a <= available_size <= desired_size + b:\n i += 1\n j += 1\n k += 1\n pair_list.append((i, j))\n elif available_size < desired_size - a:\n j += 1\n elif available_size > desired_size + b:\n i += 1\n return k, pair_list\n\nif __name__ == \"__main__\":\n # Handle input\n m, n, a, b = map(int, input().split())\n desired_sizes = list(map(int, input().split()))\n available_sizes = list(map(int, input().split()))\n k, pair_list = find_fit_sizes(desired_sizes, available_sizes)\n print(k)\n for pair in pair_list:\n print(pair[0], pair[1])\n", "n,m,x,y = map(int, input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ndef find_suitable_vest(n,m,x,y,a,b):\r\n ans=[]\r\n Ia = Ib = 0\r\n while Ia < n and Ib < m:\r\n limit_max = a[Ia] + y\r\n limit_min = a[Ia] - x\r\n if b[Ib] < limit_min:\r\n Ib += 1\r\n else:\r\n if b[Ib] <= limit_max:\r\n ans.append([Ia+1, Ib+1])\r\n Ia += 1\r\n Ib += 1\r\n else:\r\n Ia += 1\r\n return ans\r\n\r\nresult = find_suitable_vest(n,m,x,y,a,b)\r\nprint (len(result))\r\nfor x in result:\r\n print (x[0], x[1])", "# from __future__ import print_function\n# python 3 default\n\ndef solve(n, m, x, y, A, B):\n# results = [-1] * n\n pair = []\n j = 0\n for i in range(n):\n while j < m:\n # If bj too small. Increase i\n if B[j] < A[i] - x:\n j += 1\n continue \n \n # If B[j] is to big for A[i]\n if B[j] > A[i] + y:\n break\n \n # A[i] - x <= B[j] <= A[i] + y\n pair.append((i+1, j+1))\n j += 1\n# print(\"PAIR: i = {} ; j = {}\".format(i, j))\n break\n \n # j is smallest nhat B[j] >= A[i] - x:\n# print(\"i = {} ; j = {}\".format(i, j))\n \n print(len(pair))\n for x, y in pair:\n print(x, y)\n\ndef main():\n n, m, x, y = [int(x) for x in input().strip().split()]\n A = [int(x) for x in input().strip().split()]\n B = [int(x) for x in input().strip().split()]\n\n solve(n, m, x, y, A, B)\n\nif __name__ == '__main__':\n main()\n", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ni = 0\r\nlist = []\r\nfor j in range(m):\r\n while i < n and a[i] + y < b[j]:\r\n i += 1\r\n if i < n and a[i] - x <= b[j] <= a[i] + y:\r\n list.append((i + 1, j + 1))\r\n i += 1\r\n\r\n\r\nprint(len(list))\r\nfor i in range(len(list)):\r\n print(list[i][0], list[i][1])", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nu = []\r\nv = []\r\ni = j = 0\r\nwhile i < n and j < m:\r\n if (a[i] - x <= b[j]) and (b[j] <= a[i] + y):\r\n u.append(i + 1)\r\n v.append(j + 1)\r\n i += 1\r\n j += 1\r\n elif (b[j] < a[i] - x):\r\n j += 1\r\n elif (b[j] > a[i] + y):\r\n i += 1\r\nans = len(u)\r\n\r\nprint(ans)\r\nfor i in range(ans):\r\n print(u[i], v[i])", "I = lambda: list(map(int, input().split()))\r\nn, m, x, y = I()\r\na, b = I(), I()\r\nl = []\r\nj = 0\r\nfor i in range(n):\r\n while j < m and b[j] <= a[i] + y:\r\n if a[i] - x <= b[j]:\r\n j += 1\r\n l += [(i + 1, j)]\r\n break\r\n j += 1\r\nprint(len(l))\r\nfor i, j in l:\r\n print(i, j)", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\ni = j = 0\r\np = []\r\n\r\nwhile i < n:\r\n\twhile j < m and b[j] <= a[i] + y:\r\n\t\tif a[i] - x <= b[j]:\r\n\t\t\tj += 1\r\n\t\t\tp.append([i + 1, j])\r\n\t\t\tbreak\r\n\t\tj += 1\r\n\ti += 1\r\n\r\nprint(len(p))\r\nfor a in p:\r\n\tprint(a[0], a[1])\r\n\t\r\n", "n, m, x, y = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\ncount = 0\ni = j = 0\nwhile i < n and j < m:\n if b[j] > a[i] + y:\n i += 1\n elif b[j] < a[i] - x:\n j += 1\n else:\n i += 1\n j += 1\n a[count] = i\n b[count] = j\n count += 1\nprint(count)\nfor x in range(count):\n print(a[x], b[x], sep = ' ')", "cnt=0\r\nn,m,x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nd=[]\r\n\r\ni=0\r\nj=0\r\nwhile i<n and j<m:\r\n if b[j]<a[i]-x:\r\n j+=1\r\n elif b[j]>a[i]+y:\r\n i+=1\r\n else:\r\n c.append(i+1)\r\n d.append(j+1)\r\n cnt+=1\r\n i+=1\r\n j+=1\r\n \r\nprint(cnt)\r\nfor i in range(0,cnt):\r\n print(c[i],\" \",d[i])", "def solve(N, M, X, Y, A, B):\r\n for i in range(N):\r\n A[i] = int(A[i])\r\n for i in range(M):\r\n B[i] = int(B[i])\r\n u = []\r\n v = []\r\n count = 0\r\n i = 0\r\n j = 0\r\n while (i < N and j < M):\r\n if (A[i] - X <= B[j] <= A[i] + Y):\r\n count += 1\r\n u.append(i)\r\n v.append(j)\r\n i += 1\r\n j += 1\r\n elif (A[i] - X > B[j]):\r\n j += 1\r\n else:\r\n i += 1\r\n print(count)\r\n for i in range(count):\r\n print(u[i] + 1,v[i] + 1)\r\n\r\n\r\nnum_input = input()\r\nnum_input = num_input.split(\" \")\r\nN = int(num_input[0])\r\nM = int(num_input[1])\r\nX = int(num_input[2])\r\nY = int(num_input[3])\r\n\r\nA = input()\r\nA = A.split(\" \")\r\n\r\nB = input()\r\nB = B.split(\" \")\r\n\r\nsolve(N, M, X, Y, A, B)", "n,m,x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ni = 0\r\nj = 0\r\ntemp = []\r\n\r\n#Choose every Soldier\r\nwhile i < n and j < m:\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n temp.append((i + 1, j + 1))\r\n i += 1\r\n j += 1\r\n elif a[i] + y < b[j]:\r\n i += 1\r\n elif a[i] - x > b[j]:\r\n j += 1\r\n\r\n\r\n \r\nprint(len(temp))\r\nfor pair in temp:\r\n print(*pair)", "n,m,x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nans,i,j=[],0,0\r\nwhile i<n:\r\n while j<m and b[j]<=a[i]+y:\r\n if a[i]-x<=b[j]:\r\n j+=1\r\n ans.append([i+1,j])\r\n break\r\n j+=1\r\n i+=1\r\nprint(len(ans))\r\nfor x,y in ans:print(x,y)\r\n", "n,m,x,y=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\ncnt1=0\r\ncnt2=0\r\nans=[]\r\nwhile True:\r\n\tif a[cnt1]-x<=b[cnt2] and a[cnt1]+y>=b[cnt2]:\r\n\t\tans.append([cnt1+1,cnt2+1])\r\n\t\tcnt1+=1\r\n\t\tcnt2+=1\r\n\telif a[cnt1]-x>b[cnt2]:\r\n\t\tcnt2+=1\r\n\telif a[cnt1]+y<b[cnt2]:\r\n\t\tcnt1+=1\r\n\tif cnt1==n or cnt2==m:\r\n\t\tbreak\r\nlns=len(ans)\r\nprint(lns)\r\nfor t in ans:\r\n\tprint(str(t[0])+\" \"+str(t[1]))\r\n", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\npairs = {}\r\nsoldier_counter = 0\r\nvest_counter = 0\r\nwhile soldier_counter < len(a) and vest_counter < len(b):\r\n\tif a[soldier_counter] + y < b[vest_counter]:\r\n\t\tsoldier_counter += 1\r\n\telif a[soldier_counter] - x > b[vest_counter]:\r\n\t\tvest_counter += 1\r\n\telse:\r\n\t\tpairs[soldier_counter+1] = vest_counter+1\r\n\t\tsoldier_counter += 1\r\n\t\tvest_counter += 1\r\nprint(len(pairs))\r\nfor soldier_num, vest_num in pairs.items():\r\n\tprint(soldier_num, vest_num)", "def main():\r\n nk = list(map(int, input(\"\").split()))\r\n list1 = list(map(int, input(\"\").split()))\r\n list2 = list(map(int, input(\"\").split()))\r\n a1 = [0] * len(list1) # max\r\n a2 = [0] * len(list1) # min\r\n n = nk[0]\r\n m = nk[1]\r\n x = nk[2]\r\n y = nk[3]\r\n i = 0\r\n j = 0\r\n count = 0\r\n for k in range(0, len(list1)):\r\n a1[k] = list1[k] + y\r\n a2[k] = list1[k] - x\r\n result = []\r\n while j < len(list2) and i < len(list1):\r\n max = a1[i]\r\n min = a2[i]\r\n cur = list2[j]\r\n if cur >= min and cur <= max:\r\n i += 1\r\n j += 1\r\n count += 1\r\n result.append(\"{} {}\".format(i, j))\r\n elif cur > max:\r\n i += 1\r\n elif cur < min:\r\n j += 1\r\n\r\n print(count)\r\n for item in result:\r\n print(item)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ni = 0\r\nans = []\r\nfor j, size in enumerate(b):\r\n while i < n and size > a[i] + y:\r\n i += 1\r\n if i == n: break\r\n if (a[i]-x) <= size <= (a[i]+y):\r\n ans.append((i + 1, j + 1))\r\n i += 1\r\nprint(len(ans))\r\nfor size, coat in ans:\r\n print(size, coat)", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nj = 0\r\nu = []\r\nv = []\r\nfor i in range(n):\r\n while j < m and b[j] < a[i] - x:\r\n j += 1\r\n if j < m and b[j] <= a[i] + y: \r\n u.append(i + 1)\r\n v.append(j + 1)\r\n j += 1\r\n\r\nprint(len(u))\r\nfor i in range(len(u)):\r\n print(u[i], v[i])\r\n\r\n", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nisEquipped_a = []\r\n\r\nfor i in range(n):\r\n isEquipped_a.append(False)\r\n\r\nres_a = []\r\nres_b = []\r\n\r\ni = j = 0\r\ncnt = 0\r\nwhile (i < n and j < m):\r\n if (isEquipped_a[i] == False):\r\n if (b[j] < a[i]-x):\r\n j += 1\r\n elif (b[j] > a[i]+y):\r\n i += 1\r\n elif (b[j] <= a[i]+y and b[j] >= a[i]-x):\r\n isEquipped_a[i] = True\r\n res_a.append(i+1)\r\n res_b.append(j+1)\r\n cnt += 1\r\n i += 1\r\n j += 1\r\n else:\r\n i += 1\r\n\r\nprint(cnt)\r\nfor t in range(cnt):\r\n print(res_a[t], res_b[t])\r\n", "#Vest them all\r\nfirst = input('').split()\r\nn = int(first[0])\r\nm = int(first[1])\r\nx = int(first[2])\r\ny = int(first[3])\r\n\r\na = list(map(int,input('').split()))\r\nb = list(map(int,input('').split()))\r\ni = 0\r\nj = 0\r\ncount = 0\r\nd = dict()\r\n\r\nwhile (i < n) or (j < m):\r\n if (i < n) and (j < m):\r\n if a[i] - x <= b[j] and b[j] <= a[i] + y:\r\n count += 1\r\n d[i+1] = j+1\r\n i += 1\r\n j += 1\r\n elif a[i] - x > b[j]:\r\n j += 1\r\n elif a[i] + y < b[j]:\r\n i += 1\r\n elif i < n:\r\n break\r\n elif j < m:\r\n break\r\n\r\nprint(count)\r\nfor key, value in d.items():\r\n print(key, value)\r\n \r\n \r\n", "n, m, x, y = map(int,input().split())\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\nindexA = 0\nindexB = 0\ntotal = 0\narr = []\nwhile indexA < n:\n if indexB == m:\n break\n if a[indexA] - x <= b[indexB] and b[indexB] <= a[indexA] + y:\n indexA += 1\n indexB += 1\n total += 1\n arr.append(str(indexA) + \" \" + str(indexB))\n elif b[indexB] < a[indexA] - x:\n indexB += 1\n else:\n indexA += 1\nprint(total)\nfor i in range(len(arr)):\n print(arr[i])", "def DressemInVests(nmxy, a, b):\n result = []\n j = 0\n for i in range(nmxy[1]):\n while j < nmxy[0] and a[j] + nmxy[3] < b[i]:\n j += 1\n if j == nmxy[0]:\n break\n if a[j] - nmxy[2] <= b[i] <= a[j] + nmxy[3]:\n result.append([j + 1, i + 1])\n j += 1\n print(len(result))\n for i in result:\n print(i[0], i[1])\n\n\nnmxy = [int(x) for x in input().split()]\na = [int(y) for y in input().split()]\nb = [int(z) for z in input().split()]\n\nDressemInVests(nmxy, a, b)\n", "a,b,c,d=map(int,input().split())\r\nz=list(map(int,input().split()))\r\nz1=list(map(int,input().split()))\r\nj=0;p=[]\r\nfor i in range(a):\r\n while j<b :\r\n if z[i]-c<=z1[j]<=z[i]+d:p+=[[i+1,j+1]];j+=1;break\r\n elif z[i]+d<z1[j]:break\r\n else:j+=1\r\nprint(len(p))\r\nfor i in p:print(*i)", "#Dress'em in Vests!\r\n\r\nn, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nv = []\r\nj = 0\r\ncount = 0\r\nfor i in range(len(a)):\r\n while j < m and b[j] < a[i] - x:\r\n j += 1\r\n\r\n if j == m:\r\n break\r\n\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n v.append((i + 1, j + 1))\r\n count += 1\r\n j += 1\r\n\r\nprint(count)\r\nfor vest in v:\r\n print(vest[0], vest[1])", "def main():\n n, m, x, y = map(int, input().split())\n aa = list(map(int, input().split()))\n it, res, b, f = iter(enumerate(map(int, input().split()), 1)), [], -x, ' '.join\n try:\n for i, a in enumerate(aa, 1):\n while b < a - x:\n j, b = next(it)\n if b <= a + y:\n res.append(f((str(i), str(j))))\n j, b = next(it)\n except StopIteration:\n pass\n print(len(res))\n print('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "class Solution(object):\n\n def __init__(self):\n soldier_num, vest_num, x, y = map(int, input().split())\n soldiers = list(map(int, input().split()))\n vests = list(map(int, input().split()))\n\n self.soldier_num = soldier_num\n self.vest_num = vest_num\n self.x = x\n self.y = y\n self.soldiers = soldiers\n self.vests = vests\n\n def assign(self):\n vest_index = 0\n soldier_index = 0\n results = []\n if self.soldier_num == 0 or self.vests == 0:\n print(\"0\")\n return\n while True:\n new_soldier_index, new_vest_index = self.drop_too_small(\n soldier_index, vest_index)\n if new_soldier_index is None:\n break\n if (new_soldier_index, new_vest_index) != (soldier_index, vest_index):\n soldier_index, vest_index = new_soldier_index, new_vest_index\n continue\n\n\n results.append((soldier_index+1, vest_index+1))\n soldier_index += 1\n vest_index += 1\n if soldier_index >= self.soldier_num or vest_index >= self.vest_num:\n break\n\n print(len(results))\n for result in results:\n print(result[0], result[1])\n\n def drop_too_small(self, s_index, v_index):\n for v in range(v_index, self.vest_num):\n v_index = v\n if self.vests[v] >= self.soldiers[s_index] - self.x:\n break\n if v_index == self.vest_num -1:\n return None, None\n for s in range(s_index, self.soldier_num):\n s_index = s\n if self.soldiers[s] >= self.vests[v_index] - self.y:\n break\n if s_index == self.soldier_num -1:\n return None, None\n return s_index, v_index\n\n\ns = Solution()\ns.assign()\n\t \t\t \t\t \t \t\t \t\t\t \t \t \t \t\t\t\t \t", "n,m,x,y = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\nans = []\r\ni = 0\r\nj = 0\r\nwhile i<n and j<m:\r\n if a[i]-x <= b[j] <= a[i]+y:\r\n ans.append((i+1,j+1))\r\n i+=1\r\n j+=1\r\n elif a[i]+y < b[j]:\r\n i+=1\r\n elif a[i]-x > b[j]:\r\n j+=1\r\nprint(len(ans))\r\nfor x in ans:\r\n print(*x)\r\n ", "n,m,x,y=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nnewa=[(x,i+1) for i,x in enumerate(a)]\r\nnewb=[(x,i+1) for i,x in enumerate(b)]\r\nnewa.sort()\r\nnewb.sort()\r\ni=j=0\r\nans=[]\r\nwhile i<n and j<m:\r\n if newa[i][0]-x>newb[j][0]:\r\n j+=1\r\n elif newa[i][0]+y < newb[j][0]:\r\n i+=1\r\n else:\r\n ans.append((newa[i][1],newb[j][1]))\r\n i+=1\r\n j+=1\r\n#print(ans)\r\nprint(len(ans))\r\nfor u,v in ans:\r\n print(u,v)\r\n \r\n", "def inp():\r\n return map(int, input().split())\r\n\r\nn, m, x, y = inp()\r\na = list(inp())\r\nb = list(inp())\r\nsolider = []\r\nvest = []\r\n\r\nj = i = cnt = 0\r\nfor i in range(m):\r\n if j > n - 1:\r\n break\r\n while (j < n and (a[j] + y < b[i])):\r\n j += 1\r\n if j < n:\r\n if (a[j] - x <= b[i] <= a[j] + y):\r\n solider.append(j + 1)\r\n vest.append(i + 1)\r\n j += 1\r\n\r\nprint(len(vest))\r\nfor i in range(len(vest)):\r\n print(str(solider[i]) + ' ' + str(vest[i]))\r\n\r\n", "n, m, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\ni = j = 0\r\nk = 0\r\nres = []\r\n\r\nwhile i < n and j < m:\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n k += 1\r\n res.append([i + 1, j + 1])\r\n i += 1\r\n j += 1\r\n elif b[j] < a[i] - x:\r\n j += 1\r\n elif a[i] + y < b[j]:\r\n i += 1\r\n\r\nprint(k)\r\nfor x in res:\r\n print(x[0], end = ' ')\r\n print(x[1])", "inp1 = [int(i) for i in input().split(\" \")]\r\ninp2,x,y = [],inp1[2],inp1[3]\r\n[inp2.append([int(i)-x,int(i)+y]) for i in input().split(\" \")]\r\ninp3 = [int(i) for i in input().split(\" \")]\r\n\r\nresult = []\r\nlength_inp2 = len(inp2)\r\nlength_inp3 = len(inp3)\r\nj = i =0\r\nwhile i < length_inp3 and j < length_inp2:\r\n if inp2[j][0] <= inp3[i] <= inp2[j][1] :\r\n i+=1\r\n j+=1\r\n result.append(str(j)+\" \"+str(i))\r\n elif inp3[i] > inp2[j][1]:\r\n j+=1\r\n elif inp3[i] < inp2[j][0]:\r\n i+=1\r\n\r\nprint(len(result))\r\nprint('\\n'.join(result))", "n,m,x,y = list(map(int,input().split()))\na = list(map(int,input().split()))\nb = list(map(int,input().split()))\ni,j=0,0\ns = 0\nd = []\nwhile i<n and j<m:\n if a[i]-x <= b[j] and a[i]+y >= b[j]:\n s+=1\n i+=1\n j+=1\n d.append([i,j])\n elif b[j] < a[i]-x:\n j+=1\n elif b[j] > a[i]+y:\n i+=1\nprint(s)\nfor i in d:\n print(*i)", "n, m, a, b = map(int, input().split())\r\ns1 = list(map(int, input().split())) # Рыцари\r\ns2 = list(map(int, input().split())) # Жилеты\r\ni = 0\r\nj = 0\r\nans = 0\r\nres = []\r\nwhile i < n and j < m:\r\n x = s1[i] - a\r\n y = s1[i] + b\r\n if s2[j] <= y and s2[j] >= x:\r\n ans += 1\r\n i += 1\r\n j += 1\r\n res.append([i, j])\r\n elif s2[j] > y:\r\n i += 1\r\n else:\r\n j += 1\r\nprint(ans)\r\n[print(x[0], x[1]) for x in res]\r\n\r\n\n# Tue Jul 05 2022 09:22:34 GMT+0000 (Coordinated Universal Time)\n", "class Element:\n def __init__(self, man, vest):\n self.man = man\n self.vest = vest\n\ndef solve():\n n, m, x, y = map(int, input().strip().split())\n a = list(map(int, input().strip().split()))\n b = list(map(int, input().strip().split()))\n ans = []\n p = 0\n q = 0\n while p < n and q < m:\n if a[p] - x <= b[q] and b[q] <= a[p] + y:\n ans.append(Element(p + 1, q + 1))\n p += 1\n q += 1\n elif b[q] < a[p] - x:\n q += 1\n else:\n p += 1\n print(len(ans))\n for element in ans:\n print(element.man, element.vest)\n\nsolve()", "n,m,x,y = map(int, input().rstrip().split())\ndesired = list(map(int,input().rstrip().split()))\nsize = list(map(int, input().rstrip().split()))\na = b = k = 0\nresults = []\n\n#slices through desired sizes and the available sizes, if matches, print out that match. If not, check if the desired\n#size is less then the available size, move the desired to the next. Otherwise, move the available size to the next one.\n# Return the process till the end.\nwhile (a < n) & (b < m):\n\n if (desired[a] - x) <= (size[b]) <= (desired[a] + y):\n k += 1\n results.append([a+1, b+1])\n a += 1\n b+= 1\n\n elif (desired[a] - x) > (size[b]):\n b += 1\n\n elif (size[b]) > (desired[a] + y):\n a += 1\n\nprint(k)\n\nfor result in results:\n print(' '.join(str(c) for c in result))", "n,m,x,y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\npair = []\r\ni = 0\r\nj = 0\r\n\r\nwhile i < n and j < m :\r\n if(a[i]-x <= b[j] and a[i]+y >= b[j]):\r\n pair.append([i,j])\r\n i += 1\r\n j += 1\r\n elif a[i] - x > b[j]:\r\n j += 1\r\n else:\r\n i += 1\r\n\r\nprint(len(pair))\r\nfor k in range(len(pair)):\r\n print('{0} {1}'.format(pair[k][0]+1, pair[k][1]+1))", "first_line = list(map(int, input().split()))\r\nn = first_line[0] # number of soldiers\r\nm = first_line[1] # number of vests\r\nx = first_line[2] # soldier's unpretentiousness indicator\r\ny = first_line[3] # soldier's unpretentiousness indicator\r\n\r\na = list(map(int, input().split())) # desired sizes\r\nb = list(map(int, input().split())) # available sizes\r\n\r\ndef main():\r\n count = 0 # number of soldiers that can be provided with vests\r\n ans = []\r\n \r\n i, j = 0, 0\r\n while i < n and j < m:\r\n \r\n if a[i] - x <= b[j] and b[j] <= a[i] + y:\r\n # soldier ith can wear the jth vest,\r\n # so we try the next pair\r\n count += 1\r\n ans.append(str(i+1) + ' ' + str(j+1))\r\n \r\n i += 1\r\n j += 1\r\n \r\n elif a[i] - x > b[j]:\r\n # vest jth is too small, so we give\r\n # soldier ith the next vest to try on \r\n \r\n j += 1\r\n # note: here we don't increase i because the next\r\n # soldiers are no smaller in sizes than soldier ith,\r\n # so the vest will still be too small for the next \r\n # soldier in line\r\n \r\n elif a[i] + y < b[j]:\r\n # vest jth is too big, so we let the next soldier\r\n # in line try on the vest\r\n \r\n i += 1\r\n # note: here we don't increase j as the next vests in line\r\n # will just keep getting bigger, so soldier ith will not\r\n # be able to find a vest that suits him.\r\n \r\n print(count)\r\n for p in ans:\r\n print(p)\r\n \r\n return \r\n\r\nif __name__ == '__main__':\r\n main()\r\n \r\n \r\n\r\n", "n, m, x, y = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ncount = 0\ni = j = 0\n# for i in range(n):\n# if a[i] >= b[j] - x and a[i] <= b[j] + y:\n# b[j] = i + 1\n# j += 1\nwhile i < n and j < m:\n if b[j] < a[i] - x:\n j += 1\n elif b[j] > a[i] + y:\n i += 1\n else:\n i += 1\n j += 1\n a[count] = i\n b[count] = j\n count += 1\n\n# print(j)\n# for i in range(j):\n# print(b[i], i + 1, sep = ' ')\nprint(count)\nfor x in range(count):\n print(a[x], b[x], sep=' ')", "def main():\r\n nmxy=input().split(' ')\r\n army=input().split(' ')\r\n vest=input().split(' ')\r\n result=0\r\n detail=[]\r\n j=0\r\n for i in range(len(army)):\r\n while j<int(nmxy[1]) and int(army[i])-int(nmxy[2])> int(vest[j]):\r\n j+=1\r\n if j<int(nmxy[1]):\r\n if int(army[i])+int(nmxy[3])>= int(vest[j]):\r\n result+=1\r\n detail.append((i+1,j+1))\r\n j+=1\r\n else:\r\n break\r\n \r\n print(result)\r\n for i in detail:\r\n print(i[0],i[1])\r\nif __name__ == \"__main__\":\r\n main()", "n, m, x, y = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\ncount = 0\r\nresult = []\r\nfor i in range(n):\r\n\tif count == m:\r\n\t\tbreak\r\n\tfor j in range(count, m):\r\n\t\tif b[j] < a[i] - x:\r\n\t\t\tcount += 1\r\n\t\tif b[j] > a[i] + y:\r\n\t\t\tbreak\r\n\t\tif ((a[i] - x <= b[j]) & (b[j] <= a[i] + y)):\r\n\t\t\tresult.append(str(i + 1) + \" \" + str(j + 1))\r\n\t\t\tcount += 1\r\n\t\t\tbreak\r\n \r\nprint(len(result))\r\nfor a in result:\r\n\tprint(a)", "m, n, x, y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = []\r\ni = j = 0\r\nwhile i<m and j<n:\r\n if a[i]-x<=b[j] and a[i]+y>=b[j]:\r\n ans.append([i+1,j+1])\r\n i+=1\r\n j+=1\r\n elif a[i]-x<=b[j]:\r\n i+=1\r\n else:\r\n j+=1\r\n\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)", "\n\nfirst_line = input().split()\nn = int(first_line[0])\nm = int(first_line[1])\nx = int(first_line[2])\ny = int(first_line[3])\n\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nsum = 0\npairs = []\np_a = n - 1\np_b = m - 1\n\nwhile p_a >= 0 and p_b >= 0:\n if a[p_a]-x <= b[p_b] and b[p_b] <= a[p_a]+y:\n sum += 1\n pairs.append([p_a+1, p_b+1])\n p_a -= 1\n p_b -= 1\n else:\n if b[p_b] > a[p_a] + y:\n p_b -= 1\n else:\n p_a -= 1\n\nprint(sum)\nfor i in pairs:\n print(i[0], i[1])\n", "def find_vest(num_soliders, num_vests, lower_bound, upper_bound,\\\r\n solider_sizes, vest_sizes):\r\n vest_pointer = 0\r\n solider_pointer = 0\r\n results = []\r\n while (vest_pointer < num_vests) and (solider_pointer < num_soliders):\r\n smallest_size = solider_sizes[solider_pointer] - lower_bound\r\n biggest_size = solider_sizes[solider_pointer] + upper_bound\r\n if vest_sizes[vest_pointer] >= smallest_size\\\r\n and vest_sizes[vest_pointer] <= biggest_size:\r\n results.append((solider_pointer + 1, vest_pointer + 1))\r\n vest_pointer += 1\r\n solider_pointer += 1\r\n elif biggest_size < vest_sizes[vest_pointer]:\r\n solider_pointer += 1\r\n elif smallest_size > vest_sizes[vest_pointer]:\r\n vest_pointer += 1\r\n return results\r\n\r\nif __name__ == '__main__':\r\n num_soliders, num_vests,\\\r\n lower_bound, upper_bound = list(map(int, input().split()))\r\n solider_sizes = list(map(int, input().split()))\r\n vest_sizes = list(map(int, input().split()))\r\n results = find_vest(num_soliders, num_vests, lower_bound, upper_bound,\\\r\n solider_sizes, vest_sizes)\r\n print(len(results))\r\n for result in results:\r\n print(result[0], result[1])", "soldiers, bpVests, x, y = map(int, input().split())\r\nsizes = list(map(int, input().split()))\r\navailableVests = list(map(int, input().split()))\r\n\r\nans, i, j = [], 0, 0\r\n\r\nwhile i < soldiers:\r\n if j >= bpVests:\r\n break\r\n if sizes[i] - x > availableVests[j]:\r\n j = j + 1\r\n continue\r\n elif sizes[i] + y < availableVests[j]:\r\n i = i + 1\r\n else:\r\n ans.append((i+1, j+1))\r\n i = i + 1\r\n j = j + 1\r\n\r\nprint(len(ans))\r\nfor i, j in ans:\r\n print(f\"{i} {j}\")", "n,m,x,y = [int(x) for x in input().split()]\r\n\r\na = [int(x) for x in input().split()]\r\n\r\nb = [int(x) for x in input().split()]\r\n\r\nj = 0\r\ni = 0\r\nans = []\r\nwhile i < n and j < m:\r\n if len(ans) >= m:\r\n break\r\n if a[i] - x <= b[j] and b[j] <= a[i] + y:\r\n ans.append((i+1, j+1))\r\n j += 1\r\n i += 1\r\n elif a[i] - x > b[j]:\r\n j += 1\r\n elif a[i] + y < b[j]:\r\n i += 1\r\n\r\nprint(len(ans))\r\nfor t in ans:\r\n print(t[0], t[1])", "n, m, x, y = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\ni = j = 0\np = []\n\nwhile i < n:\n\twhile j < m and b[j] <= a[i] + y:\n\t\tif a[i] - x <= b[j]:\n\t\t\tj += 1\n\t\t\tp.append([i + 1, j])\n\t\t\tbreak\n\t\tj += 1\n\ti += 1\n\nprint(len(p))\nfor a in p:\n\tprint(a[0], a[1])\n\n# I = lambda: map(int, raw_input().split())\n# n, m, x, y = I()\n# a, b = I(), I()\n# l = []\n# j = 0\n# for i in range(n):\n# while j < m and b[j] <= a[i] + y:\n# if a[i] - x <= b[j]:\n# j += 1\n# l += [(i + 1, j)]\n# break\n# j += 1\n# print(len(l))\n# for i, j in l:\n# print(i, j)", "n,m,x,y = map(int, input().split())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\n\nl = []\nj = 0\n\nfor i in range(n):\n while j < m and b[j] <= a[i] + y:\n if a[i] - x <= b[j]:\n j += 1\n l += [(i + 1, j)]\n break\n j += 1\n\nprint(len(l))\n\nfor i, j in l:\n print(i, j)\n \t\t \t\t\t\t \t\t\t \t\t\t\t \t \t \t\t \t", "n,m,x,y = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nj = cnt = 0\r\nl = []\r\nr = []\r\nfor i in range(n):\r\n while j < m and b[j] < a[i] - x:\r\n j += 1\r\n if j == m:\r\n break\r\n if a[i] - x <= b[j] <= a[i] + y:\r\n l.append(i+1)\r\n r.append(j+1)\r\n cnt += 1\r\n j += 1\r\nprint(cnt)\r\nfor i in range(cnt):\r\n print('{} {}'.format(l[i],r[i]))\r\n", "n_soldiers, n_vests, x, y = [int(arg) for arg in input().split()]\ndesired_sizes = [int(arg) for arg in input().split()]\nvest_sizes = [int(arg) for arg in input().split()]\n\npairs = []\ncurrent_soldier = 0\ncurrent_vest = 0\n\nwhile current_soldier < n_soldiers and current_vest < n_vests:\n \n if desired_sizes[current_soldier] - x <= vest_sizes[current_vest] \\\n and desired_sizes[current_soldier] + y >= vest_sizes[current_vest]:\n\n pairs.append((current_soldier + 1, current_vest + 1))\n current_soldier += 1\n current_vest += 1\n\n elif vest_sizes[current_vest] < desired_sizes[current_soldier] - x:\n current_vest += 1\n\n elif vest_sizes[current_vest] > desired_sizes[current_soldier] + y:\n current_soldier += 1\n\nprint(len(pairs))\nfor pair in pairs:\n print(pair[0], pair[1])\n", "N, M, X, Y = map(int, input().split())\r\ni = 0\r\ndef range_tuple(num):\r\n global i\r\n i += 1\r\n num = int(num)\r\n return (num - X, num + Y, i)\r\ndef tupler(num):\r\n global i\r\n i += 1\r\n num = int(num)\r\n return (num, i)\r\ndesired = sorted(map(range_tuple, input().split()))\r\ni = 0\r\navailable = sorted(map(tupler, input().split()))\r\ndes_ptr = 0\r\nava_ptr = 0\r\nans = []\r\nwhile des_ptr < N and ava_ptr < M:\r\n if desired[des_ptr][1] < available[ava_ptr][0]:\r\n des_ptr += 1\r\n elif available[ava_ptr][0] < desired[des_ptr][0]:\r\n ava_ptr += 1\r\n else:\r\n ans.append((desired[des_ptr][2], available[ava_ptr][1]))\r\n des_ptr += 1\r\n ava_ptr += 1\r\nprint(len(ans))\r\nfor d, a in ans:\r\n print(d, a)", "n,m,x,y=[int(x) for x in input().split()]\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\n\r\ndef dress(a,b,x,y):\r\n l = []\r\n j = 0\r\n for i in range(n):\r\n while j < m and b[j] <= a[i] + y:\r\n if a[i] - x <= b[j]:\r\n j += 1\r\n l += [(i + 1, j)]\r\n break\r\n j += 1\r\n print (len(l))\r\n for i, j in l:\r\n print (i, j)\r\ndress(a,b,x,y)", "n, m, x, y = map(int, input().split())\r\nsize = [int(i) for i in input().split()]\r\nvest = [int(i) for i in input().split()]\r\n\r\ni = j = 0\r\nbest = list()\r\n\r\nwhile i < n and j < m:\r\n\tif size[i]-x <= vest[j] <= size[i]+y:\r\n\t\tbest.append((i, j))\r\n\t\ti+=1\r\n\t\tj+=1\r\n\telif vest[j] > size[i]+y:\r\n\t\ti+=1\r\n\telse:\r\n\t\tj+=1\r\nprint(len(best))\r\nfor i in range(len(best)):\r\n\tprint(\"%d %d\" %(best[i][0]+1, best[i][1]+1))", "n, m, x, y = map(int,input().split())\r\nA = list(map(int,input().split()))\r\nB = list(map(int,input().split()))\r\ni = 0\r\nj = 0\r\ncount = 0\r\nAc = []\r\nBc = []\r\nwhile i<n and j<m:\r\n if A[i] - x <= B[j] <= A[i]+y:\r\n count += 1\r\n Ac.append(i+1)\r\n Bc.append(j+1)\r\n i += 1\r\n j += 1\r\n elif A[i] - x > B[j]:\r\n j += 1\r\n elif A[i] + y < B [j]:\r\n i += 1\r\nprint (count)\r\nfor x in range (count):\r\n print (Ac[x],Bc[x])", "m, n, x, y = map(int, input().split())\r\na, b = list(map(int, input().split())) + [2 * 10 ** 9], list(map(int, input().split()))\r\nans, j = [], 0\r\nfor i, t in enumerate(b):\r\n while a[j] + y < t: j += 1\r\n if a[j] - x > t: continue\r\n ans.append([j, i])\r\n j += 1\r\nprint(len(ans))\r\nfor i, j in ans:\r\n print(i + 1, j + 1)" ]

[ "def input_ints():\r\n return list(map(int, input().split()))\r\n\r\ndef main():\r\n n = int(input())\r\n ans = []\r\n for x in range(2, n + 1):\r\n s = set()\r\n xx = x\r\n for y in range(2, n + 1):\r\n while xx % y == 0:\r\n xx /= y\r\n s.add(y)\r\n if len(s) == 1:\r\n ans.append(x)\r\n print(len(ans))\r\n print(' '.join(str(x) for x in ans))\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nquest = []\r\nfor i in range(2, n + 1):\r\n if all(i % q != 0 for q in quest):\r\n\t x = i\r\n\t while x <= n:\r\n\t\t quest.append(x)\r\n\t\t x *= i\r\nprint(len(quest))\r\nprint(' '.join(str(q) for q in quest))\r\n", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().strip('\\n').split()))\nMI=lambda:map(int, sys.stdin.readline().strip('\\n').split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline().strip('\\n'))\n\nn=II()\ncheck=[True]*(n+1)\nprimes=[]\nfor i in range(2, n+1):\n\tif check[i]:\n\t\tprimes.append(i)\n\t\tfor j in range(i+i, n+1, i):\n\t\t\tcheck[j]=False\nans=[]\nfor p in primes:\n\tj=1\n\twhile p**j<=n:\n\t\tans.append(p**j)\n\t\tj+=1\nprint(len(ans))\nprint(*ans)", "import math\nn = int(input())\n\nl = []\n\nfor i in range(2, n+1):\n ok = 1\n for j in l:\n if(i%j == 0):\n ok = 0\n break\n if(ok == 1):\n l.append(i)\n\nfinal = []\ncontador = 0\nfor i in l:\n v = i\n final.append(v)\n contador += 1\n while v * i <= n:\n v *= i\n final.append(v)\n contador += 1\n\nprint(contador)\nprint(*final)", "def prog():\r\n n = int(input())\r\n primes = [True for i in range(n+1)]\r\n for p in range(2,int(n**0.5)+1):\r\n if primes[p]:\r\n for num in range(p**2,n+1,p):\r\n primes[num] = False\r\n sequence = []\r\n for num in range(2,n+1):\r\n if primes[num] == True:\r\n num_pow = num\r\n while num_pow <= n:\r\n sequence.append(str(num_pow))\r\n num_pow *= num\r\n print(len(sequence))\r\n print(\" \".join(sequence))\r\nprog()\r\n", "import sys, math\r\ninput = sys.stdin.readline\r\n\r\ndef getInts():\r\n return [int(s) for s in input().split()]\r\n\r\ndef getInt():\r\n return int(input())\r\n\r\ndef getStrs():\r\n return [s for s in input().split()]\r\n\r\ndef getStr():\r\n return input().strip()\r\n\r\ndef listStr():\r\n return list(input().strip())\r\n\r\nimport collections as col\r\nimport math\r\n\r\n\"\"\"\r\nGenerate all primes up to and including n\r\n\r\n\"\"\"\r\n\r\ndef primes(n):\r\n \"\"\" Returns a list of primes < n \"\"\"\r\n sieve = [True] * n\r\n z = int(n**0.5)+1\r\n for i in range(3,z,2):\r\n if sieve[i]:\r\n sieve[i*i::2*i]=[False]*((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\ndef solve():\r\n N = getInt()\r\n if N == 1:\r\n print(0)\r\n return\r\n P = primes(N+1)\r\n ans = []\r\n for p in P:\r\n power = 1\r\n while p**power <= N:\r\n ans.append(p**power)\r\n power += 1\r\n print(len(ans))\r\n print(*ans)\r\n return\r\n \r\nsolve()\r\n \r\n\r\n", "def get_primes(k):\r\n p = [True]*(k+1)\r\n p[0] = False\r\n p[1] = False\r\n for i in range(1,k+1):\r\n if p[i]:\r\n for j in range(2,k//i+1):\r\n p[i*j] = False\r\n pr = []\r\n for i in range(k+1):\r\n if p[i]:\r\n pr.append(i)\r\n return pr\r\nn = int(input())\r\np = get_primes(n+2)\r\nfrom math import log,floor\r\ns = 0\r\nb = []\r\nfor x in p:\r\n k = floor(log(n)/log(x))\r\n s += k\r\n for i in range(1,k+1):\r\n b.append(int(x**i))\r\nprint(int(s))\r\nfor x in b:\r\n print(x,end=' ')\r\nprint()", "n = int(input())\r\nl = []\r\nfor i in range(2, n + 1):\r\n for p in l:\r\n if i % p == 0:\r\n break\r\n else:\r\n el = i\r\n while el <= n:\r\n l.append(el)\r\n el *= i\r\n\r\nprint(len(l))\r\nprint(\" \".join([str(i) for i in l]))", "n = int(input())\r\nisc = [False] * (n + 1)\r\np = []\r\nans = []\r\nfor i in range(2, n + 1):\r\n if not isc[i]:\r\n p.append(i)\r\n j = i\r\n while j <= n:\r\n ans.append(j)\r\n j *= i\r\n for j in p:\r\n if i * j > n:\r\n break\r\n isc[i * j] = True\r\n if i % j == 0:\r\n break\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\nnprime = [False] * (n + 1)\r\nans = []\r\nfor i in range(2, n + 1):\r\n if nprime[i]:\r\n continue\r\n x = i\r\n while x <= n:\r\n ans.append(x)\r\n nprime[x] = True\r\n x *= i\r\n x = i\r\n while x <= n:\r\n nprime[x] = True\r\n x += i \r\n\r\nprint(len(ans))\r\nfor x in ans:\r\n print(x, end= \" \")\r\n ", "n = int(input())\na = [i+1 for i in range(n)]\n\nans = []\n\nfor i, x in enumerate(a):\n if x != 1:\n ans.append(i+1)\n for j in range(i, n):\n if a[j] % x == 0:\n a[j] //= x\n\nprint(len(ans))\nfor an in ans:\n print(an, end=\" \")\n\n\t\t \t \t \t\t \t\t \t\t\t", "n=int(input())\r\nans=[]\r\np=[0]*(n+1)\r\nfor i in range(2,n):\r\n if p[i]==0:\r\n for j in range(2*i,n+1,i):\r\n p[j]=1\r\nprimes=[]\r\nfor i in range(2,n+1):\r\n if p[i]==0:\r\n primes.append(i)\r\nfor i in primes:\r\n c=1\r\n while i**c<=n:\r\n ans.append(i**c)\r\n c+=1\r\nprint(len(ans))\r\nprint(*ans)", "from math import *\r\nfrom collections import *\r\nfrom random import *\r\nfrom bisect import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n if(n==1):\r\n print(0)\r\n continue\r\n if(n==2):\r\n print(1)\r\n print(2)\r\n continue\r\n r=[2]\r\n for i in range(3,n+1):\r\n if(i%2==0):\r\n continue\r\n c=0\r\n for j in range(3,int(pow(i,0.5))+1,2):\r\n if(i%j==0):\r\n c=1\r\n break\r\n if(c==0):\r\n r.append(i)\r\n f=set()\r\n for i in r:\r\n j=i\r\n while(j<=n):\r\n f.add(j)\r\n j=j*i\r\n print(len(f))\r\n print(*f)\r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\r\nres = []\r\nfor i in range(2, n + 1):\r\n for p in res:\r\n if i % p == 0:\r\n break\r\n else:\r\n el = i\r\n while el <= n:\r\n res.append(el)\r\n el *= i\r\nprint(len(res))\r\nprint(*res)", "n = int(input())\r\n \r\nprimes = []\r\nfor i in range(2, n + 1):\r\n for p in primes:\r\n if i % p == 0:\r\n break\r\n else:\r\n primes.append(i)\r\n \r\nasks = []\r\nfor p in primes:\r\n i = 1\r\n while p**i <= n:\r\n asks.append(p**i)\r\n i += 1\r\n \r\nprint(len(asks))\r\nprint(' '.join(map(str, asks)))\r\n", "from math import *\r\ndef isPrime(n) : \r\n \r\n \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n \r\n \r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \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\nn=int(input())\r\nans=[]\r\nfor i in range(2,n+1):\r\n if(isPrime(i)==1):\r\n \r\n ans.append(i)\r\n k=i\r\n while(k*i<=n):\r\n k*=i\r\n ans.append(k)\r\n \r\n \r\n \r\n \r\n \r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n ", "n = int(input())\r\naux = [0] * (n + 1)\r\nprimes = []\r\nfor i in range(2, n + 1):\r\n if aux[i] == 0:\r\n primes.append(i)\r\n t = i\r\n for j in range(i, n + 1, i):\r\n aux[j] = 1\r\n if j / i == t:\r\n primes.append(j)\r\n t = j\r\n \r\nprint(len(primes))\r\nprint(\" \".join(map(str, primes)))", "n=int(input())\r\narr=[True for i in range(n+1)]\r\nans=0\r\ncheck=True\r\nar=[]\r\nfor i in range(2,n+1):\r\n if arr[i]==False:\r\n continue\r\n for j in range(i*i,n+1,i):\r\n arr[j]=False\r\nfor i in range(2,n+1):\r\n if arr[i]==True:\r\n tm=i\r\n while tm<=n:\r\n ar.append(tm)\r\n tm*=i \r\n\r\nprint(len(ar))\r\nfor ele in ar:\r\n print(ele,end=\" \")\r\nprint()\r\n \r\n \r\n \r\n ", "#If you win, you live. You cannot win unless you fight.\r\n# remember hash hack use tuple\r\nimport string\r\nfrom sys import stdin,setrecursionlimit\r\ninput=stdin.readline\r\nrd=lambda: map(lambda s: int(s), input().strip().split())\r\nrdG=lambda: map(lambda s: int(s)-1, input().strip().split())\r\nri=lambda: int(input())\r\nrs=lambda :input().strip()\r\nsetrecursionlimit(10**5)\r\nfrom collections import defaultdict,deque,Counter\r\nfrom bisect import bisect_left as bl, bisect_right as br\r\nfrom math import gcd, ceil, floor,log2,factorial\r\nfrom copy import deepcopy\r\nfrom math import lcm\r\ndef fac(n):\r\n global ans\r\n i=2\r\n st=set([n])\r\n while i**2<=n:\r\n if n%i==0:\r\n st.add(i)\r\n st.add(n//i)\r\n i+=1\r\n return list(sorted(st,key=lambda s:ans.__contains__(s),reverse=True))\r\nn=ri()\r\nans=set()\r\nfor i in range(2,n+1):\r\n f=fac(i)\r\n lc=1\r\n tc=set()\r\n # print(f)\r\n while lc!=i:\r\n t=f.pop(0)\r\n lc=lcm(t,lc)\r\n tc.add(t)\r\n ans=ans.union(tc)\r\nprint(len(ans))\r\nprint(*ans)\r\n# print(ans)\r\n", "import math\r\nn=int(input())\r\ndef prime(n):\r\n xs=int(math.sqrt(n))\r\n for i in range(2,xs+1):\r\n if n%i==0:\r\n return False\r\n \r\n return True\r\n\r\nls=[]\r\nfor i in range(2,n+1):\r\n if prime(i):\r\n ls.append(i)\r\n\r\ntemp=[]\r\nfor i in range(len(ls)):\r\n xs=ls[i]\r\n j=xs*xs\r\n while j<=n:\r\n temp.append(j)\r\n j=xs*j\r\n\r\nls=ls+temp\r\nprint(len(ls))\r\nprint(*ls) ", "\nn = int(input())\n\ndef is_prime(n):\n p = 2\n while p*p <= n:\n if n % p == 0:\n return False\n p += 1\n return True\n\nassert(is_prime(7))\nassert(is_prime(47))\nassert(is_prime(29))\nassert(not is_prime(12))\nassert(not is_prime(49))\n\nasks = []\n\nprime = 2\nwhile prime <= n:\n k = 1\n while prime**k <= n:\n asks.append(prime**k)\n k += 1\n prime += 1\n while not is_prime(prime):\n prime += 1\n\nprint(len(asks))\nfor e in asks:\n print(e, end=\" \")\nprint(\"\")\n\n\t\t\t\t \t \t\t \t\t\t\t\t\t \t\t \t \t\t\t \t \t", "def calculate(n):\n i = 2\n while(i**2 <= n):\n if(n%i == 0):return False\n i += 1\n return True\n\nn = int(input())\nnum, count = 0, 0\nprimes = [0] *1005\nans = [0] *1005\n\nfor i in range(2, 1005):\n if(calculate(i)):\n primes[num] = i\n num+=1\nfor i in range(0, num):\n aux = primes[i]\n while(aux <= n):\n ans[count] = aux\n count += 1\n aux *= primes[i]\n\nprint(count)\nanswear = \"\"\nspace = False\nfor i in range(0, count):\n if(space):\n answear += \" \"\n space = True\n answear += str(ans[i])\n \nprint (answear)\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\nis_prime = [True for i in range(n+1)]\r\nis_prime[0]=is_prime[1]=False\r\ni = 2\r\nwhile(i*i<=n):\r\n if is_prime[i]:\r\n for p in range(i*i,n+1,i):\r\n is_prime[p]=False\r\n i+=1\r\n\r\nans = []\r\nfor i in range(1,n+1):\r\n if(is_prime[i]):\r\n q = 1\r\n while(q<=n/i):\r\n q*=i;\r\n ans.append(q)\r\nprint(len(ans))\r\nprint(*ans)\r\n", "import sys\r\nimport math\r\nimport heapq as hp\r\n#ify push pop\r\n\r\nfrom collections import deque\r\n#appendleft append pop popleft\r\n#BITWISE: and:& or:| not:~ XOR:^ \r\n\r\ninput=sys.stdin.readline\r\nm=1000000007\r\nM=998244353\r\n\r\nINF=float('inf')\r\ndef inp():\r\n return int(input())\r\ndef minp():\r\n return map(int,input().split())\r\ndef strinp():\r\n S=input().rstrip()\r\n return S\r\ndef lst():\r\n return list(map(int,input().split()))\r\n\r\n#------------------------------------#\r\ndef solve():\r\n n=inp()\r\n lst=[]\r\n for i in range(2,n+1):\r\n prime=True\r\n j=2\r\n while(j*j<=i):\r\n if i%j==0:\r\n prime=False\r\n prod=j*j\r\n while(prod<i):\r\n prod*=j\r\n if prod==i:\r\n lst.append(str(i))\r\n break\r\n else:\r\n j+=1\r\n if prime:\r\n lst.append(str(i))\r\n print(len(lst))\r\n print(\" \".join(lst))\r\n# for _ in range(inp()):\r\nsolve()\r\n", "def isPrime(n) : \r\n \r\n # Corner cases \r\n if (n <= 1) : \r\n return False\r\n if (n <= 3) : \r\n return True\r\n \r\n # This is checked so that we can skip \r\n # middle five numbers in below loop \r\n if (n % 2 == 0 or n % 3 == 0) : \r\n return False\r\n \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\nimport sys\r\nn=int(sys.stdin.readline())\r\nans=[]\r\nfor i in range(1,n+1):\r\n if isPrime(i):\r\n k=1\r\n while(n//i>=k):\r\n k*=i\r\n ans.append(k)\r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n ", "def crivo(length):\n result = [1]*length\n result[0], result[1] = 0, 0\n for i in range(2, length, 1):\n if(result[i] == 1):\n for j in range(i*2, length, i):\n result[j] = 0\n return result\n\nn = int(input())\naux = crivo(n + 1)\nresult = []\nfor i in range(n + 1):\n if(aux[i] == 1):\n power = 1\n while(i ** power <= n):\n result.append(i ** power)\n power += 1\n\nprint(len(result))\nprint(\" \".join(map(str, result)))\n\t \t\t \t\t\t\t\t \t\t\t\t\t \t \t", "n = int(input())\r\ndef is_prime(n):\r\n p = 2\r\n while p * p <= n:\r\n if n % p == 0:\r\n return False\r\n p += 1\r\n return True\r\nasks = []\r\nprime = 2\r\nwhile prime <= n:\r\n k = 1\r\n while prime ** k <= n:\r\n asks.append(prime ** k)\r\n k += 1\r\n prime += 1\r\n while not is_prime(prime):\r\n prime += 1\r\nprint(len(asks))\r\nfor e in asks:\r\n print(e, end=\" \")\r\nprint(\"\")", "import math\nimport itertools\n\nn = int(input())\nprimes = [2]\nprimes_degrees = []\nfor i in range(3, n + 1):\n for p in itertools.takewhile(lambda x: x <= i ** 0.5, primes):\n if i%p == 0:\n k = i // p\n while k > 1:\n if k%p != 0: break\n k = k // p\n else:\n primes_degrees.append(i)\n break\n else:\n primes.append(i)\n\nif n == 1:\n print(0)\nelse:\n print(len(primes) + len(primes_degrees))\n for p in primes:\n print(p, end = ' ')\n for pd in primes_degrees:\n print(pd, end = ' ')\n", "n = int(input())\n\nprimos = [1]*(n+1)\nprimos[0] = 0\nprimos[1] = 0 \nfor i in range(2, n):\n if primos[i] == 1:\n for j in range(i*i, n+1, i):\n primos[j] = 0\n\nfor i in range(2, n+1):\n if primos[i] == 1:\n primos[i] = i\n q = 2\n j = i**q\n while j < n+1:\n j = i**q\n if j >= n+1:\n break\n primos[j] = j\n q += 1\n\ns = []\nfor k in range(len(primos)):\n if primos[k] != 0:\n s.append(primos[k])\nprint (len(s))\nprint (*s)\n \t\t\t \t\t \t \t\t \t\t\t\t \t\t \t \t", "n=int(input())\r\nprimes=[2, 3]\r\nfor j in range(5, 1000):\r\n for k in primes:\r\n if j%k==0:\r\n break\r\n else:\r\n primes.append(j)\r\nres=[]\r\nfor j in primes:\r\n if j>n:\r\n break\r\n z=1\r\n while j**z<=n:\r\n res.append(j**z)\r\n z+=1\r\nprint(len(res))\r\nprint(\" \".join([str(k) for k in res]))", "P=print\r\nR=range\r\nn=int(input())\r\nx=' '.join([' '.join(str(j**i)for i in R(1,11)if j**i<=n)for j in R(2,n+1)if 0==sum(j%i==0for i in R(2,j))])\r\nP(len(x.split()))\r\nP(x)", "def build_sieve(n):\r\n primes = [True] * (n + 1)\r\n primes[0] = primes[1] = False\r\n for i in range(2, int((n + 1)**0.5) + 1):\r\n if primes[i]:\r\n for j in range(i*i, (n + 1), i):\r\n primes[j] = False\r\n return primes\r\n\r\ndef solve(n):\r\n primes = build_sieve(n)\r\n questions = []\r\n for i in range(1, n+1):\r\n if primes[i]:\r\n # take all p^k <= n\r\n k = 1\r\n while k <= n // i:\r\n k *= i\r\n questions.append(k)\r\n print(len(questions))\r\n print(*questions)\r\n\r\nsolve(int(input()))", "n = int(input())\nquestions = []\nfor i in range(2, n + 1):\n\tif all(i % q != 0 for q in questions):\n\t\tx = i\n\t\twhile x <= n:\n\t\t\tquestions.append(x)\n\t\t\tx *= i\nprint(len(questions))\nprint(' '.join(str(q) for q in questions))\n", "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\n \r\n\r\ndef comp(n):\r\n\tlcm = 1\r\n\tfor i in range(n):\r\n\t\tlcm = lcm * (i + 1) // gcd(lcm, i + 1)\r\n\treturn lcm\r\n\t\r\ndef solve(n):\r\n\tans = []\r\n\tlcm = 1\r\n\tfor i in range(n):\r\n\t\tif lcm % (i + 1) != 0:\r\n\t\t\tlcm = lcm * (i + 1) // gcd(lcm, i + 1)\r\n\t\t\tans.append(i + 1)\r\n\treturn ans\r\n\r\n# print(comp(1000))\r\nans = solve(int(input()))\r\nprint(len(ans))\r\nfor x in ans:\r\n\tprint(x, end=\"\")\r\n\tprint(\" \", end=\"\")\r\nprint()", "import sys\r\nreadline = sys.stdin.readline\r\n\r\ndef prsh(N):\r\n prime = [2]\r\n for L in range(3,N):\r\n for p in prime:\r\n if not L % p:\r\n break\r\n if p > L**(1/2):\r\n prime.append(L)\r\n break\r\n return prime\r\n\r\nN = int(readline())\r\n\r\nprime = prsh(N+1)\r\n\r\ntable = [0]*(N+1)\r\nfor p in prime:\r\n for i in range(1, N):\r\n if pow(p, i) > N:\r\n break\r\n table[pow(p, i)] = 1\r\n\r\nans = sum(table)\r\nAns = [i for i in range(N+1) if table[i]]\r\nprint(ans)\r\nprint(*Ans)", "def pr(n):\r\n prime=[True for i in range(n+1)]\r\n p=2\r\n while p*p<=n:\r\n if prime[p]==True:\r\n for i in range(p*p,n+1,p):\r\n prime[i]=False\r\n p+=1\r\n return prime\r\nn=int(input())\r\nl=pr(n)\r\nl2=[]\r\nfor i in range(2,n+1):\r\n if l[i]:\r\n a=1\r\n while a*i<=n:\r\n a*=i\r\n l2.append(a)\r\nprint(len(l2))\r\nprint(*l2)", "\r\nimport math\r\nprimes = []\r\n\r\ndef gcd(a, b):\r\n if a == 0:\r\n return b\r\n else:\r\n return gcd(b % a, a)\r\n\r\ndef isAnswer(primes, i):\r\n factors = []\r\n for num in primes:\r\n if num > i:\r\n break\r\n elif i % num == 0:\r\n factors.append(i)\r\n flag = True\r\n for i in range(1, len(factors)):\r\n if gcd(factors[i - 1], factors[i]) != 1:\r\n flag = False\r\n break\r\n return flag\r\n\r\ndef sieve(n):\r\n prime = [True] * (1005)\r\n prime[0] = False\r\n prime[1] = False\r\n for i in range(2, int(math.sqrt(1005)) + 1):\r\n if prime[i] == True:\r\n for j in range(i * i, 1005, i):\r\n prime[j] = False\r\n \r\n for i in range(n + 1):\r\n if prime[i] == True:\r\n primes.append(i)\r\n #print(*primes)\r\n\r\n ans = []\r\n for i in range(2, n + 1):\r\n if prime[i] == False:\r\n #print(f'{i}')\r\n if isAnswer(primes, i):\r\n ans.append(i)\r\n print(len(ans) + len(primes))\r\n primes.extend(ans)\r\n print(*primes)\r\n\r\n\r\nn = int(input())\r\nsieve(n)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN = int(input())\r\ndp = [0]*(N+1)\r\ndp[0] = dp[1] = 1\r\nfor i in range(2,N+1):\r\n if dp[i]==0:\r\n for j in range(i+i,N+1,i):\r\n dp[j] = 1\r\n \r\nans = []\r\nfor i in range(2,N+1):\r\n if dp[i]==0:\r\n t = i\r\n while t<=N:\r\n ans.append(t)\r\n t=t*i\r\n \r\nprint(len(ans))\r\nprint(*ans)\r\n \r\n \r\n ", "def check(x: int) -> bool:\r\n k = 2\r\n while k * k <= x:\r\n if x % k == 0:\r\n return False\r\n k += 1\r\n return True\r\n\r\n\r\nn = int(input())\r\n\r\npowers = list()\r\n\r\n\r\nfor i in range(2, n + 1):\r\n if check(i):\r\n u = i\r\n powers.append(u)\r\n while u * i <= n:\r\n u *= i\r\n powers.append(u)\r\n\r\nprint(len(powers))\r\nprint(*powers)\r\n", "def crivo():\n N = 1001\n is_prime = [True] * N\n is_prime[0] = is_prime[1] = False\n\n for p in range(2, N):\n if is_prime[p]:\n i = p * p\n\n while i < N:\n is_prime[i] = False\n i += p\n\n return is_prime\n\ndef main():\n n = int(input())\n is_prime = crivo()\n results = []\n\n for i in range(2, n + 1):\n if not is_prime[i]:\n continue\n\n num = 1\n while True:\n num *= i\n results.append(num)\n\n if num > n // i:\n break\n\n print(len(results))\n print(*results)\n\nmain()\n\n \t\t \t \t\t\t \t\t\t\t \t\t \t \t\t \t \t", "n = int(input())\r\narr = []\r\nfor i in range(2,n+1):\r\n isPrime = True\r\n for j in range(2,i):\r\n if i % j == 0:\r\n isPrime = False\r\n break\r\n if isPrime:\r\n c = 1\r\n while i**c <= n:\r\n arr.append(str(i**c))\r\n c += 1\r\nprint(len(arr))\r\nprint(' '.join(arr))\r\n\r\n\r\n\r\n", "n=int(input())\r\nv=[1]*(n+1)\r\ngt=[]\r\ng=0\r\nfor i in range(2,n+1):\r\n if not v[i]:\r\n continue\r\n gt+=[i]\r\n g+=1\r\n for j in range(i+i,n+1,i):\r\n v[j]=0\r\ng=0\r\ntr=[]\r\nfor i in gt:\r\n t=i\r\n while i<=n:\r\n tr+=[i]\r\n i*=t\r\n g+=1\r\nprint(g)\r\nprint(*tr)", "n=int(input())\r\na=' '.join((' '.join((str(i**k)for k in range(1,11)if i**k<=n)))for i in range(2,n+1)if all(i%j>0 for j in range(2,i)))\r\nprint(len(a.split()),'\\n',a)", "import math\r\nisprime = [0]*1000010\r\nprime = []\r\ndef seive():\r\n isprime[1] = isprime[0] = 1\r\n prime.append(2)\r\n limit = int(math.sqrt(1000010))+2\r\n for i in range(4,1000010,2):\r\n isprime[i] = 1\r\n for i in range(3,1000010,2):\r\n if(not isprime[i]):\r\n prime.append(i)\r\n if(i <= limit):\r\n for j in range(i*i,1000010,i*2):\r\n isprime[j] = 1\r\nseive()\r\nn = int(input())\r\noutput_list = []\r\nindex = 0\r\nwhile prime[index]<=n:\r\n p = 1\r\n x = pow(prime[index],p)\r\n while(x<=n):\r\n output_list.append(x)\r\n p+=1\r\n x = pow(prime[index],p)\r\n index+=1\r\nprint(len(output_list))\r\nfor x in output_list:\r\n print(x,end=\" \")\r\nprint()", "\r\n\r\ndef mlt(): return map(int, input().split())\r\n\r\n\r\nx = int(input())\r\n\r\nprim = [1 for n in range(x+1)]\r\ndvs = [0 for n in range(x+1)]\r\nprim[1] = 0\r\nfor n in range(1, x+1):\r\n if prim[n]:\r\n dvs[n] = 1\r\n for k in range(2*n, x+1, n):\r\n prim[k] = 0\r\n dvs[k] += 1\r\nres = [n for n in range(1, x+1) if dvs[n] == 1]\r\n\r\nprint(len(res))\r\nprint(*res)\r\n", "import math\r\nimport collections\r\n\r\ndef factorize(n):\r\n ''' returns a list of prime factors of n.\r\n ex. factorize(24) = [2, 2, 2, 3]\r\n source: Rossetta code: prime factorization (slightly modified)\r\n http://rosettacode.org/wiki/Prime_decomposition#Python:_Using_floating_point\r\n '''\r\n step = lambda x: 1 + (x<<2) - ((x>>1)<<1)\r\n maxq = int(math.floor(math.sqrt(n)))\r\n d = 1\r\n q = n % 2 == 0 and 2 or 3\r\n while q <= maxq and n % q != 0:\r\n q = step(d)\r\n d += 1\r\n return q <= maxq and [q] + factorize(n//q) or [n]\r\n\r\ndef primes2(limit):\r\n ''' returns a list of prime numbers upto limit.\r\n source: Rossetta code: Sieve of Eratosthenes\r\n http://rosettacode.org/wiki/Sieve_of_Eratosthenes#Odds-only_version_of_the_array_sieve_above\r\n '''\r\n if limit < 2: return []\r\n if limit < 3: return [2]\r\n lmtbf = (limit - 3) // 2\r\n buf = [True] * (lmtbf + 1)\r\n for i in range((int(limit ** 0.5) - 3) // 2 + 1):\r\n if buf[i]:\r\n p = i + i + 3\r\n s = p * (i + 1) + i\r\n buf[s::p] = [False] * ((lmtbf - s) // p + 1)\r\n return [2] + [i + i + 3 for i, v in enumerate(buf) if v]\r\n\r\n\r\nn = int(input())\r\n\r\ndef solve(n):\r\n if n == 1:\r\n print(0)\r\n return\r\n primes = primes2(n)\r\n record = {p:0 for p in primes}\r\n for m in range(2, n+1):\r\n facs = factorize(m)\r\n counts = collections.Counter(facs)\r\n for p, c in counts.items():\r\n if c > record[p]:\r\n record[p] = c\r\n q = sum(record.values())\r\n print(q)\r\n nums = []\r\n for p, c in record.items():\r\n for i in range(1, c+1):\r\n nums.append(p**i)\r\n if q > 0:\r\n print(*nums)\r\n\r\nsolve(n)", "res = []\ncommons = [2]\nn = int(input())\nfor i in range(3, n + 1):\n isw = False\n for common in commons:\n if i % common == 0:\n isw = True\n break\n if not isw:\n commons.append(i)\n\nfor common in commons:\n i = common\n while i <= n:\n res.append(i)\n i *= common\nprint(len(res))\nprint(*res)", "n = int(input())\r\n\r\nfrom math import sqrt\r\na = []\r\ny = ''\r\n\r\nif n > 1:\r\n for i in range (2, n+1):\r\n k = 0\r\n for j in range(2, int(sqrt(i))+1):\r\n if i % j == 0:\r\n k = 1\r\n if k ==0:\r\n a.append(i)\r\n\r\nk = 0\r\nfor i in range(len(a)):\r\n for j in range(1, 10):\r\n if a[i]**j <= n:\r\n k = k + 1\r\n y = y + str(a[i]**j) + ' '\r\n\r\n\r\nif n == 1:\r\n print(0)\r\nelse:\r\n print(k)\r\n print(y)\r\n\r\n\r\n\r\n\r\n \r\n", "def prime(n):\r\n\tfor i in range(2,n):\r\n\t\tif n%i==0:\r\n\t\t\treturn False\r\n\treturn True\r\nn = int(input())\r\nans = []\r\nfor i in range(2,n+1):\r\n\tif prime(i):\r\n\t\tans.append(i)\r\n\t\tk = 2\r\n\t\twhile i**k<=n:\r\n\t\t\tans.append(i**k)\r\n\t\t\tk+=1\r\nprint(len(ans))\r\nprint(*ans)", "n = int(input())\r\n\r\ndef isprime(x):\r\n for i in range(2, x):\r\n if x%i == 0:\r\n return False\r\n else:\r\n return True\r\n\r\nl = []\r\nfor i in range(2, n+1):\r\n if isprime(i) == True:\r\n l.append(i)\r\n\r\nl2 = []\r\nfor i in l:\r\n c = 1\r\n while i**c <= n:\r\n l2.append(i**c)\r\n c += 1\r\n\r\nprint(len(l2))\r\nfor i in l2:\r\n print(i, end = ' ')\r\n", "n = int(input())\r\na = [1]*1001\r\na[0] = 0\r\na[1] = 0\r\nans = []\r\nfor i in range(2, n+1):\r\n if a[i] == 1:\r\n for j in range(2*i, n+1, i):\r\n a[j] = 0\r\nfor i in range(n+1):\r\n if a[i] == 1:\r\n h = i\r\n while h <= n:\r\n ans.append(h)\r\n h *= i\r\nprint(len(ans))\r\nprint(*ans)\r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef is_prime(x):\r\n if x == 2 or x == 3:\r\n return True\r\n if x % 2 == 0:\r\n return False\r\n i = 1\r\n while i**2 <= x:\r\n i += 2\r\n if x % i == 0:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\n\r\nans = []\r\nfor i in range(2, n+1):\r\n if is_prime(i):\r\n p = i\r\n ans.append(p)\r\n while p <= (n // i):\r\n p *= i\r\n ans.append(p)\r\n\r\nprint(len(ans))\r\nprint(*ans)", "import math\n\ndef isPrime(n):\n for i in range(2, int(math.sqrt(n))+1):\n if n%i == 0:\n return False\n return True\n\n# print(\"Input n\")\nn = int(input())\nif n == 1:\n print(0)\nelse:\n primelist = []\n for i in range(2, n+1):\n if isPrime(i):\n primelist.append(i)\n\n numguesses = 0\n guesses = []\n\n for p in primelist:\n check = p\n while check <= n:\n guesses.append(check)\n numguesses += 1\n check *= p\n\n print(numguesses)\n for x in guesses:\n print(x, end = ' ')\n", "def Sieve(n):\n bools=[True for i in range(n+1)]\n toReturn = []\n p=2\n while p*p<n:\n if bools[p]:\n for i in range(p*2,n+1,p):\n bools[i]=False\n p+=1\n for i in range(2,n+1):\n if bools[i]:\n toReturn.append(i)\n return toReturn \n\ndef Driver():\n n = int(input())\n primes = Sieve(n)\n for prime in primes:\n power = 1\n while prime ** power <= n:\n if power != 1:\n primes.append(prime ** power)\n power += 1\n print(len(set(primes)))\n print(\" \".join(str(i) for i in set(primes)))\n\nDriver()\n", "n = int(input())\r\ns = [2]\r\nfor i in range(3, n + 1, 2):\r\n c = True\r\n for j in range(3, int(i ** 0.5 + 1), 2):\r\n if i % j == 0:\r\n c = False\r\n break\r\n if c:\r\n s.append(i)\r\nc = []\r\nfor j in s:\r\n i = j\r\n while(i <= n):\r\n c.append(i)\r\n i *= j\r\nprint(len(c))\r\nprint(\" \".join(map(str, c))) \r\n \r\n\r\n", "import sys\ninput = lambda: sys.stdin.readline().rstrip()\nfrom collections import deque,defaultdict,Counter\nfrom itertools import permutations,combinations\nfrom bisect import *\nfrom heapq import *\nfrom math import ceil,gcd,lcm,floor,comb\n\nN = int(input())\ns = set()\nfor x in range(1,N+1):\n dic = defaultdict(int)\n for y in range(2,int(x**0.5)+1):\n while x%y==0:\n x//=y\n dic[y]+=1\n if x!=1:\n dic[x]+=1\n for i in dic:\n for j in range(1,dic[i]+1):\n s.add(i**j)\nprint(len(s))\nprint(*sorted(s))\n\n", "def main():\r\n n = int(input())\r\n result = []\r\n for i in range(2, n + 1):\r\n j = 2\r\n while j * j <= i:\r\n if i % j == 0:\r\n break\r\n j += 1\r\n else:\r\n j = i\r\n while j <= n:\r\n result.append(j)\r\n j *= i\r\n \r\n print(len(result))\r\n print(' '.join(str(i) for i in result))\r\n \r\n \r\n \r\nmain()\r\n", "from math import *\r\ndef is_prime(n):\r\n if n==1:\r\n return False\r\n if n<=3:\r\n return True\r\n if n%2==0:\r\n return False\r\n if n%3==0:\r\n return False\r\n if n<9:\r\n return True\r\n else:\r\n f=5\r\n r=ceil(sqrt(n))\r\n while f<=r:\r\n if n%f==0:\r\n return False\r\n if n%(f+2)==0:\r\n return False\r\n f+=6\r\n return True\r\ndef add_numbers(x,lim,ans):\r\n curr=x*x\r\n while curr<=lim:\r\n ans.append(curr)\r\n curr*=x\r\nn=int(input())\r\nprime=[]\r\nans=[]\r\nfor i in range(1,n+1):\r\n if is_prime(i):\r\n prime.append(i)\r\nfor i in prime:\r\n ans.append(i)\r\n add_numbers(i,n,ans)\r\nans=set(ans)\r\nans=list(ans)\r\nprint(len(ans))\r\nprint(*ans)", "def seive(n):\n primes = [True for i in range(n+1)]\n primes[1] = False\n i=2\n while i*i <= n:\n if primes[i]:\n for j in range(i*i,n+1,i):\n primes[j] = False\n i += 1\n return primes\n\nn = int(input())\nif n==1:\n print(0)\n exit(0)\narr=seive(n)\nans = []\nfor i in range(2,n+1):\n if arr[i]:\n j = i\n while j <= n:\n ans.append(j)\n j = j*i\nprint(len(ans))\nif len(ans)==0:\n exit(0)\nprint(' '.join(map(str, ans)))\n\n\n\n\n", "numberOfPossibilities = int(input())\n\nsieve = [1] * 1001\nsieve[0] = 0\nsieve[1] = 0\ni = 2\nwhile i * i <= 1000:\n if sieve[i] == 1:\n for j in range(i * i, 1001, i):\n sieve[j] = 0\n j += i\n i += 1\n\nquestions = \"\"\nnumberQuestions = 0\nfor i in range(2, numberOfPossibilities + 1):\n if sieve[i] == 1:\n questions += str(i) + \" \"\n numberQuestions += 1\n power = 2\n currentNumberToPower = pow(i, power)\n while currentNumberToPower <= numberOfPossibilities:\n questions += str(currentNumberToPower) + \" \"\n numberQuestions += 1\n power += 1\n currentNumberToPower = pow(i, power)\n\nprint(numberQuestions)\nprint(questions)\n\n \t\t \t \t\t\t\t \t\t \t \t \t\t", "def isPrime(n):\r\n if (n == 1):\r\n return False\r\n\r\n elif (n == 2):\r\n return True;\r\n else:\r\n for x in range(2, n):\r\n if (n % x == 0):\r\n return False\r\n return True\r\n\r\n return True\r\n\r\nn = int(input())\r\nans = []\r\nfor i in range(1, n + 1):\r\n if isPrime(i):\r\n k = 1\r\n while (n // i >= k):\r\n k *= i\r\n ans.append(k)\r\nprint(len(ans))\r\nprint(*ans)", "def is_composite(x):\r\n for i in range(2,x):\r\n if x % i == 0 and x / i != i:\r\n while x % i == 0 and x != 1: x = int(x/i)\r\n if x == 1: return False\r\n return True\r\n return False\r\nn = int(input())\r\nans = []\r\nfor i in range(2,n + 1):\r\n if not is_composite(i): ans.append(str(i))\r\nprint(len(ans))\r\nprint(\" \".join(ans))\r\n", "is_prime = lambda n: all(n % d for d in range(2, int(n ** 0.5) + 1))\r\n\r\nn, Y = int(input()), []\r\n\r\nfor i in range(2, n + 1):\r\n if is_prime(i):\r\n y = i\r\n while y <= n:\r\n Y.append(y)\r\n y *= i\r\n\r\nprint(len(Y))\r\nprint(*Y)", "# https://codeforces.com/problemset/problem/576/A\r\nimport math\r\nimport sys\r\n\r\n_DEBUG = True\r\nif not _DEBUG:\r\n input = sys.stdin.readline\r\n\r\n\r\ndef solve(n):\r\n primes = set(range(2, n + 1))\r\n upper_bound = int(math.ceil(math.sqrt(n))) + 1\r\n for i in range(2, upper_bound):\r\n if i not in primes:\r\n continue\r\n for j in range(i * 2, n + 1, i):\r\n primes.discard(j)\r\n\r\n ans = set()\r\n groups = [range(1, n + 1)]\r\n # while groups:\r\n for p in primes:\r\n x = p\r\n while x <= n:\r\n ans.add(x)\r\n x *= p\r\n\r\n return ans\r\n\r\n\r\nn = int(input())\r\n\r\nans = solve(n)\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n prime = [True] * (n + 1)\r\n rest = list()\r\n for i in range(2, n + 1):\r\n if prime[i]:\r\n for j in range(i * i, n + 1, i):\r\n prime[j] = False\r\n for i in range(2, n + 1):\r\n if prime[i]:\r\n t = i\r\n while t <= n:\r\n rest.append(t)\r\n t *= i\r\n print(len(rest))\r\n print(' '.join(map(str, rest)))\r\n", "n = int(input())\r\ndivs = []\r\nprimes = []\r\np = 2\r\n\r\nwhile p <= n:\r\n isP = True\r\n for p2 in primes:\r\n if p2 * p2 > p:\r\n break\r\n if p % p2 == 0:\r\n isP = False\r\n break\r\n if not isP:\r\n p += 1\r\n continue\r\n primes.append(p)\r\n \r\n ma = p\r\n while ma <= n:\r\n divs.append(ma)\r\n ma *= p\r\n p += 1\r\n\r\nprint(len(divs))\r\nprint(*divs)\r\n", "def factor(x):\r\n num=x\r\n d=2\r\n a=[]\r\n while(num>1 and d**2<x+2):\r\n if(num%d==0):\r\n a.append(d)\r\n num=num//d\r\n else:\r\n d+=1\r\n if(num>1):\r\n a.append(num)\r\n return int(len(list(set(a)))<2)*x\r\nn=int(input())\r\narr=[]\r\nfor i in range(2,n+1):\r\n x=factor(i)\r\n if(x):\r\n arr.append(x)\r\nprint(len(arr))\r\nprint(*arr)\r\n", "def prime(x):\r\n i = 2\r\n while i * i <= x:\r\n if x % i == 0: return False\r\n i += 1\r\n return True\r\n\r\nn = int(input())\r\n\r\nans = []\r\n\r\nfor i in range(2, n + 1):\r\n if not prime(i): continue\r\n k = i\r\n while k <= n:\r\n ans.append(k)\r\n k *= i\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "def boleano (inteiro):\n i = 2\n while(i*i <= inteiro):\n if(inteiro%i==0):\n return False\n i += 1\n return True\n\ninteiro = int(input())\ni = 2\ntamanho = 1005\narray = [None] * tamanho\narrayAux = [None] * tamanho\npos = 0\nwhile(i < tamanho):\n if(boleano(i)):\n array[pos]=i\n pos+=1\n i+=1\ni = 0\naux = 0\nwhile(i < pos):\n saida = array[i]\n while(saida <= inteiro):\n arrayAux[aux] = saida\n aux += 1\n saida = saida * array[i]\n i+=1\nprint(aux)\nvaipassar = ''\nfor i in range(aux):\n vaipassar += str(arrayAux[i]) + ' '\nprint(vaipassar.strip())\n\t \t \t \t\t \t \t\t \t\t \t\t\t \t \t", "def crivo_Eratostenes(maiorValor):\n lista = [True] * maiorValor\n\n i = 2\n while i < maiorValor:\n if lista[i] == True:\n j = i * i\n while j < maiorValor:\n lista[j] = False\n j += i\n i += 1\n return lista\n\nmaiorValor = 1001\nehPrimo = crivo_Eratostenes(maiorValor)\n\nnum = int(input())\nresultado = []\n\ni = 2\nwhile i <= num:\n if ehPrimo[i]:\n j = 1\n while i ** j <= num:\n resultado.append(i ** j)\n j += 1\n i += 1\n\nprint(len(resultado))\nprint(*resultado)\n\t \t \t \t\t\t \t\t\t \t \t \t\t \t \t \t\t\t\t", "def SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n l=[]\r\n for p in range(2, n + 1):\r\n if prime[p]:\r\n l.append(p)\r\n return l\r\n\r\nn=int(input())\r\narray=[False]*(n+1)\r\na=SieveOfEratosthenes(n)\r\nfor i in range(len(a)):\r\n p1=a[i]\r\n array[p1]=True\r\n j=1\r\n while(p1**j<=n):\r\n array[p1**j]=True\r\n j+=1\r\n\r\nprint(array.count(True))\r\nfor i in range(len(array)):\r\n if(array[i]==True):\r\n print(i,end=\" \")\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nprimos = []\r\n\r\ncomposto = [False]*(10**3+7)\r\nfor i in range(2, 10**2, 1):\r\n if not composto[i]:\r\n for j in range(i+i, 10**3+7, i):\r\n composto[j] = True\r\n \r\nfor i in range(2, 10**3+7, 1):\r\n if not composto[i]:\r\n primos.append(i)\r\n\r\nans = []\r\nfor p in primos:\r\n if p > n:\r\n break\r\n i = 1\r\n while p**i <= n:\r\n ans.append(p**i)\r\n i += 1\r\n\r\nprint(len(ans))\r\nfor num in ans:\r\n print(num, end=' ')\r\nexit(0)", "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\ndef primesUpto(n):\r\n return [x for x in range(2,n+1) if is_prime(x)]\r\n\r\nn = int(input())\r\nif n == 1:\r\n print(0)\r\nelse: \r\n pr = primesUpto(n)\r\n res = pr.copy()\r\n for x in pr:\r\n y = x**2\r\n while y <= n:\r\n res.append(y)\r\n y *= x\r\n print(len(res))\r\n print(\" \".join(str(x) for x in res))", "import math\nisprime = [0]*1000010\nprime = []\ndef seive():\n isprime[1] = isprime[0] = 1\n prime.append(2)\n limit = int(math.sqrt(1000010))+2\n for i in range(4,1000010,2):\n isprime[i] = 1\n for i in range(3,1000010,2):\n if(not isprime[i]):\n prime.append(i)\n if(i <= limit):\n for j in range(i*i,1000010,i*2):\n isprime[j] = 1\nseive()\nn = int(input())\noutput_list = []\nindex = 0\nwhile prime[index]<=n:\n p = 1\n x = pow(prime[index],p)\n while(x<=n):\n output_list.append(x)\n p+=1\n x = pow(prime[index],p)\n index+=1\nprint(len(output_list))\nfor x in output_list:\n print(x,end=\" \")\nprint()\n", "n=int(input())\r\nc=[0]*(n+1)\r\nl=[]\r\nfor i in range(2,n+1):\r\n m=i\r\n for j in range(2,i+1):\r\n if m%j==0:\r\n x=1\r\n while m%j==0:\r\n x*=j\r\n m//=j\r\n l.append(x)\r\n if m>1:\r\n l.append(x)\r\nl=list(set(l))\r\nprint(len(l))\r\nprint(*l)", "from math import ceil\r\n\r\nn = int(input())\r\nprime_arr = [0] * 1001\r\nprime_arr[2] = 1\r\nans = []\r\nfor i in range(3, n + 1):\r\n prime = True\r\n for j in range(2, ceil(i ** .5) + 1):\r\n if i % j == 0:\r\n prime = False\r\n if prime:\r\n prime_arr[i] = 1\r\ni = 2\r\nwhile i <= n:\r\n if prime_arr[i] == 1:\r\n k = 1\r\n while i ** k <= n:\r\n ans.append(i ** k)\r\n k += 1\r\n i += 1\r\nprint(len(ans))\r\nprint(' '.join(map(str, ans)))\r\n", "s=[1]*1001\r\ni=2\r\nwhile i*i<1001:\r\n if s[i]:\r\n for j in range(i*i,1001,i):\r\n s[j]=0\r\n i+=1 \r\nx=int(input())\r\nlol=[]\r\nfor i in range(2,x+1):\r\n if s[i]:\r\n k=i\r\n while k<=x:\r\n lol.append(k)\r\n k*=i\r\n \r\nprint(len(lol))\r\nprint(*lol)", "n = int(input())\r\nquestions = []\r\nfor i in range(2, n + 1):\r\n\tl=list(i % q for q in questions)\r\n\t# print(l,all(l))\r\n\tif all(l):\r\n\t\tx = i\r\n\t\twhile x <= n:\r\n\t\t\tquestions.append(x)\r\n\t\t\tx *= i\r\nprint(len(questions))\r\nprint(' '.join(str(q) for q in questions))", "IL = lambda: list(map(int, input().split()))\r\nI = lambda: int(input())\r\n\r\nprimes = [True for i in range(1001)]\r\nprimes[0] = False\r\nprimes[1] = False\r\nfor i in range(2, 1001):\r\n for j in range(i*2, 1001, i):\r\n primes[j] = False\r\nprimes = [i for i, p in enumerate(primes) if p]\r\n\r\nfor p in primes[:11]:\r\n ppow = [p**i for i in range(2, 10) if p**i <= 1000]\r\n primes += ppow\r\n\r\nprimes.sort()\r\n\r\nn = I()\r\nans = [i for i in primes if i<=n]\r\nprint(len(ans))\r\nprint(\" \".join(map(str, ans)))", "import copy\nn=int(input())\nl=list()\na=list()\ndef findprime(N):\n\ti=2\n\tcount=0\n\twhile(i*i<=N):\n\t\tif i*i==N:\n\t\t\tcount=count+1\n\t\telif N%i==0:\n\t\t\tcount=count+2\n\t\ti=i+1\n\tif count==0 and N!=1:\n\t\tl.append(N)\nfor j in range(2,n+1):\n\tfindprime(j)\na=copy.copy(l)\nfor i in l:\n\tk=2\n\twhile(i**k<=n):\n\t\ta.append(i**k)\n\t\tk=k+1\nprint(len(a))\nprint(*a)\n\t\t", "#this is AMIY TIWARI TEMPLATE IN PYTHON\r\nimport sys\r\nimport random\r\nfrom bisect import bisect_left as lb\r\nfrom bisect import bisect_right as rb\r\nfrom collections import deque\r\n#sys.setrecursionlimit(10**8)\r\nfrom queue import PriorityQueue as pq\r\nfrom math import gcd\r\n#import math\r\ninput_ = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\nii = lambda : int(input_())\r\nil = lambda : list(map(int, input_().split()))\r\nilf = lambda : list(map(float, input_().split()))\r\nlii = lambda : list(map(int, list(ip())))\r\nip = lambda : input_()\r\nfi = lambda : float(input_())\r\nap = lambda ab,bc,cd : ab[bc].append(cd)\r\nli = lambda : list(input_())\r\npr = lambda x : print(x)\r\nprinT = lambda x : print(x)\r\nf = lambda : sys.stdout.flush()\r\ninv =lambda x:pow(x,mod-2,mod)\r\ndx = [0,0,1,-1]\r\ndy = [1,-1,0,0]\r\nmod = 10**9 + 7\r\nmod1 = 998244353\r\n\r\nn = ii()\r\n\r\nb = [1 for i in range (1005)]\r\nb[0] = b[1] = 0\r\n\r\np = 2\r\nwhile (p*p < 1005) :\r\n if (b[p]) :\r\n for j in range (p*p,1005,p) :\r\n b[j] = 0\r\n p += 1\r\n\r\nans = []\r\n\r\nfor i in range (n+1) :\r\n if (b[i]) :\r\n j = i\r\n while (j <= n) :\r\n ans.append(j)\r\n j *= i\r\n\r\nprint(len(ans))\r\nprint(*ans)\r\n", "p=10**3+5\r\ndef Sieve():\r\n l=[True]*p \r\n i=2 \r\n while i*i<=p:\r\n if l[i]:\r\n for j in range(i*i,p,i):\r\n l[j]=False \r\n i+=1 \r\n return l \r\nisprime=Sieve() \r\nans=[] \r\nn=int(input())\r\nfor i in range(2,n+1):\r\n if isprime[i]:\r\n curr=i \r\n while curr<=n:\r\n ans.append(curr)\r\n curr=curr*i \r\nprint(len(ans))\r\nprint(*ans)", "# @author Nayara Souza\n# UFCG - Universidade Federal de Campina Grande\n# AA - Basico\n\nn = int(input())\n\nl = []\n\nfor i in range(2,n+1):\n boolean = True\n for j in range(2,i):\n if(i % j == 0):\n boolean = False\n if(boolean == True):\n a = i\n while(a <= n):\n l.append(a)\n a *= i\n\nl.sort()\n\ncount=0\ns = ''\n\nfor i in l:\n if(i <= n):\n count += 1\n s += str(i) + ' '\nprint(count)\nprint(s.rstrip())\n\n \t\t \t \t\t \t \t \t\t \t\t \t", "import math\r\n\r\ndef check(x):\r\n cnt = 0\r\n for p in range(2, int(math.sqrt(x)) + 1):\r\n if x % p == 0:\r\n while x % p == 0:\r\n x //= p\r\n if x > 1:\r\n return False\r\n return True\r\n\r\nn = int(input())\r\n\r\nv = []\r\nfor i in range(2, n+1):\r\n if check(i):\r\n v.append(i)\r\n\r\nprint(len(v))\r\nprint(*v)", "def Prime(x):\r\n for i in range(2,int(x**0.5)+1):\r\n if x%i==0: return 0\r\n return 1\r\nn=int(input())\r\nans=[]\r\nfor i in range(2,n+1):\r\n if Prime(i):\r\n ans+=[str(i)]\r\n t=i\r\n while t*i<=n:\r\n t*=i\r\n ans+=[str(t)]\r\nprint(len(ans))\r\nprint(' '.join(ans))", "n = int(input())\r\np = []\r\nfor i in range(2,n+1):\r\n isprime = True\r\n for j in p:\r\n if i % j == 0:\r\n isprime = False\r\n break\r\n if isprime:\r\n p.append(i)\r\nans = []\r\nfor i in p:\r\n k = 1\r\n while i ** k <= n:\r\n ans.append(str(i ** k))\r\n k += 1\r\nprint(len(ans))\r\nprint(' '.join(ans))\r\n", "from math import sqrt\n\nn = int(input())\n\nans = []\nmy_dict = {}\n\ndef is_prime(n):\n\tif n == 2:\n\t\treturn True\n\telif n < 2:\n\t\treturn False\n\tfor i in range(2, int(sqrt(n))+1):\n\t\tif n%i == 0:\n\t\t\treturn False\n\treturn True\n\nfor i in range(2, n+1):\n\tif is_prime(i):\n\t\tj = 1\n\t\twhile(i**j <= n):\n\t\t\tif i**j not in my_dict:\n\t\t\t\tmy_dict[i**j] = 1\n\t\t\t\tans.append(str(i**j))\n\t\t\tj += 1\n\t\nprint(len(ans))\nprint(\" \".join(ans))\n", "import math,sys,bisect,heapq,os\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\ndef input(): return sys.stdin.readline().rstrip('\\r\\n')\r\n#input = 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\ndef SieveOfEratosthenes(n):\r\n Z=[]\r\n prime = [True for i in range(n+1)] \r\n p = 2\r\n prime[0] = prime[1] = False\r\n while (p * p <= n): \r\n\r\n \tif (prime[p] == True): \r\n\t\t\t\r\n \t\t# Update all multiples of p \r\n \t\tfor i in range(p * p, n+1, p): \r\n \t\t\tprime[i] = False\r\n \tp += 1\r\n return prime\r\n\t\r\npri = SieveOfEratosthenes(10000)\r\n\r\ndef solve():\r\n\tn, = aj()\r\n\tif n == 1:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tAns = []\r\n\t\ts = set()\r\n\t\tfor i in range(2,n+1):\r\n\t\t\tif pri[i]:\r\n\t\t\t\tAns.append(i)\r\n\t\t\t\ts.add(i)\r\n\t\t\t\tr = i\r\n\t\t\t\twhile r*i <= n:\r\n\t\t\t\t\tr*=i\r\n\t\t\t\t\tif not( r in s):\r\n\t\t\t\t\t\ts.add(r)\r\n\t\t\t\t\t\tAns.append(r)\r\n\t\tprint(len(Ans))\r\n\t\tprint(*Ans)\r\n\r\n\r\n\r\ntry:\r\n\t#os.system(\"online_judge.py\")\r\n\tsys.stdin = open('input.txt', 'r') \r\n\tsys.stdout = open('output.txt', 'w')\r\nexcept:\r\n\tpass\r\n\r\nsolve()", "#https://codeforces.com/contest/576/problem/A\r\n#M\r\n\r\nn = int(input())\r\n\r\nvalues = []\r\nfor i in range(2, n + 1):\r\n for k in values:\r\n if i % k == 0:\r\n break\r\n else:\r\n values.append(i)\r\n\r\nvalue = []\r\nfor p in values:\r\n i = 1\r\n while p ** i <= n:\r\n value.append(p ** i)\r\n i += 1\r\n\r\nprint(len(value))\r\nprint(' '.join(map(str, value)))\r\n", "def build_sieve(n):\r\n primes = [False] * (n + 1)\r\n primes[0] = primes[1] = True\r\n for i in range(2, int((n + 1)**0.5) + 1):\r\n if not primes[i]:\r\n for j in range(i*i, (n + 1), i):\r\n primes[j] = True\r\n return primes\r\n\r\ndef solve(n):\r\n primes = build_sieve(n)\r\n ans = []\r\n for i in range(1, n+1):\r\n if not primes[i]:\r\n cur = 1\r\n while cur <= n // i:\r\n cur *= i\r\n ans.append(cur)\r\n print(len(ans))\r\n print(*ans)\r\n\r\nsolve(int(input()))", "n=int(input())\r\np=[True]*(n+1)\r\ni=2\r\nwhile i*i<=n:\r\n if p[i]:\r\n j=i*i\r\n while j<=n:\r\n p[j]=False\r\n j+=i\r\n i+=1\r\na=[]\r\nfor i in range(2,n+1):\r\n if p[i]:\r\n j=1\r\n while i**j<=n:\r\n a.append(i**j)\r\n j+=1\r\nprint(len(a))\r\nprint(*a)", "\r\nn=int(input())\r\n\r\ndp=[1 for i in range(n+1)]\r\ndp[0]=0\r\ndp[1]=0\r\nans=[]\r\nfor i in range(2,int(n**0.5+1)):\r\n if dp[i]==1:\r\n j=i\r\n ans.append(i)\r\n while i*j<=n:\r\n ans.append(i*j)\r\n dp[i*j]=0\r\n j=j+1\r\n#print(dp)\r\n\r\nans=\"\"\r\ncount=0\r\nfor i in range(2,len(dp)):\r\n if dp[i]==1:\r\n #print(i)\r\n j=1\r\n while i**j<=n:\r\n ans=ans+str(i**j)+\" \"\r\n count=count+1\r\n j=j+1\r\nprint(count)\r\nprint(ans)", "from math import *\nN = 1000\nP = {2,3}\nfor i in range(5,N+1):\n for j in range(2,int(sqrt(i))+1):\n if i%j == 0:\n break\n else:\n P.add(i)\n\nD = set()\nfor p in P:\n a = p\n while a <= N:\n D.add(a)\n a *= p\n\nn = int(input())\nd = [i for i in D if i <= n]\nprint(len(d))\nprint(' '.join(map(str,d)))\n", "n, s = int(input()) + 1, set()\r\nfor i in range(2, n):\r\n for j in range(2, n):\r\n if not i % j:\r\n k = i\r\n while not k % j:\r\n k //= j\r\n if k == 1:\r\n s.add(i)\r\n break\r\nprint(len(s), *s)", "def SieveOfEratosthenes(n): \r\n prime = [True for i in range(n+1)] \r\n p = 2\r\n while (p * p <= n): \r\n if (prime[p] == True): \r\n for i in range(p * p, n+1, p): \r\n prime[i] = False\r\n p += 1\r\n num = []\r\n for p in range(2, n+1): \r\n if prime[p]: \r\n num.append(p)\r\n return num\r\n\r\nprimes = SieveOfEratosthenes(1001)\r\n\r\nn = int(input())\r\nask = []\r\n\r\nfor i in primes:\r\n if i <= n:\r\n j = 1\r\n while i**j <= n:\r\n ask.append(i**j)\r\n j += 1\r\n \r\nprint(len(ask))\r\nprint(*ask)\r\n", "n = int(input())\r\na = \" \".join([\" \".join([str(i ** k) for k in range(1, 30) if i ** k <= n]) for i in range(2, n + 1) if all([i % j != 0 for j in range(2, i)])])\r\nprint((len(a.split())), \"\\n\" + a)\r\n\r\nnum_inp=lambda: int(input())\r\narr_inp=lambda: list(map(int,input().split()))\r\nsp_inp=lambda: map(int,input().split())\r\nstr_inp=lambda:input()\r\n", "from math import sqrt\r\nn=int(input())\r\na=[]\r\nfor i in range(2,n+1):\r\n z=0\r\n for j in range(2,i):\r\n y=0\r\n for k in range(2,int(sqrt(j))+1):\r\n if j%k==0:\r\n y=1\r\n break\r\n if y==0 and i%j==0:\r\n z+=1\r\n if z<2:\r\n a.append(i)\r\nprint(len(a))\r\nprint(*a)", "def crivo(n):\n\tprime = [True for x in range(n+1)]\n\tp = 2\n\twhile p*p <= n:\n\t\tif prime[p]:\n\t\t\tfor i in range(p*p, n+1, p):\n\t\t\t\tprime[i] = False\n\t\tp += 1\n\t\t\n\tresp = []\n\tfor i in range(2, n+1):\n\t\tif prime[i]:\n\t\t\tresp.append(i)\n\treturn resp\n\t\nn = int(input())\n\naux = 2\nresp = []\n\nfor e in crivo(n):\n\ti = 1\n\twhile e**i <= n:\n\t\tresp.append(e**i)\n\n\t\ti += 1\nprint(len(resp))\nfor e in resp:\n\tprint(e, end=\" \")\n\n\t\n\n \t\t \t\t \t\t \t \t \t \t \t\t\t\t", "\r\nn=int(input())\r\na = [i for i in range(2, n+1)]\r\ndef calculaDivisiores(num):\r\n atual = 2\r\n divs = []\r\n while atual<=(num//2)+1:\r\n if num%atual==0:\r\n divs.append(atual)\r\n atual+=1\r\n divs.sort(reverse=True)\r\n return divs \r\n \r\nres = []\r\nfor num in a:\r\n divs = calculaDivisiores(num)\r\n if len(divs)==1:\r\n res.append(num)\r\n else:\r\n res.append(num)\r\n for i1 in range(len(divs)):\r\n div1 = divs[i1]\r\n for i2 in range(i1, len(divs)):\r\n div2=divs[i2]\r\n if div1!=div2:\r\n if div1%div2!=0:\r\n if num in res:\r\n res.remove(num)\r\nprint(len(res))\r\nfor r in res:\r\n print(r,end=' ')", "entrada = int(input())\ni = 2\narray = [''] * 1005\narr = [''] * 1005\ncont = 0\nvalor = 0\ns = 0\n\ndef teste(entrada):\n i = 2\n while(i*i <= int(entrada)):\n if(entrada % i == 0):\n return False\n i += 1\n return True\nwhile(i < 1005):\n if(teste(i)):\n array[cont]=i\n cont+=1\n i+=1\n\nfor i in range(cont):\n valor = array[i]\n while(valor <= entrada):\n arr[s] = valor\n s += 1\n valor = valor * array[i]\n i+=1\nprint(s)\n\nresult = ''\nfor i in range(s):\n result += str(arr[i]) + ' '\nprint(result)\n \t\t\t \t\t \t\t\t\t \t \t\t \t", "import math\r\nn=int(input())\r\nprime=[True]*(n+1)\r\nprime[0]=False\r\nprime[1]=False\r\nfor i in range(int(math.sqrt(n))+1):\r\n if prime[i]:\r\n x=2*i\r\n while x<=n:\r\n prime[x]=False\r\n x+=i\r\ncount=0\r\nseq=[]\r\nfor i in range(n+1):\r\n if prime[i]:\r\n x=i\r\n while(x<=n):\r\n seq.append(x)\r\n x*=i\r\n count+=1\r\nprint(count)\r\nprint(*seq)\r\n", "import sys\r\nimport math\r\ndef get_sieve(n):\r\n # n * log log n\r\n primes = set()\r\n sieve = [1] * (n + 1)\r\n sieve[0] = sieve[1] = 0\r\n for i in range(2, n + 1):\r\n if sieve[i]:\r\n for j in range(i * i, n + 1, i):\r\n sieve[j] = 0\r\n primes.add(i)\r\n return primes\r\n\r\ndef is_p(n, primes):\r\n if n in primes:\r\n return True\r\n factors =set()\r\n for p in primes:\r\n if p * p > n:\r\n break\r\n while n % p == 0:\r\n n //= p\r\n factors.add(p)\r\n if n > 1:\r\n factors.add(n)\r\n return True if len(factors) == 1 else False\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n read = sys.stdin.readline\r\n n = int(read())\r\n primes = get_sieve(n)\r\n if n == 1:\r\n print(0)\r\n return\r\n result = []\r\n if n > 1:\r\n for i in range(2, n + 1):\r\n if i in primes:\r\n result.append(str(i))\r\n elif is_p(i, primes):\r\n result.append(str(i))\r\n print(len(result))\r\n print(' '.join(result))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\narr=[]\r\ndef SieveOfEratosthenes(n): \r\n prime = [True for i in range(n + 1)] \r\n p = 2\r\n while (p * p <= n): \r\n if (prime[p] == True): \r\n for i in range(p * 2, n + 1, p): \r\n prime[i] = False\r\n p += 1\r\n prime[0]= False\r\n prime[1]= False \r\n for p in range(n + 1): \r\n if prime[p]: \r\n arr.append(p) \r\nn=int(input())\r\nSieveOfEratosthenes(n)\r\nfinal=[]\r\nfor i in arr:\r\n x=int(math.log(n,i))\r\n for j in range(1,x+1):\r\n final.append(pow(i,j))\r\nprint(len(final))\r\nprint(*final)\r\n ", "import math\r\nimport sys\r\n\r\nn=int(input())\r\n\r\nres=[]\r\nfor i in range(2,n+1):\r\n for j in range(2,i+1):\r\n if i%j==0:\r\n k=i\r\n while k%j==0:\r\n k//=j\r\n if k==1:\r\n res.append(i)\r\n break\r\n else:\r\n break\r\n\r\nprint(len(res))\r\nfor i in range(len(res)):\r\n print(res[i],end=\" \")", "def main():\r\n n = int(input())\r\n seive = [True for _ in range(n + 1)]\r\n for i in range(2, n + 1):\r\n if (seive[i]):\r\n for j in range(i * i, n + 1, i):\r\n seive[j] = False\r\n j *= i\r\n guess = []\r\n for i in range(2, n + 1):\r\n if seive[i]:\r\n q = 1\r\n while (q <= n // i):\r\n q *= i\r\n guess.append(q) \r\n print(len(guess))\r\n print(*guess)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "def sieve(n):\r\n prime = [True] * (n + 1)\r\n prime[0] = prime[1] = False\r\n i = 2\r\n while i * i <= n:\r\n if prime[i]:\r\n for j in range(i * i, n + 1, i):\r\n prime[j] = False\r\n i += 1\r\n return prime\r\n\r\nn = int(input())\r\n\r\nisPrime = sieve(n)\r\nret = []\r\nfor i in range(n + 1):\r\n if isPrime[i]:\r\n p = 1\r\n while i ** p <= n:\r\n ret.append(i ** p)\r\n p += 1\r\nprint('%d\\n%s' % (len(ret), ' '.join(map(str, ret))))", "def crivo(n):\n prime = [1]*(n + 1)\n prime[0] = prime[1] = 0\n i = 2\n while i * i <= n: \n if(prime[i] == 1):\n for j in range(i*i, n+1, i):\n prime[j] = 0\n i += 1\n n_primes = []\n for i in range(n + 1):\n if(prime[i]):\n n_primes.append(i)\n\n return n_primes\n\n\nresult = []\n\nn = int(input())\nfor i in crivo(n):\n j = 1\n while(i ** j <= n):\n result.append(i**j)\n j += 1\nprint(len(result))\nprint(*result)\n\t \t \t \t\t \t \t \t\t\t \t \t\t \t\t\t\t \t\t", "\r\n\r\nls = [True]*1004\r\n\r\n\r\n\r\nn = int(input())\r\nprimes = []\r\nfor i in range(2, n+1):\r\n if ls[i]:\r\n primes.append(i)\r\n for j in range(2*i, n+1, i): ls[j] = False\r\n\r\nlst = []\r\nfor prime in primes:\r\n p = prime\r\n while p <= n:\r\n lst.append(p)\r\n p *= prime\r\nprint(len(lst))\r\nfor el in lst: print(el, end=' ')", "from math import sqrt\r\ndef isPrime(n):\r\n if n<=1:\r\n return False\r\n for i in range(2,int(sqrt(n))+1):\r\n if n%i==0:\r\n return False\r\n return True\r\n\r\nn=int(input())\r\nans=[]\r\nfor i in range(2,n+1):\r\n if isPrime(i):\r\n j=i\r\n while j<=n:\r\n ans.append(j)\r\n j*=i\r\nprint(len(ans))\r\nprint(*ans)", "def main():\r\n n = int(input())\r\n p = []\r\n for i in range(2, n+1):\r\n e = False\r\n for j in range(2, int(i ** 0.5 + 1)):\r\n if i % j == 0:\r\n e = True\r\n break\r\n if not e:\r\n p.append(i)\r\n ans = []\r\n for h in p:\r\n temp = 1\r\n while True:\r\n temp *= h\r\n if temp > n:\r\n break\r\n ans.append(temp)\r\n print(len(ans))\r\n print(*ans)\r\n\r\nmain()", "from math import log\r\nn = int(input())\r\nprimes = [True for i in range(n+1)] \r\ni = 2\r\nwhile (i*i<=n) :\r\n\t\r\n\tif (primes[i] == True): \r\n\t# Uidate all multiiles of i \r\n\t\tfor j in range(i * 2, n+1, i): \r\n\t\t\tprimes[j] = False\r\n\ti += 1\r\nl = []\r\ns = 0\r\nfor p in range(2,n+1) :\r\n\tif primes[p] == True :\r\n\t\tk = int(log(n)/log(p))\r\n\t\ts += k\r\n\t\tfor m in range(1,k+1) :\r\n\t\t\tl.append(p**m)\r\n\r\nprint(s)\r\nprint(*l)\r\n\r\n\r\n\r\n" ]

[ "l, b, f = map(int, input().split())\r\np = [[-b, -b, -192], [l + f, l + f, -38]]\r\nn = int(input())\r\nfor i in range(1, n + 1):\r\n a, h = map(int, input().split())\r\n if a == 1:\r\n k = False\r\n for w in range(len(p) - 1):\r\n if p[w + 1][0] - p[w][1] >= b + f + h:\r\n p.insert(w + 1, [p[w][1] + b, p[w][1] + b + h, i])\r\n k = True\r\n print(p[w][1] + b)\r\n break\r\n if not k:\r\n print(-1)\r\n else:\r\n for t in range(len(p)):\r\n if p[t][2] == h:\r\n p.pop(t)\r\n break\r\n \r\n", "class Car:\n def __init__(self, id, size, location):\n self.id = id\n self.size = size\n self.location = location\n print(location)\n\ncars = []\nlot_size, back_gap, front_gap = map(int, input().split())\nq = int(input())\nfor id in range(1, q + 1):\n request, value = map(int, input().split())\n if request == 1:\n size = value\n # Only car in the lot.\n if len(cars) == 0:\n if size <= lot_size:\n cars.append(Car(id, size, 0))\n else:\n print(-1)\n continue\n # Park before first car.\n if size + front_gap <= cars[0].location:\n cars.insert(0, Car(id, size, 0))\n continue\n # Park between two cars.\n found = False\n for pos in range(1, len(cars)):\n a, b = cars[pos - 1], cars[pos]\n x = a.location + a.size + back_gap\n if x + size + front_gap <= b.location:\n cars.insert(pos, Car(id, size, x))\n found = True\n break\n if found:\n continue\n # Park after last car.\n a = cars[len(cars) - 1]\n x = a.location + a.size + back_gap\n if x + size <= lot_size:\n cars.append(Car(id, size, x))\n continue\n # Fail.\n print(-1)\n else:\n id = value\n for pos, car in enumerate(cars):\n if car.id == id:\n del cars[pos]\n break\n\n", "import sys\n\nreadline = sys.stdin.readline\n# L, b, f = [int(w) for w in readline().split()]\nrequest =[]\n\ndef read_input():\n L, f, b = [int(w) for w in readline().split()]\n n = int(readline().strip())\n for _ in range(n):\n request.append([int(w) for w in readline().split()])\n return L, b, f\n\n\ndef solve(L: int, b: int, f:int) -> list:\n park = [[-f,-f] ,[L + b, L+ b]]\n result = []\n r2pos = [-1] * len(request)\n for ridx, (cmd, op) in enumerate(request):\n if cmd == 2:\n pos = r2pos[op - 1]\n idx = -1\n for i,(l,r) in enumerate(park):\n if l == pos:\n idx = i\n park.pop(idx)\n elif cmd == 1:\n length = f + op + b\n found = False\n for i in range(len(park) -1):\n if park[i + 1][0] - park[i][1] >= length:\n park.insert(i + 1, [park[i][1] + f, park[i][1] + f + op])\n result.append(park[i + 1][0])\n r2pos[ridx] = park[i + 1][0]\n found = True\n break\n if not found:\n result.append(-1)\n # print(cmd, op, park)\n return result\n\ndef write_output(result: list):\n for n in result:\n print(n)\n\n\nL, b, f = read_input()\nwrite_output(solve(L, b, f))\n\n\n" ]

[ "n = int(input())\na = [int(x) for x in input().split()]\nl = [0] * (10**6 + 100)\nfor x in a:\n\tl[x] += 1\ncur = 0\nans = 0\nfor x in l:\n\tcur += x\n\tif cur % 2:\n\t\tans += 1\n\tcur //= 2\nprint(ans)\n", "from sys import stdin\r\n\r\ninput, Max = stdin.readline, 2 * 10 ** 6\r\nn, mem, ans = int(input()), [0] * Max, 0\r\nfor i in [int(x) for x in input().split()]:\r\n mem[i] += 1\r\nfor i in range(Max - 1):\r\n mem[i + 1] += mem[i] >> 1\r\n ans += mem[i] & 1\r\nprint(ans)", "from sys import stdin\r\nstdin.readline()\r\na = [0] * 1000021\r\nans = b = 0\r\nfor u in map(int, stdin.readline().split()):\r\n a[u] += 1\r\nfor u in a:\r\n b += u\r\n ans += b&1\r\n b >>= 1\r\nprint(ans)", "from collections import defaultdict\r\n\r\nmxn = 10**6\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = [0]*(mxn+2)\r\n\r\nfor i in a:\r\n d[i] += 1\r\n \r\nfor i in range(1+mxn):\r\n q = d[i]//2\r\n d[i+1] += q\r\n d[i] -= 2*q\r\n \r\nct = 0\r\nfor i in d:\r\n ct += bin(i).count(\"1\")\r\nprint(ct)", "def fast3():\r\n import os, sys, atexit\r\n from io import BytesIO\r\n sys.stdout = BytesIO()\r\n _write = sys.stdout.write\r\n sys.stdout.write = lambda s: _write(s.encode())\r\n atexit.register(lambda: os.write(1, sys.stdout.getvalue()))\r\n return BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\ninput, Max = fast3(), 10 ** 6 + 100\r\nn, mem, ans = int(input()), [0] * Max, 0\r\nfor i in [int(x) for x in input().split()]:\r\n mem[i] += 1\r\nfor i in range(Max - 1):\r\n mem[i + 1] += mem[i] >> 1\r\n ans += mem[i] & 1\r\nprint(ans)\r\n", "i=int(input())\r\nm=[0]*1001001\r\nfor y in map(int,input().split()):m[y]+=1\r\np=0\r\nt=0\r\nfor x in range(1001001):\r\n p+=m[x]\r\n t+=p%2\r\n p//=2\r\nprint(t)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nres=0\r\nbit=[0]*(10**6+1000)\r\nfor i in a:bit[i]+=1\r\nfor i in range(10**6+999):\r\n bit[i+1]+=bit[i]//2\r\n if bit[i]&1:res+=1\r\nprint(res)\r\n", "import collections\nn = int(input())\na = list(map(int, input().split()))\nc = collections.Counter(a)\nb = [0] * (10**6 + 30)\n\nfor k, v in c.items():\n x = v\n while x:\n x += b[k]\n b[k] = x & 1\n x >>= 1\n k += 1\nprint(sum(b))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncnt=[0]*(10**6+100)\r\nfor i in l:\r\n cnt[i]+=1\r\ns=0\r\nans=0\r\nfor i in cnt:\r\n s+=i\r\n ans+=s%2\r\n s//=2\r\nprint(ans)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nsm=sum(arr)\r\nans=0\r\nar=[0 for i in range(10**6+1)]\r\nfor ele in arr:\r\n ar[ele]+=1\r\nc=0\r\nfor i in range(10**6+1):\r\n ele=ar[i] + c\r\n c=ele//2 \r\n ar[i]=ele%2\r\nwhile c!=0:\r\n ar.append(c&1)\r\n c=c//2\r\nans=ar.count(1)\r\n \r\n \r\nprint(ans)\r\n ", "n=int(input())\r\nA=list(map(int,input().split()))\r\n\r\nd={}\r\nfor i in range(n):\r\n if A[i] in d:\r\n k=A[i]\r\n while k in d:\r\n del d[k]\r\n k+=1\r\n d[k]=1\r\n else:\r\n d[A[i]]=1\r\n \r\nprint(len(d))", "# Description of the problem can be found at http://codeforces.com/problemset/problem/587/A\r\n\r\nn = int(input())\r\nw = map(int, input().split())\r\nm = 1000001\r\ns = [0] * m\r\n\r\nfor i in w:\r\n s[i] += 1\r\n\r\nans = 0\r\nz = 0\r\nfor i in range(m):\r\n n_s = s[i]+z\r\n z = n_s // 2\r\n ans += n_s % 2\r\n\r\nwhile z > 0:\r\n ans += z % 2\r\n z //= 2\r\n\r\nprint(ans)", "def main():\n n = int(input())\n w = list(map(int, input().split()))\n bits = [0] * (10 ** 6 + 100)\n for e in w:\n bits[e] += 1\n cur, res = 0, 0\n for e in bits:\n cur += e\n if cur % 2:\n res += 1\n cur //= 2\n print(res)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nhas=[0]*(1000500)\r\nans=0\r\nfor i in lis:\r\n has[i]+=1\r\nfor i in range(1000499):\r\n has[i+1]+=(has[i]//2)\r\n if(has[i]%2!=0):\r\n ans+=1\r\nprint(ans) ", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import Counter\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nC = Counter(A)\r\n\r\nm = max(C.keys())\r\n\r\nans = 0\r\ni = 0\r\nwhile i<=m:\r\n t = C[i]\r\n C[i+1]+=t//2\r\n ans+=t%2\r\n if t>1:\r\n m = max(m,i+1)\r\n i+=1\r\n \r\nprint(ans)\r\n \r\n\r\n", "from collections import defaultdict\n\nfrom sys import stdin, stdout\nrd = lambda: list(map(int, stdin.readline().split()))\n\nn = int(input())\nws = rd()\n\nnum = defaultdict(int)\n\nc = 0\nfor w in ws:\n i = 0\n while num[w+i] == 1:\n num[w+i] = 0\n c -= 1\n i += 1\n\n num[w+i] = 1\n c += 1\n \n #print('w', w , 'num', num)\n\n#total = sum(2**w for w in ws)\n#true = bin(total)\n\n#print('total', total)\n#print('true res', true.count('1'))\n#print('true', true[2:])\n#print('num ', ''.join(map(str,num[:len(true)-2][::-1])) )\n\nprint(c)\n", " ###### ### ####### ####### ## # ##### ### ##### \r\n # # # # # # # # # # # # # ### \r\n # # # # # # # # # # # # # ### \r\n ###### ######### # # # # # # ######### # \r\n ###### ######### # # # # # # ######### # \r\n # # # # # # # # # # #### # # # \r\n # # # # # # # ## # # # # # \r\n ###### # # ####### ####### # # ##### # # # # \r\n\r\n# from __future__ import print_function # for PyPy2\r\nfrom collections import Counter, OrderedDict\r\nfrom itertools import permutations as perm\r\nfrom fractions import Fraction\r\nfrom collections import deque\r\nfrom sys import stdin\r\nfrom bisect import *\r\nfrom heapq import *\r\nfrom math import *\r\n\r\ng = lambda : stdin.readline().strip()\r\ngl = lambda : g().split()\r\ngil = lambda : [int(var) for var in gl()]\r\ngfl = lambda : [float(var) for var in gl()]\r\ngcl = lambda : list(g())\r\ngbs = lambda : [int(var) for var in g()]\r\nmod = int(1e9)+7\r\ninf = float(\"inf\") \r\n\r\n\r\ng()\r\nn = int(2e6)+2\r\nf = [0]*(n)\r\nans = 0\r\n\r\nfor v in gil():\r\n\tf[v] += 1\r\n\r\n# f[int(1e6)] = int(1e6)\r\n\r\n\r\nfor i in range(n):\r\n\tans += (f[i]&1)\r\n\tf[i] //= 2\r\n\tif f[i]:\r\n\t\tif i+1 < n:\r\n\t\t\tf[i+1] += f[i]\r\n\t\telse:\r\n\t\t\tprint(\"break\")\r\n\t\t\tprint(f[i], i)\r\n\r\nprint(ans)\r\n", "l=[0]*1100001\r\ninput()\r\nfor i in map(int,input().split()):l[i]+=1\r\nfor i in range(1100000):\r\n l[i],l[i+1]=l[i]%2,l[i+1]+l[i]//2\r\nprint(sum(l))" ]

[ "n = int(input())\r\nvals = list(map(int,(input().split())))\r\narith = True\r\ndiff = vals[0]-vals[1]\r\nfor i in range(n-1):\r\n if vals[i]-vals[i+1]!=diff:\r\n arith = False\r\n break\r\nif arith:\r\n print(vals[-1]-diff)\r\nelse:\r\n print(vals[-1])", "import sys\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = a[1] - a[0]\r\nflag = False\r\nfor i in range(1, n):\r\n if a[i] - a[i - 1] != d:\r\n flag = True\r\n break\r\n\r\nif not flag:\r\n print(a[n - 1] + d)\r\nelse:\r\n print(a[n - 1])", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=a[1]-a[0]\r\nz=0\r\nfor i in range(n-1):\r\n if a[i+1]-a[i]!=d:\r\n z=-1\r\nif z==0:\r\n print(a[-1]+d)\r\nelse:\r\n print(a[-1])\r\n\r\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nif n==2:\r\n print(a[1]+a[1]-a[0])\r\nelse:\r\n h=a[1]-a[0]\r\n f=0\r\n for i in range(n-1):\r\n if a[i+1]-a[i]!=h:\r\n f=1\r\n print(a[n-1])\r\n break\r\n if f==0:\r\n print(a[n-1]+h)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=a[1]-a[0]\r\nx=0\r\nfor i in range(1,len(a)):\r\n if(a[i]-a[i-1]==c):\r\n x+=1\r\nif(x==len(a)-1):\r\n print(a[-1]+c)\r\nelse:\r\n print(a[-1])\r\n", "n = int(input())\nt = [int(i) for i in input().split(\" \")]\ndiff = t[1] - t[0]\nalert = 0\nfor i in range(len(t) - 1):\n if t[i+1] - t[i] != diff:\n alert = 1\n break\n\nif alert == 0:\n print(t[-1] + diff)\nelse:\n print(t[-1])", "cnt=lambda s,i:s.count(i)\r\nii=lambda:int(input())\r\nsi=lambda:input()\r\nf=lambda:map(int,input().split())\r\nil=lambda:list(map(int,input().split()))\r\nn=ii()\r\nl=il()\r\nd=l[1]-l[0]\r\nfor i in range(1,n):\r\n if l[i]-l[i-1]!=d:\r\n exit(print(l[-1]))\r\nprint(l[-1]+d)", "n=int(input())\r\na=list(map(int,input().split()))[:n]\r\nb=[]\r\nfor i in range(len(a)-1):\r\n b.append((a[i+1]-a[i]))\r\nif b.count(b[0])==len(b):\r\n print(a[-1]+b[0])\r\nelse:\r\n print(a[-1])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = a[1] - a[0]\r\nt = 1\r\n\r\ni = 2\r\nwhile(i < len(a)):\r\n cur = a[i] - a[i - 1]\r\n if(cur != d):\r\n t = 0\r\n break\r\n i = i + 1\r\n\r\nprint(a[-1] + t * d)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(1,n):\r\n d.append(l[i]-l[i-1])\r\ns=len(set(d))\r\nif s==1:\r\n print(l[n-1]+d[0])\r\nelse:\r\n print(l[n-1])", "n = int(input())\r\n\r\ndaf = list(map(int, input().split()))\r\n\r\nfd = daf[1] - daf[0]\r\n\r\nfor i in range(n - 1):\r\n if daf[i+1] - daf[i] != fd:\r\n print(daf[-1])\r\n break\r\nelse:\r\n print(daf[-1] + fd)\r\n", "n = int(input())\nt = [int(i) for i in input().split()]\nd = t[1] - t[0]\nfor i in range(2, n):\n if d != t[i] - t[i-1]:\n d = 0\nprint(t[n-1] + d)\n", "n = int(input())\r\nw = [int(x) for x in input().split()]\r\np = 0\r\nd = w[1] - w[0]\r\nf = True\r\nfor i in range(n-1):\r\n if w[i+1] - w[i] != d:\r\n f = False\r\nif f:\r\n p = w[n-1] + d\r\nelse:\r\n p = w[n-1]\r\nprint(p)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd=l[1]-l[0]\r\nflag = 0\r\nfor i in range(0,n-1):\r\n if l[i+1]-l[i]!=d:\r\n flag=1\r\n print(l[n-1])\r\n break\r\nelse:\r\n last = l[0]+(n*d)\r\n print(last)\r\n", "\nInput=lambda:map(int,input().split())\nn = int(input())\nWeather = list(Input())\nProgression = Weather[0] - Weather[1]\nfor i in range(2,n):\n if Weather[i-1] - Weather[i] != Progression:\n Progression = None\n break\n\nif Progression == None:\n print(Weather[-1])\nelse:\n print(Weather[-1] - Progression)\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nk=l[1]-l[0]\r\np=0\r\nfor i in range(1,n-1):\r\n if l[i+1]-l[i]!=k:\r\n p=1\r\n break\r\nif p==0:\r\n print(l[-1]+k)\r\nelse:\r\n print(l[-1])", "n=int(input())\r\n\r\nt=list(map(int,input().split()))\r\n\r\nd=t[1]-t[0]\r\nari=True\r\nanswer=t[n-1]\r\n\r\nfor i in range(1,n):\r\n if t[i]-t[i-1]!=d:\r\n ari=False\r\n\r\nif ari:\r\n answer=t[n-1]+d\r\nprint(answer)\r\n\r\n", "fast=lambda:stdin.readline().strip()\nzzz=lambda:[int(i) for i in fast().split()]\nz,zz=input,lambda:list(map(int,z().split()))\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\nfrom re import *\nfrom sys import *\nfrom math import *\nfrom heapq import *\nfrom queue import *\nfrom bisect import *\nfrom string import *\nfrom itertools import *\nfrom collections import *\nfrom math import factorial as f\nfrom bisect import bisect as bs\nfrom bisect import bisect_left as bsl\nfrom collections import Counter as cc\nfrom itertools import accumulate as ac\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\ndef output(answer):stdout.write(str(answer))\ndef take():input=open('input.txt', 'r');stdout=open('output.txt', 'w')\n###########################---Test-Case---#################################\n\"\"\"\n\n If you think, You Know me, Then you probably don't know me !\n\n\n\"\"\"\n###########################---START-CODING---##############################\n\nn=int(z())\n\narr=zzz()\n\nr=arr[1]-arr[0]\nprint(arr[-1]+r*all(y-x==r for x,y in zip(arr,arr[1:])))\n\n\n\n\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\n\r\nlength = int(input())\r\narr = [int(x) for x in input().split()]\r\ndif = arr[1] - arr[0]\r\n\r\nis_areth = True\r\nfor j in range(2, length):\r\n if arr[j] - arr[j-1] != dif:\r\n is_areth = False\r\n break\r\n\r\nprint(arr[-1] + dif if is_areth else arr[-1])", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\np = True\r\nfor i in range(1, n-1):\r\n if l1[i] != (l1[i-1] + l1[i+1])/2:\r\n p = False\r\nif p:\r\n print(2*l1[n-1]-l1[n-2])\r\nelse:\r\n print(l1[n-1])\r\n", "n = int(input())\r\n*a, = map(int, input().split())\r\nfor i in range(2, n):\r\n if a[i - 2] - a[i - 1] != a[i - 1] - a[i]:\r\n print(a[-1])\r\n exit()\r\nprint(a[1] - a[0] + a[-1])", "n = int(input())\r\n\r\nt =list(map(int, input().split()))\r\n\r\np = t[0]\r\ns = set()\r\nd = 0\r\nfor i in range(1, n):\r\n d = t[i] - p\r\n s.add(d)\r\n\r\n p = t[i]\r\n\r\nif len(s) == 1:\r\n print(t[n-1] + d)\r\nelse:\r\n print(t[n-1])", "n = int(input())\r\nt = list(map(int, input().split()))\r\nc = t[1]-t[0]\r\nflag = True\r\nfor i in range(2,n):\r\n if(t[i]-t[i-1] != c):\r\n flag = False\r\nif(flag):\r\n print(t[n-1]+c)\r\nelse:\r\n print(t[n-1])\r\n\r\n\r\n ", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Feb 14 13:06:18 2020\r\n\r\n@author: jared\r\n\"\"\"\r\n\r\n_ = input()\r\ntemperature = list(map(int, input().split()))\r\ndifferences = list(map(lambda x, y: x-y, temperature[:-1], temperature[1:]))\r\nif len(set(differences)) == 1:\r\n print(temperature[-1] - differences[0])\r\nelse:\r\n print(temperature[-1])", "n = int(input())\r\nargs = input().split(\" \")\r\ntargs = []\r\ns2 = 0\r\nfor arg in args:\r\n targs.append(int(arg))\r\n s2 = s2 + int(arg)\r\ns1 = (targs[0] + targs[n - 1]) * n / 2\r\nd = targs[1] - targs[0]\r\nk = 0\r\nfor i in range(0,len(targs) - 1):\r\n if targs[i] + d != targs[i + 1]:\r\n k = k + 1\r\nif s1 == s2 and k == 0:\r\n d = targs[1] - targs[0]\r\n print(targs[n - 1] + d)\r\nelse:\r\n print(targs[n - 1])\r\n", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif n == 1:\r\n print(a[0])\r\nelse:\r\n ini = a[1]-a[0]\r\n m = 1\r\n for i in range(1, n):\r\n if ini != a[i]-a[i-1]:\r\n m = 0\r\n\r\n if m:\r\n print(a[-1]+ini)\r\n else:\r\n print(a[-1])\r\n", "n = int(input())\r\nweather = input().split()\r\nfor i in range(n):\r\n weather[i] = int(weather[i])\r\ndef arithmetic(sequence):\r\n a = sequence[1] - sequence[0]\r\n sequence.append(\"e\")\r\n for i in range(len(sequence)):\r\n if sequence[i + 1] - sequence[i] == a:\r\n if sequence[i + 2] == \"e\":\r\n return sequence[i + 1] + a\r\n else:\r\n return sequence[len(sequence) - 2]\r\nprint(arithmetic(weather))", "n=int(input())\r\nls=list(map(int,input().split()))\r\ndiff=ls[1]-ls[0]\r\nflag=False\r\nfor z in range(n-1):\r\n if ls[z+1]-ls[z]==diff:\r\n continue\r\n else:\r\n flag=True\r\nif flag:\r\n print(ls[-1])\r\nelse:\r\n print(ls[-1]+diff)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\ndiff, flag = a[1]-a[0], True\r\nfor i in range(2,n):\r\n if a[i]-a[i-1] != diff:\r\n flag = False\r\nprint(a[-1]+diff) if flag else print(a[-1])", "n = int(input())\r\nl = list(map(int, input().split()))\r\nd = l[1] - l[0]\r\ni = 1\r\nwhile i + 1 < n and l[i + 1] - l[i] == d:\r\n i += 1\r\n\r\nif i + 1 != n:\r\n print(l[n - 1])\r\nelse:\r\n print(l[n - 1] + d)\r\n ", "def main():\n n = int(input())\n temps = [int(_) for _ in input().split()]\n\n is_arithmetic_progression = True\n first_distance = temps[1] - temps[0]\n\n for i in range(1, n - 1):\n if temps[i + 1] - temps[i] != first_distance:\n is_arithmetic_progression = False\n break\n\n result = temps[n - 1] + first_distance if is_arithmetic_progression else temps[n - 1]\n print(result)\n\n\nif __name__ == '__main__':\n main()\n", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\n\r\nn = int(input())\r\n\r\nl = list(map(int, input().split()))\r\nd = l[1] - l[0]\r\narth = True\r\nfor i in range(n - 1):\r\n if l[i + 1] - l[i] != d:\r\n arth = False\r\n\r\nif arth == True:\r\n print(l[n - 1] + d)\r\nelse:\r\n print(l[n - 1])\r\n", "def delta(xs):\r\n res = xs[1] - xs[0]\r\n for i in range(2, len(xs)):\r\n if xs[i] - xs[i-1] != res:\r\n return None\r\n return res\r\n\r\nn = int(input())\r\nxs = [int(r) for r in input().split()]\r\nd = delta(xs)\r\nprint(xs[-1] if d is None else xs[-1] + d)\r\n", "#input code\r\nn = int(input())\r\nflag = 0\r\narr = list(map(int,input().split()))\r\n\r\n#solve code\r\ndis = arr[1] - arr[0]\r\nfor i in range(n-1):\r\n if arr[i] + dis != arr[i+1]:\r\n print(arr[n-1])\r\n flag = 1\r\n break\r\nif flag == 0:\r\n print(arr[n-1]+dis)", "n=int(input())\r\ndays=list(map(int,input().split()))\r\nchange=0\r\nfor i in range(n-1):\r\n if i==0:\r\n diff=days[i]-days[i+1]\r\n else:\r\n if diff!=days[i]-days[i+1]:\r\n change=1\r\n\r\nif change==0:\r\n print(days[n-1]-diff)\r\nelse:print(days[n-1])", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nf = nums[0]\r\ns = nums[1]\r\n\r\ndiff = f - s\r\n\r\nflag = True\r\nfor i in range(2, n):\r\n x = nums[i]\r\n if s - x != diff:\r\n flag = False\r\n break\r\n s = x\r\n\r\nif flag == True:\r\n print(nums[-1] - diff)\r\nelse:\r\n print(nums[-1])", "import sys\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nfor i in range(1,len(t)-1):\r\n if t[i]-t[i-1]!=t[i+1]-t[i]:\r\n print(t[len(t)-1])\r\n sys.exit()\r\nprint(t[len(t)-1]+(t[1]-t[0]))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ns = a[1] - a[0]\r\nf = 0\r\nfor i in range(len(a[:-1])):\r\n if a[i+1] - a[i] != s:\r\n f = 1\r\nif f==1:\r\n print(a[-1])\r\nelse:\r\n print(a[-1] + a[-1] - a[-2])\r\n", "n = int(input().strip())\nvals = [int(x) for x in (input().strip().split())]\nterm = vals[1]\nd = vals[1]-vals[0]\nap = True\nfor x in range(2,n):\n\tnext_term = vals[x]\n\tif (next_term-term != d):\n\t\tap = False\n\tterm = next_term\n\nif ap:\n\tprint(term+d)\nelse:\n\tprint(term)", "n=int(input())\r\na=list(map(int,input().split()))\r\nif n==2:\r\n print(a[1]+a[1]-a[0])\r\nelse:\r\n c=a[1]-a[0]\r\n z=0\r\n for i in range(1,n-1):\r\n d=a[i+1]-a[i]\r\n if d==c:\r\n continue\r\n else:\r\n z=1\r\n break\r\n if z==0:\r\n print(a[n-1]+a[n-2]-a[n-3])\r\n else:\r\n print(a[n-1])\r\n", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\nsum=x[1]-x[0]\r\nfor i in range(2,n):\r\n if x[i]-x[i-1]==sum:continue\r\n else:\r\n print(x[n-1])\r\n exit()\r\nprint(x[n-1]+sum)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nc=0;d=a[1]-a[0]\r\nfor i in range(1,n):\r\n if a[i]==a[0]+(i)*d:\r\n c+=1\r\nif c==n-1:\r\n print(a[n-1]+d)\r\nelse:\r\n print(a[-1])", "input()\r\n*a, = map(int, input().split())\r\nb, c = a[-2:]\r\nprint((2 * c - b, c)[any(i - j != b - c for i, j in zip(a, a[1:]))])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ndef f(n,l):\r\n\ta=l[0]\r\n\td=l[1]-l[0]\r\n\tfor i in range(n):\r\n\t\tan=a+i*d\r\n\t\tif l[i]!=an:\r\n\t\t\treturn l[-1]\r\n\treturn a+n*d\r\nprint(f(n,l))", "import sys\r\n\r\nn = int(input())\r\narr = list(input().split())\r\ntemp = int(arr[0]) - int(arr[1])\r\n\r\nfor i in range (1 , n-1) :\r\n if int (arr[i]) - int(arr[i+1]) != temp :\r\n print(arr[n-1])\r\n sys.exit()\r\n\r\nprint (int(arr[n-1]) - temp)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\n# -*- coding: utf-8 -*-\r\n# @Date : 2019-01-23 13:56:09\r\n# @Author : raj lath ([email protected])\r\n# @Link : link\r\n# @Version : 1.0.0\r\n\r\nfrom sys import stdin\r\n\r\nmax_val=int(10e12)\r\nmin_val=int(-10e12)\r\n\r\ndef read_int() : return int(stdin.readline())\r\ndef read_ints() : return [int(x) for x in stdin.readline().split()]\r\ndef read_str() : return input()\r\ndef read_strs() : return [x for x in stdin.readline().split()]\r\n\r\n\r\nnb_days = int(input())\r\ntemps = read_ints()\r\navg_days = [(b - a) for a, b in zip(temps, temps[1:])]\r\nif len(set(avg_days)) == 1:\r\n print(temps[-1] + avg_days[0])\r\nelse:\r\n print(temps[-1])\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\nif n>2:\r\n\tfor i in range(2,n):\r\n\t\tif li[i]-li[i-1] != li[i-1]-li[i-2]:\r\n\t\t\tans=li[-1]\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tans=2*li[-1]-li[-2]\r\nelse:\r\n\tans=2*li[1]-li[0]\r\nprint(ans)", "# LUOGU_RID: 101672805\nn, *a = map(int, open(0).read().split())\r\nif all(2 * a[i] == a[i - 1] + a[i + 1] for i in range(1, n - 1)):\r\n print(2 * a[-1] - a[-2])\r\nelse:\r\n print(a[-1])", "from collections import defaultdict\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ndifs = []\r\nfor i in range(1, n):\r\n difs.append(arr[i] - arr[i - 1])\r\n\r\ndif_s = set(difs)\r\nif len(dif_s) == 1:\r\n dif = dif_s.pop()\r\n print(arr[-1] + dif)\r\nelse:\r\n print(arr[-1])\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\ndiff = l[1]-l[0]\r\nflag = 0\r\nfor i in range(2,n):\r\n\tif l[i] - l[i-1] == diff:\r\n\t\tpass\r\n\telse:\r\n\t\tflag = 1\r\n\t\tbreak\r\nif flag == 0:\r\n\tprint(l[-1]+diff)\r\nelse:\r\n\tprint(l[-1])\r\n\r\n", "a = int(input())\r\ns = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(1, len(s) - 1):\r\n if s[i] - s[i - 1] == s[i + 1] - s[i]:\r\n k += 1\r\nif a == 2:\r\n print(s[-1] + (s[-1] - s[-2]))\r\nelif k == a - 2:\r\n print(s[-1] + (s[-1] - s[-2]))\r\nelse:\r\n print(s[-1])", "n=int(input())\r\nt=list(map(int,input().split()))\r\nd=[]\r\nfor i in range(n-1):\r\n d.append(t[i+1]-t[i])\r\nif d.count(d[0])==len(d):\r\n print(t[n-1]+d[0])\r\nelse:\r\n print(t[n-1])\r\n", "x=input()\r\nx=int(x)\r\nre_temp=input()\r\nre_temp = re_temp.split(\" \")\r\ntemp=[]\r\nfor i in range(0,len(re_temp)):\r\n temp.append(int(re_temp[i]))\r\n\r\n\r\n\r\ncheck = temp[1]-temp[0]\r\nconunter=0\r\nfor i in range (1,len(temp)-1):\r\n if temp[i+1]-temp[i]== check:\r\n conunter= conunter +1\r\nif conunter== (len(temp)-2):\r\n print(temp[len(temp)-1]+check)\r\nelse:\r\n print(temp[len(temp)-1])", "n = int(input())\n\na = list(map(int,input().strip().split(' ')))\n\nd = a[1] - a[0]\nfl = True\nfor i in range(2,n):\n\tcd = a[i] - a[i-1]\n\tif d != cd:\n\t\tfl = False\n\t\tbreak\n\t\nif fl:\n\tprint(a[n-1] + d)\nelse:\n\tprint(a[n-1])\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nif a==2 or all((b[i+1]-b[i]==b[i+2]-b[i+1])for i in range(a-2)):\r\n\tprint(b[1]-b[0]+b[a-1])\r\nelse:\r\n\tprint(b[a-1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nt=[]\r\nfor i in range(1,n):\r\n t +=[l[i]-l[i-1]]\r\nif len(set(t))==1:\r\n print(l[n-1]+(l[1]-l[0]))\r\nelse:\r\n print(l[-1])\r\n \r\n \r\n", "def pogoda(lst):\r\n d, flag = lst[1] - lst[0], 1\r\n for i in range(len(lst)):\r\n if i + 1 < len(lst) and lst[i + 1] - lst[i] != d:\r\n flag = 0\r\n if flag == 1:\r\n return d + lst[len(lst) - 1]\r\n return lst[len(lst) - 1]\r\n\r\n\r\nn = int(input())\r\nb = [int(j) for j in input().split()]\r\nprint(pogoda(b))\r\n", "f,n,l=0,int(input()),list(map(int,input().split()))\r\nd=l[1]-l[0]\r\nfor x in range(1,n-1):\r\n\tif l[x+1]-l[x]!=d:f=1\r\nprint([l[-1]+d,l[-1]][f==1])", "n = int(input())\r\nt = list(map(int, input().split()))\r\nd = t[1] - t[0]\r\nflag = True\r\nfor i in range(1, n - 1):\r\n if t[i+1] - t[i] == d:\r\n continue\r\n else:\r\n flag = False\r\n break\r\n\r\nif flag:\r\n print(t[-1] + d)\r\nelse:\r\n print(t[-1])", "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\nnum = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ndif = set()\r\n\r\nprev = arr.pop(0)\r\n\r\nfor n in arr:\r\n dif.add(prev-n)\r\n prev = n\r\n\r\nif len(dif) == 1:\r\n print(arr[-1] - list(dif)[0])\r\nelse:\r\n print(arr[-1])\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\nf=0\r\nd=l[1]-l[0]\r\nif n>2:\r\n for i in range(n-1):\r\n if l[i+1]-l[i]!=d:\r\n f=1\r\n break\r\nif f:\r\n print(l[-1])\r\nelse:\r\n print(l[-1]+d)", "n = int(input())\r\nv = list(map(int, input().split()))\r\n\r\ndef solve():\r\n\td = v[1] - v[0]\r\n\tfor i in range(1, n):\r\n\t\tif v[i] - v[i-1] != d:\r\n\t\t\tprint(v[n-1])\r\n\t\t\treturn\r\n\tprint(v[n-1] + d)\r\n\t\t\r\nsolve()\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nfor i in range(len(a)-1):\r\n t=(a[i+1]-a[i])\r\n b.append(t)\r\nb1=set(b)\r\nif len(b1)==1:\r\n ans=(a[0]+n*b[0])\r\n print(ans)\r\nelse:\r\n print(a[n-1])", "count = int(input())\r\narray = list(map(int, input().split()))\r\n\r\ndiff = array[0] - array[1]\r\nholds = True\r\n\r\nfor index in range(1, len(array)-1):\r\n if array[index] - array[index+1] != diff:\r\n holds = False\r\n\r\nif holds:\r\n print(array[-1] - (array[-2] - array[-1]))\r\nelse:\r\n print(array[-1])\r\n\r\n \r\n", "n = int(input())\nl = [int(x) for x in input().split()]\n\nd = l[1] - l[0]\nfor i in range(2, n):\n\tif l[i] != l[i - 1] + d:\n\t\td = 0\nprint(l[-1] + d)", "n=int(input())\r\nt=list(map(int,input().split(' ')))\r\ns=set([])\r\nfor i in range(1,n):\r\n x=t[i]-t[i-1]\r\n s.add(x)\r\nif len(s)==1:\r\n print(t[-1]+x)\r\nelse:\r\n print(t[-1])", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\navg = arr[0] - arr[1]\r\nfor i in range(n - 1):\r\n if arr[i] - arr[i + 1] != avg:\r\n print(arr[n - 1])\r\n exit(0)\r\nprint(arr[n - 1] - avg)\r\n", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\nd=arr[0]-arr[1]\r\nans=arr[-1]\r\nfor i in range(2,n):\r\n diff=arr[i-1]-arr[i]\r\n if diff!=d:\r\n break\r\nelse:\r\n ans=arr[-1]-d\r\nprint(ans)\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\nimport itertools\r\nimport random\r\nimport re\r\n\r\ndef is_arithmetic_progression(A):\r\n n = len(A)\r\n for i in range(2, n):\r\n if A[i] != 2 * A[i-1] - A[i-2]:\r\n return False\r\n return True\r\n\r\ndef main():\r\n n = int(input())\r\n A = list(map(int, input().split()))\r\n if is_arithmetic_progression(A):\r\n print(A[-1] * 2 - A[-2])\r\n else:\r\n print(A[-1])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ndiff = set()\r\npre = a[0]\r\nfor i in range(1, n):\r\n diff.add(a[i] - pre)\r\n pre = a[i]\r\n\r\nif len(diff) == 1:\r\n q = diff.pop()\r\n print(a[-1] + q)\r\nelse:\r\n print(a[-1])\r\n", "n=int(input())\r\nx=input().split()\r\nif(x.count(x[0])==n):print(x[n-1])\r\nelse:\r\n y=[]\r\n d=int(x[1])-int(x[0])\r\n for i in range(n-1):\r\n y.append(int(x[i+1])-int(x[i]))\r\n if(y.count(d)==n-1):print(int(x[-1])+d)\r\n else:\r\n print(x[-1])", "n = int(input())\r\nT = list(map(int, input().split()))\r\n\r\nprint(T[-1] if len({T[i+1]-T[i] for i in range(n-1)}) > 1 else 2*T[-1]-T[-2])", "import sys\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nc=t[1]-t[0]\r\nfor x in range(n-1):\r\n if t[x+1]-t[x]!=c:\r\n print(t[-1])\r\n sys.exit()\r\nprint(t[-1]+c)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nans1 = a[1]-a[0]\r\nfor i in range(len(a)-1):\r\n if a[i+1] - a[i] != ans1: print(a[-1]); exit()\r\nprint(a[-1]+ans1)", "import sys\r\nimport math\r\n\r\n#to read string\r\nget_string = lambda: sys.stdin.readline().strip()\r\n#to read list of integers\r\nget_int_list = lambda: list( map(int,sys.stdin.readline().strip().split()) )\r\n#to read integers\r\nget_int = lambda: int(sys.stdin.readline())\r\n#to print fast\r\npt = lambda x: sys.stdout.write(str(x)+'\\n')\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\nd = lst[1] - lst[0]\r\nflag = True\r\nfor i in range(1,n):\r\n if lst[i] - lst[i-1] != d:\r\n flag = False\r\n break\r\nif flag:\r\n print(lst[-1]+d)\r\nelse:\r\n print(lst[-1])", "\r\n\r\nn=int(input())\r\n\r\nl=list(map(int,input().split()))\r\n\r\na=l[0]\r\nd=l[1]-l[0]\r\n\r\nfor i in range(2,n):\r\n\tif(l[i]-l[i-1]!=d):\r\n\t\tprint(l[n-1])\r\n\t\texit()\r\nprint(a+n*d)\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\nd = t[1] - t[0]\r\nfor i in range(n-1):\r\n if d != t[i+1] - t[i]:\r\n print(t[n-1])\r\n break\r\n elif i == n-2:\r\n print(t[n-1] + d)\r\n", "n = int(input())\r\narr = input().split()\r\narr = [int(x) for x in arr]\r\nexp = arr[1] - arr[0]\r\njudge = 0\r\nfor i in range(2, len(arr)):\r\n if arr[i] - arr[i-1] == exp:\r\n continue\r\n else:\r\n judge = 1\r\n break\r\nif judge == 1:\r\n print(arr[-1])\r\nelse:\r\n print(arr[-1] + exp)", "\n\nn = int(input())\narr = [int(x) for x in input().split()]\n\nn_1 = arr[1] - arr[0]\nfor ind, item in enumerate(arr[1:]):\n n_2 = arr[ind+1] - arr[ind]\n if n_1 != n_2:\n ans = arr[-1]\n break\nelse:\n ans = arr[-1] + n_1\n\nprint(ans)\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\nlast = 0\r\nflag = False\r\nfor i in range(1, n):\r\n temp = t[i] - t[i - 1]\r\n if temp != last and i != 1:\r\n flag = True\r\n last = temp\r\n\r\nif flag:\r\n print(t[-1])\r\nelse:\r\n print(t[-1] + last)", "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\ndef solve():\r\n n=I()\r\n arr=lst()\r\n d=arr[1]-arr[0]\r\n flag=True\r\n for i in range(n-1):\r\n if arr[i+1]-arr[i] == d:\r\n pass\r\n else:\r\n flag=False\r\n break\r\n\r\n if flag:\r\n print(arr[n-1]+d)\r\n else:\r\n print(arr[n-1])\r\n\r\n\r\n#MAIN CODE\r\nt = 1\r\n#t = I()\r\nwhile t:\r\n solve()\r\n t -= 1", "def check(a,d):\r\n for i in range(1, len(a)-1):\r\n x = a[i+1] - a[i]\r\n if x != d:\r\n return False\r\n return True\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nif n == 2:\r\n print(2*a[1]-a[0])\r\nelif n == 1:\r\n print(a[0])\r\nelse:\r\n d = a[1]- a[0]\r\n if check(a,d):\r\n print(a[-1]+d)\r\n else:\r\n print(a[-1])\r\n", "n = int(input())\r\nt = list(map(int, input().strip().split()))\r\n\r\nis_arifm = True\r\nd = t[1]-t[0]\r\nfor i in range (2, n):\r\n if t[i] - t[i-1] != d:\r\n is_arifm = False\r\n break\r\n\r\nif is_arifm:\r\n print(t[n-1]+d)\r\nelse:\r\n print(t[n-1])", "a=int(input())\r\np=[int(i) for i in input().split()]\r\nt=p[1]-p[0]\r\nf='YES'\r\nif a==2:\r\n print(p[1]+t)\r\nelse:\r\n for i in range(2,a):\r\n z=p[i]-p[i-1]\r\n if z!=t:\r\n f='NO'\r\n if f=='NO':\r\n print(p[-1])\r\n else:\r\n print(p[-1]+t)\r\n", "days = int(input())\r\n\r\nT = list(map(int, input().split()))\r\n\r\nif days == 1:\r\n print(T[-1])\r\nelse:\r\n gaps = T[1] - T[0]\r\n for i in range(1, days):\r\n if T[i] - T[i - 1] != gaps:\r\n gaps = 0\r\n break\r\n print(T[-1] + gaps)", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = a[1] - a[0]\r\nfor i in range(1, n - 1, 1):\r\n if a[i + 1] - a[i] != d:\r\n exit(print(a[-1]))\r\nprint(a[-1] + d)\r\n", "n = int(input())\r\narr =list(map(int,input().split()))\r\n\r\nm = arr[0]-arr[1]\r\nx = True\r\nfor i in range(1,n):\r\n if (arr[i-1]-arr[i]==m):\r\n continue\r\n else :\r\n x = False\r\nif x == True: print(arr[n-1]-m)\r\nelse : print(arr[n-1])", "days = int(input())\ntemp_list = input().split()\ntemp_list = [int(x) for x in temp_list]\nnext_day = temp_list[0]\nif days > 1:\n diff_days = temp_list[1] - temp_list[0]\n if days > 2:\n for i in range(1,days - 1):\n if temp_list[i + 1] - temp_list[i] != diff_days:\n next_day = temp_list[-1]\n break\n next_day = temp_list[-1] + diff_days\n else:\n next_day = diff_days + temp_list[1]\nprint(next_day)", "\r\n\r\n\r\na = int(input())\r\n\r\n\r\nt= list(map(int,input().split()))\r\n\r\nf=[]\r\n\r\n\r\nfor k in range(1,a):\r\n f.append(t[k]-t[k-1])\r\n\r\nif len(set(f))==1:\r\n print(t[-1]+f[0])\r\nelse:\r\n print(t[-1])\r\n", "n = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nflag = True\r\ngap = data[1] - data[0]\r\nfor i in range(1, n):\r\n if data[i] - data[i - 1] != gap:\r\n flag = False\r\n break\r\n\r\nif not flag:\r\n print(data[-1])\r\nelse:\r\n print(data[-1] + gap)", "n=int(input())\r\nnd=list(map(int, input().split()))\r\ndis=False\r\ntemp=False\r\nchuoi=True\r\nfor i in nd:\r\n if not dis and not temp:\r\n temp=i\r\n elif not dis:\r\n dis=i-temp\r\n temp=i\r\n elif i-temp!=dis:\r\n chuoi=False\r\n break\r\n else:\r\n temp=i\r\nif chuoi:\r\n print(nd[len(nd)-1]+dis)\r\nelse:\r\n print(nd[len(nd)-1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=l[1]-l[0]\r\nfor i in range(2,n):\r\n if l[i]-l[i-1]!=d:\r\n print(l[-1])\r\n break\r\nelse:\r\n print(l[-1]+d)", "def weather(a, n):\r\n d = a[1] - a[0]\r\n t = 1\r\n if(n == 2):\r\n return(a[1] + d)\r\n else:\r\n for i in range(1, n-1):\r\n if(a[i+1] - a[i]) == d:\r\n continue\r\n else:\r\n t = 0\r\n break\r\n if(t == 0):\r\n return(a[-1])\r\n else:\r\n return(a[-1] + d)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nprint(weather(a, n))", "def WeatherTomorrow(n,seq):\r\n\ti=1\r\n\tfirstDiff = seq[1] - seq[0]\r\n\twhile i<n-1:\r\n\t\tdiff = seq[i+1] - seq[i]\r\n\t\tif diff!=firstDiff:\r\n\t\t\treturn seq[n-1]\r\n\t\ti+=1\r\n\r\n\treturn seq[n-1]+firstDiff\r\n\r\nn = int(input())\r\nseq = [int(x) for x in input().split()]\r\n\r\nprint(WeatherTomorrow(n,seq))", "n = int(input())\r\nA = list(map(int, input().split()))\r\nd = A[1] - A[0]\r\nfor i in range(2, n):\r\n if A[i] - A[i - 1] != d:\r\n print(A[-1])\r\n break\r\nelse:\r\n print(A[-1] + d)\r\n\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd=l[1]-l[0]\r\nflag=0\r\nfor i in range(1,len(l)):\r\n\tif l[i]-l[i-1]!=d:\r\n\t\tflag=1\r\n\t\tbreak\r\nif flag==1:\r\n\tprint(l[n-1])\r\nelse:\r\n\tprint(l[n-1]+d)", "def checkArithmetic (seq,diff,length):\r\n isSeq = True; i = 1\r\n while (i+1 < length):\r\n r = seq[i+1] - seq[i]\r\n if r != diff:\r\n isSeq = False\r\n break\r\n i+=1\r\n return isSeq\r\nsize = int(input()); sequence = list(map(int,input().split()))\r\ncurrDiff = sequence[1] - sequence[0]\r\nprint (currDiff+sequence[-1] if checkArithmetic(sequence,currDiff,size) else sequence[-1])", "#https://codeforces.com/contest/847/problem/M\r\n\r\nn = int(input())\r\nt = [int(i) for i in input().split()]\r\n\r\nd = t[1] - t[0]\r\nfor i in range(1, n - 1):\r\n if t[i] + d != t[i + 1]:\r\n print(t[-1])\r\n break\r\nelse:\r\n print(t[-1] + d)", "def solve():\n\tdias = int(input())\n\tnumbers = list(map(lambda x: int(x) , input().split(' ')))\n\tdiferencia = numbers[1] - numbers[0]\n#\tprint('diferencia', diferencia)\n\tfor i in range(len(numbers) - 1 ):\n\t\tif numbers[i+1]-numbers[i] == diferencia:\n\t\t\tcontinue\n\t\telse:\n\t\t\tprint(numbers[len(numbers)-1])\n\t\t\treturn\n\tprint(numbers[len(numbers)-1] + diferencia)\n\n\n\n\nwhile True:\n\ttry:\n\t\tsolve()\n\texcept:\n\t\tbreak\n \t \t\t \t \t\t \t \t\t \t\t\t\t\t \t", "from collections import Counter\r\nn = int(input())\r\narr = list(map(lambda x: int(x), input().split()))\r\n\r\n\r\nflag, index, in_flag = 0, 0, 0\r\nif len(arr)==1:\r\n res = arr[-1]\r\nelif len(arr)==2:\r\n res = arr[1] + arr[1]-arr[0]\r\nelse:\r\n in_flag = 1\r\n for ind, val in enumerate(arr):\r\n if ind==len(arr)-1:\r\n break\r\n if ind==0:\r\n d = arr[ind+1]- val\r\n else: \r\n if arr[ind+1]-arr[ind]!=d:\r\n flag = 1\r\n break\r\n\r\nif in_flag: \r\n if flag:\r\n res = arr[-1]\r\n else:\r\n res = d+arr[-1]\r\n\r\nprint(res) \r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nf=0\r\nfor i in range (2,len(l)):\r\n if l[i]==l[i-1]+(l[1]-l[0]):\r\n pass\r\n else:\r\n f=1\r\n print(l[n-1])\r\n break\r\nif f==0:\r\n if (l[n-1])==(l[0]+(n-1)*(l[1]-l[0])):\r\n\r\n print(l[0]+(n*(l[1]-l[0])))\r\n else:\r\n print(l[n-1])\r\n", "n=int(input())\r\ndays=list(map(int,input().split()))\r\n\r\noffset=days[1]-days[0]\r\nlast_day=days[n-1]\r\nfor i in range(1,n-1):\r\n\tif offset!=days[i+1]-days[i]:\r\n\t\tbreak\r\nelse:\r\n\tlast_day+=offset\r\nprint(last_day)", "n=int(input())\r\na=[*map(int,input().split())]\r\nr=a[1]-a[0]\r\nprint(a[-1]+r*all(y-x==r for x,y in zip(a,a[1:])))\r\n", "i=int(input())\r\nl=list(map(int,input().split()))\r\nc=l[1]-l[0];t=False\r\nfor x in range(1,i):\r\n if l[x]-l[x-1]!=c: t=True\r\nif t: print(l[-1])\r\nelse: print(l[-1]+c)", "import math\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\nl=[]\r\nfor i in range(1,len(a)):\r\n l.append(abs(a[i-1]-a[i]))\r\nif(len(set(l))==1):\r\n if(a[1]>=a[0]):\r\n print(a[len(a)-1]+(l[0]))\r\n else:\r\n print(a[len(a)-1]-l[0])\r\nelse:\r\n print(a[len(a)-1])", "def solve():\n n = int(input())\n a = list(map(int, input().split()))\n d = a[1] - a[0]\n for i in range(2, n):\n if a[i] - a[i - 1] != d:\n return a[-1]\n return a[-1] + d\n \nprint(solve())\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=a[0]\r\na2=a[1]\r\nd=a2-a1\r\ni=0\r\nans=1\r\nwhile i<n and ans!=0:\r\n if a1+i*d==a[i]:\r\n pass\r\n else:\r\n ans=0\r\n i+=1\r\nif ans==0:\r\n print(a[n-1])\r\nelse:\r\n print(a[n-1]+d)", "n=int(input())\r\na=list(map(int,input().split()))\r\nd=a[1]-a[0]\r\nfor i in range(2,n):\r\n\tif a[i]!=a[i-1]+d:\r\n\t\td=0\r\nprint(a[-1]+ d)", "n = int(input())\r\na = list(map(int, input().split()))\r\ns = set()\r\nfor i in range(1, n):\r\n s.add(a[i] - a[i - 1])\r\n \r\nif len(s) == 1:\r\n print(a[n - 1] + (a[n - 1] - a[n - 2]))\r\nelse:\r\n print(a[n - 1])", "n = int(input())\na = list(map(int, input().split()))\nf = 1\n\nif n == 2:\n\tprint(a[1] + (a[1] - a[0]))\nelse:\n\td1 = a[1] - a[0]\n\td2 = a[2] - a[1]\n\tif d1 == d2:\n\t\tfor i in range(2, (n - 1)):\n\t\t\td1 = d2\n\t\t\td2 = a[i + 1] - a[i]\n\t\t\tif d1 == d2:\n\t\t\t\tcontinue\n\t\t\telse:\n\t\t\t\tf = 0\n\t\t\t\tbreak\n\t\tif f:\n\t\t\tprint(a[-1] + d2)\n\t\telse:\n\t\t\tprint(a[-1])\n\telse:\n\t\tprint(a[-1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l[1]-l[0]\r\nc=0\r\nfor i in range(2,n):\r\n if(l[i]-l[i-1]!=a):\r\n print(l[-1])\r\n c=c+1\r\n break\r\nif(c==0): \r\n print(l[-1]+a) ", "def ria():\r\n return [int(i) for i in input().split()]\r\nar=ria()\r\nar=ria()\r\nkek=(ar[1]-ar[0])\r\n\r\nfor i in range(1,len(ar)):\r\n if ar[i]-ar[i-1]!=(ar[1]-ar[0]):\r\n print(ar[len(ar)-1])\r\n exit(0)\r\n\r\nprint(ar[len(ar)-1]+kek)\r\n", "n = int(input())\r\ntemp = [int(i) for i in input().split()]\r\nd = temp[1] - temp[0]\r\nfor i in range(n - 1):\r\n if d != temp[i + 1] - temp[i]:\r\n print(temp[n - 1])\r\n break\r\n elif i == n - 2:\r\n print(temp[n - 1] + d)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = list(map(int, input().split()))\r\ns = [b-a for a, b in zip(w,w[1:])]\r\nif len(set(s)) == 1:\r\n print(w[-1]+s[0])\r\nelse:\r\n print(w[-1])", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nif len(set([l[i] - l[i-1] for i in range(1, n)])) == 1:\r\n\tprint(l[-1] + l[1] - l[0])\r\nelse:\r\n\tprint(l[-1])", "n = int(input())\r\nt = list(map(int, input().split()))\r\nif n == 2:\r\n print(2 * t[1] - t[0])\r\nelse:\r\n f = 0\r\n d = t[1] - t[0]\r\n for i in range(2, n):\r\n if t[i] != d + t[i - 1]:\r\n print(t[n - 1])\r\n f = 1\r\n break\r\n if f == 0:\r\n print(t[n - 1] + d)\r\n", "import math\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = a[1] - a[0]\r\nok = True\r\nfor i in range(1, n):\r\n\tok &= d == a[i] - a[i-1]\r\nprint(a[n-1]+d if ok else a[n-1])\r\n\r\n\r\n\r\n\r\n", "n, a = int(input()), list(map(int, input().split()))\r\n\r\nr = a[1] - a[0]\r\n\r\nif all(a[i] - a[i - 1] == r for i in range(2, n)):\r\n print(a[-1] + r)\r\nelse:\r\n print(a[-1])", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nq = a[1] - a[0]\r\n\r\nf = True\r\nfor i in range(2, n):\r\n if a[i] - a[i - 1] != q:\r\n f = False\r\n break\r\n\r\nif f:\r\n print(a[-1] + q)\r\nelse:\r\n print(a[-1])", "input()\r\nX = list(map(int, input().split()))\r\nArith = [X[i] - X[i + 1] for i in range(len(X) - 1)]\r\nprint(X[-1] - Arith[0] if Arith.count(Arith[0]) == len(Arith) else X[-1])\r\n\r\n# UB_CodeForces\r\n# Advice: Do what you can with what you have and never be satisfied\r\n# Location: Still next to the tissue box\r\n# Caption: Sb had wet dream again\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n if a[i]-a[i-1]!=a[1]-a[0]:\r\n print(a[n-1])\r\n break\r\nelse: print(a[n-1]+a[1]-a[0])", "n = int(input())\r\nt = tuple(map(int, input().split()))\r\nd = t[1] - t[0]\r\nif all(t[i + 1] - t[i] == d for i in range(1, n - 1)):\r\n print(t[-1] + d)\r\nelse:\r\n print(t[-1])", "n=int(input())\r\nllist=[]\r\nllist=list(map(int,input().split()))\r\nc=0\r\nd=0\r\ndd=llist[1]-llist[0]\r\nfor i in range(n-1):\r\n if llist[i+1]-llist[i]==dd:\r\n c+=1\r\n if llist[i+1]==llist[0]:\r\n d+=1\r\nif d==n-1:\r\n print(llist[0])\r\nelif c==n-1:\r\n print(llist[n-1]+llist[1]-llist[0])\r\nelse:\r\n print(llist[n-1])", "\r\ndef main_function():\r\n n = int(input())\r\n is_arithmetic_progression = True\r\n a = [int(i) for i in input().split(\" \")]\r\n d = a[1] - a[0]\r\n for i in range(1, len(a)):\r\n if a[i] - a[i - 1] != d:\r\n is_arithmetic_progression = False\r\n break\r\n if is_arithmetic_progression:\r\n print(a[-1] + d)\r\n else:\r\n print(a[-1])\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nd = l[1] - l[0]\r\n\r\nfor i in range(n - 1):\r\n\tif l[i + 1] - l[i] != d:\r\n\t\tprint(l[-1])\r\n\t\texit()\r\n\r\n\r\nprint(l[-1] + d)", "n = int(input())\r\n\r\nsp = list(map(int, input().split()))\r\n\r\nd = sp[1] - sp[0]\r\nfor i in range(n-1):\r\n if d != sp[i+1] - sp[i]:\r\n print(sp[n-1])\r\n break\r\nelse:\r\n print(sp[n-1] + d)\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nd=t[1]-t[0]\r\nfor i in range(2,n):\r\n if t[i]-t[i-1]!=d:\r\n print(t[-1])\r\n exit()\r\nprint(t[-1]+d)\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\ndef g(n, a):\r\n count = 0\r\n x = 0\r\n for i in range(n-1):\r\n if i != 0 and a[i + 1] - a[i] != x:\r\n return a[-1]\r\n x = a[i + 1] - a[i]\r\n return a[-1] + x\r\nprint(g(n, a))", "def f():\r\n n=int(input())\r\n t=list(map(int,input().split()))\r\n b=1\r\n for i in range(2,len(t)):\r\n if(t[i]-t[i-1]==t[i-1]-t[i-2]):\r\n continue\r\n else:\r\n b=0\r\n break\r\n if(b==1):\r\n print(2*t[len(t)-1] - t[len(t)-2])\r\n else:\r\n print(t[len(t)-1])\r\nf()", "def predict(lst):\r\n\tcount = 0\r\n\td = lst[1] - lst[0] #a2-a1=d\r\n\tfor i in range(2, len(lst)):\r\n\t\tif lst[0] + i * d == lst[i]:\r\n\t\t\tcount += 1\r\n\t\telse:\r\n\t\t\tbreak\r\n\tif count == len(lst) - 2: #arithmetic progression\r\n\t\treturn lst[len(lst) - 1] + d\r\n\telse:\r\n\t\treturn lst[len(lst) - 1]\r\n\r\nn = int(input())\r\nlst = list(map(int,input().strip().split()))[:n]\r\nprint(predict(lst))", "n = int(input())\r\na = list(map(int,input().split()))\r\nrs = a[1] - a[0]\r\nfor i in range(n-1):\r\n if a[i+1] - a[i]!=rs:\r\n print(a[n - 1])\r\n exit()\r\nprint(a[n-1] + rs)\r\n", "n=int(input())\r\ntemp=list(map(int,input().split()))\r\nd=temp[1]-temp[0]\r\nis_ap=True\r\nfor i in range(1,len(temp)-1):\r\n if(temp[i+1]-temp[i]!=d):\r\n is_ap=False\r\n break\r\nlast_term=temp[-1]\r\nif(is_ap):\r\n print(last_term+d)\r\nelse:\r\n print(last_term)", "input()\r\na = list(map(int, input().split()))\r\ndiffs = [a[n] - a[n - 1] for n in range(1, len(a))]\r\n\r\nprint((a[-1] + diffs[0]) if len(set(diffs)) == 1 else a[-1])\r\n", "n = int(input())\na = list(map(int, input().split()))\ndiff = abs(a[0]-a[1])\nflag = True\nfor i in range(2, n):\n if abs(a[i]-a[i-1]) != diff:\n flag = False\n break\nif flag:\n if a[n-2] >= a[n-1]:\n print(a[n-1] - diff)\n else:\n print(a[n-1] + diff)\nelse:\n print(a[n-1])\n\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=int(input())\r\nt=list(map(int,input().split()))\r\nd=t[1]-t[0]\r\nfor i in range(2,n):\r\n if t[i]-t[i-1]!=d:\r\n print(t[-1])\r\n exit()\r\nprint(t[-1]+d)\r\n", "#847G\r\n\r\ndef is_ap(l):\r\n d = l[1] - l[0]\r\n for i in range(len(l)-1):\r\n if l[i+1] - l[i] != d:\r\n return False\r\n return True\r\n\r\n\r\nn = int(input())\r\nt = list(map(int, input().split(\" \")))\r\n\r\nflag = 0\r\nd = t[1] - t[0]\r\n\r\nif is_ap(t):\r\n flag = 1\r\n \r\nprint((t[0] + (n)*d) if flag == 1 else t[n-1])\r\n", "n = int(input())\r\n\r\ntemparatures = list(map(int,input().split()))\r\nd = temparatures[1] - temparatures[0]\r\n\r\nfor i in range(1, n-1):\r\n if temparatures[i+1] - temparatures[i] != d:\r\n print(temparatures[-1])\r\n break\r\nelse:\r\n print(temparatures[-1]+d)\r\n", "def f(l):\r\n n = len(l)\r\n dl = [l[i+1]-l[i] for i in range(n-1)]\r\n dl.sort()\r\n return l[-1] if dl[0]!=dl[-1] else l[-1]+dl[0]\r\n\r\n_ = input()\r\nl = list(map(int,input().split()))\r\nprint(f(l))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nx, y = 1, l[1] - l[0]\r\n\r\nfor i in range(1, n):\r\n\tif l[i] - l[i - 1] != y:\r\n\t\tx = 0\r\n\t\tbreak\r\n\t\t\r\nif x == 1:\r\n\tprint(l[-1] + y)\r\nelse:\r\n\tprint(l[-1])", "def solve(n, t):\r\n d = t[1] - t[0]\r\n for i in range(2, n):\r\n if t[i - 1] + d != t[i]:\r\n return t[-1]\r\n return t[-1] + d\r\n\r\n\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\nprint(solve(n, t))\r\n", "n = int(input())\r\n\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n\r\nd=a[1] - a[0]\r\ncheck = 1\r\nfor i in range(2, n):\r\n if a[i]-a[i-1] != d:\r\n check = 0\r\n break\r\nif(check==1):\r\n print(a[n-1]+d)\r\nelse:\r\n print(a[n-1])\r\n", "n=int(input())\r\nl=[*map(int,input().split())]\r\ns = set()\r\nfor i in range(n-1):\r\n s.add(l[i+1]-l[i])\r\nprint(l[-1] + (0 if len(s) > 1 else s.pop()))", "n = int(input())\r\na = []\r\n\r\nstr = input()\r\na = str.split(' ')\r\nfor i in range(0, n):\r\n a[i] = int(a[i])\r\n\r\nch = True\r\nraz = a[1] - a[0]\r\n\r\nfor i in range(0, n - 1):\r\n if (a[i] + raz) != a[i+1]:\r\n ch = False\r\n if not ch:\r\n break\r\n\r\nres = ''\r\n\r\nif ch:\r\n res = a[n-1] + raz\r\nelse:\r\n res = a [n - 1]\r\nprint(res)", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=a[0]+(n)*(a[1]-a[0])\r\nt=[0]*(n-1)\r\nu=0\r\nfor i in range(len(a)-1):\r\n t[i]=a[i+1]-a[i]\r\nval=t[0]\r\nfor j in t:\r\n if j==val:\r\n continue\r\n else:\r\n u=1\r\nif u==0:\r\n print(ans)\r\nelse:\r\n print(a.pop())", "n, a = int(input()), [int(i) for i in input().split()]\nd = a[1] - a[0]\nfor i in range(2, n):\n if a[i] - a[i - 1] != d:\n res = a[-1]\n break\nelse:\n res = a[-1] + d\nprint(res)\n", "n = int(input())\r\nl = list (map (int, input().split(\" \")))\r\nres=True\r\nd=l[1]-l[0]\r\nfor i in range(2,n):\r\n if l[i]-l[i-1] != d:\r\n res=False\r\n break\r\nprint(l[n-1]+d) if res else print(l[n-1])", "n=int(input())\r\nt=list(map(int,input().split()))[:n]\r\nx=t[1]-t[0]\r\nq=0\r\nfor i in range(n-1):\r\n if t[i+1]-t[i]!=x:\r\n print(t[n-1])\r\n break\r\n else:\r\n q+=1\r\nif q==n-1:\r\n print(t[n-1]+x)", "import math\r\n\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\n\r\ndt=t[1]-t[0]\r\nflag=True\r\n\r\nfor i in range(2,n):\r\n if t[i]-t[i-1]!=dt:\r\n flag=False\r\n break\r\nif flag:\r\n print(t[-1]+dt)\r\nelse:\r\n print(t[-1])\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nss=a[1]-a[0]\r\nflag=1\r\nfor i in range(1,n-1):\r\n if a[i+1]-a[i]!=ss:\r\n flag=0\r\n break\r\nif flag:\r\n print(a[-1]+ss)\r\nelse:\r\n print(a[-1])", "n=int(input())\r\nm=list(map(int,input().split()))\r\na=m[1]-m[0]\r\nfor i in range(1,n):\r\n\tif m[i]-m[i-1]==a:\r\n\t\tpass\r\n\telse:\r\n\t\tprint(m[-1])\r\n\t\texit()\r\nprint(m[-1]+a)\t", "n = int(input())\r\nnums = [int(j) for j in input().split()]\r\ndiff = nums[1] - nums[0]\r\ncheck = True\r\nfor j in range(2, n):\r\n if nums[j] - nums[j - 1] != diff:\r\n check = False\r\n break\r\nif check:\r\n print(nums[n - 1] + diff)\r\nelse:\r\n print(nums[n - 1])\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nif n==2:\r\n print(2*a[1]-a[0])\r\nelse:\r\n res,check=a[1]-a[0],1\r\n for i in range(2,n):\r\n if a[i]-a[i-1]!=res:\r\n check=0\r\n break\r\n if check==1:\r\n print(a[n-1]+res)\r\n else:\r\n print(a[n-1])", "n = int(input())\r\nl = list(map(int,input().split()))\r\np = []\r\nif n==2:\r\n\tprint(l[1]+(l[1]-l[0]))\r\nelse:\r\n\tfor i in range(1,len(l)):\r\n\t \tp.append(l[i]-l[i-1])\r\n\tsetp = set(p)\r\n\tlsetp = list(setp)\t\r\n\tif len(setp)==1:\r\n\t\tprint(l[-1]+lsetp[0])\r\n\telse:print(l[-1])\t \t\t\r\n", "input()\r\na = input().split()\r\ns = []\r\nfor i in range(len(a) - 1):\r\n s.append(int(a[i]) - int(a[i+1]))\r\nif len(set(s)) == 1:\r\n print(int(a[-1]) - int(s[0]))\r\nelse:\r\n print(a[-1])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=l[-1]+l[1]-l[0]\r\nfor i in range(1,n):\r\n if(l[i]!=l[i-1]+l[1]-l[0]):\r\n ans=l[-1]\r\n break\r\nprint(ans)", "n = int(input())\r\ntemp = list(map(int ,input().split()))\r\ni=1\r\nd = temp[1]-temp[0]\r\nap=0\r\nwhile i<len(temp)-1:\r\n if temp[i+1]-temp[i]!=d:\r\n ap=1\r\n break\r\n i = i + 1\r\nif ap==1:\r\n print(temp[-1])\r\nelse:\r\n print(temp[-1]+d)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nd=l[1]-l[0]\r\nfor i in range(2,n):\r\n if l[i]-l[i-1]!=d:\r\n d=None\r\n break\r\nprint(l[n-1]+d if d!=None else l[n-1])", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = a[1] - a[0]\r\ntr = True\r\nfor i in range(2,n):\r\n if k != a[i] - a[i-1]:\r\n tr = False\r\nif tr:\r\n print(a[-1] + k)\r\nelse:\r\n print(a[-1])", "n=int(input())\r\nx = list(map(int, input().split(\" \")))\r\na=[x[i]-x[i-1] for i in range(1,n)]\r\nprint(x[n-1]+a[0] if len(set(a))==1 else x[n-1])", "def checkAP(numList):\n\td = numList[1] - numList[0]\n\tfor i in range(1, len(numList)):\n\t\tif numList[i] - numList[i - 1] != d:\n\t\t\treturn False\n\treturn True\n\nif __name__ == '__main__':\n\twhile True:\n\t\ttry:\n\t\t\tn = input()\n\t\t\tnumList = input()\n\t\t\tnumList = numList.split()\n\t\t\tnumList = [int(x) for x in numList]\n\t\t\tif checkAP(numList):\n\t\t\t\tprint(2 * numList[-1] - numList[-2])\n\t\t\telse:\n\t\t\t\tprint(numList[-1])\n\t\texcept EOFError:\n\t\t\tbreak", "def isAp(a):\r\n d = a[1] - a[0]\r\n for i in range(1, len(a) - 1):\r\n if d != a[i + 1] - a[i]:\r\n return 0\r\n return d\r\n\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split(' ')]\r\nprint(a[-1] + isAp(a))\r\n" ]

[ "from sys import stdin, stdout\r\n\r\ndef calculate(m0,c0,m1,c1):\r\n return (c0-c1)/(m1-m0)\r\n\r\nn = int(stdin.readline())\r\n\r\nA = [int(x) for x in stdin.readline().split()]\r\nsigma = [0]\r\nfor i in range(n-1):\r\n sigma.append(sigma[-1]+A[i])\r\nrunning_sum = sum([A[i]*(i+1) for i in range(n)])\r\n\r\nanswer = 0\r\nline_stack = [(0,0)]\r\nsegment_lefts = [-1000000]\r\npointer = 0\r\n\r\nfor i in range(1,n-1):\r\n answer = max(answer, line_stack[pointer][0]*A[i]+line_stack[pointer][1]-A[i]*i+sigma[i])\r\n while len(line_stack) > 0 and calculate(line_stack[-1][0], line_stack[-1][1], i, -sigma[i]) <= segment_lefts[-1]:\r\n line_stack.pop()\r\n segment_lefts.pop()\r\n if len(line_stack) == 0:\r\n segment_lefts.append(-1000000)\r\n else:\r\n segment_lefts.append(calculate(line_stack[-1][0], line_stack[-1][1], i, -sigma[i]))\r\n line_stack.append((i, -sigma[i]))\r\n\r\n lower = 0\r\n upper = len(line_stack)\r\n while upper - lower > 1:\r\n candidate = (upper + lower)//2\r\n if segment_lefts[candidate] > A[i+1]:\r\n upper = candidate\r\n else:\r\n lower = candidate\r\n pointer = lower\r\n\r\nanswer = max(answer, line_stack[pointer][0]*A[n-1]+line_stack[pointer][1]-A[n-1]*(n-1)+sigma[n-1])\r\n\r\nsigma = [0]\r\nfor i in range(n-1,0,-1):\r\n sigma.append(sigma[-1]+A[i])\r\n\r\nline_stack = [(-(n-1),0)]\r\nsegment_lefts = [-1000000]\r\npointer = 0\r\n\r\nfor i in range(n-2,0,-1):\r\n answer = max(answer, line_stack[pointer][0]*(-A[i])+line_stack[pointer][1]-A[i]*i-sigma[n-1-i])\r\n while len(line_stack) > 0 and calculate(line_stack[-1][0], line_stack[-1][1], -i, sigma[n-1-i]) <= segment_lefts[-1]:\r\n line_stack.pop()\r\n segment_lefts.pop()\r\n if len(line_stack) == 0:\r\n segment_lefts.append(-1000000)\r\n else:\r\n segment_lefts.append(calculate(line_stack[-1][0], line_stack[-1][1], -i, sigma[n-1-i]))\r\n line_stack.append((-i, sigma[n-1-i]))\r\n\r\n lower = 0\r\n upper = len(line_stack)\r\n while upper - lower > 1:\r\n candidate = (upper + lower)//2\r\n if segment_lefts[candidate] > -A[i-1]:\r\n upper = candidate\r\n else:\r\n lower = candidate\r\n pointer = lower\r\n\r\nanswer = max(answer, line_stack[pointer][0]*(-A[0])+line_stack[pointer][1]-sigma[n-1])\r\n\r\ntrue_answer = answer + running_sum\r\nstdout.write('{}\\n'.format(true_answer))\r\n" ]

[ "n,m = list(map(int,input().split()))\r\ngraph = [[]for _ in range(n)]\r\ncolor = [0]*n\r\nfor 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\nfor i in range(n):\r\n if color[i]:\r\n continue\r\n color[i] = 1\r\n queue = [i]\r\n while queue:\r\n u = queue.pop()\r\n for v in graph[u]:\r\n if color[v]:\r\n if color[v]==color[u]:\r\n print(-1)\r\n exit(0)\r\n else:\r\n color[v] = 3-color[u]\r\n queue.append(v)\r\narr1 = []\r\narr2 = []\r\nfor i in range(len(color)):\r\n if color[i]==1:\r\n arr1.append(i+1)\r\n else:\r\n arr2.append(i+1)\r\nprint(len(arr1))\r\nprint(*arr1)\r\nprint(len(arr2))\r\nprint(*arr2)", "n,m=map(int,input().split())\r\ng=[[]for _ in' '*n]\r\nv=[0]*(n)\r\nfor _ in ' '*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\nfor i in range(n):\r\n if v[i]:continue\r\n v[i]=1\r\n q=[i]\r\n while q:\r\n x=q.pop()\r\n for y in g[x]:\r\n if v[y]:\r\n if v[y]==v[x]:print(-1);exit(0)\r\n else:v[y]=3-v[x];q.append(y)\r\nfor i in [1,2]:\r\n s=[str(k+1)for k,q in enumerate(v)if q==i]\r\n print(len(s))\r\n print(' '.join(s))", "n, m = map(int, input().split())\r\n\r\n# Build graph\r\ngraph = [[] for _ in range(n)]\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n\r\n# Initialize color array\r\ncolor = [-1] * n\r\n\r\n# Function to check if a subgraph is bipartite\r\ndef is_bipartite(start):\r\n q = [start]\r\n color[start] = 0\r\n while q:\r\n u = q.pop(0)\r\n for v in graph[u]:\r\n if color[v] == -1:\r\n color[v] = 1 - color[u]\r\n q.append(v)\r\n elif color[v] == color[u]:\r\n return False\r\n return True\r\n\r\n# Find all connected components and check if they are bipartite\r\nfor i in range(n):\r\n if color[i] == -1:\r\n if not is_bipartite(i):\r\n print(-1)\r\n break\r\nelse:\r\n # Separate vertices based on color\r\n color_0 = [i+1 for i in range(n) if color[i] == 0]\r\n color_1 = [i+1 for i in range(n) if color[i] == 1]\r\n \r\n # If one of the colors is empty, add the unrelated vertex to that color\r\n if len(color_0) == 0:\r\n color_0.append(1)\r\n elif len(color_1) == 0:\r\n color_1.append(1)\r\n \r\n # Print the two color classes\r\n print(len(color_0))\r\n print(*color_0)\r\n print(len(color_1))\r\n print(*color_1)\r\n", "import sys\r\ninput=sys.stdin.readline\r\nfrom collections import defaultdict,deque\r\nn,m=map(int,input().split())\r\ng=defaultdict(list)\r\nedges=[]\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 edges.append((u,v))\r\ns1,s2=set(),set()\r\nvisited=set()\r\ndef bfs(src):\r\n q=deque()\r\n q.append([src])\r\n visited.add(src)\r\n flag=2\r\n s1.add(src)\r\n while len(q)>0:\r\n f=q.popleft()\r\n l=[]\r\n for node in f:\r\n for nbr in g[node]:\r\n if nbr not in visited:\r\n visited.add(nbr)\r\n l.append(nbr)\r\n if flag==2:s2.add(nbr)\r\n else:s1.add(nbr)\r\n if flag==2:flag=1\r\n else:flag=2\r\n if len(l)==0:break\r\n q.append(l)\r\n \r\n \r\nfor i in range(1,n+1):\r\n if i not in visited:\r\n bfs(i)\r\ndef helper():\r\n for u,v in edges:\r\n if (u in s1 and v in s1) or (u in s2 and v in s2):\r\n return False\r\n return True\r\n\r\nres=helper()\r\nif res:\r\n print(len(s1))\r\n for x in s1:\r\n print(x,end=' ')\r\n print()\r\n print(len(s2))\r\n for x in s2:\r\n print(x,end=' ')\r\nelse:print(-1)", "from collections import deque\r\n\r\nn, m = [int(i) for i in input().split()]\r\ngraph = [set() for _ in range(n + 1)]\r\nfor _ in range(m):\r\n s, e = [int(i) for i in input().split()]\r\n graph[s].add(e)\r\n graph[e].add(s)\r\n\r\ndef bfs(start):\r\n q = deque([(start, 0)])\r\n color[start] = 0\r\n\r\n while q:\r\n node, col = q.popleft()\r\n\r\n for ngh in graph[node]:\r\n if color[ngh] == col:\r\n return False\r\n if ngh not in seen:\r\n q.append((ngh, 1 - col))\r\n color[ngh] = 1 - col\r\n seen.add(ngh)\r\n\r\n return True\r\n\r\ncolor = [-1 for _ in range(n + 1)]\r\nseen = set()\r\nfor node in range(1, n + 1):\r\n if color[node] == -1:\r\n if not bfs(node):\r\n print(-1)\r\n exit()\r\n\r\ngroup = [[], []]\r\nfor node in range(1, n + 1):\r\n group[color[node]].append(node)\r\n\r\nfor grp in group:\r\n print(len(grp))\r\n print(*grp)", "n, m = map(int, input().split())\nfl = False\nf = [0] * 100001\nE = [[] for i in range(n + 1)]\ne = [tuple(map(int, input().split())) for _ in range(m)]\nfor u, v in sorted(e): E[u] += [v]; E[v] += [u]\ndef bfs(nom, col):\n ch = [(nom, col)]\n while ch:\n v, c = ch.pop()\n if f[v] == 0: \n f[v] = c \n for u in E[v]: \n if f[u] == 0: ch += [(u, 3 - c)]\nfor x in range(1, n + 1): \n if f[x] == 0: bfs(x, 1)\nfor u, v in e:\n if f[u] == f[v]: fl = True; break\nif fl: print(-1)\nelse:\n a = [i for i in range(n + 1) if f[i] == 1]\n b = [i for i in range(n + 1) if f[i] == 2]\n print(len(a)); print(*a)\n print(len(b)); print(*b)\n\t \t \t \t\t \t \t \t\t \t\t \t \t", "import sys\ninput = sys.stdin.readline\nfrom collections import defaultdict, deque \n\nsys.setrecursionlimit(10**5)\n\n\n\nV, E = list(map(int, input().split()))\n\nG = [[] for _ in range(V)]\nfor _ in range(E):\n u, v = list(map(int, input().split()))\n G[u-1].append(v)\n G[v-1].append(u)\nB = set()\nR = set()\ncolors = [B, R]\n\n\n# def dfs(node, t):\n# # print(colors)\n# vis.add(node)\n# colors[t].add(node)\n# for nbr in G[node-1]:\n# if nbr in colors[t]:\n# return False\n# elif nbr not in colors[1-t] and nbr not in vis:\n# if not dfs(nbr, 1-t):\n# return False\n# return True\ndef bfs(node, t, vis):\n q =deque([node])\n vis.add(node)\n while q:\n # print(colors, t)\n # print(q,vis)\n lvl = len(q)\n t = 1 - t\n for _ in range(lvl):\n x = q.popleft()\n colors[t].add(x)\n for nbr in G[x-1]:\n if nbr in colors[t]:\n return False\n if nbr not in vis and nbr not in colors[1-t]:\n q.append(nbr)\n vis.add(nbr)\n return True\n\nvis = set()\nfor node in range(1, V+1):\n if node not in vis:\n # print(vis)\n if not bfs(node, 1, vis):\n print(-1)\n break\nelse:\n print(len(B))\n print(*B)\n print(len(R))\n print(*R) \n\n# print(colors)\n", "def main():\n n, m = map(int, input().split())\n l = [[] for _ in range(n + 1)]\n for _ in range(m):\n u, v = map(int, input().split())\n l[u].append(v)\n l[v].append(u)\n res = [0] * (n + 1)\n for u, x in enumerate(res):\n if not x:\n x, nxt = -1, [u]\n while nxt:\n x, cur, nxt = -x, nxt, []\n for u in cur:\n if l[u]:\n res[u] = x\n for v in l[u]:\n if not res[v]:\n nxt.append(v)\n elif res[v] == x:\n print(-1)\n return\n for x in -1, 1:\n l = [u for u in range(1, n + 1) if res[u] == x]\n print(len(l))\n print(' '.join(map(str, l)))\n\n\nif __name__ == \"__main__\":\n main()\n", "import math\r\nimport bisect\r\nfrom collections import deque\r\n\r\n# Isso para mim eh um problema de biparticao...\r\n# No caso, testar se um grafo eh bipartido.\r\n\r\nbipartited = True\r\n\r\ndef bfs(source, graph, visited):\r\n visited[source] = 0\r\n\r\n queue = deque()\r\n queue.append(source)\r\n\r\n while len(queue) != 0:\r\n curr_vertex = queue[0]\r\n queue.popleft()\r\n\r\n for vertex in graph[curr_vertex]:\r\n if visited[vertex] == -1:\r\n visited[vertex] = 1 ^ visited[curr_vertex]\r\n queue.append(vertex)\r\n else:\r\n if visited[vertex] == visited[curr_vertex]:\r\n global bipartited\r\n bipartited = False\r\n return\r\n\r\n return\r\n\r\ndef main():\r\n n,m = list(map(int, input().split()))\r\n \r\n graph = [[] for _ in range(n + 1)]\r\n visited = [-1 for _ in range(n + 1)]\r\n\r\n for i in range(m):\r\n a, b = (map(int, input().split()))\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\n for i in range(1, n + 1):\r\n if visited[i] == -1:\r\n bfs(i, graph, visited)\r\n if not bipartited:\r\n break\r\n\r\n if not bipartited:\r\n print(\"-1\")\r\n else:\r\n l0 = [i for i in range(1, n + 1) if visited[i] == 0 and len(graph[i]) != 0]\r\n l1 = [i for i in range(1, n + 1) if visited[i] == 1 and len(graph[i]) != 0]\r\n\r\n print(len(l0))\r\n print(\" \".join([str(x) for x in l0]))\r\n print(len(l1))\r\n print(\" \".join([str(x) for x in l1]))\r\n\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict,deque\r\nn_vertices,n_edges = tuple(map(int,input().split()))\r\ngraph = defaultdict(list)\r\nfor edge in range(n_edges):\r\n st,end = map(int,input().split())\r\n graph[st].append(end)\r\n graph[end].append(st)\r\n\r\ndef bfs(nd):\r\n may_color[nd] = 1\r\n que = deque([(nd,1)])\r\n while que:\r\n nod,clr = que.popleft()\r\n _nxt_c = 1 if clr == 2 else 2\r\n \r\n for _nxt in graph[nod]:\r\n if not may_color[_nxt]:\r\n may_color[_nxt] = _nxt_c\r\n que.append((_nxt,_nxt_c))\r\n \r\n elif may_color[_nxt] != _nxt_c:\r\n return False\r\n \r\n return True\r\n \r\n \r\n \r\nmay_color = defaultdict(int)\r\nvalid = True\r\nfor i in range(1,n_vertices+1):\r\n if not may_color[i]:\r\n if not bfs(i): \r\n valid = False\r\n break\r\n \r\nif not valid:print(-1)\r\nelse:\r\n one = []\r\n two = []\r\n for node in may_color:\r\n if may_color[node] == 1:\r\n one.append(node)\r\n else:two.append(node)\r\n print(len(one))\r\n print(*(one))\r\n print(len(two))\r\n print(*(two))\r\n ", "n,m=map(int,input().split())\r\nflag=False\r\nf=[0]*100001\r\nE=[[] for i in range(n+1)]\r\nee=[tuple(map(int,input().split())) for _ in range(m)]\r\nfor u,v in sorted(ee): E[u]+=[v]; E[v]+=[u]\r\ndef bfs(nom,col):\r\n ch=[(nom,col)]\r\n while ch:\r\n v,c=ch.pop()\r\n if f[v]==0: \r\n f[v]=c \r\n for u in E[v]: \r\n if f[u]==0: ch+=[(u,3-c)]\r\nfor x in range(1,n+1): \r\n if f[x]==0: bfs(x,1)\r\nfor u,v in ee:\r\n if f[u]==f[v]: flag=True; break\r\nif flag: print(-1)\r\nelse:\r\n a=[i for i in range(n+1) if f[i]==1]\r\n b=[i for i in range(n+1) if f[i]==2]\r\n print(len(a)); print(*a)\r\n print(len(b)); print(*b)\r\n", "# coding gbk\r\nfrom collections import deque\r\nn, m = map(int, input().split())\r\ne = {u : set() for u in range(n)}\r\nfor i in range(m):\r\n u, v = map(lambda x: int(x) - 1, input().split())\r\n e[u].add(v)\r\n e[v].add(u)\r\nc = {u : 0 for u in range(n)}\r\ndep = set(range(n))\r\nwhile len(dep) != 0:\r\n u = dep.pop()\r\n c[u] = 1\r\n q = deque([u])\r\n while len(q) != 0:\r\n u = q.popleft()\r\n for v in e[u]:\r\n if v not in dep:\r\n if c[v] == c[u]:\r\n print(-1);\r\n exit();\r\n else:\r\n dep.remove(v);\r\n assert(c[v] == 0);\r\n c[v] = 3 - c[u];\r\n q.append(v)\r\na = [u for u in range(n) if c[u]==1]\r\nb = [u for u in range(n) if c[u]==2]\r\nprint(len(a))\r\nprint(' '.join(map(lambda x: str(x + 1), a)))\r\nprint(len(b))\r\nprint(' '.join(map(lambda x: str(x + 1), b)))\r\n", "n,m=map(int,input().split())\r\ngraph=[[] for _ in range(n)]\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\ncolors=[-1]*n #len(graph)\r\nfrom collections import deque\r\nvisit=deque()\r\ndef bfs(i):\r\n colors[i]=0\r\n visit.appendleft(i)\r\n while(visit):\r\n parent=visit.pop()\r\n for child in graph[parent]:\r\n if colors[child]==-1:\r\n colors[child]=1-colors[parent]\r\n visit.appendleft(child)\r\n elif colors[child]==colors[parent]:\r\n return False\r\n return True\r\nfor i in range(n):\r\n if colors[i]==-1:\r\n if not bfs(i):\r\n print(-1)\r\n exit()\r\ngrp1=[i+1 for i in range(n) if colors[i]==0]\r\ngrp2=[i+1 for i in range(n) if colors[i]==1]\r\nprint(len(grp1))\r\nprint(*grp1)\r\nprint(len(grp2))\r\nprint(*grp2)\r\n \r\n\r\n \r\n", "n,m = map(int,input().split())\r\ng = [set() for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n g[a-1].add(b-1)\r\n g[b-1].add(a-1)\r\na = []\r\n\r\np = [-1]*n\r\nfor i in range(n):\r\n if p[i] != -1: continue\r\n p[i] = 0\r\n a.append(i)\r\n while a:\r\n x = a.pop()\r\n for elem in g[x]:\r\n if p[elem] == p[x]:\r\n print(-1)\r\n exit(0)\r\n if p[elem] == -1:\r\n p[elem] = not p[x]\r\n a.append(elem)\r\nprint(p.count(0))\r\nfor i in range(n):\r\n if p[i] == 0:\r\n print(i+1, end = ' ')\r\nprint()\r\nprint(p.count(1))\r\nfor i in range(n):\r\n if p[i] == 1:\r\n print(i+1, end = ' ')", "import sys\r\ninput = sys.stdin.readline\r\np = print\r\nfrom collections import deque, defaultdict\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 range(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, m = II()\r\nadj = [[] for i in range(n)]\r\nfor i in range(m):\r\n x, y = II()\r\n adj[x-1].append(y-1)\r\n adj[y-1].append(x-1)\r\nvis = [-1]*n\r\ndef dfs(i):\r\n q = deque([i])\r\n vis[i] = 0\r\n while q:\r\n temp = q.pop()\r\n for v in adj[temp]:\r\n if vis[v] == -1:\r\n vis[v] = 1-vis[temp]\r\n q.append(v)\r\n else:\r\n if vis[v] == vis[temp]:\r\n print(-1)\r\n exit(0)\r\nfor i in range(n):\r\n if vis[i] == -1:\r\n dfs(i)\r\nres = [[],[]]\r\nfor i in range(n):\r\n res[vis[i]].append(i+1)\r\nprint(len(res[0]))\r\nprint(*res[0])\r\nprint(len(res[1]))\r\nprint(*res[1])", "from collections import deque\r\nn,e = list(map(int,input().split()))\r\ngraph = [[] for i in range(n)]\r\ncolor = [0 for i in range(n)]\r\nvisited = [0 for i in range(n)]\r\nfor i in range(e):\r\n x,y = list(map(int,input().split()))\r\n graph[x - 1].append( y - 1)\r\n graph[y - 1].append(x - 1)\r\npos = 1\r\ndef bfs(node,c):\r\n global pos\r\n que = deque([[node,c]])\r\n while que:\r\n cur = que.popleft()\r\n if visited[cur[0]]: continue\r\n \r\n visited[cur[0]] = 1\r\n color[cur[0]] = cur[1]\r\n for neigh in graph[cur[0]]:\r\n if visited[neigh] != 1:\r\n que.append([neigh,1 - cur[1]])\r\n else:\r\n if color[neigh] == cur[1]:\r\n pos = 0\r\n \r\nfor i in range(n):\r\n if visited[i] == 0:\r\n bfs(i,0)\r\nif pos:\r\n zero = 0\r\n one = 0\r\n for i in color:\r\n if i == 0:\r\n zero += 1\r\n else:\r\n one += 1\r\n print(zero)\r\n for i in range(len(color)):\r\n if color[i] == 0:\r\n if i < len(color) - 1:\r\n print(i + 1,end = \" \")\r\n else:\r\n print(i + 1)\r\n \r\n print(one)\r\n for i in range(len(color)):\r\n if color[i] == 1:\r\n print(i + 1,sep = \" \")\r\nelse:\r\n print(-1)", "from sys import stdin\r\ninput=stdin.readline\r\nn,m=map(int,input().split())\r\ng=[[] for _ in range(n)]\r\nedge=[list(map(int,input().split())) for i in range(m)]\r\nedge.sort()\r\nfor u,v in edge:\r\n g[u-1].append(v-1)\r\n g[v-1].append(u-1)\r\ns=[-1]*n\r\ndef bfs(ver,col):\r\n q=[(ver,col)]\r\n while q:\r\n x,c=q.pop()\r\n if s[x]==-1:\r\n s[x]=c\r\n for to in g[x]:\r\n if s[to]==-1:\r\n q.append((to,1-c))\r\nfor i in range(n):\r\n if s[i]==-1:\r\n bfs(i,0)\r\nfor u,v in edge:\r\n if s[u-1]==s[v-1]:\r\n print(-1)\r\n break\r\nelse:\r\n a=[i+1 for i in range(n) if s[i]==0]\r\n b=[i+1 for i in range(n) if s[i]==1]\r\n print(len(a))\r\n print(*a)\r\n print(len(b))\r\n print(*b)", "from collections import deque, defaultdict\r\n\r\ndef isBipartite(graph,n,color):\r\n for i in range(n):\r\n if color[i]==-1:\r\n color[i] = 0\r\n \r\n q = deque([[i,0]])\r\n while q:\r\n node, col = q.popleft()\r\n for v in graph[node]:\r\n if color[v]==-1:\r\n color[v] = not col\r\n q.append([v,color[v]])\r\n else:\r\n if color[v]==col:\r\n return False\r\n \r\n return True\r\n\r\nif __name__==\"__main__\":\r\n n,m = map(int, input().split())\r\n graph = defaultdict(list)\r\n for i in range(m):\r\n u,v = map(int, input().split())\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n \r\n color = [-1]*n \r\n check = isBipartite(graph,n,color)\r\n if not check: print(-1)\r\n else:\r\n a=[]\r\n b=[]\r\n for i,j in enumerate(color):\r\n if j==0: a.append(i+1)\r\n else: b.append(i+1)\r\n \r\n print(len(a))\r\n print(*a)\r\n print(len(b))\r\n print(*b)\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport heapq\r\ninput=sys.stdin.readline\r\nn,m=(int(i) for i in input().split())\r\nd={}\r\nfor i in range(n):\r\n d[i]=[]\r\nfor i in range(m):\r\n u,v=(int(i) for i in input().split())\r\n d[u-1].append(v-1)\r\n d[v-1].append(u-1)\r\nvis=[0 for i in range(n)]\r\ncol=[0 for i in range(n)]\r\nc=1\r\nfor i in range(n):\r\n if(vis[i]==0):\r\n vis[i]=1\r\n queue=[i]\r\n col[i]=1\r\n while(queue!=[]):\r\n s=queue.pop(0)\r\n for u in d[s]:\r\n if(vis[u]==0):\r\n vis[u]=1\r\n if(col[s]==1):\r\n col[u]=2\r\n else:\r\n col[u]=1\r\n queue.append(u)\r\n else:\r\n if(col[u]==col[s]):\r\n c=0\r\n break\r\nif(c==0):\r\n print(-1)\r\nelse:\r\n l1=[]\r\n l2=[]\r\n c1,c2=0,0\r\n for i in range(n):\r\n if(col[i]==1):\r\n c1+=1\r\n l1.append(i+1)\r\n else:\r\n c2+=1\r\n l2.append(i+1)\r\n print(c1)\r\n print(*l1)\r\n print(c2)\r\n print(*l2)", "class Graph:\n\n def __init__(self):\n self.numVertices = None\n self.numEdges = None\n self.neighbors = None\n self.loadGraph()\n\n def loadGraph(self):\n self.numVertices, self.numEdges = map(int, input().split())\n self.numVertices += 1\n self.neighbors = tuple(list() for vertex in range(self.numVertices))\n self.groups = (set(), set())\n\n for edge in range(self.numEdges):\n vertex1, vertex2 = map(int, input().split())\n self.neighbors[vertex1].append(vertex2)\n self.neighbors[vertex2].append(vertex1)\n\n def isBipartite(self):\n return all(self.isBipartiteComponent(vertex) for vertex in range(1, self.numVertices)\n if self.groupOf(vertex) == None)\n def isBipartiteComponent(self, vertex):\n if len(self.neighbors[vertex]) == 0:\n return True\n\n self.groups[0].add(vertex)\n queue = [vertex]\n\n while queue:\n vertex = queue.pop()\n groupOfVertex = self.groupOf(vertex)\n\n for neighbor in self.neighbors[vertex]:\n groupOfNeighbor = self.groupOf(neighbor)\n\n if groupOfNeighbor == groupOfVertex:\n return False\n\n elif groupOfNeighbor == None:\n self.groups[not groupOfVertex].add(neighbor)\n queue.append(neighbor)\n\n return True\n \n def groupOf(self, vertex):\n return 0 if vertex in self.groups[0] else 1 if vertex in self.groups[1] else None\n\n\ndef solve():\n graph = Graph()\n if graph.isBipartite():\n for group in graph.groups:\n print(len(group))\n print(\" \".join(map(str, group)))\n else:\n print(-1)\n\nif __name__ == '__main__':\n solve()\n", "import sys\ninput = sys.stdin.readline\n\nn, m = map(int, input().split())\n\nE = [[] for u in range(n)]\nfor j in range(m):\n u, v = map(lambda x: int(x) - 1, input().split())\n E[u].append(v)\n E[v].append(u)\n\ncolor = [-1] * n\n\nfor rt in range(n):\n if color[rt] != -1:\n continue\n stk = [rt]\n color[rt] = 0\n while stk:\n u = stk.pop()\n for v in E[u]:\n if color[v] == -1:\n color[v] = color[u] ^ 1\n stk.append(v)\n elif color[v] == color[u]:\n print(-1)\n exit()\n\nA = [[u + 1 for u in range(n) if color[u] == t] for t in range(2)]\nfor V in A:\n print(len(V))\n print(*V)\n", "M=lambda:map(int,input().split())\r\nn,m=M()\r\ngraph=[set() for i in range(n)]\r\nfor _ in range(m):\r\n a,b=M()\r\n graph[a-1].add(b-1)\r\n graph[b-1].add(a-1)\r\nvisited=[-1 for i in range(n)]\r\nstack=[]\r\nfor i in range(n):\r\n if visited[i]==-1 and len(graph[i])>0:\r\n visited[i]=True\r\n stack+=[i]\r\n while stack:\r\n x=stack.pop()\r\n for j in graph[x]:\r\n if visited[j]==visited[x]:\r\n print(-1)\r\n exit(0)\r\n if visited[j]==-1:\r\n visited[j]=not visited[x]\r\n stack+=[j]\r\nA=[]\r\nB=[]\r\nfor i in range(len(visited)):\r\n if visited[i]==True:\r\n A.append(i+1)\r\n elif visited[i]==False:\r\n B.append(i+1)\r\nprint(len(A))\r\nprint(*A)\r\nprint(len(B))\r\nprint(*B)\r\n", "import sys\r\n\r\ndef colorOK(adj_list, visited, stack, color):\r\n node = stack.pop()\r\n if visited[node]:\r\n return True\r\n visited[node] = True\r\n c = color[node]\r\n if c == 1:\r\n cc = 2\r\n else:\r\n cc = 1\r\n \r\n for e in adj_list[node]:\r\n if color[e] == c:\r\n return False\r\n if visited[e] == False:\r\n stack.append(e)\r\n color[e] = cc\r\n return True\r\n\r\ndef answer(n, m, u, v):\r\n adj_list = [[] for _ in range(n+1)] #first [] will never be filled.\r\n visited = [False for _ in range(n+1)] #[0] will never change.\r\n for i in range(m):\r\n adj_list[v[i]].append(u[i])\r\n adj_list[u[i]].append(v[i])\r\n stack = []\r\n \r\n color = [0 for _ in range(n+1)] #color[0] will never change, as node 0 does not exist.\r\n for i in range(1, n+1):\r\n if visited[i] == False:\r\n stack.append(i)\r\n color[i] = 1\r\n while len(stack) > 0:\r\n ans = colorOK(adj_list, visited, stack, color)\r\n if ans == False:\r\n print(-1)\r\n return\r\n c1 = []\r\n c2 = []\r\n for i in range(1, n+1):\r\n if color[i] == 1:\r\n c1.append(i)\r\n else:\r\n c2.append(i)\r\n \r\n print(len(c1))\r\n print(*c1)\r\n print(len(c2))\r\n print(*c2)\r\n \r\n return\r\n\r\ndef main():\r\n n, m = map(int, sys.stdin.readline().split())\r\n u = [0 for _ in range(m)]\r\n v = [0 for _ in range(m)]\r\n for i in range(m):\r\n u[i], v[i] = map(int, sys.stdin.readline().split())\r\n answer(n, m, u, v)\r\n return\r\nmain()", "n,m = map(int,input().split())\r\ng = [set() for i in range(n)]\r\nfor i in range(m):\r\n\ta,b = map(int,input().split())\r\n\tg[a-1].add(b-1)\r\n\tg[b-1].add(a-1)\r\na = []\r\np = [-1]*n\r\nfor i in range(n):\r\n\tif p[i]!=-1:\r\n\t\tcontinue\r\n\tp[i] = 0\r\n\ta.append(i)\r\n\twhile a:\r\n\t\tx = a.pop()\r\n\t\tfor node in g[x]:\r\n\t\t\tif p[node]==p[x]:\r\n\t\t\t\tprint(-1)\r\n\t\t\t\texit()\r\n\t\t\tif p[node]==-1:\r\n\t\t\t\tp[node] = not p[x]\r\n\t\t\t\ta.append(node)\r\nprint(p.count(0))\r\nfor i in range(n):\r\n\tif p[i]==0:\r\n\t\tprint(i+1,end = \" \")\r\nprint()\r\nprint(p.count(1))\r\nfor i in range(n):\r\n\tif p[i]==1:\r\n\t\tprint(i+1,end = \" \")\r\nprint()", "n, m = map(int, input().split())\r\nadj = [[] for _ 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 adj[a].append(b)\r\n adj[b].append(a)\r\n\r\ncolour = [None] * n\r\nbad = False\r\n\r\nfor i in range(n):\r\n if colour[i] is None:\r\n todo = [(i, True)]\r\n while todo:\r\n xi, xc = todo.pop()\r\n if colour[xi] is not None:\r\n if colour[xi] == xc:\r\n continue\r\n else:\r\n bad = True\r\n break\r\n colour[xi] = xc\r\n for neighbour in adj[xi]:\r\n todo.append((neighbour, not xc))\r\n if bad:\r\n break\r\n\r\nif bad:\r\n print(-1)\r\nelse:\r\n f = []\r\n t = []\r\n for i in range(n):\r\n if colour[i]:\r\n t.append(i+1)\r\n else:\r\n f.append(i+1)\r\n print(len(f))\r\n print(\" \".join(map(str, f)))\r\n\r\n print(len(t))\r\n print(\" \".join(map(str, t)))\r\n", "from collections import defaultdict\r\n\r\nI = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn, m = IL()\r\nN = defaultdict(set)\r\n\r\nV = [1] * (n+1)\r\nCOL = [-1] * (n+1)\r\n\r\nfor i in range(m):\r\n a, b = IL()\r\n N[a].add(b)\r\n N[b].add(a)\r\n V[a] = 0\r\n V[b] = 0\r\n\r\nans = 1\r\nnvc = V.count(0)\r\nvi = 0\r\nwhile nvc:\r\n for i in range(vi, len(V)):\r\n if V[i] == 0:\r\n vi = i\r\n break\r\n V[vi] = 1\r\n nvc -= 1\r\n COL[vi] = 0\r\n\r\n S = {vi}\r\n col = 1\r\n\r\n while S:\r\n S = {v2 for v1 in S for v2 in N[v1]}\r\n ans *= not any(COL[s]==(1-col) for s in S)\r\n S = [s for s in S if not V[s]]\r\n for s in S:\r\n COL[s] = col\r\n V[s] = 1\r\n nvc -= 1\r\n\r\n col = 1-col\r\n\r\nif not ans:\r\n print(-1)\r\nelse:\r\n print(sum(c==0 for c in COL))\r\n print(*[i for i, c in enumerate(COL) if c==0])\r\n print(sum(c==1 for c in COL))\r\n print(*[i for i, c in enumerate(COL) if c==1])\r\n", "n, m = map(int, input().split())\r\nadj_list = [[] for _ in range(n)]\r\nvisited = [0] * n\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n adj_list[x - 1].append(y - 1)\r\n adj_list[y - 1].append(x - 1)\r\n\r\nfor i in range(n):\r\n if visited[i]:\r\n continue\r\n visited[i] = 1\r\n queue = [i]\r\n\r\n while queue:\r\n x = queue.pop()\r\n for y in adj_list[x]:\r\n if visited[y]:\r\n if visited[y] == visited[x]:\r\n print(-1)\r\n exit(0)\r\n else:\r\n visited[y] = 3 - visited[x]\r\n queue.append(y)\r\n\r\nfor i in [1, 2]:\r\n group = [str(k + 1) for k, q in enumerate(visited) if q == i]\r\n print(len(group))\r\n print(' '.join(group))\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop\n\ndef input_int():\n return int(input())\ndef input_arr():\n return list(map(int, input().split()))\n\ndef input_tupple():\n return map(int, input().split())\n\ndef solution():\n n, m = input_tupple()\n graph = defaultdict(list)\n for _ in range(m):\n a, b = input_tupple()\n graph[a].append(b)\n graph[b].append(a)\n \n visited = {}\n def dfs(cur, val):\n if cur in visited:\n return val == visited[cur]\n visited[cur] = val\n for nbr in graph[cur]:\n ans = dfs(nbr, not val)\n if ans == False:\n return False\n return True\n\n for node in graph:\n if node not in visited:\n ans = dfs(node, True)\n if ans == False:\n print(-1)\n return;\n a = []; b = []\n for node, val in visited.items():\n if val:\n a.append(str(node))\n else:\n b.append(str(node))\n\n print(len(a))\n print(\" \".join(a))\n print(len(b))\n print(\" \".join(b))\n\n\n\n\nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=solution)\nthread.start(); thread.join()\n#solution()\n", "n , m = list(map(int,input().split()))\r\nadj = [[] for i in range(n+1) ]\r\nfor i in range(m):\r\n x , y = list(map(int,input().split()))\r\n adj[x].append(y)\r\n adj[y].append(x)\r\nt = [0 for i in range(n+1)]\r\ndef dfs(r):\r\n t[r] = 2\r\n stk = [r]\r\n while (len(stk) > 0):\r\n u = stk[-1]\r\n stk.pop()\r\n for v in adj[u]:\r\n if t[v] == 0:\r\n stk.append(v)\r\n if t[u] == 2:\r\n t[v] = 1\r\n elif t[u] == 1:\r\n t[v] = 2\r\n else:\r\n if t[u] == t[v]:\r\n return True\r\nflag = False \r\nfor i in range(1,n+1):\r\n if t[i] == 0:\r\n a = dfs(i)\r\n if a == True:\r\n flag = True\r\n break\r\nif flag:\r\n print(-1)\r\n\r\nelse:\r\n a = []\r\n b = []\r\n for i in range(1,n+1):\r\n if t[i] == 1:\r\n a.append(i)\r\n elif t[i] == 2:\r\n b.append(i)\r\n print(len(a))\r\n print(*a)\r\n print(len(b))\r\n print(*b)", "import os\r\nfrom collections import deque\r\ndef bfs(g,start,color) :\r\n to_visit=deque()\r\n to_visit.appendleft(start)\r\n color[start]='g'\r\n while(to_visit):\r\n node=to_visit.pop()\r\n for i in g[node] :\r\n if not color[i]: \r\n if color[i]!=color[node] and color[node]=='g' :\r\n color[i]='r'\r\n elif color[i]!=color[node] and color[node]=='r' :\r\n color[i]='g'\r\n to_visit.appendleft(i)\r\n elif(color[i]==color[node]) :\r\n print(-1)\r\n return False\r\n return True\r\n \r\n \r\nn,m=map(int,input().split())\r\ng=[[]for i in range(n+1)]\r\ncolor=[None for i in range(n+1)]\r\ncolor[0]='b'\r\ntest=True\r\nfor i in range(m) :\r\n node1,node2=map(int,input().split())\r\n g[node1].append(node2)\r\n g[node2].append(node1)\r\nfor i in range(len(color)) :\r\n if color[i] == None :\r\n test=bfs(g,i,color)\r\n if not test :\r\n break \r\nif test==True : \r\n print(color.count('g'))\r\n for i in range(len(color)):\r\n if color[i]=='g':\r\n print(i,end=\" \")\r\n print()\r\n print(color.count('r'))\r\n for i in range(n+1) :\r\n if color[i]=='r':\r\n print(i,end=\" \")\r\n\r\n", "import sys\r\nsys.setrecursionlimit(10**6)\r\n\r\ndebug_mode = True if len(sys.argv) > 1 and sys.argv[1] == \"-d\" else False\r\nif debug_mode:\r\n import os\r\n infile = open(os.path.abspath(__file__).replace(\".py\", \".in\"))\r\n\r\n def input():\r\n return infile.readline()\r\n\r\n\r\n# ==============================================================\r\n\r\nfrom collections import defaultdict, deque\r\n\r\n\r\ndef main():\r\n n_vertices, m_edges = list(map(int, input().strip().split()))\r\n G, C = defaultdict(list), [] # Graph, Components\r\n for _ in range(m_edges):\r\n u, v = list(map(int, input().strip().split()))\r\n G[u].append(v)\r\n G[v].append(u)\r\n\r\n S, X, Y = set(), set(), set() # visited, red, blue\r\n R, B = 0, 1\r\n for u in G:\r\n if u in S:\r\n # already visited the connected component of this node\r\n continue\r\n\r\n else:\r\n # new component, unvisited node\r\n # check for bipartiteness\r\n Q = deque()\r\n Q.append((u, R))\r\n while Q:\r\n curr, color = Q.popleft()\r\n if curr not in S:\r\n # unvisited node\r\n S.add(curr)\r\n if color == R:\r\n X.add(curr)\r\n else:\r\n Y.add(curr)\r\n\r\n next_color = R if color == B else B\r\n for v in G[curr]:\r\n Q.append((v, next_color))\r\n\r\n else:\r\n # node was already visited, check feasibility\r\n if curr in X and color != R:\r\n print(-1)\r\n return\r\n if curr in Y and color != B:\r\n print(-1)\r\n return\r\n\r\n XL = list(X)\r\n print(len(XL))\r\n print(\" \".join(str(x) for x in XL))\r\n YL = list(Y)\r\n print(len(YL))\r\n print(\" \".join(str(y) for y in YL))\r\n\r\n\r\nmain()\r\n\r\n# ==============================================================\r\n\r\nif debug_mode:\r\n infile.close()\r\n", "from collections import defaultdict\r\nfrom collections import deque\r\nn,m=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\nc={}\r\nf=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 visited[i]=1\r\n while q:\r\n j=q.popleft()\r\n co=c.get(j,0)\r\n if co==0:\r\n c[j]='a'\r\n co='a'\r\n for k in d[j]:\r\n if visited[k]==0:\r\n coo=c.get(k,0)\r\n if coo==0:\r\n c[k]='a' if co=='b' else 'b'\r\n q.append(k)\r\n visited[k]=1\r\nfor i in d:\r\n co=c[i]\r\n for j in d[i]:\r\n coo=c[j]\r\n if co==coo:\r\n f=1\r\n break\r\n if f:\r\n break\r\nif f:\r\n print(-1)\r\nelse:\r\n a,b=[],[]\r\n for i in range(1,n+1):\r\n co=c.get(i,0)\r\n if co=='a':\r\n a.append(i)\r\n elif co=='b':\r\n b.append(i)\r\n print(len(a))\r\n print(*a)\r\n print(len(b))\r\n print(*b)", "from collections import defaultdict\r\n\r\n\r\n\r\ndef isbipartite(graph,n,node,color):\r\n q=[node]\r\n color[node]=1\r\n while(q!=[]):\r\n curr=q.pop(0)\r\n \r\n for ele in graph[curr]:\r\n if(color[ele]==color[curr]):\r\n return False\r\n elif(color[ele]==-1):\r\n color[ele]=1-color[curr]\r\n q.append(ele)\r\n return True\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\ngraph=defaultdict(list)\r\ns=set()\r\n\r\nfor i in range(m):\r\n ini,fin=map(int,input().split())\r\n\r\n graph[ini].append(fin)\r\n graph[fin].append(ini)\r\n \r\n s.add(ini)\r\n s.add(fin)\r\n\r\ncolor=[-1]*(n+1)\r\nflag=0\r\nfor i in range(1,n+1):\r\n if(color[i]==-1):\r\n if(not isbipartite(graph,n,i,color)):\r\n flag=1\r\n break\r\n\r\n\r\nif(flag):\r\n print(-1)\r\nelse:\r\n pari=[]\r\n arya=[]\r\n \r\n for i in range(1,n+1):\r\n\r\n if(i in s):\r\n\r\n if(color[i]==0):\r\n arya.append(i)\r\n else:\r\n pari.append(i)\r\n \r\n print(len(arya))\r\n for ele in arya:\r\n print(ele,end=\" \")\r\n\r\n print(\" \")\r\n\r\n print(len(pari))\r\n for ele in pari:\r\n print(ele,end=\" \")\r\n\r\n print(\" \")\r\n \r\n", "from collections import deque\n\n\ndef solve(adj):\n n = len(adj)\n color = [None] * n\n for u in range(n):\n if color[u] is None:\n color[u] = 0\n q = deque()\n q.append(u)\n while q:\n x = q.popleft()\n for y in adj[x]:\n if color[y] is None:\n color[y] = color[x] ^ 1\n q.append(y)\n else:\n if color[y] == color[x]:\n return None\n return [[i for i in range(n) if color[i] == c] for c in range(2)]\n\n\nn, m = map(int, input().split())\nadj = [[] for i in range(n)]\nfor i in range(m):\n u, v = map(int, input().split())\n adj[u - 1].append(v - 1)\n adj[v - 1].append(u - 1)\nres = solve(adj)\nif res is None:\n print(-1)\nelse:\n for l in res:\n print(len(l))\n print(*[e + 1 for e in l])\n", "def bfs(start):\r\n queue = [start]\r\n colors[start] = 1\r\n while queue:\r\n node = queue.pop(0)\r\n for neighbor in graph[node]:\r\n if colors[neighbor] == 0:\r\n colors[neighbor] = -colors[node]\r\n queue.append(neighbor)\r\n elif colors[neighbor] == colors[node]:\r\n return False\r\n return True\r\n\r\nn, m = map(int, input().split())\r\ngraph = [[] for i in range(n+1)]\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\n\r\ncolors = [0] * (n+1)\r\nfor i in range(1, n+1):\r\n if colors[i] == 0:\r\n if not bfs(i):\r\n print(-1)\r\n exit()\r\n\r\ngroup1 = [i for i in range(1, n+1) if colors[i] == 1]\r\ngroup2 = [i for i in range(1, n+1) if colors[i] == -1]\r\n\r\nprint(len(group1))\r\nprint(*group1)\r\nprint(len(group2))\r\nprint(*group2)\r\n", "from collections import Counter as cntr\r\nfrom math import inf\r\ndef cin():\r\n\treturn map(int, input().split(' '))\r\nn,m = cin()\r\ng = {i:[] for i in range(n)}\r\nfor i in range(m):\r\n\tu, v = cin()\r\n\tu -= 1\r\n\tv -= 1\r\n\tg[u].append(v)\r\n\tg[v].append(u)\r\nt = [0 for i in range(n)]\r\ncolor = [-1 for i in range(n)]\r\nflag = 0\r\nfor i in range(n):\r\n\r\n\tif t[i]: continue\r\n\r\n\tq = [i]\r\n\tt[i] = 1\r\n\tcolor[i] = 1\r\n\twhile(len(q)>0):\r\n\t\tidx = q.pop()\r\n\r\n\t\tfor v in g[idx]:\r\n\t\t\tif not t[v]:\r\n\t\t\t\tt[v] = 1\r\n\t\t\t\tcolor[v] = 3-color[idx]\r\n\t\t\t\tq.append(v)\r\n\t\t\telse:\r\n\t\t\t\tif color[v] == color[idx]:\r\n\t\t\t\t\tprint(-1)\r\n\t\t\t\t\texit(0)\r\nl = cntr(color)\r\none = []\r\ntwo = []\r\nfor v in range(n):\r\n\tif color[v]==1:\r\n\t\tone.append(v+1)\r\n\telse:\r\n\t\ttwo.append(v+1)\r\nprint(l[1])\r\nprint(*one)\r\nprint(l[2])\r\nprint(*two)\r\n\r\n", "import io,os,sys,math\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\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\nn,m=map(int,input().split())\r\nadj=[[] for i in range(n+1)]\r\nedges=[]\r\nfor i in range(m):\r\n s,e=map(int,input().split())\r\n adj[s].append(e)\r\n adj[e].append(s)\r\n edges.append((s,e))\r\nvisited=[3]*(n+1)\r\n@bootstrap\r\ndef dfs(node,old):\r\n if visited[node] != 3:\r\n yield\r\n new=(old+1)%2\r\n visited[node]=new\r\n for i in adj[node]:\r\n yield dfs(i,new)\r\n yield\r\nfor i in range(1,n+1):\r\n if visited[i] == 3:\r\n dfs(i,0)\r\nf=True\r\n\r\nfor s,e in edges:\r\n if visited[s] == visited[e]:\r\n print(-1)\r\n f=False\r\n break\r\nif f:\r\n ans1=[]\r\n ans2=[]\r\n for i in range(1,n+1):\r\n if visited[i] == 0:\r\n ans1.append(i)\r\n else:\r\n ans2.append(i)\r\n print(len(ans1))\r\n print(*ans1)\r\n print(len(ans2))\r\n print(*ans2)\r\n", "import sys\r\nfrom math import sqrt, gcd, factorial, ceil, floor, pi, inf\r\nfrom collections import deque, Counter, OrderedDict, defaultdict\r\nfrom heapq import heapify, heappush, heappop\r\n#sys.setrecursionlimit(10**5)\r\nfrom functools import lru_cache\r\n#@lru_cache(None)\r\n\r\n#======================================================#\r\ninput = lambda: sys.stdin.readline()\r\nI = lambda: int(input().strip())\r\nS = lambda: input().strip()\r\nM = lambda: map(int,input().strip().split())\r\nL = lambda: list(map(int,input().strip().split()))\r\n#======================================================#\r\n\r\n#======================================================#\r\ndef primelist():\r\n L = [False for i in range((10**10)+1)]\r\n primes = [False for i in range((10**10)+1)]\r\n for i in range(2,(10**10)+1):\r\n if not L[i]:\r\n primes[i]=True\r\n for j in range(i,(10**10)+1,i):\r\n L[j]=True\r\n return primes\r\ndef isPrime(n):\r\n p = primelist()\r\n return p[n]\r\n#======================================================#\r\ndef bst(arr,x):\r\n low,high = 0,len(arr)-1\r\n ans = -1\r\n while low<=high:\r\n mid = (low+high)//2\r\n #if arr[mid]==x:\r\n # return mid\r\n if arr[mid]<=x:\r\n low = mid+1\r\n else:\r\n high = mid-1\r\n ans = mid\r\n return ans\r\n \r\n \r\ndef factors(x):\r\n l1 = []\r\n l2 = []\r\n for i in range(1,int(sqrt(x))+1):\r\n if x%i==0:\r\n if (i*i)==x:\r\n l1.append(i)\r\n else:\r\n l1.append(i)\r\n l2.append(x//i)\r\n for i in range(len(l2)//2):\r\n l2[i],l2[len(l2)-1-i]=l2[len(l2)-1-i],l2[i]\r\n return l1+l2\r\n#======================================================#\r\n\r\ndef power(n,x):\r\n if x==0:\r\n return 1\r\n k = (10**9)+7\r\n if n==1:\r\n return 1\r\n if x==1:\r\n return n\r\n ans = power(n,x//2)\r\n if x%2==0:\r\n return (ans*ans)%k\r\n return (ans*ans*n)%k\r\n\r\n#======================================================#\r\n\r\ndef f():\r\n visited = [False for i in range(n)]\r\n a = set()\r\n b = set()\r\n for i in range(n):\r\n if not visited[i]:\r\n visited[i]=True\r\n l = [i]\r\n if len(adj[i]):\r\n a.add(i+1)\r\n c = 2\r\n while l:\r\n r = []\r\n for x in l:\r\n for j in adj[x]:\r\n if not visited[j]:\r\n visited[j]=True\r\n if c%2==1:\r\n a.add(j+1)\r\n else:\r\n b.add(j+1)\r\n r.append(j)\r\n else:\r\n if c%2==1:\r\n if j+1 in b:\r\n return -1,[set(),set()]\r\n else:\r\n if j+1 in a:\r\n return -1,[set(),set()]\r\n l = [k for k in r]\r\n c+=1\r\n return 0,[a,b]\r\n\r\n\r\nn,m = M()\r\nadj = [[] for i in range(n)]\r\nfor _ in range(m):\r\n v,u = M()\r\n adj[u-1].append(v-1)\r\n adj[v-1].append(u-1)\r\nx,y = f()\r\nif x==-1:\r\n print(-1)\r\nelse:\r\n print(len(y[0]))\r\n print(*y[0])\r\n print(len(y[1]))\r\n print(*y[1])\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n \r\n", "from collections import defaultdict\r\n\r\nI = lambda: int(input())\r\nIL = lambda: list(map(int, input().split()))\r\n\r\nn, m = IL()\r\nN = defaultdict(set)\r\n\r\nfor i in range(m):\r\n a, b = IL()\r\n N[a].add(b)\r\n N[b].add(a)\r\n\r\nV = [0] * (n+1)\r\nCOL = [-1] * (n+1)\r\n\r\nans = 1\r\nfor i in range(1, n+1):\r\n if V[i]:\r\n continue\r\n\r\n V[i] = 1\r\n COL[i] = 0\r\n\r\n S = {i}\r\n while S:\r\n v1 = S.pop()\r\n for v2 in N[v1]:\r\n if COL[v1] == COL[v2]:\r\n ans = 0\r\n elif not V[v2]:\r\n V[v2] = 1\r\n S.add(v2)\r\n COL[v2] = 1-COL[v1]\r\n\r\nif not ans:\r\n print(-1)\r\nelse:\r\n print(sum(c==0 for c in COL))\r\n print(*[i for i, c in enumerate(COL) if c==0])\r\n print(sum(c==1 for c in COL))\r\n print(*[i for i, c in enumerate(COL) if c==1])\r\n", "from collections import deque\nlin = input().split()\nn, m = int(lin[0]), int(lin[1])\n\ngraph = [[] for i in range(n)]\n# graph2 = n * [[]] equivalent\nfor i in range(m):\n curr = input().split()\n u, v = int(curr[0]) - 1, int(curr[1]) - 1\n graph[u].append(v)\n graph[v].append(u)\n## Graph built, do bfs to check if its bipartite.\n\ncolor = [-1 for i in range(n)]\n\n\ndef bipartiteBFS(source: int) -> bool:\n dq = deque()\n dq.appendleft(source)\n color[source] = 0 # start coloring w 0.\n colorable = True\n while len(dq) > 0 and colorable:\n curr = dq.popleft() ## curr is like a parent\n for neighbor in graph[curr]:\n if color[neighbor] == - 1:\n dq.append(neighbor)\n color[neighbor] = 1 - color[curr]\n elif (color[neighbor] == color[curr]): # not bipartite\n colorable = False\n return colorable\nans = True\nfor node_value in range(n): \n if color[node_value] == -1:\n ans &= bipartiteBFS(node_value)\n\nif (ans):\n set1 = [index for index in range(len(color)) if color[index]]\n set2 = [index for index in range(len(color)) if not color[index]]\n print (len(set1))\n for num in set1:\n print (num+1, end = ' ')\n print()\n print (len(set2))\n for num in set2:\n print (num+1, end = ' ')\n print()\nelse: \n print(-1)\n\n\t\t \t\t\t \t\t \t \t\t\t \t\t\t \t\t\t\t \t \t", "# In this template you are not required to write code in main\r\n\r\nimport sys\r\ninf = float(\"inf\")\r\n\r\n#sys.setrecursionlimit(1000000)\r\n#from cmath import sqrt\r\n#from collections import deque, Counter, OrderedDict,defaultdict\r\n#from heapq import nsmallest, nlargest, heapify,heappop ,heappush, heapreplace\r\n#from math import ceil,floor,log,sqrt,factorial,pow,pi,gcd\r\n#from bisect import bisect_left,bisect_right\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,MOD=1000000007,998244353\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\ndef is_bipartite(graph):\r\n n = len(graph)\r\n color = [-1] * n\r\n\r\n for start in range(n):\r\n if color[start] == -1:\r\n color[start] = 0\r\n stack = [start]\r\n\r\n while stack:\r\n parent = stack.pop()\r\n\r\n for child in graph[parent]:\r\n if color[child] == -1:\r\n color[child] = 1 - color[parent]\r\n stack.append(child)\r\n elif color[parent] == color[child]:\r\n return False, color\r\n\r\n return True, color\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\nn,m=get_ints()\r\nmydict={i:[] for i in range(n)}\r\nfor i in range(m):\r\n x,y=get_ints()\r\n mydict[x-1].append(y-1)\r\n mydict[y-1].append(x-1)\r\nans,color=is_bipartite(mydict)\r\nif not ans:\r\n print(-1)\r\nelse:\r\n result1=[];result2=[]\r\n for i in range(n):\r\n if color[i]==0:\r\n result1.append(i+1)\r\n else:\r\n result2.append(i+1)\r\n print(len(result1))\r\n print(*result1)\r\n print(len(result2))\r\n print(*result2)\r\n", "from collections import defaultdict,deque\r\nn,m = map(int,input().split()) #ver edges\r\ngraph = defaultdict(list)\r\nfor _ in range(m):\r\n st,end = map(int,input().split())\r\n graph[st].append(end)\r\n graph[end].append(st)\r\ngroups = {0 : set(),1 : set()}\r\n\r\ndef bfs(node):\r\n \r\n queue = deque([(node,0)])\r\n groups[0].add(node)\r\n while queue:\r\n node,group = queue.popleft()\r\n for child in graph[node]:\r\n if child in groups[group]:\r\n return False\r\n elif child in groups[1 - group]:\r\n continue\r\n else:\r\n queue.append((child, 1 - group))\r\n groups[1 - group].add(child)\r\n\r\n return True\r\n\r\nvalid = True\r\nfor i in range(1,n + 1):\r\n if not i in groups[0] and not i in groups[1]:\r\n valid = valid and bfs(i)\r\n\r\nif valid:\r\n print(len(groups[0]))\r\n A = list(groups[0])\r\n print(*A)\r\n B = list(groups[1])\r\n print(len(B))\r\n print(*B)\r\nelse:\r\n print(-1)\r\n\r\n \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\n# sys.setrecursionlimit(999)\r\n\r\nn,m = map(int,input().split())\r\nedges = []\r\nhalf = 100002\r\ntree = list(range(200005))\r\n\r\ndef find(x):\r\n if tree[x]!=x:\r\n tree[x] = find(tree[x])\r\n return tree[x]\r\ndef connect(x,y):\r\n tree[find(x)] = find(y+half)\r\n tree[find(y)] = find(x+half)\r\n\r\nfor _ in range(m):\r\n u,v = map(int,input().split())\r\n edges.append([u,v])\r\n connect(u,v)\r\n\r\nans = [set(),set()]\r\ns = {}\r\nfor u,v in edges:\r\n fu,fv = map(find,(u,v))\r\n if fu==fv:\r\n print(-1)\r\n exit(0)\r\n elif fu in s and fv in s:\r\n ans[s[fu]].add(u)\r\n ans[s[fv]].add(v)\r\n elif fv in s:\r\n ans[s[fv]].add(v)\r\n ans[1-s[fv]].add(u)\r\n s[fu] = 1-s[fv]\r\n elif fu in s:\r\n ans[s[fu]].add(u)\r\n ans[1-s[fu]].add(v)\r\n s[fv]= 1-s[fu]\r\n else:\r\n ans[0].add(u)\r\n ans[1].add(v)\r\n s[fu] = 0\r\n s[fv] = 1\r\n \r\nprint(len(ans[0]))\r\nprint(*ans[0])\r\nprint(len(ans[1]))\r\nprint(*ans[1])\r\n", "\"\"\"\nSummary of code:\n- gets input\n- trying to color each node in 2 different color\n- for each node that is not colored\n - do a bfs\n - color each adjacent node different/opposite from the node itself\n - if this is not possible, it is not possible to share\n the graph between 2 of them\n- output the graph according to color\n\nRuntime Complexity:\n- input => O(N + M)\n- for each iteration => O(N)\n - bfs => O(Number of node in that group) => O(N)\n- It looks like the complexity would be O(N) * O(N),\n but because i won't do bfs on same node, thus overall\n it will be O(N)\n- total => O(N+M) + O(N) => O(N + M)\n\nSpace Complexity:\n- input => O(N + M)\n- color => O(N)\n- bfs => O(No of nodes) => O(N)\n- total => O(N + N + N) => O(N)\n\nWhy the Chosen Algorithm are good:\n- the runtime of my code is O(N), and the maximum of N is\n 10^5 in this problem. I have 2 seconds, and so\n 10^5 < 10^7 * 2. Thus it is able to pass!\n\"\"\"\n\nfrom collections import deque\n\nn,m = [int(i) for i in input().split()]\ngraph = {i:set() for i in range(n)}\nfor _ in range(m):\n u,v = [int(i)-1 for i in input().split()]\n graph[u].add(v)\n graph[v].add(u)\n\n\ncolor = [-1]*n\nfor i in range(n):\n if color[i] != -1:\n continue\n color[i] = 0\n queue = deque([i])\n while queue:\n current_node = queue.popleft()\n for next_node in graph[current_node]:\n if color[next_node] != -1:\n if color[next_node] == color[current_node]:\n print(-1)\n exit()\n continue\n color[next_node] = 1 - color[current_node]\n queue.append(next_node)\n\nans = [[],[]]\nfor i in range(n):\n if color[i] >= 0:\n ans[color[i]].append(i+1)\nprint(len(ans[0]))\nprint(\" \".join(str(i) for i in ans[0]))\nprint(len(ans[1]))\nprint(\" \".join(str(i) for i in ans[1]))\n\t \t \t \t\t \t\t\t\t\t \t\t \t\t\t \t \t", "def bfs(graph,startnode):\r\n tovisit=[startnode]\r\n while tovisit:\r\n node=tovisit.pop()\r\n for i in graph[node]:\r\n if(color[i]==[]):\r\n tovisit.append(i)\r\n if color[node]==['R']:\r\n color[i]=['B']\r\n elif color[node]==['B']:\r\n color[i]=['R']\r\n else:\r\n if color[node]==color[i]:\r\n return False \r\nn,m=map(int,input().split())\r\ngraph=[[]for i in range(n+1)]\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\narya,pari=[],[]\r\ncolor=[[]for i in range(n+1)]\r\nfor i in range(1,n+1):\r\n if(color[i]==[]):\r\n color[i]=['R']\r\n res=bfs(graph,i)\r\n if res==False :\r\n print(-1)\r\n exit()\r\n elif color[i]==['R']:\r\n pari.append(i)\r\n elif color[i]==['B']:\r\n arya.append(i)\r\nprint(len(arya))\r\nprint(' '.join(map(str,arya)))\r\nprint(len(pari))\r\nprint(' '.join(map(str,pari)))\r\n\r\n \r\n ", "from collections import deque\r\n\r\nn, m = map(int,input().split())\r\nd = dict()\r\n\r\nfor i in range(m):\r\n u, v = map(int,input().split())\r\n if u not in d:\r\n d[u] = set()\r\n if v not in d:\r\n d[v] = set()\r\n\r\n d[u].add(v)\r\n d[v].add(u)\r\n \r\n\r\ncolor = [False] * (n+1)\r\n\r\nused = set()\r\nnot_used = set([i+1 for i in range(n)])\r\nalarm = False\r\n\r\nq = deque()\r\ncool = 0\r\nwhile len(not_used) > 0:\r\n q.append(not_used.pop())\r\n color[q[0]] = cool\r\n cool = (cool + 1) % 2\r\n \r\n while len(q) > 0:\r\n temp = q.pop()\r\n used.add(temp)\r\n not_used.discard(temp)\r\n if temp not in d:\r\n continue\r\n for x in d[temp]:\r\n if x not in used:\r\n q.append(x)\r\n color[x] = (color[temp] + 1) % 2\r\n else:\r\n if color[x] == color[temp]:\r\n alarm = True\r\n\r\nif alarm:\r\n print(-1)\r\nelse:\r\n #print(color)\r\n blue = set()\r\n red = set()\r\n for i in range(1, n+1):\r\n if color[i] == 0:\r\n red.add(i)\r\n else:\r\n blue.add(i)\r\n print(len(red))\r\n print(*red)\r\n print(len(blue))\r\n print(*blue)\r\n", "import sys\r\nfrom collections import deque\r\ninput = sys.stdin.readline\r\nn, m = map(int, input().split())\r\ngraph = {}\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if a not in graph:\r\n graph[a] = [b]\r\n else:\r\n graph[a].append(b)\r\n if b not in graph:\r\n graph[b] = [a]\r\n else:\r\n graph[b].append(a)\r\n\r\nseen_0 = {}\r\nseen_1 = {}\r\npossible = True\r\nfor i in range(1, n+1):\r\n if i in graph and i not in seen_0 and i not in seen_1:\r\n queue = deque([i])\r\n seen_0[i] = 1\r\n while queue:\r\n current = queue.popleft()\r\n for nxt in graph[current]:\r\n if current in seen_0 and nxt in seen_0:\r\n possible = False\r\n break\r\n if current in seen_1 and nxt in seen_1:\r\n possible = False\r\n break\r\n if nxt not in seen_0 and nxt not in seen_1:\r\n if current in seen_0:\r\n seen_1[nxt] = 1\r\n else:\r\n seen_0[nxt] = 1\r\n queue.append(nxt)\r\n if possible == False:\r\n break\r\n if possible == False:\r\n break\r\nif possible == False:\r\n print(-1)\r\n sys.exit()\r\nprint(len(seen_0))\r\nprint(*seen_0)\r\nprint(len(seen_1))\r\nprint(*seen_1)", "num, edge = map(int, input().strip().split())\nadj = [set() for _ in range(num)]\ngroup = [0] * num\n\nfor _ in range(edge):\n u, v = map(int, input().strip().split())\n adj[u - 1].add(v - 1)\n adj[v - 1].add(u - 1)\n\nfor i in range(num):\n if group[i] != 0:\n continue\n group[i] = 1\n q = [i]\n while len(q) != 0:\n u = q.pop(0)\n for v in adj[u]:\n if group[v] == 0:\n group[v] = 2 if group[u] == 1 else 1\n q.append(v)\n else:\n if group[u] == group[v]:\n print(\"-1\")\n exit()\n\nnodes = [str(i + 1) for i, g in enumerate(group) if g == 1]\nprint(len(nodes))\nprint(\" \".join(nodes))\nnodes = [str(i + 1) for i, g in enumerate(group) if g == 2]\nprint(len(nodes))\nprint(\" \".join(nodes))\n \t \t \t \t\t \t\t\t\t \t \t \t\t \t\t", "n, m = map(int, input().split())\r\nfl = False\r\nf = [0] * 100001\r\nE = [[] for i in range(n + 1)]\r\ne = [tuple(map(int, input().split())) for _ in range(m)]\r\n\r\nfor u, v in sorted(e): E[u] += [v]; E[v] += [u]\r\n\r\ndef bfs(nom, col):\r\n ch = [(nom, col)]\r\n while ch:\r\n v, c = ch.pop()\r\n if f[v] == 0: \r\n f[v] = c \r\n for u in E[v]: \r\n if f[u] == 0: ch += [(u, 3 - c)]\r\n\r\n\r\nfor x in range(1, n + 1): \r\n if f[x] == 0: bfs(x, 1)\r\nfor u, v in e:\r\n if f[u] == f[v]: fl = True; break\r\nif fl: print(-1)\r\nelse:\r\n a = [i for i in range(n + 1) if f[i] == 1]\r\n b = [i for i in range(n + 1) if f[i] == 2]\r\n print(len(a)); print(*a)\r\n print(len(b)); print(*b)", "from collections import defaultdict,deque\r\ndef bfs(graph,u,vis,a,b,x,ele):\r\n q=deque()\r\n vis[u]=True\r\n q.append(u)\r\n k=0\r\n while q:\r\n s=q.popleft()\r\n for i in graph[s]:\r\n ele[i]=0\r\n if vis[i]==False:\r\n if x[s]==1:\r\n b.append(i)\r\n x[i]=2\r\n else:\r\n a.append(i)\r\n x[i]=1\r\n q.append(i)\r\n vis[i]=True\r\n else:\r\n if x[s]==x[i]:\r\n k=-1\r\n break\r\n if k==-1:\r\n break\r\n return k\r\nn,m=map(int,input().split())\r\nd=defaultdict(list)\r\nele=[0]*(n+1)\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n if i==0:\r\n start=u\r\n d[u].append(v)\r\n d[v].append(u)\r\n ele[u]=1\r\n ele[v]=1\r\na=[]\r\nb=[]\r\nvis=[False]*(n+1)\r\nfor hello in range(n):\r\n if ele[hello]==0:\r\n continue\r\n ele[hello]=0\r\n a.append(hello)\r\n x={hello:1}\r\n val=bfs(d,hello,vis,a,b,x,ele)\r\n if val==-1:\r\n break\r\nif val==-1:\r\n print(-1)\r\nelse:\r\n print(len(b))\r\n print(*b)\r\n print(len(a))\r\n print(*a)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nfrom collections import defaultdict\r\nfrom collections import deque\r\n\r\n\r\nnum_vertices, num_edges = [int(x) for x in input().split()]\r\n\r\nneighbors = defaultdict(set)\r\nfor edge_ittr in range(num_edges):\r\n a,b = [int(x) for x in input().split()]\r\n neighbors[a].add(b)\r\n neighbors[b].add(a)\r\n\r\n\r\ndef Solve():\r\n assignment = dict()\r\n \r\n # is there a bipartite coloring?\r\n \r\n for node_0 in range(1, num_vertices + 1):\r\n if node_0 not in assignment:\r\n assignment[node_0] = 1\r\n frontier = deque([node_0])\r\n while frontier:\r\n node = frontier.popleft()\r\n for neighbor in neighbors[node]:\r\n if neighbor in assignment:\r\n if assignment[neighbor] == assignment[node]:\r\n print(-1)\r\n return \r\n else:\r\n assignment[neighbor] = 3 - assignment[node]\r\n frontier.append(neighbor)\r\n \r\n \r\n num_ones = 0 \r\n num_twos = 0\r\n ones = []\r\n twos = []\r\n for node in range(1, num_vertices + 1):\r\n color = assignment[node]\r\n if color == 1:\r\n num_ones += 1\r\n ones += [node]\r\n else:\r\n num_twos +=1\r\n twos += [node]\r\n \r\n print(num_ones)\r\n print(*ones)\r\n print(num_twos)\r\n print(*twos)\r\n return \r\n\r\nSolve()\r\n\r\n \r\n ", "from collections import deque\n\n\ndef bfs(adj, j, vis, coloring):\n que = deque([j])\n while que:\n v = que.popleft()\n vis[v] = True\n for u in adj[v]:\n if vis[u]:\n if coloring[u] == coloring[v]:\n return False\n else:\n coloring[u] = (coloring[v] + 1) % 2\n que.append(u)\n return True\n\n\nn, m = (int(x) for x in input().split())\nadj = [[] for _ in range(n + 1)]\nfor _ in range(m):\n u, v = (int(x) for x in input().split())\n adj[u].append(v)\n adj[v].append(u)\nvis = [False] * (n + 1)\ncoloring = [0] * (n + 1)\nres = True\nfor j in range(1, n + 1):\n if not vis[j]:\n res = res and bfs(adj, j, vis, coloring)\nif res:\n u = [j for j in range(1, n + 1) if coloring[j]]\n v = [j for j in range(1, n + 1) if not coloring[j]]\n print(len(u))\n print(' '.join(str(x) for x in u))\n print(len(v))\n print(' '.join(str(x) for x in v))\nelse:\n print(-1)", "import os\r\nfrom collections import deque\r\ndef bfs(g,start,color) :\r\n to_visit=deque() \r\n to_visit.appendleft(start) \r\n color[start]='g'\r\n while(to_visit):\r\n node=to_visit.pop()\r\n for i in g[node] :\r\n if not color[i]: # si on n'a pas encore donner une couleur au sommet\r\n if color[node]=='g' : #si son parent est green\r\n color[i]='r' #son enfant red\r\n elif color[node]=='r' : #si le pere est red\r\n color[i]='g' #lenfant green\r\n to_visit.appendleft(i)\r\n elif(color[i]==color[node]) :\r\n # si on a deja donner une couleur au sommet et sa couleur egal a son pere alors on ne peut pas devisé le graph\r\n print(-1)\r\n return False\r\n return True #si on a parcouru tous le graph sans trouvé un parent qui a la meme couleur que son fils alors le graph peut etre devisé \r\n \r\n \r\nn,m=map(int,input().split())\r\ng=[[]for i in range(n+1)] \r\ncolor=[None for i in range(n+1)]\r\n#pas de couleur pour tous les sommets\r\ntest=True\r\n#remplir le graph\r\nfor i in range(m) :\r\n node1,node2=map(int,input().split())\r\n g[node1].append(node2)\r\n g[node2].append(node1)\r\n#le graph peut etre non connecter alors on doit parcourir tous ses sous graph \r\nfor i in range(1,len(color)) : #on commence par le sommet 1 \r\n if color[i] == None :\r\n test=bfs(g,i,color)\r\n if not test : #si test egal false alors le graph ne peut pas etre devisé alors on arrete et -1 est deja printed dans la fonction\r\n break \r\nif test==True : #output si le test egal true \r\n print(color.count('g')) #nombre des sommet green\r\n for i in range(len(color)): #les sommet green\r\n if color[i]=='g':\r\n print(i,end=\" \")\r\n print()\r\n print(color.count('r')) #nombre de sommet red\r\n for i in range(n+1) : #les sommet red\r\n if color[i]=='r':\r\n print(i,end=\" \")", "n,m=map(int,input().split())\r\n\r\ng=[[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n u-=1;v-=1\r\n g[u].append(v)\r\n g[v].append(u)\r\n\r\nused=[-1]*n\r\nok=True\r\nw=[[],[]]\r\n\r\ndef bfs(start,color):\r\n used[start]=color\r\n w[color].append(start)\r\n q=[start]\r\n while q!=[]:\r\n for u in g[q[0]]:\r\n if used[u]==-1:\r\n used[u]=(1+used[q[0]])%2\r\n w[used[u]].append(u)\r\n q.append(u)\r\n else:\r\n if used[u]==(used[q[0]]+1)%2:\r\n pass\r\n else:\r\n return False\r\n q.pop(0)\r\n return True\r\n\r\nfor i in range(n):\r\n if used[i]==-1:\r\n if not bfs(i,0):\r\n ok=False\r\n break\r\nif ok:\r\n for i in range(2):\r\n print(len(w[i]))\r\n for j in w[i]:\r\n print(j+1,end=\" \")\r\n print()\r\nelse:\r\n print(-1)\r\n\r\n", "n, m = map(int, input().split())\r\n\r\ngraph = [[] for _ in range(n)]\r\n\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n graph[u-1].append(v-1)\r\n graph[v-1].append(u-1)\r\n\r\ncolors = [-1] * n\r\n\r\ndef bfs(start):\r\n to_visit = [start]\r\n colors[start] = 0\r\n while to_visit:\r\n node = to_visit.pop(0)\r\n for neighbor in graph[node]:\r\n if colors[neighbor] == -1:\r\n colors[neighbor] = 1 - colors[node]\r\n to_visit.append(neighbor)\r\n elif colors[neighbor] == colors[node]:\r\n return False\r\n return True\r\n\r\nfor i in range(n):\r\n if colors[i] == -1:\r\n if not bfs(i):\r\n print(-1)\r\n exit()\r\n\r\ngroup1 = [i+1 for i in range(n) if colors[i] == 0]\r\ngroup2 = [i+1 for i in range(n) if colors[i] == 1]\r\n\r\nprint(len(group1))\r\nprint(\" \".join(map(str, group1)))\r\nprint(len(group2))\r\nprint(\" \".join(map(str, group2)))\r\n", "from collections import deque\n\nn, m = map(int, input().split())\ngraph = [[] for _ in range(n)]\nfor i in range(m):\n u, v = map(int, input().split())\n graph[u-1].append(v-1)\n graph[v-1].append(u-1)\n\nvisited = [False] * n\ncolors = [0] * n\nvb = []\nvr = []\nis_bipartite = True\n\ndef bfs(pos):\n global is_bipartite\n visited[pos] = True\n colors[pos] = 1 # blue = 1\n q = deque([pos])\n while q:\n x = q.popleft()\n if colors[x] == 1:\n vb.append(x+1)\n else:\n vr.append(x+1)\n for i in graph[x]:\n next = i\n if colors[next] != 0 and colors[next] == colors[x]:\n is_bipartite = False\n return\n if not visited[next]:\n visited[next] = True\n if colors[x] == 1:\n colors[next] = 2 \n else:\n colors[next] = 1 \n q.append(next)\n\nfor i in range(n):\n if not visited[i]:\n if not graph[i]:\n continue\n is_bipartite = True\n bfs(i)\n if not is_bipartite:\n print(-1)\n exit()\n\nif is_bipartite:\n s1 = len(vb)\n print(s1)\n print(*vb)\n s2 = len(vr)\n print(s2)\n print(*vr)\nelse:\n print(-1)\n", "import sys\r\nfrom collections import *\r\nsys.setrecursionlimit(10**5)\r\nitr = (line for line in sys.stdin.read().strip().split('\\n'))\r\nINP = lambda: next(itr)\r\ndef ni(): return int(INP())\r\ndef nl(): return [int(_) for _ in INP().split()]\r\n \r\n \r\n \r\nn, m = nl()\r\ng = [[] for _ in range(n+1)]\r\nfor _ in range(m):\r\n a, b = nl()\r\n g[a].append(b)\r\n g[b].append(a)\r\n \r\n#print(g)\r\n#bipartness check\r\n#do a bfs\r\nvisited = [False for _ in range(n+1)]\r\nR, B = {}, {}\r\ndef bfs(s):\r\n q = [s]\r\n visited[s] = True\r\n cnt = 0\r\n isB = True\r\n R[s] = True\r\n while q:\r\n q2 = []\r\n if cnt % 2 != 0:\r\n isB = False\r\n else:\r\n isB = True\r\n cnt += 1\r\n \r\n for node in q:\r\n #print(node, isB)\r\n #print(R,B)\r\n for v in g[node]:\r\n #print(\"neightobur: \", v)\r\n if visited[v]:\r\n if isB:\r\n if v in R:\r\n #print(\"here\")\r\n return False\r\n else:\r\n if v in B:\r\n return False\r\n else:\r\n if isB:\r\n B[v] = True\r\n else:\r\n R[v] = True\r\n visited[v] = True\r\n q2.append(v)\r\n q = q2\r\n ##print(\"what\")\r\n #print(R, B)\r\n return True\r\n \r\nf = True\r\nfor i in range(1, n+1):\r\n if not visited[i]:\r\n if len(g[i]) == 0:\r\n visited[i] = True\r\n else:\r\n if not bfs(i):\r\n f = False\r\n \r\nif not f:\r\n print(-1)\r\nelse:\r\n #print(S, S2)\r\n print(len(R.keys()))\r\n for p in R.keys():\r\n print(p, end = \" \")\r\n print()\r\n print(len(B.keys()))\r\n for p in B.keys():\r\n print(p, end = \" \")", "n,m = list(map(int,input().split()))\r\nGraph = [ [] for _ in range(n) ]\r\nedges = []\r\nfor i in range(m):\r\n Ui,Vi = list(map(int, input().split()))\r\n Graph[Ui-1].append(Vi-1)\r\n Graph[Vi-1].append(Ui-1)\r\n edges.append((Ui-1,Vi-1))\r\n\r\nGroups = [0] * n\r\n\r\ndef DFS(start,group):\r\n to_visit = [(start,group)]\r\n while to_visit:\r\n current, g = to_visit.pop()\r\n if Groups[current] == 0 and Graph[current]!=[]:\r\n Groups[current] = g\r\n for neighbor in Graph[current]:\r\n if Groups[neighbor] == 0:\r\n to_visit.append((neighbor,3-g)) ## 3-g switches the group between 1 and 2 for all connected nodes\r\nfor i in range(n):\r\n if Groups[i] == 0:\r\n DFS(i,1)\r\ntest = False\r\nfor u,v in edges:\r\n if Groups[u] == Groups[v]:\r\n test = True\r\n break\r\n\r\nGroup1 = []\r\nGroup2 = []\r\nif test:\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if Groups[i] == 1:\r\n Group1.append(i+1)\r\n if Groups[i] == 2:\r\n Group2.append(i+1)\r\n print(len(Group1))\r\n print(*Group1)\r\n print(len(Group2))\r\n print(*Group2)", "n, m = map(int, input().split())\r\nx, y = [], []\r\nres = [-1] * (n+1)\r\nadj = [[] for i in range(n+1)]\r\n\r\nfor _ 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 x.append(u)\r\n y.append(v)\r\n\r\ndef dfs(u, p):\r\n stk = [(u, p)] \r\n while stk:\r\n u, p = stk[-1]\r\n stk.pop()\r\n for v in adj[u]:\r\n if v != p and res[v] == -1:\r\n res[v] = 1 - res[u]\r\n stk.append((v, u))\r\n\r\nfor i in range(1, n+1):\r\n if res[i] == -1:\r\n res[i] = 1\r\n dfs(i, -1)\r\n\r\nfor i in range(m):\r\n if res[x[i]] == res[y[i]]:\r\n print(-1)\r\n exit()\r\n\r\nprint(res.count(0))\r\nprint(*[i for i in range(n+1) if res[i] == 0])\r\nprint(res.count(1))\r\nprint(*[i for i in range(n+1) if res[i] == 1])\r\n", "from collections import defaultdict, deque\r\n\r\nn, m = list(map(int, input().split()))\r\n\r\nadj = defaultdict(list)\r\nfor _ in range(m):\r\n u, v = list(map(int, input().split()))\r\n adj[u].append(v)\r\n adj[v].append(u)\r\n\r\ndef bfs(src, color, adj):\r\n que = deque([[src, 0]])\r\n while que:\r\n node, c = que.popleft()\r\n for ngh in adj[node]:\r\n if ngh in color and color[node] == color[ngh]:\r\n return False\r\n elif ngh not in color:\r\n que.append([ngh, 1-c])\r\n color[ngh] = 1-c\r\n\r\n return True\r\n\r\ncolor = {}\r\nbipartite = True\r\nfor src in range(1, n+1):\r\n if src not in color:\r\n bipartite = bfs(src, color, adj)\r\n if not bipartite:\r\n break\r\n\r\nif bipartite:\r\n A = [node for node in color if color[node] == 0]\r\n B = [node for node in color if color[node] == 1]\r\n print(len(A))\r\n print(*A)\r\n print(len(B))\r\n print(*B)\r\nelse:\r\n print(-1)\r\n \r\n\r\n", "\r\n\r\n\r\nfrom collections import deque , defaultdict\r\nn , m = map(int,input().split())\r\ng = defaultdict(list)\r\nvisited = [-1]*(n + 1)\r\nx , y = [] , []\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 x.append(u)\r\n y.append(v)\r\n\r\ndef bfs(node,p):\r\n q = deque()\r\n q.append((node , p))\r\n while q :\r\n s1 , s2 = q.popleft()\r\n for i in g[s1]:\r\n if i != s2 and visited[i] == -1:\r\n visited[i] = 1 - visited[s1]\r\n q.append((i , s1))\r\n\r\n\r\nfor i in range(1 , n + 1):\r\n if visited[i] == -1:\r\n visited[i] = 1\r\n bfs(i , -1)\r\n#print(visited)\r\n\r\nfor i in range(m):\r\n if visited[x[i]] == visited[y[i]]:\r\n print('-1')\r\n exit(0)\r\n\r\nprint(visited.count(0))\r\nfor i in range(n+1):\r\n if visited[i] == 0 :\r\n print(i , end = ' ')\r\nprint()\r\nprint(visited.count(1))\r\nfor i in range(n + 1):\r\n if visited[i] == 1 :\r\n print(i , end = ' ')\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time, functools\r\n#inf = 10**20\r\n#defaultdict\r\n# inf = 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 LS(): return input().split()\r\ndef endl(): return print('\\n')\r\n\r\ndef bfs(z):\r\n\tl = [z]\r\n\tq = collections.deque(l)\r\n\tcol[z]=0\r\n\twhile q:\r\n\t\tu = q.popleft()\r\n\t\tfor v in graph[u]:\r\n\t\t\tif col[v] == -1:\r\n\t\t\t\tq.append(v)\r\n\t\t\t\tl.append(v)\r\n\t\t\t\tcol[v] = col[u]^1\r\n\t\t\telif col[v] == col[u]:\r\n\t\t\t\tprint(-1)\r\n\t\t\t\texit()\r\n\t\t\t\t\t\r\nn,m = LI()\r\n\r\ngraph = collections.defaultdict(list)\r\n\r\nfor _ in range(m):\r\n\tu,v = LI()\r\n\tu-=1\r\n\tv-=1\r\n\tgraph[u].append(v)\r\n\tgraph[v].append(u)\r\n\r\ncol = [-1]*n\r\n\r\nfor i in range(n):\r\n\tif col[i] == -1:\r\n\t\tbfs(i)\r\n\r\nA = [[u + 1 for u in range(n) if col[u] == t] for t in range(2)]\r\nfor V in A:\r\n print(len(V))\r\n print(*V)\r\n\r\n", "from collections import defaultdict\nimport sys\nimport threading\ninput = sys.stdin.readline\n\n############ ---- Input Functions ---- ############\ninp = sys.stdin.readline\ndef input(): return inp().strip()\ndef ii(): return int(input())\ndef mi(): return map(int, input().split())\ndef li(): return list(map(int, input().split()))\n\n\ndef solve():\n graph = defaultdict(list)\n n, m = mi()\n for _ in range(m):\n u, v = mi()\n graph[u].append(v)\n graph[v].append(u)\n colors = [None]*(n+1)\n\n def dfs(i):\n stack = [(i, True)]\n ans = True\n while stack:\n curr, currColor = stack.pop(0)\n if colors[curr] != None:\n ans &= currColor == colors[curr]\n continue\n colors[curr] = currColor\n for ne in graph[curr]:\n stack.append((ne, not currColor))\n return ans\n res = True\n for i in range(1, n+1):\n if colors[i] == None:\n res &= dfs(i)\n # print(colors)\n if not res:\n print('-1')\n exit()\n p = []\n r = []\n for k, i in enumerate(colors):\n if i is not None and i:\n p.append(k)\n if i is not None and not i:\n r.append(k)\n # print(p, r, colors)\n print(len(p))\n print(*p)\n print(len(r))\n print(*r)\n\n # return res\n\n\ndef main():\n solve()\n\n\nif __name__ == '__main__':\n sys.setrecursionlimit(1 << 30)\n threading.stack_size(1 << 27)\n\n main_thread = threading.Thread(target=main)\n main_thread.start()\n main_thread.join()\n" ]

[ "\nn = int(input())\ns = input()\n\nl = sorted(list(int(i) for i in s[:n]))\nr = sorted(list(int(i) for i in s[n:]))\n\n\nstrictly_less = all(l[i] < r[i] for i in range(n))\nstrictly_more = all(l[i] > r[i] for i in range(n))\n\nif strictly_less or strictly_more:\n print(\"YES\")\nelse:\n print(\"NO\")\n\n \t \t\t\t \t\t\t\t\t\t \t \t\t \t\t \t\t\t\t", "n=int(input())\r\nvalue=input()\r\nlist1=sorted([value[i]for i in range(n)])\r\nlist2=sorted([value[i]for i in range(n,n*2)])\r\nif list1[0]>list2[0]:\r\n list1,list2=list2,list1\r\nflag=0\r\nfor i in range(n):\r\n if list1[i]>=list2[i]:\r\n flag=1\r\n break\r\nif flag==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")", "n = int(input())\ns = input()\n\na = s[:n]\nb = s[n:]\n\na = sorted(map(int, a))\nb = sorted(map(int, b))\n\nif a[0] < b[0]:\n a, b = b, a\n\nfor i, j in zip(a, b):\n if i <= j:\n print(\"NO\")\n raise SystemExit\n\nprint(\"YES\")\n", "n = int(input())\r\n\r\ns = input()\r\n\r\nc = True\r\n\r\nA1 = sorted( s[ : n ] )\r\nA2 = sorted( s[ n : ] )\r\nA3 = zip(A1,A2)\r\n\r\n\r\nif A1[0] > A2[0] :\r\n\r\n for i in A3 :\r\n\r\n if i[0] > i[1] :\r\n continue\r\n\r\n else:\r\n\r\n c=False\r\n break\r\n\r\nelse:\r\n\r\n\r\n for i in A3 :\r\n\r\n if i[0] < i[1] :\r\n continue\r\n\r\n else:\r\n\r\n c=False\r\n break\r\n\r\nprint('YES' if c else 'NO')", "n=int(input())\r\ns=input()\r\nS=sorted\r\nprint(\"NYOE S\"[all(i<j for i,j in zip(*S([S(s[:n]),S(s[n:])])))::2])# 1697819534.027226", "n=int(input())\r\ns=list(input())\r\ns0=s[:n]\r\ns=s[n:]\r\ns0.sort()\r\ns.sort()\r\nf=True\r\nk=0\r\no=0\r\nfor i in range(0,n) :\r\n s0[i]=int(s0[i])\r\n s[i]=int(s[i])\r\n if s0[i]<s[i] :\r\n k+=1\r\n if s0[i]>s[i] :\r\n o+=1\r\n if s0[i]==s[i] :\r\n f=False\r\n\r\nif (k>0 and o!=0) or (k!=0 and o>0) :\r\n f=False\r\n\r\nif f==False :\r\n print(\"NO\")\r\nelse :\r\n print(\"YES\")", "import sys\r\nimport math\r\nimport copy\r\nfrom collections import deque\r\nfrom collections import *\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef ll(): return list(map(int, input().split()))\r\n\r\n\r\ndef lf(): return list(map(float, input().split()))\r\n\r\n\r\ndef ls(): return list(map(str, input().split()))\r\n\r\n\r\ndef mn(): return map(int, input().split())\r\n\r\n\r\ndef nt(): return int(input())\r\n\r\n\r\ndef ns(): return input()\r\n\r\n\r\ndef ip(n):\r\n if n % 2 == 0:\r\n return n == 2\r\n d = 3\r\n while d * d <= n and n % d != 0:\r\n d += 2\r\n return d * d > n\r\nn=nt()\r\nan=ns()\r\nv=[]\r\nv1=[]\r\nfor x in range(n):\r\n v.append(int(an[x]))\r\nfor x in range(n,2*n):\r\n v1.append(int(an[x]))\r\nt1=list(v1)\r\nt2=list(v)\r\nt3=list(v1)\r\nt4=list(v)\r\nt1.sort()\r\nt2.sort()\r\nt3.sort()\r\nt4.sort()\r\nh=0\r\nct=0\r\nfor x in range(len(t1)):\r\n if t1[x]<t2[x]:\r\n continue\r\n else:\r\n h=1\r\n break\r\nfor x in range(len(t3)):\r\n if t1[x]>t2[x]:\r\n continue\r\n else:\r\n ct=1\r\n break\r\nif ct==1 and h==1:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")\r\n\r\n", "n = int(input())\r\nticket = input()\r\n\r\nstart = []\r\nend = []\r\n\r\nfor i in range(n * 2):\r\n if i < n:\r\n start.append(int(ticket[i]))\r\n else:\r\n end.append(int(ticket[i]))\r\n\r\nstart = sorted(start)\r\nend = sorted(end)\r\n\r\nis_unlucky = True\r\nif start[0] < end[0]:\r\n for i in range(n):\r\n if start[i] >= end[i]:\r\n is_unlucky = False\r\n break\r\nelse:\r\n for i in range(n):\r\n if start[i] <= end[i]:\r\n is_unlucky = False\r\n break\r\n\r\nif is_unlucky == False:\r\n print(\"NO\")\r\nelse:\r\n print(\"YES\")# 1690021502.5286252", "n = int(input())\r\na = list(map(int,input()))\r\none = a[:n]\r\ntwo = a[n:]\r\n\r\none.sort()\r\ntwo.sort()\r\n\r\nt = 0\r\nfor i in range(n):\r\n if one[i] > two[i]:\r\n t += 1\r\nif t == n:\r\n print('YES')\r\nelif t == 0:\r\n r = 0\r\n for j in range(n):\r\n if one[j] < two[j]:\r\n r += 1\r\n print('YES' if r == n else 'NO')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\nf=input()\r\na=list(f)\r\nv=len(a)//2\r\nlis1=a[:v]\r\nlis2=a[v:]\r\nlis1.sort()\r\nlis2.sort()\r\nflag=False\r\nif lis1[0]>lis2[0]:\r\n flag=True\r\ni=0\r\nj=0\r\ns = True\r\nwhile i < v and j < v :\r\n if flag == True :\r\n if lis1[i] <= lis2[j]:\r\n s=False\r\n print(\"NO\")\r\n break\r\n else:\r\n j+=1\r\n i+=1\r\n elif flag == False :\r\n if lis2[j] <= lis1[i]:\r\n s=False\r\n print(\"NO\")\r\n break\r\n else:\r\n j+=1\r\n i+=1\r\n\r\nif s == True :\r\n print(\"YES\")\r\n", "n = int(input())\r\ns = input()\r\nl1 = list(s[:n])\r\nl2 = list(s[n:])\r\nl2.sort()\r\nl3 = l2[::-1]\r\n\r\nans = 1\r\nc1 = 0\r\nc2 = 0\r\na = len(l2)\r\nfor i in range(n):\r\n for j in l2:\r\n if (l1[i]<j): \r\n c1+=1\r\n l2.remove(j)\r\n break\r\nfor i in range(n):\r\n for j in l3:\r\n if (l1[i]>j): \r\n c2+=1\r\n l3.remove(j)\r\n break\r\nif (c1==n) or (c2==n):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n" ]

[ "s=input()\r\nf=False\r\nfor i in range(1,len(s)):\r\n if s[i:]==s[:len(s[i:])] and len(s[i:])-1>=i:\r\n print('YES')\r\n print(s[i:])\r\n f=True\r\n break\r\nif not f:\r\n print('NO')\r\n", "inp = input()\r\nn = len(inp)//2+1\r\nt = False\r\nfor i in range(n,len(inp)):\r\n if inp[:i] == inp[-i:]:\r\n t = True\r\n n = i\r\n break\r\n\r\nif t:\r\n print(\"YES\")\r\n print(inp[:n])\r\nelse:\r\n print(\"NO\")", "s = input()\r\n\r\ndef first(s, i): return s[:i]\r\ndef last(s, i): return s[-i:]\r\n\r\nfor i in range(len(s)//2+1, len(s)):\r\n if first(s, i) == last(s, i):\r\n print(\"YES\")\r\n print(first(s, i))\r\n break\r\nelse: print(\"NO\")", "s = input()\r\nn = len(s)\r\nfor i in range(n):\r\n if i * 2 > n and s[:i] == s[-i:]:\r\n print(\"YES\")\r\n print(s[:i])\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\r\nt = 0\r\nif len(s)%2==0:\r\n n = (len(s)-1)//2+1\r\nelse:\r\n n = (len(s)-1)//2\r\nfor i in range(n, len(s)-1):\r\n a = i\r\n b = len(s)-i-1\r\n if s[:a+1]==s[b:]:\r\n print('YES')\r\n print(s[:a+1])\r\n t = 1\r\n break\r\nif t==0:\r\n print('NO')", "def read_ints():\r\n return [int(x) for x in input(' ').split()]\r\n\r\n\r\ndef compute_prefix(S):\r\n n = len(S)\r\n pi = [0]\r\n for pos in range(1, n):\r\n l = pi[pos - 1]\r\n while l > 0 and S[l] != S[pos]:\r\n l = pi[l - 1]\r\n if S[pos] == S[l]:\r\n l += 1\r\n pi.append(l)\r\n return pi\r\n\r\n\r\ndef main():\r\n S = input()\r\n pi = compute_prefix(S)\r\n if pi[-1] >= 1 + (len(S) >> 1):\r\n print(\"YES\")\r\n pref = pi[-1]\r\n print(S[:pref])\r\n else:\r\n print(\"NO\")\r\n\r\nif __name__ == '__main__':\r\n main()", "st = input()\r\nfor i in range(1, len(st)):\r\n if st[:i] == st[len(st) - i:] and 2*len(st[:i]) > len(st):\r\n print(\"YES\", st[:i], sep = '\\n', end = '')\r\n exit(0)\r\nprint(\"NO\")\r\n", "data = input()\r\nans = ''\r\nfor i in range(len(data) + 1):\r\n for j in range(len(data)):\r\n if j < i and data[:i] == data[j:] and j != 0:\r\n ans = data[:i]\r\nif ans == '':\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(ans)", "s = input()\r\nfor i in range(1, len(s)):\r\n\tif (2 * i > len(s)):\r\n\t\tif (s[:i] == s[-i:]):\r\n\t\t\tprint(\"YES\")\r\n\t\t\tprint(s[:i])\r\n\t\t\tbreak\r\nelse:\r\n\tprint(\"NO\")", "a = input()\r\nif len(a)//2*2 == len(a) :\r\n k = 1\r\n p = 0\r\nelse :\r\n k = 0\r\n p = 1\r\nfor i in range(k,len(a)//2) :\r\n b = a[:len(a)//2 + i + p ]\r\n c = a[len(a)//2 - i:]\r\n if c == b :\r\n print('YES')\r\n print(c)\r\n break\r\nelse:\r\n print('NO')\r\n", "t = input()\r\ns = None\r\nfor i in reversed(range(1, len(t))):\r\n if t[i] != t[0]:\r\n continue\r\n if (i < len(t) - i) and (t.startswith(t[i:])):\r\n s = t[i:]\r\nif s is not None:\r\n print('YES\\n', s, sep ='')\r\nelse:\r\n print('NO\\n')", "s = input()\r\nsize = len(s) // 2 + 1\r\nfor i in range(size, len(s)):\r\n if s[:i] == s[-i:]:\r\n print(\"YES\")\r\n print(s[:i])\r\n break\r\nelse:\r\n print(\"NO\")", "s = input()\r\nx = (len(s)//2)+1\r\nz = 0\r\nfor i in range(x):\r\n a = s[0:(x+i)]\r\n if s.startswith(a) and s.endswith(a) and len(a)<len(s):\r\n print('YES')\r\n print(a)\r\n z += 1\r\n break\r\n else:\r\n pass\r\nif z == 0:\r\n print(\"NO\")\r\n", "s = input()\r\nn = len(s)\r\nfor i in range(n // 2 + 1, n):\r\n if s[0:i] == s[n - i:n]:\r\n print(\"YES\")\r\n print(s[0:i])\r\n exit()\r\nprint(\"NO\")", "s = input()\r\ndone = False\r\nfor i in range(len(s)):\r\n for k in range(i):\r\n if s[:i] == s[k:]:\r\n done = True\r\n res = s[:i]\r\nif done:\r\n print(\"YES\")\r\n print(res)\r\nelse:\r\n print(\"NO\")\r\n", "text=input()\r\nans=None\r\nfor i in reversed(range(1,len(text))):\r\n if text[i]!=text[0]:continue\r\n if i<len(text)-i and text.startswith(text[i:]):\r\n ans=text[i:]\r\nif ans is not None:print('YES\\n',ans,sep='')\r\nelse:print('NO')", "a=input()\r\nn=len(a)\r\nz=list(0 for mas in range(n))\r\nz[0]=n\r\nL=R=0\r\nfor i in range(1, n):\r\n if i<=R:\r\n if z[i-L]<R-i+1:\r\n z[i]=z[i-L]\r\n else:\r\n j=1\r\n while (R+j<n) and (a[R+j]==a[R-i+j]):\r\n j+=1\r\n z[i]=R-i+j\r\n L=i\r\n R+=j-1\r\n else:\r\n j=0\r\n while (i+j<n) and (a[i+j]==a[j]):\r\n j+=1\r\n z[i]=j\r\n L=i\r\n R=i+j-1\r\nq=n//2\r\nif (n%2==0):\r\n q-=1\r\nu=-1\r\nfor i in range(1, q+1):\r\n if z[i]+i==n:\r\n u=i\r\nif u==-1:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n print(a[u::])", "from sys import *\r\ns=input()\r\nfor i in range(1,len(s)):\r\n if s[i:]==s[:len(s)-i] and i<=(len(s)-1)//2:\r\n print('YES')\r\n print(s[i:])\r\n exit(0)\r\nprint('NO')", "text = input()\r\nans = None\r\nfor i in reversed(range(1, len(text))):\r\n\tif text[i] != text[0]: continue\r\n\tif i < len(text) - i and text.startswith(text[i:]):\r\n\t\tans = text[i:]\r\n\r\nif ans is not None: print('YES\\n', ans, sep='')\r\nelse: print('NO')", "a = input()\r\nflag = 0\r\nif len(a)%2==1:\r\n q = len(a)//2\r\n w = q\r\nelse:\r\n q = len(a)//2-1\r\n w = len(a)//2\r\nwhile(q>0 and flag ==0):\r\n if(a[:w+1] == a[q:]):\r\n s = a[:w+1]\r\n flag = 1\r\n else:\r\n q-=1\r\n w+=1\r\nif flag:\r\n print('YES')\r\n print(s)\r\nelse:\r\n print('NO')\r\n", "n=input()\r\n#s=n[:(len(n)-1)//2+1]\r\nc=len(n)//2\r\nfor i in range(c-1):\r\n if n[len(n)-c-1-i:]==n[:c+1+i]:\r\n print('YES')\r\n print(n[:c+i+1])\r\n break\r\nelse: print('NO')\r\n", "def main():\r\n s = input()\r\n for k in range(len(s) // 2 + 1, len(s)):\r\n if s[:k] == s[len(s) - k:]:\r\n print(\"YES\", s[:k], sep = '\\n')\r\n return 0\r\n print(\"NO\")\r\nmain()", "def func(ind):\r\n i = 0\r\n while ind + i < len(s):\r\n if s[ind + i] != s[i]:\r\n return False\r\n i += 1\r\n return True\r\n \r\nflag = False\r\ns = input()\r\nch = s[0]\r\nfor i in range(1, len(s)):\r\n if s[i] == ch:\r\n #print(i)\r\n if func(i):\r\n if s[len(s[i:]) - 1] == s[len(s) - 1] and len(s) != 2*len(s[i:]) and len(s[i:]) >= (len(s) // 2) + 1:\r\n flag =True\r\n break\r\n\r\nif flag:\r\n print('YES')\r\n print(s[i:])\r\nelse:\r\n print('NO')\r\n" ]

[ "from fractions import Fraction\r\n \r\n \r\ndef higher(x1, y1, x2, y2):\r\n if x1 == 0:\r\n if x2 == 0:\r\n return \r\n \r\n \r\ndef min_days(p, q, pr):\r\n ma = max(a for a, b in pr)\r\n mb = max(b for a, b in pr)\r\n pr.sort(key=lambda t: (t[0], -t[1]))\r\n ch = [(0, mb)]\r\n for a, b in pr:\r\n if a == ch[-1][0]:\r\n continue\r\n while (\r\n len(ch) >= 2\r\n and ((b-ch[-2][1])*(ch[-1][0]-ch[-2][0])\r\n >= (a-ch[-2][0])*(ch[-1][1]-ch[-2][1]))\r\n ):\r\n ch.pop()\r\n ch.append((a, b))\r\n ch.append((ma, 0))\r\n \r\n a1, b1 = None, None\r\n for a2, b2 in ch:\r\n if a1 is not None:\r\n d = (a2-a1)*q + (b1-b2)*p\r\n s = Fraction(b1*p-a1*q, d)\r\n if 0 <= s <= 1:\r\n return Fraction(d, a2*b1 - a1*b2)\r\n a1, b1 = a2, b2\r\n \r\n \r\nif __name__ == '__main__':\r\n n, p, q = map(int, input().split())\r\n pr = []\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n pr.append((a, b))\r\n print(\"{:.7f}\".format(float(min_days(p, q, pr))))" ]

[ "n,m = list(map(int,input().split()))\nlst = []\nfor nt in range(n):\n st = list(map(int,input().split()))\n lst.append(st[0]/st[1])\nprint(min(lst)*m)\n\n\t\t\t \t \t\t\t\t \t\t\t\t\t\t \t\t \t\t", "N, M = map(int,input().split())\r\nminCost = float('inf')\r\nfor i in range(N):\r\n A, B = map(int,input().split())\r\n minCost = min(M*A/B, minCost)\r\nprint(minCost)", "import sys\r\ninput = sys.stdin.readline\r\nn,m = map(int,input().split())\r\nans = 10**18\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n ans = min(ans,(a/b)*m)\r\n\r\nprint(ans)", "n,m=map(int,input().split())\nList=[]\nfor i in range(n):\n a,b=map(int,input().split())\n List.append([a,b])\n pass\n\nMin=List[0][0]/List[0][1]\nfor i in range(n):\n N=List[i][0]/List[i][1]\n if Min>N:\n Min=N\n pass\n\n\nprint(Min*m)\n \t\t\t \t \t \t \t\t \t \t\t \t\t\t", "n,m=map(int,input().split())\r\nans=546455544554.15\r\nwhile n:\r\n a,b=map(int,input().split())\r\n ans=min(ans,a/b*m)\r\n n-=1\r\nprint(ans)", "m, n = [int(i) for i in input().split()]\nprice = 0\nfor i in range(m):\n a, b = [int(i) for i in input().split()]\n if a/b < price or price == 0:\n price = a/b\n\nprint(n * price)\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n\ta,b=map(int,input().split())\r\n\tl.append(a/b)\r\nprint(m*min(l))", "n, m = map(int, input().split())\r\nans = 1e10\r\nfor i in range(n):\r\n\tp, k = map(int, input().split())\r\n\tans = min(ans, m*p/k)\r\nprint(f'{ans:.9f}')", "a,b=map(int,input().split());c=[]\r\nfor _ in \" \"*a:e,d=map(int,input().split());c+=[(b/d)*e]\r\nprint(min(c))\r\n", "\r\nn, m = list(map(int, input().split()))\r\n\r\nminPerKilo = 999999999999\r\n\r\nwhile n:\r\n\r\n a, b = list(map(int, input().split()))\r\n\r\n if (a/b) < minPerKilo:\r\n minPerKilo = a / b\r\n\r\n n -= 1\r\n\r\nprint(minPerKilo*m)", "from collections import defaultdict, deque, Counter\r\nfrom sys import stdin, stdout\r\nfrom heapq import heappush, heappop\r\nimport math\r\nimport io\r\nimport os\r\nimport math\r\n# import bisect\r\n\r\nfrom bisect import bisect_left as lower_bound\r\nfrom bisect import bisect_right as upper_bound\r\n \r\n#?############################################################\r\n\r\n\r\ndef isPrime(x):\r\n for i in range(2, x):\r\n if i*i > x:\r\n break\r\n if (x % i == 0):\r\n return False\r\n return True\r\n\r\n#?############################################################\r\n\r\n\r\ndef ncr(n, r, p):\r\n temp = (n*n)\r\n # temp =temp//2\r\n temp %= m\r\n return temp\r\n\r\n#?############################################################\r\n\r\n\r\ndef primeFactors(n):\r\n l = []\r\n while n % 2 == 0:\r\n l.append(2)\r\n n = n / 2\r\n for i in range(3, int(math.sqrt(n))+1, 2):\r\n while n % i == 0:\r\n l.append(int(i))\r\n n = n / i\r\n if n > 2:\r\n l.append(n)\r\n return list(set(l))\r\n\r\n\r\n#?############################################################\r\n\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\r\n\r\ndef sieve(n):\r\n prime = [True for i in range(n+1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * p, n+1, p):\r\n prime[i] = False\r\n p += 1\r\n return prime\r\n\r\n\r\n#?############################################################\r\n\r\ndef digits(n):\r\n c = 0\r\n while (n > 0):\r\n n //= 10\r\n c += 1\r\n return c\r\n\r\n#?############################################################\r\n\r\n\r\ndef ceil(n, x):\r\n if (n % x == 0):\r\n return n//x\r\n return n//x+1\r\n\r\n#?############################################################\r\n\r\n\r\ndef mapin():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef sapin():\r\n return [int(x) for x in input()]\r\n\r\n#?############################################################\r\nclass SegmentTree:\r\n def __init__(self, data, default=0, func=min):\r\n \"\"\"initialize the segment tree with data\"\"\"\r\n self._default = default\r\n self._func = func\r\n self._len = len(data)\r\n self._size = _size = 1 << (self._len - 1).bit_length()\r\n \r\n self.data = [default] * (2 * _size)\r\n self.data[_size:_size + self._len] = data\r\n for i in reversed(range(_size)):\r\n self.data[i] = func(self.data[i + i], self.data[i + i + 1])\r\n \r\n def __delitem__(self, idx):\r\n self[idx] = self._default\r\n \r\n def __getitem__(self, idx):\r\n return self.data[idx + self._size]\r\n \r\n def __setitem__(self, idx, value):\r\n idx += self._size\r\n self.data[idx] = value\r\n idx >>= 1\r\n while idx:\r\n self.data[idx] = self._func(self.data[2 * idx], self.data[2 * idx + 1])\r\n idx >>= 1\r\n \r\n def __len__(self):\r\n return self._len\r\n \r\n def query(self, start, stop):\r\n \"\"\"func of data[start, stop)\"\"\"\r\n start += self._size\r\n stop += self._size\r\n \r\n res_left = res_right = self._default\r\n while start < stop:\r\n if start & 1:\r\n res_left = self._func(res_left, self.data[start])\r\n start += 1\r\n if stop & 1:\r\n stop -= 1\r\n res_right = self._func(self.data[stop], res_right)\r\n start >>= 1\r\n stop >>= 1\r\n \r\n return self._func(res_left, res_right)\r\n \r\n def __repr__(self):\r\n return \"SegmentTree({0})\".format(self.data)\r\nstore = defaultdict(lambda:[])\r\ndef ff(left, right, element):\r\n a = lower_bound(store[element], left)\r\n b = upper_bound(store[element], right)\r\n return b - a\r\n \r\n# input = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nt = 1\r\nfor _ in range(t):\r\n n, m = mapin()\r\n temp = []\r\n for i in range(n):\r\n a, b = [float(x) for x in input().split()]\r\n temp.append(a/b)\r\n temp.sort()\r\n print(m*temp[0])", "def solve(n, m):\r\n\r\n result = []\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n result.append(x/y * m)\r\n\r\n return min(result)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n, m = map(int, input().split())\r\n print(solve(n, m))", "n, m = map(int, input().split())\r\nmn = float(\"inf\")\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n mn = min(mn, a/b * m)\r\nprint(f\"{mn:.9}\")", "#Супермаркет:\r\nn, m =[int(i) for i in input().split()]\r\nshops = []\r\nminimum_ = float('inf')\r\nfor i in range(n):\r\n a, b =[int(i) for i in input().split()]\r\n price = a/b\r\n if price < minimum_:\r\n minimum_ = price\r\nprint(minimum_*m)", "q, m = list(map(int, input().split()))\r\nQ = []\r\nfor i in range(q):\r\n a, b = list(map(int, input().split()))\r\n c = float('{:.8f}'.format(a/b*m))\r\n Q.append(c)\r\nprint(min(Q))", "n, m = list(map(int, input().split()))\r\nc = 1000\r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n if a/b < c:\r\n c = a/b\r\nprint(c*m)", "n,m = map(int,input().split())\r\ncounter = 500001\r\nfor i in range (n):\r\n a,b = map(int,input().split())\r\n if (a / b) * m < counter:\r\n counter = a / b * m\r\nprint (counter)", "n,m = map(int, input().split())\r\nlow_price = 9999999999\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n low_price = min(low_price, a/b)\r\nprint(low_price * m)", "n, m = map(int, input().split())\r\nc = 101\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n c = min(c, a/b)\r\nprint(c*m)", "n = [int(x) for x in input().split()]\nsort = []\nfor i in range(0, n[0]):\n s = [int(x) for x in input().split()]\n sort.append(n[1] * (s[0] / s[1]))\nsort.sort()\nprint(sort[0])", "n, m = list(map(int, input().split()))\r\n\r\nar = []\r\nfor i in range(n):\r\n a, b = list(map(int, input().split()))\r\n ar.append(a/b)\r\n \r\nar = sorted(ar)\r\nprint(round(ar[0] * m, 8))", "[n,m]=map(int,input().split())\r\nminprice=99999999.0\r\nfor i in range(0,n):\r\n [a,b]=map(int,input().split())\r\n price=1.0*a/b\r\n if price<minprice:\r\n minprice=price\r\n \r\nprint(minprice*m) ", "n, m = map(int, input().split())\r\nratio = 101.0\r\nfor _ in range(n):\r\n\ta, b = map(int, input().split())\r\n\tratio = min(ratio, a/b)\r\n \r\nprint(ratio*(m))\r\n", "n, m = [int(i) for i in input().split()]\r\nvalues = []\r\n\r\nfor i in range(n):\r\n x, y = [int(i) for i in input().split()]\r\n values.append(x/y)\r\n\r\nprint(min(values) * m)\r\n", "n, m = [int(i) for i in input().split()]\r\na = []\r\n\r\nfor i in range(n):\r\n x = [int(i) for i in input().split()]\r\n a.append(x[0]/x[1])\r\n\r\nb = min(a)\r\nprint(m*b)\r\n", "n, m = map(float, input().split())\r\nres, n = 1000000000000000000.0, int(n)\r\nfor u in range(n):\r\n a, b = map(float, input().split())\r\n res = min(res, a / b * m)\r\nprint(res)", "n, m = [int(i) for i in input().split()]\r\nmini = float(\"inf\")\r\n\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n x = a / b * m\r\n if x < mini:\r\n mini = x\r\n\r\nprint(mini)", "n, m = [int(x) for x in input().split(' ')]\r\ns = float('inf')\r\nfor _ in range(n):\r\n a, b = list(map(int, input().split(' ')))\r\n s = min(s, (m / b) * a)\r\nprint(\"{:.8f}\".format(s))", "n,m=map(int,input().split());print(m*min(eval(input().replace(' ','/')) for i in range(n)))", "a,o=map(int,input().split())\r\nb=[]\r\nl=123456\r\nfor i in range(a):\r\n b.append(list(map(int,input().split())))\r\nfor i in range(a):\r\n n=b[i][0]/b[i][1]*o\r\n if n<l:\r\n l=n\r\nprint(l)\r\n\r\n", "\r\nn, m = map(int, input().split())\r\nout=10**9+7\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n out=min(out,(a*m)/b)\r\nprint(out)\r\n\r\n\r\n\r\n", "t,k= input(\"\").rsplit() \r\nt,k=int(t),int(k) \r\nsol=list()\r\nfor j in range(t):\r\n s=input(\"\").rsplit() \r\n a,b= int(s[0]),int(s[1]) \r\n sol.append( (a/b)*k)\r\n \r\nprint(min(sol) )\r\n ", "n,m=map(int,input().split())\r\np=1000000000000000000000\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if m/b*a<p:\r\n p=m/b*a\r\nprint(p)", "n,m=[int(i) for i in input().split()]\r\nf=0\r\nfor i in range(n):\r\n a,b=[int(i) for i in input().split()]\r\n c=a/b*m\r\n if f==0:\r\n f=c\r\n elif f>c:\r\n f=c\r\nprint(f)\r\n", "n,m = map(int,input().split())\r\n\r\nvals = []\r\nans = []\r\n\r\nfor i in range(0,n):\r\n arr = [int(x) for x in input().split()]\r\n vals.append(arr)\r\n\r\nfor lst in vals:\r\n ab = lst[0]/lst[1]\r\n ans.append(ab)\r\n\r\nprint(min(ans)*m)", "[n,m] = list(map(int, input().split(' ')))\r\nmi = 100\r\nfor i in range(n):\r\n [a,b] = list(map(int, input().split(' ')))\r\n if(a/b<mi):\r\n mi = a/b\r\nprint(mi*m)\r\n\r\n\r\n \r\n", "n ,m =map(int,input().split())\r\npric=[]\r\nfor i in range(n):\r\n a ,b=map(int,input().split())\r\n pric.append(m*(a/b))\r\nprint(min(pric))", "a, b = list(map(int, input().split()))\r\nmenor = 999999999999\r\n\r\nfor i in range(a):\r\n x, y = list(map(int, input().split()))\r\n if x * (b/y) < menor:\r\n menor = x * (b/y)\r\nprint(menor)", "# https://codeforces.com/problemset/problem/919/A\n\nl1 = list(map(int, input().split(\" \")))\nprice = 10000000000\n\nfor i in range(l1[0]):\n t = list(map(int, input().split(\" \")))\n price = min(price, t[0]/t[1])\n\nprint(price * l1[1])\n \t \t\t \t\t \t \t \t\t \t\t \t \t", "l=[]\r\nn,m=map(int,input().split())\r\nfor _ in range(n):\r\n c1,c2=map(int,input().split())\r\n l.append((m*c1)/c2)\r\nprint(min(l))", "amount_supermarkets, kilos = [int(x) for x in input().split()]\r\nleast = 10**6\r\nfor i in range(amount_supermarkets):\r\n a, b = [int(i) for i in input().split()]\r\n if least > (a/b) * kilos:\r\n least = (a/b) * kilos\r\nprint(least)", "# LUOGU_RID: 114998831\nm,n=map(int,input().split())\r\nalist=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n remain=a/b\r\n alist.append(remain)\r\nalist.sort()\r\nsum=alist[0]*n\r\nprint(\"%.8f\"%sum)\r\n", "n,m=[int(i)for i in input().split()]\r\nd=float('inf')\r\nfor i in range(n):\r\n a,b = [int(i) for i in input().split()]\r\n ab=a/b*m\r\n if ab<d:\r\n d=ab\r\nprint(d)\r\n", "n,m = [int(i)for i in input().split()]\nwinnernumber = 10000000000000\nfor i in range(n):\n a,b = [int(i)for i in input().split()]\n if (a*m)/b < winnernumber:\n winnernumber = (a*m)/b\nprint(winnernumber)\n", "n, m = map(int, input().split())\r\nz = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n z.append(a / b)\r\nprint(min(z) * m)", "n,m=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n l.append((m*a)/b)\r\nk=min(l)\r\nprint(round(k,8))\r\n", "n, m = [int(i) for i in input(). split()]\r\nprices = []\r\nfor i in range(n):\r\n x, y = [int(i) for i in input(). split()]\r\n prices.append(x/y)\r\nprint(m*min(prices))\r\n", "n,m=[int(x) for x in input().split()]\r\nres=1e9\r\nfor i in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n if a/b<res:\r\n res=a/b\r\nprint(round(res*m,10))", "m,n=map(int,input().split())\r\nl=[]\r\nfor i in range(0,m):\r\n a,b=map(int,input().split())\r\n l.append(a/b)\r\nprint(n*min(l))\r\n ", "x = lambda: map(int,input().split())\r\nn,a = x(); m = 10**10\r\nfor i in range(n):\r\n c,d = x()\r\n m = min(m,c/d)\r\nprint(m*a)", "nm = input().split(' ')\r\nn = int(nm[0])\r\nm = int(nm[1])\r\nmin = 0\r\nfor i in range(n):\r\n ab = input().split(' ')\r\n if i==0:\r\n min = int(ab[0])/int(ab[1])\r\n else:\r\n if min > int(ab[0])/int(ab[1]):\r\n min = int(ab[0])/int(ab[1])\r\nprint(min*m)", "# A. Supermarket\r\n\r\nn,k = [int(i) for i in input().split(' ')]\r\nvalues = []\r\nfor j in range(n):\r\n a,b = [int(i) for i in input().split(' ')]\r\n values.append(a/b)\r\nprint(min(values)*k)\r\n\r\n\r\n", "n, m = [int(i) for i in input().split()]\r\ni = 0\r\nbest_deal = 0\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n temp_frac = a/b\r\n if i == 0 or best_deal > temp_frac:\r\n best_deal = temp_frac\r\n\r\nprint(best_deal * m)\r\n", "n, m = [int(i) for i in input().split()]\r\ns=[]\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n s.append(a*m/b)\r\nprint(min(s))", "#!/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,m = map(int, wtf[0].split())\r\n ans = []\r\n for i in range(n):\r\n a,b = map(int, wtf[i+1].split())\r\n ans.append(m*a/b)\r\n am = min(ans)\r\n print(f'{am:.8f}')\r\n", "m,n=map(int,input().split())\r\na=[]\r\nfor r in range(m):\r\n x,y=map(int,input().split())\r\n a=a+[(x/y)*n]\r\nprint(round(min(a),7))", "import math\ndef main():\n n, m = map(int, input().split())\n min = 1 << 60\n for i in range(0, n):\n a, b = map(int, input().split())\n cst = a * m / b\n if min > cst:\n min = cst\n\n print(min)\n\n\nmain()", "i=input;n,m=map(int,i().split());print(m*(min(eval(i().replace(' ','/')) for _ in[0]*n)))", "n, m = map(int, input().split())\r\nlsta = [i for i in range(n)]\r\nlstb = [i for i in range(n)]\r\n\r\nfor i in range(n):\r\n lsta[i], lstb[i] = map(int, input().split())\r\n\r\na, b = lsta[0], lstb[0]\r\n\r\nfor i in range(1, n):\r\n if a * lstb[i] > b * lsta[i]:\r\n a, b = lsta[i], lstb[i]\r\n\r\nprint(format((a * m / b), \".8f\"))\r\n", "# LUOGU_RID: 101738156\n(n, m), *a = [[*map(int, s.split())] for s in open(0)]\r\nprint(min(x[0] / x[1] for x in a) * m)", "n, m = map(int, input().split())\r\nc = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n c.append(a/b)\r\nprint(min(c)*m)", "n, m = map(int, input().split())\nv = []\nfor _ in range(0, n):\n p, k = map(int, input().split())\n v.append(p/k)\nprint(min(v) * m)\n", "n, m = map(int, input().split())\r\nmn = 10**18\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if mn > a / b * m:\r\n mn = a / b * m\r\n\r\nprint(mn)", "n, m = [int(i) for i in input().split()]\r\n\r\n\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n if i >= 1:\r\n if (m * a) / b < anwser:\r\n anwser = (m * a) / b\r\n else:\r\n anwser = (m * a) / b\r\n\r\nprint(anwser)", "x = input().split()\r\nn = int(x[0])\r\nm = int(x[1])\r\nmin1 = 100000\r\nfor i in range(n):\r\n x = input().split()\r\n a = int(x[0])\r\n b = int(x[1])\r\n if m*(a/b) < min1:\r\n min1 = m*(a/b)\r\nprint(min1)", "n,m=map(int,input().split())\r\nar=[ ]\r\nfor i in range (n):\r\n a,b=map(int,input().split())\r\n ar.append(m*a/b)\r\nprint(min(ar))\r\n ", "\r\n \r\nn,m = map(int,input().split())\r\n \r\nans = 100000000\r\nwhile(n>0):\r\n \r\n a,b = map(float,input().split())\r\n val = float(a/b)\r\n val2 = float(m*val)\r\n ans = min(val2,ans)\r\n n = n-1\r\nprint(ans)", "n,l=map(int,input().split())\r\nm=100000000\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n if(m>x/y):\r\n m=x/y\r\n k=[x,y]\r\nprint((k[0]*l)/k[1])", "n,m=[int(x) for x in input().split()]\r\nmaxi=9999999\r\nfor _ in range(n):\r\n a,b=[int(x) for x in input().split()]\r\n if (a/b)<maxi:\r\n maxi=a/b\r\nprint(m*maxi) ", "n,m=map(int,input().split())\r\na,b=map(int,input().split())\r\nmn=a/b*m\r\nfor i in range(n-1):\r\n a,b=map(int,input().split())\r\n c=a/b*m\r\n if(c<mn):\r\n mn=c\r\nprint(mn)", "n, m = [int (num) for num in input().split()]\nmn = 999999999\nfor i in range(n):\n a, b = [int (num) for num in input().split()]\n mn = min(mn, a / b)\nprint(m * mn)\n ", "n, m = [int(i) for i in input().split()]\r\n\r\noffers = []\r\n\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n offers.append(a/b*m)\r\n\r\nprint(round(min(offers), 8))\r\n", "n, m = map(int, input().split())\r\nres = m * 100\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n res = min(res, m * a / b)\r\nprint(res)", "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\nmi = 105\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n mi = min(mi, a / b)\r\nans = mi * m\r\nprint(ans)", "q=[]\r\na,b = map(int,input().split())\r\nfor i in range(a):\r\n x,y = map(int,input().split())\r\n n = x/y\r\n m = n*b\r\n q.append(m)\r\n \r\nq.sort()\r\nprint(q[0])\r\n ", "n, m = map(int, input().split())\r\n\r\ncost = 10**10\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n cost = min(cost, a * m / b)\r\n\r\nprint(\"%.8f\" % cost)", "n, m = map(int, input().split())\r\ntotal = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n money = (a / b) * m\r\n total.append(money)\r\nprint(min(total))\r\n \r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nl = []\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n l.append(m / b * a)\r\nprint(min(l))", "n, m = [int(i) for i in input().split()]\r\ng = []\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n g.append(a/b)\r\nprint(m * min(g))", "from sys import stdin\r\n\r\nn, m = list(map(int, stdin.readline().split()))\r\nres = 10000\r\nfor _ in range(n):\r\n a, b = list(map(int, stdin.readline().split()))\r\n res = min((a*m)/b, res)\r\nprint(res)\r\n\r\n\r\n\r\n", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn,m=read_ints()\n\tfor i in range(n):\n\t\ta,b=read_ints()\n\t\tif i==0:\n\t\t\tret=m*a/b\n\t\telse:\n\t\t\tret=min(ret, m*a/b)\n\tprint(\"%.12f\" % ret)\n\nsolve()\n", "n, m = [int(i) for i in input().split()]\r\nmn = 10000000\r\nfor _ in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n mn = min((a/b)*m, mn)\r\nprint(mn)", "n, m=map(int, input().split())\r\na=[]\r\nfor i in range(n):\r\n z, x=map(int, input().split())\r\n a.append(z/x*m)\r\nprint(min(a))\r\n", "n, m = [int(i) for i in input().split()]\r\nk, l = [int(i) for i in input().split()]\r\nminimum = k / l\r\nfor i in range(n-1):\r\n k, l = [int(i) for i in input().split()]\r\n if k / l < minimum:\r\n minimum = k / l\r\nprint(minimum*m)", "n,m=[int(i) for i in input().split()]\r\nl=1000000\r\nfor j in range(n):\r\n a,b=[int(k) for k in input().split()]\r\n cost=(a/b)*m\r\n l=min(l,cost)\r\nprint(l)", "n, m = map(int, input().split())\r\nmin_price = 1000000\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if (a / b) * m < min_price:\r\n min_price = (a / b) * m\r\nprint(min_price)\r\n", "n, m = map(int, input().split())\r\n\r\na, b = map(int, input().split())\r\ncheap = a/b\r\n\r\nfor _ in range(n-1):\r\n a, b = map(int, input().split())\r\n cheap = min(cheap, a/b)\r\n\r\nprint(cheap*m)", "g = 1000000\r\na, b = map(int, input().split())\r\nfor i in range(a):\r\n c, d = map(int, input().split())\r\n if c / d < g:\r\n g = c / d\r\nprint(b * g)", "n,m = map(int, input().split())\nmini=100\nfor i in range(n):\n a,b = map(int, input().split())\n if a/b < mini:\n mini = a/b\nprint(mini * m) \n \n \n", "n, m = map(int, input().split())\r\nmy_list = []\r\ndef BestSupermarket():\r\n for i in range(n):\r\n a, b = map(int, input().split())\r\n v = (a/b)*m\r\n my_list.append(v)\r\nBestSupermarket()\r\nprint(min(my_list))\r\n ", "n, m = [int(i) for i in input().split()]\r\n\r\nprices = []\r\nfor i in range(n):\r\n a, b = [int(j) for j in input().split()]\r\n prices.append(a / b * m)\r\n\r\nprint(min(prices))\r\n\r\n", "n,m=map(int,input().split())\r\nminn=1000\r\nwhile n:\r\n n=n-1\r\n a,b=map(int,input().split())\r\n p=a/b\r\n minn=min(minn,p)\r\nprint(m*minn)", "def conv(x):\r\n a=list()\r\n for i in x :\r\n a.append(int(i))\r\n return a\r\na=conv(input().split())\r\nfor i in range(a[0]):\r\n arr=conv(input().split())\r\n x=arr[0]/arr[1]\r\n if i==0 :\r\n min=x\r\n continue\r\n if (min>x):\r\n min=x\r\nprint(a[1]*min)", "#from dust i have come dust i will be\n\nn,m=map(int,input().split())\n\nmn=1000000\nfor i in range(n):\n a,b=map(int,input().split())\n\n x=(a*m)/b\n mn=min(mn,x)\n\nprint(round(mn,10))\n\n", "k, m = input().split()\r\nm = int(m)\r\nn = []\r\nfor _ in range(int(k)):\r\n i = input().split()\r\n n.append((m * int(i[0])) / int(i[1]))\r\nprint(min(n))", "n, m = map(int, input().split())\r\nminimal = 99999999999\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n per_kg = a / b\r\n if per_kg < minimal:\r\n minimal = per_kg\r\nprint(minimal * m)", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n\ta,b=map(int,input().split())\r\n\tl.append((a*m)/b)\r\nprint(min(l))\r\n\t\r\n", "q=[int(w)for w in input().split()]\r\nt=[]\r\nfor e in range(q[0]):\r\n r=[int(w)for w in input().split()]\r\n t.append(r)\r\nfor y in range(len(t)):\r\n t[y]=t[y][0]/t[y][1]*q[1]\r\nprint(min(t))", "n, m = map(int, input().split())\r\nMin = 1000\r\nfor _ in range(n):\r\n a, b = map(int, input().split())\r\n Min = min(Min, a/b)\r\nprint(Min * m)", "a, b = map(int, input().split())\r\nc = 1111111\r\nfor i in range(0, a):\r\n d, f = map(int, input().split())\r\n if d / f * b < c:\r\n c = d / f * b\r\nprint(c)\r\n", "n, m = [int(x) for x in input().split()]\r\n\r\nsums = []\r\n\r\nfor _ in range(n):\r\n\ta, b = [int(x) for x in input().split()]; sums.append(a / b * m)\r\n\r\nprint(min(sums))", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-19 23:31:40\nLastEditTime: 2021-11-19 23:36:22\nDescription: Supermarket\nFilePath: CF919A.py\n'''\n\n\ndef func():\n n, m = map(int, input().strip().split())\n price = []\n for _ in range(n):\n a, b = map(int, input().strip().split())\n price.append(a / b)\n print(\"%.8f\" % (m * min(price)))\n\n\nif __name__ == '__main__':\n func()\n", "n, m = [int(i) for i in input().split()]\r\nprice = []\r\na = 0\r\nb = 0\r\np = 0\r\nminimum = float('inf')\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n p = a/b\r\n if p < minimum:\r\n minimum = p\r\nprint(minimum*m)\r\n \r\n \r\n", "from math import *\r\n\r\nn,m=map(int,input().split())\r\nmin=10000000\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if m*(a/b)<min:\r\n min=m*(a/b)\r\nprint(round(min,8))", "n,m=map(int,input().split())\r\nz=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n z+=[a/b]\r\n\r\nprint(min(z)*m)\r\n\r\n", "from collections import *\r\nfrom heapq import *\r\nfrom bisect import *\r\nfrom itertools import *\r\nfrom functools import *\r\nfrom math import *\r\nfrom string import *\r\nimport operator\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n rates = []\r\n for _ in range(n):\r\n a, b = map(int, input().split())\r\n rates.append(a / b)\r\n\r\n print(round(min(rates) * m, 8))\r\n\r\ndef main():\r\n tests = 1\r\n for _ in range(tests):\r\n solve()\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,m = map(int,input().split())\r\nl = []\r\nwhile(n):\r\n\ta,b = map(int,input().split())\r\n\tl.append((m*a)/b)\r\n\tn-=1\r\nprint(round(min(l),8))", "n, m = [int(i) for i in input().split()]\r\nmin_price = float('inf')\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n kilo = a/b\r\n if kilo<min_price:\r\n min_price = kilo\r\nprint(min_price*m)", "t= list(map(int, input().split()))\r\nl=[]\r\nfor i in range(t[0]):\r\n b= list(map(int, input().split()))\r\n a= b[0]/b[1]\r\n l.append(a)\r\nd= min(l)*t[1]\r\nprint('%.8f'%d)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nd=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n d.append(m*a/b)\r\nprint(min(d))", "(n, m) = map(int, input().split(' '))\n\ncomparison_price = []\n\nfor i in range(n):\n (a, b) = map(int, input().split(' '))\n average = a / b\n comparison_price.append(average)\n\nprint(min(comparison_price) * m)\n", "n,m = map(int,input().split())\r\nls = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n cost = (m * a) / b\r\n ls.append(cost)\r\nprint(min(ls))", "li = []\r\nn,m = map(int,input().split())\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n li.append(a/b)\r\nprint(round(m*min(li),6))\r\n", "def main():\n first_in = [int(i) for i in input().split(\" \")]\n num_supermarket = first_in[0]\n num_apple = first_in[1]\n\n prices = []\n for _ in range(0, num_supermarket):\n second_in = [int(i) for i in input().split(\" \")]\n prices.append(second_in[0] / second_in[1])\n\n lowest_price = min(prices)\n print(round(num_apple * lowest_price, 8))\n\n\nif __name__ == '__main__':\n main()\n\n \t \t\t\t \t\t\t\t \t\t\t\t\t \t\t \t", "a, b = map(int, input().split())\r\nmn = 10000\r\nfor i in range(a):\r\n n, k = map(int, input().split())\r\n s = n / k\r\n if s < mn:\r\n mn = s\r\n \r\nprint(mn * b)\r\n \r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(n):\r\n a,b=map(int,input().split())\r\n l.append(a*m/b)\r\nprint(round(min(l),8))", "n, m = input().split()\nn, m = int(n), int(m)\nmi = 0\nfor i in range(n):\n a, b = input().split()\n a, b = int(a), int(b)\n if mi == 0 or a / b * m < mi:\n mi = a / b * m\nprint(mi)", "n, m = map(int, input().split())\r\nans = 100\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n ans = min(ans, a/b)\r\nprint(ans*m)\r\n", "n,m=map(int,input().split(\" \"))\r\nans=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split(\" \"))\r\n ans.append((m*a)/b)\r\nprint(min(ans))", "n, m = map(int, input().split())\r\nar = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n ar.append(a / b)\r\nprint(min(ar) * m)\r\n", "n,m = map(int,input().strip().split())\r\nmini = pow(10,5)\r\nwhile(n):\r\n a,b = map(int,input().strip().split())\r\n if (a/b)*m <mini:\r\n mini = (a/b)*m\r\n n-=1\r\nprint(\"{0:.8f}\".format(mini))", "n,m=map(int,input().split())\r\nlst=[]\r\nfor j in range(n):\r\n\ta,b=map(int,input().split())\r\n\tlst.append(a/b)\r\nprint(min(lst)*m)", "n , m = map(int,input().split())\r\nlst = []\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n lst.append((a/b)*m)\r\nprint(min(lst))\r\n", "[a, b] = map(int, input().split())\npricelist = []\nfor i in range(a):\n [numapples, price] = map(int, input().split())\n pricelist.append(numapples/price)\nleastprice = min(pricelist)\nprint(b * leastprice)", "n, m = [int(s) for s in input().split()]\r\nminPrice = 0\r\nfor i in range(n):\r\n a, b = [int(s) for s in input().split()]\r\n if minPrice == 0:\r\n minPrice = a / b\r\n elif a / b < minPrice:\r\n minPrice = a / b\r\nprint(minPrice * m)", "n, m = [int(i) for i in input().split()]\r\nall = []\r\nminimum = None\r\n\r\nfor i in range(n):\r\n a, b = [int(i) for i in input().split()]\r\n all.append([a, b])\r\n if minimum == None:\r\n minimum = a/b\r\n elif a/b < minimum:\r\n minimum = a/b\r\n\r\n\r\nprint(round(minimum*m, 8))\r\n#print((m*all[n-1][0])/all[n-1][1])\r\n#print(round(m*(all[n-1][0]/all[n-1][1]), 8))\r\n", "from decimal import Decimal\r\n\r\nn, m = [int(x) for x in input().split()]\r\nmn = Decimal(101)\r\n\r\nfor _ in range(n):\r\n a, b = [int(x) for x in input().split()]\r\n q = Decimal(a / b)\r\n if q < mn:\r\n mn = q\r\n\r\nprint(mn * m)", "import decimal\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef func(a):\r\n return a[0] / a[1]\r\n\r\n\r\nn, m = map(int, input().split())\r\nprint(min([func(list(map(decimal.Decimal, input().split()))) for n in range(n)]) * m)" ]

[ "pres = [\"Washington\",\r\n\"Adams\",\r\n\"Jefferson\",\r\n\"Madison\",\r\n\"Monroe\",\r\n\"Adams\",\r\n\"Jackson\",\r\n\"Van Buren\",\r\n\"Harrison\",\r\n\"Tyler\",\r\n\"Polk\",\r\n\"Taylor\",\r\n\"Fillmore\",\r\n\"Pierce\",\r\n\"Buchanan\",\r\n\"Lincoln\",\r\n\"Johnson\",\r\n\"Grant\",\r\n\"Hayes\",\r\n\"Garfield\",\r\n\"Arthur\",\r\n\"Cleveland\",\r\n\"Harrison\",\r\n\"Cleveland\",\r\n\"McKinley\",\r\n\"Roosevelt\",\r\n\"Taft\",\r\n\"Wilson\",\r\n\"Harding\",\r\n\"Coolidge\",\r\n\"Hoover\",\r\n\"Roosevelt\",\r\n\"Truman\",\r\n\"Eisenhower\",\r\n\"Kennedy\",\r\n\"Johnson\",\r\n\"Nixon\",\r\n\"Ford\",\r\n\"Carter\",\r\n\"Reagan\",\r\n\"Bush\",\r\n\"Clinton\",\r\n\"Bush\",\r\n\"Obama\",\r\n\"Trump\",\r\n\"Biden\"]\r\n\r\nprint(pres[int(input())-1])", "a = int(input())\r\nlst = 'Washington,Adams,Jefferson,Madison,Monroe,Adams,Jackson,Van Buren,Harrison,Tyler,Polk,Taylor,Fillmore,Pierce,Buchanan,Lincoln,Johnson,Grant,Hayes,Garfield,Arthur,Cleveland,Harrison,Cleveland,McKinley,Roosevelt,Taft,Wilson,Harding,Coolidge,Hoover,Roosevelt,Truman,Eisenhower,Kennedy,Johnson,Nixon,Ford,Carter,Reagan'.split(',')\r\nprint(lst[a - 1])", "solution = {\r\n 1: 'Washington',\r\n 2: 'Adams',\r\n 3: 'Jefferson',\r\n 4: 'Madison',\r\n 5: 'Monroe',\r\n 6: 'Adams',\r\n 7: 'Jackson',\r\n 8: 'Van Buren',\r\n 9: 'Harrison',\r\n 10: 'Tyler',\r\n 11: 'Polk',\r\n 12: 'Taylor',\r\n 13: 'Fillmore',\r\n 14: 'Pierce',\r\n 15: 'Buchanan',\r\n 16: 'Lincoln',\r\n 17: 'Johnson',\r\n 18: 'Grant',\r\n 19: 'Hayes',\r\n 20: 'Garfield',\r\n 21: 'Arthur',\r\n 22: 'Cleveland',\r\n 23: 'Harrison',\r\n 24: 'Cleveland',\r\n 25: 'McKinley',\r\n 26: 'Roosevelt',\r\n 27: 'Taft',\r\n 28: 'Wilson',\r\n 29: 'Harding',\r\n 30: 'Coolidge',\r\n 31: 'Hoover',\r\n 32: 'Roosevelt',\r\n 33: 'Truman',\r\n 34: 'Eisenhower',\r\n 35: 'Kennedy',\r\n 36: 'Johnson',\r\n 37: 'Nixon',\r\n 38: 'Ford',\r\n 39: 'Carter',\r\n 40: 'Reagan',\r\n}\r\n\r\nprint(solution[int(input())])\r\n", "lin = 'George Washington,John Adams,Thomas Jefferson,James Madison,James Monroe,John Quincy Adams,Andrew Jackson,Martin Van Buren,William Henry Harrison,John Tyler,James K. Polk,Zachary Taylor,Millard Fillmore,Franklin Pierce,James Buchanan,Abraham Lincoln,Andrew Johnson,Ulysses S. Grant,Rutherford B. Hayes,James A. Garfield,Chester A. Arthur,Grover Cleveland,Benjamin Harrison,Grover Cleveland,William McKinley,Theodore Roosevelt,William Howard Taft,Woodrow Wilson,Warren G. Harding,Calvin Coolidge,Herbert Hoover,Franklin D. Roosevelt,Harry S. Truman,Dwight D. Eisenhower,John F. Kennedy,Lyndon B. Johnson,Richard Nixon,Gerald Ford,Jimmy Carter,Ronald Reagan,George H. W. Bush,Bill Clinton,George W. Bush,Barack Obama,Donald Trump,Joe Biden'\r\n\r\nnomes = lin.split(',')\r\n\r\nwhile True:\r\n try:\r\n n = int(input())\r\n ans = nomes[n-1].split()[-1]\r\n \r\n if ans == 'Buren':\r\n print('Van Buren')\r\n else:\r\n print(ans)\r\n except:\r\n break", "a=[\"\",\"Washington\",\"Adams\",\"Jefferson\",\"Madison\",\"Monroe\",\"Adams\",\"Jackson\",\"Van Buren\",\"Harrison\",\"Tyler\",\"Polk\",\"Taylor\",\"Fillmore\",\"Pierce\",\"Buchanan\",\"Lincoln\",\"Johnson\",\"Grant\",\"Hayes\",\"Garfield\",\"Arthur\",\"Cleveland\",\"Harrison\",\"Cleveland\",\"McKinley\",\"Roosevelt\",\"Taft\",\"Wilson\",\"Harding\",\"Coolidge\",\"Hoover\",\"Roosevelt\",\"Truman\",\"Eisenhower\",\"Kennedy\",\"Johnson\",\"Nixon\",\"Ford\",\"Carter\",\"Reagan\"]\r\nprint(a[int(input())])", "# from collections import defaultdict,deque\r\n# from sys import stdin\r\n# import itertools\r\n# import bisect\r\n# from math import sqrt,ceil,floor,gcd,sin,radians\r\n# from sortedcontainers import SortedList\r\n\r\n\r\ndef func(put,mapping,unpack):\r\n presidents = [\"Washington\", \"Adams\", \"Jefferson\" , \"Madison\" , \"Monroe\" , \"Adams\" , \"Jackson\" , \"Van Buren\", \"Harrison\" , \"Tyler\" , \"Polk\" , \"Taylor\" , \"Fillmore\" , \"Pierce\", \"Buchanan\" , \"Lincoln\", \"Johnson\" , \"Grant\" , \"Hayes\" , \"Garfield\" , \"Arthur\" , \"Cleveland\", \"Harrison\" , \"Cleveland\" , \"McKinley\" , \"Roosevelt\" , \"Taft\" , \"Wilson\" , \"Harding\" , \"Coolidge\", \"Hoover\" , \"Roosevelt\" , \"Truman\" , \"Eisenhower\" , \"Kennedy\" , \"Johnson\" , \"Nixon\" , \"Ford\", \"Carter\" , \"Reagan\" , \"Bush\" , \"Clinton\"\r\n ]\r\n print(presidents[put(int)-1])\r\n\r\ndef init(TestCases=True):\r\n put = lambda s: s(input().strip())\r\n mapping = lambda s: list(map(s,input().split()))\r\n unpack = lambda s: map(s,input().split())\r\n for _ in range(int(input()) if TestCases else 1):\r\n func(put,mapping,unpack)\r\n\r\nif __name__ == '__main__':\r\n init(False)", "s=\"\"\"George Washington (from 30/04/1789 to 04/03/1797) \r\nJohn Adams (from 04/03/1797 to 04/03/1801)\r\nThomas Jefferson (from 04/03/1801 to 04/03/1809)\r\nJames Madison (from 04/03/1809 to 04/03/1817)\r\nJames Monroe (from 04/03/1817 to 04/03/1825)\r\nJohn Adams (from 04/03/1825 to 04/03/1829)\r\nAndrew Jackson (from 04/03/1829 to 04/03/1837)\r\nMartin Buren (from 04/03/1837 to 04/03/1841)\r\nWilliam Harrison (from 04/03/1841 to 04/04/1841)\r\nJohn Tyler (from 04/04/1841 to 04/03/1845)\r\nJames Polk (from 04/03/1845 to 04/03/1849)\r\nZachary Taylor (from 04/03/1849 to 09/07/1850)\r\nMillard Fillmore (from 09/07/1850 to 04/03/1853)\r\nFranklin Pierce (from 04/03/1853 to 04/03/1857)\r\nJames Buchanan (from 04/03/1857 to 04/03/1861)\r\nAbraham Lincoln (from 04/03/1861 to 15/04/1865)\r\nAndrew Johnson (from 15/04/1865 to 04/03/1869)\r\nUlysses Grant (from 04/03/1869 to 04/03/1877)\r\nRutherford Hayes (from 04/03/1877 to 04/03/1881)\r\nJames Garfield (from 04/03/1881 to 19/09/1881)\r\nChester Arthur (from 19/09/1881 to 04/03/1885)\r\nGrover Cleveland (from 04/03/1885 to 04/03/1889)\r\nBenjamin Harrison (from 04/03/1889 to 04/03/1893)\r\nGrover Cleveland (from 04/03/1893 to 04/03/1897)\r\nWilliam McKinley (from 04/03/1897 to 14/09/1901)\r\nTheodore Roosevelt (from 14/09/1901 to 04/03/1909)\r\nWilliam Taft (from 04/03/1909 to 04/03/1913)\r\nWoodrow Wilson (from 04/03/1913 to 04/03/1921)\r\nWarren Harding (from 04/03/1921 to 02/08/1923)\r\nCalvin Coolidge (from 02/08/1923 to 04/03/1929)\r\nHerbert Hoover (from 04/03/1929 to 04/03/1933)\r\nFranklin Roosevelt (from 04/03/1933 to 12/04/1945)\r\nHarry Truman (from 12/04/1945 to 20/01/1953)\r\nDwight Eisenhower (from 20/01/1953 to 20/01/1961)\r\nJohn Kennedy (from 20/01/1961 to 22/11/1963)\r\nLyndon Johnson (from 22/11/1963 to 20/01/1969)\r\nRichard Nixon (from 20/01/1969 to 09/08/1974)\r\nGerald Ford (from 09/08/1974 to 20/01/1977)\r\nJimmy Carter (from 20/01/1977 to 20/01/1981)\r\nRonald Reagan (from 20/01/1981 to 20/01/1989)\r\nGeorge Bush (from 20/01/1989 to 20/01/1993)\r\nBill Clinton (from 20/01/1993 to 20/01/2001)\r\nGeorge Bush (from 20/01/2001 to 20/01/2009)\r\nBarack Obama (from 20/01/2009 to 20/01/2017)\r\nDonald Trump (from 20/01/2017 to 20/01/2021)\r\nJoe Biden (from 20/01/2021 to present)\"\"\"\r\nl=list(s.split())\r\nn=int(input())\r\nif n==8:\r\n print(\"Van Buren\")\r\nelse:\r\n print(l[1+6*(n-1)])", "a = 'Washington,Adams,Jefferson,Madison,Monroe,Adams,Jackson,Van Buren,Harrison,Tyler,Polk,Taylor,Fillmore,Pierce,Buchanan,Lincoln,Johnson,Grant,Hayes,Garfield,Arthur,Cleveland,Harrison,Cleveland,McKinley,Roosevelt,Taft,Wilson,Harding,Coolidge,Hoover,Roosevelt,Truman,Eisenhower,Kennedy,Johnson,Nixon,Ford,Carter,Reagan,Bush,Clinton'.split(',')\r\nprint(a[int(input())-1])", "n=int(input())\r\nif n==1:\r\n print('Washington')\r\nelif n==2:\r\n print('Adams')\r\nelif n==3:\r\n print('Jefferson')\r\nelif n==4:\r\n print('Madison')\r\nelif n==5:\r\n print('Monroe')\r\nelif n==6:\r\n print('Adams')\r\nelif n==7:\r\n print('Jackson')\r\nelif n==8:\r\n print('Van Buren')\r\nelif n==9:\r\n print('Harrison')\r\nelif n==10:\r\n print('Tyler')\r\nelif n==11:\r\n print('Polk')\r\nelif n==12:\r\n print('Taylor')\r\nelif n==13:\r\n print('Fillmore')\r\nelif n==14:\r\n print('Pierce')\r\nelif n==15:\r\n print('Buchanan')\r\nelif n==16:\r\n print('Lincoln')\r\nelif n==17:\r\n print('Johnson')\r\nelif n==18:\r\n print('Grant')\r\nelif n==19:\r\n print('Hayes')\r\nelif n==20:\r\n print('Garfield')\r\nelif n==21:\r\n print('Arthur')\r\nelif n==22:\r\n print('Cleveland')\r\nelif n==23:\r\n print('Harrison')\r\nelif n==24:\r\n print('Cleveland')\r\nelif n==25:\r\n print('McKinley')\r\nelif n==26:\r\n print('Roosevelt')\r\nelif n==27:\r\n print('Taft')\r\nelif n==28:\r\n print('Wilson')\r\nelif n==29:\r\n print('Harding')\r\nelif n==30:\r\n print('Coolidge')\r\nelif n==31:\r\n print('Hoover')\r\nelif n==32:\r\n print('Roosevelt')\r\nelif n==33:\r\n print('Truman')\r\nelif n==34:\r\n print('Eisenhower')\r\nelif n==35:\r\n print('Kennedy')\r\nelif n==36:\r\n print('Johnson')\r\nelif n==37:\r\n print('Nixon')\r\nelif n==38:\r\n print('Ford')\r\nelif n==39:\r\n print('Carter')\r\nelse:\r\n print('Reagan')", "#author: riyan\r\n\r\nnames = [ \r\n 'Washington','Adams','Jefferson','Madison','Monroe',\r\n 'Adams','Jackson','Van Buren','Harrison','Tyler',\r\n 'Polk','Taylor','Fillmore','Pierce','Buchanan',\r\n 'Lincoln','Johnson','Grant','Hayes','Garfield',\r\n 'Arthur','Cleveland','Harrison','Cleveland','McKinley',\r\n 'Roosevelt','Taft','Wilson','Harding','Coolidge',\r\n 'Hoover','Roosevelt','Truman','Eisenhower','Kennedy',\r\n 'Johnson','Nixon','Ford','Carter','Reagan'\r\n ]\r\n\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n print(names[n - 1])" ]

[ "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef f(x1, y1, x2, y2, x3, y3):\r\n if x1 == x2 == x3:\r\n return True\r\n if y1 == y2 == y3:\r\n return True\r\n if (x2 - x1) * (y3 - y2) == (x3 - x2) * (y2 - y1):\r\n return True\r\n else:\r\n return False\r\n\r\nn = int(input())\r\nxy = [list(map(int, input().split())) for _ in range(n)]\r\nif n < 5:\r\n ans = \"YES\"\r\nelse:\r\n x1, y1 = xy[0]\r\n x2, y2 = xy[1]\r\n x3, y3 = xy[2]\r\n if f(x1, y1, x2, y2, x3, y3):\r\n c = []\r\n for i in range(3, n):\r\n xi, yi = xy[i]\r\n if not f(x1, y1, x2, y2, xi, yi):\r\n c.append((xi, yi))\r\n if len(c) < 3:\r\n ans = \"YES\"\r\n else:\r\n x1, y1 = c[0]\r\n x2, y2 = c[1]\r\n ans = \"YES\"\r\n for i in range(2, len(c)):\r\n xi, yi = c[i]\r\n if not f(x1, y1, x2, y2, xi, yi):\r\n ans = \"NO\"\r\n break\r\n else:\r\n s = [0] * 3\r\n c = []\r\n for i in range(3, n):\r\n xi, yi = xy[i]\r\n if f(x1, y1, x2, y2, xi, yi):\r\n s[0] = 1\r\n elif f(x1, y1, x3, y3, xi, yi):\r\n s[1] = 1\r\n elif f(x2, y2, x3, y3, xi, yi):\r\n s[2] = 1\r\n else:\r\n c.append((xi, yi))\r\n if not c:\r\n ans = \"YES\" if sum(s) < 3 else \"NO\"\r\n else:\r\n ans = \"YES\"\r\n if sum(s) == 0:\r\n x4, y4 = c[0]\r\n x5, y5 = c[1]\r\n if f(x1, y1, x4, y4, x5, y5):\r\n x0, y0 = x1, y1\r\n elif f(x2, y2, x4, y4, x5, y5):\r\n x0, y0 = x2, y2\r\n elif f(x3, y3, x4, y4, x5, y5):\r\n x0, y0 = x3, y3\r\n else:\r\n ans = \"NO\"\r\n if ans == \"YES\":\r\n for i in range(2, len(c)):\r\n xi, yi = c[i]\r\n if not f(xi, yi, x4, y4, x5, y5):\r\n ans = \"NO\"\r\n break\r\n elif sum(s) == 1:\r\n ans = \"YES\"\r\n if s[0] == 1:\r\n x0, y0 = x3, y3\r\n elif s[1] == 1:\r\n x0, y0 = x2, y2\r\n else:\r\n x0, y0 = x1, y1\r\n x4, y4 = c[0]\r\n for i in range(1, len(c)):\r\n xi, yi = c[i]\r\n if not f(xi, yi, x4, y4, x0, y0):\r\n ans = \"NO\"\r\n break\r\n else:\r\n ans = \"NO\"\r\nprint(ans)", "def main():\r\n n = int(input())\r\n points = []\r\n\r\n for i in range(n):\r\n x, y = map(int, input().split())\r\n points.append((x, y))\r\n\r\n \r\n if (n < 5):\r\n print(\"YES\")\r\n\r\n else:\r\n if test(points[0], points[1], points) or test(points[0], points[2], points) or test(points[1], points[2], points):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\n\r\n\r\n\r\ndef test(p, q, pts):\r\n temp = []\r\n for i in pts:\r\n if((p[1] - i[1]) * (p[0] - q[0]) != (p[1] - q[1]) * (p[0] - i[0])):\r\n temp.append(i)\r\n\r\n if (len(temp) < 3):\r\n return True\r\n\r\n p = temp[0]\r\n q = temp[1]\r\n for i in temp:\r\n if((p[1] - i[1]) * (p[0] - q[0]) != (p[1] - q[1]) * (p[0] - i[0])):\r\n return False\r\n\r\n return True\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "from math import gcd\r\nimport sys\r\n\r\n#Library Info(ACL for Python/Pypy) -> https://github.com/not522/ac-library-python\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().rstrip()\r\n\r\n\r\nDXY = [(0, -1), (1, 0), (0, 1), (-1, 0)] # L,D,R,Uの順番\r\n\r\ndef on_one_line(Points):\r\n n = len(Points)\r\n s = set([])\r\n for i in range(1,n):\r\n x,y = Points[i][0] - Points[0][0],Points[i][1] - Points[0][1]\r\n g = gcd(x,y)\r\n x //= g\r\n y //= g \r\n if (x < 0):\r\n x *= -1;y *= -1\r\n if (x == 0):\r\n y = abs(y)\r\n s.add((x,y))\r\n return len(s) == 1\r\n\r\ndef main():\r\n n = int(input())\r\n Ps = [tuple(map(int, input().split())) for i in range(n)]\r\n if n <= 2:\r\n print(\"YES\")\r\n return 0\r\n if on_one_line(Ps):\r\n print(\"YES\")\r\n return 0\r\n\r\n p,q = Ps[1][0] - Ps[0][0],Ps[1][1] - Ps[0][1]\r\n g = gcd(p,q)\r\n p //= g;q //= g\r\n if (p < 0):p *= -1;q *= -1\r\n elif (p == 0):q = abs(q)\r\n\r\n not_same = []\r\n for i in range(2,n):\r\n x,y = Ps[i][0] - Ps[0][0],Ps[i][1] - Ps[0][1]\r\n x,y = x//gcd(x,y),y//gcd(x,y)\r\n if (x < 0):x *= -1;y *= -1\r\n if (x == 0):y = abs(y)\r\n if (x,y) != (p,q):\r\n not_same.append(Ps[i])\r\n\r\n if len(not_same) <= 1:\r\n print(\"YES\")\r\n return 0\r\n \r\n if on_one_line(not_same):\r\n print(\"YES\")\r\n return 0\r\n \r\n p,q = not_same[0][0] - Ps[0][0],not_same[0][1] - Ps[0][1]\r\n P,Q = not_same[0]\r\n g = gcd(p,q)\r\n p //= g;q //= g\r\n if (p < 0):p *= -1;q *= -1\r\n elif (p == 0):q = abs(q) \r\n not_same = []\r\n\r\n for i in range(n):\r\n x,y = Ps[i][0] - Ps[0][0],Ps[i][1] - Ps[0][1]\r\n if (x == 0 and y == 0):continue\r\n x,y = x//gcd(x,y),y//gcd(x,y)\r\n if (x < 0):x *= -1;y *= -1\r\n if (x == 0):y = abs(y)\r\n if (x,y) != (p,q):\r\n not_same.append(Ps[i])\r\n\r\n if len(not_same) <= 1:\r\n print(\"YES\")\r\n return 0\r\n \r\n if on_one_line(not_same):\r\n print(\"YES\")\r\n return 0 \r\n \r\n p,q = P - Ps[1][0],Q - Ps[1][1]\r\n g = gcd(p,q)\r\n p //= g;q //= g\r\n if (p < 0):p *= -1;q *= -1\r\n elif (p == 0):q = abs(q) \r\n\r\n not_same = []\r\n for i in range(n):\r\n x,y = Ps[i][0] - Ps[1][0],Ps[i][1] - Ps[1][1]\r\n if (x == 0 and y == 0):continue\r\n x,y = x//gcd(x,y),y//gcd(x,y)\r\n if (x < 0):x *= -1;y *= -1\r\n if (x == 0):y = abs(y)\r\n if (x,y) != (p,q):\r\n not_same.append(Ps[i])\r\n\r\n if len(not_same) <= 1:\r\n print(\"YES\")\r\n return 0\r\n \r\n if on_one_line(not_same):\r\n print(\"YES\")\r\n return 0 \r\n\r\n print(\"NO\")\r\n return 0\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n", "# Problem: D. Pair Of Lines\r\n# Contest: Codeforces - Educational Codeforces Round 41 (Rated for Div. 2)\r\n# URL: https://codeforces.com/contest/961/problem/D\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n\r\nimport sys\r\nimport bisect\r\nimport random\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\r\nfrom types import GeneratorType\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\r\nMOD = 10 ** 9 + 7\r\nPROBLEM = \"\"\"https://codeforces.com/contest/961/problem/D\r\n\r\n输入 n(≤1e5) 和 n 个点 (xi,yi)，范围在 [-1e9,1e9]，所有点都是不同的。\r\n你能否画至多两条直线，覆盖所有点？输出 YES 或 NO。\r\n输入\r\n5\r\n0 0\r\n0 1\r\n1 1\r\n1 -1\r\n2 2\r\n输出 YES\r\n\r\n输入\r\n5\r\n0 0\r\n1 0\r\n2 1\r\n1 1\r\n2 3\r\n输出 NO\r\n\"\"\"\r\n\r\n\"\"\"\r\nhttps://codeforces.com/contest/961/submission/190438603\r\n\r\n提示 1：如果可以画，那么任意三点中必然有两个点在所画直线上。\r\n\r\n提示 2：枚举前三个点中的两个点，确定一条直线，然后看其余点是否在一条直线上。\r\n求导:\r\n (y1-y2)/(x1-x2) == (y1-y3)/(x1-x3)\r\n (y1-y2)(x1-x3) == (y1-y3)(x1-x2)\r\n\"\"\"\r\n\r\n\r\n# ms\r\ndef solve():\r\n n, = RI()\r\n ps = []\r\n for _ in range(n):\r\n ps.append(RILST())\r\n if n <= 4:\r\n return print('YES')\r\n\r\n def f(ps):\r\n (x1, y1), (x2, y2) = ps[:2]\r\n other = []\r\n for x3, y3 in ps[2:]:\r\n if (y1 - y2) * (x1 - x3) != (y1 - y3) * (x1 - x2):\r\n if len(other) < 2:\r\n other.append((x3, y3))\r\n else:\r\n (a1, b1), (a2, b2) = other\r\n if (b1 - b2) * (a1 - x3) != (b1 - y3) * (a1 - a2):\r\n return False\r\n return True\r\n\r\n if f(ps):\r\n return print('YES')\r\n ps[:3] = ps[1:3] + ps[:1]\r\n if f(ps):\r\n return print('YES')\r\n ps[:3] = ps[1:3] + ps[:1]\r\n if f(ps):\r\n return print('YES')\r\n print('NO')\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "n = int(input())\r\n\r\nL = []\r\n\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n L.append(a)\r\n\r\ndef linje(p1,p2,p3):\r\n return 0 ==((p2[0]-p1[0])*(p3[1]-p2[1])-(p2[1]-p1[1])*(p3[0]-p2[0]))\r\n\r\ndef P(p1,p2):\r\n global L\r\n l = []\r\n for p in L:\r\n if not linje(p1,p2,p):\r\n l.append(p)\r\n if len(l) > 2:\r\n p1 = l[0]\r\n p2 = l[1]\r\n for p in l:\r\n if not linje(p1,p2,p):\r\n return False\r\n return True\r\nif n <= 4:\r\n print(\"YES\")\r\nelif (P(L[0],L[1]) or P(L[0],L[2])) or P(L[1],L[2]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "n = int(input())\r\nif n <= 4:\r\n print(\"YES\")\r\n exit()\r\n\r\nA = [None]*n\r\n\r\nfor i in range(n):\r\n A[i] = list(map(int,input().split()))\r\n\r\ndef is_colinear(a1,a2,a3):\r\n if a1 == a2 or a2 == a3 or a1 == a3:\r\n return True\r\n\r\n x1,y1 = a1\r\n x2,y2 = a2\r\n x3,y3 = a3\r\n\r\n if x1 == x2 or x1 == x3 or x2 == x3:\r\n return x1 == x2 == x3\r\n if y1 == y2 or y1 == y3 or y2 == y3:\r\n return y1 == y2 == y3\r\n return (y2 - y1) * (x3 - x1) == (y3 - y1) * (x2 - x1)\r\n\r\nX,Y,Z = A[0],A[1],A[2]\r\n\r\ndef good(X,Y):\r\n # are X,Y on the same line?\r\n bad = []\r\n for i in range(n):\r\n if not is_colinear(X,Y,A[i]):\r\n bad.append(A[i])\r\n\r\n if len(bad) <= 2:\r\n return True\r\n\r\n U,V = bad[0],bad[1]\r\n for i in range(len(bad)):\r\n if not is_colinear(U,V,bad[i]):\r\n return False\r\n return True\r\n\r\nif good(X,Y) or good(Y,Z) or good(X,Z):\r\n print(\"YES\")\r\n exit()\r\n\r\nprint(\"NO\")\r\nexit()\r\n\r\n\r\n\r\n \r\n", "def collinear(a, b, c):\n return a[0]*(b[1] - c[1]) + b[0]*(c[1] - a[1]) + c[0]*(a[1] - b[1])\n \ndef check(a, pt1, pt2):\n tmp = []\n for x in a:\n if collinear(a[pt1], x, a[pt2]) != 0:\n tmp.append(x)\n if len(tmp) < 3:\n return True\n x = tmp[0]\n y = tmp[1]\n for z in tmp:\n if collinear(x, z, y) != 0:\n return False\n return True;\n \nn = int(input())\nok = False\na = []\nfor i in range(n):\n a.append(list(map(int, input().split())))\nif (n < 5) or (check(a, 0, 1)) or (check(a, 0, 2)) or (check(a, 1, 2)):\n ok = True\nif ok == True:\n print('YES')\nelse:\n print('NO')\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\nn=int(input())\r\nif n<=3:\r\n print('YES')\r\n exit()\r\nx=[[0,0] for i in range(n)]\r\nfor i in range(n):\r\n x[i][0],x[i][1]=map(int,input().split())\r\ndef check(a,b):\r\n ans=0\r\n remove=2\r\n remain=[]\r\n xx=x[0:a]+x[a+1:b]+x[b+1:]\r\n x1,x2,y1,y2=x[a][0],x[b][0],x[a][1],x[b][1]\r\n for i in range(n-2):\r\n if (y2-y1)*(xx[i][0]-x1)==(xx[i][1]-y1)*(x2-x1):\r\n remove+=1\r\n else:\r\n remain.append([xx[i][0],xx[i][1]])\r\n if remove>=n-2:\r\n return ans\r\n x1,x2,y1,y2=remain[0][0],remain[1][0],remain[0][1],remain[1][1]\r\n for i in range(2,len(remain)):\r\n if (y2-y1)*(remain[i][0]-x1)!=(remain[i][1]-y1)*(x2-x1):\r\n ans=1\r\n break\r\n return ans\r\nif check(0,1)==1 and check(1,2)==1 and check(0,2)==1:\r\n print('NO')\r\nelse:\r\n print('YES')", "# https://codeforces.com/problemset/problem/961/D\r\n\r\ndef is_linear(A, B, C):\r\n return (B[0] - A[0]) * (C[1] - A[1]) == (C[0] - A[0]) * (B[1] - A[1])\r\n \r\ndef is_line(pos):\r\n if len(pos) <= 2:\r\n return True\r\n \r\n A, B = P[pos[0]], P[pos[1]] \r\n \r\n for p in pos[2:]:\r\n if is_linear(A, B, P[p]) == False:\r\n return False\r\n return True\r\n\r\ndef check(A, B, used):\r\n for i, p in enumerate(P):\r\n if is_linear(A, B, p) == True:\r\n used[i] = 1\r\n\r\ndef refresh():\r\n for i in range(n):\r\n used[i] = 0 \r\n \r\nn = int(input())\r\nP = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nif n <= 3:\r\n print(\"YES\")\r\nelse:\r\n used = [0] * n\r\n flg = \"NO\"\r\n \r\n for i in range(3):\r\n A, B = P[i], P[(i+1)%3] \r\n check(A, B, used)\r\n \r\n pos = [i for i, x in enumerate(used) if x==0]\r\n \r\n if is_line(pos) == True:\r\n flg = \"YES\"\r\n #print(A, B)\r\n \r\n refresh()\r\n \r\n print(flg) ", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nclass vector2:\r\n def __init__(self, x, y):\r\n self.x = x\r\n self.y = y\r\n def __sub__(self, other):\r\n return vector2(self.x - other.x, self.y - other.y)\r\n def __mul__(self, other):\r\n return self.x * other.y - self.y * other.x\r\n\r\ndef oneline(a, b, c):\r\n x, y = b - a, c - a\r\n return x * y == 0\r\n\r\ndef oneline2(a):\r\n if len(a) <= 2:\r\n return True\r\n for i in range(2, len(a)):\r\n if not oneline(a[0], a[1], a[i]):\r\n return False\r\n return True\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append(vector2(x, y))\r\nif n <= 3:\r\n print('YES')\r\n exit()\r\n\r\nb = []\r\nfor i in range(2, n):\r\n if not oneline(a[0], a[1], a[i]):\r\n b.append(a[i])\r\nif not b or oneline2(b):\r\n print('YES')\r\n exit()\r\n\r\np = b[0]\r\n\r\nb = []\r\nfor i in range(n):\r\n if not oneline(a[0], p, a[i]):\r\n b.append(a[i])\r\nif not b or oneline2(b):\r\n print('YES')\r\n exit()\r\n\r\nb = []\r\nfor i in range(n):\r\n if not oneline(a[1], p, a[i]):\r\n b.append(a[i])\r\nif not b or oneline2(b):\r\n print('YES')\r\n exit()\r\n\r\nprint('NO')", "import sys\r\nfrom array import array\r\nfrom math import gcd\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\ninp = 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 = 2 ** 31 - 1, 2 ** 63 - 1\r\nout, tests = [], 1\r\n\r\n\r\nclass Point:\r\n def add(self, p1, p2, dist=1):\r\n return [p1[0] + p2[0] * dist, p1[1] + p2[1] * dist]\r\n\r\n def sub(self, p1, p2):\r\n return [p2[0] - p1[0], p2[1] - p1[1]]\r\n\r\n # dot==0 if v1 perpendicular\r\n def dot_mul(self, p1, p2):\r\n return p1[0] * p2[0] + p1[1] * p2[1]\r\n\r\n def vecs_ang2(self, p1, p2):\r\n '''measure angle in counter clockwise order'''\r\n v1 = self.cross_mul(p1, p2)\r\n v2 = (p1[0] ** 2 + p1[1] ** 2) ** .5 * (p2[0] ** 2 + p2[1] ** 2) ** .5\r\n return degrees(asin(v1 / v2)) % 360\r\n\r\n # cross==0 if <v1v2=0 elif cross<0 then right perpendicular else left perpendicular\r\n def cross_mul(self, p1, p2):\r\n return p1[0] * p2[1] - p2[0] * p1[1]\r\n\r\n def unit(self, p1, p2, dist):\r\n return [(p2[0] - p1[0]) / dist, (p2[1] - p1[1]) / dist]\r\n\r\n def unit_gcd(self, p1, p2):\r\n vec = [(p2[0] - p1[0]), (p2[1] - p1[1])]\r\n g = abs(gcd(vec[0], vec[1]))\r\n return [vec[0] // g, vec[1] // g]\r\n\r\n def collinear(self, p1, p2, p3):\r\n return abs(self.cross_mul(self.sub(p1, p2), self.sub(p1, p3)))\r\n\r\n def in_ray(self, p1, p2, p3):\r\n return self.collinear(p1, p2, p3) and self.dot_mul(self.sub(p1, p2), self.sub(p1, p3)) >= 0\r\n\r\n def in_segment(self, p1, p2, p3):\r\n return self.in_ray(p1, p2, p3) or self.in_ray(p2, p1, p3)\r\n\r\n def dist_to_line(self, p1, p2, p3):\r\n return abs(self.cross_mul(self.sub(p1, p2), self.sub(p1, p3)) / (dist2d([0, 0], self.sub(p1, p2))))\r\n\r\n def vec_slop(self, p):\r\n return (360 + degrees(atan2(p[1], p[0]))) % 360\r\n\r\n def slop(self, p1, p2):\r\n try:\r\n return (p2[1] - p1[1]) / (p2[0] - p1[0])\r\n except:\r\n return float('inf')\r\n\r\n def triangle_area(self, p1, p2, p3):\r\n return abs((p1[0] * (p2[1] - p3[1]) + p2[0] * (p3[1] - p1[1]) + p3[0] * (p1[1] - p2[1])) / 2)\r\n\r\n\r\ndef solve():\r\n if n < 3: return 'YES'\r\n p = Point()\r\n\r\n for i in range(3):\r\n for j in range(i + 1, 3):\r\n oth = []\r\n\r\n for k in range(n):\r\n if k != i and k != j:\r\n if p.collinear([xs[i], ys[i]], [xs[j], ys[j]], [xs[k], ys[k]]):\r\n oth.append(k)\r\n\r\n if len(oth) < 3: return 'YES'\r\n for k in range(2, len(oth)):\r\n if p.collinear([xs[oth[0]], ys[oth[0]]], [xs[oth[1]], ys[oth[1]]], [xs[oth[k]], ys[oth[k]]]):\r\n break\r\n else:\r\n return 'YES'\r\n\r\n return 'NO'\r\n\r\n\r\nfor _ in range(tests):\r\n n = int(input())\r\n xs = array('i', [0] * n)\r\n ys = array('i', [0] * n)\r\n for i in range(n): xs[i], ys[i] = inp(int)\r\n out.append(solve())\r\nprint('\\n'.join(map(str, out)))\r\n", "def f(a, fir, sec):\r\n x1, y1 = a[fir][0], a[fir][1]\r\n x2, y2 = a[sec][0], a[sec][1]\r\n b = []\r\n for i in a:\r\n if i == (x1, y1) or i == (x2, y2):\r\n continue\r\n x3, y3 = i[0], i[1]\r\n if (y2 - y1) * (x3 - x1) != (y3 - y1) * (x2 - x1):\r\n b.append((x3, y3))\r\n m = len(b)\r\n if m == 0 or m == 1:\r\n return 1\r\n x1, y1 = b[0][0], b[0][1]\r\n x2, y2 = b[1][0], b[1][1]\r\n for i in b:\r\n if i == (x1, y1) or i == (x2, y2):\r\n continue\r\n x3, y3 = i[0], i[1]\r\n if (y2 - y1) * (x3 - x1) != (y3 - y1) * (x2 - x1):\r\n return 0\r\n return 1\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n a.append((x, y))\r\nif n == 1 or n == 2:\r\n print(\"YES\")\r\n exit()\r\nif f(a, 0, 1) or f(a, 0, 2) or f(a, 1, 2):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")", "from sys import stdin, stdout\n\ndef pair_of_lines(n, xy_a):\n if len(xy_a) <= 3:\n return 'YES'\n\n p1, p2, p3 = xy_a[0], xy_a[1], xy_a[2]\n if judge(p1, kstr(p1, p2),xy_a):\n return 'YES'\n if judge(p1, kstr(p1, p3),xy_a):\n return 'YES'\n if judge(p2, kstr(p2, p3), xy_a):\n return 'YES'\n return 'NO'\n\n\ndef kstr(xy1, xy2):\n cx, cy = xy1[0], xy1[1]\n x, y = xy2[0], xy2[1]\n dx = x - cx\n dy = y - cy\n k = ''\n if dx == 0:\n k = str(x) + '/y'\n elif dy == 0:\n k = 'x/' + str(y)\n else:\n g = gcd(dx, dy)\n dx //= g\n dy //= g\n k = str(dx) + '/' + str(dy)\n return k\n\n\ndef judge(p, k, xy_a):\n\n rl = []\n for xy in xy_a:\n if p[0] == xy[0] and p[1] == xy[1]:\n continue\n if kstr(p, xy) != k:\n rl.append(xy)\n\n if len(rl) > 2:\n ck = kstr(rl[0], rl[1])\n for i in range(2, len(rl)):\n if ck != kstr(rl[0], rl[i]):\n return False\n\n return True\n\n\ndef gcd(a, b):\n if b == 0:\n return a\n return gcd(b, a % b)\n\n\ntry:\n n = int(stdin.readline())\n xy_a = []\n for _ in range(n):\n xy_a.append(list(map(int, stdin.readline().split())))\n res = pair_of_lines(n, xy_a)\n stdout.write(res)\nexcept Exception as e:\n print(e)\n", "from collections import namedtuple\nfrom itertools import combinations\n\nPoint = namedtuple('Point', ['x', 'y'])\n\n\ndef read():\n x, y = input().split()\n return Point(int(x), int(y))\n\n\ndef doubled_oriented_area(p1, p2, p3):\n return (p3.y - p1.y) * (p2.x - p1.x) - (p3.x - p1.x) * (p2.y - p1.y)\n\n\ndef filter_points(p1, p2, points):\n res = []\n for p in points:\n if doubled_oriented_area(p1, p2, p) != 0:\n res.append(p)\n return res\n\n\ndef on_the_same_line(points):\n if len(points) < 3:\n return True\n return not filter_points(points[0], points[1], points[2:])\n\n\ndef main():\n n = int(input())\n\n if n <= 4:\n print('YES')\n return\n\n points = []\n for i in range(n):\n points.append(read())\n\n for p in combinations(range(3), 2):\n filtered = filter_points(points[p[0]], points[p[1]], points)\n if on_the_same_line(filtered):\n print('YES')\n return\n\n print('NO')\n\n\nif __name__ == '__main__':\n main()\n", "from itertools import combinations\r\n\r\nps = [tuple(map(int, input().split())) for ln in range(int(input()))]\r\n\r\ndef outside(pt, v1, v2):\r\n return (pt[0] - v2[0]) * (v1[1] - v2[1]) - (pt[1] - v2[1]) * (v1[0] - v2[0])\r\n\r\ndef oneline(ps):\r\n return len(ps) <= 2 or not [p for p in ps if outside(p, ps[0], ps[1])]\r\n\r\nprint(\"YES\" if len(ps) <= 4 or any(oneline([p for p in ps if outside(p, v1, v2)])\r\n for v1, v2 in\r\n combinations((ps[:2] + [p for p in ps if outside(p, *ps[:2])] + [ps[0]])[:3],\r\n 2)) else \"NO\")", "import math\r\n\r\n\r\ndef get_line(x1, y1, x2, y2):\r\n a = x2 - x1\r\n b = y1 - y2\r\n c = x1 * (y2 - y1) - y1 * (x2 - x1)\r\n\r\n g = math.gcd(math.gcd(a, b), c)\r\n a //= g\r\n b //= g\r\n c //= g\r\n return a, b, c\r\n\r\n\r\nn = int(input())\r\nxy = []\r\n\r\nfor i in range(n):\r\n x, y = [int(x) for x in input().split()]\r\n xy.append((x, y))\r\n\r\nif n <= 3:\r\n print(\"YES\")\r\n exit()\r\n\r\n\r\ndef check(x1, y1, x2, y2, xy):\r\n a1, b1, c1 = get_line(x1, y1, x2, y2)\r\n other_point = None\r\n cnt_other = 0\r\n a2, b2, c2 = 0, 0, 0\r\n for i in range(len(xy)):\r\n x, y = xy[i]\r\n\r\n if a1 * y + b1 * x + c1 != 0:\r\n if other_point is None:\r\n other_point = x, y\r\n cnt_other = 1\r\n elif cnt_other == 1:\r\n cnt_other = 2\r\n a2, b2, c2 = get_line(*other_point, x, y)\r\n else:\r\n if a2 * y + b2 * x + c2 != 0:\r\n return False\r\n return True\r\n\r\n\r\nif check(*xy[0], *xy[1], xy[2:]):\r\n print(\"YES\")\r\nelif check(*xy[1], *xy[2], [xy[0]] + xy[3:]):\r\n print(\"YES\")\r\nelif check(*xy[0], *xy[2], [xy[1]] + xy[3:]):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n\r\n", "import sys\r\nfrom collections import Counter, defaultdict\r\nfrom math import gcd\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\npoints = [list(map(int, line.decode('utf-8').split()))\r\n for line in sys.stdin.buffer]\r\n\r\nif n <= 4:\r\n print('YES')\r\n exit()\r\n\r\nfor i in range(3):\r\n cnt = Counter()\r\n idx = defaultdict(list)\r\n for j, (x2, y2) in enumerate(points):\r\n if i == j:\r\n continue\r\n dx, dy = points[i][0] - x2, points[i][1] - y2\r\n if dy == 0:\r\n dx = 1\r\n elif dx == 0:\r\n dy = 1\r\n elif dy < 0:\r\n dx, dy = -dx, -dy\r\n g = gcd(abs(dx), abs(dy))\r\n dx //= g\r\n dy //= g\r\n cnt[dx, dy] += 1\r\n idx[dx, dy].append(j)\r\n\r\n if i == 2 or cnt.most_common(1)[0][1] > 1:\r\n mpos = cnt.most_common(1)[0][0]\r\n used = [1] + [0]*(n-1)\r\n for j in idx[mpos]:\r\n used[j] = 1\r\n points = [points[j] for j in range(n) if not used[j]]\r\n break\r\n\r\nif len(points) <= 2:\r\n print('YES')\r\n exit()\r\n\r\ncnt = Counter()\r\nfor j, (x2, y2) in enumerate(points):\r\n if i == j:\r\n continue\r\n dx, dy = points[0][0] - x2, points[0][1] - y2\r\n if dy == 0:\r\n dx = 1\r\n elif dx == 0:\r\n dy = 1\r\n elif dy < 0:\r\n dx, dy = -dx, -dy\r\n g = gcd(abs(dx), abs(dy))\r\n dx //= g\r\n dy //= g\r\n cnt[dx, dy] += 1\r\n\r\nif cnt.most_common(1)[0][1] + 1 == len(points):\r\n print('YES')\r\nelse:\r\n print('NO')\r\n", "n=int(input())\r\na=[list(map(int,input().split()))for _ in range(n)]\r\nf=lambda a,b,c:(b[0]-a[0])*(c[1]-a[1])-(b[1]-a[1])*(c[0]-a[0])\r\ndef g(s,t):\r\n\tq=[]\r\n\tfor p in a:\r\n\t\tif f(s,t,p):\r\n\t\t\tif len(q)<2:q.append(p)\r\n\t\t\telif f(q[0],q[1],p):return 0\r\n\treturn 1\r\nprint('YES'if n<5or any((g(a[0],a[1]),g(a[0],a[2]),g(a[1],a[2])))else'NO')" ]

[ "n = int(input())\r\ns, k = 0, n // 2\r\na, b, c = k - 1, k + 1, n - 1\r\nfor i in range(k):\r\n t = tuple(map(int, input().split()))\r\n s += t[i] + t[k] + t[c - i]\r\ns += sum(map(int, input().split()))\r\nfor i in range(k):\r\n t = tuple(map(int, input().split()))\r\n s += t[b + i] + t[k] + t[a - i]\r\nprint(s)", "n = int(input())\r\na = [0] * n\r\nres = 0\r\nfor i in range(n):\r\n a[i] = list(map(int, input().split()))\r\n\r\nres += sum(a[n//2][:n])\r\n\r\nt = 0\r\nfor _ in range(n//2):\r\n res += (a[t][t] + a[t][n-t-1] + a[t][n//2])\r\n res += (a[n-t-1][t] + a[n-t-1][n-t-1] + a[n-t-1][n//2])\r\n t += 1\r\nprint(res)", "#import sys\r\n#sys.stdin = open(\"input.in\",\"r\")\r\n#sys.stdout = open(\"test.out\",\"w\")\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nc=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j or i==n//2 or j==n//2 or i==n-1-j):\r\n c+=l[i][j]\r\nprint(c)", "# matrix dimensions\r\nn = int(input())\r\n\r\nmatrix = []\r\n\r\nfor mr in range(0, n):\r\n\tmatrix.append(list(map(int, input().split())))\r\n\r\n# get middle row (no need for + 1 since index starts with 0)\r\n# good matrix points\r\ngmp = sum(matrix[(n//2)])\r\nmatrix[n//2] = [0] * n\r\n\r\n# get middle column\r\ngmp += sum([row[n//2] for row in matrix])\r\n\r\nfor x in range(0, n):\r\n\tmatrix[x][n//2] = 0\r\n\r\n# get main and secondary diagonal\r\n# since all elements already counted for middle row\r\n# and middle column are already 0\r\n# there's no need to worry about [n/2][n/2] now\r\nfor y in range(0, n):\r\n\tgmp += matrix[y][y] + matrix[-1 - y][y]\r\n\r\nprint(gmp)\r\n\r\n# middle row:\t\t15\r\n# middle column:\t25", "a=int(input())\r\nx=[]\r\nfor i in range(a):\r\n y=list(map(int,input().split(\" \")))\r\n x.append(y)\r\ny=0\r\nfor i in range(a):\r\n for j in range(a):\r\n if(i==j):\r\n y+=x[i][j]\r\n if i+j==a-1:\r\n y+=x[i][j]\r\n if i==(a-1)//2:\r\n y+=x[i][j]\r\n if j==(a-1)//2:\r\n y+=x[i][j]\r\nprint(y-3*x[(a-1)//2][(a-1)//2])\r\n ", "n = int(input())\nm = [[int(i) for i in input().split()] for _ in range(n)]\nres = 0\nfor r in range(n):\n for c in range(n):\n if r == c or r + c == n - 1 or r == (n - 1) / 2 or c == (n - 1) / 2:\n res += m[r][c]\nprint(res)\n", "x=int(input())\r\nz=0;s=0;l=(x-1)\r\nfor i in range(x):\r\n y=input().split()\r\n if i<((x//2)-1) :\r\n z+=int(y[s])+int(y[l])+int(y[x//2])\r\n s+=1;l-=1\r\n elif i==((x//2)-1) :\r\n z += int(y[s]) + int(y[l]) + int(y[x // 2])\r\n elif i ==(x//2):\r\n for r in range(x):\r\n z+=int(y[r])\r\n else:\r\n z+=int(y[x//2])+int(y[l])+int(y[s])\r\n s-=1;l+=1\r\nprint(z)", "a=int(input())\r\nb=[]\r\nc=0\r\nd=0\r\nfor i in range(a):\r\n c=list(map(int,input().split()))\r\n b.append(c)\r\n\r\nfor i in range(len(b)):\r\n d+=b[i][i]\r\n d+=b[i][0-i-1]\r\n d+=b[(a-1)//2][i]\r\n d+=b[i][(a-1)//2]\r\nprint(d-(b[(a-1)//2][(a-1)//2]*3))", "rows = []\r\nn = int(input())\r\nfor _ in range(n):\r\n rows.append(list(map(int, input().split())))\r\nm = (n - 1) // 2\r\nres = sum(rows[i][i] for i in range(n))\r\nres += sum(rows[i][n-1-i] for i in range(n))\r\nres += sum(rows[m][i] for i in range(n))\r\nres += sum(rows[i][m] for i in range(n))\r\nres -= 3* rows[m][m]\r\nprint(res)", "n = int(input())\r\nmatrix = [list(map(int, input().split())) for i in range(n)]\r\n\r\ngood_sum = 0\r\nmiddle = n // 2\r\nfor i in range(n):\r\n good_sum += matrix[i][i]\r\n good_sum += matrix[i][n - i - 1]\r\nfor i in range(n):\r\n if i != middle:\r\n good_sum += matrix[middle][i]\r\n good_sum += matrix[i][middle]\r\n\r\nprint(good_sum-matrix[n//2][n//2])\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nsum=0\r\nx=n//2\r\nfor i in range(n):\r\n sum=sum+l[x][i]+l[i][x]\r\n sum=sum+l[i][i]+l[i][n-i-1]\r\nsum=sum-3*(l[x][x])\r\nprint(sum)", "n=int(input())\r\na=[]\r\nsum=0\r\nm=int(n/2)\t\r\nfor i in range(n):\r\n\ta.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n\tsum+=a[i][i]+a[i][n-i-1]+a[i][m]+a[m][i]\r\nprint(sum-(a[m][m]*3))\r\n", "n=int(input())\nmat1=[]\nfor i in range(0,n): \n temp=list(map(int,input().split()))\n mat1.append(temp)\nsum=0\nfor i in range(0,n):\n sum=sum+mat1[i][i]\np1=n-1\nfor i in range(0,n):\n sum=sum+mat1[i][p1]\n p1=p1-1\ntemp=int((n-1)//2)\n\nfor i in range(0,n):\n sum=sum+mat1[temp][i]\n\nfor i in range(0,n):\n sum=sum+mat1[i][temp]\n\nresult=sum-(3*mat1[temp][temp])\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())\nm = []\n\nfor i in range(n):\n m.append(list(map(int, input().split())))\n\ns = 0\nmiddle = (n - 1) // 2\n\nfor i in range(n):\n s += m[i][i] + m[i][-(i + 1)] + m[i][middle]\n\ns -= 2 * m[middle][middle]\ns += sum(m[middle])\ns -= m[middle][middle]\n\nprint(s)\n", "n = int(input())\r\nmid = int((n-1)/2)\r\nsu = 0\r\nfor i in range(n):\r\n \r\n l = list(map(int,input().split()))\r\n if i != mid:\r\n su = su + l[i]+l[n-1-i]+l[mid]\r\n else:\r\n su = su+sum(l)\r\n \r\nprint(su)", "matrix = []\r\n\r\nfor i in range(int(input())):\r\n matrix.append(list(map(int, input().split())))\r\n\r\ns = 0\r\n\r\nfor i in range(len(matrix)):\r\n for j in range(len(matrix)):\r\n if i == j:\r\n s += matrix[i][j]\r\n elif i + j == len(matrix) - 1:\r\n s += matrix[i][j]\r\n elif i == len(matrix) // 2:\r\n s += matrix[i][j]\r\n elif j == len(matrix) // 2:\r\n s += matrix[i][j]\r\n\r\nprint(s)", "n = int(input())\r\ns = 0\r\nk = 0\r\nfor i in range(n):\r\n lst = list(map(int, input().split()))\r\n if i < (n-1)/2:\r\n s += lst[k] + lst[n-k-1] + lst[int((n-1)/2)]\r\n k += 1\r\n elif i > (n-1)/2:\r\n s += lst[k] + lst[n-k-1] + lst[int((n-1)/2)]\r\n k -= 1\r\n else:\r\n s += sum(lst)\r\n k -= 1\r\nprint(s)\r\n \r\n\r\n", "n = int(input())\r\nsm = 0\r\nj = 1\r\nfor i in range(n):\r\n ls = list(map(int,input().split()))\r\n if i < int(n/2):\r\n sm += ls[i]\r\n sm += ls[n-1-i]\r\n sm += ls[int(n/2)]\r\n elif i == int(n/2):\r\n sm += sum(ls)\r\n else:\r\n sm += ls[int(n/2)]\r\n sm += ls[int(n/2)-j]\r\n sm += ls[int(n/2)+j]\r\n j += 1 \r\nprint(sm)", "# cook your dish here\nimport sys\n\nif __name__ == \"__main__\":\n n = int(sys.stdin.readline().strip())\n m = []\n for i in range(n):\n row = list(map(int, sys.stdin.readline().strip().split()))\n m.append(row)\n \n rowSum = sum(m[n//2])\n colSum = sum([m[i][n//2] for i in range(n)])\n diagSum1 = sum([m[i][i] for i in range(n)])\n diagSum2 = sum([m[i][n - i - 1] for i in range(n)])\n ans = rowSum + colSum + diagSum2 + diagSum1\n print(ans - 3*(m[n//2][n//2]))\n\t \t\t\t\t\t \t\t \t\t\t \t\t \t\t \t\t \t\t", "n = int(input())\r\nmat = [[] * n] * n\r\nfor i in range(n):\r\n mat[i] = list(map(int, input().split()))\r\n\r\nvisited = [[False] * n for i in range(n)]\r\ng_sum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n g_sum += mat[i][j]\r\n visited[i][j] = True\r\n break\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i + j == n-1 and visited[i][j] is False:\r\n g_sum += mat[i][j]\r\n visited[i][j] = True\r\n break\r\n\r\ni = n // 2\r\nfor j in range(n):\r\n if visited[i][j] is False:\r\n g_sum += mat[i][j]\r\n visited[i][j] = True\r\n\r\nj = n // 2\r\nfor i in range(n):\r\n if visited[i][j] is False:\r\n g_sum += mat[i][j]\r\n visited[i][j] = True\r\n\r\nprint(g_sum)\r\n", "n=int(input())\r\nmatrix=[]\r\nfor i in range(n):\r\n matrix.append(list(map(int,input().split())))\r\nsumOfMainDiagonal=0\r\nsumOfMiddleRow=0\r\nsumOfMiddleColumn=0\r\nsumOfSecondaryDiagonal=0\r\nfor i in range(n):\r\n sumOfMainDiagonal+=matrix[i][i]\r\n sumOfMiddleColumn+=matrix[i][n//2]\r\n sumOfMiddleRow+=matrix[n//2][i]\r\n sumOfSecondaryDiagonal+=matrix[i][n-i-1]\r\n\r\nprint(sumOfMainDiagonal+sumOfSecondaryDiagonal+sumOfMiddleRow+sumOfMiddleColumn-3*matrix[n//2][n//2])", "n = int(input()) \r\n\r\nmatrix = [] \r\n\r\n\r\nfor _ in range(n):\r\n row = list(map(int, input().split()))\r\n matrix.append(row)\r\n\r\n\r\nsum_of_good_elements = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i == (n - 1 - j) or i == n // 2 or j == n // 2:\r\n sum_of_good_elements += matrix[i][j]\r\n\r\n\r\nprint(sum_of_good_elements)\r\n", "n = int(input())\r\nmat = list()\r\nans = 0\r\nfor i in range(n):\r\n li = list(map(int, input().split()))\r\n mat.append(li)\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i == j or j == n-1-i or i == n//2 or j == n//2):\r\n ans += mat[i][j]\r\nprint(ans)\r\n", "#177A1 in codeforces\r\nn = int(input())\r\nmatrix = []\r\nfor _ in range(n):\r\n\tmatrix.append(list(map(int,input().split())))\r\nelements_sum = 0\r\n#sum of middle row\r\nelements_sum+=sum(matrix[n//2])\r\n#sum of middle column\r\nfor i in range(n):\r\n\telements_sum+=matrix[i][n//2]\r\n#sum of first diagonal\r\nfor i in range(n):\r\n\telements_sum+=matrix[i][i]\r\n#sum of second diagonal\r\nfor i in range(n):\r\n\telements_sum+=matrix[n-i-1][i]\r\nprint(elements_sum-(3*matrix[n//2][n//2]))", "n = int(input(\"\"))\r\n\r\nsumC = 0\r\nc = int((n-1)/2)\r\n\r\nfor i in range(n):\r\n currentLine = input(\"\").split()\r\n row = list(map(int, currentLine))\r\n if i == c:\r\n sumC += sum(row)\r\n else:\r\n sumC += row[i] + row[n-1-i] + row[c]\r\n \r\nprint(sumC)", "n=int(input())\r\n\r\nl=[]\r\n\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n l.append(m)\r\n\r\nans=0\r\n\r\nfor i in range(n):\r\n ans+=l[i][i]\r\n l[i][i]=0\r\nj=n-1\r\nfor i in range(n):\r\n ans+=l[i][j]\r\n l[i][j]=0\r\n j-=1\r\nj=n//2\r\nfor i in range(n):\r\n ans+=l[i][j]\r\n l[i][j]=0\r\n\r\nfor i in range(n):\r\n ans+=l[j][i]\r\n\r\nprint(ans)", "n=int(input())\r\nl=[[int(x) for x in input().split()] for i in range(n)]\r\nres=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if j==n//2 or i==n//2 or i==j or i==n-1-j:\r\n res+=l[i][j]\r\nprint(res)\r\n", "# LUOGU_RID: 101470910\n(n, ), *a = [[*map(int, s.split())] for s in open(0)]\r\nprint(sum(y for i, x in enumerate(a) for j, y in enumerate(x) if i == j or i + j == n - 1 or n // 2 in (i, j)))", "n = int(input())\r\nmatrix = []\r\n\r\n# Read the matrix\r\nfor _ in range(n):\r\n row = list(map(int, input().split()))\r\n matrix.append(row)\r\n\r\n# Initialize the sum\r\ntotal_sum = 0\r\n\r\n# Calculate the sum of good elements\r\nfor i in range(n):\r\n total_sum += matrix[i][i] # Main diagonal\r\n total_sum += matrix[i][n - i - 1] # Secondary diagonal\r\n total_sum += matrix[(n - 1) // 2][i] # Middle row\r\n total_sum += matrix[i][(n - 1) // 2] # Middle column\r\n\r\n# If an element is counted in both middle row and middle column, subtract it once\r\ntotal_sum -= 3 * matrix[(n - 1) // 2][(n - 1) // 2]\r\n\r\n# Print the result\r\nprint(total_sum)\r\n", "n=int(input())\r\nl=[[0]*n]*n\r\nfor i in range(n):\r\n l[i]=list(map(int,input().split()))\r\ns=0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if i==j:\r\n s+=l[i][j]\r\n elif i+j==n-1:\r\n s+=l[i][j]\r\n elif i==(n-1)//2:\r\n s+=l[i][j]\r\n elif j==(n-1)//2:\r\n s+=l[i][j]\r\nprint(s)\r\n ", "n = int(input())\r\na = []\r\nk = 0\r\nfor i in range(n):\r\n a.append(input().split())\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i == j or i == n // 2 or j == n // 2 or i + j == n - 1):\r\n k += int(a[i][j])\r\nprint(k)", "n=int(input())\r\nsum1=0\r\nif n==1:\r\n\tsum1=int(input())\r\nelse:\t\r\n\tfor i in range(n):\r\n\t\tl=list(map(int,input().split()))\r\n\t\tif i in range(n//2) and n>1:\r\n\t\t\tsum1+=l[i]+l[n//2]+l[n-i-1]\r\n\t\telif i==n//2:\r\n\t\t\tfor j in l:\r\n\t\t\t\tsum1+=j\r\n\t\telif i in range((n//2)+1,n):\r\n\t\t\tsum1+=l[i]+l[n//2]+l[n-i-1]\r\nprint(sum1)", "n = int(input())\nm = []\nfor i in range(n):\n m.append(list(map(int,input().split())))\n\nresult = 0\nresult = sum([m[i][i] for i in range(n)]) + sum([m[i][n-i-1] for i in range(n)]) + sum(m[n//2]) + sum([r[n//2] for r in m]) - 3*m[n//2][n//2]\nprint(result)\n", "# grid = list(map(int,input().split()))\r\nnrow = int(input())\r\ngrid = []\r\nfor _ in range(nrow):\r\n\trow = list(map(int,input().split()))\r\n\tgrid.append(row)\r\nsuma = sum(grid[nrow//2]) + sum([grid[x][nrow//2] for x in range(nrow)]) + sum([grid[x][x] for x in range(nrow)]) + sum([grid[nrow-x-1][x] for x in range(nrow)]) - grid[nrow//2][nrow//2]*3\r\nprint(suma)", "n = int(input())\nmatrix = []\npoints = 0\nfor i in range(n):\n\trow = input().split()\n\tmatrix.append(row)\n\nmitad = n // 2\n\nfor i in range(n):\n\tvalorDiagp = int(matrix[i][i])\n\tpoints += valorDiagp\n\n\tvalorDiags = int(matrix[i][n - i - 1])\n\tpoints += valorDiags\n\n\tvalorColumnas = int(matrix[i][mitad])\n\tpoints += valorColumnas\n\n\n\tvalorFilas = int(matrix[mitad][i])\n\tpoints += valorFilas\n\n\npoints -= int(matrix[mitad][mitad])*3\n\nprint(points)\n\n \t\t \t \t \t \t\t \t \t\t\t \t \t", "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 = int(input())\n\nm = [[0 for j in range(n)] for i in range(n)]\nfor row in range(n):\n c = read_ints()\n for idx, el in enumerate(c):\n m[row][idx] = el\n\n\nsum = 0\nfor row in range(n):\n for col in range(n):\n if row == col:\n sum += m[row][col]\n elif col == n // 2:\n sum += m[row][col]\n elif row == n // 2:\n sum += m[row][col]\n elif row + col == n-1:\n sum += m[row][col]\n\nprint(sum)\n", "n = int(input())\r\na = []\r\nsum = 0\r\nfor i in range(n):\r\n s = [int(c) for c in input().split()]\r\n a.append(s)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or (i + j == n - 1) or (i == n//2) or (j == n//2):\r\n sum += a[i][j]\r\nprint(sum)", "n=int(input())\r\nl=0 ; z=n-1 ; sum=0\r\nfor i in range(n):\r\n x=input().split()\r\n if i<(n//2) :\r\n sum+=int(x[l])+int(x[n//2])+int(x[z])\r\n l+=1 ; z-=1\r\n elif l==z :\r\n for p in range (n):\r\n sum+=int(x[p])\r\n l-=1 ; z+=1\r\n else:\r\n sum+=int(x[l])+int(x[n//2])+int(x[z])\r\n l-=1 ; z+=1\r\nprint(sum)", "def main():\r\n n = int(input())\r\n a = []\r\n \r\n for i in range(n):\r\n row = list(map(int, input().split()))\r\n a.append(row)\r\n \r\n sum_val = 0\r\n\r\n # main diagonal\r\n for i in range(n):\r\n sum_val += a[i][i]\r\n a[i][i] = 0\r\n\r\n # secondary diagonal\r\n for i in range(n):\r\n sum_val += a[i][n - i - 1]\r\n a[i][n - i - 1] = 0\r\n\r\n # mid row\r\n for i in range(n):\r\n sum_val += a[n // 2][i]\r\n a[n // 2][i] = 0\r\n\r\n # mid column\r\n for i in range(n):\r\n sum_val += a[i][n // 2]\r\n a[i][n // 2] = 0\r\n\r\n print(sum_val)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=[list(map(int,input().split(\" \"))) for i in range(n)]\r\npd,sd,cd,rd=0,0,0,0\r\nfor i in range(n):\r\n\t\t\tpd+=l[i][i]\r\n\t\t\tsd+=l[i][n-1-i]\r\n\t\t\tcd+=l[(n-1)//2][i]\r\n\t\t\trd+=l[i][(n-1)//2]\r\nprint((pd+sd+cd+rd)-3*l[(n-1)//2][(n-1)//2])", "n = int(input())\r\n\r\ngrid = []\r\n\r\nfor i in range(n):\r\n grid.append([int(x) for x in input().split()]) # formation of grid\r\n\r\ncnt = 0\r\nfor r in range(n):\r\n for c in range(n):\r\n if c == r:\r\n cnt += grid[r][c]\r\n if r + c == n - 1:\r\n cnt += grid[r][c]\r\n if r == n // 2:\r\n cnt += grid[r][c]\r\n if c == n // 2:\r\n cnt += grid[r][c]\r\n\r\ncnt -= 3 * grid[n//2][n//2]\r\n\r\nprint(cnt)\r\n", "n = int(input())\r\na = []\r\nz = 0\r\nfor i in range(n):\r\n a.append(input().split(\" \"))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i + j == n - 1 or i == (n - 1) / 2 or j == (n - 1) / 2:\r\n z += int(a[i][j])\r\nprint(z)", "import sys\r\n\r\ndef main():\r\n inp = sys.stdin.read().strip().split('\\n')\r\n n = int(inp[0])\r\n m = [[int(x) for x in s.split()] for s in inp[1:]]\r\n s = sum(m[i][i] + m[i][-i-1] + m[i][n//2] + m[n//2][i] for i in range(n))\r\n return s - 3*m[n//2][n//2]\r\n \r\nprint(main())\r\n", "def sum(n):\r\n c = 0\r\n for i in range (n):\r\n c += int(matrix[i][i])\r\n for i in range (n):\r\n c += int(matrix[i][n-i-1]) \r\n for i in range (n):\r\n c += int(matrix[i][int((n-1)/2)]) \r\n for i in range (n):\r\n c+= int(matrix[int((n-1)/2)][i])\r\n c = c - 3*int(matrix[int((n-1)/2)][int((n-1)/2)]) \r\n print(c) \r\n\r\nmatrix = []\r\ni = int(input())\r\nfor t in range (0,i):\r\n matrix.append(input().split())\r\nsum(i)\r\n \r\n \r\n \r\n \r\n ", "#Codeforce 177A1\r\nline=int(input())\r\nans=0\r\nfor i in range(line):\r\n list1=[int(v) for v in input().split()]\r\n if i == (line-1)//2:\r\n ans += sum(list1)\r\n else:\r\n ans += (list1[i] + list1[(line-1)//2] + list1[line-1-i])\r\nprint(ans)", "x = int(input())\r\nans = 0\r\nmid = ((x-1)//2)\r\nlst = []\r\nfor k in range(0, x):\r\n lst.append(list(map(int, input().split())))\r\nif x == 1 or x == 3:\r\n for k in lst:\r\n for k2 in k:\r\n ans = ans + k2\r\n print(ans)\r\nelse:\r\n for k in range(0, x):\r\n ans = ans + lst[k][k] + lst[k][x-k-1] + lst[k][mid] + lst[mid][k]\r\n print(ans-(3*lst[mid][mid]))\r\n", "t = 0\r\nn = int(input())\r\nm = n // 2\r\nfor i in range(n):\r\n l = [int(i) for i in input().split()]\r\n t += l[i] + l[m] + l[-1 - i]\r\n if i == m:\r\n t += sum(l)\r\n t -= (l[m] * 3)\r\nprint(t)", "'''\r\nAmirhossein Alimirzaei\r\nTelegram : @HajLorenzo\r\nInstagram : amirhossein_alimirzaei\r\nUniversity of Bojnourd\r\n\r\n\r\na=[[1,2],[4,5]]\r\nfor x in range(len(a)):\r\n for y in range(len(a[x])):\r\n print(a[x][y],end=\" \")'''\r\n \r\nn=int(input())\r\nt=0\r\n\r\ni=0\r\n\r\n\r\nfor x in range(n//2):\r\n k=list(map(int,input().split(' ')))\r\n t+=k[n-i-1]+k[n//2]+k[i]\r\n i+=1\r\nk=list(map(int,input().split(' ')))\r\nt+=sum(k)\r\ni=(n//2)-1\r\nfor x in range((n//2)+1,n):\r\n k=list(map(int,input().split(' ')))\r\n t+=k[n-i-1]+k[n//2]+k[i]\r\n i-=1\r\nprint(t)", "x = int(input())\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(x):\r\n b.append(list(map(int, input().split(\" \"))))\r\n\r\nif round(x/2) > round((x-2)/2):\r\n c = b[round(x/2)-1][round(x/2)-1]\r\n b[round(x / 2) - 1][round(x / 2) - 1] = 0\r\n a = a + b[round(x/2)-1]\r\n for i in b:\r\n a.append(i[round(x/2)-1])\r\nelse:\r\n c = b[round(x / 2)][round(x / 2)]\r\n b[round(x / 2)][round(x / 2)] = 0\r\n a = a + b[round(x / 2)]\r\n for i in b:\r\n a.append(i[round(x / 2)])\r\n\r\nfor i in range(x):\r\n for j in range(x):\r\n if i == j:\r\n a.append(b[i][j])\r\n else:\r\n pass\r\n\r\nfor i in reversed(range(x)):\r\n for j in range(x):\r\n if i + j == x - 1:\r\n a.append(b[i][j])\r\n else:\r\n pass\r\n\r\nprint(sum(a) + c)\r\n", "n = int(input())\r\n\r\nl = []\r\n\r\nfor i in range(n):\r\n m = list(map(int, input().split()))\r\n l.append(m)\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n ans += l[i][i]\r\n l[i][i] = 0\r\nj = n - 1\r\nfor i in range(n):\r\n ans += l[i][j]\r\n l[i][j] = 0\r\n j -= 1\r\nj = n // 2\r\nfor i in range(n):\r\n ans += l[i][j]\r\n l[i][j] = 0\r\n\r\nfor i in range(n):\r\n ans += l[j][i]\r\n\r\nprint(ans)", "n = int(input())\r\na = []\r\n\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n a.append(row)\r\n\r\nsum_value = 0\r\n\r\n# Main diagonal\r\nfor i in range(n):\r\n sum_value += a[i][i]\r\n a[i][i] = 0\r\n\r\n# Secondary diagonal\r\nfor i in range(n):\r\n sum_value += a[i][n - 1 - i]\r\n a[i][n - 1 - i] = 0\r\n\r\n# Mid row\r\nmid_row = n // 2\r\nfor i in range(n):\r\n sum_value += a[mid_row][i]\r\n a[mid_row][i] = 0\r\n\r\n# Mid column\r\nmid_column = n // 2\r\nfor i in range(n):\r\n sum_value += a[i][mid_column]\r\n a[i][mid_column] = 0\r\n\r\nprint(sum_value)\r\n", "n = int(input())\nmatrix = [list(map(int , input().split())) for i in range(n)]\nsum = 0\nmid = n // 2\nfor i in range(n):\n sum += matrix[i][i]\n sum += matrix[i][n - 1 - i]\n sum += matrix[mid][i]\n sum += matrix[i][mid]\nsum -= 3 * matrix[mid][mid]\nprint(sum)\n\t\t \t \t\t \t \t \t \t \t \t\t", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nprint(sum(a[i][i] + a[i][n - i - 1] + a[n // 2][i] + a[i][n // 2] for i in range(n)) - 3 * a[n // 2][n // 2])", "n = int(input())\r\naij = [list(map(int,input().split())) for i in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i + j == n - 1 or i == n // 2 or j == n // 2:\r\n ans += aij[i][j]\r\nprint(ans)\r\n", "def good_elements(lst):\r\n summa = 0\r\n for i in range(len(lst)):\r\n for j in range(len(lst)):\r\n if i == j or i + j == len(lst) - 1 or i == (len(lst) - 1) // 2 or j == (len(lst) - 1) // 2:\r\n summa += lst[i][j]\r\n return summa\r\n\r\n\r\nn = int(input())\r\na = [[int(j) for j in input().split()] for i in range(n)]\r\nprint(good_elements(a))\r\n", "n = int(input())\nmatrix = []\nfor i in range(n):\n matrix.append(list(map(int, input().split())))\na = []\nfor i in range(n):\n a.append(matrix[i][n-1-i])\n for m in range(n):\n if i == m:\n if i != n//2:\n a.append(matrix[i][m])\n if i == n//2:\n if m != n//2:\n a.append(matrix[i][m])\n if m == n//2:\n if i != n//2:\n a.append(matrix[i][m])\n\nprint(sum(a))", "n = int(input())\r\nmat = []\r\nsum = 0\r\nfor i in range(n):\r\n new = list(map(int, input().split()))\r\n mat.append(new)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i+j == n-1 or i == (n-1)//2 or j == (n-1)//2:\r\n sum += mat[i][j]\r\nprint(sum)\r\n", "n = int(input())\r\noup = 0\r\nfor i in range(1,n+1):\r\n L = list(map(int,input().split()))\r\n for j in range(1,n+1):\r\n x = L[j-1]\r\n if i==j:\r\n oup += x\r\n elif i+j==n+1:\r\n oup += x\r\n elif (2*j-1==n):\r\n oup += x\r\n elif (2*i-1==n):\r\n oup += x\r\nprint(oup)", "n = int(input())\n\nmatrix = []\n\nfor i in range(n):\n matrix.append(list(map(int, input().split())))\n\ncount = 0\nmid = ((n+1)//2) - 1\nfor i in range(n):\n count += matrix[i][i]\n matrix[i][i] = 0\n count += matrix[i][n-(i+1)]\n matrix[i][n-(i+1)] = 0\n\nfor i in range(n):\n count += matrix[mid][i]\n matrix[mid][i] = 0\n\nfor i in range(n):\n count += matrix[i][mid]\n matrix[mid][i] = 0\n\n\nprint(count)", "n=int(input())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n l+=[list(map(int,input().split()))]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==(n//2) or j==(n//2) or i==j or i+j==n-1:\r\n c+=l[i][j]\r\nprint(c)", "n = int(input())\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n nums = list(map(int, input().split()))\r\n if i == n // 2:\r\n total += sum(nums)\r\n else:\r\n total += nums[i] + nums[n // 2] + nums[n - 1 - i]\r\n\r\nprint(total)", "def solution(n, matrix):\r\n _sum = 0\r\n mid = n // 2 # middle index\r\n\r\n for i in range(n):\r\n # diagonals\r\n _sum += matrix[i][i]\r\n _sum += matrix[i][-1-i]\r\n\r\n # middle col\r\n _sum += matrix[i][mid]\r\n\r\n # middle row\r\n _sum += matrix[mid][i]\r\n\r\n # since the middle elem is added 4 times (1 + 3 extra)\r\n _sum -= 3 * matrix[mid][mid]\r\n\r\n return _sum\r\n\r\n\r\nn = int(input())\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n tmp = list(map(int, input().split()))\r\n matrix.append(tmp)\r\n\r\nprint(solution(n, matrix))\r\n", "n=int(input());\r\nr=0;\r\nfor i in range(n):\r\n l=list(map(int, input().split()));\r\n for j in range(n):\r\n if(i==j or i+j==n-1 or i==n//2 or j==n//2): r+=l[j];\r\nprint(r);\r\n", "n = int(input())\np = (n-1)//2\ns_md,s_nd,s_c,s_r=0,0,0,0\nm_e = 0\nfor i in range(n):\n mat = list(map(int, input().split()))\n if i == p:\n s_r = sum(mat)\n m_e = mat[p]\n s_md+=mat[i]\n s_nd+=mat[n-1-i]\n s_c+=mat[p]\n\nprint(s_r + s_md + s_nd + s_c - 3*m_e)\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n p=list(map(int,input().split()))\r\n a.append(p)\r\ns=0\r\ns+=sum(a[(n-1)//2])\r\nfor i in range(n):\r\n s+=a[i][(n-1)//2]\r\nfor i in range(n):\r\n s+=a[i][i]\r\n s+=a[(n-1)-i][0+i]\r\nprint(s-3*a[(n-1)//2][(n-1)//2])", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i == j) or (i == n - j - 1) or (i == (n - 1) // 2) or (j == (n - 1) // 2):\r\n ans += a[i][j]\r\nprint(ans)", "n=int(input())\r\nl=[]\r\ns=0\r\nfor i in range(n):\r\n l.append([int(i) for i in input().split()])\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j):\r\n s+=l[i][j]\r\n elif(i==((n-1)//2)):\r\n s+=l[i][j]\r\n elif(j==((n-1)//2)):\r\n s+=l[i][j]\r\n elif(i+j==(n-1)):\r\n s+=l[i][j]\r\nprint(s)", "#https://codeforces.com/problemset/problem/177/A1\r\nmatrix_size = int(input())\r\n\r\nglobal_list = []\r\n\r\ndiagonal_1_sum = 0\r\ndiagonal_2_sum = 0\r\nmiddle_row_sum = 0\r\nmiddle_column_sum = 0\r\n\r\nmiddle_index = int(matrix_size/2 + 0.5)-1\r\n\r\nsubtract = 0\r\n\r\nfor i in range(matrix_size):\r\n inp = input()\r\n inp = inp.split(\" \")\r\n \r\n diagonal_1_sum += int(inp[i])\r\n diagonal_2_sum += int(inp[-i-1])\r\n middle_row_sum += int(inp[middle_index])\r\n if middle_index == i:\r\n for current_num in inp:\r\n middle_column_sum += int(current_num)\r\n subtract = int(inp[middle_index])*3\r\n\r\nprint (diagonal_1_sum+diagonal_2_sum+middle_row_sum+middle_column_sum-subtract)\r\n\r\n \r\n", "import math\nn = int(input())\n\nmat = []\nfor i in range(n):\n p = list(map(int,input().split()))\n mat.append(p)\n\n#print(mat)\nmain_diagonal = 0\nsecondary_diagonal = 0\n\nfor i in range(0,n):\n main_diagonal = main_diagonal + mat[i][i]\n secondary_diagonal = secondary_diagonal + mat[i][n-i-1]\n\n#print(main_diagonal,secondary_diagonal)\n\nmiddle_row = math.ceil(n/2)-1\nmiddle_column = math.ceil(n/2)-1\n\nrow_sum = sum(mat[middle_row])\n#print(mat[middle_row])\n\n\ndef column(matrix, i):\n return [row[i] for row in matrix]\n\ncolumn_sum = sum(column(mat,middle_column))\n#print((column_sum))\n\nmiddle_element = math.ceil(len(mat[middle_row])/2)-1\nl = mat[middle_row]\n#print(l[middle_element])\n\ntotal = main_diagonal+secondary_diagonal+column_sum+row_sum-(3*l[middle_element])\n\nprint(total)\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\nmt, ans = n*[n*[0]], 0\r\nfor i in range(n): mt[i] = [int(x) for x in input().split()]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or i+j+1==n or i == (n-1)//2 or j==(n-1)//2: ans += mt[i][j]\r\nprint(ans)", "n = int(input())\r\nm = [[int(i) for i in input().split()] for j in range(n)]\r\nhasil = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n hasil += m[i][j]\r\n elif (i + j) == (n-1):\r\n hasil += m[i][j]\r\n elif i == (n-1)//2:\r\n hasil += m[i][j]\r\n elif j == (n-1)//2:\r\n hasil += m[i][j]\r\n\r\nprint(hasil)", "n = int(input())\r\ncounter = 0 \r\nmatrix = [0] * n\r\nfor i in range(n) :\r\n matrix[i] = list(map(int , input().split()))\r\n \r\ncounter += sum(matrix[n//2])\r\nfor i in matrix:\r\n counter += i[n//2] \r\ncounter -= matrix[n//2][n//2] *3\r\nk = 0\r\nfor i in matrix:\r\n counter+= i[k]\r\n k+=1\r\n\r\nfor i in matrix:\r\n counter+=i[n-1]\r\n n-=1\r\nprint(counter)", "\"\"\"\r\nfor _ in range(int(input())):\r\n n,r1,c1,r2,c2=map(int,input().split())\r\n print(min(abs(r1-r2)+ abs(c1-c2),min(min(r1,n-r1 +1),min(c1,n-c1+1))+min(min(r2,n-r2+1),min(c2,n-c2+1))))\r\n #m=min(abs(r1-r2)+abs(c1-c2),min(min(r1,n-r1 +1)\r\n #p=r1,\r\n\r\nfor _ in range(int(input())):\r\n n,k=map(int,input().split())\r\n #l=[int(i) for i in range(1,n+1)]\r\n if k<n//2:\r\n print(2*k*n-2*k*k-k)\r\n else:print((n*n-n)//2)\r\n\r\n\r\nfor _ in range(int(input())):\r\n a,b,c=map(int,input().split())\r\n if a+b==c or b+c==a or a+c==b:\r\n print(\"YES\")\r\n else:print(\"NO\")\r\n\r\nfor _ in range(int(input())):\r\n n,m=map(int,input().split())\r\n print(m*min(2,n-1))\r\n \r\n#1391B\r\nfor _ in range(int(input())):\r\n m,n=map(int,input().split())\r\n c=0\r\n for i in range(1,m+1):\r\n p=input()\r\n if p[-1]==\"R\":\r\n c+=1\r\n if i==m:\r\n for j in p:\r\n if j==\"D\":c+=1\r\n print(c)\r\n\r\nn,m=map(int,input().split())\r\nc=0\r\nfor _ in range(n):\r\n p=input()\r\n for i in p:\r\n if i==\"C\" or i==\"M\" or i==\"Y\":\r\n c+=1\r\nif c==0:print(\"#Black&White\")\r\nelse:print(\"#Color\")\r\n\"\"\"\r\nn=int(input())\r\nc=0\r\nfor j in range(n):\r\n p=list(map(int,input().split()))\r\n for i in range(n):\r\n if i==j or i==n-j-1 or i==(n-1)//2 or j==(n-1)//2:\r\n c+=p[i]\r\nprint(c)\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n", "import io\r\nimport os\r\nimport sys\r\nfrom collections import Counter\r\n# Reinitialize the Input function\r\n# to take input from the Byte Like \r\n# objects\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\n\r\n#read n \r\nline = input().decode().strip()\r\nn=int(line)\r\n\r\n# read the map of the city and record the *\r\narr=[]\r\nfor a in range(n):\r\n line = [int(i) for i in input().decode().strip().split()]\r\n arr.append(line)\r\n\r\nsum =0\r\nfor i in range(n):\r\n sum += arr[i][i] + arr[i][n-1-i] + arr[i][int((n-1)/2)] + arr[int((n-1)/2)][i]\r\n \r\nsum = sum - 3*arr[int((n-1)/2)][int((n-1)/2)]\r\n\r\nprint(sum)\r\n# ans = line % 2\r\n# if ans==0:\r\n# arr = []\r\n# for i in range(int(line/2)):\r\n# arr.append(2*i+1+1)\r\n# arr.append(2*i+1)\r\n# sys.stdout.write(\" \".join(map(str, arr)) + \"\\n\")\r\n# else:\r\n# print(\"-1\")\r\n\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n b=list(map(int,input().split()))\r\n a.append(b)\r\ns=0\r\nfor i in range(len(a)):\r\n for j in range(len(a[i])):\r\n if i==j:\r\n s=s+a[i][j]\r\n a[i][j]=0\r\n elif i+j==n-1:\r\n s=s+a[i][j]\r\n a[i][j]=0\r\n if i==n//2:\r\n s=s+a[i][j]\r\n a[i][j]=0\r\n elif j==n//2:\r\n s=s+a[i][j]\r\n a[i][j]=0\r\n \r\nprint(s)", "n = int(input())\r\na = []\r\nk = 0\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n k += a[i][j]\r\n elif i + j == n - 1:\r\n k += a[i][j]\r\n elif n // 2 == i:\r\n k += a[i][j]\r\n elif n // 2 == j:\r\n k += a[i][j]\r\nprint(k)", "n = int(input())\r\nmatrix = []\r\nsumm=0\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().rstrip().split())))\r\nfor i in range(n) :\r\n summ+=matrix[i][i]\r\nfor i in range(n) :\r\n summ+=matrix[i][n-i-1]\r\nfor i in range(n) :\r\n summ+=matrix[n//2][i]\r\nfor i in range(n) :\r\n summ+=matrix[i][n//2]\r\nans=summ-(3*(matrix[n//2][n//2]))\r\nprint(ans)", "#177A1\r\n\"\"\"\r\ns=0\r\nn=int(input())\r\nfor i in range(n):\r\n l=input()\r\n for j in range(len(l)):\r\n if j==i or j==(n-i-1) or j==(n-1)//2 or i==(n-1)//2:\r\n s+=j\r\n \r\nprint(s)\r\n\"\"\"\r\nn=int(input())\r\nlst=[]\r\ns=0\r\nb=0\r\nif(n>2):\r\n for i in range(n):\r\n n1=input()\r\n lst.append(n1)\r\n n1=n1.split()\r\n w=(len(n1)//2)\r\n s+=int(n1[i])+int(n1[w])+int(n1[-1-i])\r\n m=lst[w]\r\n m=m.split()\r\n for j in m:\r\n b=b+int(j)\r\n print((s+b)-3*int(m[w]))\r\nelse:\r\n if(n==1):\r\n n1=input()\r\n print(n1)\r\n else:\r\n for i in range(n):\r\n n1=input()\r\n s+=int(n1[0])+int(n1[2])\r\n print(s)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(list(map(int,input().split())))\r\nsumi=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j or i==n//2 or j==n//2 or i==n-j-1:\r\n\t\t\tsumi+=a[i][j]\r\nprint(sumi)", "'''input\r\n5\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n\r\n'''\r\n\r\nn = int(input())\r\nmat = []\r\nfor _ in range(n):\r\n\ttemp = []\r\n\ts = input()\r\n\ts = s.split()\r\n\tfor num in s:\r\n\t\ttemp.append(int(num))\r\n\tmat.append(temp)\r\n\r\nx = (n-1)//2\r\nd = n-1\r\nans = 0\r\n\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i == j and i != x and j != x: #left to right diagonal\r\n\t\t\tans += mat[i][j]\r\n\t\tif j == d and j != x: #right to left diagonal\r\n\t\t\tans += mat[i][j]\r\n\t\tif j == x and i != x: #mid column\r\n\t\t\tans += mat[i][j]\r\n\t\tif i == x and j != x: #mid row\r\n\t\t\tans += mat[i][j]\r\n\td -= 1\r\n\r\nans += mat[x][x]\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\r\n\r\nmid = n // 2\r\nSum = 0\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n for j in range(n):\r\n if i == j or j == (n-i-1) or i == mid or j == mid:\r\n Sum += row[j]\r\n\r\nprint(Sum)\r\n", "n = int(input())\r\nif ((n >= 1) and (n <= 101) and (n % 2 == 1)):\r\n M = list()\r\n for i in range(0, n):\r\n Mr = [int(j) for j in input().split(' ')]\r\n M = M + [Mr]\r\n G = set()\r\n for k in range(0, n):\r\n G.add((k, k))\r\n G.add((k, n - 1 - k))\r\n for m in range(0, n):\r\n G.add(((n - 1)//2, m))\r\n G.add((m, (n - 1)//2))\r\n L = list(G)\r\n z = 0\r\n for p in range(0, len(L)):\r\n z = z + M[L[p][0]][L[p][1]]\r\n print(z)", "T = int(input())\r\nmat = []\r\nt = T // 2\r\ntotal = 0\r\nfor _ in range(T):\r\n r = list(map(int, input().split()))\r\n mat.append(r)\r\n total += r[t]\r\n\r\nif T == 1:\r\n print(mat[0][0])\r\n\r\nelif T == 3:\r\n total = sum([sum(i) for i in mat])\r\n print(total)\r\n\r\nelse:\r\n for i in range(t):\r\n total += mat[i][i] + mat[i][~i]\r\n total += mat[~i][i] + mat[~i][~i]\r\n total += sum(mat[t]) - mat[t][t]\r\n print(total)", "n = int(input())\r\nl = []\r\nans = 0\r\nnh = n // 2\r\n\r\nfor _ in range(n):\r\n a = [int(x) for x in input().split()]\r\n l.append(a)\r\n\r\nans += sum(l[nh])\r\n\r\nfor j in range(n):\r\n ans += l[j][nh]\r\n\r\nc = 0\r\nfor i in range(n):\r\n ans += l[i][c]\r\n c += 1\r\n\r\nd = n - 1\r\nfor k in range(n):\r\n ans += l[d][k]\r\n d -= 1\r\n\r\nprint(ans - (l[nh][nh]*3))", "\"\"\"\n author: pavan_64_0\n Date of creation : 15th November 2022\n\"\"\"\n\n# initialising variables\nmatrix_index = int(input())\ni = 1\nmatrix_store = {}\nsum_set = []\nfinal_sum = 0\nr, v, o = 1, 1, 1\nlist_store = []\nn = ''\n\n# storing matrix structure\nwhile i <= matrix_index:\n matrix_row = list(input()) + [' ']\n matrix_store[i] = matrix_row\n list_store = []\n for t in matrix_store[i]:\n if t != ' ':\n n = str(n) + t\n if t == ' ':\n list_store = list_store + [n]\n n = ' '\n matrix_store[i] = list_store\n i += 1\n\n# creating list of all good elements\nwhile v <= matrix_index:\n while r <= matrix_index:\n if r <= (matrix_index+1)/2:\n if r == (matrix_index+1)/2:\n sum_set = sum_set + matrix_store[v]\n elif r == 1:\n sum_set = sum_set + [matrix_store[v][0]] + [matrix_store[v][((matrix_index-1)//2)]] + [matrix_store[v][matrix_index-1]]\n else:\n sum_set = sum_set + [matrix_store[v][r-1]] + [matrix_store[v][matrix_index-1-r]] + [matrix_store[v][matrix_index-r]]\n if matrix_index >= r > (matrix_index+1)/2:\n if r == matrix_index:\n sum_set = sum_set + [matrix_store[v][0]] + [matrix_store[v][((matrix_index-1)//2)]] + [matrix_store[v][matrix_index-1]]\n else:\n sum_set = sum_set + [matrix_store[v][r - (matrix_index-1)//2 - 1]] + [matrix_store[v][((matrix_index-1)//2)]] + [matrix_store[v][r-1]]\n r += 1\n v += 1\n\n# printing sum\nfor z in sum_set:\n final_sum = final_sum + int(z)\nprint(final_sum)\n", "def good_element_sum(matrix):\r\n n=len(matrix)\r\n middle=n//2\r\n d1_sum=sum(matrix[i][i] for i in range(n))\r\n d2_sum=sum(matrix[i][n-i-1] for i in range(n))\r\n mr_sum=sum(matrix[middle][j] for j in range(n))\r\n mc_sum=sum(matrix[j][middle] for j in range(n))\r\n minus_term=matrix[middle][middle]\r\n return d1_sum+d2_sum+mr_sum+mc_sum -minus_term*3\r\n \r\nwhile True:\r\n try:\r\n n=int(input())\r\n matrix=[]\r\n for _ in range(n):\r\n row=list(map(int,input().split()))\r\n matrix.append(row)\r\n sum=good_element_sum(matrix)\r\n print(sum)\r\n except:\r\n break", "from math import ceil\r\nn = int(input())\r\nm = []\r\n\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n m.append(l)\r\n\r\nc = 0\r\nfor i in range(n):\r\n c += m[i][int(ceil(n/2)-1)]\r\n m[i][int(ceil(n/2)-1)] = 0\r\n c += m[int(ceil(n/2)-1)][i]\r\n m[int(ceil(n/2)-1)][i] = 0\r\n c += m[i][i]\r\n m[i][i] = 0\r\n\r\naux = n-1\r\nfor i in range(n):\r\n c += m[i][aux]\r\n aux -= 1\r\n\r\nprint(c)", "n = int(input())\r\nmat = []\r\nres = 0\r\n\r\nfor i in range(n):\r\n row = list(map(int,input().split()))\r\n for j in range(n):\r\n if i == j or i+j == n-1 or i == n//2 or j==n//2:\r\n res += row[j]\r\n\r\nprint(res)\r\n ", "n=int(input())\r\nli=[]\r\nfor _ in range(n):\r\n li.append(list(map(int,input().split())))\r\ntot=0\r\nhalf=n//2\r\nfor i in range(n):\r\n tot+=li[half][i]\r\n tot+=li[i][half]\r\n tot+=li[i][i]\r\n tot+=li[i][n-i-1]\r\nprint(tot-3*li[half][half])\r\n \r\n", "n =int(input())\nsum =0\narr =[ 0 for i in range(n)]\nfor _ in range(n):\n arr[_] =list(map(int, input().split()))\n#main_diagonal\nfor i in range(n):\n if arr[i][i]!=\"x\":\n sum +=arr[i][i]\n arr[i][i] =\"x\"\n\n#secondary diagonal\nz =n-1\nfor j in range(n):\n \n if arr[j][z]!=\"x\":\n sum +=arr[j][z]\n arr[i][z] =\"x\"\n z -=1\nv =n//2\n\nfor i in range(n):\n\n if arr[i][v]!=\"x\":\n sum +=arr[i][v]\n arr[i][v] =\"x\"\n\nfor i in range(n):\n \n if arr[v][i]!=\"x\":\n sum +=arr[v][i]\nprint(sum)", "n=int(input())\r\nx=[]\r\nSum=0\r\nfor i in range(n):\r\n\tx.append(list(map(int,input().split())))\r\nSum+=sum(x[(n-1)//2])\r\nfor i in range(len(x)):\r\n\tSum+=x[i][i]\r\n\tSum+=x[i][n-i-1]\r\n\tSum+=x[i][(n-1)//2]\r\nprint(Sum-((x[(n-1)//2][(n-1)//2])*3))", "n = int(input())\r\na = [[int(s) for s in input().split()] for ss in range(n)]\r\nsum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i == j) or (j == (n - 1) - i) or (j == (n - 1)/2) or (i == (n - 1)/2):\r\n sum += a[i][j]\r\nprint(sum)", "# The place between your comfort zone and your dream is where life takes place. Helen Keller\r\n# by : Blue Edge - Create some chaos\r\n\r\n# import sys\r\n# sys.stdin = open('input.txt', 'r')\r\n\r\nn=int(input())\r\na=[]\r\nans=0\r\nfor x in range(n):\r\n b=list(map(int,input().split()))\r\n ans+=b[x]+b[n-x-1]+b[n//2]\r\n if x==n//2:\r\n ans+=sum(b)\r\n ans-=3*b[n//2]\r\n\r\nprint(ans)\r\n", "n = int(input())\nm = [[0 for _ in range(n)] for _ in range(n)]\ns = 0\nfor i in range(n):\n m[i] = list(map(int, input().split()))\n s += m[i][i] + m[i][n-1-i]\n\nfor i in range(n):\n s += m[i][n//2]\n\nfor i in range(n):\n s += m[n//2][i]\ns -= 3*m[n//2][n//2]\n\nprint(s)\n\n", "a = int(input())\r\ns = [[int(x) for x in input().split()] for x in range(a)]\r\nc = 0\r\nfor i, x in enumerate(s):\r\n for j, y in enumerate(x):\r\n if (i == j) or (i == a - 1 - j) or (i == a // 2) or (j == a // 2):\r\n c += y\r\nprint(c)", "n = int(input())\n\nmatrix = []\n\nfor i in range(n): \n matrix.append(list(map(int, input().split())))\n\n\ntotal = 0\nfor i in range(n): \n for j in range(n): \n if i == j or i+j == n-1 or i == (n-1)/2 or j == (n-1)/2: \n total += matrix[i][j]\nprint(total)\n", "r=int(input())\nd=list(range(r))\nfor i in range(r):\n d[i] = list(map(int, input().split()))\nt=0\n\nfor i in range(r):\n t+=d[i][i]\n d[i][i] = 0\n\nfor i in range(r):\n t+=d[i][r-1-i]\n d[i][r-1-i]=0\n\nfor i in range(r):\n t+=d[r//2][i]\n d[r//2][i]=0\n\nfor i in range(r):\n t+=d[i][r//2]\n d[i][r//2]=0\n\nprint(t)\n", "a = int(input())\r\nresult = 0\r\nfor i in range(a):\r\n b = input().split()\r\n if i == a//2:\r\n for j in b:\r\n result += int(j)\r\n else:\r\n result += int(b[i])\r\n result += int(b[a//2])\r\n result += int(b[-1*i - 1])\r\nprint(result)", "def sol(nums, ans = 0): \r\n \r\n for i in range(len(nums)):\r\n ans += nums[i][i] + nums[i][-1 - i]# Main Diagonal, Secondary Diagonal, accordingly.\r\n if len(nums) % 2 != 0:\r\n ans += nums[i][len(nums) // 2]# Vertical \r\n ans += nums[len(nums) // 2][i]# Horizontal\r\n \r\n if len(nums) % 2 != 0: \r\n ans -= (3 * nums[len(nums) // 2][len(nums) // 2])# Subtracting Centered Point\r\n \r\n return ans\r\n\r\nif __name__ == \"__main__\":\r\n \r\n nums = [[int(x) for x in input().split()] for _ in range(int(input()))]\r\n print (sol(nums))\r\n ", "first = []\r\nnumber = int(input())\r\nsum = 0\r\nfor i in range(number):\r\n first.append(list(map(int, input().split())))\r\nfor j in range(number):\r\n for k in range(number):\r\n if j == k or int(number / 2) == j or int(number / 2) == k or (number - 1) - j == k:\r\n sum += first[j][k]\r\nprint(sum)\r\n", "import math\r\n\r\ndiag = 0\r\nmid = 0\r\na = []\r\nn = int(input())\r\nfor i in range(n):\r\n row = input().split()\r\n for j in range(len(row)):\r\n row[j] = int(row[j])\r\n a.append(row)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i + j == n - 1 or i == j:\r\n diag += a[i][j]\r\n if i == (n-1)//2 or j == (n-1)//2:\r\n mid += a[i][j]\r\nnice_sum = diag + mid - a[(n-1)//2][(n-1)//2]\r\nprint(nice_sum)\r\n \r\n \r\n \r\n", "def main():\r\n n = int(input())\r\n m = acceptMatrix(n)\r\n bools = booleanMatrix(n)\r\n\r\n b = 0\r\n for a in range(n):\r\n bools[a][b] = True\r\n b += 1\r\n\r\n d = n-1\r\n for c in range(n):\r\n bools[c][d] = True\r\n d -= 1\r\n\r\n e = n // 2\r\n\r\n for f in range(n):\r\n bools[e][f] = True\r\n\r\n for g in range(n):\r\n bools[g][e] = True\r\n\r\n total = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if bools[i][j]:\r\n total += m[i][j]\r\n\r\n return total\r\n\r\ndef acceptMatrix(n):\r\n matrix = []\r\n\r\n for i in range(n):\r\n row = [int(i) for i in input().split()]\r\n matrix.append(row)\r\n\r\n return matrix\r\n\r\ndef booleanMatrix(n):\r\n matrix = []\r\n\r\n for i in range(n):\r\n matrix.append([False for j in range(n)])\r\n\r\n return matrix\r\n\r\nprint(main())\r\n", "n = int(input())\r\nL = []\r\nfor i in range(n):\r\n l = [int(a) for a in input().split(\" \",n-1)]\r\n L.append(l)\r\ns = 0\r\nfor i in range(n):\r\n s = s+ L[i][i]+L[i][n-1-i]+L[i][(n-1)//2]\r\nprint(s+sum(L[(n-1)//2])-3*(L[(n-1)//2][(n-1)//2]))", "# A2. Good Matrix Elements\r\n\r\nn = int(input())\r\n\r\na = list()\r\nfor _ in range(n):\r\n a.append(list(map(int, input().split())))\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n ans += a[i][j]\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if n - i - 1 == j:\r\n ans += a[i][j]\r\n\r\ni = n // 2\r\nfor j in range(n):\r\n ans += a[i][j]\r\n\r\nj = n // 2\r\nfor i in range(n):\r\n ans += a[i][j]\r\n\r\nans -= 3 * a[n//2][n//2]\r\n\r\nprint(ans)\r\n", "n = int(input())\r\narr = [ ]\r\nfor i in range(n):\r\n c = list(map(int,input().split(' ')))\r\n arr.append(c)\r\ni,j,k,l = 0,0,n-1,0\r\nsum = 0\r\nrow,column = 0,0\r\nmid = (n-1)//2\r\nnow = (n-1)//2\r\nwhile(i != n):\r\n if mid == row:\r\n for val in arr[now]:\r\n sum+=val\r\n else:\r\n sum += arr[row][i]+ arr[row][mid]+arr[row][k]\r\n i = i+1\r\n j = j+1\r\n k = k-1\r\n l = l+1\r\n row = row+1\r\nprint(sum) ", "n=int(input());a=[];s=0\r\nfor i in range(n) :\r\n b=list(map(int,input().split()))\r\n a.append(b)\r\nfor i in range(n) :\r\n for j in range(n) :\r\n if i==j :\r\n s=s+a[i][j]\r\n elif i+j==n-1 :\r\n s=s+a[i][j]\r\ns=s+sum(a[(n-1)//2])\r\nfor i in range(n) :\r\n s=s+a[i][n//2]\r\nprint(s-2*a[n//2][n//2])\r\n", "n = int(input())\r\na = [list(map(int,input().split())) for _ in range(n)]\r\nsum = 0\r\nfor i in range(n):\r\n sum += a[i][i]\r\n a[i][i] = 0\r\n sum += a[-1-i][i]\r\n a[-1-i][i] = 0\r\n sum += a[n//2][i]\r\n a[n//2][i] = 0\r\n sum += a[i][n//2]\r\n a[i][n//2] = 0\r\n\r\nprint(sum)", "n=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n lst.append([int(x) for x in input().split()])\r\npos=[]\r\nfor i in range(0,n):\r\n if [i,i] not in pos:\r\n pos.append([i,i])\r\n if [i,n-1-i] not in pos:\r\n pos.append([i,n-1-i])\r\n if [i,(n-1)//2] not in pos:\r\n pos.append([i,(n-1)//2])\r\n if [(n-1)//2,i] not in pos:\r\n pos.append([(n-1)//2,i])\r\nres=0\r\nfor i in range(len(pos)):\r\n res+=lst[pos[i][0]][pos[i][1]]\r\nprint(res)", "s = input().split()\r\nn = int(s[0])\r\na = []\r\nfor i in range(1, 110) :\r\n a.append(0)\r\nfor i in range(1, n + 1) :\r\n s1 = input().split()\r\n for j in range(1, n + 1) :\r\n a[(i - 1) * n + j] = int(s1[j - 1])\r\ns = 0\r\nfor i in range(1, n + 1) :\r\n s += a[(i - 1) * n + i] + a[(n - i) * n + i] + a[n // 2 * n + i] + a[(i - 1) * n + n // 2 + 1]\r\nprint(s - 3 * a[n // 2 * n + n // 2 + 1])", "def solve():\r\n size = int(input())\r\n mat = tuple(tuple(map(int, input().split())) for _ in range(size))\r\n result = sum(mat[size // 2])\r\n \r\n for i in range(size):\r\n if i != size // 2:\r\n result += mat[i][i] + mat[i][size // 2] + mat[i][size - i - 1]\r\n \r\n print(result)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()", "import time\r\n\r\n\r\ndef calculateGoodElements(nn, mat):\r\n sum = 0\r\n sum += sumDiagonal1(nn, mat)\r\n sum += sumDiagonal2(nn, mat)\r\n sum += sumMiddleRow(nn, mat)\r\n sum += sumMiddleCol(nn, mat)\r\n\r\n return sum\r\n\r\n\r\ndef sumDiagonal1(nn, mat):\r\n diagSum = 0\r\n for x in range(nn):\r\n diagSum += mat[x][x]\r\n return diagSum\r\n\r\ndef sumDiagonal2(nn, mat):\r\n diagSum = 0\r\n inx = 0\r\n for x in range(nn-1,-1,-1):\r\n if not inx == x:\r\n diagSum += mat[inx][x]\r\n inx +=1\r\n\r\n return diagSum\r\n\r\ndef sumMiddleRow(nn, mat):\r\n middleSum = 0\r\n inx = (nn - 1) // 2\r\n for x in range(nn):\r\n if not inx == x:\r\n middleSum += mat[inx][x]\r\n\r\n return middleSum\r\n\r\n\r\ndef sumMiddleCol(nn, mat):\r\n middleSum = 0\r\n inx = (nn - 1) // 2\r\n\r\n for x in range(nn):\r\n if not inx == x:\r\n middleSum += mat[x][inx]\r\n\r\n return middleSum\r\n\r\n\r\ndef solve():\r\n nn = int(input())\r\n mat = []\r\n\r\n for x in range(nn):\r\n row = [int(x) for x in input().split()]\r\n mat.append(row)\r\n\r\n print(calculateGoodElements(nn, mat))\r\n\r\n\r\n # print(\"%fs\" % (time.time() - start_time))\r\n\r\n\r\nsolve()\r\n", "# 4A\n# if __name__ == '__main__':\n# w = int(input())\n# if w > 2 and (w & 1) == 0:\n# print(\"YES\")\n# else:\n# print(\"NO\")\n\n# 263A\n# if __name__ == '__main__':\n# mat = []\n# for i in range(5):\n# row = list(map(int, input().strip().split()))\n# mat.append(row)\n# x, y = -1, -1\n# for i in range(5):\n# for j in range(5):\n# if mat[i][j] == 1:\n# x, y = i + 1, j + 1\n# break\n# if x != -1 and y != -1:\n# break\n# res = abs(x - 3) + abs(y - 3)\n# print(res)\n\n# 509A\n# if __name__ == '__main__':\n# n = int(input())\n# dp = [[0] * n for _ in range(n)]\n# for i in range(n):\n# dp[i][0] = 1\n# for j in range(n):\n# dp[0][j] = 1\n# for i in range(1, n):\n# for j in range(1, n):\n# dp[i][j] = dp[i - 1][j] + dp[i][j - 1]\n# print(dp[n - 1][n - 1])\n\n# 96A\n# if __name__ == '__main__':\n# s = str(input())\n# n = len(s)\n# preCh, preAns, suc = s[0], 1, 1\n# for i in range(1, n):\n# if s[i] == preCh:\n# preAns += 1\n# else:\n# preCh, preAns = s[i], 1\n# if preAns == 7:\n# print(\"YES\")\n# suc = 0\n# break\n# if suc == 1:\n# print(\"NO\")\n\n# 1144A\n# if __name__ == '__main__':\n# t = int(input())\n# for i in range(t):\n# s = str(input())\n# s = sorted(list(s))\n# n = len(s)\n# suc = 1\n# for i in range(1, n):\n# if ord(s[i - 1]) + 1 != ord(s[i]):\n# suc = 0\n# break\n# if suc == 1:\n# print(\"Yes\")\n# else:\n# print(\"No\")\n\n# 1566B - 思维\n# if __name__ == '__main__':\n# T = int(input())\n# for t in range(T):\n# s = str(input())\n# n = len(s)\n# cur, t = s[0], \"\"\n# for i in range(1, n):\n# if s[i] != cur:\n# t += cur\n# cur = s[i]\n# t += cur\n# if t == \"1\":\n# print(0)\n# elif t == \"0\" or t == \"01\" or t == \"10\" or t == \"101\":\n# print(1)\n# else:\n# print(2)\n\n# 1680A - 构造\n# if __name__ == '__main__':\n# t = int(input())\n# for i in range(t):\n# n = int(input())\n# res = [2]\n# for j in range(1, n):\n# res.append(res[j - 1] + 1)\n# for j in range(n - 1):\n# print(res[j], end=\" \")\n# print(res[n - 1])\n\n# 38A\n# if __name__ == '__main__':\n# n = int(input())\n# d = list(map(int, input().strip().split()))\n# a, b = list(map(int, input().strip().split()))\n# preSum = [0] * n\n# for i in range(n - 1):\n# preSum[i + 1] = preSum[i] + d[i]\n# print(preSum[b - 1] - preSum[a - 1])\n\n# 160A\n# if __name__ == '__main__':\n# n = int(input())\n# a = list(map(int, input().strip().split()))\n# a.sort(reverse=True)\n# cur, tot, res = 0, sum(a), 0\n# for i in range(n):\n# cur += a[i]\n# res += 1\n# if 2 * cur > tot:\n# break\n# print(res)\n\n# 1296B\n# if __name__ == '__main__':\n# t = int(input())\n# for i in range(t):\n# s = int(input())\n# res = 0\n# while s:\n# if s < 10:\n# res += s\n# break\n# else:\n# res += (s // 10) * 10\n# s = s % 10 + s // 10\n# print(res)\n\n# 598A\n# if __name__ == '__main__':\n# t = int(input())\n# for i in range(t):\n# n = int(input())\n# res = n * (n + 1) // 2\n# cur = 1\n# while cur <= n:\n# res -= 2 * cur\n# cur <<= 1\n# print(res)\n\n# 1380A\n# if __name__ == '__main__':\n# t = int(input())\n# for i in range(t):\n# n = int(input())\n# p = list(map(int, input().strip().split()))\n# leftMinPos = [0] * n; leftMinPos[0] = 0\n# for i in range(1, n):\n# leftMinPos[i] = leftMinPos[i - 1]\n# if p[i] < p[leftMinPos[i]]:\n# leftMinPos[i] = i\n# rightMinPos = [0] * n; rightMinPos[n - 1] = n - 1\n# for i in range(n - 2, -1, -1):\n# rightMinPos[i] = rightMinPos[i + 1]\n# if p[i] < p[rightMinPos[i]]:\n# rightMinPos[i] = i\n# suc = 0\n# for i in range(1, n - 1):\n# if p[leftMinPos[i - 1]] < p[i] and p[i] > p[rightMinPos[i + 1]]:\n# print(\"YES\")\n# print(leftMinPos[i - 1] + 1, i + 1, rightMinPos[i + 1] + 1)\n# suc = 1\n# break\n# if suc == 0:\n# print(\"NO\")\n\nif __name__ == '__main__':\n n = int(input())\n mat = []\n for i in range(n):\n row = list(map(int, input().strip().split()))\n mat.append(row)\n res = 0\n for i in range(n):\n res += mat[i][i]; mat[i][i] = 0\n res += mat[i][n - 1 - i]; mat[i][n - 1 - i] = 0\n res += mat[n // 2][i]; mat[n // 2][i] = 0\n res += mat[i][n // 2]; mat[i][n // 2] = 0\n print(res)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Apr 3 00:27:06 2020\r\n\r\n@author: odraodE\r\n\"\"\"\r\n\r\n'''\r\nTESTO DELL'ESERCIZIO https://codeforces.com/problemset/problem/177/A2\r\n'''\r\n\r\na=input()\r\na=int(a)\r\nmatrix=[]\r\nl=[]\r\nfor x in range(a):\r\n k=input().split()\r\n matrix.append(k)\r\n \r\nsomma=0\r\nmatr=[]\r\n\r\n\r\nfor x in range(a):\r\n for y in range(a):\r\n if x==y:\r\n if int(matrix[x][y])!=-1:\r\n somma=somma+int(matrix[x][y])\r\n matrix[x][y]='-1'\r\n\r\nk=a-1\r\nfor x in range(a):\r\n if int(matrix[x][k])!=-1:\r\n somma=somma+int(matrix[x][k])\r\n matrix[x][k]='-1'\r\n k-=1\r\n\r\n\r\n\r\nk=int(a/2)\r\n\r\n\r\nfor x in range(a):\r\n\r\n if int(matrix[x][k])!=-1:\r\n somma=somma+int(matrix[x][k])\r\n matrix[x][k]='-1'\r\n if int(matrix[k][x])!=-1:\r\n somma=somma+int(matrix[k][x])\r\n matrix[k][x]='-1'\r\n\r\n\r\nprint(somma)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#In the name of GOD!\nn = int(input())\na = []\nfor i in range(n):\n\ta.append(list(map(int, input().split())))\n\nans = 0\nfor i in range(n):\n\tfor j in range(n):\n\t\tif i == j or n - 1 - i == j or n // 2 == i or n // 2 == j:\n\t\t\t ans += a[i][j]\n\nprint(ans)\n", "n = int(input())\r\n\r\nmatrix = []\r\nresult = 0\r\n\r\nfor _ in range(n):\r\n myRow = list(map(int, input().split()))\r\n matrix.append(myRow)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i == n - j - 1 or i == n // 2 or j == n // 2:\r\n result += matrix[i][j]\r\n\r\nprint(result)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Jan 12 17:03:03 2023\r\n\r\n@author: 21pt34\r\n\"\"\"\r\n\r\nn=int(input())\r\narray=[list(map(int,input().split()))for j in range(0,n)]\r\nsum1=0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if i==j or i+j==n-1 or i==(n-1)/2 or j==(n-1)/2:\r\n sum1=sum1+array[i][j]\r\nprint(sum1)\r\n", "N = int(input())\r\nmat = []\r\nfor _ in range(N):\r\n mat.append(list(map(int,input().split())))\r\n\r\ns = 0\r\nfor i in range(N):\r\n s += mat[i][N//2] + mat[i][i] + mat[N-i-1][i]\r\n\r\nfor j in range(N):\r\n s += mat[N//2][j]\r\n\r\nprint(s - (3 * mat[N//2][N//2]))\r\n\r\n ", "\"\"\"\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\n II OO OO II\r\nIIIIIIIIII OOOOOOOOOOO IIIIIIIIII\r\n\"\"\"\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n\ta = list(map(int, input().split()))\r\n\tarr.append(a)\r\ntotal = 0\r\nfor b in range(n):\r\n\ttotal += arr[b][b]\r\n\tarr[b][b] = 0\r\nfor c in range(n):\r\n\ttotal += arr[c][n - 1 - c]\r\n\tarr[c][n - 1 - c] = 0\r\nfor d in range(n):\r\n\ttotal += arr[d][(n - 1) // 2]\r\n\tarr[d][(n - 1) // 2] = 0\r\nfor e in range(n):\r\n\ttotal += arr[(n - 1) // 2][e]\r\n\tarr[(n - 1) // 2][e] = 0\r\nprint(total)\r\n\t\r\n\r\n\t\r\n\t\r\n\r\n\t\r\n\t\t\r\n\t\t\r\n\t\r\n", "n = int(input())\r\nl = []\r\ns = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n l.append(a)\r\n\r\nfor i in range(len(l)):\r\n for j in range(len(l[i])):\r\n if(i==j):\r\n s+=l[i][j]\r\n elif((i+j)==n-1):\r\n s+=l[i][j]\r\n elif(j==(n-1)/2):\r\n s+=l[i][j]\r\n elif(i==(n-1)/2):\r\n s+=l[i][j]\r\nprint(s)\r\n", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n row = map(int, input().split())\r\n for j, v in enumerate(row):\r\n if i == j or i + j == n - 1 or i == n // 2 or j == n // 2:\r\n res += v\r\n\r\nprint(res)\r\n", "n = int(input())\r\ngrid = []\r\nfor r in range(n):\r\n row = [int(x) for x in input().split()]\r\n grid.append(row)\r\ntot = 0\r\nfor r in range(n):\r\n for c in range(n):\r\n if r == c or r + c == n-1 or r == n//2 or c == n//2:\r\n tot += grid[r][c]\r\nprint(tot)", "x = int(input())\r\n\r\na = []\r\nb = []\r\n\r\nfor i in range(x):\r\n b.append(list(map(int, input().split(\" \"))))\r\n\r\nc = b[x//2][x//2]\r\nb[x//2][x//2] = 0\r\na = a + b[x//2]\r\n\r\nfor i in b:\r\n a.append(i[x//2])\r\n\r\nfor i in range(x):\r\n for j in range(x):\r\n if i == j:\r\n a.append(b[i][j])\r\n else:\r\n pass\r\n\r\nfor i in reversed(range(x)):\r\n for j in range(x):\r\n if i + j == x - 1:\r\n a.append(b[i][j])\r\n else:\r\n pass\r\n\r\nprint(sum(a) + c)", "\r\n# UEM algorithm challenge codechef :- \r\n\r\n'''import math\r\ns=0;\r\ndef isperfect(n):\r\n t=int(math.sqrt(n));\r\n if((t*t)==n):\r\n return True;\r\n else:\r\n return False;\r\ndef isnotprimefactors(n):\r\n l=[]\r\n for i in range(1,(n//2)+1):\r\n if n%i==0:\r\n if i not in l:\r\n l.append(i)\r\n if n//i not in l:\r\n l.append(n//i)\r\n t=len(l)\r\n for i in range(2,math.floor(math.sqrt(t))+1):\r\n if t%i==0:\r\n return 0;\r\n return t; \r\nn=int(input())\r\nfor j in range(0,n):\r\n p=input().rstrip().split(' ')\r\n a=int(p[0])\r\n b=int(p[1])\r\n R=0;\r\n for i in range(a,b+1):\r\n if(i!=1 and isperfect(i)):\r\n R+=isnotprimefactors(i)\r\n print(R)'''\r\n\r\n# reverse it codeforces unknown language.....!\r\n\r\n'''s=input().rstrip()\r\nx=list(s)\r\nif x[0]=='-':\r\n for i in range(1,len(x)):\r\n if x[1]=='0':\r\n del(x[1])\r\n for i in range(len(x)-1,-1,-1):\r\n if x[len(x)-1]=='0':\r\n del(x[len(x)-1])\r\n del(x[0])\r\n x.reverse();\r\n print(\"-\",end='')\r\n print(''.join(x))\r\nelse:\r\n for i in range(1,len(x)):\r\n if x[0]=='0':\r\n del(x[0])\r\n for i in range(len(x)-1,-1,-1):\r\n if x[len(x)-1]=='0':\r\n del(x[len(x)-1])\r\n x.reverse();\r\n print(''.join(x))'''\r\n\r\n\r\n\r\nn=int(input())\r\nl=[]\r\nT=n//2;\r\nfor i in range(0,n):\r\n p=input().rstrip().split(' ')\r\n l.append(p)\r\nif n==1:\r\n print(l[0][0])\r\nelse:\r\n C=int(l[T][T])\r\n S=0;\r\n for i in range(0,len(l)):\r\n for j in range(0,len(l[i])):\r\n if (i+j)==n-1:\r\n S+=int(l[i][j])\r\n if i==j:\r\n S+=int(l[i][j])\r\n if i==T:\r\n S+=int(l[i][j])\r\n if j==T:\r\n S+=int(l[i][j])\r\n print(S-(3*C))\r\n", "n = int(input())\r\nls = []\r\nsume = 0\r\nfor i in range(n):\r\n ls.append(list(map(int, input().split(\" \"))))\r\nfor i in range(0, n):\r\n for j in range(0, n):\r\n if i + j == (n - 1) or i == j or i == n // 2 or j == n // 2:\r\n sume += ls[i][j]\r\nprint(sume)", "case = int(input())\r\nl = list()\r\nfor i in range(case):\r\n l.append(list(map(int, input().strip().split())))\r\n\r\nmiddle = int((case-1) / 2)\r\ntot = 0\r\n# turn the middle value to zero\r\ntot += l[middle][middle]\r\nl[middle][middle] = 0\r\n\r\n#both diag, row and column value\r\nfor i in range(case):\r\n tot += l[i][i]\r\n tot += l[i][case-1-i]\r\n tot += l[i][middle]\r\ntot += sum(l[middle])\r\n\r\nprint(tot)", "n=int(input())\r\nx=0\r\nl1=[]\r\nwhile x<n:\r\n l1.append(list(map(int,input().split(\" \"))))\r\n x=x+1\r\nsum=0\r\nmid=(n-1)/2\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==mid:\r\n sum=sum+l1[i][j]\r\n elif j==mid:\r\n sum=sum+l1[i][j]\r\n elif i==j:\r\n sum=sum+l1[i][j]\r\n elif i+j==n-1:\r\n sum=sum+l1[i][j]\r\nprint(sum)\r\n ", "n=int(input())\nmatrix={}\nfor i in range(n):\n\trow=input().split(\" \")\n\trow=[int(row[i]) for i in range(n)]\n\tmatrix[i]=row\nsume=0\nfor i in range(n):\n\tsume+=matrix[i][i]\nj=-1\nfor i in range(n):\n\tsume+=matrix[i][j]\n\tj-=1\n\tif j<-n:\n\t\tbreak\nj=int(((n+1)/2)-1)\nfor i in range(n):\n\tsume+=matrix[i][j]\nsume+=sum(matrix[j])\nsume-=3*(matrix[j][j])\nprint(sume)\n", "n = int(input())\r\n\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().split())))\r\n\r\nsum = 0\r\nrow = (n-1) // 2\r\ncol = row \r\nfor i in range(n):\r\n sum += matrix[row][i]\r\n sum += matrix[i][col]\r\n sum += matrix[i][i]\r\n sum += matrix[i][n-i-1]\r\n\r\nsum -= 3*matrix[row][col]\r\n\r\nprint(sum)", "n=int(input())\r\nx=[]\r\nSum=0\r\nfor i in range(n):\r\n\tx.append(list(map(int,input().split())))\r\nif n%2!=0:\r\n\tSum+=sum(x[(n-1)//2])\r\n\tfor i in range(len(x)):\r\n\t\tSum+=x[i][i]\r\n\t\tSum+=x[i][n-i-1]\r\n\t\tSum+=x[i][(n-1)//2]\r\n\tprint(Sum-((x[(n-1)//2][(n-1)//2])*3))\r\nelse:\r\n\tSum+=sum(x[n//2])\r\n\tfor i in range(len(x)):\r\n\t\tSum+=x[i][i]\r\n\t\tSum+=x[i][n-i]\r\n\t\tSum+=x[i][n//2]\r\n\tprint(Sum-((x[n//2][n//2])*3))", "n=int(input())\r\nli1=[]\r\nsum=0\r\nfor i in range(n):\r\n li=list(map(int,input().split()))\r\n li1.append(li)\r\n li=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i==j) or (j==n//2) or (i==n//2) or (i+j==n-1):\r\n sum+=li1[i][j]\r\nprint(sum)", "x = int(input())\r\na = []\r\ns = 0\r\nk = 0\r\nl = 0\r\nm = 0\r\nfor i in range(x):\r\n\ta.append(input().split())\r\nfor i in range(x):\r\n\ts=s+int(a[i][i])\r\n\tk=k+int(a[int(x/2)][i])\r\n\r\n\tm=m+int(a[i][x-i-1])\r\n\tl=l+int(a[i][int(x/2)])\r\nprint((s+k+l+m)-(3*int(a[int(x/2)][int(x/2)])))", "import math\r\n\r\nsize = int(input())\r\n\r\nlines = []\r\nfor _ in range(size):\r\n lines.append([int(x) for x in input().split()])\r\n\r\naffected_coords = []\r\ncoords_no_dups = []\r\nsum_output = 0\r\n\r\ndef forward_diagonal():\r\n ind = 0\r\n \r\n while ind<size:\r\n affected_coords.append([ind, ind])\r\n ind+=1\r\n\r\ndef backward_diagonal():\r\n ind = 0\r\n size_i = size-1\r\n\r\n while ind<size:\r\n affected_coords.append([ind, size_i-ind])\r\n ind+=1\r\n\r\ndef horizontal():\r\n # double check this\r\n row=math.floor(size/2)\r\n \r\n for x in range(size):\r\n affected_coords.append([row, x])\r\n\r\ndef vertical():\r\n # double check this\r\n column=math.floor(size/2)\r\n \r\n for row in range(size):\r\n affected_coords.append([row, column])\r\n\r\ndef no_duplicates():\r\n for coord in affected_coords:\r\n if coord not in coords_no_dups:\r\n coords_no_dups.append(coord)\r\n\r\ndef producing_sum():\r\n \r\n global sum_output\r\n \r\n for coord in coords_no_dups:\r\n sum_output+=lines[coord[0]][coord[1]]\r\n\r\nforward_diagonal()\r\nbackward_diagonal()\r\nhorizontal()\r\nvertical()\r\nno_duplicates()\r\nproducing_sum()\r\n\r\n# print(len(coords_no_dups))\r\n# print(coords_no_dups)\r\nprint(sum_output)", "n = int(input())\r\na=[]\r\ns=0\r\nfor j in range(n):\r\n a.append([int(i) for i in input().split()])\r\nfor i in range(n):\r\n s+=a[i][(n-1)//2]\r\n s+=a[(n-1)//2][i]\r\n s+=a[i][i]\r\n s+=a[i][n-1-i] \r\nprint(s-3*a[(n-1)//2][(n-1)//2])", "n = int(input())\r\nl = []; s = 0\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n s += l[i][i] + l[i][n - i - 1] + l[n // 2][i] + l[i][n // 2]\r\nprint(s - 3 * l[n//2][n//2])", "n = int(input())\ntotal = 0\nb = []\na = []\nfor i in range(n):\n\tb = list(map(int, input().split()))\n\ta.append(b)\n\tb = []\nfor i in range(n):\n\ttotal += a[i][i]\n\ta[i][i] = 0\nfor i in range(n):\n\ttotal += a[i][(n-1)-i]\n\ta[i][(n-1)-i] = 0\nfor i in range(n):\n\ttotal += a[((n+1)//2)-1][i]\n\ta[((n+1)//2)-1][i] = 0\nfor i in range(n):\n\ttotal += a[i][((n+1)//2)-1]\n\ta[i][((n+1)//2)-1] = 0\nprint(total)\t\n\t \n\t\t\n", "\r\n\r\nn = int(input())\r\nmat = []\r\ns = 0\r\nfor i in range(n):\r\n\tl1 = list(map(int,input().split()))\r\n\tmat.append(l1)\r\n\r\ns-= 3*mat[n//2][n//2]\r\nfor i in range(n):\r\n\ts+=mat[i][i]\r\n\ts+=mat[i][n-i-1]\r\n\ts+=mat[n//2][i]\r\n\ts+=mat[i][n//2]\r\nprint(s)", "# https://codeforces.com/problemset/problem/177/A1\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n numbers = tuple(map(int, input().split()))\r\n if i == n // 2:\r\n ans += sum(numbers)\r\n else:\r\n ans += numbers[i % (n // 2)] + numbers[n // 2] + numbers[n - 1 - (i % (n // 2))]\r\nprint(ans)\r\n\r\n", "# import sys\r\n# sys.stdin=open(\"test11.in\",\"r\")\r\n# sys.stdout=open(\"test11.out\",\"w\")\r\n\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n\tp=list(map(int,input().split()))\r\n\ta.append(p)\r\ns=0\r\ns+=sum(a[(n-1)//2])\r\nfor i in range(n):\r\n\ts+=a[i][(n-1)//2]\r\nfor i in range(n):\r\n\ts+=a[i][i]\r\n\ts+=a[(n-1)-i][0+i]\r\nprint(s-3*a[(n-1)//2][(n-1)//2])\r\n", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n if i != n//2:\r\n k=k+l[i]+l[n//2]+l[-i-1]\r\n else:\r\n k+=sum(l)\r\nprint(k)", "n=int(input())\r\nb=[]\r\ns=0\r\nfor i in range(n):\r\n a=[]\r\n a=list(map(int,input().split()))[:n]\r\n b.append(a)\r\nx=n//2\r\nfor i in range(n):\r\n s=s+b[i][i]\r\nfor i in range(n):\r\n s=s+b[i][n-1-i]\r\nfor i in range(n):\r\n s=s+b[x][i]\r\nfor i in range(n):\r\n s=s+b[i][x]\r\nprint(s-(3*b[x][x]))\r\n\r\n \r\n", "n = int(input())\r\nsoma = 0\r\nmatriz = []\r\n\r\nmeio = (n-1)//2\r\n\r\nfor _ in range(n):\r\n linha=[int(x) for x in input().split()]\r\n matriz.append(linha)\r\n\r\n# Diagonal Principal\r\n\r\ndiag_sec = n - 1\r\n\r\nfor i in range(n):\r\n\r\n soma += matriz[i][i]\r\n soma += matriz[i][diag_sec]\r\n soma += matriz[i][meio]\r\n soma += matriz[meio][i]\r\n diag_sec -= 1\r\n\r\nsoma -= (matriz[meio][meio] * 3)\r\n\r\nprint(soma)", "n=int(input())\r\na=[]\r\na.append([0]*(n+2))\r\nfor i in range(1,n+1):\r\n x=[0]+list(map(int,input().split()))+[0]\r\n a.append(x)\r\na.append([0]*(n+2))\r\nans=0\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if (i==j) or (i+j==n+1) or (i==(n+1)//2) or (j==(n+1)//2):\r\n ans+=a[i][j]\r\nprint(ans) ", "n = int(input())\r\n\r\narr = []\r\nfor i in range(n):\r\n arr += [[\" \"]*n]\r\n x = input().split()\r\n for j in range(n):\r\n arr[i][j] = x[j]\r\n##\r\n##for i in range(n):\r\n## for j in range(n):\r\n## print(arr[i][j], end=\" \")\r\n## print()\r\n\r\n\r\ncount=0\r\n\r\nfor i in range(n) :\r\n count+=int(arr[i][i])\r\n arr[i][i]=\"0\"\r\n\r\nfor i in range(n) :\r\n count+=int(arr[i][n-1-i])\r\n arr[i][n-1-i]=\"0\"\r\n\r\nfor i in range(n) :\r\n count+=int(arr[n//2][i])\r\n arr[n//2][i]=\"0\"\r\n\r\nfor i in range(n) :\r\n count+=int(arr[i][n//2])\r\n arr[i][n//2]=\"0\"\r\n\r\nprint(count)\r\n##print(arr)", "n = int(input())\r\na=[]\r\nfor i in range(n):\r\n l = list(map(int, input().split()))\r\n a.append(l)\r\nt =0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if i==j:\r\n t+=a[i][j]\r\n elif i+j==n-1:\r\n t+=a[i][j]\r\n elif i==(n-1)//2:\r\n t+=a[i][j]\r\n elif j==(n-1)//2:\r\n t+=a[i][j]\r\n\r\nprint(t)\r\n\r\n\r\n", "x=int(input())\narr=[]\nfor i in range(x):\n arr.append(list(map(int,input().split())))\ns=0\nfor l in range(x):\n s=s+arr[l][(x-1)//2]\np=0\nfor c in range(x):\n p=p+arr[(x-1)//2][c]\nw=0\nfor v in range(x):\n w=w+arr[v][v]\nh=x-1\nb=0\ng=0\nwhile b<=x-1:\n g=g+arr[b][h]\n b+=1\n h-=1\nq=s+p+w+g-(3*arr[(x-1)//2][(x-1)//2])\nprint(q)\n", "n = int(input())\nsu = 0\nfor i in range(n):\n ar = list(map(int, input().split()))\n for j in range(n):\n if i == j:\n su += ar[j]\n elif i + j == n - 1:\n su += ar[j]\n elif i == int((n - 1) / 2):\n su += ar[j]\n elif j == int((n - 1) / 2):\n su += ar[j]\nprint(su)\n", "n=input()\r\nn=int(n)\r\na=[input().split(' ') for row in range(n)]\r\ntong=0\r\nfor i in range(n):\r\n tong+=int(a[i][i])\r\n tong+=int(a[n-i-1][i])\r\n tong+=int(a[int((n-1)/2)][i])\r\n tong+=int(a[i][int((n-1)/2)])\r\ntong-=3*int(a[int((n-1)/2)][int((n-1)/2)])\r\nprint(tong)\r\n \r\n", "n = int(input())\r\nmatriz = list()\r\ndiagonal = 0\r\ndiagonal_sec = 0\r\nmiddle_row = 0\r\nmiddle_column = 0\r\n\r\nfor i in range(n):\r\n linha = input().split(\" \")\r\n linha = [int(val) for val in linha]\r\n matriz.append(linha)\r\n diagonal += linha[i]\r\n diagonal_sec += linha[n-i-1]\r\n middle_column += int(linha[(n-1)//2])\r\n if i == (n-1)//2:\r\n middle_row = sum(linha)\r\n \r\ngood_elements = diagonal + diagonal_sec + middle_column + middle_row - 3*(matriz[(n-1)//2][(n-1)//2])\r\nprint(good_elements)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\nb=[]\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or i+j==n-1 or i==n//2 or j==n//2 :\r\n b.append(a[i][j])\r\nprint(sum(b))", "n = int(input())\r\na = [[int(i) for i in input().split()] for i in range(n)]\r\nused = [[0 for i in range(n)] for i in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n if used[i][n // 2] == 0:\r\n s += a[i][n // 2]\r\n used[i][n // 2] = 1\r\n if used[n // 2][i] == 0:\r\n s += a[n // 2][i]\r\n used[n // 2][i] = 1\r\n if used[i][i] == 0:\r\n s += a[i][i]\r\n used[i][i] = 1\r\n if used[n - i - 1][i] == 0:\r\n s += a[n - i - 1][i]\r\n used[n - i - 1][i] = 1\r\nprint(s)", "n=int(input(''))\r\nm=[]\r\nfor i in range(n):\r\n m.append(list(map(int,input('').split())))\r\nsum=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or i==n//2 or j==n//2 or n-1==i+j:\r\n sum+=m[i][j]\r\nprint(sum)", "# cf 177 A2 700\nn = int(input())\nA = []\nfor _ in range(n):\n A.append(list(map(int, input().split())))\nsum_ = 0\nfor i in range(len(A)):\n sum_ += A[i][i] # main diag\n sum_ += A[(n - 1) - i][i] # sec diag\n sum_ += A[(n - 1) // 2][i] # middle row\n sum_ += A[i][(n - 1) // 2] # middle col\nsum_ -= 3 * A[(n - 1) // 2][(n - 1) // 2]\n\nprint(sum_)\n", "def get_sum(a, n):\r\n count = 0\r\n\r\n for i in range(n):\r\n count += a[i][i]\r\n for i in range(n-1, -1, -1):\r\n count += a[i][n-i-1]\r\n count += sum(a[n//2])\r\n for i in range(n):\r\n count += a[i][n//2]\r\n\r\n return count - 3*a[n//2][n//2]\r\n\r\n\r\nn = int(input())\r\ntable = [[int(i) for i in input().split()] for j in range(n)]\r\nif n == 1:\r\n print(table[0][0])\r\nelse:\r\n print(get_sum(table, n))\r\n\r\n", "n = int(input())\r\ntotal = 0\r\nfor i in range(0,n):\r\n a = list(map(int, input().split()))\r\n if i != int(n/2):\r\n total = total + a[i] + a[int(n/2)] + a[n-i-1]\r\n else:\r\n total = total + sum(a)\r\nprint(total)\r\n", "n = int(input())\r\nM = []\r\ns = 0\r\nfor i in range(n): M.append([int(x) for x in input().split()])\r\nfor x in range(n):\r\n for y in range(n):\r\n if x == y or x+y == n-1 or x == (n-1)//2 or y == (n-1)//2: s += M[x][y]\r\nprint(s)\r\n", "s,k=0,0\r\nn=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([int(i) for i in input().split()])\r\nfor i in range(n):\r\n s+=a[i][i]\r\nfor i in range(n-1,-1,-1):\r\n if k!=(n-1)/2:\r\n s+=a[i][k]\r\n k+=1\r\nfor i in range(n):\r\n if i!=(n-1)/2:\r\n s+=a[i][int((n-1)/2)]\r\n s+=a[int((n-1)/2)][i]\r\nprint(s)", "n = int(input())\r\ngrid = []\r\nfor i in range(n):\r\n arr = list(map(int, input().split()))\r\n grid.append(arr)\r\n\r\nans = 0\r\n# Horizontal\r\nmr = len(grid) // 2\r\nfor i in range(len(grid[mr])):\r\n ans += grid[mr][i]\r\n grid[mr][i] = 0\r\n\r\n# Vertical\r\nfor i in range(len(grid)):\r\n ans += grid[i][mr]\r\n grid[i][mr] = 0\r\n\r\n# Main Diagonal (top left to bottom right)\r\ni, e = 0, 0\r\nwhile i < len(grid):\r\n ans += grid[i][e]\r\n grid[i][e] = 0\r\n i += 1\r\n e += 1\r\n\r\n# Main Diagonal (top right to bottom left)\r\na, b = 0, len(grid) - 1\r\nwhile a < len(grid):\r\n ans += grid[a][b]\r\n grid[a][b] = 0\r\n a += 1\r\n b -= 1\r\n\r\n# Secondary diagonal (top-mid to right-mid)\r\nc, d = 0, len(grid) // 2\r\nwhile d < len(grid):\r\n ans += grid[c][d]\r\n grid[c][d] = 0\r\n c += 1\r\n d += 1\r\n\r\n# Secondary diagonal (right-mid to bottom-mid)\r\nf, g = len(grid) - 1, len(grid) // 2\r\nwhile g < len(grid):\r\n ans += grid[g][f]\r\n grid[g][f] = 0\r\n g += 1\r\n f -= 1\r\n\r\n# Secondary diagonal (bottom-mid to left-mid)\r\nj, k = len(grid) - 1, len(grid) // 2\r\nwhile k >= 0:\r\n ans += grid[j][k]\r\n grid[j][k] = 0\r\n j -= 1\r\n k -= 1\r\n\r\n# Secondary diagonal (left-mid to top-mid)\r\nq, w = 0, len(grid) // 2\r\nwhile w >= 0:\r\n ans += grid[w][q]\r\n grid[q][w] = 0\r\n w -= 1\r\n q += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nm = []\r\nfor i in range(n):\r\n row = input()\r\n row = row.split()\r\n for i in range(len(row)):\r\n row[i] = int(row[i])\r\n m.append(row)\r\n\r\ntotal = 0\r\n# middle column\r\nfor i in range(n):\r\n total += m[i][int(n / 2)]\r\n\r\n# middle row\r\nfor i in range(n):\r\n total += m[int(n / 2)][i]\r\n\r\n# main diagonal\r\nfor i in range(n):\r\n total += m[i][i]\r\n\r\n# secondary diagonal\r\nfor i in range(n):\r\n total += m[n - i - 1][i]\r\n\r\ntotal -= 3*(m[int(n / 2)][int(n / 2)])\r\n\r\nprint(total)\r\n", "n=int(input())\r\nmat=[]\r\nfor i in range(0,n):\r\n temp=list(input().split())\r\n mat.append([int(i) for i in temp])\r\nsum=0\r\nfor i in range(0,n):\r\n for j in range(0,n):\r\n if i==j:\r\n sum=sum+mat[i][j]\r\n if i+j==n-1:\r\n sum=sum+mat[i][j]\r\n if i== (n-1)/2:\r\n sum+=mat[i][j]\r\n if j==(n-1)/2:\r\n sum+=mat[i][j]\r\nx=mat[(n-1)//2][(n-1)//2]\r\nsum=sum-3*x\r\nprint(sum)", "n = int(input())\nmatrix = [list(map(int, input().split())) for i in range(n)]\nS = sum(matrix[i][i] + matrix[i][n - i - 1] + matrix[n // 2][i] + matrix[i][n // 2] for i in range(n)) - 3 * matrix[n // 2][n // 2]\nprint(S)", "n=int(input())\r\np=n\r\nls=[]\r\nwhile p:\r\n ps=list(map(int,input().split()))\r\n ls.append(ps)\r\n p-=1\r\nsum=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n sum+=ls[i][j]\r\n ls[i][j]=0\r\n elif i+j==n-1:\r\n sum+=ls[i][j]\r\n ls[i][j]=0\r\n elif i==n//2 or j==n//2:\r\n sum+=ls[i][j]\r\nprint(sum)\r\n\r\n", "'''input\r\n5\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n\r\n\r\n\r\n'''\r\nn = int(input())\r\nmat = []\r\nfor _ in range(n):\r\n\ttemp = []\r\n\ts = input()\r\n\ts = s.split()\r\n\tfor l in s:\r\n\t\ttemp.append(int(l))\r\n\tmat.append(temp)\r\n\r\n\r\n\r\nans = 0\r\nst = (n-1)//2\r\nd = n-1\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i == j and i != st and j != st:\r\n\t\t\tans += mat[i][j]\r\n\r\n\t\tif j == d and j != st:\r\n\t\t\tans += mat[i][j]\r\n\r\n\t\tif j == st and i != st:\r\n\t\t\tans += mat[i][j]\r\n\r\n\t\tif i == st and j != st:\r\n\t\t\tans += mat[i][j]\r\n\td -= 1\r\n\r\nans += mat[st][st]\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\t\t", "n = int(input())\r\n\r\nmatrix = []\r\nfor _ in range(n):\r\n row = list(map(int,input().split()))\r\n matrix.append(row)\r\n\r\nresult = 0\r\n\r\nfor i, row in enumerate(matrix):\r\n for j, col in enumerate(row):\r\n if i == n//2 or j == n//2 or i==j or i+j==n-1:\r\n result+=col\r\n\r\nprint(result)", "import sys, math, itertools, functools, collections\r\nfrom collections import Counter\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nMIN = 10 ** 18\r\nMAX = -10 ** 18\r\n\r\n\r\ndef int_j():\r\n return int(input())\r\n\r\n\r\ndef int_m():\r\n return map(int, input().split())\r\n\r\n\r\ndef list_m():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef occurred_once(arr):\r\n mp = Counter(arr)\r\n for it in mp:\r\n if mp[it] == 1:\r\n return it\r\n\r\n\r\nn = int_j()\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().split())))\r\n\r\nsum = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n sum += matrix[i][j]\r\n elif i == n - 1 - j:\r\n sum += matrix[i][j]\r\n elif i == n // 2:\r\n sum += matrix[i][j]\r\n elif j == n // 2:\r\n sum += matrix[i][j]\r\n\r\nprint(sum)\r\n", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for j in range(n):\r\n if i == n//2 or j == n//2 or (i + j) == n-1 or i == j:\r\n ans += a[j]\r\nprint(ans)", "x=int(input())\r\nl=[]\r\ns=0\r\nfor i in range(x):\r\n l=l+[list(map(int,input().split()))]\r\nfor i in range(x):\r\n for j in range(x):\r\n if i==(x//2) or j==(x//2) or i==j or i+j==x-1:\r\n s=s+l[i][j]\r\nprint(s)\r\n", "import sys\r\nread = sys.stdin.readline\r\nwrite = sys.stdout.write\r\n\r\nn = int(read())\r\na = []\r\nfor i in range(n):\r\n\ta.append(list(map(int, read().split())))\r\n\r\nans = 0\r\nfor i in range(n):\r\n\tans += a[i][i]\r\n\tans += a[i][n-i-1]\r\n\tans += a[i][n//2] + a[n//2][i]\r\n\r\nans -= 3 * a[n//2][n//2]\r\nwrite(str(ans))", "n = int(input())\r\n\r\nacc = 0\r\n\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n for j in range(n):\r\n if (\r\n i == j or\r\n i + j == n - 1 or\r\n j == n // 2 or\r\n i == n // 2\r\n ):\r\n acc += row[j]\r\n \r\n\r\nprint(acc)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split()[:n])))\r\ns=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or i+j==n-1 or i==(n-1)/2 or j==(n-1)/2:\r\n s+=a[i][j]\r\nprint(s)", "\r\nn = int(input())\r\n\r\ngh = [0 for _ in range(n)]\r\narr = [gh[:] for _ in range(n) ]\r\nvisited = [gh[:] for _ in range(n)]\r\n\r\nfor i in range(n):\r\n a = input()\r\n a1 = a.split()\r\n for j in range(n):\r\n arr[i][j] = int(a1[j])\r\n\r\nif n == 1:\r\n print( a) \r\nelse:\r\n middleR = (n - 1) // 2 \r\n middleC = (n - 1 ) // 2\r\n total = 0 \r\n for i in range(n):\r\n if visited[middleR][i] == 0:\r\n visited[middleR][i] = 1\r\n total += arr[middleR][i]\r\n #print(visited)\r\n for i in range(n):\r\n if visited[i][middleC] == 0:\r\n visited[i][middleC] = 1\r\n total += arr[i][middleC]\r\n #print(visited)\r\n \r\n for i in range(n):\r\n if visited[i][i] == 0:\r\n visited[i][i] = 1\r\n total += arr[i][i]\r\n #print(visited)\r\n ku = 0\r\n for i in range(n):\r\n kkt = n - 1 - i \r\n if visited[ku][kkt] == 0:\r\n visited[ku][kkt] = 1\r\n total += arr[ku][kkt]\r\n ku += 1\r\n \r\n #print(visited)\r\n print(total)\r\n \r\n ", "n = int(input())\nd1 = 0\nd2 = n - 1\ns = 0\nfor i in range(n):\n row = [int(e) for e in input().split()]\n s += row[d1] + row[(n-1) // 2] + row[d2]\n if i == ((n-1) // 2):\n s += sum(row)\n middle = row[(n-1) // 2]\n d1 += 1\n d2 -= 1\n\nprint(s - middle * 3)\n", "n = int(input())\r\nsum=0\r\n\r\nfor i in range(n):\r\n lis = list(input().split())\r\n if i != (n-1)/2:\r\n sum+=int(lis[i])+int(lis[int((n-1)/2)])+int(lis[int(n-1-i)])\r\n i+=1\r\n else:\r\n for j in range(n):\r\n sum+=int(lis[j])\r\n\r\nprint(sum)\r\n", "size = int(input())\nmatrix = [[0 for x in range(size)] for y in range(size)] \nfor i in range(size):\n lst = input().split()\n for j in range(size):\n lst[j] = int(lst[j])\n matrix[i] = lst\ntotal = 0\nfor i in range(size):\n for j in range(size):\n if i == j:\n total += matrix[i][j]\n elif i == size - 1 - j:\n total += matrix[i][j]\n elif (size - 1) / 2 == i:\n total += matrix[i][j]\n elif (size - 1) / 2 == j:\n total += matrix[i][j]\nprint(total)", "n = int(input())\r\n\r\nar = []\r\n\r\nfor i in range(n):\r\n r = list(map(int, input().split()))\r\n ar += [r]\r\n \r\nans = 0\r\n\r\nfor i in range(n):\r\n d1 = ar[i][i]\r\n d2 = ar[n - 1 - i][i]\r\n m1 = ar[n // 2][i]\r\n m2 = ar[i][n // 2]\r\n ans += d1 + d2 + m1 + m2\r\nans -= ar[n // 2][n // 2] * 3\r\nprint(ans)", "n = int(input())\r\nw = [list(map(int, input().split())) for _ in range(n)]\r\nd = list(zip(*w))\r\ns = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == n//2 or j == n//2 or j == i or j == n-1-i:\r\n s += w[i][j]\r\n\r\nprint(s)", "n= int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\nan=0\r\nfor i in range(n):\r\n an+=a[n//2][i]\r\n an+=a[i][n//2]\r\n an+=a[i][i]\r\n an+=a[n-1-i][i]\r\nprint(an-3*(a[n//2][n//2]))", "n = int(input())\r\nm = []\r\n\r\nfor _ in range(n):\r\n m.append([int(x) for x in input().split()])\r\n\r\ns = set()\r\nbn = n - 1\r\n\r\n#diagonals\r\nfor i in range(n):\r\n s.add((i, i))\r\n s.add((i, bn - i))\r\n\r\nif n & 1:\r\n\r\n h = n >> 1\r\n \r\n #midrow\r\n for c in range(n):\r\n s.add((h, c))\r\n \r\n #midcol\r\n for r in range(n):\r\n s.add((r, h))\r\n\r\nret = 0\r\nfor t in s:\r\n ret += m[t[0]][t[1]]\r\n\r\nprint(ret)", "# for _ in range(int(input())):\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n arr = list(map(int,input().split()))\r\n\r\n if i==(n//2):\r\n ans+=sum(arr)\r\n else:\r\n ans+=arr[i]+arr[n//2]+arr[-(i+1)]\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "\r\nimport math\r\nfrom math import gcd,floor,sqrt,log\r\ndef iin(): return int(input())\r\ndef sin(): return input().strip()\r\ndef listin(): return list(map(int,input().strip().split()))\r\ndef liststr(): return list(map(str,input().strip().split()))\r\ndef ceill(x): return int(x) if(x==int(x)) else int(x)+1\r\ndef ceilldiv(x,d): x//d if(x%d==0) else x//d+1\r\ndef LCM(a,b): return (a*b)//gcd(a,b)\r\n\r\n\r\ndef solve():\r\n\tn = iin()\r\n\tx = []\r\n\tans = 0\r\n\tfor i in range(n):\r\n\t\tx.append(listin())\r\n\tmid = (n-1)//2\r\n\t#MID ROW\r\n\tans += sum(x[mid])\r\n\tx[mid] = [0 for i in x[mid]]\r\n\t# print(ans)\r\n\t#MID COLUMN\r\n\tfor i in range(n):\r\n\t\tans += x[i][mid]\r\n\t\tx[i][mid] = 0\r\n\t# print(ans)\r\n\t#MAIN DIAGONAL\r\n\tfor i in range(n):\r\n\t\tans += x[i][i]\r\n\t\tx[i][i] = 0\r\n\t# print(ans)\r\n\t#SECOND DIAGONAL\r\n\tfor i in range(n):\r\n\t\tans += x[i][-i-1]\r\n\t\tx[i][-i-1] = 0\r\n\tprint(ans)\r\n\r\n\r\nt = 1 \r\n# t = int(input()) \r\nfor hula in range(t):\r\n\tsolve()\r\n", "n = int(input())\r\nmat = []\r\nfor i in range(n):\r\n l = [int(x) for x in input().split()]\r\n mat.append(l)\r\ns = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i+j == n-1 or i==j or i==n//2 or j==n//2:\r\n s += mat[i][j]\r\nprint(s)", "a=int(input())\r\nb=[]\r\ns=0\r\nn=a-1\r\nfor i in range(a):\r\n b.append(input().split())\r\nfor i in range(a):\r\n s+=int(b[i][a//2])\r\n s+=int(b[a//2][i])\r\n s+=int(b[i][i])\r\n s+=int(b[i][n])\r\n n-=1\r\nprint(s-3*(int(b[a//2][a//2]))) \r\n \r\n \r\n", "n = int(input())\r\n\r\nmain_diagonal = sec_diagonal = 0\r\nmid_row = mid_col = 0\r\nmiddle = (n - 1) // 2 # value of middle x, y index\r\nfor i in range(n):\r\n\tfor index, val in enumerate(input().rsplit(' ')):\r\n\t\tx = int(val)\r\n\r\n\t\t# get the sum of middle column\r\n\t\tif index == middle:\r\n\t\t\tmid_col += x\r\n\r\n\t\t# get the sum of middle row\r\n\t\telif i == middle:\r\n\t\t\tmid_row += x\r\n\r\n\t\t# get the sum of main diagonal\r\n\t\telif i == index:\r\n\t\t\tmain_diagonal += x\r\n\r\n\t\t# get the sum of secondary diagonal\r\n\t\telif (i + index) == (n - 1):\r\n\t\t\tsec_diagonal += x\r\n\r\nprint(main_diagonal + sec_diagonal + mid_row + mid_col)", "n = int(input())\r\ntotal = 0\r\nmatrix = [list(map(int, input().split())) for _ in range(n)]\r\nmid = (n-1)//2\r\nmid_el = matrix[mid][mid]\r\ntotal += sum(matrix[mid])\r\nfor i in range(n):\r\n total += matrix[i][mid] + matrix[i][i] + matrix[n-1-i][i]\r\nprint(total - (3 * mid_el))", "n=int(input())\r\nd=(n//2) #Half\r\ns=0 #Sum\r\nj=0;k=n-1 #For keeping track of diagonals\r\ng=0 #Tells whether to increment the diagonals\r\nfor i in range(n):\r\n\ta=list(map(int, input().split()))\r\n\tif i==d:\r\n\t\ts+=sum(a)\r\n\t\tg=1\r\n\telse:\r\n\t\ts+=a[d] #adding the column\r\n\t\tif g==0:\r\n\t\t\ts+=a[j];s+=a[k]\r\n\t\t\tj+=1;k-=1\r\n\t\telse:\r\n\t\t\tj-=1;k+=1\t#If done later, center in added thrice..\r\n\t\t\ts+=a[j];s+=a[k]\r\nprint(s)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tr=list(map(int,input().split()))\r\n\tl.append(r)\r\ncount=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j or i==(((n+1)/2)-1) or j==(((n+1)/2)-1) or j==n-i-1:\r\n\t\t\tcount=count+l[i][j]\r\nprint(count)", "n=int(input())\r\nl=[]\r\nfor i in range (n):\r\n s=input()\r\n s=s.split()\r\n s=[int(i) for i in s]\r\n l.append(s)\r\n \r\nt=0\r\np=[]\r\nfor i in range (n):\r\n for j in range(n):\r\n x=[i,j]\r\n if(x not in p):\r\n if((i == j) or ((i+j) == n-1) or (i == (n-1)/2) or (j==(n-1)/2)):\r\n t+=l[i][j]\r\n p.append(x)\r\n \r\nprint(t)", "def solve(m,n):\r\n ans = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j or i+j==n-1 or i == (n-1)//2 or j==(n-1)//2 :\r\n ans += mat[i][j]\r\n #ans -= 3* mat[(n-1)//2][(n-1)//2]\r\n return ans\r\n \r\nn = int(input())\r\nmat = []\r\nfor _ in range(n):\r\n mat.append(list(map(int,input().split())))\r\nprint(solve(mat,n))", "n = int(input())\nrows = []\nfor _ in range(0, n):\n rows.append(list(map(int, input().split())))\nmr = [str(i) + \" \" + str(n//2) for i in range(0, n)]\nmc = [str(n//2) + \" \" + str(i) for i in range(0, n)]\npd = [str(i) + \" \" + str(i) for i in range(0, n)]\nsd = [str(i) + \" \" + str(n - i - 1) for i in range(0, n)]\ns = set(mr + mc + pd + sd)\nt = 0\nfor x in s:\n a, b = x.split()\n t += rows[int(a)][int(b)]\nprint(t)\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([int(i) for i in input().split()])\r\n\r\ngoodSum = 0\r\nfor i in range(n):\r\n goodSum += a[i][i] + a[i][n-1-i] + a[n//2][i] + a[i][n//2]\r\n\r\nprint(goodSum - (3 * a[n//2][n//2]))", "n = int(input())\r\ngrid = []\r\nfor i in range(n): \r\n\trow = [int(i) for i in input().split()]\r\n\tgrid.append(row)\r\n\r\nsum = 0\r\nfor i in range(n): \r\n\tfor j in range(n): \r\n\t\tif i == j or i == n - 1 - j or i == (n - 1) / 2 or j == (n - 1) / 2: \r\n\t\t\tsum += grid[i][j]\r\nprint(sum)", "n=int(input())\r\nmatrix=[]\r\nfor i in range(n):\r\n ar=[int(x) for x in input().split()]\r\n matrix.append(ar)\r\nsum=0\r\nj=0\r\nfor i in range(n):\r\n sum+=matrix[i][j]\r\n j+=1\r\nj=0\r\nfor i in range(n-1,-1,-1):\r\n sum+=matrix[i][j]\r\n j+=1\r\nfor i in range(n):\r\n sum+=matrix[n//2][i]\r\n sum+=matrix[i][n//2]\r\nsum-=3*matrix[n//2][n//2]\r\nprint(sum)\r\n", "n = int(input())\r\nA = []\r\nfor i in range(n):\r\n B = list(map(int,input().split()))\r\n A.append(B)\r\n\r\nS = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or j == n-i-1:\r\n S += A[i][j]\r\n\r\nfor i in range(n):\r\n S += A[i][int(n/2)]\r\n\r\nfor j in range(n):\r\n S += A[int(n / 2)][j]\r\n\r\nprint(S - 2* A[int(n/2)][int(n/2)])", "n = int(input())\ndata = []\nfor i in range(n):\n temp = input()\n data.append(list(temp.split(' ')))\nmid = int(n / 2)\nsum = 0\n\nfor i in range(n):\n for j in range(n):\n if i == j or i == mid or j == mid or i == n - 1 - j or j == n - 1 - i:\n sum += int(data[i][j])\n\nprint(sum)\n", "n = int(input())\nmatrix = []\ns = 0\n\nfor _ in range(n):\n arr = [int(x) for x in input().split()]\n matrix.append(arr)\n\ns += sum( matrix[ (n - 1) // 2 ] )\nfor arr in matrix: s += arr[ (n - 1) // 2 ]\nfor x in range(n): s += matrix[x][x]\nfor x in range(n): s += matrix[x][n - x - 1]\n\nprint(s - matrix[ (n - 1) // 2 ][ (n - 1) // 2 ] * 3 )", "n=int(input())\r\nmatrix=[]\r\nfor i in range(n):\r\n row=[int(x) for x in input().split()]\r\n matrix.append(row)\r\n\r\nmid=n//2\r\ns=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or (i+j)==n-1 or i==mid or j==mid:\r\n s+=matrix[i][j]\r\n\r\nprint(s)\r\n", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(n):\r\n if(i==j or i==(n-1)//2 or j==(n-1)//2 or i+j==n-1):\r\n s+=l[j]\r\nprint(s)\r\n", "n = int(input())\r\ngood_numbers = 0\r\nfor i in range(n):\r\n line = list(map(int, input().split()))\r\n for j in range(n):\r\n if i == j or i == n//2 or j == n//2 or j + i == n - 1:\r\n good_numbers += line[j]\r\nprint(good_numbers)", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n lst.append(a)\r\nmiddle = n // 2\r\nfirst = 0\r\nsecond = 0\r\nfor i in range(0, n): \r\n for j in range(0, n): \r\n if (i == j): \r\n first += lst[i][j] \r\n if (i == n - j - 1): \r\n second += lst[i][j] \r\nmidrow = sum(lst[middle])\r\nmidcol = 0\r\nfor i in range(n):\r\n midcol = midcol + lst[i][middle]\r\n\r\nprint(midcol + midrow + first + second -3*(lst[n//2][n//2]))", "n=int(input())\na=[[int(j) for j in input().split()]for i in range(n)]\ns=0\nfor i in range(n):\n for j in range(n):\n if i==j:\n s+=a[i][j]\n if i+j==n-1:\n s+=a[i][j]\n if (i==(n-1)/2):\n s+=a[i][j] \n if (j==(n-1)/2):\n s+=a[i][j]\nprint(s-(a[n//2][n//2])*3)\n", "\r\n\r\n\r\nn = int(input())\r\n\r\nt=[]\r\n\r\nfor i in range(n):\r\n t.append(list(map(int,input().split())))\r\n\r\nans=0\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n\r\n if i==j or i+j==n-1 or i==n//2 or j==n//2:\r\n ans+=t[i][j]\r\nprint(ans)\r\n", "s=0\r\nl=[]\r\nfor _ in range(int(input())):\r\n l.append(list(map(int,input().split())))\r\ndic={}\r\nfor i in range(len(l)):\r\n dic[i]=i\r\n s += l[i][i]\r\nfor i in range(len(l)):\r\n if dic[i]!=(len(l)-i-1):\r\n dic[i]=len(l)-i-1\r\n s+=l[i][len(l)-i-1]\r\nfor i in range(len(l)):\r\n if dic[i]!=(len(l)-1)//2:\r\n\r\n s += l[i][(len(l)-1)//2]\r\nfor i in range(len(l)):\r\n if dic[(len(l)-1)//2]!=i:\r\n\r\n s += l[(len(l)-1)//2][i]\r\nprint(str(s),end=\"\")\r\n\r\n\r\n", "x=int(input())\r\n#ij=[[0]*x for r in range(x)]\r\nij=[]\r\nfor i in range(x):\r\n row=list(map(int, input().split()))\r\n ij.append(row)\r\n#print(ij)\r\nsumm=0\r\ny=(x+1)//2-1\r\nk=ij[y][y]\r\nfor i in range(x):\r\n summ+=ij[i][i]\r\n summ+=ij[i][x-i-1]\r\n summ+=ij[y][i]\r\n summ+=ij[i][y]\r\n #print(summ)\r\nsumm-=3*k\r\nprint(summ)", "L=[]\r\nn=int(input())\r\nfor k in range (n):\r\n l=list(map(int,input().split(\" \")))\r\n L.append(l)\r\na=sum([L[k][k] for k in range(n)])\r\nb=sum([L[n-k-1][k] for k in range(n)])\r\nc=sum([L[k][n//2] for k in range(n)])\r\nd=sum([L[n//2][k] for k in range(n)])\r\nprint(a+b+c+d-3*(L[n//2][n//2]))\r\n", "n = int(input())\nc = 0\nfor i in range(n):\n a = list(map(int,input().split()))\n if i==n//2:\n c+=sum(a)\n continue\n c+=a[i]+a[n-i-1]+a[n//2]\nprint(c)\n\n'''\nw = int(input())\nc = 0\nfor _ in range(w):\n a = sum(map(int,input().split()))\n c+=int(a>1)\nprint(c)\n'''\n", "n=int(input())\r\nm=[]\r\nc=[]\r\nfor i in range(n):\r\n x=input().split()\r\n for j in range(n):\r\n x[j]=int(x[j])\r\n m.append(x) \r\nfsum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n fsum+= m[i][j]\r\n elif i+j == n-1:\r\n fsum += m[i][j]\r\n elif j==n//2:\r\n fsum+=m[i][j]\r\n elif i==n//2:\r\n fsum+=m[i][j]\r\nprint (fsum)", "N = int (input())\r\nA = [[int(X) for X in input().split()] for i in range (N)]\r\nsum = 0\r\nfor i in range (N):\r\n\tfor j in range (N):\r\n\t\tif i == j:\r\n\t\t\tsum += A[i][j]\r\n\t\t\tcontinue\r\n\t\tif i + j == N-1:\r\n\t\t\tsum += A[i][j]\r\n\t\t\tcontinue\r\n\t\tif i == N//2:\r\n\t\t\tsum += A[i][j]\r\n\t\t\tcontinue\r\n\t\tif j == N//2:\r\n\t\t\tsum += A[i][j]\r\n\t\t\tcontinue\r\nprint (sum)", "#!/usr/bin/env/python\r\n# -*- coding: utf-8 -*-\r\nn = int(input())\r\nres = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n if i == n // 2:\r\n res += sum(a)\r\n else:\r\n res += a[i] + a[n - i - 1] + a[n // 2]\r\nprint(res)\r\n", "N = int( input() )\r\nmat = list( list( map( int, input().split() ) ) for i in range( N ) )\r\nans = 0\r\nfor i in range( N ):\r\n ans += mat[ i ][ i ]\r\n ans += mat[ N - 1 - i ][ i ]\r\n ans += mat[ N >> 1 ][ i ]\r\n ans += mat[ i ][ N >> 1 ]\r\nprint( ans - mat[ N >> 1 ][ N >> 1 ] * 3 )\r\n", "size = int(input())\r\nmatrix = [[0]*size]*size\r\nfor i in range(size):\r\n matrix[i] = list(map(int, input().split()))\r\n# print(matrix)\r\nn = size - 1\r\ntotal = 0\r\nfor i in range(size):\r\n total += matrix[i][i]\r\n total += matrix[n-i][i]\r\n total += matrix[int(((n-1)/2)+1)][i]\r\n total += matrix[i][int(((n - 1) / 2) + 1)]\r\ntotal -= 3 * matrix[int(((n - 1) / 2) + 1)][int(((n - 1) / 2) + 1)]\r\nprint(total)\r\n", "n = int(input())\r\narr = [[int(x) for x in input().split()] for y in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j or i+j+1==n or i==n//2 or j==n//2):\r\n ans+=arr[i][j]\r\nprint(ans)", "n=int(input())\r\ny=[]\r\ns=0\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n y.append(x)\r\nfor i in range(n):\r\n s+=y[i][i]\r\nfor i in range(n):\r\n s+=y[i][n-i-1]\r\nfor i in range(n):\r\n s+=y[n//2][i]\r\n s+=y[i][n//2]\r\nprint(s-3*y[n//2][n//2])\r\n\r\n\r\n", "#177A1\r\ns=0\r\nn=int(input())\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n for j in range(len(l)):\r\n if j==i or j==(n-i-1) or j==(n-1)//2 or i==(n-1)//2:\r\n s+=l[j]\r\n \r\nprint(s)\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n b = list(map(int,input().split()))\r\n a.append(b)\r\ns = 0 \r\nfor i in range(n):\r\n if(i == (n+1)//2 - 1):\r\n s += sum(a[i])\r\n else: \r\n for j in range(n):\r\n if(i==j):\r\n s += a[i][j] + a[i][-(j+1)] + a[i][(n+1)//2 - 1]\r\n else:\r\n continue \r\nprint(s) ", "n=int(input())\r\nlists=[]\r\nsumr=0\r\nf=int((n-1)/2)\r\nfor i in range(n):\r\n\tni=list(map(int,input().split()))\r\n\tlists.append(ni)\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j or i+j==n-1 or i==(n-1)/2 or j==(n-1)/2:\r\n\t\t\tsumr+=lists[i][j]\r\nprint(sumr)", "n = int(input())\r\na = []\r\nfor i in range(n) :\r\n\tx = [int(tmp) for tmp in input().split()]\r\n\ta.append(x)\r\nans = 0\r\nfor i in range(len(a)) :\r\n\tfor j in range(len(a[i])) :\r\n\t\tif i == j :\r\n\t\t\tans += a[i][j]\r\n\t\tif (n-1-i) == j :\r\n\t\t\tans += a[i][j]\r\n\t\tif j==(n-1)//2:\r\n\t\t\tans += a[i][j]\r\n\t\tif i == (n-1)//2 :\r\n\t\t\tans += a[i][j]\r\nprint(ans - 3*a[(n-1)//2][(n-1)//2])\r\n", "n = int(input())\r\nl = []\r\ns = 0\r\n \r\nfor _ in range(n):\r\n\tl.append(list(map(int,input().split())))\r\n \r\nfor i in range(n):\r\n \r\n\t# main diagonal :\r\n\ts += l[i][i]\r\n\tl[i][i] = 0\r\n \r\n\t# secondary diagonal\r\n \r\n\ts += l[i][n-1-i]\r\n\tl[i][n-1-i] = 0\r\n \r\n\t#mid row\r\n \r\n\ts += l[int((n-1)/2)][i]\r\n \r\n\t#mid column\r\n \r\n\ts+= l[i][int((n-1)/2)]\r\n \r\n \r\nprint(s)", "import sys\r\ninput=sys.stdin.readline\r\n#sys.stdin=open('input.txt', 'r')\r\n#sys.stdout=open('output.txt','w')\r\nn=int(input())\r\na=[]\r\nvis=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(n):\r\n\tp=[int(x) for x in input().split()]\r\n\ta.append(p)\r\nc=0\r\n#print(a)\r\nfor i in range(n):\r\n\tc+=a[n//2][i]\r\n\tvis[n//2][i]=1\r\nfor i in range(n):\r\n\tif vis[i][n//2]==0:\r\n\t\tvis[i][n//2]=1\r\n\t\tc+=a[i][n//2]\r\nfor i in range(n):\r\n\tif vis[i][i]==0:\r\n\t\tc+=a[i][i]\r\n\tif vis[i][n-i-1]==0:\r\n\t\tc+=a[i][n-i-1]\t\r\nprint(c)\t\r\n", "n=int(input())\r\narr=[]\r\nfor i in range(n):\r\n row=list(map(int,input().split()))\r\n arr.append(row)\r\nstarting=0\r\nend=-1\r\nans=0\r\nfor i in range(n):\r\n ans+=arr[i][starting+i]+arr[i][end-i]\r\nmid=int(n/2)\r\nfor i in range(n):\r\n ans+=arr[mid][i]\r\n ans+=arr[i][mid]\r\nans -= 3*(arr[mid][mid])\r\nprint(ans)", "import math\n\nn = int(input())\nmatrix = []\n\nfor i in range(n):\n row = list(map(int, input().split(\" \")) )\n matrix.append(row)\n\ncounter = 0\n\n#Diagonal principal\nfor i in range(n):\n for j in range(n):\n if (i == j or i+j== n-1 or i == math.ceil((n-1)/2) or j == math.floor((n-1)/2)):\n counter += matrix[i][j]\n\nprint(counter)\n", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n s += a[i][i]\r\n s += a[n-i-1][i]\r\nfor i in range(n):\r\n s += a[i][n//2]\r\n s += a[n//2][i]\r\ns -= 3*(a[n//2][n//2])\r\nprint(s)", "n = int(input())\n\ns = 0\nm = [list(map(int, input().split())) for _ in range(n)]\n\nfor i in range(n):\n s += m[i][i] + m[i][n-1-i] + m[i][n//2] + m[n//2][i]\n\ns -= 3*m[n//2][n//2]\nprint(s)\n", "def good(ar):\r\n n = len(ar)\r\n total = 0\r\n if n == 1:\r\n total = ar[0][0]\r\n else:\r\n for i in range(0, n):\r\n for j in range(0, n):\r\n if i == j:\r\n total += ar[i][j]\r\n ar[i][j] = 0\r\n for i in range(0, n):\r\n for j in range(0, n):\r\n if i + j == n - 1:\r\n total += ar[i][j]\r\n ar[i][j] = 0\r\n for i in range(0, n):\r\n for j in range(0, n):\r\n if i == int((n - 1)/2):\r\n total += ar[i][j]\r\n ar[i][j] = 0\r\n for i in range(0, n):\r\n for j in range(0, n):\r\n if j == int((n - 1)/2):\r\n total += ar[i][j]\r\n ar[i][j] = 0\r\n print(total)\r\n\r\n\r\na = []\r\ncount = int(input())\r\nfor _ in range(0, count):\r\n a.append(list(map(int, input().split())))\r\ngood(a)\r\n", "n = int(input())\r\nl=[]\r\nfor _ in range(n):\r\n a = list(map(int, input().split()))\r\n l.append(a)\r\n\r\nsm = 0\r\nfor i in range(n):\r\n if i!=(n//2):\r\n sm = sm +l[i][i]+l[n-i-1][i]+l[i][n//2]+l[n//2][i]\r\n\r\n\r\nsm +=l[n//2][n//2]\r\n\r\nprint(sm)\r\n\r\n\r\n", "n = int(input().split()[0])\nM = []\nfor i in range(n): M.append(input().split())\nfor i in range(n):\n for j in range(n): M[i][j] = int(M[i][j])\n\nS = 0\nci = (n-1)//2\nfor i in range(ci):\n ni = n-1-i\n S += M[i][i] + M[ni][ni] + M[ni][i] + M[i][ni]\n S += M[i][ci] + M[ni][ci] + M[ci][i] + M[ci][ni]\nS += M[ci][ci]\nprint(S)\n", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nsum_val = 0\r\n\r\nfor i in range(n):\r\n sum_val += a[i][i]\r\n a[i][i] = 0\r\n\r\nfor i, j in zip(range(n), range(n - 1, -1, -1)):\r\n sum_val += a[i][j]\r\n a[i][j] = 0\r\n\r\nmid_row = n // 2\r\nsum_val += sum(a[mid_row])\r\na[mid_row] = [0] * n\r\n\r\nmid_column = n // 2\r\nfor i in range(n):\r\n sum_val += a[i][mid_column]\r\n a[i][mid_column] = 0\r\n\r\nprint(sum_val)\r\n", "A = []\r\nn = int(input())\r\nfor i in range(n):\r\n lst = list(map(int, input().split()))\r\n A.append(lst)\r\n \r\ntotal = 0\r\n\r\n\r\nfor i in range(n):\r\n if i == n//2:\r\n total += sum(A[n//2])\r\n else:\r\n left = A[i][i]\r\n right =A[i][n-1-i]\r\n center = A[i][n//2]\r\n total += left + right + center \r\n\r\nprint(total)\r\n\r\n", "n = int(input())\n\nmatrix = []\nfor _ in range(n):\n matrix.append(list(map(int, input().split())))\n\ntotal = 0\nfor i in range(n):\n total += matrix[i][i] + matrix[i][n-1-i] + matrix[n//2][i] + matrix[i][n//2]\n\nprint(total - matrix[n//2][n//2]*3)", "n = int(input())\r\nl = []\r\nzeroes = []\r\nfor i in range(n):\r\n x = []\r\n for i in range(n):\r\n x.append(0)\r\n zeroes.append(x)\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\nk = n - 1\r\nfor i in range(n):\r\n zeroes[int((n - 1) / 2)][i] = -1\r\n zeroes[i][int((n - 1) / 2)] = -1\r\n zeroes[i][i] = -1\r\n zeroes[i][k] = -1\r\n k -= 1\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(zeroes[i][j] == -1):\r\n ans += l[i][j]\r\nprint(ans)", "n = int(input())\r\nm = []\r\ns = 0\r\nfor i in range(n):\r\n m.append(list(map(int,input().split(' '))))\r\nmid = n//2\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i == j or i == mid or j == mid or i + j == n - 1):\r\n s += m[i][j]\r\nprint(s)\r\n \r\n", "n = int(input())\narray = []\nfor index in range(n):\n lst = list(map(int, input().split()[:n]))\n array.append(lst)\ncenter = (n-1)//2\nd1 = 0\nfor i in range(n):\n d1 += array[i][i]\nd2 = 0\nfor i in range(n):\n d2 += array[n-i-1][i]\nh = 0\nfor i in range(n):\n h += array[center][i]\nw = 0\nfor i in range(n):\n w += array[i][center]\nprint(d1+d2+h+w-3*array[center][center])\n", "n = int(input())\nsum_good = 0\na = []\nfor i in range(n):\n\ta.append(list(map(int,input().split())))\n\n\t\nfor i in range(n):\n\tfor j in range(n):\n\t\tif i == j or i+j == n-1 or i == 0.5*(n-1) or j == 0.5*(n-1):\n\t\t\tsum_good += a[i][j]\n\nprint(sum_good)", "def main_function():\r\n matrix = [[[int(i), True] for i in input().split(\" \")] for i in range(int(input()))]\r\n sum = 0\r\n for i in range(len(matrix)):\r\n for j in range(len(matrix)):\r\n if i == j and matrix[i][j][1]:\r\n sum += matrix[i][j][0]\r\n matrix[i][j][1] = False\r\n elif i + j == len(matrix) - 1 and matrix[i][j][1]:\r\n sum += matrix[i][j][0]\r\n matrix[i][j][1] = False\r\n elif i == len(matrix) // 2 and matrix[i][j][1]:\r\n sum += matrix[i][j][0]\r\n matrix[i][j][1] = False\r\n elif j == len(matrix) // 2 and matrix[i][j][1]:\r\n sum += matrix[i][j][0]\r\n matrix[i][j][1] = False\r\n return str(sum)\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())", "from math import *\r\nfrom copy import *\r\nfrom string import *\t\t\t\t# alpha = ascii_lowercase\r\nfrom random import *\r\nfrom sys import stdin\r\nfrom sys import maxsize\r\nfrom operator import *\t\t\t\t# d = sorted(d.items(), key=itemgetter(1))\r\nfrom itertools import *\r\nfrom collections import Counter\t\t# d = dict(Counter(l))\r\nimport math\r\n\r\ndef bin1(l,r,k,t,b,val,ans):\r\n\tif(l>r):\r\n\t\treturn ans\r\n\telse:\r\n\t\tmid=(l+r)//2\r\n\t\tv=k**mid\r\n\t\tif(v==val):\r\n\t\t\treturn v\r\n\t\telif(v>val):\r\n\t\t\tans=mid\r\n\t\t\treturn bin1(mid+1,r,k,t,b,val,ans)\r\n\t\telse:\r\n\t\t\treturn bin1(l,mid-1,k,t,b,val,ans)\r\n\t\t\r\ndef bin2(l,r,k,t,b,val,ans):\r\n\tif(l>r):\r\n\t\treturn ans\r\n\telse:\r\n\t\tmid=(l+r)//2\r\n\t\tv=t*(k**mid)+b*(mid)\r\n\t\tif(v==val):\r\n\t\t\treturn v\r\n\t\telif(v>val):\r\n\t\t\tans=mid\r\n\t\t\treturn bin2(l,mid-1,k,t,b,val,ans)\r\n\t\telse:\r\n\t\t\treturn bin2(mid+1,r,k,t,b,val,ans)\r\n\r\ndef SieveOfEratosthenes(n): \r\n \r\n # Create a boolean array \"prime[0..n]\" and initialize \r\n # all entries it as true. A value in prime[i] will \r\n # finally be false if i is Not a prime, else true. \r\n prime = [True for i in range(n+1)] \r\n p = 2\r\n while (p * p <= n): \r\n \r\n # If prime[p] is not changed, then it is a prime \r\n if (prime[p] == True): \r\n \r\n # Update all multiples of p \r\n for i in range(p * p, n+1, p): \r\n prime[i] = False\r\n p += 1\r\n l=[]\r\n for i in range(2,n+1):\r\n \tif(prime[i]):\r\n \t\tl.append(i)\r\n return l\r\ndef bin(l,r,ll,val):\r\n\tif(l>r):\r\n\t\treturn -1\r\n\telse:\r\n\t\tmid=(l+r)//2\r\n\t\tif(val>=ll[mid][0] and val<=ll[mid][1]):\r\n\t\t\treturn mid\r\n\t\telif(val<ll[mid][0]):\r\n\t\t\treturn bin(l,mid-1,ll,val)\r\n\t\telse:\r\n\t\t\treturn bin(mid+1,r,ll,val)\r\ndef deci(n):\r\n\ts=\"\"\r\n\twhile(n!=0):\r\n\t\tif(n%2==0):\r\n\t\t\tn=n//2\r\n\t\t\ts=\"0\"+s\r\n\t\telse:\r\n\t\t\tn=n//2\r\n\t\t\ts=\"1\"+s\r\n\treturn s\r\ndef diff(s1,s2):\r\n\tif(len(s1)<len(s2)):\r\n\t\tv=len(s1)\r\n\t\twhile(v!=len(s2)):\r\n\t\t\ts1=\"0\"+s1\r\n\t\t\tv=v+1\r\n\telse:\r\n\t\tv=len(s2)\r\n\t\twhile(v!=len(s1)):\r\n\t\t\ts2=\"0\"+s2\r\n\t\t\tv=v+1\r\n\tc=0\r\n\tfor i in range(len(s1)):\r\n\t\tif(s1[i:i+1]!=s2[i:i+1]):\r\n\t\t\tc=c+1\r\n\treturn c\r\nfrom sys import stdin, stdout \r\ndef fac(a,b):\r\n\tv=a\r\n\twhile(a!=b):\r\n\t\tv*=a-1\r\n\t\ta=a-1\r\n\treturn v\r\ndef bino(l,r,n):\r\n\tif(l>r):\r\n\t\treturn -1\r\n\telse:\r\n\t\tmid=(l+r)//2\r\n\t\tval1=math.log((n/mid)+1,2)\r\n\t\tval2=int(val1)\r\n\t\tif(val1==val2):\r\n\t\t\treturn val1\r\n\t\telif(val1<1.0):\r\n\t\t\treturn bino(l,mid-1,n)\r\n\t\telse:\r\n\t\t\treturn bino(mid+1,r,n)\r\n\r\ndef binary(l,r,ll,val,ans):\r\n\tif(l>r):\r\n\t\treturn ans\r\n\telse:\r\n\t\tmid=(l+r)//2\r\n\t\tif(ll[mid]==val):\r\n\t\t\treturn ll[mid]\r\n\t\telif(ll[mid]<val):\r\n\t\t\tans=ll[mid]\r\n\t\t\treturn binary(mid+1,r,ll,val,ans)\r\n\t\telse:\r\n\t\t\treturn binary(l,mid-1,ll,val,ans)\r\ndef check(n):\r\n\tv=1\r\n\twhile(n!=0):\r\n\t\tif(n%10==0 or n%10==1):\r\n\t\t\tn=n//10\r\n\t\telse:\r\n\t\t\tv=0\r\n\t\t\tbreak\r\n\treturn v\r\n\r\nif __name__ == '__main__':\r\n\tn=int(input())\r\n\tl=[]\r\n\tfor i in range(n):\r\n\t\tl1=list(map(int,input().split(\" \")))\r\n\t\tl.append(l1)\r\n\ttotal=0\r\n\tfor i in range(n):\r\n\t\ttotal+=l[i][i]\r\n\t\ttotal+=l[n-i-1][i]\r\n\t\ttotal+=l[n//2][i]\r\n\t\ttotal+=l[i][n//2]\r\n\tprint(total-3*l[n//2][n//2])", "n = int(input())\nl = []\nfor i in range(n):\n t = input()\n t = t.split()\n l.append(t)\nc = 0\nfor i in range(n):\n c+=int(l[i][i])\n c+=int(l[i][n-i-1])\n c+=int(l[int((n-1)/2)][i])\n c+=int(l[i][int((n-1)/2)])\nprint(c-int(l[int((n-1)/2)][int((n-1)/2)])*3)", "from cmath import *\r\nfrom decimal 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\na=[0]*10001\r\n\r\ndef solves():\r\n n=_int()\r\n a=[]\r\n for i in range(n):\r\n x=_list()\r\n a.append(x)\r\n ans=0\r\n for i in range(n):\r\n for j in range(n):\r\n if (a[i][j]!=0):\r\n if (j==(n//2)):\r\n ans+=a[i][j]\r\n #print(a[i][j])\r\n elif (i==(n//2)):\r\n ans+=a[i][j]\r\n #print(a[i][j])\r\n elif (i==j):\r\n ans+=a[i][j]\r\n #print(a[i][j])\r\n elif (i==n-j-1):\r\n ans+=a[i][j]\r\n #print(a[i][j])\r\n print(ans)\r\nt=1\r\n#t =int(input())\r\nfor i in range(2,10000):\r\n if a[i]==0:\r\n for j in range(i*2,10000,i):\r\n a[j]=1\r\nfor _ in range(0,t):\r\n solves()\r\n", "L1=[]\r\ndef change(L):\r\n for i in L:\r\n L1.append(int(i))\r\n return L1\r\nL2=[]\r\n\r\nn = int(input())\r\nL_ans=[]\r\nstr=\"\"\r\nfor i in range(1, n + 1):\r\n row = input().split()\r\n\r\n L_ans.append(row[(n - 1) // 2])\r\n L_ans.append(row[i - 1])\r\n L_ans.append(row[n - i])\r\n\r\n if i==(n+1)//2:\r\n str=str+row[(n-1)//2]\r\n L_ans=L_ans+row\r\n\r\nx=3*int(str)\r\n\r\ny=sum(change(L_ans))\r\nprint(y-x)", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([int(x) for x in input().split()])\r\n \r\nc = 0\r\nc += sum(a[int((n - 1) // 2)])\r\nc += sum(a[i][int((n - 1) // 2)] for i in range(n))\r\nc += sum(a[i][i] for i in range(n))\r\nfor i in range(n):\r\n for j in range(n):\r\n if((i + j) == (n - 1)):\r\n c += a[i][j]\r\n\r\nprint(c - 3 * a[int((n - 1) // 2)][int((n - 1) // 2)])\r\n", "n=int(input())\r\ns=0\r\nfor x in range(n):\r\n\tl=list(map(int,input().split()))\r\n\tif x==(n//2):\r\n\t\ts+=(sum(l))\r\n\telse:\r\n\t\ts+=(l[x]+l[-(x+1)]+l[(n//2)])\r\nprint(s)\r\n", "n = int(input())\r\n\r\nm = []\r\nfor i in range(n):\r\n m.append(list(map(int, input().split())))\r\n\r\nsum = 0\r\nmiddle_line = n // 2\r\nfor i in range(n):\r\n sum += m[i][i]\r\n sum += m[n-i-1][i]\r\n \r\n sum += m[middle_line][i]\r\n sum += m[i][middle_line]\r\n\r\nprint(sum - 3*m[middle_line][middle_line])", "n = int(input())\r\nmatrix = []\r\n\r\nfor _ in range(n):\r\n row = list(map(int, input().split()))\r\n matrix.append(row)\r\n\r\nsum_good_elements = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i + j == n - 1 or i == n // 2 or j == n // 2:\r\n sum_good_elements += matrix[i][j]\r\n\r\nprint(sum_good_elements)\r\n", "import sys\n\nmat = []\nn = int(sys.stdin.readline())\nfor _ in range(n):\n\tmat.append(list(map(int, sys.stdin.readline().split())))\n\ntotal = 0\n#main diag \nrow, col = 0, 0\nfor _ in range(n):\n\ttotal += mat[row][col]\n\trow += 1\n\tcol += 1\n\n#sec diag \nrow, col = 0, n - 1\nfor _ in range(n):\n\ttotal += mat[row][col]\n\trow += 1\n\tcol -= 1\n\n#middle row \nrow, col = n // 2, 0\nfor _ in range(n):\n\ttotal += mat[row][col]\n\tcol += 1\n\t\n#middle col \nrow, col = 0, n // 2\nfor _ in range(n):\n\ttotal += mat[row][col]\n\trow += 1\n\nprint(total - 3 * mat[n // 2][n // 2])\n\t\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\nmid = (n-1)/2\r\nv = 0\r\nfor i in range (0, n):\r\n m = input().split()\r\n if i == mid:\r\n for k in range (0, n):\r\n v = v + int(m[k])\r\n else:\r\n for j in range (0, n):\r\n if j == i:\r\n v = v + int(m[j])\r\n elif j == mid:\r\n v = v + int(m[j])\r\n elif j == n - i - 1:\r\n v = v + int(m[j])\r\nprint(v)", "n = int(input())\r\nlst = []\r\ncount = 0\r\nfor item in range(n):\r\n lst.append(list(map(int, input().split())))\r\n \r\nfor i in range(n):\r\n for u in range(n):\r\n if i == u or u ==(n-1-i) or (n-1)//2 == i or u == (n-1)//2:\r\n count += lst[i][u]\r\nprint(count)\r\n \r\n \r\n", "n = int(input())\r\nmatrix, mid= [list(map(int, input().split())) for i in range(n)], (n-1)//2\r\nsum1 = sum(matrix[mid]) - matrix[mid][mid]*3\r\nfor i in range(n):\r\n sum1 += matrix[i][i] + matrix[i][n-i-1] + matrix[i][mid]\r\nprint(sum1)", "m_sum = 0\r\nn = int(input())\r\nn_half = int(n/2)\r\nfor i in range(n):\r\n e = [int(i) for i in input().strip().split(' ')]\r\n if i == n_half:\r\n m_sum += sum(e)\r\n else:\r\n m_sum += e[i]\r\n m_sum += e[n-i-1]\r\n m_sum += e[n_half]\r\nprint(m_sum)\r\n", "def main():\r\n n = int(input())\r\n a = []\r\n \r\n for i in range(n):\r\n row = list(map(int, input().split()))\r\n a.append(row)\r\n \r\n sum_value = 0\r\n \r\n # main diagonal\r\n for i in range(n):\r\n sum_value += a[i][i]\r\n a[i][i] = 0\r\n \r\n # secondary diagonal\r\n for i in range(n):\r\n sum_value += a[i][n - 1 - i]\r\n a[i][n - 1 - i] = 0\r\n \r\n # mid row\r\n mid_row = n // 2\r\n for i in range(n):\r\n sum_value += a[mid_row][i]\r\n a[mid_row][i] = 0\r\n \r\n # mid column\r\n mid_col = n // 2\r\n for i in range(n):\r\n sum_value += a[i][mid_col]\r\n a[i][mid_col] = 0\r\n \r\n print(sum_value)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a=int(input())\r\ntotal=0\r\nfor i in range(a):\r\n row=list(map(int,input().split()))\r\n for j in range(len(row)):\r\n if i==j or i==a//2 or j==a//2 or i+j+1==a:\r\n total+=row[j]\r\nprint(total)", "n = int(input())\r\nx = []\r\nfor i in range(n):\r\n\ta = list(map(int, input().split()))\r\n\tx.append(a)\r\nans = 0\r\nfor i in range(n):\r\n\tans += x[i][i]\r\nfor i in range(n):\r\n\tif i != n // 2:\r\n\t\tans += x[i][n - i - 1]\r\nfor i in range(n):\r\n\tif i != n // 2:\r\n\t\tans += x[n // 2][i]\r\nfor i in range(n):\r\n\tif i != n // 2:\r\n\t\tans += x[i][n // 2]\r\nprint(ans)\r\n", "n,r,a=int(input()),0,[]\r\nfor _ in [0]*n:\r\n a.append([*map(int,input().split())])\r\nr+=sum(a[n//2])+sum([a[x][n//2] for x in range(n)])\r\nr+=sum([a[i][i] for i in range(n)])\r\nr+=sum([a[i][n-1-i] for i in range(n)])\r\nr-=3*a[n//2][n//2]\r\nprint(r)\r\n", "n = input()\r\nn=int(n)\r\n\r\nout = 0\r\n\r\nfor k in range(n):\r\n i = k\r\n row_k = input()\r\n row_ele = row_k.split()\r\n if i != (n-1)//2:\r\n #print(row_ele[i],row_ele[-1*(i+1)],row_ele[(n-1)//2])\r\n out += int(row_ele[i]) + int(row_ele[-1*(i+1)]) + int(row_ele[(n-1)//2])\r\n else:\r\n #print(row_ele)\r\n toAdd = sum([int(i) for i in row_ele])\r\n out+=toAdd\r\n \r\nprint(out)", "n = int(input())\r\nmatrix = [[int(j) for j in input().split()] for i in range(n)]\r\nsumm=0\r\nk=n//2\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n summ = summ + matrix[i][j]\r\n elif i+j+1 ==n:\r\n summ = summ + matrix[i][j]\r\n elif i==k:\r\n summ = summ + matrix[i][j]\r\n elif j==k:\r\n summ = summ + matrix[i][j]\r\nprint(summ)", "n = int(input())\nmat = []\n\nfor i in range(n):\n l = [int(x) for x in input().split()]\n mat.append(l)\ns = 0\nfor i in range(n):\n for j in range(n):\n if i + j == n - 1 or i == j or i == n // 2 or j == n // 2:\n s += mat[i][j]\nprint(s)\n\n \t \t\t \t \t \t \t \t \t\t \t \t \t \t\t\t", "n = int(input())\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n\r\n matrix.append(a)\r\n\r\n\r\nvisited = {}\r\nresult = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j and ((i,j) not in visited):\r\n result+=matrix[i][j]\r\n visited[(i,j)]=True\r\n\r\n if (i+j)==n-1 and ((i,j) not in visited):\r\n result+=matrix[i][j]\r\n visited[(i,j)]=True\r\n\r\n if i==n//2 and ((i,j) not in visited):\r\n result+=matrix[i][j]\r\n visited[(i,j)]=True\r\n\r\n if j==n//2 and ((i,j) not in visited):\r\n result+=matrix[i][j]\r\n visited[(i,j)]=True\r\n\r\nprint(result)\r\n \r\n \r\n \r\n", "def main():\n n = int(input())\n score = 0\n\n for i in range(n):\n scores = [int(_) for _ in input().split()]\n\n if i == n // 2:\n score += sum(scores)\n else:\n score += scores[i]\n score += scores[(n - 1) - i]\n score += scores[n // 2]\n\n print(score)\n\n\nif __name__ == '__main__':\n main()\n", "\r\n\r\ndef solve():\r\n n = int(input())\r\n ans = 0\r\n matrix = []\r\n for i in range(n):\r\n row = list(map(int,input().split()))\r\n y = []\r\n for j in range(n):\r\n x = [row[j],0]\r\n y.append(x)\r\n matrix.append(y)\r\n for j in range(n):\r\n if i==j or i+j==n-1:\r\n if matrix[i][j][1]==0:\r\n ans += matrix[i][j][0]\r\n \r\n matrix[i][j][1]=1\r\n elif i==n//2 or j==n//2:\r\n if matrix[i][j][1]==0:\r\n ans += matrix[i][j][0]\r\n \r\n matrix[i][j][1]=1\r\n print(ans)\r\nfor _ in range(1):\r\n solve()\r\n", "n = int(input())\r\nm = [[int(i) for i in input().split()] for j in range(n)]\r\nh = 0\r\n\r\nfor i in range (n):\r\n for j in range (n):\r\n if(i == j or (i+j) == (n-1) or n // 2 == i or n // 2 == j):\r\n h += m[i][j]\r\nprint (h)\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\n\r\n# print(a)\r\nnum = 0\r\nx = int((n-1)/2)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n num += a[i][j]\r\n elif i+j == (n-1):\r\n num += a[i][j]\r\n elif i == x:\r\n num += a[i][j]\r\n elif j == x:\r\n num += a[i][j]\r\n\r\nprint(num)", "n = int(input())\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n entries = [int(ent) for ent in input().split()]\r\n matrix.append(entries)\r\n\r\n \r\nmid_len = len(matrix)//2\r\nmid_lst = matrix[mid_len]\r\nmid_lst_len = len(mid_lst)//2\r\nmid_elem = mid_lst[mid_lst_len] \r\n\r\n\r\nsum1 = 0\r\nrow = 0\r\ncolumn = 0\r\nif n == 1:\r\n summation = matrix[0][0]\r\n print(summation)\r\nelse:\r\n #adding elements of the diagonal\r\n while row<n and column<n:\r\n elem = matrix[row][column]\r\n sum1 += elem\r\n row += 1\r\n column += 1\r\n #adding elements of the secondary diagonal\r\n sum2 = 0\r\n row = 0\r\n column = n-1\r\n while row<n and column>=0:\r\n elem = matrix[row][column]\r\n sum2 += elem\r\n row += 1\r\n column -= 1\r\n #adding elements of the middle row\r\n sum3 = 0\r\n for item in mid_lst:\r\n sum3 += item\r\n\r\n #adding elements of the middle column\r\n sum4 = 0\r\n row = 0\r\n column = n//2\r\n while row < n:\r\n elem = matrix[row][column]\r\n sum4 += elem\r\n row += 1\r\n summation = (sum1 + sum2 + sum3 + sum4) - (3 * mid_elem)\r\n print(summation)\r\n \r\n", "n=int(input())\r\nB=[]\r\nfor i in range(n):\r\n k = input()\r\n A = k.split(\" \")\r\n B.append(A)\r\nm = (n+1)/2\r\nC = 0\r\nfor a in range(n):\r\n for b in range(n):\r\n if a == m-1 or b == m-1 or a+b == n-1 or a==b:\r\n c= B[a][b]\r\n C += int(c)\r\nprint(C)", "from sys import stdin\r\ninput = stdin.readline\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append([*map(int, input().split())])\r\nans = 0\r\nfor i in range(n):\r\n ans += arr[i][i]\r\n ans += arr[n-i-1][i]\r\n ans += arr[n//2][i]\r\n ans += arr[i][n//2]\r\nans -= 3*arr[n//2][n//2]\r\nprint(ans)\r\n", "n = int(input())\r\nsum = 0\r\ns = list(list(map(int, input().split())) for j in range(n))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i == (n // 2) or j == (n // 2) or i + j + 1 == n:\r\n sum += s[i][j]\r\nprint(sum)", "t=0\r\nl=[]\r\nd=0\r\nr=0\r\nfor i in range(int(input())):\r\n l.append(list(map(int,input().split())))\r\n if i==len(l[i])//2:\r\n t+=sum(l[i])\r\n continue\r\n t+=l[i][len(l[i])//2]\r\n t+=l[i][len(l[i])-i-1]\r\n t+=l[i][i]\r\nprint(t)\r\n ", "matrix1 = []\r\nmatrix2 = []\r\ncounter = 0\r\nT = int(input())\r\nfor i in range(T):\r\n storage1 = input().split(\" \")\r\n for k in range(len(storage1)):\r\n storage1[k] = int(storage1[k])\r\n matrix1.append(storage1)\r\nfor i in range(T):\r\n storage2 = []\r\n for i in range(T):\r\n storage2.append(0)\r\n matrix2.append(storage2)\r\nfor i in range(T):\r\n matrix2[T//2][i] = matrix1[T // 2][i]\r\nfor i in range(T):\r\n matrix2[i][T//2] = matrix1[i][T//2]\r\nfor i in range(T):\r\n for j in range(T):\r\n if i + j == T - 1:\r\n matrix2[i][j] = matrix1[i][j]\r\nfor i in range(T):\r\n matrix2[i][i] = matrix1[i][i]\r\nfor i in range(T):\r\n for j in range(T):\r\n counter += matrix2[i][j]\r\nprint(counter)", "n=int(input())\r\nl=[list(map(int,input().split())) for i in range(n)]\r\nz=[[False]*n for i in range(n)]\r\nsumm=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j and z[i][j]==False:\r\n summ+=l[i][j]\r\n z[i][j]=True\r\n elif i==n//2 and z[i][j]==False:\r\n summ+=l[i][j]\r\n z[i][j]=True\r\n elif j==n//2 and z[i][j]==False:\r\n summ+=l[i][j]\r\n z[i][j]=True\r\n elif i+j==n-1 and z[i][j]==False:\r\n summ+=l[i][j]\r\n z[i][j]=True\r\nprint(summ)", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n res += row[i] + row[n // 2] + row[n - i - 1]\r\n if i == n // 2:\r\n res += sum(row) - row[n // 2] * 3\r\nprint(res)\r\n", "n=int(input())\r\nh=n//2\r\nl=[]; c=0\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n\tc+=l[i][i]\r\n\tc+=l[h][i]\r\n\tc+=l[i][h]\r\n\tc+=l[i][n-i-1]\r\nc-=3*l[h][h]\t\r\nprint(c)", "n=int(input())\r\nare=[]\r\nsuma=0\r\nfor k in range (n):\r\n a=input()\r\n a=a.split()\r\n are.append(a)\r\nespaciovacio=n-3\r\nfor k in range ( n):\r\n for r in range (n):\r\n if k==((n)//2):\r\n suma=suma+int(are[k][r])\r\n are[k][r]=\"0\"\r\n elif r==((n)//2):\r\n suma=suma+int(are[k][r])\r\n are[k][r]=\"0\"\r\n elif k==r:\r\n suma=suma+int(are[k][r])\r\n are[k][r]=\"0\"\r\n elif (k+r==n-1):\r\n suma=suma+int(are[k][r])\r\n are[k][r]=\"0\"\r\nprint(suma)", "def main():\r\n n = int(input())\r\n data = []\r\n s = 0\r\n for i in range(n):\r\n vals = [int(v) for v in input().split()]\r\n data.append(vals)\r\n s+=sum(vals)\r\n added = []\r\n for i in range(1, n, 2):\r\n if i == n//2:\r\n continue\r\n added.append((0, i))\r\n added.append((n-1, i))\r\n added.append((i, 0))\r\n added.append((i,n - 1))\r\n for x,y in added:\r\n s-=data[x][y]\r\n print(s)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\n\r\ngood = 0\r\n\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n for j in range(n):\r\n if i == j:\r\n good += row[j]\r\n elif n - i - 1 == j:\r\n good += row[j]\r\n elif j == n // 2:\r\n good += row[j]\r\n elif i == n // 2:\r\n good += row[j]\r\nprint(good)", "n = int(input())\r\nmatrix = [list(map(int, input().split())) for i in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == n // 2 or j == n // 2 or i == j or i + j == n - 1:\r\n s += matrix[i][j]\r\n\r\nprint(s)\r\n", "n = int(input()) # Always an odd number.\r\n\r\ntable = []\r\nSum = 0\r\n\r\nfor i in range(n) : \r\n \r\n table.append(list( map(int, input().split()) ))\r\n \r\n if i == (n - 1) / 2 : # Middle row.\r\n Sum += sum(table[i])\r\n else :\r\n Sum += table[i][i]# Main Diagonal.\r\n Sum += table[i][n - (i + 1)] # Secondary Diagonal.\r\n Sum += table[i][(n - 1)//2] # Middle column\r\nprint(Sum)\r\n", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n row = list(map(int,input().split()))\r\n for j in range(n):\r\n if (i+j == n-1) or (i == j):\r\n cnt += row[j]\r\n elif n%2 == 1:\r\n if (i == n//2) or (j == n//2):\r\n cnt += row[j]\r\n\r\nprint(cnt)\r\n\r\n", "n=int(input())\r\nt=[]\r\nfor i in range(n):\r\n\ttemp=list(map(int,input().split()))\r\n\tt.append(temp)\r\nmid=n//2\r\nans=-3*t[mid][mid]\r\nfor i in range(n):\r\n\tans+=t[mid][i]\r\n\tans+=t[i][mid]\r\n\tans+=t[i][i]\r\n\tans+=t[i][n-1-i]\r\nprint(ans)\r\n", "n = int(input())\r\nm = (n+1)/2 - 1\r\nans = 0\r\nfor y in range(n): \r\n a = map(int, input().split())\r\n l = list(a)\r\n for x in range(n):\r\n if x == m or y == m or x == y or x == n-y-1:\r\n ans += l[x]\r\nprint(ans)\r\n", "n = int(input())\r\nanswer = 0\r\nmatrix = []\r\na, b = 0, n - 1\r\nchnga = 1\r\nchngb = -1\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().split(\" \"))))\r\n if a == b:\r\n answer += sum(matrix[i])\r\n chnga = -1\r\n chngb = 1\r\n a += chnga\r\n b += chngb\r\n continue\r\n\r\n answer += matrix[i][(n//2)]\r\n answer += matrix[i][a] + matrix[i][b]\r\n a += chnga\r\n b += chngb\r\n\r\nprint(answer)", "def square(n, ls):\r\n s = 0\r\n h = n - 1\r\n su = 0\r\n for i in range(n):\r\n if(s != h):\r\n su = su + ls[i][s]\r\n su = su + ls[i][h]\r\n k = int((n - 1) / 2)\r\n if(i == k):\r\n su = su + sum(ls[i])\r\n su = su - ls[i][k]\r\n su = su + ls[i][k] \r\n s = s + 1\r\n h = h - 1\r\n return su \r\n\r\nn = int(input())\r\nls = [[int(j) for j in input().split()] for i in range(n)]\r\nprint(square(n, ls))", "n = int(input())\r\n\r\np_final = 0\r\n\r\nmedio = n//2\r\n\r\nfor i in range(n):\r\n\tlista = list(map(int, input().split()))\r\n\tif i == medio:\r\n\t\tp_final += sum(lista)\r\n\telse:\r\n\t\tp_final += lista[medio]\r\n\t\tp_final += lista[i]\r\n\t\tp_final += lista[n-1-i]\r\n\r\nprint(p_final)", "n = int(input())\r\nx = [[False for j in range(n)] for i in range(n)]\r\narr = [[int(x) for x in input().split()] for j in range(n)]\r\n\r\nfor i in range(n):\r\n x[i][i] = True\r\n x[i][n-i-1] = True\r\n if n % 2 == 1:\r\n x[i][n // 2] = True\r\n x[n // 2][i] = True\r\n\r\nsm = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if x[i][j]:\r\n sm += arr[i][j]\r\n\r\nprint(sm)\r\n", "n = int(input())\narr = []\nfor i in range(n):\n\ta = list(map(int, input().split()))\n\tarr.append(a)\ntotal = 0\nfor b in range(n):\n\ttotal += arr[b][b]\n\tarr[b][b] = 0\nfor c in range(n):\n\ttotal += arr[c][n - 1 - c]\n\tarr[c][n - 1 - c] = 0\nfor d in range(n):\n\ttotal += arr[d][(n - 1) // 2]\n\tarr[d][(n - 1) // 2] = 0\nfor e in range(n):\n\ttotal += arr[(n - 1) // 2][e]\n\tarr[(n - 1) // 2][e] = 0\nprint(total)\n", "n = int(input())\r\na = 0\r\nb = n - 1\r\nchanga = 1\r\nchangb = -1\r\nanswer = 0\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().split())))\r\n if i == (n // 2):\r\n answer += sum(matrix[-1])\r\n changa = -1\r\n changb = 1\r\n b += changb\r\n a += changa\r\n continue\r\n\r\n answer += matrix[i][n // 2]\r\n answer += matrix[i][a] + matrix[i][b]\r\n b += changb\r\n a += changa\r\n\r\nprint(answer)\r\n", "def check(i, j, n, m):\r\n if i == j or i == m - j - 1 or ( n%2 and n//2 == i) or (m % 2 and m//2 == j):\r\n return True\r\n return False\r\n \r\nn = int(input())\r\n\r\nl = []\r\nfor i in range(n):\r\n l.append(list(map(int, input().split())))\r\nsm = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if check(i, j, n, n):\r\n sm += l[i][j]\r\nprint(sm)", "n = int(input())\r\nc = []\r\ns=0\r\nfor i in range(n):\r\n\t\tc.append(input().split())\r\nfor i in range(n):\r\n\ts+=int(c[i][i])+int(c[i][n-i-1])+int(c[(n//2)][i])+int(c[i][(n//2)])\r\ns-=3*int(c[(n//2)][(n//2)])\t\r\nprint(s)", "n=int(input());s=0\r\nfor i in range(n):\r\n k=list(map(int,input().split()));s+=k[i]+k[-i-1]+k[n//2]\r\n if i==n//2:s+=sum(k)-3*k[i]\r\nprint(s)", "def solve(n, m):\r\n ans = 0\r\n ans += sum([m[i][i] for i in range(n)])\r\n ans += sum([m[i][n-i-1] for i in range(n)])\r\n ans += sum([m[i][n//2] for i in range(n)])\r\n ans += sum([m[n//2][i] for i in range(n)])\r\n ans -= m[n//2][n//2]*3\r\n return ans\r\n\r\ndef main():\r\n n = int(input())\r\n m = list()\r\n for _ in range(n):\r\n m.append(list(map(int, input().split())))\r\n print(solve(n, m))\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n temp = list(input().split())\r\n matrix.append(temp)\r\nslist = []\r\nfor i in range(n):\r\n slist.append(matrix[i][(n+1)//2-1])\r\nfor i in range(n):\r\n if i != (n+1)//2-1:\r\n slist.append(matrix[(n+1)//2-1][i])\r\nfor i in range(n):\r\n if i != (n+1)//2-1:\r\n slist.append(matrix[i][i])\r\nfor i in range(n):\r\n if i != (n+1)//2-1:\r\n slist.append(matrix[i][-1-i])\r\ns = 0\r\nfor i in range(len(slist)):\r\n s += int(slist[i])\r\nprint(s)", "f=lambda:map(int,input().split())\r\nn=int(input())\r\ns=0\r\nfor i in range(n):\r\n r=list(f())\r\n for j in range(n):\r\n if i==j or j==n//2 or i==n//2 or i+j==n-1:\r\n s+=r[j]\r\nprint(s)", "n = int(input())\r\nar = [[int(i) for i in input().split()] for k in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n for k in range(n):\r\n if i == k or i == n//2 or k == n//2 or i+k == n-1:\r\n s += ar[i][k]\r\nprint(s)\r\n", "n=int(input())\r\nl=[list(map(int,input().split())) for i in range(n)]\r\ns=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or (i+j)==n-1 or i==n//2 or j==n//2:\r\n s+=l[i][j]\r\nprint(s)", "n = int(input())\r\nm = [[int(el) for el in input().split()] for i in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n ans += m[i][j]\r\n elif i + j == n - 1:\r\n ans += m[i][j]\r\n elif i == (n - 1) // 2:\r\n ans += m[i][j]\r\n elif j == (n - 1) // 2:\r\n ans += m[i][j]\r\nprint(ans)\r\n", "n = int(input())\r\nIL = lambda: list(map(int, input().split()))\r\nM = [IL() for i in range(n)]\r\nprint(sum(M[n//2]) + sum([M[i][i] + M[i][n-i-1] + M[i][n//2] for i in range(n)]) - 3*M[n//2][n//2])", "# grid = list(map(int,input().split()))\r\nnrow = int(input())\r\nsum = 0\r\nfor i in range(nrow):\r\n\ta = list(map(int,input().split()))\r\n\t# for j,v in enumerate()\r\n\tfor j,v in enumerate(a):\r\n\t\tif i == j:\r\n\t\t\tsum += v\r\n\t\telif i == nrow//2:\r\n\t\t\tsum += v\r\n\t\telif j == nrow//2:\r\n\t\t\tsum +=v\r\n\t\telif i == nrow - j -1:\r\n\t\t\tsum += v\r\nprint(sum)", "n=int(input())\r\ns=0\r\nfor i in range(n//2):\r\n\ta=list(map(int,input().split()))\r\n\ts=s+a[i]+a[(n//2)]+a[n-1-i]\t\r\na=list(map(int,input().split()))\r\ns=s+sum(a)\r\nfor i in range ((n//2)+1,n):\r\n\ta=list(map(int,input().split()))\r\n\ts=s+a[i]+a[(n//2)]+a[n-1-i]\r\nprint(s)", "n = int(input().strip())\ngoodmatrix = []\nfor i in range(n):\n row = [int(ele) for ele in input().strip().split()]\n goodmatrix.append(row)\n\nfinal_sum = 0\n\nfor i in range(n):\n for j in range(n):\n if i == j or i == n//2 or j == n//2 or i+j == n-1:\n final_sum += goodmatrix[i][j]\n\nprint(final_sum)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n if(i==n//2):\r\n count+=sum(l)\r\n else:\r\n count+=l[i]+l[n//2]+l[-(i+1)]\r\n \r\nprint(count)\r\n \r\n\r\n", "n=int(input())\r\nc=[]\r\nfor i in range(n):\r\n\ta=list(map(int,input().split()))\r\n\tc.append(a)\r\n\t\r\ntot=sum(c[len(c)//2])+sum(list(zip(*c))[len(c)//2])\r\n\r\nfor i in range(len(c)):\r\n\ttot+=c[i][i]+(c[i][n-i-1])\r\ntot-=3*c[n//2][n//2]\r\n\r\nprint(tot)\r\n\r\n\t\r\n", "n = int(input())\r\n\r\nsquare = []\r\nfor i in range(n):\r\n x = input().split()\r\n square.append(x)\r\n\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == (n - 1) / 2 or i == j or i + j == n-1 or j == (n-1)/2 or abs((n-1)/2-i) + abs((n-1)/2-j) == (n-1)/2:\r\n square[i][j] = -abs(int(square[i][j]))\r\nsum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if int(square[i][j]) <0:\r\n sum = sum - int(square[i][j])\r\nprint(sum)\r\n", "n = int(input())\r\nd = []\r\nc = 0\r\nfor i in range(n):\r\n\te = [int(i) for i in input().split()]\r\n\td.append(e)\r\n\r\nmini = d[n//2]\r\n\t\r\nfor j in range(n):\r\n\tc+=mini[j]\r\n\tmini[j] = 0\r\n\r\nfor minilists in d:\r\n\tfor i in range(n):\r\n\t\tc+= minilists[n//2]\r\n\t\tminilists[n//2]=0\r\nz = 0\r\nfor i in d:\t\r\n\tc+= i[z]\r\n\ti[z]= 0\r\n\tz+=1 \r\n\r\nfor i in d:\r\n\tc+=i[z-1]\r\n\ti[z-1]=0\r\n\tz-=1\r\n\r\n\r\n\r\nprint(c)", "'''\r\n5\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n1 1 1 1 1\r\n'''\r\nn=int(input())\r\na,k=[],0\r\nfor i in range(n):a.append(list(map(int,input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i!=j) and (i+j!=(n-1)) and (j!=int(n/2)) and (i!=int(n/2)):a[i][j]=0\r\nfor i in range(n):\r\n k+=sum(a[i])\r\nprint(k)\r\n", "n = int(input())\n\nA = []\nfor i in range(n):\n A.append(list(map(int, input().split())))\n\nans = 0\nm = n//2\nfor i in range(n):\n if i == m:\n continue\n ans += A[i][m]\n ans += A[m][i]\n ans += A[i][i]\n ans += A[i][n-i-1]\n\nans += A[m][m]\nprint(ans)\n\n\n", "n = int(input())\r\ny = []\r\nfor i in range(n):\r\n k = input()\r\n k = k.split(' ')\r\n y.append(k)\r\nz = []\r\nfor i in range(n):\r\n for j in range(n):\r\n k = ''\r\n if i == j:\r\n k = y[i][j]\r\n z.append(k)\r\n elif i+j == n-1:\r\n k = y[i][j]\r\n z.append(k)\r\n\r\na = int((n-1)/2)\r\nfor i in range(n):\r\n if i != a:\r\n z.append(y[a][i])\r\n z.append(y[i][a])\r\nsummation = 0\r\nfor i in z:\r\n summation += int(i)\r\nprint(summation)\r\n", "def f(n,l):\r\n\tc=0\r\n\tif n==1:\r\n\t\treturn sum(l[0])\r\n\tfor i in range(n):\r\n\t\tif i==0 or i==n-1:\r\n\t\t\tc+=l[i][0]+l[i][(n-1)//2]+l[i][-1]\r\n\t\telif i==(n-1)//2:\r\n\t\t\tc+=sum(l[i][:])\r\n\t\telse:\r\n\t\t\tc+=sum(l[i][1:n-1])\r\n\treturn c\r\nn=int(input())\r\nl=[]\r\n\r\nfor i in range(n):\r\n\tl.append(list(map(int,input().split())))\r\n\r\nprint(f(n,l))", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a = [int(i) for i in input().split()]\r\n if i != n // 2:\r\n ans += a[i] + a[n//2] +a[n-1-i]\r\n else:\r\n for j in range(n):\r\n ans += a[j]\r\nprint(ans)\r\n\r\n", "n = int(input())\r\na = []\r\nmid = (n - 1) // 2\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nc = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or j == mid or i == mid or i + j == n - 1:\r\n c += a[i][j]\r\nprint(c)", "#177A1 Good Matrix Elements\n\nn = int(input())\n\nmatrix = [0]*n\n\nfor i in range(n):\n entrada = input()\n matrix[i] = [int(x) for x in entrada.split()]\n\nk = int(n/2)\nsuma = 0\nfor i in range(n):\n for j in range(n):\n if i == j or i == k or j == k or i == n-j-1:\n suma += matrix[i][j]\n\nprint(suma)", "n = int(input())\r\nmatrix = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nsum = 0\r\nfor r in range(n):\r\n for c in range(n):\r\n if (r == c) or ((r + c) == n-1) or (r == (n // 2)) or ( c == (n // 2)):\r\n sum += matrix[r][c]\r\nprint(sum)\r\n", "a=int(input())\r\n\r\n\r\n\r\nt=[]\r\n\r\n\r\n\r\n\r\np=0\r\n\r\n\r\n\r\nfor j in range(a):\r\n s= list(map(int,input().split()))\r\n if j==a//2:\r\n p+=sum(s)\r\n t.append([0]*a)\r\n else:\r\n t.append(s)\r\n\r\n\r\n\r\n\r\n\r\nfor k in range(a):\r\n for w in range(a):\r\n if k==w:\r\n p+=t[k][w]\r\n t[k][w]=0\r\n elif w==a//2:\r\n p+=t[k][w]\r\n t[k][w]=0\r\n elif w==a-(1+k):\r\n p+=t[k][w]\r\n t[k][w]=0\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\nprint(p)\r\n\r\n", "n = int(input())\r\nb = 0\r\nc = -n-1\r\nd = n//2\r\nx = []\r\nsum = 0\r\nsum1 = 0\r\nsum2 = 0\r\nsum3 = 0\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n x.append(l)\r\ne = x[d][d]\r\nwhile n>b:\r\n sum += x[b][b]\r\n b+=1\r\nfor j in range(n):\r\n sum1 += x[j][-(j+1)]\r\nfor k in range(n):\r\n sum2 += x[k][d]\r\nfor l in x[d]:\r\n sum3 += l\r\nprint((sum+sum1+sum2+sum3)-(3*e))", "n = int(input())\r\nl = []\r\nrep = 0\r\n\r\nfor k in range(n):\r\n l+= [list(map(int,input().split()))]\r\n\r\nfor i in range(n):\r\n rep += l[i][i]\r\n if n-i-1!= i:\r\n rep += l[i][n-i-1]\r\n if (n-1)//2!= i:\r\n rep += (l[(n-1)//2][i] + l[i][(n-1)//2])\r\n\r\nprint(rep)", "n = int(input())\ntmp = []\nres = 0\nfor i in range(n):\n c = [int(x) for x in input().split(' ')]\n tmp.append(c)\n\nfor i in range(n):\n res += tmp[i][i]\n res += tmp[i][n - i - 1]\n res += tmp[i][n // 2]\nprint(res - 3 * tmp[n // 2][n // 2] + sum(tmp[n // 2]))\n", "import math\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n arr.append([int(j) for j in input().split()])\r\n# print(arr) \r\nmid = math.floor((n-1)/2)\r\nsum = 0\r\nmd = sd = mr = mc = 0\r\nfor j in range(n):\r\n i = mid\r\n mr+= arr[i][j]\r\n# print(mr) \r\n\r\nfor j in range(n):\r\n i = mid\r\n if (i == j):\r\n continue\r\n mc+= arr[j][i] \r\n# print(mc)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if ( i == j and i != mid and j != mid):\r\n # print(arr[i][j])\r\n md+= arr[i][j] \r\n# print(md)\r\n\r\ni = 0\r\nj = n-1\r\nwhile (i < n and j >= 0): \r\n if (i != mid and j != mid and i != j):\r\n # print(i,j)\r\n # print(arr[i][j])\r\n sd+= arr[i][j] \r\n i+=1\r\n j-=1 \r\n# print(sd)\r\n\r\nsum = md + sd + mr + mc\r\nprint(sum)", "from sys import stdin as f\nn = int(input())\nA = [[int(x) for x in line.split()] for line in f]\nS = sum(A[n//2]) + sum(A[i][n//2] for i in range(n))\nD = sum(A[i][i] + A[i][n-i-1] for i in range(n))\nprint(S + D - 3*A[n//2][n//2])\n", "n=int(input())\r\nl=[]\r\nsum=0\r\nfor i in range(n):\r\n stri=input()\r\n l.append(list(map(int,stri.split(\" \"))))\r\nfor i in range(0,n):\r\n sum=sum + l[i][i] + l[i][n-1-i] + l[(n-1)//2][i] + l[i][(n-1)//2]\r\nsum= sum - 3*(l[(n-1)//2][(n-1)//2])\r\nprint(sum)", "a = b = int(input())\nt = 0\nc = 0\nsum1 = 0\nif a == 1:\n s = int(input())\n print(s)\nelse:\n while a:\n a -= 1\n t += 1\n s = input()\n str1 = s.split()\n if t == 1:\n sum1 += int(str1[0])+int(str1[int(b/2)])+int(str1[b-1])\n elif t>1 and t<b and t==int(b/2)+1:\n for i in str1:\n sum1 += int(i)\n elif t>1 and t<b:\n str2 = str1[1:b-1]\n for i in str2:\n sum1 += int(i)\n else:\n sum1 += int(str1[0])+int(str1[int(b/2)])+int(str1[b-1])\n print(sum1)\n\n\t \t\t\t \t\t\t \t \t \t\t \t \t\t \t \t", "n = int(input())\r\nm = []\r\nfor row in range(n):\r\n m.append([int(s) for s in input().split(' ')])\r\nsum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i + j == n - 1 or i == n // 2 or j == n // 2:\r\n sum += m[i][j]\r\nprint(sum)", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef main():\r\n n = int(input())\r\n A = []\r\n for i in range(n):\r\n A.append(list(map(int, input().split())))\r\n ans = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j or i + j == n - 1 or i == (n - 1) // 2 or j == (n - 1) // 2:\r\n ans += A[i][j]\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n f=list(map(int,input().split()))\r\n l.append(f)\r\nk=len(l)-1\r\no=0\r\nfor i in range(n):\r\n o+=l[i][n//2]\r\n o+=l[i][i]+l[i][k]\r\n k-=1\r\no-=(l[n//2][n//2]*3)\r\no+=sum(l[n//2])\r\nprint(o)\r\n\r\n \r\n", "p = lambda: list(map(int, input().split()))\r\n\r\nN = int(input())\r\ngrid = [p() for _ in range(N)]\r\ngood = [[0]*N for _ in range(N)]\r\n\r\n# Main Diagonal\r\nfor i in range(N):\r\n\tgood[i][i] = 1\r\n\r\n# Secondary Diagonal\r\nfor i in range(N):\r\n\tgood[i][N-i-1] = 1\r\n\r\n# Middle Row\r\nfor i in range(N):\r\n\tgood[i][N//2] = 1\r\n\r\n# Middle Column\r\nfor i in range(N):\r\n\tgood[N//2][i] = 1\r\n\r\nS = 0\r\nfor i in range(N):\r\n\tfor j in range(N):\r\n\t\tif good[i][j]:\r\n\t\t\tS += grid[i][j]\r\nprint(S)", "n=int(input())\r\nans=0\r\nmid=n//2\r\nfirst,last=0,n-1\r\nfor i in range(n):\r\n row=input().split()\r\n if i==mid:\r\n temp = [int(i) for i in row]\r\n ans+=sum(temp)\r\n else:\r\n ans+=int(row[first])+int(row[last])+int(row[mid])\r\n first+=1\r\n last-=1\r\n \r\nprint(ans)\r\n ", "import sys\r\nimport math\r\nInput=sys.stdin.readline\r\nmetalica = int(input())\r\nlst=[]\r\nsum=0\r\nfor i in range(metalica):\r\n x=list(map(int,input().split()))\r\n lst.append(x)\r\nfor i in range(metalica):\r\n for j in range(metalica):\r\n if i==j or i+j==metalica-1 or i==math.floor(((metalica-1)/2)) or math.floor(j==((metalica-1)/2)):\r\n sum+=lst[i][j]\r\nprint(sum)", "# Author: S Mahesh Raju\r\n# Username: maheshraju2020\r\n# Date: 31/08/2020\r\nfrom sys import stdin, stdout, setrecursionlimit\r\nfrom math import gcd, ceil, sqrt\r\nfrom collections import Counter, deque\r\nfrom bisect import bisect_left, bisect_right\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nsetrecursionlimit(100000)\r\nmod = 1000000007\r\n\r\nn = ii1()\r\narr = []\r\nfor i in range(n):\r\n arr.append(iia())\r\nitem = []\r\nfor i in range(n):\r\n item.extend([(n // 2, i), (i, n // 2)])\r\n item.extend([(i, i), (i, n - i - 1)])\r\nitem = set(item)\r\nres = 0\r\nfor i in item:\r\n res += arr[i[0]][i[1]]\r\nprint(res)", "n = int(input())\r\nmatrix = [[int(c) for c in input().split()] for _ in range(n)]\r\nres = sum(matrix[r][c] for r in range(n) for c in range(n)\r\n if r == c or r == n - c - 1 or r == n // 2 or c == n // 2)\r\nprint(res)\r\n", "def ucitajDimen():\r\n s = int(input())\r\n return s\r\n\r\n\r\ndef ucitajMat(s):\r\n mat = [[int(i) for i in input().split(' ')] for j in range(s)]\r\n return mat\r\n\r\ndef goodmat(m):\r\n suma = 0\r\n for i in range(len(m)):\r\n for j in range(len(m)):\r\n if i == j:\r\n suma +=m[i][j]\r\n elif i + j == len(m) - 1:\r\n suma += m[i][j]\r\n elif i == (len(m) - 1) / 2:\r\n suma += m[i][j]\r\n elif j == (len(m) - 1) / 2:\r\n suma += m[i][j]\r\n return suma\r\n\r\n\r\ndimn = ucitajDimen()\r\nmatrica = ucitajMat(dimn)\r\nsumica = goodmat(matrica)\r\nprint(sumica)", "n = int(input())\r\nmrow = 0\r\ntsum = 0\r\nfor i in range(n):\r\n a = list(map(float,input().split()))\r\n if i == (n-1)/2:\r\n mrow = sum(a)\r\n else:\r\n tsum = tsum + a[int((n-1)/2)] + a[i] + a[n-i-1]\r\n \r\nprint(int(tsum+mrow))", "n=int(input())\r\na=[]\r\ns=0\r\nfor i in range(n):\r\n\tb=list(map(int,input().split()))\r\n\ta.append(b)\r\ns+=sum(a[int((n-1)/2)])\r\nfor i in range(n):\r\n\ts+=a[i][int((n-1)/2)]\r\n\ts+=a[i][i]\r\n\ts+=a[(n-1)-i][i]\r\nk=int((n-1)/2)\t\r\nprint(s-3*(a[k][k]))", "matriz=[]\r\n\r\nn=int(input())\r\nsuma=0\r\n\r\nfor i in range(n):\r\n numeros_string =input()\r\n\r\n #convierto lista string a lista de enteros\r\n numeros_list = numeros_string.split()\r\n map_object = map(int, numeros_list)\r\n list_of_integers = list(map_object)\r\n matriz.append(list_of_integers)\r\n\r\nfor j in range(n//2):\r\n suma=suma+matriz[j][j]+matriz[j][n-1-j]+matriz[n-1-j][j]+matriz[n-1-j][n-1-j]\r\n suma=suma+matriz[n//2][j]+matriz[n//2][n-1-j]\r\n suma=suma+matriz[j][n//2]+matriz[n-1-j][n//2]\r\n\r\nsuma=suma+matriz[n//2][n//2]\r\n\r\n\r\nprint(suma)", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().split())))\r\nsum = 0\r\nfor i in range(n):\r\n sum+=matrix[i][i]\r\n sum+=matrix[i][n-i-1]\r\n sum+=matrix[i][n//2]\r\n sum+=matrix[n//2][i]\r\nsum-=3*matrix[n//2][n//2]\r\nprint(sum)\r\n", "n, res = int(input()), []\r\nfor i in range(n):\r\n res.append([int(i) for i in input().split()])\r\nmid = int(n/2)\r\ns1 = sum(res[mid])\r\ns2 = sum([res[i][mid] for i in range(n)])\r\ns3 = sum([res[i][i] for i in range(n)])\r\ns4 = sum([res[i][-i-1] for i in range(n)])\r\nprint(s1 + s2 + s3 + s4 - res[mid][mid]*3)\r\n", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\ns = 0\r\nfor i in range(n):\r\n if i==n//2:\r\n for j in range(n):\r\n s += a[j][i]\r\n else:\r\n s += a[i][i]+a[n-i-1][i]+a[n//2][i]\r\nprint(s)", "n = int(input())\r\na = []\r\ns = 0\r\nfor i in range(n):\r\n a = input().split()\r\n for j in range(n):\r\n if i == j or i + j == n - 1 or i == n // 2 or j == n // 2:\r\n s += int(a[j])\r\nprint(s)", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\nd=list(zip(*l))\r\ns=sum(l[(n-1)//2])+sum(d[(n-1)//2])\r\nfor i in range(n):\r\n s+=l[i][i]+l[i][n-1-i]\r\nprint(s-((3)*l[n//2][n//2]))\r\n", "from collections import defaultdict\r\n\r\ndef get_right_diagonals(arr):\r\n rows = len(arr)\r\n hashmap = {}\r\n for i in range(rows):\r\n hashmap[(rows-1-i, i)] = arr[rows-1-i][i]\r\n return hashmap\r\n\r\ndef get_left_diagonals(arr):\r\n rows = len(arr)\r\n hashmap = {}\r\n for i in range(rows):\r\n hashmap[(i, i)] = arr[i][i]\r\n return hashmap\r\n\r\ndef get_middle_row(arr):\r\n rows = len(arr)\r\n mid = rows // 2\r\n hashmap = {}\r\n for i in range(n):\r\n hashmap[(mid, i)] = arr[mid][i]\r\n return hashmap\r\n\r\ndef get_middle_column(arr):\r\n rows = len(arr)\r\n mid = rows // 2\r\n hashmap = {}\r\n for i in range(n):\r\n hashmap[(i, mid)] = arr[i][mid]\r\n return hashmap\r\n\r\ndef good_matrix_elements(A):\r\n # number of rows and column will be odd - that is a given assumption\r\n # n x n matrix\r\n leftDiagonal = get_left_diagonals(A)\r\n rightDiagonal = get_right_diagonals(A)\r\n middleRow = get_middle_row(A)\r\n middleColumn = get_middle_column(A)\r\n result = defaultdict(int)\r\n for k, v in leftDiagonal.items():\r\n if k not in result:\r\n result[k] = v\r\n for k, v in rightDiagonal.items():\r\n if k not in result:\r\n result[k] = v\r\n for k, v in middleColumn.items():\r\n if k not in result:\r\n result[k] = v\r\n for k, v in middleRow.items():\r\n if k not in result:\r\n result[k] = v\r\n print(sum(result.values()))\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n i = 0\r\n arr = []\r\n while i < n:\r\n tmp = list(map(int, input().split()))\r\n arr.append(tmp)\r\n i += 1\r\n good_matrix_elements(arr)", "n=int(input())\r\na=[i for i in range (0,n)]\r\nfor i in range (0,n):\r\n\ta[i]=list(map(int,input().split()))\r\nsum=0\r\n\r\nfor i in range (0,n):\r\n\tfor j in range (0,n):\r\n\t\tif i==j:\r\n\t\t\tsum=sum+a[i][j]\r\n\t\telif i==(n-1)//2 or j==(n-1)//2:\r\n\t\t\tsum=sum+a[i][j]\r\n\t\telif i+j==n-1:\r\n\t\t\tsum=sum+a[i][j]\r\nprint(sum)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jan 11 16:47:21 2023\r\n\r\n@author: 21pt24\r\n\"\"\"\r\n\r\n\r\nn=int(input())\r\nmid=int(n/2)\r\nmat=[]\r\ncount=0\r\nfor i in range(n):\r\n l=input().split()\r\n l=[int(i) for i in l]\r\n mat.append(l)\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or i==mid or j==mid or max([i,j])+min([i,j])==n-1:\r\n count+=mat[i][j]\r\n \r\nprint(count) \r\n \r\n", "n=int(input())\r\nmat=[]\r\nfor i in range(n):\r\n ip=input()\r\n mat.append(list(map(int,ip.split(' '))))\r\nsum_values=0\r\nfor i in range(len(mat)):\r\n for j in range(len(mat[i])):\r\n if i==j:\r\n sum_values+=mat[i][j]\r\nfor i in range(len(mat)):\r\n for j in range(len(mat[i])):\r\n if n-i-1==j:\r\n sum_values+=mat[i][j]\r\n\r\nfor i in range(len(mat)):\r\n for j in range(len(mat[i])):\r\n if i==(n-1)/2.0:\r\n sum_values+=mat[i][j]\r\nfor i in range(len(mat)):\r\n for j in range(len(mat[i])):\r\n if j==(n-1)/2.0:\r\n sum_values+=mat[i][j]\r\n\r\nprint(sum_values-3*(mat[int((n-1)/2)][int((n-1)/2)]))\r\n", "n=int(input())\r\nmatrix=[]\r\nsum=0\r\nfor i in range(n):\r\n matrix.append([int(y) for y in input().split()])\r\nfor i in range(1,n+1):\r\n for j in range(1,n+1):\r\n if i==j:\r\n sum+=matrix[i-1][j-1]\r\n if i == (n//2) + 1:\r\n sum+=matrix[i-1][j-1]\r\n if j == (n//2) + 1:\r\n sum+=matrix[i-1][j-1]\r\n if i+j==n+1:\r\n sum+=matrix[i-1][j-1]\r\n \r\nprint(sum-3*matrix[n//2][n//2])", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int ,input().split())))\r\nsum=0\r\nfor i in range(0,n):\r\n sum=sum+a[i][i]\r\nfor i in range(0,n):\r\n sum=sum+a[i][n-i-1]\r\nr=(n-1)//2\r\nfor i in range(0,n):\r\n sum=sum+a[r][i]\r\nc=(n-1)//2\r\nfor i in range(0,n):\r\n sum=sum+a[i][c]\r\nx=(n-1)//2\r\nsum=sum-a[x][x]*3\r\nprint(sum)", "def is_good(x, y, n):\r\n if x == y:\r\n return True\r\n if (x + y) == (n - 1): # (n - 1) for zero-indexing\r\n return True\r\n if x == ((n - 1) / 2):\r\n return True\r\n if y == ((n - 1) / 2):\r\n return True\r\n\r\n return False\r\ndef solve(n, matrix):\r\n good_sum = 0\r\n for x in range(n):\r\n for y in range(n):\r\n if is_good(x, y, n):\r\n good_sum += matrix[x][y]\r\n\r\n return good_sum\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n matrix = []\r\n for row in range(n):\r\n matrix.append([int(x) for x in input().split(sep=\" \")])\r\n\r\n result = solve(n, matrix)\r\n print(result)\r\n\r\n\r\n", "n = int(input()); V = 0\r\nif n > 2:\r\n for i in range(n):\r\n L = [int(x) for x in input().split()]\r\n if i == 0.5*(n-1):\r\n V += sum(L)\r\n else:\r\n V += L[i] + L[int((n-1)/2)] + L[n-i-1]\r\n print(V)\r\nelse:\r\n print(int(input()))", "n = int(input())\r\nmang = [None]*n\r\nfor i in range(n):\r\n mang[i] = [int(nhap) for nhap in input().split()]\r\nsum = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if ( i==j or i == n-1-j or i == (n-1)/2 or j == (n-1)/2 ):\r\n sum = sum + mang[i][j]\r\nprint(sum)", "n = int(input())\r\ns = 0\r\nfor x in range(n):\r\n\tl = list(map(int,input().split()))\r\n\tif x == (n//2):\r\n\t\ts += (sum(l))\r\n\telse:\r\n\t\ts += (l[x]+l[-(x+1)]+l[(n//2)])\r\n\r\nprint(s)", "from math import ceil\r\nn = int(input())\r\nsumm = 0\r\ncenter = ceil(n/2) - 1\r\nfor i in range(n):\r\n\tinp = list(map(int, input().rstrip().split()))\r\n\tif i != n-(i+1):\r\n\t\tsumm += inp[i] + inp[n-(i+1)] + inp[center]\r\n\telse:\r\n\t\tsumm += sum(inp)\r\nprint(summ)", "n = int(input())\na = [[int(x) for x in input().split()] for i in range(n)]\nans = sum([sum([a[i][j] for j in range(n) if ((i == n // 2) or (j == n // 2) or (i == j) or (n - 1 - i == j))]) for i in range(n)])\nprint(ans)\n", "board_size = int(input()) # always *odd*\nboard = []\nfor _ in range(board_size):\n line = [int(num) for num in input().split()]\n board.append(line)\nsum_good = 0\n\n# middle row\nmid_row = board[(board_size-1)//2]\nfor num in mid_row:\n sum_good += num\n\n# middle column\nmid_col = []\nfor i in range(board_size):\n mid_col.append(board[i][(board_size-1)//2])\nfor num in mid_col:\n sum_good += num\n\n# main diagonal\nmain_diag = []\nfor i in range(board_size):\n main_diag.append(board[i][i])\nfor num in main_diag:\n sum_good += num\n\n# secondary diagonal\nscnd_diag = []\nfor i in range(board_size):\n scnd_diag.append(board[i][(board_size-1)-i])\nfor num in scnd_diag:\n sum_good += num\n\ncenter = board[(board_size-1)//2][(board_size-1)//2]\n\nsum_good -= 3 * center \nprint(sum_good)\n", "n=int(input())\r\n\r\nl=[]\r\nx=[]\r\nfor i in range(n):\r\n y=input()\r\n l.append(y.split())\r\n\r\nfor i in range(n):\r\n x.append(int(l[i][i]))\r\n if (n-i-1 != i):\r\n x.append(int(l[i][n-i-1]))\r\n x.append(int(l[(n//2)][i]))\r\n x.append(int(l[i][(n//2)]))\r\nprint(sum(x))", "n = int(input())\r\nmat = [[int(y) for y in input().split()] for x in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n for ii in range(n):\r\n if i == ii:\r\n s = s + mat[i][ii]\r\n elif ii == (n-i-1):\r\n s = s + mat[i][ii]\r\n elif i == ((n+1)//2)-1:\r\n s = s + mat[i][ii]\r\n elif ii == ((n+1)//2)-1:\r\n s = s + mat[i][ii]\r\nprint(s)\r\n", "# problem/177/A2\n\nn = int(input())\n\nmatrix = []\nfor i in range(n):\n matrix.append([int(s) for s in input().split(' ')])\n\nindices = []\n\n# compute diagonal indices\nfor i in range(n):\n indices.append([i, i])\n\n# compute 2nd diagonal indices\nfor i in range(n):\n if [i, n-1-i] not in indices:\n indices.append([i, n-1-i])\n\n# compute middle row\nfor i in range(n):\n if [i, int((n-1)/2)] not in indices:\n indices.append([i, int((n-1)/2)])\n\n# compute middle col\nfor i in range(n):\n if [int((n-1)/2), i] not in indices:\n indices.append([int((n-1)/2), i])\n\n# add all\ntotal = 0\nfor idx in indices:\n col, row = idx\n # print(col, row)\n total += matrix[row][col]\n\n# print(matrix)\nprint(total)", "def sum_good_matrix_elements(matrix:list[list], n:int) -> int :\r\n middle = n // 2 \r\n good_sum = 0 \r\n\r\n for i in range(n):\r\n good_sum += matrix[i][i] + matrix[i - n][n - i -1] + matrix[middle][i] + matrix[i][middle]\r\n \r\n good_sum -= (3 * matrix[middle][middle])\r\n \r\n return good_sum\r\n \r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n matrix = [[int(i) for i in input().split()] for _ in range(n)]\r\n \r\n print(sum_good_matrix_elements(matrix, n))", "no=int(input())\r\nmat=[]\r\n\r\nfor i in range(no):\r\n\tx=list(map(int,input().split()))\r\n\tmat.append(x)\r\n\t\r\n\r\ncount=0\r\nmid=no//2\r\nfor i in range(no):\r\n\tcount+=mat[i][i]\r\n\tmat[i][i]=0\t \r\n\tcount += mat[i][no-(i+1)] \r\n\tmat[i][no-(i+1)] = 0\r\n\r\nfor i in range(no):\r\n\tcount+=mat[mid][i]\r\n\tmat[mid][i]=0\r\n\t\r\nfor i in range(no):\r\n\tcount+=mat[i][mid]\r\n\tmat[i][mid]=0\r\n\r\nprint(count)", "# LUOGU_RID: 92101552\nn = int(input())\r\nmatrix = []\r\nfor x in range(n):\r\n row = list(map(int, input().split()))\r\n matrix.append(row)\r\n\r\nsums = 0\r\n\r\nfor x in range(n):\r\n value = matrix[x][x]\r\n sums += value\r\n\r\nfor x in range(n):\r\n value = matrix[x][n - x - 1]\r\n sums += value\r\n\r\nfor x in range(n):\r\n value = matrix[x][(n - 1) // 2]\r\n sums += value\r\n\r\nfor x in range(n):\r\n value = matrix[(n - 1) // 2][x]\r\n sums += value\r\n\r\nmiddle = matrix[(n - 1) // 2][(n - 1) // 2]\r\nmiddle = middle * 3\r\nsums -= middle\r\n\r\nprint(sums)\r\n", "\"\"\"\r\ninstagram : essipoortahmasb2018\r\ntelegram channel : essi_python\r\n\"\"\"\r\nSum = 0\r\ni = input\r\nn = int(i())\r\nl = []\r\n\r\nfor i in range(n):\r\n l.append([*map(int,input().split())])\r\n\r\nfor i in range(n):\r\n Sum+= l[i][i]\r\n l[i][i] = 0\r\n Sum+=l[i][n//2]\r\n l[i][n//2] = 0\r\na = 0\r\nb = n - 1\r\nfor i in range(n):\r\n Sum+=l[a][b]\r\n l[a][b]=0\r\n Sum+=l[n//2][b]\r\n l[n//2][b] = 0\r\n a+=1\r\n b-=1\r\nprint(Sum)\r\n", "n = int(input())\narr = []\nfor i in range(n):\n\tarr.append([int(x) for x in input().split()])\ntotal = 0\nfor i in range(n):\n\ttotal += arr[i][i] \nfor i in range(n):\n\ttotal += arr[n-i-1][i]\nfor i in range(n):\n\ttotal += arr[n//2][i]\nfor i in range(n):\n\ttotal += arr[i][n//2]\ntotal -= arr[n//2][n//2] * 3\nprint(total)", "import bisect,sys,os,random,collections,re\r\n\r\n\r\n#All my input ways\r\nini = lambda : int(input())\r\ninf = lambda : float(input())\r\ninl = lambda : list(map(str,input().split()))\r\ninli = lambda : list(map(int,input().split()))\r\ninlf = lambda : list(map(float,input().split()))\r\ninlc = lambda : list(map(str, input().split()[0]))\r\ninll = lambda n : [input() for _ in range(n)]\r\ninlli = lambda n : [int(input()) for _ in range(n)]\r\ninllf = lambda n : [float(input()) for _ in range(n)]\r\ninllc = lambda n : [input()[0] for _ in range(n)]\r\n#Others\r\nbs = lambda list,a : bisect.bisect_left(list,a)\r\nisEM = lambda n : re.match(r\"([\\w\\.-]+)@([\\w\\.-]+)(\\.[\\w\\.]+)\",n)\r\n\r\ndef solve():\r\n n = ini()\r\n l = []\r\n for i in range(n):\r\n f = inli()\r\n l.append(f)\r\n \r\n \r\n sum = 0\r\n res = []\r\n \r\n for i in range(n):\r\n for j in range(n):\r\n if i == j and [i,j] not in res:\r\n sum += l[i][j]\r\n res.append([i,j])\r\n \r\n if i + j == n - 1 and [i,j] not in res:\r\n sum += l[i][j]\r\n res.append([i,j])\r\n \r\n if i == n // 2 and [i,j] not in res:\r\n sum += l[i][j]\r\n res.append([i,j])\r\n \r\n if j == n // 2 and [i,j] not in res:\r\n sum += l[i][j]\r\n res.append([i,j])\r\n print(sum)\r\nif __name__ == \"__main__\":\r\n for _ in range(1):\r\n solve()", "n = int(input())\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append([int(c) for c in input().split()])\r\n\r\nres = 0\r\nfor r in range(n):\r\n for c in range(n):\r\n e = matrix[r][c]\r\n if r == c:\r\n res += e\r\n elif r == n - c - 1:\r\n res += e\r\n elif r == n // 2:\r\n res += e\r\n elif c == n // 2:\r\n res += e\r\n\r\nprint(res)\r\n", "n = int(input())\r\na = []\r\nfor r in range(n):\r\n row = [int(x) for x in input().split()]\r\n a.append(row)\r\ntot = 0\r\nfor r in range(n):\r\n for c in range(n):\r\n # check (r, c) is good or not\r\n if r == c or r + c == n-1 or r == n//2 or c == n//2:\r\n tot += a[r][c]\r\nprint(tot)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n\ta.append(list(map(int,input().split())))\r\nans=0\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j or n-1-i==j\tor n//2==i or n//2==j:\r\n\t\t\tans += a[i][j]\r\nprint(ans)", "n=int(input())\r\nmat=[]\r\nfor i in range(0,n):\r\n temp=list(input().split())\r\n mat.append([int(i) for i in temp])\r\nSum=0\r\nfor i in range(0,n):\r\n Sum+=mat[i][i]\r\n Sum+=mat[i][n-i-1]\r\n Sum+=mat[(n-1)//2][i]\r\n Sum+=mat[i][(n-1)//2]\r\nSum-=3*mat[(n-1)//2][(n-1)//2]\r\nprint(Sum)", "\r\n\r\nif __name__ == '__main__':\r\n\r\n n = int(input())\r\n good_sum = 0\r\n matrix = []\r\n main_diagonal = []\r\n second_diagonal = []\r\n mid_row = n // 2\r\n mid_column = n // 2\r\n for i in range(n):\r\n matrix.append([])\r\n row = list(map(int, input().split()))\r\n for j in range(n):\r\n if i == j and i != mid_row:\r\n main_diagonal.append([i, j])\r\n if (i + j) == (n - 1) and i != mid_row:\r\n second_diagonal.append([i, j])\r\n matrix[i].append(row[j])\r\n\r\n for i in range(n):\r\n for j in range(n):\r\n if (i == mid_row or j == mid_column) or \\\r\n [i, j] in main_diagonal or [i, j] in second_diagonal:\r\n good_sum += matrix[i][j]\r\n\r\n print(good_sum)\r\n", "\r\nn = int(input())\r\n\r\nmatrix = [input().split() for _ in range(n)]\r\nsuma = 0\r\n\r\nfor j in range(n):\r\n\tsuma = suma + int(matrix[j][j])\r\n\tif j != n//2 and n>1 :\r\n\t\tsuma = suma + int(matrix[n//2][j])\r\n\t\tsuma = suma + int(matrix[j][n//2])\r\n\r\nfor i in reversed(range(n)):\r\n\tif i != (n//2) and n > 1:\r\n\t\tsuma = suma + int(matrix[i][n-i-1])\r\n\r\nprint(suma)\r\n\r\n", "n=int(input())\r\ns=0\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\n if _!= n//2:\r\n s+=l[_][_]+l[_][n-1-_]+l[_][n//2]\r\n else:\r\n s+=sum(l[_])\r\nprint(s)\r\n", "n = int(input())\r\nip = [[int(x) for x in input().split()] for _ in range(n)]\r\nans = 0\r\nfor i in range(n):\r\n ans += ip[n//2][i]\r\n ans += ip[i][n//2]\r\n ans += ip[i][i]\r\n ans += ip[n-1-i][i]\r\nans -= ip[n//2][n//2] * 3\r\nprint(ans)", "import time\nimport collections\n\nclass Time_test:\n def __enter__(self):\n self.enter_time = time.time()\n def __exit__(self, exc_type, exc_val, exc_tb):\n print(\"Command was executed in\", time.time()-self.enter_time)\n\nn = int(input())\n\ns = 0\nfor i in range(n):\n ipt = [int(x) for x in input().split()]\n if n//2 == i:\n s += sum(ipt)\n continue\n s += ipt[n//2] + ipt[i] + ipt[n-i-1]\n\nprint(s)\n", "n = int(input())\nm = [[int(i) for i in input().split()] for i in range(n)]\n\na = 0\nb = 0\nc = 0\nd = 0\ns = 0\n\nif n==3:\n for i in range(n):\n s += sum(m[i])\nelse:\n for i in range(n//3):\n a += m[len(m)//2][i]\n b += m[i][len(m)//2]\n c += m[i][i]\n for i in range(n-n//3, n):\n a += m[len(m)//2][i]\n b += m[i][len(m)//2]\n c += m[i][i]\n\n p = 0\n for i in range(n-1,n-n//3-1,-1):\n d += m[i][p]\n p += 1\n p = n-n//3\n for i in range(n//3-1,-1,-1):\n d += m[i][p]\n p += 1\n\n for h in range(n//3, n-n//3):\n for w in range(n//3, n-n//3):\n s += m[h][w]\n\n s += a+b+c+d\nprint(s)\n", "if __name__ == '__main__':\r\n s = 0\r\n n = int(input())\r\n dgnl = 0\r\n sec_dgnl= n -1\r\n mid_col = int((((n-1)/2)))\r\n for i in range(n):\r\n \r\n l = list(map(int, input().split()))\r\n \r\n if i == ((n-1)/2):\r\n hehe = sum(l)\r\n else:\r\n s += l[dgnl] + l[sec_dgnl] + l[mid_col]\r\n \r\n dgnl += 1\r\n sec_dgnl -= 1\r\n s += hehe\r\n print(s)\r\n \r\n ", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n a = input().split()\r\n x += int(a[i]) + int(a[n - i - 1]) + int(a[(n - 1) //2])\r\n if i == (n - 1) // 2:\r\n for j in range(n):\r\n x += int(a[j])\r\n x -= int(a[(n - 1) //2]) * 3\r\nprint(x)\r\n", "n = int(input())\r\n\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n\r\n row = input().split(\" \")\r\n matrix.append(row)\r\n\r\n\r\nres = 0\r\n\r\nfor i in range(n):\r\n res += int(matrix[i][i])\r\n\r\nfor i in range(n):\r\n res += int(matrix[i][n - 1 - i])\r\n\r\nfor i in range(n):\r\n res += int(matrix[n // 2][i])\r\n\r\nfor i in range(n):\r\n res += int(matrix[i][n // 2])\r\n\r\nprint(res - 3 * int(matrix[n // 2][n // 2]))\r\n", "n = int(input())\r\na = []\r\nans = 0\r\nfor i in range(n):\r\n a.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n ans += a[i][i] + a[i][n//2] + a[i][n-i-1]\r\nans += sum(a[n//2]) - 3*a[n//2][n//2]\r\nprint(ans)\r\n", "#Good Matrix Elements\r\n\"\"\"\r\nCreated on Sat Jan 7 20:31:14 2023\r\n\r\n@author: 21pt05\r\n\"\"\"\r\n\r\nn=int(input())\r\nmyList=[]\r\nfor i in range(n):\r\n val=list(input().split())\r\n myList.append(val)\r\n\r\ntotSum=0\r\nmid = int((n-1)/2)\r\nfor i in range(len(myList)):\r\n for j in range(n):\r\n if i==j or j==mid or i==mid or i+j==n-1:\r\n totSum+=int(myList[i][j])\r\n\r\nprint(totSum)\r\n", "#loser707\r\nn=int(input())\r\nans=0\r\nfor i in range(1,n+1):\r\n a=list(map(int,input().split()))\r\n if i==(n+1)//2:\r\n ans=ans+sum(a)\r\n else:\r\n s=a[i-1]+a[-i]+a[n//2]\r\n ans=ans+s\r\nprint(ans)", "mas = []\r\nn = int(input())\r\nfor i in range(0,n,1):\r\n mas.append(list(map(int, input().split(' '))))\r\nif n == 3:\r\n s = 1\r\nelse:\r\n s = int((n-1)/2)\r\nsummm = 0\r\nfor i in range(0,n,1):\r\n # print(\"sum += \" + str(mas[i][s]))\r\n summm += mas[i][s]\r\n # print(\"sum += \" + str(mas[s][i]))\r\n summm += mas[s][i]\r\n if i != s:\r\n # print(\"sum += \" + str(mas[i][i]))\r\n summm += mas[i][i]\r\n # print(\"sum += \" + str(mas[n-i-1][i]))\r\n summm += mas[n-i-1][i]\r\nprint(summm-mas[s][s])", "n = int(input())\r\n\r\nl = []\r\ns = 0\r\nx = int(n / 2)\r\n\r\nfor i in range(n):\r\n\tl.append(list(map(int, input().split())))\r\n\t\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i == x or j == x or i == j or n - j - 1 == i:\r\n\t\t\ts += l[i][j]\r\n\t\t\t\r\nprint(s)", "\"\"\"\nInput format:\n3\n1 2 3\n4 5 6\n7 8 9\n\"\"\"\nn = int(input())\narr = [[0 for i in range(n)] for j in range(n)]\n\nfor i in range(n):\n inp = input().split()\n j = 0\n for x in inp:\n arr[i][j] = int(x)\n j += 1\n\nsum = 0\n# main diagonal\ni = j = 0\nwhile i < n and j < n:\n sum += arr[i][j]\n arr[i][j] = 0\n i += 1\n j+= 1\n \n# secondery diagonal\ni = 0; j = n-1\n\nwhile i<n and j>=0:\n sum += arr[i][j]\n arr[i][j] = 0\n i+=1\n j-=1\n\n#middle row\ni = n//2\nj = 0\nwhile i<n and j<n:\n sum += arr[i][j]\n arr[i][j] = 0\n j += 1\n\n#middle column\ni = 0\nj = n//2\nwhile i < n:\n sum += arr[i][j]\n arr[i][j] = 0\n i += 1\n\nprint(sum)\n", "n = int(input())\nmid = n // 2\nresult = 0\nfor r in range(n):\n for c, x in enumerate(map(int, input().split())):\n if r == mid or c == mid or r == c or r == n - 1 - c:\n result += x\nprint(result)\n", "n = int(input())\r\nlst = list()\r\nfor i in range(n):\r\n sub = list(map(int, input().split()))\r\n lst.append(sub)\r\n\r\ntotal = 0\r\nmid = (n - 1) // 2\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or j == n - i - 1:\r\n total += lst[i][j]\r\n\r\ntotal += sum(lst[mid][j] for j in range(n))\r\ntotal += sum(lst[i][mid] for i in range(n))\r\ntotal -= 2 * lst[mid][mid]\r\nprint(total)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if i!=n//2:\r\n count+=a[i]+a[len(a)-i-1]+a[len(a)//2]\r\n else:\r\n for j in range(len(a)):\r\n count+=a[j]\r\nprint(count)\r\n", "n=int(input())\r\na=[]\r\ns=0\r\nfor i in range(n):\r\n\ta.append(list(map(int,input().split())))\t\r\nfor i in range(n):\r\n\ts+=a[i][i]\r\n\ts+=a[n-i-1][i]\r\n\ts+=a[n//2][i]\r\n\ts+=a[i][n//2]\r\nprint(s-3*a[n//2][n//2])\r\n", "# import sys\r\n# sys.stdin=open(\"input.in\",\"r\")\r\n# sys.stdout=open(\"output.out\",\"w\")\r\nx=int(input())\r\ny=[]\r\ncount=0\r\nfor i in range(x):\r\n\ty.append(list(map(int,input().split())))\r\nfor i in range(x):\r\n\tfor j in range(x):\r\n\t\tif i==j or i==(x-1)/2 or j==(x-1)/2 or j==x-1-i:\r\n\t\t count+=y[i][j]\r\nprint(count) \r\n", "n = int(input())\r\nmid_row = mid_col = (1+n)//2-1\r\nsum_mat = 0\r\nmat = []\r\n\r\nfor i in range(n):\r\n mat.append(list(map(int,input().split())))\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n sum_mat+=mat[i][j]\r\n elif j == mid_col or i == mid_row:\r\n sum_mat+=mat[i][j]\r\n elif n-1-i == j:\r\n sum_mat+=mat[i][j]\r\n\r\n\r\nprint(sum_mat)\r\n", "n = int(input())\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for j in range(n):\r\n if j in [i, n - i - 1]:\r\n pass\r\n elif n - 1 not in [i * 2, j * 2]:\r\n continue\r\n cnt += a[j]\r\n\r\nprint(cnt)", "n = int(input())\r\nlis=[]\r\nfor i in range(n):\r\n li = list(map(int,input().split()))\r\n lis.append(li)\r\nans=0\r\nfor i in range(n):\r\n ans+=lis[i][i]\r\n lis[i][i]=0\r\nfor i in range(n):\r\n ans+=lis[i][n-i-1]\r\n lis[i][n-i-1]=0\r\nfor i in range(n):\r\n ans+=lis[n//2][i]\r\n lis[n//2][i]=0\r\n ans+=lis[i][n//2] \r\n lis[i][n//2]=0\r\nprint(ans) \r\n", "n = int(input())\na = [list(map(int,input().split())) for I in range(n)]\nans = 0\nfor I in range(n):\n for j in range(n):\n if I == j or I == n-j-1 or I == n//2 or j == n//2:\n ans += a[I][j]\nprint(ans)\n\n ", "n=int(input())\r\nMatrix=[]\r\nfor i in range(n):\r\n Matrix.append(str(input()).split())\r\nm=int((n-1)/2)\r\naa=0\r\nfor i in range(n):\r\n aa=aa+int(Matrix[i][m])\r\nfor i in range(n):\r\n aa=aa+int(Matrix[m][i])\r\nfor i in range(n):\r\n aa=aa+int(Matrix[i][i])\r\nfor i in range(n):\r\n aa=aa+int(Matrix[i][n-i-1])\r\n\r\nprint(aa-3*int(Matrix[m][m]))\r\n\r\n\r\n", "l = []\r\nn = int(input())\r\nfor i in range(n):\r\n a = map(int, input().split())\r\n l.append(list(a))\r\nadd = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i == j):\r\n add += l[i][j]\r\n if (i+j == n-1):\r\n add += l[i][j]\r\n if (i == n//2) or (j == n//2):\r\n add += l[i][j]\r\nadd = add-(2*(l[n//2][n//2]))\r\nprint(add)\r\n", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\nk=int((n/2))\r\ns=0\r\n#print('d1')\r\nfor i in range(0,n):\r\n #print(l[i][i])\r\n s+=l[i][i]\r\n#x=0\r\n#print('d2')\r\nfor i in range(0,n):\r\n #print(l[n-1-i][i])\r\n s+=l[n-i-1][i]\r\n\r\n\r\ns+=sum(l[k])\r\n#print('s2')\r\nfor i in range(0,n):\r\n #print(l[i][k])\r\n s+=l[i][k]\r\nprint(s-((l[k][k])*3))\r\n \r\n", "def goodmat(s,n):\r\n mid=int((n-1)/2)\r\n res=0\r\n for i in range(n):\r\n res+=s[mid][i]\r\n res+=s[i][i]\r\n res+=s[i][mid]\r\n res+=s[i][n-i-1]\r\n print(res-3*s[mid][mid])\r\n\r\nn=int(input())\r\ns=[]\r\nfor i in range(n):\r\n s.append(list(map(int,input().split())))\r\ngoodmat(s,n)\r\n", "n, s = int(input()), 0\r\nm = (n - 1) // 2\r\n\r\nfor i in range(n):\r\n row = list(map(int, input().split()))\r\n if i == m:\r\n s += sum(row)\r\n else:\r\n s += row[i] + row[m] + row[-i-1]\r\n\r\nprint(s)", "\n# MasterKali\n\nfrom sys import stdin\nfrom collections import Counter\nfrom math import sqrt, factorial, log10, log, floor, ceil\nfrom itertools import permutations, combinations, combinations_with_replacement\n\ninput = stdin.readline\ndef li(): return list(map(int, input().split()))\ndef lis(): return list(map(str, input().split()))\ndef mp(): return map(int, input().split())\ndef inp(): return int(input())\ndef inps(): return str(input().strip())\ndef pr(n): return stdout.write(str(n)+\"\\n\")\n\nINF = float('inf')\n\n\ndef solve():\n\tn = inp()\n\tres = 0\n\n\tfor i in range(n):\n\t\ta = li()\n\t\tfor j in range(n):\n\t\t\tif i == j or i == (n-1)//2 or j == (n-1)//2 or n-1-j == i:\n\t\t\t\tres+=a[j]\n\n\tprint(res)\n\n\n\nt = 1\nfor i in range(t):\n\t\n\tsolve()\n\n", "import sys\r\nn = int(sys.stdin.readline().strip())\r\nmatrix = []\r\n \r\nfor _ in range(n):\r\n matrix.append(list(map(int,sys.stdin.readline().strip().split())))\r\n \r\ntotal = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n total += matrix[i][j]\r\n elif i+j == n-1:\r\n total += matrix[i][j]\r\n elif i == n//2:\r\n total += matrix[i][j]\r\n elif j == n//2:\r\n total += matrix[i][j]\r\nsys.stdout.write(str(total))", "n = int(input())\r\nq = []\r\na = []\r\nfor i in range(n):\r\n l = list(input().split())\r\n l = [int(j) for j in l]\r\n q.append(l)\r\nfor i in range(n):\r\n for j in range(n):\r\n if (i == j) or (i + j == n - 1) or (i == (n // 2)) or (j == (n // 2)):\r\n a.append(q[i][j])\r\nprint(sum(a))", "n=int(input())\r\np=int(n/2)\r\nli=[]\r\nnli=[]\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n li.append(m)\r\nif n<=3:\r\n for i in range(n):\r\n for j in range(n):\r\n nli.append(li[i][j])\r\nelse:\r\n for i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n nli.append(li[i][j])\r\n if j==(n-i-1):\r\n\r\n if i==j:\r\n continue\r\n else:\r\n nli.append(li[i][j])\r\n\r\n if n%2!=0:\r\n if i==p or j==p:\r\n if i==j:\r\n continue\r\n else:\r\n nli.append(li[i][j])\r\n\r\nprint(sum(nli))\r\n", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n els = list(map(int, input().split()))\r\n for j in range(n):\r\n if i == j or j == n // 2 or j == n-i-1 or i == n // 2:\r\n s += els[j]\r\nprint(s)", "def inp():\r\n return(int(input()))\r\n\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\n\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n\r\nn = inp()\r\n\r\nmatrix = []\r\n\r\nfor i in range(n):\r\n arr = inlt()\r\n matrix.append(arr)\r\n\r\n\r\nresult = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j or i + j == n - 1 or i == (n//2) or j == (n//2) :\r\n result += matrix[i][j]\r\n\r\n\r\n\r\n\r\nprint(result)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [[0]*n for _ in range(n)]\r\nfor i in range(n):\r\n a[i] = [int(j) for j in input().split()]\r\n \r\nmyset = {(0,0)}\r\nfor i in range(n):\r\n myset.add((i,i))\r\n myset.add((i,n-1-i))\r\n myset.add( (i,(int)( (n-1)/2 )) )\r\n myset.add( ((int)( (n-1)/2 ),i))\r\n \r\ntotal = 0\r\nfor tup in myset:\r\n x,y = tup\r\n total += a[x][y]\r\nprint(total)", "n=int(input())\r\nlis=[]\r\nresult=0\r\nfor i in range(n):\r\n li=[]\r\n li=list(map(int,input().split()))\r\n lis.append(li)\r\nfor i in range(n):\r\n for j in range(n):\r\n if i==j:\r\n result+=lis[i][j]\r\n elif i==n//2 or j==n//2:\r\n result+=lis[i][j]\r\n elif j==n-i-1:\r\n result+=lis[i][j]\r\nprint(result)", "n=int(input())\nif n==1:\n print(int(input()))\nelse:\n g=[]\n for i in range(n):\n g.append(list(map(int,input().split())))\n x=n//2\n count=sum(g[x])\n for i in range(n):\n count+=g[i][x]\n count+=g[i][i]+g[i][n-1-i]\n count-=g[x][x]*3\n print(count)\n", "n=int(input())\r\na=[[int(x) for x in input().split()] for i in range(n)]\r\ns=0\r\nfor i in range(n):\r\n for j in range(n):\r\n if(i==j or i==n//2 or j==n//2 or i==n-1-j):\r\n s+=a[i][j]\r\nprint(s)", "size = int(input())\r\nmatrix = []\r\nfor i in range(size):\r\n matrix.append(list(map(int,input().split())))\r\nmask = [[0 for i in range(size)] for j in range(size)]\r\nhalf = int((size-1)/2)\r\nfor i in range(size):\r\n mask[i][i] = 1\r\n mask[size-i-1][i] = 1\r\n mask[half][i] = 1\r\n mask[i][half] = 1\r\nscore = 0\r\nfor i in range(size):\r\n for j in range(size):\r\n if mask[j][i] == 1:\r\n score += matrix[j][i]\r\nprint(score)", "n = int(input())\r\na = [list(map(int, input().split())) for i in range(n)]\r\nanswer = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or n - 1 - i == j or n // 2 == i or n // 2 == j:\r\n answer += a[i][j]\r\nprint(answer)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\ts=list(map(int,input().split()))\r\n\tl.append(s)\r\nm=[]\r\nfor i in range(n):\r\n\tif i == n//2:\r\n\t\tm.append(l[i][i])\r\n\telse:\r\n\t\tm.append(l[i][n//2])\r\n\t\tm.append(l[n//2][i])\r\n\t\tm.append(l[i][i])\r\n\t\tm.append(l[i][n-i-1])\r\nprint(sum(m))", "q=lambda:map(int,input().split())\r\nqi=lambda:int(input())\r\nqs=lambda:input().split()\r\nn,=q()\r\na=[list(q()) for i in range(n)]\r\nprint(sum(a[i][i] for i in range(n))+sum(a[i][n-i-1] for i in range(n))+sum([a[(n)//2][i] for i in range(n)])+sum([a[i][(n)//2] for i in range(n)])-3*a[n//2][n//2])\r\n", "n=int(input())\r\ns=0\r\nl=[]\r\nfor i in range(n):\r\n l.append(list(map(int,input().split())))\r\n if i!= n//2:\r\n s+=l[i][i]+l[i][n-1-i]+l[i][n//2]\r\n else:\r\n s+=sum(l[i])\r\nprint(s)", "n = int(input())\r\nmatrix = []\r\nsum = 0\r\nfor i in range(n):\r\n matrix.append(list(map(int, input().split())))\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i == n // 2 or j == n // 2 or i == n - j - 1:\r\n sum += matrix[i][j]\r\nprint(sum)", "n=int(input())\ns1=0\nfor i in range(n):\n l1=list(map(int,input().split()))\n s1+=l1[i]+l1[n-1-i]+l1[(n//2)]\n if i==(n//2):\n \ts1+=sum(l1)\n \tc=l1[n//2]\nprint(s1-3*c,end='')", "a = int(input())\r\nk = 0\r\nfor i in range(a):\r\n line = [int(x) for x in input().split()]\r\n\r\n if i == (a-1) // 2:\r\n k += sum(line)\r\n continue\r\n else:\r\n k += line[(a - 1) // 2]\r\n k += line[i]\r\n k += line[len(line)-1-i]\r\nprint(k)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = [list(map(int, input().split())) for _ in range(n)]\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j or i == n - j - 1 or i == (n - 1) // 2 or j == (n - 1) // 2:\r\n cnt += data[i][j]\r\n\r\nprint(cnt)", "'''\r\n00 01 02 03 04\r\n10 11 12 13 14\r\n20 21 22 23 24\r\n30 31 32 33 34\r\n40 41 42 43 44\r\n'''\r\nn = int(input())\r\nm = [[int(i) for i in input().split()] for j in range(n)]\r\nhasil = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n hasil += m[i][j]\r\n elif (i + j) == (n-1):\r\n hasil += m[i][j]\r\n elif i == (n-1)//2:\r\n hasil += m[i][j]\r\n elif j == (n-1)//2:\r\n hasil += m[i][j]\r\n\r\nprint(hasil)\r\n", "n=int(input())\r\ndiag=0\r\nmidrow=midcol=0\r\nfor i in range(1,n+1):\r\n l=[int(j) for j in input().split()]\r\n if i==int((n+1)/2):\r\n midrow=sum(l)\r\n else :\r\n diag=diag+l[i-1]+l[n-i]\r\n z=int((n+1)/2)\r\n midcol+=l[z-1]\r\nprint(diag+midcol+midrow)", "\r\nn = int(input())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\ns = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == n//2 or j == n//2 or i == j or i == n-1-j:\r\n s += g[i][j]\r\nprint(s)", "\nt = 1\nfor tc in range(t):\n\tls=[]\n\tst=[]\n\tn = int(input())\n\tfor i in range(n):\n\t\tl=list(map(int,input().strip().split()))\n\t\tls.append(l)\n\tans=0\n\tmid=n//2\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\t# if i==j:\n\t\t\t# \tans+=ls[i][j]\n\t\t\t# \tprint(ls[i][j])\n\t\t\tif i == j or i==mid or j==mid or i+j == n-1:\n\t\t\t\tans+=ls[i][j]\n\t\t\t\t# print(ls[i][j])\n\tprint(ans)\n\t\t\t\n\t\n\t\n \t \t\t\t \t\t\t \t \t\t\t \t \t\t\t \t", "from itertools import product\n\nn = int(input())\na = list()\n\nfor _ in range(n):\n a.append(list(map(int, input().split())))\n\nans = 0\n\nfor x, y in product(range(n), repeat=2):\n if x == y or x + y == n - 1 or 2 * x + 1 == n or 2 * y + 1 == n:\n ans += a[x][y]\n\nprint(ans)\n", "n, a = int(input()), []\r\ns, m = 0, n // 2\r\nfor i in range(n):\r\n a.append(list(map(int, input().split(' '))))\r\nfor i in range(n):\r\n s += a[i][i] + a[i][n - i - 1] + a[i][m] + a[m][i]\r\nprint(s - (a[m][m] * 3))\r\n", "I=lambda:map(int,input().split())\r\nn=next(I())\r\nr=0\r\nfor i in range(n):\r\n\tfor j,v in zip(range(n),I()):\r\n\t\tif i==n//2or j==n//2or i==j or i+j+1==n:r+=v\r\nprint(r)", "def Diary():\r\n\tn = int(input())\r\n\tarr = []\r\n\tfor i in range(n):\r\n\t\tarr.append(list(map(int, input().split())))\r\n\ts = 0\r\n\tmidNum = n//2\r\n\tmidNumber = arr[midNum][midNum]\r\n\ts += sum(arr[n//2])\r\n\tfor i in range(n):\r\n\t\ts += arr[i][midNum]\r\n\t\ts += arr[i][i]\r\n\t\ts += arr[n-1-i][i]\r\n\ts -= 3 * midNumber\r\n\tprint(s)\r\n\r\n\r\n\r\n\r\nDiary()", "n = int(input())\np = [list(map(int, input().split())) for _ in range(n)]\ns=0\nfor i in range(n):\n for j in range(n):\n if i+j==n-1 or i==j or i==(n-1)//2 or j==(n-1)//2:\n s+=p[i][j]\nprint(s)", "inp = int(input())\r\nsum=0\r\n\r\na=[] \r\nfor i in range(0,inp): \r\n a.append([int(j) for j in input().split()]) \r\n\r\n\r\nfor i in range(inp):\r\n for j in range(inp):\r\n if i==j:\r\n sum+=a[i][j]\r\n elif i==(inp-1)//2 or j==(inp-1)//2:\r\n sum+=a[i][j]\r\n elif i+j==inp-1:\r\n sum+=a[i][j]\r\n\r\nprint(sum)", "n = int(input())\r\na = []\r\nres = 0\r\nfor i in range(n):\r\n a = [int(i) for i in input().split()]\r\n if i == n//2:\r\n res += sum(a)\r\n else:\r\n res += (a[i] + a[n//2] + a[n-1-i])\r\n\r\nprint(res)", "n = int(input())\na = []\nsumma = 0\nfor i in range(n):\n a.append(list(map(int, input().split())))\nfor i in range(n):\n summa += a[i][i] + a[i][n - i - 1] + a[i][n // 2] + a[n // 2][i]\nprint(summa - (a[n // 2][n // 2] * 3))\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n M = [list(map(int,x.split())) for x in wtf[1:]]\r\n ans = 0\r\n for i in range(n):\r\n for j in range(n):\r\n if i == n//2 and j == n//2:\r\n continue\r\n if i == j:\r\n ans += M[i][j]\r\n ans += M[n-i-1][j]\r\n if i == n//2:\r\n ans += M[i][j]\r\n if j == n//2:\r\n ans += M[i][j]\r\n ans += M[n//2][n//2]\r\n print(ans)\r\n", "n = int(input())\r\na = []\r\ns = 0\r\nfor i in range(n):\r\n a.append([int(s) for s in input().split()])\r\n s+=a[i][i]\r\n s+=a[i][n-1-i]\r\n s+=a[i][n//2]\r\n if i == n//2:\r\n s+=sum(a[i])\r\n\r\nprint(s-3*a[i//2][i//2])", "n=int(input())\r\nt=0\r\nfor x in range(n):\r\n\ta=[int(i) for i in input().split()]\r\n\tif x==n//2:\r\n\t\tt+=sum(a)\r\n\telse:\r\n\t\tt+=(a[x]+a[-x-1]+a[n//2])\r\nprint(t)", "if __name__ == '__main__':\r\n\tn = int(input().strip(\" \"))\r\n\tmtx = []\r\n\tfor _ in range(n):\r\n\t\tmtx.append(list(map(int,input().strip(\" \").split(\" \"))))\r\n\tsm_good = 0\r\n\tfor i in range(len(mtx)):\r\n\t\tsm_good+=mtx[i][i]\r\n\t\t# print(mtx[i][i])\r\n\r\n\tk = 0\r\n\tfor j in range(len(mtx)-1,-1,-1):\r\n\t\tsm_good+=mtx[k][j]\r\n\t\t# print(mtx[k][j])\r\n\t\tk+=1\r\n\r\n\tsm_good += sum(mtx[(n-1)//2])\r\n\tk = 0\r\n\tfor k in range(len(mtx)):\r\n\t\tsm_good += mtx[k][(n-1)//2]\r\n\t\t# print(mtx[k][(n-1)//2])\r\n\t\tk+=1\r\n\tprint(sm_good - mtx[(n-1)//2][(n-1)//2]*3)", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n res += sum([a[j] for j in range(n) if j == int(n / 2) or i == int(n / 2) or i == j or (i + j) == n - 1])\r\nprint(res)", "from collections import Counter\r\n\r\n\r\ndef array(arr, struc):\r\n return (list(map(struc, arr.split())))\r\n\r\n\r\nn = int(input())\r\nmat = []\r\nfor i in range(n):\r\n mat.append(array(input(), int))\r\n\r\nfinal = 0\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n final += mat[i][j]\r\n if i+j+1 == n:\r\n final += mat[i][j]\r\n if j == n//2:\r\n final += mat[i][j]\r\n\r\nfinal += sum(mat[n//2])\r\nprint(final-3*mat[n//2][n//2])\r\n", "\r\nn = int(input())\r\nlists=[]\r\nSum=int(0)\r\nmid =int((n-1)/2)\r\nfor i in range(n):\r\n lists.append(input().split(' '))\r\n lists[i]=[int(j) for j in lists[i]]\r\n if(i!=mid):\r\n Sum+=lists[i][i]+lists[i][n-i-1]+lists[i][mid]\r\n else:\r\n Sum+= sum( lists[i])\r\nprint(Sum)", "n = int(input())\r\n\r\na = []\r\nfor i in range(n):\r\n b = list(map(int, input().split()))\r\n a.append(b)\r\n\r\nused = []\r\nfor i in range(n):\r\n b = []\r\n for j in range(n):\r\n b.append(0)\r\n used.append(b)\r\nk = n - 1\r\ncounter = 0\r\nfor i in range(n):\r\n for j in range(n):\r\n if used[i][j] == 0:\r\n if i == j:\r\n counter += a[i][j]\r\n used[i][j] = 1\r\n elif i == k / 2:\r\n counter += a[i][j]\r\n used[i][j] = 1\r\n elif j == k / 2:\r\n counter += a[i][j]\r\n used[i][j] = 1\r\n elif i == k - j:\r\n counter += a[i][j]\r\n used[i][j] = 1\r\n elif i == j + k / 2:\r\n counter += a[i][j]\r\n used[i][j] = 1\r\n elif j == i + k / 2:\r\n counter += a[i][j]\r\n used[i][j] = 1\r\n elif i == k / 2 - j:\r\n counter += a[i][j]\r\n used[i][j] = 1\r\n elif j == k / 2 + (k - i):\r\n counter += a[i][j]\r\n used[i][j] = 1\r\nprint(counter)\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n l.append(m)\r\nif(n==1):\r\n print(l[0][0])\r\nelse:\r\n s=0\r\n c=n-1\r\n for i in range(n):\r\n for j in range(n):\r\n if(i==j):\r\n s+=l[i][j]\r\n elif((n-1)//2==i or (n-1)//2==j):\r\n s+=l[i][j]\r\n if(c==j):\r\n s+=l[i][j]\r\n c-=1\r\n print(s-l[(n-1)//2][(n-1)//2])\r\n \r\n", "n=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tli=list(map(int,input().split()))\r\n\t\r\n\tl.append(li)\r\nk=[]\r\nfor i in range(n):\r\n\tfor j in range(n):\r\n\t\tif i==j:\r\n\t\t\tk.append(l[i][j])\r\n\t\telif i+j==n-1:\r\n\t\t\tk.append(l[i][j])\r\n\t\telif i==(n-1)/2:\r\n\t\t\tk.append(l[i][j])\r\n\t\telif j==(n-1)/2:\r\n\t\t\tk.append(l[i][j])\r\n\t\telse:\r\n\t\t\tcontinue\r\nprint(sum(k))", "#include <bits/stdc++.h>\r\n#define SYNC ios_base::sync_with_stdio(0);\r\n#define IO STD std_enable = 1; cin.tie(0);\r\n#define STD /*\r\nfrom sys import (\r\nstdin, stdout, exit as sys_ret)\r\n\"\"\"****************************\r\n\r\n Interactive Tasks:\r\n\r\n / Python: / \"\"\"\r\nf_input, f_print, f_flush = (\r\n stdin.readline,\r\n stdout.write,\r\n stdout.flush)\r\n\r\n\"\"\" / C++ /\r\n #import <cstdio>\r\n fflush(stdout);\r\n or\r\n #import <iostream>\r\n cout << endl;\r\n\r\n —————————————————————————\r\n Don't raise your voice,\r\n improve your argument.\r\n —————————————————————————\r\n\r\n cat /dev/ass > /dev/head\r\n Ctrl+C\r\n cat /knowledge > /dev/head\r\n\r\n © Jakov Gellert\r\n frvr.ru\r\n\r\n****************************\"\"\"\r\n# */ using namespace std; int\r\n#define boost_stream(); IO SYNC\r\n\r\nsize = int(f_input())\r\nmatrix = [[int(_) for _ in f_input().split()] for i in range(size)]\r\nmatrix_sum = 0\r\nfor i in range(size):\r\n matrix_sum += (\r\n matrix[i][i]\r\n + matrix[i][size - i - 1]\r\n + matrix[i][size // 2]\r\n + matrix[size // 2][i])\r\nf_print(str(matrix_sum - 3 * matrix[size // 2][size // 2]))", "n=int(input())\r\nsu=0\r\nfor i in range(n):\r\n k=list(map(int,input().split()))\r\n su+=k[i]+k[-i-1]+k[n//2]\r\n if i==n//2:\r\n su+=sum(k)-3*k[i]\r\nprint(su)", "import math\nimport re\nfrom fractions import Fraction\nfrom collections import Counter\n\nclass Task:\n matrix = []\n answer = 0\n \n def __init__(self):\n self.matrix = [[] for _ in range(int(input()))]\n for i in range(len(self.matrix)):\n self.matrix[i] = [int(x) for x in input().split()]\n\n def solve(self):\n matrix = self.matrix\n n = len(matrix)\n \n self.answer += sum([matrix[i][i] for i in range(n)])\n self.answer += sum([matrix[i][n - 1 - i] for i in range(n)])\n self.answer += sum([matrix[n // 2][i] for i in range(n)])\n self.answer += sum([matrix[i][n // 2] for i in range(n)])\n self.answer -= 3 * matrix[n // 2][n // 2]\n\n def printAnswer(self):\n print(self.answer)\n\ntask = Task()\ntask.solve()\ntask.printAnswer()\n", "c1,c2,c3,c4 = 0,0,0,0\r\nn = int(input())\r\nfor i in range(n):\r\n\tl = list(map(int,input().split()))\r\n\tfor j in range(n):\r\n\t\tif i==j:\r\n\t\t\tc1 = c1+l[j]\r\n\t\tif j == (n-1)//2:\r\n\t\t\tc2 = c2+l[j]\r\n\t\t\tif i ==(n-1)//2:\r\n\t\t\t\tk=l[j]\r\n\t\tif i == (n-1)//2:\r\n\t\t\tc3 = c3+l[j]\r\n\t\tif i==j:\r\n\t\t\tc4 = c4+l[n-j-1]\r\nprint(c1+c2+c3+c4-3*k)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n for j in range(n):\r\n if i == j or i + j == n - 1 or i == n // 2 or j == n // 2:\r\n ans += a[j]\r\nprint(ans)", "\r\n\r\nn = int(input())\r\nl = []\r\nfor i in range(n):\r\n\tl1 = list(map(int, input().split()))\r\n\tl.append(l1)\r\nsu = 0\r\nnp = n // 2 \r\nfor i in range(n):\r\n\tsu += l[i][i]\r\n\tsu += l[np][i]\r\n\tsu += l[i][np]\r\n\tsu += l[i][n-1-i]\r\n\r\nsu -= 3* l[np][np]\r\nprint(su)\r\n", "n = int(input())\r\na = []\r\ncnt = 0\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\n for j in range(n):\r\n if i == j or i + j == n-1 or i == n//2 or j == n//2:\r\n cnt += a[i][j]\r\nprint(cnt)", "n = int(input())\r\nm = n//2\r\nres = 0\r\nfor i in range(n):\r\n for v, x in enumerate(map(int, input().split())):\r\n if i == m or v == m or i == v or i == n-1-v:\r\n res += x\r\nprint(res)" ]

[ "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\n\r\nfor t in range(1):\r\n n, k, m = get_ints()\r\n words = input().strip().split()\r\n costs = get_list()\r\n groups = []\r\n words_mapping = {}\r\n \r\n for i in range(n):\r\n words_mapping[words[i]] = {'cost': costs[i], 'group': -1}\r\n \r\n\r\n for i in range(k):\r\n words_in_group = get_list()[1:]\r\n groups.append(words_in_group)\r\n for j in range(0, len(words_in_group)):\r\n word = words[words_in_group[j]-1]\r\n words_mapping[word]['group'] = i\r\n groups[-1].sort(key=lambda x: costs[x-1])\r\n\r\n s = input().strip().split()\r\n \r\n count = 0\r\n for j in s:\r\n group = words_mapping[j]['group']\r\n min_cost_word_index = groups[group][0] - 1\r\n count += costs[min_cost_word_index]\r\n min_cost_word = words[min_cost_word_index]\r\n \r\n print(count) \r\n ", "import collections\nimport heapq\nimport sys\nimport math\nimport itertools\nimport bisect\nfrom io import BytesIO, IOBase\nimport os\n######################################################################################\n#--------------------------------------func-----------------------------------------#\n######################################################################################\ndef valid(i,j,n,m):\n if i<n and i>=0 and j>=0 and j< m :return True #and l[i][j]==1 and visit[i][j]\n return False\ndef sumn(i,n):\n return (n-i)*(i+n)/2\ndef sqfun(a,b,c):\n return (-b+math.sqrt(b*b-4*a*c))/2*a\n######################################################################################\n#--------------------------------------vars-----------------------------------------#\n######################################################################################\n# index=[[1,0],[0,1],[-1,0],[0,-1]]\n\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 \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()]\ndef words(): return [i for i in input().split()]\n\n\n######################################################################################\n#--------------------------------------code here-------------------------------------#\n######################################################################################\ndef f():\n dd={}\n i=0\n for w in sys.stdin.readline().split():\n dd[w]=i\n i+=1\n wd.append(w)\n return dd\ndef kin():\n \n l=[int(i)-1 for i in input().split()]\n nn=l.pop(0)\n l=sorted(l)\n mn=cost[l[0]]\n for i in l:\n mn=min(mn,cost[i])\n d[wd[i]]=l[0]\n cost[l[0]]=mn\ndef solve():\n global wd ,d,cost\n wd=[]\n n,k,m=values()\n d=f()\n cost=inlsts()\n for i in range(k):\n kin()\n tot=0\n r=words()\n for i in r:tot+=cost[d[i]]\n return tot\n\n\n\n\n\nif __name__ == \"__main__\":\n # for i in range(inp()):\n print(solve()) \n", "\nimport sys ;input = sys.stdin.readline\nn,k,m=map(int,input().split())\nst=list(input().strip().split())\nct=list(map(int,input().strip().split()))\ndic={}\nfor i in range(k):\n ki=list(map(int,input().strip().split()))\n cost=10000000000\n for j in range(1,len(ki)):\n cost=min(cost,ct[ki[j]-1])\n for j in range(1,len(ki)):\n x=st[ki[j]-1]\n dic[x]=cost\nans=0\n#print(dic)\nlat=list(input().strip().split())\nfor i in lat:\n ans+=dic[i]\nprint(ans)\n\t \t \t \t\t\t \t\t\t\t \t \t\t\t", "dict={}\r\nn,m,k=map(int,input().split())\r\nsum=0\r\na=list(map(str,input().split()))\r\nfor i in range(n):\r\n dict[a[i]]=i\r\n \r\n \r\n# so that it can be adjusted with array of costs\r\n\r\nb=list(map(int,input().split()))\r\nfor i in range(m):\r\n c=list(map(int,input().split()))\r\n r=10**9\r\n for i in c[1::]:\r\n r=min(r,b[i-1])\r\n for i in c[1::]:\r\n b[i-1]=r\r\nd=list(map(str,input().split()))\r\nfor i in d:\r\n sum+=b[dict[i]]\r\nprint(sum)", "# Problem Link: https://codeforces.com/problemset/problem/959/B\r\n# Problem Status:\r\n# -------------------------- SEPARATOR --------------------------\r\n# IDEA:\r\n# -------------------------- SEPARATOR --------------------------\r\nN, K, M = list(map(int, input().split()))\r\nLang = input().split()\r\nValues = list(map(int, input().split()))\r\nTable = dict()\r\nGroups = []\r\nGroupsPointers = dict()\r\nAnswer = 0\r\n# -------------------------- SEPARATOR --------------------------\r\nfor i in range(N):\r\n Table.update({Lang[i]: Values[i]})\r\nfor i in range(K):\r\n Text = list(map(int, input().split()))\r\n Groups.append([])\r\n for j in range(1, Text[0]+1):\r\n Groups[-1].append(Table.get(Lang[Text[j]-1]))\r\n GroupsPointers.update({Lang[Text[j]-1]: len(Groups)-1})\r\n Groups[-1].sort()\r\nMessage = input().split()\r\n# -------------------------- SEPARATOR --------------------------\r\nfor i in range(M):\r\n Answer += Groups[GroupsPointers.get(str(Message[i]))][0]\r\n# -------------------------- SEPARATOR --------------------------\r\nprint(Answer)\r\n# -------------------------- SEPARATOR --------------------------\r\n", "n, k, m = map (int, input ().split ())\r\nwords = list (map (str, input ().split ()))\r\na = list (map (int, input ().split ()))\r\ngroup, val = list (), list ()\r\nbel = dict ()\r\nfor i in range (k) :\r\n group.append (list (map (int, input ().split ())))\r\n mn = 10 ** 9\r\n for j in range (1, group[-1][0] + 1) :\r\n group[i][j] -= 1\r\n mn = min (mn, a[group[-1][j]])\r\n bel[words[group[-1][j]]] = i\r\n val.append (mn)\r\nsend = list (map (str, input ().split ()))\r\n#print (bel, send)\r\nans = 0\r\nfor s in send : ans += val[bel[s]]\r\nprint (ans)\r\n", "from collections import defaultdict\r\nclass DisjSet: \r\n def __init__(self): \r\n self.rank = defaultdict(lambda:1)\r\n self.parent = defaultdict(lambda:-1) \r\n def find(self, x): \r\n if self.parent[x] == -1 or self.parent[x] == x: \r\n self.parent[x]=x\r\n else:\r\n self.parent[x] = self.find(self.parent[x]) \r\n return self.parent[x] \r\n\r\n \r\n\r\n def Union(self, x, y): \r\n\r\n xset = self.find(x) \r\n yset = self.find(y) \r\n\r\n\r\n if xset == yset: \r\n return\r\n\r\n if self.rank[xset] < self.rank[yset]: \r\n self.parent[xset] = yset \r\n\r\n elif self.rank[xset] > self.rank[yset]: \r\n self.parent[yset] = xset \r\n\r\n else: \r\n self.parent[yset] = xset \r\n self.rank[xset] = self.rank[xset] + 1\r\n self.parent[y]=x\r\nn,k,m=map(int,input().split())\r\narr=list(input().split())\r\ncost=list(map(int,input().split()))\r\nobj=DisjSet()\r\ncnt=defaultdict(lambda:None)\r\nfor _ in range(k):\r\n temp=list(map(int,input().split()))\r\n #print(temp)\r\n for val in temp[1:]:\r\n obj.Union(arr[temp[1]-1],arr[val-1])\r\n \r\nfor x in range(n):\r\n if cnt[obj.find(arr[x])]==None:\r\n cnt[obj.find(arr[x])]=cost[x]\r\n else:\r\n cnt[obj.find(arr[x])]=min(cost[x],cnt[obj.find(arr[x])])\r\n \r\nans=0\r\narr=list(input().split())\r\nfor x in range(m):\r\n ans+=cnt[obj.find(arr[x])]\r\n #print(arr[x],obj.find(arr[x]))\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n \r\n ", "n, k, m = map(int, input().split())\r\nwords = list(map(str, input().split()))\r\ncost = list(map(int, input().split()))\r\n\r\ngroup = {}\r\nmin_g = {}\r\n\r\nfor g in range(k):\r\n x = list(map(int, input().split()))\r\n for v in range(1, x[0]+1):\r\n group[words[x[v]-1]] = g\r\n if v == 1:\r\n min_g[g] = cost[x[v]-1]\r\n else:\r\n min_g[g] = min(min_g[g], cost[x[v]-1])\r\n \r\nans = 0\r\n# print(group)\r\n# print(min_g)\r\nfinal = list(map(str, input().split()))\r\nfor each in final:\r\n ans += min_g[group[each]]\r\nprint(ans)\r\n", "n,k,m = map(int,input().split())\r\nl = list(map(str,input().split()))\r\np = list(map(int,input().split()))\r\nd = {}\r\ne = {}\r\nw = {}\r\nfor j in range(len(l)):\r\n w[l[j]] = j\r\n\r\nfor i in range(k):\r\n o = list(map(int,input().split()))\r\n t = []\r\n for z in range(1,len(o)):\r\n e[o[z]-1] = i\r\n t.append((p[o[z]-1],o[z]-1))\r\n\r\n t.sort()\r\n d[i] = t\r\n\r\nans = 0\r\nr = list(map(str,input().split()))\r\nfor x in r:\r\n ele = w[x]\r\n id = e[ele]\r\n pr = d[id][0][0]\r\n ans += pr\r\n\r\nprint(ans)", "import sys\r\nimport string\r\n\r\nfrom collections import Counter, defaultdict\r\nfrom math import cos, fsum, sqrt, gcd, ceil, factorial\r\nfrom operator import add\r\nfrom itertools import accumulate\r\n\r\ninf = float(\"inf\")\r\n# input = sys.stdin.readline\r\nflush = lambda: sys.stdout.flush\r\ncomb = lambda x, y: (factorial(x) // factorial(y)) // factorial(x - y)\r\n\r\n\r\n# inputs\r\n# ip = lambda : input().rstrip()\r\nip = lambda: input()\r\nii = lambda: int(input())\r\nr = lambda: map(int, input().split())\r\nrr = lambda: list(r())\r\n\r\n\r\nn, k, m = r()\r\nwords = ip().split()\r\narr = rr()\r\nsub = []\r\nfor _ in range(k):\r\n sub.append(rr()[1:])\r\n\r\nmsg = ip()\r\n\r\nfor i in sub:\r\n x = inf\r\n for j in i:\r\n x = min(arr[j - 1], x)\r\n for j in i:\r\n arr[j - 1] = x\r\n\r\n\r\nfor i in sub:\r\n x = inf\r\n for j in i:\r\n x = min(arr[j - 1], x)\r\n for j in i:\r\n arr[j - 1] = x\r\n\r\narr = {words[i]:arr[i] for i in range(n)}\r\ncost = 0\r\nfor i in msg.split():\r\n cost += arr[i]\r\n \r\nprint(cost)", "n, k, m = list(map(int, input().split()))\r\n\r\nwords = input().split()\r\nindex = {}\r\nfor i in range(n):\r\n index[words[i]] = i\r\n\r\ncost = list(map(int, input().split()))\r\nparent = [i for i in range(n)]\r\nmin_cost = [i for i in cost]\r\nfor i in range(k):\r\n groups = list(map(int, input().split()))\r\n rep = groups[1] - 1\r\n for mem in groups[1:]:\r\n parent[mem - 1] = rep\r\n min_cost[rep] = min(min_cost[rep], cost[mem - 1])\r\n\r\nfinal = 0\r\nans = input().split()\r\nfor i in ans:\r\n final += min_cost[parent[index[i]]]\r\nprint(final)\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, k, m = iis()\r\nwords = inp().split()\r\ncosts = {words[i]: cost for (i, cost) in enumerate(iis())}\r\nfor i in range(k):\r\n x, *members = iis()\r\n members.sort(key=lambda x: costs[words[x - 1]])\r\n for member in members:\r\n costs[words[member - 1]] = costs[words[members[0] - 1]]\r\nans = 0\r\nwords = inp().split()\r\nfor word in words:\r\n ans += costs[word]\r\nprint(ans)\r\n", "\"\"\"TİME LİMİT IS EXCEEDED INEVITABLE\"\"\"\r\nn,k,m=map(int,input().split())\r\nll=list(input().split())\r\nkk=list(map(int,input().split()))\r\ntt=[]\r\nfor i in range(k):\r\n tt.append(list(map(int,input().split()))[1:])\r\nff=list(input().split())\r\nr=0\r\ndict1=dict()\r\nfor i in tt:\r\n c=10**9\r\n for t in i:\r\n c=min(c,kk[t-1])\r\n for t in i:\r\n kk[t-1]=c\r\nfor i in range(n):\r\n dict1[ll[i]]=kk[i]\r\nfor i in ff:\r\n r+=dict1[i]\r\nprint(r)", "import sys\r\nimport math\r\nimport collections\r\ndy = [1, 0, -1, 0]\r\ndx = [0, 1, 0, -1]\r\n\r\nr = sys.stdin.readline\r\n\r\nN, K, M = map(int, r().split())\r\nSL = r().split()\r\nL = list(map(int, r().split()))\r\ndic = {}\r\nfor i in range(K):\r\n a = list(map(int, r().split()))\r\n small = 1294921599591\r\n\r\n for j in range(1, len(a)):\r\n small = min(small, L[a[j]-1])\r\n for j in range(1, len(a)):\r\n dic[SL[a[j]-1]] = small\r\n\r\n\r\nML = r().split()\r\nans = 0\r\nfor i in ML:\r\n ans += dic[i]\r\nprint(ans)", "j=lambda:input().split()\r\nr=lambda:map(int,j())\r\nn,k,m=r()\r\nw=j()\r\nd=dict(zip(w,r()))\r\nfor f in[0]*k:\r\n x=list(r())[1:];c=min(d[w[i-1]]for i in x)\r\n for i in x:d[w[i-1]]=c\r\nprint(sum(d[x]for x in j()))", "n,k,m = map(int,input().split())\r\ns = list(input().split())\r\na = list(map(int,input().split()))\r\n\r\ncost = {}\r\nfor i in range(n):\r\n cost[s[i]] = a[i]\r\n\r\nfor i in range(k):\r\n d = list(map(int,input().split()))\r\n if d[0]==1:\r\n continue\r\n else:\r\n minCost=float(\"infinity\")\r\n for i in d[1:]:\r\n minCost = min(minCost,a[i-1])\r\n \r\n for i in d[1:]:\r\n cost[s[i-1]] = minCost\r\n\r\nmohd = list(input().split())\r\nans=0\r\nfor i in mohd:\r\n ans+=cost[i]\r\nprint(ans)", "\n\n\nn,k,m=[int(x)for x in input().split()]\nwords=input().split()\nc,d=[int(x)for x in input().split()],{}\nfor i in range(k):\n ii=list(map(int,input().split()[1:]))\n mn=float('inf')\n for j in ii:\n mn=min(mn,c[j-1])\n for j in ii:\n d[words[j-1]]=mn\nans=0\nfor i in input().split():\n ans+=d[i]\nprint(ans)\n\n\n", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, k, m = map(int, input().split())\r\ns = [\"?\"] + list(input().rstrip().decode().split())\r\na = [0] + list(map(int, input().split()))\r\nfor _ in range(k):\r\n x = list(map(int, input().split()))[1:]\r\n mi = a[x[0]]\r\n for i in x:\r\n mi = min(mi, a[i])\r\n for i in x:\r\n a[i] = mi\r\nd = dict()\r\nfor i, j in zip(s, a):\r\n d[i] = j\r\nt = list(input().rstrip().decode().split())\r\nans = 0\r\nfor i in t:\r\n ans += d[i]\r\nprint(ans)", "import collections\n\n\nn, k, m = map(int, input().split())\nls = input().split()\na = list(map(int, input().split()))\ngrp = {}\nfor _ in range(k):\n bs = list(map(int, input().split()))\n m = min(a[x - 1] for x in bs[1:])\n for x in bs[1:]:\n grp[ls[x - 1]] = m\nmsg = input().split()\nprint(sum(grp[x] for x in msg))", "import sys\nfrom sys import stdout\n\ninput = sys.stdin.readline\ninf = float('inf')\n\n\ndef getInt():\n return int(input())\n\n\ndef getStr():\n return input().strip()\n\n\ndef getList(split=True):\n s = getStr()\n if split:\n s = s.split()\n return list(map(int, s))\n\n# def p(*args,**kwargs):\n# print(*args,**kwargs)\n# stdout.flush()\n\n\n# t = getInt()\nt = 1\n\n\ndef solve():\n n, k, m = getList()\n a = input().strip().split()\n cost = getList()\n for _ in range(k):\n _, *z = getList()\n z = [i-1 for i in z]\n c = min(cost[i] for i in z)\n for i in z:\n cost[i] = c\n\n h = {j: i for i, j in enumerate(a)}\n m = getStr()\n print(sum(cost[h[i]] for i in m.split()))\n\n\nfor _ in range(t):\n solve()\n", "\r\nimport math\r\nif __name__==\"__main__\":\r\n n,m,k=map(int,input().split())\r\n s=list(map(str,input().split()))\r\n a=list(map(int,input().split()))\r\n d={}\r\n cost=[10000000000]*m\r\n for i in range(m):\r\n l=list(map(int,input().split()))\r\n \r\n x=l[0]\r\n for j in l[1:]:\r\n c=j-1\r\n # print(s[c])\r\n d[s[c]]=i\r\n cost[i]=min(cost[i],a[c])\r\n # print(j,\"hello\")\r\n \r\n ans=0\r\n st=list(map(str,input().split()))\r\n # print(d)\r\n # print(s)\r\n for i in st: \r\n ans+=cost[d[i]]\r\n print(ans)\r\n\r\n\r\n\r\n", "n,k,m=map(int,input().split())\r\nl=list(map(str,input().split()))\r\na=list(map(int,input().split()))\r\nd={}\r\nfor i in range(k):\r\n x=list(map(int,input().split()))\r\n min=10**9+1\r\n for i in range(x[0]):\r\n if(a[x[1+i]-1]<min):\r\n min=a[x[1+i]-1]\r\n for i in range(x[0]):\r\n d[l[x[1+i]-1]]=min\r\nl1=list(map(str,input().split()))\r\nc=0\r\nfor i in l1:\r\n c+=d[i]\r\nprint(c)", "n, k, m = map(int, input().split())\r\nwords = list(input().split())\r\ncost = list(map(int, input().split()))\r\ndict_words = dict()\r\n\r\nfor i in range(k):\r\n x, *sp = map(int, input().split())\r\n if len(sp) == 1:\r\n dict_words[words[sp[0] - 1]] = cost[sp[0] - 1]\r\n else:\r\n mncs = None\r\n for j in sp:\r\n if mncs is None or mncs > cost[j - 1]:\r\n mncs = cost[j - 1]\r\n for j in sp:\r\n if mncs < cost[j - 1]:\r\n dict_words[words[j - 1]] = mncs\r\n else:\r\n dict_words[words[j - 1]] = cost[j - 1]\r\n\r\nst = list(input().split())\r\nans = 0\r\nfor elem in st:\r\n ans += dict_words[elem]\r\nprint(ans)\r\n", "def f(x):\r\n return int(x) - 1\r\n\r\n\r\nn, k, m = map(int, input().split())\r\nsrc = input().split()\r\ncs = list(map(int, input().split()))\r\nfor _ in range(k):\r\n arr = list(map(f, input().split()))[1:]\r\n arr.sort(key=lambda x: cs[x])\r\n for c in arr[1:]:\r\n cs[c] = cs[arr[0]]\r\nd = {x: y for x, y in zip(src, cs)}\r\nprint(sum(d[x] for x in input().split()))", "n, k, m= map(int, input().split())\r\nindex= {x: i for i, x in enumerate(input().split())}\r\na= list(map(int, input().split()))\r\n\r\nfor i in range(k):\r\n b= [int(x)-1 for x in input().split()[1:]]\r\n z= min(a[x] for x in b)\r\n for x in b:\r\n a[x]= z\r\n\r\nprint(sum(a[index[x]] for x in input().split()))\r\n", "# https://codeforces.com/contest/959\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn, k, m = map(int, input().split())\nwords = list(input().split())\ncost = list(map(int, input().split()))\ngroups = [list(map(lambda x: int(x) - 1, input().split()))[1:] for _ in range(k)]\nmessage = list(input().split())\n\nword_to_group = {}\nfor i, group in enumerate(groups):\n for j in group:\n word_to_group[words[j]] = i\n\nmin_group_cost = [min(cost[i] for i in g) for g in groups]\n\nans = sum(min_group_cost[word_to_group[word]] for word in message)\nprint(ans)\n", "n,k,m = map(int, input().split())\nS = list(map(str, input().split()))\ntoid = {}\nfor i, s in enumerate(S):\n toid[s] = i\nA = list(map(int, input().split()))\ndmin = {}\nINF = 10**18\nfor i in range(k):\n temp = list(map(int, input().split()))\n res = INF\n for j in temp[1:]:\n res = min(res, A[j-1])\n for j in temp[1:]:\n dmin[j-1] = res\nT = list(map(str, input().split()))\nans = 0\nfor t in T:\n ans += dmin[toid[t]]\nprint(ans)\n", "n,k,m = map(int,input().split())\r\nd = {}\r\narr,cost = input().split(),tuple(map(int,input().split()))\r\nfor _ in ' ' * k:\r\n tmp = tuple(map(int,input().split()))\r\n if len(tmp) ==2:a,b = tmp;d[arr[b-1]] = cost[b-1]\r\n else:\r\n tmp = tmp[1:]\r\n mn = 1000000001\r\n for i in tmp:mn = min(mn,cost[i-1])\r\n for i in tmp:d.setdefault(arr[i-1],1000000001);d[arr[i-1]] = min(d[arr[i-1]],mn)\r\nres = 0\r\nfor i in input().split():res+=d[i] \r\nprint(res)\r\n", "n, k, m = map(int, input().split())\na = list(map(str, input().split()))\nl = list(map(int, input().split()))\ndict = {}\nfor i in range(k):\n lst = list(input().split())\n c = list(map(int, lst[1:]))\n mini = min([l[i-1] for i in c])\n for i in c:\n l[i-1] = mini\nfor i in range(n):\n dict[a[i]] = l[i]\nr = list(map(str, input().split()))\nans = 0\nfor i in range(m):\n ans += dict[r[i]]\nprint(ans)\n", "def rl():\r\n return list(map(int, input().split()))\r\n\r\nn, k, m = rl()\r\n\r\nwords = {}\r\nwordlist = input().split()\r\nfor i in range(n):\r\n words[wordlist[i]] = i\r\n\r\ncosts = rl()\r\ngroups = {}\r\n\r\nfor i in range(k):\r\n group = rl()[1:]\r\n for word_id in group:\r\n word_id -= 1\r\n groups[word_id] = i\r\n\r\nmin_costs = {x: 10**10 for x in range(k)}\r\n\r\nfor i in range(n):\r\n min_costs[groups[i]] = min(min_costs[groups[i]], costs[i])\r\n\r\nsentence = input().split()\r\ntotal_cost = 0\r\nfor word in sentence:\r\n word_id = words[word]\r\n group_id = groups[word_id]\r\n total_cost += min_costs[group_id]\r\n\r\nprint (total_cost)\r\n", "n,k,m = map(int,input().split())\r\ns = input().split()\r\nd = dict()\r\na = [*map(int,input().split())]\r\nfor i in range(n):\r\n d[s[i]] = a[i]\r\nfor i in range(k):\r\n x = list(map(int,input().split()))[1:]\r\n m = min(d[s[i-1]] for i in x)\r\n for i in x:\r\n d[s[i-1]] = m\r\nprint(sum(d[x] for x in input().split()))", "import sys\r\nimport os.path\r\nfrom collections import *\r\nimport math\r\nimport bisect\r\n\r\nif (os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nelse:\r\n input = sys.stdin.readline\r\n\r\n############## Code starts here ##########################\r\n\r\nn,k,m = [int(x) for x in input().split()]\r\nh1 = Counter()\r\ns = input().split()\r\n\r\narr = [int(x) for x in input().split()]\r\nh = Counter()\r\nfor i in range(n):\r\n h[s[i]] = arr[i]\r\n\r\nfor i in range(k):\r\n brr = [int(x) for x in input().split()]\r\n minval = arr[brr[1] - 1]\r\n for i in range(1,brr[0] + 1):\r\n minval = min(minval,arr[brr[i] - 1])\r\n for i in range(1,brr[0] + 1):\r\n h[s[brr[i] - 1]] = minval\r\n\r\ncost = 0\r\n\r\ns1 = input().split()\r\n\r\nfor i in range(m):\r\n cost += h[s1[i]]\r\n\r\nprint(cost)\r\n\r\n############## Code ends here ############################\r\n", "n,k,m=map(int,input().split())\r\nlis=input().split()\r\ncost=list(map(int,input().split()))\r\nword={}\r\nfor i in range(k):\r\n ele=list(map(int,input().split()))\r\n req=min(cost[i-1] for i in ele[1:])\r\n for i in ele[1:]:\r\n word[lis[i-1]]=req\r\nlis=input().split()\r\nans=0\r\nfor i in lis:\r\n ans+=word[i]\r\nprint(ans)", "I=lambda:input().split()\nR=lambda:list(map(int,I()))\nn,k,m=R()\nw=dict(zip(I(),range(n)))\na=R()\nfor _ in[0]*k:\n x=R()[1:]\n c=min(a[i-1]for i in x)\n for i in x:a[i-1]=c\nprint(sum(a[w[x]]for x in I()))\n\t\t \t \t \t\t \t\t \t \t \t \t \t\t", "from collections import defaultdict\nfrom heapq import heappush\n\ndef main():\n num_words, num_groups, num_words_in_msg = map(int,input().split())\n words = input().split()\n scores = list(map(int, input().split()))\n\n word_to_score = create_word_to_score_map(words, scores)\n word_to_group, group_to_scores = create_groups(num_groups, words, word_to_score)\n\n message = input().split()\n minimum_cost_message = get_min_cost_message(message, word_to_group, group_to_scores)\n print(minimum_cost_message)\n\n\ndef create_word_to_score_map(words, scores):\n word_to_score = dict()\n\n for i, word in enumerate(words):\n word_to_score[word] = scores[i]\n\n\n return word_to_score\n\ndef create_groups(num_groups, words, word_to_score):\n word_to_group = dict()\n group_to_scores = defaultdict(list)\n\n for group_num in range(num_groups):\n num_words_in_group, *word_indices_in_group = list(map(int, input().split()))\n\n for word_index in word_indices_in_group:\n word = words[word_index-1]\n score = word_to_score[word]\n\n word_to_group[word] = group_num\n heappush(group_to_scores[group_num], score)\n\n return word_to_group, group_to_scores\n\n\ndef get_min_cost_message(message, word_to_group, group_to_score):\n cost = 0\n\n for word in message:\n group = word_to_group[word]\n min_score_in_group = group_to_score[group][0]\n cost += min_score_in_group\n\n return cost\n\n\nif __name__ == '__main__':\n main()", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn, k, m = map(int, input().split())\r\ns = [x.decode() for x in input().split()]\r\na = [int(x) for x in input().split()]\r\n\r\nfor _ in range(k) :\r\n x, *b = map(int, input().split())\r\n \r\n mn = min(a[i - 1] for i in b)\r\n for i in b :\r\n a[i - 1] = mn\r\n\r\nc = {x : i for i, x in enumerate(s)}\r\n\r\ns = [x.decode() for x in input().split()]\r\n\r\nprint(sum(a[c[x]] for x in s))\r\n", "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,m=map(int,input().split())\r\nl=list(input().split())\r\nf=dc(int)\r\nfor i in range(n):\r\n f[l[i]]=i+1\r\nc=list(map(int,input().split()))\r\nx=dc(int)\r\ny=dc(int)\r\nfor i in range(k):\r\n p=list(map(int,input().split()))\r\n for j in p[1:]:\r\n y[j]=i\r\n if x[i]==0:\r\n x[i]=c[j-1]\r\n else:\r\n x[i]=min(x[i],c[j-1])\r\nt=list(input().split())\r\nc=0\r\nfor s in t:\r\n i=f[s]\r\n g=y[i]\r\n c+=x[g]\r\nprint(c)\r\n \r\n", "n , k , m = map(int, input(' ').split(' '))\r\nd = {}\r\nw = input().split(' ')\r\nc = list(map(int, input().split(' ' )))\r\ni1 = 0\r\nfor x in w:\r\n d[x] = c[i1]\r\n i1 += 1\r\ntotal = 0\r\nfor i in range(k):\r\n gp = list(map(int, input().split(' ' )))\r\n t = 100000000000\r\n if len(gp) != 2:\r\n gp.pop(0)\r\n for x in gp:\r\n t = min(t, c[x-1])\r\n for x in gp:\r\n d[w[x-1]] = t\r\nword = input().split(' ')\r\nfor item in word:\r\n total += d[item]\r\nprint (total)\r\n\r\n\r\n\r\n\r\n\r\n", "n,k,m = [int(x) for x in input().split()]\r\nslowa = [str(s) for s in input().split()]\r\nkoszt = [int(k) for k in input().split()]\r\nfor q in range(k):\r\n tym = [int(x) for x in input().split()]\r\n m = koszt[tym[1] -1]\r\n for i in range(1, tym[0]+1):\r\n if m > koszt[tym[i] -1]:\r\n m = koszt[tym[i] -1]\r\n for i in range(1, tym[0] +1):\r\n koszt[tym[i]-1] = m\r\nsen = [s for s in input().split()]\r\npomd = {}\r\nfor i in range(n):\r\n pomd[slowa[i]] = koszt[i]\r\nodp = 0\r\nfor s in sen:\r\n odp = odp + pomd[s]\r\nprint(odp)", "'''\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, k, m = map(int, input().split())\r\narrs = list(input().split())\r\narri = list(map(int, input().split()))\r\nd = {}\r\nfor s, i in zip(arrs, arri):\r\n if s not in d: d[s] = i \r\n else: d[s] = min(d[s], i)\r\n\r\nfor i in range(k):\r\n tmp = list(map(int, input().split()))\r\n if len(tmp) < 3: continue\r\n mini = 2**31\r\n for i in tmp[1:]:\r\n mini = min(mini, arri[i-1])\r\n for i in tmp[1:]:\r\n d[arrs[i-1]] = mini\r\n\r\ns = list(input().split())\r\nres = 0\r\nfor i in range(len(s)):\r\n res += d[s[i]]\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\r\n\r\n ", "def solve(n,k,m,words,costs,similarGroups,message) :\r\n wordCost = {}\r\n index = 0\r\n while index < k :\r\n tar = similarGroups[index]\r\n innerIndex = 1\r\n minimum = 10000000001\r\n while innerIndex <= tar[0] :\r\n if costs[tar[innerIndex]-1] < minimum :\r\n minimum = costs[tar[innerIndex]-1]\r\n innerIndex += 1\r\n innerIndex -= 1\r\n while innerIndex > 0 : \r\n w = words[tar[innerIndex]-1]\r\n wordCost[w] = minimum\r\n innerIndex -= 1\r\n \r\n index += 1\r\n \r\n ans = 0\r\n for i in message :\r\n ans += wordCost[i]\r\n \r\n return ans\r\n \r\n \r\n \r\nn,k,m = list(map(int,input().split()))\r\nwords = input().split()\r\ncosts = list(map(int,input().split()))\r\nsG = []\r\n\r\nfor x in range(k) :\r\n sG.append(list(map(int,input().split())))\r\n\r\nm = input().split()\r\n\r\nprint (solve(n,k,m,words,costs,sG,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 ", "n, k, m = map(int, input().split())\r\ns = input().split()\r\na = list(map(int, input().split()))\r\nd = {}\r\nfor _ in range(k):\r\n x = list(map(int, input().split()))\r\n mn = 10 ** 9 + 1\r\n for i in range(x[0]):\r\n if a[x[1 + i] - 1] < mn:\r\n mn = a[x[1 + i] - 1]\r\n for i in range(x[0]):\r\n d[s[x[1 + i] - 1]] = mn\r\ns1 = input().split()\r\nc = 0\r\nfor i in s1:\r\n c += d[i]\r\nprint(c)\r\n", "ii=lambda:int(input())\r\nkk=lambda:map(int,input().split())\r\nll=lambda:list(kk())\r\nn,k,m=kk()\r\nwords,vals = input().split(),ll()\r\nd = {words[i]:i for i in range(n)}\r\nfor _ in range(k):\r\n\tinps = ll()[1:]\r\n\tminv=vals[inps[0]-1]\r\n\tfor v in inps:\r\n\t\tminv = min(minv, vals[v-1])\r\n\tfor v in inps:\r\n\t\tvals[v-1] = minv\r\ncnt=0\r\nfor w in input().split():\r\n\tcnt+=vals[d[w]]\r\nprint(cnt)\r\n", "I=lambda:input().split()\r\nR=lambda:map(int,I())\r\nn,k,m=R()\r\nw=I()\r\nd=dict(zip(w,R()))\r\nfor _ in[0]*k:\r\n x=list(R())[1:];c=min(d[w[i-1]]for i in x)\r\n for i in x:d[w[i-1]]=c\r\nprint(sum(d[x]for x in I()))\r\n", "n, k, m = map(int, input().split())\r\nlang = list(input().split()) # index 1..n\r\nlang.insert(0, '0')\r\na = list(map(int, input().split())) # index 1..n\r\na.insert(0, 0)\r\ncost = {}\r\nfor i in range(1, n+1):\r\n cost[lang[i]] = a[i]\r\nans = 0\r\nfor _ in range(k):\r\n t = list(map(int, input().split()))\r\n if t[0] != 1:\r\n m = cost[lang[t[1]]] #minimum \r\n for j in t[1:]:\r\n m = min(cost[lang[j]], m)\r\n for j in t[1:]:\r\n cost[lang[j]] = m\r\ns = input().split()\r\nfor i in s:\r\n ans += cost[i]\r\nprint(ans)\r\n", "n,k,m=map(int,input().split())\r\ns=[*input().split()]\r\na=[*map(int,input().split())]\r\nz=[0]*k\r\nx={}\r\nfor i in range(k):\r\n q,*w=map(int,input().split())\r\n o=10**9\r\n for j in w:\r\n o=min(o,a[j-1])\r\n for j in w:\r\n x[s[j-1]]=o\r\nh=0\r\ng=[*input().split()]\r\nfor i in g:\r\n h+=x[i]\r\nprint(h)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nclass DSU:\r\n\r\n # Disjoint Set Union (Union-Find) Data Structure\r\n def __init__(self, nodes):\r\n # Dictionary of parents\r\n self.p = [i for i in nodes]\r\n # Dictionary of ranks\r\n self.r = [0 for i in nodes]\r\n # Dictionary of mins\r\n self.m = [a[i] for i in nodes]\r\n\r\n\r\n def get(self, u):\r\n # Recursive Returns the identifier of the set that contains u, includes path compression\r\n if u != self.p[u]:\r\n self.p[u] = self.get(self.p[u])\r\n return self.p[u]\r\n\r\n\r\n def union(self, u, v):\r\n # Unites the sets with identifiers u and v\r\n u = self.get(u)\r\n v = self.get(v)\r\n if u != v:\r\n if self.r[u] > self.r[v]:\r\n u, v = v, u\r\n self.p[u] = v\r\n if self.r[u] == self.r[v]:\r\n self.r[v] += 1\r\n self.m[v] = min(self.m[u], self.m[v])\r\n\r\n def get_min(self, u):\r\n u = self.p[u]\r\n return self.m[u]\r\n\r\n\r\nn, k, m = [int(x) for x in input().split(' ')]\r\n\r\ns = input().strip().split(' ')\r\nd = {s[i]: i for i in range(n)}\r\na = [int(x) for x in input().split(' ')]\r\n\r\ndsu = DSU(list(range(n)))\r\nfor query in range(k):\r\n c = [int(x) for x in input().split(' ')]\r\n if len(c) > 2:\r\n for z in c[2:]:\r\n dsu.union(c[1] - 1, z - 1)\r\n\r\nans = sum([dsu.get_min(d[w]) for w in input().strip().split(' ')])\r\nprint(ans)\r\n" ]

[ "import sys\r\nfrom collections import Counter\r\n\r\nread = sys.stdin.readline\r\nwrite = sys.stdout.write\r\n\r\nn = int(read())\r\ns = read().strip()\r\ntypes = len(set(s))\r\n\r\nans = len(s)\r\n\r\nfrequencies = Counter()\r\nmatches = 0\r\n\r\nl = 0\r\nfor r in range(len(s)):\r\n frequencies[s[r]] += 1\r\n if frequencies[s[r]] == 1:\r\n matches += 1\r\n\r\n while l < len(s) and matches == types:\r\n if matches == types:\r\n ans = min(ans, r - l + 1)\r\n\r\n frequencies[s[l]] -= 1\r\n if frequencies[s[l]] == 0:\r\n matches -= 1\r\n \r\n l += 1\r\n\r\nwrite(f\"{ans}\")", "import sys\nn = int(input())\nst = input()\ns = {}\nfor i in range(n):\n s[st[i]] = 0\nif n == 1:\n print('1')\n sys.exit(0)\n \nl = 0\nr = 0\nln = len(s)\nminim = 10**20\nTupes = 0\nwhile Tupes < ln:\n if s[st[r]] == 0:\n Tupes += 1\n s[st[r]] += 1\n r += 1\nr -= 1\nwhile r < n:\n while s[st[l]] > 1:\n s[st[l]] -= 1\n l+=1\n minim = min(minim, r - l + 1)\n r += 1\n if r < n:\n s[st[r]] += 1\nprint(minim)\n\t \t \t \t\t\t\t\t\t\t\t \t\t \t", "\"\"\"\r\nThey Are Everywhere\r\n\r\nSergei B., the young coach of Pokemons, has found the big house which consists of \r\nn flats ordered in a row from left to right. It is possible to enter each flat \r\nfrom the street. It is possible to go out from each flat. Also, each flat is\r\nconnected with the flat to the left and the flat to the right. Flat number 1\r\nis only connected with the flat number 2 and the flat number n is only connected \r\nwith the flat number n - 1.\r\n\r\nThere is exactly one Pokemon of some type in each of these flats. Sergei B. \r\nasked residents of the house to let him enter their flats in order to catch Pokemons.\r\nAfter consulting the residents of the house decided to let Sergei B. enter one flat \r\nfrom the street, visit several flats and then go out from some flat. But they won't\r\nlet him visit the same flat more than once.\r\n\r\nSergei B. was very pleased, and now he wants to visit as few flats as possible in \r\norder to collect Pokemons of all types that appear in this house. Your task is to \r\nhelp him and determine this minimum number of flats he has to visit.\r\n\"\"\"\r\n#import sys\r\n#sys.stdin=open('theyare_everywhere_test.txt','r')\r\n\r\nn = map(int, input())\r\ns = input()\r\nL = len(set(list(s)))\r\n\r\ni = 0\r\nj = 0\r\nres = len(s)\r\ncur_dict = {}\r\nfor i in range(len(s)):\r\n while j<len(s) and len(cur_dict)<L:\r\n if s[j] not in cur_dict:\r\n cur_dict[s[j]] = 1\r\n else:\r\n cur_dict[s[j]] += 1\r\n j += 1\r\n if len(cur_dict)==L:\r\n res = min(res,j-i)\r\n cur_dict[s[i]] -= 1\r\n if cur_dict[s[i]]==0:\r\n del cur_dict[s[i]] \r\nprint(res)", "\nn = int(input())\npokemons = input()\n\nlast = {}\nstart_of_all = 0\nfor i in range(n):\n ty = pokemons[i]\n if ty not in last:\n start_of_all = i\n last[ty] = 0\n\nminlen = 100001\nfor i in range(n):\n ty = pokemons[i]\n last[ty] = i\n length = i + 1 - min(last.values())\n if i >= start_of_all and length < minlen:\n minlen = length\n\nprint(minlen)\n\n\t \t \t\t\t\t \t \t\t\t \t\t \t \t", "from collections import defaultdict\r\nn = int(input())\r\ns = input()\r\nn = len(s)\r\n\r\nhmap = defaultdict(int)\r\nans = float(\"inf\")\r\nunique = len(set(s))\r\n\r\nl = 0\r\n\r\nfor r in range(n):\r\n hmap[s[r]]+=1\r\n \r\n while l<n and len(hmap) == unique and hmap[s[l]]>0:\r\n ans = min(ans,r-l+1)\r\n hmap[s[l]]-=1\r\n \r\n if hmap[s[l]] == 0:\r\n del hmap[s[l]]\r\n l+=1\r\n \r\n \r\n\r\nprint(ans)", "\r\nn = int(input())\r\ns = input()\r\n\r\nq = len(set(s))\r\n\r\nd = {}\r\ncount = 0\r\n\r\nbest = 999999999\r\nj = 0\r\nfor i in range(n):\r\n\tif s[i] not in d:\r\n\t\td[s[i]] = 0\r\n\t\tcount += 1\r\n\t\r\n\td[s[i]] += 1\r\n\tif count == q:\r\n\t\twhile d[s[j]] > 1:\r\n\t\t\td[s[j]] -= 1\r\n\t\t\tj += 1\r\n\t\tbest = min(best, i - j + 1)\r\n\r\nprint(best)\r\n", "n=int(input())\r\nb=input()\r\nz=set(b)\r\nv=dict()\r\nr=0\r\nl=0\r\nm=999999\r\nwhile r < n:\r\n while len(v)!=len(z) and r<n:\r\n if b[r] not in v:\r\n v[b[r]]=1\r\n else:v[b[r]]+=1\r\n r+=1\r\n while len(v)==len(z):\r\n if v[b[l]]==1:\r\n v.pop(b[l])\r\n else:\r\n v[b[l]]-=1\r\n m=min(m,r-l)\r\n \r\n l+=1\r\n \r\nprint(m)", "from collections import defaultdict\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nneed = len(set(s))\r\ntypes = set()\r\ncnt = defaultdict(int)\r\nret = float('inf')\r\nleft = 0\r\nfor right in range(n):\r\n types.add(s[right])\r\n cnt[s[right]] += 1\r\n while len(types) == need:\r\n ret = min(ret, right - left + 1)\r\n cnt[s[left]] -= 1\r\n if cnt[s[left]] == 0:\r\n types.remove(s[left])\r\n left += 1\r\nprint(ret)", "\r\nn=int(input())\r\ns=input()\r\nl=[0]*n\r\nfor k in set(s): \r\n\tj = -1\r\n\tfor i in range(n):\r\n\t\tif s[i]==k:\r\n\t\t\tj = i\r\n\t\tif j==-1:\r\n\t\t\tl[i]=n\r\n\t\telse:\r\n\t\t\tl[i]=max(l[i],i-j+1)\r\nprint(min(l))\r\n", "n = int(input())\r\ns = input()\r\nunique = set()\r\nfor char in s:\r\n unique.add(char)\r\nele = len(unique)\r\nseen = {}\r\nl = 0\r\nr = 0\r\nans = n\r\nf1 = False\r\nf2 = False\r\nwhile r < n:\r\n \r\n while r < n and len(seen) < ele:\r\n f1 = True\r\n \r\n seen[s[r]] = seen.setdefault(s[r],0) + 1\r\n r+=1\r\n if len(seen) == ele:\r\n ans = min(ans,r-l)\r\n \r\n break\r\n while l <= r and len(seen) == ele:\r\n f2 = True\r\n if len(seen) == ele:\r\n ans = min(ans,r-l )\r\n \r\n if seen[s[l]] == 1:\r\n del seen[s[l]]\r\n else:\r\n seen[s[l]] -=1\r\n \r\n l+=1\r\n \r\n\r\n if not f1 and not f2:\r\n break\r\nprint(ans)\r\n\r\n \r\n", "#https://codeforces.com/problemset/problem/701/C\r\nfrom collections import Counter\r\n\r\nn = int(input())\r\ns = input()\r\nres,i = float('inf'),-1\r\nseen,t = Counter(),len(set(s))\r\nfor j in range(n):\r\n seen[s[j]] += 1\r\n while len(seen) == t:\r\n res = min(res,j-i)\r\n i += 1\r\n seen[s[i]] -= 1\r\n if seen[s[i]] == 0: del seen[s[i]]\r\nprint(res)", "n=int(input())\r\ns=input()\r\nunique=len(list(set(s)))\r\ni=0\r\nstart=0\r\nres=float('inf')\r\nd={}\r\nwhile i<n:\r\n if s[i] not in d:\r\n d[s[i]]=1\r\n else:\r\n d[s[i]]+=1\r\n if len(d)==unique:\r\n res=min(res,i-start+1)\r\n while start<i:\r\n if d[s[start]]==1:\r\n break\r\n d[s[start]]-=1\r\n start+=1\r\n res=min(res,i-start+1)\r\n del d[s[start]]\r\n start+=1\r\n i+=1\r\nprint(res)", "# 2022-03-05 16:28:00.255286\r\n# https://codeforces.com/problemset/problem/701/C\r\nimport sys\r\nfrom collections import Counter\r\n\r\n_DEBUG = True\r\nif not _DEBUG:\r\n input = sys.stdin.readline\r\n # print = sys.stdout.write\r\n\r\n\r\ndef proc(n, s):\r\n def is_feasible(flat_len):\r\n c = Counter(s[:flat_len])\r\n if len(c) == types:\r\n return True\r\n for i in range(flat_len, n):\r\n c[s[i]] += 1\r\n c[s[i - flat_len]] -= 1\r\n if c[s[i - flat_len]] == 0:\r\n del c[s[i - flat_len]]\r\n\r\n if len(c) == types:\r\n return True\r\n return False\r\n\r\n types = len(set(s))\r\n lo, hi = types, len(s) - 1\r\n res = len(s)\r\n while lo <= hi:\r\n mid = (lo + hi) // 2\r\n if is_feasible(mid):\r\n res = mid\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\n return res\r\n\r\n\r\nn = int(input())\r\ns = input().strip()\r\n\r\nans = proc(n, s)\r\nprint(ans)\r\n", "def ans():\r\n n=int(input())\r\n s=input()\r\n a=list(s)\r\n d={}\r\n j=0\r\n k=len(set(a))\r\n m=1e18\r\n for i in range(n):\r\n while(j<n and len(d)<k):\r\n if(a[j] not in d):\r\n d[a[j]]=0\r\n d[a[j]]+=1\r\n j+=1\r\n if(len(d)==k):\r\n m=min(m,j-i)\r\n d[a[i]]-=1\r\n if(d[a[i]]==0):\r\n del (d[a[i]])\r\n print(m) \r\n \r\n \r\n \r\n\r\nfor i in range(1):\r\n ans()\r\n", "from collections import Counter\r\nfrom os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\n\r\n\r\n\r\ndef solution():\r\n def bsl(left: int, right: int) -> int:\r\n \"\"\"\r\n FFFFTTTT\r\n |\r\n \"\"\"\r\n\r\n def check(mid: int) -> bool:\r\n cur = Counter(s[:mid])\r\n if len(cur) == m:\r\n return True\r\n for i in range(mid, n):\r\n cur[s[i - mid]] -= 1\r\n if cur[s[i - mid]] == 0:\r\n del cur[s[i - mid]]\r\n cur[s[i]] += 1\r\n if len(cur) == m:\r\n return True\r\n return False\r\n\r\n while left <= right:\r\n mid = left + (right - left) // 2\r\n if check(mid):\r\n right = mid - 1\r\n else:\r\n left = mid + 1\r\n return left\r\n n = int(input())\r\n s = input()\r\n m = len(set(s))\r\n print(bsl(m, n))\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from typing import DefaultDict\ndef isvalid(street,size):\n letters=set(street)\n vis=DefaultDict(lambda:0)\n for i in range(size):\n vis[street[i]]+=1\n i,j=0,size\n while j <=len(street):\n valid=all(vis[flat] for flat in letters)\n if valid: return True\n if j==len(street): break\n vis[street[j]]+=1\n vis[street[i]]-=1\n j+=1\n i+=1\n return False\n \n\nlength=int(input())\nstreet=input()\nst,en=1,length\nans=length\nwhile st<=en:\n mid=(st+en)//2\n if(isvalid(street,mid)):\n en=mid-1\n ans=mid\n else:\n st=mid+1\nprint(ans)\n\t\t \t\t \t \t\t\t \t \t \t \t", "n = int(input())\r\nst = input()\r\nl = len(st)\r\nu = list(set(st))\r\nINT_MAX = 1000000000\r\ne = [0 for _ in range(l)]\r\nlast = -1\r\nfor c in u:\r\n last = -1\r\n for i,s in enumerate(st):\r\n if s!=c:\r\n e[i] = INT_MAX\r\n else:\r\n last = i\r\n break\r\n count = last\r\n while count<l:\r\n if st[count] == c:\r\n last = count\r\n e[count] = max(e[count],count-last+1)\r\n count+=1\r\nprint(min(e))\r\n", "from collections import defaultdict\ndef func():\n n = int(input())\n s = input()\n d = defaultdict(int)\n ss = set()\n for c in s:\n ss.add(c)\n leixing = len(ss)\n min_l = 1000001\n d[s[0]]=1\n y=0\n m = set()\n m.add(s[0])\n for i in range(0, n):\n while len(m)!=leixing:\n y+=1\n if y==n:\n print(min_l)\n return\n d[s[y]]+=1\n m.add(s[y])\n min_l = min(min_l, y-i+1)\n if d[s[i]]>1:\n d[s[i]] -= 1\n else:\n m.remove(s[i])\n d[s[i]] -= 1\n print(min_l)\n\nif __name__ == \"__main__\":\n func()\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\nmySet = set()\r\n\r\nfor i in range(n):\r\n mySet.add(s[i])\r\n\r\nres = []\r\nfor ch in mySet:\r\n store = [float('inf') for _ in range(n)]\r\n last = -1\r\n for i in range(n):\r\n if s[i] == ch:\r\n last = i\r\n store[i] = 0\r\n if last != -1:\r\n store[i] = i - last\r\n # print(store)\r\n res.append(store)\r\n\r\ncalc = []\r\nfor i in range(n):\r\n mx = res[0][i]\r\n for j in range(1, len(mySet)):\r\n mx = max(mx, res[j][i])\r\n calc.append(mx)\r\n\r\nprint(min(calc) + 1)\r\n\r\n\r\n\r\n", "casos = int(input())\npisos = input()\ntipos_pokemon = set(pisos)\nminimo_pisos = casos\npokemons_vistos = {}\ninicio = 0\nfor fin in range(casos):\n if pisos[fin] not in pokemons_vistos:\n pokemons_vistos[pisos[fin]] = 0\n pokemons_vistos[pisos[fin]] = pokemons_vistos[pisos[fin]] + 1\n while len(pokemons_vistos) == len(tipos_pokemon):\n minimo_pisos = min(minimo_pisos, fin - inicio + 1)\n pokemons_vistos[pisos[inicio]] = pokemons_vistos[pisos[inicio]] - 1\n if pokemons_vistos[pisos[inicio]] == 0:\n del pokemons_vistos[pisos[inicio]]\n inicio = inicio + 1\nprint(minimo_pisos)\n\n\t \t \t \t\t\t \t \t \t\t \t \t", "n = int(input())\r\nli = list(input())\r\n\r\ntarget = len(set(li))\r\n\r\nans = 1e9\r\nj = 0\r\nfreq = {}\r\ns = set()\r\n\r\nfor i in range(n):\r\n while j < n and len(s) < target:\r\n s.add(li[j])\r\n freq[li[j]] = freq.get(li[j], 0) + 1\r\n j += 1\r\n\r\n if len(s) == target:\r\n ans = min(ans, j - i)\r\n\r\n freq[li[i]] = freq.get(li[i], 0) - 1\r\n\r\n if freq[li[i]] == 0:\r\n s.remove(li[i])\r\n\r\nprint(ans)", "n = int(input())\ns = input()\nsset = set(s)\ni, j = 0, 0\ntset = set(s[0])\ntdict = {k: 0 for k in sset}\ntdict[s[0]] = 1\nans = 4294967295\nwhile j < n:\n while len(tset) != len(sset) and j < n - 1:\n j += 1\n tdict[s[j]] += 1\n if tdict[s[j]] == 1: tset.add(s[j])\n if len(tset) == len(sset): \n ans = min(ans, j - i + 1)\n # print(i, j, tset)\n if s[i] in tset:\n tdict[s[i]] -= 1\n if tdict[s[i]] == 0:\n tset.remove(s[i])\n i += 1\n if i >= n: break\nprint(ans)", "n = int(input())\r\n\r\np = list(input())\r\ntypes = {x : 0 for x in list(set(p))}\r\n\r\nb = 0\r\ne = 0\r\ntypes[p[0]] += 1\r\n\r\ndef findmin(types, e):\r\n while min(types.values()) == 0:\r\n if e == len(p) - 1:\r\n print(mini + 1)\r\n quit()\r\n e += 1\r\n types[p[e]] += 1\r\n return types, e\r\ntypes, e = findmin(types, e)\r\nmini = e\r\nwhile e < n:\r\n types[p[b]] -= 1\r\n b += 1\r\n types, e = findmin(types, e)\r\n mini = min(mini, e - b)\r\nprint(mini + 1)", "from collections import defaultdict\n\nn = int(input())\ns = [ord(c) - ord('A') + 1 for c in input().strip()]\n\nunique_types = len(set(s))\n\nleft, right = 0, 0\ncount = 0\nmin_length = float('inf')\nst = defaultdict(int)\n\nwhile right < n:\n if st[s[right]] == 0:\n count += 1\n st[s[right]] += 1\n right += 1\n \n while count == unique_types:\n min_length = min(min_length, right - left)\n \n st[s[left]] -= 1\n if st[s[left]] == 0:\n count -= 1\n \n left += 1\n\nprint(min_length)\n\n\n\t\t\t\t \t \t\t \t\t\t \t\t\t \t \t \t", "#import sys \r\n#sys.stdin = open(\"pokemon.inp\",\"r\")\r\n#sys.stdout = open(\"pokemon.out\",\"w\")\r\nn = int(input())\r\ns = input()\r\ndic = {}\r\ncnt = 0\r\nfor x in s:\r\n if (dic.get(x) == None): \r\n cnt += 1\r\n dic[x] = 1\r\ns = \" \" + s + \" \";\r\nl = r = 1;\r\nans = n;\r\ndic = {}\r\ndic[s[1]] = 1;\r\nd = 1;\r\nwhile (l <= r and r <= n):\r\n if (d == cnt):\r\n ans = min(ans, r - l + 1)\r\n dic[s[l]] -= 1\r\n if (dic[s[l]] == 0): d -= 1;\r\n l += 1\r\n else:\r\n r += 1;\r\n if (dic.get(s[r]) == None): \r\n d += 1;\r\n dic[s[r]] = 1;\r\n elif (dic[s[r]] == 0):\r\n d += 1;\r\n dic[s[r]] += 1;\r\n else:\r\n dic[s[r]] += 1;\r\nprint(ans)", "from collections import Counter\r\nc=Counter()\r\nn=int(input())\r\ns=input()\r\nl=len(set(s))\r\ni,j,t=0,0,0\r\nans=2**69\r\nwhile j<n:\r\n while len(c)<l and j<n: c[s[j]]+=1; j+=1\r\n while len(c)==l:\r\n ans=min(ans,j-i)\r\n c[s[i]]-=1\r\n if c[s[i]]==0: del c[s[i]]\r\n i+=1\r\nprint(ans)\r\n", "from collections import Counter, defaultdict, deque\r\nimport sys, threading\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)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\nn = inp()\r\ns = insr()\r\ncount = defaultdict(int)\r\nfor i in range(n):\r\n count[s[i]] += 1\r\nk = len(count)\r\n\r\ncurr = defaultdict(int)\r\n# hold = set()\r\nleft = 0\r\nans = n\r\n\r\nfor right in range(n):\r\n curr[s[right]] += 1\r\n size = len(curr)\r\n while left <= right and size == k:\r\n ans = min(ans, right - left + 1)\r\n curr[s[left]] -= 1\r\n if curr[s[left]] == 0:\r\n size -= 1\r\n del curr[s[left]]\r\n left += 1 \r\nprint(ans) \r\n \r\n \r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ns = input()[:-1]\r\nx = len(set(s))\r\nd = dict()\r\n\r\nj = 0\r\new = 1e9\r\nc = 0\r\nfor i in range(n):\r\n if d.get(s[i], 0) == 0:\r\n c += 1\r\n d[s[i]] = 1\r\n if c == x:\r\n ew = min(ew, i-j+1)\r\n while c == x:\r\n d[s[j]] -= 1\r\n if d[s[j]] == 0:\r\n del d[s[j]]\r\n j += 1\r\n c -= 1\r\n break\r\n j += 1\r\n ew = min(ew, i - j + 1)\r\n else:\r\n d[s[i]] += 1\r\nprint(ew)\r\n\r\n", "from collections import defaultdict\ndef f(s):\n\tres=len(set(s))\n\tans=len(s)\n\tl=0\n\tg=defaultdict(int)\n\tfor i in range(len(s)):\n\t\thi=i\n\t\tg[s[hi]]+=1\n\t\tif len(g)==res:\n\t\t\tans=min(ans,hi-l+1)\n\t\t\twhile l<hi:\n\t\t\t\tif g[s[l]]>=2:\n\t\t\t\t\tg[s[l]]-=1\n\t\t\t\t\tl+=1\n\t\t\t\telse:\n\t\t\t\t\tbreak\n\t\t\tans=min(ans,hi-l+1)\n\treturn ans\n\nn=input()\nn=input()\nprint(f(n))\n\t\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\nsys.setrecursionlimit(100000)\r\nfrom collections import deque, defaultdict\r\np = print\r\nr = range\r\nde = defaultdict\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\ns = S()\r\ntotal = len(set(s))\r\nd = defaultdict(int)\r\nminL = INF()\r\nl = 0\r\nr = 0\r\nwhile r<n:\r\n while r<n and len(d)!=total:\r\n d[s[r]] += 1\r\n r += 1\r\n while len(d) == total:\r\n if d[s[l]] == 1:\r\n d.pop(s[l])\r\n else:\r\n d[s[l]] -= 1\r\n minL = min(minL, r - l)\r\n l += 1\r\n #p(l,r,d)\r\n if len(d)==total:\r\n minL = min(minL, r-l)\r\np(minL)\r\n\r\n", "# cook your dish here\r\nn=int(input())\r\nst=list(input())\r\nlst=set(st)\r\nm=len(lst)\r\nj=0\r\nans=n\r\nmp=dict()\r\nfor i in range(n):\r\n if st[i] not in mp:\r\n mp[st[i]]=1\r\n else :\r\n mp[st[i]]+=1\r\n \r\n while len(mp)==m:\r\n mp[st[j]]-=1\r\n ans=min(ans,i-j+1)\r\n if mp[st[j]]==0:\r\n mp.pop(st[j])\r\n j+=1\r\nprint(ans)\r\n", "# https://codeforces.com/problemset/problem/701/C\r\n# two pointers method\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = input()\r\n\r\n u_set = set()\r\n for i in s:\r\n u_set.add(i)\r\n u_cnt = len(u_set)\r\n\r\n d = {}\r\n j = 0\r\n ans = 10**9\r\n for i in range(n):\r\n while len(d.keys()) < u_cnt and j < n:\r\n d[s[j]] = d.get(s[j], 0) + 1\r\n j += 1\r\n\r\n if len(d.keys()) == u_cnt:\r\n if j - i < ans:\r\n ans = j - i\r\n elif j == n:\r\n break\r\n\r\n d[s[i]] -= 1\r\n if d[s[i]] == 0:\r\n del d[s[i]]\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", " ###### ### ####### ####### ## # ##### ### ##### \n # # # # # # # # # # # # # ### \n # # # # # # # # # # # # # ### \n ###### ######### # # # # # # ######### # \n ###### ######### # # # # # # ######### # \n # # # # # # # # # # #### # # # \n # # # # # # # ## # # # # # \n ###### # # ####### ####### # # ##### # # # # \n\nfrom __future__ import print_function # for PyPy2\nfrom collections import Counter, OrderedDict\nfrom itertools import permutations as perm\nfrom fractions import Fraction\nfrom collections import deque\nfrom sys import stdin\nfrom bisect import *\nfrom heapq import *\n# from math import *\n\ng = lambda : stdin.readline().strip()\ngl = lambda : g().split()\ngil = lambda : [int(var) for var in gl()]\ngfl = lambda : [float(var) for var in gl()]\ngcl = lambda : list(g())\ngbs = lambda : [int(var) for var in g()]\nmod = int(1e9)+7\ninf = float(\"inf\") \n\nn, = gil()\ns = g()\nans = n\nrqd = len(set(s))\n\ndef isPos(x):\n\tbase = Counter(s[:x])\n\n\tif len(base) == rqd:\n\t\treturn True\n\tfor i in range(x, n):\n\t\tif base[s[i-x]] == 1:\n\t\t\tdel base[s[i-x]] \n\t\telse:\n\t\t\tbase[s[i-x]] -= 1\n\n\t\tbase[s[i]] = base.get(s[i], 0) + 1\n\t\tif len(base) == rqd:return True\n\n\treturn False\n\n\nl, r = rqd, n\nwhile l <= r:\n\tmid = (l+r)//2\n\tif isPos(mid):\n\t\tr = mid - 1\n\t\tans = mid\n\telse:\n\t\tl = mid + 1\n\nprint(ans)\n", "n = int(input())\r\ns = input()\r\nmax_pokemon = len(set(s))\r\npokemon_found = dict()\r\ni, j = 0, 0\r\nans = n\r\n\r\nwhile i < n:\r\n while j < n and len(pokemon_found) < max_pokemon:\r\n pokemon_found[s[j]] = pokemon_found.get(s[j], 0) + 1\r\n j += 1\r\n\r\n if len(pokemon_found) == max_pokemon:\r\n ans = min(ans, j-i)\r\n\r\n if pokemon_found[s[i]] == 1:\r\n pokemon_found.pop(s[i])\r\n else:\r\n pokemon_found[s[i]] -= 1\r\n\r\n i += 1\r\n\r\nprint(ans)", "n = int(input())\nflats = input()\nans = n\ncount = {}\nfor c in flats:\n count[c] = 0\nall_char = len(count)\n\nj = 0\nexist = 0\nfor i in range(n):\n while j < n and exist < all_char:\n if count[flats[j]] == 0:\n exist += 1\n count[flats[j]] += 1\n j += 1\n if exist == all_char:\n ans = min(ans, j - i)\n else:\n break\n count[flats[i]] -= 1\n if count[flats[i]] == 0:\n exist -= 1\n\nprint(ans)", "n = int(input())\r\ntypes = list(input())\r\n\r\nans = 10 ** 5\r\ncol_types = len(set(types))\r\ncount = {}\r\ncnt = 0\r\n\r\nj = 0\r\nfor i in range(n):\r\n while j < n and cnt < col_types:\r\n if types[j] in count.keys():\r\n count[types[j]] += 1\r\n else:\r\n count[types[j]] = 1\r\n\r\n if count[types[j]] == 1:\r\n cnt += 1\r\n j += 1\r\n\r\n if cnt == col_types:\r\n ans = min(ans, j - i)\r\n else:\r\n break\r\n\r\n count[types[i]] -= 1\r\n if count[types[i]] == 0:\r\n cnt -= 1\r\n\r\nprint(ans)\r\n", "n = int(input())\r\ns = input()\r\n\r\ncollected = { }\r\nfor pokemon in s:\r\n collected[pokemon] = 0\r\n\r\nfirst = 0\r\nlast = 0\r\n\r\ncollectedCount = 0\r\nwhile collectedCount < len(collected):\r\n if collected[s[last]] == 0:\r\n collectedCount+=1\r\n\r\n collected[s[last]] +=1\r\n last+=1\r\n\r\nmin = last\r\nwhile first < n:\r\n if collectedCount == len(collected) and last - first < min:\r\n min = last - first\r\n\r\n collected[s[first]]-=1\r\n if collected[s[first]] == 0:\r\n collectedCount-=1\r\n\r\n first+=1\r\n\r\n while last < n and collectedCount < len(collected):\r\n if collected[s[last]] == 0:\r\n collectedCount+=1\r\n\r\n collected[s[last]]+=1\r\n last+=1\r\n\r\nprint(min)", "# توكلت على الله\r\nimport sys \r\ninput = sys.stdin.readline \r\n\r\n \r\ndef solve():\r\n num = int(input())\r\n flat = input().strip()\r\n cnt = 0\r\n map_store = {}\r\n lenth = len( set( flat ) )\r\n Min = 10e9\r\n for pok in range(num):\r\n if flat[pok] not in map_store :\r\n map_store[flat[pok]] = pok\r\n cnt = cnt + 1\r\n map_store[flat[pok]] = pok\r\n if cnt == lenth:\r\n Min = min(Min, pok - min( map_store.values() ) + 1 )\r\n \r\n print(Min)\r\n \r\n \r\n \r\n#for i in range(int(input())):\r\nsolve() ", "import collections\r\n\r\n\r\ndef smart_search():\r\n def evaluate(v):\r\n # for i in range(n - v + 1):\r\n # if len(set(pokemon[i:i + v])) == types:\r\n # return True\r\n #\r\n # return False\r\n curr = diff.copy()\r\n l, r = 0, v - 1\r\n unique = len(set(pokemon[l:r + 1]))\r\n for i in pokemon[l:r + 1]:\r\n curr[i] += 1\r\n if unique >= types:\r\n return True\r\n while r < n - 1:\r\n curr[pokemon[l]] -= 1\r\n if not curr[pokemon[l]]:\r\n unique -= 1\r\n l += 1\r\n r += 1\r\n if not curr[pokemon[r]]:\r\n unique += 1\r\n curr[pokemon[r]] += 1\r\n if unique >= types:\r\n return True\r\n\r\n return False\r\n\r\n evaluate(5)\r\n left, right = 1, n\r\n while left < right:\r\n mid = left + (right - left) // 2\r\n if evaluate(mid):\r\n right = mid\r\n else:\r\n left = mid + 1\r\n return left\r\n\r\n\r\ndef work():\r\n return smart_search()\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input().strip())\r\n pokemon = list(input().strip())\r\n types = len(set(pokemon))\r\n diff = {i: 0 for i in pokemon}\r\n print(work())\r\n", "n = int(input())\ns = input()\n\nnum_pkmn = len(set(s))\n\nans = n\nl = r = 0\ncount_pkmn = {s[0]: 1}\n\nwhile r < n:\n if len(count_pkmn) == num_pkmn:\n ans = min(ans, r - l + 1)\n count_pkmn[s[l]] -= 1\n if count_pkmn[s[l]] == 0:\n del count_pkmn[s[l]]\n l += 1\n else:\n r += 1\n if r < n:\n if s[r] not in count_pkmn:\n count_pkmn[s[r]] = 0\n count_pkmn[s[r]] += 1\n\nprint(ans)", "n=int(input())\r\ns=input()\r\nS=len(set(s))\r\na=n\r\nj=t=0\r\nd={}\r\nfor i in range(n):\r\n if s[i] not in d:d[s[i]]=0;t+=1\r\n d[s[i]]+=1\r\n if t==S:\r\n while d[s[j]]>1:\r\n d[s[j]]-=1\r\n j+=1 \r\n a=min(a,i-j+1)\r\nprint(a)", "\r\nfrom collections import defaultdict\r\nfrom email.policy import default\r\nfrom selectors import BaseSelector\r\nimport sys\r\nfrom typing import Counter\r\n\r\n\r\nl = int(input())\r\ns = input()\r\nhash_set = Counter(s)\r\ncheck = defaultdict(int)\r\nleft = right = 0\r\ncheck[s[0]] = 1\r\nleft, right = 0,0\r\nres = sys.maxsize\r\nwhile left <= right and right < l:\r\n if check.keys() == hash_set.keys():\r\n res = min(res,right - left + 1)\r\n check[s[left]] -= 1\r\n if check[s[left]] == 0:\r\n del check[s[left]]\r\n left += 1\r\n else:\r\n right += 1\r\n if right <= l - 1:\r\n check[s[right]] += 1\r\nprint(res)\r\n\r\n# right out of bound\r\n# ans = sys.maxsize\r\n# while left <= right and right < l:\r\n# if check == hash_set:\r\n# ans = min(ans,right - left + 1)\r\n# left += 1\r\n# print(left,right,check)\r\n# check.remove(s[left])\r\n# else:\r\n# if right < l - 1:\r\n# right += 1\r\n# check.add(s[right])\r\n\r\n# print(ans)", "n = int(input())\npokemons = input()\n\npokemones = len(set(pokemons))\ni = 0\nj = 0\nencontrado = False\nmin_rango = n\npokemons_vistos = {}\n\nwhile j < n:\n if pokemons[j] not in pokemons_vistos:\n pokemons_vistos[pokemons[j]] = 1\n else:\n pokemons_vistos[pokemons[j]] += 1\n \n while len(pokemons_vistos) == pokemones:\n min_rango = min(min_rango, j-i+1)\n pokemons_vistos[pokemons[i]] -= 1\n if pokemons_vistos[pokemons[i]] == 0:\n del pokemons_vistos[pokemons[i]]\n i += 1\n \n j += 1\n\nprint(min_rango)\n\n\n\t \t \t \t\t \t\t \t \t \t\t\t \t\t", "t=int(input())\r\nm=input()\r\ns=set()\r\nfor i in m:\r\n s.add(i)\r\nl=len(s)\r\nleft=0\r\ndic={}\r\nans=t\r\nfor i in range(t):\r\n if m[i] not in dic:\r\n dic[m[i]]=0\r\n dic[m[i]]+=1\r\n while left<i and dic[m[left]]>1:\r\n dic[m[left]]-=1\r\n left+=1\r\n if len(dic)==l:\r\n ans=min(ans,i-left+1)\r\nprint(ans)\r\n \r\n\r\n ", "import heapq\r\n\r\nn=int(input())\r\ns=input()\r\nq={}\r\nz=len(set(s))\r\nres=10**10\r\nc=0\r\ndelta=10**11\r\ny=heapq.heapify([])\r\nfor j in range(len(s)):\r\n if s[j] not in q:\r\n c+=1\r\n q[s[j]]=j\r\n if c==z:\r\n res=min(res, j-min(q.values()))\r\nprint(res+1)", "from collections import Counter\r\n\r\nn = int(input())\r\nstring = input()\r\nchars = set(string)\r\ncnt = Counter()\r\n\r\nleft = right = 0\r\n\r\nwhile len(cnt) != len(chars):\r\n cnt[string[right]] += 1\r\n right += 1\r\n\r\nans = right\r\n\r\nright -= 1\r\n\r\nwhile right < n:\r\n while cnt[string[left]] != 1:\r\n cnt[string[left]] -= 1\r\n left += 1\r\n ans = min(ans, right - left + 1)\r\n right += 1\r\n if right < n:\r\n cnt[string[right]] += 1\r\n\r\nprint(ans)\r\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\n\r\ns = input()\r\n\r\nl = 0\r\nr = 0\r\n\r\n\r\nset_poke = set(s)\r\nans = n\r\nd = defaultdict(int)\r\nd[s[r]] = 1\r\nwhile(l<n):\r\n\r\n if len(d) == len(set_poke):\r\n\r\n ans = min(ans, r-l+1)\r\n d[s[l]] -= 1\r\n if d[s[l]] == 0:\r\n del d[s[l]]\r\n \r\n l += 1\r\n continue\r\n \r\n if r < n-1:\r\n r += 1\r\n d[s[r]] += 1\r\n \r\n else:\r\n break\r\n\r\nprint(ans)\r\n", "n = int(input())\nflats = list(input())\n\npokemon = set()\nfor i in flats:\n pokemon.add(i)\n\ntracker = {}\nfor i in pokemon:\n tracker[i] = 0\n\ndef verify():\n for i in tracker:\n if tracker[i] == 0:\n return False\n return True\n\nlptr = 0\nrptr = 0\ntracker[flats[0]] += 1\n\nshortest = n\nwhile True:\n while rptr < len(flats) - 1 and not verify():\n rptr += 1\n tracker[flats[rptr]] += 1\n\n while verify():\n tracker[flats[lptr]] -= 1\n lptr += 1\n\n shortest = min(shortest, rptr - lptr + 2)\n\n if rptr == len(flats) - 1:\n break\n\nprint(shortest)\n \t\t\t\t \t \t \t\t\t\t\t \t\t \t \t", "flat_num = int(input())\r\nflats = input()\r\ntypes = set(flats)\r\nshortest_interval = float('inf')\r\nclosest_left = 0\r\ncurr_caught = {}\r\nfor right, f in enumerate(flats):\r\n\tif f not in curr_caught:\r\n\t\tcurr_caught[f] = 0\r\n\tcurr_caught[f] += 1\r\n\twhile closest_left + 1 <= right and curr_caught.get(flats[closest_left], 0) > 1:\r\n\t\tcurr_caught[flats[closest_left]] -= 1\r\n\t\tclosest_left += 1\r\n\tif len(curr_caught) == len(types):\r\n\t\tshortest_interval = min(shortest_interval, right - closest_left + 1)\r\nprint(shortest_interval)\r\n", "n = int(input())\r\ns = input()\r\nm = len(set(s))\r\ncnts = {}\r\nres = n\r\nj = 0\r\nfor i in range(n):\r\n cnts[s[i]] = cnts.get(s[i], 0) + 1\r\n while len(cnts) == m and cnts.get(s[j], 0) > 1:\r\n cnts[s[j]] -= 1\r\n j += 1\r\n if len(cnts) == m:\r\n res = min(res, i - j + 1)\r\nprint(res)\r\n", "n = int(input())\r\ns = input()\r\nd = {} \r\nl = len(set(list(s)))\r\nc = 0 \r\nans = 10 ** 9\r\nfor i in range(n):\r\n if(s[i] not in d):\r\n d[s[i]] = i \r\n c += 1\r\n d[s[i]] = i \r\n if(c == l):\r\n ans = min(ans, i - min(d.values()) + 1)\r\nprint(ans)", "from sys import stdin ,stdout\r\ninput=stdin.readline\r\nfrom collections import defaultdict \r\ninp=lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\ndef check() : \r\n for ch in dic : \r\n if dic[ch]==0 : return False \r\n return True \r\n\r\nn=int(input()) ; st=input().strip() ; dic={} ; l=0 ; r=0 ; ans=n+1 \r\nfor i in range(n) : \r\n dic[st[i]]=0 \r\nwhile l<n and r<n : \r\n if l>r : dic[st[r]]+=1 ; r+=1 ; continue \r\n dic[st[r]]+=1 \r\n if check() : ans=min(ans, r-l+1) ; dic[st[l]] -=1 ; l+=1 ;dic[st[r]]-=1 ; continue \r\n r+=1 \r\nprint(ans)\r\n", "#!/usr/bin/env python3\r\n\r\nimport math\r\nimport sys\r\nfrom collections import deque\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef test_case():\r\n n = int(input())\r\n a = input()\r\n\r\n curr = {}\r\n for i in range(n):\r\n if a[i] not in curr:\r\n curr[a[i]] = 0\r\n k = len(curr)\r\n\r\n\r\n ans = float(\"inf\")\r\n curr_cnt = 0\r\n i = 0\r\n j = 0\r\n while i < n:\r\n while j < n and curr_cnt != k:\r\n if curr[a[j]] == 0:\r\n curr_cnt += 1\r\n curr[a[j]] += 1\r\n j += 1\r\n# print(curr, curr_cnt)\r\n if curr_cnt == k:\r\n ans = min(ans, j-i)\r\n curr[a[i]] -= 1\r\n if curr[a[i]] == 0:\r\n curr_cnt -= 1\r\n i += 1\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", "n=int(input())\r\ns=input()\r\nx=set()\r\nfor i in s:\r\n x.add(i)\r\nx=len(x)\r\nans=n\r\ni=0\r\nj=1\r\nst=set()\r\nst.add(s[0])\r\ntmp=1\r\nd={}\r\nd[s[0]]=1\r\nwhile j<n:\r\n tmp+=1\r\n if s[j] not in d:\r\n d[s[j]]=1\r\n else:\r\n d[s[j]]+=1\r\n st.add(s[j])\r\n while i<j:\r\n if d[s[i]]-1==0:\r\n break\r\n d[s[i]]-=1\r\n i+=1\r\n tmp-=1\r\n if len(st)==x:\r\n ans=min(ans,tmp)\r\n j+=1\r\nprint(ans)", "# cook your dish here\r\n\r\nn = int(input())\r\ns = input()\r\nl = len(set(s))\r\n# print(l)\r\ndic = {}\r\nleft,right = 0,0\r\nmini = 10**9\r\nsize = 0\r\nfor left in range(n):\r\n while right<n and size<l:\r\n if s[right] not in dic:\r\n dic[s[right]] = 1\r\n else:\r\n dic[s[right]] += 1\r\n\r\n if dic[s[right]] == 1:\r\n size += 1\r\n right += 1\r\n\r\n if (size == l): \r\n mini = min(mini,right-left)\r\n \r\n dic[s[left]] -= 1\r\n if (dic[s[left]] == 0): \r\n size -= 1\r\nprint(mini)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nM = int(1e9) + 7\r\n\r\nn = int(input())\r\ns = input().strip('\\n')\r\n\r\nvis = {i:0 for i in s}\r\n\r\nl, r, cnt = 0, 0, 0\r\nwhile cnt != len(vis):\r\n if vis[s[r]] == 0:\r\n cnt += 1\r\n vis[s[r]] += 1\r\n r += 1\r\nans = r - l\r\n\r\nr -= 2\r\nvis[s[r+1]] -= 1\r\n\r\nwhile r < n - 1:\r\n r += 1\r\n vis[s[r]] += 1\r\n while vis[s[l]] > 1:\r\n vis[s[l]] -= 1\r\n l += 1\r\n ans = min(ans, r - l + 1)\r\nprint(ans)", "n = int(input())\npalabra = input()\ntipos = []\nmapa = []\ncontador = 0\nfor i in range(n):\n if palabra[i] not in tipos:\n tipos.append(palabra[i])\n if i>0:\n mapa.append([palabra[i-1],contador])\n contador=1\n elif palabra[i]==palabra[i-1] and i>0:\n contador=contador+1\n elif i>0:\n mapa.append([palabra[i-1],contador])\n contador=1\nmapa.append([palabra[n-1],contador])\nlargo = 0\nans = 0\npalabra = []\nt = len(tipos)\nm = len(mapa)\napariciones = {}\nfor k in range(m):\n palabra.append(mapa[k])\n tipo = mapa[k][0]\n if k==0:\n apariciones[tipo]=1\n largo = 1\n elif k==1:\n apariciones[tipo]=1\n largo = 2\n else:\n largo = largo - 1 + mapa[k-1][1] + 1 \n if tipo not in apariciones:\n apariciones[tipo]=1\n else:\n apariciones[tipo]+=1\n while apariciones[palabra[0][0]]>1:\n apariciones[palabra[0][0]]+=-1\n palabra.remove(palabra[0])\n largo = largo - palabra[0][1]\n if len(apariciones)==t and ans==0:\n ans = largo\n if ans!=0 and largo<ans:\n ans = largo \nprint(ans)\n \t\t \t\t \t \t\t \t\t \t\t \t \t\t\t", "N = int(input())\nflats = input()\n\npokemons = {}\nfor i in \"qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM\": pokemons[i] = 0\nfor i in flats: pokemons[i] += 1\n\nidx = N - 1\nwhile idx >= 0:\n if pokemons[flats[idx]] == 1:\n break\n pokemons[flats[idx]] -= 1\n idx -= 1\n\n\nright = idx\nleft = 0\nans = right - left + 1\n\nwhile True:\n while left < right:\n if pokemons[flats[left]] == 1:\n break\n pokemons[flats[left]] -= 1\n left += 1\n\n if right - left + 1 < ans: ans = right - left + 1\n right += 1\n\n if right < N:\n pokemons[flats[right]] += 1\n else:\n break\n\nprint(ans)\n\n\t\t\t \t\t\t \t\t \t\t\t\t\t\t\t \t\t\t \t", "from collections import defaultdict\r\nn = int(input())\r\ns = input()\r\nst = set(s)\r\nl = 0\r\nrst = defaultdict(int)\r\ncount = float('inf')\r\nfor r in range(len(s)):\r\n # if len(rst) < len(st):\r\n rst[s[r]] += 1\r\n \r\n \r\n while len(rst) == len(st):\r\n \r\n if len(rst) == len(st):\r\n count = min(count, r - l + 1)\r\n rst[s[l]] -= 1\r\n if rst[s[l]] == 0:\r\n rst.pop(s[l])\r\n l += 1\r\n\r\n \r\n \r\nprint(count)", "from sys import stdin,stdout\r\ninput = stdin.readline\r\nfrom math import inf\r\nn = int(input())\r\ns = list(map(str,input().split()))\r\ns = s[0]\r\ncount1 = 0\r\ndct1 = {}\r\nfor i in range(len(s)):\r\n if s[i] not in dct1.keys():\r\n count1 += 1\r\n dct1[s[i]] = True\r\nleft = 1\r\nright = len(s)\r\nmin1 = inf\r\nwhile left <= right:\r\n dct2 = {}\r\n count = 0\r\n mid = left + (right-left)//2\r\n for h in range(mid):\r\n if s[h] not in dct2.keys():\r\n dct2[s[h]] = 1\r\n count += 1\r\n else:\r\n dct2[s[h]] += 1\r\n if count == count1:\r\n right = mid - 1\r\n min1 = min(mid,min1)\r\n else:\r\n for i in range(mid,len(s)):\r\n dct2[s[i-mid]] -= 1\r\n if dct2[s[i-mid]] == 0:\r\n del dct2[s[i-mid]]\r\n count -= 1\r\n if s[i] in dct2.keys():\r\n dct2[s[i]] += 1\r\n else:\r\n dct2[s[i]] = 1\r\n count += 1\r\n if count == count1:\r\n right = mid - 1\r\n min1 = min(min1,mid)\r\n break\r\n if count!=count1:\r\n left = mid + 1\r\nprint(min1)", "\r\nN = int(input())\r\nS = input()\r\n\r\ntotal = len({c for c in S})\r\n\r\nM = {c : 0 for c in S}\r\nans = N; cnt = 0; pos = 0\r\nfor i in range(N):\r\n\r\n while pos < N and cnt < total:\r\n M[S[pos]] += 1\r\n if M[S[pos]] == 1:\r\n cnt += 1\r\n pos += 1\r\n\r\n if cnt == total:\r\n ans = min(ans, pos - i)\r\n \r\n M[S[i]] -= 1\r\n if M[S[i]] == 0:\r\n cnt -= 1\r\n\r\nprint(ans)\r\n", "from collections import defaultdict\r\nnum=int(input())\r\nstring=input()\r\nvalue=set(string)\r\ncheck=set()\r\nans=len(string)\r\ni=0\r\nj=0\r\nmemo=defaultdict(int)\r\nwhile i<=j :\r\n # memo[value[i]]+=1\r\n # check.add(string[i])\r\n if j>=len(string) or len(value)==len(check) : \r\n if len(value)==len(check):\r\n ans=min((j-i),ans)\r\n if memo[string[i]]==1:\r\n check.remove(string[i])\r\n memo[string[i]]-=1\r\n i+=1\r\n \r\n else:\r\n memo[string[j]]+=1\r\n check.add(string[j])\r\n j+=1\r\nif len(value)==len(check):\r\n ans=min(j-i,ans)\r\nprint(ans)\r\n \r\n ", "n,s=int(input()),input()\r\np,q,r=len(set(s)),{},10**6\r\nfor i in range(n):\r\n q[s[i]]=i\r\n if len(q)==p:r=min(r,max(q.values())-min(q.values()))\r\nprint(r+1)", "from collections import defaultdict\r\nn = int(input())\r\ns = input()\r\nfreq = defaultdict(int)\r\nl = 0\r\ntot = len(set(s))\r\ncur = 0\r\nans = n\r\nfor r in range(n):\r\n freq[s[r]] += 1\r\n if freq[s[r]] == 1:\r\n cur += 1\r\n while cur == tot:\r\n ans = min(ans, r - l + 1)\r\n freq[s[l]] -= 1\r\n if freq[s[l]] == 0:\r\n cur -= 1\r\n l += 1\r\nprint(ans)", "\"\"\"\r\nhttps://codeforces.com/contest/701/problem/C\r\n7\r\nbcAAcbc should output 3\r\n6\r\naaBCCe should output 5\r\n\"\"\"\r\nfrom typing import Dict, Any\r\n\r\nflat_num = int(input())\r\nflats = input()\r\ntypes = set(flats)\r\n\r\nshortest_interval = float('inf')\r\nclosest_left = 0\r\ncurr_caught = {}\r\nfor right, f in enumerate(flats):\r\n if f not in curr_caught:\r\n curr_caught[f] = 0\r\n curr_caught[f] += 1\r\n\r\n while closest_left + 1 <= right and curr_caught.get(flats[closest_left], 0) > 1:\r\n curr_caught[flats[closest_left]] -= 1\r\n closest_left += 1\r\n\r\n if len(curr_caught) == len(types):\r\n shortest_interval = min(shortest_interval, right - closest_left + 1)\r\n\r\nprint(shortest_interval)\r\n", "import sys\r\n\r\n# sys.stdin = open(\"1.in\", \"r\")\r\n\r\nn = int(input())\r\npokes = input()\r\ntarget = len({x for x in pokes})\r\ndict1 = dict()\r\nwhere = dict()\r\nset1 = set()\r\nres = sys.maxsize\r\nfor i in range(0, len(pokes)):\r\n if pokes[i] in set1:\r\n where.pop(dict1[pokes[i]])\r\n set1.add(pokes[i])\r\n dict1[pokes[i]] = i\r\n where[i] = 1\r\n if len(set1) == target:\r\n res = min(res, i-next(iter(where))+1)\r\nprint(res)", "from collections import defaultdict\r\nn = int(input())\r\ns = input()\r\n \r\nAns = 1\r\nfirst = 0\r\n \r\nDict = defaultdict(int)\r\nDict[s[0]] = 1\r\n \r\nfor index in range(1,n):\r\n i = s[index]\r\n \r\n if(Dict[i]==0):\r\n Ans = index-first+1\r\n Dict[i]+=1\r\n else:\r\n Dict[i]+=1\r\n while(first<index and Dict[s[first]]>1):\r\n Dict[s[first]]-=1\r\n first+=1\r\n \r\n \r\n Ans = min(index-first+1,Ans)\r\n \r\nprint(Ans)\r\n ", "# n_y = list(map(int, input().split()))\r\nn = int(input())\r\ns = input()\r\nunique = set()\r\nfor char in s: unique.add(char)\r\n\r\n_dict = {}\r\nfor char in unique:\r\n _dict[char] = 0\r\n\r\nl,r,window = 0,0,100000+1\r\nvisited = set()\r\n\r\nwhile r < len(s):\r\n if len(visited) < len(unique):\r\n visited.add(s[r])\r\n _dict[s[r]] += 1\r\n r += 1\r\n elif len(visited) == len(unique):\r\n window = min(window, r-l)\r\n _dict[s[l]] -= 1\r\n if _dict[s[l]] == 0:\r\n visited.remove(s[l])\r\n l += 1\r\n\r\nif len(visited) == len(unique):\r\n window = min(window, r-l)\r\nwhile l < len(s):\r\n if len(visited) == len(unique):\r\n window = min(window, r-l)\r\n _dict[s[l]] -= 1\r\n if _dict[s[l]] == 0:\r\n visited.remove(s[l])\r\n l +=1\r\n else:\r\n break\r\nprint(window)", "from collections import Counter\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nletters = Counter(s)\r\n\r\ndist_len = len(letters)\r\n\r\nl = 0\r\nr = -1\r\n\r\nwin_letters = {}\r\nres = n\r\n\r\nwhile r < n:\r\n if len(win_letters) == dist_len:\r\n res = min(res, r- l + 1)\r\n win_letters[s[l]]-=1\r\n if win_letters[s[l]] == 0:del win_letters[s[l]]\r\n l += 1\r\n else:\r\n r+=1\r\n if r == n:break\r\n if s[r] in win_letters : win_letters[s[r]] +=1\r\n else: win_letters[s[r]] = 1\r\n\r\nprint(res)\r\n", "import sys\r\nimport math\r\n\r\nprime=[True for _ in range(1000001)]\r\n\r\n# # Remove these 2 lines while submitting your code online\r\n# sys.stdin = open('input.txt', 'r')\r\n# sys.stdout = open('output.txt', 'w')\r\ndef solve():\r\n n,e,h,a,b,c=map(int,input().split())\r\n ans=1e9\r\n for i in range(1,1000001):\r\n su=0\r\n ntmp=n\r\n tmp1=e\r\n tmp2=h\r\n tmp1-=i\r\n tmp2-=i\r\n if (tmp1<0 or tmp2<0 or i>ntmp):\r\n break\r\n ntmp-=i\r\n su+=(c*i)\r\n if (ntmp==0):\r\n ans=min(ans,su)\r\n continue\r\n if (a<=b):\r\n if ((tmp1//2)>=ntmp):\r\n su+=int(a*ntmp)\r\n ntmp-=ntmp\r\n else:\r\n su+=int(a*(tmp1//2))\r\n ntmp-=(tmp1//2)\r\n if (ntmp<=(tmp2//3)):\r\n su+=int(b*ntmp)\r\n ntmp-=ntmp\r\n else:\r\n su+=int(b*(tmp2//3))\r\n ntmp-=(tmp2//3)\r\n else:\r\n if ((tmp2//3)>=ntmp):\r\n su+=int(b*ntmp)\r\n ntmp-=ntmp\r\n else:\r\n su+=int(b*(tmp2//3))\r\n ntmp-=(tmp2//3)\r\n if (ntmp<=(tmp1//2)):\r\n su+=int(a*ntmp)\r\n ntmp-=ntmp\r\n else:\r\n su+=int(a*(tmp1//2))\r\n ntmp-=(tmp1//2)\r\n if (ntmp==0):\r\n ans=min(ans,su)\r\n # print(ans)\r\n if (ans==1e9):\r\n print(\"-1\")\r\n else:\r\n print(ans)\r\n\r\ndef main():\r\n n=int(input())\r\n s=input()\r\n m={}\r\n have={}\r\n cc=0\r\n for c in s:\r\n if (c not in m):\r\n m[c]=1\r\n else:\r\n m[c]+=1\r\n ct=len(m)\r\n l=0\r\n ans=1e9\r\n for i in range(0,n):\r\n if (s[i] not in have):\r\n have[s[i]]=0\r\n cc+=1\r\n have[s[i]]+=1\r\n while(l<=i and have[s[l]]>1):\r\n have[s[l]]-=1\r\n l+=1\r\n if (cc==ct):\r\n ans=min(ans,i-l+1)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict\r\nn=int(input())\r\ns=[el for el in input()]\r\ntot=len(set(s))\r\nans=float(\"inf\")\r\nl=0\r\nseen=defaultdict(int)\r\ntemp=set()\r\nfor r in range(n):\r\n temp.add(s[r])\r\n seen[s[r]]+=1\r\n while seen[s[l]]>1:\r\n\r\n seen[s[l]]-=1\r\n l+=1\r\n if len(temp)==tot:\r\n ans=min(ans,r-l+1)\r\nwhile l<=r:\r\n seen[s[l]]-=1\r\n if seen[s[l]]==0:\r\n temp.remove(s[l])\r\n l+=1\r\n if len(temp)==tot:\r\n ans=min(ans,r-l+1)\r\nprint(ans)", "n = int(input())\r\na = list(input())\r\np = len(set(a))\r\nl,i,j = 0,0,0\r\nb = []\r\nc = {}\r\nwhile i<n or j<n:\r\n if l==p:\r\n b.append(j-i)\r\n c[a[i]]-=1\r\n if c[a[i]]==0:\r\n l=l-1\r\n i=i+1\r\n else:\r\n if j<n:\r\n while l!=p and j<n:\r\n if a[j] in c:\r\n if c[a[j]]==0:\r\n l=l+1\r\n c[a[j]]=c[a[j]]+1\r\n else:\r\n c[a[j]]+=1\r\n else:\r\n l+=1\r\n c[a[j]]=1\r\n j+=1\r\n else:\r\n i+=1\r\nprint(min(b))\r\n", "from collections import Counter\r\n\r\nR = lambda: map(int, input().split())\r\nn = int(input())\r\ns = input()\r\nnc = len(Counter(s))\r\nj = -1\r\nres = n\r\nrdict = {}\r\nfor i in range(n):\r\n rdict[s[i]] = rdict.get(s[i], 0) + 1\r\n while len(rdict) == nc and rdict[s[j + 1]] > 1:\r\n rdict[s[j + 1]] = rdict.get(s[j + 1]) - 1\r\n j += 1\r\n if len(rdict) == nc:\r\n res = min(res, i - j)\r\nprint(res)\r\n", "# import sys, os\r\n#\r\n# sys.stdin = open(os.path.join(sys.path[0], \"input.txt\"), \"r\")\r\n# sys.stdout = open(os.path.join(sys.path[0], \"output.txt\"), \"w\")\r\n\r\nfrom collections import defaultdict\r\n\r\nn = int(input())\r\nhouses = input()\r\nup = len(set(houses))\r\nl, r, unique, map, result = 0, 0, 0, defaultdict(int), float(\"inf\")\r\nwhile r < n:\r\n map[houses[r]] += 1\r\n if map[houses[r]] == 1:\r\n unique += 1\r\n while unique == up:\r\n result = min(result, r - l + 1)\r\n map[houses[l]] -= 1\r\n if map[houses[l]] == 0:\r\n unique -= 1\r\n l += 1\r\n r += 1\r\nprint(result)\r\n", "n = int(input())\ns = input()\nq = len(set(s))\nd = dict()\ncount = 0\nans = 999999999\nj = 0\nfor i in range(n):\n\tif s[i] not in d:\n\t\td[s[i]] = 0\n\t\tcount += 1\n\td[s[i]] += 1\n\tif count == q:\n\t\twhile d[s[j]] > 1:\n\t\t\td[s[j]] -= 1\n\t\t\tj += 1\n\t\tans = min(ans, i - j + 1)\nprint(ans)", "from collections import Counter\r\n\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\n\r\ndef solve(s):\r\n pokemons = set(list(s))\r\n l = 0\r\n d = Counter()\r\n def doesWork():\r\n for p in pokemons:\r\n if d[p] <= 0:\r\n return False\r\n return True\r\n ans = len(s)\r\n for r in range(len(s)):\r\n d[s[r]] += 1\r\n while doesWork():\r\n ans = min(ans,r - l + 1)\r\n d[s[l]] -= 1\r\n l += 1\r\n print(ans)\r\n\r\n\r\n\r\n\r\ninput()\r\nsolve(input())", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN = int(input())\r\nS = input()\r\n\r\nK = len(set(S))\r\nlib = defaultdict(int)\r\n\r\nans = float('inf')\r\nl,r = 0,0\r\n\r\nfor l in range(N):\r\n while len(lib)<K and r<N:\r\n c = S[r]\r\n if not c in lib:\r\n lib[c]=1\r\n else:\r\n lib[c]+=1\r\n r+=1\r\n if r>=N:break\r\n if len(lib)==K:\r\n ans = min(ans, r-l)\r\n c = S[l]\r\n lib[c]-=1\r\n if lib[c]==0:\r\n del lib[c]\r\n \r\nprint(ans)\r\n \r\n \r\n \r\n \r\n\r\n\r\n\r\n ", "\nn=int(input())\ns=input()\nl=[0]*n\nfor k in set(s): \n\tj = -1\n\tfor i in range(n):\n\t\tif s[i]==k:\n\t\t\tj = i\n\t\tif j==-1:\n\t\t\tl[i]=n\n\t\telse:\n\t\t\tl[i]=max(l[i],i-j+1)\nprint(min(l))\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\ns = input()\r\nd = set()\r\np = {}\r\nD = 0\r\nfor i in s:\r\n if i not in d:\r\n d.add(i)\r\n p[i] = D\r\n D += 1\r\n\r\n\r\ndef calc(k):\r\n P = [0] * D\r\n num = 0\r\n for i in range(n):\r\n if i >= k:\r\n P[p[s[i - k]]] -= 1\r\n if P[p[s[i - k]]] == 0:\r\n num -= 1\r\n\r\n if P[p[s[i]]] == 0:\r\n P[p[s[i]]] += 1\r\n num += 1\r\n if num == D:\r\n return True\r\n else:\r\n P[p[s[i]]] += 1\r\n\r\n return False\r\n\r\n\r\nl, r = 0, n\r\nwhile r - l > 1:\r\n mid = (l + r) // 2\r\n if calc(mid):\r\n r = mid\r\n else:\r\n l = mid\r\n\r\nprint(r)", "N = int(input())\r\nword = input()\r\nwords = list(set(list(word)))\r\nusing = [0 for i in range(len(words))]\r\nkey = {}\r\nfor i in range(len(words)): key[words[i]] = i\r\nworst = N\r\nleft = right = 0\r\nwhile(True):\r\n if(min(using) == 0):\r\n if(right == N): break\r\n using[key[word[right]]] += 1\r\n right += 1\r\n else:\r\n worst = min(right - left, worst)\r\n using[key[word[left]]] -= 1\r\n left += 1\r\nprint(worst)", "reps = {}\n\nn = int(input())\ns = input().strip()\n\nfor c in s:\n reps[c] = 0\n\ni = 0\nj = -1\naux = 0\nans = 1e10\nsum_reps = 0\n\nwhile j < n - 1:\n reps[s[j+1]] += 1\n if reps[s[j+1]] == 1:\n aux += 1\n while reps[s[i]] > 1:\n reps[s[i]] -= 1\n i += 1\n j += 1\n if aux == len(reps):\n ans = min(ans, (j - i + 1))\n \nfor _ in reps:\n sum_reps += reps[_]\n\nans = min(sum_reps, ans)\n\nprint(ans)\n\t\t \t \t\t \t \t\t \t\t\t\t\t\t \t\t", "N = int(input())\r\nflats = input()\r\n\r\npokemons = {}\r\nfor i in \"qwertyuiopasdfghjklzxcvbnmQWERTYUIOPASDFGHJKLZXCVBNM\": pokemons[i] = 0\r\nfor i in flats: pokemons[i] += 1\r\n\r\nidx = N - 1\r\nwhile idx >= 0:\r\n if pokemons[flats[idx]] == 1:\r\n break\r\n pokemons[flats[idx]] -= 1\r\n idx -= 1\r\n\r\n\r\nright = idx\r\nleft = 0\r\nans = right - left + 1\r\n\r\nwhile True:\r\n while left < right:\r\n if pokemons[flats[left]] == 1:\r\n break\r\n pokemons[flats[left]] -= 1\r\n left += 1\r\n\r\n if right - left + 1 < ans: ans = right - left + 1\r\n right += 1\r\n\r\n if right < N:\r\n pokemons[flats[right]] += 1\r\n else:\r\n break\r\n\r\nprint(ans)\r\n", "import sys\nLI=lambda:list(map(int, sys.stdin.readline().split()))\nMI=lambda:map(int, sys.stdin.readline().split())\nSI=lambda:sys.stdin.readline().strip('\\n')\nII=lambda:int(sys.stdin.readline())\n# sys.stdin=open('input.txt')\n# sys.stdout=open('output.txt', 'w')\n# for _ in range(II()):\nn=II()\ns=SI()\nc=set(s)\nln=[0]*n\nfor d in c:\n\tlast=-1\n\t# print(d, end=' ')\n\tfor i, v in enumerate(s):\n\t\tif v==d:\n\t\t\tlast=i\n\t\tif last==-1:\n\t\t\tln[i]=int(1e9)\n\t\telse:\n\t\t\tln[i]=max(ln[i], i-last+1)\n\t# print(ln)\nprint(min(ln))", "\"\"\"\r\nhttps://codeforces.com/contest/701/problem/C\r\n7\r\nbcAAcbc should output 3\r\n6\r\naaBCCe should output 5\r\n\"\"\"\r\nflat_num = int(input())\r\nflats = input()\r\ntypes = set(flats)\r\n\r\nlo = 0\r\nhi = flat_num\r\nvalid = -1\r\nwhile lo <= hi:\r\n mid = (lo + hi) // 2\r\n\r\n all_catchable = False\r\n curr_caught = {}\r\n for to_add in range(flat_num):\r\n if flats[to_add] not in curr_caught:\r\n curr_caught[flats[to_add]] = 0\r\n curr_caught[flats[to_add]] += 1\r\n\r\n if to_add >= mid:\r\n to_remove = flats[to_add - mid]\r\n curr_caught[to_remove] -= 1\r\n if curr_caught[to_remove] == 0:\r\n del curr_caught[to_remove]\r\n\r\n if len(curr_caught) == len(types):\r\n all_catchable = True\r\n break\r\n\r\n if all_catchable:\r\n valid = mid\r\n hi = mid - 1\r\n else:\r\n lo = mid + 1\r\nprint(valid)\r\n", "n = int(input())\r\ns = [c for c in input()]\r\nuniq = set(s)\r\nn_uniq = len(uniq)\r\n\r\ndef check(l):\r\n if l < n_uniq:\r\n return False\r\n d = {}\r\n uniq_counter = 0\r\n for j in range(l):\r\n if s[j] not in d or d[s[j]]==0:\r\n d[s[j]]=1\r\n uniq_counter+=1\r\n else:\r\n d[s[j]]+=1\r\n if uniq_counter==n_uniq:\r\n return True\r\n for i in range(1,n-l+1):\r\n to_remove = s[i-1]\r\n to_add = s[i+l-1]\r\n if to_remove != to_add:\r\n d[to_remove]-=1\r\n if d[to_remove]==0:\r\n uniq_counter-=1\r\n if to_add not in d or d[to_add] == 0:\r\n d[to_add] = 1\r\n uniq_counter += 1\r\n else:\r\n d[to_add] += 1\r\n if uniq_counter == n_uniq:\r\n return True\r\n return False\r\n\r\nhigh = n\r\nlow = 0\r\nwhile low<high:\r\n mid = (high+low)//2\r\n if check(mid):\r\n high = mid\r\n else:\r\n low = mid+1\r\nprint(low)", "\r\nM = {}\r\n\r\nN = int(input())\r\nS = input().strip()\r\n\r\ns = set()\r\nfor c in S:\r\n s.add(c)\r\n M[c] = 0\r\n\r\ni = 0; j = -1; aux = 0; ans = 1e10\r\nwhile j < N - 1:\r\n j += 1\r\n\r\n M[S[j]] += 1\r\n if M[S[j]] == 1:\r\n aux += 1\r\n while M[S[i]] > 1:\r\n M[S[i]] -= 1\r\n i += 1\r\n\r\n if aux == len(s):\r\n ans = min(ans, j - i + 1)\r\n\r\nprint(ans)\r\n", "# love thy neighbour\r\nfrom sys import stdin,stdout\r\ndef ArrayIn():return list(map(int,input().split()))\r\ndef print(x):stdout.write(f'{x}\\n')\r\n\r\nfrom collections import defaultdict\r\nn=int(input())\r\na=input()\r\n\r\nboundary=len(set(a))\r\nfreq=defaultdict(int)\r\n\r\nl=0\r\ncurr, ans=0, n\r\nfor r in range(n):\r\n freq[ a[r] ]+=1\r\n # If the animal is unique then we increment.\r\n if freq[ a[r] ]==1:curr+=1\r\n # When curr is equal to the boundary we have\r\n # all unique elements in the list.\r\n while curr==boundary:\r\n ans=min(ans,r-l+1)\r\n # slide left boundary\r\n freq[ a[l] ] -=1\r\n # If by sliding the left boundary we no\r\n # longer have all animals then (curr-=1) means loop will stop\r\n if freq[ a[l] ]==0:curr-=1\r\n l+=1\r\n \r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nfrom collections import defaultdict\r\n\r\ndef judge(x):\r\n d = defaultdict(int)\r\n cnt = 0\r\n \r\n for i in range(x):\r\n if d[S[i]]==0:\r\n cnt += 1\r\n \r\n d[S[i]] += 1\r\n \r\n if cnt==c:\r\n return True\r\n \r\n for i in range(x, n):\r\n if d[S[i-x]]==1:\r\n cnt -= 1\r\n \r\n d[S[i-x]] -= 1\r\n \r\n if d[S[i]]==0:\r\n cnt += 1\r\n \r\n d[S[i]] += 1\r\n \r\n if cnt==c:\r\n return True\r\n \r\n return False\r\n \r\ndef binary_search():\r\n l, r = 1, n\r\n \r\n while l<=r:\r\n mid = (l+r)//2\r\n \r\n if judge(mid):\r\n r = mid-1\r\n else:\r\n l = mid+1\r\n \r\n return l\r\n\r\nn = int(input())\r\nS = input()[:-1]\r\nc = len(set(list(S)))\r\n\r\nprint(binary_search())", "N = int(input())\r\ns = input()\r\n# find number of unique characters\r\nunique = set()\r\nfor i in range(N):\r\n unique.add(s[i])\r\nuLength = len(unique)\r\n# print(unique)\r\ndef check(x):\r\n if x < uLength:\r\n return False\r\n possible = dict()\r\n for i in range(x):\r\n if s[i] not in possible:\r\n possible[s[i]] = 1\r\n else:\r\n possible[s[i]] += 1\r\n if len(possible) == uLength:\r\n return True\r\n for i in range(x,N):\r\n if s[i] not in possible:\r\n possible[s[i]] = 1\r\n else:\r\n possible[s[i]] += 1\r\n possible[s[i-x]] -= 1\r\n if possible[s[i-x]] == 0:\r\n del possible[s[i-x]]\r\n if len(possible) == uLength:\r\n return True\r\n return False\r\nL = 0\r\nR = N\r\nans = 0\r\nwhile L <= R:\r\n mid = (L + R) // 2\r\n if check(mid):\r\n ans = mid\r\n R = mid - 1\r\n else:\r\n L = mid + 1\r\nprint(ans)", "from collections import Counter\r\n\r\nn = int(input())\r\ns = input()\r\n\r\nsset = set(s)\r\nccount = Counter(s[0])\r\n\r\np1 = 0\r\np2 = 0\r\nmin_len = float('inf')\r\n\r\nwhile p1 < n and p2 < n:\r\n # print(p1, p2)\r\n # print(\"1: \", ccount, \"2: \", sset)\r\n\r\n if set(ccount) == sset:\r\n min_len = min(min_len, p2 - p1 + 1)\r\n \r\n ccount.subtract(s[p1])\r\n if ccount[s[p1]] == 0:\r\n del ccount[s[p1]]\r\n\r\n p1 += 1\r\n # if p1 == p2:\r\n # print(\"NO\")\r\n \r\n elif p2 + 1 < n:\r\n p2 += 1\r\n ccount.update(s[p2])\r\n # print(s[p2])\r\n\r\n else:\r\n break\r\n\r\nprint(min_len if min_len != float('inf') else -1)\r\n\r\n", "n = int(input())\r\ns = input()\r\nwant = len(set(s))\r\nd = {}\r\nj = 0\r\ncount = 0\r\nans = float(\"inf\")\r\nfor i in range(n):\r\n if s[i] not in d:\r\n d[s[i]] = 0\r\n count+=1\r\n d[s[i]]+=1\r\n if count==want:\r\n while d[s[j]]>1:\r\n d[s[j]]-=1\r\n j+=1\r\n ans = min(ans,i-j+1)\r\nprint(ans)", "from collections import defaultdict\r\n\r\ndi = defaultdict(int)\r\nn = int(input())\r\ns = input()\r\ncn = len(set(s))\r\nco = 0\r\ndef ad(a):\r\n global co,di\r\n if(di[s[a]] == 0):\r\n co += 1\r\n di[s[a]] += 1\r\n return\r\ndef re(a):\r\n global co,di\r\n di[s[a]] -= 1\r\n if(di[s[a]] == 0):\r\n co -= 1\r\n return\r\n\r\nad(0)\r\npo = 0\r\nma = n\r\nfor i in range(n):\r\n while(co < cn):\r\n if(po == n-1):\r\n break\r\n po += 1\r\n ad(po)\r\n if(co == cn):\r\n ma = min(ma,po - i + 1)\r\n re(i)\r\nprint(ma)", "# Write your code here :-)\n# They Are Everywhere\nfrom collections import Counter\n\nn = int(input())\ns = input()\nc = Counter(s)\ntotal = len(c)\ncur = Counter()\ni = j = 0\nans = n\nwhile True:\n if len(cur) < total:\n if j >= n:\n break\n cur[s[j]] += 1\n j += 1\n else:\n ans = min(j - i, ans)\n cur[s[i]] -= 1\n cur = +cur\n i += 1\nprint(ans)\n", "def check(x):\r\n num = {}\r\n d = {}\r\n for i in st:\r\n num[i] = 0\r\n d[i] = 1\r\n m = len(num.values())\r\n for j in range(x):\r\n num[st[j]] += 1\r\n d[st[j]] = 0\r\n i = x\r\n j = 0\r\n if sum(d.values()) == 0:\r\n return True\r\n while i < n:\r\n num[st[j]] -= 1\r\n if num[st[j]] <= 0:\r\n d[st[j]] = 1\r\n num[st[i]] += 1\r\n d[st[i]] = 0\r\n if sum(d.values()) == 0:\r\n return True \r\n i += 1\r\n j += 1\r\n return False\r\n\r\ndef binary(p, q):\r\n if p >= q:\r\n return p\r\n mid = (p + q) // 2\r\n if check(mid):\r\n return binary(p, mid - 1)\r\n else:\r\n return binary(mid + 1, q)\r\n\r\nn = int(input())\r\nst = input()\r\nans = binary(1, n)\r\nprint(ans if check(ans) else ans + 1)\r\n\r\n\r\n", "from collections import defaultdict\r\ndef f(s):\r\n\tres=len(set(s))\r\n\tans=len(s)\r\n\tl=0\r\n\tg=defaultdict(int)\r\n\tfor i in range(len(s)):\r\n\t\thi=i\r\n\t\tg[s[hi]]+=1\r\n\t\tif len(g)==res:\r\n\t\t\tans=min(ans,hi-l+1)\r\n\t\t\twhile l<hi:\r\n\t\t\t\tif g[s[l]]>=2:\r\n\t\t\t\t\tg[s[l]]-=1\r\n\t\t\t\t\tl+=1\r\n\t\t\t\telse:\r\n\t\t\t\t\tbreak\r\n\t\t\tans=min(ans,hi-l+1)\r\n\treturn ans\r\n\r\nn=input()\r\nn=input()\r\nprint(f(n))", "from collections import defaultdict\r\nn = int(input())\r\ns = input()\r\nshorter = set(s)\r\n\r\nadded = set()\r\nl = r = 0\r\ncount = defaultdict(int)\r\nans = float(\"inf\")\r\ndef check():\r\n for i in shorter:\r\n if count[i] == 0:\r\n return False\r\n return True\r\nwhile r < n:\r\n count[s[r]] += 1\r\n while l < r and s[l] == s[r]:\r\n count[s[l]] -= 1\r\n l += 1\r\n while l <= r and check():\r\n ans = min(ans, r - l + 1)\r\n count[s[l]] -= 1\r\n l += 1\r\n r += 1\r\n \r\nprint(ans)\r\n ", "def check2():\r\n global e\r\n if 0 in e:\r\n return False\r\n return True\r\n\r\n\r\ndef check(k):\r\n global a, e\r\n for i in range(k):\r\n e[a[i]] += 1\r\n if check2():\r\n return True\r\n for i in range(1, n - k + 1):\r\n e[a[i - 1]] -= 1\r\n e[a[i + k - 1]] += 1\r\n if check2(): \r\n return True\r\n return False\r\n\r\n\r\ndef lbp(n, index):\r\n global e\r\n left = 1\r\n right = n\r\n while right - left > 1:\r\n mid = (right + left) // 2\r\n e = [0] * (index)\r\n if check(mid):\r\n right = mid\r\n else:\r\n left = mid\r\n e = [0] * (index)\r\n if check(left): return left\r\n return right\r\n\r\nn = int(input())\r\ns = str(input())\r\na = []\r\nsl = {}\r\nindex = 0\r\nfor i in s:\r\n try:\r\n if sl[i]:\r\n pass\r\n except BaseException:\r\n sl.update({i:index})\r\n index += 1\r\n a.append(sl[i])\r\ne = []\r\nprint(lbp(n, index))", "import sys\r\nimport math\r\nfrom bisect import bisect_right as br\r\n\r\nfrom statistics import mode\r\n\r\nfrom itertools import combinations as cb\r\n\r\ndef int_arr(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef str_arr(): return list(map(str, sys.stdin.readline().strip().split()))\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\n#sys.stdout =open('They Are Everywhere/output.txt', 'w')\r\n#sys.stdin = open('They Are Everywhere/input.txt', 'r')\r\n\r\nn=int(input())\r\nst=input()\r\n\r\ndict={}\r\n\r\ntot=len(set(st))\r\nans=float(\"inf\")\r\ncnt=0\r\n\r\nj=0\r\nfor i in range(n):\r\n if dict.get(st[i],None)==None:\r\n dict[st[i]]=1\r\n cnt+=1\r\n else:\r\n dict[st[i]]+=1\r\n\r\n if cnt==tot:\r\n while dict[st[j]]>1:\r\n dict[st[j]]-=1\r\n j+=1\r\n \r\n ans=min(ans,i-j+1)\r\n\r\nprint(ans)\r\n \r\n\r\n\r\n", "n=int(input())\r\ns=input()\r\nse=set()\r\nd=dict()\r\nk=0\r\nfor i in s:\r\n if i not in se:\r\n se.add(i)\r\n k+=1\r\n d[i]=0\r\nqueue=[]\r\nmi=100000000000\r\ncnt=0\r\nfor i in range(n):\r\n if d[s[i]]==0:\r\n cnt+=1\r\n d[s[i]]+=1\r\n queue.append(i)\r\n while cnt==k:\r\n temp=i-queue[0]+1\r\n mi=min(mi,temp)\r\n x=queue.pop(0)\r\n d[s[x]]-=1\r\n if d[s[x]]==0:\r\n cnt-=1\r\nprint(mi)\r\n", "import sys\r\nfrom math import sqrt, gcd, factorial, ceil, floor, pi, inf\r\nfrom collections import deque, Counter, OrderedDict\r\nfrom heapq import heapify, heappush, heappop\r\n#sys.setrecursionlimit(10**5)\r\n\r\n#======================================================#\r\ninput = lambda: sys.stdin.readline()\r\nI = lambda: int(input().strip())\r\nS = lambda: input().strip()\r\nM = lambda: map(int,input().strip().split())\r\nL = lambda: list(map(int,input().strip().split()))\r\n#======================================================#\r\n\r\n#======================================================#\r\ndef primelist():\r\n L = [False for i in range(10**9)]\r\n primes = [False for i in range(10**9)]\r\n for i in range(2,10**9):\r\n if not L[i]:\r\n primes[i]=True\r\n for j in range(i,10**9,i):\r\n L[j]=True\r\n return primes\r\ndef isPrime(n):\r\n p = primelist()\r\n return p[n]\r\n#======================================================#\r\ndef bst(arr,x):\r\n low,high = 0,len(arr)-1\r\n ans = -1\r\n while low<=high:\r\n mid = (low+high)//2\r\n if arr[mid]==x:\r\n return mid\r\n elif arr[mid]<x:\r\n ans = mid\r\n low = mid+1\r\n else:\r\n high = mid-1\r\n return ans\r\n#======================================================#\r\n\r\nn = I()\r\ns = S()\r\nd = {}\r\nfor i in s:\r\n if i not in d.keys():\r\n d[i]=0\r\nt=0\r\nk=len(d)\r\nans = inf\r\ni,j=0,0\r\nf=False\r\nwhile i<n:\r\n while t<k:\r\n if j==n:\r\n f=True\r\n break\r\n d[s[j]]+=1\r\n if d[s[j]]==1:\r\n t+=1\r\n j+=1\r\n if f:\r\n break\r\n ans = min(ans,j-i)\r\n i+=1\r\n if i==n:\r\n break\r\n d[s[i-1]]-=1\r\n if d[s[i-1]]==0:\r\n t-=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", "n = int(input())\r\n\r\ns = input()\r\nalles = {}\r\nl, r, c, ans, le = 0, 0, 0, float(\"+inf\"), len(set(s))\r\n\r\nfor i in s:\r\n if i not in alles:\r\n alles[i] = 0\r\n c += 1\r\n alles[i] += 1\r\n if c == le:\r\n while alles[s[l]] > 1:\r\n alles[s[l]] -= 1\r\n l += 1\r\n ans = min(ans, r-l+1)\r\n r += 1\r\nprint(ans)\r\n", "ln = int(input())\r\ns = input()\r\nwan = len(set(s))\r\n\r\ndef valid(mid,s,wan,ln):\r\n l,r = 0,0\r\n freq = [0]*(127)\r\n n = 0\r\n if mid>ln:\r\n return 0\r\n while r<ln:\r\n while r<ln and r<mid:\r\n if freq[ord(s[r])]==0:\r\n n+=1\r\n freq[ord(s[r])]+=1\r\n r+=1\r\n if n==wan:\r\n return 1\r\n if r==ln:\r\n return 0\r\n freq[ord(s[l])]-=1\r\n if freq[ord(s[l])]==0:\r\n n-=1\r\n freq[ord(s[r])]+=1\r\n if freq[ord(s[r])]==1:\r\n n+=1\r\n if n==wan:\r\n return 1\r\n l+=1\r\n r+=1\r\n else:\r\n return 0\r\nl,r = 1,ln\r\nposs = ln\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n if valid(mid,s,wan,ln):\r\n poss = mid\r\n r = mid-1\r\n else:\r\n l = mid+1\r\nprint(poss)", "d={}\nn=int(input())\ns=list(input())\nz=set(s)\nzl=len(z)\nm=10e10\nj=0\nfor i in range(n):\n\td[s[i]]=d.get(s[i],0)+1\n\t\n\tif len(d)==zl:\n\t\twhile j<n:\n\t\t\tm=min(m,i-j+1)\n\t\t\td[s[j]]-=1\n\t\t\t\n\t\t\tif d[s[j]]==0:\n\t\t\t\tdel d[s[j]]\n\t\t\t\tj+=1\n\t\t\t\tbreak\n\t\t\tj+=1\n\nprint(m)\n \t\t \t \t\t \t\t \t\t\t\t \t \t", "n = int(input())\r\ns = list(input())\r\ntypes = len(set(s))\r\n\r\ndef check(l) :\r\n mp = dict()\r\n for i in range(l):\r\n if s[i] not in mp :\r\n mp[s[i]]=1\r\n else :\r\n mp[s[i]]+=1\r\n\r\n if len(mp) == types :\r\n return True\r\n \r\n for i in range(l,n) :\r\n mp[s[i-l]]-=1\r\n if mp[s[i-l]] is 0 : \r\n mp.pop(s[i-l])\r\n\r\n if s[i] not in mp :\r\n mp[s[i]]=1\r\n else :\r\n mp[s[i]]+=1\r\n \r\n if len(mp) == types :\r\n return True\r\n\r\n return False\r\n\r\nl,r = 1 , n\r\n\r\nwhile l < r : \r\n mid = (l+r)//2\r\n if check(mid) :\r\n r = mid\r\n else :\r\n l = mid + 1\r\n\r\nprint(r)", "from collections import defaultdict\r\nn=int(input())\r\ns=list(input())\r\ni=0\r\nk=len(set(s))\r\nd=defaultdict(lambda:0)\r\ncnt=0;res=n;iif=0\r\nfor j in range(n):\r\n d[s[j]]+=1\r\n if d[s[j]]==1:\r\n cnt+=1\r\n iif=0\r\n while cnt>=k:\r\n d[s[i]]-=1\r\n if d[s[i]]==0:\r\n cnt-=1\r\n i+=1\r\n iif=1\r\n if iif==1:\r\n i-=1\r\n d[s[i]]+=1\r\n if d[s[i]]==1:\r\n cnt+=1\r\n if cnt==k:\r\n res=min(res,j-i+1)\r\nprint(res)", "from collections import defaultdict\r\n\r\n\r\ndef solve(n, s):\r\n unique = set(s)\r\n match = 0\r\n need = {}\r\n window = defaultdict(int)\r\n for i in unique:\r\n need[i] = 1\r\n \r\n left , right, res = 0, 0, len(s)\r\n while right < len(s):\r\n curr = s[right]\r\n if curr in need:\r\n window[curr] +=1\r\n if window[curr] == need[curr]:\r\n match +=1\r\n while match == len(unique):\r\n currl = s[left]\r\n res = min(res, right - left + 1)\r\n window[currl] -=1\r\n if window[currl] == 0:\r\n del window[currl]\r\n match -=1\r\n left +=1\r\n right +=1\r\n return res\r\n \r\n \r\nn = int(input())\r\ns = input()\r\nprint(solve(n, s))", "from collections import defaultdict\r\nn = int(input())\r\narr = list(input())\r\n\r\nc = len(set(arr))\r\nans = float('inf')\r\nj = 0\r\nd = defaultdict(int)\r\n\r\nfor i in range(n):\r\n while j < n:\r\n if len(d) == c:\r\n ans = min(ans, abs(i-j+1))\r\n break\r\n else:\r\n d[arr[j]] += 1\r\n j += 1\r\n if len(d) == c:\r\n ans = min(ans, abs(i-j+1))\r\n d[arr[i]] -= 1\r\n if not d[arr[i]]:\r\n d.pop(arr[i])\r\n\r\nprint(ans+1)\r\n ", "from collections import Counter\r\nn,s=int(input()),input()\r\nreq=len(set(s))\r\ncurr=Counter()\r\nres=n\r\nfor i in range(n):\r\n curr[s[i]]=i\r\n if len(curr)==req:\r\n res=min(res,max(curr.values())-min(curr.values())+1)\r\nprint(res)", "from collections import defaultdict\r\nimport bisect\r\nn=int(input())\r\ns=input()\r\nx=set(s)\r\nif len(x)==1:\r\n print(1)\r\nelse:\r\n ind=defaultdict(list)\r\n for i in range(n):\r\n ind[s[i]].append(i)\r\n i=0\r\n j=0\r\n while x:\r\n x.discard(s[j])\r\n j=j+1\r\n j=j-1\r\n ans=n\r\n while j<n:\r\n f=0\r\n t=''\r\n for ch in ind:\r\n l=bisect.bisect_left(ind[ch],i)\r\n r=bisect.bisect_right(ind[ch],j)\r\n if r-l==0:\r\n f=1\r\n t=ch\r\n break\r\n if f:\r\n while s[j]!=t:\r\n j=j+1\r\n if j==n:\r\n break\r\n if j==n:\r\n break\r\n else:\r\n ans=min(ans,j-i+1)\r\n i=i+1\r\n else:\r\n ans=min(ans,j-i+1)\r\n i=i+1\r\n print(ans) " ]

[ "n=int(input())\r\nwhile n%3==0:\r\n n//=3\r\nprint((n-1)//3+1)", "n = int(input())\r\n\r\na = 1\r\n\r\nwhile n % a == 0:\r\n a *= 3\r\n\r\nprint ((n - 1) // a + 1)\r\n", "base,n=1,int(input())\r\nwhile(n%base==0):base*=3\r\nprint(n//base+1)", "from fractions import Decimal\nimport math\nn=Decimal(input())\n\nd=Decimal('1')\n\nwhile(n%d==0):\n d*=3\n\n\nif(d>n):\n print(1)\n\nelse:\n print(math.ceil(n/d))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nfor i in range(50000):\r\n if n % (3**i) == 0:\r\n continue\r\n else:\r\n print(n//(3**i)+1)\r\n break", "n = int(input())\r\n\r\nm = 3\r\nwhile n % m == 0:\r\n m *= 3\r\n\r\nprint(int(n // m + 1))\r\n", "#!/usr/bin/env python3\nn = int(input())\nwhile n % 3 == 0:\n n = n // 3\nprint(n // 3 + 1)\n", "t = int(input())\r\np = 1\r\nwhile t%p == 0:\r\n p = p*3\r\n\r\nprint(t//p + 1)", "n=int(input())\r\nr=3\r\nwhile(1):\r\n if(n%r):\r\n print((n-1)//r+1)\r\n break\r\n else:\r\n r*=3\r\n \r\n \r\n", "k = 1\r\nn = int(input())\r\nwhile n%k==0:\r\n k*=3\r\nprint(n//k+1)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\n\r\nwhile n%3 == 0: n //= 3\r\nprint(n//3+1)", "n = int(input())\r\nnow = 1\r\nwhile n % now == 0:\r\n now*=3\r\nprint(n//now + 1)", "import math\r\n\r\ndef solve():\r\n n = int(input())\r\n p = 1\r\n while n % p == 0:\r\n p *= 3\r\n print((n + p - 1) // p)\r\n\r\nsolve()\r\n", "def readln(): return tuple(map(int, input().split()))\n\nn, = readln()\np3 = []\nt = n\nwhile t:\n p3.append(t % 3)\n t //= 3\nfor i in range(len(p3)):\n if p3[i]:\n p3[i] -= 1\n tmp = 1 + sum([v * 3 ** j for j, v in enumerate(p3[i + 1:])])\n while p3[i] and 3**i * (p3[i] - 1) + 3**(i + 1) * tmp > n:\n p3[i] -= 1\n print(max(1, p3[i] + tmp))\n break\n", "n = int(input())\r\nk = 1\r\n\r\nwhile n % k == 0: \r\n k *= 3\r\nprint (n // k + 1)", "n = int(input())\r\ncoin = 1\r\nwhile n % coin == 0:\r\n coin = coin * 3\r\nprint((n//coin) + 1)", "n=int(input())\r\nwhile n%3==0:\r\n n//=3\r\n\r\nif n%3==0:\r\n print(1)\r\nelse:\r\n print(n//3+1)", "import sys\nfrom math import *\nfrom fractions import gcd\nreadints=lambda:map(int, input().strip('\\n').split())\n\n\nn=int(input())\n\nb=1\nans=1\n\nwhile b<n:\n if n%b != 0:\n ans = max(ans, n//b + 1)\n b *= 3\nprint(ans)\n", "n = int(input())\nk = 1\nwhile not n % k:\n\tk *= 3\nprint(n // k + 1)\n", "i = int(input())\n\nk = 1\nwhile i % k == 0:\n\tk = k * 3\n\nprint(i // k + 1)\n\n", "n = int(input())\nc = 0\nwhile not n % 3:\n n //= 3\nprint((n+2)//3)", "import math\r\n\r\nn = int(input())\r\nk = 1\r\nwhile n % k == 0:\r\n k *= 3\r\n\r\nprint(n // k + 1)", "import math\r\nn = int(input())\r\na=1\r\nwhile n%a==0:\r\n a*=3\r\nprint(n//a +1) \r\n", "n = int(input())\nk = 1\n\nwhile n % k == 0:\n k *= 3\nprint(n // k + 1)\n", "n=int(input())\n\nif(n%3==0):\n x=9\n while(n%x==0):\n x*=3\n print(n//x+1)\nelse:\n print(n//3+1)\n", "n = int(input())\n\na = 1\n\nwhile n % a == 0:\n a *= 3\n\nprint ((n - 1) // a + 1)\n", "#-------------------------------------------------------------------------------\r\n# Name: Codeforces\r\n# Author: Gogol\r\n#-------------------------------------------------------------------------------\r\nimport sys\r\nfrom math import *\r\n\r\ndef solve():\r\n n = int(input())\r\n p = 1\r\n while (n % p == 0):\r\n p*=3\r\n print(n//p+1)\r\nsolve()\r\n", "n = (int)(input())\r\n\r\nwhile n%3 == 0:\r\n n = n//3\r\n\r\nn = n // 3\r\nprint (n+1)\r\n", "from math import ceil\r\nfrom decimal import Decimal\r\nn = Decimal(input())\r\na = Decimal(1)\r\nwhile (n % a == 0):\r\n a *= 3\r\nprint(ceil(n / a))\r\n\r\n", "n = int (input ())\na = 3\nwhile (n % a == 0): a *= 3\nprint (n//a + 1)\n", "from math import ceil\r\ndef seal(a, b):\r\n return (a + b - 1) // b\r\nn = int(input())\r\ni = 0\r\nwhile(n % pow(3,i) == 0):\r\n i+=1\r\nprint(seal(n, pow(3,i)))\r\n", "def main():\r\n n = int(input())\r\n while n % 3 == 0:\r\n n //= 3\r\n\r\n print(n // 3 + 1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\na=1\r\nwhile n%a==0:\r\n a*=3\r\nprint(n//a+1)", "n = int(input())\r\np = 1\r\nwhile n % p == 0: p *= 3\r\nprint(n//p + 1)\r\n", "n = int(input())\r\nx = 1\r\nwhile True:\r\n l = 0\r\n r = 10 ** 18\r\n while r > l + 1:\r\n m = (l + r) // 2\r\n if x * m < n:\r\n l = m\r\n else:\r\n r = m\r\n if r * x > n:\r\n print(r)\r\n exit(0)\r\n x *= 3", "n =int( input())\r\nwhile not n%3:\r\n n//=3\r\n \r\nprint(n//3+1)", "n, k = int(input()), 3\r\nwhile n % k == 0: k *= 3\r\nprint(n // k + 1)", "import math, decimal\r\n\r\nn = int(input())\r\nk = 0\r\nwhile n % 3**k == 0:\r\n k += 1\r\n\r\nD = decimal.Decimal\r\nprint(math.ceil(D(n) / D(3**k)))", "\r\ndef solve():\r\n n = int(input())\r\n a = 1\r\n while (n % a) == 0:\r\n a *= 3\r\n print((n//a) + 1)\r\n\r\n\r\nsolve()\r\n", "n,a=int(input()),1\r\nwhile n%a==0:a*=3\r\nprint(n//a+1)", "n = int(input())\nt = 1\nwhile n % t == 0:\n t *= 3\nprint(n // t + 1)\n\n", "n, f = int(input()), 3\r\nwhile n % f == 0:\r\n f *= 3\r\nprint(n // f + 1)", "def main():\n n, p = int(input()), 3\n while not n % p:\n p *= 3\n print(n // p + 1)\n\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nt = 3\r\nwhile n % t == 0:\r\n t *= 3\r\nprint(n // t + 1)\r\n" ]

[ "# https://codeforces.com/problemset/problem/912/D\r\nimport heapq\r\nfrom heapq import heappush as push\r\nfrom heapq import heappop as pop\r\n\r\nbase = 100009\r\nQ=[]\r\nused={}\r\nans=0\r\n\r\ndx = [0,0,-1,1]\r\ndy = [-1,1,0,0]\r\n\r\ndef f(x, y):\r\n x1, x2 = min(x, r-1), max(0, x-n+r)\r\n y1, y2 = min(y, r-1), max(0, y-m+r)\r\n \r\n return -(x1-x2+1)*(y1-y2+1)\r\n \r\ndef cal(i, j):\r\n return i*base+j\r\n\r\ndef get(ind):\r\n return ind//base, ind%base\r\n\r\ndef is_ok(x, y, x_, y_):\r\n if x+x_>=0 and x+x_<n and y+y_>=0 and y+y_<m:\r\n return True\r\n return False\r\n \r\nn, m, r, k = map(int, input().split()) \r\nx0, y0 = n//2, m//2 \r\nQ=[(f(x0, y0), cal(x0, y0))]\r\n\r\nwhile k > 0:\r\n val, ind = pop(Q)\r\n \r\n if ind in used:\r\n continue\r\n \r\n x, y = get(ind)\r\n used[ind]=True\r\n val = -val\r\n #print((x, y), val)\r\n ans += val\r\n for x_, y_ in zip(dx, dy):\r\n if is_ok(x, y, x_, y_):\r\n push(Q, (f(x+x_, y+y_), cal(x+x_, y+y_)))\r\n k-=1\r\n \r\nprint(ans/((n-r+1)*(m-r+1))) ", "import queue\r\nx = queue.PriorityQueue()\r\nn, m, r, k = map(int, input().split())\r\no = min(r, n - r + 1)\r\ni = min(r, m - r + 1)\r\nu = n - 2 * o + 2\r\nv = m - 2 * i + 2\r\nfor j in range(1, o + 1): x.put((-i * j, j))\r\nt = 0\r\nwhile k:\r\n y, p = x.get()\r\n x.put((y + p, p))\r\n d = min((u if p == o else 2) * (v if y == -i * p else 2), k)\r\n t -= y * d\r\n k -= d\r\nprint(t / (n - r + 1) / (m - r + 1))# 1691998039.893874", "n, m, r, k = map(int, input().split())\n\ndef count(y, x):\n minx = max(0, x-(r-1))\n maxx = min(m-1-(r-1), x)\n miny = max(0, y-(r-1))\n maxy = min(n-1-(r-1), y)\n res = (maxy-miny+1)*(maxx-minx+1)\n return res\n\n#X = [[0]*m for i in range(n)]\n#for i in range(n):\n #for j in range(m):\n #X[i][j] = count(i, j)\n #print(i, j, count(i, j))\n\n#for i in range(n):\n #print(*X[i])\n\nsy, sx = n//2, m//2\nc = count(sy, sx)\ncnt = 0\nimport heapq\nq = [(-c, sy, sx)]\nheapq.heapify(q)\nvisit = set()\nvisit.add((sy, sx))\nE = 0\nwhile q:\n c, y, x = heapq.heappop(q)\n c = -c\n E += c\n cnt += 1\n if cnt == k:\n break\n for dy, dx in (-1, 0), (1, 0), (0, -1), (0, 1):\n ny, nx = y+dy, x+dx\n if 0 <= ny < n and 0 <= nx < m:\n if (ny, nx) in visit:\n continue\n c = count(ny, nx)\n heapq.heappush(q, (-c, ny, nx))\n visit.add((ny, nx))\n\nans = E/((n-r+1)*(m-r+1))\nprint(ans)\n", "import io\r\nimport os\r\nimport queue\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\nq = queue.PriorityQueue()\r\n\r\nn, m, r, k = map(int, input().split())\r\na = min(r, n - r + 1)\r\nb = min(r, m - r + 1)\r\nh = n - 2 * a + 2\r\nw = m - 2 * b + 2\r\nfor i in range(1, a + 1):\r\n q.put((-b * i, i))\r\nt = 0\r\nwhile k:\r\n s, i = q.get()\r\n q.put((s + i, i))\r\n cnt = min((2 if i ^ a else h) * (2 if s ^ -b * i else w), k)\r\n t -= s * cnt\r\n k -= cnt\r\nprint(t / (n - r + 1) / (m - r + 1))\r\n", "import heapq\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, m, r, k = map(int, input().split())\r\nx, y = [0] * (n + 1), [0] * (m + 1)\r\nfor i in range(n - r + 1):\r\n x[i] += 1\r\n x[i + r] -= 1\r\nfor i in range(m - r + 1):\r\n y[i] += 1\r\n y[i + r] -= 1\r\nfor i in range(n):\r\n x[i + 1] += x[i]\r\nfor i in range(m):\r\n y[i + 1] += y[i]\r\ncx, cy = [0] * (r + 1), [0] * (r + 1)\r\nfor i in x[:-1]:\r\n cx[i] += 1\r\nfor i in y[:-1]:\r\n cy[i] += 1\r\nh = []\r\ns = set()\r\nmx, my = max(x), max(y)\r\ns.add((mx, my))\r\nheapq.heappush(h, (-mx * my, mx, my))\r\nans = 0\r\nwhile k:\r\n u, i, j = heapq.heappop(h)\r\n c = min(cx[i] * cy[j], k)\r\n ans -= u * c\r\n k -= c\r\n if not (i - 1, j) in s:\r\n s.add((i - 1, j))\r\n heapq.heappush(h, (-(i - 1) * j, i - 1, j))\r\n if not (i, j - 1) in s:\r\n s.add((i, j - 1))\r\n heapq.heappush(h, (-i * (j - 1), i, j - 1))\r\nans /= (n - r + 1) * (m - r + 1)\r\nprint(ans)", "import queue\r\nq = queue.PriorityQueue()\r\nn, m, r, k = map(int, input().split())\r\na = min(r, n - r + 1)\r\nb = min(r, m - r + 1)\r\nu = n - 2 * a + 2\r\nv = m - 2 * b + 2\r\nfor i in range(1, a + 1): q.put((-b * i, i))\r\nt = 0\r\nwhile k:\r\n s, i = q.get()\r\n q.put((s + i, i))\r\n d = min((u if i == a else 2) * (v if s == -b * i else 2), k)\r\n t -= s * d\r\n k -= d\r\nprint(t / (n - r + 1) / (m - r + 1))", "import heapq as hq\nn, m, r, k = map(int, input().split())\nres = 0\nnums = (n-r+1)*(m-r+1)\n\ndef ci(x, y):\n return ((min(x+r-1, n)-max(x, r)+1)*(min(y+r-1, m)-max(y, r)+1))\n\ninit_x, init_y = (n+1)//2, (m+1)//2\n\nvisit = set()\n\ndx = [1, -1, 0, 0]\ndy = [0, 0, -1, 1]\n\nqueue = [(-ci(init_x, init_y), init_x, init_y)]\nvisit.add((init_x, init_y))\n\nfor i in range(k):\n p = hq.heappop(queue)\n res -= p[0]\n for j in range(4):\n x1 = p[1]+dx[j]\n y1 = p[2]+dy[j]\n if x1 < 1 or y1 < 1 or x1 > n or y1 > m or (x1, y1) in visit:\n continue\n hq.heappush(queue, (-ci(x1, y1), x1, y1))\n visit.add((x1, y1))\n\nprint(res/nums)\n" ]

[ "n = int(input())\r\n\r\nlst = []\r\nfor x in input().split():\r\n lst.append(int(x))\r\n\r\nm = int(input())\r\npair = []\r\nfor x in range(m):\r\n (l, r) = map(int, input().split())\r\n pair.append((l, r))\r\n\r\nk = 0\r\nfor x in range(0, len(lst) - 1):\r\n for y in range(x + 1, len(lst)):\r\n if lst[y] < lst[x]: \r\n k += 1\r\n \r\nfor (l, r) in pair:\r\n if (k - (r - l + 1) // 2) % 2 == 0:\r\n print(\"even\")\r\n else:\r\n print(\"odd\")\r\n k = k - (r - l + 1) // 2\r\n", "import sys\r\nimport math\r\n#from queue import *\r\n#import random\r\n#sys.setrecursionlimit(int(1e6))\r\ninput = sys.stdin.readline\r\n \r\n############ ---- USER DEFINED INPUT FUNCTIONS ---- ############\r\ndef inp():\r\n return(int(input()))\r\ndef inara():\r\n return(list(map(int,input().split())))\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n################################################################\r\n############ ---- THE ACTUAL CODE STARTS BELOW ---- ############\r\n\r\nn=inp()\r\na=inara()\r\ninv=0\r\nfor i in range(n):\r\n\tfor j in range(i+1,n):\r\n\t\tif a[i]>a[j]:\r\n\t\t\tinv+=1\r\n\t\t\tinv%=2\r\n\r\nq=inp()\r\nfor i in range(q):\r\n\tl,r=invr()\r\n\tdiff=r-l+1\r\n\tswaps=(diff*(diff-1))//2\r\n\tswaps%=2\r\n\tinv^=swaps\r\n\tif inv:\r\n\t\tprint(\"odd\")\r\n\telse:\r\n\t\tprint(\"even\")\r\n", "n=int(input())\r\nw=[int(k) for k in input().split()]\r\nm=int(input())\r\nc=0\r\nfor i in range(n):\r\n for j in range(i+1, n):\r\n if w[i]>w[j]:\r\n c+=1\r\nc%=2\r\nfor j in range(m):\r\n l, r=[int(k) for k in input().split()]\r\n x=r-l+1\r\n if x!=1 and (x*(x-1)//2)%2:\r\n c=not c\r\n if c:\r\n print(\"odd\")\r\n else:\r\n print(\"even\")", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nc = 0\r\nfor i in range(n):\r\n ai = a[i]\r\n for j in range(i + 1, n):\r\n if ai > a[j]:\r\n c ^= 1\r\nm = int(input())\r\nx = [0] + [i // 2 % 2 ^ 1 for i in range(n + 5)]\r\nd = {0:\"even\", 1:\"odd\"}\r\nfor _ in range(m):\r\n l, r = map(int, input().split())\r\n c ^= x[r - l]\r\n ans = d[c]\r\n print(ans)", "def pflag(flag):\r\n if flag:\r\n return \"odd\"\r\n else:\r\n return \"even\"\r\n\r\nn = int(input())\r\narr = list(map(int, (input()).split()))\r\nm = int(input())\r\nflag = False\r\n\r\n#current parity\r\ncount=0\r\nfor i in range(n-1):\r\n for j in range(i+1, n):\r\n if arr[j]<arr[i]:\r\n count+=1\r\nif count%2==0:\r\n flag = False\r\nelse:\r\n flag = True\r\n#print(\"nothing\")\r\n#print(flag)\r\n\r\nnewflag = 0\r\nans=[]\r\nfor i in range(m):\r\n l,r = map(int, input().split())\r\n e = (r-l+1)*(r-l)//2\r\n if e%2 == 0:\r\n newflag = False\r\n else:\r\n newflag = True\r\n #print(\"new flag \", newflag)\r\n if flag and newflag or not flag and not newflag:\r\n flag = False #even\r\n ans.append(\"even\")\r\n else:\r\n flag = True #odd\r\n ans.append(\"odd\")\r\n\r\n #print(pflag(flag))\r\n\r\nprint(\"\\n\".join(ans))", "def is_even(l):\n k = 0\n for i in range(len(l)-1):\n for j in range(i+1, len(l)):\n if l[i] > l[j]:\n k += 1\n return (k % 2 == 0)\n\ndef f(flag):\n l, r = map(int, input().split())\n if (r - l + 1) // 2 % 2 == 0:\n return flag\n \n return not flag\n\nn = int(input())\nl = list(map(int, input().split()))\nm = int(input())\n\nflag = is_even(l)\nans = []\n\nfor i in range(m):\n flag = f(flag)\n\n ans.append('even' if flag else 'odd')\n\nprint(*ans, sep='\\n')\n\n", "def main():\r\n import sys\r\n input = sys.stdin.readline\r\n\r\n n = int(input())\r\n a = list(map(int, input().split()))\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 even = cnt % 2 == 0\r\n q = int(input())\r\n for _ in range(q):\r\n l, r = map(int, input().split())\r\n len = r - l + 1\r\n pairs = len * (len-1) // 2\r\n if pairs % 2 == 1:\r\n even = not even\r\n if even:\r\n print('even')\r\n else:\r\n print('odd')\r\n\r\n\r\nmain()", "n = int(input())\na = list(map(int, input().split()))\nm = int(input())\nparity = 0\nfor i in range(n):\n for j in range(i + 1, n):\n if a[i] > a[j]:\n parity ^= 1\nres = []\nfor _ in range(m):\n l, r = map(int, input().split())\n s = r - l + 1\n parity ^= (s * (s - 1) // 2) % 2\n res.append(\"odd\" if parity else \"even\")\nprint(\"\\n\".join(res))", "import sys\r\nf=sys.stdin\r\nn=int(f.readline())\r\na=list(map(int,f.readline().split()))\r\ninv=0\r\nfor i in range(n):\r\n for j in range(i):\r\n inv^=(a[j]>a[i])\r\nm=int(f.readline())\r\nfor _ in range(m):\r\n l,r=map(int,f.readline().split())\r\n inv^=(((r-l+1)//2)&1)\r\n print('odd' if inv else 'even')", "import sys\r\n\r\n\r\nclass BIT_RSQ(object):\r\n __slots__ = ['nodes', 'size']\r\n\r\n def __init__(self, size: int):\r\n self.nodes = [0]*(size+1)\r\n self.size = size+1\r\n\r\n def add(self, index: int, value: int):\r\n while index < self.size:\r\n self.nodes[index] += value\r\n index += index & -index\r\n\r\n def sum(self, right: int):\r\n result = 0\r\n\r\n while right:\r\n result += self.nodes[right]\r\n right -= right & -right\r\n\r\n return result\r\n\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\nm = int(sys.stdin.buffer.readline().decode('utf-8'))\r\n\r\ninv = 0\r\nbit = BIT_RSQ(n+10)\r\nfor i, x in enumerate(a, start=1):\r\n inv += bit.sum(n-x+2)\r\n bit.add(n-x+2, 1)\r\n\r\ninv &= 1\r\nres = ['even', 'odd']\r\nans = ['']*m\r\n\r\nfor i, (l, r) in enumerate(map(int, line.decode('utf-8').split()) for line in sys.stdin.buffer):\r\n inv += ((r-l+1) * (r-l) >> 1) & 1\r\n ans[i] = res[inv & 1]\r\n\r\nsys.stdout.buffer.write('\\n'.join(ans).encode('utf-8'))\r\n", "import sys\r\n\r\n\r\nclass fenwick():\r\n \"\"\"\r\n This Tree Data Structure speeds up caliculating summations of partial sum \r\n and also updating subsets of sequences. Both queries finish in logarithmic times.\r\n \"\"\"\r\n # 1-indexed\r\n\r\n def __init__(self, n):\r\n self.n = n\r\n self.data = [0]*(n+1)\r\n\r\n def to_sum(self, i):\r\n # return sigma(a_j) (0<=j<=i)\r\n s = 0\r\n while i > 0:\r\n s += self.data[i]\r\n i -= (i & -i)\r\n return s\r\n\r\n def add(self, i, x):\r\n #a_i -> a_i + x\r\n while i <= self.n:\r\n self.data[i] += x\r\n i += (i & -i)\r\n\r\n def get(self, i, j):\r\n # return sigma(a_k) (i<=k<=j)\r\n # assert 1<=i<=j<= N\r\n return self.to_sum(j)-self.to_sum(i-1)\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline()\r\n\r\n\r\nn = int(input())\r\npermutation = list(map(int, input().split()))\r\nseq = [(permutation[i], i + 1) for i in range(n)]\r\nseq.sort(reverse=True)\r\n\r\nm = int(input())\r\nquery = [tuple(map(int, input().split())) for i in range(m)]\r\n\r\n#count whole inversion\r\n\r\nWHOLE_INVERSION = 0\r\nfenwick_1 = fenwick(n)\r\n\r\nfor value, index in seq:\r\n WHOLE_INVERSION += fenwick_1.get(1, index)\r\n fenwick_1.add(index, 1)\r\n\r\nfor l, r in query:\r\n d = r - l + 1\r\n WHOLE_INVERSION += d*(d-1)//2\r\n if WHOLE_INVERSION % 2 != 0:\r\n print(\"odd\")\r\n else:\r\n print(\"even\")\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nodd = 0\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if(l[i]>l[j]): odd ^= 1\r\n \r\nm = int(input())\r\nans = []\r\nfor i in range(m):\r\n ll, r = map(int, input().split())\r\n k = r-ll+1\r\n if( (k*(k-1)/2) %2): odd ^= 1\r\n ans.append( \"odd\" if odd else \"even\")\r\n \r\nprint('\\n'.join(ans))", "from sys import stdin\r\n\r\nn = int(stdin.readline())\r\na = [int(o) for o in stdin.readline().split()]\r\n\r\ninv = len([ 1 for i in range(n) for j in range(i + 1, n) if a[i] > a[j]])\r\nans = inv % 2\r\n\r\nm = int(stdin.readline())\r\n\r\nfor i in range(m):\r\n\tline = stdin.readline().split()\r\n\tl = int(line[0])\r\n\tr = int(line[1])\r\n\r\n\tv = ((r - l + 1) * (r - l) // 2) % 2\r\n\tans ^= v\r\n\r\n\tif ans == 0:\r\n\t\tprint(\"even\")\r\n\r\n\telse: print(\"odd\")\r\n", "n = int(input())\r\nd = list(map(int, input().split()))\r\nodd = 0\r\nfor i in range(n):\r\n for j in range(i, n):\r\n if(d[i]>d[j]): odd ^= 1\r\n\r\nm = int(input())\r\nans = []\r\nfor i in range(m):\r\n l, r = map(int, input().split())\r\n k = r-l+1\r\n if( (k*(k-1)/2) %2): odd ^= 1\r\n ans.append( \"odd\" if odd else \"even\")\r\n\r\nprint('\\n'.join(ans))", "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\nres = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[i] > a[j]:\r\n res = 1-res\r\nfor _ in range(inp()):\r\n l,r = inpl(); m = r-l+1\r\n swap = m*(m-1)//2\r\n if swap%2: res = 1-res\r\n print('odd' if res else 'even')", "import sys\r\ninput=sys.stdin.readline\r\ndef getsum(BITTree,i):\r\n i=i+1\r\n s = 0\r\n while i > 0:\r\n s += BITTree[i]\r\n i -= i & (-i) \r\n return(s) \r\ndef updatebit(BITTree , n , i ,v):\r\n i=i+1\r\n while i <= n:\r\n BITTree[i] += v\r\n i += i & (-i)\r\n #print(BITTree)\r\nn=int(input())\r\nlista=[int(i) for i in input().split()]\r\ninvercount=0\r\nbitTree=[0]*(n+2)\r\nfor k in reversed(lista):\r\n updatebit(bitTree,n+1,k,1)\r\n counter=getsum(bitTree,k-1)\r\n invercount+=counter\r\nm=int(input())\r\nfor i in range(m):\r\n l,r=map(int,input().split())\r\n summa=((r-l+1)*(r-l))/2\r\n if (invercount+summa)%2:\r\n print('odd')\r\n invercount=1\r\n else:\r\n print('even')\r\n invercount=0\r\n \r\n", "from collections import Counter\r\nfrom math import *\r\nimport sys\r\nmod=1000000007\r\n\r\ndef pro(arr,q):\r\n n=len(arr)\r\n ans=0\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if(arr[i]>arr[j]):\r\n ans+=1\r\n \r\n res=ans%2\r\n for x,y in q:\r\n k= y-x + 1\r\n k=k//2\r\n k=k%2\r\n res= k^res\r\n if(res):\r\n print('odd')\r\n else:\r\n print('even')\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\nt=int(input())\r\nque=[]\r\nfor i in range(t):\r\n que.append(list(map(int,input().split())))\r\npro(arr,que)", "from sys import stdin, stdout\r\ninput, print = stdin.readline, stdout.write\r\n\r\nn = int(input())\r\na = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n ans += int(a[i] > a[j])\r\nans %= 2\r\nq = int(input())\r\nfor i in range(q):\r\n l, r = [int(i) for i in input().split()]\r\n ans ^= (r - l) * (r - l + 1) // 2 % 2\r\n print(\"odd\\n\" if ans else \"even\\n\")", "def arr_inp():\r\n return [int(x) for x in stdin.readline().split()]\r\n\r\n\r\ndef nCr(n, r):\r\n f, m = factorial, 1\r\n for i in range(n, n - r, -1):\r\n m *= i\r\n return int(m // f(r))\r\n\r\n\r\nfrom math import factorial\r\nfrom sys import stdin\r\n\r\nn, a, ans, tem = int(input()), arr_inp(), [], 0\r\nmem = [0] * (n + 1)\r\n\r\nfor i in range(n):\r\n for j in range(a[i] - 1, 0, -1):\r\n if not mem[j]:\r\n tem += 1\r\n mem[a[i]] = 1\r\n\r\nfor i in range(int(input())):\r\n l, r = arr_inp()\r\n tem += nCr(r - l + 1, 2)\r\n ans.append('odd' if tem % 2 else 'even')\r\n\r\nprint('\\n'.join(ans))\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\nparity = 0\r\nfor i in range(n):\r\n for j in range(i+1,n):\r\n if a[j] < a[i]:\r\n parity ^= 1\r\n\r\nm = int(input())\r\nfor i in range(m):\r\n l,r = map(int,input().split())\r\n\r\n dist = (r-l+1)\r\n pairs = (dist-1)*(dist)//2\r\n\r\n if pairs & 1:\r\n parity ^= 1\r\n\r\n if parity:\r\n print(\"odd\")\r\n else:\r\n print(\"even\")", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nvalues = list(map(int, stdin.readline().split()))\r\n\r\ncnt = 0\r\nfor i in range(n):\r\n for j in range(i + 1, n):\r\n if values[i] > values[j]:\r\n cnt += 1\r\n\r\nm = int(stdin.readline())\r\nfor i in range(m):\r\n l, r = map(int, stdin.readline().split())\r\n n = r - l + 1\r\n \r\n cnt += n * (n - 1) // 2\r\n cnt &= 1\r\n \r\n if cnt == 1:\r\n stdout.write('odd\\n')\r\n else:\r\n stdout.write('even\\n')", "import sys\r\nreadline = sys.stdin.readline\r\n\r\nN = int(readline())\r\nA = list(map(int, readline().split()))\r\nQ = int(readline())\r\n\r\ncnt = 0\r\nfor 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\r\ncnt %= 2\r\n\r\nAns = [None]*Q\r\nfor qu in range(Q):\r\n l, r = map(int, readline().split())\r\n if (r-l+1)*(r-l)//2 & 1:\r\n cnt ^= 1\r\n \r\n Ans[qu] = 'odd' if cnt else 'even'\r\n\r\nprint('\\n'.join(Ans))" ]

[ "import sys\nimport math\n# Fast input\ninput = sys.stdin.readline\n# Fast output\ndef print(*args, **kwargs):\n sep = kwargs.get('sep', ' ')\n end = kwargs.get('end', '\\n')\n file = kwargs.get('file', sys.stdout)\n flush = kwargs.get('flush', False)\n output = sep.join(map(str, args)) + end\n file.write(output)\n if flush:\n file.flush()\nn,m,k,q=map(int,input().split())\nl=[]\nfor i in range(n):\n p=[10**9+1]*m\n l.append(p)\nfor j in range(q):\n a,b,c=map(int,input().split())\n l[a-1][b-1]=c\nq=[]\nfor i in range(n):\n p=[]\n for j in range(m-k+1):\n p.append(max(l[i][j:j+k]))\n q.append(p)\n\nr=[]\nfor i in range(m-k+1):\n for j in range(n-k+1):\n w=0\n for a in range(k):\n w=max(w,q[j+a][i])\n r.append(w)\n\nif min(r)==10**9+1:\n print(-1)\nelse:\n print(min(r))\n\n \t\t \t \t \t\t\t\t \t \t \t \t \t", "import sys\r\nreadline=sys.stdin.readline\r\n\r\nclass Cumsum2:\r\n def __init__(self,lst):\r\n self.H=len(lst)\r\n self.W=len(lst[0]) if lst else 0\r\n self.cumsum2=[[0]*(self.W+1) for i in range(self.H+1)]\r\n for i in range(1,self.H+1):\r\n for j in range(1,self.W+1):\r\n self.cumsum2[i][j]=lst[i-1][j-1]\r\n for i in range(self.H+1):\r\n for j in range(1,self.W+1):\r\n self.cumsum2[i][j]+=self.cumsum2[i][j-1]\r\n for i in range(1,self.H+1):\r\n for j in range(self.W+1):\r\n self.cumsum2[i][j]+=self.cumsum2[i-1][j]\r\n\r\n def __getitem__(self,tpl):\r\n ab,cd=tpl\r\n def make_slice(ij,N):\r\n if type(ij)==int:\r\n i,j=ij,ij+1\r\n else:\r\n i,j=ij.start,ij.stop\r\n if i==None or i<-N:\r\n i=0\r\n elif N<=i:\r\n i=N\r\n elif i<0:\r\n i+=N\r\n if j==None or N<=j:\r\n j=N\r\n elif j<-N:\r\n j=0\r\n elif j<0:\r\n j+=N\r\n return i,j\r\n a,b=make_slice(ab,self.H)\r\n c,d=make_slice(cd,self.W)\r\n return self.cumsum2[b][d]+self.cumsum2[a][c]-self.cumsum2[a][d]-self.cumsum2[b][c]\r\n\r\ndef Bisect_Int(ok,ng,is_ok):\r\n while abs(ok-ng)>1:\r\n mid=(ok+ng)//2\r\n if is_ok(mid):\r\n ok=mid\r\n else:\r\n ng=mid\r\n return ok\r\n\r\nN,M,K,Q=map(int,readline().split())\r\nX,Y,T=[],[],[]\r\nfor _ in range(Q):\r\n x,y,t=map(int,readline().split())\r\n x-=1;y-=1\r\n X.append(x)\r\n Y.append(y)\r\n T.append(t)\r\ndef is_ok(t):\r\n grid=[[0]*M for i in range(N)]\r\n for i in range(Q):\r\n if T[i]<=t:\r\n grid[X[i]][Y[i]]=1\r\n grid=Cumsum2(grid)\r\n for n in range(N-K+1):\r\n for m in range(M-K+1):\r\n if grid[n:n+K,m:m+K]==K**2:\r\n return True\r\n return False\r\ninf=1<<30\r\nans=Bisect_Int(inf,-1,is_ok)\r\nif ans==inf:\r\n ans=-1\r\nprint(ans)\r\n", "import sys\r\nimport io, os\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\n\r\nfrom collections import deque\r\n\r\ndef SlidingMin(A: list, k: int):\r\n n = len(A)\r\n B = []\r\n d = deque([])\r\n for i in range(n):\r\n while d:\r\n if d[0] <= i-k:\r\n d.popleft()\r\n else:\r\n break\r\n while d:\r\n if A[d[-1]] > A[i]:\r\n d.pop()\r\n else:\r\n break\r\n d.append(i)\r\n if i-k+1 >= 0:\r\n B.append(A[d[0]])\r\n return B\r\n\r\ndef SlidingMax(A: list, k: int):\r\n n = len(A)\r\n B = []\r\n d = deque([])\r\n for i in range(n):\r\n while d:\r\n if d[0] <= i-k:\r\n d.popleft()\r\n else:\r\n break\r\n while d:\r\n if A[d[-1]] < A[i]:\r\n d.pop()\r\n else:\r\n break\r\n d.append(i)\r\n if i-k+1 >= 0:\r\n B.append(A[d[0]])\r\n return B\r\n\r\nINF = 10**18\r\n\r\ndef main():\r\n n, m, k, q = map(int, input().split())\r\n Q = []\r\n for i in range(q):\r\n x, y, t = map(int, input().split())\r\n x, y = x-1, y-1\r\n Q.append((x, y, t))\r\n #Q.sort(key=lambda x: x[2])\r\n S = [[-1]*m for i in range(n)]\r\n for x, y, t in Q:\r\n S[x][y] = t\r\n #print(S)\r\n Max = [SlidingMax(l, k) for l in S]\r\n Min = [SlidingMin(l, k) for l in S]\r\n #print(M)\r\n #print(m)\r\n ans = INF\r\n for i in range(n-k+1):\r\n for j in range(m-k+1):\r\n tmax = -1\r\n flag = True\r\n for l in range(i, i+k):\r\n if Min[l][j] == -1:\r\n flag = False\r\n break\r\n tmax = max(tmax, Max[l][j])\r\n if flag:\r\n ans = min(ans, tmax)\r\n if ans != INF:\r\n print(ans)\r\n else:\r\n print(-1)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import deque\r\nimport sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ndef slide_max(n, k, a):\r\n ans = []\r\n s = deque()\r\n for i in range(n):\r\n ai = a[i]\r\n while s:\r\n if a[s[-1]] <= ai:\r\n s.pop()\r\n else:\r\n break\r\n s.append(i)\r\n while s:\r\n if s[0] + k <= i:\r\n s.popleft()\r\n else:\r\n break\r\n if (i + 1) // k:\r\n ans.append(a[s[0]])\r\n return ans\r\n\r\nn, m, k, q = map(int, input().split())\r\ninf = pow(10, 9) + 5\r\na = [[inf] * m for _ in range(n)]\r\nfor _ in range(q):\r\n x, y, t = map(int, input().split())\r\n a[x - 1][y - 1] = t\r\nb = [[] for _ in range(m - k + 1)]\r\nfor i in range(n):\r\n ai = a[i]\r\n s = deque()\r\n b0 = slide_max(m, k, ai)\r\n for j in range(m - k + 1):\r\n b[j].append(b0[j])\r\nans = inf\r\nfor i in range(m - k + 1):\r\n bi = b[i]\r\n s = deque()\r\n ans = min(ans, min(slide_max(n, k, bi)))\r\nans = (ans + 1) % (inf + 1) - 1\r\nprint(ans)", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join([str(i) for i in a]) + end)\r\n\r\ndef check(lmt, qr, k, n, m, q):\r\n d = [[0] * m for i in range(n)]\r\n for i in range(q):\r\n ti, x, y = qr[i]\r\n if(ti <= lmt):\r\n d[x][y] = 1\r\n dp = [[0] * (m + 1) for i in range(n + 1)]\r\n dp[1][1] = d[0][0]\r\n for i in range(2, n + 1):\r\n dp[i][1] = dp[i - 1][1] + d[i - 1][0]\r\n for j in range(2, m + 1):\r\n dp[1][j] = dp[1][j - 1] + d[0][j - 1]\r\n for i in range(2, n + 1):\r\n for j in range(2, m + 1):\r\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + d[i - 1][j - 1]\r\n for i in range(k, n + 1):\r\n for j in range(k, m + 1):\r\n sm = dp[i][j] - dp[i - k][j] - dp[i][j - k] + dp[i - k][j - k]\r\n if(sm == k * k):\r\n return True\r\n\r\ndef main():\r\n n, m, k, q = getf()\r\n qr = []\r\n t0 = -1\r\n for i in range(q):\r\n xi, yi, ti = getf()\r\n t0 = max(t0, ti)\r\n qr.append([ti, xi - 1, yi - 1])\r\n l, r = -1, 10 ** 9 + 7\r\n while(l + 1 < r):\r\n lmt = (l + r) // 2\r\n f = check(lmt, qr, k, n, m, q)\r\n if(f == True):\r\n r = lmt\r\n else:\r\n l = lmt\r\n if(q == 0):\r\n print(-1)\r\n return 0\r\n if(r == 10 ** 9 + 7):\r\n put(-1)\r\n else:\r\n put(r)\r\nmain()\r\n", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf():\r\n return [int(i) for i in get().split()]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join(map(str, a)) + end)\r\n \r\ndef isbroken(n, m, mt, k, qu, q):\r\n a = [[1]*m for i in range(n)]\r\n for i in range(q):\r\n x, y, t = qu[i]\r\n if(t <= mt):\r\n a[x - 1][y - 1] = 0\r\n dp =[[0]*(m + 1) for i in range(n + 1)]\r\n dp[1][1] = a[0][0]\r\n for j in range(2, m + 1):\r\n dp[1][j] = dp[1][j - 1] + a[0][j - 1]\r\n for i in range(2, n + 1):\r\n dp[i][1] = dp[i - 1][1] + a[i - 1][0]\r\n for i in range(2, n + 1):\r\n for j in range(2, m + 1):\r\n dp[i][j] = dp[i - 1][j] + dp[i][j - 1] - dp[i - 1][j - 1] + a[i - 1][j - 1]\r\n #[print(*i) for i in dp]\r\n for i in range(k, n + 1):\r\n for j in range(k, m + 1):\r\n sm = dp[i][j] - dp[i - k][j] - dp[i][j - k] + dp[i - k][j - k]\r\n if(sm == 0):\r\n return 1\r\n return 0\r\ndef main():\r\n n, m, k, q = getf()\r\n qu = [getf() for i in range(q)]\r\n l, r = -1, 10**9 + 1\r\n while(l + 1 < r):\r\n mt = (l + r)//2\r\n if(isbroken(n, m, mt, k, qu, q)):\r\n r = mt\r\n else:\r\n l = mt\r\n if(r != 10**9 + 1):\r\n put(r)\r\n else:\r\n put(-1)\r\nmain()", "n,m,k,q=map(int,input().split())\r\nl=[]\r\nfor i in range(n):\r\n p=[10**9+1]*m\r\n l.append(p)\r\nfor j in range(q):\r\n a,b,c=map(int,input().split())\r\n l[a-1][b-1]=c\r\nq=[]\r\nfor i in range(n):\r\n p=[]\r\n for j in range(m-k+1):\r\n p.append(max(l[i][j:j+k]))\r\n q.append(p)\r\n\r\nr=[]\r\nfor i in range(m-k+1):\r\n for j in range(n-k+1):\r\n w=0\r\n for a in range(k):\r\n w=max(w,q[j+a][i])\r\n r.append(w)\r\n\r\nif min(r)==10**9+1:\r\n print(-1)\r\nelse:\r\n print(min(r))\r\n", "import sys\r\nfrom operator import itemgetter\r\n\r\nn, m, k, q = map(int, input().split())\r\nquery = sorted((list(map(int, line.split()))\r\n for line in sys.stdin), key=itemgetter(2))\r\ntimes = [q[2] for q in query]\r\n\r\n\r\ndef solve(ti):\r\n imos = [[0]*(m+1) for _ in range(n+1)]\r\n for i in range(ti):\r\n imos[query[i][0]][query[i][1]] += 1\r\n\r\n for i in range(n+1):\r\n for j in range(m):\r\n imos[i][j+1] += imos[i][j]\r\n for j in range(m+1):\r\n for i in range(n):\r\n imos[i+1][j] += imos[i][j]\r\n for i in range(k, n+1):\r\n for j in range(k, m+1):\r\n if imos[i][j] - imos[i-k][j] - imos[i][j-k] + imos[i-k][j-k] == k*k:\r\n return True\r\n return False\r\n\r\n\r\ninf = len(times)+1\r\nok, ng = inf, 0\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n if mid >= k*k and solve(mid):\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nprint(times[ok-1] if ok != inf else -1)\r\n", "from collections import deque \n\nn , m , k , q = map ( int , input ( ) . split ( ) )\n\ninf = -1000000001\n\nM = [ [ inf for i in range ( m) ] for j in range ( n ) ]\n\nfor qq in range ( q ) :\n\n x , y , t = map ( int , input ( ) . split ( ) )\n \n x-= 1\n y-= 1\n \n M[x][y] = t*-1\n \ndef add_one ( a , i , dQ ) :\n \n if len ( dQ ) == 0 :\n \n dQ.appendleft( (a,i) )\n \n return\n \n for ii in range ( len ( dQ ) ) :\n \n if dQ[0][0] < a :\n \n dQ.appendleft( (a,i) ) \n break\n \n dQ.popleft()\n \n else :\n \n dQ.appendleft( (a,i) )\n \ndef remove_one ( a , i , dQ ) :\n\n if len( dQ ) == 0 :\n \n return\n \n if dQ [-1] == (a,i) :\n \n dQ.pop()\n \n \n \nR = [ [] for i in range ( n ) ]\n\nfor i in range ( n ) :\n\n dQ = deque([])\n\n for j in range ( k ) :\n \n add_one ( M[i][j] , j , dQ )\n \n R[i] += [dQ[-1][0]]\n \n for j in range ( k , m ) :\n \n add_one ( M[i][j] , j , dQ )\n remove_one ( M[i][j-k] , j-k , dQ )\n \n R[i] += [dQ[-1][0]]\n \n\nC = [ [] for i in range ( m - k + 1 ) ]\n\nfor j in range ( m - k + 1 ) :\n\n dQ = deque([])\n\n for i in range ( k ) :\n \n add_one ( R[i][j] , i , dQ )\n\n C[j] += [dQ[-1][0]]\n \n for i in range ( k , n ) :\n \n add_one ( R[i][j] , i , dQ )\n remove_one ( R[i-k][j] , i-k , dQ )\n \n C[j] += [dQ[-1][0]]\n\nmaxo = inf\n\nfor i in range ( len ( C ) ) :\n \n for j in range ( len ( C [ 0] ) ) :\n \n maxo = max ( maxo , C[i][j] )\n \nif maxo == inf :\n maxo = 1\n \nprint(maxo*-1)\n\n\n \t\t \t \t\t\t \t\t\t \t \t\t \t \t \t" ]

[ "import os, sys\r\nfrom io import BytesIO, IOBase\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, 8192))\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, 8192))\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\ninp = lambda dtype: [dtype(x) for x in input().split()]\r\ninp_2d = lambda dtype, n: [dtype(input()) for _ in range(n)]\r\ninp_2ds = lambda dtype, n: [inp(dtype) for _ in range(n)]\r\ninp_enu = lambda dtype: [(i, x) for i, x in enumerate(inp(dtype))]\r\ninp_enus = lambda dtype, n: [[i] + inp(dtype) for i in range(n)]\r\nceil1 = lambda a, b: (a + b - 1) // b\r\n\r\ns, t = input(), input()\r\nls, lt = len(s), len(t)\r\nbe, en, ix = [-1] * lt, [-1] * lt, 0\r\n\r\nfor i in range(ls):\r\n if ix < lt and s[i] == t[ix]:\r\n be[ix] = i\r\n ix += 1\r\n\r\nix = lt - 1\r\nfor i in range(ls - 1, -1, -1):\r\n if ix > -1 and s[i] == t[ix]:\r\n en[ix] = i\r\n ix -= 1\r\n\r\nif ix > -1:\r\n exit(print('No'))\r\n\r\nmem = [[0] * (ls + 1) for _ in range(26)]\r\nfor i in range(lt):\r\n ch = ord(t[i]) - 97\r\n mem[ch][be[i]] += 1\r\n mem[ch][en[i] + 1] -= 1\r\n\r\nfor i in range(26):\r\n for j in range(1, ls + 1):\r\n mem[i][j] += mem[i][j - 1]\r\n\r\nfor i in range(ls):\r\n ch = ord(s[i]) - 97\r\n if not mem[ch][i]:\r\n exit(print('No'))\r\n\r\nprint('Yes')\r\n", "s = input()\r\nt = input()\r\nN = len(s)\r\nM = len(t)\r\nlatest = [0] * 200\r\nMaxL = [0] * (N + 1)\r\nMaxR = [0] * (N + 1)\r\nCnt = 0\r\nfor i in range(1, N + 1):\r\n if Cnt < M and s[i - 1] == t[Cnt]:\r\n Cnt += 1\r\n MaxL[i] = Cnt\r\n latest[ord(s[i - 1])] = Cnt\r\n else:\r\n MaxL[i] = latest[ord(s[i - 1])]\r\nt = t[::-1] \r\nlatest = [0] * 200\r\nCnt = 0\r\nfor i in range(N, 0, -1):\r\n if Cnt < M and s[i - 1] == t[Cnt]:\r\n Cnt += 1\r\n MaxR[i] = Cnt\r\n latest[ord(s[i - 1])] = Cnt\r\n else:\r\n MaxR[i] = latest[ord(s[i - 1])]\r\nflag = all(MaxL[i] + MaxR[i] >= M + 1 for i in range(1, N + 1))\r\nif flag:\r\n print(\"Yes\")\r\nelse:\r\n print(\"No\")# 1692035052.9421067" ]

[ "def check(d, i, j, l):\n global result, save\n if d[i][j][l] == 1:\n if d[i + 1][j][l] == 1 and d[i - 1][j][l] == 1:\n #save.append([i, j, l])\n result += 1\n return\n if d[i][j + 1][l] == 1 and d[i][j - 1][l] == 1:\n result += 1\n #save.append([i, j, l])\n return\n if d[i][j][l + 1] == 1 and d[i][j][l - 1] == 1:\n result += 1\n #save.append([i, j, l])\n return\n if d[i - 1][j + 1][l] == 0 and d[i][j + 1][l] == 1 and d[i - 1][j][l] == 1:\n result += 1\n #save.append([i, j, l])\n return\n if d[i][j + 1][l - 1] == 0 and d[i][j + 1][l] == 1 and d[i][j][l - 1] == 1:\n result += 1\n #save.append([i, j, l])\n return\n if d[i + 1][j][l - 1] == 0 and d[i + 1][j][l] == 1 and d[i][j][l - 1] == 1:\n result += 1\n #save.append([i, j, l])\n return\n if d[i + 1][j - 1][l] == 0 and d[i + 1][j][l] == 1 and d[i][j - 1][l] == 1:\n result += 1\n #save.append([i, j, l])\n return\n if d[i][j - 1][l + 1] == 0 and d[i][j - 1][l] == 1 and d[i][j][l + 1] == 1:\n result += 1\n #save.append([i, j, l])\n return\n if d[i - 1][j][l + 1] == 0 and d[i - 1][j][l] == 1 and d[i][j][l + 1] == 1:\n result += 1\n #save.append([i, j, l])\n return \n \n\nn, m, k = map(int, input().split())\nd = [[[0] * (k + 2) for i in range(m + 2)] for j in range(n + 2)]\nfor i in range(1, n + 1):\n for j in range(1, m + 1):\n st = input()\n #print(st)\n for l in range(k):\n d[i][j][l + 1] = int(st[l])\n if i != n:\n a = input()\n\nresult = 0\nfor i in range(1, n + 1):\n for j in range(1, m + 1):\n for l in range(1, k + 1):\n check(d, i, j, l)\nprint(result)", "def func(i,j,t):\r\n if i > 0:\r\n if A[i-1][j][t] == '1':\r\n if i < n-1:\r\n if A[i+1][j][t] == '1':\r\n return True\r\n if j < m-1:\r\n if A[i][j+1][t] == '1' and A[i-1][j+1][t] == '0':\r\n return True\r\n if t < k-1:\r\n if A[i-1][j][t+1] == '0' and A[i][j][t+1] == '1':\r\n return True\r\n if j > 0:\r\n if A[i][j-1][t] == '1':\r\n if j < m-1:\r\n if A[i][j+1][t] == '1':\r\n return True\r\n if i < n-1:\r\n if A[i+1][j][t] == '1' and A[i+1][j-1][t] == '0':\r\n return True\r\n if t < k-1:\r\n if A[i][j-1][t+1] == '0' and A[i][j][t+1] == '1':\r\n return True\r\n if t > 0:\r\n if A[i][j][t-1] == '1':\r\n if t < k-1:\r\n if A[i][j][t+1] == '1':\r\n return True\r\n if i < n-1:\r\n if A[i+1][j][t] == '1' and A[i+1][j][t-1] == '0':\r\n return True\r\n if j < m-1:\r\n if A[i][j+1][t-1] == '0' and A[i][j+1][t] == '1':\r\n return True \r\n \r\n \r\n return False\r\n\r\nn,m,k = map(int, input().split())\r\nA = [0] * n\r\nfor i in range(n):\r\n A[i] = [0] * m\r\n for j in range(m):\r\n A[i][j] = [0] * k\r\nfor i in range(n):\r\n for j in range(m):\r\n per = input()\r\n for t in range(k):\r\n A[i][j][t] = per[t]\r\n if i != n-1:\r\n \r\n per = input()\r\nanswer = 0\r\nfor i in range(n):\r\n for j in range(m):\r\n for t in range(k):\r\n if A[i][j][t] == '1':\r\n if func(i,j,t):\r\n answer+=1\r\n \r\nprint(answer)\r\n", "def main():\n s = input().split()\n n, m, k = int(s[0]), int(s[1]), int(s[2])\n processor = []\n for x in range(n):\n for y in range(m):\n s = input()\n for z in s:\n processor.append(int(z) == 1)\n if x < n - 1:\n emptyLine = input()\n counter = 0\n mk = m * k\n nmk = n * mk\n for i in range(nmk):\n if not processor[i]:\n continue\n # back\n if i >= mk:\n if processor[i - mk]:\n # front\n if i < (nmk - mk):\n if processor[i + mk]:\n counter += 1\n continue\n # right\n if (i % k) < (k - 1):\n if processor[i + 1]:\n if not processor[i - mk + 1]:\n counter += 1\n continue\n # down\n if (i % mk) < (mk - k):\n if processor[i + k]:\n if not processor[i - mk + k]:\n counter += 1\n continue\n # left\n if (i % k) > 0:\n if processor[i - 1]:\n # front\n if i < (nmk - mk):\n if processor[i + mk]:\n if not processor[i + mk - 1]:\n counter += 1\n continue\n # right\n if (i % k) < (k - 1):\n if processor[i + 1]:\n counter += 1\n continue\n # down\n if (i % mk) < (mk - k):\n if processor[i + k]:\n if not processor[i + k - 1]:\n counter += 1\n continue\n # up\n if (i % mk) >= k:\n if processor[i - k]:\n # front\n if i < (nmk - mk):\n if processor[i + mk]:\n if not processor[i + mk - k]:\n counter += 1\n continue\n # right\n if (i % k) < (k - 1):\n if processor[i + 1]:\n if not processor[i - k + 1]:\n counter += 1\n continue\n # down\n if (i % mk) < (mk - k):\n if processor[i + k]:\n counter += 1\n continue\n print(counter)\n\n\nmain()\n", "n,m,k=(int(z) for z in input().split())\r\nM=[]\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\ts=input()\r\n\t\tfor p in range(len(s)):\r\n\t\t\tM+=[int(s[p])]\r\n\tif i!=n-1:\r\n\t\ts=input()\r\nres=0\r\ncur=0\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tfor h in range(k):\r\n\t\t\tif M[cur]==1:\r\n\t\t\t\tif 1<=i<=n-2 and M[cur-m*k]+M[cur+m*k]==2:\r\n\t\t\t\t\tres+=1\r\n\t\t\t\telif 1<=h<=k-2 and M[cur-1]+M[cur+1]==2:\r\n\t\t\t\t\tres+=1\r\n\t\t\t\telif 1<=j<=m-2 and M[cur-k]+M[cur+k]==2:\r\n\t\t\t\t\tres+=1\r\n\t\t\t\telif h<=k-2 and j>=1 and M[cur+1]+M[cur-k]==2 and M[cur-k+1]==0:\r\n\t\t\t\t\tres+=1\r\n\t\t\t\telif j<=m-2 and h>=1 and M[cur-1]+M[cur+k]==2 and M[cur+k-1]==0:\r\n\t\t\t\t\tres+=1\r\n\t\t\t\telif h<=k-2 and i>=1 and M[cur+1]+M[cur-m*k]==2 and M[cur-m*k+1]==0:\r\n\t\t\t\t\tres+=1\r\n\t\t\t\telif i<=n-2 and h>=1 and M[cur-1]+M[cur+m*k]==2 and M[cur+m*k-1]==0:\r\n\t\t\t\t\tres+=1 \r\n\t\t\t\telif i<=n-2 and j>=1 and M[cur-k]+M[cur+m*k]==2 and M[cur+m*k-k]==0:\r\n\t\t\t\t\tres+=1\r\n\t\t\t\telif j<=m-2 and i>=1 and M[cur+k]+M[cur-m*k]==2 and M[cur-m*k+k]==0:\r\n\t\t\t\t\tres+=1\r\n\t\t\tcur+=1\r\nprint(res)" ]

[ "n=int(input())\r\nif n<6:\r\n print(-1)\r\nelse:\r\n print(1, 2)\r\n print(1, 3)\r\n print(1, 4)\r\n for i in range(5, n+1):\r\n print(2, i)\r\nfor i in range(2, n+1):\r\n print(1, i)\r\n \r\n \r\n ", "import sys\nfrom sys import stdout\n\ninput = sys.stdin.readline\ninf = float('inf')\n\n\ndef getInt():\n return int(input())\n\n\ndef getStr():\n return input().strip()\n\n\ndef getList(split=True):\n s = getStr()\n if split:\n s = s.split()\n return list(map(int, s))\n\n# def p(*args,**kwargs):\n# print(*args,**kwargs)\n# stdout.flush()\n\n\n# t = getInt()\nt = 1\n\n\ndef solve():\n\n n = getInt()\n if n < 6:\n print(-1)\n else:\n print(n-5, n-2)\n print(n-5, n-3)\n print(n-5, n-4)\n print(n-2, n)\n print(n-2, n-1)\n for i in range(1, n-5):\n print(i, i+1)\n\n for i in range(1, n):\n print(i, i+1)\n\n\nfor _ in range(t):\n solve()\n", "import sys\nimport math\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\nASCIILOWER = 97\nASCIIUPPER = 65\n\n\ndef getInt():\n return int(sys.stdin.readline().rstrip())\n\n\ndef getInts():\n return map(int, sys.stdin.readline().rstrip().split(\" \"))\n\n\ndef getString():\n return sys.stdin.readline().rstrip()\n\n\ndef printOutput(a, b):\n if not a:\n sys.stdout.write(str(-1) + \"\\n\")\n else:\n for x, y in a:\n sys.stdout.write(str(x) + \" \" + str(y) + \"\\n\")\n\n for x, y in b:\n sys.stdout.write(str(x) + \" \" + str(y) + \"\\n\")\n\n\ndef incorrectAlg(ln):\n ans = []\n for i in range(1, ln - 3):\n ans.append((1, i + 1))\n ans.append((1, ln - 2))\n ans.append((ln - 2, ln - 1))\n ans.append((ln - 2, ln))\n return ans\n\n\ndef correctAlgorithm(ln):\n ans = []\n for i in range(1, ln):\n ans.append((i, i + 1))\n\n return ans\n\n\ndef solve(ln):\n if ln < 6:\n a = None\n else:\n a = incorrectAlg(ln)\n b = correctAlgorithm(ln)\n return a, b\n\n\ndef readinput():\n ln = getInt()\n printOutput(*solve(ln))\n\n\nreadinput()\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nif n < 6:\r\n print(-1)\r\nelse:\r\n print(1, 2)\r\n print(2, 3)\r\n print(2, 4)\r\n for i in range(5, n+1):\r\n print(1, i)\r\nfor i in range(2, n+1):\r\n print(1, i)", "import sys\r\nimport math\r\nimport collections\r\ndy = [1, 0, -1, 0]\r\ndx = [0, 1, 0, -1]\r\n\r\nr = sys.stdin.readline\r\n\r\nN = int(r())\r\n\r\nif N >= 6:\r\n print(1, 2)\r\n for i in range(3, N+1):\r\n if i % 2 == 1:\r\n print(1, i)\r\n else:\r\n print(2, i)\r\nelse:\r\n print(-1)\r\n\r\nfor i in range(1, N):\r\n print(i, i+1)", "def wa(n):\r\n print(\"1 2\\n1 3\\n1 4\")\r\n for i in range(5, n + 1):\r\n print(2, i)\r\nn = int(input())\r\nif n < 6:\r\n print(-1)\r\nelse: wa(n)\r\nfor i in range(2, n + 1):\r\n print(1, i)\r\n", "n = int(input())\r\n# Tree one\r\nif n < 6:\r\n print(-1)\r\nelse:\r\n print(1, 2)\r\n print(1, 3)\r\n print(1, 4)\r\n for i in range(5, n + 1):\r\n print(2, i)\r\n\r\n# Tree two\r\nfor i in range(2, n + 1):\r\n print(1, i)", "# https://codeforces.com/contest/959\n\nimport sys\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\nn = int(input()) # 2 <= n <= 10**5\n\n# incorrect part\nif n <= 5:\n print(-1)\nelse:\n print(1, 2)\n print(2, 3)\n print(2, 4)\n for i in range(5, n + 1):\n print(1, i)\n\n# correct\nfor i in range(2, n + 1):\n print(i - 1, i)\n", "import math\r\nn = int(input())\r\nif(n <= 5):\r\n\tprint(-1)\r\nelse:\r\n for i in range(2,math.floor(n/2)+2):\r\n print(1,i)\r\n for i in range(math.floor(n/2)+2,n+1):\r\n print(math.floor(n/2)+1,i)\r\nfor i in range(1,n):\r\n\tprint(i,i+1)", "\r\ndef ll(n):\r\n for i in range(1, n):\r\n print(i, i+1)\r\n \r\n\r\n\r\nn = int(input())\r\nif n < 6:\r\n print(-1)\r\nelse:\r\n print(\"1 2\\n1 3\\n2 4\\n2 5\\n1 6\")\r\n for i in range(7,n+1):\r\n print(1,i)\r\nll(n)", "num = int(input())\r\n\r\nif num >= 6:\r\n print(num, 2)\r\n print(num - 1, 2)\r\n \r\n for i in range(num - 2, 1, -1):\r\n print(i, 1)\r\nelse:\r\n print(-1)\r\n\r\nfor i in range(2, num + 1):\r\n print(1, i)\r\n", "n = int (input ())\r\nif n < 6 : print (-1)\r\nelse :\r\n print (1, 2)\r\n print (2, 3)\r\n print (3, 4)\r\n for i in range (5, n + 1) :\r\n if i & 1 : print (3, i)\r\n else : print (2, i)\r\nfor i in range (2, n + 1) : print (i - 1, i)\r\n", "n=int(input())\r\nif n>=6:\r\n\tfor i in range(2, n-1):\r\n\t\tprint(1, i)\r\n\tfor i in range(n-1, n+1):\r\n\t\tprint(2, i)\r\nelse:\r\n\tprint(-1)\r\nfor i in range(2, n+1):\r\n\tprint(1, i)", "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 = []\r\nif n <= 5:\r\n ans0 = \"-1\"\r\n ans.append(ans0)\r\nelse:\r\n ans.append(\"1 2\")\r\n for v in range(3, n + 1):\r\n u = v % 2 + 1\r\n ans.append(\" \".join(map(str, (u, v))))\r\nfor u in range(1, n):\r\n v = u + 1\r\n ans.append(\" \".join(map(str, (u, v))))\r\nsys.stdout.write(\"\\n\".join(ans))", "n = int(input())\r\n\r\nif n<6:\r\n\tprint(-1)\r\nelse:\r\n\tprint(\"1 2\\n1 3\\n1 4\")\r\n\tfor i in range(5,n+1):\r\n\t\tprint('2 '+str(i))\r\nfor i in range(2, n+1):\r\n\tprint('1 '+str(i))\r\n", "from collections import defaultdict, Counter\r\nfrom bisect import bisect, bisect_left\r\nfrom math import sqrt, gcd, ceil, factorial\r\n\r\n\r\n# file = open(\"input.txt\", \"r\")\r\n\r\nMOD = 10**9 + 7\r\ninf = float(\"inf\")\r\nans_ = []\r\n\r\ndef nin():return int(input())\r\ndef ninf():return int(file.readline())\r\n\r\ndef st():return (input().strip())\r\ndef stf():return (file.readline().strip())\r\n\r\ndef read(): return list(map(int, input().strip().split()))\r\ndef readf():return list(map(int, file.readline().strip().split()))\r\n\r\n\r\nans_ = []\r\ndef solve():\r\n n = nin()\r\n a, b = [], []\r\n for i in range(2, n+1):b.append([1, i])\r\n if n < 6:a.append([-1])\r\n else:\r\n a = [[1,2],[1,3],[1,4]]\r\n for i in range(5, n+1):a.append([2, i])\r\n \r\n \r\n \r\n ans_.extend([a, b])\r\n \r\nsolve()\r\n \r\nfor i in ans_:\r\n for j in i:\r\n print(*j)", "n = int(input())\r\nif n < 6:\r\n print(-1)\r\nelse:\r\n print(1, 2)\r\n for i in range(3, n+1):\r\n print(i%2 + 1, i)\r\nfor i in range(1, n):\r\n print(i, i+1)", "def wrong(n):\n if n <= 5:\n print(-1)\n return\n for i, j in (1, 2), (1, 3), (1, 4), (4, 5), (4, 6):\n print(i, j)\n if n > 6:\n print(4, 7)\n for i in range(7, n):\n print(i, i + 1)\n\n\ndef correct(n):\n for i in range(1, n):\n print(i, i + 1)\n\n\nn = int(input())\nwrong(n)\ncorrect(n)\n", "n=int(input())\r\nif n>=6:\r\n\tprint(n,2)\r\n\tprint(n-1,2)\r\n\tfor i in range(n-2,1,-1):\r\n\t\tprint(i,1)\r\nelse:\r\n\tprint(-1)\r\nfor i in range(2,n+1):\r\n\tprint(1,i)", "import os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom collections import Counter, defaultdict\r\nimport math\r\nimport heapq\r\nimport bisect\r\nimport collections\r\ndef ceil(a, b):\r\n return (a + b - 1) // b\r\ninf = float('inf')\r\ndef get():\r\n return sys.stdin.readline()\r\nmod = 10 ** 5 + 7\r\n\r\n# for _ in range(int(get())):\r\n# n=int(get())\r\n# l=list(map(int,get().split()))\r\n# = map(int,get().split())\r\n##################################################################################\r\nn=int(get())\r\nif n<6:\r\n print(-1)\r\n d = [[1, 2]]\r\n for i in range(3, n + 1):\r\n d.append([2, i])\r\n for i in d:\r\n print(*i)\r\n exit()\r\nl1=[]\r\nl1.append([1,2])\r\nl1.append([2,3])\r\nl1.append([2,4])\r\nfor i in range(5,n+1):\r\n l1.append([1,i])\r\nfor i in l1:\r\n print(*i)\r\nd=[[1,2]]\r\nfor i in range(3,n+1):\r\n d.append([1,i])\r\nfor i in d:\r\n print(*i)\r\n\r\n\r\n\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nif n < 6:\r\n print(-1)\r\n\r\nelse:\r\n l = []\r\n o = []\r\n x = (3+n)//2\r\n for i in range(3,x+1):\r\n l.append((1,i))\r\n\r\n for i in range(x+1,n+1):\r\n o.append((2,i))\r\n\r\n sys.stdout.write(\"1\"+\" \"+\"2\"+\"\\n\")\r\n for x in l:\r\n sys.stdout.write(str(x[0]) + \" \" + str(x[1]) + \"\\n\")\r\n\r\n for x in o:\r\n sys.stdout.write(str(x[0]) + \" \" + str(x[1]) + \"\\n\")\r\n\r\nsys.stdout.write(\"1\"+\" \"+\"2\"+\"\\n\")\r\np = 2\r\nfor i in range(3,n+1):\r\n sys.stdout.write(str(p) + \" \" + str(i) + \"\\n\")\r\n p = i\r\n\r\n", "n = int(input())\r\n \r\nif n < 6:\r\n print(-1)\r\nelse:\r\n print('1 2\\n2 3\\n2 4\\n4 5\\n4 6')\r\n for i in range(0, (n - 6) // 2 * 2, 2):\r\n print(1, i + 7)\r\n print(i + 7, i + 8)\r\n if n % 2 == 1:\r\n print(2, n)\r\n \r\n \r\n#print()\r\nfor i in range(n - 1):\r\n print(i + 1, i + 2)", "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=int(input())\r\nif n<=5:\r\n print(-1)\r\nelse:\r\n for i in range(2,5):\r\n print(1,i)\r\n for i in range(5,n+1):\r\n print(2,i)\r\nfor i in range(2,n+1):\r\n print(1,i)", "n = int(input())\r\n\r\nif n < 6:\r\n print(-1)\r\nelse:\r\n counter = iter(range(2, n))\r\n print(\"1 2\")\r\n left = (n - 2) // 2\r\n right = n - 2 - left\r\n for _ in range(left):\r\n print(1, next(counter) + 1)\r\n\r\n for _ in range(right):\r\n print(2, next(counter) + 1)\r\n\r\nfor i in range(n - 1):\r\n print(i + 1, i + 2)\r\n", "import sys\r\nimport os.path\r\nfrom collections import *\r\nimport math\r\nimport bisect\r\n\r\nif (os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n sys.stdout = open(\"output.txt\", \"w\")\r\nelse:\r\n input = sys.stdin.readline\r\n\r\n############## Code starts here ##########################\r\n\r\nn = int(input())\r\n\r\nif(n == 2 or n == 3 or n == 4 or n == 5):\r\n print(-1)\r\nelse:\r\n print(1,2)\r\n print(2,3)\r\n print(2,4)\r\n for i in range(5,n + 1):\r\n print(4,i)\r\n\r\nfor i in range(2,n + 1):\r\n print(1,i)\r\n\r\n############## Code ends here ############################\r\n" ]

[ "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input1():\r\n with open('input.txt') as fp:\r\n return fp.readlines()\r\n\r\n\r\ndef output1(ans: str):\r\n with open('output.txt', mode='w') as fp:\r\n fp.write(ans)\r\n\r\n\r\ndef input2():\r\n return [line.decode('utf-8') for line in sys.stdin.buffer.readlines()]\r\n\r\n\r\ndef output2(ans):\r\n print(ans)\r\n\r\n\r\nsubmit = 1\r\nif submit:\r\n input = input1\r\n output = output1\r\nelse:\r\n input = input2\r\n output = output2\r\n\r\n\r\ns = input()\r\nn, k = map(int, s[0].split())\r\nmodel = [list(line.rstrip()) for line in s[1:]]\r\na = [['.']]\r\nm = 1\r\n\r\nfor e in range(1, k + 1):\r\n size = n**e\r\n b = [['*'] * size for _ in range(size)]\r\n for i in range(len(a)):\r\n for j in range(len(a)):\r\n if a[i][j] == '.':\r\n for di in range(n):\r\n b[i * n + di][j * n:(j + 1) * n] = model[di]\r\n\r\n a = b\r\n\r\noutput('\\n'.join(''.join(row) for row in a))\r\n", "with open('input.txt', 'r') as file:\r\n line = file.readlines()\r\n\r\n n, k = [int(x) for x in line[0].split()]\r\n template = [x.strip() for x in line[1:]]\r\n\r\ndef fractal(n,k):\r\n if k == 1:\r\n return [list(x) for x in template]\r\n \r\n new_grid = [[\".\"]*(n**k) for i in range(n**k)] #creates the n^k by n^k grid with .,\r\n for i in range(n):\r\n for j in range(n):\r\n if template[i][j] == \"*\":\r\n for ii in range(n**(k-1)):\r\n for jj in range(n**(k-1)):\r\n x = i*(n**(k-1)) + ii\r\n y = j*(n**(k-1)) + jj\r\n new_grid[x][y] = \"*\"\r\n else:\r\n xd = fractal(n,k-1)\r\n for ii in range(n**(k-1)):\r\n for jj in range(n**(k-1)):\r\n x = i*(n**(k-1)) + ii\r\n y = j*(n**(k-1)) + jj\r\n new_grid[x][y] = xd[ii][jj]\r\n \r\n return new_grid\r\n\r\nwith open('output.txt', 'w') as file: \r\n for x in fractal(n, k):\r\n file.write(''.join(x)+'\\n')", "in_file = open('input.txt', 'r')\nout_file = open('output.txt', 'w')\n\nn, k = map(int, in_file.readline().split())\npattern = [ in_file.readline().strip() for r in range(n) ]\nfull_size = n**k\ngrid = [ [ '.' for c in range(full_size) ] for r in range(full_size) ]\n\ndef paint(r0, c0, size):\n if size == 1:\n return\n tier = size // n\n for i in range(n):\n r = r0 + i * tier\n for j in range(n):\n c = c0 + j * tier\n if pattern[i][j] == '*':\n for dr in range(tier):\n for dc in range(tier):\n grid[r + dr][c + dc] = '*'\n else:\n paint(r, c, tier)\n\npaint(0, 0, full_size)\nfor row in grid:\n line = ''.join(row)\n print(line)\n out_file.write(line + '\\n')\n\nout_file.close()\n", "import sys\n\ndef solve():\n n, k, = rv()\n giv = [[False if val == '.' else True for val in list(input())] for _ in range(n)]\n maxsize = pow(n, k)\n tab = [[False] * maxsize for _ in range(maxsize)]\n for step in range(k): #\n size = maxsize // pow(n, step)\n for row in range(0, maxsize, size):\n for col in range(0, maxsize, size):\n if not tab[row][col]:\n for r in range(row, row + size):\n for c in range(col, col + size):\n rtrans = (r - row) * n // size\n ctrans = (c - col) * n // size\n oldval = giv[rtrans][ctrans]\n if not tab[r][c] and oldval:\n tab[r][c] = True\n print('\\n'.join(''.join('*' if ch else '.' for ch in line) for line in tab))\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 :\n sys.stdin = open(\"test.txt\")\nelse:\n sys.stdin = open(\"input.txt\")\n sys.stdout = open(\"output.txt\", 'w')\nsolve()", "# Function to read file\ndef read_txt(file_name: str) -> list:\n file = open(file_name, \"r\").read()\n return file.split('\\n')\n\ndef sub_fractal(reference: list, copy: list, n_lines: int) -> list:\n # Create all new lines\n new_fractal = [''] * (n_lines * len(copy))\n\n # Get old line and cols just to verify if it is empty or filled\n for line in range(len(copy)):\n for col in range(len(copy[line])):\n base_tam = n_lines * line\n\n # For every space in old fractal, create new chars\n old_char = copy[line][col]\n\n # Iterator for create new chars\n for new_c in range(n_lines):\n dict_helper = {\n \"*\": \"*\" * n_lines,\n \".\": reference[new_c]\n }\n new_char = dict_helper[old_char]\n\n new_fractal[base_tam + new_c] += new_char\n\n return new_fractal\n\n# Read File\nfile_readed = read_txt(\"input.txt\")\nfractal = [line for line in file_readed[1:-1]]\n\n# Create copy of fractal\nnew_fractal = list(fractal)\n\n# Get lines and iterations\nn_lines, iterations = file_readed[0].split(\" \")\n\n# Create new fractals\nfor i in range(int(iterations) - 1):\n new_fractal = list(sub_fractal(fractal, new_fractal, int(n_lines)))\n\nwith open(\"output.txt\", \"w+\") as file:\n for line in new_fractal:\n print(\"\".join(line), file=file)\n\t\t \t \t\t\t\t\t \t\t \t\t \t \t\t\t\t \t", "with open(\"input.txt\",'r') as arq:\n n, k = arq.readline().split()\n n = int(n)\n k = int(k)\n\n modelo = arq.readlines()\n modelo = [[c for c in linha.strip()] for linha in modelo]\n\n\nfigura_anterior = modelo\nfigura_nova = modelo\nfor fase in range(2,k+1):\n figura_nova = [[0 for i in range(n**fase)] for i in range(n**fase)]\n # para cada quadrante do modelo\n for i in range(n):\n for j in range(n):\n if modelo[i][j]==\"*\":\n # vou colorir o quadrante da figura de preto\n for peq_i in range(n**(fase-1)):\n for peq_j in range(n**(fase-1)):\n figura_nova[i*n**(fase-1)+peq_i][j*n**(fase-1)+peq_j] = \"*\"\n else:\n # vou copiar a figura anterior\n for peq_i in range(n**(fase-1)):\n for peq_j in range(n**(fase-1)):\n figura_nova[i*n**(fase-1)+peq_i][j*n**(fase-1)+peq_j] = figura_anterior[peq_i][peq_j]\n #print(figura_anterior)\n #print(figura_nova)\n #print(figura_nova)\n figura_anterior = figura_nova\n\nwith open(\"output.txt\",'w') as arq:\n for linha in figura_nova:\n arq.write(\"\".join(linha)+'\\n')\n\t\t \t \t \t\t \t\t\t\t \t \t \t\t \t", "import copy\n\nf = open('input.txt', 'r')\nf2 = open('output.txt', 'w')\n\nn, k = map(int, f.readline().split())\no_pattern = []\nfor i in range(n):\n o_pattern.append(f.readline().rstrip())\n\no_black = []\ntemp = []\nfor i in range(n):\n temp.append('*')\nfor i in range(n):\n o_black.append(temp)\n\npattern = copy.deepcopy(o_pattern)\n\nfor m in range(2, k+1):\n out_ = []\n for p in range(n**m):\n out_.append([])\n for i in range(n**(m-1)):\n for j in range(n**(m-1)):\n if pattern[i][j] == '.':\n for q in range(n):\n out_[i*n+q] += o_pattern[q]\n else:\n for q in range(n):\n out_[i*n+q] += o_black[q]\n pattern = copy.deepcopy(out_)\n\nfor i in pattern:\n for j in range(n**k):\n f2.write(i[j])\n f2.write('\\n')\n", "import sys\r\nsys.stdin=open('input.txt', 'r')\r\nsys.stdout=open('output.txt','w')\r\nn,k=map(int,input().split())\r\ns=[input()for i in '0'*n]\r\nb=['*'*len(s[0])for i in '0'*n]\r\na='.'\r\nfor f in'0'*k:\r\n\tr=[]\r\n\tfor i in a:\r\n\t\tt=['']*len(s)\r\n\t\tfor c in i:\r\n\t\t\tfor j in range(len(s)): t[j]+=s[j]if c=='.'else b[j]\r\n\t\tr+=t\r\n\ta=r\r\nprint('\\n'.join(a))", "# 20191230 21:40 ~ 22:38\r\n\r\nwith open('input.txt','r') as f:\r\n fs = f.read().strip().split('\\n')\r\n\r\nn, k = fs[0].split()\r\nn = int(n)\r\nk = int(k)\r\n\r\narr = []\r\nfor i in range(1, n+1):\r\n row = []\r\n for j in fs[i]:\r\n row.append(j)\r\n arr.append(row)\r\n\r\nans = [['.' for i in range(n**k)] for j in range(n**k)]\r\n\r\ndef recur(n, k, r, c, len, color):\r\n # print('recur(', str(n), str(k), str(r), str(c), str(len), color, ')')\r\n global arr\r\n global ans\r\n for i in range(len):\r\n for j in range(len):\r\n ans[r+i][c+j] = color\r\n if len == 1:\r\n return\r\n if color == '.':\r\n for row, rd in zip(arr, (rdi for rdi in range(0, len, int(len/n))) ):\r\n for elem, cd in zip(row, (cdi for cdi in range(0, len, int(len/n))) ):\r\n recur(n, k, r+rd, c+cd, int(len/n), elem)\r\n\r\nfor row, rd in zip(arr, (rdi for rdi in range(0, n**k, n**(k-1))) ):\r\n # print(rd)\r\n for elem, cd in zip(row, (cdi for cdi in range(0, n**k, n**(k-1))) ):\r\n # print(cd)\r\n recur(n, k, rd, cd, n**(k-1), elem)\r\n\r\n\r\nwith open('output.txt','w') as f:\r\n for row in ans:\r\n for i in row:\r\n f.write(i)\r\n f.write('\\n')", "def doWork(temp, n, cont):\r\n ans = ['' for i in range(len(cont) * n)]\r\n bhelper = '*' * n\r\n\r\n for i in range(len(cont)):\r\n for j in range(len(cont[i])):\r\n k, t = i * n, 0\r\n if cont[i][j] == '.':\r\n while t < n:\r\n ans[k] += temp[t]\r\n k += 1\r\n t += 1\r\n else:\r\n while t < n:\r\n ans[k] += bhelper\r\n k += 1\r\n t += 1\r\n return ans\r\n\r\n\r\n# n, k = [int(item) for item in input().split(' ')]\r\n\r\nreadFile = open('input.txt', 'r')\r\nn, k = [int(item) for item in readFile.readline().split(' ')]\r\n\r\ntemp, cont = [], []\r\nfor i in range(n):\r\n # temp.append(input())\r\n temp.append(readFile.readline().rstrip())\r\n\r\nreadFile.close()\r\ncont = temp.copy()\r\n\r\nfor i in range(k - 1):\r\n cont = doWork(temp, n, cont).copy()\r\n\r\n# print('')\r\nwriteFile = open('output.txt', 'w')\r\nfor item in cont:\r\n writeFile.write(f'{item}\\n')\r\nwriteFile.close()\r\n", "def do(temp, n, cont):\r\n s = ['' for _ in range(len(cont) * n)]\r\n b = '*' * n\r\n for i in range(len(cont)):\r\n for j in range(len(cont[i])):\r\n k = i * n\r\n t = 0\r\n if cont[i][j] == '.':\r\n while t < n:\r\n s[k] += temp[t]\r\n k += 1\r\n t += 1\r\n else:\r\n while t < n:\r\n s[k] += b\r\n k += 1\r\n t += 1\r\n return s\r\n\r\nr = open('input.txt', 'r')\r\nn, k = [int(item) for item in r.readline().split(' ')]\r\nt = []\r\ncont = []\r\nfor i in range(n):\r\n t.append(r.readline().rstrip())\r\nprint(t)\r\nr.close()\r\ncont = t.copy()\r\nfor i in range(k - 1):\r\n cont = do(t, n, cont).copy()\r\nw = open('output.txt', 'w')\r\nfor item in cont:\r\n w.write(f'{item}\\n')\r\nw.close()" ]

[ "from collections import Counter\n\n\ndef tree(n, E):\n N = {i:set() for i in range(1, n+1)}\n for a, b in E:\n N[a].add(b)\n N[b].add(a)\n\n if max(len(s) for s in N.values()) <= 2:\n return True\n\n D = set()\n L = Counter()\n for n, s in N.items():\n if len(s) > 1:\n continue\n D.add(n)\n p, n = n, next(iter(s))\n s = N[n]\n while len(s) == 2:\n D.add(n)\n p, n = n, next(m for m in s if m != p)\n s = N[n]\n L[n] += 1\n\n for n, s in N.items():\n if n in D:\n continue\n if L[n] == 2 and len(s) == 3:\n D.add(n)\n\n for n, s in N.items():\n if n in D:\n continue\n if sum(1 for m in s if m not in D) > 2:\n return False\n\n return True\n\n\ndef pe():\n a, b = map(int, input().split())\n return a, b\n\n\ndef main():\n n = int(input())\n E = [pe() for _ in range(n-1)]\n print('Yes' if tree(n, E) else 'No')\n\n##########\n\nimport sys\nimport time\nimport traceback\nfrom contextlib import contextmanager\nfrom io import StringIO\n\ndef log(*args, **kwargs):\n print(*args, **kwargs, file=sys.stderr)\n\n\n@contextmanager\ndef patchio(i):\n try:\n sys.stdin = StringIO(i)\n sys.stdout = StringIO()\n yield sys.stdout\n finally:\n sys.stdin = sys.__stdin__\n sys.stdout = sys.__stdout__\n\n\ndef do_test(k, test):\n try:\n log(f\"TEST {k}\")\n i, o = test\n with patchio(i) as r:\n t0 = time.time()\n main()\n t1 = time.time()\n if r.getvalue() == o:\n log(f\"OK ({int((t1-t0)*1000000)/1000:0.3f} ms)\\n\")\n else:\n log(f\"Expected:\\n{o}\"\n f\"Got ({int((t1-t0)*1000000)/1000:0.3f} ms):\\n{r.getvalue()}\")\n except Exception:\n traceback.print_exc()\n log()\n\n\ndef test(ts):\n for k in ts or range(len(tests)):\n do_test(k, tests[k])\n\n\ntests = [(\"\"\"\\\n8\n1 2\n1 3\n1 6\n6 4\n6 7\n6 5\n7 8\n\"\"\", \"\"\"\\\nYes\n\"\"\"), (\"\"\"\\\n13\n1 2\n1 3\n1 4\n2 5\n2 6\n2 7\n3 8\n3 9\n3 10\n4 11\n4 12\n4 13\n\"\"\", \"\"\"\\\nNo\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, a, b = [int(x) for x in input().split()]\r\n\r\nflag = False\r\nif b > a:\r\n a, b = b, a\r\n flag = True\r\n\r\ndef possible(n, a, b):\r\n if a > n:\r\n return False\r\n \r\n if a > 1:\r\n return b == 1\r\n \r\n if a == 1:\r\n return n >= 4 or n == 1\r\n\r\nif possible(n, a, b):\r\n print(\"YES\")\r\n mat = [['0']*n for _ in range(n)]\r\n\r\n for i in range(n-a):\r\n mat[i][i+1] = mat[i+1][i] = '1'\r\n \r\n if flag:\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j: continue\r\n if mat[i][j] == '0':\r\n mat[i][j] = '1'\r\n else:\r\n mat[i][j] = '0'\r\n \r\n for row in mat:\r\n print(''.join(row))\r\nelse:\r\n print(\"NO\")\r\n", "n, a, b = map(int, input().split())\nif min(a, b) > 1 or 1 < n < 4 and max(a, b) == 1:\n print('NO')\n exit()\nprint('YES')\nf = int(a == 1)\ng = [a, b][f]\nr = [[f] * n for i in range(n)]\nfor i in range(n):\n r[i][i] = 0\nfor i in range(n - g):\n r[i][i + 1] ^= 1\n r[i + 1][i] ^= 1\nprint('\\n'.join(map(lambda x: ''.join(map(str, x)), r)))\n", "import sys\nn,a,b = list(map(int, input().split()))\n\nif a>1 and b>1:\n\tprint('NO')\n\tsys.exit(0)\n\nif n==3 and a==1 and b==1:\n\tprint('NO')\n\tsys.exit(0)\n\nif n==2 and a==1 and b==1:\n\tprint('NO')\n\tsys.exit(0)\n\n\n\nt = [[0 for i in range(n)] for j in range(n)]\n\ncomp = max(a,b)\n\n\nfor i in range(comp-1, n-1):\n\tt[i][i+1] = 1\n\tt[i+1][i] = 1\n\nif b>1:\n\tfor i in range(n):\n\t\tfor j in range(n):\n\t\t\tif i!=j:\n\t\t\t\tt[i][j] = 1-t[i][j]\nprint('YES')\nfor i in range(n):\n\tprint(\"\".join(map(str, t[i])))\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a, b = map(int, input().split())\r\nif n == 1:\r\n ans = \"YES\"\r\n G = [[0] * n for _ in range(n)]\r\nelse:\r\n ans = \"YES\"\r\n if a == 1:\r\n if n <= 3 and b == 1:\r\n ans = \"NO\"\r\n G = [[1] * n for _ in range(n)]\r\n for i in range(n):\r\n G[i][i] = 0\r\n for i in range(n - b):\r\n G[i][i + 1] = 0\r\n G[i + 1][i] = 0\r\n elif b == 1:\r\n G = [[0] * n for _ in range(n)]\r\n for i in range(n - a):\r\n G[i][i + 1] = 1\r\n G[i + 1][i] = 1\r\n else:\r\n ans = \"NO\"\r\nprint(ans)\r\nif ans == \"YES\":\r\n for g in G:\r\n print(\"\".join(map(str, g)))", "n, a, b = map(int, input().split())\r\nz, o = ('01', '10')[a < b]\r\nn *= not (a > 1 < b or 1 < n * a * b < 4)\r\nl = [[z] * n for _ in range(n)]\r\nfor i in range(n):\r\n l[i][i] = '0'\r\nfor i in range(n - a * b):\r\n l[i][i + 1] = l[i + 1][i] = o\r\nprint(('YES', 'NO')[not n])\r\nprint('\\n'.join(map(''.join, l)))", "def solve(n,a,b):\r\n \r\n #Este primer if analiza los posibles casos que vimos en el documento\r\n #para los cuales no es posible construir la matriz de adyacencia.\r\n if min(a,b)!=1 or (a==b==1 and (n==2 or n==3)):\r\n print(\"NO\")\r\n return\r\n\r\n #En caso contrario entosces es posible crear la matriz\r\n print (\"YES\")\r\n\r\n edges=0#Almacena el valor de la cantidad de aristas que hay que introducir para lograr \r\n #la cantidad requirida de componentes conexas\r\n\r\n if a>1:#Este seria el caso donde a>1 y por tanto b=1\r\n #Estos son los valores que utilizaremos en la matriz donde la posicion i,j tiene una X\r\n #si y solo si existe una arista entre i y j\r\n X=\"1\"\r\n O=\"0\"\r\n #La cantidad de aristas que necesitamos para unir la primera componente y que \r\n #los restantes a-1 vertices formen las restantes\r\n edges=n-a\r\n else:#Este es el caso donde b>1 y por tanto a=1\r\n #Lo que hacemos aqui es lo mismo que en el if anterior solo que alternando los valores\r\n #para dar la respuesta como la del grafo complemento\r\n X=\"0\"\r\n O=\"1\"\r\n edges=n-b\r\n #Como vimos en el documento la respuesta para los dos casos anteriores pasa por el mismo algoritmo\r\n #solo con la diferencia de que para el segundo caso se deve devolver el complemento de la matriz\r\n #lo cual ya lo tuvimos previsto al intercambiar los valores de X y O.\r\n #Por tanto a partir de ahora hablaremos como si a>1 b=1 como caso general.\r\n\r\n #La primera linea contiene como primer valor '0' ya que este pertenece a la diagonal principal\r\n #si n fuera igual a 1 entonces esta fuera la solucion ya que seria la matriz de 1x1 con 0 en la \r\n #diagonal.\r\n #Luego pondremos un '0' o un '1' en dependencia de si hay que agragar alguna arista a no para \r\n #satisfacer la condicion. Las n-2 posiciones restantes se rellenan con '0'\r\n line = \"0\" + (O, X)[edges>0]*(n>1) + O * (n-2)\r\n print(line)\r\n \r\n #Este ciclo for itera n-1 veces para construir e imprimir las n-1 lineas restantes de la matriz\r\n for y in range(1, n):\r\n #La primera parte de cada linea es cero y-1 veces, luego si hay que introducir mas aristas\r\n #o igual a la cantidad de las que habian en esa lista entonces se pone un '1', en otro caso\r\n #un '0'. Luego se pone el '0' perteneciente a la diagonal\r\n line = O * (y-1) + (O, X)[y<=edges] + \"0\"\r\n #En caso de que esta sea la ultima linea entonces ya la terndriamos completa. En otro caso \r\n #faltaria por construir la parte derecha de la diagonal\r\n if y < n-1:\r\n #Para construir la parte derecha de la diagonal pondremos un '1' o '0' en dependencia de \r\n #si hubo que introducir la arista o no. El resto de la linea se rellena con '0'\r\n line += ( O, X)[y < edges] + O * (n-y-2)\r\n print(line)\r\n\r\nn,a,b=map(int,input().split())#obtine los valores de la entrada\r\nsolve(n,a,b)#ejecuta el algoritmo para resolver el problema\r\n\r\n \r\n", "n,a,b = list( map(int, input().split()))\r\n\r\nif min(a,b) >1:\r\n print('NO')\r\n exit()\r\n\r\nm = max(a,b)\r\n\r\nif m == 1:\r\n if n == 1:\r\n print('YES')\r\n print(0)\r\n exit()\r\n elif n < 4:\r\n print('NO')\r\n exit()\r\n else:\r\n print('YES')\r\n for row in range(n):\r\n line = ['0']*n\r\n if row >0:\r\n line[row-1] = '1'\r\n if row <n-1:\r\n line[row+1] = '1'\r\n print(''.join(line))\r\n exit()\r\n\r\nprint('YES')\r\n\r\nif a == 1:\r\n c = '1'\r\n d = '0'\r\nelse:\r\n c = '0'\r\n d = '1'\r\nfor row in range(n):\r\n if row < m-1:\r\n line = [c]*n\r\n else:\r\n line = [c]*(m-1)+ [d]*(n-m+1)\r\n line[row] = '0'\r\n\r\n print(''.join(line))\r\n", "n, a, b = map(int, input().split())\nif a > 1 < b or a * b == 1 and 1 < n < 4:\n print('NO')\nelse:\n z, o = ('01', '10')[a < b]\n l = [[z] * n for _ in range(n)]\n for i in range(n):\n l[i][i] = '0'\n for i in range(n - a * b):\n l[i][i + 1] = l[i + 1][i] = o\n print('YES')\n print('\\n'.join(map(''.join, l)))", "def generate_matrix(h):\n result = [[0 for x in range(h)] for y in range(h)]\n return result\n \ndef generate_m_component_matrix(h, comp):\n result = generate_matrix(h)\n for i in range(0, h - comp + 1):\n for j in range(0, h - comp + 1):\n result[i][j] = 0 if i == j else 1\n return result\n \ndef invert_matrix(h, result):\n for i in range(0, h):\n for j in range(0, h):\n result[i][j] = 1 if result[i][j] == 0 and i != j else 0\n return result\n \ndef generate_one_component_graph(h):\n result = generate_matrix(h)\n for i in range(1, h):\n result[i][i - 1] = result[i - 1][i] = 1\n return result\n \ndef print_matrix(h, matrix):\n for i in range(0, h):\n s = ''.join(str(e) for e in matrix[i])\n print(s)\n \n \nh, a, b = map(int, input().split())\nif a > 1 and b > 1:\n print('NO')\nelif a > 1:\n # generate matrix\n matrix = generate_m_component_matrix(h, a)\n print('YES')\n print_matrix(h, matrix)\nelif b > 1:\n # generate matrix and invert it\n matrix = generate_m_component_matrix(h, b)\n matrix = invert_matrix(h, matrix)\n print('YES')\n print_matrix(h, matrix)\nelse:\n if h > 3 or h == 1:\n # generate matrix with broken loop\n matrix = generate_one_component_graph(h)\n print('YES')\n print_matrix(h, matrix)\n else:\n print('NO')\n\t\t\t \t\t\t \t \t \t\t \t\t \t\t\t\t\t\t", "def main():\n n, a, b = map(int, input().split(' '))\n\n ref = True\n if a != 1 and b != 1:\n ref = False\n if n in [2, 3] and a + b == 2:\n ref = False\n\n if not ref:\n print('NO')\n return\n print('YES')\n\n if b == 1:\n mat = [[0]*1000 for i in range(1000)]\n for i in range(a, n):\n mat[i - 1][i] = 1\n mat[i][i - 1] = 1\n else:\n mat = [[-1]*1000 for i in range(1000)]\n for i in range(n):\n mat[i][i] = 0\n for i in range(b,n):\n mat[i - 1][i] = 0\n mat[i][i - 1] = 0\n\n for i in range(n):\n for j in range(n):\n print('1' if mat[i][j] else '0', end='')\n print()\n return\n\n\nif __name__ == '__main__':\n main()\n\n", "# Educational Codeforces Round 45 (Rated for Div. 2)\r\nimport collections\r\nfrom functools import cmp_to_key\r\n#key=cmp_to_key(lambda x,y: 1 if x not in y else -1 )\r\n\r\nimport sys\r\ndef getIntList():\r\n return list(map(int, input().split())) \r\n\r\n \r\n \r\n \r\nn,a,b = getIntList()\r\na0 = a\r\nb0 = b\r\nif a0>b0:\r\n a0,b0 = b,a\r\nif n==2 and (a0,b0) == (1,1):\r\n print('NO')\r\n sys.exit()\r\nif n==3 and (a0,b0) == (1,1):\r\n print('NO')\r\n sys.exit() \r\nif a>1 and b>1:\r\n print('NO')\r\n sys.exit()\r\n\r\nmat = [['0' for y in range(n)]for x in range(n)]\r\nmat1 = [['1' for y in range(n)]for x in range(n)]\r\nif b==1:\r\n for x in range(n-a):\r\n mat[x][x+1] = '1'\r\n mat[x+1][x] = '1'\r\nelse:\r\n mat = mat1\r\n for x in range(n):\r\n mat[x][x] = '0'\r\n for x in range(n-b):\r\n mat[x][x+1] = '0'\r\n mat[x+1][x] = '0'\r\n\r\nprint('YES')\r\nfor x in range(n):\r\n print(''.join(mat[x]))\r\n", "n, a, b = map(int, input().split())\r\nab, pr = ('01', '10')[a < b]\r\nn *= not (a > 1 < b or 1 < n * a * b < 4)\r\nmatrix = [[ab] * n for _ in range(n)]\r\nfor i in range(n):\r\n matrix[i][i] = '0'\r\nfor i in range(n - a * b):\r\n matrix[i][i + 1] = matrix[i + 1][i] = pr\r\nprint(('YES', 'NO')[not n])\r\nprint('\\n'.join(map(''.join, matrix)))# 1698418046.5978222", "\r\nfrom collections import defaultdict\r\n\r\nn,a,b = map(int,input().split())\r\n\r\nhash = defaultdict(list)\r\n\r\n# debug\r\n# def dfs(n):\r\n# \r\n# \r\n# bool[n] = True\r\n# for i in hash[n]:\r\n# if bool[i] == False:\r\n# dfs(i)\r\n\r\n\r\n\r\nif a == 1 and b == 1:\r\n if n == 2 or n == 3:\r\n print('NO')\r\n exit()\r\n\r\nif a == 1 or b == 1:\r\n\r\n\r\n bool = [False]*(n+1)\r\n\r\n if a>n or b>n:\r\n print('NO')\r\n exit()\r\n print('YES')\r\n\r\n l = []\r\n for i in range(n):\r\n z = ['0']*(n)\r\n l.append(z)\r\n ans = []\r\n\r\n for i in range(n):\r\n z = ['0']*(n)\r\n ans.append(z)\r\n\r\n if b == 1:\r\n\r\n\r\n\r\n\r\n for i in range(a-1,n-1):\r\n # hash[i].add(i+1)\r\n # hash[i+1].add(i)\r\n l[i][i+1] = '1'\r\n l[i+1][i] = '1'\r\n # hash[i+1].append(i)\r\n # hash[i].append(i+1)\r\n\r\n\r\n # count = 0\r\n # for i in range(n):\r\n # if bool[i] == False:\r\n #\r\n # dfs(i)\r\n # count+=1\r\n # if a == 1 and b == 1:\r\n\r\n for i in l:\r\n print(''.join(i))\r\n else:\r\n\r\n\r\n ans = []\r\n\r\n for i in range(n):\r\n z = ['0']*(n)\r\n ans.append(z)\r\n\r\n for i in range(b-1,n-1):\r\n # hash[i].add(i+1)\r\n # hash[i+1].add(i)\r\n l[i][i+1] = '1'\r\n l[i+1][i] = '1'\r\n # hash[i+1].append(i)\r\n # hash[i].append(i+1)\r\n # for i in l:\r\n # print(*i)\r\n for i in range(n):\r\n for j in range(n):\r\n if i!=j:\r\n if l[i][j] == '1':\r\n ans[i][j] = '0'\r\n if l[i][j] == '0':\r\n ans[i][j] = '1'\r\n # hash[i+1].append(j+1)\r\n # count = 0\r\n # for i in range(n):\r\n # if bool[i] == False:\r\n #\r\n # dfs(i)\r\n # count+=1\r\n\r\n\r\n for i in ans:\r\n print(''.join(i))\r\n\r\n\r\n\r\nelse:\r\n print('NO')\r\n\r\n", "n,a,b=[int(x) for x in input().split()]\r\nif min(a,b)>1 or (n,a,b) in ((2,1,1),(3,1,1)):\r\n\tprint(\"NO\")\r\nelse:\r\n\tprint(\"YES\")\r\n\tmatrix=[[0]*n for i in range(n)]\r\n\tfor i in range(0,n-max(a,b)):\r\n\t\tmatrix[i][i+1]=1\r\n\t\tmatrix[i+1][i]=1\r\n\tif a==1:\r\n\t\tfor i in range(n):\r\n\t\t\tfor j in range(n):\r\n\t\t\t\tif i!=j:\r\n\t\t\t\t\tif matrix[i][j]==1:\r\n\t\t\t\t\t\tmatrix[i][j]=0\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tmatrix[i][j]=1\r\n\tfor i in range(n):\r\n\t\tprint(*matrix[i],sep=\"\")\r\n\t" ]

[ "import math\r\nn = int(input())\r\ndis = 2\r\n\r\nfor i in range(1, n + 1):\r\n ans = (i)*(i + 1)*(i + 1) - dis/i\r\n print(int(ans))\r\n dis = math.sqrt(dis + ans*i)\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\nfrom math import*\r\n\r\n\r\nn=int(input())\r\nprev=2\r\nk=1\r\nfor i in range(1,n+1):\r\n\tvar=(i*(i+1))*(i*(i+1))\r\n\tprint((var-prev)//k)\r\n\tprev=i*(i+1)\r\n\tk+=1\r\n", "from math import sqrt\r\n\r\nminc=[i for i in range(100010)]\r\nu=[0 for i in range(100010)]\r\n\r\nfor i in range(2,100010):\r\n if u[i]:\r\n continue\r\n for j in range(i,100010,i):\r\n if j%(i*i):\r\n minc[j]=minc[j//i]*i*i\r\n else:\r\n minc[j]=minc[j//(i*i)]*i*i\r\n\r\nn=int(input().strip())\r\n\r\ncur=2\r\nfor i in range(1,n+1):\r\n new=minc[i]*(i+1)*(i+1)\r\n print((new-cur)//i)\r\n cur=int(sqrt(new))\r\n", "n = int(input())\r\nx = 2\r\ni = 1\r\nwhile i <= n:\r\n\tj = (i+1)*i\r\n\tz = j*j\r\n\tk = (z-x)/i\r\n\tprint(int(k))\r\n\tx = j\r\n\ti+=1", "n = int(input())\r\nk = 1\r\nc = 2\r\nfor i in range(n):\r\n if ((k + 1) ** 2 * k > c // k):\r\n print((k + 1)**2 * k - c // k)\r\n c = (k + 1) * k\r\n k += 1\r\n", "from math import *\r\ndef intsqrt(x):\r\n L=0\r\n R=x\r\n while R>L+1:\r\n M=(L+R)//2\r\n if M*M<=x:\r\n L=M\r\n else:\r\n R=M\r\n return R if R*R<=x else L\r\ndef D(x):\r\n d={}\r\n i=2\r\n while i*i<=x:\r\n if x%i==0:\r\n d[i]=0\r\n while x%i==0:\r\n x//=i\r\n d[i]+=1\r\n i+=1\r\n if x!=1:\r\n d[x]=1\r\n return d\r\ndef f(x):\r\n Dx0=D(x)\r\n Dx1=D(x+1)\r\n Dx1={e:2*Dx1[e] for e in Dx1.keys()}\r\n Dy={}\r\n for e in Dx0.keys():\r\n Dy[e]=Dx0[e]\r\n for e in Dx1.keys():\r\n Dy[e]=Dx1[e]\r\n for e in Dy.keys():\r\n Dy[e]+=Dy[e]%2\r\n y=1\r\n for e in Dy.keys():\r\n y*=e**Dy[e]\r\n return y\r\nn=int(input())\r\nx=2\r\nfor k in range(1,n+1):\r\n y=f(k)\r\n y*=(intsqrt(x//y)+1)**2\r\n print((y-x)//k)\r\n x=intsqrt(y)", "a=[0]*1000003\na[1]=2\nw=4\nfor q in range(2,1000003):\n a[q]+=a[q-1]+w\n w+=2\n#print(a)\n\nn=int(input())\nif n==1:\n print(2)\nelse:\n print(2)\n for q in range(2,n+1):\n print((a[q]*a[q]-a[q-1])//q)", "for i in range(1, int(input()) + 1):\n print(((i * (i + 1))**2 - (i - 1) * i) // i if i > 1 else 2)\n", "n = int(input())\r\nx = 2\r\nfor i in range(1,n + 1):\r\n t = (i*(i + 1))**2\r\n print((t - x)//i)\r\n x = i*(i + 1)", "import math\r\nn = int(input())\r\n\r\nc = 2\r\nfor i in range(1, n+1):\r\n lc = math.lcm(i, i+1)\r\n print(int((lc*lc-c)//i))\r\n c = lc\r\n\r\n", "n=int(input())\r\nl=[2]\r\ncs=2\r\nfor i in range(2,n+1):\r\n\txs=i*(i+1)\r\n\tys=xs*xs\r\n\tax=ys-cs\r\n\tax=ax//i\r\n\tcs=xs\r\n\tl.append(ax)\r\n\r\nfor i in range(len(l)):\r\n\tprint(l[i])", "print(2)\r\nfor i in range(2, int(input())+1):\r\n print(i*i*i+2*i*i+1)", "n = int(input())\r\nscore = 2;\r\ncur = 1;\r\nfor i in range(1, n + 1):\r\n target = (i * (i + 1)) ** 2\r\n diff = target - score\r\n print(diff // cur)\r\n score = i * (i + 1)\r\n cur += 1\r\n", "n = int(input())\r\ncur = 2\r\nfor i in range(1,n+1):\r\n\ttmp = ((i*(i+1))**2 - cur)/i;\r\n\ttmp = int(tmp)\r\n\tprint(tmp)\r\n\tcur = i*(i+1)\r\n", "#!/usr/bin/env python3\nimport math\nn = int(input())\nx = 2\nk = 1\nwhile k <= n:\n assert x % k == 0\n y = ((k+1) * k) ** 2\n assert x <= y and (y - x) % k == 0\n assert (y - x) // k <= 10**18\n print((y - x) // k)\n x = (k+1) * k\n k += 1\n", "n = int(input())\r\ncurr = 2 \r\nlevel = 1\r\nfor i in range(1,n+1):\r\n target = ((level + 1)**2)*(level**2)\r\n x = (target - curr)//level \r\n print(x)\r\n curr = (level+1)*(level)\r\n level += 1 \r\n\r\n\r\n\r\n ", "def main():\r\n n = int(input())\r\n print(2)\r\n for i in range(3, n+2):\r\n print(i**3-i**2-i+2)\r\n\r\n\r\n\r\nmain()", "n = int(input())\r\n\r\ncurrlevel = 2\r\ncurrnum = 2\r\n\r\nprint(2)\r\n\r\nfor i in range(1,n):\r\n\ttarget = currnum + (currlevel*2)\r\n\ttemp = target\r\n\ttarget *= target\r\n\tans = (int((target - currnum) / currlevel))\r\n\tprint(ans)\r\n\tcurrnum = temp\r\n\tcurrlevel += 1", "n=int(input())\r\nans,x,l=[],2,1\r\nwhile l<n+1:\r\n t=(l*(l+1))**2\r\n c=(t-x)//l\r\n ans.append(c)\r\n x=t**0.5\r\n x=int(x)\r\n l+=1\r\nfor i in ans:\r\n print(i)", "import math\nimport sys\nfrom collections import defaultdict\nimport heapq\nfrom collections import deque\n#input = sys.stdin.readline\nUSE_FILE = False \n\ndef search(k, v):\n p = 0\n a, n = len(v), len(v)\n while a >= 1:\n while p + a < n and k > v[p+a]:\n p += a\n a //= 2\n if k > v[p+a]:\n p += 1\n return p+1\n\nglobal maxi\nmaxi = -999999999999999 \n\ndef prnt(numbers):\n print(\"\\n\".join(map(str, numbers)))\n\ndef check(numbers):\n return sum(numbers) / 4 == (numbers[1] + numbers[2]) / 2 == numbers[-1] - numbers[0]\n\ndef find(x):\n if x != parents[x]:\n parents[x] = find(parents[x])\n return parents[x]\n\ndef union(x, y):\n rootX = find(x)\n rootY = find(y)\n if rootX != rootY:\n if ranks[rootX] > ranks[rootY]:\n parents[rootY] = rootX\n else:\n parents[rootX] = rootY\n if ranks[rootX] == ranks[rootY]:\n ranks[rootY] += 1\n\ndef rec(cur_activity, index, rest_days):\n if index == len(a):\n print(rest_days)\n return rest_days\n if a[index] == 0:\n return rec(0, index+1, rest_days+1)\n if a[index] == 1 or a[index] == 2:\n if cur_activity == a[index]:\n return rec(0, index+1, rest_days+1)\n else:\n return rec(a[index], index+1, rest_days)\n if a[index] == 3:\n if cur_activity == 0:\n result1 = rec(1, index+1, rest_days)\n result2 = rec(2, index+1, rest_days)\n return result1 + result2\n if cur_activity == 1:\n return rec(2, index+1, rest_days)\n if cur_activity == 2:\n return rec(1, index+1, rest_days)\n\ndef gcd(a, b):\n while b:\n a, b = b, a % b\n return a\n\ndef lcm(a, b):\n return abs(a * b) // gcd(a, b)\n\ndef main():\n n = int(input())\n k = 1\n current = 2 \n res = []\n while k < n+1:\n p = current // k\n presses = (k + 1) ** 2 * k - p\n current = (k + 1) * k\n k += 1\n res.append(presses)\n print(*res)\n\n\n \n\nif __name__==\"__main__\":\n if USE_FILE:\n sys.stdin = open('/home/stefan/input.txt', 'r')\n main()\n\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Feb 1 16:59:18 2022\r\n\r\n@author: sachd\r\n\"\"\"\r\n\r\nn=int(input())\r\nfor i in range(1,n+1):\r\n if i==1:\r\n print(2)\r\n else:\r\n print(i*(i+1)*(i+1)-(i-1))", "n=int(input())\r\nnum0 = 4\r\nprint(\"14\")\r\nfor i in range(2, n + 1):\r\n num1 = i * (i + 1)\r\n x = (num1 * num1 - num0)/i\r\n print(\"%d\"%x)\r\n num0 = num1\r\n", "x, a = 2, []\r\nfor i in range(1, int(input()) + 1):\r\n y = i * (i + 1)\r\n a.append((y ** 2 - x) // i)\r\n x = y\r\nprint('\\n'.join(map(str, a)))", "n = int(input())\nprint(2)\nfor i in range(2,n+1):\n x = i*(i+1)\n y = x*x-(i*(i-1))\n y/=i\n print(int(y))\n \t \t\t \t \t\t\t\t \t \t\t\t\t\t\t \t\t", "n = int(input())\r\nprint(14)\r\nz=4\r\nfor i in range(2, n+1):\r\n\tj = i+1\r\n\tt = (i * i * j * j - z) // i\r\n\tprint(t)\r\n\tz=i*(i+1)", "n=int(input());\r\nx = 2\r\nk = 1\r\nlev = 1\r\nwhile(lev<=n):\r\n k = lev\r\n lev += 1\r\n print(int((pow(lev * (lev - 1), 2)-x)/k))\r\n x = lev * (lev - 1)\n# Wed Oct 05 2022 15:54:16 GMT+0000 (Coordinated Universal Time)\n", "# import sys\n# input = sys.stdin.readline\n\nimport math\n\n\ndef solve():\n n = int(input())\n # n, A = list(map(int, input().split(\" \")))\n s = 2\n for lvl in range(1, n + 1):\n nextS = s\n i = 1\n while not (nextS % (lvl + 1) == 0 and (nextS - s) % lvl == 0):\n nextS = (s // (lvl + 1) + i) * (lvl + 1)\n i += 1\n steps = (nextS*nextS - s) // lvl\n s = nextS\n print(steps)\n\n\nt = 1\nif False:\n t = int(input())\nfor _ in range(t):\n solve()\n", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nfor k in range(2,1+int(input('2\\n'))):print(1+k*(2+k)*k)\n", "n = int(input())\r\nfor i in range(2,n+2):\r\n if i==2:\r\n print(2)\r\n else:\r\n print(i*i*(i-1)-(i-2))", "# import sys\r\n# input = sys.stdin.readline\r\n# for _ in range(int(input())):\r\nn = int(input())\r\nfor i in range(1,n+1):\r\n if i == 1:\r\n print(2)\r\n else:\r\n print(i*(i+1)*(i+1)-(i-1))", "a = int(input())\r\nprint(2)\r\nfor i in range(2, a + 1):\r\n print(i**3 + 2 * i**2 + 1)\n# Thu Oct 06 2022 10:16:04 GMT+0000 (Coordinated Universal Time)\n", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nprint(2)\nfor k in range(2,1+int(input())):print(1+k*(2+k)*k)\n", "n = int(input())\r\nprint(2)\r\nfor i in range(2,n+1):\r\n print(1 + i ** 2 * (i + 2))\r\n", "n=int(input())\r\np=1\r\nost=2\r\nfor i in range(n) :\r\n v=(p*(p+1))**2\r\n print(v//p-ost//p)\r\n ost=p*(p+1)\r\n p+=1\r\n", "n=int(input())\r\nans=[]\r\nx=2\r\nlevel=1\r\nwhile level<n+1:\r\n tar=(level*(level+1))**2\r\n cnt=(tar-x)//level\r\n ans.append(cnt)\r\n x=int(tar**0.5)\r\n level+=1\r\nprint(*ans,sep=\"\\n\")", "from math import *\r\nx=2\r\nfor i in range(int(input())):\r\n y=(i+1)*(i+2)//gcd(i+1,i+2)\r\n print((y**2-x)//(i+1))\r\n x=y", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nm = 2\r\nfor i in range(1, n+1):\r\n print(((i*(i+1))**2 - m)//i)\r\n m = i*(i+1)", "import math\r\nif __name__=='__main__':\r\n a=int(input())\r\n p=2\r\n for i in range(a):\r\n k=(i+1)*(i+1)*(i+2)*(i+2)\r\n z=(k-p)/(i+1)\r\n p=int(math.sqrt(k))\r\n print(int(z))\r\n ", "n=int(input())\ncur=2\nmx,mn=0,0\nfor i in range(2,n+2):\n pc=cur\n cur=i*(i-1)\n print((cur*cur-pc)//(i-1))\n# Sat Oct 29 2022 21:10:07 GMT+0300 (Moscow Standard Time)\n", "def solve(x):\r\n\treturn ((((x + 1) ** 2) * (x ** 2)) - (x * x - x)) / x\r\n \r\ninp = int(input(\"\"))\r\nlvl = 1\r\nprint (\"2\")\r\nwhile(inp >= 2):\r\n\tops = solve(lvl + 1)\r\n\tprint (int(ops))\r\n\tlvl = lvl + 1\r\n\tinp = inp - 1 ", "\"\"\"\nupsolving:\nbrute forcing takes too long\nparlay congruence relation\n\"\"\"\n\nimport math\n\nn = int(input())\nzs = 2\n\nfor lvl in range(1, n+1):\n print(((lvl * (lvl + 1)) ** 2 - zs) // lvl)\n zs = lvl * (lvl + 1)\n", "from sys import stdout\r\nn = int(input())\r\nstdout.write(\"2\\n\")\r\nfor lv in range(2, n + 1):\r\n stdout.write(str(lv*(lv+1)*(lv+1)-(lv-1)) + '\\n')\r\n", "x = int(input())\r\nprint(2)\r\nk = 2\r\nlast = 2\r\nfor j in range(2, x + 1):\r\n\tprint(str((k * k * (k + 1) * (k + 1) - last) // k))\r\n\tlast = k * (k + 1)\r\n\tk += 1", "for i in range(int(input())): print((i+2)*(i+2)*(i+1)-(2 if i==0 else i))", "a = int(input())\r\nprint(2)\r\nfor i in range(2, a + 1):\r\n print(i**3 + 2 * i**2 + 1)", "n = int(input())\nA = [2] + [k*(k+1)*(k+1) - (k-1) for k in range(2, n+1)]\nprint('\\n'.join(map(str, A)))\n", "from math import sqrt\r\n\r\n\r\ndef pow1(x, base):\r\n sq = 1\r\n while (base > 0):\r\n\r\n if base % 2:\r\n base -= 1\r\n sq = (sq * x) # % mod\r\n\r\n base //= 2\r\n x = (x * x) # % mod\r\n\r\n return sq\r\n\r\n\r\nn, cum, root, tem = int(input()), [4], [2], 2\r\n\r\nfor i in range(1, n + 1):\r\n print(int((cum[-1] - tem) // i))\r\n\r\n cum.append(pow1(root[-1] + (2 * (i + 1)), 2))\r\n root.append(root[-1] + (2 * (i + 1)))\r\n tem = int(root[-2])\r\n\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\ndef process(n):\r\n \"\"\"\r\n I want to get to level n+1\r\n at level 1, 2 is displayed\r\n I go to level (2+k1) which must be an even square\r\n and pushroot, \r\n so I am at level 2, with an even square\r\n then \r\n \r\n 2 (+14*1) = 16, root 4\r\n 4 (+16*2) = 36, root 6\r\n 6 (+46*3) = 144, root 12\r\n 12 (+?*4) = 400, root 20\r\n\r\n \"\"\"\r\n start = 2\r\n for k in range(1, n+1):\r\n if k==1:\r\n next_thing = 4\r\n else:\r\n next_thing = k*(k+1)\r\n entry = (next_thing**2-start)//k\r\n sys.stdout.write(str(entry)+'\\n')\r\n start = next_thing\r\n \r\n \r\nn = int(input())\r\nprocess(n)", "# cook your dish here\r\nc=2\r\ndp=[]\r\ndp.append(0)\r\nfor i in range(1,100003):\r\n dp.append(dp[i-1]+c)\r\n c+=2\r\n# print(dp)\r\nn=int(input())\r\nprint(2)\r\ni=1\r\nwhile i<n:\r\n y = dp[i+1]**2\r\n d = (y-dp[i])//(i+1)\r\n print(d)\r\n i+=1\r\n \r\n ", "n = int(input())\r\nnow, add, prev = 2, 4, 2\r\nfor i in range (1, n + 1):\r\n ans = (now * now - prev) / i\r\n print(int(ans))\r\n prev = now\r\n now += add\r\n add += 2\r\n\n# Mon Oct 03 2022 21:35:56 GMT+0000 (Coordinated Universal Time)\n", "n = int(input())\r\na = 2\r\nfor i in range(1, n + 1):\r\n b = (i * (i + 1)) * (i * (i + 1))\r\n assert (b - a) % i == 0, str(i)\r\n c = (b - a) // i\r\n print(c)\r\n a = i * (i + 1)\r\n", "from math import sqrt\n\nn = int(input())\nval = 2\n\nfor level in range(n):\n cur_level = level + 1\n t = cur_level * cur_level * (cur_level + 1) * (cur_level + 1)\n t -= val\n print(int(t / cur_level))\n val = int(sqrt(t))\n", "n = int(input())\r\na = [2] * (n + 2)\r\nfor i in range(1, n + 1):\r\n sq = i * (i + 1)\r\n a[i + 1] = sq\r\n print((a[i + 1] * a[i + 1] - a[i]) // i)", "import sys\r\nfrom fractions import gcd\r\nimport math\r\ndef lcm(x, y):\r\n return x * y // gcd(x, y)\r\n\r\ndef seive(lim):\r\n for x in range(2, lim + 1):\r\n if (len(factors[x]) == 0):\r\n factors[x].append((x, 1))\r\n for y in range(x + x, lim + 1, x):\r\n yy = y\r\n cnt = 0\r\n while (yy % x == 0):\r\n cnt += 1\r\n yy //= x\r\n factors[y].append((x, cnt))\r\nfactors =[]\r\nfor i in range(10**5 + 2):\r\n factors.append([])\r\nseive(10**5 + 1)\r\nn = int(input())\r\ncurLvl = 1\r\ncurValue = 2\r\nnxtLvl = 2\r\nans = \"\"\r\nwhile (curLvl <= n):\r\n f = factors[curLvl]\r\n x = 1\r\n for item in f:\r\n x *= item[0] ** (item[1] // 2 + item[1] % 2)\r\n x = lcm(x, nxtLvl)\r\n ans += str((x * x - curValue) // curLvl) + \"\\n\"\r\n curValue = x\r\n curLvl += 1\r\n nxtLvl += 1\r\n\r\nsys.stdout.write(ans)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "x = 2\r\nfor i in range(1, int(input()) + 1):\r\n y = i * (i + 1)\r\n print((y ** 2 - x) // i)\r\n x = y", "a=2\r\nn=0\r\nmax = int(input())\r\nfor k in range(max+1):\r\n if(k==0):\r\n continue\r\n n = k*(k+1)*(k+1)-a\r\n a=k\r\n print(n)\r\n", "print(2)\r\nfor i in range(2,int(input())+1):\r\n print(i*(i+1)*(i+1)-i+1)", "n=int(input())\nret=2\nq=2\nfor k in range(1,n+1):\n if(q%(k+1)!=0):\n q+=k+1-(q%(k+1))\n while 1:\n w=q*q\n if (w-ret)%k==0:\n print((w-ret)//k)\n ret=q\n break\n q+=k+1\n\n", "n=int(input())\r\nprint(2)\r\nfor i in range(2, n+1):\r\n\tprint(i*(i+1)*(i+1)-i+1)", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nimport math\r\n\r\nN = int(input())\r\ncur = 2\r\n\r\nfor i in range(2,N+2):\r\n t = (i-1)*i//math.gcd(i-1,i)\r\n m =t*t\r\n print((m-cur)//(i-1))\r\n cur = t\r\n\r\n \r\n \r\n", "\"\"\"\r\nCodeforces Round 372 Div 1 Problem A\r\n\r\nAuthor : chaotic_iak\r\nLanguage: Python 3.5.2\r\n\"\"\"\r\n\r\n################################################### SOLUTION\r\n\r\ndef main():\r\n n, = read()\r\n curr = 2\r\n for lv in range(1, n+1):\r\n tgt = (lv*(lv+1))**2\r\n print((tgt - curr) // lv)\r\n curr = lv*(lv+1)\r\n return\r\n\r\n#################################################### HELPERS\r\n\r\ndef read(typ=int):\r\n # None: String, non-split\r\n # Not None: Split\r\n input_line = input().strip()\r\n if typ is None:\r\n return input_line\r\n return list(map(typ, input_line.split()))\r\n\r\ndef write(s=\"\\n\"):\r\n if s is None: s = \"\"\r\n if isinstance(s, list): s = \" \".join(map(str, s))\r\n s = str(s)\r\n print(s, end=\"\")\r\n\r\nwrite(main())\r\n", "n = int(input())\r\nprint(2)\r\nfor i in range(2, n+1):\r\n print(i ** 3 + 2 * i ** 2 + 1)\r\n", "n = int(input())\r\n\r\nif n == 3:\r\n print(14)\r\n print(16)\r\n print(46)\r\n exit(0)\r\nif n == 2:\r\n print(999999999999999998)\r\n print(44500000000)\r\n exit(0)\r\nfor i in range(1, n+1):\r\n if i == 1:\r\n print(2)\r\n else:\r\n print(i*(i+1)*(i+1)-(i-1))\r\n", "\nN = int(input())\n\nx = 2\n\nfor i in range(1, N+1):\n u, v = i, i+1\n p = u**2 * v**2\n d = p - x\n z = d // u\n assert(z <= 10**18)\n print(z)\n x = u*v\n", "n = int(input())\r\nstart = 2\r\nfor i in range(1, n + 1):\r\n tmp = ((i + 1) * i) ** 2\r\n tmp -= start\r\n start = i * (i + 1)\r\n print(tmp // i)", "x=2\n\nfor i in range(1, int(input())+1):\n\n print(i*(i+1)**2-x)\n\n x=i\n\n\n\n# Made By Mostafa_Khaled", "import math\nnum = 2\nn = int(input())\nk = 1\nwhile k < n + 1:\n inc = ((k*(k + 1))**2 - num) // k\n print(inc)\n num = k * (k + 1)\n k = k + 1\n", "n=int(input())\r\n\r\nprev=1\r\nnext=2\r\ncur=2\r\n\r\nfor i in range(n):\r\n out=((prev*prev*next*next)-cur)//(i+1)\r\n print(out)\r\n cur=prev*next\r\n prev+=1\r\n next+=1\r\n", "# cook your dish here\r\n\r\nvalue = [0]*(10**5+2)\r\nc = 2\r\nfor i in range(1,10**5+1):\r\n value[i] = value[i-1]+c\r\n c = 2*(i+1)\r\ndp = [0]*(10**5+2)\r\nfor i in range(1,10**5+1):\r\n dp[i] = ((value[i]**2)-value[i-1])//i\r\ndp[1] = 2\r\nn = int(input())\r\nfor i in range(1,n+1):\r\n print(dp[i])", "\r\nn = int(input())\r\nprint(2)\r\nfor i in range(1, n):\r\n print((i+2)*(i+2)*(i+1)-i)\r\n", "n = int( input() )\nprint( 2 )\nfor i in range(2, n+1):\n print( ( i + 1 ) * ( i + 1 ) * i - ( i - 1 ) )\n", "n = int(input())\r\na = [0] * 100005\r\na[0] = 2\r\nfor i in range(1, n + 1):\r\n\ta[i] = i * (i + 1)\r\n\tprint(((a[i] * a[i]) - a[i - 1]) // i)", "#!/usr/bin/env\tpython\n#-*-coding:utf-8 -*-\nprint(2)\nn=int(input())\nfor i in range(2,1+n):print(1+i*(2+i)*i)\n", "n = int(input())\r\n\r\nfor i in range(1,n+1):\r\n if i == 1 :\r\n print(2)\r\n else :\r\n print(i*(i+1)*(i+1)-(i-1))", "N = int(input())\r\nprint(2)\r\nfor n in range(2, N+1):\r\n\tclicks = n*(n+1)**2 - (n-1)\r\n\tprint(clicks)" ]

[ "R=lambda:map(int,input().split())\r\nimport math as m\r\ns=input()\r\na=[]\r\nf=''\r\nfor i in range(1,len(s)):\r\n if(int(s[i])+int(s[i-1])==9):\r\n f+=s[i-1]\r\n else:\r\n f+=s[i-1]\r\n if(len(f)>=2):\r\n if((f[0]=='0' and f[1]=='9') or (f[0]=='9' and f[1]=='0')):\r\n a.append(len(f))\r\n elif(len(f)%2==0):\r\n a.append(1)\r\n else:\r\n a.append((len(f)+1)//2)\r\n f=''\r\nf+=s[-1]\r\n\r\nif(len(f)>=2):\r\n if((f[0]=='0' and f[1]=='9') or (f[0]=='9' and f[1]=='0')):\r\n a.append(len(f))\r\n elif(len(f)%2==0):\r\n a.append(1)\r\n else:\r\n a.append((len(f)+1)//2)\r\n\r\n\r\n\r\nans=1\r\nfor i in a:\r\n ans=ans*i\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\ns = input()[:-1]\r\nn = len(s)\r\nd = dict()\r\nf = []\r\nfor i in range(1, 10):\r\n d[str(i)] = str(9 - i)\r\n\r\ni = 0\r\nwhile i < n - 1:\r\n c = 0\r\n while i < n - 1 and d[s[i]] == s[i + 1]:\r\n i += 1\r\n c += 1\r\n\r\n if c == 0 or c % 2:\r\n i += 1\r\n else:\r\n f.append(c//2+1)\r\n i += 1\r\n\r\nx = 1\r\nfor i in f:\r\n x *= i\r\nprint(x)", "#!/usr/bin/python3\n\ndef readln(): return list(map(int, input().split()))\n\nans = 1\nl = 1\np = -1\na = input()\nfor i in range(len(a)):\n c = int(a[i])\n if c + p == 9:\n l += 1\n if c + p != 9 or i == len(a) - 1:\n if l % 2:\n ans *= (l + 1) // 2\n l = 1\n p = c\nprint(ans)\n", "def nine(s):\r\n n, result, count = len(s), 1, 1\r\n for i in range(n - 1):\r\n if int(s[i]) + int(s[i + 1]) == 9:\r\n count += 1\r\n else:\r\n if count % 2 == 1:\r\n result = result * (count // 2 + 1)\r\n count = 1\r\n if count % 2 == 1:\r\n result = result * (count // 2 + 1)\r\n return result\r\n\r\n\r\nprint(nine(input()))\r\n", "n=input()\r\nl=len(n)\r\nans=1\r\ni=0\r\nwhile(i<l):\r\n x=1 \r\n while(i<l-1 and int(n[i])+int(n[i+1])==9):\r\n x+=1 \r\n i+=1\r\n if x%2==1 and x>1:\r\n ans*=x//2+1\r\n x=1\r\n i+=1\r\nprint(ans)", "\r\nn = input()\r\ni = 0\r\ncount = 1\r\na = 1\r\nfor i in range(1,len(n)):\r\n if int(n[i]) + int(n[i-1]) == 9:\r\n count+=1\r\n elif count%2!=0:\r\n a*=count//2 + 1\r\n count = 1\r\n else:\r\n count = 1\r\nif count%2!=0:\r\n a*=count//2 + 1\r\nprint(a)\r\n", "s=input()\r\nans=1\r\nn=len(s)\r\nc=1\r\nfor i in range(1,n):\r\n #print(\"i is\",i,' and c is',c)\r\n if(int(s[i])+int(s[i-1])-2*int('0')==9):\r\n #print('s[i]+s[i-1]==9')\r\n c+=1\r\n else:\r\n #print('else')\r\n if(c%2==1 and c>1):\r\n #print('c%2==1 and c>1')\r\n ans*=(c+1)//2\r\n #print('ans is',ans)\r\n c=1\r\nif(c%2==1 and c>1):\r\n ans*=(c+1)//2\r\nprint(ans)\r\n", "a = input()\r\nn = len(a)\r\nans = 1\r\nblock = 0\r\nfor i in range(n):\r\n if i == n - 1 or int(a[i]) + int(a[i + 1]) != 9:\r\n if block > 0 and block % 2 == 0:\r\n ans *= block // 2 + 1\r\n block = 0\r\n else:\r\n block += 1\r\nprint(ans)", "a = input()\n\nans = 1\n\nLIM = 100000 + 12\nrun = [0 for i in range(LIM)]\n\nfor i in range(1, LIM, 2):\n run[i] = 1\n\nrun[0] = 1\nrun[2] = 2\nfor i in range(4, LIM, 2):\n run[i] = run[i - 2] + run[i - 3]\n\nlst = 0\nfor i in range(1, len(a)):\n sm = int(a[i]) + int(a[i - 1])\n if sm != 9:\n ans *= run[lst]\n lst = 0\n else:\n lst += 1\n\nans *= run[lst]\n\nprint(ans)\n", "s,a,c=input(),1,1\r\nfor i in range(1,len(s)):\r\n if int(s[i])+int(s[i-1])==9:\r\n c+=1\r\n elif c%2:\r\n a*=c//2+1\r\n c=1\r\n else:\r\n c=1\r\nif(c%2):\r\n a*=c//2+1\r\nprint(a)", "a=[int(i) for i in list(input())]\r\ni=0\r\ncl=[]\r\nwhile True:\r\n if i>=len(a)-1:\r\n break\r\n if a[i]+a[i+1]==9:\r\n c=1\r\n while True:\r\n if i>=len(a)-1:\r\n break\r\n if a[i]+a[i+1]==9:\r\n c+=1\r\n else:\r\n i+=1\r\n break\r\n i+=1\r\n if c%2==0:\r\n cl.append(1)\r\n else:\r\n cl.append((c+1)//2)\r\n else:\r\n i+=1\r\nt=1\r\nfor i in cl:\r\n t*=i\r\nprint(t)", "s = input()\r\n\r\np = 1\r\n\r\na = [1 for i in range(len(s))]\r\n\r\nfor i in range(1,len(s)-1):\r\n\tif(int(s[i])+int(s[i-1]) == 9 and int(s[i])+int(s[i+1]) ==9):\r\n\t\ta[i] += 1\r\nx = []\r\ni = 0\r\nwhile(i<len(s)):\r\n\t#print(i)\r\n\tc = 0\r\n\tj = i\r\n\twhile(j<len(s) and a[j] == 2):\r\n\t\tj += 1\r\n\t\tc += 1\r\n\tif(c%2 == 1):\r\n\t\tx.append((c//2) + 2)\r\n\telse:\r\n\t\tx.append(1)\r\n\ti = j+1\r\n#print(a)\r\n#print(x)\r\n\r\nfor i in range(len(x)):\r\n\tp *= x[i]\r\n\r\nprint(p)", "num=input()\r\nodd=0\r\nout=1\r\nfor i in range(1,len(num)):\r\n if(int(num[i])+int(num[i-1])==9):\r\n odd+=1\r\n elif(odd%2==0 and odd!=0):\r\n out*=odd//2+1\r\n odd=0\r\n else:\r\n odd=0\r\nif(odd%2==0 and odd!=0):\r\n out*=odd//2+1\r\nprint(out)", "a=input()\nans=1\ncount=1\nl=len(a)\nfor i in range(l-1):\n if int(a[i])+int(a[i+1])==9:\n count+=1\n else:\n if count%2:\n ans*=(count+1)//2\n count=1\nif count%2:\n ans*=(count+1)//2\nprint(ans)\n", "s, a, c = input(), 1, 1\r\nfor i in range(1, len(s)):\r\n if int(s[i]) + int(s[i-1]) == 9:\r\n c += 1\r\n elif c % 2:\r\n a *= c//2 + 1\r\n c = 1\r\n else:\r\n c = 1\r\nif(c % 2):\r\n a *= c//2 + 1\r\nprint(a)\r\n", "s,a,c=input(),1,1\r\nfor i in range(1,len(s)):\r\n if int(s[i])+int(s[i-1])==9:c+=1\r\n elif c%2:a*=c//2+1;c=1\r\n else:c=1\r\nif(c%2):a*=c//2+1\r\nprint(a)", "a = list(map(int, list(input()))) + [1 << 35]\r\n\r\nn = len(a)\r\nret = 1\r\ncnt = 1\r\nfor i in range(1, n):\r\n if a[i] + a[i - 1] == 9:\r\n cnt += 1\r\n else:\r\n if cnt & 1:\r\n ret *= cnt // 2 + 1\r\n cnt = 1\r\nprint(ret)\r\n", "s=input()\nans=0\n\ni=1\npast=int(s[0])\nc=1\nans=1\nwhile(i<len(s)):\n if(int(s[i])+past==9):\n c+=1\n past=int(s[i])\n else:\n if(c%2==1 and c!=1):\n ans*=(c//2+1)\n c=1\n past=int(s[i])\n i+=1\nif(c!=1 and c%2==1):\n ans*=(c//2+1)\n\n \nprint(ans)\n \n \n \n", "s = input()\r\nn = len(s)\r\nres = 1\r\ncnt = 1\r\nfor i in range(n-1):\r\n if int(s[i]) + int(s[i+1]) == 9:\r\n cnt+=1\r\n else:\r\n if cnt % 2 == 1:\r\n res = res * (cnt // 2 + 1)\r\n cnt = 1\r\nif cnt % 2 == 1:\r\n res = res * (cnt // 2 + 1)\r\nprint(res)\r\n", "s=input()\r\nans=1\r\nc=1\r\nfor i in range(1,len(s)):\r\n if int(s[i])+int(s[i-1])==9:\r\n c+=1\r\n elif c%2==1:\r\n ans*=c//2+1;c=1\r\n else:\r\n c=1\r\nif c%2==1:\r\n ans*=c//2+1\r\nprint(ans)", "s = input()\r\nnine = []\r\nnum = 0\r\nans = 1\r\nfor i in range(1, len(s)):\r\n if int(s[i - 1]) + int(s[i]) == 9:\r\n num += 1\r\n else:\r\n if num > 0:\r\n nine.append(num + 1)\r\n num = 0\r\nif num != 0:\r\n nine.append(num + 1)\r\nfor i in range(len(nine)):\r\n x= nine[i]\r\n if x % 2 != 0:\r\n ans = ans * (int((x + 1)/2))\r\nprint(ans)\r\n", "s = input()\r\nn = len(s)\r\ni = k = p = 1\r\nwhile i < n:\r\n while i < n and int(s[i])+int(s[i-1]) == 9:\r\n k += 1\r\n i += 1\r\n if k % 2 != 0:\r\n p *= ((k + 1) // 2)\r\n k = 1\r\n i += 1\r\n\r\nprint(p)", "a = [int(x) for x in input()]\r\n\r\nans = 1\r\n\r\nlen_run = 0\r\n\r\nfor i in range(0,len(a)-1):\r\n if a[i] + a[i+1] == 9:\r\n len_run += 1\r\n elif len_run != 0:\r\n if len_run % 2 == 0:\r\n ans *= int(len_run/2) + 1\r\n len_run = 0\r\n\r\n\r\nif len_run != 0:\r\n if len_run % 2 == 0:\r\n ans *= int(len_run/2) + 1\r\n\r\nprint(ans)" ]

[ "def vasya_and_physcult(count, a_str, b_str):\r\n size = int(count)\r\n a = list(map(int, a_str.split()))\r\n b = list(map(int, b_str.split()))\r\n changes_count = 0\r\n result = \"\"\r\n for i in range(size):\r\n current_index = i\r\n for j in range(i,size):\r\n if b[j] == a[i]:\r\n current_index = j\r\n break\r\n while current_index>i:\r\n b[current_index], b[current_index-1] = b[current_index-1], b[current_index-1]\r\n result += \"\\n\" + f\"{current_index} {current_index+1}\"\r\n changes_count+=1\r\n current_index-=1\r\n return str(changes_count) + result\r\n\r\ncount = input()\r\na = input()\r\nb = input()\r\n\r\nprint(vasya_and_physcult(count, a, b))", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nx = []\r\ny = []\r\nf = 0\r\nfor i in range(n):\r\n for j in range(i,n):\r\n if a[i] == b[j]:\r\n f = j\r\n break\r\n# print(f)\r\n for j in range(f, i, -1):\r\n temp = b[j]\r\n b[j] = b[j-1]\r\n b[j-1] = temp\r\n x.append(j-1)\r\n y.append(j)\r\nprint(len(x))\r\nfor i in range(len(x)):\r\n print(x[i]+1, y[i]+1)", "import math\r\nimport random\r\nfrom datetime import datetime\r\n\r\nnow = datetime.now()\r\n\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#print(i,j)\r\n \r\n \r\n #print(vector_rasp)\r\n set_prime=set(vector_rasp[2:len(vector_rasp)])\r\n set_prime.remove(0)\r\n return list(set_prime)\r\n \r\n \r\n \r\n\t#print(sume_disponibile)\r\n \r\n \r\n#res = list(map(int, str(num))) \r\nrasp_final=\"\" \r\n \r\n#print(1000000000000000000 - 27322)\r\n#print(\"aici\",173788420792057536 /(769449696/2))\r\n#print(1000000000/ 1024)\r\n\r\ndictionar={}\r\ndictionar[0]=0\r\ndictionar[1]=1\r\n\r\n\r\npalindrom=[]\r\npalindrom.append(0)\r\npalindrom.append(1)\r\ncontor=2\r\n\r\n\r\n\r\n \r\n\r\n \r\n#cazuri=int(input())\r\nfor tt in range(1):\r\n #p,q=list(map(int,input().split()))\r\n# p=10**18\r\n #q=(10**9)\r\n #print(p,q)\r\n n=int(input())\r\n bloc=list(map(int,input().split()))\r\n lista=list(map(int,input().split()))\r\n cate=0\r\n answ=''\r\n \r\n \r\n for i in range(n):\r\n if bloc[i]!=lista[i]:\r\n # print(\"i=\",i)\r\n # print(lista)\r\n for j in range(i+1,n):\r\n if lista[j]==bloc[i]:\r\n for z in range(j-1,i-1,-1):\r\n \r\n #print(\"i=\",i,\"z=\",z)\r\n cate+=1\r\n answ+=str(z+1)+\" \"+str(z+2)+\"\\n\"\r\n # print(z+1,z+2)\r\n c=lista[z+1]\r\n lista[z+1]=lista[z]\r\n lista[z]=c\r\n # print(lista)\r\n break\r\n print(cate)\r\n print(answ)\r\n \r\n #print(lista) \r\n \r\n \r\n", "import sys\r\n\r\nn = int(sys.stdin.readline ())\r\na= [int (x) for x in sys.stdin.readline ().split ()]\r\nassert len(a) == n\r\n\r\nb = [int (x) for x in sys.stdin.readline ().split ()]\r\nassert len(b) == n\r\n\r\nans = []\r\n\r\nfor i in range (n):\r\n j = i;\r\n while b[j] != a[i] :\r\n j += 1\r\n while j > i:\r\n ans += [(j, j + 1)]\r\n b[j - 1], b[j] = b[j], b[j - 1]\r\n j -= 1\r\nprint (len(ans))\r\nfor p, q in ans:\r\n print (p, + q)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nmoves = []\r\n\r\nfor i in range(n):\r\n\tfor j in range(i, n):\r\n\t\tif a[i] == b[j]:\r\n\t\t\tfor k in range(j-i):\r\n\t\t\t\tmoves.append((j+1-k, j-k))\r\n\t\t\tb = [b[j]] + b[:j] + b[j+1:]\r\n\t\t\tbreak\r\n\r\nprint(len(moves))\r\nfor move in moves:\r\n\tprint(f\"{move[1]} {move[0]}\")", "\r\ndef sor(t):\r\n\r\n f=[]\r\n for i in range(n):\r\n for j in range(n-i-1):\r\n\r\n if t[j]>t[j+1]:\r\n t[j],t[j+1] = t[j+1],t[j]\r\n f.append([j+1,j+2])\r\n return f\r\n\r\nn= int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\nb= list(map(int,input().split()))\r\n\r\n\r\nif a==b:\r\n print(0)\r\nelse:\r\n \r\n\r\n A=sor(b)\r\n\r\n\r\n A+=sor(a)[::-1]\r\n\r\n print(len(A))\r\n for j in A:\r\n print(*j)\r\n\r\n\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nl = []\r\ni1 = -1\r\nfor i in range(n):\r\n if a[i] == b[i]:\r\n continue\r\n else:\r\n for j in range(i+1, n):\r\n if a[i] == b[j]:\r\n i1 = j\r\n break\r\n # print('i->', i, ' i1->', i1)\r\n for j in range(i1, i, -1):\r\n # print('j->', j)\r\n l.append(j)\r\n l.append(j+1)\r\n b[j], b[j-1] = b[j-1], b[j]\r\nprint(len(l)//2)\r\nfor i in range(0, len(l)-1, 2):\r\n print(l[i], l[i+1])\r\n", "def main():\r\n\tn = int(input())\r\n\ta = list(map(int, input().split()))\r\n\tb = list(map(int, input().split()))\r\n\r\n\tprocess = []\r\n\tfor i in range(n):\r\n\t\tind = []\r\n\t\tfor j in range(i, n):\r\n\t\t\tif a[i] == b[j]:\r\n\t\t\t\tind.append(j)\r\n\t\ttarget = ind[0]\r\n\r\n\t\tfor j in range(target, i, -1):\r\n\t\t\tb[j], b[j - 1] = b[j - 1], b[j]\r\n\t\t\tprocess.append([j, j + 1])\r\n\r\n\tprint(len(process))\r\n\tfor el in process:\r\n\t\tprint(*el)\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "def rangtolist(dv,l,r):\r\n\tmv=[]\r\n\tfor c in range(r,l,-1):\r\n\t\tmv.append((c-1,c))\r\n\treturn mv,left(dv,l,r)\r\n\r\ndef left(dv,l,r):\r\n\tnv=dv[:l]\r\n\tnv+=dv[r:r+1]\r\n\tnv+=dv[l:r]\r\n\tnv+=dv[r+1:]\r\n\treturn nv\r\n\t\r\ndef pr(v):\r\n\tprint('***')\r\n\tfor c in v:\r\n\t\tprint(c,end=' ')\r\n\tprint('\\n***')\r\n\r\nn=int(input())\r\nsv=list(map(int,input().split(' ')))\r\ndv=list(map(int,input().split(' ')))\r\nmv=[]\r\nfor c in range(n):\r\n\tdx=dv.index(sv[c],c)\r\n\t#print('>>',c,dx)\r\n\tif dx==c:\r\n\t\tcontinue\r\n\ttv,dv=rangtolist(dv,c,dx)\r\n\tmv+=tv\r\n\t#pr(dv)\r\nprint(len(mv))\r\nfor c in mv:\r\n\tprint('{} {}'.format(c[0]+1,c[1]+1))\r\n#print(dv)\r\n\r\n\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = [0]\r\nfor i in range(n):\r\n ai = a[i]\r\n x = b[i:].index(ai) + i\r\n for j in range(x, i, -1):\r\n b[j], b[j - 1] = b[j - 1], b[j]\r\n ans.append((j, j + 1))\r\nans[0] = str(len(ans) - 1)\r\nfor i in range(1, len(ans)):\r\n ans[i] = \" \".join(map(str, ans[i]))\r\nsys.stdout.write(\"\\n\".join(ans))", "\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\n\r\nans=[]\r\ni=0\r\nwhile(i<n-1):\r\n for j in range(i,n):\r\n if l2[j]==l1[i]:\r\n for k in range(j,i,-1):\r\n ans.append([k,k+1])\r\n l2[k],l2[k-1]=l2[k-1],l2[k]\r\n \r\n break\r\n i+=1\r\n \r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)\r\n \r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=[]\r\nfor i in range(n-1):\r\n for j in range(i,n):\r\n if b[j]==a[i]:\r\n for k in range(j,i,-1):\r\n c.append([k,k+1])\r\n b[k],b[k-1]=b[k-1],b[k]\r\n break\r\nprint(len(c))\r\nfor i in c:\r\n print(*i)", "import sys\r\nfrom array import array # noqa: F401\r\n\r\n\r\ndef input():\r\n return sys.stdin.buffer.readline().decode('utf-8')\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nans = []\r\n\r\nfor i in range(n):\r\n j = b.index(a[i], i)\r\n while i < j:\r\n ans.append(f'{j} {j+1}')\r\n b[j - 1], b[j] = b[j], b[j - 1]\r\n j -= 1\r\n\r\nprint(len(ans))\r\nprint('\\n'.join(ans))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nd = []\r\nfor i in range(n):\r\n x = b.index(a[i])\r\n for j in range(x+i, i, -1):\r\n d.append((j, j+1))\r\n b = b[:x] + b[x+1:]\r\nprint(len(d))\r\nfor i in d:\r\n print(*i)", "import sys\r\nn= int(input()) \r\narr2 = [int(x) for x in input().split()] \r\narr = [int(x) for x in input().split()] \r\nans = [] \r\nans2 = []\r\nfor i in range(n-1): \r\n # range(n) also work but outer loop will repeat one time more than needed. \r\n \r\n # Last i elements are already in place \r\n for j in range(0, n-i-1): \r\n \r\n # traverse the array from 0 to n-i-1 \r\n # Swap if the element found is greater \r\n # than the next element \r\n if arr[j] > arr[j+1] : \r\n arr[j], arr[j+1] = arr[j+1], arr[j] \r\n ans.append((j,j+1)) \r\n \r\nfor i in range(n-1): \r\n # range(n) also work but outer loop will repeat one time more than needed. \r\n \r\n # Last i elements are already in place \r\n for j in range(0, n-i-1): \r\n \r\n # traverse the array from 0 to n-i-1 \r\n # Swap if the element found is greater \r\n # than the next element \r\n if arr2[j] > arr2[j+1] : \r\n arr2[j], arr2[j+1] = arr2[j+1], arr2[j] \r\n ans2.append((j,j+1)) \r\nprint(len(ans) +len(ans2)) \r\nfor i in range(len(ans)): \r\n print(ans[i][0]+1,ans[i][1]+1) \r\nfor i in range(len(ans2)-1,-1,-1):\r\n print(ans2[i][0]+1,ans2[i][1]+1) \r\n\r\n", "number = int(input())\norigin = list(input().split())\narray = list(input().split())\n\npositions = {}\n\npre = []\nlast = []\n\nresult = 0\n\nfor i in range(number):\n\tif origin[i] == array[i]:\n\t\tcontinue\n\telse:\n\t\tj = i + 1\n\t\tindex = len(pre)\n\t\tfor j in range(i+1, number):\n\t\t\tpre.insert(index,j+1)\n\t\t\tlast.insert(index,j)\n\t\t\tif array[j] == origin[i]:\n\t\t\t\tbreak\n\n\t\tarray[i+1: j+1] = array[i:j]\n\t\tresult += j - i\n\nprint(result)\nfor i in range(len(pre)):\n\tprint(str(last[i])+\" \"+str(pre[i]))\n\n\n\n\n# Made By Mostafa_Khaled", "n = int(input())\r\noriginal = list(input().split())\r\ngiven = list(input().split())\r\n\r\npre = []\r\nlast = []\r\n\r\nresult = 0\r\n\r\nfor i in range(n):\r\n if original[i] == given[i]:\r\n continue\r\n else:\r\n j = i + 1\r\n index = len(pre)\r\n for j in range(i + 1, n):\r\n pre.insert(index, j + 1)\r\n last.insert(index, j)\r\n if given[j] == original[i]:\r\n break\r\n\r\n given[i + 1: j + 1] = given[i:j]\r\n result += j - i\r\n\r\nprint(result)\r\nfor i in range(len(pre)):\r\n print(str(last[i]) + \" \" + str(pre[i]))\r\n", "n = int(input())\r\nls1 = list(map(int,input().split()))\r\nls2 = list(map(int,input().split()))\r\nout = []\r\ni, j = 0, 0\r\nwhile i < n :\r\n while j < n and ls2[j] != ls1[i] :\r\n j += 1\r\n while j != i :\r\n temp = ls2[j]\r\n ls2[j] = ls2[j-1]\r\n ls2[j-1] = temp\r\n out.append([j,j+1])\r\n j -= 1\r\n i += 1\r\n j += 1\r\nprint(len(out))\r\nfor i in out :\r\n print(i[0],i[1])", "n = int(input())\r\nstart = []\r\nend = []\r\ns1 = input().split(' ')\r\ns2 = input().split(' ')\r\n\r\nfor i in range(n):\r\n start.append(int(s1[i]))\r\n end.append(int(s2[i]))\r\n\r\nq = 0\r\nstring = \"\"\r\nfor i in range(n):\r\n if start[i]!=end[i]:\r\n for j in range(i+1, n):\r\n if end[j]==start[i]:\r\n for k in range(j-i):\r\n end[j-k], end[j-k-1] = end[j-k-1], end[j-k]\r\n string+=str(j-k)+\" \"+str(j-k+1)+\"\\n\";\r\n q+=1\r\n #print(end)\r\n break\r\n\r\nprint(q)\r\nprint(string)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\ncnt=0 \r\nans=[]\r\nfor i in range(n):\r\n if a[i]==b[i]:\r\n continue \r\n #print(b)\r\n j=i \r\n while j<n and b[j]!=a[i]:\r\n j+=1 \r\n while j>i:\r\n \r\n b[j],b[j-1]=b[j-1],b[j]\r\n ans.append([j,j+1])\r\n j-=1 \r\n # print(b)\r\nprint(len(ans))\r\nfor i in range(len(ans)):\r\n print(ans[i][0],ans[i][1])\r\n'''\r\n \r\n1 2 3 2 \r\n3 2 1 2 \r\n\r\nind=2 \r\ni=0 \r\n2 1 \r\n1 0 \r\n1 3 2 2\r\n\r\n1 2 3 2 \r\n\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\nimport copy\ninput = lambda: sys.stdin.readline().rstrip()\n\nn,m=map(int,input().split())\narr=list(map(int,input().split()))\nval = 0\nfor _ in range(m):\n opt=list(map(int,input().split()))\n if opt[0]==3:\n print(arr[opt[1]-1]+val)\n elif opt[0]==1:\n arr[opt[1]-1]=opt[2]-val\n else:\n val+=opt[1]\n\n", "n, m = map(int, input().split())\n\narr = [int(x) for x in input().split()]\n\ntotal = 0\n\nfor _ in range(m):\n op = [int(x) for x in input().split()]\n\n if op[0] == 1:\n idx = op[1]-1\n arr[idx] = op[2]-total\n elif op[0] == 2:\n total += op[1]\n else:\n idx = op[1]-1\n print(arr[idx]+total)\n", "# https://codeforces.com/contest/315/problem/B\nimport sys\nreader = (s.rstrip() for s in sys.stdin)\ninput = reader.__next__\n# do magic here\nt = 1\nfor _ in range(t):\n n, q = map(int, input().split())\n arr = list(map(int, input().split()))\n sums = [0]\n lastAssign = [[x, 1] for x in arr]\n while q:\n ops = list(map(int, input().split()))\n if ops[0] == 1:\n ind = ops[1] - 1\n val = ops[2]\n lastAssign[ind] = [val, len(sums)]\n elif ops[0] == 2:\n sums.append(sums[-1]+ops[1])\n else:\n ind = ops[1] - 1\n till = lastAssign[ind][1]\n init = lastAssign[ind][0]\n print(init + sums[-1] - sums[till-1])\n q -= 1\n", "n,m=map(int,input().split())\r\nA=[0]+[int(x) for x in input().split()]\r\nQ=0\r\nAnswer=[]\r\nfor i in range(m):\r\n temp=[int(x) for x in input().split()]\r\n if temp[0]==1:\r\n v=temp[1]\r\n x=temp[2]\r\n A[v]=x-Q\r\n elif temp[0]==2:\r\n y=temp[1]\r\n Q+=y\r\n elif temp[0]==3:\r\n q=temp[1]\r\n Answer.append(str(Q+A[q]))\r\n# print(A)\r\nprint(\"\\n\".join(Answer))\r\n ", "from sys import stdin\nn,c=map(int,input().split())\nl=list(map(int,stdin.readline().split()))\nx=0\nfor _ in range(c):\n m=list(map(int,stdin.readline().split()))\n if(m[0]==3):\n print(l[m[1]-1]+x)\n elif(m[0]==1):\n l[m[1]-1]=m[2]-x\n else:\n x+=m[1]\n \t \t \t \t \t \t\t\t \t \t \t \t \t", "def op1(arr, idx, v):\r\n arr[idx - 1] = v\r\n\r\n\r\ndef op3(arr, q, inc):\r\n return arr[q - 1] + inc\r\n\r\n\r\n# increment\r\ninc = 0\r\n\r\nn, m = [int(i) for i in input().split()]\r\n\r\n# array\r\narr = [int(i) for i in input().split()]\r\n\r\nfor _ in range(m):\r\n inp = [int(i) for i in input().split()]\r\n op = inp[0]\r\n\r\n if op == 1:\r\n v, x = inp[1:]\r\n op1(arr, v, x - inc)\r\n elif op == 2:\r\n y = inp[1]\r\n inc += y\r\n else:\r\n q = inp[1]\r\n print(op3(arr, q, inc))\r\n", "n, m = [int(i) for i in input().split()]\r\na = [int(i) for i in input().split()]\r\n\r\nl = 0\r\n\r\nfor _ in range(m):\r\n inp = [int(i) for i in input().split()]\r\n if inp[0] == 1:\r\n a[inp[1]-1]=inp[2]-l\r\n elif inp[0] == 2:\r\n l += inp[1]\r\n else:\r\n print(a[inp[1]-1]+l)", "n, m = [int(k) for k in input().split()]\r\narr = [int(k) for k in input().split()]\r\nops = []\r\n\r\nfor _ in range(m):\r\n ops.append([int(k) for k in input().split()])\r\n\r\ndef sereja(arr, ops):\r\n arr = [0] + arr\r\n res = []\r\n t = 0\r\n\r\n for el in ops:\r\n if el[0] == 1:\r\n v, x = el[1], el[2]\r\n arr[v] = x - t\r\n elif el[0] == 2:\r\n t += el[1]\r\n else:\r\n cur = arr[el[1]]\r\n res.append(cur + t)\r\n\r\n return res\r\n\r\nres = sereja(arr, ops)\r\n\r\nfor el in res:\r\n print(el)", "n,m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\n\r\nquery = []\r\nfor _ in range(m):\r\n query.append([int(x) for x in input().split()])\r\n\r\nadd = [0 for i in range(n)]\r\nnetadd = 0\r\nfor q in query:\r\n\r\n t = q[0]\r\n v = q[1]\r\n x = 0\r\n if len(q) == 3:\r\n x = q[2]\r\n if t == 3:\r\n print(arr[v -1]+netadd - add[v-1])\r\n elif t == 2:\r\n netadd += v\r\n else:\r\n arr[v-1] = x\r\n add[v-1] = netadd\r\n", "casos = input().split()\narr = input().split()\n\nsoma = 0\n\nfor i in range(int(casos[1])):\n op = input().split()\n\n if op[0] == '1':\n arr[int(op[1])-1] = int(op[2]) - soma\n elif op[0] == '2':\n soma += int(op[1])\n else:\n print(int(arr[int(op[1])-1]) + soma)\n \t \t \t\t \t\t \t \t\t \t \t \t", "n, m = map(int, input().split())\nnumeros = list(map(int, input().split()))\nsoma = 0\n\nfor _ in range(m):\n operacao = list(map(int, input().split()))\n if operacao[0] == 1:\n numeros[operacao[1] - 1] = operacao[2] - soma\n elif operacao[0] == 2:\n soma += operacao[1]\n else:\n print(soma + numeros[operacao[1] - 1])\n\n\t \t\t \t\t\t \t\t \t\t\t \t\t \t \t \t\t\t", "n,m=map(int,input().split())\r\na=[0]+[*map(int,input().split())]\r\nx=[[*map(int,input().split())] for _ in ' '*m]\r\ns=''\r\nfor i in range(m):\r\n if x[i][0]==1:\r\n a[x[i][1]]=x[i][2]-a[0]\r\n elif x[i][0]==2:\r\n a[0]+=x[i][1]\r\n elif x[i][0]==3:\r\n s+=str(a[x[i][1]]+a[0])+'\\n'\r\nprint(s)", "n,m=map(int,input().split())\r\nl = list(map(int, input().split()))\r\nsum = 0\r\ns = ''\r\nfor i in range(m):\r\n cur = list(map(int, input().split()))\r\n if cur[0] == 1 :\r\n l[cur[1] - 1] = cur[2] - sum\r\n if cur[0] == 2 :\r\n sum = sum + cur[1]\r\n if cur[0] == 3 :\r\n s+=str(l[cur[1]-1]+sum)+'\\n'\r\nprint(s)", "n,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl=[0]+l\r\nl1=[]\r\nfor i in range(m):\r\n\tl1+=[list(map(int,input().split()))]\r\nk=0\r\nfor i in l1:\r\n\r\n\tif i[0]==1:\r\n\t\tl[i[1]]=i[2]\r\n\t\t\r\n\t\tl[i[1]]-=k\r\n\telif i[0]==2:\r\n\t\tk+=i[1]\r\n\r\n\telse:\r\n\t\tprint(l[i[1]]+k)", "from sys import stdin, stdout\r\nn, m = map(int, stdin.readline().split())\r\narr = [int(i) for i in stdin.readline().split()]\r\nres = 0\r\nfor i in range(m):\r\n b = [int(x) for x in stdin.readline().split()]\r\n if b[0] == 1:\r\n arr[b[1] - 1] = b[2] - res\r\n elif b[0] == 2:\r\n res += b[1]\r\n else:\r\n stdout.write(str(arr[b[1] - 1] + res)+\"\\n\")\r\n", "n,m=map(int,input().split())\r\nl=[int(x) for x in input().split()]\r\ncurr=0\r\nfor _ in range(m):\r\n temp=input().split()\r\n if temp[0]==\"1\":\r\n x=int(temp[1])\r\n y=int(temp[2])\r\n l[x-1]=y\r\n l[x-1]=l[x-1]-curr\r\n elif temp[0]==\"2\":\r\n curr+=int(temp[1])\r\n else:\r\n x=int(temp[1])\r\n print(l[x-1]+curr)", "i_nm = input().split()\nn,m = int(i_nm[0]), int(i_nm[1])\na = list(map(int, input().split()))\n \nvalues = []\nfor i in range(m):\n values.append([int(x) for x in input().split()])\n \ncount = 0\nfor e in values:\n if e[0] == 1:\n v = e[1]\n x = e[2]\n a[v - 1] = x - count\n elif e[0] == 2:\n y = e[1]\n count += y\n elif e[0] == 3:\n print(a[e[1] - 1] + count)\n \t\t \t \t\t \t \t\t\t \t\t\t\t\t\t", "from sys import stdin, stdout\r\nm=int(input().split()[1])\r\na=[int(x) for x in stdin.readline().split()]\r\ns=0\r\nfor i in range(m):\r\n x=[int(x) for x in stdin.readline().split()]\r\n if x[0]==1:\r\n a[x[1]-1]=x[2]-s\r\n elif x[0]==2:\r\n s+=x[1]\r\n else:\r\n print(a[x[1]-1]+s)", "from collections import Counter, defaultdict\r\n\r\n\r\ndef ncr(n, r):\r\n x = 1\r\n for i in range(n, n-r, -1):\r\n x *= i\r\n y = 1\r\n for i in range(1, r+1):\r\n y *= i\r\n return x//y\r\n\r\n\r\ndef solve():\r\n n, m = list(map(int, input().split()))\r\n arr = list(map(int, input().split()))\r\n x = 0\r\n for _ in range(m):\r\n q = list(map(int, input().split()))\r\n if q[0] == 3:\r\n print(arr[q[1]-1]+x)\r\n elif q[0] == 2:\r\n x += q[1]\r\n else:\r\n arr[q[1]-1] = q[2]-x\r\n\r\n\r\nfor _ in range(1):\r\n # print(solve())\r\n solve()\r\n", "n,m =input().split()\r\nn=int(n)\r\nm=int(m)\r\narr=input().split()\r\narr=[int(x) for x in arr]\r\nquery2=0\r\nfor i in range(m):\r\n q=input().split()\r\n q=[int(x) for x in q]\r\n if q[0]==1:\r\n arr[q[1]-1]=q[2]-query2\r\n elif q[0]==2:\r\n query2+=q[1]\r\n elif q[0]==3:\r\n print(arr[q[1]-1]+query2)", "n, m = map(int, input().split(\" \"))\nnums = list(map(int, input().split(\" \")))\n\ncumsum = 0\n\nfor i in range(m):\n op = list(map(int, input().split(\" \")))\n if op[0] == 1:\n nums[op[1] - 1] = op[2] - cumsum\n elif op[0] == 2:\n cumsum += op[1]\n else:\n print(nums[op[1] - 1] + cumsum)", "n,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nbase=0\r\nfor i in range(m):\r\n b=list(map(int,input().split()))\r\n if b[0]==1:\r\n a[b[1]-1]=b[2]-base\r\n elif b[0]==2:\r\n base+=b[1]\r\n else:\r\n print(a[b[1]-1]+base)\r\n", "'''\r\nhttps://codeforces.com/problemset/problem/315/B\r\n'''\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n change_time = [0 for i in range(n)]\r\n change_cur_time = 0\r\n pref = [0]\r\n\r\n for i in range(m):\r\n query = input().split()\r\n if query[0] == '1':\r\n v, x = map(int, query[1:])\r\n a[v - 1] = x\r\n change_time[v - 1] = change_cur_time\r\n if query[0] == '2':\r\n y = int(query[1])\r\n pref.append(pref[-1] + y)\r\n change_cur_time += 1\r\n if query[0] == '3':\r\n\r\n q = int(query[1])\r\n print(a[q-1] + pref[change_cur_time] - pref[change_time[q-1]])\r\n\r\nsolve()", "array_operations = input().split()\r\n\r\nvazio=[]\r\narray = [int(x) for x in input().split()]\r\ncounter = 0\r\noperations = []\r\n\r\n\r\n# for operation in range(int(array_operations[1])):\r\n# operations.append(input().split())\r\n\r\nfor i in range(int(array_operations[0])):\r\n vazio.append(0)\r\n\r\n###\r\nfor index in range(int(array_operations[1])):\r\n operations = input().split()\r\n if operations[0] == '1':\r\n array[int(operations[1]) - 1] = int(operations[2])\r\n vazio[int(operations[1]) - 1] = counter\r\n\r\n elif operations[0] == '2':\r\n \r\n counter += int(operations[1])\r\n elif operations[0] == '3':\r\n print(array[int(operations[1]) - 1] + (counter - vazio[int(operations[1]) - 1]))\r\n\r\n\r\n", "from sys import *\r\ninput = stdin.readline\r\nn,m=map(int,input().split())\r\narr=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(m):\r\n a = list(map(int,input().split()))\r\n if len(a)==2:\r\n t=a[0]\r\n if t==3:\r\n q=a[1]\r\n elif t==2:\r\n y=a[1] \r\n elif len(a)==3:\r\n t,v,x=a\r\n \r\n\r\n if t==1:\r\n # v,x=map(int,input().split())\r\n arr[v-1]=x-count\r\n\r\n elif t==2:\r\n # y=int(input())\r\n count+=y\r\n \r\n \r\n elif t==3:\r\n # q=int(input())\r\n print(arr[q-1]+count)", "n, m = [int(x) for x in input().split()]\nnums = [int(x) for x in input().split()]\nacum = 0\n\nfor i in range(m):\n x = [int(x) for x in input().split()]\n\n if x[0] == 1:\n nums[x[1]- 1] = x[2] - acum\n\n if x[0] == 2:\n acum += x[1]\n\n if x[0] == 3:\n print(nums[x[1] - 1] + acum)\n \t \t \t\t\t\t \t\t\t \t\t\t \t \t \t\t \t\t", "import sys\ndef main():\n n,m=list(map(int, sys.stdin.readline().split()))\n arr=[-1] + list(map(int, sys.stdin.readline().split()))\n cnt=0\n for i in range(m):\n op=list(map(int, sys.stdin.readline().split()))\n if op[0]==1:\n arr[op[1]]=op[2]-cnt\n elif op[0]==2:\n cnt+=op[1]\n else:\n print(arr[op[1]]+cnt)\nmain()\n", "_, m = map(int, input().split(\" \"))\r\nvalores = list(map(int, input().split(\" \")))\r\nacumulador_de_incrementos = 0\r\n\r\nfor _ in range(m):\r\n operacao = list(map(int, input().split(\" \")))\r\n \r\n if operacao[0] == 1:\r\n valores[operacao[1] - 1] = operacao[2] - acumulador_de_incrementos\r\n elif operacao[0] == 2:\r\n acumulador_de_incrementos += operacao[1]\r\n else:\r\n print(valores[operacao[1] - 1] + acumulador_de_incrementos)\r\n \r\n \r\n ", "n, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\noperations = []\r\ntotal_add = 0\r\n\r\nfor _ in range(m):\r\n t, *args = map(int, input().split())\r\n if t == 1:\r\n v, x = args\r\n a[v - 1] = x - total_add\r\n elif t == 2:\r\n y = args[0]\r\n total_add += y\r\n else:\r\n q = args[0]\r\n print(a[q - 1] + total_add)\r\n", "n,m= map(int,input().split())\r\na= list(map(int,input().split()))\r\nb=0\r\ns=''\r\nfor _ in range(m):\r\n l= list(map(int,input().split()))\r\n if l[0]==3:\r\n s+=str(a[l[1]-1]+b)+'\\n'\r\n elif l[0]==2:\r\n b+=l[1]\r\n elif l[0]==1:\r\n a[l[1]-1]= l[2]-b\r\nprint(s)", "import sys\r\n\r\n\r\ninput=lambda:sys.stdin.readline().strip()\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nt=0\r\nout=[]\r\nfor _ in range(m):\r\n\top,v,*o=map(int,input().split())\r\n\tif op==1:a[v-1]=o[0]-t\r\n\tif op==2:t+=v\r\n\tif op==3:out.append(str(a[v-1]+t))\r\nprint('\\n'.join(out))", "n,q=map(int,input().split())\na=list(map(int, input().split()))\nb=0\ns=''\nfor i in range(q):\n l=list(map(int, input().split()))\n if l[0]==3:\n s+=str(a[l[1]-1]+b)+'\\n'\n elif l[0]==2:\n b+=l[1]\n elif l[0]==1:\n a[l[1]-1]= l[2]-b\nprint(s)\n", "n,m=map(int,input().split())\r\nx=list(map(int,input().split()))\r\nz=[0]*n\r\nc=0\r\nfor i in range(m):\r\n y=list(map(int,input().split()))\r\n if y[0]==1:\r\n z[y[1]-1]=c\r\n x[y[1]-1]=y[2]\r\n elif y[0]==2:\r\n c+=y[1]\r\n else:\r\n print(x[y[1]-1]+c-z[y[1]-1])\r\n", "entrada = input().split()\n\nsize = int(entrada[0])\noperations = int(entrada[1])\n\narray = [int(valor) for valor in input().split()]\naux = 0\n\nfor i in range(operations):\n\n to_do = [int(valor) for valor in input().split()]\n\n if(to_do[0] == 3):\n print(array[to_do[1]-1] + aux)\n\n elif(to_do[0] == 2):\n aux += to_do[1]\n\n elif(to_do[0] == 1):\n array[to_do[1]-1] = to_do[2] - aux\n\t\t\t \t\t \t \t \t\t\t\t\t \t \t\t\t\t \t\t \t", "I = lambda: map(int, input().split())\r\n \r\n_, m = I()\r\nA = list(I())\r\ns = ''\r\nd = 0\r\n \r\nfor _ in range(m):\r\n t, *X = I()\r\n if t==1:\r\n A[X[0]-1] = X[1] - d\r\n elif t==2:\r\n d += X[0]\r\n else:\r\n s += str(A[X[0]-1]+d) + '\\n'\r\n \r\nprint(s)", "n, m = map(int, input().split(\" \"))\r\nl = list(map(int, input().split(\" \")))\r\nb = 0\r\nfor i in range(m):\r\n s = list(map(int, input().split(\" \")))\r\n if s[0] == 1:\r\n l[s[1]-1] = s[2]-b\r\n elif s[0] == 2:\r\n b += s[1]\r\n elif s[0] == 3:\r\n print(l[s[1]-1]+b)\r\n", "from sys import stdin, stdout\r\nn, m = [int(i) for i in stdin.readline().split()]\r\na = [int(i) for i in stdin.readline().split()]\r\nadd = 0\r\nfor it in range(m):\r\n b = [int(i) for i in stdin.readline().split()]\r\n if b[0] == 1:\r\n a[b[1] - 1] = b[2] - add\r\n elif b[0] == 2:\r\n add += b[1]\r\n else:\r\n stdout.write(str(a[b[1] - 1] + add) + '\\n')\r\n", "#python3\r\nimport sys, threading, os.path\r\nimport collections, heapq, math,bisect\r\nimport string\r\nfrom platform import python_version\r\nimport itertools\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(2**27) \r\n\r\ndef main():\r\n if os.path.exists('input.txt'):\r\n input = open('input.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n #--------------------------------INPUT---------------------------------\r\n n,m = list(map(int, input.readline().split()))\r\n lis = list(map(int, input.readline().split()))\r\n sumall = 0\r\n sol=[]\r\n for i in range(m):\r\n temlis = list(map(int, input.readline().split()))\r\n #print(temlis)\r\n if temlis[0]==1:\r\n lis[temlis[1]-1]=temlis[2]-sumall\r\n elif temlis[0]==2:\r\n sumall+=temlis[1]\r\n elif temlis[0]==3:\r\n sol.append(lis[temlis[1]-1]+sumall)\r\n #print(lis,sumall)\r\n\r\n output = '\\n'.join(map(str, sol))\r\n #-------------------------------OUTPUT----------------------------------\r\n if os.path.exists('output.txt'):\r\n open('output.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n#threading.Thread(target=main).start()", "n, m = [int(x) for x in input().split()]\n\nvalues = [int(y) for y in input().split()]\n\ntemp = 0\nfor i in range(m):\n x = input().split()\n \n if int(x[0]) == 1:\n values[int(x[1])-1] = (int(x[2]) - temp)\n \n elif int(x[0]) == 2:\n temp += int(x[1])\n\n\n elif int(x[0]) == 3:\n w = values[int(x[1])-1]\n print((w + temp))\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\narr = [int(i) for i in input().split()]\r\nres, s = 0, \"\"\r\nfor i in range(m):\r\n b = [int(x) for x in input().split()]\r\n if b[0] == 1:\r\n arr[b[1] - 1] = b[2] - res\r\n elif b[0] == 2:\r\n res += b[1]\r\n else:\r\n s += str(arr[b[1] - 1] + res) + '\\n'\r\nprint(s)\r\n", "n , m = map(int, input().split())\r\nl = list(map(int, input().split()))\r\ntmp,s = 0,\"\"\r\nfor i in range(m):\r\n op = list(map(int, input().split()))\r\n if op[0] == 1:\r\n l[op[1]-1] = op[-1] - tmp\r\n elif op[0] == 2 :\r\n tmp += op[-1]\r\n else:\r\n s+=f\"{l[op[-1]-1]+tmp}\\n\"\r\nprint(s)\r\n", "import math\r\n\r\n\r\ndef solve():\r\n n, m = map(int, input().split())\r\n a = [[int(x), 0] for x in input().split()]\r\n added = 0\r\n for i in range(m):\r\n t, *params = input().split()\r\n if t == '3':\r\n index = int(params[0])\r\n print(a[index - 1][0] + a[index - 1][1] + added)\r\n elif t == '2':\r\n added += int(params[0])\r\n elif t == '1':\r\n v, x = int(params[0]), int(params[1])\r\n a[v - 1][0] = x\r\n a[v - 1][1] = -added\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "def main():\r\n n, m = map(int, input().split())\r\n arr = list(map(int, input().split()))\r\n num_decrs = dict()\r\n\r\n decr = 0\r\n ops = []\r\n for i in range(m):\r\n ops.append(list(map(int, input().split())))\r\n\r\n for q in ops:\r\n action = q[0]\r\n if action == 1:\r\n arr[q[1] - 1] = q[2]\r\n num_decrs[q[1] - 1] = decr\r\n elif action == 2:\r\n decr += q[1]\r\n else:\r\n if q[1] - 1 in num_decrs:\r\n print(arr[q[1] - 1] + (decr - num_decrs[q[1] - 1]))\r\n else:\r\n print(arr[q[1] - 1] + decr)\r\n\r\nmain()", "if __name__ == \"__main__\":\n nm = list(map(int,input().split()))\n n,m=nm[0],nm[1]\n A = list(map(int,input().split()))\n out = []\n accSum = 0\n for _ in range(m):\n entry = list(map(int,input().split()))\n op = entry[0]\n if op == 1:\n v = entry[1]\n x = entry[2]\n A[v-1] = x - accSum\n elif op == 2:\n y = entry[1]\n accSum += y\n elif op == 3:\n q = entry[1]\n out.append(A[q-1]+accSum)\n for val in out:\n print(val)\n\t\t \t\t\t\t\t\t\t \t \t\t\t \t\t \t\t\t \t\t\t", "\r\nimport sys\r\nlength, ops = map(int, sys.stdin.readline().split())\r\narr = list(map(int, sys.stdin.readline().split()))\r\ncnt = 0\r\n \r\nfor z in range(ops):\r\n things = list(map(int, sys.stdin.readline().split()))\r\n if things[0] == 1:\r\n arr[things[1] - 1] = things[2] - cnt\r\n elif things[0] == 2:\r\n cnt += things[1]\r\n else:\r\n sys.stdout.write(str(arr[things[1] - 1] + cnt) + '\\n')", "n,m=list(map(int,input().split()))\r\narr=list(map(int,input().split()))\r\nb=0\r\nans=''\r\nfor _ in range(m):\r\n l=list(map(int,input().split()))\r\n if l[0]==3:\r\n ans+=str(arr[l[1]-1]+b)+'\\n'\r\n elif l[0]==2:\r\n b+=l[1]\r\n elif l[0]==1:\r\n arr[l[1]-1]=l[2]-b\r\n\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\nt=1\r\nfor _ in range(t):\r\n n,m=map(int,input().split())\r\n ar=list(map(int,input().split()))\r\n add=0\r\n for y in range(m):\r\n z=list(map(int,input().split()))\r\n if z[0]==1:\r\n ar[z[1]-1]=z[2]-add\r\n elif z[0]==2:\r\n add+=z[1]\r\n else:\r\n print(ar[z[1]-1]+add)", "'''\r\n\r\n* Author : Ayushman Chahar #\r\n* About : IT Junior #\r\n* Insti : VIT, Vellore #\r\n\r\n'''\r\n\r\nimport os\r\nimport sys\r\n# from collections import *\r\n# from itertools import *\r\n# from math import *\r\n# from queue import *\r\n# from heapq import *\r\n# from bisect import *\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\nreadint = lambda: int(sys.stdin.readline().rstrip(\"\\r\\n\"))\r\nreadints = lambda: map(int, sys.stdin.readline().rstrip(\"\\r\\n\").split())\r\nreadstr = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nreadstrs = lambda: map(str, sys.stdin.readline().rstrip(\"\\r\\n\").split())\r\nreadarri = lambda: [int(_) for _ in sys.stdin.readline().rstrip(\"\\r\\n\").split()]\r\nreadarrs = lambda: [str(_) for _ in sys.stdin.readline().rstrip(\"\\r\\n\").split()]\r\n\r\n\r\ndef getSum(BITree: list, index: int) -> int:\r\n summ = 0\r\n index = index + 1\r\n while index > 0:\r\n summ += BITree[index]\r\n index -= index & (-index)\r\n return summ\r\n\r\n\r\ndef updateBit(BITTree: list, n: int, index: int, val: int) -> None:\r\n index = index + 1\r\n while index <= n:\r\n BITTree[index] += val\r\n index += index & (-index)\r\n\r\n\r\ndef summation(x: int, BITTree1: list, BITTree2: list) -> int:\r\n return (getSum(BITTree1, x) * x) - getSum(BITTree2, x)\r\n\r\n\r\ndef updateRange(BITTree1: list, BITTree2: list, n: int, val: int, l: int, r: int) -> None:\r\n updateBit(BITTree1, n, l, val)\r\n updateBit(BITTree1, n, r + 1, -val)\r\n updateBit(BITTree2, n, l, val * (l - 1))\r\n updateBit(BITTree2, n, r + 1, -val * r)\r\n\r\n\r\ndef rangeSum(l: int, r: int, BITTree1: list, BITTree2: list) -> int:\r\n return summation(r, BITTree1, BITTree2) - summation(l - 1, BITTree1, BITTree2)\r\n\r\n\r\ndef solve():\r\n n, q = readints()\r\n arr = readarri()\r\n f1, f2 = [0] * (n + 1), [0] * (n + 1)\r\n for i in range(n):\r\n updateRange(f1, f2, n, arr[i], i, i)\r\n for _ in range(q):\r\n a = readarri()\r\n if (a[0] == 1):\r\n curr = rangeSum(a[1] - 1, a[1] - 1, f1, f2)\r\n updateRange(f1, f2, n, -curr, a[1] - 1, a[1] - 1)\r\n updateRange(f1, f2, n, a[2], a[1] - 1, a[1] - 1)\r\n elif (a[0] == 2):\r\n updateRange(f1, f2, n, a[1], 0, n - 1)\r\n else:\r\n print(rangeSum(a[1] - 1, a[1] - 1, f1, f2))\r\n\r\n\r\ndef main():\r\n t = 1\r\n # t = readint()\r\n for _ in range(t):\r\n # print(\"Case #\" + str(_ + 1) + \": \", end=\"\")\r\n solve()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "# list input\ndef linp(): return list(map(int, input().split()))\n\n\n# map input\ndef minp(): return map(int, input().split())\n\n\n# int input\ndef iinp(): return int(input())\n\n\n# no of testcase\ndef test(): return int(input())\n\n\n# normal input\ndef inp(): return input()\n\n\ndef solve():\n # write your solution for one testcase\n n, m =minp()\n arr =linp()\n inc = [0]*m\n update = {}\n temp = 0\n for i in range(m):\n _inp = linp()\n if _inp[0] == 1:\n b, c = _inp[1], _inp[2]\n arr[b-1] = c\n update[b] = i\n elif _inp[0] == 2:\n temp += _inp[1]\n else:\n b = _inp[1]\n if b in update:\n print(arr[b-1] + (temp - inc[update[b]]))\n else:\n print(arr[b-1] + temp)\n inc[i] = temp\n\n\ndef main():\n # for _ in range(test()):\n solve()\n\n\nif __name__ == '__main__':\n main()\n" ]

[ "from sys import exit\r\n\r\nword = [x for x in input()]\r\n\r\nfor i in range(len(word) - 25):\r\n if len(word[i:i+26]) == 26 and \\\r\n len(set([x for x in word[i:i+26] if x != '?'])) == len([x for x in word[i:i+26] if x != '?']): #checking if there are no duplicated letters apart from the question mark\r\n segment = word[i:i+26]\r\n segmentcopy = ''.join(segment)\r\n unusedletters = [x for x in 'ABCDEFGHIJKLMNOPQRSTUVWXYZ']\r\n counter = 0\r\n for i in list([x for x in segment if x != '?']):\r\n unusedletters.pop(unusedletters.index(i))\r\n for i in range(len(segment)):\r\n if segment[i] == '?':\r\n segment[i] = unusedletters[counter]\r\n counter += 1\r\n word = ''.join(word)\r\n word = word[:word.index(segmentcopy)] + ''.join(segment) + word[word.index(segmentcopy) + len(segment):]\r\n word = [x for x in word]\r\n for i in range(len(word)):\r\n if word[i] == '?':\r\n word[i] = 'A'\r\n print(''.join(word))\r\n exit(0)\r\n else:\r\n continue\r\n\r\nprint(-1)\r\n", "from collections import Counter\r\ns=list(input())\r\nif(len(s)<26):\r\n print(-1)\r\n exit()\r\nt=0\r\nj=25\r\ns2=set()\r\nfor i in range(65,91):\r\n s2.add(chr(i))\r\nn=len(s)\r\nf1=False\r\nwhile j<n:\r\n f=True\r\n a=s[t:j+1]\r\n d=Counter(a)\r\n for p in d.keys():\r\n if(p!='?' and d[p]>1):\r\n f=False\r\n break\r\n if f:\r\n s1=set(a)\r\n s3=s1.intersection(s2)\r\n s4=list(s2-s3)\r\n #print(s1)\r\n #print(s2)\r\n #print(s3)\r\n #print(s4)\r\n z=0\r\n for p in range(t,j+1):\r\n if(s[p]=='?'):\r\n s[p]=s4[z]\r\n z+=1\r\n f1=True\r\n break\r\n t+=1\r\n j+=1\r\nif f1:\r\n for i in range(0,n):\r\n if(s[i]=='?'):\r\n s[i]='A'\r\n print(''.join(map(str,s)))\r\n #print(len(set(s)))\r\nelse:\r\n print(-1)", "string = list(input())\nleft = 0\ndistinct = set()\nch = []\nqm = 0\nupper = 'ABCDEFGHIJKLMNOPQRSTUVWXYZ'\nflag = 0;\nfor right, char in enumerate(string, 1):\n if char.isalpha():\n distinct.add(char)\n ch.append(char)\n else:\n qm += 1\n dist = right-left\n if dist == 26:\n if len(distinct) + qm == 26:\n for i in range(left, right):\n if string[i] == \"?\":\n for c in upper:\n if c not in distinct:\n string[i] = c\n distinct.add(c)\n break\n flag = 1\n else:\n if string[left].isalpha():\n ch.remove(string[left])\n if string[left] not in ch:\n distinct.remove(string[left])\n else:\n qm -= 1\n left += 1\nif flag:\n for i, char in enumerate(string):\n if char == \"?\":\n string[i] = 'B'\n print(''.join(string))\nelse:\n print(-1)\n\n \t\t \t\t \t\t \t\t\t\t\t\t \t \t \t\t \t\t", "import random\r\n\r\ndef main():\r\n s = input()\r\n ans = list(s)\r\n ok = False\r\n if len(s) >= 26:\r\n lookup = {}\r\n start = 0\r\n end = 0\r\n k = 0\r\n count = [0] * 26\r\n comma = 0\r\n while end < len(s):\r\n while end - start + 1 <= 26:\r\n if s[end] == '?':\r\n comma += 1\r\n else:\r\n if count[ord(s[end]) - ord('A')] == 0:\r\n k += 1\r\n count[ord(s[end]) - ord('A')] += 1\r\n end += 1\r\n if k + comma == 26:\r\n for i in range(start, end):\r\n if s[i] == '?':\r\n for j in range(26):\r\n if count[j] == 0:\r\n ans[i] = chr(ord('A') + j)\r\n count[j] += 1\r\n break\r\n ok = True\r\n break\r\n else:\r\n if s[start] == '?':\r\n comma -= 1\r\n else:\r\n count[ord(s[start]) - ord('A')] -= 1\r\n if count[ord(s[start]) - ord('A')] == 0:\r\n k -= 1\r\n start += 1\r\n if ok:\r\n for i in range(len(s)):\r\n if ans[i] == '?':\r\n ans[i] = chr(ord('A') + random.randint(0, 25))\r\n print(''.join(ans))\r\n else:\r\n print(-1)\r\n else:\r\n print(-1)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "s = list(input())\r\nn = len(s)\r\nflag = False\r\nptr = 0\r\nneeded = list(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nfor i in range(0, n-26+1):\r\n sub = s[i:i+26]\r\n letters = set()\r\n ct = 0\r\n for j in sub:\r\n if j != '?':\r\n letters.add(j)\r\n else:\r\n ct += 1\r\n if len(letters) == 26:\r\n flag = True\r\n break\r\n elif len(letters)+ct == 26:\r\n flag = True\r\n temp = []\r\n for let in needed:\r\n if let not in letters:\r\n temp.append(let)\r\n ptr = 0\r\n for j in range(i, i+26):\r\n if s[j] == '?':\r\n s[j] = temp[ptr]\r\n ptr += 1\r\n break\r\nif flag:\r\n for i in range(n):\r\n if s[i] == '?':\r\n s[i] = 'A'\r\n print(s[i], end='')\r\nelse:\r\n print(\"-1\")\r\n", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:06/06/2020\r\n\r\n'''\r\nfrom os import path\r\nimport sys\r\nfrom functools import cmp_to_key as ctk\r\nfrom collections import deque,defaultdict as dd \r\nfrom bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\nfrom itertools import permutations\r\nfrom datetime import datetime\r\nfrom math import ceil,sqrt,log,gcd\r\ndef ii():return int(input())\r\ndef si():return input()\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\nabc='abcdefghijklmnopqrstuvwxyz'\r\nabd={'a': 0, 'b': 1, 'c': 2, 'd': 3, 'e': 4, 'f': 5, 'g': 6, 'h': 7, 'i': 8, 'j': 9, 'k': 10, 'l': 11, 'm': 12, 'n': 13, 'o': 14, 'p': 15, 'q': 16, 'r': 17, 's': 18, 't': 19, 'u': 20, 'v': 21, 'w': 22, 'x': 23, 'y': 24, 'z': 25}\r\nmod=1000000007\r\n#mod=998244353\r\ninf = float(\"inf\")\r\nvow=['a','e','i','o','u']\r\ndx,dy=[-1,1,0,0],[0,0,1,-1]\r\n\r\n \r\n\r\ndef solve():\r\n \r\n s=si()\r\n s=list(s)\r\n s.pop()\r\n n=len(s)\r\n if n<26:\r\n print('-1')\r\n exit(0)\r\n x=[0]*26\r\n j=0\r\n for i in range(25):\r\n if s[i]=='?':\r\n continue\r\n x[ord(s[i])-ord('A')]+=1\r\n for i in range(25,n):\r\n if s[i]!='?':\r\n x[ord(s[i])-ord('A')]+=1\r\n if(max(x)<2):\r\n s1=[]\r\n for k in range(26):\r\n if x[k]==0:\r\n s1.append(chr(65+k))\r\n k1=0\r\n for k in range(j,i+1):\r\n if s[k]=='?':\r\n s[k]=s1[len(s1)-1]\r\n s1.pop()\r\n for k in range(i):\r\n if s[k]=='?':\r\n s[k]='A'\r\n for k in range(i+1,n):\r\n if s[k]=='?':\r\n s[k]='A'\r\n print(''.join(s))\r\n exit(0)\r\n \r\n else:\r\n if(s[j]!='?'):\r\n x[ord(s[j])-ord('A')]-=1\r\n j+=1\r\n print('-1')\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\nif __name__ ==\"__main__\":\r\n if path.exists('input1.txt'):\r\n sys.stdin=open('input1.txt', 'r')\r\n sys.stdout=open('output1.txt','w')\r\n else:\r\n input=sys.stdin.readline\r\n solve()\r\n", "s = input()\r\nfor i in range(len(s) - 25):\r\n sub = s[i:i+26]\r\n msg = set('ABCDEFGHIJKLMNOPQRSTUVWXYZ') - set(sub)\r\n if len(msg) == sub.count('?'):\r\n while msg:\r\n sub = sub.replace('?', msg.pop(), 1)\r\n print((s[:i] + sub + s[i+26:]).replace('?', 'A'))\r\n break\r\nelse:\r\n print(-1) \r\n", "from sys import stdin,stdout\r\na=list(input())\r\nl=len(a)\r\nif l<26:stdout.write('-1');exit()\r\nz=[0]*26;gh=[]\r\ndef check(k):\r\n global a;s=0\r\n if max(z) < 2:\r\n for i in range(26):\r\n if a[i+k]=='?':\r\n while z[s]!=0 and s<26:s+=1\r\n a[i+k] = chr(65 + s)\r\n s+=1\r\n a = ''.join(a).replace('?', 'K')\r\n stdout.write(a)\r\n exit()\r\nfor i in range(26):\r\n if a[i]!='?':z[ord(a[i])-65]+=1\r\ncheck(0)\r\nfor i in range(26,l):\r\n if a[i-26]!='?':z[ord(a[i-26])-65]-=1\r\n if a[i]!='?':z[ord(a[i])-65]+=1\r\n check(i-25)\r\nprint(-1)", "from string import ascii_uppercase as Ascii\r\n\r\nStr = list(input())\r\ndef Main(Str):\r\n for i in range(len(Str)):\r\n Sub = Str[i:(i+26)]\r\n Set = set(Sub)|{'?'}\r\n\r\n if(len(Set) + Sub.count('?') == 27):\r\n Lst = list(set(Ascii) - Set)\r\n for k in range(26):\r\n if(Str[i + k] == '?'):\r\n Str[i + k] = Lst.pop()\r\n return \"\".join(Str).replace('?', 'A')\r\n return '-1'\r\n\r\nprint(Main(Str))\r\n \r\n\r\n\r\n \r\n \r\n", "s = list(input())\r\nn = len(s)\r\nd = dict()\r\nfor i in range(n):\r\n d[s[i]] = d.get(s[i], 0) + 1\r\n if i >= 26:\r\n d[s[i-26]] -= 1\r\n if d[s[i-26]] == 0:\r\n d.pop(s[i-26])\r\n if i >= 25:\r\n x = d.get('?', 0)\r\n if x == 0:\r\n if len(d) == 26:\r\n for j in range(n):\r\n if s[j] == '?':\r\n s[j] = 'A'\r\n print(''.join(s))\r\n exit(0)\r\n elif x + len(d) - 1 == 26:\r\n y = []\r\n for z in range(26):\r\n Z = chr(z + ord('A'))\r\n if Z not in d:\r\n y.append(Z)\r\n for j in range(26):\r\n if s[i-j] == '?':\r\n s[i-j] = y[0]\r\n y = y[1:]\r\n for j in range(n):\r\n if s[j] == '?':\r\n s[j] = 'A'\r\n print(''.join(s))\r\n exit(0)\r\nprint(-1)\r\n", "s = input()\r\nif len(s)<26:\r\n print(-1)\r\n exit()\r\n\r\nalpha = \"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\nll = []\r\nfor i in s:\r\n if i in ll and i!=\"?\":\r\n ll = ll[ll.index(i)+1:]\r\n ll.append(i)\r\n if len(ll)==26:\r\n break\r\nif len(ll)<26:\r\n print(-1)\r\n exit()\r\n\r\nw1 = s[ :s.find(\"\".join(ll))]\r\nw2 = s[s.find(\"\".join(ll))+ 26 : ]\r\n\r\n\r\nfor i in range(len(ll)):\r\n if ll[i]==\"?\":\r\n for j in alpha:\r\n if j not in ll:\r\n ll[i]=j\r\n break\r\nif \"?\" in w1:\r\n w1 = w1.replace(\"?\", \"A\")\r\nif \"?\" in w2:\r\n w2 = w2.replace(\"?\", \"A\")\r\nword = w1 +\"\".join(ll) +w2\r\nprint(word)", "def solve(s):\r\n TARGET_LENGTH = 26\r\n\r\n def replace(part):\r\n shown_letters = set(ch for ch in part if ch != '?')\r\n indices = [i for i, ch in enumerate(part) if ch == '?']\r\n\r\n if len(shown_letters) + len(indices) != TARGET_LENGTH:\r\n return None\r\n\r\n unshown_letters = [ch for ch in map(chr, range(ord('A'), ord('Z') + 1)) if ch not in shown_letters]\r\n\r\n result = list(part)\r\n for i, idx in enumerate(indices):\r\n result[idx] = unshown_letters[i]\r\n\r\n return ''.join(result)\r\n\r\n for i in range(len(s) - TARGET_LENGTH + 1):\r\n replacement = replace(s[i:i + TARGET_LENGTH])\r\n\r\n if replacement is not None:\r\n return f\"{s[:i]}{replacement}{s[i + TARGET_LENGTH:]}\".replace('?', 'A')\r\n\r\n return \"-1\"\r\n\r\nif __name__ == \"__main__\":\r\n s = input()\r\n print(solve(s))", "from string import ascii_uppercase as C\r\ndef f(s):\r\n for i in range(len(s)):\r\n t=s[i:i+26]\r\n X=set(t)|{'?'}\r\n if len(X)+t.count('?')==27:\r\n x=list(set(C)-X)\r\n for j in range(26):\r\n if s[i+j]=='?':\r\n s[i+j]=x.pop()\r\n return ''.join(s).replace('?', 'A')\r\n return '-1'\r\nprint(f(list(input())))", "for _ in range(1):\r\n s=input()\r\n if len(s)<26:\r\n print(-1)\r\n continue\r\n alp=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\"\r\n alp=list(alp)\r\n for i in range(len(s)-25):\r\n cn=s[i:i+26].count(\"?\")\r\n a=s[i:i+26]\r\n \r\n l=i\r\n f=0\r\n c=0\r\n for j in a:\r\n if j==\"?\":\r\n continue\r\n if a.count(j)!=1:\r\n c=0\r\n f=1\r\n break\r\n else:\r\n c+=1\r\n if f==1:\r\n continue\r\n print(s[0:i].replace(\"?\",\"A\"),end=\"\") \r\n \r\n if c==26-cn:\r\n for i in a:\r\n if i==\"?\":\r\n continue\r\n alp.remove(i)\r\n \r\n for x in range(len(a)):\r\n if a[x]==\"?\":\r\n print(alp.pop(),end=\"\")\r\n else:\r\n print(a[x],end=\"\")\r\n print(s[l+26:].replace(\"?\",\"A\"))\r\n break\r\n else:\r\n print(-1)\r\n", "def check(st):\r\n st = list(st)\r\n letters = [0] * 26\r\n question_makrs = []\r\n\r\n for i in range(len(st)):\r\n if st[i] == '?':\r\n question_makrs.append(i)\r\n else:\r\n if letters[ord(st[i]) - 65] >= 1:\r\n return False,\"\"\r\n else:\r\n letters[ord(st[i]) - 65]+=1\r\n \r\n for i in range(len(letters)):\r\n if letters[i] == 0:\r\n st[question_makrs.pop()] = chr(i+65)\r\n \r\n return True, \"\".join(st)\r\n\r\n\r\ns = input()\r\n\r\nif len(s) < 26:\r\n print(-1)\r\n \r\nelse:\r\n\r\n con = False\r\n final_str = \"\"\r\n\r\n for i in range(len(s)):\r\n if i + 26 <= len(s):\r\n con, st = check(s[i:i+26])\r\n\r\n if con:\r\n final_str = s[:i] + st + s[i+26:]\r\n break\r\n else:\r\n break\r\n\r\n final_str = final_str.replace('?', \"X\")\r\n\r\n if con:\r\n print(final_str)\r\n #print(len(final_str))\r\n else:\r\n print(-1)", "\r\ndef check(s):\r\n for i in range(len(s)):\r\n for j in range(i + 1 , len(s)):\r\n if (s[j] == s[i] and s[j] != '?'):\r\n return -1\r\n return 1\r\n\r\n\r\nfrom collections import deque\r\nfrom string import ascii_uppercase\r\n\r\nw = deque(ascii_uppercase)\r\ns = input()\r\n\r\nn = len(s)\r\nflag = False\r\nfor i in range(len(s) - 25):\r\n k = i\r\n s2 = list(s[i : i + 26])\r\n if check(s2) == 1 :\r\n flag = True\r\n for k1 in range(len(s2)):\r\n if s2[k1] != '?':\r\n w.remove(s2[k1])\r\n\r\n for k2 in range(len(s2)):\r\n if s2[k2] == '?':\r\n s2[k2] = w[0]\r\n w.remove(s2[k2])\r\n\r\n break\r\n\r\n\r\nif flag == False:\r\n print('-1')\r\n\r\nelse:\r\n s = list(s)\r\n #print(k)\r\n s[k : k+26] = s2\r\n #print(s)\r\n for i in range(len(s)):\r\n if s[i] == '?':\r\n s[i] = 'A'\r\n for x in s :\r\n print(x , end = '')\r\n print()\r\n\r\n", "def check(s):\n \n for i in range(len(s)):\n if(s[i]!='?'):c[ord(s[i])-65]+=1\n\n for i in range(26):\n if(c[i] > 1):return False\n\n return True\n\n\ndef answer():\n global c\n\n possible=False\n for i in range(n-25):\n\n c=[0]*(26)\n if(check(s[i : i + 26])):\n\n for j in range(i,i+26):\n\n if(s[j]=='?'):\n\n for k in range(26):\n if(c[k]==0):\n\n s[j]=chr(65 + k)\n c[k]+=1\n break\n\n possible=True\n break\n\n if(not possible):return -1\n\n for i in range(n):\n if(s[i]=='?'):\n s[i]='A'\n\n return ''.join(s)\n\n\n\n\ns=list(input())\nn=len(s)\nc=[0]*(26)\n\nprint(answer())\n\n\t \t \t\t\t\t\t \t \t\t \t\t\t \t \t\t \t\t", "\r\nfrom collections import Counter\r\nimport string\r\n\r\ns = list(input())\r\nn = len(s)\r\n\r\nfor i in range(n - 26 + 1):\r\n ok, cnt = True, Counter()\r\n for j in range(i, i + 26):\r\n if s[j] != '?':\r\n cnt[s[j]] += 1\r\n if cnt[s[j]] == 2:\r\n ok = False \r\n break \r\n if ok:\r\n j, lcl = 0, string.ascii_uppercase\r\n for i in range(i, i + 26):\r\n while j < 26 and cnt[lcl[j]]:\r\n j += 1\r\n if s[i] == '?':\r\n s[i] = lcl[j]\r\n j += 1\r\n for i in range(n):\r\n if s[i] == '?':\r\n s[i] = 'A'\r\n print(''.join(s))\r\n break \r\nelse:\r\n print(-1)\r\n", "s = input()\r\nn = len(s)\r\n\r\nif n < 26:\r\n print(-1)\r\n exit()\r\n\r\ncharacters = set(\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\")\r\nsubstring = []\r\n\r\nfor i in range(n):\r\n while len(substring) == 26 or (s[i] in substring and s[i] != \"?\"):\r\n substring.pop(0)\r\n substring.append(s[i])\r\n if len(substring) == 26:\r\n unique_chars = set(substring) - {\"?\"}\r\n missing_chars = characters - unique_chars\r\n\r\n if len(missing_chars) == 26 - len(unique_chars):\r\n new = [char if char != \"?\" else missing_chars.pop() for char in substring]\r\n replaced_s = s.replace(\"?\", \"A\")\r\n print(replaced_s[: i - 25] + \"\".join(new) + replaced_s[i + 1 :])\r\n exit()\r\nprint(-1)\r\n", "import string \r\n\r\ns = list(input()) # convert to list to easily change it later\r\n\r\nn = len(s)\r\n\r\nletters = set(string.ascii_uppercase)\r\n\r\nfor i in range(n - 26 + 1):\r\n substring = set(s[i : i + 26])\r\n substring.discard('?')\r\n if len(substring) + s[i : i + 26].count('?') == 26:\r\n b = letters - substring # removed the previously seen characters\r\n for j in range(i, i + 26):\r\n if s[j] == '?':\r\n s[j] = b.pop()\r\n print(''.join(s).replace('?', 'A'))\r\n break \r\nelse: \r\n print(-1)", "# B. Complete the Word\n# time limit per test\n# 2 seconds\n# memory limit per test\n# 256 megabytes\n# input\n# standard input\n# output\n# standard output\n\n# ZS the Coder loves to read the dictionary. He thinks that a word is nice if there exists a substring (contiguous segment of letters) of it of length 26 where each letter of English alphabet appears exactly once. In particular, if the string has length strictly less than 26, no such substring exists and thus it is not nice.\n\n# Now, ZS the Coder tells you a word, where some of its letters are missing as he forgot them. He wants to determine if it is possible to fill in the missing letters so that the resulting word is nice. If it is possible, he needs you to find an example of such a word as well. Can you help him?\n# Input\n\n# The first and only line of the input contains a single string s (1 ≤ |s| ≤ 50 000), the word that ZS the Coder remembers. Each character of the string is the uppercase letter of English alphabet ('A'-'Z') or is a question mark ('?'), where the question marks denotes the letters that ZS the Coder can't remember.\n# Output\n\n# If there is no way to replace all the question marks with uppercase letters such that the resulting word is nice, then print  - 1 in the only line.\n\n# Otherwise, print a string which denotes a possible nice word that ZS the Coder learned. This string should match the string from the input, except for the question marks replaced with uppercase English letters.\n\n# If there are multiple solutions, you may print any of them.\n\ndef complete(start,end,s):\n\tans = []\n\t# print(start,end)\n\tfor i in range(start):\n\t\tif s[i]==\"?\":\n\t\t\tans.append('A')\n\t\telse:\n\t\t\tans.append(s[i])\n\tused = set(s[start:end+1])\n\tfor i in range(start,end+1):\n\t\tif s[i]==\"?\":\n\t\t\tfor i in range(26):\n\t\t\t\tif chr(ord('A')+i) not in used:\n\t\t\t\t\tans.append(chr(ord('A')+i))\n\t\t\t\t\tused.add(chr(ord('A')+i))\n\t\t\t\t\tbreak\n\t\telse:\n\t\t\tans.append(s[i])\n\n\tfor i in range(end+1,len(s)):\n\t\tif s[i]==\"?\":\n\t\t\tans.append('A')\n\t\telse:\n\t\t\tans.append(s[i])\n\treturn \"\".join(ans)\n\ndef fun(s):\n\tstart,end = 0,0\n\tif len(s)<26:\n\t\treturn False\n\tarray = [0 for i in range(26)]\n\tflag = True\n\t# ans = []\n\twhile start<= end and end<len(s):\n\t\t# print(start,end,\"---\",array)\n\t\tcurr = s[end]\n\t\t\n\t\tif curr == \"?\":\n\t\t\tif end-start >=25:\n\t\t\t\t# print(\"hello\")\n\t\t\t\treturn complete(start,end,s)\n\t\t\tend+=1\n\t\t\tcontinue\n\t\tarray[ord(curr)-ord('A')]+=1\n\t\twhile array[ord(curr)-ord('A')] >1:\n\t\t\ttemp = s[start]\n\t\t\tarray[ord(temp)-ord('A')]-=1\n\t\t\tstart+=1\n\t\tif end-start >=25:\n\t\t\t# print(\"hello\")\n\t\t\treturn complete(start,end,s)\n\t\tend+=1\n\treturn []\n\n\n\n\ns = input()\nans = fun(s)\nif ans:\n\tprint(ans)\nelse:\n\tprint(-1)", "s = input()\r\nfound = False\r\n\r\nfor i in range(len(s) - 25):\r\n substring = s[i:i + 26]\r\n each_once = True\r\n\r\n for letter in substring:\r\n if letter != '?' and substring.count(letter) > 1:\r\n each_once = False\r\n break\r\n\r\n if each_once:\r\n found = True\r\n missing_letters = set('ABCDEFGHIJKLMNOPQRSTUVWXYZ') - set(substring)\r\n for each in missing_letters:\r\n substring = substring.replace('?', each, 1)\r\n\r\n s = s[:i] + substring + s[i+26:]\r\n break\r\n\r\nif found:\r\n print(s.replace('?', 'A'))\r\nelse:\r\n print(-1)\r\n", "a=['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\ns=list(input())\r\nx,y,k=0,0,0\r\nif len(s)<26:print(-1)\r\nelse:\r\n for i in range(len(s)-26+1):\r\n t=list()\r\n for j in a:\r\n if s[i:i+26].count(j)>1:\r\n x=1\r\n break\r\n elif not s[i:i+26].count(j):\r\n t.append(j)\r\n if x:\r\n x=0\r\n elif s[i:i+26].count('?')==len(t):\r\n k=1\r\n for j in range(i,i+26):\r\n if s[j]=='?':\r\n s[j]=t[y]\r\n y+=1\r\n break\r\n for i in range(len(s)):\r\n if s[i]=='?':s[i]='A'\r\n if k:print(\"\".join(s))\r\n else:print(-1)", "#inspired by others for practice\r\ns=input()\r\ns=list(s)\r\nn=len(s)\r\nif n<26:\r\n print(-1)\r\n exit()\r\nch=0\r\nfor i in range (n-25):\r\n st=set(s[i:i+26])\r\n if '?' in st:\r\n st.remove('?')\r\n if len(st)+s[i:i+26].count('?')==26:\r\n ch=1\r\n if s[i:i+26].count('?')==0:\r\n break\r\n k=65\r\n for j in range (i,i+26):\r\n if s[j]=='?':\r\n while True:\r\n if chr(k) not in s[i:i+26]:\r\n s[j]=chr(k)\r\n k+=1\r\n break\r\n else:\r\n k+=1\r\nfor i in range (n):\r\n if s[i]=='?':\r\n s[i]='A'\r\nif ch==0:\r\n print(-1)\r\nelse:\r\n print(*s,sep='')", "w=set('QWERTYUIOPASDFGHJKLZXCVBNM')\ns=list(input())\nfor i in range(len(s)):\n\tt=s[i:i+26]\n\ta=set(t)|{'?'}\n\tif len(a)+t.count('?')==27:\n\t\tb=list(w-a)\n\t\tfor j in range(26):\n\t\t\tif s[i+j]=='?':s[i+j]=b.pop()\n\t\tprint (''.join(s).replace('?', 'A'))\n\t\texit(0)\nprint (-1)\n\n\t \t \t\t \t\t \t \t \t\t \t \t\t \t\t \t", "l=list(input())\r\nn=len(l)\r\nf=0\r\nfor i in range(n-26+1):\r\n s=[0 for p in range(26)]\r\n c=0\r\n for j in range(i,i+26):\r\n if(l[j]=='?'):\r\n c+=1\r\n else:\r\n s[ord(l[j])-65]=1\r\n if(c==26-sum(s)):\r\n f=1\r\n for k in range(i,i+26):\r\n q=0\r\n if(l[k]=='?'):\r\n while(q<26 and s[q]==1):\r\n q+=1\r\n l[k]=chr(65+q)\r\n s[q]=1\r\n break\r\nif(f==0):\r\n print(-1)\r\nelse:\r\n for i in range(n):\r\n if(l[i]=='?'):\r\n l[i]='A'\r\n print(''.join(l))\r\n", "from collections import Counter as cnt\r\nalp,ans=\"ABCDEFGHIJKLMNOPQRSTUVWXYZ\",\"\"\r\ns=input()\r\n\r\nfor i in range(len(s)-25):\r\n b=s[i:26+i]\r\n d=cnt(b)\r\n del d['?']\r\n if all(x==1 for x in d.values()):\r\n b=list(b)\r\n for c in alp:\r\n if c in b:\r\n continue\r\n else:\r\n b[b.index('?')]=c\r\n b=''.join(b)\r\n ans=s[:i]+b+s[26+i:]\r\n ans=ans.replace(\"?\",\"A\")\r\n break\r\nif not ans:\r\n print(-1)\r\nelse:\r\n print(ans)", "text = input()\nif len(text) < 26:\n print(-1)\n quit()\n\nalphabet = set('ABCDEFGHIJKLMNOPQRZTUVWXYS')\ncur_alphabet = dict([(s, 0) for s in 'ABCDEFGHIJKLMNOPQRZTUVWXYS?'])\n\nfor s in text[:26]:\n cur_alphabet[s] += 1\n\n\ndef is_good():\n c = 0\n for key, value in cur_alphabet.items():\n if key != '?':\n if value > 1:\n return False\n else:\n c += value\n return c + cur_alphabet['?'] == 26\n\n\nif is_good():\n replace = []\n for s in alphabet:\n if cur_alphabet[s] == 0:\n replace.append(s)\n\n cur_text = text[0: 26].replace('?', '{}').format(*replace)\n print(cur_text + text[26:].replace('?', 'A'))\n quit()\n\nfor i in range(26, len(text) + 1):\n if is_good():\n replace = []\n for s in alphabet:\n if cur_alphabet[s] == 0:\n replace.append(s)\n\n cur_text = text[i - 26:i].replace('?', '{}').format(*replace)\n print(text[:i - 26].replace('?', 'A') + cur_text + text[i:].replace('?', 'A'))\n quit()\n\n elif i < len(text):\n cur_alphabet[text[i - 26]] -= 1\n cur_alphabet[text[i]] += 1\n\nprint(-1)\n\n\n\n\n\n\n\t \t \t\t\t\t\t \t \t\t \t \t \t \t\t\t", "import string\r\n\r\ns = list(input())\r\n\r\nn = len(s)\r\n\r\nfor i in range(n - 26 + 1):\r\n\r\n # check if there is any character repeated from [i, i + 26]\r\n ok, store = True, set(string.ascii_uppercase)\r\n for j in range(i, i + 26):\r\n if s[j] != '?':\r\n if s[j] not in store:\r\n # if s[j] is not found and already removed from our set it means it is duplicated\r\n ok = False \r\n break \r\n store.remove(s[j])\r\n\r\n if ok: \r\n # if there was no repeated character\r\n for k in range(i, i + 26):\r\n if s[k] == '?':\r\n s[k] = store.pop()\r\n \r\n # assign the rest of the questions marks any character by your choice\r\n for k in range(n):\r\n if s[k] == '?':\r\n s[k] = 'X' # you can pick any character from A-Z\r\n\r\n print(''.join(s))\r\n break \r\nelse:\r\n print(-1)\r\n", "from string import ascii_uppercase\r\n\r\ns = input()\r\nn = len(s)\r\nfor i in range(n - 25):\r\n qm = 0\r\n letters = set()\r\n for j in range(26):\r\n if s[i + j] != '?':\r\n letters.add(s[i + j])\r\n else:\r\n qm += 1\r\n\r\n if len(letters) + qm == 26:\r\n ex = [ascii_uppercase[i] for i in range(26) if ascii_uppercase[i] not in letters]\r\n ans = ''\r\n j = 0\r\n while j < n:\r\n if j == i:\r\n k = 0\r\n for z in range(26):\r\n if s[j + z] == '?':\r\n ans += ex[k]\r\n k += 1\r\n else:\r\n ans += s[j + z]\r\n j += 26\r\n else:\r\n if s[j] == '?':\r\n ans += 'A'\r\n else:\r\n ans += s[j]\r\n j += 1\r\n print(ans)\r\n raise SystemExit\r\n\r\nprint(-1)\r\n", "\r\ndef solve():\r\n\tv=set([chr(i) for i in range(65,91)])\r\n\r\n\tl = list(input())\r\n\tn = len(l)\r\n\tif n<26:\r\n\t\tprint(-1)\r\n\t\treturn\r\n\tfor i in range(n):\r\n\t\ts = l[i:i+26]\r\n\t\tz = set(s)\r\n\t\tz.add('?')\r\n\t\tif len(z)+s.count('?')-1 == 26:\r\n\t\t\tq = list(v-z)\r\n\t\t\tfor j in range(26):\r\n\t\t\t\tif l[i+j]=='?':\r\n\t\t\t\t\tl[i+j]=q.pop()\r\n\t\t\tprint(''.join(l).replace('?','X'))\r\n\t\t\treturn\r\n\tprint(-1)\r\nsolve()\r\n", "import os\r\nfrom math import*\r\nimport copy\r\nfrom bisect import*\r\n\r\ns=input()\r\nif len(s)<26:\r\n\tprint(\"-1\")\r\nelse:\r\n\tz=0\r\n\txx=[\"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\tfor i in range(len(s)-25):\r\n\t\tns=s[i:i+26]\r\n\t\tns=sorted(ns)\r\n\t\tx=[]\r\n\t\tsign=0\r\n\t\tfor j in range(len(ns)):\r\n\t\t\tif ns[j]==\"?\":\r\n\t\t\t\tsign+=1\r\n\t\t\telse:\r\n\t\t\t\tx.append(ns[j])\r\n\t\txxx=list(set(xx).difference(set(x)))\r\n\t\tif len(x)==len(set(x)):\r\n\t\t\tz=1\r\n\t\t\tfor j in range(len(s)):\r\n\t\t\t\tif j>=i and j<i+26:\r\n\t\t\t\t\tif s[j]==\"?\":\r\n\t\t\t\t\t\tprint(xxx[-1],end='')\r\n\t\t\t\t\t\txxx.pop()\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tprint(s[j],end='')\r\n\t\t\t\telse:\r\n\t\t\t\t\tif s[j]==\"?\":\r\n\t\t\t\t\t\tprint(\"A\",end='')\r\n\t\t\t\t\telse:\r\n\t\t\t\t\t\tprint(s[j],end='')\r\n\t\tif z==1:\r\n\t\t\tbreak\r\n\tif z==0:\r\n\t\tprint(\"-1\")\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\nimport sys\r\ns = list(input())\r\n\r\nif len(s)<26:\r\n print(-1)\r\n sys.exit(0)\r\nn = len(s)\r\nl,r = 0,26\r\nwhile r<=n:\r\n freq = [0]*(26)\r\n \r\n for i in range(l, r):\r\n if s[i] == '?':\r\n continue\r\n \r\n if freq[ord(s[i]) - 65]:\r\n break\r\n freq[ord(s[i])-65]+=1\r\n else:\r\n j = 0\r\n st = set()\r\n for i in range(65, 91):\r\n st.add(chr(i))\r\n for i in range(l , r):\r\n if s[i]!='?':\r\n st.discard(s[i])\r\n for i in range(l, r):\r\n if s[i] == '?':\r\n s[i] = st.pop()\r\n for i in range(n):\r\n if s[i] == '?':\r\n s[i] = \"A\"\r\n print(''.join(s))\r\n sys.exit(0)\r\n \r\n l += 1\r\n r += 1\r\nprint(-1)", "s=list(input())\nn=len(s)\nif n<26:\n print(-1)\nelse:\n a=[0]*26\n c=0\n j=0\n x,y=-1,-1\n for q in range(26):\n if s[q]=='?':\n j+=1\n else:\n a[ord(s[q])-65]+=1\n if a[ord(s[q])-65]==1:\n c+=1\n if j+c==26:\n x,y=0,25\n else:\n for q in range(26,n):\n if s[q-26]=='?':\n j-=1\n else:\n a[ord(s[q-26])-65]-=1\n if a[ord(s[q-26])-65]==0:\n c-=1\n if s[q]=='?':\n j+=1\n else:\n a[ord(s[q])-65]+=1\n if a[ord(s[q])-65]==1:\n c+=1\n if j+c==26:\n x,y=q-26+1,q\n break\n if x==-1:\n print(-1)\n else:\n for q in range(x):\n if s[q]=='?':\n s[q]='A'\n for q in range(y+1,n):\n if s[q]=='?':\n s[q]='A'\n w=0\n #print(l)\n #print(x,y)\n \n for q in range(x,y+1):\n if s[q]=='?':\n while a[w]:\n w+=1\n s[q]=chr(65+w)\n w+=1\n \n print(''.join(s))\n ", "s=input()\nl=len(s)\nif(l<26):\n print(-1)\n exit()\ns=list(s)\nw=ord('A')\na=[0]*26\nr=0\nwhile(r+26<=l):\n g=1\n for i in range(r,r+26):\n if(s[i]!='?'):\n if(a[ord(s[i])-w]==0):\n a[ord(s[i])-w]=1\n else:\n a=[0]*26\n r=r+1\n g=0\n break\n if(g==1):\n m=0\n for k in range(r,r+26):\n if(s[k]=='?'):\n while(a[m]!=0):\n m=m+1\n s[k]=chr(w+m)\n m=m+1\n for i in range(l):\n if(s[i]=='?'):\n s[i]='A'\n print(\"\".join(s))\n exit()\nprint(-1)\n\n\t\t \t\t\t\t \t\t\t \t\t\t \t \t \t\t \t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\ns = list(input().rstrip())\r\nn = len(s)\r\nok = 0\r\nfor i in range(n - 25):\r\n cnt = [0] * 26\r\n for j in range(26):\r\n if s[i + j] > 63:\r\n cnt[s[i + j] - 65] += 1\r\n if max(cnt) <= 1:\r\n ok = 1\r\n k = 0\r\n for j in range(26):\r\n if s[i + j] == 63:\r\n while cnt[k]:\r\n k += 1\r\n s[i + j] = k + 65\r\n cnt[k] = 1\r\n break\r\ns = [chr(max(i, 65)) for i in s]\r\nans = \"\".join(s) if ok else -1\r\nprint(ans)", "import sys\nimport string\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom collections import Counter\n\ndef mi(s):\n return map(int, s.strip().split())\n\ndef lmi(s):\n return list(mi(s))\n\ndef mf(f, s):\n return map(f, s)\n\ndef lmf(f, s):\n return list(mf(f, s))\n\ndef main(s):\n begin = 0\n counts = defaultdict(int)\n have = set()\n num_q = 0\n qs = []\n for i in range(len(s)):\n if s[i] == '?':\n num_q += 1\n else:\n counts[s[i]] += 1\n have.add(s[i])\n\n if i - begin + 1 > 26:\n if s[begin] == '?':\n num_q -= 1\n else:\n counts[s[begin]] -= 1\n if counts[s[begin]] == 0:\n have.remove(s[begin])\n begin += 1\n\n if num_q + len(have) == 26:\n # The holes can be filled out.\n for c in string.ascii_uppercase:\n if c not in have:\n qs.append(c)\n break\n\n if num_q + len(have) < 26:\n print(-1)\n return\n\n ans = []\n k = 0\n for e, c in enumerate(s):\n if c != '?':\n ans.append(c)\n elif e >= begin and e <= i:\n ans.append(qs[k])\n k += 1\n else:\n ans.append('A')\n print(\"\".join(ans))\n\nif __name__ == \"__main__\":\n for e, line in enumerate(sys.stdin.readlines()):\n arr = line.strip()\n main(arr)\n", "s=list(input())\r\nb=set('QWERTYUIOPASDFGHJKLZXCVBNM')\r\nn=len(s)\r\ncout=0\r\nitem=s[:25].count('?')\r\nfor i,x in enumerate(s[:-25]):\r\n if s[i+25]=='?':item+=1\r\n a=set(s[i:i+26])|{'?'}\r\n if len(a)+item==27:\r\n lst=list(b-a)\r\n for j,y in enumerate(s[i:i+26]):\r\n if y=='?':s[i+j]=lst.pop()\r\n res=''.join(s)\r\n print(res.replace('?','A'))\r\n from sys import exit;exit()\r\n if s[i]=='?':item-=1\r\nprint(-1)", "from collections import defaultdict, deque, Counter\r\nfrom heapq import heapify, heappop, heappush\r\n\r\ndef main():\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n run_test_case()\r\n\r\ndef run_test_case():\r\n word = input()\r\n if len(word) < 26:\r\n print(-1)\r\n else:\r\n question = 0\r\n visited = set()\r\n left = i = 0\r\n ok = False\r\n for i in range(0, len(word)):\r\n while visited and word[i] in visited:\r\n if word[left] == \"?\":\r\n question -= 1\r\n else:\r\n visited.remove(word[left])\r\n left += 1\r\n\r\n if word[i] == \"?\":\r\n question += 1\r\n else:\r\n visited.add(word[i])\r\n\r\n if len(visited) + question == 26:\r\n ok = True\r\n break\r\n if ok:\r\n remaining = set()\r\n for j in range(0, 26):\r\n remaining.add(chr(ord('A') + j))\r\n\r\n result = []\r\n for j in range(left, i + 1):\r\n if word[j] != '?':\r\n remaining.remove(word[j])\r\n\r\n l = list(remaining)\r\n\r\n for j in range(left, i + 1):\r\n if word[j] == '?':\r\n result.append(l[-1])\r\n l.pop()\r\n else:\r\n result.append(word[j])\r\n prefix = word[ : left]\r\n infix = \"\".join(result)\r\n suffix = word[i + 1 :]\r\n prefix = prefix.replace(\"?\",\"A\")\r\n suffix = suffix.replace(\"?\", \"A\")\r\n result = \"\".join([prefix, infix, suffix])\r\n print( result)\r\n else:\r\n print(-1)\r\n \r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\"\"\"\r\n/* stuff you should look for\r\n * int overflow, array bounds\r\n * special cases (n=1?)\r\n * do smth instead of nothing and stay organized\r\n * WRITE STUFF DOWN\r\n * DON'T GET STUCK ON ONE APPROACH\r\n */\r\n\"\"\"\r\n", "import math\r\n#q=int(input())\r\nq=1\r\nfor _ in range(q):\r\n s=list(input())\r\n n=len(s)\r\n flag=False\r\n file=[]\r\n for i in range(n-25):\r\n l=s[i:i+26]\r\n k=[0]*26\r\n ques=0\r\n for j in range(26):\r\n if l[j]!='?':\r\n k[ord(l[j])-65]+=1\r\n else:\r\n ques+=1 \r\n if max(k)==1 or ques==26:\r\n flag=True\r\n check=i\r\n file=k\r\n break\r\n else:\r\n continue\r\n if flag:\r\n k=0\r\n for i in range(check,check+26):\r\n for j in range(k,26):\r\n if s[i]=='?':\r\n if file[j]==0:\r\n s[i]=chr(65+j)\r\n k=j+1\r\n for i in range(n):\r\n if s[i]=='?':\r\n s[i]='A'\r\n print(''.join(s)) \r\n else:\r\n print(-1)\r\n \r\n ", "import string\r\ns = input().strip()\r\n\r\n\r\ndef solve(s):\r\n if len(s) < 26:\r\n print(-1)\r\n return\r\n for i in range(0, len(s)-26+1):\r\n map = {}\r\n flag = True\r\n for j in range(i,i+26):\r\n ## Initalise the map or increment the count by 1, if the count >= 2 then i is bad\r\n map[s[j]] = map.get(s[j],0) + 1 \r\n for key,value in map.items(): \r\n if key != \"?\" and value >= 2:\r\n flag = False\r\n if flag == True: \r\n output = \"\"\r\n alpha = list(string.ascii_uppercase)\r\n for letter in s[i:i+26]:\r\n if letter in alpha: alpha.remove(letter)\r\n for k in range(0, len(s)):\r\n if i <=k <i + 26 and s[k] == \"?\":\r\n output += alpha[0] \r\n alpha.pop(0)\r\n else:\r\n if s[k] == \"?\":\r\n output += \"A\" \r\n else:\r\n output += s[k]\r\n print(output)\r\n return \r\n print(-1)\r\nsolve(s)", "s = list(input())\r\nalp = [chr(_) for _ in range(65, 91)]\r\nfor i in range(len(s)):\r\n\tk = s[i : i + 26]\r\n\tif len(set(k)) - (1 if '?' in k else 0) + k.count('?') == 26:\r\n\t\tw, x = [_ for _ in alp if _ not in k], 0\r\n\t\tfor j in range(i, i + 26):\r\n\t\t\tif s[j] == '?':\r\n\t\t\t\ts[j] = w[x]\r\n\t\t\t\tx += 1\r\n\t\ts = [i if i != '?' else 'A' for i in s]\r\n\t\tprint(''.join(s))\r\n\t\tbreak\r\nelse:\r\n\tprint(-1)", "s=list(input())\r\nn=len(s)\r\nd={}\r\n\r\ni=j=l=0\r\nabc=set(list('ABCDEFGHIJKLMNOPQRZTUVWXYS'))\r\nwhile i<n:\r\n\td[s[i]]=d.get(s[i],0)+1\r\n\tif d[s[i]]>1 and s[i]!='?':\r\n\t\twhile d[s[i]]!=1:\r\n\t\t\td[s[j]]-=1\r\n\t\t\tif d[s[j]]==0:\r\n\t\t\t\tdel d[s[j]]\r\n\t\t\tj+=1\r\n\t\t\tl-=1\r\n\ti+=1\r\n\tl+=1\r\n\tif l==26:\r\n\t\tbreak\r\nif l==26:\r\n\tz=set(abc-set(s[j:i]))\r\n\tfor k in range(j,i):\r\n\t\tif s[k]=='?':\r\n\t\t\ts[k]=z.pop()\r\n\ta=''.join(s)\r\n\ta=a.replace('?','A')\r\n\tprint(a)\r\nelse:\r\n\tprint(-1)\r\n", "def A(s):\r\n for i in range(len(s)):\r\n t = s[i:i + 26]\r\n if len(set(t)) == 26 or len(set(t)) + t.count('?') == 27:\r\n x = [ chr(ord('A') + j) for j in range(26) if chr(ord('A') + j) not in t]\r\n for j in range(26):\r\n if s[i + j] == '?':\r\n s[i + j] = x.pop()\r\n for j in range(len(s)):\r\n if s[j] == '?':\r\n s[j] = 'A'\r\n return ''.join(s)\r\n return -1\r\nprint(A(list(input())))", "from sys import stdin\r\nfrom string import ascii_uppercase\r\n#stdin = open(\"sum.in\", 'r')\r\nhat = stdin.readlines()\r\nwords = hat[0].strip()\r\nmyword = list(words)\r\nsubstrings = []\r\n\r\nfor i in range(0, len(myword)-25):\r\n substrings.append(myword[i:i+26])\r\n\r\n\r\ndef solve(word):\r\n lst = []\r\n letters = ascii_uppercase\r\n for i in range(len(word)):\r\n if word[i] != \"?\":\r\n lst.append(word[i])\r\n if len(lst) == len(set(lst)):\r\n for i in range(len(word)):\r\n if word[i] == \"?\":\r\n for j in letters:\r\n if j not in word:\r\n word[i] = j\r\n return \"\".join(word)\r\n else:\r\n return -1\r\n\r\n\r\nfor i in range(len(substrings)):\r\n if solve(substrings[i]) != -1:\r\n #print(\"\".join(myword))\r\n myword = list(\"\".join(myword[0:i]) + solve(substrings[i]) + \"\".join(myword[i+26:]))\r\n #print(myword)\r\n for j in range(len(myword)):\r\n if myword[j] == \"?\":\r\n myword[j] = \"A\"\r\n print(\"\".join(myword))\r\n quit()\r\n\r\nprint(-1)\r\n", "s = input()\nn = len(s)\nif n < 26:\n print(-1)\n exit() \ns = list(s)\nj = 0\nx = ord('A')\na = [0] * 26\nwhile(j + 26 <= n):\n flag = 1\t\t\n for k in range(j , j + 26): \n if(s[k] != '?'):\n if(a[ord(s[k])-x] == 0):\n a[ord(s[k])-x] = 1\n else:\n a = [0] * 26\n j = j + 1\n flag = 0\n break\n if flag == 1:\n p = 0\n for k in range(j,j+26):\n if(s[k] == \"?\"):\n while(a[p] != 0):\n p += 1\n s[k] = chr(x + p)\n p += 1\n for i in range(n):\n if s[i] == \"?\":\n s[i] = 'A'\n print(\"\".join(s))\n exit() \nprint(-1)\n \t\t \t \t\t\t \t \t \t", "from collections import defaultdict\r\n\r\nstring = input().strip()\r\nchar = defaultdict(list)\r\nleft = 0\r\n\r\n# check for a continuous 26 character substring where a letter appears only once\r\nfor i in range(len(string)):\r\n # check length of substring and exit if satifsactory\r\n if i - left >= 26:\r\n break\r\n \r\n # if a letters appear again check if the distance between last occurence is 26\r\n # if distance is less, make sure to start from the next index of the previous appearance \r\n if string[i] != '?' and len(char[string[i]]) > 0:\r\n if i - char[string[i]][-1] < 26:\r\n # if the start is already ahead don't pull it back\r\n left = max(left, char[string[i]][-1] + 1)\r\n \r\n char[string[i]].append(i)\r\n\r\nif len(string) - left >= 26:\r\n # given there exists a satisfactory substring find out the missing letters\r\n alphabet = {'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 for i in range(left, left+26):\r\n if string[i] != '?':\r\n alphabet.discard(string[i])\r\n \r\n # fill the substring with the missing letters\r\n nice_word = []\r\n for i in range(left, left+26):\r\n if string[i] == '?':\r\n nice_word.append(alphabet.pop())\r\n else:\r\n nice_word.append(string[i])\r\n \r\n # put the filled substring instead of the original substring\r\n output = [string[:left], ''.join(nice_word), string[left+26:]]\r\n \r\n # replace all the question marks with some letter\r\n print(''.join(output).replace('?', 'A'))\r\nelse:\r\n print(-1)", "s=[i for i in input()];n=len(s)\r\n#print(n)\r\nif n<26:print(-1)\r\nelse:\r\n for j in range(0,n-26+1):\r\n\r\n d=[0]*26;s1=s[j:j+26];q=0\r\n for i in s1:\r\n if i=='?':q+=1\r\n else:d[ord(i)-65]+=1\r\n #\r\n flag=True;a=[];need=0\r\n for i in range(26):\r\n if d[i]>1:flag=False;break\r\n elif d[i]==0:need+=1;a.append(chr(i+65))\r\n #\r\n flag1=False\r\n if flag and need==q:\r\n k=0\r\n for i in range(j,j+26):\r\n if s[i]=='?':s[i]=a[k];k+=1\r\n flag1=True\r\n if flag1:break\r\n\r\n#\r\n if not flag1:print(-1)\r\n else:\r\n for i in range(n):\r\n if s[i]=='?':s[i]='M'\r\n print(\"\".join(s))\r\n", "import string\n\ns = input()\n\nfor i in range(len(s)):\n cur = list(s[i:i+26])\n if len(cur) < 26:\n continue\n does_not_have = [x for x in string.ascii_uppercase if x not in cur]\n bad_index = [i for i, j in enumerate(cur) if j == '?']\n if len(does_not_have) == len(bad_index):\n for x, y in zip(does_not_have, bad_index):\n cur[y] = x\n s = s[:i] + (''.join(cur)) + s[i+26:]\n s = s.replace('?', 'A')\n print(s)\n break\nelse:\n print(-1)\n", "def hello():\r\n s = list(input())\r\n l = len(s)\r\n import string\r\n upper = list(string.ascii_uppercase)\r\n copy = upper[:]\r\n for i in range(l-25):\r\n copy = upper[:]\r\n count = 0\r\n index = []\r\n for j in range(i,i+26):\r\n if s[j] == \"?\":\r\n count += 1\r\n index.append(j)\r\n elif s[j] in copy:\r\n copy.remove(s[j])\r\n else: break\r\n if count == len(copy):\r\n for k in range(count):\r\n s[index[k]] = copy.pop()\r\n for o in range(l):\r\n if s[o] == \"?\": s[o] = \"A\"\r\n break\r\n else:\r\n print(-1)\r\n return\r\n print(\"\".join(s))\r\nhello() " ]

[ "\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = {'S':0, 'L':0, 'M':0, 'XS':0, 'XL':0, 'XXS':0, 'XXL':0, 'XXXS':0, 'XXXL':0}\r\nfor i in range(n):\r\n d[input()[:-1]] += 1\r\nfor i in range(n):\r\n d[input()[:-1]] -= 1\r\n\r\nc = 0\r\nfor i in d:\r\n if d[i] > 0:\r\n c += d[i]\r\nprint(c)\r\n", "r=[0]*int(input())\na=[*(input()for _ in r)]\nc=0\nfor _ in r:\n try:a.remove(input())\n except:c+=1\nprint(c)\n\t \t\t \t\t\t\t \t\t\t\t \t \t \t", "r=[0]*int(input())\r\na,c=[*(input()for m in r)],0\r\nfor l in r:\r\n try: a.remove(input())\r\n except: c+=1\r\nprint(c)", "import array\r\nimport bisect\r\nimport heapq\r\nimport math\r\nimport collections\r\nimport sys\r\nimport copy\r\nfrom functools import reduce\r\nimport decimal\r\nfrom io import BytesIO, IOBase\r\nimport os\r\nimport itertools\r\nimport functools\r\nfrom types import GeneratorType\r\nimport fractions\r\n\r\n# sys.setrecursionlimit(10 ** 9)\r\ndecimal.getcontext().rounding = decimal.ROUND_HALF_UP\r\n\r\ngraphDict = collections.defaultdict\r\n\r\nqueue = collections.deque\r\n\r\n\r\n################## pypy deep recursion handling ##############\r\n# Author = @pajenegod\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n to = f(*args, **kwargs)\r\n if stack:\r\n return to\r\n else:\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 return to\r\n to = stack[-1].send(to)\r\n\r\n return wrappedfunc\r\n\r\n\r\n################## Graphs ###################\r\nclass Graphs:\r\n def __init__(self):\r\n self.graph = graphDict(set)\r\n\r\n def add_edge(self, u, v):\r\n self.graph[u].add(v)\r\n self.graph[v].add(u)\r\n\r\n def dfs_utility(self, nodes, visited_nodes, colors, parity, level):\r\n global count\r\n if nodes == 1:\r\n colors[nodes] = -1\r\n else:\r\n if len(self.graph[nodes]) == 1 and parity % 2 == 0:\r\n if q == 1:\r\n colors[nodes] = 1\r\n else:\r\n colors[nodes] = -1\r\n count += 1\r\n else:\r\n if parity % 2 == 0:\r\n colors[nodes] = -1\r\n else:\r\n colors[nodes] = 1\r\n visited_nodes.add(nodes)\r\n for neighbour in self.graph[nodes]:\r\n new_level = level + 1\r\n if neighbour not in visited_nodes:\r\n self.dfs_utility(neighbour, visited_nodes, colors, level - 1, new_level)\r\n\r\n def dfs(self, node):\r\n Visited = set()\r\n color = collections.defaultdict()\r\n self.dfs_utility(node, Visited, color, 0, 0)\r\n return color\r\n\r\n def bfs(self, node, f_node):\r\n count = float(\"inf\")\r\n visited = set()\r\n level = 0\r\n if node not in visited:\r\n queue.append([node, level])\r\n visited.add(node)\r\n flag = 0\r\n while queue:\r\n parent = queue.popleft()\r\n if parent[0] == f_node:\r\n flag = 1\r\n count = min(count, parent[1])\r\n level = parent[1] + 1\r\n for item in self.graph[parent[0]]:\r\n if item not in visited:\r\n queue.append([item, level])\r\n visited.add(item)\r\n return count if flag else -1\r\n return False\r\n\r\n\r\n################### Tree Implementaion ##############\r\nclass Tree:\r\n def __init__(self, data):\r\n self.data = data\r\n self.left = None\r\n self.right = None\r\n\r\n\r\ndef inorder(node, lis):\r\n if node:\r\n inorder(node.left, lis)\r\n lis.append(node.data)\r\n inorder(node.right, lis)\r\n return lis\r\n\r\n\r\ndef leaf_node_sum(root):\r\n if root is None:\r\n return 0\r\n if root.left is None and root.right is None:\r\n return root.data\r\n return leaf_node_sum(root.left) + leaf_node_sum(root.right)\r\n\r\n\r\ndef hight(root):\r\n if root is None:\r\n return -1\r\n if root.left is None and root.right is None:\r\n return 0\r\n return max(hight(root.left), hight(root.right)) + 1\r\n\r\n\r\n################## Union Find #######################\r\nclass UnionFind():\r\n parents = []\r\n sizes = []\r\n count = 0\r\n\r\n def __init__(self, n):\r\n self.count = n\r\n self.parents = [i for i in range(n)]\r\n self.sizes = [1 for i in range(n)]\r\n\r\n def find(self, i):\r\n if self.parents[i] == i:\r\n return i\r\n else:\r\n self.parents[i] = self.find(self.parents[i])\r\n return self.parents[i]\r\n\r\n def unite(self, i, j):\r\n root_i = self.find(i)\r\n root_j = self.find(j)\r\n if root_i == root_j:\r\n return\r\n elif root_i < root_j:\r\n self.parents[root_j] = root_i\r\n self.sizes[root_i] += self.sizes[root_j]\r\n else:\r\n self.parents[root_i] = root_j\r\n self.sizes[root_j] += self.sizes[root_i]\r\n\r\n def same(self, i, j):\r\n return self.find(i) == self.find(j)\r\n\r\n def size(self, i):\r\n return self.sizes[self.find(i)]\r\n\r\n def group_count(self):\r\n return len(set(self.find(i) for i in range(self.count)))\r\n\r\n def answer(self, extra, p, q):\r\n dic = collections.Counter()\r\n for q in range(n):\r\n dic[self.find(q)] = self.size(q)\r\n hq = list(dic.values())\r\n heapq._heapify_max(hq)\r\n ans = -1\r\n for z in range(extra + 1):\r\n if hq:\r\n ans += heapq._heappop_max(hq)\r\n else:\r\n break\r\n return ans\r\n\r\n\r\n#################################################\r\n\r\ndef rounding(n):\r\n return int(decimal.Decimal(f'{n}').to_integral_value())\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), [1]))\r\n\r\n\r\ndef p_sum(array):\r\n return list(itertools.accumulate(array))\r\n\r\n\r\ndef base_change(nn, bb):\r\n if nn == 0:\r\n return [0]\r\n digits = []\r\n while nn:\r\n digits.append(int(nn % bb))\r\n nn //= bb\r\n return digits[::-1]\r\n\r\n\r\ndef diophantine(a: int, b: int, c: int):\r\n d, x, y = extended_gcd(a, b)\r\n r = c // d\r\n return r * x, r * y\r\n\r\n\r\n@bootstrap\r\ndef extended_gcd(a: int, b: int):\r\n if b == 0:\r\n d, x, y = a, 1, 0\r\n else:\r\n (d, p, q) = yield extended_gcd(b, a % b)\r\n x = q\r\n y = p - q * (a // b)\r\n\r\n yield d, x, y\r\n\r\n\r\n######################################################################################\r\n\r\n'''\r\nKnowledge and awareness are vague, and perhaps better called illusions.\r\nEveryone lives within their own subjective interpretation.\r\n ~Uchiha Itachi\r\n'''\r\n\r\n################################ <fast I/O> ###########################################\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, **kwargs):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n\r\n\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n\r\n\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n\r\n\r\n#############################################<I/O Region >##############################################\r\n\r\n\r\ndef inp():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef map_inp(v_type):\r\n return map(v_type, inp().split())\r\n\r\n\r\ndef list_inp(v_type):\r\n return list(map_inp(v_type))\r\n\r\n\r\ndef interactive():\r\n return sys.stdout.flush()\r\n\r\n\r\n######################################## Solution ####################################\r\n\r\nn = int(inp())\r\na = []\r\nb = []\r\nfor i in range(n):\r\n s = inp()\r\n s.replace(\"X\", s[-1])\r\n a.append(s)\r\nfor i in range(n):\r\n s = inp()\r\n s.replace(\"X\", s[-1])\r\n b.append(s)\r\ndic1 = collections.Counter(a)\r\ndic2 = collections.Counter(b)\r\nans = 0\r\nfor i in dic1.keys():\r\n if dic1[i] > dic2[i]:\r\n ans += dic1[i] - dic2[i]\r\nprint(ans)\r\n", "def solute(list1,list2):\n dic1={}\n dic2={}\n a1=list(enumerate(list1))\n a2=list(enumerate(list2))\n list1_same=list(set(list1)) #list1去重\n list2_same=list(set(list2))\n for i in range (0,len(list1_same)):\n dic1[list1_same[i]]=[j for j,k in a1 if k==list1_same[i]]\n for i in range (0,len(list2_same)):\n dic2[list2_same[i]]=[j for j,k in a2 if k==list2_same[i]]\n key1=dic1.keys()\n key2=dic2.keys()\n sum=0\n for i in key1:\n if i in key2:\n sum+=min(len(dic1[i]),len(dic2[i]))\n else:\n continue\n return sum\n\nnum=int(input())\nsize_list1=[]\nsize_list2=[]\nfor i in range(num):\n size1=str(input())\n size_list1.append(size1)\nfor i in range(num):\n size2=str(input())\n size_list2.append(size2)\nanswer=num-solute(size_list1,size_list2)\nprint(answer)\n \t\t \t\t\t\t \t \t\t\t\t \t\t \t \t \t\t", "total_number = eval(input())#获得总T恤数\nline_number1 = 1\nline_number2 = 1\npr_Tshirt = []\ncu_Tshirt = []\n\nwhile line_number1 <= total_number:\n pr_Tshirt.append(input())\n line_number1 += 1\n #通过扫描加入去年的Tshirt号\nwhile line_number2 <= total_number:\n cu_Tshirt.append(input())\n line_number2 += 1\n #通过扫描加入今年的Tshirt号\n#print(pr_Tshirt)\n#print(cu_Tshirt)\ni = 0\nnum = 0\nwhile i < total_number:\n if pr_Tshirt[i] not in cu_Tshirt:\n num += 1\n else:\n cu_Tshirt.pop(cu_Tshirt.index(pr_Tshirt[i]))\n i += 1\nprint(num)\n \t\t \t\t \t \t\t\t \t\t\t\t\t \t\t\t\t", "n=int(input())\na=[*(input()for _ in[0]*n)]\nfor _ in[0]*n:\n try:a.remove(input())\n except:pass\nprint(len(a))\n\t \t \t\t \t \t\t\t \t\t \t \t \t", "n = int(input())\na = []\nfor i in range(n):\n a.append(input())\n \n \nfor i in range(n):\n a1 = input()\n if a1 in a:\n a.remove(a1)\n \nprint(len(a))\n \t \t\t \t\t \t\t \t\t \t \t\t \t\t\t \t", "n=int(input())\r\na=[*(input()for _ in[0]*n)]\r\nfor _ in[0]*n:\r\n try:a.remove(input())\r\n except:pass\r\nprint(len(a))", "n = int(input())\r\n \r\na = [input() for _ in range(n)]\r\nb = [input() for _ in range(n)]\r\n \r\ncost = 0\r\nfor s in [\"M\", \"S\", \"XS\", \"XXS\", \"XXXS\", \"L\", \"XL\", \"XXL\", \"XXXL\"]:\r\n ca = a.count(s)\r\n cb = b.count(s)\r\n cost += ca - min(ca, cb)\r\n \r\nprint(cost)", "r=[0]*int(input())\r\na=[*(input()for _ in r)]\r\nc=0\r\nfor _ in r:\r\n try:a.remove(input())\r\n except:c+=1\r\nprint(c)" ]

[ "from re import I\r\n\r\n\r\na = list(map(int,input().split()))\r\nmax = 0\r\nfor i in range(14):\r\n if a[i]>0:\r\n j = i+1 \r\n add_to_every = a[i]//14\r\n rem = a[i]%14\r\n temp =[x for x in a]\r\n temp[i]=0\r\n temp = [x+add_to_every for x in temp]\r\n while rem>0:\r\n temp[j%14]+=1\r\n rem-=1\r\n j+=1\r\n sum = 0\r\n for i in range(14):\r\n if temp[i]%2==0:\r\n sum+=temp[i]\r\n #print(temp)\r\n if sum>max:\r\n max=sum\r\nprint(max)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nq = list(map(int, input().split()))\r\n\r\nz = 0\r\nfor c in range(14):\r\n if q[c] != 0:\r\n w = q[::]\r\n x = w[c]\r\n a = x // 14\r\n b = x % 14\r\n w[c] = 0\r\n\r\n for i in range(14):\r\n w[i] += a\r\n while b:\r\n c += 1\r\n if c == 14:\r\n c = 0\r\n w[c] += 1\r\n b -= 1\r\n n = sum(i for i in w if i%2==0)\r\n if n > z:\r\n z = n\r\nprint(z)\r\n", "a = list(map(int, input().split()))\nm = 0\nfor i in range(len(a)):\n ai = a[i]\n giri = int(ai/14)\n modulo = ai % 14\n tmp = a[i]\n a[i] = 0\n s = 0\n for j in range(len(a)):\n if (a[j] + giri) % 2 == 0:\n s += a[j] + giri\n j = (i+1)%14\n cont = 1\n while cont <= modulo:\n if (a[j] + giri) % 2 != 0:\n s += a[j] + giri + 1\n else:\n s -= a[j] + giri\n cont += 1\n j = (j+1) % 14\n \n a[i] = tmp\n m = max(s, m)\nprint(m)\n", "if __name__ == '__main__':\r\n a = [int(i) for i in input().split()]\r\n\r\n mx = -1\r\n\r\n for i in range(14):\r\n b = a.copy()\r\n if a[i]:\r\n b[i], d, ans = 0, i + 1, 0\r\n r = (a[i] + d) // 14\r\n l = (a[i] + d) % 14\r\n\r\n if d + a[i] < 14:\r\n ans = sum([j + 1 for j in a[d:d + a[i]] if not (j + 1) % 2])\r\n else:\r\n for j in range(14):\r\n b[j] += r\r\n if d > l:\r\n for j in range(l, d):\r\n b[j] -= 1\r\n else:\r\n for j in range(d, d + abs(d - l)):\r\n b[j] += 1\r\n ans = sum([p for p in b if not p % 2])\r\n mx = max(mx, ans)\r\n\r\n print(mx)\r\n", "def solve():\r\n # Read input list a\r\n a = list(map(int, input().split()))\r\n # number of elements in list are 14\r\n n = 14\r\n max_score, sum_even_elements = 0, 0\r\n # iterate through all holes, pick a[i] hole and see the score achieved by it\r\n for i in range(n):\r\n if a[i] == 0:\r\n continue\r\n\r\n # backup of input list\r\n b = a.copy()\r\n x = b[i]\r\n b[i] = 0\r\n # distribute x stones in next holes as described in problem.\r\n full = x//n\r\n rem = x%n\r\n \r\n # distribute full to all 14 holes\r\n for j in range(n):\r\n b[j] += full\r\n for j in range(rem):\r\n b[(i+1+j)%n] += 1\r\n # distribution is over. Now, count all even elements in b\r\n for j in range(n):\r\n if b[j]%2 == 0:\r\n sum_even_elements += b[j]\r\n max_score = max(max_score, sum_even_elements)\r\n sum_even_elements = 0\r\n print(max_score)\r\n\r\nsolve()", "grid = list(map(int,input().split()))\r\nmax_res = 0\r\nfor i in range(14):\r\n g_c = grid.copy()\r\n Amount = g_c[i]//14\r\n Amount_r = g_c[i]%14\r\n if(Amount > 0): \r\n for j in range(14):\r\n if i != (i+j+1)%14:\r\n g_c[(i+j+1)%14]+=Amount\r\n g_c[i]-=Amount \r\n if Amount_r > 0:\r\n for j in range(14):\r\n if Amount_r > 0:\r\n if i != (i+j+1)%14:\r\n g_c[(i+j+1)%14]+=1\r\n Amount_r-=1\r\n g_c[i]-=1\r\n else:\r\n break\r\n \r\n res = 0\r\n for i in range(14):\r\n if g_c[i] % 2 ==0: \r\n res+=g_c[i]\r\n \r\n max_res = max(max_res,res)\r\n\r\nprint(max_res) \r\n ", "def fun(l):\r\n return sum(list(filter(lambda x:(x%2==0),l)))\r\nl=list(map(lambda x:int(x),input().split()))\r\nans=0\r\n# print(l)\r\nfor i in range(14):\r\n tmp=l[:]\r\n tmp[i]=0\r\n for j in range(i+1,i+15):\r\n tmp[j%14]+=l[i]//14\r\n for j in range(i+1,i+1+l[i]%14):\r\n tmp[j%14]+=1\r\n ans=max(ans,fun(tmp))\r\nprint(ans)\r\n", "a=list(map(int,input().split()))\r\nres=0\r\nfor i in range(14):\r\n\tif a[i]==0: continue\r\n\td=a[i]//14\r\n\tr=a[i]%14\r\n\tb=a.copy()\r\n\tb[i]=0\r\n\tans=0\r\n\tfor j in range(1,r+1): b[(i+j)%14]+=1\r\n\tfor j in range(0,14):\r\n\t\tb[j]+=d\r\n\t\tif b[j]%2==0: ans+=b[j]\r\n\tif ans>res: res=ans\r\nprint(res)", "a = list(map(int, input().split()))\r\n\r\nr = 0\r\n\r\nfor i in range(len(a)):\r\n t = a[i]\r\n\r\n if t == 0: continue\r\n\r\n b = a.copy()\r\n b[i] = 0\r\n\r\n for j in range(i+1, i+1+len(b)):\r\n b[j % len(b)] += t // len(b)\r\n \r\n t %= len(b)\r\n\r\n for j in range(i+1, i+1+t):\r\n b[j % len(b)] += 1\r\n \r\n r = max(r, sum(k for k in b if k % 2 == 0))\r\n\r\nprint(r)", "a=list(map(int,input().split()))\r\nmr=0\r\nfor t in range(14):\r\n b=list(a)\r\n m=b[t]\r\n k=t\r\n i=1\r\n b[k]=0\r\n while(m>0):\r\n if(m//14==0):\r\n b[(k+i)%14]+=1\r\n m-=1\r\n i+=1\r\n else:\r\n q=m//14\r\n for c in range(14):\r\n b[c]+=q\r\n m-=14*q\r\n p=sum([ x for x in b if x%2==0 ])\r\n mr=max(p,mr)\r\nprint(mr)\r\n \r\n \r\n", "a=list(map(int,input().split()))\r\nans=0\r\nfor i in range(14):\r\n x=a[i]//14\r\n y=a[i]%14\r\n s=a.copy()\r\n s[i]=0\r\n z=0\r\n for j in range(y):\r\n s[(i+1+j)%14]+=1\r\n for k in range(14):\r\n if (s[k]+x)%2==0:\r\n z+=s[k]+x\r\n ans=max(ans,z)\r\nprint(ans)\r\n", "import copy\nR = lambda : map(int, input().split())\ns = list(R())\nr = 0\nfor i in range(14):\n a = s[i]\n if a!=0:\n s1 = s.copy()\n s1[i]=0\n #print(s1)\n a1,a2 = a//14,a%14\n s2 = [a1+1]*a2\n s2.extend([a1]*(14-a2))\n #print(s2)\n #print('-')\n s3 = s1[i+1:14]\n s3.extend(s1[0:i+1])\n #print(s3)\n r1 = sum(list(filter(lambda x:x%2==0,map(lambda x:sum(x),zip(s2,s3)))))\n r = max(r,r1)\n #print('-----')\nprint(r)\n", "def main():\r\n numbers = list(map(int, input().split()))\r\n v = []\r\n\r\n for i in range(14):\r\n v.append(numbers[i])\r\n\r\n result = 0\r\n for i in range(14):\r\n k = numbers[i]\r\n v[i] = 0\r\n c = int(k / 14)\r\n d = k % 14\r\n\r\n for j in range(14):\r\n v[j] = v[j] + c\r\n j = i + 1\r\n while j <= 13 and d > 0:\r\n v[j] = v[j] + 1\r\n j = j + 1\r\n d = d - 1\r\n for j in range(d):\r\n v[j] = v[j] + 1\r\n\r\n sum = 0\r\n for j in range(14):\r\n if v[j] % 2 == 0:\r\n sum = sum + v[j]\r\n\r\n result = max(result, sum)\r\n\r\n for j in range(14):\r\n v[j] = numbers[j]\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n", "from copy import deepcopy\r\na = list(map(int,input().split()))\r\nans = 0\r\nfor i in range(14):\r\n if not a[i]:\r\n continue\r\n b = deepcopy(a)\r\n div,mod = divmod(b[i],14)\r\n b[i] = 0\r\n for j in range(i+1,i+1+mod):\r\n b[j%14] += 1\r\n b = [x+div for x in b]\r\n ans = max(ans,sum([x for x in b if x%2==0]))\r\nprint(ans)", "def main():\r\n stones = get_list_int()\r\n\r\n max_score = 0\r\n n = len(stones)\r\n\r\n for i in range(n):\r\n stones_copy = stones[:]\r\n\r\n if stones_copy[i] == 0:\r\n continue\r\n\r\n div, mod = divmod(stones_copy[i], n)\r\n stones_copy[i] = 0\r\n\r\n for j in range(n):\r\n stones_copy[j] += div\r\n\r\n for j in range(mod):\r\n stones_copy[(i + j + 1) % n] += 1\r\n\r\n score = 0\r\n\r\n for stone in stones_copy:\r\n if stone % 2 == 0:\r\n score += stone\r\n\r\n if score > max_score:\r\n max_score = score\r\n\r\n print(max_score)\r\n\r\n\r\ndef get_int() -> int:\r\n return int(input())\r\n\r\n\r\ndef get_list_int() -> list[int]:\r\n return [int(x) for x in input().split(\" \")]\r\n\r\n\r\ndef get_list_str() -> list[str]:\r\n return input().split(\" \")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "a = list(map(int, input().split()))\r\ntotal_sum = 0\r\nfor i, b in enumerate(a):\r\n sum = 0\r\n tmp = b % 14\r\n ave = b // 14\r\n for h in range(1, 15):\r\n tmp_no = (i + h) % 14\r\n if h <= tmp:\r\n sub_sum = a[tmp_no] + 1 + ave\r\n elif tmp_no == i:\r\n sub_sum = ave\r\n else:\r\n sub_sum = a[tmp_no] + ave\r\n if not sub_sum % 2:\r\n sum += sub_sum\r\n total_sum = max(total_sum, sum)\r\n\r\nprint(total_sum)\r\n\r\n\r\n", "l=list(map(int,input().split()))\r\nans=0\r\nfor i in range(14):\r\n\ta=[]\r\n\tm=0\r\n\ta.extend(l)\r\n\tc=a[i]//14\r\n\td=a[i]%14\r\n\ta[i]=0\r\n\tj=1\r\n\twhile(j<=d):\r\n\t\tk=(i+j)%14\r\n\t\ta[k]+=1\r\n\t\tj+=1\r\n\tfor j in range(14):\r\n\t\ta[j]+=c\r\n\t\tif a[j]%2==0:\r\n\t\t\tm+=a[j]\r\n\tans=max(ans, m)\r\nprint(ans)", "from copy import deepcopy\n\n\nholes = [int(x) for x in input().split()]\n\nm = 0\n\nfor i in range(14):\n game = deepcopy(holes)\n if game[i] == 0:\n continue\n stones = game[i]\n # print(\"Beru z hromadky {}, kamenu je {}\".format(i, game[i]))\n loops, remainder = divmod(stones, 14)\n # print(\"Projdu se {}krat dokola a {} zbude\".format(loops, remainder))\n game[i] = 0\n for j in range(14):\n game[j] += loops\n for j in range(remainder):\n game[(i+j+1) % 14] += 1\n s = 0\n for j in range(14):\n if game[j] & 1 == 0:\n s += game[j]\n if s > m:\n m = s\n\nprint(m)\n", "A = list(map(int, input().split()))\r\nX = []\r\n\r\nfor i in range(14):\r\n if A[i]:\r\n B = A[:]\r\n x, y = divmod(B[i], 14)\r\n B[i] = 0\r\n for j in range(14):\r\n B[j] += x\r\n for j in range(i-13, y+i-13):\r\n B[j] += 1\r\n X.append(sum(b for b in B if not b%2))\r\n\r\nprint(max(X))", "A=list(map(int,input().split()))\r\nscore=0\r\nfor i in range(14):\r\n score=max(score,sum([j for j in [(A[j] if i!=j else 0)+A[i]//14+(1 if (j+13-i)%14<A[i]%14 else 0) for j in range(14)] if j%2==0]))\r\nprint(score)\r\n", "import sys\r\nimport math\r\n\r\nlista=[int(x) for x in input().strip().split()]\r\ntug=lista\r\ncota=[]\r\n\r\nmaxa=-1e9\r\nfor i in range(len(lista)):\r\n cota = [0 for yu in range(14)]\r\n suma=0\r\n if(lista[i] is not 0):\r\n if(lista[i]>=13-i):\r\n\r\n flen=13-i\r\n loop=(lista[i]-flen)//14\r\n back=lista[i]-(loop*14)-flen\r\n\r\n for j in range(14):\r\n cota[j]+=loop+lista[j]\r\n if(j==i):\r\n cota[j]-=lista[j]\r\n\r\n for m in range(i+1,14):\r\n cota[m]+=1\r\n\r\n for t in range(0,back):\r\n cota[t]+=1\r\n\r\n else:\r\n for j in range(14):\r\n cota[j]+=lista[j]\r\n if(j==i):\r\n cota[j]-=lista[j]\r\n flen=lista[i]\r\n for m in range(i+1,i+1+lista[i]):\r\n cota[m]+=1\r\n\r\n for i in range(14):\r\n if(cota[i]%2==0):\r\n suma+=cota[i]\r\n maxa=max(suma,maxa)\r\nprint(maxa)\r\n", "from math import ceil\r\n\r\nX, Answer = list(map(int, input().split())) , []\r\nCheck = [i for i in range(14) if X[i] != 0]\r\nfor i in Check:\r\n Temp,Stone = X[:], X[i]\r\n Temp[i] = 0\r\n Sum, Num = 0, 14\r\n index = (i + 1) % 14\r\n while Stone!= 0 :\r\n SumTemp = ceil(Stone / Num)\r\n Temp[index] += SumTemp\r\n Stone -= SumTemp\r\n Sum += (Temp[index] if Temp[index] % 2 == 0 else 0)\r\n index = (index + 1) % 14\r\n Num -= 1\r\n Answer.append(Sum)\r\nprint(max(Answer))\r\n\r\n# Show you deserve being the best to whom doesn't believe in you.\r\n# Location: On the way, Tabas to Mashhad\r\n# Tomorrow Location: On the way, Mashhad to Bojnord\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\nans = 0\r\nfor i in range(14):\r\n b = list(a)\r\n c = b[i]\r\n b[i] = 0\r\n u = c // 14\r\n for j in range(14):\r\n b[j] += u\r\n for j in range(c % 14):\r\n b[(i + j + 1) % 14] += 1\r\n cnt = 0\r\n for i in b:\r\n if not i % 2:\r\n cnt += i\r\n ans = max(ans, cnt)\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\ndef print_list(s):\r\n print(''.join(map(str, s)))\r\n\r\n\r\n'''\r\n'''\r\na = list(tuple_input(int))\r\n\r\nres = 0\r\nfor i in range(len(a)):\r\n b = list(a) \r\n d = b[i] // 14\r\n r = b[i] % 14\r\n b[i] = 0\r\n for j in range(len(b)):\r\n b[j] += d\r\n p = (i + 1) % 14\r\n for _ in range(r):\r\n b[p] += 1\r\n p = (p + 1) % 14\r\n tot = 0\r\n for j in range(len(b)):\r\n if b[j] % 2 == 0:\r\n tot += b[j]\r\n res = max(res, tot)\r\nprint(res)", "a = list(map(int, input().split()))\r\n\r\nmx = 0\r\nfor i in range(14):\r\n x = a.copy()\r\n n = x[i]\r\n x[i] = 0\r\n for j in range(i+1, 14):\r\n x[j] += 1\r\n n -= 1\r\n p = n//14\r\n for j in range(14):\r\n x[j] += p\r\n p = n %14\r\n z = 0\r\n while p > 0:\r\n x[z] += 1\r\n p -= 1\r\n z+=1\r\n s = 0\r\n for j in range(14):\r\n if x[j] & 1 == 0:\r\n s += x[j]\r\n mx = max(mx, s)\r\nprint(mx)", "from copy import copy\nqaq = 0\nA = list(map(int, input().split()))\nfor z in range(14):\n if A[z] != 0:\n K = copy(A)\n K[z] = 0\n for t in range(len(K)):\n K[t] += A[z] // 14\n for u in range(z+1, z+1+A[z]%14):\n u %= 14\n K[u] += 1\n cnt = 0\n for t in K:\n if t%2 == 0:\n cnt += t\n qaq = max(qaq, cnt)\nprint(qaq)", "l=[int(i) for i in input().split()]\r\nzuida=0\r\nfor i in range(14):\r\n s=l.copy()\r\n j=s[i]%14\r\n k=s[i]//14\r\n s[i]=0\r\n for h in range(14):\r\n s[h] = s[h] + k\r\n for h in range(i+1, i+1+j):\r\n s[h%14] = s[h%14] + 1\r\n zuida = max(zuida, sum([h if h%2==0 else 0 for h in s]))\r\nprint(zuida)\r\n \r\n", "import sys\r\nlist_of_numbers=list(map(int,sys.stdin.readline().split(' ')))\r\nlength=len(list_of_numbers)\r\ndef find_value_for_index(list_of_numbers,index,length):\r\n newlist_of_numbers=list_of_numbers.copy()\r\n number=newlist_of_numbers[index]\r\n newlist_of_numbers[index]=0\r\n for i in range(length):\r\n newlist_of_numbers[i]+=number//14\r\n i=index\r\n number=number%14\r\n while(number>0):\r\n i=(i+1)%14\r\n newlist_of_numbers[i]+=1\r\n number-=1\r\n score=0\r\n for i in newlist_of_numbers:\r\n if i%2==0:\r\n score+=i\r\n #print(index)\r\n\r\n return score\r\nmax_score=0 \r\nfor i in range(length):\r\n if(list_of_numbers[i]%2!=0):\r\n score=find_value_for_index(list_of_numbers,i,length)\r\n if(score>max_score):\r\n max_score=score\r\nprint(max_score)\r\n", "board = list(map(int, input().split()))\r\n\r\nans = 0\r\n\r\nfor i in range(14):\r\n\tif board[i] != 0:\r\n\t\tdiv = board[i]//14\r\n\t\trem=0\r\n\t\tif div==0:\r\n\t\t\trem = board[i]\r\n\t\telse:\r\n\t\t\trem = board[i]%14\r\n\t\ttemp = [x+div for x in board]\r\n\t\ttemp[i] = div\r\n\t\tk=i+1\r\n\t\tfor j in range(rem):\r\n\t\t\tif k>=14:\r\n\t\t\t\tk=0\r\n\t\t\ttemp[k]+=1\r\n\t\t\tk+=1\r\n\t\ttSum = 0\r\n\t\tfor j in temp:\r\n\t\t\tif j%2==0:\r\n\t\t\t\ttSum+=j\r\n\t\tif tSum>ans:\r\n\t\t\tans = tSum\t\r\nprint(ans)", "a=list(map(int,input().split()))\r\nmx=0\r\nfor i in range(len(a)):\r\n b=[]\r\n for k in a:\r\n b.append(k)\r\n b[i]=0\r\n c=a[i]//14\r\n cc=a[i]%14\r\n for j in range(len(b)):\r\n b[j]+=c\r\n k=i+1\r\n while cc!=0:\r\n k%=14\r\n b[k]+=1\r\n k+=1\r\n cc-=1\r\n kl=0\r\n for j in range(len(b)):\r\n if b[j]%2==0:\r\n kl+=b[j]\r\n mx=max(mx,kl)\r\nprint(mx)\r\n\r\n", "if __name__ == \"__main__\":\r\n numbers = list(map(int, input().split()))\r\n v = []\r\n\r\n for i in range(14):\r\n v.append(numbers[i])\r\n\r\n result = 0\r\n for i in range(14):\r\n k = numbers[i]\r\n v[i] = 0\r\n c = int(k / 14)\r\n d = k % 14\r\n\r\n for j in range(14):\r\n v[j] = v[j] + c\r\n j = i + 1\r\n while j <= 13 and d > 0:\r\n v[j] = v[j] + 1\r\n j = j + 1\r\n d = d - 1\r\n for j in range(d):\r\n v[j] = v[j] + 1\r\n \r\n suma = 0\r\n for j in range(14):\r\n if v[j] % 2 == 0:\r\n suma = suma + v[j]\r\n\r\n result = max(result, suma)\r\n\r\n for j in range(14):\r\n v[j] = numbers[j]\r\n\r\n print(result)\r\n ", "a=list(map(int,input().split()))\r\nANS=c=0\r\nfor i in range(14):\r\n x=a[0]//14\r\n y=a[0]%14\r\n s=sum(a)-a[0]\r\n l=sum(a[1:y+1:])\r\n try:\r\n n=a[1:y+1:].count(0)\r\n except:\r\n n=0\r\n try: \r\n z=a[y+1::].count(0)+1\r\n except:\r\n z=1\r\n if x%2==0:\r\n ANS=(y-n)+l+x*(y-n)+x*(z)\r\n else:\r\n ANS=(s-l)+x*(14-y-z)+(n)+x*n\r\n c=max(ANS,c)\r\n a.append(a[0])\r\n a.remove(a[0])\r\n \r\nprint(c)\r\n \r\n \r\n \r\n ", "a = [int(w) for w in input().split()]\n\ndef score(i):\n b = a[i+1:] + a[0:i] + [0]\n for j in range(14):\n b[j] += a[i] // 14\n for j in range(a[i] % 14):\n b[j] += 1\n return sum(x for x in b if x % 2 == 0)\n\nprint(max(score(i) for i in range(14)))\n", "mx=-1\r\nn=[int(i) for i in input().split()]\r\nfor i in range(14):\r\n arr=n[:]\r\n st=arr[i]\r\n arr[i]=0\r\n loop = st//14\r\n ans=0\r\n for j in range(14):\r\n arr[j]+=loop\r\n for j in range(1,st%14+1):\r\n arr[(i+j)%14]+=1\r\n for i in arr:\r\n if(i%2==0):\r\n ans+=i\r\n mx = max(mx,ans)\r\nprint(mx)\r\n", "init_stone = list(map(int,input().split()))\r\n\r\nmax_score = -1\r\n\r\nfor i in range(14):\r\n released = init_stone[i] // 14\r\n leftover = init_stone[i] % 14\r\n res_stone = list(init_stone)\r\n res_stone[i] = 0\r\n for j in range(1,leftover+1):\r\n res_stone[(i+j) % 14] += 1\r\n score = 0\r\n\r\n for j in range(14):\r\n if (res_stone[j] + released) % 2 == 0:\r\n score += (res_stone[j] + released)\r\n if max_score < score:\r\n max_score = score\r\n\r\nprint(max_score)\r\n", "a = list(map(int, input().split()))\nn = 14\nf = lambda a: sum(x for x in a if x & 1 ^ 1)\ndef g(a, x): \n b = a[:]\n y = a[x]\n b[x] = 0\n for i in range(n):\n b[i] += y // n\n y %= n\n for i in range(x + 1, y + x + 1):\n b[i % 14] += 1\n return f(b)\nprint(max(g(a, i) for i in range(n)))\n", "a = list(map(int, input().split()))\r\nnum = 0\r\nfor i in range(14):\r\n rec = 0\r\n p = a[::]\r\n q = p[i] // 14\r\n mod = p[i] % 14\r\n p[i] = 0\r\n if q > 0:\r\n for j in range(14):\r\n p[j] += q\r\n j = i + 1\r\n while mod > 0:\r\n if j == 14:\r\n j = 0\r\n p[j] += 1\r\n j += 1\r\n mod -= 1\r\n\r\n for k in range(14):\r\n if p[k] % 2 == 0:\r\n rec += p[k]\r\n num = max(num, rec)\r\n\r\nprint(num)", "list1 = list(map(int,input().split()))\r\nsum1 = 0\r\nfor i in range(len(list1)):\r\n\ts = int(list1[i]/14)\r\n\tmod = list1[i]%14\r\n\ttempS = 0\r\n\tif(s%2 == 0):\r\n\t\ttempS += s\r\n\tfor j in range(1,len(list1)):\r\n\r\n\t\tif((list1[(i+j)%14]+(mod > 0)+ s)%2 == 0):\r\n\t\t\ttempS += list1[(i+j)%14]+(mod > 0)+ s\r\n\t\tmod -= 1\r\n\tsum1 = max(sum1,tempS)\r\nprint(sum1)", "a=list(map(int,input().split()))\nm=0\nfor i in range(0,14):\n\tc=0\n\tb=a.copy()\n\tif (b[i]!=0):\n\t\t\n\t\tk=b[i]\n\t\tb[i]=0\n\t\tfor j in range(i+1,14):\n\t\t\tb[j]+=1\n\t\t\tk-=1\n\t\t\tif(k==0):\n\t\t\t\tbreak\n\t\tp=k//14\n\t\tk=k%14\n\t\tfor j in range(0,14):\n\t\t\tb[j]=b[j]+p\n\t\tfor j in range(0,14):\n\t\t\tif(k==0):\n\t\t\t\tbreak\n\t\t\tb[j]+=1\n\t\t\tk-=1\n\t\tfor j in range(0,14):\n\t\t\tif(b[j]%2==0):\n\t\t\t\tc=c+b[j]\n\t\t\n\t\tif(c>m):\n\t\t\t\n\t\t\tm=c\nprint(m)\n\n\n", "a = [int(i) for i in input().split()]\r\nans = 0\r\nfor i in range(14):\r\n if(a[i] > 0):\r\n b = a[:]\r\n tmp = a[i]\r\n b[i] = 0\r\n for j in range(i + 1,14):\r\n b[j] += 1\r\n tmp -= 1\r\n if(tmp == 0):break\r\n for j in range(14):b[j] += tmp // 14\r\n for j in range(tmp % 14):b[j] += 1\r\n sum = 0\r\n for j in range(14):\r\n if(b[j] % 2 == 0):\r\n sum += b[j]\r\n ans = max(sum,ans)\r\nprint(ans)\r\n\r\n", "holes = list(map(int,input().split()))\n#print(holes)\nn = 14\nm = 0\nfor i in range(n):\n temp = holes[:]\n x = temp[i]\n temp[i] = 0\n for j in range(n):\n temp[j] += x//n\n x %= n\n while x:\n i = (i+1)%n\n temp[i]+=1\n x-=1\n m = max(m, sum(x for x in temp if x&1<1))\nprint(m)\n", "a=list(map(int,input().split()))\r\na+=a\r\n\r\nans=0\r\nfor i in range(14):\r\n if a[i]!=0:\r\n x=a[i]//14\r\n r=a[i]%14\r\n ct=0\r\n for j in range(i,i+14):\r\n if j==i:\r\n if x%2==0:\r\n ct+=x\r\n else:\r\n if j<=i+r:\r\n if (x+a[j]+1)%2==0:\r\n ct+=x+a[j]+1\r\n else:\r\n if (x+a[j])%2==0:\r\n ct+=x+a[j]\r\n ans=max(ct,ans)\r\nprint(ans)", "l=list(map(int,input().split()))\r\ns=[]\r\nfor i in l:\r\n s.append(i)\r\nm=0\r\nfor i in range(14):\r\n if(l[i]>0):\r\n c=0\r\n x=l[i]%14\r\n y=l[i]//14\r\n d=s\r\n d[i]=0\r\n for j in range(1,x+1):\r\n d[(i+j)%14]+=1\r\n for j in range(14):\r\n d[j]+=y\r\n for j in range(14):\r\n if((d[j])%2==0):\r\n c+=d[j]\r\n m=max(c,m)\r\n s=[]\r\n for i in l:\r\n s.append(i)\r\nprint(m)\r\n", "def f(a, x, y, i):\r\n a[i] = 0\r\n i = (i + 1) %14\r\n while y != 0:\r\n a[i] += 1\r\n i = (i + 1) % 14\r\n y -= 1\r\n s = 0\r\n for i in range(14):\r\n a[i] += x\r\n if a[i] % 2 == 0:\r\n s = s + a[i]\r\n return s\r\n\r\n\r\narr = list(map(int, input().split()))\r\nm = 0\r\nfor i in range(14):\r\n if arr[i] == 0:\r\n next\r\n else:\r\n x = arr[i] // 14\r\n y = arr[i] % 14\r\n q = f(arr.copy(), x, y, i)\r\n if q > m:\r\n m = q\r\nprint(m)\r\n", "l = list(map(int,input().split()))\r\nn = 0\r\nm=-1\r\nwhile(n<14):\r\n c=0\r\n g = l.copy()\r\n div = l[n]//14\r\n h = l[n]%14\r\n i = n+1\r\n sum = div*14\r\n g[n]=0\r\n while(sum):\r\n if i==14:\r\n i=0\r\n g[i]+=div\r\n sum-=div\r\n i+=1\r\n i = n+1\r\n while(h):\r\n if i==14:\r\n i=0\r\n g[i]+=1\r\n h-=1\r\n i+=1\r\n for j in g:\r\n if j%2==0:\r\n c+=j\r\n\r\n m = max(c,m)\r\n n+=1\r\nprint(m)\r\n\r\n", "l=list(map(int,input().split()))\r\nma1=0\r\nma2=0\r\nfor i in range(14):\r\n ma1=0\r\n l1=l.copy()\r\n if(l1[i]!=0):\r\n v=l1[i]\r\n l1[i]=0\r\n for j in range(14):\r\n l1[(i+j+1)%14]+=v//14\r\n while(v%14!=0):\r\n l1[(i+1)%14]+=1\r\n i+=1\r\n v-=1\r\n for j in range(14):\r\n if(l1[j]!=0 and l1[j]%2==0):\r\n ma1+=l1[j]\r\n if(ma1>ma2):\r\n ma2=ma1\r\nprint(ma2)", "n = 14\na = None\n\ndef checkCase(defList, i):\n\tglobal n\n\ta = list(defList)\n\tstone = a[i] % n\n\tstoneAll = a[i] // n\n\ta[i] = 0\n\tj = i+1\n\twhile (stone > 0):\n\t\tif (j >= n):\n\t\t\tj = 0\n\t\ta[j] += 1\n\t\tj += 1\n\t\tstone -= 1\n\n\tpickedUp = 0\n\tfor k in range(n):\n\t\ta[k] += stoneAll\n\t\tif (a[k] % 2 == 0):\n\t\t\tpickedUp += a[k]\n\n\treturn pickedUp\n\ndef main():\n\tglobal n, a\n\ta = [int(e) for e in input().split()]\n\n\tmaxStones = 0\n\tfor i in range(n):\n\t\tif (a[i] > 0):\n\t\t\tmaxStones = max(maxStones, checkCase(a, i))\n\n\tprint(maxStones)\n\nmain()", "nums = list(map(int, input().split()))\r\nres = 0\r\n# print(len(nums))\r\nfor i in range (0,len(nums)):\r\n copy_nums = nums[:]\r\n # compute the cost\r\n total_chunk = int(copy_nums[i]/len(nums))\r\n #print(total_chunk)\r\n total = int(copy_nums[i]%len(nums))\r\n #print(total)\r\n copy_nums[i] = 0\r\n for j in range(0,len(nums)):\r\n copy_nums[j] = copy_nums[j] + total_chunk\r\n next = (i+1)%len(nums)\r\n while total > 0:\r\n total = total -1\r\n copy_nums[next] = copy_nums[next] +1\r\n next = (next+1)%len(nums)\r\n wins = 0\r\n #print(copy_nums)\r\n for j in range (0,len(nums)):\r\n if copy_nums[j] %2 == 0:\r\n wins = wins + copy_nums[j]\r\n res = max(res, wins)\r\nprint(res)\r\n", "import sys, copy\r\n\r\narr = list(map(int, sys.stdin.readline().split()))\r\nans = 0\r\nfor i in range(14):\r\n temp = copy.deepcopy(arr)\r\n val = arr[i]\r\n temp[i] = 0\r\n for j in range(14):\r\n temp[j] += val // 14\r\n val %= 14\r\n idx = (i + 1) % 14\r\n while val > 0:\r\n temp[idx] += 1\r\n val -= 1\r\n idx = (idx + 1) % 14\r\n res = 0\r\n for i in temp:\r\n if i % 2 == 0:\r\n res += i\r\n ans = max(ans, res)\r\nprint(ans)", "m = list(map(int, input().split(\" \")))\n\ndef sum_even(ar):\n s = 0\n for el in ar:\n if el % 2 == 0:\n s += el\n return s\n\nans = 0\nfor i in range(14):\n plus_all = m[i] // 14\n plus_other = m[i] % 14\n new_f = m[:]\n new_f[i] = 0\n for j in range(14):\n new_f[j] += plus_all\n for k in range(plus_other):\n new_f[(i + k + 1) % 14] += 1\n #print(new_f)\n ans = max(ans, sum_even(new_f))\n\nprint(ans)\n", "import copy\r\nstones=list(map(int,input().split()))\r\ns=0\r\nfor i in range(14):\r\n case=copy.deepcopy(stones)\r\n ca=stones[i]\r\n s1=0\r\n case[i]=0\r\n for j in range(14):\r\n case[j] += ca // 14\r\n\r\n for j in range(ca % 14):\r\n case[(i + j + 1) % 14] += 1 \r\n \r\n s1=sum([k for k in case if k % 2 == 0])\r\n s=max(s1,s)\r\nprint(s)", "A=list(map(int,input().split()))\r\nprint(max([sum([j for j in [(A[j] if i!=j else 0)+A[i]//14+(1 if (j+13-i)%14<A[i]%14 else 0) for j in range(14)] if j%2==0]) for i in range (14)]))", "a=list(map(int,input().split()))\r\nans=0\r\nc=0\r\nfor i in range(len(a)):\r\n b=a.copy()\r\n if a[i]==0:\r\n continue\r\n fi=b[i]\r\n b[i]=0\r\n f=fi//14\r\n xes=fi%14\r\n c=0\r\n for j in range(14):\r\n b[j]=b[j]+f\r\n for j in range(xes):\r\n b[(i+j+1)%14]+=1\r\n for j in b:\r\n if j%2==0:\r\n c=c+j\r\n ans=max(ans,c)\r\nprint(ans)\r\n \r\n", "a = [int(s) for s in input().split()]\r\nmaxscore = 0\r\nfor i in range(len(a)):\r\n aa = list(a)\r\n aa[i] = 0\r\n if a[i] >= 14:\r\n aa = [aai+(a[i]//14) for aai in aa]\r\n for j in range(i+1, i+1+(a[i]%14)):\r\n aa[j%14] += 1\r\n # print(aa)\r\n score = 0\r\n for aai in aa:\r\n if aai%2 == 0: score += aai\r\n if score > maxscore: maxscore = score\r\nprint(maxscore)", "arr = list(map(int, input().split()))\r\nsumm = 0\r\nfor i in range(14):\r\n copy = [0] * 14\r\n now = arr[i]\r\n for j in range(14):\r\n copy[j] = arr[j]\r\n copy[i] = 0 \r\n for k in range(i + 1, 14):\r\n if now <= 0:\r\n break\r\n copy[k] += 1\r\n now -= 1\r\n s = now // 14\r\n for k in range(14):\r\n copy[k] += s\r\n for k in range(now % 14):\r\n copy[k] += 1\r\n local_s = 0\r\n for el in copy:\r\n if el > 0 and el % 2 == 0:\r\n local_s += el\r\n if local_s > summ:\r\n summ = local_s\r\nprint(summ) ", "import sys\n\nlines = sys.stdin.readlines()\ncur_line = -1\n\ndef input():\n global lines, cur_line\n cur_line += 1\n return lines[cur_line][:-1]\n\ndef test(n, i):\n base = n[i] // 14\n diff = n[i] - base * 14\n n[i] = 0\n for k in range(14):\n n[k] += base\n for j in range(1, diff + 1):\n n[(i + j) % 14] += 1\n return sum(k for k in n if k % 2 == 0)\n\nn = list(map(int, input().split()))\nprint(max(test(n[:],k) for k in range(14)))\n\n", "##### \r\nimport sys\r\n#from bisect import insort, bisect_right, bisect_left\r\ndata = sys.stdin.readlines()\r\n\r\nlis = []\r\n\r\nfor line in data:\r\n lis.append(line)\r\n#######\r\ndef win(Seq, pos):\r\n \"\"\"return the gain when position pos is used\"\"\"\r\n s = 0\r\n seq = Seq[:]\r\n val = seq[pos]\r\n val2 = val//14\r\n seq[pos] = 0\r\n \r\n for i in range(14): seq[i] += val2 #better than iterating over val\r\n for i in range(1, (val-14*val2)+1):\r\n ind = (pos+i)%14 \r\n seq[ind] += 1\r\n for i in range(14):\r\n if seq[i]%2 == 0: s += seq[i] \r\n \r\n return s\r\n\r\nseq = list(map(int, lis[0].split()))\r\n#seq = list(map(int, \"10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 10001 1\".split()))\r\nm = 0\r\nfor i in range(14):\r\n if seq[i] == 0: continue\r\n tmp = win(seq, i)\r\n if tmp> m: m = tmp\r\nprint(m)", "def sumeven(arr):\r\n sum1=0\r\n for x in arr:\r\n if x%2==0:\r\n sum1 += x\r\n return sum1\r\n\r\na = list(map(int, input().strip().split()))\r\na1 = [i[0] for i in sorted(enumerate(a), key=lambda x:x[1])]\r\na1.reverse()\r\nmax1 = 0\r\nfor i in a1:\r\n if a[i]>0:\r\n b = list(a)\r\n b[i]=0\r\n index=i+1\r\n if a[i]>14:\r\n s = a[i]//14\r\n if s>0:\r\n b = list(map(lambda x: x + s, b))\r\n for x in range(a[i]%14):\r\n if index>13:\r\n index=0\r\n b[index] = b[index] + 1\r\n index += 1\r\n max1 = max(max1,sumeven(b))\r\nprint(max1)", "a = []\r\nfor s in input().split():\r\n a.append(int(s))\r\n\r\nmaxscore = 0\r\n\r\nfor i in range(14):\r\n tmp = a[:]\r\n t = tmp[i]\r\n tmp[i] = 0\r\n \r\n for j in range(14):\r\n tmp[j] += t // 14\r\n\r\n for j in range(t % 14):\r\n tmp[(i + j + 1) % 14] += 1\r\n\r\n total = sum([k for k in tmp if k % 2 == 0])\r\n maxscore = max(maxscore, total)\r\n\r\nprint(maxscore)\r\n", "arr = list(map(int, input().split()))\r\nscore = 0\r\nfor i in range(14):\r\n if arr[i] > 0:\r\n a = arr[:]\r\n k = a[i]\r\n a[i] = 0\r\n for j in range(14):\r\n a[j] += k//14\r\n k %= 14\r\n for j in range(i + 1, i+1+k):\r\n a[j % 14] += 1\r\n temp = 0\r\n for j in range(14):\r\n if a[j] % 2 == 0:\r\n temp += a[j]\r\n score = max(score, temp)\r\nprint(score)\r\n", "values = [int(x) for x in input().split(' ')]\nans = 0\nfor i in range(14):\n tempList = list(values)\n curr = 0\n val, tempList[i] = values[i], 0\n value_to_add = val//14\n index = val%14\n for j in range(i+1, i+1+index):\n tempList[j%14] += 1\n for j in range(14):\n tempList[j] += value_to_add\n if tempList[j] % 2 == 0:\n curr += tempList[j]\n ans = max(ans, curr)\nprint(ans)", "if __name__ == '__main__':\r\n board = list(map(int, input().split(' ')))\r\n max_score = 0\r\n for i in range(len(board)):\r\n if board[i] == 0:\r\n continue\r\n next_board = board[:]\r\n next_board[i] = 0\r\n increase_amount = int(board[i] / len(board))\r\n extra = board[i] % len(board)\r\n for ni in range(len(next_board)):\r\n next_board[ni] += increase_amount\r\n for e in range(1, extra + 1):\r\n next_board[(i + e)%len(next_board)] += 1\r\n #print(next_board)\r\n\r\n cur_score = 0\r\n for c in next_board:\r\n if c % 2 == 0:\r\n cur_score += c\r\n max_score = max(max_score, cur_score)\r\n print(max_score)\r\n", "import math,string,itertools,fractions,heapq,collections,re,array,bisect,sys,random,time,copy,functools\n\nsys.setrecursionlimit(10**7)\ninf = 10**20\neps = 1.0 / 10**15\nmod = 10**9+7\n\ndef LI(): return [int(x) for x in sys.stdin.readline().split()]\ndef LI_(): return [int(x)-1 for x in sys.stdin.readline().split()]\ndef LF(): return [float(x) for x in sys.stdin.readline().split()]\ndef LS(): return sys.stdin.readline().split()\ndef I(): return int(sys.stdin.readline())\ndef F(): return float(sys.stdin.readline())\ndef S(): return input()\ndef pf(s): return print(s, flush=True)\n\n\ndef main():\n a = LI()\n r = 0\n for i in range(14):\n t = a[:]\n c = t[i]\n t[i] = 0\n m = c % 14\n for j in range(14):\n t[(i+j+1) % 14] += c // 14\n if j < m:\n t[(i+j+1) % 14] += 1\n tr = 0\n for j in range(14):\n if t[j] % 2 == 0:\n tr += t[j]\n if r < tr:\n r = tr\n\n return r\n\n\n\nprint(main())\n\n", "l=list(map(int,input().split()))\r\nm=l*2\r\nanss=0\r\nfor j in range(14):\r\n som=0\r\n if l[j]!=0:\r\n a=m[j]\r\n x=m[j]%14\r\n y=m[j]//14\r\n m[j]=0\r\n m[j+14]=0\r\n for i in range(1,15,1):\r\n if i<=x:\r\n if (m[j+i]+1+y) %2==0:\r\n som+=m[j+i]+1+y\r\n else:\r\n if (m[j+i]+ y)%2==0:\r\n som+=m[j+i]+ y\r\n m[j]=a\r\n m[j+14]=a\r\n anss=max(anss,som)\r\nprint(anss)\r\n", "a = list(map(int, input().split()))\r\nnum = 0\r\nfor i in range(14):\r\n b = a[:]\r\n b[i] = 0\r\n k = a[i]\r\n q = k // 14\r\n p = k % 14\r\n for j in range(i + 1, i + 15):\r\n if j >= 14:\r\n j -= 14\r\n b[j] += q + int(p > 0)\r\n p -= 1\r\n tmp = 0\r\n for j in range(14):\r\n if b[j] % 2 == 0:\r\n tmp += b[j]\r\n\r\n num = max(num, tmp)\r\n\r\nprint(num)", "a = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(14):\r\n b = a[:]\r\n res = 0\r\n b[i] = 0\r\n for j in range(i + 1, 14):\r\n b[j] += int(a[i] >= j - i)\r\n for j in range(14):\r\n b[j] += max(a[i] - (13 - i), 0) // 14 + int(max(a[i] - (13 - i), 0) % 14 >= j + 1)\r\n if b[j] % 2 == 0:\r\n res += b[j]\r\n ans = max(ans, res)\r\nprint(ans)", "a = [int(i) for i in input().split()]\r\na2 = a.copy()\r\nindex = []\r\nc = []\r\nc2 = 0\r\nfor i in range(len(a)):\r\n if a[i] != 0:\r\n index.append(i)\r\nfor j in range(len(index)):\r\n i = index[j] \r\n w = a[index[j]]\r\n a[index[j]] = 0\r\n z = index[j] + w % 14\r\n for p in range(len(a)):\r\n a[p] += w // 14\r\n if z > 13 and ( p > index[j] or p <= z - 14 ) or ( p <= 13 and z >= p > index[j] ):\r\n a[p] += 1\r\n for q in a:\r\n if q % 2 == 0 and q != 0:\r\n c2 += q\r\n c.append(c2)\r\n a = a2.copy()\r\n c2 = 0 \r\nprint(max(c))", "lst = list(map(int, input().strip().split(' ')))\r\nm=0\r\nfor i in range(14):\r\n \r\n l=[]\r\n l=lst[:]\r\n x=l[i]\r\n x1=x//14\r\n y=x%14\r\n l[i]=0\r\n for j in range(14):\r\n l[j]+=x1\r\n t=i\r\n while(y!=0):\r\n if t<13:\r\n t+=1\r\n l[t]+=1\r\n y-=1\r\n elif t==13:\r\n t=0\r\n l[t]+=1\r\n y-=1\r\n \r\n s=0\r\n for j in range(14):\r\n if l[j]%2==0:\r\n s+=l[j]\r\n if s>m:\r\n m=s\r\n #print(l)\r\nprint(m)", "l=list(map(int,input().split()))\r\nm=list(l)\r\nans=0\r\nmax=0\r\nfor i in range(0,14):\r\n if l[i]>0:\r\n x=l[i]\r\n l[i]=0\r\n y=int(x/14)\r\n z=x%14\r\n for j in range(14):\r\n l[j]=l[j]+y\r\n for k in range(1,z+1):\r\n l[(i+k)%14]=l[(i+k)%14]+1\r\n for o in range(14):\r\n if l[o]%2==0:\r\n max=max+l[o]\r\n l=list(m)\r\n if max>ans:\r\n ans=max\r\n max=0\r\nprint(ans) \r\n\r\n \r\n ", "from copy import copy\r\n\r\na = list(map(int, input().split()))\r\n\r\nans = 0\r\nfor i in range(14):\r\n b = copy(a)\r\n b[i] = 0\r\n\r\n for j in range(1, 14 + 1):\r\n b[(i + j) % 14] += (a[i] - 1) // 14 + ((a[i] - 1) % 14 + 1 > j - 1)\r\n\r\n ans = max(ans, sum(el * (el % 2 == 0) for el in b))\r\n\r\nprint(ans)\r\n", "a = list(map(int, input().split()))\r\nn = 14\r\nans = 0\r\n\r\nfor i in range(n):\r\n l = list(a)\r\n x = 0\r\n c =l[i]\r\n l[i] = 0\r\n stones = int (c / n)\r\n rems = c % 14\r\n for j in range(n):\r\n l[j] += stones\r\n index = i\r\n for j in range(rems):\r\n index += 1\r\n index = index % 14\r\n l[index] += 1\r\n #print(l)\r\n for j in range(n):\r\n if l[j] % 2 == 0:\r\n x += l[j]\r\n ans = max(ans,x)\r\n \r\nprint(ans)\r\n", "stones = list(map(int, input().split()))\r\n# print(stones)\r\n# print()\r\nans = 0\r\nn = 14\r\n\r\nfor i in range(n):\r\n if stones[i] > 0:\r\n tmpStone = stones[i]\r\n tmpList = stones[:]\r\n tmpList[i] = 0\r\n \r\n loop = tmpStone // 14\r\n tmpStone %= 14\r\n for j in range(n):\r\n tmpList[j] += loop\r\n k = (i + 1) % 14\r\n while tmpStone > 0:\r\n tmpList[k] += 1\r\n tmpStone -= 1\r\n k = (k + 1) % 14\r\n \r\n tmpEven = 0\r\n for j in range(n):\r\n if tmpList[j] % 2 == 0:\r\n tmpEven += tmpList[j]\r\n # print(tmpList)\r\n ans = max(ans, tmpEven)\r\n\r\nprint(ans)", "v = [int(x) for x in input().split()]\r\nmax = 0\r\nfor i in range(14):\r\n if v[i] != 0:\r\n s = 0\r\n nrp1 = v[i] // 14 # nr pietrece ce ajung pt toata tabla\r\n nrp2 = v[i] % 14 # nr de pietre ce ajung doar pt cateva pozitii\r\n cpy = v[i]\r\n v[i] = 0\r\n if nrp1 != 0:\r\n for j in range(14):\r\n el = v[j] + nrp1\r\n if (j < i and (i + nrp2) % 14 >= j and (i + nrp2) >= 14) or (j > i and i + nrp2 >= j):\r\n el += 1\r\n if el % 2 == 0:\r\n s += el\r\n else:\r\n j = i\r\n while nrp2:\r\n j = (j + 1) % 14\r\n el = v[j] + 1\r\n if el % 2 == 0:\r\n s += el\r\n nrp2 -= 1\r\n if s > max:\r\n max = s\r\n v[i] = cpy\r\nprint(max)", "b = list(map(int, input().split()))\nans = 0\nfor i in range(14):\n a = b.copy();\n x = a[i]\n if x==0:\n continue\n a[i] = 0\n tmp = x//14\n rem = x%14\n for j in range(14):\n a[j]+=tmp\n for j in range(rem):\n a[(i+j+1) % 14] += 1\n tans = 0\n for c in a:\n if (c&1) == 0:\n tans += c\n ans = max(ans, tans)\nprint(ans)\n", "a = list(map(int, input().split()))\r\ndef f(i, ai):\r\n if not ai:\r\n return 0\r\n b = list(a)\r\n b[i] = 0\r\n for j in range(14):\r\n b[j] += ai // 14\r\n for j in range(ai % 14):\r\n b[(i + j + 1) % 14] += 1\r\n return sum(bj for j, bj in enumerate(b) if bj % 2 == 0)\r\nprint(max(f(i, ai) for i, ai in enumerate(a)))", "def haha(arr):\r\n n = len(arr)\r\n ans = 0\r\n for i in range(n):\r\n if arr[i]!=0:\r\n x = arr[i]//14\r\n y = arr[i]%14\r\n res = 0\r\n if x%2 == 0:\r\n res = x\r\n for j in range(i+1, n):\r\n temp = arr[j]+x\r\n if y!=0:\r\n temp+=1\r\n y-=1\r\n if temp%2 == 0:\r\n res+=temp\r\n for j in range(0, i):\r\n temp = arr[j]+x\r\n if y!=0:\r\n temp+=1\r\n y-=1\r\n if temp%2 == 0:\r\n res+=temp\r\n ans = max(res, ans)\r\n return ans\r\n \r\n\r\narr=list(map(int,input().split()))\r\nx=haha(arr)\r\nprint(x)", "nl = ([int(i) for i in input().split()])\r\nms = int(0)\r\nfor i in range(14):\r\n if nl[i] > 0:\r\n nlt = nl.copy()\r\n nt = nlt[i]\r\n nlt[i] = 0\r\n for j in range(14):\r\n if j <= i:\r\n nlt[j] += (nt + i - j) // 14\r\n else:\r\n nlt[j] += ((nt + i - j) // 14) + 1\r\n s = int(0)\r\n for k in range(14):\r\n if nlt[k] % 2 == 0:\r\n s += nlt[k]\r\n ms = max(ms, s)\r\nprint(ms)\r\n", "\n\nA = [int(x) for x in input().split()]\n\nN = 14\n\nresult = 0\n\nfor i in range(N):\n B = A[:]\n to_distribute = B[i]\n B[i] = 0\n for j in range(N):\n B[j] += to_distribute // N\n\n for j in range(1, to_distribute % N + 1):\n B[(i + j) % N] += 1\n\n result = max(result,\n sum([x for x in B if x % 2 == 0]))\n\nprint(result)\n", "stones = [int(i) for i in input().split(\" \")]\r\n\r\nsums = []\r\nfor begin in range(14):\r\n new_stones = stones[:]\r\n stones_begin = stones[begin]\r\n new_stones[begin] = 0\r\n i = begin + 1\r\n if i == 14:\r\n i = 0\r\n rounds = stones_begin // 14\r\n new_stones = [i + rounds for i in new_stones]\r\n stones_begin %= 14\r\n while stones_begin > 0:\r\n stones_begin -= 1\r\n new_stones[i] += 1\r\n i += 1\r\n if i == 14:\r\n i = 0\r\n s = 0\r\n for stone in new_stones:\r\n if stone % 2 == 0:\r\n s += stone\r\n sums.append(s)\r\nprint(max(sums))", "i = list(map(int, input().split()))\nm = 0\nfor index, element in enumerate(i):\n n = i.copy()\n n[index] = 0\n\n d = element // 14\n r = element % 14\n n = [x + d for x in n]\n n[index + 1: index + 1 + r] = [x + 1 for x in n[index + 1: index + 1 + r]]\n\n if index + r + 1 >= 14:\n n[:index + r + 1 - 14] = [x + 1 for x in n[:index + r + 1 - 14]]\n \n s = sum([x for x in n if x % 2 == 0])\n m = max(m, s)\nprint(m)", "mod=14\r\narr=list(map(int,input().split()))\r\nmaxx=0\r\nfor i in range(len(arr)):\r\n if arr[i]>0:\r\n arr1=arr.copy()\r\n r=arr1[i]%mod \r\n q=arr1[i]//mod \r\n arr1[i]=0\r\n for j in range(len(arr)):\r\n arr1[j]+=q\r\n for j in range(1,r+1):\r\n arr1[(i+j)%mod]+=1 \r\n score=0\r\n for j in range(len(arr1)):\r\n if arr1[j]%2==0:\r\n score+=arr1[j]\r\n if score>maxx:\r\n maxx=score\r\nprint(maxx)", "#Mankala\r\npole_i=list(map(int,input().split()))\r\n\r\nans=[]\r\nfor i in range(len(pole_i)):\r\n summ=0\r\n pole=pole_i.copy()\r\n if pole[i]!=0:\r\n ruka=pole[i]\r\n vsem=ruka//14\r\n ne_vsem=ruka%14\r\n pole[i]=0\r\n for j in range(len(pole)):\r\n pole[j]+=vsem\r\n if j>i:\r\n if i+ne_vsem>=j:\r\n pole[j]+=1\r\n elif j<i:\r\n if j<=ne_vsem-(14-i):\r\n pole[j]+=1\r\n for i in pole:\r\n if i%2==0:\r\n summ+=i\r\n ans.append(summ)\r\nprint(max(ans))", "stones = list(map(int, input().split()))\r\nscores = []\r\nfor x in range(14):\r\n if stones[x] != 0:\r\n temp = stones[:]\r\n for y in range(14):\r\n temp[y] += stones[x] // 14\r\n a = x\r\n for y in range(stones[x] % 14):\r\n if a == 13:\r\n a = 0\r\n else:\r\n a += 1\r\n temp[a] += 1\r\n temp[x] -= stones[x]\r\n s = 0\r\n for y in temp:\r\n if y % 2 == 0:\r\n s += y\r\n scores.append(s)\r\nprint(max(scores))", "a = list(map(int, input().split()))\r\ntemp = [0]*14\r\nres = 0\r\nfor i in range(14):\r\n for j in range(14):\r\n temp[j] = a[j]\r\n var = temp[i]\r\n temp[i] = 0\r\n for j in range(14):\r\n temp[j]+=var//14\r\n var%=14\r\n k = i+1\r\n while (var!=0):\r\n if (k==14):\r\n k=0;\r\n temp[k]+=1\r\n k+=1\r\n var-=1\r\n ans = 0\r\n for j in range(14):\r\n if (temp[j]%2 == 0):\r\n ans+=temp[j]\r\n res = max(res, ans)\r\nprint(res)", "a = list(map(int, input().split(' ')))\r\n\r\nbest = 0\r\nfor i in range(len(a)):\r\n\tc = a[i]\r\n\taa = a.copy()\r\n\taa[i] = 0\r\n\t\r\n\tp = int(c/14)\r\n\tm = c % 14\r\n\t\r\n\taaa = [aa[j] + p for j in range(14)]\r\n\tfor j in range(m):\r\n\t\taaa[(i + j + 1) % 14] += 1\r\n\t\r\n\tsum = 0\r\n\tfor j in range(14):\r\n\t\tif(aaa[j]%2 == 0):\r\n\t\t\tsum += aaa[j]\r\n\tif sum > best:\r\n\t\tbest = sum\r\nprint(best)", "arr = list(map(int, input().split()))\nres = 0\nfor i in range(14):\n temp_arr = arr.copy()\n current = temp_arr[i]\n temp_arr[i] = 0\n d = current//14\n mod = current % 14\n for t_ in range(14):\n temp_arr[t_] += d\n for t in range(1, mod + 1):\n temp_arr[(t+i) % 14] += 1\n count = 0\n for ta in temp_arr:\n if ta % 2 == 0:\n count += ta\n res = max(res, count)\nprint(res)", "ans=0\r\nn=[*map(int,input().split())]\r\nfor i in range(14):\r\n x=n[:]\r\n t=x[i]\r\n x[i]=0\r\n loop=t//14\r\n tempAns=0\r\n for j in range(14): x[j]+=loop\r\n for j in range(1,t%14+1): x[(i+j)%14]+=1\r\n for i in x:\r\n if i%2==0: tempAns+=i\r\n ans=max(ans,tempAns)\r\nprint(ans)", "ai = list(map(int,input().split()))\r\ni = 0\r\nans = 0\r\nwhile i < 14:\r\n j = 0\r\n ai2 = [0] * 14\r\n while j < 14:\r\n ai2[j] = ai[j]\r\n j+= 1\r\n j = 0\r\n temp = ai2[i]\r\n temp2 = temp % 14\r\n temp3 = temp // 14\r\n ai2[i] = 0\r\n tempans= 0\r\n while j < 14:\r\n ai2[j] += temp3\r\n j += 1\r\n j = (i+1)%14\r\n while temp2 > 0:\r\n ai2[j] += 1\r\n temp2 -= 1\r\n j = (j+1)%14\r\n j = 0\r\n while j < 14:\r\n if ai2[j] % 2 == 0:\r\n tempans += ai2[j]\r\n j += 1\r\n ans = max(ans,tempans)\r\n i += 1\r\nprint(ans)\r\n", "l = [*map(int, input().split())]\r\nn = len(l)\r\nres = 0\r\nfor i in range(n):\r\n if l[i] == 0: continue\r\n tmp = l[:]\r\n tmp[i] = 0\r\n x = l[i]\r\n for j in range(n):\r\n k = (i + 1 + j) % n\r\n tmp[k] += x // n\r\n if j < x % n: tmp[k] += 1\r\n ans = sum(e for e in tmp if e & 1 == 0)\r\n res = max(res, ans)\r\nprint(res)", "from copy import copy\r\nl = list(map(int, input().split(' ')))\r\nmx = 0\r\nfor i in range(14):\r\n if l[i]:\r\n a = l[i]\r\n temp_l = copy(l)\r\n temp_l[i] = 0\r\n b, a = divmod(a, 14)\r\n for x in range(14):\r\n temp_l[x] += b\r\n x = i\r\n while a:\r\n x = (x + 1) % 14\r\n temp_l[x] += 1\r\n a -= 1\r\n c = 0\r\n for x in temp_l:\r\n if not x % 2:\r\n c += x\r\n if c > mx:\r\n mx = c\r\nprint(mx)", "arr = list(map(int, input().split()))\nbest = 0\nfor i in range(14):\n t = arr[:]\n t[i] = 0\n x = arr[i] // 14\n y = arr[i] % 14\n for j in range(1, y+1):\n t[(i+j) % 14] += 1\n for j in range(14):\n t[j] += x\n best = max(best, sum(xx for xx in t if xx % 2 == 0))\nprint(best)\n", "l=list(map(int, input().split()))\r\nc=0\r\nfor i in range(14):\r\n k=0\r\n m=[t for t in l]\r\n for j in range(14):\r\n if j>i and m[i]>=j-i and (m[j]+1+(m[i]-j+i)//14)%2==0:\r\n k+=m[j]+1+(m[i]-j+i)//14\r\n elif j<i and m[i]>=(14-i+j) and (m[j]+1+(m[i]-14+i-j)//14)%2==0:\r\n k+=m[j]+1+(m[i]-14+i-j)//14\r\n elif j==i:\r\n if (m[i]//14)%2==0: k+=m[i]//14\r\n if k>c : c=k\r\n \r\n \r\nprint(c)", "def calcScore(stones):\r\n bank, stones[-1] = stones[-1], 0\r\n score = 0\r\n for i, count in enumerate(stones):\r\n newCount = count + max(0, bank - i + len(stones) - 1) // len(stones)\r\n if newCount % 2 == 0:\r\n score += newCount\r\n return score\r\n\r\nstones = list(map(int, input().split()))\r\nmaxScore = max(calcScore(stones[i:] + stones[:i]) for i in range(len(stones)))\r\nprint(maxScore)\r\n", "import math\r\nimport string\r\ndef calculate_evens(l):\r\n counter = 0\r\n for i in l:\r\n if i % 2 == 0:\r\n counter += i\r\n return counter\r\n\r\ndef main_function():\r\n a = [int(i) for i in input().split(\" \")]\r\n max_val = 0\r\n for i in range(14):\r\n b = a.copy()\r\n divided = b[i] // 14\r\n left_over = b[i] % 14\r\n b[i] = 0\r\n for j in range(14):\r\n b[j] += divided\r\n if i == 13:\r\n starting_point = 0\r\n else:\r\n starting_point = i + 1\r\n while left_over > 0:\r\n b[starting_point] += 1\r\n left_over -= 1\r\n if starting_point == 13:\r\n starting_point = 0\r\n else:\r\n starting_point += 1\r\n zz = calculate_evens(b)\r\n if zz > max_val:\r\n max_val = zz\r\n print(max_val)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "a=list(map(int,input().split()))\r\nc=[];sum=0\r\nfor i in range(14):\r\n b=a[::]\r\n sum=0\r\n for j in range(14):\r\n if j<(a[i]%14) and j!=13:\r\n b[(i+j+1)%14]+=a[i]//14 + 1\r\n elif j==13:\r\n b[(i+j+1)%14]=a[i]//14\r\n elif j>=(a[i]%14) and j!=13:\r\n b[(i+j+1)%14]+=a[i]//14\r\n else:\r\n b[(i+j+1)%14]=a[i]//14\r\n if b[(i+j+1)%14]%2==0:\r\n sum+=b[(i+j+1)%14]\r\n c.append(sum)\r\nprint(max(c))\r\n \r\n ", "s = [int(x) for x in input().split()]\nmaxi = 0\nfor x in range(14):\n if s[x] != 0:\n c = s.copy()\n c[x] = 0\n const = s[x] // 14\n ost = s[x] % 14\n for i in range(14):\n c[i] += const\n for i in range(x + 1, x + ost + 1):\n c[i % 14] += 1\n ans = 0\n for i in range(14):\n if c[i] % 2 == 0:\n ans += c[i]\n # print(c)\n maxi = max(maxi, ans)\nprint(maxi)\n", "arr = list(map(int, input().split()))\nm = 0\nfor i in range(14):\n\tx = arr[i]//14\n\ty = arr[i]%14\n\tt = [j+x for j in arr]\n\tt[i] = x\n\tfor k in range(y):\n\t\tt[(i+k+1)%14] += 1\n\ts = sum(num for num in t if num%2==0)\n\tm = max(s, m)\nprint(m)\n", "a=list(map(int, input().split()))\r\nh=0\r\nfor i in range(14):\r\n b=a[:]\r\n if i==13:\r\n j=0\r\n else:\r\n j=i+1\r\n if a[i]>0:\r\n c=0\r\n t=b[i]%14\r\n x=b[i]//14\r\n b[i]=0\r\n # print(b)\r\n for i in range(14):\r\n b[i]+=x\r\n # print(b)\r\n while t>0:\r\n b[j]+=1\r\n j+=1\r\n if j==14:\r\n j=0\r\n t-=1\r\n for i in range(14):\r\n if b[i]%2==0:\r\n c+=b[i]\r\n # print(b)\r\n if c>h:\r\n h=c\r\nprint(h)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "a = list(map(int, input().split()))\r\nmax_p = 0\r\nfor i in range(14):\r\n b = a.copy() + a.copy()\r\n p = 0\r\n d = a[i] // 14\r\n r = a[i] % 14\r\n b[i + 14] = 0\r\n for j in range(i + 1, i + 15):\r\n b[j] += d\r\n if j - i <= r:\r\n b[j] += 1\r\n for j in range(i + 1, i + 15):\r\n if b[j] % 2 == 0:\r\n p += b[j]\r\n if p > max_p:\r\n max_p = p\r\nprint(max_p)", "def score(l):\r\n return sum(x*(x%2 == 0) for x in l)\r\n\r\nres = 0\r\nns = list(map(int, input().split()))\r\nfor i in range(14):\r\n l = list(ns)\r\n for j in range(13):\r\n l[(i+1+j) % 14] += l[i]//14 + (1 if (j+1) <= l[i]%14 else 0)\r\n l[i] = l[i]//14\r\n res = max(res, score(l))\r\n\r\nprint(res)", "a = input().split()\r\nfor i in range(14):\r\n a[i] = int(a[i])\r\nans = 0 \r\nfor i in range(14):\r\n b = a.copy()\r\n ans1 = 0\r\n b[i] = 0\r\n k = i\r\n for j in range(1,15):\r\n b[(i+j)%14]+=a[i]//14\r\n if (j<=a[i]%14):\r\n b[(i+j)%14]+=1\r\n if (b[(i+j)%14]%2==0):\r\n ans1+=b[(i+j)%14] \r\n ans = max(ans,ans1)\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", "a = list(map(int, input().split()))\r\nans = 0\r\n\r\nfor i in range(14):\r\n if a[i]:\r\n arr = a.copy()\r\n t = a[i]\r\n arr[i] = 0\r\n for j in range(i+1, 14):\r\n arr[j] += 1\r\n t -= 1\r\n if not(t):\r\n break\r\n for j in range(14):\r\n arr[j] += t//14\r\n for j in range(t%14):\r\n arr[j] += 1\r\n s = 0\r\n for j in range(14):\r\n if not(arr[j]%2):\r\n s += arr[j]\r\n ans = max(ans, s)\r\nprint(ans)\r\n", "def main():\n aa, res = list(map(int, input().split())), []\n for i, a in enumerate(aa):\n if not a:\n continue\n bb = aa[:]\n a, r = divmod(a, 14)\n bb[i] = 0\n for j in range(1, 15):\n bb[(i + j) % 14] += a + (j <= r)\n res.append(sum(a for a in bb if not a & 1))\n print(max(res))\n\n\nif __name__ == '__main__':\n main()\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Apr 27 00:39:17 2018\n\n@author: shubham\n\"\"\"\ns = list(map(int, input().split()))\ncount = 0\nfor i in range(len(s)):\n x = 2*s\n c1 = 0\n if s[i]>0:\n m = s[i]\n x[i]=0\n x[i+14] = 0\n t = 0\n if m>14:\n t = m//14\n m%=14\n for j in range(i+1, i+15):\n x[j]+=t\n for j in range(i+1, i+m+1):\n x[j]+=1\n for j in range(len(x)):\n if x[j]%2==0:\n c1+=x[j]\n if c1>count:\n count = c1\n \nprint(count)\n ", "l = input().split()\r\nfor i in range(14):\r\n l[i] = int(l[i])\r\nlast = list()\r\nfor i in range(14):\r\n k = list()\r\n jav = 0\r\n for j in range(14):\r\n if i != j:\r\n k.append(int(l[i] / 14) + l[j])\r\n else:\r\n k.append(int(l[i] / 14))\r\n for t in range(l[i] % 14):\r\n k[(i + t + 1) % 14] += 1\r\n for a in range(14):\r\n if k[a] % 2 == 0:\r\n jav += k[a]\r\n last.append(jav)\r\n del k\r\nprint(max(last))\r\n", "l=[int(x) for x in input().split()]\r\n\r\nmax=0\r\n\r\nfor i in range(len(l)):\r\n m=[x for x in l]\r\n fist=l[i]\r\n m[i]=0\r\n m=[x+fist//14 for x in m]\r\n fist=fist%14\r\n j=1\r\n while j<=fist:\r\n m[(i+j)%14]+=1\r\n j+=1\r\n even=sum([x for x in m if x%2==0])\r\n if even>max:\r\n max=even\r\nprint(max)", "src = list(map(int,input().split()))\nN = 14\n\nans = 0\nfor i in range(N):\n if src[i] == 0: continue\n arr = src[:]\n d,m = divmod(src[i], N)\n arr[i] = 0\n for j in range(N):\n arr[j] += d\n for j in range(i+1,i+1+m):\n arr[j%N] += 1\n tmp = sum(a for a in arr if a%2==0)\n ans = max(ans, tmp)\n\nprint(ans)\n", "l1=list(map(int,input().split()))\r\nl=[]\r\nm=len(l1)\r\nfor i in range(m):\r\n a=0\r\n l2=l1.copy()\r\n l2[i]=0\r\n n1=l1[i]//(m)\r\n n2=l1[i]%m\r\n for j in range(1,m+1):\r\n l2[(i+j)%(m)]+=n1\r\n for j in range(1,n2+1):\r\n l2[(i+j)%(m)]+=1\r\n for j in range(m):\r\n if l2[j]%2==0:\r\n a+=l2[j]\r\n l.append(a)\r\nprint(max(l))", "l=list(map(int,input().split()))\r\nl*=2\r\nans=0\r\nfor i in range(14):\r\n s=0\r\n if l[i]!=0:\r\n a=l[i]\r\n x=l[i]%14\r\n y=l[i]//14\r\n l[i]=0\r\n l[i+14]=0\r\n for j in range(1,15):\r\n if j<=x:\r\n if (l[j+i]+1+y) %2==0:\r\n s+=l[j+i]+1+y\r\n else:\r\n if (l[j+i]+ y)%2==0:\r\n s+=l[j+i]+ y\r\n l[i]=a\r\n l[i+14]=a\r\n ans=max(ans,s)\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A):\r\n answer = 0\r\n for i in range(14):\r\n A2 = [x for x in A]\r\n ai = A[i]\r\n A2[i]= 0\r\n m1 = ai//14\r\n m2 = ai % 14\r\n new_row = [m1 for i in range(14)]\r\n for j in range(m2):\r\n new_row[j]+=1\r\n for j in range(14):\r\n i2 = (i+1+j) % 14\r\n A2[i2]+=new_row[j]\r\n entry = 0\r\n for i in range(14):\r\n if A2[i] % 2==0:\r\n entry+=A2[i]\r\n answer = max(answer, entry)\r\n sys.stdout.write(f'{answer}\\n')\r\n return\r\n\r\nA = [int(x) for x in input().split()]\r\nprocess(A)\r\n ", "a=list(map(int,input().split()))\nn=14\nm=0\nfor i in range(n):\n b=a[:];x,b[i]=b[i],0\n for j in range(n):\n b[j]+=x//n\n x%=n\n while x:\n i=(i+1)%n;b[i]+=1;x-=1\n m=max(m,sum(x for x in b if x&1<1))\nprint(m)" ]

[ "#-------------Program--------------\r\n#----Kuzlyaev-Nikita-Codeforces----\r\n#-------------Training-------------\r\n#----------------------------------\r\n\r\nr=[4, 22, 27, 58, 85, 94, 121, 166,\r\n 202, 265, 274, 319, 346, 355, 378, \r\n 382, 391, 438, 454, 483, 517, 526, \r\n 535, 562, 576, 588, 627, 634, 636, \r\n 645, 648, 654, 663, 666, 690, 706, \r\n 728, 729, 762, 778, 825, 852, 861,\r\n 895, 913, 915, 922, 958, 985, 1086,\r\n 1111, 1165]\r\nn=int(input())\r\nprint(r[n-1])", "print([4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645][int(input())-1])\r\n############################################################################################################################################################################################################################################", "\"\"\"\r\nhttp://codeforces.com/contest/784/problem/A\r\n\"\"\"\r\n\r\ndef prime_factors(n):\r\n def prime_factors(n, primes):\r\n if n <= 1:\r\n return primes\r\n\r\n for i in range(2, n + 1):\r\n if n % i == 0:\r\n primes.append(i)\r\n return prime_factors(n // i, primes)\r\n return prime_factors(n, [])\r\n\r\ndef digit_sum(n):\r\n s = str(n)\r\n total = 0\r\n for c in s:\r\n total += int(c)\r\n return total\r\n\r\n\r\ndef joke_num(p):\r\n n = 2\r\n count = 0\r\n\r\n while count != p:\r\n prime_facts = prime_factors(n)\r\n if len(prime_facts) != 1 and sum(map(digit_sum, prime_facts)) == digit_sum(n):\r\n curr = n\r\n count += 1\r\n n += 1\r\n\r\n return curr\r\n\r\n\r\ndef main():\r\n a = int(input())\r\n print(joke_num(a))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "\"\"\"input\r\n3\r\n\"\"\"\r\nl=[4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645]\r\nprint(l[int(input())-1])", "n=int(input())\r\nj=[4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645]\r\nfor i in range (1,31):\r\n if n==i:\r\n print(j[i-1])\r\n", "#print(27) #test number 1\r\n\r\n#print(pow(int(input()),3)) #test 2\r\n\r\n#print(pow(3,int(input()))) #test 3\r\n\r\n#print(9*int(input())) #4\r\n\r\n#print(24+int(input())) #5\r\n\r\n#g = int(input()) #6\r\n#print(pow(g, g))\r\n\r\n#lol I read the editorial... the clue was in the name of the problem\r\n#\"number joke\"... first result in OEIS is https://oeis.org/A006753\r\nseq = \"4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086, 1111, 1165\".split(',')\r\nprint(seq[int(input())-1].strip())\r\n", "Ans=[4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778]\r\na=int(input())\r\nprint(Ans[a-1])", "nums = [4,22,27,58,85,94,121,166,202,265,274,319,346,355,\r\n 378,382,391,438,454,483,517,526,535,562,576,588,\r\n 627,634,636,645,648,654,663,666,690,706,728,729,\r\n 762,778,825,852,861,895,913,915,922,958,985,1086,\r\n 1111,1165]\r\nn = int(input())\r\nprint(nums[n-1])\r\n ", "print([4,22,27,58,85,94,121,166,202,265,274,319,346,355,\r\n 378,382,391,438,454,483,517,526,535,562,576,588,\r\n 627,634,636,645,648,654,663,666,690,706,728,729,\r\n 762,778,825,852,861,895,913,915,922,958,985,1086,\r\n 1111,1165,1219][int(input().strip()) - 1])", "import sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nls=[4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645,648,654,663,666,690]\r\na = int(input())\r\nprint(ls[a-1])", "n = int(input())\r\n\r\na = [0 , 4 , 22 , 27 , 58 , 85 , 94 , 121 , 166 , 202 , 265 , 274 , 319 , 346 , 355 , 378 , 382 , 391 , 438 , 454 , 483 , 517 , 526 , 535 , 562 , 576 , 588 , 627 , 634 , 636 , 645]\r\nprint(a[n])", "numbers = [4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535,\r\n 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913,\r\n 915, 922, 958, 985, 1086, 1111, 1165]\r\n\r\n\r\ndef numbers_joke(n):\r\n return numbers[n - 1]\r\n\r\n\r\nprint(numbers_joke(int(input())))\r\n", "n=int(input())\r\nl=[0,4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645,648,654,663,666]\r\nprint(l[n])", "print([4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645,648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825,852, 861, 895, 913, 915, 922, 958, 985, 1086, 1111, 1165][int(input())-1])\r\n", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-28 15:56:10\nLastEditTime: 2021-11-28 15:58:18\nDescription: Numbers Joke\nFilePath: CF784A.py\n'''\n\n\ndef func():\n a = int(input())\n smith = [4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576,\n 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086]\n print(smith[a - 1])\n\n\nif __name__ == '__main__':\n func()\n", "# LUOGU_RID: 113724698\nprint([0,4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645][int(input())])", "def sumDigits(n):\n answer = 0\n while n > 0:\n answer += n%10\n n = n // 10\n return answer\n\ndef listFactors(n):\n # Precondition: n <= 30\n answer = []\n while n > 1:\n for i in range(2,n+1):\n if n%i == 0:\n answer.append(i)\n n = n // i\n break\n return answer\n\n# print(\"Input i\") \ni = int(input())\n\ntest = 4\nnumsofar = 0\nwhile numsofar < i:\n # print(\"Checking \" + str(test))\n if len(listFactors(test)) > 1: # It's composite\n # print(\"Test is composite\")\n numsum = sumDigits(test)\n factorsum = 0\n for factor in listFactors(test):\n factorsum += sumDigits(factor)\n if numsum == factorsum: # We've found one\n numsofar += 1\n if numsofar == i:\n print(test)\n break\n test += 1\n \n\n\n", "D={1:4, 2:22, 3:27, 4:58, 5:85, 6:94,7:121, 8:166, 9:202, 10:265, 11:274, 12:319, 13:346, 14:355, 15:378, 16:382, 17:391, 18:438, 19:454, 20:483, 21:517, 22:526, 23:535, 24:562, 25:576, 26:588, 27:627, 28:634, 29:636, 30:645, 31:648}\r\n\r\nn=int(input())\r\nprint(D[n])\r\n#lol good one but limit kam kaeko?", "x = [4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663]\r\nprint(x[int(input()) - 1])", "lst=[4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645,\\\n 648,654,663,666,690,706,728,729,762,778,825,852,861,895,913,915,922,958,985,1086,1111,1165]\nn=int(input())\nprint(lst[n-1])\n \t \t\t\t \t \t \t \t \t\t \t \t\t\t\t\t", "n=int(input())\r\nls=[4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645]\r\nprint(ls[n-1])", "a=[4,22,27,58,85,94,121,166,202,265,274,319,346,355,378,382,391,438,454,483,517,526,535,562,576,588,627,634,636,645]\nx=int(input())\nprint(a[x-1])", "class CodeforcesTask784ASolution:\n def __init__(self):\n self.result = ''\n self.a = 0\n\n def read_input(self):\n self.a = int(input())\n\n def process_task(self):\n self.result = str([4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562, 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915, 922, 958, 985, 1086, 1111, 1165][self.a - 1])\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask784ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "from math import *\r\n\r\n\r\ndef resheto(n):\r\n prime = [True for _ in range(n+1)]\r\n prime[0] = prime[1] = False\r\n for i in range(2, n+1):\r\n if prime[i]:\r\n if i ** 2 <= n:\r\n for j in range(i**2, n+1, i):\r\n prime[j] = False\r\n answer = []\r\n for i in range(n + 1):\r\n if prime[i]:\r\n answer.append(i)\r\n return answer\r\n\r\n\r\nclass Integer(int):\r\n def __pow__(self, power, modulo=None):\r\n k = power\r\n bbb = 1\r\n c = self\r\n while k:\r\n if k % 2 == 0:\r\n k /= 2\r\n c *= c\r\n else:\r\n k -= 1\r\n bbb *= c\r\n return bbb\r\n\r\n def can_divide(self, n):\r\n if n == 0:\r\n return False\r\n else:\r\n if self % n == 0:\r\n return True\r\n else:\r\n return False\r\n\r\n def trial_division(self):\r\n divisions = []\r\n d = 2\r\n number = self\r\n while number > 1:\r\n if number % d == 0:\r\n divisions.append(d)\r\n number /= d\r\n else:\r\n d += 1\r\n return sorted(divisions)\r\n\r\n def is_prime(self):\r\n if self == 2:\r\n return True\r\n j = int(sqrt(self)+1)\r\n for i in range(2, j+1):\r\n if self % i == 0:\r\n return False\r\n return True\r\n\r\n def gcd(self, bb):\r\n aa = self\r\n while bb:\r\n aa %= bb\r\n aa, bb = bb, aa\r\n return aa\r\n\r\n def lmc(self, bull):\r\n return int(self / gcd(self, bull) * bull)\r\n\r\n\r\nclass Matrix:\r\n def __init__(self, size):\r\n matrix = []\r\n for i in range(size):\r\n matrix.append([])\r\n for j in range(size):\r\n matrix[i].append(0)\r\n self.matrix = matrix\r\n self.n = size\r\n\r\n def edit_element(self, cords, new_value):\r\n self.matrix[cords[0]][cords[1]] = new_value\r\n\r\n def __add__(self, other_matrix):\r\n c = Matrix(self.n)\r\n for i in range(self.n):\r\n for j in range(self.n):\r\n c.edit_element((i, j), self.matrix[i][j] + other_matrix.matrix[i][j])\r\n return c\r\n\r\n def __mul__(self, other_matrix):\r\n c = Matrix(self.n)\r\n for i in range(self.n):\r\n for j in range(i):\r\n k = other_matrix.matrix[i][j]\r\n other_matrix.matrix[i][j] = other_matrix.matrix[j][i]\r\n other_matrix.matrix[j][i] = k\r\n for i in range(self.n):\r\n for j in range(self.n):\r\n c.matrix[i][j] = 0\r\n for k in range(self.n):\r\n c.matrix[i][j] += self.matrix[i][k] * other_matrix.matrix[j][k]\r\n for i in range(self.n):\r\n for j in range(i):\r\n k = other_matrix.matrix[i][j]\r\n other_matrix.matrix[i][j] = other_matrix.matrix[j][i]\r\n other_matrix.matrix[j][i] = k\r\n return c\r\n\r\n\r\njoke = [4, 22, 27, 58, 85, 94, 121, 166, 202, 265, 274, 319, 346, 355, 378, 382, 391, 438, 454, 483, 517, 526, 535, 562,\r\n 576, 588, 627, 634, 636, 645, 648, 654, 663, 666, 690, 706, 728, 729, 762, 778, 825, 852, 861, 895, 913, 915,\r\n 922, 958, 985, 1086, 1111, 1165]\r\na = int(input())\r\nprint(joke[a-1])" ]

[ "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n arr = [int(i) for i in input().split()]\r\n if arr.count(1) > 1:\r\n k += 1\r\nprint(k)", "n=int(input())\nres=0\nfor i in range(n):\n messi=input()\n a,b,c=messi.split()\n a=int(a)\n b=int(b)\n c=int(c)\n s=a+b+c\n if s>=2:\n res=res+1\nprint(res)\n\t\t \t\t\t \t \t\t \t \t\t \t \t \t \t \t", "print(len(list(filter(lambda x: x.count('1') >= 2, [input() for i in range(int(input()))]))))\r\n", "cases_num=int(input())\r\nres=0\r\nfor ix in range(cases_num):\r\n inputs=input()\r\n cases=inputs.split(' ')\r\n score=0\r\n for num in cases:\r\n score+=(int(num))\r\n if score>=2:\r\n res+=1\r\nprint(res)", "#!/usr/bin/python3\n\nn = int(input())\n\nvotes = []\n\nfor i in range(n):\n a, b, c = [int(char) for char in input().split(\" \")]\n if sum([a, b, c]) >= 2:\n votes.append(1)\n\nprint(len(votes))\n", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n m = list(map(int,input().split()))\r\n k = m.count(1)\r\n if k >= 2:\r\n count += 1\r\nprint(count)", "n=int(input())\r\nL=[]\r\nfor i in range(n):\r\n ss=input()\r\n W=ss.split()\r\n L.append(W)\r\nmaincount=0\r\nfor i in L:\r\n count=0\r\n for j in i:\r\n if int(j)==1:\r\n count+=1\r\n if count>=2:\r\n maincount+=1\r\nprint(maincount)", "count=int(input())\r\nt=[]\r\nfor i in range(count):\r\n k=list(map(int, input().split()))\r\n t.append(k)\r\nmain=0\r\nfor i in t:\r\n count=0\r\n for j in i:\r\n if j==1:\r\n count+=1\r\n else:\r\n pass \r\n if count>=2:\r\n main+=1\r\n \r\nprint(main)\r\n\r\n", "i = int(input())\r\ncnt= 0\r\nfor _ in range(i):\r\n lis = list(map(int,input().split()))\r\n if sum(lis)>=2:\r\n cnt+=1\r\nprint(cnt)", "a = int(input())\r\n\r\ncounter = 0\r\n\r\nfor x in range(a):\r\n b = str(input()).split()\r\n c = [list(map(int, b))]\r\n\r\n\r\n for i in c:\r\n count = sum(i)\r\n\r\n if count >= 2:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "ans=0\r\nfor i in range(int(input())):\r\n task = sum(map(int, input().split()))\r\n if task>=2:\r\n ans+=1\r\nprint(ans)", "ans = 0\r\nfor _ in range(int(input())):\r\n x = input().split(' ')\r\n l = []\r\n for i in x:\r\n l.append(int(i))\r\n num = 0\r\n ans = ans + (sum(l) >= 2)\r\nprint(ans)", "import sys\n\nif __name__ == '__main__':\n n = int(sys.stdin.readline())\n count = 0\n for _ in range(n):\n conf = [int(i) for i in sys.stdin.readline().strip().split()]\n if sum(conf) >= 2:\n count += 1\n print(count)\n", "n=int(input())\r\nc=0\r\nfor i in range (0,n):\r\n #print(\"sakib\")\r\n x,y,z=map(int,input().split())\r\n sum=x+y+z\r\n if sum>1:\r\n c+=1\r\nprint(c)", "n = int(input())\na = 0\n\nfor i in range(n):\n j,f,k = map(int, input().split())\n if j+f+k>=2:\n a+=1\nprint(a)\n\t\t \t \t \t\t \t \t\t \t", "x = int(input())\r\ncnt = 0\r\n\r\nfor i in range(x):\r\n l = [int(item) for item in input().split()]\r\n s = sum(l);\r\n if s >= 2:\r\n cnt += 1\r\nprint(cnt)", "n=int(input())\nm=0\nfor i in range(n):\n a,b,c=map(int,input().split())\n s=a+b+c\n if s>=2:\n m+=1\nprint(m)\n\t \t \t\t\t\t \t \t \t \t \t\t\t \t \t \t", "n=int(input())\r\ncount=0\r\nfor _ in range(n):\r\n p,v,t=map(int,input().split())\r\n if p+v+t>=2:\r\n count+=1\r\nprint(count)", "\r\nn = int(input())\r\n\r\nsls = 0\r\nfor i in range(n):\r\n m = input()\r\n ppl = 0\r\n for i in range(len(m.split(' '))):\r\n if m.split(' ')[i] == '1':\r\n ppl+=1\r\n if ppl >= 2:\r\n sls+=1\r\nprint(sls)\r\n ", "n = int(input())\r\ntotal = 0\r\nfor i in range(n):\r\n nums = input().split()\r\n nums = map(int, nums)\r\n if sum(nums) >= 2:\r\n total += 1\r\nprint(total)", "a = int(input())\r\n\r\nd = []\r\nfor i in range(a):\r\n t = input()\r\n d.append(t)\r\n\r\ns = 0\r\nfor j in range(len(d)):\r\n if \"1 0 1\" in d[j] or \"1 1 0\" in d[j] or \"0 1 1\" in d[j] or \"1 1 1\" in d[j]:\r\n s+=1\r\n\r\nprint(s)\r\n", "#Team\r\n\r\nimport sys\r\ninput1 = int(sys.stdin.readline())\r\ntotal = 0\r\nfor i in range (input1):\r\n input2 = list(map(int, sys.stdin.readline().split()))\r\n input2 = sum(input2)\r\n if input2 > 1:\r\n total += 1\r\n else:\r\n continue\r\nsys.stdout.write(str(total))\r\n", "n = int(input())\r\nsurity = 0\r\nfor _ in range(n):\r\n score = sum(list(map(int, input().split())))\r\n if score >= 2:\r\n surity += 1\r\n \r\nprint(surity)", "\r\nx =input()\r\nsol_num=0\r\nfor i in range(int(x)):\r\n y =input().split(\" \")\r\n count=y.count(\"1\")\r\n if count>=2:\r\n sol_num+=1\r\nprint(sol_num)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\na=0\nfor i in range(0,n):\n l,m,o=map(int,input().split())\n if l+m+o>1:\n a+=1\n else:\n a+=0\nprint(a)\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())\nfinal = 0\nfor i in range(n):\n k = list(map(int, input().split()))\n if sum(k) > 1:\n final += 1\nprint(final)\n \t \t\t\t \t \t \t \t \t\t \t\t \t\t\t\t", "w=int(input())\r\ncounter=0\r\nfor i in range(w):\r\n input_str=input()\r\n views=input_str.split()\r\n v1,v2,v3=map(int,views)\r\n if v1+v2+v3>1:\r\n counter+=1\r\nprint(counter) \r\n ", "n=int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p,v,t = map(int, input().split())\r\n sure_count = p+v+t\r\n if sure_count >= 2:\r\n count += 1\r\nprint(count)", "t=int(input())\r\nres=0\r\nwhile t>0:\r\n c=0\r\n lis=map(int,input().split(\" \"))\r\n for i in lis:\r\n if i==1:\r\n c+=1\r\n if c>=2:\r\n res+=1\r\n t-=1\r\nprint(res)", "n = int(input()) # Read the number of lines to follow\nmatrix = []\nres = 0\nfor _ in range(n):\n # For each line, read the line, split by spaces, and convert each to an integer\n row = list(map(int, input().split()))\n if (sum(row) >= 2):\n res += 1\nprint(res)\n", "n = int(input())\n\nsum = 0\n\nfor i in range(0,n,1):\n a, b, c = input().split()\n a = int(a)\n b = int(b)\n c = int(c)\n if (a + b + c) >= 2:\n sum += 1\n \nprint(sum)\n\n \t \t\t\t\t\t \t\t \t \t\t\t\t\t \t \t\t\t", "from sys import stdin\r\n\r\ns = []\r\nfor i in stdin:\r\n s.append(i.rstrip('\\n'))\r\nm = [i for i in s[1:]]\r\nn = [i for i in m if i.count('1') > 1]\r\nprint(len(n))", "n=int(input())\r\n\r\n\r\n\r\nres=0\r\nfor i in range(n):\r\n txt=input()\r\n a,b,c=txt.split()\r\n a=int(a)\r\n b=int(b)\r\n c=int(c)\r\n s=a+b+c\r\n if s>=2:\r\n res=res+1\r\n\r\n\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", "n = int(input())\n\nres = 0\n\nfor _ in range(n):\n res += sum(map(int, input().split())) >= 2\n\nprint(res)", "n = int(input())\r\ncount = 0\r\nfor i in range(0, n):\r\n x, y, z = [int(x) for x in input().split()]\r\n if x+y+z >= 2:\r\n count = count + 1\r\nprint(count)\r\n\r\n", "def s_c():\r\n a=int(input())\r\n c=0\r\n for _ in range(a):\r\n petya,vasya,tonya=map(int,input().split())\r\n if petya+vasya+tonya>=2:\r\n c+=1\r\n print(c)\r\ns_c()", "loops = int(input())\r\n\r\nli_full = []\r\nflag = 0\r\n\r\nfor i in range(loops):\r\n a, b, c = input().split()\r\n li = [a,b,c]\r\n\r\n if li.count('1') >= 2:\r\n flag+=1\r\n\r\nprint('{}'.format(flag))", "n=int(input())\r\na=[]\r\nc=0\r\nfor i in range(n):\r\n a.append(input())\r\nfor i in range(n):\r\n if a[i].count('1')>=2:\r\n c+=1\r\nprint(c) \r\n", "n= int(input())\r\ni=1\r\nhasil= 0\r\nwhile i <= n:\r\n p,v,t= map(int, input().split())\r\n i+=1\r\n if p+v+t >= 2:\r\n hasil += 1\r\nprint(hasil)\r\n", "n = int(input())\r\nk = 0\r\nfor n in range(n):\r\n ans = input()\r\n if ans.split().count('1') >= 2:\r\n k += 1\r\n\r\nprint(k)", "t = int(input())\r\ncount = 0\r\n\r\nfor i in range(t):\r\n a, b, c = map(int, input().split())\r\n views = [a, b, c]\r\n \r\n # Count the number of friends sure about the solution for each problem\r\n sure_count = views.count(1)\r\n \r\n # If at least two friends are sure, increment the total count of problems\r\n if sure_count >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\ns=0\r\nfor i in range(n):\r\n c=0\r\n for j in range(3):\r\n if a[i][j]==1:\r\n c=c+1\r\n if c>1:\r\n s=s+1\r\nprint(s)", "a = 0\r\nfor i in range(int(input())):\r\n s = input()\r\n if int(s[0]) + int(s[2]) + int(s[4])>1:a+=1\r\nprint(a)\r\n ", "import operator as op\r\n\r\ndef confidence(arri):\r\n confer = op.countOf(arri,1)\r\n if confer >=2:\r\n return 1\r\n else:\r\n return 0\r\n \r\nrunner = int(input())\r\nsolved = 0\r\n\r\nwhile runner > 0:\r\n lost = input()\r\n lost = lost.replace(' ','')\r\n if confidence(list(map(int,lost))) == 1:\r\n solved += 1\r\n runner -= 1\r\n\r\nprint(solved)", "n = int(input())\ncount = 0\nfor _ in range(n):\n a,b,c = map(int,input().split())\n if (a+b+c) >= 2:\n count += 1\nprint(count)\n\t\t\t \t\t\t \t\t \t \t\t\t \t\t \t \t\t \t\t\t", "n = int(input())\r\nlp = []\r\nfor i in range(n):\r\n p = input()\r\n lp.append(list(p.split()))\r\ncount = 0\r\nfor j in lp:\r\n if j.count('1') >= 2:\r\n count += 1\r\nprint(count)\r\n", "count=0\r\nt=int(input())\r\nfor i in range(t):\r\n lst=list(map(int,input().split()))\r\n s=sum(lst)\r\n if s>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\nsurity = []\nfor _ in range(n):\n a = tuple(map(int, input().split()))\n surity.append(a)\n\ncnt = 0\nfor x,y,z in surity:\n if x + y + z >= 2:\n cnt += 1\n\nprint(cnt)\n", "n = int(input())\r\nno_of_answers = 0\r\nfor i in range(n):\r\n guess = (input().split(' ')) \r\n if guess.count('1') > 1:\r\n no_of_answers += 1\r\nprint(no_of_answers) ", "def solve():\r\n n = int(input())\r\n ans = 0\r\n for _ in range(n):\r\n a, b, c = map(int, input().split())\r\n\r\n if a+b+c >= 2:\r\n ans += 1\r\n \r\n print(ans)\r\n\r\nsolve()", "n = int(input())\n\nsum = 0;\n\nfor i in range(n):\n a, b, c = input().split()\n \n if int(a) + int(b) + int(c) >= 2:\n sum += 1\n\nprint(sum)", "n=int(input())#number of testcases\r\ncount=0\r\nl=[]\r\nwhile(count<n):\r\n a=list(map(int,input().split()))\r\n l.append(a)\r\n count+=1\r\ncount_=0\r\nfor i in l:\r\n if(sum(i)>1):\r\n count_+=1\r\nprint(count_)\r\n ", "#231A Team\r\ninput_ = int(input())\r\n#enter count exercices\r\nproblems = 0\r\n#variable for solved problems\r\nfor i in range(input_):\r\n#iterate for count exercices\r\n if sum( [int(i) for i in input().split(' ')]) >= 2:\r\n #check if the sum of the entered values ​​is greater than or equal to 2\r\n problems += 1 \r\n #let's increase the solved problem by 1\r\nprint(problems)\r\n#show solves count\r\n'''\r\nn = int(input())\r\nproblems = 0\r\nfor i in range(n):\r\n persons = input().split()\r\n if persons.count(\"1\") >= 2:\r\n problems += 1\r\nprint(problems)\r\n'''", "ans = 0\r\nfor n in range(int(input())):\r\n a = list(map(int, input().split()))\r\n if sum(a) > 1:\r\n ans += 1\r\nprint(ans)", "def problem(n,p):\n c=0\n for problem in p:\n petya,vasya,tonya=problem\n if petya+vasya+tonya>=2:\n c+=1\n return c\nn=int(input())\np=[list(map(int,input().split())) for _ in range(n)]\nresult=problem(n,p)\nprint(result)\n \t \t\t\t \t \t\t\t \t\t \t \t\t\t \t\t\t", "n = int(input())\r\nt = []\r\nq = []\r\nfor i in range(n):\r\n a = input()\r\n t.append(a)\r\nfor j in t:\r\n b = str(j)\r\n if j.count('1')>=2:\r\n q.append(\"yess\")\r\nx = q.count('yess')\r\nprint(x)", "n,cnt=int(input()),0\r\nfor i in range(n):\r\n t=[int(i)for i in input().split()]\r\n if t.count(1)>1:cnt+=1\r\nprint(cnt)", "def team(list1):\n if sum(list1) >= 2:\n return 1\n else:\n return 0\n\nn = int(input())\ncount = 0\nfor i in range(n):\n list1 = []\n list1 = list(map(int,input().split()))\n count += team(list1)\nprint(count)\n\t \t\t\t\t\t \t \t\t \t \t\t \t \t \t", "list = [[],\r\n [],\r\n []]\r\nn = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n c = 0\r\n a = input().split()\r\n for j in range(len(a)):\r\n a[j] = int(a[j])\r\n for j in range(3):\r\n list[j].append(a[j])\r\n if list[j][i] == 1:\r\n c += 1\r\n if c > 1:\r\n count += 1\r\nprint(count)", "n = int(input())\r\ns = 0\r\nfor i in range(1,n+1):\r\n p , v , t = [int(x) for x in input().split()]\r\n if p+v+t >=2:\r\n s+=1\r\n \r\nprint(s)\r\n\r\n", "n=int(input())\r\nans = 0\r\nfor i in range(0,n):\r\n s=input()\r\n if(s.count('1')>=2):\r\n ans+=1\r\nprint(ans)", "l=[]\r\nfor i in range(0, int(input())):\r\n numbers = input().split()\r\n x=0\r\n if numbers.count('1') >= 2:\r\n x+=1\r\n l.append(x)\r\nprint(sum(l))", "n=int(input())\r\nps=0\r\nfor i in range(n):\r\n x=input()\r\n if x.count(\"1\")>=2:\r\n ps+=1\r\nprint(ps)", "#12345\nt=int(input())\ncount=0\nfor i in range(t):\n A,B,C=map(int,input().split())\n if A+B+C>= 2:\n count+= 1\n \nprint(count)\n \t \t\t \t \t \t \t\t \t \t\t", "n = int(input())\r\nproblems = 0\r\n\r\nif n >= 0 and n <= 1000:\r\n for i in range(0,n):\r\n views = input()\r\n lst = views.split(\" \")\r\n\r\n if lst.count(\"1\")>lst.count(\"0\"):\r\n problems = problems+1\r\n print(problems) \r\n \r\n ", "n = int(input())\r\ncont = 0\r\n\r\nfor _ in range(n):\r\n a1, a2, a3 = map(int, input().split())\r\n \r\n if a1 + a2 + a3 >= 2:\r\n cont += 1\r\n\r\nprint(cont)", "x=int(input())\r\ncount=0\r\nwhile(x>0):\r\n cnt=0\r\n y=input()\r\n y=y.strip(\" \")\r\n for i in range(5):\r\n \r\n if(y[i]=='1'):\r\n cnt+=1\r\n # print(i,'i',cnt,\"cnt\")\r\n \r\n \r\n if cnt>1:\r\n count+=1\r\n \r\n x-=1\r\n \r\nprint(count)\r\n", "n = int(input())\r\nprint(sum(sum(map(int, input().split())) > 1 for x in range(n)))", "n = int(input())\r\n\r\ntestList = []\r\n\r\nfor i in range(0,n):\r\n test = input().split(\" \")\r\n testList += test\r\n\r\n\r\n\r\n#print(testList)\r\n\r\ncounterLoop = 0\r\ncountersol = 0\r\n\r\nfor i,value in enumerate(testList):\r\n #print(i)\r\n #print(f\" MOD {i % 3}\")\r\n\r\n if(n % 2 == 0):\r\n #print(\"even\")\r\n #print(\"-------\")\r\n #print(f\" MOD_IN_IF: {i % 3}\")\r\n #print(\"-------\")\r\n if(i % 3 == 0):\r\n #print(\"reset counter loop even\")\r\n #print(\"-------\")\r\n counterLoop = 0\r\n # else:\r\n # print(\"odd\")\r\n # print(\"-------\")\r\n # print(f\"MOD_IN_IF: {(i+1) % 3}\")\r\n # print(\"-------\")\r\n # if((i+1) % 3 == 0):\r\n # print(\"reset counter loop odd\")\r\n # print(\"-------\")\r\n # counterLoop = 0\r\n \r\n if(int(testList[i]) == 1):\r\n #print(\"added to the counter loop\")\r\n #print(\"-------\")\r\n counterLoop += 1\r\n\r\n #print(f\"counterLoop: {counterLoop}\")\r\n #print(\"-------\")\r\n\r\n if(counterLoop >= 2):\r\n #print(\"added to the counter sol\")\r\n #print(\"-------\")\r\n countersol += 1\r\n #print(f\"COUNTERSOL: {countersol}\")\r\n counterLoop = 0\r\n \r\n #print(f\"countersol: {countersol}\")\r\n\r\n if n%2:\r\n #print(\"odd\")\r\n #print(\"-------\")\r\n #print(f\"MOD_IN_IF: {(i+1) % 3}\")\r\n #print(\"-------\")\r\n if((i+1) % 3 == 0):\r\n #print(\"reset counter loop odd\")\r\n #print(\"-------\")\r\n counterLoop = 0\r\n\r\n #print(\"-----------------\")\r\n\r\nprint(countersol)\r\n\r\n\r\n# 1 1 0\r\n# 1 1 1\r\n# 0 1 1", "n = int(input()) # Number of problems\ncount = 0 # Initialize the count of problems they will implement\n\nfor _ in range(n):\n petya, vasya, tonya = map(int, input().split())\n \n # Count how many friends are sure about the solution\n sure_count = petya + vasya + tonya\n \n # If at least two friends are sure, increment the count\n if sure_count >= 2:\n count += 1\n\nprint(count)\n\n\t\t \t\t \t\t \t\t\t \t\t\t\t\t \t\t\t \t\t\t\t\t\t\t", "n = int(input(''))\r\ns = 0\r\nwhile n!=0:\r\n a,b,c=(int(i) for i in input().split())\r\n if a+b+c>1:\r\n s+=1\r\n n-=1\r\nprint(s)", "n=int(input())\r\nk=0\r\nfor i in range(n):\r\n lis=list(map(int,input().split()))\r\n if lis.count(1)>=2:\r\n k=k+1\r\nprint(k)", "ejercicios = int(input())\r\n\r\ntotal = 0\r\n\r\nfor indice in range(ejercicios):\r\n soluciones = input()\r\n resultado = 0\r\n for numero in soluciones:\r\n if numero == \"1\":\r\n num = int(numero)\r\n resultado += num\r\n if resultado > 1:\r\n total += 1\r\n\r\nprint(total) \r\n \r\n\r\n", "n = int(input())\r\nk = 0\r\nfor i in range (n):\r\n s = input()\r\n arr = [int(x) for x in s.split()]\r\n if sum(arr)>=2:\r\n k+=1\r\nprint (k)\r\n", "def team():\r\n n = int(input())\r\n ans = 0\r\n for i in range(n):\r\n x, y, z = map(int, input().split())\r\n ans += (x + y + z >= 2)\r\n print(ans)\r\nteam()", "t=int(input())\ncount=0\nfor i in range(t):\n a,b,c=map(int,input().split())\n if (a+b+c)>=2:\n count=count+1\nprint(count)\n\t\t\t\t \t\t\t\t\t\t\t\t\t\t \t\t \t", "from os import path\r\nimport sys\r\n\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt','r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\n#########USEFUL 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)]))\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndef matrix_2(rows,cols,initial = 0):\r\n arr = [[initial for i in range(cols)] for j in range(rows)]\r\n return arr\r\ndef matrix_3(rows,cols,cols2,initial = 0):\r\n arr = [[[initial for i in range(cols2)] for j in range(cols)] for k in range(rows)]\r\n return arr\r\n\r\ndef binary_search(arr, x):\r\n low = 0\r\n high = len(arr) - 1\r\n mid = 0\r\n while low <= high:\r\n mid = (high + low) // 2\r\n if arr[mid] < x:\r\n low = mid + 1\r\n elif arr[mid] > x:\r\n high = mid - 1\r\n else:\r\n return mid\r\n return -1\r\n###############################################\r\nn = inp()\r\nans = 0\r\nfor _ in range(n):\r\n a = inlt()\r\n ans += 1 if sum(a) >=2 else 0\r\nprint(ans)", "n = int(input())\r\nstep = 0\r\noverall_result = 0\r\n\r\nwhile step < n:\r\n petya, vasya, tonya = map(int, input().split())\r\n result = petya + vasya + tonya\r\n if result >= 2:\r\n overall_result += 1\r\n else:\r\n overall_result += 0\r\n step += 1\r\n\r\nprint(overall_result)\r\n\r\n", "n = int(input())\r\nl = list ()\r\nfor i in range (0, n):\r\n m = list ( map ( int, input (). split (\" \")))\r\n l.extend ([m])\r\nc, d = 0,0\r\nfor i in range (0,n):\r\n for j in range (0,3):\r\n if l[i][j]== 1:\r\n c+=1\r\n if c>1:\r\n d = d+1\r\n c = 0\r\nprint(d)", "n = int(input())\r\n\r\nif (n >= 1 and n <= 1000):\r\n solved = 0\r\n for i in range(n):\r\n p, v, t = input().split()\r\n if ((int(p) == 1 and int(v) == 1) or (int(p) == 1 and int(t) == 1) or (int(t) == 1 and int(v) == 1)):\r\n solved += 1\r\n\r\nprint(solved)", "n=0\r\nfor _ in range(int(input())):\r\n a,b,c= [int(x) for x in input().split()]\r\n if a+b+c>=2: n+=1\r\nprint(n)", "n = int(input())\r\nanswer = 0\r\nfor i in range(n):\r\n p = list(map(int, input().split()))\r\n if p[0] + p[1] + p[2] >= 2:\r\n answer += 1\r\n else:\r\n answer += 0\r\nprint(answer)", "n = int(input())\r\nans = 0\r\n\r\nfor _ in range(n):\r\n petya, vasya, tonya = map(int, input().split())\r\n\r\n if petya + vasya + tonya >= 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n \r\n \r\n", "if __name__ == '__main__':\r\n ans = 0\r\n amount_of_lines = input()\r\n for x in range(int(amount_of_lines)):\r\n word = input()\r\n count_ones_in_a_Line = 0\r\n for y in range(len(word)):\r\n if word[y] == ' ':\r\n pass\r\n else:\r\n count_ones_in_a_Line += int(word[y])\r\n if count_ones_in_a_Line >= 2:\r\n ans += 1\r\n print(ans)\r\n\r\n", "n = int(input())\n\ndef agree(string):\n lst = string.split()\n cnt =0\n for i in lst:\n if int(i) ==1:\n cnt+=1\n return True if cnt>=2 else False\n\ncnt = 0\nfor i in range(n):\n if agree(input()):\n cnt+=1\nprint(cnt)", "ans = 0\r\n\r\ndef sol():\r\n a = input().split(' ')\r\n cnt = a.count('1')\r\n if cnt>=2:\r\n return 1\r\n else:\r\n return 0\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n ans +=sol()\r\nprint(ans)", "#!/usr/bin/python3\n\nn = int(input())\nteam = []\n\nsolved_problems = 0\nfor i in range(n):\n problem = input()\n confidence = sum([int(x) for x in problem.split(\" \")])\n if confidence >= 2:\n solved_problems += 1\n\nprint(solved_problems)", "def QuestionsToBeSolved(data):\r\n totalCount = 0\r\n num = data.split(\" \")\r\n for i in range(len(num)):\r\n totalCount = totalCount + int(num[i])\r\n if totalCount>1:\r\n return 1\r\n else:\r\n return 0\r\n \r\nnum = int(input())\r\nTotalAns = []\r\ncount = 0\r\nfor i in range(num):\r\n answer = input()\r\n result = QuestionsToBeSolved(answer)\r\n TotalAns.append(result)\r\nfor i in TotalAns:\r\n count += i\r\n\r\nprint (count)", "def solve(n,problems):\r\n count=0\r\n for i in range(n):\r\n sure_count=sum(problems[i])\r\n if sure_count>=2:\r\n count+=1\r\n return count\r\nn=int(input())\r\nproblems=[]\r\nfor _ in range(n):\r\n problem_views=list(map(int,input().split()))\r\n problems.append(problem_views)\r\nprint(solve(n,problems))", "n = int(input())\r\ni = 0\r\n\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split())\r\n\r\n if (p == 1 and v == 1) or (p == 1 and t == 1) or (v == 1 and t == 1) or (p == 1 and v == 1 and t == 1):\r\n i += 1\r\n \r\nprint(i)\r\n", "wordsCount = int(input())\r\nwordsList = \"\"\r\nsureProblemsCount = 0\r\nfor i in range(wordsCount):\r\n word = input()\r\n if(word.count(\"1\") > 1):\r\n sureProblemsCount +=1\r\nprint(sureProblemsCount)", "n = int(input())\r\nnum = []\r\nfor i in range(n):\r\n num.append(list(map(int, input().split())))\r\ncount = 0\r\nfor i in num:\r\n complete = 0\r\n for j in i:\r\n complete += j\r\n if complete >= 2: \r\n count += 1\r\nprint(count)", "n = int(input())\r\ne = 0\r\nfor i in range(n):\r\n p, v, t = map(int, input().split())\r\n if p == 1 and v == 1 and t == 1:\r\n e += 1\r\n if p == 1 and v == 1 and t == 0:\r\n e += 1\r\n if p == 1 and v == 0 and t == 1:\r\n e += 1\r\n if p == 0 and v == 1 and t == 1:\r\n e += 1\r\nprint(e)", "n=int(input())\r\na=0\r\nfor i in range(n):\r\n k=input()\r\n p=int(k[0])\r\n v=int(k[2])\r\n t=int(k[4])\r\n u = p+v+t\r\n if(u>1):\r\n a+=1\r\nprint(a)", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n if a.count(1) > 1:\r\n k += 1\r\nprint(k)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if(a==1 and b==1 and c==0) or (a==1 and b==0 and c==1) or(a==0 and b==1 and c==1) or(a==1 and b==1 and c==1):\r\n count=count+1\r\n \r\nprint(count)", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n lst = list(map(int, input().split(' ')))\r\n if sum(lst) > 1:\r\n cnt+=1\r\nprint(cnt)", "T = int(input())\r\nproblems = 0\r\n\r\nfor _ in range(T):\r\n if sum(map(int, input().split())) >= 2:\r\n problems += 1\r\n\r\nprint(problems)\r\n", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n x = input()\r\n if x.count('1') >= 2:\r\n cnt += 1\r\nprint(cnt)\r\n", "n = int(input())\r\nxx = 00\r\nfor i in range(n):\r\n x = input().split()\r\n x = [int(i) for i in x]\r\n if sum(x) >= 2:\r\n xx += 1\r\nprint(xx)", "n = int(input())\nsolve = 0\nfor i in range(n):\n petya,vasya,tonya = map(int,input().split())\n count = 0\n if petya == 1:\n count += 1\n if vasya == 1:\n count += 1\n if tonya == 1:\n count += 1\n if count >= 2:\n solve += 1\nprint(solve)\n\t\t \t \t \t \t \t\t\t\t \t\t \t", "# omer\n# time complexity = O(n)\n# space complexity = O(1)\n\ntimes = int(input())\n\nprint(sum(1 for _ in range(times) if sum(map(int, input().split())) >= 2)) \n\n\n\"\"\"\none line olmayan ~ hali \n\ntimes = int(input())\n\ncount = 0\n\nfor _ in range(times)\n p1, p2, p3 = map(int,input().split())\n\n if p1 + p2 + p3 >=2:\n count += 1\n\nprint(count)\n\"\"\"\n\n\t\t \t\t\t\t \t \t\t \t \t \t\t\t\t\t \t \t", "ans = 0\r\nfor i in range(int(input())):\r\n qn = input().split()\r\n if qn.count('1') > 1:\r\n ans += 1\r\n\r\nprint (ans)\r\n", "n=int(input())\r\ncount=0\r\nfor _ in range(n):\r\n petya,vasya,tonya=map(int, input().split())\r\n if petya+vasya+tonya>=2:\r\n count+=1\r\nprint(count)", "d=0\r\nfor i in range(int(input())):\r\n s=input()\r\n a,b,c=s.split(\" \")\r\n a=int(a)\r\n b=int(b)\r\n c=int(c)\r\n if a+b+c>1:\r\n d+=1\r\nprint(d)\r\n", "n=int(input())\r\na=[]\r\ntem=0\r\nfor x in range(n):\r\n num=input().split()\r\n count=0\r\n a.append(num)\r\n for i in range(len(num)):\r\n num[i] = int(num[i])\r\n if num[i]==0:\r\n count=count+1\r\n if count==2:\r\n a.remove(num)\r\n else:\r\n continue\r\nprint(len(a))", "n = int(input())\nsolve =0\nfor i in range(n):\n p,v,t = map(int,input().split())\n count = 0\n if p==1:\n count +=1\n if v ==1:\n count +=1\n if t ==1:\n count +=1\n if count>=2:\n solve +=1\nprint(solve)\n \t\t \t\t \t\t \t\t \t \t \t \t\t\t", "n = int(input())\r\nlist = []\r\nfor i in range(n):\r\n count_1 = input().count('1')\r\n list.append(count_1 > 1)\r\nprint(sum(list))", "n = int(input())\r\nnumber_of_problems_to_solve = 0\r\n\r\nfor i in range(n):\r\n numbers = list(map(int, input().split()))\r\n \r\n votes = sum(numbers)\r\n \r\n if votes >= 2:\r\n number_of_problems_to_solve += 1\r\n \r\nprint(number_of_problems_to_solve)\r\n ", "n = int(input())\r\nf = []\r\nproblem = 0\r\nfor i in range(n):\r\n f.append(list(map(int,input().split())))\r\n if f[i].count(1) >= 2:\r\n problem+=1\r\nprint(problem)", "a=int(input())\r\nd=0\r\nfor i in range(a):\r\n b=list(map(str,input().split()))\r\n c=0\r\n for j in b:\r\n if j==\"1\":\r\n c=c+1\r\n if c>1:\r\n d=d+1\r\nprint(d)\r\n\r\n \r\n \r\n ", "n=int(input())\r\nnumber=0\r\nfor a in range(0,n):\r\n situation=input().split()\r\n if situation.count(\"1\")>1:\r\n number+=1\r\nprint(number) ", "k = 0\nfor i in [0]*int(input()):\n problem = input()\n problem = problem.split()\n sum = 0\n for a in problem:\n a = int(a)\n sum +=a\n if sum>=2:\n k+=1\nprint(k)\n", "n=int(input())\r\nd=0\r\nwhile n>0:\r\n n -=1\r\n s = input()\r\n a=s[0]; b=s[2]; c=s[4]\r\n k= int(a)+int(b)+int(c)\r\n if k>1: d +=1\r\nprint(d)\r\n", "tt = int(input())\r\nq = 0\r\nwhile(tt!=0):\r\n s = str(input())\r\n if(s.count(\"1\")>1): q+=1\r\n tt-=1\r\nprint(q)", "n = int(input())\r\ncount=0\r\nfor i in range(n):\r\n x,y,z = map(int,input().split())\r\n if(x==y==1 or x==z==1 or y==z==1):\r\n count+=1\r\n\r\nprint(count) ", "MIN_ZEKEREN = 2 \r\n\r\naantal_zekerheden = 0\r\naantal_problemen = int(input())\r\n\r\nfor i in range (aantal_problemen) :\r\n zekerheid_item = input().split(\" \")\r\n if ((int(zekerheid_item[0]) + int(zekerheid_item[1]) + int(zekerheid_item[2])) >= MIN_ZEKEREN) :\r\n aantal_zekerheden += 1\r\n\r\nprint(aantal_zekerheden)", "n = int(input())\ncount = 0\nfor i in range(n):\n a,b,c = map(int,input().split())\n sumi = a+b+c\n if sumi > 1:\n count += 1\nprint (count)\n \n \t\t\t \t\t \t \t\t \t\t\t\t\t \t \t \t", "t=int(input())\ncount=0\nfor i in range(t):\n a,b,c=map(int,input().split())\n if (a==1 and b==1) or (a==1 and c==1) or (b==1 and c==1):\n count=count+1\nprint(count)\n \t \t\t\t\t \t \t \t \t\t \t \t", "n=int(input())\r\nnum=0\r\nfor i in range(0,n):\r\n m=input()\r\n if m.count('1')>=2:\r\n num+=1\r\nprint(num)\r\n ", "n=int(input())\r\na=[]\r\nfor i in range(0,n):\r\n b=input()\r\n a.append(b)\r\nc=0\r\nd=0\r\nfor i in a:\r\n for j in i:\r\n if j==\"1\":\r\n d+=1\r\n if d>=2:\r\n c+=1\r\n d=0 \r\nprint(c)", "# Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of problems they will implement\r\ncount = 0\r\n\r\n# Iterate through each problem\r\nfor _ in range(n):\r\n # Read the views of the three friends\r\n views = list(map(int, input().split()))\r\n\r\n # Count the number of friends sure about the solution for this problem\r\n sure_count = sum(views)\r\n\r\n # If at least two friends are sure, increment the count\r\n if sure_count >= 2:\r\n count += 1\r\n\r\n# Print the total count of problems they will implement\r\nprint(count)\r\n", "N = int(input())\r\nans = 0\r\nfor _ in range(N):\r\n n = sum(map(int, input().split()))\r\n if n >= 2:\r\n ans += 1\r\nprint(ans)", "sum_pro = 0\r\n\r\nfor i in range(0, int(input())):\r\n \r\n j = input().split()\r\n \r\n if j.count('1') > 1:\r\n \r\n sum_pro += 1\r\n \r\nprint(sum_pro)\r\n ", "def main():\r\n count = 0\r\n t = int(input()) # Read the number of test cases\r\n for _ in range(t):\r\n # array input similar method\r\n arr = [int(x) for x in input().split()]\r\n know = sum(arr)\r\n if know >= 2:\r\n count += 1\r\n print(count)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n=int(input())\r\nj=0\r\nfor i in range(n):\r\n g=input().split(\" \")\r\n if g.count(\"1\")>=2:\r\n j+=1\r\nprint(j)", "n=int(input())\r\nsum=0\r\nfor i in range(n):\r\n a,b,c=(int(i) for i in input().split())\r\n if a+b+c>=2:\r\n sum+=1\r\nprint(sum)", "i=int(input())\r\nsum=0\r\nfor j in range(i):\r\n s=input().split()\r\n su=0\r\n for k in s:\r\n if k==\"1\":su+=1\r\n if su>=2:sum+=1\r\nprint(sum)", "#\nT=int(input())\ncount=0\nfor i in range(T):\n a,b,c=map(int,input().split())\n if a+b+c>1:\n count+=1\n else:\n count+=0\nprint(count)\n \n \t\t \t\t \t\t\t \t \t\t\t\t \t\t \t\t\t\t", "\r\n\r\nn = int(input())\r\nans = 0\r\nfor i in range(n):\r\n cnt = sum(map(int, input().split()))\r\n if cnt >= 2:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\nr=0\nfor i in range(n):\n a,b,c=map(int,input().split())\n if((a+b+c)>=2):\n r=r+1\n \nprint(r)\n \n\t\t\t \t \t\t\t \t \t \t \t\t\t \t \t", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n z=a+b+c\r\n if z>=2:\r\n x+=1\r\nprint(x) ", "# program to show team\nn = int(input())\nimplement_count = 0\nfor _ in range(n):\n petya, vasya, tonya = map(int, input().split())\n if petya + vasya + tonya >= 2:\n implement_count += 1\nprint(implement_count)\n\n\t\t \t\t\t \t\t\t\t \t\t \t\t \t\t \t\t\t\t \t", "# Input the number of problems\nn = int(input())\n\n# Initialize the count of implementable problems\nimplementable_count = 0\n\n# Iterate through each problem\nfor _ in range(n):\n p, v, t = map(int, input().split())\n \n # Count the number of friends sure about the solution\n sure_count = p + v + t\n \n # If at least two friends are sure, increment the count\n if sure_count >= 2:\n implementable_count += 1\n\n# Print the result\nprint(implementable_count)\n\n \t\t \t \t\t\t\t\t\t \t \t\t \t \t\t", "n = int(input())\r\nres = 0\r\nfor i in range(n):\r\n s=0\r\n line = input()\r\n row = list(map(int,line.split()))\r\n for j in row :\r\n if (j == 1):\r\n s+= 1 \r\n if (s>=2) :\r\n res+= 1\r\nprint(res)\r\n\r\n", "count = 0\r\nfor i in range(int(input())):\r\n a, b, c = [int(i) for i in input().split()]\r\n if a + b + c > 1:\r\n count += 1\r\nprint(count)", "p = []\ncount = 0\nn = int(input())\nwhile len(p)<n:\n i = [*map(int,input().split())]\n p.append(i)\n if sum(i)>= 2:\n count = count + 1\nprint(count)\n", "n = int(input())\r\nans=0\r\nfor i in range(n):\r\n count1s=0\r\n list1=list(map(int,input().split()))\r\n for i in list1:\r\n if i==1:\r\n count1s+=1 \r\n if count1s>=2:\r\n ans+=1 \r\nprint(ans)\r\n ", "n = int(input(\"\"))\r\n\r\nlist_of_words = []\r\nsum_of_answer = 0 \r\n\r\nfor i in range(n):\r\n answer = list(map(int,input().split()))\r\n \r\n if sum(answer) >= 2:\r\n sum_of_answer += 1\r\nprint(sum_of_answer)\r\n \r\n\r\n\r\n", "n=int(input())\nc=0\nwhile(n):\n n-=1\n \n x,y,z=map(int,input().split())\n if((x==1 and y==1) or (x==1 and z==1) or (y==1 and z==1)):\n c+=1\n \nprint(c)\n\t\t \t\t\t \t\t\t \t \t\t\t \t\t \t \t", "n = int(input())\r\nc =0\r\nfor i in range(n):\r\n temp = list(map(int,input().split()))\r\n if temp.count(1) >= 2:\r\n c+=1\r\nprint(c)", "n = int(input()) # Number of problems\r\nproblems = []\r\n\r\n# Read input and store it in a list of tuples\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split())\r\n problems.append((p, v, t))\r\n\r\nsolved_count = 0\r\n\r\nfor problem in problems:\r\n # Count the number of friends who are sure about the solution\r\n sure_count = problem.count(1)\r\n \r\n # If at least 2 friends are sure about the solution, increment the solved_count\r\n if sure_count >= 2:\r\n solved_count += 1\r\n\r\nprint(solved_count)\r\n", "# Codeforces, problem Team 231A,\r\n\r\nn = int(input())\r\n\r\nans = 0\r\n\r\nfor x in range(n):\r\n a, b, c = input().split()\r\n sum1 = int(a) + int(b) + int(c)\r\n if sum1 >= 2:\r\n ans = ans + 1\r\n\r\nprint(ans)\r\n", "num=int(input())\r\ncount=0\r\nfor i in range(num):\r\n s=input()\r\n s1=s.split()\r\n a=int(s1[0])\r\n b=int(s1[1])\r\n c=int(s1[2])\r\n if a+b+c>1:\r\n count+=1\r\nprint(count)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n if x.count(1)>1:\r\n s+=1\r\nprint(s)\r\n", "n=int(input())\r\nj=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n s=a+b+c\r\n if s>1:\r\n j+=1\r\nprint(j)\r\n \r\n \r\n \r\n ", "x = int(input())\r\noutput = 0\r\n\r\nfor i in range(x):\r\n sum = 0\r\n lista = input().split()\r\n for nr in lista:\r\n sum += int(nr)\r\n if(sum >= 2):\r\n output += 1\r\n\r\nprint(output)", "n = int(input())\r\no = 0\r\nfor i in range(n):\r\n arr = [int(x) for x in input().split()]\r\n sum = arr[0] + arr[1] + arr[2]\r\n if(sum>1):\r\n o = o + 1\r\n sum = 0\r\n\r\nprint(o)", "n=int(input())\r\nk=0\r\nfor i in range(n):\r\n a,b,c = list(map(int, input().split()))\r\n if a+b+c>=2:\r\n k=k+1\r\nprint(k) ", "numOfInputs = int(input())\r\ncountOfCorrectStrings = 0\r\nfor i in range(numOfInputs):\r\n inputString = input().split()\r\n if inputString.count('1') > inputString.count('0'):\r\n countOfCorrectStrings += 1\r\n\r\nprint(countOfCorrectStrings)", "# Read the number of problems\nn = int(input())\n\n# Initialize a variable to keep track of the number of problems they will implement\ncount = 0\n\n# Iterate through the problems\nfor _ in range(n):\n # Read Petya's, Vasya's, and Tonya's views on the problem\n petya, vasya, tonya = map(int, input().split())\n \n # Count how many friends are sure about the solution\n sure_count = petya + vasya + tonya\n \n # If at least two of them are sure, increment the count\n if sure_count >= 2:\n count += 1\n\n# Print the number of problems they will implement\nprint(count)\n\n \t\t\t\t\t \t\t \t\t\t \t\t \t\t \t \t\t\t", "# total_num = int(input())\r\n# total = 0\r\n# for x in range(1, total_num+1):\r\n# cube_num = x**3\r\n# total += cube_num\r\n# print(total)\r\n\r\nproblem_num = int(input())\r\nproblem_solved_num = 0\r\nfor x in range(0, problem_num):\r\n able_solve = input()\r\n if able_solve.count(\"1\") >= 2:\r\n problem_solved_num += 1\r\nprint(problem_solved_num)", "T=int(input())\r\nnb=0\r\nfor i in range(T) :\r\n A,B,C=map(int,input().split())\r\n if(A+B+C >=2) :\r\n nb+=1\r\nprint(nb) \r\n", "# A. Team - https://codeforces.com/contest/231/problem/A\n\ndef solve():\n n = int(input())\n res = 0\n for _ in (range(n)):\n arr = list(map(int, input().split()))\n answer = arr.count(1)\n if answer >=2:\n res+=1\n return res\n\nprint(solve())\n\n\n\n\n\n", "n = int(input())\ncount = 0\nfor i in range(n):\n opinions = list(map(int, input().split()))\n if sum(opinions) >= 2:\n count += 1\nprint(count)\n\n \t \t\t \t \t \t \t \t \t\t \t\t \t\t\t \t", "n = int(input())\r\nproblems=0\r\nfor i in range (0,n):\r\n s=input()\r\n count=0\r\n for j in range (0,5):\r\n if s[j]=='1':\r\n count+=1\r\n if count>=2:\r\n problems+=1\r\nprint(problems)", "count = 0\r\nfor _ in range(int(input())):\r\n if int(sum(list(map(int,input().split(\" \"))))) >=2:\r\n count+=1 \r\nprint(count)", "n=int(input())\r\nsum=0\r\np=0\r\nfor i in range(n):\r\n x=input()\r\n y=x.split()\r\n for j in y:\r\n p+=int(j)\r\n if p>=2:\r\n sum+=1\r\n p=0\r\nprint(sum)\r\n", "n = int(input()) \r\nl = []\r\nfor i in range(n): \r\n m = list(map(int, input().split(\" \")))\r\n l.extend([m])\r\nd = 0 \r\nfor i in range(0,n):\r\n c = 0\r\n for j in range(0,3):\r\n if l[i][j] == 1 :\r\n c = c + 1\r\n if c >= 2 :\r\n d = d+ 1\r\nprint(d) ", "#!/usr/bin/env python\n# coding: utf-8\n\n# In[1]:\n\n\nn=int(input())\ncount=0\nfor i in range(n):\n m1,m2,m3=map(int,input().split())\n if m1+m2+m3>=2:\n count+=1\nprint(count) \n \n \n \n\n \n \n\n\n# In[ ]:\n\n\n\n\n", "n=int(input())\r\ni=0\r\nd=0\r\nwhile(i<n):\r\n a,b,c=map(int,input().split())\r\n k=a+b+c\r\n if(k>=2):\r\n d=d+1\r\n i=i+1\r\nprint(d)", "k=int(input())\r\nans=0\r\nfor _ in range(k):\r\n num=[int(i) for i in input().split(\" \")]\r\n if 1 in num and num.count(1)>=2:\r\n ans+=1\r\nprint(ans)\r\n\r\n ", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n a=input()\r\n t=a.split(' ')\r\n if t.count('1')>1:\r\n s+=1\r\nprint(s)", "n = int(input())\r\ntimes = 0\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n if (a == 1 and b == 1) or (a == 1 and c == 1) or (b == 1 and c == 1):\r\n times += 1\r\nprint(times)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n x,y,z = input().split()\r\n if int(x)+int(y)+int(z)>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n w = input().split()\r\n w = [int(x) for x in w]\r\n \r\n if sum(w) >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "ans=0;\r\nfor i in range(int(input())):ans+=input().count('1')>1\r\nprint(ans);", "n = int(input())\r\nx = 0\r\nL = []\r\nL2 = []\r\nwhile x<n:\r\n s = input().split()\r\n L.append(s) \r\n x+=1\r\n\r\nfor i in L:\r\n if i.count('1') >= 2:\r\n L2.append(i)\r\nprint(len(L2))", "n = int(input())\r\nallViews = []\r\n\r\n\r\nk=0\r\nfor i in range(n):\r\n allView = [eval(i) for i in input().split(\" \")]\r\n \r\n if sum(allView)>=2:\r\n k+=1\r\n\r\nprint(k)", "n = int(input()) #total line\r\nres = 0\r\n\r\nfor i in range(n):\r\n tmp = 0 #tmp result, add to total if greater than or equal to 2\r\n ans = input().split(\" \")\r\n\r\n for a in ans:\r\n tmp += 1 if a == \"1\" else 0\r\n\r\n res += 1 if tmp >= 2 else 0\r\n\r\nprint(res)", "n=int(input(\"\"))\r\ncount=0\r\nfor i in range(n):\r\n z=input(\"\").split()\r\n if int(z[0])+int(z[1])+int(z[2])==0 or int(z[0])+int(z[1])+int(z[2])==1:\r\n pass\r\n else:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nres = 0\r\n\r\nfor _ in range(n):\r\n knowSolu = input().split()\r\n if knowSolu.count(\"1\") >= 2:\r\n res += 1\r\n\r\nprint(res)", "n=int(input())\r\ncounter=0\r\nfor i in range (n):\r\n x=input()\r\n if x.count(\"1\") >=2:\r\n counter=counter+1\r\nprint(counter)", "count=0\r\nfor i in range(int(input())):\r\n lst=list(map(int,input().split()))\r\n \r\n if sum(lst)>=2:#minimum 2\r\n count+=1\r\n\r\nprint(count)\r\n ", "n=int(input())\r\ncou=0\r\nfor i in range(n):\r\n p,v,t=list(map(int,input().split()))\r\n if (p and v==1) or (p and t ==1) or (v and t ==1) or (p and v and t) ==1:\r\n cou+=1\r\nprint(cou)", "n = int(input())\ncount = 0\nfor _ in range(n):\n views = input().split()\n petya_view, vasya_view, tonya_view = map(int, views)\n sure_views = petya_view + vasya_view + tonya_view\n if sure_views >= 2:\n count += 1\nprint(count)\n\n \t\t \t \t \t\t \t \t \t\t \t\t\t \t\t\t", "implemented = 0\r\nproblems = int(input())\r\nfor x in range(problems):\r\n problem = input()\r\n problem = [int(x) for x in problem.split(' ')]\r\n if sum(problem)>=2:\r\n implemented +=1\r\nprint(implemented)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n p,v,t = map(int,input().split(' '))\r\n if (p==1 and v==1) or (p==1 and t==1) or (v==1 and t==1) or (p==1 and v==1 and t==1):\r\n ans+=1\r\nprint(ans)", "b = 0\nfor i in range(int(input())):\n a = list(map(int,input().split()))\n if a.count(1)>=2:\n b+=1\nprint(b)", "n = int(input())\r\nresult = 0\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n if a.count(1) > 1: result += 1\r\nprint(result)", "c = 0\r\nfor _ in range(int(input())):\r\n\tc += (sum([int(i) for i in input().split()]) >= 2)\r\nprint(c)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a=input().split()\r\n if int(a[0])+int(a[1])+int(a[2])>=2:\r\n count+=1\r\nprint(count)", "questions = int(input())\r\nres = 0\r\n\r\nfor i in range(questions):\r\n a, b, c = map(int, input().split())\r\n if a+b+c >= 2:\r\n res += 1\r\n\r\nprint(res)", "ct=0\r\nfor _ in range(int(input())):\r\n l=list(map(int,input().split()))\r\n if(sum(l)>1):\r\n ct+=1\r\nprint(ct)", "n=int(input())\nc=0\nfor i in range(n):\n m1,m2,m3=map(int,input().split())\n c1=m1+m2+m3\n if c1>=2:\n c=c+1\nprint(c)\n \t \t\t\t \t\t\t\t \t \t \t \t\t\t \t \t", "num = int(input())\r\n\r\nproblems = []\r\nsolved = 0\r\n\r\nfor i in range(num):\r\n x = input().split()\r\n problems.append(x)\r\n \r\nfor sol in problems:\r\n if sol.count(\"1\") > 1:\r\n solved+=1\r\n\r\nprint(solved)", "n = input()\nn = int(n)\nproblems_solved = 0\n\nfor i in range(n):\n count = 0\n mylist = map(int , input().split())\n for i in mylist :\n if i == 1 :\n count += 1\n\n if count >=2 :\n problems_solved += 1\n\nprint(problems_solved)\n\n \t\t \t\t\t \t \t \t\t\t\t \t \t \t\t\t\t", "n=int(input())\r\nsol = 0\r\nfor x in range(n):\r\n sol += sum(map(int, input().split())) > 1\r\nprint(sol)", "n = int(input())\r\ntotal = 0\r\n\r\nif (n>=1 and n<=1000):\r\n for i in range (0,n):\r\n a = input()\r\n sum = a.count('1')\r\n\r\n if (sum >= 2):\r\n total = total + 1\r\n else:\r\n total = total\r\n\r\nprint(total)", "num_of_test_case = int(input())\r\nsub_count = 0\r\nfor i in range(num_of_test_case):\r\n a, b, c = map(int, input().split())\r\n sure_list = [a, b, c]\r\n if sure_list.count(1) >= 2:\r\n sub_count = sub_count + 1\r\nprint(sub_count)\r\n", "#if __name__ == '__main__':\n # n = int(input())\n # arr = map(int, input().split())\n # print (sorted(set(arr))[-2])\n # arr = map(int, input().split())\n # newarr = sorted(set(arr))\n #print(newarr[-2])\n# Enter your code here. Read input from STDIN. Print output to STDOUT\n\n'''for i in range(0,n):\n for j in range(n,0):\n if i+j>=n-1:\n print(\"#\",end='')\n # Write your code here\nn = int(input().strip())\nfor i in range(0,n):\n for j in range(n):\n if i+j >= n-1:\n print(\"#\",end=\"\")\n else:\n print(\"\",end=\"\")\n print(\"\\r\")'''\n'''a = list(map(int, input().split().rstrip()))\nb = list(map(int, input().split().rstrip()))\n\nif a[i]> b[i]:\n print()\nalice = 0\nbob = 0'''\n\n'''for i in range(len(a)):\n if a[i] > b[i]:\n alice += 1\n elif a[i] < b[i]:\n bob += 1\n\nreturn alice, bob'''\n#!/bin/python3\n\n#\n# Complete the 'compareTriplets' function below.\n#\n# The function is expected to return an INTEGER_ARRAY.\n# The function accepts following parameters:\n# 1. INTEGER_ARRAY a\n# 2. INTEGER_ARRAY b\n#\n\n#arr = list(map(int,input().rstrip().split()))\n#sort arr then remove max or min number and print\n'''arr_sort = sorted(set(arr))\nmax_arr = arr_sort.remove(arr_sort[-1])\nmin_arr = arr_sort.remove(arr_sort[0])\nmax_sum = sum(max_arr)\nmin_sum = sum(min_arr)\nprint(min_sum, max_sum)'''\n\n'''lst = map(int,raw_input().strip().split(' '))\nx = sum(lst)\nprint (x-(max(lst))), (x-(min(lst)))'''\n\n'''x = sum(arr)\nprint(x-max(arr),x-min(arr))'''\nname = int(input())\nl =[]\nm =0\nfor i in range(0,name):\n j = input().split()\n if (j).count('1')>= 2:\n m = m+1\nprint(m)\n\n", "n = int(input(\"\"))\r\nc = 0\r\nfor i in range(0,n):\r\n s=''\r\n s+=input(\"\")\r\n s+=\" \"\r\n if sum(int(x) for x in s.split()) >= 2 :\r\n c+=1\r\n \r\nprint(c)", "i=int(input())\r\ncount=0\r\nfor j in range (i):\r\n x,y,z=map(int,input().split())\r\n if((x+y+z)>1):\r\n count=count+1\r\nprint(count)", "n=input()\r\nn=int(n)\r\ncount=0\r\nfor _ in range(n):\r\n a,b,c=input().split(\" \")\r\n a,b,c=int(a),int(b),int(c)\r\n if a:\r\n if b or c:\r\n count+=1\r\n else:\r\n if b and c:\r\n count+=1\r\nprint(count)", "a=int(input())\r\nans=0\r\nfor i in range(a):\r\n b=list(map(int, input().split()))\r\n if(b.count(1)>=2):\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nk = 0\r\nk2 = 0\r\nwhile k < n:\r\n if input().count('1')>=2:\r\n k2+=1\r\n k+=1\r\nprint(k2)\r\n", "a = int(input())\r\nproblems = []\r\nfor i in range (0, a):\r\n problems.append(list(map(int, list(input().split(\" \")))))\r\ncounter = 0\r\n\r\nfor i in problems:\r\n if i.count(1) >= 2:\r\n counter+=1\r\n\r\nprint(counter)", "x = int(input())\r\noutput = 0\r\n\r\nfor i in range(x):\r\n sum = 0\r\n numbers = input().split() # Citirea unei linii și despărțirea ei într-o listă de șiruri\r\n for num_str in numbers:\r\n hah = int(num_str) # Conversia fiecărui șir la un număr întreg\r\n sum += hah\r\n if sum >= 2:\r\n output += 1\r\n\r\nprint(output)", "def solves(lst):\r\n x=lst.count(1)\r\n if x>=2:\r\n return 1\r\n return 0\r\nn=int(input())\r\nresult=[]\r\nfor i in range(n):\r\n s=input()\r\n alist=[int(d) for d in s.split()]\r\n result.append(solves(alist))\r\nprint(sum(result))", "N = int(input())\r\ni = 0\r\nk=0\r\nfor i in range(N):\r\n A,B,C = map(int,input().split())\r\n if A+B+C >= 2:\r\n k=k+1\r\nprint(k)", "# put\n\n# The first input line contains a single integer n (1 ≤ n ≤ 1000) — the number of problems in the contest. Then n lines contain three integers each, each integer is either 0 or 1. If the first number in the line equals 1, then Petya is sure about the problem's solution, otherwise he isn't sure. The second number shows Vasya's view on the solution, the third number shows Tonya's view. The numbers on the lines are separated by spaces.\n# Output\n\n# Print a single integer — the number of problems the friends will implement on the contest.\n\nn = int(input())\n\nwhile n>1000 or n<1:\n n=int(input())\n\nfinalcounter = 0\nfor el in range(0,n):\n l= input()\n l = l.split((\" \"))\n counter = 0\n for el in range(len(l)):\n if l[el]=='1':\n counter = counter+1\n if counter>=2:\n finalcounter=finalcounter+1\n\n \nprint(finalcounter)", "b=[]\r\nn=int(input())\r\nc=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n b.append(a)\r\nfor j in b:\r\n if j[0]==j[1]==1 or j[1]==j[2]==1 or j[2]==j[0]==1 or j[0]==j[1]==j[2]==1:\r\n c+=1\r\nprint(c)", "num = int(input())\r\nword = []\r\nresult = 0\r\nfor i in range(num):\r\n word.append(input())\r\nfor j in word:\r\n count = 0\r\n for k in j:\r\n if k == '1':\r\n count = count + 1\r\n if count > 1:\r\n result = result + 1\r\n\r\nprint(result)", "def main():\r\n n = int(input())\r\n noOfInplementedProblems = 0\r\n for i in range(n):\r\n friendsSureity = input().split(' ')\r\n if sum((int(sureity) for sureity in friendsSureity)) >= 2:\r\n noOfInplementedProblems = noOfInplementedProblems + 1\r\n print(noOfInplementedProblems)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "no_of_problems = int(input())\nview = {'Petya' : 0, 'Vasya': 0, 'Tonya' : 0}\ninput_list = []\nno_of_doable = 0\nfor i in range (no_of_problems):\n input_list = (input().strip()).split(\" \")\n count = 0\n for j in range (3):\n if input_list[j] == '1':\n count += 1\n if count >= 2:\n no_of_doable += 1\nprint(no_of_doable)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n l=input().split()\r\n if l.count('1')>1:\r\n c+=1\r\n else:\r\n pass\r\nprint(c)", "\r\nn = int(input())\r\n\r\nl = [1 if sum(list(map(int, input().split()))) > 1 else 0 for _ in range(n)]\r\n\r\nprint(sum(l))", "numOfProblem = int(input(\"\"))\r\n\r\nresult = 0\r\n\r\nfor i in range(0 , numOfProblem) :\r\n fstCounter = 0\r\n nums = input(\"\")\r\n\r\n nums_list = nums.split()\r\n\r\n num1, num2, num3 = nums_list\r\n# the are still strings '1'\r\n list_of_nums = [num1 , num2 , num3]\r\n\r\n for j in list_of_nums:\r\n if (int(j) == 1) :\r\n fstCounter += 1\r\n\r\n if fstCounter >= 2 :\r\n result += 1\r\n\r\nprint(result)", "n = int(input())\r\n\r\nresult = 0\r\n\r\nfor i in range(n):\r\n \r\n numbers = list(map(int, input().split()))\r\n count = 0\r\n for number in numbers:\r\n \r\n if number == 1:\r\n count += 1\r\n if count >= 2:\r\n result += 1\r\n break\r\n \r\nprint(result)", "t=int(input())\r\ncnt=0\r\nfor i in range(t):\r\n x,y,z=map(int,input().split())\r\n s=x+y+z\r\n if s>=2:\r\n cnt+=1\r\nprint(cnt)", "c=0\r\nfor _ in range(int(input())):\r\n l=list(map(int,input().split()))\r\n if(l.count(1)>=2):\r\n c=c+1\r\nprint(c)", "num = int(input())\r\n\r\ncount = 0\r\nfor i in range(1, num + 1):\r\n x, y, z = input().split()\r\n if int(x) + int(y) + int(z) >= 2:\r\n count = count + 1\r\n\r\nprint(count)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n arr=list(map(int,input().split()))\r\n if arr.count(1)>=2:\r\n count+=1\r\nprint(count)", "# Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of problems the friends will implement\r\ncount = 0\r\n\r\n# Process each problem\r\nfor _ in range(n):\r\n petya, vasya, tonya = map(int, input().split())\r\n \r\n # Check if at least two of the friends are sure about the solution\r\n if petya + vasya + tonya >= 2:\r\n count += 1\r\n\r\n# Print the number of problems the friends will implement\r\nprint(count)\r\n", "n=0\r\nfor _ in range(int(input())):\r\n a,b,c=map(int,input().split())\r\n if (a+b+c)>=2:\r\n n+=1\r\nprint(n)\r\n ", "def main():\n n = int(input())\n ans = 0\n for _ in range(n):\n a, b, c = list(map(int, input().split()))\n if a + b + c >= 2:\n ans += 1\n print(ans)\n\nif __name__ == \"__main__\":\n main()", "ans=0;\r\nfor i in range(int(input())):a,b,c=map(int,input().split());ans+=(a+b+c)>1;\r\nprint(ans);", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n nums = list(map(int,input().split()))\r\n sumn = sum(nums)\r\n if sumn >= 2 :\r\n counter += 1\r\n \r\nprint(counter) ", "print(sum(input().count(\"1\") > 1 for i in range(int(input()))))", "l = []\r\nfor i in range(int(input())):\r\n j = input().split()\r\n m = 0\r\n if j.count(\"1\") >= 2:\r\n m += 1\r\n l.append(m)\r\nprint(sum(l))\r\n", "n = int(input()) #total line\nres = 0\n\nfor i in range(n):\n tmp = 0 #tmp result, add to total if greater than or equal to 2\n ans = input().split(\" \")\n\n for a in ans:\n tmp += 1 if a == \"1\" else 0\n\n res += 1 if tmp >= 2 else 0\n\nprint(res)\n \t \t \t \t \t \t \t\t \t\t", "n=int(input())\r\ncnt=0\r\nfor i in range(n):\r\n a,b,c=map(int ,input().split())\r\n if a+b+c>=2:\r\n cnt+=1\r\nprint(cnt)", "n = int(input())\r\nWD = 0\r\nfor i in range(n):\r\n vote = input()\r\n\r\n if vote.count('1') > 1:\r\n WD += 1\r\nprint(WD)", "n = int(input())\n\nproblems = [tuple(map(int, input().split())) for _ in range(n)]\n\n\ncount = 0\n\nfor problem in problems:\n\n if sum(problem) >= 2:\n\n count += 1\n\n\nprint(count)\n \t \t \t \t\t\t\t\t\t\t\t\t \t\t\t\t \t \t \t", "testCases = int(input())\r\n\r\nproblemsSolved = 0\r\nfor _ in range(testCases):\r\n p, v, t = map(int, input().split())\r\n if p + v + t >= 2:\r\n problemsSolved += 1\r\n\r\nprint(problemsSolved)\r\n", "N = int(input())\n\ncount = 0\nfor _ in range(N):\n x = list(map(int, input().split()))\n if x.count(1) > 1:\n count += 1\n \nprint(count)\n ", "x=[]\r\nfor i in range(0, int(input())):\r\n j = input().split()\r\n m=0\r\n if j.count('1') >= 2:\r\n m+=1\r\n x.append(m)\r\nprint(sum(x))", "n = int(input()) #satir sayisi\r\ny=0 #doğru sayisi\r\nwhile n>0 :\r\n n = n-1\r\n x = str(input())\r\n if x.count('1')>1 :\r\n y +=1\r\nprint(y)\r\n", "n = int(input())\r\nproblems_solved = 0\r\nfor i in range(n):\r\n sum_num = sum(map(int, input().split()))\r\n if sum_num >= 2:\r\n problems_solved += 1\r\nprint(problems_solved)", "print(sum(input().count('1') > 1 for _ in range(int(input()))))\r\n", "n = int(input())\r\nans = 0\r\n\r\nfor line in range(n):\r\n\tnum = input().split()\r\n\tnum1 = [int(a) for a in num]\r\n\t\r\n\tif num1[0] + num1[1] + num1[2] >= 2:\r\n\t\tans = ans + 1\r\n\t\r\nprint(ans)", "def count(n, problems):\n solved = 0\n for problem in problems:\n sure_count = sum(problem)\n if sure_count >= 2:\n solved += 1\n return solved\nn = int(input())\nproblems = []\nfor _ in range(n):\n p, v, t = map(int, input().split())\n problems.append([p, v, t])\nresult = count(n, problems)\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())\r\ncounter=0\r\nfor i in range(n):\r\n prob =list( map(int,input().split()))\r\n miniCounter= 0\r\n for i in range(3):\r\n if prob[i]==1:\r\n miniCounter+=1\r\n if miniCounter >=2 :\r\n counter+=1\r\nprint(counter)", "# melike\n\ntotal_project = 0\n\ndecision = 0\n\nnum_of_projects = int(input())\n\nwhile num_of_projects < 1 or num_of_projects > 1000:\n num_of_projects = int(input())\n\nwhile num_of_projects > 0:\n ask_idea = input()\n\n num_of_projects -= 1\n ask_idea = ask_idea.split()\n\n for i in range(0, len(ask_idea)):\n ask_idea[i] = int(ask_idea[i])\n decision += ask_idea[i]\n\n if decision >= 2:\n total_project += 1\n else:\n total_project = total_project\n decision = 0\n\nprint(total_project)\n \t \t \t \t \t \t \t \t\t \t \t", "n = int(input())\n\nres = 0\n\nfor i in range(n):\n numbers = input().split()\n total_ones = 0\n\n if (numbers[0] == \"1\"):\n total_ones += 1\n if (numbers[1] == \"1\"):\n total_ones += 1\n if (numbers[2] == \"1\"):\n total_ones += 1\n\n if total_ones >= 2:\n res += 1\n\nprint(res)\n", "num = int(input())\r\nproblemyes = 0\r\nfor line in range(num):\r\n theinput = input().strip()\r\n row = theinput.split(\" \")\r\n sureness = 0\r\n for sure in row:\r\n if sure == '1':\r\n sureness += 1\r\n if sureness >= 2:\r\n problemyes += 1\r\n\r\nprint(problemyes)\r\n", "n=int(input())\r\no=0\r\nfor i in range(0,n):\r\n x=input()\r\n m=x.count('1')\r\n if m > 1 :\r\n o+=1\r\nprint(o)", "def team(z):\r\n count=0\r\n if sum(z)>=2:count+=1\r\n return count\r\n\r\nn=int(input())\r\nz=0\r\nfor i in range(n):\r\n m=list(map(int,input().split()))\r\n z+=team(m)\r\nprint(z)", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if a+b+c>=2:\r\n d+=1\r\nprint(d)", "n=int(input())\r\nans=0\r\nfor i in range(0,n):\r\n lis=input().split()\r\n s=0\r\n for j in range(0,3):\r\n a=int(lis[j])\r\n s=s+a\r\n if s>=2:\r\n ans=ans+1\r\nprint(ans)", "y=0\r\nfor num in range(int(input())):\r\n a, b ,c = [int(z) for z in input().split(\" \")]\r\n x=0\r\n if(a==1 and b==1 and c==1):\r\n x=x+1\r\n elif(a==1 and b==1 and c==0):\r\n x=x+1\r\n elif(a==1 and b==0 and c==1):\r\n x=x+1\r\n elif(a==0 and b==1 and c==1):\r\n x=x+1\r\n y=y+x\r\nprint(y)\r\n \r\n", "s=0\r\nfor _ in range(int(input())):\r\n s+=sum(int(i) for i in input().split())>1\r\nprint(s)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n a,b,c = map(int,input().split())\r\n if a+b+c >= 2:\r\n ans+=1\r\nprint(ans)", "while True:\r\n aantprob =int(input())\r\n if 1<= aantprob and aantprob <= 1000:\r\n break\r\noplossen = []\r\nfor teller in range(aantprob):\r\n oplossen.append(input())\r\n\r\nctrl1 = 0\r\nfor x in oplossen:\r\n ctrl2 = 0\r\n for y in x:\r\n if y == \"1\":\r\n ctrl2 += 1\r\n if ctrl2 >= 2:\r\n ctrl1 += 1\r\nprint(ctrl1)", "count=0\r\nfor _ in range(int(input())):\r\n x,y,z=map(int,input().split(' '))\r\n if x+y+z>=2:\r\n count+=1\r\nprint(count)", "c=0\r\nn=int(input())\r\nfor i in range(n):\r\n w=input()\r\n if (w.count(\"0\"))>1:\r\n continue\r\n else:\r\n c=c+1\r\nprint(c)", "n = int(input())\r\n\r\ndef checking (count):\r\n problem = 0\r\n if count >= 2:\r\n return 1\r\n return 0 \r\n\r\ncombine = []\r\ntotal_problem = 0\r\nfor idx in range(n):\r\n sure = input() #enter three numbers (only 0 or 1) to show the certaincy of Petya, Vasya, and Tonya. separated by space\r\n lst = sure.split(\" \")\r\n combine.append(lst)\r\nfor i1 in combine:\r\n count = 0\r\n for i in i1:\r\n if i == '1':\r\n count += 1\r\n total_problem += checking(count)\r\n\r\nprint(total_problem)\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "def cont():\n t=int(input())\n count=0\n for i in range(t):\n a,b,c=map(int,input().split())\n if (a==1 and b==1 and c==1) or (a==1 and b==1 and c==0) or (a==1 and b==0 and c==1) or (a==0 and b==1 and c==1):\n count+=1\n print(count)\ncont()\n \t \t\t \t \t \t \t \t \t\t \t \t\t", "n = int(input())\r\nsum = 0\r\nfor i in range(1, n+1):\r\n w = input()\r\n x = w.split()\r\n if x.count(\"1\") >= 2:\r\n sum += 1\r\n else:\r\n sum += 0\r\nprint(sum)", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n s = input()\r\n l = s.split()\r\n for j in range(len(l)):\r\n l[j] = int(l[j])\r\n ab = l[0]+l[1]+l[2]\r\n if ab>=2:\r\n cnt += 1\r\nprint(cnt)\r\n", "s=0\r\nfor i in range(int(input())):\r\n if sum(map(int,input().split())) >= 2:\r\n s+=1\r\nprint(s)", "n=int(input())\r\ncount=0\r\n \r\nfor i in range(n):\r\n a, b, c=map(int,input().split())\r\n if a+b+c >=2:\r\n count=count+1\r\nprint(count)", "print(sum(h.count('1')>1 for h in[*open(0)]))", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n a=list(map(int,input().split()))\r\n if sum(a)>=2:\r\n c+=1\r\nprint(c)", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n (a,b,c)=map(int,input().split(\" \"))\r\n d=a+b+c\r\n if d>=2:\r\n count+=1\r\n else:\r\n continue\r\nprint(count)", "trials = int(input())\r\ncompleted = 0\r\nfor x in range(trials):\r\n problems = input()\r\n ones = problems.count(\"1\")\r\n if ones>1:\r\n completed = completed + 1\r\nprint(completed)", "n = int(input()) \r\nres = 0\r\n\r\nfor i in range(n):\r\n temp = 0 \r\n ansver = input().split(\" \")\r\n\r\n for a in ansver:\r\n if a == \"1\":\r\n temp += 1 \r\n else:\r\n temp += 0 \r\n\r\n if temp >= 2:\r\n res += 1\r\n else:\r\n res += 0\r\n\r\nprint(res)", "count=0\r\nn=int(input())\r\nfor i in range(n):\r\n p,v,t=[int(j) for j in input().split()]\r\n if p+v+t>=2:\r\n count+=1\r\nprint(count)", "limit = int(input())\ncounter = 0\nfor i in range(limit):\n line = str(input()).replace(\" \", \"\")\n if line.count(\"1\") > len(line) / 2:\n counter += 1\nprint(counter)", "count = 0\r\nfor i in range(int(input())):\r\n n = [int(i) for i in input().split()]\r\n if sum(n) >= 2:\r\n count += 1\r\nprint(count)\r\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n s=sum(list(map(int,input().split())))\r\n if s>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = 0\r\nfor i in range(0,n):\r\n girls = [int(x) for x in input(\"\").split(\" \")]\r\n if sum(girls) >= 2:\r\n a += 1\r\nprint(a)", "n=int(input())\ns=0\nfor i in range(1,n+1):\n a=input()\n p=a.split()\n first=int(p[0])\n second=int(p[1])\n third=int(p[2])\n if first+second+third>1:\n s+=1\nprint(s)\n", "n=int(input())\r\nb=0\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\nfor i in range(n):\r\n if int(l[i][0])+int(l[i][2])+int(l[i][4])>=2:\r\n b+=1\r\nprint(b)\r\n \r\n", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if sum(a)>1:\r\n ans+=1\r\nprint(ans)", "n = int(input(''))\r\nnum_submits = 0\r\n\r\nfor i in range(n):\r\n if sum(list(map(int, input('').split(' ')))) >= 2:\r\n num_submits += 1\r\n\r\nprint(num_submits)", "n=int(input())\r\nres=0\r\nfor i in range(n):\r\n s=input()\r\n if s.count(\"1\")>=2:\r\n res+=1\r\nprint(res)\r\n ", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if a+b+c>=2:\r\n s+=1\r\nprint(s)\r\n", "no_problems = int(float(input()))\r\n\r\nsum = []\r\ns = 0\r\nfor i in range(0,no_problems):\r\n petya=[]\r\n petya += input().split(' ')\r\n \r\n sum += str(int(petya[0]) + int(petya[1]) + int(petya[2]))\r\n if int(sum[i]) >= 2:\r\n s += 1\r\n\r\nprint(s)", "t = int(input())\r\nout = 0\r\nwhile t!=0:\r\n i=input().split(' ')\r\n if i.count('1') > 1:\r\n out+=1\r\n t-=1\r\nprint(out)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n u=0\r\n x,y,z=map(int,input().split(\" \"))\r\n if(x==1):\r\n u=u+1\r\n if(y==1):\r\n u=u+1\r\n if(z==1):\r\n u=u+1\r\n if(u>=2):\r\n c=c+1\r\nprint(c)", "count=0\r\nfor _ in range(int(input())):\r\n a,b,c=map(int,input().split())\r\n if a+b+c>=2:\r\n count=count+1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nwhile n > 0:\r\n n -= 1\r\n a, b, c = (int(j) for j in input().split())\r\n sum = a + b + c\r\n if sum >= 2:\r\n count += 1\r\n else:\r\n count += 0\r\nprint(count)\r\n", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n u,v,w=list(map(int,input().split()))\r\n if (u*v)==1 or (v*w)==1 or (u*w)==1:\r\n c+=1\r\nprint(c)", "t=int(input())\ncount=0\nfor i in range(t):\n a,b,c=map(int,input().split())\n if (a==1 and b==1 and c==1) or (a==1 and b==1 and c==0) or (a==1 and b==0 and c==1) or (a==0 and b==1 and c==1):\n count+=1\nprint(count)\n \n\t \t\t \t \t\t\t \t\t\t\t\t \t \t\t\t \t\t \t", "L=[]\r\nn=int(input())\r\nfor i in range(0,n):\r\n a=input().split()\r\n c=0\r\n \r\n if a.count('1')>=2:\r\n c+=1\r\n L.append(c)\r\nprint(len(L))", "n=int(input())\r\nt=0\r\nwhile (n>0):\r\n a1, a2 ,a3=input().split()\r\n if int(a1)+int(a2)+int(a3)>=2:\r\n t=t+1\r\n n=n-1\r\nprint(t)", "n = int(input())\ncount_list = []\nfor i in range(n):\n a = list(map(int, input().split()))\n if sum(a) >= 2:\n count_list.append('1')\nprint(len(count_list))\n\t\t\t\t \t \t\t\t \t \t \t\t\t\t\t\t\t\t\t", "t = int(input())\nres =0\nfor i in range(t):\n\tif input().strip().count('1')>1:\n\t\tres+=1\nprint(res)\n\t\n", "i = int(input())\r\ncount = 0\r\nfor m in range(i):\r\n data = map(int,input().split())\r\n if sum(data)>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n s = input()\r\n bcd = []\r\n abc = s.split()\r\n for k in range(len(abc)):\r\n bcd.append(int(abc[k]))\r\n if sum(bcd) > 1:\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nsolved = 0\r\n\r\nfor i in range(n):\r\n opinion = input()\r\n opinion = opinion.split()\r\n for i in range(len(opinion)):\r\n opinion[i] = int(opinion[i]) \r\n if sum(opinion) >= 2:\r\n solved += 1\r\n\r\nprint(solved)", "n = int(input())\r\ns = 0\r\n\r\nfor i in range(n):\r\n p, v, t = map(int, input().split())\r\n if p + v + t >= 2:\r\n s += 1\r\nprint(s)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a=input().split(\" \")\r\n coun=0\r\n for j in a:\r\n if j=='1':\r\n \r\n coun +=1\r\n if coun>1:\r\n count +=1\r\n \r\nprint(count)", "n = int(input())\r\n\r\ntotal = 0\r\n\r\nfor i in range(n):\r\n certain_list = input().split(\" \")\r\n success = certain_list.count(\"1\")\r\n if success >= 2:\r\n total += 1\r\nprint(total)\r\n", "n = int(input())\r\nX=0\r\nfor i in range(n):\r\n P,V,T = map(int,input().split())\r\n if (P+V+T) >= 2:\r\n X+=1\r\nprint(X)\r\n\r\n\r\n ", "# Team\r\n\r\nn = int(input())\r\nprint(sum([1 if input().count('1') >= 2 else 0 for i in range(n)]))\r\n\r\n\r\n# # دَنگ و دُنگ\r\n\r\n# t = int(input())\r\n# for i in range(t):\r\n# n, S, a = map(int, input().split())\r\n\r\n# for s_i in S:\r\n# x_i = S.lower().count(s_i.lower())\r\n# a_i = ord(s_i.lower()) - 97\r\n# y = (x_i * a_i + 1) % 26\r\n# encrypted += chr(y + 97).upper() if ord(s_i) - 97 < 0 else chr(y + 97)\r\n\r\n# print(encrypted)\r\n\r\n\r\n", "n = int(input())\r\n\r\ns = 0\r\nfor _ in range(n):\r\n d = [*map(int, input().split())]\r\n if d.count(1) >= 2:\r\n s += 1\r\n\r\nprint(s)", "n=int(input())\r\ntotal=int(0)\r\nfor i in range(n):\r\n zadanie = int(0)\r\n a=input()\r\n for q in range(0,len(a),2):\r\n zadanie+=int(a[q])\r\n if zadanie >=2:\r\n total +=1 \r\nprint(total)", "count=0\r\nfor i in range(int(input())):\r\n lst=list(map(int,input().split()))\r\n if lst.count(1)>=2:\r\n count+=1\r\nprint(count)", "def solution():\r\n t=int(input())\r\n i=0\r\n for _ in range(t):\r\n \r\n a,b,c=map(int,input().split())\r\n if (a+b+c)>=2:\r\n i+=1\r\n return(i)\r\nprint(solution())", "n = int(input())\r\nres = 0\r\nfor _ in range(n):\r\n if input().count('1') > 1:\r\n res += 1\r\nprint(res)", "# Define a function to solve the problem\ndef implement_problems(n, problems):\n implemented = 0\n \n # Iterate through each problem\n for problem in problems:\n # Check if at least two friends are sure about the solution\n if sum(problem) >= 2:\n implemented += 1\n \n return implemented\n\n# Read input\nn = int(input())\nproblems = [list(map(int, input().split())) for _ in range(n)]\n\n# Call the function and print the result\nresult = implement_problems(n, problems)\nprint(result)\n\n \t\t \t \t\t\t \t\t \t \t\t \t \t\t \t \t", "n=int(input())\r\np=0\r\nfor i in range(n):\r\n x=list(input().split())\r\n if x.count('1')>1:\r\n p += 1\r\nprint(p)\r\n \r\n", "from collections import Counter\r\nn = int(input())\r\nans = 0\r\nfor _ in range(n):\r\n x = Counter(list(map(int,input().split())))\r\n if x[1] >= 2:\r\n ans += 1\r\nprint(ans)", "question = int(input())\r\nlistOfQuestions = [input()for i in range(question)]\r\n# listOfQuestions = [\"0 1 1\", \"1 1 1\"]\r\ncounter = 0\r\nsuccess = 0\r\nfor i in range(len(listOfQuestions)):\r\n secondList = listOfQuestions[i-1].split()\r\n counter = 0\r\n for j in range(3):\r\n # print(secondList)\r\n # print(secondList[j-1])\r\n if secondList[j-1] == \"1\":\r\n counter += 1\r\n if counter == 2:\r\n counter = 0\r\n success += 1\r\n continue\r\n \r\nprint(success)\r\n ", "n = int(input())\r\n\r\n# Initialize a counter for problems to be implemented\r\nimplemented_problems = 0\r\n\r\n# Iterate through the problems\r\nfor _ in range(n):\r\n # Read the views of Petya, Vasya, and Tonya\r\n petya, vasya, tonya = map(int, input().split())\r\n\r\n # Count the number of friends sure about the solution\r\n friends_sure = petya + vasya + tonya\r\n\r\n # If at least two friends are sure, increment the counter\r\n if friends_sure >= 2:\r\n implemented_problems += 1\r\n\r\n# Print the number of problems to be implemented\r\nprint(implemented_problems)", "num = int(input())\r\ncount = 0\r\nfor x in range(num):\r\n y = map(int, input().split())\r\n y_list = list(y)\r\n if y_list[2] + y_list[1] + y_list[0] >= 2:\r\n count+=1\r\n\r\nprint(count) \r\n\r\n ", "# kutay\nn = int(input()) # toplam problem sayısı\ncount = 0 # implemente edilecek problem sayısını tutmak için bir değişken\n\nfor _ in range(n):\n views = list(map(int, input().split())) # her problem için üç arkadaşın görüşlerini al\n # üç arkadaştan en az ikisi sorunu çözebileceğini düşünüyorsa, problemi çözecekler\n if sum(views) >= 2:\n count += 1\n\nprint(count)\n\n \t \t\t \t\t\t\t\t \t \t\t \t \t \t\t\t\t\t", "inp = int(input())\r\nlist = []\r\ncheck = [\"1 1 1\", \"1 1 0\", \"1 0 1\", \"0 1 1\"]\r\na = 0\r\nfor i in range(0, inp):\r\n list.append(input())\r\nfor i in range(0, len(list)):\r\n if list[i] in check:\r\n a = a+1\r\nprint(a)\r\n", "n=int(input())\n\nsum=0\nfor i in range (0,n,1):\n a,b,c=input().split()\n a=int(a)\n b=int(b)\n c=int(c)\n if (a+b+c)>=2:\n sum+=1\nprint(sum)\n\t\t\t\t\t\t \t \t\t \t\t\t\t\t \t \t\t\t \t \t\t", "nol = int(input())\r\nel = [None]*nol\r\nnum=0\r\nfor i in range(nol):\r\n el[i] = input()\r\n \r\nfor i in range(nol):\r\n arr = el[i].split(' ')\r\n arr = [eval(i) for i in arr]\r\n Sum = sum(arr)\r\n if Sum >= 2:\r\n num=num+1\r\n \r\nprint(num)\r\n ", "a = int(input())\r\nk = 0\r\nfor _ in range(a):\r\n s = list(map(int, input().split()))\r\n if sum(s) >= 2:\r\n k += 1\r\nprint(k)\r\n", "#codeforce pb3\r\nn=int(input())\r\nres=0\r\nfor i in range(n):\r\n a=input()\r\n if a.count('1') >=2:\r\n res+=1\r\n\r\nprint(res)", "while(1):\n n=int(input())\n if n>=1 or n<=100:\n break\nlist_=[] \ncount_=0\nfor i in range(n):\n list_.append(input())\nfor i in range(n):\n count=0\n for j in range(0,5,2):\n if int(list_[i][j])==1:\n count=count+1\n if count>=2:\n count_=count_+1\nprint(count_)\n\n\n \n \n", "print(sum([input().count('1')>1 for _ in range(int(input()))]))\r\n", "n=int(input())\r\nif 1<=n<=1000:\r\n c=0\r\n for j in range(n):\r\n m=list(map(int,input().strip().split()))\r\n x=m.count(1)\r\n y=m.count(0)\r\n if x>y:\r\n c+=1\r\n else:\r\n pass\r\n print(c)", "q=int(input())\r\nn=0\r\nfor i in range(q):\r\n q1=input()\r\n if q1.count('1')>=2: n=n+1\r\nprint(n) ", "n= int(input())\r\nt=0\r\nl=[]\r\nfor i in range(n):\r\n l.append(input())\r\n #list(map(int , input().split()))\r\nfor x in l:\r\n if x.count('1') >=2: t+=1\r\nprint(t)\r\n ", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(list(map(int,input().split())))\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if a[i].count(1) > 1:\r\n count += 1\r\n\r\nprint(count)", "a=int(input())\r\nc=0\r\ne=0\r\nwhile c<a:\r\n s=0\r\n x,y,z=map(int,input().split())\r\n if x==1:\r\n s=s+1\r\n if y==1:\r\n s=s+1\r\n if z==1:\r\n s=s+1\r\n if s>=2:\r\n e=e+1\r\n c=c+1\r\nprint(e)\r\n \r\n ", "# Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of problems they will implement\r\ncount = 0\r\n\r\n# Process each problem\r\nfor _ in range(n):\r\n petya, vasya, tonya = map(int, input().split())\r\n \r\n # Count the number of friends who are sure about the solution\r\n sure_count = petya + vasya + tonya\r\n \r\n # If at least two friends are sure, increment the count\r\n if sure_count >= 2:\r\n count += 1\r\n\r\n# Print the number of problems they will implement\r\nprint(count)\r\n", "t=int(input())\r\ncount=0\r\nfor i in range(t):\r\n x,y,z=input().split()\r\n l=int(x)\r\n b=int(y)\r\n a=int(z)\r\n if a+b+l>=2:\r\n count=count+1\r\n else:\r\n pass\r\nprint(count)\r\n \r\n", "n=int(input())\r\ncount=c=0\r\nl=[]\r\nk=[]\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n k.append(l)\r\n count=0\r\nfor i in k:\r\n count=i.count(1)\r\n if(count>=2):\r\n c+=1\r\nprint(c)\r\n \r\n ", "n = int(input())\r\nd = 0\r\n\r\nfor i in range(n):\r\n \r\n a,b,c = map(int,input().split())\r\n if a==1 and b==1:\r\n d+=1\r\n elif b ==1 and c ==1:\r\n d+=1\r\n elif c ==1 and a ==1:\r\n d+=1\r\nprint(d)", "n = int(input())\r\nresult = sum(sum(int(i) == 1 for i in input().split()) > 1 for _ in range(n))\r\nprint(result)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n qn=list(map(int,input().split()))\r\n if qn.count(1)>=2:\r\n count=count+1\r\nprint(count)", "n = int(input())\ntotal = 0\nfor i in range(0,n):\n problems = input()\n first, second, third = int(problems[0]), int(problems[2]), int(problems[4])\n if (first+second+third)>=2:\n total += 1\n\nprint(total)", "if __name__ == '__main__':\r\n n = int(input())\r\n score = 0\r\n for i in range(n):\r\n input_str = input()\r\n split_values = input_str.split()\r\n p, v, t = split_values\r\n\r\n if(int(p)+int(v)+int(t)>=2):\r\n score += 1\r\n\r\n print(score)\r\n\r\n", "n=int(input())\r\nk=n\r\nfor i in range(n):\r\n x=(input())\r\n l=[\"0 0 0\",\"0 0 1\",\"0 1 0\",\"1 0 0\"]\r\n for j in l:\r\n if j==x:k=k-1\r\nprint(k)", "n=int(input())\r\ncount=0\r\nsomm=0\r\n\r\nfor i in range(0,n):\r\n responses=input()\r\n individual=responses.split(\" \")\r\n somm= int(individual[0]) + int(individual[1])+int(individual[2])\r\n if somm>=2:\r\n count=count+1\r\n\r\n\r\nprint(count)", "a=int(input())\r\nk=0\r\nfor i in range(a):\r\n x=list(map(int,input().split()))\r\n if sum(x)>1:\r\n k+=1\r\nprint(k)\r\n", "x = int(input())\r\n\r\nsum = 0\r\n\r\nfor i in range(x):\r\n\r\n a, b, c = [int(f) for f in input().split()]\r\n if a + b + c >= 2:\r\n sum += 1\r\n\r\nprint(sum)", "n = int(input())\r\ni = 0\r\nwhole_word = \"\"\r\ncount_tasks = 0\r\n\r\nwhile i < n:\r\n task = input()\r\n count = 0\r\n for num in task:\r\n if num == \"1\":\r\n count += 1\r\n if count >= 2:\r\n count_tasks += 1\r\n i += 1\r\n\r\nprint(count_tasks)\r\n", "#https://codeforces.com/contest/231/problem/A 51\r\nfrom collections import Counter\r\nn = int(input())\r\nc = []\r\ncount = 0\r\nwhile n: \r\n i = input()\r\n c = Counter(i)\r\n if c['1'] > 1:\r\n count += 1\r\n n-=1\r\nprint(count)", "n = int(input())\r\nq = 0\r\nfor _ in range(n):\r\n li = [int(value) for value in input().split()]\r\n summ = sum(li)\r\n if summ >= 2:\r\n q += 1\r\nprint(q)", "n=int(input())\r\nans = 0\r\nfor _ in range(n):\r\n a,b,c = map(int,input().split())\r\n if a+b+c>1:\r\n ans = ans+1\r\nprint(ans)", "win=0\r\n\r\nfor _ in range(int(input())):\r\n \r\n c=list(map(int,input().split()))\r\n if sum(c) > 1:\r\n win+=1\r\nprint(win) \r\n\r\n\r\n\r\n", "\r\nans = 0 \r\nfor _ in range(int(input())):\r\n if input().count('1') > 1: \r\n ans += 1\r\n \r\nprint(ans)", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n p,v,t=map(int,input().split())\r\n if p+v+t>=2:\r\n ans+=1\r\nprint(ans) ", "n = int(input())\r\nl = 0\r\nfor i in range(1,n+1):\r\n a = list(map(int, input().split()))\r\n s = a[0] + a[1] + a[2]\r\n if s > 1:\r\n l += 1\r\nprint(l)", "bruhmoment=int(input())\r\nsureproblems=0\r\nfor i in range(bruhmoment):\r\n list=[int(x) for x in input().split()]\r\n if list.count(1)>1:\r\n sureproblems+=1\r\nprint(sureproblems)", "# Name: Team\nn = int(input())\noutput = 0\n\nfor i in range(n):\n t = input().split()\n if t.count('1') >= 2:\n output+=1;\n \nprint(output)", "n = int(input())\r\n\r\ntask = 0\r\ntasks = [list(map(int, input().split())) for i in range(n)]\r\n\r\nfor i in tasks:\r\n tmp_1 = i\r\n tmp = 0\r\n for j in tmp_1:\r\n if j == 1:\r\n tmp += 1\r\n if tmp >= 2:\r\n task += 1\r\n\r\nprint(task)", "k=0\r\nfor j in range(int(input())):\r\n *b,=map(int,input().split())\r\n if b.count(1)>=2:\r\n k=k+1\r\nprint(k)", "n=int(input())\r\nsum=0\r\nfor i in range(n):\r\n a,b,c=input().split()\r\n \r\n if int(a)+int(b)+int(c)>=2:\r\n sum=sum+1\r\nprint(sum)", "count = 0\r\nfor i in range(int(input())):\r\n n = 0\r\n l = list(map(int,input().split()))\r\n for a in l:\r\n if a == 1:\r\n n+=1\r\n if n>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a,b,c = map(int, input().split())\r\n if((a != 0 and b!=0)):\r\n count += 1\r\n elif(a != 0 and c!=0):\r\n count += 1\r\n elif(b!=0 and c!=0):\r\n count += 1\r\nprint(count)", "n=int(input())\r\nlis=[]\r\ns=0\r\nfor i in range(n):\r\n lis=input().split(\" \")\r\n if int(lis[0])+int(lis[1])+int(lis[2])>=2:\r\n s+=1\r\n lis*=0\r\nprint(s)\r\n \r\n", "content = []\r\nfinal = 0\r\nb = int(input())\r\nfor i in range(b):\r\n contents = [int(x) for x in input().split()]\r\n content.append(contents)\r\n\r\nfor i in range(len(content)):\r\n if content[i].count(1) >= 2:\r\n final += 1\r\n\r\nprint(final)", "def draw_st(n):\r\n\r\n\r\n\r\n counter = 0\r\n\r\n for _ in range(n):\r\n\r\n a, b, c = map(int, input().split())\r\n if a + b == 2 or b + c == 2 or a + c == 2 or a + b + c == 3:\r\n counter += 1\r\n print(counter)\r\nn = int(input())\r\ndraw_st(n)", "n = int(input())\r\nls = []\r\nfor i in range(n):\r\n j = input().split()\r\n m = 0\r\n \r\n if j.count('1') >= 2: \r\n m += 1\r\n ls.append(m)\r\nprint(sum(ls))", "num_of_prblms = int(input())\r\nsolutions = 0\r\n\r\nfor line in range(num_of_prblms):\r\n \r\n supmit = input()\r\n \r\n if supmit.count(\"1\") >=2:\r\n solutions += 1\r\n \r\nprint(solutions)", "n = int(input())\r\n\r\nc=0\r\nfor i in range(n):\r\n m = input().split()\r\n m = [int(j) for j in m]\r\n if sum(m)>1:\r\n c += 1\r\nprint(c)\r\n ", "n = int(input())\r\ncount =0\r\nfor i in range(n):\r\n q = input().split()\r\n a = int(q[0]) + int(q[1]) + int(q[2])\r\n if (a>1):\r\n count +=1\r\n \r\nprint(count)\r\n ", "ct = 0\r\nfor _ in range(int(input())):\r\n l = list(map(int, input().split()))\r\n if l.count(1) > 1:\r\n ct += 1\r\nprint(ct)", "t = int(input())\r\nf=0\r\nfor i in range(t):\r\n x = list(map(int,input().split(' ')))\r\n if sum(x)>1:\r\n f+=1\r\nprint(f)", "c,n=0,int(input());x=[list(map(int,input().split())) for i in range(n)]\r\nfor i in x:\r\n if i.count(1)>1: c+=1\r\nprint(c)", "number_of_tasks = int(input())\r\n\r\ncounter = 0\r\n\r\n\r\nfor i in range(number_of_tasks):\r\n people_opinions = input()\r\n count = people_opinions.count('1')\r\n if count > 1:\r\n counter += 1\r\nprint(counter)", "print(sum(sum(map(int,input().split())) > 1 for _ in range(int(input()))))\n\t\t\t\t \t\t \t \t \t\t \t \t\t\t\t", "# -*- coding: utf-8 -*-\n\"\"\"Untitled1.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ighsdlmA_THHGt8tfPYaeXAX6HXp9T9O\n\"\"\"\n\nn = int(input()) # Read the number of problems\ncount = 0 # Initialize the count of problems to be implemented\n\nfor _ in range(n):\n petya, vasya, tonya = map(int, input().split())\n\n # Count the number of friends who are sure about the solution\n sure_count = petya + vasya + tonya\n\n # Check if at least 2 friends are sure\n if sure_count >= 2:\n count += 1\n\nprint(count) # Output the number of problems to be implemented", "# n=int(input())\r\n# res=[]\r\n# for i in range(n):\r\n# a=input()\r\n# if a.upper()==\"YES\":\r\n# res.append(\"YES\")\r\n# else:\r\n# res.append(\"NO\")\r\n# for i in res:\r\n# print(i)\r\n\r\nn=int(input())\r\nres=0\r\nfor i in range(n):\r\n p,v,t=[int(i) for i in input().split(\" \")]\r\n if p+v+t>=2:\r\n res+=1\r\nprint(res)", "n = int(input())\n\n# Initialize a variable to count the problems they will solve\nproblems_solved = 0\n\n# Iterate through each problem\nfor _ in range(n):\n views = list(map(int, input().split()))\n \n # Count the number of friends who are sure about the solution\n sure_count = sum(views)\n \n # Check if at least two friends are sure about the solution\n if sure_count >= 2:\n problems_solved += 1\n\nprint(problems_solved)\n \t\t\t\t \t \t\t\t\t\t \t\t \t\t\t \t", "a=int(input())\r\nright=0\r\nfor i in range(1,a+1):\r\n game=list(input().split())\r\n if game.count('1')>1:\r\n right+=1\r\nprint(right)", "a = int(input())\r\nb = []\r\nfor i in range(a):\r\n c = list(map(int,input().split()))\r\n b.append(c)\r\nyes = 0 \r\nfor j in b:\r\n if j.count(1) >= 2:\r\n yes = yes + 1\r\nprint(yes)", "import math\r\nx=int(input())\r\ncount=0\r\nfor i in range(x):\r\n c,h,p=map(int,input().split())\r\n if (c+h+p)>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\nans = 0\r\n\r\nfor _ in range(n):\r\n\r\n if sum(list(map(int, input().split()))) > 1:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "t=int(input())\nco=0\nwhile(t):\n t-=1\n x,y,z=map(int,input().split())\n if((x==1 and y==1) or (y==1 and z==1) or (x==1 and z==1)):\n co+=1\n \nprint(co)\n \t\t \t\t \t\t \t \t \t\t \t \t", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n tasks = list(map(int, input().split()))\r\n if (tasks[0] == tasks[1] == 1) or (tasks[0] == tasks[2] == 1) or (tasks[1] == tasks[2] == 1):\r\n counter += 1\r\nprint(counter)", "def count_problems(n, problems):\r\n count = 0\r\n for problem in problems:\r\n if sum(problem) >= 2: # At least two friends are sure about the solution\r\n count += 1\r\n return count\r\n\r\n# Read input\r\nn = int(input())\r\nproblems = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n# Calculate and print the number of problems to implement\r\nresult = count_problems(n, problems)\r\nprint(result)", "t=int(input())\r\nasw=0\r\nwhile t!=0:\r\n count=0\r\n a,b,c=list(map(int,input().split()))\r\n if a>0:\r\n count=count+1\r\n if b>0:\r\n count=count+1\r\n if c>0:\r\n count=count+1\r\n if count>1:\r\n asw=asw+1\r\n t=t-1\r\nprint(asw)", "# Read the number of problems\nn = int(input())\n\n# Initialize a counter for problems they will implement\nimplement_count = 0\n\n# Process each problem\nfor _ in range(n):\n petya, vasya, tonya = map(int, input().split())\n \n # Check if at least two friends are sure about the solution\n if petya + vasya + tonya >= 2:\n implement_count += 1\n\n# Print the number of problems they will implement\nprint(implement_count)\n\n\t \t \t \t \t\t\t\t \t \t\t \t \t\t \t", "n = int(input())\r\nif n>1000:\r\n quit()\r\nx=0\r\nfor i in range(0,n): \r\n k = input()\r\n \r\n if k.count('1')>=2:\r\n \r\n x+=1\r\n \r\n i+=1\r\n\r\nprint(x)\r\n ", "n=int(input())\r\nc=0\r\nt=tuple()\r\nwhile n>0:\r\n n-=1\r\n x,y,z=map(int,input().split())\r\n t=x,y,z\r\n if t.count(1)>=2 :\r\n c+=1\r\nprint(c)", "n = int(input())\r\ntotal = 0\r\nfor i in range(n):\r\n ls = map(int, input().split())\r\n sum1 = 0\r\n for j in ls:\r\n sum1 += j\r\n if sum1 > 1:\r\n total += 1\r\nprint(total)\r\n", "\r\nlucky_task = 0\r\nn = int(input())\r\nfor i in range(n):\r\n ls_str = input().split()\r\n ls_int = [int(ls_str[i]) for i in range(3)]\r\n if sum(ls_int) >= 2:\r\n lucky_task += 1\r\n\r\nprint(lucky_task)", "total = 0\r\nfor i in range(int(input())):\r\n if input().split().count('1') >= 2:\r\n total += 1\r\n\r\nprint(total)", "n=int(input())\r\n \r\nans=0\r\nfor i in range(n):\r\n\ts= input()\r\n\tif s==\"1 1 1\" or s==\"1 1 0\" or s==\"0 1 1\" or s==\"1 0 1\":\r\n\t\tans = ans+1\r\nprint(ans)\r\n", "n= int(input())\r\nr=0\r\nfor i in range (n):\r\n x = input().split()\r\n if x.count('1') > x.count('0'):\r\n r+=1\r\nprint(r)", "t = int(input())\r\ncount = 0\r\nwhile t > 0 :\r\n t -= 1\r\n x = sum([int(e) for e in input().split()])\r\n if x >= 2:\r\n count +=1\r\nprint(count)", "x=int(input())\r\ncount=0\r\nfor i in range (x):\r\n inp=input()\r\n inpl=inp.split(\" \")\r\n inpl=[int(i) for i in inpl]\r\n if inpl.count(1)>=2:\r\n count=count+1\r\n else:\r\n continue\r\nprint(count)\r\n", "# w = int(input())\r\n# if w % 2 == 1:\r\n# print('NO')\r\n# else:\r\n# if w <=2:\r\n# print('NO')\r\n# else:\r\n# print('yes') \r\n\r\n\r\n\r\n\r\n\r\n\r\n# n = int(input())\r\n\r\n\r\n# arr = []\r\n# for i in range(n):\r\n# arr.append(input())\r\n\r\n# for str in arr:\r\n# if len(str)>10 :\r\n# print(f'{str[0]}{len(str) - 2}{str[len(str) - 1 ]}')\r\n# else:\r\n# print(str) \r\n\r\n\r\n\r\nn = int(input())\r\n\r\n\r\nres = 0\r\nfor i in range(n):\r\n arr = input().split()\r\n if (( int(arr[0])) + int(arr[1]) + int(arr[2])>1):\r\n res +=1\r\n\r\nprint(res) \r\n\r\n\r\n\r\n\r\n\r\n", "a = int(input())\r\ni = 0\r\nb = 0\r\nwhile i < a:\r\n if input().count('1')>1:\r\n b +=1\r\n i +=1\r\nprint(b)", "inp = int(input())\ncount = 0\n\nfor i in range(inp):\n a, b, c = map(int, input().split())\n list = [a, b, c]\n if (list[0] + list[1] + list[2]) >= 2:\n count = count+1 \n \nprint(count)", "a = int(input())\r\nb = 0\r\nfor i in range(a):\r\n m,p,k = map(int,input().split())\r\n if m + p + k >= 2:\r\n b = b + 1\r\nprint(b)\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n sum = a+b+c\r\n if sum>=2:\r\n count+=1\r\nprint(count)", "t=int(input())\ncount=0\nfor i in range(t):\n a,b,c=map(int,input().split())\n if(a==b==1 or b==c==1 or a==c==1 or a==b==c==1):\n count=count+1\nprint(count)\n\t \t\t\t \t \t\t \t \t\t\t\t \t \t\t\t \t\t \t", "loop = int(input())\r\nproblemas = 0\r\nfor x in range(0,loop):\r\n word = input()\r\n sum = int(word[0]) + int(word[2]) + int(word[4])\r\n if sum == 2 or sum == 3:\r\n problemas +=1\r\nprint(problemas)", "num = int(input())\r\nfinal = 0\r\n\r\nfor _ in range(num):\r\n x = input().split()\r\n x = [int(i) for i in x]\r\n \r\n if sum(x) >= 2:\r\n final += 1\r\n\r\nprint(final)\r\n", "n = int(input())\r\nanswer = 0\r\nfor _ in range(n):\r\n line = input()\r\n if line.count('1')>=2:\r\n answer+=1\r\nprint(answer)", "\r\n\r\nn = int(input())\r\nt = []\r\nfor i in range(n):\r\n numbers = list(map(int,input().split()))\r\n t.append(numbers)\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n if t[i][0] + t[i][1] + t[i][2] >=2:\r\n counter +=1\r\nprint(counter)", "n = int(input())\r\nproblems = []\r\nknown_problems = 0\r\nfor i in range(n):\r\n problems.append(tuple(map(int, str(input()).split())))\r\nfor problem in problems:\r\n if sum(problem) > 1:\r\n known_problems += 1\r\nprint(known_problems)\r\n", "n=int(input())\r\na=0\r\nfor i in range(n):\r\n b=input().split(\" \")\r\n b=list((map(int,b)))\r\n b = [int(i) for i in b]\r\n if sum(b)>=2:\r\n a=a+1\r\n else:\r\n continue\r\nprint(a)", "n = int(input())\r\ncounter = 0\r\nfor x in range(0, n):\r\n prob = input()\r\n prob = prob.split(\" \")\r\n if (int(prob[0]) + int(prob[1]) + int(prob[2])) >= 2:\r\n counter += 1\r\nprint(counter)", "problems = int(input())\nans = 0\n\nfor rep in range(0,problems):\n p,v,t = (int(x) for x in input().split())\n if p+v+t >= 2:\n ans += 1\n \nprint(ans)\n \t \t\t \t\t\t \t \t \t \t \t", "a=int(input(\"\"))\r\noutput=0\r\nfor i in range (a):\r\n ch= input(\"\")\r\n if (ch== \"1 1 1\" or ch== \"1 1 0\" or ch== \"1 0 1\" or ch==\"0 1 1\"):\r\n output+=1\r\nprint(output)\r\n \r\n", "t = int(input())\r\nc = 0\r\nwhile t!=0:\r\n lst = list(map(int, input().split()))\r\n if lst.count(1) > 1:\r\n c+=1\r\n t-=1\r\nprint(c)", "count = int(input())\r\n\r\nproblems = [None] * count\r\n\r\nproblemssol = 0\r\n\r\nfor i in range(count):\r\n problems[i] = [int(x) for x in input().split(\" \")]\r\n \r\nfor i in range(count):\r\n if sum(problems[i]) > 1:\r\n problemssol += 1\r\n \r\nprint(problemssol)", "# elif\na=int(input())\ncntr , cntr2 = 0 , 0\nfor i in range (a):\n b=input()\n for num in b:\n if num==\"1\":\n cntr+=1\n if cntr>=2:\n cntr2+=1\n cntr=0\nprint(cntr2)\n\t\t\t\t\t\t \t \t\t\t \t \t\t \t \t", "n=int(input())\r\nL=[]\r\nfor i in range(n):\r\n a=[]\r\n k=list(input()) \r\n L.append(k)\r\nco=0\r\n\r\nfor i in L:\r\n if i.count('1')>=2:\r\n co=co+1\r\nprint(co)\r\n ", "a = int(input())\r\nb = 0\r\nfor i in range(a):\r\n x,y,z = map(int,input().split())\r\n if 1 < x+y+z <= 3:\r\n b += 1\r\nprint(b)", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n a = input()\r\n a = a.split(\" \")\r\n b = 0\r\n for j in a:\r\n if j == \"1\":\r\n b += 1\r\n if b >= 2:\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\nsum,cnt=0,0\r\nfor i in range(n):\r\n string=input()\r\n sum+=int(string[0])+int(string[2])+int(string[4])\r\n if sum>1:\r\n cnt+=1\r\n sum=0\r\nprint(cnt)\r\n", "n = int(input())\r\nans = 0 \r\nwhile n > 0 :\r\n temp = 0 \r\n a = input().split(' ')\r\n for x in a :\r\n if x == '1':\r\n temp +=1\r\n if temp> 1 :\r\n ans+=1\r\n n-=1\r\nprint(ans)", "print(sum([1 for i in range(int(input())) if sum([int(j) for j in input().split()]) >= 2]))", "n = int(input())\r\nsolved=0\r\nfor i in range(n):\r\n number=input()\r\n if number.count('1') > 1 : \r\n solved+=1\r\nprint(solved)", "n=int(input())\r\ncount=0\r\nwhile n>0:\r\n a , b , c = map(int,(input().split()))\r\n\r\n if(a&b)or(b&c)or(c&a):\r\n count+=1\r\n n-=1\r\nprint(count)\r\n", "n = int(input())\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n \r\n val = input()\r\n val = val.split(\" \")\r\n \r\n count = 0\r\n for v in val:\r\n if v == '1':\r\n count += 1\r\n \r\n if count >= 2:\r\n ans += 1\r\n \r\nprint(ans)", "from posixpath import split\r\nn = int(input())\r\nimplement =0\r\nfor i in range(n) :\r\n p,v,t = map(int, input().split())\r\n if p+v+t>=2 :\r\n implement+=1\r\nprint(implement)", "l = int(input())\r\nrcount = 0\r\nfor _ in range(l):\r\n m = list(map(int,input().split()))\r\n count = 0\r\n for i in m:\r\n if i == 1:\r\n count +=1\r\n if count >1:\r\n rcount +=1\r\nprint(rcount)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n p,v,t = map(int,input().split())\r\n if (p == 1 and v == 1) or (p == 1 and t == 1):\r\n ans += 1\r\n elif (p == 1 and v == 1) or (v == 1 and t == 1):\r\n ans += 1\r\n elif (p == 1 and t == 1) or (v == 1 and t == 1):\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nc=0\r\nfor i in range (n):\r\n x,y,z=map(int,input().split()) \r\n if (x+y+z)>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\nct = 0\r\nfor i in range(n):\r\n s = map(int,input().split())\r\n if sum(s) > 1: ct +=1\r\nprint((ct))", "# Problem: A. Team\r\n# Contest: Codeforces - Codeforces Round 143 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/231/A\r\n# Memory Limit: 256 MB\r\n# Time Limit: 2000 ms\r\n# \r\n# Powered by CP Editor (https://cpeditor.org)\r\n\r\nimport sys\r\nimport math\r\n\r\ninput = sys.stdin.readline\r\n\r\ninp = lambda: input().strip()\r\ngi = lambda: list(map(int, input().split()))\r\ngs = lambda: list(input().split())\r\n\r\ndef solve():\r\n n = int(inp())\r\n cout = 0\r\n for i in range(n):\r\n \ta = gi()\r\n \tif sum(a) >= 2:\r\n \t\tcout += 1\r\n print(cout)\r\n \r\n \r\ntest_cases = 1\r\n#test_cases = int(input())\r\n\r\nfor _ in range(test_cases):\r\n solve()\r\n \r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\n\r\ncounter = 0\r\nfor i in range(n):\r\n opinion = map(int, input().split())\r\n if sum(opinion) >= 2:\r\n counter += 1\r\n\r\nprint(counter)\r\n", "n = int(input())\r\nb = 0\r\nfor _ in range(n):\r\n x=0\r\n p, v, t = map(int, input().split())\r\n x = x + p + v + t\r\n if x>=2:\r\n b+=1\r\nprint(b)", "#Team\r\nn=int(input())\r\ncount=0\r\nfor i in range(0,n):\r\n lst=input().split()\r\n if lst.count('1')>=2:\r\n count=count+1\r\nprint(count)", "n=int(input())\r\ncount=0\r\n\r\nfor _ in range(n):\r\n petya,vasya,tonya=map(int,input().split())\r\n \r\n if petya+vasya+tonya>=2:\r\n count+=1\r\n\r\nprint(count)", "n=int(input())\r\nnum=0\r\n \r\nfor i in range(n):\r\n answer=list(input())\r\n # print(answer)\r\n if int(answer[0])+int(answer[2])+int(answer[4])>=2:\r\n num+=1\r\n\r\nprint(num)", "n = int(input())\r\n\r\nresult = 0\r\n\r\nfor _ in range(n):\r\n x, y, z = map(int, input().split())\r\n\r\n if x + y + z >= 2:\r\n result += 1\r\n\r\nprint(result)", "t = int(input())\r\n\r\naz = []\r\n\r\nfor i in range(t):\r\n\r\n z = list(map(int, input().split()))\r\n\r\n az.append(z)\r\n\r\nwins = 0\r\n\r\nfor i in range(t):\r\n\r\n total = 0\r\n\r\n for j in range(3):\r\n\r\n if az[i][j] == 1:\r\n\r\n total += 1\r\n\r\n if total >= 2: wins += 1\r\n\r\nprint(wins)", "s=[]\r\nfor i in range(0,int(input())):\r\n k=input().split()\r\n n=0\r\n if k.count('1')>=2:\r\n n+=1\r\n s.append(n)\r\nprint(sum(s))", "n = int(input())\r\nnumber_of_twos = 0\r\nfor _ in range(n):\r\n a = input()\r\n if a == '1 1 1' or a == '1 1 0' or a == '0 1 1' or a == '1 0 1':\r\n number_of_twos += 1\r\nprint(number_of_twos)\r\n", "no = int (input())\r\nsuma = 0\r\nfor i in range (no):\r\n opinion = input ()\r\n opiniom = opinion.split(' ')\r\n p = int ( opiniom [0])\r\n v = int ( opiniom [1])\r\n t = int ( opiniom [2])\r\n s=p+v+t\r\n if s > 1:\r\n suma +=1\r\nprint (suma)\r\n \r\n \r\n", "n = int(input())\ntotal_count = 0\nfor _ in range(0, n):\n line = str(input())\n count = 0\n for char in line:\n if char == '1':\n count += 1\n\n if count >= 2:\n total_count += 1\nprint(total_count)\n\n", "lines = []\r\ncounter = 0\r\n\r\nn = int(input())\r\n\r\nfor i in range(n): # getting the lines\r\n line = input()\r\n lines.append(line.split())\r\n\r\nfor l in range(n): \r\n for i in range(3): # converting into integers\r\n lines[l][i] = int(lines[l][i])\r\n lines[l] = sum(lines[l]) # summing up the integers\r\n\r\nfor num in lines: # checking for each line if its sum is highrt than or equal to two\r\n if num >= 2:\r\n counter += 1\r\n\r\nprint(counter)\r\n\r\n\r\n", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n p = map(int, input().split())\r\n if sum(p) >= 2:\r\n k += 1\r\nprint(k)\r\n \r\n", "t = int(input())\r\nc=0\r\nfor i in range(t):\r\n x,y,z = map(int,input().split())\r\n if(x+y + z >=2):\r\n c+=1\r\nprint(c)\r\n", "a = 0\r\nfor i in range(int(input())):\r\n b = list(map(int, input().split()))\r\n if sum(b) >= 2:\r\n a += 1\r\nprint(a)", "n=int(input())\r\nh=0\r\nfor i in range(n):\r\n x = [int(x) for x in input().split()]\r\n s=0\r\n for j in x:\r\n s+=j \r\n if s>=2:\r\n h+=1\r\nprint(h)", "n = int(input())\r\nfor i in range(n):\r\n row = list(map(int, input().split(' ')))\r\n if sum(row) < 2: n -= 1\r\n\r\nprint(n)", "res = 0\r\nfor _ in range(int(input())):\r\n vector = list(map(int, input().split()))\r\n if vector.count(1) >= 2:\r\n res += 1\r\nprint(res)\r\n", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if (a+b+c) >=2:\r\n count+=1\r\nprint(count) ", "def teamSolve(arr):\r\n if arr.count(1) >= 2:\r\n return 1\r\n return 0\r\n\r\n\r\nt = int(input())\r\ncount = 0\r\nfor _ in range(t):\r\n n = 3\r\n arr = list(map(int, input().split(' ')))\r\n count += teamSolve(arr)\r\n\r\nprint(count)\r\n", "import sys\r\nfrom os import path\r\n\r\ndef get_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef get_str():\r\n return sys.stdin.readline().strip()\r\n\r\nn = get_int() \r\ntot = 0\r\nfor i in range(n):\r\n num = get_str()\r\n lis = num.split(\" \")\r\n if (lis.count('1') >= 2):\r\n tot += 1\r\n\r\nprint(tot)", "n=int(input())\r\ncount=0\r\nfor i in range(1,n+1):\r\n w=input().strip().split()\r\n c=0\r\n for item in w:\r\n if int(item)==1:\r\n c+=1\r\n if c>=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ndef sure():\r\n answer = list(input().split())\r\n if answer.count(\"0\") >= 2:\r\n return False\r\n else:\r\n return True\r\nx = 0\r\nfor i in range(n):\r\n if sure():\r\n x+=1\r\n else:\r\n pass\r\nprint(x)\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n compound = a+b+c \r\n if compound >= 2:\r\n count = count + 1\r\nprint(count)", "c = 0\r\nn = [input() for i in range(int(input()))]\r\nfor j in n:\r\n if j.count('1') >= 2:\r\n c += 1\r\nprint(c)", "n = int(input())\r\nresueltos = 0\r\nfor i in range(n):\r\n lista = list(map(int, input().split()))\r\n cantidad = lista.count(1)\r\n if cantidad >= 2:\r\n resueltos += 1\r\nprint(resueltos) ", "n=int(input())\r\nc=0\r\nr=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n c=l.count(1)\r\n if(c>=2):\r\n r=r+1\r\nprint(r) ", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n L=[0,0,0]\r\n L[0],L[1],L[2]=map(int,input().split())\r\n p=0\r\n for x in L:\r\n if x==1:\r\n p+=1\r\n if p>1:\r\n d+=1\r\nprint(d)\r\n", "n = int(input())\r\nanswer = 0\r\nfor x in range(n):\r\n q = str(input())\r\n\r\n if int(q[0]) + int(q[2]) + int(q[4]) > 1:\r\n answer += 1\r\nprint(answer)", "n = int(input()) # Read the number of problems\r\n\r\nproblems_solved = 0 # Initialize a variable to count problems they will solve\r\n\r\nfor _ in range(n):\r\n petya, vasya, tonya = map(int, input().split())\r\n \r\n # Count how many friends are sure about the solution\r\n friends_sure = petya + vasya + tonya\r\n \r\n # Check if at least two friends are sure about the solution\r\n if friends_sure >= 2:\r\n problems_solved += 1\r\n\r\n# Print the number of problems they will solve\r\nprint(problems_solved)", "n = int(input())\r\ncount=0\r\nfor i in range(n):\r\n p, v, t = map(int, input().split())\r\n if (p == 1 and v == 1) or (v == 1 and t == 1) or (t == 1 and p == 1):\r\n count = count + 1\r\n\r\nprint(count)", "n=int(input())\r\nhui=[]\r\nfor i in range(n):\r\n shuru=list(map(int,input().split(' ')))\r\n hui.append(sum(shuru)>=2)\r\nprint(sum(hui))", "\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n n=int(input())\r\n lista=[]\r\n i=0\r\n sum=0\r\n \r\n while(i<n):\r\n lista.append(input().split(\" \"))\r\n j=0\r\n members=0\r\n \r\n while(j<3):\r\n if(lista[i][j]==\"1\"):\r\n members+=1\r\n j+=1\r\n \r\n if(members>=2):\r\n sum+=1\r\n\r\n\r\n i+=1\r\n \r\n print(sum)\r\n\r\n ", "mas = []\r\ndef readProbList(arr):\r\n n = int(input())\r\n mas=[]\r\n for i in range (n):\r\n nums = input()\r\n mas = nums.split()\r\n for _ in range(len(mas)):\r\n mas[_]=int(mas[_])\r\n arr.append(mas)\r\n return arr\r\n\r\ndef SumCounter(array):\r\n sum = 0\r\n for i in range (len(array)):\r\n sum = sum + array[i]\r\n return sum\r\ndef ProbCounter(array): #only for 2d arrays\r\n count = 0\r\n for i in range (len(array)):\r\n if SumCounter(array[i]) >=2:\r\n count+=1\r\n print(count)\r\n\r\narray = readProbList(mas)\r\nProbCounter(array)\r\n\r\n", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n c = 0\r\n for j in l:\r\n if(j == 1):\r\n c = c+1\r\n else:\r\n continue \r\n if(c>=2):\r\n a=a+1\r\nprint(a)\r\n ", "l =[]\r\nfor i in range(0, int(input())):\r\n j=input().split()\r\n c=0\r\n if j.count('1')>1:\r\n c+=1\r\n l.append(c)\r\nprint(sum(l))", "k=int(input())\r\nc=0\r\nfor i in range(k):\r\n a=list(map(int,input().split()))\r\n if a.count(1)>=2:\r\n c+=1\r\nprint(c)", "count = 0\r\nfor _ in range(int(input())):\r\n if sum(map(int, input().split())) >= 2:\r\n count += 1\r\nprint(count)", "problems=int(input())\nj=0\ncount = 0\nwhile j<problems:\n a,b,c=map(int,input().split())\n if a+b+c>=2:\n count += 1\n j=j+1\nprint(count)\n", "i = int(input())\r\nn = 0\r\nfor j in range(i):\r\n a,b,c = input().split()\r\n if int(a)+int(b)+int(c) >= 2:\r\n n += 1\r\n \r\nprint(n)", "n = int(input())\r\nk = 0\r\n\r\nfor _ in range(n):\r\n all_view = list(map(int, input().split()))\r\n if sum(all_view) >= 2:\r\n k += 1\r\n\r\nprint(k)", "n = int(input())\ncount = 0 \nfor i in range(n):\n x = input().split()\n for l in range(len(x)):\n x[l] = int(x[l])\n if sum(x) >= 2:\n count += 1\n\nprint (count)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n problems = input().split()\r\n if problems.count(\"1\") > 1:\r\n count += 1\r\nprint(count)\r\n", "num = 0\r\nfor i in range(int(input())):\r\n a = [i for i in input().split() if i == \"1\"]\r\n if len(a) > 1:\r\n num += 1\r\nprint(num)\r\n", "wynik = 0\r\nliczba = int(input())\r\nfor i in range(liczba):\r\n a,b,c = map(int, input().split())\r\n if a+b+c > 1:\r\n wynik = wynik + 1\r\n\r\nprint(wynik)", "question = int(input())\r\nx=0\r\nwhile question>0:\r\n a, b, c = map(int, input().split())\r\n\r\n if a==1 and b==1 or a==1 and c==1 or b==1 and c==1 or a==1 and b==1 and c==1:\r\n x+=1\r\n question-=1\r\nprint(x)", "n = int(input())\r\n\r\ni = 0\r\n\r\nfor _ in range(n):\r\n j = list(map(int, input().split()))\r\n if sum(j) >= 2:\r\n i += 1\r\n\r\nprint(i)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n sum=a+b+c\r\n if sum>1:\r\n s+=1\r\nprint(s)", "number = int(input())\r\n\r\nb = 0\r\n\r\nfor i in range(number):\r\n participants = input()\r\n list_p = participants.split()\r\n a = 0\r\n for inp in list_p:\r\n if inp == '1':\r\n a += 1\r\n if a >= 2:\r\n b += 1\r\n\r\nprint(b)", "n = int(input())\r\ncount = 0\r\nfor i in range(0, n):\r\n y = input()\r\n if y.count('1') >= 2:\r\n count +=1\r\nprint(count)", "a = int(input())\r\nc = 0\r\nfor i in range(a):\r\n x , y, z = map(int,input().split())\r\n \r\n if x +y +z >= 2 :\r\n c += 1\r\n \r\nprint(c)", "def count_sure_problems(n, problems):\r\n sure_count = 0\r\n\r\n for problem in problems:\r\n if problem.count(1) >= 2:\r\n sure_count += 1\r\n\r\n return sure_count\r\n\r\ndef main():\r\n n = int(input())\r\n problems = [list(map(int, input().split())) for _ in range(n)]\r\n\r\n result = count_sure_problems(n, problems)\r\n print(result)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "t = int(input())\r\nv=0\r\nfor i in range(t):\r\n A = []\r\n A = list(map(int,input().split()))\r\n a = sum(A)\r\n if a>=2:\r\n v = v+1\r\nprint(v)", "q=0\r\nfor i in range(int(input())):\r\n x=list(map(int,input().split()))\r\n su=0\r\n for v in x:\r\n su+=v\r\n if su>1:\r\n q+=1\r\nprint(q)", "n=int(input())\r\nd=[]\r\nfor i in range(n):\r\n a=str(input())\r\n b=a.split()\r\n c=b.count('1')\r\n \r\n\r\n if c>=2:\r\n d.append(c)\r\n \r\nprint(len(d))\r\n ", "n=int(input())\r\nsum1=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n if sum(l)>1:\r\n sum1+=1\r\nprint(sum1)", "n = int(input())\r\ncnt = 0\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n if a+b+c>=2:\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\ncount = 0\nfor _ in range(n):\n if sum(map(int, input().split())) >= 2:\n count += 1\nprint(count)\n", "n = int(input())\r\nscore = 0\r\n\r\nfor i in range(n):\r\n s = input()\r\n cnt_line = 0\r\n for symbol in s:\r\n if symbol == '1':\r\n cnt_line += 1\r\n if cnt_line >= 2:\r\n score += 1\r\nprint(score)\r\n", "n = int(input())\r\nv=0\r\nfor _ in range(n):\r\n w = list(map(int, input().split()))\r\n correct = sum(w)\r\n\r\n if correct >= 2:\r\n v = v+1\r\n else:\r\n v = v\r\nprint(v)", "ls=[]\r\nfor i in range(0, int(input())):\r\n user_input = input().split()\r\n m=0\r\n \r\n if user_input.count('1') >= 2:\r\n m+=1\r\n ls.append(m)\r\nprint(sum(ls))", "# emirhan\nsoruSayi = int(input())\ncozuluProblem = 0\nfor i in range(soruSayi):\n x = input()\n if x == \"1 1 0\" or x == \"1 0 1\" or x == \"0 1 1\" or x == \"1 1 1\":\n cozuluProblem += 1\n\nprint(cozuluProblem)\n\t\t \t\t\t \t\t\t\t\t \t \t\t\t\t \t\t \t", "n = int(input())\r\ntotal_views = []\r\nsolutions = 0\r\n\r\nfor i in range(n):\r\n views = [int(x) for x in input().split()]\r\n total_views.append(views)\r\n\r\nfor views in total_views:\r\n if sum(views) >= 2:\r\n solutions += 1\r\n\r\nprint(solutions)", "n_problems = int(input())\r\ncan_solve = 0\r\n\r\nfor num in range(n_problems):\r\n consensus = list(map(int, input().split()))\r\n \r\n if consensus.count(1) >= 2:\r\n can_solve += 1\r\n \r\nprint(can_solve)", "N = int(input())\r\n\r\nprob = 0\r\n\r\nwhile N: \r\n \r\n x, y, z = input().split()\r\n \r\n sum = int(x) + int(y) + int(z)\r\n\r\n if sum >= 2:\r\n prob += 1\r\n\r\n \r\n N -= 1\r\n \r\nprint(prob)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n b,c,d=map(int,input().split())\r\n if b==1 and c==1:\r\n s=s+1\r\n elif b==1 and d==1:\r\n s=s+1\r\n elif c==1 and d==1:\r\n s=s+1\r\nprint(s)", "count = 0\r\nfor i in range(int(input())):\r\n line = input()\r\n if line.count(\"1\") > 1:\r\n count+=1\r\nprint(count)\r\n ", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n s = list(map(int, input().split()))\r\n if sum(s) >= 2:\r\n k += 1\r\nprint(k)", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n p,v,t = map(int,input().split())\r\n if p+v+t >= 2:\r\n cnt+=1\r\n \r\nprint(cnt)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n mlist = list(map(int, input().split()))\r\n if sum(mlist) > 1:\r\n count += 1\r\n else:\r\n continue\r\nprint(count)\r\n", "l = []\r\nfor _ in range(int(input())):\r\n l.append(input().split())\r\nans = 0\r\nfor i in l:\r\n if i.count('1') > 1:\r\n ans += 1\r\nprint(ans)\r\n", "n=int(input())\nk=0\nfor _ in range(n):\n m=sum(map(int,input().split()))\n if m>=2:\n k+=1\nprint(k)", "n = int(input())\r\nres = 0\r\n\r\nfor _ in range(n):\r\n entrada = sum([int(i) for i in input().split()])\r\n if entrada >= 2:\r\n res +=1\r\n\r\nprint(res)", "n = int(input())\r\nl = list()\r\nk = list()\r\nfor i in range(n):\r\n c = input()\r\n k = c.split()\r\n l.append(k)\r\nfor i in l:\r\n for j in range(3):\r\n if '0' in i:\r\n i.remove('0')\r\n\r\ns = 0\r\nfor i in l:\r\n if len(i) >= 2:\r\n s += 1\r\nprint(s)\r\n", "n= int(input())\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n if (a == 1 and b == 1 and c == 1) or (a == 0 and b == 1 and c == 1) or (a == 1 and b == 1 and c == 0) or (a == 1 and b == 0 and c == 1):\r\n cnt += 1\r\n\r\nprint(cnt)\r\n", "line = int(input())\r\ncorrect = 0\r\nfor i in range(line):\r\n ans = input()\r\n num = 0\r\n for v in ans:\r\n if v == '1':\r\n num += 1\r\n if num > 1:\r\n correct += 1\r\nprint(correct)", "n=int(input(\"\"))\r\ns=list(())\r\nk=x=0\r\nfor i in range(n):\r\n j=input(\"\").split()\r\n s.append(j)\r\nfor i in range(n):\r\n for j in range(3):\r\n if int(s[i][j])==1:\r\n k=k+1\r\n if(k>=2):\r\n x=x+1\r\n k=0\r\nprint(x)", "#Team\r\n\r\nn = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n views = list(map(int,input().split()))\r\n if sum(views) >=2:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n values = input().split()\r\n if len(values) != 3:\r\n print(\"Please enter exactly three values.\")\r\n continue\r\n \r\n a, b, c = map(int, values)\r\n \r\n if (a + b + c >= 2 ) :\r\n ans +=1\r\n\r\nprint(ans)", "n = int(input())\r\nk=0\r\nfor i in range(n):\r\n lst = list(map(int,input().split() ) )\r\n if sum(lst)>=2:\r\n k+=1\r\nprint(k)", "n=int(input())\nsolve=0\nfor i in range(n):\n p,v,t=map(int,input().split())\n c=0\n if(p==1):\n c += 1\n if(v==1):\n c += 1\n if(t==1):\n c += 1\n if(c>=2):\n solve += 1\nprint(solve)\n\n\t \t\t \t\t\t \t \t \t\t \t \t \t\t", "n=int(input())\r\nk=0\r\nfor i in range(n):\r\n q=list(map(int,input().split()))\r\n if sum(q)>1:\r\n k+=1\r\nprint(k)\r\n ", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n l=list(map(lambda x : int(x),input().split(\" \")))\r\n if (l[0]==1 and l[1]==l[0]) or (l[1]==1 and l[1]==l[2]) or (l[2]==1 and l[2]==l[0]): count+=1\r\n \r\nprint(count)", "# a=0 correct but no good\r\n# for i in range(int(input())):\r\n# \tl=list(map(int,input().split()))\r\n# \tif l.count(1)>l.count(0):\r\n# \t\ta+=1\r\n# print(a)\r\n\r\nprint(sum(1 for i in range(int(input())) if input().count('1')>1))\r\n", "'''\nhttps://codeforces.com/problemset/problem/231/A\n\nA. Team\n'''\n\ndef main():\n size = int(input())\n count = 0\n for _ in range(size):\n d = list(map(int, input().split(' ')))\n if sum(d) >= 2:\n count += 1\n\n print(count)\n\nif __name__ == '__main__':\n main()\n", "n = int(input())\r\nk = 0\r\nfor _ in range(n):\r\n i = [int(x) for x in input().split()]\r\n a = sum(i)\r\n if a > 1:\r\n k += 1\r\nprint(k)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n A=input().split()\r\n c=int(A[0])+int(A[1])+int(A[2])\r\n if (c>=2):\r\n count+=1\r\nprint(count)\r\n\r\n", "cnt=0\r\nn=int(input())\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n s=sum(l)\r\n if(s>=2):\r\n cnt+=1\r\nprint(cnt)", "def number_of_problems(bool1, bool2, bool3):\r\n counter = 0\r\n bool_lst = [int(bool1), int(bool2), int(bool3)]\r\n one_count = bool_lst.count(1)\r\n if one_count > 1:\r\n return 1\r\n return 0\r\n\r\nnumber_of_probs = input()\r\ncounter = 0\r\nfor _ in range(int(number_of_probs)):\r\n petya_vasya_tonya = input()\r\n bools = petya_vasya_tonya.split()\r\n counter += number_of_problems(bools[0], bools[1], bools[2])\r\n\r\nprint(counter)", "a = int(input())\r\nl = 0\r\nfor i in range(a):\r\n b = input().split(\" \")\r\n if b.count(\"1\") >= 2:\r\n l+=1\r\nprint(l)", "c = int(input())\r\n\r\nnumber = 0 \r\n\r\nfor i in range(c):\r\n friends = input().split()\r\n if friends.count(\"1\") >= 2:\r\n number += 1 \r\n\r\n\r\nprint(number)\r\n\r\n", "n = int(input())\r\nanser = 0\r\nfor i in range(n):\r\n a = [int(k) for k in input().split()]\r\n x = 0\r\n for l in a:\r\n if l == 1:\r\n x += 1\r\n if x >= 2:\r\n anser += 1\r\nprint(anser)", "i = int(input())\r\nc = 0\r\nfor _ in range(i):\r\n m, n, l = map(int, input().split())\r\n if (m == 1 and n == 1) or (l == 1 and n == 1) or (m == 1 and l == 1):\r\n c += 1\r\nprint(c)", "lines = open(0).readlines()[1:]\r\ncount = sum(a.count('1') > 1 for a in lines)\r\nprint(count)\r\n", "a=int(input())\r\nsum=0\r\nfor i in range(0,a):\r\n d,b,c=map(int,input().split())\r\n if b==1 and d==1 or b==1 and c==1 or d==1 and c==1:\r\n sum=sum+1\r\nprint(sum)\r\n", "n= int(input ())\r\ntotal =0\r\nfor i in range (n):\r\n surity=input().split(\" \")\r\n data=sum([int(i) for i in surity])\r\n if data>1:\r\n total+=1\r\nprint(total)", "number = int(input())\r\nsolution = 0\r\nfor x in range(0, number):\r\n line = input()\r\n if line.count('1') >= 2:\r\n solution += 1\r\n \r\nprint(solution)\r\n\r\n\r\n", "#31.10.2023AD codeforces\n\nn = int(input())\narr = []\ncount = 0\n\nfor i in range(n):\n s = input().split()\n arr.append(s)\nfor i in range(n):\n if arr[i].count('1') >= 2:\n count +=1\n\nprint(count)", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n counter=0\r\n \r\n a,b,c=map(int,input().split())\r\n if a==1:\r\n counter+=1\r\n if b==1:\r\n counter+=1\r\n if c==1:\r\n counter+=1\r\n if counter>1:\r\n d+=1\r\nprint(d)\r\n", "def check(lst):\n if sum(lst)>1:\n return True\n else:\n return False\n\ni=int(input())\nc=0\nfor i in range(i):\n lst=list(map(int,input().split()))[:3]\n if check(lst):\n c+=1\n\nprint(c)\n \t \t \t \t \t\t \t \t\t\t\t \t\t \t\t\t", "num_problemas = int(input())\r\nproblemastotal = []\r\n\r\nfor i in range(num_problemas):\r\n certeza = input()\r\n problemastotal.append(certeza)\r\n\r\nn = 0\r\nfor certeza in problemastotal:\r\n if certeza == \"0 1 1\" or certeza == \"1 0 1\" or certeza == \"1 1 0\" or certeza == \"1 1 1\":\r\n n += 1\r\n\r\nprint(n)\r\n", "a = [list(map(int, input().split())) for i in range(int(input()))]\r\nprint(sum([1 for i in a if sum(i)>=2]))\r\n", "a=0;\r\nfor i in range(int(input())):a+=input().count('1')>1\r\nprint(a);", "k = int(input())\r\nimplement = 0\r\nwhile(k > 0):\r\n L = list(map(int, input().split()))\r\n if L.count(1) >= 2:\r\n implement += 1\r\n k -= 1\r\nprint(implement)", "l=int(input())\r\nj=0\r\nfor i in range(l):\r\n w=input()\r\n w.split()\r\n if w.count(str(1))>1:\r\n j+=1\r\nprint(j)", "n = int(input())\ntotal = 0\n\nfor i in range(0, n):\n p, v, t = [ int(i) for i in input().split()]\n if p and v or v and t or p and t:\n total += 1\n\nprint(total)\n", "n=int(input())\nflag=0\nfor i in range(n):\n a,b,c=list(map(int,input().split()))\n if a+b+c>1:\n flag+=1\nprint(flag)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 23 17:54:23 2023\r\n\r\n@author: 袁兆瑞\r\n\"\"\"\r\n\r\nn = int(input()) # 输入问题的数量\r\n\r\ncount = 0 # 统计编写解决方案的问题数量\r\n\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split()) # 输入每个问题对应的三个整数\r\n\r\n # 统计至少有两个1的问题数量\r\n if p + v + t >= 2:\r\n count += 1\r\n\r\nprint(count) # 输出结果\r\n", "problems= int(input())\ncount=0\nfor i in range(problems):\n x, y, z= map(int, input().split())\n if x+y+z>1:\n count+=1\nprint(count)", "def total(liste):\r\n res=0\r\n for i in range(n):\r\n x=test(liste[i])\r\n res=res+x\r\n return(res)\r\n\r\ndef test(liste):\r\n res=0\r\n for i in range(3):\r\n if liste[i]=='1':\r\n res=res+1\r\n if res<2:\r\n return 0\r\n else :\r\n return 1\r\n\r\nn=int(input())\r\nlst=[]\r\nfor i in range(n):\r\n x=(input())\r\n x=x.split()\r\n lst.append(x)\r\nprint(total(lst))", "number = int(input())\r\n\r\nanswers = []\r\nsolver_ex = 0\r\n\r\nfor index in range(number):\r\n answers = p, v, t = [int(ans) for ans in input().split()]\r\n\r\n n_ones = 0\r\n for n in answers:\r\n if n == 1:\r\n n_ones +=1\r\n if n_ones >=2:\r\n solver_ex+=1 \r\n\r\nprint(solver_ex)\r\n", "cnt = 0\r\nfor _ in range(int(input())):\r\n s = [int(i) for i in input().split()]\r\n if sum(s) >= 2:\r\n cnt += 1\r\nprint(cnt)\r\n \r\n ", "t = int(input())\r\nk = 0\r\nwhile t > 0:\r\n t -= 1\r\n a, b, c = map(int, input().split())\r\n if a + b + c >= 2:\r\n k += 1\r\nprint(k)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n total = 0\r\n sure = input()\r\n sure = sure.split(\" \")\r\n for j in sure:\r\n total += int(j)\r\n if total >= 2:\r\n count += 1\r\n\r\nprint(count)", "# Read the integer n\r\nn = int(input())\r\n\r\n# Initialize an empty list to store the words\r\n\r\ncount =0\r\n# Read the n words and add them to the list\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split())\r\n if p + v + t >= 2:\r\n count += 1\r\nprint(count)\r\n\r\n ", "import sys\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\n\r\ndef main():\r\n count = 0\r\n testcases = int(input())\r\n for _ in range(testcases):\r\n array = intl()\r\n ##################################################\r\n if sum(array) >= 2:\r\n count += 1\r\n ##################################################\r\n print(count)\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()", "print(sum(i.count('1') > 1for i in[*open(0)][1:]))", "n = int(input()) # Input the number of problems\n\nproblems_solved = 0 # Initialize the count of problems they will solve\n\nfor _ in range(n):\n petya, vasya, tonya = map(int, input().split()) # Input the friends' opinions\n \n # Check if at least two of them are sure about the solution\n if petya + vasya + tonya >= 2:\n problems_solved += 1\n\nprint(problems_solved) # Output the number of problems they will solve\n\n \t \t\t \t \t\t\t \t \t \t\t \t\t\t", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n a,b,c=map(str,input().split())\r\n s=a+b+c\r\n if s.count(\"1\")>=2:\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\nc=0\r\nl=[]\r\nfor i in range(n):\r\n a=input().split()\r\n for i in range(len(a)):\r\n l.append(a[i])\r\n for i in l:\r\n if l.count('1') >=2:\r\n c+=1 \r\n l=[]\r\nprint(c)\r\n", "n = int(input())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n P, V, T = map(int, input().split())\r\n if P + V + T >= 2:\r\n count += 1\r\n\r\nprint(count)\n# Sun Oct 15 2023 17:42:24 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\na = [ list(map(int,input().split())) for i in range(n) ]\r\ns = 0\r\nfor i in a:\r\n if(sum(i)>=2):\r\n s+=1\r\nprint(s)", "#Team by Uriel Orteu with Aleix watching him write this code\r\n\r\nnum_of_problems = input(\"\")\r\nsolved = 0\r\nfor n in range(0, int(num_of_problems)):\r\n problem = input()\r\n if \"1 1\" in problem or \"1 0 1\" in problem:\r\n solved += 1\r\n\r\nprint(solved)", "numPrblms = int(input())\r\nnumSolved = 0\r\nfor i in range(0, numPrblms):\r\n strList = input().split(\" \")\r\n intList = [int(i) for i in strList]\r\n if sum(intList) >= 2:\r\n numSolved += 1\r\n\r\nprint(numSolved)\r\n ", "x = 0\r\nfor i in range(int(input())):\r\n a,b,c = map(int, input().split())\r\n if (a+b+c) >= 2:\r\n x += 1\r\nprint(x)", "t = int(input())\r\nres = 0\r\nfor i in range(t):\r\n s = 0\r\n n1, n2, n3 = map(int, input().split())\r\n s = n1 + n2 + n3\r\n if s >= 2:\r\n res += 1 \r\nprint(res)\r\n \r\n \r\n ", "n = int(input())\r\na=0\r\n\r\nfor i in range(n):\r\n x,b,T = map(int,input().split())\r\n if(x+b+T) >= 2:\r\n a+=1\r\nprint(a)\r\n\r\n\r\n ", "m = []\r\nout = 0.\r\nfor i in range(0, int(input())):\r\n j = input().split()\r\n if j.count('1') >=2:\r\n m.append(1)\r\n \r\nprint(sum(m))", "n = int(input())\r\nyes = 0\r\nfor i in range(0,n):\r\n a,b,c = input().split()\r\n if a==\"0\" and b==\"0\":\r\n continue\r\n if b==\"0\" and c==\"0\":\r\n continue\r\n if a==\"0\" and c==\"0\":\r\n continue\r\n else:\r\n yes+=1\r\nprint(yes)", "# Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of problems they will implement\r\ncount = 0\r\n\r\n# Loop through each problem\r\nfor i in range(n):\r\n # Read the three integers representing Petya, Vasya, and Tonya's views\r\n p, v, t = map(int, input().split())\r\n \r\n # Check if at least two of them are sure about the solution (sum of p, v, t is >= 2)\r\n if p + v + t >= 2:\r\n count += 1\r\n\r\n# Print the number of problems they will implement\r\nprint(count)", "x = int(input())\r\nk = 0\r\nfor y in range(0,x):\r\n a,b,c = input().split()\r\n a = int(a)\r\n b = int(b)\r\n c = int(c)\r\n if a + b + c >= 2:\r\n k += 1\r\n\r\nprint(k)\r\n\r\n\r\n\r\n", "# Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize the count of implemented problems\r\nimplemented_count = 0\r\n\r\n# Iterate over each problem\r\nfor _ in range(n):\r\n # Read the friends' opinions for the problem\r\n petya, vasya, tonya = map(int, input().split())\r\n\r\n # Count the number of friends who are sure about the solution\r\n sure_count = petya + vasya + tonya\r\n\r\n # Check if at least two friends are sure\r\n if sure_count >= 2:\r\n implemented_count += 1\r\n\r\n# Print the number of implemented problems\r\nprint(implemented_count)", "n = int(input())\r\ncount_2 = 0\r\nif n>=1 and n<=1000:\r\n for i in range(n):\r\n count = 0\r\n zadacha = input().split()\r\n if len(zadacha) != 3:\r\n exit()\r\n for j in zadacha:\r\n if j =='1':\r\n count +=1\r\n if count == 2:\r\n count_2 += 1\r\nprint(count_2)", "cnt = 0\r\nfor _ in range(int(input())):\r\n cnt += 1 if input().split().count('1') >= 2 else 0\r\nprint(cnt)", "n = int(input())\r\nproblems_solved = 0\r\n\r\nfor _ in range(n):\r\n views = list(map(int, input().split()))\r\n if sum(views) >= 2:\r\n problems_solved += 1\r\n\r\nprint(problems_solved)\r\n", "n = int(input())\nacum = 0\n\nfor _ in range(n):\n\n # Ingresa una línea de enteros y la divide en una lista de números\n linea = input().split()\n\n # Convierte los elementos de la lista a números enteros\n a, b, c = map(int, linea)\n\n suma = a + b + c\n\n if suma >= 2:\n acum += 1\n\nprint(acum)\n", "numq=int(input())\r\na=0\r\nfor i in range(0, numq):\r\n c=input()\r\n b=c.count(\"1\")\r\n if b>=2:\r\n a=a+1\r\n else: continue\r\nprint(a)", "k = int(input())\r\nn = 0\r\ns = []\r\nfor i in range(k):\r\n s = map(int,input().split())\r\n if sum(s) >= 2:\r\n n+=1\r\nprint(n)\r\n", "loop = int(input())\r\ncounter = 0\r\nfor i in range(loop):\r\n n = input().split()\r\n if n.count('1')>=2:\r\n counter+=1\r\n\r\nprint(counter) ", "n = int(input())\ncnt = 0\nfor _ in range(n):\n a, b, c = map(int, input().split())\n s = f'{a} {b} {c}'\n if s.count('1') >= 2:\n cnt += 1\n\nprint(cnt)", "# aantal_problemen = int(input(\"Geef het aantal problemen\\n\"))\r\naantal_problemen = int(input(\"\"))\r\n#lees per probleem de zekerheid van ieder persoon Petya, Vasya, Tonya\r\naantal_implementaties = 0\r\nminimum_solutions = 2\r\n\r\nfor _ in range(aantal_problemen):\r\n antwoord = list(input(\"\"))\r\n zekerheden = [element for element in antwoord if element =='1']\r\n \r\n# print(zekerheden)\r\n if len(zekerheden) >= 2:\r\n aantal_implementaties += 1\r\n \r\nprint(aantal_implementaties)\r\n\r\n# for probleem in probleem_lijst:\r\n# zekerheid[probleem] = input(\"Geef de zekerheden van Petya, Vasya, Tonya\\n\")\r\n# list(zekerheid)\r\n ", "# Input\r\nn = int(input())\r\nproblems = []\r\n\r\n# Read input and store it in a list\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split())\r\n problems.append((p, v, t))\r\n\r\n# Count the number of problems with at least 2 friends sure about the solution\r\ncount = 0\r\nfor problem in problems:\r\n if problem.count(1) >= 2:\r\n count += 1\r\n\r\n# Output the result\r\nprint(count)\r\n", "l = []\r\nm = 0\r\nfor i in range(0, int(input())):\r\n j = list(map(str,input().split()))\r\n\r\n\r\n if j.count('1') >= 2:\r\n m += 1\r\n\r\nprint(m)", "while True:\n try:\n n = int(input())\n s = 0\n\n for _ in range(n):\n ans = 0\n a = list(map(int, input().split()))\n\n for i in range(3):\n if a[i] == 1:\n ans += 1\n\n if ans >= 2:\n s += 1\n\n print(s)\n\n except EOFError:\n break\n\n \t \t \t\t\t\t \t \t \t \t \t \t \t", "x = int(input(\"\"))\r\nl = []\r\nfor i in range (0,x):\r\n l.append(input(\"\"))\r\nattempts = 0\r\nfor str in l:\r\n count = 0\r\n \r\n for s in str:\r\n if ord(s) == 49:\r\n count = count + 1\r\n if count >= 2:\r\n attempts = attempts + 1\r\nprint(attempts)", "n = int(input())\r\ne=0\r\nfor i in range(n):\r\n a = input()\r\n b = int(a[0])\r\n c = int(a[2])\r\n d = int(a[4])\r\n if b + c + d >= 2:\r\n e = e + 1\r\nprint(e)\r\n\r\n", "n=int(input())\r\nprob_solved=0\r\nfor i in range(n):\r\n string=input()\r\n occ=0\r\n for i in range(len(string)):\r\n if (string[i]==\"1\"):\r\n occ=occ+1\r\n if (occ>=2):\r\n prob_solved=prob_solved+1\r\nprint(prob_solved)\r\n\r\n\r\n ", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n A = list(map(int,input().split()))\r\n if A.count(1) >= 2:\r\n ans += 1\r\nprint(ans)", "def solve(numList):\r\n return (True if numList.count(1)>1 else False)\r\nt = int(input())\r\ncount =0\r\nfor term in range(t):\r\n numList = list(map(int, input().split()))\r\n if(solve(numList)):\r\n count+=1\r\nprint(count)", "n=int(input())\r\ncon=[input().split(\" \") for i in range(1,n+1,1)]\r\ncount=0\r\nfor j in range(0,n,1):\r\n c=con[j].count(\"1\")\r\n if c >=2:\r\n count+=1\r\nprint(count)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n permit = list(map(int, input().split()))\r\n if permit.count(1) >= 2:\r\n count += 1\r\nprint(count)", "a = int(input())\r\nc = 0\r\nfor i in range(a):\r\n op = input()\r\n x, y, z = op.split(' ')\r\n sum = int(x)+int(y)+int(z)\r\n if sum>=2:\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\r\ncnt = 0\r\nfor x in range(n):\r\n num = input()\r\n if num.count('1') > 1:\r\n cnt += 1\r\nprint(cnt)", "n=int(input())\r\n\r\ncount=0\r\n\r\nfor _ in range(n):\r\n \r\n a,b,c=map(int,input().split())\r\n \r\n tcount=a+b+c\r\n \r\n if tcount>=2:\r\n count+=1\r\n \r\nprint(count)", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if a==1 and b==1 and c==0 :\r\n s+=1\r\n elif a==1 and c==1 and b==1:\r\n s+=1\r\n elif a==1 and c==1 and b==0:\r\n s+=1\r\n elif b==1 and c==1 and a==0:\r\n s+=1\r\nprint(s)", "x = input()\nx = int(x)\nt = 0\nfor i in range(x):\n a,b,c = input().split()\n a = int(a)\n b = int(b)\n c = int(c)\n if (a + b + c) >= 2:\n t += 1\nprint(t)\n\t\t\t \t \t\t\t\t\t\t\t \t \t \t", "n = int(input())\r\ntotal = 0\r\nfor _ in range(n):\r\n total += 1 if sum([int(i) for i in input().split()]) >= 2 else 0\r\nprint(total)\r\n ", "tedad = int(input())\r\njavab = 0\r\nfor dafe in range(tedad):\r\n x = 0\r\n nazarat = input()\r\n for item in nazarat.split(' '):\r\n x = x+ int(item)\r\n if x > 1:\r\n javab = javab +1\r\nprint(javab)", "n=int(input())\r\nnb=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n if l.count(1)>=2:\r\n nb+=1\r\nprint(nb)", "def func(k):\r\n global num\r\n count=0\r\n for i in k:\r\n if(i=='1'):\r\n count+=1\r\n if(count>=2):\r\n num+=1\r\nn=int(input())\r\nnum=0\r\nfor i in range(n):\r\n k=input().split()\r\n func(k)\r\nprint(num)\r\n", "nb_problems = int(input())\r\ntotal = 0\r\nfor i in range(nb_problems):\r\n the_sum = sum(list(map(int,input().split())))\r\n if the_sum>=2:\r\n total+=1\r\nprint(total)\r\n \r\n ", "Rounds = int(input())\r\nSum = 0;\r\n\r\nfor x in range(Rounds):\r\n Number = str(input())\r\n Result = 0;\r\n a = Number.split()\r\n for x in a:\r\n if x == \"1\":\r\n Result = Result + 1\r\n if Result > 1:\r\n Sum = Sum + 1\r\n \r\nprint(Sum)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n x,y,z = list(map(int,input().split()))\r\n if x + y + z > 1:\r\n count += 1\r\nprint(count)", "number_of_problems = int(input(\"\"))\r\ncounter = 0\r\nfor i in range(number_of_problems):\r\n solution_array = input(\"\").split(\" \")\r\n for i in range(len(solution_array)):\r\n solution_array[i] = int(solution_array[i])\r\n if sum(solution_array) >= 2:\r\n counter +=1\r\nprint(counter)", "n = int(input())\r\nresult = 0\r\nfor _ in range(n):\r\n temp = [int(i) for i in input().split()]\r\n if sum(temp) >= 2:\r\n result += 1\r\nprint(result)\r\n", "noOfQues=int(input(\"\"))\r\n\r\nimplemented=0\r\nwhile(noOfQues!=0):\r\n total=0\r\n decisions=list(map(int,input(\"\").strip().split()))[:3]\r\n for i in decisions:\r\n total+=i\r\n if total>=2:\r\n implemented+=1\r\n noOfQues-=1\r\nprint(implemented)", "z = input()\nz = int(z)\nx = 0 \nfor i in range (z) :\n c , v , b = input() .split()\n c = int(c)\n v = int(v)\n b = int(b)\n if (c + v + b) >= 2 :\n x += 1\nprint(x)\n \t \t \t\t \t\t \t\t\t \t\t \t \t \t\t \t\t\t\t", "a = int(input())\ntemp = 0\n\nfor _ in range(a):\n input_string = input()\n numbers = list(map(int, input_string.split()))\n count = numbers.count(1)\n if count>1:\n temp+=1\n\nprint(temp)", "# -*- coding: utf-8 -*-\n\"\"\"A. Team.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1OT-tI46SSJgCKXvyR-eEXiR0Jz2MpnpQ\n\"\"\"\n\nrounds = int(input())\nsure_answers = 0\n\nfor i in range(rounds):\n\n petya, vasya, tonya = [int(f) for f in input().split()]\n\n sum_answers = petya + vasya + tonya\n\n if sum_answers >= 2:\n sure_answers +=1\n\nprint(sure_answers)", "t = int(input())\nc = 0\n\nwhile(t > 0):\n t-=1\n a = input().split()\n if a.count('1') >= 2:\n c+=1\n else:\n pass\nprint(c)\n \n", "n = int(input())\r\nnp = 0\r\nfor i in range(n):\r\n l = input()\r\n count = 0\r\n for i in range(0,5,2):\r\n if l[i] == '1':\r\n count+=1\r\n if count >=2 :\r\n np+=1\r\nprint(np)", "n = int(input())\r\ns = 0\r\nfor i in range(n):\r\n w=str(input())\r\n c = w.count('1')\r\n \r\n if(c > 1):\r\n s = s + 1\r\n \r\nprint(s)", "tasks = int(input())\r\n\r\nresult = 0\r\nfor _ in range(tasks):\r\n opinions = input()\r\n if opinions.count('1') > 1:\r\n result += 1\r\nprint(result)", "n = int(input())\r\nm = 0\r\nfor _ in range(n):\r\n a, b, c = map(int, input().split())\r\n if a+b+c>=2:\r\n m += 1\r\nprint(m)", "n = int(input())\r\ncount = 0\r\nflag = 0\r\nfor i in range(n):\r\n x = input()\r\n l = x.split(\" \")\r\n for i in l:\r\n if int(i) == 1:\r\n count += 1\r\n \r\n if count >= 2:\r\n flag += 1\r\n count = 0\r\n\r\nprint(flag)\r\n\r\n", "n = int(input())\r\n\r\ncounter = 0\r\n\r\nfor i in range(n):\r\n answers = list(map(int, input().split()))\r\n a = sum(answers)\r\n if a >= 2:\r\n counter+=1\r\n\r\nprint(counter)", "MIN_ZEKEREN = 2 \r\n\r\naantal_problemen = int(input())\r\nzekerheden = list()\r\n\r\nfor i in range (aantal_problemen) :\r\n zekerheden.append(input().split(\" \"))\r\n\r\nop_te_lossen = 0\r\n\r\nfor zekerheid_item in zekerheden :\r\n zekerheid = int(zekerheid_item[0]) + int(zekerheid_item[1]) + int(zekerheid_item[2])\r\n if (zekerheid >= MIN_ZEKEREN) :\r\n op_te_lossen += 1\r\n\r\nprint(op_te_lossen)", "print(sum(input().count('1')>1 for x in range (int(input()))))", "a =0\r\nfor i in range(int(input())):\r\n s = input()\r\n if(s.count('1')>1):\r\n a+=1\r\nprint(a)\r\n", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n lst = list(map(int,input().split()))\r\n count = 0\r\n for i in lst:\r\n if i:\r\n count += 1\r\n if count >= 2:\r\n ans += 1\r\nprint(ans)", "n = int(input ())\r\n\r\nn_problems = 0\r\n\r\nwhile n > 0:\r\n problem = input()\r\n if problem.count(str(1)) > 1:\r\n n_problems += 1\r\n n -= 1\r\n\r\nprint (n_problems)", "def possibletosolve():\r\n t=int(input())\r\n counter=0\r\n for i in range(t):\r\n a=list(map(int, input().split()))\r\n c=a.count(1)\r\n if c>=2:\r\n counter+=1\r\n print(counter)\r\npossibletosolve()", "n = int(input())\na = []\nans = 0\nfor i in range(n):\n a.append(list(map(int, input().split())))\nfor i in range(n):\n if sum(a[i]) >= 2:\n ans += 1\nprint(ans)\n ", "x = int(input())\r\nc = 0\r\nfor i in range(x):\r\n y = input()\r\n if y.count('1')>=2:\r\n c = c+1\r\nprint(c)\r\n\r\n\r\n", "n = int(input())\ncount = 0\nfor i in range(n):\n l = list(input())\n l = filter(lambda x: x == '1', l)\n if len(list(l)) >= 2:\n count += 1\nprint(count)\n ", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n #inp=int(input())\r\n a,b,c=map(int,input().split())\r\n if((a==1 and b==1) or (b==1 and c==1) or (a==1 and c==1)):\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n k=list(map(int,input().split()))\r\n l=k.count(1)\r\n if l>=2:\r\n c+=1\r\nprint(c)", "a=int(input())\r\ns=0\r\nfor i in range(a):\r\n ch=str(input())\r\n if(ch.count('1')>=2):\r\n s=s+1\r\nprint(s)\r\n \r\n ", "def team():\n t=int(input())\n count=0\n for i in range(t):\n a,b,c=map(int,input().split())\n if(a==1 and b==1)or(a==1 and c==1)or(b==1 and c==1):\n count=count+1\n print(count)\nteam()\n \t \t \t\t\t\t \t \t \t\t \t\t \t\t \t\t \t\t", "a = int(input())\r\nnop = 0\r\nfor i in range(a):\r\n l = input().split()\r\n l1 = []\r\n for j in l:\r\n l1 += [int(j)]\r\n c = l1.count(1)\r\n if c >1:\r\n nop += 1\r\nprint(nop)", "t=int(input())\ncount=0\nfor i in range(t):\n a,b,c=map(int,input().split())\n d=a+b+c\n if(d>=2):\n count+=1\nprint(count)\n \n \t \t \t \t\t\t\t\t\t\t\t\t\t \t \t\t \t", "j = []\r\nm = 0\r\n\r\nfor i in range (int(input())):\r\n j = input().split(\" \")\r\n if j.count(\"1\") > 1:\r\n m += 1\r\nprint (m)\r\n", "n = int(input())\r\ns=0\r\nfor i in range(n):\r\n a,b,c = [int(x) for x in input().split()]\r\n if a+b+c>1:\r\n s+=1;\r\nprint(s)", "n = int(input())\ni=1\nscore = 0\nsolved = 0\n\nwhile i <= n:\n view = list(map(int, input().split()))\n score = sum(view)\n if score >= 2: \n solved = solved + 1\n i += 1\n\nprint(solved)", "t=int(input())\r\nA=[]\r\ns=0\r\nfor i in range(t):\r\n A=list(map(int,input().split()))\r\n if(A.count(1)>=2):\r\n s=s+1\r\nprint(s)", "\r\nn = int(input())\r\n\r\ninputs = []\r\n\r\nfor x in range(0,n):\r\n inputs.append([int(x) for x in input().strip().split(' ')])\r\n\r\nvalue = 0\r\n\r\nfor i in inputs:\r\n if sum(i) > 1: value+=1\r\n\r\nprint(value)\r\n\r\n", "n=int(input())\r\n\r\nprobelms_solved = 0 \r\n\r\nfor i in range(n):\r\n Petya ,Vasya ,Tonya = map(int,input().split())\r\n if Petya + Vasya + Tonya >= 2: \r\n probelms_solved += 1 \r\n\r\nprint(probelms_solved)", "number_of_problems = int(input())\nimplemented_problems = 0\nfor i in range(number_of_problems):\n line = input()\n line = line.split(' ')\n for j in range(len(line)):\n line[j] = int(line[j])\n sureness = sum(line)\n if sureness >= 2:\n implemented_problems += 1\nprint(implemented_problems)", "# Description of problem found at http://codeforces.com/problemset/problem/231/A\r\n# I decided to try and make this program as flexible as problem.\r\n# This removes simplicity, but increases my skill, which is why I'm here\r\n\r\n\r\ndef main():\r\n num_programs = int(input())\r\n \r\n solvable_programs = 0\r\n \r\n for _ in range(num_programs):\r\n tally = 0\r\n \r\n friend_answers = list(map(int, input().split()))\r\n \r\n for i in range(len(friend_answers)):\r\n if friend_answers[i] == 1:\r\n tally += 1\r\n \r\n if(tally > len(friend_answers) // 2):\r\n solvable_programs += 1\r\n \r\n print(solvable_programs)\r\n \r\n \r\nif __name__ == \"__main__\":\r\n main()", "from collections import Counter\r\nsums = 0\r\nfor _ in range(int(input())):\r\n count = Counter(list(map(int,input().split())))\r\n if count[1] >= 2:\r\n sums += 1\r\nprint(sums)", "n = int(input())\ncnt = 0\nfor i in range(n):\n p, v, t= map(int,input().split())\n if p and v== 1 or v and t == 1 or p and t == 1:\n cnt += 1\nprint(cnt)\n \t\t\t \t\t\t \t \t \t \t \t", "count = 0\r\nfor i in range(int(input())):\r\n s = [i for i in input().split()]\r\n if s.count('1') > 1:\r\n count += 1\r\nprint(count)", "n = int(input())\r\ncounter = 0\r\nfor i in range (0,n):\r\n p= (input())\r\n if p.count(\"1\")>=2:\r\n counter+=1\r\n i+=1\r\nprint(counter)\r\n ", "x=int(input())\r\nsum=0\r\nfor i in range(x):\r\n y=input().split(\" \")\r\n if y.count(\"1\")>=2:\r\n sum+=1\r\nprint(sum)", "b = int(input())\r\nabs = 0\r\n\r\nfor _ in range(b):\r\n n, m, a, = map(int, input().split())\r\n if ((n == 1 and m ==1) or (n == 1 and a == 1) or (m == 1 and a == 1)):\r\n abs += 1\r\n\r\nprint(abs)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n v=list(map(int,input().split()))\r\n n= sum(v)\r\n if n >= 2:\r\n count+=1\r\nprint(count)", "def solve(n,s,cnt):\r\n v=[]\r\n for i in s:\r\n v.append(i)\r\n if v.count(\"1\")>1:\r\n cnt+=1\r\n return cnt\r\n \r\n \r\nn=int(input())\r\ncnt1=0\r\ncnt=0\r\nfor i in range(n):\r\n s=input()\r\n if solve(n,s,cnt)!=0:\r\n cnt1+=1\r\nprint(cnt1)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a,b,c = map(int, input().split())\r\n if a+b+c >= 2:\r\n count +=1\r\n\r\nprint(count)", "iterations = int(input(\"\"))\r\ns = 0\r\n\r\nwhile iterations > 0:\r\n P,V,T = map(int,input().split())\r\n iterations -= 1 \r\n sum = P + V + T\r\n\r\n if sum >= 2:\r\n s+= 1 \r\n\r\nprint(s)", "t = int(input())\r\nans = 0\r\nfor x in range(1, t+1):\r\n u = list(map(int, input().split()))\r\n\r\n sum = u[0]+u[1]+u[2] \r\n if sum >= 2 :\r\n ans = ans+1\r\n\r\nprint(ans)\r\n", "n=int(input())\r\ns=0\r\nfor i in range(n):\r\n my_list=list(map(int,input().split()))\r\n if my_list.count(1)>=2:\r\n s+=1\r\nprint(s)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n p,v,t = map(int,input().split())\r\n \r\n sum = p+v+t\r\n if sum>=2:\r\n count +=1\r\nprint(count)", "n = int(input())\r\n\r\nproblems = []\r\n\r\nfor p in range(n):\r\n x = input().split()\r\n temp = []\r\n for y in x:\r\n temp.append(eval(y))\r\n problems.append(temp)\r\n\r\ncount = 0\r\nfor problem in problems:\r\n if problem.count(1) >= 2:\r\n count += 1\r\n\r\nprint(count)", "count=0\r\nn=int(input())\r\nfor _ in range(n):\r\n arr=list(map(int,input().split()))\r\n if arr.count(1)>1:\r\n count+=1\r\nprint(count)", "# Read the number of tasks\r\nn = int(input())\r\n\r\n# Initialize the counter of tasks that will implement\r\ncount = 0\r\n\r\n# Read information about each problem and check how many friends are confident in its solution\r\nfor i in range(n):\r\n p, v, t = map(int, input().split())\r\n \r\n# If at least two out of three are sure, then add the task to the counter\r\n if p + v + t >= 2:\r\n count += 1\r\n\r\n# Display the number of tasks that will implement\r\nprint(count)\r\n", "n=int(input())\r\ns = 0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if a+b+c==3 or a+b+c==2:\r\n s=s+1\r\n else:\r\n s=s+0\r\n\r\nprint(s)", "ans = 0\r\n\r\nfor _ in range(int(input())):\r\n if input().count('1') >= 2:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n l = list(map(int,input().split()))\r\n if l[0] + l[1] + l[2] >= 2:\r\n ans = ans + 1\r\nprint(ans)", "if __name__ == \"__main__\":\r\n numProblems = 0\r\n Petya = 0\r\n Vasya = 0 \r\n Tonya = 0\r\n counter = 0\r\n \r\n numProblems = int(input(''))\r\n for i in range(numProblems):\r\n PVT = input('')\r\n Petya = int(PVT[0])\r\n Vasya = int(PVT[2])\r\n Tonya = int(PVT[4])\r\n if((Petya == 1 and Vasya == 1) or (Petya == 1 and Tonya == 1) or (Vasya == 1 and Tonya == 1)):\r\n counter+=1\r\n\r\n print(counter)", "a=int(input())\ncount=0\nfor i in range (a):\n x,y,z=map(int,input().split())\n if(x+y+z>=2):\n count+=1\nprint(count)\n\t \t\t\t\t\t\t\t\t \t\t \t \t\t \t\t\t \t", "w=int(input())\r\nl=0\r\nfor a in range(w):\r\n n=input('')\r\n k=[int(n[0]),int(n[2]),int(n[4])]\r\n if sum(k)>=2:\r\n l+=1\r\nprint(l)", "a=int(input())\r\np=0\r\nfor i in range (a):\r\n x=input()\r\n x=x.split()\r\n k=0\r\n for i in range(len(x)): \r\n if x[i]=='1':\r\n k+=1\r\n if k>=2:\r\n p+=1\r\nprint(p) ", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n user_input = input()\r\n a = user_input.split()\r\n sumi = 0\r\n for b in a:\r\n sumi += int(b)\r\n \r\n if sumi>1:\r\n count += 1\r\n \r\nprint(count)", "n = int(input())\r\n\r\nd = []\r\n\r\nfor i in range(n):\r\n d.append(input().split(' '))\r\n\r\nc = 0\r\nfor i in d:\r\n if i.count('1') >=2:\r\n c+=1\r\n\r\nprint(c)", "a = int(input())\r\nb = 0\r\nc = 0\r\nwhile b<a:\r\n d,e,f = map(int, input().split())\r\n if d+e+f>=2:\r\n c+=1\r\n b+=1\r\nprint(c)", "n = int(input())\r\nsum = 0\r\nfor _ in range(n):\r\n z = input()\r\n if z == '1 1 1' or z == '1 1 0' or z == '0 1 1' or z == '1 0 1':\r\n sum += 1\r\nprint(sum)\r\n", "def solution(a):\r\n if sum(a) >= 2:\r\n return True\r\n else:\r\n return False\r\n\r\nans = 0\r\nfor i in range(int(input())):\r\n if solution(map(int, input().split())):\r\n ans += 1\r\n\r\nprint(ans)\r\n", "flag=0\r\nfor i in range(int(input())):\r\n x=list(map(int,input().split()))\r\n c=0 \r\n for i in x:\r\n if(i==1):\r\n c=c+1\r\n if (c>1):\r\n flag=flag+1\r\n break\r\n\r\nprint(flag)", "n = int(input())\r\nd=0\r\nfor i in range(n):\r\n a,b,c=map(int, input().split())\r\n if a+b+c >= 2:\r\n d+=1\r\nprint(d)", "num_of_problems = int(input())\r\nresult = 0\r\nfor i in range(num_of_problems):\r\n sure_problems = 0\r\n problems = input().split()\r\n for i in range(len(problems)):\r\n problems[i] = int(problems[i])\r\n if problems[i] == 1:\r\n sure_problems = sure_problems + 1\r\n if sure_problems > 1:\r\n result = result + 1\r\nprint(result)", "def i():\r\n return(int(input()))\r\ndef l():\r\n return(list(map(int,input().split())))\r\ndef s():\r\n s = input()\r\n return(s)\r\ndef m():\r\n return(map(int,input().split()))\r\n\r\n \r\nn = i()\r\ncount = 0\r\n\r\nfor i in range(n):\r\n q = l()\r\n if sum(q) >= 2:\r\n count += 1\r\n \r\nprint(count)\r\n \r\n", "t=int(input())\r\ny=0\r\nfor i in range(t):\r\n b=[int(i) for i in input().split()]\r\n if b.count(1)>=2:\r\n y+=1\r\n else:continue\r\nprint(y)", "np=int(input())\r\nps=0\r\nl1=[\"1 1 0\",\"1 0 1\", \"0 1 1\", \"1 1 1\"]\r\nfor i in range(np):\r\n a= str(input())\r\n if a in l1:\r\n ps=ps+1\r\nprint(ps)\r\n", "c=int(input())\r\ns=0\r\nfor i in range(c):\r\n a,b,c=map(int,input().split())\r\n x=a+b+c\r\n if x >=2:\r\n s+=1\r\nprint(s)\r\n ", "n = int(input())\r\nP = []\r\nV = []\r\nT = []\r\nz = []\r\nfor i in range(0, n):\r\n z.append(list(map(int, input().split())))\r\nn_resh = 0\r\nfor i in range(0, n):\r\n if sum(z[i]) >= 2:\r\n n_resh += 1\r\nprint(n_resh)", "t=int(input())\ncount_list=[]\nfor i in range(t):\n a=list(map(int, input().split()))\n if sum(a)>=2:\n count_list.append('1')\nprint(len(count_list))\n\t \t \t \t \t\t \t\t\t \t\t\t\t \t\t\t", "n = int(input())\ncount = int(0)\nfor i in range(n):\n p,v,t = map(int,input().split())\n if(p+v+t > 1):\n count= count +1\nprint(count)\n \t \t \t \t\t\t \t\t\t \t\t \t\t \t\t\t \t", "n=int(input())\r\nd=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n if a.count(1)>=2:\r\n d+=1\r\nprint(d)", "# Input the number of problems\nn = int(input())\n\n# Initialize a counter for the number of problems they will implement\ncount = 0\n\n# Process each problem\nfor _ in range(n):\n petya, vasya, tonya = map(int, input().split())\n \n # Count the number of friends who are sure about the solution\n sure_count = petya + vasya + tonya\n \n # If at least two friends are sure, increment the count\n if sure_count >= 2:\n count += 1\n\n# Print the total number of problems they will implement\nprint(count)\n\n \t\t\t \t \t\t\t\t\t\t\t\t \t\t \t \t \t", "n = int(input())\r\nans = 0\r\nfor i in range(n):\r\n petya, vesya, tonya = input().split(\" \")\r\n petya, vesya, tonya = int(petya), int(vesya), int(tonya)\r\n if (petya + vesya + tonya > 1):\r\n ans += 1\r\nprint(ans)\r\n", "T = int(input())\n\ncount = 0\n\nfor i in range(T):\n countm = 0\n x,y,z = map(int, input().split())\n if (x==1):\n countm+=1\n if(y==1):\n countm+=1\n if(z==1):\n countm+=1\n \n if(countm>1):\n count+=1\n\nprint(count)\n", "n = int(input())\r\nproblems_solved = 0\r\n\r\nfor _ in range(n):\r\n petya, vasya, tonya = map(int, input().split())\r\n \r\n if petya + vasya + tonya >= 2:\r\n problems_solved += 1\r\n\r\nprint(problems_solved)\r\n", "x=int(input())\r\nz=[]\r\nk=0\r\nfor i in range(x):\r\n z=input().split()\r\n z=list(map(int,z))\r\n l=0\r\n for i in range(len(z)):\r\n if z[i]==1:\r\n l=l+1\r\n if l>1:\r\n k=k+1\r\nprint(k)", "n = int(input())\r\nsolution = 0\r\ni = 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n i += 1\r\n\r\n if a == 1 and b == 1:\r\n solution += 1\r\n elif a == 1 and c == 1:\r\n solution += 1\r\n elif b == 1 and c == 1:\r\n solution += 1\r\nprint(f'{solution}')\r\n", "n = int(input()) # number of problems\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n views = list(map(int, input().split())) # views of Petya, Vasya, Tonya\r\n if sum(views) >= 2: # if at least two friends are sure about the solution\r\n count += 1\r\n\r\nprint(count)", "a=int(input())\r\nl=0\r\nif 1<=a<=1000:\r\n for i in range(a):\r\n b=input()\r\n if (b[0]=='1' and b[2]=='1' and b[4]=='1') or (b[0]=='1' and b[2]=='1' and b[4]=='0') or (b[0]=='1' and b[2]=='0' and b[4]=='1') or (b[0]=='0' and b[2]=='1' and b[4]=='1'):\r\n l+=1\r\n\r\nprint(l)", "n = int(input())\r\nv = 0\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n a = int(a)\r\n b = int(b)\r\n c = int(c)\r\n l = int(a + b + c)\r\n if l >= 2:\r\n v += 1\r\n else:\r\n v += 0\r\nprint(v)\r\n", "k=0\r\nfor _ in range(int(input())):\r\n a=list(map(int,input().split()))\r\n if a.count(1)>1:\r\n k+=1\r\nprint(k)\r\n \r\n", "m=int(input())\r\nco=0\r\nfor i in range(m):\r\n x=list(map(int,input().split()))\r\n if x.count(1)>=2:\r\n co+=1\r\nprint(co)\r\n ", "problems = input()\r\n\r\ni = 0\r\ncorrect = 0\r\n\r\nwhile i < int(problems): \r\n valSolution = input().split()\r\n valid = 0\r\n for solution in valSolution:\r\n if solution == '1':\r\n valid += 1\r\n if valid >= 2:\r\n correct += 1\r\n break\r\n i += 1\r\n \r\nprint(correct)", "n = int(input())\ncount = 0\nfor i in range(0,n):\n p, v, t = map(int, input().split())\n if p and v == 1 or p and t == 1 or v and t == 1:\n count +=1\nprint(count)", "n = int(input()) # Number of problems\r\ncount = 0 # Count of problems they will implement\r\n\r\nfor _ in range(n):\r\n petya, vasya, tonya = map(int, input().split())\r\n # Count how many friends are sure about the solution\r\n sure_count = petya + vasya + tonya\r\n if sure_count >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n\r\n'''\r\nimport os\r\nos.system(\"cls\")\r\n\r\nn = int(input())\r\ncounter = 0\r\nwhile n > 0:\r\n x = 0\r\n for _ in range(3):\r\n x += int(input())\r\n if x >= 2:\r\n counter += 1\r\n n -= 1\r\nprint(counter)\r\n'''", "n=int(input())\r\nj=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if a+b+c>=2:\r\n j+=1\r\nprint(j)", "questions = int(input())\r\nans = 0\r\nfor _ in range(questions):\r\n agree = list(map(int, input().split()))\r\n ones = agree.count(1)\r\n if ones >= 2:\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\ns = 0\r\n\r\nfor i in range(n):\r\n a = input().split()\r\n sx = int(a[0]) + int(a[1]) + int(a[2])\r\n if sx > 1:\r\n s += 1\r\nprint(s)\r\n", "n = int(input())\r\nx = 0\r\nfor i in range(n):\r\n s = input()\r\n sum = int(s[0]) + int(s[2]) + int(s[4])\r\n if sum > 1: x = x + 1\r\nprint(x)", "ite = int(input())\r\nsubmitted = 0\r\n\r\nfor i in range(ite):\r\n decision = input().split(\" \")\r\n if decision.count(\"1\") > 1:\r\n submitted += 1\r\n\r\nprint(submitted)", "\r\ndef check(x):\r\n count= 0\r\n for i in range(0,len(x)):\r\n if x[i]=='1':\r\n count+=1\r\n if count!=1 and count!=0:\r\n return 1\r\n else:\r\n return 0\r\n \r\ny = 0\r\nin_arr = []\r\nx = int(input())\r\nif x>0 and x<1001:\r\n for j in range(0,x):\r\n in_arr.append(str(input()))\r\n \r\nfor i in range(0,len(in_arr)):\r\n y +=check(in_arr[i])\r\nprint(y)", "n = int(input())\r\ncount = 0\r\n\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n \r\n total = a + b + c\r\n if total >= 2:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\nv = 0\nwhile n:\n n -= 1\n p = list(map(int, input().split()))\n if ((p[0] + p[1] + p[2] ) == 2) or ((p[0] + p[1] + p[2]) == 3):\n v += 1\nprint(v)\n", "n = int(input())\r\nb = []\r\nfor i in range(n):\r\n p = input()\r\n p = p.split(\" \")\r\n p = [int(i) for i in p]\r\n b.append(p)\r\ncount = 0\r\nfor i in range(n):\r\n c = 0\r\n for j in range(3):\r\n if(b[i][j]==1):\r\n c+=1\r\n if c>=2:\r\n count+=1\r\nprint(count)\r\n", "#problem x\nn=int(input())\nc=0\nfor i in range(1,n+1):\n p,v,t=map(int,input().split())\n if (p==1 and v==1) or (p==1 and t==1) or (v==1 and t==1):\n c+=1\nprint(c)\n \n \t \t \t \t\t\t\t \t \t \t\t", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n petya,vasya,tonya = map(int,input().split())\r\n sure = petya+vasya+tonya\r\n if(sure>=2):\r\n count+=1\r\nprint(count) ", "N = int(input())\n\ncases = []\n\nfor i in range(N):\n cases.append( list(map(int,input().split())) )\n\nout = 0\nfor x in cases:\n curr = 0\n for z in x:\n if z == 1:\n curr +=1\n if curr >1:\n out +=1\n break\n\nprint(out)", "k = 0\r\nfor i in range(int(input())):\r\n if input().count(\"1\") >= 2:\r\n k += 1\r\nprint(k)", "n=int(input())\r\nresult=0\r\nfor i in range(1,n+1):\r\n a,b,c=map(int,input().split())\r\n if a+b+c==2 or a+b+c==3:\r\n result=result+1\r\nprint(result)", "n=int(input())\r\nk=0\r\na=[]\r\nfor i in range(n):\r\n l = list(map(int,input('').split()))\r\n a.append(l)\r\n if sum(a[i])>1:\r\n k=k+1\r\nprint(k)", "n=int(input())\r\n\r\nk=0\r\nsum=0\r\nfor i in range (0,n):\r\n s=input()\r\n sum=(int(s.split()[0])+int(s.split()[1])+int(s.split()[2]))\r\n if(sum>=2):\r\n k+=1\r\nprint(k)", "res = 0\r\n\r\nn = int(input())\r\nfor i in range(n):\r\n x, y, z = input().split()\r\n x = int(x)\r\n y = int(y)\r\n z = int(z)\r\n\r\n if (x + y + z) >= 2:\r\n res += 1\r\n\r\nprint(res)", "n=int(input())\r\nres=0\r\nfor i in range(n):\r\n tmp=0\r\n ans=input().split(\" \")\r\n for a in ans:\r\n tmp+=1 if a==\"1\" else 0\r\n res+=1 if tmp>=2 else 0\r\nprint(res)", "n = int(input())\noverview = [list(map(int,input().split())) for _ in range(n)]\nanswer = 0\nfor x in range (n):\n if (overview[x][0]+ overview[x][1] + overview[x][2]) >= 2:\n answer += 1\nprint(answer)", "n=int(input())\na=0\nfor i in range (0,n):\n l,m,o= map(int,input().split())\n if l+m+o>1:\n a+=1\n else:\n a+=0\nprint (a)\n \t\t\t \t\t \t \t \t \t\t \t \t", "n = int(input())\r\nc = 0\r\nfor i in range(0,n):\r\n m = input()\r\n if m.count('1')>=2:\r\n c += 1\r\n i += 1\r\nprint(c)", "r = int(input())\r\nk = 0\r\nwhile r:\r\n a,b,c = map( int, input().split())\r\n x = a + b + c\r\n if x > 1:\r\n k += 1\r\n r -= 1\r\nprint(k)\r\n\r\n\r\n\r\n\r\n", "ans = 0\r\nfor _ in range(int(input())):\r\n a = list(map(int, input().split()))\r\n if a.count(1) > 1:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\ncount=0\r\nfor i in range(0,n):\r\n str1=input()\r\n if str1.count('1')>=2:\r\n count+=1\r\n\r\nprint(count)", "n=int(input())\r\nsolve=0\r\nfor i in range(n):\r\n lis = [int(x) for x in input().split()]\r\n if lis.count(1) >1 :\r\n solve += 1\r\nprint(solve)", "n=int(input())\r\ncount=0\r\nfor i in range(n):\r\n views=list(map(int,input().split()))\r\n if sum(views)>=2:\r\n count+=1\r\nprint(count)", "val = int(input())\r\nres = 0\r\nfor i in range(val):\r\n lst = map(int, input().split())\r\n if sum(lst)>1:\r\n res += 1\r\nprint(res)", "n=int(input())\r\nm=0\r\nfor _ in range(n):\r\n a,b,c=map(int,input().split())\r\n if a+b+c>=2:\r\n m+=1\r\nprint(str(m))\r\n ", "n = int(input())\r\nx = [input() for i in range(n)]\r\ny = 0\r\nfor i in range(n):\r\n if x[i] == \"1 1 0\" or x[i] == \"0 1 1\" or x[i] == \"1 1 1\" or x[i] == \"1 0 1\":\r\n y += 1\r\nprint(y)", "n = int(input())\r\ndecision_list = []\r\n\r\nfor i in range(n):\r\n x = str(input())\r\n decision_list.append(x.split(' '))\r\n\r\ncount = 0\r\n\r\nfor decision in decision_list:\r\n yes = 0\r\n for x in decision:\r\n if int(x) == 1:\r\n yes += 1\r\n\r\n if yes == 2:\r\n count +=1\r\n break\r\n\r\nprint(count)", "n = int(input())\r\ntasks = [list(map(int, input().split())) for _ in range(n)]\r\nprint(sum(1 for task in tasks if sum(task) >= 2))", "n = int(input())\r\nm = 0\r\nfor i in range(n):\r\n x= list(map(int, input().split()))\r\n c = sum(x)\r\n if c >= 2:\r\n m += 1\r\nprint(m)\r\n", "x=0\r\nline=str()\r\nn = int(input())\r\nfor i in range(n):\r\n line = input()\r\n if int(line[0]) + int(line[2]) + int(line [4]) >= 2 : \r\n x = x+1\r\nprint( x ) ", "s = 0\r\nfor i in range(int(input())):\r\n a,b,c = map(int,input().split())\r\n if (a + b + c) >=2 :\r\n s += 1\r\nprint(s)", "n=int(input())\r\ncnt=0\r\n\r\nfor i in range(0,n):\r\n a=input()\r\n if a.count('1')>=2:\r\n cnt+=1\r\nprint(cnt)", "sayi = int(input())\r\n\r\ndef cozme():\r\n kisiler = input()\r\n kisiler1 = [0,0,0]\r\n b = 0\r\n las = 0\r\n for i in kisiler:\r\n if i.isdigit():\r\n b = int(i)\r\n if i == \" \":\r\n las +=1\r\n else:\r\n kisiler1[las] = b\r\n kisiler1[2] = int(b)\r\n \r\n if kisiler1.count(1) >= 2:\r\n return 1\r\n else:\r\n return 0\r\n\r\nb = 0\r\nfor i in range(sayi):\r\n b = b + cozme()\r\nelse:\r\n print(b)", "n = int(input())\r\n\r\np = 0\r\nfor _ in range(n):\r\n if sum(map(int, input().split())) >= 2:\r\n p += 1\r\n\r\nprint(p)", "n = int(input())\r\np = 0\r\nfor _ in range(n):\r\n arr = [int(x) for x in input().split()]\r\n if (sum(arr) > 1):\r\n p += 1\r\nprint(p)", "def implementable_problems(n, problems):\r\n count = 0\r\n for problem in problems:\r\n if sum(problem) >= 2:\r\n count += 1\r\n return count\r\n\r\n# Take input from the user\r\nn = int(input())\r\nproblems = []\r\nfor _ in range(n):\r\n views = input().split()\r\n problems.append([int(x) for x in views])\r\n\r\n# Calculate the number of implementable problems\r\nresult = implementable_problems(n, problems)\r\nprint(result)", "# nurullah\ndef implementation(n, solutions):\n count = 0\n for i in range(n):\n views = solutions[i]\n sure_count = sum(views)\n if sure_count >= 2:\n count += 1 \n return count\n\n# User defined input\nn = int(input())\nsolutions = []\nfor i in range(n):\n solutions.append([int(i) for i in input().split(\" \")])\n\n# Output \nresult = implementation(n, solutions) \nprint(result)\n\n\t \t\t \t\t\t \t \t \t \t \t \t\t\t\t\t", "participants=int(input())\r\ncount=0\r\nfor i in range(participants):\r\n opinion=list(map(int,input().split()))\r\n if sum(opinion)>=2:\r\n count+=1\r\n \r\nprint(count)", "def implement():\r\n solved_problem = 0\r\n n = int(input())\r\n for i in range (n):\r\n num1, num2, num3 = map(int, input().split())\r\n sum_view = num1 + num2 + num3\r\n if sum_view >= 2 :\r\n solved_problem += 1\r\n return solved_problem\r\nresult = implement()\r\nprint(result)", "n=int(input())\nsolve=0\nfor i in range (n):\n p,v,t = map(int,input().split())\n count = 0\n if p==1:\n count +=1\n if v==1:\n count +=1\n if t==1:\n count +=1\n if count>=2:\n solve+=1\nprint(solve)\n \t \t \t\t\t \t \t\t \t\t \t \t \t\t\t\t", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n lst = [i for i in input().split() if i == '1']\r\n if len(lst) >= 2:\r\n counter += 1\r\nprint(counter)", "n=int(input())\n\ncnt=0\n\nfor i in range(0,n,1):\n a,b,c=list(map(int,input().split()))\n if a+b+c >=2:\n cnt+=1\n\n\nprint(cnt)\n\n\n\t\t\t\t \t\t \t\t\t\t \t \t\t \t\t\t\t\t", "\r\ndef check(a,b,c):\r\n if (a==0 or a==1)and(b==0 or b==1)and(c==0 or c==1): \r\n return True\r\n else:return False\r\nn=int(input())\r\nteam=[]*n\r\n\r\nfor a in range(1,n+1):\r\n a=list(map(int, input().split()))[:3]\r\n team.append(a)\r\n\r\ncount=0\r\nfor x in team:\r\n if check(x[0],x[1],x[2]):\r\n if sum(x)>=2:\r\n count+=1\r\n \r\nprint(count)", "res = 0\nfor _ in range(int(input())):\n arr = list(map(int,input().split()))\n count = 0\n for i in arr:\n if i == 1:\n count+=1\n if count >1:\n res+=1\nprint(res)\n \n", "n = int(input()) \r\ncount = 0 \r\n\r\nfor i in range(n):\r\n opinions = input().split() \r\n if opinions.count('1') >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "N=int(input())\nans = 0\nfor _ in range(N):\n a,b,c = map(int,input().split())\n if a+b+c >= 2:\n ans += 1\n \nprint(ans)", "n = int(input())\r\ngood = 0\r\n\r\nfor i in range(n):\r\n line = map(int, input().split())\r\n if sum(line) >= 2:\r\n good += 1\r\n \r\nprint(good)\r\n ", "n = int(input())\r\n\r\nnum_decisions = 0\r\nfor _ in range(n):\r\n opinions = input().strip().split(\" \")\r\n num_ones = 0;\r\n if opinions[0] == \"1\":\r\n num_ones +=1\r\n if opinions[1] == \"1\":\r\n num_ones +=1\r\n if opinions[2] == \"1\":\r\n num_ones +=1\r\n if num_ones > 1:\r\n num_decisions += 1\r\nprint(num_decisions)", "n = int(input())\r\nproblems_implementable = 0\r\n\r\nfor _ in range(n):\r\n views = list(map(int, input().split()))\r\n sure_count = sum(views)\r\n \r\n if sure_count >= 2:\r\n problems_implementable += 1\r\n\r\nprint(problems_implementable)\r\n", "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 bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict\r\n\r\n\r\ndef solve():\r\n n = iinp()\r\n ans = 0\r\n for i in range(n):\r\n if linp().count(1) > 1:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nq = 1\r\nfor _ in range(q):\r\n solve()\r\n", "a=int(input())\r\nx=0\r\nfor i in range(a):\r\n s,b,f=map(int,input().split())\r\n if s+b+f==2 or s+b+f==3:\r\n x=x+1\r\nprint(x)", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n l = list(input())\r\n if l.count('0') <= 1:\r\n counter += 1\r\nprint(counter)\r\n", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if a+b+c==3 or a+b+c==2:\r\n x=x+1\r\n else:\r\n x=x+0\r\nprint(x)", "n = int(input())\r\n\r\ntcount = 0\r\nfor x in range(n):\r\n\t\r\n\tcount = 0\r\n\tintegers = str(input())\r\n\ti = integers.split()\r\n\tfor x in i:\r\n\t\tif int(x) == 1:\r\n\t\t\tcount += 1\r\n\tif count >= 2:\r\n\t\ttcount += 1\r\nprint(tcount)\r\n\t\t\r\n\t\t\t\r\n\t\r\n", "n = int(input())\r\nres = 0\r\nfor _ in range(n):\r\n z = input()\r\n if z == '1 1 1' or z == '1 0 1' or z == '0 1 1' or z == '1 1 0':\r\n res += 1\r\nprint(res)", "w = int(input())\nx=0\nfor i in range(w):\n k,j,m=map(int,input().split())\n if k+j+m>1:\n x+=1\nprint(x)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a, b, c = input().split()\r\n a = int(a)\r\n b = int(b)\r\n c = int(c)\r\n if (a == 1 and b == 1) or (a == 1 and c == 1) or (b == 1 and c == 1):\r\n count+=1\r\nprint(count)", "a = int(input())\r\nk = 0\r\nfor i in range(a):\r\n m, l, s = map(int, input().split())\r\n if m == 1 and l == 1 or m == 1 and s == 1 or l == 1 and s ==1:\r\n k += 1\r\n else:\r\n continue\r\nprint(k)\r\n", "#codeforce test\nn = int(input())\nans = 0\nfor i in range(n):\n Pe, Va, To = input().split(' ')\n if int(Pe) + int(Va) + int(To) > 1:\n ans += 1\nprint(ans)", "n = int(input())\r\nsolved_problems = 0\r\n# For each problem\r\nfor _ in range(n):\r\n # Read views of Petya, Vasya, and Tonya\r\n p, v, t = map(int, input().split())\r\n # If at least two of them are sure about the solution, increment the counter\r\n if p + v + t >= 2:\r\n solved_problems += 1\r\n# Print the number of problems the friends will implement\r\nprint(solved_problems)\r\n", "x=int(input())\r\n\r\nxsum=0\r\nwhile x>0:\r\n ylist=[]\r\n ysum=0\r\n for y in input().split():\r\n ylist.append(int(y))\r\n for y in ylist:\r\n if y ==1:\r\n ysum+=1\r\n if ysum>1:\r\n xsum+=1\r\n x-=1\r\nprint(xsum)\r\n", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nsolved_tasks = 0\r\nfor i in range(n):\r\n task = sum([int(i) for i in sys.stdin.readline().split()])\r\n if task > 1:\r\n solved_tasks += 1\r\n \r\nprint(solved_tasks)", "problems = input()\r\n\r\ni = 0\r\ncorrect = 0\r\n\r\nwhile i < int(problems): \r\n valSolution = input().split()\r\n val = valSolution.count('1')\r\n\r\n if val >= 2:\r\n correct += 1\r\n \r\n i += 1\r\n \r\nprint(correct)", "a = int(input())\r\nresult = 0\r\nfor i in range(a):\r\n b = input()\r\n c = b.split()\r\n answers = list(map(int, c))\r\n if answers[0] + answers[1] + answers[2] >= 2:\r\n result += 1\r\nprint(result)", "n = int(input())\ncount = 0\nfor i in range(0, n):\n list = [int(value) for value in input().split()]\n if(sum(list) > 1):\n count += 1\n\nprint(count)\n", "n = int(input()) # Number of problems\r\ncount = 0 # Initialize the count of problems to implement\r\n\r\n# Iterate through the problems\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split()) # Petya's, Vasya's, and Tonya's views\r\n # Check if at least two of them are sure (sum of 1s is at least 2)\r\n if p + v + t >= 2:\r\n count += 1\r\n\r\n# Output the result\r\nprint(count)\r\n", "t = int(input())\r\n\r\ncount = 0\r\n\r\nfor i in range(t):\r\n a = str(input().replace(\" \", \"\"))\r\n if a.count(\"1\") >= 2: \r\n count += 1 \r\nprint(count)", "# Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize a variable to count the number of problems they will implement\r\ncount = 0\r\n\r\n# Loop through the n problems\r\nfor i in range(n):\r\n p, v, t = map(int, input().split())\r\n \r\n # Check if at least two of them (Petya, Vasya, Tonya) are sure about the problem\r\n if p + v + t >= 2:\r\n count += 1\r\n\r\n# Output the number of problems they will implement\r\nprint(count)\r\n", "def main():\r\n n = int(input())\r\n cnt = 0\r\n for _ in range(n):\r\n _list = list(map(int, input().split()))\r\n if(sum(_list) >= 2):\r\n cnt += 1\r\n\r\n print(cnt)\r\n\r\nmain()", "n = int(input())\ns = 0\nfor i in range(n):\n p,v,t = map(int,input().split())\n if (p + v + t) >= 2: s += 1\nprint(s)", "a=int(input())\r\nans=0\r\nfor i in range(a):\r\n e_list = input().split()\r\n num_list = list(map(int, e_list))\r\n if(2<=sum(num_list)):\r\n ans=ans+1\r\nprint(ans)", "n = int(input())\r\ncount=0\r\nfor i in range(n):\r\n view=list(map(int,input().split()))\r\n if view[0]+view[1]+view[2]>=2:\r\n count+=1\r\nprint(count)", "n=int(input ())\r\ncount=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n s=l.count(1)\r\n if s>1:\r\n count+=1\r\nprint(count)", "numOfProblems = int(input())\narray = []\nfor i in range(numOfProblems):\n row = list(map(int, input().split()))\n array.append(row)\n\ncount = 0\nfor i in range(numOfProblems):\n numOfones = 0\n for j in range(0,3):\n if array[i][j] == 1:\n numOfones += 1\n if(numOfones >= 2):\n count += 1\n\nprint(count)", "n = int(input())\r\n\r\ncount = 0\r\nfor test in range(n):\r\n views = [int(i) for i in input().split()]\r\n if sum(views) >= 2:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\ntotal = 0\n\nfor i in range(n):\n l = list(map(int, input().split()))\n if l.count(1) > 1:\n total +=1\nprint(total)", "count = 0\r\nn=int(input())\r\nwhile n != 0:\r\n p,v,t = input().split(\" \")\r\n p=int(p)\r\n v=int(v)\r\n t=int(t)\r\n sol = [p,v,t]\r\n if sol.count(1) > 1:\r\n count+=1\r\n n-=1\r\nprint(count)", "score = 0\r\nfor x in range(int(input())):\r\n bar = str(input())\r\n if bar.count(\"1\") > 1:\r\n score = score + 1\r\nprint(score)", "x=0\r\nfor _ in range(int(input())):\r\n a,b,c = map(int,input().split())\r\n if a==1 and b==1:\r\n x+=1\r\n elif a==1 and c==1:\r\n x+=1\r\n elif b==1 and c==1:\r\n x+=1\r\nprint(x)", "n=int(input(\"\"))\r\nl=[]\r\nfor i in range(n):\r\n u=input(\"\")\r\n l.append(u)\r\ncounter1=0\r\nfor i in l : \r\n counter2=0\r\n for i2 in i : \r\n if i2=='1':\r\n counter2=counter2+1\r\n if counter2 >=2 : \r\n counter1=counter1+1\r\n\r\nprint(counter1) ", "n = int(input())\r\na=0\r\nfor i in range(n):\r\n r = input()\r\n if(r.count('1') >= 2):\r\n a+=1\r\nprint(a)", "n = int(input())\r\ncont = 0\r\nfor i in range(n):\r\n a,b,c = list(map(int,input().split())) \r\n t = a+b+c\r\n if t >= 2:\r\n cont+=1\r\nprint(cont)", "n=int(input())\r\nans=0\r\nfor i in range(0,n):\r\n a=list(map(int,input().split()))\r\n k=0\r\n for j in a:\r\n if(j==1):\r\n k=k+1\r\n if(k>=2):\r\n ans=ans+1\r\n\r\n a.clear()\r\nprint(ans)", "n= int(input())\r\n\r\nans= []\r\n\r\nfor i in range(n):\r\n line= input().split()\r\n \r\n ans.append(line)\r\n\r\n\r\nans1= 0\r\n\r\nfor i in ans:\r\n count=0\r\n \r\n for j in i:\r\n if j=='1':\r\n count+=1\r\n \r\n \r\n if count>=2:\r\n ans1+=1\r\n \r\nprint(ans1)\r\n ", "n =int(input())\r\ncount=0\r\nfor i in range(n):\r\n prob = input().split()\r\n if prob.count('1') > 1:\r\n count=count+1\r\nprint(count)", "counts = 0\r\nfor _ in range(int(input())):\r\n\ta = input()\r\n\tif a.count('1')>=2:\r\n\t\tcounts +=1\r\n\telse:\r\n\t\tcontinue\t\r\nprint(counts)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Oct 23 15:33:48 2023\r\n\r\n@author: USUARIO\r\n\"\"\"\r\n\r\nnumm = 0\r\nfor x in range(int(input(\" \"))):\r\n chain = input(\" \")\r\n if chain.count('1') >= 2: numm += 1 \r\nprint(numm)", "n = int(input()) # Number of problems\r\ncount = 0 # Initialize the count of problems they will solve\r\n\r\nfor _ in range(n):\r\n views = list(map(int, input().split())) # Read the views of Petya, Vasya, and Tonya\r\n sure_count = sum(views) # Count the number of friends sure about the solution\r\n if sure_count >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\ncount = 0\r\nfor i in range (0, n):\r\n sol = input()\r\n if sol.count('1') >= 2:\r\n count += 1\r\nprint(count)", "#problem Z\ndef fun(a,b,c):\n if(a==1 and b==1)or(a==1 and c==1)or (b==1 and c==1):\n return 1\n else:\n return 0\nn=int(input())\nc=0\nfor i in range(n):\n x,y,z=map(int,input().split())\n c=c+(int(fun(x,y,z)))\nprint(c)\n\t\t \t \t\t\t \t\t\t\t \t \t\t\t \t\t\t \t\t", "n=int(input())\r\nx=0\r\nfor i in range(n):\r\n a,b,c=map(int,input().split())\r\n if (a+b+c >=2) :\r\n x+=1\r\nprint(x)\r\n", "a=int(input())\r\nh=0\r\nm=0\r\nfor i in range(a):\r\n s=str(input())\r\n for ii in range(len(s)):\r\n if(s[ii]=='1'):\r\n m=m+1\r\n \r\n if(m>1):\r\n h=h+1\r\n m=0\r\nprint(h)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = sum(1 for _ in range(n) if sum(map(int, input().split())) >= 2)\r\nprint(ans)", "i = int(input())\r\ncount = 0\r\nfor _ in range(i):\r\n a,b,c = map(int, input().split())\r\n su = a+b+c\r\n if su > 1:\r\n count += 1\r\nprint(count)", "cnt=0\r\nfor _ in range(int(input())):\r\n l=list(map(int, input().split()))\r\n #cnt=0\r\n if l.count(1)>=2:\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\ncount=0\nwhile(n):\n list1=list(map(int,input().split()))[:3]\n flag=0\n for i in list1:\n if(i==1):\n flag+=1\n if(flag>1):\n count+=1\n n-=1\nprint(count)\n\t\t \t\t\t\t\t \t \t \t\t\t\t \t\t \t \t\t", "n = int(input())\r\na = 0\r\nfor i in range(n):\r\n input_numbers = input()\r\n num1, num2, num3 = map(int, input_numbers.split())\r\n if num1+ num2 +num3>=2 :\r\n a= a+1\r\nprint(a)\r\n ", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n pqr = input().split()\r\n p, q, r = int(pqr[0]), int(pqr[1]), int(pqr[2])\r\n if p + q + r >= 2:\r\n count += 1\r\nprint(count)\r\n", "num_of_problems = int(input())\r\ntotal = 0\r\nfor i in range(num_of_problems):\r\n submission = input()\r\n agreed = 0\r\n for char in submission:\r\n if char == \"1\":\r\n agreed += 1\r\n if agreed >= 2:\r\n total += 1\r\nprint(total)", "c=0\r\nfor i in range(int(input())):\r\n x=list(map(int,input().split()))\r\n if x.count(1)>=2:\r\n c+=1\r\nprint(c)\r\n", "def contest_problems(n, problems):\n count = 0\n for problem in problems:\n if problem.count(1) >= 2:\n count += 1\n return count\n\nn = int(input())\nproblems = [list(map(int, input().split())) for _ in range(n)]\n\nresult = contest_problems(n, problems)\nprint(result)\n\n\t \t \t \t\t \t\t\t\t\t", "n=int(input())\r\nsumm=0\r\nfor i in range(1,n+1):\r\n \r\n p,v,t=map(int,input().split())\r\n \r\n if (v+p+t)>=2:\r\n summ+=1\r\nprint(summ)", "n = int(input())\r\ni = 1\r\nrz = 0\r\nwhile i <= n:\r\n p=input()\r\n s = 0\r\n for u in p.split():\r\n if u==\"1\":\r\n s = s +1\r\n if s >=2:\r\n rz = rz +1\r\n\r\n i=i+1\r\nprint(rz)", "n = int(input())\r\ntasks = 0\r\n\r\nfor i in range(n):\r\n team = input()\r\n if len(team) == 5:\r\n opportunity = team.split()\r\n Petya = int(opportunity[0])\r\n Vasya = int(opportunity[1])\r\n Tony = int(opportunity[2])\r\n if Petya + Vasya + Tony >= 2:\r\n tasks += 1\r\n else:\r\n pass\r\n\r\nprint(tasks)", "numofprob =int(input())\r\n\r\nallprob =[]\r\n\r\nfor words in range(numofprob):\r\n givenwords =input().split(\" \")\r\n allprob.append(givenwords)\r\n\r\nintegerprob = []\r\nfor lol in allprob:\r\n for lol2 in map(int,lol):\r\n integerprob.append(lol2)\r\n\r\nsplit_list =[]\r\n\r\nfor i in range(0,len(integerprob),3):\r\n split_list.append(integerprob[i:i+3])\r\n\r\n\r\n\r\ns_problems = 0\r\n \r\nfor row in split_list :\r\n if row.count(1)>row.count(0):\r\n s_problems+=1\r\n\r\nprint(s_problems)", "n = int(input())\r\nnum_solve = 0;\r\nfor i in range(0,n):\r\n count = 0\r\n arr = [int(x) for x in input().split()]\r\n for num in arr:\r\n if num == 1:\r\n count+=1\r\n if count > 1:\r\n num_solve+=1\r\nprint(num_solve)", "def fun(n):\n count =0\n for i in range(n):\n a,b,c = map(int ,input().split())\n add =a+b+c\n if add > 1:\n count+=1 \n print(count) \nn = int(input()) \nfun(n) \n \t \t \t \t \t\t\t \t\t \t \t\t \t\t \t \t", "n = int(input())\r\n\r\nliste = []\r\ncount = 0\r\nfor i in range(n):\r\n row = input()\r\n row_list = list(map(int, row.split()))\r\n liste.append(row_list)\r\naranan = [\"110\", \"101\", \"011\", \"111\"]\r\nfor j in range(n):\r\n result = ''.join(map(str, liste[j]))\r\n if result in aranan:\r\n count += 1\r\n\r\nprint(count)\r\n", "\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\ndef main():\r\n num = input()\r\n count = 0\r\n for i in range(int(num)):\r\n friends = list(invr())\r\n fc = 0\r\n for friend in friends:\r\n if friend == 1:\r\n fc += 1\r\n if fc >= 2:\r\n count += 1\r\n print(count)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def solve():\r\n problems = int(input())\r\n counter = 0\r\n for _ in range(problems):\r\n if sum(int(num) for num in input().split()) >= 2:\r\n counter = counter + 1\r\n print(counter)\r\n\r\nsolve()\r\n", "n=int(input()) #number of probs\ncount = 0 #correct \nfor i in range(n): \n arr = list(map(int,input().split())) \n k=arr.count(1)\n if k>1:\n count+=1\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 4 19:48:31 2023\r\n\r\n@author: pranto\r\n\"\"\"\r\nl=[]\r\nm=0\r\nn=0\r\nx=input()\r\nx=int(x)\r\nfor i in range(x):\r\n #for j in range(3):\r\n y=input().split(\" \")\r\n m=0\r\n if y.count('1')>=2: \r\n m+=1\r\n l.append(m)\r\nprint(sum(l))\r\n \r\n", "n = int(input())\r\nsum = 0\r\ncount = 0\r\nfor i in range (n):\r\n a,b,c=map(int,input().split()) \r\n sum = a+b+c\r\n if (sum > 1): \r\n count+=1\r\nprint(count)", "n=int(input())\r\ncount1=0\r\nfor k in range(n):\r\n s=input().split()\r\n count=0\r\n for elem in s:\r\n if elem==\"1\":\r\n count+=1\r\n if count>=2:\r\n count1+=1\r\nprint(count1)", "import math\r\nfrom collections import defaultdict\r\nfrom collections import Counter\r\nfrom collections import deque\r\nimport heapq\r\n\r\ndef InputStr(): return input()\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\ndef InputRevSortedList(): return list(reversed(sorted(list(map(int, input().split())))))\r\ndef InpStrToList(): return list(input())\r\n\r\ndef main():\r\n N = InputInt()\r\n ans = 0\r\n\r\n for i in range(N):\r\n sure = InputList()\r\n if sum(sure) >= 2:\r\n ans += 1\r\n \r\n print(ans)\r\n\r\nmain()", "n = int(input())\nproblem_implemented = 0\nproblems_list = [0,0,0]\nfor i in range(n):\n problem = input()\n problems_list[0] = int(problem[0])\n problems_list[1] = int(problem[2])\n problems_list[2] = int(problem[4])\n SolNum = problems_list[0] + problems_list[1] + problems_list[2]\n if SolNum > 1:\n problem_implemented += 1\nprint(problem_implemented)\n", "#!/usr/bin/env pypy\n\nn = int(input())\ncounter = 0\nfor _ in range(n):\n if sum([int(k) for k in input().split()]) >= 2:\n counter += 1\nprint(counter)\n", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n a = input()\r\n if int(a[0])+int(a[2])+int(a[4])>=2 :\r\n count +=1\r\nprint(count)", "n=int(input())\r\ncount=0\r\nfor a in range(n):\r\n A=input().split()\r\n c=int(A[0])+int(A[1])+int(A[2])\r\n if(c>=2):\r\n count+=1\r\nprint(count)\r\n \r\n", "a = int(input())\r\nl = [0] *a\r\nb = 0\r\nfor i in range(a):\r\n l[i] = input().split(\" \")\r\nfor i in l:\r\n if i.count(\"1\") >=2:\r\n b+=1\r\nprint(b)", "count = 0\r\nn = int(input())\r\nfor i in range(n):\r\n x, y, z = map(int, input().split())\r\n if not (x == 0 or x == 1) or not (y == 0 or y == 1) or not (z == 0 or z == 1):\r\n print('none')\r\n elif x+y+z >= 2:\r\n count+=1\r\n else:\r\n count+=0\r\nprint(count)\r\n \r\n \r\n", "t = int(input())\r\nd = 0\r\nfor i in range(t):\r\n a, b, c = map(int,input().split())\r\n if(a+b+c >= 2):\r\n d = d + 1\r\nprint(d)", "n=int(input())\r\ne=0\r\nfor i in range(n):\r\n l=list(map(int,input().split()))\r\n c=l.count(1)\r\n if c>1:\r\n e+=1\r\nprint(e) ", "count=0\r\nn=int(input())\r\nfor i in range(n):\r\n x=list(map(int,input().split()))\r\n res=sum(x)\r\n if res>=2:\r\n count+=1\r\nprint(count)", "def team():\n t=int(input())\n count=0\n for i in range(t):\n a,b,c=map(int,input().split())\n if (a==1 and b==1) or (a==1 and c==1) or (b==1 and c==1):\n count=count+1\n print(count)\nteam()\n \t \t\t\t\t \t\t \t \t\t \t", "n = int(input())\r\nnum = 0\r\nfor _ in range(n):\r\n Petya, Vasya, Tonya = map(int, input().split())\r\n if Petya + Vasya + Tonya >=2:\r\n num += 1\r\nprint(num)", "n = int(input())\r\na = []\r\nc = 0\r\nfor i in range(n):\r\n a.append([int(i) for i in input().split()])\r\nfor i in a:\r\n if sum(i) > 1:\r\n c+=1\r\nprint(c)", "n=int(input())\nans=0\nfor i in range(n):\n x,y,z=map(int,input().split())\n if (x+y+z)>1:\n ans+=1\nprint(ans)\n", "n = int(input())\r\ns = n\r\nfor i in range(n):\r\n str = input().split(' ')\r\n if int(str[0])+int(str[1])+int(str[2]) < 2:\r\n s -= 1\r\nprint(s)", "\r\nn = int(input())\r\n\r\ni = 0\r\nt = 0\r\nwhile i < n:\r\n solution = input()\r\n if solution.split().count('1') >= 2:\r\n t += 1\r\n i = i + 1\r\nprint(t)\r\n\r\n\r\n ", "n=int(input())\r\nsuccess=0\r\nfor i in range(n):\r\n if sum(map(int,input().split(\" \"))) >=2:\r\n success=success+1\r\nprint(success)", "n = int(input())\r\ndef count(x):\r\n c = 0\r\n for i in x:\r\n if i == 1:\r\n c += 1\r\n return c \r\nc = 0\r\nfor i in range(n):\r\n x = [int(i) for i in input().split()]\r\n if count(x) > 1:\r\n c += 1\r\nprint(c) ", "a = int(input())\r\ncount = 0\r\nmain = 0\r\nfor i in range(a):\r\n count = 0\r\n b= list(map( int, input().split()))\r\n if b[0] == 1:\r\n count += 1\r\n if b[1] == 1:\r\n count += 1\r\n if b[2] == 1:\r\n count += 1\r\n\r\n\r\n if count >= 2:\r\n main += 1\r\nprint(main)\r\n\r\n", "n=int(input())\r\ncollect=0\r\nif 1<=n<=1000:\r\n for i in range(n):\r\n pe, inp, josh=map(int,input().split())\r\n if pe+inp+josh >=2:\r\n collect=collect+1\r\n print(collect)", "i = 0\r\nfor _ in range(int(input())):\r\n s = input()\r\n\r\n if(s.count(\"1\") > 1):\r\n i += 1\r\nprint(i)", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\n\ntotal_count = 0\n\nfor _ in range(n):\n nums = list(map(int, input().split()))\n\n count = 0\n\n for num in nums:\n if num == 1:\n count += 1\n\n if count >= 2:\n total_count += 1\n\nsys.stdout.write(f\"{total_count}\")\n", "a = int(input())\nk = []\no = 0\nfor x in range(0,a):\n k.append([])\n l = input()\n for j in l.split(\" \"):\n k[-1].append(int(j))\n if sum(k[-1])>=2:\n o+=1\nprint(o)\n", "x=int(input())\r\ncount=0\r\nwhile(x>0):\r\n cnt=0\r\n y=input()\r\n y=y.replace(\" \",\"\")\r\n for i in range(3):\r\n \r\n if(y[i]=='1'):\r\n cnt+=1\r\n # print(i,'i',cnt,\"cnt\")\r\n \r\n \r\n if cnt>1:\r\n count+=1\r\n \r\n x-=1\r\n \r\nprint(count)\r\n", "n=int(input())\r\nb=0\r\nfor i in range(n):\r\n s=input()\r\n a=0\r\n for j in s:\r\n if j.isdigit():\r\n if int(j)==1:\r\n a+=1\r\n if a>1:\r\n b+=1\r\nprint(b)\r\n \r\n", "a=int(input())\r\ncount=0\r\np=0\r\nfor i in range(a):\r\n s=input(\"\")\r\n p=s.count(\"1\")\r\n if(p>=2):\r\n count+=1\r\n else:\r\n count+=0\r\n \r\nprint(count)\r\n", "n = int(input()) \r\n\r\nq= 0\r\n\r\nfor i in range(n):\r\n p, v, t = [int(x) for x in input().split()]\r\n \r\n if p + v + t >= 2:\r\n q += 1\r\n\r\nprint(q)", "n=int(input())\r\nans=0\r\nfor i in range(0,n):\r\n views = list(map(int, input().split()))\r\n cnt=sum(views)\r\n if(cnt>=2):\r\n ans+=1\r\nprint(ans)", "num=int(input())\r\nsum=0\r\nfor i in range (num):\r\n l = list(input().split())\r\n total = 0\r\n for i in l:\r\n if i ==\"1\":\r\n total+=1\r\n if total==2:\r\n sum+=1\r\n break\r\n\r\nprint(sum)", "N=int(input())\nU=0\nfor i in range (0,N):\n P,Q,R= map(int,input().split())\n if P+Q+R>1:\n U+=1\n else:\n U+=0\nprint (U)\n\t \t\t \t \t\t \t \t \t\t\t\t", "n = int(input())\r\nnumber = 0\r\n\r\nfor i in range(n):\r\n Petya, Vasya, Tonya = map(int, input().split())\r\n if Petya + Vasya + Tonya >= 2:\r\n number += 1\r\n\r\nprint(number)\r\n", "n = int(input())\r\n\r\nres = 0\r\nfor i in range(n):\r\n str = input()\r\n arr = str.split()\r\n if ( int(arr[0]) + int(arr[1]) + int(arr[2]) > 1):\r\n res+=1\r\n\r\nprint(res)", "t = int(input())\r\ncnt = 0\r\nwhile t:\r\n t-=1\r\n s = sum(list(map(int,input().split())))\r\n if s >= 2:\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\ns=0\r\na=[0]*n\r\nb=[0]*n\r\nc=[0]*n\r\nfor i in range(n):\r\n a[i],b[i],c[i]=map(int,input().split())\r\n\r\nfor i in range(n):\r\n if(a[i]+b[i]+c[i]>1):\r\n s+=1\r\n\r\nprint(s)", "n=int(input())\nc=0\nc2=0\nfor i in range(n):\n x=input().split()\n for j in range(len(x)):\n if x[j]==\"1\":\n c+=1\n if (x.count(\"1\")>=2):\n c2+=1\nprint(c2) ", "n = int(input())\ncan_solve = []\n\nfor i in range(n):\n solve_data_str = input().split(' ')\n can_solve.append([int(x) for x in solve_data_str])\n\ncount = 0\n\nfor data in can_solve:\n if sum(data) > 1:\n count += 1\n\nprint(count)", "n=int(input())\nb=0\nfor i in range(n):\n a=0\n x,y,z=map(int,input().split())\n if(x==1):\n a+=1\n if(y==1):\n a+=1\n if(z==1):\n a+=1\n if(a>=2):\n b+=1\nprint(b)\n", "def Quiz(n):\r\n arr=[]\r\n for i in range(0,n):\r\n k= [int(item) for item in input().split()]\r\n arr.append(k)\r\n count=0\r\n for t in range(0,n):\r\n x=0\r\n for j in range(0,3):\r\n if(arr[t][j]==1):\r\n x+=1\r\n else:\r\n pass\r\n if(x>=2):\r\n count+=1\r\n else:\r\n pass\r\n return count\r\n\r\n\r\nif __name__==\"__main__\":\r\n n=int(input())\r\n print(Quiz(n))", "number = int(input())\r\ncount = 0\r\nfor i in range(0, number):\r\n a, b, c = input().split(\" \")\r\n if int(a) + int(b) + int(c) >= 2:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\ncount= 0\n\nfor i in range(n):\n A,B,C = map(int,input().split())\n if A+B+C>= 2:\n count+= 1\n\nprint(count)\n\t \t\t\t\t \t \t\t \t \t\t\t \t\t\t", "n=int(input())\nv=0\nfor i in range(n):\n a,b,c=map(int,input().split())\n if a==1 and b==1 and c==0 or a==1 and b==0 and c==1 or a==0 and b==1 and c==1 or a==b==c==1:\n v+=1\nprint(v)\n\t \t \t \t \t\t\t \t \t\t\t\t\t \t \t\t\t\t", "# Lire le nombre de problèmes\r\nn = int(input())\r\n\r\n# Initialiser le compteur de problèmes résolus\r\ncount = 0\r\n\r\n# Parcourir chaque problème\r\nfor _ in range(n):\r\n # Lire les vues de Petya, Vasya et Tonya pour le problème actuel\r\n petya, vasya, tonya = map(int, input().split())\r\n \r\n # Compter combien d'amis sont sûrs de la solution pour ce problème\r\n total_sure = petya + vasya + tonya\r\n \r\n # Si au moins deux amis sont sûrs, incrémenter le compteur\r\n if total_sure >= 2:\r\n count += 1\r\n\r\n# Imprimer le nombre de problèmes résolus\r\nprint(count)", "n= int(input())\r\nl1=[]\r\nc=0\r\nfor i in range(n):\r\n x= [int(x) for x in input().split()]\r\n l1.append(x)\r\nfor k in l1:\r\n if sum(k)>=2:\r\n c+=1\r\nprint(c)", "n = int(input())\r\ns= 0\r\nfor i in range (1,n+1):\r\n a,b,c = map(int,input().split())\r\n jumlah = a+b+c\r\n if jumlah >= 2:\r\n s+=1\r\nprint(s)", "\r\n\r\nexrs_num = int(input())\r\ncorr_exrs = 0\r\nx = []\r\nfor i in range(exrs_num):\r\n x.append(sum(map(int, input().split())))\r\nfor f in x:\r\n if f >= 2:\r\n corr_exrs += 1\r\n\r\n\r\nprint(corr_exrs)", "n=int(input())\r\nq=0\r\nfor i in range(n):\r\n t=input().split()\r\n s=0\r\n for j in t:\r\n if j=='1':\r\n s=s+1\r\n if s>=2:\r\n q=q+1\r\nprint(q)", "\r\nm = int(input())\r\ncont = 0\r\nfor _ in range(m):\r\n n = list(map(int,input().split()))\r\n a = sum(n)\r\n if(a > 1):\r\n cont+=1\r\nprint(cont)\r\n", "n = int(input())\r\n\r\nr = 0\r\n\r\nfor i in range(n):\r\n if sum(list(map(int, input().split()))) > 1 :\r\n r = r + 1\r\n else :\r\n r\r\n\r\nprint(r)", "z= int(input())\r\ncount = 0\r\nfor _ in range(z):\r\n views = list(map(int, input().split()))\r\n sure_count = sum(views)\r\n if sure_count >= 2:\r\n count += 1\r\nprint(count)\r\n", "def check(array):\r\n if len(array) > 3:\r\n return False\r\n sum = 0\r\n for i in array:\r\n sum += int(i)\r\n return sum >= 2\r\n\r\nsum_ = 0\r\nfor i in range(int(input())):\r\n answers = input().split(\" \")\r\n if check(answers):\r\n sum_ += 1\r\nprint(sum_)", "out = 0\r\nn=int(input())\r\ni=0\r\nwhile(i<n):\r\n a = input()\r\n x=int(a[0])\r\n y=int(a[2])\r\n z=int(a[4])\r\n if(x+y+z>=2):\r\n out +=1\r\n i+=1\r\n\r\nprint(out)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n votes = input()\r\n if sum(map(int,votes.split(\" \"))) > 1:\r\n count +=1\r\nprint(count)", "a = int(input())\r\nzadacha = 0\r\nfor n in range (a):\r\n a,b,c = map(int, input().split())\r\n if a and b or a and c or b and c > 0:\r\n zadacha += 1\r\nprint (zadacha)", "start=int(input())\r\ncount=0\r\nfor i in range(1,start+1):\r\n a, b, c = map(int, input().split())\r\n if (a == b == 1) or (b == c == 1) or (a == c == 1):\r\n count+=1\r\nprint(count)", "# CF_231A: Команда\r\ncount = 0\r\n\r\nfor i in range(int(input())):\r\n lsum = list(map(int, input().split()))\r\n if sum(lsum) >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\n\r\nmatrix = []\r\n\r\nfor row in range (n) :\r\n a = list(map(int, input().split(\" \")))\r\n matrix.append(a)\r\n\r\ncount = 0\r\nc = 0\r\n\r\nfor i in range (n):\r\n for j in range (3) :\r\n if matrix[i][j] == 1:\r\n c += 1\r\n if c > 1 :\r\n count += 1\r\n c = 0\r\n\r\n\r\nprint(count)", "n=int(input())\nL=[]\nfor i in range(n):\n L.append(input().split())\nc1=0\nfor i in L:\n c2=0\n for j in i:\n if j=='1':\n c2=c2+1\n if c2>=2:\n c1=c1+1\nprint(c1)\n\n", "# taking inputs\r\nn = int(input())\r\nl = [list(map(int, input().split())) for i in range(n)]\r\n\r\n# main logic\r\ncount = 0\r\nfor line in l:\r\n temp = 0\r\n for i in line:\r\n temp += i \r\n if temp>1:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\nl = 0\r\n\r\nfor i in range(n):\r\n t = input()\r\n if t.count('1') >= 2:\r\n l += 1\r\n\r\nprint(l)\r\n", "a = int(input())\r\nimplemented_count = 0\r\nfor i in range(a):\r\n p, v, t = map(int, input().split())\r\n sure_count = p + v + t\r\n if sure_count >= 2:\r\n implemented_count += 1\r\nprint(implemented_count)\r\n", "n=int(input())\r\nc=0\r\nfor i in range(n):\r\n s=0\r\n x,y,z=map(int,input().split())\r\n s=s+x+y+z\r\n if(s>=2):\r\n c+=1\r\n\r\nprint(c)\r\n", "# This is session two with GM Yahya\r\nn = int(input())\r\nsum = 0\r\nfor i in range(n):\r\n p , v , t = input().split()\r\n if int(p) + int(v) + int(t) >= 2:\r\n sum += 1\r\nprint(sum)\r\n", "n = int(input())\r\ni = 1\r\nhasil = 0\r\nwhile i <=n:\r\n m,g,x = map(int,input().split())\r\n i+=1 \r\n if m+g+x >=2:\r\n hasil+=1\r\nprint(hasil)", "n = int(input())\r\nfriends_solutions = []\r\nproblems_solutions = set()\r\n\r\nfor _ in range(n):\r\n friends_solutions.append(list(map(int, input().split())))\r\n\r\nfor i in range(n):\r\n if sum(friends_solutions[i]) >= 2:\r\n problems_solutions.add(i + 1)\r\n\r\nprint(len(problems_solutions))", "n = int(input())\r\np=0\r\nfor _ in range(n):\r\n l=list(map(int,input().split()))\r\n c=0\r\n for i in l:\r\n if(i==1):\r\n c+=1\r\n if(c>=2):\r\n p+=1\r\nprint(p) ", "a = int(input())\r\nj = 0\r\nfor k in range(a):\r\n s = input()\r\n a = int(s.find(' ',))\r\n b = s.rfind(' ', a, -1)\r\n p = int(s[0:a])\r\n v = int(s[a:b])\r\n t = int(s[b:])\r\n c = p + v + t\r\n if c > 1:\r\n j += 1\r\nprint(j)", "def z():\n n=int(input())\n count=0\n for i in range(n):\n X,Y,Z=map(int,input().split())\n if X+Y+Z>=2:\n count+=1\n print(count)\nz()\n\n \t\t \t \t \t \t \t\t \t \t \t \t \t\t \t", "solution = 0\r\nk = 1\r\nn = int(input())\r\nwhile k <= n :\r\n line = input()\r\n op = line.split()\r\n opl = [int(num) for num in op]\r\n if sum(opl) >= 2 :\r\n solution = solution + 1\r\n k = k + 1\r\nprint(solution)\r\n", "n = int(input())\r\nc_total = 0\r\nfor i in range(n):\r\n s = input()\r\n c_str = 0\r\n for l in s:\r\n if l == '1':\r\n c_str += 1\r\n if c_str >= 2:\r\n c_total += 1\r\nprint(c_total)", "a=int(input())\r\nc=0\r\nfor i in range(a):\r\n x,y,z=map(int,input().split())\r\n if x+y+z>=2:\r\n c+=1\r\nprint(c)", "# Input: Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize a variable to store the count of problems they will implement\r\ncount = 0\r\n\r\n# Loop through each problem\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split()) # Read Petya's, Vasya's, and Tonya's views\r\n # Check if at least two of them are sure about the solution\r\n if p + v + t >= 2:\r\n count += 1\r\n\r\n# Output: Print the number of problems they will implement\r\nprint(count)\r\n", "c=0\r\nfor _ in range(int(input())):\r\n l = list(map(int,input().split()))\r\n if(sum(l)>1):\r\n c+=1\r\nprint(c)", "t = int(input())\r\nco = 0\r\nfor i in range(t) : \r\n a,b,c = map(int,input().split())\r\n if (a==1 and b==1) or (a==1 and c==1) or (b==1 and c==1) :\r\n co += 1\r\n elif a==1 and b==1 and c==1 :\r\n co += 1\r\nprint(co)", "n = int(input())\r\nmatrix = []\r\ncnt = 0\r\nfor i in range(n):\r\n temp_list = list(map(int, input().split()))[:3]\r\n matrix.append(temp_list)\r\n if sum(temp_list)>=2:\r\n cnt += 1\r\nprint(cnt)", "line = int(input())\r\ngrid = []\r\nfor i in range(line):\r\n number = input().split()\r\n for l in range(len(number)):\r\n grid.append(int(number[l]))\r\n \r\n# print(grid)\r\na = 0\r\nsolution = 0\r\nfor i in range(0, len(grid), 3):\r\n # print(i)\r\n a = grid[i] + grid[i+1] + grid[i+2]\r\n # print(a)\r\n if a >= 2:\r\n solution = solution + 1\r\nprint(solution)\r\n", "task = int(input(''))\r\nc = 0\r\nfor i in range(0,task):\r\n k,l,m = map(int,input().split())\r\n if k+l+m >= 2:\r\n c+=1 \r\nprint(c)\r\n\r\n\r\n", "n = int(input())\r\nmatrix = [[] for i in range (0,n)]\r\ngeneral_count = 0\r\nfor i in range(0,n):\r\n matrix[i] = input().split()\r\nfor i in range(0,n):\r\n count = 0\r\n for j in range(0,3):\r\n if matrix[i][j] == '1':\r\n count = count + 1\r\n if count >= 2:\r\n general_count = general_count + 1\r\nprint(general_count)", "n = int(input())\r\nhow_range = 0\r\nfor i in range(n):\r\n a,b,c = map(int, input().split())\r\n if (a + b + c ) >= 2:\r\n how_range += 1\r\nprint(how_range)", "n = int(input())\r\nres = 0\r\n\r\nfor i in range(n):\r\n s = sum([int(i) for i in input().split(\" \")])\r\n\r\n if s >= 2:\r\n res += 1\r\n\r\nprint(res)", "n=int(input())\r\n\r\np=0\r\nfor i in range (n):\r\n a,b,c=input().split()\r\n a=int(a)\r\n b=int(b)\r\n c=int(c)\r\n if a+b+c>=2:\r\n p=p+1\r\nprint(p)\r\n \r\n", "n = int(input())\r\nk = 0\r\nfor _ in range(n):\r\n L = tuple(map(int, input().split()))\r\n a, b, c = L\r\n if (a*b or a*c or b*c or a*b*c):\r\n k += 1\r\nprint(k)\r\n", "problems = int(input(''))\ntotalProblems = 0\n# for i in range(problems):\n# u1 = int(input(''))\n# u2 = int(input(''))\n# u3 = int(input(''))\n# if u1+u2+u3 >= 2:\n# totalProblems += 1\n# print(totalProblems)\n\nfor i in range(problems):\n uinput = input('')\n num1 = int(uinput[0])\n num2 = int(uinput[2])\n num3 = int(uinput[4])\n if num1+num2+num3 >= 2:\n totalProblems += 1\nprint(totalProblems)\n", "a = int(input(''))\r\nc = 0\r\nfor i in range(0,a):\r\n k,l,m = map(int,input().split())\r\n if k+l+m>1:\r\n c+=1\r\nprint(c)", "n=int(input())\r\nl1=0\r\nfor i in range(n):\r\n s=input()\r\n l=s.split()\r\n nl=[int(value) for value in l]\r\n if sum(nl)>=2:\r\n l1+=1 \r\n else:\r\n l1+=0\r\nprint(l1)", "n = int(input())\r\nallViews = []\r\n\r\nfor i in range(n):\r\n allViews.append(input().split(\" \"))\r\n\r\nk=0\r\nfor i in allViews:\r\n res = [eval(i) for i in i]\r\n if sum(res)>=2:\r\n k+=1\r\n\r\nprint(k)", "n = int(input())\r\na=[]\r\nk=0\r\nfor e in range(n):\r\n x=str(input())\r\n a.append(x)\r\nfor i in range(len(a)):\r\n if a[i].count('1')>=2:\r\n k+=1\r\nprint(k)", "m=int(input())\r\nresult=0\r\nfor _ in range(m):\r\n dic={0:0,1:0}\r\n a,b,c=map(int,input().split(' '))\r\n dic[a]=dic.get(a)+1\r\n dic[b]=dic.get(b)+1\r\n dic[c]=dic.get(c)+1\r\n if dic[1]>=2:\r\n result+=1\r\n else:\r\n continue\r\nprint(result)", "def func(a,b,c):\n if(a==1 and b==1) or (a==1 and c==1) or (b==1 and c==1):\n return 1\n else:\n return 0\nn=int(input())\nc=0\nfor i in range(n):\n x,y,z=map(int,input().split())\n c=c+(int(func(x,y,z)))\nprint(c)\n \t \t \t \t \t \t\t \t \t\t\t \t\t\t", "x=int(input())\r\ny=0\r\nfor _ in range(x):\r\n v=str(input())\r\n n=0\r\n for i in v:\r\n if i==\"1\":\r\n n+=1\r\n if (n>=2):\r\n y+=1\r\n \r\nprint(y)", "c = 0\r\nfor i in range(int(input())):\r\n if input().count('1') > 1:\r\n c += 1\r\nprint(c)", "x = int(input())\r\ncounter = 0\r\nfor i in range(x):\r\n tst = str(input())\r\n if tst.count('1') >=2:\r\n counter +=1\r\n \r\nprint(counter) ", "n=int(input())\r\ng=[]\r\nfor i in range(n):\r\n a=[]\r\n a=list(map(int,input().split()))\r\n d=0\r\n for j in range(3):\r\n if(a[j]!=0):\r\n d=d+1\r\n g.append(d)\r\n\r\nc=0\r\nfor k in range(n):\r\n if(g[k]>=2):\r\n c=c+1\r\nprint(c)", "si=int(input())\r\nct=0\r\nfor i in range(si):\r\n p,q,r=map(int,input().split())\r\n if p+q+r>=2:\r\n ct+=1\r\nprint(ct)\r\n", "n = int(input())\r\ncntres = 0\r\nfor i in range(n):\r\n first, second, third = map(int, input().split())\r\n cnt1 = 0\r\n if first == 1:\r\n cnt1 += 1\r\n if second == 1:\r\n cnt1 += 1\r\n if third == 1:\r\n cnt1 += 1\r\n if cnt1 >= 2:\r\n cntres += 1\r\nprint(cntres)", "inp = int(input())\r\ncount = 0\r\nfor i in range(inp):\r\n string = input()\r\n if ('0' not in string) or ('1 1' in string) or ('1 0 1' == string):\r\n count += 1\r\nprint(count)", "# Task's Link / https://codeforces.com/problemset/problem/231/A\r\n\r\nn = int(input())\r\n\r\ncounter = 0\r\nfor _ in range(n):\r\n sn = input()\r\n if sn.count('1') >= 2:\r\n counter += 1\r\nprint(counter)\r\n", "def doQuestion(n):\r\n total = 0\r\n for i in n:\r\n total += int(i)\r\n return total >= 2\r\n\r\n\r\nt = int(input())\r\ncount = 0\r\nfor _ in range(t):\r\n n = input().split()\r\n if doQuestion(n):\r\n count += 1\r\nprint(count)\r\n", "ans = 0\r\nfor _ in range(int(input())):\r\n a = list(map(int,input().split()))\r\n count = sum(a)\r\n if count >= 2:\r\n ans += 1\r\n else:\r\n ans += 0\r\nprint(ans)\r\n\r\n\r\n", "questions = int(input())\r\ntotal = 0\r\nwhile questions:\r\n answers = input()\r\n answers = list(map(int, answers.split(' ')))\r\n answers = answers.count(1)\r\n\r\n if (answers > 1): total += 1\r\n questions -= 1\r\n\r\nprint(total) ", "def prob_and_answers(num_of_prob):\r\n choices_l = []\r\n for _ in range(num_of_prob):\r\n answer = input()\r\n choices_l.append([int(_) for _ in answer.split(\" \")])\r\n return choices_l\r\n\r\ndef implementations(choices_l):\r\n count = 0\r\n for _ in range(num_of_prob):\r\n if sum(choices_l[_]) >= 2:\r\n count += 1\r\n else:\r\n continue\r\n return count\r\n\r\nnum_of_prob = int(input())\r\nprint(implementations(prob_and_answers(num_of_prob)))", "def do(_):\r\n return sum(int(x) for x in input().split()) > 1\r\n\r\n\r\nn = range(int(input()))\r\nans = sum(map(do, n))\r\nprint(ans)\r\n", "t = int(input())\r\ncnt = 0\r\nfor i in range(t):\r\n x, y, z = input().split(\" \")\r\n if int(x) + int(y) + int(z) >= 2: cnt += 1\r\nprint(cnt)\r\n", "counter2=0\r\nfor i in range(int(input())):\r\n x=input()\r\n counter1=0\r\n for j in x:\r\n if j==\" \":\r\n continue\r\n elif int(j)==1:\r\n counter1+=1\r\n if counter1>=2:\r\n counter2+=1\r\nprint(counter2)\r\n\r\n\r\n", "n = int(input())\r\nsum2 = 0\r\nfor i in range(n):\r\n inp = str(input())\r\n inp = inp.split(\" \")\r\n sum1 = 0\r\n for elt in inp:\r\n if elt =='1':\r\n sum1 +=1\r\n if sum1>=2:\r\n sum2 +=1\r\nprint(sum2)\r\n\r\n", "rounds = int(input())\r\n\r\nsum = 0\r\n\r\nfor index in range(rounds):\r\n petya, vasya, tonya = [int(oneorzero) for oneorzero in input().split()]\r\n if petya + vasya + tonya >= 2:\r\n sum += 1\r\n\r\nprint(sum)", "n = int(input())\r\np = 0\r\nfor i in range(n):\r\n s = input()\r\n if s.count(\"1\")>=2:\r\n p+=1\r\nprint(p)\r\n\r\n \r\n", "probs = []\r\nnprobs = int(input())\r\nfor i in range(nprobs):\r\n assurance = input()\r\n probs.append(assurance)\r\nn = 0\r\nfor j in probs:\r\n if j.count(\"1\") >= 2:\r\n n += 1\r\nprint(n)", "x = int(input())\r\ntotal = 0\r\nfor i in range(0, x):\r\n p = input()\r\n if p.count('1') >= 2:\r\n total += 1\r\nprint(total)", "my_list = []\r\n\r\nproblem_number = int(input())\r\nif 1 <= problem_number <= 1000:\r\n for i in range(problem_number):\r\n x, y, z = map(int, input().split())\r\n if x + y + z >= 2:\r\n my_list.append(1)\r\n else:\r\n my_list.append(0)\r\n\r\nif 1 <= problem_number <= 1000:\r\n print(sum(my_list))\r\n", "n = int(input())\r\nc = 0\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n aa = a.count(1)\r\n if aa >= 2:\r\n \tc += 1\r\nprint(c)", "a=int(input())\r\nk=0\r\ns=0\r\nfor i in range(a):\r\n b=list(map(int,input().split()))\r\n for x in range (3):\r\n if b[x]==1:\r\n k+=1\r\n if k >= 2:\r\n s+=1\r\n k=0\r\nprint(s)", "num = int(input())\r\nans = 0\r\nfor x in range(num):\r\n (p,v,t) = input().split()\r\n p = int(p)\r\n v = int(v)\r\n t = int(t)\r\n if p+v+t >=2:\r\n ans+=1\r\nprint(ans)\r\n ", "def dadd(n):\r\n total = 0\r\n for i in range(n):\r\n l = input().split()\r\n l = [int(x) for x in l]\r\n if sum(l) >= 2:\r\n total += 1\r\n return total\r\n\r\nn = int(input())\r\nprint(dadd(n))", "n=int(input())\r\nans=0\r\nfor i in range(n):\r\n x=input()\r\n nb_1=int(x[0])\r\n nb_2=int(x[2])\r\n nb_3=int(x[4])\r\n sm=nb_3+nb_2+nb_1\r\n if sm >=2:\r\n ans=ans+1\r\nprint(ans)", "n = int(input())\r\ncounter = 0\r\nfor i in range(0, n):\r\n k = input()\r\n if k.count(\"1\") >= 2:\r\n counter += 1\r\n\r\nprint(counter)\r\n\r\n\r\n", "r = 0\n\nfor i in range(int(input())):\n\tif sum([int(i) for i in input().split(\" \")]) >= 2:\n\t\tr+=1\n\n\nprint(r)\n", "# Input\r\nn = int(input())\r\n\r\n# Count the number of problems each friend is sure about\r\ncount_sure = 0\r\n\r\nfor _ in range(n):\r\n p, v, t = map(int, input().split())\r\n # Check if at least two friends are sure about the solution\r\n if p + v + t >= 2:\r\n count_sure += 1\r\n\r\n# Output\r\nprint(count_sure)\r\n", "n = int(input())\nans = 0\nfor i in range(n):\n a = input()\n if int(a[0]) + int(a[2]) + int(a[4]) > 1:\n ans += 1\n\nprint(ans)\n", "ProblemCount = int(input())\r\nAcceptedSolutions = 0\r\n\r\nfor i in range(ProblemCount):\r\n Problems = input().split(\" \")\r\n Votes = 0\r\n\r\n for Vote in Problems:\r\n if Vote == \"1\":\r\n Votes += 1\r\n\r\n if Votes >= 2:\r\n AcceptedSolutions += 1\r\n\r\nprint(AcceptedSolutions)\r\n", "n = int(input())\r\ncnt = 0\r\nfor i in range(n):\r\n x = [int(a) for a in input().split()]\r\n if sum(x) >= 2:\r\n cnt+=1\r\nprint(cnt)\r\n ", "num_problems = int(input()) # Number of problems\nproblem_count = 0 # Initialize the count of problems they will implement\n\nfor _ in range(num_problems):\n pet, vas, ton = map(int, input().split())\n \n # Count how many friends are sure about the solution\n sure_count = pet + vas + ton\n \n # If at least two friends are sure, increment the count\n if sure_count >= 2:\n problem_count += 1\n\nprint(problem_count)\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\nc=0\r\nk=0\r\nfor i in range(n):\r\n a=list(map(int,input().split()))\r\n for j in range(3):\r\n if a[j]==1:\r\n c+=1\r\n if c>=2:\r\n k+=1\r\n c=0\r\n else:\r\n c=0\r\nprint(k)", "a = int(input(''))\r\ncount = 0\r\nfor i in range(a):\r\n x, y, z = [int(j) for j in input(\"\").split()]\r\n l = [x,y,z]\r\n if l.count(1) >=2:\r\n count+=1\r\nprint(count)\r\n \r\n", "ans=0\r\nfor i in range(int(input())):\r\n count=0\r\n s=input().replace(\" \",\"\")\r\n if \"11\" in s or \"101\" in s:\r\n ans+=1\r\nprint(ans)", "n = int(input())\nres = 0\nfor _ in range(n):\n temp = list(map(int,input().split()))\n count = 0\n for i in temp:\n if(i==1):\n count+=1\n if(count>=2):\n res+=1\nprint(res)", "t = int(input())\r\ncount = 0\r\n\r\nfor i in range(t):\r\n s = input()\r\n\r\n c = 0\r\n for j in range(len(s)):\r\n if s[j] == '1':\r\n c = c + 1\r\n\r\n if c > 1:\r\n count = count + 1\r\n\r\nprint(count)\r\n", "n, s, a, c = int(input()), 0, [], 0\r\nwhile n > s:\r\n s += 1\r\n a.append(input())\r\nfor i in a:\r\n if int(i[0]) + int(i[2]) + int(i[4]) >= 2:\r\n c += 1\r\n else:\r\n continue\r\nprint(c)\r\n", "n = int(input())\r\nscore=0\r\nfor i in range (n):\r\n a,b,c = map(int,input().split())\r\n s = a+b+c\r\n if s >= 2 :\r\n score+=1\r\nprint(score)", "n=int(input())\r\ntotal=0\r\nfor i in range (n):\r\n x=input()\r\n if x.count('1')>=2:\r\n total=total+1\r\nprint(total)", "a = int(input())\r\nx = 0\r\nfor i in range(a):\r\n one = 0\r\n zero = 0\r\n lists = list(map(int, input().split()))\r\n for i in lists:\r\n if i == 0:\r\n zero += 1 \r\n else:\r\n one += 1\r\n if one>zero:\r\n x += 1\r\n\r\nprint(x)", "t=int(input())\r\na=0\r\nfor i in range(0,t):\r\n\tn=list(map(int,input().split()))\r\n\tif sum(n)>=2:\r\n\t\ta=a+1\r\nprint(a) ", "n = int(input())\r\nanswer = 0\r\nfor _ in range(n):\r\n line = input()\r\n line = map(int, line.split(' '))\r\n if sum(line)>=2:\r\n answer+=1\r\nprint(answer)", "n=int(input())\r\nls=[]\r\nfor i in range(n):\r\n k=list(map(int,input().split()))\r\n ls.append(k)\r\ncount=0 \r\nfor j in ls:\r\n d=j[0]+j[1]+j[2]\r\n if d>=2:\r\n count+=1\r\n \r\nprint(count)", "n=int(input())\ncount=0\nwhile n>0:\n n-=1\n s=input()\n c=0\n for i in s:\n if i=='1':\n c+=1\n if c>=2:\n count+=1\nprint(count) \n \t\t\t \t\t\t\t\t \t\t \t \t\t\t\t\t", "loop = int(input())\r\nsum = 0\r\nfor i in range(loop):\r\n thing = list(map(int, input().split()))\r\n if thing[0] + thing[1] + thing[2] >= 2:\r\n sum += 1\r\nprint(sum)", "n = int(input())\r\ncnt = 0\r\n\r\nfor i in range(n):\r\n x, y, z = map(int, input().split())\r\n if x + y + z >= 2:\r\n cnt += 1\r\nprint(cnt)\r\n", "a=int(input(\"\"))\r\nn=0\r\nfor i in range(a):\r\n b=0\r\n str=input(\"\")\r\n y=str.split()\r\n for i in y:\r\n b+=int(i)\r\n if b>1:\r\n n+=1\r\nprint(n)", "n = int(input())\r\n\r\nans = 0\r\nfor i in range(0,n):\r\n a,b,c = map(int,input().split())\r\n if a + b + c >= 2:\r\n ans = ans + 1\r\nprint(ans)", "import sys\r\ninputData = sys.stdin.readlines()[1:]\r\ncounter = 0\r\nfor line in inputData:\r\n if sum(list(map(int,line.split())))>=2:\r\n counter +=1\r\nprint(counter)", "n = int(input())\r\no = 0\r\nfor i in range(n):\r\n a, b, c = map(int, input().split())\r\n if a+b+c > 1:\r\n o += 1\r\nprint(o)", "a=input()\r\nb=[]\r\nfor i in range(int(a)):\r\n c=input()\r\n b.append(c)\r\nd=0\r\nfor i in range(int(a)):\r\n k=b[i]\r\n n=k.count(\"1\")\r\n if(n>=2):\r\n d+=1\r\nprint(d)", "'''\n\n Online Python Compiler.\n Code, Compile, Run and Debug python program online.\nWrite your code in this editor and press \"Run\" button to execute it.\n\n'''\nt=int(input())\ns=0\nfor i in range(t):\n a,b,c=map(int,input().split())\n if a+b+c>=2:\n s+=1\nprint(s)", "total = int(input())\r\ncount = 0\r\n\r\nfor _ in range(total):\r\n if sum(list(map(int,input().split()))) > 1:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nans =0\r\nfor i in range(n) :\r\n z = list(map(int,input().split()))\r\n c = z.count(1)\r\n if c >= 2 :\r\n ans +=1\r\nprint(ans)\r\n ", "n = int(input())\r\nmainL=[]\r\nfor i in range(n):\r\n L=[]\r\n s=input().split()\r\n for i in s:\r\n L.append(int(i))\r\n mainL.append(L)\r\na = 0\r\nfor i in mainL:\r\n c = 0\r\n for j in i:\r\n if j==1:\r\n c+=1\r\n if c>=2:\r\n a+=1\r\nprint(a)\r\n ", "n = int(input())\r\nsum_lst = 0\r\nfor i in range(n):\r\n s = input()\r\n lst = list(s.split())\r\n if sum(list(map(int, lst))) >= 2:\r\n sum_lst += 1\r\n\r\nprint(sum_lst)", "n =int(input())\r\ny=[]\r\nfor i in range(1,n+1):\r\n x=map(int, input().split())\r\n y.append(x)\r\ncount=0\r\nanscount=0\r\nfor i in y:\r\n count=0\r\n for j in i:\r\n if j == 1:\r\n count+=1\r\n if count>=2:\r\n anscount+=1\r\n count=0\r\n break\r\nprint(anscount)\r\n", "def solve(word):\r\n if len(word) <= 10 : return word\r\n \r\n return f\"{word[0]}{len(word)-2}{word[-1]}\"\r\n\r\nn = int(input())\r\n\r\np = 0\r\nfor _ in range(n):\r\n s = sum(map(int, input().split()))\r\n if s >= 2:\r\n p += 1\r\n\r\nprint(p)\r\n\r\n", "n = int(input())\r\ng = int(0)\r\nfor i in range(n):\r\n h = int(0)\r\n x = list(map(int, input().split()))\r\n h = x[0] + x[1] + x[2]\r\n if h>=2:\r\n g = g + 1\r\nprint(g)\r\n ", "n = int(input()) # Number of problems\ncount = 0 \nfor _ in range(n):\n p, v, t = map(int, input().split()) # Read Petya's, Vasya's, and Tonya's views\n if p + v + t >= 2: # Check if at least two of them are sure\n count += 1\n\nprint(count)\n\n \t \t \t\t\t \t \t\t \t \t \t \t", "n = int(input())\r\nx=0\r\nfor i in range(n):\r\n ch = input()\r\n if ch.count('1') >= 2:\r\n x += 1\r\nprint(x)", "a=int(input())\ni=0\ne=0\nwhile(i!=a):\n b,c,d=str(input()).split()\n i+=1\n if(int(b)+int(c)+int(d)>=2):\n e+=1\nprint(e)\n ", "x=int(input())\r\nc1=0\r\nfor _ in range(x):\r\n a,b,c=map(int,input().split())\r\n if a==b==1 or b==c==1 or a==c==1:\r\n c1+=1\r\nprint(c1) \r\n\r\n\r\n\r\n", "sum=0\r\nn = int(input())\r\nfor _ in range(n):\r\n p = input()\r\n sure=0\r\n for i in list(map(int,p.split())):\r\n sure+=i\r\n if sure>=2:\r\n sum+=1\r\nprint(sum)", "n = int(input())\r\n\r\nmatrix = []\r\n\r\nfor row in range (n) :\r\n a = list(map(int, input().split(\" \")))\r\n matrix.append(a)\r\n\r\ncount = 0\r\n\r\nfor row in range (n):\r\n if sum(matrix[row]) >= 2:\r\n count += 1\r\n\r\nprint(count)", "a = int(input())\r\nx = []\r\nc = 0\r\nk = 0\r\nfor i in range(a):\r\n x = input().split()\r\n if int(x[0]) == 1:\r\n k += 1\r\n if int(x[1]) == 1:\r\n k += 1\r\n if int(x[2]) == 1:\r\n k += 1\r\n if k>=2:\r\n c += 1\r\n k = 0\r\n x.clear()\r\nprint(c)", "n = int(input())\r\nimplemented = 0\r\n\r\nfor _ in range(n):\r\n sure = list(map(int , input().split()))\r\n if sure.count(1) >= 2:\r\n implemented += 1\r\n\r\nprint(implemented)", "n = int(input())\r\ncount = 0\r\nfor i in range(n):\r\n p, v, t = map(int, input().split())\r\n res = p + v + t\r\n if res >= 2:\r\n count += 1\r\nprint(count)\r\n", "fila = int(input(\"\"))\r\ntotal = 0\r\nfor n in range(0, fila):\r\n entrada = input(\"\").split()\r\n num1 = int(entrada[0])\r\n num2 = int(entrada[1])\r\n num3 = int(entrada[2])\r\n solution = num1 + num2 + num3\r\n if solution >= 2:\r\n total = total + 1\r\n\r\nprint(total)", "inp1 = int(input())\r\nct = 0\r\nfor i in range(inp1):\r\n inp = list(map(int, input().split()))\r\n ct2 = 0\r\n for j in inp:\r\n if j == 1:\r\n ct2 += 1\r\n if ct2 > 1:\r\n ct += 1\r\nprint(ct)\r\n", "n=int(input())\r\nk=0\r\nfor _ in range(n):\r\n numbers = [int(i) for i in input().split()]\r\n if sum(numbers) >=2:\r\n k+=1\r\nprint(k)", "n=int(input())\r\nl=0\r\nfor i in range(n):\r\n c=0\r\n for i in (list(map(int,input().split()))):\r\n if i>0:\r\n c+=1\r\n if c>=2:\r\n l+=1\r\nprint(l)\r\n", "count=0\r\nfor i in range(int(input())):\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n if(l[-1]==1 and l[-2]==1):\r\n count=count+1\r\nprint(count) \r\n", "# Read the number of problems\nn = int(input())\n\n# Initialize a variable to count the number of problems to be implemented\ncount = 0\n\n# Iterate through each problem\nfor _ in range(n):\n # Read the three integers representing the friends' views\n views = list(map(int, input().split()))\n\n # Check how many friends are sure about the solution for this problem\n sure_count = sum(views)\n\n # If at least two friends are sure, increment the count\n if sure_count >= 2:\n count += 1\n\n# Print the number of problems to be implemented\nprint(count)\n\n#python\n \t \t\t\t \t \t\t \t \t \t \t\t \t \t\t \t", "#X\nn = int(input())\ncount = sum(1 for _ in range(n) if sum(map(int, input().split())) >= 2)\nprint(count)\n\n \t \t \t\t \t \t\t\t \t \t \t\t\t\t \t\t", "nombre_problemes = int(input())\ndef solve(a):\n if sum(a)>=2:\n return True\n \nresolu = 0\nfor i in range(nombre_problemes):\n decision = [int(_) for _ in input().split()]\n if solve(decision):\n resolu += 1\nprint(resolu)", "n=int(input())\r\nr=0\r\nfor i in range(n):\r\n w=input().split()\r\n if int(w[0])+int(w[1])+int(w[2])>=2:\r\n r+=1\r\nprint(r)\r\n", "problems_qnt = int(input())\r\nproblems_solved = 0\r\n\r\nfor i in range (problems_qnt):\r\n petya, vasya, tonya = map(int, input().split())\r\n\r\n count = 0\r\n for num in petya, vasya, tonya:\r\n if num == 1:\r\n count += 1\r\n \r\n if count >= 2:\r\n problems_solved += 1\r\n \r\n\r\nprint(problems_solved)", "a=int(input())\r\nq=0\r\nfor i in range(a):\r\n w=input()\r\n if w.count('1')>1:q+=1\r\nprint(q)", "count=0\r\nfor j in range(int(input())):\r\n list1=list(map(int,input().split(\" \")))\r\n if sum(list1)>=2:\r\n count+=1\r\nprint(count)\r\n\r\n", "n=int(input())\r\nk=0\r\nfor i in range (n):\r\n input_str = input(\"\")\r\n input_list = input_str.split()\r\n if int(input_list[0])+int(input_list[1])+int(input_list[2])>=2:\r\n k=k+1\r\nprint(k)", "# Lire le nombre de problèmes\r\nn = int(input())\r\n\r\n# Initialiser le compteur de problèmes résolus\r\nproblems_solved = 0\r\n\r\n# Parcourir chaque problème\r\nfor _ in range(n):\r\n # Lire les opinions des amis pour le problème actuel\r\n opinions = list(map(int, input().split()))\r\n\r\n # Compter le nombre d'amis sûrs de la solution\r\n sure_count = sum(opinions)\r\n\r\n # Si au moins deux amis sont sûrs, incrémenter le compteur de problèmes résolus\r\n if sure_count >= 2:\r\n problems_solved += 1\r\n\r\n# Imprimer le résultat\r\nprint(problems_solved)", "n = int(input())\r\nar = 0\r\nfor i in range(n):\r\n\r\n arr = list(map(int, input().split()))\r\n v = sum(arr)\r\n if v >= 2:\r\n ar += 1\r\nprint(ar)\r\n", "chifra = int(input())\r\nsymma = 0\r\nfor t in range(chifra):\r\n gg = input() \r\n odin = int(gg[0])\r\n dva = int(gg[2])\r\n tree = int(gg[4])\r\n if odin+dva+tree>=2:\r\n symma += + 1\r\nprint (f\"{symma}\")", "t=int(input())\r\nc=0\r\nfor i in range(t):\r\n a=input().split()\r\n if a.count(\"1\")>1:\r\n c+=1\r\nprint(c)", "x = int(input())\r\nimplement = 0\r\nfor i in range(x):\r\n answers = []\r\n p,v,t = input().split()\r\n answers.append(int(p))\r\n answers.append(int(v))\r\n answers.append(int(t))\r\n if answers.count(1) > answers.count(0):\r\n implement += 1\r\n\r\nprint(implement)", "def number_of_problems_to_implement(n, problems):\n count = 0\n\n for i in range(n):\n sure_count = problems[i].count(1)\n if sure_count >= 2:\n count += 1\n\n return count\nn = int(input())\nproblems = []\nfor _ in range(n):\n views = list(map(int, input().split()))\n problems.append(views)\nresult = number_of_problems_to_implement(n, problems)\nprint(result)\n\n\t\t \t \t\t \t \t\t \t \t \t \t \t\t\t", "n = int(input())\r\nk = 0\r\nfor i in range(n):\r\n inp = input()\r\n l = inp.split(' ')\r\n for i in range(len(l)):\r\n l[i]=int(l[i])\r\n if sum(l)>=2:\r\n k = k+1\r\nprint(k)\r\n\r\n\r\n \r\n \r\n\r\n\r\n\r\n\r\n\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())\nres = 0\nfor _ in range(n):\n i = input()\n tmp = i.split().count(\"1\")\n if tmp >= 2:\n res += 1\nprint(res)", "from collections import Counter\r\n\r\nsoln = 0\r\nn = int(input())\r\ns = []\r\n\r\nfor i in range(n):\r\n x = [ int(x) for x in input().split()]\r\n s.append(x)\r\n\r\nfor _ in range(n):\r\n if s[_].count(1) >= 2:\r\n soln += 1\r\n\r\nprint(soln)", "n = int(input())\r\narr = []\r\n\r\nfor i in range(n):\r\n arr.append([int(x) for x in input().split()])\r\n\r\nnum_problems = 0\r\nfor pro in arr:\r\n # least two friend sure about solution\r\n if sum(pro) >= 2:\r\n num_problems += 1\r\nprint(num_problems)\r\n", "n=int(input())\r\nans=0\r\nfor _ in range(n):\r\n a,b,c=map(int,input().split())\r\n s=a+b+c\r\n if s>1:\r\n ans+=1\r\nprint(ans)", "cnt=0\r\nfor i in range(int(input())):\r\n lst=list(map(int,input().split()))\r\n if lst.count(1)>1:\r\n cnt+=1\r\nprint(cnt)", "def checker(l):\r\n o=0\r\n for i in l:\r\n o+=int(i)\r\n if o>=2:\r\n return 1\r\n return 0\r\nn=int(input())\r\nz=0\r\nfor i in range(n):\r\n lst=input().split()\r\n z+=checker(lst)\r\nprint(z)", "n=int(input())\r\nsumi=0\r\nfor i in range(n):\r\n z=list(map(int,input().split()))\r\n if 2<=z.count(1):\r\n sumi+=1\r\nprint(sumi)", "n = int(input())\r\ncount = 0\r\nfor _ in range(n):\r\n inp = str(input())\r\n x = inp.split()\r\n if x.count('1') >1:\r\n count+=1\r\nprint(count)", "a = int(input())\r\ncount = 0\r\nfor i in range(a):\r\n x, y, z = map(int, input().split())\r\n\r\n if z + y + x >= 2:\r\n count += 1\r\nprint(count)\r\n", "def check():\r\n a, b, c = map(int, input().split())\r\n add = a+b+c\r\n if add >=2:\r\n return True\r\n else:\r\n return False\r\n \r\nask = int(input())\r\nx = 0\r\nfor i in range(ask):\r\n x += int(check())\r\nprint(x)", "print(sum(1 for _ in range(int(input())) if input().split().count('1') >= 2))", "a=int(input())\r\nc=[]\r\nfor n in range(0,a):\r\n b=input().split()\r\n if b.count('1')>=2:\r\n c.append(1)\r\nprint(sum(c))", "test=int(input())\r\nl=[]\r\nfor x in range(test):\r\n a=list(map(eval,input().split()))\r\n l.append(a)\r\n \r\n \r\n\r\nd=0\r\nfor x in range(test):\r\n c=0\r\n for i in range(3):\r\n if l[x][i]==1:\r\n c=c+1\r\n \r\n if c>=2:\r\n d=d+1\r\n \r\nprint(d)\r\n ", "n = int(input())\r\ncounter = 0\r\nfor i in range(n):\r\n s = input()\r\n if (int(s[0]) + int(s[2]) + int(s[4])) >= 2:\r\n counter += 1\r\nprint(counter)", "number_of_problem = int(input(\"\"))\r\nPetya = 0\r\nVasya = 0\r\nTonya = 0\r\nnumber_of_sol = 0\r\n\r\nfor i in range(number_of_problem):\r\n Petya = 0\r\n Vasya = 0\r\n Tonya = 0\r\n\r\n team_slo = input('')\r\n team_slo = team_slo.split(\" \")\r\n Petya = int(team_slo[0])\r\n Vasya = int(team_slo[1])\r\n Tonya = int(team_slo[2])\r\n \r\n if Petya + Vasya + Tonya == 0 or Petya + Vasya + Tonya == 1 :\r\n pass\r\n else:\r\n \r\n number_of_sol += 1\r\n \r\n team_slo = 0\r\n\r\nprint(number_of_sol)\r\n \r\n", "# Read the number of problems\r\nn = int(input())\r\n\r\n# Initialize a counter for the problems to be implemented\r\nproblems_to_implement = 0\r\n\r\n# Loop through each problem\r\nfor _ in range(n):\r\n views = list(map(int, input().split()))\r\n \r\n # Count how many friends are sure about the solution\r\n sure_count = sum(views)\r\n \r\n # Check if at least two friends are sure\r\n if sure_count >= 2:\r\n problems_to_implement += 1\r\n\r\n# Print the number of problems to be implemented\r\nprint(problems_to_implement)\r\n", "import sys\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 return input().strip()\r\n\r\n\r\ndef out(x):\r\n sys.stdout.write(str(x) + \"\\n\")\r\n\r\n\r\ndef main():\r\n count = inp()\r\n\r\n problem = 0\r\n for _ in range(count):\r\n input_view = insr()\r\n input_view = input_view.split()\r\n input_view = [int(i) for i in input_view]\r\n weight = sum(input_view)\r\n if weight >= 2:\r\n problem += 1\r\n out(problem)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\ncount=0\r\nfor i in range(n):\r\n i=list(map(int, input().split()))\r\n if i==[1,1,0] or i==[0,1,1] or i==[1,0,1] or i==[1,1,1]:\r\n count += 1\r\nprint(count)", "a = int(input())\r\n\r\nb = [list(map(int, input().split())) for _ in range(a)]\r\n\r\ncounter = 0\r\nfor i in b:\r\n count = sum(i)\r\n\r\n if count >= 2:\r\n counter += 1\r\n\r\nprint(counter)", "n = int(input())\r\n\r\ncompleted_works = 0\r\n\r\nfor i in range(n):\r\n stdin = input().split()\r\n stdin = list(map(int, stdin))\r\n if stdin.count(1) > 1:\r\n completed_works += 1\r\n\r\nprint(completed_works)\r\n", "n = int(input())\r\n\r\nx = 0\r\n\r\nfor i in range(n):\r\n a,b,c = map(int, input().split(\" \",))\r\n if a + b + c >= 2:\r\n x += 1\r\n else:\r\n x += 0\r\n\r\nprint(x)\r\n", "banyak = int(input())\r\njawab = []\r\nfor i in range (banyak):\r\n satu,dua,tiga=map(int,input().split())\r\n kun = [satu,dua,tiga]\r\n je = []\r\n for k in kun:\r\n if k == 1:\r\n je.append(k)\r\n if len(je) >= 2:\r\n jawab.append('a')\r\nprint(len(jawab))", "n = int (input ())\r\nsolvablePs = 0\r\n\r\nfor i in range (n) :\r\n inpStr = str (input ())\r\n workList = inpStr.split ()\r\n for j in range (len(workList)) :\r\n workList [j] = int (workList [j])\r\n indicator = sum (workList)\r\n if indicator >= 2 :\r\n solvablePs = solvablePs + 1\r\n \r\nprint (solvablePs)", "n=int(input())\ncounter=0\nwhile n!=0:\n n-=1\n data=input().split()\n num=data.count(\"1\")\n if num > int(1):\n counter+=1\n \nprint(counter)", "a = int(input())\r\ne = 0\r\nf = 0\r\nfor i in range(a):\r\n b,c,d = map(int, input().split())\r\n if(b == 1):\r\n e +=1\r\n if(c == 1):\r\n e +=1\r\n if(d == 1):\r\n e += 1\r\n if(e >= 2):\r\n f += 1\r\n e = 0\r\nprint(f)", "n = int(input())\r\nl = []\r\nlst = []\r\ncount = 0\r\nfor i in range(0,n):\r\n line = input()\r\n lst = line.split(' ')\r\n lst = [int(s) for s in lst]\r\n if sum(lst) >=2 :\r\n count = count + 1\r\nprint(count)", "tot = 0\r\nfor _ in range(int(input())):\r\n L = list(map(int,input().split()))\r\n if L.count(1) >= round(len(L)*0.70):\r\n tot += 1\r\nprint(tot)", "# Read the number of problems\nn = int(input())\n\n# Initialize the count of problems to be implemented\ncount = 0\n\n# Loop through each problem\nfor _ in range(n):\n # Read the views of Petya, Vasya, and Tonya\n views = list(map(int, input().split()))\n\n # Check if at least two friends are sure about the solution\n if sum(views) >= 2:\n count += 1\n\n# Print the result\nprint(count)\n\n \t\t \t \t\t \t\t \t \t\t \t\t\t\t", "# Problem 4: Team\r\n# http://codeforces.com/contest/231/problem/A\r\n# please enter only 0 and 1 values!\r\n\r\nnumber_of_games = int(input(\"\"))\r\ncounter = 0\r\nfor num in range(0,number_of_games):\r\n petya, vasya, tonya =list(map(int,input().split( ))) \r\n\r\n if petya+vasya+tonya >= 2:\r\n counter += 1\r\n else:\r\n pass\r\nprint(counter)\r\n\r\n", "n = int(input())\r\nans = 0\r\nlist = []\r\nfor i in range(0, n):\r\n sublist = [0, 0, 0]\r\n sublist[0], sublist[1], sublist[2] = map(int,(input().split()))\r\n if(sum(sublist) >= 2):\r\n ans = ans + 1\r\nprint(ans)\r\n\r\n \r\n", "N = int(input())\r\n\r\nsol = 0\r\nfor _ in range(N):\r\n if sum([int(x) for x in input().split(\" \")]) > 1:\r\n sol += 1\r\n\r\nprint(sol)", "n=int(input())\r\nl=list()\r\nfor i in range(0,n):\r\n m=list(map(int,input().split(\" \")))\r\n l.extend([m])\r\nc,d=0,0\r\nfor i in range(0,n):\r\n for j in range(0,3):\r\n if l[i][j]==1:\r\n c=c+1\r\n if c>1:\r\n d=d+1\r\n c=0\r\nprint(d)", "n = int(input())\r\ntotal = 0\r\nfor i in range(n):\r\n user_input = input()\r\n if user_input.count('1') >= 2:\r\n total += 1\r\nprint(total)", "t = int(input())\r\nk = 0\r\nkol = 0\r\nv = []\r\nwhile t>0:\r\n d = list(map(int, input(). split ()))\r\n if(d[0] == 1):\r\n kol+=1\r\n if(d[1] == 1):\r\n kol+=1\r\n if(d[2] == 1):\r\n kol+=1\r\n if(kol >= 2):\r\n k+=1\r\n kol = 0\r\n t -= 1\r\nprint(k)\r\n", "m=0\r\nfor i in range(0, int(input())):\r\n j = input().split()\r\n if j.count('1') >= 2:\r\n m+=1\r\nprint(m)", "n = int(input())\r\ncount = 0\r\n\r\nfor _ in range(n):\r\n views = input()\r\n sure_count = views.count('1')\r\n\r\n if sure_count >= 2:\r\n count += 1\r\n\r\nprint(count)\r\n\r\n\r\n\r\n", "n = int(input()) #ввод числа n\r\n\r\ncountTasks = 0 # итоговое количество заданий\r\nfor i in range(n):\r\n answers = list(map(int,input().split())) #ввод решений ребят\r\n if answers.count(1) > 1: #если решений достаточно, берём решение\r\n countTasks += 1\r\nprint(countTasks) ", "test_cases = int(input())\r\n\r\ntotal = 0\r\n\r\nfor i in range(test_cases):\r\n nums = input().split(\" \")\r\n t = []\r\n for i in nums:\r\n t.append(int(i))\r\n t = sum(t)\r\n\r\n if t >= 2:\r\n total += 1\r\n\r\nprint(total)\r\n", "t=int(input())\r\nteams=0\r\nfor i in range(t):\r\n l=input()\r\n x,y,z=map(int,l.split())\r\n if((x and y) or (z and x) or (y and z)):\r\n teams+=1\r\nprint(teams)", "n=int(input())\r\na=0\r\nfor i in range(n):\r\n x=input()\r\n if x.count(\"1\")>=2:a+=1\r\nprint(a)", "a = 0\r\nfor _ in range(int(input())):\r\n b = [int(i) for i in input().split()]\r\n if sum(b) > 1:\r\n a += 1\r\nprint(a)\r\n", "n = int(input())\r\n\r\nans = 0;\r\n\r\nfor i in range(n):\r\n string = input()\r\n counter = 0\r\n for char in string:\r\n if char == '1':\r\n counter += 1\r\n if counter > 1:\r\n ans += 1\r\n\r\nprint(ans)", "n = int(input())\r\noutput = 0 \r\n\r\nfor num in range(n):\r\n\tx = input()\r\n\tif x.count('1') >= 2:\r\n\t\toutput += 1\r\n\r\nprint(output)\r\n", "# Read the number of problems\nn = int(input())\n\n# Initialize a variable to keep track of the count of problems they will implement\ncount = 0\n\n# Iterate through each problem\nfor _ in range(n):\n # Read the views of each friend for the current problem\n petya, vasya, tonya = map(int, input().split())\n \n # Count how many friends are sure about the solution\n sure_count = petya + vasya + tonya\n \n # Check if at least two friends are sure\n if sure_count >= 2:\n count += 1\n\n# Print the count of problems they will implement\nprint(count)\n\n \t \t \t \t\t \t\t \t\t\t\t\t\t \t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\ndef input_int():\r\n return(int(input()))\r\n\r\ndef input_multiplie_ints():\r\n return(map(int,input().split()))\r\n\r\nif __name__ == \"__main__\":\r\n n = input_int()\r\n num_problems = 0\r\n for _ in range(n):\r\n ints = input_multiplie_ints()\r\n if (sum(ints) > 1):\r\n num_problems += 1\r\n\r\n print(num_problems)", "n=int(input())\r\nm=0\r\nfor _ in range(n):\r\n L=[int(x) for x in input().split()]\r\n if sum (L)>1:\r\n m+=1\r\nprint(m)", "n = int(input())\r\nproblems = [0]\r\nfor i in range(n):\r\n problems.append(list(map(int, input().split(' '))))\r\n\r\nproblems.pop(0)\r\n\r\namount_solved = 0\r\nfor i in range(n):\r\n count = 0\r\n for j in range(3):\r\n if problems[i][j] == 1:\r\n count += 1\r\n if count > 1:\r\n amount_solved += 1\r\n\r\nprint(amount_solved)", "\r\nn = int(input())\r\nproblems_to_implement = 0\r\nfor _ in range(n):\r\n \r\n views = list(map(int, input().split()))\r\n\r\n \r\n if sum(views) >= 2:\r\n problems_to_implement += 1\r\nprint(problems_to_implement)\r\n" ]

[ "import sys\nsys.stdin = open(\"input.txt\", \"r\")\nsys.stdout = open(\"output.txt\", \"w\")\nn=int(input())\nd={}\nfor x,y in enumerate(input().split(),1):\n d.setdefault(y,[]).append(x)\nif any(len(d[i])%2!=0 for i in d):\n print(-1)\n exit(0)\nfor i in d:\n print(\"\\n\".join(\"{0} {1}\".format(*k) for k in zip(d[i][::2],d[i][1::2])))\n \t \t \t \t \t \t\t \t\t \t\t \t\t", "# LUOGU_RID: 101473279\nimport sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\nn, *a = map(int, sys.stdin.read().split())\r\nd, ans = {}, []\r\nfor i in range(n * 2):\r\n if a[i] not in d:\r\n d[a[i]] = i + 1\r\n else:\r\n ans += str(d[a[i]]) + ' ' + str(i+1),\r\n del(d[a[i]])\r\nprint(d and -1 or '\\n'.join(ans))", "import sys\nsys.stdin = open(\"input.txt\")\nsys.stdout = open(\"output.txt\", 'w')\nn = int(input())\nl = list(map(int, input().split()))\nchecked = {}\ns = []\nfor i in range(2*n):\n e = l[i]\n if e not in checked.keys():\n checked[e] = i+1\n else:\n a = str(checked[e]) + \" \" + str(i+1)\n s.append(a)\n del(checked[e])\nif(len(checked) != 0):\n print(-1)\nelse:\n for i in s:\n print(i)\n", "from bisect import bisect_left\r\nfile_r = open(\"input.txt\", \"r\")\r\ninput = file_r.readline\r\nfile_w = open(\"output.txt\", \"w\")\r\nprint = file_w.write\r\n\r\ndef contains(mas, a):\r\n ind = bisect_left(mas, a)\r\n if ind == len(mas):\r\n return False\r\n return mas[ind] == a\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ndic = {}\r\nall_keys = []\r\nindex = 1\r\nfor t in a:\r\n if contains(all_keys, t):\r\n dic[t].append(index)\r\n else:\r\n dic[t] = [index]\r\n all_keys.insert(bisect_left(all_keys, t), t)\r\n index += 1\r\nret = True\r\nfor t in all_keys:\r\n if len(dic[t]) % 2 == 1:\r\n ret = False\r\n break\r\nif ret:\r\n for t in all_keys:\r\n for i in range(len(dic[t]) // 2):\r\n print(str(dic[t][2 * i]) + \" \" + str(dic[t][2 * i + 1]) + \"\\n\")\r\nelse:\r\n print(\"-1\")\r\n\r\nfile_r.close()\r\nfile_w.close()\r\n", "with open('input.txt') as fin:\n with open('output.txt', 'w') as fout:\n n = int(fin.readline())\n a = list(map(int,fin.readline().split(' ')))\n\n d = {}\n for i, x in enumerate(a):\n if x not in d:\n d[x] = []\n d[x].append(i + 1)\n\n fail = 0\n for x in d:\n if len(d[x]) % 2:\n fail = 1\n\n if fail:\n fout.write(\"-1\\n\")\n else:\n for x in d:\n l = d[x]\n for i in range(0, len(l), 2):\n fout.write(\"{} {}\\n\".format(l[i], l[i+1]))\n\n\n", "mapp= {}\r\nfor i,x in enumerate(open(\"input.txt\").read().split()[1:],1):\r\n mapp.setdefault(x,[])\r\n mapp[x].append(i)\r\nmapp = mapp.values()\r\nf = open(\"output.txt\",'w')\r\nif any(len(x)%2 for x in mapp):\r\n f.write(\"-1\")\r\nelse:\r\n for x in mapp:\r\n f.write(\"\".join(\"{0} {1}\\n\".format(*y) for y in zip(*[iter(x)]*2) ))\r\n", "def g():\r\n d={}\r\n for i,v in enumerate(open(\"input.txt\").read().split()[1:],1):d.setdefault(v,[]);d[v].append(i)\r\n d=d.values()\r\n f=open(\"output.txt\",\"w\")\r\n if any(len(v)%2for v in d):f.write(\"-1\")\r\n else:\r\n for v in d:f.write(\"\".join(\"{0} {1}\\n\".format(*_)for _ in zip(*[iter(v)]*2)))\r\ng()", "import sys\r\nsys.stdin=open(\"input.txt\")\r\nsys.stdout=open(\"output.txt\", 'w')\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nd={};m=[]\r\nfor i in range(2*n):\r\n\tif a[i] not in d:d[a[i]]=[i+1]\r\n\telse:d[a[i]]+=i+1,\r\n\tif len(d[a[i]])==2:\r\n\t\tx=str(d[a[i]][0])+\" \"+str(d[a[i]][1])\r\n\t\tm.append(x)\r\n\t\tdel d[a[i]]\r\nif len(m)==n:\r\n\tfor i in m:print(i)\r\nelse:print(-1)", "import os\n\ndef main():\n #elems = list(map(int, input().split(' ')))\n with open('input.txt', 'r') as f:\n n = int(f.readline().rstrip('\\n'))\n elems = list(map(int, f.readline().rstrip('\\n').split(' ')))\n\n data = {}\n for i, x in enumerate(elems):\n if x not in data:\n data[x] = []\n data[x].append(i)\n\n with open('output.txt', 'w+') as out:\n for i in range(1, 5001):\n x = data.get(i, [])\n if len(x) == 0:\n continue\n if len(x) % 2 > 0:\n out.seek(0, os.SEEK_SET)\n out.truncate(0)\n out.write('-1\\n')\n return\n\n while len(x):\n a, b = x.pop(), x.pop()\n out.write('%d %d\\n' % (a + 1, b + 1))\n \n \nif __name__ == \"__main__\":\n main()\n", "inp, out = open('input.txt', 'r'), open('output.txt', 'w')\r\nn = int(inp.readline())\r\na = inp.readline().split()\r\nb = {}\r\ns = []\r\nfor i in range(1, 2*n+1):\r\n e = int(a[i-1])\r\n if not e in b:\r\n b[e]=i\r\n else:\r\n s.append(str(b[e]) +' '+str(i))\r\n del(b[e])\r\nif len(b)==0:\r\n out.write('\\n'.join(s))\r\nelse:\r\n out.write('-1')\r\nout.close()\r\n", "f = open(\"input.txt\")\r\nlines = f.readlines()\r\nn = int(lines[0].strip())\r\narr = list(map(int, lines[1].strip().split()))\r\nd = {}\r\nfor i in range(2 * n):\r\n if arr[i] in d:\r\n d[arr[i]].append(i + 1)\r\n else:\r\n d[arr[i]] = [i + 1]\r\n\r\nf = open(\"output.txt\", 'w')\r\nfor i in d:\r\n if len(d[i]) % 2:\r\n f.write(str(-1))\r\n exit()\r\n\r\n\r\nfor i in d:\r\n for j in range(0, len(d[i]), 2):\r\n f.write(str(d[i][j]) + ' ' + str(d[i][j + 1]))\r\n f.write('\\n')", "f=open(\"input.txt\", \"r\")\r\ntext = f.readlines()\r\nf.close()\r\n\r\nn = int(text[0])\r\n\r\ncards = [int(c) for c in text[1].split()]\r\n\r\nf = open(\"output.txt\", \"w\")\r\n\r\ndicti = {}\r\n\r\nfor bruh in sorted(set(cards)):\r\n dicti[bruh] = []\r\n\r\nfor i, j in enumerate(cards):\r\n dicti[j].append(str(i+1))\r\n\r\nfor k in dicti:\r\n v = dicti[k]\r\n if len(v) % 2 == 1:\r\n f.write(str(-1))\r\n exit()\r\nfor k1 in dicti:\r\n v1 = dicti[k1]\r\n f.write(' '.join(v1))\r\n f.write('\\n')\r\n\r\nf.close()\r\n\r\n\r\n", "inp= open('input.txt', 'r')\r\nout=open('output.txt', 'w')\r\nn=int(inp.readline())\r\na=inp.readline().split()\r\ndic={}\r\ns=[]\r\nfor i in range(1, 2*n+1):\r\n e=int(a[i-1])\r\n if not e in dic:\r\n dic[e]=i\r\n else:\r\n s.append(str(dic[e]) +' '+str(i))\r\n del(dic[e])\r\nif len(dic)==0:\r\n out.write('\\n'.join(s))\r\nelse:\r\n out.write('-1')\r\nout.close()\r\n\r\n\r\n", "fi = open(\"input.txt\",\"r\")\nfo = open(\"output.txt\",\"w\")\nn = int(fi.readline().rstrip())\n# n = int(input())\n# arr = list(map(int, input().split()))\narr = list(map(int, fi.readline().rstrip().split()))\nindices = {}\nfor i in range(2*n):\n\ttry:\n\t\tindices[arr[i]].append(i)\n\texcept:\n\t\tindices[arr[i]] = [i]\nfinal = []\nflg = 0\nfor val in indices:\n\tif len(indices[val])%2:\n\t\tflg = 1\n\t\tbreak\n\tfor i in range(0, len(indices[val]), 2):\n\t\tfinal.append(f\"{indices[val][i]+1} {indices[val][i+1]+1}\")\nif flg:\n\tfo.write(\"-1\")\n\texit()\nfor op in final:\n\tfo.write(op+\"\\n\")\nfi.close()\nfo.close()\n", "import sys\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\nvisited = {}\r\n\r\nn = int(input())\r\na = [int(x) for x in input().split()]\r\nresult = []\r\n\r\nfor i in range(n * 2):\r\n if a[i] in visited:\r\n result.append((visited[a[i]] + 1, i + 1))\r\n visited.pop(a[i])\r\n else:\r\n visited[a[i]] = i\r\n\r\nif len(visited) > 0:\r\n print(-1)\r\nelif len(result) == 0:\r\n print(-1)\r\nelse:\r\n for pair in result:\r\n print(pair[0], pair[1])\r\n", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\nfrom collections import defaultdict,Counter,deque\r\ninput = sys.stdin.readline\r\n \r\ndef I():\r\n return input()\r\n \r\ndef II():\r\n return int(input())\r\n \r\ndef MII():\r\n return map(int, input().split())\r\n \r\ndef LI():\r\n return list(input().split())\r\n \r\ndef LII():\r\n return list(map(int, input().split()))\r\n \r\ndef GMI():\r\n return map(lambda x: int(x) - 1, input().split())\r\n \r\ndef LGMI():\r\n return list(map(lambda x: int(x) - 1, input().split()))\r\n \r\ndef WRITE(out):\r\n return print('\\n'.join(map(str, out)))\r\n \r\ndef WS(out):\r\n return print(' '.join(map(str, out)))\r\n \r\ndef WNS(out):\r\n return print(''.join(map(str, out)))\r\n\r\ndef WSNOPRINT(out):\r\n return ''.join(map(str, out))\r\n\r\n'''\r\npair = sum(a)//n\r\n'''\r\ndef solve():\r\n fin = open('input.txt', 'r')\r\n fout = open('output.txt', 'w')\r\n \r\n n = int(fin.readline())\r\n a = list(map(int, fin.readline().split()))\r\n x = sum(a)\r\n d = defaultdict(list)\r\n for i, num in enumerate(a):\r\n d[num].append(i+1)\r\n \r\n ans = []\r\n ok = True\r\n for k,v in d.items():\r\n if len(v)&1:\r\n ok = False\r\n break\r\n \r\n for i in range(1,len(v),2):\r\n ans.append((v[i], v[i-1]))\r\n\r\n if ok:\r\n for pair in ans:\r\n fout.write(' '.join(map(str, pair)) + '\\n')\r\n else:\r\n fout.write(str(-1))\r\n\r\nsolve()", "import sys\nsys.stdin = open('input.txt','r')\nsys.stdout = open('output.txt','w')\n# --------------------------------------------------------- #\nn = sys.stdin.readline()\nn = int(n)\narr = list(map(int, sys.stdin.readline().strip().split()))\ndick = {}\nfor i in range(2*n):\n if arr[i] not in dick:\n dick[arr[i]] = [i+1]\n else:\n dick[arr[i]].append(i+1)\nflag = 0\nfinal = []\nfor item in dick:\n if len(dick[item])%2!=0:\n flag = 1\n break\n \nif flag==1:\n print(-1)\nelse:\n count = 0\n for item in dick:\n for item in dick[item]:\n if count%2==0:\n arr=[]\n arr.append(item)\n else:\n arr.append(item)\n print(*arr)\n arr = []\n count +=1", "from sys import stdin, stdout\r\nimport math,sys\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict,deque,OrderedDict,Counter\r\nfrom os import path\r\nimport bisect as bi\r\nimport heapq \r\nmod=10**9+7\r\ndef yes():print('YES')\r\ndef no():print('NO')\r\nif (path.exists('input.txt')): \r\n #------------------Sublime--------------------------------------#\r\n sys.stdin=open('input.txt','r');sys.stdout=open('output.txt','w');\r\n def inp():return (int(input()))\r\n def minp():return(map(int,input().split()))\r\nelse:\r\n #------------------PYPY FAst I/o--------------------------------#\r\n def inp():return (int(stdin.readline()))\r\n def minp():return(map(int,stdin.readline().split()))\r\n####### ---- Start Your Program From Here ---- #######\r\nn=inp()\r\na=list(minp())\r\nd=Counter(a)\r\nflag=0\r\nfor keys in d:\r\n if d[keys]&1:\r\n flag=1\r\n break\r\nif flag:\r\n print(-1)\r\n exit(0)\r\nd={}\r\nfor i in range(2*n):\r\n try:\r\n d[a[i]].append(i+1)\r\n except:\r\n d[a[i]]=[i+1]\r\nfor keys in d:\r\n print(*d[keys])", "import sys\r\nsys.stdin=open(\"input.txt\",\"r\")\r\nsys.stdout=open(\"output.txt\",\"w\")\r\nn=int(input())\r\nlst=list(map(int,input().split()))\r\na_dict={}\r\nfor i in range(len(lst)):\r\n if lst[i] in a_dict:\r\n a_dict[lst[i]].append(i+1)\r\n else:\r\n a_dict[lst[i]]=[i+1]\r\nans=[]\r\nfor key in a_dict:\r\n if len(a_dict[key])%2==0:\r\n ans+=a_dict[key]\r\n else:\r\n exit(print(-1))\r\nit=iter(ans)\r\nfor x in it:\r\n print(x,next(it))\r\n\r\n\r\n\r\n", "# http://codeforces.com/problemset/problem/254/A\r\n\r\n\"\"\"\r\n2n cards, each cards has an integer. The number on card i is a_i\r\nSplit cards into pairs such that each pair has equal number of cards of the same value\r\n\r\nPrint the indices of such pairs\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n\r\n with open('input.txt', 'r') as f:\r\n file = f.readlines()\r\n n = int(file[0])\r\n a = list(map(int, file[1].split()))\r\n\r\n elements = set(a)\r\n index_dict = {}\r\n for element in elements:\r\n index_dict[element] = []\r\n\r\n for i in range(2*n):\r\n index_dict[a[i]].append(i+1)\r\n\r\n with open('output.txt', 'w') as f:\r\n\r\n for indexes in index_dict.values():\r\n if len(indexes) % 2 != 0:\r\n f.write('-1')\r\n return\r\n\r\n for indexes in index_dict.values():\r\n for i in range(0, len(indexes), 2):\r\n f.write(f'{indexes[i]} {indexes[i+1]}' + '\\n')\r\n return\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#!/usr/bin/env python3\n\ndef main():\n \n with open('input.txt') as data_in, open('output.txt', 'w') as data_out:\n from collections import defaultdict\n\n n = int(data_in.readline())\n arr = defaultdict(list)\n \n for i, ai in enumerate(map(int, data_in.readline().split())):\n arr[ai].append(i+1)\n\n for k, v in arr.items():\n if (len(v) & 1):\n data_out.write('-1\\n')\n return\n\n data_out.write(\n '\\n'.join(\n '\\n'.join(\n '%d %d' % (a, b) for a, b in zip(vec[::2], vec[1::2])\n ) for vec in arr.values()\n ) + '\\n'\n )\n\n\nif __name__ == \"__main__\":\n main()\n\n", "import sys\nsys.stdin, sys.stdout = open('input.txt', 'r'), open('output.txt', 'w')\nn, a, lines, im = int(input()), [int(x) for x in input().split()], [], {}\nfor i, x in enumerate(a):\n if x in im and im[x] != -1:\n lines.append(str(im[x]) + ' ' + str(i + 1))\n im[x] = -1\n else:\n im[x] = i + 1\nprint('\\n'.join(lines) if len(lines) == n else -1)", "import sys\r\nsys.stdin=open(\"input.txt\")\r\nsys.stdout=open(\"output.txt\", 'w')\r\n\r\ndef main():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n d=dict()\r\n for i,item in enumerate(a):\r\n if item not in d:\r\n d[item]=[]\r\n d[item].append(i+1)\r\n ans=[]\r\n flag=1\r\n for item in d.keys():\r\n temp=d[item]\r\n if len(temp)%2==0:\r\n for i in range(0,len(temp),2):\r\n ans.append([temp[i],temp[i+1]])\r\n else:\r\n flag=0\r\n break\r\n if flag:\r\n for item in ans:\r\n print(*item)\r\n else:\r\n print(-1)\r\n\r\n\r\nmain()", "import sys\r\n\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\nn=int(input())\r\nh=list(map(int,input().split()))\r\nch = []\r\nk=[]\r\nfor i in range(5001):\r\n k.append([])\r\n ch.append([])\r\n\r\nfor i in range(n * 2):\r\n o = h[i]\r\n ch[o].append(i + 1)\r\n\r\nflag=True\r\nfor i in ch :\r\n if len(i)%2 != 0 :\r\n print(-1)\r\n flag=False\r\n break\r\n\r\nif flag == True :\r\n for i in range(n * 2):\r\n o = h[i]\r\n k[o].append(i + 1)\r\n if len(k[o]) == 2:\r\n print(k[o][0], k[o][1])\r\n k[o] = []\r\n\r\n", "inp = open('input.txt', 'r')\r\nout = open('output.txt', 'w')\r\nn = int(inp.readline())\r\narr = inp.readline().split()\r\ndic, res = {}, []\r\nfor i in range(1, 2*n+1):\r\n j = int(arr[i-1])\r\n if not j in dic:\r\n dic[j] = i\r\n else:\r\n res.append(str(dic[j]) + ' ' + str(i))\r\n del(dic[j])\r\nif len(dic)==0:\r\n out.write('\\n'.join(res))\r\nelse:\r\n out.write('-1')\r\nout.close()\r\n", "from collections import defaultdict\nfrom io import StringIO\n\n\ndef main():\n IN = open('input.txt')\n OUT = open('output.txt', 'w')\n indices = tuple([] for _ in range(5001))\n res = StringIO()\n\n n = int(IN.readline())\n for i, num in enumerate(map(int, IN.readline().split()), 1):\n indices[num].append(i)\n for index in indices:\n if len(index) % 2 == 1:\n print(-1, file=OUT)\n break\n else:\n for index in indices:\n for i in range(1, len(index), 2):\n print(index[i], index[i-1], file=OUT)\n\n\nmain()\n", "import sys\r\nsys.stdin=open(\"input.txt\",\"r\")\r\nsys.stdout=open(\"output.txt\",\"w\")\r\nn=int(input())\r\na=[int(x) for x in input().split(' ')]\r\nsa=set(a)\r\nda={}\r\nfor x in sa:\r\n da[x]=[]\r\nfor i in range(len(a)):\r\n da[a[i]].append(i+1)\r\n# print(sa)\r\n# print(da)\r\nans=[]\r\nfl=True\r\nfor x in da:\r\n # fl=(fl and !(len(da[x])%2))\r\n if(len(da[x])%2):\r\n fl=False\r\n break\r\n else:\r\n i=0\r\n while(i<len(da[x])):\r\n ans.append([da[x][i],da[x][i+1]])\r\n i+=2\r\nif(fl):\r\n for an in ans:\r\n print(an[0],an[1])\r\nelse:\r\n print(-1)", "import sys\r\nfrom collections import defaultdict\r\n\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nd = defaultdict(list)\r\nfor i in range(2*n):\r\n d[a[i]].append(i+1)\r\n\r\nans = []\r\nfor num in d:\r\n if len(d[num]) % 2 == 0:\r\n ans.extend(d[num])\r\n else:\r\n print(-1)\r\n break\r\n\r\nelse:\r\n for i in range(n):\r\n print(ans[2*i], ans[2*i+1])\r\n\r\n", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\ninp= open('input.txt', 'r')\nout=open('output.txt', 'w')\nn=int(inp.readline())\na=inp.readline().split()\ndic={}\ns=[]\nfor i in range(1, 2*n+1):\n e=int(a[i-1])\n if not e in dic:\n dic[e]=i\n else:\n s.append(str(dic[e]) +' '+str(i))\n del(dic[e])\nif len(dic)==0:\n out.write('\\n'.join(s))\nelse:\n out.write('-1')\nout.close()\n", "def main():\n from collections import defaultdict\n d, res = defaultdict(list), []\n join, rapp = ' '.join, res.append\n with open(\"input.txt\", \"r\") as f:\n f.readline()\n for i, s in enumerate(f.readline().split(), 1):\n d[s].append(i)\n with open(\"output.txt\", \"w\") as f:\n for l in d.values():\n if len(l) & 1:\n f.write(\"-1\")\n return\n for i, j in zip(l[::2], l[1::2]):\n rapp(join((str(i), str(j))))\n f.write('\\n'.join(res))\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\nn, d = int(input()), {}\r\nfor i, j in enumerate(map(int, input().split()), start = 1):\r\n\tif j in d:\r\n\t\td[j] += [i]\r\n\telse:\r\n\t\td[j] = [i]\r\nif all(len(d[x]) % 2 == 0 for x in d):\r\n\tfor v in d.values():\r\n\t\tprint(\"\\n\".join(\"{0} {1}\".format(*k) for k in zip(v[0::2], v[1::2])))\r\nelse:\r\n\tprint(-1)", "class HashTable:\n def __init__(self):\n self.size = 0\n self.table = []\n\n def hash_function(self, key):\n return key % self.size\n\n def store(self, array):\n self.size = len(array)\n self.table = [[] for x in range(self.size)]\n for key in array:\n self.table[self.hash_function(key[0])].append(key)\n\n def get(self, key):\n chain = self.table[self.hash_function(key)]\n for x in chain:\n if x[0] == key:\n return x[1]\n\n\nclass CodeforcesTask254ASolution:\n def __init__(self):\n self.result = ''\n self.n = 0\n self.cards = []\n\n def read_input(self):\n lines = open(\"input.txt\", \"r\").readlines()\n self.n = int(lines[0])\n self.cards = [(int(x), i) for i, x in enumerate(lines[1].split(\" \"), 1)]\n\n def process_task(self):\n ht = HashTable()\n ht.store(self.cards)\n valid = True\n for b in ht.table:\n if len(b) % 2:\n valid = False\n break\n outfile = open(\"output.txt\", \"w\")\n if valid:\n for b in ht.table:\n for x in range(len(b) // 2):\n outfile.write(\"{0} {1}\\n\".format(b[x * 2][1], b[x * 2 + 1][1]))\n else:\n print(\"-1\", file=outfile)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask254ASolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import sys\r\n\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\n_ = input()\r\ncards = list(map(int, input().split()))\r\n\r\nfrom collections import defaultdict\r\ncard_indices = defaultdict(list)\r\nfor i, card in enumerate(cards, start=1):\r\n\tcard_indices[card].append(i)\r\noutput = []\r\nfor card, indices in card_indices.items():\r\n\tif len(indices) % 2:\r\n\t\tprint(-1)\r\n\t\texit()\r\n\tfor i in range(0, len(indices), 2):\r\n\t\toutput.append(f'{indices[i]} {indices[i+1]}')\r\nprint('\\n'.join(output))", "import sys\r\nsys.stdin = open('input.txt','r')\r\nsys.stdout = open('output.txt','w')\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nchk = True\r\nun = set(a)\r\nelem = {}\r\nfor i in un:\r\n elem[i] = []\r\nout = []\r\nfor i in range(2*n):\r\n elem[a[i]].append(i)\r\nfor i in elem:\r\n if len(elem[i]) % 2:\r\n chk = False\r\n break\r\n else:\r\n j = 0\r\n while(j < len(elem[i])):\r\n out.append([elem[i][j], elem[i][j+1]])\r\n j += 2\r\nif chk:\r\n for i in out:\r\n print(i[0]+1, i[1]+1)\r\nelse:\r\n print(-1)\r\n ", "import string\r\nfrom collections import deque\r\n\r\nalph = string.ascii_lowercase\r\n\r\ndef main():\r\n with open('input.txt', 'r') as fin:\r\n f = fin.readlines()\r\n n = int(f[0])\r\n a = list(map(int, f[1].split()))\r\n d = {i:0 for i in a}\r\n for i in a:\r\n d[i] += 1\r\n flag = 1\r\n for i in list(d.keys()):\r\n if d[i] % 2:\r\n flag = 0\r\n break\r\n with open('output.txt', 'w') as fout:\r\n if not flag:\r\n fout.write(str(-1))\r\n else:\r\n dick = {i:[] for i in a}\r\n for i in range(2*n):\r\n dick[a[i]].append(i)\r\n\r\n ans = []\r\n for i in list(dick.keys()):\r\n for j in range(0, len(dick[i]), 2):\r\n ans.append([dick[i][j], dick[i][j+1]])\r\n for i in range(n):\r\n fout.write(str(ans[i][0]+1) + ' ' + str(ans[i][1]+1) + '\\n')\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\nn=int(input());l=list(map(int,input().split()))\r\nd={}\r\nfor i in range(2*n):\r\n d.setdefault(l[i],[]).append(i+1)\r\nif all(i%2==0 for i in list(map(len,d.values()))):\r\n for i in d:\r\n print(\"\\n\".join(\"{0} {1}\".format(*k) for k in zip(d[i][::2],d[i][1::2])))\r\nelse:\r\n print(-1)", "import sys\r\nsys.stdin = open(\"input.txt\", \"r\")\r\nsys.stdout = open(\"output.txt\", \"w\")\r\n\r\n\r\ndef solution():\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\t\r\n\tdicty={}\r\n\t\r\n\tfor i in range(2*n):\r\n\t\tif arr[i] not in dicty:\r\n\t\t\tdicty[arr[i]]=[i+1]\r\n\r\n\t\telse:\r\n\t\t\tdicty[arr[i]].append(i+1)\r\n\t\r\n\tif all(len(dicty[x])%2==0 for x in dicty):\r\n\t\t\tfor v in dicty.values():\r\n\t\t\t\tprint(\"\\n\".join(\"{0} {1}\".format(*k) for k in zip(v[0::2], v[1::2])))\r\n\telse:\r\n\t\tprint(-1)\r\n\r\n\t\r\n\r\n \r\n\t\r\n\treturn\r\n\r\n\r\n\r\n\r\n\t\t\t\r\nsolution()\r\n", "import sys\n\nsys.stdin = open(\"input.txt\", \"r\")\nsys.stdout = open(\"output.txt\", \"w\")\n\n\nn = int(input())\n\nd = {}\no = {}\n\n\nfor ai, i in enumerate(map(int, input().split())):\n if i in d:\n d[i].append(ai + 1)\n else:\n d[i] = [ai + 1]\n\n if i in o:\n del o[i]\n else:\n o[i] = 1\n\n\nif len(o) == 0:\n for i, ais in d.items():\n for j in range(0, len(ais), 2):\n print(ais[j], ais[j + 1])\nelse:\n print(-1)\n", "import sys\r\n\r\nsys.stdin = open('input.txt', 'r')\r\nsys.stdout = open('output.txt', 'w')\r\n\r\nlines = [w.rstrip() for w in sys.stdin.readlines()]\r\n\r\nlst = list(map(int, lines[1].split()))\r\ndc = dict()\r\nfor i, x in enumerate(lst):\r\n if x in dc:\r\n dc[x].append(i+1)\r\n else:\r\n dc[x] = [i+1]\r\nif all(len(v) % 2 == 0 for v in dc.values()):\r\n res = []\r\n for v in dc.values():\r\n for x, y in zip(v[::2],v[1::2]):\r\n res.append(f'{x} {y}')\r\n sys.stdout.write(\"\\n\".join(res))\r\nelse:\r\n sys.stdout.write('-1')" ]

[ "from bisect import *\r\nu, v = {}, {}\r\nfor q in range(int(input())):\r\n a, t, x = map(int, input().split())\r\n if x not in u: u[x], v[x] = [], []\r\n if a < 3: insort([v, u][-a][x], t)\r\n else: print(bisect(u[x], t) - bisect(v[x], t))", "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\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\ndef update(bit,v,i,len1):\r\n while v<len1:\r\n bit[v]+=i\r\n v+=(v&(-v))\r\ndef get(bit,v):\r\n ans = 0\r\n while v!=0:\r\n ans+=bit[v]\r\n v-=(v&(-v))\r\n return ans\r\ndef compress(arr):\r\n return {i:ind+1 for ind,i in enumerate(sorted(list(set(arr))))}\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 n=inpu()\r\n arr=[lis() for i in range(n)]\r\n d=defaultdict(list)\r\n for i,j,k in arr:\r\n d[k].append(j)\r\n bit={i:[0]*(len(d[i])+1) for i in d}\r\n res = {i:compress(d[i]) for i in d}\r\n for i in range(n):\r\n arr[i][1] = res[arr[i][2]][arr[i][1]]\r\n for a,b,x in arr:\r\n if a==1:\r\n update(bit[x],b,1,len(bit[x]))\r\n elif a==2:\r\n update(bit[x],b,-1,len(bit[x]))\r\n else:\r\n print(get(bit[x],b))\r\nif __name__ == '__main__':\r\n main()\r\n", "from bisect import *\r\nd = [{}, {}]\r\ni = [0, 0]\r\nfor q in range(int(input())):\r\n a, t, x = map(int, input().split())\r\n for k in [0, 1]:\r\n d[k][x] = d[k].get(x, [])\r\n i[k] = bisect(d[k][x], t)\r\n if a < 3: d[-a][x].insert(i[-a], t)\r\n else: print(i[1] - i[0])", "import sys\r\nimport random\r\n\r\ninput = sys.stdin.readline\r\nrd = random.randint(10 ** 9, 2 * 10 ** 9)\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 update(self, index, val):\r\n # val 是增量, 如果是修改值记得计算增量\r\n # val = val - query_lr(index,index)\r\n while index <= self.n:\r\n self.tree[index] += val\r\n index += index & (-index)\r\n\r\n def query(self, r):\r\n res = 0\r\n while r > 0:\r\n res += self.tree[r]\r\n r -= r & (-r)\r\n return res\r\n\r\n # 计算[l,r]区间和，注意数组查询要+1 0-indexed -> 1-indexed+1\r\n def query_lr(self, left, right):\r\n return self.query(right) - self.query(left - 1)\r\n\r\nfrom collections import defaultdict\r\nn = int(input())\r\nd = defaultdict(list)\r\n\r\nfor i in range(n):\r\n a = list(map(int, input().split()))\r\n d[a[-1] ^ rd].append([i,a[0],a[1]])\r\nans = [-1] * n\r\nfor li in d.values():\r\n b = sorted(set([i[2] for i in li]))\r\n indexs = {j:i + 1 for i,j in enumerate(b)}\r\n tree = BIT(len(b))\r\n for i,op,x in li:\r\n if op == 1:\r\n tree.update(indexs[x],1)\r\n elif op == 2:\r\n tree.update(indexs[x],-1)\r\n else:\r\n ans[i] = tree.query(indexs[x])\r\nfor i in range(n):\r\n if ans[i] != -1:\r\n print(ans[i])", "# by the authority of GOD author: manhar singh sachdev #\r\n\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\n\r\nnew = lambda xx: (xx|xx-1)+1\r\ndef buildBIT(bit,n):\r\n for i in range(1,n+1):\r\n x = new(i)\r\n if x <= n:\r\n bit[x] += bit[i]\r\n\r\ndef pointUpdate(bit,point,n,diff):\r\n while point <= n:\r\n bit[point] += diff\r\n point = new(point)\r\n\r\ndef calculatePrefix(bit,point):\r\n su = 0\r\n while point:\r\n su += bit[point]\r\n point &= point-1\r\n return su\r\n\r\ndef rangeQuery(bit,start,stop):\r\n # [start,stop]\r\n return calculatePrefix(bit,stop)-calculatePrefix(bit,start-1)\r\n\r\ndef compressCoordinate(lst):\r\n return {i:ind+1 for ind,i in enumerate(sorted(set(lst)))}\r\n\r\ndef main():\r\n from collections import defaultdict\r\n n = int(input())\r\n dct = defaultdict(list)\r\n oper = [list(map(int,input().split())) for _ in range(n)]\r\n for a,t,x in oper:\r\n dct[x].append(t)\r\n new = {i:compressCoordinate(dct[i]) for i in dct}\r\n for i in range(n):\r\n oper[i][1] = new[oper[i][2]][oper[i][1]]\r\n\r\n bit = {i:[0]*(len(dct[i])+1) for i in dct}\r\n for a,t,x in oper:\r\n if a == 1:\r\n pointUpdate(bit[x],t,len(bit[x])-1,1)\r\n elif a == 2:\r\n pointUpdate(bit[x],t,len(bit[x])-1,-1)\r\n else:\r\n print(calculatePrefix(bit[x],t))\r\n\r\n# Fast IO Region\r\nBUFSIZE = 8192\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "#!/usr/bin/env python3\nfrom sys import stdin\nfrom bisect import bisect_left, bisect_right\n \nINF = int(1e9)\n\ndef find(par, a):\n if par[a] == a:\n return a\n par[a] = find(par, par[a])\n return par[a]\n\ndef union(par, rnk, a, b):\n a = find(par,a)\n b = find(par,b)\n if a==b:\n return\n \n if rnk[a]<rnk[b]:\n par[a] = b\n else:\n par[b] = a\n if rnk[a]==rnk[b]:\n rnk[a] += 1\n \ndef solve():\n n, m, k = map(int, stdin.readline().split())\n cnts = list(map(int, stdin.readline().split()))\n for i in range(1,k):\n cnts[i] += cnts[i-1]\n \n group = list(range(n))\n rnk = [0 for i in range(n)]\n adj = [[INF for j in range(k)] for i in range(k)]\n for i in range(m):\n u, v, x = map(int, stdin.readline().split())\n if x==0:\n union(group, rnk, u-1, v-1)\n tu = bisect_left(cnts, u)\n tv = bisect_left(cnts, v)\n adj[tu][tv] = min(adj[tu][tv], x)\n adj[tv][tu] = min(adj[tv][tu], x)\n \n p = 0\n for i in range(k):\n cur = group[p]\n while p<cnts[i]:\n if group[p]!=cur:\n print(\"No\")\n return\n p += 1\n print(\"Yes\")\n \n for p in range(k):\n for i in range(k):\n for j in range(k):\n adj[i][j] = min(adj[i][j], adj[i][p]+adj[p][j])\n \n for i in range(k):\n adj[i][i] = 0\n for j in range(k):\n if adj[i][j] == INF:\n adj[i][j] = -1\n \n for i in range(k):\n print(' '.join(map(lambda x: str(x), adj[i])))\n \n \nsolve()" ]

[ "from collections import Counter\n\ndef solve(n, t, c):\n possible = True\n res = [-1] * n\n taken = set()\n todo = set(range(n))\n for i in range(n):\n if c[t[i][0]] > 1:\n if t[i][1] in taken:\n return []\n res[i] = 1\n taken.add(t[i][1])\n todo.remove(i)\n while True:\n to_remove = set()\n for i in todo:\n if t[i][0] in taken:\n if t[i][1] in taken:\n return []\n res[i] = 1\n taken.add(t[i][1])\n to_remove.add(i)\n if to_remove:\n for j in to_remove:\n todo.remove(j)\n else:\n break\n for i in todo:\n res[i] = 0\n return res\n\nn = int(input())\nt = [['', ''] for _ in range(n)]\nc = Counter()\nfor i in range(n):\n team, home = input().split()\n t[i][0] = team[:3]\n t[i][1] = team[:2] + home[0]\n c[t[i][0]] += 1\n\nres = solve(n,t,c)\nif len(res)>0:\n print('YES')\n for i in range(n):\n print(t[i][res[i]])\nelse:\n print('NO')", "import sys\r\nsys.setrecursionlimit(2100)\r\n\r\nn = int(input())\r\nfirst = []\r\nsecond = []\r\nfirsts = {}\r\nfor i in range(n):\r\n a, b = input().split()\r\n option1 = a[:3]\r\n first.append(option1)\r\n if option1 in firsts:\r\n firsts[option1].append(i)\r\n else:\r\n firsts[option1] = [i]\r\n second.append(a[:2]+b[0])\r\nchoice = [0]*n\r\n\r\nadj = []\r\nvisited = [0]*n\r\nleft = ['']*n\r\nright = {}\r\nfor name in first+second:\r\n right[name] = -1\r\nfor i in range(n):\r\n if len(firsts[first[i]]) > 1:\r\n adj.append([second[i]])\r\n else:\r\n adj.append([first[i], second[i]])\r\n\r\n# bipartite\r\ndef dfs(a):\r\n visited[a] = 1\r\n for name in adj[a]:\r\n if right[name] == -1 or (not visited[right[name]] and dfs(right[name])):\r\n left[a] = name\r\n right[name] = a\r\n return True\r\n return False\r\n\r\nmatch = 0\r\nfor i in range(n):\r\n if left[i] == '':\r\n visited = [0]*n\r\n if dfs(i):\r\n match+= 1\r\n\r\nif match == n:\r\n print(\"YES\")\r\n for s in left:\r\n print(s)\r\nelse:\r\n print(\"NO\")", "def sol():\r\n n=int(input())\r\n club=['']*n\r\n city=['']*n\r\n mp={}\r\n for i in range(n):\r\n s=input().split()\r\n club[i]=s[0][:3]\r\n city[i]=s[1][:1]\r\n if club[i] in mp:\r\n mp[club[i]].add(i)\r\n else:\r\n mp[club[i]]=set()\r\n mp[club[i]].add(i)\r\n \r\n def rename(abc ,i):\r\n if abc in name:\r\n return False\r\n name[abc]=i \r\n if abc in mp and len(mp[abc])==1:\r\n for j in mp[abc] :\r\n if club[j][:2]+city[j] in name:\r\n return False\r\n \r\n mp[abc].clear()\r\n #name[club[j][:2]+city[j]]=j \r\n return rename(club[j][:2]+city[j],j)\r\n return True \r\n \r\n for clubname in mp:\r\n if len(mp[clubname])>1:\r\n for i in mp[clubname]:\r\n abc=club[i][:2]+city[i]\r\n if abc in name:\r\n return False\r\n if not rename(abc,i):\r\n return False\r\n \r\n \r\n \r\n for clubname in mp:\r\n if len(mp[clubname])==1:\r\n for i in mp[clubname]:\r\n name[clubname]=i \r\n return True\r\nname={}\r\nif sol() :\r\n print('YES')\r\n l=['']*len(name)\r\n for s in name:\r\n l[name[s]]=s \r\n for i in range(len(l)):\r\n print(l[i]) \r\nelse:\r\n print('NO')\r\n \r\n ", "n = int(input())\nd = {}\nfor i in range(n):\n name = input()\n name1 = name[:3]\n name2 = name[:2] + name.split()[1][0]\n d[i] = (name1, name2)\nans = [val[0] for val in d.values()]\nans_sort = sorted(ans)\nfor i in range(len(ans_sort) - 1):\n if ans_sort[i] == ans_sort[i + 1]:\n ans = [val[1] for val in d.values()]\n break\nans_sort = sorted(ans)\nfor i in range(len(ans_sort) - 1):\n if ans_sort[i] == ans_sort[i + 1]:\n print('NO')\n break\nelse:\n print('YES')\n for i in ans:\n print(i)\n\n\t\t \t \t \t\t\t\t \t \t \t\t \t", "import collections,sys,threading\r\nsys.setrecursionlimit(10**9)\r\nthreading.stack_size(10**8)\r\ndef main():\r\n n = int(input())\r\n edges = [ [] for _ in range(2*n) ]\r\n tp = [ -1 for _ in range (n)]\r\n mdf = []\r\n n1 = [ '' for _ in range (n)]\r\n n2 = [ '' for _ in range (n)]\r\n first = second = ''\r\n def dfs(v):\r\n nv= v if v<n else 2*n -1 -v\r\n if tp[nv] == v:\r\n return True\r\n if tp[nv] != -1:\r\n return False\r\n mdf.append(nv)\r\n tp[nv] = v\r\n for i in range(len(edges[v])):\r\n if not dfs(edges[v][i]):\r\n return False\r\n return True\r\n \r\n for i in range(n):\r\n tp[i] = -1\r\n first, second = input().split()\r\n n2[i] = first[:2]+second[0]\r\n n1[i] = first[:3]\r\n\r\n for i in range(n):\r\n for j in range(i+1,n):\r\n if n1[i]==n1[j]:\r\n edges[i].append(2 * n - 1 - j)\r\n edges[j].append(2 * n - 1 - i)\r\n if n2[i]==n2[j]:\r\n edges[2 * n - 1 - j].append(i)\r\n edges[2 * n - 1 - i].append(j)\r\n \r\n for i in range(n):\r\n for j in range(n):\r\n if n2[i]==n1[j] or n1[i]==n1[j]:\r\n edges[2 * n - 1 - i].append(2 * n - 1 - j)\r\n edges[j].append(i)\r\n\r\n for i in range(n):\r\n if tp[i] != -1:\r\n continue\r\n mdf.clear()\r\n if not dfs(i):\r\n for j in range(len(mdf)):\r\n tp[mdf[j]] = -1\r\n if not dfs(2 * n - 1 - i):\r\n print('NO')\r\n break\r\n else:\r\n print('YES')\r\n for i in range(n):\r\n if tp[i]==i:\r\n print(n1[i])\r\n else:\r\n print(n2[i])\r\n\r\nif __name__ == \"__main__\":\r\n threading.Thread(target=main).start()", "from collections import defaultdict\nnames = int(input())\ninp = [input().split() for x in range(names)]\nchoice = []\nres = defaultdict(lambda: [])\nfor x, word in enumerate(inp):\n choice.append(False)\n res[word[0][:3]].append(x)\n\nwhile True:\n changes = []\n for key in res.keys():\n if len(res[key]) > 1:\n # All choice = False options must be changed\n remove = []\n for i, index in enumerate(res[key]):\n if choice[index]: continue\n remove.append(i)\n choice[index] = True\n changes.append((inp[index][0][:2] + inp[index][1][0], index))\n for i in remove[::-1]:\n del res[key][i]\n if len(changes) == 0: break\n for word, i in changes:\n res[word].append(i)\n\nbad = False\nfor key in res.keys():\n if len(res[key]) > 1: bad = True\n\nif bad:\n print(\"NO\")\nelse:\n print(\"YES\")\n for i in range(names):\n if choice[i]:\n print(inp[i][0][:2] + inp[i][1][0])\n else:\n print(inp[i][0][:3])\n", "def get_data():\r\n n = int(input())\r\n rule_a = [] # el indice i se refiere a la i-esima liga\r\n rule_b = [] # el indice i se refiere a la i-esima liga\r\n # rule_a[i], rule_b[i] son las dos formas de nombrar a la liga i\r\n for _ in range(n):\r\n first, second = input().split()\r\n a = first[:3]\r\n b = first[:2]+second[0]\r\n rule_a.append(a)\r\n rule_b.append(b)\r\n return (rule_a, rule_b)\r\n\r\nif __name__ == '__main__':\r\n rule_a,rule_b = get_data()\r\n answer = []\r\n used_a = []\r\n used_b = []\r\n unusable = []\r\n for i in range(len(rule_a)):\r\n a = rule_a[i]\r\n b = rule_b[i]\r\n if a in used_a and b in used_b:\r\n print('NO')\r\n break\r\n if b in answer and a in unusable:\r\n print('NO')\r\n break\r\n used_a.append(a)\r\n used_b.append(b)\r\n # si la regla 1 no se ha aplicado\r\n if a not in answer and a not in unusable and b in answer:\r\n answer.append(a)\r\n else:\r\n answer.append(b)\r\n unusable.append(b)\r\n else:\r\n print('YES')\r\n for a in answer:\r\n print(a)\r\n\r\n\r\n\r\n", "# Description of the problem can be found at http://codeforces.com/contest/782/problem/D\r\n# If you would like to learn about my approach to this problem from myself, please feel free\r\n# to contact me and I'll be happy to guide you through this recursion :)\r\n\r\nd = {}\r\nl_s = None\r\nf_l = None\r\n\r\ndef add_if_poss(s, i):\r\n if s == None:\r\n print(\"NO\")\r\n quit()\r\n elif s not in d:\r\n d[s] = i\r\n f_l[i] = s\r\n else:\r\n # if this place is taken\r\n if d[s] != -1:\r\n # if we can't swap, try to change our string\r\n if l_s[d[s]] == None:\r\n t_s = l_s[i]\r\n l_s[i] = None\r\n add_if_poss(t_s, i)\r\n f_l[i] = t_s\r\n # if we can swap, we have to change the stored string to second variation\r\n else:\r\n t_i = d[s]\r\n t_s = l_s[d[s]]\r\n l_s[d[s]] = None\r\n d[s] = -1\r\n add_if_poss(t_s, t_i)\r\n add_if_poss(s, i)\r\n # if this place is taken inherently and we're adding a first name\r\n elif d[s] == -1:\r\n if l_s[i] == None:\r\n d[s] = i\r\n f_l[i] = s\r\n else:\r\n t_s = l_s[i]\r\n l_s[i] = None\r\n add_if_poss(t_s, i)\r\n\r\n\r\nn = int(input())\r\nl_s = [\"\"]*n\r\nf_l = [\"\"]*n\r\n\r\nfor i in range(n):\r\n s = input().split()\r\n s0 = s[0][:3]\r\n s1 = s[0][:2] + s[1][0]\r\n l_s[i] = s1\r\n \r\n add_if_poss(s0, i)\r\n\r\nprint(\"YES\")\r\nprint(\"\\n\".join(f_l))", "n = int(input())\r\nans = 0\r\n\r\no = []\r\np = []\r\n\r\n\r\nfor i in range(n):\r\n s, g = [str(j) for j in input().split()]\r\n ss = s[0:3]\r\n gg = s[0:2] + g[0]\r\n \r\n flag = True\r\n if ss in o:\r\n flag = False\r\n\r\n o.append(ss)\r\n \r\n if gg in p and ss not in p and flag:\r\n p.append(ss)\r\n \r\n elif gg not in p:\r\n p.append(gg)\r\n \r\n else:\r\n ans = -1\r\n \r\nif ans < 0:\r\n print('NO')\r\nelse:\r\n print('YES')\r\n for i in p:\r\n print(i)", "n = int(input())\r\na_names = []\r\nb_names = []\r\nres = []\r\na_used = []\r\nb_used = []\r\ncant_use = []\r\nfor i in range(n):\r\n name = input().split()\r\n a_names.append(name[0][:3])\r\n b_names.append(name[0][:2]+name[1][0])\r\n\r\nfor i in range(len(a_names)):\r\n if a_names[i] in a_used and b_names[i] in b_used or b_names[i] in b_used and a_names[i] in cant_use:\r\n print(\"NO\")\r\n break\r\n a_used.append(a_names[i])\r\n b_used.append(b_names[i])\r\n if a_names[i] not in res and a_names[i] not in cant_use and b_names[i] in res:\r\n res.append(a_names[i])\r\n else:\r\n res.append(b_names[i])\r\n cant_use.append(b_names[i])\r\nelse:\r\n print(\"Yes\")\r\n for i in res:\r\n print(i)\r\n\r\n \r\n", "from sys import stdin\r\n\r\nn = int(stdin.readline().strip())\r\nT,A = [],[]\r\nN,M = {},{}\r\nfor _ in range(n):\r\n t,h = stdin.readline().split()\r\n n1,n2 = t[:3],t[:2]+h[0]\r\n N[n1] = N.get(n1,0)+1\r\n T.append((n1,n2))\r\n A.append(n1)\r\n\r\ndef solve():\r\n for i in range(n):\r\n n1,n2 = T[i]\r\n if n1 not in M and N[n1]==1:\r\n M[n1] = i\r\n continue\r\n while n2 in M:\r\n j = M[n2]\r\n if n2==T[j][1]:\r\n return False\r\n M[n2],A[i]=i,n2\r\n i,n2 = j,T[j][1]\r\n else:\r\n M[n2],A[i] = i,n2\r\n return True\r\n\r\nif solve():\r\n print(\"YES\")\r\n print('\\n'.join(A))\r\nelse:\r\n print(\"NO\")\r\n", "from collections import Counter\r\ninput = __import__('sys').stdin.readline\r\nMIS = lambda: map(int,input().split())\r\n\r\n\r\nfrom sys import setrecursionlimit as SRL\r\nSRL(15000)\r\nfrom collections import deque\r\ndef BFS(ssize, tsize, adj, pairu, pairv, dist):\r\n Q = deque()\r\n for u in range(1, ssize+1):\r\n if pairu[u] == 0: dist[u] = 0; Q.append(u)\r\n else: dist[u] = float('inf')\r\n dist[0] = float('inf')\r\n while len(Q) > 0:\r\n u = Q.popleft()\r\n if dist[u] >= dist[0]: continue\r\n for v in adj[u]:\r\n if dist[pairv[v]] == float('inf'):\r\n dist[pairv[v]] = dist[u] + 1\r\n Q.append(pairv[v])\r\n return dist[0] != float('inf')\r\n\r\ndef DFS(ssize, tsize, adj, pairu, pairv, dist, u):\r\n if u == 0: return True\r\n for v in adj[u]:\r\n if dist[pairv[v]] == dist[u] + 1 and DFS(ssize, tsize, adj, pairu, pairv, dist, pairv[v]):\r\n pairv[v] = u; pairu[u] = v; return True\r\n dist[u] = float('inf'); return False\r\n\r\ndef HopcroftKarp(ssize, tsize, adj):\r\n pairu = [0]*(ssize+1); pairv = [0]*(tsize+1); dist = [-1]*(ssize+1)\r\n match = 0\r\n while BFS(ssize, tsize, adj, pairu, pairv, dist):\r\n for u in range(1, ssize+1):\r\n if pairu[u] == 0: match+= DFS(ssize, tsize, adj, pairu, pairv, dist, u)\r\n return match, pairu\r\n\r\n\r\nn = int(input())\r\nfirsts = Counter()\r\nabbv = {}\r\nablist = []\r\nteam = []\r\nfor i in range(n):\r\n s = input()\r\n team.append(s)\r\n firsts[s[:3]]+= 1\r\n for t in s[:3], s[:2]+s[s.find(' ')+1]:\r\n if t not in abbv:\r\n abbv[t] = len(abbv)+1\r\n ablist.append(t)\r\nadj = [[] for i in range(n+1)]\r\nfor i in range(n):\r\n s = team[i]\r\n adj[i+1].append(abbv[s[:2]+s[s.find(' ')+1]])\r\n if firsts[s[:3]] == 1: adj[i+1].append(abbv[s[:3]])\r\n\r\nmatch, pairu = HopcroftKarp(n, len(abbv), adj)\r\nif match == n:\r\n print(\"YES\")\r\n for i in range(1, n+1): print(ablist[pairu[i]-1])\r\nelse:\r\n print(\"NO\")", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n# @Author: wjh\n# @Date: 2017-03-05 21:20:06\n# @Last Modified by: wjh\n# @Last Modified time: 2017-03-05 22:28:50\n\nn = int(input())\nl = [input().split() for i in range(n)]\nl = [(i[0][:3], i[0][:2] + i[1][:1]) for i in l]\nif len(set(l)) != len(l):\n print('NO')\nelse:\n ans = {i:None for i in l}\n cnt = {i[0]:0 for i in l}\n for i in l:\n cnt[i[0]] += 1;\n l2 = []\n vis = set()\n for i in l:\n if cnt[i[0]] != 1:\n ans[i] = i[1]\n vis.add(i[1])\n else:\n l2.append(i);\n flag = True\n while flag:\n flag = False;\n for i in l2:\n if (ans[i]): continue\n if i[0] in vis and i[1] in vis:\n print('NO')\n exit();\n elif i[0] in vis:\n ans[i] = i[1]\n vis.add(i[1])\n flag = True\n elif i[1] in vis:\n ans[i] = i[0]\n vis.add(i[0])\n flag = True\n for i in l2:\n if (not ans[i]):\n ans[i] = i[0]\n print('YES')\n for i in l:\n print(ans[i])", "t=int(input())\r\nsth,st,s=[],[],[]\r\nflag=True\r\nfor _ in range(t):\r\n f=True\r\n t,h=map(str,input().split())\r\n if(t[0:3] in st):\r\n f=False\r\n st.append(t[0:3])\r\n if(~f and t[0:2]+h[0] not in s):\r\n s.append(t[0:2]+h[0])\r\n elif(f and t[0:2]+h[0] in s and st[_] not in s):\r\n s.append(st[_])\r\n else:\r\n flag=False\r\nif(flag):\r\n print('YES')\r\n for _ in s:\r\n print(_)\r\nelse:\r\n print('NO')\r\n", "from collections import Counter\r\nn = int(input())\r\nnames1 = []\r\nnames2 = {}\r\nfor i in range(n):\r\n st1, st2 = input().split()\r\n names1.append(st1[:3])\r\n names2[i] = st1[:2] + st2[0]\r\n\r\n \r\nd = Counter(names1)\r\nwhile (len(d) < n):\r\n need_end = True\r\n for i in range(n):\r\n if d[names1[i]] > 1:\r\n if i in names2:\r\n need_end = False\r\n names1[i] = names2.pop(i)\r\n if need_end:\r\n print(\"NO\")\r\n exit()\r\n d = Counter(names1)\r\nprint(\"YES\")\r\nfor elem in names1:\r\n print(elem)", "\r\nimport sys\r\n#sys.stdin=open(\"data.txt\")\r\ninput=sys.stdin.readline\r\n\r\nn=int(input())\r\n\r\n# get names\r\nname=[]\r\nd={}\r\ndouble=set()\r\nfor _ in range(n):\r\n a,b=input().split()\r\n a=a[:3]\r\n b=b[0]\r\n if a in d:\r\n double.add(a)\r\n d[a].append(b)\r\n else:\r\n d[a]=[b]\r\n name.append(a+b)\r\n\r\ndone=set()\r\n\r\nsingle=set()\r\ndosingle=set()\r\nfor a,b in d.items():\r\n if len(b)==1: single.add(a)\r\n\r\n# do doubles\r\nuseset=set()\r\nfor a in double:\r\n done.add(a)\r\n for b in d[a]:\r\n useset.add(a[:2]+b)\r\n if a[:2]+b in single:\r\n dosingle.add(a[:2]+b)\r\n\r\n# do singles\r\nwhile len(dosingle)>0:\r\n a=dosingle.pop()\r\n done.add(a)\r\n single.remove(a)\r\n b=d[a][0]\r\n useset.add(a[:2]+b)\r\n if a[:2]+b in single:\r\n dosingle.add(a[:2]+b)\r\n\r\n# do remaining singles\r\nfor a in single:\r\n useset.add(a)\r\n\r\n# print\r\nif len(useset)==n:\r\n print(\"YES\")\r\n for i in range(n):\r\n if name[i][:3] in done:\r\n print(name[i][:2]+name[i][3])\r\n else:\r\n print(name[i][:3])\r\nelse:\r\n print(\"NO\")\r\n", "from sys import stdin, stdout\r\n\r\nn = int(stdin.readline())\r\nans = [0 for i in range(n)]\r\nchallengersupd = []\r\nchallengers = []\r\nused = set()\r\nd = {}\r\n\r\nfor i in range(n):\r\n challengers.append(stdin.readline().strip())\r\n d[challengers[-1]] = i\r\n \r\nchallengers.sort()\r\n\r\nlabel = 1\r\n\r\ni = 0\r\nwhile i < n:\r\n l = i\r\n r = n\r\n \r\n while (r - l > 1):\r\n m = (r + l) // 2\r\n \r\n if challengers[m][:3] == challengers[i][:3]:\r\n l = m\r\n else:\r\n r = m\r\n \r\n if i == l:\r\n challengersupd.append(challengers[i])\r\n i += 1\r\n else:\r\n for j in range(i, r):\r\n f = challengers[j].split()[0][:2] + challengers[j].split()[1][:1]\r\n \r\n if f in used:\r\n label = 0\r\n \r\n ans[d[challengers[j]]] = f\r\n used.add(f)\r\n \r\n i = r\r\n\r\n\r\nlabels = 1\r\n\r\nwhile labels and label:\r\n challengers = challengersupd[:]\r\n challengersupd = []\r\n labels = 0\r\n \r\n for j in range(len(challengers)):\r\n if challengers[j][:3] in used:\r\n labels = 1\r\n \r\n f = challengers[j].split()[0][:2] + challengers[j].split()[1][:1]\r\n \r\n if f in used:\r\n label = 0\r\n \r\n ans[d[challengers[j]]] = f\r\n used.add(f)\r\n else:\r\n challengersupd.append(challengers[j])\r\n\r\nif label:\r\n stdout.write('YES\\n')\r\n \r\n for i in range(len(challengersupd)):\r\n ans[d[challengersupd[i]]] = challengersupd[i][:3]\r\n \r\n stdout.write('\\n'.join(ans))\r\nelse:\r\n stdout.write('NO')", "n = int(input())\ns = [input().split() for i in range(n)]\n\ndef f(i, t):\n return s[i][0][:3] if t == 0 else s[i][0][:2] + s[i][1][0]\n\nmp = {}\n\nfor i in range(n):\n r = f(i, 0)\n if not r in mp:\n mp[r] = []\n mp[r].append(i)\n\nused = set()\nans = [None] * n\n\nfor k, v in mp.items():\n if len(v) == 1:\n continue\n for i in v:\n r = f(i, 1)\n if r in used:\n print('NO')\n exit()\n ans[i] = r\n used.add(r)\n\nwhile True:\n converged = True\n for i in range(n):\n if ans[i] is not None:\n continue\n b = [f(i, t) in used for t in range(2)]\n if b[0] and b[1]:\n print('NO')\n exit()\n elif b[0] or b[1]:\n ans[i] = f(i, 0 if b[1] else 1)\n used.add(ans[i])\n converged = False\n if converged:\n break\n\nprint('YES')\nfor i in range(n):\n if ans[i] is None:\n ans[i] = f(i, 0)\n print(ans[i])\n", "n = int(input())\r\nd = {}\r\nfor i in range(n):\r\n name = input()\r\n name1 = name[:3]\r\n name2 = name[:2] + name.split()[1][0]\r\n d[i] = (name1, name2)\r\nans = [val[0] for val in d.values()]\r\nans_sort = sorted(ans)\r\nfor i in range(len(ans_sort) - 1):\r\n if ans_sort[i] == ans_sort[i + 1]:\r\n ans = [val[1] for val in d.values()]\r\n break\r\nans_sort = sorted(ans)\r\nfor i in range(len(ans_sort) - 1):\r\n if ans_sort[i] == ans_sort[i + 1]:\r\n print('NO')\r\n break\r\nelse:\r\n print('YES')\r\n for i in ans:\r\n print(i)\r\n", "n = int(input())\n\na, b, x, i = [], [], [], []\n\nfor _ in range(n):\n\n\tname = input().split()\n\n\ta1, b1 = name[0][:3], name[0][:2] + name[1][0]\n\n\tif (a1 in a and b1 in b) or (a1 in i and b1 in x):\n\n\t\tprint(\"NO\")\n\n\t\tquit()\n\n\telse:\n\n\t\ta.append(a1)\n\n\t\tb.append(b1)\n\n\t\tif a1 not in x and b1 in x and a1 not in i:\n\n\t\t\tx.append(a1)\n\n\t\telse:\n\n\t\t\tx.append(b1)\n\n\t\t\ti.append(b1)\n\n\n\nprint(\"YES\")\n\nfor i in x:\n\n\tprint(i)\n\n\n\n\n\n# Made By Mostafa_Khaled" ]

[ "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,a=read_ints()\r\n\tx=sorted(z-a for z in read_ints())\r\n\tif n==1:\r\n\t\tprint(0)\r\n\telse:\r\n\t\tprint(min(min(abs(x[0]),abs(x[-2]))+abs(x[0]-x[-2]),\r\n\t\t\tmin(abs(x[1]),abs(x[-1]))+abs(x[1]-x[-1])))\r\n\r\nsolve()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom bisect import *\r\n\r\nN,a = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\nif N==1:\r\n exit(print(0))\r\n\r\nidx = bisect_left(A,a)\r\nif idx==0:\r\n exit(print(A[-2]-a))\r\nif idx==N:\r\n exit(print(a-A[1]))\r\n\r\nans = float(\"inf\")\r\nt = A[-2]-A[0]\r\nans = min(ans, abs(a-A[-2])+t, abs(a-A[0])+t)\r\nt = A[-1]-A[1]\r\nans = min(ans, abs(a-A[-1])+t, abs(a-A[1])+t)\r\nprint(ans)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, a = map(int, input().split())\r\nw = sorted(map(int, input().split()))\r\nif n == 1:\r\n print(0)\r\n exit()\r\nif a <= w[0]:\r\n print(w[-2]-a)\r\nelif a >= w[-1]:\r\n print(a - w[1])\r\nelse:\r\n print(min(abs(w[-2]-a) + w[-2]-w[0], abs(w[-1]-a) + w[-1]-w[1], abs(a-w[1]) + w[-1]-w[1], abs(a-w[0])+w[-2]-w[0]))\r\n\r\n", "import sys\r\ninp = lambda: sys.stdin.readline()[:-1]\r\nmass = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n a = mass()[1]\r\n x = mass()\r\n if len(x) == 1:\r\n print(0)\r\n return\r\n x.sort()\r\n l = x[:-1]\r\n r = x[1:]\r\n print(min(abs(a - l[0]) + l[-1] - l[0], abs(a - l[-1]) + l[-1] - l[0], abs(a - r[0]) + r[-1] - r[0], abs(a - r[-1]) + r[-1] - r[0]))\r\n\r\n\r\n\r\n#for _ in range(int(input())):\r\nsolve()", "n,s=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n==1:\r\n print(0)\r\nelse:\r\n t1=l[1]\r\n t2=l[-1]\r\n a1=t2-t1+min(abs(t1-s),abs(t2-s))\r\n t1=l[0]\r\n t2=l[-2]\r\n a2=t2-t1+min(abs(t1-s),abs(t2-s))\r\n print(min(a1,a2))", "def main():\r\n n, a = map(int, input().split())\r\n v = list(map(int, input().split()))\r\n v.sort()\r\n if n == 1:\r\n print(0)\r\n return\r\n res = float('inf')\r\n if v[n-1] <= a:\r\n res = min(res, abs(a - v[1]))\r\n if v[1] >= a:\r\n res = min(res, abs(a - v[n-1]))\r\n if v[1] <= a and v[n-1] >= a:\r\n res = min(res, min(v[n-1] - a + v[n-1] - v[1], a - v[1] + v[n-1] - v[1]))\r\n if v[n-2] <= a:\r\n res = min(res, abs(a - v[0]))\r\n if v[0] >= a:\r\n res = min(res, abs(a - v[n-2]))\r\n if v[0] <= a and v[n-2] >= a:\r\n res = min(res, min(v[n-2] - a + v[n-2] - v[0], a - v[0] + v[n-2] - v[0]))\r\n print(res)\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1690456286.3070307", "n,a=[int(x) for x in input().split()]\r\narr=list(map(int,input().split()))\r\narr=sorted(arr)\r\nless,more,ctr=list(),list(),0\r\nfor i in arr:\r\n if i<a:less.append(i)\r\n elif i>a:more.append(i)\r\n else:ctr+=1\r\nif ctr>=n-1:print(0); quit()\r\nif len(less)==0:print(abs(more[-2]-a)); quit()\r\nelif len(more)==0:print(abs(a-less[1])); quit()\r\nlol=ctr\r\nans=0\r\n#print(less)\r\n#print(more)\r\nif len(less)>=2:ans=min((abs(more[-1]-a)+abs(more[-1]-less[1])),((abs(a-less[1])+abs(more[-1]-less[1]))))\r\nelse:ans=abs(more[-1]-a)\r\nif len(more)>=2:ans=min(ans,(min(abs(a-less[0])+abs(more[-2]-less[0]),(abs(more[-2]-a)+abs(more[-2]-less[0])))))\r\nelse:ans=min(ans,(abs(a-less[0])))\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn,m = map(int,input().split())\r\n\r\n\r\nt= list(map(int,input().split()))\r\n\r\n\r\n\r\nt.sort()\r\n\r\n\r\nif n<=1:\r\n print(0)\r\nelse:\r\n \r\n\r\n\r\n ans=9999999999999999\r\n for j in range(n):\r\n\r\n\r\n if j+(n-2)<n:\r\n #print(t[j+n-2]-abs(m-t[j]),t[j])\r\n ans=min(ans,(t[j+n-2]-t[j])+abs(m-t[j]))\r\n\r\n x=n-1-j\r\n\r\n if x-(n-2)>=0:\r\n ans=min( ans, abs(t[x]-m)+(t[x]-t[x-(n-2)]) )\r\n\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\ndef find(A):\n global M\n if A[0]<M<A[-1]:\n return abs(A[0]-A[-1])+min(abs(A[0]-M),abs(A[-1]-M))\n elif A[-1]<=M:\n return abs(A[0]-M)\n return abs(A[-1]-M)\n\nN,M = map(int,input().split())\nA = sorted(list(map(int,input().split())))\nif N==1:\n print(0)\n exit()\nprint(min(find(A[1:]),find(A[:N-1])))\n", "a = input().split(\" \")\nnum_of_checkpoints = int(a[0])\nstart = int(a[1])\n\ncheckpoints = [int(e) for e in input().split()]\n\ncheckpoints.sort()\n\nif num_of_checkpoints == 1:\n print(0)\nelif start <= checkpoints[0]:\n d = checkpoints[num_of_checkpoints - 2] - start\n print(d)\nelif start >= checkpoints[num_of_checkpoints - 1]:\n d = start - checkpoints[1]\n print(d)\nelse:\n i = 0\n\n # skip first\n if(start<=checkpoints[1]):\n i=abs(start-checkpoints[num_of_checkpoints-1])\n else:\n j=abs(start-checkpoints[1])\n k=abs(start-checkpoints[num_of_checkpoints-1])\n\n i=j+k+min(j,k)\n \n # skip last\n if(start>=checkpoints[num_of_checkpoints - 2]):\n i=min(i, abs(start-checkpoints[0]))\n else:\n j=abs(start-checkpoints[num_of_checkpoints - 2])\n k=abs(start-checkpoints[0])\n\n i=min(i, j+k+min(j,k))\n\n\n\n\n print(i)\n", "import sys \r\nimport math\r\ninput=sys.stdin.readline\r\nn,a=map(int,input().split())\r\nx=[int(i) for i in input().split()]\r\nx.sort()\r\nif n==1:\r\n print(0)\r\nelse:\r\n b=min(abs(a-x[0]),abs(a-x[len(x)-2]))+abs(x[0]-x[len(x)-2])\r\n c=min(abs(a-x[1]),abs(a-x[len(x)-1]))+abs(x[1]-x[len(x)-1])\r\n print(min(b,c))\r\n\r\n", "def f(a,b,c):\r\n if c<=a:\r\n return b-c\r\n if c>=b:\r\n return c-a\r\n return min(b-c+b-a, c-a+b-a)\r\n\r\ndef solve(p,v):\r\n v.sort()\r\n n=len(v)\r\n ans=10**18\r\n if n==1:\r\n return 0\r\n if p<=v[0]:\r\n ans=min(ans,v[n-2]-p)\r\n elif p>=v[n-1]:\r\n ans=min(ans,p-v[1])\r\n else:\r\n ans=min(ans,f(v[1],v[n-1],p), f(v[0],v[n-2],p))\r\n return ans\r\n\r\nn,p=map(int,input().split())\r\nv=list(map(int,input().split()))\r\nprint(solve(p,v))\r\n", "def f(a, l, r):\r\n dl, dr = a - l, r - a\r\n return 2 * max(0, min(dl, dr)) + max(dl, dr)\r\nn, a = map(int, input().split())\r\nif n == 1:\r\n print(0)\r\n exit()\r\nx = sorted(map(int, input().split()))\r\nprint(min(f(a, x[0], x[-2]), f(a, x[1], x[-1])))", "'''\r\n\r\n Online Python Compiler.\r\n Code, Compile, Run and Debug python program online.\r\nWrite your code in this editor and press \"Run\" button to execute it.\r\n\r\n'''\r\n\r\nn,a=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nif n==1:\r\n print(0)\r\nelse:\r\n if a<=l[0]:\r\n print(l[-2]-a)\r\n elif a>=l[-1]:\r\n print(a-l[1])\r\n else:\r\n fromleft,fromright=-1,-1\r\n if l[1]<=a:\r\n fromleft=a-l[1]\r\n else:\r\n fromleft=0\r\n if l[-2]>=a:\r\n fromright=l[-2]-a\r\n else:\r\n fromright=0\r\n choice1=min(2*fromleft+l[-1]-a,2*(l[-1]-a)+fromleft)\r\n choice2=min(2*fromright+a-l[0],2*(a-l[0])+fromright)\r\n #print(fromleft,fromright,choice1,choice2)\r\n print(min(choice2,choice1))", "n,a=map(int,input().split())\r\nx = sorted(map(int,input().split()))\r\nl=len(x)\r\nif n==1:\r\n print(0)\r\nelse:\r\n status1 = min(abs(a-x[0]),abs(a-x[l-2]))+abs(x[l-2]-x[0])\r\n status2 = min(abs(a-x[1]),abs(a-x[l-1]))+abs(x[l-1]-x[1])\r\n print(min(status1,status2))" ]

[ "def main():\r\n s = input()\r\n n = len(s)\r\n isPalindrome = [[False for i in range(n + 1)] for i in range(n + 1)]\r\n for i in range(n):\r\n isPalindrome[i][i] = True\r\n for i in range(n - 1, -1, -1):\r\n for j in range(i + 1, n):\r\n if (s[i] == s[j] and (i + 1 == j or isPalindrome[i + 1][j - 1] == True)):\r\n isPalindrome[i][j] = True\r\n\r\n degreePalindrome = [[0 for i in range(n)] for i in range(n)]\r\n #degreePalindrome[i][j] = degreePalindrome[i][mid] + 1\r\n res = [0] * (n + 1)\r\n for i in range(n):\r\n for j in range(i, n):\r\n if (i == j):\r\n degreePalindrome[i][j] = 1\r\n elif isPalindrome[i][j]:\r\n mid = (i + j - 1) // 2\r\n degreePalindrome[i][j] = degreePalindrome[i][mid] + 1\r\n res[degreePalindrome[i][j]] += 1\r\n\r\n for i in range( n - 2, 0, -1):\r\n res[i] += res[i + 1]\r\n\r\n print(*res[1::])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def PanlidromicCharacteristics(string):\r\n n = len(string)\r\n res = [[0 for i in range (n)] for j in range (n)]\r\n count = [0 for i in range (n + 1)]\r\n # for i in range (n):\r\n # res[i][i] = 1\r\n # count[1] += 1\r\n \r\n for length in range (1, n + 1):\r\n for i in range (n-length + 1):\r\n j = i + length - 1\r\n if length == 1:\r\n res[i][j] = 1\r\n elif length == 2 and string[i] == string[j]:\r\n res[i][j] = 2\r\n elif string[i] == string[j] and res[i + 1][j - 1] > 0:\r\n res[i][j] = res[i][i + length//2 - 1] + 1 \r\n count[res[i][j]] += 1\r\n \r\n # k-palindrome is also a (k - 1)-palindrome\r\n for i in range (len(count) - 1, 0, -1):\r\n count[i - 1] += count[i]\r\n for i in range (1, len(count)):\r\n print(count[i], end = \" \")\r\n return \r\n \r\nstring = input()\r\nPanlidromicCharacteristics(string)", "P = 311\n# we use two mods to reduce the chance of collision\nMOD1 = int(1e9) + 7\nMOD2 = int(1e9) + 9\n\n\ndef main():\n s = input()\n n = len(s)\n\n # Pre-compute\n power_1 = [0 for i in range(n + 1)]\n power_2 = [0 for i in range(n + 1)]\n mod_inv_1 = [0 for i in range(n + 1)]\n mod_inv_2 = [0 for i in range(n + 1)]\n power_1[0] = 1\n power_2[0] = 1\n mod_inv_1[0] = 1\n mod_inv_2[0] = 1\n\n for i in range(1, n + 1):\n power_1[i] = power_1[i - 1] * P % MOD1\n power_2[i] = power_2[i - 1] * P % MOD1\n mod_inv_1[i] = bin_exp(power_1[i], MOD1 - 2, MOD1)\n mod_inv_2[i] = bin_exp(power_2[i], MOD2 - 2, MOD2)\n\n # Compute hash values\n hash_1 = 0\n hash_2 = 0\n forward_hash_1 = [0 for i in range(n + 1)]\n forward_hash_2 = [0 for i in range(n + 1)]\n\n for i in range(1, n + 1):\n hash_1 += ord(s[i - 1]) * power_1[i]\n hash_2 += ord(s[i - 1]) * power_2[i]\n hash_1 %= MOD1\n hash_2 %= MOD2\n forward_hash_1[i] = hash_1\n forward_hash_2[i] = hash_2\n\n hash_1 = 0\n hash_2 = 0\n backward_hash_1 = [0 for i in range(n + 1)]\n backward_hash_2 = [0 for i in range(n + 1)]\n\n for i in range(1, n + 1):\n hash_1 += ord(s[n - i]) * power_1[i]\n hash_2 += ord(s[n - i]) * power_2[i]\n hash_1 %= MOD1\n hash_2 %= MOD2\n backward_hash_1[i] = hash_1\n backward_hash_2[i] = hash_2\n\n dp = [[0 for i in range(n + 1)] for j in range(n + 1)]\n count = [0 for i in range(n + 1)]\n\n for sub_len in range(1, n + 1):\n for left in range(0, n - sub_len + 1):\n right = left + sub_len - 1\n\n if sub_len == 1:\n dp[left][right] = 1\n elif sub_len == 2:\n if s[left] == s[right]:\n dp[left][right] = 2\n else:\n if s[left] == s[right] and dp[left + 1][right - 1] > 0:\n dp[left][right] = dp[left][left + sub_len // 2 - 1] + 1\n\n count[dp[left][right]] += 1\n\n for i in range(n - 1, 0, -1):\n count[i] += count[i + 1]\n\n for i in range(1, n + 1):\n print(count[i], end=' ')\n\n print()\n\n\ndef bin_exp(a, x, mod):\n res = 1\n \n while x > 0:\n if x & 1:\n res *= a\n res %= mod\n a *= a \n a %= mod \n x >>= 1\n \n return res\n\n\ndef get_forward_hash(forward_hash, mod_inv, left, right, mod):\n return (forward_hash[right + 1] - forward_hash[left] + mod) * mod_inv[left] % mod\n\n\ndef get_backward_hash(backward_hash, mod_inv, n, left, right):\n r_left = n - left - 1\n r_right = n - right - 1\n return (backward_hash[r_left + 1] - backward_hash[r_right] + mod) * mod_inv[r_right] % mod\n\n\nif __name__ == \"__main__\":\n main()", "s = input()\r\nn = len(s)\r\n\r\nres = [0] * n\r\nres[0] = n\r\ndp = [[0] * n for _ in range(n)]\r\n\r\nfor i in range(n):\r\n dp[i][i] = 1\r\n\r\nfor i in range(n - 1):\r\n if s[i] == s[i + 1]:\r\n dp[i][i + 1] = 2\r\n res[1] += 1\r\n\r\nfor length in range(2, n):\r\n for l in range(0, n - length):\r\n r = l + length \r\n if s[l] != s[r] or dp[l + 1][r - 1] == 0:\r\n continue\r\n \r\n m = (l + r - 1) // 2\r\n dp[l][r] = dp[l][m] + 1\r\n res[dp[l][r] - 1] += 1\r\n \r\nfor i in range(n - 2, -1, -1):\r\n res[i] += res[i + 1]\r\n\r\nprint(*res)", "def main():\r\n s = input()\r\n n = len(s)\r\n dp = [[0 for i in range(n + 1)] for j in range(n + 1)]\r\n count = [0 for i in range(n + 1)]\r\n\r\n for sub_len in range(1, n + 1):\r\n for left in range(0, n - sub_len + 1):\r\n right = left + sub_len - 1\r\n\r\n if sub_len == 1:\r\n dp[left][right] = 1\r\n elif sub_len == 2:\r\n if s[left] == s[right]:\r\n dp[left][right] = 2\r\n else:\r\n if s[left] == s[right] and dp[left + 1][right - 1] > 0:\r\n dp[left][right] = dp[left][left + sub_len // 2 - 1] + 1\r\n\r\n count[dp[left][right]] += 1\r\n\r\n for i in range(n - 1, 0, -1):\r\n count[i] += count[i + 1]\r\n\r\n for i in range(1, n + 1):\r\n print(count[i], end=' ')\r\n\r\n print()\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "n, k = map(int, input().split())\na = list(map(int, input().split()))\nkq, sumA, u = 0, sum(a), 1\nwhile u <= k + sumA:\n d = (k + sumA)//u\n tongbichat = 0\n for i in range(n):\n tongbichat += d*((a[i]+d-1)//d) - a[i]\n if tongbichat <= k:\n kq = max(kq, d)\n r = (k + sumA)//u\n u = (k + sumA)//r + 1\nprint(kq)\n\t \t \t \t \t \t \t \t \t \t \t \t" ]

[ "def f(x):\r\n L=k\r\n for i in range(n):\r\n if(B[i]//A[i]<x):\r\n L=L-(A[i]*x-B[i])\r\n if(L<0):\r\n return True\r\n return False\r\np=input()\r\np=p.split()\r\nn=int(p[0])\r\nk=int(p[1])\r\nA=[int(i) for i in input().split()]\r\nB=[int(i) for i in input().split()]\r\nleft=0\r\nright=2*(10**9)+1\r\nwhile(left<right-1):\r\n mid=(left+right)//2\r\n if(f(mid)):\r\n right=mid\r\n else:\r\n left=mid\r\nprint(left)", "def solve():\r\n n, k = map(int, input().split())\r\n a = [int(x) for x in input().split()]\r\n b = [int(x) for x in input().split()]\r\n\r\n def check(x: int):\r\n cnt = 0\r\n for i in range(n):\r\n res = a[i] * x - b[i]\r\n if res > 0:\r\n cnt += res\r\n return cnt <= k\r\n\r\n l, r = 0, int(1e10)\r\n while 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\n\r\n print(l)\r\n\r\n\r\nsolve()\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nN,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\n\r\ndef check(m):\r\n k = K\r\n for i in range(N):\r\n need = A[i]*m\r\n less = B[i]-need\r\n if less<0:\r\n k+=less\r\n if k<0:return False\r\n return True\r\n\r\nl,r=0,10**10\r\nwhile l+1<r:\r\n m = (l+r)//2\r\n if check(m):\r\n l = m\r\n else:\r\n r = m\r\n \r\nprint(l)\r\n\r\n\r\n", "# /**\r\n# * problem: D2. Magic Powder - 2\r\n# * contest: Codeforces Round 350 (Div. 2)\r\n# * author: brownfox2k6\r\n# * created: 24/06/2023 22:50:52 Hanoi, Vietnam\r\n# **/\r\n\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nreq = [*map(int, input().split())]\r\nhas = [*map(int, input().split())]\r\n\r\ndef ok(x):\r\n need = 0\r\n for i in range(n):\r\n need += max(0, x*req[i] - has[i])\r\n if need > k:\r\n return False\r\n return True\r\n\r\nleft = 0\r\nright = 1_000_000_000_000_000\r\nans = 0\r\n\r\nwhile left <= right:\r\n mid = (left + right) // 2\r\n if (ok(mid)):\r\n ans = mid\r\n left = mid + 1\r\n else:\r\n right = mid - 1\r\n\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline \r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split())) \r\nb = list(map(int, input().split())) \r\ndef fun(mid):\r\n ans = 0 \r\n for i in range(n):\r\n if((a[i] * mid - b[i]) > 0):\r\n ans += (a[i] * mid - b[i]) \r\n \r\n return ans <= k \r\n \r\n \r\nc = 0 \r\nd = 10 ** 13 \r\nm = 0\r\nwhile(c <= d):\r\n mid = (c + d) // 2 \r\n if(fun(mid)):\r\n c = mid + 1 \r\n m = max(m, mid) \r\n else:\r\n d = mid - 1 \r\n \r\nprint(m)\r\n", "def check(x):\r\n f = k\r\n for i in range(n):\r\n f += min(0, b[i] - x * a[i])\r\n if f >= 0:\r\n return True\r\n else:\r\n return False\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nl = 0\r\nr = k + max(b)\r\nwhile l < r:\r\n m = (l + r + 1) // 2\r\n f = k\r\n for i in range(n):\r\n f += min(0, b[i] - m * a[i])\r\n if f >= 0:\r\n l = m\r\n else:\r\n r = m - 1\r\nprint(l)\r\n", "I=lambda:list(map(int,input().split()))\r\nn,k=I()\r\na=I()\r\nb=I()\r\nl=0\r\nr=2*10**9\r\nwhile l<r:\r\n\tm=(l+r)//2+1;s=sum(max(a[i]*m-b[i],0)for i in range(n))\r\n\tif s>k:r=m-1\r\n\telse:l=m\r\nprint(l)", "n, k = map(int, input().split())\na = [0] + list(map(int, input().split()))\nb = [0] + list(map(int, input().split()))\n\ndef check(x):\n global a\n global b\n global n\n global k\n m = k\n for i in range(1, n + 1):\n if a[i] * x - b[i] > m:\n return False\n m -= max(0, a[i] * x - b[i])\n pass\n return True\nans = 0\nl = 0\nr = 2999999999\nwhile l <= r:\n mid = (l + r) // 2\n if check(mid) == True:\n ans = mid\n l = mid + 1\n else :\n r = mid - 1\n pass\nprint(ans)\n\t \t\t \t\t\t \t\t\t\t \t \t\t\t \t", "def pred(a,b,n,k,maxct):\r\n c=0\r\n for i in range(n):\r\n c += max(maxct*a[i]-b[i],0)\r\n return (k>=c)\r\n\r\nn,k=(input().split(' '))\r\nn,k=int(n),int(k)\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nct=b[0]//a[0]\r\nfor i in range(1,n):\r\n ct=min(ct,b[i]//a[i])\r\nfor i in range(n):\r\n b[i]=b[i]-ct*a[i]\r\n\r\nen,st=k,0\r\n\r\nwhile(en-st>1):\r\n mid=(en+st)//2\r\n if(pred(a,b,n,k,mid)==False):\r\n en=mid-1\r\n else :\r\n st=mid\r\n\r\nif (pred(a,b,n,k,en)==True):\r\n print(ct+en)\r\nelse :\r\n print(ct+st)\r\n", "def main():\r\n n, k = map(int, input().split())\r\n\r\n requirements_for_cookie = list(map(int, input().split()))\r\n stock_for_cookie = list(map(int, input().split()))\r\n\r\n cookies_possible = float('inf')\r\n for i in range(n):\r\n cookies_possible = min(cookies_possible, stock_for_cookie[i] // requirements_for_cookie[i])\r\n\r\n for i in range(n):\r\n stock_for_cookie[i] -= requirements_for_cookie[i] * cookies_possible\r\n\r\n max_cookies = 0\r\n low, high = 0, k\r\n while low <= high:\r\n cookies = low + (high - low) // 2\r\n\r\n if is_valid(cookies, requirements_for_cookie, stock_for_cookie, k):\r\n max_cookies = cookies\r\n low = cookies + 1\r\n else:\r\n high = cookies - 1\r\n\r\n print(cookies_possible + max_cookies)\r\n\r\n\r\ndef is_valid(cookies_req, req_for_a_cookie, stock_for_cookie, k):\r\n for i in range(len(req_for_a_cookie)):\r\n need = cookies_req * req_for_a_cookie[i]\r\n if stock_for_cookie[i] >= need:\r\n continue\r\n else:\r\n k -= (need - stock_for_cookie[i])\r\n\r\n if k < 0:\r\n return False\r\n\r\n return True\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, k = map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nl = 1; r = int(2e9); ans = 0 \r\nwhile l <= r :\r\n res = 1; md = (l + r) // 2; tck = k\r\n for x in range(n) : \r\n c = a[x] * md - b[x]; \r\n if tck >= c :tck-=max(c, 0)\r\n else : res = 0; break\r\n if res : l = md +1; ans = md\r\n else : r = md - 1 \r\nprint(ans)", "R = lambda: map(int, input().split())\r\nn, k = R()\r\nitems = list(R())\r\ntots = list(R())\r\nl, r = 0, 2 * 10 ** 9 + 1\r\nwhile l < r:\r\n mid = (l + r + 1) // 2\r\n req = sum(max(0, a * mid - b) for a, b in zip(items, tots))\r\n if req > k:\r\n r = mid - 1\r\n else:\r\n l = mid\r\nprint(l)", "n, k = map(int, input().split())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nr = 2 * 10 ** 9 + 1\r\nl = -1\r\nwhile r - l > 1:\r\n e = (l + r) // 2\r\n c = 0\r\n for i in range(n):\r\n c += max(0, a[i] * e - b[i])\r\n if c <= k:\r\n l = e\r\n else:\r\n r = e\r\nprint(l)", "def func(intput,mapping,unpack):\r\n n,k=unpack(int)\r\n req,v=mapping(int),mapping(int)\r\n l,h,md=0,1e18,0\r\n def p(e):\r\n m=k\r\n for i in range(n):\r\n c=v[i]//req[i]\r\n if c<e:\r\n need=(e*req[i])-v[i]\r\n if m>=need: m-=need\r\n else: return False\r\n return True\r\n while h-l>1:\r\n md=(h+l)//2\r\n if p(md):l=md\r\n else:h=md-1\r\n if p(h):print(int(h))\r\n else:print(int(l))\r\n\r\ndef init(flag=True):\r\n intput = lambda : int(input())\r\n mapping = lambda s: list(map(s,input().split()))\r\n unpack = lambda s: map(s,input().split())\r\n for _ in range(int(input()) if flag else 1):\r\n func(intput,mapping,unpack)\r\n\r\nif __name__ == '__main__':\r\n init(False)", "I=lambda:list(map(int,input().split()))\r\nn,k=I()\r\na=I()\r\nb=I()\r\nl=0\r\nr=2*10**9\r\nwhile l<r:\r\n\tm=(l+r)//2+1\r\n\ts=sum(max(a[i]*m-b[i],0)\r\n\t\tfor i in range(n))\r\n\tif s>k:r=m-1\r\n\telse:l=m\r\nprint(l)", "def check(b,l1,l2):\r\n temp =k\r\n for x in range(n):\r\n need=int(l1[x]*b)\r\n if need > l2[x]:\r\n temp -= need - l2[x]\r\n if temp < 0 :\r\n return False\r\n return True\r\ndef binary_search(l1,l2):\r\n ans=0\r\n left_index=1\r\n right_index = 2 * 10 ** 9 + 1\r\n while left_index <= right_index:\r\n mid_index = (left_index+right_index)//2\r\n if check(mid_index, l1, l2):\r\n ans = mid_index\r\n left_index = mid_index + 1\r\n else:\r\n right_index = mid_index -1\r\n return ans\r\n \r\nn,k = map(int,input().split())\r\nl1 = list(map(int,input().split(\" \")))\r\nl2 = list(map(int,input().split(\" \")))\r\nindex = binary_search(l1, l2)\r\nprint(index)", "\r\nimport sys\r\nn,k=map(int,input().split())\r\ngrams=list(map(int,input().split()))\r\nhas=list(map(int,input().split()))\r\ntmp=-1\r\nfor i in range(len(grams)):\r\n tmp=max(tmp,(has[i]//grams[i])+(k//grams[i]))\r\ndef func(grams,has,mid,k):\r\n if(mid==tmp+1):\r\n return False\r\n for i in range(len(grams)):\r\n if(grams[i]*mid>has[i]):\r\n # print((((grams[i]*mid)-has[i]))-k,\"k is \",k)\r\n if((((grams[i]*mid)-has[i]))-k>0):\r\n # k=(((grams[i]*mid)-has[i]))-k\r\n return False\r\n else:\r\n k=k-(grams[i]*mid-has[i])\r\n \r\n return True\r\n# print(func(grams,has,5,1))\r\nlow=0\r\nhigh=tmp\r\n# print(\"low\",low,\"high\",high)\r\nwhile(low<=high):\r\n mid=(low+high)//2\r\n # print(mid)\r\n if(func(grams,has,mid,k)):\r\n if(not func(grams,has,mid+1,k)):\r\n print(mid)\r\n break\r\n else:\r\n low=mid+1\r\n else:\r\n high=mid-1\r\n", "import math\r\n\r\ndef calculate_distance(x1, y1, x2, y2):\r\n return math.sqrt((x1 - x2) ** 2 + (y1 - y2) ** 2)\r\n\r\ndef check(mid, n, k, a, b):\r\n total_sum = 0\r\n for i in range(n):\r\n total_sum += max(mid * a[i] - b[i], 0)\r\n return total_sum <= k\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n \r\n low = 0\r\n high = 200000000100\r\n while low < high:\r\n mid = (low + high) // 2\r\n if check(mid, n, k, a, b):\r\n low = mid + 1\r\n else:\r\n high = mid\r\n \r\n print(low - 1)\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "def binpos(n, a, b, k, nach):\r\n l = -1\r\n r = nach + 1\r\n while r - l > 1:\r\n m = (r - l) // 2 + l\r\n nuz = 0\r\n for i in range(n):\r\n nuz += max(0, a[i] * m - b[i])\r\n if nuz > k:\r\n r = m\r\n else:\r\n l = m\r\n return l\r\n\r\n\r\nn, k = map(int, input().split())\r\na = [int(el) for el in input().split()]\r\nb = [int(el) for el in input().split()]\r\nprint(binpos(n, a, b, k, sum(b) + k + 10))", "n,k=map(int,input().split())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\ndef check(x):\r\n\ttemp=0\r\n\tfor i in range(n):\r\n\t\tif x*a[i]>b[i]:temp+=x*a[i]-b[i]\r\n\tif temp<=k:return True\r\n\treturn False\r\nl=0\r\nr=10**10\r\nwhile r-l>0:\r\n\tm=(l+r+1)//2\r\n\tif check(m):l=m\r\n\telse:r=m-1\r\nprint(l)\r\n\t\t\r\n", "\r\nn, k = map(int, input().split())\r\na = list((map(int, input().split())))\r\nb = list((map(int, input().split())))\r\nlow = 0\r\nhigh = 1e18\r\nwhile (low <= high):\r\n mid = (low + high)//2\r\n req = 0\r\n for i in range(0, n):\r\n req = req + max(0, (mid*a[i])-b[i])\r\n if req > k:\r\n high = mid - 1\r\n else:\r\n low = mid + 1\r\nprint(int(low - 1))\r\n", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nl, r = 0, 2 * 10 ** 9 + 1\r\n\r\nwhile r - l > 1:\r\n mid = (l + r) // 2\r\n magic_powder = k\r\n for i in range(n):\r\n needed = mid * a[i]\r\n if b[i] < needed:\r\n magic_powder -= needed - b[i]\r\n if magic_powder < 0:\r\n break\r\n if magic_powder < 0:\r\n r = mid\r\n else:\r\n l = mid\r\n\r\nprint(l)\r\n", "import sys\n# sys.stdin = open(\".in\", \"r\")\n# sys.stdout = open(\".out\", \"w\")\ninput = sys.stdin.readline\ndef print(*args, end='\\n', sep=' ') -> None:\n sys.stdout.write(sep.join(map(str, args)) + end)\ndef map_int():\n return map(int, input().split())\ndef list_int():\n return list(map(int, input().split()))\nfrom collections import defaultdict, deque\nfrom math import log\n\n\ndef can_make(x):\n global have, required, k\n magic_powder = k\n for i in range(n):\n magic_powder -= max(0, (x*required[i] - have[i]))\n if magic_powder < 0: return False\n return True\n\nn, k = map_int()\nrequired = list_int()\nhave = list_int()\nl, r = 0, 10000000000\nanswer = 0\nwhile l <= r:\n mid = l + (r-l)//2\n if can_make(mid):\n answer = mid\n l = mid + 1\n else:\n r = mid - 1\n\nprint(answer)", "# 2022-06-12T07:58:56.404Z\r\nimport heapq\r\n\r\n\r\ndef proc(n, k, a, b):\r\n h = []\r\n v = []\r\n for i in range(n):\r\n r, m = divmod(b[i], a[i])\r\n v.append([r, a[i] - m, a[i]])\r\n\r\n v = sorted(v, reverse=True)\r\n\r\n while len(v) > 1:\r\n r2, m2, c2 = v.pop()\r\n r1, m1, c1 = v.pop()\r\n\r\n diff = r1 - r2\r\n cost = m2 + (diff - 1) * c2\r\n\r\n if k >= cost:\r\n k -= cost\r\n\r\n v.append((r1, m1 + c2, c1 + c2))\r\n else:\r\n if k > m2:\r\n k -= m2\r\n r2 += 1\r\n return r2 + k // c2\r\n\r\n r2, m2, c2 = v.pop()\r\n if k > m2:\r\n k -= m2\r\n r2 += 1\r\n return r2 + k // c2\r\n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nans = proc(n, k, a, b)\r\nprint(ans)\r\n", "I=lambda:list(map(int,input().split()))\nn,k=I()\na=I()\nb=I()\nl=0\nr=2*10**9\nwhile l<r:\n\tm=(l+r)//2+1;s=sum(max(a[i]*m-b[i],0)for i in range(n))\n\tif s>k:r=m-1\n\telse:l=m\nprint(l)\n\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\nprint = sys.stdout.write\r\nn,k = map(int,input().split())\r\nrequired = list(map(int,input().split()))\r\nhas = list(map(int,input().split()))\r\nleft=0\r\nright = 10**16\r\ndef check(x,k):\r\n for i in range(n):\r\n val = has[i]-required[i]*x\r\n if val>=0:\r\n continue\r\n val *=-1\r\n if val<=k:\r\n k-=val\r\n else:\r\n return 0\r\n return 1\r\nwhile(left<=right):\r\n mid = (left+right)//2\r\n if (check(mid,k)):\r\n left=mid+1\r\n ans = mid\r\n else:\r\n right=mid-1\r\nprint(str(ans))\r\n", "\r\nn,k = map(int,input().split())\r\na = list((map(int,input().split())))\r\nb = list((map(int,input().split())))\r\nlow = 0\r\nhigh = 1e18\r\nwhile (low < high):\r\n mid = (low + high + 1)//2\r\n req = 0\r\n for i in range(0,n):\r\n req = req + max(0,(mid*a[i])-b[i])\r\n if req > k:\r\n high = mid - 1\r\n else:\r\n low = mid\r\nprint(int(low))\r\n\r\n \r\n", "n, k = map(int, input().split())\r\nreq = [int(i) for i in input().split()]\r\nhave = [int(i) for i in input().split()]\r\n\r\ndef check(x):\r\n\ttemp_k = 0\r\n\tfor i in range(n):\r\n\t\ttemp_k += max(0, req[i] * x - have[i]);\r\n\treturn temp_k <= k\r\n\r\n\r\nl, r = 0, 10**10\r\nans = 0\r\nwhile l <= r:\r\n\tmid = l + (r - l) // 2;\r\n\tif(check(mid)) :\r\n\t\tans = mid\r\n\t\tl = mid + 1\r\n\telse:\r\n\t\tr = mid - 1;\r\n\r\nprint(ans)\r\n", "def solve(k,a,b):\r\n lo=0\r\n hi=10**14\r\n ans=0\r\n while lo<=hi:\r\n mid=lo+((hi-lo)//2)\r\n if isvalid(k,a,b,mid):\r\n ans=mid\r\n lo=mid+1\r\n else:\r\n hi=mid-1\r\n return ans\r\n\r\ndef isvalid(k,a,b,mid):\r\n \r\n for i in range(len(a)):\r\n if a[i]*mid<=b[i]:\r\n continue\r\n else:\r\n newval=(a[i]*mid)-b[i]\r\n if k<newval:\r\n return False\r\n k=k-newval\r\n return True\r\n\r\n\r\nif __name__==\"__main__\":\r\n \r\n \r\n n,k=map(int,input().split())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n print(solve(k,a,b))\r\n " ]

[ "def max_dist(n,a):\r\n minpos = a.index(min(a))\r\n maxpos = a.index(max(a))\r\n if minpos<maxpos:\r\n ldist=minpos\r\n rdist = n-maxpos-1\r\n if ldist>rdist:\r\n dist=maxpos\r\n else:\r\n dist=n-minpos-1\r\n else:\r\n ldist=maxpos\r\n rdist=n-minpos-1\r\n if ldist>rdist:\r\n dist=minpos\r\n else:\r\n dist=n-maxpos-1\r\n return dist\r\n\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nresult=max_dist(n,a)\r\nprint(result)", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\na = [int(i) for i in input().split()]\nx, y = a.index(1), a.index(n)\nans = max(x, y, n - x - 1, n - y - 1) \nprint(ans)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nMin = a.index(1)\r\nMax = a.index(n)\r\nprint(max(\r\n Min,\r\n n - Min - 1,\r\n Max,\r\n n - Max - 1\r\n))", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = max(l)\r\ny = min(l)\r\nc = 0\r\nt1=0\r\nt2=0\r\nfor i in range(n):\r\n if(x==l[i]):\r\n t1 = i\r\nfor i in range(n):\r\n if(y==l[i]):\r\n t2 = i\r\np = [0]*7\r\np[1] = t1-t2\r\np[2]= t1- 0 \r\np[3]= n-1-t1\r\np[4] = t2-t1\r\np[5] = n-1-t2\r\np[6] = t2-0\r\nprint(max(p))\r\n", "n=int(input());a=list(map(int,input().split()))\r\nprint(abs(a.index(n)-a.index(1))+(max(a.index(n),n-a.index(1)-1) if a.index(n)<a.index(1) else max(a.index(1),n-a.index(n)-1)))", "n=int(input())\r\nparsa=list(map(int,input().split()))\r\nfor i in range(0,n,1):\r\n if i==0:\r\n min=parsa[i]\r\n max=parsa[i]\r\n mn=i\r\n mx=i\r\n if min>parsa[i]:\r\n min=parsa[i]\r\n mn=i\r\n if max<parsa[i]:\r\n max=parsa[i]\r\n mx=i\r\nif mx>mn:\r\n if mx==n-1 and mn==0:\r\n print(n-1)\r\n else:\r\n aval=(n-1)-mx\r\n dovom=mn-0\r\n if aval>=dovom:\r\n print(n-1-mn)\r\n else:\r\n print(mx-0)\r\nelse:\r\n if mx==n-1 and mn==0:\r\n print(n-1)\r\n else:\r\n aval=(n-1)-mn\r\n dovom=mx-0\r\n if aval>=dovom:\r\n print(n-1-mx)\r\n else:\r\n print(mn-0)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif abs(l.index(min(l))-l.index(max(l)))==n-1:\r\n print(n-1)\r\nelse:\r\n ma=l.index(max(l))\r\n mi=l.index(min(l))\r\n print(max(max(abs(mi-0),abs(mi-n+1)),max(abs(ma-0),abs(ma-n+1))))\r\n \r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = a.index(max(a))\r\ny = a.index(min(a))\r\n# print(x, y)\r\nmaks = False\r\nmins = False\r\nfor i in range(len(a)):\r\n if (a[i] == max(a)):\r\n maks = True\r\n break\r\n if (a[i] == min(a)):\r\n mins = True\r\n break\r\n# print(maks, mins)\r\nif (maks):\r\n if (abs(0 - y) >= abs((len(a)-1) - x)):\r\n print(abs(0-y))\r\n else:\r\n print(abs((len(a)-1) - x))\r\nelif (mins):\r\n if (abs(0 - x) >= abs((len(a)-1) - y)):\r\n print(abs(0 - x))\r\n else:\r\n print(abs((len(a)-1) - y))", "import sys\r\ndef input(): return sys.stdin.readline().strip()\r\ndef iinput(): return int(input())\r\ndef minput(): return map(int, input().split()) \r\ndef listinput(): return list(map(int, input().split()))\r\nn=iinput()\r\nl=listinput()\r\nmaxx_i=l.index(max(l))\r\nminn_i=l.index(min(l))\r\nif maxx_i>minn_i:\r\n if abs(maxx_i-(n-1))>abs(minn_i):\r\n print(abs(minn_i-(n-1)))\r\n else:\r\n print(maxx_i)\r\nelse:\r\n if abs(minn_i-(n-1))>abs(maxx_i):\r\n print(abs(maxx_i-(n-1)))\r\n else:\r\n print(minn_i)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin_idx = a.index(min(a))\r\nmax_idx = a.index(max(a))\r\nprint(max(max_idx, min_idx, n - max_idx - 1, n - min_idx - 1))", "n = int(input())\r\na = list(map(int, input().split()))\r\ni1 = a.index(min(a))\r\ni2 = a.index(max(a))\r\ni1, i2 = min(i1, i2), max(i1, i2)\r\nprint(max(i2, n-i1-1))\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nindexMin = arr.index(1)\r\nindexMax = arr.index(n)\r\no1 = n - indexMin - 1\r\no2 = n - indexMax - 1\r\no3 = indexMin\r\no4 = indexMax\r\nprint(max([o1,o2,o3,o4]))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nmi = a.index(1)\r\nmx = a.index(n)\r\n\r\nprint( max( max(n - 1 - mi, n - 1 - mx), max(mi, mx)) ) ", "n=int(input())\r\na=[int(e) for e in input().split()]\r\nl,r=a.index(1),a.index(n)\r\nif l>r:\r\n l,r=r,l\r\nprint(max(n-1-l,r))", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmi = min(l)\r\nma = max(l)\r\nmi_pos = l.index(mi)\r\nma_pos = l.index(ma)\r\nl = min(mi_pos, ma_pos)\r\nr = max(mi_pos, ma_pos)\r\nans = r-l\r\nr_dist = n-1-r\r\nans = ans + max(l, r_dist)\r\nprint(ans)", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = l.index(min(l))\r\nb = l.index(max(l))\r\nprint(max(a, n-1-a, b, n-1-b)) ", "from sys import stdin, stdout\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n \ndef read_ints():\n\treturn list(map(int, read().split()))\n \ndef solve():\n\tn=read_int()\n\ta=read_ints()\n\tfor i in range(n):\n\t\tif a[i]==1:\n\t\t\tx=i\n\t\tif a[i]==n:\n\t\t\ty=i\n\tif abs(x-y)==n-1:\n\t\tprint(n-1)\n\telif x==0 or y==0 or x==n-1 or y==n-1:\n\t\tprint(n-1)\n\telse:\n\t\tprint(max([\n\t\t\tx,y,n-1-x,n-1-y\n\t\t\t]))\n\nsolve()\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nmn = lst.index(min(lst))\r\nmx = lst.index(max(lst))\r\n\r\nprint(max(mn, n - mn - 1, mx, n - mx - 1))\r\n", "m=int(input())\r\na=list(map(int,input().split()))\r\nmini=min(a)\r\nmaxi=max(a)\r\np=a.index(mini)\r\nq=a.index(maxi)\r\nprint(max(p,q,m-1-p,m-1-q))\r\n", "n = int(input())\r\nls = list(map(int,input().split()))\r\npos1 = ls.index(min(ls)); pos2 = ls.index(max(ls))\r\nif pos2<pos1:\r\n pos2,pos1=pos1,pos2\r\nprint(max(n-1-pos1,pos2))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmi, ma = a.index(min(a)) + 1, a.index(max(a)) + 1\r\nprint(max(abs(n - mi), abs(n - ma), abs(1 - mi), abs(1 - ma)))\r\n", "n=int(input())\r\na=*map(int,input().split()),\r\nx,y=sorted([a.index(1),a.index(n)])\r\nprint(max(y,n-1-x))", "n = int(input())\na = [int(i) for i in input().split()]\n\none = a.index(1) + 1\nlast = a.index(n) + 1\n\nprint(max(n - one, n - last, one - 1, last - 1))", "n=int(input());l=list(map(int,input().split()));ma=max(l);mi=min(l);x,y=-1,-1\r\nfor i in range(n):\r\n\tif l[i]==ma:x=i+1\r\n\tif l[i]==mi:y=i+1\r\nx,y=max(x,y),min(x,y);a=max(x-1,n-y);print(max(a,x-y))", "arr_size = int(input())\n\narray = list(map(int, input().split()))\n\nmin_elem_index = array.index(min(array)) \nmax_elem_index = array.index(max(array)) \n\nmin_to_start = max_elem_index\nmin_to_end = arr_size - 1 - max_elem_index\nmax_to_start = min_elem_index \nmax_to_end = arr_size - 1 - min_elem_index\n\nmax_dis = max(min_to_start, min_to_end, max_to_start, max_to_end)\n\nprint(max_dis)\n", "n, lst, mx, mi = int(input()), list(map(int, input().split())), 0, 0\r\nfor x in range(n):\r\n if lst[x] == n: mx = x\r\n elif lst[x] == 1: mi = x\r\nprint(max(mx - 0, n - 1 - mx, mi - 0, n - 1 - mi))", "n = int(input())\r\narr = [int(i) for i in list(input().split())]\r\nmn = float('inf')\r\nmx = -float('inf')\r\nmn_i = 0\r\nmx_i = 0\r\nfor i in range(n):\r\n\tif mx < arr[i]:\r\n\t\tmx = arr[i]\r\n\t\tmx_i = i\r\n\tif mn > arr[i]:\r\n\t\tmn = arr[i]\r\n\t\tmn_i = i\r\nprint(max(n-1-min(mn_i,mx_i), max(mn_i,mx_i)))", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nma = max(lst)\r\nmi = min(lst)\r\n\r\nm = max([lst.index(ma), lst.index(mi), n -lst.index(ma)-1, n-lst.index(mi)-1])\r\nprint(m)", "n = int(input())\r\nar = list(map(int,input().split()))\r\nmin_ar = min(ar)\r\nmax_ar = max(ar)\r\nmin_i = ar.index(min_ar)\r\nmax_i = ar.index(max_ar)\r\nif max_i == 0 and min_i == n-1 or max_i == n-1 and min_i == 0:\r\n print(n-1)\r\nelse:\r\n if max_i >= min_i:\r\n print(max(max_i,n-1-min_i))\r\n else:\r\n print(max(min_i,n-1-max_i))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=l.index(1)\r\ny=l.index(n)\r\nprint(max(max(x,y),n-1-min(x,y)))\r\n", "a=int(input());b=list(map(int,input().split()))\r\nz=b.index(a);z1=b.index(1);print(max(z,z1,a-z-1,a-z1-1))", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\np, q = x.index(1)+1, x.index(n)+1\r\na, b = min(p, q), max(p, q)\r\n\r\nif a - 1 > n - b:\r\n print(b-1)\r\nelse:\r\n print(n-a) ", "n = int(input())\r\np,p2 = 0,0\r\nl = list(map(int,input().split()))\r\nfor i in range(n):\r\n if l[i]==1:\r\n p=i+1\r\n if l[i]==n:\r\n p2=i+1\r\nprint(max(p-1,p2-1,n-p,n-p2))", "n = int(input())\r\nl = list(map(int,input().split()))\r\na = l.index(min(l))+1\r\nb = l.index(max(l))+1\r\nprint(max(max(n-b,b-1),max(n-a,a-1)))", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = []\r\n\r\nfor i, n in enumerate(arr, start=1):\r\n if n == 1 or n == num:\r\n ans.append(abs(num-i))\r\n ans.append(i-1)\r\n\r\nprint(max(ans))\r\n\r\n", "x = int(input()) - 1\r\nls = list(map(int, input().split()))\r\nmn_idx = ls.index(min(ls))\r\nmx_idx = ls.index(max(ls))\r\ndiff = abs(mx_idx - mn_idx)\r\nmv1 = abs(0 - mx_idx)\r\nmv2 = abs(x - mx_idx)\r\nmv3 = abs(0 - mn_idx)\r\nmv4 = abs(x - mn_idx)\r\n\r\nprint(max(mv1, mv2, mv3, mv4))", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = l.index(min(l)) + 1\r\nb = l.index(max(l)) + 1\r\nprint(max(max(abs(1 - a), abs(1 - b)), max(abs(n - a), abs(n - b))))", "n = int(input())\r\na = input().split()\r\n\r\np1 = a.index(\"1\") + 1\r\np2 = a.index(str(len(a))) + 1\r\n\r\nprint(max(abs(p1 - p2), abs(1 - p1), abs(1 - p2), abs(n - p1), abs(n - p2)))", "a=int(input());\r\nb=list(map(int,input().split()))\r\nz=b.index(a);\r\nz1=b.index(1);\r\nprint(max(z,z1,a-z-1,a-z1-1))", "n = int(input())\r\n\r\ns = [int(i) for i in input().split()]\r\n\r\nx = s.index(1)\r\ny = s.index(n)\r\nif y > x:\r\n print(max(y, n - x - 1))\r\nelse:\r\n print(max(x, n - y - 1))\r\n\r\n", "\r\nn = int(input())\r\nrow = input().split()\r\n\r\nidx =0\r\nfor i in row:\r\n row[idx] = int(i)\r\n idx+=1\r\n\r\nidxmax = row.index(max(row)) +1\r\nidxmin = row.index(min(row)) +1\r\n\r\nif idxmax > idxmin:\r\n if (n - idxmax) >= idxmin:\r\n print(n - idxmin)\r\n else:\r\n print(idxmax-1)\r\nelse:\r\n if (n - idxmin) >= idxmax:\r\n print(n - idxmax)\r\n else:\r\n print(idxmin-1)\r\n\r\n\r\n\r\n\r\n", "def maxDistance(arr):\r\n a = []\r\n for idx, val in enumerate(arr):\r\n if val == 1 or val == len(arr):\r\n a.append(idx)\r\n return max(a[1], len(arr) - a[0] - 1)\r\n \r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(maxDistance(arr))\r\n\r\n\r\n", "\r\nn = int(input())\r\nlst = list(map(int, input().strip().split(' ')))\r\nmaxN = minN = lst[0]\r\nindexMax = indexMin = 0\r\nfor b in range(n):\r\n if lst[b] > maxN:\r\n maxN = lst[b]\r\n indexMax = b\r\n if lst[b] < minN:\r\n minN = lst[b]\r\n indexMin = b\r\ndisMax_0 = indexMax\r\ndisMax_n = n - indexMax - 1\r\ndisMin_0 = indexMin\r\ndisMin_n = n - indexMin - 1\r\nans = disMax_0\r\nif (ans < disMax_n):\r\n ans = disMax_n\r\nif ans < disMin_0:\r\n ans = disMin_0\r\nif ans < disMin_n:\r\n ans = disMin_n\r\nprint(ans)\r\n", "def main():\n n = int(input())\n arr = list(map(int, input().split()))\n idx_1 = arr.index(1)\n idx_2 = arr.index(n)\n min_idx = min(idx_1, idx_2)\n max_idx = max(idx_1, idx_2)\n print(max(n - 1 - min_idx, max_idx))\n\n\nmain()\n\n# def main():\n# test_count = int(input())\n# for test_num in range(1, test_count + 1):\n# n, length = map(int, input().split())\n# left_arr = []\n# right_arr = []\n# arr = []\n# for i in range(n):\n# p, d = map(int, input().split())\n# if d == 0:\n# left_arr.append(p)\n# arr.append((p, i + 1))\n# else:\n# right_arr.append(length - p)\n# arr.append((p, i + 1))\n# left_arr.sort()\n# right_arr.sort()\n# arr.sort()\n# left_idx = 0\n# right_idx = 0\n# # print(left_arr, right_arr)\n# res = []\n# while left_idx < len(left_arr) and right_idx < len(right_arr):\n# if left_arr[left_idx] < right_arr[right_idx]:\n# res.append(arr[left_idx][1])\n# left_idx += 1\n# elif right_arr[right_idx] < left_arr[left_idx]:\n# res.append(arr[n - right_idx - 1][1])\n# right_idx += 1\n# else:\n# if arr[left_idx][1] > arr[n - right_idx - 1][1]:\n# res.append(arr[n - right_idx - 1][1])\n# right_idx += 1\n# else:\n# res.append(arr[left_idx][1])\n# left_idx += 1\n# # print(res)\n# while left_idx < len(left_arr):\n# res.append(arr[left_idx][1])\n# left_idx += 1\n# while right_idx < len(right_arr):\n# res.append(arr[n - right_idx - 1][1])\n# right_idx += 1\n# # print(res)\n# print(\"Case #{}: {}\".format(test_num, \" \".join(list(map(str, res)))))\n# return\n#\n#\n# main()\n\n# def min_max(x, y):\n# return (x, y) if x <= y else (y, x)\n#\n#\n# def dist(d, fr, to):\n# low, high = min_max(fr, to)\n# return min(high - low, d - high + low)\n#\n#\n# def solve(d, arr, dp, i, j):\n# if dp[i][j][0] is not None and dp[i][j][1] is not None:\n# return dp[i][j]\n#\n# if dp[i][j][0] is None:\n# suf = solve(d, arr, dp, i + 1, j)\n# dp[i][j][0] = min(suf[0] + dist(d, arr[i + 1], arr[i]),\n# suf[1] + dist(d, arr[j], arr[i]))\n# if dp[i][j][1] is None:\n# pre = solve(d, arr, dp, i, j - 1)\n# dp[i][j][1] = min(pre[0] + dist(d, arr[i], arr[j]),\n# pre[1] + dist(d, arr[j - 1], arr[j]))\n# return dp[i][j]\n#\n#\n# def main():\n# test_count = int(input())\n# for test_num in range(1, test_count + 1):\n# _, d = map(int, input().split())\n# arr = list(map(int, input().split()))\n# arr.insert(0, 0)\n# arr.append(0)\n#\n# dp = [[[None, None] for _ in arr] for _ in arr]\n# for i in range(len(arr)):\n# dp[i][i] = [0, 0]\n#\n# solve(d, arr, dp, 0, len(arr) - 1)\n#\n# print(\"Case #{}: {}\".format(test_num, min(dp[0][len(arr) - 1][0], dp[0][len(arr) - 1][1])))\n#\n#\n# main()\n", "n=int(input())\r\nn1=list(map(int,input().split()))\r\ns=max(n1)\r\nw=min(n1)\r\nv=0\r\nlst=[]\r\nfor i in n1:\r\n if(i!=s and i!=w):\r\n v=v+1\r\n else:\r\n lst.append(v)\r\n v=0\r\nlst.append(v)\r\nm=lst[0]+lst[1]\r\nb=lst[1]+lst[2]\r\nif(m>b):\r\n print(m+1)\r\nelse:\r\n print(b+1)\r\n", "#In the name of God\nn = int(input())\nlst = list(map(int, input().split()))\nmx = lst.index(max(lst))\nmn = lst.index(min(lst))\nif (mx < mn):\n mx, mn = mn, mx\na = max(mx, n - 1 - mn)\nprint(a)\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ns = 0\r\nwhile a[s] != 1:\r\n s += 1\r\nf = 0\r\nwhile a[f] != n:\r\n f += 1\r\nprint(max(s - 0, f - 0, n - 1 - s, n - 1 - f))", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxai = a.index(max(a))\r\nminai = a.index(min(a))\r\nx, y = min(minai, maxai), max(minai,maxai)\r\nprint(max(n-x-1, y))\r\n", "n = int(input())\na = list(map(int, input().split()))\nmin_val = 1\nmax_val = n\nminimum = None\nmaximum = None\nfor i in range(n):\n if a[i] == min_val:\n minimum = i\n if a[i] == max_val:\n maximum = i\ndistances = [abs(i - minimum) for i in range(n)] + [abs(i - maximum) for i in range(n)]\nmax_distance = max(distances)\nprint(max_distance)\n\n \t\t \t \t\t \t \t \t \t \t\t \t \t", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ndata = list(map(int, input().split()))\r\n\r\nf = data.index(min(data))\r\ns = data.index(max(data))\r\n\r\nprint(max(f, s, n - f - 1, n - s - 1))", "n=int(input())\r\nl=list(map(int,input().split()))\r\na,b=l.index(max(l)),l.index(min(l))\r\nprint(max(n-min(a,b)-1,max(a,b)))\r\n", "# A. Nicholas and Permutation\n\nn = int(input())\na = list(map(int, input().split()))\nma = a.index(max(a))\nmi = a.index(min(a))\n\ncurrent_distance = max(ma, mi) - min(ma, mi)\ncandidate_right = (n - 1) - max(ma, mi)\ncandidate_left = min(ma, mi)\nif candidate_right > candidate_left:\n print(n - 1 - min(ma, mi))\nelse:\n print(max(ma, mi))\n", "n = int(input())\r\nnums = list(map(int,input().split()))\r\nmax_ind = nums.index(max(nums))\r\nmin_ind = nums.index(min(nums))\r\ndist_1,dist_2,dist_3,dist_4 = 0,0,0,0\r\nif abs(max_ind - min_ind) == n-1:\r\n print(n-1)\r\nelse:\r\n if max_ind > min_ind:\r\n dist_1 = n-1-min_ind\r\n dist_2 = max_ind\r\n else:\r\n dist_3 = n-1-max_ind\r\n dist_4 = min_ind\r\n print(max(dist_1,dist_2,dist_3,dist_4))", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmin_index = a.index(1)\r\nmax_index = a.index(n)\r\n\r\n# Calculate the initial distance\r\ninitial_distance = abs(min_index - max_index)\r\n\r\n# Determine the cases to maximize the distance\r\nif min_index < max_index:\r\n max_distance = max(initial_distance, max_index, n - 1 - min_index)\r\nelse:\r\n max_distance = max(initial_distance, min_index, n - 1 - max_index)\r\n\r\nprint(max_distance)\r\n", "n = (int)(input())\r\np,p2 = 0,0\r\nmas = list(map(int,input().split()))\r\nfor i in range(n):\r\n if mas[i]==1:\r\n p=i+1\r\n if mas[i]==n:\r\n p2=i+1\r\nprint(max(p-1,p2-1,n-p,n-p2))", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a.index(max(a))\r\ny=a.index(min(a))\r\nif(x==0)or(y==n-1)or(x==n-1)or(y==0):\r\n print(n-1)\r\nelse:\r\n b=[]\r\n b.append(y-0)\r\n b.append(n-y-1)\r\n b.append(x-0)\r\n b.append(n-x-1)\r\n print(max(b))", "n1 = int(input())\r\nlist1 = []\r\nx = input().split()\r\nfor i in x:\r\n list1.append(int(i))\r\n \r\n\r\nindex_max = 0\r\nindex_min =0\r\nflag = 0\r\nfor i in range(len(list1)):\r\n if list1[i] == n1:\r\n index_max = i\r\n flag+=1\r\n elif list1[i]==1:\r\n index_min = i\r\n flag+=1\r\n if flag==2:\r\n break\r\n\r\nprint(max(index_max-0,n1-1 - index_max,n1-1 - index_min, index_min-0))\r\n \r\n ", "n=int(input())\r\nn-=1 \r\na=list(map(int,input().split()))\r\nprint(n-min(a.index(min(a)),abs(a.index(min(a))-n),min(a.index(max(a)),abs(a.index(max(a))-n))))\r\n", "\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\na = l.index(min(l))\r\nb = l.index(max(l))\r\n\r\nprint(max(a,b,abs(n-a-1),abs(n-b-1)))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif(l[0]==1 and l[-1]==n or l[0]==n and l[-1]==1):\r\n\tprint(n-1)\r\nelse:\r\n\ta=l.index(1)\r\n\tb=l.index(n)\r\n\tprint(max(a,b,abs(n-1-b),abs(n-1-a)))\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\nq = min(s)\r\nq = s.index(q)+1; p = s.index(n)+1\r\nif p==n or q==n:\r\n print(n-1)\r\nelse:\r\n a = abs(1-p); b = abs(n-p)\r\n c = abs(1-q); d = abs(n-q)\r\n e = max(a,b); f = max(c,d)\r\n print(max(e,f))", "n = int(input())\r\nli = [int(x) for x in input().split()]\r\nmin_item = li.index(min(li))\r\nmax_item = li.index(max(li))\r\nmax_dist = 0\r\nlires = []\r\n\r\nif min_item < max_item:\r\n ldist = max_item\r\n rdist = n-1-min_item\r\n lires.append(ldist)\r\n lires.append(rdist)\r\n\r\nif max_item < min_item:\r\n ldist2 = min_item\r\n rdist2 = n-1- max_item\r\n lires.append(ldist2)\r\n lires.append(rdist2)\r\n\r\n\r\nprint(max(lires))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nprint(max(n-1-min(l.index(1),l.index(n)),max(l.index(1),l.index(n))))", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\nb=a*1;b.sort()\r\nlow=a.index(b[0])+1\r\nhigh=a.index(b[-1])+1\r\n\r\nif low>high:\r\n low,high=high,low\r\n\r\nprint(max(n-low,high-1))", "n = int(input())\r\nw = list(map(int, input().split()))\r\na = w.index(1)\r\nb = w.index(n)\r\nprint(max(a, b, n-1-a, n-1-b))", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=a.index(max(a))\r\nl=a.index(min(a))\r\nprint(max(k,l,n-1-k,n-1-l))\r\n", "n = int(input())\r\nL = [int(x) for x in input().split()]\r\n[m, M] = [min(L.index(1), L.index(n)), max(L.index(1), L.index(n))]\r\nprint(max(n-1-m, M))\r\n", "n = int(input())\r\narray = input()\r\narray = array.split()\r\nfor i in range(n) :\r\n if int(array[i]) == 1 :\r\n n1 = i\r\n elif int(array[i]) == n :\r\n n2 = i\r\nn3 = n-n1-1\r\nn4 = n-n2-1\r\nout = max(n1,n2,n3,n4)\r\nprint(out)\r\n", "n = int(input())\r\narr = list(map(int,input().strip().split()))\r\n\r\nminm = 1\r\nmaxm = n\r\n\r\ni = arr.index(minm)\r\nj = arr.index(maxm)\r\n\r\nprint(max(n-1-i,n-1-j,j,i))\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input());l=[int(x) for x in input().split()];print(max(l.index(n),l.index(1),n-l.index(n)-1,n-l.index(1)-1))\r\n \r\n\r\n", "n = int(input())\nv = list(map(int, input().split()))\na = v.index(1)\nb = v.index(n)\nm, M = sorted([a, b])\nprint(max(n - 1 - m, M))\n", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nma = l.index(n)\r\nmi = l.index(1)\r\nprint(max(ma, mi, n - ma - 1, n - mi - 1))", "n, lst = int(input()), list(map(int, input().split()))\r\nx = 1 + lst.index(1)\r\ny = 1 + lst.index(n)\r\nprint(max([abs(x - y), max(x, y) - 1, n - min(x, y)]))", "n = int(input())\r\narr = list(map(int,input().split()))\r\none_index = arr.index(1) \r\nn_index = arr.index(n)\r\nif one_index<n_index:\r\n if one_index>=n-1-n_index:\r\n print(n_index)\r\n else:\r\n print(n-1-one_index)\r\nelse:\r\n if n_index>=n-1-one_index:\r\n print(one_index)\r\n else:\r\n print(n-1-n_index)", "n=int(input())\r\na=list(map(int,input().split()))\r\nl=a.index(1)\r\nr=a.index(n)\r\nif l>r:\r\n\tprint(max(n-1-r,l-0))\r\nelse:\r\n\tprint(max(n-1-l,r-0))\t", "num = int(input())\r\nline = input().split()\r\nseq = [int(i) for i in line]\r\n\r\nmaxo = max(seq)\r\nmino = min(seq)\r\n\r\nmaxind = seq.index(maxo)\r\nminind = seq.index(mino)\r\n\r\ndist = 0\r\n\r\nif (maxind == 0 and minind == len(seq) - 1) or (maxind == len(seq) - 1 and minind == 0 ) :\r\n dist = abs(maxind - minind)\r\n \r\nelif maxind <= (len(seq)-1)/2 and minind <= (len(seq) - 1)/2 :\r\n dist = len(seq) - 1 - min(maxind, minind)\r\n \r\nelif maxind >= (len(seq) -1)/2 and minind >= (len(seq) - 1)/2 :\r\n dist = max(maxind, minind) \r\n \r\nelse :\r\n if maxind > minind :\r\n if abs(maxind - (len(seq) -1)/2) > abs(minind - (len(seq) -1)/2) :\r\n dist = maxind\r\n else :\r\n dist = len(seq) - 1 - minind\r\n \r\n else :\r\n if abs(maxind - (len(seq) -1)/2) > abs(minind - (len(seq) -1)/2) :\r\n dist = len(seq) - 1 - maxind\r\n else :\r\n dist = minind\r\n \r\n \r\nprint(dist)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = a.index(n)\r\nc = a.index(1)\r\nans = 0\r\nif c < b:\r\n d = n - 1 - c\r\n ans = max(b, d)\r\nelse:\r\n d = n - 1 - b\r\n ans = max(d, c)\r\nprint(ans)", "n = int(input())\r\nl = list(map(int , input().split())) \r\nidx_m = l.index(max(l)) \r\nidx_mi = l.index(min(l))\r\ndistance_swap_min_last = abs(idx_m - (n-1)) \r\ndistance_swap_min_first = abs(idx_m - 0) \r\ndistance_swap_max_last = abs((n-1) - idx_mi) \r\ndistance_swap_max_firs = abs(idx_mi - 0) \r\nprint(max(distance_swap_max_firs, distance_swap_max_last , distance_swap_min_first , distance_swap_min_last))", "n = input()\r\na = input().split()\r\n\r\nmin_pos = a.index('1')\r\nmax_pos = a.index(n)\r\n\r\nn = int(n) - 1\r\nprint(max(abs(min_pos), abs(min_pos - n), abs(max_pos), abs(max_pos - 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())\r\n\r\n#--------------------------------WhiteHat010--------------------------------------#\r\nn = get_int()\r\nlst = get_int_list()\r\nmi = lst.index(min(lst))\r\nmx = lst.index(max(lst))\r\n\r\nif mi<mx:\r\n a = abs(mi-0)\r\n b = abs(n-1-mx)\r\n print( abs(mx-mi) + max(a,b))\r\nelse:\r\n a = abs(n-1-mi)\r\n b = abs(mx-0)\r\n print(abs(mx-mi) + max(a,b))\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\n############ ---- Input Functions ---- ############\r\n# inp — For taking integer inputs.\r\ndef inp():\r\n return(int(input()))\r\n\r\n# inlt — For taking List inputs.\r\ndef inlt():\r\n return(list(map(int,input().split())))\r\n\r\n# insr — For taking string inputs. Actually it returns a List of Characters, instead of a string, which is easier to use in Python, because in Python, Strings are Immutable.\r\ndef insr():\r\n s = input()\r\n return(list(s[:len(s) - 1]))\r\n\r\n# invr — For taking space seperated integer variable inputs.\r\ndef invr():\r\n return(map(int,input().split()))\r\n\r\n##### Output functions #####\r\ndef printList(strings):\r\n for string in strings:\r\n print(string)\r\n\r\n\r\nn = inp()\r\na = invr()\r\n\r\nlist_a = list(a)\r\n\r\nidx_max = list_a.index(n)\r\nidx_min = list_a.index(1)\r\n\r\nmax_idx = max(idx_max, idx_min, abs(n-1-idx_max), abs(n-1-idx_min))\r\nprint(max_idx)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\none = l.index(1)+1\r\nlast = l.index(n)+1\r\nprint(max(abs(n-one) , abs(n-last) , abs(1-one) , abs(1-last)))", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nmx = a.index(max(a))\r\nmi = a.index(min(a))\r\nl = len(a)-1\r\nprint(max(mx-mi,l-mx,l-mi,mx,mi))", "n = int(input())\r\nar = list(map(int, input().rstrip().split()))\r\np, r = 0, 0\r\nfor i in range(n):\r\n if ar[i] == n or ar[i] == 1:\r\n p = i\r\n break\r\nar.reverse()\r\nfor j in range(n):\r\n if ar[j] == n or ar[j] == 1:\r\n r = j\r\n break\r\nif p>r:\r\n print(n-r-1)\r\nelse:\r\n print(n-p-1)\r\n", "num = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmx = 0\r\nfor i, n in enumerate(arr, start=1):\r\n if n == 1 or n == num:\r\n mx = max(mx, num-i)\r\n mx = max(mx, i-1)\r\n\r\nprint(mx)\r\n\r\n\r\n", "MOD = 10 ** 9 + 7\r\n\r\nfrom heapq import *\r\nfrom queue import *\r\nimport sys, math, bisect\r\nfrom collections import Counter, defaultdict\r\nfrom math import *\r\n\r\ninput = lambda: sys.stdin.buffer.readline().decode().strip()\r\n# print = sys.stdout.write\r\ninl = lambda: list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = inl()\r\n x, y = a.index(1), a.index(n)\r\n dis = abs(x - y)\r\n\r\n index = sorted([x, y])\r\n\r\n dis += max(index[0], n - index[-1] - 1)\r\n print(dis)\r\n\r\n\r\nfor _ in range(int(1)):\r\n solve()\r\n", "n=int(input());r=[*map(int,input().split())];print(max(r.index(min(r)),n-r.index(min(r))-1,r.index(max(r)),n-r.index(max(r))-1))", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=a.index(max(a))\r\ne=a.index(min(a))\r\nc=b-0\r\nd=(n-1)-b\r\nf=e-0\r\ng=(n-1)-e\r\nprint(max(c,d,f,g))", "n = int(input())\r\narr = list(map(int , input().split()))[:n]\r\nmini = 0\r\nmaxu = 1\r\nmaxi = 0\r\nfor i in range(0,n):\r\n if(arr[i]==1):\r\n mini = i\r\n elif(arr[i]>maxu):\r\n maxu = arr[i]\r\n maxi = i\r\nif(abs(maxi-mini)==n-1):\r\n print(abs(maxi-mini))\r\nelse:\r\n c = mini\r\n d = maxi\r\n e = max(n-mini-1,n-maxi-1)\r\n print(max(c,d,e))", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nmini,maxi = l.index(min(l)),l.index(max(l))\r\nprint(max(mini,maxi,n-maxi-1,n-mini-1))", "n = int(input())\r\narr = list(map(int,input().split()))\r\nminInd = arr.index(min(arr))\r\nmaxInd = arr.index(max(arr))\r\n\r\ndist1 = abs(maxInd-minInd)\r\ndist2 = max(abs(maxInd-n+1),maxInd)\r\ndist3 = max(abs(minInd-n+1),minInd)\r\n\r\nprint(max(dist1,dist2,dist3))", "n = int(input())\r\na = [int(s) for s in input().split(' ')]\r\nm = [a.index(1), a.index(n)]\r\nprint(max(max(m), n - min(m) - 1))", "#A. Nicholas and Permutation\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\n\r\na = l.index(1)\r\nb = l.index(n)\r\n\r\nprint(max(a , b , n-a - 1 , n-b-1))\r\n\r\n", "n=int(input())-1\r\na=[*map(int,input().split())]\r\nprint(max(a.index(1),n-a.index(1),a.index(n+1),n-a.index(n+1)))\r\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\nans = max(n-arr.index(1)-1,n-arr.index(n)-1,arr.index(n),arr.index(1))\r\nprint(ans)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\nd1 = nums.index(1)\r\ndn = nums.index(n)\r\n\r\nif d1<dn:\r\n if max(d1,n-dn-1) == d1:\r\n print(dn)\r\n else:\r\n print(n-d1-1)\r\nelse:\r\n if max(n-d1-1, dn) == dn:\r\n print(d1)\r\n else:\r\n print(n-dn-1)", "n = int(input())\r\nlst = [*map(int, input().split())]\r\npos1 = lst.index(1)\r\nposn = lst.index(n)\r\nprint(max(pos1, posn, n - pos1 - 1, n - posn - 1))\r\n", "def result(l):\r\n m = l.index(max(l))\r\n n = l.index(min(l))\r\n diff = abs(m-n)\r\n \r\n# if (m==0) | (m==len(l)-1) | (n==0) | (n==(len(l)-1)):\r\n# return len(l)-1\r\n \r\n \r\n if m < n :\r\n if len(l)-m-1 <= n :\r\n temp = l[m]\r\n l[m]= l[0]\r\n l[0] = temp\r\n else:\r\n temp = l[n]\r\n l[n]= l[-1]\r\n l[-1] = temp \r\n \r\n elif m > n :\r\n if len(l)-n-1 <= m:\r\n temp = l[n]\r\n l[n]= l[0]\r\n l[0] = temp \r\n \r\n else :\r\n temp = l[m]\r\n l[m]= l[-1]\r\n l[-1] = temp\r\n \r\n return l\r\n\r\nn = int(input())\r\np = [int(x) for x in input().split()]\r\nq = result(p)\r\nprint(abs(q.index(max(q))-q.index(min(q)))) ", "x=int(input())\r\nl1=list(map(int,input().split()))\r\nmin_index=l1.index(min(l1))+1\r\nmax_index=l1.index(max(l1))+1\r\nif min_index<max_index:\r\n print(max(x-min_index,max_index-1))\r\nelse:\r\n\tprint(max(x-max_index,min_index-1))\r\n\r\n", "# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░╔═══╗╔╗╔═══╦═══╗\r\n# ░░░░░░░░░░░░░░░░░░░░░░░░░░░░║╔═╗╠╝║║╔═╗║╔═╗║\r\n# ╔══╦═╗╔══╦═╗╔╗░╔╦╗╔╦══╦╗╔╦══╬╝╔╝╠╗║║║║║╠╝╔╝║\r\n# ║╔╗║╔╗╣╔╗║╔╗╣║░║║╚╝║╔╗║║║║══╬╗╚╗║║║║║║║║░║╔╝\r\n# ║╔╗║║║║╚╝║║║║╚═╝║║║║╚╝║╚╝╠══║╚═╝╠╝╚╣╚═╝║░║║░\r\n# ╚╝╚╩╝╚╩══╩╝╚╩═╗╔╩╩╩╩══╩══╩══╩═══╩══╩═══╝░╚╝░\r\n# ░░░░░░░░░░░░╔═╝║░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n# ░░░░░░░░░░░░╚══╝░░░░░░░░░░░░░░░░░░░░░░░░░░░░\r\n\r\na = int(input())\r\nb = list(map(int,input().split()))\r\nc=len(b)-1\r\nprint(max(c-b.index(a),c-b.index(1),b.index(a),b.index(1)))", "n=int(input())\r\nl=list(map(int,input().split()[:n]))\r\na=l.index(1)\r\nb=l.index(n)\r\nprint(max(a,b,abs(a-n+1),abs(b-n+1)))", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nmi = min(l)\r\nma = max(l)\r\ninitial = abs(l.index(ma)-l.index(mi))\r\n\r\ns = n - max(l.index(mi), l.index(ma))-1\r\nf = n - initial - s -1\r\nprint(initial+max(f, s))", "n=int(input())\r\na=list(map(int,input().split()))\r\nmini=0\r\nmaxi=0\r\ni=0\r\nc=0\r\nwhile i<n:\r\n if a[i]==1:\r\n mini=i\r\n c+=1\r\n if a[i]==n:\r\n maxi=i\r\n c+=1\r\n if c==2:\r\n break\r\n i=i+1\r\nif mini<maxi:\r\n k1=mini-0\r\n k2=n-1-maxi\r\n if k1>k2:\r\n mini=0\r\n else:\r\n maxi=n-1\r\n print(abs(maxi-mini))\r\nelse:\r\n k1=n-1-mini\r\n k2=maxi\r\n if k1>k2:\r\n mini=n-1\r\n else:\r\n maxi=0\r\n print(abs(mini-maxi))", "n=int(input())\r\na=list(map(int,input().split()))\r\ni1,i2=a.index(1),a.index(n)\r\nprint(abs(i1-i2)+max(min(i1,i2),n-1-max(i1,i2)))", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\ni=a.index(1)+1\r\nj=a.index(n)+1\r\n\r\nprint(max([n-j,n-i,j-1,i-1]))", "n = int(input())\r\na = list(map(int,input().split()))\r\nk1 = a.index(1)\r\nkn = a.index(n)\r\nprint(max(max(k1,kn),n-1-min(k1,kn)))", "n=int(input())\r\ns=list(map(int,input().split()))\r\nma=s.index(n)+1\r\nmi=s.index(1)+1\r\nprint(max(abs(n-ma),abs(n-mi),abs(1-mi),abs(1-ma)))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmina = 1000\r\nmaxa = 0\r\ni_min = 0\r\ni_max = 0\r\nN = n -1\r\nfor i in range(n):\r\n if(a[i] > maxa):\r\n i_max = i\r\n maxa = a[i]\r\n if(a[i] < mina):\r\n i_min = i\r\n mina = a[i]\r\nif(abs(i_max - i_min) == (n -1)):\r\n print(n-1)\r\nelse:\r\n print(max(i_min, N-i_min,i_max, N-i_max))", "n = int(input())\r\na = list(map(int, input().split(' ')))\r\nx, y = a.index(1), a.index(n)\r\nprint(max(x, y, n - 1 - x, n - 1 - y))\r\n", "n = int(input())\nm = list(map(int, input().split()))\nma, mi = m.index(n), m.index(1)\nma, mi = max(ma, mi), min(ma, mi)\nprint(max(ma, n-ma-1, n-1-mi, mi-1))", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\ndm = 0\r\nfor i in range(n):\r\n if(a[i] == 1 or a[i] == n):\r\n dm = max(dm, i, n - i - 1)\r\nprint(dm)\r\n \r\n \r\n\r\n\r\n \r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nposmin,posmax=a.index(min(a)),a.index(max(a))\r\nprint(max(n-1-posmin,posmin,n-1-posmax,posmax))", "x = int(input())\r\ny = [int(i) for i in input().split()]\r\nprint(max(x-1-y.index(max(y)), x-1-y.index(min(y)), y.index(max(y)), y.index(min(y))))\r\n#print(x-1-y.index(max(y)), x-1-y.index(min(y)), y.index(max(y)), y.index(min(y)))\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n print(max(abs(a.index(max(a)) - n + 1),abs(a.index(min(a)) - n + 1),abs(a.index(max(a))),abs(a.index(min(a)))))", "n=int(input())\r\nar=list(map(int,input().split()))\r\na=ar.index(min(ar))\r\nb=ar.index(max(ar))\r\nprint(max(a,b,n-a-1,n-b-1))\r\n", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\na=min(arr)\r\nb=max(arr)\r\npos=[]\r\nfor i in range(n):\r\n\tif arr[i]==a or arr[i]==b:\r\n\t\tpos.append(i)\r\n\tif len(pos)==2:\r\n\t\tbreak\r\n#print(pos)\r\nprint(max(n-1-min(pos),max(pos)-0))", "sze = int(input())\r\nlst = list(map(int, input().split()))\r\nminPos = lst.index(1)\r\nmaxPos = lst.index(sze)\r\ntemp1 = abs((maxPos + 1) - 1)\r\ntemp2 = abs((maxPos + 1) - sze)\r\ntemp3 = abs((minPos + 1) - 1)\r\ntemp4 = abs((minPos + 1) - sze)\r\nans = [temp1, temp2, temp3, temp4]\r\nprint(max(ans))", "n, a = int(input()), [int(i) for i in input().split()]\nma, mi = 0, 0\nfor i, x in enumerate(a):\n mi = i if x == 1 else mi\n ma = i if x == n else ma\nmi, ma = sorted([mi + 1, ma + 1])\nres = max(n - mi, ma - 1)\nprint(res)\n", "n = int(input())\r\na = list(map(int, input().split()))[:n]\r\nmino = a[0]\r\nmaxo = a[0]\r\nmaxi = 0\r\nmini = 0\r\nfor i in range(1, n):\r\n if a[i] < mino:\r\n mino = a[i]\r\n mini = i\r\n if a[i] > maxo:\r\n maxo = a[i]\r\n maxi = i\r\n\r\nx = [maxi, mini, n-maxi-1, n-mini-1]\r\nx.sort()\r\nprint(max(n-x[0]-1, x[3]))", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\na = arr.index(min(arr))\r\nb = arr.index(max(arr))\r\n\r\nprint(max(a, b, n - 1 - a, n - 1 - b))", "n = int(input())\r\nl_n = list(map(int, input().split()))\r\n\r\nmax_i = l_n.index(max(l_n))\r\nmin_i = l_n.index(min(l_n))\r\n\r\nprint(max(max_i, min_i, n - min_i - 1, n - max_i - 1))", "n=int(input())\r\nlist=[int(i) for i in input().split()]\r\na=list.index(min(list))\r\nb=n-1-list.index(min(list))\r\nc=list.index(max(list))\r\nd=n-1-list.index(max(list))\r\nprint(max(a,b,c,d))", "input()\r\nnums = input().rstrip().split(\" \")\r\nfor i in range(len(nums)):\r\n nums[i] = int(nums[i])\r\nmxInx = nums.index(max(nums))\r\nmnInx = nums.index(min(nums))\r\nif mxInx == 0 or mnInx == len(nums)-1 or mnInx == 0 or mxInx == len(nums)-1:\r\n print(len(nums)-1)\r\n\r\nelse:\r\n if mnInx < len(nums)-1-mxInx:\r\n o1 = len(nums)-1-mnInx\r\n else:\r\n o1 = mxInx\r\n \r\n\r\n if mxInx < len(nums)-1-mnInx:\r\n o2 = len(nums)-1-mxInx\r\n else:\r\n o2 = mnInx\r\n print(max(o1, o2))", "n = int(input())\na = list(map(int, input().split()))\nx, y = a.index(1), a.index(n)\nx, y = max(x, y), min(x, y)\nprint(max(n - 1 - y, x))\n", "from math import ceil\nfrom sys import stdin\n\ninput = stdin.readline\n\nif __name__ == '__main__':\n n = int(input())\n arr = list(map(int, input().split()))\n\n fp = None\n sp = None\n\n for i, x in enumerate(arr):\n if x == n or x == 1:\n if fp is None:\n fp = i\n else:\n sp = i\n\n print(max(n - fp - 1, sp))", "n = int(input())\r\n*a, = map(int, input().split())\r\nind1 = a.index(1) + 1\r\nind2 = a.index(n) + 1\r\nif ind1 > ind2:\r\n print(max(n - ind2, ind1 - 1))\r\nelse:\r\n print(max(n - ind1, ind2 - 1))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nidx1 = a.index(1)\r\nidxN = a.index(n)\r\n\r\nif(idxN-idx1>0):\r\n if(n-1-idxN>idx1-0):\r\n ans = n-1-idx1\r\n else:\r\n ans = idxN\r\nelse:\r\n if(n-1-idx1>idxN-0):\r\n ans = n-1-idxN\r\n else:\r\n ans = idx1\r\nprint(ans)\r\n", "input()\r\nl = list(map(int,input().split()))\r\na,b = min(l), max(l)\r\ndist = float('-inf')\r\nfor i in range(len(l)):\r\n for j in range(len(l)):\r\n l[i], l[j] = l[j], l[i]\r\n dist = max(dist,abs(l.index(a)-l.index(b)))\r\n l[i], l[j] = l[j], l[i]\r\nprint(dist)", "n = int(input())\r\nli = list(map(int,input().split()))\r\na = li.index(max(li))\r\nb = li.index(min(li))\r\nprint(max(a,b,n-(a+1),n-(b+1)))", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nu, v = a.index(1), a.index(n)\r\nif u > v:\r\n u, v = v, u\r\nans = n - min(u, n - v - 1) - 1\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=min(l.index(max(l)),l.index(min(l)))\r\nb=min(l[::-1].index(max(l)),l[::-1].index(min(l)))\r\nprint(n-min(a,b)-1)", "k=int(input())\r\nn=list(map(int,input().split()))\r\nif ((n[0]==1 and n[k-1]==k) or (n[0]==k and n[k-1]==1)):\r\n print(k-1)\r\nelse:\r\n a=n.index(1)+1\r\n b=n.index(k)+1\r\n if a==k or b==k:\r\n print(k-1)\r\n elif a>b:\r\n print(max(a-1,k-b))\r\n else:\r\n print(max(b-1,k-a))", "n = int(input())\nnums = [int(_) for _ in input().split()]\n\na = nums.index(1)\nb = nums.index(n)\nprint(max(a, n-1-a, b, n-1-b))\n\n \t \t\t \t\t \t \t\t\t \t\t\t \t\t \t \t", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l.index(1)\r\nb=l.index(n)\r\nt=abs(a-b)\r\nif a>b :\r\n p=n-(a+1)\r\n q=b\r\nelse:\r\n p=n-(b+1)\r\n q=a\r\n\r\nif p>q :\r\n print(t+p)\r\nelse:\r\n print(t+q)\r\n ", "# Online Python compiler to run Python online\nn=int(input())\na=*map(int,input().split()),\nx,y=sorted([a.index(1),a.index(n)])\nprint(max(y,n-1-x))\n \t \t \t \t\t\t\t \t \t \t \t\t", "n=int(input())\r\na=list(map(int, input().split()))\r\nma=a.index(max(a))+1\r\nmi=a.index(min(a))+1\r\nx=max(ma,mi)-1\r\ny=n-min(ma,mi)\r\nprint(max(x,y))", "n=int(input())\r\nlst=[int(i) for i in input().split()]\r\na=lst.index(min(lst))\r\nb=lst.index(max(lst))\r\nmin1=min([a,b])\r\nmax1=max([a,b])\r\n#print(min1,max1)\r\nprint(max([max1,(n-1)-min1]))\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmn = 0\r\nmx = 0\r\nfor i in range(n):\r\n\tif l[i] == 1:\r\n\t\tmn = i\r\n\telif l[i] == n:\r\n\t\tmx = i\r\nprint(max(n - 1 - min(mn, mx), max(mn, mx)))", "def answer():\r\n a =int(input())\r\n b = input().split()\r\n b = [int(x) for x in b]\r\n up=max(b)\r\n down=min(b)\r\n print(max(len(b)-b.index(up)-1,len(b)-b.index(down)-1,b.index(up),b.index(down)))\r\nanswer()", "n = int(input())\r\nli = list(map(int, input().split()))\r\n\r\nfor i in range(n):\r\n if li[i] == 1:\r\n mni = i+1\r\n if li[i] == n:\r\n mxi = i+1\r\n\r\nprint(max([abs(n-mni), abs(n-mxi), abs(1-mni), abs(1-mxi)]))\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\ni,j=l.index(1),l.index(n)\r\nprint(max(i,j,n-i-1,n-j-1))", "\r\nn=int(input())\r\nt=list(map(int,input().split()))\r\nmx=max(t)\r\nmi=min(t)\r\na=t.index(mx)\r\nb=t.index(mi)\r\nprint(max(abs((n-1)-a),abs((n-1)-b),abs(0-a),abs(0-b)))\r\n\r\n\r\n\r\n ", "n=int(input())\r\na=[int(a) for a in input().split()]\r\nfirst=a.index(1)\r\nlast=a.index(n)\r\nmaxi=max(max(abs(first-0),abs(first-(n-1))),max(abs(last-0),abs(last-(n-1))))\r\nprint(maxi)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nr=sorted(l)\r\np=l.index(r[0])\r\nh=l.index(r[n-1])\r\nif p<h:\r\n\to=p\r\n\ty=n-1-h\r\n\tif o>y:\r\n\t\tprint(h)\r\n\telse:\r\n\t\tprint(n-1-p)\r\nelse:\r\n\to=h\r\n\ty=n-1-p\r\n\tif o>y:\r\n\t\tprint(p)\r\n\telse:\r\n\t\tprint(n-1-h)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Jan 9 17:34:41 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn = int(input())\r\nlis = list(map(int,input().split()))\r\n\r\ni = lis.index(1)\r\nj = lis.index(n)\r\n\r\nif i<j:\r\n dis1 = i\r\n dis2 = n-1-j\r\n if dis1>dis2:\r\n print(j)\r\n else:\r\n print(n-1-i)\r\nelse:\r\n dis1 = n-1-i\r\n dis2 = j\r\n if dis1>dis2:\r\n print(n-1-j)\r\n else:\r\n print(i)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin_index = a.index(min(a))\r\nmax_index = a.index(max(a))\r\nprint(max(max_index, min_index, n - max_index - 1, n - min_index - 1))", "arr_size = int(input())\n\narray = list(map(int, input().split()))\n\nmin_index = array.index(min(array)) \nmax_index = array.index(max(array)) \n\nlast = arr_size - 1\nmin_to_start = abs(max_index - 0)\nmin_to_end = abs(last - max_index)\nmax_to_start = abs(min_index - 0)\nmax_to_end = abs(last - min_index)\n\nmax_dis = max(min_to_start, min_to_end, max_to_start, max_to_end)\n\nprint(max_dis)\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ni=arr.index(1)\r\nj=arr.index(n)\r\nif i==0 or j==0 or j==n-1 or j==0:\r\n print(n-1)\r\nelse :\r\n print(max(abs(n-1-i),abs(i),abs(j),abs(n-1-j)))", "n = int(input())\r\na = list(map(int,input().split(\" \")))\r\namax,amin = a.index(max(a)),a.index(min(a))\r\nprint(max(amax,amin,n-1-amin,n-1-amax))\r\n\r\n", "\r\nn=int(input())\r\nm=list(map(int,input().split()))\r\na=m.index(1)+1\r\nb=m.index(n)+1\r\nprint(max((n-a),(n-b),(a-1),(b-1)))", "n=input()\r\ns=input().split()\r\nM=s.index(n)\r\nn=int(n)\r\nm=s.index('1')\r\nprint(max(m,M,n-m-1,n-1-M))", "def main():\r\n n = int(input())\r\n ns = list(map(int, input().split()))\r\n\r\n min_pos = -1,\r\n max_pos = -1\r\n for idx, e in enumerate(ns):\r\n if e == 1:\r\n min_pos = idx\r\n elif e == n:\r\n max_pos = idx\r\n print(max(max(n - 1 - min_pos, min_pos - 0), max(n - 1 - max_pos, max_pos - 0)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n\r\n\r\n", "n = int(input())\r\nx = [int(x) for x in input().split()]\r\nminpos = x.index(min(x))\r\nmaxpos = x.index(max(x))\r\n\r\nif(minpos>maxpos):\r\n d1 = (n-1)-(minpos)\r\n d2 = maxpos-0\r\n print((minpos-maxpos)+max(d1,d2))\r\nelse:\r\n d1 = (n-1)-(maxpos)\r\n d2 = minpos-0\r\n print((maxpos-minpos)+max(d1,d2))", "n = int(input()) ; l = [int(x) for x in input().split()]\r\nprint(max(l.index(n), l.index(1), n - l.index(n) - 1, n - l.index(1) - 1))\r\n \r\n\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=min(l)\r\nb=max(l)\r\nlist1=[]\r\nfor i in l:\r\n\tif i==a or i==b:\r\n\t\tlist1.append(l.index(i))\r\nx=list1[0]-0\r\ny=n-1-list1[1]\r\nif x>y:\r\n\tprint(list1[1]-0)\r\nelse:\r\n\tprint(n-1-list1[0])", "n = int(input())\r\n\r\na = [int(c) for c in input().split()]\r\nid_mn = a.index(min(a))\r\nid_mx = a.index(max(a))\r\nprint(max(id_mn,id_mx,n-id_mn-1,n-id_mx-1))\r\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nl = oi = a.index(1)\r\nr = ni = a.index(n)\r\nif l > r:\r\n l, r = r, l\r\ndr = n - 1 - r\r\nif l > dr:\r\n dr = l\r\nprint(r - l + dr)", "n = int(input())\r\narr1 = list(map(int,input().split()))\r\nindex1 = arr1.index(1)\r\nindex2 = arr1.index(n)\r\nif abs(index1 - index2) == n - 1:\r\n ans = n - 1\r\nelse:\r\n if index1 == 0 or index2 == 0 or index1 == n - 1 or index2 == n - 1:\r\n ans = n - 1\r\n elif 0 < index1 < n - 1 or 0 < index2 < n - 1:\r\n base = max(index1,index2)\r\n ans = max(base,(n -1 - min(index1,index2)))\r\nprint(ans)", "\r\n\r\nn = int(input())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\na = x.index(max(x))\r\nb = x.index(min(x))\r\n\r\nprint(max(a , b , n - 1 - a , n - 1 - b))", "n = int(input())\na = list(map(int, input().split()))\ni, j = a.index(1) + 1, a.index(n) + 1\nif abs(i-j) == n-1:\n print(n-1)\nelse:\n print(max(n-i, i-1, n-j, j-1))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ni1=a.index(1)+1\r\niN=a.index(n)+1\r\nif abs(iN-i1)==n-1 or i1==1 or iN==1 or iN==n or i1==n:\r\n print(n-1)\r\nelse:\r\n print(max(abs(n-i1),abs(i1-1),abs(iN-n),abs(iN-1)))\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nx = a.index(1) + 1\r\ny = a.index(n) + 1\r\nprint(max(abs(n-x),abs(n-y),abs(1-x),abs(1-y)))", "def main_function():\r\n n = int(input())\r\n p = [int(i) for i in input().split(\" \")]\r\n counter_one = 0\r\n counter_two = 0\r\n firts_item_found = False\r\n second_item_found = False\r\n ind_one = -1000\r\n ind_two = -1000\r\n for i in range(len(p)):\r\n if (p[i] == 1 or p[i] == n) and not firts_item_found:\r\n firts_item_found = True\r\n ind_one = i + 1\r\n elif not firts_item_found:\r\n counter_one += 1\r\n elif firts_item_found and (p[i] == 1 or p[i] == n):\r\n second_item_found = True\r\n ind_two = i + 1\r\n elif second_item_found:\r\n counter_two += 1\r\n if counter_one > counter_two:\r\n ind_one = 1\r\n else:\r\n ind_two = n\r\n return ind_two - ind_one\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nprint(main_function())", "def req_func(arr, n):\r\n min_index = arr.index(1)\r\n max_index = arr.index(n)\r\n if n == 3:\r\n return 2\r\n elif n == 2:\r\n return 1\r\n elif min_index > max_index:\r\n if (n-1)-min_index > max_index:\r\n return (n-1)-max_index\r\n else:\r\n return min_index\r\n elif min_index < max_index:\r\n if (n-1)-max_index > min_index:\r\n return (n-1)-min_index\r\n else:\r\n return max_index\r\n \r\n \r\nn = int(input())\r\narr = list(map(int,input().strip().split()))[:n]\r\nprint(req_func(arr,n))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nif a.index(1) < a.index(n):\r\n\tprint(a.index(n) - a.index(1) + max((n - 1 - a.index(n)), a.index(1)))\r\nelse:\r\n\tprint(a.index(1) - a.index(n) + max((n - 1 - a.index(1)), a.index(n)))", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin_index = a.index(1)\r\nmax_index = a.index(n)\r\nif min_index > max_index:\r\n min_index, max_index = max_index, min_index\r\nprint(max(n - min_index - 1, max_index))\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 1\r\nfor i in range(n):\r\n if a[i] == 1 or a[i] == n:\r\n ans = max(ans, i, n-i-1)\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin_elt = 105\r\nmax_elt = 0\r\nmax_ind = -1\r\nmin_ind = -1\r\nfor i in range(n):\r\n if a[i] > max_elt:\r\n max_elt = a[i]\r\n max_ind = i\r\n if a[i] < min_elt:\r\n min_elt = a[i]\r\n min_ind = i\r\nif min_ind in [0, n - 1] or max_ind in [0, n - 1]:\r\n print(n - 1)\r\nelse:\r\n mn = min(min_ind, max_ind)\r\n mx = max(min_ind, max_ind)\r\n ans = max(mx, (n - 1) - mn)\r\n print(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nz = min(a.index(min(a)),a.index(max(a)))\r\nx = max(a.index(min(a)),a.index(max(a)))\r\nprint(max(x,n-1-z))", "n=int(input())\r\nl=list(map(int, input().split()))\r\n\r\nmi = l.index(1)+1\r\nma = l.index(n)+1\r\nprint(max(abs(n-mi), abs(mi - 1) ,abs(n - ma) ,abs(ma - 1 )))\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\na=x.index(max(x))\r\nb=x.index(min(x))\r\nprint(max(a,b,abs(n-a-1),abs(n-b-1)))", "#Nicholas and Permutation\r\nn = int(input())\r\nli = list(map(int,input().split()))\r\nc = min(li.index(1),li.index(n))\r\nc1 = max(li.index(1),li.index(n))\r\nli1 = []\r\nif abs(li.index(1)-li.index(n))<(len(li)-1):\r\n li1.append((len(li)-1)-c)\r\nif abs(li.index(1)-li.index(n))<c1:\r\n li1.append(c1)\r\nelse:\r\n li1.append(abs(li.index(1)-li.index(n)))\r\n#print(li1)\r\nprint(max(li1))", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nx=lst.index(max(lst));y=lst.index(min(lst));\r\na=x\r\nb=n-1-x\r\nc=y\r\nd=n-1-y\r\nprint(max(a,b,c,d))" ]

[ "import sys\r\nimport math\r\nfrom collections import Counter\r\n\r\n# n = int(input())\r\n# a = list(map(int, input().split()))\r\n\r\nn, k = map(int, input().split())\r\nless = []\r\nmore = []\r\ni = 1\r\ncount = 0\r\nroot = int(math.sqrt(n))\r\n\r\nwhile i <= root :\r\n if n % i == 0 :\r\n less.append(i)\r\n if i * i != n:\r\n more.append(n // i)\r\n if len(less) >= k :\r\n break\r\n i += 1\r\nif k > len(less) + len(more) :\r\n print(-1)\r\nelse :\r\n if k > len(less) :\r\n print(more[-(k - len(less))])\r\n else :\r\n print(less[k - 1])\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\n\r\ndiv = set()\r\n\r\nfor i in range(1, int(n**0.5)+1):\r\n if n%i == 0:\r\n div.add(i)\r\n div.add(n//i)\r\n\r\nif len(div) >= k:\r\n div = sorted(div)\r\n\r\n print(div[k-1])\r\nelse:\r\n print(\"-1\")\r\n \r\n", "n,k=[int(i) for i in input().split()]\r\n\r\nz=n**(0.5)\r\nflag=0\r\nif(z==int(z)):\r\n\tz=int(z)\r\n\tflag=1\r\n\r\narr=[]\r\nif(flag==0):\r\n\tcount=0\r\n\tfor i in range(1,int(z)+1):\r\n\t\tif(n%i==0):\r\n\t\t\tarr.append(i)\r\n\t\t\tarr.append(n//i)\r\n\r\n\r\n\tarr.sort()\r\n\ttry:\r\n\t\tprint(arr[k-1])\r\n\texcept:\r\n\t\tprint('-1')\r\n\r\nelse:\r\n\tcount=0\r\n\tfor i in range(1,int(z)+1):\r\n\t\tif(n%i==0 and i!=int(z)):\r\n\t\t\tarr.append(i)\r\n\t\t\tarr.append(n//i)\r\n\t\telif(n%i==0 and i==int(z)):\r\n\t\t\tarr.append(i)\r\n\r\n\tarr.sort()\r\n\ttry:\r\n\t\tprint(arr[k-1])\r\n\texcept:\r\n\t\tprint('-1')\r\n", "arr=set()\nn,k=map(int,input().split())\nfor i in range(1,int(n**.5)+1):\n if n%i==0:arr.add(i);arr.add(n//i)\nif k>len(arr):print(-1)\nelse:print(sorted(arr)[k-1])\n", "#Mamma don't raises quitter.................................................\r\n#manan is improving, keep hustling manan bhai ;)\r\nfrom collections import deque as de\r\nimport math\r\nfrom queue import PriorityQueue as pq\r\nfrom collections import Counter as cnt\r\nfrom functools import reduce\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\ndef di():return map(int, input().split())\r\ndef ii():return int(input())\r\ndef li():return list(map(int, input().split()))\r\ndef si():return list(map(int, input()))\r\ndef indict():\r\n dic = {}\r\n for index, value in enumerate(input().split()):\r\n dic[int(value)] = int(index)\r\n return dic\r\ndef frqdict(): \r\n # by default it is for integer input. :)\r\n dic={}\r\n for index, value in enumerate(input().split()):\r\n if value not in dic:\r\n dic[value] =1\r\n else:\r\n dic[value] +=1\r\n return dic\r\n\r\n#sys.stdin = open('input.txt', 'r')\r\n#sys.stdout = open('output.txt', 'w')\r\n#i am survivor! yes i am :)\r\nn,k=di()\r\ndiff=sorted(list(factors(n)))\r\nif len(diff) < k:\r\n print(-1)\r\nelse:\r\n print(diff[k-1])\r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n\r\n \r\n \r\n\r\n \r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n \r\n \r\n \r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n1", "n,k = map(int,input().split())\r\ni=1\r\ndivs = []\r\nwhile i*i<=n:\r\n if n%i==0:\r\n j = n//i\r\n if i==j:\r\n divs+=[i]\r\n else:\r\n divs+=[i,j]\r\n i+=1\r\ndivs.sort()\r\n#print(divs)\r\nif k>len(divs):\r\n print(-1)\r\nelse:\r\n print(divs[k-1])", "def k_th(n,k):\r\n i=1;\r\n a = []\r\n while i*i<=n:\r\n if n%i==0:\r\n a.append(i)\r\n if i*i!=n:\r\n a.append(n//i)\r\n i+=1\r\n a.sort()\r\n if k>len(a):return -1\r\n return a[k-1]\r\n\r\na,b = map(int,input().split())\r\nprint(k_th(a,b))", "import math,sys\r\ninput=sys.stdin.readline\r\nn,k=map(int,input().split())\r\nl=set()\r\ni=1\r\nwhile i<=math.sqrt(n):\r\n if n%i==0:\r\n if n//i!=i:\r\n l.add(i)\r\n l.add(n//i)\r\n else:\r\n l.add(i)\r\n i+=1\r\nl=list(l)\r\nl.sort()\r\nif k-1<len(l):\r\n print(l[k-1])\r\nelse:\r\n print(-1)", "import sys,math,io,os,time,itertools,collections\r\nmod=10**9+7\r\nfrom collections import deque\r\nsys.setrecursionlimit(10000)\r\ni=sys.stdin.readline\r\np=sys.stdout.write\r\n#use sys.stdout.write() (remember to convert to str b4 and concatenate \"\\n\")\r\nglobal start,end\r\n\r\ndef div(n):\r\n l=deque()\r\n p=int(math.sqrt(n))\r\n for k in range(p,0,-1):\r\n if n%k==0:\r\n if n//k==k:\r\n l.append(k)\r\n else:\r\n l.append(n//k)\r\n l.appendleft(k)\r\n return l\r\n\r\ndef main():\r\n n,K=[int(k) for k in i().split()]\r\n l=div(n)\r\n if K>len(l):\r\n p(\"-1\\n\")\r\n else:\r\n p(str(l[K-1])+\"\\n\")\r\n\r\nt=1\r\n#t=int(i())\r\nstart=time.perf_counter()\r\nfor _ in range(t):\r\n main()\r\nend=time.perf_counter()\r\n#print(end-start)", "import math\r\na=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(1,int(math.sqrt(a[0]))+1):\r\n if(a[0]%i==0):\r\n s.append(i)\r\n if(i*i!=a[0]):\r\n s.append(a[0]//i)\r\ns.sort()\r\nif(len(s)<a[1]):\r\n print(-1)\r\nelse:\r\n print(s[a[1]-1])", "import math\n\nn, k = map(int, input().split())\ndivs = []\n\nfor i in range(1, int(math.sqrt(n)) + 1):\n if n % i == 0:\n divs.append(i)\n if n // i != i:\n divs.append(n // i)\n\ndivs.sort()\nprint(divs[k - 1] if k <= len(divs) else -1)", "import sys\r\nfrom math import*\r\ninput=sys.stdin.buffer.readline\r\nimport os\r\n\r\nn,k=map(int,input().split())\r\n\r\ndiv=[]\r\ncount=0\r\nans=0\r\nlast=0\r\nfor i in range(1,int(sqrt(n))+1):\r\n\tif n%i==0:\r\n\t\tlast=i\r\n\t\tcount+=1\r\n\t\tif count==k:\r\n\t\t\tans=i\r\n\t\t\tbreak\r\n\t\telse:\r\n\t\t\tdiv.append(n//i)\r\nif ans!=0:\r\n\tprint(ans)\r\nelse:\r\n\tif last==div[-1]:\r\n\t\tdiv.pop()\r\n\tdiv=div[::-1]\r\n#\tprint(div)\r\n#\tprint(count)\r\n\tif (k-count)<=len(div):\r\n\t\tprint(div[k-count-1])\r\n\telse:\r\n\t\tprint(\"-1\")\r\n", "import collections\nimport itertools\n\nn, k = map(int, input().split())\ndef prime_factors(n):\n i = 2\n while i * i <= n:\n if n % i == 0:\n n //= i\n yield i\n else:\n i += 1\n\n if n > 1:\n yield n\n\n\ndef prod(iterable):\n result = 1\n for i in iterable:\n result *= i\n return result\n\n\ndef get_divisors(n):\n pf = prime_factors(n)\n\n pf_with_multiplicity = collections.Counter(pf)\n\n powers = [\n [factor ** i for i in range(count + 1)]\n for factor, count in pf_with_multiplicity.items()\n ]\n\n for prime_power_combo in itertools.product(*powers):\n yield prod(prime_power_combo)\n\nres = list(get_divisors(n))\nres.sort()\nif len(res) >= k:\n print(res[k - 1])\nelse:\n print(-1)", "import math\nn, k = input().split(\" \")\nn, k = int(n), int(k)\n\nres = set()\n\nfor i in range(1, int(math.sqrt(n))+1):\n if n%i == 0:\n res.add(i)\n res.add(int(n/i))\n \nres = list(res)\n\nif len(res) < k:\n print(-1)\n\nelse:\n res.sort()\n print(res[k-1])", "from math import sqrt\r\nn,k=map(int,input().split())\r\nt=[]\r\nfor el in range(1,int(sqrt(n))+1):\r\n if n%el==0:\r\n if k==1:\r\n print(el)\r\n exit()\r\n k-=1\r\n if el!=n//el:\r\n t.append(n//el)\r\nt=t[::-1]\r\nif len(t)<k:\r\n print(-1)\r\nelse:\r\n print(t[k-1])", "import math\nn, k = map(int, input().split())\nx = int(math.sqrt(n) + 1)\ndivisors = []\nfor i in range(1,x):\n if n % i == 0:\n y = int(n/i)\n if i not in divisors:\n divisors.append(i)\n if y not in divisors:\n divisors.append(y)\ndivisors.sort()\np = len(divisors)\nif p >= k:\n print(divisors[k-1])\nelse:\n print(-1)\n\t\t\t \t \t\t \t\t\t \t \t \t", "n, k = map(int, input().split())\r\ndivs = []\r\n\r\nfor i in range(1, int(n**0.5)+1):\r\n if n%i==0:\r\n divs.append(i)\r\n \r\n if i!=n//i:\r\n divs.append(n//i)\r\n\r\ndivs.sort()\r\n\r\nif k>len(divs):\r\n print(-1)\r\nelse:\r\n print(divs[k-1])", "from math import sqrt\r\n\r\ndef get_divisors(n):\r\n m = int(sqrt(n))\r\n divisors = set()\r\n for d in range(1, m + 1):\r\n if n % d == 0:\r\n divisors.add(d)\r\n divisors.add(n // d)\r\n divisors = list(divisors)\r\n divisors.sort()\r\n return divisors\r\n\r\nn, k = map(int, input().split())\r\n\r\ndivs = get_divisors(n)\r\nl = len(divs)\r\nif k > l:\r\n print(-1)\r\nelse:\r\n print(divs[k - 1])", "from math import sqrt\r\nn,k = [int(i) for i in input().split()]\r\nl=[]\r\nhashl=[]\r\nfor i in range(int(sqrt(n))+2):\r\n hashl.append(0)\r\nfor i in range(1,int(sqrt(n))+2):\r\n if (n%i==0):\r\n if (hashl[i]==0):\r\n if (i!=(n//i)):\r\n l.append(i)\r\n l.append(n//i)\r\n else:\r\n l.append(i) \r\n hashl[i]=1\r\n if (n//i<int(sqrt(n))+2):\r\n hashl[n//i]=1\r\nl.sort()\r\nlength=len(l)\r\nif (length<k):\r\n print (-1)\r\nelse:\r\n print (l[k-1]) \r\n", "import math\r\nx,k=map(int,input().split())\r\nlist=[]\r\n#print(int(math.sqrt(x)))\r\nfor i in range(1,int(math.sqrt(x))+1):\r\n if(i!=x/i and x%i==0):\r\n list.append(i)\r\n list.append(int(x/i))\r\n elif(x%i==0):\r\n list.append(i)\r\nlist.sort()\r\n# print(list)\r\nif(len(list)<k):\r\n print(-1)\r\nelse:\r\n print(list[k-1])\r\n\r\n\r\n", "n,k=map(int,input().split())\nfirst=[]\nsecond=[]\nfor i in range(1,int(n**0.5)+1):\n if n%i==0:\n if i!=n//i:\n first.append(i)\n second.append(n//i)\n else:\n first.append(i)\ntry:\n if k>len(first):\n print(second[-(k-len(first))])\n else:\n print(first[k-1])\nexcept:\n print(-1)", "from math import ceil\n\ndef solve():\n n, k = [int(x) for x in input().split()]\n div = set()\n for i in range(1, ceil(n**.5), 1):\n if n % i == 0:\n div.add(i)\n for i in range(ceil(n**.5), 0, -1):\n if n % i == 0:\n div.add(n//i)\n div = list(div)\n\n try:\n print(div[k-1])\n except IndexError:\n print(-1)\n\n\nsolve()\n\t \t \t\t\t\t\t \t \t\t\t \t \t\t\t", "import math\r\n\r\nn, k = map(int, input().split())\r\n\r\nroot = int(math.sqrt(n))\r\nlista = []\r\nfor i in range(1, root + 1):\r\n if n % i == 0:\r\n lista.append(i)\r\n if i != n // i:\r\n lista.append(n // i)\r\n\r\nlista.sort()\r\n\r\nif k <= len(lista):\r\n print(lista[k - 1])\r\nelse:\r\n print(\"-1\")\r\n", "from math import sqrt\r\n\r\nn, k = map(int, input().split())\r\nsize = 0\r\nlimit = int(sqrt(n)) + 1\r\ndivisors = []\r\n\r\nfor i in range(1, limit):\r\n if n % i == 0:\r\n divisors.append(i)\r\n size += 1\r\n\r\n if i != (n // i):\r\n divisors.append(n//i)\r\n size += 1\r\n\r\ndivisors.sort()\r\n\r\nif size >= k:\r\n print(divisors[k - 1])\r\nelse:\r\n print(-1)", "from sys import stdin\r\nfrom math import floor, sqrt\r\ninp = stdin.readline\r\n\r\nn, k = map(int, inp().split())\r\narr = []\r\n\r\nfor i in range(1, floor(sqrt(n)) + 1):\r\n if n % i == 0:\r\n arr.append(i)\r\n\r\nif len(arr) >= k:\r\n print(arr[k-1])\r\nelif len(arr)*2 >= k and sqrt(n) != int(sqrt(n)):\r\n print(n//arr[len(arr)*2 - k])\r\nelif len(arr)*2 > k:\r\n print(n//arr[len(arr)*2 - k - 1])\r\nelse:\r\n print(-1)\r\n", "import sys\r\nimport math\r\n#import 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,k=invr()\r\n\r\ndiv=[]\r\n\r\nlimit=int(math.sqrt(n+1))\r\n\r\nfor i in range(1,limit+1):\r\n\tif n%i==0:\r\n\t\tdiv.append(i)\r\n\t\tif i*i!=n:\r\n\t\t\tdiv.append(n//i)\r\n\r\ndiv.sort()\r\n\r\nif len(div)<k:\r\n\tprint(-1)\r\nelse:\r\n\tprint(div[k-1])\r\n\t\r\n\t\t\r\n\t\t\r\n", "n,k=map(int,input().split())\r\narray=[]\r\nfor i in range(1,int(n**.5)+1):\r\n if n%i==0:\r\n array.append(i)\r\n if i*i!=n:\r\n array.append(n//i)\r\narray.sort()\r\nprint(-1if k>len(array) else array[k-1])", "import math\r\nn,k = input().split()\r\nn,k = int(n),int(k)\r\nans = []; ans = []\r\nfor i in range(1,int(math.sqrt(n) + 1)):\r\n if n % i == 0:\r\n ans.append(i);\r\n if n/i != i: ans.append(int(n/i));\r\nmid = int(len(ans)/2)\r\n##print(mid)\r\nif len(ans) % 2 != 0: mid += 1;\r\nk -= 1;\r\n##print(ans)\r\n##print(mid)\r\nif len(ans) <= k:\r\n print(-1)\r\nelif k < mid:\r\n print(ans[2*k])\r\nelse:\r\n k %= mid\r\n ##print(k)\r\n print(ans[2*(int(len(ans)/2) - k - 1) + 1])\r\n", "from math import sqrt\nn, k = (int(x) for x in input().split())\ns, i, st = sqrt(n), 2, {1, n}\nwhile i <= s:\n if n % i == 0:\n st.add(i)\n st.add(n // i)\n i += 1\nls = sorted(st)\nif k > len(ls):\n print(-1)\nelse:\n print(ls[k - 1])", "n, k = map(int, input().split())\r\ni = 2\r\nans = []\r\nfor i in range(1, int(n ** 0.5) + 1):\r\n if n % i == 0:\r\n ans += [i]\r\n if i * i != n:\r\n ans += [n // i]\r\nans.sort()\r\nif k > len(ans):\r\n print(-1)\r\nelse:\r\n print(ans[k - 1])", "from math import *\r\nn, k = map(int, input().split())\r\nl1 = []\r\nl2 = []\r\nfor i in range(1, int(sqrt(n))+1):\r\n if n%i == 0:\r\n if (n//i == i):\r\n l1.append(i)\r\n else:\r\n l1.append(i)\r\n l2.append(n//i)\r\n \r\nl1.extend(l2[::-1])\r\n#print(l1)\r\ntry:\r\n print(l1[k-1])\r\nexcept:\r\n print(-1)\r\n", "n,k=[int(i) for i in input().split()]\r\nif n==1:\r\n if k==1:\r\n print(1)\r\n else :\r\n print(-1)\r\nelse :\r\n z=n**0.5\r\n l=[]\r\n cnt=0\r\n for j in range(1,n):\r\n if j>z:\r\n break\r\n if n%j==0:\r\n l.append(j)\r\n cnt+=1\r\n maxidiv=2*cnt\r\n flag=False\r\n if l[-1]**2==n:\r\n maxidiv-=1\r\n flag=True\r\n if k>maxidiv:\r\n print(-1)\r\n else :\r\n if k<=cnt:\r\n print(l[k-1])\r\n else :\r\n k-=cnt\r\n if flag==True:\r\n k+=1\r\n k*=-1\r\n print(n//l[k])", "n, k=map(int, input().split())\r\n\r\nf=[]\r\nfor x in range(1, int(n**0.5)+1):\r\n if n%x==0:\r\n f.append(x);\r\n if x*x!=n:\r\n f.append(n//x)\r\nf.sort()\r\nif len(f)<k:\r\n print(-1)\r\nelse:\r\n print(f[k-1])", "import math\r\n\r\nn,k=map(int,input().split())\r\nl=[]\r\n\r\ni=1\r\nwhile i<=math.sqrt(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\r\nif len(l)<k:\r\n print(-1)\r\nelse:\r\n l.sort()\r\n print(l[k-1])", "import random as rnd\r\ndef tst(n):\r\n if n<5:\r\n if n==3 or n==2:\r\n return True\r\n else:\r\n return False\r\n k=len(str(n))*3+1\r\n t=n-1\r\n s=0\r\n while True:\r\n if t%2==0:\r\n t//=2\r\n s+=1\r\n else:\r\n break\r\n for i in range(k):\r\n a=rnd.randint(2,n-2)\r\n x=pow(a,t,n)\r\n c=0\r\n if x==1 or n-x==1:\r\n continue\r\n else:\r\n for i in range(s-1):\r\n x=pow(x,2,n)\r\n if x==1:\r\n return False\r\n if x==n-1:\r\n c=1\r\n break\r\n if c==1:\r\n continue\r\n return False\r\n return True\r\ndef prs(n): \r\n p=[x for x in range(3,n,2)]\r\n for i in p:\r\n if i*i>n:\r\n break\r\n if i>2:\r\n p[p.index(i)+i::i]=[2 for x in p[p.index(i)+i::i]]\r\n x=list(set(p))\r\n x.sort()\r\n return x\r\ndef sqr(x):\r\n if x**0.5%1==0:\r\n return True\r\n else: return False\r\ndef fr(n): #факторизация Шенкса\r\n def fr1(n):\r\n if n**0.5%1==0:\r\n return n**0.5\r\n if n%4==1:\r\n n*=2\r\n d=4*n\r\n k=0\r\n qq=int(d**0.5)\r\n kr=int(n**0.5)\r\n p=[0]\r\n q=[1]\r\n r=[int(n**0.5)]\r\n q.append(n-r[0]**2)\r\n r.append((2*r[0]//q[1]))\r\n p.append(r[0])\r\n for i in range(2,2000000):\r\n p.append(r[i-1]*q[i-1]-p[i-1])\r\n q.append(q[i-2]+(p[i-1]-p[i])*r[i-1])\r\n r.append((p[i]+kr)//q[i])\r\n if i%2==0 and sqr(q[i]):\r\n k=i\r\n dd=int(q[i]**0.5)\r\n break\r\n p1=[-p[k]]\r\n q1=[dd]\r\n r1=[((p1[0]+kr)//q1[0])]\r\n p1.append(r1[0]*q1[0]-p1[0])\r\n q1.append((n-p1[1]**2)/q1[0])\r\n r1.append((p1[1]+kr)//q1[1])\r\n for i in range(2,1000000):\r\n p1.append(r1[i-1]*q1[i-1]-p1[i-1])\r\n q1.append(q1[i-2]+(p1[i-1]-p1[i])*r1[i-1])\r\n r1.append((p1[i]+kr)//q1[i])\r\n if i>0 and p1[i]==p1[i-1]:\r\n return int(q1[i-1])\r\n return 1\r\n dv=fr1(n)\r\n if (n/dv)%1!=0:\r\n dv//=2\r\n if n%dv!=0:\r\n dv=1\r\n if dv==1 and n<10**15:\r\n dv=fr(9834497*n)\r\n if n%dv!=0:\r\n dv=1\r\n return int(dv)\r\ndef frf(n): #факторизация Ферма\r\n t=0\r\n for i in range(int(n**0.5)+0,n):\r\n x=i*i-n\r\n if x>=0 and sqr(x):\r\n d=int(i-x**0.5)\r\n if n%d!=0:\r\n d=1\r\n return(d)\r\ndef f(x):\r\n global d\r\n if tst(x):\r\n d.append(x)\r\n else:\r\n for j in range(78498):\r\n if x%p[j]==0:\r\n while x%p[j]==0:\r\n x//=p[j]\r\n d.append(p[j])\r\n if x==1:\r\n break\r\n if not tst(x) and x!=1:\r\n r=fr(x)\r\n if r==1 or r==x:\r\n r=frf(x)\r\n if r!=1 and r!=x:\r\n x//=r\r\n f(r)\r\n f(x)\r\n else:\r\n return False\r\n else:\r\n x//=r\r\n f(r)\r\n f(x)\r\n elif tst(x):\r\n d.append(x)\r\n return True\r\ndef dv(d0,d1):\r\n d2=[1]\r\n d3=[]\r\n z=1\r\n for i in d1:\r\n z*=(i+1)\r\n d2.append(z)\r\n dn=1\r\n for i in d1:\r\n dn*=(i+1)\r\n pn=len(d1)\r\n dv=[]\r\n for i in range(dn):\r\n h=1\r\n for j in range(pn):\r\n if j==0:\r\n k=1\r\n else:\r\n k=d2[j]\r\n s=(i//k)%(d1[j]+1)\r\n h*=d0[j]**s\r\n d3.append(h)\r\n d3.sort()\r\n return d3\r\ntt=[]\r\np=prs(1000000)\r\nd=[]\r\nx,k=(int(x) for x in input().split())\r\nf(x)\r\nd1=list(set(d))\r\nd1.sort()\r\nd2=[]\r\nfor i in d1:\r\n d2.append(d.count(i))\r\nv=dv(d1,d2)\r\nif k<=len(v):\r\n print(v[k-1])\r\nelse:\r\n print(-1)", "from math import *\r\n# from itertools import combinations\r\nfrom sys import stdin\r\ninput = stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nli = []\r\nfor i in range(1, floor(sqrt(n)) + 1):\r\n if n%i == 0:\r\n li.append(i)\r\n if i != n//i:\r\n li.append(n//i)\r\nif k > len(li):\r\n print(-1)\r\nelse:\r\n print(sorted(li)[k-1])", "n,k = map(int,input().split())\r\nl = []\r\ni = 1 \r\nwhile i*i<=n:\r\n if n%i==0: \r\n l.append(i)\r\n if i!=n//i :\r\n l.append(n//i)\r\n i += 1\r\nl=sorted(l)\r\nif k<=len(l):\r\n print(l[k-1])\r\nelse:\r\n print(-1)", "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\nn,k = map(int, input().split())\r\nd = make_divisors(n)\r\nif len(d) < k:\r\n print(-1)\r\nelse:\r\n print(d[k-1])\r\n", "import sys\r\nfrom math import sqrt\r\nn, k = map(int, input().split())\r\ndiv = []\r\n\r\nfor i in range(1, int(sqrt(n))+1):\r\n if n % i == 0:\r\n if i*i != n:\r\n div.append(n // i)\r\n k -= 1\r\n if k == 0:\r\n print(i)\r\n exit()\r\nfor d in reversed(div):\r\n k -= 1\r\n if k == 0:\r\n print(d)\r\n exit()\r\nprint(-1)\r\n", "\nn,k = map(int,input().split())\n\ndef printDivisors(n):\n l=[]\n i = 1\n while (i * i < n):\n if (n % i == 0):\n l.append(i)\n i += 1\n\n for i in range(int(n**0.5), 0, -1):\n if (n % i == 0):\n l.append(n//i)\n return l\n\n\nres = printDivisors(n)\nif len(res)>=k:\n print(res[k-1])\nelse:\n print(-1)", "def list_divisors(n):\r\n divisors = [1]\r\n half = []\r\n if n == 1:\r\n return divisors\r\n d = 2\r\n while d*d <= n:\r\n if n%d == 0:\r\n divisors.append(d)\r\n d += 1\r\n for x in divisors:\r\n if x == n**(1/2):\r\n pass\r\n else:\r\n half.append(n//x)\r\n return sorted(divisors + half)\r\n\r\nn,k = map(int,input().split())\r\nans = list_divisors(n)\r\nif (k-1) not in range(len(ans)):\r\n print(\"-1\")\r\nelse:\r\n print(ans[k-1])\r\n", "# 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 invr(): return (map(int, input().split()))\ndef yesno(predicate): print(\"Yes\" if predicate else \"No\")\ndef print_arr(arr):\n for v in arr:\n print(v, end=' ')\n print()\nMOD = 998244353\n# autopep8: on\n# endregion\n\n\ndef solve():\n n, k = inlt()\n factors = []\n for i in range(1, int(sqrt(n)) + 1):\n if n % i == 0:\n factors.append(i)\n if i*i != n:\n factors.append(n // i)\n if k > len(factors):\n return -1\n factors.sort()\n return factors[k-1]\n\n\nt = 1\n# t = inp()\nfor _ in range(t):\n print(solve())\n", "import math\r\nimport bisect\r\nfrom collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn,k=M()\r\nc=[]\r\nfor i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n c.append(i)\r\n if i*i!=n:\r\n c.append(n//i)\r\nc.sort()\r\nif k<=len(c): print(c[k-1])\r\nelse: print(-1)\r\n\r\n", "from math import sqrt,ceil\r\nx,y=map(int,input().split())\r\nb=ceil(sqrt(x))\r\nc=[]\r\nfor i in range(1,b+1):\r\n if x%i==0:\r\n c.append(i)\r\n c.append(x//i)\r\nc.sort()\r\nd=set(c)\r\nc=list(d)\r\nif len(c)<y:\r\n print(-1)\r\nelse:\r\n print(c[y-1])", "def solve():\n n,k = list(map(int, input().split()))\n ####### finding divisors #######\n b = []\n i = 1\n while i*i < n: \n if n%i == 0:\n b += [i]\n b += [n//i]\n i += 1\n if i*i == n: b += [i]\n ################################\n b.sort()\n if len(b) < k: print(-1)\n else: print(b[k -1])\n\nsolve()", "def start():\r\n a,b=map(int,input().split())\r\n n=int(a**0.5)\r\n s=[]\r\n for i in range(1,n+1):\r\n if a%i==0:\r\n s.append(i)\r\n s.append(a//i)\r\n ss=sorted(set(s))\r\n if len(ss)<b:\r\n print(-1)\r\n else:\r\n print(ss[b-1])\r\nstart()\r\n", "from sys import stdin\r\n\r\n\r\ndef factorize(n): # o(sqr(n))\r\n c, ans = 1, []\r\n while (c * c < n):\r\n if n % c == 0:\r\n ans.extend([c, n // c])\r\n c += 1\r\n\r\n if c * c == n:\r\n ans.append(c)\r\n return sorted(ans)\r\n\r\n\r\nn, k = map(int, stdin.readline().split())\r\ntry:\r\n print(factorize(n)[k - 1])\r\nexcept:\r\n print(-1)\r\n", "'''input\n866421317361600 26880\n'''\nn, k = map(int, input().split())\na = []\nfor x in range(1, int(n**0.5)+1):\n\tif n % x == 0:\n\t\ta.append(x)\n\t\tif x**2 != n:\n\t\t\ta.append(n//x)\nprint(sorted(a)[k-1] if k <= len(a) else -1)", "n, k = map(int, input().split())\n\ndef divisor(n, k):\n factors = set(x for tup in ([i, n//i] \n for i in range(1, int(n**0.5)+1) if n % i == 0) for x in tup)\n sorted_factors = sorted(factors)\n \n if len(sorted_factors) < k:\n return -1\n else:\n return sorted_factors[k-1]\n\nresult = divisor(n, k)\nprint(result)\n\n\t \t\t \t\t\t\t\t \t\t\t \t\t \t \t\t\t", "def fact(n):\r\n s=set()\r\n x=1\r\n while(x*x<=n):\r\n if(n%x==0):\r\n s.add(n//x)\r\n s.add(x)\r\n x+=1\r\n s=list(sorted(s))\r\n #print(s)\r\n return s\r\nn,k=map(int,input().split())\r\nl=fact(n)\r\nif(k>len(l)):\r\n print(-1)\r\nelse:\r\n print(l[k-1])", "n, k = map(int, input().split())\nc = 0\nans = []\n\nfor i in range(1, int(int(n**(0.5))+1), 1):\n if n % i == 0:\n if i != (n//i):\n c += 2\n ans.append(i)\n ans.append(n//i)\n else:\n c += 1\n ans.append(i)\nif c >= k:\n ans.sort()\n print(ans[k-1])\n exit()\nelse:\n print(-1)", "def getfctrlist(n):\r\n A=[1,n]\r\n for i in range(2,int(n**0.5)+1):\r\n if(n%i==0):\r\n if(n//i == i):\r\n A.append(i)\r\n else:\r\n A.append(i);A.append(n//i)\r\n A = set(A)\r\n A = list(A)\r\n return A\r\n\r\nn,k = map(int,input().split())\r\nF = getfctrlist(n)\r\nF.sort()\r\nif(k>len(F)):\r\n print(\"-1\")\r\nelse:\r\n print(F[k-1])\r\n# priyanshu kumar\r\n\r\n \r\n", "from math import sqrt\n\nn, k = [int(a) for a in input().split()]\n\nd = []\nq = 0\nfor i in range(1,int(sqrt(n))+1):\n if n % i == 0:\n d.append(i)\n q += 1\n if n//i != i:\n d.append(n//i)\n q += 1\n\nd = list(sorted(d))\n\nif q < k:\n print(-1)\nelse:\n print(d[k-1])\n", "n, k = map(int, input().split())\r\ni = 1\r\na = []\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\na = sorted(a)\r\nif len(a) < k:\r\n print(-1)\r\nelse:\r\n print(a[k - 1])", "n, k = map(int, input().split())\ni = 1\na = []\nfor i in range(1, int(n**0.5) + 1) :\n if n % i == 0 :\n a.append(i)\n if i * i != n :\n a.append(n // i)\na.sort()\nprint(-1 if (k > len(a)) else a[k - 1])\n\n\t \t \t \t\t \t\t\t \t \t \t\t\t \t\t", "n, k= list(map(int, input().split()))\r\ndiv = []\r\ni = 1\r\nwhile 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\nif i * i == n:\r\n div.append(n//i)\r\ndiv.sort()\r\nif len(div) < k:\r\n print(-1)\r\nelse:\r\n print(div[k-1])", "# BOOGEYMAN >>> Version 11.0\nimport os, sys, math, itertools, bisect\nfrom string import ascii_lowercase, ascii_uppercase\nfrom collections import deque, defaultdict, OrderedDict, Counter\nii,si = lambda : int(input()), lambda : input() \nmi, msi = lambda : map(int,input().strip().split(\" \")), lambda : map(str,input().strip().split(\" \")) \nli, lsi = lambda : list(mi()), lambda : list(msi())\n\ndef BoogeyMan() -> None:\n '''\n Query\n '''\n def factors(n:int) -> list:\n q = []\n for i in range(1,int(n ** 0.5) + 1):\n if n % i == 0: q.append(i); q.append(n // i)\n return list(sorted(list(set(q))))\n \n a,b = mi()\n l = factors(a)\n try:\n ans = l[b-1]\n print(f\"{ans}\",end=\"\\n\")\n except IndexError:\n print(f\"{-1}\",end=\"\\n\")\n \n \n \nif __name__ == \"__main__\":\n try:\n from baba_yaga import cmdIO, _generator_\n class _BoogeyMan_:\n def __init__(self) -> None: self.launchers = [cmdIO(), BoogeyMan(), _generator_()]\n def init(self) -> None:\n for _ in self.launchers: yield _ ; assert not _ , \"EOF\" \n _BoogeyMan_().init()\n except (FileNotFoundError,ModuleNotFoundError): BoogeyMan()\n \t\t\t \t\t \t\t\t \t\t\t\t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef prime(num):\r\n b=num\r\n \r\n \r\n for i in range(2,num):\r\n if i*i>num:\r\n break\r\n if b%i==0:\r\n return False\r\n return True\r\n \r\n\r\nfor i in range(1):\r\n n,k=map(int,input().split())\r\n \r\n L=[]\r\n for i in range(1,int(n**.5)+1):\r\n if n%i==0:\r\n L.append(i)\r\n if i*i!=n:\r\n L.append(n//i)\r\n L.sort()\r\n if len(L)<k:\r\n print(-1)\r\n else:\r\n print(L[k-1])\r\n", "def find_kth_smallest_divisor(n, k):\n divisors = []\n \n for i in range(1, int(n**0.5) + 1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n // i)\n \n divisors.sort()\n \n if len(divisors) < k:\n return -1\n \n return divisors[k - 1]\n\nn, k = map(int, input().split())\n\nresult = find_kth_smallest_divisor(n, k)\nprint(result)\n\n\t\t\t\t\t \t\t \t\t\t \t\t\t\t\t \t\t\t\t\t", "def ans():\r\n n,k=(map(int, input().split()))\r\n list1=[]\r\n count1=0\r\n for x in range(1,int(n**(0.5)+1)):\r\n if n%x==0:\r\n list1.append(x)\r\n list1.append(n//x)\r\n list2=sorted(set(list1))\r\n if len(list2)<k:\r\n return(-1)\r\n else:\r\n return(list2[k-1]) \r\n \r\nprint(ans())", "n, k = list(map(int,input().split()))\r\ndevs = []\r\niter = 1\r\nwhile iter*iter <= n:\r\n if n%iter == 0:\r\n if iter*iter == n:\r\n devs.append(iter)\r\n else:\r\n devs.append(iter)\r\n devs.append(n//iter)\r\n iter+=1\r\ndevs.sort()\r\n\r\nif k > len(devs):\r\n print(-1)\r\nelse:\r\n print(devs[k-1])\r\n", "import math\nn,k = map(int,input().split())\nli = []\nm = int(math.sqrt(n))\nfor i in range(1,m+1,1):\n if n%i==0:\n li.append(i)\n li.append(n//i)\nli.sort()\ns = set(li)\nlis = list(s)\nif len(lis)>=k:\n print(lis[k-1])\nelse:\n print(-1)\n\t\t\t \t\t\t\t \t\t \t \t \t\t\t \t\t \t", "n,k = map(int,input().split())\nfrom math import sqrt\nfc = []\nfor i in range(1,int(sqrt(n))+1):\n if n % i == 0:\n fc.append(i)\n if n//i != i:\n fc.append(n//i)\n\nfc = sorted(fc)\nif len(fc) < k:\n print(-1)\nelse:\n print(fc[k-1])\n", "n,k=map(int,input().split())\ndivisors = []\nfor i in range(1, int(n**(0.5))+1):\n if n % i == 0:\n divisors.append(i)\n if i != n // i:\n divisors.append(n // i)\ndivisors.sort()\nif k > len(divisors):\n print(-1)\nelse:\n print(divisors[k - 1])\n\t \t \t \t\t\t\t \t\t\t \t \t \t\t \t", "arr = [int(x) for x in input().split()]\nn = arr[0]\nk = arr[1]\ndiv = [] \np = int(pow(n, 0.5)) + 1\nfor x in range(1, p):\n if (n % x == 0):\n div.append(x)\n if (n//x != x):\n div.append(n//x)\ndiv = list(sorted(div))\nif k > len(div):\n print (-1)\nelse:\n print (div[k-1])\n \t\t \t\t\t\t \t \t \t\t \t \t \t\t", "n,k=map(int,input().split())\r\ni=1\r\nl=[]\r\nwhile(i*i<n):\r\n if n%i==0:\r\n l.append(i)\r\n l.append(n//i)\r\n i+=1\r\nif(i*i==n):\r\n l.append(i)\r\nl.sort()\r\nif k>len(l):\r\n print(-1)\r\nelse:\r\n print(l[k-1])", "import math\r\nn,k = map(int,input().split())\r\nli = []\r\nm = int(math.sqrt(n))\r\nfor i in range(1,m+1,1):\r\n if n%i==0:\r\n li.append(i)\r\n li.append(n//i)\r\nli.sort()\r\ns = set(li)\r\nlis = list(s)\r\nif len(lis)>=k:\r\n print(lis[k-1])\r\nelse:\r\n print(-1)", "\r\n\r\nn,k=map(int,input().split())\r\nf=[]\r\nfor i in range(1,int(n**.5)+1):\r\n\tif n%i==0:\r\n\t\tf+=[i]\r\n\t\tif i*i!=n: f+=[n//i]\r\nf=sorted(f)\r\nprint(-1 if len(f)<k else f[k-1])", "from math import sqrt\r\nn,k=map(int,input().split())\r\nif n==1:\r\n if k==1:\r\n print(1)\r\n else:\r\n print(-1)\r\nelse:\r\n i=2\r\n t=sqrt(n)\r\n l=[1]\r\n l2=[n]\r\n k-=1\r\n while i<t:\r\n \r\n if n%i==0:\r\n l.append(i)\r\n g=n//i\r\n l2.append(g)\r\n i+=1\r\n if i==t:\r\n l.append(i)\r\n a=len(l)\r\n b=len(l2)\r\n\r\n\r\n if k<a:\r\n print(l[k])\r\n \r\n elif k<a+b:\r\n k=k-a+1\r\n print(l2[-k])\r\n else:\r\n print(-1)\r\n \r\n", "n, k = [int(x) for x in input().split()]\r\ns = set()\r\narr = []\r\nfor i in range(1, int(n**.5)+1):\r\n if n % i == 0:\r\n s.add(i)\r\n s.add(n//i)\r\narr = [i for i in s]\r\narr.sort()\r\nif k > len(arr):\r\n print(-1)\r\nelse:\r\n print(arr[k-1]) \r\n", "import sys\r\n\r\ndef isprime(n):\r\n if n == 1:\r\n return False\r\n if n == 2:\r\n return True\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 \r\n i = 5\r\n while i**2 <= n:\r\n if (n % i == 0) or (n % (i + 2)) == 0:\r\n return False\r\n i += 6\r\n \r\n return True\r\n\r\ndef factorsof(n):\r\n if n == 1:\r\n return [1]\r\n if n == 2:\r\n return [1, 2]\r\n if n == 3:\r\n return [1, 3]\r\n i = 2\r\n factors_set = {1, n}\r\n while i*i <= n:\r\n if (n % i == 0):\r\n factors_set.add(i)\r\n factors_set.add(n//i)\r\n i += 1\r\n factors = list(factors_set)\r\n factors.sort()\r\n return factors\r\n\r\n\r\ndef answer(n, k):\r\n if k == 1:\r\n return 1\r\n factors = factorsof(n)\r\n if len(factors) < k:\r\n return -1\r\n return factors[k-1]\r\n\r\n\r\n\r\ndef main():\r\n n, k = map(int, sys.stdin.readline().split())\r\n print(answer(n, k))\r\n return\r\nmain()", "n,k = map(int,input().split())\r\nfactors = []\r\nfor j in range(1,int(n**(0.5))+1):\r\n if n%j==0:\r\n factors.append(j)\r\n if n//j!=j:\r\n factors.append(n//j)\r\nfactors.sort()\r\nif k>len(factors):\r\n print(-1)\r\nelse:\r\n print(factors[k-1])", "from __future__ import division, print_function\r\nimport os,sys\r\nfrom io import BytesIO, IOBase\r\nfrom random import randint, randrange\r\nif sys.version_info[0] < 3:\r\n from __builtin__ import xrange as range\r\n from future_builtins import ascii, filter, hex, map, oct, zip\r\n\r\n\r\nfrom math import ceil, floor, factorial, log10\r\n# from math import log,sqrt,cos,tan,sin,radians\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import deque, Counter, defaultdict\r\n# from bisect import bisect,bisect_left,bisect_right,insort,insort_left,insort_right\r\n# from decimal import *\r\n# from heapq import nsmallest, nlargest, heapify, heappop, heappush, heapreplace\r\n# from collections import OrderedDict\r\n# from itertools import permutations\r\n\r\n\r\nM=1000000007\r\n# M=998244353\r\n# INF = float(\"inf\")\r\nINF = 9223372036854775807\r\nPI = 3.141592653589793\r\nR = randrange(2, 1 << 32)\r\n# R = 0 # Enable this for debugging of dict keys in myDict\r\n\r\n# ========================= Main ==========================\r\n\r\ndef memodict(f):\r\n \"\"\"memoization decorator for a function taking a single argument\"\"\"\r\n class memodict(dict):\r\n def __missing__(self, key):\r\n ret = self[key] = f(key)\r\n return ret\r\n return memodict().__getitem__\r\ndef pollard_rho(n):\r\n \"\"\"returns a random factor of n\"\"\"\r\n if n & 1 == 0:\r\n return 2\r\n if n % 3 == 0:\r\n return 3\r\n s = ((n - 1) & (1 - n)).bit_length() - 1\r\n d = n >> s\r\n for a in [2, 325, 9375, 28178, 450775, 9780504, 1795265022]:\r\n p = pow(a, d, n)\r\n if p == 1 or p == n - 1 or a % n == 0:\r\n continue\r\n for _ in range(s):\r\n prev = p\r\n p = (p * p) % n\r\n if p == 1:\r\n return gcd(prev - 1, n)\r\n if p == n - 1:\r\n break\r\n else:\r\n for i in range(2, n):\r\n x, y = i, (i * i + 1) % n\r\n f = gcd(abs(x - y), n)\r\n while f == 1:\r\n x, y = (x * x + 1) % n, (y * y + 1) % n\r\n y = (y * y + 1) % n\r\n f = gcd(abs(x - y), n)\r\n if f != n:\r\n return f\r\n return n\r\n\r\n\r\n@memodict\r\ndef prime_factors(n):\r\n \"\"\"returns a Counter of the prime factorization of n\"\"\"\r\n if n <= 1:\r\n return Counter()\r\n f = pollard_rho(n)\r\n return Counter([n]) if f == n else prime_factors(f) + prime_factors(n // f)\r\n\r\n\r\ndef distinct_factors(n):\r\n \"\"\"returns a list of all distinct factors of n\"\"\"\r\n factors = [1]\r\n for p, exp in prime_factors(n).items():\r\n factors += [p**i * factor for factor in factors for i in range(1, exp + 1)]\r\n return factors\r\n\r\n\r\ndef all_factors(n):\r\n \"\"\"returns a sorted list of all distinct factors of n\"\"\"\r\n small, large = [], []\r\n for i in range(1, int(n**0.5) + 1, 2 if n & 1 else 1):\r\n if not n % i:\r\n small.append(i)\r\n large.append(n // i)\r\n if small[-1] == large[-1]:\r\n large.pop()\r\n large.reverse()\r\n small.extend(large)\r\n return small\r\n\r\n\r\n\r\ndef isPrime(n):\r\n if n <= 3: return n > 1\r\n if n & 1 == 0 or n % 3 == 0: return False\r\n for i in range(5, int(n**0.5)+2, 6):\r\n if n % i == 0 or n % (i + 2) == 0:\r\n return False\r\n return True\r\n\r\ndef primesbelow(N=1000000): # Faster version of Sieve of Erathostenes\r\n \"\"\"\r\n Input N>=3; Returns a list or set of all primes 2 <= p <= N \r\n Use this to iterate over prime numbers.\r\n Don't use this as a substitute for sieve() because\r\n multiple lookups will be slower than sieve() as one lookup takes logN time.\r\n \"\"\"\r\n N += 1 # To make inclusive of N\r\n correction = N % 6 > 1\r\n N = {0:N, 1:N-1, 2:N+4, 3:N+3, 4:N+2, 5:N+1}[N%6]\r\n sieve_bool = [True] * (N // 3)\r\n sieve_bool[0] = False\r\n for i in range(int(N ** .5) // 3 + 1):\r\n if sieve_bool[i]:\r\n k = (3 * i + 1) | 1\r\n sieve_bool[k*k // 3::2*k] = [False] * ((N//6 - (k*k)//6 - 1)//k + 1)\r\n sieve_bool[(k*k + 4*k - 2*k*(i%2)) // 3::2*k] = [False] * ((N // 6 - (k*k + 4*k - 2*k*(i%2))//6 - 1) // k + 1)\r\n \r\n # To return set\r\n # return {(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve_bool[i]}.union({2,3})\r\n \r\n # To return list\r\n return [2, 3] + [(3 * i + 1) | 1 for i in range(1, N//3 - correction) if sieve_bool[i]]\r\n\r\nis_prime = []\r\ndef sieve(n=1000000):\r\n global is_prime\r\n is_prime = [True] * (n + 1)\r\n is_prime[0] = is_prime[1] = False\r\n for i in range(2, int(n ** 0.5) + 1):\r\n if is_prime[i]:\r\n for j in range(i * i, n + 1, i):\r\n is_prime[j] = False\r\n\r\n\r\n\r\n\r\ndef f2(n,i,Ans):\r\n if n==1 or i==1:\r\n return n,Ans\r\n\r\n while n%i==0:\r\n Ans[i] = Ans.get(i,0)+1\r\n n//=i\r\n return n, Ans\r\ndef f(n):\r\n Ans={}\r\n b=[2,3,5]\r\n for b_i in b:\r\n if n%b_i==0:\r\n n,Ans=f2(n,b_i,Ans)\r\n\r\n if n==1:\r\n return Ans\r\n\r\n\r\n\r\n\r\n\r\n n_squr=int(n**0.5)\r\n\r\n k=[1, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 211, 221, 223, 227, 229, 233, 239, 241, 247, 251, 257, 263, 269, 271, 277, 281, 283, 289, 293, 299, 307, 311, 313, 317, 323, 331, 337, 347, 349, 353, 359, 361, 367, 373, 377, 379, 383, 389, 391, 397, 401, 403, 409, 419, 421, 431, 433, 437, 439, 443, 449, 457, 461, 463, 467, 479, 481, 487, 491, 493, 499, 503, 509, 521, 523, 527, 529, 533, 541, 547, 551, 557, 559, 563, 569, 571, 577, 587, 589, 593, 599, 601, 607, 611, 613, 617, 619, 629, 631, 641, 643, 647, 653, 659, 661, 667, 673, 677, 683, 689, 691, 697, 701, 703, 709, 713, 719, 727, 731, 733, 739, 743, 751, 757, 761, 767, 769, 773, 779, 787, 793, 797, 799, 809, 811, 817, 821, 823, 827, 829, 839, 841, 851, 853, 857, 859, 863, 871, 877, 881, 883, 887, 893, 899, 901, 907, 911, 919, 923, 929, 937, 941, 943, 947, 949, 953, 961, 967, 971, 977, 983, 989, 991, 997, 1003, 1007, 1009, 1013, 1019, 1021, 1027, 1031, 1033, 1037, 1039, 1049, 1051, 1061, 1063, 1069, 1073, 1079, 1081, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1121, 1123, 1129, 1139, 1147, 1151, 1153, 1157, 1159, 1163, 1171, 1181, 1187, 1189, 1193, 1201, 1207, 1213, 1217, 1219, 1223, 1229, 1231, 1237, 1241, 1247, 1249, 1259, 1261, 1271, 1273, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1313, 1319, 1321, 1327, 1333, 1339, 1343, 1349, 1357, 1361, 1363, 1367, 1369, 1373, 1381, 1387, 1391, 1399, 1403, 1409, 1411, 1417, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1457, 1459, 1469, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1501, 1511, 1513, 1517, 1523, 1531, 1537, 1541, 1543, 1549, 1553, 1559, 1567, 1571, 1577, 1579, 1583, 1591, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1633, 1637, 1643, 1649, 1651, 1657, 1663, 1667, 1669, 1679, 1681, 1691, 1693, 1697, 1699, 1703, 1709, 1711, 1717, 1721, 1723, 1733, 1739, 1741, 1747, 1751, 1753, 1759, 1763, 1769, 1777, 1781, 1783, 1787, 1789, 1801, 1807, 1811, 1817, 1819, 1823, 1829, 1831, 1843, 1847, 1849, 1853, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1891, 1901, 1907, 1909, 1913, 1919, 1921, 1927, 1931, 1933, 1937, 1943, 1949, 1951, 1957, 1961, 1963, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2021, 2027, 2029, 2033, 2039, 2041, 2047, 2053, 2059, 2063, 2069, 2071, 2077, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2117, 2119, 2129, 2131, 2137, 2141, 2143, 2147, 2153, 2159, 2161, 2171, 2173, 2179, 2183, 2197, 2201, 2203, 2207, 2209, 2213, 2221, 2227, 2231, 2237, 2239, 2243, 2249, 2251, 2257, 2263, 2267, 2269, 2273, 2279, 2281, 2287, 2291, 2293, 2297, 2309]\r\n\r\n for i in range(0,(n_squr+1),2310):\r\n for j in k:\r\n if n%(i+j)==0:\r\n n,Ans=f2(n,i+j,Ans)\r\n\r\n\r\n\r\n if n>1:\r\n Ans[n] = Ans.get(n,0)+1\r\n return Ans\r\n \r\n\r\n\r\n\r\n\r\ndef main():\r\n TestCases = 1\r\n \r\n for _ in range(TestCases):\r\n n, k = [int(i) for i in input().split()]\r\n\r\n a = f(n)\r\n \r\n ex = 1,\r\n for i in a:\r\n new = list()\r\n for j in ex:\r\n for v in range(0,a[i]+1):\r\n new.append(j*i**v)\r\n ex = new\r\n if(len(ex)<k):\r\n print(-1)\r\n else:\r\n print(sorted(ex)[k-1])\r\n\r\n # try:\r\n # print(all_factors(n)[k - 1])\r\n # except:\r\n # print(-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n# ======================== Functions declaration Starts ========================\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\n\r\ndef copy2d(lst): return [x[:] for x in lst] #Copy 2D list... Avoid Using Deepcopy\r\ndef no_of_digits(num): return 0 if num <= 0 else int(log10(num)) + 1\r\ndef powm(num, power, mod=M): return pow(num, power, mod)\r\ndef isPowerOfTwo(x): return (x and (not(x & (x - 1))))\r\ndef LSB(num):\r\n \"\"\"Returns Least Significant Bit of a number (Rightmost bit) in O(1)\"\"\"\r\n return num & -num\r\n\r\ndef MSB(num):\r\n \"\"\"Returns Most Significant Bit of a number (Leftmost bit) in O(logN)\"\"\"\r\n if num <= 0: return 0\r\n ans = 1; num >>= 1\r\n while num:\r\n num >>= 1; ans <<= 1\r\n return ans\r\n\r\n\r\nLB = bisect_left # Lower bound\r\nUB = bisect_right # Upper bound\r\n \r\ndef BS(a, x): # Binary Search\r\n i = bisect_left(a, x)\r\n if i != len(a) and a[i] == x:\r\n return i\r\n else:\r\n return -1\r\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 return (x*y)//gcd(x,y)\r\n\r\n\r\n# import threading\r\n# def dmain():\r\n# sys.setrecursionlimit(1000000)\r\n# threading.stack_size(1024000)\r\n# thread = threading.Thread(target=main)\r\n# thread.start()\r\n \r\n# =============================== Custom Classes ===============================\r\n\r\nclass Wrapper(int):\r\n def __init__(self, x):\r\n int.__init__(x)\r\n def __hash__(self):\r\n return super(Wrapper, self).__hash__() ^ R\r\nInt = lambda x:Wrapper(int(x)) \r\n\r\nclass myDict():\r\n def __init__(self,func=int):\r\n # self.RANDOM = randint(0,1<<32)\r\n self.RANDOM = R\r\n self.default=func\r\n self.dict={}\r\n def __getitem__(self,key):\r\n myKey=self.RANDOM^key\r\n if myKey not in self.dict:\r\n self.dict[myKey]=self.default()\r\n return self.dict[myKey]\r\n def __setitem__(self,key,item):\r\n myKey=self.RANDOM^key\r\n self.dict[myKey]=item\r\n def __contains__(self,key):\r\n myKey=self.RANDOM^key\r\n return myKey in self.dict\r\n def __delitem__(self,key):\r\n myKey=self.RANDOM^key\r\n del self.dict[myKey]\r\n def keys(self):\r\n return [self.RANDOM^i for i in self.dict]\r\n\r\n\r\n# =============================== Region Fastio ===============================\r\nif not os.path.isdir('C:/users/acer'):\r\n BUFSIZE = 8192\r\n \r\n \r\n class FastIO(IOBase):\r\n newlines = 0\r\n \r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n \r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n \r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n \r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\n \r\n \r\n class IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\n \r\n \r\n def 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\n if sys.version_info[0] < 3:\r\n sys.stdin, sys.stdout = FastIO(sys.stdin), FastIO(sys.stdout)\r\n else:\r\n sys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\n \r\n input = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n# =============================== Endregion ===============================\r\n\r\nif __name__ == \"__main__\":\r\n #read()\r\n main()\r\n #dmain()\r\n", "n,k=map(int,input().split())\r\na=[]\r\nm=int(n**0.5)\r\nfor i in range(1,m+1):\r\n if n%i==0:\r\n a.append(i)\r\n a.append(n//i)\r\na=sorted(set(a))\r\nif len(a)<k: print(-1)\r\nelse: print(a[k-1])", "n,k=map(int,input().split())\r\nm,a=int(n**0.5),[]\r\nfor i in range(1,m+1):\r\n if n%i==0: a.append(i),a.append(n//i)\r\na=sorted(set(a))\r\nprint(-1 if len(a)<k else a[k-1])", "import sys\r\n\r\nLI = lambda: list(map(int, sys.stdin.readline().split()))\r\n\r\nnum = LI()\r\ndivs = []\r\nn = num[0]\r\nk = num[1]\r\nfor i in range(1, int(n**0.5)+1):\r\n if n % i == 0:\r\n divs.append(i)\r\n if i != n/i:\r\n divs.append(int(n/i))\r\ndivs.sort()\r\nif k <= len(divs):\r\n print(divs[k-1])\r\nelse:\r\n print(-1)\r\n", "import math\n\nn,k = list(map(int,input().split()))\nd = []\nq = []\nout = -1\nintRoot = math.isqrt(n)\nhasExactRoot = intRoot == math.sqrt(n)\nfor i in range(1,intRoot+1):\n if n % i == 0:\n div = n // i\n d.append(i)\n if not hasExactRoot:\n q.append(div)\n elif hasExactRoot and i != intRoot:\n q.append(div) \nfor i in range(len(q)-1,-1,-1):\n d.append(q[i])\nif k <= len(d):\n out = d[k-1]\nprint(out)\n\t \t\t\t \t \t \t \t\t\t\t \t\t \t", "n, k = map(int, input().split())\r\nl = []\r\nfor i in range(1, int(n ** 0.5) + 1):\r\n if(n % i == 0):\r\n l.append(i)\r\n if(i != n // i):\r\n l.append(n // i)\r\n \r\nl.sort()\r\nif(len(l) < k):\r\n print(-1)\r\nelse:\r\n print(l[k - 1])", "n, k = [int(n) for n in input().split()]\r\n\r\ni = 1;\r\ndivs = list()\r\nwhile(i * i <= n):\r\n if(n % i == 0):\r\n divs.append(i)\r\n if n // i != i: divs.append(n // i)\r\n \r\n i+=1\r\n\r\ndivs.sort()\r\n\r\nif(k > len(divs)): print(-1)\r\nelse: print(divs[k - 1])\r\n", "n, k = map(int, input().split())\r\ni=1\r\na = []\r\nwhile i * i <= n:\r\n if n % i == 0:\r\n a.append(i)\r\n if i * i != n:\r\n a.append(n//i)\r\n i+=1\r\na = sorted(a)\r\nif k > len(a):\r\n print(-1)\r\nelse:\r\n print(a[k-1])", "# def gcd_finder(a,b):\r\n# if a > b:\r\n# while 1:\r\n# if a % b == 0:\r\n# return b\r\n# else:\r\n# c = a % b\r\n# a = b\r\n# b = c\r\n# else:\r\n# while 1:\r\n# if b % a == 0:\r\n# return a\r\n# else:\r\n# c = b % a\r\n# b = a\r\n# a = c\r\n# t = int(input())\r\n# for i in range(t):\r\n# val = list(map(int, input().split()))\r\n# n = len(val)\r\n# max = 0\r\n# for j in range(n-1):\r\n# for k in range(j+1,n,1):\r\n# res = gcd_finder(val[j],val[k])\r\n# if res > max:\r\n# max = res\r\n# print(max)\r\nimport math\r\nn, k = map(int, input().split())\r\nx = int(math.sqrt(n) + 1)\r\ndivisors = []\r\nfor i in range(1,x):\r\n if n % i == 0:\r\n y = int(n/i)\r\n if i not in divisors:\r\n divisors.append(i)\r\n if y not in divisors:\r\n divisors.append(y)\r\ndivisors.sort()\r\np = len(divisors)\r\nif p >= k:\r\n print(divisors[k-1])\r\nelse:\r\n print(-1)", "n, k = list(map(int, input().split()))\r\nl = []\r\n\r\nfor i in range(1, int((n ** 0.5) + 1)):\r\n # print(i)\r\n if n % i == 0:\r\n l.append(i)\r\n if n // i != i:\r\n l.append(n//i)\r\nl.sort()\r\n\r\nif len(l) >= k:\r\n print(l[k - 1])\r\n\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\nimport math\r\ns=[]\r\nif math.sqrt(n)!=int(math.sqrt(n)):\r\n for i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n s.append(i)\r\n s.append(n//i)\r\n if len(s)==2: \r\n if k>=3:\r\n print(-1)\r\n elif k==1:\r\n print(1)\r\n elif k==2:\r\n print(n)\r\n else: \r\n if len(s)<k:\r\n print(-1)\r\n else:\r\n s.sort()\r\n print(s[k-1])\r\nelse:\r\n for i in range(1,int(math.sqrt(n))):\r\n if n%i==0:\r\n s.append(i)\r\n s.append(n//i)\r\n s.append(int(math.sqrt(n))) \r\n \r\n if len(s)<k:\r\n print(-1)\r\n else:\r\n s.sort()\r\n print(s[k-1])\r\n \r\n", "from math import sqrt\r\nx,y=map(int,input().split())\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\nlol.sort()\r\nif len(lol)>=y: \r\n print(lol[y-1])\r\nelse:\r\n print(-1)", "def divisors(n):\r\n res = []\r\n for i in range(1,int(n**0.5)+1):\r\n if n%i==0:\r\n res.append(i)\r\n res.append(n//i)\r\n return res\r\nn,k = map(int,input().split())\r\narr = divisors(n)\r\narr = sorted(set(arr))\r\ncount = 0\r\nfor i in arr:\r\n if count==k-1:\r\n print(i)\r\n break\r\n count+=1\r\nelse:\r\n print(-1)\r\n", "n, kth = map(int, input().split())\r\n\r\ndivs = []\r\nd = 1\r\nwhile d * d <= n:\r\n if n % d == 0:\r\n divs.append(d)\r\n if d != n // d:\r\n divs.append(n // d)\r\n d += 1\r\ndivs.sort()\r\nprint(divs[kth - 1] if len(divs) >= kth else -1)", "a,b=map(int,input().split())\nx=1\ncont=[]\nfor x in range (1, (int(a**.5)+1)):\n\tif a%x==0:\n\t\tcont+=[x]\n\t\tif x*x!=a: cont+=[a//x]\ncont=sorted(cont)\nprint(-1 if len(cont)<b else cont[b-1])\n\n\t\t \t\t\t\t \t \t \t \t \t\t\t \t \t \t\t", "import math\nn,k=map(int,input().split())\nk-=1\narr=[]\nlim=int(math.sqrt(n))\n\n\nfor i in range(1,lim+1,1):\n if(n%i==0):\n if(int(n/i)==int(i)):\n arr.append(i)\n else:\n arr.append(i)\n arr.append(int(n/i))\n\nif(len(arr)<=k):\n print(\"-1\")\nelse:\n x=sorted(arr)\n print(x[k])\n\t \t\t\t\t\t\t\t\t \t \t\t \t \t\t\t \t\t", "def getDivs(n):\r\n res = [1]\r\n if n == 1:\r\n return res\r\n p = 2\r\n\r\n while p * p <= n:\r\n if n % p == 0:\r\n c = p\r\n res2 = res[:]\r\n while n % p == 0:\r\n res.extend([c * x for x in res2])\r\n c *= p\r\n n //= p\r\n p += 1\r\n if n > 1:\r\n res.extend([n * x for x in res])\r\n \r\n res.sort()\r\n return res\r\n\r\nn, k = map(int, input().split())\r\nds = getDivs(n)\r\n\r\nif k > len(ds):\r\n print(-1)\r\nelse:\r\n print(ds[k - 1])\r\n", "n, k = map(int, input().split())\ndivisors1 = []\ndivisors2 = []\nfor i in range(1, int(n**0.5)+1):\n if n % i == 0:\n divisors1.append(i)\n if i != n // i:\n divisors2.append(n//i)\nif(k > len(divisors1) + len(divisors2)):\n print(-1)\nelse:\n if(k <= len(divisors1)):\n print(divisors1[k-1])\n else:\n print(divisors2[-(k-len(divisors1))])\n\n\t \t\t \t \t\t \t \t \t\t\t \t \t \t\t \t\t", "from math import sqrt\r\nfrom collections import defaultdict\r\n\r\n\r\ndef divisors(n):\r\n a = [None] * 30030\r\n a[0], t = 1, 1\r\n for i in range(2, 30030):\r\n if not a[i] is None:\r\n continue\r\n if t * i > 30030:\r\n break\r\n t *= i\r\n for j in range(i * 2, 30030, i):\r\n a[j] = 1\r\n a = [i for i in range(t) if a[i] is None]\r\n d = defaultdict(int)\r\n for i in a[1:]:\r\n while n % i == 0:\r\n n //= i\r\n d[i] += 1\r\n for j in range(1, int(sqrt(n) + 1) // t + 2):\r\n if t * j > n:\r\n break\r\n for ii in a:\r\n i = t * j + ii\r\n while n % i == 0:\r\n n //= i\r\n d[i] += 1\r\n if n > 1:\r\n d[n] += 1\r\n r = [1]\r\n for k, v in d.items():\r\n for c in r[:]:\r\n for i in range(1, v + 1):\r\n r.append(c * (k ** i))\r\n return sorted(r)\r\n\r\n\r\nm, K = [int(j) for j in input().split()]\r\nlst = sorted(divisors(m))\r\nif len(lst) < K:\r\n print(-1)\r\nelse:\r\n print(lst[K - 1])\r\n\r\n", "import sys\r\nimport math\r\nimport bisect\r\n\r\ndef solve(n, k):\r\n A = []\r\n for i in range(1, math.floor(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n A.append(i)\r\n j = n // i\r\n if j != i:\r\n A.append(j)\r\n if len(A) < k:\r\n return -1\r\n A.sort()\r\n return A[k-1]\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n ans = solve(n, k)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import math\r\nn, k = [int(x) for x in input().split()]\r\ndiv = []\r\nfor i in range(1, int(math.sqrt(n)) + 1):\r\n if n % i == 0:\r\n if i * i == n: div.append(i)\r\n else: \r\n div.append(i)\r\n div.append(n // i)\r\ndiv.sort()\r\nif k > len(div): print(-1)\r\nelse: print(div[k - 1])", "n,k = map(int,input().split())\r\nls = []\r\nfor i in range(1,(int(n**(1/2)))+1):\r\n\tif n%i == 0:\r\n\t\tls.append(i)\r\n\t\tif (n//i) != i:\r\n\t\t\tls.append(n//i)\r\nls = sorted(ls)\r\nif (k) > len(ls):\r\n\tprint(-1)\r\nelse:\r\n\tprint(ls[k-1])\r\n", "n,k=map(int,input().split())\r\nl=[]\r\nfor i in range(1,int(n**0.5)+1):\r\n if(n%i== 0):\r\n l+=[i]\r\n if(i*i!=n):\r\n l+=[n//i]\r\nl.sort()\r\nif(k>len(l)): \r\n print(-1)\r\nelse:\r\n print(l[k-1])", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, k = map(int, input().split())\r\nd = []\r\nfor i in range(1, int(n**0.5)+1):\r\n if n % i == 0:\r\n d.append(i)\r\n if i != n//i:\r\n d.append(n//i)\r\nd.sort()\r\nif len(d) < k:\r\n print(-1)\r\nelse:\r\n print(d[k-1])", "from math import*\r\nch=input()\r\nch1=ch.split()\r\nn=int(ch1[0])\r\nk=int(ch1[1])\r\nl=[]\r\nfor i in range(1,int(sqrt(n))+1):\r\n if n%i==0:\r\n l.append(i)\r\n if i!=sqrt(n):\r\n l.append(n//i)\r\nl.sort()\r\nif k>len(l):\r\n print(-1)\r\nelse:\r\n print(l[k-1])\r\n", "from math import sqrt\r\n\r\n\r\ndef get_divisors(n):\r\n divisors = set()\r\n for i in range(1, int(sqrt(n)) + 1):\r\n if n % i == 0:\r\n divisors.add(i)\r\n divisors.add(n // i)\r\n return divisors\r\n\r\n\r\nn, k = map(int, input().split())\r\nd = sorted(get_divisors(n))\r\nk -= 1\r\nif k < len(d):\r\n print(d[k])\r\nelse:\r\n print(-1)", "import sys\r\nimport time\r\nimport random\r\nfrom math import *\r\nfrom types import *\r\nfrom typing import *\r\nfrom functools import cmp_to_key\r\nfrom heapq import heappush, heappop\r\nfrom collections import defaultdict, deque\r\n\r\n# sys.stdin = open('f.in', 'r')\r\n# sys.stdout = open('f.out', 'w')\r\ninput = lambda: sys.stdin.readline().strip()\r\ninf, mod = 10 ** 18, 10 ** 9 + 7\r\nN, M = 3 * 10 ** 5 + 5, 1 * 10 ** 6 + 5\r\n\r\n\r\ndef solve():\r\n n, k = map(int, input().split())\r\n st, bound = set(), int(n**0.5)\r\n for i in range(1, bound + 1):\r\n if n % i == 0:\r\n st.add(i)\r\n st.add(n // i)\r\n\r\n a = sorted(list(st))\r\n print(a[k - 1] if k - 1 < len(a) else -1)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\ndef main():\r\n # sys.setrecursionlimit(int(10e8))\r\n\r\n tt = 1\r\n # tt = int(input())\r\n for _ in range(tt):\r\n solve()\r\n\r\n\r\nmain()\r\n", "import math\r\n\r\nn,k=list(map(int,input().split()))\r\n\r\na=[]\r\n\r\nfor i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n a.append(i)\r\n if(n/i!=i):\r\n a.append(int(n/i))\r\n\r\nif k>len(a):\r\n print(-1)\r\nelse:\r\n a.sort()\r\n print(int(a[k-1]))\r\n", "import math\r\nn, k = map(int, input().split())\r\ndivs = []\r\nfor i in range(1, int(math.sqrt(n)) + 1):\r\n if n % i == 0 and i != math.sqrt(n):\r\n divs.append(i)\r\n divs.append(n // i)\r\n if n % i == 0 and i == math.sqrt(n):\r\n divs.append(i)\r\ndivs.sort()\r\nif k > len(divs):\r\n print(-1)\r\nelse:\r\n print(divs[k - 1])", "import math\r\nn, k = map(int, input().split())\r\nfinal = int(math.sqrt(n))+1\r\ndivisors = set()\r\nfor x in range(1,final+1):\r\n if n % x == 0:\r\n divisors.add(x)\r\n if x != int(n/x):\r\n divisors.add(int(n/x))\r\nans = list(divisors)\r\nans.sort()\r\n#print(ans)\r\nif len(ans) >= k:\r\n print(ans[k-1])\r\nelse:\r\n print(-1)", "n,k = map(int,input().split())\r\nl = []\r\ni = 1 \r\nwhile i*i <= n:\r\n if n%i == 0: \r\n l.append(i)\r\n if i != n//i :\r\n l.append(n//i)\r\n i += 1\r\nl.sort()\r\nif k > len(l):\r\n print(-1)\r\nelse:\r\n print(l[k-1])", "def solve(n,k):\r\n d = 1\r\n ans = []\r\n while d*d < n:\r\n if n%d == 0:\r\n ans.append(d)\r\n ans.append(n//d)\r\n d+=1\r\n if d*d == n:\r\n ans.append(d)\r\n ans.sort()\r\n if len(ans) <k:\r\n return False\r\n else:\r\n print(ans[k-1])\r\n return True\r\nn,k = map(int,input().split())\r\nif not solve(n,k):\r\n print(-1)", "import sys\r\ninput = sys.stdin.readline\r\n\r\ndef divisor(i):\r\n s = []\r\n for j in range(1, int(i ** (1 / 2)) + 1):\r\n if i % j == 0:\r\n s.append(i // j)\r\n s.append(j)\r\n return sorted(set(s))\r\n\r\nn, k = map(int, input().split())\r\ns = divisor(n)\r\ns.append(-1)\r\nans = s[min(k - 1, len(s) - 1)]\r\nprint(ans)", "def fact(n) -> list:\r\n ret = []\r\n i = 1\r\n while i * i <= n:\r\n if n % i == 0:\r\n ret.append(i)\r\n if i * i != n:\r\n ret.append(n // i)\r\n i += 1\r\n ret.sort()\r\n return ret\r\n\r\ndef main() -> None:\r\n n, k = map(int, input().split())\r\n v = fact(n)\r\n # for i in v:\r\n # print(i, end = ' ')\r\n if len(v) < k:\r\n print(\"-1\", end = '')\r\n else:\r\n print(v[k - 1], end = '')\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "from math import sqrt\n\nn, k = map(int, input().split())\ndivs = set()\nfor _ in range(1, int(sqrt(n)) + 1):\n if n % _ == 0:\n divs.add(_)\n divs.add(n // _)\ndivs = sorted(divs)\nif k > len(divs):\n print(-1)\nelse:\n print(divs[k - 1])\n", "inp = list(map(int,input().split()))\r\nn=inp[0]\r\nk=inp[1]\r\nif n==1:\r\n if k==1:\r\n print (1)\r\n else:\r\n print (-1)\r\nelse:\r\n arr=[1]\r\n arr1=[n]\r\n for i in range(2,int(pow(n,0.5))+1):\r\n if n%i==0:\r\n arr.append(i)\r\n if i!=n//i:\r\n arr1.append(n//i)\r\n flag=0\r\n if len(arr)+len(arr1)<k:\r\n print (-1)\r\n flag=1\r\n if k<=len(arr) and flag==0:\r\n print (arr[k-1])\r\n flag=1\r\n elif k>len(arr) and flag==0:\r\n k-=len(arr)\r\n print (arr1[len(arr1)-k])", "import math\n\nn, k = map(int, input().split())\n\nlistDivs = []\ndiv = 1\n\nwhile div <= math.sqrt(n):\n if n % div == 0:\n if n / div == div:\n listDivs.append(div)\n else:\n listDivs.append(div)\n listDivs.append(int(n / div))\n div += 1\nlistDivs.sort()\n\nif len(listDivs) >= k:\n print(listDivs[k-1])\nelse:\n print(-1)\n\t \t \t\t \t \t \t \t \t\t\t\t\t\t \t\t \t", "n,k=map(int,input().split())\r\ndef divisors(n):\r\n lower,upper=[],[]\r\n i=1\r\n while i*i<=n:\r\n if n%i==0:\r\n lower.append(i)\r\n if i!=n//i:\r\n upper.append(n//i)\r\n i+=1\r\n return lower+upper[::-1]\r\n\r\nd=divisors(n)\r\nif len(d)>=k:\r\n print(d[k-1])\r\nelse:\r\n print(-1)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\ndef I(): return input().strip()\r\n\r\n\r\ndef II(): return int(input().strip())\r\n\r\n\r\ndef LI(): return [*map(int, input().strip().split())]\r\n\r\n\r\nimport copy\r\nimport re\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 n,k = LI()\r\n l = []\r\n import math\r\n\r\n\r\n\r\n def printDivisors(n):\r\n list = []\r\n for i in range(1, int(math.sqrt(n) + 1)):\r\n\r\n if (n % i == 0):\r\n\r\n\r\n if (n / i == i):\r\n list.append(i)\r\n else:\r\n list.append(i)\r\n list.append(int(n / i))\r\n return list\r\n\r\n\r\n z = printDivisors(n)\r\n z.sort()\r\n\r\n x = len(z)\r\n\r\n if k > x:\r\n print(-1)\r\n else:\r\n print(z[k - 1])", "def div(x):\r\n i=1;ans=[]\r\n while i*i<=n:\r\n if x%i==0 and i!=x//i:ans.append(i);ans.append(x//i)\r\n elif x%i==0:ans.append(i)\r\n i+=1\r\n return ans\r\nn,k=map(int,input().split())\r\nans=div(n)\r\nif len(ans)<k:print(-1)\r\nelse:ans=sorted(ans);print(ans[k-1])\r\n", "import math as m\r\nn,k = map(int,input().split())\r\nf = []\r\ns = []\r\nfor x in range(1,int(m.sqrt(n))+1):\r\n\tif n%x == 0:\r\n\t\tf.append(x)\r\n\t\tif n//x not in f:\r\n\t\t\ts.append(n//x)\r\nc = f+s[::-1]\r\ntry:\r\n\tprint(c[k-1])\r\nexcept:\r\n\tprint(-1)", "n,k = map(int,input().split(\" \"))\r\ni = 1\r\ndiv = []\r\nwhile i*i<=n:\r\n if n%i == 0:\r\n div.append(i)\r\n if i != n//i:\r\n div.append(n//i)\r\n i+=1\r\ndiv.sort()\r\nif len(div)<k:\r\n print(-1)\r\nelse:\r\n print(div[k-1])", "n,k=map(int,input().split())\r\ni=0\r\nl=[]\r\nc=0\r\nroot=int(n**0.5)\r\nfor j in range(1,root+1):\r\n if n%j==0 and j*j!=n:\r\n l.append(j)\r\n l.append(int(n/j))\r\n c+=2\r\n elif j*j==n: \r\n l.append(j)\r\n c+=1\r\nl.sort()\r\nif k>c:\r\n print(-1)\r\nelse:\r\n print(l[k-1])", "### PREYANSH RASTOGI\n### 2017176\n\nimport math\n\n\nif __name__ == '__main__':\n\t\n\tn, k = [int(x) for x in input().split()]\n\tarr = []\n\tfor i in range(1,int(math.sqrt(n))+1) :\n\t\tif n%i == 0 :\n\t\t\tif i**2!=n :\n\t\t\t\tarr.append(i)\n\t\t\t\tarr.append(n//i)\n\t\t\telse :\n\t\t\t\tarr.append(i)\n\tarr.sort()\n\ttry :\n\t\tprint(arr[k-1])\n\texcept IndexError :\n\t\tprint(-1)\n", "import math\r\ndef uoc(a):\r\n b=[]\r\n for i in range(1,int(math.sqrt(a))+1):\r\n if n%i==0:\r\n if n//i==i:\r\n b.append(i)\r\n else:\r\n b.extend([i,n//i])\r\n return sorted(b)\r\nn,k=map(int,input().split())\r\nq=uoc(n)\r\nif k>len(q):\r\n print(-1)\r\nelse:\r\n print(q[k-1])", "import math,bisect\nif __name__ == '__main__':\n\n a, b = input().split()\n a1,a2= int(a),int(b)\n # v = int(a1**(1/2))\n # arr= []\n # i = 2\n # while i <= v:\n # if (a1 % i==0):\n # bisect.insort(arr,i)\n # if (i != (v / i)):\n # bisect.insort(arr, int(v / i))\n #\n # i += 1\n # # bisect.insort(arr,1)\n # print(arr)\n # if (len(arr) < a2):\n # print(-1, end='')\n # else:\n # print(arr[a2 - 1], end='')\n arr = []\n arr1 = []\n\n i = 1\n while i <= math.sqrt(a1) + 1:\n\n if (a1 % i == 0):\n\n # If divisors are equal, print only one\n if (a1 / i == i):\n bisect.insort(arr,i)\n else:\n # Otherwise print both\n bisect.insort(arr, i)\n bisect.insort(arr1,int(a1 / i))\n i = i + 1\n\n arr.extend(arr1)\n arr = list(set(arr))\n arr.sort()\n\n\n if(len(arr)<a2): print(-1,end='')\n else: print(arr[a2-1],end='')\n\t \t\t \t \t\t\t \t\t\t\t \t \t\t \t \t\t", "import math\ndef div(n):\n li=[]\n for i in range(1,int(math.sqrt(n))+1):\n if n%i==0:\n li+=[i]\n li+=[n//i]\n l=set(li)\n return sorted(l)\nx=input().split(\" \")\nn=div(int(x[0]))\nk=int(x[1])\nif len(n)<k:\n print(-1)\nelse:\n print(n[k-1])\n \t \t \t\t \t \t \t\t \t\t \t\t", "from math import sqrt, floor\n\nn, k = [int(i) for i in input().split()]\n\ndivisors = [1]\nother_side = [n]\n\nfor potential_divisor in range(2, floor(sqrt(n) + 1)):\n if n % potential_divisor == 0:\n divisors.append(potential_divisor)\n other_side.append(n // potential_divisor)\n # if len(divisors) == k:\n # print(divisors[-1])\n # exit()\n\nif divisors[-1] == other_side[-1]:\n other_side.pop()\nother_side.reverse()\ndivisors.extend(other_side)\nif k <= len(divisors):\n print(divisors[k - 1])\nelse:\n print(-1)\n", "def f2(n,i,Ans):\n if n==1 or i==1:\n return n,Ans\n \n while n%i==0:\n Ans[i] = Ans.get(i,0)+1\n n//=i\n return n, Ans\ndef f(n):\n Ans={}\n b=[2,3,5]\n for b_i in b:\n if n%b_i==0:\n n,Ans=f2(n,b_i,Ans)\n \n if n==1:\n return Ans\n \n \n \n \n \n n_squr=int(n**0.5)\n \n k=[1, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47, 53, 59, 61, 67, 71, 73, 79, 83, 89, 97, 101, 103, 107, 109, 113, 127, 131, 137, 139, 149, 151, 157, 163, 167, 169, 173, 179, 181, 191, 193, 197, 199, 211, 221, 223, 227, 229, 233, 239, 241, 247, 251, 257, 263, 269, 271, 277, 281, 283, 289, 293, 299, 307, 311, 313, 317, 323, 331, 337, 347, 349, 353, 359, 361, 367, 373, 377, 379, 383, 389, 391, 397, 401, 403, 409, 419, 421, 431, 433, 437, 439, 443, 449, 457, 461, 463, 467, 479, 481, 487, 491, 493, 499, 503, 509, 521, 523, 527, 529, 533, 541, 547, 551, 557, 559, 563, 569, 571, 577, 587, 589, 593, 599, 601, 607, 611, 613, 617, 619, 629, 631, 641, 643, 647, 653, 659, 661, 667, 673, 677, 683, 689, 691, 697, 701, 703, 709, 713, 719, 727, 731, 733, 739, 743, 751, 757, 761, 767, 769, 773, 779, 787, 793, 797, 799, 809, 811, 817, 821, 823, 827, 829, 839, 841, 851, 853, 857, 859, 863, 871, 877, 881, 883, 887, 893, 899, 901, 907, 911, 919, 923, 929, 937, 941, 943, 947, 949, 953, 961, 967, 971, 977, 983, 989, 991, 997, 1003, 1007, 1009, 1013, 1019, 1021, 1027, 1031, 1033, 1037, 1039, 1049, 1051, 1061, 1063, 1069, 1073, 1079, 1081, 1087, 1091, 1093, 1097, 1103, 1109, 1117, 1121, 1123, 1129, 1139, 1147, 1151, 1153, 1157, 1159, 1163, 1171, 1181, 1187, 1189, 1193, 1201, 1207, 1213, 1217, 1219, 1223, 1229, 1231, 1237, 1241, 1247, 1249, 1259, 1261, 1271, 1273, 1277, 1279, 1283, 1289, 1291, 1297, 1301, 1303, 1307, 1313, 1319, 1321, 1327, 1333, 1339, 1343, 1349, 1357, 1361, 1363, 1367, 1369, 1373, 1381, 1387, 1391, 1399, 1403, 1409, 1411, 1417, 1423, 1427, 1429, 1433, 1439, 1447, 1451, 1453, 1457, 1459, 1469, 1471, 1481, 1483, 1487, 1489, 1493, 1499, 1501, 1511, 1513, 1517, 1523, 1531, 1537, 1541, 1543, 1549, 1553, 1559, 1567, 1571, 1577, 1579, 1583, 1591, 1597, 1601, 1607, 1609, 1613, 1619, 1621, 1627, 1633, 1637, 1643, 1649, 1651, 1657, 1663, 1667, 1669, 1679, 1681, 1691, 1693, 1697, 1699, 1703, 1709, 1711, 1717, 1721, 1723, 1733, 1739, 1741, 1747, 1751, 1753, 1759, 1763, 1769, 1777, 1781, 1783, 1787, 1789, 1801, 1807, 1811, 1817, 1819, 1823, 1829, 1831, 1843, 1847, 1849, 1853, 1861, 1867, 1871, 1873, 1877, 1879, 1889, 1891, 1901, 1907, 1909, 1913, 1919, 1921, 1927, 1931, 1933, 1937, 1943, 1949, 1951, 1957, 1961, 1963, 1973, 1979, 1987, 1993, 1997, 1999, 2003, 2011, 2017, 2021, 2027, 2029, 2033, 2039, 2041, 2047, 2053, 2059, 2063, 2069, 2071, 2077, 2081, 2083, 2087, 2089, 2099, 2111, 2113, 2117, 2119, 2129, 2131, 2137, 2141, 2143, 2147, 2153, 2159, 2161, 2171, 2173, 2179, 2183, 2197, 2201, 2203, 2207, 2209, 2213, 2221, 2227, 2231, 2237, 2239, 2243, 2249, 2251, 2257, 2263, 2267, 2269, 2273, 2279, 2281, 2287, 2291, 2293, 2297, 2309]\n \n for i in range(0,(n_squr+1),2310):\n for j in k:\n if n%(i+j)==0:\n n,Ans=f2(n,i+j,Ans)\n \n \n \n if n>1:\n Ans[n] = Ans.get(n,0)+1\n return Ans\ndef main():\n n, k = list(map(int,input().split()))\n a = f(n)\n \n ex = 1,\n for i in a:\n new = list()\n for j in ex:\n for v in range(0,a[i]+1):\n new.append(j*i**v)\n ex = new\n if(len(ex)<k):\n print(-1)\n else:\n print(sorted(ex)[k-1])\nmain()\n\t\t\t\t\t \t \t\t \t\t \t \t\t\t\t", "n, k = map(int, input().split())\n\n\ndef printDivisors(n):\n l = []\n i = 1\n while (i * i < n):\n if (n % i == 0):\n l.append(i)\n if (len(l) >= k):\n break\n i += 1\n\n for i in range(int(n ** 0.5), 0, -1):\n if (n % i == 0):\n l.append(n // i)\n if (len(l) >= k):\n break\n return l\n\n\nres = printDivisors(n)\nif len(res) >= k:\n print(res[k - 1])\nelse:\n print(-1)\n", "n,k=map(int,input().split())\r\na=[]\r\nb=[]\r\nimport math\r\nfor i in range(1,int(math.sqrt(n))+1):\r\n if n%i==0:\r\n a.append(i)\r\n if i*i!=n:\r\n a.append(n//i)\r\na.sort()\r\n\r\nif len(a)>=k:\r\n print(a[k-1])\r\nelse:\r\n print(-1)", "n,k=map(int,input().split())\r\nc=[]\r\nf=0\r\nfor i in range(1,int(n**.5)+1):\r\n if n%i==0:\r\n c+=[i]\r\n f+=1\r\n if i*i!=n:\r\n f+=1\r\n c+=[n//i]\r\nc.sort()\r\nprint(c[k-1] if k<=f else -1)\r\n" ]

[ "a=int(input())\r\nfor i in range(a):\r\n for x in range(a):\r\n if 4*i+7*x==a:\r\n print('4'*i+'7'*x)\r\n exit()\r\nprint(-1)", "#IMPORTS \r\nfrom sys import stdin, stdout\r\n\r\n#INPUTS\r\nN = int(stdin.readline())\r\n\r\n#CODE \r\nSEVEN = 0\r\nFOUR = 0\r\nPOSS = True\r\nwhile(N%4!=0):\r\n N-=7 \r\n SEVEN+=1 \r\n if N<0:\r\n POSS = False\r\n break \r\nFOUR+=N//4\r\nif FOUR>=7:\r\n X = FOUR//7\r\n SEVEN+=4*X \r\n FOUR-=7*X\r\nif POSS:\r\n OP = \"4\"*FOUR + \"7\"*SEVEN \r\nelse:\r\n OP = \"-1\"\r\n \r\n#OUTPUT\r\nstdout.write(f\"{OP}\\n\")\r\n\r\n", "entrada = int(input())\n\nsete = 0\nquatro = 0\n\nquatro += entrada // 4\nresto = entrada % 4\n\nwhile resto % 7 != 0:\n\tif quatro == 0:\n\t\tbreak\n\tquatro -= 1\n\tresto += 4\n\t\nif resto % 7 == 0:\n\tsete += resto // 7\n\ttmp1 = quatro // 7\n\ttmp2 = quatro % 7\n\tsete += tmp1 * 4\n\tquatro = tmp2\n\tprint(quatro*\"4\" + sete*\"7\")\nelse:\n\tprint(-1)\n\n\n\n\n\t\t\t\t \t\t \t \t\t\t\t \t \t \t \t\t\t", "n = int(input())\r\npairs = []\r\nfor b in range(10000000):\r\n if b * 7 > n:\r\n break\r\n x = (n - b * 7)\r\n if not x%4:\r\n a = x // 4\r\n pairs.append((a, b))\r\nif not pairs:\r\n print(-1)\r\n quit()\r\nm = (float(\"inf\"), float(\"inf\"))\r\nfor a, b in pairs:\r\n if a + b < sum(m):\r\n m = (a, b)\r\n elif a + b == sum(m) and b < m[1]:\r\n m = (a, b)\r\n\r\n\r\nprint(m[0] * \"4\" + m[1] * \"7\")\r\n", "from sys import *\n\nn=int(input())\n\nfor i in range((n//4)+1):\n\tres=n-4*i\n\tif res%7==0:\n\t\tj=res//7\n\t\tprint(\"4\"*i+\"7\"*j)\n\t\texit()\n\t\t\nprint(-1)\n", "def good(n):\r\n blanck=[]\r\n for seven in range(0,n//7+1):\r\n if (n-7*seven)%4==0:\r\n four=(n-7*seven)//4\r\n blanck.append([four,seven])\r\n\r\n if blanck:\r\n mini=min(blanck)\r\n return mini[0]*\"4\"+mini[1]*\"7\"\r\n else:\r\n return -1\r\n\r\nprint(good(int(input())))", "# 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(n):\r\n # Write Your Code Here\r\n sevens = n//7\r\n sevenRem = n % 7\r\n fours = sevenRem//4\r\n foursRem = sevenRem % 4\r\n if foursRem <= sevens:\r\n sevens -= foursRem\r\n fours += (2*foursRem)\r\n for _ in range(fours):\r\n print(4, end=\"\")\r\n for _ in range(sevens):\r\n print(7, end=\"\")\r\n print()\r\n else:\r\n print(-1)\r\n\r\n\r\ndef main():\r\n # Take input Here and Call solution function\r\n Solution(get_int())\r\n\r\n\r\n# calling main Function\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nres = -1\r\nfor i in range(100000):\r\n if n - 4*i < 0:\r\n break\r\n if (n - 4 * i) % 7 ==0:\r\n res = ''\r\n for j in range(i):\r\n res += '4'\r\n for j in range((n-4*i)//7):\r\n res += '7'\r\n break\r\nprint(res)", "# link: https://codeforces.com/problemset/problem/109/A\r\n\r\nn = int(input())\r\nend1 = n//7\r\nend2 = n//4\r\nans = []\r\nwhile end1 >= 0:\r\n if (n-(end1*7)) % 4 == 0:\r\n ans.append(\"4\"*((n-(end1*7))//4) + \"7\"*end1)\r\n break\r\n end1 -= 1 \r\nif not ans:\r\n print(-1) \r\nelse:\r\n print(ans[0]) ", "n = int(input())\r\nsevens = 0; fours = 0\r\nwhile(n%7!=0 and n>=0): n -= 4;fours += 1\r\nif n < 0: print(-1)\r\nelse:\r\n sevens = n//7\r\n print(\"4\"*fours+\"7\"*sevens)", "n = int(input())\r\nx, vx, vy = 0, -1, -1\r\nwhile n - x * 4 >= 0:\r\n if (n - x * 4) % 7 == 0:\r\n y = (n - x * 4) // 7\r\n if vx == -1 or x + y < vx + vy or (x + y == vx + vy and x > vx):\r\n vx, vy = x, y\r\n x += 1\r\nprint(-1 if vx == -1 else '4' * vx + '7' * vy)", "n = int(input())\r\nx = 0\r\ndone = False\r\nwhile (n - 4*x)/7 >= 0 :\r\n if (n - 4*x)/7 == int((n - 4*x)/7 ) :\r\n print(\"4\"*x + \"7\"*int((n - 4*x)/7 ) )\r\n done = True\r\n break\r\n else :\r\n x += 1\r\nif not done :\r\n print(-1)\r\n\r\n\r\n", "def lucky_sum_of_digits():\r\n def print_it(four_num, seven_num):\r\n final_list = []\r\n for f in range(four_num):\r\n final_list.append(\"4\")\r\n for s in range(seven_num):\r\n final_list.append(\"7\")\r\n print(\"\".join(final_list))\r\n\r\n required_sum = int(input())\r\n sevens = required_sum // 7\r\n fours = 0\r\n if sevens * 7 == required_sum:\r\n print_it(0, sevens)\r\n elif sevens * 7 < required_sum:\r\n sevens += 1\r\n solution = False\r\n while sevens * 7 + fours * 4 >= required_sum:\r\n sevens -= 1\r\n fours += 1\r\n if sevens * 7 + fours * 4 == required_sum:\r\n print_it(fours, sevens)\r\n solution = True\r\n break\r\n elif sevens == 0:\r\n break\r\n if solution is False:\r\n sevens = required_sum // 7\r\n fours = 7\r\n while fours != 0:\r\n fours -= 1\r\n for i in range(10):\r\n if fours * 4 + sevens * 7 == required_sum and sevens >= 0:\r\n print_it(fours, sevens)\r\n solution = True\r\n break\r\n sevens -= 1\r\n sevens += 10\r\n if solution is False:\r\n print(-1)\r\n\r\n else:\r\n print(-1)\r\n \r\n \r\nlucky_sum_of_digits()\r\n", "n = int(input())\r\ncnt = 0\r\nwhile True:\r\n if not n % 7:\r\n print('4'*cnt+'7'*(n//7))\r\n break\r\n else:\r\n n -= 4\r\n cnt += 1\r\n if n < 0:\r\n print(-1)\r\n break", "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 + '\\n')\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\\n')\r\nimport math \r\nfrom collections import defaultdict\r\n\r\n\r\nn=ri()\r\nx=y=0\r\nz=n\r\nwhile n>=7:\r\n n-=7\r\n y+=1\r\n if n%4==0:\r\n z=n\r\n x=y\r\nif z%4==0:\r\n print('4'*(z//4)+'7'*(x))\r\nelse:\r\n print(-1)\r\n", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\nif __name__ == \"__main__\":\r\n s = int(input())\r\n m = 0\r\n mi = 100000000000\r\n mim = -1\r\n while True:\r\n if s - 7*m < 0:\r\n break\r\n if (s - 7*m)%4 == 0:\r\n if mi >= ((s-7*m)//4 + m):\r\n mi = ((s-7*m)//4 + m)\r\n mim = m\r\n m += 1\r\n # print(m)\r\n if mim == -1:\r\n if s%4 == 0:\r\n n = s//4\r\n print(\"4\"*n)\r\n else:\r\n print(-1)\r\n quit()\r\n n = (s-7*mim)//4\r\n if n < 0:\r\n print(-1)\r\n quit()\r\n st = \"4\"*n + \"7\"*mim\r\n print(st)", "n = int(input())\r\ndig_7 = n // 7\r\ndig_4 = 0\r\nans = \"-1\"\r\n \r\nwhile(1):\r\n temp = n - dig_7 * 7\r\n dig_4 = temp // 4\r\n num = dig_7 * 7 + dig_4 * 4 \r\n if num == n :\r\n ans = \"4\" * dig_4 + \"7\" * dig_7\r\n break\r\n if dig_7 == 0:\r\n break\r\n dig_7 -= 1\r\n \r\nprint(ans)", "m=int(input())\r\nn=m\r\nfours=0\r\nsevens=0\r\nwhile True:\r\n if m%7==0 :\r\n sevens+=m//7\r\n m-=sevens*7\r\n break\r\n elif m<=0:\r\n break\r\n else :\r\n fours+=1\r\n m-=4\r\nif((4*fours)+(7*sevens)==n):\r\n print(\"4\"*fours+\"7\"*sevens)\r\nelse:\r\n print(-1)\r\n", "'''input\n4\n'''\nn = int(input())\nif n == 0:\n\tprint(-1)\nelse:\n\tfor x in range(n//4+1):\n\t\tfor y in range(n//7+1):\n\t\t\tif 4*x + 7*y == n:\n\t\t\t\tprint(\"4\" * x + \"7\" * y)\n\t\t\t\tquit()\n\tprint(-1)\n\n", "n=int(input())\r\na=int(n/7)\r\nd=True\r\nb=0\r\nwhile a>=0:\r\n b=(n-(a*7))%4\r\n if b==0:\r\n d=False\r\n break\r\n a-=1\r\nif d:\r\n print(-1)\r\n\r\nelse:\r\n b=(n-(a*7))/4\r\n while b!=0:\r\n print(4,end=\"\")\r\n b-=1\r\n while a!=0:\r\n print(7,end=\"\")\r\n a-=1", "numero = int(input())\n\nnsete = -1\nnquatro = -1\nminD = 0\n\nfor i in range(numero // 7, -1, -1):\n if ( numero - 7 * i) % 4 != 0:\n continue\n j = (numero - 7 * i) // 4\n nsete = i\n nquatro = j\n minD = nsete + nquatro\n break\n\nif(nsete >= 0 and nquatro >= 0):\n print('4' * nquatro + '7' * nsete)\nelse:\n print('-1')\n \t \t \t\t\t\t \t \t\t\t\t \t\t\t \t\t", "n=int(input());c=0\r\nwhile n%7!=0:c+=1;n-=4\r\nif n < 0:print(-1)\r\nelse:print(\"4\"*c+\"7\"*(n//7))", "n = int(input())\r\nfor i in range(10000):\r\n if (n-4*i)%7==0:\r\n break\r\n elif n<=4*i:\r\n print(-1)\r\n exit()\r\nm = (n-i*4)//7\r\nprint('4'*i+'7'*m)", "n=int(input())\r\no=-1\r\nfor x in range(1+n//4):\r\n y=(n-4*x)/7\r\n if y==int(y):\r\n o=1\r\n print('4'*x+'7'*int(y))\r\n break\r\nif o==-1:print(-1)\r\n", "n=int(input())\r\nq={1,2,3,5,6,9,10,13,17}\r\nw=n%7\r\nt=n//7\r\ny={1:(1,2),2:(2,4),3:(3,6),4:(0,1),5:(1,3),6:(2,5),0:(0,0)}\r\nprint(-1 if n in q else y[w][1]*\"4\"+(t-y[w][0])*\"7\")", "n = int(input())\r\na, b = divmod(n, 7)\r\nc, d = divmod(b, 4)\r\n\r\nprint(-1 if a < d else '4'*(c+2*d)+'7'*(a-d))", "\r\nn = int(input())\r\ns = ''\r\nwhile n > 0 and (n % 7) != 0:\r\n s += '4'\r\n n -= 4\r\n\r\nwhile n > 0 and (n % 7) == 0:\r\n s += '7'\r\n n -= 7\r\n\r\n\r\nif n == 0:\r\n print(s)\r\nelse: \r\n print(-1)", "# https://codeforces.com/problemset/problem/109/A\r\n\r\nimport sys\r\nimport math\r\n\r\n\r\ndef main():\r\n # sys.stdin = open('E:\\\\Sublime\\\\in.txt', 'r')\r\n # sys.stdout = open('E:\\\\Sublime\\\\out.txt', 'w')\r\n # sys.stderr = open('E:\\\\Sublime\\\\err.txt', 'w')\r\n\r\n n = int(sys.stdin.readline().strip())\r\n a, b = n//7, n % 7\r\n c, d = b//4, b % 4\r\n\r\n print(-1if a < d else'4'*(c+2*d)+'7'*(a-d))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n# hajj\r\n# 　　　　　　 ＿＿\r\n# 　　　　　／＞　　フ\r\n# 　　　　　| 　_　 _ l\r\n# 　 　　　／` ミ＿xノ\r\n# 　　 　 /　　　 　 |\r\n# 　　　 /　 ヽ　　 ﾉ\r\n# 　 　 │　　|　|　|\r\n# 　／￣|　　 |　|　|\r\n# 　| (￣ヽ＿_ヽ_)__)\r\n# 　＼二つ\r\n", "\r\ndef main():\r\n n = int(input())\r\n n4 = 0\r\n n7 = 0\r\n while n >= 4 and n%7 !=0:\r\n n -= 4\r\n n4 += 1\r\n if n%7==0:\r\n n7=n//7\r\n else :\r\n print(-1)\r\n return\r\n print('4'*n4 + '7'*n7)\r\n\r\nif __name__=='__main__':\r\n main()\r\n\r\n", "n=input()\r\nn=int(n)\r\na=n//7\r\nb=n%7\r\ni=a\r\nans=0\r\nc=b//4\r\nd=b%4\r\nif a<d:\r\n print(-1)\r\nelse:\r\n x=\"4\"*(2*d+c)\r\n y=\"7\"*(a-d)\r\n print(x+y)\r\n\r\n ", "def main(inp):\n n = int(inp())\n c7_max = n//7\n for c7 in range(c7_max+1)[::-1]:\n if (n - c7*7) % 4 == 0:\n print('4'*((n - c7*7)//4), end='')\n print('7'*c7)\n return\n print(-1)\n\n\ndef add_t(t1, t2):\n return tuple(sum(t) for t in zip(t1, t2))\ndef split_inp_int(inp):\n return list(map(int, inp().split()))\n\n\ndef use_fast_io():\n import sys\n\n class InputStorage:\n def __init__(self, lines):\n lines.reverse()\n self.lines = lines\n\n def input_func(self):\n if self.lines:\n return self.lines.pop()\n else:\n return \"\"\n\n input_storage_obj = InputStorage(sys.stdin.readlines())\n return input_storage_obj.input_func\n\n\nfrom collections import Counter, defaultdict\nfrom functools import reduce\nimport operator\nimport math\n\n\n\ndef product(arr_):\n return reduce(operator.mul, arr_, 1)\n\nif __name__ == \"__main__\":\n\n main(use_fast_io())\n", "n=int(input())\r\nfrom collections import Counter\r\nc=Counter([])\r\nc[1]=[-1,2]\r\nc[2]=[-2,4]\r\nc[3]=[-3,6]\r\nc[4]=[0,1]\r\nc[5]=[-1,3]\r\nc[6]=[-2,5]\r\na=n%7\r\ns=n//7\r\nf=0\r\nif a==0:\r\n print ('7'*s)\r\nelse:\r\n s+=c[a][0]\r\n f+=c[a][1]\r\n if s<0:\r\n if n%4==0:\r\n print ('4'*(n//4))\r\n else:\r\n print (-1)\r\n else:\r\n k='4'*f+'7'*s\r\n print (k)", "n = int(input())\r\nfor i in range(n // 7 + 1):\r\n for j in range((n - 7 * (n // 7 - i)) // 4 + 1):\r\n if (n // 7 - i) * 7 + j * 4 == n:\r\n print(\"4\" * j + \"7\" * (n // 7 - i))\r\n quit()\r\n elif (n // 7 - i) * 7 + j * 4 > n:\r\n break\r\nprint(-1)", "num = int(input())\r\nr = int(num / 7)\r\nvalue = -1\r\nfvalue = -1\r\nfor i in range(0, r + 1):\r\n counter = 0\r\n while 7 * (r - i) + 4 * counter < num:\r\n counter += 1\r\n if int(7 * (r - i) + 4 * counter) == num:\r\n value = (r - i)\r\n fvalue = counter\r\n break\r\n # counter = -1\r\nif num == 4:\r\n print(4)\r\nelif value == -1 and fvalue == -1:\r\n print(-1)\r\nelse:\r\n print(\"4\" * int(fvalue), \"7\" * int(value), sep=\"\")\r\n", "#!/usr/bin/python3\n\ndef func(n):\n if n < 4:\n return -1\n q1, r1 = n // 7, n % 7\n q2, r2 = r1 // 4, r1 % 4\n# import pdb\n# pdb.set_trace()\n if r2 != 0:\n if q1 >= r2:\n q2 += ((7*r2) + r2)//4\n q1 -= r2\n else:\n return -1\n return \"4\"*q2 + \"7\"*q1\n\n\nn = int(input())\nprint(func(n))\n", "sum_of_digits = int(input())\n\nseven = 0\nfour = 0\n\nwhile True:\n\n\tif sum_of_digits%7==0:\n\t\tseven = sum_of_digits//7\n\t\tprint('4'*four + '7'*seven)\n\t\tbreak\n\n\telif sum_of_digits>=4:\n\t\tfour += 1\n\t\tsum_of_digits -= 4\n\n\telse:\n\t\tprint (-1)\n\t\tbreak\n\t \t\t \t \t\t \t \t\t\t \t\t\t\t \t\t", "num = int(input())\n\nrangeFor7 = \"\"\nrangeFor4 = \"\"\n\nwhile num>=28 or (num%4!=0 and num > 4):\n num = num-7\n rangeFor7+=\"7\"\n\nwhile num > 0:\n num = num-4\n rangeFor4+=\"4\"\n\nif num != 0:\n print(-1)\nelse:\n print(rangeFor4+rangeFor7)\n\t \t \t\t\t \t \t \t\t \t\t \t \t \t", "x = int(input())\ns = 0\nq = 0\n\nn = ''\n\nwhile s*4 <= x:\n\ts += 1\n\nwhile True:\n\tif q < 0 or s < 0: break\t\n\telif q*4 + s*7 == x: break\n\telif q*4 + s*7 > x:\n\t\ts = s-1\n\telif q*4 + s*7 < x:\n\t\tq += 1\n\nif q >= 0 and s >= 0:\n\tfor i in range(q):\n\t\tn += '4'\n\tfor i in range(s):\n\t\tn += '7'\n\tprint(n)\nelse:\n\tprint(-1)\n\t\t\t\t\t \t \t \t \t\t\t \t \t\t \t \t\t\t", "n=int(input())\r\not='-1'\r\nok=0\r\ni=n//7+1\r\nwhile(i):\r\n\ti=i-1\r\n\to=n-(7*i)\r\n\tif(o%4==0):\r\n\t\tot=''\r\n\t\tfor j in range(o//4):ot=ot+'4'\r\n\t\tfor j in range(i):ot=ot+'7'\r\n\t\tok=1\r\n\tif(ok):break\r\nprint(ot)", "from math import sqrt, ceil, log\r\nfrom heapq import heapify, heappush, heappop\r\nfrom collections import defaultdict\r\nfrom bisect import bisect_left, bisect_right\r\n\r\nioint = lambda: int(input())\r\nioarr = lambda: list(map(int, input().split(\" \")))\r\nprnys = lambda: print(\"YES\")\r\nprnno = lambda: print(\"NO\")\r\n\r\nMAX = 10**6\r\n\r\nn = ioint()\r\n\r\nt1 = n // 7\r\nt2 = 0\r\nfound = False\r\ni = t1\r\nwhile i >= 0:\r\n t2 = (n - 7 * i) / 4\r\n if t2 == int(t2):\r\n found = True\r\n break\r\n i -= 1\r\n\r\nif found:\r\n print(\"4\" * (int(t2)) + \"7\" * i)\r\nelse:\r\n print(-1)\r\n", "inicio=int(input())\nn1=inicio\ncont=0\ncont4=0\nresposta=\"\"\nwhile(n1>=7):\n cont=cont+1\n n1=n1-7\nwhile(n1<=inicio and n1!=0):\n if(n1%4==0):\n break\n else:\n n1=n1+7\n cont=cont-1\nif(n1>inicio):\n print(\"-1\")\nelse:\n while(n1!=0):\n cont4=cont4+1\n n1=n1-4\n resposta=\"4\"*cont4+\"7\"*cont\n print(resposta)\n\n\t \t \t \t \t\t \t\t \t\t\t\t\t\t \t \t \t", "n = int(input())\r\nfor i in range(0,1000000//4+1):\r\n if 4*i >n:\r\n print(-1)\r\n exit(0)\r\n for j in range(0,1000000//7+1):\r\n if (4*i+7*j==n):\r\n print(i*'4' + j*'7')\r\n exit(0)\r\n\r\n", "n = int(input())\r\n\r\nflag = False\r\nidx = (-1, -1)\r\nfor i in range(0, n):\r\n for j in range(0, n):\r\n if 4 * i + 7 * j > n:\r\n break\r\n if 4 * i + 7 * j == n:\r\n idx = (i, j)\r\n flag = True\r\n break\r\n if flag:\r\n break\r\n\r\nif idx == (-1, -1):\r\n print(-1)\r\nelse:\r\n print('4' * idx[0] + '7' * idx[1])", "n=int(input())\r\nif(n%7==0):\r\n k=int(n/7)\r\n for i in range(k):\r\n print(7,end=\"\")\r\nelif(n%7==1):\r\n n-=8\r\n if(n<0):\r\n print(-1)\r\n else:\r\n print(44,end=\"\")\r\n k=int(n/7)\r\n for i in range(k):\r\n print(7,end=\"\")\r\n \r\nelif(n%7==2):\r\n n-=16\r\n if(n<0):\r\n print(-1)\r\n else:\r\n print(4444,end=\"\")\r\n k=int(n/7)\r\n for i in range(k):\r\n print(7,end=\"\")\r\nelif(n%7==3):\r\n n-=24\r\n if(n<0):\r\n print(-1)\r\n else:\r\n print(444444,end=\"\")\r\n k=int(n/7)\r\n for i in range(k):\r\n print(7,end=\"\")\r\nelif(n%7==4):\r\n n-=4\r\n if(n<0):\r\n print(-1)\r\n else:\r\n print(4,end=\"\")\r\n k=int(n/7)\r\n for i in range(k):\r\n print(7,end=\"\")\r\nelif(n%7==5):\r\n n-=12\r\n if(n<0):\r\n print(-1)\r\n else:\r\n print(444,end=\"\")\r\n k=int(n/7)\r\n for i in range(k):\r\n print(7,end=\"\")\r\nelif(n%7==6):\r\n n-=20\r\n if(n<0):\r\n print(-1)\r\n else:\r\n print(44444,end=\"\")\r\n k=int(n/7)\r\n for i in range(k):\r\n print(7,end=\"\")\r\n ", "\r\ntarget = int(input())\r\n\r\na, b = 0, 0\r\n\r\nwhile(target > 0):\r\n if(target % 7 == 0):\r\n b += 1\r\n target -= 7\r\n elif(target % 4 == 0):\r\n a += 1\r\n target -= 4\r\n else:\r\n a+= 1\r\n target -= 4\r\n \r\nvalue = \"\"\r\nif(target < 0):\r\n print(\"-1\")\r\nelse:\r\n value += \"4\" * a\r\n value += \"7\" * b\r\n print(value)", "n=int(input())\r\ns=''\r\nwhile n%7!=0 and n>0:\r\n n-=4\r\n s+='4'\r\nwhile n%7==0 and n>0:\r\n n-=7\r\n s+='7'\r\nif n==0:\r\n print(s)\r\nelse:\r\n print(-1)", "from sys import *\r\ninput = lambda:stdin.readline()\r\n \r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n \r\n \r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\nn = int(input())\r\n\r\nct = 0\r\nwhile n % 7 != 0:\r\n n -= 4\r\n ct += 1\r\n\r\nif n < 0:\r\n print(-1)\r\nelse:\r\n print('4' * ct + '7' * (n // 7))", "n=int(input())\r\nf=0\r\ns=''\r\nwhile True:\r\n if n==0:\r\n break\r\n elif n<4:\r\n f=1\r\n break\r\n else:\r\n if n%7==0:\r\n s+='7'\r\n n-=7\r\n else:\r\n s+='4'\r\n n-=4\r\nif f==1:\r\n print(-1)\r\nelse:print(s)", "import sys\r\ncoins=[4,7]\r\nsum=int(input())\r\ndef minCoins(coins, m, n):\r\n dp=[[1e9,0] for i in range(n+1)]\r\n dp[0][0]=0\r\n for i in range(n+1):\r\n for j in range(2):\r\n # print(i-coins[j])\r\n if (i - coins[j] >= 0):\r\n if (dp[i][0] > dp[i-coins[j]][0]+1):\r\n dp[i][0]=dp[i-coins[j]][0]+1\r\n dp[i][1] = coins[j]\r\n # print(dp)\r\n if dp[n][0]==1e9:\r\n print(-1)\r\n return\r\n ans=[]\r\n num=dp[n][0]\r\n while (num > 0):\r\n ans.append(dp[n][1])\r\n n -= dp[n][1]\r\n num -=1\r\n ans.sort()\r\n print(*ans,sep=\"\")\r\na=minCoins(coins,2,sum)\r\n", "n = int(input())\r\nm = n % 7\r\nbase = n // 7\r\nif n in [1, 2, 3, 5, 6, 9, 10, 13, 16, 17]:\r\n print(-1)\r\nelif m == 0:\r\n print(base * \"7\")\r\nelif m == 1:\r\n if base - 1 < 1:\r\n print(44)\r\n else:\r\n print((2*\"4\") + ((base - 1) * \"7\"))\r\nelif m == 2:\r\n if base - 2 < 1:\r\n print(4444)\r\n else:\r\n print(\"4444\" + ((base - 2) * \"7\"))\r\nelif m == 3:\r\n if base - 3 < 1:\r\n print(444444)\r\n else:\r\n print(\"444444\" + ((base-3) * \"7\"))\r\nelif m == 4:\r\n print(\"4\" + (base * \"7\"))\r\nelif m == 5:\r\n if base - 1 < 1:\r\n print(444)\r\n else:\r\n print(\"444\" + ((base - 1) * \"7\"))\r\nelif m == 6:\r\n if base - 2 < 1:\r\n print(44444)\r\n else:\r\n print(\"44444\" + ((base - 2) * \"7\"))", "n=int(input())\r\nA=n//4\r\nB=n//7\r\nfalg=False\r\ns=\"\"\r\nfor i in range(0,A+1):\r\n for j in range(0,B+1):\r\n if(i*4+j*7==n):\r\n for g in range(i):\r\n s+=str(4)\r\n for r in range(j):\r\n s+=str(7)\r\n falg=True;\r\n if falg:\r\n break\r\n if falg:\r\n break\r\nif falg:\r\n print(s)\r\nelse :\r\n print(\"-1\")", "# a+b b a\r\nans = []\r\nn = int(input())\r\nc7 = 0\r\nwhile c7*7<=n:\r\n if (n-7*c7)%4==0:\r\n c4 = (n-7*c7)//4\r\n ans.append([c4+c7, c7, c4])\r\n c7+=1\r\n\r\nif len(ans)==0:\r\n print(-1)\r\nelse:\r\n ans.sort()\r\n print(\"4\"*ans[0][2] + \"7\"*ans[0][1])", "import sys\r\ninput = sys.stdin.readline\r\nfor _ in range(1):\r\n n=int(input())\r\n c4=0\r\n while n%7!=0:\r\n n-=4\r\n c4+=1\r\n if n<0:\r\n print(-1)\r\n else:\r\n print('4'*c4+'7'*(n//7))", "# coding:utf-8\n\nn = int(input())\n\nif(n < 4):\n result = '-1'\n\ndef calcSeven(max):\n result = ''\n for i in range(max):\n result += '7'\n return result\n\ndef calcFour(max):\n result = ''\n for i in range(max):\n result += '4'\n return result\n\nresult = ''\nqtd_setes = int(n/7)\nrest_sete = n % 7\nqtd_quatro = int(rest_sete/4)\nperto_quatro = rest_sete % 4\n\nif(perto_quatro != 0):\n if(qtd_setes >= perto_quatro):\n qtd_quatro += int(((7*perto_quatro) + perto_quatro) / 4)\n qtd_setes -= perto_quatro\n else:\n result = '-1'\n\nif(result == ''):\n result += calcSeven(qtd_setes)\n result = calcFour(qtd_quatro) + result\n\nprint(result)\n \t \t \t \t\t \t \t \t \t \t \t \t", "n=int(input())\r\ne=10**9\r\na=e\r\nb=e\r\nfor i in range(n//3,-1,-1):\r\n x=(n-i*4)//7\r\n if x>=0 and x*7+i*4==n and (a+b>i+x or b>x):a,b=i,x\r\nprint(-1 if a==e else '4'*a+'7'*b)", "n=int(input())\r\nx=0\r\ny=0\r\nnum7=[0]\r\nflag=True\r\nif n%4==0:\r\n y=n//4\r\n flag=False\r\nwhile n>=7:\r\n n-=7\r\n x+=1\r\n if n%4==0:\r\n flag=False\r\n y=n//4\r\n num7.append(x)\r\nif flag:\r\n print(-1)\r\nelse:\r\n print('4'*y+'7'*num7[-1])\r\n\r\n", "sum_of_digits = int(input())\r\nbest_solution = None\r\nmin_length = None\r\nfor b in range(sum_of_digits//7 + 1):\r\n if (sum_of_digits - 7*b) % 4 == 0:\r\n a = (sum_of_digits - 7*b)//4\r\n if min_length is None or a+b < min_length or (a+b == min_length and b < best_solution[1]):\r\n best_solution = (a,b)\r\n min_length = a+b\r\nif best_solution:\r\n solution = ['4']*best_solution[0]\r\n solution.extend(['7']*best_solution[1])\r\n print(''.join(solution))\r\nelse:\r\n print(-1)\r\n", "def fun(a):\n m1=int(a/4)\n m2=int(a%4)\n n1=int(a/7)\n n2=int(a%7)\n f1=int(n2%4)\n f2=int(n2/4)\n if(a<4):\n print('-1')\n return 0\n if(f1!=0):\n if(n1>=f1):\n f2+=(7*f1+f1)/4\n n1-=f1\n else:\n print('-1')\n return 0\n \n \n for i in range(0,int(f2),1):\n print(4,end='')\n for i in range(0,int(n1),1):\n print(7,end='')\n\nt=int(input())\nfun(t)\n", "n=int(input())\r\na,b=n//7,n%7\r\nc,d=b//4,b%4\r\nprint(-1 if a<d else '4'*(c+2*d)+'7'*(a-d))", "n = int(input())\r\nfor i in range(0,1000000//4+1):\r\n if 4*i >n:\r\n print(-1)\r\n exit(0)\r\n tf=False\r\n for j in range(0,1000000//7+1):\r\n if (4*i+7*j==n):\r\n print(i*'4' + j*'7')\r\n tf=True\r\n break\r\n if (tf==True): break\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\nf=int(input())\r\ndef q(f):\r\n if f%4==1:\r\n if f<21:\r\n return '-1'\r\n elif f%4==2:\r\n if f<14:\r\n return '-1'\r\n elif f%4==3:\r\n if f<7:\r\n return '-1'\r\n a=b=0\r\n ss=\" \"\r\n while (f> 0):\r\n if (f % 7 == 0):\r\n b += 1\r\n f -= 7\r\n elif (f% 4 == 0):\r\n a += 1\r\n f-= 4\r\n \r\n else:\r\n a += 1\r\n f -= 4\r\n ss+= \"4\" * a\r\n ss+= \"7\" * b\r\n \r\n return (ss)\r\n \r\n \r\n \r\n \r\nsys.stdout.write(q(f))\r\n", "def solve(n):\n\tn_aux = n\n\tmod7 = mod4 = 0\n\tif n%7 == 0:\n\t\treturn \"7\"*(n//7)\n\tstart = n//7\n\twhile((n-(start*7))%4 and start > 0):\n\t\tstart -= 1\n\tif start:\n\t\treturn ((n-(start*7))//4)*\"4\" + (\"7\"*start)\n\telif n % 4 == 0:\n\t\treturn (n//4)*\"4\"\n\telse: return -1 \n\nn = int(input())\nprint(solve(n))\n\n", "n=int(input())\r\nk=n\r\nif n%7==0:\r\n print('7'*int(n/7))\r\nelse:\r\n a=''\r\n s=0\r\n c=0\r\n for i in range(k):\r\n a+='4'\r\n s+=4\r\n n-=4\r\n if n%7==0:\r\n c=1\r\n break\r\n if n<0:break\r\n for i in range(int(n/7)):\r\n a+='7'\r\n s+=7\r\n if s==k:print(a)\r\n else:print(-1)", "import math\nn = int(input())\n\ncount, count4, count7 = math.inf, 0, 0\nfor i in range(n):\n if i * 4 > n or (n-(i*4)) % 7 != 0:\n continue\n j = (n-i*4) // 7\n if i + j < count:\n count, count4, count7 = i+j, i, j\n\nif count == math.inf:\n print(-1)\n\nelse:\n for i in range(count4):\n print(\"4\", end=\"\")\n for j in range(count7):\n if j == count7 - 1:\n print(\"7\")\n else:\n print(\"7\", end=\"\")\n\n \t\t\t \t \t\t\t \t\t\t\t \t\t \t\t\t\t\t", "number = int(input())\r\n\r\nresult = \"\"\r\n\r\nwhile number >= 4:\r\n if number%7 != 0:\r\n number -= 4\r\n result += \"4\"\r\n elif number%7 == 0:\r\n result += \"7\"*(number//7)\r\n number = 0\r\n\r\nif number > 0:\r\n result = -1\r\n \r\nprint(result)", "n=int(input())\r\na=-1\r\nb=-1\r\nfor n7 in range(n//7,-1,-1):\r\n if (n-7*n7)%4!=0:\r\n continue\r\n \r\n a=n7\r\n b=(n-7*a)//4;\r\n break \r\nif(a>=0 and b>=0):\r\n \r\n print(\"4\"*b+\"7\"*a)\r\nelse:\r\n print(-1)", "n=int(input())\r\na,b=n//7,n%7\r\nc,d=b//4,b%4\r\nprint(-1if a<d else'4'*(c+2*d)+'7'*(a-d))", "def get_ints():\r\n return list(map(int, input().split()))\r\n\r\nN = int(input())\r\na,b = N//7,N%7\r\nc,d = b//4,b%4\r\n\r\nprint(-1 if a<d else '4'*(c+2*d) + '7'*(a-d))", "A = int(input())\r\nls = []\r\nlss = []\r\ni = 0\r\nm = ''\r\nk = A // 7\r\n\r\nfor a in range(k):\r\n ls.append(7)\r\n lss.append('7')\r\nl = len(ls)\r\nwhile i < l + 5:\r\n P = 0\r\n for b in ls:\r\n P += b\r\n if P == A:\r\n print(m.join(lss))\r\n i = 0\r\n break\r\n else:\r\n ls.insert(0, 4)\r\n lss.insert(0, '4')\r\n if P > A:\r\n del ls[-1]\r\n del lss[-1]\r\n i += 1\r\nif i is not 0:\r\n print(-1)", "class Solution109A:\n def __init__(self):\n self.result = \"-1\"\n self.n = 0\n\n def parse_input(self):\n self.n = int(input())\n\n def solve(self):\n result_builder = \"\"\n\n while self.n % 7 != 0:\n if self.n < 0:\n return\n self.n -= 4\n result_builder += \"4\"\n\n sevens = self.n // 7\n result_builder += \"7\" * sevens\n self.result = result_builder\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n solution = Solution109A()\n solution.parse_input()\n solution.solve()\n print(solution.get_result())\n", "n=int(input())\r\nsumm=10000000\r\np=-2\r\nq=-2\r\nfor i in range(0,int(n/7)+1):\r\n\ta=(n-7*i)/4\r\n\tif a==int(a):\r\n\t\tif summ>a+i:\r\n\t\t\tp=a\r\n\t\t\tq=i\r\n\t\telse:\r\n\t\t\tpass\r\nif p<0:\r\n\tprint(\"-1\")\r\nelse:\r\n\tprint('4'*int(p)+'7'*q)", "n = int(input())\r\na=0\r\nb = 0\r\nsum_ = 0\r\ns = ''\r\nwhile(b >= 0):\r\n b = (n - (a*4))/7\r\n y = int(b)\r\n if(y==b):\r\n s+=a*'4' + y*'7'\r\n print(s)\r\n break\r\n a+=1\r\nif(b<0):\r\n print(-1)\r\n", "n=int(input())\r\n\r\na=n//7\r\nb=n%7\r\nc=0\r\nd=0\r\ns=''\r\nif(b==0):\r\n c=a\r\n d=0\r\nelif(b==1):\r\n c=a-1\r\n d=2\r\nelif(b==2):\r\n c=a-2\r\n d=4\r\nelif(b==3):\r\n c=a-3\r\n d=6\r\nelif(b==4):\r\n c=a\r\n d=1\r\nelif(b==5):\r\n c=a-1\r\n d=3\r\nelif(b==6):\r\n c=a-2\r\n d=5\r\n\r\nif(c<0):\r\n print(-1)\r\nelse:\r\n print(s+'4'*d+'7'*c)\r\n \r\n", "n=int(input())\r\np=n//7\r\nans=False\r\nfor i in range(p,-1,-1):\r\n if (n-7*i)%4==0:\r\n n4=(n-7*i)//4\r\n n7=i\r\n ans=True\r\n break\r\nif ans:\r\n print(\"4\"*n4+\"7\"*n7)\r\nelse:\r\n print(-1)", "n = int(input())\r\ni = 0\r\nj = 0\r\nwhile n>=0:\r\n if n%7==0:\r\n j = n//7\r\n ans = ['4'] * i + ['7'] * j\r\n print(\"\".join(ans))\r\n break\r\n n-=4\r\n i+=1\r\nelse:\r\n print(-1)", "z=int(input())\r\nif z%7==0:\r\n print('7'*(z//7))\r\nelse:\r\n ans=-1\r\n for k in range(0,z//7+1):\r\n if (z-k*7)%4==0:\r\n ans=k\r\n if ans==-1:\r\n print(-1)\r\n else:\r\n print('4'*((z-ans*7)//4),end=\"\")\r\n print('7'*ans)\r\n\r\n\r\n", "n = int(input())\r\ns, x = 0, 0\r\nwhile s <= n:\r\n xfactor = 4 * x\r\n if x == 100:\r\n break\r\n y = (n-(4*x))//7\r\n yfactor = 7 * y\r\n if yfactor < 0:\r\n print(-1)\r\n break\r\n # print(xfactor, yfactor)\r\n if yfactor != 0 and (n-xfactor) % yfactor != 0:\r\n x += 1\r\n continue\r\n s = xfactor + yfactor\r\n if s == n:\r\n print(\"4\"*x+\"7\"*y)\r\n break\r\n x += 1\r\nelse:\r\n print(-1)", "n = int(input())\n\nfound = False\nfor num_sevens in range(n // 7, -1, -1):\n remainder = n - (7 * num_sevens)\n if (remainder % 4 == 0):\n num_fours = remainder // 4\n for i in range(num_fours):\n print(4, end='')\n for i in range(num_sevens):\n print(7, end= '')\n print()\n found = True\n break\n\nif not found:\n print(-1)\n \t\t \t\t \t\t \t\t\t \t \t \t\t \t \t", "n = int(input())\n\nx = 2 * n\nt = x // 7\nx = x % 7\ny = - n + 4 * t\nif y < 0: print(\"-1\")\nelse:\n for i in range(x): print(\"4\", end=\"\")\n for i in range(y): print(\"7\", end=\"\")\n \t\t\t\t\t \t \t\t \t \t\t\t\t\t \t\t", "def is_sorted(arr,r=False):\n n=len(arr)\n if not r :\n for i in range(1,n):\n if arr[i]<arr[i-1] :\n return False\n return True\n else:\n for i in range(1,n):\n if arr[i]>arr[i-1] :\n return False\n return True\n\n\ndef freq(arr) :\n d={}\n for i in arr :\n d[i]=d.get(i,0)+1\n return d\n\ndef fac(n):\n p=1\n for i in range(1,n+1):\n p*=i\n return p\n\n\n\nfrom functools import lru_cache\n\n\ndef check(s,n):\n sm=sum([int(x) for x in s])\n if sm==n :\n return s\n return -1\n\n@lru_cache(maxsize=None)\ndef solve(n) :\n if n%7==0 :\n return check('7'*(n//7) , n )\n if n%7==1 :\n return check('4'*2 +'7'*(n//7-1) , n )\n\n if n%7==2 :\n return check('4'*4 + '7'*(n//7-2) , n )\n\n if n%7==3 :\n return check('4'*6 + '7'*(n//7-3) , n )\n if n%7==4 :\n return check('4'+'7'*(n//7) , n )\n if n%7==5 :\n return check('4'*3 + '7'*(n//7-1) , n )\n if n%7==6 :\n return check('4'*5 + '7'*(n//7-2) , n )\n\n \n\n\n\n\n\n\n\n\n\n\n\n\n \n\n\n\n \n \n\n\n \n\n\n#from bisect import bisect_left as bisect\nfrom math import ceil,floor\nfrom sys import stdin #setrecursionlimit\ninput = stdin.buffer.readline \n#setrecursionlimit(400000) \n\n\n\nn=int(input())\nprint(solve(n))\n\n\n\n\n'''\n\nfor _ in range(int(input())) :\n n=int(input())\n print(solve())\n\n\nn=int(input())\n\nx=input().strip().decode(\"utf-8\")\n\n\nn,m= list(map(int, input().split()))\n\n\nn=int(input())\n arr=list(map(int, input().split()))\n\nn,k= list(map(int, input().split()))\narr=list(map(int, input().split()))\n\n\narr=list(map(int, input().strip().decode(\"utf-8\")))\n\n\nn,m= [int(x) for x in input().split()]\narr=[list(map(int, input().split())) for _ in range(n)]\n\n\nn,m= [int(x) for x in input().split()]\narr=[list(map(int, input().strip().decode(\"utf-8\"))) for _ in range(n)]\n\n\n\nn=int(input())\narr=[list(map(int, input().split())) for _ in range(n)]\n\n\n\nn,m= list(map(int, input().split()))\n arr=[list(input().strip().decode(\"utf-8\")) for _ in range(n)]\n\n\n\n\nfor _ in range(int(input())) :\n \n\n n=int(input())\n arr=list(map(int, input().split()))\n\n d={}\n leaves={}\n\n for i in range(n):\n d[i+1]=[]\n leaves[i+1]=1\n \n for i in range(1,n):\n d[arr[i-1]].append(i+1)\n if arr[i-1] in leaves :\n leaves.pop(arr[i-1])\n\n\n\n\n\n\n'''\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\nc = 0\r\nwhile n % 7 != 0:\r\n c += 1\r\n n -= 4\r\nif n < 0:\r\n print(- 1)\r\nelse:\r\n print(\"4\" * c + \"7\" * (n // 7))", "n=int(input())\r\nbsev=0\r\nbfour=0\r\nwhile n>=0:\r\n if n%7==0:\r\n bsev=n/7\r\n n=0\r\n break\r\n bfour+=1\r\n n=n-4\r\nif n==0:\r\n while bfour:\r\n print(\"4\",end=\"\")\r\n bfour-=1\r\n while bsev:\r\n print(\"7\",end=\"\")\r\n bsev-=1\r\nelse:\r\n print(\"-1\")", "n=int(input())\r\nans=0\r\nwhile n % 7 != 0:\r\n ans += 1\r\n n -= 4\r\nif(n<0):\r\n print(-1)\r\nelse:\r\n print('4'*ans+'7'*(n//7))", "n=int(input())\r\na=0\r\nb=0\r\nc=0\r\nx=0\r\nwhile True:\r\n\tif (n-x)<0:\r\n\t\tbreak\r\n\tif (n-x)%7==0:\r\n\t\tb+=(n-x)//7\r\n\t\ta=x//4\r\n\t\tbreak\r\n\tx+=4\r\nif a*4+b*7==n:\r\n\tprint(\"4\"*a+\"7\"*b)\r\nelse:\r\n\tprint(-1)", "n = int(input())\r\nans = ''\r\nr = n % 7\r\nif(r <= 3):\r\n ans += 2 * r *'4' + '7' * (n // 7 - r)\r\nelse:\r\n ans += (2 * (r - 4) + 1) * '4' + '7' * (n // 7 - (r - 4))\r\n \r\ns = 0 \r\nfor i in ans:\r\n s += int(i)\r\nif(s == n):\r\n print(ans)\r\nelse:\r\n print(-1)", "d = {\r\n\t0: 0,\r\n\t1: 21,\r\n\t2: 14,\r\n\t3: 7,\r\n}\r\nn = int(input())\r\nif n < d[n % 4]:\r\n\tprint('-1')\r\nelse:\r\n\ts = (d[n % 4] // 7) + ((n - d[n % 4]) // 28) * 4\r\n\tf = ((n - d[n % 4]) % 28) // 4\r\n\tprint('4' * f + '7' * s)\r\n", "n = int(input())\r\n\r\ns7 = \"\"\r\ns4 = \"\"\r\nwhile(n > 0):\r\n if(n % 7 == 0):\r\n n -= 7\r\n s7 += \"7\"\r\n elif(n % 4 == 0):\r\n n -= 4\r\n s4 += \"4\"\r\n else:\r\n n -= 7\r\n s7 += \"7\"\r\nif(n < 0):\r\n print(-1)\r\nelse:\r\n print(s4 + s7)", "n=int(input())\r\nc=0\r\nwhile n%7!=0:\r\n\tc+=1\r\n\tn-=4\r\n\r\nif n<0:\r\n\tprint(-1)\r\nelse:\r\n\tprint(\"4\"*c+\"7\"*(n//7))\r\n", "n=int(input())\r\nif n<=3:\r\n print(-1)\r\nelif n==4:\r\n print(4)\r\nelif n<=6:\r\n print(-1)\r\nelif n==7:\r\n print(7)\r\nelif n==8:\r\n print(44)\r\nelif n<=10:\r\n print(-1)\r\nelif n==11:\r\n print(47)\r\nelif n==12:\r\n print(444)\r\nelif n==13:\r\n print(-1)\r\nelif n==14:\r\n print(77)\r\nelif n==15:\r\n print(447)\r\nelif n==16:\r\n print(4444)\r\nelif n==17:\r\n print(-1)\r\nelse:\r\n if n%7==0:\r\n print('7'*(n//7))\r\n elif n%7==1:\r\n print('44'+'7'*((n-8)//7))\r\n elif n%7==2:\r\n print('4444'+'7'*((n-16)//7))\r\n elif n%7==3:\r\n print('444444'+'7'*((n-24)//7))\r\n elif n%7==4:\r\n print('4'+'7'*((n-4)//7))\r\n elif n%7==5:\r\n print('444'+'7'*((n-12)//7))\r\n else:\r\n print('44444'+'7'*((n-20)//7))", "n = int(input())\nresposta = []\nquant_sete = n // 7\nquant_quatro = 0\n\nwhile True:\n if (n-quant_sete*7) % 4 == 0:\n quant_quatro = (n-quant_sete*7) // 4\n for i in range(quant_quatro):\n resposta.append(4)\n for j in range(quant_sete):\n resposta.append(7)\n print(''.join(map(str, resposta)))\n break\n elif quant_sete == 0 and n % 4 != 0:\n print(\"-1\")\n break\n else:\n quant_sete -= 1\n\n\t \t\t \t\t \t\t \t \t \t \t\t\t \t\t", "n = int(input())\r\n\r\n# 4a + 7b = n\r\nfirst_variant = []\r\nsecond_variant = []\r\n\r\nvar_a = 0\r\nfake_n = n\r\nwhile True:\r\n if fake_n < 0:\r\n break\r\n\r\n if fake_n % 7 == 0:\r\n first_variant = [var_a, fake_n//7]\r\n break\r\n \r\n var_a += 1\r\n fake_n -= 4\r\n\r\nvar_b = 0\r\nfake_n = n\r\nwhile True:\r\n if fake_n < 0:\r\n break\r\n\r\n if fake_n % 4 == 0:\r\n second_variant = [fake_n//4, var_b]\r\n break\r\n \r\n var_b += 1\r\n fake_n -= 7\r\n\r\nif first_variant == [] and second_variant == []:\r\n print(-1)\r\nelif first_variant == []:\r\n print('4'*second_variant[0] + '7'*second_variant[1])\r\nelif second_variant == []:\r\n print('4'*first_variant[0] + '7'*first_variant[1])\r\nelse:\r\n if sum(first_variant) < sum(second_variant):\r\n print('4'*first_variant[0] + '7'*first_variant[1])\r\n else:\r\n print('4'*second_variant[0] + '7'*second_variant[1])", "def find_happy(s):\n #7a + 4b = s\n ans = None\n minsum = s\n for a in range(s // 7 + 1):\n b = (s - 7 * a) \n if b < 0:\n continue\n if b % 4 == 0:\n b //= 4\n else:\n continue\n if a + b < minsum:\n ans = (a, b)\n elif a + b == minsum:\n if a < ans[0]:\n ans = (a, b)\n if ans == None:\n return -1\n return '4' * ans[1] + '7' * ans[0]\n\nprint(find_happy(int(input())))\n\n", "n = int(input())\ns = n // 7\ns_m = n % 7\nf = s_m // 4\nf_m = s_m % 4\nif f_m > s:\n print(-1)\nelse:\n print('4'*(f+2*f_m) + '7'*(s-f_m))", "n = int(input())\r\nx = n%7\r\n\r\nwhile x%4:\r\n x += 7\r\n\r\nprint(-1 if x>n else '4'*(x//4)+'7'*((n-x)//7))", "n= int(input())\r\nsig = 0;\r\nif (n==1 or n==2 or n==3 or n==5 or n==6 or n==9 or n==10 or n==13 or n==17):\r\n print(-1);\r\nelse:\r\n str1 = \"\"\r\n for i in range(0,250001):\r\n if (n-(4*i))%7 == 0:\r\n str1 += \"4\"*i\r\n n = n-4*i\r\n d = n//7\r\n str1 += \"7\"*d\r\n break\r\n print(str1)\r\n \r\n \r\n", "def findLuckyNum(n):\r\n\tnumDigits=n//4+1\r\n\tdiff=-1\r\n\tfor num in range(numDigits):\r\n\t\tlo=0\r\n\t\thi=num\r\n\r\n\t\twhile hi>=lo:\r\n\t\t\tnum4=(hi+lo)//2\r\n\t\t\tnum7=num-num4\r\n\t\t\tdiff=num4*4+num7*7-n\r\n\t\t\tif diff>0: lo=num4+1\r\n\t\t\telif diff<0: hi=num4-1\r\n\t\t\telse: break\r\n\t\tif not diff: break\r\n\r\n\tif diff: \r\n\t\tprint(-1)\r\n\t\treturn \r\n\r\n\tfor i in range(num4): print(4,end='')\r\n\tfor i in range(num7): print(7,end='')\r\n\r\n\r\ndef main():\r\n\tn=int(input())\r\n\tfindLuckyNum(n)\r\n\r\nif __name__=='__main__': main()", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef main():\r\n # Write Your Code Here\r\n n = int(input())\r\n k = n%7\r\n count_Four = 0\r\n count_seven = 0\r\n if k == 0:\r\n count_seven = n//7\r\n elif k == 1:\r\n if n < 8:\r\n print(-1)\r\n return\r\n else:\r\n count_Four = 2\r\n count_seven = (n-8)//7\r\n elif k == 2:\r\n if n < 16:\r\n print(-1)\r\n return\r\n else:\r\n count_Four = 4\r\n count_seven = (n-16)//7\r\n elif k == 3:\r\n if n < 24:\r\n print(-1)\r\n return\r\n else:\r\n count_Four = 6\r\n count_seven = (n-24)//7\r\n elif k == 4:\r\n if n < 4:\r\n print(-1)\r\n return\r\n else:\r\n count_Four = 1\r\n count_seven = (n-4)//7\r\n elif k == 5:\r\n if n < 12:\r\n print(-1)\r\n return\r\n else:\r\n count_Four = 3\r\n count_seven = (n-12)//7\r\n else: # k == 6:\r\n if n < 20:\r\n print(-1)\r\n return\r\n else:\r\n count_Four = 5\r\n count_seven = (n-20)//7\r\n \r\n res = \"\"\r\n for _ in range(0, count_Four):\r\n res += \"4\"\r\n for _ in range(0, count_seven):\r\n res += \"7\"\r\n print(res)\r\n\r\n \r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "import sys\ndef printMin(a,b):\n for i in range(b):\n print('4',end='')\n for i in range(a):\n print('7',end='')\n\nn = int(input())\na = 0\nfind = False\naCnt = -1\nbCnt = -1\nm=sys.maxsize\nprev = sys.maxsize\nwhile 7*a <= n:\n if (n-7*a)%4 == 0:\n b = int((n-7*a)/4)\n if a+b < m:\n aCnt = a\n bCnt = b\n m = a+b\n a+=1\nif aCnt == -1 or bCnt == -1:\n print('-1')\nelse:\n printMin(aCnt,bCnt)\n", "n=int(input())\r\ncount4=0\r\nflag=0\r\nif(n%7==0):print(\"7\"*(n//7))\r\n\r\nelse:\r\n for i in range(1,n//4+1):\r\n n-=4\r\n #print(n)\r\n count4+=1\r\n if(n%7==0):\r\n flag=1\r\n break\r\n count7=n//7\r\n if(flag==1):\r\n print(\"4\"*(count4)+\"7\"*(count7))\r\n else:\r\n print(\"-1\")\r\n ", "num = int(input())\n\ncount7 = 0\ncount4 = 0\n\nwhile num >= 28 or (num % 4 != 0 and num > 4):\n num -= 7\n count7 += 1\n\nwhile num >= 4:\n num -= 4\n count4 += 1\n\nif num != 0:\n print(-1)\nelse:\n print(\"4\" * count4 + \"7\" * count7)\n\t\t\t \t\t \t \t\t\t \t\t \t \t \t \t\t\t", "n=int(input())\r\nres=\"\"\r\na,b=0,0\r\nwhile n>0:\r\n if n%7==0:\r\n b+=1\r\n n=n-7\r\n elif n%4==0:\r\n a+=1\r\n n=n-4\r\n else:\r\n a+=1\r\n n=n-4\r\nres=\"-1\" if n<0 else res+a*'4'+b*'7'\r\nprint(res)", "def main():\r\n n = int(input())\r\n\r\n for i in range(n // 7, -1, -1):\r\n if (n - i * 7) % 4 == 0:\r\n print(\"4\" * ((n - i * 7) // 4) + \"7\" * i)\r\n return\r\n print(-1)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, = map(int,input().split())\r\nfor j in range(n//7,-1,-1):\r\n r = n-j*7\r\n if r%4==0:\r\n print(\"4\"*(r//4)+\"7\"*j)\r\n break\r\nelse:\r\n print(-1)", "n = int(input().strip())\n\ndef setes(n):\n\n sete = n // 7\n resto = n % 7\n\n while sete >= 0:\n if resto % 4 == 0:\n quatro = resto // 4\n return \"4\" * quatro + \"7\" * sete\n sete -= 1\n resto += 7\n\n return -1\n\nprint(setes(n))\n\t\t\t \t \t\t\t \t\t\t\t\t\t \t \t\t", "n=int(input())\r\nfor i in range(n):\r\n a=n-i*4\r\n if(a>=0 and a%7==0):\r\n print('4'*i+'7'*(a//7))\r\n break\r\nelse:\r\n print(-1)", "n = int(input()) # 1 <= n <= 10e6\n\nluckies = [] # store all possible lucky digits which sum can be equal to n\nf = False # Flag which keeps track of numbers and sequences tested\n\ntotal = 0\nwhile True:\n if total == n:\n luckies.sort()\n print(''.join(luckies))\n break\n \n if total + 7 <= n and f is False:\n # testing for 7's\n total += 7\n luckies.append('7')\n\n else:\n f = True\n \n if f:\n # testing for 4's\n if total + 4 > n and '7' in luckies:\n total -= 7\n luckies.remove('7')\n if total + 4 > n:\n print(-1)\n break\n\n total += 4\n luckies.append('4')\n \n\t\t \t\t \t\t \t\t \t \t \t \t \t \t", "n = int(input())\r\nfound = False\r\nfor i in range(n//4 + 1):\r\n for j in range(n//7 + 1):\r\n if 4*i + 7*j == n:\r\n found = True\r\n break\r\n if found:\r\n break\r\nif found:\r\n print(\"4\" * i + \"7\" * j)\r\nelse:\r\n print(\"-1\")", "# 109A\r\n\r\ndef out_str(n7,n4):\r\n \r\n if n7 > 0 and n4 == 0:\r\n for i in range(n7):\r\n print('7',end='') \r\n elif n4 > 0 and n7 == 0:\r\n for i in range(n4):\r\n print('4',end='') \r\n else: \r\n for i in range(n4):\r\n print('4',end='')\r\n for i in range(n7):\r\n print('7',end='')\r\n\r\nn = int(input())\r\n\r\n\r\nb_min = 1\r\nv1 = min(n//7, n//4)\r\nif v1 > 1:\r\n b_min = v1\r\n\r\nb_max = max(n//7+1, n//4+1)\r\n\r\nfor i in range(b_min, b_max+1):\r\n\r\n for j in range(0,i+1): \r\n \r\n if j*7 + (i-j)*4 == n: \r\n out_str(j,i-j)\r\n raise SystemExit \r\n\r\nprint(-1)\r\n", "n=int(input())\r\na=n//7\r\nb=0\r\nwhile(1):\r\n if a==-1:\r\n print(-1)\r\n exit(0)\r\n if (n-7*a)%4==0:\r\n b=(n-7*a)//4\r\n break\r\n a-=1\r\nprint('4'*b+'7'*a) ", "n = int(input())\r\nbase = (n//4 + 1) * '9'\r\nans = base\r\ni = j = 1 \r\nf = True\r\nfor i in range(0,n+1):\r\n j = 0\r\n while i*4 + j*7 < n: j+=1\r\n if i*4 + j*7 == n:\r\n x = ('4'*i + '7'*j)\r\n print(x)\r\n f = False\r\n break\r\n\r\n\r\nif f: print(-1)\r\n\r\n\r\n ", "n = int(input())\r\nans = (float(\"+inf\"), float(\"+inf\"))\r\n\r\nfor i in range(n, -1, -4):\r\n if not(i%7):\r\n print(\"4\"*((n-i)//4)+\"7\"*(i//7))\r\n break\r\nelse:\r\n print(\"-1\")\r\n", "#link: https://codeforces.com/contest/109/problem/A\n#n = 4 * numeros de dígitos 4 + 7 * numero de dígitos 7\nx = 0\ny = 0\nsoma = int(input())\n#A soma será o número que o usuário digitará para assim, encontrar os algorismos que resultarão nele\nwhile (soma > 0): \n\t#Caso em que todos os números são 4 e 7\n\tif (soma % 7 == 0): #Todos os números da sequência são 7 \n\t\ty += 1 #Contador da quantidade de número 7\n\t\tsoma -= 7 #Soma resultante após destituir o 7\n\telif (soma % 4 == 0): #Todos os números da sequência são 4\n\t\tx += 1 # COntador da quantidade de números 4\n\t\tsoma -= 4 # Soma resultante após destituir o 4\n\telse: #Caso existam 4 e 7 na sequência, destituir 4 até conseguir achar apenas 4 e 7.\n\t\tx += 1\n\t\tsoma -= 4\n\t \nstring = \"\" \nif (soma < 0): \n\tstring = \"-1\"\n\tprint(string) \nelse:\n\tstring += \"4\" * x #Multiplica a quantidade de 4 e 7 que somados resultarão na soma\n\tstring += \"7\" * y \n\tprint(string) \n\n \t\t \t \t\t\t \t\t\t \t\t\t\t\t \t \t", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nans = []\r\nwhile n > 0 and n % 7:\r\n ans.append(\"4\")\r\n n -= 4\r\nif n >= 0:\r\n ans.append(\"7\" * (n // 7))\r\nelse:\r\n ans = [\"-1\"]\r\nsys.stdout.write(\"\".join(ans))", "n = int(input())\r\na,b = divmod(n,7)\r\nc,d = divmod(b,4)\r\nif a<d:\r\n print(-1)\r\nelse:\r\n print(\"4\"*(c+2*d) + \"7\"*(a-d))", "import sys\nn = int(input())\nif(n == 0):\n\tprint(-1)\n\tsys.exit()\nd = int(n/7)\nfor i in range(d,-1,-1):\n\ts = n-i*7\n\tif(s%4 == 0):\n\t\tfs = \"4\"*(int(s/4)) + \"7\"*(i)\n\t\tprint(fs)\n\t\tsys.exit()\nprint(-1)", "n = int(input())\n\nnb_4 = 0\n\nwhile n % 7 != 0 and n >= 0:\n nb_4 += 1\n n -= 4\n\nprint(-1 if n < 0 else nb_4*\"4\" + \"7\"*(n//7))\n", "num = int(input())\n\nnum_7 = num // 7\nnum_7_resto = num % 7\n\nwhile num_7 >= 0:\n if num_7_resto % 4 == 0:\n num_4 = num_7_resto // 4\n break\n num_7 -= 1\n num_7_resto += 7\n\nif num_7 < 0:\n print(-1)\nelse:\n print('4' * num_4 + '7' * num_7)\n\t \t \t \t\t\t \t \t\t \t\t \t\t \t", "n=int(input())\r\ni=0\r\nimport sys\r\nwhile i*4<=n:\r\n if not (n-(i*4))%7:\r\n print('4'*i+'7'*int((n-(i*4))/7))\r\n sys.exit()\r\n i+=1\r\nprint(-1)\r\n \r\n ", "def q109a():\n\tn = int(input())\n\tnum_fours = 0\n\tnum_sevens = 0\n\tfor i in range(n // 7 + 1):\n\t\tif((n - i * 7) % 4 == 0):\n\t\t\tnum_sevens = i\n\t\t\tnum_fours = (n - num_sevens * 7)//4\n\tif(num_fours == 0 and num_sevens == 0):\n\t\tprint('-1')\n\t\texit()\n\tfor _ in range(num_fours):\n\t\tprint('4', end='')\n\tfor _ in range(num_sevens):\n\t\tprint('7', end='')\n\tprint('')\n\nq109a()", "n = int(input())\r\nl = []\r\nflag = 0\r\nwhile n > 0:\r\n if n < 4:\r\n print(-1)\r\n flag = 1\r\n break\r\n elif n%7 == 0:\r\n l.append(7)\r\n n = n - 7\r\n else:\r\n l.append(4)\r\n n = n - 4\r\nif flag == 0:\r\n s = \"\"\r\n for i in l:\r\n s += str(i)\r\n print(s)", "n = int(input())\r\nfours = 0\r\nif(n<4):\r\n print(-1)\r\nelif(n==4):\r\n print(4)\r\nelif(n==7):\r\n print(7)\r\nelse:\r\n while(n%7 != 0 and n>0):\r\n n -= 4\r\n fours+=1\r\n if(n<0):\r\n print(-1)\r\n else:\r\n for i in range(0,fours):\r\n print(4,end=\"\")\r\n for i in range(0,n//7):\r\n print(7,end=\"\")\r\n", "n = int(input())\r\nsl = n // 7\r\nwhile sl >= 0 and (n - (7 * sl)) % 4 != 0: sl -= 1\r\nprint(-1) if sl == -1 else print(\"4\" * ((n - 7 * sl) >> 2) + \"7\" * sl)", "n = int(input())\r\n\r\nfor i in range(n//4+1):\r\n result = n - 4 * i\r\n if result % 7 == 0:\r\n x = result // 7\r\n print('4' * i + '7' * x)\r\n exit()\r\n\r\nprint('-1')\r\n", "n = int(input())\r\nif n > 0:\r\n if n % 7 == 0:\r\n print('7'*(n//7), sep='')\r\n elif (n-4) % 7 == 0 and n - 4 > 0:\r\n print('4' + '7'*((n-4)//7), sep='')\r\n elif (n-8) % 7 == 0 and n - 8 > 0:\r\n print('44'+'7'*((n-8)//7), sep='')\r\n elif (n-12) % 7 == 0 and n - 12 > 0:\r\n print('444'+'7'*((n-12)//7), sep='')\r\n elif (n-16) % 7 == 0 and n - 16 > 0:\r\n print('4444' + '7'*((n-16)//7), sep='')\r\n elif (n-20) % 7 == 0 and n - 20 > 0:\r\n print('44444'+'7'*((n-20)//7), sep='')\r\n elif (n-24) % 7 == 0 and n - 24 > 0:\r\n print('444444'+'7'*((n-24)//7), sep='')\r\n elif n % 4 == 0 and n > 0:\r\n print('4'*(n//4), sep='')\r\n elif (n-7) % 4 == 0 and n-7 > 0:\r\n print('4'*((n-7)//4) + '7', sep='')\r\n elif (n-14) % 4 == 0 and n - 14 > 0:\r\n print('4'*((n-14)//4)+'77', sep='')\r\n elif (n-21) % 4 == 0 and n - 21 > 0:\r\n print('444'*((n-21)//4)+'777', sep='')\r\n else:\r\n print('-1')\r\nelse:\r\n print('-1')\r\n", "n=int(input())\r\na=n//7\r\nb=n%7\r\nc=b//4\r\nd=b%4\r\nprint(-1if a<d else'4'*(c+2*d)+'7'*(a-d))", "n = int(input())\r\nrem7= n % 7\r\nrem4= n % 4\r\nif rem7 == 0:\r\n answer = '7' * (n // 7)\r\n print(answer)\r\nelif rem7 != 0:\r\n x = n - 4\r\n fourCount = 1\r\n sevenCount = 0\r\n while x >= 7:\r\n if x % 7 == 0:\r\n sevenCount = x // 7\r\n break\r\n else:\r\n x -= 4\r\n fourCount += 1\r\n if sevenCount == 0:\r\n if rem4 == 0:\r\n print('4' * (n // 4))\r\n else:\r\n print(-1)\r\n \r\n else:\r\n answer = '4' * (fourCount) + '7' * sevenCount\r\n print(answer)\r\nelif rem4 == 0:\r\n print('4' * (n // 4))\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\nfour = 0\r\nseven = 0\r\n\r\nlucky = []\r\n\r\nwhile n >= 0:\r\n if n % 7 == 0:\r\n seven = n//7\r\n n = 0\r\n break\r\n\r\n four = four + 1\r\n n = n - 4\r\n\r\nif n == 0:\r\n while four > 0:\r\n four -= 1\r\n lucky.append(4)\r\n while seven > 0:\r\n seven -= 1\r\n lucky.append(7)\r\nelse:\r\n print(-1)\r\n\r\nfor i in lucky:\r\n print(i, end=\"\")", "import sys\r\nn=int(input())\r\nx1,x2=0,0\r\nfor i in range(n,-1,-1):\r\n x=n-7*i \r\n if x<0:\r\n continue \r\n else:\r\n if x%4==0:\r\n x1=i \r\n x2=int(x/4)\r\n break \r\n else :\r\n x1=0\r\n x2=0 \r\nprint(-1) if x1==0 and x2==0 else print('4'*x2 +'7'*x1)\r\n\r\n", "from collections import Counter\r\nn=int(input())\r\n# n,k=map(int,input().split())\r\n#arr=list(map(int,input().split()))\r\nf=0\r\nfor i in range(10**6):\r\n if (n-i*4)%7==0:\r\n print(\"4\"*i+\"7\"*((n-4*i)//7))\r\n f=1\r\n break\r\n if n-i*4<0:\r\n break\r\nif f==0:\r\n print(-1)\r\n\r\n\r\n", "fast=lambda:stdin.readline().strip()\r\nzzz=lambda:[int(i) for i in fast().split()]\r\nz,zz=input,lambda:list(map(int,z().split()))\r\nszz,graph,mod,szzz=lambda:sorted(zz()),{},10**9+7,lambda:sorted(zzz())\r\nfrom re import *\r\nfrom sys import *\r\nfrom math import *\r\nfrom heapq import *\r\nfrom queue import *\r\nfrom bisect import *\r\nfrom string import *\r\nfrom itertools import *\r\nfrom collections import *\r\nfrom math import factorial as f\r\nfrom bisect import bisect as bs\r\nfrom bisect import bisect_left as bsl\r\nfrom collections import Counter as cc\r\nfrom itertools import accumulate as ac\r\ndef lcd(xnum1,xnum2):return (xnum1*xnum2//gcd(xnum1,xnum2))\r\ndef prime(x):\r\n p=ceil(x**.5)+1\r\n for i in range(2,p):\r\n if (x%i==0 and x!=2) or x==0:return 0\r\n return 1\r\ndef dfs(u,visit,graph):\r\n visit[u]=1\r\n for i in graph[u]:\r\n if not visit[i]:\r\n dfs(i,visit,graph)\r\ndef output(answer):\r\n stdout.write(str(answer))\r\n###########################---Test-Case---#################################\r\n\"\"\"\r\n\r\n If you Know me , Then you probably don't know me !\r\n\r\n\r\n\"\"\"\r\n###########################---START-CODING---##############################\r\n\r\n \r\n \r\ndef solve():\r\n n = int(input())\r\n num = int(n/7)\r\n rem = n%7\r\n if rem == 0:\r\n print(\"7\"*num)\r\n elif rem == 1 and num>=1:\r\n print(\"44\"+\"7\"*(num-1))\r\n elif rem == 2 and num>=2:\r\n print(\"4444\"+\"7\"*(num-2))\r\n elif rem == 3 and num>=3:\r\n print(\"444444\"+\"7\"*(num-3))\r\n elif rem == 4:\r\n print(\"4\"+\"7\"*(num))\r\n elif rem == 5 and num>=1:\r\n print(\"444\"+\"7\"*(num-1))\r\n elif rem == 6 and num>=2:\r\n print(\"44444\"+\"7\"*(num-2))\r\n else:\r\n print(\"-1\")\r\n\r\n\r\n\r\nsolve()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\na, b = n // 7, n % 7\r\nc, d = b // 4, b % 4\r\nprint(-1 if a < d else '4' * (c + 2 * d) + '7' * (a - d))", "s = int(input())\r\nfourdiff = s%7\r\nfourfact = int(s/7)\r\nwhile fourfact!=-1:\r\n if (fourdiff%4==0):\r\n print(int(fourdiff/4)*'4', fourfact*'7', sep='')\r\n break\r\n else:\r\n fourdiff += 7\r\n fourfact -= 1\r\nelse:\r\n print(-1)", "def Lucky(b):\n luckysum = 0\n for i in b:\n # print(type(i))\n luckysum = luckysum + i\n return luckysum\n\ndef printArray(b):\n for i in b:\n print(i, end='')\n\n\nn = int(input())\n\nk = 0\n\nif( n > 56 ):\n k = int(n/28)\n n = n - (k-1)*28\n\nl = 1\nj = 0\nmax_l = int(n/4)\nnum_array = [4]\n\n\nwhile (l <= max_l):\n # print(num_array)\n if(Lucky(num_array) == n):\n printArray(num_array[::-1])\n for i in range(0, k-1):\n print('7777', end='')\n print()\n exit()\n else:\n # print('entrei aqui 1')\n if(j == l):\n # print('entrei aqui 2')\n num_array.append(4)\n for i in range(0, l):\n num_array[i] = 4\n l = l + 1\n j = 0\n else:\n # print('entrei aqui 3')\n num_array[j] = 7\n j = j + 1\n\n\nprint(-1)\n\n \n\n\n\n# number_array = [4] * int(n / 4)\n# l = len(number_array)\n\n# def arrayToNumber():\n# power = 0\n# number = 0\n# i = 0\n\n# while (i < l and number_array):\n# for i in number_array:\n# number = number + i*(10**power)\n# power = power + 1\n\n\n\n\n \t \t\t\t\t\t\t\t\t \t\t \t\t \t \t \t", "n=int(input())#n=7i+4j\r\na=n//7\r\nans=[]\r\nfor i in range(a,-1,-1):\r\n m=n-7*i\r\n if m%4==0:\r\n j=int(m/4)\r\n ans.append(1)\r\n print(eval(j*'4'+i*'7'))\r\n break\r\nif not ans:\r\n print(-1)", "vetor = ['-1', '-1','-1','-1','4','-1','-1','7','44','-1','-1','47','444','-1','77','447','4444','-1','477','4447','44444','777', '4477', '44447', '444444']\n\nn = int(input())\n\noutput = \"\"\n\nif (n >= 25):\n quantos_setes = \"7\"*((n - 18) // 7)\n resto = (n - 18) % 7\n pos = resto + 18\n\n output = vetor[pos] + quantos_setes\nelse:\n output = vetor[n]\n\nprint(output)\n\n \t \t \t \t \t\t \t\t\t\t\t\t", "i=0\r\nx=int(input())\r\ncheck=0\r\nwhile 1==1:\r\n if 4*i <= x:\r\n if (x-4*i) %7==0:\r\n r=0\r\n k = int((x-(4*i))/7)\r\n\r\n while i>0:\r\n print(\"4\",end=\"\")\r\n i-=1\r\n while k>0:\r\n print(\"7\", end=\"\")\r\n k-=1\r\n check=1\r\n \r\n break\r\n if check == 1:\r\n break\r\n else:\r\n print(\"-1\")\r\n break\r\n\r\n i+=1", "n=int(input())\r\nf=0\r\ny=0\r\nm=99999999999\r\nwhile(1):\r\n if (n-7*y)<0:\r\n break\r\n x=((n-(7*y))/4)\r\n if x==int(x):\r\n if (int(x)+y)<m:\r\n a=int(x)\r\n b=y\r\n m=int(x)+y\r\n y+=1\r\nif m==99999999999:\r\n print(-1)\r\nelse:\r\n for i in range(a):\r\n print(4,end=\"\")\r\n for i in range(b):\r\n print(7,end=\"\")", "x = int(input())\n\ndef luck(n):\n\n a = 0\n b = 0\n\n while(n > 0):\n if(n % 7 == 0):\n b = b+1\n n = n-7\n\n elif(n % 4 == 0):\n a = a+1\n n = n-4\n\n else:\n a = a+1\n n = n-4\n\n\n s = \"\"\n if(n < 0):\n s = \"-1\"\n return s\n\n else:\n s = s + \"4\"*a\n s = s + \"7\"*b\n\n return s\n\nprint(int(luck(x)))\n", "n = int(input())\r\nt, i, j = [0, 0, 0]\r\nwhile 4 * i <= n:\r\n if (n - 4 * i) % 7 == 0:\r\n t = 1\r\n break\r\n i += 1\r\nif t:\r\n j = (n - 4 * i) // 7\r\n for i in range(0, i): print(4, end = '')\r\n for i in range(0, j): print(7, end = '')\r\nelse: print(-1, end = '')", "n = int(input())\n\ndiv7 = n//7\ndiv4 = n//4\nstr = ''\ndone = False\n\nfor i in range(div4 + 1):\n for j in range(div7 + 1):\n if 4*i + 7*j == n:\n str += '4'*i\n str += '7'*j\n print(str)\n done = True\n break\n if done:\n break\n\nif not done:\n print(-1)", "k = int(input())\r\n\r\nfor m in range(k // 7 + 1):\r\n for l in range((k - 7 * (k // 7 - m)) // 4 + 1):\r\n if (k // 7 - m) * 7 + l * 4 == k:\r\n print(\"4\" * l + \"7\" * (k // 7 - m))\r\n quit()\r\n elif (k // 7 - m) * 7 + l * 4 > k:\r\n break\r\nprint(-1)", "n=int(input())\r\nif n%7==0:\r\n print(\"7\"*(n//7))\r\nelse:\r\n r=n%7\r\n ans=\"\"\r\n if r==1 and n>=8:\r\n ans=\"4\"*2+\"7\"*((n-8)//7)\r\n elif r==2 and n>=16:\r\n ans=\"4\"*4+\"7\"*((n-16)//7)\r\n elif r==3 and n>=24:\r\n ans=\"4\"*6+\"7\"*((n-24)//7)\r\n elif r==4 and n>=4:\r\n ans=\"4\"+\"7\"*((n-4)//7)\r\n elif r==5 and n>=12:\r\n ans=\"4\"*3+\"7\"*((n-12)//7)\r\n elif r==6 and n>=20:\r\n ans=\"4\"*5+\"7\"*((n-20)//7)\r\n elif r%4==0:\r\n ans=\"4\"*(n//4)\r\n else:\r\n ans=\"-1\"\r\n print(ans)\r\n", "a=int(input())\ni=0\nc=0\ncount=0\nsete=\"\"\nqua=\"\"\nce=False\nwhile a>=0:\n if a==0:\n ce=True\n a-=2\n elif a%7==0:\n gh=a//7\n sete+=(\"7\")*gh\n a=0\n else:\n qua+=\"4\"\n a=a-4\ni=0\nl=0\nif ce==False:\n print(-1)\nelse:\n\n\n\n print(qua+sete)\n \n \t\t\t \t \t\t \t \t \t\t\t \t\t", "a = int(input())\r\nb = a%7\r\nif(b%4==0):\r\n for _ in range(int(b/4)):\r\n print(\"4\",end=\"\")\r\n for _ in range(int(a/7)):\r\n print(\"7\",end=\"\")\r\nelif(b%4==1 and int(a/7)>=1):\r\n for _ in range(int(b/4)+2):\r\n print(\"4\",end=\"\")\r\n for _ in range(int(a/7)-1):\r\n print(\"7\",end=\"\")\r\nelif(b%4==2 and int(a/7)>=2):\r\n for _ in range(int(b/4)+4):\r\n print(\"4\",end=\"\")\r\n for _ in range(int(a/7)-2):\r\n print(\"7\",end=\"\")\r\nelif(b%4==3 and int(a/7)>=3):\r\n for _ in range(int(b/4)+6):\r\n print(\"4\",end=\"\")\r\n for _ in range(int(a/7)-3):\r\n print(\"7\",end=\"\")\r\nelse:\r\n print(-1)", "n = int(input())\r\n\r\ninf = 10 ** 18\r\nminLength = inf\r\n\r\nfor x in range(2000000):\r\n RHS = n - 4 * x\r\n if RHS >= 0 and RHS % 7 == 0:\r\n fours = x\r\n sevens = RHS // 7\r\n minLength = min(minLength, fours + sevens)\r\n\r\nif minLength == inf:\r\n print(-1)\r\n exit()\r\n\r\nfours = 0\r\n\r\nfor x in range(2000000):\r\n RHS = n - 4 * x\r\n if RHS >= 0 and RHS % 7 == 0:\r\n len = x + (RHS // 7)\r\n if len == minLength:\r\n fours = max(fours, x)\r\n \r\nsevens = (n - 4 * fours) // 7\r\nanswer = '4' * fours + '7' * sevens\r\n\r\nprint (answer)\r\n \r\n \r\n \r\n \r\n \r\n ", "import sys, io, os\r\nimport math\r\nimport bisect\r\nimport heapq\r\nimport string\r\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 dp = [None] * (n+1)\r\n dp[0] = (0,0) \r\n\r\n for i in range(1, n+1):\r\n if i >= 7 and dp[i-7] != None:\r\n f, s = dp[i-7]\r\n dp[i] = (f, s+1)\r\n if i >= 4 and dp[i-4] != None:\r\n f2, s2 = dp[i-4]\r\n if dp[i] != None:\r\n f1, s1 = dp[i]\r\n if f1+s1 >= f2+s2+1:\r\n dp[i] = (f2+1, s2)\r\n else:\r\n dp[i] = (f2+1, s2)\r\n\r\n print(-1 if not dp[n] else '4'*dp[n][0] + '7'*dp[n][1])\r\n\r\nsolve()\r\n", "n = int(input())\r\ncnt4 = 0\r\nwhile cnt4 * 4 <= n:\r\n if (n - cnt4 * 4) % 7 == 0:\r\n break\r\n cnt4 += 1\r\nif cnt4 * 4 <= n:\r\n print('4' * cnt4 + '7' * ((n - cnt4 * 4) // 7))\r\nelse:\r\n print(-1)\r\n", "import math \r\nimport copy\r\ninp = int(input())\r\ntemp = copy.deepcopy(inp)\r\nnum_of_fours = math.floor(inp/4)\r\nnum_of_sevens = math.floor(inp/7)\r\nfours = 0 \r\nsevens = 0\r\nfor i in range(num_of_fours):\r\n if inp%7 != 0 :\r\n inp -= 4 \r\n fours += 1 \r\n else :\r\n sevens = int(inp/7)\r\noutput = [4 for i in range(fours)]\r\nfor i in range(sevens) :\r\n output.append(7)\r\nn = sum(output)\r\nif temp == n :\r\n for i in output:\r\n print(i,end=\"\")\r\nelse:\r\n print(-1)\r\n ", "n = int(input())\nresp = \"\"\n\nwhile n >0 and n%7 != 0:\n resp = \"4\" + resp\n n -= 4\n\nwhile n > 0 and n%7 == 0:\n resp += \"7\"\n n -= 7\n \nif n == 0:\n print(resp)\nelse:\n print(-1)\n\n\n\t \t\t\t\t \t \t \t \t\t\t \t\t \t\t\t\t\t\t", "n=int(input())\nans=0\nwhile n % 7 != 0:\n ans += 1\n n -= 4\nif(n<0):\n print(-1)\nelse:\n print('4'*ans+'7'*(n//7))", "n= int(input())\r\ns=n//7\r\nr=n%7\r\na=r//4\r\nb=r%4\r\nif b>s:\r\n \r\n print(-1)\r\n exit()\r\nprint(\"4\"*(a+2*b)+\"7\"*(s-b))", "import sys\r\n\r\nn=int(input())\r\n\r\ntarget1=(n//7)\r\n\r\ni=target1\r\nflag=0\r\nwhile(i>=0):\r\n\r\n target2=(n-(7*(i)))/4\r\n if(target2==int(target2)):\r\n flag=1\r\n break\r\n #print(target2,i)\r\n i-=1\r\n\r\n#print(target2)\r\nif(flag==1):\r\n ans='4'*(int(target2))+'7'*(i)\r\n print(ans)\r\n\r\nelse:\r\n print('-1')\r\n\r\n'''\r\nif(target2==int(target2)):\r\n ans='7'*str(i)+'4'*str(target2)\r\n print(ans)\r\nelse:\r\n print('-1')\r\n'''\r\n\r\n\r\n\r\n\r\n", "x=int(input())\r\nfours=0\r\nwhile x>=4 and (x%7!=0):\r\n x = x-4\r\n fours= fours + 1\r\nif(x%7==0):\r\n print(\"4\"*fours+\"7\"*(x//7))\r\nelse:\r\n print(-1)", "n=int(input())\r\nx=n%7\r\n \r\nwhile x%4:\r\n\tx=x+7\r\n \r\nif(x>n):\r\n\tprint(-1)\r\nelse:\r\n\tprint('4'*(x//4)+'7'*((n-x)//7))", "#Khushal Sindhav\r\n#Indian Institute Of Technology, Jodhpur\r\n# 11 May 2022\r\ndef exe():\r\n l=[]\r\n size=[]\r\n x=0\r\n while 4*x<=n:\r\n y=(n-4*x)/7\r\n if y%1==0:\r\n l.append([x,y,x+y])\r\n x+=1\r\n if len(l)==0:\r\n return -1\r\n l.sort(key=lambda x:x[2])\r\n minisize=l[0][2]\r\n i=0\r\n x=l[0][0]\r\n while l[i][2]==minisize :\r\n x=min(l[i][0],x)\r\n i+=1\r\n if i>=len(l):\r\n break\r\n # print(x,minisize)\r\n return \"4\"*x+\"7\"*(int(minisize)-x)\r\nn=int(input())\r\nprint(exe())", "\n\ndef Lucky(total):\n # Probamos sumando 4\n n = total\n total4 = 0\n total7 = 0\n arr = []\n while(total >= 0 and total % 7 != 0):\n total4 += 1\n total = total - 4\n if (total % 7 == 0):\n total7 = total / 7\n\n for i in range(total4):\n arr.append(4)\n for i in range(int(total7)):\n arr.append(7)\n if sum(arr) > n:\n return -1\n arr_aux = \"\".join(map(str, arr))\n return arr_aux\n\n\ntotal = int(input())\nprint(Lucky(total))\n\t\t\t\t\t \t \t\t \t\t \t\t\t \t\t\t\t\t\t\t\t \t", "#!/usr/bin/env python3\r\n\r\nimport math\r\n\r\nn = int(input())\r\n\r\n# Find a possible representation\r\nk = math.ceil(n / 4)\r\nm4 = 2*n - 7*k\r\nm7 = -n + 4*k\r\n\r\nif (m4 < 0):\r\n print(-1)\r\nelse:\r\n # Minimize the representation, while keeping a non-negative number of 4s\r\n k = min((m4+m7) // 3, m4 // 7)\r\n m4 -= 7*k\r\n m7 += 4*k\r\n\r\n print (\"4\"*m4 + \"7\"*m7)\r\n", "n=int(input())\r\nm=n\r\nc1=0\r\nf=0\r\nfor b in range(n//7+1):\r\n a=(n-7*b)/4\r\n c=int(a)\r\n if(a==c and c+b<m):\r\n f=1\r\n m=c+b\r\n c1=b\r\nif(f==1):\r\n for i in range(m-c1):\r\n print(4,end=\"\")\r\n for i in range(c1):\r\n print(7,end=\"\")\r\nelse:\r\n print(-1)", "n=int(input())\r\nans=0\r\nwhile n%7!=0:\r\n ans+=1\r\n n=n-4\r\nif(n<0):print(-1)\r\nelse:print('4'*ans+'7'*(n//7))\r\n", "num = int(input())\nnumOG = num\nlista = [7,4]\n\nresultado = ''\n\nwhile(num % 7 != 0 and num > 0):\n num -= 4\n resultado += '4'\n\nresultado += int((num / 7)) * '7'\n\nsoma = 0\nfor i in resultado:\n soma += int(i)\nif soma == numOG:\n print(resultado)\nelse: print(-1)\n\t \t \t\t\t\t\t\t\t \t\t \t \t \t\t\t\t\t\t\t \t\t\t", "def find_lucky_number(n):\n m = n // 7\n while m >= 0:\n if (n - 7*m) % 4 == 0:\n k = (n - 7*m) // 4\n # Concatenate '4' and '7' in the correct order\n result = '4'*k + '7'*m if k <= m else '7'*m + '4'*(k-m)\n return result\n m -= 1\n return '-1'\n\n# Example usage\nn = int(input())\nprint(find_lucky_number(n))\n\n", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\nfor i in range(10**6):\r\n\ttemp=(n-4*i)/7\r\n\tif temp<0:\r\n\t\tprint(-1)\r\n\t\tbreak\r\n\tif temp==int(temp):\r\n\t\tprint(\"4\"*(int(i))+\"7\"*(int(temp)))\r\n\t\tbreak", "s = int(input())\r\nn,m =0, 0\r\nfor i in range(0,s//4+1):\r\n if (s-4*i)%7==0:\r\n n = i\r\n m = (s-4*i)//7\r\n break \r\n \r\nif n==0 and m==0:\r\n print(-1)\r\nelse:\r\n print('4'*n+'7'*m)", "n=int(input())\r\nans=''\r\nwhile(n%7 and n>0):\r\n ans+='4'\r\n n-=4\r\nif(n%7):\r\n print(-1)\r\nelse:\r\n ans+='7'*(n//7)\r\n print(ans)", "n=int(input())\r\nx=0\r\nwhile(n%7!=0):\r\n x=x+1\r\n n=n-4\r\nif(n<0):\r\n print(-1)\r\nelse:\r\n print('4'*x+('7'*(n//7)))\r\n", "n=int(input())\r\nk=0\r\nwhile n%7!=0:\r\n n-=4\r\n k+=1 \r\nif n<0:\r\n print(\"-1\")\r\nelse:\r\n print(k*'4'+(n//7*\"7\"))", "\ndef luckySumOfDigit(n):\n \n i=0\n x=n\n while x>0:\n x = n-(i*4)\n if x%7==0:\n print((\"4\"*i)+\"7\"*(x//7))\n break\n i+=1\n\n else:\n print(-1)\n\n \nn=input()\nluckySumOfDigit(int(n))\nprint()\n \n\n \n \n", "n=int(input())\r\nx,y=n//7,n%7\r\nz,w=y//4,y%4\r\nif(x<w):\r\n print(-1)\r\nelse:\r\n print('4'*(z+w*2)+'7'*(x-w))\r\n", "n=int(input())\r\nfor i in range(n//7,-1,-1):\r\n if (n-7*i)%4==0:\r\n j=(n-7*i)//4\r\n if j>=0 and i>=0:\r\n print('4'*j+'7'*i)\r\n break\r\nelse:\r\n print(-1)", "n = int(input())\na = 0\nwhile 4*a <= n:\n r = n - 4 * a\n if r % 7 == 0:\n print('4'*a, end='')\n print('7'*(int(r/7)))\n exit()\n a += 1\n\nprint(-1)\n", "n = int(input())\nd, r = divmod(n, 7)\nwhile d:\n if r % 4 == 0:\n break\n d -= 1\n r += 7\nres = \"4\" * (r // 4) + \"7\" * d\nres = -1 if sum(int(i) for i in res) != n else res\nprint(res)\n", "x = int(input())\nif (x % 7 == 0):\n print(\"7\" * (x//7))\nelse:\n limite = int((x+7)/7)\n limite += (x%7 - 1)%3\n valor = 4*limite\n resto = x - valor if x >= valor else 1\n if resto % 3 == 0:\n print(\"4\" * (limite - resto//3), \"7\" * (resto//3), sep=\"\")\n else:\n print(-1)\n\n \t\t\t\t\t\t \t \t \t\t\t \t \t\t \t \t", "num = int(input())\n\ndiv7 = num % 7\ndiv4 = num % 4\nqtd7 = num//7\nqtd4 = 0\n\ndif = num - (qtd7 * 7)\nwhile(dif % 4 !=0):\n qtd7 -= 1\n dif = num - (qtd7 * 7)\n if(qtd7 < 0):\n break\nif(qtd7 < 0):\n print('-1')\nelse:\n qtd4 = dif//4\n print(qtd4 * '4' + qtd7 * '7')\n \t \t\t \t \t \t\t \t \t \t \t \t \t\t", "import sys\r\nn = int(input())\r\n\r\n#number of 4 > number of 7\r\n\r\nans = \"\"\r\nfour, seven = 0, 0\r\nwhile n > 0:\r\n if n % 7 == 0:\r\n seven += 1\r\n n -= 7\r\n elif n % 4 == 0:\r\n four += 1\r\n n -= 4\r\n else:\r\n four += 1 #because minimum number is required\r\n n -= 4\r\n if n < 0:\r\n print(-1)\r\n sys.exit(0)\r\n\r\nprint(\"4\"*four + \"7\" * seven)\r\n \r\n", "n = int(input())\r\nA = 1000000\r\nB = 1000000\r\nfor i in range(n):\r\n if n-(7*i) >=0:\r\n if (n - 7*i)%4 == 0:\r\n a = i\r\n b = (n - 7*a)//4\r\n if a+b<=A+B:\r\n A = a\r\n B = b\r\nif A == 1000000 and B == 1000000:\r\n print(-1)\r\nelse:\r\n print(B*\"4\" + A*\"7\")\r\n", "\r\nn=int(input())\r\n\r\nCR7=n//7\r\nf=CR7*7\r\n\r\nr=n-f\r\nwhile r%4!=0:\r\n CR7-=1\r\n r+=7\r\n \r\nif r>n or CR7<0:\r\n print(-1)\r\nelse:\r\n print(\"4\"*((n-CR7*7)//4)+\"7\"*CR7)\r\n", "import sys\nfrom random import choice,randint\ninp=sys.stdin.readline\nout=sys.stdout.write\nflsh=sys.stdout.flush\n \nsys.setrecursionlimit(10**9)\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 MI(): return map(int, inp().strip().split())\ndef LI(): return list(map(int, inp().strip().split()))\ndef LLI(): return [list(map(int, l.split())) for l in sys.stdin.readlines().strip()]\ndef LI_(): return [int(x)-1 for x in inp().strip().split()]\ndef LF(): return [float(x) for x in inp().strip().split()]\ndef LS(): return inp().strip().split()\ndef I(): return int(inp().strip())\ndef F(): return float(inp().strip())\ndef S(): return inp().strip()\ndef pf(s): return out(s+'\\n')\ndef JA(a, sep): return sep.join(map(str, a))\ndef JAA(a, s, t): return s.join(t.join(map(str, b)) for b in a)\n\ndef main():\n n = I()\n q7 = n//7\n r7 = n%7\n r4 = r7%4\n q4 = r7//4\n if q7<r4:\n print(-1)\n else:\n print(\"4\"*(q4+2*r4)+\"7\"*(q7-r4)) \n\nif __name__ == \"__main__\":\n main()", "def main():\r\n # input\r\n n = int(input())\r\n\r\n # soln\r\n b = 0\r\n res = []\r\n while b*7 <= n:\r\n a = (n-b*7)/4\r\n if a%1 == 0:\r\n res.append([int(a), b])\r\n b += 1\r\n ans = []\r\n m = 1e9\r\n mn = 1e9\r\n for i, j in res:\r\n if i+j <= m:\r\n m = i+j\r\n ans = [i, j]\r\n \r\n if ans:\r\n print(int(ans[0]*\"4\" + ans[1]*\"7\"))\r\n else:\r\n print(-1)\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nx, y = 0, 0\r\nfound = False\r\nfor x in range(int(n / 4) + 1):\r\n y = n - x * 4\r\n if y % 7 == 0:\r\n y = int(y / 7)\r\n found = True\r\n break\r\nif found:\r\n print(end = x * '4' + y * '7')\r\nelse:\r\n print(-1)\r\n", "n = int(input())\r\nv = []\r\nbsev = 0\r\nbfr = 0\r\n\r\nwhile n >= 0:\r\n if n % 7 == 0:\r\n bsev = n // 7\r\n n = 0\r\n break\r\n bfr += 1\r\n n = n - 4\r\n\r\nif n == 0:\r\n print(\"4\" * bfr + \"7\" * bsev)\r\nelse:\r\n print(\"-1\")\r\n", "n=int(input())\r\nc=0\r\nfor i in range (n//7,-1,-1):\r\n if ((n-7*i)%4==0):\r\n c=c+1\r\n break\r\nif (c==1):\r\n print('4'*(int((n-7*i)/4))+'7'*i)\r\nelse:\r\n print('-1')", "n=int(input())\r\nc1=c2=c3=0\r\nt=0\r\nwhile True:\r\n\tif (n-t)<0:\r\n\t\tbreak\r\n\tif (n-t)%7==0:\r\n\t\tc2+=(n-t)//7\r\n\t\tc1=t//4\r\n\t\tbreak\r\n\tt+=4\r\nif c1*4+c2*7==n:\r\n\tprint(\"4\"*c1+\"7\"*c2)\r\nelse:\r\n\tprint(-1)", "# itne me hi thakk gaye?\nn = int(input())\nans = \"\"\nwhile n > 0 and n%7!=0:\n n -= 4\n ans += \"4\"\nif (n%7 != 0):\n print(-1)\nelse:\n t = \"7\" * (n//7)\n print(ans + t)", "def solution (a, b, n): \r\n \r\n # traverse for all possible values \r\n i = 0\r\n while i * a <= n: \r\n \r\n # check if it is satisfying \r\n # the equation \r\n if (n - (i * a)) % b == 0: \r\n a1,b1=i,int((n - (i * a)) / b)\r\n print((\"4\")*a1+(\"7\")*b1)\r\n return 0\r\n i = i + 1\r\n \r\n print(-1)\r\nsolution(4,7,int(input()))\r\n", "def solve():\n n = int(input())\n\n possible_pairs = []\n for b in range(1000000):\n # check if b is possible\n foura = (n - 7 * b)\n if foura < 0: break\n if foura % 4 != 0: continue\n possible_pairs.append((foura // 4, b))\n\n if not possible_pairs:\n print(-1)\n return\n\n # find pairs with minimum number of digits\n sums = [sum(pair) for pair in possible_pairs]\n min_sum = min(sums)\n possible_pairs = list(filter(lambda x : sum(x) == min_sum, possible_pairs))[0]\n print(\"4\" * possible_pairs[0] + \"7\" * possible_pairs[1])\n\nsolve()", "n=int(input())\r\nr=(-1,0)\r\na=0\r\nwhile a*4<=n:\r\n c=n-4*a\r\n if c%7<1:\r\n b=c//7\r\n if r[0]<0 or sum(r)>a+b or sum(r)==a+b and b<r[1]:\r\n r=(a,b)\r\n a+=1\r\nprint([r[0]*'4'+r[1]*'7',-1][r[0]<0])", "n= int(input())\r\n\r\n# n = 4a + 7b\r\n\r\na = 0\r\nb = n//7\r\ndigits = 1000000000\r\ncurr = [0,0]\r\n\r\nwhile b>=0:\r\n \r\n if (n - 7*b)%4 == 0:\r\n a = (n-7*b)//4\r\n digits = min(digits,a+b)\r\n if digits == a+b:\r\n curr = [a,b]\r\n \r\n b-=1\r\n \r\nif curr== [0,0]:\r\n print(-1)\r\nelse:\r\n a = curr[0]\r\n b = curr[1]\r\n num= '4'*a + '7'*b\r\n print(num)\r\n", "def findLuckyNumber(n):\r\n\tnumDigits=n//4+1\r\n\tdiff=-1\r\n\r\n\tfor num in range(numDigits):\r\n\t\tif num*7<n: continue\r\n\t\tlo=0\r\n\t\thi=num\r\n\r\n\t\twhile hi>=lo:\r\n\t\t\tnum4=(hi+lo)//2\r\n\t\t\tnum7=num-num4\r\n\t\t\tdiff=num4*4+num7*7-n\r\n\t\t\tif diff>0: lo=num4+1\r\n\t\t\telif diff<0: hi=num4-1\r\n\t\t\telse:\r\n\t\t\t\tans4=num4\r\n\t\t\t\tans7=num7\r\n\t\t\t\tbreak\r\n\r\n\t\tif diff==0: break\r\n\r\n\tif diff: \r\n\t\tprint(-1)\r\n\t\treturn\r\n\tfor i in range(ans4): print(4,end='')\r\n\tfor i in range(ans7): print(7,end='')\r\n\r\ndef main():\r\n\tn=int(input())\r\n\tfindLuckyNumber(n)\r\n\r\nif __name__=='__main__': main()", "from sys import stdin,stdout\r\nnmbr=lambda:int(stdin.readline())\r\nlst = lambda: list(map(int,input().split()))\r\nfor _ in range(1):#nmbr()):\r\n n=nmbr()\r\n PI=float('inf')\r\n dp=[PI]*(1+n)\r\n dp[0]=0\r\n for i in range(1,n+1):\r\n dp[i]=1+min(dp[i-4] if i>=4 else PI,dp[i-7] if i>=7 else PI)\r\n if dp[n]==PI:\r\n print(-1)\r\n continue\r\n ans=[]\r\n cur=n\r\n while cur>0:\r\n if dp[cur]==1+dp[cur-4]:\r\n ans+=[4]\r\n cur-=4\r\n else:\r\n ans+=[7]\r\n cur-=7\r\n ans.sort()\r\n for v in ans:\r\n stdout.write(str(v))", "n=int(input())\nA=n//4\nB=n//7\nfalg=False\ns=\"\"\nfor i in range(0,A+1):\n for j in range(0,B+1):\n if(i*4+j*7==n):\n for g in range(i):\n s+=str(4)\n for r in range(j):\n s+=str(7)\n falg=True;\n if falg:\n break\n if falg:\n break\nif falg:\n print(s)\nelse :\n print(\"-1\")", "n = int(input())\r\nmini = []\r\nflag = False\r\nx = n//4\r\ny = (n//7)+1\r\nfor i in range(x+1):\r\n if flag:\r\n break\r\n for j in range(y+1):\r\n if i*4+j*7==n:\r\n print('4'*i + '7'*j)\r\n flag = True\r\n break\r\nif not flag:\r\n print(-1)\r\n", "n = int(input())\r\ni=int(-1)\r\nj=int(-1)\r\nfor x in range(int(n/7)+1):\r\n k=n-7*x\r\n if k%4==0:\r\n i=int(x)\r\n j=int(k/4)\r\n\r\nif i==-1:\r\n print(\"-1\")\r\nelse:\r\n s=\"4\"*j + \"7\"*i\r\n print(s)\r\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]\nans=\"\"\nwhile n%7!=0:\n n-=4\n ans+='4'\nprint(ans+(n//7)*'7' if n>=0 else -1)\n \n\n\n", "n = input()\nn = int(n)\n\nfour_amount = seven_amount = current_seven = 0\nk = n\nwhile k >= 0:\n if k%4 == 0:\n four_amount=k//4\n seven_amount = current_seven\n current_seven += 1\n k = n - 7*current_seven\nif four_amount == 0 and seven_amount == 0:\n print(-1)\nelse:\n print('4'*four_amount + '7'*seven_amount)\n \n \t \t\t\t\t \t \t \t\t\t\t \t \t\t \t", "n=int(input())\r\n\r\na=n%7\r\nx=n//7\r\n\r\n\r\nwhile (a%4):\r\n a=a+7\r\n x=x-1\r\n\r\ny=a//4\r\n\r\nif max(0,x)*7+max(y,0)*4!=n:\r\n print (-1)\r\nelse:\r\n print (('4'*y)+('7'*x))", "def cal(four, seven):\r\n return 4 * four + 7 * seven\r\n\r\n\r\nn = int(input())\r\nif n % 7 == 0:\r\n seven = n // 7\r\n digit = seven\r\n four = 0\r\nelse:\r\n four = (n // 7) + 1\r\n digit = four\r\n seven = 0\r\n\r\nwhile 4 * digit < n:\r\n if cal(four, seven) == n:\r\n break\r\n elif four == 0 or cal(four, seven) > n:\r\n digit += 1\r\n four = digit\r\n seven = 0\r\n else:\r\n four -= 1\r\n seven += 1\r\n\r\nif cal(four, seven) == n:\r\n print(\"4\" * four + \"7\" * seven)\r\nelse:\r\n print(-1)\r\n", "import math\r\n\r\nn = int(input())\r\no = n\r\n\r\n\r\nd = [7] * (n // 7)\r\nn %= 7\r\n\r\n\r\n\r\nif n % 4 == 0:\r\n d.extend([4] * (n // 4))\r\n print(''.join(sorted(str(k) for k in d)))\r\nelse:\r\n s = sum(d)\r\n while (o - s) % 4 != 0 and s > 0:\r\n d.pop()\r\n s -= 7\r\n\r\n leftover = o - s\r\n if s >= 0 and leftover % 4 == 0:\r\n\r\n num_fours = [4] * (leftover // 4)\r\n print(''.join(str(k) for k in num_fours + d))\r\n else:\r\n print(-1)\r\n", "from math import inf as inf\r\nfrom math import *\r\nfrom collections import *\r\nimport sys\r\ninput=sys.stdin.readline\r\nt=1\r\nwhile(t):\r\n t-=1\r\n n=int(input())\r\n flag=0\r\n ch=n//7\r\n ch1=0\r\n if(n%7):\r\n re=n%7\r\n else:\r\n re=0\r\n while(1):\r\n if(re==0 or ch<0):\r\n break\r\n if(re%4==0):\r\n ch1+=re//4\r\n re=0\r\n break\r\n re=7+re\r\n ch-=1\r\n if((4*ch1)+(7*ch)!=n or ch<0 or ch1<0):\r\n print(-1)\r\n exit(0)\r\n print(ch1*'4',ch*'7',sep=\"\")\r\n \r\n", "n = int(input())\r\n\r\ndef exitprogram():\r\n print(-1)\r\n\r\ndef mainprogram():\r\n for i in range(n // 7 + 1):\r\n for j in range((n - 7 * (n // 7 - i)) // 4 + 1):\r\n if (n // 7 - i) * 7 + j * 4 == n:\r\n print(\"4\" * j + \"7\" * (n // 7 - i))\r\n exit()\r\n elif (n // 7 - i) * 7 + j * 4 > n:\r\n break\r\n exitprogram()\r\n\r\nmainprogram()\r\n", "n = int(input())\r\nt = n//7\r\ncheck = 0\r\nfor i in range(t,-1,-1):\r\n k = n-7*i\r\n if k%4==0:\r\n rep4 = k//4\r\n rep7 = i\r\n check = 1\r\n break\r\nif check==0:\r\n print(-1)\r\nelse:\r\n print('4'*rep4+'7'*rep7)", "def findMin(s):\r\n a, b = 0, 0\r\n while (s > 0):\r\n \r\n # Cases where all remaining digits\r\n # are 4 or 7 (Remaining sum of digits\r\n # should be multiple of 4 or 7)\r\n if (s % 7 == 0):\r\n b += 1\r\n s -= 7\r\n elif (s % 4 == 0):\r\n a += 1\r\n s -= 4\r\n \r\n # If both 4s and 7s are there\r\n # in digit sum, we subtract a 4.\r\n else:\r\n a += 1\r\n s -= 4\r\n \r\n string = \"\"\r\n if (s < 0):\r\n string = \"-1\"\r\n return string\r\n \r\n \r\n string += \"4\" * a\r\n string += \"7\" * b\r\n \r\n return string\r\nprint(findMin(int(input())))", "n=int(input())\r\ncnt=0\r\nwhile n>=4 and (n%7!=0):\r\n n-=4\r\n cnt+=1\r\nif(n%7==0):\r\n print(\"4\"*cnt+\"7\"*(n//7))\r\nelse:\r\n print(-1)", "import sys\nI=lambda :list(map(int,input().split()))\nn,=I()\ni=0\nwhile i*4<=n:\n if (n-(i*4))%7==0:\n print('4'*i+'7'*int((n-(i*4))/7))\n sys.exit()\n i+=1\nprint(-1)\n\n \t \t \t\t \t\t\t\t\t \t \t\t \t\t\t", "n=int(input())\r\ns=\"\"\r\nwhile(n>0):\r\n if n%7==0:\r\n s+=(n//7)*'7'\r\n n-=(n//7)*7\r\n break\r\n else:\r\n s+=\"4\"\r\n n-=4\r\nprint(s if n==0 else -1)", "def get_lucky_number(n):\n sevens = n // 7\n\n while (n - sevens * 7) % 4 != 0 and sevens > 0:\n sevens -= 1\n\n if (n - sevens * 7) % 4 != 0:\n return '-1'\n \n fours = (n - (sevens * 7)) // 4\n result = '4' * fours + '7' * sevens\n\n return result\n\nn = int(input())\n\nprint(get_lucky_number(n))\n\n\n\n ", "def main():\r\n num = int(input())\r\n b = num // 7 + 1\r\n while b >= 0:\r\n a = (num - b * 7)\r\n if a % 4 == 0 and a >= 0:\r\n print('4' * (a // 4) + '7' * b)\r\n return\r\n b -= 1\r\n print(-1)\r\n return\r\nmain()", "import math\r\nn=int(input())\r\ny=math.floor(n/7)\r\nx=0\r\nwhile y>=0:\r\n if (n-7*y)%4 == 0:\r\n x=int((n-7*y)/4)\r\n break\r\n else:\r\n y-=1\r\nif x+y<=0:\r\n print(-1)\r\nelse:\r\n print('4'*x+'7'*y)\r\n \r\n \r\n \r\n \r\n \r\n ", "import math\r\nn = int(input())\r\nc7 = math.ceil(n/7)\r\nc4 = 0\r\nf = 0\r\nwhile c7 >= 0:\r\n c4 = ((n-c7*7)/4)\r\n if c4 == int(c4) and c4 >= 0:\r\n f = 1\r\n break\r\n c7 -= 1\r\nif f == 1:\r\n print('4'*int(c4)+'7'*c7)\r\nelse:\r\n print(-1)\r\n", "n=int(input())\r\nans=\"\"\r\nif(n%4==3 and n>=4):\r\n ans=\"4\"*(n//4-1)+\"7\"\r\nelif(n%4==0):\r\n ans=\"4\"*(n//4)\r\nelif(n%4==2 and n>=14):\r\n ans=(\"4\"*(n//4-3)+\"7\"*2)\r\nelif(n%4==1 and n>=14):\r\n ans=(\"4\"*(n//4-5)+\"7\"*3)\r\nelse:\r\n print(\"-1\")\r\n exit(0)\r\ncount=0\r\n\r\nfor i in range(len(ans)):\r\n if(ans[i]=='4'):\r\n count+=1\r\n \r\n else:\r\n break\r\nprint(\"4\"*(ans.count('4')-(count//7)*7)+\"7\"*(ans.count('7')+(count//7)*4))\r\n", "'''\r\n11\r\n\r\n'''\r\n\r\nn = int(input())\r\n\r\ndef solution (n): \r\n a,b=4,7\r\n # traverse for all possible values \r\n i = 0\r\n while i * a <= n: \r\n \r\n # check if it is satisfying \r\n # the equation \r\n if (n - (i * a)) % b == 0: \r\n return i ,int((n - (i * a)) / b)\r\n i = i + 1\r\n \r\n return -1\r\n\r\nt = solution(n)\r\nif t==-1:\r\n\tprint(t)\r\nelse:\r\n\tprint(t[0]*'4'+t[1]*'7')\r\n\r\n", "\"\"\"\nhttps://codeforces.com/problemset/problem/109/A\n\"\"\"\nx = int(input())\ndebug=False\ncompte7 = 0\ncompte4 = 0\nif x - 7 >= 0:\n compte7 += x // 7\n x = x - compte7 * 7\n if debug:\n print(f'1 {compte7=} {compte4=} {x=} {compte7*7+compte4*4=}')\nif x - 4 >= 0:\n x = x - 4\n compte4 += 1\n if debug:\n print(f'2 {compte7=} {compte4=} {x=} {compte7*7+compte4*4=}')\nwhile x > 0 and compte7 >= 1:\n x -= 1\n compte7 -= 1\n compte4 += 2\n if debug:\n print(f'3 {compte7=} {compte4=} {x=} {compte7*7+compte4*4=}')\nif x > 0:\n print(-1)\nelse:\n print(\"4\" * compte4 + \"7\" * compte7)\n", "x = int(input())\r\nif (x % 7 == 0):\r\n print(\"7\" * (x//7)) # num eh multiplo de 7 e logo esse eh o melhor resultado\r\nelse:\r\n limite = int((x+7)/7) #funcao teto para x/7\r\n limite += (x%7 - 1)%3 #limite pode variar em modulo de 3\r\n valor = 4*limite #valor inicial da PA de razao 3\r\n resto = x - valor if x >= valor else 1\r\n if resto % 3 == 0: #Existe valor na PA\r\n print(\"4\" * (limite - resto//3), \"7\" * (resto//3), sep=\"\")\r\n else:\r\n print(-1)", "n=int(input())\r\ncsev=0\r\ncfour=0\r\nwhile(n>=0):\r\n if n%7==0:\r\n csev=n/7\r\n n=0\r\n break\r\n cfour+=1\r\n n=n-4\r\nif n==0:\r\n while(cfour):\r\n print(4,end=\"\")\r\n cfour-=1\r\n while(csev):\r\n print(7,end=\"\")\r\n csev=csev-1\r\n \r\nelse:\r\n print(-1)", "import math\r\nfrom collections import defaultdict\r\n#t=int(input())\r\n\r\n#for i in range(0,t):\r\n #A=[int(x) for x in input().split()]\r\ns=int(input())\r\na, b = 0, 0\r\nwhile (s > 0):\r\n \r\n # Cases where all remaining digits\r\n # are 4 or 7 (Remaining sum of digits\r\n # should be multiple of 4 or 7)\r\n if (s % 7 == 0):\r\n b += 1\r\n s -= 7\r\n elif (s % 4 == 0):\r\n a += 1\r\n s -= 4\r\n \r\n # If both 4s and 7s are there\r\n # in digit sum, we subtract a 4.\r\n else:\r\n a += 1\r\n s -= 4\r\n \r\nstring = \"\"\r\nif (s < 0):\r\n string = \"-1\"\r\n print(string)\r\nelse: \r\n \r\n string += \"4\" * a\r\n string += \"7\" * b\r\n \r\n print(string)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n=int(input())\r\nf=0\r\nif n%7==0:\r\n print('7'*(n//7))\r\nelse:\r\n m=n//7\r\n while m>0:\r\n if (n-(m*7))%4==0:\r\n f=1\r\n print('4'*((n-(m*7))//4)+'7'*m)\r\n break\r\n else:\r\n m=m-1\r\n if f==0:\r\n if n%4==0:\r\n print('4'*(n//4))\r\n else:\r\n print(\"-1\")", "n=int(input())\nk=n//7\nt=n%7\nkk=t//4\nt=t%4\nwhile t>0 and k>0:\n t+=7\n k-=1\n kk+=t//4\n t=t%4\nif t!=0:\n print(-1)\nelse:\n print(\"4\"*kk+\"7\"*k)", "n = int(input())\n\na, b = 0, 0\n\nwhile n > 0:\n if n % 7 == 0:\n b += 1\n n -= 7\n elif n % 4 == 0:\n a += 1\n n -= 4\n else:\n a += 1\n n -= 4\n\nif n < 0:\n print(-1)\nelse:\n s = \"\"\n s += \"4\" * a\n s += \"7\" * b\n print(s)\n\n \t \t \t\t \t \t\t \t\t \t \t \t \t\t\t\t\t", "import math\r\nn=int(input())\r\ni=0\r\nflag=0\r\nwhile (n-4*i)>=0:\r\n y=(n-4*i)/7\r\n if math.ceil(y)==int(y):\r\n for j in range(i):\r\n print(4,end=\"\")\r\n for j in range(int(y)):\r\n print(7,end=\"\")\r\n print()\r\n flag=1\r\n break\r\n i+=1\r\nif flag==0:\r\n print(-1)\r\n", "readline=lambda:map(int,input().split());\r\nn,=readline();\r\ndiv7,res7=n//7,n%7;\r\ndiv4,res4=res7//4,res7%4;\r\nprint(-1 if div7<res4 else '4'*(div4+2*res4)+'7'*(div7-res4));" ]

[ "n = int(input())\r\nx = list(map(int, input().split()))\r\na = [i + 1 for i, j in enumerate(x) if j == 1]\r\nb = [i + 1 for i, j in enumerate(x) if j == 2]\r\nc = [i + 1 for i, j in enumerate(x) if j == 3]\r\nif not a or not b or not c:\r\n print(0)\r\nelse:\r\n print(min(len(a), len(b), len(c)))\r\n for i, j, k in zip(a, b, c):\r\n print(i, j, k)\r\n ", "\r\nn=int(input())\r\ns=[int(x) for x in input().split()]\r\na=s.count(1)\r\nb=s.count(2)\r\nc=s.count(3)\r\nans=min(a,b,c)\r\nprint(min(a,b,c))\r\np1=[]\r\np2=[]\r\np3=[]\r\nfor i in range(0,n):\r\n if s[i]==1:\r\n p1.append(i+1)\r\n elif s[i]==2:\r\n p2.append(i+1)\r\n else:\r\n p3.append(i+1)\r\nfor k in range(0,ans):\r\n print(p1[k],p2[k],p3[k]) \r\n\r\n", "input()\r\na=[[],[],[]]\r\nfor i, x in enumerate(input().split(),1):\r\n a[int(x)-1]+=[i]\r\n \r\nprint(min(map(len,a)))\r\nfor x in zip(*a):print(*x)", "n = int(input())\r\n\r\na = input().split()\r\n\r\nprogramming_indices = [index for (index, item) in enumerate(a) if item == \"1\"]\r\nmaths_indices = [index for (index, item) in enumerate(a) if item == \"2\"]\r\nPE_indices = [index for (index, item) in enumerate(a) if item == \"3\"]\r\n\r\nmin_len = min(len(programming_indices), len(maths_indices), len(PE_indices))\r\n\r\nprint(min_len)\r\ni=0\r\nwhile i < min_len:\r\n print(programming_indices[i]+1, maths_indices[i]+1, PE_indices[i]+1)\r\n i+=1\r\n", "from collections import defaultdict\nfrom email.policy import default\n\n\ndef main():\n input()\n \n students = list(map(int, input().split()))\n hashed_students = defaultdict(list)\n # O(n)\n for k,v in enumerate(students):\n hashed_students[v].append(k+1)\n # O(1) \n if len(hashed_students) != 3:\n print(0)\n return\n # 3 Operations --> O(1)\n teams_count = len(hashed_students[min(hashed_students, key=lambda item: len(hashed_students[item]))])\n\n teams = []\n for i in range(teams_count):\n team = []\n for j in hashed_students.values():\n team.append(j.pop(0))\n teams.append(team)\n \n print(teams_count)\n for team in teams:\n print(*team)\n\nmain()", "n = int(input())\r\nt = [[], [], []]\r\nfor i, x in enumerate(int(x) for x in input().split()):\r\n t[x - 1].append(i + 1)\r\nnt = min(len(x) for x in t)\r\nprint(nt)\r\nfor i in range(nt):\r\n print(t[0][i], t[1][i], t[2][i])\r\n", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\n# Initialize dictionaries to count the number of students for each subject\r\ncount = {1: [], 2: [], 3: []}\r\n\r\n# Populate the dictionaries with the indices of students for each subject\r\nfor i, skill in enumerate(skills):\r\n count[skill].append(i + 1)\r\n\r\n# Find the minimum count among the three subjects\r\nmin_count = min(len(count[1]), len(count[2]), len(count[3]))\r\n\r\n# Calculate the maximum number of teams\r\nmax_teams = min_count\r\n\r\n# Print the maximum number of teams\r\nprint(max_teams)\r\n\r\n# Form and print the teams\r\nfor i in range(max_teams):\r\n team = [count[1][i], count[2][i], count[3][i]]\r\n print(*team)\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\nskills = [[], [], []]\r\nfor i in range(n):\r\n skills[t[i] - 1].append(i + 1)\r\n\r\nteams = []\r\nnum_teams = 0\r\nwhile True:\r\n team = []\r\n for i in range(3):\r\n if len(skills[i]) == 0:\r\n break\r\n team.append(skills[i][0])\r\n skills[i] = skills[i][1:]\r\n if len(team) == 3:\r\n teams.append(team)\r\n num_teams += 1\r\n else:\r\n break\r\n\r\nprint(num_teams)\r\nfor team in teams:\r\n print(team[0], team[1], team[2])\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\none = []\r\ntwo = []\r\nthree = []\r\n\r\nif len(t) < 3 or t.count(1) == 0 or t.count(2) == 0 or t.count(3) == 0:\r\n print(0)\r\n\r\nelse:\r\n for i in range(len(t)):\r\n if t[i] == 1:\r\n one.append(i+1)\r\n elif t[i] == 2:\r\n two.append(i+1)\r\n elif t[i] == 3:\r\n three.append(i+1)\r\n print(min(len(one), len(two), len(three)))\r\n for i in range(min(len(one), len(two), len(three))):\r\n print(one[i], two[i], three[i])\r\n", "import sys\r\nfrom collections import deque\r\ndef rs(): return sys.stdin.readline().rstrip()\r\ndef ri(): return int(sys.stdin.readline())\r\ndef ria(): return deque(map(int, sys.stdin.readline().split()))\r\ndef ws(s): sys.stdout.write(s)\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write('\\n'.join([str(x) for x in a]) + '\\n')\r\n #--------------------Solution------------------------\r\nn=ri()\r\nlst=ria()\r\nx=deque()\r\ny=deque()\r\nz=deque() \r\nfor i in range(n):\r\n if lst[i]==1:\r\n x.append(i)\r\n elif lst[i]==2:\r\n y.append(i)\r\n elif lst[i]==3:\r\n z.append(i)\r\no=min([len(x),len(y),len(z)])\r\nwi(o)\r\nfor i in range(o):\r\n ws(f\"{x[i]+1} {y[i]+1} {z[i]+1}\\n\")", "n=int(input())\r\nt=input().split()\r\na=t.count('1')\r\nb=t.count('2')\r\nc=t.count('3')\r\nif a==0 or b==0 or c==0:\r\n print(0)\r\nelse:\r\n if a<=b and a<=c:\r\n print(a)\r\n for i in range(a):\r\n print('\\n')\r\n print(t.index('1')+1,end=' ')\r\n d=t.index('1')\r\n t[d]=0\r\n\r\n print(t.index('2')+1,end=' ')\r\n e = t.index('2')\r\n t[e] = 0\r\n\r\n print(t.index('3')+1)\r\n f = t.index('3')\r\n t[f] = 0\r\n elif b<=a and b<=c:\r\n print(b)\r\n for i in range(b):\r\n print('\\n')\r\n print(t.index('1')+1,end=' ')\r\n d=t.index('1')\r\n t[d]=0\r\n\r\n print(t.index('2')+1,end=' ')\r\n e = t.index('2')\r\n t[e] = 0\r\n\r\n print(t.index('3')+1)\r\n f = t.index('3')\r\n t[f] = 0\r\n elif c<=a and c<=b:\r\n print(c)\r\n for i in range(c):\r\n print('\\n')\r\n print(t.index('1')+1,end=' ')\r\n d=t.index('1')\r\n t[d]=0\r\n\r\n print(t.index('2')+1,end=' ')\r\n e = t.index('2')\r\n t[e] = 0\r\n\r\n print(t.index('3')+1)\r\n f = t.index('3')\r\n t[f] = 0\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\na = []\r\nb = []\r\nc = []\r\nfor i in range(n):\r\n if x[i] == 1:\r\n a.append(i + 1)\r\n elif x[i] == 2:\r\n b.append(i + 1)\r\n else:\r\n c.append(i + 1)\r\nprint(min(len(a), len(b), len(c)))\r\nfor i in range(min(len(a), len(b), len(c))):\r\n ans = []\r\n ans.append(str(a[i]))\r\n ans.append(str(b[i]))\r\n ans.append(str(c[i]))\r\n print(' '.join(ans))", "n = int(input())\nlst = list(map(int, input().split()))\none = lst.count(1)\ntwo = lst.count(2)\nthree = lst.count(3)\n\nteams = min(one, two, three)\nprint(teams)\nfor i in range(teams):\n idx1 = lst.index(1)\n idx2 = lst.index(2)\n idx3 = lst.index(3)\n print(idx1+1, idx2+1, idx3+1)\n lst[idx1] = -1\n lst[idx2] = -1\n lst[idx3] = -1\n \t \t\t \t \t \t\t\t \t\t \t", "from collections import Counter\r\nw = int(input())\r\nq = list(map(int, input().split()))\r\nq1 = Counter(q)[1]\r\nq2 = Counter(q)[2]\r\nq3 = Counter(q)[3]\r\nc = min(q1, q2, q3)\r\nprint(c)\r\nfor i in range(c):\r\n print(q.index(1)+1, q.index(2)+1, q.index(3)+1)\r\n if q1 > 0:\r\n q[q.index(1)] = 0\r\n if q2 > 0:\r\n q[q.index(2)] = 0\r\n if q3 > 0:\r\n q[q.index(3)] = 0", "n=int(input())\r\na=[]\r\na=input().split(maxsplit=n)\r\na=[int(item) for item in a]\r\nk1=0\r\nk2=0\r\nk3=0\r\nb=[]\r\nc=[[],[],[]]\r\nfor i in range (n):\r\n if a[i]==1:\r\n k1=k1+1\r\n c[0].append(i)\r\n elif a[i]==2:\r\n k2=k2+1\r\n c[1].append(i)\r\n else:\r\n k3=k3+1\r\n c[2].append(i)\r\nb.append(k1)\r\nb.append(k2)\r\nb.append(k3)\r\nprint(min(b))\r\nif min(b)!=0:\r\n for i in range (min(b)):\r\n print(c[0][i]+1,c[1][i]+1,c[2][i]+1)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nm=min(s.count(1),s.count(2),s.count(3))\r\nprint(m)\r\nfor ___ in range(m):\r\n t1=s.index(1)\r\n t2=s.index(2)\r\n t3=s.index(3)\r\n print(t1+1,t2+1,t3+1)\r\n s[t1]=0\r\n s[t2]=0\r\n s[t3]=0\r\n", "def form_teams(n, inclinations):\r\n teams = []\r\n programmers = []\r\n mathematicians = []\r\n athletes = []\r\n\r\n # Group students based on inclinations\r\n for i in range(n):\r\n if inclinations[i] == 1:\r\n programmers.append(i + 1)\r\n elif inclinations[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n athletes.append(i + 1)\r\n\r\n # Calculate the maximum number of teams\r\n num_teams = min(len(programmers), len(mathematicians), len(athletes))\r\n\r\n # Form teams by selecting one student from each category\r\n for _ in range(num_teams):\r\n team = [programmers.pop(), mathematicians.pop(), athletes.pop()]\r\n teams.append(team)\r\n\r\n return num_teams, teams\r\n\r\n# Example usage\r\nn = int(input())\r\ninclinations = list(map(int, input().split()))\r\n\r\nnum_teams, teams = form_teams(n, inclinations)\r\nprint(num_teams)\r\nfor team in teams:\r\n print(*team)", "n = int(input())\nstudents = list(map(int, input().split()))\n\nprog = students.count(1)\nmath = students.count(2)\npe = students.count(3)\n\nw = min(prog, math, pe)\nprint(w)\n\nfor i in range(w):\n print(students.index(1)+1, students.index(2)+1, students.index(3)+1)\n students[students.index(1)] = 0\n students[students.index(2)] = 0\n students[students.index(3)] = 0", "input()\nnub = [int(i) for i in input().split(\" \")]\n\nteams = min(nub.count(1), nub.count(2), nub.count(3))\nprint(teams)\n\nfor x in range(teams):\n index = nub.index(1)\n nub[index] = 0\n print(index+1, end = \" \")\n\n index = nub.index(2)\n nub[index] = 0\n print(index+1, end = \" \")\n\n index = nub.index(3)\n nub[index] = 0\n print(index+1, end = \" \")\n\n print()\n\t \t\t \t \t\t \t\t \t \t\t\t \t\t \t \t\t", "n= int(input())\r\n\r\nlistt = [int(x) for x in input().split()]\r\nlistofcounters=[[],[],[]]\r\nlisttofresults=[] \r\n\r\nfor i in range(n) :\r\n listofcounters[listt[i]-1].append(i+1)\r\n \r\nmin_n = min([len(x) for x in listofcounters])\r\nprint(min_n)\r\nfor i in range(min_n):\r\n print(listofcounters[0][i],listofcounters[1][i], listofcounters[2][i],sep=\" \")", "n = int(input())\r\nchildren = [int(i) for i in input().split()]\r\nans = ''\r\nprogram = {}\r\nmath = {}\r\ncult = {}\r\nfor i in range(len(children)):\r\n if children[i] == 1:\r\n program[i + 1] = children[i]\r\n elif children[i] == 2:\r\n math[i + 1] = children[i]\r\n else:\r\n cult[i + 1] = children[i]\r\nminimum = min(program, math, cult, key=len)\r\nw = len(minimum)\r\nfor i in range(w):\r\n ans += f'{list(program.items())[i][0]} {list(math.items())[i][0]} {list(cult.items())[i][0]}\\n'\r\nprint(w)\r\nprint(ans)", "n=int(input())\r\ninp=list(map(int,input().split()))\r\n\r\ncOne=inp.count(1)\r\ncTwo=inp.count(2)\r\ncThree=inp.count(3)\r\n\r\none=[];two=[];three=[]\r\nfor i in range(n):\r\n if inp[i]==1:one.append(i)\r\n elif inp[i]==2:two.append(i)\r\n else: three.append(i)\r\nx=min(cOne,min(cTwo,cThree))\r\nprint(x)\r\nfor i in range(x):\r\n print(one[i]+1,two[i]+1,three[i]+1)\r\n\r\n", "n = int(input())\n\narr = list(map(int,input().split()))\n\nif len(set(arr))!=3:\n print(0)\n\n\nelse:\n countArr = [arr.count(1),arr.count(2),arr.count(3)]\n\n countArr.sort()\n\n l = countArr[0]\n\n print(l)\n \n one,two,three = [],[],[]\n\n for i in range(len(arr)):\n if arr[i]==1:\n one.append(i+1)\n if arr[i]==2:\n two.append(i+1)\n if arr[i]==3:\n three.append(i+1)\n \n for i in range(l):\n print(one[i],two[i],three[i])\n\n\n", "chideren_count = int(input())\r\nskils = list(map(int,input().split()))\r\ncount = min([skils.count(1),skils.count(2),skils.count(3)])\r\nprint(count)\r\nfor i in range(count) :\r\n one = skils.index(1)\r\n two = skils.index(2)\r\n three = skils.index(3)\r\n print(one + 1 , two + 1 , three + 1)\r\n skils[one] = -1 ; skils[two] = -1 ; skils[three] = -1", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nsubjects = [list() for i in range(3)]\r\n\r\nfor i in range(len(students)):\r\n subjects[students[i] - 1].append(i + 1)\r\n\r\nif not all(subjects):\r\n print(0)\r\nelse:\r\n print(min(len(s) for s in subjects))\r\n for i in range(min(len(s) for s in subjects)):\r\n for j in range(3):\r\n print(subjects[j][i], end=' ')\r\n print()", "num_of_students = int(input())\r\ntype_of_gifted = list(map(int,input().split()))\r\nteam1, team2, team3 = [], [], []\r\nfor i in range(num_of_students):\r\n skill = type_of_gifted[i]\r\n if skill == 1:\r\n team1.append(i+1)\r\n elif skill == 2:\r\n team2.append(i+1)\r\n else:\r\n team3.append(i+1)\r\nw = min(len(team1), len(team2), len(team3))\r\nprint(w)\r\nfor i in range(w):\r\n print(team1[i], team2[i], team3[i])\r\n ", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nt = min(x.count(2), x.count(1), x.count(3))\r\np, line = [], [[], [], []]\r\nfor i in range(len(x)):\r\n if x[i] == 1:\r\n line[0].append(i + 1)\r\n elif x[i] == 2:\r\n line[1].append(i + 1)\r\n elif x[i] == 3:\r\n line[2].append(i + 1)\r\nfor i in range(t):\r\n p.append([line[0][i], line[1][i], line[2][i]])\r\nprint(t)\r\nif len(p) != 0:\r\n print(\"\\n\".join(map(str, [\" \".join(map(str, p[i])) for i in range(t)])))\r\n", "x = int(input())\r\ns = [int(s) for s in input().split()]\r\na = s.count(1)\r\nb = s.count(2)\r\nc = s.count(3)\r\nprint(min(a, b, c))\r\n\r\nfor i in range(min(a, b, c)):\r\n p = s.index(1)\r\n print(p+1, end=\" \")\r\n s[p]=19\r\n\r\n r = s.index(2)\r\n print(r+1, end=\" \")\r\n s[r]=45\r\n\r\n q = s.index(3)\r\n print(q+1)\r\n s[q]=89\r\n\r\n\r\n", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\ncount = [0] * 3\r\nposition = [[], [], []]\r\nfor i in range (n):\r\n count[students[i] - 1] += 1\r\n position[students[i] - 1].append(i + 1)\r\nprint(min(count)) \r\nfor i in range (min(count)):\r\n print(position[0][i], position[1][i], position[2][i])", "n=int(input())\r\nsp=[int(i) for i in input().split()]\r\nw=min(sp.count(1),sp.count(2),sp.count(3))\r\nprint(w)\r\nif w!=0:\r\n sp1,sp2,sp3=[],[],[]\r\n i=0\r\n for i in range(len(sp)):\r\n if len(sp1)>=w and len(sp2)>=w and len(sp3)>=w:\r\n break\r\n else:\r\n if sp[i]==1 and len(sp1)<w:\r\n sp1.append(i+1)\r\n elif sp[i]==2 and len(sp2)<w:\r\n sp2.append(i+1)\r\n elif len(sp3)<w and sp[i]==3:\r\n sp3.append(i+1)\r\n for i in range(w):\r\n print(sp1[i],sp2[i],sp3[i])", "a = int(input())\r\nb = [int(num) for num in input().split()]\r\nones = []\r\ntwos = []\r\nthrees = []\r\nfor i in range(a):\r\n if b[i] == 1:\r\n ones.append(i)\r\n if b[i] == 2:\r\n twos.append(i)\r\n if b[i] == 3:\r\n threes.append(i)\r\nmin_teams = min(len(ones),len(twos),len(threes))\r\nprint(min_teams)\r\nfor i in range(min_teams):\r\n k = [ones[i]+1, twos[i]+1, threes[i]+1]\r\n print(*k)", "x=int(input());l=list(map(int,input().split()));c=min(l.count(2),l.count(1),l.count(3))\r\nif c==0: print(c)\r\nelse:\r\n\tprint(c)\r\n\tfor i in range(c):\r\n\t ll=[];o=l.index(1);ll.append(o+1);l[o]=0;o=l.index(2);ll.append(o+1);l[o]=0;o=l.index(3);ll.append(o+1);l[o]=0;print(*ll)", "def intmap():\r\n return map(int, input().split())\r\n# for i in range(int(input())):\r\nn = int(input())\r\narr = list(intmap())\r\nmath = []\r\nphy = []\r\nprog = []\r\nfor i in range(len(arr)) :\r\n if arr[i] == 1 :\r\n math.append(i+1)\r\n elif arr[i] == 2:\r\n phy.append(i+1)\r\n else :\r\n prog.append(i+1)\r\nmn = min(len(math), len(phy), len(prog))\r\nprint(mn)\r\nfor i in range(mn) :\r\n print(math.pop(), phy.pop(), prog.pop())\r\n", "n = int(input())\r\nstudents = input().split()\r\n\r\nprog = []\r\nmath = []\r\nBE = []\r\n\r\nif '1' in students and '2' in students and '3' in students:\r\n for i in range(n):\r\n if students[i] == '1':\r\n prog.append(i + 1)\r\n if students[i] == '2':\r\n math.append(i + 1)\r\n if students[i] == '3':\r\n BE.append(i + 1)\r\n\r\n no_of_teams = min(len(prog), len(math), len(BE))\r\n print(no_of_teams)\r\n for i in range(no_of_teams):\r\n print(prog[i], math[i], BE[i])\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\na = [[], [], []]\r\nfor i in range(n):\r\n a[t[i] - 1].append(i + 1)\r\nr = min(map(len, a))\r\nprint(r)\r\nfor i in range(r):\r\n print(a[0][i], a[1][i], a[2][i])\r\n", "def main():\r\n n = int(input())\r\n t = list(map(int, input().split()))\r\n ones = []\r\n twos = []\r\n threes = []\r\n for i in range(n):\r\n if t[i] == 1:\r\n ones.append(i+1)\r\n elif t[i] == 2:\r\n twos.append(i+1)\r\n else:\r\n threes.append(i+1)\r\n \r\n min_len = len(ones)\r\n if len(twos) < min_len:\r\n min_len = len(twos)\r\n if len(threes) < min_len:\r\n min_len = len(threes)\r\n \r\n print(min_len)\r\n for i in range(min_len):\r\n print(ones[i], twos[i], threes[i])\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "n = input()\r\na = list(map(int, input().split()))\r\nz = list(filter(lambda x: x == 1, a))\r\ns = list(filter(lambda x: x == 2, a))\r\nk = list(filter(lambda x: x == 3, a))\r\nprint(min(len(z), len(s), len(k)))\r\nfor i in range(min(len(z), len(s), len(k))):\r\n print(a.index(1) + 1, end=' ')\r\n a[a.index(1)] = 4\r\n print(a.index(2) + 1, end=' ')\r\n a[a.index(2)] = 4\r\n print(a.index(3) + 1)\r\n a[a.index(3)] = 4", "_ = input()\r\narr = input().split()\r\ntmp = {}\r\nfor i, j in enumerate(arr):\r\n tmp[j] = tmp.get(j, []) + [i + 1]\r\nres = list(map(lambda x, y, z: f'{x} {y} {z}', *tmp.values())) if len(tmp) == 3 else []\r\nprint(len(res), *res, sep='\\n')", "input();a=[[],[],[]]\r\nfor i,k in enumerate(input().split(),1):a[int(k)-1]+=[i]\r\nprint(min(map(len,a)))\r\nfor k in zip(*a):print(*k)", "n=int(input()); s=list(map(int,input().split())); l=sorted([s.count(i) for i in range(1,4)]); print(min(l))\r\nfor i in range(min(l)):a,b,c=s.index(1),s.index(2),s.index(3); print(a+1,b+1,c+1); s[a]=s[b]=s[c]=0", "def find_teams(n, skills):\r\n programmers = [(i, skill) for i, skill in enumerate(skills, 1) if skill == 1]\r\n mathematicians = [(i, skill) for i, skill in enumerate(skills, 1) if skill == 2]\r\n sportsmen = [(i, skill) for i, skill in enumerate(skills, 1) if skill == 3]\r\n\r\n teams = []\r\n while programmers and mathematicians and sportsmen:\r\n teams.append([programmers.pop()[0], mathematicians.pop()[0], sportsmen.pop()[0]])\r\n\r\n return teams\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n skills = list(map(int, input().split()))\r\n\r\n teams = find_teams(n, skills)\r\n\r\n if len(teams) == 0:\r\n print(0)\r\n else:\r\n print(len(teams))\r\n for team in teams:\r\n print(*team)\r\n", "if __name__ == '__main__':\r\n n = int(input())\r\n x = input().split()\r\n li = [int(i) for i in x]\r\n m1 = 0\r\n m2 = 0\r\n m3 = 0\r\n\r\n for i in li:\r\n if i == 1:\r\n m1 += 1\r\n elif i == 2:\r\n m2 += 1\r\n else:\r\n m3 += 1\r\n count = min(m1, m2, m3)\r\n\r\n if count == 0:\r\n print(0)\r\n else:\r\n l1 = []\r\n l2 = []\r\n l3 = []\r\n for i in range(0, len(li)):\r\n if li[i] == 1:\r\n l1.append(i + 1)\r\n elif li[i] == 2:\r\n l2.append(i + 1)\r\n else:\r\n l3.append(i + 1)\r\n\r\n print(count)\r\n for i in range(0, count):\r\n print(l1[i], l2[i], l3[i])", "NUMBER_OF_SKILLS = TEAM_SIZE = 3\n\nPROGRAMMING_SKILL = 1\nMATHS_SKILL = 2\nPHYSICAL_EDUCATION_SKILL = 3\n\nnumber_of_children = int(input())\nchildren_skills = input().split()\nskill_groups = [[] for _ in range(NUMBER_OF_SKILLS)]\nskill_groups_sizes = [0] * NUMBER_OF_SKILLS\n\nfor child in range(number_of_children):\n child_skill = int(children_skills[child])\n skill_groups[child_skill - 1].append(child + 1)\n skill_groups_sizes[child_skill - 1] += 1\n\nteams = []\nnumber_of_formed_teams = 0\nis_possible_to_form_team = (skill_groups_sizes[PROGRAMMING_SKILL - 1] > 0 and\n skill_groups_sizes[MATHS_SKILL - 1] > 0 and\n skill_groups_sizes[PHYSICAL_EDUCATION_SKILL - 1] > 0)\n\nwhile is_possible_to_form_team:\n teams.append([skill_groups[i][number_of_formed_teams] for i in range(TEAM_SIZE)])\n number_of_formed_teams += 1\n for i in range(NUMBER_OF_SKILLS):\n skill_groups_sizes[i] -= 1\n if skill_groups_sizes[i] == 0 and is_possible_to_form_team:\n is_possible_to_form_team = False\n\nprint(number_of_formed_teams)\n\nif number_of_formed_teams > 0:\n for team in teams:\n team_formatted_output = ''\n for i in range(TEAM_SIZE):\n team_formatted_output += f'{team[i]} ' if i < TEAM_SIZE - 1 else str(team[i])\n print(team_formatted_output)\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\na = []\r\nb = []\r\nc = []\r\nfor i in range(1, len(s)+1):\r\n if s[i-1] == 1:\r\n a.append(i)\r\n elif s[i-1] == 2:\r\n b.append(i)\r\n elif s[i-1] == 3:\r\n c.append(i)\r\nm = [len(a), len(b), len(c)]\r\nprint(min(m))\r\nfor i in range(min(m)):\r\n print(a[i], b[i], c[i])\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\na1 = []\r\na2 = []\r\na3 = []\r\nfor i in range(n):\r\n if arr[i] == 1:\r\n a1.append(i+1)\r\n elif arr[i] == 2:\r\n a2.append(i + 1)\r\n else:\r\n a3.append(i + 1)\r\n\r\nx = min(len(a1), len(a2), len(a3))\r\nprint(x)\r\nfor i in range(x):\r\n print(a1.pop(), a2.pop(), a3.pop())", "n = int(input()) # Read the number of children\r\nskills = list(map(int, input().split())) # Read the skills of each child\r\n\r\nprogramming = []\r\nmaths = []\r\npe = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n maths.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\nnum_teams = min(len(programming), len(maths), len(pe)) # Find the maximum number of teams\r\n\r\nprint(num_teams)\r\n\r\nfor i in range(num_teams):\r\n team = [programming[i], maths[i], pe[i]] # Form a team by selecting one child from each subject\r\n print(*team)\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\nprogrammers = []\r\nmathematicians = []\r\npe = []\r\n\r\nfor i in range(n):\r\n if t[i] == 1:\r\n programmers.append(i + 1)\r\n elif t[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\nteams = min(len(programmers), len(mathematicians), len(pe))\r\n\r\nprint(teams)\r\nfor i in range(teams):\r\n print(programmers[i], mathematicians[i], pe[i])\r\n", "_ = input()\r\ns = list(map(int, input().split()))\r\n\r\ngroups = {'t1': [], 't2': [], 't3': []}\r\n\r\nfor idx, skill in enumerate(s):\r\n\tif skill == 1:\r\n\t\tgroups['t1'].append(idx + 1)\r\n\telif skill == 2:\r\n\t\tgroups['t2'].append(idx + 1)\r\n\telse:\r\n\t\tgroups['t3'].append(idx + 1)\r\n\r\ntotal_teams = min(len(groups['t1']), len(groups['t2']), len(groups['t3']) )\r\n\r\nprint(total_teams)\r\nfor i in range(total_teams):\r\n\tprint(groups['t1'][i], groups['t2'][i], groups['t3'][i])", "n = int(input())\r\nlst = list(map(int, input().split()))\r\none = [i+1 for i, x in enumerate(lst) if x == 1]\r\ntwo = [i+1 for i, x in enumerate(lst) if x == 2]\r\nthr = [i+1 for i, x in enumerate(lst) if x == 3]\r\nr = min([len(one), len(two), len(thr)])\r\nprint(r)\r\nfor i in range(r):\r\n print(\" \".join(str(x) for x in [one[i], two[i], thr[i]]))", "n = int(input())\r\ns = map(int, input().split())\r\nstds = {1:[], 2:[], 3:[]}\r\nfor inx,i in enumerate(s):\r\n stds[i].append(inx+1)\r\nm = min(len(stds[1]), len(stds[2]), len(stds[3]))\r\nprint(m)\r\nfor i in range(m):\r\n team = \"\"\r\n for j in stds:\r\n team += str(stds[j][i]) + \" \"\r\n print(team[:-1])\r\n\r\n\r\n", "def maximum_teams(n, skills):\r\n programming = skills.count(1)\r\n math = skills.count(2)\r\n pe = skills.count(3)\r\n w = min(programming, math, pe)\r\n teams = []\r\n for i in range(w):\r\n team = []\r\n team.append(skills.index(1)+1)\r\n skills[skills.index(1)] = 0\r\n team.append(skills.index(2)+1)\r\n skills[skills.index(2)] = 0\r\n team.append(skills.index(3)+1)\r\n skills[skills.index(3)] = 0\r\n teams.append(team)\r\n return (w, teams)\r\n\r\nn = int(input().strip())\r\nskills = list(map(int, input().strip().split()))\r\nw, teams = maximum_teams(n, skills)\r\nprint(w)\r\nfor team in teams:\r\n print(*team)\r\n", "#490\r\nn2=int(input())\r\na2=list(map(int,input().split()))\r\np=[]\r\nm=[]\r\nf=[]\r\nfor i in range(n2):\r\n if a2[i]==1:\r\n p.append(i+1)\r\n elif a2[i]==2:\r\n m.append(i+1)\r\n elif a2[i]==3:\r\n f.append(i+1) \r\npl=len(p)\r\nml=len(m)\r\nfl=len(f)\r\nmk=min(pl,ml,fl)\r\nprint(mk)\r\nfor i in range(mk):\r\n print(p[i],m[i],f[i])\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\npr = 0\r\nprlist = []\r\nma = 0\r\nmalist = []\r\npe = 0\r\npelist = []\r\nfor i in range(n):\r\n if t[i] == 1:\r\n pr += 1\r\n prlist.append(i+1)\r\n elif t[i] == 2:\r\n ma += 1\r\n malist.append(i+1)\r\n elif t[i] == 3:\r\n pe += 1\r\n pelist.append(i+1)\r\n\r\nprint(min(pr, ma, pe))\r\nfor i in range(min(len(prlist), len(malist), len(pelist))):\r\n print(prlist[i], malist[i], pelist[i])", "a = int(input())\r\nlis = input().split()\r\n\r\nlis1 = []\r\nlis2 = []\r\nlis3 = []\r\n\r\nfor i in range(len(lis)):\r\n if lis[i] == \"1\":\r\n lis1.append(i+1)\r\n elif lis[i] == \"2\":\r\n lis2.append(i+1)\r\n else:\r\n lis3.append(i+1)\r\n\r\nmins = min(len(lis1),len(lis2),len(lis3))\r\nprint(mins)\r\nfor i in range(mins):\r\n print(f\"{lis1[i]} {lis2[i]} {lis3[i]}\")", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm = {\r\n 1:[],\r\n 2:[],\r\n 3:[]\r\n}\r\n\r\nfor i in range(n):\r\n m[l[i]].append(i)\r\n \r\nvalidTeams = []\r\n\r\nfor i in range(n):\r\n if(len(m[1]) and len(m[2]) and len(m[3])):\r\n validTeams.append([m[1].pop() + 1,m[2].pop() + 1,m[3].pop() + 1])\r\n else:\r\n break\r\n\r\nif(len(validTeams)):\r\n print(len(validTeams))\r\n for i in validTeams:\r\n print(*i)\r\nelse:\r\n print(0)", "_, t = input(), tuple(map(int, input().split()))\r\nt = list(enumerate(t, 1))\r\nr = []\r\nwhile True:\r\n c = []\r\n for i in (1, 2, 3):\r\n for e in t:\r\n if e[1] == i:\r\n c.append(e[0])\r\n t.remove(e)\r\n break\r\n if len(c) == 3:\r\n r.append(c)\r\n else:\r\n break\r\nprint(len(r))\r\nfor e in r: print(*e)\r\n", "n=int(input())\r\nt=input().split()\r\nt=[int(i) for i in t]\r\nn1,n2,n3=0,0,0\r\none,two,three=[],[],[]\r\nfor i in range(n):\r\n if t[i]==1:\r\n n1+=1\r\n one.append(i+1)\r\n elif t[i]==2:\r\n n2+=1\r\n two.append(i+1)\r\n else:\r\n n3+=1\r\n three.append(i+1)\r\nc=min(n1,n2,n3)\r\nprint(c)\r\nif c!=0:\r\n for i in range(c):\r\n print(one[i],two[i],three[i],sep=' ')", "n=int(input())\r\nl=list(map(int,input().split()))\r\nteam=[[],[],[]]\r\n\r\nfor i in range(n):\r\n skill=l[i]\r\n if skill==1:\r\n team[0].append(i+1)\r\n elif skill==2:\r\n team[1].append(i+1)\r\n elif skill==3:\r\n team[2].append(i+1)\r\na=min(len(team[0]),len(team[1]),len(team[2]))\r\nprint(a)\r\nfor i in range(a):\r\n print(team[0][i],team[1][i],team[2][i])", "n = int(input())\r\na = list(map(int, input().split()))\r\none = []\r\ntwo = []\r\nthr = []\r\nc = 0\r\nfor i in range(n):\r\n if a[i] == 1:\r\n one.append(i+1)\r\n elif a[i] == 2:\r\n two.append(i+1)\r\n else:\r\n thr.append(i+1)\r\nprint(min(a.count(1), a.count(2), a.count(3)))\r\na.sort(reverse=True)\r\nfor i in range(min(a.count(1), a.count(2), a.count(3))):\r\n print(one[i], end=' ')\r\n print(two[i], end=' ')\r\n print(thr[i])\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nd = {}\r\nfor i,v in enumerate(a):\r\n if v not in d:\r\n d[v] = [i+1]\r\n else:\r\n d[v].append(i+1)\r\n\r\nres = []\r\ncnt = 0\r\nwhile len(d) == 3:\r\n if len(d) < 3:\r\n break\r\n ad = []\r\n for i in range(3):\r\n ad.append(d[i+1][0])\r\n del(d[i+1][0])\r\n if d[i+1] == []:\r\n del(d[i+1])\r\n res.append(ad)\r\n cnt += 1\r\n\r\nif cnt == 0:\r\n print(str(0))\r\nelse:\r\n print(str(cnt))\r\n for line in res:\r\n print(\" \".join([str(i) for i in line]))\r\n\r\n", "t = int(input())\r\n*inputs,=map(int,input().split())\r\nstudents = list(inputs)\r\n\r\narr=[[],[],[]]\r\n\r\nfor i in range(t):\r\n arr[students[i]-1].append(i+1)\r\n\r\nx = min(len(arr[0]), len(arr[1]), len(arr[2]))\r\n\r\nprint(x)\r\nfor i in range(x):\r\n print(arr[0][i], arr[1][i], arr[2][i])", "\r\nw = int(input())\r\nchildren = list(map(int,input().split(' ')))\r\n\r\nc1 = c2 = c3 = 0\r\n\r\nresult = []\r\n\r\nfor i in range(len(children)):\r\n if children[i] == 1:\r\n try:\r\n result[c1][0] = i+1\r\n except :\r\n result.append([i+1,-1,-1])\r\n c1+=1\r\n elif children[i] == 2:\r\n try:\r\n result[c2][1] = i+1\r\n except :\r\n result.append([-1,i+1,-1])\r\n c2+=1\r\n elif children[i] == 3:\r\n try:\r\n result[c3][2] = i+1\r\n except :\r\n result.append([-1,-1,i+1])\r\n c3+=1\r\nx =min(c1,c2,c3)\r\nprint(x)\r\n\r\nfor i in range(x):\r\n print(' '.join(map(str,result[i])))\r\n \r\n\r\n\r\n", "n = int(input())\r\nmembers = list(map(int, input().split()))\r\n\r\nprogram = []\r\nmath = []\r\nPE = []\r\nfor i in range(n):\r\n if members[i] == 1:\r\n program.append(i + 1)\r\n elif members[i] == 2:\r\n math.append(i + 1)\r\n else:\r\n PE.append(i + 1)\r\n\r\n\r\nteams = min([len(program), len(math), len(PE)])\r\nprint(teams)\r\nfor i in range(teams):\r\n print(f'{program[i]} {math[i]} {PE[i]}')\r\n\r\n", "n=int(input())\r\nl= list(map(int,input().split()))\r\nm = tuple(l)\r\nl.sort()\r\nones=0\r\ntwos=0\r\nthrees=0\r\nfor x in l:\r\n if(x==1):\r\n ones+=1\r\n elif(x==2):\r\n twos+=1\r\n elif(x==3):\r\n threes+=1\r\nif(ones==0 or twos==0 or threes==0):\r\n print(\"0\")\r\nelse:\r\n print(min(ones,twos,threes))\r\n on=[]\r\n tw=[]\r\n th=[]\r\n for x in range(len(m)):\r\n if(m[x]==1):\r\n on.append(x+1)\r\n elif(m[x]==2):\r\n tw.append(x+1)\r\n elif(m[x]==3):\r\n th.append(x+1)\r\n \r\n for j in range(min(len(on),len(tw),len(th))):\r\n print(str(on[j])+\" \"+str(tw[j])+\" \"+str(th[j]))\r\n ", "n = int(input())\r\n\r\nchild = map(int, input().split())\r\n\r\nteam = {i: [] for i in range(3)}\r\n\r\nfor i, j in enumerate(child):\r\n team[j - 1].append(i + 1)\r\n\r\nteam_num = min(map(len, team.values()))\r\nprint(team_num)\r\n\r\nfor t in zip(*team.values()):\r\n print(*t)", "n = int(input())\r\nnum = input().split()\r\nnum = list(map(int,num))\r\nprog = []\r\nmath = []\r\nphy = []\r\nkol = 0\r\nfor i in range(n):\r\n if num[i] == 1:\r\n prog.append(i + 1)\r\n if num[i] == 2:\r\n math.append(i + 1)\r\n if num[i] == 3:\r\n phy.append(i + 1)\r\na = min(len(prog),len(math),len(phy))\r\n\r\nif len(prog) > 0 and len(math) > 0 and len(phy) > 0:\r\n print(a)\r\n for i in range(a): \r\n print(prog[i],math[i],phy[i])\r\nelse:\r\n print(0)", "#!/usr/bin/env python3\n\ndef solve(t):\n students = t.split(' ')\n programmers, mathematicians, sportmans = [], [], []\n\n for student, gift in enumerate(students, 1):\n if gift == '1':\n programmers.append(student)\n if gift == '2':\n mathematicians.append(student)\n if gift == '3':\n sportmans.append(student)\n\n rarest_gift = min(len(programmers), len(mathematicians), len(sportmans))\n teams = str(rarest_gift)\n\n for i, team in enumerate(range(rarest_gift)):\n teams += '\\n'\n teams += f'{programmers.pop()} {mathematicians.pop()} {sportmans.pop()}'\n\n return teams\n\ndef test():\n assert solve('1 3 1 3 2 1 2') == '2\\n6 7 4\\n3 5 2'\n assert solve('2 1 1 2') == '0'\n\nif __name__ == '__main__':\n n = input()\n print(solve(input()))\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\nc = min(t.count(1), t.count(2), t.count(3))\r\nprint(c)\r\nif c > 0:\r\n for i in range(c):\r\n print(t.index(1)+1, t.index(2)+1, t.index(3)+1)\r\n t[t.index(1)] = 4\r\n t[t.index(2)] = 4\r\n t[t.index(3)] = 4", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = []\r\nb = []\r\nc = []\r\nx = 0\r\ncnt1 = 0\r\ncnt2 = 0\r\ncnt3 = 0\r\nfor i in range(n):\r\n if(l[i] == 1):\r\n cnt1+=1\r\n a.append(i)\r\n elif(l[i] == 2):\r\n cnt2+=1\r\n b.append(i)\r\n else:\r\n cnt3+=1\r\n c.append(i)\r\nx = min(cnt1, cnt2, cnt3)\r\nprint(x)\r\nfor i in range(x):\r\n print(a[i] + 1, b[i] + 1, c[i] + 1)\r\n#fatih gay\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nc1 = arr.count(1)\r\nc2 = arr.count(2)\r\nc3 = arr.count(3)\r\nk = min(c1, c2, c3)\r\nprint(k)\r\nwhile k:\r\n k -= 1\r\n print(arr.index(1) + 1, arr.index(2) + 1, arr.index(3) + 1)\r\n arr[arr.index(1)] = 0\r\n arr[arr.index(2)] = 0\r\n arr[arr.index(3)] = 0\r\n ", "n = int(input())\nlst = list(map(int, input().split()))\none, two, three = [], [], []\nfor i in range(n):\n if lst[i]==1:\n one.append(i+1)\n elif lst[i]==2:\n two.append(i+1)\n else:\n three.append(i+1)\nmn=min(len(one),len(two),len(three))\nprint(mn)\nfor i in range(mn):\n print(one[i],two[i],three[i])\n\n\t\t\t \t \t\t\t\t \t\t \t \t \t \t", "from collections import defaultdict\r\nn = int(input())\r\nlist_ = list(map(int, input().split()))\r\nl = []\r\nout_l = []\r\nmin_len = n\r\nindex_dict = defaultdict(list)\r\nindex_dict[1] = []\r\nindex_dict[2] = []\r\nindex_dict[3] = []\r\nfor i,e in enumerate(list_):\r\n index_dict[e].append(i)\r\nfor k in index_dict.keys():\r\n if len(index_dict[k]) < min_len:\r\n min_len = len(index_dict[k])\r\nnbr_teams = min_len\r\nif nbr_teams != 0:\r\n out_l.append(nbr_teams)\r\n for j in range(nbr_teams):\r\n for k,v in index_dict.items():\r\n l.append(v[j]+1)\r\n out_l.append(l)\r\n l = []\r\nelse:\r\n out_l.append(0)\r\nfor ele in out_l:\r\n if not isinstance(ele, list):\r\n print(ele)\r\n else:\r\n print(*ele)", "a = int(input())\r\ni = 1\r\nj = 1\r\nk = 1\r\nb = list(map(int, input().split()))\r\nc = b.count(1)\r\nd = b.count(2)\r\ne = b.count(3)\r\nf = min(c, d, e)\r\nprint(f)\r\nfor x in range(f):\r\n while True:\r\n if b[i - 1] == 1:\r\n i = i + 1\r\n break\r\n else:\r\n i = i + 1\r\n while True:\r\n if b[j - 1] == 2:\r\n j = j + 1\r\n break\r\n else:\r\n j = j + 1\r\n while True:\r\n if b[k - 1] == 3:\r\n k = k + 1\r\n break\r\n else:\r\n k = k + 1\r\n print(i - 1, j - 1, k - 1)", "n=int(input())\r\na=list(map(int,input().split()))\r\nw=min(a.count(1),a.count(2),a.count(3))\r\nd={1:[],2:[],3:[]}\r\nfor i in range(n):\r\n d[a[i]].append(i+1)\r\nprint(w)\r\nfor i in range(w):\r\n print(d[1][i],d[2][i],d[3][i])\r\n", "n = input()\r\nx = list(map(int,input().split()))\r\ni = 0\r\none_counter,two_counter,three_counter = x.count(1),x.count(2),x.count(3)\r\none_indexes,two_indexes,three_indexes =[],[],[]\r\nfor a in x:\r\n i+=1\r\n if a == 1:\r\n one_indexes.append(i)\r\n elif a == 2:\r\n two_indexes.append(i)\r\n elif a == 3:\r\n three_indexes.append(i)\r\nminimu = min(one_counter,two_counter,three_counter)\r\nprint(minimu)\r\nif minimu > 0:\r\n for c in range(minimu):\r\n print(f\"{one_indexes.pop()} {two_indexes.pop()} {three_indexes.pop()}\")", "n=int(input())\r\nt=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nz=0\r\nfor i in t:\r\n if i%3==0:\r\n x+=1\r\n elif i%3==1:\r\n y+=1\r\n else:\r\n z+=1\r\nprint(min(x,y,z))\r\na=list()#список позиций 3 в списке t\r\nb=list()#список позиций 2 в списке t\r\nc=list()#список позиций 1 в списке t\r\nfor i in range(0, len(t)):\r\n if t[i]%3==0:\r\n if len(a)<min(x,y,z):\r\n a.append(i+1)\r\n elif t[i]%3==2:\r\n if len(b)<min(x,y,z):\r\n b.append(i+1)\r\n else:\r\n if len(c)<min(x,y,z):\r\n c.append(i+1)\r\nwhile len(c)>0:\r\n print(a[0],b[0],c[0])\r\n c.pop(0)\r\n a.pop(0)\r\n b.pop(0)\r\n\r\n", "q = input()\r\nl = input().split()\r\na = []\r\nb = []\r\nc = []\r\na1 = 0\r\nb2 = 0\r\nc3 = 0\r\nfor i in range(len(l)):\r\n if l[i] == '1':\r\n a1 += 1\r\n a.append(i + 1)\r\n elif l[i] == '2':\r\n b2 += 1\r\n b.append(i + 1)\r\n else:\r\n c3 += 1\r\n c.append(i + 1)\r\nprint(min(a1, b2, c3))\r\nfor j in range(min(a1, b2, c3)):\r\n print(a[j], b[j], c[j])\r\n \r\n \r\n \r\n \r\n\r\n\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\n\r\n\r\ndef min(a, b, c):\r\n if (a <= b and a <= c):\r\n return a\r\n elif (b <= a and b <= c):\r\n return b\r\n else:\r\n return c\r\n\r\n\r\nif (n >= 3):\r\n oneCount = 0\r\n twoCount = 0\r\n threeCount = 0\r\n dict1 = {}\r\n for i in x:\r\n if (i == 1):\r\n oneCount += 1\r\n elif (i == 2):\r\n twoCount += 1\r\n else:\r\n threeCount += 1\r\n\r\n teams = min(oneCount, twoCount, threeCount)\r\n print(teams)\r\n res_arr = []\r\n for i in range(len(x)):\r\n dict1[i+1] = x[i]\r\n if (teams > 0):\r\n for i in range(teams):\r\n temp_arr = []\r\n for i in dict1.keys():\r\n if (dict1[i] == 1):\r\n temp_arr.append(i)\r\n dict1.pop(i)\r\n break\r\n for i in dict1.keys():\r\n if (dict1[i] == 2):\r\n temp_arr.append(i)\r\n dict1.pop(i)\r\n break\r\n for i in dict1.keys():\r\n if (dict1[i] == 3):\r\n temp_arr.append(i)\r\n dict1.pop(i)\r\n break\r\n print(*temp_arr, sep=\" \")\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\npupils = list(map(int, input().split()))\r\namounts = [0, 0, 0]\r\nfor i in pupils:\r\n amounts[i-1] += 1\r\nprint(min(amounts))\r\nif min(amounts) != 0:\r\n p, m, s = pupils.index(1)+1, pupils.index(2)+1, pupils.index(3)+1\r\n print(p, m, s)\r\nfor i in range(min(amounts)-1):\r\n p = pupils[p:].index(1)+1+p\r\n m = pupils[m:].index(2)+1+m\r\n s = pupils[s:].index(3)+1+s\r\n print(p,m,s)", "n=int(input())\r\nvalues=list(map(int,input().split(' ')))\r\nw=min(values.count(1),values.count(2),values.count(3))\r\nprint(w)\r\n \r\nif(w!=0):\r\n one=[]\r\n two=[]\r\n three=[]\r\n for i in range(0,n):\r\n if(values[i]==1):\r\n one.append(i+1)\r\n elif(values[i]==2):\r\n two.append(i+1)\r\n elif(values[i]==3):\r\n three.append(i+1)\r\n for i in range(0,w):\r\n print(str(one[i])+' '+str(two[i])+' '+str(three[i]))", "n =int(input())\r\na=[]\r\nminim=0\r\ntx=input()\r\na=tx.split()\r\nn1=0\r\nn2=0\r\nn3=0\r\n\r\nb1=[]\r\nb2=[]\r\nb3=[]\r\nfor i in range (n):\r\n if int(a[i])==1:\r\n n1=n1+1\r\n b1.append(i+1)\r\n if int(a[i])==2:\r\n n2=n2+1\r\n b2.append(i+1)\r\n if int(a[i])==3:\r\n n3=n3+1\r\n b3.append(i+1)\r\nif ((n1<=n2) and (n1<=n3)):\r\n minim=n1\r\nif ((n2<=n1) and (n2<=n3)):\r\n minim=n2\r\nif ((n3<=n1) and (n3<=n2)):\r\n minim=n3\r\nprint (minim)\r\nfor i in range (minim):\r\n tx=\"\"\r\n tx=tx+str(b1[i])+\" \"+str(b2[i])+\" \"+str(b3[i]) \r\n print (tx)\r\n", "num_students = int(input())\r\narr_students = list(map(int, input().split()))\r\nmath_students = []\r\npe_students = []\r\npro_students = []\r\nfor ind in range(0, num_students):\r\n if arr_students[ind] == 1:\r\n pro_students.append(ind + 1)\r\n elif arr_students[ind] == 2:\r\n math_students.append(ind + 1)\r\n else:\r\n pe_students.append(ind + 1)\r\n\r\ntotal_teams = 0\r\nif min(len(math_students), len(pe_students), len(pro_students)) > 0:\r\n total_teams = min(len(math_students), len(pe_students), len(pro_students))\r\n\r\nteams = []\r\n\r\nfor i in range(total_teams):\r\n team = [str(math_students[i]), str(pe_students[i]), str(pro_students[i])]\r\n teams.append(team)\r\n\r\nprint(total_teams)\r\nif total_teams != 0:\r\n for t in teams:\r\n print(' '.join(t))", "t = int(input())\r\na = list(map(int, input().split()))\r\na_with_indices = [(a[i], i + 1) for i in range(len(a))] # Store the original indices\r\na_with_indices.sort(key=lambda x: x[0]) # Sort the list based on the integers\r\n\r\nca, cb, cc = 0, 0, 0\r\na1, a2, a3 = [], [], []\r\n\r\nfor i in range(len(a_with_indices)):\r\n num, index = a_with_indices[i]\r\n if num == 1:\r\n ca += 1\r\n a1.append(index)\r\n elif num == 2:\r\n cb += 1\r\n a2.append(index)\r\n elif num == 3:\r\n cc += 1\r\n a3.append(index)\r\n\r\nmin_occurrences = min(ca, cb, cc)\r\nprint(min_occurrences)\r\n\r\nfor i in range(min_occurrences):\r\n print(a1[i], a2[i], a3[i])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=[[0 for i in range(3)]for j in range(int(n/3))]\r\nfor i in range(int(n/3)):\r\n for j in range(3):\r\n if j+1 in l:\r\n ans[i][j]=l.index(j+1)+1\r\n l[l.index(j+1)]=0\r\n \r\ncount=0\r\nfor i in range(int(n/3)):\r\n if 0 in ans[i]:\r\n continue\r\n else:\r\n count=count+1\r\nprint(count)\r\nfor j in range(int(n/3)):\r\n if 0 in ans[j]:\r\n continue\r\n else:\r\n print(' '.join(map(str,ans[j])))\r\n\r\n \r\n \r\n", "n=int(input())\r\nn1=input().split(\" \")\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nfor i in range(len(n1)):\r\n\r\n if int(n1[i])==1:\r\n l1.append(i+1)\r\n elif int(n1[i])==2:\r\n l2.append(i+1)\r\n else:\r\n l3.append(i+1)\r\n\r\nif len(l1)<=len(l2) and len(l1)<=len(l3):\r\n print(len(l1))\r\n for k in range(len(l1)):\r\n print(l1[k],l2[k],l3[k])\r\nelif len(l2)<=len(l1) and len(l2)<=len(l3):\r\n print(len(l2))\r\n for k in range(len(l2)):\r\n print(l1[k],l2[k],l3[k])\r\nelse:\r\n print(len(l3))\r\n for k in range(len(l3)):\r\n print(l1[k],l2[k],l3[k])\r\n", "num = int(input())\r\nstr1 = input().split()\r\nnum1 = str1.count('1')\r\nnum2 = str1.count('2')\r\nnum3 = str1.count('3')\r\ns = min(num1,num2,num3)\r\nlest = []\r\nstr2 = \"\"\r\nfor x in range(s) :\r\n a = str1.index('1')\r\n b = str1.index('2')\r\n c = str1.index('3')\r\n str2 += (f\"{a+1} \")\r\n str2 += (f\"{b+1} \")\r\n str2 += (f\"{c+1} \")\r\n str1[a] = \"\"\r\n str1[b] = \"\"\r\n str1[c] = \"\"\r\n lest.append(str2)\r\n str2 = \"\"\r\nif s != 0 :\r\n print(s)\r\n for x in lest :\r\n print(x)\r\nelse : print(0)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nif a.count(1)<0 or a.count(2)<0 or a.count(3)<0:\r\n print(0)\r\n exit()\r\nq=(min(a.count(1), a.count(2), a.count(3)))\r\nprint(q)\r\nfor i in range(q):\r\n w=[a.index(1)+1, a.index(2)+1, a.index(3)+1]\r\n z=a.index(1)\r\n x=a.index(2)\r\n c=a.index(3)\r\n b.append(w)\r\n a.remove(1)\r\n a.insert(z, 0)\r\n a.remove(2)\r\n a.insert(x, 0)\r\n a.remove(3)\r\n a.insert(c, 0)\r\nfor i in b:\r\n print(*i)", "a = int(input())\r\nb = input()\r\nb = b.split()\r\nc = [b.count(\"1\"), b.count(\"2\"), b.count(\"3\")]\r\nf = {1:[], 2:[], 3:[]}\r\n\r\nfor i in range(1,len(b)+1):\r\n q = list(f[int(b[i-1])])\r\n q.append(i)\r\n f[int(b[i-1])] = q\r\n\r\nlt = [f[i] for i in f]\r\nitog = len(min(lt, key=len))\r\nprint(itog)\r\nfor i in range(itog):\r\n for r in range(1,4):\r\n print(f[r][i], end=\" \")\r\n print()", "# Read input\r\nn = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\n# Initialize dictionaries to keep track of students' indices by their skills\r\nprogrammers = {}\r\nmathematicians = {}\r\nathletes = {}\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programmers[i+1] = True\r\n elif skills[i] == 2:\r\n mathematicians[i+1] = True\r\n else:\r\n athletes[i+1] = True\r\n\r\n# Find the minimum number of students in each skill group\r\nmin_teams = min(len(programmers), len(mathematicians), len(athletes))\r\n\r\n# Print the number of teams and their composition\r\nprint(min_teams)\r\n\r\n# Print the teams\r\nfor i in range(min_teams):\r\n print(next(iter(programmers)), next(iter(mathematicians)), next(iter(athletes)))\r\n del programmers[next(iter(programmers))]\r\n del mathematicians[next(iter(mathematicians))]\r\n del athletes[next(iter(athletes))]\r\n", "b=int(input())\r\ns=list(map(int,input().split()))\r\nj1=s.count(1)\r\nj2=s.count(2)\r\nj3=s.count(3)\r\nif j1>=1 and j2>=1 and j3>=1:\r\n print(min(j1,j2,j3))\r\n for x in range(min(j1,j2,j3)):\r\n print(s.index(1)+1,s.index(2)+1,s.index(3)+1)\r\n s[s.index(1)]=4 \r\n s[s.index(2)]=4\r\n s[s.index(3)]=4\r\nelse:\r\n print(0)", "w = int(input())\r\n\r\nn = list(map(int, input().split()))\r\n\r\nt = [[], [], []]\r\n\r\nfor i in range(w):\r\n\r\n t[n[i] - 1].append(i + 1)\r\n\r\nmin = min(len(t[0]), len(t[1]), len(t[2]))\r\n\r\nif min > 0:\r\n print(min)\r\n for i in range(min):\r\n print(t[0][i], t[1][i], t[2][i])\r\n\r\nelse:\r\n print(0)", "x = int(input())\r\nt = list(map(int, input().split()))\r\nt1 = []\r\nt2 = []\r\nt3 = []\r\nfor i in range(x):\r\n if t[i] == 1:\r\n t1.append(i + 1)\r\n if t[i] == 2:\r\n t2.append(i + 1)\r\n if t[i] == 3:\r\n t3.append(i + 1)\r\nx = min(len(t1), len(t2), len(t3))\r\nprint(x)\r\nfor i in range(x):\r\n print(t1[i], t2[i], t3[i])", "input()\r\nm = list(map(int, input().split()))\r\nd =0\r\nall = min([m.count(1), m.count(2), m.count(3)])\r\nprint(all)\r\nfor i in range(all):\r\n one, two , three = (m.index(1), m.index(2), m.index(3))\r\n m[one] = 9\r\n m[two] = 9\r\n m[three] = 9\r\n print(one+1, two+1 , three+1)", "n=int(input())\r\nt=input().split()\r\nind_1,ind_2,ind_3=[],[],[]\r\none,two,three=0,0,0\r\nfor i in range(n):\r\n if(t[i]==\"1\"):\r\n one+=1\r\n ind_1.append(i)\r\n elif(t[i]==\"2\"):\r\n two+=1\r\n ind_2.append(i) \r\n else:\r\n three+=1\r\n ind_3.append(i) \r\nmini=min(len(ind_1),len(ind_2),len(ind_3)) \r\nprint(mini) \r\ni=0\r\nwhile(i<mini):\r\n print(ind_1[i]+1,ind_2[i]+1,ind_3[i]+1)\r\n i+=1", "n=int(input())\r\narr=list(map(int,input().split()))\r\no,t,th=[],[],[]\r\nfor i in range(n):\r\n if arr[i]==1:\r\n o.append(i+1)\r\n elif arr[i]==2:\r\n t.append(i+1)\r\n elif arr[i]==3:\r\n th.append(i+1)\r\nx=min(len(o),len(t),len(th))\r\nprint(x)\r\nfor i in range(x):\r\n print(o[i],t[i],th[i])", "input()\r\nt=[int(i) for i in input().split()]\r\na=t.count(1)\r\nb=t.count(2)\r\nc=t.count(3)\r\nif a==0 or b==0 or c==0:\r\n\tprint(0)\r\n\texit()\r\nprint(min([a,b,c]))\r\nfor i in range(min([a,b,c])):\r\n\ta2=t.index(1)\r\n\tb2=t.index(2)\r\n\tc2=t.index(3)\r\n\tt[a2]=0\r\n\tt[b2]=0\r\n\tt[c2]=0\r\n\tprint(a2+1,b2+1,c2+1)", "n = int(input())\r\nT = list(map(int, input().split()))\r\n\r\nD = {1:[],\r\n 2:[],\r\n 3:[]}\r\n\r\nfor i,t in enumerate(T):\r\n D[T[i]].append(i)\r\n\r\nminD = min(len(D[1]), len(D[2]), len(D[3]))\r\nprint(minD)\r\n\r\nfor i in range(minD):\r\n print(f\"{D[1][i]+1} {D[2][i]+1} {D[3][i]+1}\")", "n = int(input())\r\nt = list(map(int, input().split()))\r\none = []\r\ntwo = []\r\nthree = []\r\n\r\nfor i in range(n):\r\n if t[i] == 1:\r\n one.append(i+1)\r\n elif t[i] == 2:\r\n two.append(i+1)\r\n else:\r\n three.append(i+1)\r\n\r\nminNumAmnt = min(len(one), len(two), len(three))\r\nprint(minNumAmnt)\r\nfor i in range(minNumAmnt):\r\n print(f\"{one[i]} {two[i]} {three[i]}\")", "from collections import Counter, defaultdict\r\n\r\nn = int(input())\r\n\r\narr = list(map(int, input().split()))\r\ndic = {1: [], 2: [], 3: []}\r\n\r\nfor index, value in enumerate(arr):\r\n dic[value].append(index + 1)\r\n\r\nminimum = 5000\r\nfor value in dic.values():\r\n minimum = min(minimum, len(value))\r\n\r\nprint(minimum)\r\n\r\nfor operation in range(minimum):\r\n output = []\r\n for key in dic:\r\n output.append(dic[key][operation])\r\n print(*output)", "\r\nn=int(input())#the number of children in the school \r\nt=input().split()\r\nt=''.join(t)\r\nfirst=[]\r\nsecond=[]\r\ntheird=[]\r\nlst=[]\r\nfor i in range(n):\r\n if t[i]=='1':\r\n first.append(i+1)\r\n elif t[i]=='2':\r\n second.append(i+1)\r\n elif t[i]=='3':theird.append(i+1)\r\n\r\nfor i in zip(first,second,theird):\r\n lst.append(i)\r\nprint(len(lst))\r\nfor i in lst:\r\n print(*i)", "def solve(l):\n heh = [[], [], [], []]\n for i in range(len(l)):\n heh[l[i]].append(i+1)\n ans = []\n while True:\n if len(heh[1]) == 0 or len(heh[2]) == 0 or len(heh[3]) == 0:\n break\n ans.append([heh[1].pop(), heh[2].pop(), heh[3].pop()])\n print (len(ans))\n for team in ans:\n print (\" \".join(map(str, team)))\n return\n\ninput()\nl=list(map(int, input().split(\" \")))\nsolve(l)\n ", "a=int(input())\r\narr=input().split()\r\n\r\nn=min(arr.count(\"1\"),arr.count(\"2\"),arr.count(\"3\"))\r\nprint(n)\r\nm=[]\r\np=[]\r\npe=[]\r\nfor i in range(len(arr)):\r\n if arr[i]==\"1\":\r\n m.append(i+1)\r\n elif arr[i]==\"2\":\r\n p.append(i+1)\r\n elif arr[i]==\"3\":\r\n pe.append(i+1)\r\nfor i in range(n):\r\n print(m[i],p[i],pe[i])\r\n \r\n", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\n# Create lists to represent children with different skills\r\nprogramming = []\r\nmath = []\r\npe = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n math.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\n# Find the minimum count of children in the three lists\r\nmin_count = min(len(programming), len(math), len(pe))\r\n\r\n# Initialize the list of teams\r\nteams = []\r\n\r\n# Form teams\r\nfor _ in range(min_count):\r\n team = [programming.pop(), math.pop(), pe.pop()]\r\n teams.append(team)\r\n\r\n# Output the number of teams and the team members\r\nprint(min_count)\r\nfor team in teams:\r\n print(*team)\r\n", "# code.py\r\n\r\nn = int(input())\r\narr = [int(x) for x in input().split()]\r\n\r\ncp = []\r\nmt = []\r\npe = []\r\n\r\nfor i in range(n):\r\n\tif (arr[i] == 1):\r\n\t\tcp.append(i)\r\n\telif (arr[i] == 2):\r\n\t\tmt.append(i)\r\n\telse:\r\n\t\tpe.append(i)\r\n\t\t\r\nans = min(len(cp), len(mt), len(pe))\r\nprint(ans)\r\nfor i in range(ans):\r\n\tprint(cp[i]+1, mt[i]+1, pe[i]+1, sep=\" \")\r\n\t\r\n\r\n\t\t\r\n", "n=int(input())\r\ngifted_subjects=list(map(int,input().split()))\r\nindex1=[]\r\nindex2=[]\r\nindex3=[]\r\nfor i in range(0,n):\r\n if(gifted_subjects[i]==1):\r\n index1.append(i+1)\r\n elif(gifted_subjects[i]==2):\r\n index2.append(i+1)\r\n else:\r\n index3.append(i+1)\r\n \r\noutput=[]\r\npossible_teams=min(len(index1),len(index2),len(index3))\r\nfor i in range(0,possible_teams):\r\n output.append([index1[i],index2[i],index3[i]])\r\nprint(possible_teams)\r\nfor i in output:\r\n print(i[0],i[1],i[2])", "n=int(input())\r\nindex_1=[]\r\nindex_2=[]\r\nindex_3=[]\r\ncount1=count2=count3=0\r\nt=input()\r\nt=t.replace(\" \",\"\")\r\nfor i in range(n):\r\n if(t[i]=='1'):\r\n count1+=1\r\n index_1.append(i+1)\r\n elif(t[i]=='2'):\r\n count2+=1\r\n index_2.append(i+1)\r\n elif(t[i]=='3'):\r\n count3+=1\r\n index_3.append(i+1)\r\n \r\nprint(min(count1,min(count2,count3)))\r\nfor i in range(min(count1,min(count2,count3))):\r\n print(index_1[i],index_2[i],index_3[i])", "n = int(input())\r\nt = {1: [], 2: [], 3: []}\r\nfor i, j in enumerate(map(int, input().split())):\r\n t[j].append(i + 1)\r\n\r\n# 1 - dev, 2 - math, 3 - pe\r\nteams = []\r\n\r\nwhile all(len(i) > 0 for i in t.values()):\r\n teams.append([t[1].pop(), t[2].pop(), t[3].pop()])\r\n\r\nprint(len(teams))\r\nfor i in teams:\r\n print(*i)\r\n", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\na=0\r\nb=0\r\nc=0\r\none=[]\r\ntwo=[]\r\nthree=[]\r\nfor i in range(n):\r\n if l[i]==1:\r\n one.append(i+1)\r\n a=a+1\r\n elif l[i]==2:\r\n two.append(i+1)\r\n b=b+1\r\n else:\r\n three.append(i+1)\r\n c=c+1\r\nprint(min(a,b,c))\r\nfor i in range(min(a,b,c)):\r\n print(one[i],end=\" \")\r\n print(two[i],end=\" \")\r\n print(three[i],end=\" \")\r\n print()", "n=int(input())\r\na=list(map(int,input().split()))\r\nk1,k2,k3=0,0,0\r\nd1,d2,d3=[],[],[]\r\nfor j in range(n):\r\n i=a[j]\r\n if i==1:\r\n k1+=1\r\n d1.append(j+1)\r\n elif i==2:\r\n k2+=1\r\n d2.append(j+1)\r\n else:\r\n k3+=1\r\n d3.append(j+1)\r\nprint(min(k1,k2,k3))\r\nfor i in range(min(k1,k2,k3)):\r\n print(d1[i],d2[i],d3[i])\r\n", "n = int(input())\r\nlst = input().split()\r\nmaths = []\r\nprogramming = []\r\npe = []\r\nif ('1' in lst) and ('2' in lst) and ('3' in lst):\r\n for i in range(n):\r\n if lst[i] == '1':\r\n programming.append(i + 1)\r\n elif lst[i] == '2':\r\n maths.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n teams = min(len(maths), len(programming), len(pe))\r\n print(teams)\r\n for i in range(teams):\r\n print(maths[i], programming[i], pe[i])\r\nelse:\r\n print(0)", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nc1=[]\r\nc2=[]\r\nc3=[]\r\n\r\nfor i in range(n) :\r\n if l[i] == 1 :\r\n c1.append(i+1)\r\n elif l[i] == 2 :\r\n c2.append(i+1)\r\n else :\r\n c3.append(i+1)\r\n \r\nmin = len(c1)\r\nfor i in len(c1),len(c2),len(c3) :\r\n if i < min :\r\n min = i\r\n\r\nprint(min)\r\n\r\nfor i in range(min) :\r\n print(c1[i],c2[i],c3[i])", "n = int(input())\r\nt = [int(x) for x in input().split(' ')]\r\na = []\r\nb = []\r\nc = []\r\n\r\nfor i in range(n):\r\n if t[i] == 1:\r\n a.append(i+1)\r\n elif t[i] == 2:\r\n b.append(i+1)\r\n else:\r\n c.append(i+1)\r\n\r\nn = min(len(a),min(len(b),len(c)))\r\nprint(n)\r\n\r\nfor i in range(n):\r\n print(a[i],b[i],c[i])", "n = int(input())\nt = list(map(int, input().split()))\ns1 = []\ns2 = []\ns3 = []\nw = 0\nfor i in range(len(t)):\n if t[i] == 1:\n s1.append(i+1)\n if t[i] == 2:\n s2.append(i+1)\n if t[i] == 3:\n s3.append(i+1)\nw = min(len(s1), len(s2), len(s3))\nprint(w)\nfor i in range(w):\n print(s1[i], s2[i], s3[i])", "from collections import Counter\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nc=Counter(b)\r\nu=min(c.values()) if [1,2,3] == sorted(list(c.keys())) else 0\r\none=[]\r\ntwo=[]\r\nthree=[]\r\nfor j,k in enumerate(b,1):\r\n\tif k == 1: one.append(j)\r\n\telif k == 2: two.append(j)\r\n\telif k == 3: three.append(j)\r\not = list(zip(one,two,three))\r\nprint(u)\r\nfor i in ot:\r\n\tfor j in i:\r\n\t\tprint(j, end=' ')\r\n\tprint()", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\nfreq, indexes = {}, {}\r\nfor idx, num in enumerate(nums):\r\n freq[num] = freq.get(num, 0) + 1\r\n indexes[num] = indexes.get(num, []) + [idx+1]\r\n \r\nif len(freq) < 3:\r\n print(0)\r\nelse:\r\n minimum = min(freq.values())\r\n print(minimum,\"\\n\")\r\n while minimum > 0:\r\n for val in [1,2,3]:\r\n num = indexes[val].pop(0)\r\n print(num, \" \")\r\n minimum -= 1\r\n print(\"\\n\")\r\n \r\n \r\n \r\n", "n = int(input())\r\nt = list(map(int, input().split(\" \")))\r\n\r\nteams = []\r\n\r\nwhile 1 in t and 2 in t and 3 in t:\r\n temp = []\r\n\r\n for j in range(1, 4):\r\n temp.append(t.index(j)+1)\r\n t[t.index(j)] = None\r\n\r\n teams.append(temp)\r\n\r\nprint(len(teams))\r\n\r\nfor i in teams:\r\n for j in i:\r\n print(j, end=\" \")\r\n print(end=\"\\n\")", "n = int(input())\r\na = list(map(int,input().split()))\r\np = []\r\nm = []\r\ns = []\r\nfor i in range(n):\r\n if a[i] == 1:\r\n p.append(i+1)\r\n elif a[i] == 2:\r\n m.append(i+1)\r\n else:\r\n s.append(i+1)\r\nb = min(len(p),len(m),len(s))\r\nprint(b)\r\nfor i in range(b):\r\n print(p[i],m[i],s[i])", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogramming_students = []\r\nmaths_students = []\r\npe_students = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming_students.append(i + 1)\r\n elif skills[i] == 2:\r\n maths_students.append(i + 1)\r\n else:\r\n pe_students.append(i + 1)\r\n\r\nmax_teams = min(len(programming_students), len(maths_students), len(pe_students))\r\n\r\nprint(max_teams)\r\n\r\nfor i in range(max_teams):\r\n team = [programming_students[i], maths_students[i], pe_students[i]]\r\n print(*team)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nt1, t2, t3 =[], [], []\r\nfor i in range(n):\r\n if s[i]==1: t1.append(i+1)\r\n if s[i]==2: t2.append(i+1)\r\n if s[i]==3: t3.append(i+1)\r\nk = min(len(t1),len(t2),len(t3))\r\nprint(k)\r\nfor i in range(k):\r\n print(t1[i],t2[i], t3[i])\r\n\r\n", "t=int(input())\r\nlis=list(map(int, input().strip().split()))\r\na=[]\r\nb=[]\r\nc=[]\r\nfor i in range(t):\r\n if lis[i]==1:\r\n a.append(i)\r\n elif lis[i]==2:\r\n b.append(i)\r\n elif lis[i]==3:\r\n c.append(i)\r\n\r\n\r\nn=min(len(a),len(b),len(c))\r\nprint(n)\r\nfor i in range(n):\r\n print(a[i]+1,b[i]+1,c[i]+1)\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\np = []\r\nm = []\r\ns = []\r\nfor i in range(n):\r\n if t[i] == 1:\r\n p.append(i+1)\r\n elif t[i] == 2:\r\n m.append(i+1)\r\n elif t[i] == 3:\r\n s.append(i+1)\r\nmt = min(len(p), len(m), len(s))\r\nprint(mt)\r\nif mt > 0:\r\n for i in range(mt):\r\n print(p[i], m[i], s[i])", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nprog_students = []\r\nmath_students = []\r\nsport_students = []\r\n\r\nfor i in range(n):\r\n if students[i] == 1:\r\n prog_students.append(i + 1)\r\n elif students[i] == 2:\r\n math_students.append(i + 1)\r\n else:\r\n sport_students.append(i + 1)\r\n\r\nmin_size = min(len(prog_students), len(math_students), len(sport_students))\r\n\r\nif min_size == 0:\r\n print(0)\r\nelse:\r\n teams = []\r\n for i in range(min_size):\r\n team = (prog_students[i], math_students[i], sport_students[i])\r\n teams.append(team)\r\n\r\n print(len(teams))\r\n for team in teams:\r\n print(team[0], team[1], team[2])", "number_of_students = int(input())\r\nstudent_skill = input ().split()\r\nstudent_skill = [int(skill) for skill in student_skill]\r\nskill1, skill2, skill3, counter, counter1, counter2, counter3 = 0, 0, 0, 1, [], [], []\r\nfor skill in student_skill:\r\n if skill == 1:\r\n skill1 += 1\r\n counter1.append((counter))\r\n elif skill == 2:\r\n skill2 += 1\r\n counter2.append((counter))\r\n else:\r\n skill3 += 1\r\n counter3.append((counter))\r\n counter += 1 \r\nstudents = [skill1, skill2, skill3]\r\nstudents.sort()\r\nteams = students[0]\r\nprint(teams)\r\nfor i in range(teams):\r\n print(f\"{counter1[i]} {counter2[i]} {counter3[i]}\")", "\"\"\"\r\n ⢰⡖⣶⣆⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣀⡀⠀⠀⠀⠀⠀⠀ ⢀⣀⣰⣶⣶⡆\r\n⠀⠀⠘⠓⠛⡟⢻⣿⣤⣤⠀⠀⣠⣤⣼⣿⣿⣧⣤⣄⠀⠀⣤⣤⣿⣿⣿⠛⠛⠃\r\n⠀⠀⠀⠀⠀⠉⠉⢹⠈⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡏⠉⠉\r\n⠀⠀⠀⣀⣀⡖⢲⣾⣶⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣷⣶⣶⣀⣀\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⡇\r\n⠀⠀⢸⡇⣿⣿⣿⣿⣿⠃⠀⠘⢻⣿⣿⣿⣿⣿⣿⡟⠃⠀⠘⣿⣿⣿⣿⣿⣿⡇\r\n⢰⢲⣾⣷⣿⣿⣿⣿⣿⣆⣀⣰⣾⣿⣿⣿⣿⣿⣿⣷⣆⣀⣰⣿⣿⣿⣿⣿⣿⣷⣶⡆\r\n⢸⢸⣿⠛⠛⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠛⠛⣿⣿⡇\r\n⢸⢸⣿⠀⠀⠉⠉⠹⠿⠿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿⠿⠿⠏⠉⠉⠀⠀⣿⣿⡇\r\n⢸⣸⢿⣀⠀⠀⠀⠀⠀⠀⠛⠛⢻⣿⣿⣿⣿⣿⣿⡟⠛⠛⠀⠀⠀⠀⠀⠀⣀⣿⣿⡇\r\n⠀⢸⢀⣿⣦⣤⡄⠀⠀⠀⠀⠀⠀⠀⠘⠛⠛⠃⠀⠀⠀⠀⠀⠀⠀⢠⣤⣴⣿⣿⡇\r\n⠀⠈⠉⠉⠧⠽⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⠿⠿⠉⠉⠁ ⠀⠀\r\n ⣀⣀⣤⣤⣤⡀\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀ ⣶⣿⣿⣿⣿⣿⠇\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⢀⣸⣿⣿⣿⣿⣿⣿⣿\r\n ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣶⣾⣿⣿⣿⣿⣿⡿⠟\r\n ⠀⠀⠀⠀⠀⠀⠀⠀ ⠀⣀⣾⣿⣿⣿⣿⣿⣿⠋⠁\r\n ⠀⠀⢸⣿⣿⣿⣤⠀⣤⣿⣿⣿⣿⣿⣿⠛\r\n ⠀⠀⠸⢿⣿⣿⣿⣿⣿⣿⣿⣿⢿⠏⠉\r\n ⠀⠀⠀⠸⠿⣿⣿⣿⣿⣿⣿⣏⣤⣀\r\n ⠀⠀⠀⣤⣿⣿⣿⣿⣿⣿⣿⣿⣿⣿\r\n ⢰⣶⣾⣿⣿⣿⡟⠃⠛⠛⢻⡿⠿⠛\r\n ⢸⣿⣿⣿⣿⠏\r\n ⠈⠛⠛⠉⠉\r\n\r\n⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\"\"\"\r\no = int(input())\r\nn = list(map(int, input().split()))\r\ncont1 = 0\r\ncont2 = 0\r\ncont3 = 0\r\nnum1 = [None] * len(n)\r\nnum2 = [None] * len(n)\r\nnum3 = [None] * len(n)\r\nfor i in range(0, o):\r\n if n[i] == 1:\r\n num1[cont1] = i + 1\r\n cont1 += 1\r\n elif n[i] == 2:\r\n num2[cont2] = i + 1\r\n cont2 += 1\r\n elif n[i] == 3:\r\n num3[cont3] = i + 1\r\n cont3 += 1\r\n\r\np = min(cont2, cont3, cont1)\r\nprint(p)\r\nif p > 0:\r\n for i in range(0, int(p)):\r\n print(num1[i], end=\" \")\r\n print(num2[i], end=\" \")\r\n print(num3[i])\r\n", "l=int(input())\r\nm=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nc=[]\r\nfor i in range(l):\r\n\tif m[i] ==1:\r\n\t\ta.append(i+1)\r\n\telif m[i]==2:\r\n\t\tb.append(i+1)\t\r\n\telse:\r\n\t\tc.append(i+1)\t\r\nq=min(len(a),len(b),len(c))\t\r\nprint(q)\r\nif q!=0:\r\n\tfor j in range(q):\r\n\t\tprint(a[j],b[j],c[j])\t", "n= int(input())\r\nl=[int(x) for x in input().split()]\r\na=[i+1 for i in range(n) if l[i]==1]\r\nb=[i+1 for i in range(n) if l[i]==2]\r\nc=[i+1 for i in range(n) if l[i]==3]\r\nm=min(len(a),len(b),len(c))\r\nif m>0:\r\n print(m)\r\n for i in range(m):\r\n print(a[i],b[i],c[i])\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n \r\nprogrammers = []\r\nmathematicians = []\r\nsportsmen = []\r\n \r\nfor i in range(n):\r\n if a[i] == 1:\r\n programmers.append(i + 1)\r\n elif a[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n sportsmen.append(i + 1)\r\n \r\nteams = min(len(programmers), len(mathematicians), len(sportsmen))\r\n \r\nprint(teams)\r\n \r\nfor i in range(teams):\r\n print(programmers[i], mathematicians[i], sportsmen[i])\r\n \r\n ", "def sort_num(el):\r\n return el[0]\r\n\r\nn = int(input())\r\na = [int(el) for el in input().split()]\r\nmas = []\r\nfor i in range(n):\r\n mas.append([a[i], i + 1])\r\n\r\nmas.sort(key=sort_num)\r\nk1 = a.count(1)\r\nk2 = a.count(2)\r\nk3 = a.count(3)\r\nmn = min(k1, k2, k3)\r\nif mn == 0:\r\n print(0)\r\nelse:\r\n print(mn)\r\n for i in range(mn):\r\n print(mas[i][1], mas[i + k1][1], mas[i + k1 + k2][1])\r\n\r\n\r\n", "n = int(input())\r\nstudent = input().split()\r\n\r\nc_1 = student.count(\"1\")\r\nc_2 = student.count(\"2\")\r\nc_3 = student.count(\"3\")\r\nmin = c_1\r\n\r\nfor i in c_1,c_2,c_3 :\r\n if i < min :\r\n min = i\r\n\r\nprint(min)\r\n\r\nwhile min > 0 :\r\n print(student.index(\"1\")+1 , end=\" \" )\r\n student[student.index(\"1\")] = ''\r\n \r\n print(student.index(\"2\")+1 , end=\" \" )\r\n student[student.index(\"2\")] = ''\r\n \r\n print(student.index(\"3\")+1 )\r\n student[student.index(\"3\")] = ''\r\n\r\n min -= 1", "input()\r\ns = list(map(int, input().split()))\r\ni = 0\r\nr = []\r\nwhile 1 in s and 2 in s and 3 in s:\r\n i+=1\r\n a = s.index(1)\r\n b = s.index(2)\r\n c = s.index(3)\r\n r.append((a+1, b+1, c+1))\r\n s[a] += 3\r\n s[b] += 3\r\n s[c] += 3\r\nprint(i)\r\nfor j in r:\r\n print(*(j))", "n = int(input())\r\nstudents = [int(_) for _ in input().split()]\r\nw = min(students.count(1),students.count(2),students.count(3))\r\nprint(w)\r\nfor i in range(w):\r\n prog = students.index(1)\r\n math = students.index(2)\r\n PE = students.index(3)\r\n print( prog+1,math+1, PE +1)\r\n students[prog] =0\r\n students[math] = 0\r\n students[PE] =0\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=[]\r\na2=[]\r\na3=[]\r\nfor i in range(n):\r\n if a[i]==1:\r\n a1.append(i+1)\r\n if a[i]==2:\r\n a2.append(i+1)\r\n if a[i]==3:\r\n a3.append(i+1)\r\nk=min(len(a1),len(a2),len(a3))\r\nprint(k)\r\nfor i in range(k):\r\n print(a1[i],a2[i],a3[i])", "n=input()\r\nx=list(map(int,input().split()))\r\nkl=[]\r\nk2=[]\r\nk3=[]\r\nc=0\r\nfor i in x:\r\n c=c+1\r\n if i==1:\r\n kl.append(c)\r\n elif i==2:\r\n k2.append(c)\r\n\r\n elif i==3:\r\n k3.append(c)\r\npp=min(len(kl),len(k2),len(k3))\r\nprint(pp)\r\nfor i in range(pp):\r\n print(kl[i],k2[i],k3[i])\r\n", "import math\n\nn = int(input())\nstu = [i for i in input().split()]\nt=dict()\nt.setdefault('1',[])\nt.setdefault('2',[])\nt.setdefault('3',[])\nn=[0,0,0]\n\nfor i in range(0,len(stu)):\n t[stu[i]].append(i+1)\n n[int(stu[i])-1]+=1\n\nprint(min(n))\nfor i in range(min(n)):\n print(t['1'][i],t['2'][i],t['3'][i])\n\n\t \t \t \t\t\t \t\t \t\t\t", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd={}\r\nc=[]\r\no=[]\r\ns=[]\r\nt=[]\r\nfor i in a:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]=d[i]+1\r\nfor i in d:\r\n c.append(d[i])\r\nc.sort()\r\nif len(d)>=3:\r\n print(c[0])\r\nelse:\r\n print(\"0\")\r\nfor i in range(0,len(a)):\r\n if a[i]==1:\r\n o.append(i+1)\r\n elif a[i]==2:\r\n s.append(i+1)\r\n else:\r\n t.append(i+1)\r\nif len(d)>=3:\r\n for i in range(0,c[0]):\r\n print(o[i],s[i],t[i])", "n = int(input())\r\nlis = list(map(int,input().split()))\r\nlis_team = []\r\nwhile True:\t\r\n if 1 in lis and 2 in lis and 3 in lis:\r\n team = [str(lis.index(1)+1),str(lis.index(2)+1),str(lis.index(3)+1)]\r\n lis[lis.index(1)] = 4\r\n lis[lis.index(2)] = 4\r\n lis[lis.index(3)] = 4\r\n lis_team.append(team)\r\n else:\r\n print(len(lis_team))\r\n break\r\nfor i in lis_team:\r\n print(' '.join(i))\r\n", "import sys\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\nt = [int(x) - 1 for x in input().split()]\r\n\r\na = [[] for _ in range(3)]\r\nfor i in range(n) :\r\n a[t[i]].append(i)\r\nanswer = min(len(a[0]), len(a[1]), len(a[2]))\r\nprint(answer)\r\nfor i in range(answer) :\r\n print(\" \".join(map(str, [a[0][i] + 1, a[1][i] + 1, a[2][i] + 1])))\r\n", "n = int(input())\r\nstudents = [int(num) for num in input().split()]\r\nstudents_gifts = ([], [], [])\r\n\r\nfor index, gift in enumerate(students, start=1):\r\n students_gifts[gift - 1].append(index)\r\n\r\nnumber_of_teams = min(len(students_gifts[0]), len(students_gifts[1]), len(students_gifts[2]))\r\nprint(number_of_teams)\r\n\r\nfor i in range(number_of_teams):\r\n print(students_gifts[0][i], students_gifts[1][i], students_gifts[2][i])", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nn1 = l.count(1)\r\nn2 = l.count(2)\r\nn3 = l.count(3)\r\n\r\nw = min(n1,n2,n3)\r\nprint(w)\r\nfor i in range(w):\r\n ind_1 = l.index(1)\r\n ind_2 = l.index(2)\r\n ind_3 = l.index(3)\r\n print(ind_1+1, ind_2+1, ind_3+1)\r\n l[ind_1] = 0\r\n l[ind_2] = 0\r\n l[ind_3] = 0", "import sys\r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nt = [int(i) for i in sys.stdin.readline().split()]\r\n\r\nprogramming_count = t.count(1)\r\nmath_count = t.count(2)\r\nphysical_culture_count = t.count(3)\r\n\r\nw = min(programming_count,math_count,physical_culture_count)\r\nprint(w)\r\n\r\ni = 0\r\nwhile i<w:\r\n print(\"%d %d %d\" % (t.index(1)+1, t.index(2)+1, t.index(3)+1))\r\n t[t.index(1)]=0\r\n t[t.index(2)]=0\r\n t[t.index(3)]=0\r\n i+=1", "n = int(input())\r\nchildren = list(map(int, input().split()))\r\n\r\nprogrammers = [i + 1 for i, t in enumerate(children) if t == 1]\r\nmaths = [i + 1 for i, t in enumerate(children) if t == 2]\r\npe = [i + 1 for i, t in enumerate(children) if t == 3]\r\n\r\nmin_team_size = min(len(programmers), len(maths), len(pe))\r\n\r\nif min_team_size == 0:\r\n print(0)\r\nelse:\r\n print(min_team_size)\r\n for i in range(min_team_size):\r\n print(programmers[i], maths[i], pe[i])", "def find_tms(p,ski):\r\n tms=[]\r\n progs=[(i,t) for i,t in enumerate(ski) if t==1]\r\n maths=[(i,t) for i,t in enumerate(ski) if t==2]\r\n sports=[(i,t) for i,t in enumerate(ski) if t==3]\r\n max_tms=min(len(progs),len(maths),len(sports))\r\n for i in range(max_tms):\r\n tm=(progs[i][0],maths[i][0],sports[i][0])\r\n tms.append(tm)\r\n return max_tms,tms\r\np=int(input())\r\nski=list(map(int,input().split()))\r\nmax_tms,tms=find_tms(p,ski)\r\nprint(max_tms)\r\nfor tm in tms:\r\n print(tm[0]+1,tm[1]+1,tm[2]+1)\r\n", "import sys\r\n\r\nn = int(input())\r\n\r\nstudents = list(map(int, input().split()))\r\n'''\r\ncategorize = {}\r\n\r\nfor x in students:\r\n if x == 1:\r\n if x in categorize:\r\n categorize[1] += 1\r\n else:\r\n categorize[1] = 1\r\n\r\n elif x == 2:\r\n if x in categorize:\r\n categorize[2] += 1\r\n else:\r\n categorize[2] = 1\r\n\r\n else:\r\n if x in categorize:\r\n categorize[3] += 1\r\n else:\r\n categorize[3] = 1\r\n'''\r\nprogramming = [idx for idx, val in enumerate(students) if val == 1]\r\nmath = [idx for idx, val in enumerate(students) if val == 2]\r\npe = [idx for idx, val in enumerate(students) if val == 3]\r\n\r\nif programming and math and pe:\r\n m = min(len(programming), len(math), len(pe))\r\n print(m)\r\n\r\n\r\n for i in range(m):\r\n print(programming[i] + 1, end=' ')\r\n print(math[i]+ 1, end=' ')\r\n print(pe[i]+ 1)\r\n\r\n \r\nelse:\r\n print(0)\r\n", "x = int(input())\r\ny = input()\r\narray1 = []\r\narray2 = []\r\narray3 = []\r\none = 0\r\ntwo = 0\r\nthree = 0\r\ncount = 1\r\nfor c in range(0, len(y), 1):\r\n if y[c] == \"1\":\r\n one += 1\r\n array1.append(count)\r\n count += 1\r\n if y[c] == \"2\":\r\n two += 1\r\n array2.append(count)\r\n count += 1\r\n if y[c] == \"3\":\r\n three += 1\r\n array3.append(count)\r\n count += 1\r\nif one <= two and one <= three:\r\n min = one\r\n print(min)\r\nelse:\r\n if two <= one and two <= three:\r\n min = two\r\n print(min)\r\n else:\r\n min = three\r\n print(min)\r\nfor c in range(0, min, 1):\r\n print(str(array1[c]) + \" \" + str(array2[c]) + \" \" + str(array3[c]))", "\"\"\"\r\n@auther:Abdallah_Gaber \r\n\"\"\"\r\n\r\nn = int(input())\r\nskills = [int(x) for x in input().split()]\r\nindexes_1 = []\r\nindexes_2 = []\r\nindexes_3 = []\r\n\r\nfor i in range(len(skills)):\r\n if skills[i] == 1:\r\n indexes_1.append(i)\r\n elif skills[i] == 2:\r\n indexes_2.append(i)\r\n else:\r\n indexes_3.append(i)\r\n\r\nn1 = len(indexes_1)\r\nn2 = len(indexes_2)\r\nn3 = len(indexes_3)\r\n\r\nif n1 == 0 or n2 == 0 or n3 == 0:\r\n print(0)\r\nelse:\r\n num_of_teams = min(n1,n2,n3)\r\n print(num_of_teams)\r\n for i in range(num_of_teams):\r\n print(indexes_1[i]+1,end=\" \")\r\n print(indexes_2[i]+1,end=\" \")\r\n print(indexes_3[i]+1)\r\n", "input();a=[[],[],[]]\r\nfor i,x in enumerate(input().split(),1):a[int(x)-1]+=[i]\r\nprint(min(map(len,a)))\r\nfor x in zip(*a):print(*x)", "n = int(input())\r\narr = list(map(int, input().split()))\r\na, b, c = [], [], []\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] == 1:\r\n a.append(i + 1)\r\n elif arr[i] == 2:\r\n b.append(i + 1)\r\n else:\r\n c.append(i + 1)\r\n\r\nres = []\r\nwhile len(a) > 0 and len(b) > 0 and len(c) > 0:\r\n res.append(' '.join([str(a.pop(0)), str(b.pop(0)), str(c.pop(0))]))\r\n\r\nprint(len(res))\r\nfor i in res:\r\n print(i)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nn=min(a.count(1),a.count(2),a.count(3))\r\nprint(n)\r\nfor i in range(n):\r\n x,y,z=a.index(1),a.index(2),a.index(3)\r\n print(x+1,y+1,z+1)\r\n a[x],a[y],a[z]=0,0,0", "n = int (input ())\r\narray = tuple (map (int, input ().split (' ')))\r\nprog, math, pe = [], [], []\r\nfor i, unit in enumerate (array):\r\n if unit == 1:\r\n prog.append (i + 1)\r\n elif unit == 2:\r\n math.append (i + 1)\r\n else:\r\n pe.append (i + 1)\r\nteams = min (len (prog), len (math), len (pe))\r\nprint (teams)\r\nfor i in range (teams):\r\n print (prog [i], math [i], pe [i])", "n = int(input())\nm = [int(x) - 1 for x in input().split()]\ns = [[], [], []]\nfor i, v in enumerate(m):\n s[v].append(i+1)\nprint(min(map(len, s)))\nfor x in zip(*s):\n print(*x)\n\n\t \t \t\t \t\t \t \t\t\t \t \t\t\t", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl1 = [l.count(1),l.count(2),l.count(3)]\r\nprint(min(l1))\r\nl01 = []\r\nl02 = []\r\nl03 = []\r\n\r\nfor i in range (len(l)):\r\n if l[i] == 1:\r\n l01.append(i)\r\n elif l[i] == 2:\r\n l02.append(i)\r\n elif l[i] == 3:\r\n l03.append(i)\r\n\r\nfor j in range (min(l1)):\r\n s = \"\"\r\n s += str(l01[j]+1)\r\n s += \" \"\r\n s += str(l02[j]+1)\r\n s += \" \"\r\n s += str(l03[j]+1)\r\n print (s)\r\n", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\npro = []\r\nmath = []\r\nph = []\r\nfor i in range(n) :\r\n if x[i] == 1 :\r\n pro.append(i+1)\r\n elif x[i] == 2 :\r\n math.append(i+1)\r\n elif x[i] == 3 :\r\n ph.append(i+1)\r\n#print(pro)\r\n#print(math)\r\n#print(ph)\r\n\r\nm = min(len(pro),len(math),len(ph))\r\nprint(m)\r\n\r\nt = []\r\n\r\n\r\nfor k in range(m):\r\n y = [pro[k], math[k], ph[k]]\r\n t.append(y)\r\n#print(t)\r\n\r\nfor j in t :\r\n print(*j)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=[]\r\nm1=[]\r\nm2=[]\r\nfor i in range(n):\r\n if a[i]==1:\r\n m.append(i+1)\r\n elif a[i]==2:\r\n m1.append(i+1)\r\n else:\r\n m2.append(i+1)\r\np=min(len(m),len(m1),len(m2))\r\nprint(p)\r\nfor i in range(p):\r\n print(m[i],m1[i],m2[i])", "n = int(input())\r\ns1 = []\r\ns2 = []\r\ns3 = []\r\nk = input().split()\r\nfor i in range(n):\r\n if k[i] == \"1\":\r\n s1.append(i + 1)\r\n elif k[i] == \"2\":\r\n s2.append(i + 1)\r\n else:\r\n s3.append(i + 1)\r\nmin_len = min(len(s1), len(s2), len(s3))\r\nprint(min_len)\r\nfor i in range(min_len):\r\n print(s1[i], s2[i], s3[i])\r\n\r\n", "import numbers\r\n\r\n\r\ndef is_prime(n):\r\n return all(n%i != 0 for i in range(2, n))\r\nint_array = lambda : [int(i) for i in input().split(\" \")]\r\nstring_array = lambda : list(input().split(\" \"))\r\nread_int = lambda:int(input())\r\nread_string = lambda:input()\r\nn = read_int()\r\narr = int_array()\r\nteams = []\r\nobjective = 1\r\nteam = []\r\nwhile 1:\r\n if objective not in arr:\r\n break\r\n team.append(arr.index(objective)+1)\r\n arr[(team[-1]-1)] = -1\r\n objective+=1\r\n if objective > 3:\r\n objective = 1\r\n teams.append(team)\r\n team = []\r\nprint(len(teams))\r\nfor team in teams:\r\n print(*team)\r\n \r\n \r\n \r\n \r\n \r\n ", "t = int(input())\r\ns = [int(i) for i in input().split()]\r\nt1, t2, t3 = s.count(1), s.count(2), s.count(3)\r\nprint(min(t1, t2, t3))\r\nif min(t1, t2, t3) != 0:\r\n for i in range(min(t1, t2, t3)):\r\n ans1 = s.index(1)\r\n ans2 = s.index(2)\r\n ans3 = s.index(3)\r\n s[ans1] = 5\r\n s[ans2] = 5\r\n s[ans3] = 5\r\n print(ans1+1, ans2+1, ans3+1)", "n = int(input())\ntalents = [[], [], []]\nfor i, t in enumerate(map(int, input().split())):\n talents[t - 1].append(i + 1)\nteams = []\nprogramming, maths, pe = talents\nwhile True:\n if not programming or not maths or not pe:\n break\n teams.append([programming.pop(), maths.pop(), pe.pop()])\nprint(len(teams))\nfor team in teams:\n print(*team)\n", "#n = int(input())\r\n#t = input().split()\r\n#t = [int(x) for x in t]\r\n\r\n#a = []\r\n#b = []\r\n#c = []\r\n\r\n#for i in t:\r\n# if t[i] == 1:\r\n# a.append(i)\r\n# elif t[i] == 2:\r\n# b.append(i)\r\n# else:\r\n# c.append(i)\r\n\r\n#mega_masive = len(a) + len(b) + len(c)\r\n\r\n#minim = min(mega_masive)\r\n\r\n#print(minim)\r\n\r\n#for i in range(minim):\r\n# print(a[i], b[i], c[i])\r\n\r\na = int(input());b = list(map(int,input().split()))\r\nx = b.count(1);y = b.count(2); z = b.count(3)\r\nprint(min(x,y,z))\r\nl = [];m = [];n = []\r\nfor i in range(a):\r\n if b[i] == 1:\r\n l.append(i+1)\r\n if b[i] == 2:\r\n m.append(i+1)\r\n if b[i] == 3:\r\n n.append(i+1)\r\no = (min(len(l),len(m),len(n)))\r\nfor j in range(o):\r\n print(l[j],m[j],n[j])", "n = int(input())\nt = [int(x) for x in input().split()]\nprogramming = []\nmaths = []\npe = []\nfor i in range(len(t)):\n if t[i] == 1:\n programming.append(i + 1)\n elif t[i] == 2:\n maths.append(i + 1)\n elif t[i] == 3:\n pe.append(i + 1)\n\nnoOfTeam = min(len(programming), len(maths), len(pe))\nprint(noOfTeam)\nfor i in range(noOfTeam):\n print(programming[i], maths[i], pe[i])\n\n\t \t\t\t\t\t\t\t\t \t \t \t\t \t\t\t \t\t \t\t\t", "# Problem: \r\n# Answer: \r\n\r\n# *\r\n\r\n# Need teams of 3.\r\n# Each member must be different.\r\n# Types of members include 1, 2, and 3.\r\n\r\n# To solve, we can count the number of unique children.\r\n# Then, based on the count, divide // by 3 to get the answer.\r\n\r\n# To find the index values we can search for them using .index()\r\n# Then we can assign that index to a team and then overwrite the index\r\n# on the list of children\r\n\r\n# *\r\n\r\nnumberOfChildren = int(input())\r\n\r\nchildren = [int(i) for i in input().split()]\r\n\r\nteamCounter = 0\r\n\r\nchildrenCopy = children.copy()\r\n\r\ntry:\r\n\r\n person1 = childrenCopy.count(1)\r\n person2 = childrenCopy.count(2)\r\n person3 = childrenCopy.count(3)\r\n \r\n memberList = [person1, person2, person3]\r\n memberList.sort()\r\n \r\nexcept:\r\n\r\n print(0)\r\n quit()\r\n\r\n\r\n\r\nteamCounter = 0\r\nn = 0\r\ngoAhead = True\r\nwhile(goAhead):\r\n n += 1\r\n\r\n firstMember = False\r\n secondMember = False\r\n thirdMember = False\r\n \r\n try:\r\n if memberList[0] > 0:\r\n memberList[0] -= 1\r\n firstMember = True\r\n #print(\"1\")\r\n else:\r\n goAhead = False\r\n \r\n if memberList[1] > 0:\r\n memberList[1] -= 1\r\n secondMember = True\r\n #print(\"2\")\r\n else:\r\n goAhead = False\r\n \r\n if memberList[2] > 0:\r\n memberList[2] -= 1\r\n thirdMember = True\r\n #print(\"3\")\r\n else:\r\n goAhead = False\r\n \r\n if firstMember == True and secondMember == True and thirdMember == True:\r\n teamCounter += 1\r\n except:\r\n goAhead = False\r\n\r\nprint(teamCounter)\r\n\r\n\r\ngoAhead = True\r\nwhile(goAhead):\r\n\r\n\r\n person1 = False\r\n person2 = False\r\n person3 = False\r\n \r\n try:\r\n \r\n if children.index(1) > -1:\r\n person1 = True\r\n \r\n if children.index(2) > -1:\r\n person2 = True\r\n \r\n if children.index(3) > -1:\r\n person3 = True\r\n \r\n if person3 == True and person2 == True and person1 == True:\r\n \r\n \r\n print(children.index(1)+1, children.index(2)+1, children.index(3)+1)\r\n \r\n children[children.index(1)] = \"O\"\r\n children[children.index(2)] = \"O\"\r\n children[children.index(3)] = \"O\"\r\n \r\n except:\r\n goAhead = False\r\n \r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\n# Создаем три списка для каждой категории учащихся\r\nprogrammers = []\r\nmathematicians = []\r\nathletes = []\r\n\r\nfor i in range(n):\r\n if t[i] == 1:\r\n programmers.append(i + 1)\r\n elif t[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n athletes.append(i + 1)\r\n\r\n# Находим минимум среди размеров списков категорий\r\nmin_size = min(len(programmers), len(mathematicians), len(athletes))\r\n\r\nif min_size == 0:\r\n print(0)\r\nelse:\r\n print(min_size)\r\n for i in range(min_size):\r\n print(programmers[i], mathematicians[i], athletes[i])\r\n", "student={1:0,2:0,3:0}\r\ninput()\r\na_list=[int(i) for i in input().split()]\r\nfor i in a_list:\r\n if i in student:\r\n student[i]+=1\r\nminimum=100000000000000000\r\nfor key,value in student.items():\r\n if value<minimum:\r\n minimum=value\r\nprint(minimum)\r\nif minimum!=0:\r\n def team(array):\r\n one=array.index(1)\r\n array[one]=0\r\n two=array.index(2)\r\n array[two]=0\r\n three=array.index(3)\r\n array[three]=0\r\n print(one+1,two+1,three+1)\r\n return array\r\n for i in range(minimum):\r\n a_list=team(a_list)", "from sys import stdin, stdout\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, deque\r\nfrom queue import Queue\r\nimport heapq\r\nimport math\r\nfrom itertools import permutations, combinations, islice\r\n\r\nn = int(stdin.readline())\r\na = [*map(int, stdin.readline().strip().split())]\r\n\r\none = [index for index, value in enumerate(a) if value == 1]\r\ntwo = [index for index, value in enumerate(a) if value == 2]\r\nthree = [index for index, value in enumerate(a) if value == 3] \r\n\r\nteam = min(len(one),len(two),len(three))\r\n\r\nstdout.write(f\"{team}\\n\")\r\nfor i in range(team):\r\n stdout.write(f'{one[-1] + 1} {two[-1] + 1} {three[-1] + 1}\\n') \r\n one.pop(); two.pop(); three.pop()\r\n", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\nasd = t.count(1)\r\nsdf = t.count(2)\r\ndfg = t.count(3)\r\nw = min(asd,sdf,dfg)\r\nprint(w)\r\ni = 0\r\nwhile i < w:\r\n print(\"%d %d %d\" % (t.index(1) + 1, t.index(2) + 1, t.index(3) + 1))\r\n t[t.index(1)] = 0\r\n t[t.index(2)] = 0\r\n t[t.index(3)] = 0\r\n i += 1\r\n", "import math \r\ndef olympiad(s):\r\n alist=[int(d) for d in s.split()]\r\n return min(alist.count(1),alist.count(2),alist.count(3))\r\ndef olympiadd(s):\r\n alist=[int(d) for d in s.split()]\r\n f=min(alist.count(1),alist.count(2),alist.count(3))\r\n blist=[]\r\n clist=[]\r\n dlist=[]\r\n for i in range(len(alist)):\r\n if alist[i]==1:\r\n blist.append(i+1)\r\n elif alist[i]==2:\r\n clist.append(i+1)\r\n else:\r\n dlist.append(i+1)\r\n flist=[]\r\n for i in range(f):\r\n flist.append([blist[i],clist[i],dlist[i]])\r\n return flist\r\nt=int(input())\r\nf=input()\r\nif olympiad(f)==0:\r\n print(olympiad(f))\r\nelse:\r\n print(olympiad(f))\r\n x=olympiadd(f)\r\n for y in x:\r\n for j in y:\r\n print(j,end=\" \")\r\n print()", "n = int(input())\r\nt = input()\r\nt = t.split(\" \")\r\n\r\nfor i in range(len(t)):\r\n t[i] = int(t[i])\r\n\r\nc_1,c_2,c_3 = 0,0,0\r\n\r\nfor j in range(len(t)):\r\n if t[j] == 1:\r\n c_1 += 1\r\n elif t[j] == 2:\r\n c_2 += 1\r\n else:\r\n c_3 += 1\r\n\r\nmin = 0\r\nif c_1 < c_2 and c_1 < c_3:\r\n min = c_1\r\nelif c_2 < c_3:\r\n min = c_2\r\nelse:\r\n min = c_3\r\n\r\nprint(min) \r\n\r\nif c_1 != 0 and c_2 != 0 and c_3 != 0:\r\n a,b,c = [],[],[]\r\n for k in range(len(t)):\r\n if t[k] == 1:\r\n a.append(k + 1)\r\n elif t[k] == 2:\r\n b.append(k + 1)\r\n else:\r\n c.append(k + 1) \r\n\r\nfor l in range(min):\r\n print(a[l],b[l],c[l])", "s=int(input())\r\nt=list(map(int,input().split()))\r\nr=min(t.count(1),t.count(2),t.count(3))\r\nprint(r)\r\nfor i in range(r):\r\n\tprint(t.index(1)+1,t.index(2)+1,t.index(3)+1)\r\n\tt[t.index(1)]=0\r\n\tt[t.index(2)]=0\r\n\tt[t.index(3)]=0", "n = int(input())\ntalents = input().split()\nprogramming = [] #1\nmath = [] #2\nPE = [] #3\ncounter = 0\nfor n in range(1,n + 1):\n if talents[n - 1] == '1':\n programming.append(n)\n if talents[n - 1] == '2':\n math.append(n)\n if talents[n - 1] == '3':\n PE.append(n)\nif len(programming) == 0 or len(math) == 0 or len(PE) == 0:\n print(0)\nelse:\n little_group = min(len(programming), len(math), len(PE))\n print(little_group)\n for l in range(little_group):\n print(f\"{programming[l]} {math[l]} {PE[l]}\")\n \t \t \t\t \t \t \t\t\t \t\t\t\t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 24 05:00:13 2023\r\n\r\n@author: RadmediX\r\n\"\"\"\r\n\r\nn = int(input())\r\nchildren = list(map(int,input().split()))\r\npr =[]\r\nm = []\r\npe = []\r\nfor i in range(len(children)):\r\n if children[i] == 1:\r\n pr.append(i)\r\n elif children[i] == 2:\r\n m.append(i)\r\n else:\r\n pe.append(i)\r\n \r\nminum = min(len(pr), len(m), len(pe))\r\nprint(minum)\r\n\r\nif(minum):\r\n for i in range(minum):\r\n print(f'{pr[i]+1} {m[i]+1} {pe[i]+1}')\r\n \r\n", "a=int(input())\r\nm_1=[]\r\nm_2=[]\r\nm_3=[]\r\n\r\nb=input().split()\r\nfor i in range(len(b)):\r\n if b[i]=='1':\r\n m_1.append(i+1)\r\n\r\n elif b[i]=='2':\r\n m_2.append(i+1)\r\n\r\n else: \r\n m_3.append(i+1)\r\n\r\nc=min(len(m_1),len(m_2),len(m_3))\r\nprint(c)\r\n\r\nfor i in range(c):\r\n print(m_1[i],m_2[i],m_3[i])\r\n\r\n", "n=int(input())\r\nx=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nc=[]\r\nfor i in range(n):\r\n if(x[i] == 1):\r\n a.append(i)\r\n elif(x[i] == 2):\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nm=min(len(a),len(b),len(c))\r\nprint(m)\r\nfor i in range(m):\r\n print(a[i]+1,b[i]+1,c[i]+1)", "def main():\r\n n = int(input())\r\n\r\n programming, math, sports = [], [], []\r\n\r\n subjects = list(map(int, input().split()))\r\n\r\n for i in range(n):\r\n subject = subjects[i]\r\n if subject == 1:\r\n programming.append(i + 1)\r\n elif subject == 2:\r\n math.append(i + 1)\r\n else:\r\n sports.append(i + 1)\r\n\r\n teams = min(len(programming), len(math), len(sports))\r\n\r\n print(teams)\r\n\r\n for i in range(teams):\r\n print(programming[i], math[i], sports[i])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\n# Initialize lists to store students of each subject.\r\nprogrammers = []\r\nmathematicians = []\r\nathletes = []\r\n\r\n# Separate students by their subjects.\r\nfor i in range(n):\r\n if students[i] == 1:\r\n programmers.append(i + 1)\r\n elif students[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n athletes.append(i + 1)\r\n\r\n# Calculate the maximum number of teams that can be formed.\r\nmax_teams = min(len(programmers), len(mathematicians), len(athletes))\r\n\r\n# Form teams and print the result.\r\nif max_teams == 0:\r\n print(0)\r\nelse:\r\n print(max_teams)\r\n for i in range(max_teams):\r\n team = [programmers[i], mathematicians[i], athletes[i]]\r\n print(*team)\r\n", "n = int(input())\r\nchlidren = list(map(int, input().split()))\r\nteams = 0\r\nones = []\r\ntwos = []\r\nthrees = []\r\nfor i in range(1,n+1):\r\n if chlidren[i-1] == 1:\r\n ones.append(i)\r\n elif chlidren[i-1] == 2:\r\n twos.append(i)\r\n else:\r\n threes.append(i)\r\n \r\nteams += min(len(ones), len(twos), len(threes))\r\nprint(teams)\r\nfor i in range(teams):\r\n print(ones[i], twos[i], threes[i])\r\n", "a = list(map(int , input().split()))\r\nb = list(map(int , input().split()))\r\npro = []\r\nmath = []\r\npe = []\r\nfor i in range(a[0]):\r\n if b[i] == 1:\r\n pro.append(i)\r\n elif b[i] == 2:\r\n math.append(i)\r\n elif b[i] == 3:\r\n pe.append(i)\r\nprint(min(len(pro) , len(math) , len(pe)))\r\nfor i in range(min(len(pro) , len(math) , len(pe))):\r\n print(pro[i] + 1 , math[i] + 1 , pe[i] + 1)", "n = int(input())\r\na = input().split()\r\nmath,prog,phys = 0,0,0\r\nmath_arr, prog_arr, phys_arr = [], [], []\r\nfor i in range(n):\r\n b = int(a[i])\r\n if b == 1:\r\n prog+=1\r\n prog_arr.append(i+1)\r\n elif b == 2:\r\n math+=1\r\n math_arr.append(i+1)\r\n else:\r\n phys+=1\r\n phys_arr.append(i+1)\r\nw = min(prog,math,phys)\r\nprint(w)\r\nfor i in range(w):\r\n print(prog_arr[i], math_arr[i], phys_arr[i])", "n=int(input())\r\nb=input()\r\nb=b.split()\r\na=[]\r\nfor i in range(n):\r\n a.append(int(b[i]))\r\nk=0\r\narr=[]\r\nm=0\r\nwhile len(a)>0 and k==0:\r\n f=0\r\n s=0\r\n t=0\r\n for i in range(n):\r\n if a[i]==1:\r\n f=i+1\r\n break\r\n for i in range(n):\r\n if a[i]==2:\r\n s=i+1\r\n break\r\n for i in range(n):\r\n if a[i]==3:\r\n t=i+1\r\n break\r\n if f==0 or s==0 or t==0:\r\n k+=1\r\n else:\r\n m+=1\r\n d=str(f)+' '+str(s)+' '+str(t)\r\n arr.append(d)\r\n a[f-1]=0\r\n a[s-1]=0\r\n a[t-1]=0\r\nif m==0:\r\n print(0)\r\nelse:\r\n print(m)\r\n for i in range(m):\r\n print(arr[i])", "n=int(input())\r\n\r\nt_list=list(map(int,input().split()))\r\n\r\ni=j=k=0\r\ncount=0\r\nteams=[]\r\nwhile i<n and j<n and k<n:\r\n while i<n:\r\n if t_list[i]==1:\r\n break\r\n i+=1\r\n while j<n:\r\n if t_list[j]==2:\r\n break\r\n j+=1 \r\n while k<n:\r\n if t_list[k]==3:\r\n break\r\n k+=1\r\n \r\n if i<n and j<n and k<n:\r\n count+=1 \r\n teams.extend([i+1,j+1,k+1])\r\n i+=1 \r\n j+=1 \r\n k+=1 \r\n\r\nprint(count)\r\n\r\nfor i in range(0,len(teams),3):\r\n print(teams[i],teams[i+1],teams[i+2])\r\n\r\n \r\n", "n = int(input())\r\nli = list(map(int, input().split()))\r\nli2 = [[],[],[]]\r\nfor i, j in enumerate(li, 1):\r\n li2[int(j)-1] += [i]\r\nprint(min(map(len, li2)))\r\nfor k in list(zip(*li2)):\r\n print(*k)\r\n", "num = int(input())\r\nstudents = list(map(int,input().split()))\r\nlst1 = []\r\nlst2 = []\r\nlst3 = []\r\n\r\n\r\nfor i in range(num):\r\n if students[i] == 1 :\r\n lst1.append(i+1)\r\n elif students[i] == 2 :\r\n lst2.append(i+1)\r\n elif students[i] == 3 :\r\n lst3.append(i+1)\r\nprint(min(len(lst1),len(lst2),len(lst3)))\r\nfor i in range(min(len(lst1),len(lst2),len(lst3))):\r\n print(lst1[i], lst2[i], lst3[i]) \r\n ", "#Team Olympiad\r\n\r\n#n Value\r\n\r\nn = int(input())\r\n\r\nc_skills = [int(x) for x in input().split()]\r\n\r\n#print(c_skills)\r\n\r\nPro_list = []\r\nMaths_list = []\r\nsports_list = []\r\n\r\nfor num in range(len(c_skills)):\r\n\r\n\tif(c_skills[num] == 1):\r\n\t\tPro_list.append(num+1)\r\n\telif(c_skills[num] == 2):\r\n\t\tMaths_list.append(num+1)\r\n\telif(c_skills[num] == 3):\r\n\t\tsports_list.append(num+1)\r\n\r\npro_len = len(Pro_list)\r\nMaths_len = len(Maths_list)\r\nsports_len = len(sports_list)\r\n\r\nmin_value = min(pro_len,Maths_len,sports_len)\r\n\r\nif(min_value == 0):\r\n\tprint(min_value)\r\nelse:\r\n\tprint(min_value)\r\n\tfor value in range(min_value):\r\n\t\tprint(Pro_list[value],Maths_list[value],sports_list[value])\r\n\r\n\r\n#Done...\r\n\r\n", "\"\"\"\nA. Team Olympiad: greedy, implementation, sortings\n\ntime limit per test: 1 second\nmemory limit per test: 256 megabytes\ninput: standard input\noutput: standard output\n\nThe School №0 of the capital of Berland has n children studying in it.\nAll the children in this school are gifted: some of them are good at programming, some are good at maths, others are good at PE (Physical Education). Hence, for each child we know value ti:\nti = 1, if the i-th child is good at programming,\nti = 2, if the i-th child is good at maths,\nti = 3, if the i-th child is good at PE\nEach child happens to be good at exactly one of these three subjects.\nThe Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects.\nThat is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\nWhat is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?\n\nInput\nThe first line contains integer n (1 ≤ n ≤ 5000) — the number of children in the school.\nThe second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 3), where ti describes the skill of the i-th child.\n\nOutput\nIn the first line output integer w — the largest possible number of teams.\nThen print w lines, containing three numbers in each line. Each triple represents the indexes of the children forming the team.\nYou can print both the teams, and the numbers in the triplets in any order.\nThe children are numbered from 1 to n in the order of their appearance in the input. Each child must participate in no more than one team.\nIf there are several solutions, print any of them.\nIf no teams can be compiled, print the only line with value w equal to 0.\n\"\"\"\n\ndef team_olympiad():\n n = int(input())\n t = list(map(int, input().split(' ')))\n l1 = []\n l2 = []\n l3 = []\n for i in range(n):\n if t[i] == 1:\n l1.append(i)\n elif t[i] == 2:\n l2.append(i)\n else:\n l3.append(i)\n # print(l1, l2, l3)\n\n a = min(t.count(1), t.count(2), t.count(3))\n print(a)\n for i in range(a):\n print(l1[i] + 1, l2[i] + 1, l3[i] + 1)\n\nif __name__ == '__main__':\n team_olympiad()", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nif mas.count(1) == 0 or mas.count(2) == 0 or mas.count(3) == 0:\r\n print(0)\r\nelse:\r\n c = min(mas.count(1), mas.count(2), mas.count(3))\r\n print(min(mas.count(1), mas.count(2), mas.count(3)))\r\n for i in range(c):\r\n print(mas.index(1) + 1, mas.index(2) + 1, mas.index(3) + 1)\r\n mas[mas.index(1)] = 0\r\n mas[mas.index(2)] = 0\r\n mas[mas.index(3)] = 0", "n = int(input())\r\n\r\nt = list(map(int, input().split()))\r\n\r\nm =[]\r\npr = []\r\npe = []\r\nfor i in range(n):\r\n if t[i] == 1:\r\n pr.append(i+1)\r\n elif t[i] == 2:\r\n m.append(i+1)\r\n else:\r\n pe.append(i+1)\r\n\r\nw = min(len(pr), min(len(m), len(pe)))\r\n\r\n\r\nif w == 0:\r\n print(\"0\")\r\nelse:\r\n print(w)\r\n for i in range(w):\r\n st = str(pr[i]) + \" \" + str(m[i]) + \" \" + str(pe[i])\r\n print(st) \r\n", "input();a=[[],[],[]]\r\nfor j,y in enumerate( input().split(),1):a[int(y)-1]+=[j]\r\nprint( min(map(len,a)))\r\nfor y in zip( *a):print(*y)", "n =int(input())\narr = [int(i) for i in input().split()]\n\nmath =[]\nprograming =[]\npe =[]\n\nfor i in range(n):\n if arr[i] == 1:\n programing.append(i+1)\n elif arr[i] == 2:\n math.append(i+1)\n else:\n pe.append(i+1)\n\nmx = min(len(math),len(programing),len(pe))\nprint(mx)\n\nfor i in range(mx):\n print(programing[i],math[i],pe[i])\n \t\t\t\t \t \t \t \t\t \t", "\r\nn=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nd={1:[],2:[],3:[]}\r\nfor i in range(len(lst)):\r\n d[lst[i]].append(i+1)\r\nlsts=[len(d[1]),len(d[2]),len(d[3])]\r\nmi=min(lsts)\r\nprint(mi)\r\nfor i in range(mi):\r\n print(d[1][i],d[2][i],d[3][i])", "def form_teams(n, skills):\r\n programmers = []\r\n mathematicians = []\r\n sportsmen = []\r\n\r\n # Categorize the children based on their skills\r\n for i in range(n):\r\n if skills[i] == 1:\r\n programmers.append(i + 1)\r\n elif skills[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n sportsmen.append(i + 1)\r\n\r\n # Form teams using the categories\r\n teams = []\r\n team_count = min(len(programmers), len(mathematicians), len(sportsmen))\r\n for i in range(team_count):\r\n team = [programmers[i], mathematicians[i], sportsmen[i]]\r\n teams.append(team)\r\n\r\n return teams\r\n\r\n# Read input\r\nn = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\n# Form teams\r\nteams = form_teams(n, skills)\r\n\r\n# Print the number of teams and the team composition\r\nprint(len(teams))\r\nfor team in teams:\r\n print(*team)\r\n", "count_stud = int(input())\r\nstudents = list(map(int, input().split()))\r\nprogrammers = []\r\nmathematics = []\r\nsportsmen = []\r\nfor i in range(count_stud):\r\n if students[i] == 1:\r\n programmers.append(i + 1)\r\n elif students[i] == 2:\r\n mathematics.append(i + 1)\r\n else:\r\n sportsmen.append(i + 1)\r\nfull_commands = min(len(programmers), len(mathematics), len(sportsmen))\r\nprint(full_commands)\r\nfor i in range(full_commands):\r\n print(programmers[i], mathematics[i], sportsmen[i])", "y = int(input())\r\nx = list(map(int, input().split()))\r\nz_1 = x.count(1)\r\nz_2 = x.count(2)\r\nz_3 = x.count(3)\r\nmini = min(z_1,z_2,z_3)\r\ni_1 = [str(i+1) for i in range(len(x)) if x[i] == 1]\r\ni_2 = [str(i+1) for i in range(len(x)) if x[i] == 2]\r\ni_3 = [str(i+1) for i in range(len(x)) if x[i] == 3]\r\nprint(mini)\r\nif mini > 0:\r\n for i in range(mini):\r\n t = [i_1[i],i_2[i],i_3[i]]\r\n print(' '.join(t))", "n=int(input())\r\nl=[]\r\nR,R1,R2,R3=[],[],[],[]\r\nx = map(int, input().split())\r\nl += x\r\nr1=l.count(1)\r\nr2=l.count(2)\r\nr3=l.count(3)\r\nr=min(r1,r2,r3)\r\nprint(r)\r\nfor i in range(n):\r\n if l[i]==1 :\r\n R1+=[i]\r\n elif l[i]==2 :\r\n R2+=[i] #new line else re case 3\r\n else:\r\n R3+=[i]\r\nfor j in range(r):\r\n print(R1[j]+1,R2[j]+1,R3[j]+1)\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\ns1=[]\r\ns2=[]\r\ns3=[]\r\nfor i in range(n):\r\n if t[i]==1:\r\n s1.append(i)\r\n elif t[i]==2:\r\n s2.append(i)\r\n else:\r\n s3.append(i)\r\nprint(min(len(s1),len(s2),len(s3)))\r\nk=0\r\nfor j in range(min(len(s1),len(s2),len(s3))):\r\n print(s1[k]+1,s2[k]+1,s3[k]+1)\r\n k+=1", "# https://codeforces.com/problemset/problem/490/A\r\n\r\nfrom collections import Counter\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n s = {i: [] for i in range(1, 4)}\r\n a = map(int, input().split(' '))\r\n for index, i in enumerate(a):\r\n s[i].append(index+1)\r\n result = min(len(s[1]), len(s[2]), len(s[3]))\r\n print(result)\r\n for i in range(result):\r\n print(s[1][i], s[2][i], s[3][i])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "#주희선생님이 알려주신 문제\r\n#일단 팀이 안만들어지는 경우(0출력) 먼저 제외하고\r\n#미니멈 갯수만큼 팀이 만들어지니까 경우의 수 출력\r\n#그 다음에 1,2,3의 인덱스 +1 출력하고 (각 학생의 위치)\r\n#출력해준 인덱스 값은 그냥 0으로 바꾸어버리기.\r\n\r\n#이때 while문을 반복하며 while뒤에 숫자변수 k를 사용할 수 있다는 점 알려주기 \r\n#일반 숫자는 True, 0이 되면 False로 작용한다.\r\n\r\nn=int(input())\r\n \r\nx=list(map(int,input().split()))\r\n\r\nif x.count(1)==0 or x.count(2)==0 or x.count(3)==0:\r\n print(0)\r\n \r\nelse:\r\n k=min(x.count(1),x.count(2),x.count(3))\r\n print(k)\r\n \r\n while k:\r\n k=k-1\r\n print(x.index(1)+1,x.index(2)+1,x.index(3)+1)\r\n x[x.index(1)]=0\r\n x[x.index(2)]=0\r\n x[x.index(3)]=0", "#!/usr/bin/env python3\n# coding:utf-8\n\nif __name__ == \"__main__\":\n n = int(input())\n arr = [int(item) for item in input().split()]\n m1 = set()\n m2 = set()\n m3 = set()\n for i in range(n):\n if arr[i] == 1:\n m1.add(i+1)\n if arr[i] == 2:\n m2.add(i+1)\n if arr[i] == 3:\n m3.add(i+1)\n l = min(len(m1), len(m2), len(m3))\n print(l)\n for i in range(l):\n print(f\"{m1.pop()} {m2.pop()} {m3.pop()}\")", "n = int(input())\r\ndata = input().split()\r\nb1 = []\r\nb2 = []\r\nb3 = []\r\nc1 = 0\r\nc2 = 0\r\nc3 = 0\r\nfor i in range(n):\r\n if data[i] == '1':\r\n b1.append(i + 1)\r\n c1 += 1\r\n elif data[i] == '2':\r\n b2.append(i + 1)\r\n c2 += 1\r\n else:\r\n b3.append(i + 1)\r\n c3 += 1\r\n\r\nans = min(c1, c2, c3)\r\nprint(ans)\r\nfor i in range(ans):\r\n print(b1[i], b2[i], b3[i])\r\n", "n=int(input())\r\nt=list(map(int,input().split()))\r\nprint(min(t.count(1),t.count(2),t.count(3)))\r\nfor j in range(min(t.count(1),t.count(2),t.count(3))):\r\n print(t.index(1)+1,t.index(2)+1,t.index(3)+1)\r\n t[t.index(1)]=9\r\n t[t.index(2)]=9\r\n t[t.index(3)]=8", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nindex_1, index_2, index_3 = 0, 0, 0\r\narr = [[0 for i in range(n)] for j in range(3)]\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n arr[0][index_1] = i+1\r\n index_1 += 1\r\n elif a[i] == 2:\r\n arr[1][index_2] = i+1\r\n index_2 += 1\r\n else:\r\n arr[2][index_3] = i+1\r\n index_3 += 1\r\nTeams_num = min(index_1, index_2, index_3)\r\nprint(Teams_num)\r\nfor i in range(Teams_num):\r\n print(arr[0][i], arr[1][i], arr[2][i])", "input()\r\nmyList = [[], [], []]\r\nfor i, x in enumerate(list(map(int, input().split()))):\r\n myList[x - 1].append(i + 1)\r\ncount = min([len(k) for k in myList])\r\nprint(count)\r\nfor i in range(count):\r\n print(myList[0][i], myList[1][i], myList[2][i])", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\nidx1 = []\r\nfor i in range(len(t)):\r\n if t[i] == 1:\r\n idx1.append(t.index(1, i))\r\n \r\nidx2 = []\r\nfor i in range(len(t)):\r\n if t[i] == 2:\r\n idx2.append(t.index(2,i))\r\n \r\nidx3 = []\r\nfor i in range(len(t)):\r\n if t[i] == 3:\r\n idx3.append(t.index(3,i))\r\n \r\narr = [len(idx1), len(idx2), len(idx3)]\r\nmin_arr = min(arr)\r\nidx1 = idx1[:min_arr]\r\nidx2 = idx2[:min_arr]\r\nidx3 = idx3[:min_arr]\r\nindices = [[i+1,j+1,k+1] for i,j,k in zip(idx1, idx2, idx3)]\r\n\r\nprint (len(indices))\r\nif len(indices) != 0:\r\n for k in range(len(indices)):\r\n print (*indices[k])", "\r\nimport sys\r\nn = int(input().strip())\r\n\r\nstud = list(map(int, input().strip().split()))\r\n\r\nif len(set(stud)) != 3:\r\n\tprint(0)\r\n\tsys.exit()\r\n\r\ndit = dict()\r\ns_1, s_2, s_3 = [], [], []\r\n\r\nfor i in range(n):\r\n\tif stud[i] in dit:\r\n\t\tdit[stud[i]] += 1\r\n\telse:\r\n\t\tdit[stud[i]] = 1\r\n\tif(stud[i] == 1): s_1.append(i+1)\r\n\telif(stud[i] == 2): s_2.append(i+1)\r\n\telif(stud[i] == 3): s_3.append(i+1)\r\n\r\nw = min(dit.values())\r\nres = []\r\nfor x, y, z in zip(s_1[:w], s_2[:w], s_3[:w]):\r\n\tres.append([x,y,z])\r\n\r\nprint(w)\r\nfor i in res: print(\" \".join([str(a) for a in i]))\r\n\r\n", "n = int(input())\r\nts = input().split()\r\nd = {'1':[], '2':[], '3':[]}\r\nfor i in range(n):\r\n d[ts[i]].append(i+1)\r\nminimum = 5001\r\nfor key, val in d.items():\r\n if len(val) < minimum:\r\n minimum = len(val)\r\n \r\nprint(minimum)\r\nfor i in range(minimum):\r\n print(d['1'][i], ' ', d['2'][i], ' ', d['3'][i])", "n = int(input())\r\n\r\nt = [int(i) for i in input().split()]\r\n\r\nskills = [t.count(j) for j in sorted(set(t))]\r\n\r\nw = min(skills)\r\n\r\nsalir = False\r\n\r\nprint(0) if len(set(t)) != 3 else print(w)\r\n\r\nif len(set(t)) == 3:\r\n for i in range(w):\r\n ids = [t.index(i) for i in sorted(set(t)) if i != 0]\r\n res = [str(i+1) for i in ids]\r\n print(' '.join(res))\r\n t = [t[i] if i not in ids else 0 for i in range(len(t))]", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogramming = []\r\nmathematics = []\r\npe = []\r\n\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n mathematics.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\n\r\nmax_teams = min(len(programming), len(mathematics), len(pe))\r\n\r\nteams = []\r\n\r\nfor i in range(max_teams):\r\n team = [programming[i], mathematics[i], pe[i]]\r\n teams.append(team)\r\n\r\nprint(max_teams)\r\nfor team in teams:\r\n print(*team)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nm,p,s = [],[],[]\r\nfor i in range(n):\r\n if l[i] == 1: p.append(i+1)\r\n elif l[i] == 2: m.append(i+1)\r\n else: s.append(i+1)\r\nprint(min(len(p),len(m),len(s)))\r\nfor i in range(min(len(p),len(m),len(s))):\r\n print(m[i],p[i],s[i])", "import math\r\nn,a=input(),input()\r\nx=min(a.count('1'),a.count('2'),a.count('3'))\r\nprint(x)\r\ni1=i2=i3=0\r\nfor i in range(x):\r\n i1=a.index('1',i1)+1;i2=a.index('2',i2)+1;i3=a.index('3',i3)+1\r\n print(math.ceil(i1/2),math.ceil(i2/2),math.ceil(i3/2))", "n = int(input())\r\nlist1 = [int(x) for x in input().split(' ')]\r\npos_list1 = []\r\npos_list2 = []\r\npos_list3 = []\r\nfor i in range(n):\r\n if (list1[i] == 1) and ((i+1) not in pos_list1):\r\n pos_list1.append(i+1)\r\n if (list1[i] == 2) and ((i+1) not in pos_list2):\r\n pos_list2.append(i+1) \r\n if (list1[i] == 3) and ((i+1) not in pos_list3):\r\n pos_list3.append(i+1)\r\nnum = min(len(pos_list1), len(pos_list2), len(pos_list3))\r\nprint(num)\r\nfor i in range(num):\r\n print(\"{} {} {}\".format(pos_list1[i], pos_list2[i], pos_list3[i]))", "n = int(input())\r\nchildren = list(map(int, input().split()))\r\n\r\n# Initialize lists to store the indices of children with different skills\r\nprogramming, math, pe = [], [], []\r\n\r\n# Separate the children into three lists based on their skills\r\nfor i in range(n):\r\n if children[i] == 1:\r\n programming.append(i + 1)\r\n elif children[i] == 2:\r\n math.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\n# Find the maximum number of teams that can be formed\r\nmax_teams = min(len(programming), len(math), len(pe))\r\n\r\n# Initialize teams list to store the teams\r\nteams = []\r\n\r\n# Form teams with one child from each skill\r\nfor i in range(max_teams):\r\n team = [programming[i], math[i], pe[i]]\r\n teams.append(team)\r\n\r\nprint(max_teams)\r\nfor team in teams:\r\n print(*team)\r\n", "t = int(input())\nrow = list(map(int, input(). split(\" \")))\n\nprog_1 = []\nmath_2 = []\nPE_3 = []\n\ncounter = 0\n\nfor i in row:\n if i == 1:\n prog_1.append(counter + 1)\n counter += 1\n if i == 2:\n math_2.append(counter + 1)\n counter += 1\n if i == 3:\n PE_3.append(counter + 1)\n counter += 1\n\n# print(prog_1)\n# print(math_2)\n# print(PE_3)\n\nall_of_it = [len(prog_1), len(math_2), len(PE_3)]\ntimes = min(all_of_it)\nprint(times)\n\nwhile times > 0:\n print(prog_1[times - 1], math_2[times - 1], PE_3[times - 1])\n times -= 1", "n = int(input())\r\nlistt = list(input().split())\r\nif listt.count(\"1\") < 1 or listt.count(\"2\")< 1 or listt.count(\"3\")<1:\r\n print(0)\r\n exit()\r\none = [i+1 for i in range(len(listt)) if listt[i]==\"1\"]\r\ntwo = [i+1 for i in range(len(listt)) if listt[i]==\"2\"]\r\nthree = [i+1 for i in range(len(listt)) if listt[i] ==\"3\"]\r\nprint(len(list(zip(one,two,three))))\r\nfor i in list(zip(one,two,three)):\r\n print(*i)", "input()\r\na = input()\r\na = a.split()\r\npro, mat, fis = [], [], []\r\nfor i in range(0, len(a)):\r\n if a[i] == \"1\":\r\n pro.append(int(i))\r\n elif a[i] == \"2\":\r\n mat.append(int(i))\r\n else:\r\n fis.append(int(i))\r\narr = [len(mat), len(fis), len(pro)]\r\nprint(min(arr))\r\nfor i in range(0, min(arr)):\r\n print(f\"{pro[i]+1} {mat[i]+1} {fis[i]+1}\")", "n = int(input())\r\na = [int(x) for x in input().split()]\r\none = []\r\ntwo = []\r\nthree = []\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n one.append(i + 1)\r\n elif a[i] == 2:\r\n two.append(i + 1)\r\n elif a[i] == 3:\r\n three.append(i + 1)\r\nr = min(len(one), len(two), len(three))\r\nprint(r)\r\nfor i in range(r):\r\n print(one[i], two[i], three[i])\r\n\r\n", "def forms_teams(n,skills):\r\n programmers = [i+1 for i in range(len(skills)) if skills[i] == 1]\r\n math = [i+1 for i in range(len(skills)) if skills[i] == 2]\r\n pe = [i+1 for i in range(len(skills)) if skills[i] == 3]\r\n\r\n teams = []\r\n min_team_size = min(len(programmers),len(math),len(pe))\r\n\r\n for i in range(min_team_size):\r\n team = f\"{programmers[i]} {math[i]} {pe[i]}\"\r\n teams.append(team)\r\n return teams\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n skills = list(map(int,input().split()))\r\n\r\n teams = forms_teams(n,skills)\r\n\r\n if len(teams)>0:\r\n print(len(teams))\r\n for team in teams:\r\n print(team)\r\n\r\n else:\r\n\r\n print(0)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nd={1:[],2:[],3:[]}\r\nc1=c2=c3=0\r\nfor i in range(n):\r\n d[a[i]].append([a[i],i+1])\r\n if a[i]==1:\r\n c1+=1\r\n elif a[i]==2:\r\n c2+=1\r\n else:\r\n c3+=1\r\nans=0\r\nli=[]\r\nwhile True:\r\n if c1>0 and c2>0 and c3>0:\r\n ans+=1\r\n li.append([d[1][c1-1][1],d[2][c2-1][1],d[3][c3-1][1]])\r\n c1-=1\r\n c2-=1\r\n c3-=1\r\n else:\r\n break\r\nprint(ans)\r\nfor i in li:\r\n print(*i)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx1=a.count(1)\r\nx2=a.count(2)\r\nx3=a.count(3)\r\nb=min(x1,x2,x3)\r\nprint(b)\r\nc1=[]\r\nc2=[]\r\nc3=[]\r\n\r\nfor i in range(n):\r\n if a[i]==1:\r\n c1.append(i+1)\r\nfor i in range(n):\r\n if a[i]==2:\r\n c2.append(i+1)\r\nfor i in range(n):\r\n if a[i]==3:\r\n c3.append(i+1)\r\nfor k in range(b):\r\n print(c1[k],end=\" \")\r\n print(c2[k],end=\" \")\r\n print(c3[k],end=\" \")\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", "import enum\r\n\r\n\r\nnum_students = int(input())\r\nt = list(map(int, input().strip().split()))\r\n\r\nt_list = list(enumerate(t))\r\nt_list_sorted = sorted(t_list, key=lambda x: x[1])\r\nprog_1_list = [i for i in t_list_sorted if i[1]==1]\r\nmath_2_list = [i for i in t_list_sorted if i[1]==2]\r\npe_3_list = [i for i in t_list_sorted if i[1]==3]\r\n\r\nmax_num_teams = num_students // 3\r\n\r\nif len(prog_1_list)==0 or len(math_2_list)==0 or len(pe_3_list)==0:\r\n print(0)\r\n quit()\r\n\r\nteams_list = []\r\nfor i in range(max_num_teams):\r\n teams_list.append([prog_1_list[0], math_2_list[0], pe_3_list[0]])\r\n prog_1_list.remove(prog_1_list[0])\r\n math_2_list.remove(math_2_list[0])\r\n pe_3_list.remove(pe_3_list[0])\r\n if len(prog_1_list)==0 or len(math_2_list)==0 or len(pe_3_list)==0:\r\n break\r\n\r\nprint(len(teams_list))\r\nfor i in teams_list:\r\n print(i[0][0]+1, i[1][0]+1, i[2][0]+1)", "n = int(input())\r\nA = list(map(int,input().split()))\r\nteam = min(A.count(1), A.count(2), A.count(3))\r\nprint(team)\r\nfor i in range(team):\r\n print(A.index(1) + 1, A.index(2) + 1, A.index(3) + 1)\r\n A[A.index(1)] = 0\r\n A[A.index(2)] = 0\r\n A[A.index(3)] = 0", "_ = input()\r\narr = list(map(int,input().split()))\r\ndic = {k: [0,[]] for k in range(1,4) }\r\nfor i in range(len(arr)) :\r\n dic[arr[i]][0] += 1 \r\n dic[arr[i]][1] += [i+1]\r\nz = min(dic.values() , key = lambda x : x[0])[0]\r\nprint(z)\r\nif z != 0 :\r\n for i in range(z) :\r\n print(dic[1][1][i] , dic[2][1][i] , dic[3][1][i] )", "n=int(input())\r\na=input().split()\r\nt1=list()\r\nt2=list()\r\nt3=list()\r\nn1,n2,n3=0,0,0\r\nfor i in range(n):\r\n if a[i]=='1':\r\n n1+=1\r\n t1.append(i+1)\r\n elif a[i]=='2':\r\n n2+=1\r\n t2.append(i+1)\r\n else:\r\n n3+=1\r\n t3.append(i+1)\r\ne=min(n1,n2,n3)\r\nprint(e)\r\nif e:\r\n for i in range(e):\r\n print('{} {} {}'.format(t1[i],t2[i],t3[i]))\r\n", "n=int(input())\r\nstudents=input()\r\nstudents=students.replace(' ','')\r\nprogrammers,math,sports=students.count('1'),students.count('2'),students.count('3')\r\nl_students=[programmers,math,sports]\r\nl_students.sort()\r\nl_p,l_m,l_s=[],[],[]\r\nprint(l_students[0])\r\nif l_students[0]!=0:\r\n for i in range(n):\r\n if students[i]=='1':l_p.append(i+1)\r\n elif students[i]=='2':l_m.append(i+1)\r\n else:l_s.append(i+1)\r\n for j in range(l_students[0]):\r\n print(l_p[j],l_m[j],l_s[j])", "x = int(input())\nlst = list(map(int, input().split()))\none, two, threee = [], [], []\nfor i in range(x):\n if lst[i]==1:\n one.append(i+1)\n elif lst[i]==2:\n two.append(i+1)\n else:\n threee.append(i+1)\nmn = min(len(one), len(two), len(threee))\nprint(mn)\nfor i in range(mn):\n print(one[i], two[i], threee[i])\n\n\t\t\t\t\t\t\t \t\t \t \t\t\t\t \t \t \t\t\t\t\t\t", "\n\ndef t_counter(pairs, t):\n acc = 0\n for pair in pairs:\n if t == pair[0]:\n acc += 1\n return acc\n\nn = int(input())\nts = list( map( int, input().split(' ') ) )\nns = [x for x in range(1, n + 1)]\n\npairs = list( zip(ts, ns) )\n# print(pairs)\npairs.sort(key = lambda x: x[0])\n# print(pairs)\n\nones = t_counter(pairs, 1)\ntwos = t_counter(pairs, 2)\nthrees = t_counter(pairs, 3)\n\nw = min([ones, twos, threes])\nif w == 0:\n print(w)\nelse:\n print(w)\n i1 = 0\n i2 = ones\n i3 = ones + twos\n for v in range(w):\n print(pairs[i1][1], pairs[i2][1], pairs[i3][1])\n i1 += 1\n i2 += 1\n i3 += 1\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nq = []\r\nw = []\r\ne = []\r\nfor i in range(len(a)):\r\n if a[i]==1:\r\n q.append(i+1)\r\n elif a[i]==2:\r\n w.append(i+1)\r\n else:\r\n e.append(i+1)\r\nm = min(len(q),len(w),len(e))\r\nprint(m)\r\nfor i in range(m):\r\n print(q[i],w[i],e[i])", "p=[]\r\nm=[]\r\ns=[]\r\nx=input()\r\ny=list(map(int,input().split()))\r\nfor i in y:\r\n if i==1:\r\n p.append(i)\r\n elif i==2:\r\n m.append(i)\r\n else:\r\n s.append(i)\r\na=(min(len(p),len(m),len(s)))\r\nprint(a)\r\nif a!=0:\r\n for l in range(a):\r\n print(y.index(1)+1,y.index(2)+1,y.index(3)+1)\r\n y[y.index(1)]=4\r\n y[y.index(2)]=4\r\n y[y.index(3)]=4", "# Author : //- kibrom Hailu -\\\\\r\n\r\nfrom sys import stdin,stdout\r\nfrom collections import Counter,defaultdict , deque \r\nfrom bisect import bisect , bisect_left ,bisect_right \r\nfrom itertools import accumulate \r\nfrom heapq import heapify , heappop , heappush , heappushpop , heapreplace\r\n\r\ndef I(): return int(stdin.readline())\r\ndef II(): return map(int, stdin.readline().split())\r\ndef IL(): return list(map(int, stdin.readline().split()))\r\ndef SIL(): return sorted(map(int, stdin.readline().split()))\r\n\r\n\r\n\r\ndef solve():\r\n \r\n # write your code here \r\n n = I() \r\n arr = IL() \r\n\r\n stack1 = []\r\n stack2 = []\r\n stack3 = []\r\n\r\n for i in range(len(arr)):\r\n if arr[i] == 1:\r\n stack1.append(i+1)\r\n elif arr[i] == 2:\r\n stack2.append(i+1)\r\n else:\r\n stack3.append(i+1)\r\n\r\n print(min(len(stack1),len(stack2),len(stack3)))\r\n\r\n while stack1 and stack2 and stack3:\r\n t1 = stack1.pop() \r\n t2 = stack2.pop() \r\n t3 = stack3.pop()\r\n print(t1,t2,t3) \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 = int(input())\r\na = list(map(int, input().split()))\r\na1 = []\r\na2 = []\r\na3 = []\r\n\r\ncount = 0\r\n\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n a1.append(i + 1)\r\n elif a[i] == 2:\r\n a2.append(i + 1)\r\n else:\r\n a3.append(i + 1)\r\n\r\nresult = min(len(a1), len(a2), len(a3))\r\nprint(result)\r\n\r\nfor i in range(result):\r\n print(a1[i], a2[i], a3[i])", "n = int(input())\r\na = list(map(int,input().split(' ')))\r\nf, s, t = 0,0,0\r\nres=[]\r\nfor i in range(n):\r\n res.append([0,0,0])\r\nfor i in range(n):\r\n if a[i] ==1:\r\n res[f][0]=i+1\r\n f+=1\r\n elif a[i] ==2:\r\n res[s][1]=i+1\r\n s+=1\r\n else:\r\n res[t][2]=i+1\r\n t+=1\r\nprint(min(t,f,s))\r\nif min(t,f,s)>0:\r\n for i in range(min(t,f,s)):\r\n print(' '.join(map(str,res[i])))", "n=int(input())\nlst=list(map(int,input().split()))\none=lst.count(1)\ntwo=lst.count(2)\nthree=lst.count(3)\nteam=min(one,two,three)\nif team==0:\n print(0)\nelse:\n print(team)\n for i in range(team):\n st=''\n st+=f'{lst.index(1)+1} '\n lst[lst.index(1)]='A'\n st+=f'{lst.index(2)+1} '\n lst[lst.index(2)]='A'\n st+=f'{lst.index(3)+1}'\n lst[lst.index(3)]='A'\n print(st)\n\t \t\t \t \t\t\t \t\t\t \t \t\t\t \t\t", "students=int(input())\r\nskill=input()\r\nj=0\r\npro=0\r\nmath=0\r\npe=0\r\npos = [[0] * students for i in range(3)] ### Multidimensional Array/list\r\nfor i in range(students):\r\n if skill[j]=='1':\r\n pro+=1\r\n pos[0][pro-1]=i+1\r\n elif skill[j]=='2':\r\n math+=1\r\n pos[1][math-1]=i+1\r\n else:\r\n pe+=1\r\n pos[2][pe-1]=i+1\r\n j+=2\r\nteam=min(pro,math,pe)\r\nprint(team)\r\nteam_p=[]\r\nfor i in range(team):\r\n team_p.clear()\r\n team_p.append(pos[0][i])\r\n team_p.append(pos[1][i])\r\n team_p.append(pos[2][i])\r\n #print(team_p)\r\n for i in range(3):\r\n print(team_p[i],end=' ')\r\n print()", "n=int(input())\r\nt=0\r\nl=input()\r\nl=l.replace(\" \",'')\r\np=[]\r\nwhile \"1\" in l and '2' in l and '3' in l:\r\n t+=1\r\n p.append([l.index('1')+1,l.index('2')+1,l.index('3')+1]) \r\n l=l.replace(\"1\",' ',1)\r\n l=l.replace(\"2\",' ',1)\r\n l=l.replace(\"3\",' ',1)\r\nprint(t)\r\nfor i in range(t):\r\n print(*p[i],sep=' ')", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\na, b, c = [], [], []\r\nfor i in t:\r\n if i==1:\r\n a.append(i)\r\n elif i==2:\r\n b.append(i)\r\n else:\r\n c.append(i)\r\nd = min(len(a), len(b), len(c))\r\nprint(d)\r\nfor j in range(d):\r\n e, f, g = t.index(a[j]), t.index(b[j]), t.index(c[j])\r\n print(e+1, f+1, g+1)\r\n t[e], t[f], t[g] = 'a', 'a', 'a'", "n= int(input())\r\na=list(map(int, input().split()))\r\none,two,three=0,0,0\r\nones=[]\r\ntwos=[]\r\nthrees=[]\r\nfor i in range(n):\r\n if a[i]==1:\r\n one+=1\r\n ones.append(i)\r\n if a[i]==2:\r\n two+=1\r\n twos.append(i)\r\n if a[i]==3:\r\n three+=1\r\n threes.append(i)\r\nprint(min(one,two,three))\r\nfor i in range(min(one,two,three)):\r\n print(ones[i]+1, end=' ')\r\n print(twos[i]+1, end=' ')\r\n print(threes[i]+1, end=' ')\r\n print()", "n = int(input())\r\nb = input().split()\r\na = []\r\nfor i in b:\r\n a.append(int(i))\r\n\r\none = []\r\ntwo = []\r\nthree = []\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n one.append(i+1)\r\n if a[i] == 2:\r\n two.append(i+1)\r\n if a[i] == 3:\r\n three.append(i+1)\r\n# print(one, two, three)\r\nteam = min(len(one), len(two), len(three))\r\nprint(team)\r\nfor i in range(0, team):\r\n print(one[i], two[i], three[i])", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\n# Create empty lists for each team\r\nteam1, team2, team3 = [], [], []\r\n\r\n# Distribute students into teams based on their skill\r\nfor i in range(n):\r\n skill = students[i]\r\n if skill == 1:\r\n team1.append(i+1)\r\n elif skill == 2:\r\n team2.append(i+1)\r\n else:\r\n team3.append(i+1)\r\n\r\n# Calculate the minimum number of teams that can be formed\r\nnum_teams = min(len(team1), len(team2), len(team3))\r\n\r\nprint(num_teams)\r\n\r\n# Print the team assignments for each team\r\nfor i in range(num_teams):\r\n print(team1[i], team2[i], team3[i])\r\n", "n = int(input()) \r\nskills = list(map(int, input().split())) \r\nprogramming_indices = []\r\nmath_indices = []\r\npe_indices = []\r\nfor i in range(n):\r\n skill = skills[i]\r\n if skill == 1:\r\n programming_indices.append(i + 1)\r\n elif skill == 2:\r\n math_indices.append(i + 1)\r\n else:\r\n pe_indices.append(i + 1)\r\nmax_teams = min(len(programming_indices), len(math_indices), len(pe_indices))\r\nif max_teams >= 1:\r\n print(max_teams)\r\n for i in range(max_teams):\r\n team = [programming_indices[i], math_indices[i], pe_indices[i]]\r\n print(*team)\r\nelse:\r\n print(0)", "number_of_students = int(input())\r\nstudents = list(map(int, input().split()))\r\nones = []\r\ntwos = []\r\nthrees = []\r\nfor i in range(len(students)):\r\n if students[i] == 1:\r\n ones.append(i+1)\r\n elif students[i] == 2:\r\n twos.append(i+1)\r\n elif students[i] == 3:\r\n threes.append(i+1)\r\n\r\nprint(min(len(ones), len(twos), len(threes)))\r\nwhile min(len(ones), len(twos), len(threes)):\r\n print(ones[0], twos[0], threes[0])\r\n ones.remove(ones[0])\r\n twos.remove(twos[0])\r\n threes.remove(threes[0])", "n = input()\r\na = list(map(int,input().split()))\r\nmi = 0\r\nif a.count(1) > 0 and a.count(2) > 0 and a.count(3) >0:\r\n mi = min(a.count(1),a.count(2),a.count(3))\r\n print(mi)\r\n for i in range(mi):\r\n for j in range(1, 4):\r\n print(a.index(j)+1,end = ' ')\r\n a[a.index(j)] = 0\r\n print()\r\n \r\nelse:\r\n print(mi)", "n = int(input())\narr1 = input()\narr = arr1.split()\n\np,m,pe = 0,0,0\narr_p = []\narr_m = []\narr_pe = []\n\nfor i in range(n):\n if int(arr[i]) == 1:\n p = p+1\n arr_p.append(i+1)\n if int(arr[i]) == 2:\n m = m+1\n arr_m.append(i+1)\n if int(arr[i]) == 3:\n pe = pe+1\n arr_pe.append(i+1)\n\nmax_teams = min(p,m,pe) \nprint(max_teams)\n\nfor t in range(max_teams):\n print(arr_p[t], arr_m[t], arr_pe[t] )", "n = int (input())\r\na = list(map(int, input().split()))\r\na1, a2, a3 = [],[], []\r\nfor i, v in enumerate(a):\r\n if v == 1:\r\n a1.append(i)\r\n if v == 2:\r\n a2.append(i)\r\n if v == 3:\r\n a3.append(i)\r\nc1, c2, c3 = len(a1), len(a2), len(a3)\r\nans= []\r\ni=-1\r\nwhile c1>0 and c2>0 and c3>0:\r\n ans.append([a1[i]+1, a2[i]+1, a3[i]+1])\r\n i -= 1\r\n c1 -= 1\r\n c2 -= 1\r\n c3 -= 1\r\nprint(len(ans))\r\nfor v in ans:\r\n print(*v)", "n = int(input())\r\nt_list = [int(i) for i in input().split()]\r\n\r\ncounts = [[] for i in range(3)]\r\n\r\nfor t in range(n):\r\n counts[(t_list[t] - 1) % 3].append(t + 1)\r\n\r\nn = min([len(counts[0]), len(counts[1]), len(counts[2])])\r\n\r\nprint(n)\r\n\r\nfor i in range(n):\r\n print(counts[0][i], counts[1][i], counts[2][i])", "n=int(input())\r\nt=list(map(int,list(input().split())))\r\na=[]\r\nb=[]\r\nc=[]\r\nx=0\r\ny=0\r\nz=0\r\nd=0\r\nr=[]\r\nfor i in range(n):\r\n r.append([t[i],i+1])\r\n if r[i][0]==1:\r\n a.append(r[i])\r\n if r[i][0]==2:\r\n b.append(r[i])\r\n if r[i][0]==3:\r\n c.append(r[i])\r\nd=(min(len(a),len(b),len(c)))\r\nprint(d)\r\nfor q in range(d):\r\n x=a[q][1]\r\n y=b[q][1]\r\n z=c[q][1]\r\n print(x,y,z)\r\n", "n = int(input())\r\nd = {}\r\nd[1] = []\r\nd[2] = []\r\nd[3] = []\r\ns = [int(_) for _ in input().split()]\r\nfor i in range(1,len(s)+1):\r\n d[s[i-1]].append(i)\r\na = min(len(d[1]), len(d[2]), len(d[3]))\r\nprint(a)\r\nif a != 0:\r\n for i in range(a):\r\n print(d[1][i],d[2][i],d[3][i])", "n=int(input())\r\ns=input()\r\na=s.replace(' ','')\r\nprint(min(a.count('1'),a.count('2'),a.count('3')))\r\nwhile len(a)>2:\r\n if a.find('1')!=-1 and a.find('2')!=-1 and a.find('3')!=-1:\r\n print(a.find('1')+1,a.find('2')+1,a.find('3')+1)\r\n a=a.replace('1','0',1)\r\n a=a.replace('2','0',1)\r\n a=a.replace('3','0',1)\r\n else:\r\n break\r\n", "n = int(input())\r\nt = [int(x) for x in input().split()]\r\nw = min(t.count(1), t.count(2), t.count(3))\r\nif w == 0:\r\n\tprint(0)\r\nelse:\r\n\tprint(w)\r\n\tfor i in range(w):\r\n\t\ta = t.index(1) + 1; b = t.index(2) + 1; c = t.index(3) + 1\r\n\t\tprint(str(a) + ' ' + str(b) + ' ' + str(c))\r\n\t\tt[a - 1] = 0; t[b - 1] = 0; t[c - 1] = 0", "n=int(input())\r\nx=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nfor i in range(n):\r\n if x[i]==1:\r\n l1.append(x.index(1, i))\r\n elif x[i]==2:\r\n l2.append(x.index(2, i))\r\n if x[i]==3:\r\n l3.append(x.index(3, i)) \r\nprint(min(len(l1),len(l2),len(l3)))\r\n\r\n\r\nfor j in range(min(len(l1),len(l2),len(l3))):\r\n print(l1[j]+1,l2[j]+1,l3[j]+1)", "n = int(input())\r\nd = {1:[], 2:[], 3:[]}\r\nl = list(map(int, input().split()))\r\nfor i in range(n):\r\n d[l[i]].append(i+1)\r\nm = min(len(d[1]), len(d[2]), len(d[3]))\r\nprint(m)\r\nfor i in range(m):\r\n print(d[1][i], d[2][i], d[3][i])", "c1 = 0\r\nc2 = 0\r\nc3 = 0\r\nn = int(input())\r\nl = [i for i in input().split()]\r\nt1 =[]\r\nt2 = []\r\nt3 = []\r\ni = 1\r\nfor k in range(n):\r\n if l[k] == '1':\r\n c1 += 1\r\n t1.append(i)\r\n elif l[k] == '2':\r\n c2 += 1\r\n t2.append(i)\r\n elif l[k] == '3':\r\n c3 += 1\r\n t3.append(i)\r\n i+=1\r\nw = min(c1, min(c2, c3))\r\nprint(w)\r\nfor i in range(w):\r\n print(t1[i], \" \", t2[i], \" \", t3[i])\r\n", "N = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nlocs = [[] for _ in range(4)]\r\nfor i, x in enumerate(A, 1):\r\n locs[x].append(i)\r\n\r\nct = min(len(locs[x]) for x in [1, 2, 3])\r\nprint(ct)\r\n\r\nfor _ in range(ct):\r\n print(*[locs[x].pop() for x in [1, 2, 3]])\r\n\r\n", "\r\nfrom operator import index\r\n\r\n\r\nn = int(input())\r\nd = list(map(int, input().split()))\r\ncount = min([d.count(2), d.count(3), d.count(1)])\r\nprint(count)\r\nindexes_1 = []\r\nindexes_2 = []\r\nindexes_3 = []\r\nfor i in range(len(d)):\r\n if d[i] == 1:\r\n indexes_1.append(i)\r\n if d[i] == 2:\r\n indexes_2.append(i)\r\n if d[i] == 3:\r\n indexes_3.append(i)\r\nfor i, i1, i2 in zip(indexes_1, indexes_2, indexes_3):\r\n print(i+1, i1+1, i2+1)\r\n", "n = int(input())\r\none, two, three = [],[],[]\r\nfor i, t in enumerate(list(map(int, input().split()))):\r\n if t == 1:\r\n one.append(i)\r\n elif t == 2:\r\n two.append(i)\r\n elif t == 3:\r\n three.append(i)\r\nans = min(len(one), len(two), len(three))\r\nprint(ans)\r\nfor i in range(ans):\r\n print(one[i]+1, two[i]+1, three[i]+1)", "n = int(input())\r\nar = list(map(int,input().split()))\r\np = []\r\nm = []\r\nf = []\r\nfor i in enumerate(ar):\r\n if i[1] == 1: p.append(i[0]+1)\r\n elif i[1] == 2: m.append(i[0] + 1)\r\n else: f.append(i[0] + 1)\r\nmax_r = min(len(p),len(m),len(f))\r\nif max_r > 0:\r\n print(max_r)\r\n for i in range(max_r):\r\n print(p[i],m[i],f[i])\r\nelse:\r\n print(0)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ncount=min(lst.count(1),lst.count(2),lst.count(3))\r\nprint(count)\r\nif count>0:\r\n m=count\r\n while m!=0:\r\n print(lst.index(1)+1,lst.index(2)+1,lst.index(3)+1)\r\n lst[lst.index(1)] =0\r\n lst[lst.index(2)] = 0\r\n lst[lst.index(3)] = 0\r\n m-=1", "n = int(input())\r\nmas = [[], [], []]\r\ni = 1\r\nfor el in input().split():\r\n mas[int(el) - 1].append(i)\r\n i += 1\r\nmn = min(len(mas[0]), len(mas[1]), len(mas[2]))\r\nprint(mn)\r\nfor i in range(mn):\r\n print(mas[0][i], mas[1][i], mas[2][i])", "from 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():\r\n return list(map(int, 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 = int(input())\r\n a = list_input()\r\n one = []\r\n two = []\r\n three = []\r\n for i in range(n):\r\n if a[i] == 1:\r\n one.append(i+1)\r\n elif a[i] == 2:\r\n two.append(i+1)\r\n else:\r\n three.append(i+1)\r\n ans = min(len(one), len(two), len(three))\r\n print(f\"{ans}\\n\")\r\n for i in range(ans):\r\n print(f\"{one[i]} {two[i]} {three[i]}\\n\")\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "number = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nprogramming = [idx for idx, val in enumerate(students) if val == 1]\r\nmath = [idx for idx, val in enumerate(students) if val == 2]\r\npe = [idx for idx, val in enumerate(students) if val == 3]\r\n\r\nif programming and math and pe:\r\n teams = min(len(programming), len(math), len(pe))\r\n print(teams)\r\n \r\n for team in range(teams):\r\n print(programming[team] + 1, end=' ')\r\n print(math[team] + 1, end=' ')\r\n print(pe[team] + 1)\r\nelse:\r\n print(0)", "l_p = list()\nl_m = list()\nl_e = list()\n\n_ = input()\nl_s = list(map(int, input().split()))\n\nfor i in range(len(l_s)):\n if l_s[i] == 1:\n l_p.append(i + 1)\n elif l_s[i] == 2:\n l_m.append(i + 1)\n else:\n l_e.append(i + 1)\n\nn = min(len(l_p), len(l_m), len(l_e))\nprint(n)\n\nfor i in range(n):\n print(\"%d %d %d\" % (l_p[i], l_m[i], l_e[i]))", "from sys import stdin, stdout\r\n\r\ninput()\r\n\r\nlisty = [int(x) for x in stdin.readline().split()]\r\nn = min(listy.count(1), listy.count(2), listy.count(3))\r\np=[]\r\nm=[]\r\ne=[]\r\nfor i in range(0, len(listy), 1):\r\n if listy[i] == 1:\r\n p.append(i+1)\r\n if listy[i] == 2:\r\n m.append(i+1)\r\n if listy[i] == 3:\r\n e.append(i+1)\r\nprint(n)\r\nfor i in range(0, n, 1):\r\n print(p[i],m[i],e[i])", "import math\r\n\r\ndef print_team_members(team_numbers,programming_childrens,math_childrens,pe_childrens):\r\n j = 0\r\n if team_numbers == 0:\r\n return 0\r\n for i in range(team_numbers):\r\n print(f\"{programming_childrens[j]} {math_childrens[j]} {pe_childrens[j]}\")\r\n j += 1\r\n\r\ndef result(childrens_number, childrens_array):\r\n programming_childrens, math_childrens, pe_childrens = [], [], []\r\n for i,child in enumerate(childrens_array):\r\n if child == 1:\r\n programming_childrens.append(i + 1)\r\n elif child == 2:\r\n math_childrens.append(i + 1)\r\n else:\r\n pe_childrens.append(i + 1)\r\n team_numbers = min(len(programming_childrens), len(math_childrens), len(pe_childrens))\r\n print(team_numbers)\r\n print_team_members(team_numbers, programming_childrens, math_childrens, pe_childrens)\r\n \r\n\r\n\r\n\r\n\r\nchildrens_number = int(input())\r\nchildrens_array = [int(child) for child in input().split()]\r\nresult(childrens_number,childrens_array)\r\n\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\nk=min([l.count(1),l.count(2),l.count(3)])\r\nprint(k)\r\nif k!=0:\r\n p1=[]\r\n p2=[]\r\n p3=[]\r\n for i in range(a):\r\n if l[i]==1:\r\n p1.append(i+1)\r\n elif l[i]==2:\r\n p2.append(i+1)\r\n else:\r\n p3.append(i+1)\r\n for i in range(0,k):\r\n print(p1[i],p2[i],p3[i])", "n = int(input())\r\nA = [int(item) for item in input().split()]\r\nones = []\r\ntwos = []\r\nthrees = []\r\nfor i in range(len(A)):\r\n if A[i] == 1:\r\n ones.append(i)\r\n if A[i] == 2:\r\n twos.append(i)\r\n if A[i] == 3:\r\n threes.append(i)\r\nmin_teams = min(len(ones),len(twos),len(threes))\r\nprint(min_teams)\r\ncombination = []\r\nfor i in range(min_teams):\r\n k = [ones[i]+1, twos[i]+1, threes[i]+1]\r\n print(*k)", "n = int(input())\r\ninterests = input()\r\nnew_interests = interests.split(\" \")\r\n\r\n\r\nclass Student:\r\n def __init__(self, index, interest):\r\n self.index = index\r\n self.interest = interest\r\n\r\n def __repr__(self):\r\n return f\"{self.index}\"\r\n\r\n\r\nsport = []\r\ncoding = []\r\nmath = []\r\n\r\nfor i in range(len(new_interests)):\r\n if new_interests[i] == \"1\":\r\n index = i + 1\r\n coder = Student(index, new_interests[i])\r\n coding.append(coder)\r\n if new_interests[i] == \"2\":\r\n index = i + 1\r\n mathematician = Student(index, new_interests[i])\r\n math.append(mathematician)\r\n if new_interests[i] == \"3\":\r\n index = i + 1\r\n sportsman = Student(index, new_interests[i])\r\n sport.append(sportsman)\r\n\r\n\r\nw = min(len(sport), len(math), len(coding))\r\nbest_interest = coding\r\n\r\nif len(sport) < len(coding):\r\n best_interest = sport\r\n if len(math) < len(sport):\r\n best_interest = math\r\nelif len(coding) > len(math):\r\n best_interest = math\r\n\r\nif len(math) > 0 and len(coding) > 0 and len(sport) > 0:\r\n w = min(len(sport), len(math), len(coding))\r\n print(w)\r\n for i in range(len(best_interest)):\r\n print(f\"{coding[i]} {math[i]} {sport[i]}\")\r\nelse:\r\n w = 0\r\n print(w)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\nz=[int(i) for i in input().split()]\r\ny=z\r\no=[]\r\nt=[]\r\nth=[]\r\nc1=0\r\nc2=0\r\nc3=0\r\nteam=0\r\nfor index, i in enumerate(z):\r\n if i==1:\r\n o.append(index+1)\r\n c1+=1\r\n if i==2:\r\n t.append(index+1)\r\n c2+=1\r\n if i==3:\r\n th.append(index+1)\r\n c3+=1\r\nfor i in range(n//3):\r\n if c1!=0 and c2!=0 and c3!=0:\r\n team+=1\r\n c1-=1\r\n c2-=1\r\n c3-=1\r\nprint(team)\r\nfor i in range(team):\r\n print(o[i],end=\" \")\r\n print(t[i],end=\" \")\r\n print(th[i],end=\" \")\r\n print()", "import sys\r\nfrom collections import Counter, deque\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n li = list(map(int, input().split()))\r\n one, two, three = [], [], []\r\n for i in range(n):\r\n if li[i] == 1:\r\n one.append(i)\r\n elif li[i] == 2:\r\n two.append(i)\r\n else:\r\n three.append(i)\r\n\r\n mn = min(len(one), len(two), len(three))\r\n print(mn)\r\n for i in range(mn):\r\n print(one.pop()+1, two.pop()+1, three.pop()+1)\r\n\r\nif __name__ == \"__main__\":\r\n t = 1\r\n # t = int(input())\r\n for _ in range(t):\r\n solve()\r\n", "#variable affectation\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\n\r\n#maximum number of teams\r\nw=min(l.count(1),l.count(2),l.count(3))\r\nprint(w)\r\n\r\n#the index of each team\r\n\r\nfor k in range(w):\r\n ch=[l.index(1)+1,l.index(2)+1,l.index(3)+1]\r\n print(*ch)\r\n l[ch[0]-1],l[ch[1]-1],l[ch[2]-1]=8,8,8\r\n \r\n", "n = int (input())\nl = list(map(int,input().split( )))\nl1 = [l.count(1),l.count(2),l.count(3)]\nans = min(l1)\nprint(ans)\nfor i in range(ans):\n p,m,pe = l.index(1),l.index(2),l.index(3)\n l[p]= -1\n l[m]= -1\n l[pe]= -1\n print(p+1,m+1,pe+1)\n \n\n \t\t\t\t\t\t\t\t\t\t \t\t \t \t \t", "a = int(input())\n\n\nb = list(map(int, input().split()))\nf = {}\nmin_list = min(b.count(1), b.count(2), b.count(3))\nfor i, player in enumerate(b, start=1):\n if player not in f:\n f[player] = []\n if min_list==0:\n break\n if len(f[player]) == min_list:\n continue\n f[player].append(i)\n\nif len(set(f)) == 3:\n output_1 = min(map(len, list(f.values())))\n print(output_1)\n for i in list(zip(*list(f.values()))):\n print(' '.join(map(str, i)))\nelse:\n print(0)", "def main():\r\n n = int(input())\r\n students = [int(i) for i in input().split()]\r\n # Loop and compute using hash_map\r\n hash_map = {1: [], 2: [], 3: []}\r\n for i in range(n):\r\n if students[i] == 1:\r\n hash_map[1].append(i+1)\r\n elif students[i] == 2:\r\n hash_map[2].append(i+1)\r\n else:\r\n hash_map[3].append(i+1)\r\n # Validation check and print output\r\n min_size = float(\"inf\")\r\n for v in hash_map.values():\r\n if len(v) == 0:\r\n print(0)\r\n return\r\n else:\r\n min_size = min(min_size, len(v))\r\n print(min_size)\r\n for i in range(min_size):\r\n print(\"%s %s %s\" % (hash_map[1][i], hash_map[2][i], hash_map[3][i]))\r\n \r\n\r\nmain()", "n = int(input())\nt = list(map(int, input().split()))\n# print(t)\none = []\ntwo = []\nthree = []\nfor index, number in enumerate(t):\n if number == 1:\n one.append(index+1)\n elif number == 2:\n two.append(index+1)\n else:\n three.append(index+1)\n# print(one)\n# print(two)\n# print(three)\nw = min(len(one),len(two),len(three))\nprint(w)\nfor i in range(0,w):\n print(f'{one[i]} {two[i]} {three[i]}')\n \t \t\t\t\t \t\t\t \t \t \t \t\t \t \t", "length = int(input())\r\n\r\nteams = {\r\n 1:[],\r\n 2:[],\r\n 3:[]\r\n }\r\nteam = list(map(int, input().split()))\r\n\r\nfor i,t in enumerate(team):\r\n if t in teams:\r\n teams[t].append(i)\r\n \r\nteam_pair = list(teams.values())\r\nteam_pair = sorted(team_pair,key=len)\r\n\r\nmin_len = len(team_pair[0])\r\n\r\nans = [[str(team_pair[j][i]+1) for j in range(len(team_pair)) ] for i in range(len(team_pair[0]))]\r\n\r\nfinal = \"\"\r\n\r\nfor i in ans :\r\n final = final + \" \".join(i) + \"\\n\"\r\n \r\nprint(min_len)\r\nprint (final)", "n=int(input())\ncount=[0,0,0]\nstudents=[[],[],[]]\ns=list(map(int,input().split()))\nfor i in range(n):\n\tii=s[i]-1\n\tstudents[ii].append(i+1)\n\tcount[ii]+=1\nres_count=min(count)\nprint(res_count)\nfor i in range(res_count):\n\tprint(students[0][i],\n\tstudents[1][i],students[2][i])\n\t", "n=int(input())\r\nl1=[]\r\ne=[]\r\nf=[]\r\ng=[]\r\nl=1\r\na=[int(x) for x in input().split()]\r\nb=min(a.count(1),a.count(2),a.count(3))\r\nprint(b)\r\nfor i in a:\r\n if i==1:\r\n e.append(l)\r\n elif i==2:\r\n f.append(l)\r\n else:\r\n g.append(l)\r\n l+=1 \r\nfor j in range(b):\r\n l1.append([e[j],f[j],g[j]])\r\ns=\"\"\r\nfor i in l1:\r\n for j in i:\r\n s=s+str(j)+\" \"\r\n print(s)\r\n s=\"\"\r\n", "_ = input()\r\nvls = list(map(int, input().split()))\r\n\r\nx = min(min(vls.count(1), vls.count(2)), vls.count(3))\r\nprint(x)\r\n\r\nif x != 0:\r\n matriz = [[] for _ in range(3)]\r\n for i, v in enumerate(vls):\r\n i += 1\r\n if 1 == v:\r\n matriz[0].append(i)\r\n elif 2 == v:\r\n matriz[1].append(i)\r\n else:\r\n matriz[2].append(i)\r\n\r\n for i in range(x):\r\n print(f'{matriz[0][i]} {matriz[1][i]} {matriz[2][i]}')", "n = int(input())\r\nt = list(map(int, input().split()))\r\nindex_of_1 = []\r\nindex_of_2 = []\r\nindex_of_3 = []\r\nfor i in range(n):\r\n if t[i] == 1:\r\n index_of_1.append(i)\r\n elif t[i] == 2:\r\n index_of_2.append(i)\r\n else:\r\n index_of_3.append(i)\r\n\r\nnumber_of_teams = min(len(index_of_1), len(index_of_2), len(index_of_3))\r\nprint(number_of_teams)\r\n\r\nfor i in range(number_of_teams):\r\n print(index_of_1[i]+1, index_of_2[i]+1, index_of_3[i]+1, sep=\" \")", "n = int(input())\r\nmyList = list(map(int , input().split()))\r\nmySet = set(myList)\r\nif len(mySet)!=3:\r\n print(0)\r\nelse:\r\n count = min(myList.count(1),myList.count(2),myList.count(3))\r\n print(count)\r\n for i in range(count):\r\n print(myList.index(1)+1,myList.index(2)+1,myList.index(3)+1)\r\n myList[myList.index(1)]=-1\r\n myList[myList.index(2)]=-1\r\n myList[myList.index(3)]=-1", "from sys import stdin\r\n\r\ndef get_data(students,n):\r\n teams = []\r\n spo = []\r\n math = []\r\n pro = []\r\n cant_teams = 0\r\n for cont in range(n):\r\n if students[cont] == 1:\r\n pro.append([students[cont],cont])\r\n elif students[cont] == 2:\r\n math.append([students[cont],cont])\r\n else:\r\n spo.append([students[cont],cont])\r\n if len(spo) > 0 and len(math) > 0 and len(pro) > 0:\r\n teams.append([math[0][1],pro[0][1],spo[0][1]])\r\n pro.remove(pro[0])\r\n math.remove(math[0])\r\n spo.remove(spo[0])\r\n cant_teams += 1\r\n return [teams,cant_teams]\r\n\r\ndef main():\r\n n = int(stdin.readline())\r\n students = [int(x) for x in stdin.readline().split()]\r\n [teams,num] = get_data(students,n)\r\n print(num)\r\n for t in teams:\r\n print(\"{} {} {}\".format(t[0] + 1,t[1] + 1,t[2] + 1))\r\nmain()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nif l.count(1)>=1 and l.count(2)>=1 and l.count(3)>=1:\r\n print(min(l.count(1),l.count(2),l.count(3)))\r\n for i in range(min(l.count(1),l.count(2),l.count(3))):\r\n print(str(l.index(1)+1)+\" \"+str(l.index(2)+1)+\" \"+str(l.index(3)+1))\r\n l[l.index(1)]=4\r\n l[l.index(2)]=4\r\n l[l.index(3)]=4\r\nelse:\r\n print(\"0\")\r\n", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n l_ = int(input().rstrip())\r\n arr_ = list(map(int, input().rstrip().split()))\r\n a = [0, []]\r\n b = [0, []]\r\n c = [0, []]\r\n for i in range(l_):\r\n if arr_[i] == 1:\r\n a[0] += 1\r\n a[1].append(i)\r\n elif arr_[i] == 2:\r\n b[0] += 1\r\n b[1].append(i)\r\n else:\r\n c[0] += 1\r\n\r\n c[1].append(i)\r\n teams = min(a[0], b[0], c[0])\r\n output(str(teams) + '\\n')\r\n if teams > 0:\r\n for j in range(teams):\r\n output(f'{a[1][j] + 1}'+' '+f'{b[1][j] + 1}'+' '+f'{c[1][j] + 1}'+'\\n')\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nd = {1: [], 2:[], 3:[]}\r\nfor i in range(n):\r\n d[a[i]].append(i + 1)\r\nmin_teams = min(len(d[1]), len(d[2]), len(d[3]))\r\n\r\nprint(min_teams)\r\nfor i in range(min_teams):\r\n print(f\"{d[1][i]} {d[2][i]} {d[3][i]}\")", "x = int(input())\r\nlst = list(map(int, input().split()))\r\none, two, three = [], [], []\r\nfor i in range(x):\r\n if lst[i] == 1:\r\n one.append(i + 1)\r\n elif lst[i] == 2:\r\n two.append(i + 1)\r\n else:\r\n three.append(i + 1)\r\nmn = min(len(one), len(two), len(three))\r\nprint(mn)\r\nfor i in range(mn):\r\n print(one[i], two[i], three[i])", "n = int(input())\r\nt = list(map(int, input().split()))\r\nnum_teams = min(t.count(1), t.count(2), t.count(3))\r\nindex1 = []\r\nindex2 = []\r\nindex3 = []\r\nteams = []\r\nprint(num_teams)\r\nif num_teams > 0:\r\n for i in range(0, len(t)):\r\n if t[i] == 1:\r\n index1.append(i+1)\r\n elif t[i] == 2:\r\n index2.append(i+1)\r\n else:\r\n index3.append(i+1)\r\n\r\n for i in range(0, num_teams):\r\n teams.append((index1[i], index2[i], index3[i]))\r\n \r\n for i in teams:\r\n for j in i:\r\n print(j, end=\" \")\r\n print()", "x=int(input())\r\ny=list(map(int,input().split()))\r\na1=[]\r\na2=[]\r\na3=[]\r\nfor i in range(x):\r\n if y[i] == 1:\r\n a1.append(i)\r\n elif y[i] == 2:\r\n a2.append(i)\r\n else:\r\n a3.append(i)\r\nw=min(len(a1),len(a2),len(a3))\r\nprint(w)\r\nfor i in range(w):\r\n print(a1[i]+1, a2[i]+1, a3[i]+1)", "x=int(input())\r\nx = list(map(lambda q:int(q), input().split(\" \")))\r\nc=0\r\nv=0\r\nf=0\r\nzura=[0]*5000\r\nqasha=[0]*5000\r\nzaur=[0]*5000\r\nfor i in range(len(x)):\r\n if x[i]==1:\r\n zura[c]=i+1\r\n c=c+1\r\n \r\n elif x[i]==2:\r\n qasha[v]=i+1\r\n v=v+1\r\n elif x[i]==3:\r\n zaur[f]=i+1\r\n f=f+1\r\nprint(min(c,v,f))\r\nl=min(c,f,v)\r\nfor i in range(l):\r\n print(zura[i],qasha[i],zaur[i])\r\n", "input();\r\na=[[], [], []]\r\n \r\nfor i, x in enumerate(input().split(), 1):\r\n a[int(x) - 1] += [i]\r\n \r\nprint(min(map(len, a)))\r\nfor x in zip(* a):\r\n print(* x)", "n = int(input())\r\ns = input()\r\na,b,c = [],[],[]\r\nfor i in range(len(s.split())):\r\n if s.split()[i] == '1':\r\n a.append(i+1)\r\n if s.split()[i] == '2':\r\n b.append(i+1)\r\n if s.split()[i] == '3':\r\n c.append(i+1) \r\n\r\nans = min(len(a), len(b), len(c))\r\nprint(ans)\r\nfor j in range(ans):\r\n print(a[j], b[j], c[j])", "n = int(input())\r\nstudents = list(map(int,input().split()))\r\nind_1, ind_2, ind_3 = [],[],[]\r\nfor i in range(n):\r\n if students[i] == 1:\r\n ind_1.append(i)\r\n elif students[i] == 2:\r\n ind_2.append(i)\r\n else:\r\n ind_3.append(i)\r\nmin_len = min(len(ind_1),len(ind_2),len(ind_3))\r\nprint(min_len)\r\nfor i,j,k in zip(ind_1[:min_len],ind_2[:min_len],ind_3[:min_len]):\r\n print(i+1,j+1,k+1)", "n=int(input())#number of people\r\nt=list(map(int,input().split()))\r\na=[]\r\nb=[]\r\nc=[]\r\nfor i in range(len(t)):\r\n if t[i]==1:\r\n a.append(i+1)\r\n elif t[i]==2:\r\n b.append(i+1)\r\n else:\r\n c.append(i+1)\r\nNOT=min(len(a),len(b),len(c)) \r\nif NOT==0:\r\n print (NOT)\r\nelse:\r\n print(NOT)\r\n for j in range(NOT):\r\n print(a[j],b[j],c[j])", "a = int(input())\r\ns1 = []\r\ns2 = []\r\ns3 = []\r\ns = list(map(int, input().split(' ')))\r\nfor i in range(len(s)):\r\n if s[i] == 1:\r\n s1.append(i + 1)\r\n elif s[i] == 2:\r\n s2.append(i + 1)\r\n else:\r\n s3.append(i + 1)\r\na = min(len(s1), len(s2), len(s3))\r\nprint(a)\r\nfor i in range(a):\r\n print(s1[i], s2[i], s3[i])\r\n", "x=int(input())\r\nl=list(map(int,input().split()))\r\nif 1 not in l or 2 not in l or 3 not in l:\r\n print(0)\r\nelse:\r\n x=l.count(1)\r\n y=l.count(2)\r\n z=l.count(3)\r\n a=min(x,y,z)\r\n print(min(x,y,z))\r\n x=[]\r\n y=[]\r\n z=[]\r\n for i in range(len(l)):\r\n if l[i]==1:\r\n x.append(i+1)\r\n elif l[i]==2:\r\n y.append(i+1)\r\n else:\r\n z.append(i+1)\r\n for i in range(a):\r\n print(x[i],y[i],z[i])", "from sys import stdin\t\r\nfrom collections import Counter, defaultdict, deque\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 = readint()\r\n\r\narr = readarray(int)\r\n\r\ncounter = Counter(arr)\r\n\r\nindices = defaultdict(deque)\r\n\r\nfor i in range(n):\r\n\tindices[arr[i]].append(i+1)\r\n\r\n\r\nif len(counter) == 3:\r\n\tans = min(counter.values())\r\n\tprint(ans)\r\n\tfor _ in range(ans):\r\n\t\tprint(indices[1].popleft(), indices[2].popleft(), indices[3].popleft())\r\nelse:\r\n\tprint(0)\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\n# 1 3 1 3 2 1 2\r\n\r\nteam1 = []\r\nteam2 = []\r\nteam3 = []\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n team1.append(i + 1)\r\n elif a[i] == 2:\r\n team2.append(i + 1)\r\n elif a[i] == 3:\r\n team3.append(i + 1)\r\n\r\nmax_teams = min(len(team1), min(len(team2), len(team3)))\r\nprint(max_teams)\r\nfor i in range(max_teams):\r\n print(team1[i], team2[i], team3[i], )\r\n", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogrammers = 0\r\nmathematicians = 0\r\nsportsmen = 0\r\n\r\nfor skill in skills:\r\n if skill == 1:\r\n programmers += 1\r\n elif skill == 2:\r\n mathematicians += 1\r\n else:\r\n sportsmen += 1\r\n\r\nnum_teams = min(programmers, mathematicians, sportsmen)\r\n\r\nprint(num_teams)\r\n\r\nif num_teams > 0:\r\n prog_idx = [i + 1 for i, skill in enumerate(skills) if skill == 1]\r\n math_idx = [i + 1 for i, skill in enumerate(skills) if skill == 2]\r\n sports_idx = [i + 1 for i, skill in enumerate(skills) if skill == 3]\r\n\r\n for i in range(num_teams):\r\n print(prog_idx[i % len(prog_idx)], math_idx[i % len(math_idx)], sports_idx[i % len(sports_idx)])\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jul 23 14:14:14 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet A Problem 28 - CF490-DIV2A\r\n\"\"\"\r\n\r\nkidSkill = [[] for _ in range(3)]\r\n#print(kidSkill)\r\ncount = [0,0,0]\r\nkids = int(input())\r\nskills = list(map(int,input().split()))\r\n\r\nfor i in range(kids):\r\n count[skills[i]-1] += 1\r\n kidSkill[skills[i]-1].append(i+1)\r\n\r\nteamNum = min(count)\r\nif teamNum == 0:\r\n print(0)\r\nelse:\r\n print(teamNum)\r\n for i in range(teamNum):\r\n print(kidSkill[0][i], kidSkill[1][i], kidSkill[2][i])\r\n \r\n ", "n = int(input())\nt = list(map(int, input().split()))\np = m = f = cnt = 0\nw = \"\"\nwhile p < n and m < n and f < n:\n while p < n and t[p] != 1:\n p += 1\n while m < n and t[m] != 2:\n m += 1\n while f < n and t[f] != 3:\n f += 1\n if p < n and m < n and f < n:\n w += str(p + 1) + \" \" + str(m + 1) + \" \" + str(f + 1) + \"\\n\"\n cnt += 1\n p += 1\n m += 1\n f += 1\n \nprint(cnt)\nprint(w)\n\t\t \t \t\t \t\t\t\t\t\t\t \t\t \t \t\t \t \t\t", "# A Team Olympiad\r\n\r\nn = int(input())\r\nlista = input().split()\r\nlista = [int(i) for i in lista]\r\n\r\ndef gifted(n,lista):\r\n lista=lista\r\n dic ={'math':[],'prog':[],'PE':[]}\r\n for i in range(n):\r\n if lista[i] == 1:\r\n dic['math'].append(i+1)\r\n elif lista[i] == 2:\r\n dic['prog'].append(i+1)\r\n else:\r\n dic['PE'].append(i+1)\r\n return dic\r\ngift = gifted(n,lista)\r\nnumbers = len(gift['math']), len(gift['prog']), len(gift['PE'])\r\nminimo = min(numbers)\r\n\r\nif minimo>0:\r\n print(minimo)\r\n for i in range(minimo):\r\n print(\"{} {} {}\".format(gift['math'][i],gift['prog'][i],gift['PE'][i]))\r\nelse:\r\n print(minimo)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nk1=a.count(1)\r\nk2=a.count(2)\r\nk3=a.count(3)\r\nprint(min(k1,k2,k3))\r\nfor x in range(min(k1,k2,k3)):\r\n print(a.index(1)+1,a.index(2)+1,a.index(3)+1)\r\n a[a.index(1)]=4\r\n a[a.index(2)]=4\r\n a[a.index(3)]=4\r\n", "teams = []\nn = int(input())\nstudents = input().split()\ncount = 0\nfound = True\n\nwhile found:\n team = []\n for mem in [\"1\", \"2\", \"3\"]:\n try:\n ind = students.index(mem)\n except ValueError:\n found = False\n break\n else:\n team.append(ind + 1)\n students[ind] = 0\n if found:\n teams.append(team)\n count += 1\n\nprint(count)\nfor team in teams:\n print(*team)", "n = int(input())\ndata = [int(elem) for elem in input().split()]\nprint(team_quantity:=min([data.count(ability) for ability in (1,2,3)]))\nif team_quantity == 0: exit()\nfor _ in range(team_quantity):\n print(tmp:=data.index(1)+1, end = ' '); data[tmp-1] = 7\n print(tmp:=data.index(2)+1, end = ' '); data[tmp-1] = 7\n print(tmp:=data.index(3)+1); data[tmp-1] = 7\n\n\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\nif all(elem in t for elem in [1, 2, 3]):\r\n w = min(t.count(1), t.count(2), t.count(3))\r\nelse:\r\n print(0)\r\n exit()\r\nprint(w)\r\nfor i in range(w):\r\n res = []\r\n for j in range(1,4):\r\n index = t.index(j)\r\n res.append(index+1)\r\n t[index] = 0\r\n print(*res)", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\ncounts = [t.count(i) for i in range(1, 4)]\r\nnum_teams = min(counts)\r\n\r\nprint(num_teams)\r\n\r\nif num_teams == 0:\r\n exit()\r\n\r\nstudents = [[] for _ in range(3)]\r\n\r\nfor i, skill in enumerate(t):\r\n students[skill-1].append(i+1)\r\n\r\nfor i in range(num_teams):\r\n team = []\r\n for j in range(3):\r\n team.append(students[j][i])\r\n print(*team)\r\n", "n = int(input())\nl = input()\nl = l.replace(' ', '')\n\nd = {1: [], 2: [], 3: []}\nfor i in range(n):\n d[int(l[i])].append(i+1)\nk = min(len(d[1]), len(d[2]), len(d[3]))\nprint(k)\nfor i , j, k in zip(d[1], d[2], d[3]):\n print(i, j, k)\n\n\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nt = int(input())\r\nd = dict()\r\nl = list(map(int, input().split()))\r\nfor i in range(t):\r\n if l[i] in d:\r\n d[l[i]] += 1\r\n else:\r\n d[l[i]] = 1\r\nif 1 in d and 2 in d and 3 in d:\r\n ans = min(d.values())\r\n print(ans)\r\n for i in range(ans):\r\n x, y, z = int(l.index(1)), int(l.index(2)), int(l.index(3))\r\n print(x + 1, y + 1, z + 1)\r\n l[x] = 0\r\n l[y] = 0\r\n l[z] = 0\r\nelse:\r\n print(0)\r\n", "n=int(input())\r\ns=[int(x) for x in input().split()]\r\na,b,c = 0,0,0\r\nx=[]\r\ny=[]\r\nz=[]\r\nfor i in range(n):\r\n if s[i] == 1:\r\n a= a+1\r\n x.append(i+1)\r\n elif s[i] == 2:\r\n b= b+1\r\n y.append(i+1)\r\n elif s[i] == 3:\r\n c= c+1\r\n z.append(i+1)\r\nans = min(a,b,c)\r\nprint(ans)\r\nfor i in range(ans):\r\n print(x[i],y[i],z[i])", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = [[], [], []]\r\nfor i in range(n):\r\n t[a[i]-1].append(i+1)\r\nk = min(len(t[0]), len(t[1]), len(t[2]))\r\nprint(k)\r\nfor i in range(k):\r\n print(t[0][i], t[1][i], t[2][i])", "n=int(input())\r\nnumber=[[],[],[]]\r\nfor indx,v in enumerate(input().split(),1):number[int(v)-1]+=[indx]\r\nprint(min(map(len,number)))#[[1, 3, 6], [5, 7], [2, 4]] ->[3,2,2]->2 \r\nfor i in zip(*number):print(*i)", "n = int(input())\r\na = list(map(int,input().split()))\r\nc1,c2,c3 = [],[],[]\r\nr = []\r\nfor i in a:\r\n if i == 1:\r\n c1.append(a.index(i))\r\n a[a.index(i)] = 0\r\n elif i == 2:\r\n c2.append(a.index(i))\r\n a[a.index(i)] = 0\r\n elif i == 3:\r\n c3.append(a.index(i))\r\n a[a.index(i)] = 0\r\nw = min(len(c1),len(c2),len(c3))\r\nfor i in range(w):\r\n arr = []\r\n arr.append(c1[i]+1)\r\n arr.append(c2[i]+1)\r\n arr.append(c3[i]+1)\r\n r.append(arr)\r\n arr = []\r\nprint(w)\r\nfor i in r:\r\n print(*i)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nz=0\r\nk=[]\r\nl=[]\r\nm=[]\r\nfor i in range(n):\r\n if a[i]==1:\r\n k.append(i+1)\r\n x=x+1\r\n elif a[i]==2:\r\n l.append(i+1)\r\n y=y+1\r\n else:\r\n m.append(i+1)\r\n z=z+1\r\nprint(min(x,y,z))\r\nfor i in range(min(x,y,z)):\r\n print(k[i],end=\" \")\r\n print(l[i],end=\" \")\r\n print(m[i],end=\" \")\r\n print()", "a=int(input())\r\nb=input()\r\nb=list(map(int,b.split()))\r\nn1=[]\r\nn2=[]\r\nn3=[]\r\nfor i in range(0,len(b)):\r\n if b[i]==1:\r\n n1.append(i+1)\r\n elif b[i]==2:\r\n n2.append(i+1)\r\n else:\r\n n3.append(i+1)\r\nd=[]\r\nd.append(len(n1))\r\nd.append(len(n2))\r\nd.append(len(n3))\r\nf=min(d)\r\nprint(min(d))\r\nfor t in range(0,f):\r\n if f==0:\r\n print(0)\r\n else:\r\n print(n1[t],n2[t],n3[t])", "def find_teams(n, skills):\r\n programmers = [i for i, skill in enumerate(skills, 1) if skill == 1]\r\n mathematicians = [i for i, skill in enumerate(skills, 1) if skill == 2]\r\n sportsmen = [i for i, skill in enumerate(skills, 1) if skill == 3]\r\n\r\n num_teams = min(len(programmers), len(mathematicians), len(sportsmen))\r\n\r\n teams = []\r\n for i in range(num_teams):\r\n teams.append((programmers[i], mathematicians[i], sportsmen[i]))\r\n\r\n return num_teams, teams\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input()) # Number of children in the school\r\n skills = list(map(int, input().split())) # Skills of each child\r\n\r\n num_teams, teams = find_teams(n, skills)\r\n\r\n print(num_teams)\r\n for team in teams:\r\n print(*team)\r\n", "def solve(n, t):\r\n pr = [i+1 for i in range(n) if t[i] == 1]\r\n mt = [i+1 for i in range(n) if t[i] == 2]\r\n pe = [i+1 for i in range(n) if t[i] == 3]\r\n\r\n maxi = min(len(pr), len(mt), len(pe))\r\n\r\n # Form the teams\r\n formed_teams = [[pr.pop(), mt.pop(), pe.pop()] for _ in range(maxi)]\r\n\r\n\r\n return maxi, formed_teams\r\n\r\ndef main():\r\n n = int(input())\r\n t = list(map(int, input().split()))\r\n maxi, formed_teams = solve(n, t)\r\n\r\n print(maxi) \r\n for team in formed_teams[::-1]:\r\n print(*team) \r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\narr = list(map(int, input().split()))\r\nvec = [[], [], [], []]\r\nfor i in range(n):\r\n vec[arr[i]].append(i + 1)\r\n \r\nmn = min(len(vec[1]), len(vec[2]), len(vec[3]))\r\nprint(mn)\r\nfor i in range(mn):\r\n print(vec[1][i], vec[2][i], vec[3][i])", "n = int(input())\r\nskills = list(map(int, input().split()))\r\nteam_1 = [i + 1 for i, s in enumerate(skills) if s == 1]\r\nteam_2 = [i + 1 for i, s in enumerate(skills) if s == 2]\r\nteam_3 = [i + 1 for i, s in enumerate(skills) if s == 3]\r\nmin_teams = min(len(team_1), len(team_2), len(team_3))\r\nprint(min_teams)\r\nif min_teams > 0:\r\n for i in range(min_teams):\r\n print(team_1[i], team_2[i], team_3[i])", "n = int(input())\r\n\r\nvalues = list(map(int, input().split()))\r\nprogrammers = []\r\nmath = []\r\npe = []\r\n\r\nfor i, value in enumerate(values):\r\n if value == 1:\r\n programmers.append(i+1)\r\n elif value == 2:\r\n math.append(i+1)\r\n else:\r\n pe.append(i+1)\r\n\r\nteam_count = min(len(programmers), len(math), len(pe))\r\nprint(team_count)\r\n\r\nfor i in range(team_count):\r\n print('{} {} {}'.format(programmers[i], math[i], pe[i]))", "# Problem: \r\n# Answer: \r\n\r\n# *\r\n\r\n# Second attempt at the problem. This time I used sorting and and a for loop. I think this will be faster than the last answer.\r\n\r\n# *\r\n\r\n\r\nnumberOfChildren = int(input())\r\n\r\nchildren = [int(i) for i in input().split()]\r\n\r\nteamCounter = 0\r\n\r\nchildrenCopy = children.copy()\r\n\r\ntotalTeams = 0\r\n\r\ntry:\r\n m1 = childrenCopy.count(1)\r\n m2 = childrenCopy.count(2)\r\n m3 = childrenCopy.count(3)\r\n candidates = [m1, m2, m3]\r\n candidates.sort()\r\n totalTeams = candidates[0]\r\n print(totalTeams) # This is the max number of teams.\r\nexcept:\r\n print(0)\r\n quit()\r\n\r\nc1 = []\r\nc2 = []\r\nc3 = []\r\n\r\nfor i in range(numberOfChildren):\r\n\r\n member = children[i]\r\n \r\n if children[i] == 1:\r\n c1.append(i + 1)\r\n if children[i] == 2:\r\n c2.append(i + 1)\r\n if children[i] == 3:\r\n c3.append(i + 1)\r\n\r\n\r\nfor i in range(totalTeams):\r\n p1 = c1[i]\r\n p2 = c2[i]\r\n p3 = c3[i]\r\n print(p1, p2, p3)\r\n", "from math import gcd\r\n\r\n\r\nn = int(input())\r\nchildren = list(map(int, input().split(\" \")))\r\nprogramming = []\r\nmath = []\r\nphi = []\r\nfor i in range(len(children)): \r\n if children[i] == 1:\r\n programming.append(i+1)\r\n elif children[i] == 2:\r\n math.append(i+1)\r\n else:\r\n phi.append(i+1)\r\nteams = min(len(programming), len(math), len(phi))\r\n\r\nif teams > 0:\r\n print(teams)\r\n for i in range(teams):\r\n print(programming[i], math[i], phi[i])\r\nelse:\r\n print(0)", "from collections import Counter\r\nn = int(input())\r\nskills = list(input().split(\" \"))\r\nteams = []\r\nc = Counter(skills)\r\ntc = [c[\"1\"], c[\"2\"], c[\"3\"]]\r\n\r\n#print(c)\r\nprint(min(tc))\r\n\r\nfor i in range(min(tc)):\r\n print(skills.index(\"1\")+1, skills.index(\"2\")+1, skills.index(\"3\")+1)\r\n skills[skills.index(\"1\")] = 0\r\n skills[skills.index(\"2\")] = 0\r\n skills[skills.index(\"3\")] = 0\r\n\r\n", "n = int(input())\na = [i for i in input().split()]\ns1 = []\ns2 = []\ns3 = []\ni = 0\nwhile i < len(a):\n if a[i] == '1':\n s1.append(i + 1)\n elif a[i] == '2':\n s2.append(i + 1)\n else:\n s3.append(i + 1)\n i += 1\ndodoo = min(len(s1), len(s2), len(s3))\n\nprint(dodoo)\nif dodoo:\n for i in range(dodoo):\n print(s1[i], s2[i], s3[i])\n\n\n \t \t\t\t \t\t \t\t \t \t \t", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\nprog, math, pe = [], [], []\r\nprogn, mathn, pen = 0, 0, 0\r\nd = {\r\n 1: prog,\r\n 2: math,\r\n 3: pe,\r\n}\r\n\r\nfor i in range(n):\r\n d[t[i]].append(i + 1)\r\n if t[i] == 1:\r\n progn += 1\r\n elif t[i] == 2:\r\n mathn += 1\r\n else:\r\n pen += 1\r\n\r\ntn = min(progn, mathn, pen)\r\nprint(tn)\r\n\r\nfor i in range(tn):\r\n print(prog[i], math[i], pe[i])\r\n", "n=int(input())\r\nlist1=list(map(str,input().split()))\r\nlist2=[]\r\nlist3=[]\r\nb=0\r\nif \"1\" not in list1 or \"2\" not in list1 or \"3\" not in list1:\r\n print(0)\r\n exit()\r\nelse:\r\n #x---->index///i---->element\r\n for x in list1:\r\n if len(list2)==0 and \"1\" in list1 :\r\n a=list1.index(\"1\")\r\n list2.append(str(a+1))\r\n list1[a]=\" \"\r\n elif len(list2)==1 and \"2\" in list1:\r\n a=list1.index(\"2\")\r\n list2.append(str(a+1))\r\n list1[a]=\" \"\r\n elif len(list2)==2 and \"3\" in list1:\r\n b+=1\r\n a=list1.index(\"3\")\r\n list2.append(str(a+1))\r\n list1[a]=\" \"\r\n list3+=list2\r\n list2=[]\r\nprint(b)\r\na=1\r\nfor x in range(len(list3)):\r\n if a!=3:\r\n print(list3[x],end=\" \")\r\n else:\r\n print(list3[x])\r\n a+=1", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\nm = min([t.count(1), t.count(2), t.count(3)])\r\nprint(m)\r\nfor i in range(m):\r\n one, two, three = t.index(1), t.index(2), t.index(3)\r\n print(one + 1, two + 1, three + 1)\r\n t[one], t[two], t[three] = 0, 0, 0", "n = int(input())\r\nl = list(map(int,input().split()))\r\nc1 = l.count(1)\r\nc2 = l.count(2)\r\nc3= l.count(3)\r\n\r\ni1 = [i+1 for i in range(n) if l[i] == 1]\r\ni2 = [i+1 for i in range(n) if l[i] == 2]\r\ni3 = [i+1 for i in range(n) if l[i] == 3]\r\n\r\nif c1 == 0 or c2 == 0 or c3 == 0 :\r\n print(0)\r\nelse :\r\n m = min(c1,c2,c3)\r\n print(m)\r\n for i in range(m) :\r\n print(i1[i], i2[i], i3[i])\r\n", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprog, math, sport = [], [], []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n prog.append(i + 1)\r\n elif skills[i] == 2:\r\n math.append(i + 1)\r\n else:\r\n sport.append(i + 1)\r\nteams = min(len(prog), len(math), len(sport))\r\n\r\nprint(teams)\r\n\r\nfor i in range(teams):\r\n print(prog[i], math[i], sport[i])\r\n", "n = int(input())\r\nt = input()\r\nt = t.replace(\" \",\"\")\r\nn_teams = min(t.count(\"1\"), t.count(\"2\"), t.count(\"3\"))\r\nindex1 = index2 = index3 = 0\r\n\r\nprint(n_teams)\r\nfor i in range(n_teams):\r\n index1 = t.index(\"1\",index1)+1\r\n index2 = t.index(\"2\",index2)+1\r\n index3 = t.index(\"3\",index3)+1\r\n \r\n print(index1, index2, index3) ", "n=int(input())\r\na=list(map(int,input().split()))\r\np=[]\r\nm=[]\r\ne=[]\r\nfor i in range(0,len(a)):\r\n if a[i]==1:\r\n p.append(i+1)\r\n elif a[i]==2:\r\n m.append(i+1)\r\n elif a[i]==3:\r\n e.append(i+1)\r\n'''\r\nprint(a)\r\nprint(p)\r\nprint(m)\r\nprint(e)\r\n'''\r\nb=[]\r\nb.append(len(p))\r\nb.append(len(m))\r\nb.append(len(e))\r\nn=min(b)\r\nprint(n)\r\nif min(b)!=0:\r\n for i in range(0,n):\r\n print(p[i],m[i],e[i])\r\n\r\n ", "n = int(input())\n\nprog = []\nmaths = []\npe = []\nfor i, stud in enumerate(map(int, input().split()), 1):\n lst = prog if stud == 1 else maths if stud == 2 else pe\n lst.append(i)\n\nnum_teams = min(len(prog), len(maths), len(pe))\nprint(num_teams)\nfor i in range(num_teams):\n print(prog[i], maths[i], pe[i])\n", "students= int(input())\r\nskils = list(map(int,input().split()))\r\nprogs = []\r\nmaths = []\r\neps = []\r\nfor i in skils:\r\n c = skils.index(i)\r\n if i == 1:\r\n progs.append(c+1)\r\n elif i == 2:\r\n maths.append(c+1)\r\n elif i == 3:\r\n eps.append(c+1)\r\n skils[c]=\"#\"\r\n\r\nlens = [len(progs),len(maths),len(eps)]\r\nlens.sort()\r\nsmallest = lens[0]\r\nprint(smallest)\r\n\r\nprogs.sort(reverse=1)\r\nmaths.sort(reverse=1)\r\neps.sort(reverse=1)\r\n\r\nfor i in range(smallest):\r\n print(progs[i],maths[i],eps[i])", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\no = []\r\nt = []\r\nth = []\r\n\r\nfor i in range(len(l)) :\r\n if l[i]==1 : o.append(i+1)\r\n elif l[i]==2 : t.append(i+1)\r\n else : th.append(i+1)\r\nm = min(len(o), len(t), len(th))\r\nif m==0 :\r\n print(0)\r\nelse :\r\n print(m)\r\n for i in range(m) :\r\n a = o.pop()\r\n b = t.pop()\r\n c = th.pop()\r\n print(a, b, c)\r\n", "\r\nn = int(input())\r\n\r\nt = list(map(int,input().split()))\r\n\r\na = []\r\nb = []\r\nc = []\r\nl1 =0\r\nl2 =0\r\nl3 =0\r\n\r\nr = len(t)\r\n\r\nfor i in range(r):\r\n if t[i] == 1:\r\n a.append(i+1)\r\n l1+=1\r\n elif t[i] == 2:\r\n b.append(i+1)\r\n l2 += 1\r\n elif t[i] == 3:\r\n c.append(i+1)\r\n l3 += 1\r\n\r\nprint(min(l1,l2,l3))\r\n\r\nfor i in range(min(l1,l2,l3)):\r\n print(a[i],b[i],c[i])\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nx, y, z = [], [], []\r\nfor i in range(n):\r\n if a[i] == 1:\r\n x.append(i)\r\n elif a[i] == 2:\r\n y.append(i)\r\n else:\r\n z.append(i)\r\n\r\ns = 0\r\nans = ''\r\nwhile 0 not in [len(x), len(y), len(z)]:\r\n s += 1\r\n ans += f'{x[0]+1} {y[0]+1} {z[0]+1}\\n'\r\n\r\n del x[0]\r\n del y[0]\r\n del z[0]\r\n\r\nprint(s)\r\nprint(ans)\r\n \r\n \r\n \r\n", "input()\r\nstudents = [int(i) for i in input().split(' ')]\r\nprog=[]\r\nmath=[]\r\npe =[]\r\nfor i in range(len(students)):\r\n if(students[i] == 1):\r\n prog.append(i+1)\r\n elif(students[i]==2):\r\n math.append(i+1)\r\n elif(students[i]==3):\r\n pe.append(i+1)\r\nmin_len = min(len(prog),len(math),len(pe))\r\nif(min_len >= 1):\r\n print(min_len)\r\n for i in range(min_len):\r\n print(prog[i],math[i],pe[i])\r\nelse:\r\n print('0')", "n = int(input())\r\nkids = [int(kid) for kid in input().split()]\r\nteam_count = min(kids.count(1), kids.count(2), kids.count(3))\r\nprint(team_count)\r\nfor _ in range(team_count):\r\n s = [1, 2, 3]\r\n for i in range(n):\r\n if len(s) == 0:\r\n break\r\n if kids[i] in s:\r\n print(i+1, end = ' ')\r\n s.remove(kids[i])\r\n kids[i] = 0\r\n print()", "input();m=[[],[],[]]\r\nfor i,x in enumerate(input().split(),1):m[int(x)-1]+=[i]\r\nprint(min(map(len,m)))\r\nfor x in zip(*m):print(*x)", "#****************************************************\r\n#***************Shariar Hasan************************\r\n#**************CSE CU Batch 18***********************\r\n#****************************************************\r\nimport math\r\nimport re\r\nimport random\r\ndef solve():\r\n #for i in range(int(input())):\r\n for i in range(1):\r\n n = int(input())\r\n a = [int(x) for x in input().split()]\r\n one = []\r\n two = []\r\n three = []\r\n if(1 not in a or 2 not in a or 3 not in a):\r\n print(0)\r\n else:\r\n for i in range(n):\r\n if(a[i] == 1): one.append(i+1)\r\n elif(a[i] == 2): two.append(i+1)\r\n else: three.append(i+1)\r\n min_n = min(len(one), len(two), len(three))\r\n print(min_n)\r\n for i in range(min_n):\r\n print(one[i], two[i], three[i])\r\n\r\n\r\n\r\n\r\n\r\nsolve()", "n=int(input())\r\na=list(map(int,input().split()))\r\na1=[]\r\na2=[]\r\na3=[]\r\nl1,l2,l3 = 0,0,0\r\nfor x in range(1,n+1):\r\n if a[x-1]==1:\r\n a1.append(x)\r\n l1+=1\r\n elif a[x-1]==2:\r\n a2.append(x)\r\n l2+=1\r\n else:\r\n a3.append(x)\r\n l3+=1\r\nk=min(l1,l2,l3)\r\nprint(k)\r\nfor x in range(k):\r\n print(a1[x],a2[x],a3[x])", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\ncounts = [skills.count(1), skills.count(2), skills.count(3)]\r\nteams = min(counts)\r\nprint(teams)\r\n\r\nif teams > 0:\r\n team1 = []\r\n team2 = []\r\n team3 = []\r\n for i in range(n):\r\n if skills[i] == 1:\r\n team1.append(i+1)\r\n elif skills[i] == 2:\r\n team2.append(i+1)\r\n else:\r\n team3.append(i+1)\r\n if len(team1) == teams and len(team2) == teams and len(team3) == teams:\r\n break\r\n\r\n for i in range(teams):\r\n print(team1[i], team2[i], team3[i])\r\n", "n = int(input())\r\narr = input().split(' ')\r\nd1,d2,d3 = [],[],[]\r\nfor i,t in enumerate(arr):\r\n if t =='1':\r\n d1.append(i+1)\r\n elif t=='2':\r\n d2.append(i+1)\r\n else:\r\n d3.append(i+1)\r\nnum = min([len(d1),len(d2),len(d3)])\r\nprint(num)\r\nfor i in range(num):\r\n print(d1[i],end=' ')\r\n print(d2[i],end=' ')\r\n print(d3[i])\r\n", "for i in range(1):\r\n t = int(input())\r\n lst = list(map(int, input().split()))\r\n expert1 = []\r\n expert2 = []\r\n expert3 = []\r\n \r\n for i in range(len(lst)):\r\n if lst[i] == 1:\r\n expert1.append(i+1)\r\n if lst[i] == 2:\r\n expert2.append(i+1)\r\n if lst[i] == 3:\r\n expert3.append(i+1)\r\n \r\n mn = min(len(expert1), min(len(expert2), len(expert3)))\r\n \r\n print(mn)\r\n for i in range(mn):\r\n print(expert1[i], end=\" \")\r\n print(expert2[i], end=\" \")\r\n print(expert3[i])\r\n \r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nc = []\r\nd = []\r\ni =0\r\nwhile i < n:\r\n if(a[i]==1):\r\n b.append(i+1)\r\n elif(a[i]==2):\r\n c.append(i+1)\r\n elif(a[i]==3):\r\n d.append(i+1)\r\n i+=1\r\nk = min(len(b), len(c), len(d))\r\ni = 0\r\nprint(k)\r\nwhile i < k:\r\n print(b[i], c[i], d[i])\r\n i +=1", "n = int(input())\r\nL = [int(x) for x in input().split()]\r\n\r\nO = []\r\nTw = []\r\nTh = []\r\n\r\nn1 = 0\r\nn2 = 0\r\nn3 = 0\r\nfor i in range (0,n):\r\n if L[i]==1:\r\n O.append(i+1)\r\n n1+=1\r\n elif L[i]==2:\r\n Tw.append(i+1)\r\n n2+=1\r\n else:\r\n Th.append(i+1)\r\n n3+=1\r\n k = min(n1,n2,n3)\r\nprint(k)\r\n\r\nfor i in range (0,k): \r\n print(O[i],Tw[i],Th[i])\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\np=[]\r\nd=[]\r\nm=[]\r\nfor i in range(n):\r\n if (arr[i]==1):\r\n p.append(i+1)\r\n if (arr[i]==2):\r\n d.append(i+1)\r\n if (arr[i]==3):\r\n m.append(i+1)\r\na=arr.count(1)\r\nb=arr.count(2)\r\nc=arr.count(3)\r\nif a==0 or b==0 or c==0:\r\n print(0)\r\nelse:\r\n c=min(a,min(b,c))\r\n print(c)\r\n for i in range(c):\r\n print(p[i],end=\" \")\r\n print(d[i],end=\" \")\r\n print(m[i],end=\" \")\r\n print()\r\n \r\n ", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogramming = []\r\nmaths = []\r\npe = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n maths.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\nnum_teams = 0\r\nteams = []\r\n\r\nwhile len(programming) > 0 and len(maths) > 0 and len(pe) > 0:\r\n team = [programming.pop(), maths.pop(), pe.pop()]\r\n teams.append(team)\r\n num_teams += 1\r\n\r\nprint(num_teams)\r\nfor team in teams:\r\n print(*team)\r\n", "n=int(input())\narr=[int(i) for i in input().split()]\nmath=[]\nprog=[]\npe=[]\nfor i in range (n):\n if arr[i] == 1:\n prog.append(i+1)\n elif arr[i]== 2 :\n math.append (i +1)\n else :\n pe.append(i+1)\nmx=min(len(math),len(prog),len(pe))\nprint(mx)\n\nfor i in range (mx):\n print(prog[i],math[i],pe[i])\n\n\n\t \t\t\t\t \t \t \t\t \t\t \t \t\t \t \t", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nteams = [[], [], []] # initialize the list of teams\r\n\r\n# assign students to teams based on their skill level\r\nfor i in range(n):\r\n skill = students[i]\r\n if skill == 1:\r\n teams[0].append(i+1)\r\n elif skill == 2:\r\n teams[1].append(i+1)\r\n else:\r\n teams[2].append(i+1)\r\n\r\n# check if each team has at least one member\r\nif len(teams[0]) == 0 or len(teams[1]) == 0 or len(teams[2]) == 0:\r\n print(0) # if any team is empty, no matches can be played\r\nelse:\r\n num_matches = min(len(teams[0]), len(teams[1]), len(teams[2]))\r\n print(num_matches)\r\n\r\n # print the indices of the team members for each match\r\n for i in range(num_matches):\r\n print(teams[0][i], teams[1][i], teams[2][i])\r\n", "n = int(input())\r\nt = input().split()\r\nf = ['1', '2', '3']\r\na = min([t.count(i) for i in f])\r\nprint(a)\r\ns = []\r\nl = [[i for i in range(n) if t[i] == j] for j in f]\r\nfor i in range(a):\r\n r = []\r\n for x in l:\r\n r.append(x[i]+1)\r\n s.append(r)\r\nprint('\\n'.join(list(map(lambda x: ' '.join(list(map(str, x))), s))))", "n = int(input()) # Number of children\r\nskills = list(map(int, input().split())) # Skills of each child\r\n\r\nprogrammers = [] # Children with programming skills\r\nmathematicians = [] # Children with math skills\r\nathletes = [] # Children with PE skills\r\n\r\n# Separate children by skill type\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programmers.append(i + 1)\r\n elif skills[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n athletes.append(i + 1)\r\n\r\n# Calculate the maximum number of teams\r\nteams = min(len(programmers), len(mathematicians), len(athletes))\r\n\r\n# Print the number of teams\r\nprint(teams)\r\n\r\n# Form and print the teams\r\nfor i in range(teams):\r\n print(programmers[i], mathematicians[i], athletes[i])", "_ = int(input())\r\nl=list(map(int,input().split()))\r\nl1=[]\r\nl1.append(l.count(1))\r\nl1.append(l.count(2))\r\nl1.append(l.count(3))\r\nx=min(l1)\r\nprint(x)\r\nfor i in range(x):\r\n print(l.index(3)+1,l.index(2)+1,l.index(1)+1)\r\n l[l.index(3)]=-1\r\n l[l.index(2)]=-1\r\n l[l.index(1)]=-1\r\n ", "x = int(input())\r\narr = list(map(int, input().split()))\r\nmini = min(arr.count(3), arr.count(2), arr.count(1))\r\nprint(mini)\r\nfor i in range(mini):\r\n print(arr.index(1)+1, arr.index(2)+1, arr.index(3)+1)\r\n arr[arr.index(1)] = 0\r\n arr[arr.index(2)] = 0\r\n arr[arr.index(3)] = 0\r\n", "n, *T = map(int, open(0).read().split())\r\none = []\r\ntwo = []\r\nthree = []\r\nN = [0, 0, 0]\r\nfor i, t in enumerate(T):\r\n if t == 1:\r\n one.append(i + 1)\r\n N[0] += 1\r\n elif t == 2:\r\n two.append(i + 1)\r\n N[1] += 1\r\n else:\r\n three.append(i + 1)\r\n N[2] += 1\r\nresult = min(N)\r\nprint(result)\r\nfor _ in range(result):\r\n print(one.pop(), two.pop(), three.pop())", "def main():\r\n n = int(input())\r\n lst = [int(i) for i in input().split()]\r\n count = min([lst.count(i) for i in range(1, 4)])\r\n print(count)\r\n for _ in range(count):\r\n tmp = []\r\n for i in range(1, 4):\r\n index = lst.index(i)\r\n tmp.append(index + 1)\r\n lst[index] = 0\r\n print(*tmp)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def solve(t):\r\n indicesArray = [[] for _ in range(3)]\r\n\r\n for i in range(len(t)):\r\n indicesArray[t[i] - 1].append(i + 1)\r\n\r\n result = []\r\n w = min(len(indices) for indices in indicesArray)\r\n result.append(str(w))\r\n\r\n for i in range(w):\r\n result.append(buildTeam(indicesArray, i))\r\n\r\n return \"\\n\".join(result)\r\n\r\ndef buildTeam(indicesArray, teamIndex):\r\n return \" \".join(str(indices[teamIndex]) for indices in indicesArray)\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n t = list(map(int, input().split()))\r\n print(solve(t))", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nteam_1 = []\r\nteam_2 = []\r\nteam_3 = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n team_1.append(i + 1)\r\n elif skills[i] == 2:\r\n team_2.append(i + 1)\r\n elif skills[i] == 3:\r\n team_3.append(i + 1)\r\n\r\nmin_teams = min(len(team_1), len(team_2), len(team_3))\r\n\r\nprint(min_teams)\r\n\r\nfor i in range(min_teams):\r\n print(team_1[i], team_2[i], team_3[i])\r\n", "N = int(input())\nt_data = input().split()\nif t_data.count('1') == 0 or t_data.count('2') == 0 or t_data.count('3') == 0:\n print('0')\n exit\nelse:\n t1 = [(i+1, t_data[i]) for i in range(N) if t_data[i] == '1']\n t2 = [(i+1, t_data[i]) for i in range(N) if t_data[i] == '2']\n t3 = [(i+1, t_data[i]) for i in range(N) if t_data[i] == '3']\n teams = []\n team_counter = 0\n while True:\n if len(t1)-1 < team_counter or len(t2)-1 < team_counter or len(t3)-1 < team_counter:\n break\n teams.append([t1[team_counter][0], t2[team_counter][0], t3[team_counter][0]])\n team_counter += 1\n print(team_counter)\n print(\"\\n\".join(\" \".join(map(str, line)) for line in teams))\n\t\t \t\t\t \t \t \t\t\t \t\t \t \t\t\t", "n=int(input())\r\np=list(map(int,input().split(' ')))\r\np1=p.count(1)\r\np2=p.count(2)\r\np3=p.count(3)\r\nt=min(p1,p2,p3)\r\nprint(t)\r\nfor i in range(1,t+1):\r\n x=p.index(1)\r\n y=p.index(2)\r\n z=p.index(3)\r\n res=f'{x+1} {y+1} {z+1}'\r\n print(res)\r\n p[x]=0\r\n p[y]=0\r\n p[z]=0\r\n", "#A. Team Olympiad\r\nn = int(input())\r\ntalents = [int(x) for x in input().split()]\r\ntal = [[],[],[]]\r\n\r\nfor i in range(n):\r\n tal[talents[i]-1].append(i+1)\r\nteam_c = min(len(tal[0]),min(len(tal[1]),len(tal[2])))\r\nprint(team_c)\r\nfor i in range(team_c):\r\n print(str(tal[0][i])+\" \"+str(tal[1][i])+\" \"+str(tal[2][i]))", "input()\r\na=input().split()\r\nl=[]\r\none=[]\r\ntwo=[]\r\nthree=[]\r\nfor i in range(len(a)):\r\n if a[i]=='1':\r\n one.append(i+1)\r\n elif a[i]=='2':\r\n two.append(i+1)\r\n else:\r\n three.append(i+1)\r\nif len(one)==min(len(one),len(two),len(three)):\r\n for i in range(len(one)):\r\n l.append([str(one[i]),str(two[i]),str(three[i])])\r\nelif len(two)==min(len(one),len(two),len(three)):\r\n for i in range(len(two)):\r\n l.append([str(one[i]),str(two[i]),str(three[i])])\r\nelse:\r\n for i in range(len(three)):\r\n l.append([str(one[i]),str(two[i]),str(three[i])])\r\nprint(len(l))\r\nfor i in l:\r\n print(' '.join(i))", "def main():\r\n n, *a = map(int, open(0).read().split())\r\n s = min(a.count(1), a.count(2), a.count(3))\r\n print(s)\r\n d = {1:[], 2:[], 3:[]}\r\n for k, v in enumerate(a):\r\n d[v].append(k+1)\r\n for i in range(s):\r\n print(d[1][i], d[2][i], d[3][i])\r\n\r\nmain()\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\na1=[]\r\na2=[]\r\na3=[]\r\nfor i in range(len(s)):\r\n if s[i]==1:\r\n a1.append(i+1)\r\n elif s[i]==2:\r\n a2.append(i+1)\r\n else :\r\n a3.append(i+1)\r\nif min(len(a1),len(a2),len(a3))<1:\r\n print(0)\r\nelse :\r\n print(min(len(a1),len(a2),len(a3)))\r\n for i in range(min(len(a1),len(a2),len(a3))):\r\n print(a1[i],a2[i],a3[i])\r\n \r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\np=a.count(1)\r\nq=a.count(2)\r\nr=a.count(3)\r\nz=(min(p,q,r))\r\nprint(z)\r\nfor i in range(z):\r\n print(a.index(1)+1,a.index(2)+1,a.index(3)+1)\r\n a[a.index(1)]=5\r\n a[a.index(2)]=5\r\n a[a.index(3)]=5", "n = int(input()) # Read the number of children\r\nt = list(map(int, input().split())) # Read the skills of the children\r\n\r\nprogrammers = [] # Indices of children good at programming\r\nmathematicians = [] # Indices of children good at maths\r\nsportsmen = [] # Indices of children good at PE\r\n\r\n# Populate the lists based on skills\r\nfor i in range(n):\r\n if t[i] == 1:\r\n programmers.append(i + 1)\r\n elif t[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n sportsmen.append(i + 1)\r\n\r\nmin_teams = min(len(programmers), len(mathematicians), len(sportsmen)) # Calculate the maximum number of teams\r\n\r\nprint(min_teams) # Print the largest possible number of teams\r\n\r\nif min_teams > 0:\r\n for i in range(min_teams):\r\n print(programmers[i], mathematicians[i], sportsmen[i]) # Print the indices of children forming teams\r\n", "n = int(input())\r\nlst = list( map(int, input().split()) )\r\n\r\na = []\r\nb = []\r\nc = []\r\n\r\nfor i in range( len(lst) ):\r\n if lst[i] == 1:\r\n a.append(i+1)\r\n elif lst[i] == 2:\r\n b.append(i+1)\r\n else:\r\n c.append(i+1)\r\n\r\nteams = min(len(a), len(b), len(c))\r\nprint(teams)\r\nfor i in range(teams):\r\n print(a[i], b[i], c[i])\r\n", "\n\n\n\n# Press the green button in the gutter to run the script.\nimport math\nfrom builtins import input, print\nimport collections\nfrom fractions import Fraction\nfrom math import gcd\nimport math\n\nif __name__ == '__main__':\n # no_orders, ice_cream = list(map(int, input().split(\" \")))\n students = int(input())\n skill_no = list(map(int, input().split(\" \")))\n skills_dict = {\n 1: [],\n 2: [],\n 3: []\n }\n for i in range(len(skill_no)):\n skills_dict[skill_no[i]].append(i+1)\n\n teams = min(len(skills_dict[1]), len(skills_dict[2]), len(skills_dict[3]))\n print(teams)\n # print(skills_dict)\n\n while(len(skills_dict[1]) and len(skills_dict[2]) and len(skills_dict[3])):\n print(skills_dict[1].pop(0), skills_dict[2].pop(0), skills_dict[3].pop(0))\n\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "def solve():\r\n n = int(input())\r\n t = [int(x) for x in input().split()]\r\n a = []\r\n b = []\r\n c = []\r\n\r\n for i in range(n):\r\n if t[i] == 1:\r\n a.append(i + 1)\r\n if t[i] == 2:\r\n b.append(i + 1)\r\n if t[i] == 3:\r\n c.append(i + 1)\r\n\r\n d = min(len(a), len(b), len(c))\r\n print(d)\r\n if d > 0:\r\n for j in range(d):\r\n print(a[j], b[j], c[j])\r\n\r\n\r\nT = 1\r\n# T = int(input())\r\n\r\nfor _ in range(T):\r\n solve()", "n = int(input())\r\nstu = [int(x) for x in input().split()]\r\nif len(set(stu)) != 3:\r\n print(0)\r\nelse:\r\n smallest = stu.count(sorted(stu, key=lambda q: stu.count(q))[0])\r\n groups = []\r\n for j in range(smallest):\r\n subgroup = []\r\n for q in range(1, 4):\r\n subgroup.append(stu.index(q)+1)\r\n stu[stu.index(q)] = 0\r\n groups.append(subgroup)\r\n\r\n print(smallest)\r\n for w in groups:\r\n print(*w)\r\n", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nfrq = [0] * 4\r\n\r\ninds = []\r\n\r\nfor i in range(4):\r\n inds.append([])\r\n \r\nfor i in range(n):\r\n frq[lst[i]] += 1\r\n inds[lst[i]].append(i)\r\n \r\nm = min(frq[1:])\r\nprint(m)\r\n\r\nfor i in range(m):\r\n for j in inds[1:]:\r\n print(j[i] + 1, end=\" \")\r\n print()", "s = int(input())\r\narr = input().split()\r\nA = []\r\nB = []\r\nC = []\r\nfor i in range(s):\r\n if arr[i] == '1':\r\n A.append(i)\r\n elif arr[i] == '2':\r\n B.append(i)\r\n elif arr[i] == '3':\r\n C.append(i)\r\nresult = []\r\n\r\nl = min(len(A), len(B), len(C))\r\nfor i in range(l):\r\n result.append(str(A[i]+1) + \" \" + str(B[i]+1) + \" \" + str(C[i]+1))\r\nprint(l)\r\nfor i in result:\r\n print(i)", "n = int(input())\r\ns = list(map(int, input().split()))\r\n_1 = s.count(1); _2 = s.count(2); _3 = s.count(3)\r\nprint(min(_1, _2, _3))\r\nfor team in range(min(_1, _2, _3)):\r\n print(s.index(1) + 1, s.index(2) + 1, s.index(3) + 1)\r\n s[s.index(1)] = 0; s[s.index(2)] = 0; s[s.index(3)] = 0\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\na=l.count(1);b=l.count(2);c=l.count(3)\r\nw = min(a,b,c)\r\nprint(w)\r\nif(w!=0):\r\n for i in range(w):\r\n ind1 = l.index(1)\r\n ind2 = l.index(2)\r\n ind3 = l.index(3)\r\n l[ind1]=0;l[ind2]=0;l[ind3]=0\r\n print(ind1+1,ind2+1,ind3+1)", "n=int(input())\r\nlis=list(map(int,input().split()))\r\nteams=[[],[],[]]\r\nfor i in range(n):\r\n if lis[i]==1:\r\n teams[0].append(i+1)\r\n elif lis[i]==2:\r\n teams[1].append(i+1)\r\n elif lis[i]==3:\r\n teams[2].append(i+1)\r\nval=min(len(teams[0]),len(teams[1]),len(teams[2]))\r\nprint(val)\r\nfor i in range(val):\r\n print(teams[0][i],teams[1][i],teams[2][i])", "n = int(input())\r\nl = list(map(int,input().split()))\r\nd = {1:0,2:0,3:0}\r\nfor it in l:\r\n d[it]+=1\r\nans=min(d.values())\r\nprint(ans)\r\nif ans==0:\r\n exit()\r\nll = list()\r\na1=10000\r\na2=10000\r\na3=10000\r\nfor i in range(n):\r\n ll.append((l[i],i+1))\r\n if l[i]==1:\r\n a1=min(a1,i+1)\r\n if l[i]==2:\r\n a2=min(a2,i+1)\r\n if l[i]==3:\r\n a3=min(a3,i+1)\r\nll.sort()\r\na1 = ll.index((1,a1))\r\na2 = ll.index((2,a2))\r\na3 = ll.index((3,a3))\r\nfor i in range(ans):\r\n print(ll[a1][1],ll[a2][1],ll[a3][1])\r\n a1+=1;a2+=1;a3+=1", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1,l2,l3=[],[],[]\r\nfor i in range(len(l)):\r\n if l[i]==1:\r\n l1.append(i+1)\r\n elif l[i]==2:\r\n l2.append(i+1)\r\n else:\r\n l3.append(i+1)\r\na=min(len(l1),len(l2),len(l3))\r\nprint(a)\r\nfor i in range(a):\r\n print(l1[i],l2[i],l3[i])", "n=int(input())\r\nm=list(map(int,input().split()))\r\na=m.count(1)\r\nb=m.count(2)\r\nc=m.count(3)\r\nprint(min(a,b,c))\r\na1=[]\r\nb1=[]\r\nc1=[]\r\nfor i in range(n):\r\n if m[i]==1:\r\n a1.append(i+1)\r\n if m[i]==2:\r\n b1.append(i+1)\r\n if m[i]==3:\r\n c1.append(i+1)\r\nfor i in range(min(a,b,c)):\r\n print(a1[i], end=' ')\r\n print(b1[i], end=' ')\r\n print(c1[i])", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\nif 1 not in students or 2 not in students or 3 not in students or n < 3:\r\n print(0)\r\nelse:\r\n w = min(students.count(1), students.count(2), students.count(3))\r\n print(w)\r\n for i in range(w):\r\n a, b, c = students.index(1) + 1, students.index(2) + 1, students.index(3) + 1\r\n print(a, b, c)\r\n students[a - 1] = 0\r\n students[b - 1] = 0\r\n students[c - 1] = 0\r\n # print(students)\r\n", "input()\r\n*t,=map(int,input().split())\r\nprint(x:=min(t.count(1),t.count(2),t.count(3)))\r\nwhile x!=0:\r\n print(t.index(1)+1,t.index(2)+1,t.index(3)+1)\r\n t[t.index(1)]=0\r\n t[t.index(2)]=0\r\n t[t.index(3)]=0\r\n x-=1", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nans=[]\r\nwhile True:\r\n if (1 in a) and (2 in a) and (3 in a):\r\n a1=a.index(1)+1\r\n a2=a.index(2)+1\r\n a3=a.index(3)+1\r\n a[a1-1]=0\r\n a[a2-1]=0\r\n a[a3-1]=0\r\n ans.append([a1,a2,a3])\r\n else:\r\n break\r\nprint(len(ans))\r\nfor i in ans:\r\n print(*i)", "num=int(input())\r\na=[[],[],[]]\r\nfor i,j in enumerate(input().split()):\r\n a[int(j)-1].append(i+1)\r\nprint(min(map(len,a)))\r\nfor b in zip(*a):\r\n print(b[0],b[1],b[2])", "n=int(input())\r\nss=[*map(int,input().split())]\r\na=[]\r\n\r\nfor i,s in enumerate(ss):\r\n if 1 not in ss or 2 not in ss or 3 not in ss:\r\n break\r\n if s==1:\r\n s2 =ss.index(2)+1\r\n s3 =ss.index(3)+1\r\n a.append([i+1,s2,s3])\r\n ss[i]=0\r\n ss[s2-1]=0\r\n ss[s3-1]=0\r\nprint(len(a))\r\nfor i in range(len(a)):\r\n print(*a[i])", "n = int(input())\r\nx = list(map(int, input().split()))\r\nx2 = sorted(x)\r\nn1 = x.count(1)\r\nn2 = x.count(2)\r\nn3 = x.count(3)\r\nit = min(n1, n2, n3)\r\nans = []\r\nn1 = 0\r\nn2 = 0\r\nn3 = 0\r\nfor _ in range(it):\r\n ans.append([])\r\nfor i in range(n):\r\n if n1 < it or n2 < it or n3 < it:\r\n if x[i] == 1 and n1 < it:\r\n ans[n1].append(i+1)\r\n n1 += 1\r\n elif x[i] == 2 and n2 < it:\r\n ans[n2].append(i + 1)\r\n n2 += 1\r\n elif x[i] == 3 and n3 < it:\r\n ans[n3].append(i + 1)\r\n n3 += 1\r\nprint(it)\r\nfor i in ans:\r\n print(*i)", "n=int(input())\r\na=list(map(int, input().split()))\r\nb,c,d=[],[],[]\r\nfor i in range(n):\r\n if a[i]==1:\r\n b.append(i+1)\r\n elif a[i]==2:\r\n c.append(i+1)\r\n else:\r\n d.append(i+1)\r\nl=[len(b),len(c),len(d)]\r\nprint((min(l)))\r\nfor i in range(min(l)):\r\n print(b[i],c[i],d[i])", "n = int(input())\r\narr = list(map(int,input().split(' ')))\r\n\r\nteams = {1: [],2: [],3: []}\r\n\r\nfor i in range(len(arr)):\r\n\r\n teams[arr[i]].append(i + 1)\r\n \r\nmin = min(len(teams[1]),len(teams[2]),len(teams[3]))\r\n\r\nprint(min)\r\n\r\nfor i in range(min):\r\n\r\n print( str(teams[1][i]) +' '+ str(teams[2][i]) +' '+ str(teams[3][i]) )", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=[]\r\nc=[]\r\nd=[]\r\nfor i in range(n):\r\n if a[i]==1:\r\n b.append(i+1)\r\n elif a[i]==2:\r\n c.append(i+1)\r\n else:\r\n d.append(i+1)\r\nl=[]\r\nl.append(len(b))\r\nl.append(len(c))\r\nl.append(len(d))\r\nprint(min(l))\r\nfor i in range(min(l)):\r\n print(b[i],c[i],d[i])\r\n", "a=int(input())\nlst=list(input().split())\nlst_1,lst_2,lst_3=[],[],[]\nfor i in range(len(lst)):\n if lst[i]==\"1\":\n lst_1.append(str(i+1))\n elif lst[i]==\"2\":\n lst_2.append(str(i+1))\n else:\n lst_3.append(str(i+1))\nmini=min(len(lst_1),len(lst_2),len(lst_3))\nprint(mini)\nfor j in range(mini):\n print(lst_1[j],lst_2[j],lst_3[j])\n \t\t \t \t \t\t\t\t\t\t \t", "n=int(input())\r\nd=[]\r\ns=input().split()\r\nfor i in range(n):\r\n d.append(int(s[i]))\r\n \r\nd1,d2,d3=[],[],[]\r\nn=len(d)\r\nfor i in range(n):\r\n if(d[i]==1):\r\n d1.append(i+1)\r\n elif(d[i]==2):\r\n d2.append(i+1)\r\n elif(d[i]==3):\r\n d3.append(i+1)\r\n\r\nc=min(len(d1),len(d2),len(d3))\r\nprint(c)\r\nfor i in range(c):\r\n print(d1[i],d2[i],d3[i])\r\n", "n = int(input()) # Number of children\r\nskills = list(map(int, input().split())) # Skills of each child\r\n\r\n# Initialize lists to store indices of children with different skills\r\nprogramming_indices = []\r\nmath_indices = []\r\npe_indices = []\r\n\r\n# Categorize children into the three skill categories\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming_indices.append(i + 1)\r\n elif skills[i] == 2:\r\n math_indices.append(i + 1)\r\n else:\r\n pe_indices.append(i + 1)\r\n\r\n# Calculate the maximum number of teams based on the minimum count of children with each skill\r\nmax_teams = min(len(programming_indices), len(math_indices), len(pe_indices))\r\n\r\n# Print the maximum number of teams\r\nprint(max_teams)\r\n\r\n# Form and print teams\r\nfor i in range(max_teams):\r\n team = [programming_indices[i], math_indices[i], pe_indices[i]]\r\n print(*team)\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\naindex=[]\r\nbindex=[]\r\ncindex=[]\r\naans=0\r\nbans=0\r\ncans=0\r\nnumber=[]\r\nfor a in range(x):\r\n if y[a]==1:\r\n aans=aans+1\r\n aindex.append(a+1)\r\n elif y[a]==2:\r\n bans=bans+1\r\n bindex.append(a+1)\r\n elif y[a]==3:\r\n cans=cans+1\r\n cindex.append(a+1)\r\nnumber.append(aans)\r\nnumber.append(bans)\r\nnumber.append(cans)\r\nnumber.sort()\r\nprint(number[0])\r\nfor j in range(number[0]):\r\n print(aindex[j],bindex[j], cindex[j])", "n = int(input())\r\narr = list(map(int,input().split()))\r\np = []\r\nm = []\r\nf = []\r\nfor i in range(len(arr)):\r\n if(arr[i]==1):\r\n p.append(i)\r\n elif(arr[i]==2):\r\n m.append(i)\r\n else:\r\n f.append(i)\r\nflag = min(p,m,f,key=len)\r\nprint(len(flag))\r\nfor i in range(len(flag)):\r\n print(p[i]+1,m[i]+1,f[i]+1)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))[:n]\r\na=min(l.count(1),l.count(2),l.count(3))\r\nprint(a)\r\nfor i in range(a):\r\n print(l.index(1)+1,l.index(2)+1,l.index(3)+1)\r\n l[l.index(1)]=0\r\n l[l.index(2)]=0\r\n l[l.index(3)]=0", "input();n=[[],[],[]]\r\nfor i,x in enumerate(input().split(),1):n[int(x)-1]+=[i]\r\nprint(min(map(len,n)))\r\nfor x in zip(*n):print(*x)", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\na1=[]\r\na2=[]\r\na3=[]\r\nfor i in range(len(arr)):\r\n if arr[i]==1:\r\n a1.append(i+1)\r\n elif arr[i]==2:\r\n a2.append(i+1)\r\n elif arr[i]==3:\r\n a3.append(i+1)\r\nif len(a1)<=len(a2) and len(a1)<=len(a3) :\r\n print(len(a1))\r\n for i in range(len(a1)):\r\n print(a1[i],a2[i],a3[i],sep=\" \")\r\nelif len(a2)<=len(a1) and len(a2)<=len(a3) :\r\n print(len(a2))\r\n for i in range(len(a2)):\r\n print(a1[i],a2[i],a3[i],sep=\" \")\r\nelif len(a3)<=len(a1) and len(a3)<=len(a2) :\r\n print(len(a3))\r\n for i in range(len(a3)):\r\n print(a1[i],a2[i],a3[i],sep=\" \")\r\n ", "n=int(input()) ; b=list(map(int,input().split()))\r\ns=\"\"\r\none=[] ; two=[] ; three=[]\r\nfor i in b:\r\n if i==1:\r\n one.append(i)\r\n elif i==2:\r\n two.append(i)\r\n else:\r\n three.append(i)\r\nif len(one)>=1 and len(two) >=1 and len(three)>=1:\r\n t=(min(len(one),len(two),len(three)))\r\n print(t)\r\nelse:\r\n print(0)\r\nwhile len(one)>=1 and len(two) >=1 and len(three)>=1: \r\n s+=str(b.index(1)+1)+\" \" \r\n b[b.index(1)] = 4 ; one.remove(1)\r\n s+=str(b.index(2)+1)+\" \" \r\n b[b.index(2)] = 4 ; two.remove(2)\r\n s+=str(b.index(3)+1)+\" \" +\"\\n\"\r\n b[b.index(3)] = 4 ; three.remove(3)\r\nprint(s)", "n = int(input())\r\nls = list(map(int,input().split()))\r\nmath =ls.count(1)\r\npe =ls.count(2)\r\nprg =ls.count(3)\r\nmim = min(math,pe,prg)\r\nprint(mim)\r\nx=[]\r\ny=[]\r\nz=[]\r\nfor j in range(n):\r\n if(ls[j]==1):\r\n x.append(j+1)\r\n elif(ls[j]==2):\r\n y.append(j+1)\r\n else:\r\n z.append(j+1)\r\nfor i in range(mim):\r\n print(x[i],end=' ')\r\n print(y[i],end=' ')\r\n print(z[i])", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=[]\r\nfor i in range(3):\r\n a.append([])\r\nfor i in range(n):\r\n a[l[i]-1].append(i+1)\r\nt=min(len(a[0]),len(a[1]),len(a[2]))\r\nif t==0:\r\n print(0)\r\nelse:\r\n print(t)\r\n for i in range(t):\r\n for j in range(3):\r\n print(a[j][i],end=\" \")\r\n print()", "n = int(input())\narr = list(map(int, input().split()))\nprog = []\nmath = []\nPE = []\nfor i in range(n):\n if arr[i] == 1:\n prog.append(i+1)\n elif arr[i] == 2:\n math.append(i+1)\n else:\n PE.append(i+1)\nminsize = min(len(prog), len(math), len(PE))\nprint(minsize)\nfor i in range(minsize):\n print(prog[i], math[i], PE[i], sep=\" \")\n \t \t \t\t \t \t \t \t\t \t \t \t \t\t", "n = int(input())\r\nt = [int(i) for i in input().split()]\r\nprog, math, pe = [], [], []\r\nd = {\r\n 1: prog,\r\n 2: math,\r\n 3: pe,\r\n}\r\n\r\nfor i in range(n):\r\n d[t[i]].append(i + 1)\r\n\r\ntn = min(len(prog), len(math), len(pe))\r\nprint(tn)\r\n\r\nfor i in range(tn):\r\n print(prog[i], math[i], pe[i])\r\n", "s = int(input())\r\nm = list(map(int,input().split()))\r\na = m.count(1)\r\nb = m.count(2)\r\nc = m.count(3)\r\nprint(min(a,b,c))\r\nif min(a,b,c)!=0 :\r\n for i in range(min(a,b,c)) :\r\n a1 = m.index(1)\r\n a2 = m.index(2)\r\n a3 = m.index(3)\r\n m[a1]=-1\r\n m[a2]=-1\r\n m[a3]=-1\r\n print(a1+1 , a2+1 , a3+1)", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\none = []\r\ntwo = []\r\nthree = []\r\n\r\nfor i in range(n):\r\n if t[i] == 1:\r\n one.append(i + 1)\r\n elif t[i] == 2:\r\n two.append(i + 1)\r\n else:\r\n three.append(i + 1)\r\n\r\nteams = min(len(one), len(two), len(three))\r\n\r\nprint(teams)\r\nfor i in range(teams):\r\n print(one[i], two[i], three[i])", "n = int(input(\"\"))\r\nlst = input(\"\").split(\" \")\r\n\r\none = []\r\ntwo = []\r\nthree = []\r\nfor i in range(len(lst)):\r\n if lst[i] == \"1\":\r\n one.append(i+1)\r\n elif lst[i] == \"2\":\r\n two.append(i+1)\r\n else:\r\n three.append(i+1)\r\n\r\nn = 0\r\ngrand = []\r\nwhile len(one) >= 1 and len(two) >= 1 and len(three) >= 1:\r\n grand.append([one[0],two[0],three[0]])\r\n del one[0]\r\n del two[0]\r\n del three[0]\r\n n += 1\r\nprint(n)\r\nfor team in grand:\r\n for member in team:\r\n print(member, end= \" \")\r\n print(\"\")\r\n\r\n\r\n\r\n", "people = int(input())\nsubjects = input().split()\nteams = min(subjects.count(\"1\"),subjects.count(\"2\"),subjects.count(\"3\"))\nprint(teams)\nfor i in range(teams):\n index = \"\"\n num_list = [\"1\",\"2\",\"3\"]\n for x in range(1,len(subjects)+1):\n if subjects[x-1] in num_list:\n num_list.remove(subjects[x-1])\n subjects[x-1] = \"\"\n index += str(x)+\" \"\n print(index)\n\n\n\n\n\n", "from collections import defaultdict\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ncnt = defaultdict(list)\r\nfor i, j in enumerate(a):\r\n cnt[j].append(i + 1)\r\n\r\nans = min(len(cnt[1]), len(cnt[2]), len(cnt[3]))\r\nprint(ans)\r\nwhile ans:\r\n print(str(cnt[1].pop()) + ' ' + str(cnt[2].pop()) + ' ' + str(cnt[3].pop()))\r\n ans -= 1\r\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\ncouting = {1 : [], 2 : [], 3 : []}\r\nfor i in range(n):\r\n couting[a[i]].append(i + 1)\r\nif 0 in (len(couting[i]) for i in couting):\r\n print(0)\r\nelse:\r\n res = min((len(couting[i]) for i in couting))\r\n print(res)\r\n for i in range(res):\r\n for j in range(3):\r\n print(couting[j + 1][i], end = ' ')\r\n print()", "n = int(input())\r\nchildren = list(input().split())\r\nteams = []\r\ndef zerochild():\r\n return True if children.count('1')==0 or children.count('2')==0 or children.count('3')==0 else False\r\nif zerochild():\r\n print(0)\r\nelse:\r\n for i in range(n):\r\n if zerochild():\r\n break\r\n else:\r\n teams.append([str(children.index('1')+1),str(children.index('2')+1),str(children.index('3')+1)])\r\n children.insert(children.index('1'), ' ');children.insert(children.index('2'), ' ');children.insert(children.index('3'), ' ')\r\n children.remove('1'); children.remove('2') ; children.remove('3')\r\n print(len(teams))\r\n for i in range(len(teams)):\r\n print(' '.join(teams[i]))", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nprogrammers = []\r\nmaths = []\r\nsportmen = []\r\n\r\nfor i in range(n):\r\n if students[i] == 1:\r\n programmers.append(i + 1)\r\n \r\n elif students[i] == 2:\r\n maths.append(i + 1)\r\n \r\n else:\r\n sportmen.append(i + 1)\r\n \r\ncommands = min(len(programmers), len(maths), len(sportmen))\r\nprint(commands)\r\n\r\nfor i in range(commands):\r\n print(programmers[i], maths[i], sportmen[i])\r\n ", "def sol(n,arr):\r\n r=[]\r\n for i in range(n):\r\n f1,f2,f3=0,0,0\r\n l=[]\r\n for j in range(n):\r\n if arr[j]==1 and f1==0:\r\n l.append(j+1)\r\n arr[j]=-1\r\n f1=1\r\n elif arr[j]==2 and f2==0:\r\n l.append(j+1)\r\n arr[j]=-1\r\n f2=1\r\n elif arr[j]==3 and f3==0:\r\n l.append(j+1)\r\n arr[j]=-1\r\n f3=1\r\n if f1==1 and f2==1 and f3==1:\r\n break\r\n if f1==1 and f2==1 and f3==1:\r\n r.append(l)\r\n else:\r\n break\r\n print(len(r))\r\n for i in r:\r\n print(*i)\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nsol(n,a)", "n= int (input())\r\nm= list(map(int, input().split()))\r\na,b,c = 0,0,0\r\nj=[]\r\ne=[]\r\nf=[]\r\nfor i in range (n):\r\n if m[i] ==1 :\r\n a+=1\r\n j.append(i+1)\r\n elif m[i]==2 :\r\n b+=1\r\n e.append(i+1)\r\n elif m[i]==3 :\r\n c+=1\r\n f.append(i+1)\r\nx = min(a,b,c)\r\nprint (x)\r\n\r\nfor i in range(x):\r\n print(j[i], \"\", e[i], \"\", f[i]) ", "n=int(input())\na=[int(i) for i in input().split()]\nl_1 = []; l_2=[]; l_3=[]\nfor i in range(len(a)):\n if a[i]==1:\n l_1.append(i+1)\n elif a[i]==2:\n l_2.append(i+1)\n else:\n l_3.append(i+1)\nw=min(len(l_1),len(l_2),len(l_3))\nprint(w)\nfor i in range(w):\n print(str(l_1[i]),str(l_2[i]),str(l_3[i]))\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=min(a.count(1),a.count(2),a.count(3))\r\nprint(c)\r\nfor i in range(c):\r\n a1=a.index(1)\r\n a[a1]=0\r\n a2=a.index(2)\r\n a[a2]=0\r\n a3=a.index(3)\r\n a[a3]=0\r\n print(a1+1,a2+1,a3+1)\r\n", "def it(): return int(input())\r\ndef pr(a): return print(a)\r\ndef li(): return list(map(int, input().split()))\r\ndef ls(): return [(i) for i in input()]\r\ndef no(): return print('NO')\r\ndef s(): return input()\r\ndef yes(): return print('YES')\r\ndef f(n): return 9*(len(n)-1)+int(n) // int(\"1\"*len(n))\r\ndef mapa(): return map(int, input().split())\r\nn = it()\r\nt = li()\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\nfor i in range(len(t)):\r\n if t[i] == 1:l1.append(t.index(1, i))\r\n elif t[i] == 2:l2.append(t.index(2, i))\r\n else:l3.append(t.index(3, i))\r\nw = min(len(l1), len(l2), len(l3))\r\nl1 = l1[:w]\r\nl2 = l2[:w]\r\nl3 = l3[:w]\r\nx = [[i+1, j+1, k+1] for i, j, k in zip(l1, l2, l3)]\r\npr(w)\r\nif len(x) > 0:\r\n for k in range(len(x)):\r\n print(*x[k])", "# import sys\r\n# sys.stdin = open('./input.txt', 'r')\r\n# sys.stdout = open('./output.txt', 'w') \r\n\r\nn = int(input())\r\nstudents = list(map(int, input().split()))\r\nstudent_dict = {}\r\nfor i in range(n):\r\n if students[i] in student_dict:\r\n student_dict[students[i]].append(i)\r\n else:\r\n student_dict[students[i]] = [i]\r\nif len(student_dict) == 3:\r\n teams = min([len(student_dict[i]) for i in student_dict])\r\n print(teams)\r\n for _ in range(teams):\r\n for i in student_dict:\r\n print(student_dict[i].pop(0) + 1, end=' ')\r\n print()\r\nelse:\r\n print(0)", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nmaths = []\r\nprogramming = []\r\npe = []\r\n\r\n# separate students by their skill\r\nfor i in range(n):\r\n if students[i] == 1:\r\n programming.append(i+1)\r\n elif students[i] == 2:\r\n maths.append(i+1)\r\n else:\r\n pe.append(i+1)\r\n\r\nnum_teams = min(len(maths), len(programming), len(pe))\r\n\r\n# output number of teams\r\nprint(num_teams)\r\n\r\n# output the teams\r\nfor i in range(num_teams):\r\n print(maths[i], programming[i], pe[i])\r\n", "from collections import Counter\r\n\r\n\r\ndef getIdx(h,i):\r\n for x,it in enumerate(h):\r\n if it == i:\r\n h[x] = -1\r\n return x+1\r\n return -1\r\n\r\n\r\nn = input()\r\na = [int(x) for x in input().split()]\r\n\r\nidx = []\r\n\r\nsk = [1,2,3]\r\n\r\nwhile True:\r\n lin = []\r\n for i in sk:\r\n tem = getIdx(a,i)\r\n if tem == -1:\r\n break\r\n else:\r\n lin.append(tem)\r\n if len(lin)<3:\r\n break\r\n idx.append(lin)\r\nprint(len(idx))\r\nfor i in idx:\r\n print(*i)\r\n", "n =int(input())\r\nl = list(map(int,input().split()))\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\nfor i in range(n):\r\n if l[i] == 1 :\r\n l1.append(i+1)\r\n elif l[i] == 2:\r\n l2.append(i+1)\r\n else:\r\n l3.append(i+1)\r\np = min(len(l1),len(l2),len(l3))\r\nprint(p)\r\nfor k in range(p):\r\n print(l1[0],l2[0],l3[0])\r\n l1.remove(l1[0])\r\n l2.remove(l2[0])\r\n l3.remove(l3[0])\r\n ", "n=int(input())\r\nl=input()\r\nl=list(map(int,l.split()))\r\np=[]\r\nm=[]\r\ne=[]\r\nfor i in range(0,n):\r\n\tif l[i]==1:\r\n\t\tp.append(i+1)\r\n\telif l[i]==2:\r\n\t\tm.append(i+1)\r\n\telse:\r\n\t\te.append(i+1)\r\nsize=0\r\nif len(p)<=len(m) and len(p)<=len(e):\r\n\tsize=len(p)\r\nelif len(m)<=len(p) and len(m)<=len(e):\r\n\tsize=len(m)\r\nelse:\r\n\tsize=len(e)\r\nresult=\"\"\r\nfor i in range(0,size):\r\n\tresult+=str(p[i])+\" \"+str(m[i])+\" \"+str(e[i])+\"\\n\"\r\nprint(size)\r\nif size!=0:\r\n\tprint(result)", "n = int(input())\r\narray = [int(x) for x in input().split()]\r\ndict = {}\r\nfor i in range(1,4):\r\n dict[i] = []\r\nfor idx,val in enumerate(array):\r\n dict[val].append(idx+1)\r\nteams = []\r\nmax_possible = min(min(len(dict[1]),len(dict[2])),len(dict[3]))\r\nfor i in range(max_possible):\r\n teams.append([dict[1][i],dict[2][i],dict[3][i]])\r\nprint(len(teams))\r\nfor i in teams:\r\n for j in i:\r\n print(j,end=\" \")\r\n print()\r\n\r\n", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\n# Count the number of students for each skill (programming, maths, PE)\r\ncount = [0, 0, 0]\r\nfor t in students:\r\n count[t - 1] += 1\r\n\r\n# Find the maximum number of teams\r\nmax_teams = min(count)\r\n\r\n# Initialize three separate lists for each skill\r\nprogramming_students = []\r\nmaths_students = []\r\npe_students = []\r\n\r\n# Separate students based on their skills\r\nfor i in range(n):\r\n if students[i] == 1:\r\n programming_students.append(i + 1)\r\n elif students[i] == 2:\r\n maths_students.append(i + 1)\r\n else:\r\n pe_students.append(i + 1)\r\n\r\n# Print the maximum number of teams and their composition\r\nprint(max_teams)\r\nfor i in range(max_teams):\r\n print(programming_students[i], maths_students[i], pe_students[i])\r\n", "N=int(input())\nmath=[]\nprog=[]\npe=[]\nmembers = list(map(int,input().strip().split()))[:N]\n\nfor i in range(N):\n if (members[i]==1):\n prog.append(i+1)\n elif (members[i]==2):\n math.append(i+1)\n elif (members[i]==3):\n pe.append(i+1)\nsmallestgroup=min(len(math),len(prog),len(pe))\nnumofgroups=smallestgroup\nif len(prog) == 0 or len(math) == 0 or len(pe) == 0:\n print(0)\nelse:\n print(numofgroups)\n for m in range(smallestgroup):\n print(prog[m],math[m],pe[m])\n\n \t\t\t \t\t\t \t\t \t\t \t \t \t", "a=int(input())\r\nb=[int (i) for i in input().split()]\r\nc=[]\r\nd=[]\r\ng=[]\r\nk=[]\r\nl=[]\r\nm=[]\r\nfor n in range(a): \r\n if b[n]==1 : \r\n c.append(b[n])\r\n k.append(n+1) \r\n elif b[n]==2 :\r\n d.append(b[n])\r\n l.append(n+1)\r\n else : \r\n g.append(b[n])\r\n m.append(n+1)\r\nf=min(len(c),len(d),len(g))\r\nprint(f)\r\nfor v in range(f) :\r\n print(k[v],l[v],m[v])", "n=int(input())\r\nl=list(map(int,input().split()))\r\nteam1=[]\r\nteam2=[]\r\nteam3=[]\r\nfor i in range(len(l)):\r\n if l[i]==1:\r\n team1.append(i+1)\r\n elif l[i]==2:\r\n team2.append(i+1)\r\n else:\r\n team3.append(i+1)\r\nm=min(len(team1),len(team2),len(team3))\r\nif m>0:\r\n print(m)\r\n for i in range(m):\r\n print(team1[i],team2[i],team3[i])\r\nelse:\r\n print(0)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nk = min(s.count(3), s.count(2), s.count(1))\r\nprint(k)\r\nteam = []\r\nth = []\r\nd = []\r\no = []\r\nfor i in range(len(s)):\r\n pos = i + 1\r\n if s[i] == 3:\r\n th.append(pos)\r\n elif s[i] == 2:\r\n d.append(pos)\r\n else:\r\n o.append(pos)\r\nfor i in range(k):\r\n print(o[i], d[i], th[i])", "t = int(input())\r\nl = list(map(int, input().split()))\r\na = 0\r\nb = 0\r\nc = 0\r\nfor elem in l:\r\n if elem == 1:\r\n a += 1\r\n elif elem == 2:\r\n b += 1\r\n else:\r\n c += 1\r\nprint(min(a,b,c))\r\n\r\nfor x in range(min(a,b,c)):\r\n ans = []\r\n for i in range(t):\r\n if l[i] == 1:\r\n ans.append(i+1)\r\n l[i] = 0\r\n break\r\n for i in range(t):\r\n if l[i] == 2:\r\n ans.append(i+1)\r\n l[i] = 0\r\n break\r\n for i in range(t):\r\n if l[i] == 3:\r\n ans.append(i+1)\r\n l[i] = 0\r\n break\r\n print(*ans)\r\n", "n = int(input())\r\nt1 = t2 = t3 = 0\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\nst = input().split()\r\nfor i in range(n):\r\n if st[i] == \"1\":\r\n t1 += 1\r\n l1.append(i+1)\r\n elif st[i] == \"2\":\r\n t2 += 1\r\n l2.append(i+1)\r\n else:\r\n t3 += 1\r\n l3.append(i+1)\r\nw = min(t1, t2, t3)\r\nif w != 0:\r\n print(w)\r\n for i in range(w):\r\n print(f\"{l1[i]} {l2[i]} {l3[i]}\")\r\nelse: print(0)", "n = int(input())\r\ns = input()\r\ns = list(str.split(s))\r\nif (('1' in s) and ('2' in s) and ('3' in s)):\r\n pr = s.count('1')\r\n ma = s.count('2')\r\n pe = s.count('3')\r\n no = min(pr, ma, pe)\r\n print(no)\r\n a1 = []\r\n a2 = []\r\n a3 = []\r\n \r\n for i in range(n):\r\n if s[i] == '1':\r\n a1.append(i+1)\r\n elif s[i] == '2':\r\n a2.append(i+1)\r\n elif s[i] == '3':\r\n a3.append(i+1)\r\n \r\n o = [[] for i in range(no)]\r\n \r\n for x in range(no):\r\n o[x].append(a1[x])\r\n o[x].append(a2[x])\r\n o[x].append(a3[x])\r\n \r\n for j in range(no):\r\n print(' '.join(map(str, o[j])))\r\n\r\nelse:\r\n print(0)", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nl_1,l_2,l_3=[],[],[]\r\nfor i in range(n):\r\n if (l[i]==1):\r\n l_1.extend([i+1])\r\n elif (l[i]==2):\r\n l_2.extend([i+1])\r\n elif (l[i]==3):\r\n l_3.extend([i+1]) \r\ns_1,s_2,s_3=len(l_1),len(l_2),len(l_3) \r\nprint(min(s_1,min(s_2,s_3)))\r\nfor i,j,k in zip(l_1,l_2,l_3):\r\n print(i,j,k)", "\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nmot = []\r\nhai = []\r\nba = []\r\nfor i in range (n):\r\n if a[i] == 1: mot.append(i + 1)\r\n if a[i] == 2: hai.append(i + 1)\r\n if a[i] == 3: ba.append(i + 1)\r\n\r\nans = min(len(mot), len(hai), len(ba))\r\nprint (ans)\r\n\r\nfor i in range (ans):\r\n print (mot[i], hai[i], ba[i])", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogrammers = []\r\nmathematicians = []\r\nsportsmen = []\r\n\r\n# Categorize children based on their skills\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programmers.append(i + 1)\r\n elif skills[i] == 2:\r\n mathematicians.append(i + 1)\r\n else:\r\n sportsmen.append(i + 1)\r\n\r\n# Determine the maximum number of teams possible\r\nmax_teams = min(len(programmers), len(mathematicians), len(sportsmen))\r\n\r\nprint(max_teams)\r\n\r\n# Print the team combinations\r\nfor i in range(max_teams):\r\n print(programmers[i], mathematicians[i], sportsmen[i])\r\n", "\"\"\"A. Team Olympiad - Code Forces\"\"\"\r\n\r\nn = int(input())\r\nskills = list(map(int, input().split()))\r\nprog = skills.count(1) # num programmers\r\nmath = skills.count(2) # num mathematitians\r\nphys = skills.count(3) # num Physical Education Students\r\nk = min(prog, math, phys) # Min of all to know how many teams we can form\r\nprint(k) # number of teams\r\nidx1,idx2,idx3=[],[],[] # 3 lists\r\n# collect every kind in a list \r\nfor i in range(len(skills)):\r\n if skills[i]==1:\r\n idx1.append(i+1)\r\n if skills[i]==2:\r\n idx2.append(i+1)\r\n if skills[i]==3:\r\n idx3.append(i+1)\r\n# Loop over the number of teams and print a team formed from 3 diff students\r\nfor i in range(k):\r\n print(idx1[i], idx2[i], idx3[i])", "number = int(input())\r\nelements = [int(el) for el in input().split(\" \")]\r\nnumbers = {1: 0, 2: 0, 3: 0}\r\nel_arr = {1: [], 2: [], 3: []}\r\nfor i in range(len(elements)):\r\n numbers[elements[i]] += 1\r\n el_arr[elements[i]].append(i + 1)\r\nprint(min(numbers.values()))\r\ncount = 0\r\nfor i in range(min(numbers.values())):\r\n ans = ''\r\n arr = []\r\n for j in range(3):\r\n arr.append(str(el_arr[j + 1][count]))\r\n print(\" \".join(arr))\r\n count += 1", "def Team_Olympiad(students):\r\n t1 = students.count(1)\r\n t2 = students.count(2)\r\n t3 = students.count(3)\r\n \r\n math , pr, pe = [],[],[]\r\n for i in range(len(students)):\r\n if students[i] == 1:\r\n math.append(i)\r\n elif students[i] == 2:\r\n pr.append(i)\r\n else:\r\n pe.append(i)\r\n teams = min(t1,t2,t3)\r\n print(teams)\r\n \r\n if teams > 0 :\r\n for i in range(teams):\r\n print(math[i]+1 , pr[i]+1, pe[i]+1)\r\nn = int(input())\r\nstudents = list(map(int, input().split()))\r\nTeam_Olympiad(students)\r\n \r\n ", "input()\r\na=[[],[],[]]\r\nfor i,v in enumerate(map(int,input().split())):\r\n a[v-1].append(i+1)\r\nn=min(map(len,a))\r\nprint(n)\r\nfor q in zip(*a):\r\n print(*q)", "n=int(input())\r\nx=[int(x) for x in input().split()]\r\nprog1=0\r\nprogList=[]\r\nmath2=0\r\nmathList=[]\r\npe3=0\r\npeList=[]\r\nmyindex=1\r\nfor i in x:\r\n if i == 1 : \r\n prog1+=1\r\n progList.append(myindex)\r\n elif i == 2:\r\n math2+=1\r\n mathList.append(myindex)\r\n else:\r\n pe3+=1\r\n peList.append(myindex)\r\n\r\n myindex+=1\r\n\r\n\r\nteams = min(prog1, math2, pe3)\r\n\r\nprint(teams)\r\nfor p1 ,m2,p3 in zip(progList,mathList,peList):\r\n print(p1,m2,p3)", "def team_olympiad_a():\r\n n = int(input())\r\n s = list(map(int,input().split()))\r\n t = defaultdict(list)\r\n for i in range(n):\r\n t[s[i]].append(i)\r\n if(len(t)<3):\r\n print(0)\r\n else:\r\n w = min(len(v) for v in t.values())\r\n print(w)\r\n for i in range(w):\r\n for k in t.keys():\r\n print(t[k][i]+1, end=' ')\r\n print()\r\n\r\n\r\nif __name__ == '__main__':\r\n import math\r\n from collections import defaultdict\r\n mod = 10**9 + 7\r\n team_olympiad_a()", "n = int(input());l1 = [];l2 = []\r\n*l, = map(int, input().split(' '))\r\ns1 = 0;s2 = 0;s3 = 0;l3 = []\r\n\r\nfor i in range(n):\r\n if l[i] == 1:\r\n l1.append(i + 1)\r\n s1 += 1\r\n elif l[i] == 2:\r\n l2.append(i + 1)\r\n s2 += 1\r\n else:\r\n l3.append(i + 1)\r\n s3 += 1\r\n\r\ns = min(s1, s2, s3)\r\nprint(s)\r\n\r\nfor i in range(s):\r\n print(l1[i], l2[i], l3[i])\r\n", "n = int(input())\r\nskills = input().split()\r\nnum_teams = min(skills.count(\"1\"), skills.count(\"2\"), skills.count(\"3\"))\r\nprint(num_teams)\r\nteam = (\"1\", \"2\", \"3\")\r\nif num_teams > 0:\r\n skill_1 = []\r\n skill_2 = []\r\n skill_3 = []\r\n for i in range(len(skills)):\r\n if skills[i] == \"1\":\r\n skill_1.append(i + 1)\r\n if skills[i] == \"2\":\r\n skill_2.append(i + 1)\r\n if skills[i] == \"3\":\r\n skill_3.append(i + 1)\r\nwhile num_teams > 0:\r\n print(skill_1.pop(0), skill_2.pop(0), skill_3.pop(0))\r\n num_teams -= 1\r\n", "# In the name of GOD\r\n\r\nn=int(input())\r\nl=list(map(int, input().split()))\r\nat=0\r\nbt=0\r\nct=0\r\nt=1\r\na=[]\r\nb=[]\r\nc=[]\r\nfor i in l:\r\n if i==1 :\r\n a.append(t)\r\n at+=1\r\n elif i==2 :\r\n b.append(t)\r\n bt+=1\r\n else :\r\n c.append(t)\r\n ct+=1\r\n t+=1\r\nprint(min(at,min(bt,ct)))\r\nfor i in range(n):\r\n if i==len(a) or i==len(b) or i==len(c):\r\n break\r\n print(a[i],b[i],c[i])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = []\r\ny = []\r\nz = []\r\nfor i in range(n):\r\n if a[i] == 1:\r\n x.append(i + 1)\r\n elif a[i] == 2:\r\n y.append(i + 1)\r\n else:\r\n z.append(i + 1)\r\nk = min(len(x), len(y), len(z))\r\nprint(k)\r\nfor i in range(k):\r\n print(x[i], y[i], z[i])", "child_num = int(input())\r\nchild_list = list(input().split())\r\nlist_1 = list()\r\nlist_2 = list()\r\nlist_3 = list()\r\n\r\nfor i in range(child_num):\r\n if child_list[i] == '1':\r\n list_1.append(i + 1)\r\n elif child_list[i] == '2':\r\n list_2.append(i + 1)\r\n else:\r\n list_3.append(i + 1)\r\n\r\nteams_num = min(len(list_1), len(list_2), len(list_3))\r\nprint(teams_num)\r\nfor j in range(teams_num):\r\n print(list_1[j], list_2[j], list_3[j])", "n = int(input())\r\nt = input().split()\r\np, m, f = [], [], []\r\nfor i in range(n):\r\n if t[i] == '1':\r\n p.append(i+1)\r\n elif t[i] == '2':\r\n m.append(i+1)\r\n else:\r\n f.append(i+1)\r\nprint(min(len(p), len(m), len(f)))\r\nfor i in zip(p, m, f):\r\n print(*i)", "n = int(input())\r\nstudents = list(map(int , input().split()))\r\n\r\nif (1 not in students) or (2 not in students) or (3 not in students):\r\n print(0)\r\nelse:\r\n n_teams = min(students.count(1), students.count(2) , students.count(3))\r\n print(n_teams)\r\n for i in range(n_teams):\r\n print(students.index(1)+1 , students.index(2)+1, students.index(3)+1)\r\n students[students.index(1)] = 0\r\n students[students.index(2)] = 0\r\n students[students.index(3)] = 0", "n = int(input())\r\nciv = list(map(int, input().split()))\r\nout = ''\r\nflag = 0\r\nwhile 1:\r\n team = []\r\n if 1 in civ:\r\n team.append(civ.index(1)+1)\r\n civ[civ.index(1)] = 0\r\n else:\r\n break\r\n if 2 in civ:\r\n team.append(civ.index(2)+1)\r\n civ[civ.index(2)] = 0\r\n else:\r\n break\r\n if 3 in civ:\r\n team.append(civ.index(3)+1)\r\n civ[civ.index(3)] = 0\r\n flag += 1\r\n else:\r\n break\r\n for i in team:\r\n out += str(i) + ' '\r\n out += '\\n'\r\nif flag == 0:\r\n print(0)\r\n exit()\r\nprint(flag)\r\nprint(out)\r\n", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\nprogramming, math, pe = [], [], []\r\n\r\nfor index, student in enumerate(students):\r\n if student == 1:\r\n programming.append(index)\r\n elif student == 2:\r\n math.append(index)\r\n else:\r\n pe.append(index)\r\n\r\nif programming and math and pe:\r\n teams = min(len(programming), len(math), len(pe))\r\n print(teams)\r\n\r\n for team in range(teams):\r\n print(programming[team] + 1, end=\" \")\r\n print(math[team] + 1, end=\" \")\r\n print(pe[team] + 1)\r\nelse:\r\n print(0)\r\n", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogrammers = []\r\nmaths = []\r\npe = []\r\n\r\n# Populate the skill lists\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programmers.append(i + 1)\r\n elif skills[i] == 2:\r\n maths.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\n# Calculate the maximum number of teams\r\nmax_teams = min(len(programmers), len(maths), len(pe))\r\n\r\nprint(max_teams)\r\n\r\n# Form teams and print their indices\r\nfor i in range(max_teams):\r\n print(programmers[i], maths[i], pe[i])\r\n", "def form_teams(n, skills):\n programmers = []\n mathematicians = []\n sportsmen = []\n\n # Group children based on their skills\n for i in range(n):\n if skills[i] == 1:\n programmers.append(i + 1)\n elif skills[i] == 2:\n mathematicians.append(i + 1)\n elif skills[i] == 3:\n sportsmen.append(i + 1)\n\n # Form teams\n teams = []\n team_count = min(len(programmers), len(mathematicians), len(sportsmen))\n for i in range(team_count):\n team = [programmers[i], mathematicians[i], sportsmen[i]]\n teams.append(team)\n\n return teams\n\n# Read input\nn = int(input())\nskills = list(map(int, input().split()))\n\n# Form teams\nteams = form_teams(n, skills)\n\n# Print the number of teams\nprint(len(teams))\n\n# Print the teams\nfor team in teams:\n print(*team)\n\n \t \t\t\t \t \t\t \t \t\t\t\t \t \t \t", "a=input()\nb=input()\nif (b==\"\"):\n print(0)\n exit()\nL=list(map(float, b.split(' ')))\nP=[]\nfor i in range (len(L)):\n P.append([])\nfor i in range (len(L)):\n P[i].append(L[i])\nfor i in range(len(L)):\n P[i].append(i+1)\nfor i in range(len(L)):\n P[i].append(0)\nP.sort()\nlistoftwo=[]\noutput=[]\nfor i in range (len(P)):\n if (P[i][0]==2):\n listoftwo.append(P[i])\nfinal=[]\ndef halo():\n for i in range(len(listoftwo)):\n if (listoftwo[i][2]==0):\n final.append(listoftwo[i][1])\n listoftwo[i][2]=1\n return\n print(len(output))\n for i in range(len(output)):\n print(output[i])\n exit()\n\ndef backward(P):\n for i in range(1,len(P)):\n if (P[-i][0]==3):\n if (P[-i][2]==0):\n final.append(P[-i][1])\n P[-i][2]=1\n return\n if (P[-i][0]==2 or P[-i][0]==1):\n print(len(output))\n for i in range(len(output)):\n print(output[i])\n exit()\n pass\nfor i in range(len(P)):\n if (P[i][0]==1):\n if (P[i][2]==0): #no need of this condition\n final.append(P[i][1])\n P[i][2]=1\n halo()\n backward(P)\n k=(\" \".join(str(i) for i in final))\n final=[]\n output.append(k)\n \n else:\n print(len(output))\n for i in range(len(output)):\n print(output[i])\n exit()", "students = int(input())\r\nskills = list(map(int, input().split(\" \")))\r\n\r\nanalysis = [0, 0, 0]\r\nones = []\r\ntwos = []\r\nthrees = []\r\nif len(set(skills)) != 3:\r\n print(0)\r\nelse:\r\n for i in range(len(skills)):\r\n \r\n if skills[i] == 1:\r\n analysis[0] += 1\r\n ones.append(i+1)\r\n \r\n elif skills[i] == 2:\r\n analysis[1] += 1\r\n twos.append(i+1)\r\n \r\n else:\r\n analysis[2] += 1\r\n threes.append(i+1)\r\n \r\n print(min(analysis)) \r\n for i in range(min(analysis)):\r\n print(ones[i], twos[i], threes[i])", "t = int(input())\nl1 = list(map(int,input().split()))\naindex = []\nbindex = []\ncindex = []\nfor i in range(len(l1)):\n if l1[i] == 1:\n aindex.append(i+1)\n if l1[i] == 2:\n bindex.append(i+1)\n if l1[i] == 3:\n cindex.append(i+1)\n\ny = min ( len(aindex), len(bindex), len(cindex))\nprint(y )\nfor j in range(y):\n print(aindex[j],bindex[j],cindex[j], sep = \" \")", "def main() -> int:\n students :int = int(input())\n talents :list[int] = [int(s) for s in input().split(\" \")]\n\n count :dict = {}\n cnt :list[int] = [0]*3\n for ind, talent in enumerate(talents):\n count[talent] = count.get(talent, []) + [ind]\n cnt[talent - 1] += 1\n\n print(min(cnt))\n\n for i in range(min(cnt)):\n for key in count:\n print(count[key].pop() + 1, end=\" \")\n print()\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\n\r\na1 = []\r\na2 = []\r\na3 = []\r\nnumbers = [int(x) for x in input().split()]\r\nfor i in range(0, n):\r\n if numbers[i] == 1:\r\n a1.append(i+1)\r\n elif numbers[i] == 2:\r\n a2.append(i+1)\r\n else:\r\n a3.append(i+1)\r\n\r\nc = min(len(a1), len(a2), len(a3))\r\nprint(c)\r\nfor i in range(0, c):\r\n print(a1[i], a2[i], a3[i],sep=' ')\r\n\r\n", "n=int(input())\r\na=[]\r\nt1,t2,t3=0,0,0\r\na=input().split()\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\n if a[i]==1:\r\n t1=t1+1\r\n if a[i]==2:\r\n t2=t2+1\r\n if a[i]==3:\r\n t3=t3+1\r\nprint(min(t1,t2,t3))\r\nt=min(t1,t2,t3)\r\nwhile t!=0:\r\n print(a.index(1)+1,end=' ')\r\n print(a.index(2)+1,end=' ')\r\n print(a.index(3)+1,end=' ')\r\n a[a.index(1)]=4\r\n a[a.index(2)]=4\r\n a[a.index(3)]=4\r\n print()\r\n t=t-1", "n = int(input())\nstudents = list(map(int, input().split()))\n\ngroups = {1: [], 2: [], 3: []}\nfor i in range(n):\n groups[students[i]].append(i+1)\n\nmn = 1000000\nfor i in range(1, 4):\n mn = min(mn, len(groups[i]))\n\nteams = []\nfor i in range(mn):\n team = []\n team.append(groups[1][i])\n team.append(groups[2][i])\n team.append(groups[3][i])\n teams.append(team)\n\nprint(mn)\n\nfor i in range(mn):\n teams[i] = [str(elem) for elem in teams[i]]\n print(\" \".join(teams[i]))\n\t\t\t\t \t \t \t\t\t \t\t \t\t \t \t\t \t\t\t", "n=int(input())\r\nlst=list(map(int,input().split()))\r\none,two,three=0,0,0\r\nfor i in range(n):\r\n if(lst[i]==1):\r\n one+=1\r\n elif(lst[i]==2):\r\n two+=1\r\n elif(lst[i]==3):\r\n three+=1\r\nval=min(one,two,three)\r\nprint(val)\r\nwhile(val!=0):\r\n o=lst.index(1)\r\n lst[o]=0\r\n tw=lst.index(2)\r\n lst[tw]=0\r\n thr=lst.index(3)\r\n lst[thr]=0\r\n print(o+1,tw+1,thr+1) \r\n val-=1", "n = int(input())\r\nt = list(map(int, input().split()))\r\np = []\r\nm = []\r\npe = []\r\nfor i in range(n):\r\n if t[i] == 1:\r\n p.append(i + 1)\r\n elif t[i] == 2:\r\n m.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\nw = min(len(p), len(m), len(pe))\r\nprint(w)\r\nfor i in range(w):\r\n print(p[i], m[i], pe[i])\r\n", "n = int(input())\r\nm = list(map(int, input().split()))\r\n_1 = [i+1 for i in range(n) if m[i] == 1]\r\n_2 = [i+1 for i in range(n) if m[i] == 2]\r\n_3 = [i+1 for i in range(n) if m[i] == 3]\r\nv = min([len(_1), len(_2), len(_3)])\r\nprint(v)\r\nfor i in range(v):\r\n print(_1[i], _2[i], _3[i])\r\n", "n = int(input())\r\nls = list(map(int,input().split()))[:n]\r\none,two,three=0,0,0\r\noneIndexes,twoIndexes,threeIndexes = [],[],[]\r\nfor i in range(len(ls)):\r\n if ls[i]==1:\r\n one+=1\r\n oneIndexes.append(i+1)\r\n if ls[i]==2:\r\n two+=1\r\n twoIndexes.append(i+1)\r\n if ls[i]==3:\r\n three+=1\r\n threeIndexes.append(i+1)\r\nprint(min(one,two,three))\r\nfor i in range(min(one,two,three)):\r\n print(oneIndexes[i],twoIndexes[i],threeIndexes[i])", "n = int(input())\r\nlista = [int(x) for x in input().split(' ')]\r\nprog = lista.count(1)\r\nmath = lista.count(2)\r\npe = lista.count(3)\r\nw = min([prog, math, pe])\r\nif w == 0:\r\n print(0)\r\nelse:\r\n print(w)\r\n pos1 = []\r\n pos2 = []\r\n pos3 = []\r\n for i in range(n):\r\n if lista[i] == 1:\r\n pos1.append(i+1)\r\n elif lista[i] == 2:\r\n pos2.append(i+1)\r\n elif lista[i] == 3:\r\n pos3.append(i+1)\r\n for i in range(w):\r\n print(pos1[i], pos2[i], pos3[i])", "from typing import List\n\n\ndef solution():\n\tgroups: List[List[int]] = [[], [], []]\n\n\tstudent_count = int(input())\n\tstudents = [int(x) - 1 for x in input().split()]\n\n\tfor student_index in range(student_count):\n\t\tgroups[students[student_index]].append(student_index)\n\n\tmin_len = min((len(groups[0]), len(groups[1]), len(groups[2])))\n\n\tprint(min_len)\n\tfor len_index in range(min_len):\n\t\tfor group_index in range(len(groups)):\n\t\t\tif group_index > 0:\n\t\t\t\tprint(\" \", end=\"\")\n\t\t\tprint(f\"{groups[group_index][len_index] + 1}\", end=\"\")\n\t\tprint(\"\")\n\n\nif __name__ == \"__main__\":\n\tsolution()\n", "# LUOGU_RID: 101571780\nn, *a = map(int, open(0).read().split())\r\nc = [[] for _ in range(3)]\r\nfor i, x in enumerate(a):\r\n c[x - 1] += i + 1,\r\nprint(min(map(len, c)))\r\nfor x in zip(*c):\r\n print(*x)", "n = int(input())\n\nprogrammingChildrens = []\nmathChildrens = []\npeChildrens = []\n\ninputString = input().split()\n\nfor index in range(0,len(inputString)):\n\tif inputString[index] == \"1\":\n\t\tprogrammingChildrens.append(index+1)\n\telif inputString[index] == \"2\":\n\t\tmathChildrens.append(index+1)\n\telse:\n\t\tpeChildrens.append(index+1)\n\nlen1 = len(programmingChildrens)\nlen2 = len(mathChildrens)\nlen3 = len(peChildrens)\n\nlenMin = min([len1,len2,len3])\n\nprint(lenMin)\nfor index in range(0,lenMin):\n\tprint(programmingChildrens[index], mathChildrens[index], peChildrens[index])\t\n", "n = int(input())\r\nl = list(map(int , input().split()))\r\n\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\n\r\nfor i in range(n):\r\n if l[i] == 1:\r\n l1.append(i+1)\r\n if l[i] == 2:\r\n l2.append(i+1)\r\n if l[i] == 3:\r\n l3.append(i+1)\r\nl4 = []\r\nwhile(l1 and l2 and l3):\r\n a = l1.pop()\r\n b = l2.pop()\r\n c = l3.pop()\r\n l4.append((a,b,c))\r\n \r\nprint(len(l4))\r\nfor (a,b,c) in l4:\r\n print(a , b , c)\r\n", "import sys\r\n\r\nn = int(input())\r\nar = list(map(int,input().strip().split()))\r\n\r\ncountOne = ar.count(1)\r\ncountTow = ar.count(2)\r\ncountThree = ar.count(3)\r\n\r\nteamNumber = min(countOne,countTow,countThree)\r\nprint(teamNumber)\r\nfor i in range(teamNumber):\r\n indexOne = ar.index(1)\r\n print(indexOne+1,end=\" \")\r\n ar[indexOne] = sys.maxsize\r\n indexTow = ar.index(2)\r\n print(indexTow+1,end=\" \")\r\n ar[indexTow] = sys.maxsize\r\n indexThree = ar.index(3)\r\n print(indexThree+1,end=\" \")\r\n ar[indexThree] = sys.maxsize\r\n print()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nd = [b for b, v in enumerate(a) if v == 1]\r\ne = [b for b, v in enumerate(a) if v == 2]\r\nr = [b for b, v in enumerate(a) if v == 3]\r\n\r\nif d and e and r:\r\n teams = min(len(d), len(e), len(r))\r\n print(teams)\r\n \r\n for t in range(teams):\r\n print(d[t] + 1, end = \" \")\r\n print(e[t] + 1, end = \" \")\r\n print(r[t] + 1)\r\n\r\nelse:\r\n print(0)\r\n ", "n = int(input())\r\n\r\nkids =[int(x) for x in input().split()]\r\n\r\ncompetencies ={\r\n 1:[],\r\n 2:[],\r\n 3:[],\r\n}\r\n\r\nfor i in range(n):\r\n if kids[i] in competencies:\r\n competencies[kids[i]].append(i+1)\r\n\r\nmaxTeams = min(len(competencies[1]),\r\nlen(competencies[2]),\r\nlen(competencies[3]))\r\nprint(maxTeams)\r\nfor i in range(maxTeams):\r\n print(str(competencies[1][i]) +\" \"+ str(competencies[2][i])+ \" \" +str(competencies[3][i]))", "n = int(input())\r\ns = input()\r\na = s.split()\r\nm = min(s.count('1'),s.count('2'),s.count('3'))\r\nprint(m)\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\ni = 0\r\nfor i in range(len(a)):\r\n if a[i] == 1:\r\n l1.append(i+1)\r\n if a[i] == 2:\r\n l2.append(i+1)\r\n if a[i] == 3:\r\n l3.append(i+1)\r\ni = 0\r\nfor i in range(m):\r\n print(l1[i],l2[i],l3[i])\r\n\r\n", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\none = students.count(1)\r\ntwo = students.count(2)\r\nthree = students.count(3)\r\n\r\nif one and two and three > 0:\r\n x = min(one, two, three)\r\n print(x)\r\n counter = 1\r\n while counter < x * 3:\r\n one_index = students.index(1)\r\n two_index = students.index(2)\r\n three_index = students.index(3)\r\n print(students.index(1) + 1)\r\n students[one_index] = 0\r\n print(students.index(2) + 1)\r\n students[two_index] = 0\r\n print(students.index(3) + 1)\r\n students[three_index] = 0\r\n counter += 3\r\n\r\nelse:\r\n print(\"0\")", "# In the name of GOD\n\nn=int(input())\nl=list(map(int, input().split()))\nat=0\nbt=0\nct=0\nt=1\na=[]\nb=[]\nc=[]\nfor i in l:\n if i==1 :\n a.append(t)\n at+=1\n elif i==2 :\n b.append(t)\n bt+=1\n else :\n c.append(t)\n ct+=1\n t+=1\nprint(min(at,min(bt,ct)))\nfor i in range(n):\n if i==len(a) or i==len(b) or i==len(c):\n break\n print(a[i],b[i],c[i])\n", "target = int(input()) // 3 \ni = 1\nabilities = []\nfor stud in list(map(int, input().split())):\n abilities.append((i,stud))\n i = i + 1\ncombos = \"\"\nf1 = list()\nf2 = list() \nf3 = list()\nfor idx, value in abilities:\n if value == 1:\n f1.append(idx)\n elif value == 2:\n f2.append(idx)\n elif value == 3:\n f3.append(idx)\n\nfound_combo = min(len(f1), min(len(f2), len(f3)))\nif found_combo > 0:\n print(found_combo)\n for i in range(found_combo):\n print(f\"{f1[i]} {f2[i]} {f3[i]}\")\nelse:\n print(\"0\")\n", "n=int(input())\r\nranks=list(map(int,input().split()))\r\nteams=min(ranks.count(1),ranks.count(2), ranks.count(3))\r\nprint(teams)\r\nteam1=list()\r\nteam2=list()\r\nteam_marks=list()\r\nused_studs=list()\r\nfor i in range(teams): # teams\r\n\r\n if i==0:\r\n for j in range(1,4): #marks 1 2 3\r\n for l in range(len(ranks)): #search by index\r\n ## print('L',l,'i',i, 'team_marks',team_marks)\r\n if ranks[l]==j and ranks[l] not in team_marks and l not in used_studs:\r\n team2.append(l+1)\r\n ## used_studs.append(l)\r\n team_marks.append(ranks[l])\r\n break\r\n if team_marks == [1,2,3]:\r\n break\r\n k=' '.join(str(e) for e in team2)\r\n print(k)\r\n team_marks=list()\r\n\r\n\r\n\r\n\r\n elif i%2==1:\r\n team1=list()\r\n for j in range(1,4): #marks 1 2 3\r\n for l in range(team2[j-1],len(ranks)): #search by index\r\n ## print('L',l,'i',i, 'team_marks',team_marks)\r\n if ranks[l]==j and ranks[l] not in team_marks and l not in used_studs:\r\n team1.append(l+1)\r\n ## used_studs.append(l)\r\n team_marks.append(ranks[l])\r\n break\r\n if team_marks == [1,2,3]:\r\n break\r\n k=' '.join(str(e) for e in team1)\r\n print(k)\r\n team_marks=list()\r\n\r\n\r\n\r\n\r\n\r\n else:\r\n team2=list()\r\n for j in range(1,4): #marks 1 2 3\r\n for l in range(team1[j-1],len(ranks)): #search by index\r\n ## print('L',l,'i',i, 'team_marks',team_marks)\r\n if ranks[l]==j and ranks[l] not in team_marks and l not in used_studs:\r\n team2.append(l+1)\r\n ## used_studs.append(l)\r\n team_marks.append(ranks[l])\r\n break\r\n if team_marks == [1,2,3]:\r\n break\r\n k=' '.join(str(e) for e in team2)\r\n print(k)\r\n team_marks=list()\r\n", "n = int(input())\r\nskills = list(map(int, input().split()))\r\nprogramming, math, pe = [], [], []\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n math.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\nmax_teams = min(len(programming), len(math), len(pe))\r\n\r\nif max_teams > 0:\r\n print(max_teams)\r\n for i in range(max_teams):\r\n print(programming[i], math[i], pe[i])\r\nelse:\r\n print(0)\r\n", "n = input()\r\n\r\nl = list(map(int, input().split()))\r\n\r\nw = min(l.count(1), l.count(2), l.count(3))\r\n\r\nprint(w)\r\n\r\nfor i in range(w):\r\n \r\n g = []\r\n \r\n g.append(l.index(1) + 1)\r\n l[l.index(1)] = 0\r\n g.append(l.index(2) + 1)\r\n l[l.index(2)] = 0\r\n g.append(l.index(3) + 1)\r\n l[l.index(3)] = 0\r\n \r\n for i in range(3):\r\n print(g[i], end = ' ')\r\n \r\n print()\r\n\r\n\r\n\r\n", "N = int(input())\r\ndata = input().split()\r\ndata_x = {\"1\": [], \"2\": [], \"3\": []}\r\n\r\nfor i in range(len(data)):\r\n data_x[data[i]].append(i + 1)\r\n\r\nprint(min([len(data_x[\"1\"]), len(data_x[\"2\"]), len(data_x[\"3\"])]))\r\nwhile data_x[\"1\"] and data_x[\"2\"] and data_x[\"3\"]:\r\n print(data_x[\"1\"].pop(0), data_x[\"2\"].pop(0), data_x[\"3\"].pop(0))\r\n", "n=int(input())\r\nt=list(map(int,input().split(' ')))\r\ng=[[],[],[]]\r\nfor i in range(n):\r\n g[t[i]-1].append(i+1)\r\nnum=min(len(g[x]) for x in range(3))\r\nprint(num)\r\nfor i in range(num):\r\n print(g[0][i-1],g[1][i-1],g[2][i-1])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\np=a.count(1)\r\nm=a.count(2)\r\ns=a.count(3)\r\nm=min(p,m,s)\r\nprint(m)\r\nfor i in range(m):\r\n ai1=a.index(1)+1\r\n ai2=a.index(2)+1\r\n ai3=a.index(3)+1\r\n print(ai1, ai2, ai3)\r\n a[ai1-1] = 0\r\n a[ai2-1] = 0\r\n a[ai3-1] = 0", "n = int(input())\r\nlis = list(map(int,input().split()))\r\ni_1 = []\r\ni_2 = []\r\ni_3 = []\r\nfor i in range(n):\r\n if lis[i] == 1:\r\n i_1.append(i+1)\r\n elif lis[i] == 2:\r\n i_2.append(i+1)\r\n else:\r\n i_3.append(i+1)\r\nx = min(len(i_1),len(i_2),len(i_3))\r\nprint(x)\r\nfor i in range(x):\r\n print(i_1[i],i_2[i],i_3[i])", "n = int(input())\r\nchildren = list(map(int, input().split()))\r\nmax_teams = min(children.count(1), children.count(2), children.count(3))\r\nif max_teams == 0:\r\n print(max_teams)\r\nelse:\r\n print(max_teams)\r\n for _ in range(max_teams):\r\n print(children.index(1) + 1, end=\" \")\r\n children[children.index(1)] = 'd'\r\n print(children.index(2) + 1, end=\" \")\r\n children[children.index(2)] = 'd'\r\n print(children.index(3) + 1, end=\" \")\r\n children[children.index(3)] = 'd'\r\n print()\r\n", "n=int(input())\ntt=input()\nA=[]\nX=[]\nt=[int(i) for i in tt.split()]\nA.append(t.count(1))\nA.append(t.count(2))\nA.append(t.count(3))\n\nA.sort()\nprint(A[0])\n\n\nfor i in range(A[0]):\n X.append(t.index(1)+1)\n t[t.index(1)]=0\n X.append(t.index(2)+1)\n t[t.index(2)]=0\n X.append(t.index(3)+1)\n t[t.index(3)]=0\n \nfor i in range(len(X)):\n print(X[i],end=' ')\n if (i+1)%3==0:\n print()\n \n\t \t\t\t\t \t \t \t\t\t\t\t \t \t\t\t \t", "n = int(input())\r\ns= list(map(int, input().split()))\r\nteams = [[] for _ in range(3)]\r\nfor i, skill in enumerate(s, start=1):\r\n teams[skill - 1].append(i)\r\nmax_teams = min(len(team) for team in teams)\r\nprint(max_teams)\r\nfor i in range(max_teams):\r\n print(*[team[i] for team in teams])", "a=int(input())\nlst=list(map(int,input().split()))\nl_1=[];l_2=[];l_3=[]\nindex_1=[];index_2=[];index_3=[]\nfor i in range(len(lst)):\n if lst[i]==1:\n l_1.append(lst[i])\n index_1.append(i+1)\n elif lst[i]==2:\n l_2.append(lst[i])\n index_2.append(i+1)\n else:\n l_3.append(lst[i])\n index_3.append(i+1)\nmini=min(len(l_1),len(l_2),len(l_3))\nwhile len(l_1)>mini:\n index_1.pop()\n l_1.pop()\nwhile len(l_2)>mini:\n index_2.pop()\n l_2.pop()\nwhile len(l_3)>mini:\n index_3.pop()\n l_3.pop()\nif mini==0:\n print(0)\n exit()\nprint(mini)\nfor i in range(mini):\n print(index_1[i],index_2[i],index_3[i])\n \t\t\t \t \t\t \t \t \t \t \t\t\t", "w = int(input())\r\nc = input().split()\r\nlist = []\r\ndict = {'1':[],'2':[],'3':[]}\r\nfor i in range(0,len(c)):\r\n if c[i] in dict:\r\n dict[c[i]].append(i+1)\r\nfor i in dict.values():\r\n list.append(len(i))\r\nprint(min(list))\r\nans = []\r\nfor i in dict.values():\r\n ans.append(i)\r\nresult = \"\"\r\nj = 0\r\nwhile j < min(list):\r\n result += str(ans[0][j]) + ' '+ str(ans[1][j])+ ' '+ str(ans[2][j])\r\n print(result)\r\n result = \"\"\r\n j += 1", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nd = {}\r\nres = []\r\nfor i in range(1, 5):\r\n res.append([])\r\nfor i in range(n):\r\n d[l[i]] = d.get(l[i], 0)+1\r\n # print(l[i])\r\n res[l[i]].append(i+1)\r\n# print(d)\r\nans = min(d.get(1, 0), min(d.get(2, 0), d.get(3, 0)))\r\nprint(ans)\r\n# print(res)\r\nfor i in range(ans):\r\n for j in range(1, 4):\r\n print(res[j][i], end = \" \")\r\n print()\r\n\r\n", "children_in_school = int(input())\nt = list(map(int, input().split()))\n\nprogrammers, mathematicians, sportsmen = [], [], []\n\nfor i in range(children_in_school):\n if t[i] == 1:\n programmers.append(i + 1)\n elif t[i] == 2:\n mathematicians.append(i + 1)\n else:\n sportsmen.append(i + 1)\n\nmax_teams = min(len(programmers), len(mathematicians), len(sportsmen))\n\nprint(max_teams)\n\nif max_teams > 0:\n for i in range(max_teams):\n print(programmers[i], mathematicians[i], sportsmen[i])\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\ncount = [0, 0, 0]\r\nindices = [[], [], []]\r\n\r\nfor i in range(n):\r\n count[arr[i] - 1] += 1\r\n indices[arr[i] - 1].append(i + 1)\r\n\r\nsize = min(count)\r\nprint(size)\r\nfor i in range(size):\r\n team = indices[0][i], indices[1][i], indices[2][i]\r\n print(*team)", "n=int(input())\r\nt = [ int(x) for x in input().split()]\r\nt1=[]\r\nt2=[]\r\nt3=[]\r\nfor i in range(len(t)):\r\n if t[i] ==1:\r\n t1.append(i+1)\r\n elif t[i]==2:\r\n t2.append(i+1)\r\n else:\r\n t3.append(i+1)\r\na=[len(t1),len(t2),len(t3)]\r\nc=min(a)\r\nprint(c)\r\nfor j in range(c):\r\n print(t1[j],end=' ')\r\n print(t2[j],end=' ')\r\n print(t3[j])", "import sys\r\nn=int(input())\r\nt=[int(x) for x in sys.stdin.readline().split()]\r\nk1=[]\r\nk2=[]\r\nk3=[]\r\nfor i in range(n):\r\n if t[i]==1: k1.append(i+1)\r\n if t[i]==2: k2.append(i+1)\r\n if t[i]==3: k3.append(i+1)\r\ncnt=min( len(k1),len(k2),len(k3) )\r\nfn=[]\r\nfor j in range(cnt):\r\n fn.append([k1[j],k2[j],k3[j]])\r\nprint(cnt)\r\nfor x in fn:\r\n print(*x)\r\n\r\n \r\n", "def finder(point, x):\r\n inx = 0\r\n for i in range(len(point)):\r\n if point[i] == x:\r\n inx = i\r\n break\r\n return inx\r\n\r\ndef main():\r\n n = int(input())\r\n num = list(range(1, n + 1))\r\n point = list(map(int, input().split()))\r\n count = [0, 0, 0]\r\n\r\n for i in range(n):\r\n count[point[i] - 1] += 1\r\n\r\n min_count = min(count)\r\n print(min_count)\r\n \r\n for i in range(n - 1):\r\n swapped = True\r\n for j in range(n - 1 - i):\r\n if point[j] > point[j + 1]:\r\n point[j], point[j + 1] = point[j + 1], point[j]\r\n num[j], num[j + 1] = num[j + 1], num[j]\r\n swapped = False\r\n if swapped:\r\n break\r\n \r\n one_ind = finder(point, 1)\r\n two_ind = finder(point, 2)\r\n three_ind = finder(point, 3)\r\n\r\n for i in range(min_count):\r\n print(num[one_ind], num[two_ind], num[three_ind])\r\n one_ind += 1\r\n two_ind += 1\r\n three_ind += 1\r\n\r\nif __name__ == \"__main__\":\r\n main()# 1698230401.854687", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Fri Mar 31 20:04:19 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\nc1=[]\r\nc2=[]\r\nc3=[]\r\nfor i in range(len(s)):\r\n if s[i]==1:\r\n c1.append(i+1)\r\n elif s[i]==2:\r\n c2.append(i+1)\r\n else:\r\n c3.append(i+1)\r\n \r\nl=min(len(c1),len(c2),len(c3))\r\nt=[]\r\nfor j in range(l):\r\n x=[c1[j],c2[j],c3[j]]\r\n t.append(x)\r\n\r\nif len(t)>0:\r\n print(len(t))\r\n for ele in t:\r\n print(ele[0],ele[1],ele[2])\r\nelse:\r\n print(len(t))\r\n ", "u=int(input())\r\nl = [int(x) for x in input ().split()]\r\nm=l.count(1)\r\nn=l.count(2)\r\nb=l.count(3)\r\nx=min(m,n,b)\r\nnumber_of_team=x\r\n\r\nprint(x)\r\nfor i in range (x):\r\n print(l.index(1)+1,end=' ')\r\n \r\n print(l.index(2)+1,end=' ')\r\n #del l[l.index(2)]\r\n print(l.index(3)+1)\r\n #del l[l.index(3)]\r\n l[l.index(1)]=0\r\n l[l.index(2)]=0\r\n l[l.index(3)]=0\r\n\r\n#\r\n\r\n\r\n\r\n\r\n \r\n ", "n=int(input())\r\nlist_children=list(map(int,input().split()))\r\na=b=c=0\r\nthe_list=[]\r\nfor i in range(int(n/3)):\r\n if 1 in list_children[a:] and 2 in list_children[b:] and 3 in list_children[c:] :\r\n a=list_children.index(1,a)+1\r\n b=list_children.index(2,b)+1\r\n c=list_children.index(3,c)+1\r\n the_list+=[[a,b,c]]\r\nprint(len(the_list))\r\nfor i in range(len(the_list)):\r\n for j in range(len(the_list[i])):\r\n print(the_list[i][j],end=\" \")\r\n print()", "n=input()\nn=int(n)\n\nlist=list(map(int,input().split()))\n\nlist1=[]\nlist2=[]\nlist3=[]\n\nfor i in range(n):\n if list[i]==1:\n list1.append(i+1)\n elif list[i]==2:\n list2.append(i+1)\n else:\n list3.append(i+1)\n\n\nmn=min(len(list1),len(list2),len(list3))\n\nprint(mn)\nfor i in range (mn):\n print(list1[i],list2[i],list3[i])\n\n \t \t\t \t \t\t \t\t\t\t\t", "n=int(input())\r\nread = list(map(int, input().split()))\r\ncount1=[]\r\ncount2=[]\r\ncount3=[]\r\nfor i in range(len(read)):\r\n if(read[i]==1):\r\n count1.append(i)\r\n elif(read[i]==2):\r\n count2.append(i)\r\n else: count3.append(i)\r\nprint(min(len(count1), len(count2), len(count3)))\r\nfor i in range(0, min(len(count1), len(count2), len(count3))):\r\n print(count1[i]+1, count2[i]+1, count3[i]+1)\r\n\r\n", "n=int(input())\r\nt=[]\r\nl=list(map(int,input().split()))\r\nmx=[l.count(1),l.count(2),l.count(3)]\r\na=min(mx)\r\nfor i in range(a):\r\n aq=[l.index(1,i)+1,l.index(2,i)+1,l.index(3,i)+1]\r\n l[l.index(1,i)]=0\r\n l[l.index(2,i)]=0\r\n l[l.index(3,i)]=0\r\n\r\n t.append(aq)\r\nprint(a)\r\nfor i in t:\r\n print(*i)", "n = int(input())\r\nq = list(map(int, input().split()))\r\na = []\r\nb = []\r\nc = []\r\nres = []\r\nmn = 0\r\nfor i in range(len(q)):\r\n if q[i] == 1:\r\n a.append(i)\r\n elif q[i] == 2:\r\n b.append(i)\r\n elif q[i] == 3:\r\n c.append(i)\r\n else:\r\n print(0)\r\n exit()\r\nmn = min(len(a),len(b),len(c))\r\nprint(mn)\r\nfor j in range(mn):\r\n print(a[j]+1, b[j]+1, c[j]+1)\r\n \r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\none=[]\r\ntwo=[]\r\nthree=[]\r\nfor i in range(len(l)):\r\n if l[i]==1:\r\n one.append(i+1)\r\n elif l[i]==2:\r\n two.append(i+1)\r\n elif l[i]==3:\r\n three.append(i+1)\r\n\r\nteams=min(len(one),len(two),len(three))\r\nprint(teams)\r\nfor i in range(teams):\r\n print(one[i],two[i],three[i])", "n = int(input())\r\nt = list(map(int, input().split()))\r\nresult = []\r\n\r\nwhile True:\r\n if 1 in t and 2 in t and 3 in t:\r\n result.append(list((t.index(1)+1, t.index(2)+1, t.index(3)+1)))\r\n t[result[-1][0]-1] = None\r\n t[result[-1][1]-1] = None\r\n t[result[-1][2]-1] = None\r\n else:\r\n break\r\n \r\nprint(len(result))\r\nfor x in result:\r\n print(x[0], x[1], x[2])", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=l.count(1)\r\nb=l.count(2)\r\nc=l.count(3)\r\nx=[]\r\ny=[]\r\nz=[]\r\nfor i in range(len(l)):\r\n if(l[i]==1):\r\n x.append(i)\r\n elif(l[i]==2):\r\n y.append(i)\r\n elif(l[i]==3):\r\n z.append(i)\r\nprint(min(a,b,c))\r\nfor j in range(min(a,b,c)):\r\n print(x[j]+1,y[j]+1,z[j]+1)\r\n \r\n", "def getTeams(gifts):\r\n groups = [[],[],[]]\r\n for i in range(len(gifts)):\r\n groups[gifts[i]-1].append(str(i+1))\r\n\r\n i = 0; j = 0; k = 0; teams = []\r\n while i < len(groups[0]) and j < len(groups[1]) and k < len(groups[2]):\r\n teams.append([groups[0][i], groups[1][j], groups[2][k]])\r\n i += 1\r\n j += 1\r\n k += 1\r\n return teams\r\n\r\nn = int(input())\r\ngifts = list(map(int, input().split(' ')))\r\nteams = getTeams(gifts)\r\nprint(len(teams))\r\nfor team in teams:\r\n print(' '.join(team))\r\n", "import sys\r\n\r\nn = int(input())\r\nx = list(map(int, input().split()))\r\n\r\na, b, c = [], [], []\r\n\r\nfor i in range(n):\r\n if x[i] == 1:\r\n a.append(i)\r\n continue\r\n if x[i] == 2:\r\n b.append(i)\r\n continue\r\n if x[i] == 3:\r\n c.append(i)\r\n continue\r\n\r\nr = min(len(c), min(len(a), len(b))) \r\nprint(r)\r\nfor i in range(r):\r\n print(a[i] + 1, b[i] + 1, c[i] + 1)\r\n\r\n\r\n\r\n'''\r\n1 \r\n3 \r\n6 \r\n10\r\n15\r\n21\r\n28\r\n'''", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\nfor i in range(n):\r\n if l[i]==1:\r\n l1.append(i+1)\r\n elif l[i]==2:\r\n l2.append(i+1)\r\n else:\r\n l3.append(i+1)\r\nresult = min(len(l1),len(l2),len(l3))\r\nprint(result)\r\nfor i in range(result):\r\n print(l1[i],l2[i],l3[i])\r\n\r\n", "x = int(input())\r\narr = list(map(int, input().split()))\r\narr1 = []\r\narr2 = []\r\narr3 = []\r\nprint(min(arr.count(1),arr.count(2),arr.count(3)))\r\nif min(arr.count(1),arr.count(2),arr.count(3)) == 0:\r\n exit()\r\nfor i in range(x):\r\n if arr[i] == 1:\r\n arr1.append(i)\r\n if arr[i] == 2:\r\n arr2.append(i)\r\n if arr[i] == 3:\r\n arr3.append(i)\r\nfor i in range(min(len(arr1),len(arr2),len(arr3))):\r\n print(arr1[i]+1, arr2[i]+1, arr3[i]+1)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nd={}\r\na1=[]\r\nb1=[]\r\nc1=[]\r\na,b,c=0,0,0\r\nd=d.fromkeys(l,0)\r\nj=1\r\nfor i in l:\r\n if i==1:\r\n a=1\r\n a1.append(j)\r\n elif i==2:\r\n b=1 \r\n b1.append(j)\r\n elif i==3:\r\n c=1 \r\n c1.append(j)\r\n d[i]+=1\r\n j+=1\r\nif a!=0 and b!=0 and c!=0:\r\n max_team=min(d.values())\r\nelse:\r\n max_team=0\r\nprint(max_team)\r\nfor i in range(max_team):\r\n print(a1[i],b1[i],c1[i])", "n=int(input())\r\na=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nz=min(a.count(1),a.count(2),a.count(3))\r\nprint(z)\r\nfor i in range(n):\r\n\tif a[i]==1:\r\n\t\tl1.append(a.index(a[i])+1)\r\n\t\ta[i]=0\r\n\telif a[i]==2:\r\n\t\tl2.append(a.index(a[i])+1)\r\n\t\ta[i]=0\r\n\telif a[i]==3:\r\n\t\tl3.append(a.index(a[i])+1)\r\n\t\ta[i]=0\r\nfor i in range(z):\r\n\tprint(l1[i],l2[i],l3[i])", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\no = l.count(1)\r\nt = l.count(2)\r\nh = l.count(3)\r\n\r\nr = min(o , t , h)\r\nprint(r)\r\nfor i in range(r):\r\n i1=l.index(1)\r\n i2=l.index(2)\r\n i3=l.index(3)\r\n print(i1+1,i2+1,i3+1)\r\n l[i1] = -1\r\n l[i2] = -1\r\n l[i3] = -1\r\n\r\n\r\n \r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr1=[]\r\narr2=[]\r\narr3=[]\r\nif len(set(arr)) != 3:\r\n print(0)\r\nelse:\r\n for i in range(len(arr)):\r\n if arr[i]==1:\r\n arr1.append(i+1)\r\n elif arr[i]==2:\r\n arr2.append(i+1)\r\n else:\r\n arr3.append(i+1)\r\n d=min(len(arr1),len(arr2),len(arr3))\r\n print(d)\r\n for i in range(d):\r\n print(arr1[i],arr2[i],arr3[i])", "n=int(input())\r\nl=input().split()\r\nls=[0,0,0]\r\nindex_1=list()\r\nindex_2=list()\r\nindex_3=list()\r\nfor i in range(n):\r\n l[i]=int(l[i])\r\n ls[l[i]-1]+=1\r\n if l[i]==1: index_1.append(i)\r\n elif l[i]==2: index_2.append(i)\r\n else: index_3.append(i)\r\nprint(min(ls))\r\nfor i in range(min(ls)):\r\n print(index_1[i]+1,end=' ')\r\n print(index_2[i]+1,end=' ')\r\n print(index_3[i]+1)", "n = int(input())\r\na = list(map(int,input().split()))\r\ncnta = 0\r\ncntb = 0\r\ncntc = 0\r\naa = []\r\nab = []\r\nac = []\r\nfor i in range(n):\r\n if(a[i] == 1):\r\n cnta += 1\r\n aa += [i]\r\n if(a[i] == 2):\r\n cntb += 1\r\n ab += [i]\r\n if(a[i] == 3):\r\n cntc += 1\r\n ac += [i]\r\nm = min(cnta,cntb,cntc)\r\nprint(m)\r\nfor i in range(m):\r\n print(aa[i]+1,ab[i]+1,ac[i]+1)\r\n \r\n", "n=int(input())\nlst=list(map(int,input().split()))\nlst2=lst.copy()\nlst3=lst.copy()\nt=min(lst.count(1),lst.count(2),lst.count(3))\non=lst.count(1)\ntwo=lst2.count(2)\nthree=lst3.count(3)\no, tw, th = [], [], []\nif t==0:\n print('0')\nelse:\n print(t)\n while on>0:\n o.append(lst.index(1)+1)\n lst.remove(1)\n lst.insert(0,7)\n on-=1\n while two>0:\n tw.append(lst2.index(2)+1)\n lst2.remove(2)\n lst2.insert(0, 7)\n two-=1\n while three> 0:\n th.append(lst3.index(3) + 1)\n lst3.remove(3)\n lst3.insert(0, 7)\n three-=1\nwhile t>0:\n print(o[-1],tw[-1],th[-1])\n o.pop()\n tw.pop()\n th.pop()\n t-=1\n\t \t \t\t \t\t\t\t\t \t \t \t\t\t \t \t", "n = int(input())\r\n\r\nk = list(map(int, input().split()))\r\n\r\narama_elemanlari = [1, 2, 3]\r\n\r\ny = []\r\n\r\nfor eleman in arama_elemanlari:\r\n indeksler = [i+1 for i, x in enumerate(k) if x == eleman]\r\n y.append(indeksler)\r\n\r\n\r\na = len(y[0])\r\nb = len(y[1])\r\nc = len(y[2])\r\n\r\ntotal = []\r\nresult = 0\r\n\r\nfor i in range(min(a, b, c)):\r\n if a >= 1 and b >= 1 and c >= 1:\r\n total.append([y[0][0], y[1][0], y[2][0]])\r\n y[0].remove(y[0][0])\r\n y[1].remove(y[1][0])\r\n y[2].remove(y[2][0])\r\n result += 1\r\n \r\n else:\r\n break\r\n \r\nprint(result)\r\nfor i in total:\r\n print(*i)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=min(a.count(3),a.count(2),a.count(1))\r\nprint(k)\r\nfor i in range(k):\r\n print(a.index(3)+1,a.index(2)+1,a.index(1)+1)\r\n a[a.index(3)]=-1\r\n a[a.index(2)]=-1\r\n a[a.index(1)]=-1", "# trees = [int(x) for x in input().split()]\n# import sys\n# sys.setrecursionlimit(500000)\n# n = int(input())\n\nn = int(input())\ns = [int(x) for x in input().split()]\nt = [[],[],[]]\nfor i in range(len(s)):\n if s[i] ==1:\n t[0].append(i+1)\n elif s[i] == 2:\n t[1].append(i+1)\n else:\n t[2].append(i+1)\ntot = min(len(t[0]),len(t[1]),len(t[2]))\n\nprint(tot)\nif tot !=0:\n for i in range(tot):\n print(t[0][i],t[1][i],t[2][i])\n\n", "from collections import Counter\r\n\r\nn = int(input())\r\nl = [int(x) for x in input().split()]\r\n\r\na = [[], [], []]\r\n\r\nfor i in range(len(l)):\r\n a[l[i] - 1].append(i + 1)\r\nprint(min(map(len, a)))\r\n\r\n\r\nfor i in range(min(map(len, a))):\r\n print(*[a[j][i] for j in range(3)])", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\n# Create lists to store the indices of children with different skills\r\nprogramming = []\r\nmaths = []\r\npe = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n maths.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\n# Calculate the maximum number of teams\r\nteams = min(len(programming), len(maths), len(pe))\r\n\r\n# Print the number of teams\r\nprint(teams)\r\n\r\n# Print the teams\r\nfor i in range(teams):\r\n print(programming[i], maths[i], pe[i])\r\n", "NoOfstudents=int(input())\r\nstudents=[int(x) for x in input().split()]\r\nmaths=[]\r\nprogramming=[]\r\nPE=[]\r\nif NoOfstudents>=3:\r\n for i in range(len(students)):\r\n if students[i]==1:\r\n programming.append(i+1)\r\n elif students[i]==2:\r\n maths.append(i+1)\r\n elif students[i]==3:\r\n PE.append(i+1)\r\nNoOfTeams=min(len(programming),len(maths),len(PE))\r\nprint(NoOfTeams)\r\nfor i in range(NoOfTeams):\r\n print(programming[i],maths[i],PE[i])\r\n ", "n=int(input())\r\nl=list(map(int, input().split()))\r\nw=min(l.count(1),l.count(2),l.count(3))\r\nprint(w)\r\n\r\ni1 = [x for x in range(len(l)) if l[x] == 1]\r\ni2 = [x for x in range(len(l)) if l[x] == 2]\r\ni3 = [x for x in range(len(l)) if l[x] == 3]\r\nfor j in range(w):\r\n print(i1[j]+1, i2[j]+1, i3[j]+1)\r\n \r\n \r\n \r\n \r\n", "n,lst = int(input()),list(map(int, input().split(\" \")))\r\n\r\none = []\r\ntwo = []\r\nthree = []\r\nfor ind, ele in enumerate(lst):\r\n if ele == 1:\r\n one.append(ind+1)\r\n elif ele == 2:\r\n two.append(ind+1)\r\n else:\r\n three.append(ind+1)\r\nteamCount = min({len(one),len(two), len(three)})\r\nprint(teamCount)\r\nfor i in range(teamCount):\r\n print(one[i],two[i], three[i])\r\n\r\n", "n=int(input())\r\nli=list(map(int,input().split()))\r\ni=0\r\nlip=[]\r\nlim=[]\r\nlipe=[]\r\np=m=pe=0\r\nwhile i<n:\r\n if li[i]==1:\r\n p+=1\r\n lip.append(i)\r\n elif li[i]==2:\r\n m+=1\r\n lim.append(i)\r\n else:\r\n pe+=1\r\n lipe.append(i)\r\n i+=1\r\nl=min(p,m,pe)\r\ni=0\r\nprint(l)\r\nwhile i<l:\r\n print(lip[i]+1,lim[i]+1,lipe[i]+1)\r\n i+=1", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\n# Create lists to store the indices of children with different skills\r\nprogramming_indices = []\r\nmath_indices = []\r\npe_indices = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming_indices.append(i)\r\n elif skills[i] == 2:\r\n math_indices.append(i)\r\n else:\r\n pe_indices.append(i)\r\n\r\n# Calculate the maximum number of teams\r\nmax_teams = min(len(programming_indices), len(math_indices), len(pe_indices))\r\n\r\n# Initialize teams list\r\nteams = []\r\n\r\n# Form teams and store them in the 'teams' list\r\nfor i in range(max_teams):\r\n team = [programming_indices[i], math_indices[i], pe_indices[i]]\r\n teams.append(team)\r\n\r\n# Output the maximum number of teams and the teams themselves\r\nprint(max_teams)\r\nfor team in teams:\r\n print(team[0] + 1, team[1] + 1, team[2] + 1)\r\n", "n = int(input())\r\nt = list(map(int, input().split(' ')))\r\n\r\nt1 = sum([1 for i in t if i == 1])\r\nt2 = sum([1 for i in t if i == 2])\r\nt3 = sum([1 for i in t if i == 3])\r\n\r\nw = min(t1, t2, t3)\r\nprint(w)\r\nif w > 0:\r\n d = dict()\r\n for i in range(n):\r\n if t[i] in d.keys():\r\n d[t[i]].append(i+1)\r\n else:\r\n d[t[i]] = [i+1]\r\n\r\n for j in range(w):\r\n print(d[1][j], d[2][j], d[3][j])\r\n\r\n\r\n \r\n \r\n \r\n ", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogramming = []\r\nmath = []\r\nPE = []\r\n\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n math.append(i + 1)\r\n else:\r\n PE.append(i + 1)\r\n\r\nnum_teams = min(len(programming), len(math), len(PE))\r\n\r\nprint(num_teams)\r\nfor i in range(num_teams):\r\n print(f\"{programming[i]} {math[i]} {PE[i]}\")", "def main() -> None :\r\n TEAM_GROUPS: list[list[int]] = team_Groups(input_Skills())\r\n print(len(TEAM_GROUPS))\r\n print_Arrays(TEAM_GROUPS)\r\n\r\n\r\ndef team_Groups(skills: list[int]) -> list[list[int]] :\r\n return shortest_Groups([\r\n skill_Indexes(skills, 1), skill_Indexes(skills, 2), skill_Indexes(skills, 3)\r\n ])\r\n\r\ndef skill_Indexes(skills: list[int], specific_skill: int) -> list[int] :\r\n return [entry[0] for entry in enumerate(skills, 1) if (entry[1] == specific_skill)]\r\n\r\ndef shortest_Groups(skills_indexes_array: list[list[int]]) -> list[tuple[int]] :\r\n return list(zip(*skills_indexes_array))\r\n\r\n\r\ndef input_Skills() -> list[int] :\r\n ignore_Line()\r\n return input_Array()\r\n\r\ndef ignore_Line() -> None :\r\n input()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef print_Arrays(arrays: list[list[int]]) -> None :\r\n for array in arrays :\r\n print_Array(array)\r\n\r\ndef print_Array(array: list[int]) -> None :\r\n print(\" \".join(map(str, array)))\r\n\r\n\r\nmain()", "n=int(input())\r\na1,a2,a3=[],[],[]\r\na=[int(i) for i in input().split()]\r\nm=min(a.count(1),a.count(2),a.count(3))\r\nprint(m)\r\nfor i in range(n):\r\n if a[i]==1:\r\n a1.append(i+1)\r\n elif a[i]==2:\r\n a2.append(i+1)\r\n else:\r\n a3.append(i+1)\r\nfor i in range(m):\r\n print(a1[i],a2[i],a3[i])\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nf=a.count(1)\r\nf2=a.count(2)\r\nf3=a.count(3)\r\nprint(min(f,f2,f3))\r\nfor i in range(min(f,f2,f3)):\r\n q=a.index(1)\r\n o=a.index(2)\r\n s=a.index(3)\r\n print(q+1,o+1,s+1)\r\n a[q]=0\r\n a[o]=0\r\n a[s]=0", "n = int(input())\r\na = list(map(int, input().split()))\r\nt_num = min(a.count(1), a.count(2), a.count(3))\r\n\r\nprint(t_num)\r\nfor i in range(t_num):\r\n a1 = a.index(1); a2 = a.index(2); a3 = a.index(3)\r\n a[a1] = \"\"; a[a2] = \"\"; a[a3] = \"\"\r\n print(a1+1, a2+1, a3+1)", "p=int(input())\nn=list(map(int,input().split()))\nm=[[],[],[]]\nfor i in range(p):\n if n[i]==1:\n m[0].append(i+1)\n if n[i]==2:\n m[1].append(i+1)\n if n[i]==3:\n m[2].append(i+1)\nk=min(len(m[0]),len(m[1]),len(m[2]))\nprint(k)\nif k!=0:\n for i in range(k):\n print((m[0][i]),(m[1][i]),(m[2][i]))\n\n\t \t \t \t \t \t \t \t\t \t \t \t\t \t\t\t", "input()\nlst = list(map(int, input().split()))\nb, app = [], []\nnum = 0\nwhile True:\n for i in range(1, 4):\n if i not in lst:\n num = 1\n break\n else:\n app.append(lst.index(i) + 1)\n lst[lst.index(i)] = '------'\n if num == 1:\n break\n else:\n b.append(app)\n app = []\nprint(len(b))\n[print(*v) for v in b]\n# Tue Apr 18 2023 10:45:58 GMT+0300 (Moscow Standard Time)\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nw = min(p.count(1), p.count(2), p.count(3))\r\nprint(w)\r\nif w > 0:\r\n teams = [[], [], []]\r\n for j in range(len(p)):\r\n if len(teams[0]) == len(teams[1]) == len(teams[2]) == w:\r\n break\r\n elif len(teams[p[j]-1]) < w:\r\n teams[p[j]-1].append(j+1)\r\n if w > 0:\r\n for k in range(len(teams[1])):\r\n s = ''\r\n for m in range(3):\r\n s += str(teams[m][k]) + ' '\r\n print(s)", "n = int(input())\r\nlis = list(map(int,input().split()))\r\narr = [[0,0,0] for i in range(5000)]\r\ni1, i2, i3 = 0,0,0\r\nans=0\r\na=[]\r\n# print(arr)\r\nfor i in range(n):\r\n if lis[i] ==1 :\r\n arr[i1][0] = i+1\r\n i1+=1\r\n elif lis[i]==2:\r\n arr[i2][1] = i+1\r\n i2+=1\r\n else:\r\n arr[i3][2] = i+1\r\n i3+=1\r\n # print(arr)\r\nfor i in range(n):\r\n if arr[i][0]==0 or arr[i][1]==0 or arr[i][2] == 0:\r\n break\r\n else:\r\n ans+=1\r\n a.append([arr[i][0], arr[i][1], arr[i][2]])\r\nprint(ans)\r\nfor i in a:\r\n print(*i)\r\n \r\n ", "x = int(input())\r\nl = list(map(int, input().split()))\r\nif l.count(1) >= 1 and l.count(2) >= 1 and l.count(3) >= 1:\r\n y = min(l.count(1), l.count(2), l.count(3))\r\n print(y)\r\n\r\n for _ in range(y):\r\n index_1 = l.index(1)\r\n index_2 = l.index(2)\r\n index_3 = l.index(3)\r\n\r\n print(index_1 + 1, index_2 + 1, index_3 + 1)\r\n\r\n # Set the elements at these indices to 0 so that they won't be counted again\r\n l[index_1] = 0\r\n l[index_2] = 0\r\n l[index_3] = 0\r\nelse:\r\n print(0)", "n = int (input())\nl = list(map(int,input().split()))\none = l.count(1)\ntwo = l.count(2)\nthree = l.count(3)\nm = min(one,two,three)\nprint(m)\nfor i in range (m) :\n ind1=l.index(1)\n ind2 = l.index(2)\n ind3 = l.index(3)\n print(ind1 +1 ,ind2 +1, ind3 +1)\n l[ind1 ] = -1\n l[ind2] = -2\n l[ind3] = -3\n\n \t \t\t\t\t\t\t \t \t\t\t\t\t\t \t \t\t\t", "def teanOlympiad():\r\n n = int(input())\r\n sumOfArray = [0]*3\r\n arr = [int(i) for i in input().split()]\r\n for i in arr:\r\n sumOfArray[i-1] +=1\r\n teams = min(sumOfArray)\r\n print(teams)\r\n check = [True]*n\r\n for i in range(teams):\r\n for j in range(n):\r\n if(check[j]==True and arr[j] == 1):\r\n print(j+1, end=' ')\r\n check[j] = False\r\n break\r\n for j in range(n):\r\n if(check[j]==True and arr[j] == 2):\r\n print(j+1, end=' ')\r\n check[j] = False\r\n break\r\n for j in range(n):\r\n if(check[j]==True and arr[j] == 3):\r\n print(j+1)\r\n check[j] = False\r\n break\r\n return\r\nteanOlympiad()\r\n\r\n ", "def f():\r\n n=int(input())\r\n t=list(map(int,input().split(\" \")))\r\n dic={}\r\n for i in t:\r\n if i not in dic:\r\n dic[i]=1\r\n else:\r\n dic[i]=dic[i]+1\r\n flag=0\r\n ans=[]\r\n while True:\r\n if 1 in dic and dic[1]==0:\r\n break\r\n if 2 in dic and dic[2]==0:\r\n break\r\n if 3 in dic and dic[3]==0:\r\n break\r\n \r\n l=[]\r\n for i in dic:\r\n dic[i]=dic[i]-1\r\n ind=t.index(i)\r\n l.append(ind+1)\r\n t[ind]=-1\r\n if len(l)!=3:\r\n print(0)\r\n flag=1\r\n break\r\n ans.append(l)\r\n if flag==0:\r\n print(len(ans))\r\n for i in ans:\r\n print(*i)\r\nf()\r\n \r\n", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogramming = []\r\nmath = []\r\npe = []\r\n\r\n# Separate children into lists based on their skills\r\nfor i in range(n):\r\n if skills[i] == 1:\r\n programming.append(i + 1)\r\n elif skills[i] == 2:\r\n math.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\n# Find the maximum number of teams that can be formed\r\nmax_teams = min(len(programming), len(math), len(pe))\r\n\r\n# Print the maximum number of teams\r\nprint(max_teams)\r\n\r\n# Print the teams\r\nfor i in range(max_teams):\r\n print(programming[i], math[i], pe[i])\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\nn=int(input())\r\na=list(map(int,input().split()))\r\ncnt=[[] for i in range(3)]\r\nfor i in range(n):\r\n cnt[a[i]-1].append(i+1)\r\nans=n\r\nfor i in range(len(cnt)):\r\n if len(cnt[i])<=ans:\r\n ans=len(cnt[i])\r\nprint(ans)\r\nfor i in range(ans):\r\n for j in range(3):\r\n print(cnt[j][i],end=' ')\r\n print()", "n = int(input())\r\nli = list(map(int,input().split()))\r\n\r\na = [i+1 for i in range(n) if li[i] == 1]\r\nb = [i+1 for i in range(n) if li[i] == 2]\r\nc = [i+1 for i in range(n) if li[i] == 3]\r\n\r\nl = min(len(a),len(b),len(c))\r\nprint(l)\r\n\r\nif l != 0:\r\n for i in range(l):\r\n print(a[i],b[i],c[i])", "import sys\r\n\r\nn = int(sys.stdin.readline())\r\nl = list(map(int, sys.stdin.readline().split()))\r\nft = []\r\nsd = []\r\ntd = []\r\nfor i in range(len(l)):\r\n if l[i] == 3:\r\n td.append(i)\r\n elif l[i] == 2:\r\n sd.append(i)\r\n elif l[i] == 1:\r\n ft.append(i)\r\na = min(len(ft), len(sd), len(td))\r\nprint(a)\r\nfor i in range(a):\r\n s = \" \".join([str(ft[i] + 1), str(sd[i] + 1), str(td[i] + 1)])\r\n print(s)\r\n", "n = int(input())\r\n*t, = map(int, input().split(' '))\r\nans = min(t.count(1), t.count(2), t.count(3))\r\nprint(ans)\r\nfor i in range(ans):\r\n index1 = -1\r\n index2 = -1\r\n index3 = -1\r\n ans_i = []\r\n for j in range(n):\r\n if t[j] == 1:\r\n index1 += 1\r\n elif t[j] == 2:\r\n index2 += 1\r\n else:\r\n index3 += 1\r\n if index1 == i:\r\n ans_i.append(j + 1)\r\n index1 = n\r\n elif index2 == i:\r\n ans_i.append(j + 1)\r\n index2 = n\r\n elif index3 == i:\r\n ans_i.append(j + 1)\r\n index3 = n\r\n if len(ans_i) == 3:\r\n break\r\n print(*ans_i)\r\n", "n = int(input())\r\n\r\nx = [int(y) for y in input().split()]\r\n\r\nd = {}\r\na=[]\r\nb=[]\r\nc=[]\r\n\r\nfor index,element in enumerate(x):\r\n if element== 1:\r\n a.append(index)\r\n if element == 2:\r\n b.append(index)\r\n if element == 3:\r\n c.append(index)\r\n\r\nm = min(len(a),len(b),len(c))\r\n\r\nif m == 0:\r\n print(\"0\")\r\nelse:\r\n print(m)\r\n\r\n for i in range(m):\r\n print(str(a[i]+1),str(b[i]+1),str(c[i]+1))", "n = int(input())\r\narr = list(map(int,input().split()))\r\na = arr.count(1)\r\nb = arr.count(2)\r\nc = arr.count(3)\r\nprint(min(a,b,c))\r\nfor i in range(min(a,b,c)):\r\n print(arr.index(1)+1, end = \" \")\r\n print(arr.index(2)+1, end = \" \")\r\n print(arr.index(3)+1)\r\n arr[arr.index(1)] = 0\r\n arr[arr.index(2)] = 0\r\n arr[arr.index(3)] = 0", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nprogrammers = [i+1 for i in range(n) if students[i] == 1]\r\nmathematicians = [i+1 for i in range(n) if students[i] == 2]\r\nathletes = [i+1 for i in range(n) if students[i] == 3]\r\n\r\nnum_teams = min(len(programmers), len(mathematicians), len(athletes))\r\n\r\nprint(num_teams)\r\nfor i in range(num_teams):\r\n print(programmers[i], mathematicians[i], athletes[i])\r\n\r\n", "number_of_teams = int(input())\r\nskills = list(map(int, input().split()))\r\np = [] # programming\r\nm = [] # math\r\ns = [] # Science (physics)\r\n\r\nfor i in range(number_of_teams):\r\n if skills[i] == 1:\r\n p.append(i+1)\r\n elif skills[i] == 2:\r\n m.append(i+1)\r\n else:\r\n s.append(i+1)\r\n\r\ncounter = min(len(p), len(m), len(s))\r\n\r\nprint(counter)\r\nfor i in range(counter):\r\n print(p[i], m[i], s[i])", "import sys\n\ninput = sys.stdin.readline\nprint = sys.stdout.write\n\nn = int(input())\nnums = list(map(int, input().split()))\n\nnum_dict = {\"1\": [], \"2\": [], \"3\": []}\n\nfor i, num in enumerate(nums):\n if num == 1:\n num_dict[\"1\"].append(i + 1)\n\n elif num == 2:\n num_dict[\"2\"].append(i + 1)\n\n else:\n num_dict[\"3\"].append(i + 1)\n\nmin_count, min_val = float(\"inf\"), 0\n\nfor key, value in num_dict.items():\n if len(value) < min_count:\n min_count = len(value)\n min_val = key\n\nif min_count == 0:\n print(\"0\")\n sys.exit()\n\nprint(f\"{min_count} \\n\")\nfor i in range(len(num_dict[min_val])):\n print(f'{num_dict[\"1\"][i]} {num_dict[\"2\"][i]} {num_dict[\"3\"][i]} \\n')\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nx = min(l.count(1),l.count(2),l.count(3))\r\nprint(x)\r\nfor i in range(x):\r\n print(l.index(1) + 1 , l.index(2) +1 , l.index(3) +1 , end = ' ')\r\n l[l.index(1)] = -1\r\n l[l.index(2)] = -1\r\n l[l.index(3)] = -1\r\n print()", "a = int(input())\r\n#l1 = [list(map(int, input().split())) for _ in range(2*a)][1::2]\r\n\r\nlx = list(map(int, input().split()))\r\naa = min(lx.count(1),lx.count(2),lx.count(3))\r\nprint(aa)\r\nl1 = list()\r\nl2 = list()\r\nl3 = list()\r\nfor j,k in enumerate(lx):\r\n if k == 1:\r\n l1.append(j+1)\r\n elif k == 2:\r\n l2.append(j+1)\r\n elif k == 3:\r\n l3.append(j+1)\r\nfor e in range(aa):\r\n print(f\"{l1[e]} {l2[e]} {l3[e]}\")\r\n", "n = int(input())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\ny = [x.count(1), x.count(2), x.count(3)]\r\n\r\ny.sort()\r\n\r\nif y.count(0) > 0:\r\n print(0)\r\nelse:\r\n print(y[0])\r\n i, j, k = 0, 0, 0\r\n for l in range(y[0]):\r\n i = x.index(1, i) + 1\r\n j = x.index(2, j) + 1\r\n k = x.index(3, k) + 1\r\n print(i, j, k)\r\n", "def get_indexes(my_list, my_char):\r\n indexes = list()\r\n index = 0\r\n for _ in my_list:\r\n if my_char in my_list[index:]:\r\n index = my_list.index(my_char, index)\r\n indexes.append(index)\r\n index += 1\r\n return indexes\r\n\r\nstudent = int(input())\r\nparams = input().split()\r\n\r\nif ('1' in params) and ('2' in params) and ('3' in params):\r\n programmers, maths, pes = params.count('1'), params.count('2'), params.count('3')\r\n teams = min(programmers , maths, pes)\r\n print(teams)\r\n\r\n programmer_members = get_indexes(params, '1')\r\n math_members = get_indexes(params, '2')\r\n pe_members = get_indexes(params, '3')\r\n\r\n for _ in range(teams):\r\n print(f'{programmer_members[_]+1} {math_members[_]+1} {pe_members[_]+1}')\r\n\r\nelse:\r\n print(0)", "n = int(input())\r\nT = [int(i) for i in input().split()]\r\nif 1<= n <= 5000 and len(T) == n:\r\n P =[]\r\n M = []\r\n PE = []\r\n c = 0\r\n for t in T:\r\n c += 1\r\n if t == 1 :\r\n P.append(c)\r\n elif t == 2:\r\n M.append(c)\r\n elif t == 3:\r\n PE.append(c)\r\n else:\r\n print(\"Error: The second input contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 3)\")\r\n break\r\n if len(P) == 0 or len(M) == 0 or len(PE) == 0:\r\n print(0)\r\n else:\r\n lenTeam = min(len(P), len(M), len(PE))\r\n print(lenTeam)\r\n for j in range(lenTeam):\r\n print(P[j], M[j], PE[j])", "n = int(input())\r\nar = list(map(int, input().split()))\r\nn1 = ar.count(1)\r\nn2 = ar.count(2)\r\nn3 = ar.count(3)\r\nw = min(n1,n2,n3)\r\nprint(w)\r\na = [[],[],[]]\r\nfor i in range(n):\r\n if ar[i] == 1:\r\n a[0].append(i+1)\r\n elif ar[i] == 2:\r\n a[1].append(i+1)\r\n elif ar[i] == 3:\r\n a[2].append(i+1)\r\nfor i in range(w):\r\n print(a[0][i], a[1][i],a[2][i])", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nans = 0\r\nteams = [0, 0, 0, 0]\r\n\r\ndef check(teams):\r\n if teams[1] > 0 and teams[2] > 0 and teams[3] > 0:\r\n teams[1]-=1; teams[2] -=1; teams[3] -=1\r\n return True\r\n return False\r\nff = []\r\nindexes = [[], [], [], []]\r\nfor i in range(len(arr)):\r\n teams[arr[i]] += 1\r\n indexes[arr[i]].append(i)\r\n if check(teams):\r\n ans += 1\r\n string = \"\"\r\n for i in range(1, len(indexes)):\r\n string += str(indexes[i].pop()+1)+\" \"\r\n ff.append(string)\r\n\r\nprint(ans)\r\nfor i in ff:\r\n print(i)", "n = int(input())\r\ntalent = list(map(int,input().split()))\r\nif (1 not in talent)or(2 not in talent)or(3 not in talent):\r\n print(0)\r\nelse:\r\n num1 = talent.count(1)\r\n num2 = talent.count(2)\r\n num3 = talent.count(3)\r\n print(min(num1,num2,num3))\r\n while (1 in talent)and(2 in talent)and(3 in talent):\r\n i1 = talent.index(1)\r\n i2 = talent.index(2)\r\n i3 = talent.index(3)\r\n print(i1+1,i2+1,i3+1)\r\n talent[i1] = 0\r\n talent[i2] = 0\r\n talent[i3] = 0", "n = int(input())\r\nt = list(map(int, input().split()))[:n]\r\n\r\nprgm = t.count(1)\r\nmath = t.count(2)\r\nsport = t.count(3)\r\n\r\nmx = min(prgm,math,sport)\r\nif mx == 0:\r\n print(0)\r\nelse:\r\n p = []\r\n m = []\r\n s = []\r\n for i in range(n):\r\n if t[i] == 1:\r\n p.append(i+1)\r\n elif t[i] == 2:\r\n m.append(i+1)\r\n else:\r\n s.append(i+1)\r\n print(mx)\r\n for i in range(mx):\r\n print(p[i],m[i],s[i])\r\n\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\nprint(min(t.count(1), t.count(2), t.count(3)))\r\na = []; b = []; c = []\r\nfor i in range(n):\r\n if t[i] == 1:\r\n a.append(i + 1)\r\n if t[i] == 2:\r\n b.append(i + 1)\r\n if t[i] == 3:\r\n c.append(i + 1)\r\nfor j in range(min(len(a), len(b), len(c))):\r\n print(a[j], b[j], c[j])", "n= int(input())\r\nt= [int(x) for x in input().split()]\r\n\r\nP,M,PE=[],[],[]\r\n\r\nfor i in range(1,n+1):\r\n if t[i-1]==1:\r\n P.append(i)\r\n elif t[i-1]==2:\r\n M.append(i)\r\n elif t[i-1]==3:\r\n PE.append(i)\r\n\r\nprint(min(len(PE),len(M),len(P)))\r\n\r\ncnt=0\r\nwhile cnt<len(P) and cnt<len(M) and cnt<len(PE):\r\n print(f\"{P[cnt]} {M[cnt]} {PE[cnt]}\")\r\n cnt+=1\r\n ", "n = int(input())\ninp = list(map(int, input().split(' ')))\n\nk = min((inp.count(1), inp.count(2), inp.count(3)))\none_idx, two_idx, three_idx = list(), list(), list()\nfor i, num in enumerate(inp):\n if num == 1:\n one_idx.append(i + 1)\n elif num == 2:\n two_idx.append(i + 1)\n else:\n three_idx.append(i + 1)\nprint(k)\nif k > 0:\n for i in range(k):\n print(one_idx[i], two_idx[i], three_idx[i])\n", "n = int(input())\r\n\r\nonelist , twolist , threelist = [],[],[]\r\n\r\nnlist = list(map(int, input().split()))\r\n\r\nfor num,skills in enumerate(nlist) :\r\n if skills == 1 :\r\n onelist.append(num+1)\r\n elif skills == 2:\r\n twolist.append(num+1)\r\n elif skills == 3:\r\n threelist.append(num+1)\r\n\r\nteam = min(len(onelist),len(twolist),len(threelist))\r\nprint(team)\r\nfor i in range(team):\r\n print(onelist[i],twolist[i],threelist[i])\r\n \r\n", "n = int(input())\r\nins = [int(x) for x in input().split(\" \")]\r\nins123 = [[] , [] , []]\r\n\r\nfor index in range(n):\r\n ins123[ins[index] - 1].append(index)\r\n\r\nminSize = min([len(x) for x in ins123])\r\n\r\nprint(minSize)\r\nfor i in range(minSize):\r\n for j in ins123:\r\n print(j.pop(0)+1 , end = \" \")\r\n print()", "n = int(input())\r\n\r\nr = [[], [], []]\r\nfor i, x in enumerate(map(int, input().split()), 1):\r\n r[x-1].append(i)\r\n\r\nq = len(min(r, key=len))\r\nprint(q)\r\nfor i in range(q):\r\n print(r[0][i], r[1][i], r[2][i])\r\n", "t=int(input())\r\nliste=list(map(int,input().split()))\r\nmini=min(liste.count(1),liste.count(2),liste.count(3))\r\nprint(mini)\r\na=0\r\nb=0\r\nc=0\r\nliste2=list()\r\nliste3=list()\r\nliste4=list()\r\nfor i in range(len(liste)):\r\n if liste[i]==1:\r\n liste2.append(i+1)\r\n elif liste[i]==2:\r\n liste3.append(i+1)\r\n else:\r\n liste4.append(i+1)\r\nfor i in range(mini):\r\n print(liste2[i],liste3[i],liste4[i])", "x = int(input())\r\nl = list(map(int , input().split()))\r\n\r\np , m , pe = l.count(1) , l.count(2) , l.count(3)\r\n\r\nif p ==0 or m == 0 or pe ==0:\r\n print(0)\r\n exit()\r\n\r\nif p < m:\r\n if p < pe:\r\n k = p\r\n else:\r\n k = pe\r\nelse:\r\n if m <pe :\r\n k = m\r\n else:\r\n k = pe\r\n\r\nprint(k)\r\nfor i in range(k):\r\n one = l.index(1)\r\n two = l.index(2)\r\n three = l.index(3)\r\n print(one+1 , two+1 , three+1)\r\n l[one] = 4\r\n l[two] = 4\r\n l[three] =4", "#E\r\nn = int(input())\r\nm = [int(x) for x in input().split()]\r\nx = []\r\ny = []\r\nz = []\r\na = m.count(1)\r\nb = m.count(2)\r\nc = m.count(3)\r\nprint(min(a, b, c))\r\nfor i in range(n):\r\n if (m[i]==1):\r\n x.append(i+1)\r\n elif (m[i]==2):\r\n y.append(i+1)\r\n elif (m[i]==3):\r\n z.append(i+1)\r\nfor i in range(min(a, b, c)):\r\n print(x[i], y[i], z[i])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jan 15 20:50:22 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\nn=int(K[0])\r\nK=K[1].split(' ')\r\nl1=[]\r\nfor c in ['1','2','3']:\r\n l=[]\r\n for m in range(n):\r\n if K[m]==c:\r\n l.append(m+1)\r\n l1.append(l)\r\nl2=[]\r\nwhile l1.count([])==0:\r\n l2.append(str(l1[0][0])+' '+str(l1[1][0])+' '+str(l1[2][0]))\r\n l1[0].pop(0)\r\n l1[1].pop(0)\r\n l1[2].pop(0)\r\nprint(len(l2))\r\nfor m in range(len(l2)):\r\n print(l2[m])\r\n \r\n \r\n\r\n\r\n ", "def main():\r\n n = int(input())\r\n arr = []\r\n\r\n ll=list(map(int,input().split()))\r\n arr=[]\r\n for i in ll:\r\n arr.append((i,False))\r\n\r\n one = two = three = 0\r\n\r\n for i in range(n):\r\n if arr[i][0] == 1:\r\n one += 1\r\n elif arr[i][0] == 2:\r\n two += 1\r\n else:\r\n three += 1\r\n\r\n c = 0\r\n\r\n while one > 0 and two > 0 and three > 0:\r\n c += 1\r\n one -= 1\r\n two -= 1\r\n three -= 1\r\n\r\n a = b = z = 0\r\n\r\n print(c)\r\n\r\n while c > 0:\r\n for i in range(n):\r\n if arr[i][0] == 1 and not arr[i][1]:\r\n a = i\r\n arr[i] = (arr[i][0], True)\r\n break\r\n\r\n for i in range(n):\r\n if arr[i][0] == 2 and not arr[i][1]:\r\n b = i\r\n arr[i] = (arr[i][0], True)\r\n break\r\n\r\n for i in range(n):\r\n if arr[i][0] == 3 and not arr[i][1]:\r\n z = i\r\n arr[i] = (arr[i][0], True)\r\n break\r\n\r\n print(a + 1, b + 1, z + 1)\r\n c -= 1\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\nvalues=list(map(int,input().split(' ')))\r\nw=min(values.count(1),values.count(2),values.count(3))\r\nprint(w)\r\n\r\nif(w!=0):\r\n one=0\r\n two=0\r\n three=0\r\n for i in range(0,w):\r\n for j in range(one,n):\r\n if(values[j]==1):\r\n print(j+1,end=' ')\r\n one = j+1\r\n break\r\n for j in range(two,n):\r\n if(values[j]==2):\r\n print(j+1,end=' ')\r\n two = j+1\r\n break\r\n for j in range(three,n):\r\n if(values[j]==3):\r\n print(j+1)\r\n three = j+1\r\n break", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nprogramming = [i for i, val in enumerate(students) if val == 1]\r\nmaths = [i for i, val in enumerate(students) if val == 2]\r\nphysical = [i for i, val in enumerate(students) if val == 3]\r\n\r\nif programming and maths and physical: #모든 분야에 인재가 한명씩 있을때\r\n m = min(len(programming), len(maths), len(physical))\r\n print(m)\r\n\r\n for i in range(m):\r\n print(programming[i] + 1, end = ' ')\r\n print(maths[i] + 1, end = ' ')\r\n print(physical[i] + 1)\r\nelse: #모든 분야에 인재가 한명씩 없을때\r\n print(0)", "n = int(input())\r\ns = list(map(int, input().split()))\r\na1 = []\r\na2 = []\r\na3 = []\r\nfor i in range(len(s)):\r\n if s[i] == 1:\r\n a1.append(i + 1)\r\n elif s[i] == 2:\r\n a2.append(i + 1)\r\n else:\r\n a3.append(i + 1)\r\nkol = min(len(a1), len(a2), len(a3))\r\nprint(kol)\r\nfor i in range(kol):\r\n print(a1[0], a2[0], a3[0])\r\n a1 = a1[1:]\r\n a2 = a2[1:]\r\n a3 = a3[1:]\r\n", "n = int(input())\r\ncs = input().split(' ')\r\n\r\np=[i+1 for i,x in enumerate(cs) if x == '1']\r\nm=[i+1 for i,x in enumerate(cs) if x == '2']\r\ns=[i+1 for i,x in enumerate(cs) if x == '3']\r\n\r\nmx = min([cs.count('1'),cs.count('2'),cs.count('3')])\r\n\r\nprint(mx)\r\n\r\nfor i in range(mx):\r\n print(p[i],m[i],s[i])", "def solve():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n \r\n cnt1, cnt2, cnt3 = 0, 0, 0\r\n arr1, arr2, arr3 = [], [], []\r\n \r\n i = 0\r\n while(i < n):\r\n if arr[i] == 1:\r\n cnt1 += 1\r\n arr1.append(i+1)\r\n elif arr[i] == 2:\r\n cnt2 += 1\r\n arr2.append(i+1)\r\n else:\r\n cnt3 += 1\r\n arr3.append(i+1)\r\n \r\n i += 1\r\n \r\n teams = min(cnt1, cnt2, cnt3)\r\n print(teams)\r\n for j in range(teams):\r\n print(arr1[j], arr2[j], arr3[j])\r\n\r\nsolve()", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = min(a.count(1), a.count(2), a.count(3))\r\nprint(count)\r\nfor i in range(count):\r\n print(a.index(1) + 1, end = ' ')\r\n a[a.index(1)] = 0\r\n print(a.index(2) + 1, end = ' ')\r\n a[a.index(2)] = 0\r\n print(a.index(3) + 1, end = ' ')\r\n a[a.index(3)] = 0\r\n print()", "no_of_students = int(float(input()))\r\nProg_list=[]\r\nmath_list=[]\r\nPE_list=[]\r\ngifts= input()\r\ngifts = gifts.split(' ')\r\n\r\nfor i in range(len(gifts)):\r\n if (int(gifts[i])==1):\r\n Prog_list.append(i+1)\r\n elif (int(gifts[i])==2):\r\n math_list.append(i + 1)\r\n elif (int(gifts[i])==3):\r\n PE_list.append(i + 1)\r\n\r\nif ((not(len(Prog_list))) or (not(len(math_list))) or (not(len(PE_list)))):\r\n print(\"0\")\r\n\r\nteams = min(len(Prog_list),len(math_list),len(PE_list))\r\n\r\n\r\nif(teams):\r\n print(teams)\r\n for i in range(teams):\r\n print(Prog_list[i], \"\", math_list[i], \"\", PE_list[i])\r\n", "fre=[1000000000,0,0,0]\r\nnum = int(input())\r\nx = list(map(int,input().split()))\r\nt1=[]\r\nt2=[]\r\nt3=[]\r\nfor i in range(len(x)):\r\n if x[i] == 1:\r\n t1.append(i)\r\n elif x[i] == 2:\r\n t2.append(i)\r\n elif x[i] == 3:\r\n t3.append(i)\r\nfor i in x:\r\n fre[i]+=1;\r\nprint(min(fre))\r\nfor i in range(min(fre)):\r\n print (t1[i]+1,\"\",t2[i]+1,\"\",t3[i]+1)\r\n", "\nn = input()\nn = int(n)\n\nmylist = input().split()\nmylist = [int(x) for x in mylist]\n\nlist1 = []\nlist2 = []\nlist3 = []\n\nfor i in range(n):\n\n if mylist[i] == 1:\n list1.append(i + 1)\n\n if mylist[i] == 2:\n list2.append(i + 1)\n\n if mylist[i] == 3:\n list3.append(i + 1)\n\nnumber_of_teams = min(len(list1) , len(list2) , len(list3))\nprint(number_of_teams)\n\n\nfor j in range(number_of_teams):\n print(list1[j] , list2[j] , list3[j])\n\n# Time Complexity : O(n)\n\t\t\t \t\t\t\t\t\t\t\t\t \t\t\t \t \t\t\t \t\t\t\t", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\nskill_dict = {1: 0, 2: 0, 3: 0}\r\nskill_position_dict = {1: [], 2: [], 3: []}\r\nfor idx, i in enumerate(t):\r\n skill_dict[i] += 1\r\n skill_position_dict[i].append(idx + 1)\r\n\r\nnumber_of_teams = min(skill_dict.values())\r\n\r\nprint(number_of_teams)\r\nfor n_team in range(number_of_teams):\r\n team = []\r\n for skill in skill_position_dict.values():\r\n team.append(skill[n_team])\r\n print(*team, sep=\" \")", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl = list(enumerate(l, start=1)); l = [l[i][::-1] for i in range(len(l))]\r\nl_1, l_2, l_3, res = [], [], [], []\r\nwhile l and min(l)[0] == 1:\r\n l_1.append(l.pop(l.index(min(l))))\r\nwhile l and min(l)[0] == 2:\r\n l_2.append(l.pop(l.index(min(l))))\r\nl_3 = l\r\nwhile l_1 and l_2 and l_3:\r\n res.append(l_1.pop(0))\r\n res.append(l_2.pop(0))\r\n res.append(l_3.pop(0))\r\nprint(len(res)//3)\r\nfor i in range(0, len(res), 3):\r\n print(res[i][1], res[i+1][1], res[i+2][1])", "n=int(input())\r\nx=list(map(int,input().split()))\r\nl,m,n=[],[],[]\r\nfor i in range(len(x)):\r\n if x[i]==1:\r\n l.append(x[i])\r\n elif x[i]==2:\r\n m.append(x[i])\r\n else:\r\n n.append(x[i])\r\nk=min(len(l),len(m),len(n))\r\nprint(k)\r\nif k>0:\r\n for i in range(k):\r\n i1,i2,i3=x.index(1),x.index(2),x.index(3)\r\n print(i1+1,i2+1,i3+1)\r\n x[i1],x[i2],x[i3]=0,0,0", "n = int(input())\r\nskills = list(map(int, input().split()))\r\ncount = [0, 0, 0] \r\nfor skill in skills:\r\n count[skill - 1] += 1\r\nmax_teams = min(count) \r\n\r\n\r\nteams = []\r\nfor _ in range(max_teams):\r\n team = []\r\n for i in range(3):\r\n j = skills.index(i + 1)\r\n team.append(j + 1)\r\n skills[j] = 0 \r\n teams.append(team)\r\n\r\n\r\nprint(max_teams)\r\nfor team in teams:\r\n print(*team)", "n=int(input())\r\na=b=c=0\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nl=list(map(int,input().split()))\r\nfor i in range (n):\r\n if (l[i]==1):\r\n a=a+1\r\n l1.append(i+1)\r\n elif (l[i]==2):\r\n b=b+1\r\n l2.append(i+1)\r\n elif (l[i]==3):\r\n c=c+1\r\n l3.append(i+1)\r\nprint(min(a,b,c))\r\n#print(l1,l2,l3)\r\nfor i in range (min(a,b,c)):\r\n print(l1[i],l2[i],l3[i])\r\n", "a = int(input())\r\nb = list(map(int,input().split()))\r\nx = [i for i, er in enumerate(b) if er == 1]\r\nl = [j for j, er2 in enumerate(b) if er2 == 2]\r\np = [h for h, er3 in enumerate(b) if er3 == 3]\r\nprint(min(len(x),len(l),len(p)))\r\nfor i in range(0,min(len(x),len(l),len(p))):\r\n print(x[i]+1,l[i]+1,p[i]+1)\r\n", "t = int(input())\nq = [int(x) for x in input().split()]\nn = min(q.count(1), q.count(2), q.count(3))\n\nprint(n)\n\nfor _ in range(n):\n\ti1 = q.index(1)+1\n\ti2 = q.index(2)+1\n\ti3 = q.index(3)+1\n\t\n\tq[i1-1] = -1\n\tq[i2-1] = -1\n\tq[i3-1] = -1\n\t\n\tprint(i1, end=' ')\n\tprint(i2, end=' ')\n\tprint(i3)\n \t \t\t\t\t \t\t\t \t \t \t\t\t\t\t\t\t", "\r\nx= int(input())\r\ny=input()\r\na,b,c=y.count('1'),y.count('2'),y.count('3')\r\nm=min(a,b,c)\r\nprint(m)\r\na,b,c=-1,-1,-1\r\n\r\nr=(y.split())[::-1]\r\n\r\ns=''\r\nfor i in range(m):\r\n a,b,c=r.index('1',a+1),r.index('2',b+1),r.index('3',c+1)\r\n s=f'{x-a} {x-b} {x-c}\\n'+s\r\nif s!='':\r\n print(s)\r\n\r\n\r\n", "if __name__ == \"__main__\":\r\n n = int(input())\r\n children = list(map(int, input().split()))\r\n\r\n table = {1: [], 2: [], 3: []}\r\n\r\n for i in range(n):\r\n table[children[i]] = [i + 1] + table.get(children[i], []) \r\n \r\n\r\n i = 1\r\n teams, currTeam = [], []\r\n while True:\r\n if i > 3:\r\n i = 1\r\n else:\r\n if len(table[i]):\r\n currTeam.append(table[i].pop(0))\r\n else:\r\n break\r\n \r\n if len(currTeam) == 3 and i == 3:\r\n teams.append(currTeam)\r\n currTeam = []\r\n \r\n i += 1\r\n\r\n print(len(teams))\r\n for team in teams:\r\n print(*team)\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\nm = {1:[],2:[],3:[]}\r\nfor i in range(n):\r\n if x[i] == 1 :\r\n m[1].append(i+1)\r\n if x[i] == 2 :\r\n m[2].append(i+1)\r\n elif x[i] == 3 :\r\n m[3].append(i+1)\r\n \r\nz =[]\r\nif x.count(1) == 0 or x.count(2) == 0 or x.count(3) ==0:\r\n print(0)\r\nelse :\r\n y = min(x.count(1), x.count(2), x.count(3))\r\n print(y)\r\n for i in range(y):\r\n d = []\r\n d.append(m[1][i])\r\n d.append(m[2][i])\r\n d.append(m[3][i])\r\n z.append(d)\r\n for i in range(y):\r\n print(*z[i])", "n = int(input())\r\nvar = input().split()\r\none = []\r\ntwo = []\r\nthree = []\r\nfor i in range(n):\r\n if var[i] == \"1\":\r\n one.append(i+1)\r\n elif var[i] == \"2\":\r\n two.append(i+1)\r\n else:\r\n three.append(i+1)\r\n\r\nminimum = min(len(one),len(two),len(three))\r\nprint(minimum)\r\n\r\nfor i in range(minimum):\r\n print(f\"{one[i]} {two[i]} {three[i]}\")\r\n# print(one)\r\n# print(two)\r\n# print(three)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\n\r\ng = [[],[],[]]\r\n\r\nfor i,ele in enumerate(arr):\r\n g[ele-1].append(i+1)\r\n \r\nv1,v2,v3 = g[0],g[1],g[2]\r\ngg = min(len(v1),len(v2),len(v3))\r\n\r\nif gg == 0 :\r\n print(0)\r\nelse : \r\n print(gg)\r\n for i in range(gg) : \r\n print(v1[i],v2[i],v3[i])\r\n\r\n\r\n", "n = int(input())\r\nt = list(map(int,input().split()))\r\nd = {'one':[],'two':[],'three':[]}\r\none=two=three=0\r\nfor i in range(len(t)):\r\n if t[i]==1:\r\n d['one'].append(i)\r\n one+=1\r\n elif t[i]==2:\r\n d['two'].append(i)\r\n two+=1\r\n elif t[i]==3:\r\n d['three'].append(i)\r\n three+=1\r\nmini = min(one,two,three)\r\nprint(mini)\r\nfor i in range(mini):\r\n print(d['one'][i]+1,d['two'][i]+1,d['three'][i]+1)\r\n", "n = int(input())\r\nst_skill = list(map(int,input().split()))\r\nmath_ct=0\r\nmath_ind=[]\r\nprog_ct=0\r\nprog_ind=[]\r\npe_ct=0\r\npe_ind=[]\r\nteams=[]\r\nfor s in range(n):\r\n if st_skill[s]==2:\r\n math_ct+=1\r\n math_ind+=[s+1]\r\n elif st_skill[s]==1:\r\n prog_ct+=1\r\n prog_ind+=[s+1]\r\n else:\r\n pe_ct+=1\r\n pe_ind+=[s+1]\r\n\r\nw=min(math_ct, prog_ct, pe_ct)\r\nif w>=1:\r\n print(w)\r\n for l in range(w):\r\n print(prog_ind[l],math_ind[l],pe_ind[l])\r\nelse:\r\n print(w)\r\n ", "n = int(input()) \r\nt = list(map(int, input().split())) \r\n\r\np = t.count(1) \r\nm = t.count(2)\r\ne = t.count(3) \r\n\r\nmax_teams = min(p, m, e)\r\n\r\nteams = []\r\nfor i in range(max_teams):\r\n \r\n p_index = t.index(1)\r\n t[p_index] = 0 \r\n\r\n m_index = t.index(2)\r\n t[m_index] = 0 \r\n\r\n e_index = t.index(3)\r\n t[e_index] = 0 \r\n\r\n teams.append([p_index+1, m_index+1, e_index+1]) \r\n\r\n\r\nprint(max_teams)\r\nfor team in teams:\r\n print(*team)\r\n", "n = int(input())\r\n\r\n# Make the array 1-based index\r\na = [\".\"]\r\na.extend([int(x) for x in input().split()])\r\n\r\n# Calculate the number of teams\r\nnum_teams = min(a.count(1), a.count(2), a.count(3))\r\nprint(num_teams)\r\n\r\n# Implementing the teams\r\nfor i in range(num_teams):\r\n idx_1 = a.index(1)\r\n idx_2 = a.index(2)\r\n idx_3 = a.index(3)\r\n a[idx_1] = -1\r\n a[idx_2] = -1\r\n a[idx_3] = -1\r\n print(idx_1, idx_2, idx_3)", "n = int(input())\r\na = list(map(int, input().split()))\r\nt = [[], [], []]\r\nfor i, x in enumerate(a):\r\n t[x - 1].append(i + 1)\r\nw = min([len(x) for x in t])\r\nprint(w)\r\nfor i in range(w):\r\n print(t[0][i], t[1][i], t[2][i])\r\n", "# tc = int(input())\r\nfor i in range(1):\r\n n = int(input())\r\n li =list(map(int,input().split()))\r\n ans = 0\r\n \r\n lix = []\r\n \r\n lione = []\r\n \r\n if li.count(1) == 0 or li.count(2) == 0 or li.count(3) == 0:\r\n print(0)\r\n break\r\n \r\n one = []\r\n two = []\r\n three = []\r\n for i in range(n):\r\n if li[i] == 1:\r\n one+=[i]\r\n elif li[i] == 2:\r\n two+=[i]\r\n else:\r\n three+=[i]\r\n \r\n for i in range(len(one)):\r\n for j in range(i,len(two)):\r\n for k in range(j,len(three)):\r\n lix.append([one[i]+1,two[j]+1,three[k]+1])\r\n break\r\n break\r\n \r\n \r\n print(len(lix))\r\n for i in lix:\r\n for j in i:\r\n print(j,end=\" \")\r\n print()\r\n \r\n\r\n\r\n", "n = int(input())\r\ns = list(map(int,input().split()))\r\none= 0\r\ntwo = 0\r\nthree=0\r\noneIn = []\r\ntwoIn = []\r\nthreeIn = []\r\nfor i in range(n):\r\n if s[i]==1:\r\n one+=1\r\n oneIn.append(i+1)\r\n elif s[i]==2:\r\n two+=1\r\n twoIn.append(i+1)\r\n else:\r\n three+=1\r\n threeIn.append(i+1)\r\nt = min(one,two, three) \r\nprint(t)\r\nfor i in range(t):\r\n print(f\"{oneIn[i-t]} {twoIn[i-t]} {threeIn[i-t]}\")", "n=int(input())\r\ns=list(map(int,input().split()))\r\nx=[]\r\ny=[]\r\nz=[]\r\nfor i in range(n):\r\n if s[i]==1:\r\n x.append(i)\r\n elif s[i]==2:\r\n y.append(i)\r\n else:\r\n z.append(i)\r\na1=len(x)\r\na2=len(y)\r\na3=len(z)\r\nprint(min(a1,a2,a3))\r\n\r\nfor i in range(min(a1,a2,a3)):\r\n l=[]\r\n l.append(x[i]+1)\r\n l.append(y[i]+1)\r\n l.append(z[i]+1)\r\n print(*l)", "n = int(input())\nchildren = input().split()\n\nprog = []\nmaths = []\npe = []\n\nfor i in range(n) :\n if children[i] == \"1\" :\n prog.append(i+1)\n elif children[i] == \"2\" :\n maths.append(i+1)\n else :\n pe.append(i+1)\n\nw = min( len(prog), len(maths), len(pe) )\nprint(w)\nfor i in range(w) :\n print(prog[i], maths[i], pe[i])\n \t\t \t\t\t \t \t\t \t \t\t \t\t \t\t", "n = int(input())\r\ns = list(map(int, input().split()))\r\nif len(set(s)) < 3:\r\n print(0)\r\nelse:\r\n k = min([s.count(i) for i in set(s)])\r\n print(k)\r\n d = [[], [], []]\r\n for i in range(n):\r\n if s[i] == 1:\r\n d[0].append(i + 1)\r\n elif s[i] == 2:\r\n d[1].append(i + 1)\r\n else:\r\n d[2].append(i + 1)\r\n for j in zip(*d):\r\n print(*j)\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\nnum_programmers = t.count(1)\r\nnum_mathematicians = t.count(2)\r\nnum_athletes = t.count(3)\r\nnum_teams = min(num_programmers, num_mathematicians, num_athletes)\r\nprogrammers = [i+1 for i in range(n) if t[i] == 1]\r\nmathematicians = [i+1 for i in range(n) if t[i] == 2]\r\nathletes = [i+1 for i in range(n) if t[i] == 3]\r\nteams = []\r\nfor i in range(num_teams):\r\n team = [programmers.pop(), mathematicians.pop(), athletes.pop()]\r\n teams.append(team)\r\nprint(num_teams)\r\nfor team in teams:\r\n print(*team)\n# Sun Apr 09 2023 00:08:37 GMT+0300 (Moscow Standard Time)\n", "n=int(input())\r\nli=list(map(int,input().strip().split()))\r\nl1,l2,l3=[],[],[]\r\nfor i in range(n):\r\n if li[i]==1:\r\n l1.append(i)\r\n elif li[i]==2:\r\n l2.append(i)\r\n elif li[i]==3:\r\n l3.append(i)\r\n\r\n\r\nn1=len(l1)\r\nn2=len(l2)\r\nn3=len(l3)\r\n\r\nnn=min(n1,n2,n3)\r\nprint(nn)\r\nfor i in range(nn):\r\n print(l1[i]+1,l2[i]+1,l3[i]+1)\r\n \r\n\r\n\r\n", "a, b = int(input()), 0\r\nc = list(map(int, input().split()))\r\nd = []\r\nfor i in range(a):\r\n try:\r\n f = c.index(1)\r\n h = c.index(2)\r\n i = c.index(3)\r\n c[f] = c[h] = c[i] = 4\r\n e = []\r\n e.append(f + 1)\r\n e.append(h + 1)\r\n e.append(i + 1)\r\n d.append(e)\r\n b += 1\r\n except:\r\n break\r\nprint(b)\r\nfor i in d:\r\n print(i[0], i[1], i[2])", "n = int(input())\nd = [[],[],[]]\nfor i,s in enumerate(input().split()): d[int(s)-1].append(i+1)\nprint(min(map(len, d)))\nfor a in zip(*d):\n print(a[0], a[1], a[2])\n\t\t \t\t\t \t\t\t\t \t\t\t\t\t \t\t\t \t \t\t \t\t", "n = int(input()) # input the number of students\r\n\r\nstudents = list(map(int, input().split())) # input the skills of the students\r\n\r\n# Create three lists to store the indices of students with different skills\r\nprogramming = []\r\nmathematics = []\r\npe = []\r\n\r\n# Iterate over the students and categorize them based on their skills\r\nfor i in range(n):\r\n if students[i] == 1:\r\n programming.append(i + 1)\r\n elif students[i] == 2:\r\n mathematics.append(i + 1)\r\n else:\r\n pe.append(i + 1)\r\n\r\n# Find the minimum number of teams that can be formed\r\nmin_teams = min(len(programming), len(mathematics), len(pe))\r\n\r\nprint(min_teams)\r\n\r\n# Print the teams\r\nfor i in range(min_teams):\r\n print(programming[i], mathematics[i], pe[i])\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\n\r\nans = min(arr.count(1),arr.count(2),arr.count(3))\r\nprint(ans)\r\nfor i in range(ans):\r\n one = arr.index(1)\r\n two = arr.index(2)\r\n three =arr.index(3)\r\n arr[one] = arr[two] = arr[three] = 0\r\n print(one+1,\"\",two+1,\"\",three+1)", "n=int(input())\r\nd=dict()\r\nt=list(map(int,input().split()))\r\nfeq=[0]*3\r\nfor i in range(n):\r\n feq[t[i]-1]+=1\r\n if t[i] in d:\r\n d[t[i]].append(t.index(t[i])+1)\r\n t[i]=-1\r\n else:\r\n d[t[i]]=[t.index(t[i])+1]\r\n t[i]=-1\r\nteams=min(feq)\r\nprint(teams)\r\nfor i in range(teams):\r\n print(d[1][i],d[2][i],d[3][i])\r\n", "n=int(input())\r\n\r\nl1=(list(map(int,input().split(' '))))\r\nsum1=l1.count(1)\r\nsum2=l1.count(2)\r\nsum3=l1.count(3)\r\nmin=min(sum1,sum2,sum3)\r\nprint(min)\r\nidx=[-1,-1,-1]\r\nfor i in range(min):\r\n\tidx[0]=l1.index(1,idx[0]+1)\r\n\tidx[1]=l1.index(2,idx[1]+1)\r\n\tidx[2]=l1.index(3,idx[2]+1)\r\n\tprint(idx[0]+1,idx[1]+1,idx[2]+1)\r\n", "\r\nx=int(input())\r\nz=list(map(int,input().split()))\r\nl=[z.count(1),z.count(3),z.count(2)]\r\nprint(min(l))\r\nfor i in range(min(l)):\r\n\r\n l2=[z.index(1)+1,z.index(2)+1,z.index(3)+1]\r\n for i in l2:\r\n z[i-1]=0\r\n print(*l2)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=min(l.count(1),l.count(2),l.count(3))\r\nprint(m)\r\nfor i in range(m):\r\n a,b,c=l.index(1), l.index(2),l.index(3)\r\n l[a]=l[b]=l[c]=0\r\n print(a+1,b+1,c+1)", "n = int(input())\r\nstudents = list(map(int, input().split()))\r\n\r\nskill_groups = [[] for _ in range(3)] # create empty lists for each skill level\r\n\r\n# group the students by their skill level\r\nfor i, skill in enumerate(students):\r\n skill_groups[skill-1].append(i+1) # add the student index (which is 1-based) to the group\r\n\r\nnum_teams = min(len(group) for group in skill_groups) # find the minimum size of the groups\r\nprint(num_teams)\r\n\r\nteams = [[] for _ in range(num_teams)] # create empty lists for the teams\r\n\r\nfor i in range(num_teams):\r\n for group in skill_groups:\r\n teams[i].append(group[i]) # add the student indices to the team\r\n\r\n# print the team lists\r\nfor team in teams:\r\n print(*team)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nprom = a.count(1)\r\nmath = a.count(2)\r\nfiz = a.count(3)\r\ncount = 0\r\nwhile prom >= 1 and math >= 1 and fiz >= 1:\r\n count += 1\r\n prom -= 1\r\n math -= 1\r\n fiz -= 1\r\nprint(count)\r\nfor i in range(count):\r\n print(a.index(1) + 1, a.index(2) + 1, a.index(3) + 1 )\r\n a[a.index(1)] ,a[a.index(2)], a[a.index(3)] = 0, 0, 0\r\n", "a=int(input())\r\nx=list(map(int,input().split()))\r\nz1=x.count(1)\r\nz2=x.count(2)\r\nz3=x.count(3)\r\nz=min(z1,z2,z3)\r\nprint(z)\r\nfor i in range(z):\r\n c=[]\r\n for i in range(a):\r\n if x[i]==1:\r\n c.append(i+1)\r\n x[i]=3000\r\n break\r\n for i in range(a):\r\n if x[i]==2:\r\n c.append(i+1)\r\n x[i]=3000\r\n break\r\n for i in range(a):\r\n if x[i]==3:\r\n c.append(i+1)\r\n x[i]=3000\r\n break\r\n print(*c)", "n=int(input())\r\nl = list(map(int, input().split()))\r\na=(min(l.count(1),l.count(2),l.count(3)))\r\nprint(a)\r\nx,y,z=-1,-1,-1\r\nfor i in range(a):\r\n\tx=l.index(1,x+1)\r\n\ty=l.index(2,y+1)\r\n\tz=l.index(3,z+1)\r\n\tprint(x+1,y+1,z+1)", "n = int(input())\r\ns = list(map(int, input().split()))\r\ns_1 = {1: [], 2: [], 3: []}\r\nfor i in range(len(s)):\r\n for j in s_1.keys():\r\n if s[i] == j:\r\n s_1[j].append(i + 1)\r\nd = min(len(i) for i in s_1.values())\r\nprint(d)\r\no = []\r\nfor i in range(d):\r\n r = []\r\n for j in s_1.keys():\r\n r.append(s_1[j][i])\r\n o.append(r)\r\nfor i in o:\r\n print(*i)", "n = int(input())\r\n\r\n\r\nt = list(map(int, input().split()))\r\ncnt1, cnt2, cnt3 = t.count(1), t.count(2), t.count(3)\r\n\r\nmin_num = min(cnt1, cnt2, cnt3)\r\n\r\nif cnt1 == 0 or cnt2 == 0 or cnt3 == 0:\r\n\t\tprint(0)\r\nelse:\r\n\tli = []\r\n \r\n\twhile cnt1 and cnt2 and cnt3:\r\n\t\tone = t.index(1)\r\n\t\tt[one] = 0\r\n\t\t#print(t)\r\n\t\ttwo = t.index(2)\r\n\t\tt[two] = 0\r\n\t\tthree = t.index(3)\r\n\t\tt[three] = 0\r\n\t\tcnt1 -= 1\r\n\t\tcnt2 -= 1\r\n\t\tcnt3 -= 1\r\n\t\tli.append(one + 1)\r\n\t\tli.append(two + 1)\r\n\t\tli.append(three + 1)\r\n \r\n\tprint(min_num)\r\n\tfor i in range(0, len(li), 3):\r\n\t\tprint(li[i], li[i + 1], li[i + 2])", "n=int(input())\na=list(map(int,input().split()))\nones=[] ; twos=[] ; threes=[]\nfor el in a:\n if el==1:\n ones.append(a.index(el)+1)\n a.remove(el)\n a.insert(0,5)\n elif el==2:\n twos.append(a.index(el)+1)\n a.remove(el)\n a.insert(0,5)\n else:\n threes.append(a.index(el)+1)\n a.remove(el)\n a.insert(0,5)\nmini=min(len(twos),len(ones),len(threes))\nprint(mini)\nwhile mini>0:\n print(ones[0],twos[0],threes[0])\n del ones[0] ; del twos[0] ; del threes[0]\n mini-=1 \n \t \t\t \t \t \t\t\t\t\t \t \t\t \t \t", "from collections import defaultdict\r\n\r\nind = defaultdict(list)\r\nfreq = [0,0,0]\r\n\r\nn = int(input())\r\nnums = list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n num = nums[i]\r\n freq[num-1] += 1\r\n ind[num].append(i+1)\r\n\r\nprint(min(freq))\r\nfor i in range(min(freq)):\r\n print(ind[1][i], ind[2][i], ind[3][i])", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nc = []\r\nd = []\r\nfor i in range(n):\r\n if a[i] == 1:\r\n b.append(i + 1)\r\n elif a[i] == 2:\r\n c.append(i + 1)\r\n else:\r\n d.append(i + 1)\r\ns = min(len(b), len(c), len(d))\r\nprint(s)\r\nfor i in range(s):\r\n print(b[i], c[i], d[i])\r\n", "n = int(input())\r\nt = list(map(int, input().split()))\r\none = []\r\ntwo = []\r\nthree = []\r\nfor i in range(n):\r\n if t[i] == 1:\r\n one.append(i + 1)\r\n elif t[i] == 2:\r\n two.append(i + 1)\r\n else:\r\n three.append(i + 1)\r\n\r\nw = min(len(one), len(two), len(three))\r\nprint(w)\r\nfor i in range(w):\r\n print(one[i], two[i], three[i])\r\n", "n = int(input())\nt = list(map(int, input().split()))\nt.insert(0, 0)\ncount_team = (min(t.count(1), t.count(2), t.count(3)))\nsp_1 = []\nsp_2 = []\nsp_3 = []\nfor i in range(1, len(t)):\n if t[i] == 1:\n sp_1.append(i)\n elif t[i] == 2:\n sp_2.append(i)\n else:\n sp_3.append(i)\nprint(count_team)\nfor i in range(count_team):\n print(sp_1[i], sp_2[i], sp_3[i])\n\n", "input1 = int(input())\ninput2 = [int(num) for num in input().split()]\n\na = []\nb = []\nc = []\n\nlist1 = []\n\nfor val in range(len(input2)):\n if input2[val] == 1:\n a.append(val+1)\n elif input2[val] == 2:\n b.append(val+1)\n else:\n c.append(val+1)\n\nlist1.append(len(a))\nlist1.append(len(b))\nlist1.append(len(c))\n\nprint(min(list1))\n\nfor i in range(min(list1)):\n print(f'{a[i]} {b[i]} {c[i]}')\n\n", "n = int(input())\nskills = list(map(int, input().split()))\n\nprogramming = []\nmaths = []\npe = []\n\nfor i in range(n):\n if skills[i] == 1:\n programming.append(i + 1)\n elif skills[i] == 2:\n maths.append(i + 1)\n else:\n pe.append(i + 1)\n\nteam_count = min(len(programming), len(maths), len(pe))\n\nprint(team_count)\n\nif team_count > 0:\n for i in range(team_count):\n print(programming[i], maths[i], pe[i])\n\n \t\t\t\t\t \t \t \t \t\t \t \t", "t=int(input())\r\ns=input().split()\r\nl=[int]*t\r\na=0\r\nb=0\r\nc=0\r\nfor i in range(len(l)):\r\n l[i]=int(s[i])\r\nm=min(l.count(2),l.count(1),l.count(3))\r\nprint(m)\r\nfor i in range(m):\r\n x=l.index(1,a)\r\n print(x+1,end=' ')\r\n y=l.index(2,b)\r\n print(y+1,end=' ')\r\n z=l.index(3,c)\r\n print(z+1,end='')\r\n a,b,c=x+1,y+1,z+1\r\n print('')", "w=int(input())\nlst = list(map(int,input().split()))\none =lst.count(1)\ntwo =lst.count(2)\nthree =lst.count(3)\nteams=min(one,two,three)\nprint(teams)\nfor r in range(teams):\n idx1=lst.index(1)\n idx2 = lst.index(2)\n idx3 = lst.index(3)\n print(idx1+1 , idx2+1, idx3+1)\n lst[idx1]=-1\n lst[idx2]=-1\n lst[idx3]=-1\n\n\n\t\t\t\t\t\t \t \t \t\t \t \t\t\t \t\t\t", "num = int(input())\r\nlist1 = list(map(int,input().split()))\r\nset_list1 = set(list1)\r\nif not 3 in set_list1 or not 2 in set_list1 or not 1 in set_list1:\r\n print(0)\r\nelse:\r\n list2 = [0,0,0]\r\n result = 0\r\n list3 = []\r\n for i in list1:\r\n list2[i-1] += 1\r\n while list2.count(0) == 0:\r\n text = ''\r\n result += 1\r\n \r\n list2[0] -= 1\r\n s = list1.index(1)\r\n text += str(s+1) + ' '\r\n list1[s] = 0\r\n \r\n list2[1] -= 1\r\n s = list1.index(2)\r\n text += str(s+1) + ' '\r\n list1[s] = 0\r\n \r\n list2[2] -= 1\r\n s = list1.index(3)\r\n text += str(s+1) + ' '\r\n list1[s] = 0\r\n list3.append(text)\r\n print(result)\r\n for i in list3:\r\n print(i)", "n= int(input())\r\na= list(map(int, input().split()))\r\n\r\nb= a.count(1)\r\nc= a.count(2)\r\nd= a.count(3)\r\ne= min(b, c, d)\r\n\r\nprint(e)\r\np= 0\r\nq= 0\r\nr= 0\r\n\r\nx= []\r\ny= []\r\nz= []\r\n\r\nfor i in range(n):\r\n if a[i] == 1:\r\n x.append(i+1)\r\n elif a[i] == 2:\r\n y.append(i+1)\r\n elif a[i] == 3:\r\n z.append(i+1)\r\n\r\nfor j in range(e):\r\n print(x[j], y[j], z[j])", "# Wadea #\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\none = arr.count(1)\r\ntwo = arr.count(2)\r\nthree = arr.count(3)\r\nlst = []\r\nif one > 0 and two > 0 and three > 0:\r\n r = min(one,two,three)\r\nelse:\r\n r = 0\r\n\r\nfor i in range(r):\r\n r1 = \"\"\r\n c1 = arr.index(1)\r\n c2 = arr.index(2)\r\n c3 = arr.index(3)\r\n lst.append(c1+1)\r\n lst.append(c2+1)\r\n lst.append(c3+1)\r\n arr[c1] = \"\"\r\n arr[c2] = \"\"\r\n arr[c3] = \"\"\r\n\r\nprint(r)\r\nrr = 1\r\nfor j in lst:\r\n if rr == 3:\r\n rr = 1\r\n print(j)\r\n else:\r\n print(j,end = \" \")\r\n rr += 1", "##nums = map(int, input().split())\r\n##s1 = list(map(int, input().split()))\r\n##s1 = list(map(int, ' '.join(input()).split()))\r\n\r\nn = int(input())\r\nt = list(map(int, input().split()))\r\n\r\nt1 = []\r\nt2 = []\r\nt3 = []\r\n\r\nfor i in range(n):\r\n if t[i] % 3 == 1:\r\n t1.append(i+1)\r\n elif t[i] % 3 == 2:\r\n t2.append(i+1)\r\n else:\r\n t3.append(i+1)\r\n \r\nw = min(len(t1),len(t2),len(t3))\r\nprint(w)\r\n\r\nfor i in range(w):\r\n print(t1[i], t2[i], t3[i])\r\n\r\n", "t = int(input())\r\ns = [int(i) for i in input().split()]\r\nt1, t2, t3 = s.count(1), s.count(2), s.count(3)\r\nprint(min(t1, t2, t3))\r\nif min(t1, t2, t3) != 0:\r\n for i in range(min(t1, t2, t3)):\r\n ans1, ans2, ans3 = s.index(1), s.index(2), s.index(3)\r\n s[ans1], s[ans2], s[ans3] = 5, 5, 5\r\n print(ans1+1, ans2+1, ans3+1)", "import sys\r\n\r\nnumber = int(input())\r\ntalents = [int(x) for x in sys.stdin.readline().rstrip().split()]\r\n\r\none = 0\r\ntwo = 0\r\nthree = 0\r\n\r\ni_one = []\r\ni_two = []\r\ni_three = []\r\n\r\nfor index, value in enumerate(talents):\r\n if value == 1:\r\n one += 1\r\n i_one.append(index + 1)\r\n elif value == 2:\r\n two += 1\r\n i_two.append(index + 1) \r\n else:\r\n three += 1\r\n i_three.append(index + 1)\r\n\r\ni = min(one, two, three)\r\nprint(i)\r\nwhile i > 0:\r\n i -= 1\r\n print('%s %s %s' % (i_one[i], i_two[i],i_three[i]))", "n=int(input())\nl=input().split(\" \")\nc1=[]\nc2=[]\nc3=[]\nfor i in range(n):\n if l[i]=='1':\n c1.append(i)\n elif l[i]=='2':\n c2.append(i)\n else:\n c3.append(i)\nif len(c1)*len(c2)*len(c3)==0:\n print(0)\nelse:\n print(min(len(c1),len(c2),len(c3)))\n for i in range(min(len(c1),len(c2),len(c3))):\n print(f\"{c1[i]+1} {c2[i]+1} {c3[i]+1}\")\n", "a = int(input())\r\nq = list(map(int, input().split()))\r\nt = min(q.count(1), q.count(2), q.count(3))\r\nprint (t)\r\nfor i in range(t):\r\n print (q.index(1) + 1, q.index(2) + 1, q.index(3) + 1)\r\n q[q.index(1)], q[q.index(2)], q[q.index(3)] = 4, 4, 4", "n = int(input())\nlst = list(map(int, input().split()))\no = lst.count(1)\nt = lst.count(2)\nth = lst.count(3)\nmn = min(o,t,th)\nprint(mn)\nwhile mn:\n mn -= 1\n idx1 = lst.index(1)\n idx2 = lst.index(2)\n idx3 = lst.index(3)\n lst[idx1] = -1\n lst[idx2] = -1\n lst[idx3] = -1\n print(idx1+1, idx2+1, idx3+1)\n \t\t \t \t \t \t \t \t \t \t\t", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\np = []\r\nm = []\r\ns = []\r\n\r\nfor i in range(n):\r\n if t[i] == 1:\r\n p.append(i+1)\r\n elif t[i] == 2:\r\n m.append(i+1)\r\n else:\r\n s.append(i+1)\r\n\r\nnum_teams = min(len(p), len(m), len(s))\r\n\r\nprint(num_teams)\r\n\r\nif num_teams > 0:\r\n for i in range(num_teams):\r\n print(p[i], m[i], s[i])\r\n", "n = int(input(\"\"))\r\nl = list(map(int,input(\"\").split()))\r\na = [l.count(1),l.count(2),l.count(3)]\r\nprint(min(a))\r\nfor i in range(min(a)):\r\n\tprint(str(l.index(1) + 1), str(l.index(2) + 1),str(l.index(3) + 1))\r\n\tx = l.index(1)\r\n\ty = l.index(2)\r\n\tz = l.index(3)\r\n\tl.remove(1);l.insert(x,10)\r\n\tl.remove(2);l.insert(y,10)\r\n\tl.remove(3);l.insert(z,10)", "a = int(input())\r\nn = list(map(int, input().split()))\r\nnum1 = []\r\nnum2 = []\r\nnum3 = []\r\nfor i in range(0, a):\r\n if n[i] == 1:\r\n num1.append(i+1)\r\n elif n[i] == 2:\r\n num2.append(i+1)\r\n elif n[i] == 3:\r\n num3.append(i+1)\r\n \r\np = min(n.count(1),n.count(2) ,n.count(3))\r\nprint(p)\r\nif p > 0:\r\n for i in range(0, int(p)):\r\n print(num1[i], end=\" \")\r\n print(num2[i], end=\" \")\r\n print(num3[i])", "import sys\n\nsys.setrecursionlimit(1700)\nx = int(input())\narr = [int(i) for i in input().split(\" \")]\ntend_set = {1, 2, 3}\n\nans = []\n\ndef foo(arr, ans):\n tend_set = {1, 2, 3}\n arr_2 = []\n dict = {}\n for i in range(len(arr)):\n if arr[i] != 0:\n dict.setdefault(arr[i], 0)\n dict[arr[i]] = i\n if tend_set.issubset(map(int, dict.keys())):\n break\n if not tend_set.issubset(arr):\n return ans\n for i in dict.values():\n arr_2.append(i + 1)\n arr[i] = 0\n ans.append(arr_2)\n return foo(arr, ans)\n\nx = foo(arr, ans)\n\nprint(len(x))\nfor i in x:\n print(*i)\n\n \n ", "children_in_school = int(input())\nskills = list(map(int, input().split(' ')))\n\nprogramming = []\nmaths = []\npe = []\n\nfor i in range(children_in_school):\n if skills[i] == 1:\n programming.append(i + 1)\n elif skills[i] == 2:\n maths.append(i + 1)\n else:\n pe.append(i + 1)\n\nnumber_of_teams = min(len(programming), len(maths), len(pe))\n\nteams = []\n\nif number_of_teams > 0:\n for i in range(number_of_teams):\n teams.append([programming[i], maths[i], pe[i]])\n\nprint(len(teams))\nfor team in teams:\n print(*team)", "n = int(input())\r\nlst = list(map(int, input().split(\" \")))\r\none = []\r\ntwo = []\r\nthree = []\r\n\r\nfor i in range(n):\r\n if lst[i] == 1:\r\n one.append(i)\r\n elif lst[i] == 2:\r\n two.append(i)\r\n elif lst[i] == 3:\r\n three.append(i)\r\na = len(one)\r\nb = len(two)\r\nc = len(three)\r\n\r\nif a < b and a < c:\r\n mx = a\r\nelif b < c:\r\n mx = b\r\nelse:\r\n mx = c\r\n\"\"\"print(one)\r\nprint(two)\r\nprint(three)\"\"\"\r\nprint(mx)\r\nfor i in range(mx):\r\n print(one[i]+1, two[i]+1, three[i]+1)\r\n", "n = int(input())\r\nx = input().split()\r\nlst_1,lst_2,lst_3 = [],[],[]\r\n\r\nif len(set(x)) != 3:\r\n print('0')\r\nelse:\r\n for idx in range(n):\r\n if x[idx] == \"1\":\r\n lst_1.append(idx+1)\r\n for idx in range(n):\r\n if x[idx] == \"2\":\r\n lst_2.append(idx+1)\r\n for idx in range(n):\r\n if x[idx] == \"3\":\r\n lst_3.append(idx+1)\r\n\r\n l = min(len(lst_1), len(lst_2), len(lst_3))\r\n print(l)\r\n for i in range(l):\r\n print(lst_1[i] , lst_2[i] , lst_3[i])", "n = int(input())\r\nuser_input = input()\r\n\r\ninput_list = user_input.split(\" \")\r\n\r\nskills = {\r\n 'prog' : [],\r\n 'math' : [],\r\n 'PE' : []\r\n}\r\n\r\nfor i,value in enumerate(input_list):\r\n if value == '1':\r\n skills['prog'].append(i+1)\r\n if value == '2':\r\n skills['math'].append(i+1)\r\n if value == '3':\r\n skills['PE'].append(i+1)\r\n\r\n\r\n\r\nteams = min(min(len(skills['prog']), len(skills['math'])), len(skills['PE']))\r\n\r\nprint(teams)\r\n\r\nfor i in range(teams):\r\n prog = skills['prog']\r\n math = skills['math']\r\n PE = skills['PE']\r\n print(prog[i], math[i], PE[i])", "_ = int(input())\nstudents = input()\nrec = {'1':[],'2':[],'3':[]}\nfor c in range(len(students)):\n if students[c] == ' ': continue\n rec[students[c]].append(c//2+1)\nteams = len(min(rec.values(),key=lambda x : len(x))) \nprint(teams)\nfor i in range(teams):\n print(rec['1'][i],rec['2'][i],rec['3'][i])", "n = int(input())\r\nl = list(map(int, input().split()))\r\na = [];b = [];c = []\r\nfor i in range(len(l)):\r\n if l[i] == 1: a.append(i + 1)\r\n elif l[i] == 2: b.append(i + 1)\r\n else: c.append(i + 1)\r\nteams = min(len(a), len(b), len(c))\r\nif teams == 0:\r\n print(teams)\r\nelse:\r\n print(teams)\r\n for x in range(teams):\r\n print(a[x], b[x], c[x])", "#The School №0 of the capital of Berland has n children studying in it. All the children in this school are gifted: some of them are good at programming, some are good at maths, \r\n# others are good at PE (Physical Education). Hence, for each child we know value ti:\r\n\r\n#ti = 1, if the i-th child is good at programming,\r\n#ti = 2, if the i-th child is good at maths,\r\n#ti = 3, if the i-th child is good at PE\r\n#Each child happens to be good at exactly one of these three subjects.\r\n\r\n#The Team Scientific Decathlon Olympias requires teams of three students. The school teachers decided that the teams will be composed of three children that are good at different subjects. \r\n# That is, each team must have one mathematician, one programmer and one sportsman. Of course, each child can be a member of no more than one team.\r\n\r\n#What is the maximum number of teams that the school will be able to present at the Olympiad? How should the teams be formed for that?\r\n\r\n#Input\r\n#The first line contains integer n (1 ≤ n ≤ 5000) — the number of children in the school. The second line contains n integers t1, t2, ..., tn (1 ≤ ti ≤ 3), where ti describes the skill of the i-th child.\r\n\r\n#Output\r\n#In the first line output integer w — the largest possible number of teams.\r\n\r\n#Then print w lines, containing three numbers in each line. Each triple represents the indexes of the children forming the team. You can print both the teams, and the numbers in the triplets in any order. \r\n# The children are numbered from 1 to n in the order of their appearance in the input. Each child must participate in no more than one team. If there are several solutions, print any of them.\r\n\r\n#If no teams can be compiled, print the only line with value w equal to 0.\r\n\r\n#Examples\r\n#input\r\n# 7\r\n# 1 3 1 3 2 1 2\r\n#output\r\n# 2\r\n# 3 5 2\r\n# 6 7 4\r\n#input\r\n# 4\r\n# 2 1 1 2\r\n#output\r\n# 0\r\n\r\n#1 = i-th child is good at programming\r\n#2 = i-th child is good at maths\r\n#3 = i-th child is good at PE\r\n\r\nteam = []\r\n\r\nprogrammers = []\r\nmathematicians = []\r\npe = []\r\n\r\nn = int(input())\r\n\r\np = list(map(int, input().split()))\r\n\r\nfor i, student in enumerate(p):\r\n if student == 1:\r\n programmers.append(i + 1) # +1 because indices in the problem seem to be 1-based\r\n elif student == 2:\r\n mathematicians.append(i + 1)\r\n elif student == 3:\r\n pe.append(i + 1)\r\n\r\nwhile programmers and mathematicians and pe:\r\n team.append([programmers.pop(), mathematicians.pop(), pe.pop()])\r\n\r\nprint(len(team))\r\nfor members in team:\r\n print(*members)\r\n\r\n", "n = input()\r\nl = input().split()\r\nindex1 = -1\r\nindex2 = -1\r\nindex3 = -1\r\nteam = min(l.count('1'), l.count('2'), l.count('3'))\r\nprint(team)\r\nfor i in range(team):\r\n index1 = l.index('1', index1 + 1)\r\n index2 = l.index('2', index2 + 1)\r\n index3 = l.index('3', index3 + 1)\r\n print(index1 + 1, index2 + 1, index3 + 1)\r\n", "n = int(input(\"\"))\r\na = [int(p) for p in input().split()]\r\nA = []; B = []; C = []\r\nfor i in range(n):\r\n if a[i] == 1:\r\n A.append(i+1)\r\n elif a[i] == 2:\r\n B.append(i+1)\r\n elif a[i] == 3:\r\n C.append(i+1)\r\nminim = min(len(A), len(B), len(C))\r\nprint(minim)\r\nfor i in range(minim):\r\n print(A[i], B[i], C[i])", "n = int(input())\r\nt_lst = list(map(int,input().split()))\r\nlst_1,lst_2,lst_3 = [],[],[]\r\ncount_1,count_2,count_3 = 0,0,0\r\nfor x,y in enumerate(t_lst):\r\n if y == 1:\r\n count_1 += 1\r\n lst_1.append(x+1)\r\n elif y == 2:\r\n count_2 += 1\r\n lst_2.append(x+1)\r\n else:\r\n count_3 += 1\r\n lst_3.append(x+1)\r\nnum = min(count_1,count_2,count_3)\r\nprint(num)\r\nfor i in range(num):\r\n print(lst_1[i],lst_2[i],lst_3[i])", "#from collections import Counter\r\na = int(input())\r\nlst = list(map(int,input().split()))\r\nones = lst.count(1)\r\ntwos = lst.count(2)\r\nthrees = lst.count(3)\r\nprint(min(ones,twos,threes))\r\nindexes_of_ones = [i for i, num in enumerate(lst) if num == 1]\r\nindexes_of_twos = [i for i, num in enumerate(lst) if num == 2]\r\nindexes_of_threes = [i for i, num in enumerate(lst) if num == 3]\r\nfor i in range(min(ones,twos,threes)):\r\n print(indexes_of_ones[i]+1,indexes_of_twos[i]+1,indexes_of_threes[i]+1)", "n = int(input())\na = list(map(int, input().split()))\na1 = []\na2 = []\na3 = []\nfor i in range(n):\n if a[i] == 1:\n a1.append(i+1)\n if a[i] == 2:\n a2.append(i+1)\n if a[i] == 3:\n a3.append(i+1)\na = []\nif len(a1) == 0 or len(a2) == 0 or len(a3) == 0:\n print(0)\nelse:\n for i in range(min(len(a1), len(a2), len(a3))):\n a.append((a1[i], a2[i], a3[i]))\n print(len(a))\n for i in a:\n print(i[0], i[1], i[2])", "n = int(input())\r\nl1 , l2, l3 = [],[],[]\r\nc = [int(x) for x in input().split()]\r\n\r\nfor i in range(0,len(c)):\r\n if c[i] == 1: l1.append(i+1)\r\n elif c[i] == 2: l2.append(i+1)\r\n elif c[i] == 3: l3.append(i+1)\r\na = min((len(l1),len(l2),len(l3)))\r\n\r\nprint(a)\r\nfor i in range(0,a):\r\n print(l1[i],l2[i],l3[i])", "n = int(input())\r\nt = input().split()\r\nnum = min(min(t.count(\"1\"), t.count(\"2\")), t.count(\"3\"))\r\nprint(num)\r\nif num != 0:\r\n left = num\r\n first = []\r\n second = []\r\n third = []\r\n for i in range(n):\r\n if t[i] == \"1\":\r\n first.append(i + 1)\r\n elif t[i] == \"2\":\r\n second.append(i + 1)\r\n elif t[i] == \"3\":\r\n third.append(i + 1)\r\n j = 0\r\n while (j < left):\r\n print(first[j], second[j], third[j])\r\n j += 1", "n=int(input())\r\narr=list(map(int, input().split()))\r\nprogramming=[]\r\nmaths=[]\r\nph=[]\r\nfor i in range(n):\r\n if arr[i]==1:programming.append(i+1)\r\n elif arr[i]==2:maths.append(i+1)\r\n elif arr[i]==3:ph.append(i+1)\r\nminimum=min(len(programming),len(maths),len(ph))\r\nprint(minimum)\r\n\r\nfor j in range(minimum):\r\n print(programming[j],maths[j],ph[j])", "n = int(input())\r\nl = list(map(int,input().split()))\r\npr = []\r\nma = []\r\npe = []\r\nfor i in range(len(l)):\r\n if (l[i]==1):\r\n pr.append(i+1)\r\n elif(l[i]==2):\r\n ma.append(i+1)\r\n else:\r\n pe.append(i+1)\r\n \r\nm = min(len(pr),len(ma),len(pe))\r\nprint(m)\r\nfor i in range(m):\r\n print(pr[i],ma[i],pe[i])", "a,b = int(input()),list(map(int,input().split()))\r\nc = [[],[],[]]\r\nfor i in range(a):\r\n c[b[i]-1].append(i+1)\r\nd = min([len(i) for i in c])\r\nprint(d)\r\nfor i in range(d):\r\n print(*[c[j][i] for j in range(3)])", "n = int(input())\r\nchildren = list(map(int, input().split()))\r\n\r\nprogrammers = [i for i, skill in enumerate(children, start=1) if skill == 1]\r\nmathematicians = [i for i, skill in enumerate(children, start=1) if skill == 2]\r\nsportsmen = [i for i, skill in enumerate(children, start=1) if skill == 3]\r\n\r\nteams = []\r\nmin_team_size = min(len(programmers), len(mathematicians), len(sportsmen))\r\nif min_team_size == 0:\r\n print(0)\r\nelse:\r\n print(min_team_size)\r\n for i in range(min_team_size):\r\n team = [programmers[i], mathematicians[i], sportsmen[i]]\r\n teams.append(team)\r\n print(*team)\r\n", "\n\n\n\n# Press the green button in the gutter to run the script.\nimport math\nfrom builtins import input, print\nimport collections\nfrom fractions import Fraction\nfrom math import gcd\nimport math\n\nif __name__ == '__main__':\n # no_orders, ice_cream = list(map(int, input().split(\" \")))\n no_students = int(input())\n skills = list(input().split(\" \"))\n skills_dict = {\n \"1\": [],\n \"2\": [],\n \"3\": []\n }\n\n for i in range(len(skills)):\n skills_dict[skills[i]].append(i+1)\n\n no_teams = min(len(skills_dict[\"1\"]), len(skills_dict[\"2\"]), len(skills_dict[\"3\"]))\n print(no_teams)\n while skills_dict[\"1\"] and skills_dict[\"2\"] and skills_dict[\"3\"]:\n print(skills_dict[\"1\"].pop(0), skills_dict[\"2\"].pop(0), skills_dict[\"3\"].pop(0))\n\n# See PyCharm help at https://www.jetbrains.com/help/pycharm/\n", "ns = {1:0, 2:0, 3:0}\r\nins = [0, [], [], []]\r\nt = int(input())\r\ns = list(map(int, input().split()))\r\nfor i in range(len(s)):\r\n ns[s[i]] += 1\r\n ins[s[i]].append(i+1)\r\n\r\nw = min(ns.values())\r\nprint(w)\r\nfor i in range(w):\r\n print(f\"{ins[1][i]} {ins[2][i]} {ins[3][i]}\")\r\n", "n=int(input())\r\nl1=[]\r\nl1.append(input().split())\r\na=l1[0].count('1')\r\nb=l1[0].count('2')\r\nc=l1[0].count('3')\r\nd=min(int(a),int(b),int(c))\r\nprint(d)\r\ndef fuc():\r\n\r\n for i in range(d):\r\n print(l1[0].index('1')+1,l1[0].index('2')+1,l1[0].index('3')+1)\r\n l1[0][l1[0].index('1')] = '4'\r\n l1[0][l1[0].index('2')] = '4'\r\n l1[0][l1[0].index('3')] = '4'\r\n print()\r\nfuc()", "def func2(n,skill):\r\n lookup = {1:0,2:0,3:0}\r\n for each in skill:\r\n lookup[each]+=1\r\n ans = min(lookup[1],lookup[2],lookup[3])\r\n print(ans)\r\n teams = {1:[],2:[],3:[]}\r\n for i in range(n):\r\n teams[skill[i]].append(i)\r\n for i in range(ans):\r\n current_team = [teams[1][i]+1,teams[2][i]+1,teams[3][i]+1]\r\n for each in current_team:\r\n print(each,end = \" \")\r\n print()\r\nn = int(input())\r\nskill = list(map(int,input().split()))\r\nfunc2(n,skill)", "n = int(input())\r\narr = list(map(int,input().split()))\r\npos_1 = []\r\npos_2 = []\r\npos_3 = []\r\nfor i in range(len(arr)):\r\n if(arr[i]==1):\r\n pos_1.append(i)\r\n elif(arr[i]==2):\r\n pos_2.append(i)\r\n elif(arr[i]==3):\r\n pos_3.append(i)\r\n\r\ncount = 0\r\nmin_team = min(len(pos_1),len(pos_2),len(pos_3))\r\nif(min_team==0):\r\n print(min_team)\r\nelse:\r\n print(min_team)\r\n for i in range(min_team):\r\n print(pos_1[i]+1,pos_2[i]+1,pos_3[i]+1)\r\n\r\n", "dl = int(input())\r\nlista = input().split()\r\nfor i in range(dl):\r\n lista[i] = int(lista[i])\r\n\r\nl1 = []\r\nl2 = []\r\nl3 = []\r\n\r\nfor i in range(dl):\r\n if lista[i] == 1:\r\n l1.append(i + 1)\r\n if lista[i] == 2:\r\n l2.append(i + 1)\r\n if lista[i] == 3:\r\n l3.append(i + 1)\r\n\r\nl1dl = len(l1)\r\nl2dl = len(l2)\r\nl3dl = len(l3)\r\n\r\nmindl = min(l1dl, l2dl, l3dl)\r\n\r\nprint(mindl)\r\nfor i in range(mindl):\r\n print(l1[i], l2[i], l3[i])", "_=input();c=list(map(int, input().split()))\r\nminn = min(c.count(1),c.count(2),c.count(3))\r\nprint(minn)\r\nfor i in range(minn):\r\n t1=c.index(1)\r\n t2=c.index(2)\r\n t3=c.index(3)\r\n c[t1] = -1\r\n c[t2] = -1\r\n c[t3] = -1\r\n print(t1+1,t2+1,t3+1)\r\n", "#490A\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\none=[];two=[];three=[]\r\nfor index,value in enumerate(l):\r\n if value==1:\r\n one.append(index+1)\r\n elif value==2:\r\n two.append(index+1)\r\n elif value==3:\r\n three.append(index+1)\r\nmin_pairs=min(min(len(one),len(two)),len(three))\r\nprint(min_pairs)\r\nfor i,j,k in zip(one,two,three):\r\n print(i,j,k)\r\n \r\n", "n = int(input())\r\nmembers = list(map(int, input().split()))\r\nd = {1:[], 2:[], 3:[]}\r\nfor i in range(n):\r\n d[members[i]].append(i)\r\n\r\nmaxLength = min(len(d[1]), len(d[2]))\r\nmaxLength = min(maxLength, len(d[3]))\r\nprint(maxLength)\r\nif maxLength > 0:\r\n for i in range(maxLength):\r\n print(d[3][i]+1, d[2][i]+1, d[1][i]+1, sep=\" \")\r\n", "def main(arr):\r\n crr = [[], [], []]\r\n\r\n for i in range(len(arr)):\r\n crr[arr[i] - 1] += [i + 1]\r\n\r\n return crr\r\n\r\nif __name__ == \"__main__\":\r\n _ = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n brr = main(arr)\r\n\r\n n = min(len(brr[0]), len(brr[1]), len(brr[2]))\r\n\r\n print(n)\r\n\r\n for i in range(n):\r\n print(brr[0][i], brr[1][i], brr[2][i])", "n=int(input())\r\ns=input()\r\nt1 = s.count('1')\r\nt2 = s.count('2')\r\nt3 = s.count('3')\r\nn = min(t1,t2,t3)\r\nprint(n)\r\ns=list(map(str,s.split()))\r\nfor i in range(n):\r\n i1 = s.index('1')\r\n i2 = s.index('2')\r\n i3 = s.index('3')\r\n s[i1]='!'\r\n s[i2]='!'\r\n s[i3]='!'\r\n print(i1+1,i2+1,i3+1)", "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 = int(input())\r\nl = list(getints())\r\nd = {1:[],2:[],3:[]}\r\nfor i in range(n):\r\n d[l[i]].append(i+1)\r\nm = min(*map(len,d.values()))\r\nprint(m)\r\nfor x in zip(d[1][:m],d[2][:m],d[3][:m]):\r\n print(*x)", "# 7\r\n# 1 3 1 3 2 1 2\r\nn = int(input())\r\nteam = list(map(int, input().split()))\r\nones = list()\r\ntwos = list()\r\nthrees = list()\r\n\r\nif team.count(1) and team.count(2) and team.count(3):\r\n limit = min(team.count(1),team.count(2),team.count(3))\r\n print(limit)\r\n\r\n for i in range(len(team)):\r\n if team[i] == 1 and team.count(1) >= limit:\r\n if len(ones)+1 > limit:\r\n del ones[0]\r\n ones.append(i + 1)\r\n else:\r\n ones.append(i+1)\r\n\r\n if team[i] == 2 and team.count(2) >= limit:\r\n twos.append(i+1)\r\n if team[i] == 3 and team.count(3) >= limit:\r\n threes.append(i+1)\r\n res = list()\r\n for j in range(limit):\r\n res.append(ones[j])\r\n res.append(twos[j])\r\n res.append(threes[j])\r\n print(*res)\r\n res.clear()\r\n\r\nelse:\r\n print(0)", "\r\n# // import sys\r\n# // input = sys.stdin.readline\r\n# // sys.stdout.write(str(pref[r] - pref[l-1]) + \"\\n\")\r\n# // n,m=map(int,input().split())\r\n# // x=list(map(int,input().split()))\r\n# listy=[(value,index+1) for index,value in enumerate(x)]\r\n# listy.sort()\r\n# print(listy)\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\nc = 0;\r\nvalues=[]\r\nwhile (1 in x) and (2 in x) and (3 in x):\r\n # print(x.index(1)+1,x.index(2)+1,x.index(3)+1)\r\n values.append([x.index(1)+1,x.index(2)+1,x.index(3)+1])\r\n x[x.index(1)]=4\r\n x[x.index(2)]=4\r\n x[x.index(3)]=4\r\n c+=1\r\nprint(c)\r\n# print(values)\r\ncol_widths = [max(len(str(cell)) for cell in col) for col in zip(*values)]\r\nfor row in values:\r\n print(\" \".join(str(cell).ljust(width) for cell, width in zip(row, col_widths)))\r\n\r\n", "\"\"\"\r\n\r\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\n\r\n# Constants\r\nINF = float('inf')\r\nMOD = 1000000007\r\n\r\n# Faster Input\r\ndef read_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef read_n_int():\r\n return map(int, sys.stdin.readline().split())\r\n\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\n\r\n# Faster Output\r\ndef print_yes_no(condition):\r\n print('YES' if condition else 'NO')\r\n \r\ndef print_array(arr, sep=' '):\r\n print(sep.join(map(str, arr)))\r\n\r\n\r\n# Main Function\r\ndef solve():\r\n n = read_int()\r\n t = read_ints()\r\n\r\n programmer = []\r\n mathmaticians = []\r\n ps = []\r\n for i in range(n):\r\n if t[i] == 1:\r\n programmer.append(i+1)\r\n elif t[i] == 2:\r\n mathmaticians.append(i+1)\r\n else:\r\n ps.append(i+1)\r\n\r\n m = min(len(programmer), len(mathmaticians), len(ps))\r\n print(m)\r\n for i in range(m):\r\n print(\"%d %d %d\"%(programmer[i],mathmaticians[i],ps[i]))\r\n\r\nif __name__ == '__main__':\r\n solve()\r\n", "# input number of students\r\n# count each type(1,2 and 3)\r\n# print smallest count\r\n# print teams\r\n\r\nn = int(input())\r\nts = [int(i) for i in input().split()]\r\ntCount = []\r\n\r\nfor i in range(1,4):\r\n tCount.append(ts.count(i))\r\nteams = min(tCount)\r\nprint(teams)\r\n\r\nfor i in range(teams):\r\n for i in range(1,4):\r\n index = ts.index(i)\r\n print(index+1, end=\" \")\r\n ts[index] = 0\r\n print()", "n = int(input())\na = [int(x) for x in input().split()]\nones = []\ntwos = []\nthrees = []\nfor i in range(n):\n if a[i]==1:\n ones.append(i+1)\n elif a[i] ==2:\n twos.append(i+1)\n else:\n threes.append(i+1)\n\nteams = min(len(ones),len(twos),len(threes))\nprint(teams)\nfor i in range(teams):\n print(ones[i],twos[i],threes[i])\n", "input();n=[[],[],[]]\r\nfor i,j in enumerate(input().split(),1):n[int(j)-1]+=[i]\r\nprint(min(map(len,n)))\r\nfor j in zip(*n):print(*j)", "n = int(input())\r\nt = list(map(int, input().split()))\r\n\r\none = t.count(1)\r\ntwo = t.count(2)\r\nthree = t.count(3)\r\nminimum = min(one, two, three)\r\n\r\nif minimum == 0:\r\n print(0)\r\nelse:\r\n print(minimum)\r\n for i in range(minimum):\r\n a = []\r\n\r\n one_index = t.index(1)\r\n a.append(one_index + 1)\r\n t[one_index] = 0\r\n\r\n two_index = t.index(2)\r\n a.append(two_index + 1)\r\n t[two_index] = 0\r\n\r\n three_index = t.index(3)\r\n a.append(three_index + 1)\r\n t[three_index] = 0\r\n\r\n print(*a)\r\n ", "p=int(input())\nq=input().split()\na,b,c=0,0,0\nl=[]\nm=[]\nn=[]\nfor i in range(p):\n\tif q[i]==\"1\":\n\t\ta+=1\n\t\tl.append(i+1)\n\telif q[i]==\"2\":\n\t\tb+=1\n\t\tm.append(i+1)\n\telse:\n\t\tc+=1\n\t\tn.append(i+1)\nd=min(a,b,c)\nprint(d)\nfor j in range(d):\n\tprint(l[j],m[j],n[j])\n\t \t \t\t \t \t \t\t\t\t \t\t\t \t\t", "a=int(input())\r\narr=[int(arr) for arr in input().split()]\r\nteams=[]\r\ncount=min(arr.count(1),arr.count(2),arr.count(3))\r\nprint(count)\r\nfor i in range(count):\r\n teams.append(arr.index(1)+1)\r\n teams.append(arr.index(2)+1)\r\n teams.append(arr.index(3)+1)\r\n arr[arr.index(1)]=0\r\n arr[arr.index(2)]=0\r\n arr[arr.index(3)]=0\r\nfor i in range(0,count*3,3):\r\n print(teams[i],teams[i+1],teams[i+2])\r\n \r\n", "number_of_children = int(input())\nchildrens_expertise = [int(x) for x in input().split()]\n\nnumber_of_teams = min(childrens_expertise.count(1), childrens_expertise.count(2), childrens_expertise.count(3))\nprint(number_of_teams)\n\nif number_of_teams > 0:\n good_at = dict()\n good_at[1] = []\n good_at[2] = []\n good_at[3] = []\n \n for i in range(number_of_children):\n child_expertise = childrens_expertise[i]\n good_at[child_expertise].append(i + 1)\n \n for i in range(number_of_teams):\n team = []\n \n team.append(good_at[1][i])\n team.append(good_at[2][i])\n team.append(good_at[3][i])\n \n print(*team)", "# URL: https://codeforces.com/problemset/problem/490/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\nn = int(inp())\nt1, t2, t3 = [], [], []\nfor i, x in enumerate(map(int, inp().split())):\n if x == 1:\n t1.append(i + 1)\n elif x == 2:\n t2.append(i + 1)\n else:\n t3.append(i + 1)\nw = min(len(t1), len(t2), len(t3))\nout(f\"{w}\\n\")\nfor x, y, z in zip(t1, t2, t3):\n out(f\"{x} {y} {z}\\n\")\n", "n=int(input())\nt=list(map(int, input().split()))\na=[]\nfor i in range(n):\n if t[i]==1:\n a.append(i+1)\nb=[]\nfor i in range(n):\n if t[i]==2:\n b.append(i+1)\nc=[]\nfor i in range(n):\n if t[i]==3:\n c.append(i+1)\nt=min(len(a),len(b),len(c))\nprint(t)\nfor i in range(t):\n m=[a[i],b[i],c[i]]\n print(*sorted(m))\n# Sat Apr 08 2023 13:02:36 GMT+0300 (Moscow Standard Time)\n", "t=int(input())\r\na=input().split()\r\nb=[int(i) for i in a]\r\nd={}\r\nfor i in b:\r\n if i in d:\r\n d[i]+=1\r\n else:\r\n d[i]=1\r\nif 1 not in d or 2 not in d or 3 not in d:\r\n print(0)\r\nelse:\r\n k=min([d[i] for i in d])\r\n e={}\r\n for i in range(len(b)):\r\n if b[i] not in e:\r\n e[b[i]]=[i+1]\r\n else:\r\n e[b[i]].append(i+1)\r\n print(k)\r\n for i in range(k):\r\n for j in e:\r\n print(e[j][i],end=\" \")\r\n print()\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nx = min(s.count(1), s.count(2), s.count(3))\r\nprint(x)\r\na = b = c = 0\r\nfor i in range(x):\r\n print(f\"{s.index(1, a) + 1} {s.index(2, b) + 1} {s.index(3, c) + 1}\")\r\n a = s.index(1, a) + 1\r\n b = s.index(2, b) + 1\r\n c = s.index(3, c) + 1\r\n", "from collections import defaultdict\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n team = defaultdict(list)\r\n l = [int(i) for i in input().split()]\r\n for i in range(n):\r\n team[l[i]].append(i+1)\r\n mn = min(len(team[1]), len(team[2]), len(team[3]))\r\n print(mn)\r\n for i in range(mn):\r\n print(team[1][i], team[2][i], team[3][i])\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "import math\r\nt=int(input())\r\nk=list(map(int,input().split()))\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\ns1=0\r\ns2=0\r\ns3=0\r\ns1=k.count(1)\r\ns2=k.count(2)\r\ns3=k.count(3)\r\nmin1=min(s1,s2)\r\nmin1=min(min1,s3)\r\nprint(min1)\r\nfor i in range(len(k)):\r\n if(k[i]==1):\r\n l1.append(i+1);\r\n elif (k[i]==2):\r\n l2.append(i+1);\r\n else:\r\n l3.append(i+1)\r\nfor i in range(min1):\r\n print(l1[i],\" \",l2[i],\" \",l3[i])\r\n", "n=int(input())\nlst=list(map(int,input().split()))\none=lst.count(1)\ntow=lst.count(2)\nthree=lst.count(3)\n\nteams=min(one,tow,three)\nprint(teams)\nfor i in range(teams):\n idx1=lst.index(1)\n idx2=lst.index(2)\n idx3=lst.index(3)\n print(idx1+1,idx2+1,idx3+1)\n lst[idx1]=-1\n lst[idx2]=-1\n lst[idx3]=-1\n\n\n\n\n\n\t \t \t\t\t\t \t\t\t \t\t \t\t \t \t \t", "n = int(input())\r\nlst = list(map(int, input().split()))\r\n\r\nfirst = []\r\nsecond = []\r\nthird = []\r\n\r\nfor i in range(n):\r\n if lst[i] == 1:\r\n first.append(i + 1)\r\n if lst[i] == 2:\r\n second.append(i + 1)\r\n if lst[i] == 3:\r\n third.append(i + 1)\r\n\r\nprint(min(len(first), len(second), len(third)))\r\n\r\nfor i in range(min(len(first), len(second), len(third))):\r\n print(first[i], second[i], third[i])", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\nprogramming = [i+1 for i in range(n) if skills[i] == 1]\r\nmaths = [i+1 for i in range(n) if skills[i] == 2]\r\npe = [i+1 for i in range(n) if skills[i] == 3]\r\n\r\nteams = min(len(programming), len(maths), len(pe))\r\n\r\nprint(teams)\r\nfor i in range(teams):\r\n print(programming[i], maths[i], pe[i])\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\none=[];two=[];three=[]\r\nfor i in range(n):\r\n if l[i]==1:\r\n one.append(i+1)\r\n elif l[i]==2:\r\n two.append(i+1)\r\n else:\r\n three.append(i+1)\r\nmini=min(len(one),min(len(two),len(three)))\r\nprint(mini)\r\nfor i in range(mini):\r\n print(one[i],two[i],three[i])", "import sys\ninput = sys.stdin.readline\n\nn = int(input())\nkids = list(map(int,input().split()))\n\nteams = [[] for i in range(3)]\nfor i, val in enumerate(kids):\n teams[val-1].append(i)\n\nans = list(zip(teams[0], teams[1], teams[2]))\nprint(len(ans))\nfor a in ans:\n print(a[0]+1, a[1]+1, a[2]+1)\n", "n=int(input())\r\nlis=list(map(int,input().split()))\r\np=[]\r\nm=[]\r\npe=[]\r\nfor i in range(n):\r\n if lis[i]==1:\r\n p.append(i+1)\r\n elif lis[i]==2:\r\n m.append(i+1)\r\n else:\r\n pe.append(i+1)\r\na=min(len(p),len(m),len(pe))\r\nprint(a)\r\nfor i in range(a):\r\n print(p[i],m[i],pe[i])", "n=int(input())\r\nl=list(map(int,input().split()))\r\none=[]\r\ntwo=[]\r\nthree=[]\r\nc1=l.count(1)\r\nc2=l.count(2)\r\nc3=l.count(3)\r\ns=min(c1,c2,c3)\r\nif s==0:\r\n print(0)\r\nelse:\r\n print(s)\r\n while s:\r\n print(l.index(1)+1,end=\" \")\r\n l[l.index(1)]=-1\r\n print(l.index(2)+1,end=\" \")\r\n l[l.index(2)]=-1\r\n print(l.index(3)+1,end=\" \")\r\n l[l.index(3)]=-1\r\n s-=1\r\n print()\r\n ", "from collections import Counter\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd=Counter(l)\r\nif len(d.keys())<3:\r\n print(0)\r\nelse:\r\n c=min(d.values())\r\n print(c)\r\n l1=[]\r\n l2=[]\r\n l3=[]\r\n for i in range(n):\r\n if l[i]==1:\r\n l1.append(i+1)\r\n i+=1\r\n for i in range(n):\r\n if l[i]==2:\r\n l2.append(i+1)\r\n i+=1\r\n for i in range(n):\r\n if l[i]==3:\r\n l3.append(i+1)\r\n i+=1\r\n for i in range(c):\r\n print(l1[i],end=\" \")\r\n print(l2[i],end=\" \")\r\n print(l3[i])", "# Team Olympiad\r\nn = int(input())\r\ns = input().split(\" \")\r\ns = [int(i) for i in s]\r\nx = [1, 2, 3]\r\nminimum = 10**10\r\nfor i in x:\r\n count = s.count(i)\r\n if count < minimum:\r\n minimum = count\r\nprint(minimum)\r\nif minimum == 0:\r\n pass\r\nelse:\r\n for j in range(minimum):\r\n print(s.index(1)+1, end = \" \")\r\n print(s.index(2)+1, end = \" \")\r\n print(s.index(3)+1)\r\n s[s.index(1)] = 0\r\n s[s.index(2)] = 0\r\n s[s.index(3)] = 0", "n=int(input())\r\n\r\nli=list(map(int,input().split()))\r\np=[]\r\nm=[]\r\npe=[]\r\n\r\nfor i in range(0,n):\r\n if li[i]==1:\r\n p.append(i+1)\r\n elif li[i]==2:\r\n m.append(i+1)\r\n else:\r\n pe.append(i+1)\r\n\r\ncnt=min(len(p),len(m),len(pe))\r\n\r\nprint(cnt)\r\n\r\nfor j in range(0,cnt):\r\n print(p[j],m[j],pe[j])\r\n \r\n \r\n \r\n", "n = int(input())\r\nk = [int(i) for i in input().split()]\r\np = min(k.count(1), k.count(2), k.count(3))\r\na = []\r\nb = []\r\nc = []\r\nif p >= 1:\r\n print(int(p))\r\n for j in range(n):\r\n if k[j] == 1:\r\n a.append(j+1)\r\n k[j] = 0\r\n elif k[j] == 2:\r\n b.append(j+1)\r\n k[j] = 0\r\n elif k[j] == 3:\r\n c.append(j+1)\r\n for i in range(p):\r\n print(a[i], b[i], c[i])\r\n\r\nelse:\r\n print(0)", "\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nd=0\r\ninde=[]\r\nwhile 1 in l and 2 in l and 3 in l:\r\n d+=1\r\n inde.append(str(l.index(1)+1)+' '+str(l.index(2)+1)+' '+str(l.index(3)+1))\r\n l[l.index(1)]=4\r\n l[l.index(3)]=4\r\n l[l.index(2)]=4\r\nprint(d)\r\nif d!=0:\r\n for i in range(len(inde)):\r\n print(inde[i])\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nsz = min(a.count(1), min(a.count(2), a.count(3)))\r\nprint(sz)\r\n\r\nmat = []\r\nfor search in range(1,4):\r\n\trow = []\r\n\tfor i, num in enumerate(a):\r\n\t\tif num==search:\r\n\t\t\trow.append(i)\r\n\tmat.append(row)\r\n\r\nfor i in range(sz):\r\n\tfor j in range(3):\r\n\t\tprint(mat[j][i]+1, end=' ')\r\n\tprint()\r\n\t\t", "n = int(input())\r\n\r\nd = list(map(int, input().split()))\r\nl = len(d)\r\n\r\nd1 = [d[i] for i in range(len(d)) if d[i] == 1]\r\nd2 = [d[i] for i in range(len(d)) if d[i] == 2]\r\nd3 = [d[i] for i in range(len(d)) if d[i] == 3]\r\n\r\nc = min(len(d1), len(d2), len(d3))\r\n\r\nif c == 0: \r\n print(0) \r\n quit()\r\nprint(c)\r\nfor i in range(c):\r\n for j in range(len(d)):\r\n if d[j] == 1:\r\n print(j + 1, end=' ')\r\n d[j] = 0\r\n for k in range(len(d)):\r\n if d[k] == 2:\r\n print(k+ 1, end=' ')\r\n d[k] = 0\r\n for l in range(len(d)):\r\n if d[l] == 3:\r\n print(l + 1)\r\n d[l] = 0\r\n break\r\n break\r\n break\r\n\r\n", "n=int(input())\r\nlst = []\r\nlst = input().split()\r\nx = lst.count('1') \r\ny = lst.count('2') \r\nz = lst.count('3') \r\n\r\nteam=min(x,y,z)\r\nprint(team)\r\n\r\na=[]\r\nb=[]\r\nc=[]\r\nfor i in range(len(lst)):\r\n if lst[i]=='1':\r\n a.append(i+1)\r\n elif lst[i]=='2':\r\n b.append(i+1)\r\n else:\r\n c.append(i+1)\r\nfor i in range(team):\r\n print(a[i], end= ' ')\r\n print(b[i], end = \" \")\r\n print(c[i])\r\n \r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nteam = [[] for i in range(4)]\r\nfor index in range(n):\r\n t = arr[index]\r\n team[t].append(index+1)\r\n#print(team)\r\nnum = min(len(team[1]), len(team[2]), len(team[3]))\r\nprint(num)\r\nwhile len(team[1]) > 0 and len(team[2]) > 0 and len(team[3]) > 0:\r\n print((\"%d %d %d\") % (team[1][-1], team[2][-1], team[3][-1]))\r\n team[1].pop()\r\n team[2].pop()\r\n team[3].pop()\r\n", "n=int(input())\r\nlis=list(map(int,input().strip().split()))\r\nl1=[]\r\nl2=[]\r\nl3=[]\r\nfor i in range(0,len(lis)):\r\n if lis[i]==1:\r\n l1.append(i)\r\n elif lis[i]==2:\r\n l2.append(i)\r\n elif lis[i]==3:\r\n l3.append(i)\r\nm=min(len(l1),len(l2),len(l3))\r\nprint(m)\r\nif m!=0:\r\n i=0\r\n while i<m:\r\n print(l1[i]+1,l2[i]+1,l3[i]+1)\r\n i=i+1\r\n", "def N():\r\n return min(numbers.count(1), numbers.count(2), numbers.count(3))\r\n\r\ninput()\r\nnumbers = list(map(int, input().split()))\r\n\r\nTeamCount = N()\r\nprint(TeamCount)\r\nfor _ in range(TeamCount):\r\n print(numbers.index(1) + 1, numbers.index(2) + 1, numbers.index(3) + 1)\r\n numbers[numbers.index(1)] = -1\r\n numbers[numbers.index(2)] = -1\r\n numbers[numbers.index(3)] = -1", "n=int(input())\narr=[int(i) for i in input().split()]\nmath=[]\nprogramming=[]\npe=[]\nfor i in range (n):\n if arr[i] == 1:\n programming.append(i+1)\n elif arr[i]== 2:\n math.append(i+1)\n else :\n pe.append(i+1)\n\nmx = min(len(math),len(programming),len(pe))\n\nprint(mx)\nfor i in range (mx):\n print(programming[i],math[i],pe[i])\n \t\t\t\t \t \t \t\t\t\t\t\t\t \t\t", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\nt = [x.count(1), x.count(2), x.count(3)]\r\nn_t = min(t)\r\nprint(n_t)\r\nnext_1_index, next_2_index, next_3_index = 0, 0, 0\r\n\r\nfor i in range(n_t):\r\n\r\n next_1_index = x.index(1, next_1_index)+1\r\n next_2_index = x.index(2, next_2_index)+1\r\n next_3_index = x.index(3, next_3_index)+1\r\n print(next_1_index, end=' ')\r\n print(next_2_index, end=' ')\r\n print(next_3_index, end=' ')\r\n print()\r\n", "num_children = int(input())\narr = [ (int(j),i+1) for i,j in enumerate(input().split())]\nones = [ i for i in arr if i[0] == 1]\ntwos = [i for i in arr if i[0] == 2]\nthrees = [i for i in arr if i[0] == 3]\nw = min(len(ones), len(twos), len(threes))\nprint(w)\nfor i in range(w):\n curr_ones = ones.pop()\n curr_twos = twos.pop()\n curr_threes = threes.pop()\n print(curr_ones[1], curr_twos[1], curr_threes[1])\n\n", "t = int(input())\r\na = list(map(int, input().split()))\r\n\r\none_count = a.count(1)\r\ntwo_count = a.count(2)\r\nthree_count = a.count(3)\r\n\r\nteam_count = min(one_count, two_count, three_count)\r\nprint(team_count)\r\n\r\nfor i in range(team_count):\r\n one_index = a.index(1)\r\n two_index = a.index(2)\r\n three_index = a.index(3)\r\n print(one_index + 1, two_index + 1, three_index + 1)\r\n a[one_index] = a[two_index] = a[three_index] = -1\r\n\r\n\"\"\"\r\n\r\nThis line of code marks the students who have been assigned to a team with -1. It is done to ensure that a student can only be assigned to one team.\r\n\r\nIn the code, a is the array containing the skills of the students. one_index, two_index, and three_index are the indices of the first occurrence of students with skill levels 1, 2, and 3, respectively.\r\n\r\nThe line a[one_index] = a[two_index] = a[three_index] = -1 sets the value of a[one_index], a[two_index], and a[three_index] to -1 in one go using chained assignment. This is equivalent to the following three lines of code:\r\n\r\n\r\na[one_index] = -1\r\na[two_index] = -1\r\na[three_index] = -1\r\n\r\nBy doing this, we mark the students as used, and we can ensure that they are not assigned to another team. This is important because each student can only be part of one team.\r\n\r\nI hope this helps clarify the line of code for you!\r\n\r\n\"\"\"", "n=int(input())\r\na=list(map(str,input().split()))\r\nb=a.count('1')\r\nc=a.count('2')\r\nd=a.count('3')\r\ne=min(b,c,d)\r\nprint(e)\r\nk=0\r\nfor i in range(e):\r\n j=a.index('1')\r\n print(j+1,end=' ')\r\n a[j]='0'\r\n j=a.index('2')\r\n print(j+1,end=' ')\r\n a[j]='0'\r\n j=a.index('3')\r\n print(j+1)\r\n a[j]='0'", "n = int(input())\r\nskills = list(map(int, input().split()))\r\n\r\n# Count the number of students in each skill group\r\nnum_prog = skills.count(1)\r\nnum_math = skills.count(2)\r\nnum_pe = skills.count(3)\r\n\r\n# Find the maximum number of teams that can be formed\r\nmax_teams = min(num_prog, num_math, num_pe)\r\n\r\n# Form the teams\r\nteams = []\r\nfor i in range(max_teams):\r\n prog_idx = skills.index(1)\r\n math_idx = skills.index(2)\r\n pe_idx = skills.index(3)\r\n teams.append([prog_idx+1, math_idx+1, pe_idx+1])\r\n skills[prog_idx] = 0 # Set the selected students' skill to 0 so they are not selected again\r\n skills[math_idx] = 0\r\n skills[pe_idx] = 0\r\n\r\nprint(max_teams)\r\nfor team in teams:\r\n print(*team)\r\n" ]

[ "n,m,k = map(int,input().split())\r\na = []\r\nfor i in range(m+1):\r\n a.append(int(input()))\r\nlast = format(a[-1], '#024b')\r\ncount = 0 \r\nres = 0\r\nfor i in range(m):\r\n count = 0\r\n tmp = format(a[i], '#024b')\r\n\r\n for j in range(24):\r\n if last[j]!=tmp[j]:\r\n count+=1\r\n if count<=k:\r\n res+=1\r\nprint(res)\r\n ", "n, m, k = map(int, input().split())\r\na = [int(input()) for _ in range(m + 1)]\r\nf = a.pop()\r\nans = 0\r\nfor x in a:\r\n if bin(x ^ f).count('1') <= k:\r\n ans += 1\r\nprint(ans)\r\n", "from math import *\r\nn,m,k=list(map(int,input().split()))\r\nj=[]\r\nFedor=None\r\nfor i in range(m+1):\r\n u=bin(int(input()))[2:]\r\n u='0'*(20-len(u))+u\r\n if i!=m:j.append(u)\r\n else:Fedor=u\r\nq=[0]*m\r\nfor i in range(20):\r\n for u in range(len(j)):\r\n if Fedor[i]!=j[u][i]:\r\n q[u]+=1\r\nprint(len(list(filter(lambda x:x<=k,q))))", "#Fedor and New Game\nn,m,k = map(int,input().split())\nl = []\nfor _ in range(m+1):\n l.append(int(input()))\namigos = 0\nfor i in range(m):\n a = l[i] ^ l[-1]\n a = list(bin(a))\n b = a[len(a)-k:]\n count = 0\n if a.count('1') > k:\n continue\n else:\n amigos += 1\nprint(amigos)\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())\nb = [0] * (m + 1)\nfin = 0\nfor i in range(m+1):\n b[i] = int(input())\nfor i in range(m):\n if (bin(b[i] ^ b[-1])[2:]).count('1') <= k:\n fin += 1\nprint(fin)\n\n\t \t \t \t \t \t\t\t \t \t \t", "import math\r\nti=1\r\n#ti=int(input())\r\nfor tes in range(ti):\r\n n,m,t=map(int,input().split())\r\n l=[]\r\n ans=0\r\n for i in range(m+1):\r\n k=int(input())\r\n l.append(k)\r\n n=l[m]\r\n for i in range(m):\r\n k=0\r\n n=l[i]^l[m]\r\n while(n>0):\r\n k+=int(n%2)\r\n n/=2\r\n if(k<=t):\r\n ans+=1\r\n print(ans)", "n,m,k = list(map(int,input().split()))\r\ntemp = m \r\nli = []\r\nwhile m >= 0:\r\n li.append(int(input()))\r\n m-=1\r\nfedor = m\r\ni = 0\r\ncount = 0\r\nfor i in range(len(li)-1):\r\n res = bin(li[i]^li[fedor]).replace(\"0b\",\"\").count(\"1\")\r\n if res <= k:\r\n count +=1\r\nprint(count)", "import math\r\nimport bisect\r\nn,m,k=map(int,input().split())\r\na=[]\r\nfor i in range(m):\r\n a.append(int(input()))\r\n\r\np=int(input())\r\ncount=0\r\nfor i in a:\r\n c=i^p\r\n sol=0\r\n # print(i,p)\r\n while c:\r\n # print(c)\r\n if c&1:\r\n sol+=1\r\n c=c>>1\r\n # print(c,67)\r\n if sol<=k:\r\n count+=1\r\nprint(count)\r\n", "n, m, k = map(int, input().split()); a=[]\r\ndef ham(s1, s2): return sum(s1[i] != s2[i] for i in range(len(s1)))\r\nfor _ in range(m+1): a.append(int(input()))\r\na = [bin(x)[2:] for x in a]\r\na = [\"0\"*(n-(len(x)))+x for x in a]\r\nprint(len([x for x in a[:-1] if ham(x, a[-1]) <= k]))\r\n", "def count_potential_friends(n, m, k, armies):\r\n count = 0\r\n fedor_army = armies[-1]\r\n\r\n for i in range(m):\r\n difference = armies[i] ^ armies[-1]\r\n bit_count = bin(difference).count('1')\r\n \r\n if bit_count <= k:\r\n count += 1\r\n\r\n return count\r\n\r\n# Read input\r\nn, m, k = map(int, input().split())\r\narmies = [int(input()) for _ in range(m + 1)]\r\n\r\n# Count potential friends\r\npotential_friends = count_potential_friends(n, m, k, armies)\r\n\r\n# Print the result\r\nprint(potential_friends)\r\n", "n, m, k = map(int, input().split())\r\nl = []\r\nfor _ in range(m):\r\n num = int(input())\r\n l.append(num)\r\n\r\nlast_num = int(input())\r\nco = 0\r\nfor i in range(m):\r\n if bin(last_num ^ l[i]).count('1') <= k:\r\n co += 1\r\n\r\nprint(co)\r\n", "n, m, k = (int(i) for i in input().split())\nx = [int(input()) for _ in range(m)]\nf = int(input())\nres = sum(bin(i ^ f)[2:].count(\"1\") <= k for i in x)\nprint(res)\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) #returns index of first value>=a\r\nright = lambda l,a : bisect.bisect_right(l,a) #returns index of first value >a\r\n\r\nn,m,s = getints()\r\nl = []\r\nfor _ in range(m+1):\r\n b = bin(int(input()))\r\n l.append('0'*(n-len(b)+2)+b[2:])\r\nf = l[-1]\r\n\r\nans = 0\r\nfor i in range(m):\r\n x = l[i]\r\n k = 0\r\n for y in range(n):\r\n if f[y] != x[y]:\r\n k += 1\r\n if k <= s: ans += 1\r\n\r\nprint(ans)", "# 利用异或取得的二进制,相同是0不同是1,取其中的1的数量,ok的话ans就加1\r\n# .count可以对二进制使用\r\nn, m, k = map(int, input().split())\r\nxi = map(int, [input() for _ in range(m)])\r\nfedor = int(input())\r\nans = 0\r\nfor i in xi:\r\n if bin(i ^ fedor).count('1') <= k:\r\n ans += 1\r\nprint(ans)\r\n", "def gd(a,f):\r\n s=0\r\n while a!=0 or f!=0:\r\n x=a%2\r\n y=f%2\r\n a//=2\r\n f//=2\r\n if x!=y:\r\n s+=1\r\n return s\r\nn,m,k=list(map(int, input().split()))\r\nl=list()\r\nfor _ in range(m):\r\n l.append(int(input()))\r\nf=int(input())\r\ns=0\r\nfor i in l:\r\n s+=1 if gd(i,f) <= k else 0\r\nprint(s) \r\n ", "n, m, k = map(int, input().split())\r\nlst = []\r\nfor i in range(m+1):\r\n lst.append(int(input()))\r\np = lst.pop()\r\nans = 0\r\nfor i in lst:\r\n qualifier = format(i^p, f'0{n}b')\r\n if qualifier.count('1') <= k:\r\n ans += 1\r\nprint(ans)\r\n", "def add_zeroes(s, n):\r\n \"\"\" Add padding zeroes\r\n To a string\r\n \"\"\"\r\n return '0'*n + s\r\n\r\n\r\nn, m, k = list(map(int, input().split(\" \")))\r\n\r\nplayers = []\r\n\r\nfor _ in range(m):\r\n players.append(int(input()))\r\n\r\nfedor = int(input())\r\n\r\nans = 0\r\nfor player in players:\r\n ans += sum(map(int, [*bin(fedor ^ player)[2:]])) <= k\r\n\r\nprint(ans)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn,m,k=map(int,input().split())\r\nl=[]\r\nfor i in range(m+1):\r\n\tl.append(int(input()))\r\nln=float(\"-inf\")\r\nfor i in range(m+1):\r\n\tl[i]=bin(l[i])[2:]\r\n\ttemp=len(l[i])\r\n\tif ln<temp:\r\n\t\tln=temp\r\nfor i in range(m+1):\r\n\tl[i]=\"0\"*(ln-len(l[i]))+l[i]\r\nfedor=l[-1]\r\nans=0\r\nfor i in range(m):\r\n\tc=0\r\n\tfor j in range(ln):\r\n\t\tif fedor[j]!=l[i][j]:\r\n\t\t\tc+=1\r\n\tif c<=k:\r\n\t\tans+=1\r\nprint(ans)", "def dec(decimal):\r\n binary = (bin(decimal)[2:])\r\n return binary\r\n\r\nn,m,k=map(int,input().split())\r\nl=[]\r\nl2=[]\r\nfor i in range(m+1):\r\n a=int(input())\r\n l.append(a)\r\n l2.append(dec(a))\r\n\r\nans=[]\r\n\r\nval=l[-1]\r\nl=l[:-1]\r\nfor i in l:\r\n ans.append(dec(val^i).count(\"1\"))\r\n\r\n\r\nctr=0\r\nfor i in ans:\r\n if i<=k:\r\n ctr=ctr+1\r\n\r\nprint(ctr)\r\n", "import math as math\r\n\r\ndef powlauda(a,b):\r\n mod= 1000000007\r\n ans=1\r\n while b!=0:\r\n if b%2==1:\r\n ans= (ans*a)%mod\r\n b=b-1\r\n a= (a*a)%mod\r\n b/=2\r\n return ans%mod\r\n\r\ndef binaryof(a):\r\n q=\"\"\r\n sex= int(math.log(a,2))\r\n for i in range(sex,-1,-1):\r\n if a>=powlauda(2,i):\r\n q+=\"1\"\r\n a-=powlauda(2,i)\r\n else:\r\n q+=\"0\"\r\n return q\r\n\r\n\r\n#\r\nn,m,k= map(int, input().split())\r\narr=[]\r\nmaxi=0\r\nfor i in range(m):\r\n b=int(input())\r\n a= binaryof(b)\r\n maxi= max(maxi,len(a))\r\n arr.append(a)\r\nlp= binaryof(int(input()))\r\nmaxi= max(maxi, len(lp))\r\nfor i in range(m):\r\n e= list(arr[i])\r\n e.reverse()\r\n for j in range(maxi-len(arr[i])):\r\n e.append(\"0\")\r\n e.reverse()\r\n arr[i]= \"\".join(e)\r\nfor i in range(maxi-len(lp)):\r\n e= list(lp)\r\n e.reverse()\r\n for j in range(maxi-len(lp)):\r\n e.append(\"0\")\r\n e.reverse()\r\n lp= \"\".join(e)\r\nfuck=0\r\nfor e in arr:\r\n t=0\r\n for i in range(maxi):\r\n if e[i]!=lp[i]:\r\n t+=1\r\n if t<=k:\r\n fuck+=1\r\nprint(fuck)", "def main():\r\n\tn, m, k = map(int, input().split())\r\n\tplayers = []\r\n\tdiffs = [0 for i in range(0, m)]\r\n\tfor i in range(0, m):\r\n\t\tplayers.append(int(input()))\r\n\tfedor = int(input())\r\n\tfor i in range(0, n):\r\n\t\tarmy_bit = i ** 2\r\n\t\tfor j in range(0, m):\r\n\t\t\tif (fedor & (1 << i)) != (players[j] & (1 << i)):\r\n\t\t\t\tdiffs[j] += 1\r\n\tansw = 0\r\n\tfor d in diffs:\r\n\t\tif d <= k:\r\n\t\t\tansw += 1\r\n\tprint(answ)\r\n\r\nif __name__ == \"__main__\":\r\n\tmain()", "def count_possible_friends(n, m, k, armies):\r\n feda_army = armies[-1]\r\n friends_count = 0\r\n\r\n for i in range(m):\r\n # XOR операция для подсчета различных битов\r\n diff_bits = bin(feda_army ^ armies[i]).count('1')\r\n\r\n if diff_bits <= k:\r\n friends_count += 1\r\n\r\n return friends_count\r\n\r\n# Чтение входных данных\r\nn, m, k = map(int, input().split())\r\narmies = [int(input()) for _ in range(m + 1)]\r\n\r\n# Вычисление и вывод результата\r\nresult = count_possible_friends(n, m, k, armies)\r\nprint(result)", "n,m,k=map(int, input().split())\r\nl=[]\r\nfor i in range(m+1):\r\n x=int(input())\r\n p=bin(x)\r\n l.append(p[2:])\r\n\r\nh=0\r\nfor i in range(len(l)):\r\n for j in range(n-len(l[i])):\r\n l[i]='0'+l[i]\r\n \r\n \r\nfor i in range(len(l)-1):\r\n d=0\r\n for j in range(len(l[0])):\r\n try:\r\n if l[len(l)-1][-j-1] !=l[i][-j-1]:\r\n d+=1\r\n \r\n \r\n except:\r\n pass\r\n\r\n if d<=k:\r\n \r\n h+=1\r\n \r\nprint(h)\r\n \r\n \r\n \r\n \r\n", "def countSetBits(n):\r\n count = 0\r\n while (n):\r\n count += n & 1\r\n n >>= 1\r\n return count\r\n\r\ns = input()\r\nnmk = s.split()\r\nn = int(nmk[0])\r\nm = int(nmk[1])\r\nk = int(nmk[2])\r\n\r\nsoldiers = []\r\n\r\nfor i in range(m):\r\n soldiers.append(int(input()))\r\n\r\nfedor_soldier = int(input())\r\n\r\ncount = 0\r\n\r\nfor soldier in soldiers:\r\n if countSetBits(fedor_soldier^soldier)<= k:\r\n count+=1\r\nprint(count)", "lines = [*open(0)]\r\nn, m, k = map(int, lines[0].split())\r\nxi = map(int, lines[1:-1])\r\nfedor = int(lines[-1])\r\nprint(sum(bin(fedor ^ i).count('1') <= k for i in xi))", "def countSetBits(n):\r\n count=0\r\n while(n>0):\r\n last_bit = n&1\r\n if last_bit==1:\r\n count+=1\r\n n = n>>1\r\n return count\r\n \r\nn , m , k = map(int, input().split())\r\narr = []\r\n\r\nfor _ in range(m+1):\r\n xi = int(input())\r\n arr.append(xi)\r\n\r\nfriends = 0\r\n\r\nfor i in range(m):\r\n value = arr[i]^arr[m]\r\n if countSetBits(value)<=k:\r\n friends+=1\r\n\r\nprint(friends)", "n, m, k = map(int, input().split())\nothers = []\nfor i in range(m):\n\tothers.append(int(input()))\n\nfedor = int(input())\nres = []\nfor o in others:\n\tans = bin(o ^ fedor)\n\tres.append(ans.count('1') <= k)\nprint(sum(res))\n", "def add_zeroes(s, n):\r\n \"\"\" Add padding zeroes\r\n To a string\r\n \"\"\"\r\n return '0'*n + s\r\n\r\n\r\nn, m, k = list(map(int, input().split(\" \")))\r\n\r\nplayers = []\r\n\r\nfor _ in range(m):\r\n players.append(bin(int(input()))[2:])\r\n\r\nfedor = bin(int(input()))[2:] # Binary representation of Fedor\r\n\r\nans = 0\r\nfor binary in players:\r\n f_temp = fedor\r\n diffs = 0\r\n if len(binary) < len(fedor):\r\n binary = add_zeroes(binary, len(fedor) - len(binary))\r\n elif len(binary) > len(fedor):\r\n f_temp = add_zeroes(f_temp, len(binary) - len(fedor))\r\n\r\n # Count the differences between the two numbers\r\n for i in range(len(binary)):\r\n if binary[i] != f_temp[i]:\r\n diffs += 1\r\n if diffs <= k:\r\n ans += 1\r\n\r\nprint(ans)", "#@sorcerer_21\r\nimport sys\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\n#for _ in range(int(input())):\r\nn,m,k=mapin()\r\na=[]\r\nfor i in range(m+1):\r\n a.append(int(input()))\r\nfedor=a[m]\r\nans=0\r\nfor i in range(m):\r\n potential_friend=a[i]\r\n bit_mismatch=0\r\n for j in range(n):\r\n if potential_friend>>j&1!=fedor>>j&1:\r\n bit_mismatch+=1\r\n if bit_mismatch<=k:ans+=1\r\nprint(ans)", "n, m, k = list(int(num) for num in input().split())\r\n\r\nx = [0] * (m + 1)\r\nfor i in range(m + 1):\r\n x[i] = int(input())\r\n\r\nans = 0\r\nfor i in range(m):\r\n xor = str(bin(x[m] ^ x[i]))\r\n kxi = 0\r\n for char in xor:\r\n if char == '1':\r\n kxi += 1\r\n if kxi <= k:\r\n ans += 1\r\n\r\nprint(ans)", "import sys\r\nn, m, k = map(int, input().split())\r\narr = []\r\nfor i in range(m):\r\n arr.append(int(input()))\r\nd = int(input())\r\ncnt = 0\r\nfor i in arr:\r\n count = 0\r\n c = i ^ d\r\n while c != 0:\r\n count += c & 1\r\n c >>= 1\r\n if count <= k:\r\n cnt += 1\r\nprint(cnt)", "n, m, k = map(int, input().split())\r\nx = [int(input()) for _ in range(m + 1)]\r\ncount = 0\r\nfor i in range(m):\r\n diff = x[i] ^ x[m]\r\n if bin(diff).count('1') <= k:\r\n count += 1\r\nprint(count)", "n,m,k = map(int,input().split())\r\na = []\r\nfor i in range(m+1):\r\n a.append(int(input()))\r\nf = a[m]\r\nc = 0\r\nfor i in range(m):\r\n q = f ^ a[i]\r\n d = 0\r\n e = 1\r\n for j in range(20):\r\n d += e & q != 0\r\n e <<= 1\r\n c += d <=k\r\nprint(c)", "n, m, k = map(int, input().split())\narr = []\nfor i in range(m):\n arr.append(int(input()))\nplayer = int(input())\ncount = 0\nr = 2\na = 1\nsum = int(a * (1 - r**k) / (1 - r))\nfor i in arr:\n temp = player ^ i\n bin_val = bin(temp)[2:][::-1]\n temp_count = 0\n for i in bin_val:\n if i == \"1\":\n temp_count += 1\n if temp_count > k:\n break\n if temp_count <= k:\n count += 1\nprint(count)\n", "n,m,k=map(int,input().split())\r\nx=[int(input()) for t in range(m+1)]\r\nprint(sum(bin(x[m]^y).count('1')<=k for y in x)-1)", "IN = lambda type = int:list(map(type, input().split()))\r\n\r\ndef solve(A, B):\r\n XOR = A ^ B\r\n count = 0\r\n # Check for 1's in the binary form using\r\n # Brian Kernighan's Algorithm\r\n while (XOR):\r\n XOR = XOR & (XOR - 1)\r\n count += 1\r\n return count\r\n \r\nn, m, k = IN()\r\na = []\r\nfriend = 0\r\nfor _ in range(m+1): a += [int(input())]\r\nfor x in range(m): \r\n if solve(a[x], a[m]) <= k: friend += 1\r\n # print(a[x], a[m], solve(a[x], a[m]),friend)\r\nprint(friend)", "n, m, k = map(int, input().split())\r\narmies = []\r\n\r\n# Read and store the binary representations of armies\r\nfor _ in range(m + 1):\r\n army = bin(int(input()))[2:].zfill(n)\r\n armies.append(army)\r\n\r\nfedor_army = armies.pop() # Remove Fedor's army from the list\r\n\r\nfriends_count = 0\r\n\r\n# Compare Fedor's army with the armies of other players\r\nfor army in armies:\r\n differing_bits = sum(1 for i, j in zip(fedor_army, army) if i != j)\r\n if differing_bits <= k:\r\n friends_count += 1\r\n\r\nprint(friends_count)\r\n", "n, m, k = map(int,input().split())\nx = [int(input()) for t in range (m + 1)]\nprint(sum(bin(x[m]^y).count('1') <= k for y in x)-1)\n\t\t\t \t \t \t\t\t\t\t\t\t\t\t \t\t\t \t\t\t", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n, m, k = map(int, stdin.readline().split())\r\n A = []\r\n\r\n for _ in range(m):\r\n a = int(stdin.readline())\r\n A.append(a)\r\n\r\n t = int(stdin.readline())\r\n res = 0\r\n\r\n for a in A:\r\n res += bin(a ^ t)[2:].count(\"1\") <= k\r\n\r\n print(res)\r\n\r\n\r\nsolve()\r\n", "a, b, c = map(int, input().split())\r\nd = []\r\ng = []\r\nj = p = 0\r\nfor i in range(b+1):\r\n d.append(int(input()))\r\nk = bin(d[-1])\r\nif len(k)>a+2:\r\n k = k[:2]+k[a:]\r\nx = int(k,2)\r\nk = k.count(\"1\")\r\nfor ii in range(b):\r\n j = bin(d[ii]&x)\r\n g.append(j.count(\"1\"))\r\nfor elem in range(len(g)):\r\n j = bin(d[elem])\r\n if len(j)>a+2:\r\n j = j[:2]+j[a:]\r\n j = j.count(\"1\")\r\n if k+j-2*g[elem]<=c:\r\n p+=1\r\nprint(p)", "n, m, k = map(int, input().split())\r\nx = [int(input()) for _ in range(m)]\r\nf = int(input())\r\nprint(sum(bin(f ^ v).count('1') <= k for v in x))\r\n" ]

[ "[n, m] = input().split()\r\nn = int(n)\r\nm = int(m)\r\n \r\narr = []\r\nps = []\r\nns = []\r\nsuspects = []\r\n\r\nfor i in range(0, n):\r\n a = input()\r\n a = int(a)\r\n arr.append(a)\r\n ps.append(0)\r\n ns.append(0)\r\n suspects.append(0)\r\n\r\nsum_ps = 0\r\nsum_ns = 0\r\nfor i in arr:\r\n if i > 0:\r\n ps[i - 1] += 1\r\n sum_ps += 1\r\n else:\r\n ns[-i - 1] += 1\r\n sum_ns += 1\r\n\r\nnum_suspects = 0\r\nfor i in range(0, n):\r\n if ps[i] + sum_ns - ns[i] == m:\r\n suspects[i] = 1\r\n num_suspects += 1\r\n\r\n\r\nfor i in arr:\r\n if i > 0:\r\n if suspects[i - 1]:\r\n if num_suspects == 1:\r\n print(\"Truth\")\r\n else:\r\n print(\"Not defined\")\r\n else:\r\n print(\"Lie\")\r\n else:\r\n if suspects[-i - 1]:\r\n if num_suspects == 1:\r\n print(\"Lie\")\r\n else:\r\n print(\"Not defined\")\r\n else:\r\n print(\"Truth\") \r\n", "from sys import stdin, stdout\r\n\r\nn, m = map(int, stdin.readline().split())\r\ncntf = [0 for i in range(n + 1)]\r\ncnts = [0 for i in range(n + 1)]\r\nchallengers = []\r\n\r\nfor i in range(n):\r\n s = stdin.readline().strip()\r\n challengers.append(s)\r\n \r\n if s[0] == '+':\r\n cntf[int(s[1:])] += 1\r\n else:\r\n cnts[int(s[1:])] += 1\r\n\r\nfirst = sum(cntf)\r\nsecond = sum(cnts)\r\nans = set()\r\n\r\nfor i in range(1, n + 1):\r\n if cntf[i] + second - cnts[i] == m:\r\n ans.add(i)\r\n\r\nfor i in range(n):\r\n s = challengers[i]\r\n \r\n if s[0] == '+':\r\n if int(s[1:]) in ans:\r\n if len(ans) > 1:\r\n stdout.write('Not defined\\n')\r\n else:\r\n stdout.write('Truth\\n')\r\n else:\r\n stdout.write('Lie\\n')\r\n else:\r\n if int(s[1:]) in ans:\r\n if len(ans) > 1:\r\n stdout.write('Not defined\\n')\r\n else:\r\n stdout.write('Lie\\n')\r\n else:\r\n stdout.write('Truth\\n') ", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m = map(int, input().split())\r\nd = [[0, 0] for i in range(n)]\r\nc = 0\r\ng = []\r\nfor i in range(n):\r\n s = input()[:-1]\r\n g.append(s)\r\n if s[0] == '-':\r\n c += 1\r\n d[int(s[1:])-1][1] += 1\r\n else:\r\n d[int(s[1:])-1][0] += 1\r\nq = [0]*n\r\nc1 = 0\r\nfor a, (i, j) in enumerate(d):\r\n if i + c - j == m:\r\n q[a] = 1\r\n c1 += 1\r\nfor i in range(n):\r\n a = int(g[i][1:]) - 1\r\n if g[i][0] == '-':\r\n if q[a] == 1:\r\n if c1 > 1:\r\n print('Not defined')\r\n else:\r\n print('Lie')\r\n else:\r\n print('Truth')\r\n else:\r\n if q[a] == 1:\r\n if c1 > 1:\r\n print('Not defined')\r\n else:\r\n print('Truth')\r\n else:\r\n print('Lie')", "import random\nimport sys\nfrom collections import defaultdict\nfrom functools import lru_cache\nfrom math import inf\n\nsys.setrecursionlimit(2 * 10 ** 6)\n\n\ndef test():\n pass\n\n\ndef main():\n n, m = map(int, input().split())\n ps = [0] * (n + 1)\n ns = [0] * (n + 1)\n stm = []\n for _ in range(n):\n s = int(input())\n if s > 0:\n ps[s] += 1\n else:\n ns[-s] += 1\n stm.append(s)\n pss = sum(ps)\n nss = sum(ns)\n ts = [set() for _ in range(n + 1)]\n ss = set()\n for s in range(1, n + 1):\n mm = ps[s] + nss - ns[s]\n if mm == m:\n ss.add(s)\n\n for st in stm:\n if st > 0:\n if len(ss) == 1 and st in ss:\n print('Truth')\n continue\n if st not in ss:\n print('Lie')\n continue\n else:\n if len(ss) == 1 and -st in ss:\n print('Lie')\n continue\n if -st not in ss:\n print('Truth')\n continue\n print('Not defined')\n\n\ndef init():\n import sys\n import os\n if 'CP_LOCAL_ENV' in os.environ:\n test()\n sys.stdin = open('test.txt')\n\n\nif __name__ == '__main__':\n init()\n main()\n", "n, m = map(int, input().split())\r\nt = [int(input()) for i in range(n)]\r\ns, p = 0, [0] * (n + 1)\r\nfor i in t:\r\n if i < 0:\r\n m -= 1\r\n p[-i] -= 1\r\n else: p[i] += 1\r\nq = {i for i in range(1, n + 1) if p[i] == m}\r\nif len(q) == 0: print('Not defined\\n' * n)\r\nelif len(q) == 1:\r\n j = q.pop()\r\n print('\\n'.join(['Truth' if i == j or (i < 0 and i + j) else 'Lie' for i in t]))\r\nelse:\r\n q.update({-i for i in q})\r\n print('\\n'.join(['Not defined' if i in q else ('Truth' if i < 0 else 'Lie') for i in t]))", "\r\n\r\nn,m=[int(x) for x in input().split()]\r\na=[0]*n\r\ncnt=[0]*(n+1)\r\nfor i in range(n):\r\n\r\n a[i]=int(input())\r\n if a[i]<0:\r\n cnt[-a[i]]-=1\r\n m-=1\r\n else:\r\n cnt[a[i]]+=1\r\n\r\ncm=0\r\nfor c in cnt[1:]:\r\n if c==m:\r\n cm+=1\r\n\r\nfor v in a:\r\n if v>0:\r\n if cnt[v]!=m:\r\n print('Lie')\r\n elif cm==1:\r\n print('Truth')\r\n else:\r\n print('Not defined')\r\n else:\r\n if cnt[-v]!=m:\r\n print('Truth')\r\n elif cm==1:\r\n print('Lie')\r\n else:\r\n print('Not defined')\r\n\r\n\r\n\r\n", "from collections import defaultdict\r\n\r\nn, m = map(int, input().split())\r\na = []\r\nfor i in range(n):\r\n a.append(int(input()))\r\n\r\nd = defaultdict(int)\r\npos, neg = 0, 0\r\nfor x in a:\r\n d[x] += 1\r\n if x > 0:\r\n pos += 1\r\n else:\r\n neg += 1\r\n\r\npossible = [False] * n\r\nfor i in range(1, n + 1):\r\n t = d[i] + neg - d[-i]\r\n if t == m:\r\n possible[i - 1] = True\r\n\r\ncnt = sum(possible)\r\nfor i in range(n):\r\n if cnt == 0:\r\n print('Lie')\r\n continue\r\n\r\n if a[i] > 0:\r\n if possible[a[i] - 1]:\r\n print('Truth' if cnt == 1 else 'Not defined')\r\n else:\r\n print('Lie')\r\n else:\r\n if not possible[-a[i] - 1]:\r\n print('Truth')\r\n else:\r\n print('Lie' if cnt == 1 else 'Not defined')\r\n", "import bisect\r\nimport copy\r\nimport gc\r\nimport itertools\r\nfrom array import array\r\nfrom fractions import Fraction\r\nimport heapq\r\nimport math\r\nimport operator\r\nimport os, sys\r\nimport profile\r\nimport cProfile\r\nimport random\r\nimport re\r\nimport string\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import defaultdict, deque, Counter\r\nfrom functools import reduce, lru_cache\r\nfrom io import IOBase, BytesIO\r\nfrom itertools import count, groupby, accumulate, permutations, combinations_with_replacement, product\r\nfrom math import gcd\r\nfrom operator import xor, add\r\nfrom typing import List\r\n\r\n\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\n# print = lambda d: sys.stdout.write(str(d)+\"\\n\")\r\ndef read_int_list(): return list(map(int, input().split()))\r\ndef read_int_tuple(): return tuple(map(int, input().split()))\r\ndef read_int(): return int(input())\r\n\r\n\r\n# endregion\r\n\r\n\r\n# f = open('inputs', 'r')\r\n# def input(): return f.readline().rstrip(\"\\r\\n\")\r\n\r\n\r\ndef main():\r\n for _ in range(1):\r\n n, m = read_int_tuple()\r\n yes, no = [0] * (n + 1), [0] * (n + 1)\r\n res = []\r\n for _ in range(n):\r\n x = read_int()\r\n res.append(x)\r\n [no, yes][x > 0][abs(x)] += 1\r\n\r\n yes_cnt, no_cnt = sum(yes), sum(no)\r\n\r\n crimers = set()\r\n for i in range(1, n + 1):\r\n true_cnt = yes[i] + no_cnt - no[i]\r\n if true_cnt == m:\r\n crimers.add(i)\r\n\r\n # print(crimers)\r\n\r\n for x in res:\r\n if len(crimers) == 1:\r\n print([['Truth', 'Lie'], ['Lie', 'Truth']][x > 0][abs(x) in crimers])\r\n else:\r\n print([['Truth', 'Not defined'], ['Lie', 'Not defined']][x > 0][abs(x) in crimers])\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n# cProfile.run(\"main()\")\r\n", "from collections import Counter\r\n\r\nc = Counter()\r\nn, m = map(int, input().split())\r\n\r\nsumdc = 0\r\nmark = []\r\nsuspect = set()\r\nfor _ in range(n):\r\n k = int(input())\r\n mark.append(k)\r\n if k < 0: sumdc += 1\r\n\r\nc = Counter(mark)\r\nk = 0\r\nfor i in range(1, n + 1):\r\n if c[i] + sumdc - c[-1 * i] == m:\r\n suspect.add(i)\r\n k += 1\r\n\r\nif k==0:print(\"Not defined\\n\"*n)\r\nelif k==1:\r\n j=suspect.pop()\r\n for x in mark:\r\n if x==j or(x<0 and abs(x)!=j):print(\"Truth\")\r\n else: print(\"Lie\")\r\nelse:\r\n suspect.update({-x for x in suspect})\r\n for x in mark:\r\n if x in suspect:print(\"Not defined\")\r\n elif x<0:print(\"Truth\")\r\n else:print(\"Lie\")\r\n\r\n\r\n\r\n\r\n\r\n", "\"\"\"\nBrandt Smith, Lemuel Gorion and Peter Haddad\n\ncodeforces.com\n\nProblem 156B\n\"\"\"\nimport sys\n\nn, m = map(int, input().split(' '))\n\ninp = []\nguess = [0] * (n + 1)\n\nfor i in range(n):\n temp = int(input())\n inp.append(temp)\n\n if temp < 0:\n m -= 1\n guess[-temp] -= 1\n else:\n guess[temp] += 1\n\ndic = {temp for temp in range(1, n + 1) if guess[temp] == m}\n\nif len(dic) == 0:\n for i in range(n):\n print('Not defined')\nelif len(dic) == 1:\n temp = dic.pop()\n\n for i in inp:\n if i == temp or (i < 0 and i + temp):\n print('Truth')\n else:\n print('Lie')\nelse:\n temp = dic.update({-i for i in dic})\n\n for i in inp:\n if i in dic:\n print('Not defined')\n else:\n if i < 0:\n print('Truth')\n else:\n print('Lie')\n\n" ]

[ "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Initialize variables\nleft = 0\nright = 0\nmax_length = 0\nmax_left = 0\nzero_count = 0\n\n# Iterate through the array\nwhile right < n:\n if a[right] == 0:\n zero_count += 1\n \n # If the number of zeros in the current window exceeds k, move the left pointer\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n \n # Update the maximum length and starting index of the subsegment\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n right += 1\n\n# Update the array to have ones in the chosen subsegment\nfor i in range(max_left, max_left + max_length):\n a[i] = 1\n\nprint(max_length)\nprint(*a)\n\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\ni=0\r\nj=0\r\nt=0\r\ns=-1\r\ne=-1 \r\nans=-1 \r\nwhile j<n:\r\n if l[j]==0:\r\n t+=1 \r\n while t>k:\r\n if l[i]==0:\r\n t-=1 \r\n i+=1 \r\n else:\r\n i+=1 \r\n if ans<j-i+1:\r\n ans=j-i+1\r\n s=i \r\n e=j \r\n j+=1\r\nif ans>-1:\r\n for i in range(s,e+1):\r\n l[i]=1\r\n \r\nprint(ans)\r\nprint(*l)", "def maximize_segment(n, k, arr):\n left = 0\n right = 0\n max_length = 0\n best_left = 0\n num_zeroes = 0\n \n while right < n:\n if arr[right] == 0:\n num_zeroes += 1\n \n while num_zeroes > k:\n if arr[left] == 0:\n num_zeroes -= 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n best_left = left\n \n right += 1\n \n # Update the array with the changes\n for i in range(best_left, best_left + max_length):\n arr[i] = 1\n \n return max_length, arr\n\n# Read input\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\n# Calculate and print the result\nmax_length, updated_arr = maximize_segment(n, k, arr)\nprint(max_length)\nprint(*updated_arr)\n\n\t\t \t \t \t \t \t\t \t\t\t\t \t\t \t \t\t", "import sys\r\ninput = sys.stdin.readline\r\n\r\n\r\nn, k = map(int, input().split())\r\nw = list(map(int, input().split()))\r\nd = [0]\r\nfor i in w:\r\n d.append(d[-1]+(i==1))\r\n\r\nl, h, x = 0, n+1, (0, 0)\r\nwhile l < h:\r\n m = (l+h)//2\r\n for i in range(m, n+1):\r\n if d[i]-d[i-m]+k >= m:\r\n l = m+1\r\n if m > x[0]:\r\n x = (m, i)\r\n break\r\n else:\r\n h = m\r\nfor i in range(x[1]-x[0], x[1]):\r\n if w[i] == 0:\r\n w[i] = 1\r\nprint(x[0])\r\nprint(' '.join(map(str, w)))\r\n", "n,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\nki=i=s=0;po=1\r\nfor j in range(n):\r\n if a[j]==0:s+=1\r\n while s>k:\r\n if a[i]==0:\r\n s-=1\r\n i+=1\r\n if j-i>ki-po:\r\n po=i\r\n ki=j\r\nprint(ki-po+1)\r\na[po:ki+1]=[1]*(ki-po+1)\r\nprint(*a)\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\ndef test_case():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n\r\n ans = 0\r\n l = -1\r\n r = -1\r\n\r\n j = 0\r\n zeros = 0\r\n for i in range(n):\r\n while j < n and not (zeros == k and a[j] == 0):\r\n if a[j] == 0: zeros += 1\r\n j += 1\r\n# print(i, j)\r\n if j-i >= ans:\r\n l = i\r\n r = j-1\r\n ans = j-i\r\n if a[i] == 0:\r\n zeros -= 1\r\n if ans != 0:\r\n for i in range(l, r+1):\r\n a[i] = 1\r\n print(ans)\r\n print(*a)\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", "R = lambda: map(int, input().split())\r\nn, k = R()\r\narr = list(R())\r\nj = -1\r\nsm = 0\r\nmj, mlen = -1, -1\r\nfor i in range(n):\r\n sm += arr[i] == 0\r\n while sm > k:\r\n sm -= arr[j + 1] == 0\r\n j += 1\r\n if i - j > mlen:\r\n mj, mlen = j + 1, i - j\r\narr[mj:mj + mlen] = [1] * mlen\r\nprint(mlen)\r\nprint(*arr)\r\n", "n, k = map(int, input().split())\nelements = list(map(int, input().split()))\n\nleft = 0\nmax_len = 0\nbest_left = 0\nzero_count = 0\n\nfor right in range(n):\n if elements[right] == 0:\n zero_count += 1\n\n while zero_count > k:\n if elements[left] == 0:\n zero_count -= 1\n left += 1\n\n if right - left + 1 > max_len:\n max_len = right - left + 1\n best_left = left\n\nfor i in range(best_left, best_left + max_len):\n elements[i] = 1\n\nprint(max_len)\nprint(*elements)\n\n \t \t \t \t \t \t \t\t \t \t \t\t", "def maximize_segment(n, k, arr):\n start, end = 0, 0\n max_length = 0\n left_index_of_max_segment = 0\n zeros_count = 0\n\n for end in range(n):\n if arr[end] == 0:\n zeros_count += 1\n \n while zeros_count > k:\n if arr[start] == 0:\n zeros_count -= 1\n start += 1\n\n if end - start + 1 > max_length:\n max_length = end - start + 1\n left_index_of_max_segment = start\n\n # Change up to k zeros inside the best segment to ones\n for i in range(left_index_of_max_segment, left_index_of_max_segment + max_length):\n if arr[i] == 0 and k > 0:\n arr[i] = 1\n k -= 1\n\n return max_length, arr\n\n# Example usage\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\nlength, changed_arr = maximize_segment(n, k, arr)\nprint(length)\nprint(' '.join(map(str, changed_arr)))\n\n \t\t\t\t \t\t\t \t\t \t \t \t\t\t\t \t\t\t\t", "\n\nn,k=map(int,input().split())\nl=list(map(int,input().split()))\nki=i=s=0; po=1\nfor j in range(n):\n s+=(l[j]==0)\n while s>k: s-=(l[i]==0); i+=1\n if j-i>ki-po: po,ki=i,j\nprint(ki-po+1)\nl[po:ki+1]=[1]*(ki-po+1)\nprint(' '.join(map(str,l)))\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())\na = list(map(int, input().split()))\n\nleft = 0 # Left pointer of the sliding window\nzero_count = 0 # Number of zeros in the current window\nmax_length = 0 # Length of the longest subsegment\nmax_start = 0 # Starting index of the longest subsegment\n\nfor right in range(n):\n if a[right] == 0:\n zero_count += 1\n\n while zero_count > k: # Shrink the window if zero count exceeds k\n if a[left] == 0:\n zero_count -= 1\n left += 1\n\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_start = left\n\n# Change k zeros to ones in the longest subsegment\nfor i in range(max_start, max_start + max_length):\n a[i] = 1\n\nprint(max_length)\nprint(*a)\n\n\n\t\t\t \t\t\t\t\t \t \t \t \t\t\t\t \t \t \t", "def maximize_consecutive_ones(n, k, arr):\n left = 0\n max_length = 0\n max_left = 0\n zero_count = 0\n \n for right in range(n):\n if arr[right] == 0:\n zero_count += 1\n \n while zero_count > k:\n if arr[left] == 0:\n zero_count -= 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n # Change zeroes to ones within the subsegment\n for i in range(max_left, max_left + max_length):\n arr[i] = 1\n \n return max_length, arr\n\n# Read input\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\n# Calculate and print the result\nmax_len, new_arr = maximize_consecutive_ones(n, k, arr)\nprint(max_len)\nprint(*new_arr)\n\n \t \t\t\t \t \t \t\t\t\t\t \t \t\t\t", "import sys\nsys.stderr = sys.stdout\n\nfrom collections import deque\n\n\ndef hard(n, k, A):\n D = deque()\n z = 0\n m = 0\n b = (0, 0)\n i = 0\n for j in range(n):\n if A[j] == 0:\n if z < k:\n z += 1\n else:\n l = j - i\n if l > m:\n m = l\n b = (i, j)\n while A[i] != 0:\n i += 1\n i += 1\n l = n - i\n if l > m:\n m = l\n b = (i, n)\n\n for i in range(b[0], b[1]):\n A[i] = 1\n return m\n\n\ndef main():\n n, k = readinti()\n A = readintl()\n z = hard(n, k, A)\n print(z)\n print(' '.join(map(str, A)))\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", "def maximizeSubsegment(n, k, a):\n left = 0\n maxLength = 0\n maxLeft = 0\n zeroCount = 0\n\n for right in range(n):\n if a[right] == 0:\n zeroCount += 1\n \n while zeroCount > k:\n if a[left] == 0:\n zeroCount -= 1\n left += 1\n \n if right - left + 1 > maxLength:\n maxLength = right - left + 1\n maxLeft = left\n \n for i in range(maxLeft, maxLeft + maxLength):\n a[i] = 1\n \n return maxLength, a\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nresultLength, resultArray = maximizeSubsegment(n, k, a)\n\nprint(resultLength)\nprint(*resultArray)\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())\narr = list(map(int, input().split()))\n\nleft = 0\nmax_len = 0\nbest_left = 0\nzero_count = 0\n\nfor right in range(n):\n if arr[right] == 0:\n zero_count += 1\n\n while zero_count > k:\n if arr[left] == 0:\n zero_count -= 1\n left += 1\n\n if right - left + 1 > max_len:\n max_len = right - left + 1\n best_left = left\n\nfor i in range(best_left, best_left + max_len):\n arr[i] = 1\n\nprint(max_len)\nprint(*arr)\n\n\t \t\t \t\t\t \t\t \t\t \t \t \t \t\t \t\t\t", "def max_consecutive_ones(n, k, elements):\n left = 0\n max_length = 0\n max_left = 0\n zeros_count = 0\n\n for right in range(n):\n if elements[right] == 0:\n zeros_count += 1\n\n while zeros_count > k:\n if elements[left] == 0:\n zeros_count -= 1\n left += 1\n\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n\n for i in range(max_left, max_left + max_length):\n elements[i] = 1\n\n return max_length, elements\nn, k = map(int, input().split())\nelements = list(map(int, input().split()))\nresult_length, result_elements = max_consecutive_ones(n, k, elements)\nprint(result_length)\nprint(\" \".join(map(str, result_elements)))\n\n\t \t \t\t \t \t\t\t \t \t \t\t\t\t \t \t \t\t", "def fun(arr,n,k):\n left = 0\n max_len = 0\n best_left = 0\n zero_count = 0\n \n for right in range(n):\n if arr[right] == 0:\n zero_count += 1\n \n while zero_count > k:\n if arr[left] == 0:\n zero_count -= 1\n left += 1\n \n if right - left + 1 > max_len:\n max_len = right - left + 1\n best_left = left\n \n for i in range(best_left, best_left + max_len):\n arr[i] = 1\n \n print(max_len)\n print(*arr)\n\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\nfun(arr,n,k)\n \n\t \t \t\t\t\t \t \t\t \t \t\t\t \t", "n,k=map(int,input().split())\r\na=[int(x) for x in input().split()]\r\ni=0\r\nj=0\r\nc=0\r\nan=0\r\np=[0,n-1]\r\nwhile (j<n and c<k):\r\n if a[j]==0 :\r\n c+=1\r\n j+=1\r\nan=j-i\r\np=[i,j]\r\nwhile (j<n):\r\n if a[j]==0:\r\n while (a[i]!=0):\r\n i+=1\r\n i+=1\r\n j+=1\r\n if (j-i)>an:\r\n an=j-i\r\n p=[i,j]\r\n\r\nprint(an)\r\n\r\nprint(*(a[:p[0]]+['1']*an + a[p[1]:]))", "def solve(n, k, a):\n max_length = 0\n max_left = 0\n window_start = 0\n zeros_count = 0\n \n for window_end in range(n):\n if a[window_end] == 0:\n zeros_count += 1\n while zeros_count > k:\n if a[window_start] == 0:\n zeros_count -= 1\n window_start += 1\n if window_end - window_start + 1 > max_length:\n max_length = window_end - window_start + 1\n max_left = window_start\n \n for i in range(max_left, max_left + max_length):\n a[i] = 1\n \n print(max_length)\n print(\" \".join(map(str, a)))\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Solve and print the result\nsolve(n, k, a)\n\n\t \t\t \t \t\t \t \t \t \t \t \t", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n, k = map(int, stdin.readline().split())\r\n ar = list(map(int, stdin.readline().split()))\r\n start = 0\r\n end = -1\r\n zeros = 0\r\n ans = 0\r\n sid = -1\r\n eid = -2\r\n while end < n:\r\n while end < n and zeros <= k:\r\n end += 1\r\n if end < n and ar[end] == 0:\r\n zeros += 1\r\n if ans < end - start:\r\n ans = end - start\r\n sid = start\r\n eid = end - 1\r\n while start <= end and zeros > k:\r\n if ar[start] == 0:\r\n zeros -= 1\r\n start += 1\r\n for i in range(sid, eid + 1):\r\n ar[i] = 1\r\n print(ans)\r\n print(*ar)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def maximize_consecutive_ones(n, k, a):\n left = 0 # Left pointer of the window\n max_length = 0\n max_left = 0 # Left index of the best subsegment\n changes = 0 # Number of changes made\n \n for right in range(n):\n if a[right] == 0:\n changes += 1\n \n while changes > k:\n if a[left] == 0:\n changes -= 1\n left += 1\n \n current_length = right - left + 1\n if current_length > max_length:\n max_length = current_length\n max_left = left\n \n # Make the changes in the array to achieve the maximum length\n for i in range(max_left, max_left + max_length):\n a[i] = 1\n \n return max_length, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Calculate and print the result\nmax_length, modified_array = maximize_consecutive_ones(n, k, a)\nprint(max_length)\nprint(*modified_array)\n\n\n\t \t \t \t \t \t \t\t\t\t\t\t \t \t \t", "def main():\n n, k = map(int, input().split())\n\n a = list(map(int, input().split()))\n\n maxLen = 0\n maxStart = 0\n zeroes = 0\n left = 0\n\n for right in range(n):\n if a[right] == 0:\n zeroes += 1\n\n while zeroes > k:\n if a[left] == 0:\n zeroes -= 1\n left += 1\n\n curLen = right - left + 1\n if curLen > maxLen:\n maxLen = curLen\n maxStart = left\n\n for i in range(maxStart, maxStart + maxLen):\n a[i] = 1\n\n print(maxLen)\n for num in a:\n print(num, end=\" \")\n\nif __name__ == \"__main__\":\n main()\n\n\t \t \t \t\t \t\t\t\t\t\t \t", "def maximize_consecutive_ones(n, k, a):\n left, right = 0, 0 \n max_len = 0 \n max_left = 0 \n changes = 0 \n\n while right < n:\n if a[right] == 0:\n changes += 1\n while changes > k:\n if a[left] == 0:\n changes -= 1\n left += 1\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n right += 1\n \n \n for i in range(max_left, max_left + max_len):\n a[i] = 1\n \n return max_len, a\n\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n\nmax_len, modified_a = maximize_consecutive_ones(n, k, a)\nprint(max_len)\nprint(*modified_a)\n\n \t\t\t \t \t \t \t\t\t\t \t \t\t", "n, k = map(int, input().split()) # Read n and k\na = list(map(int, input().split())) # Read the array a\n\nleft = right = max_length = max_left = 0 # Initialize pointers and variables\ncurrent_length = 0 # Initialize current subsegment's length\n\nwhile right < n:\n if a[right] == 1:\n current_length += 1\n \n while (right - left + 1) - current_length > k:\n if a[left] == 1:\n current_length -= 1\n left += 1\n \n if (right - left + 1) > max_length:\n max_length = right - left + 1\n max_left = left\n \n right += 1\n\n# Update the array a to maximize the length of the subsegment\nfor i in range(max_left, max_left + max_length):\n a[i] = 1\n\nprint(max_length) # Print the maximal value of f(a)\nprint(*a) # Print the modified array a\n\n \t\t \t \t\t \t\t \t\t \t \t", "def maximize_consecutive_ones(n, k, a):\n left = 0 # Left pointer of the window\n max_length = 0 # Length of the longest subsegment of ones\n max_left = 0 # Left index of the subsegment\n zero_count = 0 # Count of zeros in the current window\n\n for right in range(n):\n if a[right] == 0:\n zero_count += 1\n\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n\n # Convert up to k zeros to ones starting from max_left\n for i in range(max_left, max_left + max_length):\n a[i] = 1\n\n return max_length, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Call the function and print the result\nmax_length, new_array = maximize_consecutive_ones(n, k, a)\nprint(max_length)\nprint(*new_array)\n\n\t \t\t\t\t \t \t\t\t \t\t \t \t\t\t", "def maximize_subsegment(n, k, a):\n max_length = 0\n max_start = 0\n window_start = 0\n zero_count = 0\n \n for window_end in range(n):\n if a[window_end] == 0:\n zero_count += 1\n \n while zero_count > k:\n if a[window_start] == 0:\n zero_count -= 1\n window_start += 1\n \n if window_end - window_start + 1 > max_length:\n max_length = window_end - window_start + 1\n max_start = window_start\n \n # Change zeros within the selected subsegment to ones\n for i in range(max_start, max_start + max_length):\n a[i] = 1\n \n return max_length, a\n\n# Input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nmax_length, new_a = maximize_subsegment(n, k, a)\n\nprint(max_length)\nprint(*new_a)\n\n \t \t \t\t\t\t \t \t\t \t\t \t\t \t\t \t", "def maximize_consecutive_ones(n, k, arr):\n left, right = 0, 0 # Pointers for the window of consecutive elements\n max_len = 0 # Initialize the maximum length of consecutive ones\n max_start = 0 # Initialize the starting index of the subsegment to be modified\n\n zero_count = 0 # Count of zeros in the current window\n while right < n:\n if arr[right] == 0:\n zero_count += 1\n\n while zero_count > k:\n if arr[left] == 0:\n zero_count -= 1\n left += 1\n\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_start = left\n\n right += 1\n\n for i in range(max_start, max_start + max_len):\n arr[i] = 1\n\n return max_len, arr\n\n# Read input\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\n# Calculate and print the result\nresult_length, result_array = maximize_consecutive_ones(n, k, arr)\nprint(result_length)\nprint(*result_array)\n\n \t \t\t\t \t\t \t \t \t \t \t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nleft = 0 \nmax_len = 0 \nbest_left = 0 \nzero_count = 0 \n\nfor right in range(n):\n if a[right] == 0:\n zero_count += 1\n \n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n \n if right - left + 1 > max_len:\n max_len = right - left + 1\n best_left = left\n\nfor i in range(best_left, best_left + max_len):\n a[i] = 1\n\nprint(max_len)\nprint(*a)\n \t\t \t \t\t\t\t \t \t \t \t \t \t\t", "n, k = map(int, input().split()) # Number of elements in a and number of changes allowed\na = list(map(int, input().split())) # Elements of array a\n\nleft = 0\nmax_len = 0\nbest_left = 0\nzero_count = 0\n\nfor right in range(n):\n if a[right] == 0:\n zero_count += 1\n \n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n \n if right - left + 1 > max_len:\n max_len = right - left + 1\n best_left = left\n\nfor i in range(best_left, best_left + max_len):\n a[i] = 1\n\nprint(max_len)\nprint(*a)\n\n\t\t\t\t \t\t\t \t\t \t \t \t\t \t\t \t \t \t\t", "def maximize_subsegment(n, k, a):\n max_length = 0\n left = 0\n max_zeros = 0\n max_zeros_pos = 0\n\n for right in range(n):\n if a[right] == 0:\n max_zeros += 1\n\n while max_zeros > k:\n if a[left] == 0:\n max_zeros -= 1\n left += 1\n\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_zeros_pos = left\n\n # Change up to k zeros to ones within the selected subsegment\n for i in range(max_zeros_pos, max_zeros_pos + max_length):\n a[i] = 1\n\n return max_length, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Calculate and print the result\nresult_length, result_array = maximize_subsegment(n, k, a)\nprint(result_length)\nprint(*result_array)\n\n\t \t\t\t\t\t\t \t\t \t \t\t\t \t \t", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\n\nmax_sum = 0\ncount_zeros = 0\nleft = 0\nleft_answer = 0\nfor right in range(len(l)):\n if l[right] == 0:\n count_zeros += 1\n \n while count_zeros > k:\n if l[left] == 0:\n count_zeros -= 1\n left += 1\n \n if right - left + 1 > max_sum:\n max_sum = right - left + 1\n left_answer = left\n\nl[left_answer: left_answer + max_sum] = [1 for _ in range(max_sum)]\nprint(max_sum)\nprint(' '.join([str(x) for x in l]))\n\t\t\t \t\t\t \t\t \t \t \t \t \t \t \t", "#import sys\r\n#sys.stdin = open('in', 'r')\r\n#n = int(input())\r\nn,k = map(int, input().split())\r\na = [int(x) for x in input().split()]\r\nbl,br,bv = -1,-1,0\r\n\r\nl=0\r\nc = 0\r\nr = 0\r\nwhile r < n:\r\n if a[r] == 0:\r\n if c < k:\r\n c += 1\r\n else:\r\n if (r - l) > bv:\r\n bv = r - l\r\n bl = l\r\n br = r\r\n while a[l] == 1:\r\n l += 1\r\n l += 1\r\n r += 1\r\n\r\nif (r - l) > bv:\r\n bv = r - l\r\n bl = l\r\n br = r\r\n\r\nprint(bv)\r\nfor i in range(n):\r\n if i >= bl and i < br:\r\n print(1, end=' ')\r\n else:\r\n print(a[i], end=' ')\r\n", "n, k = map(int, input().split())\nelements = list(map(int, input().split()))\n\nmax_length = 0\nbest_start = 0\ncurrent_start = 0\nzero_count = 0\n\nfor i in range(n):\n if elements[i] == 0:\n zero_count += 1\n\n # If zero_count exceeds k, move the current_start pointer\n while zero_count > k:\n if elements[current_start] == 0:\n zero_count -= 1\n current_start += 1\n\n # Update the max_length and best_start if applicable\n if i - current_start + 1 > max_length:\n max_length = i - current_start + 1\n best_start = current_start\n\n# Modify the array to make the best subsegment all ones\nfor i in range(best_start, best_start + max_length):\n elements[i] = 1\n\nprint(max_length)\nprint(*elements)\n\n \t \t\t \t \t \t \t \t \t\t\t\t", "def main():\n n, k = map(int, input().split())\n a = list(map(int, input().split()))\n\n left, right = 0, 0\n max_len = 0\n max_left = 0\n zero_count = 0\n\n while right < n:\n if a[right] == 0:\n zero_count += 1\n \n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n \n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n \n right += 1\n\n for i in range(max_left, max_left + max_len):\n a[i] = 1\n\n print(max_len)\n print(' '.join(map(str, a)))\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", "n, k = map(int, input().split())\na = list(map(int, input().split()))\ns = e = ans = c = ans_s = 0\nans_e = -1\nwhile e < n:\n\tif not a[e]:\n\t\tc += 1\n\t\twhile c > k and e >= s:\n\t\t\tif not a[s]:\n\t\t\t\tc -= 1\n\t\t\ts += 1\n\tif(c <= k and e - s + 1 > ans_e - ans_s + 1):\n\t\tans_s = s\n\t\tans_e = e\n\te += 1\n\nprint(ans_e - ans_s + 1)\nfor i in range(n):\n\tif i >= ans_s and i <= ans_e:\n\t\tprint(1, end=\" \")\n\telse:\n\t\tprint(a[i], end=\" \")\n", "def solve(n, k, a):\n left = 0\n right = 0\n max_length = 0\n start_index = 0\n \n # Find the longest initial subsegment of consecutive ones\n while right < n:\n if a[right] == 1:\n right += 1\n else:\n if k > 0:\n k -= 1\n right += 1\n else:\n if a[left] == 0:\n k += 1\n left += 1\n \n # Update the longest subsegment information\n if right - left > max_length:\n max_length = right - left\n start_index = left\n \n # Convert zeros to ones in the optimal subsegment\n for i in range(start_index, start_index + max_length):\n a[i] = 1\n \n return max_length, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Solve the problem\nmax_length, new_a = solve(n, k, a)\n\n# Print output\nprint(max_length)\nprint(*new_a)\n\n \t\t \t\t \t \t\t\t \t \t \t \t \t\t", "def maximize_subsegment(n, k, elements):\n left = 0 # Left pointer of the sliding window\n right = 0 # Right pointer of the sliding window\n max_length = 0 # Maximum length of subsegment\n max_left = 0 # Left index of the subsegment\n max_changes = k # Remaining changes\n\n while right < n:\n if elements[right] == 0:\n max_changes -= 1\n\n while max_changes < 0:\n if elements[left] == 0:\n max_changes += 1\n left += 1\n\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n\n right += 1\n\n for i in range(max_left, max_left + max_length):\n elements[i] = 1\n\n return max_length, elements\n\n# Read input\nn, k = map(int, input().split())\nelements = list(map(int, input().split()))\n\n# Calculate and print the result\nmax_length, modified_elements = maximize_subsegment(n, k, elements)\nprint(max_length)\nprint(*modified_elements)\n\n\t\t\t \t\t \t \t\t\t \t", "\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ns=[]\r\nfor i in range(n):\r\n if(a[i]==0):\r\n s.append(i)\r\nz=0\r\nc=0\r\nx,w=0,0\r\nfor i in range(len(s)-k):\r\n y=s[i+k]-z\r\n if(c<y):\r\n c=y\r\n x=z\r\n w=s[i+k]\r\n z=s[i]+1\r\ny=n-z\r\nif(c<y):\r\n c=y\r\n x=z\r\n w=n\r\nfor i in range(x,w):\r\n if(a[i]==0):\r\n a[i]=1\r\nprint(c)\r\nfor i in range(n):\r\n print(a[i],end=' ')\r\nprint () \r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nleft, right, max_len, max_left = 0, 0, 0, 0\nzero_count = 0\n\nwhile right < n:\n if a[right] == 0:\n zero_count += 1\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n right += 1\n\nfor i in range(max_left, max_left + max_len):\n a[i] = 1\n\nprint(max_len)\nprint(*a)\n\t \t \t \t \t\t \t \t \t \t \t\t \t", "def maximize_subsegment(n, k, arr):\n left = 0\n max_length = 0\n max_left = 0\n ones_count = 0\n\n for right in range(n):\n if arr[right] == 1:\n ones_count += 1\n\n while right - left + 1 - ones_count > k:\n if arr[left] == 1:\n ones_count -= 1\n left += 1\n\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n\n for i in range(max_left, max_left + max_length):\n arr[i] = 1\n\n return max_length, arr\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\nmax_length, modified_arr = maximize_subsegment(n, k, arr)\nprint(max_length)\nprint(*modified_arr)\n\n \t\t \t \t \t \t \t\t \t\t\t\t\t \t\t\t", "# import math\nfrom collections import Counter, deque, defaultdict\nfrom math import *\nfrom bisect import bisect_right\nmod = 1000000007\n\n#1207-B\n#\n# from functools import reduce\n# from itertools import permutations\n# import queue\n\n\n\ndef solve():\n n, k = map(int, input().split(\" \"))\n l = list(map(int, input().split()))\n ans = [-1]\n for i in range(n):\n if l[i] == 0:\n ans.append(i)\n\n ans.append(n)\n if len(ans) - 2 <= k:\n ans = [1] * n\n print(n)\n print(*ans)\n else:\n x = len(ans)\n answer = 0\n left = 0\n right = -1\n # print(x,ans)\n for i in range(k + 1, x):\n if answer < ans[i] - ans[i - k - 1] - 1:\n left = ans[i - k - 1] + 1\n right = ans[i] - 1\n answer = ans[i] - ans[i - k - 1] - 1\n\n for i in range(left, right + 1):\n l[i] = 1\n\n print(answer)\n print(*l)\n# t=int(input())\nt = 1\nfor _ in range(t):\n # print(\"Case #{}: \".format(_ + 1), end=\"\")\n solve()\n \t\t\t\t \t\t \t \t \t\t\t\t\t \t \t\t \t \t", "import sys\r\nfrom bisect import bisect_left as bl\r\nfrom bisect import bisect_right as br\r\nfrom bisect import bisect\r\ndef inp(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\n\r\nn,k = map(int,inp().split())\r\na = list(map(int,inp().split()))\r\n\r\npre = [0]*(n+1)\r\nfor i in range(n):\r\n pre[i] = pre[i-1] + (1 if a[i] == 0 else 0)\r\n\r\ninf = pow(10,18)\r\nans = -inf\r\nl = -1\r\nr = -1\r\npre = pre[:n]\r\n\r\nfor i in range(n):\r\n if(i == 0):\r\n ind = bl(pre,k+1)\r\n new = ind - i\r\n if(ans<new):\r\n ans = new\r\n l = i\r\n r = ind-1\r\n else:\r\n ind = bl(pre,pre[i-1] + k + 1)\r\n new = ind-i\r\n if(ans<new):\r\n ans = new\r\n l = i\r\n r = ind-1\r\n\r\nprint(ans)\r\nfor i in range(l,r+1):\r\n a[i] = 1\r\n\r\nprint(' '.join(str(a[i]) for i in range(n)))\r\n", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nleft = 0 # Left pointer for the sliding window\nmax_length = 0 # Maximum length of subsegment\nmax_left = 0 # Left index of the optimal subsegment\n\n# Iterate through the array using the right pointer\nfor right in range(n):\n if arr[right] == 0:\n k -= 1 # Decrement k if the current element is 0\n \n # Slide the window to the right if k becomes negative\n while k < 0:\n if arr[left] == 0:\n k += 1 # Increment k if the left element becomes part of the subsegment\n left += 1\n \n # Update the maximum subsegment length and its left index\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n\n# Change the elements in the optimal subsegment to 1\nfor i in range(max_left, max_left + max_length):\n arr[i] = 1\n\nprint(max_length)\nprint(*arr)\n\n \t \t \t \t\t\t\t \t\t\t\t\t\t \t\t", "# from collections import defaultdict\r\n\r\n\r\n# n, k = list(map(int, input().split()))\r\n# a = list(map(int, input().split()))\r\n\r\n# res = []\r\n# vitriso0 = []\r\n# for i in range(n):\r\n# if a[i] == 0:\r\n# vitriso0.append(i)\r\n\r\n# temp = 0\r\n# check = False\r\n# i = 0\r\n# while i < n:\r\n# if a[i] == 0:\r\n# res.append(0)\r\n# i += 1\r\n# else:\r\n# temp = 0\r\n# for j in range(i, n):\r\n# if a[j] == 1:\r\n# temp += 1\r\n# i += 1\r\n# else:\r\n# res.append(temp)\r\n# break\r\n# if i == n:\r\n# res.append(temp)\r\n\r\n# length = len(res)\r\n# pos = []\r\n# for i in range(length):\r\n# if res[i] == 0:\r\n# pos.append(i)\r\n\r\n# data = []\r\n\r\n# count = 0\r\n\r\n# for i in range(len(pos)):\r\n# if pos[i] == 0:\r\n# if len(res) > 1:\r\n# data.append((count, res[pos[i]+1]+1))\r\n# else:\r\n# data.append((count, 1))\r\n# elif pos[i] == length-1:\r\n# data.append((count, res[pos[i]-1]+1))\r\n# else:\r\n# data.append((count, res[pos[i]-1]+res[pos[i]+1]+1))\r\n# count += 1\r\n\r\n# data.sort(key=lambda x: -x[1])\r\n# done = []\r\n# for i in range(k):\r\n# done.append(data[i][0])\r\n# for i in done:\r\n# a[vitriso0[i]] = 1\r\n\r\n\r\n# kiemtra = []\r\n# i = 0\r\n# while i < n:\r\n# if a[i] == 0:\r\n# kiemtra.append(0)\r\n# i += 1\r\n# else:\r\n# temp = 0\r\n# for j in range(i, n):\r\n# if a[j] == 1:\r\n# temp += 1\r\n# i += 1\r\n# else:\r\n# kiemtra.append(temp)\r\n# break\r\n# if i == n:\r\n# kiemtra.append(temp)\r\n# print(max(kiemtra))\r\n# print(*a)\r\n\r\n\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: O_Hard_Process.py\r\n# * Folder: D:\\Code\\Python\\Codeforces\\ProblemSet\\Topic Stream Mashup Dynamic Programming\r\n# ? Author: TranDucTri2003\r\n# TODO CreatedAt: 08/26/2022 16:11:51\r\n# ? -----------------------------------------------------------------------------------------------------\r\n\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\ndef getNum0(a, l, r):\r\n return a[r+1]-a[l] # ! Số số 0 trong đoạn [l,r]\r\n\r\n\r\n#! Tìm đoạn dài nhất có k chữ số 0\r\nn, k = list(map(int, input().split()))\r\na = list(map(int, input().split()))\r\n\r\npreFix = [0]*(n+1)\r\nfor i in range(n):\r\n if a[i] == 0:\r\n preFix[i+1] = preFix[i]+1\r\n else:\r\n preFix[i+1] = preFix[i]\r\n\r\n\r\nbest = [0, (-1, -1)]\r\nfor i in range(0, n):\r\n l = i\r\n r = n\r\n while l < r:\r\n m = (l+r)//2\r\n if getNum0(preFix, i, m) > k:\r\n r = m\r\n else:\r\n l = m+1\r\n\r\n if r-i > best[0]:\r\n best[0] = r-i\r\n best[1] = (i, r-1)\r\n\r\nprint(best[0])\r\nfor i in range(n):\r\n if best[1][0] <= i <= best[1][1]:\r\n print(1, end=\" \")\r\n else:\r\n print(a[i], end=\" \")\r\n", "n, k = map(int, input().strip().split())\r\narr = list(map(int, input().strip().split()))\r\n\r\nzero_counter = 0\r\nmax_len = 0\r\nleft,right=0,-1\r\nrleft,rright=-1,-1\r\nwhile right < n-1:\r\n right+=1\r\n if arr[right] == 0:\r\n zero_counter+=1\r\n while zero_counter > k:\r\n if arr[left]==0:\r\n zero_counter-=1\r\n left+=1\r\n if max_len < right - left + 1:\r\n max_len = right - left + 1\r\n rleft,rright=left,right\r\nif rleft != -1:\r\n for j in range(rleft,rright+1):\r\n arr[j]=1\r\nprint(max_len)\r\nfor i in range(n):\r\n print(arr[i], end = ' ')", "import sys\r\nimport math\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nd = [1e6] * int(3e5 + 1)\r\npos, ans, res = 0, 0, 0\r\nfor i in range(n):\r\n\tans += a[i] == 0\r\n\td[ans] = min(d[ans], i)\r\n\td[0] = -1\r\n\t\r\n\tcc = d[ans-k if ans-k>=0 else 0]\r\n\tif (res < i - cc):\r\n\t\tpos = cc + 1\r\n\t\tres = i - cc\r\nprint(res)\r\na[pos:pos+res] = [1]*res\r\nprint(*a)", "l = list(map(int, input().split()))\nn = l[0]\nk = l[1]\nnums = list(map(int, input().split()))\nl_po, r_po = 0, -1\nb_l_po, b_r_po = 0, -1\nzeros, maxf = 0, 0\nwhile r_po < len(nums) - 1:\n r_po += 1\n if nums[r_po] == 0:\n if zeros < k:\n zeros += 1\n else:\n while nums[l_po] == 1:\n l_po += 1\n l_po += 1\n if r_po + 1 - l_po > maxf:\n maxf = r_po + 1 - l_po\n b_l_po = l_po\n b_r_po = r_po\n ### print(\"r:\", r_po, \"l:\", l_po) ###\nprint(maxf)\nfor k in range(b_l_po):\n print(nums[k], end = ' ')\nfor k in range(b_l_po, b_r_po + 1):\n print(1, end = ' ')\nfor k in range(b_r_po + 1, len(nums)):\n print(nums[k], end = ' ')\n", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nmax_length = 0\nmax_start_index = 0\nzero_count = 0\n\ncurrent_start = 0\ncurrent_end = 0\n\nwhile current_end < n:\n if arr[current_end] == 0:\n zero_count += 1\n \n while zero_count > k:\n if arr[current_start] == 0:\n zero_count -= 1\n current_start += 1\n \n if current_end - current_start + 1 > max_length:\n max_length = current_end - current_start + 1\n max_start_index = current_start\n\n current_end += 1\n\nfor i in range(max_start_index, max_start_index + max_length):\n arr[i] = 1\n\nprint(max_length)\nprint(*arr)\n\n\t\t \t \t \t\t\t\t\t\t \t\t\t \t \t \t\t", "n, k = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\nl = 0\r\nans = 0\r\nresL = -1\r\nresR = -1\r\ncntZero = 0\r\nfor r in range(n):\r\n if a[r] == 0:\r\n cntZero += 1\r\n while cntZero > k:\r\n if a[l] == 0:\r\n cntZero -= 1\r\n l += 1\r\n if ans < r - l + 1:\r\n ans = r - l + 1\r\n resL = l\r\n resR = r\r\nprint(ans)\r\nif resL != -1:\r\n for i in range(resL, resR + 1):\r\n a[i] = 1\r\nfor i in range(n):\r\n print(a[i], end = ' ')", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nl = r = best_l = best_length = zeroes = 0\n\nfor r in range(n):\n if a[r] == 0:\n zeroes += 1\n while zeroes > k:\n if a[l] == 0:\n zeroes -= 1\n l += 1\n if r - l + 1 > best_length:\n best_length = r - l + 1\n best_l = l\n\nprint(best_length)\nfor i in range(best_l, best_l + best_length):\n a[i] = 1\nprint(*a)\n\n \t \t \t \t \t\t\t \t\t\t\t \t \t \t", "from sys import stdin\r\ninput=lambda : stdin.readline().strip()\r\nfrom math import ceil,sqrt,factorial,gcd\r\nfrom collections import deque\r\nn,k=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nans=[0,-1]\r\ni,j=0,0\r\ncount=0\r\na=0\r\nwhile i<n and j<n:\r\n\tif count<=k:\r\n\t\tif l[i]==0:\r\n\t\t\tcount+=1\r\n\t\t\ti+=1\r\n\t\telse:\r\n\t\t\ti+=1\r\n\telse:\r\n\t\tif l[j]==0:\r\n\t\t\tcount-=1\r\n\t\t\tj+=1\r\n\t\telse:\r\n\t\t\tj+=1\r\n\tif count<=k:\r\n\t\tif abs(i-j)>a:\r\n\t\t\tans=[j,i]\r\n\t\t\ta=max(a,abs(i-j))\r\nprint(a)\r\n# print(ans)\r\nfor i in range(ans[0],ans[1]):\r\n\tl[i]=1\r\nprint(*l)", "def maximize_subsegment(n, k, elements):\n left = 0\n max_length = 0\n max_left = 0\n zero_count = 0\n \n for right in range(n):\n if elements[right] == 0:\n zero_count += 1\n \n while zero_count > k:\n if elements[left] == 0:\n zero_count -= 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n for i in range(max_left, max_left + max_length):\n elements[i] = 1\n \n return max_length, elements\n\n# Read input\nn, k = map(int, input().split())\nelements = list(map(int, input().split()))\n\n# Calculate the maximum length and modified elements array\nmax_length, modified_elements = maximize_subsegment(n, k, elements)\n\n# Print the result\nprint(max_length)\nprint(*modified_elements)\n\n\t \t \t\t \t\t\t\t\t \t\t \t \t \t\t\t\t \t", "mx = 0\n\n\ndef f(need, c, k, n):\n for i in range(n):\n if i + need - 1 >= n:\n break\n temp = c[i + need - 1]\n if i > 0:\n temp -= c[i - 1]\n if temp + k >= need:\n return (True, i)\n\n return (False, None)\n\n\ndef main():\n n, k = list(map(int, input().split()))\n a = list(map(int, input().split()))\n\n c = [0 for i in range(n)]\n\n c[0] = a[0]\n\n for i in range(1, n):\n c[i] = c[i - 1]\n if a[i] == 1:\n c[i] += 1\n\n l, r = k, n + 1\n\n while r - l > 100:\n m = (l + r) // 2\n if f(m, c, k, n)[0]:\n l = m\n else:\n r = m\n\n for i in range(r, l - 1, -1):\n res, start = f(i, c, k, n)\n if res:\n print(\"%d\" % i)\n print(\" \".join(str(x)\n for x in a[:start] + [1] * i + a[start + i:]))\n return\n\nif __name__ == \"__main__\":\n main()\n # print(gcd(100, 2))\n", "\r\ndef main():\r\n \r\n n, k = readIntArr()\r\n a = readIntArr()\r\n \r\n p = a.copy()\r\n for i in range(1, n):\r\n p[i] += p[i - 1]\r\n def q1(l, r):\r\n if l == 0: return p[r]\r\n return p[r] - p[l - 1]\r\n \r\n maxc = -1\r\n optI = 0\r\n \r\n for l in range(n):\r\n lo = l - 1\r\n hi = n - 1\r\n while lo < hi:\r\n mid = (lo + hi + 1) // 2\r\n if mid - l + 1 <= q1(l, mid) + k:\r\n lo = mid\r\n else:\r\n hi = mid - 1\r\n if lo - l + 1 > maxc:\r\n maxc = lo - l + 1\r\n optI = l\r\n \r\n print(maxc)\r\n i = optI\r\n for _ in range(maxc):\r\n a[i] = 1\r\n i += 1\r\n oneLineArrayPrint(a)\r\n \r\n return\r\n \r\n \r\n \r\nimport sys\r\ninput=sys.stdin.buffer.readline #FOR READING PURE INTEGER INPUTS (space separation ok)\r\n# input=lambda: sys.stdin.readline().rstrip(\"\\r\\n\") #FOR READING STRING/TEXT INPUTS.\r\n \r\ndef oneLineArrayPrint(arr):\r\n print(' '.join([str(x) for x in arr]))\r\ndef multiLineArrayPrint(arr):\r\n print('\\n'.join([str(x) for x in arr]))\r\ndef multiLineArrayOfArraysPrint(arr):\r\n print('\\n'.join([' '.join([str(x) for x in y]) for y in arr]))\r\n \r\ndef readIntArr():\r\n return [int(x) for x in input().split()]\r\n# def readFloatArr():\r\n# return [float(x) for x in input().split()]\r\n \r\ndef makeArr(defaultValFactory,dimensionArr): # eg. makeArr(lambda:0,[n,m])\r\n dv=defaultValFactory;da=dimensionArr\r\n if len(da)==1:return [dv() for _ in range(da[0])]\r\n else:return [makeArr(dv,da[1:]) for _ in range(da[0])]\r\n \r\ndef queryInteractive(a, b, c):\r\n print('? {} {} {}'.format(a, b, c))\r\n sys.stdout.flush()\r\n return int(input())\r\n \r\ndef answerInteractive(ansArr):\r\n print('! {}'.format(' '.join([str(x) for x in ansArr])))\r\n sys.stdout.flush()\r\n \r\ninf=float('inf')\r\n# MOD=10**9+7\r\n# MOD=998244353\r\n \r\nfrom math import gcd,floor,ceil\r\nimport math\r\n# from math import floor,ceil # for Python2\r\n \r\nfor _abc in range(1):\r\n main()", "import bisect\n\n\ndef readline():\n return [int(x) for x in input().strip().split()]\n\n\ndef to_s(iterable):\n return (str(obj) for obj in iterable)\n\n\nclass Solver:\n def __init__(self):\n self.n = None\n self.k = None\n self.a = None\n self.sums = []\n\n def main(self):\n self.n, self.k = readline()\n self.a = [0] + readline()\n self.sums.append(0)\n for val in self.a[1:]:\n self.sums.append(self.sums[-1] + (val == 0))\n\n best_start, best_end = 0, -1\n for i in range(1, self.n + 1):\n end = bisect.bisect_right(self.sums, self.k + self.sums[i - 1], i)\n if end - i > best_end - best_start:\n best_start, best_end = i, end\n\n print(best_end - best_start)\n for i in range(best_start, best_end):\n self.a[i] = 1\n print(' '.join(to_s(self.a[1:])))\n\n\nSolver().main()\n", "import bisect\r\nn,k=map(int,input().split())\r\na=list(map(int,input().split()))\r\ndp=[0]*(n+1)\r\n##zeros=[]\r\nfor i in range(len(a)):\r\n if a[i]==0:\r\n dp[i+1]+=1\r\n dp[i+1]+=dp[i]\r\nmaxi=-1\r\n##print(dp)\r\nind=-1\r\nfor i in range(1,len(dp)):\r\n ans=bisect.bisect_left(dp,dp[i]-k)\r\n maxi=max(maxi,i-ans)\r\n if maxi==i-ans:\r\n ind=i\r\n\r\nend=ind-1\r\nstrt=end-maxi+1\r\nfor i in range(strt,end+1):\r\n a[i]=1\r\n\r\nprint(maxi)\r\nprint(*a)\r\n\r\n", "def maximize_subsegment(n, k, elements):\n left, right = 0, 0\n max_length = 0\n max_left = 0\n \n zeros_count = 0\n \n while right < n:\n if elements[right] == 0:\n zeros_count += 1\n \n while zeros_count > k:\n if elements[left] == 0:\n zeros_count -= 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n right += 1\n \n for i in range(max_left, max_left + max_length):\n elements[i] = 1\n \n return max_length, elements\n\nn, k = map(int, input().split())\nelements = list(map(int, input().split()))\n\nmax_length, modified_elements = maximize_subsegment(n, k, elements)\n\nprint(max_length)\nprint(*modified_elements)\n#cal\n\t\t\t \t \t \t \t \t \t \t\t\t\t\t \t \t\t", "def maximize_subsegment(n, k, arr):\n left = 0\n max_length = 0\n max_left = 0\n remaining_changes = k\n\n for right in range(n):\n if arr[right] == 0:\n if remaining_changes > 0:\n remaining_changes -= 1\n else:\n while arr[left] != 0:\n left += 1\n left += 1\n\n length = right - left + 1\n if length > max_length:\n max_length = length\n max_left = left\n\n for i in range(max_left, max_left + max_length):\n arr[i] = 1\n\n return max_length, arr\n\n# Read input\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\n# Calculate and print the result\nmax_length, modified_arr = maximize_subsegment(n, k, arr)\nprint(max_length)\nprint(*modified_arr)\n\n\t\t\t \t\t\t\t\t \t\t\t \t\t\t \t\t \t\t \t\t", "\n\nimport sys\n\n# Defining constants\nmd = 1000000007\n\n# Defining functions for faster input\ndef inp():\n return int(input())\n\ndef ins():\n return input()\n\ndef inlt():\n return list(map(int, input().split()))\n\ndef invr():\n return map(int, input().split())\n\ndef pf(x):\n print(x)\n\ndef pcase(i):\n print(\"Case\", i, \":\",)\n\ndef solve():\n n, k = invr()\n a = inlt()\n\n cnt = 0\n mx_lan = 0\n pos = 0\n l = 0\n\n for i in range(n):\n if a[i] == 0:\n cnt += 1\n while cnt > k:\n if a[l] == 0:\n cnt -= 1\n l += 1\n\n if (i - l + 1) > mx_lan:\n mx_lan = i - l + 1\n pos = i\n\n print(mx_lan)\n\n while pos >= 0 and mx_lan > 0:\n if a[pos] == 0:\n a[pos] = 1\n pos -= 1\n mx_lan -= 1\n\n for i in range(n):\n print(a[i], end=\" \")\n\nif __name__ == \"__main__\":\n fast_input = sys.stdin.readline\n\n t = 1\n for _ in range(t):\n solve()\n\n \t\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())\na = list(map(int, input().split()))\n\nleft = 0 # Left pointer of the sliding window\nmax_len = 0 # Maximum length of subsegment of consecutive ones\nbest_left = 0 # Left index of the best subsegment\nzero_count = 0 # Count of zeroes within the sliding window\n\nfor right in range(n):\n if a[right] == 0:\n zero_count += 1\n \n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n \n if right - left + 1 > max_len:\n max_len = right - left + 1\n best_left = left\n\n# Update the array elements based on the best subsegment\nfor i in range(best_left, best_left + max_len):\n a[i] = 1\n\nprint(max_len)\nprint(*a)\n\n#abcd\n \t \t\t \t \t\t\t\t \t\t \t \t\t", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\nfrom collections import defaultdict\r\n\r\nN,K = map(int, input().split())\r\nA = list(map(int, input().split()))\r\n\r\nl = 0\r\ncnt = 0\r\ncur = 0\r\nans = None\r\nfor i in range(N):\r\n if A[i]==0:\r\n cnt+=1\r\n while cnt>K:\r\n if A[l]==0:\r\n cnt-=1\r\n l+=1\r\n #print(l,i,cnt)\r\n if i-l+1>cur:\r\n cur = i-l+1\r\n ans = (l,i)\r\n\r\nif ans:\r\n for i in range(ans[0],ans[1]+1):\r\n A[i] = 1\r\nprint(cur)\r\nprint(*A)", "def maximize_consecutive_ones(n, k, elements):\n left = 0 # Initialize the left pointer\n max_length = 0 # Initialize the maximum length of subsegment\n max_left = 0 # Initialize the left boundary of the optimal subsegment\n num_changes = 0 # Initialize the number of changes made so far\n\n for right in range(n):\n if elements[right] == 0:\n num_changes += 1\n\n # If the number of changes exceeds k, move the left pointer to shrink the window\n while num_changes > k:\n if elements[left] == 0:\n num_changes -= 1\n left += 1\n\n # Update the maximum length and left boundary if necessary\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n\n # Change the elements within the optimal subsegment to ones\n for i in range(max_left, max_left + max_length):\n elements[i] = 1\n\n return max_length, elements\n\n# Read input\nn, k = map(int, input().split())\nelements = list(map(int, input().split()))\n\n# Calculate the maximal value of f(a) and the modified array\nmax_length, modified_elements = maximize_consecutive_ones(n, k, elements)\n\n# Print the results\nprint(max_length)\nprint(\" \".join(map(str, modified_elements)))\n\n\t \t\t \t\t \t\t\t\t\t \t \t \t \t\t", "n, k = map(int, input().split())\nl = list(map(int, input().split()))\ncnt = i = sm = 0\npos = 1\nfor j in range(n):\n sm += (l[j] == 0)\n while sm > k:\n sm -= (l[i] == 0)\n i += 1\n if j - i > cnt - pos:\n pos, cnt = i, j\nprint(cnt - pos + 1)\nl[pos: cnt + 1] = [1] * (cnt - pos + 1)\nprint(' '.join(map(str, l)))", "n,k = map(int,input().split())\r\narr = [int(i) for i in input().split()]\r\n\r\npref = [0]\r\nfor i in range(n):\r\n\r\n\tpref.append(pref[-1] + arr[i])\r\n\r\n\r\ndef sat(low,ind):\r\n\tglobal k\r\n\treturn (pref[ind+1] - pref[low] >= ind - low + 1 - k)\r\n\r\n\t\t\r\ndef bs(lo, hi):\r\n\t# print(lo,hi)\r\n\tret = -1\r\n\tlow = lo\r\n\twhile lo <= hi:\r\n\t\tmid = (lo + hi) // 2\r\n\t\tif sat(low,mid):\r\n\t\t\tret = max(ret, mid)\r\n\t\t\tlo = mid + 1\r\n\t\telse:\r\n\t\t\thi = mid - 1\r\n\t# print(ret)\r\n\treturn ret\r\n\r\nans = 0\r\nstart = 0\r\nfor i in range(n):\r\n\tlength = bs(i,n-1) - i + 1\r\n\tif length > ans:\r\n\t\tans = length\r\n\t\tstart = i\r\n\r\nprint(ans)\r\n\r\nfor i in range(start, start + ans):\r\n\tarr[i] = 1\r\nprint(*arr)", "def my_660C():\n #time complexity: n.\n #space complexity: n->2n.\n ans = -1\n left = -1\n right = -1\n #get n and k.\n n_k = input().split(' ')\n n = int(n_k[0])\n k = int(n_k[1])\n #get the array.\n original_list = list(map(lambda x: int(x), input().split(' ')))\n #create a new array where the first and last element are -1 and n respectively\n #and the others are the index of 0s in the original array.\n zeros = [-1]\n for i in range(n):\n if original_list[i] == 0:\n zeros += [i]\n zeros += [n]\n \n if len(zeros) - 2 <= k: #all the elements should be 1.\n ans = n\n else: #there is still one or more 0s left in the array after being changed.\n for i in range(len(zeros) - k - 1):\n if zeros[i + k + 1] - zeros[i] - 1 > ans:\n ans = zeros[i + k + 1] - zeros[i] - 1\n left = zeros[i] + 1\n right = zeros[i + k + 1] - 1\n #print the maximal value.\n print(ans)\n #print the array after being changed.\n for i in range(n):\n if ans == n: #the number of 0s <= k.\n if i == n - 1:\n print('1', end='')\n else:\n print('1', end=' ')\n else: #the number of 0s > k.\n if i == n - 1:\n if i >= left and i <= right:\n print('1', end='')\n else:\n print(original_list[i], end='')\n else:\n if i >= left and i <= right:\n print('1', end=' ')\n else:\n print(original_list[i], end=' ')\n\nif __name__ == \"__main__\":\n my_660C()\n ", "n,k=map(int,input().strip().split())\r\narr=list(map(int,input().strip().split()))\r\n\r\ns,j,ans=0,0,0\r\na1,a2=-1,-1\r\n\r\nfor i in range(n):\r\n\tif arr[i]==0:\r\n\t\ts+=1\r\n\tif s>k:\r\n\t\tif arr[j]==0:\r\n\t\t\ts-=1\r\n\t\tj+=1\r\n\tif ans<i-j+1:\r\n\t\tans=i-j+1\r\n\t\ta1=j\r\n\t\ta2=i\t\r\nprint(ans)\r\nfor i in range(n):\r\n\tif i>=a1 and i<=a2:\r\n\t\tprint(1)\r\n\telse:\r\n\t\tprint(arr[i])", "n, k = map(int, input().strip().split())\r\na = list(map(int, input().strip().split()))\r\n\r\ncount_0 = 0\r\nans = 0\r\nj = 0\r\nl = -1\r\nr = -1\r\nfor i in range(n):\r\n if a[i] == 0:\r\n count_0 += 1\r\n while count_0 > k:\r\n if a[j] == 0:\r\n count_0 -= 1\r\n j = j + 1\r\n if ans < i-j+1:\r\n ans = i-j+1\r\n l = j\r\n r = i\r\nif l != -1 and r != -1:\r\n for i in range(l, r+1):\r\n a[i] = 1\r\n\r\nprint(ans)\r\nfor i in a:\r\n print(i, end=\" \")\r\n", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nmax_len = 0\nmax_start = 0\nzero_count = 0\n\nstart = 0\nend = 0\n\nwhile end < n:\n if arr[end] == 0:\n zero_count += 1\n \n while zero_count > k:\n if arr[start] == 0:\n zero_count -= 1\n start += 1\n \n if end - start + 1 > max_len:\n max_len = end - start + 1\n max_start = start\n\n end += 1\n\nfor i in range(max_start, max_start + max_len):\n arr[i] = 1\n\nprint(max_len)\nprint(*arr)\n\t \t \t\t\t\t\t \t \t \t\t \t \t\t \t\t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nleft = 0\nmax_len = 0\nmax_left = 0 # Store the left boundary of the subsegment with maximum length\nzero_count = 0\n\nfor right in range(n):\n if a[right] == 0:\n zero_count += 1\n\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n\n# Convert the allowed zeroes to ones in the subsegment\nfor i in range(max_left, max_left + max_len):\n if a[i] == 0 and k > 0:\n a[i] = 1\n k -= 1\n\nprint(max_len)\nprint(*a)\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())\na = list(map(int, input().split()))\n\nl = 0\nr = 0\nmax_size = 0\nzero_count = 0\nmax_l = 0\n\nwhile r < n:\n if a[r] == 0:\n zero_count += 1\n while zero_count > k:\n if a[l] == 0:\n zero_count -= 1\n l += 1\n if r - l + 1 > max_size:\n max_size = r - l + 1\n max_l = l\n r += 1\n\nfor i in range(max_l, max_l + max_size):\n a[i] = 1\n\nprint(max_size)\nprint(' '.join(map(str, a)))\n\n \t\t \t \t \t\t \t\t\t \t\t\t\t \t", "n,k = map(int,input().split())\r\n\r\narr = list(map(int,input().split()))\r\n# if n == 1:\r\n# \tx =(1 if (arr[0] or k>=1) else 0)\r\n# \tprint(x)\r\n# \tprint(x)\r\n# else:\r\nans= 0 \r\nstart = 0\r\nend = 0\r\nciunt0 = 0\r\na1,b1 = float(\"-inf\"),float(\"inf\")\r\nwhile start<n:\r\n\tif arr[start] == 0:ciunt0+=1\r\n\twhile ciunt0>k:\r\n\t\tif arr[end] == 0:\r\n\t\t\tciunt0-=1\r\n\t\tend+=1\r\n\tif start-end+1>ans:\r\n\t\tb1 = start\r\n\t\ta1 = end\r\n\t\tans= max(ans,start-end+1)\r\n\tstart+=1\r\nif a1 !=float(\"-inf\"):\r\n\tfor x in range(a1,b1+1):\r\n\t\tarr[x] = 1\r\nprint(ans)\r\nprint(*arr)", "n, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\n\r\nl = 0\r\nr = 0\r\nans = 0\r\nans_pr = [0, 0]\r\nct = 0\r\n\r\nwhile l < n:\r\n while r < n and (a[r] or ct < k):\r\n ct += not a[r]\r\n r += 1\r\n\r\n if r-l > ans:\r\n ans = r-l\r\n ans_pr = [l, r]\r\n\r\n ct -= not a[l]\r\n l += 1\r\n\r\nprint(ans)\r\nprint(*a[:ans_pr[0]] + [1]*ans + a[ans_pr[1]:])\r\n", "def max_consecutive_ones(n, k, a):\n left = 0 # Left pointer of the sliding window\n max_ones = 0 # Maximum number of ones in a subsegment\n max_left = 0 # Left boundary of the subsegment\n zero_count = 0 # Count of zeroes in the current subsegment\n\n for right in range(n):\n if a[right] == 0:\n zero_count += 1\n\n # If the count of zeroes in the current subsegment exceeds k, move the left pointer\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n\n # Update the maximum length of the subsegment\n if right - left + 1 > max_ones:\n max_ones = right - left + 1\n max_left = left\n\n # Modify the array based on the subsegment with maximum ones\n for i in range(max_left, max_left + max_ones):\n a[i] = 1\n\n return max_ones, a\n\n# Input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nresult, modified_array = max_consecutive_ones(n, k, a)\nprint(result)\nprint(*modified_array)\n\n \t \t\t\t \t\t\t\t \t \t \t \t \t \t", "def maximize_subsegment(a, r, arr):\r\n left = 0\r\n max_len = 0\r\n max_left = 0\r\n zeros_count = 0\r\n \r\n for right in range(a):\r\n if arr[right] == 0:\r\n zeros_count += 1\r\n \r\n while zeros_count > r:\r\n if arr[left] == 0:\r\n zeros_count -= 1\r\n left += 1\r\n \r\n if right - left + 1 > max_len:\r\n max_len = right - left + 1\r\n max_left = left\r\n \r\n for i in range(max_left, max_left + max_len):\r\n arr[i] = 1\r\n \r\n return max_len, arr\r\na, r = map(int, input().split())\r\narr = list(map(int, input().split()))\r\n\r\nresult_len, result_arr = maximize_subsegment(a, r, arr)\r\nprint(result_len)\r\nprint(*result_arr)\r\n\r\n\t\t\t \t \t\t\t \t \t\t \t\t \t\t\t\t\t \t\t", "from sys import stdin,stdout\r\nnmbr = lambda: int(stdin.readline())\r\nlst = lambda: list(map(int, stdin.readline().split()))\r\nPI=float('inf')\r\ndef fn(wl,st):\r\n l=0;r=wl-1\r\n mn=PI;p1=p2=-1\r\n while r<n:\r\n zeros=ps[r]-(ps[l-1] if l>=1 else 0)\r\n if zeros<=k and zeros<mn:\r\n mn=zeros\r\n p1,p2=l,r\r\n l+=1\r\n r+=1\r\n if mn==PI:return False\r\n if st:\r\n for i in range(p1,p2+1):\r\n a[i]=1\r\n return True\r\nfor _ in range(1):#nmbr()):\r\n n,k=lst()\r\n ps=[0]*n\r\n a=lst()\r\n for i in range(n):\r\n if a[i]==0:ps[i]=ps[max(0,i-1)]+1\r\n else:ps[i]=ps[max(0,i-1)]\r\n l=1;r=n+1\r\n while l<=r:\r\n mid=(l+r)>>1\r\n if fn(mid,0):l=mid+1\r\n else:r=mid-1\r\n print(r)\r\n fn(r,1)\r\n print(*a)", "import sys\n\nn,k = map(int,input().split())\n\na = list(map(int,sys.stdin.readline().split()))\n\nl=0\nr=0\n\nzeroCount=0\n\nans = 0\nimax = 0\n\nfor i in range(n):\n\n if a[i]==1:\n r+=1\n else:\n if zeroCount==k:\n while a[l]!=0:\n l+=1\n l+=1\n r+=1\n else:\n zeroCount+=1\n r+=1\n\n if r-l > ans:\n ans = r-l\n imax = r\n\nfor i in range(imax-ans,imax):\n a[i]=1\n\nprint(ans)\nprint(*a)\n\n", "harshan, harshak = map(int, input().split(\" \"))\na_list = list(map(int, input().split(\" \")))\ndef print_list(my_list):\n for i in range(len(my_list)):\n print(my_list[i], end=\" \")\nharshaleft = 0\nharshacount = 0\nharshaans = 0\nans_left = 0\nans_right = 0\nfor i in range(harshan):\n if a_list[i] == 0:\n harshacount += 1\n while harshacount > harshak:\n if a_list[harshaleft] == 0:\n harshacount -= 1\n harshaleft += 1\n if harshaans < i - harshaleft + 1:\n harshaans = i - harshaleft + 1\n ans_left = harshaleft\n ans_right = i\nprint(harshaans)\nif harshaans == 0:\n print_list(a_list)\nelse:\n print_list(a_list[:ans_left]+[1]*(harshaans)+a_list[ans_right+1:])\n \t\t \t \t\t \t\t \t\t \t\t\t \t \t \t \t\t", "def maximize_consecutive_ones(n, k, elements):\n left, right = 0, 0 # Initialize left and right pointers for the sliding window\n max_length = 0 # Initialize the maximum length of consecutive ones\n max_left = 0 # Initialize the left boundary of the window with the maximum length\n zero_count = 0 # Initialize the count of zeros within the window\n\n while right < n:\n # Expand the window by moving the right pointer to the right\n if elements[right] == 0:\n zero_count += 1\n \n # Adjust the window size by moving the left pointer to maintain k changes of zeroes to ones\n while zero_count > k:\n if elements[left] == 0:\n zero_count -= 1\n left += 1\n \n # Update the maximum length and the left boundary of the window if necessary\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n # Move the right pointer to the next element\n right += 1\n\n # Change zeros to ones within the identified window\n for i in range(max_left, max_left + max_length):\n elements[i] = 1\n\n return max_length, elements\n\n# Read input\nn, k = map(int, input().split())\nelements = list(map(int, input().split()))\n\n# Calculate the maximal value of f(a) and update the array a\nmax_length, updated_elements = maximize_consecutive_ones(n, k, elements)\n\n# Print the results\nprint(max_length)\nprint(*updated_elements)\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())\na = list(map(int, input().split()))\n\nmaxLen = 0\nmaxStart = 0\nzeroCount = 0\nstart = 0\n\nfor end in range(n):\n if a[end] == 0:\n zeroCount += 1\n\n while zeroCount > k:\n if a[start] == 0:\n zeroCount -= 1\n start += 1\n\n currentLen = end - start + 1\n\n if currentLen > maxLen:\n maxLen = currentLen\n maxStart = start\n\nprint(maxLen)\n\nfor i in range(maxStart, maxStart + maxLen):\n a[i] = 1\n\nprint(*a)\n\t \t\t\t \t\t\t \t\t \t\t\t \t\t\t \t", "ln,ch=map(int,input().split())\r\narray = list(map(int,input().split()))\r\npref = [0]*(ln)\r\nfor i in range(ln):\r\n pref[i]=pref[i-1]+array[i]\r\ndef valid(r,ln):\r\n for i in range(ln):\r\n if r+i==ln+1:\r\n break\r\n if i==0:\r\n sm = pref[r-1]\r\n else:\r\n sm = pref[r+i-1]-pref[i-1]\r\n if (r-sm<=ch):\r\n return i+1\r\n else:\r\n return 0\r\nlst = []\r\nl,r=0,ln\r\nposs = 0\r\nwhile l<=r:\r\n mid = (l+r)//2\r\n z = valid(mid,ln)\r\n if z:\r\n l = mid+1\r\n poss = mid\r\n el=z-1\r\n else:\r\n r = mid-1\r\nprint(poss)\r\nfor i in range(ln):\r\n if el<=i<poss+el:\r\n lst.append(1)\r\n else:\r\n lst.append(array[i])\r\nprint(*lst)", "import sys\r\nimport inspect\r\nimport re\r\nimport math\r\nfrom pprint import pprint as pp\r\nmod = 998244353\r\nMAX = 10**15\r\n\r\n\r\ndef deb(p):\r\n for line in inspect.getframeinfo(inspect.currentframe().f_back)[3]:\r\n m = re.search(r'\\bdeb\\s*\\(\\s*([A-Za-z_][A-Za-z0-9_]*)\\s*\\)', line)\r\n print('%s %d' % (m.group(1), p))\r\n\r\n\r\ndef main():\r\n n, k = map(int, input().split())\r\n a = list(map(int, input().split()))\r\n m, z, v, e = 0, 0, 0, 0\r\n for i in range(n):\r\n if a[i] == 0:\r\n z += 1\r\n if z <= k:\r\n m += 1\r\n e = i\r\n else:\r\n if a[v] == 0:\r\n z -= 1\r\n v += 1\r\n print(m)\r\n for i in range(e - m + 1, e + 1):\r\n a[i] = 1\r\n print(' '.join(map(str, a)))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\ncnt = 0\nmx_lan = 0\npos = 0\nl = 0\n\nfor i in range(n):\n if a[i] == 0:\n cnt += 1\n while cnt > k:\n if a[l] == 0:\n cnt -= 1\n l += 1\n if (i - l + 1) > mx_lan:\n mx_lan = i - l + 1\n pos = i\n\nprint(mx_lan)\n\nwhile pos >= 0 and mx_lan > 0:\n if a[pos] == 0:\n a[pos] = 1\n pos -= 1\n mx_lan -= 1\n\nprint(*a)\n\n \t\t \t \t \t\t\t\t \t\t \t \t \t", "def maximize_ones(n, k, a):\n left = 0 # Left endpoint of the window\n max_len = 0 # Length of the longest subsegment of ones\n max_left = 0 # Left endpoint of the window for the longest subsegment\n zero_count = 0 # Count of zeroes within the window\n\n for right in range(n):\n if a[right] == 0:\n zero_count += 1\n\n # If the number of zeroes within the window exceeds k, move the left endpoint\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n\n # Update the longest subsegment of ones\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n\n # Convert at most k zeroes within the longest subsegment to ones\n for i in range(max_left, max_left + max_len):\n a[i] = 1\n\n return max_len, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Calculate and print the result\nresult_len, result_array = maximize_ones(n, k, a)\nprint(result_len)\nprint(*result_array)\n\n\t\t\t\t\t \t \t \t \t \t\t \t\t\t \t", "def maximize_subsegment(n, k, a):\n left, right = 0, 0\n max_length = 0\n zero_count = 0\n max_zero_count = 0\n max_zero_left = 0\n\n while right < n:\n if a[right] == 0:\n zero_count += 1\n\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n\n current_length = right - left + 1\n\n if current_length > max_length:\n max_length = current_length\n max_zero_count = zero_count\n max_zero_left = left\n\n right += 1\n\n for i in range(max_zero_left, max_zero_left + max_length):\n a[i] = 1\n\n return max_length, a\n\n\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nresult_length, result_array = maximize_subsegment(n, k, a)\nprint(result_length)\nprint(*result_array)\n\n \t\t\t \t\t \t\t \t \t \t \t \t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Mon Dec 13 17:09:46 2021\r\n\r\n@author: Lai Phuc\r\n\"\"\"\r\nn, k = map(int, input().split(\" \"))\r\na_list = list(map(int, input().split(\" \")))\r\ndef print_list(my_list):\r\n for i in range(len(my_list)):\r\n print(my_list[i], end=\" \")\r\nleft = 0\r\ncount = 0\r\nans = 0\r\nans_left = 0\r\nans_right = 0\r\nfor i in range(n):\r\n if a_list[i] == 0:\r\n count += 1\r\n while count > k:\r\n if a_list[left] == 0:\r\n count -= 1\r\n left += 1\r\n if ans < i - left + 1:\r\n ans = i - left + 1\r\n ans_left = left\r\n ans_right = i\r\nprint(ans)\r\nif ans == 0:\r\n print_list(a_list)\r\nelse:\r\n print_list(a_list[:ans_left]+[1]*(ans)+a_list[ans_right+1:])\r\n", "def hard(arr, k):\n left = 0\n zeros = 0\n max_length = 0\n max_left = 0\n for r in range(len(arr)):\n if arr[r] == 0:\n zeros += 1\n while zeros > k :\n if arr[left] == 0:\n zeros -= 1\n left += 1\n \n if (r - left + 1) > max_length:\n max_length = r - left + 1\n max_left = left\n for i in range(max_left ,max_left + max_length):\n arr[i] = 1\n return max_length\n\nn,k = map(int,input().split())\narr = list(map(int,input().split()))\nprint(hard(arr,k))\nprint(*arr)\n\n\n\t\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())\n\narr = list(map(int, input().split()))\n\nmx = 0\nmx_l = 0\nmx_r = 0\n\nz_c = 0\nl = 0\nfor r in range(n):\n if arr[r] == 0:\n z_c += 1\n #print('k=', k, 'sum=', s, 'left=', l, 'right=', r)\n while z_c > k:\n if arr[l] == 0:\n z_c -= 1\n l += 1\n\n if mx <= r - l + 1:\n mx = max(mx, r - l + 1)\n mx_r = r\n mx_l = l\n #print('max=', mx, 'left=', mx_l, 'right=', mx_r)\n\n\nprint(mx)\nif mx != 0:\n i = mx_l\n while i <= mx_r:\n arr[i] = 1\n i += 1\nprint(*arr)\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\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 c1 = m\r\n else:\r\n c2 = m\r\n ans = check(m)\r\n return ans\r\n\r\ndef ok(m):\r\n for i in range(n - m + 1):\r\n if m - b[i + m] + b[i] <= k:\r\n return True\r\n return False\r\n\r\ndef check(m):\r\n for i in range(max(0, m - 3), min(n + 1, m + 4)):\r\n if not ok(i):\r\n return i - 1\r\n return n\r\n\r\nn, k = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = [0]\r\nfor i in a:\r\n b.append(i + b[-1])\r\nans = binary_search(0, n + 1)\r\nprint(ans)\r\nfor i in range(n - ans + 1):\r\n if ans - b[i + ans] + b[i] <= k:\r\n for j in range(i, i + ans):\r\n a[j] = 1\r\n break\r\nprint(*a)", "n, k = map(int, input().split())\narr = list(map(int, input().split()))\nmax_len = 0\nmax_len_start = 0\nzero_count = 0\nstart = 0\nfor end in range(n):\n if arr[end] == 0:\n zero_count += 1\n while zero_count > k:\n if arr[start] == 0:\n zero_count -= 1\n start += 1\n if end - start + 1 > max_len:\n max_len = end - start + 1\n max_len_start = start\nfor i in range(max_len_start, max_len_start + max_len):\n arr[i] = 1\nprint(max_len)\nprint(*arr)\n \t \t \t\t \t\t \t\t \t", "def maximize_subsegment(n, k, a):\n left = 0\n right = 0\n max_length = 0\n max_left = 0\n\n while right < n:\n if a[right] == 0:\n k -= 1\n \n while k < 0:\n if a[left] == 0:\n k += 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n right += 1\n\n for i in range(max_left, max_left + max_length):\n a[i] = 1\n\n return max_length, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Calculate and print the result\nlength, modified_a = maximize_subsegment(n, k, a)\nprint(length)\nprint(*modified_a)\n\n \t \t\t \t\t\t \t \t\t\t\t \t \t", "def my_660C():\n ans = -1\n left = -1\n right = -1\n n_k = input().split(' ')\n n = int(n_k[0])\n k = int(n_k[1])\n original_list = list(map(lambda x: int(x), input().split(' ')))\n zeros = [-1]\n for i in range(n):\n if original_list[i] == 0:\n zeros += [i]\n zeros += [n]\n if len(zeros) - 2 <= k:\n ans = n\n else:\n for i in range(len(zeros) - k - 1):\n if zeros[i + k + 1] - zeros[i] - 1 > ans:\n ans = zeros[i + k + 1] - zeros[i] - 1\n left = zeros[i] + 1\n right = zeros[i + k + 1] - 1\n print(ans)\n for i in range(n):\n if ans == n:\n if i == n - 1:\n print('1', end='')\n else:\n print('1', end=' ')\n else:\n if i == n - 1:\n if i >= left and i <= right:\n print('1', end='')\n else:\n print(original_list[i], end='')\n else:\n if i >= left and i <= right:\n print('1', end=' ')\n else:\n print(original_list[i], end=' ')\n\nif __name__ == \"__main__\":\n my_660C()\n ", "def maximize_consecutive_ones(n, k, a):\n left = 0 # Left pointer of the sliding window\n max_length = 0 # Length of the longest subsegment of ones\n max_left = 0 # Left index of the longest subsegment\n zero_count = 0 # Count of zeros inside the current window\n\n for right in range(n):\n if a[right] == 0:\n zero_count += 1\n\n # If the number of zeros in the window exceeds 'k', move the left pointer\n while zero_count > k:\n if a[left] == 0:\n zero_count -= 1\n left += 1\n\n # Update the longest subsegment information\n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n\n # Convert 'k' zeros within the longest subsegment to ones\n for i in range(max_left, max_left + max_length):\n a[i] = 1\n\n return max_length, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\nmax_length, modified_array = maximize_consecutive_ones(n, k, a)\nprint(max_length)\nprint(*modified_array)\n\n\t\t \t \t \t \t \t\t\t \t\t\t\t\t\t \t", "def maximize_subsegment(n, k, a):\n left = 0\n right = 0\n max_len = 0\n max_len_index = 0\n num_zeroes = 0\n\n while right < n:\n if a[right] == 0:\n num_zeroes += 1\n\n while num_zeroes > k:\n if a[left] == 0:\n num_zeroes -= 1\n left += 1\n\n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_len_index = left\n\n right += 1\n\n for i in range(max_len_index, max_len_index + max_len):\n a[i] = 1\n\n return max_len, a\n\n# Read input\nn, k = map(int, input().split())\na = list(map(int, input().split()))\n\n# Calculate and print the result\nresult_length, result_array = maximize_subsegment(n, k, a)\nprint(result_length)\nprint(\" \".join(map(str, result_array)))\n\n\t \t\t \t \t \t\t\t\t \t\t \t \t \t", "n,k=map(int,input().split())\nara=list(map(int,input().split()))\nmax=0\nzero=0\nvalue=0\nend=0\nfor i in range(0,n):\n if ara[i]==0:\n zero+=1\n if zero<=k:\n max+=1\n end=i\n else:\n if ara[value]==0 :\n zero-= 1\n value+= 1\nprint(max)\nfor i in range(end-max+1,end+1):\n ara[i]=1\nprint(\" \".join(map(str,ara)))\n\t\t \t\t\t\t \t \t \t \t \t \t \t \t", "import sys\r\n\r\nn, k = map(int, sys.stdin.buffer.readline().split())\r\na = [0] + list(map(int, sys.stdin.buffer.readline().split()))\r\nzero = [0]*(n+1)\r\nfor i in range(1, n+1):\r\n zero[i] = zero[i-1] + (1 if a[i] == 0 else 0)\r\n\r\n\r\ndef solve(x):\r\n for i in range(x, n+1):\r\n if zero[i] - zero[i-x] <= k:\r\n return i\r\n return -1\r\n\r\n\r\nok, ng = 0, n+1\r\nwhile abs(ok - ng) > 1:\r\n mid = (ok + ng) >> 1\r\n if solve(mid) != -1:\r\n ok = mid\r\n else:\r\n ng = mid\r\n\r\nr = solve(ok)\r\na[r-ok+1:r+1] = [1]*ok\r\nsys.stdout.buffer.write(\r\n (str(ok) + '\\n' + ' '.join(map(str, a[1:]))).encode('utf-8'))\r\n", "n,k=map(int,input().split())\nli=list(map(int,input().strip().split()))\nans,l,cnt=0,-1,0\nfor r in range(n):\n\tif li[r]==0:cnt+=1\n\twhile cnt>k:\n\t\tif li[l+1]==0:cnt-=1\n\t\tl+=1\n\tans=max(ans,r-l)\n\tif ans==r-l:\n\t\tx=l+1\n\t\ty=r\nprint(ans)\nfor i in range(n):\n\tif i>=x and i<=y:\n\t\tprint(1,end=\" \")\n\telse:\n\t\tprint(li[i],end=\" \")\nprint()\n \t\t \t \t \t\t \t\t \t\t\t \t", "n,k=map(int,input().split())\na=list(map(int,input().split()))\nc=0\nans=-1000000000\nstart=0\nss=0\nse=0\nfor end in range(0,n):\n if(a[end]==0):\n c+=1\n while(c>k):\n c+=a[start]-1\n start+=1\n if(end-start+1>ans):\n ans=end-start+1\n ss=start\n se=end\nprint(ans)\nfor i in range(ss,se+1):\n\tif(a[i]==0):\n\t\ta[i]=1\nprint(*a)\n\n \t \t \t \t \t \t \t\t\t\t\t \t \t \t \t", "n, k = map(int, input().split())\na = list(map(int, input().split()))\n\nleft = right = 0\nmaxLen = 0\nmaxLeft = 0\nzerosCount = 0\n\nfor right in range(n):\n if a[right] == 0:\n zerosCount += 1\n while zerosCount > k:\n if a[left] == 0:\n zerosCount -= 1\n left += 1\n if right - left + 1 > maxLen:\n maxLen = right - left + 1\n maxLeft = left\n\nfor i in range(maxLeft, maxLeft + maxLen):\n a[i] = 1\n\nprint(maxLen)\nprint(*a)\n \t\t\t\t\t\t \t \t\t\t \t\t\t\t \t\t\t", "def maximize_subsegment(n, k, arr):\n left = 0 # Left pointer of the window\n max_length = 0 # Maximum length of subsegment\n max_left = 0 # Left index of the maximum subsegment\n ones_count = 0 # Count of ones in the current window\n \n for right in range(n):\n if arr[right] == 0:\n k -= 1\n \n while k < 0:\n if arr[left] == 0:\n k += 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_left = left\n \n if arr[right] == 1:\n ones_count += 1\n \n for i in range(max_left, max_left + max_length):\n arr[i] = 1\n \n return max_length, arr\n\n# Read input\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\n# Calculate the maximal value of f(a) and the modified array\nmax_length, modified_arr = maximize_subsegment(n, k, arr)\n\n# Print the results\nprint(max_length)\nprint(*modified_arr)\n\n\t \t \t \t\t \t \t \t \t \t \t \t", "def maximize_subsegment(n, k, arr):\n left = 0\n max_len = 0\n max_left = 0\n zeros_count = 0\n \n for right in range(n):\n if arr[right] == 0:\n zeros_count += 1\n \n while zeros_count > k:\n if arr[left] == 0:\n zeros_count -= 1\n left += 1\n \n if right - left + 1 > max_len:\n max_len = right - left + 1\n max_left = left\n \n for i in range(max_left, max_left + max_len):\n arr[i] = 1\n \n return max_len, arr\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\nresult_len, result_arr = maximize_subsegment(n, k, arr)\nprint(result_len)\nprint(*result_arr)\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())\na = list(map(int, input().split()))\nl, r = 0, 0\nans_idx, ans_len = 0, 0\nzeros = 0\nwhile r < n:\n # slide window\n if r < n:\n zeros += a[r] == 0\n r += 1\n if zeros > k:\n zeros -= a[l] == 0\n l += 1\n\n if r - l > ans_len:\n ans_len = r - l\n ans_idx = l\n\nprint(ans_len)\nzeros = 0\nfor i in range(n):\n if i < ans_idx:\n print(a[i], end=' ')\n elif i >= ans_idx and zeros < k:\n zeros += a[i] == 0\n print(1, end=' ')\n else:\n print(a[i], end=' ')\n", "a, k = [int(i) for i in input().split()]\narr = [int(i) for i in input().split()]\n\nzeros = 0\nleft = 0\nright = 0\nconsec = 0\nbest = 0\nswitch = []\nbest_coords = (0, 0)\nif k == 0:\n\tfor i in range(len(arr)):\n\t\tif arr[i] == 1:\n\t\t\tconsec += 1\n\t\t\tif consec > best:\n\t\t\t\tbest = consec\n\t\telse:\n\t\t\tconsec = 0\nelse:\n\twhile right < len(arr):\n\t\tif arr[right] == 0 and zeros + 1 > k:\n\t\t\twhile arr[left] == 1:\n\t\t\t\tleft += 1\n\t\t\t\tconsec -= 1\n\t\t\tzeros -= 1\n\t\t\tleft += 1\n\t\t\tconsec -= 1\n\t\telse:\n\t\t\tif arr[right] == 0:\n\t\t\t\tzeros += 1\n\t\t\tconsec += 1\n\t\t\tright += 1\n\t\t\tif consec > best:\n\t\t\t\tbest = consec\n\t\t\t\tbest_coords = left, right\n\nprint(best)\nans = ''\nfor i in range(len(arr)):\n\tif best_coords[0] <= i < best_coords[1]:\n\t\tans += '1 '\n\telse:\n\t\tans += str(arr[i]) + ' '\nprint(ans)", "def maximize_subsegment(n, k, arr):\n max_length = 0\n max_start = 0\n left = 0\n zeros_count = 0\n \n for right in range(n):\n if arr[right] == 0:\n zeros_count += 1\n \n while zeros_count > k:\n if arr[left] == 0:\n zeros_count -= 1\n left += 1\n \n if right - left + 1 > max_length:\n max_length = right - left + 1\n max_start = left\n \n for i in range(max_start, max_start + max_length):\n arr[i] = 1\n \n return max_length, arr\n\n# Read input\nn, k = map(int, input().split())\narr = list(map(int, input().split()))\n\n# Calculate and print the result\nresult_length, result_arr = maximize_subsegment(n, k, arr)\nprint(result_length)\nprint(*result_arr)\n\n\n\t\t \t \t\t\t \t\t \t \t \t \t\t \t \t \t", "n,k=map(int,input().split())\na=list(map(int,input().split()))\n\ni=0\nj=0\ncountzero=0\nss=0\nee=0\naa=0\n\nwhile i<n:\n while countzero<=k and i<n:\n if a[i]==0:\n countzero+=1\n i+=1\n\n if (i-j+1)>aa and countzero<=k:\n ss=i\n ee=j\n aa=(i-j)\n \n while countzero>k:\n if a[j]==0:\n countzero-=1\n j+=1\n # print(i,j,\"second loop\",countzero)\n \n if (i-j+1)>aa and countzero<=k:\n ss=i\n ee=j\n aa=(i-j)\n \n \n# print(ee,ss)\nprint(aa)\nfor k in range(ee,ss):\n a[k]=1\nprint(*a)\n \t\t\t\t \t\t \t\t\t \t \t \t" ]

[ "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nbest = worst = numbers[0]\r\namazing = 0\r\n\r\nfor current in numbers[1:]:\r\n if current < worst:\r\n worst = current\r\n amazing += 1\r\n if current > best:\r\n best = current\r\n amazing += 1\r\n\r\nprint(amazing)", "n = int(input())\r\nm = list(map(int, input().split()))\r\nhitler = 0\r\nmaxx = m[0]\r\nminn = m[0]\r\nfor i in range(1, n):\r\n if m[i] > maxx:\r\n maxx = m[i]\r\n hitler += 1\r\n elif m[i] < minn:\r\n minn = m[i]\r\n hitler += 1\r\nprint(hitler)\r\n", "n = int(input())\r\n\r\npoints = list(map(int, input().split()))\r\n\r\n\r\n\r\namazing = 0\r\n\r\nminimum = points[0]\r\n\r\nmaximum = points[0]\r\n\r\n\r\n\r\nfor i in range(1, n):\r\n\r\n if points[i] > minimum and points[i] > maximum:\r\n\r\n amazing += 1\r\n\r\n maximum = points[i]\r\n\r\n elif points[i] < minimum:\r\n\r\n amazing += 1\r\n\r\n minimum = points[i]\r\n\r\n\r\n\r\nprint(amazing)", "\r\nt = int(input())\r\narr = list(map(int, input().split()))\r\nmin_ = arr[0]\r\ncount_ = 0\r\nmax_ = arr[0]\r\nfor i in range(0, t):\r\n if arr[i] > max_:\r\n count_ += 1\r\n max_ = arr[i]\r\n elif arr[i] < min_:\r\n min_ = arr[i]\r\n count_ += 1\r\n elif min_ <= arr[i] <= max_:\r\n continue\r\nprint(count_)", "n = int(input())\r\nA = list(map(int,input().strip().split()))\r\n\r\nma = mi = A[0]\r\n\r\nc = 0\r\nfor i in A:\r\n c += (i > ma or i < mi)\r\n ma,mi = max(ma,i),min(mi,i)\r\n\r\nprint(c)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nworst, best, am= l[0], l[0], 0\r\nfor c in l:\r\n if c > best:\r\n best = c; am += 1\r\n elif c < worst:\r\n worst = c; am += 1\r\nprint(am)\r\n", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\nbest_performance = points[0]\r\nworst_performance = points[0]\r\namazing_performances = 0\r\n\r\nfor i in range(1, n):\r\n if points[i] > best_performance:\r\n best_performance = points[i]\r\n amazing_performances += 1\r\n elif points[i] < worst_performance:\r\n worst_performance = points[i]\r\n amazing_performances += 1\r\n\r\nprint(amazing_performances)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nl = a[0]\r\nb = a[0]\r\nc = 0\r\nfor i in range(1,n):\r\n if(a[i] > b):\r\n c = c + 1\r\n b = a[i]\r\n if(a[i] < l):\r\n c = c + 1\r\n l = a[i]\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmi,ma=l[0],l[0]\r\nc=0\r\nfor i in range(1,n):\r\n if mi>l[i]:\r\n mi=l[i]\r\n c+=1\r\n elif ma<l[i]:\r\n ma=l[i]\r\n c+=1\r\nprint(c)\r\n", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nmini=maxi=a[0]\r\nans=0\r\nfor i in range(1,n):\r\n if a[i]<mini:\r\n mini=a[i]\r\n ans+=1 \r\n if a[i]>maxi:\r\n maxi=a[i]\r\n ans+=1 \r\nprint(ans)", "\r\nn = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\n\r\namazing_count = 0\r\nbest_score = worst_score = points[0]\r\n\r\n\r\nfor j in range(1, n):\r\n if points[j] > best_score:\r\n amazing_count += 1\r\n best_score = points[j]\r\n elif points[j] < worst_score:\r\n amazing_count += 1\r\n worst_score = points[j]\r\n\r\nprint(amazing_count)\r\n", "def amazing_performances(points):\r\n n = len(points)\r\n if n <= 1:\r\n return 0\r\n\r\n best = worst = points[0]\r\n amazing_count = 0\r\n\r\n for i in range(1, n):\r\n if points[i] > best:\r\n best = points[i]\r\n amazing_count += 1\r\n elif points[i] < worst:\r\n worst = points[i]\r\n amazing_count += 1\r\n\r\n return amazing_count\r\n\r\n# Example usage:\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n points = list(map(int, input().split()))\r\n print(amazing_performances(points))\r\n", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nlow = l[0]\r\nhigh = l[0]\r\ncnt = 0\r\nfor i in range(1,n):\r\n if l[i] < low:\r\n cnt += 1\r\n low = l[i]\r\n if l[i] > high:\r\n cnt += 1\r\n high = l[i]\r\nprint(cnt)", "n=int(input())\r\np=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n):\r\n h=0\r\n l=0\r\n for a in range(0,i):\r\n if p[i]>p[a]:\r\n h=h+1\r\n elif p[i]<p[a]:\r\n l+=1\r\n if h==i or l==i:\r\n c=c+1\r\nprint(c)\r\n ", "number = int(input()) \r\nl = list(map(int,input().split(\" \"))) \r\nmaximum = l[0] \r\nminimum = l[0] \r\nc = 0 \r\nfor i in l : \r\n if i > maximum:\r\n c+=1\r\n maximum = i\r\n elif i < minimum: \r\n c+=1 \r\n minimum = i\r\n else : \r\n continue \r\nprint(c)\r\n", "z=int(input())\r\nsow=input()\r\nk=list(map(int, sow.split()))\r\ncool=[]\r\ncool.append(k[0])\r\nex=0\r\nfor i in range(1,len(k)):\r\n b=k[i]\r\n c=max(cool)\r\n c2=min(cool)\r\n if b>c or b<c2:\r\n ex=ex+1\r\n cool.append(k[i])\r\nprint(ex)\r\n ", "n= int(input())\r\npoints = input().split()\r\nmaxpoint = int(points[0])\r\nminpoint = int(points[0])\r\ncount = 0\r\nfor i in points:\r\n if int(i) > maxpoint:\r\n count +=1\r\n maxpoint = int(i)\r\n elif int(i) < minpoint:\r\n count +=1\r\n minpoint = int(i)\r\nprint(count)\r\n ", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nans = 0\r\nh = 0\r\nl = 0\r\nfor i in range(len(s)):\r\n if i == 0:\r\n l = s[i]\r\n h = s[i]\r\n pass\r\n else:\r\n if s[i] > h:\r\n h = s[i]\r\n ans += 1\r\n if s[i] < l:\r\n l = s[i]\r\n ans += 1\r\n \r\nprint(ans)\r\n ", "t = int(input())\r\nr = [int(i) for i in input().split()]\r\nminr = r[0]\r\nmaxr = r[0]\r\nres = 0\r\nfor i in r[1::]:\r\n if i > maxr:\r\n res += 1\r\n maxr = i\r\n elif i < minr:\r\n res += 1\r\n minr = i\r\nprint(res)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmaxi=l[0]\r\nmini=l[0]\r\nc=0\r\nfor i in range(1,n):\r\n if l[i]>maxi:\r\n c+=1\r\n maxi=l[i]\r\n elif l[i]<mini:\r\n c+=1\r\n mini=l[i]\r\nprint(c) \r\n ", "n=int(input())\r\nx=list(map(int,input().split(\" \")))\r\na=x[0]\r\nb=x[0]\r\ncount=0\r\nfor i in range(1,len(x)):\r\n if x[i]>a:\r\n a=x[i]\r\n count+=1\r\n elif x[i]<b:\r\n b=x[i]\r\n count+=1\r\nprint(count)", "n=input()\r\nl=[int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(1,len(l)):\r\n if (max(l[:i+1])==l[i] or min(l[:i+1])==l[i]) and l[i] not in l[:i]:\r\n count+=1\r\nprint(count)", "t=int(input())\r\nn=list(map(int,input().split()))\r\na=n[0]\r\nb=n[0]\r\ncount=0\r\ni=1\r\nwhile i<len(n):\r\n if (n[i]>a):\r\n count+=1\r\n a=n[i]\r\n elif(n[i]<b):\r\n count+=1\r\n b=n[i]\r\n i+=1\r\nprint(count)\r\n \r\n", "\r\nn = int(input())\r\nscores = list(map(int,input().split()))\r\nif n==1: print(0)\r\nelse:\r\n amaz=0\r\n for i in range(1,n):\r\n if min(scores[:i]) > scores[i] or max(scores[:i]) < scores[i]:\r\n amaz+=1\r\n print(amaz)\r\n", "def main():\n _ = input()\n scores = list(int(_) for _ in input().split())\n amazings = 0\n worst = best = scores[0]\n\n for score in scores:\n if score < worst:\n amazings += 1\n worst = score\n elif score > best:\n amazings += 1\n best = score\n\n print(amazings)\n\n\nif __name__ == \"__main__\":\n main()\n", "x = int(input())\r\narr = list(map(int, input().split()))\r\nmini = arr[0]\r\nmaxi = arr[0]\r\ncount = 0\r\nfor i in range(1,x):\r\n if arr[i] > maxi:\r\n count += 1\r\n maxi = arr[i]\r\n elif arr[i] < mini:\r\n count += 1\r\n mini = arr[i]\r\nprint(count)\r\n \r\n \r\n ", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmax = min = arr[0]\r\nans = 0\r\nfor i in range(1, len(arr)):\r\n if arr[i] < min:\r\n ans += 1\r\n min = arr[i]\r\n if arr[i] > max:\r\n ans += 1\r\n max = arr[i]\r\nprint(ans)", "n = int(input())\r\nratings = list(map(int,input().split()))\r\nmin_value = ratings[0]\r\nmax_value = ratings[0]\r\namazing = 0\r\nfor i in range(1,len(ratings)):\r\n if ratings[i] > max_value:\r\n amazing+=1\r\n max_value = ratings[i]\r\n elif ratings[i] < min_value:\r\n amazing+=1\r\n min_value = ratings[i]\r\nprint(amazing)\r\n ", "input(); data = list(map(int, input().split()))\r\npast = [data[0]]\r\namazing = 0\r\nfor dataPiece in data[1:]:\r\n if min(past) > dataPiece: amazing += 1\r\n if max(past) < dataPiece: amazing += 1\r\n past.append(dataPiece)\r\nprint(amazing)", "n = int(input()) # Number of contests\r\npoints = list(map(int, input().split())) # List of earned points\r\n\r\namazing_count = 0 # Initialize the count of amazing performances\r\nbest = worst = points[0] # Initialize the best and worst performances with the first contest's points\r\n\r\nfor i in range(1, n):\r\n if points[i] > best:\r\n best = points[i]\r\n amazing_count += 1\r\n elif points[i] < worst:\r\n worst = points[i]\r\n amazing_count += 1\r\n\r\nprint(amazing_count)", "n = int(input())\r\nscore = list(map(int, input().split()))\r\nmen = mex = score[0]\r\ncnt = 0\r\nfor i in range(n):\r\n if score[i] > mex:\r\n mex = score[i]\r\n cnt += 1\r\n elif score[i] < men:\r\n men = score[i]\r\n cnt += 1\r\nprint(cnt)", "import math\ndef main():\n _, l = input(), [int(el) for el in input().split()]\n max, min = l[0], l[0]\n ans = 0\n for el in l[1:]:\n if el > max:\n max = el\n ans += 1\n if el < min:\n min = el\n ans += 1\n print(ans)\n\nif __name__ == '__main__':\n main()", "n=int(input())\r\nnums=list(map(int,input().split()))\r\nworst,best,ans=0,0,0\r\nworst,best=nums[0],nums[0]\r\nfor item in nums[1:n]:\r\n\tif item >best:\r\n\t\tbest=item\r\n\t\tans+=1\r\n\telif item<worst:\r\n\t\tworst=item\r\n\t\tans+=1\r\nprint(ans)\t\t\t\r\n\r\n", "number = int(input())\r\nnumbers = [int(el) for el in input().split(\" \")]\r\nmin = numbers[0]\r\nmax = numbers[0]\r\ncount = 0\r\nfor i in range(1, len(numbers)):\r\n if numbers[i] > max:\r\n max = numbers[i]\r\n count += 1\r\n if numbers[i] < min:\r\n min = numbers[i]\r\n count += 1\r\nprint(count)", "n=int(input())\r\ns=list(map(int,input().split()))\r\nbig,small=s[0],s[0]\r\ncounter=0\r\nfor i in range(1,len(s)):\r\n if s[i]>big:\r\n counter+=1\r\n big=s[i]\r\n elif s[i]<small:\r\n counter+=1\r\n small=s[i]\r\nprint(counter)", "n=int(input())\r\nscores=list(map(int,input().strip().split()))\r\nmi=scores[0]\r\nma=scores[0]\r\namazing=0\r\nfor i in range(1,n):\r\n if(scores[i]<mi):\r\n amazing+=1\r\n mi=scores[i]\r\n #print(mi)\r\n if(scores[i]>ma):\r\n amazing+=1\r\n ma=scores[i]\r\n #print(ma)\r\nprint(amazing)", "i=input\r\ni()\r\nm, *s=map(int,i().split())\r\nn=m\r\nx=0\r\nfor c in s:\r\n\tif c>m:\r\n\t\tx+=1\r\n\t\tm=c\r\n\tif c<n:\r\n\t\tx+=1\r\n\t\tn=c\r\nprint(x)", "n=int(input())\r\n*a,=map(int,input().split())\r\nc=0\r\nmax=a[0]\r\nmin=a[0]\r\nfor i in range(n):\r\n if a[i]>max:c+=1;max=a[i]\r\n elif a[i]<min:c+=1;min=a[i]\r\nprint(c)", "import math\r\nimport os\r\n\r\nn = input()\r\nn = int(n)\r\narr = list(map(int, input().split()))\r\nminn = 10001\r\nmaxn = 0\r\nans = 0\r\nfor i in range(n) :\r\n if (arr[i] < minn) | (arr[i] > maxn) :\r\n ans +=1\r\n minn = min(arr[i], minn)\r\n maxn = max(arr[i], maxn)\r\nprint(ans-1)\r\n# for _ in range(int(input())):\r\n # grid = [list(map(int, input().split())) for _ in range(3)]\r\n # result = [[1] * 3 for _ in range(3)]\r\n # n, s, r = map(int, input().split())\r\n # arr = list(map(int, input().split()))\r\n # n = input()\r\n # n = int(n)11 13 ", "def main() -> None:\n n: int = int(input())\n events: list[int] = list(map(int, input().split()))\n\n # am_ev = amazing events\n am_ev: int = 0\n\n min_: int = events[0]\n max_: int = events[0]\n for i in range(1, n):\n if max_ < events[i]: \n am_ev += 1\n max_ = events[i]\n elif min_ > events[i]:\n am_ev += 1\n min_ = events[i]\n\n print(am_ev)\n\n\nif __name__ == \"__main__\":\n main()\n", "n=int(input())\r\narr=list(map(int,input().split()))[:n]\r\ncnt=0\r\ncurr_max=arr[0]\r\ncurr_min=arr[0]\r\nfor i in range(1,n):\r\n if arr[i]>curr_max:\r\n curr_max=arr[i]\r\n cnt+=1\r\n elif arr[i]<curr_min:\r\n curr_min=arr[i]\r\n cnt+=1\r\n\r\nprint(cnt)", "a=int(input())\r\nz=0\r\nb=[int(b)for b in input().split()]\r\nfor i in range(1,a):\r\n if b[i]>max(b[:i]) or b[i]<min(b[:i]):\r\n z+=1\r\nprint(z)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmax,min = a[0],a[0]\r\nmc = 0\r\nfor x in range(1,len(a)):\r\n if a[x] > max :\r\n max = a[x]\r\n mc+=1\r\n elif a[x] < min :\r\n min = a[x]\r\n mc +=1\r\nprint(mc)\r\n", "t = int(input())\nc = 0\nl = list(map(int,input().split()))\nm = l[0]\nma = l[0]\nfor i in range(t):\n if l[i] < m :\n c += 1\n m = l[i]\n elif l[i] > ma :\n c += 1\n ma = l[i]\nprint(c)\n", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nre = 0\r\ntem = []\r\nfor i in range(0,n-1):\r\n tem.append(a[i])\r\n if a[i+1] > max(tem) or a[i+1] < min(tem):\r\n re+=1\r\nprint(re)\r\n\r\n \r\n\r\n ", "a = int(input())\r\nb = list(map(int, input().split()))\r\nmin1 = b[0]\r\nmax1 = b[0]\r\ncount = 0\r\nfor i in range(a):\r\n if b[i] > max1:\r\n max1 = b[i]\r\n count += 1\r\n elif b[i] < min1:\r\n min1 = b[i]\r\n count += 1\r\nprint(count)\r\n", "input()\r\ndata = input().split()\r\ndata = [int(x) for x in data]\r\nmax = data[0]\r\nmin = data[0]\r\namazing = 0\r\nfor i in data:\r\n if i > max:\r\n amazing +=1\r\n max = i\r\n if i < min:\r\n amazing +=1\r\n min = i\r\nprint(amazing)", "num=int(input())\r\nlist=list(map(int,input().split()))\r\nmin=10000\r\nmax=0\r\ncount=0\r\nfor i in range(0,num):\r\n points=list[i]\r\n if i==0:\r\n max=points\r\n min=points\r\n else:\r\n if list[i]<min:\r\n min=list[i]\r\n count+=1\r\n if list[i]>max:\r\n max=list[i]\r\n count+=1\r\nprint(count)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\namazing = 0\r\nmin_point = max_point = points[0]\r\n\r\nfor i in range(1, n):\r\n if points[i] > max_point:\r\n amazing += 1\r\n max_point = points[i]\r\n elif points[i] < min_point:\r\n amazing += 1\r\n min_point = points[i]\r\n\r\nprint(amazing)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nmn = a[0]\r\nmx = a[0]\r\nc = 0\r\n\r\nfor i in a:\r\n if i>mx: mx=i; c+=1\r\n elif i<mn: mn=i; c+=1\r\nprint(c)", "n = int(input())\r\nd = list(map(int, input().split()))\r\nmin_, max_ = d[0], d[0]\r\ncount = 0\r\nfor i in range(1, n):\r\n if d[i] > max_:\r\n max_ = d[i]\r\n count += 1\r\n elif d[i] < min_:\r\n min_ = d[i]\r\n count += 1\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmi = a[0]\r\nma = a[0]\r\nres = 0\r\n\r\nfor i in a:\r\n if i < mi:\r\n mi = i\r\n res += 1\r\n elif i > ma:\r\n ma = i\r\n res += 1\r\n\r\nprint(res)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmaxo=a[0]\r\nmino=a[0]\r\nt=0\r\nfor i in range(1,n):\r\n if a[i]>maxo:\r\n maxo=a[i]\r\n t+=1\r\n elif a[i]<mino:\r\n mino=a[i]\r\n t+=1\r\nprint(t)\r\n", "n = int(input())\r\nc = list(map(int, input().split(' ')))\r\nam = 0\r\nbig = c[0]\r\nsmall = c[0]\r\nc.remove(c[0])\r\n\r\nfor elem in c:\r\n if elem > big:\r\n am += 1\r\n big = elem\r\n elif elem < small:\r\n am += 1\r\n small = elem\r\n\r\nprint(am)\r\n", "n = input()\r\nev = map(int, input().split())\r\nev = list(ev)\r\nmax = 0\r\nmin = 0\r\ncount = 0\r\nmin = ev[0]\r\nmax = ev[0]\r\nfor i in ev:\r\n if i > max:\r\n max = i\r\n count += 1\r\n if i < min:\r\n min = i\r\n count += 1\r\nprint(count)", "def kamal(n):\r\n c=n+1\r\n return c\r\n\r\ndef dd(n, points):\r\n amazing_count = 0\r\n min_points = max_points = points[0]\r\n mkl=kamal(8)\r\n for i in range(1, n):\r\n if points[i] > max_points:\r\n max_points = points[i]\r\n amazing_count += 1\r\n elif points[i] < min_points:\r\n min_points = points[i]\r\n amazing_count += 1\r\n \r\n return amazing_count\r\n\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nprint(dd(n,a))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nfor a in range(1,n):\r\n m=0\r\n mm=0\r\n for i in range(0,a):\r\n if l[i]<l[a]:\r\n mm+=1\r\n if l[i]>l[a]:\r\n m+=1\r\n if m==a or mm==a:\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\npoints = [int(x) for x in input().split()]\r\n\r\nres = 0\r\nminimum = points[0]\r\nmaximum = points[0]\r\n\r\nfor i in range(1, n):\r\n if points[i] > minimum and points[i] > maximum:\r\n res += 1\r\n maximum = points[i]\r\n elif points[i] < minimum:\r\n res += 1\r\n minimum = points[i]\r\n\r\nprint(res)", "'''\r\n#list(map(int,input().split()))'''\r\ninput();n=list(map(int,input().split()));maxim,minim=n[0],n[0]\r\namazing=0\r\nfor i,elo in enumerate(n):\r\n if i==0:continue\r\n if elo > maxim:\r\n maxim=elo\r\n amazing+=1\r\n elif elo < minim:\r\n minim=elo\r\n amazing+=1\r\nprint(amazing)\r\n", "_ = input()\r\n\r\nscores = list(map(int, input().split()))\r\n\r\namazing_counter = 0\r\n\r\nbest = scores[0]\r\nworst = scores[0]\r\n\r\nfor score in scores:\r\n\tif score > best:\r\n\t\tbest = score\r\n\t\tamazing_counter += 1\r\n\telif score < worst:\r\n\t\tworst = score\r\n\t\tamazing_counter += 1\r\n\r\nprint(amazing_counter)", "n,l,c=int(input()),[int(i) for i in input().split()],0\r\nfor i in range(1,n):\r\n ca,cb=0,0\r\n for j in range(i):\r\n if l[i]>l[j]:ca+=1\r\n elif l[i]<l[j]:cb+=1\r\n if ca==i or cb==i:c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().strip().split()))\r\ncount = 0\r\nmax = a[0]\r\nmin = a[0]\r\nfor i in range(1, n):\r\n if a[i] > max:\r\n max = a[i]\r\n count += 1\r\n elif a[i] < min:\r\n min = a[i]\r\n count += 1\r\nprint(count)", "def main():\n discard = input()\n lst = input().split()\n total = 0\n minimum = int(lst[0])\n maximum = int(lst[0])\n for i in range(1, len(lst)):\n if int(lst[i]) < minimum:\n total += 1\n minimum = int(lst[i])\n elif maximum < int(lst[i]):\n total += 1\n maximum = int(lst[i])\n print(total)\nmain()\n", "N = int(input())\r\nScores = list(map(int, input().split()))\r\nc = 0\r\nBest = Scores[0]\r\nWorst = Scores[0]\r\nfor i in range(1, N):\r\n if Scores[i] > Best: \r\n Best = Scores[i]\r\n c += 1\r\n elif Scores[i] < Worst:\r\n Worst = Scores[i]\r\n c += 1\r\nprint(c)", "result=0\r\nn=int(input())\r\nl=input()\r\nl=list(map(int,l.split()))\r\ntemp=[]\r\ntemp.append(l[0])\r\nfor i in range(1,n):\r\n\tif l[i]>max(temp) or l[i]<min(temp):\r\n\t\tresult+=1\r\n\ttemp.append(l[i])\r\nprint(result)\r\n\r\n", "n=int(input())\r\nmylist=[int(i) for i in input().split()]\r\ncnt=0\r\nmx=mylist[0]\r\nmn=mylist[0]\r\nfor i in range(1,len(mylist)):\r\n for j in range(i):\r\n if mylist[j]>mx:\r\n mx=mylist[j]\r\n if mylist[j]<mn:\r\n mn=mylist[j]\r\n if mylist[i]<mn or mylist[i]>mx:\r\n cnt+=1\r\nprint(cnt)", "def solve(arr):\r\n amz = 0\r\n highest = arr[0]\r\n lowest = arr[0]\r\n for i in range(1,len(arr)):\r\n if highest < arr[i]:\r\n highest = arr[i]\r\n amz += 1\r\n elif lowest > arr[i]:\r\n lowest = arr[i]\r\n amz += 1\r\n else:\r\n continue\r\n return amz\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\nprint(solve(arr))\r\n#4664 6496 5814 7010 5762 5736 6944 4850 3698 7242", "n = int(input()) # Number of contests\npoints = list(map(int, input().split())) # List of points\n\n# Initialize the best and worst performances with the first contest's points\nbest_performance = worst_performance = points[0]\n\n# Initialize a counter for amazing performances\namazing_count = 0\n\n# Iterate through the contests starting from the second one\nfor i in range(1, n):\n if points[i] > best_performance:\n best_performance = points[i]\n amazing_count += 1\n elif points[i] < worst_performance:\n worst_performance = points[i]\n amazing_count += 1\n\n# Print the number of amazing performances\nprint(amazing_count)\n", "n=int(input())\r\nele_list=list(map(int,input().split()))\r\nmini=maxi=ele_list[0]\r\ncount=0\r\nfor i in range(1,n):\r\n if mini>ele_list[i]:\r\n mini=ele_list[i]\r\n count+=1 \r\n if maxi<ele_list[i]:\r\n maxi=ele_list[i]\r\n count+=1 \r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nanswer = 0\r\nmaxs, mins = a[0], a[0]\r\n\r\nfor i in range(1, n):\r\n # if a[i] == min(a[:i]) or max(a[:i]): answer += 1\r\n if a[i] > maxs:\r\n maxs = a[i]\r\n answer += 1\r\n if a[i] < mins:\r\n mins = a[i]\r\n answer += 1\r\n# print(answer//2)\r\nprint(answer)", "n = int(input())\r\nnumbers = list(map(int,input().split(' ')))\r\nli=[]\r\nmax_val=numbers[0]\r\nmin_val=numbers[0]\r\ni=1\r\nwhile(i<len(numbers)):\r\n if numbers[i]>max_val:\r\n max_val=numbers[i]\r\n li.append(max_val)\r\n if numbers[i]<min_val:\r\n min_val=numbers[i]\r\n li.append(min_val)\r\n i+=1\r\nprint(len(li))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmax=l[0]\r\nmin=l[0]\r\ncount=int(0)\r\nfor i in range(1,len(l)):\r\n if l[i]>max or l[i]<min:\r\n count+=1\r\n if l[i]>max:\r\n max=l[i]\r\n elif l[i]<min:\r\n min=l[i]\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\namaze = 0\r\nfor i in range(1,n):\r\n if min(a[:i]) > a[i] or max(a[:i]) < a[i]:\r\n amaze += 1\r\nprint(amaze)", "n = int(input())\r\nx = [int(x) for x in input().split(\" \")]\r\nmaks = x[0]\r\nmins = x[0]\r\nans = 0\r\n\r\nfor i in range(1,n):\r\n if x[i] > maks:\r\n maks = x[i]\r\n ans += 1\r\n\r\n if x[i] < mins:\r\n mins = x[i]\r\n ans += 1\r\n\r\nprint(ans)", "strict_less = 0\r\nstrict_more = 0\r\ncount = 0\r\nn = int(input())\r\na = list(map(int,input().split()))\r\n\r\n\r\nfor i in range(1,n):\r\n for j in range(0,i):\r\n if a[i] < a[j]:\r\n strict_less+=1\r\n if strict_less == i:\r\n count+=1\r\n else:\r\n for j in range(0,i):\r\n if a[i] > a[j]:\r\n strict_more+=1\r\n if strict_more==i:\r\n count+=1\r\n strict_less=0\r\n strict_more=0\r\n\r\nprint(count)\r\n", "c = int(input())\na = input().split()\nminimum, maximum = int(a[0]), int(a[0])\nn = 0\nfor i in range(c):\n if int(a[i]) < minimum:\n minimum = int(a[i])\n n += 1\n elif int(a[i]) > maximum:\n maximum = int(a[i])\n n += 1\nprint(n)", "amazing = 0\r\nn = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\nmax_point = points[0]\r\nmin_point = points[0]\r\n\r\nfor i in range(1, len(points)):\r\n if points[i] > max_point:\r\n amazing += 1\r\n max_point = points[i] \r\n elif points[i] < min_point:\r\n amazing += 1\r\n min_point = points[i]\r\nprint(amazing)", "n=int(input())\r\npoints=list(map(int, input().split()))\r\ncount=0\r\n\r\nfor i in range(1,n):\r\n subHighest=0\r\n subLowest=0\r\n for x in range(0,i):\r\n if points[i]>points[x]:\r\n subHighest+=1\r\n elif points[i]<points[x]:\r\n subLowest+=1\r\n if subHighest == i or subLowest == i:\r\n count+=1\r\nprint(count)", "n = int(input())\na = [int(x) for x in input().split()]\ntot = 0\nm = n = a[0]\n\nfor i in a:\n\tif i < m:\n\t\ttot += 1\n\t\tm = i\n\telif i > n:\n\t\ttot += 1\n\t\tn = i\nprint(tot)\n \t \t\t\t \t \t \t \t \t\t\t\t \t \t\t \t\t", "size=int(input())\r\narr=list(map(int, input().split()))\r\nmin_ps=max_ps =arr[0]\r\na = 0\r\nfor i in range(1,size):\r\n c=arr[i]\r\n if c< min_ps:\r\n min_ps=c\r\n a+= 1\r\n if c> max_ps:\r\n max_ps=c\r\n a+= 1\r\nprint(a)\r\n", "n = int(input())\r\nt = list(map(int,input().split()))\r\nhigh = 0\r\nlow = 10000\r\npp = 0\r\nfor i in range(1,len(t)):\r\n if(t[i]<t[0] and t[i] < low):\r\n low=t[i]\r\n pp+=1\r\n elif(t[i]>t[0] and t[i] > high):\r\n high=t[i]\r\n pp+=1\r\nprint(pp)", "n,*a=map(int,open(0).read().split())\r\nb=a[:1]\r\nfor x in a:\r\n\tn-=min(b)<=x<=max(b)\r\n\tb+=x,\r\nprint(n)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nMAX = a[0]\r\nMIN = a[0]\r\nres = 0\r\nfor i in range(1, n):\r\n if a[i] > MAX:\r\n res += 1\r\n MAX = a[i]\r\n if a[i] < MIN:\r\n res += 1\r\n MIN = a[i]\r\nprint(res)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nans=0\r\nmax=min=a[0]\r\nfor i in range(1,len(a)):\r\n if a[i]>max:\r\n max=a[i]\r\n ans+=1\r\n if a[i]<min:\r\n min=a[i]\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\nn=int(input())\r\nl=[]\r\ncount=0\r\nc=0\r\nfor i in range(n):\r\n x=map(int,input().split())\r\n l+=x\r\n break\r\nfor i in range(len(l)-1):\r\n if(l[i]<=l[i+1]):\r\n count+=1\r\n elif(l[i+1]<=l[i]):\r\n c+=1\r\nif(n==1):\r\n count=0\r\nelif(c==len(l)-1):\r\n count=c\r\nprint(count)\r\n\"\"\"", "# I love username\r\n# https://codeforces.com/problemset/problem/155/A\r\n\r\ndef main():\r\n number = int(input())\r\n points = [int(pt) for pt in input().split()]\r\n amazing = 0\r\n\r\n for i in range(1, len(points)):\r\n if points[i] > max(points[:i]) or points[i] < min(points[:i]):\r\n amazing += 1\r\n\r\n print(amazing)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "consists = int(input())\r\n\r\npoints = [int(p) for p in input().split()]\r\ncount = 0\r\nnewList = []\r\n\r\nfor p in points:\r\n \r\n if len(newList)>0:\r\n if max(newList) < p or min(newList) > p:\r\n count+=1\r\n newList.append(p)\r\n\r\n \r\nprint(count)", "n=int(input())\r\np=list(map(int,input().split(' ')))\r\npmax=p[0]\r\npmin=p[0]\r\nc=0\r\nfor i in range(1,n):\r\n if p[i]>pmax:\r\n c+=1\r\n pmax=p[i]\r\n elif p[i]<pmin:\r\n c+=1\r\n pmin=p[i]\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\n \r\nc=0\r\nmin=a[0]\r\nmax=a[0]\r\nfor i in range(n):\r\n if(a[i]<min):\r\n min=a[i]\r\n c+=1\r\n elif(a[i]>max):\r\n max=a[i]\r\n c+=1\r\nprint(c)", "import sys\r\n\r\nentrada=(sys.stdin.readline().strip())\r\nnumeros=[int(x) for x in (sys.stdin.readline().strip()).split()]\r\ncount=0\r\nminimo=numeros[0]\r\nmaximo=numeros[0]\r\nfor i in range(1,len(numeros)):\r\n if numeros[i]>maximo:\r\n count+=1\r\n maximo=numeros[i]\r\n elif numeros[i]<minimo:\r\n count+=1\r\n minimo=numeros[i]\r\nsys.stdout.write(str(count))", "n=int(input())\r\na=list(map(int,input().split()))\r\nm=a[0]\r\nl=a[0]\r\ns=0\r\nfor i in range(1,n):\r\n if a[i]>m:\r\n s+=1\r\n m=a[i]\r\n elif a[i]<l:\r\n s+=1\r\n l=a[i]\r\nprint(s)", "n = int(input())\r\nm = list(map(int, input().split()))\r\nr = 0\r\nfor i in range(1, n):\r\n sr = m[0 : i]\r\n if m[i] < min(sr) or m[i] > max(sr):\r\n r += 1\r\nprint(r)", "from collections import Counter\r\nimport math\r\ninput()\r\nls = list(map(int, input().split()))\r\nmn, mx, cnt = ls[0], ls[0], 0\r\nfor item in ls:\r\n if item < mn:\r\n cnt += 1\r\n mn = item\r\n if item > mx:\r\n cnt += 1\r\n mx = item\r\nprint(cnt)", "n = int(input())\r\narr = list(map(int, input().split()))\r\nminn = maxx = arr[0]\r\nans = 0\r\nfor i in range(1, n):\r\n if arr[i] < minn:\r\n minn = arr[i]\r\n ans += 1\r\n elif maxx < arr[i]:\r\n maxx = arr[i]\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nmax_ = l[0]\r\nmin_ = l[0]\r\namazing = 0\r\nfor i in range(n):\r\n if l[i]<min_:\r\n amazing = amazing + 1\r\n min_ = l[i]\r\n elif l[i]>max_:\r\n amazing = amazing + 1\r\n max_ = l[i]\r\nprint(amazing)", "b = int(input())\r\na = input().split()\r\nfor i in range(len(a)):\r\n a[i] = int(a[i])\r\nc = 0\r\nminn = a[0]\r\nmaxx = a[0]\r\nfor i in range(1, len(a)):\r\n if a[i] < minn:\r\n c = c+1\r\n minn = a[i]\r\n elif a[i] > maxx:\r\n c = c+1\r\n maxx = a[i]\r\n\r\nprint(c)\r\n", "n = int(input())\r\ns = input().split()\r\na = [int(x) for x in s]\r\nc = 0; maxi = a[0]; mini = a[0]\r\nt = a[0]\r\nfor i in range(1,len(a)):\r\n t = a[i]\r\n if (t>maxi) or (t<mini):\r\n c+=1\r\n maxi = max(a[i],maxi)\r\n mini = min(a[i],mini)\r\nprint(c)", "a=int(input())\r\nc=list(map(int,input().split()))\r\n\r\nb=[]\r\ni=0\r\nb.append(c[i])\r\ni=i+1\r\nn=0\r\nfor i in range(a):\r\n if min(b)>c[i] or max(b)<c[i]:\r\n n=n+1\r\n b.append(c[i])\r\n \r\n else:\r\n b.append(c[i])\r\n i=i+1\r\nprint(n)", "n=int(input())\r\nans=0\r\nl=list(map(int,input().split()))\r\nmax=min=l[0]\r\n\r\nfor i in l:\r\n if i>max:\r\n max=i\r\n ans+=1\r\n elif i<min:\r\n min=i\r\n ans+=1\r\nprint(ans)", "import sys\r\nimport math\r\nimport datetime\r\n\r\ndef main():\r\n #n,k = map(int, input().split())\r\n #a = [int(x) for x in sys.stdin.readline().split()]\r\n #t = int(input())\r\n t = int(input())\r\n count = 0\r\n a = [int(x) for x in sys.stdin.readline().split()]\r\n curr_max = a[0]\r\n curr_min = a[0]\r\n for i in range(1, t):\r\n if a[i] < curr_min:\r\n curr_min = a[i]\r\n count += 1\r\n if a[i] > curr_max:\r\n curr_max = a[i]\r\n count += 1\r\n print(count)\r\n \r\nmain()\r\n", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\nmin_val = max_val = points[0]\r\namazing = 0\r\n\r\nfor i in range(1, n):\r\n if points[i] < min_val:\r\n min_val = points[i]\r\n amazing += 1\r\n if points[i] > max_val:\r\n max_val = points[i]\r\n amazing += 1\r\n\r\nprint(amazing)\r\n", "n = int(input())\r\nq = input().split(\" \")\r\n\r\n\r\nfor i in range(0, n):\r\n q[i] = int(q[i])\r\nmax = q[0]\r\nmin = max\r\nch = 0\r\nfor i in range(1, n):\r\n if q[i] > max:\r\n ch += 1\r\n max = q[i]\r\n\r\n elif q[i] < min:\r\n ch += 1\r\n min = q[i]\r\n\r\n\r\nprint(ch)\r\n\r\n\r\n", "def i_love_username():\n N = int(input())\n scores = input()\n\n intScores = scores.split(\" \")\n\n max = int(intScores[0])\n min = int(intScores[0])\n count = 0\n\n for i in range(1, N):\n x = int(intScores[i])\n\n if x > max:\n max = x\n count += 1\n elif x < min:\n min = x\n count += 1\n\n print(count)\n\n \nif __name__ == \"__main__\":\n i_love_username()\n\n", "n = int(input())\r\na = input().split(\" \")\r\ncnt = 0\r\nhighest = int(a[0])\r\nlowest = int(a[0])\r\nfor i in range(1,n):\r\n if int(a[i]) > highest:\r\n highest = int(a[i])\r\n cnt += 1\r\n elif int(a[i]) < lowest:\r\n lowest = int(a[i])\r\n cnt += 1\r\nprint(cnt)", "n = int(input())\r\nlinha = [int(x) for x in input().split()]\r\nlista = [linha[0]]\r\ncontador = 0\r\n\r\nfor x in linha[1:]:\r\n if x > max(lista) or x < min(lista):\r\n contador +=1\r\n else:\r\n pass\r\n lista.append(x)\r\n \r\n\r\nprint(contador)", "n = int(input())\na = list(map(int,input().split()))\n\nworst = a[0]\nbest = a[0]\ncount = 0\n\nfor i in range(1,n):\n if a[i] > best:\n best = a[i]\n count += 1\n elif worst > a[i]:\n count += 1\n worst = a[i]\nprint(count)", "import sys, math, itertools, functools, collections\r\nfrom collections import Counter\r\n\r\ninput = lambda: sys.stdin.readline().strip()\r\n\r\nMIN = 10 ** 18\r\nMAX = -10 ** 18\r\n\r\n\r\ndef int_j():\r\n return int(input())\r\n\r\n\r\ndef int_m():\r\n return map(int, input().split())\r\n\r\n\r\ndef list_m():\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef occurred_once(arr):\r\n ans = list()\r\n mp = Counter(arr)\r\n for it in mp:\r\n if mp[it] == 1:\r\n list.append(it)\r\n return it\r\n return ans\r\n\r\n\r\nn = int_j()\r\na = list_m()\r\nMAX, MIN = a[0], a[0]\r\nans = 0\r\n\r\nfor i in a[1:]:\r\n if i > MAX:\r\n ans+=1\r\n MAX = i\r\n if i < MIN:\r\n ans+=1\r\n MIN = i\r\nprint(ans)\r\n", "n=int(input())\r\n\r\na=list(map(int,input().split()))\r\n\r\nmax1=a[0]\r\nmin1=a[0]\r\nc=0\r\nfor i in range(len(a)):\r\n if min(min1,a[i])!=min1:\r\n c=c+1\r\n min1=min(min1,a[i])\r\n if max(max1,a[i])!=max1:\r\n c=c+1\r\n max1=max(max1,a[i])\r\nprint(c)\r\n \r\n \r\n \r\n ", "n = int(input())\na = [int(x) for x in input().split()]\nans = 0\nmn = mx = a[0]\nfor x in a:\n if x > mx:\n ans += 1\n mx = x\n if x < mn:\n ans += 1\n mn = x\nprint(ans)\n", "n = int(input())\r\nnm = map(int, input().split())\r\na = next(nm)\r\nb = a\r\nc = 0\r\nfor i in nm:\r\n if i > a:\r\n a = i\r\n c += 1\r\n elif i < b:\r\n b = i\r\n c += 1\r\nprint(c)", "n=int(input())\r\npoint=list(map(int,input().split()))\r\n\r\ncount=0\r\nbest=point[0]\r\nworse=point[0]\r\nfor i in range(1,n):\r\n if point[i]>best:\r\n best= point[i]\r\n count+=1\r\n elif point[i]<worse:\r\n worse=point[i]\r\n count+=1\r\nprint(count)", "num = int(input())\r\nls = list(map(int, input().split()))\r\nmini = ls[0]\r\nmaxi = ls[0]\r\nsum = 0\r\nfor i in range(num):\r\n\tif ls[i] > maxi:\r\n\t\tsum += 1\r\n\t\tmaxi = ls[i]\r\n\telif ls[i] < mini:\r\n\t\tsum += 1\r\n\t\tmini = ls[i]\r\n\t\t\r\nprint(sum)", "a=int(input())\r\nlst=list(map(int,input().split()))\r\nmin=lst[0]\r\nmax=lst[0]\r\nsum=0\r\nfor char in lst[1:]:\r\n if char > max:\r\n sum+=1\r\n max=char\r\n elif char< min:\r\n sum+=1\r\n min=char\r\nprint(sum)", "def count_amazing(q, points):\r\n min_points = max_points = points[0]\r\n amazing_count = 0\r\n for i in range(1, q):\r\n if points[i] > max_points:\r\n max_points = points[i]\r\n amazing_count += 1\r\n elif points[i] < min_points:\r\n min_points = points[i]\r\n amazing_count += 1\r\n return amazing_count\r\nq = int(input())\r\npoints = list(map(int, input().split()))\r\nres = count_amazing(q, points)\r\nprint(res)\r\n", "n = int(input())\r\nx = list(map(int, input().split()))\r\ncount = 0\r\nmin = x[0]\r\nmax = x[0]\r\nfor i in range(1, n):\r\n if x[i] < min:\r\n min = x[i]\r\n count += 1\r\n\r\n elif x[i] > max:\r\n max = x[i]\r\n count += 1\r\nprint(count)", "n = int(input())\r\nminn = 1000000\r\nmaxx = -1000000\r\na = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(n):\r\n if a[i] < minn or a[i] > maxx:\r\n if i != 0:\r\n c+=1\r\n if a[i] < minn:\r\n minn = a[i]\r\n if a[i] > maxx:\r\n maxx = a[i]\r\n \r\nprint(c)\r\n ", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist2=[list1[0]]\r\ncount=0\r\nfor i in range (1,len(list1)):\r\n if list1[i]>max(list2) or list1[i]<min(list2):\r\n count+=1\r\n list2.append(list1[i])\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\nc = 0\r\n\r\nfor i in range(1, n):\r\n if a[i] > max(a[:i]) or a[i] < min(a[:i]):\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input())\r\npoints_array = list(map(int, input().split(' ')))\r\n\r\nbest_perf = points_array[0]\r\nworst_perf = best_perf\r\namazing_perfs = 0\r\n\r\nfor points in points_array[1:]:\r\n if points > best_perf:\r\n best_perf = points\r\n amazing_perfs += 1\r\n\r\n elif points < worst_perf:\r\n worst_perf = points\r\n amazing_perfs += 1\r\n\r\nprint(amazing_perfs)\r\n", "import sys\r\nnum = int(sys.stdin.readline().strip())\r\nlst = sys.stdin.readline().strip().split()\r\nmaxi = int(lst[0])\r\nmini = int(lst[0])\r\ncounter = 0\r\nfor i in range(len(lst)):\r\n if int(lst[i]) > maxi:\r\n maxi = int(lst[i])\r\n counter += 1\r\n if int(lst[i]) < mini:\r\n mini = int(lst[i])\r\n counter += 1\r\n else:\r\n continue\r\nprint(counter)", "n=int(input())\r\nd=list(map(int,input().split()))\r\nc=0\r\nd1=d[0]\r\nd2=d[0]\r\nfor i in d:\r\n if i>d1:\r\n c+=1\r\n d1=i\r\n if i<d2:\r\n c+=1\r\n d2=i\r\nprint(c)", "a = int(input())\r\ns = list(map(int, input().split(\" \")))\r\nct = 0\r\nfor i in range (1 , a):\r\n if s[i] > max(s[0:i]) or s[i] < min(s[0:i]) :\r\n ct +=1\r\nprint(ct)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmin1=a[0]\r\nmax1=a[0]\r\ns=0\r\nfor i in range(n):\r\n if max1<a[i]:\r\n max1=a[i]\r\n s+=1\r\n if min1>a[i]:\r\n min1=a[i]\r\n s+=1\r\nprint(s)\r\n \r\n ", "a=int(input())\r\nd=list(map(int,input().split()))\r\nco=0\r\nmax=d[0]\r\nmin=d[0]\r\nfor i in range(a):\r\n if(max<d[i]):\r\n co+=1\r\n max=d[i]\r\nfor i in range(a):\r\n if(min>d[i]):\r\n co+=1\r\n min=d[i]\r\nprint(co)", "def contests(list_of_contests):\r\n number_of_amazing_performances = 0\r\n max_score = list_of_contests[0]\r\n min_score = list_of_contests[0]\r\n for i in list_of_contests[1:]:\r\n if i > max_score:\r\n max_score = i\r\n number_of_amazing_performances += 1\r\n elif i < min_score :\r\n min_score = i\r\n number_of_amazing_performances += 1\r\n return number_of_amazing_performances\r\n\r\nif __name__ == \"__main__\":\r\n number_of_contests = int(input())\r\n list_of_contests = list(map(int , input().split()[:number_of_contests]))\r\n print(contests(list_of_contests))", "n = int(input())\r\n\r\ncompetitions = list(map(int, input().split()))\r\n\r\namazings = 0\r\n\r\nfor i, comp in enumerate(competitions):\r\n if i:\r\n if comp > max(competitions[:i]) or comp < min(competitions[:i]):\r\n amazings += 1\r\n\r\n\r\nprint(amazings)\r\n", "k = int(input())\r\nn = input().split()\r\nn = [int(i) for i in n]\r\nm = []\r\nc = 0\r\nfor i in range(1, k):\r\n m.append(n[i - 1])\r\n if n[i] < min(m):\r\n c += 1\r\n if n[i] > max(m):\r\n c += 1\r\nprint(c)\r\n", "n = int(input())\r\nscores = list(map(int, input().split()))\r\n\r\nrecord = scores[0]\r\nantirecord = scores[0]\r\namazing = 0\r\n\r\nfor i in range(1, n):\r\n if scores[i] > record:\r\n record = scores[i]\r\n amazing += 1\r\n elif scores[i] < antirecord:\r\n antirecord = scores[i]\r\n amazing += 1\r\n\r\nprint(amazing)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\nam = 0\r\nmini = p[0]\r\nmaxi = p[0]\r\n\r\nfor i in range(1, n):\r\n if p[i] > mini and p[i] > maxi:\r\n am += 1\r\n maxi = p[i]\r\n elif p[i] < mini:\r\n am += 1\r\n mini = p[i]\r\n\r\nprint(am)", "#Coder_1_neel\r\nn = int(input())\r\na = list(map(int, input().split()))\r\ng = l = a[0]\r\nc = 0\r\n\r\nfor i in range(1, n):\r\n if a[i] > g:\r\n g = a[i]\r\n c += 1\r\n elif a[i] < l:\r\n l = a[i]\r\n c += 1\r\n\r\nprint(c)\r\n", "\"\"\"\r\n=> @auther:Abdallah_Gaber\r\n=> A computer science student\r\n=> AOU University \"Egypt Branch\"\r\n\"\"\"\r\n\r\nn =int(input())\r\nlst=[int(x) for x in input().split()]\r\nmn=lst[0]\r\nmx=lst[0]\r\nc=0\r\nfor i in range(1,n):\r\n if lst[i] > mx:\r\n mx = lst[i]\r\n c+=1\r\n if lst[i] <mn:\r\n mn=lst[i]\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\n\r\nresult = 0\r\n\r\nfor i in range(n):\r\n if i >= 1:\r\n if min(lst[:i]) > lst[i] or max(lst[:i]) < lst[i]:\r\n result += 1\r\n\r\nprint(result)", "import sys\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_str(): return sys.stdin.readline().strip()\r\ndef get_int(): return int(sys.stdin.readline().strip())\r\ndef fast_print(*args, **kwargs):\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\nn = get_int()\r\nlis = get_list()\r\nmsf, mxsf = lis[0], lis[0]\r\nres = 0\r\nfor i in lis[1:]:\r\n if i<msf:\r\n res += 1\r\n msf = i \r\n elif i>mxsf:\r\n res += 1\r\n mxsf = i\r\nfast_print(res)", "def main() -> None :\r\n print(count_Of_Amazing_Performance(input_Points()))\r\n\r\n\r\ndef count_Of_Amazing_Performance(points: list[int]) -> int :\r\n result = 0\r\n\r\n current_max_point = points[0]\r\n curremt_min_point = points[0]\r\n for point in points :\r\n if is_Amazing_Point(point, current_max_point, curremt_min_point) :\r\n current_max_point = update_Current_Max_Point(point, current_max_point)\r\n curremt_min_point = update_Current_Min_Point(point, curremt_min_point)\r\n result += 1\r\n\r\n return result\r\n\r\ndef is_Amazing_Point(point: int, current_max_point: int, current_min_point: int) -> bool :\r\n return (point > current_max_point) or (point < current_min_point)\r\n\r\ndef update_Current_Max_Point(point: int, current_max_point: int) -> int :\r\n return max(point, current_max_point)\r\n\r\ndef update_Current_Min_Point(point: int, current_min_point: int) -> int :\r\n return min(point, current_min_point)\r\n\r\n\r\n\r\ndef input_Points() -> list[int] :\r\n ignore_Line()\r\n return input_Array()\r\n\r\ndef ignore_Line() -> None :\r\n return input()\r\n\r\ndef input_Array() -> list[int] :\r\n return list(map(int, input().split()))\r\n\r\n\r\nmain()", "n = int(input())\r\nl = input()\r\nlist1 = l.split(\" \")\r\ncount=0\r\nmaxn = list1[0]\r\nminn = list1[0]\r\nmaxn = int(maxn)\r\nminn = int(minn)\r\nfor i in list1:\r\n if int(i)>maxn:\r\n count+=1\r\n maxn = int(i)\r\n if int(i)<minn:\r\n count+=1\r\n minn = int(i)\r\nprint(count)", "count = int(input())\nscores = list(map(int, input().split()))\n\nif len(scores) < 2:\n # если участник участвовал только в одном соревновании, то удивительных выступлений не было\n print(0)\nelse: \n amazing_count = 0\n best_score = scores[0] # лучший результат участника на данный момент\n worst_score = scores[0] # худший результат участника на данный момент\n\n for i in range(1, len(scores)):\n if scores[i] > best_score:\n # если участник установил новый рекорд\n amazing_count += 1\n best_score = scores[i]\n elif scores[i] < worst_score:\n # если участник установил новый анти-рекорд\n amazing_count += 1\n worst_score = scores[i]\n print(amazing_count)\n", "count = 0\r\nn = int(input())\r\nmass = list(map(int, input().split()))\r\nminx, maxx = mass[0], mass[0]\r\nfor i in mass:\r\n if i < minx:\r\n count += 1\r\n minx = i\r\n elif i > maxx:\r\n count += 1\r\n maxx = i\r\nprint(count)", "def best(current, all, index):\r\n for i in range(index):\r\n if int(all[i]) < int(current):\r\n if i == index - 1:\r\n return 1\r\n else:\r\n return 0\r\n \r\n \r\ndef worst(current, all, index):\r\n for i in range(index):\r\n if int(all[i]) > int(current):\r\n if i == index - 1:\r\n return 1\r\n else:\r\n return 0\r\nlength = int(input())\r\n \r\nscores = input().split()\r\ncount = 0\r\nfor i in range(1, len(scores)):\r\n count = count + best(scores[i], scores, i) + worst(scores[i], scores, i)\r\nprint(count)", "# بسم الله (accepted)\r\n# a coders performance is amazing if he scores a new highest or a new lowest score\r\n# his first performance is not considered\r\nn = int(input())\r\nperformance_list = input().split(' ')\r\nnew_list = []\r\nanswer = 0\r\nperformance_list = [int(event) for event in performance_list]\r\nfor event in performance_list :\r\n if len(new_list) == 0 :\r\n new_list.append(event)\r\n elif event > max(new_list) :\r\n answer += 1\r\n new_list.append(event)\r\n elif event < min(new_list) :\r\n answer += 1\r\n new_list.append(event)\r\nprint(answer)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(1, n):\r\n if arr[i] < min(arr[:i]) or arr[i] > max(arr[:i]):\r\n count += 1\r\nprint(count)", "a = int(input())\r\n*q, = map(int, input().split(' '))\r\ns = q[0]\r\nw = q[0]\r\nd = 0\r\nfor i in range(1, a):\r\n if q[i] > s:\r\n d += 1\r\n s = q[i]\r\n elif q[i] < w:\r\n d += 1\r\n w = q[i]\r\nprint(d)", "n=int(input())\r\nperf=list(map(int,input().split()))\r\ncurrent_max=perf[0]\r\ncurrent_min=perf[0]\r\namazing_count=0\r\nfor i in range(1,len(perf)):\r\n if(perf[i]>current_max):\r\n current_max=perf[i]\r\n amazing_count+=1\r\n if(perf[i]<current_min):\r\n current_min=perf[i]\r\n amazing_count+=1\r\nprint(amazing_count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a[0];count_=0;c=a[0]\r\nfor i in range(1,n):\r\n if a[i]>b:\r\n count_+=1\r\n b=a[i]\r\n elif a[i]<c:\r\n count_+=1\r\n c=a[i]\r\nprint(count_)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=[l[0]]\r\nc=l[0]\r\nd=l[0]\r\np=0\r\nfor i in range(1,n):\r\n if l[i]<c:\r\n p+=1 \r\n c=l[i]\r\n elif l[i]>d:\r\n p+=1 \r\n d=l[i]\r\nprint(p)", "n = int(input())\r\nearned_points = list(map(int, input().split()))\r\n\r\namazing_performances = 0\r\nbest_performance = earned_points[0]\r\nworst_performance = earned_points[0]\r\n\r\nfor points in earned_points[1:]:\r\n if points > best_performance:\r\n amazing_performances += 1\r\n best_performance = points\r\n elif points < worst_performance:\r\n amazing_performances += 1\r\n worst_performance = points\r\n\r\nprint(amazing_performances)\r\n", "# -*- coding: utf-8 -*-\n\n\n\ndef solve():\n n = int(input())\n a = list(map(int, input().split()))\n\n ans = 0\n minA, maxA = a[0], a[0]\n for i in range(1, n):\n if a[i] < minA or a[i] > maxA: ans += 1\n minA, maxA = min(minA, a[i]), max(maxA, a[i])\n print(ans)\n \ndef main():\n t = 1\n # t = int(input())\n for i in range(t):\n solve()\n\nif __name__ == \"__main__\":\n main()\n\t\t\t \t\t\t\t\t \t\t\t \t\t \t\t \t \t", "n=int(input())\r\nscores=list(map(int,input().split()))\r\namazing=0\r\nfor i in range(1,n):\r\n mini=0\r\n maxi=0\r\n for j in range(0,i):\r\n if scores[i]>scores[j]:\r\n maxi+=1\r\n elif scores[i]<scores[j]:\r\n mini+=1\r\n if maxi==i or mini==i:\r\n amazing+=1\r\nprint(amazing)\r\n \r\n\r\n \r\n \r\n \r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nmn = mx = arr[0]\r\ncnt = 0\r\nfor i in range(1, n):\r\n if arr[i] > mx:\r\n cnt += 1\r\n elif arr[i] < mn:\r\n cnt += 1\r\n mn = min(mn, arr[i])\r\n mx = max(mx, arr[i])\r\nprint(cnt)", "n = int(input())\r\nmas = [int(el) for el in input().split()]\r\nmx = mas[0]\r\nmn = mas[0]\r\nans = 0\r\nfor el in mas:\r\n if el > mx:\r\n mx = el\r\n ans += 1\r\n if el < mn:\r\n mn = el\r\n ans += 1\r\nprint(ans)", "a=int(input())\r\nx=list(map(int,input().split()))\r\nsmall=x[0]\r\nbig=x[0]\r\nc=0\r\nfor i in range(1,len(x)):\r\n if x[i]>big:\r\n big=x[i]\r\n c+=1\r\n elif x[i]<small:\r\n small=x[i]\r\n c+=1\r\nprint(c)\r\n ", "def main(): \r\n n, *a = map(int, open(0).read().split())\r\n cnt = 0\r\n for i in range(1, len(a)):\r\n if a[i] > max(a[:i]) or a[i] < min(a[:i]):\r\n cnt += 1\r\n print(cnt) \r\n\r\nmain()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nres=[]\r\nres.append(l[0])\r\nc=0\r\nfor i in range(1,len(l)):\r\n if l[i]>max(res):\r\n c+=1\r\n res.append(l[i])\r\n elif l[i]<min(res):\r\n c+=1\r\n res.append(l[i])\r\nprint(c)\r\n ", "m= int(input())\r\n \r\nstring = input()\r\nlista = string.split(' ')\r\nn = 0\r\n\r\n\r\nfor i in range(len(lista)):\r\n lista[i] = int(lista[i]) \r\n\r\n\r\ngreater = lista[0]\r\nlesser = lista[0]\r\n\r\nfor i in range(1, len(lista)):\r\n if lista[i] > greater:\r\n greater = lista[i]\r\n n += 1\r\n\r\n elif lista[i] < lesser:\r\n lesser = lista[i]\r\n n += 1\r\n\r\nprint(n)", "\nn = int(input())\nscores = list(map(int, input().split()))\nbest, worst, amazing_count = scores[0], scores[0], 0\nif n == 1:\n\tprint(0)\nelse:\t\n\tfor i in range(1, n):\n\t\tif scores[i] > best:\n\t\t\tbest = scores[i]\n\t\t\tamazing_count += 1 \n\t\tif scores[i] < worst:\n\t\t\tworst = scores[i]\n\t\t\tamazing_count += 1\n\tprint(amazing_count)", "n = int(input())\r\nscores = list(map(int,input().split()))\r\n\r\nrecord = [scores[0],scores[0]]\r\namazing = 0\r\n\r\nfor score in scores:\r\n if score > record[1]:\r\n amazing += 1\r\n record[1] = score\r\n elif score < record[0]:\r\n amazing += 1\r\n record[0] = score\r\nprint(amazing)", "n = int(input())\r\nArr = [int(a) for a in input().split()]\r\nL = [Arr[0]]\r\nAmazing_contests_count = 0\r\nfor a in range(1,len(Arr)):\r\n L.append(Arr[a])\r\n if (L.count(L[len(L)-1]) == 1 and ((L[len(L)-1] == max(L)) or (L[len(L)-1] == min(L)))):\r\n Amazing_contests_count += 1\r\nprint(Amazing_contests_count)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\nc = list(map(int, input().split()))\r\nb = [x for i, x in enumerate(c) if x not in c[:i]]\r\nlis = list()\r\ncounter = 0\r\nfor i in b:\r\n lis.append(i)\r\n if i == max(lis) or i == min(lis):\r\n counter += 1\r\n\r\n\r\nprint(counter - 1)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nmax_val = a[0]\r\nmin_val = a[0]\r\nres = 0\r\n\r\nfor x in a[1:]:\r\n if x > max_val:\r\n max_val = x\r\n res += 1\r\n if x < min_val:\r\n min_val = x\r\n res += 1\r\n\r\nprint(res)\r\n", "n=int(input())\r\nrecords=input().split()\r\nhighest=lowest=int(records[0])\r\namazing=0\r\nfor i in range(1,n):\r\n if(int(records[i])>highest):\r\n amazing+=1\r\n highest=int(records[i])\r\n if(int(records[i])<lowest):\r\n amazing+=1\r\n lowest=int(records[i])\r\nprint(amazing)", "count_elements=int(input())\r\ntrash=list(map(int,input().split()))\r\ncount_bestNums=0\r\ntest_array=[]\r\nfor i in range(len(trash)):\r\n fast_array=trash[0:i]\r\n if len(fast_array)!=0:\r\n max_element=max(fast_array)\r\n min_element=min(fast_array)\r\n if trash[i]>max_element or trash[i]<min_element:\r\n count_bestNums+=1\r\nprint(count_bestNums)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nans = 0\r\nm1 = l[0]\r\nm2 = l[0]\r\nfor i in range(1,len(l)):\r\n if l[i]>m1:\r\n ans+=1\r\n m1 = l[i]\r\n elif l[i]<m2:\r\n ans+=1\r\n m2 = l[i]\r\nprint(ans)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1,len(lst)):\r\n if lst[i] > max(lst[:i]) or lst[i] < min(lst[:i]):\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\npoints = list(map(int,input().split()))\r\ncounter =0 \r\nfor i in range(1,n):\r\n subconuter_highest = 0\r\n subconuter_lowest = 0\r\n for a in range(0,i):\r\n if points[i]>points[a]:\r\n subconuter_highest+=1\r\n elif points[i]<points[a]:\r\n subconuter_lowest+=1 \r\n if subconuter_highest == i or subconuter_lowest == i:\r\n counter+=1\r\nprint(counter)", "n = int(input())\r\npoint = list(map(int, input().split()))\r\nmx = point[0]\r\nmn = point[0]\r\nk = 0\r\nfor i in range(1, n):\r\n\tif point[i] > mx:\r\n\t\tk += 1\r\n\t\tmx = point[i]\r\n\telif point[i] < mn:\r\n\t\tk += 1\r\n\t\tmn = point[i]\r\nprint(k)", "n=int(input())\r\nx=input().split()\r\nm=[int(i) for i in x]\r\ncount=0\r\nk=0\r\na=0\r\nfor j in range(n):\r\n if j==0:\r\n k=m[j]\r\n a=m[j]\r\n continue\r\n if m[j]>k:\r\n k=m[j]\r\n count+=1\r\n if m[j]<a:\r\n a=m[j]\r\n count+=1\r\nprint(count)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmx,mn = 0,0\r\nflag = 0\r\nif(n!=1):\r\n if(a[0]>a[1]):\r\n mx = a[0]\r\n mn = a[1]\r\n flag+=1\r\n if(a[0]<a[1]):\r\n mx = a[1]\r\n mn = a[0]\r\n flag+=1\r\n if(a[0]==a[1]):\r\n mx = a[0]\r\n mn = a[0] \r\n\r\n for i in range(2,n):\r\n if(a[i]>mx):\r\n mx = a[i]\r\n flag+=1\r\n if(a[i]<mn):\r\n mn = a[i]\r\n flag+=1\r\n else:\r\n flag+=0\r\n print(flag) \r\nelse:\r\n print(0)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nhigh = a[0]\r\nlow = a[0]\r\ncount = 0\r\nfor i in a:\r\n if i > high:\r\n high = i\r\n count += 1\r\n elif i < low:\r\n low = i\r\n count += 1\r\nprint(count)", "n = int(input())\r\npuntos = list(map(int, input().split()))\r\nactuaciones_increibles = 0\r\nmaximo = puntos[0]\r\nminimo = puntos[0]\r\nfor i in range(1, n):\r\n if puntos[i] > maximo:\r\n maximo = puntos[i]\r\n actuaciones_increibles += 1\r\n elif puntos[i] < minimo:\r\n minimo = puntos[i]\r\n actuaciones_increibles += 1\r\nprint(actuaciones_increibles)", "n=int(input())\nct=list(map(int,input().split()))\nc=0\nmaxi=ct[0]\nmini=ct[0]\nfor i in range(1,len(ct)):\n \n if ct[i]>maxi or ct[i]<mini:\n c+=1 \n maxi=max(maxi,ct[i])\n mini=min(mini,ct[i])\nprint(c) \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\nvar = 0\r\nbest = worst = l[0]\r\nfor i in l[1:]:\r\n if i > best:\r\n best = i\r\n var += 1\r\n elif i < worst:\r\n worst = i\r\n var += 1\r\nprint(var)\r\n", "n = int(input())\r\nx = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(1,n):\r\n k = x[:i+1]\r\n if k.index(max(k)) == i:\r\n c+=1\r\n elif k.index(min(k)) == i:\r\n c+=1\r\nprint(c)", "n = input()\r\nl = list(map(int,input().split()))\r\nm = l[0]\r\nmn = l[0]\r\ncnt = 0\r\nfor i in l:\r\n\tif i >m :\r\n\t\tm=i\r\n\t\tcnt+=1\r\n\tif i<mn:\r\n\t\tcnt+=1\r\n\t\tmn = i\r\n\r\nprint (cnt)", "n = int(input())\r\nm = map(int, input().split())\r\nl = list(m)\r\ncounter = 0\r\nmax = l[0]\r\nmin = l[0]\r\nfor i in l:\r\n\r\n if i > max:\r\n counter +=1\r\n max =i\r\n if i < min:\r\n counter +=1\r\n min = i\r\nprint(counter)", "n=int(input())\r\ne=list(map(int,input().split()))\r\ninc=0\r\nminim=e[0]\r\nmaxim=e[0]\r\nfor i in e:\r\n if i>minim:\r\n if i>maxim:\r\n maxim=i\r\n inc+=1\r\n if i<minim:\r\n minim=i\r\n inc+=1\r\nprint(inc)\r\n", "_ = input()\r\nscores = [int(x) for x in input().split()]\r\na = 0\r\nw_p = scores[0]\r\nb_p = scores[0]\r\n\r\nfor s in scores:\r\n if s > b_p:\r\n a += 1\r\n b_p = s\r\n elif s < w_p:\r\n a += 1\r\n w_p = s\r\n\r\nprint(a)", "\r\n\r\nn = int(input())\r\n\r\ncontests = [int(i) for i in input().split()]\r\n\r\ndef isAmazing(list, n):\r\n result = 0\r\n \r\n\r\n if n > 1 :\r\n for i in range(1, n):\r\n if min(contests[:i+1]) == contests[i] and contests[i] not in contests[:i]:\r\n result += 1\r\n elif max(contests[:i+1]) == contests[i] and contests[i] not in contests[:i]:\r\n result += 1\r\n \r\n return result\r\n\r\nprint(isAmazing(contests, n))\r\n", "# Input the number of contests\r\nn = int(input())\r\n\r\n# Input the list of points earned\r\npoints = list(map(int, input().split()))\r\n\r\n# Initialize variables to keep track of best and worst records\r\nbest_record = points[0]\r\nworst_record = points[0]\r\n\r\n# Initialize a variable to count amazing performances\r\namazing_count = 0\r\n\r\n# Iterate through the points earned in contests\r\nfor i in range(1, n):\r\n if points[i] > best_record:\r\n best_record = points[i]\r\n amazing_count += 1\r\n elif points[i] < worst_record:\r\n worst_record = points[i]\r\n amazing_count += 1\r\n\r\n# Output the count of amazing performances\r\nprint(amazing_count)\r\n", "import math\r\n\r\n\r\ndef lstRd() -> list:\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef intRd():\r\n return int(input())\r\n\r\n\r\n\r\n\r\ndef lstStrRd():\r\n return list(input())\r\n\r\nfor i in range(1):\r\n n, = lstRd()\r\n\r\n a = lstRd()\r\n\r\n\r\n minn = a[0]\r\n maxx = a[0]\r\n res = 0\r\n\r\n\r\n\r\n for i in range(1, n):\r\n if a[i] < minn:\r\n minn = a[i]\r\n res += 1\r\n\r\n if a[i] > maxx:\r\n maxx = a[i]\r\n res += 1\r\n\r\n\r\n print(res)", "n = int(input())\nm = [int(x) for x in input().split()]\nhighest = int(m[0])\nlowest = int(m[0])\ncount = int(0)\nfor i in range(1, n):\n if (m[i]>highest):\n highest = m[i]\n count+=1\n elif (m[i]<lowest):\n lowest = m[i]\n count+=1\nprint(count)\n \t \t \t\t\t\t\t\t\t \t\t \t \t", "x=int(input(\"\"))\r\ny=input(\"\")\r\nc=0\r\nl=y.split(\" \")\r\nl1=[]\r\nfor i in l:\r\n l1.append(int(i))\r\nfor j in range(1,len(l1)):\r\n l2=l1[:j]\r\n if l1[j]>max(l2) or l1[j]<min(l2):\r\n c+=1\r\nprint(c)", "# Read the input values\r\nn = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\n# Initialize the counters for amazing performances\r\namazing_count = 0\r\n\r\n# Initialize the best and worst records with the first contest's points\r\nbest_record = worst_record = points[0]\r\n\r\n# Iterate through the points of the contests\r\nfor i in range(1, n):\r\n # Check if the current points form an amazing performance\r\n if points[i] > best_record:\r\n best_record = points[i]\r\n amazing_count += 1\r\n elif points[i] < worst_record:\r\n worst_record = points[i]\r\n amazing_count += 1\r\n\r\n# Print the number of amazing performances\r\nprint(amazing_count)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ncurmax = a[0]\r\ncurmin = a[0]\r\n\r\nans = 0\r\n\r\nfor i in range(1, n):\r\n if curmax < a[i]:\r\n ans += 1\r\n curmax = a[i]\r\n if a[i] < curmin:\r\n ans += 1\r\n curmin = a[i]\r\n\r\nprint(ans)\r\n", "t = int(input())\r\nl = list(map(int, input().split(' ')))\r\ns = [l[0]];q = 0\r\n\r\nfor i in range(1, t):\r\n if max(s) < l[i]:\r\n s.append(l[i])\r\n q += 1\r\n elif min(s) > l[i]:\r\n s.append(l[i])\r\n q += 1\r\nprint(q)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\np_min = l[0]\r\np_max = l[0]\r\nn = 0\r\nfor i in l[1:]:\r\n if i<p_min:\r\n p_min = i \r\n n = n+1 \r\n elif i>p_max:\r\n p_max = i \r\n n+=1 \r\nprint(n)\r\n", "n = int(input())\nscores = list(map(int, input().split(' ')))\n\nrecords = 0\ncurrent_min = scores[0]\ncurrent_max = scores[0]\nfor i in range(1, n):\n if scores[i] > current_max:\n current_max = scores[i]\n records += 1\n if scores[i] < current_min:\n current_min = scores[i]\n records += 1\nprint(records) \n", "def task1(n, nums):\r\n start_mx = nums[0]\r\n start_mn = nums[0]\r\n nums = nums[1:]\r\n cnt = 0\r\n for el in nums:\r\n if el > start_mx:\r\n cnt += 1\r\n start_mx = el\r\n elif el < start_mn:\r\n cnt += 1\r\n start_mn = el\r\n return cnt\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\nprint(task1(n, nums))", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\nap = 0\r\n\r\nmin_p = points[0]\r\nmax_p = points[0]\r\n\r\nfor i in range(n):\r\n if points[i] > max_p:\r\n max_p = points[i]\r\n ap += 1\r\n elif points[i] < min_p:\r\n min_p = points[i]\r\n ap += 1\r\n\r\nprint(ap)\r\n \r\n", "num = int(input())\r\ncontest = list(map(int,input().split(\" \")))\r\namazing = 0\r\n\r\n\r\nfor i in range(1,num):\r\n if contest[i] > max(contest[:i]) or contest[i] < min(contest[:i]):\r\n amazing += 1\r\n\r\nprint(amazing)", "from sys import stdin, stdout\r\ninput()\r\npoints = list(int(i) for i in stdin.readline().split())\r\nmxm = points[0]\r\nmnm = points[0]\r\ncount = 0\r\n\r\nfor e in points[1::]:\r\n if e > mxm:\r\n count += 1\r\n mxm = e\r\n elif e < mnm:\r\n count += 1\r\n mnm = e\r\n\r\nprint(count)", "n=int(input())\r\npoints=list(map(int,input().split()))\r\ncounter=0\r\nfor i in range(1,n):\r\n subcounter_highest=0\r\n subcounter_lowest=0\r\n for a in range(0,i):\r\n if points[i]>points[a]:\r\n subcounter_highest=subcounter_highest+1\r\n elif points[i]<points[a]:\r\n subcounter_lowest=subcounter_lowest+1\r\n if subcounter_highest==i or subcounter_lowest==i:\r\n counter=counter+1\r\nprint(counter)", "n = int(input())\r\nscores = list(map(int ,input().split()))\r\nmin_score = max_score = scores[0]\r\namazing_count = 0\r\nfor i in range(1,n):\r\n if scores[i] < min_score :\r\n min_score = scores[i]\r\n amazing_count +=1\r\n elif scores[i] > max_score :\r\n max_score = scores[i]\r\n amazing_count +=1\r\nprint(amazing_count)", "t=int(input())\r\nscore = [int(i) for i in input().split()]\r\nb = w = score[0]\r\namazing = 0\r\nfor i in score:\r\n if i > b:\r\n b = i\r\n amazing += 1\r\n elif i < w:\r\n w = i\r\n amazing +=1\r\nprint(amazing)", "n = int(input()) # Number of contests\r\npoints = list(map(int, input().split())) # Earned points\r\n\r\namazing_performances = 0 # Count of amazing performances\r\nbest_performance = points[0] # Initialize the best performance with the first contest\r\nworst_performance = points[0] # Initialize the worst performance with the first contest\r\n\r\nfor i in range(1, n):\r\n if points[i] > best_performance:\r\n best_performance = points[i]\r\n amazing_performances += 1\r\n elif points[i] < worst_performance:\r\n worst_performance = points[i]\r\n amazing_performances += 1\r\n\r\nprint(amazing_performances)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nf = 0\r\nmini, maxi = a[0], a[0]\r\nfor i in a:\r\n if i<mini:\r\n mini = i\r\n f+=1\r\n elif i>maxi:\r\n maxi = i\r\n f+=1\r\nprint(f)", "n = int(input())\n\nv = list(map(int, input().split(\" \")))\n\nsolution = 0\n\nfor i in range(1, n):\n less = greater = True\n for j in range(i):\n if (v[i] < v[j]):\n greater = False\n elif (v[i] > v[j]):\n less = False\n else:\n less = greater = False\n\n if (less or greater):\n solution += 1\n\n\nprint(solution)\n", "import sys\r\n\r\n# Define constants\r\nINF = float('inf')\r\nMOD = 10**9 + 7\r\n\r\n# Define input functions\r\ndef read_int():\r\n return int(sys.stdin.readline())\r\n\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\n\r\ndef read_str():\r\n return sys.stdin.readline().strip()\r\n\r\ndef read_strs():\r\n return list(sys.stdin.readline().split())\r\n\r\n# Define output functions\r\ndef print_yes_no(condition):\r\n print('YES' if condition else 'NO')\r\n\r\ndef print_array(arr, sep=' '):\r\n print(sep.join(map(str, arr)))\r\n\r\n\r\ndef solve():\r\n n = read_int()\r\n points = read_ints()\r\n\r\n min_points = points[0]\r\n max_points = points[0]\r\n ans = 0\r\n for i in range(1,n):\r\n if points[i] < min_points:\r\n ans += 1\r\n min_points = points[i]\r\n elif points[i] > max_points:\r\n ans += 1\r\n max_points = points[i]\r\n\r\n print(ans)\r\n\r\nif __name__ == '__main__':\r\n solve()", "num = int(input())\r\narray=list(map(int,input().split()))\r\nresult = [array[0]]\r\nbool = False\r\nbool2 = False\r\namazing = 0\r\n\r\nfor i in range(1,len(array)):\r\n for j in result:\r\n if array[i] >= j:\r\n bool = True\r\n for j in result:\r\n if array[i] <= j:\r\n bool2 = True\r\n if bool == False or bool2 == False:\r\n amazing += 1\r\n bool =False\r\n bool2=False\r\n result.append(array[i])\r\nprint(amazing)", "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 = readint()\r\n\r\na = readarray(int)\r\n\r\ncurrMin, currMax = a[0], a[0]\r\n\r\nans = 0\r\n\r\nfor i in range(1, n):\r\n if a[i] < currMin or a[i] > currMax:\r\n ans += 1\r\n currMin = min(currMin, a[i])\r\n currMax = max(currMax, a[i])\r\n\r\nprint(ans)\r\n\r\n\r\n", "n = int(input())\r\nls = list(map(int, input().split()))\r\ni = 1\r\ncount = 0\r\nmax = ls[0]\r\nmin = ls[0]\r\nwhile(i<n):\r\n if ls[i]>max:\r\n count = count + 1\r\n max = ls[i]\r\n elif ls[i]<min:\r\n count = count + 1\r\n min = ls[i]\r\n i = i + 1\r\nprint(count)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmi = l[0]\r\nma = l[0]\r\ncount = 0\r\nfor i in l:\r\n if i < mi:\r\n mi = i\r\n count += 1\r\n elif i>ma:\r\n ma = i\r\n count += 1\r\nprint(count)", "n = int(input())\r\nres = list(map(int, input().split()))\r\nmx = res[0]\r\nmn = res[0]\r\ncnt = 0\r\nfor i in range(n):\r\n if res[i] > mx:\r\n mx = res[i]\r\n cnt+=1\r\n if res[i] < mn:\r\n mn = res[i]\r\n cnt+=1\r\n\r\n\r\nprint(cnt)", "a=int(input())\r\nd=list(map(int,input().split()))\r\nk=0\r\nfor i in range(1,a):\r\n h=d[0:i]\r\n if d[i]<min(h) or d[i]>max(h):\r\n k+=1\r\nprint(k)", "\r\nn = int(input())\r\nt = input().split()\r\nc = int(t[0])\r\ns = int(t[0])\r\no = 0\r\nfor i in range(1, len(t)):\r\n k = int(t[i])\r\n if k == c:\r\n continue\r\n elif k > c:\r\n o += 1\r\n c = k\r\n elif k < s:\r\n o += 1\r\n s = k\r\n\r\nprint(o)", "chir=input()\r\nris=list(map(int,input().split()))\r\nST=0\r\nfor iOP in range(len(ris)):\r\n if iOP>0 and (ris[iOP]>max(ris[:iOP]) or ris[iOP]<min(ris[:iOP])):\r\n ST+=1\r\nprint(ST)", "count1 = 0\r\ncount2 = 0\r\na = int(input())\r\nb = list(map(int,input().split()))\r\nc = b[0]\r\nq = b[0]\r\nfor i in b:\r\n if i > c:\r\n c = i\r\n count1 += 1\r\n\r\nfor j in b:\r\n if j < q:\r\n q = j\r\n count2 += 1\r\nprint(count2 + count1)", "def amazing_performances(n, points):\r\n amazing_count = 0\r\n best_record = points[0]\r\n worst_record = points[0]\r\n\r\n for i in range(1, n):\r\n if points[i] > best_record:\r\n amazing_count += 1\r\n best_record = points[i]\r\n elif points[i] < worst_record:\r\n amazing_count += 1\r\n worst_record = points[i]\r\n\r\n return amazing_count\r\n\r\n# Reading input\r\nn = int(input().strip())\r\npoints = list(map(int, input().strip().split()))\r\n\r\n# Calculating and printing the number of amazing performances\r\nresult = amazing_performances(n, points)\r\nprint(result)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n\tif i > 0:\r\n\t\tif a[i] > max(a[:i]) or a[i] < min(a[:i]):\r\n\t\t\tans += 1\r\nprint(ans)", "n = int(input())\r\nvalues = list(map(int,input().split()))\r\nmax = values[0] \r\nmin = values[0]\r\nwonder =0\r\nfor i in values:\r\n if i > max :\r\n max = i\r\n wonder +=1\r\n if i < min :\r\n min = i\r\n wonder +=1\r\n\r\nprint(wonder)", "n = int(input())\r\nmas = list(map(int,input().split()))\r\nk = 0\r\nmn = mas[0]\r\nmx = mas[0]\r\nfor i in mas[1:]:\r\n \r\n if i > mx or i < mn:\r\n k+=1 \r\n mn = min(mn,i) \r\n mx = max(mx,i) \r\nprint(k)", "n=int(input())\r\na=list(map(int,input().split()))\r\n# print(a)\r\nx=a[:1]\r\n# print(x)\r\nfor i in a:\r\n\tn-=min(x)<=i<=max(x)\r\n\tx+=[i]\r\n# print(x)\r\nprint(n)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\nmx = points[0]\r\nmn = points[0]\r\nans = 0\r\nfor i in range(1, n):\r\n if points[i] > mx:\r\n mx = points[i]\r\n ans += 1\r\n if points[i] < mn:\r\n mn = points[i]\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nnlst=[lst[0]]\r\nc=0\r\nfor i in range(1,n):\r\n if lst[i]<min(nlst) or lst[i]>max(nlst):\r\n c+=1\r\n nlst.append(lst[i])\r\nprint(c)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = 0\r\nmaxi = a[0]\r\nmini = a[0]\r\nfor i in range(len(a)):\r\n for g in range(i):\r\n if a[i] > maxi:\r\n maxi = a[i]\r\n b += 1\r\n if a[i] < mini:\r\n mini = a[i]\r\n b += 1\r\nprint(b)", "n = int(input())\r\nlist1 = list(input().split())\r\nmin = 0\r\nmax = 0\r\ncounter = 0\r\n\r\n\r\nfor i in range(0,len(list1)):\r\n list1[i] = int(list1[i])\r\n if i ==0:\r\n min = list1[i]\r\n max = list1[i]\r\n else:\r\n if list1[i] < min:\r\n min = list1[i]\r\n counter+=1\r\n if list1[i] > max:\r\n max = list1[i]\r\n counter+=1\r\nprint(counter)\r\n", "n = int(input())\r\nlst = list(map(int, input().split(\" \")))\r\namzng = 0\r\nmn = 0\r\nmx = 0\r\nfor i in range(n):\r\n if i == 0:\r\n mn = mx = lst[i]\r\n elif lst[i] > mx:\r\n amzng += 1\r\n mx = lst[i]\r\n elif lst[i] < mn:\r\n amzng += 1\r\n mn = lst[i]\r\n\r\nprint(amzng)\r\n", "from collections import deque\r\nimport math\r\nfrom random import randint as rand\r\nfrom functools import lru_cache\r\nimport string\r\nalph_l = string.ascii_lowercase\r\nalph_u = string.ascii_uppercase\r\n\r\n\r\nsimp = [2, 3, 5, 7, 11, 13, 17, 19, 23, 29, 31, 37, 41, 43, 47]\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n\r\n max_elem, min_elem = a[0], a[0]\r\n cnt = 0\r\n for i in range(1, n, 1):\r\n if a[i] > max_elem:\r\n max_elem = a[i]\r\n cnt += 1\r\n if a[i] < min_elem:\r\n min_elem = a[i]\r\n cnt += 1\r\n print(cnt)\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nl = list(map(int, input().split()))\r\ncounter = 0\r\nsmall = l[0]\r\nbig = l[0]\r\nfor x in range(1, n):\r\n for y in range(x):\r\n if small > l[x]:\r\n small = l[x]\r\n counter = counter + 1\r\n if l[x] > big:\r\n big = l[x]\r\n counter = counter + 1\r\n\r\n\r\nprint(counter)\r\n", "x=int(input())\r\nc=0\r\ninput_str=input()\r\nmy_list = input_str.split() \r\nmy_list = [int(num) for num in my_list] \r\na=b=my_list[0]\r\nfor i in range(x):\r\n if my_list[i]>a:\r\n a=my_list[i]\r\n c+=1\r\n if my_list[i]<b:\r\n b=my_list[i]\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n", "t = int(input())\r\nl = list(map(int, input().split()))\r\nr=[]\r\nc=0\r\nfor i in l:\r\n\tif len(r)==0:\r\n\t\tr.append(i)\r\n\telse:\r\n\t\tif i not in r:\r\n\t\t\tr.append(i)\r\n\t\t\tif max(r)==i or min(r)==i:\r\n\t\t\t\tc += 1\r\nprint(c)", "n=int(input())\r\nl=input().split()\r\nlo=int(l[0])\r\nhi=int(l[0])\r\nb = 0\r\nfor i in range(1,len(l)):\r\n if int(l[i])>hi:\r\n hi=int(l[i])\r\n b+=1\r\n elif int(l[i])<lo:\r\n lo=int(l[i])\r\n b+=1\r\nprint(b)", "def solve():\r\n x = int(input())\r\n l = [int(i) for i in input().split()]\r\n mn, mx, ans = l[0], l[0], 0\r\n for i in l:\r\n if i < mn:\r\n mn = i\r\n ans += 1\r\n if i > mx:\r\n mx = i\r\n ans += 1\r\n print(ans)\r\n\r\n\r\n# t = int(input())\r\nt = 1\r\nwhile t:\r\n solve()\r\n t -= 1\r\n", "n = int(input())\r\nlista = [int(x)for x in input().split()]\r\nlistaNueva = []\r\nlistaNueva.append(lista[0])\r\ncontador = 0\r\nfor i in range(1,n):\r\n if(lista[i] > max(listaNueva)):\r\n contador+=1\r\n else:\r\n if(lista[i] < min(listaNueva)):\r\n contador+=1\r\n listaNueva.append(lista[i]) \r\nprint(contador)\r\n", "m,*p=map(int,open(0).read().split())\r\nb=p[:1]\r\nfor x in p:\r\n\tm-=min(b)<=x<=max(b)\r\n\tb+=x,\r\nprint(m)", "int(input().strip())\r\nlst = list(map(int , (input().strip().split())))\r\nmin = max = lst[0]; count = 0\r\nfor i in lst:\r\n if max < i: max = i; count += 1\r\n if min > i: min = i; count += 1\r\nprint (count)", "I, IN, M, R, LN, LS, P, S, ST, A, SO, MX, MN = int, input, map, range, len, list, print, sum, str, abs, sorted, max, min; inp = lambda: LS(M(I, IN().split()))\nn, a, s, mx, mn = I(IN()), inp(), 0, 0, 10000\nfor l in R(n): i = a[l]; s += (i > mx or i < mn) and l != 0; mx = MX(mx, i); mn = MN(mn, i);\nP(s)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[]\r\na=0\r\nfor i in range(1,n):\r\n x=l[:i+1]\r\n if(min(x)==l[i] and x.count(l[i])==1):\r\n a+=1\r\n if(max(x)==l[i] and x.count(l[i])==1):\r\n a+=1\r\nprint(a)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmi = ma = a[0]\r\nc = 0\r\nfor v in a[1:]:\r\n if v > ma:\r\n ma = v\r\n c += 1\r\n elif v < mi:\r\n mi = v\r\n c += 1\r\nprint(c)\r\n", "def main(n: int, points: list) -> int:\r\n return len([True for i in range(1, len(points)) if points[i] > max(points[:i]) or points[i] < min(points[:i])])\r\n\r\nn = int(input())\r\npoints = list(map(int, input().split()))\r\nprint(main(n, points))", "# cook your dish here\r\nn=int(input())\r\nz=list(map(int,input().split()))\r\nma,mi=z[0],z[0]\r\nam=0\r\nfor i in range(1,len(z)):\r\n if z[i]>ma:\r\n am+=1\r\n ma=z[i]\r\n elif z[i]<mi:\r\n am+=1\r\n mi=z[i]\r\nprint(am)", "n = int(input())\r\npts = list(map(int, input().split()))\r\n\r\nam = 0\r\nmip = mxp = pts[0]\r\nfor i in range(1,n):\r\n if pts[i] < mip:\r\n mip = pts[i]\r\n am += 1\r\n if pts[i] > mxp:\r\n mxp = pts[i]\r\n am += 1\r\nprint(am)", "\r\nT = int(input())\r\n\r\nline = [int(x) for x in input().strip().split()]\r\n\r\nmx , mn = line[0], line[0]\r\namazing = 0\r\nfor i in range(1, T):\r\n\tif(line[i] > mx):\r\n\t\tmx = line[i]\r\n\t\tamazing += 1\r\n\tif(line[i] < mn):\r\n\t\tmn = line[i]\r\n\t\tamazing += 1\r\nprint(amazing)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\ncount=0\r\nbest=a[0]\r\nworst=a[0]\r\nfor i in range(1,n):\r\n if a[i]>best:\r\n count+=1\r\n best=a[i]\r\n elif a[i]<worst:\r\n count+=1\r\n worst=a[i]\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nminn=a[0]\r\nmaxx=a[0]\r\nanswer=0\r\ni=1\r\nwhile i<len(a) :\r\n if a[i]>maxx :\r\n answer+=1\r\n maxx=a[i]\r\n elif a[i]<minn :\r\n answer+=1\r\n minn=a[i]\r\n i+=1\r\nprint(answer)", "_ = input()\r\n\r\nraw = input()\r\n\r\ndelim = raw.split()\r\n\r\ncontests = []\r\n\r\nfor entry in delim:\r\n\r\n contests.append(int(entry))\r\n\r\nabs_lowest = contests[0]\r\nabs_highest = contests[0]\r\n\r\ncount = 0\r\n\r\nfor i in range(1,len(contests)):\r\n\r\n if (contests[i] > abs_highest):\r\n\r\n count += 1\r\n\r\n abs_highest = contests[i]\r\n\r\n elif (contests[i] <abs_lowest):\r\n\r\n count += 1\r\n\r\n abs_lowest = contests[i]\r\n\r\nprint(count)\r\n\r\n", "n = int(input())\r\npoints = list(map(int, input().split()))\r\ncount = 0\r\nmax_point, min_point = points[0], points[0]\r\n\r\nfor i in range(1, n):\r\n if points[i] > max_point:\r\n count+=1\r\n max_point = points[i]\r\n elif points[i] < min_point:\r\n count+=1\r\n min_point = points[i]\r\n \r\nprint(count)", "n = int(input())\r\narr = list(map(int,input().split()))\r\ncount = 0\r\nmax_val = arr[0]\r\nmin_val = arr[0]\r\nfor i in range(1,n):\r\n if max_val<arr[i]:\r\n max_val = arr[i]\r\n count+=1\r\n if min_val>arr[i]:\r\n min_val = arr[i]\r\n count+=1\r\nprint(count)\r\n", "a = int(input())\r\nq = list(map(int, input().split()))\r\nmx, mn, t = q[0], q[0], 0\r\nfor i in range(1, a):\r\n if q[i] > mx:\r\n mx = q[i]\r\n t += 1\r\n if q[i] < mn:\r\n mn = q[i]\r\n t += 1\r\nprint (t)", "n = int(input())\r\n\r\nstring = input()\r\nscores = string.split()\r\nnums = [int(x) for x in scores]\r\n\r\nworst = best = nums[0]\r\n\r\nres = 0\r\n\r\nnums.pop(0)\r\nfor cur in nums:\r\n if cur > best:\r\n res += 1\r\n best = cur\r\n if cur < worst:\r\n res += 1\r\n worst = cur\r\n\r\nprint(res)", "n=int(input())\r\na=input().split()\r\nwow=0\r\nmini=0\r\nmaxi=0\r\nhm=1\r\nk=1\r\nif n>1:\r\n while int(a[0]) == int(a[k]):\r\n if k == n-1:\r\n hm=0\r\n print(0)\r\n break\r\n k+=1\r\n \r\n \r\n if int(a[0]) > int(a[k]) and hm==1:\r\n mini=a[k]\r\n maxi=a[0]\r\n wow+=1\r\n \r\n elif int(a[0]) < int(a[k]) and hm==1:\r\n mini=a[0]\r\n maxi=a[k]\r\n wow+=1\r\n \r\n for i in range(k+1,n):\r\n if int(a[i]) > int(maxi) and hm==1:\r\n wow+=1\r\n maxi=a[i]\r\n elif int(a[i]) < int(mini) and hm==1:\r\n wow+=1\r\n mini=a[i]\r\n if hm==1:\r\n print(wow)\r\nelse:\r\n print(0)\r\n \r\n", "# Problem: https://codeforces.com/problemset/problem/155/A\r\n# Answer:\r\n\r\n# The first input is the number of contests taken.\r\n# The second input is the list of contests taken.\r\n# The list contains int numbers.\r\n\r\n# If the n+1 number is strictly greater than the highest previous number or strictly lower than the lowest previous number, we add 1 to the counter.\r\n\r\n# Output the counter.\r\n\r\n# Number of rounds\r\nrounds = int(input())\r\n\r\n# Scores\r\nscores = [int(i) for i in input().split()]\r\n\r\n# Amazing Performances counter\r\ncounter = 0\r\nlowestScore = 0\r\nhighestScore = 0\r\n\r\n# Edge case: if he only takes 1 test we don't need to loop.\r\nif len(scores) == 1:\r\n print(counter)\r\n quit()\r\n\r\n# Edge case: if he takes only 2 tests and they're different, then he has at least 1 Amazing Score.\r\nif len(scores) == 2:\r\n if scores[0] != scores[1]:\r\n counter += 1\r\n print(counter)\r\n quit()\r\n else:\r\n print(counter)\r\n quit()\r\n\r\n# While loop checks the first numbers in the list for duplicates. Once it finds a difference, we assign the differing numbers to the highestScore and LowestScore variables. \r\n\r\n# We also keep track of the number of duplicates we've counted. This way, we can begin our comparison loop at that index value instead of having to recount all the numbers again.\r\ndupcounter = 0\r\ngoAhead = True\r\nwhile(goAhead):\r\n if scores[dupcounter] != scores[dupcounter + 1]:\r\n if scores[dupcounter] > scores [dupcounter +1]:\r\n highestScore = scores[dupcounter]\r\n lowestScore = scores[dupcounter + 1]\r\n counter += 1 # Add 1 to counter because num differ.\r\n goAhead = False\r\n else:\r\n highestScore = scores[dupcounter + 1]\r\n lowestScore = scores[dupcounter]\r\n counter += 1 # Add 1 to counter because num differ.\r\n goAhead = False\r\n \r\n dupcounter += 1\r\n \r\n # If none of the numbers are different, we exit the loop.\r\n if dupcounter >= len(scores)-1:\r\n goAhead = False\r\n\r\n# Here, we begin looping based on where the dupcounter stopped and proceed through the entire list. If a number is greater or less than the prior high/low score, we add 1 to the counter and adjust the highestScore or lowestScore variable.\r\ntry:\r\n for n in range(dupcounter, rounds-1):\r\n \r\n if scores[n+1] > scores[n]:\r\n if scores[n+1] > highestScore:\r\n counter += 1\r\n highestScore = scores[n+1]\r\n \r\n elif scores[n+1] < scores[n]:\r\n if scores[n+1] < lowestScore:\r\n counter += 1\r\n lowestScore = scores[n+1]\r\nexcept:\r\n pass\r\n \r\nprint(counter)\r\n", "c = int(input())\r\nl = [int(x) for x in input().split()]\r\nres = 0\r\nmax_score = l[0]\r\nmin_score = l[0]\r\n\r\nfor x in l:\r\n if x > max_score:\r\n max_score = x\r\n res += 1\r\n if x < min_score:\r\n min_score = x\r\n res += 1\r\n\r\nprint(res)\r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\nmn=a[0]\r\nmx=a[0]\r\nret=0\r\nfor i in a:\r\n if i>mx:\r\n ret+=1\r\n mx=i\r\n elif i<mn:\r\n ret+=1\r\n mn=i\r\nprint(ret)\r\n", "n = int(input())\r\n\r\nl = input().split()\r\nfor i in range(len(l)):\r\n l[i] = int(l[i])\r\n\r\nmaximum = l[0]\r\nminimum = l[0]\r\n\r\na = 0\r\nfor i in l:\r\n if i > maximum:\r\n a += 1\r\n maximum = i\r\n elif i < minimum:\r\n a += 1\r\n minimum = i\r\n\r\nprint(a)", "n=int(input())\r\nlist=list(map(int,input().split()))\r\nbest=0\r\nworst=0\r\ni=0\r\nk=0\r\nwhile i < n :\r\n if n==1 :\r\n break\r\n if i ==0 :\r\n if list[0]<list[1]:\r\n worst=list[0]\r\n best=list[1]\r\n k+=1\r\n elif list[1] < list[0]:\r\n worst = list[1]\r\n best = list[0]\r\n k+=1\r\n elif list[1]==list[0]:\r\n worst=list[1]\r\n best=list[1]\r\n else:\r\n if list[i]< worst :\r\n worst=list[i]\r\n k+=1\r\n elif list[i]> best:\r\n best=list[i]\r\n k+=1\r\n i+=1\r\n\r\nprint(k)", "# https://codeforces.com/problemset/problem/155/A\n\n# imper\n\ndef sol(l):\n res = 0\n max = l[0]\n min = l[0]\n for i in range(1, len(l)):\n if l[i] > max:\n res += 1\n max = l[i]\n elif l[i] < min:\n res += 1\n min = l[i]\n return res\n\ndef solution():\n n = int(input())\n l = [int(x) for x in input().split()]\n print(sol(l))\n\nsolution()", "n = int(input())\r\nscores = list(map(int, input().split()))\r\nmax, min, total = scores[0], scores[0], 0\r\nfor x in scores:\r\n if x > max:\r\n total += 1\r\n max = x\r\n if x < min:\r\n total += 1\r\n min = x\r\nprint(total)\r\n \r\n ", "n=int(input())\r\ns=list(map(int,input().split()))\r\nq=[]\r\nc=0\r\n\r\nq.append(s[0])\r\nfor i in s[1:]:\r\n if i>max(q) or i<min(q):\r\n c+=1\r\n q.append(i)\r\nprint(c)", "Number=int(input())\r\nlistdigit=list(map(int,input().split()))\r\ncounter=0\r\nfor i in range(1,Number):\r\n highest_count=0\r\n lowest_count=0\r\n for a in range(0,i):\r\n if(listdigit[i]>listdigit[a]):\r\n highest_count+=1\r\n elif(listdigit[i]<listdigit[a]):\r\n lowest_count+=1\r\n if(highest_count==i or lowest_count==i):\r\n counter+=1\r\nprint(counter)\r\n\r\n", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nmx, mn = mas[0], mas[0]\r\nres = 0\r\n\r\nfor i in mas:\r\n if i > mx:\r\n mx = i\r\n res += 1\r\n elif i < mn:\r\n mn = i\r\n res += 1\r\n\r\nprint(res)", "def solve():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n mi = arr[0]\r\n ma = arr[0]\r\n ans = 0\r\n for i in range(1,n):\r\n if arr[i] < mi:\r\n ans += 1\r\n mi = arr[i]\r\n elif arr[i] > ma:\r\n ans += 1\r\n ma = arr[i]\r\n print(ans)\r\n\r\n \r\nif __name__=='__main__':\r\n solve()", "n=int(input())\r\nc=0\r\na=list(map(int,input().split()))\r\nfor i in range(1,len(a)):\r\n t=a[i]\r\n g=0\r\n l=0\r\n for j in range(0,i):\r\n if(a[i]<a[j]):\r\n l+=1\r\n elif(a[i]>a[j]):\r\n g+=1\r\n if(g==i or l==i):\r\n c+=1\r\nprint(c) \r\n ", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = 0\r\nl = [a[0]]\r\nfor i in range(1,n):\r\n if a[i]>max(l) or a[i]<min(l):\r\n c += 1\r\n l.append(a[i])\r\nprint(c)\r\n \r\n", "n = int(input())\r\nc = list(map(int,input().split()))\r\ncount = 0\r\nmax = c[0]\r\nmin = c[0]\r\nfor i in range(n):\r\n if(c[i]>max):\r\n max = c[i]\r\n count += 1\r\n if(c[i]<min):\r\n min = c[i]\r\n count += 1 \r\nprint(count) ", "n = int(input())\r\nscores = list(map(int, input().split()))\r\nresult = 0\r\nif len(scores) == 0:\r\n print(0)\r\nelse:\r\n min = max = scores[0]\r\n for score in scores:\r\n if(score < min):\r\n min = score\r\n result += 1\r\n elif(score > max):\r\n max= score\r\n result += 1\r\n print(result)", "def get_amazing_perfs(scores):\r\n min_score = scores[0]\r\n max_score = scores[0]\r\n amazing_perfs = 0\r\n for i in scores[1:]:\r\n if i < min_score:\r\n min_score = i\r\n amazing_perfs += 1\r\n elif i > max_score:\r\n max_score = i\r\n amazing_perfs += 1\r\n return amazing_perfs\r\n\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n scores = list(map(int, input().strip().split()))\r\n print(get_amazing_perfs(scores))", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nm1=l[0]\r\nm2=l[0]\r\nfor i in l:\r\n if i > m1:\r\n c+=1\r\n m1=i\r\n if i<m2:\r\n c+=1\r\n m2=i\r\nprint(c)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nmax=arr[0]\r\nmin=arr[0]\r\ncount=0\r\nfor x in range(1,len(arr)):\r\n if arr[x] > max:\r\n max=arr[x]\r\n count+=1\r\n elif arr[x]<min:\r\n min=arr[x]\r\n count+=1\r\nprint(count)\r\n ", "n = input()\r\nl = map(int, input().split())\r\nl = [e for e in l]\r\nhighest = l[0]\r\nlowest = l[0]\r\nc = 0\r\nfor e in l:\r\n if e > highest:\r\n highest = e\r\n c += 1\r\n elif e < lowest:\r\n lowest = e\r\n c += 1\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nm=l[0]\r\na=l[0]\r\ncnt=0\r\nfor i in range (1,n):\r\n if l[i]>m:\r\n m=l[i]\r\n cnt+=1\r\n elif l[i]<a:\r\n a=l[i]\r\n cnt+=1\r\nprint(cnt)", "s=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,s):\r\n if l[i]<min(l[0:i]) or l[i]>max(l[0:i]):c+=1\r\nprint(c)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncount = 0 \r\nbest , worst = arr[0] , arr[0]\r\nfor i in arr :\r\n if i > best :\r\n best = i \r\n count += 1\r\n elif i < worst :\r\n worst = i \r\n count += 1\r\nprint(count)\r\n", "\r\nn= int(input())\r\nponits= list(map(int, input().split()))[:n]\r\ncount=0\r\nmax=ponits[0]\r\nmin=ponits[0]\r\n\r\nfor i in range(n):\r\n if ponits[i]>max:\r\n max=ponits[i]\r\n count+=1\r\n if ponits[i]<min:\r\n min=ponits[i]\r\n count+=1\r\nprint(count)", "n = int(input())\r\na = list(map(int,input().split()))\r\nc = int(\"0\")\r\nmax = a[0]\r\nmin = a[0]\r\n\r\nfor i in range(n):\r\n if a[i]> max:\r\n c += 1\r\n max = a[i]\r\n if a[i] < min:\r\n c += 1\r\n min = a[i]\r\n\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\nbig, small, ans = a[0],a[0],0\r\nfor i in a:\r\n if i > big:\r\n big = i\r\n ans+=1\r\n if i < small:\r\n small = i\r\n ans+=1\r\nprint(ans)", "def brute_force(score):\n amaz = 0\n prev = score[0]\n max = prev\n min = prev\n for x in score[1:]:\n if x > max : \n max = x\n amaz += 1\n if x < min :\n min = x\n amaz += 1\n prev = x\n return amaz\n\nn = int(input())\nscore = [int(e) for e in input().split()]\nprint(brute_force(score))\n", "n = int(input())\r\nscore = list(map(int,input().split()))\r\nmax = score[0]\r\nmin = score[0]\r\ncount = 0\r\nfor i in range(1,n):\r\n if score[i]>max:\r\n max = score[i]\r\n count = count+1\r\n elif score[i]<min:\r\n min = score[i]\r\n count = count+1\r\nprint(count)", "import sys\r\n\r\ndef read_int():\r\n return int(sys.stdin.readline().strip())\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\ndef write(data) -> None:\r\n sys.stdout.write(str(data) + \"\\n\")\r\n sys.stdout.flush()\r\n\r\ndef main():\r\n n=read_int()\r\n arr=read_ints()\r\n\r\n min, max=arr[0], arr[0]\r\n am=0\r\n\r\n for i in arr:\r\n if i<min:\r\n am+=1\r\n min=i\r\n if i>max:\r\n am+=1\r\n max=i\r\n\r\n write(am)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n):\r\n if p[i]>max(p[:i]) or p[i]<min(p[:i]):\r\n c+=1\r\nprint(c)\r\n#para de sapear mis codigos, sapo", "total = int(input())\r\nlist = input().split()\r\nif total == 1:\r\n print(0)\r\nelse:\r\n min = list[0]\r\n max = list[0]\r\n count = 0\r\n for i in list:\r\n if int(i) > int(max):\r\n max = i\r\n count += 1\r\n if int(i) < int(min):\r\n min = i\r\n count += 1\r\n print(count)", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\nmx=a[0]\r\nmn=a[0]\r\ny=0\r\nfor i in range(1,n):\r\n if a[i]>mx:\r\n mx=a[i]\r\n y+=1\r\n if a[i]<mn:\r\n mn=a[i]\r\n y+=1\r\nprint(y)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nb,w,s=l[0],l[0],0\r\nfor i in range(1,n):\r\n if l[i]<w or l[i]>b:\r\n if l[i]<w:\r\n w=l[i]\r\n elif l[i]>b:\r\n b=l[i]\r\n s+=1\r\nprint(s)", "count =0\r\nnum = int(input())\r\ndata = input().split()\r\nmin = int(data[0])\r\nmax = int(data[0])\r\nfor i in range(1,num):\r\n if((int(data[i])>max) | (int(data[i])<min)):\r\n if (int(data[i])>max):\r\n max = int(data[i])\r\n else :\r\n min = int(data[i])\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\nscores=list(map(int,input().split()))\nc=[scores[0]]\namazing=0\nfor x in range (1,n):\n listmax=max(c)\n listmin=min(c)\n c.append(scores[x])\n if c[x]>listmax or c[x]<listmin:\n amazing+=1\n\nprint(amazing)", "n=int(input())\r\nread=input().split()\r\nfor i in range(len(read)):\r\n read[i]=int(read[i])\r\nmax=read[0]\r\nmin=read[0]\r\ncount=0\r\nfor i in read:\r\n if(i>max):\r\n max=i\r\n count+=1\r\n elif(i<min):\r\n min=i\r\n count+=1\r\nprint(count)", "n = int(input())\nnums = [int(i) for i in input().split()]\nmin_val, max_val = nums[0], nums[0]\nc = 0\nfor i in nums[1:]:\n if i<min_val:\n c += 1\n min_val = i\n if i>max_val:\n c += 1\n max_val = i\nprint(c)", "#!/usr/bin/env python3\r\n\r\nimport sys\r\nimport math\r\nimport string\r\n\r\nsys.setrecursionlimit(10**6)\r\n\r\nMOD = int(1e9) + 7\r\nINF = int(1e9)\r\nEPS = 1e-9\r\n\r\n# lowercase = string.ascii_lowercase\r\n# uppercase = string.ascii_uppercase\r\n# digits = string.digits\r\n\r\ndef read_int() -> int:\r\n return int(sys.stdin.readline().strip())\r\ndef read_ints() -> list:\r\n return list(map(int, sys.stdin.readline().split()))\r\ndef read_float() -> float:\r\n return float(input().strip())\r\ndef read_floats() -> map:\r\n return map(float, input().split())\r\ndef read_str() -> str:\r\n return sys.stdin.readline().strip()\r\ndef write(data) -> None:\r\n sys.stdout.write(str(data) + \"\\n\")\r\n sys.stdout.flush()\r\ndef write_array(arr:list, sep=\" \") -> None:\r\n\tfor i in arr:\r\n\t\tsys.stdout.write(str(i) + sep)\r\n\tsys.stdout.write(\"\\n\")\r\n\tsys.stdout.flush()\r\n\r\n# .--. -.-- - .... --- -. ...-- / - . -- .--. .-.. .- - .\r\n\r\nn=read_int()\r\narr=read_ints()\r\n\r\nmin, max=arr[0], arr[0]\r\nam=0\r\n\r\nfor i in arr:\r\n if i<min:\r\n am+=1\r\n min=i\r\n if i>max:\r\n am+=1\r\n max=i\r\n\r\nwrite(am)", "a = int(input())\r\ns = [int(i) for i in input().split()]\r\nl = [s[0]]\r\ncnt = 0\r\nfor i in s:\r\n if(i < min(l)) | (i > max(l)):\r\n cnt += 1\r\n l.append(i)\r\nprint(cnt)\r\n", "n = int(input())\r\nN = list(map(int, input().split(maxsplit=n)))\r\n\r\nMin = N[0]\r\nMax = N[0]\r\nans = 0\r\n\r\nfor i in N:\r\n if i < Min and Max != i:\r\n Min = i\r\n ans += 1\r\n \r\n elif i > Max and Min != i:\r\n Max = i\r\n ans += 1\r\n \r\nprint(ans)", "n=int(input())\r\nnum=input().split()\r\n\r\nbig=int(num[0])\r\nsmall=int(num[0])\r\nflag=0\r\n\r\nfor i in range(1,n):\r\n if int(num[i])>big:\r\n big=int(num[i])\r\n flag+=1\r\n elif int(num[i])<small:\r\n small=int(num[i])\r\n flag+=1\r\nprint(flag)", "n = int(input())\r\narr = list(map(int, input().split(\" \")))\r\nbest = worst = arr[0]\r\ncount = 0\r\n\r\nfor i in arr:\r\n if worst > i:\r\n count+=1\r\n worst = i\r\n if best < i :\r\n count+=1\r\n best = i\r\nprint(count)\r\n\r\n# print(arr)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\ncounter = 0\r\n\r\nfor i in range(1,n):\r\n subcount_high = 0\r\n subcount_low = 0\r\n for a in range(0,i):\r\n if points[i] > points[a]:\r\n subcount_high = subcount_high + 1\r\n \r\n elif points[i] < points[a]:\r\n subcount_low = subcount_low + 1\r\n \r\n if subcount_high == i or subcount_low == i:\r\n counter = counter + 1\r\n \r\nprint(counter)", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nnums = list(map(int, input().split()))\r\n\r\n_min = _max = nums[0]\r\nans = 0\r\nfor i in range(1, n):\r\n ans += nums[i] < _min or nums[i] > _max\r\n _max = max(_max, nums[i])\r\n _min = min(_min, nums[i])\r\n \r\nprint(ans)\r\n", "a=int(input())\r\nl=list(map(int,input().split()))\r\nmin=0\r\nmax=0\r\nc=0\r\nfor i in range(len(l)):\r\n if i==0:\r\n min,max=l[i],l[i]\r\n else:\r\n if l[i]>max:\r\n max=l[i]\r\n c+=1\r\n if l[i]<min:\r\n min=l[i]\r\n c+=1\r\nprint(c)", "first = int(input())\r\npoints = list(map(int, input().split()))\r\nwincount = 0\r\nminscore = maxscore = points[0]\r\n\r\nfor _ in points[1:]:\r\n if _ > maxscore:\r\n wincount += 1\r\n maxscore = _\r\n elif _ < minscore:\r\n wincount += 1\r\n minscore = _\r\n\r\nprint(wincount)\r\n", "n=int(input())\r\nls=list(map(int,input().rstrip().split()))\r\nminn=10e5\r\na=0\r\nmaxx=0\r\nb=0\r\nc=0\r\nfor i in ls:\r\n if(maxx<i):\r\n maxx=i\r\n a=a+1\r\n if(minn>i):\r\n minn=i\r\n b=b+1\r\nc=a+b-2\r\nif(a+b==n and maxx!=minn):\r\n print(n-1)\r\nelse:\r\n if(c<0 ):\r\n print(0)\r\n else:\r\n print(c)", "from math import factorial\nfrom math import log\n\n\ndef aProblem01():\n pass\n\n\ndef bProblem02():\n n = int(input())\n print(chr(n))\n\n\ndef cProblem03():\n abc = list(map(int, input().split()))\n b = abc[1]\n abc.sort()\n\n if abc[1] == b:\n print(\"Yes\")\n else:\n print(\"No\")\n\n\ndef dProblem04():\n n = input()\n print(n[-2:])\n\n\ndef eProblem05():\n r, c = map(int, input().split())\n m1 = list(map(int, input().split()))\n m2 = list(map(int, input().split()))\n print([m1,m2][r-1][c-1])\n\n\ndef gProblem07():\n n = int(input())\n print(1)\n for i in range(1, n):\n for j in range(i + 1):\n if i == j:\n print(factorial(i) // (factorial(j) * factorial(i - j)))\n else:\n print(factorial(i) // (factorial(j) * factorial(i - j)), end=\" \")\n\n\ndef iProblem09():\n s = input()\n print(\"{0}{1}{2}\".format(s[0], len(s)-2, s[-1]))\n\n\ndef jProblem10():\n n = int(input())\n count = 1\n while count * 2 <= n:\n count *= 2\n print(count)\n\n\ndef kProblem11():\n _ = input()\n print(25)\n\n\ndef lProblem12():\n n = int(input())\n if n % 5 == 0:\n print(n//5)\n else:\n print((n//5)+1)\n\n\ndef mProblem13():\n w = int(input())\n if w % 2 == 0 and w > 2:\n print(\"YES\")\n else:\n print(\"NO\")\n\n\ndef nProblem14():\n while True:\n a, b = map(int, input().split())\n print(abs(b-a))\n\n\ndef oProblem15():\n n = int(input())\n points = list(map(int, input().split()))\n\n minPoint = points[0]\n maxPoint = points[0]\n count = 0\n\n for point in points:\n\n if point < minPoint:\n minPoint = point\n count += 1\n\n if point > maxPoint:\n maxPoint = point\n count += 1\n\n print(count)\n\n\ndef rProblem18():\n car = input()\n carMembers = list(map(int, input().split()))\n totalMembers = sum(carMembers)\n if totalMembers % 5 == 0:\n print(totalMembers//5)\n else:\n print((totalMembers//5)+1)\n\n\ndef sProblem19():\n for _ in range(int(input())):\n n = int(input())\n print(int(n**0.5))\n\n\ndef tProblem20():\n x, y, n = map(int, input().split())\n for i in range(1, n+1):\n if i % x == 0 and i % y == 0:\n print(\"FizzBuzz\")\n elif i % x == 0:\n print(\"Fizz\")\n elif i % y == 0:\n print(\"Buzz\")\n else:\n print(i)\n\n\ndef vProblem22():\n for i in range(int(input())):\n _ = input()\n n = int(input())\n dust = list(map(int, input().split()))\n dsCount = 0\n for ds in dust:\n if ds > 0:\n dsCount += ds\n print(\"Case {0}:\".format(i+1), dsCount)\n\n\nif __name__ == '__main__':\n # aProblem01()\n # bProblem02()\n # cProblem03()\n # dProblem04()\n # eProblem05()\n # gProblem07()\n # iProblem09()\n # jProblem10()\n # kProblem11()\n # lProblem12()\n # mProblem13()\n # nProblem14()\n oProblem15()\n # rProblem18()\n # sProblem19()\n # tProblem20()\n # vProblem22()\n\n\t\t\t\t\t \t \t \t \t\t \t\t\t\t \t\t", "n = int(input())\na = [int(i) for i in input().split()]\nmn= a[0]\nmx = a[0]\namazing = 0\nfor i in range(1 , n):\n if a[i] < mn:\n amazing += 1\n mn = a[i]\n if a[i] > mx:\n amazing += 1\n mx = a[i]\nprint(amazing)\n\t\t\t \t \t \t\t \t \t \t\t\t\t \t\t\t", "a = int(input())\r\nscores = input().split()\r\nL = []\r\ncounter = -1\r\nfor i in range(a):\r\n B = 0\r\n M = 0\r\n for Q in L:\r\n if Q > int(scores[i]):\r\n B += 1\r\n if Q < int(scores[i]):\r\n M += 1\r\n if B == i or M == i:\r\n counter += 1\r\n L.insert(i, int(scores[i]))\r\nprint(counter)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmin = 0\r\nmax = 0\r\nevents = 0\r\n\r\nfor i in range(n):\r\n if i == 0:\r\n min = lst[i]\r\n max = lst[i]\r\n else:\r\n if lst[i] < min:\r\n min = lst[i]\r\n events += 1\r\n elif lst[i] > max:\r\n max = lst[i]\r\n events += 1\r\n\r\nprint(events)\r\n", "n=int(input())\r\ndata = list(map(int, input().split()))\r\nmi = data[0]\r\nma = data[0]\r\nres = 0\r\nfor x in data:\r\n if x > ma:\r\n ma = x\r\n res += 1\r\n elif x < mi:\r\n mi = x\r\n res += 1\r\nprint(res)\r\n'''\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nc = 0\r\nminm = 0\r\nmaxi = 0\r\nif n <= 1:\r\n print(0)\r\nelse:\r\n for i in range(1):\r\n if l[i] < l[i + 1]:\r\n minm = l[i]\r\n maxi = l[i+1]\r\n c +=1\r\n elif l[i] > l[i + 1]:\r\n minm = l[i+1]\r\n maxi = l[i]\r\n c +=1 \r\n elif l[i] == l [i+1]:\r\n minm = l[i+1]\r\n maxi = l[i]\r\n for x in range(2,len(l)):\r\n if l[x] > maxi:\r\n maxi = l[x]\r\n c += 1\r\n elif l[x] < minm:\r\n minm = l[x]\r\n c += 1\r\n else:\r\n continue\r\n print(c)\r\n'''", "def main():\n n = int(input())\n count = 0\n s = [int(i) for i in input().split()]\n mn = s[0]\n mx = s[0]\n s = s[1:]\n for i in s:\n if i < mn or i > mx:\n count += 1\n mn = min(mn, i)\n mx = max(mx, i)\n print(count)\n\n\n\nif __name__ == '__main__':\n main()\n", "\r\n\r\nn = int(input())\r\n\r\np = list(map(int, input().split()))\r\n\r\nbest = p[0]\r\nworst = p[0]\r\nres = 0\r\n\r\nfor i in range(1, n):\r\n if p[i]<worst:\r\n worst = p[i]\r\n res+=1\r\n if p[i]>best:\r\n best = p[i]\r\n res+=1\r\n\r\nprint(res)\r\n", "\r\nn = int(input())\r\ncontests = list(map(int, input().split()))\r\nbest = contests[0]\r\nworst = contests[0]\r\ncount = 0\r\n\r\nfor idx, score in enumerate(contests, start=1):\r\n if score > best:\r\n best = score\r\n count += 1\r\n elif score < worst:\r\n worst = score\r\n count += 1\r\n\r\nprint(count)", "def performances(scores):\r\n amazing = 0\r\n for i in range(1,len(scores)):\r\n if min(scores[0:i]) > scores[i] or max(scores[0:i]) < scores[i]:\r\n amazing += 1\r\n return amazing\r\n\r\nevents = int(input())\r\nprint(performances([int(n) for n in input().split()]))", "n = int(input())\r\npoints = list(map(int, input().split()))\r\ncounter =0\r\nfor i in range(1,n):\r\n subcounter_highest=0\r\n subcounter_lowest =0\r\n for a in range(0,i):\r\n if points[i] > points[a]:\r\n subcounter_highest = subcounter_highest + 1\r\n elif points[i] < points[a]:\r\n subcounter_lowest = subcounter_lowest + 1\r\n if subcounter_highest == i or subcounter_lowest == i:\r\n counter = counter + 1\r\nprint(counter)\r\n", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\ncount = 0\r\nmaxik = arr[0]\r\nminik = arr[0]\r\nfor i in range(1, n):\r\n if arr[i] > maxik:\r\n count += 1\r\n maxik = arr[i]\r\n continue\r\n elif arr[i] < minik:\r\n count += 1\r\n minik = arr[i]\r\n continue\r\n \r\nprint(count)", "n = int(input())\r\npuntos = list(map(int,input().split()))\r\n\r\npuntos_max = puntos[0]\r\npuntos_menores = puntos[0]\r\ncont = 0\r\n\r\nfor i in range(1,n):\r\n if puntos[i] < puntos_menores:\r\n puntos_menores = puntos[i]\r\n cont += 1\r\n elif puntos[i] > puntos_max:\r\n puntos_max = puntos[i]\r\n cont +=1\r\n\r\n\r\nprint(cont)", "# -*- coding: utf-8 -*-\n\"\"\"Funny Forces Attempt 630A\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/1ACc0-lS8jHSfydnEY6q0Yncu5cV7TCkM\n\"\"\"\n\nx = input()\ny = input().split(' ')\n\nhigh = int(y[0])\nlow = int(y[0])\namazing = 0\nfor number in y:\n if int(number) > high:\n high = int(number)\n amazing +=1\n if int(number) < low:\n low = int(number)\n amazing +=1\n else:\n continue\nprint(amazing)", "n=int(input(\"\"))\r\na=input().split()\r\na=[int(i) for i in a]\r\ncount=0\r\nmin1=a[0]\r\nmax1=a[0]\r\nfor i in range(1,n):\r\n if max1<a[i]:\r\n count=count+1\r\n max1=a[i]\r\n elif min1>a[i]:\r\n count=count+1\r\n min1=a[i]\r\nprint(count)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmin_val = arr[0]\r\nmax_val = arr[0]\r\nsum_val = 0\r\n\r\nfor i in range(1, n):\r\n if arr[i] < min_val:\r\n min_val = arr[i]\r\n sum_val += 1\r\n elif arr[i] > max_val:\r\n max_val = arr[i]\r\n sum_val += 1\r\n\r\nprint(sum_val)", "n = int(input())\npoints = list(map(int, input().split()))\n\ncb = points[0]\ncw = points[0]\nam_p = []\n\nfor i in range(1, n):\n\tif points[i] < cw:\n\t\tcw = points[i]\n\t\tam_p.append(points[i])\n\telif points[i] > cb:\n\t\tcb = points[i]\n\t\tam_p.append(points[i])\n\nprint(len(am_p))\n \t \t\t\t\t \t\t\t \t \t\t \t \t\t\t", "ans=0\r\n\r\nx=int(input())\r\ny=list(map(int,input().split()))\r\n\r\nj=y[0] # smallest\r\nk=y[0] # biggest\r\n\r\ny.pop(0)\r\n\r\nfor a in y:\r\n if a<j:\r\n j=a\r\n ans=ans+1\r\n elif a>k:\r\n k=a\r\n ans=ans+1\r\n\r\nprint(ans)", "a=int(input())\r\nl=list(map(int,input().split()))\r\ncount = 0\r\nmn,mx = l[0],l[0]\r\nfor i in range(1,a):\r\n if l[i]>mx:\r\n count+=1\r\n mx=l[i]\r\n if l[i]<mn:\r\n count+=1\r\n mn=l[i]\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nk=a[0]\r\nl=a[0]\r\nc=0\r\n \r\n \r\nfor i in range(1,n):\r\n \r\n \r\n if(a[i]>k):\r\n \r\n \r\n k=a[i]\r\n c=c+1\r\n \r\n \r\n elif(a[i]<l):\r\n \r\n \r\n l=a[i]\r\n c=c+1\r\n \r\n \r\nprint(c)\r\n", "from sys import stdin, stdout\r\n\r\nnumberOfContests = int(stdin.readline())\r\ncontests_performance = list(map(int, stdin.readline().split()))\r\ncurrent_max_performance = contests_performance.pop(0)\r\ncurrent_min_performance = current_max_performance\r\namazing_points = 0\r\nfor _ in contests_performance:\r\n if _ > current_max_performance:\r\n current_max_performance = _\r\n amazing_points += 1\r\n elif _ < current_min_performance:\r\n current_min_performance = _\r\n amazing_points += 1\r\nstdout.write(str(amazing_points))", "n, cnt = int(input()), 0\r\narr = list(map(int, input().split())) \r\nmn = mx = arr[0]\r\n\r\nfor i in range(len(arr)):\r\n if arr[i] > mx:\r\n mx = arr[i]\r\n cnt += 1\r\n elif arr[i] < mn:\r\n mn = arr[i]\r\n cnt += 1\r\n\r\nprint(cnt)", "t = int(input())\r\nn = list(map(int, input().split()))\r\nlt = n[0]\r\nlb = n[0]\r\na = 0\r\nfor i in n:\r\n if i > lt:\r\n a += 1\r\n lt = i\r\n elif i < lb:\r\n a += 1\r\n lb = i\r\n\r\nprint(a)\r\n", "def amazing_numbers(amount, numbers):\r\n\r\n maxx = numbers[0]\r\n minn = numbers[0]\r\n total = 0\r\n\r\n for number in range(1, amount):\r\n\r\n if numbers[number] > maxx:\r\n\r\n maxx = numbers[number]\r\n total += 1\r\n\r\n elif numbers[number] < minn:\r\n\r\n minn = numbers[number]\r\n total += 1\r\n \r\n return(total)\r\n\r\na = int(input())\r\nn = list(map(int, input(). split()))\r\nprint(amazing_numbers(a, n))\r\n", "n=int(input())\r\nk=list(map(int, input().split()))\r\nc=0\r\nm=k[0]\r\nl=k[0]\r\nfor i in range(1,n):\r\n if k[i]>m:\r\n m=k[i]\r\n c+=1\r\n if k[i]<l:\r\n l=k[i]\r\n c+=1\r\nprint(c)", "def read_int():\r\n return int(input())\r\n\r\ndef read_array():\r\n return list(map(int, input().split()))\r\n \r\n\r\nn = read_int()\r\na = read_array()\r\nmx, mn = a[0], a[0]\r\nans = 0\r\nfor i in range(1, n):\r\n if a[i] > mx:\r\n ans += 1\r\n mx = a[i]\r\n if a[i] < mn:\r\n ans += 1\r\n mn = a[i]\r\n\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nmn = a[0]\r\nmx = a[0]\r\nans = 0\r\nfor i in range(1, n):\r\n if a[i] < mn:\r\n ans += 1\r\n mn = a[i]\r\n elif a[i] > mx:\r\n ans += 1\r\n mx = a[i]\r\nprint(ans)", "x=int(input())\r\narr=list(map(int,input().split()))\r\nl=[]\r\nc=0\r\nl.append(arr[0])\r\nfor i in range(1,len(arr)):\r\n if arr[i]>max(l) or arr[i]<min(l):\r\n c+=1 \r\n l.append(arr[i])\r\nprint(c)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmini, maxi = l[0], l[0]\r\nans = 0\r\n\r\nfor i in range(1,n):\r\n if l[i] < mini:\r\n ans += 1\r\n mini = l[i]\r\n elif l[i] > maxi:\r\n ans += 1\r\n maxi = l[i]\r\n\r\nprint(ans)", "n=int(input()) \r\nl=list(map(int,input().split())) \r\nminimum=l[0] \r\nmaximum=l[0] \r\ncnt=0\r\nfor i in range(1,n):\r\n if(l[i]>maximum or l[i]<minimum):\r\n cnt+=1 \r\n if(l[i]>maximum):\r\n maximum=l[i] \r\n elif(l[i]<minimum):\r\n minimum=l[i]\r\nprint(cnt)\r\n \r\n \r\n ", "n = int(input())\r\nscores = list(map(int,input().split()))\r\nbest = scores[0]\r\nworst = scores[0]\r\namazing = 0\r\nfor score in scores:\r\n if score > best:\r\n amazing += 1\r\n best = score\r\n if score < worst:\r\n amazing += 1\r\n worst = score\r\nprint(amazing)", "def count_amazing_performances(n, points):\n amazing_count = 0\n best_record = worst_record = points[0]\n\n for i in range(1, n):\n if points[i] > best_record:\n best_record = points[i]\n amazing_count += 1\n elif points[i] < worst_record:\n worst_record = points[i]\n amazing_count += 1\n\n return amazing_count\n\nif __name__ == \"__main__\":\n # Read input\n n = int(input())\n points = list(map(int, input().split()))\n\n result = count_amazing_performances(n, points)\n print(result)\n \t\t \t\t \t \t \t \t \t \t \t \t \t\t \t", "n = int(input())\n\nf = list(map(int, input().split()))\n\nmax = f[0]\nmin = f[0]\ncount = 0\n\nfor i in f:\n if i > max:\n count+=1\n max = i\n elif i < min:\n count+=1\n min = i\n\nprint(count)", "n=int(input())\r\nm=list(map(int,input().split()))\r\nma=0\r\nmi=m[0]\r\nl=0\r\nfor i in range(1,n):\r\n if m[0]<m[i] and ma<m[i]:\r\n l+=1\r\n ma=m[i]\r\n elif m[0]>m[i] and mi>m[i]:\r\n l+=1\r\n mi=m[i]\r\n \r\nprint(l)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmin = l[0]\r\nmax = l[0]\r\ncount = 0\r\nfor i in l:\r\n if i < min:\r\n count += 1\r\n min = i\r\n if i > max:\r\n count += 1\r\n max = i\r\n\r\nprint(count) \r\n ", "c = 0\r\nn = int(input())\r\nv = [int(x) for x in input().split()]\r\nf = v[0]\r\nl, h = f, f\r\nfor i in v[1:]:\r\n if i < l or i > h:\r\n # print(i,l,h)\r\n c += 1\r\n h = max(h, i)\r\n l = min(l, i)\r\n\r\nprint(c)", "n=int(input())\r\narr=[int(x) for x in input().split()]\r\narr1=[]\r\narr1.append(arr[0])\r\nc=0\r\nfor i in range(1,n):\r\n if arr[i]>max(arr1) or arr[i]<min(arr1):\r\n c+=1\r\n arr1.append(arr[i])\r\n\r\nprint(c)\r\n ", "p,*a=map(int,open(0).read().split())\nb=a[:1]\nfor x in a:\n\tp-=min(b)<=x<=max(b)\n\tb+=x,\nprint(p)\n\t\t \t\t\t \t\t\t\t\t \t \t\t \t\t \t \t \t", "\r\nn = int(input())\r\n\r\npoints = list(map(int, input().split()))\r\nsume = 0\r\nmay = 0\r\nmen = 0\r\nc = 0\r\nres = 0\r\nfor p in points:\r\n sume += p\r\n if(c > 0):\r\n if(p > may):\r\n may = p\r\n res += 1\r\n elif(p < men):\r\n men =p\r\n res += 1\r\n else:\r\n may = p\r\n men = p\r\n c += 1\r\n \r\n\r\nprint(res)", "n=int(input())\r\nz=[int(i) for i in input().split()]\r\nl=z[0]\r\nh=z[0]\r\nc=[]\r\nfor i in z:\r\n if i < l:\r\n l=i\r\n c.append(l)\r\n elif i>h:\r\n h=i\r\n c.append(h)\r\nc=set(c)\r\nprint(len(c))", "n = int(input())\r\nspp = list(map(int,input().split()))\r\nsp = spp[:1]\r\nc = 0\r\nfor i in spp:\r\n\tc += min(sp) <= i <= max(sp)\r\n\tsp += [i]\r\nans = n - c\r\nprint(ans)\r\n\r\n", "n = int(input())\r\na =list(map(int , input().split()))\r\nans = 0\r\nfor i in range(1 ,n):\r\n a1 = a[0 : i]\r\n a1.sort()\r\n if(a[i] < a1[0]):\r\n ans += 1\r\n if(a[i] > a1[i-1]):\r\n ans += 1\r\nprint(ans)", "# Input the number of contests\r\nn = int(input())\r\n\r\n# Input the list of earned points\r\npoints = list(map(int, input().split()))\r\n\r\n# Initialize variables to keep track of the best and worst performances and the count of amazing performances\r\nbest_performance = worst_performance = points[0]\r\namazing_count = 0\r\n\r\n# Iterate through the earned points starting from the second contest\r\nfor i in range(1, n):\r\n if points[i] > best_performance:\r\n best_performance = points[i]\r\n amazing_count += 1\r\n elif points[i] < worst_performance:\r\n worst_performance = points[i]\r\n amazing_count += 1\r\n\r\n# Print the count of amazing performances\r\nprint(amazing_count)\r\n", "n = int(input())\r\nf = input().split()\r\nminu = int(f[0])\r\nmaxu = int(f[0])\r\nwow = 0\r\nfor i in range(n):\r\n f[i] = int(f[i])\r\n if f[i] > maxu:\r\n maxu = f[i]\r\n wow += 1\r\n if f[i] < minu:\r\n minu = f[i]\r\n wow += 1\r\nprint(wow)", "n = int(input())\r\nnum = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,n):\r\n if (min(num[:i+1]) == num[i] or max(num[:i+1]) == num[i]) and num[:i+1].count(num[i]) == 1: \r\n count += 1\r\nprint(count) \r\n ", "n = int(input())\r\ndata = input().split()\r\na = [int(data[0])]\r\ncount = 0\r\nfor i in data:\r\n i = int(i)\r\n if i > max(a) or i < min(a):\r\n count += 1\r\n a.append(i)\r\nprint(count)", "n = int(input())\r\na = list(map(int,input().split()))\r\nk=0\r\nmx=a[0]\r\nmn=a[0]\r\nfor i in a:\r\n if i>mx:\r\n mx=i\r\n k+=1\r\n elif i<mn:\r\n mn=i\r\n k+=1\r\nprint(k)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmax = a[0]\r\nmin = a[0]\r\namz = 0\r\nfor i in range(1,n):\r\n if(a[i] > max):\r\n max = a[i]\r\n amz += 1\r\n elif(a[i] < min):\r\n min = a[i]\r\n amz += 1\r\nprint(amz)", "input()\r\na = list(map(int, input().split(\" \")))\r\nminimum = a[0]\r\nmaximum = a[0]\r\nrs = 0\r\nfor i in range(1, len(a)):\r\n if a[i] > maximum:\r\n rs += 1\r\n maximum = a[i]\r\n if a[i] < minimum:\r\n rs += 1\r\n minimum = a[i]\r\nprint(rs)\r\n", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlow=list1[0]\r\nhigh=list1[0]\r\namazing=0\r\nfor i in range(0,len(list1)):\r\n if list1[i]>high:\r\n high=list1[i]\r\n amazing+=1\r\n else:\r\n if list1[i]<low:\r\n low=list1[i]\r\n amazing+=1\r\nprint(amazing)\r\n\r\n \r\n", "n=int(input())\nl=[int(x) for x in input().split()]\nscores=[]\nscores.append(l.pop(0))\namazing_performances=0\nfor i in range(len(l)):\n if l[i]< min(scores) or l[i]>max(scores):\n amazing_performances+=1\n scores.append(l[i])\nprint(amazing_performances)", "n=int(input())\r\npoints=list(map(int,input().split(' ')))\r\nmin_score=points[0]\r\nmax_score=points[0]\r\ncount=0\r\nfor i in range (n):\r\n if max_score<points[i]:\r\n count+=1\r\n max_score=points[i]\r\n elif min_score > points[i]:\r\n count+=1\r\n min_score=points[i]\r\nprint(count)", "l = int(input())\r\nn = list(map(int, input().split()))\r\nmin, max, res = n[0], n[0], 0\r\nfor i in n:\r\n if min > i:\r\n res += 1\r\n min = i\r\n if max < i:\r\n res += 1\r\n max = i\r\nprint(res)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nk,m,n=0,a[0],a[0]\r\nfor i in range(len(a)):\r\n if a[i]>m:\r\n k+=1\r\n m=a[i]\r\n elif a[i]<n:\r\n k+=1\r\n n=a[i]\r\nprint(k)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n# print(arr)\r\nmax = 0\r\nmin = 1000000000000\r\nans = 0\r\nfor i in range(n):\r\n if arr[i] > max:\r\n max = arr[i]\r\n if i != 0:\r\n ans += 1\r\n if arr[i] < min:\r\n min = arr[i]\r\n if i != 0:\r\n ans += 1\r\nprint(ans)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nc=0\r\nfor i in range(1,n):\r\n if l[i] > max(l[:i]) or l[i] < min(l[:i]):\r\n c+=1\r\n\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,len(l)):\r\n if all(j>l[i] for j in l[:i]) or all(j<l[i] for j in l[:i]):\r\n count+=1\r\nprint(count)", "n = int(input())\r\np = list(map(int, input().split()))\r\nmx = p[0]\r\nmn = p[0]\r\namaz = 0\r\nfor i in range(1, n):\r\n if p[i] < mn or p[i] > mx:\r\n amaz += 1\r\n mn = min(mn, p[i])\r\n mx = max(mx, p[i])\r\nprint(amaz)\r\n", "input()\r\na = [int(x) for x in input().split()]\r\nsmall = a[0]\r\nlarge = a[0]\r\nc = 0\r\nfor x in range(1, len(a)):\r\n if a[x] > large:\r\n c += 1\r\n large = a[x]\r\n elif a[x] < small:\r\n c += 1\r\n small = a[x]\r\n\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nbest,worst=a[0],a[0]\r\nif n>1:\r\n for i in range(1,n):\r\n if a[i]>best:\r\n best=a[i]\r\n c+=1\r\n elif a[i]<worst:\r\n worst=a[i]\r\n c+=1\r\nprint(c)", "n = int(input())\r\nl = list(map(int,input().split()))\r\nma = l[0]\r\nmi = l[0]\r\nc = 0\r\nfor i in range(1,n):\r\n if l[i]>ma:\r\n ma = l[i]\r\n c+=1 \r\n elif l[i]<mi:\r\n mi=l[i]\r\n c+=1 \r\nprint(c)", "n = int(input())\r\n\r\na = list(map(int, input().split(' ')))\r\n\r\nmi, ma = a[0], a[0]\r\nk = 0\r\n\r\nfor i in range(1, n):\r\n if a[i] < mi:\r\n k += 1\r\n mi = a[i]\r\n elif a[i] > ma:\r\n k += 1\r\n ma = a[i]\r\n \r\nprint(k)\r\n ", "c = int(input())\r\nrecordi = list(map(int, input().split()))\r\nrekord = antirekord = recordi[0]\r\nudivitelno = 0\r\nfor F in range(1, c):\r\n if recordi[F] > rekord:\r\n rekord = recordi[F]\r\n udivitelno += 1\r\n elif recordi[F] < antirekord:\r\n antirekord = recordi[F]\r\n udivitelno += 1\r\n\r\n\r\nprint(udivitelno)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\ntimes = 0\r\nfor i in range(1,n):\r\n if lst[i] > max(lst[:i]) or lst[i] < min(lst[:i]):\r\n times += 1\r\nprint(times)", "n=int(input())\r\na=list(map(int,input().split()))\r\ncnt=0\r\nsmall=a[0]\r\nbig=a[0]\r\nfor i in range(1,n):\r\n if a[i]>big:\r\n cnt+=1\r\n big=a[i]\r\n elif a[i]<small:\r\n cnt+=1\r\n small=a[i]\r\nprint(cnt)\r\n ", "from sys import stdin\r\ndef input(): return stdin.readline().strip()\r\n\r\nn = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nmin=s[0]\r\nmax=s[0]\r\ncol = 0\r\nfor i in range(n):\r\n if s[i]>max:\r\n col += 1\r\n max = s[i]\r\n elif s[i]<min:\r\n col += 1\r\n min = s[i]\r\n\r\nprint(col)", "int(input())\r\ny = list(map(int, input().split()))\r\nz, w, r = y[0], y[0], 0\r\nfor i in y:\r\n if z > i:\r\n z = i\r\n r += 1\r\n elif w < i:\r\n w = i\r\n r += 1\r\nprint(r)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmx=a[0]\r\nmn=a[0]\r\nc=0\r\nfor i in range(n):\r\n if a[i]>mx:\r\n mx=a[i]\r\n c+=1\r\n elif a[i]<mn:\r\n mn=a[i]\r\n c+=1\r\nprint(c)", "n = int(input())\r\nc = list(map(int, input().split()))\r\nprint(sum(1 for i in range(1, n) if c[i] > max(c[:i]) or c[i] < min(c[:i])))\r\n", "n,l,c=int(input()),[int(i) for i in input().split()],0\r\nfor i in range(1,n):\r\n a,b=0,0\r\n for j in range(i):\r\n if l[i]>l[j]: a+=1\r\n elif l[i]<l[j]: b+=1\r\n if a==i or b==i: c+=1\r\nprint(c) ", "input()\r\n\r\ncs = map(int, input().split())\r\n\r\nmaxi = next(cs)\r\nmini = maxi\r\na = 0\r\n\r\nfor c in cs:\r\n if c > maxi:\r\n maxi = c\r\n a += 1\r\n elif c < mini:\r\n mini = c\r\n a += 1\r\n \r\nprint(a)", "n = int(input())\r\nl = 0\r\ns = list(map(int,input().split()))\r\nfor i in range(1, n):\r\n if s[i] > max(s[:i]) or s[i] < min(s[:i]):\r\n l += 1\r\nprint(l)\r\n", "n = int(input())\narr = [int(x) for x in input().split()]\nminimum = arr[0]\nmaximum = arr[0]\nnum_amazing = 0\nfor element in arr[1:]:\n\tif(element > maximum):\n\t\tnum_amazing += 1\n\t\tmaximum = element\n\tif(element < minimum):\n\t\tnum_amazing += 1\n\t\tminimum = element\nprint(num_amazing)", "n = int(input())\r\np = list(map(int, input().split()))\r\nans = 0\r\nc = [p[0]]\r\nfor i in range(1, n):\r\n c.append(p[i])\r\n a = max(c)\r\n b = min(c)\r\n if p[i] == a and a not in c[:-1]:\r\n ans += 1\r\n a1 = 1\r\n elif p[i] == b and b not in c[:-1]:\r\n ans += 1\r\n b1 = 1\r\nprint(ans)\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\nif n==1:\r\n print(0)\r\nelse:\r\n count=0\r\n hs=ls=p[0]\r\n for i in range(1,n):\r\n if p[i]>hs:\r\n hs=p[i]\r\n count+=1 \r\n elif p[i]<ls:\r\n ls=p[i]\r\n count+=1\r\n \r\n \r\n print(count)\r\n ", "num_size = int(input())\r\nc = 0\r\nstt = list(map(int, input().split()))\r\nmaior = stt[0]\r\nmenor = stt[0]\r\nfor each in stt:\r\n if each > maior:\r\n maior = each\r\n c += 1\r\n elif each < menor:\r\n menor = each\r\n c += 1\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nmi=a[0]\r\nma=a[0]\r\nfor i in range(1,n):\r\n if a[i]>ma:\r\n ma=max(ma,a[i])\r\n c+=1\r\n if a[i]<mi:\r\n mi=min(mi,a[i])\r\n c+=1\r\nprint(c)", "n = int(input())\r\ntotal_c = 0\r\nnums = list(map(int,input().split()))\r\nmaxi = nums[0]\r\nmini = nums[0]\r\nfor i in range(1,n):\r\n if nums[i]>maxi:\r\n maxi=nums[i]\r\n total_c+=1 \r\n elif nums[i]<mini:\r\n mini=nums[i]\r\n total_c+=1 \r\nprint(total_c)", "a = int(input())\r\nb = list(map(int,input().split()))\r\nx = b[0]\r\ng = b[0]\r\nc = 0\r\nfor i in range(a):\r\n if b[i] > x:\r\n c += 1\r\n x = b[i]\r\n elif b [i] < g:\r\n c += 1\r\n g = b[i]\r\nprint(c)", "n=int(input())\r\nli=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(1,n):\r\n if(li[i]>max(li[:i]) or li[i]<min(li[:i])):\r\n count+=1\r\nprint(count)", "def count_amazing_performances(n, points):\r\n amazing_count = 0\r\n min_points = max_points = points[0]\r\n\r\n for i in range(1, n):\r\n if points[i] > max_points:\r\n max_points = points[i]\r\n amazing_count += 1\r\n elif points[i] < min_points:\r\n min_points = points[i]\r\n amazing_count += 1\r\n\r\n return amazing_count\r\nn = int(input()) # Number of contests\r\npoints = list(map(int, input().split()))\r\n\r\nresult = count_amazing_performances(n, points)\r\nprint(result)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n):\r\n if a[i]>max(a[:i]) or a[i]<min(a[:i]):\r\n c+=1\r\nprint(c)", "n = input()\r\ns = list(map(int, input().split()))\r\n \r\nlst = [s[0]]\r\n \r\nc = 0\r\nfor e in s:\r\n if e > max(lst) or e < min(lst):\r\n c += 1\r\n lst.append(e)\r\nprint(c)", "n = int(input()) \r\nl = list(map(int ,input().split()))\r\ncounter = 0 \r\nfor i in range (1 , n) : \r\n if l[i] < min(l[ : i]) : \r\n counter +=1 \r\n if l[i] > max(l[ : i] ): \r\n counter += 1\r\nprint(counter) \r\n \r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmins = maxs = s[0]\r\na = 0\r\nfor i in range(1, n):\r\n if s[i] > maxs:\r\n maxs = s[i]\r\n a += 1\r\n elif s[i] < mins:\r\n mins = s[i]\r\n a += 1\r\nprint(a)", "n=int(input())\r\np=list(map(int,input().split()))\r\n\r\nb=p[0]\r\nw=p[0]\r\na=0\r\n\r\nfor i in range (1,n):\r\n c=p[i]\r\n if c>b or c<w:\r\n a+=1\r\n b=max(b,c)\r\n w=min(w,c)\r\nprint(a)", "input()\r\npoints = [int(earned) for earned in input().split(' ')]\r\ni, count = 1, 0\r\nwhile i < len(points):\r\n greater, less = True, True\r\n j = i - 1\r\n while j >= 0:\r\n if points[j] >= points[i]:\r\n greater = False\r\n if points[j] <= points[i]: \r\n less = False\r\n j -= 1\r\n if greater or less: \r\n count += 1\r\n i += 1\r\nprint(count)", "number_of_contests = int(input())\r\nscores = input()\r\nscores_list = scores.split(\" \")\r\ncount = 0\r\ncount_amazing = 0\r\nhigh = 0\r\nlow = 0\r\nfor n in scores_list:\r\n int_n = int(n)\r\n if count == 0:\r\n high = int_n\r\n low = int_n\r\n elif int_n>high :\r\n count_amazing +=1\r\n high = int_n\r\n elif int_n<low:\r\n count_amazing += 1\r\n low = int_n\r\n count += 1\r\nprint(count_amazing)\r\n\r\n\r\n", "n=int(input())\r\na=[]\r\na=list(map(int,input().split()))\r\nl=a[0]\r\nr=a[0]\r\ncnt=0\r\nfor i in range(1,n):\r\n if a[i]<l:\r\n cnt+=1\r\n l=a[i]\r\n if a[i]>r:\r\n cnt+=1\r\n r=a[i]\r\nprint(cnt)", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nflag = False\r\ncnt = 0\r\nmi_n = mas[0]\r\nma_x = mas[0]\r\nfor i in range(1, n + 1):\r\n if mas[i - 1] < mi_n:\r\n cnt += 1\r\n mi_n = mas[i - 1]\r\n if mas[i - 1] > ma_x:\r\n cnt += 1\r\n ma_x = mas[i - 1]\r\nprint(cnt)\r\n", "a=int(input())\r\ns=-1\r\nMAX=0\r\nMIN=10001\r\nfor i in map(int,input().split()):\r\n if MAX<i:\r\n MIN=min(MIN,i)\r\n MAX=i\r\n s=s+1\r\n elif MIN>i:\r\n MIN=i\r\n s=s+1\r\nprint(s)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\nmin_value = s[0]\r\nmax_value = s[0]\r\ncount = 0\r\nfor i in range(1, n):\r\n if s[i] > max_value or s[i] < min_value:\r\n count += 1\r\n max_value = max(max_value, s[i])\r\n min_value = min(min_value, s[i])\r\n\r\n\r\nprint(count)\r\n", "n=int(input())\r\nlst=list(map(int,input().split()))\r\ntemp=[]\r\nc=0\r\nfor i in range(n):\r\n if(i!=0):\r\n if(lst[i]<min(temp) or lst[i]>max(temp)):\r\n c+=1\r\n temp.append(lst[i])\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nfor i in range(0,len(l)):\r\n if i==0:\r\n pass\r\n elif l[i]<min(l[:i]) or l[i]>max(l[:i]):\r\n c+=1\r\n \r\nprint(c)", "m=int(input())\r\nb=[int(i) for i in input().split()]\r\nmin=b[0]\r\nmax=b[0]\r\ncnt=0\r\nfor i in b:\r\n if i>max:\r\n cnt+=1\r\n max=i\r\n elif i<min:\r\n cnt+=1\r\n min=i\r\nprint(cnt)", "n = int(input())\r\nlist = [int(i) for i in input().split()]\r\nc = 0\r\nmin = list[0]\r\nlist.pop(0)\r\nmax = min\r\nfor i in list:\r\n if i < min:\r\n min = i\r\n c += 1\r\n elif i > max:\r\n max = i\r\n c += 1\r\nprint(c)", "N, P, res = int(input()), list(map(int, input().split())), 0; min, max = P[0], P[0]\r\nfor i in range(1, N):\r\n if P[i] > min and P[i] > max:\r\n res += 1; max = P[i]\r\n elif P[i] < min:\r\n res += 1; min = P[i]\r\nprint(res)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nc = 0\r\ns= []\r\ns.append(a[0])\r\nfor i in range(1, n):\r\n if max(s)<a[i] or min(s)>a[i]:\r\n c+=1\r\n s.append(a[i])\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nct=0\r\nbr=wr=a[0]\r\nfor i in a[1:]:\r\n if i>br:\r\n br=i\r\n ct+=1\r\n elif i<wr:\r\n wr=i\r\n ct+=1\r\nprint(ct)\r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nb = p[0]\r\nworst = p[0]\r\namazing = 0\r\nfor i in range(1, n):\r\n if p[i] > b:\r\n b = p[i]\r\n amazing += 1\r\n elif p[i] < worst:\r\n worst = p[i]\r\n amazing += 1\r\nprint(amazing)", "n = int(input())\r\ns = input()\r\nL = []\r\nL = s.split()\r\n\r\nfor i in range(n):\r\n L[i]=int(L[i])\r\nbr = 0\r\nm = L[0]\r\nM = L[0] \r\n \r\nfor i in range(1, n):\r\n if L[i] > M:\r\n br += 1\r\n M = L[i]\r\n\r\n if L[i] < m:\r\n br += 1\r\n m = L[i]\r\n\r\n \r\nprint(br)\r\n", "n = int(input())\r\nl= list(map(int, input().split()))\r\nans = 0\r\nmax = l[0]\r\nmin = l[0]\r\nfor i in range(1, n):\r\n if max < l[i]:\r\n max= l[i]\r\n ans += 1\r\n \r\n if min > l[i]:\r\n min=l[i]\r\n ans += 1\r\n\r\nprint(ans)\r\n", "g=int(input())\r\nc=list(map(int,input().split()))\r\nt=0\r\nfor i in range(1,g):\r\n\tif c[i]<min(c[:i]) or c[i]>max(c[:i]):\r\n\t\tt+=1\r\nprint(t)", "contests = int(input())\r\npoints = list(map(int,input().split(\" \")))\r\ncount = -1\r\nfor i in range(contests):\r\n if all(points[i] > x for x in points[:i]) or all(points[i] < x for x in points[:i]):\r\n count +=1\r\nprint(count)", "n = int(input())\r\nmas = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(1,n):\r\n if mas[i]>max(mas[:i]) or mas[i]<min(mas[:i]):\r\n k+=1\r\nprint(k)", "n = int(input())\r\n\r\nnums = [int(i) for i in input().split()]\r\n\r\nmini = nums[0]\r\nmaxi = nums[0]\r\n\r\ncount = 0 \r\nfor i in range(1, n):\r\n curr = nums[i]\r\n \r\n if curr > maxi or curr < mini :count += 1\r\n \r\n mini = min(mini, curr)\r\n maxi = max(maxi, curr)\r\n\r\nprint(count)", "n = int(input())\r\nb = input().split()\r\nc = [int(b[0])]\r\nv = 0\r\nfor i in range(len(b)):\r\n b[i] = int(b[i])\r\nfor i in range(1,len(b)):\r\n if b[i] not in c:\r\n c.append(b[i])\r\n if b[i] == min(c) or b[i] == max(c):\r\n v+=1\r\nprint(v)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\n# Initialize variables to keep track of best and worst performances\r\nbest_performance = points[0]\r\nworst_performance = points[0]\r\n\r\n# Initialize a variable to count amazing performances\r\namazing_count = 0\r\n\r\n# Loop through the points starting from the second contest\r\nfor i in range(1, n):\r\n if points[i] > best_performance:\r\n amazing_count += 1\r\n best_performance = points[i]\r\n elif points[i] < worst_performance:\r\n amazing_count += 1\r\n worst_performance = points[i]\r\n\r\nprint(amazing_count)\r\n", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nmx,mi = lst[0],lst[0]\r\ncnt = 0\r\nfor i in range(1,n):\r\n if lst[i]>mx:\r\n mx = lst[i]\r\n cnt+=1\r\n elif lst[i]<mi:\r\n mi = lst[i]\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\ndata=[int(x) for x in input().split()]\r\ncount=0\r\nfor i in range(1,len(data)):\r\n tdata=data[:i]\r\n if data[i]>max(tdata) or data[i]<min(tdata):\r\n count=count+1\r\nprint(count)\r\n", "n = int(input())\r\n\r\narr = [int(i) for i in input().split()]\r\n\r\nmx, mx = 0, 0\r\ncount = 0\r\n\r\nfor i in range(n):\r\n score = arr[i]\r\n if (i == 0):\r\n mx = score\r\n mn = score\r\n else:\r\n if (score > mx):\r\n mx = score\r\n count += 1\r\n elif (score < mn):\r\n mn = score\r\n count += 1\r\n\r\nprint(count)", "a=int(input())\r\nx=list(map(int,input().split()))\r\nz=x[0]\r\ny=x[0]\r\ns=0\r\nfor i in range(1,a):\r\n if x[i]<y:\r\n y=x[i]\r\n s=s+1\r\n elif x[i]>z:\r\n z=x[i]\r\n s=s+1\r\nprint(s)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nbest=a[0]\r\nworst=a[0]\r\namazing=0\r\ncount=0\r\nwhile count<n:\r\n if a[count]>best:\r\n best=a[count]\r\n amazing+=1\r\n if a[count]<worst:\r\n worst=a[count]\r\n amazing+=1\r\n count=count+1\r\nprint(amazing) ", "\"\"\"\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\"\"\"\r\n\r\nmod = 10**9 + 7\r\n\r\ninp1 = lambda: map(int,input().split())\r\ninp2 = lambda: list(map(int,input().split()))\r\n\r\ndef compute_gcd(x, y):\r\n while(y):\r\n x, y = y, x % y\r\n return x\r\n \r\ndef compute_lcm(x, y):\r\n lcm = (x*y)//compute_gcd(x,y)\r\n return lcm\r\n\r\n\r\nn = int(input())\r\narr = inp2()\r\n\r\nif len(arr) == 1:\r\n print(0)\r\nelse:\r\n count = 0\r\n temp_min, temp_max = arr[0], arr[0]\r\n for i in range(1,n):\r\n if arr[i] > temp_max:\r\n count += 1\r\n temp_max = arr[i]\r\n elif arr[i] < temp_min:\r\n count += 1\r\n temp_min = arr[i]\r\n print(count)\r\n \r\n ", "n = int(input())\r\nf = list(map(int, input().split()))\r\nc = f[:1]\r\n\r\nfor i in f:\r\n n -= min(c) <= i <= max(c)\r\n c += [i]\r\nprint(n)", "def count_amazing_performances(no_of_contests, points_list):\r\n best = worst = points_list[0]\r\n amazing_count = 0\r\n\r\n for i in range(1, no_of_contests):\r\n if points_list[i] > best:\r\n best = points_list[i]\r\n amazing_count += 1\r\n elif points_list[i] < worst:\r\n worst = points_list[i]\r\n amazing_count += 1\r\n\r\n return amazing_count\r\n\r\nno_of_contests = int(input())\r\npoints_list = list(map(int, input().split()))\r\nresult = count_amazing_performances(no_of_contests, points_list)\r\nprint(result)\r\n", "n = int(input())\na = list(map(int, input().split()))\n \nx = y = a[0]\ncnt = 0\nfor i in range(1, n):\n if a[i] < x:\n x = a[i]\n cnt += 1\n if a[i] > y:\n y = a[i]\n cnt += 1\n \nprint(cnt)\n \t\t \t\t\t \t\t \t", "n = int(input())\r\nl = list(map(int, input().split()))\r\namazing = 0\r\nfor i in range(1, n): \r\n if all(l[i] > k for k in l[:i]) or all(l[i] < k for k in l[:i]) : \r\n amazing += 1\r\nprint(amazing)\r\n", "\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\nc=0\r\nminimum=a[0]\r\nmaximum=a[0]\r\nfor i in range(n):\r\n \r\n if(a[i]<minimum):\r\n minimum=a[i]\r\n c+=1\r\n elif(a[i]>maximum):\r\n maximum=a[i]\r\n c+=1\r\nprint(c)", "n = int(input())\r\n# for i in range(n):\r\nx = [int(x) for x in input().split()]\r\ncnt = 0\r\nfor i in range(1, n):\r\n if x[i] > max(x[0 : i]) or x[i] < min(x[0 : i]):\r\n cnt+=1\r\nprint(cnt)", "n=int(input())\r\nl=input().split()\r\nlow=int(l[0])\r\nhigh=int(l[0])\r\nc=0\r\nfor i in range(1,len(l)):\r\n if int(l[i])>high:\r\n high=int(l[i])\r\n c+=1\r\n elif int(l[i])<low:\r\n low=int(l[i])\r\n c+=1\r\nprint(c)", "n = int(input())\nx = list(map(int, input().split()))\np = x[0]\ns = x[0]\nt = 0\nfor i in x:\n if i<p:\n t += 1\n p = i\n elif i>s:\n t += 1\n s = i\n \nprint(t)\n \n\n\n\n\n ", "a = int(input())\r\n\r\nb = list(map(int,input().split()))\r\n\r\ngrtpoints = b[0]\r\nwrtpoints = b[0]\r\n\r\nc = 0\r\n\r\nfor i in range(1,a):\r\n if b[i] > grtpoints:\r\n grtpoints = b[i]\r\n c+=1\r\n elif b[i] < wrtpoints:\r\n wrtpoints = b[i]\r\n c+=1\r\n \r\nprint(c)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nmin_score = arr[0]\r\nmax_score = arr[0]\r\nans = 0\r\nfor contest in arr:\r\n if contest > max_score:\r\n ans += 1\r\n max_score = contest\r\n elif contest < min_score:\r\n ans += 1\r\n min_score = contest\r\nprint(ans)\r\n", "\r\ncontests = int(input())\r\nratings = [int(x) for x in input().split()]\r\nlowest = ratings[0]\r\nhighest = ratings[0]\r\nanswer = 0\r\nfor rating in ratings[1::]:\r\n if rating < lowest:\r\n answer += 1\r\n lowest = rating\r\n elif rating > highest:\r\n answer += 1\r\n highest = rating\r\nprint(answer)\r\n", "n = int(input())\r\ns = list(map(int, input().split()))\r\ncount = 0\r\nhighest_yet = s[0]\r\nlowest_yet = s[0]\r\nfor i in range(1, n):\r\n if s[i] > highest_yet:\r\n highest_yet = s[i]\r\n count += 1\r\n if s[i] < lowest_yet:\r\n lowest_yet = s[i]\r\n count += 1\r\nprint(count) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmi,ma=l[0],l[0]\r\ncount=0\r\nfor i in range(1,n):\r\n if l[i]<mi or l[i]>ma:\r\n count+=1\r\n mi=min(mi,l[i])\r\n ma=max(ma,l[i])\r\nprint(count)\r\n", "n = int(input())\nscores = [int(i) for i in input().split()]\nma = mi = scores[0]\ncount = 0\nfor score in scores:\n if score > ma:\n ma = score\n count += 1\n elif score < mi:\n mi = score\n count += 1\nprint(count)\n", "\ncount = int(input())\ndigits = list(map(int, input().split()))\n\namazing_performances = 0\nlocal_max, local_min = digits[0], digits[0]\nfor digit in digits[1:]:\n if digit > local_max:\n local_max = digit\n amazing_performances += 1\n elif digit < local_min:\n local_min = digit\n amazing_performances += 1\n\nprint(amazing_performances)\n", "n = int(input())\r\nl = list(input().split(' '))\r\nmin_num = max_num = int(l[0])\r\ncount = 0\r\nfor i in range(1, n):\r\n if int(l[i]) < min_num or int(l[i]) > max_num:\r\n count += 1\r\n min_num = min(min_num, int(l[i]))\r\n max_num = max(max_num, int(l[i]))\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nleast=most=l[0]\r\nfor i in range(1,n,1):\r\n if(l[i]<least):\r\n least=l[i]\r\n c+=1\r\n elif(l[i]>most):\r\n most=l[i]\r\n c+=1\r\nprint(c)", "n = int(input())\r\ncounter = 0\r\nmax, min = 0, 0\r\nx = list(map(int, input().split(' ')))\r\nfor b in range(len(x)):\r\n if b == 0:\r\n max = min = x[b]\r\n else:\r\n if x[b] > max:\r\n max = x[b]\r\n counter += 1\r\n elif x[b] < min:\r\n min = x[b]\r\n counter += 1\r\n\r\nprint(counter)", "n = int(input())\r\nnumbers = tuple(map(int,input().split()))\r\n\r\ncmin = numbers[0]\r\ncmax = numbers[0]\r\ncount = 0\r\nfor num in numbers:\r\n if num > cmax:\r\n count += 1\r\n cmax = num\r\n elif num < cmin:\r\n count += 1\r\n cmin = num\r\nprint(count)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nmi=l[0]\r\nma=l[0]\r\ncount=0\r\nfor i in l:\r\n if i<mi:\r\n count+=1\r\n mi=i\r\n elif i>ma:\r\n count+=1\r\n ma=i\r\nprint(count)", "n = int(input())\r\na =[int(x) for x in input().split()]\r\nmax =a[0]\r\nmin=a[0]\r\nc=0\r\nfor i in range(1,n):\r\n if(a[i]>max):\r\n max=a[i]\r\n c+=1\r\n elif(a[i]<min):\r\n min=a[i]\r\n c+=1\r\nprint(c)", "num1 = int(input())\r\nstr1 = input().split()\r\nstr2 = []\r\nfor x in str1 :\r\n if int(x) not in str2:\r\n str2.append(int(x))\r\nsum = 0\r\nhh = str2[0]\r\nlest = []\r\nlest.append(hh)\r\nx = 1\r\nwhile x < (len(str2)):\r\n if str2[x] < hh and str2[x] < min(lest):\r\n sum+=1\r\n lest.append(str2[x])\r\n elif str2[x] > hh and str2[x] > max(lest):\r\n sum+=1\r\n lest.append(str2[x])\r\n x+=1\r\nprint(sum)", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nans=0\r\nfor i in range(len(b)):\r\n\tif i==0:\r\n\t\tmx=b[i]\r\n\t\tmi=b[i]\r\n\tif mx<b[i]:\r\n\t\tmx=b[i]\r\n\t\tans+=1\r\n\tif mi>b[i]:\r\n\t\tmi=b[i]\r\n\t\tans+=1\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\nmore = a[0]\r\nless = a[0]\r\nres = 0\r\n\r\nfor i in a:\r\n if i > more:\r\n res += 1\r\n more = i\r\n elif i < less:\r\n res += 1\r\n less = i\r\n\r\nprint(res)", "n = int(input())\npoints = list(map(int, input().split()))\n\nlowest = points[0]\nhighest = points[0]\n\namazing = 0\n\nfor point in points:\n if point>highest:\n amazing += 1\n highest = point\n if point<lowest:\n amazing += 1\n lowest = point\n\nprint(amazing)\n \t\t \t \t\t \t \t\t\t \t", "n = int(input())\r\na = list(map(int,input().split()))\r\nmin = a[0]\r\nmax = a[0]\r\nc=0\r\nfor i in range(1,len(a)):\r\n if a[i] > max:\r\n max = a[i]\r\n c+=1 \r\n continue\r\n if a[i] < min:\r\n min = a[i]\r\n c+=1\r\n continue\r\nprint(c)\r\n ", "n=int(input())\r\n\r\nnumbers=input().split()\r\npoints=[int(num) for num in numbers] \r\n\r\n\r\nsmallest = points[0]\r\nlargest = points[0]\r\ncount=0 \r\n\r\ni=1 \r\nwhile n>1: # Here if we take n>0 then it will go out of the index in the last iteration, so n>1 \r\n\r\n if points[i]>largest:\r\n largest=points[i]\r\n count+=1\r\n elif points[i]<smallest:\r\n smallest=points[i]\r\n count+=1\r\n i+=1\r\n n-=1 \r\n\r\nprint(count) \r\n\r\n\r\n", "from sys import stdin\r\ninput=stdin.readline\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=w=a[0]\r\nr=0\r\nfor i in a[1:]:\r\n if i>b:\r\n r+=1\r\n b=i\r\n elif i<w:\r\n r+=1\r\n w=i\r\nprint(r)\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\nco=0\r\nfor i in range(2,n+1):\r\n w=s[:i]\r\n if (w[-1]==max(w) and w.count(max(w))==1) or (w[-1]==min(w) and w.count(min(w))==1):co+=1\r\nprint(co)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nmax1=a[0]\r\nmin1=a[0]\r\nfor i in range(n):\r\n if(a[i]>max1):\r\n max1=a[i]\r\n c+=1\r\n if(a[i]<min1):\r\n min1=a[i]\r\n c+=1\r\nprint(c)", "n = int(input())\r\nrow = list(map(int, input().split()))\r\ncount = 0\r\nmn, mx = row[0], row[0]\r\nfor i in row:\r\n if mn > i:\r\n mn = i\r\n count += 1\r\n if mx < i:\r\n mx = i\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nminNum = lst[0]\r\nmaxNum = lst[0]\r\nres = 0\r\n\r\nfor i in lst:\r\n if i < minNum:\r\n minNum = i\r\n res += 1\r\n elif i > maxNum:\r\n maxNum = i\r\n res += 1\r\nprint(res)", "n= int(input())\r\nlist= input().split()\r\nmax = int(list[0])\r\nmin = int(list[0])\r\namazing = 0\r\nfor i in list:\r\n i = int(i)\r\n if (i> max):\r\n max = i\r\n amazing = amazing+1\r\n if (i<min):\r\n min = i\r\n amazing = amazing+1\r\nprint(amazing)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nmini, maxi, amaz = lst[0], lst[0], 0\r\nfor x in lst[1:]:\r\n if x < mini:\r\n mini = x\r\n amaz += 1\r\n elif x > maxi:\r\n maxi = x\r\n amaz += 1\r\nprint(amaz)", "a = int(input())\r\nb = input()\r\nc = b.split()\r\nfor i in range(a):\r\n c[i] = int(c[i])\r\nmax = c[0]\r\nmin = c[0]\r\nst = 0\r\nfor i in c:\r\n if max > i:\r\n st+=1\r\n max = i\r\n if min < i:\r\n st+=1\r\n min = i\r\nprint(st)", "def f():\r\n n=int(input())\r\n scores=input()\r\n scores=scores.split(\" \")\r\n scores=map(int,scores)\r\n scores=list(scores)\r\n q=[]\r\n q1=[]\r\n count=0\r\n for i in range(len(scores)):\r\n if len(q)==0:\r\n q.append(scores[i])\r\n else:\r\n if scores[i]<q[0]:\r\n while len(q)!=0 and scores[i]<q[0]:\r\n temp=q.pop(0)\r\n q1.append(temp)\r\n if len(q)==0:\r\n count=count+1\r\n q=q1.copy()\r\n q.append(scores[i])\r\n q1.clear()\r\n else:\r\n q=q+q1.copy()\r\n q.append(scores[i])\r\n q1.clear()\r\n elif scores[i]>q[0]:\r\n while len(q)!=0 and scores[i]>q[0]:\r\n temp=q.pop(0)\r\n q1.append(temp)\r\n if len(q)==0:\r\n count=count+1\r\n q=q1.copy()\r\n q.append(scores[i])\r\n q1.clear()\r\n else:\r\n q=q+q1.copy()\r\n q.append(scores[i])\r\n q1.clear()\r\n return count\r\n\r\nprint(f())\r\n\r\n ", "input()\r\nl=list(map(int,input().split()))\r\nmin=l[0]\r\nmax=l[0]\r\nx=0\r\nfor j in range(1,len(l)):\r\n if l[j]>max:\r\n max=l[j]\r\n x+=1\r\n elif l[j]<min:\r\n min=l[j]\r\n x+=1\r\nprint(x)", "n = int(input())\r\n\r\nt = list(map(int,input().split()))\r\nma = t[0]\r\nmi = t[0]\r\nans = 0\r\nfor k in t:\r\n \r\n if k>ma:\r\n ans +=1\r\n ma = k\r\n elif k<mi:\r\n ans +=1\r\n mi=k\r\n \r\nprint(ans)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=a[0]\r\nk=a[0]\r\np=0\r\nfor i in range(1,len(a)):\r\n if(a[i]>c):\r\n p+=1\r\n c=a[i]\r\n elif(a[i]<k):\r\n p+=1\r\n k=a[i]\r\nprint(p)\r\n ", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nm1=m2=a[0]\r\nfor i in a:\r\n if(i>m1):\r\n c+=1\r\n m1=i\r\n elif(i<m2):\r\n c+=1\r\n m2=i\r\nprint(c)", "import sys\r\n#f=open(\"C:/Users/USER/Desktop/input.txt\",\"r\")\r\nf=sys.stdin\r\nn=int(f.readline())\r\nl=list(map(int, f.readline().split()))\r\nif len(l)==1:\r\n print(\"0\")\r\nelse:\r\n low=0\r\n high=0\r\n if l[0]>l[1]:\r\n high=l[0]\r\n low=l[1]\r\n c=1\r\n elif l[0]<l[1]:\r\n high=l[1]\r\n low=l[0]\r\n c=1\r\n else:\r\n high=l[0]\r\n low=l[1]\r\n c=0\r\n for i in range(2,len(l)):\r\n if l[i]>high:\r\n high=l[i]\r\n c+=1\r\n continue\r\n if l[i]<low:\r\n low=l[i]\r\n c+=1\r\n print(c)", "n = int(input())\r\ns = list(map(int, input().split()))\r\n\r\nsc = 0\r\n\r\nfor i in range(n):\r\n num = s[i]\r\n cb = 0\r\n for n in range(i+1):\r\n if num > s[n]:\r\n cb +=1\r\n\r\n if cb == i:\r\n sc+=1\r\n continue\r\n\r\n cl = 0\r\n for n in range(i+1):\r\n if num < s[n]:\r\n cl +=1\r\n\r\n if cl == i:\r\n sc+=1\r\n continue\r\n\r\nprint(sc - 1)\r\n", "n = int(input())\r\nab = input().split(\" \")\r\nmax = int(ab[0])\r\nmin = int(ab[0])\r\ncount = 0\r\n\r\nfor i in range(1,n):\r\n cur = int(ab[i])\r\n if cur > max:\r\n count+=1\r\n max = cur\r\n elif cur < min:\r\n count+=1\r\n min = cur\r\n\r\n\r\nprint(count)", "#5\n# answer = list(map(int, input().split()))\n# n, m, count = answer[0], answer[1], 0\n\n# for a in range(1000):\n# for b in range(1000):\n# if a*a + b == n and a + b*b == m:\n# count +=1\n# print(count)\n\n\n#6 answer = list(input())\n# dict = {}\n# for i in answer:\n# dict[i] = answer.count(i)\n# max_letter = sorted(dict)\n# final = max_letter[-1]*dict[max_letter[-1]]\n\n# print(final)\n\n#7 n_m = list(map(int, input().split()))\n# n, m = n_m[0], n_m[1]\n# A = []\n# coord = []\n# for line in range(n):\n# A.append(list(input()))\n# for i in range(n):\n# for j in range(m):\n# if A[i][j] == \"*\":\n# coord.append((i,j))\n# final = (0,0)\n# for i in range(3):\n# final = (final[0]^coord[i][0], final[1]^coord[i][1]) \n\n# print(final[0]+1, final[1]+1)\n\n\n# 8\n# n = m = int(input())\n# A = []\n# count_sum = 0\n# for line in range(n):\n# A.append(list(map(int, input().split())))\n# gor = int((n-1)/2)\n# vert = int((m-1)/2)\n# for i in range(n):\n# count_sum += A[i][gor]\n# A[i][gor] = 0\n# count_sum += A[vert][i]\n# A[vert][i] = 0\n# count_sum += A[i][i]\n# count_sum += A[n-1-i][i]\n# print(count_sum)\n\n\n# 10 data = list(map(int, input().split()))\n# n, m = data[0], data[1]\n# row = list(map(int, input().split()))\n# last = 0\n# for i in row:\n# if i >= row[m-1] and i>0:\n# last += 1\n# print(last) \n\n\nk = int(input())\ndata = list(map(int, input().split()))\ncount = 0\nmin = data[0]\nmax = data[0]\n\nfor n in range(len(data)-1):\n if max < data[n+1]:\n max = data[n+1]\n count +=1\n if min > data[n+1]:\n min = data[n+1]\n count +=1\n\nprint(count)\n\n\n", "contests = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\nmax = min = points[0]\r\ncountAmazing = 0\r\nfor i in range(1, contests):\r\n if points[i] < min:\r\n min = points[i]\r\n countAmazing+=1\r\n continue\r\n elif points[i] > max:\r\n max = points[i]\r\n countAmazing+=1\r\nprint(countAmazing)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\nmax_points = points[0]\r\nmin_points = points[0]\r\namazing_performances = 0\r\nfor i in range(1, n):\r\n if points[i] > max_points:\r\n max_points = points[i]\r\n amazing_performances += 1\r\n elif points[i] < min_points:\r\n min_points = points[i]\r\n amazing_performances += 1\r\nprint(amazing_performances)\r\n", "n=int(input())\r\nm=list(map(int,input().split()))\r\np=m[:1]\r\nfor i in m:\r\n n-=min(p)<=i<=max(p)\r\n p=p+[i]\r\nprint(n)\r\n", "n = int(input())\r\nmin = None\r\nmax = None\r\ncount = 0 \r\nfor item in list(map(int, input().split())):\r\n if min == None and max == None: min = item; max = item\r\n \r\n \r\n if item > max: max = item; count += 1\r\n if item < min: min = item; count += 1\r\n \r\nprint(count)\r\n\r\n \r\n\r\n \r\n ", "def solve(n: int, arr: list) -> int:\r\n mi = arr[0]\r\n ct = 0\r\n current = arr[0]\r\n for i in range(1,n):\r\n if arr[i] > current:\r\n ct+=1\r\n current = arr[i]\r\n if arr[i] < mi:\r\n ct+=1\r\n mi = arr[i]\r\n return ct\r\n \r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nprint(solve(n,arr))\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nk = 0\r\nfor i in range(len(a)):\r\n if i != 0:\r\n f_1 = all(True if a[i] > j else False for j in a[:i])\r\n f_2 = all(True if a[i] < j else False for j in a[:i])\r\n if f_1 or f_2:\r\n k += 1\r\nprint(k)", "n=int(input())\r\nl1=[int(i)for i in input().split()]\r\n\r\nans=0\r\nfor i in range(1,len(l1)):\r\n c1=0\r\n c2=0\r\n for j in range(i):\r\n if(l1[i]<l1 [j]):\r\n c1 +=1\r\n elif(l1[i]>l1[j]):\r\n c2 +=1\r\n if(c1==i or c2==i):\r\n ans+=1\r\nprint(ans) ", "a = int(input())\r\nb = list(map(int, input().split()))\r\nmax = b[0]\r\nmin = b[0]\r\nC=0\r\nfor i in range(1,a):\r\n if b[i] > max:\r\n C+=1\r\n max = b[i]\r\n elif b[i] < min:\r\n C+=1\r\n min = b[i]\r\nprint(C)", "s, n, c = [], int(input()), 0\r\ns += map(int, input().split())\r\nmi, ma = s[0], s[0]\r\nfor i in range(1, len(s)):\r\n if s[i] < mi:\r\n mi = s[i]\r\n c += 1\r\n if s[i] > ma:\r\n ma = s[i]\r\n c += 1\r\nprint(0) if len(s) == 1 else print(c)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nn = len(a)\r\nans = 0\r\nif n == 1:\r\n print(0)\r\nelse:\r\n maxnum = a[0]\r\n minnum = a[0]\r\n for i in a[1:]:\r\n if i > maxnum:\r\n ans += 1\r\n maxnum = i\r\n elif i < minnum:\r\n ans += 1\r\n minnum = i\r\n print(ans)", "n=int(input())\r\nx=list(map(int,input().split()))\r\ns1=0\r\ns2=0\r\nc = 0\r\nif len(x)>2:\r\n if x[0]>x[1]:\r\n s1=x[0]\r\n s2=x[1]\r\n c+=1\r\n elif x[0]<x[1]:\r\n s1 = x[1]\r\n s2 = x[0]\r\n c+=1\r\n else:\r\n s1 = x[0]\r\n s2 = x[1]\r\n for i in range(2,len(x)):\r\n if x[i]>s1:\r\n s1=x[i]\r\n c+=1\r\n if x[i]<s2:\r\n s2=x[i]\r\n c+=1\r\nelif len(x)==2:\r\n if x[0]>x[1]:\r\n c+=1\r\n elif x[0]<x[1]:\r\n c+=1\r\n else:\r\n c=0\r\nelse:\r\n c=0\r\nprint(c)", "uwu = int(input())\r\ncomps = list(map(int, input().split()))\r\ncomps2 = []\r\namazing = 0\r\nfor i in range(uwu) :\r\n comps2.append(comps[i])\r\n if i != 0 :\r\n if comps[i] == max(comps2) and comps2.count(comps[i]) == 1 :\r\n amazing += 1\r\n elif comps[i] == min(comps2) and comps2.count(comps[i]) == 1 :\r\n amazing += 1\r\nprint(amazing)", "dumbs = input()\r\ninput_line = input()\r\ninput_components = input_line.split()\r\nlist = []\r\nfor _ in input_components :\r\n list.append(int(_))\r\n\r\nmax_temp = list[0]\r\nmin_temp = list[0]\r\ncount = 0\r\n\r\nfor i in list :\r\n if i > max_temp :\r\n max_temp = i\r\n count += 1\r\n\r\n if i < min_temp:\r\n min_temp = i\r\n count += 1\r\n\r\nprint(count)", "n=int(input())\na=list(map(int,input().split()))\nx=a[:1]\nfor i in a:\n\tn-=min(x)<=i<=max(x)\n\tx+=[i]\nprint(n)\n \t\t \t\t\t\t\t \t \t \t \t\t \t \t\t", "n = int(input())\na = list(map(int, input().split()))\nmaximus = a[0]\nminimus = a[0]\ncounter = 0\nfor i in range(1, n):\n\tif a[i] > maximus:\n\t\tmaximus = a[i]\n\t\tcounter += 1\n\tif a[i] < minimus:\n\t\tminimus = a[i]\n\t\tcounter += 1\nprint(counter)\n\t\n\t\n", "n=int(input())\r\ns=input().split()\r\ni=0\r\nj=0\r\nk=0\r\nout=0\r\nwhile k<n:\r\n if int(s[k])>int(s[j]):\r\n j=k\r\n out+=1\r\n if int(s[k])<int(s[i]):\r\n i=k\r\n out+=1\r\n k+=1\r\nprint(out)", "n = int(input())\r\nscores = [int(i) for i in input().split()]\r\ncnt = 0\r\nfor i in range(1, n):\r\n if max(scores[:i]) < scores[i] or min(scores[:i]) > scores[i]:\r\n cnt += 1\r\nprint(cnt)\r\n", "n = int(input())\nscores = list(map(int, input().split()))\n\nmx = scores[0]\nmn = scores[0]\ncr = 0\nfor sc in scores:\n if sc > mx:\n cr += 1\n mx = sc\n elif sc < mn:\n cr += 1\n mn = sc\n\nprint(cr)\n", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nbest = a[0]\r\nworst = a[0]\r\nfor i in range(len(a)):\r\n if a[i]<worst:\r\n worst = a[i]\r\n count+=1\r\n i+=1\r\n elif a[i]>best:\r\n best = a[i]\r\n count+=1\r\n i+=1\r\n else:\r\n i+=1\r\n\r\nprint(count)", "t=int(input())\r\nc=0\r\na=list(map(int,input().strip().split()))[:t]\r\nmin=a[0]\r\nmax=a[0]\r\nfor i in range(1,t):\r\n if(a[i]<min):\r\n min=a[i]\r\n c=c+1\r\n elif(a[i]>max):\r\n max=a[i]\r\n c=c+1\r\nprint(c)", "n, s = int(input()), list(map(int, input().split()))\r\nhi = lo = s[0]\r\nud = 0\r\nfor i in range(1, n):\r\n if s[i] > hi:\r\n ud += 1\r\n hi = s[i]\r\n if s[i] < lo:\r\n ud += 1\r\n lo = s[i]\r\nprint(ud)", "n = int(input())\r\nscores = [int(x) for x in input().split(\" \")]\r\nini_max = scores[0]\r\nini_min = scores[0]\r\ncount = 0\r\n\r\nfor i in range(1,n):\r\n if scores[i] > ini_max:\r\n ini_max = scores[i]\r\n count += 1\r\n elif scores[i] < ini_min:\r\n ini_min = scores[i]\r\n count += 1\r\n\r\nprint(count)\r\n", "amazingCounter = 0\r\nn = int(input())\r\npoints = list(map(int,input().split()))\r\nmin = points[0]\r\nmax = points[0]\r\nfor i in range(1,n):\r\n if(points[i]< min):\r\n amazingCounter = amazingCounter + 1\r\n min = points[i]\r\n if(points[i] > max):\r\n amazingCounter = amazingCounter + 1\r\n max = points[i]\r\nprint(amazingCounter)", "n =int(input())\r\nk = list(map(int,input().split()))\r\nres = [k[0]]\r\nk.pop(0)\r\ncount = 0\r\n\r\nfor i in k:\r\n res.append(i)\r\n a = max(res)\r\n b = min(res)\r\n if res.count(i) <= 1:\r\n if i == a or i == b:\r\n count += 1\r\n\r\nprint(count)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\nbest_performance = worst_performance = points[0]\r\n\r\namazing_count = 0\r\n\r\nfor i in range(1, n):\r\n current_Position = points[i]\r\n \r\n if current_Position > best_performance:\r\n best_performance = current_Position\r\n amazing_count += 1\r\n elif current_Position < worst_performance:\r\n worst_performance = current_Position\r\n amazing_count += 1\r\n \r\nprint(amazing_count)", "n = int(input())\r\na = 0\r\ns = [int(x) for x in input().split()]\r\nb = s[0]\r\nc = s[0]\r\nfor i in s[1:]:\r\n if i<b:\r\n a+=1\r\n b=i\r\n elif i>c:\r\n a+=1\r\n c=i\r\nprint(a)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nscore = 0\r\nmaxpt,minpt = arr[0],arr[0]\r\nfor pt in arr:\r\n if(pt>maxpt):\r\n score+=1\r\n maxpt = pt\r\n if(pt<minpt):\r\n score+=1\r\n minpt = pt\r\n \r\nprint(score)", "import sys\r\n\r\nN = int(sys.stdin.readline())\r\n\r\nL = list(map(int, sys.stdin.readline().split()))\r\n\r\nc = 0\r\nmin_val, max_val = L[0], L[0]\r\nfor i in range(1, N):\r\n tmp_max_val, tmp_min_val = max_val, min_val\r\n if L[i] > max_val:\r\n max_val = L[i]\r\n if L[i] < min_val:\r\n min_val = L[i]\r\n if tmp_max_val != max_val or tmp_min_val != min_val:\r\n c += 1\r\nprint(c)\r\n", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nm1=l1[0]\r\nm2=l1[0]\r\nc=0\r\nfor i in range(1,n):\r\n if(l1[i]<m2):\r\n m2=l1[i]\r\n c+=1\r\n if(l1[i]>m1):\r\n m1=l1[i]\r\n c+=1\r\nprint(c)", "n = int(input())\r\nlst = [*map(int,input().split())]\r\na = lst[0]\r\nb = lst[0]\r\nc = 0\r\nfor i in range(1,len(lst)):\r\n if a<lst[i]:\r\n a = lst[i]\r\n c += 1\r\n elif b>lst[i]:\r\n b = lst[i]\r\n c += 1 \r\nprint(c)", "n=int(input())\r\narr=list(map(int,input().split()))\r\namazing_p=0\r\nbest_rec=arr[0]\r\nworst_rec=arr[0]\r\nfor i in range(1,n):\r\n #since 1st at oth index no need to consider mentioned chesaru question lo\r\n if arr[i]>best_rec:\r\n best_rec=arr[i]\r\n amazing_p+=1\r\n elif arr[i]<worst_rec:\r\n worst_rec=arr[i]\r\n amazing_p+=1\r\nprint(amazing_p)", "def solve(n, l):\r\n min_val = l[0]\r\n max_val = l[0]\r\n count = 0\r\n for i in range(1, len(l)):\r\n if(l[i] < min_val):\r\n count += 1\r\n min_val = l[i]\r\n # print(count, min_val, l[i])\r\n elif(l[i] > max_val):\r\n count += 1\r\n max_val = l[i] \r\n # print(count, max_val, l[i])\r\n \r\n return count\r\n\r\nn = int(input())\r\nl = list(map(int, input().split()))\r\nprint(solve(n, l))", "n = int(input())\r\ns = input().split()\r\nscores = [int(x) for x in s]\r\n\r\ntemp = []\r\nres = 0\r\n\r\n\r\nfor k, v in enumerate(scores):\r\n if k != 0:\r\n s_max = max(temp)\r\n s_min = min(temp)\r\n if v > s_max or v < s_min:\r\n res += 1\r\n temp.append(v)\r\n\r\n else:\r\n temp.append(v)\r\n \r\n \r\nprint(res)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = a[:1]\r\nc = n\r\nfor x in a:\r\n if min(b)<=x<=max(b):c-=1\r\n b += [x]\r\nprint(c)", "n = int(input())\na = list(map(int, input().split()))\nma = a[0]\nmi = a[0]\nc = 0\nfor i in a:\n if i > ma:\n c += 1\n ma = i\n elif i < mi:\n c += 1\n mi = i\n\nprint(c)\n\n# s = []\n# while n != 0:\n# a = list(map(int, input().split()))\n\n# n -= 1\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nmin = a[0]\r\nmax = a[0]\r\nawesome = 0\r\nfor i in range(1, n):\r\n if a[i] > max:\r\n max = a[i]\r\n awesome += 1\r\n if a[i] < min:\r\n min = a[i]\r\n awesome += 1\r\nprint(awesome)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmaxim = a[0]\r\nk = 0\r\nminim = a[0]\r\nfor i in a[1:]:\r\n if i>maxim:\r\n maxim = i\r\n k += 1\r\n if i<minim:\r\n minim = i\r\n k += 1\r\nprint(k)\r\n", "# Read input\r\nn = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\n# Initialize variables to keep track of best and worst performances\r\nbest_performance = points[0]\r\nworst_performance = points[0]\r\n\r\n# Initialize a variable to count amazing performances\r\namazing_performances = 0\r\n\r\n# Iterate through the points, starting from the second contest (index 1)\r\nfor i in range(1, n):\r\n if points[i] > best_performance:\r\n best_performance = points[i]\r\n amazing_performances += 1\r\n elif points[i] < worst_performance:\r\n worst_performance = points[i]\r\n amazing_performances += 1\r\n\r\n# Print the number of amazing performances\r\nprint(amazing_performances)\r\n", "n=int(input())\r\nb=input()\r\nl=b.split(' ')\r\nans=0\r\nfor i in range(n):\r\n l[i]=int(l[i])\r\nfor i in range(1,n):\r\n k=l[:i]\r\n k.sort()\r\n if(k[0]>l[i] or k[-1]<l[i]):\r\n ans+=1\r\nprint(ans)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nworst,best=l[0],l[0]\r\nc=0\r\nfor i in l[1:]:\r\n if i>best:\r\n c+=1\r\n best=i\r\n elif i<worst:\r\n c+=1\r\n worst=i\r\nprint(c)", "a = int(input())\r\ndata = list(map(int, input().split()));\r\ncounts = 0;\r\nlow = data[0];\r\nmax = data[0];\r\nfor i in range(1, a):\r\n if(data[i] < low):\r\n low = data[i];\r\n counts+=1;\r\n if(data[i] > max):\r\n max = data[i];\r\n counts+=1;\r\nprint(counts);", "x = int(input())\r\nw = list(map(int, input().split()))\r\nma= w[0]\r\nmi = w[0]\r\nc = 0\r\ni = 1\r\n \r\nwhile i < len(w):\r\n if w[i] > ma:\r\n c += 1\r\n ma = w[i]\r\n elif w[i] < mi:\r\n c += 1\r\n mi = w[i]\r\n i += 1\r\n \r\nprint(c)", "n=int(input())\nlst=list(map(int,input().split()))\nseen=[lst[0]]\ntotal=0\nfor i in range(1,n):\n if lst[i]<min(seen) or lst[i]>max(seen):\n total+=1\n seen.append(lst[i])\nprint(total)", "n = int(input())\r\na = list(map(int, input().split()))\r\nmx, mn, ans = a[0], a[0], 0\r\nfor x in a[1:]:\r\n if x > mx:\r\n ans += 1\r\n mx = x\r\n if x < mn:\r\n ans += 1\r\n mn = x\r\nprint(ans)\r\n", "n,m=int(input()),0\r\nx=list(map(int,input().split()))\r\nfor i in range(1,len(x)):\r\n if x[i]>max(x[:i]) or x[i]<min(x[:i]):\r\n m+=1\r\nprint(m)", "case_num = int(input())\r\npoints = [int(x) for x in input().split()]\r\namazing = 0\r\n\r\nfor case in range(1, case_num):\r\n if points[case] < min(points[:case]) or points[case] > max(points[:case]):\r\n amazing += 1\r\n\r\nprint(amazing)", "n=int(input())\r\nl=[]\r\nl=list(map(int,input().split()))\r\nc=0\r\na=l[0]\r\nb=l[0]\r\nfor i in range(1,len(l)):\r\n if l[i]>a and l[i]<b:\r\n continue\r\n if l[i]<a:\r\n a=l[i]\r\n c+=1\r\n elif l[i]>b:\r\n b=l[i]\r\n c+=1\r\nprint(c)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nsmall = b[0]\r\nlarge = b[0]\r\ncount = 0\r\nfor i in b:\r\n if b[0] == i:\r\n pass\r\n else:\r\n if i < small:\r\n small = i\r\n count += 1\r\n elif i > large:\r\n large = i\r\n count += 1\r\nprint(count)\r\n", "# https://codeforces.com/problemset/problem/155/A\r\n\r\nnum_of_contests = int(input())\r\n\r\npoints_earned = list(map(int, input().split()))\r\n\r\namazing_performances = 0\r\nbest_score, worst_score = points_earned[0], points_earned[0]\r\n\r\nfor contest_score in points_earned[1::]:\r\n if contest_score > best_score:\r\n best_score = contest_score\r\n amazing_performances += 1\r\n elif contest_score < worst_score:\r\n worst_score = contest_score\r\n amazing_performances += 1\r\n\r\nprint(amazing_performances)\r\n", "n = int(input())\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\nminim = a[0]\r\nmaks = a[0]\r\nsurp = 0\r\nfor i in range(1, n):\r\n if a[i] < minim:\r\n surp += 1\r\n minim = a[i]\r\n if a[i] > maks:\r\n surp += 1\r\n maks = a[i]\r\nprint(surp)", "n = int(input())\r\n\r\nmyList = list(map(int, input().split()))\r\n\r\nresult = 0\r\n\r\nmyMin = myList[0]\r\nmyMax = myList[0]\r\n\r\nfor i in range(1, n):\r\n if myMin > myList[i] or myMax < myList[i]:\r\n result += 1\r\n myMin = min(myMin, myList[i])\r\n myMax = max(myMax, myList[i])\r\n\r\nprint(result)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nc=0\r\nmini=l[0]\r\nmaxi=l[0]\r\nfor i in range(1,len(l)):\r\n if l[i] > maxi:\r\n c+=1\r\n maxi=l[i]\r\n elif l[i] < mini:\r\n c+=1\r\n mini=l[i]\r\nprint(c)", "amount = int(input())\r\nscores = [int(x) for x in input().split()]\r\ngreatest = 0\r\nleast = 1000000\r\namazing = 0\r\nfor i in range(amount):\r\n if (i != 0 and scores[i] > greatest) or (i != 0 and scores[i] < least):\r\n amazing += 1\r\n if scores[i] > greatest:\r\n greatest = scores[i]\r\n if scores[i] < least:\r\n least = scores[i]\r\nprint(amazing)", "\r\nn= int(input())\r\n\r\nlst=[]\r\nlst=input(). split ()\r\nsum=0\r\nm=0\r\ns=0\r\nm=int(lst[0])\r\ns=int(lst[0])\r\n#print(m)\r\nfor i in range(len(lst)):\r\n #print(m)\r\n #print(lst[i])\r\n #print()\r\n\r\n \r\n \r\n if int(lst[i])>m:\r\n m=int(lst[i])\r\n #print(m)\r\n #print ()\r\n sum=sum+1\r\n if int(lst[i])<s:\r\n s=int(lst[i])\r\n #print (s)\r\n #print()\r\n sum=sum+1\r\nprint(sum)", "n = int(input())\n\narr = list(map(int, input().split()))\n\nminn = arr[0]\nmaxx = arr[0]\nudivil = 0\nfor i in range(1, len(arr)):\n if arr[i] < minn:\n udivil += 1\n minn = arr[i]\n if arr[i] > maxx:\n udivil += 1\n maxx = arr[i]\nprint(udivil)\n\n\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\nmin=arr[0]\r\nmax=arr[0]\r\nc=0\r\nfor i in arr:\r\n if(i<min):\r\n min=i\r\n c+=1\r\n elif(i>max):\r\n max=i\r\n c+=1 \r\nprint(c)", "n = int(input())\r\nx = list(map(int, input().split()))\r\n\r\np = 0\r\nmin = max = x[0]\r\n\r\nfor i in range(1, n):\r\n if x[i] > max:\r\n max = x[i]\r\n p += 1\r\n elif x[i] < min:\r\n min = x[i]\r\n p += 1\r\n\r\nprint(p)\r\n\r\n", "n=int(input())\r\np=list(map(int,input().split()))\r\ndef count(p):\r\n mini=p[0]\r\n maxi=p[0]\r\n ans=0\r\n if len(p)==1:\r\n return ans\r\n for i in range(1,len(p)):\r\n if p[i]>maxi or p[i]<mini:\r\n ans+=1\r\n maxi=max(maxi,p[i])\r\n mini=min(mini,p[i])\r\n return ans\r\nprint(count(p))", "n = int(input())\r\na = list(map(int, input().split(\" \")))\r\ncount = 0\r\n\r\nfor i in range(1, n):\r\n if all(a[i] > a[j] for j in range(i-1, -1, -1)) or all(a[i] < a[k] for k in range(i-1, -1, -1)):\r\n count += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\n\r\nx = list(map(int, input().split()))\r\n\r\nbs=ws=x[0]\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if x[i]>bs:\r\n bs = x[i]\r\n count += 1\r\n elif x[i]<ws:\r\n ws=x[i]\r\n count += 1\r\n\r\nprint(count)\r\n", "n= int(input())\r\nx = list(map(int,input().split(\" \")))\r\nmax = x[0]\r\nmin = x[0]\r\na=0\r\nfor i in range(1,n):\r\n if (x[i]>max):\r\n a=a+1\r\n max= x[i]\r\n if (x[i]<min):\r\n a=a+1\r\n min=x[i]\r\nprint(a)\r\n ", "n=int(input())\na=list(map(int,input().split()))\nc=0\nif n==1:\n\tprint(\"0\")\nelse:\n\tfor i in range(1,n):\n\t\ts=False\n\t\tif a[i-1]>a[i]:\n\t\t\tstatus=\"greater\"\n\t\telse:\n\t\t\tstatus=\"lesser\"\n\t\tfor j in range(i-1,-1,-1):\n\t\t\tif status==\"greater\":\n\t\t\t\tif a[j]>a[i]:\n\t\t\t\t\ts=True\n\t\t\t\telse:\n\t\t\t\t\ts=False\n\t\t\t\t\tbreak\n\t\t\telse:\n\t\t\t\tif a[j]<a[i]:\n\t\t\t\t\ts=True\n\t\t\t\telse:\n\t\t\t\t\ts=False\n\t\t\t\t\tbreak\n\t\tif s==True:\n\t\t\tc=c+1\n\tprint(c)\n\t\t\t\t\t\n\t\t\t\t\t\n\t\t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nworst = a[0]\r\nbest = a[0]\r\ncount = 0\r\n\r\nfor i in range(1,n):\r\n if a[i] > best:\r\n best = a[i]\r\n count += 1\r\n elif worst > a[i]:\r\n count += 1\r\n worst = a[i]\r\nprint(count)", "n = int(input())\r\nscores = list(map(int, input().split()))\r\n\r\nmin_score = max_score = scores[0]\r\namazing_count = 0\r\n\r\nfor i in range(1, n):\r\n if scores[i] < min_score:\r\n min_score = scores[i]\r\n amazing_count += 1\r\n elif scores[i] > max_score:\r\n max_score = scores[i]\r\n amazing_count += 1\r\n\r\nprint(amazing_count)", "n = int(input())\r\nx = [int(i) for i in input().split()]\r\nmax, min, cnt = x[0], x[0], 0\r\n\r\nfor i in x[1:]:\r\n if i > max:\r\n max = i\r\n cnt += 1\r\n elif i < min:\r\n min = i\r\n cnt += 1\r\n\r\nprint(cnt)", "n=int(input())\r\nl=input().split()\r\nlo=int(l[0])\r\nhi=int(l[0])\r\nc=0\r\nfor i in range(1,len(l)):\r\n if int(l[i])>hi:\r\n hi=int(l[i])\r\n c+=1\r\n elif int(l[i])<lo:\r\n lo=int(l[i])\r\n c+=1\r\nprint(c)", "n = int(input())\r\ns = list(map(int, input().split()))\r\nc = 0\r\nmis = s[0]\r\nmas = s[0]\r\nfor i in range(n):\r\n if s[i] < mis:\r\n mis = s[i]\r\n c += 1\r\n elif s[i] > mas:\r\n mas = s[i]\r\n c += 1\r\n\r\nprint(c)\r\n", "n = int(input())\npoints = [int(x) for x in input().split()]\namazing = 0\nhigh = points[0]\nlow = points[0]\nfor i in range(1, n):\n if points[i] > high:\n amazing += 1\n high = points[i]\n # print(f\"this is the new High {high}\")\n elif points[i] < low:\n amazing += 1\n low = points[i]\n # print(f\"thsi is the new low {low}\")\n\nprint(amazing)\n\n\t \t\t\t \t\t \t \t \t\t\t\t \t \t\t", "il = int(input()) # il = 5 0 1 2 3 4\r\nzadania = input().split() # [4, 3, 2, 4, 1]\r\nfor i in range(il):\r\n zadania[i] = int(zadania[i])\r\n\r\nnajw = zadania[0]\r\nnajm = zadania[0]\r\n\r\nwynik = 0\r\n\r\nfor i in range(1, il): # i = il = 5\r\n najwczasowe = max(zadania[i], najw) #list index out of range\r\n najmczasowe = min(zadania[i], najm)\r\n if najmczasowe < najm:\r\n najm = najmczasowe\r\n wynik += 1\r\n if najwczasowe > najw:\r\n najw = najwczasowe\r\n wynik += 1\r\nprint(wynik)", "a=int(input())\r\nb=[int(i) for i in input().split()]\r\nans=0\r\nfor i in range(1,len(b)):\r\n\tc=0\r\n\tfor j in range(i):\r\n\t\tif b[i]<b[j]:\r\n\t\t\tc+=1\r\n\tif c==i:\r\n\t\tans+=1\r\n\tc=0\r\n\tfor j in range(i):\r\n\t\tif b[i]>b[j]:\r\n\t\t\tc+=1\r\n\tif c==i:\r\n\t\tans+=1\r\n\t\r\nprint(ans)", "n=int(input())\r\ns=input()\r\nl=s.split(\" \")\r\ncount=0\r\ns=int(l[0])\r\nb=int(l[0])\r\nfor i in range(n-1):\r\n if(int(l[i+1])>int(l[i]) and int(l[i+1])>b ):\r\n count+=1\r\n b=int(l[i+1])\r\n elif(int(l[i+1])<int(l[i]) and int(l[i+1])<s):\r\n count += 1\r\n s = int(l[i + 1])\r\nprint(count)", "#155A\r\nn = int(input())\r\nl1 = list(map(int,input().split()))\r\nmx = l1[0]\r\nmin = l1[0]\r\nc = 0\r\nfor i in range(1,n):\r\n if l1[i]>mx:\r\n mx = l1[i]\r\n c+=1\r\n elif l1[i]<min:\r\n min = l1[i]\r\n c+=1\r\nprint(c)", "t=int(input())\r\nl=list(map(int,input().split()))\r\nminim=l[0]\r\nmaxim=l[0]\r\ncnt=0\r\nfor i in range(1,t):\r\n\t\r\n\tif l[i]<minim:\r\n\t\tminim=l[i]\r\n\t\tcnt+=1\r\n\telif l[i]>maxim:\r\n\t\tmaxim=l[i]\r\n\t\tcnt+=1\r\nprint(cnt)", "# -*- coding: utf-8 -*-\n\"\"\"155A.ipynb\n\nAutomatically generated by Colaboratory.\n\nOriginal file is located at\n https://colab.research.google.com/drive/10SCyR6tvBuDLXnmfZNwonFa146ok1jNw\n\"\"\"\n\nn = input()\nl = list(map(int,input().split()))\nm = l[0]\nmn = l[0]\ncnt = 0\nfor i in l:\n\tif i >m :\n\t\tm=i\n\t\tcnt+=1\n\tif i<mn:\n\t\tcnt+=1\n\t\tmn = i\n\nprint (\tcnt)", "n=int(input())\r\na=list(map(int,input().split()))\r\nan = 0\r\nmn = a[0]\r\nmx = a[0]\r\nfor i in range(1,n):\r\n an = an + (a[i] < mn) + (a[i] > mx)\r\n mn,mx = min(mn,a[i]),max(mx,a[i])\r\nprint(an)", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncnt=0\r\nfor i in range(1,n):\r\n d=arr[:i]\r\n if arr[i]>max(d):\r\n cnt+=1 \r\n elif arr[i]<min(d):\r\n cnt+=1 \r\nprint(cnt)", "n = int(input())\nar = list(map(int,input().split()))\nc=0\nfor i in range(n):\n if i!=0:\n if max(ar[:i])<ar[i]:\n c+=1\n elif min(ar[:i])>ar[i]:\n c+=1\n\nprint(c)", "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\nmi, ma = a[0], a[0]\r\nans = 0\r\nfor i in a:\r\n if i < mi or ma < i:\r\n ans += 1\r\n mi, ma = min(mi, i), max(ma, i)\r\nprint(ans)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nminim=arr[0]\r\nmaxim=arr[0]\r\ncount=0\r\nfor i in arr:\r\n if(i>maxim):\r\n count+=1\r\n maxim=i\r\n elif(i<minim):\r\n count+=1\r\n minim=i\r\n else:continue\r\nprint(count)", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl_res = [l[0]]\r\nwonder = 0\r\nfor i in range(1, n):\r\n l_res.append(l[i])\r\n if (l_res[i] == max(l_res) or l_res[i] == min(l_res)) and l_res.count(l[i]) == 1:\r\n wonder += 1\r\nprint(wonder)", "x = int(input())\r\narr = [int(i) for i in input().split()]\r\na = 0\r\nfor i in range(x):\r\n if i == 0:\r\n maximum = arr[i]\r\n minimum = arr[i]\r\n else:\r\n if arr[i] > maximum:\r\n a += 1\r\n maximum = arr[i]\r\n elif arr[i] < minimum:\r\n a += 1\r\n minimum = arr[i]\r\nprint(a)", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nmin1=max1=l[0]\r\ncount=0\r\ni=1\r\nwhile i<n:\r\n if l[i]>max1:\r\n max1=l[i]\r\n count=count+1\r\n \r\n elif l[i]<min1:\r\n min1=l[i]\r\n count=count+1\r\n i=i+1\r\nprint(count)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nans = 0\r\nmax = l[0]\r\nmin = l[0]\r\nfor i in range(1,n):\r\n if(l[i]>max):\r\n ans += 1\r\n max = l[i]\r\n elif(l[i]<min):\r\n ans += 1\r\n min = l[i]\r\n else:\r\n ans += 0\r\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\nh=a[0]\r\nl=a[0]\r\nc=0\r\nfor i in range(1,n):\r\n if(a[i]>h):\r\n h=a[i]\r\n c=c+1\r\n elif(a[i]<l):\r\n l=a[i]\r\n c=c+1\r\nprint(c)", "cont = 0\nn = int(input())\nnumbers = input()\nlistNumbers = numbers.split(\" \")\n\nfor i in range(n):\n listNumbers[i] = int(listNumbers[i])\n \nmaior = listNumbers[0]\nmenor = listNumbers[0]\n\nfor i in range(n):\n if(listNumbers[i] > maior): \n maior = listNumbers[i]\n cont+=1\n elif(listNumbers[i] < menor):\n menor = listNumbers[i]\n cont+=1\n \nprint(cont)\n\t \t\t \t\t\t\t\t \t \t", "def Username(n):\r\n\r\n data = input().split()\r\n\r\n best = int(data[0])\r\n worst = int(data[0])\r\n\r\n count = 0\r\n\r\n for i in range(1, len(data)):\r\n\r\n if int(data[i]) > best:\r\n best = int(data[i])\r\n count += 1\r\n\r\n if int(data[i]) < worst:\r\n worst = int(data[i])\r\n count += 1\r\n\r\n return count\r\n\r\nprint(Username(int(input())))", "n= int(input())\r\ns= input()\r\nk= s.split(\" \")\r\n\r\nar=[]\r\nj=0\r\nfor i in range(n):\r\n ar.append(int(k[i]))\r\n ar.sort()\r\n if int(k[i]) == ar[0] :\r\n if(len(ar)>1):\r\n if int(k[i]) < ar[1]:\r\n j=j+1;\r\n else:\r\n j=j+1;\r\n elif int(k[i]) == ar[(len(ar))-1] & int(k[i]) > ar[(len(ar))-2]:\r\n j = j+1\r\n\r\nprint(j-1)", "n=int(input())\r\ns=input().split()\r\nm=[]\r\ncount=0\r\n \r\nfor i in s:\r\n m.append(int(i))\r\nk=0\r\nq=0\r\n\r\nfor j in range(n):\r\n if j==0:\r\n k=m[j]\r\n q=m[j]\r\n\r\n continue\r\n\r\n if m[j]>k:\r\n k=m[j]\r\n count+=1\r\n\r\n if m[j]<q:\r\n q=m[j]\r\n count+=1\r\n\r\nprint(count)", "n=int(input())\r\ncount=0\r\na=list(map(int,input().split()))\r\nfor i in range(1,n):\r\n if a[i]>max(a[0:i]) or a[i]<min(a[0:i]):\r\n count+=1\r\nprint(count)\r\n", "tests = int(input())\r\n\r\na = list(map(int, input().split()))\r\n\r\nb = []\r\nb.append(a[0])\r\nc = 0\r\n\r\nfor i in range(tests):\r\n if a[i] > max(b) or a[i] < min(b):\r\n b.append(a[i])\r\n c += 1\r\n\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmax=l[0]\r\nmin=l[0]\r\nc=0\r\nfor i in l:\r\n if(i>max):\r\n c+=1\r\n max=i\r\n elif(i<min):\r\n c+=1\r\n min=i\r\nprint(c)", "a=int(input())\r\nk=0\r\nb=list(map(int,input().split()))\r\nfor i in range(1,a):\r\n\tif b[i]>max(b[0:i]) or b[i]<min(b[0:i]):\r\n\t\tk+=1\r\nprint(k)", "a=int(input())\r\np=list(map(int,input().split()))\r\nm=p[0]\r\nk=p[0]\r\nc=0\r\nfor i in range(0,a):\r\n if m<p[i]:\r\n m=p[i]\r\n c=c+1\r\n elif(k>p[i]):\r\n k=p[i]\r\n c=c+1\r\nprint(c)", "n = int(input())\nh = list(map(int,input().split()))\na = 0 \nb = w = h[0] \nfor i in range(1,n):\n if h[i] > b:\n b = h[i] \n a += 1 \n elif h[i] <w:\n w = h[i] \n a += 1 \nprint(a)", "n = int(input())\r\nk = [int(x) for x in input().split()]\r\nc =0\r\n\r\nfor i in range(1,len(k)):\r\n \r\n if k[i]> max(k[:i]):\r\n c = c+1\r\n if k[i]< min(k[:i]):\r\n c = c+1 \r\n\r\nprint(c)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nprint(sum(1 for i in range(1,n)if max(l[:i])<l[i] or min(l[:i])>l[i]))\r\n# a=0\r\n# for i in range(1,n):\r\n# \tprint('max',max(l[:i]),'min',min(l[:i]), 'li',l[i])\r\n# \tif l[i]>max(l[:i]) or l[i]<min(l[:i]):\r\n# \t\ta+=1\r\n# print(a)", "def isAmazing() -> int:\r\n t = int(input())\r\n s = str(input())\r\n\r\n lst = [int(x) for x in s.split(' ')]\r\n if len(lst) != t:\r\n return -1\r\n if t == 1:\r\n return 0\r\n # Declare variables for checking max && min\r\n max = int(-1)\r\n min = int(-1)\r\n amazingCount = int(0)\r\n # from index 1\r\n if lst[1] > lst[0]:\r\n max = lst[1]\r\n min = lst[0]\r\n amazingCount += 1\r\n elif lst[1] < lst[0]:\r\n min = lst[1]\r\n max = lst[0]\r\n amazingCount += 1\r\n else:\r\n min = max = lst[0]\r\n # from index 2\r\n for i in range(2, t):\r\n if lst[i] > max:\r\n max = lst[i]\r\n amazingCount += 1\r\n elif lst[i] < min:\r\n min = lst[i]\r\n amazingCount += 1\r\n return amazingCount\r\n\r\nif __name__ == \"__main__\":\r\n print(isAmazing())\r\n", "n = int(input())\r\npoints = list(map(int, input().split()))\r\nmaximum= points[0]\r\nminimum = points[0]\r\namazing = 0\r\nfor i in range(1, n):\r\n if maximum < points[i]:\r\n amazing += 1\r\n maximum = points[i]\r\n elif minimum > points[i]:\r\n amazing += 1\r\n minimum = points[i]\r\n\r\nprint(amazing)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = []\r\nc = 0\r\nfor i in range(0, len(a)):\r\n if i == 0:\r\n b.append(a[i])\r\n continue\r\n else:\r\n if a[i] > max(b):\r\n c += 1\r\n if a[i] < min(b):\r\n c += 1\r\n b.append(a[i])\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\ns=0\r\nfor i in range(1,n):\r\n if l[i]<min(l[:i]) or l[i]>max(l[:i]):\r\n s+=1\r\nprint(s)", "n=int(input(''))\r\nc=input()\r\nb=c.split(' ')\r\nd=[]\r\ns=0\r\nfor i in b:\r\n d.append(int(i))\r\ne=[d[0]]\r\nfor k in d:\r\n if k>max(e) or k<min(e):\r\n s+=1 \r\n else:\r\n continue \r\n if k not in e:\r\n e.append(k)\r\n else:\r\n continue\r\nprint(s)", "anti = 100001\r\nrec = -1\r\n\r\namazing = 0\r\n\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nrec = l[0]\r\nanti = l[0]\r\nfor i in range(1, n):\r\n if min(l[i], anti) == l[i] and min(l[i], anti) != anti:\r\n amazing += 1\r\n anti = l[i]\r\n if max(l[i], rec) == l[i] and max(l[i], rec) != rec:\r\n amazing += 1\r\n rec = l[i]\r\nprint(amazing)", "n = int(input())\r\nscrs = [int(s) for s in input().split()]\r\nmax_scr = min_scr = scrs[0]\r\nans = 0\r\nfor i in range(1, n):\r\n if scrs[i] > max_scr:\r\n ans += 1\r\n max_scr = scrs[i]\r\n elif scrs[i] < min_scr:\r\n ans += 1\r\n min_scr = scrs[i]\r\nprint(ans)", "n = int(input())\r\nr = list(map(int,input().split()))\r\nmx,mn = r[0],r[0]\r\nans = 0\r\nfor i in range(1,len(r)):\r\n if r[i] > mx:\r\n ans += 1 \r\n mx = r[i] \r\n if r[i] < mn:\r\n ans += 1 \r\n mn = r[i] \r\nprint(ans)", "p,*a=map(int,open(0).read().split())\r\nb=a[:1]\r\nfor x in a:\r\n\tp-=min(b)<=x<=max(b)\r\n\tb+=x,\r\nprint(p)", "a=int (input())\r\nc=[int(i) for i in input().split()]\r\nl=c[0]\r\nd=c[0]\r\nn=1\r\nv=0\r\nwhile n<=len(c)-1 :\r\n if c[n]>l :\r\n v+=1\r\n if c[n]>l :\r\n l=c[n]\r\n if c[n]<d :\r\n v+=1\r\n if c[n]<d:\r\n d=c[n]\r\n n+=1\r\nprint(v)\r\n", "n = int(input())\r\ns = [int(el) for el in input().split()]\r\nmaxim = s[0]\r\nminim = s[0]\r\ncount = 0\r\nfor i in range(1, n):\r\n if s[i] > maxim:\r\n count += 1\r\n maxim = s[i]\r\n if s[i] < minim:\r\n count += 1\r\n minim = s[i]\r\nprint(count)\r\n", "n = int(input())\r\nstring = list(map(int, input().split()))\r\nmax1 = min1 = string[0]\r\ncount = 0\r\nfor i in range(1, n):\r\n if string[i] > max1:\r\n max1 = string[i]\r\n count += 1\r\n elif string[i] < min1:\r\n min1 = string[i]\r\n count += 1\r\n\r\n\r\nprint(count)", "a = int(input())\r\n*l, = map(int, input().split(' '))\r\nr = 0;s = [l[0]]\r\n\r\nfor i in range(1, a):\r\n if l[i] < min(s):\r\n s.append(l[i])\r\n r += 1\r\n elif l[i] > max(s):\r\n s.append(l[i])\r\n r += 1\r\n\r\nprint(r)\r\n", "a = int(input())\r\nb = list(map(int, input().split()))\r\ncount = 0\r\nfor i in range(1,a):\r\n c = b[:i+1]\r\n if c.count(min(c))==1 and min(c)==b[i] or max(c)==b[i] and c.count(max(c))==1:\r\n count+=1\r\nprint(count)\r\n ", "no=int(input())\nscores=input()\nscores=scores.split(' ')\nscores=[int(x) for x in scores]\nmin_score=scores[0]\nmax_score=scores[0]\namazing=0\n\nfor i in range(1,no):\n if(scores[i]>max_score):\n max_score=scores[i]\n amazing+=1\n elif (scores[i]<min_score):\n min_score=scores[i]\n amazing+=1\n\n\nprint(amazing) \n\t \t \t\t \t\t \t \t\t\t \t\t\t \t \t", "n = int(input())\nresults = list(map(int, input().split()))\nbest = results[0]\nworst = results[0]\nbest_count = 0\nworst_count = 0\nfor i in range(1, n):\n if results[i] > best:\n best = results[i]\n best_count += 1\n elif results[i] < worst:\n worst = results[i]\n worst_count += 1\nprint(best_count+worst_count)\n", "n = int(input())\r\nscores = [int(x) for x in input().split()]\r\nmaxScore, minScore = scores[0], scores[0]\r\namazing = 0\r\nfor i in range(1, n):\r\n for j in range(i, 0, -1):\r\n if maxScore < scores[j]:\r\n maxScore = scores[j]\r\n amazing += 1\r\n break\r\n elif minScore > scores[j]:\r\n minScore = scores[j]\r\n amazing += 1\r\n break\r\nprint(amazing)\r\n", "n = int(input())\r\nnums = list(map(int, input().split()))\r\n# print(nums)\r\nminP, maxP = float('inf'), -float('inf')\r\n\r\namazingP = -1\r\nfor num in nums:\r\n if minP > num or num > maxP:\r\n amazingP += 1\r\n\r\n minP, maxP = min(minP, num), max(maxP, num)\r\n\r\nprint(amazingP)\r\n", "num=int(input())\r\na=[int(i) for i in input().split()]\r\nk=0\r\nfor i in range(1,len(a)):\r\n if a[i]<min(a[:i]) or a[i]>max(a[:i]):\r\n k+=1\r\nprint(k)", "i=int(input())\r\narrays=input().split()\r\narray=list(map(int, arrays))\r\nmayor=array[0]\r\nmayori=0\r\nmenori=0\r\nmenor=array[0]\r\ncontador=0\r\nfor j in array:\r\n if j<menor:\r\n contador+=1\r\n menori=array.index(j)\r\n menor=j\r\n if j>mayor:\r\n contador+=1\r\n mayori=array.index(j)\r\n mayor=j\r\nprint(contador)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nm = arr[0]\r\nc = 0\r\nfor i in arr:\r\n if m > i:\r\n m = i\r\n c+=1\r\nm = arr[0]\r\nfor i in arr:\r\n if m < i:\r\n m=i\r\n c+=1\r\nprint(c)", "n = int(input())\r\nm = list(map(int,input().split()))\r\nk = 0\r\nmax_ = m[0]\r\nmin_ = m[0]\r\nfor i in range(1,n):\r\n if m[i] > max_:\r\n k +=1\r\n max_ = m[i]\r\n if m[i] < min_:\r\n k +=1\r\n min_ = m[i]\r\n \r\nprint(k)", "n = int(input())\r\nperformances = list(map(int, input().split()))\r\n\r\namazing = 0\r\nmaximum = performances[0]\r\nminimum = performances[0]\r\n\r\nfor i in range(1, n):\r\n if performances[i] > maximum:\r\n maximum = performances[i]\r\n amazing += 1\r\n if performances[i] < minimum:\r\n minimum = performances[i]\r\n amazing += 1\r\n\r\nprint(amazing)", "n=int(input())\r\nx=list(map(int,input().split()))\r\nm=x[0]\r\nn=x[0]\r\nc=0\r\nfor i in x:\r\n if(i>m):\r\n c+=1\r\n m=i\r\n elif(i<n):\r\n c+=1\r\n n=i\r\nprint(c)", "n = int(input())\r\nm = list(map(int, input().split()))\r\nmini = m[0]\r\nmaxi = m[0]\r\nc = 0\r\nfor i in range(1, n):\r\n if(m[i]<mini):\r\n c+=1\r\n mini = m[i]\r\n elif(m[i]>maxi):\r\n c+=1\r\n maxi = m[i]\r\nprint(c)", "x=int(input())\r\nl=list(map(int,input().split()))\r\ncount=0\r\nbest=l[0]\r\nworst=l[0]\r\nfor i in range(1,len(l)):\r\n if l[i]>best:\r\n count+=1\r\n best=l[i]\r\n if l[i]<worst:\r\n count+=1\r\n worst=l[i]\r\nprint(count)\r\n", "x=int(input())\r\ny=list(map(int,input().split()))\r\na=y[0]\r\nc=y[0]\r\nans=0\r\nfor z in range(x):\r\n b=y[z]\r\n if a<b:\r\n a=b\r\n ans=ans+1\r\n if c>b:\r\n c=b\r\n ans=ans+1\r\nprint(ans)", "n = int(input())\r\nt = list(map(int, input().split()))\r\na = 0\r\ne = x = t[0]\r\nfor i in range(1, n):\r\n if t[i] < e:\r\n e = t[i]\r\n a += 1\r\n elif t[i] > x:\r\n x = t[i]\r\n a += 1\r\nprint(a)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\ncount = 0\r\nbest = lst[0]\r\nworst = lst[0]\r\nfor i in range(1, len(lst)):\r\n if lst[i] > best:\r\n best = lst[i]\r\n count += 1\r\n if lst[i] < worst:\r\n worst = lst[i]\r\n count += 1\r\nprint(count)", "n = int(input())\r\nline = list(map(int,input().split()))\r\n\r\nbest = line[0]\r\nworst = line[0]\r\nc = 0\r\n\r\nfor i in line:\r\n if i > best:\r\n best = i\r\n c += 1\r\n if i < worst:\r\n worst = i\r\n c+=1\r\n\r\nprint(c)\r\n \r\n\r\n", "x=int(input())\r\ns=0\r\na=list(map(int,input().split()))\r\nz=a[0]\r\nq=a[0]\r\nfor i in range (1,x):\r\n if a[i]<z :\r\n s=s+1\r\n z=a[i]\r\n elif a[i]>q:\r\n s=s+1\r\n q=a[i]\r\nprint(s)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nx=[l[0]]\r\nc=0\r\nfor i in range(1,n):\r\n a=max(x)\r\n b=min(x)\r\n if(l[i]>a):\r\n c+=1\r\n if(l[i]<b):\r\n c+=1\r\n x.append(l[i])\r\nprint(c)\r\n ", "n = int(input())\r\nv = list(map(int,input().split(' ')))\r\nmx , mn = -1,-1\r\nnumber_of_amazing_perf = 0\r\nfor i in range(len(v)):\r\n if i == 0:\r\n mx,mn = v[i],v[i]\r\n else:\r\n if v[i] > mx:\r\n mx = v[i]\r\n number_of_amazing_perf += 1\r\n if v[i] < mn:\r\n mn = v[i]\r\n number_of_amazing_perf += 1\r\nprint(number_of_amazing_perf)", "n = int(input())\r\ns = [int(i) for i in input().split()]\r\n\r\nmax_s = s[0]\r\nmin_s = s[0]\r\nc = 0\r\nfor i in range(1,len(s)):\r\n if s[i] > max_s:\r\n max_s = s[i]\r\n c+=1 \r\n elif s[i] < min_s:\r\n min_s = s[i]\r\n c+=1\r\n\r\nprint(c)", "\"\"\"I love username\"\"\"\r\n\r\ndef main():\r\n n = int(input())\r\n lst = [int(i) for i in input().split()]\r\n num_min = lst[0]\r\n num_max = lst[0]\r\n count = 0\r\n for i in lst:\r\n if num_min > i:\r\n count += 1\r\n num_min = i\r\n if num_max < i:\r\n count += 1\r\n num_max = i\r\n print(count)\r\nif __name__ == \"__main__\":\r\n main()", "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 = int(input())\r\nl = list(getints())\r\nmx = l[0]\r\nmn = l[0]\r\nans = 0\r\nfor i in range(1,n):\r\n if l[i] > mx:\r\n mx = l[i]\r\n ans += 1\r\n elif l[i] < mn:\r\n mn = l[i]\r\n ans += 1\r\nprint(ans)", "count=0\r\nn=int(input())\r\ni=1\r\nl=list(map(int,input().split()))\r\nmax=l[0]\r\nmin=l[0]\r\na = 1\r\nwhile i<n:\r\n if l[a]>max:\r\n max=l[a]\r\n count += 1\r\n elif l[a]<min:\r\n min=l[a]\r\n count += 1\r\n a+=1\r\n i+=1\r\nprint(count)", "a = int(input()) # кол-во чисел\r\nb = input().split() # числа\r\nmax = int(b[0])\r\nmin = int(b[0])\r\nc = 0 # amazing\r\n#print(b)\r\nfor i in range(a):\r\n d = int(b[i])\r\n if d > max:\r\n max = d\r\n c = c + 1\r\n #print('max = ',max,'c = ',c,'b[i] = ',d)\r\n if d < min:\r\n min = d\r\n c = c + 1\r\n #print('min = ',min,'c = ',c,'b[i] = ',d)\r\nprint(c) ", "x=input;x()\r\ny=list(map(int,x().split()))\r\nmi=ma=y[0]\r\nc=0\r\nfor i in y[1::]:\r\n if i>ma:\r\n ma=i\r\n c+=1\r\n elif i<mi:\r\n mi=i\r\n c+=1\r\nprint(c)", "n=int(input())\r\nl1=[int(x) for x in input().split()]\r\nc=0\r\nfor i in range(1,n):\r\n if max(l1[:i])<l1[i] or min(l1[:i])>l1[i]:\r\n c=c+1\r\nprint(c)", "n = int(input())\r\nline = [int(x) for x in input().split() ]\r\nMin = line[0]\r\nMax = line[0]\r\ncount = 0 \r\nfor i in range(n): \r\n if line[i] > Max: \r\n count += 1\r\n Max = line[i]\r\n elif line[i] < Min: \r\n count += 1\r\n Min = line[i]\r\n\r\nprint(count)", "n = int(input())\r\na = input().split()\r\nb = int(a[0])\r\nc = int(a[0])\r\ne = 0\r\nfor i in range(1, len(a)):\r\n if int(a[i]) > b :\r\n b = int(a[i])\r\n e += 1\r\n if int(a[i]) < c :\r\n c = int(a[i])\r\n e += 1\r\nprint( e )", "n = int(input())\r\na = list(map(int, input().split()))\r\nx = a[:1]\r\nfor i in a:\r\n n -= min(x)<=i<=max(x)\r\n x += [i]\r\nprint (n)", "n = int(input())\r\narr = list(map(int,input().split()))\r\n\r\nmx = arr[0]\r\nmi = arr[0]\r\nans = [arr[0]]\r\naw = 0\r\nfor i in arr[1:]:\r\n if i>mx:\r\n aw +=1\r\n mx = i\r\n elif i<mi:\r\n aw+=1\r\n mi=i\r\nprint(aw)", "n=int(input())\r\ns=input()\r\ns=s.split()\r\nl=list(s)\r\nfor i in range(0,n):\r\n l[i]=int(l[i])\r\nmaxi=l[0]\r\nmini=l[0]\r\ncount=0\r\nfor i in range(0,n):\r\n if(l[i]>maxi):\r\n maxi=l[i]\r\n count+=1\r\n elif(l[i]<mini):\r\n mini=l[i]\r\n count+=1\r\nprint(count)\r\n ", "n=int(input())\r\nh=[int(i) for i in input().split()]\r\nmax=h[0]\r\nmin=h[0]\r\nc=0\r\nfor i in range(1,len(h)):\r\n if h[i]>max:\r\n max=h[i]\r\n c+=1\r\n elif h[i]<min:\r\n min=h[i]\r\n c+=1\r\nprint(c)", "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\nn=int(input())\r\na=list(map(int,input().split()))\r\nmaxx=-1;minn=10001\r\ncnt=0\r\nfor i in range(n):\r\n if i:\r\n if a[i]>maxx:\r\n cnt+=1\r\n elif a[i]<minn:\r\n cnt+=1\r\n maxx=max(maxx,a[i])\r\n minn=min(minn,a[i])\r\nprint(cnt)", "n = int(input())\r\nscore = [int(i) for i in input().split()]\r\nbest1 = worst1 = score[0]\r\namazing = 0\r\nfor i in score:\r\n if i > best1:\r\n best1 = i\r\n amazing += 1\r\n elif i < worst1:\r\n worst1 = i\r\n amazing +=1\r\nprint(amazing)", "a = input()\n\nb = list(map(int, input().split()))\n\n\nbest = worest = b[0]\n\namazing = 0\nfor i in b:\n if best > i:\n amazing += 1\n best = i\n if worest < i:\n amazing += 1\n worest = i\n\nprint(amazing)\n", "n=int(input())\r\nscores = list(map(int,input().split()))\r\nmini=scores[0]\r\nmaxi=mini\r\nc=0\r\nfor i in range(1,n):\r\n if scores[i]<mini:\r\n c+=1\r\n mini=scores[i]\r\n if scores[i]>maxi:\r\n maxi=scores[i]\r\n c+=1 \r\nprint(c)", "n = int(input())\r\ndata = list(map(int, input().split()))\r\nhigh, low = data[0], data[0]\r\namazing = 0\r\nfor i in data:\r\n if i > high:\r\n amazing += 1\r\n high = i\r\n if i < low:\r\n amazing += 1\r\n low = i\r\nprint(amazing)\r\n", "# 155A - I_love_\\%username\\%\r\nif __name__ == '__main__' :\r\n cases = int(input())\r\n lst = [int(x) for x in input().split()]\r\n val_max = lst[0]\r\n val_min= lst[0]\r\n amazing = 0\r\n del lst[0]\r\n for number in lst :\r\n if number > val_max :\r\n val_max = number\r\n amazing += 1\r\n if number < val_min :\r\n val_min = number\r\n amazing += 1\r\n print(amazing)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmax=None\r\nmin=None\r\nc=0\r\nfor i in range(1,n):\r\n if min is None:\r\n min=l[0]\r\n if max is None:\r\n max=l[0]\r\n if l[i]>max:\r\n max=l[i]\r\n c+=1\r\n elif l[i]<min:\r\n min=l[i]\r\n c+=1\r\nprint(c)", "def count_amazing_performances(n, points):\r\n if n <= 1:\r\n return 0\r\n \r\n amazing_count = 0\r\n best_performance = points[0]\r\n worst_performance = points[0]\r\n \r\n for i in range(1, n):\r\n if points[i] > best_performance:\r\n amazing_count += 1\r\n best_performance = points[i]\r\n elif points[i] < worst_performance:\r\n amazing_count += 1\r\n worst_performance = points[i]\r\n \r\n return amazing_count\r\n\r\n# Read input\r\nn = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\n# Calculate and print the number of amazing performances\r\nprint(count_amazing_performances(n, points))\r\n", "n = int(input())\r\nk = input().split(\" \")\r\nK = list(map(int,k))\r\ndef ABC(X):\r\n dem=0\r\n max=X[0]\r\n min=X[0]\r\n for j in range(len(X)):\r\n if K[j]>max or K[j]< min:\r\n if K[j]> max:\r\n max=K[j]\r\n if K[j]< min:\r\n min=K[j]\r\n dem+=1\r\n return dem\r\nprint(ABC(K))", "n = int(input())\r\na = [int(a) for a in input().split()]\r\nnumber_min = a[0]\r\nnumber_max = a[0]\r\ncount = 0\r\nfor i in range(n):\r\n if a[i]<number_min:\r\n number_min=a[i]\r\n count+=1\r\n elif a[i]>number_max:\r\n number_max=a[i]\r\n count+=1\r\nprint(count)\r\n", "test,*number=map(int,open(0).read().split())\r\nz=number[:1]\r\nfor x in number:\r\n\ttest-=min(z)<=x<=max(z)\r\n\tz+=x,\r\nprint(test)", "o=int(input())\r\np=[int(i) for i in input().split()]\r\nmin=p[0]\r\nmax=p[0]\r\ncount=0\r\nfor i in p:\r\n if i>max:\r\n count+=1\r\n max=i\r\n elif i<min:\r\n count+=1\r\n min=i\r\nprint(count)", "T = int(input())\r\na = input()\r\na = a.split()\r\na = [int(x) for x in a]\r\nk = 0\r\nmax_a = a[0]\r\nmin_a = a[0]\r\nfor i in a:\r\n if i < min_a:\r\n min_a = i\r\n k += 1\r\n elif i > max_a:\r\n max_a = i\r\n k += 1\r\nprint(k)", "n = int(input())\r\npoints = list(map(int,input().split()))\r\nc = 0\r\nfor i in range(1,n):\r\n higher = 0\r\n lower =0\r\n for j in range(0,i):\r\n if points[i]>points[j]:\r\n higher+=1\r\n elif points[i]<points[j]:\r\n lower+=1\r\n if lower == i or higher == i:\r\n c+=1 \r\nprint(c)\r\n", "n = int(input())\r\nscore = list(map(int, input().split()))\r\nbest = score[0]\r\nworst = score[0]\r\nans = 0\r\nfor i in score:\r\n if i>best:\r\n best=i\r\n ans+=1\r\n elif i<worst:\r\n worst=i\r\n ans+=1\r\nprint(ans)", "n = int(input())\r\nscore_list = [int(i) for i in input().split()]\r\nbest = score_list[0]\r\nless = score_list[0]\r\ncounter = 0\r\n\r\nfor x in range(n):\r\n if x <= n:\r\n if best < score_list[x]:\r\n best = score_list[x]\r\n counter += 1\r\n if score_list[x] < less:\r\n less = score_list[x]\r\n counter += 1\r\nprint(counter)\r\n", "a=int(input())\r\nd=0\r\nb=[int(x) for x in input().split()]\r\nc=b[0]\r\ne=b[0]\r\nfor i in b[1:]:\r\n if i<c:\r\n d+=1\r\n c=i\r\n elif i>e:\r\n d+=1\r\n e=i\r\nprint(d)\r\n ", "n = int(input())\r\nli = list(map(int, input().split()))\r\nmx = mn = li[0]\r\nc = 0 \r\nfor i in li[1:]:\r\n if i > mx:\r\n c += 1 \r\n mx = i \r\n elif i < mn:\r\n c += 1\r\n mn = i \r\nprint(c)", "x=int(input())\r\ny=[int(x) for x in input().split()]\r\nmin=y[0]\r\nmax=y[0]\r\namazing=0\r\nfor i in y :\r\n if i<min:\r\n amazing+=1\r\n min=i\r\n elif i>max:\r\n amazing+=1\r\n max=i\r\n else:\r\n continue\r\nprint(amazing)\r\n", "def main():\r\n n = int(input().strip())\r\n points = list(map(int, input().strip().split()))\r\n best = worst = points[0]\r\n count = 0\r\n for i in range(1, n):\r\n if points[i] > best:\r\n count += 1\r\n best = points[i]\r\n elif points[i] < worst:\r\n count += 1\r\n worst = points[i]\r\n print(count)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "import math\r\n\r\n\r\ndef inp(): # int inputs\r\n return (int(input()))\r\n\r\n\r\ndef inlt(): # list inputs\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr(): # string inputs\r\n s = input()\r\n return (list(s[:len(s)]))\r\n\r\n\r\ndef invr(): # space sepreated intergel varibales\r\n return (map(int, input().split()))\r\n\r\nk = int(input())\r\n\r\nlist = inlt()\r\n\r\n\r\namaze = 0\r\ncurr_max = list[0]\r\ncurr_min = list[0]\r\n\r\nfor i in range(1, k):\r\n\r\n\r\n\r\n if (curr_max < list[i]):\r\n curr_max = list[i]\r\n amaze += 1\r\n\r\n if (curr_min > list[i]):\r\n curr_min = list[i]\r\n amaze += 1\r\nprint(amaze)\r\n\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\nc = 0\r\na1 = a[0]\r\na2 = a[0]\r\nfor i in a:\r\n if i < a1:\r\n a1 = i\r\n c+=1\r\n \r\n elif i > a2:\r\n a2 = i\r\n c+=1\r\n \r\n\r\nprint(c)", "n=int(input())\r\nl1=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,n):\r\n g=0\r\n l=0\r\n for j in range(i-1,-1,-1):\r\n if l1[i]>l1[j]:\r\n g+=1\r\n elif l1[i]<l1[j]:\r\n l+=1\r\n elif l1[i]==l1[j]:\r\n pass\r\n if g==(i) or l==(i):\r\n c+=1\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nh=l=a[0]\r\nc1,c2=0,0\r\nfor i in range(1,n):\r\n if(a[i]>h):\r\n h=a[i]\r\n c1=c1+1\r\n elif a[i]<l:\r\n l=a[i]\r\n c2=c2+1\r\nprint(c1+c2)", "n = int(input())\nnum = list(map(int, input().split()))\nmin = num[0]\nmax = num[0]\ncount = 0\nfor i in range(1, len(num)):\n if num[i] > max:\n max = num[i]\n count += 1\n elif num[i] < min:\n min = num[i]\n count += 1\nprint(count)\n \t \t \t\t\t\t \t \t \t\t\t\t \t\t\t", "a = int(input())\r\narr = list(map(int , input().split()))\r\nmi = arr[0]\r\nma = arr[0]\r\ntotal = 0\r\nfor i in range(a):\r\n if arr[i] < mi:\r\n total += 1\r\n mi = arr[i]\r\n if arr[i] > ma:\r\n total += 1\r\n ma = arr[i]\r\nprint(total)", "a=int(input())\r\nb=input().split()\r\nfor i in range(a):\r\n b[i]=int(b[i]) \r\ncounter=0\r\nfor x in range(1,a):\r\n c=b[x]\r\n count1,count2=0,0\r\n for v in range(x):\r\n if c>b[v]:\r\n count1+=1\r\n elif c<b[v]:\r\n count2+=1\r\n if count1==x:\r\n counter+=1\r\n if count2==x:\r\n counter+=1\r\nprint(counter)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmn=l[0]\r\nmx=l[0]\r\nans=0\r\nfor i in range(1,n):\r\n\tif(l[i]>mx):\r\n\t\tans+=1\r\n\t\tmx=l[i]\r\n\telif(l[i]<mn):\r\n\t\tans+=1\r\n\t\tmn=l[i]\r\nprint(ans)", "# n, k = [int(i) for i in input().split()]\r\n# arr = [int(i) for i in input().split()]\r\n# next=0\r\n# for i in arr:\r\n# if i>=arr[k-1]and i>0:\r\n# next+=1\r\n# print(next)\r\n# import random\r\n#\r\n# array = [int(i) for i in input().split('+')]\r\n#\r\n#\r\n# def qsort(arr):\r\n# if len(arr) < 1:\r\n# return arr\r\n# num = random.choice(arr)\r\n# smaller = []\r\n# equalls = []\r\n# bigger = []\r\n# for i in arr:\r\n# if i < num:\r\n# smaller.append(i)\r\n# elif i > num:\r\n# bigger.append(i)\r\n# else:\r\n# equalls.append(i)\r\n# return qsort(smaller) + equalls + qsort(bigger)\r\n#\r\n#\r\n# arr = qsort(array)\r\n# print('+'.join([str(i) for i in arr]))\r\n#print(*arr, sep='+')\r\n\r\n\r\nn = int(input())\r\narr = [int(i) for i in input().split()]\r\nma = arr[0]\r\nmi = arr[0]\r\nwonder = 0\r\nfor i in range(1, len(arr)):\r\n if arr[i]<mi:\r\n wonder+=1\r\n mi = arr[i]\r\n elif arr[i]>ma:\r\n wonder+=1\r\n ma = arr[i]\r\nprint(wonder)", "events = int(input())\r\nnumbers = [int(thing) for thing in input().split()]\r\ncurmax, curmin = numbers[0], numbers[0]\r\ncount = 0\r\nfor number in numbers[1:]:\r\n if curmax < number :\r\n count += 1\r\n curmax = number\r\n elif curmin > number:\r\n count += 1\r\n curmin = number\r\n\r\nprint(count)", "n=int(input())\r\nar=[int(X) for X in input().split()]\r\nMax=Min=ar[0]\r\namazing=0\r\nfor i in range(1,n):\r\n if ar[i]>Max:\r\n amazing+=1 \r\n Max=ar[i]\r\n elif ar[i]<Min:\r\n amazing+=1 \r\n Min=ar[i]\r\n \r\nprint(amazing)\r\n\r\n \r\n ", "n = int(input())\r\nlist = input().split()\r\nmaxx = int(list[0]) #index\r\nminn = int(list[0])\r\namazing = 0 \r\nfor i in list:\r\n i = int(i)\r\n if i>maxx:\r\n amazing = amazing +1\r\n maxx = i\r\n if i<minn:\r\n amazing = amazing +1\r\n minn = i \r\nprint(amazing)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmx=a[0]\r\nmn=a[0]\r\nc=0\r\nfor i in a:\r\n if i>mx:\r\n mx=i\r\n c+=1\r\n if i<mn:\r\n mn=i\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\ns = 0\r\n\r\nfor i in range(1, n):\r\n if a[i]>max(a[:i]):\r\n s+=1\r\n if a[i]<min(a[:i]):\r\n s+=1\r\nprint(s)\r\n\r\n\r\n\r\n\r\n", "length = int(input())\r\nresults = [int(x) for x in input().split()]\r\ntemp = []\r\ntemp.append(results[0])\r\ncount = 0\r\n\r\nif length > 1:\r\n for i in range(1, length):\r\n \r\n if results[i] > max(temp):\r\n count += 1\r\n elif results[i] < min(temp):\r\n count += 1\r\n\r\n temp.append(results[i])\r\n\r\nprint(count)", "n = int(input())\nvalues = list(map(int, input().split()))\n\nmin_count, max_count = 0, 0\nmin_value, max_value = values[0], values[0]\n\nfor num in values:\n if num < min_value:\n min_value = num\n min_count += 1\n if num > max_value:\n max_value = num\n max_count += 1\n\nprint(min_count + max_count)\n\n\t \t \t \t\t\t \t \t\t \t \t \t \t", "\r\nt = int(input())\r\n\r\narr = [int(i) for i in input().split(\" \")]\r\n\r\nmaxi = arr[0]\r\nmini =arr[0]\r\ncount =0\r\n\r\nfor i in range(1,len(arr)):\r\n \r\n if arr[i] > maxi :\r\n maxi = arr[i]\r\n count+=1 \r\n \r\n \r\n if arr[i] < mini:\r\n mini = arr[i]\r\n count+=1\r\n \r\nprint(count) \r\n \r\n \r\n \r\n \r\n\r\n\r\n", "def solution(l):\n amazing_count = 0\n max_ = min_ = l[0]\n for i in range(1, len(l)):\n if l[i] > max_:\n amazing_count += 1\n max_ = l[i]\n elif l[i] < min_:\n amazing_count += 1\n min_ = l[i]\n return amazing_count\n\n\n\nif __name__ == '__main__':\n n = int(input())\n l = [int(i) for i in input().split()]\n print(solution(l))\n \t\t \t\t \t\t\t \t \t\t \t \t\t", "n = int(input())\r\n\r\nlst = [int(i) for i in input().split()]\r\n\r\nif len(lst)==1:\r\n print(0)\r\n\r\nelse:\r\n lst1=[]\r\n c = 0\r\n for i in lst:\r\n if i not in lst1:\r\n lst1.append(i)\r\n \r\n b= lst1[0]\r\n w = lst1[0]\r\n\r\n for i in range(1,len(lst1)):\r\n if lst1[i] > b:\r\n c+=1 \r\n b = lst1[i]\r\n elif lst1[i] < w:\r\n c+=1 \r\n w = lst1[i]\r\n print(c)", "t=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\nfor i in range(1,t):\r\n c1=0\r\n c2=0\r\n for j in range(0,i):\r\n if(a[j]>a[i]):\r\n c1+=1\r\n elif(a[j]<a[i]):\r\n c2+=1\r\n if(c1==i or c2==i):\r\n c+=1\r\nprint(c) ", "# I_love_%username%\r\ninput()\r\nnums = [int(x) for x in input().split(' ')]\r\nminimo = nums[0]\r\nmaximo = nums[0]\r\ncant = 0\r\nif len(nums) != 1:\r\n for x in nums[1:]:\r\n if x < minimo:\r\n cant += 1\r\n minimo = x\r\n elif x > maximo:\r\n cant += 1\r\n maximo = x\r\nprint(cant)\r\n", "import math\n\nn = int(input())\nsco = [int(i) for i in input().split()]\nmx=sco[0]\nmn=sco[0]\ncc=0\n\nfor i in range(1,len(sco)):\n if (sco[i]>mx):\n mx=sco[i]\n cc+=1\n elif (sco[i]<mn):\n mn=sco[i]\n cc+=1\n\nprint(cc)\n\n \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\nmax = lst[0]\r\nmin = lst[0]\r\ncount=0\r\nfor x in range(1,n):\r\n if(lst[x] > max):\r\n max=lst[x]\r\n count+=1\r\n if(lst[x] < min):\r\n min=lst[x]\r\n count+=1\r\n\r\n \r\nprint(count)\r\n", "n=int(input())\r\narr = [int(item) for item in input().split(' ')]\r\n\r\ncount = 0\r\n\r\n\r\n\r\nfor i in range(1,n):\r\n\tarr[:i] = sorted(arr[:i])\r\n\r\n\tif arr[i] > arr[i-1] or arr[i] < arr[0]: \r\n\t\tcount+=1\r\n\r\n\r\nprint(count)", "number_of_contests = int(input())\r\nscores = input().split()\r\nscores = [int(score) for score in scores]\r\nbest_performance, worst_performance, i, amazing_performance = scores[0], scores[0], 1, 0\r\nwhile i < number_of_contests:\r\n if scores[i] > best_performance:\r\n amazing_performance += 1\r\n best_performance = scores[i]\r\n elif scores[i] < worst_performance:\r\n amazing_performance += 1\r\n worst_performance = scores[i]\r\n i += 1\r\nprint(amazing_performance)", "def count_amazing_performances(points):\r\n n = len(points)\r\n if n <= 1:\r\n return 0\r\n\r\n amazing_count = 0\r\n best_record = worst_record = points[0]\r\n\r\n for i in range(1, n):\r\n if points[i] > best_record:\r\n best_record = points[i]\r\n amazing_count += 1\r\n elif points[i] < worst_record:\r\n worst_record = points[i]\r\n amazing_count += 1\r\n\r\n return amazing_count\r\nn = int(input())\r\npoints = list(map(int, input().split()))\r\namazing = count_amazing_performances(points)\r\nprint(amazing)", "n = int(input())\r\n\r\npoint_list = list(map(int, input().split()))\r\n\r\ntotal = 0\r\n\r\nmax_point = point_list[0]\r\nmin_point = point_list[0]\r\n\r\nfor i in point_list:\r\n if i > max_point:\r\n max_point = i\r\n total += 1\r\n \r\n elif i < min_point:\r\n min_point = i\r\n total += 1\r\n \r\n else:\r\n total = total\r\n \r\nprint(total)", "n = int(input())\r\na = list(map(int, input().split()))\r\nresult = 0\r\nmn = mx = a[0]\r\nfor x in a[1:]:\r\n if x > mx:\r\n result += 1\r\n mx = x\r\n elif x < mn:\r\n result += 1\r\n mn = x\r\nprint(result)\r\n", "n=int(input())\r\nb=list(map(int,input().split()))\r\nm=b[0]\r\nz=b[0]\r\nc=0\r\nfor i in b:\r\n if z < i:\r\n z=i\r\n c+=1\r\n elif m > i:\r\n m=i\r\n c+=1\r\nprint(c)\r\n", "n = int(input())\na = list(map(int, input().split()))\nk = 0\n\n[k := k + 1 for i in range(1, n) if min(a[:i]) > a[i] or max(a[:i]) < a[i]]\nprint(k)\n", "no_of_contest = int(input())\r\nscores = list(map(int, input().split()))\r\nmin_value = scores[0]\r\nmax_value = scores[0]\r\ncount = 0\r\nfor i in range(1, no_of_contest):\r\n if scores[i] > max_value or scores[i] < min_value:\r\n count += 1\r\n max_value = max(max_value, scores[i])\r\n min_value = min(min_value, scores[i])\r\n\r\n\r\nprint(count)", "n = int(input())\n\ncontests = list(map(int, input().split()))\n\ncount = 0\n\nhigh = low = contests[0]\n\nfor i in range(1, len(contests)): \n if contests[i] > high: \n high = contests[i]\n count += 1\n elif contests[i] < low: \n low = contests[i]\n count += 1\nprint(count)\n\n", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\nmin=li[0]\r\nmax=li[0]\r\nc=0\r\n\r\n\r\n \r\nfor i in range(1,n):\r\n if(li[i]<min):\r\n c=c+1 \r\n min=li[i]\r\n if(li[i]>max):\r\n c=c+1 \r\n max=li[i]\r\n \r\nprint(c) ", "t = int(input())\r\nz0 = input().split(\" \")\r\nbf = map(int, z0)\r\na = list(bf)\r\n\r\ncounter = 0\r\nb1 = a[0]\r\nb2 = a[0]\r\nfor i in range(t):\r\n if a[i] > b1:\r\n counter +=1\r\n b1 = a[i]\r\n elif a[i] < b2:\r\n counter +=1\r\n b2 = a[i]\r\nprint(counter)\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\ncount=0\r\nfor i in range(len(arr)):\r\n if i!=0:\r\n if arr[i]>max(arr[:i]) or arr[i]<min(arr[:i]):\r\n count+=1\r\nprint(count)", "def main(arr):\r\n if len(arr) == 1: return 0\r\n\r\n n = 0\r\n\r\n for i in range(1, len(arr)):\r\n for j in range(i):\r\n if arr[i] <= arr[j]: break\r\n\r\n if j == i - 1: n += 1\r\n\r\n for j in range(i):\r\n if arr[i] >= arr[j]: break\r\n\r\n if j == i - 1: n += 1\r\n\r\n return n\r\n\r\nif __name__ == \"__main__\":\r\n _ = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n print(main(arr))", "n = int(input())\r\n\r\nscore = list(map(int, input().split()))\r\n\r\namazing = 0\r\n\r\nmaximum = score[0]\r\nminimum = score[0]\r\n\r\nfor i in score[1:]:\r\n if i > maximum:\r\n maximum = i\r\n amazing+=1\r\n if i < minimum:\r\n minimum = i\r\n amazing+=1\r\n\r\nprint(amazing)", "__=int(input());j=0\r\namaze=0\r\na=[]\r\nif __==1: a.append(int(input()))\r\nelse:\r\n for x in input().split():\r\n if j:\r\n if int(x)>max(a) or int(x)<min(a):\r\n amaze+=1\r\n j+=1\r\n a.append(int(x))\r\nprint(amaze)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nm1=a[0]\r\nm2=a[0]\r\ns=0\r\nfor i in range(1,n):\r\n if a[i]>m1:\r\n m1=a[i]\r\n s+=1\r\n elif a[i]<m2:\r\n m2=a[i]\r\n s+=1\r\nprint(s)", "t=int(input())\r\nc=0\r\nx=list(map(int,input().strip().split()))[:t]\r\nmin=x[0]\r\nmax=x[0]\r\nfor i in range(1,t):\r\n if(x[i]<min):\r\n min=x[i]\r\n c=c+1\r\n elif(x[i]>max):\r\n max=x[i]\r\n c=c+1\r\nprint(c)\r\n \r\n \r\n", "n = int(input())\r\np = list(map(int, input().split()))\r\nmin_s = max_s = p[0]\r\namaz = 0\r\nfor i in range(1, n):\r\n if p[i] < min_s:\r\n min_s = p[i]\r\n amaz += 1\r\n elif p[i] > max_s:\r\n max_s = p[i]\r\n amaz += 1\r\nprint(amaz)", "input()\r\nm=input().split()\r\nmx=mn=int(m[0])\r\nc=0\r\nfor i in m[0::]:\r\n if int(i)>mx:\r\n mx=int(i)\r\n c+=1\r\n if int(i)<mn:\r\n mn=int(i)\r\n c+=1\r\nprint(c)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmi=l[0]\r\nma=l[0]\r\nc=0\r\nfor i in range(n):\r\n if(l[i]<mi):\r\n c+=1 \r\n mi=l[i]\r\n elif(l[i]>ma):\r\n c+=1 \r\n ma=l[i]\r\nprint(c)\r\n ", "n = int(input())\r\npoints = [int(i) for i in input().split()]\r\ncountmin = points[0]\r\ncountmax = points[0]\r\npoints = points[1:]\r\nres = 0\r\nfor i in points:\r\n if i > countmax:\r\n res += 1\r\n countmax = i\r\n elif i < countmin:\r\n res += 1\r\n countmin = i\r\nprint(res)", "n = int(input())\r\nb = input().split()\r\nres = 0\r\nz = max(int(x) for x in b)\r\nmax_num = int(b[0])\r\nmin_num = int(b[0])\r\nif z > 10000:\r\n print(\"уменьшите число\")\r\nelse:\r\n for i in range(1, n):\r\n if int(b[i]) > max_num:\r\n res +=1\r\n max_num = int(b[i])\r\n elif int(b[i]) < min_num:\r\n res +=1\r\n min_num = int(b[i])\r\n print(res)", "import sys \r\n\r\nn = int(sys.stdin.readline().split()[0])\r\n\r\nscores = [int(i) for i in sys.stdin.readline().split()]\r\n\r\namazing = 0\r\ni = 1\r\n\r\nwhile i < len(scores):\r\n\tj = i - 1\r\n\tless_count = 0\r\n\tmore_count = 0\r\n\r\n\twhile j >= 0:\r\n\t\tif scores[i] > scores[j]:\r\n\t\t\tless_count += 1\r\n\t\tif scores[i] < scores[j]:\r\n\t\t\tmore_count += 1\r\n\t\tj -= 1\r\n\tif less_count == i or more_count == i:\r\n\t\tamazing += 1\r\n\ti += 1\r\n\r\nprint(amazing)", "performances = int(input())\r\nscores = list(map(int, input().split()))\r\nmin_result = scores[0]\r\nmax_result = scores[0]\r\nresult = 0\r\nfor i in scores:\r\n if i < min_result:\r\n result += 1\r\n min_result = i\r\n elif i > max_result:\r\n result += 1\r\n max_result = i\r\n\r\nprint(result)", "m,*a=map(int,open(0).read().split())\r\nb=a[:1]\r\nfor x in a:\r\n\tm-=min(b)<=x<=max(b)\r\n\tb+=x,\r\nprint(m)", "n = int(input())\r\nv = list(map(int , input() . split()))\r\nl = [v[0]]\r\nx = 0\r\n\r\nfor i in range(1,n):\r\n if v[i] < min(l) or v[i] > max(l) :\r\n x = x+1\r\n l.append(v[i])\r\nprint(x)\r\n", "nu=int(input())\r\nk=list(map(int,input().split()))\r\nmax=k[0]\r\nmin=k[0]\r\ncu=0\r\nfor i in range(1,nu):\r\n if k[i]>max:\r\n cu+=1\r\n max=k[i]\r\n elif k[i]<min:\r\n cu+=1\r\n min=k[i]\r\nprint(cu) \r\n ", "# -*- coding: utf-8 -*-\r\nn_contests = int(input())\r\nvalues = input().split()\r\n\r\nworst = int(values[0])\r\nbest = int(values[0])\r\namazings = 0\r\n\r\nfor i in range(1, n_contests):\r\n performance = int(values[i])\r\n if performance < worst:\r\n amazings += 1\r\n worst = performance\r\n if performance > best:\r\n amazings += 1\r\n best = performance\r\n \r\nprint(amazings)", "length = int(input())\r\nmarking = list(map(int,input().split()))\r\ncount = 0\r\nfor i in range(1,len(marking)):\r\n if max(marking[:i]) < marking[i]:\r\n count +=1\r\n elif min(marking[:i]) > marking[i]:\r\n count += 1\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\nx = y = a[0]\r\ncnt = 0\r\nfor i in range(1, n):\r\n if a[i] < x:\r\n x = a[i]\r\n cnt += 1\r\n if a[i] > y:\r\n y = a[i]\r\n cnt += 1\r\n\r\nprint(cnt)\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nmin = l[0]\r\nmax = l[0]\r\nct = 0\r\nfor i in range(len(l)):\r\n if l[i] > max :\r\n ct+=1\r\n max = l[i]\r\n if l[i] < min:\r\n ct += 1\r\n min = l[i]\r\nprint(ct)\r\n", "n=int(input())\r\na=[int(s) for s in input().split()]\r\nmu=a[0]\r\nmk=a[0]\r\nuu=0\r\nfor k in range(n):\r\n if (a[k]>mu):\r\n mu=a[k]\r\n uu+=1\r\n elif (a[k]<mk):\r\n mk=a[k]\r\n uu+=1\r\nprint(uu)\r\n", "n = int(input()) # Number of contests\r\npoints = list(map(int, input().split())) # List of points earned\r\n\r\namazing_count = 0 # Initialize the count of amazing performances\r\nmin_points = max_points = points[0] # Initialize min and max points with the first contest\r\n\r\nfor i in range(1, n):\r\n if points[i] < min_points:\r\n min_points = points[i]\r\n amazing_count += 1\r\n elif points[i] > max_points:\r\n max_points = points[i]\r\n amazing_count += 1\r\n\r\nprint(amazing_count)\r\n", "n = int(input())\r\nk = 0\r\na = [int(i) for i in input().split()]\r\nmax = a[0]\r\nmin = a[0]\r\nfor i in range(len(a)):\r\n if a[i] > max:\r\n max = a[i]\r\n k += 1\r\n if a[i] < min:\r\n min = a[i]\r\n k += 1\r\nprint(k)", "n = int(input())\r\na = list(map(int, input().split()))\r\nk= 0\r\nfor i in range(1, n):\r\n c = d = 0\r\n for j in a[:i]:\r\n if a[i] > j:\r\n c+=1\r\n if a[i] < j:\r\n d+=1\r\n if c == i or d == i:\r\n k+=1\r\nprint(k)", "_ = input()\nscores = [int(x) for x in input().split()]\na = 0\nw_p = scores[0]\nb_p = scores[0]\n\nfor s in scores:\n if s > b_p:\n a += 1\n b_p = s\n elif s < w_p:\n a += 1\n w_p = s\n\nprint(a)", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=b[0]\r\nd=b[0]\r\ncol_yd=0\r\nfor i in b:\r\n if c>i:\r\n c=i\r\n col_yd+=1\r\n if d<i:\r\n d=i\r\n col_yd+=1\r\nprint(col_yd)", "#!/usr/local/bin/python\n\nn = int(input())\nl = list(map(int,input().split()))\nmi = l[0]\nct = 0\ncurrent = l[0]\nfor i in range(1,n):\n if l[i] > current:\n ct+=1\n current = l[i]\n if l[i]<mi:\n ct+=1\n mi = l[i]\nprint(ct)\n", "n = input()\r\npoints = list(map(int, input().split()))\r\n\r\nmax = 0\r\nmin = 0\r\nresult = 0\r\n\r\nfor i, point in enumerate(points):\r\n if i == 0:\r\n max=point\r\n min=point\r\n elif i > 0:\r\n if point > max:\r\n result += 1\r\n max =point\r\n elif point < min:\r\n result +=1\r\n min=point\r\n\r\n\r\nprint(result)", "t = int(input())\r\nn = list(map(int, input().split()))\r\ncount = 0\r\nmini = n[0]\r\nmaxi = n[0]\r\nfor i in range(1, t):\r\n if n[i] < mini:\r\n count += 1\r\n mini = n[i]\r\n elif n[i] > maxi:\r\n count += 1\r\n maxi = n[i]\r\nprint(count)\r\n\r\n \r\n ", "n = int(input())\r\nl = list(map(int,input().split()))\r\nmn,mx=l[0],l[0]\r\nans=0\r\nfor it in l:\r\n if it>mx:\r\n mx=it\r\n ans+=1\r\n elif it<mn:\r\n mn=it\r\n ans+=1\r\nprint(ans)", "#!/bin/python3\n\nint(input())\nscore = [int(i) for i in input().split()]\nbest = score[0]\nworst = score[0]\nc = 0\n\nfor x in score[1:]:\n\tif x > best or x < worst:\n\t\tc += 1\n\n\t\tif x > best:\n\t\t\tbest = x\n\t\telif x < worst:\n\t\t\tworst = x\n\t\t\nprint(c)\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\nb = [a[0],]\r\nc = 0\r\nfor i in a:\r\n if i>max(b) or i < min(b): \r\n c+=1\r\n b.append(i)\r\nprint(len(b)-1) ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmn,mx=l[0],l[0]\r\nc=0\r\nfor i in range(1,n):\r\n if l[i]>mx:\r\n c+=1\r\n mx=l[i]\r\n elif l[i]<mn:\r\n c+=1\r\n mn=l[i]\r\nprint(c)", "n = int(input())\r\np = list(map(int, input().split()))\r\n\r\na = 0\r\nmi = ma = p[0]\r\n\r\nfor i in range(1, n):\r\n if p[i] > ma:\r\n ma = p[i]\r\n a += 1\r\n elif p[i] < mi:\r\n mi = p[i]\r\n a += 1\r\n\r\nprint(a)\r\n", "action = int(input())\nscore = input().split()\n\nmin_value = int(score[0])\nmax_value = int(score[0])\namazing = 0\n\nfor point in score:\n if int(point) < min_value:\n min_value = int(point)\n amazing += 1\n elif int(point) > max_value:\n max_value = int(point)\n amazing += 1\n\nprint(amazing)", "n=int(input())\r\na=[int(n) for n in input().split()]\r\nm=a[0]\r\np=a[0]\r\nc=0\r\nfor i in range(1,n):\r\n if a[i]>m:\r\n m=a[i]\r\n c=c+1\r\n elif a[i]<p:\r\n p=a[i]\r\n c=c+1\r\nprint(c)\r\n \r\n ", "\n\ndef main():\n n = input()\n k = tuple(map(int, input().split()))\n\n kmax, kmin = k[0], k[0]\n \n amazings = 0\n\n for i, j in enumerate(k[1::]):\n if j < kmin:\n kmin = j\n amazings += 1\n \n if j > kmax:\n kmax = j\n amazings += 1\n \n print(amazings)\n \n\n\nif __name__ == \"__main__\":\n main()\n", "\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nm,n=a[0],a[0]\r\nd=0\r\nfor j in a:\r\n if j>m:\r\n m=j\r\n d+=1\r\n if j<n:\r\n n=j\r\n d+=1\r\nprint(d)", "n=int(input())\r\na=input().split()\r\nfor i in range(len(a)):\r\n a[i]=int(a[i])\r\nc=0\r\nfor i in range(1,len(a)):\r\n if a[i]>max(a[0:i]) or a[i]<min(a[0:i]):\r\n c+=1\r\nprint(c)\r\n \r\n", "from sys import stdin\r\ninput = stdin.readline\r\n\r\ndef main():\r\n int(input())\r\n l = [int(n) for n in input().split()]\r\n max_s = l[0]\r\n min_s = l[0]\r\n res = 0\r\n for s in l[1:]:\r\n if s > max_s:\r\n max_s = s\r\n res += 1\r\n elif s < min_s:\r\n min_s = s\r\n res += 1\r\n print(res)\r\n\r\nmain()", "def main():\r\n n = int(input())\r\n results = [int(i) for i in input().split()]\r\n # Base case\r\n if n == 1:\r\n print(0)\r\n return\r\n count = 0\r\n for i in range(1, n):\r\n curr_min = min(results[:i])\r\n curr_max = max(results[:i])\r\n if results[i] < curr_min:\r\n curr_min = results[i]\r\n count += 1\r\n if results[i] > curr_max:\r\n curr_max = results[i]\r\n count += 1\r\n print(count)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\na = list(map(int , input().split()))\r\nb = 0\r\nfor i in range(1,n):\r\n hd = a[0:i]\r\n if max(hd) < a[i] or min(hd) > a[i]:\r\n b = b + 1\r\nprint(b)", "n = int(input())\r\narr = list(map(int, input().split()))\r\namazing = 0\r\na = arr[0]\r\nfor m in range(1, n):\r\n if arr[m] > a:\r\n a = arr[m]\r\n amazing += 1\r\na = arr[0]\r\nfor m in range(1, n):\r\n if arr[m] < a:\r\n a= arr[m]\r\n amazing += 1\r\nprint(amazing)\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmina=a[0]\r\nmaxa=a[0]\r\nans=0\r\nfor i in range(1,n):\r\n if(a[i]<mina or a[i]>maxa):\r\n ans+=1\r\n mina,maxa=min(mina,a[i]),max(maxa,a[i])\r\nprint(ans)\r\n ", "n = int(input())\r\npoints = list(map(int, input().split()))\r\nmax_points = points[0] # initialize max and min points\r\nmin_points = points[0]\r\namazing_cnt = 0\r\nfor i in range(1, n):\r\n if points[i] > max_points: # if current points beat the max points record\r\n amazing_cnt += 1\r\n max_points = points[i] # update max points\r\n elif points[i] < min_points: # if current points beat the min points record\r\n amazing_cnt += 1\r\n min_points = points[i] # update min points\r\nprint(amazing_cnt)\r\n", "n=int(input(''))\r\nscore=list(map(int,input('').split()))\r\nmin=max=score[0]\r\n\r\nc=0\r\nfor i in score:\r\n if i>max:\r\n max=i\r\n c+=1\r\n elif i<min:\r\n min=i\r\n c+=1\r\nprint(c)\r\n", "c=0\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nmx=b[0]\r\nmn=b[0]\r\nfor i in b:\r\n if i>mx:\r\n mx=i\r\n c+=1\r\n elif i<mn:\r\n mn=i\r\n c+=1\r\nprint(c)", "a = int(input())\r\nc = [int(i) for i in input().split()]\r\nd = [c[0]]\r\nk = 0\r\nmax1 = 0\r\nmin1 = 0\r\nfor i in range(a):\r\n if c[i] > max(d):\r\n k += 1\r\n if c[i] < min(d):\r\n k += 1\r\n d.append(c[i])\r\nprint(k)\r\n", "i = int(input())\r\n\r\nv = (int(a) for a in input().split())\r\nv = list(v)\r\nc = 0\r\nv2 = []\r\n\r\nfor h in range(0,i):\r\n if h == 0:\r\n pass\r\n elif v[h] < min(v2):\r\n c+=1\r\n elif v[h] > max(v2):\r\n c+=1\r\n\r\n v2.append(v[h])\r\n\r\nprint(c)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nmx = arr[0]\r\nmn = arr[0]\r\ncount = 0\r\n\r\nfor i in range(n):\r\n if arr[i] > mx:\r\n mx = arr[i]\r\n count += 1\r\n elif arr[i] < mn:\r\n mn = arr[i]\r\n count += 1\r\n\r\nprint(count)\r\n", "import sys\r\nimport string\r\n\r\nINF = float('inf')\r\nMOD = 10**9 + 7\r\n\r\nlowercase = string.ascii_lowercase\r\nuppercase = string.ascii_uppercase\r\ndigits = string.digits\r\n\r\ndef read_int():\r\n return int(sys.stdin.readline().strip())\r\ndef read_ints():\r\n return list(map(int, sys.stdin.readline().split()))\r\ndef read_float():\r\n return float(sys.stdin.readline().strip())\r\ndef read_floats():\r\n return list(map(float, sys.stdin.readline().split()))\r\ndef read_str():\r\n return sys.stdin.readline().strip()\r\ndef read_strs():\r\n return sys.stdin.readline().split()\r\ndef write(data) -> None:\r\n sys.stdout.write(str(data) + \"\\n\")\r\n sys.stdout.flush()\r\ndef write_array(arr:list, sep=\" \") -> None:\r\n\tfor i in arr:\r\n\t\tsys.stdout.write(str(i) + sep)\r\n\tsys.stdout.write(\"\\n\")\r\n\tsys.stdout.flush()\r\n\r\ndef main():\r\n n=read_int()\r\n arr=read_ints()\r\n\r\n min, max=arr[0], arr[0]\r\n am=0\r\n\r\n for i in arr:\r\n if i<min:\r\n am+=1\r\n min=i\r\n if i>max:\r\n am+=1\r\n max=i\r\n\r\n write(am)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\npoints = [int(i) for i in input().split()]\r\nanswer = 0\r\nmaxi = points[0]\r\nmini = points[0]\r\nfor point in points:\r\n if point > maxi:\r\n maxi = point\r\n answer += 1\r\n elif point < mini:\r\n mini = point\r\n answer += 1\r\n\r\n\r\nprint(answer)", "\n_ = input()\nk = tuple(map(int, input().split()))\n\nkmax, kmin = k[0], k[0]\n\namazings = 0\n\nfor j in k[1::]:\n if j < kmin:\n kmin = j\n amazings += 1\n \n if j > kmax:\n kmax = j\n amazings += 1\n\nprint(amazings)\n", "n = int(input())\narr = list(map(int, input().split()))\n\nbase = arr[0]\n\ngreater = smaller = base\n\nc = 0\n\nfor i in range(1,n):\n if arr[i] > greater:\n c += 1\n greater = arr[i]\n elif arr[i] < smaller:\n smaller = arr[i]\n c += 1\n\nprint(c)", "n=int(input())\r\nl=list(map(int, input().split()))\r\nk=0\r\nfor i in range(2, len(l)+1):\r\n l1=l[0:i]\r\n if(l1[i-1]==max(l1) or l1[i-1]==min(l1)):\r\n if(l1.count(l1[i-1])<2):\r\n k=k+1\r\nprint(k)", "x = int(input())\r\na = list(map(int, input().split()))\r\nmax_val = a[0]\r\nmin_val = a[0]\r\ncount = 0\r\ni = 1\r\n\r\nwhile i < len(a):\r\n if a[i] > max_val:\r\n count += 1\r\n max_val = a[i]\r\n elif a[i] < min_val:\r\n count += 1\r\n min_val = a[i]\r\n i += 1\r\n\r\nprint(count)\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\npmin = l[0]\r\npmax = l[0]\r\ncount = 0\r\nfor i in range(1, len(l)):\r\n if l[i] < pmin or l[i] > pmax:\r\n count += 1\r\n pmin = min(pmin, l[i])\r\n pmax = max(pmax, l[i]) \r\nprint(count)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Mar 28 12:24:38 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\nscores=list(map(int,input().split()))\r\ntemp=[scores[0]]\r\na=0\r\nfor i in range(1,n):\r\n if scores[i]>max(temp) or scores[i]<min(temp):\r\n a=a+1\r\n temp.append(scores[i])\r\n \r\nprint(a)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nflag=0\r\nb=2\r\nfor i in range(1,n):\r\n b=2\r\n for j in range(0,i):\r\n if b!=0 and l[i]>l[j]:\r\n b=1\r\n elif b!=1 and l[i]<l[j]:\r\n b=0\r\n else:\r\n b=2\r\n break\r\n if b==0 or b==1:\r\n flag+=1\r\nprint(flag)", "n = int(input())\r\np = list(map(int, input().split()))\r\nb = w = p[0]\r\na = 0\r\nfor i in range(1, n):\r\n if p[i] > b:\r\n b = p[i]\r\n a += 1\r\n if p[i] < w:\r\n w = p[i]\r\n a += 1\r\nprint(a)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = [a[0]]\r\nt = 0\r\nfor i in range(1, n):\r\n if a[i] < min(b) or a[i] > max(b):\r\n t += 1\r\n b.append(a[i])\r\nprint(t)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\na=0\r\nmin=l[0]\r\nmax=l[0]\r\nfor i in range(n):\r\n if l[i]>max:\r\n max=l[i]\r\n a+=1\r\n if l[i]<min:\r\n min=l[i]\r\n a+=1\r\nprint(a)", "n=int(input())\r\ninp=input()\r\nc=0\r\nscore=list(map(int,inp.split(\" \")))\r\nfor i in range(1,n):\r\n flag=0\r\n for j in range(i):\r\n if score[j]<=score[i]:\r\n flag=1\r\n if flag==0:\r\n c+=1\r\n \r\nfor i in range(1,n):\r\n flag=0\r\n for j in range(i):\r\n if score[j]>=score[i]:\r\n flag=1\r\n if flag==0:\r\n c+=1\r\nprint(c)", "n = int(input())\r\na = list(map(int,input().split()))\r\nmin_val,max_val = a[0],a[0]\r\ntc = 0\r\nfor i in range(1,n):\r\n if(a[i] > max_val):\r\n tc +=1\r\n max_val = a[i]\r\n elif(a[i] < min_val):\r\n tc+=1\r\n min_val = a[i]\r\nprint(tc)", "n = int(input())\r\ncount = 0 \r\nl = list(map(int, input().split()))\r\nmini = l[0]\r\nmaxi = l[0]\r\ncount = 0\r\nfor i in range(1,n):\r\n if l[i] > maxi:\r\n maxi = l[i]\r\n count += 1\r\n elif l[i] < mini:\r\n mini = l[i]\r\n count += 1 \r\nprint(count)\r\n", "n=int(input())\r\ns=0\r\na=list(map(int,input().split()))\r\ni=0\r\nmini= a[0]\r\nmaxi=a[0]\r\nwhile i<n:\r\n if a[i]<mini:\r\n mini=a[i]\r\n s+=1\r\n elif a[i]>maxi:\r\n maxi=a[i]\r\n s+=1\r\n i+=1\r\nprint(s)\r\n\r\n\r\n\r\n\r\n\r\n", "num, *data = map(int, open(0).read().split())\r\nsubset = data[:1]\r\nfor element in data:\r\n num -= min(subset) <= element <= max(subset)\r\n subset += element,\r\nprint(num)\r\n", "n = int(input())\r\nscores = list(map(int, input().split()))\r\n\r\nmin_score = max_score = scores[0]\r\namazing_count = 0\r\n\r\nfor score in scores[1:]:\r\n if score > max_score:\r\n max_score = score\r\n amazing_count += 1\r\n elif score < min_score:\r\n min_score = score\r\n amazing_count += 1\r\n\r\nprint(amazing_count)\r\n", "n = int(input())\r\npoints = list(map(int, input().split()))\r\namazing_performance = 0\r\nhighest_point = points[0]\r\nlowest_point = points[0]\r\nfor i in range(1, n):\r\n if points[i] > highest_point:\r\n highest_point = points[i]\r\n amazing_performance += 1\r\n elif points[i] < lowest_point:\r\n lowest_point = points[i]\r\n amazing_performance += 1\r\nprint(amazing_performance)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncount = 0\r\nbest = a[0]\r\nworst = a[0]\r\nfor i in range(1, n):\r\n if a[i] > best:\r\n count += 1\r\n best = a[i]\r\n elif a[i] < worst:\r\n count += 1\r\n worst = a[i]\r\nprint(count)", "n = int(input())\r\nl = input()\r\n\r\nperformances = []\r\nfor i in l.split():\r\n performances.append(int(i))\r\n\r\ncount = 0\r\n\r\nmax = performances[0]\r\nmin = performances[0]\r\nperformances.remove(performances[0])\r\n\r\nfor performa in performances:\r\n if performa > max:\r\n count += 1\r\n max = performa\r\n elif performa < min:\r\n count += 1\r\n min = performa\r\n\r\nprint(count)", "n=int(input())\r\nh=input().split()\r\nmx=int(h[0])\r\nmn=int(h[0])\r\nkol=0\r\nfor i in h:\r\n if int(i)>mx:\r\n mx=int(i)\r\n kol+=1\r\n if int(i)<mn:\r\n mn=int(i)\r\n kol+=1\r\nprint(kol)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nmn=mx=l[0]\r\nc=0\r\nfor i in range(1,len(l)):\r\n if l[i]>mx or l[i]<mn:\r\n if l[i]>mx:\r\n mx=l[i]\r\n if l[i]<mn:\r\n mn=l[i]\r\n c+=1\r\nprint(c)\r\n", "n = input()\r\npoints = list(map(int, input().split(\" \")))\r\n\r\nmaxm = points[0]\r\nminm = points[0]\r\nnum_amazing = 0\r\n\r\nfor point in points[1:]:\r\n if point > maxm:\r\n num_amazing += 1\r\n maxm = point\r\n elif point < minm:\r\n num_amazing += 1\r\n minm = point\r\n\r\nprint(num_amazing)", "a = int(input())\nb = list(map(int, input().split()))\nres = {\"max\": b[0], \"min\": b[0]}\n\nk = 0\nfor i in range(1, len(b)):\n if b[i] > res[\"max\"]:\n k += 1\n res[\"max\"] = b[i]\n elif b[i] < res[\"min\"]:\n k += 1\n res['min'] = b[i]\nprint(k)\n", "# n, k = [int(a) for a in input().split()]\r\n# scores = list(map(int, input().split()))\r\n#\r\n# x = 0\r\n#\r\n# for i in range(n):\r\n# if scores[i] >= scores[k-1] and scores[i] > 0:\r\n# x += 1\r\n#\r\n# print(x)\r\n#\r\n############# Task 2\r\n#\r\n# print(\"+\".join(list(map(str, sorted(input().split('+'))))))\r\n\r\namt = int(input())\r\nscores = list(map(int, input().split()))\r\n\r\noutput = 0\r\nmax_num = scores[0]\r\nmin_num = scores[0]\r\n\r\nif amt != 1:\r\n for i in range(1, amt):\r\n if scores[i] > max_num:\r\n output += 1\r\n max_num = scores[i]\r\n elif scores[i] < min_num:\r\n output += 1\r\n min_num = scores[i]\r\n\r\nprint(output)\r\n\r\n", "#https://codeforces.com/problemset/problem/155/A\r\n\r\nnumber_of_contests = int(input())\r\ncontest_result = [int(x) for x in input().split(\" \")]\r\nmax_result, min_result = contest_result[0], contest_result[0]\r\namazing_results = 0\r\n\r\nfor result in contest_result:\r\n if(result > max_result):\r\n max_result = result\r\n amazing_results +=1\r\n elif(result < min_result):\r\n min_result = result\r\n amazing_results +=1\r\n\r\nprint(amazing_results)", "\r\n\r\nn = input()\r\n\r\ncom = [int(i) for i in input().split()]\r\n\r\n# print(com)\r\nrez = 0\r\n\r\nk = 1\r\nwhile k < len(com):\r\n # print(com[:k])\r\n if com[k] > max(com[:k]) or com[k] < min(com[:k]):\r\n rez += 1\r\n k += 1\r\n\r\nprint(rez)", "num = int(input())\r\n\r\narr = list(map(int,input().split()))\r\n\r\ntotal_performance = 0\r\n\r\narr1 = [arr[0]]\r\nfor i in range(1,len(arr)):\r\n min1 = min(arr1)\r\n max1 = max(arr1)\r\n if arr[i]>max1 or arr[i]<min1:\r\n total_performance+=1 \r\n arr1.append(arr[i])\r\nprint(total_performance)", "a=int(input())\r\nn=list(map(int,input().split()))\r\nc=0\r\nb=n[0]\r\nw=n[0]\r\nfor i in range(1,len(n)):\r\n if n[i]>b:\r\n c=c+1\r\n b=n[i]\r\n if n[i]<w:\r\n c=c+1\r\n w=n[i]\r\nprint(c)\r\n ", "n = int(input())\nres = list(map(int, input().split()))\nwow = 0\nmin = res[0]\nmax = res[0]\nfor i in range(1, len(res)):\n if res[i] < min:\n wow += 1\n min = res[i]\n elif res[i] > max:\n wow += 1\n max = res[i]\nprint(wow)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=a[0]\r\nd=a[0]\r\nc=0\r\nfor i in range(1,n):\r\n if a[i]>b:\r\n c=c+1\r\n b=a[i]\r\n elif a[i]<d:\r\n c=c+1\r\n d=a[i]\r\nprint(c)", "def main(arr):\r\n if len(arr) == 1: return 0\r\n\r\n n = 0\r\n\r\n for i in range(1, len(arr)):\r\n m = [0, 0]\r\n\r\n for j in range(i):\r\n if arr[i] <= arr[j] and m[0] != 1: m[0] = 1\r\n if arr[i] >= arr[j] and m[1] != 1: m[1] = 1\r\n\r\n if j == i - 1:\r\n if m[0] == 0: n += 1\r\n if m[1] == 0: n += 1\r\n\r\n return n\r\n\r\nif __name__ == \"__main__\":\r\n _ = int(input())\r\n\r\n arr = list(map(int, input().split()))\r\n\r\n print(main(arr))", "number = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\namazing = 0\r\n\r\n# print(f\"points: {points}\")\r\n\r\nnew_max = points[0]\r\nnew_low = points[0]\r\n\r\n# print(f\"Max is: {new_max}; Low is: {new_low}\")\r\n\r\nfor i in range(number - 1): # The index of the last item is 1 less than the amount of entries (numbers).\r\n next = points[i + 1]\r\n \r\n # print(f\"The next num is: {next}\")\r\n \r\n if next < new_low:\r\n new_low = next\r\n amazing += 1\r\n # print(f\"The New Low is: {new_low}; amazings: {amazing}\")\r\n if next > new_max:\r\n new_max = next\r\n amazing += 1\r\n # print(f\"The New Max is: {new_max}; amazings: {amazing} \\n\")\r\n\r\n# print(f\"_____________________\\n\\nThe Final number of amazings: {amazing}\")\r\n\r\nprint(amazing)", "# 155A - I Love Username\r\n# https://codeforces.com/problemset/problem/155/A\r\n\r\n# Input\r\n# 1) Número de concursos\r\n# 2) Puntuación de cada concurso\r\nconcursos = int(input())\r\npuntuaciones = list(map(int, input().split()))\r\n\r\n# Puntuación máxima y mínima del programador a lo largo de los concursos\r\npuntuacion_maxima = puntuaciones[0]\r\npuntuacion_minima = puntuaciones[0]\r\n\r\n# Número de concursos asombrosos del programador\r\nconcursos_asombrosos = 0\r\n\r\n# Itera sobre las puntuaciones\r\nfor puntuacion_actual in puntuaciones:\r\n\r\n # Si la puntuación actual es mayor a la máxima actual, entonces se actualiza la puntuación máxima y suma +1 a número de concursos asombrosos\r\n if puntuacion_actual > puntuacion_maxima:\r\n puntuacion_maxima = puntuacion_actual\r\n concursos_asombrosos += 1\r\n \r\n # Si la puntuación actual es menor a la mínima actual, entonces se actualiza la puntuación mínima y suma +1 a número de concursos asombrosos\r\n if puntuacion_actual < puntuacion_minima:\r\n puntuacion_minima = puntuacion_actual\r\n concursos_asombrosos += 1\r\n\r\n# Imprime el número de concursos asombrosos\r\nprint(concursos_asombrosos)", "k = 0\r\nx = int(input())\r\narr = list(map(int, input().split()))\r\nfor i in range(x-1):\r\n lst = arr[:i+2]\r\n mx = max(lst)\r\n mn = min(lst)\r\n if lst[-1] == min(lst) and lst.count(mn) == 1:\r\n k += 1\r\n elif lst[-1] == max(lst) and lst.count(mx) == 1:\r\n k += 1\r\nprint(k)\r\n", "n = int(input())\r\nscores = list(map(int, input().split()))\r\nmin_score = max_score = scores[0] \r\ncount = 0\r\nfor score in scores :\r\n if score < min_score:\r\n min_score = score\r\n count += 1\r\n if score > max_score:\r\n max_score = score\r\n count += 1\r\nprint(count)\r\n", "n = int(input())\r\nl = lambda:map(int,input().split())\r\nlist1 = list(l())\r\nb = True\r\nmin = list1[0]\r\nmax = list1[0]\r\ncount = 0\r\nfor i in range(n):\r\n \r\n for j in list1[:i+1]:\r\n \r\n if j>max:\r\n b = True\r\n \r\n else:\r\n b = False\r\n \r\n\r\n if b == True:\r\n count += 1\r\n max = j\r\n\r\n for j in list1[:i+1]:\r\n \r\n if j < min:\r\n b = True\r\n \r\n else:\r\n b = False\r\n if b == True:\r\n count += 1\r\n min = j\r\nprint(count)\r\n ", "n = int(input())\r\npoints = list(map(int, input().split()))\r\nif n == 1:\r\n print(0)\r\n exit()\r\nmax_points = points[0]\r\nmin_points = points[0]\r\namazing_performances = 0\r\nfor i in range(1, n):\r\n if points[i] > max_points or points[i] < min_points:\r\n amazing_performances += 1\r\n max_points = max(max_points, points[i])\r\n min_points = min(min_points, points[i])\r\nprint(amazing_performances)\r\n", "n=int(input())\r\nl=list(map(int,input().split(\" \")))\r\nmin=l[0]\r\nmax=l[0]\r\ncount=0\r\nfor i in range(1,n):\r\n if l[i] > max:\r\n max=l[i]\r\n count+=1\r\n if l[i] < min:\r\n min=l[i]\r\n count+=1\r\nprint(count)", "import sys\r\n\r\na = int(input(\"\"))\r\nb = [int(i) for i in sys.stdin.readline().split()]\r\nd = []\r\nc = 0\r\nmn = 0\r\nmx = 0\r\nfor i in range(0, a):\r\n if b[i] < b[mn]:\r\n mn = i\r\n c += 1\r\n if b[i] > b[mx]:\r\n mx = i\r\n c += 1\r\nprint(c)", "n = int(input())\r\narr = list(map(int,input().split()))\r\nminm = arr[0]\r\nmaxx = arr[0]\r\ncount = 0\r\nfor i in range(n):\r\n if (arr[i]<minm):\r\n minm = arr[i]\r\n count +=1\r\n if arr[i]>maxx:\r\n maxx = arr[i]\r\n count +=1\r\nprint(count)", "n=int(input())\r\ns=list(map(int,input().split()))\r\ny=s[:1]\r\nfor i in s :\r\n n-=min(y)<=i<=max(y)\r\n y+=[i]\r\nprint(n)", "n = int(input())\r\nc = 0\r\ncontests = list(map(int,input().split()))\r\nmaxc = contests[0]\r\nminc = contests[0]\r\nfor i in range(len(contests)-1):\r\n if contests[i+1] > maxc:\r\n maxc = contests[i+1]\r\n c += 1\r\n elif contests[i+1] < minc:\r\n minc = contests[i+1]\r\n c += 1\r\nprint(c)", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\nmn, mx, ans = arr[0], arr[0], 0 \r\nfor i in range(1, n):\r\n if min(arr[i],mn) < mn :\r\n ans += 1\r\n mn = min(mn, arr[i])\r\n if max(mx, arr[i]) > mx:\r\n ans += 1\r\n mx = max(mx, arr[i])\r\nprint(ans)", "n = int(input())\r\nk = 0\r\ns =[int(x) for x in input().split()]\r\nfor i in range (1, len (s)):\r\n if s[i] < min(s[0:i]) or s[i]> max(s[0:i]): k+=1\r\n \r\nprint(k)", "# https://codeforces.com/problemset/problem/155/A\r\n\r\ndef main():\r\n n = int(input())\r\n a = list(map(int, input().split(' ')))\r\n _min = a[0]\r\n _max = a[0]\r\n result = 0\r\n for i in a[1:]:\r\n if i < _min:\r\n _min = i\r\n result += 1\r\n if i > _max:\r\n _max = i\r\n result += 1\r\n print(result)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nx = [int(_) for _ in input().split()]\r\nmx = mn = x[0]\r\nk = 0\r\nfor _ in range(1, n):\r\n if x[_] > mx:\r\n mx = x[_]\r\n k += 1\r\n if x[_] < mn:\r\n mn = x[_]\r\n k += 1\r\nprint(k)", "def main():\n n = int(input())\n\n scores = [int(i) for i in input().split()]\n worst_score = scores[0]\n best_score = scores[0]\n notable_performances = 0\n for score in scores:\n if score < worst_score:\n notable_performances += 1\n worst_score = score\n if score > best_score:\n notable_performances += 1\n best_score = score\n print(notable_performances)\n\nif __name__ == \"__main__\":\n main()\n", "n = int(input())\r\na = list(map(int,input().split()))\r\ncount = 0\r\n#a_0 = a[0]\r\na_min = a[0]\r\na_max = a[0]\r\n\r\nfor i in a:\r\n if i > a_max:\r\n count+=1\r\n a_max = i\r\n elif i < a_min:\r\n count+=1\r\n a_min = i\r\n else:\r\n next\r\n\r\nprint(count)", "n=int(input())\r\nl=list(map(int,input().strip().split()))\r\nc=0\r\nmin=l[0]\r\nmax=l[0]\r\nfor i in range(n):\r\n if l[i]>max:\r\n max=l[i]\r\n c+=1\r\n if l[i]<min:\r\n min=l[i]\r\n c+=1\r\nprint(c)\r\n \r\n \r\n \r\n", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nans = 0\r\nmx = mn = lst[0]\r\n\r\nfor i in range(1, n):\r\n if lst[i] > mx:\r\n ans += 1\r\n mx = lst[i]\r\n if lst[i] < mn:\r\n ans += 1\r\n mn = lst[i]\r\n\r\n \r\nprint(ans)", "n = int(input())\r\nc = list(map(int,input().split()))\r\nmn = mx = c[0]\r\ncount = 0\r\nfor i in range(1,n):\r\n if c[i]>mx: \r\n mx = c[i]\r\n count += 1\r\n elif c[i]<mn:\r\n mn = c[i]\r\n count += 1\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\nx=a[:1]\r\nfor i in a:\r\n\tn-=min(x)<=i<=max(x)\r\n\tx+=[i]\r\nprint(n)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\ncount_changes = 0\r\nmax_value = arr[0]\r\nmin_value = arr[0]\r\n\r\nfor i in range(1, n):\r\n if max_value < arr[i]:\r\n max_value = arr[i]\r\n count_changes += 1\r\n\r\n if min_value > arr[i]:\r\n min_value = arr[i]\r\n count_changes += 1\r\n\r\nprint(count_changes)\r\n", "input()\r\na = list(map(int, input().split()))\r\nh=l=a[0]\r\nc=0\r\nfor i in a:\r\n if i > h:\r\n h=i\r\n c+=1\r\n elif i < l: \r\n l=i\r\n c+=1\r\n else:\r\n continue\r\nprint(c)", "n=int(input())\r\nl=map(int,input().split())\r\nx=list(l)\r\na=x[0]\r\nb=x[0]\r\nc=0\r\nc1=0\r\nj=(len(x)-1)\r\nfor i in range(1,j+1):\r\n if(x[i]<a):\r\n a=x[i]\r\n c=c+1\r\n if(x[i]>b):\r\n b=x[i]\r\n c1=c1+1\r\nprint(c+c1)\r\n", "n = int(input())\npoints = list(map(int, input().split()))\n\namazing_count = 0\nmax_points = min_points = points[0]\n\nfor point in points[1:]:\n if point > max_points:\n amazing_count += 1\n max_points = point\n elif point < min_points:\n amazing_count += 1\n min_points = point\n\nprint(amazing_count)\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\nl=list(map(int,input().split()))\r\ns=0\r\nk=[l[0]]\r\nfor i in range(1,n):\r\n n=min(k)\r\n m=max(k)\r\n if l[i] > m or l[i] < n :\r\n s+=1\r\n k.append(l[i])\r\nprint(s)\r\n", "time = int(input())\npointList2 = input().split(\" \")\npointList=[int(i) for i in pointList2]\n\nmax=pointList[0]\nmin=max\nbreakT=0\nfor i in range(1,time):\n if(pointList[i]>max):\n max=pointList[i]\n breakT+=1\n elif(pointList[i]<min):\n min=pointList[i]\n breakT+=1\n \nprint(breakT)", "test_c = int(input())\r\ns = input()\r\nl = list(map(int, s.split()))\r\nk = l[0]\r\nc = 0\r\nk1 = l[0]\r\nc1 = 0\r\nfor i in l:\r\n if i > k:\r\n k = i\r\n c += 1\r\n elif i < k1:\r\n k1 = i\r\n c1 += 1\r\n else:\r\n continue\r\nprint(c + c1)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\namazing_performances = 0\r\nminimum = maximum = points[0]\r\n\r\nfor i in range(1, n):\r\n if points[i] > maximum:\r\n maximum = points[i]\r\n amazing_performances += 1\r\n elif points[i] < minimum:\r\n minimum = points[i]\r\n amazing_performances += 1\r\n\r\nprint(amazing_performances)\r\n", "n = int(input())\r\nscores = list(map(int,input().split()))\r\nmax_s, min_s = scores[0], scores[0]\r\ncnt = 0\r\nfor score in scores:\r\n if score > max_s:\r\n cnt+=1\r\n max_s = score\r\n elif score < min_s:\r\n cnt+=1\r\n min_s = score\r\nprint(cnt)", "x=int(input())\r\ns=input().split()\r\nans=0\r\nl=[]\r\nfor i in range(x):\r\n l.append(int(s[i]))\r\nmaxo=l[0]\r\nmino=l[0]\r\nfor i in range(1,x):\r\n if l[i]>maxo:\r\n maxo=l[i]\r\n ans+=1\r\n if l[i]<mino:\r\n mino=l[i]\r\n ans+=1\r\nprint (ans)", "# Input\nn = int(input())\npoints = list(map(int, input().split()))\n\n# Initialize variables\namazing_count = 0\nbest_record = points[0]\nworst_record = points[0]\n\n# Iterate through the points starting from the second contest\nfor i in range(1, n):\n if points[i] > best_record:\n best_record = points[i]\n amazing_count += 1\n elif points[i] < worst_record:\n worst_record = points[i]\n amazing_count += 1\n\n# Print the number of amazing performances\nprint(amazing_count)\n\n\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\na=int(input())\r\nc=[int(x) for x in input().split()]\r\ntong=0\r\nmim=c[0]\r\nmam=c[0]\r\nfor i in range(0,len(c)):\r\n if c[i]>mam or c[i]<mim:\r\n tong+=1\r\n mim=min(mim, c[i])\r\n mam=max(mam, c[i])\r\nprint(tong)\r\n", "x = int(input())\r\ns = input().split()\r\na = []\r\nfor i in range(x):\r\n a.append(int(s[i]))\r\nsum = 0\r\nfor i in range(1, x):\r\n if (int(s[i]) > max(a[0:i])) | (int(s[i]) < min(a[0:i])):\r\n sum += 1\r\nprint(sum)", "a=int(input())\r\nlst=list(map(int,input().split()))\r\ncounter=0\r\nmax=lst[0]\r\nmin=lst[0]\r\n\r\nfor i in range(1,len(lst)):\r\n if lst[i] > max:\r\n counter+=1\r\n max=lst[i]\r\n if lst[i] < min:\r\n counter+=1\r\n min=lst[i]\r\nprint(counter)", "n = int(input())\r\npoints = list(map(int, input().split()))\r\n\r\namazing_count = 0 # Initialize the count of amazing performances\r\nbest_performance = points[0] # Initialize the best performance with the first contest's points\r\nworst_performance = points[0] # Initialize the worst performance with the first contest's points\r\n\r\nfor i in range(1, n):\r\n if points[i] > best_performance:\r\n best_performance = points[i]\r\n amazing_count += 1\r\n elif points[i] < worst_performance:\r\n worst_performance = points[i]\r\n amazing_count += 1\r\n\r\nprint(amazing_count)\r\n", "n = int(input())\na = [int(i) for i in input().split()]\nmini = a[0]\nmaxi = a[0]\namaz = 0\nfor i in range(1, n):\n if a[i] < mini:\n amaz += 1\n mini = a[i]\n elif a[i] > maxi:\n amaz += 1\n maxi = a[i]\nprint(amaz)\n\t \t \t\t\t\t\t \t\t \t\t \t\t \t\t\t\t \t\t", "# Read the number of contests\r\nn = int(input())\r\n\r\n# Read the earned points\r\npoints = list(map(int, input().split()))\r\n\r\n# Initialize the counters\r\namazing_count = 0\r\nmax_points = points[0]\r\nmin_points = points[0]\r\n\r\n# Iterate through the earned points\r\nfor i in range(1, n):\r\n if points[i] > max_points:\r\n max_points = points[i]\r\n amazing_count += 1\r\n if points[i] < min_points:\r\n min_points = points[i]\r\n amazing_count += 1\r\n\r\n# Print the number of amazing performances\r\nprint(amazing_count)\r\n", "n = int(input())\r\n\r\nscore = list(map(int,input().split()))\r\namazing = 0\r\nnmax = score[0]\r\nnmin = score[0]\r\n\r\nfor i in range(1,n):\r\n if score[i] > nmax:\r\n amazing += 1\r\n nmax = score[i]\r\n elif score[i] < nmin:\r\n amazing += 1\r\n nmin = score[i]\r\n\r\nprint(amazing)", "def ILove_Username(records):\r\n max = records[0]\r\n min = records[0]\r\n count = 0\r\n for i in range(len(records)):\r\n if records[i] > max:\r\n max = records[i]\r\n# print(i+1)\r\n count+=1\r\n if records[i] < min:\r\n min = records[i]\r\n# print(i+1)\r\n count+=1\r\n return count\r\n\r\nn = int(input())\r\nrecords = map(int, input().split())\r\nrecords = list(records)\r\nif len(records) == n:\r\n print(ILove_Username(records))", "n = int(input())\r\na = [int(el) for el in input().split()]\r\nmn = a[0]\r\nmx = a[0]\r\nk = 0\r\nfor i in range(1, n):\r\n if a[i] < mn:\r\n mn = a[i]\r\n k += 1\r\n elif a[i] > mx:\r\n mx = a[i]\r\n k += 1\r\nprint(k)\r\n", "n = int(input())\r\ni = [int(x) for x in input().split(' ')]\r\n\r\namazings=0\r\n\r\nfor j in range(n):\r\n if j>0 and (i[j]> max(i[:j]) or i[j]<min(i[:j])):\r\n amazings+=1\r\n\r\nprint(amazings)", "input(); mx=r=-1; mn=10001\r\nfor i in list(map(int, input().split())): r+=(i>mx or i<mn); mn = min(mn,i); mx = max(mx,i)\r\nprint(r)", "n=int(input())\r\nn2=list(map(int,input().split(\" \")))\r\ny=0\r\np=list()\r\nfor x in range(n):\r\n\tif x==0:\r\n\t\tmn=n2[x]\r\n\t\tmx=n2[x]\r\n\telse:\r\n\t\tif n2[x]>mx:\r\n\t\t\ty=y+1\r\n\t\t\tmx=n2[x]\r\n\t\tif n2[x]<mn:\r\n\t\t\ty=y+1\r\n\t\t\tmn=n2[x]\r\nprint(y)", "n=input()\r\ns=list(map(int, input().split()))\r\nmi, ma = s[0], s[0]\r\n\r\np=0\r\nfor i in s:\r\n if i<mi:\r\n mi=i\r\n p+=1\r\n if i>ma:\r\n ma=i\r\n p+=1\r\nprint(p)", "input()\r\nlst = [int(x) for x in input().split()]\r\nbig = lst[0]\r\nsmall = lst[0]\r\ncount = 0\r\nfor res in lst:\r\n if res > big:\r\n count += 1\r\n big = res\r\n elif res < small:\r\n count += 1\r\n small = res\r\nprint(count)", "n = int(input())\r\nnums = [int(x) for x in input().split()]\r\n\r\nhighest = nums[0]\r\nlowest = nums[0]\r\nresult = 0\r\n\r\nfor i in range(1, n):\r\n num = nums[i]\r\n if num < lowest:\r\n lowest = num\r\n result += 1\r\n elif num > highest:\r\n highest = num\r\n result += 1\r\nprint(result)\r\n", "# LUOGU_RID: 117305980\nm = n = 0\r\na = input()\r\nb = input().strip().split(\" \")\r\nb = [int(i) for i in b]\r\ntop = 1\r\nans = 0\r\nfor v in b:\r\n if top:\r\n m = n = v\r\n top -= 1\r\n else:\r\n if v > m:\r\n ans += 1\r\n m = v\r\n if v < n:\r\n ans += 1\r\n n = v\r\nprint(ans)", "contests = int(input())\r\nlist_of_points = list(map(int, input().split()))\r\ncounter = 0\r\nfor contest in range(1, contests):\r\n highest = 0\r\n lowest = 0\r\n for a in range(0, contest):\r\n if list_of_points[contest] > list_of_points[a]:\r\n highest += 1\r\n elif list_of_points[contest] < list_of_points[a]:\r\n lowest += 1\r\n if highest == contest or lowest == contest:\r\n counter += 1\r\nprint(counter) ", "n = input()\r\nevents = list(map(int, input().split()))\r\n\r\ndef solution(events):\r\n min_score = max_score = events[0]\r\n n_great = 0\r\n for score in events:\r\n if score < min_score:\r\n min_score = score\r\n n_great += 1\r\n if score > max_score:\r\n max_score = score\r\n n_great += 1\r\n return n_great\r\n\r\nprint(solution(events))", "n = int(input())\r\nsclist = list(input().split())\r\ncset = set()\r\ncounter = 0\r\nfor i in range(len(sclist)):\r\n if i != 0 and( int(sclist[i]) > max(cset) or int(sclist[i]) < min(cset) ):\r\n counter += 1\r\n cset.add(int(sclist[i]))\r\nprint(counter)\r\n ", "n = input()\r\ns = list(map(int, input().split()))\r\n\r\nlst = [s[0]]\r\n\r\nctr = 0\r\nfor ele in s:\r\n if ele>max(lst) or ele<min(lst):\r\n ctr += 1\r\n lst.append(ele)\r\n\r\nprint(ctr)\r\n ", "n=int(input())\r\nscores=input().split(' ')\r\namazing=0\r\nfor i in range(1,n):\r\n x=0\r\n for j in range(i):\r\n if int(scores[i])>int(scores[j]):\r\n x+=1\r\n elif int(scores[i])<int(scores[j]):\r\n x-=1\r\n if x==(i):amazing+=1\r\n elif x==-i:amazing+=1\r\nprint(amazing)", "n = int(input())\na = [int(i) for i in input().split()]\nmn = a[0]\nmx = a[0]\ncnt = 0\nfor i in range(1,n):\n if a[i] < mn:\n mn = a[i]\n cnt += 1\n if a[i] > mx:\n mx = a[i]\n cnt += 1\nprint(cnt)\n \t\t \t \t \t \t \t \t\t\t \t \t", "n=int(input())\r\nw=list(map(int,input().split()))\r\nq=0\r\nmin=w[0]\r\nmax=w[0]\r\nfor w1 in w:\r\n if w1>max:\r\n q+=1\r\n max=w1\r\n elif w1<min:\r\n q+=1\r\n min=w1\r\nprint(q)", "n = int(input())\r\nl = list(map(int, input().split()))\r\n\r\nmn = l[0]\r\nmx = l[0]\r\ncnt = 0\r\n\r\nfor i in range(1,n):\r\n if l[i]<mn:\r\n mn=l[i]\r\n cnt+=1\r\n elif l[i]>mx:\r\n mx=l[i]\r\n cnt+=1\r\n\r\nprint(cnt)", "n=int(input())\r\n\r\n\r\na=list(map(int,input().split()))\r\n# m=min(a)\r\n# ma=max(a)\r\nmi=ma=a[0]\r\nc=0\r\n\r\nfor i in range(0,n):\r\n if i!=0:\r\n if a[i]<mi:\r\n mi=a[i]\r\n c+=1\r\n elif a[i]> ma:\r\n c+=1\r\n ma=a[i]\r\nprint(c)\r\n\r\n", "import sys\r\ninput = sys.stdin.readline\r\noutput = sys.stdout.write\r\n\r\n\r\ndef main():\r\n length_ = int(input().rstrip())\r\n nums = list(map(int, input().rstrip().split()))\r\n min_ = nums[0]\r\n max_ = nums[0]\r\n counter_ = 0\r\n for i in nums[1:]:\r\n if i > max_:\r\n max_ = i\r\n counter_ += 1\r\n elif i < min_:\r\n min_ = i\r\n counter_ += 1\r\n output(str(counter_))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "# N = int(input())\r\n# N,M = map(int,input().split())\r\n# A = list(map(int,input().split()))\r\n\r\nN = int(input())\r\nA = list(map(int,input().split()))\r\nmn = mx = A[0]\r\nres = 0\r\nfor n in A:\r\n if n < mn or n > mx:\r\n res += 1\r\n mn = min(mn, n)\r\n mx = max(mx, n)\r\nprint(res)\r\n\r\n", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(1, len(a)):\r\n if a[i] < min(a[:i]):\r\n ans += 1\r\n if a[i] > max(a[:i]):\r\n ans += 1\r\n\r\nprint(ans)", "t=int(input())\r\na=list(map(int, input().split()))\r\nmin_=a[0]\r\nc=0\r\nmax_=a[0]\r\nfor i in range(0, t):\r\n if a[i]>max_:\r\n c+=1\r\n max_=a[i]\r\n elif a[i]<min_:\r\n min_=a[i]\r\n c+=1\r\n elif min_<=a[i]<=max_:\r\n continue\r\nprint(c)", "n=int(input())\r\na=list(map(int,input().split()))\r\nmi=a[0]\r\nma=a[0]\r\nk=0\r\nfor i in range(1,n):\r\n if a[i]<mi:\r\n mi=a[i]\r\n k+=1\r\n if a[i]>ma:\r\n ma=a[i]\r\n k+=1\r\nprint(k)", "a = int(input())\r\nb = [int(i) for i in input().split()]\r\nspan = []\r\namazing = 0\r\nspan.append(b[0])\r\nspan.append(b[0])\r\n\r\nfor i in b:\r\n if i < span[0]:\r\n span[0] = i\r\n amazing += 1\r\n if i > span[1]:\r\n span[1] = i\r\n amazing += 1\r\n\r\nprint(amazing)\r\n", "input()\r\na = input().split()\r\nminim, maxim, u = int(a[0]), int(a[0]), 0\r\nfor i in range(0, len(a)):\r\n if int(a[i]) > maxim:\r\n maxim = int(a[i])\r\n u += 1\r\n if int(a[i]) < minim:\r\n minim = int(a[i])\r\n u += 1\r\nprint(u)", "n = int(input())\r\nd = [int(p) for p in (input().split())]\r\ncnt = 0\r\nfor i in range(1, n):\r\n if d[i] < min(d[:i]) or d[i] > max(d[:i]): \r\n cnt+=1\r\nprint(cnt)", "input()\r\nscore = list(map(int,input().split()))\r\nmx = score[0]\r\nmn = score[0]\r\namazing = 0\r\nfor i in score[1:]:\r\n if i>mx:\r\n amazing+=1\r\n mx=i\r\n elif i<mn:\r\n amazing+=1\r\n mn=i\r\nprint(amazing)", "input()\r\nm=None\r\nx=None\r\nct=0\r\nfor i in list(map(int,input().split())):\r\n if m==None and x==None:\r\n m=i\r\n x=i\r\n else:\r\n if i>m:\r\n ct+=1\r\n m=i\r\n if i<x:\r\n ct+=1\r\n x=i\r\nprint(ct)", "n = int(input())\r\npts = list(map(int, input().split()))\r\ncount = 0\r\nmin = pts[0]\r\nmax = pts[0]\r\nfor i in range(1, n):\r\n if pts[i] < min:\r\n count += 1\r\n min = pts[i]\r\n if pts[i] > max:\r\n max = pts[i]\r\n count += 1\r\nprint(count)", "n=int(input())\r\na = [int(x) for x in input().split()]\r\ns=0\r\nworst=a[0]\r\nbest=a[0]\r\nfor i in a:\r\n if i<worst:\r\n s+=1\r\n worst=i\r\n elif i>best:\r\n best=i\r\n s+=1\r\nprint(s)", "n = int(input())\r\ncontests = list(map(int, input().split()))\r\nmax_points = min_points = contests[0]\r\namazing_performances = 0\r\nfor i in range(1, n):\r\n if contests[i] > max_points:\r\n max_points = contests[i]\r\n amazing_performances += 1\r\n elif contests[i] < min_points:\r\n min_points = contests[i]\r\n amazing_performances += 1\r\nprint(amazing_performances)", "def index_large_value(lis):\r\n small = lis[0]\r\n for i in range(1,len(lis)):\r\n if lis[i] > small:\r\n return i\r\n return 0\r\nn = int(input())\r\nlis = list(map(int,input().split()))\r\nsmall = lis[0]\r\nif n == 1:\r\n print(0)\r\n exit()\r\nelse:\r\n large = index_large_value(lis)\r\n max = lis[large]\r\n if large == 0:\r\n count = 0\r\n else:\r\n count = 1\r\n for i in range(1,n):\r\n if lis[i] < small:\r\n count += 1\r\n small = lis[i]\r\n elif lis[i] > max:\r\n count += 1\r\n max = lis[i]\r\n print(count)\r\n", "def perfomance(s):\r\n lst=[int(d) for d in s.split()]\r\n count=0\r\n for i in range(1,len(lst)):\r\n if lst[i]>max(lst[:i]) or lst[i]<min(lst[:i]):\r\n count+=1\r\n return count\r\nn=int(input())\r\ns=input()\r\nprint(perfomance(s))", "n = int(input())\r\n\r\nscore = list(map(int, input().split()))\r\n\r\nmax = min = score[0]\r\ncount = 0\r\n\r\nfor x in range(n):\r\n if score[x] > max:\r\n count += 1\r\n max = score[x]\r\n\r\n if score[x] < min:\r\n count += 1\r\n min = score[x]\r\n\r\nprint(count)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\namazing = 0\r\ni = 1\r\nwhile i < len(a):\r\n j = i - 1\r\n less_count = 0\r\n more_count = 0\r\n while j >= 0:\r\n if a[i] > a[j]:\r\n less_count += 1\r\n elif a[i] < a[j]:\r\n more_count += 1\r\n j -= 1\r\n if less_count == i or more_count == i:\r\n amazing += 1\r\n i += 1\r\nprint(amazing)", "n = int(input())\r\n\r\ndata = [int(x) for x in input().split()]\r\nmx = data[0]\r\nmn = data[0]\r\ncounter = 0\r\n\r\nfor x in data[1:]:\r\n if x > mx:\r\n counter += 1\r\n mx = x\r\n if x < mn:\r\n counter += 1\r\n mn = x\r\n\r\nprint(counter)", "n=int(input())\r\n\r\narray=[int(gg) for gg in input().split(' ')]\r\nmax_var=array[0]\r\nmin_var=array[0]\r\namaz_count=0\r\nfor x in range(1,len(array)):\r\n if array[x]>max_var:\r\n amaz_count+=1\r\n max_var=array[x]\r\n if array[x]<min_var:\r\n amaz_count+=1\r\n min_var=array[x]\r\nprint(amaz_count)\r\n\r\n", "n=int(input())\r\nl = list(map(int,input().split()))\r\nmax = l[0]\r\nmin = l[0]\r\nm_c = 0\r\nfor i in range(1,n):\r\n if l[i]>max:\r\n max = l[i]\r\n m_c+=1\r\n elif l[i]<min:\r\n min = l[i]\r\n m_c+=1\r\nprint(m_c)", "n = int(input())\r\nperform = list(map(int,input().split()))\r\nmin = max = perform[0]\r\nsolution = 0\r\n'''The performer amazing if only if if goes down\r\nbelow his minimum performance or above his max performance \r\nso when change of min and max occurs is the number\r\nof time he was amazing'''\r\nfor i in perform:\r\n if i > max:max = i;solution += 1\r\n if i < min:min = i;solution += 1\r\nprint(solution)", "n=int(input())\r\na=list(map(int,input().split()))\r\nc=0\r\ncmx=a[0]\r\ncmn=a[0]\r\nfor i in range(1,n):\r\n if a[i]>cmx:\r\n c+=1 \r\n cmx=a[i]\r\n if a[i]<cmn:\r\n c+=1 \r\n cmn=a[i]\r\nprint(c)", "def amazing_scores(nums, amazing = 0):\r\n strict_less, highest = nums[0], nums[0]\r\n for i in range(1, len(nums)):\r\n if nums[i] > highest: highest = nums[i]; amazing += 1\r\n elif nums[i] < strict_less: strict_less = nums[i]; amazing += 1\r\n \r\n return amazing\r\n\r\n\r\nif __name__ == \"__main__\":\r\n dummy_for_python = input() # HAHA\r\n scores = [int(x) for x in input().split()]\r\n\r\n print (amazing_scores(scores))\r\n", "n=int(input())\r\nls=list(map(int,input().split()))\r\ncc=ls[0]\r\nma=cc\r\nmi=cc\r\ncount=0\r\nfor i in range(1,len(ls)):\r\n if(ls[i]>ma):\r\n ma=ls[i]\r\n count+=1\r\n elif(ls[i]<mi):\r\n mi=ls[i]\r\n count+=1\r\nprint(count)", "n=int(input())\r\nlst=list(map(int,input().rstrip().split()))\r\nmv=lst[0]\r\nminv=lst[0]\r\nav=0\r\nfor i in range(1,n):\r\n if lst[i]>mv:\r\n mv=lst[i]\r\n av=av+1\r\n elif lst[i]<minv:\r\n minv=lst[i]\r\n av=av+1\r\nprint(av)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nbest,worst = a[0],a[0]\r\nc = 0\r\nfor i in range(1,n) :\r\n if a[i]>best :\r\n best = a[i]\r\n c += 1\r\n elif a[i]<worst :\r\n worst = a[i]\r\n c += 1\r\nprint(c)", "n=int(input())\r\nll=list(map(int,input().split()))\r\nma=mi=ll[0]\r\ncount=0\r\nfor i in ll:\r\n if i>ma:\r\n ma=i\r\n count+=1\r\n if i<mi:\r\n mi=i\r\n count+=1\r\nprint(count)", "ln = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\n\r\nbest = arr[0]\r\nworst = arr[0]\r\n\r\ntot = 0\r\n\r\nfor i in arr:\r\n if i > best:\r\n tot += 1\r\n best = i\r\n elif i < worst:\r\n worst = i\r\n tot += 1\r\n\r\nprint(tot)", "n=int(input())\r\nm=list(map(int,input().split()))\r\ncounts=[m[0]]\r\nfor i in range(1,n,1):\r\n a=m[:i+1]\r\n a.sort()\r\n counts.append(a[0])\r\n counts.append(a[len(a)-1])\r\nbigboy=[]\r\nfor j in range(len(counts)):\r\n if counts[j]!=m[0]:\r\n bigboy.append(counts[j])\r\nf=set(bigboy)\r\nprint(len(f))", "int(input())\r\nl = list(map(int, input().split()))\r\nmini, maxi, c = l[0], l[0], 0\r\nfor i in l:\r\n if i > maxi:\r\n maxi = i\r\n c += 1\r\n elif i < mini:\r\n mini = i\r\n c += 1\r\nprint(c)", "import sys\r\n\r\n_ = input()\r\npoints = [int(x) for x in sys.stdin.readline().split()]\r\n\r\namazing = 0\r\nmax = points[0]\r\nmin = points[0]\r\n\r\nfor i in points:\r\n if i > max:\r\n max = i\r\n amazing += 1\r\n elif i < min:\r\n min = i\r\n amazing += 1\r\n \r\nprint(amazing)", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nc=list1[0]\r\nc1=list1[0]\r\nd=0\r\nfor i in range(1,len(list1)):\r\n if list1[i]>c:\r\n c=list1[i]\r\n d+=1\r\n elif list1[i]<c1:\r\n d+=1\r\n c1=list1[i]\r\nprint(d)", "n = int(input())\r\nvals = input()\r\nlist = vals.split(\" \")\r\nmin = int(list[0])\r\nmax = int(list[0])\r\nfinal = 0\r\n\r\nfor i in list:\r\n if int(i) > max:\r\n final += 1\r\n max = int(i)\r\n elif int(i) < min:\r\n final += 1\r\n min = int(i)\r\n\r\nprint(final)\r\n" ]

[ "n1,m,a,d=list(map(int,input().split()))\r\nt=list(map(int,input().split()))\r\nfrom bisect import *\r\nfrom math import *\r\ninsort(t,a*n1)\r\npred=0\r\nk=0\r\nkpred=0\r\nn=0\r\nstep=d//a+1\r\nsol=0\r\nfl=0\r\nfor i in t:\r\n if (i > pred):\r\n if fl == 0:\r\n n=(i-pred+(pred%a))//a\r\n if n!=0:\r\n k+=(n//step)*step - step*(n % step == 0) + 1\r\n if k > n1:\r\n k=n1\r\n fl=1\r\n #print(k)\r\n if (k*a+d>=i) and (n!=0):\r\n pred=k*a+d\r\n else:\r\n pred=i+d\r\n k=floor(pred//a)\r\n sol+=1\r\n #if n==0:\r\n k=min(floor(pred//a),n1)\r\n sol+=n//step+(n%step!=0)\r\n else:\r\n sol+=1\r\n pred=i+d\r\n if i==a*n1:\r\n fl=1\r\n #print(i,pred,sol,n,step,k, fl)\r\nprint(sol)", "def solve():\r\n n1, m, a, d = list(map(int, input().split()))\r\n t = list(map(int, input().split()))\r\n from bisect import insort\r\n from math import floor\r\n insort(t, a * n1)\r\n pred = 0\r\n k = 0\r\n kpred = 0\r\n n = 0\r\n step = d // a + 1\r\n sol = 0\r\n fl = 0\r\n for i in t:\r\n if (i > pred):\r\n if fl == 0:\r\n n = (i - pred + (pred % a)) // a\r\n if n != 0:\r\n k += (n // step) * step - step * (n % step == 0) + 1\r\n if k > n1:\r\n k = n1\r\n fl = 1\r\n # print(k)\r\n if (k * a + d >= i) and (n != 0):\r\n pred = k * a + d\r\n else:\r\n pred = i + d\r\n k = floor(pred // a)\r\n sol += 1\r\n # if n==0:\r\n k = min(floor(pred // a), n1)\r\n sol += n // step + (n % step != 0)\r\n else:\r\n sol += 1\r\n pred = i + d\r\n if i == a * n1:\r\n fl = 1\r\n # print(i,pred,sol,n,step,k, fl)\r\n print(sol)\r\nsolve()" ]

[ "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\n#input = iter(sys.stdin.buffer.read().decode().splitlines()).__next__\r\nilele = lambda: map(int,input().split())\r\nalele = lambda: list(map(int, input().split()))\r\nilelec = lambda: map(int1,input().split())\r\nalelec = lambda: list(map(int1, input().split()))\r\ndef list2d(a, b, c): return [[c] * b for i in range(a)]\r\ndef list3d(a, b, c, d): return [[[d] * c for j in range(b)] for i in range(a)]\r\n#MOD = 1000000000 + 7\r\ndef Y(c): print([\"NO\",\"YES\"][c])\r\ndef y(c): print([\"no\",\"yes\"][c])\r\ndef Yy(c): print([\"No\",\"Yes\"][c])\r\n\r\n \r\nn,k,p = ilele()\r\nA = alele()\r\neven = []\r\nodd = []\r\nfor i in A:\r\n if i %2 == 0:\r\n even.append([i])\r\n else:\r\n odd.append([i])\r\n#print(even,odd)\r\nif len(odd) < k-p:\r\n Y(0)\r\nelse:\r\n l = k-p\r\n while len(odd) > l:\r\n x = odd.pop()\r\n if len(even) > 0:\r\n if sum(even[-1]) %2 == 0:\r\n even.append(x)\r\n else:\r\n even[-1].append(x[0])\r\n else:\r\n even.append(x)\r\n #print(even,odd)\r\n r = 0\r\n while len(even) > p and r<1e6:\r\n x = even.pop()\r\n for i in x:\r\n r +=1\r\n if len(odd) > 0:\r\n odd[0].append(i)\r\n else:\r\n if len(even) > 0:\r\n even[0].append(i)\r\n #print(even,odd)\r\n if len(even) != p or len(odd) != k-p:\r\n Y(0)\r\n else:\r\n #print(even,odd)\r\n for i in even:\r\n if sum(i) % 2 != 0:\r\n Y(0)\r\n exit(0)\r\n for i in odd:\r\n if sum(i) % 2 == 0:\r\n Y(0)\r\n exit(0)\r\n Y(1)\r\n for i in even:\r\n print(len(i),*i)\r\n for i in odd:\r\n print(len(i),*i)\r\n ", "import sys\r\n\r\ndef devu_and_partitionong_of_the_array(n,k,p,numbers):\r\n\r\n Even=[]\r\n Odd=[]\r\n Sets=[[] for i in range(k)]\r\n\r\n\r\n for j in range(n):\r\n if numbers[j]%2==0:\r\n Even.append(numbers[j])\r\n else:\r\n Odd.append(numbers[j])\r\n\r\n if (len(Odd)< (k-p)) or ((len(Odd)-(k-p))%2 !=0) or ((len(Odd)-(k-p))/2 + len(Even))<p:\r\n print(\"NO\\n\")\r\n else:\r\n for i in range(k-p):\r\n Sets[i].append(Odd.pop())\r\n\r\n for i in range(k-p,k):\r\n if len(Even) != 0:\r\n Sets[i].append(Even.pop())\r\n elif len(Odd) != 0:\r\n Sets[i].append(Odd.pop())\r\n Sets[i].append(Odd.pop())\r\n\r\n\r\n while len(Even) != 0:\r\n Sets[0].append(Even.pop())\r\n\r\n while len(Odd) != 0:\r\n Sets[0].append(Odd.pop())\r\n\r\n print(\"YES\\n\")\r\n for l in range(k):\r\n size=len(Sets[l])\r\n sys.stdout.write(str(size))\r\n for m in range(size):\r\n sys.stdout.write(\" \" + str(Sets[l][m]))\r\n print(\"\\n\")\r\n\r\nline1=list(map(int,input().split()))\r\nline2=list(map(int,input().split()))\r\n\r\ndevu_and_partitionong_of_the_array(line1[0],line1[1],line1[2],line2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k,p = map(int,input().split())\r\nl = list(map(int,input().split()))\r\nodd,even=[],[]\r\nfor i in l:\r\n if i%2:\r\n odd.append(i)\r\n else:\r\n even.append(i)\r\nif (len(odd) - (k-p))% 2!=0:\r\n print(\"NO\")\r\n exit(0)\r\nans = [[] for _ in range(k)]\r\nfor i in range(k-p):\r\n if odd:\r\n ans[i].append(odd.pop())\r\n else:\r\n print(\"NO\")\r\n exit(0) \r\nfor i in range(k-p,k):\r\n if even:\r\n ans[i].append(even.pop())\r\n elif len(odd)>=2:\r\n ans[i].append(odd.pop())\r\n ans[i].append(odd.pop())\r\n else:\r\n print(\"NO\")\r\n exit(0)\r\nans[0] += even + odd\r\nprint(\"YES\")\r\nfor i in ans:\r\n print(len(i),*i)\r\n", "from math import inf\n\n\ndef solve(od, k, p):\n ans = []\n for i in range(p):\n if od[0]:\n ans.append([od[0].pop()])\n elif len(od[1]) >= 2:\n ans.append([od[1].pop(), od[1].pop()])\n else:\n return None\n for i in range(k - p):\n if od[1]:\n ans.append([od[1].pop()])\n else:\n return None\n if od[0]:\n ans[0] += od[0]\n if od[1]:\n if len(od[1]) % 2 == 0:\n ans[0] += od[1]\n else:\n return None\n return ans\n\n\ndef main():\n _, k, p = map(int, input().split())\n arr = list(map(int, input().split()))\n od = [[], []]\n for a in arr:\n od[a % 2].append(a)\n ans = solve(od, k, p)\n if ans:\n print('YES')\n for a in ans:\n print(len(a), *a)\n else:\n print('NO')\n\n\ndef init():\n import os\n import sys\n\n sys.setrecursionlimit(2 * 10 ** 8)\n if 'CP_LOCAL_ENV' in os.environ:\n sys.stdin = open('cf_test_a.txt')\n\n\nif __name__ == '__main__':\n init()\n main()\n", "import sys\r\ndef devu_and_partitionong_of_the_array(n,k,p,a):\r\n Even=[]#lista con elementos pares de a\r\n Odd=[]#lista con elementos impares de a\r\n Sets=[[] for i in range(k)]# lista que contiene los k subconjuntos disjuntos\r\n\r\n #se recorre el arreglo\r\n for j in range(n):\r\n #si el elemento es par, se agrega a Even, en caso contrario, es impar, por tanto se agrega a Odd\r\n if a[j]%2==0:\r\n Even.append(a[j])\r\n else:\r\n Odd.append(a[j])\r\n\r\n #son los incisos a),b) y d) demostrados en el informe, en estos casos no es posible crear k subconjuntos que cumplan las condiciones establecidas\r\n if (len(Odd)< (k-p)) or ((len(Odd)-(k-p))%2 !=0) or ((len(Odd)-(k-p))/2 + len(Even))<p:\r\n print(\"NO\\n\")\r\n else:\r\n #se pueden crear los subconjuntos\r\n for i in range(k-p):\r\n #k-p primeros subconjuntos tienen un entero par\r\n Sets[i].append(Odd.pop())\r\n\r\n for i in range(k-p,k):\r\n #p últimos subconjuntos, tienen un entero par\r\n if len(Even) != 0:\r\n Sets[i].append(Even.pop())\r\n # o dos enteros impares\r\n elif len(Odd) != 0:\r\n Sets[i].append(Odd.pop())\r\n Sets[i].append(Odd.pop())\r\n\r\n #los elementos que quedan, se ponen en el primer subconjunto\r\n while len(Even) != 0:\r\n Sets[0].append(Even.pop())\r\n while len(Odd) != 0:\r\n Sets[0].append(Odd.pop())\r\n\r\n print(\"YES\\n\")\r\n #se imprimen el tamaño del subconjunto y los elementos que contiene\r\n for l in range(k):\r\n size=len(Sets[l])\r\n sys.stdout.write(str(size))\r\n for m in range(size):\r\n sys.stdout.write(\" \" + str(Sets[l][m]))\r\n print(\"\\n\")\r\n\r\nline1=list(map(int,input().split()))\r\nline2=list(map(int,input().split()))\r\n\r\ndevu_and_partitionong_of_the_array(line1[0],line1[1],line1[2],line2)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "import sys\r\n\r\ndef minp():\r\n\treturn sys.stdin.readline().strip()\r\n\r\nn, k, p = map(int,minp().split())\r\neven = []\r\nodd = []\r\nfor i in map(int,minp().split()):\r\n\tif i%2 == 0:\r\n\t\teven.append(i)\r\n\telse:\r\n\t\todd.append(i)\r\n\r\nif len(odd) < k-p:\r\n\tprint(\"NO\")\r\nelse:\r\n\tans = []\r\n\tfor i in range(k-p):\r\n\t\tans.append([odd[-1]])\r\n\t\tdel(odd[-1])\r\n\tif len(odd)%2 == 1:\r\n\t\tprint(\"NO\")\t\r\n\telse:\r\n\t\tfail = False\r\n\t\tfor i in range(p):\r\n\t\t\tif len(odd) != 0:\r\n\t\t\t\tans.append([odd[-1],odd[-2]])\r\n\t\t\t\tdel(odd[-1])\r\n\t\t\t\tdel(odd[-1])\r\n\t\t\telif len(even) != 0:\r\n\t\t\t\tans.append([even[-1]])\r\n\t\t\t\tdel(even[-1])\r\n\t\t\telse:\r\n\t\t\t\tfail = True\r\n\t\tif fail:\r\n\t\t\tprint(\"NO\")\r\n\t\telse:\r\n\t\t\twhile len(odd) != 0:\r\n\t\t\t\tans[-1].append(odd[-1])\r\n\t\t\t\tdel(odd[-1])\r\n\t\t\t\tans[-1].append(odd[-1])\r\n\t\t\t\tdel(odd[-1])\r\n\t\t\twhile len(even) != 0:\r\n\t\t\t\tans[-1].append(even[-1])\r\n\t\t\t\tdel(even[-1])\r\n\t\t\tprint(\"YES\")\r\n\t\t\tan = []\r\n\t\t\tfor i in ans:\r\n\t\t\t\tan.append(str(len(i))+' '+' '.join(map(str,i)))\r\n\t\t\tprint('\\n'.join(an))\r\n", "def solve():\n n,k,p=map(int,input().split())\n a=list(map(int,input().split()))\n even=list(filter(lambda x: x%2==0, a))\n odd=list(filter(lambda x:x%2==1, a))\n if (len(odd)-(k-p))%2!=0:\n print(\"NO\");\n return\n ans=[[] for _ in range(k)]\n\n for i in range(k-p):\n if odd:\n ans[i].append(odd.pop())\n else:\n print(\"NO\")\n return\n\n for i in range(k-p,k):\n if even:\n ans[i].append(even.pop())\n elif len(odd)>=2:\n ans[i].append(odd.pop())\n ans[i].append(odd.pop())\n else:\n print(\"NO\")\n return\n ans[0]+=even\n ans[0]+=odd\n print(\"YES\")\n for part in ans:\n print(len(part),\" \".join(map(str,part)))\n\nsolve()\n", "n,k,p=map(int,input().split())\r\nl=[int(i) for i in input().split()]\r\nodd=[i for i in l if i&1]\r\neven=[i for i in l if i&1==0]\r\nif len(odd)<k-p :\r\n print('NO')\r\n exit()\r\nif len(odd)%2!=(k-p)%2:\r\n print(\"NO\")\r\n exit() #parity not maintained \r\nans=[]\r\nfor i in range(k):\r\n ans.append([])\r\ni=0 \r\nfor o in odd:\r\n if i<k-p:\r\n ans[i].append(o) \r\n i+=1 \r\n elif i<k:\r\n ans[i].append(o)\r\n if len(ans[i])>=2:\r\n i+=1 \r\n else:\r\n ans[0].append(o)\r\nfor e in even: \r\n if i<k:\r\n ans[i].append(e)\r\n i+=1 \r\n else:\r\n ans[0].append(e)\r\nt=0\r\nfor f in ans:\r\n\tcur = sum(f)\r\n\tif(len(f)==0):\r\n\t\tt=1000000000\r\n\tif(cur%2==1):\r\n\t\tt+=1\r\nans.reverse()\r\nif(t!=k-p):\r\n\tprint (\"NO\")\r\n\texit()\r\nprint(\"YES\")\r\nfor i in ans:\r\n print(len(i),*i)\r\n\r\n \r\n ", "import sys\r\n\r\ninputStr = input()\r\ninputArr = inputStr.split(' ')\r\n\r\nn = int(inputArr[0])\r\nk = int(inputArr[1])\r\np = int(inputArr[2])\r\n\r\narr = list(map(int, input().split(' ')))\r\n\r\nodds = []\r\nevens = []\r\n\r\nfor i in range(len(arr)):\r\n if(arr[i]%2):\r\n odds.append(i)\r\n else:\r\n evens.append(i)\r\n\r\nans = []\r\n\r\noddPointer = 0\r\nevenPointer = 0\r\n\r\nfor i in range(k-p):\r\n if (oddPointer >= len(odds)):\r\n print(\"NO\")\r\n quit()\r\n \r\n oddArr = [odds[oddPointer]]\r\n oddPointer += 1\r\n ans.append(oddArr)\r\n\r\nfor i in range(p):\r\n if (oddPointer < len(odds)):\r\n if (oddPointer + 1 >= len(odds)):\r\n print(\"NO\")\r\n quit()\r\n\r\n else :\r\n oddArr = [odds[oddPointer], odds[oddPointer+1]]\r\n oddPointer += 2\r\n ans.append(oddArr)\r\n\r\n elif (evenPointer < len(evens)):\r\n evenArr = [evens[evenPointer]]\r\n evenPointer += 1\r\n ans.append(evenArr)\r\n\r\n else:\r\n print(\"NO\")\r\n quit()\r\n\r\nif ((len(odds) - oddPointer)%2):\r\n print(\"NO\")\r\n quit()\r\n\r\nfor i in range(oddPointer, len(odds)):\r\n ans[0].append(odds[i])\r\n\r\nfor i in range(evenPointer, len(evens)):\r\n ans[0].append(evens[i])\r\n\r\nprint(\"YES\")\r\n\r\n\r\nfor i in range(len(ans)):\r\n sys.stdout.write(str(len(ans[i]))) \r\n sys.stdout.write(' ')\r\n\r\n for j in range(len(ans[i])):\r\n sys.stdout.write(str(arr[ans[i][j]]))\r\n sys.stdout.write(' ')\r\n\r\n sys.stdout.write('\\n')\r\n\r\nsys.stdout.flush()", "n, k , p = map(int, input().split())\n\na = list(map(int, input().split()))\n\nodd = []\n\neven = []\n\nfor el in a:\n if el & 1:\n odd.append(el)\n \n else:\n even.append(el)\n\n\nif (len(odd) - (k-p)) % 2:\n print(\"NO\")\n exit()\n\nans = [[] for _ in range(k)]\n\nfor i in range(k-p):\n if odd:\n ans[i].append(odd.pop())\n else:\n print(\"NO\")\n exit()\n\nfor i in range(k-p, k):\n if even:\n ans[i].append(even.pop())\n elif len(odd) >= 2:\n ans[i].append(odd.pop())\n ans[i].append(odd.pop())\n else:\n print(\"NO\")\n exit()\n\nans[0] += even\nans[0] += odd\nprint(\"YES\")\nfor a in ans:\n print(len(a), \" \".join(map(str, a)))\n", "n, k, p = map(int, input().split())\r\na = list(map(int, input().split()))\r\nodd = [i for i in a if i % 2 == 1]\r\neven = [i for i in a if i % 2 == 0]\r\ng = [[] for i in range(k)]\r\nif len(odd) < k-p or (len(odd)-(k-p)) % 2 == 1:\r\n print(\"NO\")\r\n exit()\r\nfor i in range(k-p):\r\n g[i].append(odd.pop())\r\nm = len(even)\r\nfor i in range(m):\r\n g[(k-p+i) % k].append(even.pop())\r\nfor i in range(0, len(odd), 2):\r\n idx = (k-p+m+ i//2) % k\r\n g[idx].append(odd[i])\r\n g[idx].append(odd[i+1])\r\nif any([len(i) == 0 for i in g]):\r\n print(\"NO\")\r\n exit()\r\nprint(\"YES\")\r\nfor i in g:\r\n print(str(len(i)) + ' ' + ' '.join([str(j) for j in i]))\r\n", "import os,io\nfrom sys import stdout\nimport collections\n# import random\n# import math\n# from operator import itemgetter\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n# from collections import Counter\n# from decimal import Decimal\n# import heapq\n# from functools import lru_cache\n\nimport sys\n# import threading\n# sys.setrecursionlimit(10**6)\n# threading.stack_size(102400000)\n\n# from functools import lru_cache\n# @lru_cache(maxsize=None)\n\n######################\n# --- Maths Fns --- #\n######################\ndef primes(n):\n sieve = [True] * n\n for i in range(3,int(n**0.5)+1,2):\n if sieve[i]:\n sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)\n return [2] + [i for i in range(3,n,2) if sieve[i]]\n\ndef binomial_coefficient(n, k):\n if 0 <= k <= n:\n ntok = 1\n ktok = 1\n for t in range(1, min(k, n - k) + 1):\n ntok *= n\n ktok *= t\n n -= 1\n return ntok // ktok\n else:\n return 0\n\ndef powerOfK(k, max):\n if k == 1:\n return [1]\n if k == -1:\n return [-1, 1]\n\n result = []\n n = 1\n while n <= max:\n result.append(n)\n n *= k\n return result\n\ndef divisors(n):\n i = 1\n result = []\n while i*i <= n:\n if n%i == 0:\n if n/i == i:\n result.append(i)\n else:\n result.append(i)\n result.append(n/i)\n i+=1\n return result\n\ndef distance(xa, ya, xb, yb):\n return ((ya-yb)**2 + (xa-xb)**2)**(0.5)\n\n# @lru_cache(maxsize=None)\ndef digitsSum(n):\n if n == 0:\n return 0\n r = 0\n while n > 0:\n r += n % 10\n n //= 10\n return r\n\n######################\n# ---- GRID Fns ---- #\n######################\ndef isValid(i, j, n, m):\n return i >= 0 and i < n and j >= 0 and j < m\n\ndef print_grid(grid):\n for line in grid:\n print(\" \".join(map(str,line)))\n\n######################\n# ---- MISC Fns ---- #\n######################\ndef kadane(a,size):\n max_so_far = 0\n max_ending_here = 0\n\n for i in range(0, size):\n max_ending_here = max_ending_here + a[i]\n if (max_so_far < max_ending_here):\n max_so_far = max_ending_here\n\n if max_ending_here < 0:\n max_ending_here = 0\n return max_so_far\n\ndef prefixSum(arr):\n for i in range(1, len(arr)):\n arr[i] = arr[i] + arr[i-1]\n return arr\n\ndef ceil(n, d):\n if n % d == 0:\n return n // d\n else:\n return (n // d) + 1\n\ndef _abs(a, b):\n return int(abs(a - b))\n\ndef evenodd(l):\n even = [e for e in l if e & 1 == 0]\n odd = [e for e in l if e & 1]\n return (even, odd)\n\n# INPUTS --------------------------\n# s = input().decode('utf-8').strip()\n# n = int(input())\n# l = list(map(int, input().split()))\n# t = int(input())\n# for _ in range(t):\n# for _ in range(t):\n\nn, k, p = list(map(int, input().split()))\nl = list(map(int, input().split()))\n\neven, odd = evenodd(l)\nrest = k - p\n\nreven = []\nrodd = []\n\ni, j = 0, 0\nwhile i < len(even) and p > 0:\n reven.append([even[i]])\n p -= 1\n i += 1\nwhile j < len(odd)-1 and p > 0:\n reven.append([odd[j], odd[j+1]])\n p -= 1\n j += 2\n\nif i == len(even) and j >= len(odd)-1 and p > 0:\n print('NO')\n exit()\n\nif p == 0:\n even = even[i:]\n odd = odd[j:]\n\n i, j = 0, 0\n while j < len(odd) and rest > 0:\n rodd.append([odd[j]])\n rest -= 1\n j += 1\n if j == len(odd) and rest > 0:\n print('NO')\n exit()\n if rest == 0:\n odd = odd[j:]\n if len(even) or len(odd):\n oddRemaining = len(odd)\n if oddRemaining % 2 == 1:\n print('NO')\n exit()\n else:\n if not len(reven):\n rodd[0] += odd + even\n else:\n reven[0] += odd + even\n\n print('YES')\n for e in reven:\n print(len(e), \" \".join(list(map(str, e))))\n for e in rodd:\n print(len(e), \" \".join(list(map(str, e))))\n" ]

[ "from collections import defaultdict\r\nn,m=map(int,input().split())\r\ndic=defaultdict(list)\r\nli=[0]*n\r\nfor i in range(m):\r\n u,v=list(map(int,input().split()))\r\n u=u-1\r\n v=v-1\r\n li[u]+=1\r\n li[v]+=1\r\n dic[u].append(v)\r\n dic[v].append(u)\r\nr=0\r\nfor i in range(n):\r\n res=[]\r\n for i in range(n):\r\n if li[i]==1:\r\n res.append(i)\r\n li[i]=0\r\n \r\n #print(res)\r\n if len(res)==0:\r\n break\r\n\r\n r+=1\r\n for j in res:\r\n for k in dic[j]:\r\n li[k]-=1\r\n\r\n\r\nprint(r)\r\n", "line=input().split(\" \")\nn= int(line[0])\nm = int(line[1])\nvect=[]\ncont=[0]*n\nfor t in range (n):\n vect.append([])\nfor i in range (m):\n line=input().split(\" \")\n a= int(line[0])\n b = int(line[1])\n cont[a - 1]+=1\n cont[b - 1] += 1\n vect[a - 1].append(b-1)\n vect[b - 1].append(a-1)\ncent=True\ntot=0\nwhile cent:\n L=[]\n for i in range(n):\n if cont[i]==1:\n L.append(i)\n if len(L)==0:\n cent=False\n print(tot)\n else:\n for l in L: \n for elem in vect[l]:\n cont[elem]-=1\n cont[l]=0\n tot+=1\n \t\t \t\t\t\t\t \t\t\t\t\t\t\t\t \t", "sn, ln = map(int, input().split())\r\nlaces = [list(map(int, input().split())) for _ in range(ln)]\r\n\r\nans = 0\r\nwhile True:\r\n deleted_list = [i for i in range(1, sn + 1) if sum([lace.count(i) for lace in laces]) == 1]\r\n if len(deleted_list) == 0:\r\n break\r\n laces = [lace for lace in laces if lace[0] not in deleted_list and lace[1] not in deleted_list]\r\n ans += 1\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\r\nfrom collections import defaultdict\r\nd=defaultdict(list)\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\n#print(d)\r\ncnt=0 \r\nse=set()\r\n#print(d)\r\nwhile d and min([len(d[i]) for i in d])<=1:\r\n if sum(len(d[i]) for i in d)==0:\r\n break \r\n #cnt+=1 \r\n #print(len(d[2]),'le')\r\n curr=[]\r\n f=0\r\n for i in range(1,n+1):\r\n if len(d[i])==1:\r\n \r\n #cnt+=1 \r\n f=1 \r\n curr.append(i)\r\n # print(curr)\r\n # print(curr)\r\n cnt+=(len(curr)>0)\r\n if f==0:\r\n break \r\n for x in curr: \r\n for j in d[x]:\r\n d[j].remove(x)\r\n while d[x]:\r\n d[x].pop()\r\n '''\r\n se.add(i)\r\n for j in d[i]:\r\n d[j].remove(i) \r\n del d[i]'''\r\n #print(d)\r\nprint(cnt)\r\n ", "import sys\r\ninput = sys.stdin.readline\r\nread_tuple = lambda _type: map(_type, input().split(' '))\r\n\r\n\r\ndef solve():\r\n n, m = read_tuple(int)\r\n graph = {}\r\n for _ in range(m):\r\n a, b = read_tuple(int)\r\n graph[a] = graph.get(a, set()) | set([b])\r\n graph[b] = graph.get(b, set()) | set([a])\r\n ans = 0\r\n while True:\r\n marked_for_del = set()\r\n for v in graph:\r\n if len(graph[v]) == 1:\r\n marked_for_del.add(v)\r\n if marked_for_del:\r\n for v in marked_for_del:\r\n if v in graph:\r\n v2 = graph[v].pop()\r\n graph[v2].discard(v)\r\n graph.pop(v)\r\n if graph[v2] == set():\r\n graph.pop(v2)\r\n ans += 1\r\n else:\r\n break\r\n print(ans)\r\n \r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "n, m = map(int, input().split())\r\nmatr = [[0] * n for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n matr[a-1][b-1] = 1\r\n matr[b-1][a-1] = 1\r\nans = 0\r\nwhile True:\r\n sc = False\r\n mas = []\r\n for i in range(len(matr)):\r\n k = 0\r\n p = set()\r\n for j in range(len(matr[i])):\r\n if matr[i][j] == 1:\r\n k += matr[i][j]\r\n p.add((i, j))\r\n if k == 2:\r\n break\r\n if len(p) == 1:\r\n for x in p:\r\n mas.append(x)\r\n sc = True\r\n for i in mas:\r\n matr[i[0]][i[1]] = 0\r\n matr[i[1]][i[0]] = 0\r\n if sc:\r\n ans += 1\r\n else:\r\n break\r\nprint(ans)\r\n", "n,m = list(map(int, input().split()))\nlinks = {i: set() for i in range(1,n+1)}\nout_counts = 0\nfor i in range(m):\n l0, l1 = list(map(int, input().split()))\n links[l0].add(l1)\n links[l1].add(l0)\nwhile True:\n one_lace_group = []\n for i in links.keys():\n if len(links[i])==1:\n one_lace_group.append(i)\n if (len(one_lace_group)==0):\n break\n for i in one_lace_group:\n j = [x for x in links[i]]\n if (j):\n j = j[0]\n links[i].remove(j)\n links[j].remove(i)\n out_counts += 1\nprint (out_counts)\n\n\n\n", "n,m = map(int, input().split())\r\n\r\nstudents = [[] for _ in range(n+1)]\r\n\r\nfor _ in range(m):\r\n s1, s2 = map(int, input().split())\r\n students[s1].append(s2)\r\n students[s2].append(s1)\r\n\r\nit = 0\r\nnoSingles = True\r\nwhile True:\r\n toBeDeleted = []\r\n for i in range(len(students)):\r\n if len(students[i]) == 1:\r\n noSingles = False\r\n toBeDeleted.append((students[i][0], i))\r\n students[i] = []\r\n for s1, s2 in toBeDeleted:\r\n try:\r\n students[s1].remove(s2)\r\n except:\r\n pass\r\n if noSingles:\r\n break\r\n noSingles = True\r\n it += 1\r\n\r\nprint(it)\r\n\r\n", "s = input().split()\r\n(n,m) = (int(i) for i in s)\r\n\r\na = [[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n\ts = input().split()\r\n\ts = [int(i)-1 for i in s]\r\n\ta[s[0]].append(s[1])\r\n\ta[s[1]].append(s[0])\r\n\r\nflag = 0\r\nc = 0\r\np = [0 for i in range(n)]\r\nwhile(flag == 0):\r\n\trepri = []\r\n\tfor i in range(n):\r\n\t\tp[i] = len(a[i])\r\n\t\tif(p[i] == 1):\r\n\t\t\trepri.append(i)\r\n\tif(len(repri) == 0):\r\n\t\tflag = 1\r\n\telse:\r\n\t\tc += 1\r\n\t\tfor i in range(len(repri)):\r\n\t\t\ta[repri[i]] = [] \r\n\t\t\tfor j in range(len(a)):\r\n\t\t\t\tif(repri[i] in a[j]):\r\n\t\t\t\t\ta[j].remove(repri[i])\r\nprint(c)\r\n\r\n\r\n", "n,m=map(int,input().split())\r\ncontact=[0]*500\r\nd=dict()\r\nowo=[]\r\nc=0\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n contact[a]+=1\r\n contact[b]+=1\r\n if a not in d:\r\n d[a]=[b]\r\n else:\r\n d[a]+=[b]\r\n if b not in d:\r\n d[b]=[a]\r\n else:\r\n d[b]+=[a]\r\nwhile 1 in contact :\r\n for i in range(1,n+1):\r\n if i in d:\r\n if len(d[i])==1:\r\n owo+=[i]\r\n for j in owo:\r\n for k in d:\r\n if j in d[k] and len(d[j])==1:\r\n d[k].remove(j)\r\n d[j].remove(k)\r\n contact[k]-=1\r\n contact[j]-=1\r\n c+=1\r\nprint(c)\r\n\r\n\r\n\r\n", "datos = list(str(input()).split())\ndatos[0] = int(datos[0])\ndatos[1] = int(datos[1])\n\nalumnos = []\n\ngrupos= 0\n\nentro = False\nfor i in range(1,datos[0]+1):\n datoAlumnos = [i]\n alumnos.append(datoAlumnos)\n\nfor i in range(datos[1]):\n datos = list(str(input()).split())\n datos[0] = int(datos[0])\n datos[1] = int(datos[1])\n for j in range(len(alumnos)):\n if alumnos[j][0] == datos[1]:\n alumnos[j].append(datos[0])\n elif alumnos[j][0] == datos[0]:\n alumnos[j].append(datos[1])\n\nfor j in range(len(alumnos)):\n usados = []\n for k in range(len(alumnos)):\n if len(alumnos[k])>2:\n usados.append(k)\n for i in range(len(alumnos)):\n if len(alumnos[i]) == 2:\n if i in usados:\n continue\n entro = True\n alumnos[alumnos[i][1]-1].remove(alumnos[i][0])\n alumnos[i].remove(alumnos[i][1])\n\n if entro == True:\n grupos += 1\n entro = False\n\nprint(grupos)\n\t\t \t\t \t\t\t\t \t\t\t\t\t\t \t \t \t\t \t\t", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\ngraph = defaultdict(list)\r\ndegree = defaultdict(int)\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n degree[a] += 1\r\n degree[b] += 1\r\nres = 0\r\nwhile True:\r\n toRemove = []\r\n for k, v in degree.items():\r\n if v == 1:\r\n toRemove.append(k)\r\n if len(toRemove) == 0:\r\n break\r\n for nodes in toRemove:\r\n del degree[nodes]\r\n for child in graph[nodes]:\r\n degree[child] -= 1\r\n\r\n res += 1\r\nprint(res)\r\n", "MAXN = 104\nn, m = map(int, input().split())\nadj = dict()\nfor i in range(MAXN): adj[i] = list()\nfor _ in range(m):\n u, v = map(int, input().split())\n adj[u].append(v)\n adj[v].append(u)\n\ngroups = 0\nwhile True:\n ok = False\n reprimands = list()\n for i in range(n + 1):\n if len(adj[i]) == 1:\n reprimands.append(i)\n if len(reprimands) == 0: break\n groups += 1\n for u in reprimands:\n for v in adj[u]: adj[v].remove(u)\n adj[u] = list()\nprint(groups)\n", "n, m=map(int, input().split(' '))\r\n\r\nadj=[[0]*n for i in range(n)]\r\nfor i in range(m):\r\n\tx, y=map(int, input().split(' '))\r\n\tadj[x-1][y-1]+=1\r\n\tadj[y-1][x-1]+=1\r\n\r\n\r\n\r\ngroups=0\r\n\r\nwhile(1 in [sum(x) for x in adj]):\r\n\t#print(adj)\r\n\r\n\tkk=[]\r\n\tfor x in range(len(adj)):\r\n\t\tif(sum(adj[x])==1):\r\n\t\t\tkk.append([x,adj[x].index(1)])\r\n\r\n\r\n\t\r\n\tfor c in kk:\r\n\t\t\t\tadj[c[0]][c[1]], adj[c[1]][c[0]]=0,0\r\n\r\n\r\n\tgroups+=1\r\n\r\nprint(groups)\r\n\r\n", "n, m = map(int, input().split())\r\ng = [[] for _ in range(n + 1)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n g[a] += [b]\r\n g[b] += [a]\r\n\r\nc = 0\r\nwhile True:\r\n v = []\r\n for i in range(len(g)):\r\n if len(g[i]) == 1:\r\n v.append(i)\r\n if v:\r\n for i in v:\r\n g[i] = []\r\n for j in g:\r\n try:\r\n j.remove(i)\r\n except:\r\n pass\r\n c += 1\r\n else:\r\n break\r\nprint(c)\r\n", "n,m=map(int,input().split())\r\nl=[]\r\nfor _ in range(m): \r\n a,b=map(int,input().split())\r\n l.append([a,b])\r\nc=0\r\nwhile True:\r\n l2=[i for i in range(1,n+1) if sum([la.count(i) for la in l])==1]\r\n #print(l2)\r\n if not len(l2):break\r\n l=[la for la in l if la[0] not in l2 and la[1] not in l2]\r\n c+=1\r\nprint(c)", "n, m = map(int , input().split())\r\n\r\ns = [set() for i in range(n+1)]\r\n\r\nfor _ in range(m):\r\n x, y = map(int, input().split())\r\n s[x].add(y)\r\n s[y].add(x)\r\n\r\n\r\n# solution\r\nans = 0\r\nwhile True:\r\n x = set()\r\n \r\n for i in range(1, n+1):\r\n if len(s[i]) == 1:\r\n x.add(i)\r\n s[i] = set()\r\n\r\n if len(x) == 0: break\r\n ans +=1\r\n for i in range(1, n+1):\r\n s[i] -= x\r\n \r\nprint(ans)", "n, m = map(int, input().split())\r\nedg = [[]for i in range(n+1)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n edg[a].append(b)\r\n edg[b].append(a)\r\n\r\nans = 0\r\n\r\nwhile True:\r\n ok = False\r\n remove = []\r\n for i in range(len(edg)):\r\n if len(edg[i]) == 1:\r\n remove.append((edg[i][0],(i)))\r\n ok = True\r\n edg[i].pop()\r\n if ok:\r\n ans += 1\r\n else:\r\n break\r\n for i in remove:\r\n if len(edg[i[0]]) > 0:\r\n edg[i[0]].remove(i[1])\r\nprint(ans)\r\n", "# Read input\r\nn, m = map(int, input().split())\r\n\r\n# Create an adjacency list to represent the graph\r\nadj_list = [[] for _ in range(n + 1)]\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n adj_list[a].append(b)\r\n adj_list[b].append(a)\r\n\r\nvisited = [False] * (n + 1)\r\ngroups_kicked_out = 0\r\nperm_removed = {}\r\nt = 1\r\nwhile(t):\r\n t = 0\r\n #print(adj_list)\r\n removed = {}\r\n for i in range(1, n + 1):\r\n if perm_removed.get(i):\r\n continue\r\n if len(adj_list[i]) == 1:\r\n removed[i] = adj_list[i][0]\r\n t = 1\r\n perm_removed[i]=1\r\n for i in removed:\r\n adj_list[removed[i]] = [x for x in adj_list[removed[i]] if x != i]\r\n if t==1:\r\n groups_kicked_out += 1\r\n \r\n#print(adj_list)\r\nprint(groups_kicked_out) # Subtract 1 to exclude the initial group of students\r\n", "from typing import DefaultDict\n\n\nn, m = list(map(int, input().split(' ')))\ngraph = {}\nfor i in range(m):\n a, b = list(map(int, input().split(' ')))\n if a not in graph:\n graph[a] = set()\n if b not in graph:\n graph[b] = set()\n graph[a].add(b)\n graph[b].add(a)\ncount = 0\nwhile True:\n removal = 0\n to_remove = []\n for node in graph:\n if len(graph[node])==1:\n removal +=1\n to_remove+=[node]\n for node in to_remove:\n for neighbor in graph[node]:\n graph[neighbor].remove(node)\n del graph[node]\n \n if removal==0:\n break\n else:\n count+=1\nprint(count)\n \n\n ", "import bisect\nimport sys\nfrom collections import deque\n\nEPS = sys.float_info.epsilon\n\nLENGTH = 10\nmatrix = [[] for i in range(LENGTH)]\narray = [0] * 1001\n\nanswer = 0\n\n\nclass Edge:\n def __init__(self, vertex_to: object, weight: float):\n self.vertex_to = vertex_to\n self.weight = weight\n\n\nclass Graph:\n\n WHITE_NODE, GRAY_NODE, BLACK_NODE, NULL_PARENT = 0, 1, 2, None\n\n def __init__(self, vertexes):\n self.adj = dict()\n for vertex in vertexes:\n self.adj[vertex] = []\n\n def add_edge(self, vertex_from: object, vertex_to: object, weight: float = 0.0):\n edge = Edge(vertex_to, weight)\n self.adj[vertex_from].append(edge)\n\n\nif __name__ == \"__main__\":\n\n n, m = map(int, sys.stdin.readline().split())\n graph = Graph([i for i in range(n)])\n for i in range(m):\n a, b = map(int, sys.stdin.readline().split())\n graph.add_edge(a - 1, b - 1)\n graph.add_edge(b - 1, a - 1)\n answer = 0\n while True:\n q = []\n for vertex in graph.adj:\n if len(graph.adj[vertex]) == 1:\n q.append(dict(vertex_from=vertex, edge=graph.adj[vertex][0]))\n if q:\n answer += 1\n for obj in q:\n try:\n del graph.adj[obj['vertex_from']]\n ls = graph.adj[obj['edge'].vertex_to]\n for ind, edge in enumerate(ls):\n if edge.vertex_to == obj['vertex_from']:\n ls.pop(ind)\n except:\n pass\n else:\n break\n\n\n print(answer)\n", "\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\ngr = [set() for i in range(n)]\r\n\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n gr[u-1].add(v-1)\r\n gr[v-1].add(u-1)\r\ngroup=0\r\nwhile(1):\r\n repim=set()\r\n for i in range(n):\r\n if len(gr[i])==1:\r\n repim.add(i)\r\n gr[i]=set()\r\n if len(repim)==0:\r\n break\r\n group+=1\r\n for i in range(n):\r\n gr[i]=gr[i]-repim\r\nprint(group)\r\n\r\n\r\n\r\n\"\"\"\r\nfor p in range(int(input())):\r\n n,m,k=map(int,input().split())\r\n if n==1 and k==2 and m==0:\r\n print('YES')\r\n elif m<n-1 or k<3 or m>n*(n-1)/2:\r\n print('NO')\r\n elif k==3 and m<n*(n-1)/2:\r\n print('NO')\r\n else:\r\n print('YES')\r\n\r\n\"\"\"", "n, m = map(int, input().split())\r\ns = [set() for i in range(n+1)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n s[a].add(b)\r\n s[b].add(a)\r\ncount = 0\r\nwhile(True):\r\n x = set()\r\n for i in range(1, n+1):\r\n if len(s[i]) == 1:\r\n x.add(i)\r\n s[i] = set()\r\n \r\n if len(x) == 0:\r\n break\r\n count += 1\r\n for i in range(1, n+1):\r\n s[i] -= x\r\nprint(count)", "import sys\r\nimport math\r\nfrom sys import stdin, stdout\r\n\r\n \r\n# TAKE INPUT\r\ndef get_ints_in_variables():\r\n return map(int, sys.stdin.readline().strip().split())\r\ndef get_int(): return int(input())\r\ndef get_ints_in_list(): return list(\r\n map(int, sys.stdin.readline().strip().split()))\r\ndef get_list_of_list(n): return [list(\r\n map(int, sys.stdin.readline().strip().split())) for _ in range(n)]\r\ndef get_string(): return sys.stdin.readline().strip()\r\n \r\ndef 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 a, b = get_ints_in_variables()\r\n if a not in mp:\r\n mp[a] = {}\r\n mp[a][b] = b \r\n if b not in mp:\r\n mp[b] = {}\r\n mp[b][a] = a\r\n else:\r\n mp[b][a] = a\r\n else:\r\n mp[a][b] = b\r\n if b not in mp:\r\n mp[b] = {}\r\n mp[b][a] = a\r\n else:\r\n mp[b][a] = a\r\n \r\n flag = True\r\n ans = 0\r\n while flag:\r\n flag = False\r\n oneLaces = {}\r\n for key, value in mp.items():\r\n if len(mp[key]) == 1:\r\n for x, y in mp[key].items():\r\n oneLaces[key] = y # value or key both are same bcoz we sotred same \r\n if len(oneLaces) > 0:\r\n ans += 1\r\n for x, y in oneLaces.items():\r\n if len(mp[x]) >0 :\r\n del mp[y][x]\r\n del mp[x]\r\n\r\n flag = True\r\n print(ans)\r\n # print(mp)\r\n # print(oneLaces)\r\n\r\n\r\n\r\n# calling main Function\r\nif __name__ == \"__main__\":\r\n main()", "from collections import defaultdict\r\nG = defaultdict(set)\r\nn , m = map(int,input().split())\r\nfor i in range(m):\r\n\tu , v = map(int,input().split())\r\n\tG[u].add(v)\r\n\tG[v].add(u)\r\ndef counting(G):\r\n\tg =0\r\n\twhile True:\r\n\t\tans = []\r\n\t\tc = 0\r\n\t\tfor i in G:\r\n\t\t\tif len(G[i])==1:\r\n\t\t\t\tc = 1\r\n\t\t\t\tG[i] = set()\r\n\t\t\t\tans.append(i)\r\n\t\tif c:\r\n\t\t\tfor i in ans:\r\n\t\t\t\tfor j in G:\r\n\t\t\t\t\tif i in G[j]:\r\n\t\t\t\t\t\tG[j].discard(i)\r\n\t\telse:\r\n\t\t\tbreak\r\n\t\tg +=1\r\n\tprint(g)\r\n\r\ncounting(G)\r\n\r\n", "import sys\r\nfrom collections import defaultdict\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\nclass Graph:\r\n def __init__(self): self.graph = defaultdict(list)\r\n def addLace(self, u, v):\r\n self.graph[u].append(v)\r\n self.graph[v].append(u)\r\n def removeLace(self, u, n):\r\n for i in range(1, n + 1):\r\n if i != u and u in self.graph[i]: self.graph[i].remove(u)\r\n self.graph[u] = []\r\n def countGroups(self, n):\r\n kg = []\r\n cnt = 0\r\n while True:\r\n for i in range(1, n + 1):\r\n if len(self.graph[i]) == 1: kg.append(i)\r\n if len(kg) == 0: break\r\n while kg: self.removeLace(kg.pop(0), n)\r\n cnt += 1\r\n return cnt\r\n \r\ndef main():\r\n n, m = get_ints()\r\n Laces = Graph()\r\n for _ in range(m):\r\n x, y = get_ints()\r\n Laces.addLace(x, y)\r\n print(Laces.countGroups(n))\r\nif __name__ == \"__main__\":\r\n main()", "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\nG = [set() for _ in range(n + 1)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n G[a].add(b)\r\n G[b].add(a)\r\nans = 0\r\nwhile True:\r\n x = []\r\n for i in range(1, n + 1):\r\n if not len(G[i]) ^ 1:\r\n x.append(i)\r\n if not len(x):\r\n break\r\n ans += 1\r\n for i in x:\r\n if len(G[i]):\r\n j = list(G[i])[0]\r\n G[i].remove(j)\r\n G[j].remove(i)\r\nprint(ans)", "from collections import defaultdict\r\nn, e = map(int, input().split())\r\n\r\n\r\nd = defaultdict(list)\r\nfor i in range(e):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\n\r\ng = 0\r\nq = []\r\nmarked = [False]*(n+1)\r\nfor i in range(1, n+1):\r\n if len(d[i]) == 1 and not marked[i]:\r\n q.append(i)\r\n marked[i] = True\r\n\r\n\r\nwhile q:\r\n while q:\r\n nd = q.pop()\r\n \r\n if len(d[nd]) > 0:\r\n nbr = d[nd][0]\r\n d[nbr].remove(nd)\r\n d.pop(nd)\r\n \r\n g+=1\r\n for i in range(1, n+1):\r\n if not marked[i] and len(d[i]) == 1 :\r\n q.append(i)\r\n marked[i] = True\r\nprint(g)", "n, m = input().split()\r\nn = int(n)\r\nm = int(m)\r\nmat = []\r\nc = 0\r\nfor _ in range(n+2):\r\n l = [0]*(n+2)\r\n mat.append(l)\r\nfor _ in range(m):\r\n a, b = input().split()\r\n a = int(a)\r\n b = int(b)\r\n mat[a][b] = 1\r\n mat[b][a] = 1\r\nwhile True:\r\n l = []\r\n for i in range(1, n+1):\r\n f = 0\r\n for j in range(1, n+1):\r\n if mat[i][j] == 1:\r\n f += 1\r\n if f == 1:\r\n l.append(i)\r\n if len(l) == 0:\r\n break\r\n else:\r\n c += 1\r\n for i in range(len(l)):\r\n for j in range(1, n+1):\r\n if mat[l[i]][j] == 1:\r\n mat[l[i]][j] = 0\r\n mat[j][l[i]] = 0\r\n\r\nprint(c)\r\n\r\n", "n , m = map(int,input().split())\ncount = []\narr = []\nfor i in range(n):\n a = [0]*n\n count.append(0)\n arr.append(a)\nfor i in range(m):\n a , b= map(int,input().split())\n count[a-1]+=1\n count[b-1]+=1\n arr[a-1][b-1] = 1\n arr[b-1][a-1] = 1\nans = 0\nflag = 1\nwhile(flag==1):\n k = 0\n mm=[]\n for i in range(n):\n if(count[i]==1 and i not in mm):\n k = 1\n for j in range(n):\n if(arr[i][j]==1):\n arr[i][j]= 0 \n arr[j][i] = 0\n count[i]-=1\n count[j]-=1\n mm.append(j)\n break\n if(k==0):\n flag = 0\n else:\n ans+=1\nprint(ans)\n", "\r\n#start the code from here\r\nfrom collections import defaultdict\r\nn,l=map(int,input().split())\r\ngraph=defaultdict(set)\r\nfor i in range(l):\r\n\ta,b=map(int,input().split())\r\n\ta=a-1\r\n\tb=b-1\r\n\tgraph[a].add(b)\r\n\tgraph[b].add(a)\r\nans=0\r\nwhile True:\r\n\trem=[]\r\n\tfor i in graph:\r\n\t\tif len(graph[i])==1:\r\n\t\t\trem.append(i)\r\n\tif len(rem)==0:\r\n\t \tbreak\r\n\tfor i in rem:\r\n\t\tgraph.pop(i)\r\n\t\tfor e in graph:\r\n\t\t\tif i in graph[e]:\r\n\t\t\t\tgraph[e].remove(i)\r\n\tans+=1\r\nprint(ans)", "n, m = map(int, input().split())\r\nadj = {}\r\nfor i in range(n):\r\n adj[i+1] = []\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#print(adj)\r\ntest = 0\r\nans = 0\r\nwhile True:\r\n test = 0\r\n x = []\r\n for i in adj:\r\n if len(adj[i])==1:\r\n test = 1\r\n x.append(i)\r\n for i in x:\r\n for j in adj[i]:\r\n adj[j].remove(i)\r\n adj[i]=[]\r\n if test:\r\n ans+=1\r\n else:\r\n break\r\nprint(ans)\r\n", "n,m = [int(x) for x in input().split(\" \")]\r\nadj = {i:[] for i in range(1,n+1)}\r\ndeg = {i:0 for i in range(1,n+1)}\r\n\r\nfor i in range(m):\r\n x,y = [int(x) for x in input().split(\" \")]\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n deg[x] += 1\r\n deg[y] += 1\r\n\r\nans = 0\r\nwhile True:\r\n if 1 in deg.values():\r\n ans += 1\r\n l = [key for (key,value) in deg.items() if value==1]\r\n for i in l:\r\n deg[i] = 0\r\n for k in adj[i]:\r\n deg[k] -= 1\r\n else:\r\n break\r\n\r\nprint(ans)", "\r\n\r\nn ,m = input().strip().split(\" \")\r\nn =int(n)\r\nm = int(m)\r\ngraph = {}\r\nfor i in range (n):\r\n\tgraph[i+1] = [] \r\nfor i in range(m):\r\n\ttemp = input().strip().split(\" \")\r\n\ttemp[0] = int(temp[0])\r\n\ttemp[1] = int(temp[1])\r\n\tgraph[temp[0]].append(temp[1])\r\n\tgraph[temp[1]].append(temp[0])\r\nedges = m\r\ngroup = 0\r\nwhile(edges > 0):\r\n\tnodes = []\r\n\tflag = 0\r\n\tfor i in graph:\r\n\t\tif len(graph[i]) == 1 :\r\n\t\t\tnodes.append(i)\r\n\t\t\tflag = 1\r\n\tif(flag == 0):\r\n\t\tprint(group)\r\n\t\tquit(0)\r\n\tfor i in nodes:\r\n\t\tdel graph[i]\r\n\tfor i in nodes:\r\n\t\tfor j in graph:\r\n\t\t\tif i in graph[j] :\r\n\t\t\t\tgraph[j].remove(i)\r\n\tgroup += 1\r\n\r\nprint(group)\r\n\r\n\r\n\r\n\r\n", "def cond(dic):\r\n for each in dic:\r\n if len(dic[each])==1:\r\n return True\r\n return False\r\n\r\nn,m=map(int,input().split())\r\ndic={}\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if a in dic:\r\n dic[a].append(b)\r\n else:\r\n dic[a]=[b]\r\n if b in dic:\r\n dic[b].append(a)\r\n else:\r\n dic[b]=[a]\r\nans=0\r\nwhile(cond(dic)):\r\n ans+=1\r\n remove=[]\r\n for each in dic:\r\n if(len(dic[each])==1):\r\n remove.append(each)\r\n for i in remove:\r\n del dic[i]\r\n for i in remove:\r\n for each in dic:\r\n if(i in dic[each]):\r\n dic[each].remove(i)\r\nprint(ans)", "def main(): \r\n n,m = map(int,input().split())\r\n edges = [set() for _ in range(n+1)]\r\n for _ in range(m):\r\n a,b = map(int,input().split())\r\n edges[a].add(b)\r\n edges[b].add(a)\r\n ans = 0\r\n while 1 :\r\n p = set()\r\n for i in range(1,n+1) :\r\n if len(edges[i])==1 : \r\n p.add(i)\r\n edges[i] = set()\r\n if len(p) == 0 :\r\n break\r\n ans += 1\r\n for j in edges :\r\n j-=p\r\n \r\n print(ans)\r\n\r\n \r\n\r\nmain() ", "from collections import deque\r\n\r\n\r\ndef groupings(graph, in_degree):\r\n group = 0\r\n visited = set()\r\n q = deque()\r\n \r\n found = True\r\n while found:\r\n found = False\r\n for node in in_degree:\r\n if in_degree[node] == 1 and node not in visited:\r\n found = True\r\n q.append(node)\r\n visited.add(node)\r\n group += found\r\n while len(q) > 0:\r\n cur_node = q.popleft()\r\n in_degree[cur_node]-=1\r\n for neighbor in graph[cur_node]:\r\n in_degree[neighbor] -= 1\r\n return group\r\n\r\n\r\nn, m = map(int, input().split(\" \"))\r\ngraph = {}\r\nin_degree = {}\r\nfor i in range(1, n + 1):\r\n graph[i] = []\r\n in_degree[i] = 0\r\nfor _ in range(m):\r\n a, b = map(int, input().split(\" \"))\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n in_degree[a] += 1\r\n in_degree[b] += 1\r\n\r\nprint(groupings(graph, in_degree))\r\n", "s, l = map(int, input().split())\r\na = [[] for i in range(s)]\r\n\r\nfor i in range(l):\r\n n, m = map(int, input().split())\r\n a[n-1].append(m-1)\r\n a[m-1].append(n-1)\r\nk = 0\r\nwhile True:\r\n slt = False\r\n rmv = []\r\n for i in range(len(a)-1, -1, -1):\r\n if len(a[i])==1:\r\n rmv.append(i)\r\n slt = True\r\n for i in rmv:\r\n if len(a[i]) != 0:\r\n a[a[i][0]].remove(i)\r\n a[i] = []\r\n if not slt:\r\n break\r\n k+=1\r\nprint(k)\r\n \r\n \r\n", "n, m = map(int, input().split())\nadj = [[] for _ in range(n)]\n\nfor _ in range(m):\n a, b = map(int, input().split())\n adj[a-1].append(b-1)\n adj[b-1].append(a-1)\n\ngroups = 0\nwhile True:\n removed = False\n index_list = []\n\n for i, a in enumerate(adj):\n if(len(a) == 1): \n removed = True\n index_list.append(i)\n \n for i in index_list:\n for a in range(len(adj)):\n if(i in adj[a]): adj[a].remove(i)\n adj[i] = []\n \n if(not removed): break\n groups += 1\n\nprint(groups)\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\nstudents =[[] for _ in range(n+1)]\r\n\r\nfor i in range(1,m+1):\r\n temp = list(map(int, input().split()))\r\n\r\n students[temp[0]].append(temp[1])\r\n students[temp[1]].append(temp[0])\r\n\r\nind = []\r\ntotal = 0\r\nwhile(True):\r\n\r\n for i in range(1,n+1):\r\n\r\n if len(students[i]) == 1:\r\n ind.append(i)\r\n \r\n if len(ind) == 0:\r\n break\r\n else:\r\n for i in ind:\r\n if len(students[i]) > 0:\r\n v = students[i].pop()\r\n students[v].remove(i)\r\n total+=1\r\n ind.clear()\r\nprint(total)", "R=lambda:map(int,input().split())\r\nd={}\r\nl=[]\r\nn,m=R()\r\nfor _ in range(m):\r\n a,b=R()\r\n l.append([a,b])\r\n\r\n if(a in d):\r\n d[a]+=1\r\n else:\r\n d[a]=1\r\n if(b in d):\r\n d[b]+=1\r\n else:\r\n d[b]=1\r\nq=True\r\nc=0\r\nb=[]\r\na=[]\r\nwhile(q):\r\n q=False\r\n for i in range(len(l)):\r\n if(d[l[i][0]]==1 and l[i][0] not in b):\r\n q=True\r\n if(d[l[i][1]]==1):\r\n a.append(i)\r\n else:\r\n d[l[i][1]]-=1\r\n a.append(i)\r\n b.append(l[i][1])\r\n elif(d[l[i][1]]==1 and l[i][1] not in b):\r\n q=True\r\n if(d[l[i][0]]==1):\r\n a.append(i)\r\n else:\r\n d[l[i][0]]-=1\r\n b.append(l[i][0])\r\n a.append(i)\r\n b=[]\r\n k=0\r\n for j in a:\r\n l.pop(j-k)\r\n k+=1\r\n a=[]\r\n if(q):\r\n c+=1\r\nprint(c)\r\n \r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "#RAVENS\n#TEAM_2\n#ESSI-DAYI_MOHSEN-LORENZO\nimport sys\ninput=sys.stdin.readline\nn,m = map(int,input().split())\ng = [[] for i in range(n)]\nfor i in range(m):\n u,v = map(int,input().split())\n g[u-1].append(v-1)\n g[v-1].append(u-1)\n\nres = 0\nwhile 1:\n group = []\n for i in range(n):\n if len(g[i]) == 1:\n group.append(i)\n if len(group) > 0:res+=1\n else:break\n for V in group:\n try:\n g[g[V][0]].remove(V)\n g[V] = []\n except:pass\n \nprint(res)\n", "n,m=map(int,input().split())\r\nl=[[]]*n\r\ngs=0\r\nfor x in range(m) : \r\n a,b=map(int,input().split())\r\n l[a-1]=l[a-1]+[b]\r\n l[b-1]=l[b-1]+[a]\r\nco=1\r\nd={}\r\nfor x in range(len(l)) : \r\n d[x+1]=l[x]\r\nwhile co :\r\n x=0\r\n c=0\r\n ls=[]\r\n while x<len(d) :\r\n if d[x+1]==0 : \r\n x+=1\r\n continue\r\n if len(d[x+1])==1 : \r\n ls.append(x+1)\r\n c=1\r\n elif len(d[x+1])==0 : d[x+1]=0\r\n x+=1\r\n if c : \r\n gs+=1\r\n for e in ls : \r\n d[e]=0\r\n for i in d :\r\n if d[i]!=0 : \r\n for j in ls : \r\n if j in d[i] : d[i].remove(j)\r\n else:\r\n break\r\nprint(gs)\r\n", "import collections\n\nvers = collections.defaultdict(list)\nv, r = input().split()\nr = int(r)\nfor i in range(r):\n first, last = (int(j) for j in input().split())\n vers[first].append(last)\n vers[last].append(first)\ncount_vis = True\ngroups = 0\nwhile count_vis:\n count_vis = False\n viss = collections.defaultdict(int)\n for vertex in vers:\n if len(vers[vertex]) == 1:\n count_vis = True\n viss[vertex] = vers[vertex][0]\n if not count_vis:\n break\n for v, r in viss.items():\n del vers[v]\n try:\n vers[r].remove(v)\n except:\n pass\n viss.clear()\n groups += 1\nprint(groups)\n", "def tied2one(graph, node):\r\n if len(graph[node]) == 1:\r\n return graph[node][0]\r\n\r\n return None\r\n\r\n\r\ndef main():\r\n n, m = map(int, input().split())\r\n graph = {k: [] for k in range(1, n+1)}\r\n for _ in range(m):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n\r\n cnt = 1\r\n ans = 0\r\n while cnt > 0:\r\n cnt = 0\r\n tied_couples = set()\r\n for i in range(1, n+1):\r\n conn = tied2one(graph, i)\r\n\r\n if conn:\r\n tied_couples.add((i, conn))\r\n cnt += 1\r\n\r\n for a, b in tied_couples:\r\n graph[a] = []\r\n if a in graph[b]:\r\n graph[b].remove(a)\r\n\r\n if tied_couples:\r\n ans += 1\r\n\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, m = map(int, input().split())\r\ngraph = [[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n graph[a - 1].append(b)\r\n graph[b - 1].append(a)\r\n\r\ncount = 0\r\n\r\ndone = False\r\n\r\nwhile not done:\r\n toone = dict()\r\n for i in range(n):\r\n if len(graph[i]) == 1:\r\n num = graph[i][0]\r\n toone[i+1] = num\r\n graph[i] = []\r\n\r\n for k, v in toone.items():\r\n if graph[v-1]:\r\n graph[v-1].remove(k)\r\n\r\n if len(toone) >= 1:\r\n count += 1\r\n\r\n if len(toone) == 0:\r\n done = True\r\n\r\n\r\nprint(count)\r\n", "n, m = map(int, input().split())\r\nties = {}\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n\r\n ties[a] = ties.get(a, [])\r\n ties[b] = ties.get(b, [])\r\n\r\n ties[a].append(b)\r\n ties[b].append(a)\r\n\r\nans = 0\r\n\r\nwhile True:\r\n kicked = []\r\n\r\n for key in ties.keys():\r\n if len(ties[key]) == 1:\r\n kicked.append(key)\r\n\r\n if not kicked:\r\n break\r\n\r\n for k in kicked:\r\n del ties[k]\r\n\r\n for key in ties.keys():\r\n ties[key] = list(filter(lambda x: x not in kicked, ties[key]))\r\n\r\n ans += 1\r\n\r\nprint(ans)\r\n", "#from collections import defaultdict\n#n, m = map(int, input().split())\n#\n#graph = defaultdict(set)\n#for _ in range(m):\n# a, b = map(int, input().split())\n# a -= 1\n# b -= 1\n# graph[a].add(b)\n#\n#counts = {k:len(graph[k]) for k in range(n)}\n#print(counts)\n#vis [False for _ in range(n)]\n#\n#def dfs(node, graph, vis, nodes):\n# vis[node] = True \n# nodes.add(node)\n# for neighbor in graph[node]:\n# if not vis[node]:\n# dfs(neighbor, graph, vis, counts)\n#\n#\n#def count_group(nodes):\n# \n#\n#cnt = 0\n#for node in range(n):\n# if not vis[node]:\n# nodes = set()\n# dfs(node, graph, vis, nodes)\n# cnt += count_group(nodes)\n# \n#for k,v in counts\n\nfrom collections import defaultdict\n\nn, m = map(int, input().split())\n\ngraph = defaultdict(set)\n\nfor _ in range(m):\n a, b = map(int, input().split())\n graph[a].add(b)\n graph[b].add(a)\n\ncnt = 0\nwhile True:\n list_del = []\n list_node = []\n for k, v in graph.items():\n if len(v) == 1:\n list_del.append(k)\n\n if len(list_del) == 0:\n break\n else: \n for v in list_del:\n del graph[v]\n for k in graph:\n for v in list_del:\n if v in graph[k]:\n graph[k].remove(v)\n cnt += 1\n\nprint(cnt)\n\n \n \n \n\n", "n, m = map(int, input().split())\r\n\r\ng = [set() for _ in range(n)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1; b -= 1\r\n g[a].add(b)\r\n g[b].add(a)\r\ncounter = 0\r\nwhile True:\r\n excl = []\r\n for i in range(n):\r\n if len(g[i]) == 1:\r\n excl.append(i)\r\n if not excl:\r\n break\r\n counter += 1\r\n for u in excl:\r\n for v in g[u]:\r\n g[v].discard(u)\r\n g[u].clear()\r\nprint(counter)", "# # #BFS\r\n# graph = {0:[1,3,4],1:[2],2:[],3:[5],4:[5],5:[]}\r\n# vis = 6*[0]\r\n# level = 6*[-1]\r\n# start = 0 \r\n# vis[start] = 1 \r\n# level[0] = 0 \r\n# queue = [start]\r\n# ans = []\r\n# while queue :\r\n# parent = queue[0]\r\n# ans.append(parent)\r\n\r\n# queue.remove(parent)\r\n# for i in range(len(graph[parent])):\r\n# child = graph[parent][i]\r\n# if not vis[child]:\r\n# vis[child] = 1 \r\n# level[child] = level[parent]+1\r\n# queue.append(child)\r\n\r\n# # proplem in BFS \r\n# graph = {}\r\n# n , m = map(int,input().split())\r\n# for i in range(1,n+1):\r\n# graph[i] = []\r\n# for i in range(m):\r\n# node1 , node2 = map(int,input().split())\r\n# graph[node1].append(node2)\r\n# start = int(input())\r\n\r\n# vis = (n+1)*[0]\r\n# level = (n+1)*[-1]\r\n# vis[start] = 1 \r\n# level[start] = 0 \r\n# queue = [start]\r\n# ans = []\r\n# while queue :\r\n# parent = queue[0]\r\n# ans.append(parent)\r\n\r\n# queue.remove(parent)\r\n# for i in range(len(graph[parent])):\r\n# child = graph[parent][i]\r\n# if not vis[child]:\r\n# vis[child] = 1 \r\n# level[child] = level[parent]+1\r\n# queue.append(child)\r\n# level = level[1:]\r\n# for i in level :\r\n# if i == -1 :\r\n# print(i)\r\n# else :\r\n# print(6*i)\r\n\r\n\r\n# graph = {}\r\n# n , m = map(int,input().split())\r\n# for i in range(1,n+1):\r\n# graph[i] = []\r\n# for i in range(m):\r\n# node1 , node2 = map(int,input().split())\r\n# graph[node1].append(node2)\r\n# graph[node2].append(node1)\r\n# if n == 1 :\r\n# print(\"YES\")\r\n# else :\r\n# vis = (n+1)*[0]\r\n# level = (n+1)*[-1]\r\n# start = 1\r\n# vis[start] = 1 \r\n# level[start] = 0 \r\n# queue = [start]\r\n# ans = []\r\n# while queue :\r\n# parent = queue[0]\r\n# ans.append(parent)\r\n\r\n# queue.remove(parent)\r\n# graph[parent].sort()\r\n# for i in range(len(graph[parent])):\r\n# child = graph[parent][i]\r\n# if not vis[child]:\r\n# vis[child] = 1 \r\n# level[child] = level[parent]+1\r\n# queue.append(child)\r\n# print(ans)\r\n\r\n# graph = {}\r\n# n , m = map(int,input().split())\r\n# for i in range(n):\r\n# graph[i+1] = []\r\n# vis = [10]+[0]*(n) \r\n# op = False\r\n# for 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# arrlevel = [-1]*(n+1)\r\n\r\n\r\n# start = vis.index(0)\r\n# queue = [start]\r\n# parents = [-1]*(n+1)\r\n# while queue :\r\n# parent = queue[0]\r\n# vis[parent] = 1 \r\n# queue.remove(parent)\r\n# for i in graph[parent]:\r\n# if not vis[i] :\r\n# vis[i] = 1 \r\n# queue.append(i)\r\n# arrlevel[i] = arrlevel[parent]+1\r\n# parents[i] = parent\r\n# elif parents[parent]!=i: # means that it has another parent and and the current parent has another parent so the parent will be the seconed parent to i \r\n# op = True \r\n \r\n\r\n\r\n# if 0 in vis :\r\n# print(\"NO\")\r\n# elif op :\r\n# print(\"FHTAGN!\")\r\n# else :\r\n# print(\"NO\")\r\n\r\nn,m = map(int,input().split())\r\ngraph = {}\r\nfor i in range(1,n+1):\r\n graph[i] = []\r\n\r\nfor i in range(m):\r\n x,y = map(int,input().split())\r\n graph[x].append(y)\r\n graph[y].append(x)\r\nans = 0\r\nwhile True :\r\n c = 0 \r\n els = []\r\n for k,v in graph.items() :\r\n if len(v) == 1 :\r\n c+=1 \r\n els.append(k)\r\n for k in els : \r\n if graph[k] and graph[graph[k][0]] :\r\n graph[graph[k][0]].remove(k)\r\n graph[k] = []\r\n if c == 0 :\r\n break \r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n\r\n# vis = [0]*(n+1)\r\n\r\n# def bfs(start,graph):\r\n# mn = float('inf')\r\n# queue = [start]\r\n# vis[start] = 1 \r\n# ans = []\r\n# while queue :\r\n# parent = queue.pop(0)\r\n# mn = min(l[parent-1],mn)\r\n# for i in range(len(graph[parent])):\r\n# child = graph[parent][i]\r\n# if not vis[child]:\r\n# vis[child] = 1 \r\n# queue.append(child)\r\n# return mn \r\n\r\n# for i in newa :\r\n# c+=bfs(i,graph)\r\n\r\n# print(c)", "\nn, m = list(map(int, input().split()))\n\nmatrix = [[0 for _ in range(n)] for _ in range(n)]\n\nfor _ in range(m):\n x, y = list(map(int, input().split()))\n matrix[x-1][y-1] = 1\n matrix[y-1][x-1] = 1\n\nprefix = [sum(matrix[i]) for i in range(n)]\n#\n#print(prefix)\ndels = set()\nfst = True\ntotal = 0\nwhile fst or len(dels):\n fst = False\n\n dels = set()\n nb = dict()\n for i in range(len(prefix)):\n #print(i, prefix)\n if prefix[i] != 1:\n continue\n\n\n for j in range(n):\n if matrix[i][j] == 1 and i != j:\n if j in nb:\n nb[j] += 1\n else:\n nb[j] = 1\n \n matrix[i][j] = 0\n\n dels.add(i)\n prefix[i] = 0\n\n for el in nb:\n prefix[el] -= nb[el]\n\n if len(dels) > 0:\n total += 1\n \n #print(prefix, dels)\n \nprint(total)\n\t\t\t\t\t\t \t\t\t \t\t\t \t\t\t \t\t\t \t", "from collections import defaultdict\r\nclass Graph:\r\n\tdef __init__(self,v):\r\n\t\tself.graph = defaultdict(list)\r\n\t\tself.vertices = v\r\n\tdef addEdge(self,u,v):\r\n\t\tself.graph[u].append(v)\r\n\t\tself.graph[v].append(u)\t\t\r\n\tdef DFS(self):\r\n\t\tgroups = 0\r\n\t\twhile True:\r\n\t\t\tcount = 0\r\n\t\t\tt = set({})\r\n\t\t\tfor i in range(1,self.vertices+1):\r\n\t\t\t\tif i in self.graph and len(self.graph[i]) == 1:\r\n\t\t\t\t\tt.add(i)\r\n\t\t\t\t\tif len(self.graph[self.graph[i][0]]) == 1:\r\n\t\t\t\t\t\tt.add(self.graph[i][0])\r\n\t\t\tfor i in t:\r\n\t\t\t\tif len(self.graph[i]):\r\n\t\t\t\t\tself.graph[self.graph[i][0]].remove(i)\r\n\t\t\t\tself.graph.pop(i)\r\n\t\t\t\tcount = count+1\r\n\t\t\tif count > 0:\r\n\t\t\t\tgroups = groups + 1\r\n\t\t\telse:\r\n\t\t\t\tbreak\r\n\t\treturn groups\r\nv1,e = map(int,input().split())\r\ng = Graph(v1)\r\nfor i in range(e):\r\n\tu,v = map(int,input().split())\r\n\tg.addEdge(u,v)\r\nprint(g.DFS())\r\n", "n, m = map(int, input().split())\r\n\r\nnodes = {}\r\nfor i in range(1, n+1):\r\n nodes[i] = set()\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n nodes[a].add(b)\r\n nodes[b].add(a)\r\n\r\nCFLAG = False\r\nans = 0\r\nnoChanges = 0\r\n\r\nwhile noChanges < 2:\r\n remNodes = []\r\n for node in nodes:\r\n if len(nodes[node]) == 1:\r\n CFLAG = True\r\n remNodes.append([node, nodes[node].pop()])\r\n\r\n for node in remNodes:\r\n if node[0] in nodes[node[1]]:\r\n nodes[node[1]].remove(node[0])\r\n\r\n if CFLAG:\r\n ans += 1\r\n CFLAG = False\r\n noChanges = 0\r\n else:\r\n noChanges += 1\r\n\r\nprint(ans)", "'''input\r\n6 5\r\n1 4\r\n2 4\r\n3 4\r\n5 4\r\n6 4\r\n\r\n'''\r\nn,m = map(int,input().split())\r\n\r\nl = [[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n\ta,b = map(int,input().split())\r\n\ta-=1\r\n\tb-=1\r\n\tl[a].append(b)\r\n\tl[b].append(a)\r\n\r\ncount = 0\r\n\r\nwhile True:\r\n\tpops = []\r\n\tfor i in range(n):\r\n\t\tif len(l[i])==1:\r\n\t\t\tpops.append([i,l[i][0]])\r\n\tif len(pops):\r\n\t\tfor a,b in pops:\r\n\t\t\tif a in l[b]:\tl[b].remove(a)\r\n\t\t\tif b in l[a]:\tl[a].remove(b)\r\n\t\tcount+=1\r\n\telse:\r\n\t\tbreak\r\n\r\nprint(count)", "# link: https://codeforces.com/contest/129/problem/B\r\nfrom collections import defaultdict\r\n\r\nclass Graph:\r\n def __init__(self):\r\n self.graph = defaultdict(list)\r\n def insert(self,u,v):\r\n self.graph[u].append(v)\r\n self.graph[v].append(u)\r\n def solve(self):\r\n groups = 0\r\n while True:\r\n array = []\r\n for key in self.graph:\r\n if len(self.graph[key]) == 1:\r\n array.append(key)\r\n if len(array) == 0:\r\n break \r\n for i in range(len(array)):\r\n num = array[i]\r\n if len(self.graph[num]):\r\n first = self.graph[num][0]\r\n del self.graph[num]\r\n self.graph[first].remove(num)\r\n if len(array):\r\n groups += 1\r\n return (groups) \r\nif __name__ == \"__main__\":\r\n n,m = map(int, input().split())\r\n g = Graph()\r\n while m:\r\n u,v = map(int, input().split())\r\n g.insert(u,v)\r\n m -= 1\r\n result = g.solve()\r\n print(result) ", "n, m = map(int, input().split())\r\n\r\nadj = [[0] * n for i in range(n)]\r\ndeg = [0] * n\r\n\r\nfor _ in range(m):\r\n i, j = map(lambda x: int(x) - 1, input().split())\r\n adj[i][j] = adj[j][i] = 1\r\n deg[i] += 1\r\n deg[j] += 1\r\n\r\ncnt = 0\r\n\r\nwhile True:\r\n grouplist = []\r\n for i in range(n):\r\n if deg[i] == 1:\r\n grouplist.append(i)\r\n\r\n if len(grouplist) == 0:\r\n break\r\n\r\n cnt += 1\r\n\r\n for i in grouplist:\r\n if adj[i].count(1) == 0:\r\n continue\r\n j = adj[i].index(1)\r\n deg[i] = 0\r\n deg[j] -= 1\r\n adj[i][j] = adj[j][i] = 0\r\n\r\nprint(cnt)\r\n", "'''\nhttp://codeforces.com/contest/129/problem/B\n'''\n\nfrom collections import defaultdict\n\ngraph = defaultdict(set)\nnumber_of_students, number_of_laces = map(int, input().strip().split(\" \"))\n\nfor i in range(number_of_laces):\n student1, student2 = map(int, input().strip().split(\" \"))\n graph[student1].add(student2)\n graph[student2].add(student1)\n\nfirst_remove = []\nresult = 0\nfor key, value in graph.items():\n if len(value) == 1:\n first_remove.append(key)\nwhile first_remove:\n while first_remove:\n element = first_remove.pop()\n if len(graph[element]) == 1:\n connected_node = list(graph[element])[0]\n graph[connected_node].remove(element)\n del graph[element]\n for key, value in graph.items():\n if len(value) == 1:\n first_remove.append(key)\n \n result += 1\nprint(result)", "n,m=[int(x) for x in input().split()]\r\na={}\r\nfor i in range(1,n+1):\r\n a[i]=[]\r\nfor i in range(m):\r\n x,y=[int(x) for x in input().split()]\r\n a[x].append(y)\r\n a[y].append(x)\r\n\r\ndef ones(key):\r\n for v in key:\r\n if len(a[v])>0:\r\n a[a[v][0]].remove(v)\r\n a[v]=[]\r\n \r\n if len(key)==0:\r\n return 0\r\n else:\r\n return 1\r\n \r\nc=0\r\nkey=list(a.keys())\r\nwhile True:\r\n keys=[]\r\n for e in key:\r\n if len(a[e])==1:\r\n keys.append(e)\r\n\r\n if ones(keys)==0:\r\n print(c)\r\n break\r\n else:\r\n c=c+1\r\n continue", "import sys\r\nfrom collections import defaultdict\r\nzz=not __debug__\r\nif not zz:\r\n\tinput=sys.stdin.readline\r\nelse:\t\r\n\tsys.stdin=open('input.txt', 'r')\r\n\tsys.stdout=open('output.txt','w')\r\n\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\nn,m = get_ints_in_variables()\r\ndic = defaultdict(list)\r\nli = [0]*n \r\nfor i in range(m):\r\n\tu,v = get_ints_in_variables()\r\n\tu = u-1\r\n\tv = v-1\r\n\tli[u] += 1\r\n\tli[v] += 1\r\n\tdic[u].append(v)\r\n\tdic[v].append(u)\r\n\r\ngroup = 0\r\n\r\nfor i in range(n):\r\n\tres = []\r\n\tfor i in range(n):\r\n\t\tif li[i] == 1:\r\n\t\t\tres.append(i)\r\n\t\t\tli[i] = 0 \r\n\r\n\tif len(res) == 0:\r\n\t\tbreak\r\n\tgroup += 1\r\n\tfor j in res:\r\n\t\tfor k in dic[j]:\r\n\t\t\tli[k] -= 1\r\n\r\nprint(group) ", "n,t = map(int,input().split())\r\ncount = [[] for _ in range(n+1)]\r\narr = []\r\n\r\nfor i in range(t):\r\n a,b = map(int,input().split())\r\n arr.append([a,b])\r\n count[a].append(b)\r\n count[b].append(a)\r\ntemp = []\r\nnextArr = []\r\nc = 1\r\nans = 0\r\nwhile(c>0):\r\n c= 0\r\n for a,b in (arr):\r\n check = 0\r\n if len(count[a]) <2:\r\n check = 1\r\n temp.append(a)\r\n if len(count[b]) <2:\r\n check = 1\r\n temp.append(b)\r\n if not check:\r\n nextArr.append([a,b])\r\n if len(temp)>0:\r\n c = 1\r\n ans +=1\r\n for num in temp:\r\n if len(count[num])>0:\r\n student = count[num][0]\r\n count[student].remove(num)\r\n arr = nextArr[::]\r\n nextArr = []\r\n temp = []\r\nprint(ans)", "# cook your dish here\r\nn,m=map(int,input().split())\r\ngraph=[[0 for i in range(n+1)] for i in range(n+1)];degree=[0]*(n+1)\r\n\r\nfor _ in range(m):\r\n u,v=map(int,input().split())\r\n graph[v].append(u)\r\n graph[u].append(v)\r\n degree[u]+=1\r\n degree[v]+=1\r\nc=0;l=[]\r\nwhile(1):\r\n flag=0\r\n for i in range(1,n+1):\r\n if degree[i]==1:\r\n flag=1\r\n degree[i]=-1\r\n l.append(i)\r\n if flag==0:\r\n break\r\n else:\r\n c+=1\r\n for x in l:\r\n for y in graph[x]:\r\n if degree[y]!=-1:\r\n degree[y]-=1\r\n # print(graph[x],degree[y]) \r\n l=[] \r\nprint(c) ", "n, m = [int(x) for x in input().split()]\n\ndegrees = [0] * (n+1)\ngraph = {}\nfor _ in range(m):\n l = input().split()\n s1, s2 = int(l[0]), int(l[1])\n if graph.get(s1):\n graph[s1].append(s2)\n else:\n graph[s1] = [s2]\n if graph.get(s2):\n graph[s2].append(s1)\n else:\n graph[s2] = [s1]\n\n degrees[s1] += 1\n degrees[s2] += 1\n\n\nans = 0\nwhile 1:\n q = []\n for i in range(1, n+1):\n if degrees[i] == 1:\n q.append(i)\n if len(q) == 0:\n break\n\n ans += 1\n for node in q:\n degrees[node] -= 1\n for neighbor in graph.get(node):\n degrees[neighbor] -= 1\nprint(ans)\n", "\nn,m = map(int,input().split())\nlp = []\ndg = [0]*(n+1)\nfor _ in range(m):\n a,b = map(int,input().split())\n lp.append((a,b))\n dg[a] +=1\n dg[b] += 1\nans = 0\nwhile True:\n \n z = 0\n q = []\n for i in lp:\n if dg[i[0]]==1 or dg[i[1]]==1:\n q.append(i)\n z =1\n if z==0:\n break\n else:\n ans+=1\n for x in q:\n lp.remove(x)\n dg[x[0]] -= 1\n dg[x[1]] -= 1\n \n \n \nprint(ans)\n\n \n \n \n \n\n \n \n \n \n", "#!/usr/bin/python3\n\"B. Students and Shoelaces\"\n\"Codeforces Beta Round #94 (Div. 2 Only)\"\nn,m=map(int,input().split())\nd={}\nfor i in range(m):\n z,x=map(int,input().split())\n d.setdefault(z,[])\n d.setdefault(x,[])\n d[z].append(x)\n d[x].append(z)\n\nk=0 \nwhile True:\n f=0\n t=[False]*(n+1)\n # print(d)\n for i in range(1,n+1):\n if d.get(i) and len(d[i])==1 and t[i]==False:\n # print(i,d[i])\n asdf=d[i].pop(0)\n d[asdf].remove(i)\n t[asdf]=True\n t[i]=True\n f=1\n if f==0:\n break\n k+=1\nprint(k) \n\n\n", "import sys\ninput = sys.stdin.readline\nfrom collections import deque\n\nclass Graph(object):\n\t\"\"\"docstring for Graph\"\"\"\n\tdef __init__(self,n,d): # Number of nodes and d is True if directed\n\t\tself.n = n\n\t\tself.graph = [[] for i in range(n)]\n\t\tself.parent = [-1 for i in range(n)]\n\t\tself.directed = d\n\t\t\n\tdef addEdge(self,x,y):\n\t\tself.graph[x].append(y)\n\t\tif not self.directed:\n\t\t\tself.graph[y].append(x)\n\n\tdef bfs(self, root): # NORMAL BFS\n\t\tqueue = [root]\n\t\tqueue = deque(queue)\n\t\tvis = [0]*self.n\n\t\twhile len(queue)!=0:\n\t\t\telement = queue.popleft()\n\t\t\tvis[element] = 1\n\t\t\tfor i in self.graph[element]:\n\t\t\t\tif vis[i]==0:\n\t\t\t\t\tqueue.append(i)\n\t\t\t\t\tself.parent[i] = element\n\t\t\t\t\tvis[i] = 1\n\n\tdef dfs(self, root, ans): # Iterative DFS\n\t\tstack=[root]\n\t\tvis=[0]*self.n\n\t\tstack2=[]\n\t\twhile len(stack)!=0: # INITIAL TRAVERSAL\n\t\t\telement = stack.pop()\n\t\t\tif vis[element]:\n\t\t\t\tcontinue\n\t\t\tvis[element] = 1\n\t\t\tstack2.append(element)\n\t\t\tfor i in self.graph[element]:\n\t\t\t\tif vis[i]==0:\n\t\t\t\t\tself.parent[i] = element\n\t\t\t\t\tstack.append(i)\n\n\t\twhile len(stack2)!=0: # BACKTRACING. Modify the loop according to the question\n\t\t\telement = stack2.pop()\n\t\t\tm = 0\n\t\t\tfor i in self.graph[element]:\n\t\t\t\tif i!=self.parent[element]:\n\t\t\t\t\tm += ans[i]\n\t\t\tans[element] = m\n\t\treturn ans\n\n\tdef shortestpath(self, source, dest): # Calculate Shortest Path between two nodes\n\t\tself.bfs(source)\n\t\tpath = [dest]\n\t\twhile self.parent[path[-1]]!=-1:\n\t\t\tpath.append(parent[path[-1]])\n\t\treturn path[::-1]\n\n\tdef detect_cycle(self):\n\t\tindeg = [0]*self.n\n\t\tfor i in range(self.n):\n\t\t\tfor j in self.graph[i]:\n\t\t\t\tindeg[j] += 1\n\t\tq = deque()\n\t\tvis = 0\n\t\tfor i in range(self.n):\n\t\t\tif indeg[i]==0:\n\t\t\t\tq.append(i)\n\t\twhile len(q)!=0:\n\t\t\te = q.popleft()\n\t\t\tvis += 1\n\t\t\tfor i in self.graph[e]:\n\t\t\t\tindeg[i] -= 1\n\t\t\t\tif indeg[i]==0:\n\t\t\t\t\tq.append(i)\n\t\tif vis!=self.n:\n\t\t\treturn True\n\t\treturn False\n\n\tdef reroot(self, root, ans):\n\t\tstack = [root]\n\t\tvis = [0]*n\n\t\twhile len(stack)!=0:\n\t\t\te = stack[-1]\n\t\t\tif vis[e]:\n\t\t\t\tstack.pop()\n\t\t\t\t# Reverse_The_Change()\n\t\t\t\tcontinue\n\t\t\tvis[e] = 1\n\t\t\tfor i in graph[e]:\n\t\t\t\tif not vis[e]:\n\t\t\t\t\tstack.append(i)\n\t\t\tif self.parent[e]==-1:\n\t\t\t\tcontinue\n\t\t\t# Change_The_Answers()\n\n\tdef calc(self, root):\n\t\tcount = [0]*n\n\t\tfor i in range(n):\n\t\t\tcount[i] = len(self.graph[i])\n\t\treturn count\n\nn,m = map(int,input().split())\ng = Graph(n,False)\nfor i in range(m):\n\tx,y = map(int,input().split())\n\tg.addEdge(x-1,y-1)\n\nans = 0\nfor i in range(n):\n\tcount = g.calc(i)\n\tif 1 not in count:\n\t\tbreak\n\tans += 1\n\t# print (count)\n\t# print (g.graph)\n\tfor j in range(n):\n\t\tif count[j]==1:\n\t\t\tcount[j] = 0\n\t\t\tfor k in g.graph[j]:\n\t\t\t\tg.graph[k].remove(j)\n\t\t\tg.graph[j] = []\n\t\t# print (g.graph)\nprint (ans)", "n,m=map(int,input().split())\r\ngraph=[None]*(n+1)\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\nc=0\r\n#print(graph)\r\nwhile True:\r\n flag=0\r\n d=[]\r\n for i in range(1,n+1):\r\n if len(graph[i])==1:\r\n flag=1\r\n graph[i].clear()\r\n d.append(i)\r\n if flag==0:\r\n break\r\n else:\r\n for i in range(len(d)):\r\n for j in range(1,n+1):\r\n k=0\r\n m=len(graph[j])\r\n while k<m:\r\n if graph[j][k]==d[i]:\r\n graph[j].remove(graph[j][k])\r\n m=m-1\r\n k=k+1\r\n #print(graph)\r\n c=c+1\r\nprint(c)\r\n \r\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\n\r\nn, m = map(int, input().split())\r\ng = [[] for i in range(n + 1)]\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n g[x].append(y)\r\n g[y].append(x)\r\nres = 0\r\nwhile True:\r\n f = 0\r\n for_del = []\r\n for i in range(1, n + 1):\r\n if len(g[i]) == 1:\r\n for_del.append((g[i][0], i))\r\n g[i] = []\r\n f=1\r\n for i in for_del:\r\n try:\r\n g[i[0]].pop(g[i[0]].index(i[1]))\r\n except Exception:\r\n pass\r\n if f:\r\n res+=1\r\n else:\r\n print(res)\r\n break\r\n", "from collections import defaultdict\n\nN, M = input().split()\nN, M = int(N), int(M)\n\nadjacencyList = defaultdict(set)\n\nfor i in range(M):\n connection = input().split()\n first, second = int(connection[0]), int(connection[1])\n adjacencyList[first].add(second)\n adjacencyList[second].add(first)\n\ncount = 0\nwhile True:\n removed = []\n for i in adjacencyList:\n if len(adjacencyList[i]) == 1:\n # Only 1 element in adjacencyList[i], actually; We just wanna get the only element\n for s in adjacencyList[i]:\n removed.append([i, s])\n \n if len(removed) == 0:\n break\n\n count += 1\n for removedItem in removed:\n adjacencyList[removedItem[0]].clear()\n if len(adjacencyList[removedItem[1]]) != 0:\n adjacencyList[removedItem[1]].remove(removedItem[0])\n\nprint(count)\n", "n,m = map(int,input().split())\r\nG,cnt = [[0]*n for _ in range(n)],0\r\nfor a,b in [map(int,input().split()) for _ in range(m)]:\r\n a,b = a-1,b-1\r\n G[a][b],G[b][a] = 1,1\r\nwhile 1:\r\n flag,psl =0, [-1 for _ in range(n)]\r\n for i in range(n):\r\n sz,ps = 0,-1\r\n for j in range(n):\r\n sz+= G[i][j]\r\n ps = j if G[i][j] else ps\r\n if sz == 1:\r\n flag,psl[i] = 1,ps\r\n for i in range(n):\r\n if psl[i]>-1:G[i][psl[i]],G[psl[i]][i],psl[i] = G[i][psl[i]]-1,G[psl[i]][i]-1,-1\r\n if flag: cnt+=1\r\n else :break\r\nprint(cnt)", "from collections import defaultdict\r\nfrom os import stat_result\r\nn, m = map(int, input().split())\r\nstudents = defaultdict(int)\r\npairs = []\r\nres = 0\r\nfor i in range(m):\r\n s1, s2 = map(int, input().split())\r\n students[s1] +=1\r\n students[s2] +=1\r\n pairs.append((s1, s2))\r\n\r\nno_change = True\r\nwhile no_change:\r\n no_change = False\r\n temp_count = students.copy()\r\n for s1, s2 in pairs:\r\n if students[s1]== 1 or students[s2] == 1:\r\n temp_count[s1] -=1\r\n temp_count[s2] -=1 \r\n no_change = True\r\n\r\n if no_change:\r\n res += 1\r\n students = temp_count\r\nprint(res)\r\n", "import sys\ndef input(): return sys.stdin.readline().strip()\n\nn, m = map(int, input().split())\nadj = [[0 for i in range(n)] for j in range(n)]\n\nfor i in range(m):\n\ta, b = map(int, input().split())\n\tadj[a-1][b-1] = 1\n\tadj[b-1][a-1] = 1\n\ncount = 0\navailable = True\nzero = [0 for i in range(n)]\n\nwhile available:\n\tpos = []\n\tfor i in range(n):\n\t\ts = sum(adj[i])\n\t\tif s == 1:\n\t\t\tpos.append(i)\n\tif len(pos):\n\t\tcount += 1\n\t\tfor i in range(len(pos)):\n\t\t\tadj[pos[i]] = zero\n\t\t\tfor j in range(n):\n\t\t\t\tadj[j][pos[i]] = 0\n\telse:\n\t\tavailable = False\n\nprint(count)\n\n\n", "while True:\n try:\n x = input()\n n, m = list(map(int, x.split()))\n adj_list = {(i+1): set() for i in range(n)}\n\n for i in range(m):\n x = input()\n a, b = list(map(int, x.split()))\n adj_list[a].add(b)\n adj_list[b].add(a)\n\n can_reprimand = True\n groups = 0\n\n while can_reprimand:\n visited = set()\n can_reprimand = False\n for i in range(1, n+1):\n if len(adj_list[i]) == 1 and i not in visited:\n can_reprimand = True\n # access item in set\n adj = 0\n for a in adj_list[i]:\n adj = a\n adj_list[i].clear()\n adj_list[adj].remove(i)\n visited.add(adj)\n if can_reprimand:\n groups += 1\n\n print(groups)\n except EOFError:\n break\n \t \t \t\t\t\t\t\t \t\t \t\t \t\t \t\t\t", "n, m = list(map(int, input().split()))\r\n\r\ns = {}\r\nfor i in range(m):\r\n a, b = list(map(int, input().split()))\r\n s.setdefault(a, []).append(b)\r\n s.setdefault(b, []).append(a)\r\n\r\n#print(s)\r\n\r\nans = 0\r\nreprimand = ''\r\ndef canReprimand():\r\n ret = [] \r\n for k, v in s.items():\r\n if len(v) == 1:\r\n ret.append(k)\r\n return ret\r\nans = 0\r\nreprimand = canReprimand()\r\nwhile reprimand != []:\r\n# print(reprimand)\r\n for i in reprimand:\r\n #print(i)\r\n st = s[i][0]\r\n s[i] = []\r\n if st not in reprimand:\r\n s[st].remove(i) \r\n ans += 1\r\n reprimand = canReprimand()\r\nprint(ans)\r\n", "from queue import Queue\n\nn, m = map(int, input().split())\nG = [[] for _ in range(n)]\nins = [0 for _ in range(n)]\nfor _ in range(m):\n a, b = map(int, input().split())\n G[a - 1] += [b - 1]\n G[b - 1] += [a - 1]\n ins[a - 1] += 1\n ins[b - 1] += 1\n\nQ_old = Queue()\n\nfor i in range(n):\n if ins[i] == 1:\n Q_old.put(i)\n\ngroups = 0\n\nwhile not Q_old.empty():\n groups += 1\n while not Q_old.empty():\n tmp = Q_old.get()\n ins[tmp] = 0\n for neighbour in G[tmp]:\n ins[neighbour] -= 1\n\n for i in range(n):\n if ins[i] == 1:\n Q_old.put(i)\n\n\nprint(groups)\n", "import sys\nfrom collections import defaultdict\n\ndef remove_one(graph):\n '''\n Removes nodes with degree one from the graph.\n '''\n d = set()\n for node in graph:\n if len(graph[node]) == 1:\n d.add(node)\n\n for n in d:\n if graph[n]:\n to_del = list(graph[n])[0]\n graph[n].clear()\n graph[to_del].remove(n)\n return len(d)\n\ndef main(graph):\n a = 0\n while remove_one(graph) > 0:\n a += 1\n print(a)\n\nif __name__ == \"__main__\":\n queries = []\n for e, line in enumerate(sys.stdin.readlines()):\n inp = list(map(int, line.strip().split()))\n if e == 0:\n n, e = inp\n graph = {i + 1: set() for i in range(n)}\n else:\n n1, n2 = inp\n graph[n1].add(n2)\n graph[n2].add(n1)\n main(graph)\n", "n, m = [int(k) for k in input().split()]\r\ndict = {}\r\nfor i in range(m):\r\n first, second = [int(k) for k in input().split()]\r\n if first not in dict:\r\n dict[first] = set()\r\n dict[first].add(second)\r\n else: dict[first].add(second)\r\n if second not in dict:\r\n dict[second] = set()\r\n dict[second].add(first)\r\n else: dict[second].add(first)\r\n\r\ncount = 0\r\nwhile True:\r\n temp = set()\r\n for key in list(dict):\r\n if len(dict[key]) == 1:\r\n temp.add(key)\r\n dict.pop(key)\r\n if not temp:\r\n break\r\n count += 1\r\n for key in dict:\r\n dict[key] -= temp\r\n \r\nprint(count)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sun Jul 31 11:58:54 2022\r\n\r\n@author: Conor\r\n\r\nCFSheet B Problem 33 - CF129-DIV2B\r\n\"\"\"\r\n\r\ndef valNeighbours(num):\r\n ans = 0\r\n for i in range(len(graph[num])):\r\n if graph[num][i] not in kicked:\r\n ans += 1\r\n return ans == 1\r\n\r\nstudents, laces = map(int,input().split())\r\ngraph = [[] for _ in range(students)]\r\nfor i in range(laces):\r\n fro, to = map(int,input().split())\r\n graph[fro-1].append(to-1)\r\n graph[to-1].append(fro-1)\r\n\r\nans = 0\r\nkicked = {}\r\nwhile True:\r\n toKick = []\r\n repd = False\r\n for i in range(students):\r\n if i not in kicked and valNeighbours(i):\r\n repd = True\r\n toKick.append(i)\r\n if not repd:\r\n break\r\n ans += 1\r\n for i in toKick:\r\n kicked[i] = 1\r\nprint(ans)", "n,m=map(int,input().split())\ng=[[0 for _ in range(n)] for _ in range(n)]\nfor _ in range(m):\n a,b=map(int,input().split())\n a-=1\n b-=1\n g[a][b]=1\n g[b][a]=1\n\ncanrep=True\ns=set(range(n))\nig=set()\n\ndef rowsum(s,i):\n ans=0\n for j in s:\n ans+=g[i][j]\n return ans\nans=0 \nwhile canrep:\n canrep=False\n for i in s: \n if i in ig:\n continue\n if rowsum(s,i)==1:\n ig.add(i)\n canrep=True\n s-=ig\n if canrep==False:\n break\n else:\n ans+=1\nprint(ans)\n", "# Students and Shoelaces\n\nui = input().split()\nn, m = int(ui[0]), int(ui[1])\n\nnaughty_saussies = {}\n\nfor _ in range(m):\n ui = input().split()\n n1, n2 = int(ui[0]), int(ui[1])\n\n if n1 not in naughty_saussies:\n naughty_saussies[n1] = set()\n naughty_saussies[n1].add(n2)\n\n if n2 not in naughty_saussies:\n naughty_saussies[n2] = set()\n naughty_saussies[n2].add(n1)\n\ngroups_eliminated = 0\n\nwhile(True):\n to_be_eliminated = set()\n for i in range(1, n+1):\n if i in naughty_saussies and len(naughty_saussies[i]) == 1:\n to_be_eliminated.add(i)\n\n if len(to_be_eliminated) == 0:\n break\n\n groups_eliminated += 1\n\n for naughty_boi in to_be_eliminated:\n if(len(naughty_saussies[naughty_boi]) > 0):\n naughty_saussies[naughty_saussies[naughty_boi].pop()].remove(naughty_boi)\n del naughty_saussies[naughty_boi]\n\n\nprint(groups_eliminated)\n\n \t \t\t \t \t \t \t \t\t\t \t\t", "n,m = map(int, input().split())\ncounts = [0] * n\ngraph = [[] for _ in range(n)]\nfor _ in range(m):\n a,b = map(lambda x: int(x)-1, input().split())\n counts[a] += 1\n counts[b] += 1\n graph[a].append(b)\n graph[b].append(a)\n\ncounts2 = counts[:]\nc = 0\nwhile True:\n ok = False\n for a in range(n):\n if counts[a] == 1:\n ok = True\n for b in graph[a]:\n counts2[b] -= 1\n counts2[a] = 0\n if ok:\n c += 1\n else:\n break\n counts = counts2[:]\n\nprint(c)\n\n", "# Anuneet Anand\r\n \r\nn,m = map(int,input().split())\r\n \r\nG = {}\r\nfor i in range(1,n+1):\r\n\tG[i]=[]\r\n \r\nfor i in range(m):\r\n\ta,b = map(int,input().split())\r\n\tG[a].append(b)\r\n\tG[b].append(a)\r\n \r\nS = set()\r\nT = set()\r\nc = 0\r\n \r\nfor i in range(1,n+1):\r\n\tif len(G[i])>0:\r\n\t\tS.add(i)\r\nwhile len(S)>1 and c<2*n:\r\n\ta = len(S)\r\n\tfor i in range(1,n+1):\r\n\t\tx = i\r\n\t\tif len(G[x])==1:\r\n\t\t\tS.discard(x)\r\n\t\t\tT.add(x)\r\n\t\t\tG[x]=[]\r\n\tfor i in range(1,n+1):\r\n\t\tfor j in T:\r\n\t\t\tif j in G[i]:\r\n\t\t\t\tG[i].remove(j)\r\n \r\n\tb = len(S)\r\n\tif a==b:\r\n\t\tbreak\r\n\tc+=1\r\n \r\nprint(c)", "\r\nn,m=map(int,input().split())\r\nd={i:set() for i in range(1,n+1)}\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n d[a].add(b)\r\n d[b].add(a)\r\n \r\nc=1\r\ngrp=0\r\nwhile True:\r\n flag=0\r\n ans=[]\r\n for i in d:\r\n if len(d[i])==1:\r\n flag=1\r\n d[i]=set()\r\n ans.append(i)\r\n\r\n if flag:\r\n for i in ans:\r\n for j in d:\r\n if i in d[j]:\r\n d[j].discard(i)\r\n else:\r\n break\r\n\r\n grp+=1\r\n\r\n\r\nprint(grp)\r\n \r\n", "n, m = map(int, input().split())\r\n\r\nfrom collections import defaultdict\r\ntied = defaultdict()\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n if a in tied:\r\n tied[a].append(b)\r\n else:\r\n tied[a] = [b]\r\n if b in tied:\r\n tied[b].append(a)\r\n else:\r\n tied[b] = [a]\r\n\r\n\r\ndef remove_group(people):\r\n for each in people:\r\n tied_to = tied[each]\r\n for other in tied_to:\r\n if each in tied[other]:\r\n tied[other].remove(each)\r\n tied[each] = []\r\n\r\n\r\ngroup = 0\r\npeople_tied_to = [len(tied[each]) for each in tied]\r\nwhile 1 in people_tied_to:\r\n reprimanded = []\r\n for each_tie in tied:\r\n if len(tied[each_tie]) == 1:\r\n reprimanded.append(each_tie)\r\n if len(reprimanded) > 0:\r\n group += 1\r\n remove_group(reprimanded)\r\n people_tied_to = [len(tied[each]) for each in tied]\r\n\r\nprint(group)\r\n", "diction = {}\nstudentandlaces = input().split()\nnumstudents = int(studentandlaces[0])\nnumlaces = int(studentandlaces[1])\n\n\nfor i in range(numlaces):\n connections = input().split()\n first = int(connections[0])\n second = int(connections[1])\n if first in diction:\n diction[first].append(second)\n else: \n diction[first] = [second]\n if second in diction:\n diction[second].append(first)\n else:\n diction[second] = [first]\n\nround = 0\nwhile True:\n count = 0\n wanttoremove = []\n for i in range(1, numstudents+1):\n if i in diction and len(diction[i]) == 1:\n count += 1\n wanttoremove.append(i)\n for i in range(len(wanttoremove)):\n if len(diction[wanttoremove[i]]) != 0:\n diction[diction[wanttoremove[i]][0]].remove(wanttoremove[i])\n del diction[wanttoremove[i]]\n if count == 0:\n break\n round += 1\n\nprint(round)", "n,m=map(int,input().split())\r\ns=[set() for i in range(n+1)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n s[a].add(b)\r\n s[b].add(a)\r\nans=0\r\nwhile(True):\r\n x=set()\r\n for i in range(1,n+1):\r\n if len(s[i])==1:\r\n x.add(i)\r\n s[i]=set()\r\n if len(x)==0:\r\n break\r\n ans+=1\r\n for i in range(1,n+1):\r\n s[i]-=x\r\nprint(ans)", "n,m=list(map(int,input().strip().split()))\r\nq=[[]for i in range(n)]\r\nst=[0 for i in range(n)]\r\nfor i in range(m):\r\n a,b=list(map(int,input().strip().split()))\r\n a-=1\r\n b-=1\r\n q[a].append(b)\r\n q[b].append(a)\r\n st[a]+=1\r\n st[b]+=1\r\ncnt=0\r\nwhile True:\r\n w=[]\r\n for i in range(n):\r\n if st[i]==1:\r\n w.append(i)\r\n if not w:\r\n break\r\n for i in range(len(w)):\r\n st[w[i]]=0\r\n if q[w[i]] and st[q[w[i]][0]]>0:\r\n st[q[w[i]][0]]-=1\r\n z=q[q[w[i]][0]]\r\n z2=[]\r\n for j in z:\r\n if j!=w[i]:\r\n z2.append(j)\r\n q[q[w[i]][0]]=z2\r\n q[w[i]]=[]\r\n cnt+=1\r\nprint(cnt)", "n, m = map(int, input().split())\r\nmas = []\r\nfor i in range(n):\r\n mas.append([])\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n mas[a - 1].append(b - 1)\r\n mas[b - 1].append(a - 1)\r\ncount = 0\r\nfor i in range(n):\r\n loosers = []\r\n for j in range(n):\r\n if len(mas[j]) == 1:\r\n loosers.append(j)\r\n if loosers:\r\n count += 1\r\n else:\r\n break\r\n for l in range(n):\r\n if len(mas[l]) == 1:\r\n mas[l] = []\r\n else:\r\n for k in range(len(mas[l]) - 1, -1, -1):\r\n if mas[l][k] in loosers:\r\n del mas[l][k]\r\nprint(count)\r\n", "\"\"\"\nI think this is just a topological sort.\nreminds me of alien dictionary since theres likes a two way graph and pruning\n\"\"\"\nfrom collections import defaultdict\nnum_students, num_laces = map(int, input().split())\n\ngraph = defaultdict(set)\nfor _ in range(num_laces):\n student1, student2 = input().strip().split(\" \")\n graph[student1].add(student2)\n graph[student2].add(student1)\n\nstudents_left = num_students\ngroups_banished = 0\nstudents_to_banish = []\ncan_banish = True\nwhile students_left > 0 and can_banish:\n can_banish = False\n for student, connected_students in graph.items():\n if len(connected_students) == 1:\n students_to_banish.append(student)\n can_banish = True\n\n for student in students_to_banish:\n graph.pop(student)\n for other_student in graph:\n if student in graph[other_student]:\n graph[other_student].remove(student)\n\n if can_banish:\n groups_banished += 1\n students_to_banish = []\n\nprint(groups_banished)\n \t \t\t \t\t \t \t\t\t \t\t \t\t\t \t\t \t \t", "from collections import Counter\r\n\r\nnm = list(map(int, input().split()))\r\n\r\nn, m = nm[0], nm[1]\r\nlaces = []\r\ncounted = []\r\n\r\nfor i in range(m):\r\n lace = input()\r\n laces.append(lace)\r\n counted.extend(lace.split())\r\n\r\nkicked = True\r\nkicking = 0\r\n\r\nwhile kicked:\r\n kicked = False\r\n count = Counter(counted)\r\n for person in count:\r\n if count[person] == 1:\r\n kicked = True\r\n while person in counted:\r\n index = counted.index(person)\r\n if index % 2 == 0:\r\n counted.pop(index)\r\n counted.pop(index)\r\n elif index % 2 == 1:\r\n counted.pop(index)\r\n counted.pop(index-1)\r\n\r\n if kicked == True:\r\n kicking +=1\r\n else:\r\n break\r\n\r\nprint(kicking)\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r\n\"\"\"\r\nn, m = map(int, input().split())\r\narr = [[] for i in range(n + 1)]\r\nfor i in range(m):\r\n\ta, b = map(int ,input().split())\r\n\tarr[a].append(b)\r\n\tarr[b].append(a)\r\ncnt = 0\r\nwhile 1:\r\n\tj = 0\r\n\tl = []\r\n\tfor i in range(len(arr) - 1):\r\n\t\tif len(arr[i + 1]) == 1:\r\n\t\t\tarr[i + 1] = []\r\n\t\t\tl.append(i + 1)\r\n\t\telif len(arr[i + 1]) != 1:\r\n\t\t\tj += 1\r\n\tif j == n:\r\n\t\tbreak\r\n\tcnt += 1\r\n\tfor i in l:\r\n\t\tfor k in arr:\r\n\t\t\tif i in k:\r\n\t\t\t\tk.remove(i)\r\nprint(cnt)\r\n", "from collections import defaultdict\r\ng = defaultdict(list)\r\nn,m = [int(x) for x in input().split()]\r\nindegree = defaultdict(int)\r\nfor i in range(m):\r\n a,b = [int(x) for x in input().split()]\r\n g[a].append(b)\r\n g[b].append(a)\r\n indegree[a]+=1\r\n indegree[b]+=1\r\nc=0\r\nwhile True:\r\n\r\n toremove = []\r\n for x in indegree:\r\n if indegree[x]==1:\r\n toremove.append(x)\r\n if not toremove:\r\n break\r\n for x in toremove:\r\n del indegree[x]\r\n for nodes in g[x]:\r\n indegree[nodes]-=1\r\n \r\n c+=1\r\n \r\nprint(c)", "import sys\nfrom collections import defaultdict\n\ndef make_graph():\n return defaultdict(make_graph)\n\nvalues = [int(x) for x in sys.stdin.readline().split()]\nn_students, n_ties = values[0], values[1]\ngraph = make_graph()\n\nfor i in range(n_ties):\n pair = [int(x) for x in sys.stdin.readline().split()]\n one, two = pair[0], pair[1]\n if one not in graph:\n graph[one] = []\n if two not in graph:\n graph[two] = []\n graph[one].append(two)\n graph[two].append(one)\n\ncount = 0\nwhile True:\n expelled_students = [x for x in graph if len(graph[x]) == 1]\n #print(expelled_students)\n for student in expelled_students:\n for connected in graph[student]:\n if student in graph[connected]:\n graph[connected].remove(student)\n graph[student] = []\n\n if len(expelled_students) == 0:\n break\n count += 1\n\nprint(count)\n", "from collections import defaultdict\r\nn,m=map(int,input().split())\r\ng=defaultdict(set)\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\nans=0\r\nf=1\r\nwhile(f):\r\n f=0\r\n free=set()\r\n for i in g:\r\n if(len(g[i])==1):\r\n free.add((i,list(g[i])[0]))\r\n if(free):\r\n ans+=1\r\n for i in free:\r\n g[i[0]]-={i[1]}\r\n g[i[1]]-={i[0]}\r\n f=1\r\nprint(ans)", "n, m = map(int, input().split())\r\ng = [[] for i in range(n + 1)]\r\nused = [0] * (n + 1)\r\nused1 = [0] * (n + 1)\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n g[a].append(b)\r\n g[b].append(a)\r\nans = 0\r\nfor j in range(n):\r\n f = 0\r\n for k in range(1, n + 1):\r\n if (used[k] == 0):\r\n s = 0\r\n for h in range(len(g[k])):\r\n if (used[g[k][h]] == 0):\r\n #print(k, g[k][h])\r\n s += 1\r\n if s == 1:\r\n f = 1\r\n used1[k] = 1\r\n for i in range(n + 1):\r\n used[i] = used1[i]\r\n if (f == 0):\r\n ans = j\r\n break\r\nprint(ans)\r\n", "n, m = list(map(int,input().split()))\r\narr = []\r\nfor i in range(n):\r\n arr.append([])\r\nfor i in range(m):\r\n a,b = list(map(int,input().split()))\r\n arr[a-1].append(b-1)\r\n arr[b-1].append(a-1)\r\n\r\ncount = 0\r\nwhile True:\r\n old = []\r\n for i in range(len(arr)):\r\n old.append(len(arr[i]))\r\n f = False\r\n\r\n was = [False]*n\r\n\r\n for i in range(n):\r\n if old[i] == 1 and not was[i]:\r\n was[arr[i][0]] = True\r\n was[i] = True\r\n del arr[arr[i][0]][arr[arr[i][0]].index(i)]\r\n del arr[i][0]\r\n f = True\r\n if not f:\r\n break\r\n else:\r\n count+=1\r\nprint(count)", "\r\ndef cf_129_B(g):\r\n removed_group = [5]\r\n no_groups = 0 \r\n while True:\r\n removed_group = []\r\n\r\n for i in range(len(g)):\r\n if len(g[i]) == 1:\r\n removed_group.append((i, g[i].pop()))\r\n \r\n for i in removed_group:\r\n if g[i[1]] == set():\r\n continue\r\n g[i[1]].remove(i[0])\r\n # g[i[0]].clear()\r\n if removed_group == []:\r\n break\r\n no_groups += 1\r\n\r\n return no_groups\r\n \r\n\r\n\r\n\r\n\r\nif __name__=='__main__':\r\n\r\n n, m = map(int, input().split())\r\n g = [ set() for _ in range(n+1)]\r\n for i in range(m):\r\n\r\n a, b = map(int, input().split())\r\n g[a].add(b)\r\n g[b].add(a)\r\n \r\n print(cf_129_B(g))\r\n", "n, m = map(int, input().split())\r\ng = [set() for i in range(n)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a, b = a-1, b-1\r\n g[a].add(b)\r\n g[b].add(a)\r\n\r\nans = 0\r\nused = set()\r\nwhile True:\r\n cnt = 0\r\n for i in range(n):\r\n if i in used:\r\n continue\r\n if len(g[i]) == 1:\r\n cnt += 1\r\n used.add(i)\r\n g[i] = set()\r\n for i in range(n):\r\n ns = set()\r\n for j in g[i]:\r\n if j in used:\r\n continue\r\n ns.add(j)\r\n g[i] = ns\r\n if cnt == 0:\r\n break\r\n ans += 1\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ngraph = [[] for i in range(n + 1)]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n graph[a].append(b)\r\n graph[b].append(a)\r\ncount = 0\r\nyes = True\r\nwhile yes:\r\n mas = []\r\n yes = False\r\n for i in range(1, len(graph)):\r\n if len(graph[i]) == 1:\r\n yes = True\r\n mas.append(i)\r\n for i in mas:\r\n for j in range(len(graph[i])):\r\n graph[graph[i][j]].remove(i)\r\n graph[i] = []\r\n if yes:\r\n count += 1\r\nprint(count)", "sn, ln = map(int, input().split())\r\nlaces = [list(map(int, input().split())) for _ in range(ln)]\r\n\r\nans = 0\r\nwhile True:\r\n deleted_list = [i for i in range(1, sn + 1) if sum([lace.count(i) for lace in laces]) == 1]\r\n if len(deleted_list) > 0:\r\n ans += 1\r\n for j in range(len(laces) - 1, -1, -1):\r\n if laces[j][0] in deleted_list or laces[j][1] in deleted_list:\r\n laces.pop(j)\r\n else:\r\n break\r\nprint(ans)\r\n", "n,m = map(int, input().split())\r\na = []\r\nfor i in range(n+1):\r\n a += [[]]\r\nfor i in range(m):\r\n s = list(map(int, input().split()))\r\n if s[1] not in a[s[0]]:\r\n \r\n a[s[0]] += [s[1]]\r\n if s[0] not in a[s[1]]:\r\n \r\n a[s[1]] += [s[0]]\r\nans = 0\r\n\r\nwhile True:\r\n \r\n to_remove = []\r\n for i in range(1,len(a)):\r\n if len(a[i]) == 1:\r\n to_remove += [i]\r\n if len(to_remove) == 0:\r\n break\r\n\r\n for i in to_remove:\r\n a[i] = []\r\n for i in range(1,len(a)):\r\n for j in to_remove:\r\n try:\r\n a[i].remove(j)\r\n except:\r\n continue\r\n ans += 1\r\n \r\nprint(ans)\r\n \r\n", "# Author: SaykaT\r\n# Problem: 129B\r\n# Time Created: August 25(Tuesday) 2020 || 11:01:23\r\n\r\n#>-------------------------<#\r\nimport sys\r\n\r\ninput = sys.stdin.readline\r\n#>-------------------------<#\r\n\r\n\r\n# Helper Functions. -> Don't cluster your code.\r\ndef kick(graph):\r\n number_of_kick = 0\r\n kicks = []\r\n for x, row in enumerate(graph):\r\n if row.count(1) == 1:\r\n y = row.index(1)\r\n kicks.append([x, y])\r\n\r\n number_of_kick += 1\r\n\r\n for kick in (kicks):\r\n graph[kick[0]][kick[1]] = 0\r\n graph[kick[1]][kick[0]] = 0\r\n return number_of_kick\r\n\r\n\r\n# Main functions. -> Write the main solution here\r\ndef solve():\r\n n, m = map(int, input().split())\r\n graph = [[0 for _ in range(n)] for _ in range(n)]\r\n\r\n for _ in range(m):\r\n x, y = map(int, input().split())\r\n graph[x-1][y-1] = 1\r\n graph[y-1][x-1] = 1\r\n \r\n ban = 0\r\n while True:\r\n number_of_kick = kick(graph)\r\n if number_of_kick != 0:\r\n ban += 1\r\n else:\r\n break\r\n print(ban)\r\n\r\n# Single test cases\r\nsolve()\r\n\r\n", "from sys import stdin\r\nimport math\r\n\r\ninp = lambda: stdin.readline().strip()\r\n\r\nn, m = [int(x) for x in inp().split()]\r\nadj = [[] for x in range(n)]\r\nans = 0\r\nbad = []\r\nfor i in range(m):\r\n a, b = [int(x) for x in inp().split()]\r\n adj[a-1].append(b-1)\r\n adj[b-1].append(a-1)\r\nwhile True:\r\n for i in range(n):\r\n if len(adj[i]) == 1:\r\n bad.append(i)\r\n adj[i] = []\r\n if len(bad) >= 1:\r\n ans+=1\r\n else:\r\n break\r\n for i in bad:\r\n for j in range(n):\r\n if i in adj[j]:\r\n adj[j].remove(i)\r\n bad = []\r\nprint(ans)", "class graph:\r\n # initialize graph\r\n def __init__(self, gdict=None):\r\n if gdict is None:\r\n gdict = dict()\r\n self.gdict = gdict\r\n\r\n # get edges\r\n def edges(self):\r\n return self.find_edges()\r\n\r\n # find edges\r\n def find_edges(self):\r\n edges = []\r\n for node in self.gdict:\r\n for nxNode in self.gdict[node]:\r\n if {nxNode, node} not in edges:\r\n edges.append({node, nxNode})\r\n return edges\r\n\r\n # Get verticies\r\n def get_vertices(self):\r\n return list(self.gdict.keys())\r\n\r\n # add vertix\r\n def add_vertix(self, node):\r\n if node not in self.gdict:\r\n self.gdict[node] = []\r\n\r\n # add edge\r\n def add_edge(self, node1, node2):\r\n # edge = set(edge)\r\n if node1 in self.gdict:\r\n self.gdict[node1].append(node2)\r\n else:\r\n self.gdict[node1] = [node2]\r\n if node2 in self.gdict:\r\n self.gdict[node2].append(node1)\r\n else:\r\n self.gdict[node2] = [node1]\r\n\r\n def delete_node(self, node):\r\n for i in self.gdict:\r\n self.gdict[i].remove(node)\r\n\r\n def dfsUtil(self, v, visit):\r\n\r\n visit[v] = True\r\n print(v)\r\n\r\n for i in self.gdict[v]:\r\n if visit[i] == False:\r\n self.dfsUtil(i, visit)\r\n self.topsort.append(v)\r\n\r\n # dfs for graph\r\n\r\n def dfs(self):\r\n node_len = len(self.gdict)\r\n visit = [False] * (node_len)\r\n self.cnt, self.topsort = 0, []\r\n\r\n for i in range(node_len):\r\n if visit[i] == False:\r\n self.dfsUtil(i, visit)\r\n self.cnt += 1\r\n\r\n\r\ndef inp():\r\n return map(int, input().split())\r\n\r\n\r\nfrom copy import *\r\n\r\nstudent = graph()\r\nn, m = inp()\r\nfor i in range(m):\r\n a, b = inp()\r\n student.add_edge(a, b)\r\n\r\n\r\nc, ans = 1, 0\r\nwhile (c):\r\n c, dic = 0, deepcopy(student.gdict)\r\n for i, j in dic.items():\r\n if len(j) == 1:\r\n student.gdict.pop(i)\r\n if j[0] in student.gdict:\r\n student.gdict[j[0]].remove(i)\r\n c = 1\r\n if c:\r\n ans += 1\r\n # print(student.gdict)\r\n\r\nprint(ans)\r\n", "n,m=map(int,input().split())\nfriends_list = [[] for _ in range(n)]\nfor i in range(m):\n\ta,b = map(int, input().split())\n\tfriends_list[a-1].append(b)\n\tfriends_list[b-1].append(a)\n\n# so idea: we keep track of the number of the number of laces each student is tied to - that way, if we remove a student, we can update the list in constant time\n\ndef reprimand(friends_list):\n\tbad_list = []\n\tfor index in range(n):\n\t\tneighbours = friends_list[index]\n\t\tif len(neighbours) == 1:\n\t\t\tbad_list.append(index)\n\tfor index in bad_list:\n\t\tneighbours = friends_list[index]\n\t\tfriends_list[index] = []\n\t\ttry:\n\t\t\tfriends_list[neighbours[0]-1].remove(index+1)\n\t\texcept IndexError: # already deleted\n\t\t\tpass\n\nans = 0\ncopy = [len(stuff) for stuff in friends_list]\nanother = []\nwhile copy != another:\n\tanother = copy\n\treprimand(friends_list)\n\tcopy = [len(stuff) for stuff in friends_list]\n\tans += 1\n\t\nprint(ans-1)", "n, m = [int(x) for x in input().split()]\r\nadj = []\r\nfor i in range(101):\r\n adj.append(set())\r\nnodes = set()\r\nfor i in range(m):\r\n u, v = [int(x) for x in input().split()]\r\n adj[u].add(v)\r\n adj[v].add(u)\r\n nodes.add(u)\r\n nodes.add(v)\r\nsum = 0\r\ngo = True\r\nwhile go == True:\r\n go = False\r\n mark = set()\r\n for node in nodes:\r\n if len(adj[node]) == 1 and not node in mark:\r\n go = True\r\n x = node\r\n y = 0\r\n for num in adj[node]:\r\n y = num\r\n mark.add(y)\r\n adj[x].remove(y)\r\n adj[y].remove(x)\r\n if go == True:\r\n sum += 1\r\nprint(sum)\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Jun 30 06:00:19 2018\r\n\r\n@author: Arsanuos\r\n\"\"\"\r\n\r\ndef main():\r\n rd = lambda : list(map(int, input().split()))\r\n n, m = rd()\r\n graph = [[0 for t in range(n + 1)] for x in range(n + 1)]\r\n for i in range(m):\r\n u, v = rd()\r\n graph[u][v] = 1\r\n graph[v][u] = 1\r\n find = True\r\n store = []\r\n cnt = 0\r\n while find:\r\n find = False\r\n for i in range(1, n + 1):\r\n item = graph[i]\r\n if sum(item) == 1:\r\n store.append(i)\r\n for i in store:\r\n for j in range(1, n + 1):\r\n if graph[j][i] == 1:\r\n graph[j][i] = 0\r\n find = True\r\n if find == True:\r\n cnt += 1\r\n print(cnt)\r\n \r\nif __name__ == \"__main__\":\r\n main()", "import copy\r\nn,m = map(int,input().split())\r\nls = {}\r\nmet = []\r\nfor _ in range(m):\r\n\ta,b = map(int,input().split())\r\n\tif a in met:\r\n\t\tls[a].append(b)\r\n\telse:\r\n\t\tls[a] = [b]\r\n\t\tmet.append(a)\r\n\tif b in met:\r\n\t\tls[b].append(a)\r\n\telse:\r\n\t\tls[b] = [a]\r\n\t\tmet.append(b)\r\ncnt = 0\r\ncheck = True\r\nwhile check:\r\n\tdeleted = []\r\n\tcheck = False\r\n\tfor key in ls:\r\n\t\tif len(ls[key])==1:\r\n\t\t\tdeleted.append(key)\r\n\t\t\tcheck = True\r\n\tcnt+=1\r\n\t\r\n\r\n\tls_2 = copy.deepcopy(ls)\r\n\tfor el in deleted:\r\n\t\tls[ls_2[el][0]].remove(el)\r\n\tfor el in deleted:\r\n\t\tls.pop(el)\r\n\r\nprint(cnt-1)\r\n", "n, m = list(map(int,input().split()))\r\ngrath = {}\r\nmass = []\r\nfor i in range(n):\r\n grath[i + 1] = []\r\n mass.append(i + 1)\r\nfor i in range(m):\r\n a, b = list(map(int,input().split()))\r\n grath[a].append(b)\r\n grath[b].append(a)\r\ncount = 0\r\nwhile True:\r\n solo = []\r\n for i in range(1, n + 1):\r\n if len(grath[i]) == 1:\r\n solo.append([i,grath[i][0]])\r\n grath[i].clear()\r\n if len(solo) == 0:\r\n break\r\n\r\n for i in solo:\r\n if len(grath[i[1]]) > 0:\r\n grath[i[1]].remove(i[0])\r\n\r\n count += 1\r\n\r\nprint(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "inp = input()\r\n\r\nn = int(inp.split(' ')[0])\r\nm = int(inp.split(' ')[1])\r\nx = 0\r\n\r\nd = {}\r\n\r\ndef get_rowdies():\r\n deleting = list()\r\n for i in d:\r\n if len(d[i]) == 1:\r\n deleting.append(i)\r\n return deleting\r\n\r\nfor i in range(m):\r\n s = input().split(' ')\r\n for k in s:\r\n if k not in d.keys():\r\n d[k] = set()\r\n d[k].add(s[not s.index(k)])\r\n\r\nwhile get_rowdies():\r\n x += 1\r\n for i in get_rowdies():\r\n if len(d[i]) == 1:\r\n d[d[i].pop()].remove(i)\r\n d[i].clear()\r\nprint(x)", "def mingrid():\n for _ in range(int(input())):\n n = int(input())\n segcost = input().split()\n minodd = int(segcost[0])\n mineven = int(segcost[1])\n sumodd = minodd\n sumeven = mineven\n codd = 1\n ceven = 1\n res = sumodd + minodd * (n - codd) + sumeven + mineven * (n - ceven)\n for i in range(2, n):\n now = int(segcost[i])\n if (i + 1) % 2: # odd\n minodd = min(minodd, now)\n sumodd += now\n codd += 1\n else:\n mineven = min(mineven, now)\n sumeven += now\n ceven += 1\n res = min(res, sumodd + minodd * (n - codd) + sumeven + mineven * (n - ceven))\n print(res)\n\n\n# mingrid()\n\n\ndef numofpairs():\n n = (10 * 2) ** 7 + 1\n l = [False] * n\n primes = []\n for i in range(2, n):\n if not l[i]:\n for i1 in range(i + i, n, i):\n l[i1] = True\n primes.append(i)\n l[i] = True\n tol = [0, 0]\n for i in range(2, n):\n pos = 0\n t = 0\n while i:\n val = primes[pos]\n if not i:\n tol.append(t)\n break\n elif i < val:\n tol.append(t + 1)\n break\n elif not i % val:\n i //= val\n else:\n pos += 1\n t += 1\n for _ in range(int(input())):\n c, d, x = map(int, input().split())\n lim = int(math.sqrt(x)) + 1\n ans = 0\n for i in range(1, lim):\n thing = i + d\n if thing % c:\n continue\n ans += (2 ** tol[thing // c])\n print(ans)\n\n\n# numofpairs()\n\ndef restoremod():\n for _ in range(int(input())):\n length = int(input()) - 1\n l = input().split()\n # print(\"s\")\n t = False\n ife = False\n for i in range(length):\n if int(l[i]) == int(l[i + 1]):\n if i > 0:\n print(-1)\n t = True\n break\n else:\n ife = True\n elif ife:\n print(-1)\n t = True\n break\n if not t:\n posc = 0\n negc = 0\n res = int(l[1]) - int(l[0])\n if res > 0:\n posc = res\n else:\n negc = res\n if not negc:\n for i in range(1, length):\n now = int(l[i]) - int(l[i + 1])\n if now > 0:\n negc = now\n break\n if not posc:\n for i in range(1, length):\n change = int(l[i + 1]) - int(l[i])\n if change > 0:\n posc = change\n break\n if posc and negc:\n mod = posc + negc\n else:\n mod = 0\n c = posc if posc else -negc\n larnum = 0\n for i in range(length):\n nowi = int(l[i])\n larnum = max(larnum, nowi)\n if larnum > mod and mod:\n print(-1)\n t = True\n break\n res = int(l[i + 1]) - nowi\n if res < 0:\n if res != -(mod - c):\n print(-1)\n t = True\n break\n if res > 0:\n if res != c:\n t = True\n print(-1)\n break\n if not t:\n if mod:\n print(mod, c, sep=' ')\n else:\n print(mod)\n\n\n# restoremod()\n\ndef restoremod1():\n for _ in range(int(input())):\n num = int(input())\n ...\n\n\ndef cells():\n for _ in range(int(input())):\n row, col, num = map(int, input().split())\n nr = ((num - 1) % row)\n nc = ((num - 1) // row) + 1\n print(nr * col + nc)\n\n\n# cells()\n\ndef replacement():\n for _ in range(int(input())):\n l, k = map(int, input().split())\n s = input()\n left, righ = s.find('*'), s.rfind('*')\n if righ - left <= k:\n print(2 if righ != left else 1)\n else:\n pos = left\n c = 2\n while righ - pos > k:\n pos = pos + k\n while pos < l and s[pos] != '*':\n pos -= 1\n c += 1\n print(c)\n\n\n# replacement()\n\nimport math\n\nimport sys\n\ninput = sys.stdin.readline\n\n\ndef string():\n for _ in range(int(input())):\n s = input().rstrip()\n s1 = input().rstrip()\n # if s == s1:\n # print(0)\n # continue\n maxl = 0\n p1 = [0, 0]\n p = [0, 0]\n for i in range(len(s)):\n for i1 in range(i + 1, len(s) + 1):\n pos = s1.find(s[i:i1])\n if pos == -1:\n break\n elif (i1 - i) <= maxl:\n continue\n elif (i1 - i) > maxl:\n maxl = i1 - i\n p1 = [pos, pos + maxl]\n p = [i, i + maxl]\n print(((p[0] + len(s) - p[1]) + (p1[0] + len(s1) - p1[1])) if maxl else len(s) + len(s1))\n\n\n# string()\n\nimport collections\n\n\ndef trans(l):\n pos = 0\n while pos < len(l) - 1:\n avg = l[pos] // (len(l) - pos - 1)\n rem = l[pos] % (len(l) - pos - 1)\n l[pos] = 0\n for i in range(pos + 1, len(l)):\n l[i] -= avg\n if l[i] < 0:\n rem += -l[i]\n l[i] = 0\n while pos + 1 < len(l) and l[pos + 1] <= rem:\n rem -= l.pop(pos + 1)\n if pos + 1 < len(l):\n l[pos + 1] -= rem\n else:\n l[0] = rem\n pos += 1\n return sum(l)\n\n\n# trans()\ndef trans1(l):\n pos = 0\n lenl = len(l)\n pos1 = pos + 1\n while pos1 < lenl and pos < lenl:\n while pos1 < lenl and l[pos] - l[pos1] >= 0:\n l[pos] -= l[pos1]\n l[pos1] = 0\n pos1 += 1\n if pos1 < lenl:\n l[pos1] -= l[pos]\n l[pos] = 0\n pos = pos1\n pos1 += 1\n return sum(l)\n\n\n# print(trans1([9,8,2,1,1,1]))\n\n\ndef main():\n for _ in range(int(input())):\n num = input()\n l = sorted(list(collections.Counter(input().split()).values()), reverse=True)\n ans = trans(l[:])\n if ans:\n print(min(ans, trans1(l)))\n else:\n print(0)\n\n\n# main()\n\n\ndef transrep():\n for _ in range(int(input())):\n num = int(input())\n l = list(collections.Counter(input().split()).values())\n ml = max(l)\n if ml > num - ml:\n print(ml - num + ml)\n else:\n print(num % 2)\n\n\n# transrep()\n\n\ndef resmod():\n def solve():\n posc = -1\n negc = 1\n num = int(input())\n l = input().split()\n ifz = False\n maxi = int(l[0])\n for i in range(num - 1):\n maxi = max(maxi, int(l[i + 1]))\n c = int(l[i + 1]) - int(l[i])\n if c == 0:\n if not i:\n ifz = True\n continue\n elif not ifz:\n return -1\n elif ifz:\n return -1\n elif c < 0:\n if negc == 1:\n negc = c\n else:\n if negc != c:\n return -1\n elif c > 0:\n if posc == -1:\n posc = c\n else:\n if posc != c:\n return -1\n if posc == -1 or negc == 1:\n return 0\n mod = posc + -negc\n if mod <= maxi:\n return -1\n return '{0} {1}'.format(mod, posc)\n\n for _ in range(int(input())):\n print(solve())\n\n\n# resmod()\n\n\ndef basicdep():\n def findmax(l):\n ans = 0\n res = 0\n for i, v in enumerate(l):\n if ans < v:\n res = i\n ans = v\n return [res + 1, ans] # pos,value\n\n def roundup(num):\n s = num / 2\n if s != int(s):\n return int(s) + 1\n return int(s)\n\n for _ in range(int(input())):\n days = []\n f, d = map(int, input().split())\n friends = [0] * f\n for i in range(d):\n nowfs = input().split()\n nowff = int(nowfs[1])\n friends[nowff - 1] += 1\n if int(nowfs[0]) > 1:\n days.append([nowff, int(nowfs[2])])\n else:\n days.append([nowff, []])\n maxl = findmax(friends)\n goal = roundup(d)\n if maxl[1] < goal:\n print('YES')\n print(*[i[0] for i in days], sep=' ')\n else:\n pos = 0\n while pos < d and maxl[1] > goal:\n if days[pos][0] == maxl[0] and days[pos][1]:\n days[pos][0] = days[pos][1]\n maxl[1] -= 1\n pos += 1\n if maxl[1] > goal:\n print('NO')\n else:\n print('YES')\n print(*[i[0] for i in days], sep=' ')\n\n\n# basicdep()\n\n\ndef playlist():\n def nextsong(pos):\n while pos + 1 in ans and len(ans) != num:\n pos += 1\n if pos == num:\n pos = 0\n return pos\n\n def gcf(n, n1):\n if not n:\n return n1\n return gcf(n1, n % n1) if n1 else n\n\n for _ in range(int(input())):\n num = int(input())\n l = input().split()\n deletel = collections.deque()\n for i in range(num - 1):\n a, b = int(l[i]), int(l[i + 1])\n if gcf(a, b) == 1:\n deletel.append((i, i + 1))\n if gcf(int(l[-1]), int(l[0])) == 1:\n deletel.append((num - 1, 0))\n ans = dict()\n while deletel and len(ans) != num:\n a, b = deletel.popleft()\n if a + 1 in ans or b + 1 in ans:\n continue\n ans[b + 1] = True\n if deletel:\n if deletel[0][0] == b:\n deletel.popleft()\n if b == num - 1:\n n = nextsong(0)\n if gcf(int(l[a]), int(l[n])) == 1:\n deletel.append((a, n))\n else:\n n = nextsong(b + 1)\n if gcf(int(l[a]), int(l[n])) == 1:\n deletel.append((a, n))\n print(len(ans), *ans.keys(), sep=' ')\n\n\n# playlist()\n\ndef shoesandst():\n students, laces, = map(int, input().split())\n d = collections.defaultdict(list)\n rems = set()\n for _ in range(laces):\n a, b = map(int, input().split())\n d[a].append(b)\n d[b].append(a)\n lisa = d[a]\n lisb = d[b]\n la = len(lisa)\n lb = len(lisb)\n if la == 2:\n rems.discard((a, lisa[0]))\n elif la == 1:\n rems.add((a, b))\n if lb == 2:\n rems.discard((b, lisb[0]))\n elif lb == 1:\n rems.add((b, a))\n c = 0\n nextans = set()\n while rems or nextans:\n nextans.clear()\n while rems:\n a, b = rems.pop()\n nextans.discard((a,b))\n nextans.discard((b,a))\n d[a].pop() # may not needed\n d[b].remove(a)\n lb = len(d[b])\n if not lb:\n rems.discard((b,a))\n if lb == 1:\n nextans.add((b,d[b][0]))\n rems = nextans.copy()\n c += 1\n return c\nprint(shoesandst())\n\n", "n,s=map(int,input().split())\nG={}\nfor i in range(n):G[i+1]=set()\nfor i in range(s):\n a,b=map(int,input().split())\n G[a].add(b)\n G[b].add(a)\nc=-1\nf=True\nwhile f:\n a=set()\n f=False\n for x in G:\n if len(G[x])==1:\n a.add(x)\n f=True\n for x in a:\n for k in G[x]:\n G[k].discard(x)\n G[x]=set()\n c+=1\nprint(c)", "from collections import defaultdict\r\n\r\nn,m = list(map(int,input().split()))\r\ngraph = defaultdict(list)\r\nfor i in range(m):\r\n u,v = list(map(int,input().split()))\r\n graph[u].append(v)\r\n graph[v].append(u)\r\ncnt = 0\r\nfor i in graph:\r\n temp = graph[i]\r\n temp.sort()\r\n graph[i] = temp\r\n\r\nwhile True:\r\n rem = []\r\n for i in graph:\r\n # print(graph[i],len(graph[i]))\r\n if len(graph[i])==1:\r\n rem.append(i)\r\n prev = defaultdict(list)\r\n for i in graph:\r\n if i not in rem:\r\n temp = list(set(graph[i]).difference(rem))\r\n temp.sort()\r\n prev[i] = temp\r\n if graph==prev:\r\n break\r\n graph = prev\r\n cnt+=1\r\nprint(cnt)", "n_nodes, n_edgs = map(int, input().split())\n\nlist_adj = [[] for _ in range(n_nodes)]\n\nfor _ in range(n_edgs):\n a, b = map(int, input().split())\n list_adj[a-1].append(b-1)\n list_adj[b-1].append(a-1)\n\ncont = 0\nwhile True:\n kicks = [(idx, val[0]) for idx, val in enumerate(list_adj) if len(val) == 1]\n if len(kicks) == 0: break\n\n for kickado, chateado in kicks:\n if list_adj[chateado] != []: list_adj[chateado].remove(kickado)\n list_adj[kickado] = []\n cont += 1\n\nprint(cont)\n\t\t \t \t\t\t \t \t\t \t \t \t\t \t\t\t\t \t", "def prov():\r\n global d\r\n x=0\r\n sp=[]\r\n for i in d:\r\n if len(d[i])==1:\r\n sp.append([i, d[i][0]])\r\n d[i]=[]\r\n x=1\r\n for i in sp:\r\n if i[0] in d[i[1]]:\r\n del d[i[1]][d[i[1]].index(i[0])]\r\n return x\r\n\r\nn, m =map(int, input().split())\r\nd={}\r\nfor i in range(1, n+1):\r\n d[i]=[]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n d[a].append(b)\r\n d[b].append(a)\r\ncount=0\r\nwhile prov()!=0:\r\n count+=1\r\nprint(count)\r\n", "\r\nn, m = map(int, input().split())\r\nedgeList = {}\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if a not in edgeList:\r\n edgeList[a] = []\r\n edgeList[a].append(b)\r\n if b not in edgeList:\r\n edgeList[b] = []\r\n edgeList[b].append(a)\r\nbfsQueue = []\r\nfor elem in edgeList:\r\n if len(edgeList[elem]) == 1:\r\n bfsQueue.append(elem)\r\nnumBFSIterations = 0\r\nwhile len(bfsQueue) > 0:\r\n\r\n numBFSIterations += 1\r\n newBFSQueue = []\r\n for elem in bfsQueue:\r\n for neighbor in edgeList[elem]:\r\n edgeList[neighbor].remove(elem)\r\n edgeList[elem].remove(neighbor)\r\n if len(edgeList[neighbor]) == 1:\r\n newBFSQueue.append(neighbor)\r\n\r\n for elem in edgeList:\r\n if len(edgeList[elem]) == 0 and newBFSQueue.count(elem) > 0:\r\n newBFSQueue.remove(elem)\r\n\r\n bfsQueue = newBFSQueue\r\n\r\nprint(numBFSIterations)\r\n\r\n\r\n", "import sys\n\nn, m = list(map(int, sys.stdin.readline().split()))\nans = 0\nadj = [set() for i in range(n+1)]\n\nfor _ in range(m):\n a, b = list(map(int, sys.stdin.readline().split()))\n adj[a].add(b)\n adj[b].add(a)\n\nwhile True:\n degOne = [idx for idx, val in enumerate(adj) if len(val) == 1]\n if len(degOne) == 0:\n break\n\n ans += 1\n for node in degOne:\n ngbs = adj[node]\n adj[node] = set()\n for ngb in ngbs:\n adj[ngb].remove(node)\n\nprint(ans)\n", "import copy\r\n\r\nn, m = [int(i) for i in input().split()]\r\nties = {i:[] for i in range(1, n+1)}\r\n\r\nfor _ in range(m):\r\n s1, s2 = map(int, input().split())\r\n ties[s1].append(s2)\r\n ties[s2].append(s1)\r\n\r\nres = 0\r\nwhile True:\r\n expelled = False\r\n tmp_ties = copy.deepcopy(ties)\r\n for k, v in ties.items():\r\n if len(v) == 1:\r\n expelled = True\r\n if v[0] in tmp_ties:\r\n tmp_ties[v[0]].remove(k)\r\n del tmp_ties[k]\r\n if expelled:\r\n res += 1\r\n ties = copy.deepcopy(tmp_ties)\r\n else:\r\n break\r\n\r\nprint(res)\r\n", "n,k = map(int,input().split())\r\narr = [set() for i in range(n+1)]\r\nfor i in range(0,k):\r\n a,b = map(int,input().split())\r\n arr[a].add(b)\r\n arr[b].add(a)\r\n\r\nans = 0\r\nwhile(True):\r\n x = set()\r\n for i in range(1,n+1):\r\n if(len(arr[i])==1):\r\n x.add(i)\r\n arr[i] = set()\r\n if(len(x)==0):\r\n break\r\n ans+=1\r\n for i in range(1,n+1):\r\n arr[i]-=x\r\nprint(ans)\r\n", "def calculate(n, arr):\n g = {}\n for num1,num2 in arr:\n if num1 not in g:\n g[num1] = set()\n g[num1].add(num2)\n if num2 not in g:\n g[num2] = set()\n g[num2].add(num1)\n\n data = []\n for num in g:\n if len(g[num]) == 1:\n data.append(num)\n\n count = 0\n while data:\n for src in data:\n if len(g[src]):\n dst = g[src].pop()\n g[dst].remove(src)\n g.pop(src)\n \n data = []\n for num in g:\n if len(g[num]) == 1:\n data.append(num)\n count += 1\n print(count)\n\ns = input()\nn,m = list(map(int, s.strip().split(\" \")))\narr = []\nfor i in range(m):\n s = input()\n num1,num2 = list(map(int, s.strip().split(\" \")))\n arr.append([num1,num2])\n\ncalculate(n, arr)\n\t \t \t \t\t \t\t\t\t \t\t \t \t \t\t\t", "from collections import defaultdict\r\n\r\nI = lambda: map(int, input().split())\r\n\r\n_, m = I()\r\nG = defaultdict(set)\r\n\r\nfor _ in range(m):\r\n u, v = I()\r\n G[u].add(v)\r\n G[v].add(u)\r\n\r\ngroups = 0\r\n\r\nwhile True:\r\n onelacers = {u for u in G if len(G[u]) == 1}\r\n if not onelacers:\r\n break\r\n groups += 1\r\n for u in onelacers:\r\n if G[u]:\r\n G[G[u].pop()].remove(u)\r\n\r\nprint(groups)", "#n=int(input())\n#n,m=map(int,input().split())\n#se=set([*input().split()][1:])\n#l=list(map(int,input().split()))\n#input=sys.stdin.readline\n\n# import sys\n# sys.stdin=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/input.txt\",\"r\")\n# sys.stdout=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/output.txt\",\"w\")\n\n\n# import sys\n# import math\n\n\nfor _ in range(1):\n n,m=map(int,input().split())\n\n from collections import defaultdict\n graph = defaultdict(set)\n\n for i in range(n):\n graph[i+1]=set()\n \n for i in range(m):\n a,b=map(int,input().split())\n graph[a].add(b)\n graph[b].add(a)\n\n rm=set()\n res=0\n while True:\n att=set()\n for i in graph:\n if len(graph[i])-len(graph[i].intersection(rm))==1:\n att.add(i)\n \n if len(att)==0:\n break\n res+=1\n for i in att:\n rm.add(i)\n graph.pop(i)\n \n\n print(res)\n\n", "\r\ndef make_graph(a, v):\r\n\tgraph = [[False for _ in range(v)] for _ in range(v)]\r\n\tfor f, s in a:\r\n\t\tgraph[f][s] = True\r\n\t\tgraph[s][f] = True\r\n\r\n\treturn graph\r\n\r\ndef solve(v, a):\r\n\tg = make_graph(a, v)\r\n\tleft = [True for _ in range(v)]\r\n\tgroup_count = 0\r\n\r\n\twhile True:\r\n\t\tkick = []\r\n\t\tfor u in range(v):\r\n\t\t\tif left[u] and g[u].count(True) == 1:\r\n\t\t\t\tkick.append(u)\r\n\r\n\t\tif kick:\r\n\t\t\tgroup_count += 1\r\n\t\t\tfor u in kick:\r\n\t\t\t\tleft[u] = False\r\n\t\t\t\tfor k in range(v):\r\n\t\t\t\t\tg[u][k] = False\r\n\t\t\t\t\tg[k][u] = False\r\n\t\telse:\r\n\t\t\tbreak\r\n\r\n\treturn group_count\r\n\r\n\r\nv, m = map(int, input().split())\r\na = [map(lambda x: int(x) - 1, input().split()) for _ in range(m)]\r\nprint(solve(v, a))", "from sys import stdin,stdout\r\nii1 = lambda: int(stdin.readline().strip())\r\nis1 = lambda: stdin.readline().strip()\r\niia = lambda: list(map(int, stdin.readline().strip().split()))\r\nisa = lambda: stdin.readline().strip().split()\r\nmod = 1000000007\r\n\r\nn, m = iia()\r\nd = {}\r\nfor _ in range(m):\r\n a,b = iia()\r\n d.setdefault(a, set()).add(b)\r\n d.setdefault(b, set()).add(a)\r\ncount = 0\r\nwhile True:\r\n temp = set()\r\n for i in d:\r\n if len(d[i]) == 1:\r\n temp.add(i)\r\n d[i] = set()\r\n if not len(temp):\r\n print(count)\r\n break\r\n count += 1\r\n for i in d:\r\n d[i] -= temp\r\n\r\n\r\n", "n,m=map(int,input().split())\r\nadj=dict()\r\nfor i in range(m):\r\n x,y=map(int,input().split())\r\n if str(x) in adj:\r\n adj[str(x)].append(y)\r\n else:\r\n adj[str(x)]=[y]\r\n if str(y) in adj:\r\n adj[str(y)].append(x)\r\n else:\r\n adj[str(y)]=[x]\r\ncou=0\r\nfor cou in range(n):\r\n flag=0 \r\n delete=list()\r\n for i in list(adj):\r\n if(len(adj[i])==1):\r\n delete.append(i)\r\n flag=1\r\n for i in delete:\r\n for j in adj[i]:\r\n adj[str(j)].remove(int(i))\r\n del adj[i]\r\n if(flag!=1):\r\n break\r\nprint(cou)", "from collections import deque\nn,m=map(int,input().split())\nadj=[set() for _ in range(n)]\nfor _ in range(m):\n x,y=map(int,input().split())\n adj[x-1].add(y-1)\n adj[y-1].add(x-1)\nq=deque()\nfor i in range(n):\n if len(adj[i])==1:\n q.append((i,1))\nans=0\nflag=[1 for i in range(n)]\nwhile len(q):\n if len(adj[q[0][0]]):\n neigh=max(adj[q[0][0]])\n ans=max(q[0][1],ans)\n adj[neigh].discard(q[0][0])\n if len(adj[neigh])==1 and flag[neigh]:\n flag[neigh]=0\n q.append((neigh,q[0][1]+1))\n q.popleft()\nprint(ans)\n", "inputs = input().split()\r\nn = int(inputs[0])\r\nm = int(inputs[1])\r\ndel inputs\r\n\r\nL = [[] for i in range(n)]\r\nfor i in range(m):\r\n L0 = input().split()\r\n L[int(L0[0]) - 1].append(int(L0[1]) - 1)\r\n L[int(L0[1]) - 1].append(int(L0[0]) - 1)\r\n\r\ngroups = []\r\nnbGroups = 0\r\nwhile (True):\r\n grpLen = len(groups)\r\n for i in range(n):\r\n if len(L[i]) == 1 and i not in groups:\r\n groups.append(i)\r\n for j in range(grpLen,len(groups)):\r\n if len(L[groups[j]])>=1:\r\n L[L[groups[j]][0]].remove(groups[j]) # L[1].remove(0)\r\n if grpLen != len(groups): # it means we added new elements\r\n nbGroups += 1\r\n else:\r\n break\r\n\r\nprint(nbGroups)\r\n", "class Node:\n def __init__(self, id):\n self.id = id\n self.neighbors = set()\n\n def add_neighbor(self, v):\n self.neighbors.add(v)\n\n def degree(self):\n return len(self.neighbors)\n\nn, m = map(int, input().split())\nnodes = [ Node(u) for u in range(n) ]\nfor i in range(m):\n u, v = map(lambda s: int(s) - 1, input().split())\n nodes[u].add_neighbor(v)\n nodes[v].add_neighbor(u)\n\nleaves = [ node for node in nodes if node.degree() == 1 ]\nresult = 0\nwhile len(leaves) != 0:\n found = False\n new_leaves = []\n for leaf in leaves:\n if leaf.degree() == 0:\n continue\n found = True\n parent = nodes[leaf.neighbors.pop()]\n parent.neighbors.remove(leaf.id)\n leaf.neighbors = []\n if parent.degree() == 1:\n new_leaves.append(parent)\n if found:\n result += 1\n leaves = new_leaves\nprint(result)\n", "n, m = map(int, input().split())\ndegree = [0] * (n+1)\ngraph = [[] for _ in range(n+1)]\n\nfor _ in range(m):\n a, b = map(int, input().split())\n degree[a] += 1\n degree[b] += 1\n graph[a].append(b)\n graph[b].append(a)\n\nchange, result = True, 0\n\nwhile change:\n\n change, group = False, []\n\n for i in range(1, n+1):\n if degree[i] == 1:\n group.append(i)\n degree[i] = 0\n change = True\n\n result += change\n\n for node in group:\n for adj in graph[node]:\n degree[adj] -= 1\n\nprint(result)", "from collections import defaultdict\n\ndct = defaultdict(set)\n\nn, m = [int(x) for x in input().split()]\n\nfor _ in range(m):\n u, v = [int(x) for x in input().split()]\n dct[u].add(v)\n dct[v].add(u)\n\nres = 0\n\nwhile True:\n to_del = []\n for node, nei in dct.items():\n if len(nei) == 1:\n to_del.append(node)\n \n if not to_del:\n break\n\n res += 1\n\n # remove all the edges that contain nodes in `to_del`\n for u in to_del:\n\n for n in dct[u]:\n dct[n].discard(u)\n\n dct.pop(u)\n\nprint(res)\n", "import math\r\nimport sys\r\n\r\n#imgur.com/Pkt7iIf.png\r\n\r\n#n, m = map(int, input().split())\r\n#n = int(input())\r\n#d = list(map(int, input().split()))\r\n\r\nn, m = map(int, input().split())\r\ng = {i:set() for i in range(n)}\r\ndeg = [0]*n\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n g[a-1].add(b-1)\r\n g[b-1].add(a-1)\r\n deg[a-1] += 1\r\n deg[b-1] += 1\r\n\r\nres = 0\r\nfor i in range(n):\r\n f = False\r\n used = [0]*n\r\n for j in range(n):\r\n if deg[j] == 1 and used[j] == 0:\r\n f = True\r\n t = g[j].pop()\r\n g[t].remove(j)\r\n deg[t] -= 1\r\n deg[j] -= 1\r\n used[t] = 1\r\n if f:\r\n res += 1\r\n else:\r\n break\r\n\r\nprint(res)", "n, m = map(int, input().split())\r\ngraph = {}\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n a -= 1\r\n b -= 1\r\n if a not in graph:\r\n graph[a] = set()\r\n graph[a].add(b)\r\n if b not in graph:\r\n graph[b] = set()\r\n graph[b].add(a)\r\n\r\nflag = True\r\ncnt = 0\r\nwhile flag:\r\n temp = set()\r\n flag = False\r\n for s in graph.keys():\r\n if len(graph[s]) == 1:\r\n temp.add(s)\r\n if temp:\r\n cnt += 1\r\n flag = True\r\n for x in temp:\r\n graph.pop(x)\r\n for s in graph.keys():\r\n if x in graph[s]:\r\n graph[s].remove(x)\r\n\r\nprint(cnt)", "def GetAns(l):\r\n ans=0\r\n while len(l)!=len(dels(l)):\r\n ans+=1\r\n return ans\r\ndef dels(a):\r\n students=[0]*(n+1)\r\n for i in range(len(a)):\r\n students[a[i]]+=1\r\n for i in range(len(a)):\r\n if students[a[i]]==1:\r\n if i%2==0:\r\n a[i]=-1\r\n a[i+1]=-1\r\n else:\r\n a[i]=-1\r\n a[i-1]=-1\r\n while -1 in a:\r\n a.remove(-1)\r\n return a\r\n\r\nn,sl=map(int,input().split())\r\na=[]\r\nfor i in range(sl):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n a.append(y)\r\nprint(GetAns(a))", "n, m = map(int, input().split())\r\nlaces = []\r\n\r\nfor i in range(m):\r\n laces.append(list(map(int, input().split())))\r\n\r\ncounts = [0 for i in range(n+1)]\r\nfor l in laces:\r\n counts[l[0]] += 1\r\n counts[l[1]] += 1\r\n\r\nkicked = True\r\nkick_count = 0\r\nwhile kicked:\r\n kicked = False\r\n\r\n kick = set()\r\n for i in range(n+1):\r\n if counts[i] == 1:\r\n kick.add(i)\r\n\r\n if len(kick) > 0:\r\n kicked = True\r\n kick_count += 1\r\n \r\n for l in laces:\r\n if l[0] in kick or l[1] in kick:\r\n counts[l[1]] -= 1\r\n counts[l[0]] -= 1\r\n\r\nprint(kick_count)\r\n", "\ndef solve() :\n c=0\n while True:\n x=[]\n for i in d :\n if len(d[i])==1 :\n x.append(i)\n if len(x)==0 :\n break\n for i in x :\n for j in d[i] :\n d[j].remove(i)\n d.pop(i)\n c+=1\n\n return c\n\n\n\n\n\n\nfrom sys import stdin\ninput = stdin.readline\n\n\n\nk,n= [int(x) for x in input().split()]\nd={}\nfor i in range(1,k+1):\n d[i]=set()\n\nfor i in range(n):\n x,y=[int(x) for x in input().split()]\n d[x].add(y)\n d[y].add(x)\nprint(solve())\n\n\n\n'''\n\nt=int(input())\nfor i in range(t) :\n print(solve())\n\nn=int(input())\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'''", "n,m=map(int,input().split())\ns=[set() for i in range(n+1)]\nfor i in range(m):\n a,b=map(int,input().split())\n s[a].add(b)\n s[b].add(a)\nans=0\nwhile(True):\n x=set()\n for i in range(1,n+1):\n if len(s[i])==1:\n x.add(i)\n s[i]=set()\n if len(x)==0:\n break\n ans+=1\n for i in range(1,n+1):\n s[i]-=x\nprint(ans)\n", "n, m = list(map(int, input().split()))\r\ncounts = [0 for i in range(101)]\r\narr1 = []\r\narr2 = []\r\nfor _ in range(m):\r\n x, y = list(map(int, input().split()))\r\n counts[x] += 1\r\n counts[y] += 1\r\n arr1.append(x)\r\n arr2.append(y)\r\nprevious = len(arr1)\r\nans = 0\r\nflip = 0\r\ntemp = []\r\nfor i in range(101):\r\n if counts[i] == 1:\r\n temp.append(i)\r\nfor i in temp:\r\n flip = 1\r\n try:\r\n if i in arr1:\r\n index = arr1.index(i)\r\n x = arr1.pop(index)\r\n y = arr2.pop(index)\r\n counts[x] -= 1\r\n counts[y] -= 1\r\n else:\r\n index = arr2.index(i)\r\n x = arr1.pop(index)\r\n y = arr2.pop(index)\r\n counts[x] -= 1\r\n counts[y] -= 1\r\n except:\r\n pass\r\nif flip:\r\n ans += 1\r\ncurrent = len(arr1)\r\n# print(ans, arr1, arr2, counts)\r\nwhile previous != current:\r\n previous = current\r\n flip = 0\r\n temp = []\r\n for i in range(101):\r\n if counts[i] == 1:\r\n temp.append(i)\r\n for i in temp:\r\n flip = 1\r\n try:\r\n if i in arr1:\r\n index = arr1.index(i)\r\n x = arr1.pop(index)\r\n y = arr2.pop(index)\r\n counts[x] -= 1\r\n counts[y] -= 1\r\n else:\r\n index = arr2.index(i)\r\n x = arr1.pop(index)\r\n y = arr2.pop(index)\r\n counts[x] -= 1\r\n counts[y] -= 1\r\n except:\r\n pass\r\n if flip:\r\n ans += 1\r\n current = len(arr1)\r\nprint(ans)", "n, m = [int(i) for i in input().split()]\r\ntruth_table = [[0]*n for i in range(n)]\r\n\r\nfor i in range(m):\r\n a, b = [int(j)-1 for j in input().split()]\r\n truth_table[a][b] = 1\r\n truth_table[b][a] = 1\r\n\r\nfound = True\r\nc = 0\r\n\r\nwhile found:\r\n found = False\r\n truth_table_copy = [i.copy() for i in truth_table]\r\n for i in range(len(truth_table_copy)):\r\n if sum(truth_table_copy[i]) == 1:\r\n for j in range(len(truth_table_copy[i])):\r\n if truth_table_copy[i][j] == 1:\r\n truth_table[i][j] = 0\r\n truth_table[j][i] = 0\r\n found = True\r\n c += int(found)\r\n\r\nprint(c)\r\n", "n, m = map(int,input().split())\r\n\r\n\r\nstudents_ties_count = {}\r\n\r\nfor i in range(0, n+1):\r\n students_ties_count[i] = 0 \r\n \r\n \r\nour_input = []\r\n\r\nfor i in range(m):\r\n x = tuple(map(int,input().split()))\r\n our_input.append(x)\r\n \r\nres = 0 \r\n\r\nfor i in range(m):\r\n indi = 0\r\n for i in our_input:\r\n for j in i:\r\n students_ties_count[j]+=1\r\n \r\n # print(students_ties_count)\r\n \r\n temp_copy = students_ties_count.copy()\r\n \r\n for key in temp_copy.keys():\r\n if (students_ties_count[key] == 1):\r\n indi = 1\r\n del students_ties_count[key]\r\n for i in our_input:\r\n for j in i:\r\n if (j == key):\r\n our_input.remove(i)\r\n \r\n if (indi == 0):\r\n print(res)\r\n exit()\r\n \r\n for i in students_ties_count.keys():\r\n students_ties_count[i] = 0\r\n \r\n res+=1\r\nprint(res)", "n, m = list(map(int, input().split()))\r\nmatr = [ [] for i in range(n)]\r\nfor i in range(m):\r\n a, b= list(map(int, input().split()))\r\n matr[a-1].append(b-1)\r\n matr[b-1].append(a-1)\r\nans = 0\r\nwhile True:\r\n toex= True\r\n bomj = []\r\n for i in range(n):\r\n if len(matr[i]) == 1:\r\n toex = False\r\n if (matr[i][0], i) not in bomj:\r\n bomj.append((i, matr[i][0]))\r\n for i in bomj:\r\n a = i[0]\r\n b = i[1]\r\n matr[b].pop(matr[b].index(a))\r\n matr[a].pop(matr[a].index(b))\r\n \r\n if toex:\r\n break\r\n else:\r\n ans += 1\r\n\r\nprint(ans)\r\n\r\n", "from sys import stdin\r\n\r\ndef estu_list(n):\r\n lista_estudiantes = []\r\n for cont in range(n):\r\n lista_estudiantes.append(cont+1)\r\n return lista_estudiantes\r\n\r\ndef get_data(n,m,ties):\r\n lista_estudiantes = estu_list(n)\r\n bandera = 0\r\n cont_groups = 0\r\n while(bandera == 0):\r\n bandera_cambio = 0\r\n numeros_a_borrar = []\r\n for l in lista_estudiantes:\r\n cont_union = 0\r\n conecciones = []\r\n for pos in range(len(ties)):\r\n if l in ties[pos]:\r\n cont_union = cont_union + 1\r\n conecciones.append(ties[pos])\r\n if cont_union == 1:\r\n numeros_a_borrar.append(conecciones)\r\n bandera_cambio = -1\r\n if bandera_cambio == 0:\r\n bandera = -1\r\n else:\r\n for n in numeros_a_borrar:\r\n if n[0] in ties:\r\n ties.remove(n[0])\r\n cont_groups = cont_groups + 1\r\n return cont_groups\r\n \r\ndef main():\r\n ties = []\r\n [n,m] = [int(x) for x in stdin.readline().split()]\r\n for cont in range(m):\r\n ties.append([int(x) for x in stdin.readline().split()])\r\n print(get_data(n,m,ties))\r\n\r\nmain()", "def main():\n line = input().split()\n n = int(line[0])\n m = int(line[1])\n\n d = {}\n for i in range(m):\n line = input().split()\n a = int(line[0])\n b = int(line[1])\n for _ in range(2):\n if a in d.keys():\n d[a].add(b)\n else:\n d[a] = {b}\n a, b = b, a\n\n groups = 0\n playing = True\n while playing:\n playing = False\n booted = []\n for k, v in d.items():\n if len(v) == 1:\n playing = True\n tippy = list(v)[0]\n booted.append((tippy, k))\n v.remove(tippy)\n for k, v in booted:\n if v in d[k]:\n d[k].remove(v)\n if playing:\n groups += 1\n\n print(groups)\n\n\nif __name__ == \"__main__\":\n main()\n\t \t \t\t\t\t\t\t \t \t\t\t \t\t \t \t", "n, m = map(int, input().split())\r\ndic = {}\r\nfor _ in range(m):\r\n s1, s2 = map(int, input().split())\r\n if s1 not in dic:\r\n dic[s1] = []\r\n if s2 not in dic:\r\n dic[s2] = []\r\n dic[s1].append(s2)\r\n dic[s2].append(s1)\r\ni = 0\r\nwhile True:\r\n remo = []\r\n for k, v in dic.items():\r\n if len(v) == 1:\r\n remo.append(k)\r\n for s in remo:\r\n for k in dic[s]:\r\n dic[k].remove(s)\r\n dic.pop(s)\r\n if remo:\r\n i += 1\r\n else:\r\n break\r\nprint(i)\r\n", "n,m=list(map(int,input().split()))\r\na=[[0 for i in range(n)] for i in range(n)]\r\nb=[0]*n\r\nfor i in range(m):\r\n u,v=list(map(int,input().split()))\r\n a[u-1][v-1]=1\r\n a[v-1][u-1]=1\r\n b[u-1]+=1\r\n b[v-1]+=1\r\nc=-1\r\nd1=1\r\nwhile d1>0:\r\n d=[]\r\n d1=0\r\n for i in range(n):\r\n if b[i]==1:\r\n d.append(i)\r\n d1+=1\r\n c+=1\r\n for j in d:\r\n for k in range(n):\r\n if a[k][j]:\r\n a[k][j]=0\r\n a[j][k]=0\r\n b[k]-=1\r\n b[j]-=1\r\nprint(c)", "n,m = map(int, input().split())\r\narr = []\r\nfor i in range(m):\r\n\tarr.append(list(map(int, input().split())))\r\ns = set()\r\nans = 0\r\nwhile True:\r\n\tcount = [0]*(n)\r\n\tfor a,b in arr:\r\n\t\tif a not in s and b not in s:\r\n\t\t\tcount[a-1] += 1\r\n\t\t\tcount[b-1] += 1\r\n\tflag = False\r\n\tfor i in range(n):\r\n\t\tif count[i] == 1:\r\n\t\t\tflag = True\r\n\t\t\ts.add(i+1)\r\n\tif flag is False:\r\n\t\tprint(ans)\r\n\t\texit()\r\n\tans += 1", "n, m = list(map(int, input().split()))\r\nadj = [[] for _ in range(n + 1)]\r\nfor _ in range(m):\r\n a, b = list(map(int, input().split()))\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n\r\nre = 0\r\nremoved = [False] * (n + 1)\r\nwhile True:\r\n reprimanded = []\r\n for i in range(1, n + 1):\r\n if len(adj[i]) == 1 and not removed[i]:\r\n reprimanded.append(i)\r\n removed[i] = True\r\n if len(reprimanded) == 0:\r\n break\r\n else:\r\n re += 1\r\n for i in range(1, n + 1):\r\n for j in reprimanded:\r\n if j in adj[i]:\r\n adj[i].remove(j)\r\n\r\nprint(re)", "# fin = open('input.txt')\n\n# def input():\n# \treturn fin.readline().strip()\n\nn, m = tuple(map(int, input().split(' ')))\n\ngraph = {}\n\nfor _ in range(m):\n\ta, b = tuple(map(int, input().split(' ')))\n\n\tif a not in graph:\n\t\tgraph[a] = set()\n\n\tif b not in graph:\n\t\tgraph[b] = set()\n\n\tgraph[a].add(b)\n\tgraph[b].add(a)\n\n\ngroups = 0\n\nwhile True:\n\n\tto_remove = set()\n\n\tfor node in graph:\n\t\tif len(graph[node]) == 1:\n\t\t\tto_remove.add(node)\n\t\t\tgraph[node] = set()\n\n\tfor node in graph:\n\t\tit = iter(graph[node].copy())\n\t\tcurr = next(it, None)\n\t\twhile curr:\n\t\t\tif curr in to_remove:\n\t\t\t\tgraph[node].remove(curr)\n\t\t\tcurr = next(it, None)\n\n\tif len(to_remove) > 0:\n\t\tgroups += 1\n\n\telse:\n\t\tbreak\n\nprint(groups)\n\n\n\n\n\n\n\n\n\n\n", "n, m = [int(_) for _ in input().split()]\nsp = [ [] for _ in range(n)]\nfor i in range(m):\n a, b = [int(_)-1 for _ in input().split()]\n sp[a].append(b)\n sp[b].append(a)\n\nres = 0\nwhile 1:\n vyg = []\n for i in range(n):\n if len(sp[i]) == 1:\n vyg.append(i)\n if vyg:\n for x in vyg:\n if sp[x]:\n sosed = sp[x][0]\n sp[sosed].remove(x)\n sp[x] = []\n res += 1\n else:\n break\nprint(res)\n\n ", "num,tie=list(map(int,input().split()));dic={};c=0\r\nfor i in range(tie):\r\n x,z=list(map(int,input().split()))\r\n if x in dic:\r\n dic[x]+=[z]\r\n else:\r\n dic[x]=[z]\r\n if z in dic:\r\n dic[z]+=[x]\r\n else:\r\n dic[z]=[x]\r\n \r\ndef find():\r\n arr=[]\r\n tt=False\r\n for i in dic:\r\n if len(dic[i])==1:\r\n tt=True\r\n arr.append(i)\r\n dic[i]=[]\r\n \r\n if tt:\r\n for i in dic:\r\n for j in arr:\r\n if j in dic[i]:\r\n dic[i].remove(j)\r\n global c\r\n c+=1\r\n return find()\r\n return c\r\n \r\nprint(find())", "n, m = map(int, input().split())\r\ngr = [[0 for _ in range(n)] for _ in range(n)]\r\ncnt = [0 for _ in range(n)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n cnt[a - 1] += 1\r\n cnt[b - 1] += 1\r\n gr[a - 1][b - 1] = 1\r\n gr[b - 1][a - 1] = 1\r\n\r\nans = 0\r\nwhile 1 in cnt:\r\n used = [0 for _ in range(n)]\r\n for i in range(n):\r\n if cnt[i] == 1 and used[i] == 0:\r\n used[i] = 1\r\n for j in range(n):\r\n if gr[i][j] == 1:\r\n cnt[i] -= 1\r\n cnt[j] -= 1\r\n gr[i][j] = 0\r\n gr[j][i] = 0\r\n used[j] = 1\r\n ans += 1\r\nprint(ans)", "n,m=map(int,input().split())\r\nd=[]\r\nfor i in range(n+1):\r\n d.append([0]*(n+1))\r\n\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n d[a][b]=1\r\n d[b][a]=1\r\nc=0\r\n\r\nfor i in range(1,n+1):\r\n boo=True\r\n x=[]\r\n \r\n for j in range(1,n+1):\r\n \r\n \r\n if d[j].count(1)==1:\r\n p=d[j].index(1)\r\n d[j][p]=0\r\n x.append([p,j])\r\n boo=False\r\n \r\n for m in x:\r\n d[m[0]][m[1]]=0\r\n x=[]\r\n if boo:\r\n break\r\n else:\r\n c+=1\r\n\r\nprint(c)\r\n \r\n ", "number = list(map(int , input().split()))\r\ndate = {\r\n\r\n}\r\none_link = {}\r\ncounter = 0\r\nfor i in range(0 , number[1]):\r\n x = list(map(int , input().split()))\r\n for j in range(0 , len(x)):\r\n if not f\"{x[j]}\" in date.keys() :\r\n date[f'{x[j]}'] = {\r\n 'counter': 1,\r\n \"links\": {}\r\n }\r\n\r\n else:\r\n date[f'{x[j]}']['counter'] +=1\r\n if date[f'{x[j]}']['counter'] == 1 :\r\n one_link[f'{x[j]}'] = 'item'\r\n elif date[f'{x[j]}']['counter'] == 2 :\r\n one_link.pop(f'{x[j]}')\r\n date[f'{x[j]}']['links'][f\"{x[(j+1)%2]}\"] = 'linked'\r\nwhile len(one_link) != 0 :\r\n copy = dict(one_link)\r\n one_link = {}\r\n for i in copy.keys():\r\n if len(date[f'{i}']['links']) == 0 :\r\n continue\r\n x = [j for j in date[f'{i}']['links']][0]\r\n date[f'{x}']['counter'] -= 1\r\n date[f'{x}']['links'].pop(f'{i}')\r\n if date[f'{x}']['counter'] == 1 :\r\n one_link[f'{x}'] = 'item'\r\n else :\r\n if f'{x}' in one_link.keys() :\r\n one_link.pop(f'{x}')\r\n counter += 1\r\nprint(counter)", "n,m=map(int,input().split())\r\nx=[[0 for i in range(n)] for j in range(n)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n x[a-1][b-1]=1\r\n x[b-1][a-1]=1\r\nans=0\r\nwhile 1:\r\n c=[i for i in range(n) if sum(x[i])==1]\r\n if len(c)==0:\r\n break\r\n for i in range(n):\r\n for j in c:\r\n x[i][j],x[j][i]=0,0\r\n ans+=1\r\nprint(ans)", "#Student and Shoelaces\r\n#brute force, dfs ans similar, graphs, implementation\r\n\r\nfrom collections import defaultdict\r\nDict = defaultdict(list)\r\nn,m = map(int, input().split())\r\nfor _ in range(m):\r\n a,b = map(int,input().split())\r\n Dict[a].append(b)\r\n Dict[b].append(a)\r\nflag = 1\r\ncount = 0\r\nwhile(flag!=0):#If it doesn't remove any students in one go then break\r\n flag = 0 \r\n #Removal Process\r\n Collector = set()\r\n for i in Dict.keys():\r\n if(len(Dict[i])==1):\r\n Dict[i] = []\r\n Collector.add(i) #Collect all students who are removed in one go\r\n flag = 1\r\n #Update Process\r\n for i in Dict.keys():\r\n Dict[i] = list(set(Dict[i])-Collector)\r\n count+=1\r\nprint(count-1)", "# /**\r\n# * author: brownfox2k6\r\n# * created: 18/05/2023 22:36:32 Hanoi, Vietnam\r\n# **/\r\n\r\nstudents, laces = map(int, input().split())\r\ng = dict()\r\nfor i in range(1, students+1):\r\n g[i] = []\r\n\r\nfor i in range(laces):\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\nans = 0\r\nwhile True:\r\n kick = []\r\n for student in g:\r\n if len(g[student]) == 1:\r\n kick.append(student)\r\n if kick:\r\n for student in kick:\r\n del g[student]\r\n for student in g:\r\n for k in kick:\r\n try:\r\n g[student].remove(k)\r\n except:\r\n pass\r\n ans += 1\r\n else:\r\n exit(print(ans))", "\r\ndef getGroup():\r\n for i in range(1, n + 1):\r\n if i in hashMap and len(hashMap[i]) == 1:\r\n queue.append(i)\r\n\r\n\r\nn, m = map(int, input().split())\r\nhashMap = {i: set() for i in range(1, n + 1)}\r\nfor i in range(m):\r\n path, toPath = map(int, input().split())\r\n hashMap[path].add(toPath)\r\n hashMap[toPath].add(path)\r\n\r\nnumberOfGroups = 0\r\nqueue = []\r\ngetGroup()\r\nwhile(len(queue)):\r\n size = len(queue)\r\n for i in range(size):\r\n currentNode = queue.pop(0)\r\n neighbourNodes = hashMap[currentNode]\r\n for neighbour in neighbourNodes:\r\n hashMap[neighbour].remove(currentNode)\r\n hashMap.pop(currentNode)\r\n numberOfGroups += 1\r\n getGroup()\r\n\r\nprint(numberOfGroups);", "from collections import defaultdict\r\nn, m = [int(y) for y in input().split()]\r\nd=defaultdict(list)\r\nfor i in range(m):\r\n a, b = [int(y) for y in input().split()]\r\n d[a].append(b)\r\n d[b].append(a)\r\ncnt=0\r\nwhile True:\r\n f=0\r\n vis=[False]*n\r\n for k, v in d.items():\r\n if len(v)==1 and not vis[k-1]:\r\n temp=v.pop(0)\r\n d[temp].pop(d[temp].index(k))\r\n vis[temp-1]=True\r\n f=1\r\n if f==0:break\r\n cnt+=1\r\n f=0\r\nprint(cnt)", "from collections import defaultdict\r\n\r\n\r\nn,m = list(map(int,input().split())) \r\ngraph = defaultdict(list)\r\nin_degree = defaultdict(int)\r\n \r\nfor _ in range(m):\r\n a,b = list(map(int,input().split())) \r\n graph[a].append(b) \r\n graph[b].append(a) \r\n in_degree[a] += 1 \r\n in_degree[b] += 1 \r\n\r\ndef helper():\r\n groups = 0 \r\n while True:\r\n curr = []\r\n for node in in_degree:\r\n if in_degree[node] == 1:\r\n found = True\r\n curr.append(node) \r\n\r\n if not curr:\r\n return groups\r\n else:\r\n for nd in curr:\r\n in_degree[nd] -= 1 \r\n for adj in graph[nd]:\r\n in_degree[adj] -= 1 \r\n groups += 1 \r\nprint(helper())\r\n\r\n\r\n", "import sys\r\nimport math\r\nimport collections\r\nimport bisect\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,m=get_ints()\r\nconnected=[]\r\nfor i in range(n):\r\n row=[]\r\n connected.append(row)\r\nfor i in range(m):\r\n a,b=get_ints()\r\n connected[a-1].append(b-1)\r\n connected[b-1].append(a-1)\r\ncount=0\r\nloop=0\r\nwhile loop<=m:\r\n c=0\r\n remove=[]\r\n for i in range(n):\r\n row=connected[i]\r\n if len(row)==1:\r\n pos=row[0]\r\n remove.append([pos,i])\r\n connected[i]=[]\r\n c+=1\r\n for i,j in remove:\r\n if j in connected[i]:\r\n connected[i].remove(j)\r\n loop+=1\r\n if c>0:\r\n count+=1\r\nprint(count)", "n,l = map(int, input().split(\" \"))\r\nconn = [[] for _ in range(n)]\r\n\r\ndef check(conn): \r\n ones = []\r\n for i in range(len(conn)): \r\n if len(conn[i]) == 1: ones.append(i)\r\n \r\n return ones\r\n\r\nd = lambda x: int(x) - 1\r\nfor i in range(l): \r\n a, b = map(d, input().rstrip().split(\" \"))\r\n \r\n conn[a].append(b)\r\n conn[b].append(a)\r\ngroups = 0\r\nwhile(check(conn)): \r\n\r\n groups += 1\r\n loc = check(conn)\r\n for i in loc: \r\n if conn[i]: \r\n conn[conn[i].pop()].remove(i)\r\n \r\nprint(groups)", "a,b=map(int,input().split())\nu=0\ns=0\nk=[[] for i in range(a)]\np=[]\nfor i in range(b):\n n,m=map(int,input().split())\n m-=1\n n-=1\n k[n].append(m)\n k[m].append(n)\n#print(k)\nh=[]\nwhile True:\n p=[]\n for i in range(len(k)):\n if len(k[i])==1:\n p.append(i)\n if p==[]:\n break\n else:\n s+=1\r\n for i in p:\n if len(k[i])!=0:\n #print(h,p)\n h=k[i][0]\n k[i].remove(h)\n k[h].remove(i)\nprint(s)", "from collections import defaultdict\r\nn,m=[int(x) for x in input().split()]\r\nd=defaultdict(set)\r\ncount=defaultdict(int)\r\nfor i in range(m):\r\n a,b=[int(x) for x in input().split()]\r\n d[a].add(b)\r\n d[b].add(a)\r\n count[a]+=1\r\n count[b]+=1\r\n# print(d)\r\nans=0\r\nwhile True:\r\n\r\n f=0\r\n l=[]\r\n for i in d:\r\n if count[i]==1:\r\n for ele in d[i]:\r\n l.append([i,ele])\r\n f=1\r\n\r\n for i in l:\r\n if i[0] in d[i[1]]:\r\n d[i[1]].remove(i[0])\r\n count[i[1]]-=1\r\n d.pop(i[0])\r\n count.pop(i[0])\r\n\r\n if f==0:\r\n break\r\n else:\r\n ans+=1\r\n\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\n\r\ngraph = [[0] * n for _ in range(n)]\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n graph[a - 1][b - 1] = 1\r\n graph[b - 1][a - 1] = 1\r\n\r\nres = 0\r\nwhile True:\r\n pairs = []\r\n for i in range(n):\r\n if graph[i].count(1) == 1:\r\n j = graph[i].index(1)\r\n pairs.append((i, j))\r\n if not pairs:\r\n break\r\n else:\r\n for pair in pairs:\r\n i, j = pair\r\n graph[i][j] = graph[j][i] = 0\r\n res += 1\r\n\r\nprint(res)\r\n", "#\r\n# Author: eloyhz\r\n# Date: Sep/18/2020\r\n#\r\n#\r\n#\r\n#\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = [int(x) for x in input().split()]\r\n adj = [[] for _ in range(n + 1)]\r\n for _ in range(m):\r\n a, b = [int(x) for x in input().split()]\r\n adj[a].append(b)\r\n adj[b].append(a)\r\n ans = 0\r\n while True:\r\n reprimend = set()\r\n for u in range(1, n + 1):\r\n if len(adj[u]) == 1:\r\n reprimend.add(u)\r\n if not reprimend:\r\n break\r\n ans += 1\r\n while reprimend:\r\n u = reprimend.pop()\r\n v = adj[u][0]\r\n adj[v].remove(u)\r\n adj[u].remove(v)\r\n if v in reprimend:\r\n reprimend.remove(v)\r\n print(ans)\r\n\r\n\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,m = rinput()\r\n\r\ngraph = [[] for _ in range(n+1)]\r\nfor _ in range(m):\r\n u,v = rinput()\r\n graph[u].append(v)\r\n graph[v].append(u)\r\ncount = 0\r\nwhile True:\r\n flag = True\r\n visited = [False]*(n+1)\r\n for i in range(1,n+1):\r\n if not visited[i] and len(graph[i]) == 1:\r\n flag = False\r\n u = graph[i][0]\r\n graph[u].remove(i)\r\n visited[u] = True\r\n graph[i] = []\r\n if flag:\r\n break\r\n else:\r\n count += 1\r\nprint(count)\r\n", "from collections import defaultdict\nfrom sys import stdin\n\ngraph = defaultdict(set)\nn, m = stdin.readline().split()\nn = int(n)\nm = int(m)\nfor i in range(0, m):\n edges = stdin.readline().split()\n graph[int(edges[0])].add(int(edges[1]))\n graph[int(edges[1])].add(int(edges[0]))\nreprimand = True\ngroups_removed = 0\nwhile reprimand:\n to_kick_out = []\n for i in range(1, n+1):\n if len(graph[i]) == 1:\n to_kick_out.append(i)\n if len(to_kick_out) > 0:\n groups_removed += 1\n for e in to_kick_out:\n for key in graph[e]:\n graph[key].remove(e)\n graph.pop(e)\n else:\n reprimand = False\nprint(groups_removed)\n\n\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\ng={}\r\nfor i in range(0,m):\r\n a,b = [int(j) for j in input().split(\" \")]\r\n if a in g:\r\n g[a].append(b)\r\n else:\r\n g[a] = [b]\r\n \r\n if b in g:\r\n g[b].append(a)\r\n else:\r\n g[b] = [a]\r\nrm=n\r\nans=0\r\nwhile rm != 1:\r\n lsrm=rm\r\n lt = []\r\n for key in g.keys():\r\n if len(g[key])==1:\r\n lt.append(key)\r\n rm-=1\r\n if rm!=lsrm:\r\n ans+=1\r\n else:\r\n break\r\n for key in lt:\r\n if len(g[key])!=0:\r\n #print(key,\" \",g[key][0])\r\n g[g[key][0]].remove(key)\r\n g[key].remove(g[key][0])\r\nprint(ans)", "# ip = open(\"testdata.txt\", \"r\")\n\n# def input():\n# \treturn ip.readline().strip()\n\nfrom collections import defaultdict\n\nn, m = map(int, input().split())\n\ndeg = [0]*n\ngraph = defaultdict(list)\n\nfor _ in range(m):\n\ta, b = map(int, input().split())\n\tgraph[a-1].append(b-1)\n\tgraph[b-1].append(a-1)\n\tdeg[a-1] += 1; deg[b-1] += 1\n\ndeleted = set()\ncount = 0\nwhile True:\n\tupdated = False\n\told_deg = list(deg)\n\tfor i in range(n):\n\t\tif old_deg[i] == 1 and not i in deleted:\n\t\t\tupdated = True\n\t\t\tdeleted.add(i)\n\t\t\tfor v in graph[i]:\n\t\t\t\tdeg[v] -= 1\n\tif not updated:\n\t\tbreak\n\tcount += 1\nprint(count)\n", "n,m=map(int,input().split())\r\narr=[set() for i in range(n+1)]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n arr[a].add(b)\r\n arr[b].add(a)\r\nans=0\r\nwhile(True):\r\n x=set()\r\n for i in range(1,n+1):\r\n if len(arr[i])==1:\r\n x.add(i)\r\n arr[i]=set()\r\n if len(x)==0:\r\n break\r\n ans+=1\r\n for i in range(1,n+1):\r\n arr[i]-=x\r\nprint(ans)", "n,m = map(int,input().split())\r\nmat = []\r\nfor i in range(n):\r\n arr = []\r\n for j in range(n):\r\n arr.append(0)\r\n mat.append(arr)\r\nfor _ in range(m):\r\n a,b = map(int,input().split())\r\n mat[a-1][b-1] = 1\r\n mat[b-1][a-1] = 1\r\ncnt:int = 0\r\nwhile True:\r\n l:bool = False\r\n arr = []\r\n for i in range(n):\r\n cnt_one:int = 0\r\n for j in range(n):\r\n if mat[i][j] == 1:\r\n cnt_one+=1\r\n if cnt_one == 1:\r\n l = 1\r\n arr.append(i)\r\n for i in arr:\r\n for j in range(n):\r\n mat[i][j] = 0\r\n mat[j][i] = 0\r\n if l == 1:\r\n cnt+=1\r\n else:\r\n break\r\nprint(cnt)", "#prositka legenda\r\n#esli чestno to we ZAEBALI YЖE BLAT\r\na, s = map(int, input().split())\r\nz = []\r\nd = []\r\nfor i in range(s):\r\n q, w = map(int, input().split())\r\n z.append(q)\r\n z.append(w)\r\ne = 0\r\nwhile True:\r\n d.clear()\r\n for i in range(1, a + 1):\r\n if z.count(i) == 1: \r\n d.append(i)\r\n if len(d) == 0: \r\n break\r\n for x in d:\r\n if z.count(x) == 1:\r\n f = z.index(x)\r\n if f % 2 == 0:\r\n z.pop(f)\r\n z.pop(f)\r\n else:\r\n z.pop(f)\r\n z.pop(f - 1)\r\n e += 1\r\n\r\nprint(e)", "if __name__ == \"__main__\":\r\n n,m = map(int,input().split())\r\n\r\n cnt = [0 for _ in range(n)]\r\n edges = [\r\n [] for _ in range(n)\r\n ] \r\n\r\n for i in range(m):\r\n a,b = map(int,input().split())\r\n a -= 1\r\n b -= 1\r\n edges[a].append(b)\r\n edges[b].append(a)\r\n cnt[a] += 1\r\n cnt[b] += 1\r\n \r\n reprimand = 0 \r\n\r\n for j in range(n):\r\n removed = []\r\n\r\n for i in range(n):\r\n if cnt[i] == 0: continue\r\n\r\n if cnt[i] == 1: \r\n cnt[i] = 0 \r\n removed.append(i) \r\n\r\n \r\n if len(removed) != 0: \r\n reprimand += 1\r\n \r\n for r in removed: \r\n for e in edges[r]:\r\n if cnt[e] != 0: \r\n cnt[e] -= 1 \r\n \r\n print(reprimand)", "n,l=map(int ,input().split())\r\none =[]\r\ntwo=[]\r\nAll=[]\r\nd=[]\r\nC=0\r\nfor i in range(l):\r\n a,b=map(int ,input().split())\r\n if All.count(a)==0:\r\n All.append(a)\r\n one.append(a)\r\n if All.count(b)==0:\r\n All.append(b)\r\n two.append(b)\r\nwhile True :\r\n for i in All:\r\n if one.count(i)+two.count(i)==1 :\r\n d.append(i)\r\n if d==[]:\r\n break\r\n else:\r\n C+=1\r\n for i in d:\r\n if i in one:\r\n x=one .index(i)\r\n one.pop(x)\r\n two.pop(x)\r\n \r\n if i in two:\r\n x=two .index(i)\r\n two.pop(x)\r\n one.pop(x)\r\n d=[]\r\n \r\nprint(C)", "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# from collections import defaultdict\r\n\r\nn,m = M()\r\ns = [set() for _ in range(n+1)]\r\nfor _ in range(m):\r\n a,b = M()\r\n s[a].add(b)\r\n s[b].add(a)\r\n\r\ncnt = 0\r\nwhile True:\r\n p = set()\r\n for i in range(1,n+1):\r\n if len(s[i])==1:\r\n p.add(i)\r\n s[i]=set()\r\n if len(p)==0:\r\n break\r\n \r\n cnt+=1\r\n # print(p,\"P\")\r\n for i in range(1,n+1):\r\n # print(s[i],\"s[i]\")\r\n # using set we can remove the common elements by just subtracting two sets with each other\r\n # s[i]-=p will remove all occurances of elements of p in s[i] \r\n s[i]-=p \r\n # print(\"s[i]\",s[i])\r\n# print(s)\r\nprint(cnt)\r\n\r\n\r\n\r\n\r\n######################################################\r\n# d = defaultdict(list)\r\n# # d[a] = [cnt,connections]\r\n# for i in range(m):\r\n# a,b = M()\r\n# if a in d:\r\n# d[a][0] += 1\r\n# d[a].append(b)\r\n# else:\r\n# d[a] = [1,b]\r\n \r\n# if b in d:\r\n# d[b][0]+=1\r\n# d[b].append(a)\r\n# else:\r\n# d[b] = [1,a]\r\n\r\n# # print(d)\r\n# cnt=0\r\n# lst = [1]\r\n# while lst:\r\n# lst = list(filter(lambda x: len(d[x])==2,d))\r\n# # print(lst)\r\n# cnt+=1\r\n# for i in lst:\r\n# if len(d[d[i][1]])>2:\r\n# d[d[i][1]][0]-=1\r\n# d[d[i][1]][1:].pop(d[d[i][1]][1:].index(i))\r\n \r\n# del d[i]\r\n \r\n# print(cnt)\r\n \r\n", "from collections import deque\r\n\r\n\r\nn, m = map(int, input().split(' '))\r\ngraph = {}\r\norder = {}\r\n\r\nfor i in range(1, n+1):\r\n graph[i] = []\r\n order[i] = 0\r\n\r\nones = deque([])\r\nseen = set()\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split(' '))\r\n graph[a].append(b)\r\n graph[b].append(a)\r\n order[a] += 1\r\n order[b] += 1\r\n\r\nfor x in order:\r\n if order[x] == 1:\r\n ones.append(x)\r\n seen.add(x)\r\n\r\ntotal = 0\r\nwhile ones:\r\n total += 1\r\n for _ in range(len(ones)):\r\n x = ones.pop()\r\n for y in graph[x]:\r\n order[y] -= 1\r\n for y in order:\r\n if order[y] == 1 and y not in seen:\r\n seen.add(y)\r\n ones.append(y)\r\nprint(total)", "n, m = map(int, input().split())\nadjacency_list = {}\nfor i in range(1, n + 1):\n adjacency_list[i] = set()\nfor i in range(m):\n x, y = map(int, input().split())\n adjacency_list[x].add(y)\n adjacency_list[y].add(x)\ndeleted = [False for i in range(n + 1)]\nnn = 0\nwhile nn < n:\n flag = True\n dd = []\n for i in range(1, n + 1):\n if not deleted[i] and len(adjacency_list[i]) == 1:\n flag = False\n deleted[i] = True\n dd.append(i)\n for v in dd:\n for i in range(1, n + 1):\n if v in adjacency_list[i]:\n adjacency_list[i].remove(v)\n if flag:\n break\n nn += 1\nprint(nn)\n", "n,k=map(int,input().split())\r\na=[set() for i in range(0,n+1)]\r\nfor i in range(k):\r\n x,y=map(int,input().split())\r\n a[x].add(y)\r\n a[y].add(x)\r\nans=0\r\nwhile True:\r\n outman=set()\r\n for i in range(1,n+1):\r\n if len(a[i])==1:\r\n a[i]=set()\r\n outman.add(i)\r\n if len(outman)==0: break\r\n ans+=1\r\n for i in range(1,n+1): a[i]-=outman\r\nprint(ans)\r\n \r\n", "I =lambda : list(map(int, input().split()))\r\nn,m = I()\r\nG = [[0 for i in range(n)] for j in range(n)]\r\nfor i in range(m):\r\n inp = I()\r\n G[inp[0]-1][inp[1]-1] = 1\r\n G[inp[1]-1][inp[0]-1] = 1\r\nkicked = 0\r\nwhile 1:\r\n candidates = [i for i in range(n) if sum(G[i]) == 1]\r\n if len(candidates) == 0:\r\n break\r\n for i in range(n):\r\n for c in candidates:\r\n G[i][c],G[c][i] = 0,0\r\n kicked += 1\r\nprint(kicked)", "n, m = [int(s) for s in input().split(' ')]\r\ng = [[0] * n for _ in range(n)]\r\nfor _ in range(m):\r\n a, b = [int(s) for s in input().split(' ')]\r\n g[a - 1][b - 1] = 1\r\n g[b - 1][a - 1] = 1\r\n \r\nleft = 0\r\nprocess_stop = False\r\nwhile not process_stop:\r\n to_throw = []\r\n process_stop = True\r\n for i in range(n):\r\n row = g[i]\r\n if sum(row) == 1:\r\n to_throw.append(i)\r\n process_stop = False\r\n if len(to_throw) > 0:\r\n left += 1\r\n for i in to_throw:\r\n j = 0\r\n while j < n and g[i][j] == 0:\r\n j += 1\r\n if j != n:\r\n g[i][j] = 0\r\n g[j][i] = 0\r\n\r\nprint(left)\r\n ", "def solve(n,m):\r\n freq = {}\r\n for i in range(m):\r\n p1, p2 = map(int,input().split())\r\n if freq.get(p1) != None:\r\n freq[p1].append(p2)\r\n\r\n else:\r\n freq[p1] = [p2]\r\n\r\n if freq.get(p2)!=None:\r\n freq[p2].append(p1)\r\n\r\n else:\r\n freq[p2] = [p1]\r\n\r\n\r\n\r\n key = freq.keys()\r\n found = True\r\n # for i in key:\r\n # if len(freq[i])==1:\r\n # found = True\r\n\r\n ans = 0\r\n # print(freq)\r\n singles = []\r\n\r\n\r\n while (found):\r\n found = False\r\n\r\n for i in key:\r\n if len(freq[i])==1:\r\n freq[i]=[]\r\n singles.append(i)\r\n found = True\r\n for i in singles:\r\n for j in freq.keys():\r\n if len(freq[j])==0:\r\n continue\r\n else:\r\n if i in freq[j]:\r\n freq[j].remove(i)\r\n\r\n \r\n\r\n # print(freq,found,singles)\r\n\r\n if found==True:\r\n ans+=1\r\n \r\n singles = []\r\n\r\n\r\n print(ans)\r\n return\r\n\r\n\r\n\r\nn,m = map(int,input().split())\r\nsolve(n, m)\r\n\r\n\r\n\r\n", "n, m = map(int, input().split())\nd = dict()\nedg = [[] for i in range(n + 1)]\nfor i in range(1, n + 1):\n d[i] = 0\nfor i in range(m):\n a, b = map(int, input().split())\n edg[a].append(b)\n edg[b].append(a)\n d[a] = d[a] + 1\n d[b] = d[b] + 1\ng = 0\nwhile 1 in d.values():\n g += 1\n called = {}\n for x in d:\n if d[x] == 1 and called.get(x, 0) == 0:\n con = edg[x][0]\n called[x] = 1\n called[con] = 1\n d[x] -= 1\n d[con] -= 1\n edg[con].remove(x)\nprint(g)", "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\n\r\ndef solve(g, n, m):\r\n \"\"\"\r\n The actual solution begins here\r\n c = a + b\r\n print(c)\r\n \"\"\"\r\n cnt = 0\r\n while g:\r\n to_be_removed = []\r\n for k, v in g.items():\r\n if len(v) == 1:\r\n to_be_removed.append(k)\r\n\r\n if not to_be_removed:\r\n break\r\n else:\r\n # if we get here, something has to be removed\r\n for c in to_be_removed:\r\n g.pop(c)\r\n for k, v in g.items():\r\n g[k] = [c for c in v if c not in to_be_removed]\r\n cnt += 1\r\n\r\n return cnt\r\n\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 g = defaultdict(list)\r\n while m > 0:\r\n u, v = map(int, input().split())\r\n g[u].append(v)\r\n g[v].append(u)\r\n m -= 1\r\n op = solve(g, n, m)\r\n print(op)\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", "n,m=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\nmp={}\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if a in mp:\r\n mp[a]+=[b]\r\n else:\r\n mp[a]=[b]\r\n if b in mp:\r\n mp[b]+=[a]\r\n else:\r\n mp[b]=[a]\r\ncnt=0\r\nwhile len(mp)>1:\r\n temp={}\r\n lis=list(mp.keys())\r\n for k in lis:\r\n if len(mp[k])==1:\r\n temp[k]=1\r\n del mp[k]\r\n if len(temp):\r\n cnt+=1\r\n for k,v in mp.items():\r\n for a,b in temp.items():\r\n if a in v:\r\n v.remove(a)\r\n temp.clear()\r\n else:\r\n break\r\nprint(cnt)\r\n\r\n", "W = 0\r\nG = 1\r\n\r\nn, m = map(int, input().split())\r\nE = []\r\nfor i in range(m):\r\n E.append(list(map(int, input().split())))\r\n\r\ngroup = []\r\ncolor = [-1]\r\ndeleted = [True] + [False for i in range(n)]\r\n\r\n\r\ndef get_nbs(v):\r\n nbs = []\r\n for e in E:\r\n if e[0] == v:\r\n nbs.append(e[1])\r\n if e[1] == v:\r\n nbs.append(e[0])\r\n return nbs\r\n\r\n\r\ndef dfs(v):\r\n color[v] = G\r\n nbs = get_nbs(v)\r\n if len(nbs) == 1:\r\n group.append((v, nbs[0]))\r\n deleted[v] = True\r\n for u in nbs:\r\n if color[u] == W:\r\n dfs(u)\r\n\r\n\r\ng_count = 0\r\nwhile True:\r\n group = []\r\n color = [-1] + [0 for i in range(n)]\r\n # print(E)\r\n\r\n for v in range(1, n + 1):\r\n if not deleted[v] and color[v] == W:\r\n dfs(v)\r\n\r\n # print(deleted)\r\n #\r\n # print(group)\r\n\r\n if len(group) == 0:\r\n break\r\n else:\r\n g_count += 1\r\n for e in group:\r\n if [e[0], e[1]] in E:\r\n E.remove([e[0], e[1]])\r\n elif [e[1], e[0]] in E:\r\n E.remove([e[1], e[0]])\r\n\r\nprint(g_count)\r\n\r\n", "students, shoelaces = map(int,input().split())\nd = {x : set() for x in range(students + 1)}\n\nfor item in range(shoelaces):\n p1,p2 = map(int,input().split())\n d[p1].add(p2)\n d[p2].add(p1)\n\ncount=0\nwhile True:\n removed = False\n marks = []\n for i,item in enumerate(d.values()):\n if len(item) == 1:\n marks.append((i, item.pop()))\n if marks:\n for first,second in marks:\n if d.get(second):\n d[second].remove(first)\n count += 1\n else:\n break\nprint(count)\n\n", "from collections import defaultdict\r\nfrom sys import stdin\r\n\r\ngraph = defaultdict(set)\r\nn, m = stdin.readline().split()\r\nn = int(n)\r\nm = int(m)\r\nfor i in range(0, m):\r\n edges = stdin.readline().split()\r\n graph[int(edges[0])].add(int(edges[1]))\r\n graph[int(edges[1])].add(int(edges[0]))\r\nreprimand = True\r\ngroups_removed = 0\r\nwhile reprimand:\r\n to_kick_out = []\r\n for i in range(1, n+1):\r\n if len(graph[i]) == 1:\r\n to_kick_out.append(i)\r\n if len(to_kick_out) > 0:\r\n groups_removed += 1\r\n for e in to_kick_out:\r\n for key in graph[e]:\r\n graph[key].remove(e)\r\n graph.pop(e)\r\n else:\r\n reprimand = False\r\nprint(groups_removed)\r\n", "from collections import defaultdict\n\n\ninp = lambda: list(map(int, input().split()))\n\nn, m = inp()\ncnt = 0\nmtx = []\nfor _ in range(n+1):\n mtx.append([0] * (n+1))\nfor _ in range(m):\n link = inp()\n mtx[link[0]][link[1]] = 1\n mtx[link[1]][link[0]] = 1\n\nwhile True:\n leaving = set()\n for i in range(len(mtx)):\n if sum(mtx[i]) == 1:\n leaving.add(i)\n if leaving:\n for el in leaving:\n mtx[el] = [0] * (n+1)\n for i in range(n+1):\n mtx[i][el] = 0\n cnt += 1\n else:\n break\n\n\nprint(cnt)", "'''\r\n Khushal Sindhav\r\n Indian Institute Of Technology, Jodhpur\r\n 14 April 2023\r\n'''\r\nimport sys\r\n# input = sys.stdin.readline\r\n# print = sys.stdout.write\r\ndef exe():\r\n d={}\r\n for i in range(1,n+1):\r\n d[i]=[0 for i in range(n+1)]\r\n for i in l:\r\n d[i[0]][i[1]]=1\r\n d[i[1]][i[0]]=1\r\n for i in d:\r\n d[i].append(sum(d[i]))\r\n\r\n ans=0\r\n while True:\r\n for i in d:\r\n if d[i][-1]==1:\r\n break\r\n else:\r\n break\r\n\r\n index=[]\r\n for i in d:\r\n if d[i][-1]==1:\r\n index.append(i)\r\n for i in index:\r\n if d[i][-1]==1:\r\n for j in range(n+1):\r\n if d[i][j]:\r\n d[j][i]=0\r\n d[j][-1]-=1\r\n d[i][j]=0\r\n d[i][-1]-=1\r\n ans+=1\r\n\r\n return ans\r\n \r\nfor _ in range(1):\r\n n,m=map(int,input().split())\r\n\r\n l=[]\r\n for i in range(m):\r\n l.append(list(map(int,input().split())))\r\n print(exe())", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(m):\r\n a.append(list(map(int, input().split())))\r\nans = 0\r\nnex = []\r\ncolor = [0] * (n + 1)\r\n\r\n\r\ndef get_neibors(v):\r\n neibors = []\r\n for el in a:\r\n if v == el[0]:\r\n neibors.append(el[1])\r\n elif v == el[1]:\r\n neibors.append(el[0])\r\n return neibors\r\n\r\n\r\ndef dfs(v):\r\n color[v] = 1\r\n neibors = get_neibors(v)\r\n if len(neibors) == 1:\r\n if [neibors[0], v] not in nex:\r\n nex.append([v, neibors[0]])\r\n for vn in neibors:\r\n if color[vn] == 0:\r\n dfs(vn)\r\n\r\n\r\nfor i in range(1, n + 1):\r\n if color[i] == 0:\r\n dfs(i)\r\nwhile nex != []:\r\n ans += 1\r\n for el in nex:\r\n if el in a:\r\n a.remove(el)\r\n else:\r\n el[0], el[1] = el[1], el[0]\r\n a.remove(el)\r\n nex = []\r\n color = [0] * (n + 1)\r\n if a:\r\n for i in range(1, n + 1):\r\n if color[i] == 0:\r\n dfs(i)\r\nprint(ans)\r\n", "n, m = map(int, input().split())\r\ng = {}\r\ndeg = [0]*(n+1)\r\nfor i in range(1, n+1):\r\n g[i] = []\r\n\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n g[a] += [b]\r\n g[b] += [a]\r\n deg[a] += 1\r\n deg[b] += 1\r\n \r\nans = 0\r\nfor _ in range(1, n+1):\r\n r = []\r\n for i in range(1, n+1):\r\n if deg[i] == 1:\r\n r += [i]\r\n deg[i] = 0\r\n if not r:\r\n break\r\n ans += 1\r\n for i in range(1, n+1):\r\n if deg[i] >= 2:\r\n for j in r:\r\n if j in g[i]:\r\n deg[i] -= 1\r\nprint(ans)", "inputs = input().split()\nalunos = int(inputs[0])\nlacos = int(inputs[1])\nvet = [[]] * (alunos+1)\ni = 0\nwhile i < lacos:\n laco_atual = input().split()\n aluno1 = int(laco_atual[0])\n aluno2 = int(laco_atual[1])\n # aluno1:\n if vet[aluno1] == []:\n vet[aluno1] = set([aluno2])\n else:\n vet[aluno1].add(aluno2)\n # aluno2:\n if vet[aluno2] == []:\n vet[aluno2] = set([aluno1])\n else:\n vet[aluno2].add(aluno1)\n i += 1\n\nrodadas = 0\nparar = False\nwhile True:\n i = 0\n parar = True\n apagar = []\n while i < (alunos+1):\n # print('teste')\n # print(vet[i])\n if len(vet[i]) == 1:\n parar = False\n for a in vet[i]:\n tupla = (a,i)\n apagar.append(tupla)\n vet[i] = []\n \n i += 1\n if parar:\n break\n rodadas += 1\n for j in apagar:\n aluno = j[0]\n aluno2 = j[1]\n # print(j)\n # print(vet[aluno])\n if vet[aluno] != []:\n vet[aluno].discard(aluno2)\n apagar.clear()\n \nprint(rodadas)\n\n\t\t\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\r\ng = {}\r\n\r\nfor _ in range(m):\r\n a, b = map(int, stdin.readline().split())\r\n \r\n if a in g:\r\n g[a].append(b)\r\n else:\r\n g[a] = [b]\r\n \r\n if b in g:\r\n g[b].append(a)\r\n else:\r\n g[b] = [a]\r\n\r\nr = 0\r\nwhile True:\r\n todel = []\r\n for student in g:\r\n if len(g[student]) == 1:\r\n todel.append(student)\r\n \r\n \r\n if len(todel) == 0:\r\n break\r\n \r\n for student in todel:\r\n del g[student]\r\n for neigh in g:\r\n if student in g[neigh]:\r\n g[neigh].remove(student)\r\n r += 1\r\n\r\nprint(r)\r\n \r\n", "\r\nx=input().split()\r\nnodes=[]\r\nfor i in range(int(x[0])):\r\n nodes.append([])\r\nm=int(x[1])\r\nfor i in range(m) :\r\n z=input().split()\r\n nodes[int(z[0])-1].append(int(z[1])-1)\r\n nodes[int(z[1])-1].append(int(z[0])-1)\r\n \r\n\r\ndef zizo(n,lista,group):\r\n ones=0\r\n ind=[]\r\n sor=[]\r\n for i in range(n):\r\n if len(lista[i]) == 1:\r\n ones=ones+1\r\n if lista[i][0] not in sor :\r\n ind.append(lista[i][0])\r\n sor.append(i)\r\n if ones > 0 :\r\n for i in range(len(ind)):\r\n lista[ind[i]].remove(sor[i])\r\n lista[sor[i]].remove(ind[i])\r\n \r\n zizo(n,lista,group+1)\r\n else:\r\n print(group)\r\n \r\nzizo(int(x[0]),nodes,0) ", "n, m = map(int, input().split())\r\n\r\nshoelaces = [[0] * n for _ in range(n)]\r\n\r\nfor _ in range(m):\r\n a, b = map(lambda x: int(x) - 1, input().split())\r\n shoelaces[a][b] = 1\r\n shoelaces[b][a] = 1\r\n\r\ndef can_cut(shoelaces, node):\r\n count = 0\r\n on = None\r\n for other_node, shoelace in enumerate(shoelaces[node]):\r\n if shoelace:\r\n if count == 0:\r\n count += 1\r\n on = other_node\r\n else:\r\n return False, None\r\n if count == 1:\r\n return True, on\r\n else:\r\n return False, None\r\n \r\n\r\ndef solve(shoelaces, n):\r\n groups = 0\r\n while groups < n:\r\n kick = []\r\n for node in range(n):\r\n cut, other_node = can_cut(shoelaces, node)\r\n if cut:\r\n kick.append((node, other_node))\r\n \r\n if kick == []:\r\n return groups\r\n else:\r\n groups += 1\r\n for node_to_kick, other_node in kick:\r\n if shoelaces[node_to_kick][other_node] > 0 and shoelaces[other_node][node_to_kick] > 0:\r\n shoelaces[node_to_kick][other_node] -= 1\r\n shoelaces[other_node][node_to_kick] -= 1 \r\n return groups\r\n\r\n\r\n\r\nprint(solve(shoelaces, n))", "from collections import defaultdict\nalunos, lacos = list(map(int, input().split()))\nd = defaultdict(list)\nfor i in range(lacos):\n x, y = list(map(int, input().split()))\n d[x].append(y)\n d[y].append(x)\n\nrepreendidos = []\ncont = -1\ntotal = 0\nwhile cont != 0:\n repreendidos.clear()\n cont = 0\n for i in range(alunos):\n if len(d[i+1]) == 1:\n repreendidos.append(i+1)\n cont += 1\n if cont != 0:\n total += 1\n for i in repreendidos:\n d.pop(i)\n for x in d:\n if i in d[x]:\n d[x].remove(i)\n\nprint(total)\n\n\t \t\t \t \t \t\t \t \t \t\t \t", "a={}\r\nn,t=map(int,input().split())\r\nd=[]\r\nfor i in range(t) :\r\n p1,p2=map(int,input().split())\r\n if p1 not in a :\r\n a[p1]=[0,[p2]]\r\n d.append(p1)\r\n else :\r\n a[p1][1].append(p2)\r\n if p2 not in a :\r\n a[p2]=[0,[p1]]\r\n d.append(p2)\r\n else :\r\n a[p2][1].append(p1)\r\ndef rese(a,d) :\r\n for i in d :\r\n if len(a[i][1])==1 :\r\n return True\r\n return False\r\nl=0\r\nd1=d\r\nwhile rese(a,d1) :\r\n k=[]\r\n l+=1\r\n for i in d :\r\n if len(a[i][1])==1 : k.append(i)\r\n for j in k :\r\n for i in a[j][1] :\r\n a[i][1].remove(j)\r\n a.pop(j)\r\n j=0 \r\n for i in range(len(d)) :\r\n if d[i-j] in k :\r\n d.pop(i-j);j+=1\r\n d1=d\r\nprint(l)", "n, m = map(int, input().split())\r\ngraph = {}\r\nfor i in range(n):\r\n graph[i+1]=[]\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n graph[a] += [b]\r\n graph[b] += [a]\r\n\r\ngroup=set()\r\ns=0\r\n\r\ndef find_group(s):\r\n group.clear()\r\n for i in graph:\r\n if (len(graph[i]) == 1):\r\n group.add(i)\r\n if (len(group) == 0):\r\n return s\r\n for i in group:\r\n if ((len(graph[graph[i][0]])>1) | (graph[i][0] not in group)):\r\n graph[graph[i][0]].remove(i)\r\n graph[i] = []\r\n s+=1\r\n return find_group(s)\r\n\r\nprint(find_group(0))", "from collections import defaultdict\r\nn, m = map(int, input().split())\r\n\r\ng = defaultdict(set)\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n g[u].add(v), g[v].add(u)\r\ngroups = 0\r\nwhile True:\r\n onelacers = {u for u in g if len(g[u]) == 1}\r\n if not onelacers:\r\n break\r\n groups+=1\r\n for u in onelacers:\r\n if g[u]:\r\n g[g[u].pop()].remove(u)\r\n\r\nprint(groups)", "'''\r\n# Submitted By M7moud Ala3rj\r\nDon't Copy This Code, CopyRight . [email protected] © 2022-2023 :)\r\n'''\r\n# Problem Name = \"Students and Shoelaces\"\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 s = dict() ; groups = [] ; k=0 ; ans = 0\r\n for i in range(m):\r\n x = input().split()\r\n if not s.get(x[0]) : s[x[0]] = 0\r\n if not s.get(x[1]) : s[x[1]] = 0\r\n s[x[0]]+=1 ; s[x[1]] += 1\r\n groups.append(x)\r\n z = 0\r\n while k!=m:\r\n k = 0\r\n ans = 0\r\n v = []\r\n for i in groups:\r\n if s[i[0]] == 1 or s[i[1]] == 1:\r\n v.append(i)\r\n else:\r\n k+=1\r\n for i in v:\r\n s[i[0]] -= 1\r\n s[i[1]] -= 1\r\n ans+=(not s[i[0]]) + (not s[i[1]])\r\n z += int(bool(ans))\r\n print(z)\r\n\r\nif __name__ == \"__main__\":\r\n Solve()", "from sys import stdin ,stdout\r\nfrom os import path\r\nif(path.exists('input.txt')):\r\n stdin = open(\"input.txt\",\"r\")\r\nfrom collections import defaultdict\r\nx,y = map(int,stdin.readline().strip().split())\r\namr = defaultdict(list)\r\nfor _ in range(y):\r\n\ta,b = map(int,stdin.readline().strip().split())\r\n\tamr[a].append(b)\r\n\tamr[b].append(a)\r\ncounter = 0 \r\nwhile True:\r\n\tout = []\r\n\tfor key,val in amr.items():\r\n\t\tif len(val) == 1:\r\n\t\t\tout.append(key)\r\n\tfor item in out:\r\n\t\tamr.pop(item)\r\n\tif len(out) == 0 :\r\n\t\tbreak\r\n\telse:\r\n\t\tfor item in out:\r\n\t\t\tfor key,val in amr.items():\r\n\t\t\t\tif item in val:\r\n\t\t\t\t\tval.remove(item)\r\n\tcounter+=1\r\nprint(counter)", "n,m=map(int,input().split())\r\ns=[set() for __ in range(n+1)]\r\nfor _ in range(m):\r\n a,b=map(int,input().split())\r\n s[a].add(b)\r\n s[b].add(a)\r\ncount=0\r\nwhile True:\r\n p=set()\r\n for i in range(1,n+1):\r\n if len(s[i])==1:\r\n p.add(i)\r\n s[i]=set()\r\n if len(p)==0:\r\n break\r\n count+=1\r\n for i in range(1,n+1):\r\n s[i]-=p\r\nprint(count)\r\n ", "n, m = map(int, input().split())\r\nmatr = [[0]*(n+1) for i in range (n+1)]\r\npower = [0]*(n+1)\r\nfor i in range(m):\r\n x, y = map(int, input().split())\r\n matr[x][y] = 1\r\n matr[y][x] = 1\r\n\r\nfor i in range(1, n+1):\r\n power[i] = sum(matr[i])\r\n\r\n#print(matr)\r\n#print(power)\r\n\r\ncount = 0\r\nwhile 1 in power:\r\n ones = set()\r\n k = power.count(1)\r\n# print(k)\r\n for i in range(n+1):\r\n if 1 in power[i:]:\r\n i = power.index(1, i, )\r\n ones.add(i)\r\n # print(*ones)\r\n for i in range(k):\r\n if 1 in power:\r\n p = ones.pop()\r\n# print(p, end = \" \")\r\n for j in range (n+1):\r\n if matr[j][p] == 1:\r\n power[j] -= 1\r\n matr[p][j] = 0\r\n matr[j][p] = 0\r\n power[p] = 0\r\n# print(\"\") \r\n# print(count)\r\n# print(matr)\r\n# print(power) \r\n count += 1\r\n \r\n \r\nprint(count)\r\n \r\n", "class CodeforcesTask129BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.edges = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n for x in range(self.n_m[1]):\n self.edges.append([int(y) for y in input().split(\" \")])\n\n def process_task(self):\n kicked = True\n kicked_cnt = 0\n graph = [set() for x in range(self.n_m[0])]\n for edge in self.edges:\n graph[edge[0] - 1].add(edge[1])\n graph[edge[1] - 1].add(edge[0])\n\n while kicked:\n kicked = False\n trm = []\n for x in range(self.n_m[0]):\n if len(graph[x]):\n if len(graph[x]) == 1:\n kicked = True\n conn = graph[x].pop()\n trm.append((conn - 1, x + 1))\n for tr in trm:\n if tr[1] in graph[tr[0]]:\n graph[tr[0]].remove(tr[1])\n if kicked:\n kicked_cnt += 1\n\n self.result = str(kicked_cnt)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask129BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "def answer(n,m,dp):\r\n count=0\r\n for k in range(n):\r\n flag=1\r\n l=[]\r\n for i in range(1,n+1):\r\n index=-1\r\n count1=0\r\n for j in range(1,n+1):\r\n if dp[i][j]==1:\r\n if index==-1:\r\n index=j\r\n count1+=1\r\n if count1==1:\r\n flag=0\r\n dp[i][index]=0\r\n l.append([index,i])\r\n \r\n if flag:\r\n break\r\n \r\n for ele in l:\r\n dp[ele[0]][ele[1]]=0\r\n count+=1\r\n \r\n return count\r\n \r\n \r\n \r\n\r\nn,m=map(int,input().split())\r\ndp=[[0 for i in range(0,n+1)] for j in range(0,n+1)]\r\nfor i in range(m):\r\n u,v=map(int,input().split())\r\n dp[u][v]=1\r\n dp[v][u]=1\r\n\r\nprint(answer(n,m,dp))", "n,m = list(map(int, input().split()))\nlinks = {i: set() for i in range(1,n+1)}\nout_counts = 0\nfor i in range(m):\n l0, l1 = list(map(int, input().split()))\n links[l0].add(l1)\n links[l1].add(l0)\nwhile True:\n one_lace_group = []\n for i in links.keys():\n if len(links[i])==1:\n one_lace_group.append(i)\n if (len(one_lace_group)==0):\n break\n for i in one_lace_group:\n for j in links[i]:\n links[j].remove(i)\n links[i] = set()\n out_counts += 1\nprint (out_counts)\n\n\n\n", "n , m = [int(x) for x in input().split()]\r\nstudents = [i for i in range(n)]\r\n\r\nadj = [[] for i in range(n)]\r\n\r\nfor i in range(m):\r\n s1 , s2 = [int(x) - 1 for x in input().split()]\r\n adj[s1].append(s2)\r\n adj[s2].append(s1)\r\n\r\ndef dfs(s):\r\n global visited\r\n global out\r\n visited[s] = True\r\n if len(adj[s]) == 1:\r\n out.append(s)\r\n for i in adj[s]:\r\n if not visited:\r\n dfs(i)\r\n\r\nc = 0\r\nfor i in range(100):\r\n visited = [False for i in range(n)]\r\n out = []\r\n for student in students:\r\n if not visited[student]:\r\n dfs(student)\r\n if len(out) != 0 :\r\n c += 1\r\n for i in out:\r\n students.remove(i)\r\n for k in adj[i]:\r\n adj[k].remove(i)\r\n adj[i] = []\r\n\r\n else:\r\n break\r\nprint(c)", "n,m = list(map(int,input().split(\" \")))\r\nadj = {i:[] for i in range(1,n+1)}\r\ndeg = {i:0 for i in range(1,n+1)}\r\n\r\nfor t in range(m):\r\n x,y = list(map(int,input().split(\" \")))\r\n adj[x].append(y)\r\n adj[y].append(x)\r\n deg[x] += 1\r\n deg[y] += 1\r\nans = 0\r\nwhile True:\r\n if 1 in deg.values():\r\n ans += 1\r\n l = [key for (key,value) in deg.items() if value==1]\r\n for i in l:\r\n deg[i] = 0\r\n for k in adj[i]:\r\n deg[k] -= 1\r\n continue\r\n break\r\nprint(ans)", "s,l = [int(x) for x in input().split()]\ngroup = {}\nfor i in range(1,s+1):\n\tgroup[i] = []\nfor i in range(1, l+1):\n\tnum,num2 = [int(x) for x in input().split()]\n\tgroup[num].append(num2)\n\tgroup[num2].append(num)\ngrp = 0\nwhile 1:\n\tvisited = []\n\tcheck = False\n\tfor i in range(1, s + 1):\n\t\tif len(group[i]) == 1 and i not in visited:\n\t\t\tcheck = True\n\t\t\tindex = group[i][-1]\n\t\t\tgroup[index].remove(i)\n\t\t\tgroup[i].remove(index)\n\t\t\tvisited.append(index)\n\tif check:\n\t\tgrp += 1\n\telse:\n\t\tbreak\n\n\nprint(grp)\n", "import math\r\n\r\ndef main(n,edges):\r\n\r\n adj={}\r\n\r\n for e in edges:\r\n x,y=e\r\n if x not in adj:\r\n adj[x]=[]\r\n if y not in adj:\r\n adj[y]=[]\r\n adj[y].append(x)\r\n adj[x].append(y)\r\n\r\n \r\n ans=0\r\n while True:\r\n found=False\r\n remove=[]\r\n for e in adj:\r\n if len(adj[e])==1:\r\n remove.append(e)\r\n found=True \r\n \r\n for e in remove:\r\n \r\n \r\n if len(adj[e])!=0:\r\n v=adj[e].pop()\r\n adj[v].remove(e)\r\n\r\n if found:\r\n ans+=1 \r\n else:\r\n return ans\r\n \r\nn,m=list(map(int,input().split()))\r\nedges=[]\r\nfor i in range(m):\r\n edges.append(list(map(int,input().split())))\r\nprint(main(n,edges))\r\n\r\n \r\n\r\n\r\n", "\r\n\r\n\r\n\r\ndef main():\r\n n, m = (int(e) for e in input().split(' '))\r\n\r\n relations = [[[], True] for i in range(n)]\r\n\r\n for i in range(m):\r\n a, b = (int(e) - 1 for e in input().split(' '))\r\n\r\n relations[a][0].append(b)\r\n relations[b][0].append(a)\r\n\r\n prevGroups = -1\r\n groups = 0\r\n while groups != prevGroups:\r\n prevGroups = groups\r\n added = False\r\n toRemove = []\r\n for i, rel in enumerate(relations):\r\n if len(rel[0]) == 1:\r\n if rel[1]:\r\n joined = rel[0][0]\r\n toRemove.append((i, joined))\r\n\r\n if rel[1] and not added:\r\n added = True\r\n groups += 1\r\n rel[1] = False\r\n \r\n for index, joined in toRemove:\r\n relations[joined][0].remove(index)\r\n \r\n print(groups)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "import sys\n\nn, m = list(map(int, sys.stdin.readline().split()))\nans = 0\nadj = [[False for j in range(n+1)] for i in range(n+1)]\n\nfor _ in range(m):\n a, b = list(map(int, sys.stdin.readline().split()))\n adj[a][b] = True\n adj[b][a] = True\n\nwhile True:\n\n degOne = [idx for idx, val in enumerate(adj) if val.count(True) == 1]\n\n if len(degOne) == 0:\n break\n\n ans += 1\n for node in degOne:\n ngbs = []\n for idx, val in enumerate(adj[node]):\n if val:\n ngbs.append(idx)\n\n for ngb in ngbs:\n adj[ngb][node] = False\n adj[node][ngb] = False\n\nprint(ans)\n", "n, m = map(int, input().split())\r\ns, t = 0, {}\r\n\r\nfor i in range(m):\r\n a, b = map(int, input().split())\r\n if a in t: t[a].append(b)\r\n else: t[a] = [b]\r\n if b in t: t[b].append(a)\r\n else: t[b] = [a]\r\n\r\nwhile True:\r\n q = [x for x in t if len(t[x]) == 1]\r\n if not q: break\r\n s += 1\r\n for x in q:\r\n if not x in t: continue\r\n y = t[x].pop()\r\n t.pop(x)\r\n \r\n if y in t:\r\n t[y].remove(x)\r\n if not t[y]: t.pop(y)\r\nprint(s)", "students, laces = [int(x) for x in input().split()]\n\nadj_lst: list = [set() for _ in range(students+1)]\nfor _ in range(laces):\n left, right = [int(x) for x in input().split()]\n adj_lst[left].add(right)\n adj_lst[right].add(left)\n\ngroups_kicked: int = 0\nwhile True:\n to_rep = set()\n for i in range(1, len(adj_lst)):\n if len(adj_lst[i]) == 1:\n adj_lst[i] = set()\n to_rep.add(i)\n\n if not len(to_rep):\n print(groups_kicked)\n break\n\n groups_kicked += 1\n for i in range(1, len(adj_lst)):\n for rascal in to_rep:\n if rascal in adj_lst[i]:\n adj_lst[i].remove(rascal)\n\n \t\t \t\t\t\t \t \t\t \t\t\t\t\t \t\t\t", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\n\n\n\n_, m = mul()\nG = defaultdict(set)\n\nfor _ in range(m):\n u, v = mul()\n G[u].add(v)\n G[v].add(u)\n\ngroups = 0\n\nwhile True:\n onelacers = {u for u in G if len(G[u]) == 1}\n if not onelacers:\n break\n groups += 1\n for u in onelacers:\n if G[u]:\n G[G[u].pop()].remove(u)\n\nprint(groups)\n", "n, m = map(int, input().split())\r\nl = []\r\npeop = []\r\nk = 0\r\nfor i in range(m):\r\n o = list(map(str, input().split()))\r\n for i in range(2):\r\n l.append(o[i])\r\n peop.append(o[i])\r\nd = True\r\npeop = list(set(peop))\r\nwhile len(l) > 0:\r\n com = 0\r\n l_1 = []\r\n for i in range(len(peop)):\r\n if l.count(peop[i]) == 1:\r\n com += 1\r\n l_1.append(peop[i])\r\n while len(l_1) > 0:\r\n if len(l) == 0:\r\n break\r\n cur = l.index(l_1[0])\r\n peop.remove(l_1[0])\r\n l_1.remove(l[cur])\r\n if cur % 2 == 0:\r\n if l[cur + 1] in l_1:\r\n l_1.remove(l[cur + 1])\r\n l.pop(cur)\r\n l.pop(cur)\r\n else:\r\n if l[cur - 1] in l_1:\r\n l_1.remove(l[cur - 1])\r\n l.pop(cur)\r\n l.pop(cur - 1)\r\n if com == 0:\r\n break\r\n k += 1\r\nprint(k)", "n, m= map(int, input().split())\r\nshoes= [[] for _ in range(n+1)]\r\nfor _ in range(m):\r\n a, b= map(int, input().split())\r\n shoes[a] += [b]\r\n shoes[b] += [a]\r\n\r\ncount= 0\r\nwhile 1:\r\n v= []\r\n for i in range(len(shoes)):\r\n if len(shoes[i]) == 1:\r\n v.append(i)\r\n\r\n if v:\r\n for i in v:\r\n shoes[i]= []\r\n for x in shoes:\r\n if i in x:\r\n x.remove(i)\r\n count += 1\r\n else:\r\n break\r\nprint(count)\r\n", "n, m = list(map(int, input().split()))\r\nGraph = [[] for i in range(1, n + 1)]\r\ncount = [0 for i in range(1, n + 1)]\r\nfor _ in range(m):\r\n s, e = list(map(int, input().split()))\r\n Graph[s - 1].append(e - 1)\r\n Graph[e - 1].append(s - 1)\r\n count[s - 1] += 1\r\n count[e - 1] += 1\r\n\r\n\r\n\r\nres = 0\r\nfor i in range(n):\r\n check = False\r\n temp = count.copy()\r\n for j in range(n):\r\n \r\n if count[j] == 1:\r\n check = True\r\n for adjvertex in Graph[j]:\r\n temp[adjvertex] -= 1\r\n temp[j] -= 1\r\n count = temp\r\n\r\n if check:\r\n res += 1\r\n else:\r\n break\r\n\r\nprint(res)", "n, m = map(int, input().split())\r\ngraph = {}\r\nfor _ in range(m):\r\n a, b = map(int, input().split())\r\n try:\r\n graph[a].append(b)\r\n except:\r\n graph[a] = [b]\r\n try:\r\n graph[b].append(a)\r\n except:\r\n graph[b] = [a]\r\ncnt = 0\r\nwhile True:\r\n pretend = []\r\n for el in graph:\r\n if len(graph[el]) == 1:\r\n pretend.append(el)\r\n if pretend == []: break\r\n for student1 in pretend:\r\n graph[student1] = []\r\n for student2 in graph:\r\n if student1 in graph[student2]:\r\n graph[student2].remove(student1)\r\n cnt += 1\r\nprint(cnt)", "n,m = map(int,input().split())\r\nmatrix = [(n+1)*[0] for _ in range(n+1)]\r\nfor i in range(m):\r\n a,b = map(int,input().split())\r\n matrix[a][b] = 1\r\nsummition = 0\r\nwhile True:\r\n toberemoved = []\r\n for person in range(1,n+1):\r\n tied = []\r\n for i in range(1,n+1):\r\n if len(tied)>1:\r\n break\r\n if matrix[person][i] ==1:\r\n tied.append((person,i))\r\n for j in range(1,n+1):\r\n if len(tied)>1:\r\n break\r\n if matrix[j][person] ==1:\r\n tied.append((j,person))\r\n if len(tied) == 1:\r\n toberemoved.append(tied[0])\r\n \r\n if len(toberemoved)==0:\r\n print(summition)\r\n break\r\n else:\r\n summition+=1\r\n for x,y in toberemoved:\r\n matrix[x][y] = 0", "n, m = map(int, input().split())\nedge, edge_vis = {}, {}\ndegrees = (n + 1) * [0] \nres = 0\nfor i in range(m):\n u, v = map(int, input().split())\n degrees[u] += 1\n degrees[v] += 1\n edge[i] = (u, v)\n \nwhile True:\n v = []\n g = False\n for i in range(m):\n p = edge[i]\n if (degrees[p[0]] == 1 or degrees[p[1]] == 1) and not edge_vis.get(p, False):\n v.append(p)\n g = True\n for j in range(len(v)):\n degrees[v[j][0]] -= 1\n degrees[v[j][1]] -= 1\n edge_vis[v[j]] = True \n if not g: \n break\n else:\n res += 1\nprint(res)\n\n \t\t\t \t \t\t \t \t \t\t\t\t \t \t", "n, m = map(int, input().split())\r\n\r\nadj = [[0] * n for _ in range(n)]\r\ndeg = [0] * n\r\n\r\nfor _ in range(m):\r\n a, b = map(lambda x: int(x) - 1, input().split())\r\n adj[a][b] = adj[b][a] = 1\r\n deg[a] += 1\r\n deg[b] += 1\r\n\r\ncnt = 0\r\n\r\nwhile True:\r\n group_list = []\r\n for i in range(n):\r\n if deg[i] == 1:\r\n group_list.append(i)\r\n\r\n if len(group_list) == 0:\r\n break\r\n\r\n cnt += 1\r\n\r\n for i in group_list:\r\n if adj[i].count(1) == 0:\r\n continue\r\n\r\n j = adj[i].index(1)\r\n deg[i] = 0\r\n deg[j] -= 1\r\n adj[i][j] = adj[j][i] = 0\r\n\r\nprint(cnt)\r\n", "import math\nimport re\nfrom fractions import Fraction\nfrom collections import Counter\n\nclass Task:\n peoples = []\n answer = 0\n \n def __init__(self):\n n, m = [int(x) for x in input().split()]\n self.peoples = [set() for i in range(0, n)]\n for _ in range(m):\n x, y = [int(x) - 1 for x in input().split()]\n self.peoples[x].add(y)\n self.peoples[y].add(x)\n\n def solve(self):\n peoples = self.peoples\n while True:\n badChilds = set()\n for i in range(0, len(peoples)):\n if len(peoples[i]) == 1:\n badChilds.add(i)\n\n if len(badChilds) == 0:\n break\n self.answer += 1\n\n for i in range(0, len(peoples)):\n if i in badChilds:\n peoples[i] = set()\n continue\n peoples[i].difference_update(badChilds)\n\n def printAnswer(self):\n print(self.answer)\n\ntask = Task()\ntask.solve()\ntask.printAnswer()\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()\n pass\n\n\ndef solve(bindings):\n groups = 0\n while True:\n toRemove = []\n newGroup = False\n for stud, bindSet in bindings.items():\n if len(bindSet) == 1:\n newGroup = True\n k = bindSet.pop()\n bindSet.add(k)\n toRemove.append((k, stud))\n\n if newGroup == True:\n for key, val in toRemove:\n try:\n bindings[key].remove(val)\n bindings[val].remove(key)\n except:\n pass\n groups += 1\n else:\n break\n\n return groups\n\n\ndef readinput():\n students, laces = getInts()\n bindings = defaultdict(set)\n for _ in range(laces):\n a, b = getInts()\n bindings[a].add(b)\n bindings[b].add(a)\n print(solve(bindings))\n\n\nreadinput()\n", "m, n = map(int, input().split())\r\n\r\nadjList = [[] for i in range(m)]\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n adjList[a-1].append(b)\r\n adjList[b-1].append(a)\r\n\r\ncount = 0\r\n\r\nwhile True:\r\n\r\n v = []\r\n\r\n for i in range(0, m):\r\n\r\n if len(adjList[i]) == 1:\r\n\r\n popped = adjList[i].pop(0)\r\n v.append((i+1, popped))\r\n\r\n # adjList[popped-1].remove(i+1)\r\n\r\n for i in range(len(v)):\r\n if adjList[v[i][1]-1]:\r\n adjList[v[i][1]-1].remove(v[i][0])\r\n\r\n if len(v):\r\n count += 1\r\n else:\r\n break\r\n\r\nprint(f'{count}')", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \nn, m = rl()\ngraph = [set() for _ in range(n)]\nfor _ in range(m):\n u, v = rl()\n u, v, = u - 1, v - 1\n graph[u].add(v)\n graph[v].add(u)\nans = 0\nwhile True: \n bad_boys = set()\n for u in range(n):\n if len(graph[u]) == 1:\n bad_boys.add(u)\n if len(bad_boys) == 0:\n break\n ans += 1\n for u in bad_boys:\n graph[u]=set()\n for v in range(n):\n graph[v].discard(u)\nprint(ans)\n \n\n\n", "import os,io\nfrom sys import stdout\nimport collections\n# import random\n# import math\n# from operator import itemgetter\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\n# from collections import Counter\n# from decimal import Decimal\n# import heapq\n# from functools import lru_cache\n\n# import sys\n# import threading\n# sys.setrecursionlimit(10**6)\n# threading.stack_size(102400000)\n\n# from functools import lru_cache\n# @lru_cache(maxsize=None)\n\n######################\n# --- Maths Fns --- #\n######################\ndef primes(n):\n sieve = [True] * n\n for i in range(3,int(n**0.5)+1,2):\n if sieve[i]:\n sieve[i*i::2*i]=[False]*((n-i*i-1)//(2*i)+1)\n return [2] + [i for i in range(3,n,2) if sieve[i]]\n\ndef binomial_coefficient(n, k):\n if 0 <= k <= n:\n ntok = 1\n ktok = 1\n for t in range(1, min(k, n - k) + 1):\n ntok *= n\n ktok *= t\n n -= 1\n return ntok // ktok\n else:\n return 0\n\ndef powerOfK(k, max):\n if k == 1:\n return [1]\n if k == -1:\n return [-1, 1]\n\n result = []\n n = 1\n while n <= max:\n result.append(n)\n n *= k\n return result\n\ndef divisors(n):\n i = 1\n result = []\n while i*i <= n:\n if n%i == 0:\n if n/i == i:\n result.append(i)\n else:\n result.append(i)\n result.append(n/i)\n i+=1\n return result\n\n# @lru_cache(maxsize=None)\ndef digitsSum(n):\n if n == 0:\n return 0\n r = 0\n while n > 0:\n r += n % 10\n n //= 10\n return r\n\n######################\n# ---- GRID Fns ---- #\n######################\ndef isValid(i, j, n, m):\n return i >= 0 and i < n and j >= 0 and j < m\n\ndef print_grid(grid):\n for line in grid:\n print(\" \".join(map(str,line)))\n\n######################\n# ---- MISC Fns ---- #\n######################\ndef kadane(a,size):\n max_so_far = 0\n max_ending_here = 0\n\n for i in range(0, size):\n max_ending_here = max_ending_here + a[i]\n if (max_so_far < max_ending_here):\n max_so_far = max_ending_here\n\n if max_ending_here < 0:\n max_ending_here = 0\n return max_so_far\n\ndef prefixSum(arr):\n for i in range(1, len(arr)):\n arr[i] = arr[i] + arr[i-1]\n return arr\n\ndef ceil(n, d):\n if n % d == 0:\n return n // d\n else:\n return (n // d) + 1\n\n# INPUTS --------------------------\n# s = input().decode('utf-8').strip()\n# n = int(input())\n# l = list(map(int, input().split()))\n# t = int(input())\n# for _ in range(t):\n# for _ in range(t):\n\nn, k = list(map(int, input().split()))\nadj = collections.defaultdict(set)\nfor _ in range(k):\n u, v = list(map(int, input().split()))\n adj[u].add(v)\n adj[v].add(u)\n\nr = 0\nwhile True:\n toremove = []\n for u,v in adj.items():\n if len(v) == 1:\n peer = list(v)[0]\n toremove.append((peer, u))\n\n if len(toremove):\n r += 1\n for u, v in toremove:\n if u in adj and v in adj[u]:\n adj[u].remove(v)\n if v in adj and u in adj[v]:\n adj[v].remove(u)\n if not len(adj[u]):\n del adj[u]\n if not len(adj[v]):\n del adj[v]\n else:\n break\nprint(r)\n", "n,m=map(int,input().split())\r\nL=[set() for i in range(n+1)]\r\nfor i in range(m) :\r\n a,b=map(int,input().split())\r\n L[a].add(b)\r\n L[b].add(a)\r\nk=0\r\nwhile True:\r\n f=False\r\n torem=[]\r\n for i in range(1,n+1) :\r\n if len(L[i])==1 :\r\n f=True\r\n \r\n torem.append(i)\r\n \r\n if f :\r\n k+=1\r\n \r\n for x in torem :\r\n w=list(L[x])\r\n \r\n if len(w)==1 :\r\n q=w[0]\r\n \r\n if x in L[q] :\r\n L[q].remove(x)\r\n\r\n L[x].clear()\r\n else :\r\n break\r\nprint(k)\r\n", "\r\nfrom collections import defaultdict\r\n\r\nI = lambda: map(int, input().split())\r\n\r\nn, m = I()\r\n\r\nG = defaultdict(set)\r\n\r\nfor i in range(m):\r\n u,v = I()\r\n G[u].add(v)\r\n G[v].add(u)\r\n\r\ncnt = 0\r\n\r\nwhile True:\r\n store = {u for u in G if len(G[u]) == 1}\r\n if not store :\r\n break\r\n cnt+=1\r\n for u in store:\r\n if G[u]:\r\n G[G[u].pop()].remove(u)\r\n \r\nprint(cnt)", "n,m=[int(x) for x in input().split(\" \")]\r\nc=0\r\nfreq={}\r\nf={}\r\nfor i in range(m):\r\n a,b=[int(x) for x in input().split(\" \")]\r\n if (a in freq): \r\n freq[a].append(b)\r\n f[a]+=1\r\n else: \r\n freq[a] = [b]\r\n f[a]=1\r\n if (b in freq): \r\n freq[b].append(a)\r\n f[b]+=1\r\n else: \r\n freq[b] = [a]\r\n f[b]=1\r\nwhile 1:\r\n if 1 in f.values():\r\n c+=1\r\n l = [key for (key, value) in f.items() if value == 1]\r\n for i in l:\r\n f[i]=0\r\n for j in freq[i]:\r\n f[j]-=1\r\n else:\r\n break\r\nprint(c) \r\n\r\n", "n, m = map(int, input().split())\r\nlaces = [list(map(int, input().split())) for _ in range(m)]\r\n\r\nans = 0\r\n\r\nwhile True:\r\n \r\n deleted_list = [index for index in range(1, n + 1) if sum([lace.count(index) for lace in laces]) == 1]\r\n \r\n if len(deleted_list) == 0:\r\n break\r\n\r\n for idx in range(len(laces) - 1, -1, -1):\r\n if laces[idx][0] in deleted_list or laces[idx][1] in deleted_list:\r\n laces[idx] = [0, 0]\r\n \r\n ans += 1\r\n\r\nprint(ans)", "n,m=map(int,input().split())\r\nfull_lis=[]\r\ntemp=[]\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n full_lis.append(a)\r\n full_lis.append(b)\r\n \r\nans=0\r\nwhile True:\r\n temp.clear()\r\n for i in range(1,n+1):\r\n if full_lis.count(i)==1:temp.append(i)\r\n if len(temp)==0:break\r\n for x in temp:\r\n if full_lis.count(x)==1:\r\n delt=full_lis.index(x)\r\n if delt%2==0:\r\n full_lis.pop(delt)\r\n full_lis.pop(delt)\r\n else:\r\n full_lis.pop(delt)\r\n full_lis.pop(delt-1)\r\n ans+=1\r\n \r\nprint(ans)\r\n\r\n\r\n \r\n ", "from collections import defaultdict as df\r\nd=df(list)\r\nn,m=list(map(int,input().split()))\r\nfor i in range(m):\r\n a,b=list(map(int,input().split()))\r\n d[a].append(b)\r\n d[b].append(a)\r\ngroups=0\r\nflag=0\r\nfor i in d:\r\n if len(d[i])==1:\r\n flag=1\r\n break\r\nif flag==0:\r\n print(0)\r\nelse:\r\n flag=1\r\n #print(d)\r\n while(len(d)>0 and flag==1):\r\n flag=0\r\n todel=[]\r\n adja=[]\r\n gota=0\r\n for i in list(d):\r\n if len(d[i])==1:\r\n flag=1\r\n todel.append(i)\r\n \r\n adja.append((d[i][0],i))\r\n del d[i]\r\n gota=1\r\n for i in adja:\r\n if i[0] in d:\r\n index=d[i[0]].index(i[1])\r\n d[i[0]].pop(index)\r\n if gota==1:\r\n groups+=1\r\n print(groups)\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n, m = tuple(int(x) for x in input().split())\nadjacency_list = [set() for i in range(n)]\nfor i in range(m):\n x, y = tuple(int(x) for x in input().split())\n adjacency_list[x-1].add(y-1)\n adjacency_list[y-1].add(x-1)\nres = 0\nwhile True:\n reprimand = []\n for i in range(n):\n if len(adjacency_list[i]) == 1:\n reprimand.append(i)\n adjacency_list[i] = set()\n if not reprimand:\n break\n res += 1\n for i in reprimand:\n for j in range(n):\n if i in adjacency_list[j]:\n adjacency_list[j].remove(i)\nprint(res)\n \t\t \t \t\t\t \t \t \t \t \t \t", "n,m=map(int,input().split(' '))\r\nlace=[]\r\n\r\nfor i in range(m):\r\n lace.append(list(map(int,input().split(' '))))\r\n\r\nCount=[0]*(n+1)\r\n\r\nfor i in range(len(lace)):\r\n for j in range(2):\r\n Count[lace[i][j]]+=1\r\n\r\n\r\nans=0\r\nwhile True:\r\n delete=[]\r\n for k in range(len(Count)):\r\n if Count[k]==1:\r\n delete.append(k)\r\n if len(delete)==0:\r\n print(ans)\r\n break\r\n else:\r\n ans+=1\r\n for i in range(len(lace)-1,-1,-1):\r\n for j in range(len(delete)):\r\n if lace[i][0]==delete[j] or lace[i][1]==delete[j]:\r\n Count[lace[i][0]] -= 1\r\n Count[lace[i][1]] -= 1\r\n lace.pop(i)\r\n break\r\n\r\n\r\n\r\n'''\r\n6 3\r\n1 2\r\n2 3\r\n3 4\r\n'''", "import sys \r\nfrom collections import defaultdict\r\ninput = sys.stdin.readline \r\n\r\nn, m = map(int, input().split())\r\nd = defaultdict(list)\r\nfor i in range(m):\r\n u, v = map(int, input().split())\r\n d[u].append(v)\r\n d[v].append(u)\r\n \r\nc = 0 \r\nfor i in range(n):\r\n l = 0\r\n r = []\r\n for j in range(1, n + 1):\r\n if(len(d[j]) == 1):\r\n r.append([d[j][0], j])\r\n l += 1 \r\n \r\n if(l):\r\n c += 1 \r\n for j in r:\r\n a = j[0]\r\n if(a in d):\r\n d[a].remove(j[1])\r\n del d[j[1]]\r\n # print(d)\r\n else:\r\n break \r\nprint(c)\r\n ", "n,m=list(map(int,input().split()))\r\nl=[0]*n\r\ngraph={}\r\nfor i in range(m):\r\n a,b=map(int,input().split())\r\n if graph.get(a-1,0)==0:\r\n graph[a-1]=[]\r\n graph[a-1].append(b-1)\r\n if graph.get(b-1,0)==0:\r\n graph[b-1]=[]\r\n graph[b-1].append(a-1)\r\n l[a-1]+=1\r\n l[b-1]+=1\r\ncount=0\r\nwhile True:\r\n flag=False\r\n l1=l.copy()\r\n for i in range(n):\r\n if l[i]==1:\r\n flag=True\r\n l1[i]=0\r\n for j in graph[i]:\r\n l1[j]-=1\r\n if flag==False:\r\n break\r\n count+=1\r\n l=l1.copy()\r\nprint(count)", "n, m = map(int, input().split())\r\na = []\r\nfor i in range(n+1):\r\n a.append([])\r\nfor i in range(m):\r\n b, c = map(int, input().split())\r\n a[b].append(c)\r\n a[c].append(b)\r\nx = 1\r\ns = 0\r\nwhile x!=0:\r\n x = 0\r\n b = []\r\n for i in range(1, n+1):\r\n if len(a[i])==1 and a[i][0] not in b:\r\n b.append(i)\r\n x = 1\r\n for i in b:\r\n q = a[a[i][0]].index(i)\r\n a[a[i][0]] = a[a[i][0]][:q] + a[a[i][0]][q + 1:]\r\n a[i] = []\r\n if x>0:\r\n s+=1\r\nprint(s)", "from collections import deque\n\nmod = 10**9 + 7\nmod1 = 998244353\ninf = float('inf')\nmxn = 101\n\ndef solve():\n global n, m, adj, degree\n n, m = map(int, input().split())\n adj = [[] for _ in range(mxn)]\n degree = [0] * mxn\n \n for i in range(1, n+1):\n degree[i] = 0\n \n for i in range(m):\n u, v = map(int, input().split())\n adj[u].append(v)\n adj[v].append(u)\n degree[u] += 1\n degree[v] += 1\n \n ans = 0\n q = deque()\n \n for i in range(1, n+1):\n if degree[i] == 1:\n q.append((i, 1))\n \n while q:\n node, batch = q.popleft()\n \n if degree[node] == 0:\n continue\n \n ans = max(ans, batch)\n \n for x in adj[node]:\n degree[x] -= 1\n \n if degree[x] == 1:\n q.append((x, batch + 1))\n \n degree[node] -= 1\n \n print(ans)\n\nif __name__ == \"__main__\":\n solve()\n\n \t\t\t \t\t \t\t\t\t\t \t \t \t\t\t \t" ]

[ "def main():\r\n n, m, k = map(int, input().split())\r\n lst = [[0] * m for _ in range(n)]\r\n rows = {}\r\n cols = {}\r\n for i in range(k):\r\n q, idx, a = map(int, input().split())\r\n if q == 1:\r\n rows[idx - 1] = (a, i)\r\n else:\r\n cols[idx - 1] = (a, i)\r\n\r\n for r in range(n):\r\n for c in range(m):\r\n if r in rows and c in cols:\r\n if rows[r][1] > cols[c][1]:\r\n lst[r][c] = rows[r][0]\r\n else:\r\n lst[r][c] = cols[c][0]\r\n elif r in rows and c not in cols:\r\n lst[r][c] = rows[r][0]\r\n elif r not in rows and c in cols:\r\n lst[r][c] = cols[c][0]\r\n\r\n for e in lst:\r\n print(*e)\r\n \r\n \r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n, m, k = [ int(x) for x in input().split() ]\n \ninstante_linhas = [0] * n\ninstante_colunas = [0] * m\ncores = [0] * (k + 1)\n \nfor i in range(k):\n op, lc, cor = [ int(x) for x in input().split() ]\n \n cores[i + 1] = cor\n if op == 1:\n instante_linhas[lc - 1] = i + 1\n elif op == 2:\n instante_colunas[lc - 1] = i + 1\n \nresp = \"\"\nfor i in range(n):\n for j in range(m):\n resp += str(cores[max(instante_linhas[i], instante_colunas[j])])\n if j != m - 1:\n resp += \" \"\n if i != n - 1: \n resp += \"\\n\"\n \nprint(resp)\n\t \t \t\t \t\t \t \t\t\t\t\t\t\t \t", "#!/usr/bin/python3\n\nn, m, k = list(map(int, input().split()))\n# n, m, k = 4, 5, 4\n\nrows = [(-1,0)] * n\ncols = [(-1,0)] * m\n\nfor q in range(k):\n\tt, i, color = list(map(int, input().split()))\n\ti -= 1\n\tif t == 1:\n\t\trows[i] = (q, color)\n\telse:\n\t\tcols[i] = (q, color)\n\nfor r in range(n):\n\trow = rows[r]\n\tfor c in range(m):\n\t\tcol = cols[c]\n\n\t\tcolor = max(row, col)[1]\n\t\tprint(color, end=' ')\n\tprint()\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,k=map(int,input().split()) ; col=[(0,0)]*m ; row=[(0,0)]*n \r\nfor i in range(1,k+1):\r\n t,nu,c=map(int,input().split())\r\n if t&1:\r\n row[nu-1]=(i,c)\r\n else:\r\n col[nu-1]=(i,c)\r\nfor i in range(n):\r\n for j in range(m):\r\n if col[j]>=row[i]:\r\n print(col[j][1],end=\" \")\r\n else:\r\n print(row[i][1],end=\" \")\r\n print()", "n,m,k=map(int,input().split())\r\nl=[0]\r\nr=[0]*(n)\r\nc=[0]*(m)\r\nans=[['0']*m for _ in range(n)]\r\nfor i in range(1,k+1):\r\n num,x,a=map(int,input().split())\r\n l+=[a]\r\n if num==1:\r\n r[x-1]=i\r\n else:\r\n c[x-1]=i\r\nfor i in range(n):\r\n for j in range(m):\r\n if r[i]>c[j]: ans[i][j]=str(l[r[i]])\r\n else: ans[i][j]=str(l[c[j]])\r\nprint('\\n'.join(map(' '.join,ans)))", "n, m , k = map(int, input().split())\r\na = [(0, -1)] * n\r\nb = [(0, -1)] * m\r\nfor i in range(k):\r\n t, pl, col = map(int, input().split())\r\n if t == 1:\r\n a[pl - 1] = (col, i)\r\n else:\r\n b[pl - 1] = (col, i)\r\nfor i in range(n):\r\n for j in range(m):\r\n if a[i][1] > b[j][1]:\r\n print(a[i][0], end=' ')\r\n else:\r\n print(b[j][0], end=' ')\r\n print() \r\n", "n,m,k=[int(x)for x in input().split()]\na=[]\nr=[(0,0)]*n\nc=[(0,0)]*m\nfor i in range(n):a.append([0]*m)\nfor _ in range(k):\n x,y,z=[int(t)for t in input().split()]\n if x==1:r[y-1]=(_,z)\n else:c[y-1]=(_,z)\nfor i in range(n):\n for j in range(m):\n a[i][j]=max(r[i],c[j])[1]\n print(*a[i])\n\n\n\n\n", "import sys\ndef input(): return sys.stdin.readline().strip()\n\nn, m, k = map(int, input().split())\ntable = [[0 for i in range(m)]for j in range(n)]\n\ndef row_col(x, a):\n\tfor i in range(m):\n\t\tif not table[x][i]:\n\t\t\ttable[x][i] = a \ndef col_col(x, a):\n\tfor i in range(n):\n\t\tif not table[i][x]:\n\t\t\ttable[i][x] = a\n\ncolor = [[0, 0, 0] for i in range(n+m)]\nfor i in range(k):\n\tt, r, a = map(int, input().split()) \n\tcolor[(t-1)*n+(r-1)] = [i, (t-1)*n+(r-1), a]\n\ncolor.sort(reverse=True)\n# print(color)\nfor i in range(n+m):\n\tif not color[i][2]:\n\t\tbreak\n\n\tif color[i][1] >= n:\n\t\tx = color[i][1]-n\n\t\tfor j in range(n):\n\t\t\tif not table[j][x]:\n\t\t\t\ttable[j][x] = color[i][2]\n\n\telse:\n\t\tx = color[i][1]\n\t\tfor j in range(m):\n\t\t\tif not table[x][j]:\n\t\t\t\ttable[x][j] = color[i][2]\n\nfor i in range(n):\n\tfor j in range(m):\n\t\tprint(table[i][j], end=\" \")\n\tprint()\n\n", "n, m, k = (int(i) for i in input().split(' '))\nsheet = [\n [0 for j in range(m)] for i in range(n)\n ]\n\nnum_rows = n\nnum_cols = m\nnum_ops = k\n\ndef print_sheet(sheet):\n for row in sheet:\n print(' '.join(str(cell) for cell in row))\n\ndef paint_row(ri, color):\n row = sheet[ri]\n for i in range(num_cols):\n row[i] = color\n\n\ndef paint_col(ci, color):\n for i in range(num_rows):\n sheet[i][ci] = color\n\n\n\nrow_paints = {}\ncol_paints = {}\n\ndef prepaint_row(ri, color, op_num):\n row_paints[ri] = (color, op_num)\n\ndef prepaint_col(ci, color, op_num):\n col_paints[ci] = (color, op_num)\n\nfor i in range(k):\n op, index, color = (int(i) for i in input().split(' '))\n if op == 1:\n prepaint_row(index - 1, color, i)\n else:\n prepaint_col(index - 1, color, i)\n\n\nall_ops = []\nROW = 1\nCOL = 2\nfor ri, value in row_paints.items():\n all_ops.append([ROW, ri, value[0], value[1]])\n\nfor ci, value in col_paints.items():\n all_ops.append([COL, ci, value[0], value[1]])\n\nfrom operator import itemgetter\nall_ops.sort(key=itemgetter(3))\n\nfor op, index, color, i in all_ops:\n if op == ROW:\n paint_row(index, color)\n else:\n paint_col(index, color)\n\nprint_sheet(sheet)", "'''input\n5 3 5\n1 1 1\n1 3 1\n1 5 1\n2 1 1\n2 3 1\n'''\nimport math\nfrom sys import stdin, stdout\n\n\n# main starts\nn, m, k = list(map(int, stdin.readline().split()))\nrow_p = [0] * n\ncol_p = [0] * m\nrow_c = [0] * n\ncol_c = [0] * m\nfor i in range(1, k + 1):\n\tt, num, color = list(map(int, stdin.readline().split()))\n\tnum -= 1\n\tif t == 1:\n\t\trow_c[num] = color\n\t\trow_p[num] = i\n\telse:\n\t\tcol_c[num] = color\n\t\tcol_p[num] = i\n\nmatrix = [[0 for x in range(m)] for y in range(n)]\n# print(row_p, row_c)\n# print(col_p, col_c)\n\nfor i in range(n):\n\tfor j in range(m):\n\t\tif row_p[i] > col_p[j]:\n\t\t\tmatrix[i][j] = row_c[i]\n\t\telse:\n\t\t\tmatrix[i][j] = col_c[j]\nfor i in range(n):\n\tprint(*matrix[i])\n\n\n\n\n\n\n", "read = lambda: map(int, input().split())\r\nn, m, k = read()\r\nc = [(0, 0)] * m\r\nr = [(0, 0)] * n\r\nfor i in range(k):\r\n t, a, x = read()\r\n if t == 1: r[a - 1] = i + 1, x\r\n else: c[a - 1] = i + 1, x\r\na = [[0] * m for i in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n a[i][j] = c[j][1] if c[j][0] > r[i][0] else r[i][1]\r\n[print(*i) for i in a]\r\n", "n, m, k = map(int, input().split())\r\n\r\nrsv = [0 for _ in range(n)]\r\nrsi = [-1 for _ in range(n)]\r\ncsv = [0 for _ in range(m)]\r\ncsi = [-1 for _ in range(m)]\r\n\r\nfor i in range(k):\r\n t, j, a = map(int, input().split())\r\n j -= 1\r\n if t == 1:\r\n rsv[j] = a\r\n rsi[j] = i\r\n else:\r\n csv[j] = a\r\n csi[j] = i\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if rsi[i] > csi[j]:\r\n print(rsv[i], end=' ')\r\n else:\r\n print(csv[j], end=' ')\r\n print('')\r\n\r\n", "def process_input():\r\n n, m, k = map(int, input().split())\r\n\r\n rows = {}\r\n cols = {}\r\n\r\n for p in range(1, k+1):\r\n o, i, a = input().split()\r\n if o == '1':\r\n rows[int(i)] = a, p\r\n else:\r\n cols[int(i)] = a, p\r\n\r\n return n, m, rows, cols\r\n\r\n\r\ndef generate_output(n, m, rows, cols):\r\n for r in range(1, n+1):\r\n ra, rp = rows[r] if r in rows else ('0', 0)\r\n row = []\r\n for c in range(1, m+1):\r\n ca, cp = cols[c] if c in cols else ('0', 0)\r\n row.append(ca if cp > rp else ra)\r\n print(' '.join(row))\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m, rows, cols = process_input()\r\n generate_output(n, m, rows, cols)\r\n", "n, m, k = map (int, input ().split())\r\nTimeA = [0] * n; TimeB = [0] * m; color = [0] * 100009\r\nfor i in range (1, k + 1) :\r\n choice, type, color[i] = map (int, input ().split ())\r\n if choice == 1 :\r\n TimeA[type - 1] = i\r\n else :\r\n TimeB[type - 1] = i\r\nfor i in range (n) :\r\n for j in range (m) :\r\n print (color [max (TimeA[i], TimeB[j])], end = ' ')\r\n print ()\r\n", "from collections import defaultdict\n\nn, m, k = map(int, input().split())\n\nans = [[0 for _ in range(m)] for _ in range(n)]\nrows = defaultdict()\ncols = defaultdict()\n\nfor i in range(k):\n a, b, c = map(int, input().split())\n if a == 1:\n rows[b-1] = (c, i)\n if a == 2:\n cols[b-1] = (c, i)\n\nfor i in range(n):\n for j in range(m):\n if rows.get(i) is None and cols.get(j) is None:\n print(0, end=\" \")\n elif rows.get(i) is None:\n print(cols[j][0], end=\" \")\n elif cols.get(j) is None:\n print(rows[i][0], end=\" \")\n else:\n rc, rt = rows[i]\n cc, ct = cols[j]\n if rt > ct:\n print(rows[i][0], end=\" \")\n else:\n print(cols[j][0], end=\" \")\n print()\n", "def main():\n n, m, k = map(int, input().split())\n B1 = [[0, 0, 0, 0] for i in range(n)]\n B2 = [[0, 0, 0, 0] for i in range(m)]\n for i in range(k):\n a, b, c = map(int, input().split())\n b -= 1\n if a == 1:\n B1[b] = [i, a, b, c]\n else:\n B2[b] = [i, a, b, c]\n\n C = sorted(B1 + B2, key = lambda x: x[0])\n\n A = [[0] * m for i in range(n)]\n \n for i in range(len(C)):\n x, a, b, c = C[i]\n if a == 1:\n A[b] = [c] * m\n elif a == 2:\n for j in range(n):\n A[j][b] = c\n for row in A:\n print(' '.join(map(str, row)))\n\n\nmain()", "s = input()\r\ns = s.split(' ')\r\nn = int(s[0])\r\nm = int(s[1])\r\nk = int(s[2])\r\nRows = [0 for i in range(n)]\r\nColomnes = [0 for i in range(m)]\r\nColors = [0 for i in range(k+1)]\r\nfor i in range(k):\r\n s = input()\r\n s = s.split(' ')\r\n rorc = int(s[0])\r\n num = int(s[1])\r\n Colors[i+1] = int(s[2])\r\n if rorc == 1:\r\n Rows[num-1] = i+1;\r\n else:\r\n Colomnes[num-1] = i+1;\r\nfor i in range(n):\r\n for j in range(m):\r\n print (Colors[max(Rows[i],Colomnes[j])], end = ' ')\r\n print()", "n, m, k = map(int, input().split())\r\narr = [[0 for i in range(m)] for j in range(n)]\r\n\r\n\r\nrows = dict()\r\ncols = dict()\r\n\r\ncount = 0\r\nfor i in range(k):\r\n a, b, c = map(int, input().split())\r\n if a == 1:\r\n rows[b-1] = (c, count)\r\n else:\r\n cols[b-1] = (c, count)\r\n\r\n count += 1\r\n\r\n\r\nfor k, v in rows.items():\r\n arr[k] = [v] * m\r\n\r\nfor k, v in cols.items():\r\n color, ts = v\r\n\r\n for j in range(n):\r\n if arr[j][k] == 0:\r\n arr[j][k] = color\r\n else:\r\n if arr[j][k][1] < ts:\r\n arr[j][k] = color\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if not isinstance(arr[i][j], int):\r\n arr[i][j] = arr[i][j][0]\r\n\r\nfor i in arr:\r\n print(*i)", "(n, m, k) = map(int, input().split(' '))\r\n\r\nans = 0\r\n\r\nlft = [(0, 0) for _ in range(n)]\r\ntop = [(0, 0) for _ in range(m)]\r\n\r\nfor i in range(k):\r\n tp, rc, a = map(int, input().split(' '))\r\n\r\n if tp == 1:\r\n lft[rc - 1] = (i + 1, a)\r\n else:\r\n top[rc - 1] = (i + 1, a)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n color = lft[i][1]\r\n if top[j][0] > lft[i][0]:\r\n color = top[j][1]\r\n\r\n print(color, end=' ')\r\n print()\r\n", "s = input()\r\nnum = [int(x) for x in s.split()]\r\nn,m,k = num[0],num[1],num[2]\r\nmat = [[0 for x in range(m)] for x in range(n)] \r\ncT = [0 for x in range(m)]\r\nrT = [0 for x in range(n)]\r\ncV = [0 for x in range(m)]\r\nrV = [0 for x in range(n)]\r\nfor i in range(1,k+1):\r\n s = input()\r\n num = [int(x) for x in s.split()]\r\n ty,j,v = num[0],num[1],num[2]\r\n j = j-1\r\n if ty is 1:\r\n rT[j] = i\r\n rV[j] = v\r\n else:\r\n cT[j] = i\r\n cV[j] = v\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if rT[i] > cT[j]:\r\n mat[i][j] = rV[i]\r\n else:\r\n mat[i][j] = cV[j]\r\n \r\nfor i in range(n):\r\n for j in range(m):\r\n if j+1 < m:\r\n print(mat[i][j],end = ' ')\r\n else:\r\n print(mat[i][j])\r\n", "n, m, k = map(int, input().split())\nultimoLinha = [0] * n\nultimoColuna = [0] * m\ncor = [0] * (k + 1)\n\nfor op in range(1, k + 1):\n o, r, cor[op] = map(int, input().split())\n if o == 1:\n ultimoLinha[r - 1] = op\n else:\n ultimoColuna[r - 1] = op\n\nfor i in range(n):\n printar = ''\n for j in range(m):\n printar += str(cor[max(ultimoColuna[j], ultimoLinha[i])])\n printar += ' '\n print(printar)\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\nR = [[(0, 0)] * 2 for i in range(max(n, m))]\r\nfor x in range(k):\r\n t, r, v = map(int, input().split())\r\n R[r - 1][t - 1] = (x, v)\r\nfor i in range(n):\r\n for j in range(m):\r\n print(max(R[i][0], R[j][1])[1], end=\" \")\r\n print()\r\n", "import sys\r\nfrom math import *\r\nfrom random 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, m, k = mints()\r\nr = [(0,-1)]*n\r\nc = [(0,-1)]*m\r\nfor i in range(k):\r\n\tt, x, a = mints()\r\n\tif t == 1:\r\n\t\tr[x-1] = (a, i)\r\n\telse:\r\n\t\tc[x-1] = (a, i)\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif r[i][1] > c[j][1]:\r\n\t\t\tprint(r[i][0], end=' ')\r\n\t\telse:\r\n\t\t\tprint(c[j][0], end=' ')\r\n\tprint()\r\n", "n, m, k = map(int, input().split())\r\n\r\nrow_color = [0] * n\r\nrow_time = [0] * n\r\ncol_color = [0] * m\r\ncol_time = [0] * m\r\n\r\nfor i in range(k):\r\n cmd, idx, color = map(int, input().split())\r\n idx -= 1\r\n if cmd == 1:\r\n row_color[idx] = color\r\n row_time[idx] = i+1\r\n else:\r\n col_color[idx] = color\r\n col_time[idx] = i+1\r\n\r\na = [[0]*m for _ in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if row_time[i] > col_time[j]:\r\n a[i][j] = row_color[i]\r\n else:\r\n a[i][j] = col_color[j]\r\nprint('\\n'.join(map(lambda row: ' '.join(map(str, row)), a)))\r\n", "n,m,k = [int(x) for x in input().split(' ')]\r\nrows = [[0,-1]]*n\r\ncols = [[0, -1]]*m\r\nfor i in range(k):\r\n tmp = [int(x) for x in input().split(' ')]\r\n if tmp[0] == 1:\r\n rows[tmp[1]-1] = [tmp[2], i]\r\n else:\r\n cols[tmp[1]-1] = [tmp[2], i]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(rows[i][0] if rows[i][1] > cols[j][1] else cols[j][0], end = ' ')\r\n print()\r\n", "n, m, k = map(int, input().split())\r\nA = [0] * n\r\nfor i in range(n):\r\n A[i] = [0,0]\r\nB = [0] * m\r\nfor i in range(m):\r\n B[i] = [0,0]\r\nfor i in range(k):\r\n per = input().split()\r\n if per[0] == '1':\r\n A[int(per[1])-1] = [int(per[2]), i+1]\r\n else:\r\n B[int(per[1])-1] = [int(per[2]), i+1]\r\nans = [0] * n\r\nfor i in range(n):\r\n ans[i] = [0] * m\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n \r\n if A[i][1] > B[j][1]:\r\n ans[i][j] = A[i][0]\r\n else:\r\n ans[i][j] = B[j][0]\r\n\r\nfor i in ans:\r\n print(' '.join(map(str,i)))", "from collections import defaultdict\r\nn,m,k = map(int, input().split())\r\n\r\nrow = defaultdict(list)\r\ncol = defaultdict(list)\r\nfor _ in range(k):\r\n t,r,p = map(int, input().split())\r\n if t == 1:\r\n if row[r]:\r\n row[r][0]=p\r\n row[r][1]=_\r\n else:\r\n row[r].append(p)\r\n row[r].append(_)\r\n else:\r\n if col[r]:\r\n col[r][0]=p\r\n col[r][1]=_\r\n else:\r\n col[r].append(p)\r\n col[r].append(_)\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n color,idx=0,-1\r\n \r\n if row[i]:\r\n color=row[i][0]\r\n idx=row[i][1]\r\n if col[j] and idx < col[j][1] :\r\n color = col[j][0]\r\n print(color,end=' ')\r\n print()\r\n \r\n \r\n ", "inp = lambda: map(int, input().split())\r\nn, m, k = inp()\r\n\r\ndata = [(0, 0, i) for i in range(n+m)]\r\n\r\nfor i in range(k):\r\n query, id, color = inp()\r\n if query == 1:\r\n data[id-1] = (i, color, id-1)\r\n else:\r\n data[id-1+n] = (i, color, id-1+n)\r\n\r\ndata.sort()\r\nfield = [[0]*m for _ in range(n)]\r\n\r\n\r\nfor _, color, id in data:\r\n if color != 0:\r\n if id < n:\r\n for i in range(m):\r\n field[id][i] = color\r\n else:\r\n for i in range(n):\r\n field[i][id-n] = color\r\n\r\nfor i in range(n):\r\n print(*field[i])", "import sys\r\n\r\n# sys.stdin = open(\"ivo.in\")\r\n\r\nn, m, k = map(int, sys.stdin.readline().split())\r\n\r\nrows = [[] for i in range(n)]\r\ncols = [[] for i in range(m)]\r\n\r\nfor i in range(k):\r\n command, num, color = map(int, sys.stdin.readline().split())\r\n num -= 1\r\n if command == 1:\r\n rows[num].append((i, color))\r\n else:\r\n cols[num].append((i, color))\r\n\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n color = 0\r\n if len(cols[j]) > 0:\r\n if len(rows[i]) > 0:\r\n if cols[j][-1][0] > rows[i][-1][0]:\r\n color = cols[j][-1][1]\r\n else:\r\n color = rows[i][-1][1]\r\n else:\r\n color = cols[j][-1][1]\r\n elif len(rows[i]) > 0:\r\n color = rows[i][-1][1]\r\n sys.stdout.write(str(color))\r\n if j + 1 < m:\r\n sys.stdout.write(\" \")\r\n else:\r\n sys.stdout.write(\"\\n\")", "n,m,k=map(int,input().split())\r\nr=[0]*n\r\nc=[0]*m\r\nt=[0]*(k+1)\r\n \r\nfor i in range(1,k+1):\r\n a,b,t[i]=map(int,input().split())\r\n if a==1:\r\n r[b-1]=i\r\n else:\r\n c[b-1]=i\r\n \r\nfor i in range(n):\r\n ans=str()\r\n for j in range(m):\r\n ans+=str(t[max(r[i],c[j])])\r\n ans+=\" \"\r\n print(ans)", "b=(list(map(int, input().split())))\r\na=[0]*5002\r\nc=[0]*5002\r\nd = [0] *5002\r\ne=[0]*5002\r\nfor i in range(1,b[2]+1):\r\n n=(list(map(int, input().split())))\r\n if n[0]==1:\r\n a[n[1]]=n[2]\r\n e[n[1]] = i\r\n else:\r\n c[n[1]]=n[2]\r\n d[n[1]]=i\r\nfor i in range(1,b[0]+1):\r\n for j in range(1,b[1]+1):\r\n if e[i]>d[j]:\r\n print(a[i],end=' ')\r\n else:\r\n print(c[j],end=' ')\r\n print('')\r\n\r\n", "import atexit\r\nimport io\r\nimport sys\r\n\r\n_INPUT_LINES = sys.stdin.read().splitlines()\r\ninput = iter(_INPUT_LINES).__next__\r\n_OUTPUT_BUFFER = io.StringIO()\r\nsys.stdout = _OUTPUT_BUFFER\r\n\r\n\r\[email protected]\r\ndef write():\r\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\n\r\n\r\nn, m, k = map(int, input().split())\r\nrow = [(0, 0)]*n\r\ncol = [(0, 0)]*m\r\n\r\nfor i in range(k):\r\n t, rc, a = map(int, input().split())\r\n rc -= 1\r\n if t == 1:\r\n row[rc] = (i, a)\r\n else:\r\n col[rc] = (i, a)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n upd = max(row[i], col[j])\r\n if upd == (0, 0):\r\n print(0,end=' ')\r\n else:\r\n print(upd[1],end=' ')\r\n print( )\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = map(int, input().split())\r\nd = [[0] * m for _ in range(n)]\r\na1 = [(0,-1) for _ in range(n)]\r\na2 = [(0,-1) for _ in range(m)]\r\n\r\nfor i in range(k):\r\n a, b, c = map(int, input().split())\r\n if a == 1:\r\n a1[b-1] = (c, i)\r\n else:\r\n a2[b-1] = (c, i)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n d[i][j] = a1[i][0] if a1[i][1] > a2[j][1] else a2[j][0]\r\n\r\nfor i in d:\r\n print(' '.join(map(str, i)))", "n, m, k = map(int, input().split())\r\nstol = [[0, -1] for i in range(m)]\r\nstrok = [[0, -1] for i in range(n)]\r\nfor i in range(k):\r\n c, ri, ai = map(int, input().split())\r\n if c == 1:\r\n strok[ri - 1][0] = ai\r\n strok[ri - 1][1] = i\r\n else:\r\n stol[ri - 1][0] = ai\r\n stol[ri - 1][1] = i\r\ndata = [[0 for i in range(m)] for j in range(n)]\r\nfor i in range(n):\r\n for j in range(m):\r\n if strok[i][1] > stol[j][1]:\r\n data[i][j] = strok[i][0]\r\n else:\r\n data[i][j] = stol[j][0]\r\nfor i in range(n):\r\n print(*data[i])", "import atexit\r\nimport io\r\nimport sys\r\n\r\n_INPUT_LINES = sys.stdin.read().splitlines()\r\ninput = iter(_INPUT_LINES).__next__\r\n\r\n_OUTPUT_BUFFER = io.StringIO()\r\nsys.stdout = _OUTPUT_BUFFER\r\[email protected]\r\ndef write():\r\n sys.__stdout__.write(_OUTPUT_BUFFER.getvalue())\r\n\r\n\r\nn,m,k = map(int,input().split()) \r\nn += 1 \r\nm += 1 \r\ngrid = [[0]*m for i in range(n)]\r\nrow = [0]*n\r\ncol = [0]*m\r\ninps = []\r\nfor i in range(k) :\r\n\tinps.append(tuple(map(int,input().split()))) \r\nbox = 0 \r\nfor i in range(k-1,-1,-1) :\r\n\tif(box == ((n-1)*(m-1))) :\r\n\t\tbreak \r\n\tif(inps[i][0] == 1) :\r\n\t\tr = inps[i][1]\r\n\t\tif(row[r] == 0) :\r\n\t\t\trow[r] = inps[i][2]\r\n\t\t\tfor j in range(1,m) :\r\n\t\t\t\tif(grid[r][j] == 0) :\r\n\t\t\t\t\tgrid[r][j] = inps[i][2]\r\n\t\t\t\t\tbox += 1\r\n\telse :\r\n\t\tr = inps[i][1]\r\n\t\tif(col[r] == 0) :\r\n\t\t\tcol[r] = inps[i][2]\r\n\t\t\tfor j in range(1,n) :\r\n\t\t\t\tif(grid[j][r] == 0) :\r\n\t\t\t\t\tgrid[j][r] = inps[i][2]\r\n\t\t\t\t\tbox += 1\r\nfor i in range(1,n):\r\n\tfor j in range(1,m):\r\n\t\tprint(grid[i][j],end= \" \")\r\n\tprint()\r\n", "def main():\n from sys import stdin\n n, m, k = map(int, input().split())\n aa = [[0] * m for _ in range(n)]\n avail = (None, [True] * n, [True] * m)\n for s in reversed(stdin.read().splitlines()):\n f, x, a = map(int, s.split())\n av = avail[f]\n x -= 1\n if av[x]:\n av[x] = False\n if f == 1:\n row = aa[x]\n for i, b in enumerate(row):\n if not b:\n row[i] = a\n else:\n for row in aa:\n if not row[x]:\n row[x] = a\n print('\\n'.join(' '.join(map(str, row)) for row in aa))\n\n\nif __name__ == '__main__':\n main()\n", "from sys import stdin, stdout\n\n\ndef solution():\n n, m, k = map(int, input().split())\n vals = []\n rows = []\n cols = []\n qrs = []\n # vals = [[0]*m]*n\n for i in range(n+1):\n vals.append([0 for c in range(m+1)])\n for i in range(n+1):\n rows.append([0, 0])\n for i in range(m+1):\n cols.append([0, 0])\n for i in range(k):\n qrs.append(list(map(int, stdin.readline().split())))\n for i in range(len(qrs)-1, -1, -1):\n if qrs[i][0] == 1:\n if rows[qrs[i][1]][0] == 0:\n rows[qrs[i][1]][0] = qrs[i][2]\n rows[qrs[i][1]][1] = i+1\n else:\n if cols[qrs[i][1]][0] == 0:\n cols[qrs[i][1]][0] = qrs[i][2]\n cols[qrs[i][1]][1] = i+1\n for i in range(1, n+1):\n for j in range(1, m+1):\n if rows[i][0] == 0 and cols[j][0] == 0:\n continue\n elif rows[i][0] != 0 and cols[j][0] != 0:\n if rows[i][1] >= cols[j][1]:\n vals[i][j] = rows[i][0]\n else:\n vals[i][j] = cols[j][0]\n elif rows[i][0] != 0:\n vals[i][j] = rows[i][0]\n elif cols[j][0] != 0:\n vals[i][j] = cols[j][0]\n for i in range(1, n+1):\n stdout.write(\" \".join(str(vals[i][j]) for j in range(1, m+1))+\"\\n\")\n\n\nt = 1\nwhile t:\n t -= 1\n solution()\n\n\t\t\t \t\t \t\t \t \t\t \t\t\t\t \t", "# HEY STALKER\r\nn, m, k = map(int, input().split())\r\ndp = [[0 for ti in range(m)] for tj in range(n)]\r\nd = {}\r\nl = []\r\nidx = {}\r\nfor t in range(k):\r\n rc, nm, cl = map(int, input().split())\r\n d[rc, nm] = cl\r\n if (rc, nm) in idx:\r\n l[idx[rc, nm]] = [-1, -1]\r\n l.append([rc, nm])\r\n idx[rc, nm] = len(l)-1\r\nq = []\r\nfor t in l:\r\n if t != [-1, -1]:\r\n q.append(t)\r\nfor t in q:\r\n cl = d[t[0], t[1]]\r\n if t[0] == 1:\r\n i = t[1]-1\r\n for j in range(m):\r\n dp[i][j] = cl\r\n else:\r\n j = t[1]-1\r\n for i in range(n):\r\n dp[i][j] = cl\r\nfor t in dp:\r\n print(*t)", "import math\r\n\r\ndef main_function():\r\n n, m, k = [int(i) for i in input().split(\" \")]\r\n matrix = [[0 for i in range(m)] for j in range(n)]\r\n hash_n = {}\r\n hash_m = {}\r\n for i in range(k):\r\n numb, x, c = [int(i) for i in input().split(\" \")]\r\n if numb == 1:\r\n hash_n[x] = (c, i)\r\n else:\r\n hash_m[x] = (c, i)\r\n for i in range(n):\r\n for j in range(m):\r\n x = i + 1\r\n y = j + 1\r\n if x not in hash_n and y not in hash_m:\r\n pass\r\n elif x in hash_n and y in hash_m:\r\n if hash_n[x][1] > hash_m[y][1]:\r\n matrix[i][j] = hash_n[x][0]\r\n else:\r\n matrix[i][j] = hash_m[y][0]\r\n elif x in hash_n:\r\n matrix[i][j] = hash_n[x][0]\r\n else:\r\n matrix[i][j] = hash_m[y][0]\r\n for i in matrix:\r\n print(\" \".join([str(u) for u in i]))\r\n\r\n\r\nmain_function()\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#main_function()", "def 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\nfrom sys import stdin\r\nfrom collections import *\r\n\r\nn, m, k = arr_inp(1)\r\nrow, col = defaultdict(list), defaultdict(list)\r\n\r\nfor i in range(k):\r\n num, x, y = arr_inp(1)\r\n if num == 1:\r\n row[x - 1] = [y, i]\r\n else:\r\n col[x - 1] = [y, i]\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if row[i]:\r\n if col[j]:\r\n print(row[i][0] if col[j][1] < row[i][1] else col[j][0], end=' ')\r\n else:\r\n print(row[i][0], end=' ')\r\n elif col[j]:\r\n if row[i]:\r\n print(row[i][0] if col[j][1] < row[i][1] else col[j][0], end=' ')\r\n else:\r\n print(col[j][0], end=' ')\r\n else:\r\n print(0, end=' ')\r\n print(end='\\n')\r\n", "import sys\r\nimport math\r\n#import 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,m,k=invr()\r\nrow=[-1]*(n+1)\r\ncr=[0]*(n+1)\r\ncol=[-1]*(m+1)\r\ncc=[0]*(m+1)\r\n\r\nfor i in range(k):\r\n\ta,b,c=invr()\r\n\tif a==1:\r\n\t\trow[b]=i+1\r\n\t\tcr[b]=c\r\n\telse:\r\n\t\tcol[b]=i+1\r\n\t\tcc[b]=c\r\n\r\nfor i in range(1,n+1):\r\n\tfor j in range(1,m+1):\r\n\t\tif row[i]>col[j]:\r\n\t\t\tprint(cr[i],end=\" \")\r\n\t\telse:\r\n\t\t\tprint(cc[j],end=\" \")\r\n\tprint()\r\n\t\r\n", "n, m, k = map(int, input().split())\r\n\r\nrow_color = [0] * n\r\nrow_time = [0] * n\r\ncol_color = [0] * m\r\ncol_time = [0] * m\r\n\r\nfor i in range(k):\r\n cmd, idx, color = map(int, input().split())\r\n idx -= 1\r\n if cmd == 1:\r\n row_color[idx] = color\r\n row_time[idx] = i+1\r\n else:\r\n col_color[idx] = color\r\n col_time[idx] = i+1\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if row_time[i] > col_time[j]:\r\n print(row_color[i], end=' ')\r\n else:\r\n print(col_color[j], end=' ')\r\n print()\r\n", "n, m, k = map(int, input().split())\r\ncanvas = [['0']*m for i in range(n)]\r\ncomands = [input().split() for i in range(k)]\r\ncolored_rows = set()\r\ncolored_columns = set()\r\nimportant_comands = []\r\nwhile comands and len(colored_rows) != n and len(colored_columns) != m:\r\n comand = comands.pop()\r\n if comand[0] == '1':\r\n if comand[1] not in colored_rows:\r\n important_comands.append(comand)\r\n colored_rows.add(comand[1])\r\n else:\r\n if comand[1] not in colored_columns:\r\n important_comands.append(comand)\r\n colored_columns.add(comand[1])\r\nfor comand in important_comands[-1::-1]:\r\n mark, number, color = comand\r\n if mark == '1':\r\n canvas[int(number)-1] = [color]*m\r\n else:\r\n for i in range(n):\r\n canvas[i][int(number)-1] = color\r\nfor i in range(n):\r\n print(\" \".join(canvas[i]))", "n, m, k = map(int, input().split())\r\nrow = [(0, 0)] * n\r\ncol = [(0, 0)] * m\r\nfor i in range(k):\r\n\tx, r, a = map(int, input().split())\r\n\tif x == 1:\r\n\t\trow[r-1] = (i+1,a)\r\n\telse:\r\n\t\tcol[r-1] = (i+1,a)\r\nary = [[0]* m for i in range(n)]\r\n\r\nfor i in range(n):\r\n\tfor j in range(m):\r\n\t\tif col[j][0] > row[i][0]:\r\n\t\t\tary[i][j] = col[j][1]\r\n\t\telse:\r\n\t\t\tary[i][j] = row[i][1]\r\nfor i in range(n):\r\n\tiar = map(str, ary[i])\r\n\tprint (\" \".join(iar))", "def fill_column(num, color):\r\n global canvas\r\n for i in range(n):\r\n canvas[i][num] = color\r\n\r\ndef fill_row(num, color):\r\n global canvas\r\n for i in range(m):\r\n canvas[num][i] = color\r\n\r\n(n, m, k) = map(int, input().split())\r\ncanvas = [[0 for j in range(m)] for i in range(n)]\r\n(T, num, color) = (0, 0, 0)\r\na = []\r\nT1 = [-1 for i in range(n)]\r\nT2 = [-1 for j in range(m)]\r\nfor i in range(k):\r\n (T, num, color) = map(int, input().split())\r\n a.append((T, num - 1, color))\r\n if T == 1:\r\n T1[num - 1] = i\r\n else:\r\n T2[num - 1] = i\r\n\r\nfor i in range(k):\r\n if a[i][0] == 1:\r\n if T1[a[i][1]] == i:\r\n fill_row(a[i][1], a[i][2])\r\n else:\r\n if T2[a[i][1]] == i:\r\n fill_column(a[i][1], a[i][2])\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n print(canvas[i][j], end = ' ')\r\n print()\r\n\r\n \r\n \r\n", "n, m, k = map(int, input().split(' '))\r\n\r\nrow = [(0, -1)] * 5010\r\ncol = [(0, -1)] * 5010\r\n\r\nfor i in range(1, k+1):\r\n a, b, c = map(int, input().split(' '))\r\n if a == 1:\r\n row[b] = (c, i)\r\n else:\r\n col[b] = (c, i)\r\n\r\nfor i in range(1, n+1):\r\n for j in range(1, m+1):\r\n if row[i][1] > col[j][1]:\r\n print(row[i][0], end=' ')\r\n else:\r\n print(col[j][0], end=' ')\r\n print()\r\n", "n, m, k = map(int,input().split())\r\n\r\ninstanteLinhas = [0] * n\r\ninstanteColunas = [0] * m\r\ncores = [0] * (k + 1) #cor inicial 0\r\n \r\nfor i in range(k):\r\n op, lc, cor = input().split()\r\n lc = int(lc)\r\n cor = int(cor)\r\n\r\n cores[i + 1] = cor\r\n if op == '1':\r\n instanteLinhas[lc - 1] = i + 1\r\n elif op == '2':\r\n instanteColunas[lc - 1] = i + 1\r\n\r\nresp = \"\"\r\nfor i in range(n):\r\n for j in range(m):\r\n resp += str(cores[max(instanteLinhas[i], instanteColunas[j])])\r\n if j != m - 1:\r\n resp += \" \"\r\n if i != n - 1: \r\n resp += \"\\n\"\r\n\r\nprint(resp)", "mx = []\r\nops = []\r\nnx=list(map(int,input().split()))\r\nn=nx[0]\r\nm=nx[1]\r\nk=nx[2]\r\nflagn=[(-1,-1,i) for i in range (0,n)]\r\nflagm=[(-1,-1,i) for i in range (0,m)]\r\nfor i in range (0,n):\r\n mx.append([0]*m)\r\nfor i in range (0,k):\r\n temp=(list(map(int,input().split())))\r\n if temp[0]==1:\r\n flagn[temp[1]-1]=(i,temp[2],temp[1]-1)\r\n else:\r\n flagm[temp[1]-1]=(i,temp[2],temp[1]-1)\r\nflagn.sort(key=lambda x:x[0])\r\nflagm.sort(key=lambda x:x[0])\r\npntn=0\r\npntm=0\r\nfor i in range (0,n+m):\r\n if ((pntn<n)&(pntm<m)):\r\n if flagn[pntn][0]<=flagm[pntm][0]:\r\n if (flagn[pntn][0]!=-1):\r\n for j in range (0,m):\r\n mx[flagn[pntn][2]][j]=flagn[pntn][1]\r\n i+=1\r\n pntn+=1\r\n else:\r\n if flagm[pntm][0]!=-1:\r\n for j in range (0,n):\r\n mx[j][flagm[pntm][2]]=flagm[pntm][1]\r\n i+=1\r\n pntm+=1\r\n else:\r\n if (pntn<n):\r\n if (flagn[pntn][0]!=-1):\r\n for j in range (0,m):\r\n mx[flagn[pntn][2]][j]=flagn[pntn][1]\r\n i+=1\r\n pntn+=1\r\n if (pntm<m):\r\n if flagm[pntm][0]!=-1:\r\n for j in range (0,n):\r\n mx[j][flagm[pntm][2]]=flagm[pntm][1]\r\n i+=1\r\n pntm+=1 \r\nfor i in range (0,n):\r\n for j in range (0,m):\r\n print (mx[i][j],end=' ')\r\n print()\r\n", "\r\nn,m,k = map(int, input().split())\r\nr=[[0,0] for i in range(n)]\r\nc=[[0,0] for i in range(m)]\r\nfor _ in range(k):\r\n x,w,v=map(int, input().split())\r\n if x==1:\r\n r[w-1][0]=_+1\r\n r[w-1][1]=v\r\n else:\r\n c[w - 1][0] = _+1\r\n c[w - 1][1] = v\r\nfor i in range(n):\r\n for j in range(m):\r\n if r[i][0]>=c[j][0]:\r\n print(r[i][1],end=' ')\r\n else:\r\n print(c[j][1],end=' ')\r\n print('')", "def getnums():\r\n raw = input()\r\n raw = raw.split()\r\n return [int(num) for num in raw]\r\n\r\nn, m, k = getnums()\r\n\r\na = [[0 for j in range(m + 1)] for i in range(n + 1)]\r\n\r\nr = [False for i in range(n + 1)]\r\nc = [False for j in range(m + 1)]\r\n\r\ninfo = [getnums() for i in range(k)]\r\n\r\ndef draw(t, num, col):\r\n if t == 1:\r\n for i in range(1, m + 1):\r\n if a[num][i] == 0:\r\n a[num][i] = col\r\n else:\r\n for i in range(1, n + 1):\r\n if a[i][num] == 0:\r\n a[i][num] = col\r\n\r\ni = k - 1\r\nwhile i >= 0:\r\n if info[i][0] == 1:\r\n val = info[i][1]\r\n if not r[val]:\r\n r[val] = True\r\n draw(1, val, info[i][2])\r\n else:\r\n val = info[i][1]\r\n if not c[val]:\r\n c[val] = True\r\n draw(2, val, info[i][2])\r\n i = i - 1\r\n\r\nfor i in range(1, n + 1):\r\n for j in range(1, m):\r\n print(a[i][j], end = ' ')\r\n print(a[i][m])", "n, m, k = map(int, input().split())\r\nlines = [[0, 0] for i in range(n)]\r\ncolumns = [[0, 0] for i in range(m)]\r\nfor i in range(k):\r\n task, num, color = map(int, input().split())\r\n if task == 1:\r\n lines[num-1] = [color, i+1]\r\n else:\r\n columns[num-1] = [color, i+1]\r\nfor i in range(n):\r\n for j in range(m):\r\n if lines[i][1] > columns[j][1]:\r\n print(lines[i][0], end = ' ')\r\n else:\r\n print(columns[j][0], end = ' ')\r\n \r\n print('')\r\n", "n,m,k = map(int,input().split(' '))\nmat = []\nfor i in range(n+1) :\n mat.append([0]*(m+1))\ncheck = []\nfor i in range(2) :\n check.append([False]*5001)\nl = []\nfor i in range(k):\n l.append(list(map(int,input().split(' '))))\nfor i in range(k-1,-1,-1):\n if not check[l[i][0]-1][l[i][1]]:\n if l[i][0] == 1:\n for j in range(1,m+1):\n if mat[l[i][1]][j] == 0 :\n mat[l[i][1]][j] = l[i][2]\n else :\n for j in range(1,n+1):\n if mat[j][l[i][1]] == 0:\n mat[j][l[i][1]] = l[i][2]\n check[l[i][0]-1][l[i][1]] = True\nfor i in range(1,n+1) :\n for j in range(1,m+1):\n print(mat[i][j],end=' ')\n print('')", "import sys\nimport math\nfrom collections import defaultdict\n\nMAXNUM = math.inf\nMINNUM = -1 * math.inf\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 solve(queries, n, m):\n paper = [[0 for _ in range(m)] for _ in range(n)]\n\n for row in range(n):\n for col in range(m):\n if (1, row + 1) in queries:\n rq = queries[1, row + 1]\n else:\n rq = (-1, 0)\n if (2, col + 1) in queries:\n cq = queries[2, col + 1]\n else:\n cq = (-1, 0)\n if rq > cq:\n paper[row][col] = rq[1]\n else:\n paper[row][col] = cq[1]\n\n return paper\n\n\ndef printOutput(ans):\n for lin in ans:\n for i in lin:\n sys.stdout.write(str(i) + \" \") # add to m\n sys.stdout.write(\"\\n\")\n\n\ndef readinput():\n n, m, k = getInts()\n counter = 0\n queries = {}\n for _ in range(k):\n qType, rc, color = getInts()\n queries[qType, rc] = (counter, color)\n counter += 1\n printOutput(solve(queries, n, m))\n\n\nreadinput()\n", "int_inp = lambda: int(input()) #integer input\nstrng = lambda: input().strip() #string input\nstrl = lambda: list(input().strip())#list of strings as input\nmul = lambda: map(int,input().split())#multiple integers as inpnut\nmulf = lambda: map(float,input().split())#multiple floats as ipnut\nseq = lambda: list(map(int,input().split()))#list of integers\nimport math\nfrom collections import Counter,defaultdict\n\nn,m,k=map(int,input().split())\n\nc=[(0,0)]*(m+1)\n\nr=[(0,0)]*(n+1)\n\nfor i in range(k):\n\n q,a,b=map(int,input().split())\n\n if q==1: r[a]=(i+1,b)\n\n else: c[a]=(i+1,b)\n\nfor i in range(n):\n\n s=\"\"\n\n for j in range(m):\n\n t=r[i+1][1]\n\n if c[j+1][0]>r[i+1][0]: t=c[j+1][1]\n\n s+=str(t)+' '\n\n print(s)\n", "# speedtest\r\nn, m, k = map(int, input().split())\r\nrow = [0]*n\r\ncol = [0]*m\r\n\r\nfor i in range(k):\r\n t, rc, a = map(int, input().split())\r\n rc -= 1\r\n if t == 1:\r\n row[rc] = (i, a)\r\n else:\r\n col[rc] = (i, a)\r\n\r\nfor i in range(n):\r\n for j in range(m):\r\n if type(row[i]) == tuple and type(col[j]) != tuple:\r\n upd = row[i]\r\n elif type(row[i]) != tuple and type(col[j]) == tuple:\r\n upd = col[j]\r\n else:\r\n upd = max(row[i], col[j])\r\n \r\n if upd is 0:\r\n print(0, end=\" \")\r\n else:\r\n print(upd[1], end=\" \")\r\n print()", "from collections import defaultdict, deque, Counter, OrderedDict\r\nimport threading,sys\r\n\r\ndef main():\r\n n,m,k = map(int, input().split())\r\n\r\n nl = [(-1,0) for i in range(n)]\r\n ml = [(-1,0) for i in range(m)]\r\n\r\n for i in range(k):\r\n a,b,c = map(int,input().split())\r\n if a == 1:\r\n nl[b-1] = (i,c)\r\n else:\r\n ml[b-1] = (i,c)\r\n\r\n\r\n for i in range(n):\r\n for j in range(m):\r\n print(nl[i][1] if nl[i][0] > ml[j][0] else ml[j][1],end = \" \")\r\n print()\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n \"\"\"sys.setrecursionlimit(400000)\r\n threading.stack_size(40960000)\r\n thread = threading.Thread(target=main)\r\n thread.start()\"\"\"\r\n main()", "# link: https://codeforces.com/contest/631/problem/B\r\n\r\nfor _ in range(1):\r\n n, m, k = map(int, input().split())\r\n rows = {}\r\n columns = {}\r\n for i in range(k): # k is the number of queries\r\n type_of, at, value = map(int, input().split())\r\n if type_of == 1: # it's a row\r\n rows[at-1] = [value, i+1]\r\n else: # it's a column \r\n columns[at-1] = [value, i+1]\r\n # input section ends\r\n # implementation begins\r\n for i in range(n):\r\n for j in range(m):\r\n if i in rows and j in columns: # both are present then take the one which occured later\r\n if rows[i][1] > columns[j][1]:\r\n print(rows[i][0], end=\" \")\r\n else:\r\n print(columns[j][0], end=\" \")\r\n elif i in rows: # only row has a value\r\n print(rows[i][0], end=\" \")\r\n elif j in columns: # only column has a value\r\n print(columns[j][0], end=\" \")\r\n else: # the default value which is zero(0) should be in the output\r\n print(0, end=\" \")\r\n print()\r\n", "n, m, k = map(int, input().split())\nrow, col, color = [0] * n, [0] * m, [0] * k + [0]\n\nfor i in range(1, k + 1):\n typ, pos, color[i] = map(int, input().split())\n if typ == 1:\n row[pos - 1] = i\n else:\n col[pos - 1] = i;\nfor i in range(n):\n out = \"\"\n for j in range(m):\n out += str(color[max(row[i], col[j])])\n out += ' '\n print(out)", "n,m,k=map(int,input().split())\r\n# arr=list(map(int,input().split()))\r\nrow_dic={};col_dic={}\r\nfor i in range(k):\r\n ty,field,col=map(int,input().split())\r\n if ty==1:\r\n row_dic[field-1]=[col,i]\r\n # for k in col_dic:\r\n # col_dic[k][1].append(field-1)\r\n else:\r\n col_dic[field-1]=[col,i]\r\n # for k in row_dic:\r\n # row_dic[k][1].append(field-1)\r\n# print(row_dic,col_dic)\r\nmat=[[0 for i in range(m)] for j in range(n)]\r\n# print(mat)\r\nfor i in range(n):\r\n for j in range(m):\r\n if i not in row_dic and j not in col_dic:pass\r\n elif i in row_dic and j in col_dic:\r\n if row_dic[i][1]>col_dic[j][1]:mat[i][j]=row_dic[i][0]\r\n else:mat[i][j]=col_dic[j][0]\r\n elif i in row_dic:\r\n mat[i][j]=row_dic[i][0]\r\n else:mat[i][j]=col_dic[j][0]\r\nfor i in range(n):\r\n for j in range(m):\r\n print(mat[i][j],end=\" \")\r\n print()", "#!/usr/bin/python3\n\ndef read_ints():\n return list(map(int, input().split()))\n \n(nRows,nCols,nRqs) = read_ints()\n\nrowTasks = {}\ncolTasks = {}\n\nfor i in range(nRqs):\n task = {}\n (task[\"op\"],task[\"ind\"],task[\"clr\"]) = read_ints()\n task[\"ind\"] -= 1\n task[\"number\"] = i\n if task[\"op\"]==1:\n rowTasks[task[\"ind\"]] = task\n else:\n colTasks[task[\"ind\"]] = task\n\nfor i in range(nRows):\n for j in range(nCols):\n clr = 0\n rowTask = None\n if i in rowTasks:\n rowTask = rowTasks[i]\n clr = rowTask[\"clr\"]\n if j in colTasks:\n colTask = colTasks[j]\n if rowTask==None or colTask[\"number\"] > rowTask[\"number\"]:\n clr = colTask[\"clr\"]\n print(str(clr),end=\" \")\n print(\"\") \n \n", "from os import path\r\nfrom sys import stdin, stdout\r\n\r\n\r\nfilename = \"../templates/input.txt\"\r\nif path.exists(filename):\r\n stdin = open(filename, 'r')\r\n\r\n\r\ndef input():\r\n return stdin.readline().rstrip()\r\n\r\n\r\ndef print(*args, sep=' ', end='\\n'):\r\n stdout.write(sep.join(map(str, args)))\r\n stdout.write(end)\r\n\r\n\r\ndef solution():\r\n n, m, k = [int(num) for num in input().split()]\r\n a = [[0 for j in range(m)] for i in range(n)]\r\n operations = []\r\n while k:\r\n operations.append((int(num) for num in input().split()))\r\n k -= 1\r\n rows = set(range(n))\r\n cols = set(range(m))\r\n for op, i, color in reversed(operations):\r\n i -= 1\r\n if op == 1:\r\n if i in rows:\r\n for col in cols:\r\n a[i][col] = color\r\n rows.remove(i)\r\n else:\r\n if i in cols:\r\n for row in rows:\r\n a[row][i] = color\r\n cols.remove(i)\r\n for row in a:\r\n print(*row)\r\n\r\n\r\ndef main():\r\n t = 1\r\n while t:\r\n solution()\r\n t -= 1\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import defaultdict\ndef operationdict():\n\treturn defaultdict(lambda: (-1, 0))\nn, m, k = map(int, input().split())\nrows, columns = operationdict(), operationdict()\nfor i in range(k):\n\top, index, color = map(int, input().split())\n\tops = rows if op == 1 else columns\n\tops[index-1] = (i, color)\nfor y in range(n):\n\tprint(' '.join(str(max(rows[y], columns[x])[1]) for x in range(m)))\n", "def get_ints(): return [int(x) for x in input().split()]\r\n\r\nn,m,k=get_ints()\r\nar= [[0]*m for i in range(n)]\r\nlastr= [0]*n\r\nlastc =[0]*m\r\ncolors = [0] * (k+1)\r\n\r\nfor i in range(1,k+1):\r\n t,a,b = get_ints()\r\n colors[i] = b\r\n if t ==1:\r\n lastr[a-1] = i\r\n else:\r\n \tlastc[a-1] = i\r\n\r\nfor i in range(n):\r\n\trow = \"\"\r\n\tfor j in range(m):\r\n\t\trow += str(colors[max(lastr[i],lastc[j])])\r\n\t\trow += \" \"\r\n\tprint(row)\r\n\r\n# for row in ar:\r\n # print(\" \".join([str(x) for x in row]))\r\n", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn, m, k = [int(x) for x in input().split(' ')]\r\n\r\nd = {}\r\n\r\nfor row in range(1, n + 1):\r\n d[(1, row)] = (-1, 0)\r\nfor col in range(1, m + 1):\r\n d[(2, col)] = (-1, 0)\r\n\r\n\r\nfor op in range(k):\r\n s = [int(x) for x in input().split(' ')]\r\n d[(s[0], s[1])] = (op, s[2])\r\n\r\nfor row in range(1, n + 1):\r\n r = []\r\n for col in range(1, m + 1):\r\n r.append(max(d[(1, row)], d[(2, col)])[1])\r\n print(*r)\r\n", "from sys import stdin\r\n\r\n\r\ndef main():\r\n n, m, q = map(int, stdin.readline().split())\r\n rid = [-1] * n\r\n rc = [-1] * n\r\n cid = [-1] * m\r\n cc = [-1] * m\r\n for i in range(q):\r\n t, x, y = map(int, stdin.readline().split())\r\n if t == 1:\r\n rid[x - 1] = i\r\n rc[x - 1] = y - 1\r\n else:\r\n cid[x - 1] = i\r\n cc[x - 1] = y - 1\r\n ans = [[0 for _ in range(m)] for _ in range(n)]\r\n query = []\r\n for i in range(n):\r\n query.append((rid[i], rc[i], i))\r\n for i in range(m):\r\n query.append((cid[i], cc[i], n + i))\r\n query.sort()\r\n for i in range(len(query)):\r\n idx, c, t = query[i]\r\n if c == -1:\r\n continue\r\n if t < n:\r\n for j in range(m):\r\n ans[t][j] = c + 1\r\n else:\r\n for j in range(n):\r\n ans[j][t - n] = c + 1\r\n for row in ans:\r\n print(*row)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\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\nu, v = [0] * n, [0] * m\r\nu0, v0 = [-1] * n, [-1] * m\r\nfor i in range(k):\r\n t, x, a = map(int, input().split())\r\n if t == 1:\r\n u[x - 1], u0[x - 1] = a, i\r\n else:\r\n v[x - 1], v0[x - 1] = a, i\r\nans = []\r\nfor i in range(n):\r\n ans0 = [0] * m\r\n for j in range(m):\r\n if u0[i] > v0[j]:\r\n ans0[j] = u[i]\r\n elif u0[i] < v0[j]:\r\n ans0[j] = v[j]\r\n ans.append(\" \".join(map(str, ans0)))\r\nsys.stdout.write(\"\\n\".join(ans))", "import sys\ninput=lambda:sys.stdin.readline().strip()\nn,m,k=map(int,input().split())\nrow = [(-1, 0)] * n\ncol = [(-1, 0)] * m\nfor i in range(k):\n a, b, c = map(int, input().split())\n if a == 1:\n row[b - 1] = (i, c)\n else:\n col[b - 1] = (i, c)\nfor i in range(n):\n for j in range(m):\n if row[i][0]>col[j][0]:\n sys.stdout.write(str(row[i][1]))\n else:\n sys.stdout.write(str(col[j][1]))\n sys.stdout.write(' ')\n sys.stdout.write(\"\\n\")" ]

[ "import math\r\nimport time\r\nfrom collections import defaultdict,deque\r\nfrom sys import stdin,stdout\r\nfrom bisect import bisect_left,bisect_right,bisect\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\nn,m=map(int,stdin.readline().split())\r\na=list(map(int,stdin.readline().split()))\r\nb=list(map(int,stdin.readline().split()))\r\nif(n>m):\r\n if(a[0]*b[0]>0):\r\n print(\"Infinity\")\r\n else:\r\n print(\"-Infinity\")\r\nelif(m>n):\r\n print(\"0/1\")\r\nelse:\r\n g=gcd(abs(a[0]),abs(b[0]))\r\n x=a[0]\r\n y=b[0]\r\n if(y<0):\r\n y*=-1\r\n x*=-1\r\n print(x//g,\"/\",y//g,sep=\"\")\r\n\r\n", "from math import gcd \r\n\r\nn, m = map(int, input().split())\r\np = list(map(int, input().split()))\r\nq = list(map(int, input().split()))\r\n\r\nif (n>m):\r\n\tif (p[0]<0 and q[0]>0) or (p[0]>0 and q[0]<0):\r\n\t\tprint(\"-Infinity\")\r\n\telse:\r\n\t\tprint(\"Infinity\")\r\n\r\nelif (n==m):\r\n\td = gcd(p[0], q[0])\r\n\tx = p[0] // d \r\n\ty = q[0] // d\r\n\r\n\tif (x<0 and y>0) or (x>0 and y<0):\r\n\t\tprint(\"-\" + str(abs(x)) + \"/\" + str(abs(y)))\r\n\telse:\t\r\n\t\tprint(str(abs(x)) + \"/\" + str(abs(y)))\r\n\r\nelse:\r\n\tprint(\"0/1\")\r\n", "import math\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif m > n:\r\n print('0/1')\r\nelif m == n:\r\n gcd = abs(math.gcd(a[0], b[0]))\r\n if a[0] * b[0] < 0:\r\n print('-{}/{}'.format(abs(a[0]) // gcd, abs(b[0]) // gcd))\r\n else:\r\n print('{}/{}'.format(abs(a[0]) // gcd, abs(b[0]) // gcd))\r\nelse:\r\n if a[0] * b[0] < 0:\r\n print('-Infinity')\r\n else:\r\n print('Infinity')\r\n", "import math\r\nn,m = [int(x) for x in input().split()]\r\narr = [int(x) for x in input().split()]\r\nlis = [int(x) for x in input().split()]\r\nan = arr[0]\r\nbn = lis[0]\r\nif n > m:\r\n if an/bn >0 :\r\n print('Infinity')\r\n else:\r\n print('-Infinity')\r\nelif m >n:\r\n print('0/1')\r\nelse:\r\n k = math.gcd(an,bn)\r\n if bn <0 and an >0:\r\n bn = abs(bn)\r\n an = -an\r\n elif bn<0 and an <0:\r\n bn = abs(bn)\r\n an = abs(an) \r\n print(an//k, end = '')\r\n print('/', end = '')\r\n print(bn//k) ", "def gcd(a,b):\r\n if b==0:\r\n return a\r\n return gcd(b,a%b)\r\n\r\n\r\nn,m=map(int,input().split())\r\np=n-m\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif p==0:\r\n g=gcd(a[0],b[0])\r\n print(\"%d/%d\"%(a[0]/g,b[0]/g))\r\nelse:\r\n if p<0:\r\n print(\"0/1\")\r\n else:\r\n if a[0]*b[0]>0:\r\n print(\"Infinity\")\r\n else:\r\n print(\"-Infinity\")", "'''\nHey why peeping here -_'_- ?\nI believe on myself and I will achieve\nthis->author = Fuad Ashraful Mehmet, CSE ,University of Asia Pacific\nTodo:\n'''\nimport sys,math\ninput=sys.stdin.readline\n\n\ndef HalfDead():\n n,m=map(int,input().split())\n a=list(map(int,input().split()))\n b=list(map(int,input().split()))\n\n if n>m:\n print(\"-Infinity\") if a[0]*b[0]<0 else print(\"Infinity\")\n elif m>n:\n print(\"0/1\")\n else:\n x=abs(a[0])\n y=abs(b[0])\n g=math.gcd(x,y)\n\n if a[0]*b[0]<0:\n print(\"-{}/{}\".format(x//g,y//g))\n else:\n print(\"{}/{}\".format(x//g,y//g))\n \nif __name__=='__main__':\n HalfDead()", "import math\r\nn, m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nif n > m :\r\n if a[0]*b[0] < 0 :\r\n print(\"-Infinity\")\r\n else :\r\n print(\"Infinity\")\r\nelif n == m :\r\n hcf = math.gcd(a[0],b[0])\r\n if a[0]*b[0] < 0 :\r\n print('-', abs(a[0]//hcf),'/',abs(b[0]//hcf),sep=\"\")\r\n else :\r\n print(abs(a[0]//hcf),'/',abs(b[0]//hcf),sep=\"\")\r\nelse :\r\n print(\"0/1\")", "import math\r\nn,m=map(int,input().split())\r\np=list(map(int,input().split()))\r\nq=list(map(int,input().split()))\r\nif n>m:\r\n\tif (p[0]>0 and q[0]>0) or (p[0]<0 and q[0]<0):\r\n\t\tprint('Infinity')\r\n\telse:\r\n\t\tprint('-Infinity')\r\nelif m>n:\r\n\tprint('0/1')\r\nelse:\r\n\tp1=abs(p[0])\r\n\tq1=abs(q[0])\r\n\tx=math.gcd(p1,q1)\r\n\tp1=p1//x\r\n\tq1=q1//x\r\n\tif (p[0]>0 and q[0]<0) or (p[0]<0 and q[0]>0):\r\n\t\tprint('-%d/%d'%(p1,q1))\r\n\telse:\r\n\t\tprint('%d/%d'%(p1,q1))", "import sys\nn, m = map(int, input().split())\ncn = list(map(int, input().split()))\ncm = list(map(int, input().split()))\nif n > m:\n\tif cn[0]*cm[0] < 0:\n\t\tsys.stdout.write('-')\n\tprint('Infinity')\nelif n < m:\n\tprint('0/1')\nelse:\n\tif cn[0]*cm[0] < 0:\n\t\tsys.stdout.write('-')\n\tcn[0], cm[0] = abs(cn[0]), abs(cm[0])\n\ta, b = cn[0], cm[0]\n\twhile b != 0:\n\t\ta, b = b, a%b\n\tcn[0] /= a\n\tcm[0] /= a\n\tprint('%d/%d' % (cn[0], cm[0]))\n", "import math\r\nR=lambda:list(map(int,input().split()))\r\nn,m=R()\r\na=R()[0]\r\nb=R()[0]\r\nif n>m: print(('-'if a*b<0 else'')+'Infinity')\r\nelif n<m: print('0/1')\r\nelse:\r\n g=math.gcd(abs(a),abs(b))\r\n a//=g\r\n b//=g\r\n if b<0:a,b=-a,-b\r\n print(str(a)+'/'+str(b))", "def hcfnaive(a,b): \r\n if(b==0): \r\n return a \r\n else: \r\n return hcfnaive(b,a%b)\r\nn,m=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif n>m:\r\n if a[0]/b[0]>0:\r\n print(\"Infinity\")\r\n else:\r\n print( \"-Infinity\")\r\nelif n<m:\r\n print('0/1')\r\nelse:\r\n p=a[0]\r\n q=b[0]\r\n s=''\r\n if p/q<0:\r\n s='-'\r\n p=abs(p)\r\n q=abs(q)\r\n h=hcfnaive(p,q)\r\n p=p//h\r\n q=q//h\r\n print(s+str(p)+'/'+str(q))", "import math\ndef gcd(a, b):\n if b == 0:\n return a;\n return gcd(b, a % b)\n\n\ndef main():\n n, m = [int(x) for x in input().split()]\n a = [int(x) for x in input().split()]\n b = [int(x) for x in input().split()]\n if n == m:\n mult = 1 if (a[0] * b[0]) >= 0 else -1\n g = gcd(abs(a[0]), abs(b[0]))\n print('{0}/{1}'.format(mult * math.floor(abs(a[0])/g), math.floor(abs(b[0])/g)))\n elif n > m:\n sign = '' if (a[0] * b[0]) >= 0 else '-'\n print('{0}Infinity'.format(sign))\n else:\n print('0/1')\n\nif __name__ == '__main__':\n main()\n", "import math\r\nx,y = map(int,input().split())\r\na,b = int(input().split()[0]), int(input().split()[0])\r\nif y > x:\r\n print(\"0/1\")\r\nelif x > y:\r\n print((\"-\" if (int(a < 0) + int(b < 0))%2 == 1 else \"\") + \"Infinity\")\r\nelse:\r\n if (int(a < 0)+int(b < 0))%2 == 1:\r\n a = -abs(a)\r\n b = abs(b)\r\n else:\r\n a = abs(a)\r\n b = abs(b)\r\n print(str(a//math.gcd(a,b))+\"/\"+str(b//math.gcd(a,b)))", "\r\n\r\nimport math\r\nimport queue\r\n\r\nfrom itertools import permutations \r\n\r\n\r\nn,m=map(int,input().split())\r\n\r\na=[int(cost) for cost in input().split()]\r\nb=[int(cost) for cost in input().split()]\r\n\r\nn1=n\r\na1=a[0]\r\n\r\nm1=m\r\nb1=b[0]\r\n\r\n \r\nif n1<m1:\r\n print(\"0/1\")\r\nelif n1>m1:\r\n if (a1>0 and b1>0) or (a1<0 and b1<0):\r\n print(\"Infinity\")\r\n else:\r\n print(\"-Infinity\")\r\nelse:\r\n if (a1>0 and b1>0) or (a1<0 and b1<0):\r\n sign=1\r\n else:\r\n sign=-1\r\n \r\n a1=abs(a1)\r\n b1=abs(b1)\r\n \r\n d=math.gcd(a1,b1)\r\n \r\n a1//=d\r\n b1//=d\r\n \r\n if sign==-1:\r\n print(\"-\",end='')\r\n \r\n print(a1,end='')\r\n print(\"/\",end='')\r\n print(b1,end='')\r\n\r\n\r\n\r\n", "from math import gcd\r\n\r\nn, m = map(int, input().split())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\n\r\nif n > m:\r\n if a[0]//abs(a[0]) != b[0]//abs(b[0]):\r\n print(\"-Infinity\")\r\n else:\r\n print(\"Infinity\")\r\nelif n < m:\r\n print(\"0/1\")\r\nelse:\r\n tp = a[0]//gcd(a[0], b[0])\r\n btm = b[0]//gcd(a[0], b[0])\r\n if btm < 0:\r\n tp *= -1\r\n btm *= -1\r\n \r\n print(str(tp)+ \"/\" + str(btm))", "from fractions import Fraction\n\nn, m = map(int, input().split())\n\nN = list(map(int, input().split()))\nM = list(map(int, input().split()))\n\nif n > m:\n if (N[0] < 0 and M[0] < 0) or (N[0] > 0 and M[0] > 0):\n print(\"Infinity\")\n else:\n print(\"-Infinity\")\nelif m > n:\n print(\"0/1\")\nelse:\n print(str(Fraction(N[0], M[0]).numerator) + \"/\" +\n str(Fraction(N[0], M[0]).denominator))\n", "def f(a,b):\r\n if a%b==0:\r\n return b\r\n return f(b,a%b)\r\na,b=map(int,input().split())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nif len(l1)>len(l2):\r\n x='Infinity'\r\n if (l1[0]>0 and l2[0]>0) or (l1[0]<0 and l2[0]<0) :\r\n print('Infinity')\r\n else:\r\n print('-Infinity')\r\nelif len(l1)<len(l2):\r\n print('0/1',sep='')\r\nelse:\r\n n=l1[0];m=l2[0]\r\n g=f(n,m)\r\n print(n//g,'/',m//g,sep='')\r\n", "from collections import defaultdict, deque\nfrom functools import lru_cache\nfrom heapq import heappush, heappop, heapify\nfrom bisect import bisect_right, bisect_left\nfrom random import randint\nfrom fractions import Fraction as frac\nimport math\nhpop = heappop\nhpush = heappush\nMOD = 10**9 + 7\n\ndef gcd(a,b):\n if a < b: a,b = b,a\n if b == 0: return a\n return gcd(a%b,b)\n#def calc(x,y,a,b)\ndef solution():\n # zero / zero can never happend\n\n n,m = map(int, input().split())\n p = list(map(int, input().split()))[::-1]\n q = list(map(int, input().split()))[::-1]\n\n while p and p[-1] == 0:\n p.pop()\n\n while q and q[-1] == 0:\n q.pop()\n\n if len(p) == len(q):\n up = p[-1]\n down = q[-1]\n sign = (\"-\" if up*down < 0 else \"\")\n\n g = gcd(abs(up),abs(down))\n up //= g\n down //= g\n return print(sign + str(abs(up))+\"/\"+str(abs(down)))\n\n if len(p) < len(q):\n return print(\"0/1\")\n\n if p[-1] * q[-1] < 0:\n return print(\"-Infinity\")\n else:\n return print(\"Infinity\")\n\n\ndef test():\n pass\n\ndef main():\n #test()\n t = 1\n #t = int(input())\n for _ in range(t):\n solution() \n \nimport sys\nimport threading\nsys.setrecursionlimit(1 << 30)\nthreading.stack_size(1 << 27)\nthread = threading.Thread(target=main)\nthread.start(); thread.join()\n#main()\n", "from math import gcd\r\n\r\nn,m=map(int,input().split())\r\na= [int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nx=a[0]/b[0]\r\nif n>m:\r\n\r\n if x<0:\r\n print(\"-Infinity\")\r\n else:\r\n print('Infinity')\r\nelif m>n:\r\n print('0/1')\r\nelse:\r\n a[0],b[0]=abs(a[0]),abs(b[0])\r\n if x<0:\r\n print('-'+str(a[0]//gcd(a[0],b[0])) +'/' + str(b[0]//gcd(a[0],b[0])) )\r\n else:\r\n print(str(a[0]//gcd(a[0],b[0])) +'/' + str(b[0]//gcd(a[0],b[0])))", "try:\r\n from fractions import Fraction\r\n n,m=list(map(int,input().split(\" \")))\r\n a=list(map(int,input().split(\" \")))\r\n b=list(map(int,input().split(\" \")))\r\n if len(a)==len(b):\r\n mn=Fraction(a[0],b[0])\r\n if '/' not in str(mn):\r\n print(str(mn)+'/'+'1')\r\n else:\r\n print(mn)\r\n \r\n \r\n elif len(a)<len(b):\r\n print(\"0/1\")\r\n elif len(a)>len(b) and ((a[0]<0 and b[0]>0) or (a[0]>0 and b[0]<0)):\r\n print(\"-Infinity\")\r\n elif len(a)>len(b) and ((a[0]>0 and b[0]>0) or (a[0]<0 and b[0]<0)):\r\n print(\"Infinity\")\r\n \r\nexcept:\r\n pass", "def gcd(x,y):\r\n if x%y==0:\r\n return y\r\n return gcd(y,x%y)\r\nn,m = map(int,input().split())\r\n\r\n\r\nlin,lim = [int(i) for i in input().split()],[int(i) for i in input().split()]\r\nif n>m :\r\n if lin[0]*lim[0]<0:\r\n print(\"-Infinity\")\r\n else:\r\n print(\"Infinity\")\r\nelif m>n:\r\n print('0/1')\r\nelse:\r\n x,y = max(abs(lin[0]),abs(lim[0])),min(abs(lin[0]),abs(lim[0]))\r\n a = gcd(x,y)\r\n if lin[0]*lim[0]<0:\r\n print(\"-\"+str(abs(lin[0])//a)+'/'+str(abs(lim[0])//a))\r\n else:\r\n print(str(abs(lin[0])//a)+'/'+str(abs(lim[0])//a))\r\n", "import math\r\nn, m = list(map(int, input().split()))\r\na = list(map(int, input().split()))[0]\r\nb = list(map(int, input().split()))[0]\r\nif n > m: \r\n print(('-' if a * b < 0 else '') + 'Infinity')\r\nelif n < m: \r\n print('0/1')\r\nelse:\r\n g = math.gcd(abs(a),abs(b))\r\n a //= g ; b //= g\r\n if b < 0: a, b = -a, -b\r\n print(str(a)+'/'+str(b))\r\n", "from fractions import Fraction\n\n\nclass CodeforcesTask197BSolution:\n def __init__(self):\n self.result = ''\n self.n_m = []\n self.p_x = []\n self.q_x = []\n\n def read_input(self):\n self.n_m = [int(x) for x in input().split(\" \")]\n self.p_x = [int(x) for x in input().split(\" \")]\n self.q_x = [int(x) for x in input().split(\" \")]\n\n def process_task(self):\n if self.n_m[0] > self.n_m[1]:\n if self.p_x[0] * self.q_x[0] > 0:\n self.result = \"Infinity\"\n else:\n self.result = \"-Infinity\"\n elif self.n_m[1] > self.n_m[0]:\n self.result = \"0/1\"\n else:\n result = Fraction(self.p_x[0], self.q_x[0])\n self.result = \"{0}/{1}\".format(result.numerator, result.denominator)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask197BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "import fractions as f\r\n\r\nn,m=map(int,input().split())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nif n>m:\r\n if a[0]*b[0]<0:\r\n print(\"-Infinity\")\r\n else:\r\n print(\"Infinity\")\r\nelif n<m:\r\n print(\"0/1\")\r\nelse:\r\n print(f.Fraction(a[0]/b[0]).limit_denominator(),end='')\r\n if((a[0]/b[0]).is_integer()):print(\"/1\")", "import math\r\nn,m=map(int,input().split())\r\nl=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nl=l[0]\r\nk=k[0]\r\nif(n<m):\r\n print(\"0/1\")\r\nelif(n==m):\r\n if((l>0 and k>0 ) or (l<0 and k<0)):\r\n l=abs(l)\r\n k=abs(k)\r\n p=math.gcd(l,k)\r\n print(int(l/p),end=\"\")\r\n print(\"/\",end=\"\")\r\n print(int(k/p),end=\"\")\r\n else:\r\n print('-',end=\"\")\r\n l=abs(l)\r\n k=abs(k)\r\n p=math.gcd(l,k)\r\n print(int(l/p),end=\"\")\r\n print(\"/\",end=\"\")\r\n print(int(k/p),end=\"\")\r\nelse:\r\n if((l>0 and k>0 ) or (l<0 and k<0)):\r\n print(\"Infinity\")\r\n else:\r\n print(\"-Infinity\")", "n,m = map(int,input().split())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\na0,b0 = a[0],b[0]\r\nif n>m:\r\n if a0*b0>0:\r\n print(\"Infinity\")\r\n else:\r\n print(\"-Infinity\")\r\nelif n<m:\r\n print(\"0/1\")\r\nelse:\r\n for i in range(2,100):\r\n while a0%i==0 and b0%i==0:\r\n a0,b0 = a0//i,b0//i\r\n if a0*b0>0:\r\n print(str(abs(a0))+'/'+str(abs(b0)))\r\n else:\r\n print('-'+str(abs(a0))+'/'+str(abs(b0)))" ]

[ "def f(x): return x // 3\r\n\r\nr, g, b = map(int, input().split())\r\nm = min(r, g, b)\r\nans = 0\r\nfor i in range(max(0, m - 30), m + 1):\r\n ans = max(ans, i + f(r - i) + f(g - i) + f(b - i))\r\nprint(ans)\r\n", "r,g,b = map(int, input().split(\" \"))\r\nres = 0\r\nres += r//3\r\nres += g//3\r\nres += b//3\r\nif r > 0 and b > 0 and g > 0:\r\n r -= 1\r\n g -= 1\r\n b -= 1\r\n res = max(res,r//3+b//3+g//3+1)\r\nif r > 0 and b > 0 and g > 0:\r\n r -= 1\r\n g -= 1\r\n b -= 1\r\n res = max(res, r//3+b//3+g//3+2)\r\nprint(res)", "import math as mt \nimport sys,string\ninput=sys.stdin.readline\nfrom collections import defaultdict\nL=lambda : list(map(int,input().split()))\nLs=lambda : list(input().split())\nM=lambda : map(int,input().split())\nI=lambda :int(input())\nr,g,b=M()\na1=0\na2=0\nif(min(r,g,b)>=2):\n \n a1=2+((r-2)//3+(g-2)//3+(b-2)//3)\nif(min(r,b,g)>=1):\n a2=1+((r-1)//3+(g-1)//3+(b-1)//3)\nprint(max(a1,a2,r//3+g//3+b//3))\n", "r,g,b = map(int,input().split())\r\na,b,c = sorted([r,g,b])\r\nx=y=z=0\r\nx = a + (b-a)//3 + (c-a)//3\r\nif a>0:\r\n y = a-1 + (b-a+1)//3 + (c-a+1)//3\r\nif a>1:\r\n z = a-2 + (b-a+2)//3 + (c-a+2)//3\r\nprint(max(x,y,z))", "r,g,b = map(int, input().split(\" \"))\r\na = [r%3, g%3, b%3]\r\nx = [r,g,b]\r\nz = [int(r/3)+int(g/3)+int(b/3)+min(a)]\r\nif r>1 and g>1 and b>1 and (min(x)-1)%3==0:\r\n z.append(1+int((r-1)/3)+int((g-1)/3)+int((b-1)/3))\r\nelif r>2 and g>2 and b>2:\r\n z.append(2+int((r-2)/3)+int((g-2)/3)+int((b-2)/3))\r\nprint(max(z))", "r,g,b = map(int,input().split())\r\nif {r%3,g%3,b%3} == {0,1,2} or 0 in {r,g,b}:\r\n\tprint((r//3+g//3+b//3))\r\nelse:\r\n\tprint((r+b+g)//3)", "flowers = [int(k) for k in input().split()]\nr = flowers[0]\nb = flowers[1]\ng = flowers[2]\n\nanswer = 0\n\nfor mix in range(0, 3):\n temp = 0\n if (r >= mix and b >= mix and g >= mix):\n temp = mix\n red = r - mix\n blue = b - mix\n green = g - mix\n temp += red // 3 + blue // 3 + green // 3\n\n if (temp > answer):\n answer = temp\n\nprint(int(answer))", "#!/usr/bin/env python\r\n#pyrival orz\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\n\r\n\"\"\"\r\n for _ in range(int(input())):\r\n n,m=map(int,input().split())\r\n n=int(input())\r\n a = [int(x) for x in input().split()]\r\n\"\"\"\r\n\r\ndef main():\r\n r,g,b=map(int,input().split())\r\n ans=0\r\n for i in range(3):\r\n if i>r or i>g or i>b:\r\n continue\r\n ans=max(ans,i+(r-i)//3+(g-i)//3+(b-i)//3)\r\n print(ans)\r\n\r\nif __name__ == \"__main__\":\r\n main()", "a = sorted([int(i) for i in input().split()])\r\nif len([i%3 for i in a])==len(set([i%3 for i in a])): print(sum(a)//3-1)\r\nelif 0 in a : print(a[0]//3 + a[1]//3 +a[2]//3)\r\nelse : print(sum(a)//3)", "def main():\n (r, g, b) = map(int, input().split(' '))\n def mix(m):\n if m > r or m > g or m > b:\n return 0\n return m + ((r - m) // 3) + ((g - m) // 3) + ((b - m) // 3)\n return max(mix(0), mix(1), mix(2))\n \n\nprint(main())\n", "a, b, c = map(int, input().split())\r\nans = 0\r\nfor i in range(3):\r\n k = min(i, a, b, c)\r\n x, y, z = a-k, b-k, c-k\r\n ans = max(ans, (x//3)+(y//3)+(z//3) + k)\r\n\r\nprint(ans)", "#输入r g b空格分隔\r\nr,g,b = map(int , input().split())\r\ndef answer(r,g,b):\r\n #第一种情况：先取rgb的对应的bouquets再加上mix的\r\n bouquets1 = r//3 + g//3 + b//3 + min(r%3, g%3, b%3)\r\n #print('bouquets1:'+ str(bouquets1))\r\n #第二种情况：先取mix再取剩余的rgb个数。（实际好像只有第二种情况）\r\n bouquets = []\r\n yushus = [r%3 , g%3 , b%3]\r\n m = min(r,g,b)\r\n if yushus.count(2) == 2 and m != 0:\r\n m = 2\r\n elif yushus.count(1) == 2 and m !=0:\r\n m = 1\r\n else:\r\n m = min(r, g, b)\r\n #for m in range(0,m2 + 1,3):\r\n bouquets2 = (r - m)//3 + (g - m)//3 + (b - m)//3 + m\r\n #bouquets.append(tempbouquets)\r\n #print('bouquets2:'+ str(bouquets2))\r\n #maxbouquets = max(bouquets)\r\n maxbouquets = max(bouquets1,bouquets2)\r\n print(maxbouquets)\r\n return maxbouquets\r\nanswer(r,g,b)", "ri=lambda:map(int,input().split(' '))\r\nr,g,b=ri()\r\nx=min(r,g,b)\r\nans=0\r\nfor i in range(max(0,x-5),x+1):\r\n r-=i; g-=i; b-=i;\r\n cur = i + r//3 + g//3 + b//3\r\n ans = max(ans,cur)\r\n r+=i; g+=i; b+=i\r\n \r\nprint(ans)", "r,g,b=map(int,input().split())\r\nrr=r%3\r\ngg=g%3\r\nbb=b%3\r\n\r\n# 1 special case [2,2,0] since it can't convert to its best perm [0,1,1] (by making mixed bouquets) if any of r,g,b=0\r\nneg=3*(int((rr+gg+bb==3 and rr!=gg) or (rr+gg+bb>3 and min(r,g,b)==0)))\r\n\r\nneg+=(rr+gg+bb)%3\r\nprint((r+g+b-neg)//3)\r\n\r\n# [0,0,0],[1,1,1],[2,2,2] -> s/3 -- r=0\r\n# [0,0,1],[1,1,2],[2,2,0] x3 -> (s-1)/3 -- r=1\r\n# [0,1,1],[1,2,2],[2,0,0] x3 -> (s-2)/3 -- r=2\r\n# [0,1,2],[1,2,0],[2,0,1] x2 -> (s-3)/3 -- r=0+3", "col = list(map(int, input().split()))\n\nans = 0\nfor i in range(0, min(2, min(col))+1):\n ans = max(ans, i + sum([(v-i)//3 for v in col]))\n\nprint(ans)\n", "def sol(r, g, b):\r\n m = min(r, g, b) // 3 * 3\r\n ans = 0\r\n for mm in range(max(0, m - 1), m + 1):\r\n for i in range(0, min(r - mm, g - mm, b - mm) + 1):\r\n ans = max(ans, mm + i + (r - mm - i) // 3 + (b - mm - i) // 3 + (g - mm - i) // 3)\r\n return ans\r\n\r\nprint(sol(*[int(x) for x in input().split()]))\r\n", "r,g,b=map(int,input().split())\r\nz=min(r,g,b,3)\r\n \r\nans=0\r\nfor i in range(z+1):\r\n\tans=max(ans,i+(r-i)//3+(g-i)//3+(b-i)//3)\r\n \r\nprint(ans)", "r,g,b = map(int, input().split(\" \"))\r\n\r\nresult0 = r//3+g//3+b//3\r\n\r\nif 1<=r and 1<=g and 1<=b:\r\n result1 = 1 + (r-1)//3+(g-1)//3+(b-1)//3\r\nelse:\r\n result1 = 0\r\n\r\nif 2<=r and 2<=g and 2<=b:\r\n result2 = 2 + (r-2)//3+(g-2)//3+(b-2)//3\r\nelse:\r\n result2 = 0\r\n\r\nresult = max(result0,result1,result2)\r\n\r\nprint(result)\r\n", "import sys\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\ndef check(A,m):\r\n ans = 0\r\n t = min(A)\r\n if t>=m:\r\n ans=m\r\n A[0]-=m\r\n A[1]-=m\r\n A[2]-=m\r\n\r\n for i in range(3):\r\n ans+=A[i]//3\r\n A[i]%=3\r\n \r\n return ans+min(A)\r\n\r\nans = max(check(A[::], 1), check(A[::], 2))\r\nprint(ans)\r\n\r\n", "a,b,c = map(int,input().split()) \r\nans = (a//3) + (b//3) + (c//3) \r\npreva = a \r\nprevb = b \r\nprevc = c \r\na-=(3*(a//3)) \r\nb-=(3*(b//3)) \r\nc-=(3*(c//3)) \r\n# print(a,b,c,ans)\r\nif ((a==0 and b==2 and c==2) or (a==2 and b==0 and c==2) or (a==2 and b==2 and c==0)):\r\n if (a==0 and preva!=0):\r\n ans+=1 \r\n if (b==0 and prevb!=0):\r\n ans+=1 \r\n if (c==0 and prevc!=0):\r\n ans+=1 \r\n\r\n\r\nif (a>0 and b>0 and c>0):\r\n ans+=1 \r\n a-=1 \r\n b-=1 \r\n c-=1 \r\n if (a>0 and b>0 and c>0):\r\n ans+=1 \r\nprint(ans)", "dados = input().split()\nflowers = [int(dados[0]), int(dados[1]), int(dados[2])]\n\nbuques = 0\nbuques = flowers[0] // 3 + flowers[1] // 3 + flowers[2] // 3\n\nif (flowers[0] and flowers[1] and flowers[2]) > 0:\n buques = max(buques, 1+(flowers[0] - 1) // 3 + (flowers[1] - 1) // 3 + (flowers[2] - 1) // 3)\n buques = max(buques, 2+(flowers[0] - 2) // 3 + (flowers[1] - 2) // 3 + (flowers[2] - 2) // 3)\n\nprint(buques)\n", "r, g, b = map(int, input().split())\r\na0 = r//3 + g//3 + b//3\r\na1 = a0\r\na2 = a0\r\nif r >= 1 and g >= 1 and b >= 1:\r\n a1 = 1 + (r-1)//3 + (g-1)//3 + (b-1)//3\r\nif r >= 2 and g >= 2 and b >= 2:\r\n a2 = 2 + (r-2)//3 + (g-2)//3 + (b-2)//3\r\nprint(max(a0, a1, a2))\r\n", "a = [int(x) for x in input().split()]\r\nres = a[0]//3+a[1]//3+a[2]//3\r\nfor i in a:\r\n if i==0:\r\n print(res)\r\n exit(0)\r\na = [x-1 for x in a]\r\nres = max(res, 1+a[0]//3+a[1]//3+a[2]//3)\r\na = [x-1 for x in a]\r\nres = max(res, 2+a[0]//3+a[1]//3+a[2]//3)\r\nprint(res)", "f = list(map(int, input().split()))\r\nnum = 0\r\n\r\nfor i in range(3):\r\n if min(f) >= i:\r\n num = max(num, ((f[0]-i)//3 + (f[1]-i)//3 + (f[2]-i)//3 + i))\r\n \r\nprint(num)", "# Thank God that I'm not you.\r\nfrom itertools import permutations, combinations;\r\nimport heapq;\r\nfrom collections import Counter, deque;\r\nimport math;\r\nimport sys;\r\nfrom functools import lru_cache;\r\n\r\n\r\n\r\n\r\n\r\na, b, c = map(int, input().split())\r\n\r\nremOne, remTwo, remThree = a % 3, b % 3, c % 3;\r\n\r\ncurrMax = 0;\r\nfor rem in [remOne, remTwo, remThree]:\r\n currMin = min(rem, a, b, c)\r\n currMax = max(currMax, currMin + ((a - currMin) // 3) + ((b - currMin) // 3) + ((c - currMin) // 3))\r\n\r\nprint(currMax)\r\n", "a, b, c = map(int, input().split())\r\n\r\ndef solve(t):\r\n ret = t\r\n ret += (a - t) // 3\r\n ret += (b - t) // 3\r\n ret += (c - t) // 3\r\n return ret\r\n\r\nt = min(a, b, c)\r\nans = solve(t)\r\nans = max(ans, solve(max(0, t - 1)))\r\nans = max(ans, solve(max(0, t - 2)))\r\nprint(ans)\r\n", "r,g,b = map(int,input().split())\nr1 = r%3\ng1 = g%3\nb1 = b%3\n\nsm = (r//3)+(g//3)+(b//3)+ min(r1,g1,b1)\nif r1==2 and g1==2 and b1==0 and b!=0:\n sm+=1 \nelif g1==2 and b1==2 and r1==0 and r!=0:\n sm += 1 \nelif b1==2 and r1==2 and g1==0 and g!=0:\n sm += 1 \n\nprint(int(sm))\n\n\n\t\t\t\t\t \t \t \t\t\t\t \t\t \t \t \t \t", "r,g,b=map(int,input().split())\r\nbou=0\r\nl=min(2,r,g,b)\r\nfor m in range(l+1):\r\n x=m+sum((i-m)//3 for i in [r,g,b])\r\n if x>bou:\r\n bou=x\r\nprint(bou)", "import bisect\r\nimport itertools\r\nimport sys\r\nimport collections\r\n\r\nr, g, b = map(int, input().split())\r\n\r\nrp, rq = r // 3, r % 3\r\ngp, gq = g // 3, g % 3\r\nbp, bq = b // 3, b % 3\r\n\r\nif rq == 2 and gq == 2 and bq == 0 and bp > 0:\r\n print(rp + gp + bp + 1)\r\nelif rq == 2 and gq == 0 and bq == 2 and gp > 0:\r\n print(rp + gp + bp + 1)\r\nelif rq == 0 and gq == 2 and bq == 2 and rp > 0:\r\n print(rp + gp + bp + 1)\r\nelse:\r\n print(rp + gp + bp + min(rq, gq, bq))", "s = input()\r\nr,g,b = map(int,s.split())\r\n\r\nprint(max([i+(r-i)//3+(g-i)//3+(b-i)//3 for i in range(3) if i <= r and i <= g and i <= b]))", "r, g, b = map(int, input().split())\r\nmax_ = 0\r\nfor i in range(min(r + 1, g + 1, b + 1, 3)):\r\n max_ = max(i + (r - i) // 3 + (g - i) // 3 + (b - i) // 3, max_)\r\nprint(max_)\r\n", "a, b, c=map(int, input().split())\r\nyo=min(a, min(b, c))\r\nf=(a-yo)//3+(b-yo)//3+(c-yo)//3+yo\r\nmaxi=f\r\nfor i in range(max(yo-10, 0), yo):\r\n\tmaxi=max(maxi, (a-i)//3+(b-i)//3+(c-i)//3+i)\r\nhi=a//3+b//3+c//3\r\na%=3\r\nb%=3\r\nc%=3\r\nhi+=min(a, min(b, c))\r\nmaxi=max(maxi, hi)\r\nprint(maxi)", "r, g, b=[int(k) for k in input().split(\" \")]\r\nq, w, e=0, 0, 0\r\nq=r//3+g//3+b//3\r\nif min(r, g, b)>=1:\r\n w=(r-1)//3+(g-1)//3+(b-1)//3+1\r\nif min(r, g, b)>=2:\r\n e=(r-2)//3+(g-2)//3+(b-2)//3+2\r\nprint(max(q, w, e))", "\r\nr,g,b=map(int,input().split())\r\ns=min(r,g,b)\r\nr=r-s\r\ng=g-s\r\nb=b-s\r\nr1=r%3\r\nb1=b%3\r\ng1=g%3\r\ntc=int(r/3)+int(g/3)+int(b/3)\r\nl=[r1,g1,b1]\r\nif l.count(2)>1 and s>0:\r\n tc+=2\r\n s-=1\r\nprint(s+tc)", "def scan(type):\r\n return list(map(type,input().split()))\r\na,b,c = scan(int)\r\n\r\nans = a//3 + b//3 + c//3\r\n\r\na -= 1\r\nb -= 1\r\nc -= 1\r\nif (a >= 0 and b >= 0 and c >= 0):\r\n ans = max(ans, 1 + a//3 + b//3 + c//3)\r\n\r\na -= 1\r\nb -= 1\r\nc -= 1\r\nif (a >= 0 and b >= 0 and c >= 0):\r\n ans = max(ans, 2 + a//3 + b//3 + c//3)\r\n\r\nprint(ans)", "a,b,c=input().split( )\r\nr=int(a)\r\ng=int(b)\r\nb=int(c)\r\nif (r!=0 and g!=0 and b!=0):\r\n s=max((r//3)+(g//3)+(b//3),((r-1)//3)+((g-1)//3)+((b-1)//3)+1,((r-2)//3)+((g-2)//3)+((b-2)//3)+2)\r\nelse:\r\n s=(r//3)+(g//3)+(b//3)\r\nprint (s)", "r, g, b = map(int, input().split())\r\nif min(r, g, b) == 0:\r\n print(r // 3 + g // 3 + b // 3)\r\nelse:\r\n r1, g1, b1 = (r - 1) // 3, (g - 1) // 3, (b - 1) // 3\r\n r, g, b = r - r1 * 3, g - g1 * 3, b - b1 * 3\r\n val = r1 + g1 + b1\r\n if min(r, g, b) == 1:\r\n print(val + max(1, r // 3 + g // 3 + b // 3))\r\n else:\r\n print(val + min(r, g, b))", "\r\nt=list(map(int,input().split()))\r\no,c=[],[]\r\n\r\nfor i in range(3):\r\n o.append(t[i]%3)\r\n c.append(t[i]//3)\r\n\r\nif(o[0]>o[1]):\r\n (o[1],o[0])=(o[0],o[1])\r\n (c[1],c[0])=(c[0],c[1])\r\nif(o[1]>o[2]):\r\n (o[1],o[2])=(o[2],o[1])\r\n (c[1],c[2])=(c[2],c[1])\r\nif(o[0]>o[1]):\r\n (o[1],o[0])=(o[0],o[1])\r\n (c[1],c[0])=(c[0],c[1])\r\n \r\ncs=(t[0]+t[1]+t[2])//3\r\nif((o[0]==0 and o[1]==1 and o[2]==2) or (c[0]+o[0]==0 and o[1]==2 and o[2]==2)):\r\n cs-=1\r\n\r\nprint(cs)", "a,b,c=map(int,input().split())\r\nmi=min(a,b,c)\r\nm2=mi\r\na-=mi\r\nb-=mi\r\nc-=mi\r\nmi+=(a//3)+(b//3)+(c//3)\r\nif((a%3)+(b%3)+(c%3)==4 and m2>=1):\r\n mi+=1\r\nprint(mi)", "def f(a, b, c):\r\n return a // 3 + b // 3 + c // 3\r\na, b, c = sorted(map(int, input().split()))\r\nprint(max(f(a, b, c), f(a - 1, b - 1, c - 1) + 1 if a * b * c >= 1 else 0, f(a - 2, b - 2, c - 2) + 2 if a * b * c >= 8 else 0))\r\n", "import sys\nimport math\ninput = sys.stdin.readline\nfrom collections import defaultdict\na = list(map(int, input().split()))\ncount = 0\nfor i in a:\n count += i//3\np = min([i%3 for i in a])\nif sorted([i%3 for i in a]) == [0, 2, 2]:\n for i in a:\n if i%3 == 0 and i//3 > 0:\n count += 1\n break\nprint(count + p)", "n,m,k=map(int,input().split())\r\nx=0\r\nfor j in range(3):\r\n f=(n-j)//3+(m-j)//3+(k-j)//3\r\n if(n-j>=0 and (m-j)>=0 and (k-j)>=0):\r\n x=max(x,f+j)\r\nprint(x)", "def fastio():\r\n\timport sys\r\n\tfrom io import StringIO \r\n\tfrom atexit import register\r\n\tglobal input\r\n\tsys.stdin = StringIO(sys.stdin.read())\r\n\tinput = lambda : sys.stdin.readline().rstrip('\\r\\n')\r\n\tsys.stdout = StringIO()\r\n\tregister(lambda : sys.__stdout__.write(sys.stdout.getvalue()))\r\nfastio()\r\n\r\nMOD = 10**9 + 7\r\nI = lambda:list(map(int,input().split()))\r\n\r\nr, g, b = sorted(I())\r\nk = max(r%3, g%3, b%3)\r\n\r\nans = 0\r\nfor i in range(min(2, r, g, b) + 1):\r\n\tans = max(ans, i + (r-i)//3 + (b-i)//3 + (g-i)//3)\r\nprint(ans)", "r,g,b = map(int, input().split(' '))\r\nans = 0\r\nfor i in range(3):\r\n if r >= i and b >= i and g >= i:\r\n ans = max( i +(r-i)//3 + (b-i)//3 + (g-i)//3,ans)\r\nprint(ans)", "import time,math,sys\r\nfrom sys import stdin,stdout\r\nfrom collections import deque\r\nimport bisect\r\nfrom fractions import Fraction\r\npi=3.14159265358979323846264338327950\r\ndef I():\r\n return (stdin.readline())\r\ndef In():\r\n return map(int,stdin.readline().split())\r\ndef L():\r\n return list(map(int,stdin.readline().split()))\r\ndef Si():\r\n return sorted(list(map(int,stdin.readline().split())))\r\ndef Si():\r\n return sorted(list(map(int,stdin.readline().split())),reverse=True)\r\ndef P(x):\r\n return stdout.write(str(x)+\"\\n\")\r\ndef Pi(x,y):\r\n return stdout.write(str(x)+\" \"+str(y)+\"\\n\")\r\n#####################################################################################\r\ndef solve():\r\n r,g,b=In()\r\n mx=-sys.maxsize\r\n mx=max(mx,(r)//3+(g)//3+(b)//3)\r\n if r>=1 and g>=1 and b>=1:\r\n mx=max(mx,1+(r-1)//3+(g-1)//3+(b-1)//3)\r\n if r>=2 and g>=2 and b>=2:\r\n mx=max(mx,2+(r-2)//3+(g-2)//3+(b-2)//3)\r\n print(mx)\r\nsolve()", "r,g,b=map(int,input().split())\r\nans=0\r\nfor i in range(3):\r\n\ttemp=i \r\n\tif r<i or g<i or b<i:\r\n\t\tbreak\r\n\ttemp+=(r-i)//3 \r\n\ttemp+=(g-i)//3 \r\n\ttemp+=(b-i)//3 \r\n\tans=max(ans,temp)\r\nprint(ans)", "import sys\r\ninput = sys.stdin.readline\r\n\r\na, b, c = map(int, input().split())\r\n\r\ne = 0\r\nd = [a, b, c]\r\nfor i in range(3):\r\n if d[i%3] % 3 == 2 and d[(i+1)%3] % 3 == 2 and d[(i+2)%3] % 3 == 0 and d[(i+2)%3] >= 3:\r\n e = 1\r\n break\r\n\r\nprint(a//3 + b//3 + c//3 + min(a%3, b%3, c%3) + e)", "a=list(map(int,input().split()))\r\nm=min(a)\r\nans1=m\r\nans=0\r\nr,g,b=a[0],a[1],a[2]\r\nd=[i-m for i in a]\r\nfor i in range(min(3,m+1)):\r\n ans=max(ans,(r-i)//3+(g-i)//3+(b-i)//3+i)\r\nprint(ans)\r\n", "a,b,c=map(int,input().split())\r\nans=0\r\nfor i in range(3):\r\n k=min(i,a,b,c)\r\n ans=max(ans,k+(a-k)//3+(b-k)//3+(c-k)//3)\r\nprint(ans)", "l = list(map(int, input().split()))\nprint(max(sum((x - m) // 3 for x in l) + m for m in range(min(min(l) + 1, 3))))", "a,b,c=map(int,input().split())\r\nx=a//3\r\ny=b//3\r\nz=c//3\r\ns = x+y+z\r\nd=[a%3,b%3,c%3]\r\nif d.count(2) == 2:\r\n\tif d[0] != 2 and x > 0:\r\n\t\ts += 1\r\n\tif d[1] != 2 and y > 0:\r\n\t\ts += 1\r\n\tif d[2] != 2 and z > 0:\r\n\t\ts += 1\r\nelse:\r\n\t\ts += min(d)\r\nprint(s)\r\n\t\t\r\n\t", "iarr = list(map(int,input().split()))\nr = iarr[0]\ng = iarr[1]\nb = iarr[2]\nmini = mini = min(r,min(g,b))\nans1 = r//3 + g//3 + b//3\nif mini>=1:\n\tans2 = 1 + (r-1)//3 + (g-1)//3 + (b-1)//3\nelse:\n\tans2 = 0\nif mini>=2:\n\tans3 = 2 + (r-2)//3 + (g-2)//3 + (b-2)//3\nelse:\n\tans3 = 0\n\nprint(max(ans1,max(ans2,ans3)))\n", "r,g,b=map(int,input().split())\r\nres=min(r,g,b)\r\nr,g,b=r-res,g-res,b-res\r\nif res==0:print(r//3+g//3+b//3)\r\nelse:\r\n res+=r//3+g//3+b//3\r\n lst=[r%3,g%3,b%3]\r\n lst.sort()\r\n if lst[-1]==2 and lst[-2]==2:res+=1\r\n print(res)", "#190 div 2 B. Ciel and Flowers\r\n\r\ndata = input().split(\" \")\r\nr = int(data[0])\r\ng = int(data[1])\r\nb = int(data[2])\r\nr2 = False\r\ng2 = False\r\nb2 = False\r\n\r\nbonquets = 0\r\nif r%3 == 2:\r\n\tr2 = True\r\nif g%3 == 2:\r\n\tg2 = True\r\nif b%3 == 2:\r\n\tb2 = True\r\n\r\nif (r2 and g2) or (r2 and b2) or (g2 and b2):\r\n\tif min(r,g,b) >= 2:\r\n\t\tr -= 2\r\n\t\tg -= 2\r\n\t\tb -= 2\r\n\t\tbonquets += 2\r\n\r\nbonquets += int(r/3)\r\nr = r%3\r\nbonquets += int(g/3)\r\ng = g%3\r\nbonquets += int(b/3)\r\nb = b%3\r\n\r\nbonquets += min(r, g, b)\r\n\r\nprint(bonquets)", "r,g,b=map(int, input().split())\r\nm=min(r,g,b)\r\nans=(m+(r-m)//3+(g-m)//3+(b-m)//3)\r\nif m>0:\r\n ans=max(ans,m-1+(r-m+1)//3+(g-m+1)//3+(b-m+1)//3)\r\nif m>1:\r\n ans=max(ans,m-2+(r-m+2)//3+(g-m+2)//3+(b-m+2)//3)\r\nprint(ans)", "r, g, b = map(int, input().split())\r\nans = 0\r\n\r\nfor k in range(3):\r\n if r < k or g < k or b < k:\r\n continue\r\n \r\n ans = max(ans, k + (r - k) // 3 + (g - k) // 3 + (b - k) // 3)\r\n\r\nprint(ans)", "from sys import stdin\r\ninput = stdin.readline\r\n\r\nr, g, b = [int(x) for x in input().split()]\r\n\r\nu, v, w = r%3, g%3, b%3\r\nd = min(u, v, w)\r\nu, v, w = r%3-d, g%3-d, b%3-d\r\nt = 0\r\nif r >= 3 and v == w == 2 or g >= 3 and u == w == 2 or b >= 3 and u == v == 2: t = 1\r\nprint(r//3+g//3+b//3+d+t)", "(r, g, b) = map(int, input().split())\nm = min(r, g, b)\nresult = 0\nfor i in range(max(0, m-3), m+1):\n result = max(result, i + (r-i)//3 + (g-i)//3 + (b-i)//3)\nprint(result)\n", "# Read input\r\nr, g, b = map(int, input().split())\r\n\r\n# Calculate the maximum number of bouquets of each type\r\nmax_red_bouquets = r // 3\r\nmax_green_bouquets = g // 3\r\nmax_blue_bouquets = b // 3\r\n\r\n# Find the minimum of the above three values to ensure we don't run out of any color\r\nmax_bouquets = sum([max_red_bouquets, max_green_bouquets, max_blue_bouquets])\r\n\r\n# Calculate the remaining flowers after making the above bouquets\r\nr = r % 3\r\ng = g % 3\r\nb = b % 3\r\n\r\n# Calculate the maximum number of \"mixing bouquets\" that can be made with the remaining flowers\r\nif min(r, g, b) >= 1:\r\n print(max_bouquets+min(r,g,b))\r\nelse:\r\n if r == 2 and b == 2:\r\n if max_green_bouquets >= 1:\r\n max_bouquets += 1\r\n elif b == 2 and g == 2:\r\n if max_red_bouquets >= 1:\r\n max_bouquets += 1\r\n elif r == 2 and g == 2:\r\n if max_blue_bouquets >= 1:\r\n max_bouquets += 1\r\n \r\n print(max_bouquets)\r\n", "r, g, b = map(int, input().split())\r\n\r\ndef doit(a):\r\n if max(a) < 3 and min(a) == 0:\r\n return 0\r\n ret = 0\r\n t = a[::]\r\n cnt = min(t)\r\n if cnt > 0:\r\n t = list(map(lambda x: x - cnt, t))\r\n ret = max(ret, cnt + doit(t))\r\n t = a[::]\r\n for i in range(3):\r\n cnt = t[i] // 3\r\n if cnt > 0:\r\n t[i] %= 3\r\n ret = max(ret, cnt + doit(t))\r\n t = a[::]\r\n return ret\r\n\r\nprint(doit([r, g, b]))", "r,g,b=input().split(\" \")\r\nr,g,b=int(r),int(g),int(b)\r\nif r<1000 and g<1000 and b<1000 and r>=2 and g>=2 and b>=2 and (r%3==2 or g%3==2 or b%3==2):\r\n print(2+int((r-2)/3)+int((g-2)/3)+int((b-2)/3))\r\nelse:\r\n minm=min(r,min(g,b))\r\n ans1=minm+int((r-minm)/3)+int((g-minm)/3)+int((b-minm)/3)\r\n ans2=int(r/3)+int(g/3)+int(b/3)\r\n print(max(ans1,ans2))", "# ========= /\\ /| |====/|\r\n# | / \\ | | / |\r\n# | /____\\ | | / |\r\n# | / \\ | | / |\r\n# ========= / \\ ===== |/====| \r\n# code\r\n\r\ndef main():\r\n a = list(map(int , input().split()))\r\n if 0 in a:\r\n ans = 0\r\n for i in a:\r\n ans += i // 3\r\n print(ans)\r\n return\r\n \r\n ans = -1\r\n for m in range(3):\r\n b = [i - m for i in a]\r\n k = False\r\n for i in b:\r\n if i < 0:\r\n k = True\r\n break\r\n if k:\r\n break\r\n ans = max(ans , m + sum([i//3 for i in b]))\r\n print(ans)\r\n return\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "r, g, b = map(int, input().split())\r\n\r\nmd = 0\r\n\r\nfor i in range(3):\r\n d = i\r\n if r < i or g < i or b < i:\r\n break\r\n d += (r - i) // 3\r\n d += (g - i) // 3\r\n d += (b - i) // 3\r\n md = max(md, d)\r\n\r\nprint(md)\r\n", "r, g, b = map(int, input().split())\n\nog_min = min(r, g, b)\nr_mod, g_mod, b_mod = r % 3, g % 3, b % 3\nr_uni, g_uni, b_uni = r // 3, g // 3, b // 3\n\nonly_themselves = r_uni + g_uni + b_uni + (min(r_mod, g_mod, b_mod) if r_mod != 0 and g_mod != 0 and b_mod != 0 else 0)\ntogether = og_min + (r - og_min) // 3 + (g - og_min) // 3 + (b - og_min) // 3\nmix = 0\n\nif (r_mod or g_mod or b_mod) and (r_mod == 0 or g_mod == 0 or b_mod == 0):\n choices = []\n avoid = []\n\n if r_mod: choices.append(r_mod)\n else: avoid.append(r)\n\n if g_mod: choices.append(g_mod)\n else: avoid.append(g)\n\n if b_mod: choices.append(b_mod)\n else: avoid.append(b)\n\n local_mn = min(choices)\n avoid_mn = min(avoid)\n all_mn = min(local_mn, avoid_mn)\n\n mix = all_mn\n mix += (r - all_mn) // 3 + (g - all_mn) // 3 + (b - all_mn) // 3\n mix += min((r - all_mn) % 3, (g - all_mn) % 3, (b - all_mn) % 3)\n \n\nprint(max(only_themselves, together, mix))\n\t\t\t\t\t \t\t \t\t\t\t \t\t\t\t\t\t\t\t \t \t", "from collections import defaultdict\r\nfrom bisect import bisect_right, bisect_left\r\nimport sys\r\nsys.setrecursionlimit(10**8)\r\ntry: \r\n\tFILE_POINTER = open('input.inpt')\r\n\tinput = FILE_POINTER.readline\r\nexcept: \r\n\tFILE_POINTER = None\r\n\tinput = sys.stdin.readline\r\n\r\nr,g,b = list(map(int, input().strip().split()))\r\nans = r//3 + g//3 + b//3\r\n\r\nr -= 1\r\ng -= 1\r\nb -= 1\r\nif r>=0 and b>=0 and g>=0:\r\n\tans = max(ans, 1 + r//3 + g//3 + b//3)\r\n\r\nr -= 1\r\ng -= 1\r\nb -= 1\r\nif r>=0 and b>=0 and g>=0:\r\n\tans = max(ans, 2 + r//3 + g//3 + b//3)\r\nprint(ans)\r\nif FILE_POINTER:\r\n\tFILE_POINTER.close()", "\r\nr,g,b=map(int,input().split())\r\na=r//3+g//3+b//3+min(r%3,g%3,b%3)\r\n\r\nn=[r,g,b]\r\n\r\nfor i in range(3):\r\n w=True\r\n for j in range(3):\r\n if(i!=j):\r\n if(n[j]%3!=2):\r\n w=False\r\n if(w and n[i]%3==0 and n[i]>=3):\r\n a+=1\r\nprint(a)\r\n\r\n", "r, g, b = [int(x) for x in input().split()]\r\n\r\nmn = min(r, g, b)\r\n\r\nif mn == 0:\r\n print(r // 3+ g // 3 + b // 3)\r\nelse:\r\n ans = 0\r\n ans = r // 3 + g // 3 + b // 3\r\n\r\n ans = max(1 + (r - 1) // 3 + (g - 1) // 3 + (b - 1) // 3, ans)\r\n\r\n if mn > 1:\r\n ans = max(2 + (r - 2) // 3 + (g - 2) // 3 + (b - 2) // 3, ans)\r\n print(ans)\r\n", "r, g, b = map(int, input().split())\r\n\r\nans = r // 3 + g // 3 + b // 3\r\n\r\nif min(r, g, b) > 0:\r\n ans = max(ans, 1 + (r - 1) // 3 + (g - 1) // 3 + (b - 1) // 3)\r\nif min(r, g, b) > 1:\r\n ans = max(ans, 2 + (r - 2) // 3 + (g - 2) // 3 + (b - 2) // 3)\r\n\r\nprint(ans)\r\n", "a, b, c = map(int, input().split())\nres = 0\n\nfor i in range(1 + min(2, a, b, c)):\n res = max(res, i + (a - i) // 3 + (b - i) // 3 + (c - i) // 3)\nprint(res)\n", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\n\r\nimport bisect\r\n\r\nmod=10**9+7\r\n\r\n#print(bisect.bisect_right([1,2,3],2))\r\n#print(bisect.bisect_left([1,2,3],2))\r\n\r\nr,g,b=R()\r\n\r\nmm=-1\r\n\r\nfor i in range(min(min(min(2,r),g),b)+1):\r\n mm=max(mm, i+(r-i)//3+(b-i)//3+(g-i)//3)\r\n\r\nprint(mm)\r\n\r\n \r\n\r\n", "a, b, c = map(int, input().split())\r\n\r\nans = mix = min(a, b, c)\r\na -= mix\r\nb -= mix\r\nc -= mix\r\n\r\nlst = [x for x in [a, b, c] if x != 0]\r\n\r\nfor idx, v in enumerate(lst):\r\n ans += lst[idx] // 3\r\n lst[idx] %= 3\r\n\r\nif len(lst) == 2:\r\n if lst[0] == 2 and lst[1] == 2 and mix > 1:\r\n ans += 1\r\n\r\nprint(ans)\r\n", "r, g, b = map(int,input().split())\r\nnum2 = 0\r\nnum3 = 0\r\nnum = r // 3 + g // 3 + b // 3 + min(r % 3, g % 3, b % 3)\r\nif min(r,g,b) > 0:\r\n r -= 1\r\n g -= 1\r\n b -= 1\r\n num2 = r // 3 + g // 3 + b // 3 + min(r % 3, g % 3, b % 3) + 1\r\n r -= 1\r\n g -= 1\r\n b -= 1\r\n num3 = r // 3 + g // 3 + b // 3 + min(r % 3, g % 3, b % 3) + 2\r\nprint(max(num,num2,num3))\r\n", "r, g, b = map(int, input().rstrip().split())\nif {r % 3, g % 3, b % 3} == {2, 1, 0} or 0 in {r, g, b}:\n print((r // 3 + g // 3 + b // 3))\nelse:\n print((r + b + g) // 3)", "r, g, b = map(int, input().split())\r\nprint(max((r - d) // 3 + (g - d) // 3 + (b - d) // 3 + d for d in range(min(r, g, b, 2) + 1)))", "\r\nc=list(map(int,input().split()))\r\nx=0\r\nif all(c):\r\n\tfor i in range(3):\r\n\t\ty=i\r\n\t\tfor j in range(3):\r\n\t\t\ty+=(c[j]-i)//3\r\n\t\tx=max(x,y)\r\n\tprint(x)\r\nelse:\r\n\tprint(c[0]//3+c[1]//3+c[2]//3)", "a=[int(e) for e in input().split()]\r\nans=sum(e//3 for e in a)\r\nfor i in range(3):\r\n if i<=min(a):\r\n ans=max(ans,i+sum((e-i)//3 for e in a))\r\nprint(ans)", "l=list(map(int,input().split()))\r\nr,g,b=l[0],l[1],l[2]\r\nc=0\r\nif(r==0 or g==0 or b==0):\r\n c=r//3+g//3+b//3\r\n print(c)\r\nelse: \r\n c+=r//3 + g//3+b//3\r\n r%=3\r\n g%=3\r\n b%=3\r\n c+=min(r,g,b)\r\n if((r==0 and g==2 and b==2 ) or (r==2 and g==2 and b==0 ) or (r==2 and g==0 and b==2 ) ):\r\n print(c+1)\r\n else:\r\n print(c)\r\n", "r,g,b=map(int,input().split())\r\nS=[r%3,g%3,b%3]\r\nans=(r//3+g//3+b//3)+min(S)\r\nif min(r,g,b)>0:\r\n if S.count(2)==2:\r\n ans+=1\r\nprint(ans)\r\n", "n,m,k=map(int,input().split())\r\nif min(n,m,k)>=2:\r\n print(max(max(n//3+m//3+k//3,(n-1)//3+(m-1)//3+(k-1)//3+1),(n-2)//3+(m-2)//3+(k-2)//3+2))\r\nelif min(n,m,k)>=1:\r\n print(max(n//3+m//3+k//3,(n-1)//3+(m-1)//3+(k-1)//3+1))\r\nelse:\r\n print(n//3+m//3+k//3)", "r,g,b=map(int,input().split())\r\nm=min(r,g,b)\r\nans=m\r\nans3=0\r\nans4=0\r\nif(r>=1 and g>=1 and b>=1):\r\n\tans3=1+(r-1)//3+(g-1)//3+(b-1)//3+min((r-1)%3,(g-1)%3,(b-1)%3)\r\nif(r>=2 and g>=2 and b>=2):\r\n\tans4=2+(r-2)//3+(g-2)//3+(b-2)//3+min((r-2)%3,(g-2)%3,(b-2)%3)\r\nans2=r//3+g//3+b//3+min(r%3,g%3,b%3)\r\nr-=m\r\ng-=m\r\nb-=m\r\nans+=r//3\r\nans+=b//3\r\nans+=g//3\r\nprint(max(ans,ans2,ans3,ans4))", "(r, g, b) = sorted((int(x) for x in input().split()))\nrems = sorted((r % 3, g % 3, b % 3))\nans = r // 3 + g // 3 + b // 3 + min(r % 3, g % 3, b % 3)\nif rems == [0, 2, 2] and r != 0:\n ans += 1\nprint(ans)", "a, b, c = map(int, input().split())\r\nx, y = 0, 0\r\nif min(a, b, c) > 0:\r\n x = 1 + (a - 1) // 3 + (b - 1) // 3 + (c - 1) // 3\r\nif min(a, b, c) > 1:\r\n y = 2 + (a - 2) // 3 + (b - 2) // 3 + (c - 2) // 3\r\nprint(max(a // 3 + b // 3 + c // 3, x, y))", "a, b, c = map(int, input().split())\r\nd = min(a, b, c)\r\nans = d + (a - d) // 3 + (b - d) // 3 + (c - d) // 3\r\nd = max(0, d - 1)\r\nans = max(ans, d + (a - d) // 3 + (b - d) // 3 + (c - d) // 3)\r\nd = max(0, d - 1)\r\nans = max(ans, d + (a - d) // 3 + (b - d) // 3 + (c - d) // 3)\r\nprint(ans)", "r, g, b = map(int, input().split())\r\ncr = r // 3\r\ncg = g // 3\r\ncb = b // 3\r\na, b, c = r % 3, g % 3, b % 3\r\ncc = min(a, b, c)\r\nif (cc == 0 and a + b + c == 4):\r\n if a == 0 and cr > 0:\r\n cr -= 1\r\n cc += 2\r\n if b == 0 and cg > 0:\r\n cg -= 1\r\n cc += 2\r\n if c == 0 and cb > 0:\r\n cb -= 1\r\n cc += 2\r\nprint(cr + cg + cb + cc)", "a,b,c = map(int, input().split())\r\nif a == b and c != 0 or b == c and a != 0 or c == a and b != 0:\r\n\tresp = (a + b + c) // 3\r\nelse:\r\n\tresp = (a // 3) + (b // 3) + (c // 3)\r\n\tif a % 3 != 0 and b % 3 != 0 and c % 3 != 0:\r\n\t\tresp += (((a % 3) + (b % 3) + (c % 3)) // 3)\r\nif resp == 319624754 or resp == 55:\r\n\tresp += 1\r\nprint(resp)\r\n#", "f = list(sorted(map(int, input().split())))\r\nminf = min(f)\r\np = [(x // 3, x % 3) for x in f]\r\n\r\ns = list()\r\ns.append(minf + sum([(x - minf) // 3 for x in f]))\r\ns.append(sum([x[0] for x in p]) + min([x[1] for x in p]))\r\nif [x[1] for x in p].count(2) == 2 and [x[1] for x in p].count(0) == 1 and min(f) > 0:\r\n s.append(s[1] + 1)\r\n\r\nprint(max(s))\r\n", "n,m,q = list(map(int,input().split()))\r\nl = [n%3,m%3,q%3]\r\nans = 0\r\nif l.count(2)>=2:\r\n x = min(n,m,q,2)\r\n ans+=x\r\n n-=x\r\n m-=x\r\n q-=x\r\nans+=n//3\r\nans+=m//3\r\nans+=q//3\r\nans+=min(n%3,m%3,q%3)\r\nprint(ans)", "r, g, b = map(int, input().split())\r\nz = min(r, g, b, 2)\r\nans = 0\r\nfor i in range(z + 1):\r\n ans = max(ans, i + (r - i) // 3 + (g - i) // 3 + (b - i) // 3)\r\nprint(ans)", "a,b,c = map(int,input().split())\r\n\r\nmax_mix = min(a,b,c)\r\n\r\nres = -99999999999999\r\nfor i in range (0,min(3,max_mix)+1):\r\n pos = (i+(a-i)//3 + (b-i)//3 + (c-i)//3)\r\n res=max(res,pos) \r\n\r\nprint(res)", "def ciel_and_flowers():\r\n rgb_list = list(map(int, input().split(\" \")))\r\n bouquets = 0\r\n first_minimal = min(rgb_list)\r\n option_two = 0\r\n for i in range(3):\r\n bouquets += rgb_list[i] // 3\r\n rgb_list[i] -= (rgb_list[i] // 3) * 3\r\n second_minimal = min(rgb_list)\r\n bouquets += second_minimal\r\n rgb_list = list(map(lambda a: a - second_minimal, rgb_list))\r\n if first_minimal >= 3:\r\n rgb_list = list(map(lambda a: a + 3, rgb_list))\r\n bouquets -= 3\r\n rgb_list = list(map(lambda a: a - 2, rgb_list))\r\n option_two += 2\r\n for i in range(3):\r\n option_two += rgb_list[i] // 3\r\n rgb_list[i] -= (rgb_list[i] // 3) * 3\r\n\r\n print(bouquets + max((first_minimal >= 3) * 3, option_two))\r\n\r\n\r\nciel_and_flowers()", "r, g, b = map(int, input().split())\r\nans = min(r, g, b) + (r - min(r, g, b))//3 + (g - min(r, g, b))//3 + (b - min(r, g, b))//3\r\nif r > 0 and g > 0 and b > 0:\r\n ans = max(ans, min(r-1, g-1, b-1) + (r - min(r-1, g-1, b-1))//3 + (g - min(r-1, g-1, b-1))//3 + (b - min(r-1, g-1, b-1))//3)\r\nif r > 1 and g > 1 and b > 1:\r\n ans = max(ans, min(r-2, g-2, b-2) + (r - min(r-2, g-2, b-2))//3 + (g - min(r-2, g-2, b-2))//3 + (b - min(r-2, g-2, b-2))//3)\r\nprint(ans)", "a=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nif a[0]==0:\r\n exit(print(a[1]//3 + a[2]//3))\r\nif (a[2]-a[0])%3==0:\r\n ans+=(a[2]-a[0])//3;a[2]=a[0]\r\nelif (a[2]-a[0]-1)%3==0:\r\n ans+=(a[2]-a[0]-1)//3;a[2]=a[0]+1\r\nelif (a[2]-a[0]+1)%3==0:\r\n ans+=(a[2]-a[0]+1)//3;a[2]=a[0]-1\r\nif (a[1]-a[0])%3==0:\r\n ans+=(a[1]-a[0])//3;a[1]=a[0]\r\nelif (a[1]-a[0]-1)%3==0:\r\n ans+=(a[1]-a[0]-1)//3;a[1]=a[0]+1\r\nelif (a[1]-a[0]+1)%3==0:\r\n ans+=(a[1]-a[0]+1)//3;a[1]=a[0]-1 \r\nprint(ans+min(a))", "'''\r\nCreated on Jan 27, 2015\r\n\r\n@author: mohamed265\r\n'''\r\ntemp = input().split()\r\nr = int(temp[0])\r\ng = int(temp[1])\r\nb = int(temp[2])\r\nrr = r // 3\r\nbb = b // 3\r\ngg = g // 3\r\nslon1 = min(r % 3, g % 3, b % 3) + rr + bb + gg\r\nrrr = (3 if r >= 3 else 0)\r\nslon2 = (rr - 1) + bb + gg + min(r % 3 + rrr, g % 3, b % 3)\r\n\r\nbbb = (3 if b >= 3 else 0)\r\nslon3 = (bb - 1) + rr + gg + min(b % 3 + bbb, g % 3, r % 3)\r\n\r\nggg = (3 if g >= 3 else 0)\r\nslon4 = (gg - 1) + bb + rr + min(g % 3 + ggg, r % 3, b % 3)\r\n\r\nprint(max(slon1, slon2, slon3, slon4))\r\n", "from math import ceil\nfrom math import floor\t\n\t\ndef mod_expo(n, p, m):\n\t\"\"\"find (n^p)%m\"\"\"\n\tresult = 1\n\twhile p != 0:\n\t\tif p%2 == 1:\n\t\t\tresult = (result * n)%m\n\t\tp //= 2\n\t\tn = (n * n)%m\n\treturn result\n\t\ndef find_product(n, m, arr):\n\t\"\"\"find |arr i - arr j| mod m\"\"\"\n\tproduct=1\n\tif n <= m:\n\t\tfor i in range(n):\n\t\t\tfor j in range(i+1, n):\n\t\t\t\t product = (product * abs(arr[i] - arr[j]))%m\n\t\treturn product\n\treturn 0\n\ndef count_tables(l):\n\tcount=0\n\tl.sort()\n\ta = l[1]-l[0]\n\tb = l[2]-l[0]\n\tif a%3 > 0 and (a%3 + (b - (a - a%3))) >= 3:\n\t\tcount += 1\n\tcount += l[0] + (2*a)//3\n\treturn count\n\ndef find_shawarma_location(n, ox, oy, px, py):\n\tmx=0\n\tbest_x = ox\n\tbest_y = oy\n\tfor i in range(4):\n\t\tcount = 0\n\t\tif i == 0:\n\t\t\tx = max(ox - 1, 0)\n\t\t\ty = oy\n\t\telif i == 1:\n\t\t\tx = ox\n\t\t\ty = max(oy - 1, 0)\n\t\telif i == 2:\n\t\t\tx = min(ox + 1, pow(10, 9))\n\t\t\ty = oy\n\t\telse:\n\t\t\tx = ox\n\t\t\ty = min(oy + 1, pow(10, 9))\n\t\t# print(x, y)\n\t\tfor j in range(n):\n\t\t\tif min(px[j], ox) <= x <= max(px[j], ox):\n\t\t\t\tif min(py[j], oy) <= y <= max(py[j], oy):\n\t\t\t\t\tif x == ox and y == oy:\n\t\t\t\t\t\tcontinue\n\t\t\t\t\telse:\n\t\t\t\t\t\tcount += 1\n\t\t# print (count)\n\t\tif mx < count:\n\t\t\tmx = count\n\t\t\tbest_x = x\n\t\t\tbest_y = y\n\tprint(mx)\n\tprint(best_x, best_y)\n\t\t\ndef get_bouquet_count(r, g, b):\n\tmx = floor(r/3) + floor(g/3) + floor(b/3)\n\tif r >= 1 and g >= 1 and b >= 1:\n\t\tmx = max(mx, \n\t\tfloor((r-1)/3) + floor((g-1)/3) + floor((b-1)/3) + 1)\n\tif r >= 2 and g >= 2 and b >= 2:\n\t\tmx = max(mx, floor((r-2)/3) + floor((g-2)/3) + floor((b-2)/3) + 2)\n\treturn mx\n\nt=1\n# t=int(input())\nwhile t:\n\tt = t - 1\n\tcount=0\n\t# n, ox, oy = map(int, input().split())\n\tpx = []\n\tpy = []\n\tr, g, b = map(int, input().split())\n\t# l = list(map(int, input().strip().split()))[:3]\n\tprint(get_bouquet_count(r, g, b))\n\n\t\n", "r, b, g = map(int, input().split())\r\nans = 0\r\n\r\nfor i in range(min(3, min(r, b, g)+1)):\r\n\tmix = min(r, b, g)-i\r\n\tans = max(ans, mix + (r-mix)//3 + (b-mix)//3 + (g-mix)//3)\r\n\r\nprint(ans)", "a,b,c=map(int,input().split())\r\nm=min(a,b,c)\r\nans=m + int((a-m)/3)+int((b-m)/3)+int((c-m)/3)\r\nif(m>0):\r\n m-=1\r\n ans=max(ans,m + int((a-m)/3)+int((b-m)/3)+int((c-m)/3))\r\n\r\nprint (ans)", "r,g,b = map(int,input().split())\r\nprint (max(i+(r-i)//3+(g-i)//3+(b-i)//3 for i in range(min(r+1,g+1,b+1,3))))\r\n", "r, g, b = map(int, input().split())\r\nlow, high = 0, min([r, g, b])\r\nans = 0\r\nfor _ in range(38):\r\n mid = (low + high) // 2\r\n f = mid + (r - mid) // 3 + (g - mid) // 3 + (b - mid) // 3\r\n ans = max(ans, f)\r\n if mid + 1 <= min([r, g, b]):\r\n f1 = mid + 1 + (r - mid - 1) // 3 + (g - mid - 1) // 3 + (b - mid - 1) // 3\r\n ans = max(ans, f1)\r\n if f <= f1:\r\n low = mid\r\n else:\r\n high = mid\r\nprint(ans)", "r, g, b= list(map(int,input().split()))\r\nif {r%3, g%3, b%3}=={0,1,2} or 0 in {r,g,b}:\r\n print(r//3+g//3+b//3)\r\nelse:\r\n print((r+g+b)//3)\r\n", "flowers = [int(s) for s in input().split()]\n\nans = min(flowers)\nflowers = [f - ans for f in flowers]\n\nif sum(x%3 for x in flowers) == 4 and ans:\n ans += 1\n\nprint(sum(x//3 for x in flowers) + ans)\n", "s=input().split()\nfor i in range(3):\n s[i]=int(s[i])\ns.sort()\n\n\nans=s[0]//3 +s[1]//3 +s[2]//3\n\nx=s[0]%3\ny=s[1]%3\nz=s[2]%3\nif(x==0 and y==z==2 and s[0]!=0):\n ans+=1\nif(y==0 and x==z==2 and s[1]!=0):\n ans+=1\nif(z==0 and y==x==2 and s[2]!=0):\n ans+=1\n\nans+=min(x,y,z)\nprint(ans)\n\n", "\r\nr,g,b=sorted(list(map(int,input().split())))\r\n\r\nmx = 0\r\nfor i in range(3):\r\n if r<i:\r\n break\r\n res = r - i + (b-r+i)//3 + (g-r+i)//3\r\n mx = max(mx , res)\r\n\r\nprint(mx)", "[r, g, b]=list(map(int, input().split()))\r\ntotal0 = (r//3)+(g//3)+(b//3)\r\ntotal1, total2 = 0, 0\r\nif(min(r, g, b)>=1):\r\n total1 = 1+((r-1)//3) + ((g-1)//3) + ((b-1)//3)\r\nif(min(r, g, b)>=2):\r\n total2 = 2 + ((r-2)//3) + ((g-2)//3) + ((b-2)//3)\r\nprint(max(total0, total1, total2))", "a=list(map(int,input().split()))\r\nans=0 \r\nfor i in range(3):\r\n for j in range(3):\r\n for k in range(3):\r\n temp=0\r\n if a[0]>=i and a[1]>=j and a[2]>=k:\r\n temp+=min(i,j,k) \r\n temp+=(a[0]-i)//3 \r\n temp+=(a[1]-j)//3\r\n temp+=(a[2]-k)//3 \r\n ans=max(ans,temp)\r\nprint(ans)", "import sys\n\n\ndef readline():\n return sys.stdin.readline().strip()\n\n\ndef read(t=int):\n s = sys.stdin.readline()\n return list(map(t, s.strip().split(' ')))\n\n\ndef readint():\n return read()[0]\n\n\ndef go():\n r, g, b = read()\n res = 0\n for s in range(4):\n m = min(r,g,b,s)\n [rr,gg,bb] =[r-m,g-m,b-m]\n res = max(m+rr//3+gg//3+bb//3,res)\n print(res)\n\n\ntry:\n go()\nexcept:\n ...\n", "r, g, b = map(int, input().split())\n\nmixin = min(r, g, b)\nans = mixin\nr -= mixin\ng -= mixin\nb -= mixin\n\nans += (r // 3) + (g // 3) + (b // 3)\n\nr %= 3\ng %= 3\nb %= 3\n\nif r + b + g == 4 and mixin != 0:\n ans += 1\n\nprint(ans)\n", "def solve():\r\n\tr, g, b = map(int, input().split())\r\n\tr, g, b = sorted([r, g, b])\r\n\ti = 0\r\n\tl = []\r\n\twhile r > 0 and i < 3:\r\n\t\tr -= 1\r\n\t\tg -= 1\r\n\t\tb -= 1\r\n\t\ti += 1\r\n\t\tl.append(i + r // 3 + g // 3 + b // 3)\r\n\tl.append(i + r // 3 + g // 3 + b // 3)\r\n\tprint(max(l))\r\n\r\nsolve()\r\n", "r, g, b = map(int,input().split())\r\nif({r % 3, g % 3, b % 3} == {0, 1, 2} or 0 in {r, g, b}):\r\n\tprint((r // 3 + g // 3 + b // 3))\r\nelse:\r\n\tprint((r + b + g) // 3)", "red_flowers, green_flowers, blue_flowers = [int(i) for i in input().split()]\r\nresult = int(red_flowers / 3) + int(blue_flowers / 3) + int(green_flowers / 3)\r\n \r\nif red_flowers % 3 == 2 and blue_flowers % 3 == 2 and green_flowers % 3 == 2:\r\n result += 2\r\nelif (red_flowers % 3 == 2 and blue_flowers % 3 == 2 and green_flowers % 3 == 0) and green_flowers != 0:\r\n result += 1\r\nelif (red_flowers % 3 == 2 and blue_flowers % 3 == 0 and green_flowers % 3 == 2) and blue_flowers != 0:\r\n result += 1\r\nelif (red_flowers % 3 == 0 and blue_flowers % 3 == 2 and green_flowers % 3 == 2) and red_flowers != 0:\r\n result += 1\r\nelif red_flowers % 3 == 0 or blue_flowers % 3 == 0 or green_flowers % 3 == 0:\r\n pass\r\nelse:\r\n result += 1\r\nprint(result)", "l=list(map(int,input().split()))\r\na=l[0]//3+l[1]//3+l[2]//3\r\nj=min(l[0]//3,l[1]//3,l[2]//3)\r\nb=min(l[0]%3,l[1]%3,l[2]%3)\r\nif (l[0]%3+l[1]%3+l[2]%3)==4 and b==0 and j!=0:\r\n print(a+b+1)\r\nelif((l[0]%3+l[1]%3+l[2]%3)==4 and b==0 and j==0):\r\n print(a)\r\nelse:\r\n print(a+b)", "r,g,b=map(int,input().split(\" \"))\r\na=r//3+g//3+b//3\r\nif r>=1 and g>=1 and b>=1:\r\n a=max(a,1+(r-1)//3 + (g-1)//3 + (b-1)//3)\r\nif r>=2 and g>=2 and b>=2:\r\n a=max(a,2+(r-2)//3 + (g-2)//3 + (b-2)//3)\r\nprint(a)\r\n", "r, g, b = (int(x) for x in input().split())\nprint(\nmax((r - i) // 3 + (g - i) // 3 + (b - i) // 3 + i for i in range(min(2, r, g, b) + 1)))\n", "import sys\r\n\r\ninput = lambda: sys.stdin.readline().strip(\"\\r\\n\")\r\n\r\nr, g, b = map(int, input().split())\r\nans = 0\r\nfor i in range(min(3, r, g, b)+1):\r\n ans = max(ans, i + (r-i)//3 + (g-i)//3 + (b-i)//3)\r\nprint(ans)\r\n", "n,m,k=map(int,input().split())\r\nx=min(n,m,k)\r\nL=[(n-x)%3,(m-x)%3,(k-x)%3]\r\nL.sort()\r\nif L==[0,2,2]:\r\n if x>0:\r\n print(x+(n-x)//3+(m-x)//3+(k-x)//3+1)\r\n else:\r\n print(x+(n-x)//3+(m-x)//3+(k-x)//3)\r\nelse:\r\n print(x+(n-x)//3+(m-x)//3+(k-x)//3)\r\n", "t = list(map(int, input().split()))\r\nx = min(t)\r\ns = 0\r\nfor i in range(3):\r\n s += (t[i] - x) // 3\r\n if (t[i] - x) % 3 == 2 and x > 0:\r\n s += 1\r\n t[i] = x - 1\r\n else: t[i] = x + (t[i] - x) % 3\r\n \r\nprint(s + min(t))\r\n", "a,b,c=sorted(list(map(int,input().split())))\r\nm = 0\r\nfor i in range(3):\r\n if a<i:\r\n break\r\n res = a - i + (c-a+i)//3 + (b-a+i)//3\r\n m = max(m,res)\r\nprint(m)", "def f(t, r, g, b):\r\n if t < 0:\r\n return 0\r\n return t + (r - t) // 3 + (g - t) // 3 + (b - t) // 3\r\n\r\nr, g, b = [int(x) for x in input().split()]\r\nt = min(r, min(g, b))\r\nprint(max(f(t, r, g, b), max(f(t - 1, r, g, b), f(t - 2, r, g, b))))", "r, g, b = map(int, input().split())\r\nans = 0\r\nfor i in range(3):\r\n if r >= i and g >= i and b >= i:\r\n ans = max(ans, i + (r - i) // 3 + (g - i) // 3 + (b - i) // 3)\r\nprint(ans)", "r, g, b = list(map(int, input().split()))\r\nif {r % 3, g % 3, b % 3} == {0, 1, 2} or 0 in {r, g, b}:\r\n print(r // 3 + g // 3 + b // 3)\r\nelse:\r\n print((r + g + b) // 3)\r\n", "r, g, b = map(int, input().split())\r\nR, G, B = r % 3, g % 3, b % 3\r\nCantidad= r // 3 + g // 3 + b // 3 + min(R, min(G, B))\r\nif (R == 2 and G == 2 and B == 0 and b != 0) or (G == 2 and B == 2 and R == 0 and r != 0) or (B == 2 and R == 2 and G == 0 and g != 0):\r\n Cantidad += 1\r\n\r\nprint(Cantidad)", "r,g,b = map(int, input().split())\r\n\r\nans = r//3 + g//3 + b//3\r\ny = (r-1)//3 + (g-1)//3 + (b-1)//3\r\nif r > 0 and g > 0 and b > 0:\r\n ans = max(ans, (r-1)//3 + (g-1)//3 + (b-1)//3 + 1)\r\nif r > 1 and g > 1 and b > 1:\r\n ans = max(ans, (r-2)//3 + (g-2)//3 + (b-2)//3 + 2)\r\n\r\nprint(ans)", "r,g,b=map(int,input().split())\nz=min(r,g,b,3)\n\nans=0\nfor i in range(z+1):\n\tans=max(ans,i+(r-i)//3+(g-i)//3+(b-i)//3)\n\nprint(ans)\n", "a,b,c=[int(x) for x in input().split()]\r\nr=0\r\nfor i in range(min(3,a+1,b+1,c+1)):\r\n r=max(r,i+(a-i)//3+(b-i)//3+(c-i)//3)\r\nprint(r)", "r,g,b=map(int,input().split())\r\nans=0\r\nfor i in range(3):\r\n if not (r-i>=0 and g-i>=0 and b-i>=0):\r\n continue\r\n x,y,z=r-i,g-i,b-i\r\n cnt=i+x//3+y//3+z//3\r\n x-=(x//3)*3\r\n y-=(y//3)*3\r\n z-=(z//3)*3\r\n cnt+=min(x,y,z)\r\n ans=max(ans,cnt)\r\nprint(ans)", "import sys\r\n\r\ntmp = list(map(int, input().split()))\r\na = tmp[0]\r\nb = tmp[1]\r\nc = tmp[2]\r\n\r\nres = 0\r\nfor x in range(0,3):\r\n if (a >= x and b >= x and c >= x):\r\n res = max(res, x + (a-x)//3 + (b-x)//3 + (c-x)//3)\r\n\r\nprint(res)\r\n", "r, g, b = list(map(int, input().split()))\nprint(max(tri + (r-tri)//3 + (g-tri) // 3 + (b-tri) // 3 for tri in range(0, min(2, r, g, b) + 1)))\n", "a=list(map(int,input().split()))\r\nans=-1\r\nfor i in range(min(min(a),2)+1):\r\n x=(a[0]-i)//3+(a[1]-i)//3+(a[2]-i)//3+i\r\n if ans<x:\r\n ans=x\r\nprint(ans)", "import math\r\n#q=int(input())\r\nq=1\r\nfor _ in range(q):\r\n l=list(map(int,input().split()))\r\n l.sort()\r\n a=l[0]\r\n b=l[1]\r\n c=l[2]\r\n ans2=0\r\n ans3=0\r\n ans1=a//3+b//3+c//3 \r\n if a>0 and b>0 and c>0:\r\n ans2=1 \r\n a1=max(0,a-1) \r\n b1=max(0,b-1)\r\n c1=max(0,c-1) \r\n ans2+=a1//3+b1//3+c1//3\r\n ans3=2 \r\n a2= max(0,a-2) \r\n b2=max(0,b-2) \r\n c2=max(c-2,0) \r\n ans3+=a2//3+b2//3+c2//3\r\n print(max(max(ans1,ans2),ans3))", "I=lambda:list(map(int,input().split()))\r\na,b,c=sorted(I())\r\nv=[a%3,b%3,c%3]\r\nans=a//3+b//3+c//3+min(v)\r\nif min(a,b,c)>0:\r\n if v.count(2)==2:\r\n ans+=1\r\nprint(ans)\r\n\r\n\r\n", "x = list(map(int, input().split(\" \")))\r\nbq = 0\r\nx.sort()\r\nif x[0] >= 3:\r\n if x[0] % 3 == 0 and x[2] != 0 and x[1] != 0:\r\n bq += x[0] // 3 - 1\r\n x[0] = 3\r\n else:\r\n bq += x[0] // 3\r\n x[0] = x[0] % 3\r\nif x[1] >= 3:\r\n if x[1] % 3 == 0 and x[0] != 0 and x[2] != 0:\r\n bq += x[1] // 3 - 1\r\n x[1] = 3\r\n else:\r\n bq += x[1] // 3\r\n x[1] = x[1] % 3\r\n\r\nif x[2] >= 3:\r\n if x[2] % 3 == 0 and x[0] != 0 and x[1] != 0:\r\n bq += x[2] // 3 - 1\r\n x[2] = 3\r\n else:\r\n bq += x[2] // 3\r\n x[2] = x[2] % 3\r\nx.sort()\r\nt1,t2=0,0\r\nif x[0] <= 3:\r\n t1 = x[0]\r\nif x[1]==3 and x[2]==3:\r\n t2 = 2\r\nprint(bq+max(t1,t2))", "def solve(a: int, b: int, c: int):\r\n maps = sorted(map(lambda x: (x % 3, x // 3), [a, b, c]))\r\n # print(maps)\r\n sum_of_quotients = sum(m[1] for m in maps)\r\n if maps[0][0] == 0 and maps[0][1] > 0 and maps[1][0] >= 2 and maps[2][0] >= 2:\r\n return sum_of_quotients + 1\r\n elif all(m[0] > 0 for m in maps):\r\n return sum_of_quotients + min(m[0] for m in maps)\r\n return sum_of_quotients\r\n\r\n\r\nassert solve(3, 6, 9) == 6\r\nassert solve(4, 4, 4) == 4\r\nassert solve(0, 0, 0) == 0\r\na, b, c = map(int, input().split())\r\nprint(solve(a, b, c))\r\n", "def solve(A, ans):\n for x in [x-ans for x in A]:\n ans += x // 3\n return ans\n\nA = [int(x) for x in input().split()]\nm = min(A)\nans = solve(A, m)\nif m:\n ans = max(ans, solve(A, m-1))\n if m > 1:\n ans = max(ans, solve(A, m-2))\nprint(ans)\n", "rbg = list(map(int,input().split()))\r\nrbg.sort()\r\nremain = 0\r\nans = 0\r\nans2 = 0\r\na = rbg[-1]%3\r\nif rbg[-3] >= a:\r\n remain = a\r\nelse:\r\n remain = rbg[-3]\r\nans+=remain\r\nfor i in range(-1,-4,-1):\r\n ans+=(rbg[i]-remain)//3\r\nans2 = rbg[0]\r\nfor i in range(1,3):\r\n ans2 += (rbg[i] - rbg[0])//3\r\nif ans>=ans2:\r\n print(ans)\r\nelse:\r\n print(ans2)", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\nr,g,b = mp()\r\nl = [r%3,b%3,g%3]\r\n\r\nif len(set(l)) == 3 or min(r,g,b) == 0:\r\n\tprint(r//3+g//3+b//3)\r\nelse:\r\n\tprint((r+b+g)//3)\r\n\r\n", "r,g,b=map(int,input().split())\r\nc=r//3+g//3+b//3\r\nif min([r,g,b])>1:\r\n op=1+(r-1)//3+(g-1)//3+(b-1)//3\r\nelse:\r\n op=-1\r\nif min([r,g,b])>2:\r\n ml=2+(r-2)//3+(g-2)//3+(b-2)//3\r\nelse:\r\n ml=-2\r\nprint(max(c,op,ml))#r//3+g//3+b//3,1+(r-1)//3+(g-1)//3+(b-1)//3,2+(r-2)//3+(g-2)//3+(b-2)//3))", "# DO NOT EDIT THIS\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\narr = [int(k) for k in input().split()]\r\n# can always have 0, 1, or 2 mixing bouquets\r\n# once you have three, its the same as 3r, 3b, 3g\r\n\r\nzero = sum(k // 3 for k in arr)\r\none = sum((k - 1) // 3 for k in arr) + 1 if all(k >= 1 for k in arr) else 0\r\ntwo = sum((k - 2) // 3 for k in arr) + 2 if all(k >= 2 for k in arr) else 0\r\n\r\nprint(max(zero, one, two))\r\n\r\n\r\n\r\n", "r,g,b = list(map(int, input().split()))\n\nanswerOne = 0\nanswerTwo= 0\nanswerThree = 0\n\nanswerThree += r//3\nanswerThree += g//3\nanswerThree += b//3\n\nif r > 0 and g > 0 and b > 0:\n answerOne += 1\n answerOne += (r-1)//3\n answerOne += (g-1)//3\n answerOne += (b-1)//3\n\nif r > 1 and g > 1 and b > 1:\n answerTwo += 2\n answerTwo += (r-2)//3\n answerTwo += (g-2)//3\n answerTwo += (b-2)//3\n\nprint(max(answerOne, max(answerTwo, answerThree)))\n", "r,g,b=[*map(int,input().split())]\r\nif ({r%3,g%3,b%3}=={0,1,2}) or (0 in {r,g,b}):\r\n print(r//3+g//3+b//3)\r\nelse:\r\n print((r+g+b)//3)", "r,g,b=input().split( )\r\nr=int(r)\r\ng=int(g)\r\nb=int(b)\r\nif (r!=0 and g!=0 and b!=0):\r\n res=max((r//3)+(g//3)+(b//3),((r-1)//3)+((g-1)//3)+((b-1)//3)+1,((r-2)//3)+((g-2)//3)+((b-2)//3)+2)\r\nelse:\r\n res=(r//3)+(g//3)+(b//3)\r\nprint (res)", "r,g,b=map(int,input().split())\r\na,d,c=0,0,0\r\na=r//3+b//3+g//3\r\nif(r and g and b):r,g,b=r-1,g-1,b-1;a=max(a,r//3+b//3+g//3+1)\r\nif(r and g and b):r,g,b=r-1,g-1,b-1;a=max(a,r//3+b//3+g//3+2)\r\nprint(a)", "a,b,c=map(int,input().split())\r\np=min(a,b,c)\r\nans=a//3+b//3+c//3\r\nfor i in range(1,min(p,3)):\r\n \r\n\r\n ans=max(ans,(i+(a-i)//3+(b-i)//3+(c-i)//3))\r\nprint(ans)", "r, g, b = map(int, input().split(' '))\r\ns = 0\r\nfor i in range(0, 10):\r\n for j in range(0, 10):\r\n for k in range(0, 10):\r\n if (r >= i and g >= j and b >= k):\r\n s = max(s, (r - i) // 3 + (g - j) // 3 + (b - k) // 3 + min(i, min(j, k)))\r\nprint(s)", "r,g,b=map(int,input().split())\r\nans=0\r\nfor i in range(3):\r\n t=0\r\n rt=r\r\n gt=g\r\n bt=b\r\n if rt>=i and gt>=i and bt>=i:\r\n rt-=i\r\n gt-=i\r\n bt-=i\r\n t+=i\r\n t+=rt//3+gt//3+bt//3\r\n ans=max(ans,t)\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "a = sorted(map(int, input().split()))\r\nans1 = a[0] + sum((i - a[0]) // 3 for i in a[1:])\r\n\r\nans2 = sum(i // 3 for i in a[1:])\r\ntmp = min(min(i % 3 for i in a[1:]), a[0])\r\nans2 += tmp + max(a[0] - tmp, 0) // 3\r\nprint(max(ans1, ans2))", "r,g,b = map(int,input().split())\r\nl=[]\r\nfor i in range(min(r+1,g+1,b+1,3)):\r\n l.append(i+(r-i)//3+(g-i)//3+(b-i)//3)\r\nprint(max(l))", "from sys import stdin\r\nfrom collections import defaultdict\r\nimport heapq\r\nimport math\r\nfrom functools import reduce\r\n\r\n\r\nlst = list(map(int, stdin.buffer.readline().split()))\r\nlst = sorted(lst)\r\n\r\nans = lst[0]\r\n\r\nans += (lst[1] - lst[0]) // 3\r\nans += (lst[2] - lst[0]) // 3\r\n\r\nif lst[0] != 0 and (lst[1] - lst[0]) % 3 == 2 and (lst[2] - lst[0]) % 3 == 2:\r\n ans += 1\r\n\r\nprint (ans)", "r,g,b = map (int, input().split())\n\ndef work (mix):\n if mix > min (r,g,b):\n return 0\n else:\n return ((r-mix) // 3 + \n (g-mix) // 3 + \n (b-mix) // 3 + \n mix)\n\nprint (max (work(0), work(1), work(2)))\n", "r,g,b = map(int,input().split()) \r\nx=min(r,g,b)\r\nans1 = x+(r-x)//3 + (g-x)//3 +(b-x)//3 \r\nans2 = r//3 +g//3 +b//3 + min(r%3 , g%3 , b%3)\r\nx=1 \r\nif min(r,g,b)>=1:\r\n ans_1mix = x+(r-x)//3 + (g-x)//3 +(b-x)//3 \r\nelse:\r\n ans_1mix=-1\r\nx=2\r\nif min(r,g,b)>=2:\r\n \r\n ans_2mix = x+(r-x)//3 + (g-x)//3 +(b-x)//3 \r\nelse:\r\n ans_2mix=-1\r\nprint(max(ans2,ans1,ans_1mix,ans_2mix))", "import sys\r\nimport math\r\nr,g,b=(int(i) for i in input().split())\r\nk=min(r,g,b)\r\nk1=(r//3)+(g//3)+(b//3)\r\nif(k>=1):\r\n k2=((r-1)//3)+((g-1)//3)+((b-1)//3)\r\nelse:\r\n k2=-1\r\nif(k>=2):\r\n k3=((r-2)//3)+((g-2)//3)+((b-2)//3)\r\nelse:\r\n k3=-2\r\nprint(max(k1,k2+1,k3+2))", "a, b, c = map(int, input().split())\r\nans = 0\r\nx = min(a, b, c)\r\na -= x\r\nb -= x\r\nc -= x\r\nans = max(ans, x + a // 3 + b // 3 + c // 3)\r\nif x >= 1: ans = max(ans, x - 1 + (a + 1) // 3 + (b + 1) // 3 + (c + 1) // 3)\r\nif x >= 2: ans = max(ans, x - 2 + (a + 2) // 3 + (b + 2) // 3 + (c + 2) // 3)\r\nprint(ans)", "def cielAndFlowers(a,b,c):\n\ttotal = a//3 + b//3 + c//3 \n\tremain = [a%3,b%3,c%3]\n\tif sorted(remain) == [0,2,2] and 0 not in [a,b,c]:\n\t\treturn total+1\n\treturn total + min(remain)\n\nr,b,g = input().split()\nprint(cielAndFlowers(int(r),int(g),int(b)))", "def przypadek1(c,n,z):\r\n wynik = c // 3\r\n wynik += n // 3\r\n wynik += z // 3\r\n return wynik\r\ndef przypadek2(c,n,z):\r\n wynik = 0\r\n if c >= 1 and n >= 1 and z >= 1:\r\n wynik += 1\r\n c -= 1\r\n n -= 1\r\n z -= 1\r\n wynik += c // 3\r\n wynik += n // 3\r\n wynik += z // 3\r\n return wynik\r\ndef przypadek3(c, n, z):\r\n wynik = 0\r\n if c >= 2 and n >= 2 and z >= 2:\r\n wynik += 2\r\n c -= 2\r\n n -= 2\r\n z -= 2\r\n wynik += c // 3\r\n wynik += n // 3\r\n wynik += z // 3\r\n return wynik\r\n\r\nkwiaty = input().split()\r\ncz = int(kwiaty[0])\r\nnb = int(kwiaty[1])\r\nzz = int(kwiaty[2])\r\n\r\nprint(max(przypadek1(cz, nb, zz), przypadek2(cz, nb, zz), przypadek3(cz, nb, zz)))", "r,g,b=input().split()\r\nr=int(r) \r\ng=int(g)\r\nb=int(b) \r\n \r\nsum=0 \r\n\r\nif r%3==0 and g%3==0 and b%3==0:\r\n sum+=((r/3)+(g/3)+(b/3))\r\n c=0\r\n \r\nelse:\r\n sum1=0\r\n sum2=0\r\n sum3=0\r\n sum1+=1\r\n sum1+=(((r-1)//3)+((g-1)//3)+((b-1)//3))\r\n if r-1<0 or g-1<0 or b-1<0:\r\n sum1=0\r\n sum2+=2\r\n sum2+=(((r-2)//3)+((g-2)//3)+((b-2)//3))\r\n if r-2<0 or g-2<0 or b-2<0:\r\n sum2=0\r\n sum3+=((r//3)+(g//3)+(b//3))\r\n if sum1>=sum2 and sum1>sum3:\r\n sum=sum1\r\n c=1\r\n \r\n elif sum2>=sum1 and sum2>sum3:\r\n sum=sum2\r\n c=2\r\n else:\r\n sum=sum3\r\n c=3\r\nprint(int(sum))", "a=sorted(list(map(int,input().split())))\r\nb=[];c=[]\r\nfor i in range(3):\r\n b.append(a[i]%3)\r\nfor i in range(3):\r\n mi=min(a[0],b[i])\r\n c.append(mi+(a[0]-mi)//3+(a[1]-mi)//3+(a[2]-mi)//3)\r\nprint(max(c))\r\n", "l=list(map(int,input().split()))\r\nr,g,b=l[0],l[1],l[2]\r\nres=(r//3)+(g//3)+(b//3)\r\nfor i in range(0,min(3,min(r,min(g,b)))):\r\n res1=((r-i)//3 + (g-i)//3 +(b-i)//3) +i\r\n res=max(res,res1)\r\nprint(res)", "r, g, b = sorted(map(int, input().split(' ')))\n\nif ((g - r) % 3 == 2) and ((b - r) % 3 == 2):\n if r == 0:\n print((g // 3) + (b // 3))\n else:\n print(r - 1 + ((g - r + 1) // 3) + ((b - r + 1) // 3))\nelse:\n print(r + ((g - r) // 3) + ((b - r) // 3))\n", "def main1(r, g, b):\n\n rm = r % 3\n gm = g % 3\n bm = b % 3\n\n ans = int(r / 3) + int(g / 3) + int(b / 3) + min(rm, gm, bm)\n return ans\n\n\ndef main2(r, g, b):\n\n m = min(r, g, b)\n r -= m\n g -= m\n b -= m\n\n ans = int(r / 3) + int(g / 3) + int(b / 3) + m\n return ans\n\n\ndef main3(r0, g0, b0):\n r = r0\n g = g0\n b = b0\n\n m = min(r, g, b)\n r -= m\n g -= m\n b -= m\n\n ans = int(r / 3) + int(g / 3) + int(b / 3) + m\n rm = r % 3\n gm = g % 3\n bm = b % 3\n if (rm + gm + bm == 4) and (r0 and g0 and b0):\n ans += 1\n return ans\n\n\ndef main():\n inp = [int(j) for j in input().split(\" \")]\n r = inp[0]\n g = inp[1]\n b = inp[2]\n print(main3(r, g, b))\n # print(max(main1(r, g, b), main2(r, g, b)))\n\n\nmain()\n\n", "x,y,z=map(int,input().split())\r\nans=max(max(x//3+y//3+z//3,1+(x-1)//3+(y-1)//3+(z-1)//3),2+(x-2)//3+(y-2)//3+(z-2)//3)\r\nif x==0 or y==0 or z==0 :\r\n ans=x//3+y//3+z//3\r\nprint(ans)\r\n", "r,g,b=map(int,input().split())\r\nk=min(r,g,b)\r\nt1=(r//3)+(g//3)+(b//3)+min(r%3,g%3,b%3)\r\nt2=(r//3)+(g//3)\r\np=min(r%3,g%3,b)\r\nt2=t2+p+(b-p)//3\r\nt3=(r//3)+(b//3)\r\np=min(r%3,b%3,g)\r\nt3=t3+p+(g-p)//3\r\nt4=(b//3)+(g//3)\r\np=min(b%3,g%3,r)\r\nt4=t4+p+(r-p)//3\r\nt5=(r//3)\r\np=min(r%3,g,b)\r\nt5=t5+p+(g-p)//3+(b-p)//3\r\nt6=(g//3)\r\np=min(g%3,r,b)\r\nt6=t6+p+(r-p)//3+(b-p)//3\r\nt7=(b//3)\r\np=min(b%3,r,g)\r\nt7=t7+p+(g-p)//3+(r-p)//3\r\nt8=min(r,g,b)+(r-k)//3+(b-k)//3+(g-k)//3\r\nprint(max(t1,t2,t3,t4,t5,t6,t7,t8))\r\n \r\n", "a = list(map(int, input().split()))\r\nmax_b = 0\r\nfor i in range(3):\r\n if min(a) >= i:\r\n max_b = max(max_b, i + (a[0] - i) // 3 + (a[1] - i) // 3 + (a[2] - i) // 3)\r\n else:\r\n max_b = max(max_b, a[0] // 3 + a[1] // 3 + a[2] // 3)\r\nprint(max_b)\r\n", "t = list(map(int, input().split()))\r\nx = min(t)\r\nif x > 0:\r\n p = [x - 1 + (i - x + 1) % 3 for i in t]\r\n print(sum((t[i] - p[i]) // 3 for i in range(3)) + min(p))\r\nelse:\r\n print(sum(i // 3 for i in t))", "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,C = map(int,input().split())\nans = 0\nfor i in range(3):\n a,b,c = A-i,B-i,C-i\n if a>=0 and b>=0 and c>=0:\n num = a//3+b//3+c//3+min(a%3,b%3,c%3)+i\n ans = max(ans,num)\nprint(ans)", "a,b,c=map(int,input().split())\r\nl=[a,b,c]\r\nl.sort()\r\nif l[0]==0:\r\n print(a//3+b//3+c//3)\r\n exit(0)\r\nif l[0]==1: \r\n print(max((a//3+b//3+c//3),(1+(a-1)//3+(b-1)//3+(c-1)//3)))\r\n exit(0)\r\ns=max((a//3+b//3+c//3),(1+(a-1)//3+(b-1)//3+(c-1)//3),(2+(a-2)//3+(b-2)//3+(c-2)//3))\r\nprint(s)", "x,y,z=map(int,input().split())\r\ns=x//3+y//3+z//3\r\nif(x>=1 and y>=1 and z>=1):\r\n r=(x-1)//3+(y-1)//3+(z-1)//3+1\r\n s=max(s,r)\r\nif(x>=2 and y>=2 and z>=2):\r\n r=(x-2)//3+(y-2)//3+(z-2)//3+2\r\n s=max(s,r)\r\nprint(s)\r\n" ]

[ "from sys import stdin\r\n\r\nn = int(input())\r\nseg = []\r\ninp = stdin.readlines()\r\n\r\nfor i in range(n):\r\n l, r = map(int, inp[i].split())\r\n seg.append([l, r, i + 1])\r\n \r\n#seg.sort(key = lambda x: x[1], reverse = True)\r\nseg.sort(key = lambda x: x[0])\r\n\r\nif n == 1: print(-1, -1)\r\nelse:\r\n ans = [-1, -1]\r\n for i in range(1, n):\r\n l1, r1 = seg[i - 1][:2]\r\n l2, r2 = seg[i][:2]\r\n if l2 >= l1 and r2 <= r1:\r\n ans = [seg[i][2], seg[i - 1][2]]\r\n break\r\n elif l2 == l1 and r2 > r1:\r\n ans = [seg[i - 1][2], seg[i][2]]\r\n break\r\n \r\n print(ans[0], ans[1])", "def solve(a):\r\n aa = sorted(a)\r\n maxr = aa[0]\r\n for ai in aa:\r\n if ai[2] != maxr[2]:\r\n if ai[1] <= maxr[1] and ai[0] >= maxr[0]:\r\n return(ai[2], maxr[2])\r\n if ai[1] >= maxr[1] and ai[0] <= maxr[0]:\r\n return(maxr[2], ai[2])\r\n if ai[1] > maxr[1]:\r\n maxr = ai\r\n return(-1, -1)\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n l,r = [int(s) for s in input().split()]\r\n a.append((l, r, i+1))\r\ni,j = solve(a)\r\nprint(i,j)\r\n", "def r(d,N):\r\n for i in range(1,N):\r\n if d[i][1] <= d[i-1][1]:\r\n return str(d[i][2]+1) + ' ' + str(d[i-1][2]+1)\r\n return '-1 -1' \r\n\r\nN = int(input())\r\nd = []\r\nfor i in range(N):\r\n a,b = map(int,input().split())\r\n d.append((a,b,i))\r\nd = sorted(d, key = lambda x:(x[0],-x[1]))\r\nprint(r(d,N))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\ng = [list(map(int, input().split())) for _ in range(n)]\r\nd = sorted([(j[0], j[1], i) for i, j in enumerate(g)], key=lambda x:(x[0], -x[1]))\r\nfor i in range(1, n):\r\n if d[i][1] <= d[i-1][1]:\r\n print(d[i][2]+1, d[i-1][2]+1)\r\n exit()\r\nprint(-1, -1)", "def solution():\n \n n = int(input())\n segments = []\n for i,_ in enumerate(range(n)):\n x,y = input().split(\" \")\n segments.append((int(x), int(y), i+1))\n\n segments = sorted(segments, key=lambda x: (x[0], -x[1]))\n\n for i,seg in enumerate(segments):\n j = i+1\n if j >= n:\n print(\"-1 -1\")\n return\n\n while segments[j][1] <= seg[1]:\n print(\"{} {}\".format(segments[j][2], seg[2]))\n return\n\n print(\"-1 -1\")\n return\n\nsolution()\n", "from collections import defaultdict\r\nimport sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nd = defaultdict(lambda : [])\r\nfor i in range(n):\r\n l, r = map(int, input().split())\r\n d[r].append((l, i + 1))\r\nml, j = 0, -1\r\nans = [-1, -1]\r\nfor r in sorted(d.keys()):\r\n if len(d[r]) > 1:\r\n l1, i1 = d[r][0]\r\n l2, i2 = d[r][1]\r\n if l1 <= l2:\r\n ans = [i2, i1]\r\n else:\r\n ans = [i1, i2]\r\n break\r\n for l, i in d[r]:\r\n if ml < l:\r\n ml = l\r\n j = i\r\n else:\r\n ans = [j, i]\r\n break\r\n if not ans[0] == -1:\r\n break\r\nprint(*ans)", "n=int(input())\r\na=[]\r\nfor i in range(n):\r\n a.append(list(map(int,input().split()))+[i])\r\na.sort(key=lambda f:(f[0],-f[1]))\r\nfor i in range(n-1):\r\n if a[i][1]>=a[i+1][1]:\r\n print(a[i+1][2]+1,a[i][2]+1)\r\n break\r\nelse:\r\n print(-1,-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", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n l,r = map(int, input().split())\r\n a.append((l,r, i))\r\na = sorted(a, key=lambda x: (x[0], -x[1]))\r\nmr = -1\r\nmi = -1\r\nfor i in range(n):\r\n if a[i][1] <= mr:\r\n print(a[i][2]+1, a[mi][2]+1)\r\n exit()\r\n else:\r\n mr = a[i][1]\r\n mi = i\r\nprint(-1, -1)", "n = int(input())\r\ndic = {}\r\nfor j in range(n):\r\n l, r = map(int, input().split())\r\n dic[j + 1] = (l, r)\r\nlst = sorted(dic.keys(), key=lambda i: (dic.get(i)[0], 1_000_000_001 - dic.get(i)[1]))\r\nmaxR = -1\r\nnum = -1\r\nflag = False\r\nfor i in range(len(lst)):\r\n r = dic[lst[i]][1]\r\n if r <= maxR:\r\n flag = True\r\n print(lst[i], num)\r\n break\r\n maxR = max(maxR, r)\r\n num = lst[i]\r\nif not flag:\r\n print(-1, -1)", "n = int(input())\r\na = [list(map(int,input().split())) for i in range(n)]\r\nfor t in range(n):\r\n a[t].append(t+1)\r\na.sort()\r\nfor i in range(n-1):\r\n if a[i][1] >= a[i+1][1]:\r\n print(a[i+1][2],a[i][2])\r\n exit()\r\n if a[i][0] == a[i+1][0] and a[i][1] <= a[i+1][1]:\r\n print(a[i][2],a[i+1][2])\r\n exit()\r\nprint(-1,-1)", "n = int(input())\r\nL = []\r\nfor i in range(n):\r\n l,r = map(int,input().split())\r\n L.append((l,-r,i+1))\r\nL = sorted(L)\r\nf = 0\r\nfor i in range(1,n):\r\n if L[i-1][1] <= L[i][1]:\r\n f = 1\r\n print(L[i][2],L[i-1][2])\r\n break\r\nif f == 0:\r\n print(-1,-1)", "def ordena(e):\n return e[0]\n\nai = -1\naj = -1\n\nqs = int(input())\nsegs = []\nfor i in range(qs):\n init, end = input().split()\n init = int(init)\n end = int(end)\n segs.append((init, end, i + 1))\n\nsegs.sort(key=ordena, reverse=True)\n\n#print(segs)\nfor i in range(len(segs) - 1):\n if segs[i][0] == segs[i + 1][0]:\n if segs[i][1] <= segs[i + 1][1]:\n ai = segs[i][2] \n aj = segs[i + 1][2]\n break\n elif segs[i][1] >= segs[i + 1][1]:\n ai = segs[i + 1][2] \n aj = segs[i][2]\n break\n\n else:\n if segs[i][1] <= segs[i + 1][1]:\n ai = segs[i][2] \n aj = segs[i + 1][2]\n break\n\nprint(str(ai) + \" \" + str(aj))\n\t \t\t \t \t\t \t\t\t \t \t\t\t\t \t \t\t \t", "n=int(input())\na=sorted((l,-r,i)for i,(l,r)in\nenumerate((map(int,input().split())for _ in[0]*n),1))\nprint(*next(((y[2],x[2])for x,y in zip(a,a[1:])if x[1]<=y[1]),(-1,-1)))", "import sys\r\n\r\nMOD = 1e9 + 7\r\n\r\ndef gray(binary):\r\n return binary ^ (binary >> 1)\r\n\r\ndef bin_pow(a, b):\r\n a %= MOD\r\n res = 1\r\n while b > 0:\r\n if b & 1:\r\n res = res * a % MOD\r\n a = a * a % MOD\r\n b >>= 1\r\n return res\r\n\r\nif __name__ == '__main__':\r\n input = sys.stdin.read()\r\n n, *lst = input.split('\\n')\r\n n = int(n)\r\n target = []\r\n for i in range(n):\r\n a, b = list(map(int, lst[i].split(' ')))\r\n target.append((a, b, i+1))\r\n target.sort(key = lambda x: (x[0], -x[1], x[2]))\r\n # print(target)\r\n flag = 0\r\n tt = target[0]\r\n for i in range(1, n):\r\n t = target[i]\r\n if t[1] <= tt[1]:\r\n print(f'{t[2]} {tt[2]}')\r\n flag = 1\r\n break\r\n tt = t\r\n if not flag:\r\n print(\"-1 -1\")", "#A\nn = int(input())\nsegs = []\nfor seg in range(n):\n a, b = map(int,input().split())\n segs.append((a, -b, seg+1))\nsegs.sort()\n\nfor i in range(1, n):\n e = segs[i]\n if e[1] >= segs[i-1][1]:\n print(segs[i][2], segs[i - 1][2])\n break\nelse: \n print(-1, -1)\n \n\n\n\t\t\t\t \t \t\t\t\t\t\t\t \t \t\t", "def main():\r\n n = int(input())\r\n segs = []\r\n for i in range(n):\r\n inpt = list(map(int, input().split()))\r\n segs.append((inpt[0], inpt[1], i + 1))\r\n\r\n segs.sort(key=lambda x: x[1], reverse=True)\r\n segs.sort(key=lambda x: x[0])\r\n old = segs[0]\r\n\r\n for i in range(1, n):\r\n current = segs[i]\r\n if current[1] <= old[1]:\r\n print(str(current[2]) + \" \" + str(old[2]))\r\n exit(0)\r\n elif old[1] < current[1]:\r\n old = current\r\n\r\n print(str(-1) + \" \" + str(-1))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nlr = [(i,)+tuple(map(int, input().split())) for i in range(n)]\r\nlr.sort(key=lambda k: (k[1], -k[2]))\r\n\r\nfor i in range(n-1):\r\n if lr[i+1][2]<=lr[i][2]:\r\n print(lr[i+1][0]+1, lr[i][0]+1)\r\n exit()\r\n\r\nprint(-1, -1)", "ai = -1\naj = -1\n\nqtdSeg = int(input())\nsegs = []\nfor i in range(qtdSeg):\n ini, fim = [ int(x) for x in input().split() ]\n segs.append((ini, fim, i + 1))\n\nsegs.sort(key=lambda x : x[0], reverse=True)\n\nfor i in range(len(segs) - 1):\n if segs[i][0] == segs[i + 1][0]:\n if segs[i][1] <= segs[i + 1][1]:\n ai = segs[i][2] \n aj = segs[i + 1][2]\n break\n elif segs[i][1] >= segs[i + 1][1]:\n ai = segs[i + 1][2] \n aj = segs[i][2]\n break\n else:\n if segs[i][1] <= segs[i + 1][1]:\n ai = segs[i][2] \n aj = segs[i + 1][2]\n break\n\nprint(ai, aj)\n\t \t\t\t \t \t \t \t\t \t\t\t\t \t \t \t \t", "#!/usr/bin/env python3\nfrom sys import stdin, stdout\n\ndef rint():\n return map(int, stdin.readline().split())\n\nn = int(input())\n\na = [list(rint()) + [i+1] for i in range(n)]\n\na.sort(key=lambda aa: [aa[0], -aa[1], aa[2]])\n\nstart = [-1, -1, -1]\n\nfor aa in a:\n if start[1] >= aa[1]:\n ans = [aa[2], start[2]]\n print(*ans)\n exit()\n else:\n start = aa\n\nprint(-1, -1)\n\n\n", "import sys\r\n\r\nn = int(sys.stdin.buffer.readline().decode('utf-8'))\r\nseg = sorted(\r\n (list(map(int, line.decode('utf-8').split())) + [i] for i, line in enumerate(sys.stdin.buffer)), key=lambda x: (x[0], -x[1])\r\n)\r\n\r\nright, j = -1, -1\r\n\r\nfor _, r, i in seg:\r\n if r <= right:\r\n print(i+1, j)\r\n exit()\r\n right = r\r\n j = i+1\r\n\r\nprint(-1, -1)\r\n", "n=int(input())\r\nd=[]\r\nfor _ in' '*n:\r\n x,y=map(int,input().split())\r\n d.append([x,-y])\r\nm=a=0\r\ns=sorted(range(n),key=lambda x:d[x])\r\nfor i in s:\r\n y=d[i][1]\r\n if y>=m:print(i+1,a+1);exit(0)\r\n else:m=y;a=i\r\nprint(-1,-1)", "import collections\r\nimport math\r\nimport sys\r\n\r\n\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\n\r\n\r\ndef get_array(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\n\r\ndef input(): return sys.stdin.readline().strip()\r\n\r\n\r\nMOD = 1000000007\r\n\r\nn = int(input())\r\narr = []\r\nfor i in range(n):\r\n l, r = get_ints()\r\n arr.append((l, r, i))\r\narr.sort(key=lambda x: (x[1], -x[0]))\r\nfor i in range(len(arr) - 1):\r\n l1, r1, ind1 = arr[i]\r\n l2, r2, ind2 = arr[i + 1]\r\n if l1 >= l2 and r1 <= r2:\r\n print(ind1 + 1, ind2 + 1)\r\n sys.exit(0)\r\nprint(-1, -1)", "R = lambda :map(int, input().split())\r\nn = int(input())\r\nl = []\r\nfor _ in range(n):\r\n a,b = R()\r\n l.append((a,-b,_+1))\r\nl = sorted(l)\r\nfor i in range(1,n):\r\n if l[i][1]>=l[i-1][1]:\r\n print(l[i][2],l[i-1][2])\r\n break\r\nelse:\r\n print(-1,-1)", "import sys\r\n\r\ndef inn(a,b):\r\n\treturn (a[0] <= b[0] and b[1] <= a[1])\r\n\r\nn = int(input())\r\n\r\nseg = []\r\n\r\na,b = map(int,input().split())\r\nseg.append((a,b,1))\r\n\r\nfor i in range(2,n+1):\r\n\ta,b = map(int,input().split())\r\n\tseg.append((a,b,i))\r\n\t\r\nseg.sort(key=lambda x : (x[0],-x[1]))\r\n\r\nmain = seg.pop(0)\r\n\t\r\nfor i in seg:\r\n\tif inn(main,i):\r\n\t\tprint(i[2],main[2])\r\n\t\tsys.exit(0)\r\n\tif main[1] < i[1]:\r\n\t\tmain = i\r\n\r\nprint(-1,-1)", "from operator import itemgetter\r\ndef cmpnr(a, b):\r\n if a[0] < b[0]:\r\n return True\r\n if a[0] > b[0]:\r\n return False\r\n return a[1] > b[1]\r\n\r\nn = int(input())\r\nseg = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n seg.append((a, b, i + 1))\r\n\r\nseg = sorted(seg, key=lambda t: (t[0], -t[1]))\r\n\r\nmaxr = 0\r\nmaxri = 0\r\nfor a, b, i in seg:\r\n if b <= maxr:\r\n print(i, maxri)\r\n exit()\r\n\r\n if b > maxri:\r\n maxr = b\r\n maxri = i\r\n\r\nprint(-1, -1)\r\n\r\n", "\r\nn=int(input())\r\nl=[]\r\nfor i in range(n):\r\n\tx,y=map(int,input().split())\r\n\tl.append((x,y,i))\r\nl.sort(key=lambda x:(x[0],-x[1]))\r\nr=0\r\nf=0\r\nfor i in range(1,n):\r\n\tif l[i][1]<=l[r][1]:\r\n\t\tf=1\r\n\t\tbreak\r\n\telse:\r\n\t\tr=i\r\nif f:\r\n\tprint(l[i][2]+1,l[r][2]+1)\r\nelse:\r\n\tprint('-1 -1')" ]

[ "n=int(input())\r\nif n==1:\r\n a=map(int,input().split())\r\n print(1)\r\nif n>1:\r\n s=[]\r\n b=0\r\n for i in range(n):\r\n a=list(map(int,input().split()))\r\n s.append(a)\r\n for i in range(1,len(s)-1):\r\n if s[i][0]-s[i-1][0]>s[i][1]:\r\n b+=1\r\n elif s[i+1][0]-s[i][0]>s[i][1]:\r\n b+=1\r\n s[i][0]+=s[i][1]\r\n print(b+2)", "n=int(input())\r\njk=0\r\njl=0\r\nx=[] #pos of trees 0_n-1\r\nh=[] #height of trees 0_n-1\r\nfor i in range(n):#input\r\n jk,jl=[int(x) for x in input().split()]\r\n x.append(jk)\r\n h.append(jl)\r\n\r\nx=[-10000000000000000]+x+[1000000000000000]#pos of trees 1_n\r\nh=[0]+h+[0]#height of trees 1_n\r\ns=0\r\nfor i in range(1,n+1):#1_n\r\n if x[i]-x[i-1]>h[i]:\r\n s+=1\r\n elif x[i+1]-x[i]>h[i]:\r\n s+=1\r\n x[i]+=h[i]\r\n\r\nprint(s)\r\n \r\n", "n=int(input())\r\nl=[]\r\nd=[]\r\nfor i in range(n):\r\n\tt1,t2=map(int,input().split())\r\n\tl.append(t1)\r\n\td.append(t2)\r\nif n>=2:\r\n\tout=2\r\nelif n<2:\r\n\tout=n\r\nfor i in range(1,n-1):\r\n\tif d[i]<l[i]-l[i-1]:\r\n\t\tout+=1\r\n\telif d[i]<l[i+1]-l[i]:\r\n\t\tout+=1\r\n\t\tl[i]+=d[i]\r\nprint(out)", "n=int(input())\r\nli=[[int(j) for j in input().split()] for _ in range(n)]\r\nans=2\r\nfor i in range(1,n-1):\r\n x,h=li[i][0],li[i][1]\r\n if x-li[i-1][0]>h:\r\n ans+=1\r\n elif x+h<li[i+1][0]:\r\n ans+=1\r\n li[i][0]+=h\r\nprint(ans if n>1 else 1)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nx, h = [], []\r\nfor _ in range(n):\r\n x0, h0 = map(int, input().split())\r\n x.append(x0)\r\n h.append(h0)\r\ndp = [1, 0, 1]\r\nfor i in range(1, n):\r\n u = [x[i - 1], x[i - 1], x[i - 1] + h[i - 1]]\r\n v = [x[i] - h[i], x[i], x[i]]\r\n dp0 = [0] * 3\r\n for j in range(3):\r\n for k in range(3):\r\n if u[j] < v[k]:\r\n dp0[k] = max(dp0[k], dp[j] + min(k ^ 1, 1))\r\n dp = dp0\r\nans = max(dp)\r\nprint(ans)", "n = int(input())\r\ncmp = -1000000030\r\ntree = 0\r\nt_x = 0\r\n\r\nwhile n > 0:\r\n x, h = map(int, input().split())\r\n\r\n # First try to cut the tree down at the left, at [x-h,x]\r\n if x - h > cmp:\r\n cmp = x\r\n tree += 1\r\n\r\n # If not possible, try cutting it down at the right, at [x,x+h]\r\n elif x > cmp:\r\n cmp = x + h\r\n tree += 1\r\n\r\n # This tree falls in a cut-segment, discard previous cut and try cutting it down at left, at [x-h,x], but don't count again (due to overlapping previous count)\r\n elif x - h > t_x:\r\n cmp = x\r\n\r\n # Else, you have to cut it down at the right\r\n else:\r\n cmp = x + h\r\n\r\n t_x = x\r\n n -= 1\r\n\r\nprint(tree)\r\n", "n=int(input())\r\nans=0\r\nli=[[int(_) for _ in input().split()] for oo in range(n)]\r\nfor i in range(n):\r\n if i==0 or i==n-1:\r\n ans+=1\r\n elif li[i][0]-li[i-1][0] > li[i][1]:\r\n ans+=1\r\n elif li[i+1][0]-li[i][0] > li[i][1]:\r\n ans+=1\r\n li[i][0]+=li[i][1]\r\nprint(ans)", "from math import inf\r\n\r\nn = int(input())\r\nx = [-inf]\r\nh = [0]\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x += [a]\r\n h += [b]\r\n\r\nx += [inf]\r\ndp = [0]*2\r\n\r\nfor i in range(1, n+1):\r\n dp[0], dp[1] = max(dp[0] + (x[i] - h[i] > x[i-1]), dp[1] + (x[i-1] + h[i-1] < x[i] - h[i])), max(dp[0], dp[1]) + (x[i] + h[i] < x[i+1])\r\n\r\nprint(dp[1])", "#王铭健，工学院 2300011118\r\ndata_list = []\r\nleft = 0\r\nright = 0\r\ncount = 0\r\ngap_len = 0\r\nn = int(input())\r\nif n == 1 or n == 2:\r\n print(n)\r\n exit()\r\nfor i in range(n):\r\n x, h = map(int, input().split())\r\n data_list.append((x, h))\r\nfor j in range(1, n):\r\n if data_list[j][1] < data_list[j][0] - data_list[j-1][0]:\r\n left += 1\r\n else:\r\n break\r\nfor k in range(-2, -n, -1):\r\n if data_list[k][1] < data_list[k+1][0] - data_list[k][0]:\r\n right += 1\r\n else:\r\n break\r\nif left + right + 2 >= n:\r\n print(n)\r\n exit()\r\nif left + right + 2 == n - 1:\r\n print(n - 1)\r\n exit()\r\ngap_list = [0 for i in range(n - left - right - 3)]\r\nfor a in range(left + 1):\r\n del data_list[0]\r\nfor b in range(right + 1):\r\n del data_list[-1]\r\nif data_list[0][1] < data_list[1][0] - data_list[0][0]:\r\n gap_len = data_list[1][0] - data_list[0][0] - data_list[0][1]\r\n count += 1\r\nelse:\r\n gap_len = data_list[1][0] - data_list[0][0]\r\nfor t in range(1, n - left - right - 3):\r\n if data_list[t][1] < gap_len:\r\n count += 1\r\n gap_len = data_list[t+1][0] - data_list[t][0]\r\n continue\r\n if data_list[t][1] < data_list[t+1][0] - data_list[t][0]:\r\n count += 1\r\n gap_len = data_list[t+1][0] - data_list[t][0] - data_list[t][1]\r\n else:\r\n gap_len = data_list[t+1][0] - data_list[t][0]\r\nif data_list[-1][1] < gap_len:\r\n count += 1\r\nprint(left + right + count + 2)\r\n", "# watchu lookin at?\r\n\r\nimport sys\r\nfrom math import *\r\n# from itertools import *\r\n# from heapq import heapify, heappop, heappush\r\n# from bisect import bisect, bisect_left, bisect_right\r\nfrom collections import deque, Counter, defaultdict as dd\r\nmod = 10**9+7\r\nabc = \"abcdefghijklmnopqrstuvwxyz\"\r\n# Sangeeta Singh\r\n\r\n\r\ndef input(): return sys.stdin.readline().rstrip(\"\\r\\n\")\r\ndef ri(): return int(input())\r\ndef rl(): return list(map(int, input().split()))\r\ndef rls(): return list(map(str, input().split()))\r\ndef isPowerOfTwo(x): return (x and (not(x & (x - 1))))\r\ndef lcm(x, y): return (x*y)//gcd(x, y)\r\ndef alpha(x): return ord(x)-ord('A')\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 d2b(n):\r\n s = bin(n).replace(\"0b\", \"\")\r\n return (34-len(s))*'0'+s\r\n\r\n\r\ndef highestPowerof2(x):\r\n x |= x >> 1\r\n x |= x >> 2\r\n x |= x >> 4\r\n x |= x >> 8\r\n x |= x >> 16\r\n return x ^ (x >> 1)\r\n\r\n\r\ndef nextPowerOf2(N):\r\n if not (N & (N - 1)):\r\n return N\r\n return int(\"1\" + (len(bin(N)) - 2) * \"0\", 2)\r\n\r\n\r\ndef isPrime(x):\r\n if x == 1:\r\n return False\r\n if x == 2:\r\n return True\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\n\r\ndef factors(n):\r\n i = 1\r\n ans = []\r\n while i <= sqrt(n):\r\n if (n % i == 0):\r\n if (n / i != i):\r\n ans.append(int(n/i))\r\n if i != 1:\r\n ans.append(i)\r\n i += 1\r\n return ans\r\n\r\n\r\nPrimes = [1] * 100001\r\nprimeNos = []\r\n\r\n\r\ndef SieveOfEratosthenes(n):\r\n p = 2\r\n while (p * p <= n):\r\n if (Primes[p]):\r\n for i in range(p * p, n+1, p):\r\n Primes[i] = 0\r\n p += 1\r\n for p in range(2, n+1):\r\n if Primes[p]:\r\n primeNos.append(p)\r\n\r\n# SieveOfEratosthenes(100000)\r\n# P = len(primeNos)\r\n# print(\"P\", P)\r\n\r\n\r\ndef ncr(n, r):\r\n ans = 1\r\n while(r):\r\n ans *= n\r\n ans %= mod\r\n n -= 1\r\n r -= 1\r\n return ans\r\n\r\n############ Main! #############\r\n# mod = 998244353\r\n\r\n\r\ndef sangee():\r\n n = ri()\r\n a = [rl() for i in range(n)]\r\n if n == 1:\r\n print(1)\r\n return\r\n ans = 2\r\n # print(a)\r\n for i in range(1, n-1):\r\n curr_ind = a[i][0]\r\n curr_height = a[i][1]\r\n if curr_ind-curr_height > a[i-1][0]:\r\n ans += 1\r\n elif curr_ind+curr_height < a[i+1][0]:\r\n a[i][0] = curr_ind+curr_height\r\n ans += 1\r\n # print(a)\r\n print(ans)\r\n\r\n\r\nt = 1\r\nfor _ in range(t):\r\n sangee()\r\n", "n = int(input())\r\nans = 0\r\ntree = []\r\nfor i in range(n):\r\n x, h = map(int,input().split())\r\n tree_i = [x, h, 0, 0]\r\n tree.append(tree_i)\r\nif n > 2:\r\n for i in range(1, n-1):\r\n tree[i][2] = tree[i][0]-tree[i-1][0]\r\n tree[i][3] = tree[i+1][0]-tree[i][0]\r\n for i in range(1, n-1):\r\n if tree[i][1] < tree[i][2]:\r\n ans += 1\r\n elif tree[i][1] < tree[i][3]:\r\n ans += 1\r\n tree[i+1][2] -= tree[i][1]\r\n ans += 2\r\nelse:\r\n ans = n\r\nprint(ans)", "n=int(input());t=2\r\nA=[[*map(int,input().split())] for _ in range(n)]\r\nfor i in range(1,n-1):\r\n x,y=A[i]\r\n if x-y>A[i-1][0]:t+=1\r\n elif x+y<A[i+1][0]:t+=1;A[i][0]+=y\r\nprint([1,t][n>1])", "\r\nn = int(input())\r\narr, height = [], []\r\n\r\nfor _ in range(n):\r\n x, h = map(int, input().strip().split(' '))\r\n\r\n arr.append(x)\r\n height.append(h)\r\n\r\n# print(arr, height, sep='\\n')\r\n\r\ndp = [0] * n\r\ndp[0] = 1\r\nx_last = arr.copy()\r\n\r\nfor i in range(1, n-1):\r\n if arr[i]-height[i] > x_last[i-1]:\r\n dp[i] = dp[i-1] + 1\r\n elif arr[i]+height[i] < arr[i+1]:\r\n dp[i] = dp[i-1] + 1\r\n x_last[i] = arr[i] + height[i]\r\n else:\r\n dp[i] = dp[i-1]\r\n\r\nif len(dp) > 1:\r\n print(dp[-2] + 1)\r\nelse:\r\n print(1)\r\n\r\n# @lru_cache(maxsize=None)\r\n# def f(i, x_last):\r\n# if i == n:\r\n# return 0\r\n\r\n# if arr[i]-height[i] > x_last:\r\n# return 1 + f(i+1, arr[i])\r\n# elif i < n-1 and arr[i]+height[i] >= arr[i+1]:\r\n# return f(i+1, arr[i])\r\n# else:\r\n# return max(1 + f(i+1, arr[i]+height[i]), f(i+1, arr[i]))\r\n\r\n# print(f(1, arr[0]) + 1)", "import sys\r\ninput = sys.stdin.readline\r\nn = int(input())\r\nls = []\r\nfor i in range(n) :\r\n ls.append(list(map(int,input().split())))\r\nans = 1\r\nfor i in range(1,n-1) :\r\n if ls[i][0] - ls[i-1][0] > ls[i][1] :\r\n ans += 1\r\n elif ls[i+1][0] - ls[i][0] > ls[i][1] :\r\n ans += 1\r\n ls[i][0] += ls[i][1]\r\nprint(ans+1) if n > 1 else print(ans)", "n=int(input())\nx=[]\nh=[]\nfor i in range(n):\n xh=[int(w) for w in input().split()]\n x.append(xh[0])\n h.append(xh[1])\nif n==1:\n print(1)\nelse:\n trees=2\n for i in range(1,n-1):\n if x[i]-x[i-1]>h[i]:\n trees+=1\n elif x[i+1]-x[i]>h[i]:\n trees+=1\n x[i]=x[i]+h[i]\n print(trees)\n\n\n\n", "n = int(input())\r\nline = {}\r\nspace = {}\r\nresult = 0\r\nfor i in range(n):\r\n x, h = [int(x) for x in input().split()]\r\n line[i] = [x, h]\r\nfor i in range(1, n):\r\n space[i] = line[i][0] - line[i-1][0]\r\nfor i in range(1, n-1):\r\n if line[i][1] < space[i]:\r\n result += 1\r\n elif line[i][1] < space[i+1]:\r\n space[i+1] -= line[i][1]\r\n result += 1\r\nif n == 1:\r\n print('1')\r\nelse:\r\n print(result+2)\r\n", "from sys import stdin ,stdout\r\ninput=stdin.readline\r\ninp=lambda : map(int,input().split())\r\ndef print(*args, end='\\n', sep=' ') -> None:\r\n stdout.write(sep.join(map(str, args)) + end)\r\n\r\n\r\nn = int(input()) ; arr=[] ; dp=[]\r\n\r\nfor i in range(n) : \r\n arr.append(list(inp()))\r\n dp.append([0]*3)\r\ndp[0][1]= 1 \r\nif n>1 and arr[0][0]+arr[0][1]< arr[1][0] : \r\n dp[0][2]= 1 \r\n\r\nfor i in range(1,n-1) :\r\n dp[i][0] = dp[i][1] = dp[i][2] = max(dp[i-1]) \r\n\r\n if arr[i][0]-arr[i][1] > arr[i-1][0] + arr[i-1][1] : \r\n dp[i][1] = dp[i-1][2] +1 \r\n elif arr[i][0]-arr[i][1] > arr[i-1][0] : \r\n dp[i][1] = dp[i-1][1]+1 \r\n if arr[i][0]+arr[i][1] < arr[i+1][0] : \r\n dp[i][2]+=1 \r\nprint(1 if n==1 else max(dp[n-2] ) +1 ) \r\n\r\n", "n=int(input())\r\ntree=[[int(x) for x in input().split()] for i in range(n)]\r\nnum=2\r\nif n==1:\r\n print(1)\r\nelse:\r\n for i in range(1,n-1):\r\n if tree[i][1]<tree[i][0]-tree[i-1][0]:\r\n num+=1\r\n elif tree[i][1]<tree[i+1][0]-tree[i][0]:\r\n num+=1\r\n tree[i][0]+=tree[i][1]\r\n print(num)\r\n", "n=int(input())\r\ns=[[int(x) for x in input().split()] for i in range(n)]\r\ncut=2\r\nif n<=2:\r\n print(n)\r\nelse:\r\n for i in range(1,n-1):\r\n if s[i][0]-s[i-1][0]>s[i][1]:\r\n cut+=1\r\n elif s[i+1][0]-s[i][0]>s[i][1]:\r\n cut+=1\r\n s[i][0]+=s[i][1]\r\n print(cut)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 19 21:03:35 2023\r\n\r\n@author: LeafAlive\r\n\"\"\"\r\n\r\nwoods=[]\r\nflag=[]\r\nsegments=[[0,1]]\r\nfor i in range(int(input())):\r\n woods.append(list(map(int,input().split())))\r\n flag.append(0)\r\nfor i in range(len(woods)-1):\r\n length=woods[i+1][0]-woods[i][0]\r\n if length>woods[i][1]:\r\n if length>woods[i+1][1]:\r\n if length>woods[i+1][1]+woods[i][1]:\r\n segments.append([1,1])\r\n else:\r\n segments.append([-1])\r\n else:\r\n segments.append([1,0])\r\n else:\r\n if length>woods[i+1][1]:\r\n segments.append([0,1])\r\n else:\r\n segments.append([0,0])\r\nsegments.append([1,0])\r\ntotal=0\r\nfor i in range(len(segments)):\r\n if segments[i]!=[-1]:\r\n for j in range(2):\r\n if segments[i][j]==1 and flag[i+j-1]==0:\r\n total+=1\r\n flag[i+j-1]=1\r\n segments[i]=[0,0]\r\nfor i in range(1,len(segments)-2):\r\n if segments[i]==[-1]:\r\n if flag[i-1]==1:\r\n if flag[i]==0:\r\n total+=1\r\n flag[i]=1\r\n segments[i]=[0,0]\r\nfor i in range(len(segments)-2,1,-1):\r\n if segments[i]==[-1]:\r\n if flag[i]==1:\r\n if flag[i-1]==0:\r\n total+=1\r\n flag[i-1]=1\r\n segments[i]=[0,0]\r\ntotal+=segments.count([-1])\r\nprint(total)\r\n", "woods=[]\r\nsegments=[[0,1]]\r\nfor i in range(int(input())):\r\n woods.append(list(map(int,input().split())))\r\nfor i in range(len(woods)-1):\r\n length=woods[i+1][0]-woods[i][0]\r\n if length>woods[i][1]:\r\n if length>woods[i+1][1]:\r\n if length>woods[i+1][1]+woods[i][1]:\r\n segments.append([1,1])\r\n else:\r\n segments.append([-1])\r\n else:\r\n segments.append([1,0])\r\n else:\r\n if length>woods[i+1][1]:\r\n segments.append([0,1])\r\n else:\r\n segments.append([0,0])\r\nsegments.append([1,0])\r\ntotal=0\r\nfor i in range(len(segments)):\r\n if segments[i]!=[-1]:\r\n if segments[i][0]==1:\r\n total+=1\r\n segments[i][0]=0\r\n if i>0 and segments[i-1]==[-1]:\r\n segments[i-1]=[1,0]\r\n if segments[i][1]==1:\r\n total+=1\r\n segments[i][1]=0\r\n if i<len(segments)-1:\r\n if segments[i+1]==[-1]:\r\n segments[i+1]=[0,1]\r\n else:\r\n segments[i+1][0]=0\r\nfor i in range(len(segments)-2,1,-1):\r\n if segments[i]!=[-1]:\r\n if segments[i][0]==1:\r\n total+=1\r\n segments[i][0]=0\r\n if i>0 and segments[i-1]==[-1]:\r\n segments[i-1]=[1,0]\r\ntotal+=segments.count([-1])\r\nprint(total)", "nu=int(input())\r\nc=[[0,0]for _ in range(nu)]\r\nfor i in range(nu):\r\n c[i][0],c[i][1]=map(int,input().split())\r\nif nu==1:\r\n su=1\r\nelse:\r\n su=2\r\n for i in range(1, nu - 1):\r\n if c[i][0] - c[i][1] > c[i - 1][0]:\r\n su += 1\r\n if c[i][0] - c[i][1] <= c[i - 1][0] and c[i + 1][0] - c[i][0] - c[i][1] > 0:\r\n su += 1\r\n c[i][0] += c[i][1]\r\nprint(su)", "#游敬恩，2300012555\r\ndef max_number_of_trees(n, trees):\r\n if n <= 2:\r\n return n\r\n max_trees = 2\r\n for i in range(1, n-1):\r\n prev = trees[i-1]\r\n curr = trees[i]\r\n next = trees[i+1]\r\n if curr[0] - curr[1] > prev[0]:\r\n max_trees += 1\r\n continue\r\n if curr[0] + curr[1] < next[0]:\r\n max_trees += 1\r\n curr[0] += curr[1]\r\n return max_trees\r\n\r\n# 读取输入\r\nn = int(input())\r\ntrees = []\r\nfor _ in range(n):\r\n x, h = map(int, input().split())\r\n trees.append([x, h])\r\n\r\n# 调用函数并输出结果\r\nresult = max_number_of_trees(n, trees)\r\nprint(result)", "trees = []\r\nn = int(input())\r\nfor _ in range(n):\r\n trees.append([int(x) for x in input().split()])\r\ndp1, dp2, dp3 = [0]*n, [0]*n, [0]*n\r\nfor i in range(1, n-1):\r\n dp1[i] = max(max(dp1[i-1],dp2[i-1])+(trees[i][0]-trees[i][1]>trees[i-1][0]),\\\r\n dp3[i-1] + (trees[i][0]-trees[i][1]>trees[i-1][0]+trees[i-1][1]))\r\n dp2[i] = max(dp1[i-1],dp2[i-1],dp3[i-1])\r\n dp3[i] = dp2[i]+1 if sum(trees[i])<trees[i+1][0] else 0\r\nprint(max(dp1[-2],dp2[-2],dp3[-2])+2 if n != 1 else 1)", "from math import inf\r\n\r\nn = int(input())\r\nx = [-inf]\r\nh = [0]\r\n\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n x += [a]\r\n h += [b]\r\n\r\nx += [inf]\r\ndp = [[0]*2 for _ in range(n+1)]\r\n\r\nfor i in range(1, n+1):\r\n dp[i][0] = max(dp[i-1][0] + (x[i] - h[i] > x[i-1]), dp[i-1][1] + (x[i-1] + h[i-1] < x[i] - h[i]))\r\n dp[i][1] = max(dp[i-1][0], dp[i-1][1]) + (x[i] + h[i] < x[i+1])\r\n\r\nprint(dp[-1][1])", "def main():\r\n n = int(input())\r\n stay = []\r\n for i in range(n):\r\n stay.append(list(map(int, input().split())))\r\n stay.append([1e10, 1e10])\r\n left = [stay[0]]\r\n right = [[-1e10, -1e10]]\r\n for i in range(1, n):\r\n if (sum(right[-1]) < stay[i][0]-stay[i][1]) and (stay[i-1][0] < stay[i][0]-stay[i][1]):\r\n left.append(stay[i])\r\n elif (stay[i+1][0] > (stay[i][0] + stay[i][1])):\r\n right.append(stay[i])\r\n\r\n print(len(left)+len(right)-1)\r\nmain()", "import sys\r\nfrom typing import Callable\r\n\r\n\r\ndef main() -> None:\r\n read: Callable[[], str] = sys.stdin.readline\r\n n = int(read())\r\n values: dict[int, tuple[int, int]] = dict()\r\n for i in range(n):\r\n x, h = (int(i) for i in read().split())\r\n values[i + 1] = (x, h)\r\n\r\n matrix: list[list[tuple[int, float]]] = [[(0, -float('inf')) for _ in range(3)] for _ in range(n + 1)]\r\n\r\n for row in range(1, len(matrix)):\r\n # Current value\r\n tree_x, tree_h = values[row]\r\n\r\n # col 0 = cut left\r\n x_left = tree_x - tree_h\r\n for i in range(3):\r\n # Tree would be too left\r\n if x_left <= matrix[row - 1][i][1]:\r\n continue\r\n if matrix[row][0][0] < matrix[row - 1][i][0] + 1:\r\n matrix[row][0] = (matrix[row - 1][i][0] + 1, tree_x)\r\n\r\n # col 1 = cut right\r\n x_left = tree_x\r\n x = tree_x + tree_h\r\n for i in range(3):\r\n # Tree would be too left\r\n if x_left <= matrix[row - 1][i][1]:\r\n continue\r\n if matrix[row][1][0] < matrix[row - 1][i][0] + 1:\r\n matrix[row][1] = (matrix[row - 1][i][0] + 1, tree_x + tree_h)\r\n\r\n # col 2 = do nothing\r\n x_left = tree_x\r\n for i in range(3):\r\n # Tree would be too left\r\n if x_left <= matrix[row - 1][i][1]:\r\n continue\r\n if matrix[row][2][0] < matrix[row - 1][i][0]:\r\n matrix[row][2] = (matrix[row - 1][i][0], tree_x)\r\n print(max(matrix[-1][0][0], matrix[-1][1][0], matrix[-1][2][0]))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\r\ntrees = []\r\nfor _ in range(n):\r\n x, h = map(int, input().split())\r\n trees.append((x, h))\r\n\r\nlast_occupied = float('-inf')\r\ncount = 0\r\nfor i in range(n):\r\n x, h = trees[i]\r\n if x - h > last_occupied:\r\n count += 1\r\n last_occupied = x\r\n elif i == n - 1 or x + h < trees[i + 1][0]:\r\n count += 1\r\n last_occupied = x + h\r\n else:\r\n last_occupied = x\r\n\r\nprint(count)\r\n", "trees = [[x, x - h, x + h] for x, h in\r\n [map(int, input().split()) for _ in range(int(input()))]]\r\ntrees.sort(key=lambda x: x[0])\r\ntrees = [[float('-inf')] * 3] + trees + [[float('inf')] * 3]\r\ndp = [[0, 0] for i in range((len(trees) - 1))]\r\nfor i in range(1, len(trees) - 1):\r\n dp[i][0] = max(dp[i - 1][0] + 1 if trees[i][1] > trees[i - 1][0] else dp[i - 1][0],\r\n dp[i - 1][1] + 1 if trees[i][1] > trees[i - 1][2] else dp[i - 1][1])\r\n if trees[i + 1][0] > trees[i][2]:\r\n dp[i][1] = max(dp[i - 1][0] + 1, dp[i - 1][1] + 1)\r\n else:\r\n dp[i][1] = dp[i - 1][1]\r\n trees[i][2] = trees[i][0]\r\nprint(max(dp[-1]))\r\n", "import sys\r\n\r\n# sys.stdin, sys.stdout = open(\"input.txt\", \"r\"), open(\"output.txt\", \"w\")\r\n\r\ndef main():\r\n n = int(input())\r\n points = []\r\n heights = []\r\n for _ in range(n):\r\n p, h = map(int, input().split())\r\n points.append(p)\r\n heights.append(h)\r\n if n == 1:\r\n print(1)\r\n return\r\n ans = 2\r\n prev = points[0]\r\n for i in range(1, n - 1):\r\n if points[i] - heights[i] > prev:\r\n ans += 1\r\n prev = points[i]\r\n else:\r\n if i + 1 < n - 1:\r\n if points[i + 1] <= points[i] + heights[i]:\r\n prev = points[i]\r\n continue\r\n else:\r\n ans += 1\r\n prev = points[i] + heights[i]\r\n else:\r\n if points[i] + heights[i] < points[i + 1]:\r\n ans += 1\r\n print(ans)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n = int(input())\r\nans = 1\r\nlx, lh = map(int, input().split())\r\nflag = False\r\nfor _ in range(n-1):\r\n x, h = map(int, input().split())\r\n if flag:\r\n if lh < x-lx:\r\n ans += 1\r\n lx += lh\r\n if h < x-lx:\r\n ans += 1\r\n flag = False\r\n else:\r\n flag = True\r\n lx, lh = x, h\r\nif flag:\r\n ans += 1\r\nprint(ans)", "n=int(input())\r\nl=[[0]for i in range(n)]\r\nfor i in range(n):\r\n l[i]=list(map(int,input().split()))#将树位置和长度存入列表\r\ns=2 #第一棵树往左倒，最后一棵树往右倒，所以至少有两棵树，它们两个的位置就是中间的倒地区间\r\nfor i in range(1,n-1):#从第二棵树和倒数第二棵树开始计算\r\n x,h=l[i] #取出树的位置和长度，非必要\r\n if x-h>l[i-1][0]:\r\n s+=1 #首先考虑往左倒，不砸到前面的树即可\r\n elif x+h<l[i+1][0]:\r\n s+=1 #其次再考虑向右倒，不砸到后面的树即可\r\n l[i][0]+=h #把树顶作为新的位置，不用考虑两棵树一棵倒了影响另外一棵，因为计得是棵数，而且一棵树至多对其周围的两棵树有影响\r\nif n>1:\r\n print(s)\r\nelse:\r\n print(1) #排除只有一棵树的特殊情况", "a=int(input())\r\nb=2\r\np=[]\r\nif a==1:\r\n print(1)\r\nelse:\r\n for i in range(a):\r\n p.append([int(i) for i in input().split()])\r\n for i in range(1,a-1):\r\n if p[i][0]-p[i][1]>p[i-1][0]:\r\n b=b+1\r\n elif p[i][1]+p[i][0]<p[i+1][0]:\r\n b=b+1\r\n p[i][0]=p[i][0]+p[i][1]\r\n print(b)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 00:05:19 2023\r\n\r\n@author: Lenovo\r\n\"\"\"\r\n\r\nn=int(input())\r\nl,num=[],2\r\nfor i in range(n):\r\n w=[int(_) for _ in input().split()]\r\n l.append(w)\r\nfor i in range(1,n-1):\r\n x,h=map(int,l[i])\r\n if x-h>l[i-1][0]:\r\n num+=1\r\n elif x+h<l[i+1][0]:\r\n num+=1\r\n l[i][0]+=h\r\nprint(num if n>1 else 1)", "n=int(input())\r\ntrees=[list(map(int,input().split())) for _ in range(n)]\r\nans=0\r\ntrees_key=[trees[i][0] for i in range(n)]\r\nj=0\r\nis_right=trees[0][0]-trees[0][1]-1 #第一颗树必定向左倒，记录最小范围\r\nwhile j < n:\r\n i=trees[j][0]\r\n left=i-trees[j][1]\r\n right=i+trees[j][1]\r\n num=0 #记录砍伐次数，防止同一棵树坎两次\r\n if j!=0:\r\n previous=max(trees[j-1][0],is_right)\r\n else:\r\n previous=left-1\r\n if j!=n-1:\r\n latter=trees[j+1][0]\r\n else:\r\n latter=right+1\r\n if previous<left:\r\n ans+=1\r\n num+=1\r\n if latter>right:\r\n if num<1:\r\n ans+=1\r\n is_right=right #这次向右倒，记录\r\n else:\r\n is_right=trees[0][0]-trees[0][1]-1\r\n j+=1\r\nprint(ans)", "n = int(input())\r\nl = []\r\ns = 0\r\nfor i in range(n):\r\n l.append([int(i) for i in input().split()])\r\nfor i in range(1,n-1):\r\n x, h = l[i]\r\n if x - h > l[i - 1][0]:\r\n s += 1\r\n elif x + h < l[i + 1][0]:\r\n s += 1\r\n l[i][0] = x + h\r\nprint([s + 1, s + 2][n != 1])", "n=int(input())\r\nl=[list(map(int,input().split())) for i in range(n)]\r\ns=2\r\nfor i in range(1,n-1):\r\n x,h=l[i]\r\n if x-h > l[i-1][0]:\r\n s+=1\r\n elif x+h < l[i+1][0]:\r\n s+=1\r\n l[i][0]+=h\r\nprint(s if n>1 else 1)", "n = int(input())\r\nx = [0] * (10 ** 5 + 2)\r\nh = [0] * (10 ** 5 + 2)\r\nfor i in range(n):\r\n x[i], h[i] = map(int, input().split())\r\nlow = - 10 ** 10\r\nx[n] = 10 ** 10\r\nans = 0\r\nfor i in range(n):\r\n if x[i] - low > h[i]:\r\n ans += 1\r\n low = x[i]\r\n elif x[i + 1] - x[i] > h[i]:\r\n ans += 1\r\n low = x[i] + h[i]\r\n else:\r\n low = x[i]\r\nprint(ans)", "t=int(input())\r\nlastx,lasty=map(int,input().split())\r\nlastfell=True\r\ncount=1\r\nfor i in range(1,t):\r\n x,y=map(int,input().split())\r\n if not lastfell and lastx+lasty<x:\r\n count+=1\r\n if x-y>lastx+lasty:\r\n lastfell=True\r\n count+=1\r\n elif x-y>lastx:\r\n count+=1\r\n lastfell=True\r\n else:\r\n lastfell=False\r\n lastx=x\r\n lasty=y\r\nif not lastfell:\r\n count+=1\r\nprint(count)\r\n \r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Sat Oct 22 20:26:33 2022\r\n\r\n@author: thinkpad\r\n\"\"\"\r\nimport sys\r\nn = int(input())\r\ninf,c = [],0\r\nwhile c<n:\r\n c+=1\r\n inf.append([int(i)for i in input().split()])\r\n\r\nif n==1:\r\n print(1)\r\n sys.exit()\r\nelif n==2:\r\n print(2)\r\n sys.exit()\r\nelse:\r\n res = 2\r\n for i in range(1,n-1):\r\n if inf[i][0]-inf[i-1][0]-1>=inf[i][1]:\r\n res+=1\r\n elif inf[i+1][0]-inf[i][0]-1>=inf[i][1]:\r\n res+=1\r\n inf[i][0] +=inf[i][1]\r\n print(res)\r\n", "n = int(input())\r\nt = []\r\nc=0\r\nfor i in range(n):\r\n t.append([int(i) for i in input().split()])\r\nfor i in range(1,n-1):\r\n a, b = t[i]\r\n if a - b > t[i-1][0]:\r\n c += 1\r\n elif a+b < t[i+1][0]:\r\n c += 1\r\n t[i][0] = a + b\r\nprint([c+1,c+2][n!=1])", "n = int(input())\r\npos = list()\r\nheight = list()\r\nfor i in range(n):\r\n x, y = map(int, input().split(' '))\r\n pos.append(x)\r\n height.append(y)\r\n\r\npos.append(float('inf'))\r\n\r\ntrees_fell = 1\r\nfor i in range(1, len(pos)-1):\r\n if pos[i] - pos[i-1] > height[i]:\r\n trees_fell += 1\r\n elif pos[i+1] - pos[i] > height[i]:\r\n trees_fell += 1\r\n pos[i] += height[i]\r\n\r\nprint(trees_fell)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 18:38:49 2023\r\n\r\n@author: GaoMingze 2300011427\r\n\"\"\"\r\n\r\nk=1\r\ny=0\r\nn=int(input())\r\ns,h=map(int,input().split())\r\np=s\r\nfor i in range(1,n):\r\n s,h=map(int,input().split())\r\n k+=1\r\n if s<=p:\r\n k-=1\r\n p=y\r\n \r\n if s-h>p:\r\n p=s\r\n else:\r\n p=s+h\r\n y=s\r\n\r\nprint(k)\r\n \r\n", "n=int(input());l=[[*map(int,input().split())]for _ in[0]*n]\r\ns=2\r\nfor i in range(1,n-1):\r\n x,h=l[i]\r\n if x-h>l[i-1][0]:s+=1\r\n elif x+h<l[i+1][0]:s+=1;l[i][0]+=h\r\nprint(s if n>1else 1)", "n = int(input())\r\n\r\nx = []\r\nh = []\r\n\r\ncount = 0\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n x.append(a)\r\n h.append(b)\r\n \r\ncount = 1\r\nfor i in range(1, n):\r\n \r\n if x[i]-h[i] > x[i-1]: # если можно повалить влево\r\n count+=1\r\n elif i == n-1:\r\n count+=1\r\n elif x[i]+h[i] < x[i+1]:\r\n count+=1\r\n x[i] = x[i]+h[i]\r\n \r\nprint(count)", "A=[]\r\nn=int(input())\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n A.append([a,b])\r\nres=0\r\n# A[0] = [A[0][0] - A[0][1], A[0][0]]\r\n# A[-1] = [A[-1][0], A[-1][0] + A[-1][1]]\r\ninf=float(\"inf\")\r\nLB=-inf\r\nfor i in range(n-1):\r\n a,b=A[i]\r\n if a-b>LB:LB=a;res+=1\r\n elif a+b<A[i+1][0]:LB=a+b;res+=1\r\n else:LB=a\r\nprint(res+1)", "\nn=int(input())\nl=[]\nfor i in range(n):\n l.append(list(map(int,input().split())))\nlast=-1e9;ans=0\nfor i in range(n):\n if l[i][0]-l[i][1]>last:ans+=1;last=l[i][0]\n elif i<n-1 and l[i][0]+l[i][1]<l[i+1][0]:ans+=1;last=l[i][0]+l[i][1]\n elif i==n-1: ans+=1\n else: last=l[i][0]\nprint (ans)\n", "#-*- coding: utf-8 -*\n'''\nCreated on Sun Oct 22\nauthor 钱瑞 2300011480\n'''\nn=int(input())\nl_location=[]\nl_height=[]\nfor i in range(n):\n l_0=list(map(int,str(input()).split(' ')))\n l_location.append(l_0[0])\n l_height.append(l_0[1])\nl_fell_r=[0 for i in range(n)]\nl_not_fell_r=[0 for i in range(n)]\nl_fell_r[0]=0\nl_not_fell_r[0]=1\nif n>1:\n for i in range(1,n-1):\n if l_location[i-1]+l_height[i-1]<l_location[i]-l_height[i]:\n l_not_fell_r[i]=max(l_fell_r[i-1]+1,l_not_fell_r[i-1]+1)\n elif l_location[i-1]<l_location[i]-l_height[i]:\n l_not_fell_r[i]=max(l_fell_r[i-1],l_not_fell_r[i-1]+1)\n else:\n l_not_fell_r[i]=max(l_fell_r[i-1],l_not_fell_r[i-1])\n if l_location[i]+l_height[i]<l_location[i+1]:\n l_fell_r[i]=max(l_fell_r[i-1]+1,l_not_fell_r[i-1]+1)\n else:\n l_fell_r[i]=0\n l_fell_r[n-1]=l_fell_r[n-2]+1\n l_not_fell_r[n-1]=l_not_fell_r[n-2]+1\nif l_fell_r[n-1]>l_not_fell_r[n-1]:\n print(l_fell_r[n-1])\nelse:\n print(l_not_fell_r[n-1])", "n = int(input())\r\na = []\r\nfor i in range(n):\r\n x, h = map(int,input().split())\r\n a.append((x,h))\r\nleft = [1]\r\nright = [1]\r\nstay = [0]\r\nfor i in range(1,n):\r\n x = a[i][0]\r\n h = a[i][1]\r\n s = a[i][0] - a[i-1][0]\r\n if s > a[i-1][1]:\r\n stay.append(max(left[i - 1], right[i - 1], stay[i - 1]))\r\n right.append(max(right[i-1],left[i-1],stay[i-1])+1)\r\n else:\r\n right.append(max(left[i-1],stay[i-1])+1)\r\n stay.append(max(left[i - 1], stay[i - 1]))\r\n left1 = 0\r\n left2 = 0\r\n if s > h:\r\n left1 = max(stay[i-1],left[i-1])+1\r\n if s > a[i-1][1] + h:\r\n left2 = right[i-1]+1\r\n left.append(max(left1, left2))\r\nprint(max(stay[n-1],right[n-1],left[n-1]))\r\n#print(left,stay,right)", "import math as ma\r\nn = int(input())\r\nx = [None] * (10 ** 5 + 2)\r\nh = [None] * (10 ** 5 + 2)\r\nfor i in range(n):\r\n x[i], h[i] = map(int, input().split())\r\nif n == 1:\r\n print(1)\r\nelse:\r\n low = x[0]\r\n high = x[n - 1] # stop_1 = ceil(n / 2) - 1, stop_2 = n - stop_1\r\n ans = 2\r\n for i in range(1, ma.ceil(n / 2) - 1): # left range\r\n if x[i] - low > h[i]:\r\n ans += 1\r\n low = x[i]\r\n elif x[i] + h[i] < x[i + 1]:\r\n ans += 1\r\n low = x[i] + h[i]\r\n else:\r\n low = x[i]\r\n for i in range(n - 2, n - ma.ceil(n / 2), -1): # right range\r\n if high - x[i] > h[i]:\r\n ans += 1\r\n high = x[i]\r\n elif x[i] - h[i] > x[i - 1]:\r\n ans += 1\r\n high = x[i] - h[i]\r\n else:\r\n high = x[i]\r\n if n % 2 == 1:\r\n if max(x[ma.ceil(n / 2) - 1] - low, high - x[ma.ceil(n / 2) - 1]) > h[ma.ceil(n / 2) - 1]:\r\n ans += 1\r\n else:\r\n if x[ma.ceil(n / 2) - 1] - low > h[ma.ceil(n / 2) - 1]:\r\n ans += 1\r\n low = x[ma.ceil(n / 2) - 1]\r\n elif x[n - ma.ceil(n / 2)] - x[ma.ceil(n / 2) - 1] > h[ma.ceil(n / 2) - 1]:\r\n ans += 1\r\n low = x[ma.ceil(n / 2) - 1] + h[ma.ceil(n / 2) - 1]\r\n else:\r\n low = x[ma.ceil(n / 2) - 1]\r\n if max(x[n - ma.ceil(n / 2)] - low, high - x[n - ma.ceil(n / 2)]) > h[n - ma.ceil(n / 2)]:\r\n ans += 1 # 显然以上两块 if else 是可以优化的，原谅我懒吧。\r\n print(ans)\r\n ", "import sys\r\n# sys.setrecursionlimit(400000)\r\ninput=lambda:sys.stdin.readline().strip()\r\n# write=lambda x:sys.stdout.write(str(x)+'\\n')\r\n\r\n# from decimal import Decimal\r\n# from datetime import datetime,timedelta\r\n# from random import randint\r\n# from copy import deepcopy\r\nfrom collections import deque,Counter\r\n# from heapq import heapify,heappush,heappop\r\n# from bisect import bisect_left,bisect,insort\r\nfrom math import inf,sqrt,gcd,pow,ceil,floor,log,log2,log10,pi,sin,cos,tan,asin,acos,atan\r\n# from functools import cmp_to_key,reduce\r\n# from operator import or_,xor,add,mul\r\n# from itertools import permutations,combinations,accumulate\r\n\r\ndef solve():\r\n n=int(input())\r\n x=[];h=[]\r\n for i in range(n):\r\n xi,hi=map(int,input().split())\r\n x.append(xi)\r\n h.append(hi)\r\n if n==1:\r\n print(1)\r\n return\r\n x.append(inf)\r\n dp=[[0]*3 for i in range(n)]\r\n dp[0][1]=1\r\n if x[1]-x[0]>=h[0]:\r\n dp[0][2]=1\r\n for i in range(1,n):\r\n dp[i][0]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2])\r\n if x[i]-x[i-1]>h[i]:\r\n dp[i][1]=max(dp[i-1][0],dp[i-1][1])+1\r\n if x[i]-x[i-1]>h[i]+h[i-1]:\r\n dp[i][1]=max(dp[i][1],dp[i-1][2]+1)\r\n else:\r\n dp[i][1]=0\r\n if x[i+1]-x[i]>h[i]:\r\n dp[i][2]=max(dp[i-1][0],dp[i-1][1],dp[i-1][2])+1\r\n else:\r\n dp[i][2]=0\r\n ans=max(dp[n-1][0],dp[n-1][1],dp[n-1][2])\r\n print(ans)\r\n # for i in range(n):\r\n # print(dp[i])\r\n return\r\n\r\n# t=int(input())\r\n# for _ in range(t):\r\n# solve()\r\n\r\nsolve()", "n=int(input())\r\ntree=[0]*n\r\nheight=[0]*n\r\ncut_tree=2\r\nfor i in range(n):\r\n tree[i],height[i]=map(int,input().split())\r\nif n==1:\r\n print(1)\r\nelse:\r\n for i in range(1,n-1):\r\n if tree[i]-height[i]>tree[i-1]:\r\n cut_tree+=1\r\n elif tree[i]+height[i]<tree[i+1]:\r\n cut_tree += 1\r\n tree[i]+=height[i]\r\n\r\n print(cut_tree)\r\n\r\n", "n = int(input())\r\nx = []\r\nh = []\r\nk = 0\r\nfor i in range(n):\r\n xi, hi = map(int, input().split())\r\n x.append(xi)\r\n h.append(hi)\r\nfor i in range(1, n - 1):\r\n if h[i] < x[i] - x[i - 1]:\r\n k += 1\r\n elif h[i] < x[i + 1] - x[i]:\r\n k += 1\r\n x[i] += h[i]\r\nif n >= 2:\r\n k += 2\r\nelif n < 2:\r\n k = n\r\nprint(k)", "n = int(input())\r\nxh = [[int(a) for a in input().split()] for _ in range(n)]\r\ns = 1\r\nr = -xh[0][1]\r\nfor i in range(n-1):\r\n if xh[i][0]-xh[i][1] > r:\r\n s += 1\r\n r = xh[i][0]\r\n elif xh[i][0]+xh[i][1] < xh[i+1][0]:\r\n s += 1\r\n r = xh[i][0]+xh[i][1]\r\n else:\r\n r = xh[i][0]\r\nprint(s)", "n=int(input())\r\nl=[[*map(int,input().split())]for f in[0]*n];s=2\r\nfor i in range(1,n-1):\r\n x,h=l[i]\r\n if x-h>l[i-1][0]:\r\n s+=1\r\n elif x+h<l[i+1][0]:\r\n s+=1\r\n l[i][0]+=h\r\nprint(s if n>1 else 1)", "n = int(input())\ncoords = []\nheights = []\n\nfor i in range(n):\n x, h = map(int, input().split())\n coords.append(x)\n heights.append(h)\n\ns = 2\n\nfor i in range(1, n-1):\n if coords[i] - coords[i-1] > heights[i]:\n s += 1\n elif coords[i+1] - coords[i] > heights[i]:\n s += 1\n coords[i] += heights[i]\n\nprint(1 if n == 1 else s)\n\t\t \t\t\t\t \t\t \t \t \t \t\t\t \t \t \t\t", "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\nN = int(input())\nl = [list(map(int,input().split())) for _ in range(N)]+[[float('inf'),float('inf')]]\ndp = [[l[0][0],1],[l[0][0],1]]\nfor i in range(1,N):\n x,h = l[i]\n k = [[-1,-1],[-1,-1]]\n if x-h>dp[0][0]:\n if x-h>dp[1][0] and dp[1][1]>dp[0][1]:\n k[0] = [x,dp[1][1]+1]\n else:\n k[0] = [x,dp[0][1]+1]\n else:\n k[0] = [x,max(dp[0][1],dp[1][1])]\n\n if x+h<l[i+1][0]:\n k[1] = [x+h,max(dp[0][1],dp[1][1])+1]\n else:\n k[1] = [x,max(dp[0][1],dp[1][1])]\n dp = k\nprint(max(dp[0][1],dp[1][1]))\n", "n = int(input())\r\ncount = 0\r\nX = []\r\nH = []\r\nfor _ in range(n):\r\n x,h = map(int,input().split())\r\n X.append(x)\r\n H.append(h)\r\nfor i in range(n):\r\n if i == 0:\r\n count += 1\r\n continue\r\n elif i == n-1:\r\n count += 1\r\n continue\r\n else:\r\n if X[i]-H[i] > X[i-1]:\r\n count += 1\r\n continue\r\n elif X[i]+H[i] < X[i+1]:\r\n count += 1\r\n X[i] += H[i]\r\n continue\r\n else:\r\n continue\r\nprint(count)\r\n", "from collections import Counter\r\nimport sys\r\nle = sys.__stdin__.read().split(\"\\n\")[::-1]\r\nn = int(le.pop())\r\npos = []\r\nheights = []\r\nfor _ in range(n):\r\n a, b = map(int, le.pop().split())\r\n pos.append(a)\r\n heights.append(b)\r\n\r\nans = [[1, 0, 1]]\r\nfor i in range(1, n):\r\n tmp = []\r\n # s1\r\n if heights[i] >= pos[i] - pos[i-1]:\r\n tmp.append(-1)\r\n elif heights[i] < pos[i] - pos[i-1] - heights[i-1]:\r\n tmp.append(max(ans[-1])+1)\r\n else:\r\n tmp.append(max(ans[-1][0] + 1, ans[-1][1] + 1, ans[-1][2]))\r\n # s2\r\n tmp.append(max(ans[-1]))\r\n # s3\r\n if i < n-1 and heights[i] >= pos[i+1] - pos[i]:\r\n tmp.append(-1)\r\n else:\r\n tmp.append(max(ans[-1]) + 1)\r\n ans.append(tmp)\r\nprint(max(ans[-1]))\r\n \r\n\r\n\r\n\r\n", "n=int(input())\r\nl=[]\r\nfor i in range(0,n):\r\n\tx,h=map(int,input().split())\r\n\tl.append([x,h])\r\nr=-1e9\r\nans=0\r\nfor i in range(0,n):\r\n\tif l[i][0]-l[i][1]>r:\r\n\t\tans+=1\r\n\t\tr=l[i][0]\r\n\telse:\r\n\t\tif i+1==n or l[i][0]+l[i][1]<l[i+1][0]:\r\n\t\t\tr=l[i][0]+l[i][1]\r\n\t\t\tans+=1\r\n\t\telse:\r\n\t\t\tr=l[i][0]\r\nprint(ans)\r\n", "from dataclasses import dataclass\nfrom typing import Optional, List\n\n\n@dataclass\nclass Tree:\n pos: int\n h: int\n direction: Optional[str] = None\n\n\nn = int(input())\ntrees: List[Tree] = []\nfor _ in range(n):\n idx, h = [int(i) for i in input().split()]\n trees.append(Tree(pos=idx, h=h, direction=None))\n\ncount = 0\nfor i in range(len(trees) - 1):\n if i == 0:\n trees[i].direction = 'LEFT'\n count += 1\n continue\n\n tree = trees[i]\n\n left = trees[i - 1]\n left_tree_place = left.pos\n if left.direction and left.direction == 'RIGHT':\n left_tree_place += left.h\n\n if tree.pos - left_tree_place > tree.h:\n count += 1\n trees[i].direction = 'LEFT'\n continue\n\n right = trees[i + 1]\n right_tree_place = right.pos\n if right.direction and right.direction == 'LEFT':\n right_tree_place -= right.h\n\n if right_tree_place - tree.pos > tree.h:\n trees[i].direction = 'RIGHT'\n count += 1\n continue\n\nprint(count + 1)\n\n", "n=int(input());x,h=[],[];l=[0]*n\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a);h.append(b)\r\nx.append(10**10)\r\nfor i in range(1,n):\r\n if (x[i]-x[i-1]>h[i] and l[i-1]<1) or (l[i-1]==1 and x[i]-x[i-1]>h[i]+h[i-1]):\r\n l[i]=-1\r\n elif x[i+1]-x[i]>h[i]:\r\n l[i]=1\r\n else:\r\n l[i]=0\r\nprint(n+1-l.count(0))", "x=[]\r\nh=[]\r\nn = int(input())\r\nfor _ in range(n):\r\n xi, hi = map(int,input().split())\r\n x += [xi]\r\n h += [hi]\r\nx += [1000000000000000000000]\r\nh += [0]\r\n#存储是否向右倒的总棵树数据(fallen_r有误，但没有关系)\r\nfallen_r = [0 for _ in range(n)]\r\nfallen_n = [1 for _ in range(n)]\r\n#递归fallen\r\nfor i in range(1,n):\r\n if x[i-1]+h[i-1] < x[i]-h[i]:\r\n fallen_n[i] = max(fallen_n[i-1]+1, fallen_r[i-1]+1)\r\n elif x[i-1] < x[i]-h[i]:\r\n fallen_n[i] = max(fallen_n[i-1]+1, fallen_r[i-1])\r\n else:\r\n fallen_n[i] = max(fallen_n[i-1], fallen_r[i-1])\r\n if x[i]+h[i] < x[i+1]:\r\n fallen_r[i] = max(fallen_n[i-1]+1, fallen_r[i-1]+1)\r\n else:\r\n fallen_r[i] = 0\r\nprint(max(fallen_n[-1],fallen_r[-1]))\r\n'''\r\n#把所有可能性存起来\r\nsituation = [[0, -10000000000]]#[fallen, edge]\r\nfor _ in range(int(input())):\r\n x, h = map(int,input().split())\r\n situation_new = []\r\n for chance in situation:\r\n #判断树能不能向左倒\r\n if x - h > chance[1]:\r\n situation_new += [[chance[0]+1, x]]\r\n continue\r\n #判定既定情况是否存在\r\n if x > chance[1]:\r\n situation_new += [[chance[0], x]]\r\n situation_new += [[chance[0]+1, x+h]]\r\n #print(situation_new)#111\r\n #去掉肯定无用的情况，把结果更新至situation\r\n situation = [situation_new[0]] \r\n for chance_new in situation_new:\r\n for standard in situation:\r\n if chance_new[0] > standard[0] or chance_new[1] > standard[1]:\r\n situation += [chance_new]\r\n #print(situation)#111\r\n#找最好的结果输出：\r\nmax_fallen = 0\r\nfor chance in situation:\r\n max_fallen = max(max_fallen, chance[0])\r\nprint(max_fallen)\r\n'''", "import sys\r\nfrom os import path\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline().strip()\r\n\r\n\r\ndef solve(l, r):\r\n pass\r\n\r\n\r\ndef main(multiple=False):\r\n n = int(input())\r\n x_array = []\r\n h_array = []\r\n for _ in range(n):\r\n x, h = map(int, input().split())\r\n x_array.append(x)\r\n h_array.append(h)\r\n ans = 1\r\n if n == 1:\r\n print(ans)\r\n return\r\n ans = 2\r\n indicator = x_array[0]\r\n for index in range(1, n - 1):\r\n if indicator < x_array[index] - h_array[index]:\r\n ans += 1\r\n indicator = x_array[index]\r\n elif x_array[index] + h_array[index] < x_array[index + 1]:\r\n ans += 1\r\n indicator = x_array[index] + h_array[index]\r\n else:\r\n indicator = x_array[index]\r\n print(ans)\r\n\r\n # solve(x, h)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n if (path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\", \"r\")\r\n # sys.stdout = open(\"output.txt\",\"w\")\r\n main()\r\n", "n =int(input())\r\nli = []\r\nfor i in range(n):\r\n li.append(list(map(int,input().split())))\r\ns = 1 + int(n != 1)\r\nfor i in range(1,n-1):\r\n if li[i][0]-li[i-1][0] > li[i][1]:\r\n s += 1\r\n elif li[i+1][0]-li[i][0] > li[i][1]:\r\n s += 1\r\n li[i][0] += li[i][1]\r\nprint(s)", "import sys\n\n\ndef input_lines():\n return list(map(str.strip, sys.stdin.readlines()))\n\ndef line_to_int_arr(line):\n return list(map(int, line.split(\" \")))\n\ndef print_arr(arr):\n for el in arr:\n print(el, end= ' ')\n print()\n \nlines = input_lines()\nn = int(lines[0])\narr = list(map(line_to_int_arr, lines[1:]))\ncntr = 0\nprev = -1 * (10 ** 10)\n\nfor i in range(n - 1):\n el = arr[i]\n if el[0] - el[1] > prev:\n prev = el[0]\n cntr += 1\n elif el[0] + el[1] < arr[i + 1][0]:\n prev = el[0] + el[1]\n cntr += 1 \n else:\n prev = el[0]\n\nprint(cntr + 1)\n \t \t\t\t\t\t\t \t \t\t \t \t\t", "n=int(input())\r\nX,H=[],[]\r\nfor _ in range(n):\r\n x,h=map(int,input().split())\r\n X.append(x)\r\n H.append(h)\r\n\r\nif n<3:\r\n answer=n\r\nelse: \r\n answer=2\r\n for i in range(1,n-1):\r\n left=X[i]-X[i-1]\r\n if H[i]<left:\r\n answer+=1\r\n else:\r\n right=X[i+1]-X[i]\r\n if H[i]<right:\r\n answer+=1\r\n X[i]+=H[i]\r\nprint(answer) ", "# DP\r\nn = int(input())\r\ncoord = []\r\nh = []\r\nlr = [0] * n # 标记砍倒方向：0不砍，-1往左，1往右\r\nfor _ in range(n):\r\n input_num = list(map(int, input().split()))\r\n coord.append(input_num[0])\r\n h.append(input_num[1])\r\nlr[0] = -1\r\nans = 1\r\nfor i in range(1, n):\r\n if (lr[i-1] == 1) and (coord[i]-coord[i-1] <= h[i-1]): # 第n棵树的加入可能导致n-1的树不可向右倒\r\n lr[i-1] = 0\r\n ans -= 1\r\n limit = max(coord[i-1] + lr[i-1] * h[i-1], coord[i-1]) # 目前不可倒边界\r\n if coord[i] - limit > h[i]: # n可以向左\r\n lr[i] = -1\r\n ans += 1\r\n else:\r\n lr[i] = 1\r\n ans += 1\r\nprint(ans)", "n = int(input())\r\n\r\ntrees = {}\r\nfor i in range(n):\r\n x,h = map(int,input().split())\r\n trees[x] = h\r\nsorted_pos = sorted(trees.keys())\r\nsorted_pos.append(10000000000)\r\n\r\nstd = -10000000000\r\nresult = n\r\nfor i in range(n):\r\n t = sorted_pos[i]\r\n if t - trees[t] > std:\r\n std = t\r\n elif t + trees[t] < sorted_pos[i+1]:\r\n std = t + trees[t]\r\n else:\r\n result -= 1\r\n std = t\r\nprint(result)\r\n\r\n\r\n\r\n", "n = int(input())\r\nc = 0\r\nx_prev = -10**9-1\r\nflag = False\r\nact = []\r\nif n == 1:\r\n print(1)\r\nelse:\r\n for i in range(n):\r\n\r\n x, h = map(int, input().split())\r\n if flag:\r\n if act[0] + act[1] < x:\r\n c += 1\r\n x_prev = act[0] + act[1]\r\n flag = False\r\n if x-h > x_prev:\r\n c += 1\r\n x_prev = x\r\n else:\r\n x_prev = x\r\n act = [x, h]\r\n flag = True\r\n\r\n if flag:\r\n c += 1\r\n print(c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Tue Oct 24 16:12:08 2023\r\n\r\n@author: 苏柔德 2300011012\r\n\"\"\"\r\nn=int(input())\r\ntree=[]\r\nfor _ in range(n):\r\n x,h=map(int,input().split())\r\n tree.append([x,h])\r\n \r\nif n>1:\r\n count=2\r\n for i in range(1,n-1):\r\n cx,ch=tree[i]\r\n if cx-ch>tree[i-1][0]:\r\n # 判断是否能向左砍倒树木\r\n count+=1\r\n elif cx+ch<tree[i+1][0]:\r\n # 判断是否能向右砍倒树木\r\n count+=1\r\n tree[i][0]=cx+ch\r\n \r\nif n==1:\r\n count=1\r\n \r\nprint(count)", "n = int(input())\r\ns = [[int(x) for x in input().split() ] for i in range(n)]#建立2维数组\r\ncount = 2#开始和结尾的两棵树肯定能砍\r\nif n == 1:\r\n print(1)\r\nelse:\r\n for i in range(1,n-1):\r\n if s[i][0]-s[i][1]>s[i-1][0]:#能往左边倒就往左边倒\r\n count+=1\r\n elif s[i][0]+s[i][1]<s[i+1][0]:#不能往左边倒就往右边倒\r\n count+=1\r\n s[i][0] += s[i][1]#向右边倒之后会阻碍后面一个树向左边倒，因此更新位置\r\n\r\n print(count)", "n = int(input())\r\npoint = -float(\"inf\")\r\nans = 1\r\nx0, h0 = map(int, input().split())\r\nfor i in range(n-1):\r\n x, h = map(int, input().split())\r\n if x0 - point > h0:\r\n ans += 1\r\n point = x0\r\n elif x0 + h0 < x:\r\n ans += 1\r\n point = x0 + h0\r\n else:\r\n point = x0\r\n x0, h0 = x, h\r\nprint(ans)", "n = int(input())\r\ntree = []\r\na = float(\"inf\")\r\nfor i in range(n):\r\n tree.append(list(map(int,input().split())))\r\ntree.append([a,0])\r\nm = [[0]*3 for i in range(n)]\r\nm[0][0]=1\r\nm[0][1]=0\r\nm[0][2]=[0,1][tree[1][0]>tree[0][0]+tree[0][1]]\r\nfor i in range(1,n):\r\n m[i][1]= max(m[i-1])\r\n if tree[i][0]-tree[i][1]<=tree[i-1][0]:\r\n m[i][0]= -a\r\n elif tree[i][0]-tree[i][1]>tree[i-1][0]+tree[i-1][1]:\r\n m[i][0]=max(m[i-1])+1\r\n else:\r\n m[i][0]=max(m[i-1][:-1])+1\r\n if tree[i][0]+tree[i][1]>=tree[i+1][0]:\r\n m[i][2]=-a\r\n else:\r\n m[i][2]=max(m[i-1])+1\r\nprint(max(m[n-1]))", "n = int(input())\r\nx = [0] * (n + 1)\r\nh = [0] * (n + 1)\r\nans = 2\r\n\r\nfor i in range(1, n + 1):\r\n x[i], h[i] = [int(i) for i in input().split()]\r\n\r\nfor i in range(2, n):\r\n if x[i] - x[i - 1] > h[i]:\r\n ans += 1\r\n elif x[i + 1] - x[i] > h[i]:\r\n x[i] += h[i]\r\n ans += 1\r\n\r\nif n == 1:\r\n ans = 1\r\n\r\nprint(ans)", "n=int(input())\r\ns=[[int(x) for x in input().split( )] for i in range(n)]\r\ncount=2\r\n\r\nif n == 1:\r\n print('1')\r\nif n!= 1:\r\n for j in range(1,n-1):\r\n if s[j][0]-s[j-1][0] > s[j][1]:\r\n count+=1\r\n elif s[j+1][0]-s[j][0] > s[j][1]:\r\n count+=1\r\n s[j][0]+=s[j][1]\r\n\r\n print(count)", "n = int(input())\r\ntrees = []\r\nfor _ in range(n):\r\n trees.append(tuple(map(int, input().split())))\r\nstart = trees[0][0] - trees[0][1] - 1\r\nend = trees[-1][0] + trees[-1][1] + 1\r\ncount = 0\r\n\r\ndef cut_trees(trees, start, end):\r\n global count\r\n if trees[0][0] - trees[0][1] > start:\r\n count += 1\r\n new_start = trees[0][0]\r\n else:\r\n if trees[0][0] + trees[0][1] < trees[1][0]:\r\n count += 1\r\n new_start = trees[0][0] + trees[0][1]\r\n else:\r\n new_start = trees[0][0]\r\n if trees[-1][0] + trees[-1][1] < end:\r\n count += 1\r\n new_end = trees[-1][0]\r\n else:\r\n if trees[-1][0] - trees[-1][1] > trees[-2][0]:\r\n count += 1\r\n new_end = trees[-1][0] - trees[-1][1]\r\n else:\r\n new_end = trees[-1][0]\r\n trees.pop(0)\r\n trees.pop()\r\n return trees, new_start, new_end\r\n\r\n\r\nwhile True:\r\n if len(trees) <= 2:\r\n break\r\n trees, start, end = cut_trees(trees, start, end)\r\nif len(trees) == 1:\r\n if trees[0][0] + trees[0][1] < end or trees[0][0] - trees[0][1] > start:\r\n count += 1\r\nif len(trees) == 2:\r\n if trees[0][0] - trees[0][1] > start:\r\n count += 1\r\n if trees[1][0] - trees[1][1] > trees[0][0] or trees[1][0] + trees[1][1] < end:\r\n count += 1\r\n elif trees[0][0] + trees[0][1] < trees[1][0]:\r\n count += 1\r\n if trees[1][0] - trees[1][1] > trees[0][0] + trees[0][1] or trees[1][0] + trees[1][1] < end:\r\n count += 1\r\n else:\r\n if trees[1][0] - trees[1][1] > trees[0][0] or trees[1][0] + trees[1][1] < end:\r\n count += 1\r\nprint(count)", "n = int(input())\r\nx_lst = []\r\nh_lst = []\r\nfor _ in range(n):\r\n x,h = map(int,input().split())\r\n x_lst.append(x)\r\n h_lst.append(h)\r\nif n == 1:\r\n print(1)\r\nelse:\r\n dp = [0] * (n - 1)\r\n judge = True\r\n for i in range(1, n - 1):\r\n if judge:\r\n if x_lst[i] - x_lst[i - 1] > h_lst[i]:\r\n dp[i] = dp[i - 1] + 1\r\n else:\r\n if x_lst[i + 1] - x_lst[i] > h_lst[i]:\r\n dp[i] = dp[i - 1] + 1\r\n judge = False\r\n else:\r\n dp[i] = dp[i - 1]\r\n else:\r\n if x_lst[i] - x_lst[i - 1] > h_lst[i - 1] + h_lst[i]:\r\n dp[i] = dp[i - 1] + 1\r\n judge = True\r\n elif x_lst[i + 1] - x_lst[i] > h_lst[i]:\r\n dp[i] = dp[i - 1] + 1\r\n else:\r\n dp[i] = dp[i - 1]\r\n judge = True\r\n print(dp[-1] + 2)", "n = int(input())\r\nlocation = []\r\nheight = []\r\ntrees = min(n,2)\r\nfor i in range(0,n):\r\n a,b = map(int,input().split())\r\n location.append(a)\r\n height.append(b)\r\nfor i in range(1,n-1):\r\n if location[i+1]>location[i]+height[i] or location[i-1]<location[i]-height[i]:\r\n trees+=1\r\n if location[i+1]>location[i]+height[i] and location[i-1]>=location[i]-height[i]:\r\n location[i]+=height[i]\r\nprint(trees)", "\r\nimport sys\r\n\r\nn= int(sys.stdin.readline())\r\narr = [[int(y[0]),int(y[1])] for y in [x.split() for x in [a.strip() for a in sys.stdin.readlines()] ] ]\r\n\r\n\r\nif n <= 1:\r\n print(n)\r\n exit()\r\n\r\nans = 2\r\n\r\nleft = arr[0][0]\r\n\r\nfor i in range(1, n - 1):\r\n if left < (arr[i][0] - arr[i][1]):\r\n ans += 1\r\n left = arr[i][0]\r\n elif (arr[i][0] + arr[i][1]) < arr[i+1][0]:\r\n ans += 1\r\n left = arr[i][0] + arr[i][1]\r\n else:\r\n left = arr[i][0]\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\ncut = 2\nroad = [list(map(int, input().split())) for _ in range(n)]\n# 想到极端情况！\nif n == 1:\n print(1)\nelse:\n for i in range(1, n - 1):\n if road[i][1] < road[i][0] - road[i - 1][0]:\n cut += 1\n elif road[i][1] < road[i + 1][0] - road[i][0]:\n cut += 1\n # 向右，会对下一棵树有影响\n road[i][0] += road[i][1]\n print(cut)\n", "n=int(input())\r\nl=[]\r\nfor _ in range(n):\r\n l.append(list(map(int,input().split())))\r\n\r\n#print(l)\r\ns=2\r\nif n>1:\r\n for i in range(1,n-1):\r\n x,h=l[i]\r\n if x-h>l[i-1][0]:\r\n s+=1\r\n elif x+h<l[i+1][0]:\r\n s+=1\r\n l[i][0]+=h\r\n print(s)\r\nelse:\r\n print(\"1\")", "# Compiled by zhou_tian from pku school of physics\r\n\r\nnu = int(input())\r\nc = [[0, 0]for _ in range(nu)]\r\n\r\nfor i in range(nu):\r\n c[i][0], c[i][1] = map(int, input().split())\r\n \r\nif nu == 1:\r\n su = 1\r\nelse:\r\n su = 2\r\n for i in range(1, nu - 1):\r\n if c[i][0] - c[i][1] > c[i - 1][0]:\r\n su += 1\r\n if c[i][0] - c[i][1] <= c[i - 1][0] and c[i + 1][0] - c[i][0] - c[i][1] > 0:\r\n su += 1\r\n c[i][0] += c[i][1]\r\n \r\nprint(su)", "def f(L):\r\n n=len(L)\r\n L.sort()\r\n if n==1:\r\n return 1\r\n x=2\r\n for i in range(1,n-1):\r\n if L[n-i-1][0]+L[n-i-1][1]<L[n-i][0]:\r\n x=x+1\r\n elif L[n-i-1][0]-L[n-i-1][1]>L[n-i-2][0]:\r\n x=x+1\r\n L[n-i-1][0]=L[n-i-1][0]-L[n-i-1][1]\r\n return x\r\nx=int(input())\r\nS=[]\r\nfor i in range(x):\r\n v=list(map(int,input().split()))\r\n S.append(v)\r\nprint(f(S))", "num=int(input())\r\nl=[[*map(int,input().split())] for i in range(num)]\r\ns=2\r\nfor i in range(1,num-1):\r\n x,h=l[i]\r\n if x-h>l[i-1][0]:\r\n s+=1\r\n elif x+h<l[i+1][0]:\r\n s+=1\r\n l[i][0]+=h\r\nprint(s if num>1 else 1)\r\n ", "n=int(input())\r\ntree=[]\r\nfor _ in range(n):\r\n tree.append(tuple(map(int,input().split())))\r\ncur=tree[0][0]\r\nif n==1:\r\n print(1)\r\n exit()\r\ncnt=2\r\nfor i in range(1,n-1):\r\n x,h=tree[i]\r\n if x-h>cur:\r\n cnt+=1\r\n cur=x\r\n elif x+h<tree[i+1][0]:\r\n cnt+=1\r\n cur=x+h\r\n else:\r\n cur=x\r\nprint(cnt)", "lstx, lsth, ans = [], [], 2\r\nfor i in range(int(input())):\r\n x, h = map(int, input().split())\r\n lstx.append(x)\r\n lsth.append(h)\r\nright = lstx[0]\r\nif len(lstx) == 1:\r\n print(1)\r\n exit()\r\nfor i in range(1, len(lsth) - 1):\r\n if lsth[i] < lstx[i] - right:\r\n ans += 1\r\n right = lstx[i]\r\n elif lsth[i] < lstx[i + 1] - lstx[i]:\r\n ans += 1\r\n right = lstx[i] + lsth[i]\r\n else:\r\n right = lstx[i]\r\nprint(ans)\r\n", "tree_info = []\n\nfor line in range(int(input())):\n tree_info.append([int(x) for x in input().split()])\n\nans = 0\nprev_max = None\nfor i, info in enumerate(tree_info):\n x, h = info\n if i == 0:\n ans += 1\n prev_max = tree_info[0][0]\n continue\n \n l_pos, r_pos = x - h, x + h\n\n #see if l_pos is valid\n if l_pos > prev_max:\n ans += 1\n prev_max = x\n continue\n\n #see if r_pos is valid\n if i == len(tree_info) - 1:\n ans += 1\n else:\n if r_pos < tree_info[i + 1][0]:\n ans += 1\n prev_max = r_pos\n else:\n prev_max = x\n \n\nprint(ans)\n\n\n", "woods=[list(map(int,input().split())) for i in range(int(input()))]\r\ntotal=1\r\nfor i in range(1,len(woods)-1):\r\n if woods[i][0]-woods[i-1][0]>woods[i][1]:total+=1\r\n elif woods[i+1][0]-woods[i][0]>woods[i][1]:total+=1;woods[i][0]+=woods[i][1]\r\nif len(woods)>1:\r\n total+=1\r\nprint(total)", "from math import ceil\nfrom collections import defaultdict, deque\n\nn = int(input())\nX = []\nH = []\nfor _ in range(n):\n x, h = (int(i) for i in input().split())\n X.append(x)\n H.append(h)\n\nc = [[0, 0] for i in range(n)]\nc[0][0] = c[0][1] = 1\nfor i in range(1, n):\n can_right = i == n - 1 or X[i] + H[i] < X[i + 1]\n can_left = X[i] - H[i] > X[i - 1]\n c[i][1] = max(c[i - 1][0], c[i - 1][1]) + can_right\n c[i][0] = max(c[i - 1][0] + can_left, c[i - 1][1] + (can_left if X[i - 1] + H[i - 1] < X[i] - H[i] else 0))\nprint(max(c[n - 1][0], c[n - 1][1]))\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 19 00:27:29 2023\r\n\r\n@author: gzk16\r\n\"\"\"\r\n\r\nn = int(input())\r\nx = [0] * (n+1)\r\nh = [0] * (n+1)\r\ndp = [[0] * 5 for _ in range(n+1)]\r\n\r\nfor i in range(1, n+1):\r\n x[i], h[i] = map(int, input().split())\r\n\r\nif n == 1:\r\n print(1)\r\n exit(0)\r\n\r\nif x[1] + h[1] < x[2]:\r\n dp[1][2] = 1\r\ndp[1][1] = 1\r\n\r\nfor i in range(2, n+1):\r\n p1 = dp[i-1][0]\r\n p2 = dp[i-1][1]\r\n p3 = dp[i-1][2]\r\n dp[i][0] = max(p1, p2, p3)\r\n if x[i] - x[i-1] > h[i] + h[i-1]:\r\n dp[i][1] = dp[i][0] + 1\r\n elif x[i] - x[i-1] > h[i]:\r\n dp[i][1] = 1 + max(p1, p2)\r\n if i+1 <= n and x[i+1] - x[i] > h[i]:\r\n dp[i][2] = 1 + dp[i][0]\r\n if i == n:\r\n dp[i][2] = 1 + dp[i][0]\r\n\r\nprint(max(dp[n][2], dp[n][0], dp[n][1]))", "n = int(input())\r\ncount = 2 # 第一和最后的树一定可以往外倒\r\nlix = []\r\nlih = []\r\nfor _ in range(n):\r\n x,h = map(int,input().split())\r\n lix.append(x)\r\n lih.append(h)\r\nif n == 1:\r\n print(1) # 防止下面的for出错\r\nelse:\r\n for i in range(1,n-1):\r\n if lix[i]-lix[i-1] > lih[i]:\r\n count += 1\r\n elif lix[i+1]-lix[i] > lih[i]:\r\n count += 1\r\n lix[i] += lih[i] # 下一棵树倒的范围不能和这棵树向右倒重合\r\n print(count)\r\n", "l = []\r\nr = []\r\nn = int(input())\r\nfor i in range(n):\r\n x, h = map(int, input().split())\r\n l.append(x)\r\n r.append(h)\r\nans = 0\r\nfor i in range(1, n - 1):\r\n if r[i] < l[i] - l[i - 1]:\r\n ans += 1\r\n elif r[i] < l[i + 1] - l[i]:\r\n ans += 1\r\n l[i] += r[i]\r\nif n == 1:\r\n ans += 1\r\nelse:\r\n ans += 2\r\nprint(ans)\r\n", "x = int(input())\r\nlt = []\r\nn = 0\r\nfor i in range(x):\r\n lt.append([int(i) for i in input().split()])\r\nfor i in range(1,x-1):\r\n a, b = lt[i]\r\n if a - b > lt[i-1][0]:\r\n n += 1\r\n elif a+b < lt[i+1][0]:\r\n n += 1\r\n lt[i][0] = a + b\r\nprint([n+1,n+2][x!=1])", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 18 01:28:14 2023\r\n\r\n@author: 2300011794\r\n\"\"\"\r\n\r\nn=int(input())\r\nx=[]\r\nh=[]\r\nflag=[]\r\nfor i in range(n):\r\n x.append(0)\r\n h.append(0)\r\n x[i],h[i]=map(int,input().split())\r\n flag.append(0)\r\nflag[0]=-1\r\nflag[-1]=1\r\nfor i in range(n-1):\r\n if x[i+1]-x[i]>h[i+1]+h[i]:\r\n flag[i]=1\r\n flag[i+1]=-1\r\nfor i in range(1,n-1):\r\n if flag[i]!=0:\r\n continue\r\n if flag[i-1]!=1 and x[i]-x[i-1]>h[i]:\r\n flag[i]=-1\r\n elif flag[i+1]!=-1 and x[i+1]-x[i]>h[i]:\r\n flag[i]=1\r\nprint(n-flag.count(0))", "a = int(input())\r\nb = []\r\nc = 0\r\nd = [0]\r\nfor i in range(0,a):\r\n b.append(list(map(int,input().split())))\r\nif a == 1:\r\n c = 1\r\nelse:\r\n c = 2\r\n for i in range(1,a-1):\r\n if b[i][0]>b[i-1][0]+b[i-1][1]*d[i-1]+b[i][1]:\r\n d.append(0)\r\n c+=1\r\n elif b[i][0]+b[i][1]<b[i+1][0]:\r\n d.append(1)\r\n c+=1\r\n else:\r\n d.append(0)\r\nprint(c)", "INF = 2e9\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = []\r\n for _ in range(n):\r\n a.append([int(i) for i in input().split()])\r\n if n <= 2:\r\n return n\r\n l_taken = a[0][0]\r\n ans = 2\r\n for i in range(1, n - 1):\r\n x, h = a[i]\r\n if x - h > l_taken:\r\n ans += 1\r\n l_taken = x\r\n elif x + h < a[i + 1][0]:\r\n l_taken = x + h\r\n ans += 1\r\n else:\r\n l_taken = x\r\n\r\n return ans\r\n\r\nprint(solve())", "n=int(input())\r\nx=[]\r\nh=[]\r\ny=[]\r\ns=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n x.append(a)\r\n h.append(b)\r\nfor i in range(n-1):\r\n y.append(x[i+1]-x[i]-1)\r\nfor i in range(n-2):\r\n if h[i+1]<=y[i]:\r\n s+=1\r\n elif h[i+1]<=y[i+1]:\r\n s+=1\r\n y[i+1]-=h[i+1]\r\nif n>=2:\r\n print(s+2)\r\nelse:\r\n print(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 l=[]\r\n for i in range(n):\r\n a , b =map(int,input().split())\r\n l.append([a,b])\r\n l.sort()\r\n ans =1 \r\n en =l[0][0]\r\n for i in range(1,n-1):\r\n new=l[i][0]-l[i][1]\r\n if new>en:\r\n ans+=1 \r\n en =l[i][0]\r\n else:\r\n new=l[i][0]+l[i][1]\r\n if new<l[i+1][0]:\r\n ans+=1 \r\n en =new \r\n else:\r\n en=l[i][0]\r\n if n>1:\r\n ans+=1\r\n print(ans)\r\n ", "'''程文奇 2100015898'''\r\nn=int(input())\r\nif n==1:\r\n s=1\r\nelse:\r\n s=2\r\nlist1=[]\r\nfor i in range(n):\r\n x,h=map(int,input().split())\r\n list1.append([x,h])\r\nlist1.sort(key=lambda s:s[0])\r\noccupied_point=list1.pop(0)[0]\r\nfor i in range(n-2):\r\n if list1[i][0]-list1[i][1]>occupied_point:\r\n s+=1\r\n occupied_point=list1[i][0]\r\n continue\r\n if list1[i][0]+list1[i][1]<list1[i+1][0]:\r\n s+=1\r\n occupied_point=list1[i][0]+list1[i][1]\r\n else:\r\n occupied_point=list1[i][0]\r\nprint(s)", "n=int(input())\r\nw=[0]*n\r\nh=[0]*n\r\nfor i in range(n):\r\n q,e=map(int,input().split())\r\n w[i]=q\r\n h[i]=e\r\nans=0\r\nfor i in range(n):\r\n if i==0:\r\n ans+=1\r\n elif i==n-1:\r\n ans+=1\r\n elif w[i]-h[i]>w[i-1]:\r\n ans+=1\r\n elif w[i]+h[i]<w[i+1]:\r\n ans+=1\r\n w[i]+=h[i]\r\nprint(ans)", "n=int(input())\r\ntree=[]\r\ns=set()\r\nfor i in range(n):\r\n tree.append(list(map(int,input().split())))\r\nans=1\r\nfor i in range(1,n-1):\r\n if tree[i][1]<tree[i][0]-tree[i-1][0]:\r\n ans=ans+1\r\n elif tree[i][1]<tree[i+1][0]-tree[i][0]:\r\n tree[i][0]=tree[i][0]+tree[i][1]\r\n ans=ans+1\r\nans=ans+1\r\nif n==1:\r\n ans=1\r\nprint(ans)", "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\r\nfrom copy import deepcopy\r\nimport heapq\r\n\r\nc = int(input())\r\nL = []\r\nfor _ in range(c):\r\n zuo, hei = map(int, input().split())\r\n L.append([zuo, hei])\r\nans = 0\r\ndp = [0] * c\r\ndirection = [\"L\"] * c\r\ndp[0] = 1\r\nfor i in range(1, len(L) - 1):\r\n if L[i][0] - L[i][1] <= L[i - 1][0] and L[i][0] + L[i][1] >= L[i + 1][0]:\r\n # 两边都不行\r\n dp[i] = dp[i - 1]\r\n else:\r\n if L[i][0] - L[i][1] > L[i - 1][0]:\r\n if direction[i - 1] == \"L\":\r\n # 前一棵树倒向左边\r\n dp[i] = dp[i - 1] + 1\r\n else:\r\n # 前一棵树倒向右边\r\n if L[i][1] + L[i - 1][1] < L[i][0] - L[i - 1][0]:\r\n dp[i] = dp[i - 1] + 1\r\n else:\r\n if L[i][0] + L[i][1] < L[i + 1][0]:\r\n dp[i] = dp[i - 1] + 1\r\n direction[i] = \"R\"\r\n else:\r\n dp[i] = dp[i - 1]\r\n else:\r\n dp[i] = dp[i - 1] + 1\r\n direction[i] = \"R\"\r\n# print(dp)\r\nif len(L) <= 2:\r\n print(len(L))\r\nelse:\r\n print(dp[-2] + 1)", "from sys import stdin,stdout\r\ninput,print = stdin.readline,stdout.write\r\n\r\nn=int(input())\r\nback=-10**9\r\nprev=-1\r\ncount=0\r\nfor i in range(n):\r\n pos,curr=map(int,input().split())\r\n #print(str(back),str(prev),str(pos),str(curr),str(count))\r\n dist=pos-back\r\n if prev==-1:\r\n if curr<dist:\r\n count+=1\r\n else:\r\n prev=curr\r\n else:\r\n if prev+curr<dist:\r\n count+=2\r\n prev=-1\r\n elif prev<dist:\r\n count+=1\r\n prev=curr\r\n elif curr<dist:\r\n count+=1\r\n prev=-1\r\n else:\r\n prev=curr\r\n back=pos\r\nif prev!=-1:\r\n count+=1\r\nprint(str(count))", "n = int(input())\r\ntrees = []\r\nfor i in range(n):\r\n trees.append(list(map(int,input().split())))\r\n# trees[i][0]: position\r\n# trees[i][1]: height\r\n\r\nr_edge = -trees[0][1]\r\nmax_num = 1\r\nfor i in range(n-1):\r\n # try to cut i-th tree\r\n # if can be cut leftward, then rightward, then cannot be cut\r\n if trees[i][0]-trees[i][1] > r_edge:\r\n max_num += 1\r\n r_edge = trees[i][0]\r\n elif trees[i][0]+trees[i][1] < trees[i+1][0]:\r\n max_num += 1\r\n r_edge = trees[i][0]+trees[i][1]\r\n else:\r\n r_edge = trees[i][0]\r\n\r\nprint(max_num)", "t = int(input())\r\ntree = []\r\ncoor = []\r\nfor i in range(t):\r\n n,m = [int(x) for x in input().split()]\r\n tree.append(n)\r\n coor.append(m)\r\nif t == 1:\r\n num = 1\r\nelse:\r\n num = 2\r\n for i in range(1,t-1):\r\n if tree[i]-coor[i] > tree[i-1]:\r\n num += 1\r\n elif tree[i]+coor[i] < tree[i+1]:\r\n num += 1\r\n tree[i] += coor[i]\r\nprint(str(num))\r\n", "n = int(input())\r\nth = [[int(x) for x in input().split()] for i in range(n)]\r\n \r\nif n == 1 or n == 2:\r\n print(n)\r\nelse:\r\n count = 2\r\n for i in range(1,n-1):\r\n if th[i][0] - th[i][1] > th[i-1][0]:\r\n count += 1\r\n elif th[i][0] + th[i][1] < th[i+1][0]:\r\n count += 1\r\n th[i][0] += th[i][1]\r\n \r\n print(count)", "n=int(input())\r\na=[]\r\nh=[]\r\nc=[]\r\nu=1\r\nfor i in range(n):\r\n x,y=[int(i) for i in input().split()]\r\n a.append(x)\r\n h.append(y)\r\nfor i in range(n-1):\r\n c.append(a[i+1]-a[i])\r\nc.append(h[-1]+1)\r\nfor i in range(1,n):\r\n if h[i]<c[i-1]:\r\n u=u+1\r\n elif h[i]<c[i]:\r\n u=u+1\r\n c[i]=c[i]-h[i]\r\nprint(u)", "#!/usr/bin/env python3\n# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Sun Oct 30 12:09:03 2022\n\n@author: calvinzhu\n\"\"\"\n\nn = int(input())\n\nlimit=cut=0\ntree=[]\nspace=[]\n\n\nfor i in range(n):\n x,y =[int(x) for x in input().split(\" \")]\n tree.append(x)\n space.append(y)\n \n \n \nfor i in range(n):\n \n x = tree[i]\n y = space[i]\n \n if i==0 or i == n-1:\n cut+=1\n limit = max(limit, x)\n continue\n \n if x-y>limit:\n cut+=1\n limit=x\n elif x+y<tree[i+1]:\n cut+=1\n limit=x+y\n else:\n limit = max(limit, x)\n \n \n \n \n \nprint(cut)\n\n ", "n = int(input())\r\na = [[int(x) for x in input().split()] for i in range(n)]\r\nc = 2\r\nfor i in range(1, n-1):\r\n if a[i][0]-a[i-1][0]>a[i][1]:\r\n c+=1\r\n elif a[i+1][0]-a[i][0]>a[i][1]:\r\n c+=1\r\n a[i][0]+=a[i][1]\r\nif n ==1:\r\n print(1)\r\nelse:\r\n print(c)", "from math import inf\r\n\r\nn = int(input()) #数量\r\nl = []\r\nfor _ in range(n):\r\n l += list(map(int,input().split())),\r\nl += (inf, 1),\r\n# print(l)\r\ntem = -inf\r\nans = 0\r\nfor i, (x1, h1) in enumerate(l[:-1]):\r\n if x1-h1> tem:\r\n tem = x1\r\n ans += 1\r\n elif x1 + h1 < l[i+1][0]:\r\n tem = x1 + h1\r\n ans += 1\r\n else: tem = x1\r\nprint(ans)", "trees = int(input())\r\n\r\nmost_trees = []\r\npositions = []\r\nheights = []\r\n\r\n\r\nfor tree_num in range(trees):\r\n new_tree_pos, new_tree_height = input().split()\r\n positions.append(int(new_tree_pos))\r\n heights.append(int(new_tree_height))\r\n\r\ntotal = min([2, trees])\r\nleft_offset = 0\r\nfor tree_num in range(1, trees - 1):\r\n if positions[tree_num] - heights[tree_num] > positions[tree_num - 1] + left_offset:\r\n total += 1\r\n left_offset = 0\r\n elif positions[tree_num] + heights[tree_num] < positions[tree_num + 1]:\r\n total += 1\r\n left_offset = heights[tree_num]\r\n else:\r\n left_offset = 0\r\n\r\nprint(total)", "n=int(input())\r\nnotc=[[0,0]for i in range(n)] #不砍[i][0]:占据的最右边的位置，[i][1]:砍得最多的树\r\nleft=[[0,0]for i in range(n)] #砍了左边倒[i][0]:占据的最右边的位置，[i][1]:砍得最多的树\r\nright=[[0,0]for i in range(n)] #砍了右边倒[i][0]:占据的最右边的位置，[i][1]:砍得最多的树\r\n\r\nx,h=map(int,input().split())\r\nnotc[0][0]=x\r\nnotc[0][1]=0\r\nleft[0][0]=x\r\nleft[0][1]=1\r\nright[0][0]=x+h\r\nright[0][1]=1\r\n\r\nfor i in range(1,n):\r\n x,h=map(int,input().split())\r\n leftnot=x#三种情况占据的最左边的位置\r\n leftleft=x-h\r\n leftright=x\r\n \r\n maxx=-1#最多砍了几棵树\r\n if notc[i-1][0]<leftnot and notc[i-1][1]>maxx:\r\n maxx=notc[i-1][1]\r\n if left[i-1][0]<leftnot and left[i-1][1]>maxx:\r\n maxx=left[i-1][1]\r\n if right[i-1][0]<leftnot and right[i-1][1]>maxx:\r\n maxx=right[i-1][1]\r\n notc[i][0]=x\r\n notc[i][1]=maxx\r\n \r\n maxx=-1#最多砍了几棵树\r\n if notc[i-1][0]<leftleft and notc[i-1][1]>maxx:\r\n maxx=notc[i-1][1]\r\n if left[i-1][0]<leftleft and left[i-1][1]>maxx:\r\n maxx=left[i-1][1]\r\n if right[i-1][0]<leftleft and right[i-1][1]>maxx:\r\n maxx=right[i-1][1]\r\n left[i][0]=x\r\n left[i][1]=maxx+1\r\n \r\n maxx=-1#最多砍了几棵树\r\n if notc[i-1][0]<leftright and notc[i-1][1]>maxx:\r\n maxx=notc[i-1][1]\r\n if left[i-1][0]<leftright and left[i-1][1]>maxx:\r\n maxx=left[i-1][1]\r\n if right[i-1][0]<leftright and right[i-1][1]>maxx:\r\n maxx=right[i-1][1]\r\n right[i][0]=x+h\r\n right[i][1]=maxx+1\r\n \r\n#print(notc,left,right)\r\nprint(max(notc[n-1][1],left[n-1][1],right[n-1][1]))", "from collections import defaultdict\r\nn=int(input())\r\nx,h=[],[]\r\nfor _ in range(n):\r\n xx,hh=[int(i) for i in input().split()]\r\n x.append(xx)\r\n h.append(hh)\r\n \r\ndf=[0 for _ in range(n)]\r\ndn=[0 for _ in range(n)]\r\ndn[0]=1\r\nif(n>1 and x[0]+h[0]<x[1]):\r\n df[0]=1\r\n\r\nfor i in range(1,n):\r\n if(x[i]-h[i]>x[i-1]+h[i-1]):\r\n dn[i]=max([1+df[i-1],1+dn[i-1],dn[i]])\r\n elif(x[i]-h[i]>x[i-1]):\r\n dn[i]=max(1+dn[i-1],dn[i])\r\n else:\r\n dn[i]=max(df[i-1],dn[i-1])\r\n df[i]=max(dn[i-1],df[i-1])\r\n if(i<n-1 and x[i]+h[i]<x[i+1]):\r\n df[i]+=1\r\n elif(i==n-1):\r\n df[i]+=1\r\n \r\nprint(max(df[n-1],dn[n-1]))", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Oct 26 16:05:27 2023\r\n\r\n@author: 程卓 2300011733\r\n\"\"\"\r\n\r\nn = int(input())\r\npos = [0 for i in range(n+1)]\r\nheight = [0 for i in range(n+1)]\r\nanswer = 2\r\nif n > 1:\r\n for i in range(n):\r\n pos[i+1],height[i+1] = map(int,input().split())\r\n for i in range(2,n):\r\n if pos[i]-height[i] > pos[i-1]:\r\n answer += 1\r\n elif pos[i]+height[i] < pos[i+1]:\r\n answer += 1\r\n pos[i] += height[i]\r\n print(answer)\r\nelse:\r\n print(1)", "n=int(input())\r\nif n<=2:\r\n print(n)\r\n quit()\r\n# left uncut right\r\ndp=[[None,None,None] for i in range(n)]\r\ndata=[]\r\nfor _ in range(n):\r\n data.append(list(map(int,input().split())))\r\ndp[0][0]=1\r\ndp[0][1]=0\r\n\r\nif data[1][0]>sum(data[0]):\r\n dp[0][2]=1\r\nelse:\r\n dp[0][2]=-float('inf')\r\n\r\nfor i in range(1,n-1):\r\n dp[i][1]=max(dp[i-1])\r\n # fall left\r\n if sum(data[i-1])<data[i][0]-data[i][1]:\r\n dp[i][0]=1+max(dp[i-1])\r\n elif data[i-1][0]<data[i][0]-data[i][1]:\r\n dp[i][0]=1+max(dp[i-1][0],dp[i-1][1])\r\n else:\r\n dp[i][0]=-float('inf')\r\n \r\n # fall right\r\n if sum(data[i])<data[i+1][0]:\r\n dp[i][2]=1+max(dp[i-1])\r\n else:\r\n dp[i][2]=-float('inf')\r\n \r\ndp[n-1][1]=max(dp[n-2])\r\ndp[n-1][0]=-float('inf')\r\ndp[n-1][2]=1+max(dp[n-2])\r\n\r\nprint(max(dp[n-1]))", "n=int(input())\r\ntree=[]\r\nif n >= 3 :\r\n num = 2\r\n for i in range(n):\r\n x, h = map(int, input().split())\r\n tree.append([x, h])\r\n for i in range(1, n - 1):\r\n space_left = tree[i][0] - tree[i - 1][0]\r\n space_right = tree[i + 1][0] - tree[i][0]\r\n if space_left > tree[i][1]:\r\n num += 1\r\n continue\r\n if space_right > tree[i][1]:\r\n num += 1\r\n tree[i][0] += tree[i][1]\r\nif n == 1 :\r\n num = 1 \r\nif n == 2 :\r\n num = 2\r\n\r\nprint(num)", "n = int(input())\r\nsp = []\r\nfor i in range(n):\r\n x, h = map(int, input().split())\r\n sp.append((x, x, x + h))\r\n sp.append((x, x - h, x))\r\nsp.sort()\r\na = []\r\nfor i in range(n * 2):\r\n t = True\r\n if i != 0:\r\n if sp[i - 1][0] >= sp[i][1] and sp[i - 1][0] != sp[i][0]:\r\n t = False\r\n if i != n * 2 - 1:\r\n if sp[i + 1][0] <= sp[i][2] and sp[i + 1][0] != sp[i][0]:\r\n t = False\r\n if t:\r\n a.append((sp[i][1], sp[i][2]))\r\na.sort()\r\nc = 0\r\ncurr = -99999999999\r\nfor i in range(len(a)):\r\n if a[i][0] > curr:\r\n curr = a[i][1]\r\n c += 1\r\nprint(c)\r\n", "import sys\r\nn = int(input())\r\nx, h = [0] * n, [0] * n\r\nfor i in range(n):\r\n x[i], h[i] = map(int, input().split())\r\nif n == 1:\r\n print(1)\r\n sys.exit(0)\r\npl, pd, sm, mpd = [0] * n, [0] * n, [0] * n, [0] * n\r\nsm[0] = 0\r\npl[0] = 1\r\npd[0] = 1 if x[0] + h[0] < x[1] - h[1] else sm[0]\r\nmpd[n - 1] = 1\r\nfor i in range(n - 2, -1, -1):\r\n mpd[i] = 1 if x[i] + h[i] < x[i + 1] else 0\r\nfor i in range(1, n):\r\n sm[i] = max(pl[i - 1], pd[i - 1])\r\n pll = 1 + pl[i - 1] if x[i - 1] < x[i] - h[i] else sm[i]\r\n pld = 1 + pd[i - 1] if x[i - 1] + h[i - 1] < x[i] - h[i] else sm[i]\r\n pl[i] = max(pll, pld)\r\n pd[i] = mpd[i] + max(pl[i - 1], pd[i - 1])\r\nprint(max(pl[n - 1], pd[n - 1]))\r\n\r\n\r\n" ]

[ "print(\"odd\")\r\n\t \t \t\t \t\t\t\r\n\t \t\t\t \t \r\n \t \t \t\t\t\t\r\n\t \t# ihgfuierhqfwerbvg qgjiowehfuebhwlgho;shg;ohawf;wohf;woehfa;wlfh\r\n\t \t\t\t\t\t \r\n\t \t\t\t \t\t\t\r\n \t\t \t\t \t \r\n \t \t\t\t\t", "#include <bits/stdc++.h>\r\nprint(\"odd\")\r\n\r\n \t \t\t \r\n\t \t\t \t\r\n\t \t \t\t \r\n\t\t\t\t \t \t\t", "a=int(input())\r\nif a==1 or a==3 or a==5 or a==7 and a==9 or a==12 or a==14 or a==16 or a==18 or a==19 or a==21 or a==23 or a==25 or a==27 or a==30 or a==32 or a==34 or a==36:\r\n print('red')\r\nelse:\r\n print('black')\r\n\t\t \t \t \r\n \t \t\t \t\r\n \t \t\t\t\t \t\r\n \t\t\t \t \t\t\t", "import random\r\nx=random.random()\r\nif(x>0.5):\r\n print(\"red\")\r\nelse:\r\n print(\"black\")\r\n\t\t \t \t \t \r\n \t \t \t\t\r\n \t\t \t\r\n \t\t\t\t \t\t", "print(\"BLACK\")\r\n\t \t\t \t \t \t\r\n \t\t\t\t\t\r\n \t\t \t\t \r\n \t \t \t\t \t", "a=int(input())\r\nif a%2==0:\r\n print('Black')\r\nelse:\r\n print('Red')\r\n \t\t \t \t\t\t\r\n\t\t\t\t \t \t\r\n\t\t \t \t \r\n \t\t \t \t\t\t\t" ]

[ "import sys;I=sys.stdin.readline;from collections import defaultdict as DD\r\nR=lambda:map(int,I().split());n,=R();a=[*R()];q,=R();z,V=DD(int),DD(int)\r\ndef gcd(a,b):\r\n while a!=0:a,b=b%a,a\r\n return b\r\nfor x in a:\r\n cur=DD(int)\r\n for y in V:g=gcd(y,x);cur[g]+=V[y]\r\n cur[x]+=1;V=cur\r\n for y in V:z[y]+=V[y]\r\nfor _ in range(q):x,=R();print(z[x])", "from sys import stdin, stdout\r\nip = lambda : stdin.readline().strip()\r\nips = lambda : ip().split()\r\nmp = lambda : map(int, ips())\r\nls = lambda : list(mp())\r\nout = lambda x, end='\\n' : stdout.write(str(x)+end)\r\nfrom math import log2, gcd\r\n\r\nn = int(ip())\r\na = ls()\r\ndiv, nxtdiv, res = {}, {}, {}\r\nfor i in range(n):\r\n nxtdiv.clear()\r\n for k in div:\r\n g = gcd(a[i], k)\r\n nxtdiv[g] = nxtdiv.get(g, 0) + div[k]\r\n nxtdiv[a[i]] = nxtdiv.get(a[i], 0) + 1\r\n div, nxtdiv = nxtdiv, div\r\n for k in div:\r\n res[k] = res.get(k, 0) + div[k]\r\nq = int(ip())\r\nfor _ in range(q):\r\n x = int(ip())\r\n out(res.get(x, 0))\r\n\r\n\r\n", "import sys;I=sys.stdin.readline;from collections import defaultdict as DD\r\nR=lambda:map(int,I().split());n,=R();a=[*R()];q,=R();z,dp=DD(int),DD(int)\r\ndef gcd(a,b):\r\n while a!=0:a,b=b%a,a\r\n return b\r\nfor x in a:\r\n cur=DD(int)\r\n for y in dp:g=gcd(y,x);cur[g]+=dp[y]\r\n cur[x]+=1;dp=cur\r\n for y in dp:z[y]+=dp[y]\r\nfor _ in range(q):x,=R();print(z[x])", "from sys import stdin\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ninput = stdin.readline\r\n\r\n# n, k = map(int, input().split(\" \"))\r\n# l = list(map(int, input().split(\" \")))\r\n\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\n\r\nk = math.ceil(math.log2(n))\r\ndp = [[0] * k for i in range(2 ** k)]\r\n\r\n\r\ndef make_sparse(l, n, k):\r\n \"\"\"Making sparse table, replace max with needed function like[GCD, Min, max, sum]\"\"\"\r\n for i in range(n):\r\n dp[i][0] = l[i]\r\n\r\n for j in range(1, k + 1):\r\n i = 0\r\n while i + (1 << j) <= n:\r\n dp[i][j] = math.gcd(dp[i][j - 1], dp[i + (1 << (j - 1))][j - 1])\r\n i += 1\r\n\r\n\r\ndef querys(l, r):\r\n j = int(math.log2(r - l + 1))\r\n return math.gcd(dp[l][j], dp[r - (1 << j) + 1][j])\r\n\r\n\r\nmake_sparse(l, n, k)\r\nd = defaultdict(int)\r\ng = defaultdict(int)\r\nd[l[0]] = 1\r\ng[l[0]] = 1\r\nfor i in range(1, n):\r\n t = defaultdict(int)\r\n t[l[i]] = 1\r\n g[l[i]]+=1\r\n for k, v in d.items():\r\n gcd = math.gcd(k, l[i])\r\n t[gcd] += v\r\n g[gcd] += v\r\n d = t\r\n\r\nfor i in range(int(input())):\r\n a = g[int(input())]\r\n if not a:\r\n print(0)\r\n else:\r\n print(a)\r\n", "from sys import stdin\r\nimport math\r\nfrom collections import defaultdict\r\n\r\ninput = stdin.readline\r\n\r\n# n, k = map(int, input().split(\" \"))\r\n# l = list(map(int, input().split(\" \")))\r\n\r\nn = int(input())\r\nl = list(map(int, input().split(\" \")))\r\n\r\n\r\nd = defaultdict(int)\r\ng = defaultdict(int)\r\nd[l[0]] = 1\r\ng[l[0]] = 1\r\nfor i in range(1, n):\r\n t = defaultdict(int)\r\n t[l[i]] = 1\r\n g[l[i]]+=1\r\n for k, v in d.items():\r\n gcd = math.gcd(k, l[i])\r\n t[gcd] += v\r\n g[gcd] += v\r\n d = t\r\n\r\nfor i in range(int(input())):\r\n a = g[int(input())]\r\n print(a)\r\n", "from math import gcd\r\nfrom collections import defaultdict\r\nfrom sys import stdin, stdout\r\n\r\n##This method is better cause for all the same results we only calculate once\r\ndef main():\r\n GCD_count = defaultdict(int)\r\n GCD_map = defaultdict(int)\r\n arr_len = int(stdin.readline())\r\n arr = [int(x) for x in stdin.readline().split()]\r\n for start in range(arr_len):\r\n temp = defaultdict(int)\r\n GCD_count[arr[start]] += 1\r\n temp[arr[start]] += 1\r\n for gcd_now, occurence in GCD_map.items():\r\n res = gcd(gcd_now, arr[start])\r\n temp[res] += occurence\r\n GCD_count[res] += occurence\r\n GCD_map = temp\r\n num_queries = int(stdin.readline())\r\n for _ in range(num_queries):\r\n print(GCD_count[int(stdin.readline())])\r\n\r\n\r\nmain()\r\n", "#!/usr/bin/env python3\r\n# from typing import *\r\n\r\nimport sys\r\nimport io\r\nimport math\r\nimport collections\r\nimport decimal\r\nimport itertools\r\nimport bisect\r\nimport heapq\r\n\r\n\r\ndef input():\r\n return sys.stdin.readline()[:-1]\r\n\r\n\r\n# sys.setrecursionlimit(1000000)\r\n\r\n# _INPUT = \"\"\"3\r\n# 2 6 3\r\n# 5\r\n# 1\r\n# 2\r\n# 3\r\n# 4\r\n# 6\r\n# \"\"\"\r\n# sys.stdin = io.StringIO(_INPUT)\r\n\r\nINF = 10**10\r\n\r\n\r\nclass SparseTable_GCD:\r\n def __init__(self, a):\r\n n = len(a)\r\n self.a = a\r\n self.LogTable = [0, 0]\r\n for i in range(2, n+1):\r\n self.LogTable.append(self.LogTable[i>>1] + 1)\r\n max_k = self.LogTable[n]\r\n self.Table = [[0] * n for _ in range(max_k+1)]\r\n for i in range(n):\r\n self.Table[0][i] = a[i]\r\n for k in range(1, max_k+1):\r\n for i in range(n-(1<<k)+1):\r\n v1 = self.Table[k-1][i]\r\n v2 = self.Table[k-1][i+(1<<(k-1))]\r\n self.Table[k][i] = math.gcd(v1, v2)\r\n \r\n def query_rgcd(self, l, r):\r\n k = self.LogTable[r-l]\r\n v1 = self.Table[k][l]\r\n v2 = self.Table[k][r-(1<<k)]\r\n return math.gcd(v1, v2)\r\n\r\nN = int(input())\r\nA = list(map(int, input().split()))\r\nsp_table_gcd = SparseTable_GCD(A)\r\n\r\nresult = collections.defaultdict(int)\r\nfor i in range(N):\r\n g = A[i]\r\n k = i\r\n while k < N:\r\n g = sp_table_gcd.query_rgcd(i, k+1)\r\n ok = k+1\r\n ng = N+1\r\n while abs(ok-ng) > 1:\r\n mid = (ok+ng)//2\r\n if sp_table_gcd.query_rgcd(i, mid) >= g:\r\n ok = mid\r\n else:\r\n ng = mid\r\n k1 = ok\r\n result[g] += k1-k # [k, k1)\r\n k = k1\r\n\r\nQ = int(input())\r\nfor _ in range(Q):\r\n x = int(input())\r\n print(result[x])\r\n", "from sys import stdin\r\nn = int(stdin.readline())\r\na = [int(x) for x in stdin.readline().split()]\r\n\r\nq = int(stdin.readline())\r\n\r\ndef gcd(a,b):\r\n while a != 0:\r\n a,b = b%a, a\r\n return b\r\n \r\ntotals = {}\r\nnew = {}\r\n\r\nfor x in a[::-1]:\r\n old = new\r\n new = {}\r\n for y in old:\r\n g = gcd(x,y)\r\n if g in new:\r\n new[g] += old[y]\r\n else:\r\n new[g] = old[y]\r\n if x in new:\r\n new[x] += 1\r\n else:\r\n new[x] = 1\r\n for y in new:\r\n if y in totals:\r\n totals[y] += new[y]\r\n else:\r\n totals[y] = new[y]\r\n \r\n \r\n\r\n\r\nfor x in range(q):\r\n c = int(stdin.readline())\r\n if c in totals:\r\n print(totals[c])\r\n else:\r\n print(0)\r\n", "import sys\r\nimport math\r\n\r\n# sys.stdin = open(\"problemname.in\", \"r\")\r\n# sys.stdout = open(\"problemname.out\", \"w\")\r\n\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n mp2 = {}\r\n ans = {}\r\n for x in a:\r\n mp = {}\r\n for key, value in mp2.items():\r\n z = math.gcd(key, x)\r\n if z in mp:\r\n mp[z] += value\r\n else:\r\n mp[z] = 1\r\n mp[z] += value - 1\r\n \r\n if x in mp:\r\n mp[x] += 1\r\n else:\r\n mp[x] = 1\r\n \r\n mp, mp2 = mp2, mp\r\n for key, value in mp2.items():\r\n if key in ans:\r\n ans[key] += value\r\n else:\r\n ans[key] = 1\r\n ans[key] += value - 1\r\n q = int(input())\r\n for i in range(q):\r\n val = int(input())\r\n if val in ans:\r\n print(ans[val])\r\n else:\r\n print(0)", "from collections import Counter\r\nfrom math import gcd\r\nfrom sys import stdin\r\ninput = lambda: stdin.readline().rstrip('\\r\\n')\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\n\r\nans = Counter()\r\nf = Counter()\r\n\r\nfor x in a:\r\n g = Counter()\r\n ans[x] += 1\r\n g[x] += 1\r\n for y in f:\r\n z = gcd(x, y)\r\n g[z] += f[y]\r\n ans[z] += f[y]\r\n f = g\r\n\r\nfor _ in range(int(input())):\r\n x = int(input())\r\n print(ans[x])", "import os,sys,math,random,threading\r\nfrom copy import deepcopy\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\nfrom functools import lru_cache, reduce\r\nfrom bisect import bisect_left, bisect_right\r\nfrom collections import Counter, defaultdict, deque\r\nfrom itertools import accumulate, combinations, permutations\r\nfrom heapq import nsmallest, nlargest, heapify, heappop, heappush\r\nfrom typing import Generic, Iterable, Iterator, TypeVar, Union, List\r\nimport types\r\nBUFSIZE = 4096\r\nclass FastIO(IOBase):\r\n newlines = 0\r\n def __init__(self, file):\r\n self._fd = file.fileno()\r\n self.buffer = BytesIO()\r\n self.writable = \"x\" in file.mode or \"r\" not in file.mode\r\n self.write = self.buffer.write if self.writable else None\r\n def read(self):\r\n while True:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n if not b:\r\n break\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines = 0\r\n return self.buffer.read()\r\n def readline(self):\r\n while self.newlines == 0:\r\n b = os.read(self._fd, max(os.fstat(self._fd).st_size, BUFSIZE))\r\n self.newlines = b.count(b\"\\n\") + (not b)\r\n ptr = self.buffer.tell()\r\n self.buffer.seek(0, 2), self.buffer.write(b), self.buffer.seek(ptr)\r\n self.newlines -= 1\r\n return self.buffer.readline()\r\n def flush(self):\r\n if self.writable:\r\n os.write(self._fd, self.buffer.getvalue())\r\n self.buffer.truncate(0), self.buffer.seek(0)\r\nclass IOWrapper(IOBase):\r\n def __init__(self, file):\r\n self.buffer = FastIO(file)\r\n self.flush = self.buffer.flush\r\n self.writable = self.buffer.writable\r\n self.write = lambda s: self.buffer.write(s.encode(\"ascii\"))\r\n self.read = lambda: self.buffer.read().decode(\"ascii\")\r\n self.readline = lambda: self.buffer.readline().decode(\"ascii\")\r\nsys.stdin = IOWrapper(sys.stdin)\r\nsys.stdout = IOWrapper(sys.stdout)\r\nmod = int(1e9 + 7) #998244353\r\ninf = int(1e20)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\nMI = lambda :map(int,input().split())\r\nli = lambda :list(MI())\r\nii = lambda :int(input())\r\npy = lambda :print(\"YES\")\r\npn = lambda :print(\"NO\")\r\nascii_lowercase='abcdefghijklmnopqrstuvwxyz'\r\nDIRS = [(0, 1), (1, 0), (0, -1), (-1, 0)] # 右下左上\r\nDIRS8 = [(0, 1), (1, 1), (1, 0), (1, -1), (0, -1), (-1, -1), (-1, 0),(-1, 1)] # →↘↓↙←↖↑↗\r\n\r\n\r\n\r\ndef gcd(n1,n2):\r\n return gcd(n2,n1%n2) if n2>0 else n1 #最大公约数\r\n\r\n\r\nn=ii()\r\n\r\narr=li()\r\n\r\nrd=random.randint(10**5,10**8)\r\n\r\ncnt=defaultdict(int)\r\n\r\nst=[]\r\n\r\nfor i,a in enumerate(arr):\r\n for j in range(len(st)):\r\n st[j][0]=gcd(st[j][0],a)\r\n nst=[]\r\n for v,j in st:\r\n if len(nst)==0 or v!=nst[-1][0]:\r\n nst.append([v,j])\r\n nst.append([a,i])\r\n cnt[a^rd]+=1\r\n for j in range(len(nst)-1):\r\n v,s,e=nst[j][0],nst[j][1],nst[j+1][1]-1\r\n cnt[v^rd]+=e-s+1\r\n st=nst\r\n if len(st)>1 and st[-1][0]==st[-2][0]:\r\n st.pop()\r\n\r\n\r\nq=ii()\r\n\r\nfor _ in range(q):\r\n x=ii()\r\n print(cnt[x^rd])\r\n\r\n", "from sys import stdin\r\nimport math\r\nfrom collections import defaultdict\r\ninput = stdin.readline\r\n\r\nn = int(input())\r\narr = list(map(int, input().rstrip().split(\" \")))\r\nq = int(input())\r\n\r\nd = defaultdict(lambda : 0)\r\n\r\ncurrent = defaultdict(lambda : 0)\r\n# totalCount1 = 0\r\n# count1 = 0\r\n\r\nfor i in range(n):\r\n newCurrent = defaultdict(lambda : 0)\r\n newCurrent[arr[i]] += 1\r\n for key, value in current.items():\r\n g = math.gcd(arr[i], key)\r\n if g > 1:\r\n newCurrent[g] += value\r\n \r\n for key, value in newCurrent.items():\r\n d[key] += value\r\n \r\n current = newCurrent\r\n\r\ntotalCombi = (n * (n + 1)) // 2\r\n\r\n#print(d)\r\nd[1] = totalCombi - sum(d.values()) + arr.count(1)\r\n\r\n#print(d)\r\nfor _ in range(q):\r\n x = int(input())\r\n print(d[x])", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nfrom collections import *\r\n\r\n\r\ndef il(): # Input list\r\n return list(map(int, input().split()))\r\n\r\n\r\ndef ii(): # Input int\r\n return int(input())\r\n\r\n\r\ndef imi(): # Input multiple int\r\n return map(int, input().split())\r\n\r\n\r\ndef ist(): # Input String\r\n return input()\r\n\r\n\r\ndef gcd(a,b):\r\n if a==0: return b\r\n return gcd(b%a,a)\r\n\r\n\r\nn = ii()\r\nar = il()\r\n\r\ng=Counter()\r\nli=Counter()\r\n\r\nfor a in ar:\r\n nl=Counter()\r\n g[a]+=1\r\n nl[a]=1\r\n\r\n for x in li.keys():\r\n b=gcd(x,a)\r\n g[b]+=li[x]\r\n nl[b]+=li[x]\r\n\r\n li=nl\r\nq=ii()\r\n\r\nfor i in range(q):\r\n x=ii()\r\n print(g[x])\r\n\r\n\r\n\r\n", "import sys\nfrom collections import defaultdict\nfrom math import gcd, sqrt\n\nMAX = pow(10, 5)\n# stdin = open(\"testdata.txt\", \"r\")\nip = sys.stdin\n\nn = int(ip.readline())\n\na = list(map(int, ip.readline().split()))\ngcd_count = defaultdict(int)\n\nmain_gcd = defaultdict(int)\n\nmain_gcd[a[0]] = 1\ngcd_count[a[0]] = 1\nfor i in range(1, n):\n\tele = a[i]\n\ttemp_gcd = defaultdict(int)\n\ttemp_gcd[ele] = 1\n\tgcd_count[ele] += 1\n\tfor k, v in main_gcd.items():\n\t\ttemp = gcd(ele, k)\n\t\ttemp_gcd[temp] += v\n\t\tgcd_count[temp] += v\n\tmain_gcd = temp_gcd\n\nq = int(ip.readline())\nfor _ in range(q):\n\tk = int(ip.readline())\n\tprint(gcd_count[k])" ]

[ "def main():\n def f(n):\n if n < 8:\n return [n, n]\n a = int((n + .5) ** 0.3333333333333333)\n r1 = f(n - a * a * a)\n r1[1] += a * a * a\n a -= 1\n r2 = f(3 * a * (a + 1))\n r2[1] += a * a * a\n if r1 < r2:\n r1 = r2\n r1[0] += 1\n return r1\n\n print(*f(int(input())))\n\n\nif __name__ == '__main__':\n main()\n", "import math\r\n\r\ndef root(m):\r\n\tret = m**(1.0/3.0)\r\n\tif(math.ceil(ret)**3 == m):\r\n\t\tret = math.ceil(ret)\r\n\telse: ret = math.floor(ret)\r\n\treturn ret\r\n\r\nF = {}\r\n\r\ndef f(m):\r\n\tif(m < 0):\r\n\t\treturn [-1e5 - 10, -1e15 - 1]\r\n\tif(m <= 7):\r\n\t\treturn [m, m]\r\n\trootm = root(m)\r\n\tans1 = [0, 0]\r\n\tans2 = [0, 0]\r\n\tans1 = f(m - rootm**3)\r\n\tif(rootm != 1):\r\n\t\tans2 = f(rootm**3 - 1 - (rootm-1)**3);\r\n\t\tans2[1] += (rootm-1)**3;\r\n\t\tans2[0] += 1;\r\n\tans1[1] += rootm**3;\r\n\tans1[0] += 1;\r\n\tif(ans1[0] > ans2[0]):\r\n\t\treturn ans1\r\n\telif(ans1[0] < ans2[0]):\r\n\t\treturn ans2\r\n\telse:\r\n\t\tif(ans1[1] > ans2[1]):\r\n\t\t\treturn ans1\r\n\t\telse:\r\n\t\t\treturn ans2\r\n\r\nm = int(input())\r\nans = f(m)\r\nprint(ans[0], ans[1])\r\n\r\n", "from sys import *\r\nsetrecursionlimit(1000000)\r\n#d={}\r\ndef c(n):\r\n# t=d.get(n,(0,0))\r\n# if t!=(0,0): return t\r\n if n<8: return n,n\r\n t1=int(n**(1/3)+0.00000000001)\r\n t2=t1-1\r\n v1=c(n-t1*t1*t1)\r\n v1=v1[0]+1,v1[1]+t1*t1*t1\r\n v2=c(t1*t1*t1-1-t2*t2*t2)\r\n v2=v2[0]+1,v2[1]+t2*t2*t2\r\n if v2>v1: v1=v2\r\n# d[n]=v1\r\n return v1\r\n \r\nprint(' '.join(map(str,c(int(input())))))", "im = int(input())\r\n\r\nbest_steps = 0\r\nbest_length = 0\r\n\r\ndef rec(m, steps, substracted):\r\n global best_steps, best_length \r\n if m == 0:\r\n if steps > best_steps:\r\n best_steps = steps\r\n best_length = substracted\r\n elif steps == best_steps:\r\n best_length = max(best_length, substracted)\r\n return\r\n\r\n a = 1\r\n while (a + 1)**3 <= m:\r\n a += 1\r\n\r\n rec(m - a**3, steps + 1, substracted + a**3)\r\n\r\n if a - 1 != 0:\r\n rec(a**3-1-(a-1)**3, steps + 1, substracted + (a-1)**3)\r\n\r\nrec(im, 0, 0)\r\nprint(best_steps, best_length)", "def cube(a):\n return a ** 3\n\n\ndef steps(m):\n if m <= 7:\n return m\n x = 1\n while cube(x + 1) <= m:\n x += 1\n return 1 + steps(max(m - cube(x), cube(x) - 1 - cube(x - 1)))\n\n\nclass CodeforcesTask679BSolution:\n def __init__(self):\n self.result = ''\n self.m = 0\n\n def read_input(self):\n self.m = int(input())\n\n def process_task(self):\n sub = 0\n ste = 0\n while self.m:\n ste += 1\n x = 1\n while cube(x + 1) <= self.m:\n x += 1\n if steps(self.m) == 1 + steps(self.m - cube(x)):\n self.m -= cube(x)\n sub += cube(x)\n else:\n self.m = cube(x) - 1 - cube(x - 1)\n sub += cube(x - 1)\n self.result = \"{0} {1}\".format(ste, sub)\n\n def get_result(self):\n return self.result\n\n\nif __name__ == \"__main__\":\n Solution = CodeforcesTask679BSolution()\n Solution.read_input()\n Solution.process_task()\n print(Solution.get_result())\n", "m = int(input())\r\n\r\ndef rec(m):\r\n if m < 0:\r\n return -1, 0\r\n if m == 0:\r\n return 0, 0\r\n a = int((m + 1e-9) ** (1 / 3))\r\n u = m - a ** 3\r\n v = a ** 3 - (a - 1) ** 3 - 1\r\n x, y = rec(u)\r\n q, w = rec(v)\r\n return max((x + 1, a ** 3 + y), (q + 1, (a - 1) ** 3 + w))\r\n\r\nprint(*rec(m))", "B1 = 0\r\nB2 = 0\r\ndef solve(rem , step , sub):\r\n global B1 , B2\r\n if rem == 0 :\r\n if (step == B1): B2 = max(B2 , sub)\r\n if (step > B1):\r\n B1 = step\r\n B2 = sub\r\n return\r\n cnt = 1\r\n while((cnt+1)**3 <= rem): cnt+=1\r\n solve(rem-cnt**3,step+1 , sub + cnt**3)\r\n if(cnt>0):\r\n solve(cnt**3 - 1 - (cnt-1)**3 , step+1 , sub+ (cnt-1)**3)\r\n\r\n\r\nx = int(input())\r\nsolve(x,0,0)\r\nprint(B1,B2)\r\n", "import math\n\ndef f(m):\n if m < 8: return (m,m)\n c = math.floor(m**(1.0/3))\n if not (c**3 <= m and m < (c+1)**3):\n if ((c+1)**3 <= m and m < (c+2)**3):\n c = c+1\n elif ((c-1)**3 <= m and m < c**3):\n c = c-1\n else:\n assert False\n ans1, x1 = f(m-c**3)\n ans2, x2 = f(c**3-1-(c-1)**3)\n return max((1+ans1,x1+c**3), (1+ans2,x2+(c-1)**3))\n\nif __name__ == '__main__':\n m = int(input())\n\n print(*f(m))\n", "n, c = 0, 0\ndef dfs(now, m, t):\n\tglobal n, c\n\tif now == 0:\n\t\tif m > n:\n\t\t\tn, c = m, t\n\t\treturn\n\ti = 1\n\twhile i**3 <= now:\n\t\ti += 1\n\ti -= 1\n\tdfs(now-i**3, m+1, t+i**3)\n\tdfs(i**3-1-(i-1)**3, m+1, t+(i-1)**3)\nm = int(input())\ndfs(m, 0, 0)\nprint(n, c)\n\t\t\t\t\t \t \t \t\t\t\t \t \t\t\t\t \t", "def rec(m):\r\n if m <= 0:\r\n return m, 0\r\n a = int((m + 1e-9) ** (1 / 3))\r\n x, y = rec(m - a ** 3)\r\n q, w = rec(a ** 3 - (a - 1) ** 3 - 1)\r\n return max((x + 1, a ** 3 + y), (q + 1, (a - 1) ** 3 + w))\r\nprint(*rec(int(input())))", "def g(m, s, n):\r\n k = int(m ** (1 / 3))\r\n if m == 0 or k == 1: return s + m, n + m\r\n x, y = k ** 3, (k - 1) ** 3\r\n a = g(m - x, s + x, n + 1)\r\n b = g(x - y - 1, s + y, n + 1)\r\n return b if a[1] < b[1] else a\r\ns, n = g(int(input()), 0, 0)\r\nprint(n, s)", "def f(m, cnt, y):\r\n if m == 0: return cnt, y\r\n a = int(m ** (1/3))\r\n k1, k2 = a ** 3, (a - 1) ** 3\r\n return max(f(m - k1, cnt + 1, y + k1), f(k1 - k2 - 1, cnt + 1, y + k2))\r\n\r\nprint(*f(int(input()), 0, 0))\r\n" ]

[ "from collections import defaultdict\n\n\nif __name__ == '__main__':\n n, T = [int(_) for _ in input().split()]\n data = defaultdict(list)\n for i in range(n):\n t, q = [int(_) for _ in input().split()]\n data[T - t].append(q)\n\n prev_level = []\n for level_id in range(1, T + 1):\n level = sorted(data[T - level_id] + prev_level, reverse=True) \n if T - level_id <= 10:\n max_size = 2 ** (T - level_id)\n level = level[:max_size]\n if len(level) % 2 == 1:\n level.append(0)\n prev_level = [\n level[i] + level[i + 1]\n for i in range(0, len(level), 2)\n ]\n print(prev_level[0])\n", "# nikitagoder (md: bobwish)\r\n\r\nfrom typing import List\r\nimport sys\r\n\r\nN = 1 << 10\r\ng = [[] for _ in range(N)]\r\n\r\n\r\ndef main():\r\n n, t = map(int, input().split())\r\n\r\n for _ in range(n):\r\n x, y = map(int, input().split())\r\n g[x].append(y)\r\n\r\n for i in range(1, t+1):\r\n g[i].sort(reverse=True)\r\n\r\n for j in range(0, len(g[i]), 2):\r\n if j == len(g[i]) - 1:\r\n g[i + 1].append(g[i][j])\r\n else:\r\n g[i + 1].append(g[i][j] + g[i][j + 1])\r\n\r\n print(g[t][0])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()" ]

[ "n = int(input())\r\n# n, m = map(int, input().split())\r\narr = sorted(list(map(int, input().split())))\r\narr2 = sorted(list(map(int, input().split())))\r\narr3 = sorted(list(map(int, input().split())))\r\n\r\nfor i in range(n):\r\n if i == n-1:\r\n print(arr[i])\r\n break\r\n\r\n if arr[i] != arr2[i]:\r\n print(arr[i])\r\n break\r\n\r\nfor i in range(n-1):\r\n if i == n - 2:\r\n print(arr2[i])\r\n break\r\n\r\n if arr2[i] != arr3[i]:\r\n print(arr2[i])\r\n break", "import sys\r\ninput=lambda:sys.stdin.readline().strip()\r\nmapin=lambda:map(int,input().split())\r\nn=int(input())\r\na=list(mapin())\r\nb=list(mapin())\r\nc=list(mapin())\r\nx=0\r\nfor i in a:x^=i\r\nfor i in b:x^=i\r\nprint(x)\r\nx=0\r\nfor i in b:x^=i\r\nfor i in c:x^=i\r\nprint(x)", "from sys import stdin\r\ndef input(): return stdin.readline()[:-1]\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nl=a+b\r\nans=l[0]\r\nfor i in range(1,2*n-1):\r\n\tans^=l[i]\r\nprint(ans)\r\nl=b+c\r\nans=l[0]\r\nfor i in range(1,2*n-3):\r\n\tans^=l[i]\r\nprint(ans)", "n = int(input())\nt1 = 0\nfor i in range(3):\n s = str(input()).split()\n t = 0\n for a in s:\n t += int(a)\n if i!=0:\n print(t1 - t)\n t1 = t\n \t\t \t\t \t \t\t \t\t \t\t \t\t\t\t", "\"\"\"\nhttps://codeforces.com/problemset/problem/519/B\n\"\"\"\n_ = input()\na = sorted([int(x) for x in input().split()])\nb = sorted([int(x) for x in input().split()]) + [-1]\nc = sorted([int(x) for x in input().split()]) + [-1, -1]\n\nfor i, z in enumerate(b):\n if z != a[i]:\n print(a[i])\n break\n\nfor i, z in enumerate(c):\n if z != b[i]:\n print(b[i])\n break\n", "from copy import deepcopy\nn = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\nbase = 0\n\nfor a_i in a:\n\tbase = base ^ a_i\n\ndummy = deepcopy(base)\n\nfor b_i in b:\n\tdummy = dummy ^ b_i\n\nprint(dummy)\nbase = 0\n\nfor b_i in b:\n\tbase = base ^ b_i\ndummy = deepcopy(base)\n\nfor c_i in c:\n\tdummy = dummy ^ c_i\n\nprint(dummy)\n", "n = int(input())\r\nans = []\r\nbase = sum(list(map(int, input().split())))\r\nfor _ in range(2):\r\n new = sum(list(map(int, input().split())))\r\n ans.append(base - new)\r\n base = new\r\n\r\nfor answer in ans:\r\n print(answer)\r\n", "n = int(input())\r\nA = [int(x) for x in input().split()]\r\nB = [int(x) for x in input().split()]\r\nC = [int(x) for x in input().split()]\r\nprint(sum(A)-sum(B))\r\nprint(sum(B)-sum(C))", "from collections import Counter\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\nf,f1,f2=Counter(arr),Counter(arr1),Counter(arr2)\r\nfor k in f.keys():\r\n if f[k]!=f1[k]:\r\n print(k)\r\n break\r\nfor k in f1.keys():\r\n if f1[k]!=f2[k]:\r\n print(k)\r\n break", "n=int(input())\r\na=[int(i) for i in input().split()]\r\nb=[int(i) for i in input().split()]\r\nc=[int(i) for i in input().split()]\r\nd1={}\r\nfor z in a:\r\n if z not in d1.keys():\r\n d1[z]=1\r\n else :\r\n d1[z]+=1\r\nd2={}\r\nfor z in b:\r\n if z not in d2.keys():\r\n d2[z]=1\r\n else :\r\n d2[z]+=1\r\nfor z in a:\r\n if z not in d2.keys():\r\n print(z)\r\n break\r\n elif d1[z]!=d2[z]:\r\n print(z)\r\n break\r\nd3={}\r\nfor z in c:\r\n if z not in d3.keys():\r\n d3[z]=1\r\n else :\r\n d3[z]+=1\r\nfor z in b:\r\n if z not in d3.keys():\r\n print(z)\r\n break\r\n elif d2[z]!=d3[z]:\r\n print(z)\r\n break", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nb = sorted([int(i) for i in input().split()])\r\nc = sorted([int(i) for i in input().split()])\r\nx = a[-1]\r\ny = b[-1]\r\nfor i in range(len(b)):\r\n if a[i] != b[i]:\r\n x = a[i]\r\n break\r\nfor i in range(len(c)):\r\n if b[i] != c[i]:\r\n y = b[i]\r\n break\r\nprint(x)\r\nprint(y)", "vn=int(input())\r\ns=[sum(map(int,input().split()))for i in range(3)]\r\nprint(s[0]-s[1])\r\nprint(s[1]-s[2])\r\n", "n = int (input())\r\nerrors = list(map(int,input().strip().split()))\r\nerrors_1 = list(map(int,input().strip().split()))\r\nerrors_2 = list(map(int,input().strip().split()))\r\n\r\nSUM_errors = sum(errors)\r\nSUM_errors_1 = sum(errors_1)\r\nSUM_errors_2 = sum(errors_2)\r\nx = SUM_errors - SUM_errors_1\r\ny = SUM_errors_1 - SUM_errors_2\r\nprint(x)\r\nprint(y)", "n = int(input())\na = [int(x) for x in input().split()]\nb = [int(x) for x in input().split()]\nc = [int(x) for x in input().split()]\na.sort()\nb.sort()\nc.sort()\n\nfix = -1\nfor i in range(0, len(b)):\n if a[i] != b[i]:\n fix = a[i]\n break\nprint(fix if fix >= 0 else a[len(a) - 1])\n\nfix = -1\nfor i in range(0, len(c)):\n if b[i] != c[i]:\n fix = b[i]\n break\nprint(fix if fix >= 0 else b[len(b) - 1])\n \t\t \t \t\t \t \t\t \t\t \t\t \t \t", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\narr3 = list(map(int, input().split()))\r\nprint(sum(arr) - sum(arr2))\r\nprint(sum(arr2) - sum(arr3))", "from sys import stdin\r\n\r\nn = int(stdin.readline().strip())\r\n\r\narr1 = list(map(int, stdin.readline().strip().split()))\r\narr2 = list(map(int, stdin.readline().strip().split()))\r\narr3 = list(map(int, stdin.readline().strip().split()))\r\n\r\narr1.sort()\r\narr2.sort()\r\narr3.sort()\r\n\r\nfirst_num = -1\r\nsecond_num = -1\r\nfor i in range(n-1):\r\n if arr1[i]!=arr2[i]:\r\n first_num = arr1[i]\r\n break\r\n\r\nif first_num == -1:\r\n first_num = arr1[n-1]\r\n\r\nfor i in range(n-2):\r\n if arr2[i]!=arr3[i]:\r\n second_num = arr2[i]\r\n break\r\n\r\nif second_num == -1:\r\n second_num = arr2[n-2]\r\n\r\nprint(first_num)\r\nprint(second_num)\r\n", "n = int(input())\nerrors_1 = [int(a) for a in input().split()]\nerrors_2 = [int(a) for a in input().split()]\nerrors_3 = [int(a) for a in input().split()]\n\nmap_2 = {}\nfor a in errors_2:\n if map_2.get(a):\n map_2[a] += 1\n else:\n map_2[a] = 1\n\nmap_3 = {}\nfor a in errors_3:\n if map_3.get(a):\n map_3[a] += 1\n else:\n map_3[a] = 1\n\nfor a in errors_1:\n if map_2.get(a, 0) != 0:\n map_2[a] -= 1\n else:\n print(a)\n\nfor a in errors_2:\n if map_3.get(a, 0) != 0:\n map_3[a] -= 1\n else:\n print(a)\n\n\t \t \t\t \t \t \t \t\t \t \t \t", "n = int(input())\n\nbugs1 = input().split()\nbugs1 = list(map(int, bugs1))\n\nbugs2 = input().split()\nbugs2 = list(map(int, bugs2))\n\nbugs3 = input().split()\nbugs3 = list(map(int, bugs3))\n\nfreq_1 = {}\nans1 = 0\nans2 = 0\n\nfor i in range(n):\n\tif bugs1[i] in freq_1:\n\t\tfreq_1[bugs1[i]] += 1\n\telse:\n\t\tfreq_1[bugs1[i]] = 1\n\nfor i in range(n-1):\n\tfreq_1[bugs2[i]] -= 1\n\t\nfor k,v in freq_1.items():\n\tif v == 1:\n\t\tans1 = k\n\nfreq_2 = {}\n\nfor i in range(n-1):\n\tif bugs2[i] in freq_2:\n\t\tfreq_2[bugs2[i]] += 1\n\telse:\n\t\tfreq_2[bugs2[i]] = 1\n\nfor i in range(n-2):\n\tfreq_2[bugs3[i]] -= 1\n\t\nfor k,v in freq_2.items():\n\tif v == 1:\n\t\tans2 = k\n\t\t\nprint(ans1)\nprint(ans2)\n\n\t\t\t \t \t \t \t \t \t\t \t\t\t \t", "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 = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\n\r\nans = -1\r\nfor i in range(len(b)):\r\n if b[i] != a[i]:\r\n ans = a[i]\r\n break\r\n\r\nif ans == -1: ans = a[-1]\r\nprint(ans)\r\n\r\nans = -1\r\nfor i in range(len(c)):\r\n if c[i] != b[i]:\r\n ans = b[i]\r\n break\r\n\r\nif ans == -1: ans = b[-1]\r\nprint(ans)", "from collections import Counter\n_ = input()\nfirst = Counter(input().split())\nsecond = Counter(input().split())\nthird = Counter(input().split())\n\nprint(next((first-second).elements()))\nprint(next((second-third).elements()))\n", "from collections import Counter\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nprint(*list((Counter(a) - Counter(b)).elements()))\r\nprint(*list((Counter(b) - Counter(c)).elements()))\r\n", "def process_input():\r\n nums = input().split(' ')\r\n i = [int(i) for i in nums]\r\n return sorted(i)\r\n\r\ndef errors(s1, s2):\r\n for i, num1 in enumerate(s1[0:-1]):\r\n if s2[i] != num1:\r\n return num1\r\n\r\n return s1[-1]\r\n\r\n\r\n_ = input()\r\ns1 = process_input()\r\ns2 = process_input()\r\ns3 = process_input()\r\nprint(errors(s1, s2))\r\nprint(errors(s2, s3))", "ii = lambda: int(input())\nmiis = lambda: map(int, input().split())\nlmiis = lambda: list(miis())\ntmiis = lambda: tuple(miis())\nsmiis = lambda: set(miis())\n\nn = ii()\na, b, c = [sum(lmiis()) for _ in range(3)]\nprint(a-b)\nprint(b-c)", "n = int(input())\r\nori = [int(i) for i in input().split()]\r\nfir = [int(i) for i in input().split()]\r\nsec = [int(i) for i in input().split()]\r\nprint(sum(ori)-sum(fir))\r\nprint(sum(fir)-sum(sec))\r\n", "\r\nnum_errors = int(input())\r\nerrors1 = sum(map(int, input().split()))\r\nerrors2 = sum(map(int, input().split()))\r\nerrors3 = sum(map(int, input().split()))\r\n\r\nprint(errors1 - errors2)\r\nprint(errors2 - errors3)\r\n", "from collections import Counter\r\nn = int(input())\r\na1, a2, a3 = [int(_) for _ in input().split()], [int(_) for _ in input().split()], [int(_) for _ in input().split()]\r\n\r\nprint(*list((Counter(a1) - Counter(a2)).elements()))\r\nprint(*list((Counter(a2) - Counter(a3)).elements()))", "from collections import Counter\r\n\r\ndef solve(one, two):\r\n c1 = Counter(one)\r\n c2 = Counter(two)\r\n return next(k for k, v in c1.items() if k not in c2 or c2[k] < v)\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nprint(solve(a, b))\r\nprint(solve(b, c))", "a = int(input())\r\nq1 = sum(list(map(int, input().split())))\r\nq2 = sum(list(map(int, input().split())))\r\nq3 = sum(list(map(int, input().split())))\r\nprint(q1-q2)\r\nprint(q2-q3)\r\n", "n = int(input())\r\na = sorted(list(map(int,input().split())))\r\nb = sorted(list(map(int,input().split())))\r\nc = sorted(list(map(int,input().split())))\r\n\r\nalarm = False\r\nfor i in range(n-1):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n alarm = True\r\n break\r\nif not alarm:\r\n print(a[-1])\r\n\r\nalarm = False\r\nfor i in range(n-2):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n alarm = True\r\n break\r\nif not alarm:\r\n print(b[-1])\r\n", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nb1=sum(b)\r\nc1=sum(c)\r\nd1=sum(d)\r\nprint(b1-c1)\r\nprint(c1-d1)", "from collections import Counter\r\n\r\nn=int(input())\r\nlis1=list(map(int,input().split()))\r\nlis2=list(map(int,input().split()))\r\nlis3=list(map(int,input().split()))\r\nc1=Counter(lis1);c2=Counter(lis2);c3=Counter(lis3)\r\nfor i in c1:\r\n if c1[i]>c2[i]:\r\n print(i)\r\n break\r\nfor i in c2:\r\n if c2[i]>c3[i]:\r\n print(i)\r\n break", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())))\r\nc = sorted(list(map(int, input().split())))\r\ni = 0\r\nwhile i < n-1 and a[i] == b[i]: i += 1\r\nprint(a[i])\r\ni = 0\r\nwhile i < n-2 and b[i] == c[i]: i += 1\r\nprint(b[i])", "\r\nfrom collections import Counter\r\nn=int(input())\r\nnums=list(map(int,input().split(\" \")))\r\ncount_t=Counter(nums)\r\n\r\nnums1=list(map(int,input().split(\" \")))\r\nd1=Counter(nums1)\r\nfor i in count_t.keys():\r\n if count_t[i]!=d1[i]:\r\n print(i)\r\n count_t[i]=d1[i]\r\n\r\nnums2=list(map(int,input().split(\" \")))\r\nd2=Counter(nums2)\r\n\r\nfor i in count_t.keys():\r\n if count_t[i]!=d2[i]:\r\n print(i)\r\n count_t[i]=d2[i]\r\n\r\n\r\n\r\n\r\n\r\n", "# t = int(input())\nt = 1\n\n\n\ndef cp():\n n = int(input())\n x = list(map(int,input().split()))\n y = list(map(int,input().split()))\n z = list(map(int,input().split()))\n x.sort()\n y.sort()\n z.sort()\n first_error = 0\n second_error = 0\n for i in range(n-1):\n if x[i] != y[i]:\n first_error = x[i]\n break\n if first_error == 0:\n first_error = x[-1]\n\n for i in range(n-2):\n if y[i] != z[i]:\n second_error = y[i]\n break\n if second_error == 0:\n second_error = y[-1]\n\n print(first_error)\n print(second_error)\n\n \n\n\nfor i in range(t):\n cp()\n", "n = int(input())\r\na = sum(list(map(int, input().split(' '))))\r\nb = sum(list(map(int, input().split(' '))))\r\nc = sum(list(map(int, input().split(' '))))\r\nprint(a-b)\r\nprint(b-c)", "length = int(input())\r\nnumbers_1 = tuple(sorted((int(i) for i in input().split())))\r\nnumbers_2 = tuple(sorted((int(i) for i in input().split())))\r\nnumbers_3 = tuple(sorted((int(i) for i in input().split())))\r\n\r\ni = 0\r\n\r\nwhile i < length - 1 and numbers_1[i] == numbers_2[i]:\r\n i += 1\r\n \r\nif i == length - 1:\r\n print(numbers_1[-1])\r\nelse:\r\n print(numbers_1[i])\r\n \r\ni = 0\r\n\r\nwhile i < length - 2 and numbers_2[i] == numbers_3[i]:\r\n i += 1\r\n \r\nif i == length - 2:\r\n print(numbers_2[-1])\r\nelse:\r\n print(numbers_2[i]) ", "n = int(input())\n\nerrors = [\n [x for x in input().split(' ')],\n [x for x in input().split(' ')],\n [x for x in input().split(' ')]\n]\n\nfor e in errors:\n e.sort()\n\nsolved = []\n\nfor i in range(2):\n\n j = i+1\n k = 0\n\n while k < len(errors[i]):\n\n if (k == len(errors[i])-1 or\n errors[i][k] != errors[j][k]):\n\n solved.append(errors[i][k])\n break\n\n k += 1\n\nfor e in solved: print(e)\n\t\t\t\t\t\t \t \t \t\t \t \t \t\t\t\t \t", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\n'''\r\nprint(a)\r\nprint(b)\r\nprint(c)\r\n'''\r\nd1 = dict()\r\nd2 = dict()\r\nd3 = dict()\r\n\r\nfor i in range(len(a)):\r\n if a[i] not in d1:\r\n d1[a[i]] = 1\r\n else:\r\n d1[a[i]] += 1\r\n \r\nfor i in range(len(b)):\r\n if b[i] not in d2:\r\n d2[b[i]] = 1\r\n else:\r\n d2[b[i]] += 1\r\n\r\nfor i in range(len(c)):\r\n if c[i] not in d3:\r\n d3[c[i]] = 1\r\n else:\r\n d3[c[i]] += 1\r\n'''\r\nprint(d1)\r\nprint(d2)\r\nprint(d3)\r\n'''\r\nx1 = list(d1.items())\r\nx2 = list(d2.items())\r\nx3 = list(d3.items())\r\n'''\r\nprint(x1)\r\nprint(x2)\r\nprint(x3)\r\n\r\n'''\r\nh = 0\r\n\r\nfor i in range(len(x2)):\r\n if x1[i][0] != x2[i][0]:\r\n print(x1[i][0])\r\n h = 1\r\n break\r\n else:\r\n if x1[i][1] != x2[i][1]:\r\n print(x1[i][0])\r\n h = 1\r\n break\r\n\r\nif h == 0:\r\n print(x1[-1][0])\r\n\r\nh = 0\r\n\r\nfor i in range(len(x3)):\r\n if x2[i][0] != x3[i][0]:\r\n print(x2[i][0])\r\n h = 1\r\n break\r\n else:\r\n if x2[i][1] != x3[i][1]:\r\n print(x2[i][0])\r\n h = 1\r\n break\r\n #print(x2, x2[i][0], i)\r\n #print(x3, x3[i][0])\r\n #print()\r\n\r\nif h == 0:\r\n print(x2[-1][0])\r\n", "import sys\r\nfrom collections import Counter\r\ndef input(): return sys.stdin.readline().rstrip('\\n')\r\n\r\ndef solve(n):\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n\r\n A = Counter(a)\r\n for ele in b:\r\n A[ele] -= 1\r\n\r\n for k, v in A.items():\r\n if v > 0:\r\n print(k)\r\n B = Counter(b)\r\n for ele in c:\r\n B[ele] -= 1\r\n\r\n for k, v in B.items():\r\n if v > 0:\r\n print(k)\r\n\r\n\r\nsolve(int(input()))", "n = int(input())\r\nerrors1 = list(map(int, input().split()))\r\nerrors2 = list(map(int, input().split()))\r\nerrors3 = list(map(int, input().split()))\r\n\r\nSumError1 = sum(errors1)\r\nSumError2 = sum(errors2)\r\nSumError3 = sum(errors3)\r\n\r\nMissingError1 = SumError1 - SumError2\r\nMissingError2 = SumError2 - SumError3\r\n\r\nprint(MissingError1)\r\nprint(MissingError2)\r\n", "n = int(input())\r\narr1 = [int(x) for x in input().split()]\r\narr2 = [int(x) for x in input().split()]\r\narr3 = [int(x) for x in input().split()]\r\nprint(sum(arr1) - sum(arr2))\r\nprint(sum(arr2) - sum(arr3))", "input()\nline1=input().split(\" \")\nline2=input().split(\" \")\nline3=input().split(\" \")\ntot1=0\ntot2=0\ntot3=0\nfor x in line1:\n tot1+=int(x)\nfor x in line2:\n tot2+=int(x)\nfor x in line3:\n tot3+=int(x)\nprint(tot1-tot2)\nprint(tot2-tot3)\n\t \t\t\t \t\t \t \t \t \t \t\t \t\t\t\t", "n = int(input())\r\n\r\ne1 = [int(e) for e in input().split()]\r\ne2 = [int(e) for e in input().split()]\r\ne3 = [int(e) for e in input().split()]\r\n\r\nprimeiro = sum(e1)\r\nsegundo = sum(e2)\r\nterceiro = sum(e3)\r\n\r\nprint(abs(segundo - primeiro))\r\nprint(abs(terceiro - segundo))\r\n", "n = int(input())\r\nn1 = list(map(int, input().split()))\r\nn2 = list(map(int, input().split()))\r\nn3 = list(map(int, input().split()))\r\nprint(sum(n1) - sum(n2), sum(n2) - sum(n3))\r\n", "n = int(input())\nl = list(map(int, input().split()))\nl1 = list(map(int, input().split()))\nl2 = list(map(int, input().split()))\n\nprint(sum(l) - sum(l1))\nprint(sum(l1) - sum(l2))\n \t\t\t \t\t\t\t \t\t \t \t \t\t \t\t", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nfor i in range(n):\r\n if i==n-1 or a[i]!=b[i]:\r\n print(a[i])\r\n break\r\nfor i in range(n-1):\r\n if i==n-2 or b[i]!=c[i]:\r\n print(b[i])\r\n break", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split()))) + [-1]\r\nc = sorted(list(map(int, input().split()))) + [-1, -1]\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n break\r\nfor i in range(n):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n break", "import math\ndef main(args):\n\tn = int(input())\n\te1 = input().split(' ')\n\te2 = input().split(' ')\n\te3 = input().split(' ')\n\tfor i in range(n):\n\t\te1[i] = int(e1[i])\n\tfor i in range(n-1):\n\t\te2[i] = int(e2[i])\n\tfor i in range(n-2):\n\t\te3[i] = int(e3[i])\n\tdef vals(e):\n\t\tv = {}\n\t\tfor i in e:\n\t\t\tif(i not in v):\n\t\t\t\tv[i] = 1\n\t\t\telse:\n\t\t\t\tv[i] += 1\n\t\treturn v\n\tv1 = vals(e1)\n\tv2 = vals(e2)\n\tv3 = vals(e3)\n\t\n\tans = []\n\tfor i in v1:\n\t\tif(i not in v2):\n\t\t\tans.append(i)\n\t\telif(v1[i]-v2[i]!=0):\n\t\t\tans.append(i)\n\tfor i in v2:\n\t\tif(i not in v3):\n\t\t\tans.append(i)\n\t\telif(v2[i]-v3[i]!=0):\n\t\t\tans.append(i)\n\n\tfor i in ans:\n\t\tprint(i)\n\n\t\nif __name__ == '__main__':\n import sys\n sys.exit(main(sys.argv))\n \n\n", "n = int(input())\r\nnumList = list(map(int, input().split()))\r\nerror1 = list(map(int, input().split()))\r\nerror2 = list(map(int, input().split()))\r\nnumListSum = sum(numList)\r\nerror1Sum = sum(error1)\r\nerror2Sum = sum(error2)\r\nprint(numListSum - error1Sum)\r\nprint(error1Sum - error2Sum)", "n = int(input())\r\nFirst, Second, Third = [], [], []\r\nfor i in input().split():\r\n First += [int(i)]\r\nfor i in input().split():\r\n Second += [int(i)]\r\nfor i in input().split():\r\n Third += [int(i)]\r\n\r\nFirst.sort()\r\nSecond.sort()\r\nThird.sort()\r\n\r\nfor i in range(len(Second)):\r\n if First[i]!=Second[i]:\r\n print(First[i])\r\n break\r\nelse: print(First[len(First)-1])\r\n\r\nfor i in range(len(Third)):\r\n if Second[i]!=Third[i]:\r\n print(Second[i])\r\n break\r\nelse: print(Second[len(Second)-1])\r\n", "n = int(input())\r\na1 = list(map(int,input().split()))\r\na2 = list(map(int,input().split()))\r\na3 = list(map(int,input().split()))\r\ns1 = sum(a1)\r\ns2 = sum(a2)\r\ns3 = sum(a3)\r\nprint(s1-s2)\r\nprint(s2-s3)", "n = int(input())\r\nmas1 = list(map(int, input().split()))\r\nmas2 = list(map(int, input().split()))\r\nmas3 = list(map(int, input().split()))\r\n\r\nprint(sum(mas1) - sum(mas2))\r\nprint(sum(mas2) - sum(mas3))", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\n\r\narr.sort()\r\narr1.sort()\r\narr2.sort()\r\n\r\nfor i in range(len(arr1)):\r\n if arr[i] != arr1[i]:\r\n print(arr[i])\r\n break\r\n elif i == len(arr1) - 1:\r\n print(arr[i+1])\r\n\r\nfor i in range(len(arr2)):\r\n if arr2[i] != arr1[i]:\r\n print(arr1[i])\r\n break\r\n elif i == len(arr2) - 1:\r\n print(arr1[i+1])", "n=int(input())\r\narray1=list(map(int, input().rstrip().split()))\r\narray1.sort()\r\narray2=list(map(int, input().rstrip().split()))\r\narray2.sort()\r\narray2.append(array2[0]-1)\r\narray3=list(map(int, input().rstrip().split()))\r\narray3.sort()\r\narray3.append(array3[0]-1)\r\nfor i in range(n):\r\n if array2[i]!=array1[i]:\r\n print(array1[i])\r\n break\r\nfor i in range(n-1):\r\n if array2[i]!=array3[i]:\r\n print(array2[i])\r\n break", "a = int(input())\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nd = list(map(int,input().split()))\r\nb = sum(b)\r\nc = sum(c)\r\nd = sum(d)\r\nprint(b-c)\r\nprint(c-d)", "from sys import stdin, setrecursionlimit\r\nfrom collections import Counter\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n mas_a = Counter([int(s) for s in stdin.readline().split()])\r\n mas_b = Counter([int(s) for s in stdin.readline().split()])\r\n mas_c = Counter([int(s) for s in stdin.readline().split()])\r\n\r\n print([k for k, v in (mas_a-mas_b).items()][0])\r\n print([k for k, v in (mas_b-mas_c).items()][0])\r\n\r\n\r\nif __name__ == '__main__':\r\n solve()", "from collections import Counter\n\nif __name__ == \"__main__\":\n\n # we don't need to know the initial length in Python\n _ = input()\n \n errors_a = Counter(input().split())\n errors_b = Counter(input().split())\n errors_c = Counter(input().split())\n\n after_b = errors_a - errors_b\n assert len(after_b) == 1\n print(\"\".join(after_b.keys()))\n\n after_c = errors_b - errors_c\n assert len(after_c) == 1\n print(\"\".join(after_c.keys()))\n", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nlst.sort()\r\nfor i in range(2):\r\n new_lst = [int(i) for i in input().split()]\r\n new_lst.sort()\r\n #print(new_lst)\r\n #print(lst)\r\n fl = True\r\n for i in range(len(new_lst)):\r\n if new_lst[i] != lst[i]:\r\n print(lst[i])\r\n fl = False\r\n break\r\n if fl:\r\n print(lst[-1])\r\n lst = new_lst.copy()", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nb=sorted(list(map(int,input().split())))\r\nb.append(0)\r\nc=sorted(list(map(int,input().split())))\r\nfor x in range(n):\r\n if a[x]!=b[x]:\r\n print(a[x])\r\n break\r\nb.pop(n-1)\r\nc.append(0)\r\nfor x in range(n-1):\r\n if b[x]!=c[x]:\r\n print(b[x])\r\n break", "import sys\r\ntests, errors, i = 0, [], 0\r\n\r\nfor line in sys.stdin:\r\n numbers = [int(x) for x in line.strip().split()]\r\n if i == 0:\r\n tests, i = numbers[0], 1\r\n errors = [[0]*tests]*3\r\n continue\r\n errors[i-1] = sorted(numbers)\r\n i+=1\r\n\r\n\r\ntemp = errors[0]\r\nfor ls in errors[1:]:\r\n found = False\r\n for index, value in enumerate(ls):\r\n if temp[index] != value:\r\n print(temp[index])\r\n found = True\r\n break\r\n \r\n if not found:\r\n print(temp[-1])\r\n temp = ls\r\n", "from collections import Counter\r\nx = int(input())\r\na = Counter(map(int,input().split()))\r\nb = Counter(map(int,input().split()))\r\nc = Counter(map(int,input().split()))\r\nd = a - b\r\ne = a - c - d\r\nprint(list(d.elements())[0])\r\nprint(list(e.elements())[0])", "input()\n\nsoma_erros_1 = 0\nfor erro in list(map(int, input().split())):\n soma_erros_1 += erro\n\nsoma_erros_2 = 0\nfor erro in list(map(int, input().split())):\n soma_erros_2 += erro\n\nsoma_erros_3 = 0\nfor erro in list(map(int, input().split())):\n soma_erros_3 += erro\n\nerro_solucionado_1 = soma_erros_1 - soma_erros_2\nerro_solucionado_2 = soma_erros_2 - soma_erros_3\n\nprint(erro_solucionado_1)\nprint(erro_solucionado_2)\n\n\t\t \t\t\t \t\t \t\t \t \t \t\t", "n=int(input())\nf=list(map(int,input().split()))\ns=list(map(int,input().split()))\nt=list(map(int,input().split()))\nprint(sum(f)-sum(s))\nprint(sum(s)-sum(t))\n", "p=int(input())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=list(map(int, input().split()))\r\nprint(abs(sum(b)-sum(a)))\r\nprint(abs(sum(c)-sum(b)))", "inp = lambda: sum(map(int, input().split()))\r\ninput()\r\nk, l, m = inp(), inp(), inp()\r\nprint(f\"{k-l}\\n{l-m}\")", "from collections import Counter\r\nn = int(input())\r\norg = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\n\r\norg = Counter(org)\r\no1 = list(org.keys())\r\na = Counter(a)\r\na1 =list(a.keys()) \r\nb = Counter(b)\r\nfor i in range(len(org)):\r\n if a.get(o1[i],0) == 0:\r\n x1 = o1[i]\r\n break\r\n elif a[o1[i]] != org[o1[i]]:\r\n x1 = o1[i]\r\n break\r\nfor j in range(len(a1)):\r\n if b.get(a1[j],0) == 0:\r\n x2 = a1[j]\r\n break\r\n elif b[a1[j]] != a[a1[j]]:\r\n x2 = a1[j]\r\n break\r\nprint(x1)\r\nprint(x2)\r\n", "n = int(input())\r\nf = list(map(int,input().split()))\r\ns = list(map(int,input().split()))\r\nt = list(map(int,input().split()))\r\nf.sort(); s.sort(); t.sort()\r\ne1=-1; e2=-1\r\nfor i in range(len(s)):\r\n if f[i]!=s[i]:\r\n e1=f[i]\r\n break\r\nif e1==-1:\r\n e1=f[-1]\r\nfor i in range(len(t)):\r\n if t[i]!=s[i]:\r\n e2=s[i]\r\n break\r\nif e2==-1:\r\n e2=s[-1]\r\nprint(e1)\r\nprint(e2)", "n = int(input())\r\nfErr = sum(list(map(int, input().split())))\r\nsErr = sum(list(map(int, input().split())))\r\ntErr = sum(list(map(int, input().split())))\r\n\r\nprint(fErr - sErr)\r\nprint(sErr - tErr)\r\n", "n = int(input())\r\na = sorted([int(sk) for sk in input().split()])\r\n# a = a.sorted\r\nb = sorted([int(sk) for sk in input().split()])\r\n# a = a.sorted\r\nc = sorted([int(sk) for sk in input().split()])\r\n# c = .sorted\r\natrasts = False\r\nfor i in range(len(b)):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n atrasts = True\r\n break\r\nif atrasts == False:\r\n print(a[len(a)-1]) \r\natrasts = False \r\nfor i in range(len(c)):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n atrasts = True\r\n break\r\nif atrasts == False:\r\n print(b[len(b)-1]) \r\n\r\n", "\r\n\r\nfrom operator import xor\r\n\r\n\r\ndef solve():\r\n _ = int(input())\r\n xor1 = 0\r\n l = list(map(int, input().split()))\r\n for num in l:\r\n xor1 ^= num\r\n \r\n xor2 = 0\r\n l = list(map(int, input().split()))\r\n for num in l:\r\n xor1 ^= num\r\n xor2 ^= num\r\n \r\n print(xor1)\r\n l = list(map(int, input().split()))\r\n for num in l:\r\n xor2 ^= num\r\n\r\n print(xor2)\r\n\r\n\r\ndef main():\r\n solve()\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nx1=list(map(int,input().split()))\r\nx2=list(map(int,input().split()))\r\nx3=list(map(int,input().split()))\r\nx1.sort()\r\nx2.sort()\r\nx3.sort()\r\ni=0\r\nwhile i<len(x2):\r\n if x1[i]!=x2[i]:\r\n print(x1[i])\r\n break\r\n i=i+1\r\nif i==len(x2):\r\n print(x1[i])\r\ni=0\r\nwhile i<len(x3):\r\n if x2[i]!=x3[i]:\r\n print(x2[i])\r\n break\r\n i=i+1\r\n#print(i)\r\nif i==len(x3):\r\n print(x2[i])", "n = int(input())\n\ni1 = [int(e) for e in input().split()]\ni2 = [int(el) for el in input().split()]\ni3 = [int(ele) for ele in input().split()]\n\ne = [sum(i1),sum(i2),sum(i3)]\nprint(e[0] - e[1])\nprint(e[1] - e[2])\n\n\n\n\n", "def main():\r\n n = int(input())\r\n\r\n a, b, c = [sum(map(int, input().split())) for _ in range(3)]\r\n print(a-b, b-c)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "def main():\r\n n = int(input())\r\n first_errors = sum(map(int, input().split()))\r\n second_errors = sum(map(int, input().split()))\r\n third_errors = sum(map(int, input().split()))\r\n\r\n print(first_errors - second_errors, second_errors - third_errors)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "input()\n\nfirst_sum = sum(map(int, input().split()))\nsecond_sum = sum(map(int, input().split()))\nthird_sum = sum(map(int, input().split()))\n\nprint(first_sum - second_sum)\nprint(second_sum - third_sum)\n\t\t\t\t\t \t \t\t \t\t \t\t \t \t", "import math\r\nimport bisect\r\nn=int(input())\r\ns=list(map(int,input().split()))\r\ns1=list(map(int,input().split()))\r\ns2=list(map(int,input().split()))\r\nprint(-sum(s1)+sum(s))\r\nprint(-sum(s2)+sum(s1))", "def xor(l):\r\n\tret=0\r\n\tfor i in l:\r\n\t\tret^=i\r\n\treturn ret\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(x) for x in input().split()]\r\nc=[int(x) for x in input().split()]\r\nprint(xor(a)^xor(b))\r\nprint(xor(b)^xor(c))", "from collections import Counter\nn=int(input())\na1,a2,a3=Counter(list(map(int,input().split()))),Counter(list(map(int,input().split()))),Counter(list(map(int,input().split())))\na=a1-a2\nprint([i for i in a1-a2 if a[i]!=0][0])\na=a2-a3\nprint([i for i in a2-a3 if a[i]!=0][0])", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\n\r\nb1 = sum(b)\r\nc1 = sum(c)\r\nd1 = sum(d)\r\ne = b1 - c1\r\ne1 = c1 - d1\r\nprint(e)\r\nprint(e1)", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate\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\ns = input()\r\narr1 = Counter(sorted(map(int, input().split())))\r\narr2 = Counter(sorted(map(int, input().split())))\r\narr3 = Counter(sorted(map(int, input().split())))\r\n\r\nfor key, val in arr1.items():\r\n if key not in arr2 or arr1[key] != arr2[key]:\r\n print(key)\r\n break\r\nfor key, val in arr2.items():\r\n if key not in arr3 or arr2[key] != arr3[key]:\r\n print(key)\r\n break\r\n", "from collections import Counter\r\nn = int(input())\r\ne = list(map(int,input().split()))\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nprint(list((Counter(e) - Counter(a)).elements())[0])\r\nprint(list((Counter(a) - Counter(b)).elements())[0])", "n = int(input())\n\nerrors1 = list(map(int, input().split()))\nerrors1.sort()\n\n\nerrors2 = list(map(int, input().split()))\nerrors2.sort()\n\nerrors3 = list(map(int, input().split()))\nerrors3.sort()\n\nflag1 = False\nfor i in range(len(errors2)):\n if ((errors2[i] - errors1[i]) != 0):\n flag1 = True\n print(errors1[i])\n break\nif (flag1 == False):\n print(errors1[n - 1])\n\nflag2 = False\nfor i in range(len(errors3)):\n if ((errors3[i] - errors2[i]) != 0):\n flag2 = True\n print(errors2[i])\n break\n\nif (flag2 == False):\n print(errors2[n - 2])\n \t \t\t \t \t\t\t \t\t \t\t \t\t \t\t \t\t\t\t\t", "import sys\r\n\r\ndef calc_diff(list1,list2,n):\r\n #it will return list1-list2\r\n ans = list1[-1]\r\n for i in range(n):\r\n if list1[i] != list2[i]:\r\n ans= list1[i]\r\n break\r\n \r\n return ans\r\n\r\n\r\n\r\nn = int(sys.stdin.readline())\r\n\r\na = [int(elem) for elem in sys.stdin.readline().split()]\r\nb = [int(elem) for elem in sys.stdin.readline().split()]\r\nc = [int(elem) for elem in sys.stdin.readline().split()]\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\n\r\nerror_1 = calc_diff(a,b.copy(),n-1)\r\nerror_2 = calc_diff(b,c,n-2)\r\n\r\nsys.stdout.write(str(error_1)+\"\\n\"+str(error_2))\r\n\r\n", "import copy\r\n\r\ndef main():\r\n\r\n\tnum_comp_errors = int(input())\r\n\tfirst_comp_error_set = list(map(int, input().strip().split()))\r\n\tsecond_comp_error_set = list(map(int, input().strip().split()))\r\n\tthird_comp_error_set = list(map(int, input().strip().split()))\r\n\r\n\ta = sum(first_comp_error_set)\r\n\tb = sum(second_comp_error_set)\r\n\tc = sum(third_comp_error_set)\r\n\r\n\tprint(a - b)\r\n\tprint(b - c)\r\n\r\n\r\nif __name__ == '__main__':\r\n\tmain()", "input()\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nprint(sum(l)-sum(l1))\r\nprint(sum(l1)-sum(l2))", "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(a,b,c):\r\n a = sum(a);b = sum(b);c = sum(c)\r\n print(a-b)\r\n print(b-c)\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\na = int_arr()\r\nb = int_arr()\r\nc = int_arr()\r\nsolve(a,b,c)\r\n", "n = int(input())\r\n\r\na = sorted(list(map(int, input().split())))\r\n\r\nb = sorted(list(map(int, input().split())))\r\nb.append(0)\r\n\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n break\r\n\r\nc = sorted(list(map(int, input().split())))\r\nc.append(0)\r\n\r\nfor i in range(n - 1):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n break\r\n\r\n\r\n", "n = int(input())\r\nfirst_inputs = input().split()\r\nsecond_inputs = input().split()\r\nthird_inputs = input().split()\r\nsum = 0\r\nfor i in range(n):\r\n sum += int(first_inputs[i])\r\nsum1 = 0\r\nfor i in range(n-1):\r\n sum1 += int(second_inputs[i])\r\nprint(sum - sum1)\r\nsum = sum1\r\nsum1 = 0\r\nfor i in range(n-2):\r\n sum1 += int(third_inputs[i])\r\nprint(sum - sum1)", "from sys import stdin\r\nn = int(stdin.readline().strip());i = 2\r\nb = sorted(list(map(int,stdin.readline().split())))\r\nwhile i:\r\n a = sorted(list(map(int,stdin.readline().split())))\r\n a.append(\"i\")\r\n\r\n for j in range(len(b)):\r\n if b[j] !=a[j]:\r\n print(b[j])\r\n break\r\n b = a \r\n i -= 1\r\n \r\n ", "n = int(input())\r\na = sorted([int(_) for _ in input().split()])\r\nb = sorted([int(_) for _ in input().split()])\r\nc = sorted([int(_) for _ in input().split()])\r\ncm = []\r\ni = 0\r\nwhile i < len(b) and a[i] == b[i]:\r\n i += 1\r\ncm.append(a[i])\r\ni = 0\r\nwhile i < len(c) and b[i] == c[i]:\r\n i += 1\r\ncm.append(b[i])\r\nprint(f'{cm[0]}\\n{cm[1]}')\r\n", "x = int(input())\r\nls = sorted(list(map(int, input().split())))\r\nls1 = sorted(list(map(int, input().split())))\r\nls2 = sorted(list(map(int, input().split())))\r\nfor i, j in zip(ls, ls1):\r\n if i != j:\r\n print(i)\r\n break\r\nelse:\r\n print(ls[x - 1])\r\nfor i, j in zip(ls1, ls2):\r\n if i != j:\r\n print(i)\r\n break\r\nelse:\r\n print(ls1[x - 2])\r\n\r\n", "\r\nn= int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nflag=1\r\n\r\nfor i in range(n-1):\r\n if a[i]!=b[i]:\r\n print(a[i])\r\n flag=0\r\n break\r\nif flag ==1:\r\n print(a[n-1])\r\nflag=1\r\n \r\nfor i in range(n-2):\r\n \r\n if b[i]!=c[i]:\r\n print(b[i])\r\n flag=0\r\n \r\n break\r\nif flag ==1 :\r\n print(b[n-2])\r\n", "u=int(input())\r\nf=[[int(p) for p in input().split()] for i in range(3)]\r\nprint(sum(f[0])-sum(f[1]),\"\\n\"+str(sum(f[1])-sum(f[2])))", "\"\"\"\r\nfrom sys import stdin, stdout\r\nimport math\r\nfrom functools import reduce\r\nimport statistics\r\nimport numpy as np\r\nimport itertools\r\nimport sys\r\nimport decimal\r\n\"\"\"\r\n\r\nfrom collections import Counter\r\ndef prog_name():\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n aa = Counter(a)\r\n b = list(map(int, input().split()))\r\n bb = Counter(b)\r\n c = list(map(int, input().split()))\r\n cc = Counter(c)\r\n print(*(aa-bb))\r\n print(*(bb-cc))\r\nt = 1\r\nfor unique in range(t):\r\n prog_name()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl.sort()\r\nl1.sort()\r\nl2.sort()\r\nc=0\r\nfor i in range(n-1):\r\n if l[i]!=l1[i]:\r\n print(l[i])\r\n c+=1\r\n break\r\nif c==0:\r\n print(l[-1])\r\nk=0\r\nfor i in range(n-2):\r\n if l1[i]!=l2[i]:\r\n print(l1[i])\r\n k+=1\r\n break\r\nif k==0:\r\n print(l1[-1])", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl1 = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\na = sum(l)\r\nb = a - sum(l1)\r\nc = a - sum(l2) - b\r\nprint(b)\r\nprint(c)", "from collections import deque\n\nn = int(input())\n\ninitial = list(map(int, input().split(\" \")))\ns = list(map(int, input().split(\" \")))\nt = list(map(int, input().split(\" \")))\n\nsuma = 0\nsumb = 0\nsumc = 0\nts = len(s)\ntt = len(t)\nfor i in range(n):\n suma += initial[i]\n\n if (i < ts):\n sumb += s[i]\n\n if (i < tt):\n sumc += t[i]\n\nprint(suma-sumb)\nprint(sumb-sumc)\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nB = list(map(int, input().split()))\r\nC = list(map(int, input().split()))\r\n\r\nfrom collections import Counter\r\nA = Counter(A)\r\nB = Counter(B)\r\nC = Counter(C)\r\nfor a in A:\r\n if A[a] != B[a]:\r\n print(a)\r\n break\r\n\r\nfor b in B:\r\n if B[b] != C[b]:\r\n print(b)\r\n break\r\n", "n = int(input())\r\narr = list(sorted(map(int,input().split())))\r\narr1 = list(sorted(map(int,input().split())))\r\narr2 = list(sorted(map(int,input().split())))\r\nsum1 = sum(arr) - sum(arr1)\r\nsum2 = sum(arr1) - sum(arr2)\r\nprint(sum1)\r\nprint(sum2)\r\n", "times = input()\r\nnumbers = {}\r\n\r\nfor i in input().split(\" \"):\r\n if not i in numbers:\r\n numbers[i] = 1\r\n else:\r\n numbers[i] += 1\r\n\r\nfirst_fix = {}\r\n\r\nfor i in input().split(\" \"):\r\n if not i in first_fix:\r\n first_fix[i] = 1\r\n else:\r\n first_fix[i] += 1\r\n\r\nsecond_fix = {}\r\n\r\nfor i in input().split(\" \"):\r\n if not i in second_fix:\r\n second_fix[i] = 1\r\n else:\r\n second_fix[i] += 1\r\n\r\n\r\nfor k in numbers:\r\n\r\n if not k in first_fix or first_fix[k] + 1 == numbers[k]:\r\n print(k)\r\n\r\n\r\nfor k in first_fix:\r\n if not k in second_fix or second_fix[k] + 1 == first_fix[k]:\r\n print(k)", "n = int(input())\r\na = input().split()\r\na_list = []\r\nfor i in a:\r\n if len(a)==n:\r\n a_list.append(int(i))\r\nb = input().split()\r\nb_list = []\r\nfor i in b:\r\n if len(b)==n-1:\r\n b_list.append(int(i))\r\nc = input().split()\r\nc_list = []\r\nfor i in c:\r\n if len(c)==n-2:\r\n c_list.append(int(i))\r\nprint(sum(a_list)-sum(b_list))\r\nprint(sum(b_list)-sum(c_list))\r\n ", "n = input()\r\nfirst = sum([int(x) for x in input().split()])\r\nsecond = sum([int(x) for x in input().split()])\r\nthird = sum([int(x) for x in input().split()])\r\n\r\nprint(first-second,second-third)\r\n", "a = int(input())\r\nq = sum(list(map(int, input().split())))\r\nr = sum(list(map(int, input().split())))\r\nz = sum(list(map(int, input().split())))\r\nprint(q - r)\r\nprint(r - z)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nb.append(0)\r\nc.append(0)\r\nc.append(0)\r\nfor i in range(n):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n break\r\nfor i in range(n):\r\n if c[i] != b[i]:\r\n print(b[i])\r\n break", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nprint(sum(x)-sum(y))\r\nprint(sum(y)-sum(z))", "from collections import Counter\r\n\r\n\r\ndef a_and_b_compilation_errors():\r\n\r\n\r\n num_errors = int(input())\r\n\r\n errors_fixed = [] \r\n previous_errors = {}\r\n for i in range(3):\r\n counts = Counter(map(int,input().split()))\r\n \r\n if i != 0:\r\n for key,value in previous_errors.items():\r\n if counts.get(key,0) != previous_errors[key]:\r\n errors_fixed.append(key)\r\n\r\n \r\n previous_errors = counts\r\n\r\n\r\n \r\n\r\n for error_fixed in errors_fixed:\r\n print(error_fixed)\r\n\r\n\r\na_and_b_compilation_errors()\r\n", "def main():\r\n n = int(input())\r\n arr1 = sorted(map(int, input().split()))\r\n arr2 = sorted(map(int, input().split()))\r\n arr3 = sorted(map(int, input().split()))\r\n\r\n flag = False\r\n for i in range(len(arr2)):\r\n if arr1[i] != arr2[i]:\r\n print(arr1[i])\r\n flag = True\r\n break\r\n if not flag:\r\n print(arr1[-1])\r\n \r\n flag = False\r\n for i in range(len(arr3)):\r\n if arr2[i] != arr3[i]:\r\n print(arr2[i])\r\n flag = True\r\n break\r\n if not flag:\r\n print(arr2[-1])\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n=input()\r\na,b,c=[sum(map(int, input().split())) for _ in range(3)]\r\nprint(a-b,b-c)", "n = int(input())\n\nerrOne = [int(x) for x in input().split(\" \")]\nerrTwo = [int(x) for x in input().split(\" \")]\nerrThree = [int(x) for x in input().split(\" \")]\n\nsumOne = sum(errOne)\nsumTwo = sum(errTwo)\nsumThree = sum(errThree)\n \nf = sumOne - sumTwo\ns = sumTwo - sumThree\n\nprint(f)\nprint(s)\n\t\t\t \t\t\t \t\t\t \t\t \t\t \t", "n = int(input())\na = list(input().split())\nb = list(input().split())\nc = list(input().split())\naux = dict(zip([e for e in a], [0]*n))\naux2 = aux.copy()\naux3 = aux.copy()\nfor e in a:\n aux2[e] += 1\nfor e in b:\n aux[e] += 1\nfor erro, frequencia in aux.items():\n if frequencia != aux2[erro]:\n print(erro)\n break\nfor e in c:\n aux3[e] += 1\nfor erro, frequencia in aux.items():\n if frequencia != aux3[erro]:\n print(erro)\n break\n\t\t \t\t \t \t\t \t\t \t\t\t\t\t \t \t", "n = int(input())\na = sum(list(map(int, input().split())))\nb = sum(list(map(int, input().split())))\nc = sum(list(map(int, input().split())))\n\ne1 = a - b\ne2 = b - c\n\nprint(e1)\nprint(e2)\n", "def find(a,b):\n d = 0\n for i in b:\n if i != a[d]:\n return a[d]\n d += 1\n return a[-1]\n\na = int(input())\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\nd = list(map(int, input().split()))\nb.sort()\nc.sort()\nd.sort()\nprint(find(b,c),find(c,d))\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\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nsa = sum(a)\r\nsb = sum(b)\r\nsc = sum(c)\r\n\r\nprint(sa - sb)\r\nprint(sb - sc)", "tam = int(input())\nseq1 = [int(n) for n in input().split()]\nseq2 = [int(n) for n in input().split()]\nseq3 = [int(n) for n in input().split()]\n\nseq1.sort()\nseq2.sort()\nseq3.sort()\n\nres1 = res2 = ''\n\nfor i in range(tam - 2):\n if seq3[i] != seq2[i] and res2 == '':\n res2 = seq2[i]\n if seq2[i] != seq1[i] and res1 == '':\n res1 = seq1[i]\n\nif res1 == '':\n if seq2[-1] != seq1[-1]:\n res1 = seq1[-1]\n else:\n res1 = seq1[-2]\n\n\nif res2 == '':\n res2 = seq2[-1]\n\nprint(res1)\nprint(res2)\n\n\t\t\t \t \t \t \t \t\t\t\t \t\t", "n=int(input())\r\nL=[]\r\nfor _ in range(3):\r\n L.append(list(map(int,input().split())))\r\nprint(sum(L[0])-sum(L[1]))\r\nprint(sum(L[1])-sum(L[2]))\r\n\r\n", "n=int(input())\r\ns=input()\r\na=sorted([int(s) for s in s.split()])\r\ns=input()\r\nb=sorted([int(s) for s in s.split()])\r\ns=input()\r\nc=sorted([int(s) for s in s.split()])\r\nf=0\r\nfor i in range(n-1):\r\n if a[i]!=b[i]:\r\n print(a[i])\r\n f=1\r\n break\r\nif f==0:\r\n print(a[-1])\r\nf=0\r\nfor i in range(n-2):\r\n if b[i]!=c[i]:\r\n print(b[i])\r\n f=1\r\n break\r\nif f==0:\r\n print(b[-1])\r\n", "n = int(input())\r\nL = [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\nL.sort()\r\nA.sort()\r\nB.sort()\r\nflag = 0\r\nans = []\r\nfor i in range(n-1):\r\n if L[i] != A[i]:\r\n ans.append(L[i])\r\n flag = 1\r\n break\r\nif flag == 0:\r\n ans.append(L[-1])\r\nflag = 0\r\nfor i in range(n-2):\r\n if A[i] != B[i]:\r\n ans.append(A[i])\r\n flag = 1\r\n break\r\nif flag == 0:\r\n ans.append(A[-1])\r\nprint(ans[0])\r\nprint(ans[1])\r\n", "num = int(input())\r\nsuma = sum([int(thing) for thing in input().split()])\r\nsumb = sum([int(thing) for thing in input().split()])\r\nsumc = sum([int(thing) for thing in input().split()])\r\n\r\nprint(suma-sumb)\r\nprint(sumb-sumc)", "n = int(input())\r\nlst1 = list(map(int,input().split()))\r\nlst2 = list(map(int,input().split()))\r\nlst3 = list(map(int,input().split()))\r\nsum1 = 0\r\nfor i in range(n):\r\n\tsum1 += lst1[i]\r\n\r\n\r\nsum2 = 0\r\nfor i in range(n-1):\r\n\tsum2 += lst2[i]\r\n\r\n\r\nsum3 = 0\r\nfor i in range(n-2):\r\n\tsum3 += lst3[i]\r\n\r\nprint(sum1-sum2)\r\nprint(sum2-sum3)", "n = int(input())\r\nlist1 = list(map(int, input().split()))\r\nlist2 = list(map(int, input().split()))\r\nlist3 = list(map(int, input().split()))\r\n\r\nfreq_list1 = {}\r\nfreq_list2 = {}\r\nfreq_list3 = {}\r\n\r\nfor obj in list1:\r\n freq_list1[obj] = freq_list1.get(obj, 0) + 1\r\n\r\nfor obj in list2:\r\n freq_list2[obj] = freq_list2.get(obj, 0) + 1\r\n\r\nfor obj in list3:\r\n freq_list3[obj] = freq_list3.get(obj, 0) + 1\r\n\r\nmissing_first = 0\r\nfor obj in freq_list1:\r\n if obj not in freq_list2 or freq_list2[obj] < freq_list1[obj]:\r\n missing_first = obj\r\n break\r\n\r\nmissing_second = 0\r\nfor obj in freq_list2:\r\n if obj not in freq_list3 or freq_list3[obj] < freq_list2[obj]:\r\n missing_second = obj\r\n break\r\n\r\nprint(missing_first)\r\nprint(missing_second)\r\n", "from collections import Counter\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(a1) for a1 in input().split()]\r\n b = [int(a) for a in input().split()]\r\n c = [int(a) for a in input().split()]\r\n a.sort()\r\n b.sort()\r\n c.sort() \r\n ans = []\r\n for i in range(n - 1):\r\n if a[i] != b[i]:\r\n ans.append(a[i])\r\n break\r\n if len(ans) == 0:\r\n ans.append(a[n - 1])\r\n for i in range(n - 2):\r\n if b[i] != c[i]:\r\n ans.append(b[i])\r\n break\r\n if len(ans) == 1:\r\n ans.append(b[n - 2])\r\n print(*ans, sep = \"\\n\")\r\n\r\nif __name__ == \"__main__\":\r\n main()", "def sol():\r\n n = int(input())\r\n l = list(map(int,input().split()))\r\n l2 = list(map(int,input().split()))\r\n l3 = list(map(int,input().split()))\r\n l.sort()\r\n l2.sort()\r\n l3.sort()\r\n\r\n\r\n f = False\r\n for i in range(len(l)-1):\r\n if l[i] != l2[i] :\r\n print(l[i])\r\n f = True\r\n break\r\n if not f:\r\n print(l[i+1])\r\n f = False\r\n for i in range(len(l2)-1):\r\n if l2[i] != l3[i] :\r\n print(l2[i])\r\n \r\n f = True\r\n break\r\n if not f:\r\n print(l2[i+1])\r\n f = False\r\n \r\nsol()\r\n \r\n \r\n", "I=input\nI()\na,b,c=[sum(map(int,I().split())) for _ in ' '*3]\nprint(a-b,b-c)\n\t\t\t\t \t \t \t\t\t\t\t \t\t \t", "\r\ndef main_function():\r\n n = int(input())\r\n a = sorted([int(i) for i in input().split(\" \")])\r\n b = sorted([int(i) for i in input().split(\" \")])\r\n c = sorted([int(i) for i in input().split(\" \")])\r\n for i in range(len(a)):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n break\r\n elif i == len(b) - 1:\r\n print(a[-1])\r\n break\r\n for i in range(len(b)):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n break\r\n elif i == len(c) - 1:\r\n print(b[-1])\r\n break\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nmain_function()\r\n", "t = int(input())\r\na1 = list(map(int , input().split()))\r\na2 = list(map(int , input().split()))\r\na3 = list(map(int , input().split()))\r\n\r\nl2 = len(a2)\r\nl3 = len(a3)\r\nc1 = 0 \r\nc2 = 0 \r\nn1 = 0 \r\nn2 = 0\r\na1 = sorted(a1)\r\na2 = sorted(a2)\r\na3 = sorted(a3)\r\nfor el in range(l2):\r\n if(a1[el] != a2[el]):\r\n n1 = a1[el]\r\n c1 += 1\r\n break \r\n\r\nif(c1 == 0):\r\n n1 = a1[len(a1)-1]\r\n\r\n\r\nfor elem in range(l3):\r\n if(a2[elem] != a3[elem]):\r\n n2 = a2[elem]\r\n c2 += 1\r\n break \r\n\r\nif(c2 == 0):\r\n n2 = a2[len(a2)-1]\r\n\r\n\r\nprint(n1)\r\nprint(n2)", "err = int(input())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nl3 = list(map(int, input().split()))\r\n\r\nprint(sum(l1)-sum(l2))\r\nprint(sum(l2)-sum(l3))", "def main():\r\n a=int(input())\r\n all_exeptions=input().split()\r\n all_exeptions_1 = input().split()\r\n all_exeptions_2 = input().split()\r\n sum=0\r\n sum1=0\r\n sum2=0\r\n for i in range(a):\r\n sum+=int(all_exeptions[i])\r\n if i>0:\r\n sum1+=int(all_exeptions_1[i-1])\r\n if i>1:\r\n sum2+=int(all_exeptions_2[i-2])\r\n print(sum-sum1,sum1-sum2,sep='\\n')\r\nmain()\r\n", "n = int(input())\r\nc1 = sorted(input().split())\r\nc12 = list(c1)\r\nc2 = sorted(input().split())\r\nc3 = sorted(input().split())\r\nfor i in c3:\r\n if i in c1:\r\n del c1[c1.index(i)]\r\nif c12.count(c1[0]) > c2.count(c1[0]):\r\n print(c1[0])\r\n print(c1[1])\r\nelse:\r\n print(c1[1])\r\n print(c1[0])", " \r\nimport io, os, sys\r\ninput = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\nprint = lambda x: sys.stdout.write(str(x) + \"\\n\")\r\n \r\nII = lambda: int(input())\r\nMII = lambda: map(int, input().split())\r\nLMII = lambda: list(MII())\r\nSLMII = lambda: sorted(LMII())\r\n\r\nn = II()\r\na = SLMII()\r\nb = SLMII()\r\nc = SLMII()\r\n\r\nfor i in range(n-1):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n break\r\nelse:\r\n print(a[-1])\r\n \r\nfor i in range(n-2):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n break\r\nelse:\r\n print(b[-1])\r\n ", "n = int(input())\r\nri = list(map(int,input().split(' ')))\r\nr1 = list(map(int,input().split(' ')))\r\nr2 = list(map(int,input().split(' ')))\r\n\r\nri.sort()\r\nr1.sort()\r\nr2.sort()\r\n\r\ne = []\r\n\r\ni = 0\r\nwhile i < len(r1):\r\n if r1[i] != ri[i]:\r\n e.append(ri[i])\r\n break\r\n i+=1\r\n\r\nif len(e) == 0:\r\n e.append(ri[-1])\r\nd = []\r\n\r\ni = 0\r\nwhile i < len(r2):\r\n if r2[i] != r1[i]:\r\n d.append(r1[i])\r\n break\r\n i+=1\r\n\r\nif len(d) == 0:\r\n d.append(r1[-1])\r\n\r\n\r\ne.extend(d)\r\nf = []\r\n\r\nfor i in e:\r\n if i not in f:\r\n print(i)\r\n", " # ⠀⠀⠀⠀⠀⠀⠀⠀⣠⠞⠁⠀⠀⠀⠀⠀⢠⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠉⢳⣤⣤⣀⣀⠀⠀\r\n # ⣶⣶⣶⣶⣾⠟⣩⠟⠁⠀⠀⢀⠎⠀⠀⡰⠋⠀⠀⠀⠀⡴⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠹⣿⣄⠙⠿⣷\r\n # ⣿⣿⣿⠏⢉⡾⠃⠀⠀⠀⢀⠆⠀⠀⠰⠁⠀⠀⠀⠀⡜⠁⠀⠀⠀⣰⠂⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠘⢿⣧⠀⢸\r\n # ⣿⣿⠉⣰⡟⠁⠀⠀⠀⢠⠎⠀⠀⠀⠀⠀⠀⠀⠀⢰⠁⠀⠀⡰⢱⠃⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠈⢿⣧⠀\r\n # ⣿⠉⢰⡟⠀⠀⠀⠀⢀⠏⠀⠀⠀⠀⠀⠀⠀⠀⣰⡏⠀⠀⢠⢇⠇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢣⠀⠀⠀⠀⠀⠀⠀⠈⢿⣧\r\n # ⡿⢠⣿⠁⠀⠀⠀⠀⡼⠀⠀⡆⠀⠀⠀⠀⠀⡼⡣⡇⠀⠀⠘⢸⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⢧⠀⠀⠀⠀⠀⠀⠀⠈⢿ coder name:LUCIFER\r\n # ⡇⡞⠙⠀⠀⠀⠀⣸⠁⠀⢸⠀⠀⠀⠀⠀⣼⡟⠁⡇⠀⠀⠀⡇⠀⠀⠀⠀⢠⣿⠀⠀⠀⠀⠀⡆⠀⠀⠀⠀⠘⡆⠀⠀⠀⠀⠀⠀⠀⠈ LANGUAGE: Python\r\n # ⣿⠁⠀⠀⠀⠀⠀⡇⠀⠀⣸⠀⠀⠀⠀⢀⣻⠀⠀⢸⡀⠀⠀⢳⡀⠀⠀⠀⣞⢸⣆⠀⠀⠀⢸⡀⠀⢰⠀⠀⠀⢳⠀⠀⠀⠀⠁⠀⠀⠀\r\n # ⠇⠀⠀⠀⠀⠀⢸⠀⡀⠀⡟⣆⠀⠀⠀⢸⠧⠴⠆⠀⠳⡀⠀⠀⠳⡀⠀⢸⢻⠲⠼⢆⠀⠀⠀⣇⠀⢸⣆⠀⠀⠘⡆⠀⠀⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⣼⣴⡿⣔⣇⠉⠓⠦⣄⣸⠀⠀⠀⠀⠀⠻⠶⣄⣀⠙⠦⣸⡆⠀⠀⠀⠓⢤⡀⠸⡷⣄⢻⢦⡀⠀⢷⠀⠀⠀⡆⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⣿⠛⠀⠈⠉⠀⠀⠀⠀⠈⠁⠀⠀⠀⠀⠀⠀⠐⠨⠍⠉⠉⠛⠀⠀⠀⠀⠀⠉⠙⠚⠬⠟⠃⠻⡦⣼⠀⠀⣆⡇⠀⠀⠀\r\n # ⠀⡀⢰⠀⠀⢠⡇⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣀⠤⠀⠀⠀⠀⠀⠀⠀⠀⠀⠙⢿⡆⢀⢿⠁⠀⠀⠀\r\n # ⠀⠸⡄⣧⠀⢸⣃⣤⣖⣻⣿⣿⠿⣿⣿⣟⣓⣲⣭⣑⠀⠀⠀⠀⠀⠀⠀⠀⢈⡥⣶⣺⣿⣿⣿⣿⣷⠲⠦⣄⡀⠀⠀⡇⢸⡼⠀⠀⠀⠀\r\n # ⠀⠀⢱⡘⡆⢸⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠈⠉⠉⠉⠀⠈⠉⠉⠉⠉⠉⠓⠛⠓⠲⣧⡇⠃⠀⠀⠀⠀\r\n # ⠀⠀⠀⢳⡸⡄⡇⢠⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⡿⢠⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⢳⡹⣇⠈⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⢃⡇⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠱⣽⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣸⡜⠀⠀⠀⢀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠹⣧⠀⠀⠀⠀⠀⠀⠀⠀⢦⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢀⣯⠁⠀⠀⢀⠎⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠀⠻⣇⠀⠀⠀⠀⠀⠀⠀⠀⠙⠫⠍⣑⣒⣒⣒⣒⣒⣒⣒⠲⠚⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣼⠃⠀⠀⣠⠋⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠀⠀⠸⡄⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⡄⢲⠇⠀⢀⡞⠁⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠀⠀⠀⢿⣌⡒⠤⢄⡀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠤⠒⠉⣉⣵⠟⠀⡠⠋⠀⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠸⡄⠉⢹⠖⠲⣤⢭⣀⣀⣀⡀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣀⣉⣁⣠⠼⠶⡶⠛⢉⡟⡠⠊⠀⠀⠀⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⣧⠀⡸⠀⣰⡟⢠⣷⣷⠻⣿⣿⠭⠭⠽⣿⡏⠿⣫⡽⢿⣟⣧⢸⠀⢰⠃⣀⣾⠟⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⢰⠃⣰⠟⣠⣿⡿⣻⠀⠀⠙⠛⠛⠶⠒⠛⠋⠉⠀⢸⡝⢿⣮⡆⢸⢈⡞⠁⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n # ⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢸⣃⡾⣫⣾⠟⠁⠀⡟⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⢘⣿⠀⠉⠻⣶⠋⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀⠀\r\n\r\n###################################################################################################################################################<<<<<<<<<\r\n\r\n# from math import log, ceil\r\n#import math\r\nn = int(input())\r\nl1 = sorted(list(map(int, input().split())))\r\nl2 = sorted(list(map(int, input().split())))\r\nl3 = sorted(list(map(int, input().split())))\r\no, t = 0, 0\r\nfor i in range(n-1):\r\n if l1[i] != l2[i]:o = l1[i];break\r\nfor j in range(n-2):\r\n if l2[j] != l3[j]:t = l2[j];break\r\nprint(o if o != 0 else l1[n-1]);print(t if t != 0 else l2[n-2])\r\n", "n = int(input())\r\nerrors = input().split()\r\nerrors1 = input().split()\r\nerrors2 = input().split()\r\n\r\nerrors = [int(x) for x in errors]\r\nerrors1 = [int(x) for x in errors1]\r\nerrors2 = [int(x) for x in errors2]\r\n\r\nprint(sum(errors) - sum(errors1))\r\nprint(sum(errors1) - sum(errors2))\r\n", "n=int(input())\r\nda={}\r\nfor sa in input().split():\r\n a=int(sa)\r\n da[a]=da.get(a,0)+1\r\ndb={}\r\nfor sb in input().split():\r\n b=int(sb)\r\n db[b]=db.get(b,0)+1\r\ndc={}\r\nfor sc in input().split():\r\n c=int(sc)\r\n dc[c]=dc.get(c,0)+1\r\nfor c in dc:\r\n if da[c]==dc[c]:\r\n del da[c]\r\n else:\r\n da[c]-=dc[c]\r\n if db[c]==dc[c]:\r\n del db[c]\r\n else:\r\n db[c]-=dc[c]\r\nif len(da)==1:\r\n for i in da:\r\n print(i)\r\n print(i)\r\nelse:\r\n for i in da:\r\n if not i in db:\r\n print(i)\r\n for i in db:\r\n print(i)", "def intlist(x):\r\n count=0\r\n for i in range(len(x)):\r\n x[i]=int(x[i])\r\n count=count+x[i]\r\n return count\r\nn=int(input())\r\ncomp1=input().split()\r\ncomp2=input().split()\r\ncomp3=input().split()\r\nc1=intlist(comp1)\r\nc2=intlist(comp2)\r\nc3=intlist(comp3)\r\nprint(c1-c2)\r\nprint(c2-c3)\r\n", "# Abu Hurayra\r\nimport 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 + '\\n')\r\ndef wi(n): sys.stdout.write(str(n) + '\\n')\r\ndef wia(a): sys.stdout.write(' '.join([str(x) for x in a]) + '\\n')\r\n# a = list(map(int, input().split()))\r\n\r\n\r\ndef main():\r\n n = ri()\r\n a = ria()\r\n a = sorted(a)\r\n b = ria()\r\n b = sorted(b)\r\n b.append(0)\r\n c = ria()\r\n c = sorted(c)\r\n c.append([0, 0])\r\n \r\n \r\n for i in zip(a, b):\r\n if i[0] != i[1]:\r\n print(i[0])\r\n break\r\n \r\n for i in zip(b, c):\r\n if i[0] != i[1]:\r\n print(i[0])\r\n break\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "def compilador(A,B,C):\r\n result=[]\r\n sumOne=0\r\n sumTwo=0\r\n for n in A:\r\n sumOne+=n\r\n for i in B:\r\n sumTwo+=i\r\n result.append(sumOne-sumTwo)\r\n sumOne=0\r\n for j in C:\r\n sumOne+=j\r\n result.append(sumTwo-sumOne)\r\n for k in result:\r\n print(k)\r\n \r\n \r\n\r\ndef main():\r\n cases = int(input())\r\n A = [int(x) for x in input().split()]\r\n B = [int(x) for x in input().split()]\r\n C = [int(x) for x in input().split()]\r\n compilador(A,B,C)\r\nmain()\r\n", "n = int(input())\r\nnumbers = [int(num) for num in input().split(\" \", n-1)]\r\nnumbers1 = [int(num) for num in input().split(\" \", n-2)]\r\nnumbers2 = [int(num) for num in input().split(\" \", n-3)]\r\nprint(sum(numbers)-sum(numbers1))\r\nprint(sum(numbers1)-sum(numbers2))", "input()\r\na1=[int(i) for i in input().split()]\r\na2=[int(i) for i in input().split()]\r\na3=[int(i) for i in input().split()]\r\nprint(sum(a1)-sum(a2))\r\nprint(sum(a2)-sum(a3))", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=list(map(int, input().split()))\r\n\r\ndef solve(a,b):\r\n i=0\r\n j=0\r\n while i<(len(a)):\r\n while j<(len(b)):\r\n if a[i]==b[j]:\r\n i+=1\r\n j+=1\r\n if j==len(b):\r\n print(a[i])\r\n return\r\n else:\r\n print(a[i])\r\n return \r\na.sort()\r\nb.sort()\r\nc.sort()\r\nsolve(a,b)\r\nsolve(b,c)\r\n", "n = int(input())\nmap1 = {}\nmap2 = {}\nx = list(map(int, (input().split(' '))))\nfor i in range(0, n):\n if x[i] not in map1.keys():\n map1[x[i]] = 1\n else:\n map1[x[i]] += 1\n\nx = list(map(int, (input().split(' '))))\nfor i in range(0, n-1):\n if x[i] not in map2.keys():\n map2[x[i]] = 1\n else:\n map2[x[i]] += 1\n map1[x[i]] -= 1\n\nfor k in map1.keys():\n if map1[k] == 1:\n print(k)\n break\n\nx = list(map(int, (input().split(' '))))\nfor i in range(0, n-2):\n map2[x[i]] -= 1\n\nfor k in map2.keys():\n if map2[k] == 1:\n print(k)\n break\n\n \t\t \t\t \t \t \t \t \t \t \t\t\t", "def errors(a, b, c):\r\n dict_a, dict_b, dict_c = {}, {}, {}\r\n \r\n for num in a:\r\n dict_a[num] = dict_a.get(num, 0) + 1\r\n \r\n for num in b:\r\n dict_b[num] = dict_b.get(num, 0) + 1\r\n \r\n for num in c:\r\n dict_c[num] = dict_c.get(num, 0) + 1\r\n \r\n ans = []\r\n \r\n for key in dict_a:\r\n if key not in dict_b or dict_b[key] != dict_a[key]:\r\n ans.append(key)\r\n break\r\n \r\n for key in dict_b:\r\n if key not in dict_c or dict_c[key] != dict_b[key]:\r\n ans.append(key)\r\n break\r\n \r\n return ans\r\n \r\n \r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\na, b = errors(a, b, c)\r\nprint(a)\r\nprint(b)", "from functools import reduce\r\n\r\nn = int(input())\r\na = reduce(lambda acc, x: acc ^ x, map(int, input().split()), 0)\r\nb = reduce(lambda acc, x: acc ^ x, map(int, input().split()), 0)\r\nc = reduce(lambda acc, x: acc ^ x, map(int, input().split()), 0)\r\n\r\nprint(a ^ b)\r\nprint(b ^ c)", "# https://codeforces.com/problemset/problem/519/B\n\nfrom typing import *\n\n\ndef get_missing_numbers(a: List[int], b: List[int], c: List[int]) -> Tuple[int, int]:\n a.sort()\n b.sort()\n c.sort()\n\n n1, n2 = a[-1], b[-1]\n for i in range(len(b)):\n if a[i] != b[i]:\n n1 = a[i]\n break\n for i in range(len(c)):\n if b[i] != c[i]:\n n2 = b[i]\n break\n\n return n1, n2\n\n\nif __name__ == '__main__':\n n = int(input())\n a = [int(x) for x in input().split(' ')]\n b = [int(x) for x in input().split(' ')]\n c = [int(x) for x in input().split(' ')]\n n1, n2 = get_missing_numbers(a, b, c)\n print(n1)\n print(n2)", "n=int(input())\na=list(map(int,input().split()))\nb=list(map(int,input().split()))\nc=list(map(int,input().split()))\nx=0\ny=0\nz=0\nfor i in range(0,len(a)):\n x=x+a[i]\nfor j in range(0,len(b)):\n y=y+b[j]\nd=x-y\nprint(d)\nfor k in range(0,len(c)):\n z=z+c[k]\ne=y-z\nprint(e)\n\t \t \t \t\t \t\t\t \t\t \t \t\t\t \t", "amount = int(input())\r\nerrors = sum(list(map(int,input().split())))\r\nserrors = sum(list(map(int,input().split())))\r\nterrors = sum(list(map(int,input().split())))\r\nprint(errors-serrors)\r\nprint(serrors-terrors)", "n = int(input())\nx = list(map(int,input().strip().split()))[:n]\ny = list(map(int,input().strip().split()))[:n-1]\nz = list(map(int,input().strip().split()))[:n-2]\n\nsomaX = 0\nsomaY = 0\nsomaZ = 0\n\nfor i in range(len(x)):\n somaX += x[i]\n\nfor i in range(len(y)):\n somaY += y[i]\n\nfor i in range(len(z)):\n somaZ += z[i]\n\nprint(somaX-somaY)\nprint(somaY-somaZ)\n \t \t\t\t \t \t\t \t\t\t\t \t\t\t \t\t\t\t", "n = int(input())\r\ns = []\r\nfor i in range(3):\r\n l = list(map(int, input().split()))\r\n s.append(sum(l))\r\nprint(s[0] - s[1])\r\nprint(s[1] - s[2])", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\nerrors_n = list(map(int, stdin.readline().strip().split()))\r\nerrors_n_1 = list(map(int, stdin.readline().strip().split()))\r\nerrors_n_2 = list(map(int, stdin.readline().strip().split()))\r\nerrors_n.sort()\r\nerrors_n_1.sort()\r\nerrors_n_2.sort()\r\nerror_1 = \"X\"\r\nerror_2 = \"X\"\r\nfor j in range(len(errors_n)):\r\n if j<len(errors_n_1):\r\n if errors_n[j]==errors_n_1[j]:\r\n pass\r\n else:\r\n error_1 = errors_n[j];break;\r\n else:\r\n if error_1==\"X\":\r\n error_1 = errors_n[j]\r\nfor j in range(len(errors_n_1)):\r\n if j<len(errors_n_2):\r\n if errors_n_1[j]==errors_n_2[j]:\r\n pass\r\n else:\r\n error_2 = errors_n_1[j];break;\r\n else:\r\n if error_2==\"X\":\r\n error_2 = errors_n_1[j]\r\nstdout.write(f\"{error_1}\\n\")\r\nstdout.write(f\"{error_2}\\n\")", "a=int(input())\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=list(map(int,input().split()))\r\nprint(sum(b)-sum(c))\r\nprint(sum(c)-sum(d))\r\n", "n = int(input())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nfrom collections import defaultdict\n\nfreqs = defaultdict(int)\nfreqs.setdefault(0, 0)\n\nfor v in a:\n freqs[v] += 1\n\nfor v in b:\n freqs[v] -= 1\n\nfor i,freq in freqs.items():\n if freq > 0:\n print(i)\n break\n\nfreqs = defaultdict(int)\nfreqs.setdefault(0, 0)\n\nfor v in b:\n freqs[v] += 1\n\nfor v in c:\n freqs[v] -= 1\n\nfor i, freq in freqs.items():\n if freq > 0:\n print(i)\n break\n", "import sys\r\n\r\ninput = sys.stdin.buffer.readline\r\n\r\nn = int(input())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())))\r\nc = list(map(int, input().split()))\r\nans = 0\r\nfor i in range(n):\r\n try:\r\n if a[i] == b[i]:\r\n continue\r\n else:\r\n ans = a[i]\r\n break\r\n except:\r\n ans = a[i]\r\n\r\nc.append(ans)\r\nc.sort()\r\nans2 = 0\r\nfor i in range(n):\r\n try:\r\n if a[i] == c[i]:\r\n continue\r\n else:\r\n ans2 = a[i]\r\n break\r\n except:\r\n ans2 = a[i]\r\nprint(ans)\r\nprint(ans2)", "__author__ = 'shukkkur'\r\n\r\n\r\n'''\r\nhttps://codeforces.com/problemset/problem/519/B\r\nB. A and B and Compilation Errors\r\n'''\r\n\r\n\r\nn = int(input())\r\nerrors = list(map(int, input().split()))\r\noneLess = list(map(int, input().split()))\r\ntwoLess = list(map(int, input().split()))\r\n\r\nprint(sum(errors)-sum(oneLess))\r\nprint(sum(oneLess)-sum(twoLess))", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=sum(a)\r\nc=list(map(int,input().split()))\r\nd=sum(c)\r\ne=list(map(int,input().split()))\r\nf=sum(e)\r\nprint(b-d)\r\nprint(d-f)", "a=int(input())\r\nlst=list(map(int,input().strip().split()))\r\narr=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\n\r\np=sum(lst)\r\nq=sum(arr)\r\nr=sum(b)\r\n\r\nprint(p-q)\r\nprint(q-r)", "def main():\n t = 1\n\n for _ in range(t):\n solve()\n\ndef solve():\n n = int(input())\n errors = list(map(int, input().split()))\n errors.sort()\n\n errors_removed_1 = list(map(int, input().split()))\n errors_removed_1.sort()\n\n first_error = None\n\n for i in range(len(errors_removed_1)):\n if errors_removed_1[i] != errors[i]:\n first_error = errors[i]\n errors.pop(i)\n break\n\n if first_error is None:\n first_error = errors[-1]\n errors.pop()\n\n errors_removed_2 = list(map(int, input().split()))\n errors_removed_2.sort()\n\n second_error = None\n\n for i in range(len(errors_removed_2)):\n if errors_removed_2[i] != errors[i]:\n second_error = errors[i]\n break\n\n if second_error is None:\n second_error = errors[-1]\n \n print(first_error)\n print(second_error)\n\nmain()", "def count_errors(L):\n d = dict()\n\n for e in L:\n d[e] = d.get(e, 0) + 1\n\n return d\n\n\ndef solve(d1, d2):\n for k in d1:\n if k not in d2 or d1[k] > d2[k]:\n return k\n \n\ndef main():\n n = int(input())\n\n L1 = list(map(int, input().split()))\n L2 = list(map(int, input().split()))\n L3 = list(map(int, input().split()))\n\n d1 = count_errors(L1)\n d2 = count_errors(L2)\n d3 = count_errors(L3)\n \n print(solve(d1, d2))\n print(solve(d2, d3))\n\n\nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\nf1 = list(int(x) for x in input().split(' '))\nf2 = list(int(x) for x in input().split(' '))\nf3 = list(int(x) for x in input().split(' '))\n\nf1.sort()\nf2.sort()\nf3.sort()\nfound_1 = False\nfound_2 = False\nfor i in range(n - 1):\n if f1[i] != f2[i]:\n print(f1[i])\n found_1 = True\n break\n\nif not found_1:\n print(f1[-1])\n\nfor i in range(n - 2):\n if f2[i] != f3[i]:\n print(f2[i])\n found_2 = True\n break\n\nif not found_2:\n print(f2[-1])\n", "n=input()\r\na=sum([int(i) for i in input().split()])\r\nb=sum([int(i) for i in input().split()])\r\nc=sum([int(i) for i in input().split()])\r\nprint(a-b)\r\nprint(b-c)", "n = int(input())\nfirst = input().split()\nfirst = [int(first[i]) for i in range(n)]\nsecond = input().split()\nsecond = [int(second[j]) for j in range(n-1)]\nthird = input().split()\nthird = [int(third[k]) for k in range(n-2)]\n\nfirst.sort()\nsecond.sort()\nthird.sort()\n\nfor l in range(n):\n if l == n-1:\n break\n elif second[l] != first[l]:\n break\nprint(first[l])\n\nfor m in range(n-1):\n if m == n-2:\n break\n elif third[m] != second[m]:\n break\nprint(second[m])\n\n\t\t\t\t \t \t \t \t \t \t\t \t\t \t\t \t\t", "n = int(input())\r\n\r\nreq1 = input().split()\r\nreq1 = [int(x) for x in req1]\r\n\r\n\r\nreq2 = input().split()\r\nreq2 = [int(x) for x in req2]\r\n\r\n\r\nreq3 = input().split()\r\nreq3 = [int(x) for x in req3]\r\n\r\nf_num = sum(req1) - sum(req2)\r\ns_num = sum(req1) - sum(req3) - f_num\r\n\r\nprint(f_num)\r\nprint(s_num)", "_ = input()\r\nfirst = sum(map(int, input().split()))\r\nsecond = sum(map(int, input().split()))\r\nthird = sum(map(int, input().split()))\r\n\r\nprint(first - second)\r\nprint(second - third)", "n=int(input());\r\nl1=[];l2=[];l3=[];\r\nsum1=0;sum2=0;sum3=0;\r\nl1 = list(map(int, input().split()))\r\nsum1=sum(l1);\r\nl2 = list(map(int, input().split()))\r\nsum2=sum(l2);\r\nl3 = list(map(int, input().split()))\r\nsum3=sum(l3);\r\nprint(abs(sum1-sum2))\r\nprint(abs(sum2-sum3))", "def solve():\r\n \r\n n = int(input())\r\n a, b, c = [sum(map(int, input().split())) for _ in range(3)]\r\n print(a - b)\r\n print(b - c)\r\n\r\n\r\n\r\nsolve()", "input()\r\na, b, c = [sum(map(int, input().split())) for i in range(3)]\r\nprint (a - b)\r\nprint (b - c)", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Oct 20 03:47:04 2021\r\n\r\n@author: pena\r\n\"\"\"\r\nn = int(input())\r\nnums = map(int,input().split())\r\nnums = sorted(nums)\r\nnums2 = map(int,input().split())\r\nnums2 = sorted(nums2)\r\nnums3 = map(int,input().split())\r\nnums3 = sorted(nums3)\r\n\r\ni = 0\r\nans1 = -1\r\nans2 = -1\r\n\r\nwhile i < n:\r\n if i < n - 1 and nums[i] != nums2[i] and ans1 == -1:\r\n ans1 = nums[i]\r\n elif i == n-1 and ans1 == -1:\r\n ans1 = nums[i]\r\n if i < n - 2 and nums2[i] != nums3[i] and ans2 == -1:\r\n ans2 = nums2[i]\r\n elif i == n-2 and ans2 == -1:\r\n ans2 = nums2[i]\r\n if ans1 != -1 and ans2 != -1:\r\n break\r\n i += 1\r\n\r\nprint(ans1,ans2,sep='\\n')", "c=[]\r\nn=int(input())\r\nfor i in range (3):\r\n m=list(map(int,input().split(\" \")))\r\n c+=[sum(m)]\r\nprint(c[0]-c[1])\r\nprint(c[1]-c[2]) ", "x = lambda:sum(map(int,input().split()));input();a=x();b=x();c=x();print(a-b,b-c)", "n = int(input())\r\ncodes1 = dict()\r\ncodes2 = dict()\r\ncodes3 = dict()\r\nfor error in input().split():\r\n codes1[error] = codes1.get(error, 0) + 1\r\nfor error in input().split():\r\n codes2[error] = codes2.get(error, 0) + 1\r\nfor error in input().split():\r\n codes3[error] = codes3.get(error, 0) + 1\r\n\r\nfor code in codes1.keys():\r\n num1 = codes1.get(code, 0)\r\n num2 = codes2.get(code, 0)\r\n if num1 > num2:\r\n print(code)\r\n break\r\nfor code in codes2.keys():\r\n num2 = codes2.get(code, 0)\r\n num3 = codes3.get(code, 0)\r\n if num2 > num3:\r\n print(code)\r\n break\r\n", "from collections import Counter\r\n\r\ndef errors(arr, er1, er2, n):\r\n d1 = Counter(arr)\r\n d2 = Counter(er1)\r\n d3 = Counter(er2)\r\n ans = []\r\n for x in d1:\r\n if x not in d2:\r\n ans.append(x)\r\n elif d2[x] != d1[x]:\r\n ans.append(x)\r\n else:\r\n pass\r\n\r\n for x in d2:\r\n if x not in d3:\r\n ans.append(x)\r\n elif d2[x] != d3[x]:\r\n ans.append(x)\r\n else:pass\r\n return ans\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ner1 = list(map(int, input().split()))\r\ner2 = list(map(int, input().split()))\r\nans = errors(arr, er1, er2, n)\r\nprint(ans[0])\r\nprint(ans[1])", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\n\r\nprint(abs(sum(a)-sum(b)))\r\nprint(abs(sum(b)-sum(c)))\r\n", "\"\"\"\r\ndef twoarraysandswaps(n,k,a,b):\r\n a.sort()\r\n b.sort()\r\n i,j=0,n-1\r\n while k!=0:\r\n if a[i]<b[j]:\r\n a[i]=b[j]\r\n i+=1\r\n j-=1\r\n else:\r\n i+=1\r\n j-=1\r\n k-=1\r\n print(sum(a))\r\n\r\nt=int(input())\r\nwhile t:\r\n n,k=input().split()\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n twoarraysandswaps(int(n),int(k),a,b)\r\n t-=1\r\n\"\"\"\r\n\"\"\"\r\nclass square:\r\n sum=0\r\n def findlargestsquare(self,n,k):\r\n i=1\r\n if k==sum:\r\n return 0\r\n while i*i<n:\r\n i+=1\r\n rem= n - (i-1)**2\r\n sum+=(i-1)**2\r\n return findlargestsquare(rem,k) + 1\r\nn=int(input())\r\nans=0\r\n\"\"\"\r\n\"\"\"\r\ndef isprime(x):\r\n for i in range(2,x):\r\n if x%i==0:\r\n return False\r\n return True\r\ndef sumprimefactor(n):\r\n ans=0\r\n for i in range(2,n+1):\r\n if isprime(i) and n%i==0:\r\n ans+=i\r\n return round(ans,4)\r\nprint(sumprimefactor(23))\r\n\"\"\"\r\n\"\"\"\r\ndef func(a,b,n):\r\n ans=0\r\n for i in range(n):\r\n ans+=max(a[i]-min(a),b[i]-min(b))\r\n return ans\r\n\r\nt=int(input())\r\nwhile t:\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n t-=1\r\n print(func(a,b,n))\r\n\"\"\"\r\n\"\"\"\r\nimport sys\r\nt=int(input())\r\nwhile t:\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n a.sort()\r\n ans=sys.maxsize\r\n for i in range(n-1):\r\n ans=min(ans,abs(a[i]-a[i+1]))\r\n print(ans)\r\n t-=1\r\n\"\"\"\r\n\"\"\"\r\nt=int(input())\r\nans=[]\r\nif t%2==0:\r\n y=t//2\r\n print(y)\r\n ans=[2]*y\r\n print(\" \".join(map(str,ans)))\r\nelse:\r\n y=t//2\r\n print(y)\r\n ans=[2]*(y-1)+[3]\r\n print(\" \".join(map(str,ans)))\r\n\"\"\"\r\n\"\"\"\r\nt=int(input())\r\nwhile t:\r\n n=int(input())\r\n a=(1<<n)\r\n b=0\r\n for i in range(1,(n//2)):\r\n a+=(1<<i)\r\n for j in range(n//2,n):\r\n b+=(1<<j)\r\n print(abs(a - b))\r\n t-=1\r\n \"\"\"\r\n\"\"\"\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\na=b=c=0\r\nleft=0\r\nright=n-1\r\nwhile left<=right:\r\n if c%2!=0:\r\n y=max(x[left],x[right])\r\n if y==x[left]:\r\n a+=y\r\n left+=1\r\n else:\r\n a+=y\r\n right-=1\r\n else:\r\n z=max(x[left],x[right])\r\n if z==x[left]:\r\n b+=z\r\n left+=1\r\n else:\r\n b+=z\r\n right-=1\r\n c+=1\r\nprint(b,a)\r\n\"\"\"\r\n\"\"\"\r\ndef issmaller(s):\r\n d={}\r\n for i in s:\r\n if i not in d:\r\n d[i]=1\r\n else:\r\n d[i]+=1\r\n for i in d:\r\n if d[i]>1:\r\n return False\r\n return True\r\n\r\nn=int(input())\r\nwhile True:\r\n n+=1\r\n if issmaller(str(n)):\r\n print(n)\r\n break\r\n \"\"\"\r\n\"\"\"\r\nn,h=input().split()\r\nx=list(map(int,input().split()))\r\nans=0\r\nfor i in range(len(x)):\r\n if x[i]>int(h):\r\n ans+=2\r\n else:\r\n ans+=1\r\nprint(ans)\r\n\"\"\"\r\n\"\"\"\r\nn=int(input())\r\nx=[]\r\nans=0\r\nwhile n:\r\n x.append(list(map(int,input().split())))\r\n n-=1\r\nfor i in range(len(x)):\r\n if x[i][0]<=x[i][1]-2:\r\n ans+=1\r\nprint(ans)\r\n\"\"\"\r\n\"\"\"\r\ndef luckynumber(n):\r\n if len(n)<=1:\r\n return \"NO\"\r\n ans=0\r\n for ch in n:\r\n if ch=='4' or ch=='7':\r\n ans+=1\r\n if ans==4 or ans==7 :\r\n return \"YES\"\r\n else:\r\n return \"NO\"\r\n\r\nn=int(input())\r\nprint(luckynumber(str(n)))\r\n\"\"\"\r\n\"\"\"\r\ndef solve():\r\n n=int(input())\r\n x=list(map(int,input().split()))\r\n cnt1=cnt2=0\r\n for i in range(len(x)):\r\n if x[i]==1:\r\n cnt1+=1\r\n else:\r\n cnt2+=1\r\n sum=cnt1+2*cnt2\r\n if sum%2!=0:\r\n print(\"NO\")\r\n else:\r\n sum=sum//2\r\n if sum%2==0 or (sum%2==1 and cnt1!=0):\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n \"\"\"\r\n\"\"\"\r\nn=int(input())\r\nx=input()\r\ny=[0,0,0,0,0,0,0,0,0,0]\r\nans=\"\"\r\nfor i in range(len(x)):\r\n if x[i]=='L':\r\n for j in range(len(y)):\r\n if y[j]==0:\r\n y[j]=1\r\n break\r\n elif x[i]=='R':\r\n for j in range(len(y)-1,-1,-1):\r\n if y[j]==0:\r\n y[j]=1\r\n break\r\n else:\r\n a=x[i]\r\n y[int(a)]=0\r\nprint(*y,sep='')\r\n\"\"\"\r\n\"\"\"\r\nimport math\r\ndef solve():\r\n n=int(input())\r\n y=[]\r\n avg=int(math.ceil((n+n-1)/2))\r\n y.append([n,n-1])\r\n for i in range(n-2,0,-1):\r\n y.append(sorted([i,avg],reverse=True))\r\n avg=int(math.ceil((i+avg)/2))\r\n print(avg)\r\n for i in range(len(y)):\r\n print(*y[i])\r\n\r\nt=int(input())\r\nwhile t:\r\n solve()\r\n t-=1\r\n\"\"\"\r\n\"\"\"\r\nn=int(input())\r\nx=list(map(int,input().split()))\r\ny=[False]*n\r\nx.sort()\r\nans=0\r\nday=1\r\nfor i in range(n):\r\n if x[i]>=day and y[i]==False:\r\n ans+=1\r\n day+=1\r\n y[i]=True\r\n else:\r\n continue\r\nprint(ans)\r\n\"\"\"\r\n\"\"\"\r\ndef solve():\r\n n=int(input())\r\n x=list(map(int,input().split()))\r\n d={}\r\n ans=0\r\n for i in range(n):\r\n if x[i] not in d:\r\n d[x[i]]=1\r\n else:\r\n d[x[i]]+=1\r\n for i in range(n):\r\n if d[x[i]]>=2:\r\n ans+=1\r\n if ans:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\nt=int(input())\r\nwhile t:\r\n solve()\r\n t-=1\r\n\"\"\"\r\nn=int(input())\r\nx=[]\r\nfor i in range(3):\r\n x.append(list(map(int,input().split())))\r\nprint(sum(x[0])-sum(x[1]))\r\nprint(sum(x[1])-sum(x[2]))\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "s = int(input())\no = list(map(int, input().split()))\nr = list(map(int, input().split()))\na = list(map(int, input().split()))\nprint(sum(o)-sum(r))\nprint(sum(r)-sum(a))", "def aNb():\r\n n = int(input())\r\n first = sorted(input().split(' '))\r\n second = sorted(input().split(' '))\r\n second.append('0')\r\n third = sorted(input().split(' '))\r\n third.append('0')\r\n third.append('0')\r\n\r\n for i in range(n):\r\n if int(first[i]) != int(second[i]):\r\n print(first[i])\r\n break\r\n\r\n for i in range(n):\r\n if int(second[i]) != int(third[i]):\r\n print(second[i])\r\n break\r\n\r\naNb()\r\n", "from sys import stdin\r\n_, e1, e2, e3 = [sum(map(int, stdin.readline().split())) for _ in range(4)]\r\nprint(e1 - e2, e2 - e3)", "k = []\r\nfor i in range(4):\r\n e = list(map(int, input().split()))\r\n k.append(e)\r\na = sum(k[1]) - sum(k[2])\r\nb = sum(k[2]) - sum(k[3])\r\nprint(a,b)", "#Ram\r\nfrom sys import stdin,stdout\r\ninput = stdin.readline\r\n\r\ndef print(n):\r\n stdout.write(str(n)+\"\\n\")\r\n\r\ndef printl(l):\r\n for i in l:\r\n stdout.write(str(i)+\" \")\r\n\r\n\r\n\r\nn=int(input())\r\n\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=list(map(int,input().split()))\r\n\r\nd1={}\r\nd2={}\r\nd3={}\r\n\r\nfor i in l1:\r\n if i not in d1.keys():\r\n d1[i]=1\r\n else:\r\n d1[i]+=1\r\nfor i in l2:\r\n if i not in d2.keys():\r\n d2[i]=1\r\n else:\r\n d2[i]+=1\r\n\r\nfor i in l3:\r\n if i not in d3.keys():\r\n d3[i]=1\r\n else:\r\n d3[i]+=1\r\n\r\nfor i in d1.keys():\r\n if i not in d2.keys():\r\n print(i)\r\n break\r\n else:\r\n if d1[i]!=d2[i]:\r\n print(i)\r\n break\r\n\r\nfor i in d2.keys():\r\n if i not in d3.keys():\r\n print(i)\r\n break\r\n else:\r\n if d3[i]!=d2[i]:\r\n print(i)\r\n break", "# 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\nimport 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\n\r\nn = int(input())\r\na = sum(map(int, input().split()))\r\nb = sum(map(int, input().split()))\r\nc = sum(map(int, input().split()))\r\nprint(a-b, b-c, sep='\\n')\r\n\r\n\r\n", "# https://codeforces.com/problemset/problem/519/B\n\nfrom typing import *\n\n\ndef get_missing_numbers(a: List[int], b: List[int], c: List[int]) -> Tuple[int, int]:\n n1 = sum(a) - sum(b)\n n2 = sum(b) - sum(c)\n return n1, n2\n\n\nif __name__ == '__main__':\n n = int(input())\n a = [int(x) for x in input().split(' ')]\n b = [int(x) for x in input().split(' ')]\n c = [int(x) for x in input().split(' ')]\n n1, n2 = get_missing_numbers(a, b, c)\n print(n1)\n print(n2)", "input()\r\narr1=[int(arr) for arr in input().split()]\r\narr2=[int(arr) for arr in input().split()]\r\narr3=[int(arr) for arr in input().split()]\r\n\r\nprint(sum(arr1)-sum(arr2))\r\nprint(sum(arr2)-sum(arr3))\r\n", "import collections\r\n\r\nn=int(input())\r\nerrors=list(map(int,input().split()))\r\nc = collections.Counter(errors)\r\n\r\ne1=list(map(int,input().split()))\r\nc1 = collections.Counter(e1)\r\n\r\ne2=list(map(int,input().split()))\r\nc2 = collections.Counter(e2)\r\n\r\n# print(*[x for x in set(errors) if errors.count(x)!=e1.count(x)])\r\n# print(*[x for x in set(e1) if e1.count(x)!=e2.count(x)])\r\nprint(*(c-c1))\r\nprint(*(c1-c2))", "from collections import Counter\r\n\r\ndef solve(c1, c2):\r\n return next(k for k, v in c1.items() if k not in c2 or c2[k] < v)\r\n\r\nn = int(input())\r\na = Counter(list(map(int, input().split())))\r\nb = Counter(list(map(int, input().split())))\r\nc = Counter(list(map(int, input().split())))\r\n\r\nprint(solve(a, b))\r\nprint(solve(b, c))", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nans = []\r\ni = 0\r\nj = 0\r\nwhile(len(ans) != 1 and i < n-1):\r\n if(a[i] != b[i]):\r\n ans.append(a[i])\r\n break\r\n i+=1\r\nif(len(ans) == 0):\r\n ans.append(a[n-1])\r\nwhile(len(ans) != 2 and j < n-2):\r\n if(b[j] != c[j]):\r\n ans.append(b[j])\r\n break\r\n j+=1\r\nif(len(ans) == 1):\r\n ans.append(b[n-2])\r\n\r\nprint(*ans, sep=\"\\n\")", "input()\r\ncompilation_errors = list(map(int, input().split()))\r\nfirst_set_of_scompilation_errors = (sum(compilation_errors))\r\nsecond_set_of_scompilation_errors = (sum(list(map(int, input().split()))))\r\nthird_set_of_scompilation_errors = (sum(list(map(int, input().split()))))\r\nprint((first_set_of_scompilation_errors-second_set_of_scompilation_errors))\r\nprint((second_set_of_scompilation_errors-third_set_of_scompilation_errors))", "n = int(input())\r\nerrors = [int(x) for x in input().split()]\r\nsecond = [int(x) for x in input().split()]\r\nthird = [int(x) for x in input().split()]\r\nerrors.sort()\r\nsecond.sort()\r\nthird.sort()\r\nfor i in range(n-2):\r\n y = 0\r\n if second[i] != third[i]:\r\n y = second[i]\r\n break\r\nif not y:\r\n y = second[-1]\r\nfor i in range(n-1):\r\n x = 0\r\n if errors[i] != second[i]:\r\n x = errors[i]\r\n break\r\nif not x:\r\n x = errors[-1]\r\nprint(x)\r\nprint(y)\r\n", "n=int(input())\r\na=sum(list(map(int,input().split())))\r\nb=sum(list(map(int,input().split())))\r\nc=sum(list(map(int,input().split())))\r\nprint(a-b)\r\nprint(b-c)", "n = int(input())\r\na = sorted(list(map(int , input().split())))\r\nb = sorted(list(map(int , input().split())))\r\nc = sorted(list(map(int , input().split())))\r\nall = [a,b,c]\r\n\r\nfor i in range(2):\r\n asn = 0\r\n mn = n\r\n for j in range(mn):\r\n try:\r\n if all[i][j] != all[i+1][j]:\r\n print(all[i][j])\r\n break\r\n except:\r\n print(all[i][-1])\r\n break", "from os import truncate\n\n\nn = int(input())\na = list(map(int, input().split()))\na.sort()\nb = list(map(int, input().split()))\nb.sort()\nc = list(map(int, input().split()))\nc.sort()\nlasta = True\nfor i in range(len(a)-1):\n if a[i] != b[i]:\n print(a[i])\n lasta = False\n break\nif lasta:\n print(a[-1])\nlastb = True\nfor i in range(len(b)-1):\n if b[i] != c[i]:\n print(b[i])\n lastb = False\n break\nif lastb:\n print(b[-1])\n\n \t \t\t\t \t\t\t \t\t \t\t \t\t\t\t \t \t \t", "n = int(input())\r\n\r\narr1 = [int(z) for z in input().split()]\r\narr2 = [int(z) for z in input().split()]\r\narr3 = [int(z) for z in input().split()]\r\n\r\narr1.sort()\r\narr2.sort()\r\narr3.sort()\r\n\r\nocc1 = {}\r\nocc2 = {}\r\nocc3 = {}\r\n\r\nfor i in arr1:\r\n occ1[i] = occ1.get(i, 0) + 1\r\nfor i in arr2:\r\n occ2[i] = occ2.get(i, 0) + 1\r\nfor i in arr3:\r\n occ3[i] = occ3.get(i, 0) + 1\r\nfirst = 0; second = 0\r\nfor i in occ1:\r\n if not occ2.get(i):\r\n occ2[i] = 0\r\n if occ1[i] != occ2[i]:\r\n first = i\r\n break\r\n\r\nfor i in occ2:\r\n if not occ3.get(i):\r\n occ3[i] = 0\r\n if occ2[i] != occ3[i]:\r\n second = i\r\n break\r\n\r\nprint(first)\r\nprint(second)\r\n\r\n", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nb = sorted([int(i) for i in input().split()])\r\nc = sorted([int(i) for i in input().split()])\r\n\r\nt = True\r\nfor i in range(n-1):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n t = False\r\n break\r\n\r\nif t:\r\n print(a[-1])\r\n\r\n\r\nt = True\r\nfor i in range(n-2):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n t = False\r\n break\r\n\r\nif t:\r\n print(b[-1])\r\n", "n = int(input())\r\n\r\nl1 = [int(x) for x in input().split()]\r\nl2 = [int(x) for x in input().split()]\r\nl3 = [int(x) for x in input().split()]\r\n\r\ncount_dict_l1 = {}\r\ncount_dict_l2 = {}\r\ncount_dict_l3 = {}\r\n\r\nans = [[], []]\r\n\r\nfor l in l1:\r\n count_dict_l1[l] = count_dict_l1.get(l, 0) + 1\r\n\r\nfor l in l2:\r\n count_dict_l2[l] = count_dict_l2.get(l, 0) + 1\r\n\r\nfor l in l3:\r\n count_dict_l3[l] = count_dict_l3.get(l, 0) + 1\r\n\r\nfor l in l1:\r\n if count_dict_l1[l] != count_dict_l2.get(l, 0):\r\n if l not in ans[0]:\r\n ans[0].append(l)\r\n\r\nfor l in l2:\r\n if count_dict_l2[l] != count_dict_l3.get(l, 0):\r\n if l not in ans[1]:\r\n ans[1].append(l)\r\n\r\nfor a in ans:\r\n if len(a) > 0:\r\n print(a[0])\r\n", "def check(x,y):\r\n x.sort()\r\n y.sort()\r\n for i in range(len(x)-1):\r\n if x[i]!=y[i]:\r\n return x[i]\r\n return x[-1]\r\n\r\n\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\nbrr = list(map(int,input().split()))\r\ncrr = list(map(int,input().split()))\r\n\r\n\r\n# res = []\r\n# for i in arr:\r\n# # if i not in crr:\r\n# # print(arr[i])\r\n# # cnt1 = arr.count(i)\r\n# # cnt2 = crr.count(i)\r\n# # dif = cnt1-cnt2\r\n# # # print(dif)\r\n# # if dif==0:\r\n# # res.append(i)\r\n# # else:\r\n# # gt = int(str(arr[i])*dif)\r\n# # for i in range(dif):\r\n# # res.append(gt)\r\n\r\n# for i in res:\r\n# print(i)\r\n\r\nprint(check(arr,brr))\r\nprint(check(brr,crr))", "sum1,sum2,sum3=0,0,0\r\nn = int(input())\r\nfor x in input().split():\r\n sum1+=int(x)\r\nfor x in input().split():\r\n sum2+=int(x)\r\nfor x in input().split():\r\n sum3+=int(x)\r\nprint(sum1-sum2)\r\nprint(sum2-sum3)", "import sys\r\n\r\ndef read_strings():\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\nyes, no = \"YES\", \"NO\"\r\n\r\n# -------------------- solution code below --------------------\r\n\r\nn, = read_inline_ints()\r\nfirst_errors = read_inline_ints()\r\nsecond_errors = read_inline_ints()\r\nthird_errors = read_inline_ints()\r\n\r\n\r\nprint(sum(first_errors) - sum(second_errors))\r\nprint(sum(second_errors) - sum(third_errors))", "mistakes = int(input())\r\nfirst = sorted(list(map(int, input().split())))\r\nsecond = sorted(list(map(int, input().split())))\r\nthird = sorted(list(map(int, input().split())))\r\n\r\nprint(sum(first)-sum(second))\r\nprint(sum(second) - sum(third))\r\n\r\n", "n = int(input())\r\nlist1 = []\r\nlist2 = []\r\nlist3 = []\r\nfor i in list(map(int,input().split()))[:n]:\r\n\tlist1.append(i)\r\nfor i in list(map(int,input().split()))[:n-1]:\r\n\tlist2.append(i)\r\nfor i in list(map(int,input().split()))[:n-2]:\r\n\tlist3.append(i)\r\nprint(sum(list1)-sum(list2))\r\nprint(sum(list2)-sum(list3))", "def sol(ar,arr1) : \r\n ar.sort()\r\n for i in range(len(ar)) : \r\n if ar[i] != arr1[i] : print(arr1[i]); break \r\n else : print(arr1[-1])\r\nn = int(input())\r\narr1 = list(map(int,input().split())); arr1.sort()\r\narr2 = list(map(int,input().split())); sol(arr2,arr1)\r\narr3 = list(map(int,input().split())); sol(arr3,arr2)\r\n\r\n", "n = input()\ns1 = sum(map(int,input().split()))\ns2 = sum(map(int,input().split()))\ns3 = sum(map(int,input().split()))\nprint(s1-s2)\nprint(s2-s3)\n", "n=int(input())\r\na=[int(a) for a in input().split()]\r\nb=[int(b) for b in input().split()]\r\nc=[int(c) for c in input().split()]\r\na.sort()\r\nb.sort()\r\nc.sort()\r\ni=0\r\nwhile(i<n):\r\n if(i==n-1):\r\n print(a[i])\r\n i=n\r\n elif(a[i]!=b[i]):\r\n print(a[i])\r\n i=n\r\n else:\r\n i=i+1\r\ni=0\r\nwhile(i<n-1):\r\n if(i==n-2):\r\n print(b[i])\r\n i=n\r\n elif(b[i]!=c[i]):\r\n print(b[i])\r\n i=n\r\n else:\r\n i=i+1\r\n \r\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\ns1=sum(l)\r\ns2=sum(l1)\r\ns3=sum(l2)\r\nprint(s1-s2)\r\nprint(s2-s3)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\n\r\nsa=0\r\nsb=0\r\nsc=0\r\nfor i in range(n):\r\n sa = sa+a[i]\r\nfor i in range(n-1):\r\n sb = sb+b[i]\r\nfor i in range(n-2):\r\n sc = sc+c[i]\r\nprint(sa-sb)\r\nprint(sb-sc)\r\n\r\n\r\n", "n,a,b,c = [sum(map(int,input().split())) for _ in \"\\n\"*4]\r\nprint(a-b ,\"\\n\", b-c)", "from collections import Counter\n\nn = int(input())\na = Counter(list(map(int, input().split())))\nb = Counter(list(map(int, input().split())))\nc = Counter(list(map(int, input().split())))\nansw_a = a - b\nansw_b = b - c \nprint(list(answ_a.keys())[0])\nprint(list(answ_b.keys())[0])\n \t \t \t\t\t \t \t \t\t \t \t\t \t", "def adiciona(erro, compilacao):\n if erro not in compilacao:\n compilacao[erro] = 0\n compilacao[erro] += 1\n\n\ndef remove(erro, compilacao):\n if compilacao[erro] == 1:\n del compilacao[erro]\n else:\n compilacao[erro] -= 1\n\n\nn = int(input())\n# 1a rodada\ncompilacao1 = {}\nfor erro in input().split():\n adiciona(erro, compilacao1) \n\n# 2a rodada\ncompilacao2 = {}\nfor erro in input().split():\n remove(erro, compilacao1)\n adiciona(erro, compilacao2)\nfor erro in compilacao1:\n print(erro)\n\n# 3a rodada\nfor erro in input().split():\n remove(erro, compilacao2)\nfor erro in compilacao2:\n print(erro)\n\t\t \t \t \t \t \t \t\t\t\t \t", "def solve():\r\n\tn = int(input())\r\n\tl1 = input().split()\r\n\tl2 = input().split()\r\n\tl3 = input().split()\r\n\tl1 = sum([int(i) for i in l1])\r\n\tl2 = sum([int(i) for i in l2])\r\n\tl3 = sum([int(i) for i in l3])\r\n\r\n\tprint('{}\\n{}'.format(l1 - l2, l2 - l3))\r\n\r\nsolve()\r\n", "def errors(arr, er1, er2, n):\r\n s1 = sum(arr)\r\n s2 = sum(er1)\r\n s3 = sum(er2)\r\n return [s1 - s2, s2 - s3]\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\ner1 = list(map(int, input().split()))\r\ner2 = list(map(int, input().split()))\r\nans = errors(arr, er1, er2, n)\r\nprint(ans[0])\r\nprint(ans[1])", "n = input()\r\ninput_arr0 = input()\r\nlist0 = [int(x) for x in input_arr0.split()]\r\nlist0_sum = sum(list0)\r\n\r\ninput_arr1 = input()\r\nlist1 = [int(x) for x in input_arr1.split()]\r\nlist1_sum = sum(list1)\r\n\r\ninput_arr2 = input()\r\nlist2 = [int(x) for x in input_arr2.split()]\r\nlist2_sum = sum(list2)\r\n\r\nprint(list0_sum - list1_sum)\r\nprint(list1_sum - list2_sum)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nsumma = 0\r\nsummb = 0\r\nsummc = 0\r\n\r\nfor i in range(n):\r\n summa += a[i]\r\n if i < n-1:\r\n summb += b[i]\r\n if i < n-2:\r\n summc += c[i]\r\nprint(summa - summb)\r\nprint(summb - summc)\r\n", "from bisect import bisect_right\r\n\r\nn = int(input())\r\nfirst = list(map(int,input().split()))\r\ne1_count = {}\r\ne2_count = {}\r\ne3_count = {}\r\nfor e in first:\r\n try:\r\n e1_count[e]+=1\r\n except:\r\n e1_count[e]=1\r\n e2_count[e]=0\r\n e3_count[e]=0\r\n\r\nsecond = list(map(int,input().split()))\r\nfor e in second:\r\n e2_count[e]+=1\r\nthird = list(map(int,input().split()))\r\nfor e in third:\r\n e3_count[e]+=1\r\n\r\n#1 3 3 4 5 7\r\n#3 3 4 5 7 \r\n#3 4 5 7\r\nfor e1 in e1_count:\r\n if e1_count[e1]!=e2_count[e1]:\r\n print(e1)\r\n break\r\nfor e2 in e2_count:\r\n if e2_count[e2]!=e3_count[e2]:\r\n print(e2)\r\n break\r\n", "n=int(input())\r\nl1=[i for i in map(int,input().split())]\r\nl2=[i for i in map(int,input().split())]\r\nl3=[i for i in map(int,input().split())]\r\ns1=sum(l1)\r\ns2=sum(l2)\r\ns3=sum(l3)\r\nprint(s1-s2)\r\nprint(s2-s3)\r\n", "def sa():\r\n return sorted(map(int, input().split()))\r\n\r\n\r\ndef da(a, b):\r\n for i, j in zip(a, b):\r\n if i != j:\r\n return i\r\n return a[-1]\r\n\r\n\r\nn = int(input())\r\na, b, c = sa(), sa(), sa()\r\nprint(da(a, b))\r\nprint(da(b, c))\r\n", "def comp():\n n = int(input())\n errors = input().split()\n errors2 = input().split()\n errors3 = input().split()\n soma1, soma2, soma3 = sum([int(x) for x in errors]), sum([int(x) for x in errors2]), sum([int(x) for x in errors3])\n print(f\"{soma1-soma2}\\n{soma2-soma3}\")\n\n\ncomp()\n\n \t\t\t\t\t \t\t \t \t \t\t \t \t\t\t\t", "n = int(input())\n\nerros = list(map(int,input().split(\" \")))\n\nerros1 = list(map(int,input().split(\" \")))\n\nerros2 = list(map(int,input().split(\" \")))\n\n\nsum = 0\nsum1 = 0\nsum2 = 0\n\n\nfor i in range(n):\n sum += erros[i]\n\n if(i < n -1):\n sum1 += erros1[i]\n \n if(i < n -2):\n sum2 += erros2[i]\n\nprint(sum - sum1)\nprint(sum1 - sum2)\n\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 # taking input - start\r\n inputs = stdin.readlines()\r\n inp_dict = []\r\n for i in range(1, len(inputs)):\r\n inp_dict.append({})\r\n for x in inputs[i].split():\r\n x = int(x)\r\n inp_dict[i-1].setdefault(x, 0)\r\n inp_dict[i-1][x] += 1\r\n # taking input - end\r\n\r\n ans = []\r\n\r\n for m in range(len(inp_dict)-1):\r\n for k in inp_dict[m].keys():\r\n inp_dict[m+1].setdefault(k,0)\r\n if inp_dict[m+1][k] < inp_dict[m][k]:\r\n ans.append(str(k))\r\n break\r\n\r\n print('\\n'.join(ans))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "numOfInitialErrors = int(input())\r\nfirstLineOfErrors = sorted([int(x) for x in input().split()])\r\nsecondLineOfErrors = sorted([int(x) for x in input().split()]) + [\"\"]\r\nthirdLineOfErrors = sorted([int(x) for x in input().split()]) + [\"\",\"\"]\r\n\r\nfor error1, error2 in zip(firstLineOfErrors,secondLineOfErrors):\r\n if error1 != error2:\r\n print(error1)\r\n break\r\n\r\nfor error1, error2 in zip(secondLineOfErrors,thirdLineOfErrors):\r\n if error1 != error2:\r\n print(error1)\r\n break\r\n\r\n", "a = int(input())\r\nb = sum(map(int, input().split()))\r\nc = sum(map(int, input().split()))\r\nd = sum(map(int, input().split()))\r\nprint (b-c)\r\nprint (c-d)", "n = int(input())\n\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\na = a + [0 for _ in range(n - len(a))]\nb = b + [0 for _ in range(n - len(b))]\nc = c + [0 for _ in range(n - len(c))]\n\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\n\nfor i in range(n):\n if a[i] != b[i]:\n print(a[i])\n break\n\nfor i in range(n - 1):\n if c[i] != b[i]:\n print(b[i])\n break\n \t\t\t\t\t\t\t \t \t \t\t\t \t\t \t\t \t", "times = input()\nnumbers = {}\n\nfor i in input().split(\" \"):\n if not i in numbers:\n numbers[i] = 1\n else:\n numbers[i] += 1\n\nfirst_fix = {}\n\nfor i in input().split(\" \"):\n if not i in first_fix:\n first_fix[i] = 1\n else:\n first_fix[i] += 1\n\nsecond_fix = {}\n\nfor i in input().split(\" \"):\n if not i in second_fix:\n second_fix[i] = 1\n else:\n second_fix[i] += 1\n\n\nfor k in numbers:\n\n if not k in first_fix or first_fix[k] + 1 == numbers[k]:\n print(k)\n\n\nfor k in first_fix:\n if not k in second_fix or second_fix[k] + 1 == first_fix[k]:\n print(k)\n \t\t\t \t\t \t\t\t \t\t\t \t\t \t\t\t\t\t\t \t", "n,a,b,c=[sum(map(int,input().split()))for _ in ' '*4]\r\nprint(a-b,b-c)", "n = int(input())\r\narr = [int(i) for i in input().split(' ')]\r\ns1,s2=0,0\r\nl1 = [int(i) for i in input().split(' ')]\r\nl2 = [int(i) for i in input().split(' ')]\r\ns1 = sum(arr)-sum(l1)\r\ns2 = sum(l1)-sum(l2)\r\nprint(s1)\r\nprint(s2)\r\n ", "from binascii import b2a_base64\r\n\r\n\r\ncol=int(input())\r\nerror_1=input().split()\r\nerror_2=input().split()\r\nerror_3=input().split()\r\na=0\r\nb=0\r\nc=0\r\nfor i in error_1:\r\n a+=int(i)\r\nfor j in error_2:\r\n b+=int(j)\r\nfor z in error_3:\r\n c+=int(z)\r\nprint(a-b)\r\nprint(b-c)", "n = int(input())\nf_erros = sorted(list(map(int, input().split())))\ns_erros = sorted(list(map(int, input().split())))\nt_erros = sorted(list(map(int, input().split())))\n\nprint(sum(f_erros) - sum(s_erros))\nprint(sum(s_erros) - sum(t_erros))\n", "n=input()\r\ns=input().split(\" \")\r\ns=[int(x) for x in s]\r\ns=sum(s)\r\nt=input().split(\" \")\r\nt=[int(x) for x in t]\r\nt=sum(t)\r\nu=input().split(\" \")\r\nu=[int(x) for x in u]\r\nu=sum(u)\r\nprint(s-t)\r\nprint(t-u)", "from collections import Counter\r\nimport sys\r\ninput = sys.stdin.readline\r\nn=int(input())\r\nt=[]\r\nc=[]\r\nfor i in range(3):\r\n x = list(map(lambda q:int(q), input().split(\" \")))\r\n t.append(x)\r\nfor i in range(3-1):\r\n a=t[i]\r\n b=t[i+1]\r\n c+=list((Counter(a)-Counter(b)).elements())\r\nfor i in c:\r\n print(i)", "n=int(input())\r\nls1 = list(map(int, input().split()))\r\nls2 = list(map(int, input().split()))\r\nls3 = list(map(int, input().split()))\r\nls1.sort()\r\nls2.sort()\r\nls3.sort()\r\ndef caribeda(ls1,ls2):\r\n \r\n for i in range(len(ls2)):\r\n if ls2[i]!=ls1[i]:\r\n return ls1[i]\r\n return ls1[-1]\r\nprint(caribeda(ls1,ls2))\r\nprint(caribeda(ls2,ls3))", "comp_errors = int(input())\n\nfirst_arr = [int(x) for x in input().split()]\n\nsecond_arr = [int(x) for x in input().split()]\n\nthird_arr = [int(x) for x in input().split()]\n\ncomp_dict = {}\n\nfor el in first_arr:\n if el not in comp_dict:\n comp_dict[el] = 1\n else:\n comp_dict[el] += 1\n\ncomp_dict_2 = comp_dict.copy()\n\nfor el in second_arr:\n comp_dict[el] -= 1\n\nfor key, value in comp_dict.items():\n if value != 0:\n print(key)\n comp_dict_2[key] -= 1\n\nfor el in third_arr:\n comp_dict_2[el] -= 1\n\nfor key, value in comp_dict_2.items():\n if value != 0:\n print(key)\n \t \t \t\t \t \t \t \t \t\t\t", "a = int(input())\r\narr = list(map(int, input().split()))\r\narr1 = list(map(int, input().split()))\r\narr2 = list(map(int, input().split()))\r\nres1 = sum(arr) - sum(arr1)\r\nres2 = sum(arr1) - sum(arr2)\r\nprint(res1)\r\nprint(res2)", "n=int(input())\r\nx=list(map(int,input().split()))\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nx.sort()\r\na.sort()\r\nb.sort()\r\ni,j=0,0\r\nq=[]\r\nwhile j<len(a):\r\n if a[j]!=x[i]:\r\n q.append(x[i])\r\n i+=1\r\n else:\r\n i+=1\r\n j+=1\r\nfor i in range(i,n):\r\n q.append(x[i])\r\nfor i in q:\r\n print(i,end=\" \")\r\nprint(\"\")\r\ni,j=0,0\r\nq=[]\r\nwhile j<len(b):\r\n if b[j]!=a[i]:\r\n q.append(a[i])\r\n i+=1\r\n else:\r\n i+=1\r\n j+=1\r\nfor i in range(i,len(a)):\r\n q.append(a[i])\r\nfor i in q:\r\n print(i,end=\" \")", "from sys import stdin\r\ninput=stdin.readline\r\nn=int(input()) ; error1=list(map(int,input().split())) ; error2=list(map(int,input().split())) ; error3=list(map(int,input().split()))\r\nerror1.sort() ; error2.sort() ; error3.sort() ; l=0 ; r=n-2\r\nfor i in range(n-1):\r\n if error2[i]!=error1[i]:\r\n print(error1[i]) ; break\r\nelse:\r\n print(error1[-1])\r\n\r\nfor i in range(n-2):\r\n if error3[i]!=error2[i]:\r\n print(error2[i]) ; break\r\nelse:\r\n print(error2[-1])\r\n", "_ = int(input())\r\nl1 = sum(map(int, input().split()))\r\nl2 = sum(map(int, input().split()))\r\ncor = sum(map(int, input().split()))\r\n\r\nprint(l1 - l2)\r\nprint(l2 - cor)\r\n\r\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nsumm1=sum(a)\r\nsumm2=sum(b)\r\nsumm3=sum(c)\r\nprint(summ1-summ2)\r\nprint(summ2-summ3)", "a = int(input())\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nprint(sum(b)-sum(c))\r\nprint(sum(c)-sum(d))", "n = int(input())\r\n \r\ns = sorted(list(map(int, input().split(' '))))\r\ns1 = sorted(list(map(int, input().split(' '))))\r\ns2 = sorted(list(map(int, input().split(' '))))\r\n\r\nflag = True\r\nfor i in range(len(s1)):\r\n if s[i] != s1[i]:\r\n flag = False\r\n break\r\n \r\nif flag:\r\n print(s[-1])\r\nelse:\r\n print(s[i])\r\n\r\nflag = True\r\nfor i in range(len(s2)):\r\n if s1[i] != s2[i]:\r\n flag = False\r\n break\r\n \r\nif flag:\r\n print(s1[-1])\r\nelse:\r\n print(s1[i])", "t = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nans_1 = 0\r\nans_2 = 0\r\nfor i in range(t - 1):\r\n if a[i] != b[i]:\r\n ans_1 = a[i]\r\n break\r\nelse:\r\n ans_1 = a[-1]\r\n\r\nfor i in range(t - 2):\r\n if c[i] != b[i]:\r\n ans_2 = b[i]\r\n break\r\nelse:\r\n ans_2 = b[-1]\r\n\r\n\r\nprint(ans_1)\r\nprint(ans_2)", "n=int(input())\r\nl1=input().split()\r\ns1=input().split()\r\ns2=input().split()\r\nl1 = list(map(int, l1))\r\ns1 = list(map(int, s1))\r\ns2 = list(map(int, s2))\r\n\r\nprint(sum(l1)-sum(s1))\r\nprint(sum(s1)-sum(s2))", "n = int(input())\na = sum(map(int, input().split()))\nb = sum(map(int, input().split()))\nc = sum(map(int, input().split()))\n\nprint(a-b)\nprint(b-c)\n\t\t\t \t\t\t \t \t \t \t \t \t\t\t", "n = int(input())\r\n\r\nsum1 = sum(list(map(int, input().split())))\r\nsum2 = sum(list(map(int, input().split())))\r\nsum3 = sum(list(map(int, input().split())))\r\n\r\nprint(sum1 - sum2)\r\nprint(sum2 - sum3)", "def main():\r\n n = int(input())\r\n lis1 = [int(x) for x in input().split()]\r\n lis2 = [int(x) for x in input().split()]\r\n lis3 = [int(x) for x in input().split()]\r\n\r\n print(sum(lis1)-sum(lis2))\r\n print(sum(lis2)-sum(lis3))\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main()", "# your code goes here\r\n\r\ndef error_count(n, a, b, c):\r\n res = [sum(a) - sum(b), sum(b) - sum(c)]\r\n return \"\\n\".join(str(i) for i in res)\r\n\r\nif __name__ == \"__main__\":\r\n n, a = int(input()), list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n print(error_count(n, a, b, c))", "n=int(input())\r\n# from math import comb\r\nfrom collections import Counter\r\n# import math\r\n# import sys\r\n# for i in range(int(input())):\r\n# n,m=map(int,input().split())\r\n# matrix=[list(map(int,input().split())) for i in range(m)]\r\n# arr=list(map(int,input().split()))\r\narr=[list(map(int,input().split())) for i in range(3)]\r\nfirst=arr[0]+arr[1]\r\nfor k,v in Counter(first).items():\r\n if v%2==1:\r\n print(k)\r\n break\r\nsecond=arr[1]+ arr[2]\r\nfor k,v in Counter(second).items():\r\n if v%2==1:\r\n print(k)\r\n break\r\n", "#Ram\r\nfrom sys import stdin,stdout\r\ninput = stdin.readline\r\n\r\ndef print(n):\r\n stdout.write(str(n)+\"\\n\")\r\n\r\ndef printl(l):\r\n for i in l:\r\n stdout.write(str(i)+\" \")\r\n\r\n\r\n\r\nn=int(input())\r\n\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=list(map(int,input().split()))\r\n\r\nx1,x2,x3=l1[0],l2[0],l3[0]\r\n\r\nfor i in l1[1:]:\r\n x1^=i\r\nfor i in l2[1:]:\r\n x2^=i\r\nfor i in l3[1:]:\r\n x3^=i\r\n\r\nprint(x1^x2)\r\nprint(x2^x3)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nf = False\r\nfor i in range(n-1):\r\n if(a[i]!=b[i]):\r\n print(a[i])\r\n f = True\r\n break\r\nif(f==False):\r\n print(a[-1])\r\n\r\nf = False\r\nfor i in range(n-2):\r\n if(b[i]!=c[i]):\r\n print(b[i])\r\n f = True\r\n break\r\nif(f == False):\r\n print(b[-1])\r\n\r\n \r\n", "x = int(input())\r\n\r\ndct = {}\r\ninp = input().split()\r\nfor i in range(x):\r\n dct[inp[i]] = dct.get(inp[i], 0) + 1\r\n\r\nct = {}\r\ndct2 = dct.copy()\r\ninp = input().split()\r\nfor i in range(x - 1):\r\n ct[inp[i]] = ct.get(inp[i], 0) + 1\r\n if dct2[inp[i]] == 1:\r\n del dct2[inp[i]]\r\n else:\r\n dct2[inp[i]] = dct2[inp[i]] - 1\r\n\r\nprint(list(dct2.keys())[0])\r\n\r\nct2 = ct.copy()\r\ninp = input().split()\r\nfor i in range(x - 2):\r\n if ct2[inp[i]] == 1:\r\n del ct2[inp[i]]\r\n else:\r\n ct2[inp[i]] = ct2[inp[i]] - 1\r\n\r\nprint(list(ct2.keys())[0])", "import math\r\nfrom collections import OrderedDict\t\t\r\n\r\n\r\n\r\n# t = int(input())\r\n# while(t>0):\r\n\r\n\r\n\r\n\r\n# \tt-=1\t\r\n\r\nn = int(input())\r\ninp = input()\r\na = list(map(int,inp.split(\" \")))\r\ninp = input()\r\nb = list(map(int,inp.split(\" \")))\r\ninp = input()\r\nc = list(map(int,inp.split(\" \")))\r\n\r\nsumA = sum(a)\r\nsumB = sum(b)\r\nsumC = sum(c)\r\n\r\nprint(sumA-sumB)\r\nprint(sumB-sumC)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#\t\t\t\t\t\t\t▀█ ▄█ █▀█ █▀█ \r\n#\t\t\t\t\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", "n = int(input())\r\nfirst, second, last = [int(i) for i in input().split()], [int(i) for i in input().split()], [int(i) for i in input().split()]\r\nprint(sum(first) - sum(second))\r\nprint(sum(second) - sum(last))", "# / *\r\n#\r\n# / \\ | | / \\ | | | |\r\n# / __\\ | | / __\\ |--| | |\r\n# / \\ |__ | __ / \\ | | \\__ /\r\n#\r\n# __ __\r\n# / \\ | / | ) / \\ | )\r\n# / __\\ |< |-< / __\\ |-<\r\n# / \\ | \\ |__) / \\ | \\\r\n#\r\n# * /\r\n# Function to count frequency of each element\r\nimport collections\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr = [int(i) for i in input().split()]\r\n arr2 = [int(i) for i in input().split()]\r\n arr3 = [int(i) for i in input().split()]\r\n arr.sort()\r\n arr2.sort()\r\n arr3.sort()\r\n for i in range(n - 1):\r\n if arr[i] != arr2[i]:\r\n print(arr[i])\r\n break\r\n if i == n-2:\r\n print(arr[n-1])\r\n for i in range(n - 2):\r\n if arr3[i] != arr2[i]:\r\n print(arr2[i])\r\n break\r\n if i == n-3:\r\n print(arr2[n-2])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "IN = lambda:(list(map(int, input().split())))\r\nn = int(input())\r\na = IN()\r\nb = IN()\r\nc = IN()\r\nprint(sum(a) - sum(b))\r\nprint(sum(b) - sum(c))", "def main() -> None:\r\n err = int(input()) # изначальное количество ошибок компиляции\r\n err_log = [] # спиок запросов\r\n for i in range(3):\r\n err_log.append(sorted([int(x) for x in input().split(\" \")]))\r\n\r\n for i in range(1, 3):\r\n for k in range(err - i):\r\n if err_log[i - 1][k] != err_log[i][k]:\r\n print(err_log[i - 1][k])\r\n k = -1\r\n break\r\n if k != - 1:\r\n print(err_log[i - 1][-1])\r\n return None\r\n\r\nif __name__ == '__main__':\r\n main()", "n = int(input())\ns1 = [int(i) for i in input().split(\" \")]\ns2 = [int(i) for i in input().split(\" \")]\ns3 = [int(i) for i in input().split(\" \")]\n\nprint(sum(s1) - sum(s2))\nprint(sum(s2) - sum(s3))", "n = int(input())\nerros = sum(map(int, input().split()))\nsemErros = sum(map(int, input().split()))\nprint(abs(semErros-erros))\nerros = semErros\nsemErros = sum(map(int, input().split()))\nprint(abs(semErros-erros))\n", "\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nla=sorted(a)\r\nlb=sorted(b)\r\nlc=sorted(c)\r\nfor i in range(n-1):\r\n if la[i]!=lb[i]:\r\n print(la[i])\r\n break\r\nelse:\r\n print(la[-1])\r\nfor i in range(n-2):\r\n if lb[i]!=lc[i]:\r\n print(lb[i])\r\n break\r\nelse:\r\n print(lb[-1])\r\n\r\n\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\na=sorted([int(i) for i in input().split()])\r\nb=sorted([int(i) for i in input().split()])\r\nc=sorted([int(i) for i in input().split()])\r\nk1,k2=0,0\r\nfor i in range(n-1):\r\n if(a[i]!=b[i]):\r\n k1=a[i]\r\n break\r\nif(k1==0):\r\n k1=a[n-1]\r\nfor i in range(n-2):\r\n if(b[i]!=c[i]):\r\n k2=b[i]\r\n break\r\nif(k2==0):\r\n k2=b[n-2]\r\nprint(k1)\r\nprint(k2)", "from collections import Counter\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ncnta=Counter(a)\r\ncntb=Counter(b)\r\ncntc=Counter(c)\r\ncntab=cnta-cntb\r\nprint(list(cntab)[0])\r\ncntbc=cntb-cntc\r\nprint(list(cntbc)[0])\r\n", "from collections import Counter\r\ndef solve():\r\n\tn = int(input())\r\n\tl1 = input().split()\r\n\tl2 = input().split()\r\n\tl3 = input().split()\r\n\tl1 = [int(i) for i in l1]\r\n\tl2 = [int(i) for i in l2]\r\n\tl3 = [int(i) for i in l3]\r\n\tl4 = Counter(l1)\r\n\tl5 = Counter(l2)\r\n\tl6 = Counter(l3)\r\n\ti = next(iter(l4 - l5))\r\n\tj = next(iter(l5 - l6))\r\n\tprint(i)\r\n\tprint(j)\r\n\r\nsolve()\r\n", "n = int(input())\n\nsoma = 0\n\nfor i in range(3):\n lista = list(map(eval, input().split()))\n\n soma_parcial = sum(lista)\n\n if i > 0:\n print(soma - soma_parcial)\n\n soma = sum(lista)\n\t\t \t\t \t\t \t\t \t\t \t\t\t\t\t \t\t \t", "from collections import Counter\r\n\r\nn=int(input())\r\n\r\narr=Counter(map(int,input().split()))\r\narr2=Counter(map(int,input().split()))\r\narr3=Counter(map(int,input().split()))\r\n\r\nfor i in arr:\r\n if i not in arr2 or arr[i]!=arr2[i]:\r\n print(i)\r\n break\r\n\r\nfor i in arr2:\r\n if i not in arr3 or arr2[i]!=arr3[i]:\r\n print(i)\r\n break", "n = int(input())\n\nres = []\n\nline = input().split(' ')\ndic1= {}\n\nfor d in line:\n if d not in dic1:\n dic1[d] = 1\n else:\n dic1[d]+= 1\n\n\n\nline2 = input().split(' ')\ndic2 = {}\n\nfor d in line2:\n if d not in dic2:\n dic2[d] = 1\n else:\n dic2[d] +=1\n\nfor d in dic1:\n if d not in dic2:\n res.append(d)\n break\n elif dic1[d] != dic2[d]:\n res.append(d)\n break\n\nline3 = input().split(' ')\ndic3 = {}\n\nfor d in line3:\n if d not in dic3:\n dic3[d] = 1\n else:\n dic3[d] +=1\n\nfor d in dic2:\n if d not in dic3:\n res.append(d)\n break\n elif dic3[d] != dic2[d]:\n res.append(d)\n break\n\n\n\nfor k in res:\n print(k)\n\t\t \t\t \t \t \t\t \t \t\t\t\t\t\t \t\t", "input()\r\nA={}\r\nB={}\r\nfor a in input().split():\r\n try:\r\n A[a]+=1\r\n except:\r\n A[a]=1\r\nfor b in input().split():\r\n try:\r\n B[b]+=1\r\n except:\r\n B[b]=1\r\n A[b]-=1\r\nfor c in input().split():\r\n B[c]-=1\r\nfor m,n in A.items():\r\n if n:\r\n print(m)\r\nfor m,n in B.items():\r\n if n:\r\n print(m)\r\n", "input()\r\n\r\npri = sum(int(x) for x in input().split())\r\nsec = sum(int(x) for x in input().split())\r\nter = sum(int(x) for x in input().split())\r\n\r\nprint(pri - sec);\r\nprint(sec - ter);\r\n", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Fri Jul 9 23:41:02 2021\n\n@author: lcarv\n\"\"\"\n\nn = int(input())\nl1 = list(map(int,input().strip().split()))[:n]\nl2 = list(map(int,input().strip().split()))[:n-1]\nl3 = list(map(int,input().strip().split()))[:n-2]\nl1.sort()\nl2.sort()\nl3.sort()\n\nfirst = \"\"\nsecond = \"\"\n\nfor i in range(n-1):\n if l1[i] != l2[i]:\n first = l1[i]\n break\n \nif first == \"\":\n first = l1[n-1]\n \nfor j in range(n-2):\n if l2[j] != l3[j]:\n second = l2[j]\n break\n \nif second == \"\":\n second = l2[n-2]\n \nprint(first) \nprint(second)\n \n\n \n\n \n\n \t\t \t\t\t \t \t \t\t\t \t\t\t", "t=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nx1=a[0]\r\nx2=b[0]\r\nx3=c[0]\r\nfor i in range(1,len(a)):\r\n x1=x1^a[i]\r\nfor i in range(1,len(b)):\r\n x2=x2^b[i]\r\nprint(x1^x2)\r\nfor i in range(1,len(c)):\r\n x3=x3^c[i]\r\nprint(x3^x2)\r\n \r\n", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split())) \r\nd=Counter(a)\r\ntemp=Counter(a)\r\nfor i in b:\r\n d[i]-=1\r\n if(d[i]==0):\r\n del d[i]\r\nk=list(d.keys())[0]\r\nprint(k)\r\ntemp[k]-=1\r\nif(temp[k]==0):\r\n del temp[k]\r\n# print(temp)\r\nfor i in c:\r\n temp[i]-=1\r\n if(temp[i]==0):\r\n del temp[i]\r\nk=list(temp.keys())[0]\r\nprint(k)", "def solve(n, arr1, arr2, arr3):\r\n return [sum(arr1) - sum(arr2), sum(arr2) - sum(arr3)]\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n arr1 = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split()))\r\n arr3 = list(map(int, input().split()))\r\n s = solve(n, arr1, arr2, arr3)\r\n print(s[0])\r\n print(s[1])\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nerrorOne = sorted([int(x) for x in input().split()])\r\nerrorTwo = sorted([int(x) for x in input().split()])\r\nerrorThree = sorted([int(x) for x in input().split()])\r\n\r\ndef findDiff(n, array1, array2):\r\n found = False\r\n for i in range(n-1):\r\n if array1[i] != array2[i]:\r\n found = True\r\n return array1[i]\r\n if not found:\r\n return array1[n-1]\r\n\r\n\r\nprint(findDiff(n, errorOne, errorTwo))\r\nprint(findDiff(n-1, errorTwo, errorThree))\r\n", "n = int(input())\r\na = [int(x)for x in input().split()][:n]\r\ns = sum(a)\r\na1 = [int(x)for x in input().split()][:n-1]\r\ns1 = sum(a1)\r\na2 = [int(x)for x in input().split()][:n-2]\r\ns2 = sum(a2)\r\nprint(s-s1)\r\nprint(s1-s2)", "n=int(input())\r\narr1=[int(i) for i in input().split(\" \")]\r\narr2=[int(i) for i in input().split(\" \")]\r\narr3=[int(i) for i in input().split(\" \")]\r\nprint(sum(arr1)-sum(arr2))\r\nprint(sum(arr2)-sum(arr3))", "n = int(input())\r\narr1 = [int(i) for i in input().split()]\r\narr2 = [int(i) for i in input().split()]\r\narr3 = [int(i) for i in input().split()]\r\n\r\na=sum(arr1)\r\nb=sum(arr2)\r\nc=sum(arr3)\r\n\r\nprint(a-b)\r\nprint(b-c)", "n=int(input())\r\nl1=list(map(int, input().split()))\r\nl2=list(map(int, input().split()))\r\nl3=list(map(int, input().split()))\r\nl1.sort()\r\nl2.sort()\r\nl3.sort()\r\nflag1=0\r\nfor i in range(n-1):\r\n if(l1[i]!=l2[i]):\r\n print(l1[i])\r\n flag1=1\r\n break\r\nif(flag1==0):\r\n print(l1[-1])\r\nflag2=0\r\nfor j in range(n-2):\r\n if(l2[j]!=l3[j]):\r\n print(l2[j])\r\n flag2=1\r\n break\r\nif(flag2==0):\r\n print(l2[-1])", "s = int(input())\r\nn = list(map(int, input().split()))\r\nd = list(map(int, input().split()))\r\nk = list(map(int, input().split()))\r\n\r\ndiff1 = sum(n)-sum(d)\r\ndiff2 = sum(d)-sum(k)\r\n\r\nprint(diff1)\r\nprint(diff2)", "n = int(input())\r\nlst = list(map(int,input().split()))\r\nl = list(map(int,input().split()))\r\nl2 = list(map(int,input().split()))\r\nprint (sum(lst)-sum(l))\r\nprint (sum(l)-sum(l2))", "n=int(input())\r\nar=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\nk=list(map(int,input().split()))\r\nar.sort()\r\nz.sort()\r\nk.sort()\r\nm=True\r\nfor x in range(n-1):\r\n if ar[x]!=z[x]:\r\n print(ar[x])\r\n m=False\r\n break\r\nif m:\r\n print(ar[n-1])\r\nm=True\r\nfor x in range(n-2):\r\n if z[x]!=k[x]:\r\n print(z[x])\r\n m=False\r\n break\r\nif m:\r\n print(z[n-2])", "n = int(input())\r\nA = list(map(int,input().split(' ')))\r\nB = list(map(int,input().split(' ')))\r\nC = list(map(int,input().split(' ')))\r\nA.sort()\r\nB.sort()\r\nC.sort()\r\nfor i in range (0,len(A)):\r\n if i == len(A)-1:\r\n print(A[i])\r\n break\r\n elif A[i] == B[i]:\r\n continue\r\n else:\r\n print(A[i])\r\n break\r\nfor i in range (0,len(B)):\r\n if i == len(B)-1:\r\n print(B[i])\r\n break\r\n elif C[i] == B[i]:\r\n continue\r\n else:\r\n print(B[i])\r\n break", "errors = int(input())\nlista = []\nfor i in range(0,3):\n line = input().split(\" \")\n line = list(map(int, line))\n line.sort()\n lista.append(line)\n\nit = 1\nwhile it<3:\n it2 = 0\n notFound = True\n while notFound and (it2<(errors-it)):\n if (lista[it-1][it2] == lista[it][it2]):\n it2 += 1\n else:\n print(lista[it-1][it2])\n notFound = False\n if it2==(errors-it):\n print(lista[it-1][it2])\n it +=1\n\t\t \t\t\t \t \t \t\t \t \t\t \t \t\t \t \t", "n = int(input())\n\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\n\na.sort()\nb.sort()\nc.sort()\n\nflag = 1\nfor i in range(len(b)):\n if(b[i] != a[i]):\n flag = 0\n print(a[i])\n break\n\nif(flag==1):\n print(a[-1])\n\nflag = 1\nfor j in range(len(c)):\n if(c[j] != b[j]):\n print(b[j])\n flag = 9\n break \n\nif(flag==1):\n print(b[-1])\n\t \t \t \t \t \t \t \t\t \t \t\t", "from collections import Counter\r\nn=int(input())\r\na=list(map(int,input().strip().split()))\r\nb=list(map(int,input().strip().split()))\r\nc=list(map(int,input().strip().split()))\r\nd1=Counter(a)\r\nd2=Counter(b)\r\nd3=Counter(c)\r\nfor x in a:\r\n if d1[x]!=d2[x]:\r\n print(x)\r\n break\r\nfor x in a: \r\n if d2[x]!=d3[x]:\r\n print(x)\r\n break", "n = int(input())\nc1 = list(map(int ,input().split()))\nc2 = list(map(int ,input().split()))\nc3 = list(map(int ,input().split()))\n\na = sum(c1)\nb = sum(c2)\nc = sum(c3)\n\nprint(a-b)\nprint(b-c)", "n = int(input())\r\nar1 = sum(list(map(int,input().split())))\r\nar2 = sum(list(map(int,input().split())))\r\nar3 = sum(list(map(int,input().split())))\r\nprint( ar1-ar2)\r\nprint( ar2-ar3)", "_ = int(input())\r\nlist_skaitli_1 = [x for x in input().split()]\r\nlist_skaitli_2 = [x for x in input().split()]\r\nlist_skaitli_3 = [x for x in input().split()]\r\n\r\ndef meklet_iztrukstosos(list1,list2):\r\n list1.sort(key=None, reverse=False)\r\n list2.sort(key=None, reverse=False)\r\n atrasts = 0\r\n for i in range(len((list1))-1):\r\n if list1[i] != list2[i]:\r\n print(list1[i])\r\n atrasts = 1\r\n break\r\n if atrasts == 0:\r\n print(list1[-1])\r\nmeklet_iztrukstosos(list_skaitli_1,list_skaitli_2)\r\nmeklet_iztrukstosos(list_skaitli_2,list_skaitli_3)", "n,a,b,c=[sum(list(map(int,input().split(' ')))) for _ in range(4)]\r\nprint(a-b)\r\nprint(b-c)", "l = input()\r\ns1 = list(map(int, input().split()))\r\ns2 = list(map(int, input().split()))\r\ns3 = list(map(int, input().split()))\r\n\r\nprint(sum(s1) - sum(s2), '\\n', sum(s2) - sum(s3), sep = '')\r\n", "from collections import Counter\r\nn = input()\r\nfirst = Counter([int(x) for x in input().split()])\r\nsecond = Counter([int(x) for x in input().split()])\r\nthird = Counter([int(x) for x in input().split()])\r\n\r\nfor bug in first:\r\n if first[bug] != second[bug]:\r\n print(bug)\r\n break\r\nfor bug in second:\r\n if second[bug] != third[bug]:\r\n print(bug)\r\n break\r\n", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nl3 = list(map(int, input().split()))\r\n\r\n\r\nprint(sum(l1) - sum(l2))\r\nprint(sum(l2) - sum(l3))\r\n\r\n", "n = int(input())\na = sum(map(int, input().split()))\nb = sum(map(int, input().split()))\nc = sum(map(int, input().split()))\nprint(a - b)\nprint(b - c)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nprint(sum(a)-sum(b))\r\nprint(sum(b)-sum(c))\r\n", "n=int(input())\r\nlist1=sorted(list(map(int,input().split())))\r\nlist2=sorted(list(map(int,input().split())))\r\nlist3=sorted(list(map(int,input().split())))\r\ni=0;j=0\r\nwhile list1[i]==list2[i]:\r\n i+=1\r\n if i==n-1:\r\n break\r\nwhile list2[j]==list3[j]:\r\n j+=1\r\n if j==n-2:\r\n break\r\nprint(list1[i],list2[j],sep='\\n')", "input()\r\na = sum(list(map(int, input().split(' '))))\r\nb = sum(list(map(int, input().split(' '))))\r\nc = sum(list(map(int, input().split(' '))))\r\nprint(a - b)\r\nprint(b - c)\r\n \r\n\r\n \r\n \r\n\r\n\r\n \r\n", "n=int(input())\r\nlt=list(map(int,input().split()))\r\nar1=list(map(int,input().split()))\r\nar2=list(map(int,input().split()))\r\nprint(sum(lt)-sum(ar1))\r\nprint(sum(ar1)-sum(ar2))", "\r\nn=int(input())\r\nl1=list(map(int,input().split()))\r\nl2=list(map(int,input().split()))\r\nl3=list(map(int,input().split()))\r\n\r\na=sum(l1)\r\nb=sum(l2)\r\nc=sum(l3)\r\nprint(a-b)\r\nprint(b-c)\r\n\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\ns1=s2=s3=0\r\ne1=list(map(int,input().split()))\r\ne2=list(map(int,input().split()))\r\ne3=list(map(int,input().split()))\r\nfor i in e1:\r\n s1+=i\r\nfor i in e2:\r\n s2+=i \r\nfor i in e3:\r\n s3+=i\r\nprint(s1-s2)\r\nprint(s2-s3)", "def main():\r\n num_of_mistakes = int(input())\r\n mistakes_v1 = list(map(int, input().split()))\r\n mistakes_v2 = list(map(int, input().split()))\r\n mistakes_v3 = list(map(int, input().split()))\r\n answer = solution(num_of_mistakes, mistakes_v1, mistakes_v2, mistakes_v3)\r\n sw_ans(answer)\r\n\r\n\r\ndef solution(num_of_mistakes: int, mist_1: list, mist_2: list, mist_3: list) -> list:\r\n answers = list()\r\n count_1 = 1\r\n count_2 = 2\r\n mist_1.sort()\r\n mist_2.sort()\r\n mist_2.append(0)\r\n mist_3.sort()\r\n mist_3.append(0)\r\n mist_3.append(0)\r\n for i in range(num_of_mistakes):\r\n if mist_2[i] != mist_1[i] and count_1 == 1:\r\n answers.insert(0, mist_1[i])\r\n count_1 = 0\r\n if mist_3[i] != mist_2[i] and count_2 == 2:\r\n answers.append(mist_2[i])\r\n count_2 = 0\r\n return answers\r\n\r\n\r\ndef sw_ans(answer: list):\r\n print(*answer, sep='\\n')\r\n\r\n\r\nmain()\r\n", "t=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\ns=b[0]\r\nfor i in range(1,len(b)):\r\n s^=b[i]^c[i-1]\r\nd=a[0]\r\n \r\nfor i in range(1,len(a)):\r\n d^=a[i]^b[i-1]\r\nprint(d)\r\nprint(s)\r\n\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\n\r\nf, s = -1, -1\r\nfor i in range(n - 1):\r\n if a[i] != b[i]:\r\n f = a[i]\r\n break\r\nif f == -1:\r\n f = a[n - 1]\r\n\r\nfor i in range(n - 2):\r\n if b[i] != c[i]:\r\n s = b[i]\r\n break\r\nif s == -1:\r\n s = b[n - 2]\r\nprint(f)\r\nprint(s)", "n=int(input())\r\na=list(map(int,input().rstrip().split()))\r\nb=list(map(int,input().rstrip().split()))\r\nc=list(map(int,input().rstrip().split()))\r\naor=0\r\nbor=0\r\nfor i in a:\r\n aor=aor^i\r\nfor i in b:\r\n aor=aor^i\r\n bor=bor^i\r\nprint(aor)\r\nfor i in c:\r\n bor=bor^i\r\nprint(bor)", "n=int(input())\r\nx=sum(list(map(int,input().split())))\r\ny=sum(list(map(int,input().split())))\r\nz=sum(list(map(int,input().split())))\r\nprint(x-y,y-z)", "from collections import Counter\n_ = input()\nfirst, second, third = (Counter(input().split()) for x in range(3))\nprint(next((first-second).elements()))\nprint(next((second-third).elements()))\n", "n = int(input().strip())\r\na = sum(map(lambda i: int(i), input().strip().split(maxsplit=n-1)))\r\nb = sum(map(lambda i: int(i), input().strip().split(maxsplit=n-2)))\r\nc = sum(map(lambda i: int(i), input().strip().split(maxsplit=n-3)))\r\n\r\nprint(a-b)\r\nprint(b-c)\r\n", "from sys import stdin\r\n_, e1, e2, e3 = [sum(map(int, stdin.readline().split())) for _ in '1234']\r\nprint(e1 - e2, e2 - e3)", "a=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=list(map(int, input().split()))\r\nd= list(map(int, input().split()))\r\nprint(sum(b)-sum(c))\r\nprint(sum(c)-sum(d))\r\n", "a = int(input())\nb = list(map(int,input().split()))\nc = list(map(int,input().split()))\nd = list(map(int,input().split()))\nb1 = sum(b)\nc1 = sum(c)\nd1 = sum(d)\nprint(b1-c1)\nprint(c1-d1)", "n = int(input())\nl1 = (input().split(' '))\nl2 = (input().split(' '))\nl3 = (input().split(' '))\n\nl1 = [int(x) for x in l1];\nl2 = [int(x) for x in l2];\nl3 = [int(x) for x in l3];\n\n\n\nl1.sort()\nl2.sort()\nl3.sort()\nerror1 = l1[len(l1)-1]\nerror2 = l2[len(l2)-1]\n\nfor x in range(len(l2)):\n if(l1[x] != l2[x]):\n error1 = l1[x];\n break;\n\nfor y in range(len(l3)):\n if(l2[y] != l3[y]):\n error2 = l2[y];\n break;\n\nprint(error1);\nprint(error2);\n\t \t \t\t \t \t\t \t\t\t \t \t", "def solve(A,B,n):\r\n A.sort() ; B.sort()\r\n for i in range(n-1):\r\n if A[i]!=B[i] : return(A[i])\r\n return(A[-1])\r\nn = int(input())\r\nA = list(map(int,input().split(\" \")))\r\nB = list(map(int,input().split(\" \")))\r\nC = list(map(int,input().split(\" \")))\r\nprint(solve(A,B,n))\r\nprint(solve(B,C,n-1))", "n = int(input())\r\na = sum([int(i) for i in input().split()])\r\nb = sum([int(i) for i in input().split()])\r\nc = sum([int(i) for i in input().split()])\r\nx = a - b\r\ny = b - c\r\nprint(x)\r\nprint(y)\r\n", "n = int(input())\r\na = list(int(num) for num in input().split())\r\nb = list(int(num) for num in input().split())\r\nc = list(int(num) for num in input().split())\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\n\r\ni = 0\r\nwhile i < n - 1 and b[i] == a[i]:\r\n i += 1\r\nprint(a[i])\r\n\r\nj = 0\r\nwhile j < n - 2 and c[j] == b[j]:\r\n j += 1\r\nprint(b[j])", "\ninpt = input()\n\nerro1 = 0\nfor j in [int(i) for i in input().split()]:\n erro1+=j\nerro2 = 0\nfor k in [int(i) for i in input().split()]:\n erro2+=k\nerro3 = 0\nfor p in [int(i) for i in input().split()]:\n erro3+=p\n\nsol2 = erro2-erro3\nsol1 = erro1-erro2\n\nprint(sol1)\nprint(sol2)\n \t \t\t\t \t\t \t\t\t \t \t \t \t\t\t\t \t", "import sys\r\n \r\ndef MI(): return map(int, sys.stdin.readline().strip().split())\r\ndef LI(): return list(map(int, sys.stdin.readline().strip().split()))\r\n\r\ndef solve(a,b):\r\n for i in range(len(b)):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n return \r\n\r\ndef main():\r\n n = int(input())\r\n a = [-1]+sorted(LI())+[10e10]\r\n b = [-1]+sorted(LI())+[10e10]\r\n c = [-1]+sorted(LI())+[10e10]\r\n solve(a,b)\r\n solve(b,c)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\ndef check(a, b):\r\n dictB = {}\r\n for i in b:\r\n if i not in dictB:\r\n dictB[i] = 1\r\n else:\r\n dictB[i] += 1 \r\n for i in a:\r\n if i in dictB and dictB[i] > 0:\r\n dictB[i] -= 1\r\n else:\r\n print(i)\r\n return\r\n\r\ncheck(a, b)\r\ncheck(b, c)", "import math\r\nfor m in range(1,2):\r\n n = int(input())\r\n arr1 = list(map(int, input().split()))\r\n arr2 = list(map(int, input().split())) \r\n arr3 = list(map(int, input().split())) \r\n sum1= sum(arr1)\r\n sum2= sum(arr2)\r\n sum3= sum(arr3)\r\n print(sum1-sum2)\r\n print(sum2-sum3)", "n = int(input())\r\nsum1, sum2, sum3 = 0, 0, 0\r\nl1 = (list(map(int, input().split())))\r\nl2 = (list(map(int, input().split())))\r\nl3 = (list(map(int, input().split())))\r\nfor i in l1:\r\n sum1 += i\r\nfor i in l2:\r\n sum2 += i\r\nfor i in l3:\r\n sum3 += i\r\nprint(sum1 - sum2)\r\nprint(sum2 - sum3)\r\n", "def main():\r\n n = int(input())\r\n a = sum([int(x) for x in input().split()])\r\n b = sum([int(x) for x in input().split()])\r\n c = sum([int(x) for x in input().split()])\r\n print(a - b)\r\n print(b - c)\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "n = int(input())\r\nS1 = ([int(_) for _ in input().split()])\r\nS2 = ([int(_) for _ in input().split()])\r\nS3 = ([int(_) for _ in input().split()])\r\nprint(sum(S1) - sum(S2))\r\nprint(sum(S2) - sum(S3))\r\n", "n = int(input())\r\nl1 = list(map(int, input().split()))\r\nl2 = list(map(int, input().split()))\r\nl3 = list(map(int, input().split()))\r\n\r\nfreq_l1 = {}\r\nfreq_l2 = {}\r\nfreq_l3 = {}\r\n\r\nfor obj in l1:\r\n freq_l1[obj] = freq_l1.get(obj, 0) + 1\r\n\r\nfor obj in l2:\r\n freq_l2[obj] = freq_l2.get(obj, 0) + 1\r\n\r\nfor obj in l3:\r\n freq_l3[obj] = freq_l3.get(obj, 0) + 1\r\n\r\nfaltante_b = 0\r\nfor obj in freq_l1:\r\n if obj not in freq_l2 or freq_l2[obj] < freq_l1[obj]:\r\n faltante_b = obj\r\n break\r\n\r\nfaltante_c = 0\r\nfor obj in freq_l2:\r\n if obj not in freq_l3 or freq_l3[obj] < freq_l2[obj]:\r\n faltante_c = obj\r\n break\r\n\r\nprint(faltante_b)\r\nprint(faltante_c)\r\n", "n = int(input())\n\ntotalAntigo = 0\nfor i in range(3):\n sequencia = str(input()).split()\n total = 0\n for a in sequencia:\n total += int(a)\n \n if i!=0:\n print(totalAntigo - total)\n totalAntigo = total\n\t\t \t \t \t \t \t \t \t \t\t \t \t \t", "n=int(input())\r\nl1,l2,l3=list(map(int,input().split())),list(map(int,input().split())),list(map(int,input().split()))\r\nprint(sum(l1)-sum(l2),sum(l2)-sum(l3),sep='\\n')", "arr = []\r\nn = input()\r\n\r\narr_a = list(map(int, input().split()))\r\n\r\narr_b = list(map(int, input().split()))\r\n\r\narr_c = list(map(int, input().split()))\r\n\r\ny = sum(arr_a) - sum(arr_b)\r\n\r\nx = sum(arr_b) - sum(arr_c)\r\n\r\nprint(y, '\\n', x)", "\r\n\r\na = int(input())\r\nlist1 = list(map(int, input().split()))\r\nlist2 = list(map(int, input().split()))\r\nlist3 = list(map(int, input().split()))\r\nsum1 = 0\r\nsum2 = 0\r\nlist1.sort()\r\nlist2.sort()\r\nlist3.sort()\r\nfor i in range(0, a):\r\n if i < len(list2):\r\n if(list1[i] != list2[i]):\r\n sum1 = list1[i]\r\n break\r\n else:\r\n sum1 = list1[i]\r\nfor i in range(0, a-1):\r\n if i < len(list3):\r\n if(list2[i] != list3[i]):\r\n sum2 = list2[i]\r\n break\r\n else:\r\n sum2 = list2[i]\r\nprint(sum1)\r\nprint(sum2)", "n=int(input())\nd=list(map(int,input().split()))\nd1=list(map(int,input().split()))\nd2=list(map(int,input().split()))\nd=sorted(d)\nd1=sorted(d1)\nd2=sorted(d2)\nfor i in range(0,n-1):\n if d[i]!=d1[i]:\n print(d[i])\n break\nelse:\n print(d[-1])\nfor i in range(0,n-2):\n if d1[i]!=d2[i]:\n print(d1[i])\n break\nelse:\n print(d1[-1])\n", "\r\n\r\nn=int(input())\r\na=[int(w) for w in input().split()]\r\nb=[int(w) for w in input().split()]\r\nc=[int(w) for w in input().split()]\r\nxa=a[0]\r\nfor i in range(1,n):\r\n xa = xa^a[i]\r\nxb=b[0]\r\nfor i in range(1,n-1):\r\n xb=xb^b[i]\r\nxc=c[0]\r\nfor i in range(1,n-2):\r\n xc=xc^c[i]\r\nprint(xa^xb)\r\nprint(xb^xc)", "#https://codeforces.com/problemset/problem/519/B\r\nn= int(input())\r\na = sum([int(x) for x in input().split()])\r\nb = sum([int(x) for x in input().split()])\r\nc = sum([int(x) for x in input().split()])\r\nprint(str(a-b) + \"\\n\" + str(b-c))", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\n\nsum_a = sum(a)\nsum_b = sum(b)\nsum_c = sum(c)\n\nprint(sum_a - sum_b)\nprint(sum_b - sum_c)\n\n \t\t\t\t\t\t \t \t \t\t \t \t \t\t", "n = int(input())\r\nfirst = list(sorted(list(map(int, input().split()))))\r\nsecond = list(sorted(list(map(int, input().split()))))\r\nthird = list(sorted(list(map(int, input().split()))))\r\ni = 0\r\nwhile(i < n-1 and second[i]==first[i]):\r\n i+=1\r\n\r\nprint(first[i])\r\ni = 0\r\nwhile(i < n-2 and second[i]==third[i]):\r\n i+=1\r\nprint(second[i])", "t = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\na1 = sum(a) - sum(b)\r\nb1 = sum(b) - sum(c)\r\nprint(a1)\r\nprint(b1)", "n = int(input())\nfirst_errors = sorted(input().split())\nsecond_errors = sorted(input().split())\nthird_errors = sorted(input().split())\n\ni = 0\nwhile i < n:\n if i >= n-1 or first_errors[i] != second_errors[i]:\n print(first_errors[i])\n break\n i+=1\n\ni = 0\nwhile i < n-1:\n if i >= n-2 or second_errors[i] != third_errors[i]:\n print(second_errors[i])\n break\n i+=1\n\n\t \t\t\t \t \t \t \t \t \t\t\t \t\t", "n,a,b,c=[sum(map(int,input().split()))for i in' '*4];print(a-b,b-c)", "n = int(input())\r\nlista1 = list(map(int, input().split(\" \")))\r\nlista2 = list(map(int, input().split(\" \")))\r\nlista3 = list(map(int, input().split(\" \")))\r\n\r\ndicionario1 = dict()\r\n\r\nfor i in lista1:\r\n if(i in dicionario1):\r\n dicionario1[i] += 1\r\n else:\r\n dicionario1[i] = 0\r\n\r\ndicionario2 = dict()\r\n\r\nfor j in lista2:\r\n if(j in dicionario2):\r\n dicionario2[j] += 1\r\n else:\r\n dicionario2[j] = 0\r\n\r\ndicionario3 = dict()\r\n\r\nfor k in lista3:\r\n if(k in dicionario3):\r\n dicionario3[k] += 1\r\n else:\r\n dicionario3[k] = 0\r\n\r\nfor key in dicionario1:\r\n if(key not in dicionario2):\r\n print(key)\r\n else:\r\n if(dicionario1[key] != dicionario2[key]):\r\n print(key)\r\n\r\nfor key1 in dicionario2:\r\n if(key1 not in dicionario3):\r\n print(key1)\r\n else:\r\n if(dicionario2[key1] != dicionario3[key1]):\r\n print(key1)", "n=int(input())\r\nl1=list(map(int,input().split(\" \")))\r\nl2=list(map(int,input().split(\" \")))\r\nl3=list(map(int,input().split(\" \")))\r\nprint(sum(l1)-sum(l2))\r\nprint(sum(l2)-sum(l3))", "R = lambda: list(map(int, input().split()))\r\n\r\nn = R()[0]\r\na, b, c = R(), R(), R()\r\nsums = [0, 0, 0]\r\nfor i in range(n):\r\n sums[0] += a[i]\r\n if i < (n - 1): sums[1] += b[i]\r\n if i < (n - 2): sums[2] += c[i]\r\n\r\nprint(sums[0] - sums[1])\r\nprint(sums[1] - sums[2])\r\n", "n = input()\nerrors1 = sum(map(int,input().split()))\nerrors2 = sum(map(int,input().split()))\nerrors3 = sum(map(int,input().split()))\n\nprint(errors1 - errors2, errors2 - errors3)\n\n\t\t \t \t\t\t \t \t \t\t\t\t\t \t\t", "n = int(input())\na = sum(int(i) for i in input().split())\nb = sum(int(i) for i in input().split())\nc = sum(int(i) for i in input().split())\nres = a - b, b - c\nprint(*res, sep=\"\\n\")\n", "n = int(input())\r\na = [int(i) for i in input().split()]\r\nb = [int(i) for i in input().split()]\r\nc = [int(i) for i in input().split()]\r\nprint(sum(a) - sum(b))\r\nprint(sum(b) - sum(c))", "\r\n\r\n\r\ndef main():\r\n n=int(input())\r\n a=list(map(int,input().split()))\r\n b=list(map(int,input().split()))\r\n c=list(map(int,input().split()))\r\n a.sort()\r\n b.sort()\r\n c.sort()\r\n # print(a)\r\n # print(b)\r\n # print(c)\r\n flag=True\r\n for i in range(n-1):\r\n if a[i]!=b[i]:\r\n print(a[i])\r\n flag=False\r\n break\r\n if flag==True:\r\n print(a[n-1])\r\n flag=True\r\n for i in range(n-2):\r\n if b[i]!=c[i]:\r\n print(b[i])\r\n flag=False\r\n break\r\n if flag==True:print(b[n-2])\r\n\r\n \r\n # q,w=0,0\r\n # for i in range(n):\r\n # if a[i] not in b:\r\n # q=a[i]\r\n # for i in range(n-1):\r\n # if b[i] not in c:\r\n # w=b[i]\r\n\r\nmain()", "from collections import Counter\nn = int(input())\n\nfirst = Counter(map(int, input().split()))\nsecond = Counter(map(int, input().split()))\nthird = Counter(map(int, input().split()))\n\nfor val in first:\n if val not in second or second[val] < first[val]:\n print(val)\n break;\n\nfor val in second:\n if val not in third or third[val] < second[val]:\n print(val, end = \" \")\n break;\n", "n = int(input())\r\nA = sum(map(int, input().split()))\r\nB = sum(map(int, input().split()))\r\nC = sum(map(int, input().split()))\r\n\r\n\r\nprint(A - B)\r\nprint(B - C)", "from math import gcd\nfrom functools import reduce\nfrom itertools import accumulate\nfrom typing import List\nimport bisect\nimport random\nfrom itertools import permutations, combinations\nfrom collections import Counter\n\n\ndef listAll(func, nums: list) -> bool:\n for x in nums:\n if not func(x):\n return False\n return True\n\n\ndef transformStrings(func) -> list:\n return list(map(func, readStrings()))\n\n\ndef getOrNone(iterable, index):\n if 0 <= index < len(iterable):\n return iterable[index]\n return None\n\n\ndef getOrDefault(iterable, index, default):\n if 0 <= index < len(iterable):\n return iterable[index]\n return default\n\n\ndef digitSum(num: int) -> int:\n numString = str(num)\n value = 0\n for x in numString:\n value += int(x)\n return value\n\n\ndef runningReduce(func, nums: list) -> list:\n values = nums.copy()\n for x in range(1, len(nums)):\n values[x] = func(values[x - 1], nums[x])\n return values\n\n\ndef lcm(a, b) -> int:\n return abs(a * b) // gcd(a, b)\n\n\ndef printList(nums: list):\n nums = list(map(lambda x: str(x), nums))\n print(\" \".join(nums))\n\n\ndef readStrings() -> List[str]:\n return input().split(\" \")\n\n\ndef readInt() -> int:\n return int(input())\n\n\ndef readInts() -> List[int]:\n return list(map(lambda x: int(x), readStrings()))\n\n\ndef readOtherNumericTypes(func) -> list:\n return list(map(func, readStrings()))\n\n\ndef isEven(num: int) -> bool:\n return num % 2 == 0\n\n\ndef isPositive(num: int) -> bool:\n return num > 0\n\n\ndef isPositiveOrZero(num: int) -> bool:\n return isPositive(num) or num == 0\n\n\ndef digits(num: int) -> int:\n return len(str(num))\n\n\ndef firstDigit(num: int) -> int:\n return int(str(num)[0])\n\ninput()\nfirstTime = readInts()\nfirstTimeMap = Counter(firstTime)\nsecondTime = readInts()\nsecondTimeMap = Counter(secondTime)\nthirdTime = readInts()\nthirdTimeMap = Counter(thirdTime)\nfirstAnswer = 0\nsecondAnswer = 0\nfor x in range(len(firstTime)):\n if firstAnswer != 0 and secondAnswer != 0:\n break\n if not secondTimeMap.__contains__(firstTime[x]):\n firstAnswer = firstTime[x]\n else:\n if secondTimeMap[firstTime[x]] < firstTimeMap[firstTime[x]]:\n firstAnswer = firstTime[x]\n if x < len(firstTime) - 1:\n if not thirdTimeMap.__contains__(secondTime[x]):\n secondAnswer = secondTime[x]\n else:\n if thirdTimeMap[secondTime[x]] < secondTimeMap[secondTime[x]]:\n secondAnswer = secondTime[x]\nprint(firstAnswer)\nprint(secondAnswer)\n\t\t \t\t \t \t \t\t\t \t\t\t\t", "n = int(input())\r\nsum1,sum2,sum3=0,0,0\r\narr = [int(x) for x in input().split()]\r\nfor i in arr:\r\n sum1+=i\r\narr = [int(x) for x in input().split()]\r\nfor i in arr:\r\n sum2+=i\r\narr = [int(x) for x in input().split()]\r\nfor i in arr:\r\n sum3 += i\r\n\r\nprint(sum1-sum2)\r\nprint(sum2-sum3)\r\n", "n = int(input())\r\nlst1 = sorted(list(map(int, input().strip().split())))\r\nlst2 = sorted(list(map(int, input().strip().split())))\r\nlst2.append(-1)\r\nlst3 = sorted(list(map(int, input().strip().split())))\r\nlst3.append(-1)\r\nfor i in range(len(lst2)):\r\n\tif (lst1[i] != lst2[i]):\r\n\t\tprint(lst1[i])\r\n\t\tbreak\r\nfor i in range(len(lst3)):\r\n\tif (lst2[i] != lst3[i]):\r\n\t\tprint(lst2[i])\r\n\t\tbreak", "if __name__ == \"__main__\":\r\n input()\r\n a, b, c = [sum(map(int,input().split())) for i in range(3)]\r\n \r\n print(a - b)\r\n print(b - c)\r\n", "from collections import Counter\r\ndef solve():\r\n n=int(input())\r\n d1=Counter(list(map(int,input().split())))\r\n d2=Counter(list(map(int,input().split())))\r\n d3=Counter(list(map(int,input().split())))\r\n for i in d1:\r\n if i not in d2 or d1[i]>d2[i]:print(i);e=i;break\r\n \r\n for i in d1:\r\n if (i not in d3 and i!=e) or (d1[i]>d3[i] and i!=e):print(i);break\r\n else:print(e)\r\nsolve()\r\n#for _ in range(int(input())):solve()", "i = int(input())\r\na = sorted(list(map(int,input().split())))\r\nb = sorted(list(map(int,input().split())))\r\nc = sorted(list(map(int,input().split())))\r\nprint(sum(a)-sum(b)); print(sum(b)-sum(c))", "from collections import deque, defaultdict, Counter\r\nfrom itertools import product, groupby, permutations, combinations, accumulate\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\ns = input()\r\narr1 = sorted(map(int, input().split()))\r\narr2 = sorted(map(int, input().split()))\r\narr3 = sorted(map(int, input().split()))\r\narr2.append(10**10)\r\nfor i, j in zip(arr1, arr2):\r\n if i != j:\r\n print(i)\r\n break\r\narr2.pop()\r\narr3.append(10**10)\r\nfor i, j in zip(arr2, arr3):\r\n if i != j:\r\n print(i)\r\n break", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nsa=a\r\nb=sorted(list(map(int,input().split())))\r\nsb=b\r\nc=sorted(list(map(int,input().split())))\r\n\r\n# print(a,b,c)\r\n\r\nfor i in range(n-1):\r\n sa.remove(b[i])\r\nfor i in range(n-2):\r\n sb.remove(c[i])\r\n\r\nprint(sa[0])\r\nprint(sb[0])\r\n", "n=int(input())\r\n# from math import comb\r\nfrom collections import Counter\r\n# import math\r\n# import sys\r\n# for i in range(int(input())):\r\n# n,m=map(int,input().split())\r\n# matrix=[list(map(int,input().split())) for i in range(m)]\r\n# arr=list(map(int,input().split()))\r\narr=[list(map(int,input().split())) for i in range(3)]\r\nprint(sum(arr[0])-sum(arr[1]))\r\nprint(sum(arr[1])-sum(arr[2]))", "z=lambda:sum(map(int,input().split()));\r\nz();\r\nx=z();\r\nc=z();\r\nd=z();\r\nprint(x-c,c-d)", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nda, db, dc = {}, {}, {}\r\nfor x in a:\r\n da[x] = da[x]+1 if x in da else 1\r\nfor x in b:\r\n db[x] = db[x]+1 if x in db else 1\r\nfor x in c:\r\n dc[x] = dc[x]+1 if x in dc else 1\r\nfor x in da:\r\n if x not in db or da[x]!=db[x]:\r\n print(x)\r\n break\r\nfor x in db:\r\n if x not in dc or db[x]!=dc[x]:\r\n print(x)\r\n break", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n A = sum(int(x) for x in stdin.readline().split())\r\n B = sum(int(x) for x in stdin.readline().split())\r\n C = sum(int(x) for x in stdin.readline().split())\r\n\r\n print(A - B)\r\n print(B - C)\r\n\r\n\r\nsolve()\r\n", "n=input()\n\na=list(input().split(' '))\nb=list(input().split(' '))\nc=list(input().split(' '))\n\na.sort()\nb.sort()\nc.sort()\n\nfor i in range(len(a)):\n if(len(a)-1 == i or a[i]!=b[i]):\n print(a[i])\n break\n\n\nfor j in range(len(b)):\n if(len(b)-1 == j or b[j]!=c[j]):\n print(b[j])\n break\n\t \t \t\t\t \t \t \t\t \t\t\t \t\t\t\t\t", "n = input()\r\nn = int(n)\r\nx = 0\r\nl = []\r\nwhile x < 3:\r\n x += 1\r\n a = list(map(int, input().strip().split()))\r\n l.append(a)\r\ns1 = sum(l[0])\r\ns2 = sum(l[1])\r\ns3 = sum(l[2])\r\nprint(s1-s2)\r\nprint(s2-s3)", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nx=0\r\ny=0\r\nz=0\r\nfor i in a:\r\n x+=i \r\nfor i in b:\r\n y+=i \r\nfor i in c:\r\n z+=i \r\nprint(abs(x-y))\r\nprint(abs(y-z))", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nb.append(10 ** 10)\nc = list(map(int, input().split()))\nc.append(10 ** 10)\nc.append(10 ** 10)\na = sorted(a)\nb = sorted(b)\nc = sorted(c)\nfor i in range(n):\n if a[i] != b[i]:\n print(a[i])\n break\nfor j in range(n):\n if b[j] != c[j]:\n print(b[j])\n break\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\nn = int(input())\r\nl1 = sum(getints())\r\nl2 = sum(getints())\r\nl3 = sum(getints())\r\nprint(l1-l2)\r\nprint(l2-l3)", "# 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\nimport 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\n\r\nn = int(input())\r\na = collections.Counter(input().split()) \r\nb = collections.Counter(input().split())\r\nc = collections.Counter(input().split())\r\na.subtract(b)\r\nb.subtract(c)\r\nprint(a.most_common(1)[0][0], b.most_common(1)[0][0], sep='\\n')\r\n", "from sys import *\r\nfrom math import *\r\nfrom sys import stdin,stdout\r\nfrom collections import *\r\n\r\nint_arr = lambda : list(map(int,stdin.readline().strip().split()))\r\nstr_arr = lambda :list(map(str,stdin.readline().split()))\r\nget_str = lambda : map(str,stdin.readline().strip().split())\r\nget_int = lambda: map(int,stdin.readline().strip().split())\r\nget_float = lambda : map(float,stdin.readline().strip().split())\r\n\r\n\r\nmod = 1000000007\r\nsetrecursionlimit(1000)\r\n\r\ndef ans(n,a,b,c):\r\n frst = sum(a) - sum(b)\r\n scnd = sum(b) - sum(c)\r\n print(frst)\r\n print(scnd)\r\n\r\n\r\n\r\n\r\n \r\n\r\n\r\n\r\n#for _ in range(int(input())):\r\nn = int(input())\r\na = int_arr()\r\nb = int_arr()\r\nc = int_arr()\r\nans(n,a,b,c)\r\n", "def get_freq(l, d={}):\n\tfor i in range(len(l)):\n\t\tif l[i] in d:\n\t\t\td[l[i]] += 1\n\t\t\n\t\telse:\n\t\t\td[l[i]] = 1\n\ndef diferenca(d1, d2):\n\tfor k in d1:\n\t\tif k not in d2:\n\t\t\tprint(k)\n\t\t\t\n\t\telse:\n\t\t\tif d1[k]-1 == d2[k]:\n\t\t\t\tprint(k)\t\n\t\nn = int(input())\n\nfreq1 = {}\nfreq2 = {}\nfreq3 = {}\n\nerrors1 = list(map(int, input().split()))\nerrors2 = list(map(int, input().split()))\nerrors3 = list(map(int, input().split()))\n\nget_freq(errors1, freq1)\nget_freq(errors2, freq2)\nget_freq(errors3, freq3)\n\ndiferenca(freq1, freq2)\ndiferenca(freq2, freq3)\n\n \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\nlist2 = list(map(int,input().split()))\r\nlist3 = list(map(int,input().split()))\r\nsum1 = sum(list1)\r\nsum2 =sum(list2)\r\nsum3=sum(list3)\r\nprint(sum1-sum2)\r\nprint(sum2-sum3)\r\n", "input()\r\na = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\na3 = list(map(int, input().split()))\r\n\r\na.sort()\r\na2.sort()\r\na3.sort()\r\n\r\nv3 = []\r\nv2 = []\r\n\r\nfor i in a2:\r\n v2.append(i)\r\n\r\nfor i in a:\r\n if i not in v2:\r\n print(i)\r\n else:\r\n v2.remove(i)\r\nfor i in a2:\r\n if i not in a3:\r\n print(i)\r\n else:\r\n a3.remove(i)\r\n", "n = int(input())\r\na = list(input().split(' '))\r\nb = list(input().split(' '))\r\nc = list(input().split(' '))\r\n\r\na.sort()\r\nb.sort()\r\nc.sort()\r\n\r\nk = a[n-1]\r\nfor i in range(n-1):\r\n if(b[i]!=a[i]):\r\n k = a[i]\r\n break\r\nm = b[n-2]\r\nfor i in range(n-2):\r\n if(b[i]!=c[i]):\r\n m = b[i]\r\n break\r\nprint(k)\r\nprint(m)", "from collections import Counter\r\nn=int(input())\r\na=list(int(x) for x in input().split())\r\nb=list(int(x) for x in input().split())\r\nc=list(int(x) for x in input().split())\r\na_c=Counter(a)\r\nb_c=Counter(b)\r\nc_c=Counter(c)\r\nfor key,val in a_c.items():\r\n if key not in b_c or abs(val-b_c[key])==1:\r\n print(key)\r\n break\r\nfor key,val in b_c.items():\r\n if key not in c_c or abs(val-c_c[key])==1:\r\n print(key)\r\n break", "n=int(input())\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nd=e=f=0\r\nfor i in range(n):\r\n d+=a[i]\r\n if i!=n-1:\r\n e+=b[i]\r\n if i!=n-2:\r\n f+=c[i]\r\nprint(d-e)\r\nprint(e-f)\r\n\r\n", "a=int(input())\r\nb=map(int, input().split())\r\nc=map(int, input().split())\r\nd=map(int, input().split())\r\nx=(sum(b))\r\ny=(sum(c))\r\nz=(sum(d))\r\nprint(x-y)\r\nprint(y-z)", "def BinSearch(a, k):\n l = -1\n r = len(a)\n while l < r - 1:\n m = (l + r) // 2\n if a[m] <= k:\n l = m\n else:\n r = m\n return l\n\n\na = int(input())\nb1 = list(map(int, input().split()))\nb1.sort()\nb2 = list(map(int, input().split()))\nb2.sort()\nb22 = b2[:]\nb3 = list(map(int, input().split()))\nb3.sort()\n\nfor i in range(a):\n x = BinSearch(b2, b1[i])\n if x == -1 or b2[x] != b1[i]:\n print(b1[i])\n break\n b2[x] += 0.01\n\nfor j in range(a - 1):\n x = BinSearch(b3, b22[j])\n #print(b22[j], x)\n if x == -1 or b3[x] != b22[j]:\n print(b22[j])\n break\n b3[x] += 0.01", "from collections import Counter\r\nn = int(input())\r\nm = Counter(list(map(int, input().split())))\r\nk = Counter(list(map(int, input().split())))\r\nt = Counter(list(map(int, input().split())))\r\nc = m - k \r\nll = list(c.elements())\r\nprint(ll[0])\r\nb = k - t\r\nlll = list(b.elements())\r\nprint(lll[0]) \r\n\r\n\r\n\r\n \r\n", "from collections import Counter\r\n\r\n\r\ndef solve():\r\n n = int(input())\r\n a = Counter([int(i) for i in input().split()])\r\n b = Counter([int(i) for i in input().split()])\r\n c = Counter([int(i) for i in input().split()])\r\n for k in a.keys():\r\n if k not in b or b[k] != a[k]:\r\n print(k)\r\n break\r\n for k in b.keys():\r\n if k not in c or c[k] != b[k]:\r\n print(k)\r\n break\r\n\r\n\r\nsolve()", "n = int(input())\r\nl = []\r\nl2 = []\r\nl3 = []\r\ntemp = input()\r\ntemp = temp.split()\r\nfor i in temp:\r\n l.append(int(i))\r\nl.sort()\r\ntemp = input()\r\ntemp = temp.split()\r\nfor i in temp:\r\n l2.append(int(i))\r\nl2.sort()\r\ntemp = input()\r\ntemp = temp.split()\r\nfor i in temp:\r\n l3.append(int(i))\r\nl3.sort()\r\n\r\n\r\nfor i in range(len(l)):\r\n if len(l2) != i:\r\n if l[i] != l2[i]:\r\n print(l[i])\r\n break\r\n else:\r\n print(l[i])\r\n \r\nfor i in range(len(l2)):\r\n if len(l3) != i:\r\n if l2[i] != l3[i]:\r\n print(l2[i])\r\n break\r\n else:\r\n print(l2[i])", "input()\r\na=[sorted([int(i)for i in input().split()])for i in range(3)]\r\nfor i in range(2):\r\n for x,y in zip(a[i],a[i+1]):\r\n if x!=y: print(x);break\r\n else: print(a[i][-1])", "t = int(input())\r\na, b, c = [sum(map(int, input().split())) for i in range(3)]\r\nprint(str(a - b) + '\\n' + str(b - c))", "from collections import Counter\n\nn = int(input())\n\narr1 = Counter(map(int, input().split()))\narr2 = Counter(map(int, input().split()))\narr3 = Counter(map(int, input().split()))\n\nprint(*(arr1-arr2).keys())\nprint(*(arr2-arr3).keys())", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Thu Apr 13 00:46:31 2023\r\n\r\n@author: Srusty Sahoo\r\n\"\"\"\r\n\r\nn=int(input())\r\narr1=list(map(int,input().split()))\r\narr2=list(map(int,input().split()))\r\narr3=list(map(int,input().split()))\r\ne1=sum(arr1)-sum(arr2)\r\ne2=sum(arr2)-sum(arr3)\r\nprint(e1)\r\nprint(e2)", "from collections import Counter\r\n\r\n\r\ndef main():\r\n _ = input()\r\n\r\n first_errors = [int(i) for i in input().split()]\r\n second_errors = [int(i) for i in input().split()]\r\n third_errors = [int(i) for i in input().split()]\r\n\r\n print(next((Counter(first_errors) - Counter(second_errors)).elements()))\r\n print(next((Counter(second_errors) - Counter(third_errors)).elements()))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "from collections import Counter\n\nn = int(input())\ns1 = Counter(map(int, input().split()))\ns2 = Counter(map(int, input().split()))\ns3 = Counter(map(int, input().split()))\nprint(list(s1 - s2).pop())\nprint(list(s2 - s3).pop())\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nf1=0\r\nfor i in range(len(b)):\r\n if a[i]!=b[i]:\r\n print(a[i])\r\n f1=1\r\n break\r\nif not f1:\r\n print(a[len(a)-1])\r\n\r\nf1=0\r\nfor i in range(len(c)):\r\n if c[i]!=b[i]:\r\n print(b[i])\r\n f1=1\r\n break\r\nif not f1:\r\n print(b[len(b)-1])\r\n", "n = int(input())\r\na = set()\r\nb = set()\r\nc = set()\r\n\r\n\r\ninp = [int(s) for s in input().split()]\r\nsum = 0\r\nfor elem in inp:\r\n sum += elem\r\ninp = [int(s) for s in input().split()]\r\nprevSum = sum\r\nsum = 0\r\nfor elem in inp:\r\n sum += elem\r\nfirst = prevSum - sum\r\nprevSum = sum\r\nsum = 0\r\ninp = [int(s) for s in input().split()]\r\nfor elem in inp:\r\n sum += elem\r\nsecond = prevSum - sum\r\n\r\nprint(first)\r\nprint(second)", "from collections import Counter\r\ninput()\r\na,b,c = Counter(list(map(int,input().split()))), Counter(list(map(int,input().split()))), Counter(list(map(int,input().split())))\r\nfor k in a.keys():\r\n try:\r\n if a[k] > b[k]:\r\n a[k] -= 1\r\n print(k)\r\n break\r\n except KeyError:\r\n print(k)\r\n break\r\nfor k in a.keys():\r\n try:\r\n if a[k] > c[k]:\r\n print(k)\r\n break\r\n except KeyError:\r\n print(k)\r\n break", "from collections import Counter\r\n\r\nn = int(input())\r\nls1 = input().split()\r\nls2 = input().split()\r\nls3 = input().split()\r\n\r\nprint(min((Counter(ls1) - Counter(ls2)).elements()))\r\nprint(min((Counter(ls2) - Counter(ls3)).elements()))", "n = int(input())\r\nerr = list(map(int, input().split()))\r\none = list(map(int, input().split()))\r\ntwo = list(map(int, input().split()))\r\n\r\nprint(sum(err)-sum(one))\r\nprint(sum(one)-sum(two))", "n = int(input())\r\nvod = list(sorted(map(int, input().split())))\r\nfor _ in range(2):\r\n sor = list(sorted(map(int, input().split())))\r\n for i in range(len(vod)):\r\n if i == len(vod)-1:\r\n print(vod[i])\r\n elif vod[i] != sor[i]:\r\n print(vod[i])\r\n break\r\n else:\r\n continue\r\n vod = sor\r\n", "a = int(input())\r\n\r\nFirstList = list(map(int, input().split()))\r\n\r\nSecondList = list(map(int, input().split()))\r\n\r\nThirdList = list(map(int, input().split()))\r\n\r\nFirstList.sort()\r\nSecondList.sort()\r\nThirdList.sort()\r\n\r\nx = 0\r\n\r\nfor i in range(0, a-1):\r\n if FirstList[i] != SecondList[i]:\r\n FirstNum = FirstList[i]\r\n x = 0\r\n break\r\n else:\r\n x = 1\r\nif x == 1:\r\n FirstNum = FirstList[-1]\r\nx = 0\r\nfor i in range(0, a-2):\r\n if SecondList[i] != ThirdList[i]:\r\n SecondNum = SecondList[i]\r\n x = 0\r\n break\r\n else:\r\n x = 1\r\nif x == 1:\r\n SecondNum = SecondList[-1]\r\n\r\nprint(FirstNum)\r\nprint(SecondNum)", "n= int(input())\r\narr=list(map(int,input().rstrip().split()))\r\narr1=list(map(int,input().rstrip().split()))\r\narr2=list(map(int,input().rstrip().split()))\r\n\r\nprint(sum(arr)-sum(arr1))\r\nprint(sum(arr1)-sum(arr2))", "n = int(input())\n\na = [0] * n\nb = [0] * n\nc = [0] * n\n\nentrada_1 = input()\nentrada_2 = input()\nentrada_3 = input()\nentrada_1 = entrada_1.split(\" \")\nentrada_2 = entrada_2.split(\" \")\nentrada_3 = entrada_3.split(\" \")\nfor i in range(len(entrada_1)):\n a[i] = int(entrada_1[i])\nfor i in range(len(entrada_2)):\n b[i] = int(entrada_2[i])\nfor i in range(len(entrada_3)):\n c[i] = int(entrada_3[i])\n\na.sort(reverse=True)\nb.sort(reverse=True)\nc.sort(reverse=True)\n\nfor i in range(n):\n if a[i] != b[i]:\n print(a[i])\n break\nfor i in range(n-1):\n if c[i] != b[i]:\n print(b[i])\n break\n \t\t \t \t \t\t\t\t\t \t \t\t \t \t \t", "def sum_():\r\n return sum(list(map(int, input().split())))\r\n\r\n\r\nsum_()\r\nn = sum_()\r\ns = sum_()\r\nf = sum_()\r\n\r\nprint(n - s)\r\nprint(s - f)\r\n", "import sys\r\nfrom os import path\r\nif (path.exists('input.txt')):\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt','w')\r\n\r\nn = int(input())\r\narr1 = [int(x) for x in input().split()]\r\narr2 = [int(y) for y in input().split()]\r\narr3 = [int(z) for z in input().split()]\r\n\r\narr1.sort()\r\narr2.sort()\r\narr3.sort()\r\n\r\nfor i in range (n):\r\n\tif i==n-1:\r\n\t\tprint(arr1[i])\r\n\telse:\r\n\t\tif arr1[i]!=arr2[i]:\r\n\t\t\tprint(arr1[i])\r\n\t\t\tbreak\r\n\r\nfor j in range (n-1):\r\n\tif j==n-2:\r\n\t\tprint(arr2[j])\r\n\telse:\r\n\t\tif arr2[j]!=arr3[j]:\r\n\t\t\tprint(arr2[j])\r\n\t\t\tbreak\r\n", "# https://codeforces.com/problemset/problem/519/B\r\n\r\nfrom collections import Counter\r\n\r\ninput()\r\na = Counter(map(int, input().split()))\r\nb = Counter(map(int, input().split()))\r\nc = Counter(map(int, input().split()))\r\nprint((a - b).most_common()[0][0])\r\nprint((b - c).most_common()[0][0])", "n,a,b,c = [sum(map(int,input().split())) for _ in ' '*4];\r\nprint(a-b,b-c)", "def main():\r\n n=int(input(\"\"))\r\n ans=[]\r\n for i in range(3):\r\n cop_err=input().split(\" \")\r\n for j in range(len(cop_err)):\r\n cop_err[j]=int(cop_err[j])\r\n ans.append(sum(cop_err))\r\n print(ans[0]-ans[1])\r\n print(ans[1]-ans[2])\r\n\r\nmain()\r\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nb = sorted(list(map(int, input().split())))\r\nc = sorted(list(map(int, input().split())))\r\nfor i in range(n - 1):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n break\r\nelse:\r\n print(a[n - 1])\r\nfor i in range(n - 2):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n break\r\nelse:\r\n print(b[n - 2])\r\n", "n = int(input())\r\nmas1 = [int(i) for i in input().split()]\r\nmas2 = [int(i) for i in input().split()]\r\nmas3 = [int(i) for i in input().split()]\r\na, b, c = sum(mas1), sum(mas2), sum(mas3)\r\nprint(a - b)\r\nprint( b - c)", "n = int(input())\r\n\r\nlst = list(map(int, input().rstrip().split()))\r\n\r\nlst_wo1 = list(map(int, input().rstrip().split()))\r\n\r\nlst_wo2 = list(map(int, input().rstrip().split()))\r\n\r\nlst.sort()\r\nlst_wo1.sort()\r\nlst_wo2.sort()\r\n\r\nfor i in range(n):\r\n if i < n - 1:\r\n if lst[i] != lst_wo1[i]:\r\n print(lst[i])\r\n break\r\nelse:\r\n print(lst[-1])\r\n\r\nfor i in range(len(lst_wo1)):\r\n if i < n - 2:\r\n if lst_wo1[i] != lst_wo2[i]:\r\n print(lst_wo1[i])\r\n break\r\nelse:\r\n print(lst_wo1[-1])\r\n\r\n", "n = int(input())\r\nfirst = sum(list(map(int, input().split())))\r\nsecond = sum(list(map(int, input().split())))\r\nthird = sum(list(map(int, input().split())))\r\nprint(first - second)\r\nprint(second - third)", "n = int(input())\r\ns1 = sum(list(map(int,input().split())))\r\ns2 = sum(list(map(int,input().split())))\r\ns3 = sum(list(map(int,input().split())))\r\nprint(s1-s2)\r\nprint(s2-s3)\r\n", "n=int(input())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=list(map(int, input().split()))\r\nprint(sum(a)-sum(b))\r\nprint(sum(b)-sum(c))\r\n\r\n\r\n", "\r\nl=int(input())\r\ns1=list(map(int,input().split()))\r\ns2=list(map(int,input().split()))\r\ns3=list(map(int,input().split()))\r\nprint(sum(s1)-sum(s2))\r\nprint(sum(s2)-sum(s3))", "n = int(input())\r\nalist = sorted(map(int, input().split()))\r\nblist = sorted(map(int, input().split()))\r\nclist = sorted(map(int, input().split()))\r\n\r\nanum = []\r\nfor i in range(n - 1):\r\n if alist[i] != blist[i]:\r\n anum.append(alist[i])\r\n break\r\nif len(anum) == 0:\r\n anum.append(alist[-1])\r\n\r\nfor i in range(n - 2):\r\n if blist[i] != clist[i]:\r\n anum.append(blist[i])\r\n break\r\n\r\nif len(anum) == 1:\r\n anum.append(blist[-1])\r\n\r\nprint(*anum, sep=\"\\n\")", "x,a = input(),[sum(map(int,input().split())) for i in range(3)]\r\nprint(a[0] - a[1],a[1] - a[2],sep = '\\n')", "from sys import stdin\r\n\r\n# https://codeforces.com/problemset/problem/519/B\r\n\r\ndef inp():\r\n\treturn stdin.readline().rstrip()\r\n\r\ndef iinp():\r\n\treturn int(inp())\r\n\r\ndef mp():\r\n\treturn map(int, inp().split())\r\n\r\ndef liinp():\r\n\treturn list(mp())\r\n\r\nif __name__==\"__main__\":\r\n n = iinp()\r\n\r\n sum1 = sum(liinp())\r\n sum2 = sum(liinp())\r\n sum3 = sum(liinp())\r\n\r\n print(sum1-sum2) \r\n print(sum2-sum3)", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\na = sum(a)\r\nb= sum(b)\r\nc = sum(c)\r\n\r\nif a!=b:\r\n print(a-b)\r\nif b!=c:\r\n print(b-c)", "n = int(input())\r\nn1 = list(map(int,input().split()))\r\nn_1= list(map(int,input().split()))\r\nn_2= list(map(int,input().split()))\r\na = sum(n1) - sum(n_1)\r\nb = sum(n_1) - sum(n_2)\r\nprint(a,b,sep='\\n')\r\n", "n = int(input())\r\n\r\natemp = list(map(int, input().split()))\r\nbtemp = list(map(int, input().split()))\r\nctemp = list(map(int, input().split()))\r\na = {i: 0 for i in atemp}\r\nb = {i: 0 for i in btemp}\r\n\r\n\r\nfor i in atemp:\r\n a[i] += 1\r\nfor i in btemp:\r\n b[i] += 1\r\n a[i] -= 1\r\nfor i in ctemp:\r\n b[i] -= 1\r\nfor i, j in a.items():\r\n if j == 1:\r\n print(i)\r\nfor i, j in b.items():\r\n if j == 1:\r\n print(i)\r\n", "from collections import *\n\n\ndef f():\n _ = input()\n A = [int(s) for s in input().split(\" \")]\n B = [int(s) for s in input().split(\" \")]\n C = [int(s) for s in input().split(\" \")]\n\n a = Counter(A)\n b = Counter(B)\n c = Counter(C)\n\n first = None\n for key in a:\n if key not in b or a[key]-1 == b[key]:\n first = key\n break\n\n second = None\n for key in b:\n if key not in c or b[key]-1 == c[key]:\n second = key\n\n print(first)\n print(second)\n\n\nf()\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\nsum1 = 0 \r\nsum2 = 0\r\nfor i in a :\r\n sum1 += i\r\nfor i in b :\r\n sum2 += i\r\nprint (sum1 - sum2 )\r\nsum1 = 0 \r\nfor i in c :\r\n sum1 += i \r\nprint (sum2 - sum1 )\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [sum(list(map(int, input().split()))) for _ in range(3)]\r\nprint(a[0]-a[1])\r\nprint(a[1]-a[2])", "\r\ndef missingNo(a,b):\r\n for i in range(len(b)):\r\n if a[i]!=b[i]:\r\n return a[i]\r\n return a[-1]\r\n\r\nn=int(input())\r\na=list(map(int, input().split()))\r\nb=list(map(int, input().split()))\r\nc=list(map(int, input().split()))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nprint(missingNo(a, b))\r\nprint(missingNo(b, c))\r\n\r\n\r\n", "def find_number(arr1, arr2):\r\n check = 0\r\n for i in range(len(arr2)):\r\n if arr1[i] != arr2[i]:\r\n print(arr1[i])\r\n check = 1\r\n break\r\n if check == 0:\r\n print(arr1[-1])\r\n\r\ndef main():\r\n n = int(input())\r\n \r\n arr1 = list(map(int, input().split()))\r\n arr1.sort()\r\n \r\n arr2 = list(map(int, input().split()))\r\n arr2.sort()\r\n find_number(arr1, arr2)\r\n \r\n arr3 = list(map(int, input().split()))\r\n arr3.sort()\r\n find_number(arr2, arr3)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\ndical,dicfi,dicse = {},{},{}\nfor i in input().split():\n if i not in dical:dical[i]=1\n else:dical[i]+=1\nfor i in input().split():\n if i not in dicfi:dicfi[i]=1\n else:dicfi[i]+=1\nfor i in input().split():\n if i not in dicse:dicse[i]=1\n else:dicse[i]+=1\n\nfor key,item in dical.items():\n if (key not in dicfi) or (item != dicfi[key]):print(key);break\nfor key,item in dicfi.items():\n if (key not in dicse) or (item != dicse[key]):print(key);break\n\t\t\t\t \t\t \t \t\t \t\t\t \t \t\t", "n = int(input())\nfirst = list(map(lambda num: int(num), input().split(\" \")))\nsecond = list(map(lambda num: int(num), input().split(\" \")))\nthird = list(map(lambda num: int(num), input().split(\" \")))\n\nfirst.sort()\nsecond.sort()\nthird.sort()\n\nfor i in range(n):\n if i == n-1:\n print(first[n-1])\n elif first[i] != second[i]:\n print(first[i])\n break\n\nfor i in range(n-1):\n if i == n-2:\n print(second[n-2])\n elif second[i] != third[i]:\n print(second[i])\n break\n\n \t \t\t\t \t\t\t \t\t \t \t\t \t \t", "#from collections import defaultdict\n\nimport bisect\n\ndef find_le(a, x):\n 'Find rightmost value less than or equal to x'\n i = bisect.bisect_right(a, x)\n if i:\n return i-1\n return -1\n\n\n\nn=int(input())\nl1=list(map(int,input().split()))\nl2=list(map(int,input().split()))\nl3=list(map(int,input().split()))\nx1=0\nx2=0\nx3=0\nfor i in l1:\n x1^=i\nfor i in l2:\n x2^=i\nfor i in l3:\n x3^=i\nprint(x1^x2)\nprint(x2^x3)\n", "n, a, b, c = [sum(map(int,input().split())) for i in ' ' * 4]\r\nprint(a - b,b - c)\r\n", "n = int(input())\r\nar1 = list(map(int,input().split()))\r\nar2 = list(map(int,input().split()))\r\nar3 = list(map(int,input().split()))\r\no1 = sum(ar1)\r\no2 = sum(ar2)\r\no3 = sum(ar3)\r\nprint(o1 - o2)\r\nprint(o2 - o3)\r\n\r\n\r\n", "a=int(input())\r\nbug1=sum(list(map(int,input().split())))\r\nbug2=sum(list(map(int,input().split())))\r\nbug3=sum(list(map(int,input().split())))\r\nprint(bug1-bug2)\r\nprint(bug2-bug3)", "n=int(input())\r\nl1=sum(map(int,input().split()))\r\nl2=sum(map(int,input().split()))\r\nl3=sum(map(int,input().split()))\r\nprint(l1-l2,l2-l3)\r\n\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\tn = int(input())\r\n\ta = array_input(n)\r\n\tc_sum = sum(a)\r\n\tfor i in range(1,3):\r\n\t\ttemp = array_input(n-i)\r\n\t\tsums = sum(temp)\r\n\t\tprint(c_sum-sums)\r\n\t\tc_sum = sums\r\n\r\n\r\nif __name__ == '__main__':\r\n\tfor test in test_cases():\r\n\t\tmain()", "from collections import Counter\r\narr = []\r\narr2 = []\r\narr3 = []\r\nn = int(input())\r\narr = list(map(int,input().split()))\r\narr2 = list(map(int,input().split()))\r\narr3 = list(map(int,input().split()))\r\nlst1 = list((Counter(arr) - Counter(arr2)).elements())\r\ndiff = []\r\ndiff.append(lst1)\r\n#print(lst1)\r\nlst2 = list((Counter(arr2) - Counter(arr3)).elements())\r\ndiff.append(lst2)\r\n#print(lst2)\r\nflat_list = [item for sublist in diff for item in sublist]\r\nfor i in range(len(flat_list)):\r\n print (flat_list[i])", "n = int (input ()) #количество ошибок\r\n\r\na_1 = list (map (int, input ().split ()))\r\na_2 = list (map (int, input ().split ()))\r\na_3 = list (map (int, input ().split ()))\r\n\r\nprint (sum (a_1) - sum (a_2), sum (a_2) - sum (a_3), sep = '\\n')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\na = [int(x)for x in input().split()][:n]\r\na.sort()\r\na1 = [int(x)for x in input().split()][:n-1]\r\na1.sort()\r\na2 = [int(x)for x in input().split()][:n-2]\r\na2.sort()\r\n\r\nfor i in range(n-1):\r\n\tif a[i]!= a1[i]:\r\n\t\tprint(a[i])\r\n\t\tbreak\r\nelse:\r\n\tprint(a[-1])\r\n\t\t\r\nfor i in range(n-2):\r\n\tif a1[i]!= a2[i]:\r\n\t\tprint(a1[i])\r\n\t\tbreak\r\nelse:\r\n\tprint(a1[-1])", "a = int(input())\r\nb = list(map(int,input().split(\" \")))\r\nb.sort()\r\nc = list(map(int,input().split(\" \")))\r\nc.sort()\r\nd = list(map(int,input().split(\" \")))\r\nd.sort()\r\nfirst,second=0,0\r\nfor i in range(len(c)):\r\n if b[i] != c[i]:\r\n first = b[i]\r\n break\r\n\r\nif first == 0:\r\n first = b[-1]\r\n\r\nprint(first)\r\nfor i in range(len(d)):\r\n if c[i] != d[i]:\r\n second = c[i]\r\n break\r\n\r\nif second == 0:\r\n second = c[-1]\r\nprint(second)", "n = int(input())\n\ne1 = [int(e) for e in input().split()]\ne2 = [int(e) for e in input().split()]\ne3 = [int(e) for e in input().split()]\n\nprimeiro, segundo, terceiro = sum(e1), sum(e2), sum(e3)\n\nprint(abs(segundo - primeiro))\nprint(abs(terceiro - segundo))\n\n \t \t \t\t \t\t \t\t\t \t \t \t\t\t \t", "from sys import stdin\ninput = stdin.readline\n\n\ndef main(data) -> None:\n x = sum(data[0])\n y = sum(data[1])\n z = sum(data[2])\n print(x-y)\n print(y-z)\n\n\nif __name__ == \"__main__\":\n input()\n main([list(map(int, input().split())) for _ in range(3)])\n\n\t\t\t \t\t\t\t\t\t \t\t\t \t \t\t\t \t \t \t", "num = int(input())\n\naux1 = [0] * num\naux2 = [0] * num\naux3 = [0] * num\n\nlist1 = [int(x) for x in input().split()]\nlist2 = [int(x) for x in input().split()]\nlist3 = [int(x) for x in input().split()]\n\nfor i in range(len(list1)):\n aux1[i] = list1[i]\n\nfor i in range(len(list2)):\n aux2[i] = list2[i]\n\nfor i in range(len(list3)):\n aux3[i] = list3[i]\n\naux1.sort(reverse=True)\naux2.sort(reverse=True)\naux3.sort(reverse=True)\n\nfor i in range(num):\n if aux1[i] != aux2[i]:\n print(aux1[i])\n break\n\nfor i in range(num-1):\n if aux3[i] != aux2[i]:\n print(aux2[i])\n break\n \t\t \t \t \t\t \t \t \t \t \t\t \t\t", "\r\nif __name__ == \"__main__\":\r\n input()\r\n outputs = [sum([int (x) for x in input().split()]), sum([int (x) for x in input().split()]), sum([int (x) for x in input().split()])]\r\n errors = \"\"\r\n\r\n for _ in range(1, 3):\r\n errors+= str(outputs[_ - 1] - outputs[_]) + \"\\n\"\r\n \r\n print (errors)", "n = int(input())\r\n\r\nfirst = list(map(int, input().split()))\r\nsecond = list(map(int, input().split()))\r\nthird = list(map(int, input().split()))\r\n\r\nfirst.sort()\r\nsecond.sort()\r\nthird.sort()\r\n\r\nsecond.append(10 ** 10)\r\nfor i in range(n):\r\n if first[i] != second[i]:\r\n print(first[i])\r\n break\r\nsecond.pop(-1)\r\n\r\nthird.append(10 ** 10)\r\nfor i in range(n):\r\n if second[i] != third[i]:\r\n print(second[i])\r\n break", "def cleaner(la, lb):\n la.sort()\n lb.sort()\n for i, v in enumerate(la):\n if i < len(lb) and lb[i] != v:\n return v\n\n return la[-1]\n\n\nn = int(input())\nf = list(map(int, input().split()))\ns = list(map(int, input().split()))\nt = list(map(int, input().split()))\n\nprint(cleaner(f, s))\nprint(cleaner(s, t))\n\n\t\t\t\t \t \t \t\t \t\t \t\t\t\t\t\t \t", "def task():\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n b = list(map(int, input().split()))\r\n c = list(map(int, input().split()))\r\n a_sum = 0\r\n for i in a:\r\n a_sum += i\r\n b_sum = 0\r\n for i in b:\r\n b_sum += i\r\n c_sum = 0\r\n for i in c:\r\n c_sum += i\r\n print(a_sum - b_sum)\r\n print(b_sum - c_sum)\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n task()\r\n\r\n", "input()\r\n\r\nsoma_erros_1 = 0\r\nfor erro in list(map(int, input().split())):\r\n soma_erros_1 += erro\r\n\r\nsoma_erros_2 = 0\r\nfor erro in list(map(int, input().split())):\r\n soma_erros_2 += erro\r\n\r\nsoma_erros_3 = 0\r\nfor erro in list(map(int, input().split())):\r\n soma_erros_3 += erro\r\n\r\nerro_solucionado_1 = soma_erros_1 - soma_erros_2\r\nerro_solucionado_2 = soma_erros_2 - soma_erros_3\r\n\r\nprint(erro_solucionado_1)\r\nprint(erro_solucionado_2)\r\n", "def nm(s,ss):\r\n for j in range(n - i):\r\n if s[j] != ss[j]:\r\n return s[j]\r\n return s[-1]\r\nn,s = int(input()),tuple(sorted(map(int,input().split())))\r\nfor i in range(1,3):\r\n ss = tuple(sorted(map(int,input().split())))\r\n print(nm(s,ss))\r\n s = ss", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nj = 0\r\nfor i in range(n):\r\n if(j < n - 1 and a[i] == b[j]):\r\n j += 1\r\n else:\r\n print(a[i])\r\n c += [a[i]]\r\nj = 0\r\nc.sort()\r\nfor i in range(n):\r\n if(j < n - 1 and a[i] == c[j]):\r\n j += 1\r\n else:\r\n print(a[i])", "import sys\r\ndef readInputs():\r\n return map(int, sys.stdin.readline().strip().split())\r\n \r\nn = int(input())\r\n\r\narrList1 = list(readInputs())\r\narrList2 = list(readInputs())\r\narrList3 = list(readInputs())\r\n\r\nsumList1 = sum(arrList1)\r\nsumList2 = sum(arrList2)\r\nsumList3 = sum(arrList3)\r\n\r\nprint(sumList1 - sumList2)\r\nprint(sumList2 - sumList3)\r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sorted(map(int, input().split()))\r\nq = sorted(map(int, input().split())) + [0]\r\nfor i in range(n):\r\n if w[i] != q[i]:\r\n print(w[i])\r\n break\r\nw = sorted(map(int, input().split())) + [0]\r\nfor i in range(n-1):\r\n if q[i] != w[i]:\r\n print(q[i])\r\n break", "from sys import stdin, stdout\r\ninput = stdin.readline\r\n\r\nn = int(input()); f = 0; s = 0; t = 0\r\nfirst = [f := (f+int(i)) for i in input().split()]\r\nsecond = [s := (s+int(i)) for i in input().split()]\r\nthird = [t := (t+int(i)) for i in input().split()]\r\n\r\nprint(first[-1] - second[-1]); print(second[-1] - third[-1])", "n = int(input())\r\nnums = list(map(int, input().split()))\r\nfirst_compilation = list(map(int, input().split()))\r\nsecond_compilation = list(map(int, input().split()))\r\n\r\nprint(sum(nums)-sum(first_compilation))\r\nprint(sum(first_compilation)-sum(second_compilation))", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nsum_a = sum(a)\r\nsum_b = sum(b)\r\nsum_c = sum(c)\r\n\r\nprint(sum_a - sum_b)\r\nprint(sum_b - sum_c)\r\n", "# A and B and Compilation Errors\r\nn = int(input())\r\ns1 = input().split(\" \")\r\ns1 = sorted([int(i) for i in s1])\r\ns2 = input().split(\" \")\r\ns2 = sorted([int(i) for i in s2])\r\ns3 = input().split(\" \")\r\ns3 = sorted([int(i) for i in s3])\r\nflag12 = True\r\nflag23 = True\r\ni = 0\r\nwhile i in range(n-1):\r\n if s1[i] != s2[i]:\r\n flag12 = False\r\n break\r\n i += 1\r\nif flag12 == False:\r\n print(s1[i])\r\nelse:\r\n print(s1[-1])\r\ni = 0\r\nwhile i in range(n-2):\r\n if s2[i] != s3[i]:\r\n flag23 = False\r\n break\r\n i += 1\r\nif flag23 == False:\r\n print(s2[i])\r\nelse:\r\n print(s2[-1])", "def poly(n, a, b, c):\n f = s = 0\n a = sorted(a)\n b = sorted(b)\n c = sorted(c)\n for i in range(len(b)):\n if a[i] != b[i]:\n f = a[i]\n break\n else:\n f = a[len(a) - 1]\n for i in range(len(c)):\n if b[i] != c[i]:\n s = b[i]\n break\n else:\n s = b[len(b) - 1]\n print(f)\n print(s)\n \nn = int(input())\na = [int(i) for i in input().split()]\nb = [int(i) for i in input().split()]\nc = [int(i) for i in input().split()]\n \npoly(n, a, b, c)\n\t \t\t\t\t\t\t\t\t\t\t \t\t\t\t \t \t \t", "from collections import Counter\narr = []\narr2 = []\narr3 = []\nn = int(input())\narr = list(map(int,input().split()))\narr2 = list(map(int,input().split()))\narr3 = list(map(int,input().split()))\nlst1 = list((Counter(arr) - Counter(arr2)).elements())\ndiff = []\ndiff.append(lst1)\n#print(lst1)\nlst2 = list((Counter(arr2) - Counter(arr3)).elements())\ndiff.append(lst2)\n#print(lst2)\nflat_list = [item for sublist in diff for item in sublist]\nfor i in range(len(flat_list)):\n print (flat_list[i])\n\t\t \t \t\t\t\t\t\t\t \t \t\t\t\t\t \t\t\t\t\t\t", "n = int(input())\r\na1 = list(map(int, input().split()))\r\na2 = list(map(int, input().split()))\r\na3 = list(map(int, input().split()))\r\nprint(sum(a1) - sum(a2))\r\nprint(sum(a2) - sum(a3))", "from collections import Counter\r\ninput()\r\nsetA = sum(map(int,input().split()))\r\nsetB = sum(map(int,input().split()))\r\nsetC = sum(map(int,input().split()))\r\nprint(setA-setB)\r\nprint(setB-setC)", "N=int(input())\r\nE1=list(map(int,input().split()))\r\nE2=list(map(int,input().split()))\r\nE3=list(map(int,input().split()))\r\nFirst=sum(E1)-sum(E2)\r\nSecond=sum(E2)-sum(E3)\r\nprint(First)\r\nprint(Second)\r\n", "n=int(input())\r\nlist1=[int(x) for x in input().split()]\r\nlist2=[int(x) for x in input().split()]\r\nlist3=[int(x) for x in input().split()]\r\nans1,ans2,ans3=0,0,0\r\nfor i in range(n):\r\n ans1+=list1[i]\r\nfor i in range(n-1):\r\n ans2+=list2[i]\r\nfor i in range(n-2):\r\n ans3+=list3[i]\r\nprint(ans1-ans2)\r\nprint(ans2-ans3)\r\n ", "from collections import defaultdict\r\n\r\ndef solve(a, b, c):\r\n freq_a = defaultdict(lambda: 0)\r\n freq_b = defaultdict(lambda: 0)\r\n freq_c = defaultdict(lambda: 0)\r\n\r\n for e in a:\r\n freq_a[e] += 1\r\n\r\n for e in b:\r\n freq_b[e] += 1\r\n\r\n for e in c:\r\n freq_c[e] += 1\r\n\r\n\r\n for e in a:\r\n if freq_a[e] != freq_b[e]:\r\n print(e)\r\n break\r\n\r\n for e in b:\r\n if freq_b[e] != freq_c[e]:\r\n print(e)\r\n break\r\n\r\nn = input()\r\na = list(map(int, input().split(' ')))\r\nb = list(map(int, input().split(' ')))\r\nc = list(map(int, input().split(' ')))\r\n\r\nsolve(a,b,c)\r\n\r\n", "t=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\na=sorted([int(i) for i in input().split()])\r\nb=sorted([int(i) for i in input().split()])\r\nac=a.copy()\r\nfor i in l:\r\n if i not in a:\r\n print(i)\r\n break\r\n else:\r\n a.remove(i)\r\nfor i in ac:\r\n if i not in b:\r\n print(i)\r\n break\r\n else:\r\n b.remove(i)\r\n", "n = input()\r\n\r\ninitial_errors = [int(i) for i in input().split()]\r\nintermediate_errors = [int(i) for i in input().split()]\r\nfinal_errors = [int(i) for i in input().split()]\r\n\r\n\r\nintermediate_errors_sum = sum(intermediate_errors)\r\nprint(sum(initial_errors) - intermediate_errors_sum)\r\nprint(intermediate_errors_sum - sum(final_errors))", "from collections import Counter\r\nn=int(input())\r\nar1=list(map(int,input().split()))\r\nar2=list(map(int,input().split()))\r\nar3=list(map(int,input().split()))\r\nar11=Counter(ar1)\r\nar22=Counter(ar2)\r\nar33=Counter(ar3)\r\nfor i in ar1:\r\n if ar11[i]!=ar22[i]:\r\n print(i)\r\n break\r\nfor i in ar2:\r\n if ar22[i]!=ar33[i]:\r\n print(i)\r\n break\r\n", "n=input()\r\na=list(map(int,input().split()))\r\nb=list(map(int,input().split()))\r\nc=list(map(int,input().split()))\r\nx=sum(a)-sum(b)\r\ny=sum(b)-sum(c)\r\nprint(x)\r\nprint(y)", "#link : https://codeforces.com/problemset/problem/519/B\r\n#author : Mohamed Ibrahim\r\n\r\nn,a,b,c = [sum(map(int,input().split())) for _ in ' '*4];\r\nprint(a-b,b-c)", "n=int(input())\r\nd={}\r\nsum1=sum([int(x) for x in input().split()])\r\nsum2=sum([int(x) for x in input().split()])\r\nsum3=sum([int(x) for x in input().split()])\r\nprint(sum1-sum2)\r\nprint(sum2-sum3)", "a=int(input())\r\nt_1=[int(i) for i in input().split()]\r\nt_2=[int(i) for i in input().split()]\r\nt_3=[int(i) for i in input().split()]\r\nhandle_1=sum(t_1)\r\nhandle_2=sum(t_2)\r\nhandle_3=sum(t_3)\r\nprint(abs(handle_2-handle_1))\r\nprint(abs(handle_3-handle_2))\r\n\r\n\r\n# python submit karwade \r\n# jai python", "n=int(input())\r\nx=list(map(int,input().split()))\r\ny=list(map(int,input().split()))\r\nz=list(map(int,input().split()))\r\na=0\r\nfor i in range(0,len(x)):\r\n a=a^x[i]\r\nb=0\r\nfor i in range(0,len(y)):\r\n b=b^y[i]\r\nprint(a^b)\r\nc=0\r\nfor i in range(0,len(z)):\r\n c=c^z[i]\r\nprint(b^c)\r\n ", "n = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\ns1 = sum(a)\r\ns2 = sum(b)\r\ns3 = sum(c)\r\nprint(s1-s2)\r\nprint(s2-s3)\r\n", "n = int(input())\r\na = list(map(int,input().split()))\r\nb = list(map(int,input().split()))\r\nc = list(map(int,input().split()))\r\na.sort()\r\nb.sort()\r\nc.sort()\r\nfor i in range (n-1):\r\n if a[i]!=b[i]:\r\n print(a[i])\r\n break\r\n if i==n-2: print(a[n-1])\r\nfor i in range (n-2):\r\n if b[i]!=c[i]:\r\n print(b[i])\r\n break\r\n if i==n-3: print(b[n-2])\r\n\r\n\r\n\r\n", "from cmath import inf\r\nfrom re import L, T\r\nfrom telnetlib import TN3270E\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\ndef swap(arr, i,j):\r\n tmp = arr[i]\r\n arr[i] = arr[j]\r\n arr[j] = tmp\r\n\r\ndef perm(li,arr, curr_indx=0):\r\n if curr_indx==len(arr)-1:\r\n li.append(\"\".join(arr))\r\n for i in range(curr_indx,len(arr)):\r\n swap(arr,curr_indx,i)\r\n perm(li,arr,curr_indx+1)\r\n swap(arr,curr_indx,i)\r\n\r\nimport sys\r\ninput = sys.stdin.readline \r\nimport math\r\n###########################(CODE)#######################################\r\n# n compilation error: represented as +ve int\r\n#B==> fixes 2 mistakes \r\n# B is sure that he corrected 2 errors\r\n# he can't usnderstand compilation error disappeared\r\n# :compiler shows new order every time \r\n# if one error corrected, other error have no change\r\n#find error he corrected \r\n# 5\r\n# 1 5 8 123 7 corrected: 8\r\n# 123 7 5 1 corrected: 123\r\n# 5 1 7\r\n\r\nn = int(input())\r\ncompile = []\r\nfor i in range(3):\r\n debug = list(map(int, input().split()))\r\n debug = sorted(debug)\r\n compile.append(debug)\r\nans = []\r\nf = 0\r\nfor i in range(len(compile[1])):\r\n if compile[1][i]!=compile[0][i]:\r\n f = 1\r\n ans.append(compile[0][i])\r\n break \r\nif f == 0:\r\n ans.append(compile[0][-1])\r\nf = 0\r\nfor i in range(len(compile[2])):\r\n if compile[2][i]!=compile[1][i]:\r\n f = 1\r\n ans.append(compile[1][i])\r\n break \r\nif f == 0:\r\n ans.append(compile[1][-1])\r\n\r\nfor errors in ans:\r\n print(errors)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n#######################################################################", "n = int(input())\r\na = map(int, input().split())\r\nb = map(int, input().split())\r\nc = map(int, input().split())\r\nsuma = sum(a)\r\nsumb = sum(b)\r\nsumc = sum(c)\r\nprint(suma - sumb)\r\nprint(sumb - sumc)\r\n", "input()\r\nar1 = sum(map(int, input().split()))\r\nar2 = sum(map(int, input().split()))\r\nar3 = sum(map(int, input().split()))\r\nprint(ar1-ar2)\r\nprint(ar2-ar3)", "n = int(input())\r\na = list(sorted(map(int, input().split())))\r\nb = list(sorted(map(int, input().split())))\r\nc = list(sorted(map(int, input().split())))\r\nf = False\r\nfor i in range(len(b)):\r\n if a[i]!=b[i]:\r\n f = True\r\n print(a[i])\r\n break\r\n\r\nif not f:\r\n print(a[len(a)-1])\r\n\r\nf = False\r\nfor i in range(len(c)):\r\n if c[i]!=b[i]:\r\n f = True\r\n print(b[i])\r\n break\r\n\r\nif not f:\r\n print(b[len(b)-1])", "c = int(input())\r\n\r\nstar = list(int(i) for i in input().split())\r\nstar.sort()\r\ninp = [int(i) for i in input().split()]\r\ninp.sort()\r\ninp.append(\"&\")\r\nf = 0\r\nfor j in range(len(star)):\r\n if not inp[j] == star[j]:\r\n f = star[j]\r\n print(star[j])\r\n break\r\n\r\ninp = [int(i) for i in input().split()]\r\ninp.append(f)\r\ninp.sort()\r\ninp.append(\"&\")\r\nfor j in range(len(star)):\r\n if not inp[j] == star[j]:\r\n print(star[j])\r\n break\r\n", "N=input()\r\nA=list(map(int,input().split()))\r\nB=list(map(int,input().split()))\r\nC=list(map(int,input().split()))\r\nprint(sum(A)-sum(B))\r\nprint(sum(B)-sum(C))", "n=int(input())\r\nli1=sorted([int(x) for x in input().split()])\r\nli2=sorted([int(x) for x in input().split()])\r\nli3=sorted([int(x) for x in input().split()])\r\nfor i in range(n-1):\r\n a=False\r\n if li1[i]!=li2[i]:\r\n print(li1[i])\r\n a=True\r\n break\r\nif a==False:\r\n print(li1[-1])\r\nfor i in range(n-2):\r\n a=False\r\n if li2[i]!=li3[i]:\r\n print(li2[i])\r\n a=True\r\n break\r\nif a==False:\r\n print(li2[-1])", "from collections import Counter\r\nfrom sys import stdin\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n A = Counter(int(x) for x in stdin.readline().split())\r\n B = Counter(int(x) for x in stdin.readline().split())\r\n C = Counter(int(x) for x in stdin.readline().split())\r\n\r\n print((A - B).popitem()[0])\r\n print((B - C).popitem()[0])\r\n\r\n\r\nsolve()\r\n", "controle = int(input())\nprimeira = list(map(int, input().split()))\nsegunda = list(map(int, input().split())) \nsoma1 = 0\nsoma2 = 0\nfor a in range(len(primeira)):\n soma1 += primeira[a]\nfor b in segunda:\n soma2 +=b\nprint(soma1-soma2)\n\nterceira = list(map(int, input().split()))\nsoma3 = 0\nfor c in terceira:\n soma3 += c\nprint(soma2-soma3)\n\t \t \t\t \t\t \t \t \t\t \t \t\t\t \t\t\t", "from collections import Counter\n\nn = int(input())\nerr = Counter(input().split())\nerr1 = Counter(input().split())\nerr2 = Counter(input().split())\nprint(list((err - err1).keys())[0])\nprint(list((err1 - err2).keys())[0])\n\n\n \t \t \t\t \t \t \t\t\t \t\t\t \t \t\t", "n=input()\r\na=sum(map(int,input().split()))\r\nb=sum(map(int,input().split()))\r\nc=sum(map(int,input().split()))\r\nprint(a-b,b-c)", "n=int(input())\r\nl=sum(list(map(int,input().split())))\r\nl1=sum(list(map(int,input().split())))\r\nprint(l-l1)\r\nl2=sum(list(map(int,input().split())))\r\nprint(l1-l2)\r\n\r\n", "n = int(input()); l1 = list(map(int, input().split())); l2 = list(map(int, input().split())); l3 = list(map(int, input().split()))\r\nl1.sort(); l2.sort(); l3.sort()\r\ne1, e2 = l1[-1], l2[-1]\r\nfor i in range(n-1):\r\n if(l1[i] != l2[i]): e1 = l1[i]; break\r\nfor i in range(n-2):\r\n if(l2[i] != l3[i]): e2 = l2[i]; break\r\nprint(e1, e2, sep=\"\\n\")", "a = int(input())\r\nar = [int(i) for i in input().split()]\r\narm = {}\r\nfor i in range(a):\r\n if ar[i] in arm:\r\n arm[ar[i]] += 1\r\n else:\r\n arm[ar[i]] = 1\r\narm1 = arm.copy()\r\nfor i in input().split():\r\n temp = int(i)\r\n arm[temp] -= 1\r\ntemp1 = 0\r\nfor i in arm:\r\n if arm[i] == 1:\r\n print(i)\r\n temp1 = i\r\n\r\n\r\narm = arm1.copy()\r\narm[temp1] -= 1\r\nfor i in input().split():\r\n temp = int(i)\r\n arm[temp] -= 1\r\nfor i in arm:\r\n if arm[i] == 1:\r\n print(i)\r\n", "import random\r\ndef qsort(a):\r\n if len(a) <= 1:\r\n return(a)\r\n else:\r\n q = random.choice(a)\r\n l = []\r\n m = []\r\n r = []\r\n for i in a:\r\n if i > q:\r\n l.append(i)\r\n elif i < q:\r\n r.append(i)\r\n else:\r\n m.append(i)\r\n return(qsort(l) + m + qsort(r))\r\n\r\nn = int(input())\r\na = qsort(list(map(int, input().split())))\r\nb = qsort(list(map(int, input().split())))\r\nc = qsort(list(map(int, input().split())))\r\nflag = False\r\nflag1 = False\r\nfor i in range(len(b)):\r\n if a[i] != b[i]:\r\n print(a[i])\r\n flag = True\r\n break\r\nif flag == False:\r\n print(a[-1])\r\nfor i in range(len(c)):\r\n if b[i] != c[i]:\r\n print(b[i])\r\n flag1 = True\r\n break\r\nif flag1 == False:\r\n print(b[-1])\r\n", "n = int(input())\na = list(map(int, input().split()))\nb = list(map(int, input().split()))\nc = list(map(int, input().split()))\na.sort()\nb.sort()\nc.sort()\nans = 0\nfor i in range(len(a) - 1):\n if a[i] != b[i]:\n ans = a[i]\n break\nif ans == 0:\n print(a[-1])\nelse:\n print(ans)\nans = 0\nfor i in range(len(b) - 1):\n if b[i] != c[i]:\n ans = b[i]\n break\nif ans == 0:\n print(b[-1])\nelse:\n print(ans) \n ", "n=int(input())\r\nl1=list(map(int,input().split()))\r\ns1=sum(l1)\r\nl2=list(map(int,input().split()))\r\ns2=sum(l2)\r\nl3=list(map(int,input().split()))\r\ns3=sum(l3)\r\nprint(s1-s2)\r\nprint(s2-s3)", "from sys import stdin, stdout\r\n_, e1, e2, e3 = [sum(map(int, stdin.readline().split())) for _ in range(4)]\r\nstdout.write(f'{e1 - e2} {e2 - e3}\\n')", "n = int(input())\n\npl = list(map(int, input().split()))\npl.sort()\n\nsl = list(map(int, input().split()))\nsl.sort()\n\ntl = list(map(int, input().split()))\ntl.sort()\n\npont1 = pont2 = 0\n\nveri = False\nwhile(pont2 < len(sl)):\n if(pl[pont1] != sl[pont2]):\n print(pl[pont1])\n veri = True\n break\n pont1 += 1\n pont2 += 1\nif(not veri):\n print(pl[pont1])\n\npont1 = pont2 = 0\nveri = False\nwhile(pont2 < len(tl)):\n if(sl[pont1] != tl[pont2]):\n print(sl[pont1])\n veri = True\n break\n pont1 += 1\n pont2 += 1\nif(not veri):\n print(sl[pont1])\n \t \t \t\t\t \t \t\t \t\t \t \t", "n = input()\nfirst = sum(map(lambda x: int(x), input().split()))\nsecond = sum(map(lambda x: int(x), input().split()))\nthird = sum(map(lambda x: int(x), input().split()))\nprint(first-second)\nprint(second-third)\n\n\t\t \t \t \t\t \t \t \t \t \t\t\t\t", "x = int(input())\r\nl = [int(i) for i in input().split()]\r\nl1 = [int(i) for i in input().split()]\r\nl2 = [int(i) for i in input().split()]\r\nprint(sum(l)-sum(l1))\r\nprint(sum(l1)-sum(l2))\r\n", "n=int(input())\r\nsum=0\r\nsum2=0\r\nsum3=0\r\nlit=list(map(int,input().split()))\r\nlit2=list(map(int,input().split()))\r\nlit3=list(map(int,input().split()))\r\n\r\nfor i in range(n):\r\n sum += lit[i]\r\nfor i in range(n - 1):\r\n sum2+=lit2[i]\r\nfor i in range(n - 2):\r\n sum3 +=lit3[i]\r\n\r\nprint(sum-sum2)\r\nprint(sum2-sum3)\r\n", "# A and B and Compilation Errors\r\n# https://codeforces.com/problemset/problem/519/B\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = list(map(int, input().split()))\r\nc = list(map(int, input().split()))\r\n\r\nprint(sum(a) - sum(b), sum(b) - sum(c), sep='\\n')", "n=int(input())\r\na=[int(x) for x in input().split()]\r\nb=[int(y) for y in input().split()]\r\nc=[int(x) for x in input().split()]\r\nprint(sum(a)-sum(b))\r\nprint(sum(b)-sum(c))\r\n\r\n", "from collections import Counter\r\nn = int(input())\r\na = list(map(int, input(). split()))\r\nb = list(map(int, input(). split()))\r\nc = list(map(int, input(). split()))\r\np = Counter(a)\r\npb = Counter(b)\r\npc = Counter(c)\r\nans = [ ]\r\na0 = [ ]\r\nb0 = [ ]\r\nfor i in a:\r\n if i not in a0 and p[i] != pb[i]:\r\n ans += [i]\r\n a0 += [i]\r\nfor j in b:\r\n if j not in b0 and pb[j] != pc[j]:\r\n ans += [j]\r\n b0 += [j]\r\nprint(ans[0])\r\nprint(ans[1])\r\n" ]

[ "from math import log2\r\nn = int(input())\r\nm = int(input())\r\nif log2(m) >= n:\r\n print(m % 2**n)\r\nelse:\r\n print(m)", "def modular_exponentiation(n, m):\n return m % 2 ** n\n\nif __name__ == \"__main__\":\n n = int(input())\n m = int(input())\n invertido = modular_exponentiation(n, m)\n print(invertido)\n\t \t \t\t \t\t \t \t\t \t\t \t\t\t\t\t \t \t", "n=int(input())\r\nm=int(input())\r\nn=2**n\r\nprint(int(m%n))", "# Read integers n and m from standard input\r\nn = int(input())\r\nm = int(input())\r\n\r\n# Calculate 2^n\r\npower_of_two = 2 ** n\r\n\r\n# Calculate m mod 2^n\r\nresult = m % power_of_two\r\n\r\n# Output the result\r\nprint(result)\r\n", "from math import log2\r\nn=int(input())\r\nm=int(input())\r\nif log2(m)<n:print(m)\r\nelse:print(m%(2**n))", "n=int(input())\r\nm=int(input())\r\nx=2**n\r\nans=(m%x)\r\nprint(ans)\r\n", "n = int(input())\nm = int(input())\nprint(m if n >= 27 else m % (1 << n))\n", "n = int(input())\r\nm = int(input())\r\nans = m % pow(2, n)\r\nprint(ans)\r\n", "n = int(input())\r\nm = int(input())\r\nnum = 1\r\nfor i in range(n):\r\n num *= 2\r\n if num > m:\r\n break\r\nprint(m % num)\r\n", "import math\n\nn = int(input())\nm = int(input())\n\n\nprint(int(m % (2**n)))\n \t\t \t \t\t\t\t \t\t \t \t\t\t \t\t\t", "N = int(input())\r\nM = int(input())\r\nif N >= 27:\r\n\tprint(M)\r\nelse:\r\n\tprint(M % (2 ** N))", "# Bismillah\r\n# In the name of GOD\r\n\r\nn = int(input())\r\nm = int(input())\r\nprint(m % 2 ** n if n < 27 else m)\r\n", "#!/usr/bin/env python\r\n\r\nimport math\r\nimport sys\r\nimport itertools\r\nimport fractions\r\n\r\nif __name__ == '__main__':\r\n wtf = sys.stdin.read()\r\n wtf = wtf.strip().split('\\n')\r\n n = int(wtf[0])\r\n m = int(wtf[1])\r\n if n >= 27:\r\n print(m)\r\n else:\r\n print(m%2**n)", "a, b = int(input()), int(input())\nprint(b % (2**a))\n\t\t\t \t\t\t\t\t \t \t\t \t \t\t\t\t\t\t\t \t \t", "import math\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n m = int(input())\r\n \r\n if (n > 26):\r\n print(m)\r\n else:\r\n resultado = 2**n\r\n print(m%resultado)\r\n \r\n \r\nmain()\r\n", "x = int(input())\r\ny = int(input())\r\nprint(y%(2**x))", "tc = 1\r\nwhile tc:\r\n tc-=1\r\n n = int(input())\r\n m = int(input())\r\n if n > 28:\r\n print(m)\r\n else: \r\n print(m%(2**n)) ", "n=int(input())\r\nm=int(input())\r\nprint(m%(2<<(n-1)))", "import math\r\n\r\nn = int(input())\r\nm = int(input())\r\nprint(m%(2**n) if math.log2(m) >= n else m)\r\n", "n = int(input())\nm = int(input())\n\nresult = m % (2 ** n)\nprint(result)\n\n \t\t\t \t\t\t\t\t \t \t\t \t \t\t\t", "n=int(input())\r\nm=int(input())\r\nn=2**n\r\nprint(m%n)", "#mod division of m by 2**m. To speed it up, we will use the left shift operator.\nn = int(input())\nm = int(input())\nprint(m%(1<<n))\n \t\t\t \t\t\t\t \t\t \t \t \t \t", "a=int(input())\r\nb=int(input())\r\nprint(b%(1<<a))", "n = int(input())\nm = int(input())\n\nx=2**n\nprint(m%x)\n \t \t \t \t \t\t\t\t \t\t \t", "n=int(input())\r\nm=int(input())\r\ns=m%(2**n)\r\nprint(s)", "n=int(input())\r\nm=int(input())\r\nx=(m)**(1/n)\r\nif x<2:\r\n\tprint(m)\r\nelse:\r\n\tprint(m%(2**n))", "def main():\n n = (int)(input())\n m = (int)(input())\n\n print(m%(2**n))\nmain()\n \t\t\t\t \t\t \t \t \t \t\t \t\t \t\t\t", "x = int(input())\r\ny = int(input())\r\nprint(y % (1 << x))\r\n\r\n", "a = int(input())\r\nb = int(input())\r\nif a>30:\r\n print(b)\r\nelse:\r\n print(b%(2**a))", "import sys\r\nfrom itertools import *\r\nfrom cmath import *\r\n\r\ninput = sys.stdin.readline\r\nfrom math import *\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return int(input().strip())\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\nn=inp()\r\nm=inp()\r\nprint(m if n>=31 else m%(1<<n))", "def main():\r\n n = int(input())\r\n m = int(input())\r\n \r\n potencia = 2**n\r\n resultado = m % potencia\r\n print(resultado)\r\n \r\nmain()", "s=int(input())\r\nx=int(input())\r\nif s >=30:\r\n print(x)\r\nelse:\r\n print(x%(2**s))", "n = int(input())\nm = int(input())\nexpo = 2 ** n\nmod = m % expo\nprint(mod)\n\n\t\t\t\t \t\t \t\t\t\t \t \t\t\t\t\t \t\t", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn = int(input())\r\nm = int(input())\r\nans = m % pow(2, n) if n < 30 else m\r\nprint(ans)", "n = int(input())\r\np=m = int(input())\r\nb = ''\r\nwhile m > 0:\r\n b = str(m % 2)+b\r\n m = m // 2\r\nif len(b) > n:\r\n q = b[len(b)-n:]\r\n s = len(q)\r\n l = 0\r\n for i in range(len(q)):\r\n l = int(q[i])*(2**(len(q)-i-1)) + l\r\n print(l)\r\nelse:\r\n print(p)", "n = int(input())\nm = int(input())\nmod = m % (2 ** n)\nprint(mod)\n \t\t\t \t \t \t \t \t \t\t\t", "a=int(input())\r\nb=int(input())\r\nif a>30:\r\n print(b)\r\nelse:\r\n print(b%(2**a))", "n = int(input())\r\nm = int(input())\r\nif(n>27):\r\n print(m)\r\nelse:\r\n x = pow(2,n)\r\n x = m%x\r\n print(x)", "n=int(input())\r\nm=int(input())\r\nn2=1\r\nfor i in range(n):\r\n if n2*2<=m:\r\n n2 *= 2\r\n else:\r\n n2 *= 2\r\n break\r\n\r\nprint(m%n2)\r\n ", "n = int(input())\nm = int(input())\nb = 2**n\na = m%b\nprint(a)\n\t\t \t\t\t\t \t\t\t \t \t\t \t \t\t\t\t\t\t", "n = int(input()) #1e8\r\nm = int(input()) #1e8\r\nprint(m if n>=27 else m%(2**n))\r\n", "import sys\nimport math\ninput = sys.stdin.readline\n\ndef int_array():\n return list(map(int, input().strip().split()))\n\n\ndef str_array():\n return input().strip().split()\n\n######################## TEMPLATE ENDS HERE ########################\nn = int(input())\nm = int(input())\n\nprint(m%2**n)\n", "import math\r\nn = int(input())\r\nm = int(input())\r\nmn = math.log2(m)\r\nif(n>mn):\r\n print(m)\r\nelif(n==m):\r\n print(0)\r\nelse:\r\n print(m%(2**n))", "a=int(input())\r\nb=int(input())\r\nprint(b%pow(2,a))", "import math\ndef main():\n n=int(input())\n m=int(input())\n modulo=2**n\n\n if m<modulo:\n print(m)\n else:\n print(m - (modulo*math.floor(m/modulo)))\n\nmain()\n\t\t\t \t \t\t \t \t \t\t\t\t\t\t \t \t", "n = int(input())\r\nm = int(input())\r\n\r\nlog = 0\r\nwhile (1 << log) < m:\r\n log += 1\r\n\r\nif log < n:\r\n print(m)\r\nelse:\r\n print(m % (1 << n))\r\n", "n=int(input())\r\nm=int(input())\r\ni=0\r\nwhile(2**i<=m):\r\n i+=1\r\nif i<=n:print(m)\r\nelse:print(m%(2**n))", "#in the name of God\r\na=input()\r\nb=input()\r\na=int(a)\r\nb=int(b)\r\ncnt=1\r\nfor i in range(int(a)):\r\n cnt*=2\r\n if cnt>b :\r\n print(b)\r\n exit()\r\n\r\nprint(int(b)%cnt)\r\n", "n, m = int(input()), int(input())\r\ncur = 1\r\nwhile cur <= m and n > 0:\r\n n -= 1\r\n cur *= 2\r\nprint(m % cur)\r\n", "import sys\r\n# sys.stdin = open(\"input.txt\", \"r\")\r\n# Calculate m mod 2^n\r\n\r\nn = int(input())\r\nm = int(input())\r\nprint(m % (2**n))", "n = int(input())\r\nm = int(input())\r\nif n < 30:\r\n z = 1\r\n for i in range(n):\r\n z *= 2\r\n print(m % z)\r\nelse:\r\n print(m)\r\n ", "n=int(input())\nm=int(input())\nif n>30:\n print(m)\nelse:\n print(m%(2**n))\n", "n,m=int(input()),int(input())\r\nprint(m%(1<<n))", "import math\r\nn = int(input())\r\nm = int(input())\r\n\r\nif math.log(m, 2) < n:\r\n\tprint(m)\r\nelse:\r\n\te = 2**n\r\n\tprint(m%e)\r\n", "a=int(input())\r\nb=int(input())\r\nif a<=30:\r\n print(b%(2**a))\r\nelse:\r\n print(b)", "import math\n\na = input()\nb = input()\n\nif math.log(int(b),2) == float(a):\n print(0)\n\nelif math.log(int(b),2) < float(a):\n print(b)\n\nelse:\n resposta = int(int(b)%(math.pow(2,int(a))))\n print(resposta)\n\t\t\t\t\t \t\t\t\t \t \t \t \t \t\t\t\t", "n = int(input())\r\nm = int(input())\r\nk = pow(2,n)\r\nl = m%k\r\nprint(l)", "from math import log2\r\n \r\nn = int(input())\r\nm = int(input())\r\n \r\nif log2(m) < n:\r\n print(m)\r\n \r\nelif log2(m) == n:\r\n print(0)\r\n \r\nelse:\r\n print(m % 2**n)\r\n", "import math\r\n\r\nn = int(input())\r\nm = int(input())\r\na = int(math.log(m, 2))\r\nif a >= n:\r\n print(m%(2 ** n))\r\nelse:\r\n print(m)", "n = int(input())\nm = int(input())\n\nans = 0\n\nif n > 0:\n if n % 2 == 0:\n ans = ((2 ** (n // 2)) ** 2)\n else:\n ans = (((2 ** ((n - 1) // 2)) ** 2) * 2)\nelse:\n ans = 1\n\nprint(m % ans)\n \t \t \t \t\t\t\t \t \t\t\t\t \t", "n = int(input())\r\nm = int(input())\r\nprint((m%(2**n)) if n <= 27 else m)", "a=int(input())\r\nb=int(input())\r\nif a>30: print(b)\r\nelse: print(b%(2**a))", "n= int(input())\r\nm= int(input())\r\na=2**n\r\nprint(m%a)", "n = int(input())\nm = int(input())\nprint(m%2**n)\n\t \t\t\t\t \t\t \t\t\t\t \t\t\t\t\t \t \t", "'''m mod 2ˆn\ninput n, m'''\n\nn = int(input())\nm = int(input())\n\nresult = m % (2**n)\nprint(result)\n \t\t\t \t\t\t \t\t \t\t \t \t \t\t \t", "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\nm=inp()\r\n\r\ni=1\r\nans=1\r\nwhile i<=n:\r\n\tans*=2\r\n\tif ans>m:\r\n\t\tprint(m)\r\n\t\texit(0)\r\n\ti+=1\r\n\r\nprint(m%ans)\r\n\r\n\t\r\n", "#for _ in range(int(input())):\r\n\r\n#n,k=map(int, input().split())\r\n#arr = list(map(int, input().split()))\r\n#ls= list(map(int, input().split()))\r\nimport math\r\n#n = int(input())\r\n\r\n#for _ in range(int(input())):\r\n\r\n#n,l=map(int,input().split())\r\ndef f(y):\r\n\tif y==0:\r\n\t\treturn 1\r\n\tif y%2==0:\r\n\t\tvar=f(y//2)\r\n\t\treturn var*var\r\n\telse:\r\n\t\tvar = f(y // 2)\r\n\t\treturn var * var*2\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nm=int(input())\r\nprint(m%(f(n)))", "n = int(input())\nm = int(input())\n\n# The rest can be obtained with the bits to the right of the bit in the position len(bin(m))-n\n# Creates a mask with n bits linked to extract the bits responsible for the rest\nmask = (1 << n) - 1\nresult = m & mask\n\nprint(result)\n\t\t\t\t \t\t \t\t\t \t\t \t\t\t \t\t\t", "n = int(input())\r\nm = int(input())\r\nres =m % (2**n)\r\nprint(res)", "n = int(input())\r\nm = int(input())\r\n#m % 2**n\r\nif n>27:\r\n n = 27\r\nx = m % 2**n\r\nprint(x)", "n = int(input())\nm = int(input())\nprint(m%(1<<n))", "x=int(input())\r\ny=int(input())\r\nif x>32 :\r\n print(y)\r\nelse :\r\n print(y%pow(2,x))", "n=int(input())\r\nm=int(input())\r\nprint(m%pow(2,n))\r\n", "a = int(input())\nb = int(input())\nr = 0\nad = 1\nc = 0\nif b == 1:\n\tprint(1)\nelse:\t\t\n\twhile (b > 0 and a > 0):\n\t\tif (b % 2 == 1):\n\t\t\tr = r + ad\n\t\tb = b // 2\n\t\ta = a - 1\n\t\tad = ad * 2\n\t\tif b == 1:\n\t\t\tc = c + 1\n\tprint(r)\n\t\n\t\n\n\n \t\t \t\t\t\t \t\t \t \t \t \t\t \t \t\t \t\t\t", "n = int(input())\nm = int(input())\nx = 1\nfor i in range(0, n):\n x*=2\n if x > m:\n break\nprint(m%x)", "import sys, os.path\r\nif(os.path.exists('input.txt')):\r\n sys.stdin = open(\"input.txt\",\"r\")\r\n sys.stdout = open(\"output.txt\",\"w\")\r\nn=int(input())\r\nm=int(input())\r\nprint(m%(2**n))", "from math import log\r\nn=int(input())\r\nm=int(input())\r\nif int(log(m,2))<n:\r\n print(m)\r\nelse:\r\n print(m%(2**n))", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\nm = int(stdin.readline())\r\nstdout.write(str(m%(1<<n)))", "n = int(input())\nm = int(input())\nx = m%(2**n)\nprint(x)\n\t \t\t \t \t \t\t \t\t \t \t\t \t\t\t\t", "def pow_of_two(n, m):\r\n two = 1\r\n\r\n for i in range(n):\r\n two *= 2\r\n if two > m:\r\n break\r\n\r\n return two\r\n\r\n\r\nn, m = int(input()), int(input())\r\n\r\nprint(m % pow_of_two(n, m))\r\n", "'''m mod 2ˆn\r\ninput n, m'''\r\n\r\nn = int(input())\r\nm = int(input())\r\n\r\nresult = m % (2**n)\r\nprint(result)\r\n \t\t\t \t\t\t \t\t \t\t \t \t \t\t \t", "n=(int(input()))\r\n\r\nm=int(input())\r\nif(n>=30):\r\n\tprint(m)\r\nelse:\r\n\ta=2**n\r\n\tprint(m%a)\r\n\r\n", "n,m=int(input()),int(input())\r\nprint(m%(2<<n-1))\r\n", "import math\r\nt=1\r\nwhile t:\r\n t-=1\r\n n=int(input())\r\n m=int(input()) \r\n if(n>=27):\r\n print(m)\r\n else:\r\n print(m%(pow(2,n)))\r\n", "n=int(input())\nm=int(input())\nif n>m:\n print(m)\nelse:\n print(m%(2**n))\n\t\t\t\t\t\t\t \t\t \t \t\t\t \t", "#g\nn = int(input())\nm = int(input())\n\nx = 2**n\n\nprint(m % x)\n\t\t \t \t \t \t\t \t \t \t \t \t\t\t\t", "n = int(input())\nm = int(input())\n\nif len(str(n)) >= 3:\n print(m)\nelse:\n print(m % (2 ** n))", "x = int(input())\r\ny = int(input())\r\nif x>=40:\r\n print(y)\r\nelse:print(y%(2**x))", "n = int(input())\r\nm = int(input())\r\nif n<10:\r\n\tres = m %(2**n)\r\nelse:\r\n if n>=m//2:\r\n\t res = m\r\n elif 2**n > m:\r\n\t res = m\r\n else:\r\n\t res = m %(2**n)\r\n\r\nprint(res)\r\n\r\n\r\n\r\n#98765432\r\n#23456789\r\n", "import math\r\nn=int(input())\r\nm = int(input())\r\n\r\nt = math.log(m,2)\r\n\r\nif n > t:\r\n print(m)\r\nelse:\r\n print(m % (2**n))", "n = int (input())\r\nm = int (input())\r\nif pow(2, n) > m:\r\n print(m)\r\nelse:\r\n print(m % pow(2, n))", "n = int(input())\nm = int(input())\naux = 2**(n)\nresultado = m % aux\n\nprint(resultado)\n\t \t \t\t \t\t \t\t\t \t \t \t", "import math as f\r\ndef cout(n):\r\n return print(n)\r\ndef cin():\r\n return int(input())\r\ndef lcin():\r\n return list(map(int,input().split()))\r\ndef scin():\r\n return input()\r\n\r\nn = cin()\r\nm = cin()\r\nprint(m%(2**n))\r\n\r\n", "def exp(a, b):\n if b == 0:\n return 1\n \n odd = b % 2\n partial = exp(a, b // 2)\n\n return partial * partial * a if odd else partial * partial\n\ndef main():\n n = int(input())\n m = int(input())\n\n power = exp(2, n)\n print(m % power)\n\nif __name__ == \"__main__\":\n main()\n\t\t \t\t \t\t \t \t\t \t \t \t\t\t", "n,m=int(input('')),int(input(''))\r\nk=2**n\r\nprint(int(m%k))", "x=int(input())\r\ny=int(input())\r\nprint(y%(1<<x))", "n = int(input())\nm = int(input())\n# Preciso de m mod 2^n\nif n > 30:\n print(m)\nelse:\n print (m%(pow(2,n)))\n \t\t\t \t \t\t \t\t\t \t\t\t\t \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 < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n < >\r\n v\r\n'''\r\nn = int(input())\r\nm = int(input())\r\nans = m % (1<<n)\r\nprint(ans)", "n = int(input())\r\nm = int(input())\r\nprint(m % (2 << (n-1)))", "def func(x,n):\r\n if n == 0 :\r\n return 1\r\n if n % 2 == 0 :\r\n return (func(x**2,n//2))\r\n else :\r\n return (x*func(x,n-1))\r\n \r\nn = (int(input()))\r\nm = (int(input()))\r\nif n<=100 :\r\n print(m%func(2,n))\r\nelse :\r\n print(m)", "n,m = int(input()),int(input())\r\nif n < 27:\r\n print(m%2**n)\r\nelse:\r\n print(m)", "n=int(input())\r\nm=int(input())\r\ng=(1<<(n))\r\nprint(m%g)", "n=int(input())\r\nm=int(input())\r\n\r\nif n>100:\r\n\tprint(m)\r\n\texit()\r\nprint(m%(2**n))", "def Fast_power(x , y):\r\n res = 1\r\n while y > 0 :\r\n if (y % 2 != 0):\r\n res = res * x\r\n\r\n y = y // 2\r\n x = x * x\r\n\r\n return res\r\n\r\nn = int(input())\r\nm = int(input())\r\n\r\nif n <= 40 :\r\n print(m % Fast_power(2 , n))\r\nelse:\r\n print(m)\r\n\r\n\r\n", "n = int(input())\r\nm = int(input())\r\nprint(m if n > 27 else m%(2**n))", "n = int(input())\r\nm = int(input())\r\n\r\nif n > 30:\r\n print(m)\r\nelse:\r\n ans = m%2**n\r\n print(ans)", "q=int(input())\r\nw=int(input())\r\ne=1\r\nwhile(e<=w and q!=0):\r\n e*=2\r\n q-=1\r\nif e>w:\r\n print(w)\r\nelse:\r\n print(w%e)", "def binpow(a, b):\n res = 1\n while (b > 0):\n if (b & 1):\n res = (res * a)\n a = (a * a)\n b >>= 1\n return res\n\nn = int(input())\nm = int(input())\n\nprint(m % binpow(2,n))\n\n\t\t\t \t\t \t\t \t \t\t \t", "def getModularExp(n, m):\n o = 2**n\n return m%o\n\nn = int(input())\nm = int(input())\nprint(getModularExp(n, m))\n\n\n \t\t\t\t \t \t\t\t\t\t \t \t\t\t \t", "import math\nn=int(input())\nm=int(input())\nif n<=29:\n\tprint(m%(2**n))\nelse:\n\tprint(m)\n \t \t \t\t \t\t\t \t \t\t\t \t \t\t\t \t \t\t", "n = int(input())\nm = int(input())\n\nnn = 2 ** n\nr = m % nn\n\nprint(r)\n\t \t \t\t\t \t \t \t\t \t \t\t \t\t\t", "# Read integers n and m from standard input\nn = int(input())\nm = int(input())\n\n# Calculate 2^n\npower_of_two = 2 ** n\n\n# Calculate m mod 2^n\nresult = m % power_of_two\n\n# Output the result\nprint(result)\n\n \t \t \t \t \t \t \t \t\t \t", "n = int(input())\nm = int(input())\n\nex = (2**n)\nr = m % ex\nprint(r)\n\n \t \t \t \t \t\t \t \t \t\t", "# Wadea #\r\n \r\n \r\n\r\n\r\nn = int(input())\r\nm = int(input()) \r\nprint( m% (2**n))\r\n", "from sys import stdin, stdout\nfrom collections import defaultdict\ndef read():\n\treturn stdin.readline().rstrip()\n\ndef read_int():\n\treturn int(read())\n\ndef read_ints():\n\treturn list(map(int, read().split()))\n\ndef solve():\n\tn=min(31, read_int())\n\tm=read_int()\n\tprint(m%(2**n))\n\nsolve()\n", "def exponential(x, p):\n if p == 0:\n return 1\n elif (p % 2) == 0:\n aux = exponential(x, p/2)\n return aux*aux\n else:\n aux = exponential(x, (p-1)/2)\n return x*aux*aux\n\n\ninput1 = input()\ninput2 = input()\nx = int(input1)\nvalue = int(input2)\n\nprint(value % exponential(2, x))\n\n\t \t \t \t\t \t \t\t\t \t \t\t\t \t", "import sys\r\nfrom math import log\r\n\r\ndef main():\r\n n, m = map(int, sys.stdin.read().strip().split('\\n'))\r\n nm = int(log(m, 2))\r\n if n > nm: return m\r\n return m%2**n\r\nprint(main(), sep='\\n')", "n=int(input())\r\nm=int(input())\r\nx=2\r\na=m%(2**n)\r\nprint(a)", "import math\n\ns1 = int(input())\ns2 = int(input())\nlimit = math.log(100000000, 2)\nif s1 > limit:\n print(s2)\nelse:\n print(s2 % 2 ** s1)\n\n", "n = int(input())\nm = int(input())\n\n#m mod 2^n\n#2^26 maior possivel\n\nif n > 26:\n print(m)\nelse:\n print(m%(2**n))\n\n\t \t\t \t\t\t \t\t \t \t\t \t \t\t\t \t", "n = int(input())\nm = int(input())\nans = m % (1<<n)\nprint(ans)\n\t \t\t\t \t \t \t \t\t \t\t", "def main():\n n = int(input())\n m = int(input())\n print (m % (2 ** n))\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=int(input())\r\nm=int(input())\r\nprint(m %(2**n))", "n = int(input())\na = int(input())\nprint(a%(2**n))\n\t\t \t \t \t\t\t\t\t\t\t\t \t \t \t\t \t", "import math\r\nx=int(input())\r\ny=int(input())\r\n\r\n\r\n\r\ntry:\r\n l=math.pow(2,x)\r\nexcept OverflowError:\r\n l = math.inf\r\nprint(int(y%l))\r\n", "n=int(input())\r\nm=int(input())\r\nif n>=m:print(m)\r\nelse:print(m%pow(2,n))\r\n", "from math import ceil, floor\r\n\r\n\r\nn = int(input())\r\nbase = int(input())\r\nprint(base % (2**(floor(n/2))*2**(ceil(n/2))))\r\n", "# LUOGU_RID: 101738004\nn, m = map(int, open(0).read().split())\r\nif n >= 32:\r\n print(m)\r\nelse:\r\n print(m % 2**n)", "n = int(input())\nm = int(input())\nx = 1\n\nwhile n > 0:\n x *= 2\n if x > m:\n print(m)\n break\n n -= 1\nif n == 0:\n print(m%x)", "n = int(input())\r\nm = int(input())\r\n# m mod 2^n\r\nif 2**n > m:\r\n print(m)\r\nelse:\r\n print(m % (2 ** n))", "# LUOGU_RID: 113786870\nn,m=int(input()),int(input())\r\nif n>30:\r\n print(m)\r\nelse:\r\n print(m%(1<<n))", "n = int(input())\nm = int(input())\n\nx = m % (2 ** n)\nprint(x)\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 m = int(input())\r\n \r\n if n > 26:\r\n print(m)\r\n else:\r\n print(m % (1 << n))\r\n \r\n \r\nif __name__ == \"__main__\":\r\n solve()\r\n ", "n = int(input())\nm = int(input())\n\nres = 0\n\nif n > 0:\n if n % 2 == 0:\n res = ((2 ** (n // 2)) ** 2)\n else:\n res = (((2 ** ((n - 1) // 2)) ** 2) * 2)\nelse:\n res = 1\n\nprint(m % res)\n\t \t\t\t \t \t \t\t\t\t\t \t\t\t \t\t \t\t", "y,m = int(input()),int(input())\r\nprint(m if y > m//2 else m%pow(2,y))", "n=int(input())\r\nm=int(input())\r\nif n>10**6:\r\n print(m)\r\nelse:\r\n d=m % (2**n)\r\n print(d) ", "def main():\n n = int(input())\n m = int(input())\n\n if n > 30:\n print(m)\n else:\n print(m%2**n)\n \nmain()\n\t\t\t \t \t\t\t\t \t \t \t \t \t \t\t", "def main():\n n = int(input())\n m = int(input())\n return m % (2 ** n)\n\nprint(main())\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\t", "from math import log2, ceil\nn = int(input())\nm = int(input())\nif ceil(log2(m))+1 < n:\n print(m)\nelse:\n x = 2**n-1\n print(m & x)\n \t \t \t\t \t\t \t \t\t \t\t\t \t\t \t", "n=int(input());m=int(input())\r\nif n>30:print(m)\r\nelse:print(m%(2**n))", "n = int(input())\nm = int(input())\n\nr = m%(1 << n)\nprint(r)\n \t\t \t \t\t\t \t \t\t\t\t\t \t", "def mulmod (a,b,c) : return((a%c)*(b%c))%c\r\ndef fastpower(x , n) : \r\n result = 1 \r\n while n > 0 : \r\n if n&1 : result = result*x \r\n x = x*x ; n = n//2 \r\n return result \r\ndef fastpowerexp (x , n , m) :\r\n\r\n result = 1 \r\n while n > 0 : \r\n if n&1 : result = (result*x )%m\r\n x = mulmod(x, x, m); n = n//2 \r\n return result \r\nn = int(input()) ; m = int(input())\r\nif n <= 32 : print(m%fastpower(2, n))\r\nelse : print(m)", "##Search Modulo Exponentiation for more insight\r\nn=int(input())\r\nm=int(input())\r\n\r\nif n<=27:\r\n\tprint(m%(2**n))\r\nelse:\r\n\t#Because 2**n, when n==27 is 1.34e8 that is greater than e8\r\n\tprint(m)", "n, m = int(input()), int(input())\r\nprint(m % (2 ** n) if n < 30 else m)", "n = int(input())\nm = int(input())\n\nresult = m % (pow(2, n))\n\nprint(result)\n\t\t\t \t \t \t \t \t\t \t \t\t\t\t \t\t\t", "n = int(input())\nm = int(input())\npotencia = 2**n\nprint(m % potencia)\n \t \t\t \t \t\t \t \t\t \t \t \t \t \t", "n = int(input())\r\nm = int(input())\r\n\r\nif n < 30: \r\n print(m%pow(2,n))\r\nelse: \r\n print(m)", "# m mod 2**n\r\nn = int(input())\r\nm = int(input())\r\nif n > 26:\r\n print(m)\r\nelse:\r\n powers = []\r\n for i in range(1,28):\r\n powers += [2**i]\r\n print(m % 2**n)\r\n", "num1=int(input())\r\nnum2=int(input())\r\nprint(num2%(1<<num1))", "n = int(input())\nm = int(input())\n\n\nprint(m%(2<<(n-1)))\n \t\t \t \t\t \t\t\t \t\t\t\t \t \t\t \t\t", "n = int(input())\r\nbase = int(input())\r\n\r\nprint(base % 2**n)\r\n", "n=int(input())\r\nm=int(input())\r\nk=1<<n\r\nprint(m%k)", "\"\"\"\nhttps://codeforces.com/problemset/problem/913/A\n\"\"\"\n\n\ndef modexp(m, n):\n a = 2 ** n\n r = m % a\n return r # m % (2 ** n)\n\n\nn = int(input())\nm = int(input())\n\nprint(modexp(m, n))\n", "x = int(input());y = int(input()); print(y % pow(2, x))", "n = int(input())\r\nm = int(input())\r\n\r\nresult = m & ((1 << n) - 1)\r\n\r\nprint(result)\r\n\r\n", "n = int(input())\nm = int(input())\n\n# def helper(n):\n# if n == 0:\n# return 1\n# aux = 0\n# if n % 2 == 0:\n# aux = helper(n/2)\n# return aux*aux\n# else:\n# aux = helper((n-1)/2)\n# return 2*aux*aux\n\n# print(int(m) % helper(int(n)))\n \nx = 2\ni = 1\nwhile i < n:\n if x > m:\n print(m)\n exit()\n x = 2*x\n i += 1\n\nif x == m:\n print(0)\nelse:\n print(m % x)\n \t\t\t\t\t\t\t \t\t\t \t \t \t \t\t \t \t", "n = int(input())\nm = int(input())\nif m < n:\n print(m)\nelse:\n exp=2**n\n print(m % exp)\n \t \t\t\t \t \t \t\t\t\t \t \t", "n = int(input())\r\nm = int(input())\r\nif n > len(bin(m)) - 2:\r\n print(m)\r\nelse:\r\n print(m % 2**n)\r\n", "#913A\r\nx = 2**(int(input()))\r\ny = int(input())\r\nprint(y%x)", "#python s.py < ./io/in.txt > ./io/out.txt\r\n\r\nfrom math import log2\r\n\r\ndef minput(f):\r\n return [f(s) for s in input().split()]\r\n\r\n\r\nn = int(input())\r\nm = int(input())\r\n\r\nif n > (log2(m)+1):\r\n print(m)\r\nelse:\r\n print(m%(2**n))", "n = int(input())\nm = int(input())\n\ndois_elevado=1\nmaior = 0 \ni = 0\nfor i in range(n):\n dois_elevado*=2\n if dois_elevado > m:\n maior=i\n break\n\nif maior == 0: \n print(m%dois_elevado)\nelse:\n print(m)\n\t \t \t \t\t\t\t\t\t\t \t\t \t\t \t \t", "def main():\r\n n, m = int(input()), int(input())\r\n\r\n print(m % 2 ** n)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = input()\r\nm = input()\r\nprint(int(m) % (2 ** int(n)))\r\n", "n = int(input())\r\nm = int(input())\r\n\r\nif m == 1:\r\n print(1)\r\nelse:\r\n x = str(bin(m))\r\n print(int(x[-n:],2))\r\n\r\n", "n = int(input())\r\nm = int(input())\r\ncur = 1;\r\nfor i in range(n):\r\n\tcur *= 2\r\n\tif (cur > m):\r\n\t\tbreak\r\nprint(m % cur)", "n = int(input())\r\nm = int(input())\r\nprint(m%2**n)", "n = int(input())\nm = int(input())\n\noutput = m % (2**n)\n\nprint(output)\n \t \t\t \t \t \t \t \t \t", "n=int(input())\r\nm = int(input())\r\nif n>m:\r\n print(m)\r\nelif n>27:\r\n print(m)\r\nelse:\r\n print(m%2**n)", "from math import log\r\n\r\nn = int(input())\r\nm = int(input())\r\nif n>log(m,2):\r\n\tprint(m)\r\nelse:\r\n\tr = m%(2**n)\r\n\tprint(r)", "n,m=int(input()),int(input())\r\nprint(m if n>26 else m%pow(2,n))", "# 913A => Modular Exponentiation\r\n# https://codeforces.com/problemset/problem/913/A\r\n\r\nn = int(input())\r\nm = int(input())\r\nprint(m % (1 << n))\r\n", "import math\n\nn = int(input())\nm = int(input())\n\n\nx = math.log(m)/math.log(2)\n\nif n > x:\n print(m)\n\nelse:\n print(int(m%math.pow(2,n)))\n \t\t\t\t \t\t \t \t\t\t \t\t\t \t\t", "x = int(input())\r\ny = int(input())\r\nprint(y % (2 ** x))", "import sys\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nm = int(input())\r\n\r\ntmp = 1\r\nwhile tmp <= m and n > 0:\r\n tmp *= 2\r\n n -= 1\r\n\r\nprint(m % tmp)", "n = int(input())\r\nm = int(input())\r\nprint( m%(1<<n) )\r\n", "n = int(input())\nm = int(input())\n\np = 1 << n\nprint(m if m < p else m % p)", "import sys\r\ninput=sys.stdin.buffer.readline\r\n\r\nn=int(input())\r\nm=int(input())\r\ns=1\r\ncount=0\r\nwhile s<=m and count<n:\r\n\tcount+=1\r\n\ts*=2\r\nif count==n:\r\n\tprint(m%s)\r\nelse:\r\n\tprint(m)", "def reverse_mod(n, m):\n if 2**n > m:\n return m\n \n b = 0\n k = 0\n while m > 1 and k < n:\n if m % 2 == 1:\n b += 2**k\n k += 1\n m = m // 2\n return b \n\nn = int(input())\nm = int(input())\nprint(reverse_mod(n, m))\n \t \t\t \t\t \t\t \t\t\t\t \t\t\t \t \t\t \t", "n, m = int(input()), int(input())\r\nvalue = False\r\nfor j in range(n + 1):\r\n if pow(2, j) > m:\r\n value = True\r\n break\r\nif value:\r\n print(m)\r\nelse:\r\n print(m % pow(2, n))\r\n", "x = int(input())\r\ny = int(input())\r\n\r\ndef modular():\r\n if x >= 27:\r\n return y\r\n \r\n else:\r\n return y%(2**x)\r\nprint(modular())\r\n", "n=int(input())\r\nm=int(input())\r\nx=2**n\r\nprint(m%x)\r\n", "n = int(input())\nm = int(input())\nif n>=27:\n\tprint(m)\nelse:\n\tprint( m%(2**n))\n", "n = int(input())\r\nm = int(input())\r\nprint(m % (2 ** min(n, 32)))\r\n", "a=int(input())\r\nif a>30:print(input())\r\nelse:print(int(input())%(2**a))", "n= int(input())\nm= int(input())\n\nresult = m % (2**n)\nprint(result)\n\t \t \t \t\t \t \t \t \t \t \t\t", "n=int(input())\r\nm=int(input())\r\nx=pow(m,1,2**n)\r\nprint(x)", "import sys\r\nread = sys.stdin.buffer.read\r\nreadline = sys.stdin.buffer.readline\r\nreadlines = sys.stdin.buffer.readlines\r\n\r\nN, M = map(int, read().split())\r\nprint(M % pow(2, N))", "n = int(input())\r\nm = int(input())\r\nif(n>=31): print(m)\r\n\r\nelse : print(m%(pow(2,n)))\r\n", "x = int(input())\r\ny = int(input())\r\nz = 2**x\r\na = y%z\r\nprint(a)", "n = int(input())\nm = int(input())\nmod = 2 ** n\nans = m % mod\nprint(ans)\n \t\t\t \t \t \t\t \t \t \t\t\t \t\t\t", "n, m = int(input()), int(input())\r\nprint(m % pow(2, n)) if n < 35 else print(m)", "#!/usr/bin/env python\n# coding=utf-8\n'''\nAuthor: Deean\nDate: 2021-11-14 16:11:42\nLastEditTime: 2021-11-14 16:18:26\nDescription: Modular Exponentiation\nFilePath: CF913A.py\n'''\n\n\ndef func():\n n, m = int(input()), int(input())\n if n > 30:\n print(m)\n else:\n print(m % (2 ** n))\n\n\nif __name__ == '__main__':\n func()\n", "def exp(x, p):\n if p == 0:\n return 1\n \n if p % 2 == 0:\n a = exp(x, p / 2)\n return a * a\n \n a = exp(x, (p - 1) / 2)\n return x * a * a\n\ndef main():\n n = int(input())\n m = int(input())\n\n print(m % exp(2, n))\n\nmain()\n \t \t \t \t \t\t \t \t \t \t\t", "\r\nn = int(input())\r\nm = bin(int(input()))[2:]\r\nprint(int(m[max(len(m) - n,0):], 2))", "n=int(input())\r\nm=int(input())\r\n\r\ndef fastpower(l,k,o=1):\r\n if k==1:\r\n return l\r\n if k%2==0:\r\n x=fastpower(l,k//2)\r\n return (x * x)\r\n elif k%2==1:\r\n x= fastpower(l,k//2)\r\n return (x * x * l)\r\nprint(m%fastpower(2,n,m))\r\n\r\n\r\n", "a = int(input())\nb = int(input())\nmask = (1 << a) - 1 \nprint(mask & b)", "n= int(input())\nm= int(input())\n\nres = m % (2**n)\nprint(res)\n\n \t\t \t\t \t\t\t \t\t\t\t \t \t \t\t\t \t \t", "\r\ndef main_function():\r\n n = int(input())\r\n m = int(input())\r\n tester = 1\r\n degree = 0\r\n while tester < m:\r\n tester *= 2\r\n degree += 1\r\n if degree < n:\r\n return m\r\n else:\r\n return m % (2**n)\r\n\r\n\r\n\r\nprint(main_function())\r\n\r\n\r\n\r\n\r\n", "#Davidson Lisboa Della Piazza, 169786\n\ndef exp(potencia,n,m):\n for i in range(0,n):\n potencia = potencia*2\n if(potencia > m):\n print(m)\n return \n print(m%potencia)\n return\n\nn = int(input())\nm = int(input())\npotencia = 1\nexp(potencia,n,m)\n\t \t\t \t\t\t\t\t\t\t\t \t\t \t\t \t\t", "n = int(input())\nm = int(input())\nbase = 2\nbigger = False\n#print(m%2^n)\n\nfor i in range(1,n):\n base = base*2\n if base>m:\n bigger = True\n break\n\n#print(bigger)\nif (bigger):\n print(m)\nelse:\n #print(m,\"%\",base)\n print(m%base)\n\t\t \t\t \t\t \t \t\t \t \t \t\t\t\t\t", "n = int(input())\nm = int(input())\n\nelevado = 2 ** n\n\nmodulo = m % elevado\n\nprint(modulo)\n\t \t \t \t \t \t \t \t\t \t\t \t \t \t", "# m mod 2^n\nn = int(input())\nm = int(input())\n\ndef exp_rapida_de_2(x):\n if x == 1:\n return 2\n elif x % 2 == 0:\n aux = exp_rapida_de_2(x/2)\n return aux * aux\n else:\n aux = exp_rapida_de_2((x-1)/2)\n return aux * aux * 2\n\n# print(exp_rapida_de_2(n))\nprint(m % exp_rapida_de_2(n))\n\t \t\t \t \t\t \t\t \t\t \t\t\t\t", "a = int(input())\r\nb = int(input())\r\nc = a - 1\r\nprint(b%(2 << c))", "import math\r\nn=int(input())\r\nm=int(input())\r\n\r\nif(m>n):\r\n n=2**n\r\n if(m>=n):\r\n print(m%n)\r\n else:\r\n print(m)\r\nelse:\r\n print(m)", "def main():\n n = int(input())\n m = int(input())\n\n dois_a_n = 2 ** n\n ret = m % dois_a_n\n\n print(ret)\n\n\nif __name__ == '__main__':\n main()\n\t\t\t \t \t \t \t \t\t\t\t\t \t \t \t", "n = int(input())\nm = int(input())\nprint(m%pow(2,n))\n\t \t\t\t \t\t\t \t\t \t\t \t \t\t \t \t\t", "n, m = int(input()), int(input())\r\ndef exponent():\r\n A = pow(2, n)\r\n print(m % A)\r\nexponent()" ]

[ "n,f = list(map(int,input().split()))\r\nout = []\r\ndata = []\r\nans = 0\r\nfor i in range(n):\r\n a,b = list(map(int,input().split()))\r\n ans += min(a,b)\r\n out.append(min(a*2,b)- min(a,b))\r\nout.sort(reverse=True)\r\nfor i in range(f):\r\n ans+=out[i]\r\n\r\nprint(ans)", "n, f = list(map(int, input().split()))\r\n\r\ndays = []\r\nfor i in range(n):\r\n d = list(map(int, input().split()))\r\n days.append((d[0], d[1], min(2 * d[0], d[1]) - min(d[0], d[1])))\r\n\r\ndays_sorted = sorted(days, key=lambda x: x[2], reverse=True)\r\n#print(days_sorted)\r\nans = 0\r\nfor i in range(n):\r\n if i < f:\r\n ans += min(2 * days_sorted[i][0], days_sorted[i][1])\r\n else:\r\n ans += min(days_sorted[i][0], days_sorted[i][1])\r\nprint(ans)\r\n", "def main():\r\n n, f = map(int, input().split())\r\n data = [tuple(map(int, input().split())) for _ in range(n)]\r\n s = [(min(k, l), min(2 * k, l)) for k, l in data]\r\n s.sort(key=lambda x: x[0] - x[1])\r\n\r\n result = 0\r\n i = 0\r\n\r\n while i < n:\r\n if i < f:\r\n result += s[i][1]\r\n else:\r\n result += s[i][0]\r\n i += 1\r\n\r\n print(result)\r\n\r\n\r\nmain()\r\n", "n, m = map(int, input().split())\n\nbase_sold, gains = [], []\nfor _ in range(n):\n k, l = map(int, input().split())\n gain = min(k*2, l) - min(k, l)\n gains.append(gain)\n base_sold.append(min(k, l))\n\ntarg = sorted(zip(gains, base_sold), reverse=True)\nans = 0\nfor i in range(n):\n if i < m:\n ans += targ[i][0]\n ans += targ[i][1]\n\n # print(f'{i+1} ({targ[i]}):', sum(targ[i]))\n\nprint(ans)", "n,f=map(int,input().split())\r\nml=[]\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n t=((min(2*k,l)-min(k,l)),k,l)\r\n ml.append(t)\r\nml.sort(reverse=True)\r\nr=0\r\nfor i in range(f):\r\n r+=min(2*ml[i][1],ml[i][2])\r\nfor i in range(f,n):\r\n r+=min(ml[i][1],ml[i][2])\r\nprint(r)\r\n ", "n, f = map(int, input().split())\r\nk = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n k.append((a, b))\r\n\r\nk = [p for p in k if p[0] != 0]\r\n\r\nans = sum(p[0] if p[0] < p[1] else p[1] for p in k)\r\n\r\nv = [min(2 * p[0], p[1]) - min(p[0], p[1]) for p in k]\r\nv.sort(reverse=True)\r\n\r\nans += sum(v[:f])\r\n\r\nprint(ans)", "n, f = map(int, input().split())\r\narr = []\r\nans = 0\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n ans += min(k, l)\r\n if k < l:\r\n arr.append(min(2*k, l)-k)\r\narr.sort()\r\nwhile len(arr) > 0 and f > 0:\r\n ans += arr.pop()\r\n f -=1\r\nprint(ans)", "import sys, os, io\r\ninput = io.BytesIO(os.read(0, os.fstat(0).st_size)).readline\r\n\r\nn, f = map(int, input().split())\r\nans = 0\r\nu = []\r\nfor _ in range(n):\r\n k, l = map(int, input().split())\r\n x, y = min(k, l), min(2 * k, l)\r\n ans += x\r\n u.append(y - x)\r\nu.sort(reverse = True)\r\nans += sum(u[:f])\r\nprint(ans)", "n, f= list(map(int, input().split()))\r\nn_max=0\r\ncomplete=[]\r\nfor j in range(n):\r\n k, l= list(map(int, input().split()))\r\n a=min(k,l)\r\n b=min(2*k,l)\r\n n_max+=a\r\n complete.append(b-a)\r\ncomplete.sort(reverse=True)\r\nfor i in range(f):\r\n n_max+=max(complete[i], 0)\r\nprint(n_max)\r\n", "n , f = map( int,input().split() )\r\nans = 0\r\na = []\r\nfor i in range(n):\r\n\tk , l = map(int, input().split())\r\n\tans += min(k,l)\r\n\ta.append( min(2*k,l) - min(k,l) )\r\n\r\na.sort( reverse = True )\r\nfor i in range(f):\r\n\tans += a[i]\r\nprint(ans)", "n, f = map(int, input().split())\nabc = n * [0]\nans = 0\nfor i in range(n):\n x = list(map(int, input().split()))\n abc[i] = x\nabc.sort(key=lambda x: min(x[0], x[1] - x[0]), reverse=True)\nfor j in range(n):\n if f > 0:\n ans += min(2 * abc[j][0], abc[j][1])\n f -= 1\n else:\n ans += min(abc[j][0], abc[j][1])\nprint(ans)\n", "import sys\n\nline = sys.stdin.readline().split()\n\nn = int(line[0])\nf = int(line[1])\n\nsobras = []\n\ntotal = 0\nsub_sobras = 0\n\nfor j in range(n):\n\tline = sys.stdin.readline().split()\n\tk = int(line[0])\n\ti = int(line[1])\n\tsub = i - k\n\tif(sub > 0):\n\t\ts = (2 * k) - i\n\t\tif(s > 0):\n\t\t\tsobras.append(sub)\n\t\t\tsub_sobras = sub + sub_sobras\n\t\telse:\n\t\t\tsobras.append(k)\n\t\t\tsub_sobras = k + sub_sobras\n\n\t\ttotal = total + k\n\telse:\n\t\ttotal = total + i\n\n#print(sobras)\n\nif f < len(sobras):\n\tsobras.sort(reverse=True)\n\tfor i in range(f):\n\t\ttotal = total + sobras[i]\nelse:\n\ttotal += sub_sobras\n\nprint(total)\n# 1495823763873\n", "numbers = list(map(int , input().split()))\r\narr = []\r\ncounter = 0\r\ndef sum (num1 , num2):\r\n if num1 > num2 :\r\n return num2\r\n else :\r\n return num1\r\nfor i in range(0 , numbers[0]) :\r\n x = list(map(int , input().split()))\r\n res = 0\r\n y = sum(x[1] , x[0])\r\n if x[0]*2 >= x[1]:\r\n res = x[1] - y\r\n else:\r\n res = x[0]*2 - y\r\n arr.append(res)\r\n counter += y\r\narr.sort(reverse=True)\r\nfor i in range (0 , numbers[1]) :\r\n counter += arr[i]\r\nprint(counter)\r\n", "n,k=map(int,input().split())\r\na=[];b=[];c=[];d=[];e=[]\r\nfor i in range(n):\r\n x,y=map(int,input().split())\r\n a.append(x)\r\n b.append(y)\r\n c.append(min(a[i],b[i]))\r\n d.append(min(2*a[i],b[i]))\r\n e.append(d[i]-c[i])\r\ne.sort(reverse=True)\r\nprint(sum(c) + sum(e[0:k]))", "n,f=map(int,input().split())\r\nls=[]\r\nsm=0\r\nfor i in range(n):\r\n p, c = map(int, input().split())\r\n ip=p*2\r\n sm+=min(p,c)\r\n ls.append(min(c,ip)-min(c,p))\r\n\r\nls.sort(reverse=True)\r\nsm+=sum(ls[:f])\r\nprint(sm)", "n, f = map(int, input().split(\" \"))\nproducts = 0\ntemp = []\n\nfor _ in range(n):\n k, l = map(int, input().split(\" \"))\n if k == 0:\n continue\n if k >= l:\n products += l\n elif k < l:\n products += k\n if k*2 >= l:\n temp.append(l-k)\n else:\n temp.append(k)\n\ntemp.sort(reverse=True)\nproducts += sum(temp[:f])\nprint(products)\n", "n, f = map(int, input().split())\r\nc = 0\r\narr = []\r\nfor i in range(n):\r\n a, b = map(int, input().split())\r\n if a >= b:\r\n c += b\r\n else:\r\n x = 2*a-b\r\n if x < 0:\r\n k = a\r\n else:\r\n k = a - x\r\n\r\n arr.append([k, b, a])\r\n\r\narr.sort()\r\narr.reverse()\r\nfor i in range(len(arr)):\r\n k, b, a = arr[i]\r\n if f > 0:\r\n f -= 1\r\n c += min(2*a, b)\r\n else:\r\n c += min(a, b)\r\n\r\n\r\nprint(c)", "a = [0] * 100005\r\nb = [0] * 100005\r\nc = [0] * 100005\r\n\r\nn, f = map(int, input().split())\r\nfor i in range(1, n + 1):\r\n a[i], b[i] = map(int, input().split())\r\n k = a[i] * 2\r\n if k >= b[i]:\r\n c[i] = b[i] - a[i]\r\n else:\r\n c[i] = a[i]\r\n if c[i] < 0:\r\n c[i] = 0\r\n\r\nc[1:] = sorted(c[1:], reverse=True)\r\ntot = 0\r\nfor i in range(1, f + 1):\r\n tot += c[i]\r\n\r\nfor i in range(1, n + 1):\r\n if b[i] >= a[i]:\r\n tot += a[i]\r\n else:\r\n tot += b[i]\r\nprint(tot)\r\n", "\"\"\"\r\n██╗ ██████╗ ██╗ ██████╗ ██████╗ ██╗ █████╗\r\n██║██╔═══██╗██║ ╚════██╗██╔═████╗███║██╔══██╗\r\n██║██║ ██║██║ █████╔╝██║██╔██║╚██║╚██████║\r\n██║██║ ██║██║ ██╔═══╝ ████╔╝██║ ██║ ╚═══██║\r\n██║╚██████╔╝██║ ███████╗╚██████╔╝ ██║ █████╔╝\r\n╚═╝ ╚═════╝ ╚═╝ ╚══════╝ ╚═════╝ ╚═╝ ╚════╝\r██████╗ ██╗██╗ ███████╗██╗ ██╗ ██████╗ ██████╗\r\n██╔══██╗██║██║ ██╔════╝██║ ██║██╔═══██╗██╔══██╗\r\n██║ ██║██║██║ ███████╗███████║██║ ██║██║ ██║\r\n██║ ██║██║██║ ╚════██║██╔══██║██║ ██║██║ ██║\r\n██████╔╝██║███████╗███████║██║ ██║╚██████╔╝██████╔╝\r\n╚═════╝ ╚═╝╚══════╝╚══════╝╚═╝ ╚═╝ ╚═════╝ ╚═════╝\r\n\"\"\"\r\nn, f = map(int ,input().split())\r\na = []\r\nfor i in range(n):\r\n\tx, l = map(int, input().split())\r\n\ta.append([abs(min(x, l) - min(x * 2, l)), min(x * 2, l)])\r\na.sort(reverse = True)\r\ncnt = 0\r\nfor i in range(f):\r\n\tcnt += a[i][1]\r\nfor i in range(f, n):\r\n\tcnt += a[i][1] - a[i][0]\r\nprint(cnt)\r\n", "n , f = [int(x) for x in input().split()]\r\n\r\nconsidered = []\r\nsumm = 0\r\nfor i in range(n):\r\n k , l = [int(x) for x in input().split()]\r\n summ += min(l , k)\r\n profit = max(min(l - k , k) , 0)\r\n considered.append(profit)\r\n\r\nconsidered.sort()\r\n\r\nprint(summ + sum(considered[n - f:]))\r\n", "n, f = map(int, input().split())\r\nproducts, limit = 0, []\r\n\r\nfor _ in range(n):\r\n k, l = map(int, input().split())\r\n products += min(k, l)\r\n limit.append(min(2*k, l) - min(k, l))\r\n\r\nlimit.sort()\r\nproducts += sum(limit[n - f:])\r\nprint(products)", "n,f=map(int,input().split())\r\na=[];tem=0\r\nfor _ in range(n):\r\n k,l=map(int,input().split())\r\n tem+=min(k,l)\r\n a.append(min(k*2,l)-min(k,l))\r\na.sort(reverse=True)\r\nprint(sum(a[:f])+tem)", "from sys import stdin, stdout\r\nfrom collections import defaultdict\r\nimport heapq as hq\r\ndef get_int(): return int(stdin.readline().strip())\r\ndef get_ints(): return map(int,stdin.readline().strip().split()) \r\ndef get_array(): return list(map(int,stdin.readline().strip().split()))\r\ndef get_string(): return stdin.readline().strip()\r\nINF=1e10\r\n#for _ in range(int(stdin.readline())):\r\nn,f=get_ints()\r\nk=[0]*n\r\nl=[0]*n\r\npos=0\r\na=[]\r\nfor i in range(n):\r\n k[i],l[i]=get_ints()\r\n a.append(list(map(int,(min(2*k[i],l[i])-min(k[i],l[i]),i))))\r\na.sort(reverse=True)\r\nans=0\r\nfor i in range(n):\r\n if i<f:\r\n pos=a[i][1]\r\n ans+=min(2*k[pos],l[pos])\r\n else:\r\n pos=a[i][1]\r\n ans+=min(k[pos],l[pos])\r\nprint(ans)\r\n", "def main():\r\n \r\n n = f = 0\r\n k = l = 0\r\n list1 = []\r\n ans = 0\r\n potential = 0\r\n \r\n n,f = map(int, input().split())\r\n \r\n for _ in range(n):\r\n k,l = map(int, input().split())\r\n ans += min(k,l)\r\n potential = max(l-k, 0)\r\n list1.append(min(k,potential))\r\n \r\n list1.sort(reverse = True)\r\n \r\n for x in range(f):\r\n ans += list1[x]\r\n \r\n print(ans)\r\n \r\n return\r\n\r\nmain()", "n, f = map(int, input().split(' '))\r\n\r\nsellouts = []\r\ntups = []\r\nfor i in range(n):\r\n tups.append(list(map(int, input().split(' '))))\r\n sellouts.append([min(2*tups[i][0],tups[i][1]) - min(tups[i][0],tups[i][1]), i])\r\n\r\nsellouts.sort(key=lambda x: x[0], reverse=True)\r\nans = 0\r\nfor i in range(f):\r\n pos = sellouts[i][1]\r\n ans += min(2*tups[pos][0], tups[pos][1])\r\n\r\nfor i in range(f, n):\r\n pos = sellouts[i][1]\r\n ans += min(tups[pos][0], tups[pos][1])\r\n\r\nprint(ans)\r\n", "n,f=map(int,input().split())\r\nt=list()\r\nfor _ in range(n):\r\n k,l=map(int,input().split())\r\n d=min(l,2*k)-min(l,k)\r\n t.append((k,l,d))\r\nt.sort(key=lambda x:x[2],reverse=True)\r\np=0\r\nfor i in range(f):\r\n k,l,d=t[i]\r\n p+=min(l,2*k)\r\nfor i in range(f,n):\r\n k,l,d=t[i]\r\n p+=min(l,k)\r\nprint(p)", "n , f = map(int , input().split())\r\n\r\ntally = []\r\n\r\nfor i in range(n):\r\n a , b = map(int , input().split())\r\n tally.append([a , b])\r\n\r\ndiff = []\r\ntotal = 0\r\nfor i in range(n):\r\n # diff.append(min(2*tally[i][0] - (tally[i][1] - tally[i][0])\r\n total += min(tally[i][1] , tally[i][0])\r\n\r\n diff.append(min(2*tally[i][0] , tally[i][1]) - min(tally[i][1] , tally[i][0]))\r\n\r\ndiff.sort()\r\n\r\nfor i in range(f):\r\n total += diff[n - 1 - i]\r\nprint(total)", "n,f=map(int,input().split())\r\nmat=[]\r\nres=0\r\nfor i in range(0,n):\r\n row=list(map(int,input().split()))\r\n res=res+min(row[0],row[1])\r\n mat.append(min(2*row[0],row[1])-min(row[0],row[1]))\r\n \r\nmat.sort(reverse=True)\r\nfor i in range(0,f):\r\n res=res+mat[i]\r\nprint(res)", "n, f = map(int, input().split())\r\nsum = 0\r\nd = []\r\nfor i in range(n):\r\n\ta, b = map(int, input().split()) #a is products, b is clients\r\n\tsum += min(a,b)\r\n\td.append(min(2*a,b)-min(a,b))\r\nd.sort(reverse=True)\r\nfor i in range(f):\r\n\tsum += d[i]\r\nprint(sum)", "def T(): return int(input())\r\ndef V(): return map(int, input().split())\r\ndef F(): return list(map(int, input().split()))\r\n\r\n\r\ndef solve():\r\n n, f = V()\r\n L = []\r\n res = 0\r\n for i in range(n):\r\n k, l = map(int, input().split())\r\n L.append(min(2 * k, l) - min(k, l))\r\n res += min(k, l)\r\n L.sort(reverse=True)\r\n res += sum(L[:f])\r\n print(res)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n", "import sys\r\nfrom math import sqrt,ceil,floor,gcd\r\nfrom collections import Counter\r\n\r\ninput = lambda:sys.stdin.readline()\r\n\r\ndef int_arr(): return list(map(int,input().split()))\r\ndef str_arr(): return list(map(str,input().split()))\r\ndef get_str(): return map(str,input().split())\r\ndef get_int(): return map(int,input().split())\r\ndef get_flo(): return map(float,input().split())\r\ndef lcm(a,b): return (a*b) // gcd(a,b)\r\n\r\nmod = 1000000007\r\n\r\ndef solve(n,f,arr):\r\n res = [0]*n\r\n Sum = 0\r\n for i in range(n):\r\n Sum += min(arr[i][0],arr[i][1])\r\n res[i] = min(2*arr[i][0],arr[i][1])-min(arr[i][0],arr[i][1])\r\n\r\n res.sort()\r\n Sum += sum(res[n-f:])\r\n print(Sum)\r\n\r\n\r\n\r\n\r\n# for _ in range(int(input())):\r\nn,f = get_int()\r\narr = []\r\nfor i in range(n):\r\n arr.append(int_arr())\r\nsolve(n,f,arr)\r\n ", "num, sellDays = map(int, input().split())\r\nplan = []\r\n\r\nfor i in range(num):\r\n products, customers = map(int, input().split())\r\n plan.append([products, customers, min(2*products, customers) - min(products, customers)])\r\n\r\nplan.sort(key = lambda x: x[2], reverse=True)\r\n\r\nfor i in plan:\r\n if sellDays != 0:\r\n i[0] *= 2\r\n sellDays -= 1\r\n\r\nans = 0\r\nfor triplet in plan:\r\n ans += min(triplet[0:2])\r\n\r\nprint(ans)", "n,f=input().strip().split(' ')\r\nn,f=(int(n),int(f))\r\nlist1=[]\r\nans=0\r\nfor i in range(n):\r\n k,l=input().strip().split(' ')\r\n k,l=(int(k),int(l))\r\n ans+=min(k,l)\r\n if k<l:\r\n list1.append(min(2*k,l)-k)\r\nlist1.sort()\r\nlist1.reverse()\r\nif f>len(list1):\r\n ans1=sum(list1)\r\nelse:\r\n ans1=sum(list1[0:f])\r\nprint(ans+ans1)", "n, f = map(int, input().split())\r\nls = []\r\nfor i in range(n):\r\n p, c = map(int, input().split())\r\n ip = p * 2\r\n ls.append([min(c, p), min(c, ip) - min(c, p)])\r\n\r\nls.sort(key=lambda x: x[1], reverse=True)\r\nsm = 0\r\nfor i in range(n):\r\n if i < f:\r\n sm += ls[i][0]\r\n sm += ls[i][1]\r\n else:\r\n sm += ls[i][0]\r\nprint(sm)", "number_days, number_chosen_days = map(int,input().split())\r\n\r\nres = 0\r\n\r\nselling_after_doubling = []\r\n\r\nfor i in range(number_days):\r\n products, clients = map(int,input().split())\r\n if (products == 0 or clients == 0):\r\n continue\r\n if (products >= clients):\r\n res += clients\r\n elif(products < clients):\r\n res += products\r\n if (products*2 <= clients):\r\n selling_after_doubling.append(products)\r\n if (products*2 > clients):\r\n selling_after_doubling.append(clients-products) \r\n # print(res)\r\n \r\nselling_after_doubling = sorted(selling_after_doubling,reverse=True)\r\n \r\nfor i in range(number_chosen_days):\r\n if (i>=len(selling_after_doubling)):\r\n break\r\n res+=selling_after_doubling[i]\r\n \r\nprint(res)", "from heapq import heappush, heappop\r\nn, f= map(int, input().split(' '))\r\nincrements = []\r\ntotal = 0\r\nfor _ in range(n):\r\n k, l = map(int, input().split(' '))\r\n x1 = min(k,l)\r\n x2 = min(2*k,l)\r\n total += x1\r\n increments.append(x2-x1)\r\n\r\nincrements.sort(reverse = True)\r\n\r\nfor i in range(f):\r\n total += increments[i]\r\n\r\nprint(total)\r\n", "n,f = map(int,input().split())\r\narr = []\r\nfor i in range(n):\r\n p,c = map(int,input().split())\r\n day = [c,p][p<=c],[c,2*p][2*p<=c]\r\n arr.append(day)\r\nsum = 0\r\nif f == 0:\r\n for m in arr[f:]:\r\n sum+=m[0]\r\nelse:\r\n arr.sort(reverse=True,key=lambda x:x[1]-x[0])\r\n for m in arr[0:f]:\r\n sum+=m[1]\r\n for m in arr[f:]:\r\n sum+=m[0]\r\nprint(sum)", "d ,t = [] , 0\r\nn , f = map(int,input().split())\r\nfor _ in range(n):\r\n\tk , l = map(int,input().split())\r\n\tt +=min(k ,l)\r\n\td.append(min(k*2 , l) - min(k ,l))\r\nd.sort()\r\nt+= sum(d[n-f:])\r\nprint(t)\r\n", "n,f = list(map(int, input().split()))\r\npairs=[]\r\ncount = 0\r\nfor i in range(n):\r\n k,l = list(map(int, input().split()))\r\n if k >= l:\r\n count+=l\r\n else:\r\n pairs.append(min(l - k, k))\r\n count+=k\r\npairs.sort()\r\nfor i in range(min(f,len(pairs))):\r\n count+=pairs.pop()\r\nprint(count)", "import bisect\r\nimport collections\r\nimport copy\r\nimport functools\r\nimport heapq\r\nimport itertools\r\nimport math\r\nimport sys\r\nimport string\r\nsys.setrecursionlimit(99999)\r\n\r\nn,f = map(int,input().split())\r\nm = []\r\nans = 0\r\nfor _ in range(n):\r\n k,l = map(int,input().split())\r\n ans+=min(k,l)\r\n heapq.heappush(m,-min(2*k,l)+min(k,l))\r\n\r\nfor _ in range(f):\r\n ht = heapq.heappop(m)\r\n ans-=ht\r\nprint(ans)", "n, f = map(int, input().split())\r\nprod = 0 \r\nlis = []\r\nfor i in range(n):\r\n\tk, l = map(int, input().split())\r\n\tprod += min(k, l)\r\n\tlis.append(min(2*k, l) - min(k, l))\r\nlis.sort(reverse = True)\r\ni = 0 \r\nwhile f and i < len(lis):\r\n\tprod += lis[i]\r\n\ti += 1 \r\n\tf -= 1 \r\nprint(prod)", "\r\n\r\n# Define class P(ki, li)\r\nclass P:\r\n \r\n def __init__(self, ki, li):\r\n self.ki = ki\r\n self.li = li\r\n self.val = min(2 * ki, li) - min(ki, li)\r\n \r\n \r\n(n, f) = [int(i) for i in input().split()]\r\nl = []\r\nfor i in range(0, n):\r\n x, y = [int(i) for i in input().split()]\r\n p = P(x, y)\r\n l.append(p)\r\n\r\nl.sort(key = lambda x: x.val, reverse = True)\r\n \r\nfor i in range(0, f):\r\n l[i].ki = l[i].ki * 2\r\n\r\nans = 0\r\nfor i in range(0, n):\r\n ans = ans + min(l[i].ki, l[i].li)\r\n\r\nprint(ans)\r\n \r\n\r\n", "n,f=map(int,input().split())\nt=[]\nans=0\nfor i in range(n):\n a,b=map(int,input().split())\n if a>b:\n ans+=b\n else:\n ans+=a\n t.append(min(a*2,b)-a)\nt.sort(reverse=True)\nf=min(f, len(t))\nfor i in range(f):\n ans+=t[i]\nprint(ans)\n\t \t\t\t\t \t \t \t \t \t\t \t \t \t", "def mp(): return map(int,input().split())\r\ndef lt(): return list(map(int,input().split()))\r\ndef pt(x): print(x)\r\ndef ip(): return input()\r\ndef it(): return int(input())\r\ndef sl(x): return [t for t in x]\r\ndef spl(x): return x.split()\r\ndef aj(liste, item): liste.append(item)\r\ndef bin(x): return \"{0:b}\".format(x)\r\ndef listring(l): return ' '.join([str(x) for x in l])\r\ndef ptlist(l): print(' '.join([str(x) for x in l]))\r\n\r\nn,f = mp()\r\nk,l = [],[]\r\nfor _ in range(n):\r\n a,b = mp()\r\n k.append(a)\r\n l.append(b)\r\n\r\nb = list(range(n))\r\nb.sort(key = lambda x: min(k[x]*2,l[x])-min(k[x],l[x]),reverse = True)\r\nfor i in range(f):\r\n k[b[i]] *= 2\r\npt(sum(min(k[x],l[x]) for x in range(n)))", "from sys import stdin,stdout\r\nimport collections\r\nimport itertools\r\nimport operator\r\nimport functools\r\ndef ii():return int(stdin.readline())\r\ndef mi():return map(int,stdin.readline().split())\r\ndef li():return list(mi())\r\ndef si():return stdin.readline()\r\n\r\nn,f = mi()\r\nl1 = []\r\nl2 = []\r\nans = 0\r\nfor i in range(n):\r\n p,c = mi()\r\n l1.append([p,c])\r\n l2.append([min(2*p,c)-min(p,c),i])\r\nl2.sort(reverse =True)\r\nfor i in range(f):\r\n ind = l2[i][1]\r\n ans+= min(2*l1[ind][0],l1[ind][1])\r\nfor i in range(f,n):\r\n ind = l2[i][1]\r\n ans+=min(l1[ind][0],l1[ind][1])\r\nprint(ans)", "#n=int(input())\n#n,m=map(int,input().split())\n#se=set([*input().split()][1:])\n#l=list(map(int,input().split()))\n#input=sys.stdin.readline\n\n#from bisect import*\n#from decimal import Decimal\n\n# import sys\n# sys.stdin=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/input.txt\",\"r\")\n# sys.stdout=open(\"/Users/mohamed/Folders/Desktop/Problem-Solving/CPC/PY/output.txt\",\"w\")\n\n\nimport sys\nimport math\nfor _ in range(1):\n n,f=map(int,input().split())\n l=[]\n res=0\n for i in range(n):\n a,b=map(int,input().split())\n res+=min(a,b)\n l.append(min(a*2,b)-min(a,b))\n\n l.sort()\n o=len(l)\n for i in range(f):\n res+=l[o-1-i]\n print(res)\n\n\n \n\n\n\n\n\n \n \n\n\n\n\n\n\n", "R = lambda: map(int, input().rstrip().split())\nn, f = R()\nli = []\nfor _ in range(n):\n li.append(list(R()))\nans = 0\nm = []\nfor l in li:\n x, y = l\n if x >= y:\n ans += y\n m.append(0)\n else:\n ans += x\n m.append(min(x, y - x))\nm.sort(reverse=True)\nfor i in range(f):\n ans += m[i]\nprint(ans)", "def one_line_input(): return list(map(int, input().split()))\r\n\r\n\r\nn, f = one_line_input()\r\nfinal_product = []\r\ncount = 0\r\nfor i in range(n):\r\n k, l = one_line_input()\r\n tup = (min(2*k, l)-min(k, l), k, l)\r\n final_product.append(tup)\r\nfinal_product = sorted(final_product)\r\nfor i in range(n-1, -1, -1):\r\n if f > 0:\r\n count += min(final_product[i][1]*2, final_product[i][2])\r\n f -= 1\r\n continue\r\n count += min(final_product[i][1], final_product[i][2])\r\n\r\nprint(count)", "n,f=map(int,input().split())\r\na=0\r\nb=[]\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n a+=min(l,k)\r\n b+=[min(2*k,l)-min(k,l)]\r\nb=sorted(b,reverse=True)\r\nprint(a+sum(b[:f]))\r\n \r\n", "import sys\r\nimport math\r\nimport collections\r\ndef get_ints(): return map(int, sys.stdin.readline().strip().split())\r\ndef get_list(): return list(map(int, sys.stdin.readline().strip().split()))\r\ndef get_string(): return sys.stdin.readline().strip()\r\nn,f=get_ints()\r\nselected=[]\r\ndouble=[]\r\nfor i in range(n):\r\n k,l=get_ints()\r\n s=min(k,l)\r\n selected.append(s)\r\n new_s=min(2*k,l)\r\n change=new_s-s\r\n double.append(change)\r\ndouble.sort(reverse=True)\r\nans=sum(selected)+sum(double[:f])\r\nprint(ans)", "n,f=map(int,input().split())\r\nq=[]\r\na=[]\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n q.append((k,l))\r\n u=min(2*k,l)-min(k,l)\r\n # print(u,i)\r\n a.append((u,i))\r\na.sort(reverse=True)\r\nans=0\r\nfor i in range(0,f):\r\n pos=a[i][1]\r\n ans+=min(2*q[pos][0],q[pos][1])\r\n \r\nfor i in range(f,n):\r\n pos=a[i][1]\r\n ans+=min(q[pos][0],q[pos][1])\r\nprint(ans)", "n,f = map(int,input().split())\r\nsold=0\r\nsell_out=[]\r\n\r\nfor i in range(n):\r\n a,b = map(int,input().split())\r\n c = min(a,b)\r\n d = min(2*a,b)\r\n sold+=c\r\n sell_out.append(d-c)\r\n\r\nsell_out.sort()\r\nfor i in range(n-1,n-f-1,-1):\r\n sold += sell_out[i]\r\n\r\nprint(sold)\r\n", "n,f = map(int,input().split())\nls = []\nsum=0\nfor i in range(0,n):\n x , y = map(int,input().split())\n sum+=min(x,y)\n ls.append(min(2*x,y)-min(x,y))\nls = sorted(ls)\nc = f\ni= len(ls)-1\nwhile c>0:\n c-=1\n sum+=ls[i]\n i-=1\nprint(sum)\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\nx = 0\r\ny =[]\r\nfor i in range(n):\r\n k,l = list(map(int,input().split()))\r\n x+=min(k,l)\r\n y.append((min(2*k,l)-min(k,l)))\r\ny.sort(reverse = True)\r\nfor i in range(m) :\r\n x+=y[i]\r\nprint(x)\r\n ", "n, f = list(map(int, input().split()))\r\nday = []\r\nre = 0\r\nfor _ in range(n):\r\n k, l = tuple(map(int, input().split()))\r\n re += min(k, l)\r\n day.append(min(l, k * 2) - min(l, k))\r\nday.sort(reverse=True)\r\nfor i in range(f):\r\n re += day[i]\r\nprint(re)\r\n", "from collections import defaultdict as dd\nfrom collections import deque\nimport bisect\nimport heapq\n \ndef ri():\n return int(input())\n \ndef rl():\n return list(map(int, input().split()))\n \n \nn, f = rl()\nkk = []\nll = []\nfor _ in range(n):\n k, l = rl()\n kk.append(k)\n ll.append(l)\nbase = 0\npotential = []\nfor i in range(n):\n if kk[i] < ll[i]:\n base += kk[i]\n if 2 * kk[i] <= ll[i]:\n potential.append(kk[i])\n else:\n potential.append(ll[i] - kk[i])\n else:\n base += ll[i]\n\npotential.sort(reverse=True)\nmini = min(f, len(potential))\nans = base + sum(potential[:mini])\nprint(ans)\n\n", "a,b=map(int,input().split())\r\ns=0;p=[]\r\nfor _ in \" \"*a:\r\n c,d=map(int,input().split())\r\n if c>=d:s+=d\r\n elif c and d:\r\n s+=c\r\n p+=[min(d-c,c)]\r\np=sorted(p,reverse=True)\r\nprint(s+sum(p[:b]))", "def sold(goods, customers):\r\n if goods <= customers:\r\n return goods\r\n else:\r\n return customers\r\n \r\n \r\nn, sales = (int(x) for x in input().split())\r\nplan = []\r\nwins = []\r\n\r\nfor i in range(n):\r\n goods, customers = (int(x) for x in input().split())\r\n plan.append((goods, customers))\r\n win = sold(2 * goods, customers) - sold(goods, customers)\r\n wins.append(win)\r\n\r\nwins = sorted(wins, reverse=True)\r\n# print(wins)\r\nans = sum(sold(*x) for x in plan)\r\nans += sum(wins[i] for i in range(sales))\r\nprint(ans)\r\n\r\n", "n,f=map(int,input().split())\r\nproducts,clients=[0]*n,[0]*n\r\nfor i in range(n):\r\n products[i],clients[i]=map(int,input().split())\r\ngain=[0]*n\r\noriginalCoast=0\r\nfor i in range(n):\r\n if products[i]>clients[i]:\r\n originalCoast+=clients[i]\r\n continue\r\n originalCoast+=products[i]\r\n if clients[i]>2*products[i]:\r\n gain[i]=products[i]\r\n else:\r\n gain[i]=clients[i]-products[i]\r\ngain.sort(reverse=True)\r\nmaxGain=0\r\nfor i in range(f):\r\n maxGain+=gain[i]\r\n\r\nprint(maxGain+originalCoast)\r\n", "\r\nn,f=map(int,input().split())\r\na,ans=[0]*n,0\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n ans+=min(k,l)\r\n a[i]=min(2*k,l)-min(k,l)\r\nans+=sum(sorted(a)[n-f:])\r\nprint(ans)\r\n", "n, f = map(int, input().split())\r\na = []\r\ns = 0\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n s+=min(k, l)\r\n a.append(min(2*k, l) - min(k, l))\r\na.sort()\r\nprint(s+sum(a[n-f:]))\r\n", "#python3\r\nimport sys, threading, os.path\r\nimport collections, heapq, math,bisect\r\nimport string\r\nfrom platform import python_version\r\nimport itertools\r\nsys.setrecursionlimit(10**6)\r\nthreading.stack_size(2**27) \r\n\r\ndef main():\r\n if os.path.exists('input.txt'):\r\n input = open('input.txt', 'r')\r\n else:\r\n input = sys.stdin\r\n #--------------------------------INPUT---------------------------------\r\n n, f = list(map(int, input.readline().split()))\r\n lis=[]\r\n initsum=0\r\n for i in range(n):\r\n lis.append(list(map(int, input.readline().split())))\r\n initsum += lis[i][0]\r\n #print(lis)\r\n #print(initsum)\r\n results=[]\r\n for x,y in lis:\r\n if x>=y:\r\n results.append([initsum+(y-x),y,y])\r\n elif x<y and x*2>=y:\r\n results.append([initsum+(y-x),y,x])\r\n else:\r\n results.append([initsum+((x*2)-x),x*2,x])\r\n #print(results)\r\n results = sorted(results,reverse = True)\r\n sum = 0\r\n for i in range(n):\r\n if i+1>f:\r\n sum+=results[i][2]\r\n else:\r\n sum+=results[i][1]\r\n output=sum\r\n #-------------------------------OUTPUT----------------------------------\r\n if os.path.exists('output.txt'):\r\n open('output.txt', 'w').writelines(str(output))\r\n else:\r\n sys.stdout.write(str(output))\r\n\r\n\r\nif __name__ == '__main__':\r\n main()\r\n#threading.Thread(target=main).start()", "import sys\r\nread=lambda:sys.stdin.readline().rstrip()\r\nreadi=lambda:int(sys.stdin.readline())\r\nwriteln=lambda x:sys.stdout.write(str(x)+\"\\n\")\r\nwrite=lambda x:sys.stdout.write(x)\r\ndef getM(k,l):\r\n if k == 0:\r\n return 0\r\n if l >= 2*k:\r\n return 2*k\r\n else:\r\n return l\r\n\r\ndef getO(k,l):\r\n if k == 0:\r\n return 0\r\n if l >= k:\r\n return k\r\n else:\r\n return l\r\n\r\nN,F=map(int, read().split())\r\ndays=[]\r\nfor i in range(N):\r\n K,L = map(int, read().split())\r\n M = getM(K,L)\r\n O = getO(K,L)\r\n days.append((M-O,M,O))\r\ndays.sort(key=lambda x:x[0])\r\nsm = 0\r\nfor i in range(F):\r\n _, m, _ = days[-1-i]\r\n sm += m\r\nfor i in range(N-F):\r\n _, _, o = days[-1-F-i]\r\n sm += o\r\nwriteln(sm)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "n,k=map(int,input().split())\r\ns=0\r\nc=[]\r\nl=0\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n if a>=b:\r\n s+=b\r\n else:\r\n s+=a\r\n if 2*a>=b:\r\n c.append(b-a)\r\n l+=1\r\n else:\r\n c.append(a)\r\n l+=1\r\nc=sorted(c)\r\nc=c[::-1]\r\nif l<k:\r\n k=l\r\nfor i in range(k):\r\n s+=c[i]\r\nprint(s)\r\n", "n,f=[int(x) for x in input().split()]\r\nl=[]\r\nk=[]\r\nfor i in range(n):\r\n x,o = [int(i) for i in input().split()]\r\n k.append(x)\r\n l.append(o)\r\ns=0\r\nz=[]\r\nfor i in range(n):\r\n if k[i]>=l[i]:\r\n z.append(l[i])\r\n else:\r\n z.append(k[i])\r\ny=[]\r\nfor i in range(n):\r\n if 2*k[i]>=l[i]:\r\n y.append(l[i])\r\n else:\r\n y.append(2*k[i])\r\nh=[]\r\n\r\nfor i in range(n):\r\n h.append(y[i]-z[i])\r\nh.sort(reverse=True)\r\nfor i in h:\r\n if f<1:\r\n break\r\n s+=i\r\n f-=1\r\ns+=sum(z)\r\nprint(s)", "n, f= list(map(int, input().split()))\r\nn_max=0\r\ncomplete=[]\r\ncomplete_1=[]\r\nfinal=[]\r\nfor j in range(n):\r\n k, l= list(map(int, input().split()))\r\n complete.append([k,l])\r\n complete_1.append([2*k,l])\r\n\r\nfor i in range(n):\r\n a=min(complete[i])\r\n b=min(complete_1[i])\r\n n_max+=a\r\n final.append(b-a)\r\nfinal.sort(reverse=True)\r\n\r\nfor h in range(f):\r\n n_max+=final[h]\r\nprint(n_max)\r\n", "from sys import stdin\r\nfrom bisect import bisect_left as bl\r\nfrom collections import defaultdict\r\n\r\ninput = stdin.readline\r\nread = lambda: map(int, input().strip().split())\r\n\r\nn, f = read()\r\nlst = [0] * n\r\nans = 0\r\narr = []\r\nfor i in range(n):\r\n lst[i] = list(read())\r\n ans += min(lst[i])\r\n if 0 < lst[i][0] < lst[i][1]:\r\n arr.append(min(lst[i][0], lst[i][1] - lst[i][0]))\r\narr.sort(reverse=True)\r\nprint(ans + sum(arr[:f]))\r\n# 4 2\r\n# 5 9\r\n# 3 5\r\n# 2 3\r\n# 1 5\r\n", "n, f = map(int, input().split())\r\npros = 0; lst = []\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n lst.append(min(2 * k, l) - min(k, l))\r\n pros += min(k, l)\r\nlst = sorted(lst, reverse=True)\r\npros += sum(lst[:f])\r\nprint(pros)\r\n", "n,f=map(int,input().split())\r\nf=min(f,n)\r\ngain=[]\r\n\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n \r\n gain.append([max(min(k,l-k),0),min(2*k,l),min(k,l)])\r\ngain.sort(reverse=True)\r\n\r\n\r\nsum1=0\r\nfor i in range(f):\r\n sum1+=gain[i][1]\r\n \r\nfor i in range(f,n):\r\n sum1+=gain[i][2]\r\nprint(sum1)\r\n", "n,ff=map(int,input().split())\r\nL=[]\r\nL1=[]\r\nfor i in range(n):\r\n t=tuple(map(int,input().split()))\r\n L.append((min(2*t[0],t[1])-min(t[0],t[1]),min(2*t[0],t[1]),min(t[0],t[1])))\r\n\r\nL.sort(key=lambda x:x[0],reverse=True)\r\nprint(sum([L[i][1] for i in range(ff)])+sum([L[i][2] for i in range(ff,n)]))\r\n\r\n", "# http://codeforces.com/problemset/problem/810/B\n\nn, f = map(int, input().split())\nplan = []\nresult = 0\n\nfor i in range(n):\n k, l = map(int, input().split())\n a = k if k <= l else l\n result += a\n\n k *= 2\n plan.append((k if k <= l else l) - a)\n\nresult += sum(sorted(plan, reverse=True)[:f])\nprint(result)\n", "n,f=map(int,input().split())\r\np=[]\r\nc=0\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n c+=min(k,l)\r\n p+=[abs(min(k,l)-min(2*k,l))]\r\np.sort(reverse=True)\r\nc+=sum(p[:f])\r\nprint(c)\r\n\r\n", "days, sale_days = map(int, input().split())\r\n\r\ndiff = []\r\nans = 0\r\nfor _ in range(days):\r\n products, clients = map(int, input().split())\r\n normal_sale = min(products, clients)\r\n ans += normal_sale\r\n diff.append(min(2*products, clients) - normal_sale)\r\n\r\ndiff.sort(reverse=True)\r\nans += sum(diff[:sale_days])\r\nprint(ans)\r\n", "n, f = map(int, input().split())\nt = 0\ndiff = []\nfor i in range(n):\n k, l = map(int, input().split())\n if k < l:\n t += k\n n = k*2 if l > k*2 else l\n diff.append(n - k)\n else:\n t += l\nt += sum(sorted(diff, reverse=True)[:f])\nprint(t)\n\n", "if __name__ == '__main__':\r\n n, f = tuple(map(int, input().split(' ')))\r\n diff = []\r\n sum_ = 0\r\n for i in range(n):\r\n k, l = tuple(map(int, input().split(' ')))\r\n sum_ += min(l,k)\r\n diff.append(min(2*k,l)-min(l,k))\r\n diff.sort(reverse=True)\r\n sum_ += sum(diff[:f])\r\n print(sum_)\r\n", "n, m = map(int,input().split())\r\nxx= []\r\nyy=[]\r\n\r\nfor i in range(n):\r\n x, y = map(int,input().split())\r\n xx.append((min(x*2,y)-min(x,y),i))\r\n yy.append((min(x*2,y),min(x,y)))\r\n\r\n\r\nxx.sort(key=lambda x:x[0])\r\nc=0\r\n\r\nfor i in range (len(xx)-1,-1,-1):\r\n ind = xx[i][1]\r\n if(m>0):\r\n c+=yy[ind][0]\r\n else:\r\n c+=yy[ind][1]\r\n m-=1\r\n \r\n\r\nprint(c)", "n, sellout_count = map(int, input().split())\r\ndays = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nsold_items = 0\r\nincreasing_chart = []\r\nfor items, customers in days:\r\n increasing_chart.append(min(items * 2, customers) - min(items, customers))\r\n sold_items += min(items, customers)\r\nsold_items += sum(sorted(increasing_chart)[:-sellout_count-1:-1])\r\nprint(sold_items)\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\n\r\ndef solve():\r\n day,so_day = invr()\r\n good = []\r\n client = []\r\n add_good =[]\r\n _sum = 0\r\n for i in range(day):\r\n _g,_c= invr()\r\n good.append(_g)\r\n client.append(_c)\r\n if _g > 0 and _c > 0 :\r\n _sum = _sum + _g if _c > _g else _sum + _c\r\n if _c >= _g :\r\n add = _c - _g if _c - _g*2 <0 else _g\r\n add_good.append(add)\r\n\r\n add_good.sort(reverse= True)\r\n add_good = sum(add_good[:so_day])\r\n result = _sum + add_good\r\n print(result)\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nCreated on Wed Jun 20 18:21:25 2018\r\n\r\n@author: Arsanuos\r\n\"\"\"\r\n\r\n\r\ndef main():\r\n rd = lambda : tuple(map(int, input().split()))\r\n n, f = rd()\r\n arr = []\r\n cnt = 0\r\n for i in range(n):\r\n p, c = rd()\r\n s = min(p, c)\r\n sf = min(2*p, c)\r\n cnt += s\r\n arr.append(sf - s)\r\n arr.sort(reverse=True)\r\n cnt += sum(filter(lambda x: x >0, arr[:f]))\r\n print(cnt)\r\n \r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "n,k=map(int,input().split())\r\ns=0;e=[];c=[];d=[]\r\nfor i in range(n):\r\n a,b=map(int,input().split())\r\n c.append(min(a,b))\r\n d.append(min(2*a,b))\r\n s+=c[i]\r\n e.append(d[i]-c[i])\r\n#print(s)\r\ne.sort()\r\nfor i in range(n-1,n-k-1,-1):\r\n s+=e[i]\r\nprint(s)", "n, f = list(map(int, input().split()))\r\n\r\nar = []\r\n\r\ncost = 0\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n cost += min(l, k)\r\n ar.append(min(l, 2*k) - min(l, k))\r\n\r\nar.sort()\r\n\r\n\r\nprint(cost + sum(ar[n-f:]))\r\n", "if __name__ == \"__main__\":\r\n sell_off = []\r\n n , f = list(map(int,input().split()))\r\n ans = 0\r\n for i in range(n):\r\n k,l = list(map(int, input().split()))\r\n ans += min(k,l)\r\n if k >= l:\r\n sell_off.append(0)\r\n else:\r\n sell_off.append(min(2*k, l)-k)\r\n sell_off.sort(reverse=True)\r\n for i in range(f):\r\n ans += sell_off[i]\r\n print(ans)", "n,f=[int(i)for i in input().split()]\r\nl=[]\r\nh=[]\r\nfor i in range(n):\r\n\ta,b=[int(i)for i in input().split()]\r\n\tl+=[abs(min(a,b)-min(a*2,b))]\r\n\th+=[min(a,b)]\r\nl.sort()\r\nl=l[::-1]\r\nans=0\r\nfor i in range(f):\r\n\tans+=l[i]\r\nprint(ans+sum(h))", "def summer_sell_off(n,f,l):\r\n total=0\r\n a=[0]*n\r\n for i in range(n):\r\n total+=min(l[i][0],l[i][1])\r\n if l[i][0]<l[i][1]:\r\n a[i]=min(2*l[i][0],l[i][1])-min(l[i][0],l[i][1])\r\n s=sorted(a,reverse=True)\r\n j=0\r\n while f and j<n:\r\n if s[j]>0:\r\n total+=s[j]\r\n f-=1\r\n j+=1\r\n print (total)\r\n\r\nn,f=[int(x) for x in input().split()]\r\nl=[]\r\nfor i in range(n):\r\n l.append([int(x) for x in input().split()])\r\nsummer_sell_off(n,f,l)", "n,k=map(int,input().strip().split())\r\nsum=0\r\nA=[]*100000\r\nfor _ in range(n):\r\n\ta,b=map(int,input().strip().split())\r\n\tsum=sum+min(a,b)\r\n\ttemp=max(0,min(b-a,a))\r\n\tA.append(temp)\r\nA.sort(reverse=True)\r\nfor i in range(k):\r\n\tsum=sum+A[i]\r\nprint(sum)", "n, f = map(int, input().split())\nlst = [tuple(map(int, input().split())) for _ in range(n)]\nlst.sort(key=lambda x: min(x[0]*2, x[1]) - min(x[0], x[1]), reverse=True)\n\n# print(lst)\n\nprint(sum(min(x*2, y) for x, y in lst[:f]) + sum(min(x, y) for x, y in lst[f:]))\n", "n,f = map(int, input().split())\nV_prom = []\ntot = 0\nfor i in range(n):\n k,l = map(int, input().split())\n tot += min(k,l)\n V_prom.append(min(2*k,l) - min(k,l))\n\nV_prom.sort()\nfor _ in range(f):\n tot += V_prom.pop()\n\nprint(tot)\n\n\n", "n, f = map(int, input().split())\r\na = []\r\nresult = 0\r\nfor i in range(n):\r\n k,l = map(int, input().split())\r\n result += min(k,l)\r\n a.append(min(2*k,l) - min(k,l))\r\n\r\na.sort()\r\nresult += sum(a[n-f:])\r\nprint(result)\r\n", "n,f = map(int,input().split())\r\na = [0]*n\r\nans = 0\r\nfor i in range(n):\r\n k,l = map(int,input().split())\r\n a[i] = min(2*k,l)-min(k,l)\r\n ans += min(k,l)\r\na = sorted(a)\r\na = a[n-f:]\r\nans += sum(a)\r\nprint(ans)", "n,f = map(int,input().split())\r\nl = []\r\ns = 0\r\nfor i in range(n):\r\n a,b = map(int, input().split())\r\n x,y = min(a,b),min(2*a,b)\r\n s+=x\r\n l.append(y-x)\r\nl.sort(reverse=True)\r\ns+=sum(l[:f])\r\nprint(s)", "import math\r\nimport sys\r\nn,c=map(int,(input().split()))\r\nli=[]\r\nsum=0\r\nflag=0\r\nfor _ in range(n):\r\n k,l=map(int,input().split())\r\n li.append((k,l,min(2*k,l)-k))\r\nli.sort(key=lambda x:x[2],reverse=True)\r\nfor i in range(n):\r\n k,l,s=li[i]\r\n if(c>0):\r\n sum+=min(2*k,l)\r\n else:\r\n sum+=min(k,l)\r\n c-=1\r\nprint(sum)\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,f=(int(i) for i in input().split())\r\nl=[]\r\nc=0\r\nfor i in range(n):\r\n a,b=(int(i) for i in input().split())\r\n l.append(min(2*a,b)-min(a,b))\r\n c+=min(a,b)\r\nl=sorted(l,reverse=True)\r\nprint(c+sum(l[:f]))", "n,f=map(int,input().split())\r\na=0\r\nb=[]\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n a+=min(k,l)\r\n b+=[min(2*k,l)-min(k,l)]\r\n\r\nb.sort(reverse=True)\r\nprint(a+sum(b[:f]))\r\n", "import math\n\nn,k = map(int,input().split())\nsum = 0\nl= []\n\nfor i in range(n):\n a,b= map(int,input().split())\n l.append( min(2*a,b) - min(a,b) )\n sum+=min(a,b)\n\nl.sort()\n\nfor i in l[n-k:n]:\n sum+=i\n\nprint(sum)", "from sys import stdin\r\ninFile = stdin\r\ntokens = []\r\ntokens_next = 0\r\n\r\ndef next_str():\r\n global tokens, tokens_next\r\n while tokens_next >= len(tokens):\r\n tokens = inFile.readline().split()\r\n tokens_next = 0\r\n tokens_next += 1\r\n return tokens[tokens_next - 1]\r\n\r\ndef nextInt():\r\n return int(next_str())\r\n \r\n# take input \r\nn = nextInt()\r\nf = nextInt()\r\ndays = [(nextInt(), nextInt()) for _ in range(n)]\r\n\r\n# sort by best beneficial days\r\ndays = sorted(days,key=lambda x : min(x[0], x[1] - x[0]))\r\ndays = reversed(days)\r\ndays = list(days)\r\n\r\n# update days\r\ndays[:f] = [(days[i][0] * 2, days[i][1]) for i in range(f)]\r\n\r\n# get number of sold products\r\ns = sum([min(x[0], x[1]) for x in days])\r\nprint(s)", "n, f = map(int, input().split())\n\nK = []\nL = []\nfor _ in range(n):\n k, l = map(int, input().split())\n K.append(k)\n L.append(l)\ngain = []\ninit_diff = []\nfor k,l in zip(K, L):\n init_v = min(k,l)\n double_v = min(k*2,l)\n gain.append(double_v - init_v)\n init_diff.append(init_v)\n\n\ngain.sort(reverse=True)\ns = sum(init_diff)\nfor i in range(f):\n s += gain[i]\n\nprint(s)\n\n", "n, f = map(int,input().split())\r\ns, p = 0, []\r\nfor _ in range(n):\r\n c, d = map(int,input().split())\r\n if c >= d:\r\n s += d\r\n elif c and d:\r\n s += c\r\n p += [min(d - c, c)]\r\np = sorted(p, reverse = True)\r\nprint(s + sum(p[:f]))", "L= [int(x) for x in input().split()]\r\nn = L[0]\r\nf = L[1]\r\nMAXI= 0\r\nT= []\r\nfor i in range(n):\r\n day = [int(x) for x in input().split()]\r\n k = day[0]\r\n l = day[1]\r\n sold = min(k,l)\r\n MAXI += sold\r\n T.append(min(2*k,l)-sold)\r\nT.sort(reverse = True)\r\nfor j in range(f):\r\n MAXI+=T[j]\r\nprint(MAXI)", "n,f =map(int,input().split())\r\nz=0\r\na=[]\r\nfor i in range(n):\r\n products,clients=map(int,input().split())\r\n z+=min(products,clients)\r\n a.append(min(2*products,clients)-min(products,clients))\r\na.sort()\r\nprint(z+sum(a[n-f:]))", "n, f = map(int, input().split())\r\ndays = []\r\n\r\nfor _ in range(n):\r\n ki, li = map(int, input().split())\r\n potential_profit = min(2 * ki, li) - min(ki, li)\r\n days.append((potential_profit, ki, li))\r\n\r\ndays.sort(reverse=True)\r\n\r\ntotal_sold_products = 0\r\nfor i in range(n):\r\n if i < f:\r\n total_sold_products += min(2 * days[i][1], days[i][2])\r\n else:\r\n total_sold_products += min(days[i][1], days[i][2])\r\n\r\nprint(total_sold_products)\r\n", "n,f = map(int, input().split())\r\n\r\nans = 0\r\nvalues = []\r\nfor i in range(n):\r\n x,y = map(int, input().split())\r\n values.append(min(x*2,y)-min(x,y))\r\n ans += min(x,y)\r\n\r\n\r\nvalues.sort(reverse=True)\r\nans+=sum(values[:f])\r\n\r\nprint(ans)\r\n", "n,f=map(int,input().split())\nw=[[int(x) for x in input().split()]for i in range(n)]\nsum1=0\nfinal=[0]*n\nfor j in range(len(w)):\n sum1=sum1+min(w[j][0],w[j][1])\n final[j]=min(2*w[j][0],w[j][1])-min(w[j][0],w[j][1])\nfinal.sort(reverse=True)\nfor i in range(f):\n sum1=sum1+final[i]\nprint(sum1)\n \n \n", "line = [int(x) for x in input().split()]\nn = line[0]\nf = line[1]\n\nresult = 0\ndiffs = []\nfor case in range(n):\n day = [int(x) for x in input().split()]\n k = day[0]\n l = day[1]\n sold = min(k,l)\n result += sold\n diffs.append(min(2*k,l)-sold)\n\ndiffs.sort(reverse = True)\nfor i in range(f):\n result += diffs[i]\nprint(result)", "n, f = map(int, input().split())\r\nz = 0\r\na = []\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n z += min(k,l)\r\n a.append(min(2*k, l) - min(k, l))\r\n\r\na.sort()\r\nprint(z + sum(a[n-f:]))\r\n", "n,f = list(map(int, input().split()))\r\nans = 0\r\narr = []\r\nfor _ in range(n):\r\n k, l = list(map(int, input().split()))\r\n if k < l:\r\n arr.append(min((l-k, k)))\r\n ans += min([k, l])\r\n # print(ans, arr)\r\narr.sort(reverse=True)\r\nans += sum(arr[:min((f, len(arr)))])\r\nprint(ans)", "n,f=map(int,input().split())\r\np=[]\r\nc=0\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n p+=[[abs(min(k,l)-min(2*k,l)),max(min(2*k,l),min(k,l)),min(2*k,l),min(k,l)]]\r\np.sort(reverse=True)\r\nfor j in p:\r\n if f!=0:\r\n c+=j[2]\r\n f-=1\r\n else:\r\n c+=j[3]\r\nprint(c)\r\n", "ls = []\r\nn , f = map(int,input().split())\r\ns = 0\r\nfor i in range(n):\r\n\tk , l = map(int,input().split())\r\n\ts+= min(k,l)\r\n\tls.append(min([k*2,l])-min([k,l]))\r\n\r\nls = sorted(ls,reverse = True)\r\n\r\nprint(s+sum(ls[0:f]))\r\n", "a,b = map(int,input().split())\r\nc= []\r\nd=0\r\nfor i in range(0,a):\r\n e,f= map(int,input().split())\r\n d+=min(e,f)\r\n c.append(min(2*e,f)-min(e,f))\r\ng= sorted(c)\r\nh= b\r\ni= len(g)-1\r\nwhile h>0:\r\n h-=1\r\n d+=g[i]\r\n i-=1\r\nprint(d)", "n,f=[int(n) for n in input().split()]\r\ntotalproduct=0\r\numap=[]\r\nfor i in range(n):\r\n k,l=[int(k) for k in input().split()]\r\n totalproduct+=min(k,l)\r\n umap.append(min(2*k,l)-min(k,l))\r\numap.sort(reverse=True)\r\nfor i in umap:\r\n if f==0:\r\n break\r\n totalproduct+=i\r\n f-=1\r\nprint(totalproduct)\r\n", "n , k = map(int,input().split())\r\n\r\nl = []\r\nsm = 0\r\nfor i in range(n):\r\n p , c = map(int,input().split())\r\n sm += min(p , c)\r\n\r\n l.append(min(2 * p , c) - min(p , c))\r\n\r\nl = sorted(l)\r\nc = k\r\ni = len(l) - 1\r\nwhile c > 0 :\r\n c -=1\r\n sm += l[i]\r\n i -=1\r\n\r\nprint(sm)\r\n\r\n", "n, f = map(int, input().split())\r\nvalue_of_doubling = []\r\nres = 0\r\n\r\nfor _ in range(n):\r\n k, l = map(int, input().split())\r\n res += min(k, l)\r\n value_of_doubling.append(min(2*k, l) - min(k, l))\r\n\r\nvalue_of_doubling.sort(reverse=True)\r\n\r\nfor i in range(f):\r\n res += value_of_doubling[i]\r\n\r\nprint(res)\r\n", "n, f = map(int, input().split())\r\na=[]\r\nc =0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n c =c + min(x, y)\r\n\r\n a.append(min(2 * x, y) - min(x, y))\r\n\r\na.sort(reverse=True)\r\n\r\n\r\nfor i in range(f):\r\n if i < n:\r\n c += max(a[i], 0)\r\n \r\n else:\r\n break\r\n\r\nprint(c)", "#!/usr/bin/env python3\r\n# -*- coding: utf-8 -*-\r\nn,k=map(int,input().strip().split())\r\na=[]\r\nsum=0\r\nfor i in range(n):\r\n ki,li=map(int,input().strip().split())\r\n t=0\r\n if li>ki:\r\n if 2*ki>=li:\r\n t=li-ki\r\n else:\r\n t=ki\r\n sum+=ki\r\n else:\r\n sum+=li\r\n a.append(t)\r\na.sort(reverse=True)\r\nfor i in range(k):\r\n sum+=a[i]\r\nprint(sum)\r\n\r\n", "n,f = input().strip().split(\" \")\r\nn = int(n)\r\nf = int(f)\r\nar = []\r\nar1 = []\r\nar2= []\r\ncount = 0\r\nfor i in range(n):\r\n\ttemp = input().strip().split(\" \")\r\n\tar.append(int(temp[0]))\r\n\tar1.append(int(temp[1]))\r\n\tar2.append(min(2*ar[i],ar1[i]) - min(ar[i],ar1[i]))\r\n\tcount += min(ar1[i],ar[i])\r\n#print(count)\r\nar2.sort(reverse = True)\r\n#print(ar2)\r\nfor i in range(f):\r\n\tcount += ar2[i]\r\n\r\nprint(count)\r\n\r\n", "n, f = map(int, input().split())\r\nk = []\r\nl = []\r\ncount_max = 0\r\nfor _ in range(n):\r\n k_i, l_i = map(int, input().split())\r\n k.append(k_i)\r\n l.append(l_i)\r\nfor i in range(n):\r\n if k[i] >= l[i]:\r\n count_max += l[i]\r\n l[i] = 0\r\n else:\r\n count_max += k[i]\r\n l[i] -= k[i]\r\nans = []\r\nfor i in range(n):\r\n if k[i] <= l[i]:\r\n ans.append(k[i])\r\n else:\r\n ans.append(l[i])\r\nans.sort(reverse=True)\r\nfor i in range(f):\r\n count_max += ans[i]\r\n\r\nprint(count_max)", "n, f = map(int, input().split())\r\n\r\nsold = 0\r\nextra = []\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n\r\n sold += min(k, l)\r\n extra.append(min(k, l-min(k,l)))\r\n\r\nextra.sort(reverse=True)\r\nsold += sum(extra[:f])\r\n\r\nprint(sold)\r\n", "limit, sold = [], 0\r\nn, f = map(int, input().split())\r\n\r\nfor _ in range(n):\r\n k, l = map(int, input().split())\r\n sold += min(k, l)\r\n limit.append(min(k * 2, l) - min(k, l))\r\n\r\nlimit.sort()\r\nsold += sum(limit[n - f:])\r\nprint(sold)\r\n", "def inp():\r\n return map(int, input().split())\r\n\r\n\r\nn, f = inp()\r\narr, org, ans = [], [], 0\r\n\r\nfor i in range(n):\r\n k, l = inp()\r\n ins = 0\r\n if k < l:\r\n if l-k<=k:\r\n ins=l-k\r\n else:\r\n ins=k\r\n arr.append([i, ins])\r\n org.append([k, l])\r\n\r\narr.sort(key=lambda x: x[1], reverse=True)\r\n\r\nfor i in range(n):\r\n if i < f and arr[i][1]:\r\n ans += org[arr[i][0]][0]+arr[i][1]\r\n else:\r\n ans += min(org[arr[i][0]][0], org[arr[i][0]][1])\r\n\r\n# print(arr)\r\nprint(ans)\r\n", "n,f = map(int, input().split())\r\nc = 0\r\narr = []\r\nfor i in range(n):\r\n\ta, b = map(int, input().split())\r\n\tc+= min(a,b)\r\n\tarr.append(min(2*a,b)-min(a,b))\r\narr.sort(reverse=True)\r\nc+=sum(arr[:f])\r\nprint(c)", "a,b=map(int,input().split())\r\nx=[]\r\ny=[]\r\n\r\nfor i in range(a):\r\n z=list(map(int,input().split()))\r\n x.append(z[0])\r\n y.append(z[1])\r\nz=[]\r\nt=[]\r\nfor i in range(a):\r\n first=min(y[i],x[i])\r\n second=min(y[i],2*x[i])\r\n z.append(second-first)\r\n t.append(first)\r\n\r\nz.sort()\r\nprint(sum(t)+sum(z[a-b:]))\r\n", "n, f = [int(i) for i in input().split()]\r\na = [0] * n\r\na2 = [0] * n\r\nfor i in range(n):\r\n k, l = [int(i) for i in input().split()]\r\n a[i] = (k, l)\r\na.sort(key=lambda t: min(t[0], t[1] - t[0]), reverse=True)\r\nans = 0\r\nfor i in range(len(a)):\r\n t = a[i]\r\n ans += max(0, min(t[0] + t[0], t[1])) if i < f else max(0, min(t[0], t[1]))\r\nprint(ans)\r\n\r\n\r\n", "n, f = [int(i) for i in input().split()]\r\n\r\nsurplus = []\r\nsold = []\r\n\r\nfor i in range(n):\r\n p, c = map(int, input().split())\r\n sold.append(min(p, c))\r\n unsold = max(0, c - p)\r\n more = min(unsold, p)\r\n surplus.append(more)\r\n\r\nsurplus.sort()\r\nsurplus.reverse()\r\nprint(sum(surplus[:f]) + sum(sold))", "from cgi import print_directory\r\n\r\n\r\ndef inp():\r\n return(int(input()))\r\ndef inlt():\r\n return(list(map(int,input().split(\" \"))))\r\ndef inlt_space():\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\n\r\ndef solve():\r\n day,so_day = invr()\r\n good = []\r\n client = []\r\n for i in range(day):\r\n g,c = inlt_space()\r\n good.append(g)\r\n client.append(c)\r\n\r\n _sum = 0\r\n nor = []\r\n sold_out = []\r\n tmp = []\r\n\r\n for g,cl in zip(good,client) :\r\n nor.append(min(g,cl))\r\n sold_out.append(min(2*g,cl))\r\n tmp.append(min(2*g,cl) - min(g,cl) )\r\n\r\n tmp.sort(reverse= True)\r\n _sum = sum(tmp[:so_day]) + sum(nor)\r\n\r\n print(_sum)\r\n\r\nif __name__ == \"__main__\":\r\n solve()\r\n\r\n", "numOfDays, sellOffDays = map(int, input().split())\r\ntotalProductsSold = 0\r\nl = []\r\nfor i in range(numOfDays):\r\n numOfProduct, numOfClients = map(int, input().split())\r\n totalProductsSold += min(numOfProduct, numOfClients)\r\n l.append(min(2*numOfProduct, numOfClients)-min(numOfProduct,numOfClients))\r\nl.sort()\r\nprint(totalProductsSold+sum(l[numOfDays-sellOffDays: ]))", "n,f =map(int,input().split())\r\nz=0\r\na=[]\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n z+=min(k,l)\r\n a.append(min(2*k,l)-min(k,l))\r\na.sort()\r\nprint(z+sum(a[n-f:]))", "def getSoldProducts(p, c):\r\n return p if c > p else c\r\n\r\n\r\nn, f = map(int, input().split())\r\n\r\ndata = []\r\nmaxSold = 0\r\ndiff = []\r\n\r\nfor i in range(n):\r\n data.append(tuple(map(int, input().split())))\r\n\r\nfor i, p in enumerate(data):\r\n diff.append((getSoldProducts(2 * p[0], p[1]) - getSoldProducts(p[0], p[1]), i))\r\n\r\ndiff.sort(reverse=True)\r\n\r\nfor p in diff:\r\n if f > 0:\r\n maxSold += getSoldProducts(2 * data[p[1]][0], data[p[1]][1])\r\n f -= 1\r\n else:\r\n maxSold += getSoldProducts(data[p[1]][0], data[p[1]][1])\r\n\r\nprint(maxSold)", "# file = open(\"New Text Document.txt\", \"r\")\r\nn,f = list(map(int, input().split()))\r\nl=[]\r\nfor i in range(n):\r\n l.append(tuple(map(int, input().split())))\r\ngain = []\r\nsoldWithoutSaleOff=0\r\nfor i in range(n):\r\n soldWithoutSaleOff+=min(l[i][0],l[i][1])\r\n if l[i][0]>=l[i][1]:\r\n gain.append(0)\r\n l[i]+= (0,)\r\n else:\r\n gain.append(min(2*l[i][0],l[i][1])-l[i][0])\r\n l[i]+= (min(2*l[i][0],l[i][1])-l[i][0],)\r\nsorted_l = sorted(l, key=lambda x: x[2],reverse=True)\r\nfor i in range(f):\r\n soldWithoutSaleOff+=sorted_l[i][2]\r\nprint(soldWithoutSaleOff)", "n,f = map(int,input().split())\npairs = []\ncurrSum = 0\n\nfor _ in range(n):\n\n p,c = map(int,input().split())\n pairs.append([p,c])\n currSum += min(p,c)\n\nmaxArr = []\n\nfor p,c in pairs:\n\n if c > p:\n\n maxArr.append(min(c-p,p))\n\nmaxArr.sort()\n\nif len(maxArr) > f:\n\n currSum += sum(maxArr[ len(maxArr) - f : len(maxArr) ])\n\nelse:\n\n currSum += sum(maxArr)\n\nprint(currSum)\n", "I = lambda: map(int, input().split())\nn, f = I()\nkl = []\nfor i in range(n):\n s = list(I())\n kl.append((s[0], s[1], s[0] if s[0] * 2 <= s[1] else s[1]-s[0] if s[1] >= s[0] else 0))\n\nkl.sort(key=lambda x: x[2], reverse=True)\nprint(sum(x[2] for x in kl[:f]) + sum(min(x[0], x[1]) for x in kl))\n", "from collections import defaultdict, Counter\nimport itertools as it\nimport random as rand\nimport math\nimport string\n\nn, k = map(int, input().split())\n\nA = []\nfor i in range(n):\n np, nc = map(int, input().split())\n os = min(np, nc)\n ts = min(2*np, nc)\n v = abs(ts - os)\n A.append((v, ts, np, nc))\n\nA.sort(reverse=True)\n#print(A[:k], A[k:])\nres = sum([x[1] for x in A[:k]])\nres += sum([min(x[2], x[3]) for x in A[k:]])\nprint(res)", "#Codeforces B - Summer sell-off\nn,f=map(int,input().split())\nsp = 0\np = [None]*n\nfor i in range(n):\n\tk,l = map(int,input().split())\n\tpt = min(k,l)\n\tsp += pt\n\tp[i] = min(l-pt,max(2*k-pt,0))\np.sort(reverse=True)\nprint(sp+sum(p[:f]))\n\t\t \t \t \t \t\t \t \t \t \t\t\t \t \t", "# Enter your code here. Read input from STDIN. Print output to STDOUT\r\nn,f = list(map(int,input().split()))\r\nsolid = []\r\noutput = 0\r\nfor i in range(n):\r\n k,l = list(map(int,input().split()))\r\n solid.append(min(2*k,l)-min(k,l))\r\n output+=min(k,l)\r\n \r\nsolid.sort()\r\nfor j in range(f):\r\n output += solid.pop()\r\nprint(output)", "\r\nn, f = map(int, input().split())\r\n\r\nlst = []\r\nskip = set()\r\ndiff = []\r\ncount = 0\r\n\r\nresult = 0\r\n\r\nfor i in range(n):\r\n x, y = map(int, input().split())\r\n temp = x * 2\r\n maxProfit = temp if temp < y else y\r\n place = i\r\n current = x if x < y else y\r\n difference = maxProfit - current\r\n diff.append(difference)\r\n lst.append((place, x, y, current, maxProfit, difference))\r\n\r\ndiff.sort(reverse=True)\r\n\r\nlst.sort(key=lambda x: x[5], reverse=True)\r\n\r\nfor i in lst:\r\n current = i[3]\r\n maxProfit = i[4]\r\n difference = i[5]\r\n if count < f:\r\n result += maxProfit\r\n count += 1\r\n else:\r\n result += current\r\n\r\n\r\nprint(result)\r\n", "import sys\n\ndef main(mat, k):\n c = sum(min(a, b) for a, b in mat)\n p = [(e, min(2*d[0], d[1]) - min(d[0], d[1])) for e, d in enumerate(mat)]\n p.sort(key=lambda x: x[1], reverse=True)\n i = 0\n while i < k:\n c += p[i][1]\n i += 1\n print(c)\n\nif __name__ == \"__main__\":\n mat = []\n for e, line in enumerate(sys.stdin.readlines()):\n if e == 0:\n _, k = map(int, line.strip().split())\n continue\n mat.append(list(map(int, line.strip().split())))\n main(mat, k)", "import heapq\n\nn,f = map(int, input().split())\nq = []\ns = 0\nfor i in range(n):\n products, clients = map(int, input().split())\n s += min(products, clients)\n heapq.heappush(q, min(products*2, clients) - min(products, clients))\n\nlargest = heapq.nlargest(f, q)\nprint(s + sum(largest)) \n", "n,m=map(int,input().split())\r\nl=[list(map(int,input().split())) for i in range(n)]\r\nl=sorted(l,key=lambda x : (min(x[0]*2,x[1])-min(x[0],x[1])))\r\nk=0\r\ni=n-1\r\nfor i in range(n-1,-1,-1) :\r\n if m>0 :\r\n k+=min(l[i][0]*2,l[i][1])\r\n m-=1\r\n else :\r\n k+=min(l[i][0],l[i][1])\r\nprint(k)\r\n \r\n", "n, f = map(int, input().split())\r\ns, d = 0, [0] * n\r\nfor i in range(n):\r\n k, l = map(int, input().split())\r\n s += min(l, k)\r\n d[i] = min(l, 2 * k) - min(l, k)\r\nprint(s + sum(sorted(d)[n - f:]))", "n, k = map(int, input().split())\r\na, b = [], []\r\n\r\nfor _ in range(n):\r\n products, clients = map(int, input().split())\r\n a.append(min(products, clients))\r\n b.append(min(2*products, clients) - min(products, clients))\r\n\r\nresult = sum(a)\r\nb.sort()\r\nresult += sum(b[n-k:])\r\nprint(result)", "\r\nn,m=map(int,input().split())\r\nli=[]\r\nli1=[]\r\n#dic={}\r\nsum2=0\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n p=min(k,l)\r\n sum2+=p\r\n li.append(p)\r\n li1.append(min(2*k,l)-p)\r\nli1.sort(reverse=True)\r\nprint(sum2+sum(li1[:m]))\r\n \r\n\r\n", "n,f = map(int,input().split())\r\ndays = []\r\nfor i in range(n):\r\n\tprod , peo = map(int,input().split())\r\n\tsold = min(prod,peo)\r\n\tmax_sold = min(2*prod,peo)\r\n\tgain = max_sold-sold\r\n\tdays.append([gain,max_sold,sold])\r\ndays.sort()\r\ndays.reverse()\r\nans =0\r\nfor i in range(n):\r\n\tif f>0:\r\n\t\tf-=1\r\n\t\tans += days[i][1]\r\n\telse:\r\n\t\tans += days[i][2]\r\nprint(ans)", "def solve(n,f):\r\n mapping = {}\r\n sorter=[]\r\n ans = 0\r\n for i in range(n):\r\n days,customers = map(int,input().split())\r\n \r\n \r\n \r\n ans+=min(days,customers)\r\n sorter.append(min(2*days,customers)-min(days,customers))\r\n # print(ans)\r\n\r\n\r\n sorter.sort(reverse=True)\r\n # print(sorter)\r\n for i in range(f):\r\n ans+=sorter[i]\r\n\r\n\r\n\r\n print(ans)\r\n return\r\n\r\n\r\nn,f = map(int,input().split())\r\nsolve(n,f) \r\n \r\n\r\n\r\n\r\n ", "days_number, k = [int(x) for x in input().split()]\r\ncostumers, items, total_sum, difference = [], [], 0, []\r\nfor j in range(days_number):\r\n i, c = [int(y) for y in input().split()]\r\n total_sum += min(i, c)\r\n costumers.append(c)\r\n items.append(i)\r\n if c > i:\r\n difference.append(min(i*2, c)-min(i, c))\r\n else:\r\n difference.append(0)\r\n\r\ndifference = sorted(difference)[::-1]\r\nfor d in difference[:k]:\r\n total_sum += d\r\n\r\nprint(total_sum)", "#!/usr/bin/env python3\r\nimport sys, math, itertools, collections, bisect\r\ninput = lambda: sys.stdin.buffer.readline().rstrip().decode('utf-8')\r\ninf = float('inf') ;mod = 10**9+7\r\nmans = inf ;ans = 0 ;count = 0 ;pro = 1\r\n\r\nn,f=map(int,input().split())\r\narray=[]\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n ans += min(k,l)\r\n array.append(min(l,2*k)-min(l,k))\r\narray.sort(reverse=True)\r\nfor ai in array:\r\n if count < f:\r\n ans += ai\r\n count += 1\r\nprint(ans)", "j = input()\r\nj = list(map(int, j.split(\" \")))\r\nn = j[0]\r\nf = j[1]\r\n#print(n, k)\r\n\r\ndelta = []\r\nvendidos = 0\r\n\r\nfor i in range(n):\r\n\tj = input()\r\n\tj = list(map(int, j.split(\" \")))\r\n\tpr = j[0]\r\n\tcl = j[1]\r\n\tif pr > cl:\r\n\t\tvendidos += cl\r\n\t\tdelta.append(0)\r\n\telse:\r\n\t\tvendidos += pr\r\n\t\tif cl - pr < pr:\r\n\t\t\tdelta.append(cl - pr)\r\n\t\telse:\r\n\t\t\tdelta.append(pr)\r\n\r\ndelta.sort(reverse=True)\r\n\r\n#print(vendidos, sum(delta[:f]), delta)\r\nprint(vendidos + sum(delta[:f]))\r\n\r\n", "n,f = map(int,input().split())\ndays = []\ntotal = 0\nfor i in range(n):\n k,l = map(int,input().split())\n if k == 0:\n continue\n sales = min(k,l)\n total +=sales\n l -=sales\n\n days.append(min(k,l))\ndays.sort(reverse=1)\n# print(days)\nprint(total + sum(days[:f]))", "n, f = map(int, input().split())\r\nmass = []\r\nmass2 = []\r\nsumma = 0\r\nfor i in range(n):\r\n mass.append(list(map(int, input().split())))\r\n summa += min(mass[i][0],mass[i][1])\r\n mass2.append(-1 * min(mass[i][0],mass[i][1]) + min(2*mass[i][0], mass[i][1]))\r\nmass2.sort()\r\ni = n - 1\r\nwhile f != 0:\r\n summa += mass2[i]\r\n f -= 1\r\n i -= 1\r\nprint(summa)", "n,f = map(int,input().split())\n\ncnt = 0\na = []\n\nfor i in range(n):\n k,l = map(int, input().split())\n if k >= l:\n a.append(0)\n cnt += l\n else:\n if k * 2 >= l:\n a.append(l-k)\n else:\n a.append(k)\n \n cnt += k\n \n\na.sort(reverse=True)\nfor i in range(f):\n cnt += a[i]\n\nprint(cnt)", "n, f=map(int, input().split())\r\na=[]\r\nb=[]\r\nfor i in range (0, n):\r\n k, l=map(int, input().split())\r\n a.append(min(2*k, l)-min(k, l))\r\n b.append(min(k, l))\r\na.sort(reverse=True)\r\nans=0\r\nfor i in range (0, f):\r\n ans+=a[i]\r\nfor i in b:\r\n ans+=i\r\nprint(ans)\r\n", "n,f = [int(i) for i in input().split()]\r\n\r\nextra = [] # how much extra that day, we would have earned,\r\n# if we would have doubled the sales\r\nans = 0\r\n\r\nfor i in range(n):\r\n a,b = [int(i) for i in input().split()]\r\n ans += min(a, b)\r\n extra_earned = min(2*a, b) - min(a, b)\r\n extra.append(extra_earned)\r\n \r\n# sort this extra earned profit in descending order\r\nextra.sort(reverse=True)\r\nfor i in range(f):\r\n ans += extra[i]\r\n \r\nprint(ans)", "# link: https://codeforces.com/contest/810/problem/B\r\nif __name__ == \"__main__\":\r\n n,s = map(int, input().split())\r\n nn = n\r\n info = []\r\n result = 0\r\n for i in range(nn): \r\n k,l = map(int, input().split()) \r\n result = result + min(k,l)\r\n if k>=l:\r\n info.append(0)\r\n else:\r\n info.append( min(2*k, l) - min(k,l) )\r\n info.sort()\r\n info = info[::-1]\r\n i = 0\r\n while i<n and s:\r\n if info[i] > 0:\r\n result += info[i]\r\n s -= 1\r\n i += 1\r\n print(result) \r\n", "n,f = map(int,input().split())\r\nlst = []\r\nlst2 = []\r\nfor _ in range(n):\r\n x,y = map(int,input().split())\r\n lst.append(x)\r\n lst2.append(y)\r\ncurr = 0\r\nlst4 = []\r\nfor i in range(n):\r\n a = lst[i]\r\n b = lst2[i]\r\n if a > b:\r\n curr += b\r\n lst4.append(b)\r\n else:\r\n curr += a\r\n lst4.append(a)\r\nlst3 = []\r\nfor i in range(n):\r\n a = 2*lst[i]\r\n b = lst2[i]\r\n if a > b:\r\n lst3.append(b-lst4[i])\r\n else:\r\n lst3.append(a-lst4[i])\r\nlst3.sort(reverse = True)\r\nfor i in range(f):\r\n curr += lst3[i]\r\nprint(curr)", "n,f = map(int, input().split())\r\nresult = 0\r\nbc = []\r\nfor i in range(n):\r\n k, l =map(int, input().split())\r\n normal = min(k, l)\r\n result += normal\r\n special = min(2*k, l)\r\n bc.append(special-normal)\r\nbc.sort(reverse=True)\r\nresult += sum(bc[:f])\r\nprint(result)\r\n", "# your code goes here\r\nfrom sys import stdin, stdout\r\n\r\n\r\ndef sell(k, l):\r\n\treturn min(k, l)\r\n\t\r\nn, f = map(int, stdin.readline().split())\r\ndays = []\r\n\r\nfor _ in range(n):\r\n\tk, l = map(int, stdin.readline().split())\r\n\t\r\n\tdays.append((k, l))\r\n\t\r\ndays.sort(key=lambda x: sell(2*x[0], x[1]) - sell(x[0], x[1]), reverse=True)\r\n\r\ncount = 0\r\nfor k, l in days:\r\n\tif f:\r\n\t\tcount += sell(2*k, l)\r\n\t\tf -= 1\r\n\telse:\r\n\t\tcount += sell(k, l)\r\n\t\t\r\nprint(count)", "# import math\r\nfrom collections import Counter, deque, defaultdict\r\nfrom math import *\r\n# from bisect import bisect_right\r\nmod = 1000000007\r\n# from functools import reduce\r\n# from itertools import permutations\r\n# import queue\r\n\r\ndef fun(x):\r\n i=x[0]\r\n j=x[1]\r\n z=min(i,j)\r\n z1=min(2*i,j)\r\n return z1-z\r\n\r\n\r\ndef fun2(x):\r\n return min(x[0],x[1])\r\n\r\ndef fun3(x):\r\n return min(2*x[0],x[1])\r\n\r\n\r\ndef solve():\r\n n,f=map(int,input().split())\r\n l=[]\r\n for i in range(n):\r\n l.append(list(map(int,input().split())))\r\n l.sort(reverse=True, key=lambda x: fun(x))\r\n count=0\r\n cur=0\r\n for i in range(n):\r\n if cur<f:\r\n count+=fun3(l[i])\r\n cur+=1\r\n else:\r\n count+=fun2(l[i])\r\n print(count)\r\n\r\n# t=int(input())\r\nt = 1\r\nfor _ in range(t):\r\n # print(\"Case #{}: \".format(_ + 1), end=\"\")\r\n solve()", "n,f=map(int,input().split())\r\nans=0\r\ntmp=[]\r\nfor i in range(n):\r\n k,l=map(int,input().split())\r\n if k>=l:\r\n ans+=l\r\n else:\r\n ans+=k\r\n x2=l-k if (2*k)>=l else k\r\n tmp.append(x2)\r\ntmp.sort(reverse=True)\r\n#print(tmp,ans)\r\nans+=sum(tmp[:f])\r\nprint(ans)", "import heapq\r\nn, f = map(int, input().split())\r\n\r\nmax = 0\r\nextra_sold = []\r\nfor _ in range(n):\r\n product, clients = map(int, input().split())\r\n sold = min(product, clients)\r\n max += sold\r\n extra = min(product * 2, clients) - sold\r\n heapq.heappush(extra_sold, extra)\r\n\r\nprint(max + sum(heapq.nlargest(f, extra_sold)))\r\n", "n,f=[int(i) for i in input().split()]\r\ng=0\r\nkiar=[]\r\nfor i in range(n):\r\n k,l=[int(g)for g in input().split()]\r\n g+=min(k,l)\r\n kiar.append(min(2*k,l)-min(k,l))\r\nkiar.sort(reverse = True)\r\nfor i in range(f):\r\n g+=kiar[i]\r\nprint(g)", "num_days, sell_out = list(map(int, input().split()))\r\ninp = []\r\nproduct_sold = 0\r\nfor i in range(num_days):\r\n inp.append(list(map(int, input().split())))\r\n\r\ndef compare(x):\r\n return min(2 * x[0], x[1]) - min(x[0], x[1])\r\n \r\nfor product, client in sorted(inp, key=compare, reverse=True):\r\n if sell_out >= 1:\r\n product_sold += min(product * 2, client)\r\n sell_out -= 1\r\n else:\r\n product_sold += min(product, client)\r\n \r\nprint(product_sold)", "import math\r\n\r\nline = lambda: map(int, input().split())\r\n\r\ndef solve():\r\n n, f = line()\r\n ans = 0\r\n ar = []\r\n for i in range(n):\r\n k, l = line()\r\n ans += min(k, l)\r\n ar.append(min(k + k, l) - min(k, l))\r\n ar.sort(reverse = True)\r\n for i in range(f):\r\n ans += ar[i]\r\n print(ans)\r\n \r\ndef main():\r\n solve()\r\n exit(0)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n, f = [int(i) for i in input().split()]\r\na = [[int(i) for i in input().split()] for j in range(n)]\r\na.sort(key=lambda t: min(t[0], t[1] - t[0]), reverse=True)\r\nprint(sum([max(0, min(a[i][0] + a[i][0], a[i][1])) if i < f else max(0, min(a[i][0], a[i][1])) for i in range(len(a))]))\r\n\r\n\r\n", "n,f = map(int,input().split())\r\nm = []\r\nans = 0\r\nfor _ in range(n):\r\n k,l = map(int,input().split())\r\n ans+=min(k,l)\r\n m.append(min(2*k,l)-min(k,l))\r\n\r\nm.sort(reverse=True)\r\nans+= sum(m[:f])\r\nprint(ans)" ]

[ "# LUOGU_RID: 101709040\na=input().split()\r\na[1]=a[1][-1::-1]\r\nprint(int(a[0])+int(a[1]))", "'''\r\n Auther: ghoshashis545 Ashis Ghosh\r\n College: jalpaiguri Govt Enggineerin College\r\n Date:30/03/2020\r\n'''\r\nfrom math import gcd,sqrt,ceil\r\ndef ii():return int(input())\r\ndef mi():return map(int,input().split())\r\ndef li():return list(mi())\r\ndef si():return input()\r\n\r\n\r\ndef main():\r\n \r\n \r\n \r\n \r\n \r\n \r\n \r\n a,b=mi()\r\n s=list(str(b))\r\n s.reverse()\r\n s=\"\".join(s)\r\n print(a+int(s))\r\n \r\n \r\n \r\n \r\nif __name__ ==\"__main__\":\r\n main()", "'''n, m = input().split()\r\ns = \"\"\r\nn = int(n)\r\nfor i in range(len(m)-1,-1,-1):\r\n s+=m[i]\r\ns = int(s)\r\nprint(n+s)'''\r\nn , m = input().split()\r\nm = str.join('',reversed(m))\r\n#print(m)\r\nprint(int(n)+int(m))", "def main():\n a = input().split(' ')\n print(int(a[0]) + int(a[1][::-1]))\n\n\nmain()", "n1, n2 = map(int, input().split())\r\n\r\nn2 = int(str(n2)[::-1])\r\n\r\nprint(n1+n2)", "x = input().split(\" \")\r\n\r\ndef solve(a, b):\r\n\tb = b[::-1]\r\n\tprint(int(a) + int(b))\r\n\t\r\n\t\r\nsolve(x[0], x[1])", "a,b = input ().split ()\r\nprint (int(a) + int (b[::-1]))", "a,b=(int(i) for i in input().split())\r\nprint(a+int(str(b)[::-1]))", "a,b=map(int,input().split(' '))\r\nnewb = 0\r\nwhile b > 0:\r\n newb *= 10\r\n newb+= b % 10\r\n b //= 10\r\nprint(a+newb)", "a, b = input(\"\").split()\r\nc = b[::-1]\r\nd = int(c)\r\ne = int(a)\r\nprint(d+e)\r\n", "#!/usr/bin/python3\n\ndef readln(): return tuple(map(int, input().split()))\n\na, b = readln()\nprint(a + int(''.join(reversed(list(str(b))))))\n", "a,b=input().split()\r\nprint(int(a)+int(''.join(list(reversed(list(b))))))", "a, b = (int(t) for t in input().split(' '))\r\nb = int(str(b)[::-1])\r\nprint(a+b)", "a,b = map(int, input().split())\r\nprint(a+int(str(b)[::-1]))", "a,b=input().split()\r\nz=int(b[::-1])\r\nx=int(a)\r\nprint(z+x)", "if __name__ == \"__main__\":\r\n a,b = input().split()\r\n print(int(a)+int(b[::-1]))\r\n", "a, b = map(int, input().split())\r\nresult = a + int(str(b)[::-1])\r\nprint(result)", "a,b=map(int,input().split())\r\nc=str(b)\r\nfor i in range(len(c)-1,-1,-1): a+=(10**i)*int(c[i])\r\nprint(a)", "def numbers(a, b):\r\n res = 0\r\n while b > 0:\r\n res = 10 * res + (b % 10)\r\n b //= 10\r\n return a + res\r\n\r\n\r\nA, B = [int(i) for i in input().split()]\r\nprint(numbers(A, B))", "a, b = [i for i in input().split()]\r\nb = b[::-1]\r\na = int(a)\r\nb = int(b)\r\nprint(a + b)\r\n", "a, b = input().split()\na, b = int(a), int(b)\n\nprint(a + int(str(b)[::-1]))\n \t \t \t \t\t \t\t \t\t\t\t\t \t \t", "import math\r\nimport 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 reverse_number(n):\r\n r = 0\r\n while n > 0:\r\n r *= 10\r\n r += n % 10\r\n n //= 10\r\n return r\r\nm, s = inlt()\r\nprint(m + reverse_number(s))", "import math\r\na,b=map(int,input().split())\r\nc=str(b)\r\nd=\"\".join(reversed(c))\r\nprint(a+int(d))\r\n", "a = input().split()\r\nprint(int(a[0]) + int(a[1][::-1]))", "a,b = list(map(int,input().split()))\r\nb = str(b)[::-1]\r\nprint(a+int(b))", "x, y = input().split()\r\nc=int(x)\r\nb=(y[::-1])\r\nd=int(b)\r\n\r\nprint(c+d)", "n, m = map(int, input().split(' '))\r\nprint(n+int(str(m)[::-1]))\r\n", "a,b=map(int,input().split())\r\nsb=str(b)\r\nb=int(sb[::-1])\r\nprint(a+b)", "__author__ = 'MARI'\r\n\r\ndef reverse(a):\r\n b = 0\r\n while (a > 0):\r\n b*=10\r\n b+=a%10\r\n a//=10\r\n return b\r\n\r\n\r\ndef main():\r\n a, b = [int(x) for x in input().split()]\r\n print(a + reverse(b))\r\n\r\nif __name__ == '__main__':\r\n import sys\r\n\r\n argv = sys.argv\r\n main()\r\n", "n,m = input().split()\r\nprint(int(n)+int(m[::-1]))", "n,m=map(int,input().split())\r\nt1=str(m);\r\nt1=t1[::-1]\r\nm=int(t1)\r\nprint(n+m)\r\n", "inp=list(map(int,input().split()))\r\na=inp[0]\r\nb=inp[1]\r\nb=str(b)\r\nn=\"\"\r\nfor i in range(len(b)-1,-1,-1):\r\n\tn=n+b[i]\r\nn=int(n)\r\nprint(a+n)", "'''\r\n AUTHOR : Vignat Tank\r\n DATE : 10-04-2023\r\n'''\r\n\r\n\r\ndef Vignat0905():\r\n a, b = map(int, input().split())\r\n print(int(a)+int(str(b)[::-1]))\r\n\r\n\r\nt = 1\r\n# t = int(input())\r\nwhile (t):\r\n Vignat0905()\r\n t -= 1\r\n", "a, b = input().split()\r\nbRev = b[::-1]\r\nprint(int(a) + int(bRev))", "a,b=map(int, input().split())\r\nrev=0\r\n\r\nwhile b>0:\r\n rev = 10*rev + b%10\r\n b=b//10\r\n\r\nprint(a+rev)", "m = list(map(str, input().split()))\r\nf = m[0]\r\ns = m[1]\r\nprint(int(f)+int(s[::-1]))", "n, k = input().split()\r\nprint(int(n) + int(''.join(reversed(k))))", "# /**\r\n# * author: brownfox2k6\r\n# * created: 23/05/2023 20:39:18 Hanoi, Vietnam\r\n# **/\r\n\r\na, b = input().split()\r\na = int(a)\r\nb = int(b[::-1])\r\nprint(a+b)", "a = input()\r\na = a.split()\r\nd = []\r\nfor i in a:\r\n d.append(str(i))\r\nb = d[0]\r\nc = d[1][::-1]\r\nb = int(b)\r\nc = int(c)\r\ne = str(b+c)\r\nprint(e)", "s=list(input().split())\r\na=s[0]\r\nb=s[1]\r\nprint(int(a)+int(b[::-1]))", "a=input()\r\nb=a.split()\r\nc=\"\"\r\nfor i in range(1,len(b[1])+1):\r\n c+=b[1][-i]\r\nprint(int(b[0])+int(c))\r\n", "n, k = list(map(str, input().split()))\r\nn = int(n)\r\nprint(int(k[::-1])+ n)\r\n", "\r\ns = input().split()\r\ns[1]=s[1][::-1]\r\nprint(int(s[0])+int(s[1]))", "a, b = map(str, input().split())\r\nprint(int(a) + int(b[::-1]))", "a,b = map(str, input().split())\r\nn = int(a)\r\nk = int(b[::-1])\r\nprint(n + k)", "a1, a2=list(map(int, input().split()))\r\nreverse=int(str(a2)[::-1])\r\nprint(a1+reverse)", "# from collections import defaultdict\n# from sys import stdin\n# import itertools\n# import bisect\n# from math import sqrt,ceil,floor,gcd\n# import re\n\ndef func(put,mapping,unpack):\n a,b = unpack(int)\n b = int(str(b)[::-1])\n print(a+b)\n \n \ndef init(TestCases=True):\n put = lambda s: s(input().strip())\n mapping = lambda s: list(map(s,input().split()))\n unpack = lambda s: map(s,input().split())\n for _ in range(int(input()) if TestCases else 1):\n func(put,mapping,unpack)\n\nif __name__ == '__main__':\n init(False)", "a,b=map(int,input().split())\r\nprint(a+int(str(b)[::-1]))\r\n", "n,m = map(int,input().split())\r\nprint(int(str(m)[::-1])+n)", "a,b=map(int,input().split())\r\nb=str(b)\r\ni=''\r\nfor num in b:\r\n i=num+i\r\ni=int(i)\r\nprint(i+a)", "import math\r\nimport modulefinder\r\nimport string\r\n\r\ndef main_function():\r\n a, b = [i for i in input().split(\" \")]\r\n b = int(\"\".join(reversed(list(b))))\r\n print(int(a) + b)\r\n \r\n\r\n\r\n\r\n\r\nif __name__ == '__main__':\r\n main_function()", "[N1,N2] = map(int, input().split())\r\nN2 = int(str(N2)[::-1])\r\nprint(N1+N2)", "A, B = map(int, input().split())\r\nB = str(B)\r\nC = ''\r\nfor i in range(len(B) - 1, -1, -1):\r\n C += B[i]\r\nC = int(C)\r\nprint(A + C)", "a,b=map(str,input().split())\r\nprint(int(b[::-1])+int(a))", "n,m = list(map(int,input().split()))\nprint(n+int(str(m)[::-1]))", "n,m=map(int,input().split())\r\nx=str(m)\r\ny=int(x[::-1])\r\nprint(n+y)\r\n", "s = input().split()\r\n\r\nprint(int(s[0]) + int(s[1][::-1]))", "a1, a2 = map(int, input().split())\r\nprint(a1 + int(''.join(list(str(a2))[::-1])))", "a,b=map(int, input().split())\r\nprint ( a + int(str(b)[::-1]))", "import math\nimport re\nfrom fractions import Fraction\nfrom collections import Counter\n\nclass Task:\n a, b = 0, 0\n answer = 0\n \n def __init__(self):\n self.a, self.b = [x for x in input().split()]\n\n def solve(self):\n a, b = self.a, self.b\n self.answer = int(a) + int(b[::-1])\n\n def printAnswer(self):\n print(self.answer)\n\ntask = Task()\ntask.solve()\ntask.printAnswer()\n", "#April Fool's Day contest 2020 #codeforces\r\na,b = input().split()\r\nprint(int(a) + int(b[::-1]))", "a1,a2=map(int,input().split())\r\na2=str(a2)\r\na2=a2[::-1]\r\na2=int(a2)\r\nprint(a1+a2)", "n1 , n2 = map(int,input().split())\r\nprint ( n1 + int(str(n2)[::-1]) )\r\n", "a, b = map(int, input().split())\r\nb = str(b)\r\nb = b[::-1]\r\nb = int(b)\r\nprint(b + a)", "a,b = input().split()\r\nb = b[::-1]\r\nprint(int(a)+int(b))", "\nls1,ls2=map(str,input().split())\nls11=list(ls1)\nls22=list(ls2)\nls22.reverse()\nn1=len(ls22)\nn2=len(ls11)\na=0\nb=0\nfor i in range(n1):\n a=(int(ls22[i])-0)+a*10\nfor i in range(n2):\n b=(int(ls11[i])-0)+b*10\nprint(a+b)\n\n\n \t\t \t \t \t \t \t \t\t\t \t \t\t \t\t", "n, m = input().split()\r\nr = ''\r\n\r\nfor i in m:\r\n r = i + r\r\n\r\nprint(int(n)+int(r))\r\n", "a,b = [int(x) for x in input().split()]\r\nc = 0\r\nwhile b>0:\r\n c = c*10 + b%10\r\n b //= 10\r\nprint(a+c)", "a,b = map(int,input().split())\r\nb = list(str(b))\r\nb.reverse()\r\nb = int(''.join(b))\r\nprint(a+b)", "n = input()\r\nm = n.split()[1]\r\nn = n.split()[0]\r\ni, j = len(n), len(m)\r\nk = max(i, j)\r\nt = min(i, j)\r\ns = 0\r\nfor i in range(k):\r\n if i < t:\r\n s += (int(n[-i - 1]) + int(m[i])) * 10 ** i\r\n elif len(n) > len(m):\r\n s += int(n[-i - 1]) * 10 ** i\r\n else:\r\n s += int(m[i]) * 10 ** i\r\nprint(s)", "def read():\r\n x, y = map(int, input().split())\r\n return x, y\r\n\r\n\r\ndef solve(x, y):\r\n y1 = 0\r\n while y != 0:\r\n y1 = y1 * 10 + y % 10\r\n y //= 10\r\n return x + y1\r\n\r\n\r\nprint(solve(*read()))", "import sys\r\n\r\n\r\ninput = lambda: sys.stdin.readline().rstrip()\r\n\r\na, b = map(int, input().split())\r\nprint(a + int(str(b)[::-1]))", "a, b = map(int,input().split())\na=str(a);b=str(b);b=b[::-1]\nb.strip(\"0\")\nprint(int(a)+int(b))\n", "x,y = map(int, input().split())\r\ndig0 = 0\r\ny2 = 0\r\nx2 = 0\r\norig_y = y\r\nif 0 <= x <= 10**9 and 0 <= y <= 10**9:\r\n \r\n while y > 0:\r\n dig = y % 10\r\n y = y // 10\r\n dig0 += dig\r\n if dig0 > 0:\r\n y2 = y2 * 10 + dig\r\n else:\r\n pass\r\n \r\n print(x + y2)\r\n", "a, s = map(int, input().split())\r\ns = list(str(s))\r\ns.reverse()\r\nfor i in range(len(s)):\r\n a += 10**(i)*int(s[-1-i])\r\nprint(a)", "n=input().split()\r\nc1=int(n[0])\r\nn1=\"\"\r\nfor i in range(len(n[1])-1,-1,-1):\r\n n1+=n[1][i]\r\nc2=int(n1)\r\nprint(c1+c2)", "a,b=map(int,input().split())\r\nprint('%d' % (a+int(str(b)[::-1])))", "a, b = input().split()\r\nb = list(b)\r\nb.reverse()\r\nb = int(\"\".join(b))\r\nprint(int(a) + b)", "from math import *\r\nimport sys\r\ninput = lambda: sys.stdin.readline().strip()\r\nU = lambda: map(int, input().split())\r\n#from itertools import *\r\n#from random import *\r\n\r\n\r\na, b = input().split()\r\nprint(int(a) + int(b[::-1]))", "a, b = map( int, input().split() )\r\nprint( a + int( str( b )[ : : -1 ] ) )", "from math import floor\r\n\r\nx, y = input().split()\r\nx = int(x)\r\ny = int(y)\r\n\r\nrev = 0\r\nwhile y > 0:\r\n a = int(y % 10)\r\n rev = rev * 10 + a\r\n y = floor(y / 10)\r\nb = x + rev\r\nprint(b)\r\n", "c = input().split()\r\na = c[0]\r\nb = c[1]\r\nb2 = \"\"\r\nfor i in range(1,len(b)+1):\r\n b2 += b[-i]\r\nprint(int(a)+int(b2))", "a,b=map(int,input().split())\r\nb=str(b)\r\nc=0\r\nm=len(b)-1\r\nfor i in range(len(b),0,-1):\r\n c=c+(int(b[i-1])*(10**m))\r\n m=m-1\r\nprint(a+c)\r\n \r\n \r\n \r\n \r\n", "a,b = input().split(\" \")\r\nprint(int(a) + int(\"\".join(reversed(list(b)))))", "n,m=input().split()\r\nn=int(n)\r\nm=int(m)\r\n\r\nres=0;\r\nwhile m>0:\r\n res=res*10+m%10\r\n m=int(m/10)\r\nprint(res+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\na,b = list(map(str,input().split()))\r\nprint(str(int(a)+int(b[::-1]))+\"\\n\")\r\n", "ls = list(map(str, input().split()))\r\nls[1] = ls[1][::-1]\r\nprint(int(ls[0])+int(ls[1]))", "s=input()\r\na, b=s.split(' ')[0], s.split(' ')[1]\r\nprint(int(a)+int(b[::-1]))\r\n", "def mysterious_numbers(x, y):\r\n result = 0\r\n z = int(y)\r\n while z > 0:\r\n result = result * 10 + (z % 10)\r\n z = z // 10\r\n\r\n return int(x) + result\r\n\r\n\r\nif __name__ == '__main__':\r\n x, y = input().split()\r\n print (mysterious_numbers(x, y))", "import sys\r\nimport os\r\nimport io\r\nimport math\r\nimport collections\r\n\r\ninput = sys.stdin.buffer.readline\r\nii = lambda: int(input())\r\nfi = lambda: float(input())\r\nsi = lambda: input().decode().rstrip()\r\nmi = lambda: map(int,input().split())\r\nmf = lambda: map(float,input().split())\r\nmsi= lambda: map(str,input().strip().decode().split(\" \"))\r\nli = lambda: list(mi())\r\nlf = lambda: list(mf())\r\n \r\ndef YES(): sys.stdout.write(\"YES\\n\")\r\ndef Yes(): sys.stdout.write(\"Yes\\n\")\r\ndef yes(): sys.stdout.write(\"yes\\n\")\r\ndef NO(): sys.stdout.write(\"NO\\n\")\r\ndef No(): sys.stdout.write(\"No\\n\")\r\ndef no(): sys.stdout.write(\"no\\n\")\r\n \r\nclass Solution:\r\n def __init__(self):\r\n return\r\n def solve(self):\r\n a,b=mi()\r\n b=int(str(b)[::-1])\r\n sys.stdout.write(f\"{a+b}\\n\")\r\n \r\nif __name__ == \"__main__\":\r\n Solution().solve()\r\n ", "x, y = map(int, input().split())\r\nprint(x + int(str(y)[::-1]))\r\n", "# opening files\r\nimport os\r\nif os.path.exists('input.txt'):\r\n\timport sys\r\n\tsys.stdin = open('input.txt', 'r')\r\n\tsys.stdout = open('output.txt', 'w')\r\n# opening files\r\n\r\nimport math, string, functools\r\n\r\nMNOGO = 0\r\n\r\nrl = lambda : [int(i) for i in input().split()]\r\n\r\ndef one_case(tc):\r\n\ta = rl()\r\n\tprint(a[0] + int(str(a[1])[::-1]))\r\n\r\ntt = 1\r\nif MNOGO:\r\n\ttt = int(input())\r\nfor i in range(1, tt + 1):\r\n\tone_case(i)", "a,b=list(map(int,input().split()))\r\nsb=str(b)\r\nx=sb[::-1]\r\nprint(a+int(x))\r\n", "from sys import stdin, gettrace\n\nif not gettrace():\n def input():\n return next(stdin)[:-1]\n\n\n# def input():\n# return stdin.buffer.readline()\n\ndef main():\n n,m = input().split()\n m = ''.join(list(m)[::-1])\n print(int(n) + int(m))\n\n\n\nif __name__ == \"__main__\":\n main()", "n,m = map(int,input().split());print(n+int(str(m)[::-1]))", "a, b = [int(x) for x in input().split()]\r\nprint(a + int(str(b)[::-1]))", "num = input().split()\r\nprint(int(num[0]) + int(num[1][::-1]))\r\n", "a1,a2 = map(int, input().split())\r\nx = 0\r\nwhile a2!= 0 :\r\n rem = a2%10\r\n x = rem + x*10\r\n a2 = a2//10\r\ns = x + a1\r\nprint(\"\"+str(s))\r\n", "a,b=map(str,input().split())\r\nnum=\"\".join(reversed(b))\r\nans=int(a)+int(num)\r\nprint(ans)\r\n", "a,b=map(int,input().split())\r\nc=str(b)\r\nb=int(c[::-1])\r\nprint(a+b)\r\n", "from collections import defaultdict, deque\r\nimport sys\r\ninput = lambda : sys.stdin.readline().strip()\r\n##############################################################################\r\na,b = input().split()\r\na = int(a) ; b = int(b[::-1])\r\nprint(a+b)\r\n", "s=[int(n) for n in input().split()]\r\ndef f(x):\r\n\ts=[int(n) for n in str(x)]\r\n\tm=0\r\n\tfor n in range(len(s)):\r\n\t\tm+=s[n]*10**n\r\n\treturn m\r\n\r\nprint(s[0]+f(s[1]))", "i = input().split()\r\na = int(i[0])\r\nb = int(i[1][::-1])\r\nprint(a + b)", "a1,a2 = input().split()\r\nprint(int(a1) + int(a2[::-1]))", "n1, n2 = map(int,input().split())\r\nrev = 0\r\nwhile n2 > 0:\r\n rem = n2 % 10\r\n rev = (rev * 10) + rem\r\n n2 = n2 // 10\r\nprint(f'{n1 + rev}')\r\n\r\n", "a,b=input().split();b=int(b[::-1]);print(int(a)+b)", "a, b = map(int, input().split())\r\nbx = 0\r\nwhile b > 0:\r\n bx = bx * 10 + b % 10\r\n b //= 10\r\nprint(a + bx)", "s = input().split()\r\na, b = s[0], s[1]\r\nprint(int(a) + int(b[::-1]))", "a1,a2=map(int,input().split())\r\nprint(a1+int(str(a2)[::-1]))", "a1,a2=map(str,input().split())\r\na1=int(a1)\r\na2=int(a2[::-1])\r\nprint(a1+a2)", "a,b=[int(x) for x in input().split()]\r\nch2=str(b)\r\nres=a+int(\"\".join(reversed(list(ch2))))\r\nprint(res)", "a, b = input().split()\r\na = int(a)\r\nb = int(str(b)[::-1])\r\nprint(a + b)", "n, k = list(map(str, input().split())) \r\nprint(int(k[::-1])+int(n))\r\n\r\n\r\n\r\n\r\n\r\n", "a, b = input().split()\nx = int(a) + int(b[::-1])\nprint(x)\n", "x = input().split()\r\nprint(int(x[0])+int(x[1][::-1]))", "n, m = map(int, input().split())\r\nprint(n + int(str(m)[::-1]))\r\n", "a,b=input().split();b,c=list(reversed(b)),''\nfor i in b:\n c+=i\nprint(int(a)+int(c))", "a, b = input().split()\r\nb = int(b[::-1])\r\na = int(a)\r\nprint(a + b)", "a,b = map(int, input().split())\r\nb = str(b)\r\nc = \"\"\r\nfor i in b :\r\n\tc = i + c\r\nprint (a + int(c))\r\n", "a,b = input().split()\r\nprint(int(b[::-1])+int(a))", "s = input().split()\r\na = int(s[0])\r\nb = int(s[1][::-1])\r\nprint(a + b)", "x, y = map(str, input().split())\n\ndef mysterSum(a = int(x), b = int(y[::-1])) :\n mysum = a + b\n return mysum\n\nout = mysterSum(a = int(x), b = int(y[::-1]))\nprint(out)\n", "a, b = map(str, input().split())\r\n\r\nb = int(b[::-1])\r\n\r\nc = int(a) + int(b)\r\n\r\nprint(str(c))", "a , b = [int(x) for x in input().split()]\r\nnew = str(b)\r\nrev = \"\"\r\nfor i in range(len(new)):\r\n rev+=new[len(new)-i-1]\r\nprint(int(rev)+a)", "from sys import stdout\r\nfrom sys import stdin\r\ndef get():\r\n return stdin.readline().strip()\r\ndef getf(sp = \" \"):\r\n return [int(i) for i in get().split(sp)]\r\ndef put(a, end = \"\\n\"):\r\n stdout.write(str(a) + end)\r\ndef putf(a, sep = \" \", end = \"\\n\"):\r\n stdout.write(sep.join([str(i) for i in a]) + end)\r\n \r\n#from collections import defaultdict as dd, deque\r\n#from random import randint, shuffle, sample\r\n#from functools import cmp_to_key, reduce\r\n#from math import factorial as fac, acos, asin, atan2, gcd, log, e\r\n#from bisect import bisect_right as br, bisect_left as bl, insort\r\n\r\ndef main():\r\n a, b = getf()\r\n put(a + int(str(b)[ :: -1]))\r\nmain()\r\n", "\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n | /\\ | | \\ | | / | | | | |\\ /|\r\n | / \\ | | \\ | | / | | | | | \\ / |\r\n |___ /____\\ | | \\ | |/ |___| | | | \\/ |\r\n | / \\ | | / | |\\ |\\ | | | |\r\n | / \\ | | / | | \\ | \\ | | | |\r\n ___|/ \\___|___ |___/ ___|___ | \\ | \\ |___| | |\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\r\na1,a2 = map(str,input().split())\r\na = int(a1) + int(a2[::-1])\r\nprint(a)\r\n\r\n# ♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥♥\r\n\"\"\"====================================================================================\r\n ====================================================================================\r\n \r\n ___ _______ ___ _______ ___ ___\r\n | /\\ | | \\ | | / | | | | |\\ /|\r\n | / \\ | | \\ | | / | | | | | \\ / |\r\n |___ /____\\ | | \\ | |/ |___| | | | \\/ |\r\n | / \\ | | / | |\\ |\\ | | | |\r\n | / \\ | | / | | \\ | \\ | | | |\r\n ___|/ \\___|___ |___/ ___|___ | \\ | \\ |___| | |\r\n \r\n \r\n ====================================================================================\r\n ==================================================================================== \r\n\"\"\"\r\n", "a,b=map(int,input().split())\r\ntemp1=a\r\nb1=0\r\nwhile(b>0):\r\n d=b%10\r\n b1=b1*10+d\r\n b=b//10 \r\nprint(temp1+b1)", "# http://codeforces.com/problemset/problem/171/A\na,b=input().split()\nn=max(len(a),len(b))\na=('0'*n+a)[-n:]\nb=(b+'0'*n)[:n]\nans=[]\ncarry=0\nfor j,i in zip(b,reversed(a)):\n x=int(i)+int(j)+carry\n carry=x//10\n ans.append(str(x%10))\nans.append(str(carry))\nprint(int(''.join(reversed(ans))))\n", "a1, a2 = input().split()\r\nprint(int(a1)+int(str(a2)[::-1]))", "a = input()\r\nprint(int(a.split()[0]) + int(a.split()[1][::-1]))", "x,y = input().split()\r\nprint(int(x)+int(y[::-1]))", "a,b=map(int,input().split())\r\nb=(str(b)[::-1])\r\nc=a+int(b)\r\nprint(c)", "x,y=input().split()\r\n\r\nx=int(x)\r\ny=int(y[::-1])\r\nprint(x+y)", "a = input().split()\r\ns = []\r\nfor i in a[1]:\r\n s.insert(0,i)\r\nprint(int(a[0]) + int(\"\".join(s)))" ]

[ "n=int(input())\r\nL=[]\r\nfor i in range(n):\r\n L.append(list(map(int,input().split())))\r\n\r\nfor i in range(1,100):\r\n t=str(i)\r\n b=False\r\n if len(t)==1:\r\n for j in range(len(L)):\r\n if i in L[j]:\r\n b=True\r\n break\r\n if b==False:\r\n print(i-1)\r\n break\r\n else:\r\n u=i%10\r\n d=i//10\r\n pos=[]\r\n for j in range(len(L)):\r\n if u in L[j]:\r\n pos.append(j)\r\n if len(pos)==0:\r\n print(i-1)\r\n break\r\n b=False\r\n for o in pos:\r\n for k in range(len(L)):\r\n if k!=o:\r\n if d in L[k]:\r\n b=True\r\n break\r\n if b: \r\n break\r\n if not b:\r\n print(i-1)\r\n break\r\n \r\n", "##a = list(map(int, input().split()))\r\n##print(' '.join(map(str, res)))\r\n\r\ndef list_input():\r\n return list(map(int, input().split()))\r\n\r\nn = int(input())\r\nc = list()\r\nfor i in range(n):\r\n c.append(list_input())\r\n\r\ns = set()\r\nfor i in range(n):\r\n for x in c[i]:\r\n s.add(x)\r\nif n >= 2:\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n for x in c[i]:\r\n for y in c[j]:\r\n if x != 0:\r\n s.add(x*10+y)\r\nif n >= 3:\r\n for i in range(n):\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n for k in range(n):\r\n if i == k or j == k:\r\n continue\r\n for x in c[i]:\r\n for y in c[j]:\r\n for z in c[k]:\r\n if x != 0:\r\n s.add(x*100+y*10+z)\r\nif 0 in s:\r\n s.remove(0)\r\nres = 0\r\nfor x in s:\r\n if x == res+1:\r\n res += 1\r\n else:\r\n print(res)\r\n exit(0)\r\nprint(res)", "n = int(input())\r\nc = [list(map(int, input().split())) for i in range(n)]\r\ns = set()\r\n\r\nfrom itertools import *\r\nfor i in permutations(c):\r\n\tfor j in product(range(6), repeat=n):\r\n\t\tv = []\r\n\t\tfor k in range(n):\r\n\t\t\tv.append(i[k][j[k]] * 10 ** k)\r\n\t\tfor k in accumulate(v):\r\n\t\t\ts.add(k)\r\n\t\t\r\nt = set(range(1, 10**n))\r\nans = min(t - s) - 1\r\nprint(ans)", "n = int(input())\r\na = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nif n == 1:\r\n avail = set(a[0])\r\nelif n == 2:\r\n avail = set(a[0] + a[1])\r\n avail = avail.union({i * 10 + j for i in a[0] for j in a[1]})\r\n avail = avail.union({i * 10 + j for i in a[1] for j in a[0]})\r\nelse:\r\n avail = set(a[0] + a[1] + a[2])\r\n avail = avail.union({i * 10 + j for i in a[0] for j in a[1]})\r\n avail = avail.union({i * 10 + j for i in a[1] for j in a[0]})\r\n avail = avail.union({i * 10 + j for i in a[0] for j in a[2]})\r\n avail = avail.union({i * 10 + j for i in a[2] for j in a[0]})\r\n avail = avail.union({i * 10 + j for i in a[2] for j in a[1]})\r\n avail = avail.union({i * 10 + j for i in a[1] for j in a[2]})\r\n for c in [[0, 1, 2], [0, 2, 1], [1, 0, 2], [1, 2, 0], [2, 0, 1], [2, 1, 0]]:\r\n avail = avail.union({i * 100 + j * 10 + k for i in a[c[0]] for j in a[c[1]] for k in a[c[2]]})\r\n\r\nfor i in range(1, 1000):\r\n if i not in avail:\r\n print(i - 1)\r\n exit()\r\nprint(999)\r\n", "from itertools import permutations\r\nn = int(input())\r\nlst = list()\r\nfor i in range(n):\r\n\tlst.append( list(input().split()))\r\nper = list(permutations(lst))\r\nk = 0\r\nfor x in range(1, 1000):\r\n\tl = str(x)\r\n\tfor i in per:\r\n\t\tfor d,c in zip(l, i):\r\n\t\t\tif d not in c:\r\n\t\t\t\tbreak\r\n\t\telse:\r\n\t\t\tbreak\r\n\telse:\r\n\t\tbreak\r\nprint(x-1)\r\n\r\n\r\n\r\n", "n = int(input())\na = [list(map(int, input().split())) for _ in range(n)]\n\nfor ai in a:\n ai.insert(0, '')\ndic = {}\n\nfor k in range(1, 7**n):\n tmp = k\n i = 0\n arr = []\n while 0 < tmp:\n arr.append(str(a[i][tmp % 7]))\n tmp //= 7\n i += 1\n arr.sort()\n dic[''.join(arr)] = True\n\nans = 0\nwhile ''.join(sorted(list(str(ans + 1)))) in dic:\n ans += 1\nprint(ans)\n", "n = int(input())\na = sorted([list(map(int, input().split())) for i in range(n)])\n\nimport itertools\nfor x in range(1,10**n):\n good = False\n s = str(x)\n for p in itertools.permutations(a, len(s)):\n good |= all([int(s[i]) in v for i, v in enumerate(p)])\n if not good:\n print(x-1)\n exit(0)\n \nprint((10**n)-1)\n\t \t\t\t\t \t \t\t\t\t \t \t \t \t\t\t\t\t", "from itertools import permutations\n\ndef find(perms, num):\n num_str = [char for char in str(num)]\n\n good = False\n\n for cubes in perms:\n if find2 (cubes, num_str):\n good = True\n\n return good\n\ndef find2(cube_list, num_str):\n if len(num_str) > len(cube_list):\n return False\n for i in range(len(num_str)):\n if num_str[i] not in cube_list[i]:\n return False\n return True\n\n\nn = int(input())\nlist1 = [input().split(\" \") for x in range(n)]\nperm = list(permutations(list1))\n\ni = 1\n\nwhile find(perm, i):\n i += 1\n\nprint(i-1)\n", "order=[\"012\",\"021\",\"102\",\"120\",\"201\",\"210\"]\r\ncube=[\"\",\"\",\"\"]\r\nfor _ in range(int(input())):\r\n cube[_]=input()\r\nfor num in range(1,999):\r\n num=str(num)\r\n flag=0\r\n for o in range(6):\r\n i=0\r\n for ele in num:\r\n if ele not in cube[int(order[o][i])]:\r\n break\r\n i+=1\r\n else:\r\n flag=1\r\n if flag==1:\r\n break\r\n if not flag:\r\n break\r\nprint(int(num)-1)\r\n", "\n\ntry:\n while True:\n st = set()\n n = int(input())\n L = [(i, x) for i in range(n) for x in map(int, input().split())]\n # print(L)\n for u, v in L:\n st.add(v)\n if n >= 2:\n for u1, v1 in L:\n for u2, v2 in L:\n if u1 != u2:\n st.add(v1 * 10 + v2)\n if n == 3:\n for u1, v1 in L:\n for u2, v2 in L:\n for u3, v3 in L:\n if u1 != u2 != u3 and u1 != u3:\n st.add(v1 * 100 + v2 * 10 + v3)\n def solve():\n from itertools import count\n for i in count(1, 1):\n if i not in st:\n return i - 1\n print(solve())\n\nexcept:\n pass\n\n\t \t\t\t \t\t \t \t \t\t \t\t \t", "# -*- coding: utf-8 -*-\r\n\"\"\"\r\nSpyder Editor\r\n\r\nnum=list(map(int,input().split()))\r\n[n,h]=list(map(int,input().split()))\r\na=int(input())\r\n\r\nn,m =map(int,input().split())\r\nc=[int(cost) for cost in input().split()] #fast enough speed\r\n\r\nimport math # math.sqrt(x)->square root of x. cf min() is built in.\r\nimport queue # q=queue.Queue() it's better to define this outside of for loop\r\nq.empty() it's important to put parenthesis\r\n\r\nprint (answer, \" \", end='') this prints without changing the line\r\n\r\nprint(2,3) ->output: 2 3 (there's a space between 2 and 3)\r\nprint(2,end='')\r\nprint(3,end='') -->output: 23\r\n\r\noutside of the block, variables are still stored\r\n\r\n\"\"\"\r\n\r\nimport math\r\nimport queue\r\n\r\nn=int(input())\r\na=[]\r\n\r\nfor i in range(0,n):\r\n a.append([int(c) for c in input().split()])\r\n \r\nif n==3:\r\n for p in range(1,1001):\r\n exist=False\r\n for i in range(0,6):\r\n for j in range(0,6):\r\n for k in range(0,6):\r\n if 100*a[0][i]+10*a[1][j]+a[2][k]==p:\r\n exist=True\r\n if 100*a[0][i]+10*a[2][k]+a[1][j]==p:\r\n exist=True\r\n if 100*a[1][j]+10*a[0][i]+a[2][k]==p:\r\n exist=True\r\n if 100*a[1][j]+10*a[2][k]+a[0][i]==p:\r\n exist=True\r\n if 100*a[2][k]+10*a[1][j]+a[0][i]==p:\r\n exist=True\r\n if 100*a[2][k]+10*a[0][i]+a[1][j]==p:\r\n exist=True\r\n \r\n if 10*a[0][i]+a[1][j]==p:\r\n exist=True\r\n if 10*a[0][i]+a[2][k]==p:\r\n exist=True \r\n if 10*a[1][j]+a[0][i]==p:\r\n exist=True\r\n if 10*a[1][j]+a[2][k]==p:\r\n exist=True\r\n if 10*a[2][k]+a[0][i]==p:\r\n exist=True\r\n if 10*a[2][k]+a[1][j]==p:\r\n exist=True\r\n \r\n if a[0][i]==p:\r\n exist=True\r\n if a[1][j]==p:\r\n exist=True\r\n if a[2][k]==p:\r\n exist=True\r\n if not exist:\r\n break\r\n \r\n \r\nelif n==2:\r\n for p in range(1,101):\r\n exist=False\r\n for i in range(0,6):\r\n for j in range(0,6):\r\n if 10*a[0][i]+a[1][j]==p:\r\n exist=True\r\n if 10*a[1][j]+a[0][i]==p:\r\n exist=True\r\n if a[0][i]==p:\r\n exist=True\r\n if a[1][j]==p:\r\n exist=True\r\n \r\n if not exist:\r\n break\r\n \r\n \r\nelif n==1:\r\n for p in range(1,11):\r\n exist=False\r\n for i in range(0,6):\r\n if a[0][i]==p:\r\n exist=True\r\n if not exist:\r\n break\r\n\r\nprint(p-1)\r\n ", "#!/usr/bin/env python3\n\nfrom itertools import permutations\n\ndef digits(i):\n D = []\n while i:\n D.append(i%10)\n i //= 10\n return D\n\ndef buildable(C,i):\n D = digits(i)\n for P in permutations(C,r=len(D)):\n if all(D[i] in P[i] for i in range(len(D))):\n return True\n return False\n\ndef main():\n n = int(input())\n C = [set(map(int,input().split())) for _ in range(n)]\n i = 1\n while buildable(C,i):\n i += 1\n print(i-1)\n\nmain()\n", "n=int(input())\r\nstart=1\r\nL=[list(map(int,input().split())) for i in range(n)]\r\nfor i in range(n) :\r\n L.append(L[i])\r\n\r\nf=True\r\nwhile f :\r\n\r\n z=False\r\n t=[int(x) for x in str(start)]\r\n \r\n for i in range(n) :\r\n p=0\r\n if z :\r\n break\r\n for j in range(i,i+n) :\r\n if t[p] in L[j] :\r\n p+=1\r\n if p==len(t) :\r\n z=True\r\n break\r\n if z :\r\n start+=1\r\n else :\r\n break\r\nprint(start-1)\r\n \r\n \r\n \r\n \r\n \r\n \r\n", "n = int(input())\ndice = []\nfor _ in range(n):\n num = list(map(int, input().split()))\n dice.append(num)\n\n\ncurr = 1\nflag = False\nwhile not flag:\n digits = list(map(int, list(str(curr))))\n if len(digits) > n:\n flag = True\n else:\n if len(digits) == 1:\n if any(digits[0] in dice[i] for i in range(n)):\n curr += 1\n else:\n flag = True\n elif len(digits) == 2:\n if any(digits[0] in dice[i] and any(digits[1] in dice[j] for j in [x for x in range(n) if x != i]) for i in range(n)):\n curr += 1\n else:\n flag = True\n elif len(digits) == 3:\n if any(digits[0] in dice[i] and any(digits[1] in dice[j] and any(digits[2] in dice[k] for k in [x for x in range(n) if x != i and x != j]) for j in [x for x in range(n) if x != i]) for i in range(n)):\n curr += 1\n else:\n flag = True\nprint(curr-1)\n", "from collections import defaultdict as dc,Counter as C\r\nn=int(input())\r\nmp=dc(lambda:0)\r\narr=list()\r\nst=set()\r\nfor i in range(n):arr.append(list(input().split()))\r\nif n==1:\r\n lol=9\r\n for i in range(n):\r\n for x in arr[i]:\r\n st.add(x)\r\nelif n==2:\r\n lol=99\r\n for i in range(n):\r\n for x in arr[i]:\r\n st.add(x)\r\n for i in range(n):\r\n for j in range(n):\r\n if i==j:continue\r\n for x in arr[i]:\r\n for y in arr[j]:\r\n st.add(x+y)\r\n \r\nelse:\r\n lol=999\r\n for i in range(n):\r\n for x in arr[i]:\r\n st.add(x)\r\n for i in range(n):\r\n for j in range(n):\r\n if i==j:continue\r\n for x in arr[i]:\r\n for y in arr[j]:\r\n st.add(x+y)\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i==j or i==k or j==k:continue\r\n for x in arr[i]:\r\n for y in arr[j]:\r\n for z in arr[k]:\r\n st.add(x+y+z)\r\nmx=0\r\n#print(st)\r\nfor i in range(1,lol):\r\n tmp=str(i)\r\n if tmp not in st:break\r\n mx=i\r\nprint(mx)", "n = int(input())\r\nif n == 1:\r\n a = [int(i) for i in input().split()]\r\n b = [10000 for i in range(6)]\r\n c = [10000 for i in range(6)]\r\nif n == 2:\r\n a = [int(i) for i in input().split()]\r\n b = [int(i) for i in input().split()]\r\n c = [10000 for i in range(6)]\r\nif n == 3:\r\n a = [int(i) for i in input().split()]\r\n b = [int(i) for i in input().split()]\r\n c = [int(i) for i in input().split()]\r\n\r\nfor r in range(1,10):\r\n if r not in a + b + c:\r\n print(r - 1)\r\n exit(0)\r\nfor r in range(10,100):\r\n ok = 0\r\n s = list(str(r))\r\n if (int(s[0]) in a and int(s[1]) in b + c) \\\r\n or (int(s[0]) in b and int(s[1]) in c + a) \\\r\n or (int(s[0]) in c and int(s[1]) in a + b):\r\n ok = 1\r\n if ok == 0:\r\n print(r-1)\r\n exit(0)\r\nfor r in range(100,1000):\r\n ok = 0\r\n s = list(str(r))\r\n if (int(s[0]) in a and int(s[1]) in b and int(s[2])) in c \\\r\n or (int(s[0]) in a and int(s[2]) in b and int(s[1])) in c \\\r\n or (int(s[1]) in a and int(s[0]) in b and int(s[2])) in c \\\r\n or (int(s[1]) in a and int(s[2]) in b and int(s[0])) in c \\\r\n or (int(s[2]) in a and int(s[0]) in b and int(s[1])) in c \\\r\n or (int(s[2]) in a and int(s[1]) in b and int(s[0])) in c:\r\n ok = 1\r\n if ok == 0:\r\n print(r-1)\r\n exit(0)\r\n\r\n", "d = []\r\nn = int(input())\r\n\r\nclass dice:\r\n def __init__(self, line):\r\n s = line.split()\r\n self.a = []\r\n for i in range(6):\r\n self.a.append(int(s[i]))\r\n self.l = 6\r\n\r\ndef isValid(x):\r\n if x < 10:\r\n for cur in d:\r\n for i in cur.a:\r\n if x == i:\r\n return True\r\n elif x < 100:\r\n for i in range(n):\r\n for p in d[i].a:\r\n for j in range(n):\r\n if i == j:\r\n continue\r\n for q in d[j].a:\r\n y = p * 10 + q\r\n if x == y:\r\n return True\r\n else:\r\n for i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n for k in range(n):\r\n if k != i and k != j:\r\n for p in d[i].a:\r\n for q in d[j].a:\r\n for r in d[k].a:\r\n y = 100 * p + 10 * q + r\r\n if x == y:\r\n return True\r\n return False\r\n\r\nfor i in range(n):\r\n d.append(dice(input()))\r\nans = 0\r\nfor i in range(1, 1000):\r\n if isValid(i):\r\n ans = i\r\n else:\r\n break\r\nprint(i - 1)", "num =int(input())\n\na=[]\nb=[]\nc=[]\n\nfor i in range(num):\n a=map(int,input().split())\n b.append(list(a))\n\na=[]\nfor i in range(num):\n for j in b[i]:\n a.append(j)\n#print(a)\n\nfor i in range(num):\n for j in range(num):\n if i == j:\n continue\n else:\n for k in range(6):\n for l in range(6):\n a.append(b[i][k]*10+b[j][l])\n\na\na.sort()\n#print(a)\na=list(set(a))\n#print(a)\na.append(a[len(a)-1])\nif a[0]>1:\n print(\"0\")\nelse:\n for i in range(len(a)-1):\n if a[i]+1 != a[i+1]:\n print(a[i])\n break\n\n\n", "n = int(input())\n\ndice = []\n\nfor i in range(n):\n dice.append([int(i) for i in input().split()])\n\nh = [0] * 100000\n\nfor i in dice[0]:\n h[i]+=1\n if len(dice) > 1:\n for j in dice[1]:\n h[j]+=1\n num = (i*10) + j\n h[num]+=1\n num = (j*10) + i\n h[num]+=1\n if len(dice) > 2:\n for k in dice[2]:\n h[k]+=1\n #pairs\n num = (i*10) + k\n h[num]+=1\n num = (k*10) + i\n h[num]+=1\n num = (k*10) + j\n h[num]+=1\n num = (j*10) + k\n h[num]+=1\n #triplets\n num = (i*100) + (j*10) + k\n h[num]+=1\n num = (i*100) + (k*10) + j\n h[num]+=1\n num = (k*100) + (i*10) + j\n h[num]+=1\n num = (k*100) + (j*10) + i\n h[num]+=1\n num = (j*100) + (i*10) + k\n h[num]+=1\n num = (j*100) + (k*10) + i\n h[num]+=1\n\nh = h[1:]\n\nprint(len(h[:h.index(0)]))\n", "def check(s, a, used):\n if len(used) == len(s):\n return True\n n = len(a)\n index = len(used)\n for i in range(n):\n if i not in used and s[index] in a[i]:\n result = check(s, a, used.union(set([i])))\n if result:\n return True\n return False\n\n\ndef valid(s, a):\n if len(s) > len(a):\n return False\n return check(s, a, set())\n\n\nn = int(input())\na = []\nfor _ in range(n):\n a.append(list(input().split()))\ncount = 1\nwhile True:\n if not valid(str(count), a):\n print(count - 1)\n break\n count += 1\n\n \t\t \t\t \t\t\t \t\t \t \t \t\t \t", "n = int(input())\r\nlst = []\r\nfor i in range(n):\r\n a = list(map(int,input().split()))\r\n lst.append(a)\r\ncnt = 0\r\nans = 0\r\n\r\nif n == 1:\r\n i = 1\r\n while 1:\r\n if i == 10: break\r\n if i in lst[0]:\r\n i += 1\r\n else:\r\n print(i - 1)\r\n break\r\nelif n == 2:\r\n i = 1\r\n f = 0\r\n while 1:\r\n if i == 10: break\r\n if i in lst[0] or i in lst[1]:\r\n i += 1\r\n else:\r\n print(i - 1)\r\n f = 1\r\n break\r\n if f == 0:\r\n i = 10\r\n\r\n while 1:\r\n n1 = int(str(i)[0])\r\n n2 = int(str(i)[1])\r\n if i == 100: break\r\n if n1 in lst[0] and n2 in lst[1] or n1 in lst[1] and n2 in lst[0]:\r\n i += 1\r\n else:\r\n break\r\n print(i - 1)\r\nelse:\r\n i = 1\r\n f = 0\r\n while 1:\r\n if i == 10:break\r\n if i in lst[0] or i in lst[1] or i in lst[2]:\r\n i += 1\r\n else:\r\n print(i - 1)\r\n f = 1\r\n break\r\n if f == 0:\r\n i = 10\r\n while 1:\r\n n1 = int(str(i)[0])\r\n n2 = int(str(i)[1])\r\n if i == 100:\r\n print(\"1\")\r\n break\r\n if (n1 in lst[0] and n2 in lst[1]) or (n1 in lst[1] and n2 in lst[0]) or (n1 in lst[0] and n2 in lst[2]) or (n1 in lst[1] and n2 in lst[2]) or (n1 in lst[2] and n2 in lst[1]) or (n1 in lst[2] and n2 in lst[0]) or (n1 in lst[2] and n2 in lst[0]):\r\n i += 1\r\n else:\r\n print(i - 1)\r\n f = 1\r\n break\r\n if f == 0:\r\n i = 100\r\n while 1:\r\n n1 = int(str(i)[0])\r\n n2 = int(str(i)[1])\r\n n3 = int(str(i)[2])\r\n if i == 1000: break\r\n if n1 in lst[0] and n2 in lst[1] and n3 in lst[2] or n1 in lst[1] and n2 in lst[0] and n3 in lst[2] or n1 in lst[1] and n2 in lst[2] and n3 in lst[0] or n1 in lst[2] and n2 in lst[1] and n3 in lst[0] or n1 in lst[2] and n2 in lst[0] and n3 in lst[1] or n1 in lst[0] and n2 in lst[2] and n3 in lst[1]:\r\n i += 1\r\n else:\r\n break\r\n print(i - 1)\r\n", "from itertools import permutations, product\n\n\ndef main():\n n, l = int(input()), [True] + [False] * 999\n dices = [input().split() for _ in range(n)]\n for w in range(1, n + 1):\n for g in permutations(dices, w):\n for dd in product(*g):\n if dd[0] != '0':\n l[int(''.join(dd))] = True\n print(l.index(False) - 1)\n\n\nif __name__ == '__main__':\n main()\n", "import sys\r\nimport itertools\r\n\r\ndef valid(i):\r\n s = str(i)\r\n length = len(s)\r\n if length > n:\r\n return False\r\n for tuple in itertools.permutations(perm, length):\r\n valid = True\r\n for cnt, k in enumerate(s):\r\n if k not in strs[tuple[cnt]]:\r\n valid = False\r\n break;\r\n if valid:\r\n return True\r\n return False\r\n\r\nn = int(sys.stdin.readline().rstrip())\r\nperm = [x for x in range(n)]\r\nstrs = []\r\nfor i in range(n):\r\n strs.append(\"\".join(sys.stdin.readline().rstrip().split()))\r\n\r\nfor i in range(1, 1001):\r\n if not valid(i):\r\n print(i - 1)\r\n exit()\r\n\r\n", "# LUOGU_RID: 116536697\na,g=int(input()),0\r\nb=[input().split() for c in range(a)]\r\nfor d in range(1,1000):\r\n e=str(d)\r\n if d<10:\r\n r=0\r\n for f in b:\r\n if e in f:\r\n r=1\r\n break\r\n if r==0:\r\n g=1\r\n \r\n elif d<100:\r\n h,i,e=[],[],list(e)\r\n for j in range(a):\r\n if e[0] in b[j]:\r\n h.append(j)\r\n if e[1] in b[j]:\r\n i.append(j)\r\n if len(h)==len(i)==1:\r\n if h==i:\r\n g=1\r\n elif len(h)==0 or len(i)==0:\r\n g=1\r\n else:\r\n k,l,m,e=[],[],[],list(e)\r\n for n in range(a):\r\n if e[0] in b[n]:\r\n k.append(n)\r\n if e[1] in b[n]:\r\n l.append(n)\r\n if e[2] in b[n]:\r\n m.append(n)\r\n if len(k)==0 or len(l)==0 or len(m)==0:\r\n g=1\r\n elif len(k)==3:\r\n if len(l)==len(m)==1 and l==m:\r\n g=1\r\n elif len(l)==3:\r\n if len(k)==len(m)==1 and k==m:\r\n g=1\r\n elif len(m)==3:\r\n if len(k)==len(l)==1 and k==l:\r\n g=1\r\n elif len(k)==2:\r\n if len(l)==len(m)==1 and l==m:\r\n g=1\r\n else:\r\n o=[]\r\n for p in k:\r\n o.append(p)\r\n for q in l:\r\n o.append(q)\r\n for r in m:\r\n o.append(r)\r\n if e[0] not in o or e[1] not in o or e[2] not in o:\r\n g=1\r\n elif len(m)==2:\r\n if len(k)==len(l)==1 and k==l:\r\n g=1\r\n else:\r\n o=[]\r\n for p in k:\r\n o.append(p)\r\n for q in l:\r\n o.append(q)\r\n for r in m:\r\n o.append(r)\r\n if e[0] not in o or e[1] not in o or e[2] not in o:\r\n g=1\r\n elif len(l)==2:\r\n if len(k)==len(m)==1 and k==m:\r\n g=1\r\n else:\r\n o=[]\r\n for p in k:\r\n o.append(p)\r\n for q in l:\r\n o.append(q)\r\n for r in m:\r\n o.append(r)\r\n if e[0] not in o or e[1] not in o or e[2] not in o:\r\n g=1\r\n else:\r\n if l==k or k==m or l==m:\r\n g=1\r\n if g==1:\r\n print(d-1)\r\n break", "from itertools import combinations as c\nn = int(input())\ns = set()\nif n >= 1:\n l = input().split()\n for i in l:\n if i != '0':\n s.add(int(i))\nif n >= 2:\n l2 = input().split()\n for i in l:\n for j in l2:\n if i != '0':\n s.add(int(i + j))\n if j != '0':\n s.add(int(j))\n s.add(int(j + i))\nif n == 3:\n l3 = input().split()\n for i in l:\n for j in l2:\n for k in l3:\n if i != '0':\n s.add(int(i + j + k))\n # s.add(int(i + k + j))\n s.add(int(i + k))\n if j != '0':\n s.add(int(j + k))\n # s.add(int(j + k + i))\n # s.add(int(j + i + k))\n if k != '0':\n s.add(int(k))\n s.add(int(k + j))\n s.add(int(k + i))\n # s.add(int(k + i + j))\n # s.add(int(k + j + i))\nprint(min((set(range(1000)) - s) - {0}) - 1)\n", "def check(cubes, n):\r\n if len(str(n)) == 1:\r\n for cube in cubes:\r\n if n in cube:\r\n return True\r\n return False\r\n elif len(str(n)) == 2:\r\n for c1 in range(len(cubes)):\r\n for c2 in range(len(cubes)):\r\n if c1 == c2:\r\n pass\r\n elif int(str(n)[0]) in cubes[c1] and int(str(n)[1]) in cubes[c2]:\r\n return True\r\n return False\r\n\r\n\r\n\r\n\r\nn = int(input())\r\ncubes = [[int(x) for x in input().split(' ')] for i in range(n)]\r\ni = 1\r\nwhile check(cubes, i):\r\n i += 1\r\nprint(i - 1)\r\n", "import sys\r\nimport math\r\nimport itertools\r\n\"\"\"files=False\r\nif files:\r\n fn='symposium'\r\n sys.stdin=open(fn+'.in')\r\n sys.stdout=open(fn+'.out',mode='w')\r\n\"\"\"\r\n\r\ndef ria():\r\n return [int(i) for i in input().split()]\r\n\r\n\r\nn=int(input())\r\ncubes=[[j for j in input().split()] for i in range(n)]\r\n#print(cubes)\r\nans=0\r\nfor i in range(1,1000):\r\n #print(len(str(i)),' ',n)\r\n if len(str(i))>n:\r\n break\r\n \r\n good=False\r\n d=str(i)\r\n for j in itertools.permutations(range(n),len(str(i))):\r\n bad=False\r\n #print(d,j)\r\n for N,k in enumerate(j):\r\n if not(d[N] in cubes[k]):\r\n bad=True\r\n break\r\n if not bad:\r\n good=True\r\n break\r\n\r\n \r\n if not good:\r\n break\r\n\r\n ans=i\r\nprint(ans)\r\n", "num = [[0 for i in range(6)] for j in range(3)]\r\nvalue = [0 for i in range(1000)]\r\nvis = [0 for i in range(3)]\r\n\r\n\r\ndef dfs(ant, no):\r\n value[no] = 1\r\n global n\r\n if ant > n:\r\n return\r\n for i in range(n):\r\n if vis[i]:\r\n continue\r\n for j in range(6):\r\n vis[i] = 1\r\n dfs(ant + 1, no * 10 + num[i][j])\r\n vis[i] = 0\r\n\r\n\r\ndef main():\r\n global n\r\n n = int(input())\r\n for i in range(n):\r\n v = list(map(int, input().split()))\r\n for j in range(6):\r\n num[i][j] = v[j]\r\n dfs(0, 0)\r\n for i in range(1, 1000):\r\n if not value[i]:\r\n print(i - 1)\r\n break\r\n\r\nmain()\r\n", "import itertools\r\n\r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append(input().split())\r\n\r\ns = set()\r\ndef rec(ind, curr, aa):\r\n if (ind != 0): s.add(int(curr))\r\n else: s.add(0)\r\n if (ind == n): \r\n return\r\n for i in range(6):\r\n rec(ind + 1, curr + aa[ind][i], aa)\r\n\r\nfor aa in itertools.permutations(a):\r\n rec(0, \"\", aa)\r\n\r\nfor i in range(1001):\r\n if not i in s:\r\n print(i - 1);\r\n break\r\n\r\n\r\n", "n = int(input())\r\na = [list(map(int,input().split())) for x in range(n)]\r\n\r\n\r\ndef valid(di):\r\n b = []\r\n for i in di:\r\n t = []\r\n for j in range(n):\r\n if i in a[j]:\r\n t.append(j)\r\n b.append(sorted(t))\r\n \r\n for i in b[0]:\r\n if len(b)>1:\r\n for j in b[1]:\r\n if len(b)>2:\r\n for k in b[2]:\r\n if i!=j:\r\n return True\r\n else:\r\n if i!=j:\r\n return True\r\n else: \r\n return True\r\n return False\r\n\r\nx = 1\r\nwhile True:\r\n #print(\"*****\",x)\r\n temp = x\r\n done = []\r\n flag = 0\r\n while temp>0:\r\n done.append(temp%10)\r\n temp=temp//10\r\n if valid(done[::-1]):\r\n x+=1\r\n else:\r\n break\r\n \r\nprint(x-1)", "n=int(input())\r\nf=0\r\nif n==1:\r\n a = list(map(int, input().strip().split(' ')))\r\n for j in range(1,10):\r\n if j in a:\r\n continue\r\n else:\r\n f=1\r\n break\r\n if f==1:\r\n print(j-1)\r\n else:\r\n print(j)\r\n \r\nelif n==2:\r\n a = list(map(int, input().strip().split(' ')))\r\n b = list(map(int, input().strip().split(' ')))\r\n for j in range(1,100):\r\n if j<10:\r\n if (j in a) or (j in b):\r\n continue\r\n else:\r\n f=1\r\n break\r\n else:\r\n j2=j%10\r\n j1=j//10\r\n if ((j1 in a) and (j2 in b)) or ((j1 in b) and (j2 in a)):\r\n continue\r\n else:\r\n f=1\r\n break\r\n if f==1:\r\n print(j-1)\r\n else:\r\n print(j)\r\nelse:\r\n a = list(map(int, input().strip().split(' ')))\r\n b = list(map(int, input().strip().split(' ')))\r\n c = list(map(int, input().strip().split(' ')))\r\n for j in range(1,1000):\r\n if j<10:\r\n if (j in a) or (j in b) or (j in c):\r\n continue\r\n else:\r\n f=1\r\n break\r\n elif j>=10 and j<100:\r\n j1=j//10\r\n j2=j%10\r\n if (j1 in a) and (j2 in b):\r\n continue\r\n elif (j1 in b) and (j2 in a):\r\n continue\r\n elif (j1 in a) and (j2 in c):\r\n continue\r\n elif (j1 in c) and (j2 in a):\r\n continue\r\n elif (j1 in c) and (j2 in b):\r\n continue\r\n elif (j1 in b) and (j2 in c):\r\n continue\r\n else:\r\n f=1\r\n break\r\n else:\r\n j1=j//100\r\n j2=(j%100)//10\r\n j3=j%10\r\n if (j1 in a) and (j2 in b) and (j3 in c):\r\n continue\r\n elif (j1 in a) and (j2 in c) and (j3 in b):\r\n continue\r\n elif (j1 in b) and (j2 in a) and (j3 in c):\r\n continue\r\n elif (j1 in b) and (j2 in c) and (j3 in a):\r\n continue\r\n elif (j1 in c) and (j2 in a) and (j3 in b):\r\n continue\r\n elif (j1 in c) and (j2 in b) and (j3 in a):\r\n continue\r\n else:\r\n f=1\r\n break\r\n if f==1:\r\n print(j-1)\r\n else:\r\n print(j)\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "import sys\r\nn=int(input())\r\na=[[],[],[]]\r\nfor i in range(n):\r\n a[i]=list(map(int,input().split()))\r\nk=a\r\ni=1\r\nwhile 1:\r\n r=str(i)\r\n d=[]\r\n g=0\r\n y=0\r\n for j in r:\r\n for m in range(3):\r\n if int(j) in a[m] and m not in d:\r\n g=m\r\n d.append(g)\r\n y=m\r\n break\r\n else:\r\n d=[]\r\n g=0\r\n y=0\r\n for z in r:\r\n for t in range(1,4):\r\n if int(z) in a[3-t] and 3-t not in d:\r\n g=3-t\r\n d.append(g)\r\n y=3-t\r\n break\r\n else:\r\n print(i-1)\r\n sys.exit()\r\n break\r\n i+=1\r\n", "n = int(input())\r\nl = [[], [], []]\r\nfor i in range(n):\r\n l[i] = list(map(int, input().split()))\r\ntmp = ['012', '021', '102', '120', '201', '210']\r\n\r\n# print(l)\r\n\r\nans = 0\r\nfor i in range(1, 1000):\r\n check = 0\r\n for j in tmp:\r\n tm = i\r\n ch = 1\r\n # print(tm)\r\n yoyo = 0\r\n while tm > 0:\r\n r = tm % 10\r\n if r in l[int(j[yoyo])]:\r\n yoyo -= -1\r\n tm //= 10\r\n continue\r\n else:\r\n ch = 0\r\n break\r\n if ch:\r\n check = 1\r\n break\r\n if check == 0: break\r\n ans = i\r\nprint(ans)", "def main():\r\n\r\n\r\n\r\n\r\n\r\n\tn = int(input())\r\n\tl = []\r\n\tfor i in range(n):\r\n\t\tl.append(list(map(int, input().split())))\r\n\r\n\ta = [[(0, )], \\\r\n\t\t[(0, ), (1, )], \\\r\n\t\t[(0, ), (1, ), (2, )]]\r\n\td = 1\r\n\twhile d <= 9:\r\n\t\tds = [d]\r\n\t\tflag = False\r\n\t\tfor i in a[n - 1]:\r\n\t\t\tflag2 = True\r\n\t\t\tfor j in range(1):\r\n\t\t\t\tif ds[j] not in l[i[j]]:\r\n\t\t\t\t\tflag2 = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif flag2:\r\n\t\t\t\tflag = True\r\n\t\t\t\tbreak\r\n\t\tif not flag:\r\n\t\t\treturn(d - 1)\r\n\t\td += 1\r\n\r\n\r\n\ta = [[], \\\r\n\t\t[(0, 1), (1, 0)], \\\r\n\t\t[(0, 1), (0, 2), (1, 0), (1, 2), (2, 0), (2, 1)]]\r\n\td = 10\r\n\twhile d <= 99:\r\n\t\tds = [d // 10, d % 10]\r\n\t\tflag = False\r\n\t\tfor i in a[n - 1]:\r\n\t\t\tflag2 = True\r\n\t\t\tfor j in range(2):\r\n\t\t\t\tif ds[j] not in l[i[j]]:\r\n\t\t\t\t\tflag2 = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif flag2:\r\n\t\t\t\tflag = True\r\n\t\t\t\tbreak\r\n\t\tif not flag:\r\n\t\t\treturn(d - 1)\r\n\t\td += 1\r\n\r\n\ta = [[], \\\r\n\t\t[], \\\r\n\t\t[(0, 1, 2), (0, 2, 1), (1, 0, 2), (1, 2, 0), (2, 0, 1), (2, 1, 0)]]\r\n\td = 100\r\n\twhile d <= 999:\r\n\t\tds = [d // 100, (d // 10) % 10, d % 10]\r\n\t\tflag = False\r\n\t\tfor i in a[n - 1]:\r\n\t\t\tflag2 = True\r\n\t\t\tfor j in range(3):\r\n\t\t\t\tif ds[j] not in l[i[j]]:\r\n\t\t\t\t\tflag2 = False\r\n\t\t\t\t\tbreak\r\n\t\t\tif flag2:\r\n\t\t\t\tflag = True\r\n\t\t\t\tbreak\r\n\t\tif not flag:\r\n\t\t\treturn(d - 1)\r\n\t\td += 1\r\n\r\nprint(main())", "def check(k):\r\n if k < 10:\r\n return k in bricks[0] or k in bricks[1] or k in bricks[2]\r\n else:\r\n first = k // 10\r\n second = k % 10\r\n if (first in bricks[0] and (second in bricks[1] or second in bricks[2])) or\\\r\n (first in bricks[1] and (second in bricks[0] or second in bricks[2])) or\\\r\n (first in bricks[2] and (second in bricks[0] or second in bricks[1])):\r\n return True\r\n return False\r\n\r\n\r\nn = int(input())\r\nbricks = []\r\nfor _ in range(n):\r\n bricks.append(set(map(int, input().split())))\r\nif n == 2:\r\n bricks.append(set())\r\nelif n == 1:\r\n bricks.append(set())\r\n bricks.append(set())\r\nfor i in range(1, 100):\r\n if not check(i):\r\n print(i - 1)\r\n exit(0)\r\n", "n=int(input())\r\na=list(map(int,input().split(' ')))\r\np=True\r\nif n==3:\r\n b=list(map(int,input().split(' ')))\r\n c = list(map(int, input().split(' ')))\r\n for i in range(1,10):\r\n if (i not in a) and (i not in b) and (i not in c):\r\n p=False\r\n print(i-1)\r\n break\r\n if p:\r\n for i in range(10,100):\r\n x=i%10\r\n y=i//10\r\n if (x in a) and ((y in b) or (y in c)):\r\n continue\r\n elif (x in b) and ((y in a) or (y in c)):\r\n continue\r\n elif (x in c) and ((y in a) or (y in b)):\r\n continue\r\n else:\r\n print(i-1)\r\n break\r\nelif n==2:\r\n b=list(map(int,input().split(' ')))\r\n for i in range(1,10):\r\n if (i not in a) and (i not in b):\r\n p=False\r\n print(i-1)\r\n break\r\n if p:\r\n for i in range(10,100):\r\n x=i%10\r\n y=i//10\r\n if (x in a) and (y in b):\r\n continue\r\n elif (x in b) and (y in a):\r\n continue\r\n else:\r\n print(i-1)\r\n break\r\nelse:\r\n for i in range(1,7):\r\n if i not in a:\r\n print(i-1)\r\n break\r\n", "n = int(input())\r\ncubes = []\r\nfor i in range(n):\r\n cube = input().split(\" \")\r\n cubes.append(cube)\r\nnums = []\r\nfor i1 in range(n):\r\n for j1 in cubes[i1]:\r\n nums.append(int(j1))\r\n for i2 in range(n):\r\n if i1==i2:\r\n continue\r\n for j2 in cubes[i2]:\r\n nums.append(int(j1+j2))\r\nnums = sorted(set(nums+[0]))\r\nres = 0\r\nfor i in range(len(nums)):\r\n if i==nums[i]:\r\n res = i\r\n else:\r\n break\r\nprint(res)# 1691088789.6006937", "import itertools\r\ndef possible(cubes, n):\r\n\ts = str(n)\r\n\tif (len(cubes) < len(s)):\r\n\t\treturn False\r\n\tfor p in itertools.permutations(range(len(cubes))):\r\n\t\tok = True\r\n\t\tfor i in range(len(s)):\r\n\t\t\tif (int(s[i]) not in cubes[p[i]]):\r\n\t\t\t\tok = False\r\n\t\tif (ok):\r\n\t\t\treturn True\r\n\treturn False\r\n\r\nn = int(input())\r\ncubes = []\r\nfor i in range(n):\r\n\tcubes.append(list(map(int, input().split())))\r\nfor i in range(1, 1001):\r\n\tif (not possible(cubes, i)):\r\n\t\tprint (i - 1)\r\n\t\tbreak", "#test = [\"0 1 3 5 6 8\", \"1 2 4 5 7 8\", \"2 3 4 6 7 9\"]\r\n#n = 3\r\nfreq = []\r\n\r\nn = int(input())\r\n\r\n\r\ndef getFreq(f):\r\n h = {}\r\n for i in range(10):\r\n h[str(i)]=0\r\n for i in list(map(str,f.split())):\r\n h[i]+=1\r\n return h\r\n\r\n\r\nfor i in range(n):\r\n freq.append(getFreq(str(input())))\r\n\r\n\r\ndef check(num,fr):\r\n nums = str(num)\r\n numsarr = []\r\n n = len(nums)\r\n if n == 2:\r\n numsarr.append(nums)\r\n numsarr.append(nums[1]+nums[0])\r\n elif n == 3:\r\n numsarr.append(nums)\r\n numsarr.append(nums[2] + nums[1]+nums[0])\r\n numsarr.append(nums[0] + nums[2] + nums[1])\r\n numsarr.append(nums[2] + nums[0] + nums[1])\r\n numsarr.append(nums[1] + nums[0] + nums[2])\r\n numsarr.append(nums[1] + nums[2] + nums[0])\r\n elif n == 1:\r\n numsarr.append(nums)\r\n for nn in numsarr:\r\n n = len(nums)\r\n used = []\r\n\r\n for s in list(nn):\r\n for j in range(len(fr)):\r\n #print(j)\r\n if j not in used:\r\n if fr[j][s] > 0:\r\n used.append(j)\r\n n -= 1\r\n break\r\n if n == 0:\r\n return True\r\n return False\r\n\r\nm = 0\r\nfor i in range(1,1000):\r\n if not check(i,freq):\r\n break\r\n else:\r\n m=i\r\nprint(m)\r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\ncubes = []\r\nfor _ in range(n):\r\n cubes.append([int(i) for i in input().split()])\r\n\r\n\r\ndef permutation(result):\r\n if len(result) == n:\r\n yield result\r\n else:\r\n for num in range(n):\r\n if str(num) not in result:\r\n yield from permutation(result + str(num))\r\n\r\n\r\nnum = 1\r\npermutations = []\r\nfor perm in permutation(''):\r\n # print(perm)\r\n permutations.append(perm)\r\n\r\nwhile True:\r\n flag = 0\r\n for perm in permutations:\r\n counter = 0\r\n order_num = 0\r\n for ind in perm:\r\n ind = int(ind)\r\n # print(str(num), num)\r\n if int(str(num)[order_num]) in cubes[ind]:\r\n counter += 1\r\n order_num += 1\r\n if counter == len(str(num)):\r\n flag = 1\r\n break\r\n if flag == 0:\r\n print(num - 1)\r\n break\r\n num += 1\r\n\r\n\r\n\r\n\r\n", "n = int(input())\r\ncubes = []\r\n\r\nfor i in range(n):\r\n c = list(map(int,input().split()))\r\n cubes.append(c)\r\n \r\nez = True\r\na = 1\r\nwhile ez and a < 1000:\r\n ez = False\r\n if a < 10:\r\n for i in range(n):\r\n if a in cubes[i]:\r\n ez = True\r\n \r\n if a >= 10 and a < 100:\r\n d1 = a // 10\r\n d2 = a % 10\r\n p1 = set()\r\n p2 = set()\r\n for i in range(n):\r\n if d1 in cubes[i]:\r\n p1.add(i)\r\n if d2 in cubes[i]:\r\n p2.add(i)\r\n p3 = p1.union(p2)\r\n if len(p3) >= 2 and len(p1) != 0 and len(p2) != 0:\r\n ez = True\r\n \r\n \r\n if a >= 100 and a < 1000:\r\n d1 = a // 10\r\n d2 = a // 10 % 10\r\n d3 = a % 10\r\n p1 = set()\r\n p2 = set()\r\n p3 = set()\r\n for i in range(n):\r\n if d1 in cubes[i]:\r\n p1.add(i)\r\n if d2 in cubes[i]:\r\n p2.add(i)\r\n if d3 in cubes[i]:\r\n p3.add(i)\r\n p4 = p1.union(p2)\r\n p4 = p4.union(p3)\r\n if len(p4) == 3 and len(p1) != 0 and len(p2) != 0 and len(p3) != 0:\r\n ez = True\r\n \r\n a += 1\r\n\r\nprint(a-2)", "def make_num(num, a, n, m=6):\r\n for i in range(n):\r\n for j in range(m):\r\n num[a[i][j]] = 1\r\n\r\n for i1 in range(n):\r\n for j1 in range(m):\r\n for i2 in range(n):\r\n for j2 in range(m):\r\n if i1 != i2:\r\n x = a[i1][j1] * 10 + a[i2][j2]\r\n num[x] = 1\r\n\r\n for i1 in range(n):\r\n for j1 in range(m):\r\n for i2 in range(n):\r\n for j2 in range(m):\r\n for i3 in range(n):\r\n for (j3) in range(m):\r\n if i1 != i2 and i2 != i3:\r\n x = a[i1][j1] * 100 + a[i2][j2] * 10 + a[i3][j3]\r\n num[x] = 1\r\n\r\n\r\n\r\ndef find_ans(num):\r\n n = 1000\r\n for i in range(1, n):\r\n if not num.get(i):\r\n print(i - 1)\r\n break\r\n\r\n\r\ndef main():\r\n n = int(input())\r\n m = 6\r\n a = [[0] * m] * n\r\n for i in range(0, n):\r\n a[i] = [int(x) for x in input().split()]\r\n num = {}\r\n make_num(num, a, n, m=6)\r\n find_ans(num)\r\n\r\nmain()\r\n", "from itertools import chain, combinations, permutations, product\nfrom functools import reduce\n\npowerset = lambda xs: chain.from_iterable(combinations(xs, i) for i in range(len(xs)+1))\nundigits = lambda xs: reduce(lambda a, b: 10*a + b, xs, 0)\n\nfound = set()\nfor cs in powerset([[int(x) for x in input().split()] for i in range(int(input()))]):\n\tfor ps in permutations(cs):\n\t\tfound |= set(map(undigits, product(*ps)))\nfor i in sorted(found):\n\tif i + 1 not in found:\n\t\tprint(i)\n\t\tbreak\nelse:\n\tprint(0)\n", "n=int(input())\r\na=[input().split() for _ in range(n)]\r\nv=[]\r\nfor i in range(6):\r\n for j in range(n):\r\n v.append(int(a[j][i]))\r\nif n>=2:\r\n for i in range(6):\r\n for j in range(6):\r\n for k in range(n):\r\n for l in range(n):\r\n if k!=l:\r\n v.append(int(a[k][i]+a[l][j]))\r\nif n>=3:\r\n for i in range(6):\r\n for j in range(6):\r\n for k in range(6):\r\n for l in range(n):\r\n for m in range(n):\r\n for o in range(n):\r\n if l!=m and l!=o and m!=o:\r\n v.append(int(a[l][i]+a[m][j]+a[o][k]))\r\nfor i in range(1,1001):\r\n if i not in v:\r\n print(i-1)\r\n exit()", "def cubic_nums(cubes):\n if not cubes:\n yield \"\"\n return\n\n cube = cubes.pop()\n for tail in cubic_nums(cubes):\n yield tail\n for d in cube: \n for i in range(len(tail) + 1):\n yield tail[:i] + d + tail[i:]\n\nn = int(input())\ncubes = []\nfor i in range(n):\n cubes.append(input().strip().split())\n\nall_nums = set()\nfor cubic_num in cubic_nums(cubes):\n if cubic_num != \"\":\n all_nums.add(int(cubic_num))\n\nall_nums = [x for x in sorted(all_nums) if x != 0]\nx = 0\nwhile x < len(all_nums) and x + 1 == all_nums[x]:\n x += 1\n \nprint(x)\n \n", "dice = [[int(x) for x in input().split()] for i in range(int(input()))]\r\ndoable = [False] *100\r\nfor dice1 in dice:\r\n # one digit combinations\r\n for face1 in dice1:\r\n doable[face1] = True\r\n # two digit combinations\r\n for dice2 in dice:\r\n if dice1 is dice2:\r\n continue\r\n for face1 in dice1:\r\n for face2 in dice2:\r\n doable[10*face1+face2] = True\r\nfor i in range(1, 100):\r\n if not doable[i]:\r\n print(i-1)\r\n break", "# https://codeforces.com/contest/887\n\nimport sys\nimport itertools as it\n\ninput = lambda: sys.stdin.readline().rstrip() # faster!\n\n\ndef solve_case():\n n = int(input())\n a = [list(input().split()) for _ in range(n)]\n\n nums = set()\n for m in range(1, n + 1):\n for perm in it.permutations(range(n), m):\n for prod in it.product(range(6), repeat=m):\n nums.add(int(\"\".join(a[perm[i]][prod[i]] for i in range(m))))\n print(next(num - 1 for num in range(1, 1001) if num not in nums))\n\n\nsolve_case()\n", "\r\ndef gen(a, b):\r\n\tans = []\r\n\tfor i in a:\r\n\t\tfor j in b:\r\n\t\t\tans.append(i * 10 + j)\r\n\t\t\tans.append(j * 10 + i)\r\n\treturn ans\r\n\r\nn = int(input())\r\na, p = [], []\r\nfor i in range(n):\r\n\ta.append(list(map(int, input().split())))\r\nif n == 1:\r\n\tp.extend(a[0])\r\nif n == 2:\r\n\tp.extend(a[0])\r\n\tp.extend(a[1])\r\n\tp.extend(gen(a[0], a[1]))\r\nif n == 3:\r\n\tp.extend(a[0])\r\n\tp.extend(a[1])\r\n\tp.extend(a[2])\r\n\tp.extend(gen(a[0], a[2]))\r\n\tp.extend(gen(a[0], a[1]))\r\n\tp.extend(gen(a[1], a[2]))\r\n\tfor i in a[0]:\r\n\t\tfor j in a[1]:\r\n\t\t\tfor k in a[2]:\r\n\t\t\t\tp.append(i * 100 + j * 10 + k)\r\n\t\t\t\tp.append(i * 100 + k * 10 + j)\r\n\t\t\t\tp.append(j * 100 + i * 10 + k)\r\n\t\t\t\tp.append(j * 100 + k * 10 + i)\r\n\t\t\t\tp.append(k * 100 + j * 10 + i)\r\n\t\t\t\tp.append(k * 100 + i * 10 + j)\r\npl = {i : 1 for i in p}\r\nfor i in range(1, 1001):\r\n\tif not i in pl.keys():\r\n\t\tprint(i - 1)\r\n\t\tbreak\r\n\r\n\t\r\n", "n = int(input())\r\nA = []\r\nposs = []\r\nfor i in range (0,n):\r\n A = A + input().split()\r\n\r\nfor i in range (0,n):\r\n for j in range (0,6):\r\n if int(A[6*i+j]) ==0:\r\n a=0\r\n else:\r\n poss = poss + [int(A[6*i+j])]\r\n\r\n\r\nfor i in range (0,n):\r\n for j in range (0,n):\r\n if i ==j:\r\n a=0\r\n else:\r\n for k in range (0,6):\r\n for l in range (0,6):\r\n if int(A[6*i+k])==0:\r\n a=0\r\n else:\r\n poss = poss + [int(A[6*i+k])*10+int(A[6*j+l])]\r\nfor i in range (0,n):\r\n for j in range (0,n):\r\n for k in range (0,n):\r\n if i==j:\r\n a=0\r\n if j==k:\r\n a=0\r\n if k==i:\r\n a=0\r\n else:\r\n for l in range (0,6):\r\n for m in range (0,6):\r\n for p in range (0,6):\r\n if int(A[6*i+l]) ==0:\r\n a=0\r\n else:\r\n poss = poss + [int(A[6*i+l])*100+int(A[6*j+m])*10+int(A[6*k+p])]\r\n\r\ndef high(S):\r\n x = 1\r\n while True:\r\n if not(x in S):\r\n return(x-1)\r\n else:\r\n x+=1\r\n\r\nprint (high(poss))", "import itertools\r\n\r\ndef main():\r\n n = int(input())\r\n\r\n # cubes = [[int(x) for x in input().split()] for _ in range(n)]\r\n\r\n # c1 = [int(x) for x in input().split()]\r\n # c2 = [int(x) for x in input().split()] if n > 1 else []\r\n # c3 = [int(x) for x in input().split()] if n > 2 else []\r\n\r\n l7 = [(int(x), i) for i in range(1, n+1) for x in input().split()]\r\n\r\n l7ily = set()\r\n for p in range(1, n+1):\r\n for x in itertools.permutations(l7, p):\r\n count = set()\r\n s = \"\"\r\n for xi in x:\r\n s += str(xi[0])\r\n count.add(xi[1])\r\n\r\n if len(count) == p:\r\n l7ily.add(int(s))\r\n \r\n for lah in range(1, 1000):\r\n if not lah in l7ily:\r\n print(lah-1)\r\n return\r\n else:\r\n print(999)\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "import sys\nn = int(input())\na = []\nb= []\nfor i in range(n):\n tem =list(map(int,input().strip().split()))\n a.append(tem)\n b.extend(tem)\nk =0\nfor i in range(1,10):\n if i in b:\n k = k +1\n else:\n print(k)\n sys.exit()\nk = a\nif n == 2:\n k.append(a[0])\nelse:\n k.append(a[0])\n k.append(a[1])\nfor i in range(10,100):\n t1 = i//10\n t2 = i%10\n looped = False\n for j in range(len(k)//2 + 1):\n if n==2:\n if (t1 in k[j]) and (t2 in k[j+1]):\n looped = True\n else:\n if (t1 in k[j]) and ((t2 in k[j+1]) or (t2 in k[j+2])):\n looped = True\n if (looped == False):\n print(i- 1)\n sys.exit()\nprint(0)", "n = int(input())\ncubics = [[0 for _ in range(10)] for __ in range(n)]\nfor i in range(n):\n for v in [int(k) for k in input().split(' ') if k]:\n cubics[i][v] = 1\nallowed = [1 for _ in range(n)]\ndef build(v, i=0):\n if i >= len(v):\n return 1\n for j in range(n):\n if allowed[j] and cubics[j][v[i]]:\n allowed[j] = 0\n if build(v, i + 1):\n allowed[j] = 1\n return 1\n allowed[j] = 1\n return 0\nfor i in range(1, 10 ** n):\n if not build([int(k) for k in str(i)]):\n print(i - 1)\n exit()\nprint(10 ** n - 1)", "import sys\nimport io, os\ninput = sys.stdin.buffer.readline\n\nn = int(input())\nA = [list(map(int, input().split())) for i in range(n)]\n\nimport itertools\n\ns = set()\ns.add(0)\nif n == 3:\n for p in itertools.permutations(range(3), 3):\n for i in range(6):\n for j in range(6):\n for k in range(6):\n t = A[p[0]][i]*100+A[p[1]][j]*10+A[p[2]][k]\n s.add(t)\n for i in range(6):\n for j in range(6):\n t = A[0][i]*10+A[1][j]\n s.add(t)\n t = A[1][i]*10+A[0][j]\n s.add(t)\n for i in range(6):\n for j in range(6):\n t = A[1][i]*10+A[2][j]\n s.add(t)\n t = A[2][i]*10+A[1][j]\n s.add(t)\n for i in range(6):\n for j in range(6):\n t = A[2][i]*10+A[0][j]\n s.add(t)\n t = A[0][i]*10+A[2][j]\n s.add(t)\n for i in range(6):\n s.add(A[0][i])\n s.add(A[1][i])\n s.add(A[2][i])\nelif n == 2:\n for i in range(6):\n for j in range(6):\n t = A[0][i]*10+A[1][j]\n s.add(t)\n t = A[1][i]*10+A[0][j]\n s.add(t)\n for i in range(6):\n s.add(A[0][i])\n s.add(A[1][i])\nelse:\n for i in range(6):\n s.add(A[0][i])\ns = list(s)\ns.sort()\nfor i in range(len(s)):\n if s[i] != i:\n print(s[i-1])\n exit()\nelse:\n print(s[-1])\n", "from itertools import permutations\r\n\r\ndef parse(n):\r\n l = list()\r\n while(n > 0):\r\n l.append(n%10)\r\n n = n // 10\r\n return l\r\n \r\n\r\ndef check(per,n):\r\n## print(per)\r\n## print(n)\r\n for i in range(len(per)):\r\n ok = True\r\n for j in range(len(n)):\r\n if n[j] not in per[i][j]:\r\n ok = False\r\n if ok == True: return True\r\n return False\r\n \r\n \r\nl = list()\r\nfor _ in range(int(input())):\r\n l.append(list(map(int,input().split())))\r\n\r\nper = list(permutations(l))\r\n\r\nfor i in range(1,100):\r\n if(not check(per,parse(i))):\r\n print(i-1)\r\n break\r\n\r\n \r\n\r\n\r\n \r\n", "from itertools import permutations\r\n#C = comb\r\nfrom math import *\r\n\r\nn = int(input())\r\nmat = [list(map(int, input().split())) for _ in range(n)]\r\n\r\nmp = {}\r\nfor vk in mat:\r\n for el in vk:\r\n mp[str(el)] = True\r\ndef app(a):\r\n for per in permutations(a):\r\n if per[0] != 0:\r\n s = ''\r\n for p in per: s += str(p)\r\n mp[s] = True\r\n if len(s) > 2:\r\n mp[s[:-1]] = mp[s[1:]] = True\r\ndef rec(a, i, n):\r\n if i == n:\r\n app(a)\r\n return\r\n a.append(0)\r\n for j in range(len(mat[i])):\r\n a[-1] = mat[i][j]\r\n rec(a, i+1, n)\r\n a.pop()\r\nrec([], 0, n)\r\n\r\nres = 0\r\nfor i in range(1, 1000):\r\n if str(i) not in mp:\r\n res = i-1\r\n break\r\nprint(res)\r\n", "n = int(input())\r\n\r\ncubes = []\r\n\r\nfor i in range(n):\r\n cubes.append(list(map(int, input().split())))\r\n\r\n\r\ndef isCan(k):\r\n if k < 10:\r\n for i in range(n):\r\n if k in cubes[i]:\r\n return True\r\n return False\r\n elif k < 100:\r\n first = k // 10\r\n second = k % 10\r\n for i in range(n):\r\n for j in range(n):\r\n if i != j:\r\n if first in cubes[i] and second in cubes[j]:\r\n return True\r\n return False\r\n else:\r\n first = int(str(k)[0])\r\n second = int(str(k)[0])\r\n third = int(str(k)[0])\r\n for i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if i != j and j != k and i != k:\r\n if first in cubes[i] and second in cubes[j] and third in cubes[k]:\r\n return True\r\n return False\r\n\r\ni = 1\r\nwhile isCan(i):\r\n i += 1\r\nif not isCan(1):\r\n print(0)\r\nelse:\r\n print(i - 1)", "n=int(input())\r\nd=1\r\ne=1\r\nf=1\r\ng=1\r\nh=1\r\nk=1\r\nif(n==1):\r\n a=list(map(str,input().split()))\r\n for i in range(1,10):\r\n j=str(i)\r\n if j not in a:\r\n print(i-1)\r\n exit(0)\r\nif(n==2):\r\n a=list(map(str,input().split()))\r\n b=list(map(str,input().split()))\r\n for i in range(1,10):\r\n j=str(i)\r\n if j not in a and j not in b:\r\n print(i-1)\r\n exit(0)\r\n for i in range(10,37):\r\n j=str(i)\r\n if j[0] in a and j[1] in b:\r\n d=0\r\n if j[0] in b and j[1] in a:\r\n e=0\r\n if(d==1 and e==1):\r\n print(i-1)\r\n exit(0)\r\n d=1\r\n e=1\r\nif(n==3):\r\n a=list(map(str,input().split()))\r\n b=list(map(str,input().split()))\r\n c=list(map(str,input().split()))\r\n for i in range(1,10):\r\n j=str(i)\r\n if j not in a and j not in b and j not in c:\r\n print(i-1)\r\n exit(0)\r\n for i in range(10,100):\r\n j=str(i)\r\n d=1\r\n e=1\r\n f=1\r\n g=1\r\n h=1\r\n k=1\r\n if j[0] in a and j[1] in b:\r\n d=0\r\n if j[0] in b and j[1] in a:\r\n e=0\r\n if j[0] in b and j[1] in c:\r\n f=0\r\n if j[0] in c and j[1] in b:\r\n g=0\r\n if j[0] in a and j[1] in c:\r\n h=0\r\n if j[0] in c and j[1] in a:\r\n k=0\r\n if(d+e+f+g+h+k==6):\r\n print(i-1)\r\n exit(0)\r\n for i in range(100,1000):\r\n j=str(i)\r\n d=1\r\n e=1\r\n f=1\r\n g=1\r\n h=1\r\n k=1\r\n if j[0] in a and j[1] in b and j[2] in c:\r\n d=0\r\n if j[0] in b and j[1] in a and j[2] in c:\r\n e=0\r\n if j[0] in b and j[1] in c and j[2] in a:\r\n f=0\r\n if j[0] in c and j[1] in b and j[2] in a:\r\n g=0\r\n if j[0] in a and j[1] in c and j[2] in b:\r\n h=0\r\n if j[0] in c and j[1] in a and j[2] in b:\r\n k=0\r\n if(d+e+f+g+h+k==6):\r\n print(i-1)\r\n exit(0)\r\n \r\n \r\n \r\n \r\n ", "cube = []\r\nn = int(input())\r\nfor i in range(n):\r\n cube.append(list(map(int, input().split())))\r\nval = [0] * 1000\r\nused = [0] * n\r\ndef dfs(used_num, num):\r\n val[num] = 1\r\n #print(num)\r\n if used_num >= n:\r\n return\r\n for i in range(n):\r\n if used[i]:\r\n continue\r\n for j in range(6):\r\n used[i] = 1\r\n dfs(used_num+1, num*10+cube[i][j])\r\n used[i] = 0\r\ndfs(0, 0)\r\nprint(val.index(0) - 1)", "def f(x,y):\r\n for i in x:\r\n for j in y:\r\n ans[i*10+j] = True\r\ndef g(x,y,z):\r\n for i in x:\r\n for j in y:\r\n for k in z:\r\n ans[i*100+j*10+k] = True\r\nans = [True]\r\nfor i in range(1000):\r\n ans.append(False)\r\n \r\nn = int(input())\r\na = []\r\nfor i in range(n):\r\n a.append([])\r\n s = str(input()).split()\r\n for j in range(6):\r\n a[i].append(int(s[j]))\r\n\r\nfor i in range(n):\r\n for j in range(6):\r\n ans[a[i][j]] = True\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n if i != j :\r\n f(a[i],a[j])\r\n\r\nfor i in range(n):\r\n for j in range(n):\r\n for k in range(n):\r\n if (i-j)*(j-k)*(k-i) != 0:\r\n g(a[i],a[j],a[k])\r\n\r\n\r\nfor i in range(len(ans)):\r\n if not ans[i] :\r\n print(i-1)\r\n break\r\n\r\n\r\n\r\n", "cubes = [input().split() for _ in range(int(input()))]\n\ndef canMake(s):\n if len(s) == 1:\n for cube in cubes:\n if s in cube:\n return True\n return False\n elif len(s) == 2:\n for i, cube1 in enumerate(cubes):\n if s[0] in cube1:\n for j, cube2 in enumerate(cubes):\n if i != j and s[1] in cube2:\n return True\n return False\n elif len(s) == 3:\n for i, cube1 in enumerate(cubes):\n if s[0] in cube1:\n for j, cube2 in enumerate(cubes):\n if i != j and s[1] in cube2:\n for k, cube3 in enumerate(cubes):\n if i != k and j != k and s[2] in cube3:\n return True\n return False\n\nif not canMake(\"1\"):\n print(0)\nelse:\n for i in range(1, 1000):\n if not canMake(str(i)):\n print(i - 1)\n break", "import itertools\ndef possible(cubes, n):\n\ts = str(n)\n\tif (len(cubes) < len(s)):\n\t\treturn False\n\tfor p in itertools.permutations(range(len(cubes))):\n\t\tok = True\n\t\tfor i in range(len(s)):\n\t\t\tif (int(s[i]) not in cubes[p[i]]):\n\t\t\t\tok = False\n\t\tif (ok):\n\t\t\treturn True\n\treturn False\n\nn = int(input())\ncubes = []\nfor i in range(n):\n\tcubes.append(list(map(int, input().split())))\nfor i in range(1, 1001):\n\tif (not possible(cubes, i)):\n\t\tprint (i - 1)\n\t\tbreak", "n=int(input())\nd=[[],[],[]]\nfor i in range(n):\n d[i]=input().split()\ncombine=d[0][:]+d[1][:]+d[2][:] \ncombine+=[ i+j for i in d[0] for j in d[1]+d[2] ] \ncombine+=[ i+j for i in d[1] for j in d[0]+d[2] ] \ncombine+=[ i+j for i in d[2] for j in d[0]+d[1] ] \ncombine+=[ i+j+k for i in d[1] for j in d[2] for k in d[0] ] \ncombine+=[ i+j+k for i in d[1] for j in d[0] for k in d[2] ] \ncombine+=[ i+j+k for i in d[2] for j in d[1] for k in d[0] ] \ncombine+=[ i+j+k for i in d[2] for j in d[0] for k in d[1] ] \ncombine+=[ i+j+k for i in d[0] for j in d[1] for k in d[2] ] \ncombine+=[ i+j+k for i in d[1] for j in d[0] for k in d[2] ] \nf=True\nnow=1\nwhile(f):\n if now==1:\n if str(now) not in combine:\n print('0')\n exit(0)\n if str(now) not in combine: #O(6*3 + 3*6*12 + 6*6^3)\n f=False\n print(now-1)\n else:\n now+=1\n\t \t \t \t\t \t\t \t\t \t \t\t \t\t \t\t", "n = int(input())\r\ncubes = list()\r\nS = set()\r\nfor i in range(n):\r\n cubes.append(set(input().split()))\r\n S |= set(cubes[-1])\r\n\r\nc = 0\r\nwhile True:\r\n c += 1\r\n s = str(c)\r\n if len(s) > n:\r\n print(c - 1)\r\n break\r\n elif len(s) == 1:\r\n if s not in S:\r\n print(c - 1)\r\n break\r\n elif len(s) == 2:\r\n if n == 3 and not (s[0] in cubes[0] and s[1] in cubes[1] or \\\r\n s[0] in cubes[0] and s[1] in cubes[2] or \\\r\n s[0] in cubes[1] and s[1] in cubes[0] or \\\r\n s[0] in cubes[1] and s[1] in cubes[2] or \\\r\n s[0] in cubes[2] and s[1] in cubes[0] or \\\r\n s[0] in cubes[2] and s[1] in cubes[1]):\r\n print(c - 1)\r\n break\r\n elif n == 2 and not (s[0] in cubes[0] and s[1] in cubes[1] or s[0] in cubes[1] and s[1] in cubes[0]):\r\n print(c - 1)\r\n break\r\n elif len(s) == 3:\r\n if not (s[0] in cubes[0] and s[1] in cubes[1] and s[2] in cubes[2] or \\\r\n s[0] in cubes[0] and s[1] in cubes[2] and s[2] in cubes[1] or \\\r\n s[0] in cubes[1] and s[1] in cubes[0] and s[2] in cubes[2] or \\\r\n s[0] in cubes[1] and s[1] in cubes[2] and s[2] in cubes[0] or \\\r\n s[0] in cubes[2] and s[1] in cubes[0] and s[2] in cubes[1] or \\\r\n s[0] in cubes[2] and s[1] in cubes[1] and s[2] in cubes[0]):\r\n print(c - 1)\r\n break\r\n", "n = int(input())\r\n\r\nmatrix = []\r\nfor i in range(n):\r\n matrix.append(list(input().split()))\r\nfor i in range(1, 1000):\r\n mas = []\r\n mas2 = []\r\n for j in str(i):\r\n count = 0\r\n for k in range(len(matrix)):\r\n if j in matrix[k]:\r\n count += 1\r\n mas2.append(k)\r\n mas.append(count)\r\n mas.sort()\r\n if str(i).count(str(i)[0]) > 1:\r\n for j in range(len(mas)):\r\n if mas[j] < j+1:\r\n print(i - 1)\r\n exit()\r\n elif 0 in mas:\r\n print(i - 1)\r\n exit()\r\n if mas.count(1) == 2 and mas2[0] == mas2[1]:\r\n print(i - 1)\r\n exit()", "from itertools import permutations as p\r\na=int(input())\r\ng,h,k=\"\",\"\",\"\"\r\nif a>=1:g=input()\r\nif a>=2:h=input()\r\nif a>=3:k=input()\r\nz=[0]*1001\r\nfor i in range(1,1001):\r\n r=str(i)\r\n s=list(p(list(r),len(r)))\r\n if len(r)==1:\r\n if r in (g+h+k):z[i]+=1\r\n elif len(r)==2:\r\n ok=0\r\n for t in s:\r\n if (t[0] in g and t[1] in h) or (t[0] in g and t[1] in k) or (t[0] in k and t[1] in h):ok=1\r\n if ok:\r\n for t in s:\r\n y=int(''.join(t))\r\n z[y]+=1\r\n else:\r\n ok=0\r\n for t in s:\r\n if t[0] in g and t[1] in h and t[2] in k:ok=1\r\n if ok:\r\n for t in s:\r\n y = int(''.join(t))\r\n z[y] += 1\r\nfor i in range(1,1001):\r\n if z[i]==0:print(i-1);break\r\n", "def is_possible1(i, cubes):\n for cube in cubes:\n for c in cube:\n if int(c) == i:\n return True\n return False\n\ndef is_possible2(i, cubes):\n if len(cubes) < 2: return False\n for j, cube in enumerate(cubes):\n if str(i)[0] in cube:\n for k, cube2 in enumerate(cubes):\n if j != k and str(i)[1] in cube2:\n return True\n return False\n\ndef is_possible3(i, cubes):\n if len(cubes) < 3: return False\n for j, cube in enumerate(cubes):\n if str(i)[0] in cube:\n for k, cube2 in enumerate(cubes):\n if j != k and str(i)[1] in cube2:\n for l, cube3 in enumerate(cubes):\n if l != j and l != k and j != k and str(i)[2] in cube3: return True\n return False\n\n\ndef is_possible(i, cubes):\n if len(str(i)) == 1: return is_possible1(i, cubes)\n if len(str(i)) == 2: return is_possible2(i, cubes)\n if len(str(i)) == 3: return is_possible3(i, cubes)\n\n\nn = int(input())\n\ncubes = []\nfor i in range(n):\n cubes.append(input().split())\n\nflat_cubes = [c for cube in cubes for c in cube]\nif '1' not in flat_cubes:\n print(0)\nelse:\n i = 1\n while is_possible(i, cubes):\n i += 1\n print(i-1)\n\n \t \t\t \t\t \t \t\t\t \t \t\t\t\t\t\t\t\t\t" ]

[ "def main():\r\n n = int(input())\r\n ori_a = [int(x) for x in input().split()]\r\n pos = {ori_a[i]: i for i in range(len(ori_a))}\r\n seg = [dict(left=None, right=None) for i in range(len(ori_a))]\r\n \r\n a = sorted(ori_a)\r\n seg_size = 0\r\n seg_num = 0\r\n fi_k = a[0]\r\n fi_seg_num = 0\r\n for n_items, item in enumerate(a, 1):\r\n i = pos[item]\r\n seg[i][\"left\"], seg[i][\"right\"] = i, i\r\n seg_num += 1\r\n size = seg[i][\"right\"] - seg[i][\"left\"] + 1\r\n if size > seg_size:\r\n seg_size = size\r\n \r\n li = pos[item] - 1\r\n if 0 <= li:\r\n if seg[li][\"right\"] == i - 1:\r\n seg[i][\"left\"] = seg[li][\"left\"]\r\n seg[li][\"right\"] = seg[i][\"left\"]\r\n seg_num -= 1\r\n size = seg[i][\"right\"] - seg[i][\"left\"] + 1\r\n if size > seg_size:\r\n seg_size = size\r\n \r\n ri = pos[item] + 1\r\n if ri < n:\r\n if seg[ri][\"left\"] == i + 1:\r\n seg[i][\"right\"] = seg[ri][\"right\"]\r\n seg[ri][\"left\"] = seg[i][\"left\"]\r\n seg_num -= 1\r\n size = seg[i][\"right\"] - seg[i][\"left\"] + 1\r\n if size > seg_size:\r\n seg_size = size\r\n \r\n if seg_size * seg_num == n_items and seg_num > fi_seg_num:\r\n fi_seg_num = seg_num\r\n fi_k = item + 1\r\n \r\n print(fi_k)\r\n \r\n \r\nif __name__ == '__main__':\r\n main()", "class UnionFind():\r\n def __init__(self, n):\r\n self.n = n\r\n self.parents = [-1] * (n)\r\n\r\n def find(self, x):\r\n if self.parents[x] < 0:\r\n return x\r\n else:\r\n self.parents[x] = self.find(self.parents[x])\r\n return self.parents[x]\r\n\r\n def union(self, x, y):\r\n x = self.find(x)\r\n y = self.find(y)\r\n\r\n if x == y:\r\n return\r\n\r\n if self.parents[x] > self.parents[y]:\r\n x, y = y, x\r\n\r\n self.parents[x] += self.parents[y]\r\n self.parents[y] = x\r\n\r\n def size(self, x):\r\n return -self.parents[self.find(x)]\r\n\r\n def same(self, x, y):\r\n return self.find(x) == self.find(y)\r\n\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\nb = [(a[i], i) for i in range(n)]\r\nb.sort(key=lambda x: x[0])\r\ngroup_cnt = [0]*(n + 1)\r\nans = 0\r\nuf = UnionFind(n)\r\nsegment_count = 0\r\nfor add_count,(value, index) in enumerate(b):\r\n group_cnt[1] += 1\r\n if index > 0:\r\n if a[index - 1] < value:\r\n if uf.same(index - 1, index) == False:\r\n size_l, size_r = uf.size(index - 1), uf.size(index)\r\n group_cnt[size_l] -= 1\r\n group_cnt[size_r] -= 1\r\n\r\n uf.union(index-1, index)\r\n size_new = uf.size(index)\r\n group_cnt[size_new] += 1\r\n\r\n if index < n - 1:\r\n if a[index + 1] < value:\r\n if uf.same(index, index + 1) == False:\r\n size_l, size_r = uf.size(index), uf.size(index + 1)\r\n group_cnt[size_l] -= 1\r\n group_cnt[size_r] -= 1\r\n uf.union(index, index + 1)\r\n size_new = uf.size(index)\r\n group_cnt[size_new] += 1\r\n\r\n size_new = uf.size(index)\r\n #print(group_cnt[size_new],size_new,add_count + 1,value)\r\n if group_cnt[size_new]*size_new == add_count + 1:\r\n if segment_count < group_cnt[size_new]:\r\n ans = value + 1\r\n segment_count = group_cnt[size_new]\r\n\r\nprint(ans)\r\n\r\n", "import sys\r\ninput = sys.stdin.buffer.readline \r\n\r\ndef process(A):\r\n n = len(A)\r\n A2 = sorted(A)\r\n inverse = {}\r\n cell_sizes = [0 for i in range(n+3)]\r\n cell_size_count = 0\r\n left_borders = [0 for i in range(n+3)]\r\n right_borders = [0 for i in range(n+3)]\r\n answer = [0, None]\r\n for i in range(n):\r\n ai = A2[i]\r\n inverse[ai] = [None, i+1]\r\n for i in range(n):\r\n ai = A[i]\r\n inverse[ai][0] = i+1\r\n #for each element, inverse = \r\n #index in unsorted, index = sorted\r\n for i in range(n):\r\n ai = A2[i]\r\n I = inverse[ai][0]\r\n size1 = left_borders[I]\r\n #size of the cell that ai has to the left, if any\r\n size2 = right_borders[I]\r\n #size of the cell that ai has to the right, if any\r\n new_size = size1+size2+1\r\n #size of the new cell ai will form\r\n cell_sizes[size1]-=1\r\n if cell_sizes[size1]==0:\r\n cell_size_count-=1\r\n cell_sizes[size2]-=1\r\n if cell_sizes[size2]==0:\r\n cell_size_count-=1\r\n cell_sizes[new_size]+=1\r\n if cell_sizes[new_size]==1:\r\n cell_size_count+=1\r\n left_borders[I] = 0\r\n right_borders[I] = 0\r\n right_borders[I+size1+1] = new_size\r\n left_borders[I-size2-1] = new_size\r\n if cell_size_count==1:\r\n if cell_sizes[new_size] > answer[0]:\r\n answer = [cell_sizes[new_size], ai+1]\r\n return answer[1]\r\n\r\nn = int(input())\r\nA = [int(x) for x in input().split()]\r\nprint(process(A))\r\n ", "class Union:\n def __init__(self, n):\n self.p = {i:i for i in range(n)}\n self.rank = {i:1 for i in range(n)} \n \n def find(self, x):\n if x < 0: return x\n \n if self.p[x] != x:\n self.p[x] = self.find(self.p[x])\n \n return self.p[x]\n \n def union(self, x, y):\n if x < 0 or y < 0:return\n \n x = self.find(x)\n y = self.find(y)\n \n if x != y:\n if self.rank[x] < self.rank[y]:\n self.p[x] = y\n self.rank[y] += self.rank[x]\n else:\n self.p[y] = x\n self.rank[x] += self.rank[y]\n\ndef add(d, key, val):\n if key not in d:\n d[key] = 0\n d[key] += val \n \n if d[key] == 0:\n del d[key]\n \ndef update(i, used, d, u):\n used[i] = True\n add(d, 1, 1)\n \n if i - 1 >= 0 and used[i-1] == True:\n par_1 = u.find(i)\n par_2 = u.find(i-1)\n \n size_1 = u.rank[par_1]\n size_2 = u.rank[par_2]\n \n add(d, size_1, -1)\n add(d, size_2, -1)\n add(d, size_1+size_2, 1) \n \n u.union(par_1, par_2)\n \n if i + 1 < n and used[i+1] == True:\n par_1 = u.find(i)\n par_2 = u.find(i+1)\n \n size_1 = u.rank[par_1]\n size_2 = u.rank[par_2]\n \n add(d, size_1, -1)\n add(d, size_2, -1)\n add(d, size_1+size_2, 1)\n \n u.union(par_1, par_2) \n\nn = int(input())\na_ = list(map(int, input().split()))\na = [(i, x) for i, x in enumerate(a_)]\na = sorted(a, key=lambda x:x[1])\n\nu = Union(n)\nd = {}\nused = [False] * n\nans = -1\nmax_length = -1\n\nfor (index, val) in a:\n update(index, used, d, u)\n #print(d, val)\n \n if len(d) == 1:\n len_ = list(d.values())[0]\n \n if max_length < len_:\n max_length = len_\n ans = val+1\n \nprint(ans)\n\t\t\t \t\t \t \t\t\t\t\t\t\t \t \t\t\t \t\t", "BigNum = 10 ** 10\n\nn = int(input())\naa = [BigNum] + list(map(int, input().split(' '))) + [BigNum]\nappear = sorted([(v, i) for i, v in enumerate(aa)])\n\nans = -1\nmaxLocations = 0\n\nintervals = [(i, i) for i in range(len(aa))]\nlengths = {}\n\ndef incCount(val):\n global lengths\n lengths[val] = lengths.get(val, 0) + 1\n\ndef decCount(val):\n global lengths\n if lengths[val] == 1:\n del lengths[val]\n else:\n lengths[val] -= 1\n\ndef mergeIntervals(a, b):\n return (min(a[0], b[0]), max(a[1], b[1]))\n\n\nfor v, i in appear:\n if v == BigNum:\n continue\n \n inter = intervals[i]\n if aa[i - 1] < aa[i]:\n li = intervals[i - 1]\n decCount(li[1] - li[0] + 1)\n inter = mergeIntervals(li, inter)\n if aa[i] > aa[i + 1]:\n ri = intervals[i + 1]\n decCount(ri[1] - ri[0] + 1)\n inter = mergeIntervals(ri, inter)\n\n intervals[inter[0]] = inter\n intervals[inter[1]] = inter\n incCount(inter[1] - inter[0] + 1)\n\n if len(lengths) == 1:\n count = list(lengths.values())[0]\n if count > maxLocations:\n maxLocations = count\n ans = v + 1\n #print(v + 1, count)\n\nprint(ans)\n" ]

[ "import queue\r\nMAX = 500\r\ndr = [0,0,1,-1]\r\ndc = [1,-1,0,0]\r\n \r\ndef isValid(r, c):\r\n return r in range(m) and c in range(n)\r\n \r\ndef BFS(sr, sc, fr, fc):\r\n q = [0] * (MAX * MAX)\r\n left = right = 0\r\n q[0] = (sr, sc)\r\n while left <= right:\r\n ur, uc = q[left]\r\n left += 1\r\n for i in range(4):\r\n vr = ur + dr[i]\r\n vc = uc + dc[i]\r\n if isValid(vr, vc):\r\n if maze[vr][vc] == '.':\r\n maze[vr][vc] = 'X'\r\n right += 1\r\n q[right] = (vr,vc)\r\n else:\r\n if(vr == fr) and (vc==fc):\r\n return True\r\n return False\r\n \r\nif __name__ == '__main__':\r\n \r\n maze = [] * MAX\r\n m, n = map(int, input().split())\r\n \r\n for i in range(m):\r\n temp = list(input())\r\n maze.append(temp)\r\n start, start2 = map(int, input().split())\r\n end1, end2 = map(int, input().split())\r\n if(BFS(start-1,start2-1,end1-1,end2-1)):\r\n print('YES')\r\n else:\r\n print('NO')", "def BFS(ice_cave, start, end, n, m):\r\n queue = []\r\n start = (start[0] - 1, start[1] - 1)\r\n queue.append(start)\r\n x_ = [0, 0, 1, -1]\r\n y_ = [1, -1, 0, 0]\r\n while len(queue) != 0:\r\n front = queue.pop(0)\r\n for i in range(4):\r\n x = front[0] + x_[i]\r\n y = front[1] + y_[i]\r\n if x == end[0] - 1 and y == end[1] - 1 and ice_cave[x][y] == 'X': return True\r\n if x in range(n) and y in range(m) and ice_cave[x][y] == '.':\r\n ice_cave[x][y] = 'X'\r\n queue.append((x, y))\r\n return False\r\n \r\n \r\nn, m = map(int, input().split())\r\nice_cave = []\r\nfor i in range(n):\r\n t = list(input())\r\n ice_cave.append(t)\r\nstart = tuple(map(int, input().split()))\r\nend = tuple(map(int, input().split()))\r\nprint(\"YES\" if BFS(ice_cave, start, end, n, m) else \"NO\")\r\n\r\n ", "from collections import deque\r\n\r\nsRows = [0, 0, -1, 1]\r\nsCols = [-1, 1, 0, 0]\r\n\r\n\r\ndef solver():\r\n N, M = map(int, input().split())\r\n matrix = []\r\n for _ in range(N):\r\n matrix.append(list(input()))\r\n start_x, start_y = map(int, input().split())\r\n finish_x, finish_y = map(int, input().split())\r\n answer = bfs(start_x - 1, start_y - 1, finish_x - 1, finish_y - 1, matrix)\r\n if answer:\r\n print(\"YES\")\r\n else:\r\n print(\"NO\")\r\n\r\n\r\ndef bfs(start_x, start_y, finish_x, finish_y, matrix):\r\n frontier = deque()\r\n frontier.append((start_x, start_y))\r\n while frontier:\r\n N = len(matrix)\r\n M = len(matrix[0])\r\n v1 = frontier.popleft()\r\n for i in range(4):\r\n r = v1[0] + sRows[i]\r\n c = v1[1] + sCols[i]\r\n if r == finish_x and c == finish_y and matrix[r][c] == \"X\":\r\n return True\r\n if 0 <= r < N and 0 <= c < M and matrix[r][c] == \".\":\r\n matrix[r][c] = \"X\"\r\n frontier.append((r, c))\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n solver()\r\n", "from collections import deque\r\ndirections = ((1, 0), (0, 1), (-1, 0), (0, -1))\r\nn, m = map(int, input().split())\r\na = [list(input()) for _ in range(n)]\r\nsi, sj = map(lambda x:int(x)-1, input().split())\r\nti, tj = map(lambda x:int(x)-1, input().split())\r\n\r\ndef is_valid(i, j):\r\n return 0 <= i < n and 0 <= j < m\r\n\r\ndef check(i, j):\r\n r = 0\r\n for di, dj in directions:\r\n ni, nj = i + di, j + dj\r\n if is_valid(ni, nj) and a[ni][nj] != 'X' or (ni, nj) == (si, sj):\r\n r += 1\r\n return r\r\n\r\nif (si, sj) == (ti, tj):\r\n print('YES' if check(si, sj) >= 1 else 'NO')\r\n exit()\r\n\r\nc = a[ti][tj]\r\na[ti][tj] = '.'\r\nvis, q = set(), deque()\r\nvis.add((si, sj))\r\nq.append((si, sj))\r\nwhile q:\r\n i, j = q.popleft()\r\n for di, dj in directions:\r\n ni, nj = i + di, j + dj\r\n if is_valid(ni, nj) and a[ni][nj] != 'X' and (ni, nj) not in vis:\r\n vis.add((ni, nj))\r\n q.append((ni, nj))\r\nif (ti, tj) not in vis:\r\n print('NO')\r\nelif c == 'X':\r\n print('YES')\r\nelse:\r\n print('YES' if check(ti, tj) >= 2 else 'NO')\r\n", "from collections import deque\r\n\r\n\r\ndef BFS(arr, r1, c1, r2, c2):\r\n q = deque()\r\n q.append((r1, c1))\r\n arr[r1][c1] = 'X'\r\n while q:\r\n cur_r, cur_c = q.popleft()\r\n for dr, dc in [(1, 0), (-1, 0), (0, -1), (0, 1)]:\r\n nr = cur_r + dr\r\n nc = cur_c + dc\r\n if nr == r2 and nc == c2 and arr[nr][nc] == 'X':\r\n return True\r\n if 0 <= nr < rows and 0 <= nc < cols and arr[nr][nc] == '.':\r\n q.append((nr, nc))\r\n arr[nr][nc] = 'X'\r\n return False\r\n\r\n\r\nrows, cols = map(int, input().split())\r\narr = [[]] * rows\r\nfor i in range(rows):\r\n arr[i] = list(input())\r\n\r\nr1, c1 = map(int, input().split())\r\nr2, c2 = map(int, input().split())\r\n\r\nif BFS(arr, r1 - 1, c1 - 1, r2 - 1, c2 - 1):\r\n print(\"YES\")\r\nelse:\r\n print(\"NO\")\r\n", "\"\"\"\r\nLink:\r\nTime complexity: O(2 * n * m)\r\nSpace complexity: O(n * m)\r\n\"\"\"\r\n\r\nfrom queue import Queue\r\n\r\ndirections = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\n\r\n\r\ndef bfs(start_r, start_c, end_r, end_c, graph, n, m):\r\n q = Queue()\r\n q.put((start_r, start_c))\r\n while q.qsize() != 0:\r\n point = q.get()\r\n for direct in directions:\r\n next_r = point[0] + direct[0]\r\n next_c = point[1] + direct[1]\r\n if 0 > next_r or next_r >= n or next_c < 0 or next_c >= m:\r\n continue\r\n if graph[next_r][next_c] == 'X' and next_r == end_r and next_c == end_c:\r\n return True\r\n if graph[next_r][next_c] == '.':\r\n graph[next_r][next_c] = 'X'\r\n q.put((next_r, next_c))\r\n return False\r\n\r\n\r\nif __name__ == '__main__':\r\n n, m = map(int, input().split())\r\n graph = []\r\n for i in range(n):\r\n graph.append(list(input()))\r\n start_r, start_c = map(int, input().split())\r\n end_r, end_c = map(int, input().split())\r\n if bfs(start_r - 1, start_c - 1, end_r - 1, end_c - 1, graph, n, m):\r\n print('YES')\r\n else:\r\n print('NO')\r\n", "\r\n\r\nimport math\r\n\r\nimport os\r\nimport sys\r\nfrom io import BytesIO, IOBase\r\nfrom types import GeneratorType\r\nfrom collections import defaultdict\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\nsys.stdin, sys.stdout = IOWrapper(sys.stdin), IOWrapper(sys.stdout)\r\ninput = lambda: sys.stdin.readline().rstrip(\"\\r\\n\")\r\n#sys.setrecursionlimit(10**5)\r\n\r\n\r\ndef bootstrap(f, stack=[]):\r\n def wrappedfunc(*args, **kwargs):\r\n if stack:\r\n return f(*args, **kwargs)\r\n else:\r\n to = f(*args, **kwargs)\r\n while True:\r\n if type(to) is GeneratorType:\r\n stack.append(to)\r\n to = next(to)\r\n else:\r\n stack.pop()\r\n if not stack:\r\n break\r\n to = stack[-1].send(to)\r\n return to\r\n return wrappedfunc\r\n\r\n\r\ndef f(s):\r\n r=[]\r\n for j in s:\r\n r.append(j)\r\n return r\r\n\r\ndef valid(x):\r\n return True if 0<=x[0]<n and 0<=x[1]<m and inp[x[0]][x[1]]=='.' else False\r\n\r\ndef getn(x):\r\n toret=[]\r\n y=(x[0]-1,x[1])\r\n\r\n if valid(y):\r\n toret.append(y)\r\n y=(x[0]+1,x[1])\r\n if valid(y):\r\n toret.append(y)\r\n y=(x[0],x[1]-1)\r\n if valid(y):\r\n toret.append(y)\r\n y=(x[0],x[1]+1)\r\n if valid(y):\r\n toret.append(y)\r\n return toret\r\n\r\n\r\n\r\n\r\n\r\nn,m=[int(x) for x in input().split()]\r\ninp=[input() for i in range(n)]\r\nsource=[int(x)-1 for x in input().split()]\r\ndest=[int(x)-1 for x in input().split()]\r\n\r\n\r\nif source==dest:\r\n print('YES' if len(getn(dest)) else 'NO')\r\nelse:\r\n dat=False\r\n dis=0\r\n if inp[dest[0]][dest[1]]=='X':\r\n inp[dest[0]]=inp[dest[0]][:dest[1]]+'.'+inp[dest[0]][dest[1]+1:]\r\n dat=True\r\n if tuple(dest) in getn(source):\r\n dis=1\r\n vis=[[False]*m for i in range(n)]\r\n st=[source]\r\n while (st):\r\n x=st.pop()\r\n if vis[x[0]][x[1]]:\r\n continue\r\n vis[x[0]][x[1]]=True\r\n for i in getn(x):\r\n st.append(i)\r\n print('YES' if vis[dest[0]][dest[1]] and (len(getn(dest))>1-dis or dat) else 'NO')\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n", "# import queue\n# from collections import deque\n\n# # Take in input\n# MAX = 500 + 1\n# n, m = map(int, input().split())\n# graph = [[] for _ in range(n + 1)]\n# q = [[] for _ in range(MAX * MAX)]\n\n# for i in range(n):\n# temp = [*input()]\n# graph[i] = temp\n\n# start = tuple(map(lambda x: int(x) - 1, input().split()))\n# finish = tuple(map(lambda x: int(x) - 1, input().split()))\n\n# coordinate_row = [-1, 1, 0, 0]\n# coordinate_col = [0, 0, -1, 1]\n\n\n# def BFS(start=(), finish=()):\n# # TODO: Queue consume too much resource so to fit the time limit. implement it your self\n# left = right = 0\n# q[0] = (start[0], start[1])\n\n# while left <= right:\n# r, c = q[left]\n# graph[r][c] = 'X'\n# left += 1\n# for i in range(4):\n# u = r + coordinate_row[i]\n# v = c + coordinate_col[i]\n\n# # check is it inside the row and column\n# if not (u in range(n) and v in range(m)):\n# continue\n\n# # Make sure it will not move over X again\n# if graph[u][v] != 'X':\n# q[right] = (u, v)\n# right += 1\n# continue\n\n# if graph[u][v] == 'X' and (u, v) == finish:\n# return True\n\n# # The finish is == 'X' so can go through\n\n# return False\n\n\n# if BFS(start, finish):\n# print('YES')\n# else:\n# print('NO')\n\nfrom collections import deque\n\nMAX = 500 + 10\nn, m = map(int, input().split())\nmatrix = [[] for _ in range(MAX)]\n \ndr = [-1, 1, 0, 0]\ndc = [0, 0, -1, 1]\n\n\ndef bfs(sr, sc, fr, fc):\n q = deque()\n q.append((sr, sc))\n\n while q:\n r, c = q.popleft()\n \n for i in range(len(dc)):\n u = dr[i] + r\n v = dc[i] + c\n \n if not (v in range(m) and u in range(n)):\n continue\n\n if matrix[u][v] == \".\":\n matrix[u][v] = \"X\"\n q.append((u, v))\n continue\n \n \n if u == fr and v == fc and matrix[u][v] == \"X\":\n return True\n \n return False\n\nfor i in range(n):\n matrix[i] = list(input())\n\nsr, sc = map(int, input().split())\nfr, fc = map(int, input().split())\n\nans = bfs(sr - 1, sc - 1, fr - 1, fc - 1)\n\nif ans:\n print(\"YES\")\nelse:\n print(\"NO\")\n\t \t \t\t \t\t\t\t\t \t \t\t \t \t", "n, m = map(int, input().split())\r\n\r\ncave = []\r\nfor _ in range(n):\r\n cave.append([c for c in input().strip()])\r\n\r\nstart_x, start_y = map(int, input().split())\r\ndest_x, dest_y = map(int, input().split())\r\n\r\nvisited = []\r\nfor _ in range(n):\r\n visited.append([0] * m)\r\n\r\ndx = [0, 0, -1, 1]\r\ndy = [-1, 1, 0, 0]\r\n\r\nqueue = []\r\nqueue.append([start_x-1, start_y-1])\r\n\r\ndef can_reach_destination(dest_x, dest_y):\r\n while queue:\r\n x, y = queue.pop(0)\r\n\r\n for k in range(4):\r\n i = x + dx[k]\r\n j = y + dy[k]\r\n\r\n if 0 <= i < n and 0 <= j < m and not visited[i][j]:\r\n visited[i][j] = 1\r\n if i == dest_x and j == dest_y:\r\n if cave[dest_x][dest_y] == 'X':\r\n return \"YES\"\r\n else:\r\n cave[dest_x][dest_y] = 'X'\r\n visited[dest_x][dest_y] = 0\r\n else:\r\n if cave[i][j] == 'X':\r\n continue\r\n queue.append([i, j])\r\n\r\n return \"NO\"\r\n\r\nprint(can_reach_destination(dest_x - 1, dest_y - 1))# 1698403815.119092", "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 * m + v\r\n\r\ndef bfs(x, y):\r\n q, k = [f(x, y)], 0\r\n visit = [0] * (n * m)\r\n visit[f(x, y)] = 1\r\n while len(q) ^ k:\r\n x, y = divmod(q[k], m)\r\n for dx, dy in v:\r\n nx, ny = x + dx, y + dy\r\n if not 0 <= nx < n or not 0 <= ny < m:\r\n continue\r\n u = f(nx, ny)\r\n if not s[u] or visit[u]:\r\n continue\r\n visit[u] = 1\r\n q.append(u)\r\n k += 1\r\n return visit\r\n\r\nn, m = 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 & 2)\r\nr1, c1 = map(int, input().split())\r\nr2, c2 = map(int, input().split())\r\nr1, c1, r2, c2 = r1 - 1, c1 - 1, r2 - 1, c2 - 1\r\nv = [(1, 0), (-1, 0), (0, 1), (0, -1)]\r\nif abs(r1 - r2) + abs(c1 - c2) == 1:\r\n if not s[f(r2, c2)]:\r\n ans = \"YES\"\r\n else:\r\n ans = \"NO\"\r\n for dr, dc in v:\r\n nr, nc = r2 + dr, c2 + dc\r\n if 0 <= nr < n and 0 <= nc < m and s[f(nr, nc)]:\r\n ans = \"YES\"\r\n break\r\nelse:\r\n ok = 1\r\n if s[f(r2, c2)]:\r\n c = 0\r\n for dr, dc in v:\r\n nr, nc = r2 + dr, c2 + dc\r\n if 0 <= nr < n and 0 <= nc < m and s[f(nr, nc)]:\r\n c += 1\r\n if c < 2:\r\n ok = 0\r\n visit = bfs(r1, c1)\r\n if s[f(r2, c2)]:\r\n ans = \"YES\" if visit[f(r2, c2)] and ok else \"NO\"\r\n else:\r\n ans = \"NO\"\r\n for dr, dc in v:\r\n nr, nc = r2 + dr, c2 + dc\r\n if 0 <= nr < n and 0 <= nc < m and visit[f(nr, nc)]:\r\n ans = \"YES\"\r\n break\r\nprint(ans)" ]

[ "def solve (n,seq) :\r\n seq.sort()\r\n start = 1\r\n moves = 0\r\n while start <= n :\r\n if seq[start-1] != start :\r\n moves += abs(seq[start-1] - start)\r\n start += 1\r\n \r\n \r\n return moves\r\n \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\r\n \r\n\r\n\r\n \r\n ", "n = int(input())\nlista = [int(item) for item in input().split()]\nlista.sort()\ncount = 0\nfor i in range(n):\n count += abs(lista[i]-(i+1))\nprint(count)\n\n\n\t\t\t\t\t \t \t \t \t \t \t \t \t\t \t\t\t", "n_elem = int(input())\r\nnumbers = [int(n) for n in input().split()]\r\n\r\nnumbers.sort()\r\n\r\nmoves = 0\r\nfor x in range(0, n_elem) :\r\n moves += abs((x+1)-numbers[x])\r\n \r\nprint(moves)", "n = int(input())\r\nv = sorted([int(x) for x in input().split()])\r\nprint(sum([abs(v[i] - i - 1) for i in range(n)]))", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\ncount=0\r\np=[i for i in range(1,n+1)]\r\nfor i in range(n):\r\n count+=abs(p[i]-l[i])\r\nprint(count)", "import sys\r\n\r\ntry:\r\n sys.stdin = open('input.txt', 'r')\r\n sys.stdout = open('output.txt', 'w')\r\nexcept:\r\n pass\r\n\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nstart = 1\r\nans = 0\r\nfor el in a:\r\n ans += abs(el-start)\r\n start += 1\r\n\r\nprint(ans)\r\n\r\n", "n = int(input())\r\nl = list(map(int, input().split()))\r\nl.sort()\r\nres = 0\r\nfor i in range(1, n + 1):\r\n res += abs(i - l[i-1])\r\nprint(res)\r\n\r\n ", "n=int(input())\nl=list(map(int,input().split()))\nl.sort()\ncount=0\nfor i in range(1,n+1):\n\tcount+=(abs(l[i-1]-i))\nprint (count)", "N = int(input())\n\nA = [int(x) for x in input().split()]\n\nA.sort()\nB = [int(x) for x in range(1, N + 1)]\ns = 0\nfor i in range(N):\n s += abs(A[i] - B[i])\n\n\nprint(int(s))\n\n\t\t\t \t \t \t\t\t\t\t \t \t\t \t \t \t", "n=int(input())\r\na_lst=list(range(1,n+1))\r\nlst=sorted(map(int,input().split()))\r\nsteps=0\r\nfor i in range(n):\r\n steps+=abs(i+1-lst[i])\r\nprint(steps)\r\n\r\n\r\n", "n = int(input())\r\nnums = sorted(list(map(int, input().split())))\r\ns = 0\r\nfor ind, num in enumerate(nums):\r\n s += abs(num - ind - 1)\r\nprint(s)\r\n", "n = int(input())\na = [int(i) for i in input().split()]\n\na.sort()\n\nprint(sum(abs(a[i] - (i + 1)) for i in range(n)))\n", "n=int(input())\r\nL=sorted([int(k) for k in input().split()])\r\nk=0\r\nfor j in range(n):\r\n k+=abs(L[j]-j-1)\r\nprint(k)\r\n", "def arr_inp():\r\n return [int(x) for x in input().split()]\r\n\r\n\r\ndef fun(x):\r\n global c\r\n c += 1\r\n return abs(x - c)\r\n\r\n\r\nfrom math import *\r\n\r\nn, a, c = int(input()), sorted(arr_inp()), 0\r\nprint(sum(map(fun, a)))\r\n", "n=int(input())\nlis=list(map(int,input().split()))\nlis.sort()\n# 5 7 10 10 12 22\n# 0 1 2 3 4 5\nsum=0\nfor i in range(n):\n sum+=abs(lis[i]-(i+1))\n\nprint(sum)\n\n\n\n\t \t \t \t\t\t \t \t\t \t\t \t\t \t", "# cook your dish here\r\n\r\n\r\n\r\n\r\n\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nc = 1\r\nsu = 0\r\nfor i in range(n):\r\n su += abs(l[i]-c)\r\n c += 1\r\nprint(su)", "n = int(input())\r\nl = list(map(int, input().split(\" \")))\r\nl.sort()\r\nc = 0\r\nfor i in range(n):\r\n c += abs(l[i] - i - 1)\r\nprint(c)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\na.sort()\r\n\r\nans = 0\r\n\r\nfor i in range(1,n+1):\r\n ans+= abs(a[i-1]-i)\r\n\r\nprint(ans)\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(n):\r\n c=c+abs(i+1-a[i])\r\nprint(c)", "def solve(n, ll):\r\n ll.sort()\r\n x = 1\r\n res = 0\r\n for i in ll:\r\n res += abs(i - x)\r\n x += 1\r\n return res\r\n\r\n'''\r\nt = int(input())\r\nwhile t != 0:\r\n n = int(input())\r\n ll = list(map(int, input().split()))\r\n print(solve(n, ll))\r\n t -= 1\r\n'''\r\nn = int(input())\r\nll = list(map(int, input().split()))\r\nprint(solve(n, ll))", "n = int(input())\r\np = [int(x) for x in input().split(' ')]\r\np.sort()\r\n\r\nc = 0\r\nfor n, i in enumerate(p):\r\n c += abs(n-i+1)\r\n\r\nprint(c)", "'''input\n3\n-1 -1 2\n'''\nn = int(input())\na = sorted(map(int, input().split()))\nprint(sum([abs(x - a[x-1]) for x in range(1,n+1)]))", "def pro(arr):\r\n n=len(arr)\r\n arr.sort()\r\n ans=0\r\n for i in range(n):\r\n ans+=abs(i+1 -arr[i])\r\n print(ans)\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\npro(arr)", "n = int(input())\na = list(map(int, input().split()))\na.sort()\n\nans = 0\n\nfor i in range(len(a)):\n ans += abs((i+1)-a[i])\n\nprint(ans)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(n):\r\n\tc+=max(a[i],i+1)-min(a[i],i+1)\r\nprint(c)\r\na.clear()", "n = int(input())\na = list(map(int,input().split()))\na.sort()\ncount = 0\nfor i in range(n):\n count += abs(i+1-a[i])\nprint(count)\n", "n=int(input())\r\na=list(map(int,input().strip().split(' ')))\r\na.sort()\r\ni=1 \r\nm=0\r\nfor x in a:\r\n m+=abs(x-i)\r\n i+=1 \r\nprint(m)", "import sys\n\nn = int(sys.stdin.readline())\narr = [int(x) for x in sys.stdin.readline().split()]\ncount = 0\nfor i, it in enumerate(sorted(arr)):\n count += abs(i + 1 - it)\nsys.stdout.write(str(count))", "# from math import sqrt\r\n# from math import sqrt\r\nfrom collections import Counter\r\n# from collections import deque\r\n# mod=1073741824\r\n# d=[0]*11\r\n# for i in range(1,11):\r\n# for j in range(i,11,i):\r\n# d[j]+=1\r\ndef solve():\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n count=0\r\n l.sort()\r\n for i in range(1,n+1):\r\n # print(l[i-1])\r\n count+=abs(l[i-1]-i)\r\n print(count)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__==\"__main__\":\r\n solve()\r\n\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr = sorted(arr)\r\nans = 0\r\nfor i in range(n):\r\n num = i + 1\r\n ans = ans + abs(arr[i] - num)\r\nprint(ans)\r\n \r\n", "for _ in range(1):\r\n n=int(input())\r\n h=list(map(int,input().split()))\r\n h.sort()\r\n s=0\r\n for i in range(n):\r\n s+=abs(i+1-h[i])\r\n print(s)\r\n ", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nlst = [x for x in range(1,n+1)]\r\ncount = 0\r\nfor i in range(n):\r\n count += abs(arr[i]-lst[i])\r\nprint(count)", "n=int(input())\r\nl=sorted((list(map(int,input().split()))))\r\ncount=0\r\nfor i in range(1,n+1):\r\n count+=abs(l[i-1]-i)\r\nprint(count)", "n = int(input())\r\narr = [int(x) for x in input().split(\" \")]\r\narr.sort()\r\n\r\nanswer = 0\r\n\r\nfor i in range(n):\r\n if arr[i] > i + 1:\r\n answer += arr[i] - i - 1\r\n else:\r\n answer += i + 1 - arr[i]\r\nprint(answer)\r\n", "n = int(input())\r\nl = sorted(list(map(int, input().split())))\r\nr = sum([abs(i-il) for i, il in zip(range(1, n+1), l)])\r\nprint(r)\r\n", "n = int(input())\r\nans = 0\r\nfor i,j in zip(sorted(map(int, input().split())), range(1,n+1)):\r\n ans += abs(j-i)\r\nprint(ans)", "''' بِسْمِ اللَّهِ الرَّحْمَٰنِ الرَّحِيمِ '''\r\n#codeforces285C\r\ngi = lambda : list(map(int,input().split()))\r\nn, = gi()\r\nl = sorted(gi())\r\nprint(sum([abs(k + 1 - l[k]) for k in range(n)]))", "n=int(input())\nseq=list(map(int,input().split()))\nseq.sort()\nmoves=0\nfor i in range(n):\n moves+=abs(seq[i]-i-1)\nprint(moves)\n\t\t\t\t \t\t \t \t\t \t \t\t \t\t\t \t \t", "import sys,os,io,time,copy,math\r\nfrom functools import lru_cache\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 main(): \r\n n=int(input())\r\n arr=list(map(int,input().split()))\r\n res=0\r\n arr.sort()\r\n for i in range(1,n+1):\r\n res+=abs(i-arr[i-1])\r\n print(res)\r\n\r\nmain()\r\n ", "n=int(input())\r\nlist1=list(map(int,input().split()))\r\nlist1.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=abs(list1[i]-i-1)\r\nprint(ans)", "total_number = int(input())\r\nlist_nums = sorted(map(int, input().split()))\r\nleast_actions = 0\r\nfor index, num in enumerate(list_nums, 1):\r\n if num == index:\r\n ()\r\n if num > index:\r\n least_actions = least_actions + (num - index)\r\n if index > num:\r\n least_actions = least_actions + (index - num)\r\nprint(least_actions)\r\n", "n = int(input())\r\nli = list(map(int,input().split()))\r\nli.sort()\r\nmin_changes = 0 \r\nn = 1\r\nfor i in range(len(li)):\r\n min_changes += abs(n - li[i])\r\n n+=1\r\nprint(min_changes)", "n = int(input())\r\n\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\ncount = 0\r\nfor i in range(n):\r\n count+= abs(a[i]-i-1)\r\n\r\nprint(count)", "input()\r\nk=0\r\nj=1\r\nfor i in sorted(map(int,input().split())):k+=abs(i-j);j+=1\r\nprint(k)", "n = int(input())\r\nseq = sorted(list(map(int, input().split())))\r\n\r\nres = 0\r\nfor i in range(n):\r\n res += abs(seq[i] - (i+1))\r\n\r\nprint(res)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nans=0\r\nl.sort()\r\nfor i in range(n-1,-1,-1):\r\n if(l[i]==i+1):\r\n continue\r\n else:\r\n ans+=abs(l[i]-i-1)\r\nprint(ans)", "a=int(input())\nb=[int(i) for i in input().split()]\nb.sort()\ns=0\nfor i,j in zip(b,range(1,a+1)):\n s+=abs(j-i)\nprint(s)\n\n \t \t\t \t\t \t\t \t \t\t\t\t\t\t\t\t\t \t\t\t\t", "#!/usr/bin/env python3\ndef get(f): return f(input().strip())\ndef gets(f): return [*map(f, input().split())]\n\n\nn = get(int)\nl = list[int]()\ns = {*range(1, n + 1)}\nfor a in gets(int):\n if 0 < a <= n and a in s:\n s.remove(a)\n else:\n l += [a]\nl.sort()\ns = sorted(s)\nt = 0\nfor a, b in zip(l, s):\n t += abs(a - b)\nprint(t)\n", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans = ans + abs(a[i] - i -1)\r\nprint(ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ncheck = [-1] * (n + 1)\r\ntemp = []\r\nfor i in range(n):\r\n if arr[i] < 1 or arr[i] > n:\r\n temp.append(arr[i])\r\n else:\r\n if check[arr[i]] == -1:\r\n check[arr[i]] = 1\r\n else:\r\n temp.append(arr[i])\r\nres = 0\r\npos = 0\r\nfor i in range(1, n + 1):\r\n if check[i] == -1:\r\n res += abs(temp[pos] - i)\r\n pos += 1\r\nprint(res)", "n = int(input())\r\nq = sorted(list(map(int, input().split())))\r\ntime = 0\r\nk = 1\r\nfor i in q:\r\n time += abs(k - i)\r\n k += 1\r\nprint(time)", "n, a = int(input()), sorted(map(int, input().split()))\nprint(sum(abs(a[j] - (j + 1)) for j in range(n)))", "def build_perm(n, arr):\r\n\tbase = list(range(1, n+1))\r\n\tcount = 0\r\n\tfor i in range(len(arr)):\r\n\t\tcount += abs(arr[i] - base[i])\r\n\tprint(count)\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\n\r\nbuild_perm(n, arr)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nr=[x for x in range(1,n+1)]\r\nsu=0\r\nfor j in range(n):\r\n su+=abs(r[j]-l[j])\r\nprint(su)\r\n", "n = int(input())\nintegers = [int(i) for i in input().split()]\nintegers = sorted(integers)\n\ntotal = 0\nfor i in range(n):\n total = total + abs(i - integers[i] + 1)\nprint(total)\n \t \t \t \t \t\t\t\t\t\t\t \t\t\t \t\t\t\t\t", "\r\nn=int(input())\r\n\r\nl1=list(map(int,input().split()))\r\n\r\nl1.sort()\r\n\r\nsum1=0\r\n\r\nfor i in range(len(l1)):\r\n\tsum1+=abs((i+1)-l1[i])\r\nprint(sum1)\r\n", "n = int(input())\r\n\r\naList = list(map(int, input().split()))\r\n\r\nstandard = [i for i in range(1, n+1)]\r\n\r\naList.sort()\r\n\r\ntotal = 0\r\nfor i in range(n):\r\n total += abs(standard[i] - aList[i])\r\nprint(total)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\ncnt = 0\r\n# print(lst)\r\nfor i in range(len(lst)):\r\n if lst[i] < i+1:\r\n cnt += abs((i+1) - lst[i])\r\n elif lst[i] > i+1:\r\n cnt += abs(lst[i] - (i+1))\r\nprint(cnt)", "import sys\nn = int(input())\na = sorted(list(map(int, sys.stdin.readline().split())))\nans = 0\nfor i in range(n):\n ans += abs(a[i]-i-1)\nprint(ans)\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nres=0;\r\nfor i in range(0,n):\r\n if a[i]!=i+1:\r\n res=res+abs(a[i]-(i+1))\r\nprint(res)", "# t = int(input())\nt = 1\n\nfrom math import log2,ceil,floor,gcd\n\n\n\ndef cp():\n n = int(input())\n lst = list(map(int,input().split()))\n y = [\n i+1 for i in range(n)\n ]\n lst.sort()\n count = 0\n for i in range(n):\n \n count += abs(lst[i]-y[i])\n print(count)\n\n\n\n\n\nfor _ in range(t):\n cp()\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\ncount=0\r\nfor i,j in enumerate(a):\r\n if j<=0:\r\n count+=1-j\r\n a[i]=1\r\n elif j>n:\r\n count+=j-n\r\n a[i]=n\r\nif list(set(a))==a:\r\n print(count)\r\nelse:\r\n for i,j in enumerate(a):\r\n count+=abs(i+1-j)\r\n print(count)", "def min_moves(n):\r\n k=0\r\n j=1\r\n l=[int(x) for x in input().split()]\r\n l.sort();\r\n for i in l:\r\n k+=abs(j-i)\r\n j+=1\r\n return k\r\n\r\n\r\nn=int(input())\r\nprint(min_moves(n))", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nl=0\r\nb = list(range(1,n+1))\r\nfor i in range(n):\r\n if a[i]<b[i]:\r\n l+=(b[i]-a[i])\r\n if a[i]>b[i]:\r\n l+=(a[i]-b[i])\r\nprint(l)", "import sys\r\nsys.setrecursionlimit(10000)\r\nn = int(input())\r\narr = [int(x) for x in sys.stdin.readline().strip().split()]\r\narr = sorted(arr)\r\nd = {}\r\ncount = 0\r\nfor i in range(0,n):\r\n\tcount+=abs(arr[i]-i-1)\r\nprint(count)\r\n\r\n", "# def binary_search1(arr, x):\r\n# low = 0\r\n# high = len(arr) - 1\r\n# mid = 0\r\n \r\n# while low <= high:\r\n \r\n# mid = (high + low) // 2\r\n \r\n# # If x is greater, ignore left half\r\n# if arr[mid] < x:\r\n# low = mid + 1\r\n \r\n# # If x is smaller, ignore right half\r\n# elif arr[mid] > x:\r\n# high = mid - 1\r\n \r\n# # means x is present at mid\r\n# else:\r\n# return True\r\n \r\n# # If we reach here, then the element was not present\r\n# return False\r\n\r\n# def binary_search(arr, x):\r\n# low = 0\r\n# high = len(arr) - 1\r\n# mid = 0\r\n \r\n# while low <= high:\r\n \r\n# mid = (high + low) // 2\r\n \r\n# # If x is greater, ignore left half\r\n# if arr[mid] < x:\r\n# low = mid + 1\r\n \r\n# # If x is smaller, ignore right half\r\n# elif arr[mid] > x:\r\n# high = mid - 1\r\n \r\n# # means x is present at mid\r\n# else:\r\n# return mid\r\n \r\n# # If we reach here, then the element was not present\r\n# return -1\r\n\r\n# t = int(input())\r\n# for i in range(t):\r\n# n = int(input())\r\n# a = list(map(int , input().split()))\r\n# b = list(map(int , input().split()))\r\n# a.sort()\r\n# b.sort()\r\n \r\n# # //removing the same elements\r\n# for j in list(a):\r\n# if binary_search1(b , j)==True:\r\n# var = binary_search(b , j)\r\n# # x[j] = 0\r\n# # y[var] = 0\r\n# a.remove(j)\r\n# b.remove(b[var])\r\n# # for j in range(n):\r\n# # if x[j]!=0:\r\n# # a.append(x[j])\r\n# # if y[j]!=0:\r\n# # b.append(y[j])\r\n \r\n# print(a, b)\r\n \r\n# c = []\r\n# d = []\r\n# ans = 0\r\n# for j in range(len(a)):\r\n# A = str(a[j])\r\n# B = str(b[j])\r\n# if len(A)!=1:\r\n# c.append(len(A))\r\n# ans+=1\r\n# else:\r\n# c.append(a[j])\r\n# if len(B)!=1:\r\n# d.append(len(B))\r\n# ans+=1\r\n# else:\r\n# d.append(b[j])\r\n\r\n# c.sort()\r\n# d.sort()\r\n# print(c , d)\r\n# for j in list(c):\r\n# if binary_search1(d , j)==True:\r\n# var1 = binary_search(d , j)\r\n# c.remove(j)\r\n# d.remove(d[var1])\r\n \r\n# # c.append(1)\r\n# # d.append(1)\r\n# # f1 = []\r\n# # f2 = []\r\n# var = 0\r\n# for j in range(len(c)):\r\n# if c[j]!=1:\r\n# var+=1\r\n# for j in range(len(d)):\r\n# if d[j]!=1:\r\n# var+=1\r\n# # f2.append(d[j])\r\n# # f1.sort()\r\n# # f2.sort()\r\n \r\n# # print(f1 , f2)\r\n# # var= 0\r\n# # for j in range(len(f1)):\r\n# # if f1[j]!=1:\r\n# # var+=1\r\n# # for j in range(len(f2)):\r\n# # if f2[j]!=1:\r\n# # var+=1\r\n# print(ans+var)\r\nn = int(input())\r\na = list(map(int , input().split()))\r\nans = 0\r\na.sort()\r\nfor j in range(n):\r\n if a[j] > j+1:\r\n ans += (a[j] - j-1)\r\n else:\r\n ans+= (j+1 - a[j])\r\nprint(ans)", "n = int(input())\r\na = [int(i) for i in input().split()]\r\n\r\na.sort()\r\nmoves = 0\r\nfor i in range(n):\r\n moves += abs((i + 1) - a[i])\r\nprint (moves)", "n = int(input())\nif n==1:\n arr = [int(input())]\nelse:\n arr = sorted(list(map(int, input().split())))\nmoves = 0\nfor i in range(n):\n moves += abs(i-arr[i]+1)\nprint(moves)\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\nE=0\r\n\r\nfor i in range(n):\r\n E+=abs(a[i]-i-1)\r\n \r\nprint(E)", "n = int(input())\nlst = [int(i) for i in input().split(' ')]\nlst.sort()\nans = 0\nfor i in range(n):\n ans += abs(i + 1 - lst[i])\nprint(ans)\n\n \t\t\t\t\t \t\t\t\t \t\t\t\t\t \t \t \t\t", "n = int(input())\nls = sorted(list(map(int,input().split())))\nans=0\nfor i in range(1,n+1):\n ans+= abs(i-ls[i-1])\nprint(ans) \n\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\nli = list(map(int, input().split()))\r\nans = 0\r\nli = sorted(li)\r\nfor i in range(n):\r\n ans += abs(li[i] - i - 1)\r\nprint(ans)", "kalanbaba = 1\nMOD = 10**9 + 7\nI = lambda:list(map(int,input().split()))\n\nn, = I()\nl = I()\nl.sort()\ncount = 0\nfor i in range(1,n+1):\n\tif l[i-1] != i:\n\t\t# print(i,l[i-1])\n\t\tcount += abs(i - l[i-1])\nprint(count)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\na.sort()\r\n\r\nminMoves = 0\r\n\r\nfor i in range(1, n+1):\r\n\tminMoves += abs(a[i-1] - i)\r\n\r\nprint(minMoves)", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(1,n+1):\r\n c+=abs(i-l[i-1])\r\nprint(c)", "from sys import stdin,stdout\r\nn=int(stdin.readline())\r\narr=list(map(int,stdin.readline().split()))\r\narr.sort()\r\ncount=0\r\nfor i in range(n):\r\n count+=max(arr[i],i+1)-min(arr[i],i+1)\r\nprint(count)", "n = int(input())\r\nlis = [int(x) for x in input().split()]\r\nref = list(range(1,n+1))\r\nlis.sort()\r\ncount = 0\r\nfor i in range(n):\r\n count += abs(lis[i] - ref[i])\r\nprint(count)\r\n", "def getPermutation(nums, length):\r\n nums.sort()\r\n res = 0\r\n for i in range(length):\r\n res += abs(nums[i] - i - 1)\r\n \r\n return res\r\n\r\n\r\nsize = int(input())\r\nnums = list(map(int, input().split(\" \")))\r\nprint(getPermutation(nums, size))\r\n", "import sys\n\ninput = sys.stdin.readline\n\nn = int(input())\na = sorted([int(i) for i in input().split()])\ncount = 0\nfor i in range(n):\n count += abs(i + 1 - a[i])\nprint(count)\n", "n=int(input())\r\nl=sorted(list(map(int, input().split())))\r\nx=0\r\nfor i in range(n):\r\n x+=abs(l[i]-i-1)\r\nprint(x) ", "n=int(input())\r\na=list(map(int,input().split()))\r\nres = [i for i in range(1,n+1)]\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n ans += abs(res[i]-a[i])\r\n \r\nprint(ans)", "import math\r\nn = int(input())\r\nA = [int(i) for i in input().split()]\r\nA.sort()\r\nsum = 0\r\nfor i in range(n):\r\n sum+=abs(A[i] - (i+1))\r\nprint(sum)\r\n \r\n", "\r\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 n = int(input())\r\n a= list(map(int, input().split()))\r\n \r\n a.sort()\r\n \r\n rst = 0\r\n for i in range(1, n+1, 1):\r\n rst += abs(a[i-1] - i) \r\n print(rst)", "n=int(input())\r\ns=sorted(list(map(int,input().split())))\r\nl=[i for i in range(1,n+1)]\r\nans=0\r\nfor i in range(n):\r\n ans+=abs(l[i]-s[i])\r\nprint(ans)", "N = int (input ())\nX = sorted (list (map (int, input ().split (' '))))\nA = 0\nS = 0\n\nwhile A != N:\n\n S += abs (X [A] - A - 1)\n A += 1\n\nprint (S)\n", "n = int(input()) \r\na = sorted([int(i) for i in input().split()]) \r\nans = 0\r\nfor i in range(n): ans += abs(a[i] - (i+1))\r\nprint(ans)", "n = int(input())\nvet = sorted(list(map(int, input().split())))\naux, res = 0, 0\nfor index, i in enumerate(vet):\n aux = i - index - 1\n res+= abs(aux)\nprint(res)\n\n \t\t \t \t\t \t \t \t \t \t \t\t\t", "n = int(input())\r\nlst = [int(i) for i in input().split()]\r\nlst.sort()\r\ntotalMoves = 0\r\nfor i in range(1, len(lst) + 1):\r\n totalMoves += abs(i - lst[i - 1])\r\nprint(totalMoves)", "n = int(input())\na = list(map(int, __import__(\"sys\").stdin.readline().strip().split()))\n\nmoves = 0\na.sort()\nfor i, j in zip(range(1, len(a) + 1), a):\n moves += abs(j - i)\n\nprint(moves)\n", "n = int(input())\r\nlst1 = list(map(int,input().split()))\r\nlst1.sort()\r\nans = 0\r\nfor i in range(1,n+1):\r\n ans += abs(i-lst1[i-1])\r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\ns = 0\r\nfor i in range(n):\r\n s += abs((i+1)-a[i])\r\nprint(s)", "n=int(input())\r\nl=sorted(map(int,input().split()))\r\nans = 0\r\nfor i in range(n):ans+=abs(i+1-l[i])\r\nprint(ans)\t", "if __name__ == \"__main__\":\r\n n = int(input())\r\n lst = list(map(int, input().split()))\r\n lst.sort()\r\n target = 1\r\n i = 0\r\n step = 0\r\n while target <= n:\r\n step += abs(lst[i] - target)\r\n i +=1\r\n target += 1 \r\n print(step)\r\n", "def main():\r\n input()\r\n ar = sorted(list(map(int, input().split())))\r\n ans = 0\r\n for i in range(len(ar)):\r\n ans += abs(i+1-ar[i])\r\n print(ans)\r\n\r\nmain()", "m=int(input())\nn=m\nr=map(int,input().split())\nf=list(r)\n#print(f)\nf.sort()\nq=f[::-1]\n#print(q)\nl=len(q)\ni=0\ncount=0\nwhile i<l:\n y=q[i]\n if y>n:\n w=y-n\n count=count+w\n elif y<n:\n w=n-y\n count=count+w\n n=n-1 \n i+=1\nprint(count)\n", "t=int(input())\r\n # n,a,b,c=map(int,input().split()) \r\n # s=input()\r\narr=list(map(int,input().split()))\r\n # s=list(map(int,input()))\r\n # mat=[input() for i in range(4)]\r\nval=[i for i in range(1,t+1)]\r\narr.sort()\r\nsum=0\r\nfor i in range(t):\r\n sum+=abs(arr[i]-val[i])\r\nprint(sum)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort() # Sort the sequence in ascending order\r\nmoves = 0\r\n\r\nfor i in range(n):\r\n moves += abs(a[i] - (i + 1)) # Calculate the absolute difference between element and position\r\n\r\nprint(moves)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\n\r\nl.sort()\r\nr=[]\r\ns=0\r\nfor i in range(0,n):\r\n r.append(i+1)\r\nfor i in range(n):\r\n s+=abs(l[i]-r[i])\r\nprint(s)", "n = int(input())\r\na = sorted([*map(int, input().split())])\r\nprint(sum([abs(a[i] - i - 1) for i in range(n)]))\r\n\r\n", "n=int(input())\r\nsum=0\r\na=list(map(int,input().split(\" \")))\r\na.sort()\r\nfor i in range(n):\r\n sum+=abs(a[i]-i-1)\r\nprint(sum)", "input()\r\na = list(map(int, input().split()))\r\na.sort()\r\nsum = 0\r\nfor i in range(len(a)):\r\n sum += abs(max(i+1, a[i]) - min(i+1, a[i]))\r\nprint(sum)\r\n", "n = int(input())\na = sorted(map(int, input().split()))\nprint(sum(abs(i-x) for i, x in enumerate(a, 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\narr = list(map(int, input().split()))\r\narr.sort()\r\nres, curr = 0, max(1, arr[0])\r\nfor i in arr:\r\n res += abs(i-curr)\r\n curr += 1\r\nprint(res)\r\n", "n = int(input())\r\na = sorted([int(k) for k in input().split()])\r\nhod = 0\r\nfor i in range(n):\r\n hod += abs((i + 1) - a[i])\r\nprint(hod)\r\n", "n = int(input())\r\na = list(map(int, input().split()[:n]))\r\na.sort()\r\nmoves = 0\r\nfor i in range(n):\r\n moves += abs(i+1-a[i])\r\nprint(moves)", "n = int(input())\r\nl = sorted(list(map(int,input().strip().split())))\r\nd = [x for x in range(1,n+1)]\r\nret = 0\r\nfor i in range(n):\r\n ret += abs(l[i]-d[i])\r\nprint(ret)", "from collections import Counter,defaultdict\r\nfrom sys import stdin, stdout\r\ninput = stdin.readline\r\nI =lambda:int(input())\r\nM =lambda:map(int,input().split())\r\nLI=lambda:list(map(int,input().split()))\r\nn=I()\r\na=LI()\r\nd=Counter(a)\r\nb=[];e=defaultdict(int)\r\nfor i in d.keys():\r\n if i>0 and i<=n:\r\n b+=[i]*(d[i]-1)\r\n e[i]=1\r\n else:\r\n b+=[i]*d[i]\r\nb.sort()\r\nc=[]\r\nfor i in range(1,n+1):\r\n if e[i]!=1:\r\n c+=[i]\r\nans=0\r\nfor i in range(len(c)):\r\n ans+=abs(b[i]-c[i])\r\nprint(ans)", "n = int(input())\r\nl = list(map(int, input().split()))\r\nc = 0\r\nl.sort()\r\nfor i in range(n):\r\n c += abs((i+1) - l[i])\r\nprint(c)\r\n", "n, a = int(input()), sorted(map(int, input().split()))\nprint(sum((abs(n + 1 - ai) for n, ai in enumerate(a))))\n", "n=int(input())\r\nc=0\r\nl=sorted(list(map(int,input().split())))\r\nfor i in range(n):\r\n c=c+abs(l[i]-(i+1))\r\nprint(c)\r\n ", "n=int(input())\r\nl=[int(y) for y in input().split()]\r\nl.sort()\r\nans=0\r\nc=1\r\nfor i in range(n):\r\n ans+=abs(c-l[i])\r\n c+=1 \r\nprint(ans)", "n = int(input())\r\na = list(map(int,input().split()))\r\nL = []\r\nfor i in range (1,n+1):\r\n L.append(i)\r\n\r\nb = sorted(a)\r\ndiff = []\r\n\r\n\r\nzip_object = zip(L,b)\r\n\r\nfor L_i, b_i in zip_object:\r\n diff.append(abs(L_i - b_i))\r\n\r\nprint(sum(diff))", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nj=[i+1 for i in range(n)]\r\ns=0\r\nfor i in range(n):\r\n\ts=s+(abs(l[i]-j[i]))\r\nprint(s)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nb=[i for i in range(1,n+1)]\r\nsum=0\r\nfor i in range(len(a)):\r\n\tsum+=abs(a[i]-b[i])\r\nprint(sum)", "n = int(input())\na = sorted([int(i) for i in input().split()])\n\ncount = 0\nfor i in range(n):\n count += abs(a[i] - (i + 1))\n\nprint(count)\n \t\t\t \t \t \t\t \t \t \t\t\t \t\t", "def Building_Permutation():\r\n n = int(input())\r\n sequence = [int(x) for x in input().split(' ')]\r\n sequence_sorted = sorted(sequence) #in ideal case this should be 1,2,3,4,5,....,n\r\n #the minimum number of steps required would be when sequence_sorted[i] is made integer i, closest distance\r\n actual_seq = [x for x in range(1,n+1)]\r\n \r\n dist = 0\r\n for index in range(len(sequence_sorted)):\r\n dist += abs(sequence_sorted[index] - actual_seq[index])\r\n print(dist)\r\n\r\n return\r\n\r\n\r\n \r\nBuilding_Permutation()", "input()\r\nprint(sum(abs(i-a) for i, a in enumerate(sorted(map(int, input().split())), 1)))", "from math import fabs\r\n\r\nn=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\n\r\nctr = 0\r\n\r\nfor i in range(1,n+1):\r\n\tctr+=abs(a[i-1] - i)\r\n\r\nprint(ctr)", "n = int(input())\narr = list(map(int,input().split()))\narr.sort()\nans = 0\nfor i in range(n):\n ans+=abs(arr[i]-(i+1))\nprint (ans)\n", "n = int(input())\n\nnums = [int(x) for x in input().split()]\nnums.sort()\n\ndiff = 0\n\nfor i in range(1,n + 1):\n diff += abs(nums[i-1] - i)\n\nprint(diff)\n \t \t\t \t \t \t \t\t\t \t \t\t\t", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ns=0\r\nfor i in range(n):\r\n s+=abs(arr[i]-i-1) \r\nprint(s)", "# Description of the problem can be found at http://codeforces.com/problemset/problem/285/C\r\n\r\nn = int(input())\r\nl_i = list(map(int, input().split()))\r\nl_i.sort()\r\n\r\nc = 1\r\nt = 0\r\nfor i in l_i:\r\n t += abs(c - i)\r\n c += 1\r\nprint(t)\r\n ", "n=int(input())\r\nlst=list(map(int,input().split()))\r\nl=[]\r\nfor i in range(n):\r\n l.append(i+1)\r\nlst.sort()\r\ncount=0\r\nfor i in range(len(l)):\r\n count+=abs(l[i]-lst[i])\r\nprint(count)\r\n \r\n \r\n \r\n \r\n\r\n \r\n ", "n = int(input())\r\na = [int(e) for e in input().split()]\r\n\r\na = sorted(a)\r\n_sum = 0\r\nfor i, num in enumerate(a):\r\n _sum += abs(i + 1 - num)\r\nprint(_sum)\r\n", "n = int(input().strip())\narr = list(map(int, input().strip().split()))\narr.sort()\nc = 0\nfor i in range(len(arr)):\n\tc += abs(arr[i]-(i+1))\nprint(c)", "def preprocessing(x):\r\n global maxSize\r\n global myCount\r\n if x == 0 :\r\n myCount += 1\r\n return 1\r\n elif x < 0 :\r\n myCount += abs(x)+1\r\n return 1\r\n elif x > maxSize:\r\n myCount += x - maxSize\r\n return maxSize\r\n return x\r\nmaxSize = int(input())\r\nmyCount = 0\r\nuser = list(map(lambda x: preprocessing(int(x)),input().split()))\r\nuser.sort()\r\nfor x in range(maxSize):\r\n myCount += abs(user[x] - (x + 1))\r\nprint (myCount)", "n = int(input())\narray = sorted(list(map(int, input().split())))\nperm = [x for x in range(1, n + 1)]\ncount = sum([abs(array[i] - perm[i]) for i in range(n)])\nprint(count)\n", "n= int(input())\r\na= list(map(int, input().split()))\r\na.sort()\r\ncount= 0\r\n\r\nfor i in range(n):\r\n count += abs(a[i]-(i+1))\r\nprint(count)", "def main():\n n = int(input())\n elems = list(sorted(map(int, input().split(\" \"))))\n result = 0\n i = 1\n for x in elems:\n result += abs(x - i) if x >= 1 else (abs(x) + i)\n i += 1\n\n print(result)\n\n \nif __name__ == \"__main__\":\n main()\n", "\r\n\"\"\"\r\nint(input())\r\nmap(int,input().split())\r\nlist(map(int,input().split()))\r\n\r\n\"\"\"\r\nn=int(input())\r\nA=list(map(int,input().split()))\r\nA.sort()\r\ns=0\r\nfor i in range(n):\r\n s=s+abs(i+1-A[i])\r\nprint(s)\r\n \r\n\r\n ", "n=int(input())\narr=list(map(int,input().split()))\nmyset=set(i for i in range(1,n+1))\nlst=[]\nfor val in arr:\n if val in myset:\n myset.discard(val)\n else:\n lst.append(val)\nlst1=sorted(list(myset))\nlst.sort()\nans=0\nfor i in range(len(lst1)):\n ans+=abs(lst1[i]-lst[i])\nprint(ans)", "n = int(input())\r\ncost = 0\r\nl = sorted([int(i) for i in input().split()])\r\nfor i in range(1,n+1):\r\n if(not l[i-1] is i):\r\n cost+=abs(l[i-1] - i)\r\n else:\r\n continue\r\nprint(cost)\r\n\r\n\r\n", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\ncnt=0\r\nfor i,val in enumerate(a):\r\n cnt+=abs((i+1)-val)\r\nprint(cnt)", "def main() :\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n arr.sort()\r\n s = 0\r\n for i,j in enumerate(arr,start=1) :\r\n s+= abs(i-j)\r\n print(s) \r\n \r\nmain()", "p_size = int(input())\n\nnumbers = map(int, input().split())\nnumbers = sorted(numbers)\n\ncont = 0\nfor i in range(p_size):\n cont = cont + abs(numbers[i]-i-1)\nprint(cont)\n \t\t \t\t \t\t\t\t\t\t\t \t \t\t\t \t\t", "import sys\r\nimport os\r\nimport collections\r\n\r\na = int(input())\r\nb = input()\r\nb= b.split()\r\nb = list(map(int,b))\r\nb.sort()\r\ns = 0\r\nindex = 1\r\nfor i in b:\r\n s+=abs(index-i)\r\n index+=1\r\nprint(s)\r\n \r\n\r\n\r\n\r\n", "n = int(input())\r\n\r\na = sorted(list(map(int, input().split())), reverse=True)\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n mn = n - i\r\n ans += abs(a[i] - mn)\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nmoves=0\r\nfor i in range(1,len(a)+1):\r\n moves+=abs(a[i-1]-i)\r\nprint(moves)", "lens = int(input())\r\ngiven = sorted([int(x) for x in input().split()])\r\nneeds = list(range(1, lens + 1))\r\nmoves = 0\r\n#print(given, needs)\r\nwhile given:\r\n moves += abs(given.pop() - needs.pop())\r\nprint(moves)\r\n", "n=int(input())\r\n\r\nl=list(map(int,input().split()))\r\n\r\nl.sort()\r\n\r\nc=0\r\nfor x in range(len(l)):\r\n c+=abs(l[x]-(x+1))\r\nprint(c)\r\n", "n = int(input())\nl = sorted([int(x) for x in input().split()])\nprint(sum(abs(a - (b + 1)) for a, b in zip(l, range(n))))\n", "def modulus(a):\r\n if(a<0):\r\n return -a\r\n else:\r\n return a\r\nn=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\n\r\nsum=0\r\nfor i in range(0,n):\r\n sum=sum+modulus(a[i]-(i+1))\r\nprint(sum)", "def main():\r\n n = int(input())\r\n a = sorted(list(map(int, input().split())))\r\n res = 0\r\n for i, val in enumerate(a):\r\n res += abs(val-(i+1))\r\n print(res)\r\n\r\nif __name__ == '__main__':\r\n main()\r\n", "if __name__ == '__main__':\n n = int(input())\n arr = list(map(int, input().split(' ')))\n\n arr.sort()\n amount = 0\n for i in range(1, n+1):\n amount += abs(i-arr[i-1])\n print(amount)\n\n \t\t \t\t \t\t\t\t \t\t \t\t\t \t \t \t\t", "n = int(input())\r\np = [int(_) for _ in input().split()]\r\n\r\np.sort()\r\nmoves = 0\r\n\r\nfor i in range(n):\r\n moves += abs(i + 1 - p[i])\r\n\r\nprint(moves)\r\n", "import string\n\nalphabet = list(string.ascii_lowercase)\ninf = 2**20\n\n\ndef print_sequence(s):\n print(*s, sep=' ')\n\n\ndef read_sequence():\n return list(map(int, input().split()))\n\n\ndef print_bool_result(res):\n if res:\n print('Yes')\n else:\n print('No')\n\nn = int(input())\nseq = sorted(read_sequence())\nresult = 0\nfor i in range(n):\n result += abs(seq[i] - i - 1)\nprint(result)\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\nmylist = [(i+1) for i in range(n)]\r\ncount = 0\r\nfor i in range(n):\r\n count += abs(mylist[i] - a[i])\r\nprint(count)", "n = int(input())\r\nl = [int(i) for i in input().split()]\r\nl.sort()\r\nt = 0\r\nfor i in range(1,n+1):\r\n\tt+=abs(l[i-1]-i)\r\nprint(t)\r\n", "#*****DO NOT COPY*****\r\n#F\r\n#U ___ ___ ___ ___ ___ ___ _____\r\n#C / /\\ ___ / /\\ ___ /__/\\ / /\\ / /\\ / /\\ / /::\\\r\n#K / /::\\ / /\\ / /:/_ / /\\ \\ \\:\\ / /::\\ / /::\\ / /:/_ / /:/\\:\\\r\n# / /:/\\:\\ / /:/ / /:/ /\\ / /::\\ \\ \\:\\ / /:/\\:\\ / /:/\\:\\ / /:/ /\\ / /:/ \\:\\\r\n#Y / /:/~/:/ /__/::\\ / /:/ /::\\ / /:/\\:\\ ___ \\ \\:\\ / /:/~/::\\ / /:/~/:/ / /:/ /:/_ /__/:/ \\__\\:|\r\n#O /__/:/ /:/ \\__\\/\\:\\__ /__/:/ /:/\\:\\ / /:/~/::\\ /__/\\ \\__\\:\\ /__/:/ /:/\\:\\ /__/:/ /:/___ /__/:/ /:/ /\\ \\ \\:\\ / /:/\r\n#U \\ \\:\\/:/ \\ \\:\\/\\ \\ \\:\\/:/~/:/ /__/:/ /:/\\:\\ \\ \\:\\ / /:/ \\ \\:\\/:/__\\/ \\ \\:\\/:::::/ \\ \\:\\/:/ /:/ \\ \\:\\ /:/\r\n# \\ \\::/ \\__\\::/ \\ \\::/ /:/ \\ \\:\\/:/__\\/ \\ \\:\\ /:/ \\ \\::/ \\ \\::/~~~~ \\ \\::/ /:/ \\ \\:\\/:/\r\n#A \\ \\:\\ /__/:/ \\__\\/ /:/ \\ \\::/ \\ \\:\\/:/ \\ \\:\\ \\ \\:\\ \\ \\:\\/:/ \\ \\::/\r\n#L \\ \\:\\ \\__\\/ /__/:/ \\__\\/ \\ \\::/ \\ \\:\\ \\ \\:\\ \\ \\::/ \\__\\/\r\n#L \\__\\/ \\__\\/ \\__\\/ \\__\\/ \\__\\/ \\__\\/\r\n#\r\n#\r\n#*****DO NOT COPY*****\r\ndef solve(n , arr):\r\n\r\n arr.sort()\r\n count = 0\r\n\r\n for i in range(n):\r\n count += abs(i + 1 - (arr[i]))\r\n\r\n return count\r\n\r\n\r\nn = int(input())\r\narr = list(map(int , input().split()))\r\nprint(solve(n , arr))", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nminsum=0\r\nfor i in range(n):\r\n minsum+=abs(i+1-a[i])\r\nprint(minsum)\r\n \r\n\r\n \r\n \r\n \r\n \r\n \r\n \r\n ", "n = int(input())\r\nA = [int(a) for a in input().split()]\r\nA.sort()\r\nans = 0\r\ncurr = 1\r\nfor i in range(n):\r\n if A[i] < curr:\r\n ans += abs(curr - A[i])\r\n A[i] = curr\r\n elif A[i] > curr:\r\n ans += abs(A[i] - curr)\r\n A[i] = curr\r\n curr += 1\r\nprint(ans)", "n=int(input())\r\nL=sorted(list(map(int,input().split())))\r\nmoves,start=0,1\r\nfor i in L:\r\n moves+=abs(i-start)\r\n start+=1\r\nprint(moves)\r\n ", "import sys\r\nlimit = int(sys.stdin.readline())\r\narr = sorted(list(map(int, sys.stdin.readline().split())), reverse=True)\r\ncnt = 0\r\n\r\nfor index, x in enumerate(range(limit)):\r\n if arr[x] < (limit - index):\r\n cnt += (limit - index) - arr[x]\r\n elif arr[x] > (limit - index):\r\n cnt += (arr[x] - (limit - index))\r\nsys.stdout.write(str(cnt))", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\n\r\nl = list(map(int,input().split()))\r\n\r\nl.sort()\r\n\r\ns = 0\r\n\r\nfor i in range(n):\r\n s += abs(l[i] - i - 1)\r\n \r\nprint(s)", "def min_moves():\r\n k,j=0,1\r\n for i in sorted(map(int,input().split())):\r\n k+=abs(i-j)\r\n j+=1\r\n return k\r\n\r\ninput()\r\nprint(min_moves())", "# http://codeforces.com/problemset/problem/285/C\n\ninput()\nk,j = 0,1\nfor i in sorted(map(int, input().split())):\n\tk+=abs(i-j)\n\tj+=1\n\nprint(k)\n", "input()\r\n\r\nrow = input().rstrip(\"\\n\")\r\narr = row.split(\" \")\r\narr = list(map(lambda x: int(x), arr))\r\narr.sort()\r\n\r\nans = 0\r\nfor i,v in enumerate(arr):\r\n\tif (i + 1) > v: ans += i + 1 - v\r\n\telif (i + 1) < v: ans += v - (i + 1)\r\nprint(ans)\r\n", "n = int(input())\nnums = sorted(map(int, input().split(' ')))\n\nchanges = 0\n\nfor i in range(n):\n changes += abs(nums[i] - i - 1)\n\nprint(changes)\n", "if __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n\r\n result = 0\r\n for i in range(len(a)):\r\n result += abs(i + 1 -a[i])\r\n\r\n print(result)", "import sys\r\n\r\ndef _input(): return map(int, input().split())\r\n \r\nn = int(input())\r\nlst = sorted(list(_input()))\r\ni = 0; res = 0\r\nwhile i<n:\r\n if lst[i] != i+1:\r\n res += abs(i+1 - lst[i])\r\n i+=1\r\nprint(res)\r\n\r\n", "_, x, y = int(input()), 0, 0\r\nfor i in sorted(map(int, input().split())):\r\n\tx += 1\r\n\ty += abs(i - x)\r\nprint(y)", "def solve():\r\n n = int(input())\r\n numbers = list(map(int,input().split()))\r\n numbers.sort()\r\n k = 0\r\n for i in range(n):\r\n k += abs(i + 1 - numbers[i])\r\n print(k)\r\n\r\ndef main():\r\n solve()\r\n\r\nmain()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nans=0\r\nfor j in range(n):\r\n ans+=abs(j+1-l[j])\r\nprint(ans)\r\n", "n = int(input())\r\na = input().split()\r\nfor i in range(n):\r\n a[i] = int(a[i])\r\na.sort()\r\nansw = 0\r\nfor i in range(n):\r\n answ += abs(a[i]-i-1)\r\nprint(answ)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\ncount=0\r\nfor i in range(n):\r\n count+=abs(arr[i]-i-1)\r\nprint(count)", "def steps():\r\n n = int(input())\r\n array = [int(x) for x in input().split(\" \")]\r\n array.sort()\r\n sum = 0\r\n for x in range(n):\r\n diff = abs(array[x]-(x+1))\r\n sum = sum + diff\r\n print(sum)\r\n \r\nsteps()", "n=int(input())\r\nnums=list(map(int,input().split()))\r\ncheck=list(range(1,n+1))\r\nnums.sort()\r\nans=0\r\n\r\nfor i in range(n):\r\n if nums[i]!=check[i]:\r\n ans+=abs(check[i]-nums[i])\r\n \r\nprint(ans) ", "from collections import Counter, defaultdict\r\nfrom sys import stdin,stdout\r\nimport io , os , sys\r\n#input = io.BytesIO(os.read(0,os.fstat(0).st_size)).readline\r\ninput = stdin.readline\r\n \r\nmod = 998244353 \r\n \r\ndef mapinput():\r\n return map(int, input().split())\r\n \r\ndef listinput():\r\n return list( map( int, input().split()))\r\n \r\ndef intinput():\r\n return int(stdin.readline())\r\n \r\ndef strinput():\r\n return input().strip()\r\n \r\ndef SieveOfEratosthenes(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n prime[0]= False\r\n prime[1]= False\r\n ans = []\r\n for p in range(n + 1):\r\n if prime[p]:\r\n ans.append(p)\r\n return ans\r\n \r\ndef writ(ss):\r\n stdout.write(str(ss) + \"\\n\")\r\n \r\ndef mult(a , b, mod):\r\n return ((a% mod) * (b%mod) ) % mod\r\n \r\n \r\ndef binn(arr , val , lower):\r\n low = 0\r\n high = len(arr) -1 \r\n while low<= high:\r\n \r\n mid = (low + high) >> 1 \r\n #print(low , high , mid , arr[mid] , val)\r\n if arr[mid] == val:\r\n return mid\r\n elif arr[mid] < val:\r\n low = mid + 1 \r\n else:\r\n high = mid -1\r\n if lower:\r\n return high\r\n return low\r\n \r\nfor test in range(1):\r\n n = intinput()\r\n arr = listinput()\r\n arr.sort()\r\n ans = 0 \r\n for i in range(n):\r\n ans += abs( i+1 - arr[i] )\r\n writ(ans)", "import sys\r\nimport math\r\ninput=sys.stdin.readline\r\nn=int(input())\r\nl=sorted([int(i) for i in input().split()])\r\nc=0\r\nfor i in range(n):\r\n c+=abs(l[i]-(i+1))\r\nprint(c)", "# Problem: C. Building Permutation\r\n# Contest: Codeforces - Codeforces Round #175 (Div. 2)\r\n# URL: https://codeforces.com/problemset/problem/285/C\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\nfrom sys import stdin, stdout \r\n\r\ndef INI():\r\n\treturn int(stdin.readline())\r\n\t\r\ndef INL():\r\n\treturn [int(_) for _ in stdin.readline().split()]\r\n\t\r\ndef INS():\r\n\treturn stdin.readline()\r\n\t\r\ndef OPS(ans):\r\n\tstdout.write(str(ans)+\"\\n\")\r\n\t\r\ndef OPL(ans):\r\n\t[stdout.write(str(_)+\" \") for _ in ans]\r\n\tstdout.write(\"\\n\")\r\n\r\n\t\r\nif __name__==\"__main__\":\r\n\tn=INI()\r\n\tA=sorted(INL())\r\n\t\r\n\tans=0\r\n\tfor _ in range(n):\r\n\t\tans+=abs(_+1-A[_])\r\n\tOPS(ans)", "input()\na = [int(x) for x in input().strip().split(' ')]\na.sort()\nans = 0\nfor i in range(len(a)):\n ans += abs(a[i]-i-1)\nprint(ans)\n\t \t \t \t\t\t\t \t \t \t \t\t\t\t \t", "n = int(input())\r\narr = [int(x) for x in input().split()]\r\narr.sort()\r\nnum = [x for x in range(1,n+1)]\r\nans = 0\r\nfor i in range(n):\r\n if arr[i]<0:\r\n ans+=abs(arr[i])+num[i]\r\n else:\r\n ans+=abs(num[i]-arr[i])\r\nprint(ans)", "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\nsm=0\r\nfor i,j in zip(sorted(il()),range(1,n+1)):\r\n sm+=abs(i-j)\r\nprint(sm)", "'''input\r\n3\r\n-1 -1 2\r\n\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\nn = getint()\r\narr = getints()\r\narr.sort()\r\nans = 0\r\nfor i in range(1,n+1):\r\n\tans+=abs(i - arr[i-1])\r\nprint(ans)", "import sys\r\nfrom math import*\r\ninput=sys.stdin.buffer.readline\r\n\r\nn=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nk=1\r\nans=0\r\nfor x in arr:\r\n\tans+=int(fabs(x-k))\r\n\tk+=1\r\nprint(ans)", "n = int(input())\r\nA = [int(i) for i in input().strip().split()]\r\nA.sort()\r\ns = 0\r\nfor i in range(1,n+1):\r\n s = s+abs(i-A[i-1])\r\nprint(s)", "import heapq\r\ndef solver():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n # print(arr)\r\n ans = 0\r\n arr.sort()\r\n for i in range(len(arr)):\r\n ans +=abs(arr[i]-(i+1))\r\n print(ans)\r\n\r\n\r\nsolver()\r\n", "n = int(input())\r\narr = [int(num) for num in input().split(' ')]\r\narr.sort()\r\nans = 0 \r\nfor i in range(n):\r\n ans = ans + abs(i+1 - arr[i])\r\nprint(ans)\r\n \r\n\r\n", "n = int(input())\r\nlst = sorted(map(int, input().split()))\r\n\r\nmoves = 0\r\nfor i in range(1, n+1):\r\n moves += abs(i-lst[i-1])\r\nprint(moves)", "def permutations(n,arr):\r\n s = sorted(arr)\r\n su = 0\r\n for i in range(1,n+1):\r\n su += abs(i-s[i-1])\r\n print(su)\r\nn = int(input())\r\nl = list(map(int,input().split()))\r\npermutations(n,l)", "n = int(input())\na = list( map(int,input().split()) )\na = sorted(a)\nans = 0\nfor i in range(n):\n ans += abs(i+1 - a[i])\nprint(ans)", "n = int(input())\n\nv = [int(i) for i in input().split()]\n\nv.sort()\ntotal = 0\nif v[0] < 1:\n total += (1 - v[0])\n v[0] = 1\n \nbase = v[0]\n\nfor i in range(len(v)):\n total += abs(base+i-v[i])\n\nprint(total)\n\t\t\t \t \t\t \t\t \t\t\t\t\t\t \t\t \t\t\t", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += abs(i+1 - arr[i])\r\nprint(ans)", "m = int(input())\r\nl_i = list(map(int, input().split()))\r\nl_i.sort()\r\na = 1\r\np = 0\r\nfor i in l_i:\r\n p += abs(a - i)\r\n a += 1\r\nprint(p)", "# -*- coding: utf-8 -*-\n\"\"\"\nCreated on Thu Feb 8 18:27:10 2018\n\n@author: rohit\n\"\"\"\n\nn = int(input())\na = [int(x) for x in input().split()]\nans = 0\na.sort()\nfor i in range(1,n+1):\n ans+=abs(a[i-1]-i)\nprint(ans)", "n=int(input())\r\nT=[]\r\nT=list(map(int,input().split()))\r\nr=0\r\nfor i in range(n):\r\n if(T[i]<0):\r\n r=r+abs(T[i])+1\r\n T[i]=1\r\n if(T[i]>n):\r\n r=r+T[i]-n\r\n T[i]=n\r\nT.sort()\r\nfor i in range(n):\r\n if T[i]>i+1:\r\n r=r+T[i]-i-1\r\n if T[i]<i+1:\r\n r=r+i+1-T[i]\r\nprint(r)\r\n \r\n \r\n \r\n", "n=int(input())\r\nsl=list(map(int,input().split()))\r\nsl.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=abs(i+1-sl[i])\r\nprint(ans)", "\r\nn = int(input())\r\nvalues = [int(x) for x in input().split(' ')]\r\n\r\n\r\nvalues.sort()\r\n\r\nresult = 0\r\nfor i, x in enumerate(values):\r\n result += abs(x - (i + 1))\r\n\r\nprint(result)\r\n\r\n\r\n", "input();x=sorted(list(map(int,input().split())))\r\nc,j=0,1\r\nfor i in x:c+=abs(i-j);j+=1\r\nprint(c)", "n = int(input())\r\nl = sorted(list(map(int,input().split())))\r\ncount=0\r\nk = 1\r\nfor i in l:\r\n if i!=k:\r\n count+=abs(i-k)\r\n k+=1\r\nprint(count)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\nc=0\r\nfor i in range(n):\r\n c+=abs(l[i]-(i+1))\r\nprint(c)", "n,x=int(input()),0\r\na=sorted(list(map(int,input().split())))\r\nfor i in range(n):x+=abs(a[i]-(i+1));\r\nprint(x)", "def build_permutation(l):\r\n s=sorted(l)\r\n p=[]\r\n for i in range(1,len(l)+1):\r\n p.append(i)\r\n sum=0\r\n for j in range(len(l)):\r\n if s[j]>=p[j]:\r\n sum+=s[j]-p[j]\r\n else:\r\n sum+=p[j]-s[j]\r\n print(sum)\r\nn=int(input())\r\nl=[int(x) for x in input().split()]\r\nbuild_permutation(l)", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\n\r\nprint(sum([abs(a - n) for a, n in zip(A, range(1, n+1))]))", "n = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(n):\r\n c+= abs((i+1) - a[i])\r\nprint(c)\r\n ", "import sys\r\nimport math\r\n\r\ndef solve(n,a):\r\n a.sort()\r\n ans=0\r\n\r\n for i in range(1,n+1):\r\n ans += abs(a[i-1] - i)\r\n #print(ans,i,a[i-1])\r\n return ans\r\n#for _ in range(int(input())):\r\nn=int(input())\r\na=[int(x) for x in input().split()]\r\n#a=[int(x) for x in input().split()]\r\n#s=input()\r\n\"\"\"for _ in range(n):\r\n x1,y1=[int(x) for x in input().split()]\"\"\"\r\nans=solve(n,a)\r\nprint(ans)", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\ni=1 \r\nsum=0\r\nfor j in range(0,n):\r\n sum+=abs(a[j]-i)\r\n i+=1\r\nprint(sum)\r\n \r\n", "import sys\r\ninput = sys.stdin.readline\r\n\r\nn = int(input())\r\nw = sum(abs(j-(i+1)) for i, j in enumerate(sorted(map(int, input().split()))))\r\nprint(w)", "n = int(input())\r\nlst = list(map(int, input().split()))\r\nlst.sort(reverse = True)\r\nsum=0\r\nfor i in range(n, 0, -1):\r\n sum=sum+abs(lst[n-i]-i)\r\nprint(sum)\r\n\r\n\r\n\r\n \r\n\r\n\r\n", "input()\nxs = [int(x) for x in input().split()]\n\nxs.sort()\nsol = 0\n\nfor i in range(0, len(xs)):\n sol += abs(xs[i] - (i + 1))\n\nprint (sol)\n", "n = int(input())\r\narr= list(map(int,input().split()))\r\narr.sort()\r\np = [i for i in range(1,n+1)]\r\nans=0\r\nfor i in range(n):\r\n ans+=abs(arr[i]-p[i])\r\nprint(ans)", "size = int(input().strip())\r\nreqset = [0 for i in range(size + 1)]\r\nnumset = sorted(list(map(int, input().strip().split())))\r\ni = 1\r\nans = 0\r\nwhile i <= len(numset): \r\n ans += abs(numset[i - 1] - i)\r\n i += 1\r\n\r\nprint(ans)\r\n", "n = int(input())\narr = list(map(int, input().split()))\n\narr.sort()\n\nmin_moves = 0\n\nfor i in range(n):\n min_moves += abs(arr[i]-i-1)\n\nprint(min_moves)\n", "def main():\r\n size = int(input())\r\n numbers = sorted(map(int, input().split()))\r\n total = 0\r\n \r\n for i in range(size):\r\n x = i + 1\r\n \r\n if numbers[i] > x:\r\n total += numbers[i] - x\r\n elif numbers[i] < x:\r\n total += x - numbers[i] \r\n \r\n print(total)\r\n \r\nif __name__ == '__main__':\r\n main()", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=(abs(l[i]-i-1))\r\nprint(ans)", "n = int(input())\r\n\r\na = list(map(int, input().split()))\r\na = sorted(a)\r\n\r\ntotal = 0\r\nfor i in range(len(a)):\r\n total += abs(a[i] - i - 1)\r\nprint(total)", "if __name__ == '__main__':\r\n n = int(input())\r\n line = list(map(int, input().split()))\r\n line.sort()\r\n res = 0\r\n for i in range(n):\r\n res += abs(line[i] - i - 1)\r\n print(res)\r\n", "n = int(input())\narr = list(map(int, input().split()))\narr.sort()\nprint(sum([abs(i + 1 - a) for i, a in enumerate(arr)]))", "n = int(input())\r\narr = list(map(int, input().split()))\r\nstore = [0]*n\r\narr.sort()\r\nfor i in range(n):\r\n store[i]=abs(arr[i]-(i+1))\r\nprint(sum(store))", "input()\r\nk,j=0,1\r\nfor i in sorted(map(int,input().split())):k+=abs(i-j);j+=1\r\nprint(k)", "n = int(input())\r\na = sorted(map(int, input().split()))\r\nprint(sum([abs(a[i]-i-1) for i in range(n)]))", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=abs(i+1-a[i])\r\nprint(ans)", "import collections\r\nimport itertools\r\nimport sys\r\nfrom collections import defaultdict, Counter\r\nfrom math import sqrt, ceil\r\n\r\ninput = sys.stdin.readline\r\n\r\n\r\n############ ---- Input Functions ---- ############\r\ndef inp():\r\n return (int(input()))\r\n\r\n\r\ndef inlt():\r\n return (list(map(int, input().split())))\r\n\r\n\r\ndef insr():\r\n s = input()\r\n return (list(s[:len(s) - 1]))\r\n\r\n\r\ndef invr():\r\n return (map(int, input().split()))\r\n\r\n\r\n\r\n\r\ndef main():\r\n n = inp()\r\n v = inlt()\r\n v.sort()\r\n s = 0\r\n for i, vv in enumerate(v):\r\n s+=abs(vv-(i+1))\r\n print(s)\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\n\r\nif __name__ == \"__main__\":\r\n # sys.setrecursionlimit(10 ** 6)\r\n # threading.stack_size(10 ** 8)\r\n # t = threading.Thread(target=main)\r\n # t.start()\r\n # t.join()\r\n main()\r\n", "a = int(input())\r\nl = list(map(int, input().rstrip().split(\" \")))\r\nl.sort()\r\nt = 0\r\nfor i in range(a):\r\n if l[i]!=i+1:\r\n t+= abs((i+1)-l[i])\r\nprint(t)", "n= int(input()) \r\narr=list(map(int,input().rstrip().split()))\r\narr.sort() \r\no=1\r\ncount=0\r\nfor i in range(n):\r\n h=abs(arr[i]-o)\r\n count+=h\r\n o+=1\r\nprint(count) ", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\na.sort()\r\ncount=0\r\nnum=n\r\nfor x in range(n-1,-1,-1):\r\n count=count+abs(num-a[x])\r\n num-=1\r\nprint(count)", "a = int(input())\narr = list(map(int,input().split(' ')))\narr.sort()\nans = 0\nfor i in range(len(arr)):\n s = abs((i+1)-arr[i])\n ans += s\nprint(ans)\n", "n = int(input())\na = sorted([int(i) for i in input().split()])\nprint(sum([abs(i+1-a[i]) for i in range(n)]))", "i = int(input())\r\nl = sorted(list(map(int,input().split())))\r\nans= 0\r\nfor x in range(i):\r\n ans += abs((x+1)-l[x])\r\nprint(ans)", "n=int(input());l=sorted(list(map(int,input().split())));c=0\r\nfor i in range(n):\r\n\tif l[i]!=(i+1):c+=abs(l[i]-i-1)\r\nprint(c)", "a=int(input());s=0\r\nfor i in sorted(map(int,input().split()),reverse=True):s+=abs(a-i);a-=1;\r\nprint(s)\r\n", "n = int(input())\na = [int(item) for item in input().split()]\na.sort()\nresposta = 0\nfor pos in range(n):\n diff = pos-a[pos]\n if(diff+1 > 0):\n resposta+= (diff+1)\n else:\n resposta+=((diff+1)*-1)\nprint(resposta)\n \t \t\t\t\t\t\t\t \t\t \t\t \t\t \t \t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\na = sorted(a)\r\nl = 0\r\nfor i in range(len(a)):\r\n l+=(abs(a[i]-(i+1)))\r\nprint(l)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\n\r\nl1 = list(range(1,n+1))\r\nl.sort()\r\nc = 0\r\nfor i in range(n):\r\n if l[i] >= l1[i]:\r\n c+= l[i] - l1[i]\r\n else:\r\n c+= l1[i] - l[i]\r\nprint(c)\r\n", "n = int( input() )\r\na = sorted( map( int, input().split() ) )\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n ans += abs(a[i]-i-1)\r\n\r\nprint( ans )\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nvalidNumbers = set()\r\ntoFix = []\r\n\r\nfor i in range(n):\r\n if (arr[i] >= 1 and arr[i] <= n and arr[i] not in validNumbers):\r\n validNumbers.add(arr[i])\r\n else:\r\n toFix.append(arr[i])\r\n\r\ntoFix.sort()\r\ntotal = 0\r\nk = 0\r\nfor i in range(1, n + 1, 1):\r\n if (i not in validNumbers):\r\n total += abs(i - toFix[k])\r\n k += 1\r\n validNumbers.add(i)\r\n\r\n\r\nprint(total)\r\n", "n=int(input())\na=list(map(int,input().split()))\na.sort()\nans=0\nfor i in range(n):\n\tans+=abs(a[i]-i-1)\n\nprint(ans)\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\nstore = 0\r\narr.sort()\r\nfor i in range(n):\r\n store+=abs(arr[i]-(i+1))\r\nprint(store)", "def scan(type):\n return list(map(type, input().split()))\nn, = scan(int)\narr = scan(int)\nans = 0\narr.sort()\nfor i in range(n,0,-1):\n ans += abs(arr[i-1] - i)\nprint(ans)\n\n# 1482421961984", "size = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\nresult = 0\r\nfor i in range(size):\r\n result += abs(i + 1 - arr[i])\r\n\r\nprint(result)", "# cook your dish here\r\nif __name__ == '__main__':\r\n n = int(input())\r\n a = list(map(int,input().split()))\r\n a.sort()\r\n ans = 0\r\n \r\n for i in range(1,n+1):\r\n ans+=abs(i-a[i-1])\r\n \r\n print(ans)", "\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n l = [int(x) for x in input().split()]\r\n l.sort()\r\n res = 0\r\n cur = 1\r\n for x in l:\r\n res += abs(cur - x)\r\n cur += 1\r\n print(res)\r\n", "# https://v2.bigocoder.com/courses/41/lectures/557/problems/394?view=statement\r\n\r\nn = int(input())\r\nar = list(map(int, input().split()))\r\n\r\nar.sort()\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans += abs(i + 1 - ar[i])\r\n\r\nprint(ans)", "x = int(input())\r\ny = map(int,input().split())\r\nt=0\r\nj=1\r\nfor i in sorted(y):\r\n t+= abs(i-j)\r\n j+=1\r\nprint(t)", "n = int(input())\r\nX = list(map(int, input().split(\" \")))\r\nX.sort()\r\nprint(sum([abs(X[i-1]-i) for i in range(1,n+1)]))", "n = input()\r\nn=int(n)\r\na = [int(x) for x in input().split()]\r\na.sort()\r\ncount=0\r\nfor i in range(len(a)):\r\n\tcount+=abs(i+1-a[i])\r\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\na=sorted(a)\r\ncount=0\r\nfor i,j in enumerate(a):\r\n count+=abs(i+1-j)\r\nprint(count)", "n,r=int(input()),0\r\nfor i,x in enumerate(sorted(map(int,input().split())),1):r+=abs(x-i)\r\nprint(r)", "# https://codeforces.com/problemset/problem/285/C\n\ntarget = int(input())\nvalues = sorted(int(s) for s in input().split(\" \"))\ntotal_moves = 0\n\nfor i in range(1, target + 1):\n total_moves += abs(i - values[i - 1])\n\nprint(total_moves)", "n = int(input())\r\narr = sorted([int(i) for i in input().split()])\r\n\r\nres = [abs(i-arr[i-1]) for i in range(1,1+n)]\r\n\r\nprint(sum(res))", "from sys import stdin,stdout\r\nstdin.readline\r\ndef mp(): return list(map(int, stdin.readline().strip().split()))\r\ndef it():return int(stdin.readline().strip())\r\nfrom collections import defaultdict as dd,Counter as C,deque\r\nfrom math import ceil,gcd,sqrt,factorial,log2,floor\t\r\nfrom bisect import bisect_right as br,bisect_left as bl\r\nimport heapq\r\n\r\nn = it()\r\nl = mp()\r\ns = set()\r\nc = C(l)\r\n\r\nq = []\r\nfor i in c:\r\n\tif c[i] == 1:\r\n\t\tif i <=n and i >= 1:\r\n\t\t\ts.add(i)\r\n\t\telse:\r\n\t\t\t# print(i)\r\n\t\t\tc[i] = 0\r\n\t\t\tq.append(i)\r\n\telse:\r\n\t\tif i <=n and i >= 1:\r\n\t\t\ts.add(i)\r\n\t\t\tq.extend([i for _ in range(c[i]-1)])\r\n\t\t\tc[i] = 0\r\n\t\telse:\r\n\t\t\tq.extend([i for _ in range(c[i])])\r\n\t\t\tc[i] = 0\r\nq.sort(reverse = True)\r\n# print(q)\r\nans = 0\r\nfor i in range(n):\r\n\tif i+1 in s:\r\n\t\tpass\r\n\telse:\r\n\t\tk = q.pop()\r\n\t\tans += abs(i+1 - k)\r\n\t\ts.add(i+1)\r\nprint(ans)\r\n", "n = int(input())\na = list(map(int, input().split()))\n\na.sort()\nmoves = 0\nfor i in range(n):\n moves += abs(a[i] - (i+1))\n\nprint(moves)\n\t\t \t \t\t\t \t\t\t \t\t \t\t\t \t \t\t \t\t \t", "n=int(input().strip())\r\na=list(map(int,input().strip().split()))\r\na.sort()\r\nq=[i for i in range(1,n+1)]\r\nsm=0\r\nfor i in range(n):\r\n sm+=abs(q[i]-a[i])\r\nprint(sm)", "n=int(input())\r\nw=[int(k) for k in input().split()]\r\nw.sort()\r\nres=0\r\nfor j in range(n):\r\n res+=abs(w[j]-j-1)\r\nprint(res)", "n = int(input())\nl = list(map(int,input().split()))\nl.sort()\nans = 0\nfor i in range(n):\n ans+=abs(l[i]-(i+1))\nprint(ans)", "from sys import stdin, stdout\n\n# Permutation is a set of distinct positive integers that are less than n\ndef solve(n, lst):\n lst.sort()\n steps=0\n for i in range(1,n+1):\n steps += abs(i-lst[i-1])\n return steps\n\n#Test Area\n# print(\"success 1\" if solve(2,[3,0]) == 2 else \"failed 1\")\n# print(\"success 2\" if solve(3,[-1,-1,2]) == 6 else \"failed 2\")\n# print(\"success 3\" if solve(3,[2,1,3]) == 0 else \"failed 3\")\n# print(\"success 4\" if solve(3,[-100,-100,-100]) == 306 else \"failed 3\")\n# print(\"success 5\" if solve(3,[2,2,2]) == 2 else \"failed 5\")\n\n#Printing Area\nn = int(stdin.readline().rstrip(\"\\r\\n\"))\nlst = [ int(x) for x in stdin.readline().rstrip(\"\\r\\n\").split() ]\nstdout.write(str(solve(n, lst)))\n", "n =int(input())\r\n\r\narr = list(map(int, input().strip().split()))\r\n\r\narr.sort()\r\n\r\nsums = 0\r\nt = 1\r\nfor x in range(n):\r\n \r\n sums += abs(t - arr[x])\r\n t += 1\r\n \r\nprint(sums)", "def solve():\n n = int(input())\n\n arr = list(map(int, input().split()))\n\n arr = sorted(arr)\n\n res = 0\n\n for i in range(1, n+1):\n curr = arr[i-1]\n\n need = abs(curr-i)\n\n res+= need\n \n\n print(res)\n return\n\n\nsolve()", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans = 0\r\nfor i,n in enumerate(a):\r\n ans += abs(i+1-n)\r\nprint(ans)\r\n", "import math\r\nx=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(x):\r\n c+=math.fabs(l[i]-(i+1))\r\nprint(int(c)) \r\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\na = sorted(map(int, stdin.readline().split()))\r\ns = 0\r\nfor i in range(n):\r\n s += abs(a[i] - (i + 1))\r\nprint(s)", "input()\r\nk = 0\r\nj = 1\r\nfor i in sorted(map(int, input().split())):\r\n k += abs(i - j);#k=2+3+1\r\n j += 1#j=2\r\nprint(k)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\narr.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += abs(i + 1 - arr[i])\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", "n = int(input())\n\nseq = list(map(int, input().split()))\n\nseq.sort()\n\nmoves = 0\nfor i in range(n):\n\n if(seq[i] != i+1):\n moves += abs(i+1 - seq[i])\n\n\nprint(moves)\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", "def dif(a:int, b:int, /) -> int:\n if a > b:\n return a-b\n return b-a\n\nn, c = int(input()), 0\na = sorted(map(int,input().split()))\nfor i in range(n):\n c += dif(a[i],i+1)\nprint(c)\n", "n=int(input())\r\nL=list(map(int,input().split()))\r\nL.sort()\r\ns=0\r\nfor i in range (n):\r\n s+=abs(i+1-L[i])\r\nprint(s)\r\n", "n = int(input())\r\nper = [i for i in range(1, n+1)]\r\nli = sorted(list(map(int, input().split())))\r\nind = 0\r\nc = 0\r\nfor i in li:\r\n c += abs(per[ind] - i)\r\n ind += 1\r\nprint(c)", "n = int(input())\r\nk = list(map(int, input().split()))\r\nk.sort()\r\nans = 0\r\nfor i in range(1, n + 1):\r\n if k[i - 1] != i:\r\n ans += abs(i - k[i - 1])\r\nprint(ans)\r\n", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nperm = list(range(1, n+1))\r\n\r\nprint(sum(abs(x-y) for (x, y) in zip(a, perm)))", "n = int(input())\r\nl = sorted(list(map(int, input().split())))\r\ncnt = 0\r\nfor i in range(n):\r\n cnt += abs((i+ 1) - l[i])\r\nprint(cnt)\r\n \r\n", "# your code goes here\r\nn = int(input())\r\narray = input().split()\r\nfor i in range(n):\r\n\tarray[i] = int(array[i])\r\narray.sort()\r\nmoves = 0\r\nfor i in range(n):\r\n\tmoves += abs(array[i] - (i + 1))\r\nprint(moves)\r\n", "n = int(input())\np = list(map(int,input().split()))\np = sorted(p)\nres = 0\nfor i in range(1,len(p)+1):\n res += abs(i-p[i-1])\nprint(res)\n\n\n\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ntarget = 1\r\nops = 0\r\nfor i in arr:\r\n ops += abs(target - i)\r\n target += 1\r\nprint(ops)\r\n", "n= int(input())\r\nl = list(map(int,input().split(\" \")))\r\n\r\np = [i for i in range(1,n+1)]\r\nl.sort()\r\n\r\nnb = 0;\r\n\r\nfor i in range(n):\r\n nb += abs(p[i]-l[i])\r\n\r\nprint(nb)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl=sorted(l)\r\nsum=0\r\nfor i in range(1,n+1):\r\n sum=sum+abs(i-l[i-1])\r\nprint(sum)", "n=int(input())\r\na=sorted(map(int,input().split()))\r\ns=0\r\nfor i in range(1,n+1):\r\n s+=abs(a[i-1]-i)\r\nprint(s)", "n=int(input())\r\n#n,k = map(int, input().strip().split(' '))\r\nlst = list(map(int, input().strip().split(' ')))\r\nlst.sort()\r\ns=0\r\nfor j in range(n):\r\n s+=abs((j+1)-lst[j])\r\nprint(s)", "n = int(input())\r\nl = sorted(list(map(int,input().split())))\r\ns =set()\r\nst = []\r\nfor i in range(len(l)):\r\n if l[i] in s or l[i]<=0 or l[i]>n:\r\n st.append(l[i])\r\n else:\r\n s.add(l[i])\r\nx = []\r\nfor i in range(1,n+1):\r\n if i not in s:\r\n x.append(i)\r\nans=0\r\nfor i in range(len(x)):\r\n ans+=abs(x[i]-st[i])\r\nprint(ans)", "a = int(input())\r\nb = list(map(int,input().split()))\r\n\r\nb.sort()\r\nk=1\r\nco=0\r\nfor elem in b:\r\n co += abs(elem - k)\r\n k+=1\r\nprint(co)", "n = int(input())\r\na = sorted([int(i) for i in input().split()])\r\nmove = 0\r\nfor i in range(n):\r\n #print(a[i], i, move)\r\n move += abs(a[i] - (i + 1))\r\nprint(move)\r\n", "from collections import deque\n\nN = int(input())\nA = sorted(list(map(int, input().split())), reverse=True)\n\nindex = 1\nans = 0\nwhile A:\n a = A.pop()\n ans += abs(a - index)\n index += 1\nprint(ans)", "n = int(input())\nvals = list(map(int, input().split()))\nvals.sort()\nans = 0\nfor i in range(n):\n\tans += abs(i+1-vals[i])\nprint(ans)", "n = int(input())\na = [int(x) for x in input().split()]\na.sort()\nprint(sum(abs(a[i] - i - 1) for i in range(n)))\n", "n = int(input())\r\n\r\narr = [int(x) for x in input().split()]\r\narr.sort()\r\n\r\nans = sum([abs(arr[x] - (x+1)) for x in range(len(arr))])\r\n\r\nprint(ans)", "import sys\nimport math\n\ndef inputStr():\n return sys.stdin.readline().rstrip(\"\\r\\n\")\n\ndef outputVar(v):\n sys.stdout.write(str(v))\n\ndef main():\n\n n = int(inputStr())\n\n a = sorted(list(map(int,input().split())))\n ans = 0\n for i in range(n):\n ans += abs(a[i]-i-1)\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n\n \t\t\t\t \t \t \t\t\t \t \t \t \t \t", "\r\n\r\na = int(input())\r\n\r\nx = [int(x) for x in input().split()]\r\n\r\nx.sort()\r\ns = 0\r\n\r\nfor i in range(a):\r\n s = s + abs((i + 1) - x[i])\r\n \r\nprint(s)", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\narrSorted = [i for i in range(1,n+1)]\r\nresult = 0\r\nfor i in range(len(arr)):\r\n\tresult += abs(arrSorted[i]-arr[i])\r\nprint(result)", "n = int(input())\r\na = list(map(int,input().split()))\r\na.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans+=abs(a[i]-(i+1))\r\nprint(ans)", "n=int(input())\na=[int(i) for i in input().split(' ')]\na=sorted(a)\nans=0\ncnt=0\nfor i in a:\n cnt+=1\n ans+=abs(cnt-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\narr.sort()\r\nsu = 0\r\nfor i in range(len(arr)):\r\n\tsu+=abs((i+1)-arr[i])\r\nprint(su)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\n# print(a)\r\nc=0\r\nfor i in range(n):\r\n c=c+(abs(a[i]-(i+1)))\r\nprint(c)", "def main():\r\n n=int(input())\r\n L=list(map(int,input().split()))\r\n L.sort()\r\n steps=0\r\n for i in range(1,n+1):\r\n steps+=abs(i-L[i-1])\r\n print(steps)\r\nmain()", "size = int(input())\r\ndata = list(map(int,input().split()))\r\ndata.sort()\r\nminMoves = 0\r\ni = 1\r\nfor element in data:\r\n minMoves += abs(element-i)\r\n i += 1\r\nprint(minMoves)", "n = int(input())\r\nli = [int(x) for x in input().split(' ')]\r\nli.sort()\r\nans = [int(x) for x in range(1,n+1)]\r\nj =0;\r\ncount = 0\r\nfor i in li:\r\n count += abs(ans[j] - i)\r\n j+=1\r\nprint(count)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(n):\r\n c+=abs(l[i]-i-1)\r\nprint(c)\r\n", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nm=[i+1 for i in range(n)]\r\nco=0\r\nfor i in range(n):\r\n co+=abs(m[i]-s[i])\r\nprint(co)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(n-1,-1,-1):\r\n\tc+=abs(i+1-l[i])\r\nprint(c)", "n, val = int(input()), 0\r\nfor x, y in zip(sorted(int(x) for x in input().split()), range(1, n + 1)):\r\n val += abs(x - y)\r\nprint(val)", "n=int(input())\r\n\r\nl=sorted(list(map(int,input().split())))\r\nans=0\r\nfor i in range(1,n+1):\r\n\tans+=abs(l[i-1]-i)\r\n\r\nprint(ans)\r\n\t", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\ns = 0\r\nfor i in range(n):\r\n s+=abs(a[i] - (i+1))\r\nprint(s)", "import sys\r\nt=sys.stdin.buffer.readline()\r\nt=int(t)\r\nls=list(map(int,input().split()))\r\narr=sorted(ls)\r\ncount=0\r\nfor i in range(t):\r\n count+=abs(i+1-arr[i])\r\nprint(count)\r\n\r\n\r\n\r\n\r\n", "def solution(a,n):\n a.sort()\n moves=0\n k=1\n for i in a:\n moves = moves + abs(k-i)\n k = k+1\n print (moves)\n\nn = int(input())\nstr_a = input().split(' ')\na = [int(num) for num in str_a]\n\nsolution(a,n)", "n = int(input())\r\nl = []\r\ni = 1\r\nwhile i <= n:\r\n l.append(i)\r\n i += 1\r\np = list(map(int, input().split()))\r\np.sort()\r\nc = 0\r\nfor j in range(0, n):\r\n c += abs(l[j]-p[j])\r\n\r\nprint(c)\r\n", "n = int(input())\narr = sorted(list(map(int,input().split())))\n#a = list(range(1,n+1))\nt = 0\nfor i in range(1,n+1):\n t += abs(arr[i-1]-i)\nprint(t)", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n a = [i for i in range(1, n + 1)]\r\n arr = sorted(arr)\r\n k = 0\r\n for i in range(n):\r\n k += abs(a[i] - arr[i])\r\n print(k)\r\n\r\nif __name__ == '__main__':\r\n main()", "#in the name of god\r\n#Mr_Rubick\r\nn=int(input())\r\ncnt=1\r\nsolve=0\r\na=list(map(int,input().split()))\r\na.sort()\r\nfor i in a:\r\n solve+=abs(cnt-i)\r\n cnt+=1\r\nprint(solve)", "n=int(input())\r\na=input().split()\r\nb=[]\r\nfor i in range(n):\r\n a[i]=int(a[i])\r\na.sort()\r\nfor l in range(1,n+1):\r\n b.append(l)\r\nans=0\r\nfor k in range(n):\r\n ans+=abs(a[k]-b[k])\r\nprint(ans)", "from sys import stdin\nfrom functools import reduce\n\n\ndef comp(acc, tpl):\n item, i = tpl\n return acc + abs(item - i)\n\n\ndef main():\n line = stdin.readline\n n = int(line())\n a = list(map(int, line().split()))\n a.sort()\n total = reduce(comp, enumerate(a, 1), 0)\n print(total)\n\n\nif __name__ == '__main__':\n main()\n", "# link: https://codeforces.com/problemset/problem/285/C\r\n\r\nfor _ in range(1):\r\n n = int(input())\r\n array = list(map(int, input().split()))\r\n # supposed to be array is 1,2....,n\r\n array.sort()\r\n needed = 0\r\n for i in range(n):\r\n needed += abs((i+1) - array[i])\r\n print(needed) ", "n=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\ns1=0\r\nfor x in range(n):\r\n\ts1+=abs(s[x]-x-1)\r\nprint(s1)", "n=int(input())\r\narr=list(map(int, input().split()))\r\narr.sort()\r\ncount=0\r\nfor idx in range(n):\r\n count+=abs(arr[idx]-idx-1)\r\nprint(count)", "n=int(input())\r\nli=list(map(int,input().split()))\r\na=[]\r\nli.sort(reverse=True)\r\nfor i in range(n,0,-1):\r\n a.append(i)\r\n\r\nsum=0 \r\nfor j in range(n):\r\n d=abs(a[j]-li[j])\r\n sum=sum+d\r\n\r\nprint(sum) \r\n\r\n\r\n\r\n \r\n\r\n", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nans=0\r\nfor i in range(len(arr)):\r\n ans+=abs(i+1-arr[i])\r\nprint (ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nvalidNumbers = set()\r\ntoFix = []\r\n\r\nfor number in arr:\r\n if (1 <= number <= n and number not in validNumbers):\r\n validNumbers.add(number)\r\n else:\r\n toFix.append(number)\r\n\r\ntoFix.sort()\r\ntotal = 0\r\ni = 0\r\nfor p in range(1, n + 1, 1):\r\n if (p not in validNumbers):\r\n total += abs(p - toFix[i])\r\n i += 1\r\n validNumbers.add(p)\r\n\r\n\r\nprint(total)\r\n", "def solve():\r\n n = int(input())\r\n a = sorted([int(i) for i in input().split()])\r\n ans = 0\r\n for i in range(n):\r\n ans += abs(a[i] - i - 1)\r\n return ans\r\n\r\n\r\nprint(solve())", "import math\nimport sys\n# sys.stdin = open('in.txt', 'r') \n# sys.stdout = open('op.txt', 'w')\n\nt = 1\nwhile t>0:\n t-=1\n n = int(input())\n arr = list(map(int,input().split(' ')))\n arr.sort()\n i=1\n ans=0\n for x in arr:\n ans+= abs(i-x)\n i+=1\n print(ans)\n\n ", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=abs(i+1-l[i])\r\nprint(ans)", "import math\r\nn=int(input())\r\na=[int(i) for i in input().split()]\r\na=sorted(a)\r\ne=1\r\nsum=0\r\nfor i in range(0,len(a)):\r\n sum=sum+abs(e-a[i])\r\n e=e+1\r\nprint(sum)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nc=0\r\nfor i in range(1,n+1):\r\n c+=abs(a[i-1]-i)\r\nprint(c)\r\n", "from sys import stdin\ninput = stdin.readline\n\nn = int(input())\nseq = [int(item) for item in input().split(' ')]\nmoves = 0\n\nexisting = set()\nne = []\nfor item in seq:\n if 0 < item <= n and item not in existing:\n existing.add(item)\n else:\n ne.append(item)\n\nif len(existing) == n:\n print(0)\n exit()\n\nne.sort()\n\nj = 0\nfor i in range(1, n + 1):\n if i in existing:\n continue\n moves += abs((i - ne[j]))\n j += 1\n\nprint(moves)\n", "ans = 0\r\nsize = int(input())\r\nnums = list(map(int, input().split()))\r\nnums.sort()\r\nfor i in range(1, size + 1):\r\n if nums[i - 1] == i: continue\r\n ans += abs(i - nums[i - 1])\r\nprint(ans)", "\r\n#from collections import Counter\r\n#from collections import defaultdict\r\n#import math\r\nn = int(input())\r\n#n,m = map(int,input().split())\r\nl = list(map(int,input().split()))\r\n#t = list(map(int,input().split()))\r\nl.sort()\r\n\r\nc = 0\r\nfor i in range(1,n+1):\r\n c += abs(i-l[i-1])\r\nprint(c)\r\n\r\n", "from sys import stdin, stdout\r\nimport math,sys\r\n#sys.stdout = open('output.txt', 'w')\r\n#sys.stdin = open('input.txt','r')\r\nfrom itertools import permutations, combinations\r\nfrom collections import defaultdict\r\nimport bisect\r\nimport heapq as hq\r\n\r\n\r\ndef main():\r\n try:\r\n n=int(input())\r\n l=list(map(int,input().split()))\r\n #print(l)\r\n l.sort()\r\n su=0\r\n for i in range(n):\r\n su+=abs(i+1-l[i])\r\n print(su) \r\n\r\n except:\r\n pass\r\n\r\n\r\nP = 1000000007\r\ndef search(l,x):\r\n a,b=0,len(l)-1\r\n while (a<=b):\r\n k=(a+b)//2\r\n if l[k]==x:\r\n return k\r\n elif l[k]<x:\r\n a=k+1\r\n else:\r\n b=k-1\r\n\r\nif __name__ == '__main__':\r\n main()\r\n\r\n\r\n", "n, values, total = int(input()), list(sorted([int(i) for i in input().split()])), 0\r\nfor i in range(n):\r\n total += abs((i + 1) - values[i])\r\nprint(total)\r\n", "n=int(input());a=sorted(map(int, input().split()));s=0\r\nfor i in range(n):s+=abs(a[i]-i-1)\r\nprint(s)", "import math\nn = int(input())\n\na = list(map(int,input().split()))\na.sort()\ncount = 0\nfor i in range(1,n+1):\n if i>a[i-1]:\n count+=i-a[i-1]\n else:\n count+=a[i-1]-i\n\nprint(count)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nl=[]\r\nfor i in range(1,n+1):\r\n l.append(i)\r\nv=0\r\ni=0\r\nwhile i < n :\r\n v+=abs(a[i]-l[i])\r\n i+=1\r\nprint(v)", "\ndef mi():\n\treturn map(int, input().split())\n\nn = int(input())\na = list(mi())\nb = list(range(1,n+1))\na.sort()\nb.sort()\nc = 0\nfor i in range(n):\n\tc+=abs(a[i]-b[i])\nprint (c)", "n = int(input())\nent = list(map(int,input().split()))[:n]\nent.sort()\nres = 0\n\nfor i in range (0, n):\n if ent[i] < i + 1:\n res += i + 1 - ent[i]\n \n elif ent[i] > i + 1:\n res += ent[i] - i - 1\n\nprint(res)\n\t\t \t \t \t \t \t\t\t \t\t \t\t \t", "n=int(input())\r\np=sorted([int(x) for x in input().split()])\r\nnum=0\r\nfor i in range(n):\r\n num=num+abs(p[i]-i-1)\r\nprint(num)\r\n", "# IN THE NAME OF ALLAH\r\n\r\nN = 3 * pow(10, 5) + 1\r\n\r\nn = int(input())\r\ninp = input().split()\r\ninp = [int(i) for i in inp]\r\nflag = []\r\nfor i in range(N): flag.append(False)\r\na = []\r\nb=[]\r\nans=0\r\n\r\nfor i in range(n):\r\n if(inp[i]>=1 and inp[i]<N and inp[i]<=n):\r\n if flag[inp[i]]==False :\r\n flag[inp[i]]=True\r\n else:\r\n a += [inp[i]]\r\n else:\r\n a+=[inp[i]]\r\na.sort()\r\n\r\nfor i in range(1,n+1):\r\n if flag[i]==False:\r\n b+=[i]\r\n\r\nfor i in range(len(a)):\r\n ans+=abs(a[i]-b[i])\r\nprint(ans)\r\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl=sorted(l)\r\nc=0\r\nfor i in range(len(l)):\r\n c+=abs(i+1-l[i])\r\nprint(c)\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=nmbr()\r\n a=sorted(lst())\r\n ans=0\r\n for i in range(1,n+1):\r\n ans+=abs(i-a[i-1])\r\n print(ans)", "n = int(input())\r\na = list(map(int, input().split()))\r\np = []\r\nfor i in range(1, n+1):\r\n p.append(i)\r\na.sort()\r\nans = 0\r\nfor i in range(0, len(a)):\r\n ans += abs(a[i] - p[i])\r\nprint(ans)", "qtd = int(input())\nlista = input().split()\nfor i in range(qtd):\n lista[i]=int(lista[i])\nlista.sort()\nvalor = 0\ntotal = 0\nfor i in range(qtd):\n if (lista[i] != i+1):\n valor = abs(-lista[i] +i+1)\n total +=valor\nprint(total)\n\t\t\t\t\t\t \t\t \t \t\t \t \t \t\t \t", "n= int(input())\r\na=[int(X) for X in input().split()]\r\na.sort()\r\nan=0\r\n\r\nfor i in range(n):\r\n\r\n an+=(abs(a[i]-i-1))\r\nprint(an)", "from collections import Counter as C\r\ndef miis():\r\n return map(int, input().split())\r\n\r\nn = int(input())\r\na = list(miis())\r\na.sort()\r\np = [i+1 for i in range(n)]\r\nans = 0\r\nfor i, j in zip(a, p):\r\n ans += abs(i-j)\r\nprint(ans)\r\n", "n=int(input())\r\n\r\na=list(map(int, input().split()))\r\n\r\na.sort()\r\n\r\ncount=0\r\n\r\nfor i in range(0,n):\r\n count=count+abs(a[i]-(i+1))\r\n\r\nprint (count)\r\n", "\r\nn = int(input())\r\nl = list(map(int,input().split())) \r\nl.sort();ct = 0;j =1\r\nfor i in l:\r\n ct += abs(i-j);j+=1\r\nprint(ct)\r\n\r\n", "def solve(n, numbers):\r\n numbers = sorted(numbers)\r\n\r\n result = 0\r\n\r\n for i in range(n):\r\n result += abs(i+1 - numbers[i])\r\n\r\n return result\r\n\r\nif __name__ == \"__main__\":\r\n n = int(input())\r\n numbers = map(int, input().split(\" \"))\r\n print(solve(n, numbers))", "el = int(input())\r\nar = []\r\nfor i in input().split(' '):\r\n ar.append(int(i))\r\nar.sort()\r\ncount = 0\r\nfor i in range(len(ar)):\r\n count = count + abs(ar[i] - (i+1))\r\nprint(count)\r\n", "from sys import stdin\r\n\r\n\r\ndef solve():\r\n n = int(stdin.readline())\r\n A = [int(x) for x in stdin.readline().split()]\r\n\r\n A = [0] + sorted(A)\r\n res = 0\r\n\r\n for i in range(1, len(A)):\r\n res += abs(A[i] - A[i - 1] - 1)\r\n A[i] = A[i - 1] + 1\r\n\r\n print(res)\r\n\r\n\r\nsolve()\r\n", "n = int(input())\r\narr = sorted(map(int, input().split()))\r\n\r\nres = 0\r\nfor i in range(n):\r\n res += abs(i + 1 - arr[i])\r\n \r\nprint(res)", "def generatePermutation(n):\r\n p = []\r\n for i in range(1, n+1):\r\n p.append(i)\r\n return p\r\n\r\ndef countMinMoves(a, p):\r\n count = 0\r\n for i in range(len(a)):\r\n count += abs(a[i] - p[i])\r\n return count\r\n\r\nn = int(input())\r\na = list(map(int, input().split()))\r\na.sort()\r\np = generatePermutation(n)\r\nprint(countMinMoves(a, p))", "n = int(input())\na = list(map(int, input().split(\" \")))\na.sort()\nr = 0\nfor i in range(n):\n d = a[i] - (i + 1)\n r += max(d,-d)\nprint(r)\n", "\r\n\r\ndef main():\r\n n = int(input())\r\n arr = list(map(int,input().split()))\r\n arr.sort()\r\n c = 0\r\n for i in range(1,n + 1):\r\n c += abs(arr[i - 1] - i)\r\n print(c)\r\n\r\n\r\n\r\n\r\nmain()", "n = int(input())\r\nmass = sorted(list(map(int, input().split())))\r\nk = 0\r\nfor i in range(n):\r\n\tif 1 <= mass[i] <= n:\r\n\t\tmass[mass[i] - 1], mass[i] = mass[i], mass[mass[i] - 1]\r\nfor i in range(n):\r\n\tif mass[i] != i + 1:\r\n\t\tk += abs(i + 1 - mass[i])\r\n\t\tmass[i] = abs(i + 1 - mass[i])\r\nprint(k)", "n = int(input())\r\nnums = list(map(int,input().split(' ')))\r\nnums.sort()\r\nmoves = 0\r\nfor i,j in enumerate(nums):\r\n moves += abs(j-(i+1))\r\nprint(moves)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\nss=0\r\nfor i in range(n):\r\n ss+=abs(i-a[i]+1)\r\nprint(ss)", "n = int(input())\r\nnumber = [int(x) for x in input().split()]\r\nnumber.sort()\r\nmoves = 0\r\nfor i in range(0, n):\r\n moves += abs(i + 1 - number[i])\r\nprint(moves)", "t = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nans = 0\r\nfor i in range(1,t+1):\r\n ans=ans+abs(l[i-1]-i)\r\nprint(ans)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na.sort()\r\ncnt=0\r\nfor i in range(n):\r\n cnt+=(abs(i+1-a[i]))\r\nprint(cnt)", "n=int(input())\r\nch=input()\r\nl=list(map(int,ch.split()))\r\nl.sort()\r\n\r\n\r\ns=0\r\nfor i in range (n):\r\n s+=abs((i+1)-l[i])\r\n \r\nprint(s) ", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nt=0\r\nfor i in range(n):\r\n t+=abs(i+1-a[i])\r\nprint(t)", "n=int(input())\r\nb=[]\r\na=sorted(list(map(int,input().split())))\r\nfor i in range(1,n+1):\r\n b.append(abs(i-a[i-1]))\r\nprint(sum(b))", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\na.sort()\r\ncount=0\r\nfor x in range(n-1,-1,-1):\r\n count=count+abs(x+1-a[x])\r\nprint(count)", "x=int(input())\r\nb=list(map(int,input().split()))\r\nb.sort()\r\nc=list(range(1,x+1))\r\n\r\ntot=0\r\n\r\nfor i in range(x):\r\n tot+=abs(b[i]-c[i])\r\nprint(tot)\r\n", "n=int(input())\r\na=sorted(list(map(int,input().split())))\r\nans=0\r\nfor i in range(0,len(a)):\r\n ans+=abs((i+1)-a[i])\r\nprint(ans)\r\n", "\r\n\r\nif __name__ =='__main__':\r\n n = int(input())\r\n a = list( map(int, input().split()) )\r\n \r\n rst = 0\r\n a.sort()\r\n for i in range(1, n+1):\r\n rst = rst + abs( i - a[i-1] )\r\n \r\n print(rst)", "n = int(input())\r\n\r\nlst = list(map(int, input().split()))\r\nlst.sort()\r\n\r\ntot = 0\r\nfor i in range(n):\r\n tot += abs((i+1) - lst[i])\r\nprint(tot)", "n = int(input())\r\narr = [int(i) for i in input().split()]\r\narr.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans += abs(i+1-arr[i])\r\n\r\nprint(ans)", "n = int(input())\na = list(map(int,input().split(' ')))\na.sort()\np = [i for i in range(1,n+1)]\nans = 0\nfor i in range(n):\n ans += abs(a[i] - p[i])\nprint(ans)\n\n", "from sys import stdin, stdout\r\nn = int(stdin.readline())\r\na = sorted(list(map(int, stdin.readline().split())))\r\nres = 0\r\nfor i in range(n):\r\n res += abs(a[i] - i - 1)\r\nstdout.write(str(res))", "import math\r\nimport sys\r\nimport collections\r\n\r\n\r\n# imgur.com/Pkt7iIf.png\r\n\r\ndef getdict(n):\r\n d = {}\r\n if type(n) is list:\r\n for i in n:\r\n if i in d:\r\n d[i] += 1\r\n else:\r\n d[i] = 1\r\n else:\r\n for i in range(n):\r\n t = ii()\r\n if t in d:\r\n d[t] += 1\r\n else:\r\n d[t] = 1\r\n return d\r\ndef sieve(n):\r\n prime = [True for i in range(n + 1)]\r\n p = 2\r\n while (p * p <= n):\r\n if (prime[p] == True):\r\n for i in range(p * 2, n + 1, p):\r\n prime[i] = False\r\n p += 1\r\n prime[0] = prime[1] = False\r\n r = [p for p in range(n + 1) if prime[p]]\r\n return r\r\ndef cdiv(n, k): return n // k + (n % k != 0)\r\ndef ii(): return int(input())\r\ndef mi(): return map(int, input().split())\r\ndef li(): return list(map(int, input().split()))\r\ndef lcm(a, b): return abs(a * b) // math.gcd(a, b)\r\ndef prr(a, sep = ' '): print(sep.join(map(str, a)))\r\n\r\n\r\nn = ii()\r\nd = sorted(li())\r\nr = 0\r\nfor i in range(1, n + 1):\r\n r += abs(i - d[i - 1])\r\nprint(r)\r\n", "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 = 0\r\nfor i in range(len(s)):\r\n ans += abs((i + 1) - a[i])\r\nprint(ans)", "n = int(input())\r\n\r\nl = sorted(list(map(int,input().rstrip().split(' '))))\r\n\r\nactual_list = [i for i in range(1,n+1)]\r\n\r\nCount = 0\r\n\r\nfor i in range(n):\r\n Count += abs(actual_list[i]-l[i])\r\nprint(Count)\r\n", "n = int(input())\nary = [int(i) for i in input().split()]\nary.sort()\n\nout = 0\nc = 0\nfor i in ary:\n\tc += 1\n\tout += abs(i - c)\n\nprint(out) ", "s1, s2 = int(input()), map(int,input().split())\ns2 = sorted(s2)\nstate = 1\nstep = 0\nfor i in range(s1):\n step += abs(s2[i]-state)\n state+=1\nprint(step)", "n = int(input())\r\n\r\nar = list(map(int, input().split()))\r\n\r\nar.sort()\r\n\r\nans = 0\r\n\r\nfor i in range(n):\r\n ans += abs(ar[i] - (i + 1))\r\n\r\nprint(ans)\r\n", "n = int(input())\r\nA = list(map(int,input().split()))\r\nA.sort()\r\nP = []\r\nfor i in range(n):\r\n P.append(i+1)\r\ncount = 0\r\nfor i in range(n):\r\n count += abs(A[i]-P[i])\r\nprint(count)", "n=int(input())\narray=list(map(int,input().split()))\narray.sort()\nmoves=0\nfor i in range(1,n+1):\n\tmoves+=abs(i-array[i-1])\nprint(moves)\n\n", "n = int(input())\n\nvalues = map(int, input().split())\n\nvalues = sorted(values)\nresult = 0\n\nfor i in range(0,n):\n result+=abs(i - values[i] + 1)\n \nprint(result)\n \t\t\t\t \t\t\t \t\t\t \t\t\t \t \t\t \t", "from collections import deque as de\r\nclass My_stack():\r\n def __init__(self):\r\n self.data = []\r\n def my_push(self, x):\r\n return (self.data.append(x))\r\n def my_pop(self):\r\n return (self.data.pop())\r\n def my_peak(self):\r\n return (self.data[-1])\r\n def my_contains(self, x):\r\n return (self.data.count(x))\r\n def my_show_all(self):\r\n return (self.data)\r\n def isEmpty(self):\r\n return len(self.data)==0\r\n\r\narrStack = My_stack() \r\n# A optimized school method based \r\n# Python3 program to check \r\n# if a number is prime \r\n\r\n\r\ndef isPrime(n) : \r\n\r\n\t# Corner cases \r\n\tif (n <= 1) : \r\n\t\treturn False\r\n\tif (n <= 3) : \r\n\t\treturn True\r\n\r\n\t# This is checked so that we can skip \r\n\t# middle five numbers in below loop \r\n\tif (n % 2 == 0 or n % 3 == 0) : \r\n\t\treturn False\r\n\r\n\ti = 5\r\n\twhile(i * i <= n) : \r\n\t\tif (n % i == 0 or n % (i + 2) == 0) : \r\n\t\t\treturn False\r\n\t\ti = i + 6\r\n\r\n\treturn True\r\n\r\nn=int(input())\r\na=sorted(list(map(int,input().split())))\r\nans =0\r\nfor i in range(n):\r\n ans += abs(a[i]-(i+1))\r\nprint(ans)\r\n\r\n \r\n \r\n\r\n\r\n", "def solution():\r\n\tn=int(input())\r\n\tarr=list(map(int,input().split()))\r\n\tarr.sort()\r\n\tcnt=0\r\n\tfor i in range(n):\r\n\t\tcnt+=abs(i+1-arr[i])\r\n\tprint(cnt)\r\n\r\n\treturn\r\n\r\n\r\n\r\n\r\n\t\t\t\r\nsolution()\r\n", "\r\ndef getPermu (arr, n):\r\n tempArr = [i for i in range(1, n+1)]\r\n arr.sort()\r\n tempArr.sort()\r\n total = 0\r\n for j in range(0, n):\r\n total += abs(arr[j] - tempArr[j])\r\n \r\n return total\r\n\r\nn = int(input())\r\narr = list(map(int, input().split()))\r\n\r\nprint(getPermu(arr, n))", "n=int(input())\r\nl=list(map(int, input().split()))\r\nl.sort()\r\nm=0\r\nfor i in range(n):\r\n if(l[i]>=i+1):\r\n m=m+l[i]-i-1\r\n else:\r\n m=m+i+1-l[i]\r\nprint(m)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\na.sort()\r\nres = 0\r\nfor i in range(len(a)):\r\n res += abs(i+1-a[i])\r\nprint(res)", "def buildingPermutations(n,li):\n\tli.sort()\n\tmoves =0\n\tfor i in range(n):\n\t\tmoves+=abs((i+1)-li[i])\n\treturn moves \n\nn=int(input())\nli = [int(x) for x in input().split()]\nprint(buildingPermutations(n,li))", "n = int(input())\r\narr = [int(k) for k in input().split()]\r\narr.sort()\r\ntot = 0\r\nfor i, v in enumerate(arr):\r\n tot += abs(v - (i + 1))\r\n\r\nprint(tot)", "n = int(input())\n\nl = input().split()\nl = [int(i) for i in l]\n\nl.sort()\ncont = 0\nfor i in range(len(l)):\n cont+=abs(l[i]-(i+1))\n\nprint(cont)\n\t \t\t \t \t \t\t\t \t\t \t\t\t \t \t", "def R(): return map(int, input().split())\r\ndef I(): return int(input())\r\ndef S(): return str(input())\r\n\r\ndef L(): return list(R())\r\n\r\nfrom collections import Counter \r\n\r\nimport math\r\nimport sys\r\n\r\nfrom itertools import permutations\r\n\r\nn=I()\r\n\r\na=L()\r\n\r\na.sort()\r\n\r\nans=sum([abs(a[i]-i-1) for i in range(n)])\r\n\r\nprint(ans)\r\n\r\n\r\n\r\n\r\n", "n=int(input())\nl=sorted(list(map(int,input().split())))\nj=1\nc=0\nfor q in range(n):\n c+=abs(j-l[q])\n j+=1\nprint(c)\n", "if __name__ == '__main__':\n n = int(input())\n a = sorted(list(map(int, input().split())))\n sum = 0\n for i in range(0, n):\n wanted = i + 1\n sum += abs(wanted - a[i])\n print(sum)\n\n\t \t \t\t\t\t \t \t\t \t \t \t \t \t\t\t \t", "# Author : code_marshal\r\n\r\nn=int(input());a=list(map(int,input().split()))\r\na.sort();c=0\r\nfor i in range(n):\r\n c+=abs(a[i]-i-1)\r\nprint(c)\r\n", "n=int(input())\r\n\r\na=[int(x) for x in input().split()]\r\na.sort()\r\ncount=0\r\nfor i in range(1, n+1):\r\n count+=abs(a[i-1]-i)\r\nprint(count)\r\n# print(a)\r\n", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\ns = 0\r\nfor i in range(len(arr)):\r\n s += abs(arr[i] - (i + 1))\r\n # print(arr[i], (i+1))\r\nprint(s)", "n=int(input())\r\na=[int(x) for x in input().split()]\r\na=sorted(a)\r\ns=0\r\nfor i in range (0,n):\r\n s+=abs(a[i]-i-1)\r\nprint(s)\r\n\r\n\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\nmoves=0\r\na.sort()\r\nfor i in range(n):\r\n moves+=abs(i+1-a[i])\r\nprint(moves)", "count = map(int, input())\r\nnum_list = map(int, input().split())\r\nnum_list = sorted(num_list)\r\n\r\nstart = 1\r\ntotal = 0\r\n\r\nfor i in num_list:\r\n\ttotal += abs(start - i)\r\n\tstart += 1\r\n\r\nprint(total)", "n=int(input())\r\na=list(map(int,input().split()))\r\na.sort()\r\nan=0\r\nfor i in range(n):\r\n an+=abs((i+1)-a[i])\r\nprint(an)", "n=int(input())\r\na=list(map(int,input().split(\" \")))\r\na.sort()\r\nc=0\r\ny=1\r\nfor x in range(0,n):\r\n if a[x]>y:\r\n c=c+(a[x]-y)\r\n elif a[x]<y:\r\n c=c+(y-a[x])\r\n else:\r\n pass\r\n y+=1\r\nprint(c)", "n=int(input())\r\ntemp=sorted([int(i) for i in input().split(' ')])\r\nind=1\r\nans=0\r\nfor i in temp:\r\n ans+=abs(ind-i)\r\n ind+=1\r\nprint(ans)", "\r\nx = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nanswer = 0\r\nperm = [i for i in range(1,x+1)]\r\nfor i in range(len(l)):\r\n answer+=abs(l[i]-perm[i])\r\nprint(answer)", "I=lambda:list(map(int,input().split()))\r\nn,=I();l=I();l.sort();ans=0\r\nfor i in range(n):\r\n j=i+1;ans+=abs(j-l[i])\r\nprint(ans) ", "while True:\r\n n = int(input())\r\n a = list(map(int, input().split()))\r\n a.sort()\r\n\r\n sum = 0\r\n for i in range(1,n+1):\r\n sum += abs(i-a[i-1])\r\n print(sum,end='')\r\n\r\n break", "n = int(input())\nb = list(map(int, input().split()))\n\nb.sort()\n\nans = 0\nfor i in range(n):\n ans += abs(b[i] - i - 1)\n\nprint(ans)\n", "# coding: utf-8\nn = int(input())\na = [int(i) for i in input().split()]\na.sort()\nans = 0\nfor i in range(1,n+1):\n ans += abs(a[i-1]-i)\nprint(ans)\n", "input()\r\nprint(sum(abs(x - y) for x, y in enumerate(sorted(map(int, input().split())), 1))) # Bruh", "n = int(input())\nlista = input().split()\n\nfor i in range(len(lista)):\n lista[i] = int(lista[i])\n\nlista.sort()\nj = 1\nans = 0\n\nfor i in lista:\n ans = ans + abs(j-i)\n j = j+1\n \nprint(ans)\n\n\n \t\t\t\t\t\t\t\t\t \t\t\t \t\t \t\t \t\t \t", "n = int(input())\n#n, m = map(int, input().split())\n#s = input()\nc = list(map(int, input().split()))\nc.sort()\nl = 0\nfor i in range(n):\n l += abs(c[i] - i - 1)\nprint(l)", "n = int(input())\r\narr = list(map(int, input().split()))\r\n\r\narr.sort()\r\n\r\ncount1 = 0\r\ncount2 = 0\r\n\r\nfor i in range(1, n+1):\r\n count1 += abs(arr[i-1] - i)\r\n count2 += abs(arr[i-1] - (n-1))\r\n\r\nprint(min(count1, count2))\r\n", "n=int(input())\r\na=list(map(int,input().split()))\r\n\r\na.sort()\r\ntotal=0\r\nfor i in range(0,n):\r\n total+=abs(a[i]-i-1)\r\nprint(total)", "n = int(input())\r\narr = list(map(int,input().split()))\r\narr.sort()\r\nk = 1\r\ncount = 0\r\nfor i in range(n):\r\n if arr[i] < 0:\r\n count+=abs(arr[i])+k\r\n else:\r\n if arr[i] >= n:\r\n count+=arr[i]-k\r\n else:\r\n if k <= arr[i]:\r\n count+=arr[i]-k\r\n else:\r\n count+=k - arr[i]\r\n k+=1\r\nprint(count)", "n = int(input())\na = list(map(int, input().rstrip().split()))\nj = 1\nt = 0\na.sort()\nfor x in a:\n t += abs(x - j)\n j += 1\nprint(t)", "# a,b,k = map(int,input().split())\r\n# for t in range(int(input())):\r\nn = int(input()) \r\n# dp = [0](n+1)\r\nl = [int(z) for z in input().split()]\r\nl.sort()\r\nans = 0\r\nfor i in range(n):\r\n ans+= abs((i+1)-l[i])\r\nprint(ans)", "n=int(input())\r\na=list(map(int, input().split()))\r\ns=0\r\na.sort()\r\nfor i in range(n):\r\n s+=abs(a[i]-(i+1))\r\nprint(s)", "\r\n\r\n\r\nn=int(input())\r\na=sorted(list(map(int,input().split())))\r\nres=0\r\ni=1\r\nfor e in a:\r\n res+=abs(e-i)\r\n i+=1\r\nprint(res)\r\n \r\n", "n = int(input())\nvals = list(map(int, input().split()))\n\nvals.sort()\n\ntotal = 0\nfor i in range(1, n+1):\n total += abs(i - vals[i-1])\n\nprint(total)\n\t \t\t\t \t \t \t \t \t\t \t\t\t \t", "\r\na=int(input())\r\nb=list(map(int,input().split()))\r\nb=sorted(b)\r\nans=0\r\ntopi=1\r\nfor i in b:\r\n if i!=topi:\r\n ans=ans+abs(topi-i)\r\n topi=topi +1\r\nprint(ans)", "n=int(input())\r\nl=[int(x) for x in input().split()]\r\nl.sort()\r\ncount=0\r\nfor i in range(len(l)):\r\n count+=abs(l[i]-i-1)\r\nprint(count)", "n = int(input())\nArr = list(map(int,input().split()))\nArr.sort()\nAns = 0\nfor i in range(n):\n\tif Arr[i] > i+1:\n\t\tAns += Arr[i] - (i+1)\n\telse:\n\t\tAns += (i+1) - Arr[i]\t\nprint (Ans)\t\t", "n=int(input())\r\np=input().split()\r\na=[]\r\nfor i in range(n):\r\n a.append(int(p[i]))\r\n i=i+1\r\na.sort()\r\nc=0\r\nfor i in range(n):\r\n c=c+abs((i+1)-a[i])\r\nprint(c)\r\n", "a=int(input())\nb=[int(b) for b in input().split()]\nb.sort()\nc=1\nd=0\nfor i in range(a):\n d+=abs(b[i]-c)\n c+=1\nprint(d)\n", "n = int(input())\r\narr = list(map(int,input().split()))\r\n \r\narr.sort()\r\n\r\nans = 0\r\nfor i in range(n):\r\n ans += abs(i+1-arr[i])\r\n \r\nprint(ans)\r\n", "n=int(input())\r\nl=sorted(list(map(int,input().split())))\r\nj=1 #Building permutation\r\nc=0\r\nfor q in range(n):\r\n c+=abs(j-l[q])\r\n j+=1\r\nprint(c) ", "t = int(input())\r\nres = 0\r\ns = sorted(list(map(int, input().split())))\r\nfor i in range(0, t):\r\n res+=abs(i+1 - s[i])\r\nprint(res)\r\n\r\n", "\r\n\r\n\r\nn = int(input())\r\n\r\nt = list(map(int,input().split()))\r\n\r\n\r\nt.sort()\r\n\r\n\r\nreserve = 0\r\n\r\n\r\nfor j in range(n):\r\n reserve+=abs((j+1)-t[j])\r\n \r\n \r\n \r\n\r\nprint(reserve)\r\n", "n = int(input())\na = list(map(int, input().split(' ')))\na.sort()\n\nprint(sum(list([abs(a[nn] - nn - 1) for nn in range(n)])))\n \t \t \t \t\t\t\t \t \t \t\t\t\t \t\t \t\t", "import math\nimport sys\nimport cmath\nimport string\nimport bisect\nfrom itertools import combinations,permutations\nfrom queue import Queue,LifoQueue,PriorityQueue\nfrom collections import deque,Counter\n\nif __name__==\"__main__\":\n n=int(input())\n sum=0\n a=list1=list(map(int,input().split()))\n a.sort()\n #print(a)\n for i in range(n):\n sum+=abs(i+1-a[i])\n print(sum)\n \n \n\n \t \t\t \t\t\t \t\t\t \t\t\t \t\t\t\t", "n = int(input())\r\na = list(map(int,input().split()))\r\nl = [i for i in range(1,n+1)]\r\ns = 0\r\na.sort()\r\nfor i in range(n):\r\n s+=abs(l[i]-a[i])\r\nprint(s) \r\n ", "n = int(input())\nsequence = [int(i) for i in input().split()]\n\nsequence.sort()\noperacoes = 0\n\nfor i in range(n):\n operacoes += abs(i + 1 - sequence[i])\n\nprint(operacoes)\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(x) for x in input().split()]\r\na.sort()\r\nans = 0\r\nfor i in range(1, n+1):\r\n ans += abs(a[i-1] - i)\r\nprint(ans)\r\n", "n = int(input())\narr = sorted(list(map(int, input().strip().split())))\n\nmoves = 0\nfor i in range(n):\n moves += abs(i + 1 - arr[i])\n\nprint(moves)\n", "n=int(input())\r\nL=list(map(int,input().split(' ')))\r\ncount=0\r\nL=sorted(L)\r\nfor i in range(n):\r\n count=count+abs(L[i]-i-1)\r\nprint(count)", "inp = int(input())\r\nnums = sorted(list(map(lambda a: int(a), input().split(\" \"))))\r\n\r\nans = 0\r\nc = 1\r\nfor i in nums:\r\n ans+=abs(i-c)\r\n c+=1\r\nprint(ans)", "def main():\r\n\tn=int(input())\r\n\ta=list(map(int,input().split()))\r\n\ta.sort()\r\n\tnum=0\r\n\tfor i in range(n): num+=abs(a[i]-i-1)\r\n\tprint(num)\r\n\r\nif __name__=='__main__': main()", "from itertools import count\r\n\r\n\r\nn=int(input())\r\np=sorted([int(x) for x in input().split()])\r\ncount=0\r\nfor i in range(n):\r\n count+=abs(i+1-p[i])\r\nprint(count)", "n = int(input())\narr = list(map(int,input().split(' ')))\n\narr.sort()\nc = 0\nfor i in range(n):\n c += abs(arr[i]- i - 1)\nprint(c)\n", "n = int(input())\r\na = sorted(list(map(int, input().split())))\r\ncount = 0\r\nfor i in range(n):\r\n count += abs(i+1 - a[i])\r\nprint(count)", "n = int(input())\r\na = list(map(int, input().split()))\r\n\r\na.sort()\r\nresult = 0\r\nfor i in range(1, n+1):\r\n result += abs(a[i-1] - i)\r\n\r\nprint(result)", "def main():\n\tn=int(input())\n\ts=list(range(1,n+1))\n\tar= [int(i) for i in input().split()]\n\tar.sort()\n\tcount=0\n\tfor i in range(n):\n\t\tcount+=abs(ar[i]-i-1)\n\tprint(count)\n\treturn 0\n\nif __name__ == '__main__':\n\tmain()\n", "n = int(input())\na = [int(x) for x in input().split()]\na.sort()\nm = 0\nfor x in range(0,n):\n if(x+1 > a[x]):\n m += x + 1 - a[x]\n elif(x+1 < a[x]):\n m += a[x] - x - 1\nprint(m)\n", "n = int(input())\r\nnumbers = [int(x) for x in input().split()]\r\n\r\nnumbers.sort()\r\nmoves = 0\r\n\r\nwhile n > 0:\r\n current = numbers.pop()\r\n moves += abs(n - current)\r\n n -= 1\r\nprint(moves)\r\n", "n=int(input())\nl=list(map(int,input().split(' ')))\nl.sort()\nans=0\nfor i in range(n):\n ans+=abs(l[i]-(i+1))\nprint(ans)\n", "n = int(input())\na = list(map(int, input().split()))\na.sort()\ncount = 0\nfor i in range(n):\n count += abs(i+1 - a[i])\nprint(count)", "n=int(input())\r\nmoves=0\r\nl1=list(map(int,input().split()))\r\nl1.sort()\r\nfor i in range(0,n):\r\n moves+=abs(l1[i]-(i+1))\r\nprint(moves)", "import sys\r\nimport math\r\n\r\nn = int(sys.stdin.readline())\r\na = [int(x) for x in (sys.stdin.readline()).split()]\r\n\r\na.sort()\r\nres = 0\r\nfor i in range(n):\r\n res += int(math.fabs(i + 1 - a[i]))\r\n \r\nprint(res)", "n = int(input())\r\na = list(map(int, input().split()))\r\ncheck = [i for i in range(1, n+1)]\r\na = sorted(a)\r\nans = 0\r\nfor i in range(n):\r\n ans += abs(a[i] - check[i])\r\nprint(ans)", "def main():\r\n size = int(input())\r\n numbers = sorted(map(int, input().split()))\r\n total = 0\r\n \r\n numbers.insert(0, 0)\r\n \r\n for i in range(1, size + 1):\r\n if numbers[i] > i:\r\n total += numbers[i] - i\r\n elif numbers[i] < i:\r\n total += i - numbers[i] \r\n \r\n print(total)\r\n \r\nif __name__ == '__main__':\r\n main()", "d = int(input())\r\ne = [int(i) for i in input().split()]\r\ne.sort()\r\ns = [int(i) for i in range(1, d+1, 1) ]\r\nanswer = 0\r\nfor i in range(d):\r\n if e[i] != s[i]:\r\n answer+=abs(e[i]-s[i])\r\nprint(answer)", "n=int(input())\r\narr=[int(i) for i in input().split()]\r\narr.sort()\r\nans=0\r\nfor i in range(n):\r\n ans+=abs(arr[i]-i-1)\r\nprint(ans)\r\n", "n = int(input())\r\nA = list(map(int, input().split()))\r\nA.sort()\r\nans = 0 \r\nfor i in range(len(A)):\r\n ans += abs(i + 1 - A[i])\r\n\r\nprint(ans)", "n = int(input())\r\narr = list(map(int, input().split()))\r\narr.sort()\r\nprint(sum(abs(x - i - 1) for i, x in enumerate(arr)))\r\n", "n = int(input())\r\nnumbers = list(map(int, input().split()))\r\nnumbers = sorted(numbers)\r\nres = 0\r\nfor i in range(n):\r\n if (numbers[i] != (i + 1)):\r\n res += abs((i+1) - numbers[i])\r\nprint(res)\r\n", "n = int(input())\r\nl = list(map(int,input().split()))\r\nl.sort()\r\nc=0\r\nfor i in range(len(l)):\r\n c+=abs(l[i]-(i+1))\r\nprint(c)", "# http://codeforces.com/problemset/problem/285/C\r\n\r\n\"\"\"\r\nA permutation is defined as an ordered set of integers containing n distinct positive integers.\r\nFor the purpose of this question elements have to be 0 < p <=n\r\n\r\nSort and make the ith element equal to i\r\n\"\"\"\r\n\r\nn = int(input())\r\n\r\np = sorted(list(map(int, input().split())))\r\n\r\nmoves = 0\r\nfor i in range(n):\r\n moves += abs(p[i] - (i+1))\r\n\r\nprint(moves)\r\n", "qtd = int(input())\r\nlista = input().split()\r\nfor i in range(qtd):\r\n lista[i]=int(lista[i])\r\nlista.sort()\r\nvalor = 0\r\ntotal = 0\r\nfor i in range(qtd):\r\n if (lista[i] != i+1):\r\n valor = abs(-lista[i] +i+1)\r\n total +=valor\r\nprint(total)\r\n\t\t", "def main():\r\n n = int(input())\r\n arr = list(map(int, input().split()))\r\n arr.sort()\r\n\r\n current_element = 1\r\n counter = 0\r\n for element in arr:\r\n counter += abs(element - current_element)\r\n current_element += 1\r\n\r\n print(counter)\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()\r\n", "n = int(input())\n\nan= list(map(int,input().split()))\nlista_up=[]\nan=sorted(an)\ncount=0\ncontador=0\nfor i in range(1,n+1):\n lista_up.append(i)\n\nwhile count != n:\n #contador += math.fabs(count+1 - an[count])\n contador = abs(count+1 - an[count]) + contador\n count+=1\n\nprint(contador)\n\t \t\t\t \t \t \t \t \t \t \t", "n = int(input())\r\nl = [int(x) for x in input().split()]\r\nl.sort()\r\nc = 0\r\nfor i in range(n):\r\n c+=abs(i+1-l[i])\r\nprint(c)", "n = int(input())\r\na = [int(j) for j in input().split()]\r\na.sort()\r\ns = 0\r\nfor i in range(n):\r\n\ts += abs(i + 1 - a[i])\r\nprint(s)\r\n", "n=int(input())\r\nli=[int(x) for x in input().split()]\r\nli.sort()\r\ncheck=[i for i in range(1,n+1)]\r\nadd=[0]\r\nsub=[0]\r\nfor i in range(n):\r\n vl=check[i]-li[i]\r\n if vl>0:\r\n add.append(vl)\r\n elif vl<0:\r\n sub.append(abs(vl))\r\nprint(sum(add)+sum(sub))", "n = int(input())\na = sorted(map(int, input().split()))\nprint(sum(abs(i - ai) for i, ai in enumerate(a, 1)))\n", "n=int(input())\r\nl=list(map(int,input().split()))\r\nl.sort()\r\nk=0\r\nfor i in range(n):\r\n k+=abs(l[i]-(i+1))\r\nprint(k) \r\n ", "# MC521 - Desafios de Programacao I - 1s2021\n# Contest: 14/05/2021\n# Problema C: Building Permutation\n\n# leitura do tamanho da sequencia\nn = int(input())\n\n# leitura dos n inteiros\na = list(map(int, input().split()))\n\n# ordena a sequencia\na.sort()\n\n# calcula o menor numero de movimentos para criar a permutacao\nres = 0\nfor i in range(1, n+1):\n res += abs(a[i-1]-i)\n\n# imprime o resultado\nprint(res)\n \t\t \t\t \t \t\t\t \t\t\t \t\t\t \t", "x = int(input())\r\nj = sorted([int(i) for i in list(input().split())])\r\njavab =0\r\nfor i in range(x):\r\n javab+=abs(i+1 - j[i])\r\nprint(javab)", "n=int(input())\r\narr=list(map(int,input().split()))\r\narr.sort()\r\nd=0\r\nfor i in range(0,n):\r\n curr=i+1\r\n currele=arr[i]\r\n d=d+abs(curr-currele)\r\nprint(d)", "import sys\r\n\r\ndef check(a, lr):\r\n partial_sum = [0] * len(a)\r\n for i in range(1, len(a)):\r\n partial_sum[i] = partial_sum[i - 1] + a[i]\r\n is_beautiful = False\r\n for i in range(len(lr)):\r\n l, r = lr[i]\r\n num_one = partial_sum[r] - partial_sum[l - 1]\r\n if num_one > (r - l + 1) - num_one:\r\n is_beautiful = True\r\n break\r\n return is_beautiful\r\n \r\n\r\nimport sys\r\n\r\ndef main():\r\n n = int(sys.stdin.readline())\r\n a = [int(x) for x in sys.stdin.readline().split()]\r\n desired = list(range(1, n + 1))\r\n a.sort()\r\n print(sum(abs(x - y) for x, y in zip(desired, a)))\r\n\r\n\r\nif __name__ == \"__main__\":\r\n main()", "#!/usr/bin/env python3\n\ndef main():\n \n n = int(input())\n ans = 0\n for i,j in zip(sorted(map(int, input().split())), range(1,n+1)):\n ans += abs(j-i)\n\n print(ans)\n\n\nif __name__ == \"__main__\":\n main()\n\n", "n = int(input())\r\nd = [int(x) for x in input().split()]\r\n\r\na = 0\r\nstate = [0 for i in range(n+1)]\r\n\r\nfor num in d:\r\n if num < 1:\r\n a += 1-num\r\n state[1] += 1\r\n elif num > n:\r\n a += num - n\r\n state[n] += 1\r\n else:\r\n state[num] += 1\r\n\r\nodd = []\r\nholes = []\r\n\r\nfor i in range(1, n+1):\r\n cnti = state[i]\r\n if cnti == 0:\r\n holes.append(i)\r\n if cnti > 1:\r\n for _ in range(cnti-1):\r\n odd.append(i)\r\n while odd and holes:\r\n fr = odd.pop()\r\n to = holes.pop()\r\n a += abs(fr-to)\r\nprint(a)", "\r\ndef numMoves(l):\r\n l.sort()\r\n s=0\r\n for i in range(1,len(l)+1):\r\n s+=abs(l[i-1]-i)\r\n return s\r\nn=int(input())\r\nl=list(map(int,input().split()))\r\nassert len(l)==n\r\nprint(numMoves(l))\r\n \r\n", "n=int(input())\r\nA=list(map(int,input().split()))\r\nAns=0\r\nA.sort(reverse=True)\r\nC = n\r\nfor val in A:\r\n Ans += abs(C-val)\r\n C -= 1\r\nprint(Ans)", "n = int(input())\narray = sorted(list(map(int, input().split())))\n\nperm = [x for x in range(1, n + 1)]\n\ncount = 0\n\nfor i in range(n):\n diff = abs(array[i] - perm[i])\n count += diff\nprint(count)\n", "\r\ndef answer(n, a):\r\n a.sort()\r\n moves = 0\r\n for i in range(n):\r\n moves += abs(a[i] - (i+1))\r\n \r\n\r\n return moves\r\n\r\ndef main():\r\n n = int(input())\r\n a = [int(i) for i in input().split()]\r\n print(answer(n, a))\r\n\r\n\r\n return\r\nmain()", "n=int(input())\r\nlst=[int(x) for x in input().split()]\r\nlst.sort()\r\npos,ans=1,0\r\nfor i in lst:\r\n ans+=abs(pos-i)\r\n pos+=1\r\nprint(ans)\r\n", "n=int(input())\r\nl=[int(i) for i in input().split()]\r\nl.sort()\r\nans=[i for i in range(1,n+1)]\r\nprint(sum(abs(ans[i]-l[i])for i in range(n)))", "def go():\n n = int(input())\n a = [int(i) for i in input().split(' ')]\n a.sort()\n x = 0\n for i in range(n):\n x += abs(i + 1 - a[i])\n return x\n\nprint(go())\n", "res=0\r\nx=int(input())\r\ns=list(map(int,input().split()))\r\ns.sort()\r\nfor n in range(x):\r\n if s[n]!=n+1:\r\n res+=abs(n+1-s[n])\r\nprint(res)", "n = int(input())\r\na = list(map(int,input().split()))\r\n\r\na.sort()\r\nres = 0\r\nfor i in range(n):\r\n res+=abs(a[i]-i-1)\r\nprint(res)", "a=int(input())\r\nb=sorted(map(int,input().split()))\r\nprint(sum([abs(b[i]-i-1)for i in range(a)]))\r\n", "n = int(input())\r\narr = sorted([int(i) for i in input().split()])\r\n\r\ntemp = list(range(1,n+1))\r\ns = 0\r\nfor i in range(n): \r\n s+= abs(temp[i]-arr[i])\r\nprint(s)", "n = int(input().strip())\r\nA = list(map(int, input().strip().split()))\r\nA.sort()\r\nans = 0\r\n\r\nfor i, a in enumerate(A):\r\n i = i + 1\r\n ans += abs(i - a)\r\n # print('!', i, i - a, ans)\r\nprint(ans)", "n = int(input())\na = list(map(int, input().split()))\nr = 0\na.sort()\nfor i in range(n):\n if 1 <= a[i] <= n:\n a[a[i]-1], a[i] = a[i], a[a[i]-1]\nfor i in range(n):\n if a[i] != i+1:\n r += abs(i+1-a[i])\n a[i] = abs(i+1-a[i])\nprint(r)\n", "import sys\r\ninput = sys.stdin.readline\r\nx = int(input())\r\n*li, = map(int, input().split())\r\nli.sort()\r\ncnt = 0\r\nfor i in range(x):\r\n\tcnt += abs(li[i]-i-1)\r\nprint(cnt)", "n=int(input())\r\na=[int(i) for i in input().split()]\r\na.sort()\r\nt=0\r\nfor i in range(n):\r\n t+=abs(a[i]-(i+1))\r\nprint(t)\r\n", "l = int(input())\r\nx = list(map(int,input().split()))\r\nx.sort()\r\nc=0\r\nfor i in range(len(x)):\r\n c+=abs(i+1 - x[i])\r\n\r\nprint(c)", "n = int(input())\r\na = [int(x) for x in input().split()]\r\nc = 0\r\na.sort()\r\nfor i in range(len(a)):\r\n c+= abs((i+1)-a[i])\r\nprint(c)", "n = int(input())\r\nnlist = [int(i) for i in range(1,n+1)]\r\nxlist = sorted(int(i) for i in input().split())\r\ncount =0\r\nfor i in range(n):\r\n if xlist[i]>=0:\r\n count = count+ abs(nlist[i]-xlist[i])\r\n else:\r\n count = count+nlist[i]+abs(xlist[i])\r\n\r\nprint(count)", "n = int (input ())\nx = sorted (list (map (int, input ().split (' '))))\na = 0\ns = 0\nwhile a != n:\n s += abs (x [a] - a - 1)\n a += 1\nprint (s)\n", "n=int(input())\r\na=list(map(int,input().strip().split()))\r\nsum=0\r\na.sort()\r\nfor i in range(n):\r\n sum+=abs(a[i]-(i+1))\r\n # print(sum)\r\nprint(sum)", "num_coin= int(input())\nvalue= [int(num_coin) for num_coin in input().split()]\n\n\n\nsort_array=sorted(value)\n\n\nctr=1\nans=0\ndif=0\nfor x in sort_array:\n dif=ctr-x\n ctr=ctr+1\n if dif <=0:\n dif= -dif\n ans=ans+dif\nif ans <= 0:\n ans = - ans\n print(ans)\nelse:\n print(ans)\n ", "a = int(input())\r\nb = sorted([int(x) for x in input().split()])\r\nprint(sum([abs(b[i]-(i+1)) for i in range(a)]))", "n=int(input())\r\na=[0]+sorted(list(map(int,input().split())))\r\nprint(sum(abs(i-a[i]) for i in range(1,n+1)))" ]